December 2014 - 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

[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

[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

[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

double free when both shared library and executable linked to boost libraries
by Eric Roller 09 Jan '15

09 Jan '15

I've run into a run-time error (double free) with my software which uses a plug-in architecture. The main executable (a.out) uses dlopen to load a shared library (mylib.so). Both a.out and mylib.so utilize the boost libraries (version 1.54) and are therefore linked separately to them. Depending on whether I use static or dynamic linking to the boost libraries I encounter the double free error as confirmed by address sanitizer using gcc 4.9.2 on linux x86_64. Here is a summary of the results: a.out link mylib.so link double free? static dynamic YES static static NO dynamic dynamic NO dynamic static NO So you can see, only when the main executable used static linking to boost and the shared library used dynamic linking to boost is when I saw the double free error at run time. My question is, why is the error only triggered under that condition and what is the recommended link configuration when using boost libraries for both a shared library and an executable. Ideally, the shared library plug-in should be free to use any boost version with either static or dynamic linking, and it should be independent from (i.e. not conflict with) the main executable's boost version and link type. What compiler/link settings would be necessary to achieve this, if it is even possible at all? -- Eric Roller

3 4

Using static code checkers against the Boost code base
by Hickman, Steve (AdvTech) 08 Jan '15

08 Jan '15

I don't know if there is a policy yet on using static code checkers on the Boost code base as part of the release cycle. Given that the Visual Studio 2012 Analyzer tool I'm using just picked up 3 issues in the 1.57 release (I've posted TRAC items on them already), I suspect not. I would like to encourage such a policy. Boost is, among other things, about quality. This is a way to enhance quality. For people like me who work in safety critical fields, it is vital. I cannot use Boost libraries if they can't be certified. Static analyzers can help insure quality, which makes it easier to qualify these tools. There are many tools available. Some, like CppCheck, are open source. Others are built into development environments (aforementioned VS Analyzer, Clang tools, etc.). Further, I suspect that tool vendors could be convinced it would be good PR to have their tools used by Boost, so I suspect even those with paid licenses can be made available for free. Steve Hickman System Architect, Flight Deck of the Future 480-236-8367

4 10

pass asio socket to another class
by cap 05 Jan '15

05 Jan '15

I have two classes SslHandshake and SslRequest with according to names functionality. After client and server handshakes are done in the SslHandshake, I pass both sockets to SslRequest and start transferring data from server to client. 1. If I is not waiting for finishing of transferring, instance of SslHandshake will be destroyed automatically (in the ~SslHandshake I will destroy both socket objects and transferring in the SslRequest will be aborted). 2. If I start transferring with waiting, after a few iterations SslRequest::ReadSocketOut will be called successfully, but the readSocketHandle will not be called (so, will be called but with timeout error). So, I need to handshake in one class and transfer data into another class. How to prevent destroying instance of SslHandshake until data transferring will be done into SslRequest or how to fix socket reading without callback calling after a few iterations? void SslHandshake::HandshakeInHandle(const bSystem::error_code &error) { TRY { CHECK_BOOST_ERROR { LOG_MSG_DEBUG_KEYWORD(KEYWORD_INCOMING, << "Handshake done"); // --- Transfer with waiting of mutex //IoServicePtr servicePointer((IoService *)&m_SocketIn->get_io_service()); //boost::thread serviceThread(boost::bind(&IoService::IO_SERVICE_THREAD_VOID, servicePointer)); //SslRequest::SharedPtr sslRequest(new SslRequest(m_SocketIn, m_SocketOut)); //sslRequest->Transfer(); SslRequest::SocketPtr socketIn(m_SocketIn); SslRequest::SocketPtr socketOut(m_SocketOut); // --- Transfer with waiting of thread //IoServicePtr servicePointer((IoService *)&m_SocketIn->get_io_service()); //servicePointer->SessionIndex = IndexThis; //boost::thread serviceThread(boost::bind(&IoService::IO_SERVICE_THREAD_VOID, servicePointer)); //SslRequest::SharedPtr request = SslRequest::CreateInstance(m_SocketIn, m_SocketOut); //request->Transfer(); //serviceThread.join(); // --- Transfer with waiting of IO_SERVICE_THREAD_VOID IoServicePtr servicePointer((IoService *)&m_SocketIn->get_io_service()); servicePointer->SessionIndex = IndexThis; SslRequest::SharedPtr request = SslRequest::CreateInstance(/*m_SocketIn, m_SocketOut*/socketIn, socketOut INDEX_THIS_PASS); request->Transfer(); servicePointer->IO_SERVICE_THREAD_VOID(); } } CATCH_LOG_STD CATCH_LOG_ANY } void SslRequest::ReadSocketOut(TransferringBuffer &buffer, SimpleSocketCallback readSocketHandle) { bAsIO::async_read( *m_SocketOut, bAsIO::buffer(buffer), boost::bind( readSocketHandle, SHARED_FROM_THIS, baPlaceholders::error, baPlaceholders::bytes_transferred)); } -- View this message in context: http://boost.2283326.n4.nabble.com/pass-asio-socket-to-another-class-tp4670… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

Boost.DateTime library to synthesise time-series data?
by Riskybiz 05 Jan '15

05 Jan '15

Dear boost-users, It's my first time trying this and hope that someone may be able to enlighten me about which aspects of the Boost.DateTime library will help solve this problem... I have some time-series data which is time stamped with boost::posix_time::ptime values. From this base-series I would like to synthesise higher interval time-series. For example, a base-series of 1 second time-series data could be used to synthesise a time-series of any greater interval; 2 seconds, 5 seconds, 86400 seconds (1 day) etc. Or 1 minute base-series data could be used to synthesise, 2 min, 15min, 60 min time-series etc. It is entirely possible that any given base-series time point could be absent i.e. there could be time gaps in the base-series. I have an idea to use boost::posix_time::time_period to create regularly temporally spaced 'buckets' of the required time interval; into which the base-series data elements would accumulate and thus allow the synthesising of the higher interval time-series. Each 'bucket' represents one higher interval time-series data element. It is important that the 'buckets' are aligned with natural multiples of the time interval for which they are accumulating. So for example a 10 second synthesised time-series would have boost::posix_time::time_period 'buckets' like so at: 1-10, 11-20, 21-30, 31-40, 41-50 & 51-60 seconds time_periods. The first data element of the base-series could fall at any time, it could be on the 7th second of a minute, equally it could be on the 59th minute of an hour. Somehow the first boost::posix_time::time_period 'bucket' for a particular synthesised interval must be set such that it spans the correct period of time and ends on a multiple of the time-series interval which is being synthesised. Put simply, that first base-series data element needs to fall into a correctly aligned time_period 'bucket'. Using Boost.Date_Time how could the boost::posix_time::ptime of the first data element of the base-series be examined and the first time_period 'bucket' be correctly aligned to the relevant begin and end times for the synthesised time-series? I envisage subsequent 'buckets' will be created by incrementing forward in time from the datum of the first. With grateful thanks for any assistance, Riskybiz.

2 1

How to build Boost with VC++ 2013 to target XP/2003 platform?
by Caroline Beltran 01 Jan '15

01 Jan '15

Programs written in VC++ 2012 or 2013 will only run on Windows XP or Windows 2003 when you choose the 'Windows XP (v120_xp)' toolset option in the IDE. Is there some way to set this option from Bjam? P.S. A Stack Overflow user indicated that he got Boost to build under VC++ 2012. I tried his solution under VC++ 2013 but it did not work for some reason completely unknown to me. http://stackoverflow.com/questions/27695187/modify-visual-c-vcvars32-bat-to… Apparently, VC++ 2012/2013 use the Windows 8 SDK and the solution above causes you to use the Windows 7 SDK which is compatible with XP and Windows 2003. Please help me

2 2

Writing custom allocator for use with extended boost vector
by Olumide 31 Dec '14

31 Dec '14

I am considering using boost::container::vector as an alternative to std::vector because std::vector moves when its capacity is exceeded. This is a problem because I am using a lean stack-like allocator that acquires a pool of memory from the heap and manages it my incrementing or decrementing a pointer to the available memory; and automatically moving the vector in the pool is a big no-no for several reasons chief of which is that such moves invalidate the above pointer. My allocator does not use a header block in order to delineate subsequent allocations. This approach works because my application is recursive i.e. objects are allocated and deallocated in a strict LIFO order. Furthermore allocations are typically small (but not constant size) and and are routinely smaller than the size of the canonical header block consisting of a forward and backward pointer. To use such a header block would IMHO be a waste. I'd like to port this allocator to for use with boost::container::vector but I'm not sure entirely sure how much of the boost::container::allocator interface that I need to implement, or if perchance there is already an allocator that does what I am trying to do. Please advise. Regards, - Olumide

1 0

nowide
by Colin Humphries 30 Dec '14

30 Dec '14

Artyom, Please ignore my request for wifstream and wofstream constructors. I see now that these are not needed: windows accepts UTF-16 filenames so of course I just needed to use widen. I am however surprised that your fstream constructors do not directly accept std::string? I feel that the required .c_str() call should be incorporated. Regards, Colin Humphries

1 0

nowide
by Colin Humphries 29 Dec '14

29 Dec '14

Hello Artyom, Please provide wifstream and wofstream constructors. I realise this request may seem contrary to the spirit of your very useful library but wide streams are required by boost::serialize to output to XML (i.e. UTF-8) (Yes, I agree it might be more sensible to update Boost::Serialize). Regards, Colin Humphries

1 0

[filesystem] ISO TS 18822, Technical Specification - File System
by Beman Dawes 29 Dec '14

29 Dec '14

The filesystem TS has been unanimously approved by ISO. 32 countries voted. The document has been forwarded to the ISO Central Secretariat for publication. The current working draft, which is technically the same as the TS but may have editorial corrections, is available at http://cplusplus.github.io/filesystem-ts/working-draft.html Many thanks to all the Boost folks who contributed so much to the Boost library that became the ISO TS! The C++ standards committee Filesystem Study Group will continue to operate, and will issue further TSes as further proposals dictate, and will continue to publish a working paper as issues for the TS are corrected. Happy Boost New Year, --Beman

1 0

[Serialize] Conflict between Serialize and PIMPL?
by Merrill Cornish 28 Dec '14

28 Dec '14

In a normal PIMPL structure, the visible class is responsible for instantiating the private implementation class when the visible class is instantiated. However, when serialization is restoring objects, /it/ thinks it is responsible for instantiating all classes, including the private implementation classes of a PIMPL structure. Who wins? Do I end up with /two/ instances of the private implementation class, one of which is just hanging in mid-air? If you need a more solid background, here is what I'm doing: _Visible class header_: struct Foo_Private; class Foo { public: Foo(); . . ./other//stuff/ . . . . . . /data member-free serialization//code/ . . . private: *const std::unique_ptr< Foo_Private() > d_ptr**;* }; _Visible class code_: Foo::Foo() : *d_ptr(std::make_unique< Foo_Private >())* {...code to initialize Foo_Private data members...} _Private Implementation class header_: struct Foo_Private{ Foo_Private(); . . . /data member declarations/ . . . . . . /data member serialization code/ . . . }; Private implementation class has no code file. It is a header-only class. One alternative I thought of was to /not/ serialize the private implementation class, even though it contains all of the data member that need serializing. Instead, if the private class has data members, say, bar and baz, then the /visible/ class would have a serialize() function that "reached into" the private object using its d_ptr: template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & d_ptr->bar; ar & d_ptr->baz; } So, the visible class (which has no data members of its own) is serialized using data extracted from/inserted into the private class object. Would serialization-by-proxy work?

2 1

Can't build Boost::atomic
by Rui Pacheco 28 Dec '14

28 Dec '14

I've extracted a number of Boost's sub projects as source into my project using bcp. I've set CMake to find the Boost library under my project and not the one installed on my system:https://gist.github.com/ruipacheco/bae9f6694f5760da90b2 <https://gist.github.com/ruipacheco/bae9f6694f5760da90b2> I'm now trying to build my project but Boost::atomic fails while trying to find a file that indeed has not been extracted: https://gist.github.com/ruipacheco/954d0cf0dbb8ece7db75 <https://gist.github.com/ruipacheco/954d0cf0dbb8ece7db75> Is there a pre-processing step I missed with Boost when extracting the libraries? Why is it referencing a file that doesn't exist? -- Rui Pacheco

1 0

[boost-users][boost/numeric/ublas/matrix.hpp]: How to use SQL query to create boost matrix?
by It neophyte 28 Dec '14

28 Dec '14

Dear all I've read some matrix documentation (see below) and did not experience any difficulty in compiling codes: http://www.boost.org/doc/libs/1_42_0/libs/numeric/ublas/doc/matrix.htm However I am using SQL API to query data from c++, and wondering how I can build a boost price matrix. *Ps*: table contains 3 columns: name (*string* type), date (*datetime* type), price (*double* type) 1/While retrieving the query data, my screen output is as follows: aaaaa 2014-12-22 30.1 aaaaa 2014-12-21 27.7 bbbbb 2014-12-22 13.2 bbbbb 2014-12-21 10.3 ccccc 2014-12-22 80.4 ccccc 2014-12-21 79.9 2/My aim is to create a following price matrix (here 2 by 3) as: 30.1 13.2 80.4 27.7 10.3 79.9 Thanks in advance and Regards

1 0

[Test] Calling BOOST_MESSAGE too early results in malformed xml output from Boost.Test
by Martin Ba 26 Dec '14

26 Dec '14

Hi! First, I'm on 1.44 and won't get around to test it on a newer version any time soon, so I'll just throw it in anyway: I've hit the case that when the executable running boost.test is calling BOOST_MESSAGE from a BOOST_GLOBAL_FIXTURE, the message is generated *before* the unit test runner is full initialized (the message "Running ## test cases..." is displayed *after* the Message). When writing xml output, this means that the `<Message>`is generated before the `<TestLog>` root, resulting in malformed xml. I can fix this quite easily on my side, since I've [customized my logger anyway][1], I'll just have to make sure unit_test_log_formatter::log_start is always called first for the xml case, but it's still a buggy thing imho. cheers, Martin [1] : http://stackoverflow.com/questions/26505229/how-to-log-boost-test-output-to…

2 3

[Serialize] How to serialize a class with NO serializable data
by Merrill Cornish 25 Dec '14

25 Dec '14

I applied the PIMPL idiom to one of my larger classes, and it worked great. The visible class records the API with public functions and NO data member except the pointer to the implementation class. That pointer should not be serialized because it is created automatically when the visible class is instantiated. However, if I put NO serialization code in the visible class, the visible class won't (as I understand it) be instantiated when the archive is loaded. (I'm still far away from the point where I can try the archive load for myself.) Should I define the serialize<> function for the class, but with an empty body, since there are no data members to be saved?

2 1

Re: [Boost-users] [boost] [core] [addressof.hpp] [addressof_test2.cpp] ISO C++ says that these are ambiguous
by Sergey Sprogis 25 Dec '14

25 Dec '14

Peter Dimov wrote: > That's probably because of the __SUNPRO_CC workaround at addressof.hpp line 110: > #if (defined( __BORLANDC__ ) && BOOST_WORKAROUND( __BORLANDC__, > BOOST_TESTED_AT( 0x610 ) ) ) || defined( __SUNPRO_CC ) > return boost::detail::addressof_impl<T>::f( v, 0 ); > #else > return boost::detail::addressof_impl<T>::f( > boost::detail::addr_impl_ref<T>( v ), 0 ); > #endif .... Thanks Peter, Exactly, this is the reason for addressof_test2.cpp test's failure with Oracle Studio 12.4 compiler. The only issue here is that there is 5 months old opened bug with proposed fix to cure this: https://svn.boost.org/trac/boost/ticket/10311 I'd really appreciate it if someone will pay attention to this bug, and will insert proposed simple 1 line fix in trunk area. Thanks, Sergey

1 0

[TEST] Tests registered manually never exectued....
by Witold E Wolski 23 Dec '14

23 Dec '14

Im trying to manually register unit tests following the example at : http://www.boost.org/doc/libs/1_57_0/libs/test/doc/html/utf/user-guide/test… My registration code looks like follows: boost::unit_test::test_suite* init_unit_test_suite(int argc, char* argv[]) { boost::unit_test::test_suite* ts2 = BOOST_TEST_SUITE("test_suite2"); ts2->add(BOOST_TEST_CASE(&liveViewTest)); ts2->add(BOOST_TEST_CASE(&checkImageFormats)); ts2->add(BOOST_TEST_CASE(&testRethrowException)); boost::unit_test::framework::master_test_suite().add(ts2); return 0; } The init_unit_test_suite function is entered and returns but non of the added tests is ever exectued. regards -- Witold Eryk Wolski

2 1

[boost] [compute] Review period extended till December 30 + sum up
by Antony Polukhin 23 Dec '14

23 Dec '14

Hi, Review period of Compute library extended till December 30. Some notes and answers to them that were pointed out during review so far: * Some of the algorithms could be tuned for a specific hardware - Library author is working on a auto-tuning solution and improves existing algos * Why OpenCL C API used instead of C++ API? - C++ API had issues, C API allows a bit more control. No C++ API for OpenCL 2.0 * API is not N4105 compatible, library is not N*** compatible - This could be easily fixed by a library that will use Compute as a backend * Some of the algorithms return futures while other work with command queues - This is because of the OpenCL design + async chains/futures would be probably added later * Not all the types of the Khronos API are supported - A few types are not documented yet, there's a patch in the works which would allow the Khronos C++ types to be passed into Compute algorithms * A few type related errors could be detected at compile time - This will be fixed, more asserts would be added to runtime only checkable places. Report issues to the tracker https://github.com/kylelutz/compute/issues * On small data sets CPU algorithm would work faster than a GPGPU. How about implicitly dispatching algo on CPU in those cases? - The call on whether to execute the algorithm should be left up to the user. While library author agrees that this would be a useful feature, he just don't think Compute is the right place for that logic. * How about providing way to do chains of async operations - This is a big task that will be solved some day. * How about providing Boost.ASIO like error handling via throw and error_code - Implementing an approach like ASIO's wouldn't be that difficult. Thanks to all the reviewers for spending their time and providing useful comments so far! -- Best regards, Antony Polukhin

1 0

interprocess::rbtree_best_fit assertion failure with vector resize
by John Harris 22 Dec '14

22 Dec '14

I encountered this with 1.56 and 1.57 under heavy allocation load where I repeatedly resize an interprocess vector<unsigned char>. The only way I was able to get around it was to switch to the simple_seq_fit allocation algorithm. The assertion is assert(FALSE), and so I'm wondering if the algorithm doesn't handle all cases where there is a single-byte type for the vector. The stack below is from a core dump, and so the "Cannot access memory" errors are not necessarily indicative of bad pointers. #3 0x0000003dc2a2b820 in __assert_fail () from /lib64/libc.so.6 #4 0x00007f869a166793 in boost::container::container_detail::insert_value_initialized_n_proxy<boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> >, unsigned char*>::copy_n_and_update (this=0x7f8698264b80) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/detail/advanced_insert_int.hpp:118 #5 0x00007f869a165fd6 in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::priv_forward_range_insert_expand_backwards<boost::container::container_detail::insert_value_initialized_n_proxy<boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> >, unsigned char*> > ( this=0x7f85adc00a40, new_start=0x7f85adc165a0 <error: Cannot access memory at address 0x7f85adc165a0>, new_capacity=199624, pos=0x7f85adc31974 <error: Cannot access memory at address 0x7f85adc31974>, n=101192, insert_range_proxy=...) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:2783 #6 0x00007f869a164c0b in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::priv_forward_range_insert_no_capacity<boost::container::container_detail::insert_value_initialized_n_proxy<boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> >, unsigned char*> > (this=0x7f85adc00a40, pos=..., n=101192, insert_range_proxy=...) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:2265 #7 0x00007f869a1639ec in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::priv_forward_range_insert<boost::container::container_detail::insert_value_initialized_n_proxy<boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> >, unsigned char*> > (this=0x7f85adc00a40, pos=..., n=101192, insert_range_proxy=...) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:2328 #8 0x00007f869a16241a in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::priv_forward_range_insert_at_end<boost::container::container_detail::insert_value_initialized_n_proxy<boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> >, unsigned char*> > (this=0x7f85adc00a40, n=101192, insert_range_proxy=...) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:2365 #9 0x00007f869a1604e5 in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::priv_resize<boost::container::value_init_t> (this=0x7f85adc00a40, new_size=178780, u=...) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:2151 #10 0x00007f869a15de56 in boost::container::vector<unsigned char, boost::interprocess::allocator<unsigned char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void, long, unsigned long, 0ul>, 0ul>, boost::interprocess::iset_index> > >::resize (this=0x7f85adc00a40, new_size=178780) at /home/jharris/usr/local/boost/include/boost-1_57/boost/container/vector.hpp:1213 #

1 0

[Random] normal distribution different behaviour 1.55 vs 1.57
by Thomas M 21 Dec '14

21 Dec '14

Hi, I have just switched an existent project from boost 1.55.0 to 1.57.0 and my test suites diagnosed a divergence in program (a simulation) results. I have tracked down the issue to different behaviour in the normal distribution random variates generator. Below is a simple program (run under VS 2012, Update 4) that outputs random variates for a uniform and a normal distribution; comparing the output between 1.55.0 and 1.57.0 it turns out that the first bunch of uniformly distributed variates is identical, and then all others variates (both bunches of normally distributed variates as well as the second bunch of uniformly distributed variates) diverge. Neither for 1.56.0 nor 1.57.0 does the change-log list an update to the random numbers library, so first I am puzzled why the libraries behave differently (though [Math] has undergone some changes -> propagation to [Random]?). Second, it is not clear to me why for the first bunch of uniformly distributed variates the results are identical, while for the second, after normally distributed variates were generated, the are not. It appears that the generation of normally distributed variates changes the whole state of the random numbers engine in a different manner [e.g multiple engine calls ??]. Any insight into what is going on here is much appreciated. And foremost: Is any of 1.55 or 1.57 bugged, that is one should be clearly preferred over the other? many thanks, Thomas #include <ostream> #include <iostream> #include <fstream> #include "boost/random.hpp" void test_rng() { typedef boost::mt19937 rnengine_t; typedef boost::uniform_01<double> uniform_distr_t; typedef boost::normal_distribution<double> normal_distr_t; typedef boost::variate_generator<rnengine_t &, uniform_distr_t> uniform_gen_t; typedef boost::variate_generator<rnengine_t &, normal_distr_t> normal_gen_t; uniform_distr_t uniformDistr; normal_distr_t normalDistr(0, 1); rnengine_t rnEngine; rnEngine.seed(100); uniform_gen_t uniformGen(rnEngine, uniformDistr); normal_gen_t normalGen(rnEngine, normalDistr); std::ofstream outFile("randomNumbers.txt"); outFile.precision(16); int n = 20; for (int outer = 0; outer < 2; ++outer) { for (int i = 0; i < n; ++i) outFile << "Uniform-distr variate #" << (n*outer) + i + 1 << ": " << uniformGen() << std::endl; for (int i = 0; i < n; ++i) outFile << "Normal-distr variate #" << (n*outer) + i + 1 << ": " << normalGen() << std::endl; } } int main() { test_rng(); return 0; }

5 8

Boost.container iterator_traits and flat_map
by gast128 21 Dec '14

21 Dec '14

Hello all, I have a problem here which boils down to the non-constness of iterator_traits for const_iterator of flat_map: void Foo() { typedef boost::container::flat_map<int, int> Int2IntFmap; Int2IntFmap::const_iterator it2; std::iterator_traits<Int2IntFmap::const_iterator>::value_type::first_type& r2 = it2->first; } 1>d:\develop\shared\main\test\testcommon\testgeneral\nctstgenhmhandlemap.cpp(59): error C2440: 'initializing' : cannot convert from 'const int' to 'int &' Anyone an idea or should I use decltype instead?

1 0

[multi_index] any interests extending ord_index_node to argumented ord_index_node
by fractal 19 Dec '14

19 Dec '14

dear all: i'm a game developer, and my projects used a lot of multi_index(thanks, it's a great library). one of main problems of game development is to rank players according to they level. usually we use boost::interprocess::map for the task. but more, players should know which rank they are and who is at rank 10000 (for example). these requirements lead to two new methods for map: iterator find_by_rank(int idx) int rank(iterator i) i implemented an argumented rbtree data structure according to "Algorithms and Data Structures " (see the attachment rank_tree.hpp), and latter i find coutertree which is in boost review schedule. but IMHO, the best way is to integrate it to multi_index, and if anyone interests, i can do this by some efforts. yours sincerely

1 0

RFC: library for fractal algorithms
by legalize+jeeves＠mail.xmission.com 17 Dec '14

17 Dec '14

[Please do not mail me a copy of your followup] I'm interested in talking with other folks about the best way to generalize various fractal algorithms in the style of the standard library: iterators, containers and algorithms. If there are any libraries that already exist that apply to this sort of code, I'd love to hear about them. Most fractals consist of iterating a sequence for a point in the complex plane. The iterating sequence is parameterized for each point in the complex plane and some characteristic of the iterating sequence is used to color that point. The result is an image. For instance, the classic Mandelbrot fractal is: z <- z^2 + c z0 := 0 The complex number 'c' changes for each point in the complex plane. This sequence is iterated until norm(z) > 4, or some maximum iteration count is reached. Pixels in the image correspond to each value of 'c' and are typically colored according to the number of iterations needed until norm(z) exceeded 4. There are a couple things that make for interesting variation in the algorithms used in rendering fractal images: - choice of formula to iterate in the complex plane - parameters for deciding the "bailout" criteria: - iteration counts - predicate function on z, i.e. [](complex<float> z){ return norm(z) > 4; } Iterating until the bailout test passesis the simplest mechanism, but there are gains to be made by applying more sophisticated mechanisms. A significant optimization is to look for cycles in the sequences. With very large iteration counts, detecting cycles in the iteration can save significant amounts of time. The cycle detection algorithm is basically from Knuth and isn't specific to fractals but ends up being mixed together with the Mandelbrot set computation in most programs. This seems to be another opportunity to use generic composition in order to apply this orthogonal feature to any iterated formula in the complex plane. I did a little experiment casting the Mandelbrot formula as an iterator and got the code at the end of this message. Ideally I'd like to explore approaches that result in code that is ignorant of the underlying representation of a complex number in order to have algorithms that can be applied to arbitrary precision numeric types. My little experiment works, but even just looking at this little experiment makes me think that the mandelbrot iterator is doing too much: it is performing the z <- z^2 + c business, but it is also doing the bailout test and these seem to be separate responsibilities. #include <complex> #include <iostream> #include <iterator> #include <vector> class mandelbrot : public std::iterator< std::input_iterator_tag, std::complex<float>, unsigned> { public: mandelbrot() : c_{}, iter_{}, max_iter_{}, bailout_{}, z_{}, bailed_out_{true} { } mandelbrot(std::complex<float> const& c, int max_iter = 256, float bailout = 2.0f) : c_{c}, max_iter_{max_iter}, bailout_{bailout*bailout}, iter_{0}, z_{0.f, 0.f}, bailed_out_{false} { } mandelbrot& operator++() { z_ *= z_; z_ += c_; bailed_out_ = ++iter_ > max_iter_ || std::norm(z_) >= bailout_; return *this; } bool operator==(mandelbrot const& rhs) const { if (bailed_out_ && rhs.bailed_out_) { return true; } if (bailed_out_ != rhs.bailed_out_) { return false; } return z_ == rhs.z_; } std::complex<float> const& operator*() const { return z_; } private: std::complex<float> c_; int const max_iter_; float const bailout_; int iter_; std::complex<float> z_; bool bailed_out_; }; bool operator!=(mandelbrot const &lhs, mandelbrot const &rhs) { return !(lhs == rhs); } int main() { float const r_min = -3.0f; float const r_max = 1.0f; float const i_min = -2.0f; float const i_max = 2.0f; std::vector<float> imag; imag.resize(24); for (int y = 0; y < 24; ++y) { imag[y] = i_min + (i_max - i_min)*(23 - y)/24.0f; } std::vector<float> real; real.resize(80); for (int x = 0; x < 80; ++x) { real[x] = r_min + (r_max - r_min)*x/80.0f; } std::string printables; for (int i = 32; i < 128; ++i) { printables.push_back(char(i)); } for (int y = 0; y < 24; ++y) { float const im = imag[y]; for (int x = 0; x < 80; ++x) { float const re = real[x]; mandelbrot end; mandelbrot it{std::complex<float>{re, im}}; unsigned count = std::distance(it, end); std::cout << printables[count % printables.size()]; } std::cout << '\n'; } } -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

1 1

c++/cli & file.h
by It neophyte 16 Dec '14

16 Dec '14

hi quick question: could boost headers (.h) be complied in c++/cli project? I was told, no by someone, but need further feedback to be sure. Thanks

10 13

[endian] Heads up: breaking name changes coming
by Beman Dawes 15 Dec '14

15 Dec '14

Boost.Endian develop branch is about to have major changes merged in as part of the preparation for a mini-review. AFAICR, the breaking changes are limited to header, class, and function name changes, but there are a lot of hopefully non-breaking changes so I could easily be wrong about that. If you are currently using Boost.Endian develop branch, you will need to change your code accordingly. It would make sense to wait a few days until the mini-review merge is complete and any fixes required by regression test failures are fixed. Thanks for your patience, --Beman

1 0

Does shared_ptr support interface pointers without a virtual destructor
by John Selbie 15 Dec '14

15 Dec '14

What is the general guidance with using shared_ptr on interfaces that do not have virtual destructor? Take the following code sample: class IFoo{public: virtual void M1() = 0;}; class Foo : public IFoo{public: void M1() {} Foo() { std::cout << "Foo constructor\n";} ~Foo(){std::cout << "~Foo destructor\n";}}; I think we all know that this is not safe: { IFoo *pFoo = new Foo(); delete pFoo;} Since IFoo is missing a virtual destructor, then ~Foo() will not be invoked in the above case. So let's switch to using std::shared_ptr { std::shared_ptr<IFoo> spFoo(new Foo());} std::shared_ptr has a templated constructor that creates a "deleter". So when "spFoo" goes out of scope, the ~Foo destructor is properly invoked even though it's of type shared_ptr<IFoo>. But since my code targets older compilers, I have made use of Boost. But attempting this: { boost::shared_ptr<IFoo> spFoo(new Foo());} Generates a lot of scary warnings when compiling with -Wall. In file included from /home/jselbie/boost_1_57_0/boost/checked_delete.hpp:15:0, from /home/jselbie/boost_1_57_0/boost/smart_ptr/shared_ptr.hpp:26, from /home/jselbie/boost_1_57_0/boost/shared_ptr.hpp:17, from main.cpp:9:/home/jselbie/boost_1_57_0/boost/core/checked_delete.hpp: In instantiation of ‘void boost::checked_delete(T*) [with T = Foo]’:/home/jselbie/boost_1_57_0/boost/smart_ptr/detail/shared_count.hpp:134:38: required from ‘boost::detail::shared_count::shared_count(Y*) [with Y = Foo]’/home/jselbie/boost_1_57_0/boost/smart_ptr/shared_ptr.hpp:271:47: required from ‘void boost::detail::sp_pointer_construct(boost::shared_ptr<X>*, Y*, boost::detail::shared_count&) [with T = IFoo; Y = Foo]’/home/jselbie/boost_1_57_0/boost/smart_ptr/shared_ptr.hpp:349:58: required from ‘boost::shared_ptr<T>::shared_ptr(Y*) [with Y = Foo; T = IFoo]’main.cpp:36:44: required from here/home/jselbie/boost_1_57_0/boost/core/checked_delete.hpp:34:5: warning: deleting object of polymorphic class type ‘Foo’ which has non-virtual destructor might cause undefined behaviour [-Wdelete-non-virtual-dtor] Now despite the warning about the non virtual destructor, the correct behavior of having ~Foo() invoked works. The interesting thing is that marking the destructor of the *derived* class (virtual ~Foo) makes the warning go away. It's like it's warning me that if I ever inherit from Foo, then I might run into issues - not of any immediate problems. Should I never user shared_ptr with interface pointers that lack a virtual destructor? Always declare a virtual destructor? What is the guidance here? jrs

2 1

[boost] [compute] Review period starts today December 15, 2014, ends on December 24, 2014
by Antony Polukhin 15 Dec '14

15 Dec '14

Dear All, Review of the Compute library starts today on Mon 25st of December 2014 and will last for ten days. The Compute library provides a C++ interface to multi-core GPGPU and CPU computing platforms based on OpenCL. The project is hosted on GitHub at https://github.com/kylelutz/compute. Docs are available at http://kylelutz.github.io/compute/ Sources could be downloaded as a ZIP archive via https://github.com/kylelutz/compute/archive/master.zip Some pre-official reviews could be found in Boost Library Incubator: http://rrsd.com/blincubator.com/reviews/?library_id=669 Please, answer the following questions in your review: 1. What is your evaluation of the design? 2. What is your evaluation of the implementation? 3. What is your evaluation of the documentation? 4. What is your evaluation of the potential usefulness of the library? 5. Did you try to use the library? With what compiler? Did you have any problems? 6. How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? 7. Are you knowledgeable about the problem domain? And finally, every review should answer this question: 8. Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. -- Best regards, Antony Polukhin

1 0

[endian] Boost.Endian library added for 1.57.0
by Beman Dawes 14 Dec '14

14 Dec '14

The library provides integer and floating point types and conversion functions for portable byte ordering regardless of processor endianness. Although the primary uses are for file or network I/O, it is also useful for unaligned integers or floats, or for 3, 5, 6, and 7 byte integers. The library's predecessors have been in use for thirty years and developed independently multiple times. The repository is https://github.com/boostorg/endian The documentation is online at https://boostorg.github.io/endian/ See https://boostorg.github.io/endian/index.html#Release-history for changes since the Formal Review. No need to report "Inspection Report" problems; those will be cleaned up before 1.57.0 ships. Please do report any other problems or concerns, since the time between now and when the 1.57.0 beta ships in effect acts a mini-review period. If anyone has access to a big-endian platform with a modern C++ compiler, please, please run the endian test suite and report the results. All testing and use in recent years has been on little-endian platforms, so big-endian platform testing is a worry. Thanks for you patience, --Beman

3 2

:typedef mt19937, normal_distribution, variate_generator & data storage into vector
by It neophyte 14 Dec '14

14 Dec '14

hi all, does someone know why my vstore vector returns a 0 value? any suggestion to improve the code would be appreciated.cheers. *aim*: *generating 260 random numbers following a standard normal distribution, then store the values into a vector (here: vstore)* vector<double>vstore; vstore.resize(260); typedef mt19937 ALEA; typedef normal_distribution<double> STGAUSSIAN; typedef variate_generator<ALEA,STGAUSSIAN> GENALEA; ALEA ale; STGAUSSIAN stgauss(0,1); GENALEA gen(ale,stgauss); for (int i=0;i<=260;i++) { //cout<<gen()<<endl; //system("pause"); vstore.push_back(gen()); cout<<vstore[i]<<endl; }

2 2

[serialization] slow compile times with archive register_type
by Elizabeta 14 Dec '14

14 Dec '14

Hi I am using custom archive classes. Problem is BOOST_CLASS_EXPORT_GUID is not working with the custom archive classes, i.e I am getting unregistered class exceptions all over the place, when saving derived class with base pointer. Here is link to my question http://boost.2283326.n4.nabble.com/BOOST-CLASS-EXPORT-GUID-with-custom-arch… about this. So I found other way for exporting the classes, i.e with archive register type. Exporting the classes with register_type is working well, no more unregistered_class exceptions, but probelm is it increase the compile times of my project by more than half. Project compile time with register_type is 40-45 minutes, and without 18-19 minutes. Here is how I am using the register_type : //RegisterMyTypes.h template<class Archive> void register_all_types(Archive&); //RegisterMyTypes.cpp #include "A.h" #include "B.h" // other classes includes template<class Archive> void register_all_types(Archive& a) { ar.register_type (); ar.register_type(); ..... all other classes which is maybe 100 } // explicit instiantion of all my archive classess template void register_all_types(XmlWOArchive& ar); template void register_all_types(XmlWIArchive& ar); template void register_all_types(DbgXmlWOArchive& ar); template void register_all_types(DbgXmlWIArchive& ar); template void register_all_types(BinaryOArchive& ar); template void register_all_types(BinaryIArchive& ar); template void register_all_types(CloneBinaryOArchive & ar); template void register_all_types(CloneBinaryIArchive & ar); template void register_all_types(DuplicateBinaryOArchive & ar); template void register_all_types(DuplicateBinaryIArchive & ar); I am calling register_all_types before doing the serialization/deserialization. And I am doing the serialization/deserialization in multiple functions in my project not just in one place, but this should not be problem, I mean I have the registration done only in one cpp file i.e RegisterMyTypes.cpp, so the templates should be instantiated only in this file, and it should be slow, right ? Thank you for any help -- View this message in context: http://boost.2283326.n4.nabble.com/serialization-slow-compile-times-with-ar… Sent from the Boost - Users mailing list archive at Nabble.com.

2 4

Re: [Boost-users] Using static code checkers against the Boost code base
by Niall Douglas 13 Dec '14

13 Dec '14

On 11 Dec 2014 at 13:38, boost-users(a)lists.boost.org wrote: > I was given some time to implement automated nightly testing for > Boost.Thread which is now integrated and appears as a dashboard on > https://github.com/boostorg/thread/tree/develop. > > I'll mux in the clang and MSVC static analysers later today. This now done, and as can be seen on the Boost.Thread CI dashboard we currently see 30 of 90 build targets have problems. We'll get to fixing those over the next few days. After that we'll hopefully keep everything all blue from now on. Thanks for raising the problem, it caused resources to be made available. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

1 0

[Test] Reviving BOOST_*_CLOSE_COLLECTIONS request
by Ghyslain Leclerc 13 Dec '14

13 Dec '14

Hello, We are in the process of creating unit tests for our in-house application development and have selected Boot.Test as a library. I’ve been toying with the library for a while now and there is one feature that I feel is missing. It is the capacity to check a whole collection for close values, i.e. the “close” equivalent of BOOST_*_EQUAL_COLLECTIONS. From what I can tell, this has already been discussed (old threads from 2007 http://boost.2283326.n4.nabble.com/Boost-Test-request-BOOST-CLOSE-COLLECTIO…) and did not end-up in the library (at least from what I can tell from my version of boost (1.57). Other more recent threads (2012, http://boost.2283326.n4.nabble.com/test-BOOST-TEST-universal-testing-tool-t…) seem to suggest that the library is undergoing under the hood changes (I might be wrong here). So this request might be completely inappropriate, given the timing. Nevertheless, I have come up with an implementation for those macros. I wanted to share them here on the list (code at the end of the mail). It might be useful for some people. If Gennadiy (library maintainer) reads this mail and finds the macros adequate for use, great. If not, too bad. Anyhow, thanks. Ghyslain namespace boost_hlp { template <typename Left, typename Right> inline ::boost::test_tools::predicate_result close_coll_impl( Left lt_begin, Left lt_end, Right rt_begin, Right rt_end, ::boost::test_tools::percent_tolerance_t<double> tolerance ) { ::boost::test_tools::predicate_result res( true ); ::std::size_t pos = 0; for( ; lt_begin != lt_end && rt_begin != rt_end; ++lt_begin, ++rt_begin, ++pos ) { if( !(::boost::test_tools::check_is_close( *lt_begin, *rt_begin, tolerance )) ) { res = false; res.message() << "\nMismatch in a position " << pos << ": " << *lt_begin << " != " << *rt_begin; } } if( lt_begin != lt_end ) { std::size_t r_size = pos; while( lt_begin != lt_end ) { ++pos; ++lt_begin; } res = false; res.message() << "\nCollections size mismatch: " << pos << " != " << r_size; } if( rt_begin != rt_end ) { std::size_t l_size = pos; while( rt_begin != rt_end ) { ++pos; ++rt_begin; } res = false; res.message() << "\nCollections size mismatch: " << l_size << " != " << pos; } return res; } } // namespace boost_hlp #define CLOSE_COLLECTIONS_IMPL( L_begin, L_end, R_begin, R_end, tolerance, TL ) \ BOOST_TEST_TOOL_IMPL( \ check_impl,\ ::boost_hlp::close_coll_impl( (L_begin), (L_end), (R_begin), (R_end), \ ::boost::test_tools::percent_tolerance_t<double>((tolerance) )), "", TL, CHECK_EQUAL_COLL ), \ 5, \ BOOST_STRINGIZE( L_begin ), BOOST_STRINGIZE( L_end ), \ BOOST_STRINGIZE( R_begin ), BOOST_STRINGIZE( R_end ),\ BOOST_STRINGIZE( ::boost::test_tools::percent_tolerance_t<double>((tolerance) ) ) ) \ /**/ #define WARN_CLOSE_COLLECTIONS( L_begin, L_end, R_begin, R_end, tolerance ) \ CLOSE_COLLECTIONS_IMPL( (L_begin), (L_end), (R_begin), (R_end), (tolerance), WARN ) #define CHECK_CLOSE_COLLECTIONS( L_begin, L_end, R_begin, R_end, tolerance ) \ CLOSE_COLLECTIONS_IMPL( (L_begin), (L_end), (R_begin), (R_end), (tolerance), CHECK ) #define REQUIRE_CLOSE_COLLECTIONS( L_begin, L_end, R_begin, R_end, tolerance ) \ CLOSE_COLLECTIONS_IMPL( (L_begin), (L_end), (R_begin), (R_end), (tolerance), REQUIRE )

3 3

Re: [Boost-users] [Test] Reviving BOOST_*_CLOSE_COLLECTIONS request
by Ghyslain Leclerc 13 Dec '14

13 Dec '14

> Hello, > > We are in the process of creating unit tests for our in-house application > development and have selected Boot.Test as a library. ?I?ve been toying > with the library for a while now and there is one feature that I feel is > missing. ?It is the capacity to check a whole collection for close values, > i.e. the ?close? equivalent of BOOST_*_EQUAL_COLLECTIONS. Devel Boost.Test can do much better: BOOST_AUTO_TEST_CASE(foo) { vector<float> a, b; BOOST_TEST( a == b, tolerance(1e-5) ); BOOST_TEST( a <= b, percent_tolerance = 1e-5 ); } BOOST_TEST_DECORATOR( -tolerance = 1e-7 ) BOOST_AUTO_TEST_CASE(goo) { vector<float> a, b; BOOST_TEST( a > b ); BOOST_TEST( a != b ); } e.t.c. Gennadiy Gennadiy, thanks for pointing it out and taking the time to answer. I had read some of that in the archive threads. When is the devel Boost.Test expected to become the main version ? How can I get the devel version of the code ? Sorry if these seem like newbie questions. Again, thanks for the info. Ghyslain

2 1

Thread prioritization on OSX
by Alexander Carôt 13 Dec '14

13 Dec '14

Hello all, according to this: http://www.boost.org/doc/libs/1_57_0/doc/html/thread/thread_management.html #thread.thread_management.tutorial.attributes I tried to change the thread priority to SCHED_RR on OS X via: boost::thread::attributes attrs; pthread_attr_setschedpolicy(attrs.get_native_handle(), SCHED_RR); sendThread = boost::thread(attrs,&sender::sendItThreadFunction,this); In that context I noticed that get_native_handle is not known so I used attr.native_handle(), which compiled ok but finally threw an error here: /boost/boost/bind/bind.hpp:313:9: Type 'boost::thread_attributes' does not provide a call operator I am still using boost 1.45 and wonder if this is the actual problem or if something else is wrong. Any help appreciated, thanks Alex Am 20.11.14 10:53 schrieb "Ben Pope" unter <benpope81(a)gmail.com>: >On Thursday, November 20, 2014 05:27 PM, Alexander Carôt wrote: >> Hello all, >> >> is it correct that boost does not offer thread prioritization ? > >There's nothing directly on the interface. > >> I am dealing with an application with a number of threads, which all >> depend on the realtime-scheduled sound card callback thread. >> >> These threads must have the same realtime scheduling priority. >> >> Is there a way to achieve this ? > >Basically there's a platform specific back door: native_handle. > >http://www.boost.org/doc/libs/1_57_0/doc/html/thread/thread_management.htm >l#thread.thread_management.tutorial.attributes > >Ben > > > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 9

BOOST_CLASS_EXPORT_GUID with custom archive
by Elizabeta 13 Dec '14

13 Dec '14

Hi I am using boost 1.49. I have custom archives derived from the boost binary archives. However it seems that when using BOOST_CLASS_EXPORT_GUID the types are not actually registered for the custom archive types, and I am getting unregistered_class exception when serializing derived class from base pointer. If I am using the boost binary original archives this is not the case. My custom archive classes are defined in in its own header file and at the end of the file I am including BOOST_SERIALIZATION_REGISTER_ARCHIVE, according to this in the documentation : " The newly created archive will usually be stored in its own header module. All that is necessary is to include the header and construct an instance of the new archive. EXCEPT for one special case. Instances of a derived class are serialized through a base class pointer. Such instances are not "registered" neither implicitly nor explicitly. That is, the macro BOOT_CLASS_EXPORT is used to instantiate the serialization code for the included archives. To make this work, the following should be included after the archive class definition. #define BOOST_SERIALIZATION_REGISTER_ARCHIVE(Archive) Failure to do this will not inhibit the program from compiling, linking and executing properly - except in one case. If an instance of a derived class is serialized through a pointer to its base class, the program will throw an unregistered_class exception." here is my archive h file : ------------------- customarchive.h -------------------- #include <boost/archive/binary_iarchive.hpp> #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_oarchive_impl.hpp> #include <boost/archive/binary_iarchive_impl.hpp> #include <boost/archive/shared_ptr_helper.hpp> class CloneBinaryIArchive : // don't derive from binary_oarchive !!! public boost::archive::binary_iarchive_impl< CloneBinaryIArchive, std::istream::char_type, std::istream::traits_type >, public boost::archive::detail::shared_ptr_helper { typedef CloneBinaryIArchive derived_t; typedef boost::archive::binary_iarchive_impl< CloneBinaryIArchive, std::istream::char_type, std::istream::traits_type > base_t; public: CloneBinaryIArchive(std::istream & is,unsigned int flags = 0) : base_t(is, flags) {} CloneBinaryIArchive(std::streambuf & bsb, unsigned int flags = 0) : base_t(bsb, flags) {} int foo; }; BOOST_SERIALIZATION_REGISTER_ARCHIVE(CloneBinaryIArchive) and here is the cpp file in each I am registering all classes : -------------- register.cpp --------------- #include "customarchive.h" #include <boost/serialization/export.hpp> #include "A.h" BOOST_CLASS_EXPORT_GUID(A,"A") -- View this message in context: http://boost.2283326.n4.nabble.com/BOOST-CLASS-EXPORT-GUID-with-custom-arch… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

share_ptr and Container compilation error on new version
by JB 13 Dec '14

13 Dec '14

Hello all, I'm trying to build an application. This isn't an app that I wrote but rather inherited. I'm currently porting it from Fedora 15 to Fedora 20. It compiled well on gcc 4.6.3 with boost 1.46.0. However, Fedora 20 has gcc 4.8.3 and boost 1.54. I'm new to boost and have never used it before but it looks very comprehensive. As far as I know boost/shared_ptr is the only header this component of the application is including. I'm wondering if boost changes might be causing this or maybe gcc changes but it's difficult to tell from the documentation and I'm a little under the gun at the moment. This code: template<typename Container> class DefinableVectorFinalizer: public XmlFinalizer { typedef typename Container::value_type contained_value_type; typedef typename Container::value_type::value_type value_type; .... } g++ is throwing this error which seems to have some sort of problem with Container::value_type::value_type: ../../../../../devel/include/xcl/io/DefinableVectorFinalizer.h:31:54: error: no type named ‘value_type’ in ‘xclApp::DefinableVector<boost::shared_ptr<simApp::Project> >::value_type {aka class boost::shared_ptr<mainApp::Project>}’ typedef typename Container::value_type::value_type value_type; xclApp::DefinableVector looks like this: class DefinableVector { public: typedef typename std::vector<T>::size_type size_type; typedef typename std::vector<T>::value_type value_type; typedef value_type& reference; typedef const value_type& const_reference; typedef typename std::vector<T>::iterator iterator; typedef typename std::vector<T>::const_iterator const_iterator; .... } Any insight into this would be hugely appreciated!!!

3 4

intrusive bug: equal_range implementation vs bounded_range precondition
by Matei David 12 Dec '14

12 Dec '14

In the absence of a bug tracker, I'll post the potential bug here: I'm seeing some strange results out of `multiset::equal_range`. I didn't isolate a test case, but looking at the code something seems wrong: The `bstree_algorithms::equal_range(const KeyType &, KeyValueCompare)` method is currently implemented (in `bstree_algorithms.hpp`) as a call to `bstree_algorithms::bounded_range(header, key, key, comp, true, true)`. However, `bounded_range` states as prerequisite: If 'lower_key' == 'upper_key', ('left_closed' or 'right_closed') must be false. Either the `equal_range` implementation or the `bounded_range` precondition is wrong. Matei

2 3

[Math] advice using brent_find_minima()
by dariomt＠gmail.com 12 Dec '14

12 Dec '14

I'd like to find the root of a function f (find x such that f(x) = 0). Should I pass abs( f ) to brent_find_minima()? I can't find examples... Thanks in advance!

4 6

bug tracker not working
by Matei David 12 Dec '14

12 Dec '14

The bug tracker stopped working for me. I tried to post a new bug, and I'm getting a captcha error message below. However, the web interface doesn't display any captcha for me to solve (!?) I tried both Google Chrome & Firefox on Linux. (I disabled various ad blocker extensions.) === Captcha Error Submission rejected as potential spam (StopForumSpam says this is spam (ip)) Trac thinks your submission might be Spam. To prove otherwise please provide a response to the following. === I've seen this message before, with the exact same problem (no captcha), when in the past I had tried to include a (legitimate) link in a bug post. However, after obfuscating the link I was able to post without this error. Now I can't any more. Can somebody look into this? Thanks, Matei

1 0

Flags for strongly typed enum?
by TONGARI J 11 Dec '14

11 Dec '14

Hi there, Is there any library in Boost that provides type-safe enum bit flags? Something like below: enum class option { a = 1, b = 2, c = 4, .... }; DEFINE_FLAGS(options, option); options set1 = option::a | option::b; options set2 = set1 | option::c; options err1 = option::a | 2; // error options err2 = set2 | 2; // error if (set1 & option::a) {...} if (set1 & 2) {...} // error Thanks.

1 0

boost MSM
by Raj Sambasivan 10 Dec '14

10 Dec '14

Hi Christophe, I have been using boost msm, i have two state machines each with around 30 transitions / 4 regions , no submachine etc for now... it perfectly fits the bill on what im trying to do, thanks for the great library, one issue i face is ,the debug build takes for ever to compile and the size is very big (the optimized one with no debug symbol compiles pretty fast) and when errors happens the compiler (template barf) goes for pages and pages .. any hints on this please? thanks -raj

4 5

Named semaphores in Windows Hi
by Kevin Williams 09 Dec '14

09 Dec '14

Hi I am looking at named semaphores in Windows. (Boost 1.57 with MSVC 2012) In a simple test, I create a named semaphore, and immediately do a "wait" after that, but the semaphore does not block. Am I missing something? Without a "post" surely it should block? Kind regards, Kevin

1 0

[Boost.Test] unexpected behavior after std::system(...)
by contini.mailing＠gmail.com 09 Dec '14

09 Dec '14

Hi, I'm using boost 1.57 with gcc 4.7.2 on a debian wheezy. I'm testing an external program that has a non-zero return code and i'm experiencing an unexpected behavior of Boost.Test library. If the test below is linked statically (commenting the first line of course) everything works fine and all the three tests are executed. If the test below is linked dynamically i get the following output: test0 test1 unknown location(0): fatal error in "test1": child has exited; pid: 32314; uid: 1000; exit value: 4 (here program hangs forever and the third test is never executed) Defining the environment variable BOOST_TEST_CATCH_SYSTEM_ERRORS=No circumvents the problem. But i don't want to define it on all of the team member's computers and test machines. This can be considered a boost bug? #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MODULE test_module #define BOOST_TEST_IGNORE_NON_ZERO_CHILD_CODE #include <boost/test/unit_test.hpp> #include <stdlib.h> BOOST_AUTO_TEST_CASE( test0 ) { std::system("echo \"test0\";exit 0;"); } BOOST_AUTO_TEST_CASE( test1 ) { std::system("echo \"test1\";exit 1;"); } BOOST_AUTO_TEST_CASE( test2 ) { std::system("echo \"test2\";exit 2;"); } Any help is appreciated.

2 1

modifying brandes_betweenness_centrality_impl
by The Maschine 08 Dec '14

08 Dec '14

Hello all, Im trying to modify the brandes centrality in order to analyse only a subset of the graph based on a cutoff distance calculated by some other edge weight than the one used for the brandes call. What I have done so far is to add a shortest path search call before the main path search inside brandes_betweenness_centrality_impl. The first search uses the edge::m_metric_weight and constructs the distance map from 's' based on that weight. Then I feed the metric distance map in the 'brandes special visitor' and I check inside visitor's examine_vertex. Reminder that the brandes call uses the m_special_weight. While this works as a principle I have no idea how people with experience would do it! A problem with this is that while the metric cutoff can be small you still run both searches to the max (as if there is no cutoff). Any help on how to change the first 'dijkstra_shortest_paths' so that after reaching the cutoff the search stops gracefully and leaves the rest of the 'distance_map' to infinity? Thanks a lot and please let me know if something need more clarification. ############### struct EdgeProperties { double m_special_weight; double m_metric_distance_weight; }; typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, VertexProperties, EdgeProperties> unGraph; // test my_brandes_dijkstra_visitor // template<typename Graph, typename WeightMap, typename IncomingMap, typename DistanceMap, typename PathCountMap> struct my_brandes_dijkstra_visitor : public bfs_visitor<> { typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor; typedef typename graph_traits<Graph>::edge_descriptor edge_descriptor; my_brandes_dijkstra_visitor(std::stack<vertex_descriptor>& iordered_vertices, WeightMap iweight, IncomingMap iincoming, DistanceMap idistance, PathCountMap ipath_count, std::vector<float> c_dists, float coff) : ordered_vertices(iordered_vertices), weight(iweight), incoming(iincoming), distance(idistance), path_count(ipath_count), cutoff_dists(c_dists), cutoff(coff) { } /** * Whenever an edge e = (v, w) is relaxed, the incoming edge list * for w is set to {(v, w)} and the shortest path count of w is set to * the number of paths that reach {v}. */ void edge_relaxed(edge_descriptor e, const Graph& g) { vertex_descriptor v = source(e, g), w = target(e, g); incoming[w].clear(); incoming[w].push_back(e); put(path_count, w, get(path_count, v)); } /** * If an edge e = (v, w) was not relaxed, it may still be the case * that we've found more equally-short paths, so include {(v, w)} in the * incoming edges of w and add all of the shortest paths to v to the * shortest path count of w. */ void edge_not_relaxed(edge_descriptor e, const Graph& g) { typedef typename property_traits<WeightMap>::value_type weight_type; typedef typename property_traits<DistanceMap>::value_type distance_type; vertex_descriptor v = source(e, g), w = target(e, g); distance_type d_v = get(distance, v), d_w = get(distance, w); weight_type w_e = get(weight, e); closed_plus<distance_type> combine; if (d_w == combine(d_v, w_e)) { put(path_count, w, get(path_count, w) + get(path_count, v)); incoming[w].push_back(e); } } /// Keep track of vertices as they are reached void examine_vertex(vertex_descriptor w, const Graph&) { // add only if this is within the 'cutoff'. cutoff_dists holds // the metric distances from s. if( cutoff_dists[w] < cutoff ) ordered_vertices.push(w); } private: std::stack<vertex_descriptor>& ordered_vertices; WeightMap weight; IncomingMap incoming; DistanceMap distance; PathCountMap path_count; std::vector<float> cutoff_dists; float cutoff; }; //////////////////////////////////////////////////////////////////// template<typename WeightMap> struct my_brandes_dijkstra_shortest_paths { my_brandes_dijkstra_shortest_paths(WeightMap iweight_map) : weight_map(iweight_map) { } template<typename Graph, typename IncomingMap, typename DistanceMap, typename PathCountMap, typename VertexIndexMap> void operator()(Graph& g, typename graph_traits<Graph>::vertex_descriptor s, std::stack<typename graph_traits<Graph>::vertex_descriptor>& ov, IncomingMap incoming, DistanceMap distance, PathCountMap path_count, VertexIndexMap vertex_index , std::vector<float> c_dists, float coff) // modified cutoff vector and value { typedef my_brandes_dijkstra_visitor<Graph, WeightMap, IncomingMap, DistanceMap, PathCountMap> visitor_type; visitor_type visitor(ov, weight_map, incoming, distance, path_count,c_dists,coff); // modified cutoff vector and value dijkstra_shortest_paths(g, s, boost::weight_map(weight_map) .vertex_index_map(vertex_index) .distance_map(distance) .visitor(visitor)); } private: WeightMap weight_map; }; ////////////////////////////// template<typename Graph, typename CentralityMap, typename EdgeCentralityMap, typename IncomingMap, typename DistanceMap, typename DependencyMap, typename PathCountMap, typename VertexIndexMap, typename ShortestPaths> void my_brandes_betweenness_centrality_impl(const Graph& g, CentralityMap centrality, // C_B EdgeCentralityMap edge_centrality_map, IncomingMap, //incoming, // P // OpenMP mod DistanceMap, //distance,// d // OpenMP mod DependencyMap, //dependency,// delta // OpenMP mod PathCountMap, //path_count,// sigma // OpenMP mod VertexIndexMap vertex_index, ShortestPaths shortest_paths) { typedef typename graph_traits<Graph>::vertex_iterator vertex_iterator; typedef typename graph_traits<Graph>::edge_iterator edge_iterator; typedef typename graph_traits<Graph>::vertex_descriptor vertex_descriptor; // Initialize centrality init_centrality_map(vertices(g), centrality); init_centrality_map(edges(g), edge_centrality_map); int i, N = num_vertices(g); #pragma omp parallel for default(shared) private(i) schedule(dynamic) for (i = 0; i < N; ++i) { typename graph_traits<Graph>::vertex_descriptor s = vertex(i, g); if (s == graph_traits<Graph>::null_vertex()) continue; // First we build a map of all distances from 's' based // on m_metric_distance_weight. typedef typename boost::property_map < Graph, boost::vertex_index_t >::type CIndexMap; typedef typename boost::iterator_property_map < vertex_descriptor*, CIndexMap, vertex_descriptor, vertex_descriptor& > CPredecessorMap; typedef typename boost::iterator_property_map < float*, CIndexMap, float, float& > CDistanceMap; float co = 2200.0f; std::vector<vertex_descriptor> cut_predecessors(boost::num_vertices(g)); // To store parents std::vector<float> cut_distances(boost::num_vertices(g), std::numeric_limits<double>::max() ); // To store distances CIndexMap cut_indexMap = boost::get(boost::vertex_index, g); CPredecessorMap cut_predecessorMap(&cut_predecessors[0], cut_indexMap); CDistanceMap cut_distanceMap(&cut_distances[0], cut_indexMap); // boost::dijkstra_shortest_paths(g, s, boost::weight_map(get(&EdgeProperties::m_metric_distance_weight, g)).predecessor_map(cut_predecessorMap).distance_map(cut_distanceMap)); /////////// // Local storage for OpenMP std::stack<vertex_descriptor> ordered_vertices; vector_property_map<typename property_traits<IncomingMap>:: value_type,VertexIndexMap> incoming(vertex_index); vector_property_map<typename property_traits<DistanceMap>:: value_type,VertexIndexMap> distance(vertex_index); vector_property_map<typename property_traits<DependencyMap>:: value_type,VertexIndexMap> dependency(vertex_index); vector_property_map<typename property_traits<PathCountMap>:: value_type,VertexIndexMap> path_count(vertex_index); // Initialize for this iteration vertex_iterator w, w_end; for (tie(w, w_end) = vertices(g); w != w_end; ++w) { incoming[*w].clear(); put(path_count, *w, 0); put(dependency, *w, 0); } put(path_count, s, 1); // co - cutoff added. b_centrality is calculated based on // Edge::m_special_weight while we are testing // to be inside the 'cutoff' that is based on the // Edge::m_metric_weight. shortest_paths(g, s, ordered_vertices, incoming, distance, path_count, vertex_index, cut_distances, co); while (!ordered_vertices.empty()) { vertex_descriptor u = ordered_vertices.top(); ordered_vertices.pop(); typedef typename property_traits<IncomingMap>::value_type incoming_type; typedef typename incoming_type::iterator incoming_iterator; typedef typename property_traits<DependencyMap>::value_type dependency_type; for (incoming_iterator vw = incoming[u].begin(); vw != incoming[u].end(); ++vw) { vertex_descriptor v = source(*vw, g); dependency_type factor = dependency_type(get(path_count, v)) / dependency_type(get(path_count, u)); factor *= (dependency_type(1) + get(dependency, u)); put(dependency, v, get(dependency, v) + factor); update_centrality(edge_centrality_map, *vw, factor); } if (u != s) { #pragma omp critical(globalupdate) { update_centrality(centrality, u, get(dependency, u)); } } } } typedef typename graph_traits<Graph>::directed_category directed_category; const bool is_undirected = is_convertible<directed_category*, undirected_tag*>::value; if (is_undirected) { divide_centrality_by_two(vertices(g), centrality); divide_centrality_by_two(edges(g), edge_centrality_map); } } //

1 1

errors while compiling the boost-libraries
by steffen.wittek＠posteo.de 08 Dec '14

08 Dec '14

I was trying to compile the boost-libraries in order to use them in dolfin (1.4.0), as I got an error message in Dolfin as follows: > ImportError: /home/phoenix/Work/FEniCS/lib/libdolfin.so.1.4: > undefined symbol: _ZN5boost6thread4joinEv I thought that the undefined symbol pointed towards the boost libraries and so I tried to recompile them by including them into the dorsal script. A compilation of the latter stopped with another error however. The ..Work/FEniCS/src/boost_1_55_0/dorsal_build.log ends with > ...failed updating 45 targets... > ...skipped 50 targets... > ...updated 564 targets... and can be seen in full glory here: https://www.dropbox.com/s/529m6pb4ygcsxxv/dorsal_build.log?dl=0 Does anyone know how I can fix this problem?

1 0

[ASIO][Windows] async_resolve() Blocking on Reverse Lookup?
by Kyle Ketterer 06 Dec '14

06 Dec '14

Hello, I am working on a simple utility which scans an IP range and performs a reverse lookup. Using ASIO, I would like to use async_resolve to accomplish this. However, it seems that when using async_resolve() with an ::endpoint overload, the call is blocking. I am wrapping all async functions in a strand and calling io_service::run() from multiple threads. Here is an example: ------------------------------------------------------------------- class client { public: client ( boost::asio::io_service & io_service ) : io_service_(io_service), resolver_(io_service), strand_(io_service) { /* */ } void resolve_host ( const std::string & host ) { strand_.post( boost::bind(&client::start_resolve, this, host ) ); } void start_resolve ( const std::string & host_ ) { //boost::asio::ip::tcp::resolver::query query( tcp::v4(), host_, "" ); tcp::endpoint endpoint ( boost::asio::ip::address::from_string( host_) , 0 ); resolver_.async_resolve( endpoint, strand_.wrap( boost::bind( &client::handle_resolve, this, boost::asio::placeholders::error, boost::asio::placeholders::iterator ) ) ); } void handle_resolve ( const boost::system::error_code& err, tcp::resolver::iterator endpoint_iterator ) { if ( !err ) { /* attempt to connect */ tcp::endpoint endpoint = *endpoint_iterator; cout << endpoint.address() << "' >> " << (*endpoint_iterator).host_name() << endl; } } private: tcp::resolver resolver_; boost::asio::strand strand_; boost::asio::io_service & io_service_; }; int main( int argc, char* argv[] ) { /* io service */ boost::asio::io_service io_service; /* ip range */ std::string m_addr = "10.1.10."; /* client object */ boost::shared_ptr<client> m_client ( new client ( io_service ) ); /* add the entire subnet */ for ( int i=1; i<255; i++ ) { m_client->resolve_host ( m_addr + boost::to_string(i) ); } /* create threads and run io_service */ std::vector < boost::shared_ptr<boost::thread> > m_threads; for ( int i=0; i < CPU_CORES; i++ ) { m_threads.push_back ( boost::shared_ptr<boost::thread> ( new boost::thread(boost::bind(&boost::asio::io_service::run, &io_service ) ) ) ); } for ( int i=0; i < CPU_CORES; i++ ) { m_threads[i]->join(); } return 0; } ------------------------------------------------------ I am looking for suggestions on how I can take a multi-threaded approach to this. I am fairly new to ASIO so I appreciate any advice! Thanks -- Kyle Ketterer <reminisc3(a)gmail.com>

1 0

phoenix bind template parameter
by Philipp Kraus 06 Dec '14

06 Dec '14

Hello, I try to use phoenix bind to bind std::pow for double values, but I get errors, because the template parameters not set: phoenix::bind(&std::pow, _val, _1) I would like to compile it with C++11. How can I setup the template parameter on the phoenix bind? At the moment I have defined a function double mypow(double a, double b) { return std::pow(a,b); } but can I do this directly with std::pow in the bind call? Thanks a lot Phil

2 1

[Boost.SIMD] Interest in library
by dariomt＠gmail.com 05 Dec '14

05 Dec '14

Hi, I'm interested in trying out Boost.SIMD. Where can I download the latest stable version? Any idea when it might get proposed for Boost review? I think it would be beneficial if it is added to the Boost Incubator until then. Also, in http://meetingcpp.com/tl_files/mcpp/slides/12/simd.pdf slide 36 I see mention of a vectorized Thomas Tri-diagonal Solver. I thought the data dependency made the algorithm unfeasible for vectorization, so I'm *very* interested to learn how Boost.SIMD helps in this case. Is there more information available about this? Thanks for working in a library that shows a lot of potential.

4 3

Boost Serialization - Overriding builtin implementation for std::wstring
by cpp_learner 04 Dec '14

04 Dec '14

Hi: The current serialization implementation for std::wstring is not portable across platforms. To make it cross platform, we would like to customize the serialization implementation for std::wstring (by splitting "serialize" and providing our own implementation for "save/load"). Is it possible to achieve this? One way to get around this is to provide our own implementation, and not include the header boost/serialization/string.hpp. This is not an option to us as there is no way for us to enforce clients to not include this header at all either directly or indirectly. And unfortunately, the compiler does not complain if the same compilation unit has two different serialization mechanism for std::wstring (the builtin and customized serialization implementation, in which case the builtin serialization implementation is picked, which is not portable). Many Thanks AB

1 0

Fusion Move Semantics
by Ovanes Markarian 04 Dec '14

04 Dec '14

Hi! I would like to ask does fusion supports move semantics, or are all the values going to get copied. I use C++11 (clang with libstdcxx) and boost 1.54 (but can upgrade). In my use case I have boost::fusion::map and was wondering, that in case of moving of that map, is it going to forward the move call to contained values or not. Many thanks for help, Ovanes

3 2

Boost BGL question regarding depth_first_visit / undirected_depth_first_visit
by Mark Fanara 03 Dec '14

03 Dec '14

I am looking to add a TerminatorFunc to undirected_depth_first_visit similar to what is in depth_first_visit. I think I have successfully made the changes through mimicry (I am an old school C++ guy and still don't understand generic programming) My problem is that I don't know how to declare/define my own terminate function. Nor do I know how to call undirected_depth_first_visit with the new argument. I have tried searching for examples of calling depth_first_visit with a TerminatorFunc argument, but can't find anything helpful. Appreciate any suggestions you might have.

1 0

Marriage of boost::any_range and boost::fusion?
by Ernest Zaslavsky 03 Dec '14

03 Dec '14

I'm trying to achieve the following. I have an any_range of const items, in runtime I need dynamically calculate and store values for each item, lets say two additional integers, what I expect to get in the end is an any_range with something like joint view of my const item and two integers. Is it possible? [Read More]<http://feeds.feedburner.com/~r/sizmek-blog/~6/1> [http://www.sizmek.com/Sizmek.png]<http://www.sizmek.com/>

1 0

Re: [Boost-users] how to lisk unique keys in boost multi_index_container
by Bill Tian 03 Dec '14

03 Dec '14

thanks for JoaquÃn M LÃ³pez MuÃ±oz 's reply. i have tried your code, it works as i need exactly. for(auto it=data.get<1>().begin(),it_end=data.get<1>().end(); it!=it_end; it=data.get<1>().upper_bound(it->m2)){ std::cout<<it->m2<<"\n"; // or whatever you need to do with the key } i'll use this method in reality, thanks! Bill

1 0

how to lisk unique keys in boost multi_index_container
by Bill Tian 02 Dec '14

02 Dec '14

hello,every one now i have a struct like this struct a { a(const std::string &m1_, const std::string &m2_, boost::int16_t m3_) : m1(m1_),m2(m2_), m3(m3_) {} std::string m1; std::string m2; boost::int16_t m3; }; typedef boost::multi_index::multi_index_container < a, boost::multi_index::indexed_by< boost::multi_index::hashed_unique< BOOST_MULTI_INDEX_MEMBER(a, std::string, m1) >, boost::multi_index::ordered_non_unique< BOOST_MULTI_INDEX_MEMBER(a, std::string, m2) >, boost::multi_index::ordered_non_unique < BOOST_MULTI_INDEX_MEMBER(a, boost::uint16_t, m3) > > > my_data; i want to list all unique keys of m2 and m3 after the container has been filled with a lot of records, is there a example ? my_data data; data.insert(a("a1","k1", 1)); data.insert(a("a2","k1", 2)); data.insert(a("a3","k2", 3)); ..... data.insert(a("a10000","k1", 1)); i want to get all data that m2 equal to "k1", when this data has been processed, get all data that m2 equal to "k2" ... but i do not how many unique keys in the container, am i need to store another set to store that when i fill the container? i need a function to get the keys like the SQL:"select distinct(m2) from data". thanks a lot! best regards. Bill

2 1

Error "Used Uninitialized" in boyer_myrvold_impl.hpp
by wanglurg 02 Dec '14

02 Dec '14

Hi, guys, I'm a new boost graph library user. I met an error when using boyer_myrvold_planar_test() function in Boost_1_55_0 to generate the kuratowski subgraph. Error message is listed as follows: ./boost/graph/planar_detail/boyer_myrvold_impl.hpp:1545:11 error: 'z' may be used uninitialized in this function. I added a "Wno-maybe-uninitialized" flag to Makefile to remove this error temporarily, but it's not a good method. I'm looking for a better way to fix this. Does anyone encounter the same case? Best regards, Lu Wang -- View this message in context: http://boost.2283326.n4.nabble.com/Error-Used-Uninitialized-in-boyer-myrvol… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

Does Boost 1.56 boost::async support auto scheduling (launch deferred)?
by Adi Shavit 02 Dec '14

02 Dec '14

Hi, Onc of the design choices for async() default launch policy was to allow the OS scheduler to decide whether or not to launch a new thread or remain on the same thread (presumably based on available system resources). Does Boost 1.56 or 1.57 support this default auto scheduling yet? It seems to be launching as many threads as tasks. Thanks, Adi

2 2

Boost build and first program
by Great Avenger Singh 01 Dec '14

01 Dec '14

Hi I am first time boost user. I build it using following procedure on Ubuntu Linux 14.04. cd /boost-src/ ./bootstrap.sh and followed instructions. after the completion it gave me following suggestion: The Boost libraries were successfully built. Following directory should be included to compiler include paths; /home/metal-machine/boost-src Following directory should be included to linker library paths; /home/metal-machine/boost-src/stage/lib Now I try to compile and program with following options from command line: $ g++ -I "/home/metal-machine/boost-src/" -L "/home/metal-machine/boost-src/stage/lib/" boostlist.cpp -lboost_system -lboost_filesystem -o honey $ ./honey ./honey: error while loading shared libraries: libboost_system.so.1.57.0: cannot open shared object file: No such file or directory But on the other hand if I compile and run as follows: $ g++ boostlist.cpp -lboost_system -lboost_filesystem -o honey $./honey ->it works fine I am using thiscode: https://gist.github.com/vivithemage/9517678 Where I am doing wrong? -- Thanks Arshpreet Singh http://arshpreetsingh.wordpress.com/ “If we all did the things we are really capable of doing, we would literally astound ourselves …” T. E. ------------------------------------------------------------------------------ Slashdot TV. Video for Nerds. Stuff that matters. http://tv.slashdot.org/

3 2

fatal error: 'boost/utility/detail/result_of_iterate.hpp' file not found
by Ted Middleton 01 Dec '14

01 Dec '14

I'm trying to build boost 1.56.0 for OSX 10.10 with Xcode 5.1.1 (clang-503.0.40). Xcode 5.1.1 Build version 5B1008 Apple LLVM version 5.1 (clang-503.0.40) (based on LLVM 3.4svn) Target: x86_64-apple-darwin14.0.0 Thread model: posix When I try to build boost thread, the compile fails building thread.cpp on the command: "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pedantic -gdwarf-2 -fexceptions -Wno-long-long -Wextra -Wno-long-long -Wno-variadic-macros -Wunused-function -fpermissive -pedantic -DBOOST_ALL_NO_LIB=1 -DBOOST_ATOMIC_STATIC_LINK=1 -DBOOST_SYSTEM_STATIC_LINK=1 -DBOOST_THREAD_BUILD_LIB=1 -DBOOST_THREAD_DONT_USE_CHRONO -DBOOST_THREAD_POSIX -DNDEBUG -I"." -c -o "bin.v2/libs/thread/build/darwin-4.2.1/release/link-static/threading-multi/pthread/thread.o" "libs/thread/src/pthread/thread.cpp" The error is: In file included from libs/thread/src/pthread/thread.cpp:19: In file included from ./boost/thread/future.hpp:22: In file included from ./boost/thread/detail/invoker.hpp:28: In file included from ./boost/utility/result_of.hpp:202: ./boost/preprocessor/iteration/detail/iter/forward1.hpp:47:18: fatal error: 'boost/utility/detail/result_of_iterate.hpp' file not found ./boost/preprocessor/iteration/detail/iter/forward1.hpp:27:56: note: expanded from macro 'BOOST_PP_FILENAME_1' # define BOOST_PP_FILENAME_1 BOOST_PP_ARRAY_ELEM(2, BOOST_PP_ITERATION_PARAMS_1) ^ ./boost/utility/result_of.hpp:201:68: note: expanded from macro 'BOOST_PP_ITERATION_PARAMS_1' #define BOOST_PP_ITERATION_PARAMS_1 (3,(0,BOOST_RESULT_OF_NUM_ARGS,<boost/utility/detail/result_of_iterate.hpp>)) ^ ./boost/preprocessor/array/elem.hpp:23:114: note: expanded from macro 'BOOST_PP_ARRAY_ELEM' # define BOOST_PP_ARRAY_ELEM(i, array) BOOST_PP_TUPLE_ELEM(BOOST_PP_ARRAY_SIZE(array), i, BOOST_PP_ARRAY_DATA(array)) ^ note: (skipping 10 expansions in backtrace; use -fmacro-backtrace-limit=0 to see all) ./boost/preprocessor/tuple/rem.hpp:23:31: note: expanded from macro 'BOOST_PP_REM' # define BOOST_PP_REM(...) __VA_ARGS__ ^ ./boost/preprocessor/variadic/elem.hpp:26:89: note: expanded from macro 'BOOST_PP_VARIADIC_ELEM' # define BOOST_PP_VARIADIC_ELEM(n, ...) BOOST_PP_CAT(BOOST_PP_VARIADIC_ELEM_, n)(__VA_ARGS__,) ^ ./boost/preprocessor/variadic/elem.hpp:30:55: note: expanded from macro 'BOOST_PP_VARIADIC_ELEM_2' # define BOOST_PP_VARIADIC_ELEM_2(e0, e1, e2, ...) e2 Sure enough, boost/utility/detail/result_of_iterate.hpp doesn't exist from the base of the project. It does if you start at libs/utlility/include/boost/utility/detail, though. Most of what's in boost/ is a symlink to directories in libs (I guess this is how modulization works), and if boost/utility were a symlink libs/utility/include/boost/utility, I think this code in forward1.hpp would work. But boost/utility isn't a symlink - boost/utility is an actual directory with a few symlinks to files in it, but none of them leads to result_of_iterate.hpp. There's an email (http://lists.boost.org/Archives/boost/2014/07/215233.php) to the developers list from back in July discussing this build break in the 1.56.0 beta 1, but I'm seeing this at the tag boost-1.56.0 for the 1.56.0 release in git.I don't seem to be able to build 1.57.0 either. Boost 1.56.0 wouldn't have shipped with a broken boost thread compile on OSX 64-bit, so I'm certain that its something bad that I've done. Can anyone figure out what I'm doing wrong from that command line or the error printout?

1 1

[Boost-users][Spirit] Semantic Action for a map of a map
by Ryan 01 Dec '14

01 Dec '14

I posted this question to the Boost Spirit mailing list but there doesn't seem to be much traffic there. I'm hoping that the main mailing list also has a few Spirit users as well and can possible receive some help. I'm wanting to add a semantic action for a complex rule. I'm not entirely sure this is the correct design. I need to parse the following EBNF grammar. EBNF value = (a-zA-Z_0-9)* tag = (a-zA-Z_) value tagValue = tag '=' value list = "@list=" tag '=' tag ',' (tagValue ',')* "@end" info = tag (',' (tagValue | list) )* I thought if I defined the basic rules I could then created a custom instance of that rule with a semantic action. I did that for the first "tag" in the info definition and it seem to work well. I was also able to create this custom instance for the "tagValue" rule within the info definition. The problem is how to create the custom instance for list. The list result goes into a map of a map that I've created within my class. I'm not sure how to treat the tag=tag as the key and let the tagValue be the value. Any help with the semantic action or changing the design would be appreciated. This is my first time using Spirit and the learning curve is proving to be difficult. Ryan #include <string> #include <map> #include <utility> #include <boost/spirit/include/phoenix.hpp> #include <boost/spirit/include/qi.hpp> #include <boost/spirit/include/std_pair.hpp> class Bob { typedef std::pair<std::string, std::string> infoPair; typedef std::map<std::string, std::string> infoMap typedef std::map<std::string, infoMap> infoMap2; std::string m_Name; infoMap m_Arguments; infoMap2 m_ArgumentCollection; public: bool const parseMessage(std::string const& message) { namespace qi = boost::spirit::qi; namespace phx = boost::phoenix; typedef std::string::const_iterator iter; qi::rule<iter, std::string()> value = *qi::char_("a-zA-Z_0-9"); qi::rule<iter, std::string()> tag = qi::char_("a-zA-Z_") >> value; qi::rule<iter, infoPair()> tagValue = tag >> '=' >> value; qi::rule<iter, std::string()> name = tag[ phx::bind(&Bob::m_Name, this) = qi::_1 ]; qi::rule<iter, infoMap()> tagValueMap = tagValue[ [=](infoPair& p, qi::unused_type, qi::unused_type) { m_Arguments[p.first] = p.second; } ]; //The compiler wants an infoPair. Not really sure that is what I need. qi::rule<iter, infoPair()> list = "@list=" >> tag >> '=' >> tag >> ',' >> *(tagValue >> ',') >> "@end"; //How can I create a custom version of list (like I did for tag) to assign a semantic action. //The action needs to allow tag=tag be the key to m_ArgumentCollection and place all //the repeating tagValue items into its value. auto first(message.begin()), last(message.end()); bool results = qi::parse(first, last, name >> (*(',' >> tagValueMap))); //Something like this as the final form to the grammar. //bool results = qi::parse(first, last, name >> (*(',' >> (tagValueMap | customList)))); if (!results || first != last) return false; return true; } }; int main(void) { Bob bob; bob.parseMessage("hello,this=great,@list=alice=here,wish=fish,@end,look=good"); return 0; }

1 0

LibBoost - Asio - SerialPort - set_option throw an exception
by Mikael Plouhinec 01 Dec '14

01 Dec '14

Hello, I have some problem using the libboost asio to communicate with serial port. I want to open my serial port with : m_Balance.open(BalancePort, (unsigned int)9600, boost::asio::serial_port_base::parity(boost::asio::serial_port_base::parity::even), boost::asio::serial_port_base::character_size((unsigned int)7), boost::asio::serial_port_base::flow_control( boost::asio::serial_port_base::flow_control::hardware), boost::asio::serial_port_base::stop_bits(boost::asio::serial_port_base::stop_bits::one)); but I have an exception with the character_size : Invalid Argument I put some log in the open method and I have found that my problem is on the set_option of the character size. Can someone help me? Thanks a lot. Mike Libboost is on Debian Wheezy : version 1.49 I use the following Serial Class (cpp) : /* * File: Serial.cpp * Author: Terraneo Federico * Distributed under the Boost Software License, Version 1.0. * Created on September 12, 2009, 3:47 PM * * v1.05: Fixed a bug regarding reading after a timeout (again). * * v1.04: Fixed bug with timeout set to zero * * v1.03: Fix for Mac OS X, now fully working on Mac. * * v1.02: Code cleanup, speed improvements, bug fixes. * * v1.01: Fixed a bug that caused errors while reading after a timeout. * * v1.00: First release. */ #include "Serial.h" #include <string> #include <algorithm> #include <iostream> #include <boost/bind.hpp> using namespace std; using namespace boost; CSerial::CSerial(): io(), port(io), timer(io), timeout(posix_time::seconds(0)) {} CSerial::CSerial(const std::string& devname, unsigned int baud_rate, asio::serial_port_base::parity opt_parity, asio::serial_port_base::character_size opt_csize, asio::serial_port_base::flow_control opt_flow, asio::serial_port_base::stop_bits opt_stop) : io(), port(io), timer(io), timeout(posix_time::seconds(0)) { open(devname,baud_rate,opt_parity,opt_csize,opt_flow,opt_stop); } void CSerial::open(const std::string& devname, unsigned int baud_rate, asio::serial_port_base::parity opt_parity, asio::serial_port_base::character_size opt_csize, asio::serial_port_base::flow_control opt_flow, asio::serial_port_base::stop_bits opt_stop) { if(isOpen()) close(); port.open(devname); Log.AddLine("set 1", LOG_DEBUG); port.set_option(asio::serial_port_base::baud_rate(baud_rate)); Log.AddLine("set 2", LOG_DEBUG); port.set_option(opt_parity); Log.AddLine("set 3", LOG_DEBUG); port.set_option(opt_csize); Log.AddLine("set 4", LOG_DEBUG); port.set_option(opt_flow); Log.AddLine("set 5", LOG_DEBUG); port.set_option(opt_stop); Log.AddLine("set 6", LOG_DEBUG); } bool CSerial::isOpen() const { return port.is_open(); } void CSerial::close() { if(isOpen()==false) return; port.close(); } void CSerial::setTimeout(const posix_time::time_duration& t) { timeout=t; } void CSerial::write(const char *data, size_t size) { asio::write(port,asio::buffer(data,size)); } void CSerial::write(const std::vector<char>& data) { asio::write(port,asio::buffer(&data[0],data.size())); } void CSerial::writeString(const std::string& s) { asio::write(port,asio::buffer(s.c_str(),s.size())); } void CSerial::read(char *data, size_t size) { if(readData.size()>0)//If there is some data from a previous read { istream is(&readData); size_t toRead=min(readData.size(),size);//How many bytes to read? is.read(data,toRead); data+=toRead; size-=toRead; if(size==0) return;//If read data was enough, just return } setupParameters=ReadSetupParameters(data,size); performReadSetup(setupParameters); //For this code to work, there should always be a timeout, so the //request for no timeout is translated into a very long timeout if(timeout!=posix_time::seconds(0)) timer.expires_from_now(timeout); else timer.expires_from_now(posix_time::hours(100000)); timer.async_wait(boost::bind(&CSerial::timeoutExpired,this, asio::placeholders::error)); result=resultInProgress; bytesTransferred=0; for(;;) { io.run_one(); switch(result) { case resultSuccess: timer.cancel(); return; case resultTimeoutExpired: port.cancel(); throw(timeout_exception("Timeout expired")); case resultError: timer.cancel(); port.cancel(); throw(boost::system::system_error(boost::system::error_code(), "Error while reading")); //if resultInProgress remain in the loop } } } std::vector<char> CSerial::read(size_t size) { vector<char> result(size,'\0');//Allocate a vector with the desired size read(&result[0],size);//Fill it with values return result; } std::string CSerial::readString(size_t size) { string result(size,'\0');//Allocate a string with the desired size read(&result[0],size);//Fill it with values return result; } std::string CSerial::readStringUntil(const std::string& delim) { // Note: if readData contains some previously read data, the call to // async_read_until (which is done in performReadSetup) correctly handles // it. If the data is enough it will also immediately call readCompleted() setupParameters=ReadSetupParameters(delim); performReadSetup(setupParameters); //For this code to work, there should always be a timeout, so the //request for no timeout is translated into a very long timeout if(timeout!=posix_time::seconds(0)) timer.expires_from_now(timeout); else timer.expires_from_now(posix_time::hours(100000)); timer.async_wait(boost::bind(&CSerial::timeoutExpired,this, asio::placeholders::error)); result=resultInProgress; bytesTransferred=0; for(;;) { io.run_one(); switch(result) { case resultSuccess: { timer.cancel(); bytesTransferred-=delim.size();//Don't count delim istream is(&readData); string result(bytesTransferred,'\0');//Alloc string is.read(&result[0],bytesTransferred);//Fill values is.ignore(delim.size());//Remove delimiter from stream return result; } case resultTimeoutExpired: port.cancel(); throw(timeout_exception("Timeout expired")); case resultError: timer.cancel(); port.cancel(); throw(boost::system::system_error(boost::system::error_code(), "Error while reading")); //if resultInProgress remain in the loop } } } CSerial::~CSerial() {} void CSerial::performReadSetup(const ReadSetupParameters& param) { if(param.fixedSize) { asio::async_read(port,asio::buffer(param.data,param.size),boost::bind( &CSerial::readCompleted,this,asio::placeholders::error, asio::placeholders::bytes_transferred)); } else { asio::async_read_until(port,readData,param.delim,boost::bind( &CSerial::readCompleted,this,asio::placeholders::error, asio::placeholders::bytes_transferred)); } } void CSerial::timeoutExpired(const boost::system::error_code& error) { if(!error && result==resultInProgress) result=resultTimeoutExpired; } void CSerial::readCompleted(const boost::system::error_code& error, const size_t bytesTransferred) { if(!error) { result=resultSuccess; this->bytesTransferred=bytesTransferred; return; } //In case a asynchronous operation is cancelled due to a timeout, //each OS seems to have its way to react. #ifdef _WIN32 if(error.value()==995) return; //Windows spits out error 995 #elif defined(__APPLE__) if(error.value()==45) { //Bug on OS X, it might be necessary to repeat the setup //http://osdir.com/ml/lib.boost.asio.user/2008-08/msg00004.html performReadSetup(setupParameters); return; } #else //Linux if(error.value()==125) return; //Linux outputs error 125 #endif result=resultError; } Serial.h /* * File: Serial.h * Author: Terraneo Federico * Distributed under the Boost Software License, Version 1.0. * * Created on September 12, 2009, 3:47 PM */ #ifndef Serial_H #define Serial_H #include <stdexcept> #include <boost/utility.hpp> #include <boost/asio.hpp> #include "Log.h" /** * Thrown if timeout occurs */ class timeout_exception: public std::runtime_error { public: timeout_exception(const std::string& arg): runtime_error(arg) {} }; /** * Serial port class, with timeout on read operations. */ class CSerial: private boost::noncopyable { public: CSerial(); /** * Opens a serial device. By default timeout is disabled. * \param devname serial device name, example "/dev/ttyS0" or "COM1" * \param baud_rate serial baud rate * \param opt_parity serial parity, default none * \param opt_csize serial character size, default 8bit * \param opt_flow serial flow control, default none * \param opt_stop serial stop bits, default 1 * \throws boost::system::system_error if cannot open the * serial device */ CSerial(const std::string& devname, unsigned int baud_rate, boost::asio::serial_port_base::parity opt_parity= boost::asio::serial_port_base::parity( boost::asio::serial_port_base::parity::none), boost::asio::serial_port_base::character_size opt_csize= boost::asio::serial_port_base::character_size(8), boost::asio::serial_port_base::flow_control opt_flow= boost::asio::serial_port_base::flow_control( boost::asio::serial_port_base::flow_control::none), boost::asio::serial_port_base::stop_bits opt_stop= boost::asio::serial_port_base::stop_bits( boost::asio::serial_port_base::stop_bits::one)); /** * Opens a serial device. * \param devname serial device name, example "/dev/ttyS0" or "COM1" * \param baud_rate serial baud rate * \param opt_parity serial parity, default none * \param opt_csize serial character size, default 8bit * \param opt_flow serial flow control, default none * \param opt_stop serial stop bits, default 1 * \throws boost::system::system_error if cannot open the * serial device */ void open(const std::string& devname, unsigned int baud_rate, boost::asio::serial_port_base::parity opt_parity= boost::asio::serial_port_base::parity( boost::asio::serial_port_base::parity::none), boost::asio::serial_port_base::character_size opt_csize= boost::asio::serial_port_base::character_size(8), boost::asio::serial_port_base::flow_control opt_flow= boost::asio::serial_port_base::flow_control( boost::asio::serial_port_base::flow_control::none), boost::asio::serial_port_base::stop_bits opt_stop= boost::asio::serial_port_base::stop_bits( boost::asio::serial_port_base::stop_bits::one)); /** * \return true if serial device is open */ bool isOpen() const; /** * Close the serial device * \throws boost::system::system_error if any error */ void close(); /** * Set the timeout on read/write operations. * To disable the timeout, call setTimeout(boost::posix_time::seconds(0)); */ void setTimeout(const boost::posix_time::time_duration& t); /** * Write data * \param data array of char to be sent through the serial device * \param size array size * \throws boost::system::system_error if any error */ void write(const char *data, size_t size); /** * Write data * \param data to be sent through the serial device * \throws boost::system::system_error if any error */ void write(const std::vector<char>& data); /** * Write a string. Can be used to send ASCII data to the serial device. * To send binary data, use write() * \param s string to send * \throws boost::system::system_error if any error */ void writeString(const std::string& s); /** * Read some data, blocking * \param data array of char to be read through the serial device * \param size array size * \return numbr of character actually read 0<=return<=size * \throws boost::system::system_error if any error * \throws timeout_exception in case of timeout */ void read(char *data, size_t size); /** * Read some data, blocking * \param size how much data to read * \return the receive buffer. It iempty if no data is available * \throws boost::system::system_error if any error * \throws timeout_exception in case of timeout */ std::vector<char> read(size_t size); /** * Read a string, blocking * Can only be used if the user is sure that the serial device will not * send binary data. For binary data read, use read() * The returned string is empty if no data has arrived * \param size hw much data to read * \return a string with the received data. * \throws boost::system::system_error if any error * \throws timeout_exception in case of timeout */ std::string readString(size_t size); /** * Read a line, blocking * Can only be used if the user is sure that the serial device will not * send binary data. For binary data read, use read() * The returned string is empty if the line delimiter has not yet arrived. * \param delimiter line delimiter, default="\n" * \return a string with the received data. The delimiter is removed from * the string. * \throws boost::system::system_error if any error * \throws timeout_exception in case of timeout */ std::string readStringUntil(const std::string& delim="\n"); ~CSerial(); private: /** * Parameters of performReadSetup. * Just wrapper class, no encapsulation provided */ class ReadSetupParameters { public: ReadSetupParameters(): fixedSize(false), delim(""), data(0), size(0) {} explicit ReadSetupParameters(const std::string& delim): fixedSize(false), delim(delim), data(0), size(0) { } ReadSetupParameters(char *data, size_t size): fixedSize(true), delim(""), data(data), size(size) { } //Using default copy constructor, operator= bool fixedSize; ///< True if need to read a fixed number of parameters std::string delim; ///< String end delimiter (valid if fixedSize=false) char *data; ///< Pointer to data array (valid if fixedSize=true) size_t size; ///< Array size (valid if fixedSize=true) }; /** * This member function sets up a read operation, both reading a specified * number of characters and reading until a delimiter string. */ void performReadSetup(const ReadSetupParameters& param); /** * Callack called either when the read timeout is expired or canceled. * If called because timeout expired, sets result to resultTimeoutExpired */ void timeoutExpired(const boost::system::error_code& error); /** * Callback called either if a read complete or read error occurs * If called because of read complete, sets result to resultSuccess * If called because read error, sets result to resultError */ void readCompleted(const boost::system::error_code& error, const size_t bytesTransferred); /** * Possible outcome of a read. Set by callbacks, read from main code */ enum ReadResult { resultInProgress, resultSuccess, resultError, resultTimeoutExpired }; boost::asio::io_service io; ///< Io service object boost::asio::serial_port port; ///< Serial port object boost::asio::deadline_timer timer; ///< Timer for timeout boost::posix_time::time_duration timeout; ///< Read/write timeout boost::asio::streambuf readData; ///< Holds eventual read but not consumed enum ReadResult result; ///< Used by read with timeout size_t bytesTransferred; ///< Used by async read callback ReadSetupParameters setupParameters; ///< Global because used in the OSX fix }; #endif //CSerial_H -- [logo Aston] MIKAEL PLOUHINEC miplouhinec(a)sqli.com T�l : +33(0) 2 51 79 77 40 - Mob : +33(0) 6 80 23 21 28 www.sqli.com - www.aston-ecole.com

1 0

[boost::iterators] Missing typedefs in v1.57
by news.gmane.org 01 Dec '14

01 Dec '14

The typedefs for difference_type and reference used to be in scope for classes derived from iterator_facade. Since v1.57 they have to be declared thus: typedef typename iterator_facade_::difference_type difference_type; typedef typename iterator_facade_::reference reference; This seems out of place for a class that was designed to reduce boiler plate code. However, if the change was intentional, please document it. Thanks, Keith MacDonald

1 0