January 2015 - Boost-users - lists.preview.boost.org

[interprocess] Determine size of managed_shared_memory
by Kai Benndorf 12 Oct '19

12 Oct '19

Hi all, I want to create a managed_shared_memory in exactly the size I needed. Therefore I do something like this: size = sizeof( common_managed_shared_memory ); size += sizeof( MyClassInSharedMem ); managed_shared_memory segment(create_only, "name", size ); MyClassInSharedMem allocates itself some memory by segment->allocate(). I added this also to the size, but get a boost::interprocess::bad_alloc exception on allocating this additional memory. Are there some magic bytes I forgot to add? Many thanks in advance Kai

3 2

[Range, Phoenix] What am I missing...
by Robert Jones 25 Apr '17

25 Apr '17

Hi Folks Can anyone explain the output of this program... #include <iostream> #include <boost/range/algorithm/copy.hpp> #include <boost/range/counting_range.hpp> #include <boost/range/adaptor/reversed.hpp> #include <boost/range/adaptor/transformed.hpp> #include <boost/phoenix/bind/bind_function.hpp> #include <boost/phoenix/core/argument.hpp> int f( int i ) { return i * 2; } int main( ) { using boost::adaptors::reversed; using boost::adaptors::transformed; using boost::counting_range; using boost::copy; using boost::phoenix::arg_names::_1; copy( counting_range( 1, 5 ) | reversed | transformed( f ), std::ostream_iterator<int>( std::cout, " " ) ); std::cout << std::endl; copy( counting_range( 1, 5 ) | reversed | transformed( bind( f, _1 ) ), std::ostream_iterator<int>( std::cout, " " ) ); std::cout << std::endl; } Which is... 8 6 4 2 1768406272 1768406272 1768406272 1768406272 I'm using Gcc 4.6.2 & Boost 1.53 Thx All.

3 4

[statechart] Passing parameters from event to State Local Storage
by Christophe Bourez 16 Nov '16

16 Nov '16

I need to maintain a parameter into the state local storage. This parameter is initially contained in the event that causes the transition to the target state. I give hereafter a small illustrative example. typename sc = boost::statechart; class EvTest : public sc::event<EvTest> { public: EvTest(std::size_t val) : value(val) {} std::size_t getValue() const { return this->value; } private: std::size_t value; }; class MyStateMachine; class StSource; class StTarget; class StSource : public sc::simple_state<StSource, MyStateMachine> { public: typedef sc::custom_reaction<EvTest> reactions; sc::result react(const EvTest &event) { // How to pass event.getValue() to the target state ? transit<StTarget>(); } }; class StTarget : public sc::simple_state<StTarget, MyStateMachine> { public: StTarget(std::size_t val) : val(value) {} private: std::size_t value; }; Thanks, Christophe

5 6

Some strange boost headers errors
by alfonso santimone 15 May '15

15 May '15

Hi guys, i'm a boost newbie. I've got to include boost libraries in the include path of a VisualStudio 2012 project. When i try to compile i have all these errors. Every errors is related to missing headers ( boost ones and even standard Win ones ) and to synthax errors depending on missing headers i guess. Do someone have any idea on what's wrong here? I just post here a few lines of errors, but the other ones are all of the same kind Error 1 error C2061: syntax error : identifier 'boost' C:\boost_1_57_0\boost\core\ checked_delete.hpp 24 1 csound~ Error 2 error C2059: syntax error : ';' C:\boost_1_57_0\boost\core\checked_delete.hpp 24 1 csound~ Error 3 error C2449: found '{' at file scope (missing function header?) C:\boost_1_57_0\boost\core\checked_delete.hpp 25 1 csound~ Error 4 error C2059: syntax error : '}' C:\boost_1_57_0\boost\core\checked_delete.hpp 67 1 csound~ Error 5 error C2054: expected '(' to follow 'using' C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\cstddef 19 1 csound~ Error 6 error C2061: syntax error : identifier 'using' C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\cstddef 19 1 csound~ Error 7 error C2061: syntax error : identifier 'boost' C:\boost_1_57_0\boost\smart_ptr\detail\sp_nullptr_t.hpp 23 1 csound~ Error 8 error C2059: syntax error : ';' C:\boost_1_57_0\boost\smart_ptr\detail\sp_nullptr_t.hpp 23 1 csound~ Error 9 error C2449: found '{' at file scope (missing function header?) C:\boost_1_57_0\boost\smart_ptr\detail\sp_nullptr_t.hpp 24 1 csound~ Error 10 error C2059: syntax error : '}' C:\boost_1_57_0\boost\smart_ptr\detail\sp_nullptr_t.hpp 41 1 csound~ Error 11 error C2054: expected '(' to follow 'using' C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\cstdlib 19 1 csound~ Error 12 error C2061: syntax error : identifier 'using' C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\cstdlib 19 1 csound~ Error 13 error C2061: syntax error : identifier 'abort' C:\Program Files (x86)\Microsoft Visual Studio many thanks in advance bests alfonso www.elgallorojorecords.com soundcloud.com/alfonsosantimone www.facebook.com/alfonsosantimone

5 11

Re: [Boost-users] lexical_cast between double and string slow in Visual Studio 2013
by David Roberts 07 May '15

07 May '15

> That issue is unknown. I'd really appreciate the investigation. I have done some more investigation, and there are two factors that only cause the slowness when they both occur together. > Try excluding the lexical_cast from test, I have a feeling that this is only MSVC related issue: > > #include <sstream> > #include <string> > > int main (int, char **) > { > for (double count = 0.0; count < 1000000.0; count += 1.41) > { > std::stringstream ss; > ss << count; > std::string result = std::move(ss.str()); > ss.str(std::string()); > > ss << result; > ss >> count; > } > > return 0; > } > Running your test program does not exhibit the problem. It runs in around 3 seconds on my machine when built with either Visual Studio 2010 or Visual Studio 2013. However, changing it very slightly to match more closely what lexical_cast does internally does recreate the problem: #include <sstream> #include <string> int main (int, char **) { for (double count = 0.0; count < 1000000.0; count += 1.41) { std::stringstream ss; ss.unsetf(std::ios::skipws); ss.precision(17); ss << count; std::string result = std::move(ss.str()); ss.str(std::string()); ss << result; ss >> count; } return 0; } The effect of setting the precision to 17 is that lots of 9s appear in the string representations. (The number 17 is what boost::detail::lcast_get_precision(double*) chooses.) Without the precision call the contents of the string called result start off like this: 0 1.41 2.82 4.23 5.64 7.05 8.46 9.87 11.28 12.69 With precision set to 17 they start off like this: 0 1.4099999999999999 2.8199999999999998 4.2299999999999995 5.6399999999999997 7.0499999999999998 8.4599999999999991 9.8699999999999992 11.279999999999999 12.69 This happens for both Visual Studio 2010 and Visual Studio 2013. Then the next difference is that Visual Studio 2013 spends a lot longer handling all the extra 9s. Changing the program so that the double is converted to a string using std::stringstream without a precision call and then back to double using lexical_cast takes about 3 seconds for both Visual Studio 2010 and Visual Studio 2013. It is the combination of having all the extra 9s to parse and using Visual Studio 2013 that makes the test using lexical_cast to go both ways slow. Both Visual Studio 2010 and Visual Studio 2013 do the conversion by calling std::num_get<char,std::istreambuf_iterator<char,std::char_traits<char> > >::do_get() which then calls a function called _Stodx() which is implemented in xstod.c. This function is very different for the two versions. In Visual Studio 2010 it's a relatively thin wrapper around the C function strtod(). In Visual Studio 2013 _Stodx() has got a completely new implementation that's generated by #including xxstod.h with some macros defined. The original C function strtod() is much faster than the new _Stodx() when there are lots of 9s at the end of the strings being parsed. This modification to the program: #include <sstream> #include <string> #include <stdlib.h> int main (int, char **) { for (double count = 0.0; count < 1000000.0; count += 1.41) { std::stringstream ss; ss.unsetf(std::ios::skipws); ss.precision(17); ss << count; std::string result = std::move(ss.str()); ss.str(std::string()); ss << result; char *endptr; count = strtod(ss.str().c_str(), &endptr); } return 0; } has a runtime of about 3 seconds even though it's got to cope with all the 9s. I guess only someone from Microsoft or Dinkumware could comment on why _Stodx() was reimplemented. But the other thing is that by setting precision to 17 lexical_cast is bloating the string representations of the doubles with lots of 9s in both Visual Studio 2010 and Visual Studio 2013. Setting precision to 15 instead prevents this, and makes the original test run faster even with Visual Studio 2013 (about 4 seconds rather than 10). Regards, David

5 4

[boost.geometry] buffer distance strategies
by gchlebus 09 Mar '15

09 Mar '15

Hi, I am wondering whether it would be possible to achieve anisotropic buffering (distances in neg x, pos x, neg y, pos y can have different values) of a polygon using the buffer function with custom-implemented distance strategy. What I want to achieve is presented on the figure 2-b in the following paper: http://itcnt05.itc.nl/agile_old/Conference/mallorca2002/proceedings/posters… I would be grateful to hear from you whether it is doable, and if positive, how one could implement such a custom distance strategy. Best, -- View this message in context: http://boost.2283326.n4.nabble.com/boost-geometry-buffer-distance-strategie… Sent from the Boost - Users mailing list archive at Nabble.com.

3 24

Statechart serialization
by mbrodeur65 04 Mar '15

04 Mar '15

Hi, I'm looking for a solution to serialize boost::statechart objects. I'm aware that this feature is on the statechart library todo list but was wondering if there are any workaround to achieve this with the latest boost release (1.34) ? thanks for your help ! mbrodeur65 -- View this message in context: http://www.nabble.com/Statechart-serialization-tf4131326.html#a11749139 Sent from the Boost - Users mailing list archive at Nabble.com.

4 4

problems building
by Nathan Ridge 28 Feb '15

28 Feb '15

Hi list, I'm trying to build Boost for the first time in a while, and getting unexpected errors. I have a git checkout of the 'master' branch, but I've also tried with the 'boost-1.57.0' tag and had the same problem. The build command I'm running is './b2 --with-filesystem', and the errors I'm getting are of the following form: gcc.compile.c++ bin.v2/libs/system/build/gcc-4.9.0/release/threading-multi/error_code.o In file included from libs/system/src/error_code.cpp:16:0: ./boost/system/error_code.hpp:18:39: fatal error: boost/utility/enable_if.hpp: No such file or directory #include <boost/utility/enable_if.hpp> ^ compilation terminated. "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_DYN_LINK=1 -DNDEBUG -I"." -c -o "bin.v2/libs/system/build/gcc-4.9.0/release/threading-multi/error_code.o" "libs/system/src/error_code.cpp" Full output is here: http://pastebin.com/fgReAxTE Looking at [1], boost/system/error_code.hpp does indeed include <boost/utility/enable_if.hpp>, and looking at [2], there is indeed no 'enable_if.hpp' in boost/utility, so I'm not sure how it's _supposed_ to work. What am I missing? Thanks, Nate [1] https://github.com/boostorg/system/blob/master/include/boost/system/error_c… [2] https://github.com/boostorg/utility/tree/master/include/boost/utility

3 5

[Units] Heterogeneous unit for pressure per time
by Dina Goldshtein 28 Feb '15

28 Feb '15

Hi, I asked about this in StackOverflow<http://stackoverflow.com/questions/27519186/boost-heterogeneous-unit-bar-pe…> but didn't get any answers so I thought I'd try here as well. I need to create a unit which represents pressure per time, specifically Bar per Minute. I tried creating it in the same way as I created similar units before: typedef boost::units::derived_dimension<boost::units::length_base_dimension, -1, boost::units::mass_base_dimension, 1, boost::units::time_base_dimension, -3>::type pressure_roc_dimension; typedef boost::units::unit<pressure_roc_dimension, boost::units::make_system<boost::units::metric::bar_base_unit, boost::units::metric::minute_base_unit>::type> bar_per_minute_unit; BOOST_UNITS_STATIC_CONSTANT(BarPerMinute, bar_per_minute_unit::unit_type); typedef boost::units::quantity<bar_per_minute_unit, double> BarPerMinuteRoC; And then I try to use it: BarPerMinuteRoC bpm = 5.0 * BarPerMinute; But this line doesn't compile with quite a long error trail which I'm having a bit of trouble understanding fully. 1>c:\workspace\externals\boost_1_57_0\include\boost\units\detail\linear_algebra.hpp(197): error C2039: 'item' : is not a member of 'boost::units::dimensionless_type' 1> c:\workspace\externals\boost_1_57_0\include\boost\units\dimensionless_type.hpp(37) : see declaration of 'boost::units::dimensionless_type' 1> c:\workspace\externals\boost_1_57_0\include\boost\units\detail\linear_algebra.hpp(259) : see reference to class template instantiation 'boost::units::detail::determine_extra_equations_skip_zeros_impl<true,false>::apply<RowsBegin,1,1,3,Result>' being compiled 1> with 1> [ 1> RowsBegin=boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::detail::make_zero_vector<0>::type>>,boost::units::detail::determine_extra_equations_skip_zeros_impl<false,true>::apply<boost::units::list<boost::units::list<boost::units::static_rational<-1,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::list<boost::units::static_rational<-2,1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::dimensionless_type>,1,0,3,boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::detail::make_zero_vector<0>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<-1,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::list<boost::units::static_rational<-2,1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::dimensionless_type>>>::next_equations> 1> , Result=boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::detail::make_zero_vector<0>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<-1,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::list<boost::units::static_rational<-2,1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::dimensionless_type>> 1> ] 1> c:\workspace\externals\boost_1_57_0\include\boost\units\detail\linear_algebra.hpp(264) : see reference to class template instantiation 'boost::units::detail::determine_extra_equations<2,false>::apply<boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::detail::make_zero_vector<0>::type>>,boost::units::detail::determine_extra_equations_skip_zeros_impl<false,true>::apply<boost::units::list<boost::units::list<boost::units::static_rational<-1,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::list<boost::units::static_rational<-2,1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::dimensionless_type>,1,0,3,Result>::next_equations>,3,Result>' being compiled 1> with 1> [ 1> Result=boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::detail::make_zero_vector<0>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<-1,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::list<boost::units::static_rational<-2,1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::dimensionless_type>> 1> ] 1> c:\workspace\externals\boost_1_57_0\include\boost\units\detail\linear_algebra.hpp(538) : see reference to class template instantiation 'boost::units::detail::determine_extra_equations<3,false>::apply<Matrix,3,Matrix>' being compiled 1> with 1> [ 1> Matrix=boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::detail::make_zero_vector<0>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<-1,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::list<boost::units::static_rational<-2,1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::dimensionless_type>> 1> ] 1> c:\workspace\externals\boost_1_57_0\include\boost\units\detail\linear_algebra.hpp(828) : see reference to class template instantiation 'boost::units::detail::make_square_and_invert<boost::units::list<boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<0,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::detail::make_zero_vector<0>::type>>>,boost::units::list<boost::units::list<boost::units::static_rational<-1,1>,boost::units::list<boost::units::static_rational<1,1>,boost::units::list<boost::units::static_rational<-2,1>,boost::units::detail::expand_dimensions<0>::apply<boost::units::dimensionless_type,boost::units::dimensionless_type>::type>>>,boost::units::dimensionless_type>>>' being compiled 1> c:\workspace\externals\boost_1_57_0\include\boost\units\detail\linear_algebra.hpp(1032) : see reference to class template instantiation 'boost::units::detail::normalize_units<T>' being compiled 1> with 1> [ 1> T=boost::units::list<boost::units::scaled_base_unit<boost::units::si::second_base_unit,boost::units::scale<60,boost::units::static_rational<1,1>>>,boost::units::list<boost::units::metric::bar_base_unit,boost::units::dimensionless_type>> 1> ] 1> c:\workspace\externals\boost_1_57_0\include\boost\units\detail\linear_algebra.hpp(1051) : see reference to class template instantiation 'boost::units::detail::calculate_base_unit_exponents_impl<false>::apply<T,Dimensions>' being compiled 1> with 1> [ 1> T=boost::units::list<boost::units::scaled_base_unit<boost::units::si::second_base_unit,boost::units::scale<60,boost::units::static_rational<1,1>>>,boost::units::list<boost::units::metric::bar_base_unit,boost::units::dimensionless_type>> 1> , Dimensions=BSII::Units::pressure_roc_dimension 1> ] 1> c:\workspace\externals\boost_1_57_0\include\boost\units\heterogeneous_system.hpp(243) : see reference to class template instantiation 'boost::units::detail::calculate_base_unit_exponents<boost::units::list<boost::units::scaled_base_unit<boost::units::si::second_base_unit,boost::units::scale<60,boost::units::static_rational<1,1>>>,boost::units::list<T,boost::units::dimensionless_type>>,Dimensions>' being compiled 1> with 1> [ 1> T=boost::units::metric::bar_base_unit 1> , Dimensions=BSII::Units::pressure_roc_dimension 1> ] 1> c:\workspace\externals\boost_1_57_0\include\boost\units\unit.hpp(92) : see reference to class template instantiation 'boost::units::detail::make_heterogeneous_system<Dim,System>' being compiled 1> with 1> [ 1> Dim=BSII::Units::pressure_roc_dimension 1> , System=boost::units::homogeneous_system<boost::units::list<boost::units::scaled_base_unit<boost::units::si::second_base_unit,boost::units::scale<60,boost::units::static_rational<1,1>>>,boost::units::list<boost::units::metric::bar_base_unit,boost::units::dimensionless_type>>> 1> ] 1> c:\workspace\externals\boost_1_57_0\include\boost\units\unit.hpp(99) : see reference to class template instantiation 'boost::units::reduce_unit<S1>' being compiled 1> with 1> [ 1> S1=BSII::Units::bar_per_minute_unit 1> ] 1> c:\workspace\foundations\sw_foundations\bsii_common\test\src\units\units_pressure_test.cpp(97) : see reference to class template instantiation 'boost::units::is_implicitly_convertible<BSII::Units::bar_per_minute_unit,Unit>' being compiled 1> with 1> [ 1> Unit=BSII::Units::bar_per_minute_unit 1> ] According to the Boost documentation a homogeneous system can only be composed of linearly independent base units. In my case, I'm trying to mix bars (which in turn "contain" seconds as the time element) with minutes. This sounds problematic to me. But on the other hand, since I don't include mass and length base units in my system it seems to me that the base is independent after all. In any case, I searched online for an example of creating such a heterogeneous unit but didn't find anything comprehensible. Also, I read in the Boost documentation that a heterogeneous unit doesn't preserve information about how it was created. Does this mean I won't be able to, for instance, multiply BarPerMinuteRoC by Minute and get Bar back? Thanks a lot! Dina This message (including any attachments) is intended only for the use of the individual or entity to which it is addressed and may contain materials protected by copyright or information that is non-public, proprietary, privileged, confidential, and exempt from disclosure under applicable law or agreement. If you are not the intended recipient, you are hereby notified that any review use, dissemination, distribution, or duplication of this communication is strictly prohibited. If you are not the intended recipient, please contact the sender immediately by reply email and destroy all copies of the original. Thank you.

2 2

[gsoc15] Attn: We need 2015 mentors and project ideas for Boost!
by Niall Douglas 10 Feb '15

10 Feb '15

Dear Boost community, We are now within one month of the beginning of Google Summer of Code 2015! Last year's GSoC furthered the continuing success of the Boost GSoC programme with the first ever Boost funded extension to a GSoC project (that being Boost.Hana by Louis Dionne mentored by Joel Falcou, congrats to both of them on passing an exceptionally tough selection process), and over $50,000 of Google funding brought to Boost in 2014. We also sent three representatives to last year's mentor summit, including one student whose entire expenses the Boost Steering Committee very generously covered. As part of filling in our application for 2015, we must supply to Google a list of potential GSoC mentors and potential GSoC projects for summer 2015. There are a number of changes to how we design project ideas for students this year intended to improve the GSoC experience for both students and mentors, so please examine the ideas page which outlines those changes at https://svn.boost.org/trac/boost/wiki/SoC2015 and if you have any questions or concerns about those changes, please ask now rather than just before the GSoC deadline. If you think yourself able to mentor a student doing some work on Boost this summer, *please* consider adding a description of the proposed work item and your name to the list. Last year we acquired eight slots from Google and had to disappoint two mentors and students, we hope with the improved selection process we can get back to the ten annual slots we once had. If you want to know more about mentoring a Google Summer of Code funded student work before you nominate yourself, please feel free to ask on the main Boost developers mailing list boost(a)lists.boost.org. Thank you in advance for your time. Niall Douglas (Boost Google Summer of Code admin) Boris Schäling (Boost Google Summer of Code admin) --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

4 7

[Serialization] XML: float format is scientific instead of human-readable since Boost 1.57
by Frank Stähr 09 Feb '15

09 Feb '15

Hello Boost guys, when I switched from Boost 1.55 to 1.57 there was a change in the formation of floats and doubles for xml archives. Look at this example: #include <fstream> #include <boost/archive/xml_oarchive.hpp> class MyClass { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & boost::serialization::make_nvp("accuracy", accuracy); } double accuracy = 0.03; }; int main() { MyClass obj; std::ofstream ofs("sample.xml"); boost::archive::xml_oarchive oa(ofs); oa & boost::serialization::make_nvp("myclass", obj); } I compiled it with VS 2013 for 32 bit. The output file has the line: <m_accuracy>2.99999999999999990e-002</m_accuracy> In Boost 1.55 it was much better human-readable: 0.03. Is this behaviour (this change) intended? In any case, what is the best way to format floats and doubles? (i. e. a manipulator for the ofstream?) Thanks, Frank -- Frank Stähr Technische Universität Berlin Communication Systems Group Sekr. EN1 Einsteinufer 17 10587 Berlin, Germany

5 10

[msm] multi thread access
by Sam Fisher 05 Feb '15

05 Feb '15

Hi Christophe, Did you consider adding build-in multi-thread support? (via policies maybe?) For example, I can guaranteed that all access to sub-fsm within its handlers (process_event()) will be synchronized. The problem is, sub-fsm "knows" about its parent and internally communicates with it (forwarding events etc). I can't control it from my side. typical scenario: an action from sub-fsm struct A_Init { template <typename Evt, typename FSM, typename SourceState, typename TargetState> void operator()(Evt&, FSM& fsm, SourceState&, TargetState&) const { std::thread([=]() mutable { std::lock_guard<std::mutex> l(access); fsm.process_event(some_event()); }).detach(); } }; locking proccess_event() in sub-fsm doesn't help if it alters the root.

2 3

[Variant] Assertion fails at variant/detail/visitation_impl.hpp:207
by Attila Rajmund Nohl 02 Feb '15

02 Feb '15

Hello! I'm using boost-1.55 on Linux. When I run a specific testcase, I get an abort at line 207 in the visitation_impl.hpp file. The comment says that "should never be here at runtime". Unfortunately I don't really understand under what circumstances could runtime end up here - could someone explain how? The variant has a recursive element, i.e. looks something like this: struct Resp; struct SR { } struct AR { std::vector<Resp> resp; } typedef variant< SR, recursive_wrapper<AR> > RMType; struct Resp { RMType rm; }

2 2

boost::ptr_container library question ?
by Danny K 02 Feb '15

02 Feb '15

The ptr_container supports an overload for std::auto_ptr. I was curious if there was a way to add the same functionality for std::unique_ptr. ie an overload that allows a std::unique_ptr to be added to a ptr_vector for example?

2 1

[type_erasure] Problem with iterators
by Marco Guazzone 31 Jan '15

31 Jan '15

Hi, I'm new to the Type Erasure library. I need to write a base class with type-erased forward iterators. To do so I've taken inspiration from the print_sequence.cpp example I've found in the Type Erasure source tree. At the end of the email there is the whole code of my tentative, called "erasure.cpp". Unfortunately, I've problems (presumably) with const iterators which cause the following compile error: $ g++ -Wall -Wextra -pedantic -std=c++11 -I$HOME/sys/src/git/boost -o erasure erasure.cpp -lm *** [begin error] *** In file included from /home/sguazt/sys/src/git/boost/boost/type_erasure/iterator.hpp:20:0, from erasure.cpp:2: /home/sguazt/sys/src/git/boost/boost/type_erasure/operators.hpp: In instantiation of ‘static R boost::type_erasure::dereferenceable<R, T>::apply(const T&) [with R = double&; T = __gnu_cxx::__normal_iterator<const double*, std::vector<double> >]’: /home/sguazt/sys/src/git/boost/boost/type_erasure/detail/instantiate.hpp:91:9: required from ‘static void boost::type_erasure::detail::instantiate_concept7::apply(Concept*, Map*) [with Concept = boost::mpl::vector<boost::type_erasure::forward_iterator<>, boost::type_erasure::same_type<boost::type_erasure::deduced<boost::type_erasure::iterator_value_type<boost::type_erasure::_self> >, double>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>; Map = boost::mpl::map1<boost::mpl::pair<boost::type_erasure::_self, __gnu_cxx::__normal_iterator<const double*, std::vector<double> > > >]’ /home/sguazt/sys/src/git/boost/boost/type_erasure/any.hpp:225:13: required from ‘boost::type_erasure::any<Concept, T>::any(U&&) [with U = __gnu_cxx::__normal_iterator<const double*, std::vector<double> >&; Concept = boost::mpl::vector<boost::type_erasure::forward_iterator<>, boost::type_erasure::same_type<boost::type_erasure::deduced<boost::type_erasure::iterator_value_type<boost::type_erasure::_self> >, double>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>; T = boost::type_erasure::_self]’ erasure.cpp:36:40: required from ‘std::vector<_RealType> base<T>::foo(IterT, IterT) [with IterT = __gnu_cxx::__normal_iterator<const double*, std::vector<double> >; T = double]’ erasure.cpp:77:73: required from here /home/sguazt/sys/src/git/boost/boost/type_erasure/operators.hpp:134:44: error: invalid initialization of reference of type ‘double&’ from expression of type ‘const double’ static R apply(const T& arg) { return *arg; } *** [/end error] *** The GCC version is 4.9.2. Here below is the content of "erasure.cpp". If I comment lines below the comment "THE FOLLOWING WON'T COMPILE" I get no error. So the problem is due to the use of cbegin/cend. *** [erasure.cpp] *** #include <boost/type_erasure/any.hpp> #include <boost/type_erasure/iterator.hpp> #include <boost/type_erasure/operators.hpp> #include <boost/type_erasure/same_type.hpp> #include <boost/mpl/vector.hpp> #include <boost/smart_ptr.hpp> #include <cmath> #include <cstddef> #include <iostream> #include <iterator> #include <vector> namespace mpl = boost::mpl; namespace te = boost::type_erasure; template <typename T> using fwd_iter_impl_t = te::any< mpl::vector< te::forward_iterator<>, te::same_type<te::forward_iterator<>::value_type,T>>>; template <typename T> class base { protected: typedef fwd_iter_impl_t<T> fwd_iter_type; public: virtual ~base() { } template <typename IterT> std::vector<T> foo(IterT first, IterT last) { return this->do_foo(first, last); } private: virtual std::vector<T> do_foo(fwd_iter_type first, fwd_iter_type last) = 0; }; // base template <typename T> class derived: public base<T> { private: typedef typename base<T>::fwd_iter_type fwd_iter_type; std::vector<T> do_foo(fwd_iter_type first, fwd_iter_type last) { const std::ptrdiff_t n = std::distance(first, last); std::vector<T> res(n); for (std::size_t i = 0; first != last; ++first, ++i) { res[i] = std::pow(*first,i)/n; } return res; } }; // derived int main() { std::vector<double> dv; dv.push_back(5); dv.push_back(8); dv.push_back(11); boost::scoped_ptr< base<double> > p_base(new derived<double>()); // begin/end const std::vector<double> foos = p_base->foo(dv.begin(), dv.end()); for (std::size_t i = 0; i < foos.size(); ++i) { std::cout << "foos[" < cfoos = p_base->foo(dv.cbegin(), dv.cend()); for (std::size_t i = 0; i < cfoos.size(); ++i) { std::cout << "cfoos[" << i << "]: " << cfoos[i] << std::endl; } } *** [/erasure.cpp] *** Thank you very much for your help. Best, -- Marco

3 9

[Asio] Handlers of asycn_send_to are called in which order?
by Attila Rajmund Nohl 30 Jan '15

30 Jan '15

Hello! My code sends UDP packets using async_send_to. If all packets are successfully sent, are their handlers called in the same order as the async_send_to calls happened? I mean if my code looks something like this: socket.async_send_to(buffer1, destination, handler1); socket.async_send_to(buffer2, destination, handler2); Is it guaranteed that handler2 is always called after handler1?

3 2

[iostreams] Devices and WOULD_BLOCK
by David Hawkins 30 Jan '15

30 Jan '15

Hi all, Boost newcomer here ... I have an application where I need to encode/decode a serialized data stream. I have used Boost.Iostreams filtering_stream filter to implement encoding and decoding function of each layer. The device interface is via a USB device, eg., think USB-to-Serial device, but without the classic Virtual COM Port or ttyUSB0 layer available. For example, the FTDI FT232H USB-to-MPSSE interface is a suitable cable http://www.ftdichip.com/Products/Cables/USBMPSSE.htm The cable can be used to implement either JTAG or SPI mode access (the mode selection introduces different filters into the filtering_stream stack). I have the filters working, and am working on getting a device working. Rather than deal with the details of the final hardware, I figured I'd simplify the design by creating a client/server design via sockets; the client code matches what I would use with real hardware, while the server code emulates the hardware. I started with this example for a socket device http://stackoverflow.com/questions/12023166/is-there-a-boostiostreams-bidir… The "problem" with the protocol I need to decode (which I have no choice to change) is that the data stream possibly contains escaped characters, so there is no way to know the read data length at the socket layer - its up to the filtering_stream layers to request data from the device layer until a complete packet is decoded. This all sounds good in theory, but in practice the filter layers attempt to read in blocks, and the read size is often larger than the read data that the device layer will supply. This lead to higher-level layers blocking in read(). I figured (perhaps incorrectly) that I could deal with this using non-blocking socket reads. After reading Boost.Iostreams non-blocking support in Section 3.6 http://www.boost.org/doc/libs/1_57_0/libs/iostreams/doc/index.html http://www.boost.org/doc/libs/1_57_0/libs/iostreams/doc/guide/asynchronous.… I modified the socket device example in the link above to; * put the socket in non-blocking mode before constructing the device * change the device 'read' procedure to return WOULD_BLOCK rather than throw an exception This does not work, and its not due to the filter layers. There is an issue with the device layer. Here's the issue ... given a design with a filtering_stream created only with a socket_device and no filters, if I trace the code in a debugger (Boost 1.57.0 source, Visual Studio 2012 under Win7), the socket_device read method call return sequence is boost/iostreams/read.hpp - read_device_impl read template at line 187 - read at line 52 boost/iostreams/detail/adapter/concept_adapter.hpp - device_wrapper_impl read at line 169 - read at line 77 boost/iostreams/detail/streambuf/indirect_streambuf.hpp - line 258 i.e., this source file https://github.com/boostorg/iostreams/blob/master/include/boost/iostreams/d… and this particular block of code // Read from source. std::streamsize chars = obj().read(buf.data() + pback_size_, buf.size() - pback_size_, next_); if (chars == -1) { this->set_true_eof(true); chars = 0; } setg(eback(), gptr(), buf.data() + pback_size_ + chars); The code tests for EOF (-1), but not WOULD_BLOCK (-2), so after this point, since chars is -2, things go bad. So I guess my question now is; Have I just bumped into the as-yet-unsupported part of Boost.Iostreams support for asynchronous I/O? Cheers, Dave PS. I can post example code if anyone wants to trace the code for themselves, I just figured I'd post the question to start with.

4 15

Joining boost::asio::strands
by Cesar Mello 29 Jan '15

29 Jan '15

Hi, After spawning several paralell jobs through calls to boost::asio::spawn inside a loop, is there an easy way to wait for all of them to finish? I would like to join them to aggregate the results. Please can you give me any clue? Thank you a lot! Best regards Cesar

1 0

ProgramOptions: explicit empty string argument
by Akim Demaille 29 Jan '15

29 Jan '15

Hi, I would like to be able to support an empty optional argument for long options. This is something that is supported by gnu getopt_long and argp. Consider for instance a simplified version of the first simple example program: #include <iostream> #include <boost/program_options.hpp> int main(int ac, char* av[]) { namespace po = boost::program_options; using namespace std; po::options_description desc("Allowed options"); desc.add_options() ("help", "produce help message") ("compression", po::value<string>()->implicit_value(""), "set compression level") ; po::variables_map vm; po::store(po::parse_command_line(ac, av, desc), vm); po::notify(vm); if (vm.count("help")) cout << desc << "\n"; else if (vm.count("compression")) cout << "Compression level was set to " << vm["compression"].as<string>() << ".\n"; else cout << "Compression level was not set.\n"; } when I run it, in "typical cases", I have: $ ./a.out Compression level was not set. $ ./a.out --compression=foo Compression level was set to foo. $ ./a.out --compression foo Compression level was set to foo. $ ./a.out --compression Compression level was set to . all of this is fine. However, how can I explicitly pass the empty string? $ ./a.out --compression= libc++abi.dylib: terminating with uncaught exception of type boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::program_options::invalid_command_line_syntax> >: the argument for option '--compression' should follow immediately after the equal sign zsh: abort ./a.out --compression= Of course I could simply to my user that there is a special token, say '-', that means "empty", but it is still more complex than simply accepting the empty string to mean the empty string. Thanks! (There are some stack overflow questions, but they do not address this particular point, --foo='').

1 0

[interprocess] Bizarro File Names (Windows)
by Aaron_Wright＠selinc.com 28 Jan '15

28 Jan '15

I have a service that is running in Windows Server 2008 R2 SP1 that uses shared memory. It runs fine for a month or so, but then stops working correctly. When I check the C:\ProgramData\boost_interprocess\*\ folder, I get a bunch of weird file names, such as: 88C861CD6DE2CF01EBA2F0CC1200D001A4070000EBFFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000ECFFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000EDFFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000EEFFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000EFFFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000F0FFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000F1FFFFFF 88C861CD6DE2CF01EBA2F0CC1200D001A4070000F2FFFFFF 88C861CD6DE2CF014B04F3CC1200D001A40700000AFFFFFF 88C861CD6DE2CF014B04F3CC1200D001A40700000BFFFFFF 88C861CD6DE2CF014B04F3CC1200D001A40700000CFFFFFF 88C861CD6DE2CF014B04F3CC1200D001A40700000DFFFFFF ... (and so on) These are not even close to the names that are supposed to be used. They seem to increment a bit, then shift slightly, and start incrementing again. When I restart the service I get similar named files and patterns, and my services crashes because it can't grow shared memory (presumably because the file names are not correct). I have to restart the box in order to get the correct behavior. Has anyone seen this behavior before? --------------------------------------------------------- Aaron Wright

1 1

[mpl] lazy condition in enable_if
by Sam Fisher 28 Jan '15

28 Jan '15

Hi, I need to run boost::mpl::for_each<> function with template condition, like: boost::mpl::for_each< vector_of_types, boost::mpl::make_identity<boost::mpl::_1> > (Functor< condition >()); I'm trying to implement lazy binding in enable_if. Visual studio fails with error "'X<IsFoo<boost::mpl::_>>::operator ()' : ambiguous call to overloaded function" minimal test code which fail on boost 1.57 #include <boost/mpl/for_each.hpp> #include <boost/mpl/lambda.hpp> #include <boost/mpl/bind.hpp> #include <boost/mpl/vector.hpp> #include <boost/core/enable_if.hpp> #include <iostream> #include <type_traits> template <int> struct dummy { dummy(int) {} }; // from doc struct Foo {}; struct Bar {}; template <typename T> struct IsFoo { typedef typename std::is_same<T, Foo>::type type; }; #define generate_type(_fn) \ typename boost::mpl::apply<boost::mpl::bind< \ boost::mpl::lambda< _fn <boost::mpl::_> >::type, \ boost::mpl::bind<typename boost::mpl::lambda<_Pred>::type, U> \ > >::type #define enable_type generate_type(boost::enable_if) #define disable_type generate_type(boost::disable_if) template <typename _Pred> struct X { template <typename U> enable_type operator()(boost::mpl::identity, dummy<0> = 0) const { std::cout << "enable: " << typeid(U).name() << std::endl; } template <typename U> disable_type operator()(boost::mpl::identity, dummy<1> = 0) const { std::cout << "disable: " << typeid(U).name() << std::endl; } }; int main() { X<IsFoo<boost::mpl::_> > x; x(boost::mpl::identity<Foo>()); x(boost::mpl::identity<Bar>()); return 0; }

1 0

[release] Release schedule changes..
by Rene Rivera 27 Jan '15

27 Jan '15

After some discussion in the Boost Release Team we've decided on an ongoing schedule for releases. Taking into account the realities of how long it takes for authors and the release team to work on a release we've decided to move to *three* releases a year. The targets for the releases will now be: * Spring release on the second Wednesday of April. * Summer release on the second Wednesday of August. * Fall/Winter release on the second Wednesday of December. There will be no January release. This will allow for the fact that most people are on extended holidays during Winter. It will also allow for people to work on larger changes that require more testing time during the longer Winter period. We are also moving to Wednesday release to allow the release managers non-weekend time to work before and after the release. Please consult the Boost calendar for specific dates and merge schedule for the next release. Thanks, the Boost Release Team. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

1 0

[multi state machine/ MSM] execute_queued_events
by Steve Hickman 26 Jan '15

26 Jan '15

In the MSM doc section "Enqueueing events for later processing", you state that "Calling execute_queued_events() will then process all enqueued events (in FIFO order)." You also said in a previous post that MSM is not thread safe, thus requiring an external mechanism to insure thread safety. I don't see a mechanism to execute a single event at a time, which would be preferable if I have to lock the queue while processing events. Having said that, a cursory examination of the "execute_queued_events" code makes me think it only processes one event per call. Which is correct? Is the documentation correct that it actually processes all queued events? If not, can the documentation be corrected? If so, is there a publicly usable call to process a single queued event? If there is no publicly available call for processing a single queued event, how do you recommend processing queued events in a thread safe manner that won't lock the queue for extended periods of time?

4 7

[multi_index] recursive declaration of MIC with a value which contains references of its kind
by Nick Stokes 26 Jan '15

26 Jan '15

I have a value type (Foo) which is supposed to contain references to some multi_index_container of its type, like so: struct Foo { int property1; int property2; FooMIC* other; // this (the pointer value) may or may not be indexed upon }; typedef multi_index_container< Foo, indexed_by < sequenced<> , ordered_unique< member<Foo, int, &Foo::property1> > , ... >> FooMIC; Due to recursive nature of this, I wasn't able to figure out how do declare such a thing (other than unsafely using void* references in Foo). Any ideas? Thanks many, Nick

2 2

Re: [Boost-users] [boost] [Review] Boost.Endian mini-review
by Beman Dawes 26 Jan '15

26 Jan '15

On Sun, Jan 25, 2015 at 6:12 PM, Jason Newton <nevion(a)gmail.com> wrote: > On Sun, Jan 25, 2015 at 8:21 AM, Beman Dawes <bdawes(a)acm.org> wrote: > >> On Sat, Jan 24, 2015 at 2:25 AM, Jason Newton <nevion(a)gmail.com> wrote: >> > I think the only thing that I have no interest in using - a kind way of >> > saying its probably unneeded bloat IMO is the arithmetic types. I prefer >> > native types and using conversion functions. But maybe they could >> improve >> > my code - its something I toss back and forth a little and haven't >> > attempted embracing. >> >> Because even the endian buffer and arithmetic types that appear most >> expensive generate only short sequences of code, the optimizing >> compilers often generate exactly the same instructions regardless of >> endian approach. On Intel machines, that often distills down to a >> single bswap instruction since the value is already in a register. >> >> That isn't always true, so you do need to measure performance of >> various approaches in the context of your actual application. But if >> use of the buffer or arithmetic types would otherwise improve your >> code, please don't reject them without actually testing performance >> first. >> > > Allow me to clarify: I meant code bloat, not speed. Sorry - your original post was clear, but I misinterpreted. I have not systematically measured code bloat. Maybe I can do that at least for some common use cases. Thanks, --Beman

1 0