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

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

12 Oct '19

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

3 2

Weird compilation error when using boost::geometry
by 邓尧 16 Nov '17

16 Nov '17

Hi, I have implemented my own "point" as specified by the point concept http://www.boost.org/doc/libs/1_59_0/libs/geometry/doc/html/geometry/refere… When I use it along with boost::geometry::model::polygon/multi_polygon, GCC refuses to compile, tested on GCC 4.9/5.2. What's even more weird is that CLANG 3.6 would happy accept my code. BTW, the Point implementation is part of a large project, it difficult to replace it with boost::geometry::model::point. Here is my code: Point.hpp > #ifndef RAPTOR_POINT_HPP_INCLUDED_ > > #define RAPTOR_POINT_HPP_INCLUDED_ > > >> #include <boost/mpl/int.hpp> > > #include <boost/geometry/core/access.hpp> > > #include <boost/geometry/core/cs.hpp> > > #include <boost/geometry/core/coordinate_type.hpp> > > #include <boost/geometry/core/coordinate_system.hpp> > > #include <boost/geometry/core/coordinate_dimension.hpp> > > #include <boost/geometry/geometries/polygon.hpp> > > #include <boost/geometry/multi/geometries/multi_polygon.hpp> > > >> namespace raptor { > > >> template<typename T, int tDimension = 2> > > class Point { > > public: > > Point() = default; > > >> Point(T a, T b) { > > data[0] = a; > > data[1] = b; > > } > > >> Point(T a, T b, T c) { > > data[0] = a; > > data[1] = b; > > data[2] = c; > > } > > >> T& operator [] (long index) { > > return data[index]; > > } > > >> const T& operator [] (long index) const { > > return data[index]; > > } > > >> private: > > T data[tDimension]; > > }; > > >> using CubicPoint = Point<long, 3>; > > using PlanarPoint = Point<long>; > > using SphericalPoint = Point<double>; > > >> template<typename T> > > using Polygon = boost::geometry::model::polygon<T>; > > >> template<typename T> > > using PolySet = boost::geometry::model::multi_polygon<Polygon<T>>; > > >> } // namespace raptor > > >> namespace boost { namespace geometry { namespace traits { > > >> template<typename Type, std::size_t tDimension> > > struct tag<::raptor::Point<Type, tDimension>> { > > typedef point_tag type; > > }; > > >> template<typename Type, std::size_t tDimension> > > struct coordinate_type<::raptor::Point<Type, tDimension>> { > > typedef Type type; > > }; > > >> template<typename Type, std::size_t tDimension> > > struct coordinate_system<::raptor::Point<Type, tDimension>> { > > typedef boost::geometry::cs::cartesian type; > > }; > > >> template<typename Type, std::size_t tDimension> > > struct dimension<::raptor::Point<Type, tDimension>> > > : public boost::mpl::int_<tDimension> { > > // EMPTY > > }; > > >> template<typename Type, std::size_t tDimension, std::size_t tIndex> > > struct access<::raptor::Point<Type, tDimension>, tIndex> { > > static Type get(const ::raptor::Point<Type, tDimension>& p) { > > return p[tIndex]; > > } > > >> static void set(::raptor::Point<Type, tDimension>& p, > > const Type& value) { > > p[tIndex] = value; > > } > > }; > > >> }}} // namespace boost::geometry::traits > > >> #endif // RAPTOR_POINT_HPP_INCLUDED_ > > A real simple main.cpp: > #include "Point.hpp" > > >> int main() { > > raptor::Polygon<raptor::SphericalPoint> pl; > > raptor::PolySet<raptor::SphericalPoint> set; > > return sizeof(pl) + sizeof(set); > > } > > > GCC compilation error: g++ main.cpp -std=c++14 > In file included from /usr/include/boost/geometry/core/access.hpp:20:0, from Point.hpp:5, from main.cpp:1: /usr/include/boost/geometry/core/point_type.hpp: In instantiation of > 'struct boost::geometry::traits::point_type<raptor::Point<double> >': /usr/include/boost/geometry/core/point_type.hpp:66:17: required from > 'struct boost::geometry::core_dispatch::point_type<void, > raptor::Point<double> >' /usr/include/boost/geometry/core/coordinate_type.hpp:58:62: required from > 'struct boost::geometry::core_dispatch::coordinate_type<void, > raptor::Point<double> >' /usr/include/boost/geometry/core/coordinate_type.hpp:92:25: required from > 'struct boost::geometry::coordinate_type<raptor::Point<double> >' /usr/include/boost/geometry/geometries/concepts/point_concept.hpp:90:54: > required from 'class boost::geometry::concept::Point<raptor::Point<double> > >' /usr/include/boost/concept/detail/has_constraints.hpp:32:62: required by > substitution of 'template<class Model> boost::concepts::detail::yes > boost::concepts::detail::has_constraints_(Model*, > boost::concepts::detail::wrap_constraints<Model, (& Model:: constraints)>*) > [with Model = boost::geometry::concept::Point<raptor::Point<double> >]' /usr/include/boost/concept/detail/has_constraints.hpp:42:5: required from > 'const bool > boost::concepts::not_satisfied<boost::geometry::concept::Point<raptor::Point<double> > > >::value' /usr/include/boost/concept/detail/has_constraints.hpp:45:31: required > from 'struct > boost::concepts::not_satisfied<boost::geometry::concept::Point<raptor::Point<double> > > >' /usr/include/boost/mpl/if.hpp:67:11: required from 'struct > boost::mpl::if_<boost::concepts::not_satisfied<boost::geometry::concept::Point<raptor::Point<double> > > >, > boost::concepts::constraint<boost::geometry::concept::Point<raptor::Point<double> > > >, boost::concepts::requirement<boost::concepts::failed************ > boost::geometry::concept::Point<raptor::Point<double> >::************> >' /usr/include/boost/concept/detail/general.hpp:50:8: required from 'struct > boost::concepts::requirement_<void > (*)(boost::geometry::concept::Point<raptor::Point<double> >)>' /usr/include/boost/geometry/geometries/ring.hpp:60:5: required from > 'class boost::geometry::model::polygon<raptor::Point<double>, true, true, > std::vector, std::vector, std::allocator, std::allocator>' main.cpp:4:42: required from here /usr/include/boost/geometry/core/point_type.hpp:45:5: error: no matching > function for call to 'assertion_failed(mpl_::failed************ > (boost::geometry::traits::point_type<raptor::Point<double> > >::NOT_IMPLEMENTED_FOR_THIS_POINT_TYPE::************)(mpl_::assert_::types<raptor::Point<double>, > mpl_::na, mpl_::na, mpl_::na>))' BOOST_MPL_ASSERT_MSG ^ /usr/include/boost/mpl/assert.hpp:82:5: note: candidate: template<bool C> > int mpl_::assertion_failed(typename mpl_::assert<C>::type) int assertion_failed( typename assert<C>::type ); ^ /usr/include/boost/mpl/assert.hpp:82:5: note: template argument > deduction/substitution failed: /usr/include/boost/geometry/core/point_type.hpp:45:5: note: cannot > convert > 'boost::geometry::traits::point_type<Geometry>::NOT_IMPLEMENTED_FOR_THIS_POINT_TYPE48::assert_arg<raptor::Point<double> > >()' (type 'mpl_::failed************ > (boost::geometry::traits::point_type<raptor::Point<double> > >::NOT_IMPLEMENTED_FOR_THIS_POINT_TYPE::************)(mpl_::assert_::types<raptor::Point<double>, > mpl_::na, mpl_::na, mpl_::na>)') to type 'mpl_::assert<false>::type {aka > mpl_::assert<false>}' BOOST_MPL_ASSERT_MSG ^ In file included from > /usr/include/boost/geometry/core/coordinate_type.hpp:21:0, from /usr/include/boost/geometry/core/access.hpp:24, from Point.hpp:5, from main.cpp:1: /usr/include/boost/geometry/core/point_type.hpp: In instantiation of > 'struct boost::geometry::core_dispatch::point_type<void, > raptor::Point<double> >': /usr/include/boost/geometry/core/coordinate_type.hpp:58:62: required from > 'struct boost::geometry::core_dispatch::coordinate_type<void, > raptor::Point<double> >' /usr/include/boost/geometry/core/coordinate_type.hpp:92:25: required from > 'struct boost::geometry::coordinate_type<raptor::Point<double> >' /usr/include/boost/geometry/geometries/concepts/point_concept.hpp:90:54: > required from 'class boost::geometry::concept::Point<raptor::Point<double> > >' /usr/include/boost/concept/detail/has_constraints.hpp:32:62: required by > substitution of 'template<class Model> boost::concepts::detail::yes > boost::concepts::detail::has_constraints_(Model*, > boost::concepts::detail::wrap_constraints<Model, (& Model:: constraints)>*) > [with Model = boost::geometry::concept::Point<raptor::Point<double> >]' /usr/include/boost/concept/detail/has_constraints.hpp:42:5: required from > 'const bool > boost::concepts::not_satisfied<boost::geometry::concept::Point<raptor::Point<double> > > >::value' /usr/include/boost/concept/detail/has_constraints.hpp:45:31: required > from 'struct > boost::concepts::not_satisfied<boost::geometry::concept::Point<raptor::Point<double> > > >' /usr/include/boost/mpl/if.hpp:67:11: required from 'struct > boost::mpl::if_<boost::concepts::not_satisfied<boost::geometry::concept::Point<raptor::Point<double> > > >, > boost::concepts::constraint<boost::geometry::concept::Point<raptor::Point<double> > > >, boost::concepts::requirement<boost::concepts::failed************ > boost::geometry::concept::Point<raptor::Point<double> >::************> >' /usr/include/boost/concept/detail/general.hpp:50:8: required from 'struct > boost::concepts::requirement_<void > (*)(boost::geometry::concept::Point<raptor::Point<double> >)>' /usr/include/boost/geometry/geometries/ring.hpp:60:5: required from > 'class boost::geometry::model::polygon<raptor::Point<double>, true, true, > std::vector, std::vector, std::allocator, std::allocator>' main.cpp:4:42: required from here /usr/include/boost/geometry/core/point_type.hpp:66:17: error: no type named > 'type' in 'struct boost::geometry::traits::point_type<raptor::Point<double> > >' >::type type; ^ In file included from > /usr/include/boost/geometry/geometries/polygon.hpp:26:0, from Point.hpp:10, from main.cpp:1: /usr/include/boost/geometry/geometries/concepts/point_concept.hpp: In > instantiation of 'class > boost::geometry::concept::Point<raptor::Point<double> >': /usr/include/boost/concept/detail/has_constraints.hpp:32:62: required by > substitution of 'template<class Model> boost::concepts::detail::yes > boost::concepts::detail::has_constraints_(Model*, > boost::concepts::detail::wrap_constraints<Model, (& Model:: constraints)>*) > [with Model = boost::geometry::concept::Point<raptor::Point<double> >]' /usr/include/boost/concept/detail/has_constraints.hpp:42:5: required from > 'const bool > boost::concepts::not_satisfied<boost::geometry::concept::Point<raptor::Point<double> > > >::value' /usr/include/boost/concept/detail/has_constraints.hpp:45:31: required > from 'struct > boost::concepts::not_satisfied<boost::geometry::concept::Point<raptor::Point<double> > > >' /usr/include/boost/mpl/if.hpp:67:11: required from 'struct > boost::mpl::if_<boost::concepts::not_satisfied<boost::geometry::concept::Point<raptor::Point<double> > > >, > boost::concepts::constraint<boost::geometry::concept::Point<raptor::Point<double> > > >, boost::concepts::requirement<boost::concepts::failed************ > boost::geometry::concept::Point<raptor::Point<double> >::************> >' /usr/include/boost/concept/detail/general.hpp:50:8: required from 'struct > boost::concepts::requirement_<void > (*)(boost::geometry::concept::Point<raptor::Point<double> >)>' /usr/include/boost/geometry/geometries/ring.hpp:60:5: required from > 'class boost::geometry::model::polygon<raptor::Point<double>, true, true, > std::vector, std::vector, std::allocator, std::allocator>' main.cpp:4:42: required from here /usr/include/boost/geometry/geometries/concepts/point_concept.hpp:93:10: > error: 'value' is not a member of > 'boost::geometry::dimension<raptor::Point<double> >' enum { ccount = dimension<Geometry>::value }; ^ Where is the problem ? or it's a GCC bug ? Thanks

3 4

[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

[Interprocess] Communication between x86 and x64 issue
by Toni Neubert 19 Feb '16

19 Feb '16

I want to communicate between different platforms using boost interprocess. I am using vc12 and boost 1.58 on windows 7. My code below is a very simple example, that should work. But it doesn't for communications between different platforms... If I create it in x64 and open in win32, the process stuck at a lock at function try_based_lock in boost/int/sync/detail/common_algorithms.hpp In the other way around: win32 create, x64 open: the process crashes at name_length in segment_manager_helper.hpp while trying to find the name in index (priv_generic_find in segment_manager). #include <iostream> #include <boost/interprocess/managed_shared_memory.hpp> int main() { namespace bip = boost::interprocess; // open in WIN32, create in x64 #ifdef _WIN32 bip::managed_shared_memory msm(bip::open_only, "TestIPC"); #elsif X64 bip::shared_memory_object::remove("TestIPC"); bip::managed_shared_memory msm(bip::create_only, "TestIPC", 4096); msm.construct<uint32_t>("Data")[1](10); #endif // Get Data and print it auto data = msm.find<uint32_t>("Data"); if (data.second == 1) { std::cout << *data.first << std::endl; } std::cin.ignore(); return 0; } Does anybody have experience in this? Thank you in advance!

3 2

[Boost.LexicalCast] problem with 1.59 in Solaris
by dariomt＠gmail.com 28 Jan '16

28 Jan '16

Trying to compile file libs/date_time/src/gregorian/greg_month.cpp I get an error related to Boost.LexicalCast. I have reduced the problem to a minimal test case: #include <string> #include <boost/lexical_cast.hpp> void f(const char* s) { std::string s1(boost::lexical_cast<std::string>(s)); } My feeling is that this compiler has problems in the specializations for boost::detail::is_stdstring and boost::detail::is_char_array_to_stdstring. If I remove all those specializations the error goes away. I assume this is not the perfect solution because I guess this will miss some optimization of lexical_cast, but at least I can compile it this way :( Is there a better solution for this? Has this problem been fixed in 1.60? Error message (full instantiation stack available if needed): "/ThirdPartyLibs/boost/1_59_0/boost/lexical_cast/try_lexical_convert.hpp", line 146: Error: Ambiguous partial specialization for boost::detail::is_char_array_to_stdstring<std::string, const char*>, boost::detail::is_char_array_to_stdstring<boost::container::basic_string<boost::detail::CharT, boost::detail::Traits, boost::detail::Alloc>, const boost::detail::CharT*> and boost::detail::is_char_array_to_stdstring<std::basic_string<boost::detail::CharT, boost::detail::Traits, boost::detail::Alloc>, const boost::detail::CharT*>. "/ThirdPartyLibs/boost/1_59_0/boost/lexical_cast.hpp", line 42: Where: While instantiating "boost::conversion::detail::try_lexical_convert<std::string, const char*>(const char*const&, std::string &)". "/ThirdPartyLibs/boost/1_59_0/boost/lexical_cast/try_lexical_convert.hpp", line 134: Error: Ambiguous partial specialization for boost::detail::is_stdstring<std::string>, boost::detail::is_stdstring<boost::container::basic_string<boost::detail::CharT, boost::detail::Traits, boost::detail::Alloc>> and boost::detail::is_stdstring<std::basic_string<boost::detail::CharT, boost::detail::Traits, boost::detail::Alloc>>. "/ThirdPartyLibs/boost/1_59_0/boost/lexical_cast.hpp", line 42: Where: While instantiating "boost::conversion::detail::try_lexical_convert<std::string, const char*>(const char*const&, std::string &)".

5 9

Re: [Boost-users] Using Coroutines in the Visitor Pattern (use-case: BGL event visitor)
by alex 20 Jan '16

20 Jan '16

>-----Original Message----- >From: Boost-users [mailto:boost-users-bounces@lists.boost.org] On Behalf Of >Daniel Hofmann >Sent: 17 November 2015 15:55 >To: boost-users(a)lists.boost.org >Subject: [Boost-users] Using Coroutines in the Visitor Pattern (use-case: BGL >event visitor) > >(Disclaimer: this is not only specific to BGL, I can think of similar >use-cases where the visitor pattern is used --- I will still explain it >in the BGL context, as it is probably easier to understand) > > >Suppose you have a BGL graph and want to implement s-t shortest path >queries. It is possible to do this by using a bi-directional approach, >that is starting a Dijkstra search [1] from the start and starting a >additional Dijkstra search from the target. As soon as they "meet in the >middle", you can unpack the two sub-paths. > >[snip] > >It then came to my mind that I could use Coroutines for cooperative >multitasking, without the downsides that come with threading. > >My idea was to invert the callbacks using Coroutines as it is shown in >the SAX parsing example [3], in order to get a lazy range of vertices >each visitor examines. I then could simply walk the two ranges, >terminating as soon as there is the same element in both. Jeremiah Willcock gave a good description of how this could work: http://lists.boost.org/Archives/boost/2012/07/195300.php The way he describes it is really using coroutines instead of the visitor pattern. > > >But due to way the dijkstra_shortest_path function adds an additional >level of indirection I failed to implement this, and I have strong >doubts that it is possible with Coroutines at all. I> >I'm mainly struggling with wrapping my head around stopping and resuming >the dijkstra_shortest_path function, when all I can modify is the >visitor it takes. That is, the reason I can not make it work is that I >can not launch two dijkstra_shortest_path functions asynchronously with >just Coroutines. > I think there are two options: 1. Let your visitor throw an exception to get out of the dijkstra shortest path function; use some version of the function that skips initialization to resume again (the existing dijkstra_shortest_path_no_init is not good enough, so you would have to make one). 2. Reimplement the dijkstra function as a coroutine. I have implemented both, but have only really used option 1; whereas option 2 remained a toy experiment. In both cases the tricky part was to properly initialize and keep track of(and not re-initialize on resume) all parameters that are input to the dijkstra function, i.e. color_map, queue, distance_map, etc. https://github.com/ahhz/resumable_dijkstra I used the lightweight stackless coroutine of Boost ASIO. http://www.boost.org/doc/libs/1_59_0/doc/html/boost_asio/reference/coroutine .html >The control flow I need would probably look like this: start the first >Dijkstra search, on its first vertex it visits, "jump back out" and >start the second Dijkstra visitor. From there on ping-pong between the >two visitors exclusively. And I'm not sure this is possible with the >Coroutine approach. > It depends how much you are willing to re-implement. It is possible in principle >I appreciate any tips in this regard, even if it's a "just use your 15 >lines of threading code instead of trying to be fancy" :) > I think it would be great to have a fancy solution for this in BGL.

3 14

Using Coroutines in the Visitor Pattern (use-case: BGL event visitor)
by Daniel Hofmann 19 Jan '16

19 Jan '16

(Disclaimer: this is not only specific to BGL, I can think of similar use-cases where the visitor pattern is used --- I will still explain it in the BGL context, as it is probably easier to understand) Suppose you have a BGL graph and want to implement s-t shortest path queries. It is possible to do this by using a bi-directional approach, that is starting a Dijkstra search [1] from the start and starting a additional Dijkstra search from the target. As soon as they "meet in the middle", you can unpack the two sub-paths. In terms of the BGL this would roughly look like the following (simplified, with synchronization and visitor omitted): Vertex middle; async(dijkstra_shortest_paths(g, start, visitor(v{middle}))); async(dijkstra_shortest_paths(g, target, visitor(v{middle}))); where the visitors single-step all vertices in their examine_vertex callback [2] and check if they met in the middle. While this is quite easy to implement with threading, is has its downsides, mainly in synchronization for this ping-pong play between the two visitors, resulting in contention on the synchronization locks. But also the overhead of using threads might be too high for smaller graphs. It then came to my mind that I could use Coroutines for cooperative multitasking, without the downsides that come with threading. My idea was to invert the callbacks using Coroutines as it is shown in the SAX parsing example [3], in order to get a lazy range of vertices each visitor examines. I then could simply walk the two ranges, terminating as soon as there is the same element in both. But due to way the dijkstra_shortest_path function adds an additional level of indirection I failed to implement this, and I have strong doubts that it is possible with Coroutines at all. I'm mainly struggling with wrapping my head around stopping and resuming the dijkstra_shortest_path function, when all I can modify is the visitor it takes. That is, the reason I can not make it work is that I can not launch two dijkstra_shortest_path functions asynchronously with just Coroutines. The control flow I need would probably look like this: start the first Dijkstra search, on its first vertex it visits, "jump back out" and start the second Dijkstra visitor. From there on ping-pong between the two visitors exclusively. And I'm not sure this is possible with the Coroutine approach. I appreciate any tips in this regard, even if it's a "just use your 15 lines of threading code instead of trying to be fancy" :) Cheers, Daniel J H [1] http://www.boost.org/doc/libs/1_59_0/libs/graph/doc/dijkstra_shortest_paths… [2] http://www.boost.org/doc/libs/1_59_0/libs/graph/doc/DijkstraVisitor.html [3] http://www.boost.org/doc/libs/1_59_0/libs/coroutine/doc/html/coroutine/moti…

2 4

Feedback boost conan binary packages
by Luis 07 Jan '16

07 Jan '16

Dear Boost Users, Disclaimer: I am founder and developer of conan.io C++ package manager. Please note that it is just a FOSS project, MIT license, fully decentralized, and although I'd like to promote the tool and receive feedback about it, there are already channels for that conversation in the github repos. What I'd really like is to get feedback about the Boost packages I am creating and maintaining in conan. I have generated almost 190 different binary packages for Boost versions 1.57-1.60 ( https://www.conan.io/search?q=Boost%20AND%20user:lasote) for Linux, Win, Mac and different flavours of compilers (gcc 4.7-5.3, VS12-14) and settings (Debug, Release). You can read a quick getting started on such Boost packages in: http://docs.conan.io/en/latest/examples/boost.html If someone has been able to try it, I'd like to know several things: - whether it is interesting to have pre-compiled packages or you always prefer to build from source (i.e. always using the --build option in conan). So far there are about 200 downloads of binary packages, but probably many people prefer to build from source. - It has dependencies to already existing zlib and bzip2 conan packages (can be shared or static). Are you fine with these? Any other Boost dependencies missing that you would like to automate? - It is probably the largest package so far, have you experienced slow downloads? You can report issues and feedback in the conan-boost repo: https://github.com/lasote/conan-boost/issues. Thanks very much, Luis

2 2

Re: [Boost-users] boost program options
by avib369 . 06 Jan '16

06 Jan '16

With reference to boost 1.59 and program options. The following test passes on boost 1.53, but fails on boost 1.59. I need to able to handle. --arg1 10 and --arg1=10 boost 1.59 now fails on '--arg1 10', with test below with option value being empty. #include <string> #include <iostream> #include <fstream> #include <boost/test/unit_test.hpp> #include <boost/foreach.hpp> #include <boost/program_options.hpp> using namespace std; namespace po = boost::program_options; BOOST_AUTO_TEST_SUITE( BaseTestSuite ) BOOST_AUTO_TEST_CASE( test_program_options_implicit_value ) { cout << "Base:: ...test_program_options_implicit_value\n"; // Declare the supported options. po::options_description desc("Allowed options"); desc.add_options() ("help", "produce help message") ("arg1", po::value<string>()->implicit_value( string("") ), "optional arg1 description") ; { char* argv[] = { const_cast<char*>("test_program_options_implicit_value"), const_cast<char*>("--help"), const_cast<char*>("--arg1") }; po::variables_map vm; po::store(po::parse_command_line(3, argv, desc), vm); po::notify(vm); BOOST_CHECK_MESSAGE(vm.count("help"), "Expected help"); BOOST_CHECK_MESSAGE(vm.count("arg1"), "Expected arg1"); BOOST_CHECK_MESSAGE(vm["arg1"].as<string>() == "", "Expected arg1 to be empty"); } { // ****** This fails on boost 1.59 bit passes in boost 1.53 ******* char* argv[] = { const_cast<char*>("test_program_options_implicit_value"), const_cast<char*>("--arg1"), const_cast<char*>("10") }; po::variables_map vm; po::store(po::command_line_parser(3, argv, desc), vm); po::notify(vm); BOOST_CHECK_MESSAGE(vm.count("arg1"), "Expected arg1"); BOOST_CHECK_MESSAGE(vm["arg1"].as<string>() == "10", "Expected arg1 with value of 10 but found '" << vm["arg1"].as<string>() << "'"); } { char* argv[] = { const_cast<char*>("test_program_options_implicit_value"), const_cast<char*>("--arg1=11") }; po::variables_map vm; po::store(po::parse_command_line(2, argv, desc), vm); po::notify(vm); BOOST_CHECK_MESSAGE(vm.count("arg1"), "Expected arg1"); BOOST_CHECK_MESSAGE(vm["arg1"].as<string>() == "11", "Expected arg1 with value of 11 but found " << vm["arg1"].as<string>()); } } Ta, Avi

2 1

boost program_options
by avib369 . 06 Jan '16

06 Jan '16

There seems to be change/regression in boost program options. In boost/1.53. I used boost::program_options::variables_map vm; po::store( po::parse_command_line( argc, argv, desc_ , po::command_line_style::unix_style ^ po::command_line_style::allow_short), vm ); po::notify( vm ); This could handle arguments like: ./exe --help all ./exe --help summary However from boost 1.59, this no longer works, instead I have to use: ./exe --help=all ./exe --help=summary Is this a known change ? how do i get back to the old functionality ? Ta, Avi

2 1

[regex] link errors on 1.60 update
by James Walker 06 Jan '16

06 Jan '16

When I tried to convert my project from Boost 1.58.0 to 1.60.0, I got some link errors. This is using Xcode 4.6.3 on Mac OS X 10.7.5. I'm compiling all the sources in libs/regex/src. Help? Undefined symbols for architecture i386: "boost::re_detail_106000::perl_matcher<char const*, std::allocator<boost::sub_match<char const*> >, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::construct_init(boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags)", referenced from: boost::re_detail_106000::perl_matcher<char const*, std::allocator<boost::sub_match<char const*> >, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::perl_matcher(char const*, char const*, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >&, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags, char const*) in BVHJointMap.o boost::re_detail_106000::perl_matcher<char const*, std::allocator<boost::sub_match<char const*> >, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::perl_matcher(char const*, char const*, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >&, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags, char const*) in AnimationsManager.o "boost::re_detail_106000::perl_matcher<char const*, std::allocator<boost::sub_match<char const*> >, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::find()", referenced from: bool boost::regex_search<char const*, char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >(char const*, char const*, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags) in BVHJointMap.o "boost::re_detail_106000::perl_matcher<char const*, std::allocator<boost::sub_match<char const*> >, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::match()", referenced from: bool boost::regex_match<char const*, std::allocator<boost::sub_match<char const*> >, char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >(char const*, char const*, boost::match_results<char const*, std::allocator<boost::sub_match<char const*> > >&, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags) in AnimationsManager.o

3 4

Boost 1.60.0 rc1 is now available
by Marshall Clow 05 Jan '16

05 Jan '16

Release candidate files for 1.60.0 are available at: http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: MD5 (boost_1_60_0_rc1.7z) = 7ce7f5a4e396484da8da6b60d4ed7661 MD5 (boost_1_60_0_rc1.tar.bz2) = 65a840e1a0b13a558ff19eeb2c4f0cbe MD5 (boost_1_60_0_rc1.tar.gz) = 28f58b9a33469388302110562bdf6188 MD5 (boost_1_60_0_rc1.zip) = 0cc5b9cf9ccdf26945b225c7338b4288 Thanks! -- The release managers P.S. Release notes are here: http://www.boost.org/users/history/version_1_60_0.html

4 8

[units] Adding two absolute units
by Itzik 03 Jan '16

03 Jan '16

Hello, <obligatory appreciation on first post> I started using Boost just for boost::units and I find new ways boost can help me almost every day. So thanks for the great stuff! </obligatory appreciation on first post> My question to the board is why two absolute quantities (si::temperature (K) in my case) can't be summed in boost::units? I realized that this is a rule enforced by-design (gmane.comp.lib.boost.user/71747), and I understand that it is probably not a very common case, but I wanted my code to solve a simple formula which requires adding up two absolute temperatures (quantity<absolute<temperature>>). Each temperature represents an Inlet temperature in a Heat Exchange system. So even if converting one temperature to a relative type (quantity<temperature>) might be a workaround, it seems like a forced misuse to me. Eventually it turned out that I was mistaken with the formula, and subtraction was required instead, so there's no problem there. Alas, there's also a much simpler use case: What if I want to average the temperature of the last N readouts? Shouldn't boost::units support this simple operation? I have no formal physics education, but intuitively, adding two absolute temperatures doesn't seem really like a mistake to me, even if it's an odd thing to do. Will appreciate your thoughts on the matter.

3 4

Modifying all matching elements in a Boost.MultiIndex Container
by Amit Prakash Ambasta 01 Jan '16

01 Jan '16

Hi, I am trying to modify members of all elements matching value for a given index in a boost.multiindex container index.modify( index.find(value), [](T& element) { ... } ) seems to update a singular element(first match) On the other hand, std::pair<index::iterator, index::iterator> iter = index.equal_range(value); while(iter.first != iter.second) { index.modify( iter.first, [](T& element) { ... } ); iter.first++; } leads to segfaults and unexpected behavior. What would be right way to approach this?

3 4

Pointer to objects in Boost.MultiIndex
by Amit Prakash Ambasta 01 Jan '16

01 Jan '16

Consider the following code snippet: #include <iostream> #include <boost/multi_index_container.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/member.hpp> using namespace std; using namespace boost::multi_index; struct LinkList; struct LinkList { size_t index; LinkList* parent; LinkList(size_t index, LinkList* parent) : index(index), parent(parent) {} }; struct llindex {}; typedef ordered_unique<tag<llindex>, member<LinkList, size_t, &LinkList::index> > LinkListIndex; typedef boost::multi_index_container<LinkList, indexed_by<LinkListIndex> > IndexedLinkList; template <typename T> void show(T& iterable) { for(auto const& element: iterable) { if(element.parent != nullptr) { std::cout << "Index<" << element.index << ">: " << element.parent->index << std::endl; } else { std::cout << "Index<" << element.index << ">: " << "NULL" << std::endl; } } } int main() { IndexedLinkList ill; auto &index_ll = ill.get<0>(); ill.insert(LinkList{0, nullptr}); ill.insert(LinkList{1, (LinkList*)(&(*index_ll.find(0)))}); ill.insert(LinkList{2, (LinkList*)(&(*index_ll.find(0)))}); ill.insert(LinkList{3, (LinkList*)(&(*index_ll.find(2)))}); show(ill); return 0; } Would (LinkList*)(&(*index__ll.find(value))) be the recommended way to fetch the pointer to parent?

2 3

[Boost.Serialization][Boost.Iterators] Problem with Boost 1.59.0 in Solaris with SunCC
by dariomt＠gmail.com 30 Dec '15

30 Dec '15

Hi all, I have found a problem compiling Boost, in libs/serialization/src/basic_text_oprimitive.cpp the usage of boost::iterator::iterator_facade is problematic. I have reduced it to a two line minimal case: #include <boost/archive/iterators/ostream_iterator.hpp> boost::archive::iterators::ostream_iterator<char> it; Trying to compile this with SunCC 5.10 (Sun Studio 12.1) in Solaris I get the following error: "boost/iterator/iterator_facade.hpp", line 779: Error: value is not a member of boost::iterators::detail::is_traversal_at_least<std::output_iterator_tag, boost::iterators::bidirectional_traversal_tag>. "boost/archive/iterators/ostream_iterator.hpp", line 40: Where: While specializing "boost::iterators::iterator_facade<boost::archive::iterators::ostream_iterator<char>, char, std::output_iterator_tag, boost::archive::iterators::ostream_iterator<char>&, int>". "boost/archive/iterators/ostream_iterator.hpp", line 40: Where: Specialized in boost::archive::iterators::ostream_iterator<char>. "fail.cpp", line 2: Where: Specialized in non-template code. I guess it must be some bug in the compiler, because if I try to instantiate directly the template mentioned in the error message it works fine. (i.e. value is indeed a member). #include <boost/iterator/iterator_facade.hpp> const bool value = boost::iterators::detail::is_traversal_at_least< std::output_iterator_tag, boost::iterators::bidirectional_traversal_tag >::value; For reference, this problem was *not* present in Boost 1.55.0. Thanks! PS: I have mentioned both libraries in the subject because I don't know if this is a problem with Boost.Iterator code, or with the usage of that library from Boost.Serialization.

3 2

[iostreams] Fix for Ticket #11860
by Gagan Kumar 28 Dec '15

28 Dec '15

Bug Ticket ( https://svn.boost.org/trac/boost/ticket/11860 ) says "Using iostreams causes lots of messages about deprecated header template_arity_spec.hpp". Thus to reduce messages about deprecated header, I created a pull request here https://github.com/boostorg/iostreams/pull/24 . Regards Gagan

1 0

Implementation Of Natural Sort for C++
by Gagan Kumar 27 Dec '15

27 Dec '15

In Boost Trac, I found Natural Sort as Ticket #11021 (new Feature Requests). I too think it will be good for C++ to have it too. Thus I tried to make my Implementation on Natural Sort. Here, https://github.com/scopeInfinity/NaturalSort Can this be included in Boost extensions, or can you please guide me to make it better so that It can be included. Regards Gagan Kumar Natural Sort Example - Inputs : Hello 100 Hello 34 Hello 9 Hello 25 Hello 10 Hello 8 Normal Sort Output : Hello 10 Hello 100 Hello 25 Hello 34 Hello 8 Hello 9 Natural Sort Output : Hello 8 Hello 9 Hello 10 Hello 25 Hello 34 Hello 100 | | | | | | | | | | | scopeInfinity/NaturalSortNaturalSort - C++ Implementation of Natural Comparision and Natural Sort | | | | View on github.com | Preview by Yahoo | | | | |

1 0

[multi_index] do erase() call key extractors?
by Nick Stokes 25 Dec '15

25 Dec '15

This is probably rather obvious, but I wasn't able to locate this guarantee in MIC docs. Take, struct Foo { explicit Foo(Bar* b = nullptr) : bar(b) {} Bar* bar; }; int getBarValue (const Foo& f) { assert( f.bar ); return f.bar->getValue(); } boost::multi_index< Foo, indexed_by< < hashed_unique < member<Foo, Bar* , &Foo::bar > >> , hashed_non_unique < global_fun<const Foo&, int, &getBarValue >> >> FooIndex; void grill() { FooIndex fooIndex; Bar* b; { auto bWork = make_unique<Bar>(); // ... fooIndex.emplace( bWork.get() ); b = bWork.get(); } fooIndex.erase(b); // ... } Please ignore the fact that raw-pointers are potentially dangerous etc. The question is does erase() call getBarValue() despite the fact I am using the first index? More generally, do key extractors get called *at all* except at the point of insertion? Thanks, Nick

2 4

template error when using multi_index_container
by John M. Dlugosz 25 Dec '15

25 Dec '15

I'm getting a strange template instantiation error with a simple and reasonable use of multi_index_container, which I've written up in detail with a minimal program to reproduce here: http://stackoverflow.com/questions/34450642/why-is-this-member-function-a-d… This showed up in Visual Studio 2015, and has worked just fine for years on VS10 and on other platforms. I've tried updating Boost and new versions don't make any difference. This example was prepared using Boost 1.59, and I see the same thing with 1.60. —John

2 1

[container] Boost 1.60 Release link error
by Hickman, Steve (AdvTech) 24 Dec '15

24 Dec '15

Getting a linker error with the Windows version of Boost on release only (not debug) using v 1.60. This did not show up with 1.58 (I skipped 1.59 so I have no comment on it). I'm using the prebuilt libraries: 8> Creating library D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.lib and object D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.exp 8>MockDevice.lib(Mock.obj) : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<char> >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@D@container@boost@@@container_detail@container@boost@@QAEXXZ) 8>MockDevice.lib(Mock.obj) : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<class boost::container::basic_string<char,struct std::char_traits<char>,class boost::container::new_allocator<char> > const ,struct boost::interprocess::ipcdetail::ref_count_ptr>,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBV?$basic_string@DU?$char_traits@D@std@@V?$new_allocator@D@container@boost@@@container@boost@@Uref_count_ptr@ipcdetail@interprocess@3@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 8>D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.exe : fatal error LNK1120: 2 unresolved externals Steve Hickman System Architect, Human Machine Collaboration Honeywell | Aerospace Office: 480-236-8367 steve.hickman(a)honeywell.com https://in.honeywell.com/sites/aero/Pages/Home.aspx

3 2

Boost 1.60 causes argument-dependent-lookup issues.
by John M. Dlugosz 24 Dec '15

24 Dec '15

See http://stackoverflow.com/questions/34449254/how-is-argument-dependent-looku… I found that code that has worked OK on previous versions of Boost (and does not have this issues with 1.59) is getting unexpected ambiguities in 1.60. Using boost::totally_ordered et al. (even as a private base) appears to be polluting the namespace in which the client class appears. Something like this: class C : boost::totally_ordered<C> { ⋯ } ; using std::make_shared; ⋮ auto p= make_shared<C>(args); this complains that it finds boost::make_shared via argument-dependent lookup, as well as the expected std::make_shared.

1 0

Re: [Boost-users] Race in boost::condition_variable::wait
by Éric Malenfant 23 Dec '15

23 Dec '15

Not sure I understand your question. Unless I'm missing something, the guard in condition_variable::wait does not release the mutex, it is simply there to ensure that it is reacquired on exit. The mutex is released by pthread_cond_wait (atomically with the wait on the condition). Éric Malenfant Le 2015-12-22 8:30 PM, "Chris Stankevitz" <chrisstankevitz(a)gmail.com> a écrit : Hi, Regarding boost::condition_variable::wait (listed below with an obvious modification), It seems to me that there is a race condition because the following operations are not atomic: 1) unlocking of "m" 2) waiting on "cond". Can someone explain to me why boost::condition_variable::wait is not racing the user code in the example below? Thank you, Chris === inline void condition_variable::wait(unique_lock<mutex>& m) { int res=0; { thread_cv_detail::lock_on_exit<unique_lock<mutex> > guard; detail::interruption_checker check_for_interruption(&internal_mutex,&cond); guard.activate(m); #ifdef ENCOURAGE_DEADLOCK boost::this_thread::sleep_for(boost::chrono::seconds(100)); #endif do { res = pthread_cond_wait(&cond,&internal_mutex); } while (res == EINTR); } } === #define ENCOURAGE_DEADLOCK #include <boost/thread.hpp> int main() { boost::mutex Mutex; boost::condition_variable Condition; bool Quit = false; boost::thread Thread([&] { boost::unique_lock<boost::mutex> Lock(Mutex); while (!Quit) { Condition.wait(Lock); } }); boost::this_thread::sleep_for(boost::chrono::seconds(1)); boost::lock_guard<boost::mutex> Lock(Mutex); Quit = true; Condition.notify_all(); return 0; } _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 3

[boost][iterator] Regarding Ticket #11847
by Gagan Kumar 23 Dec '15

23 Dec '15

Hi, I am new and I wanted to contribute. The ticker #11847 says,"reference typedef no longer available in parent class of iterator_facade" but actually I think reference is available in class iterator_facade itself(boost/iterator/iterator_facade.hpp). But still we are not able to use reference in class simple_iterator : public boost::iterator_facade<simple_iterator<T>, T, boost::forward_traversal_tag> and then after a while I saw this http://stackoverflow.com/questions/1643035/propagating-typedef-from-based-t… >From my side I can only solve this kind of problem by using typename boost::iterators::iterator_facade<simple_iterator<T>, T, boost::iterators::forward_traversal_tag>::reference; or using alternative of reference as T& dereference() const { return *m_iter; } //T& instead of reference, as stated in Ticket Can somebody please tell me or guide me to a better way to solve this problem. Regards Gagan Kumar

2 1

Boost 1.60.0 has been released
by Marshall Clow 23 Dec '15

23 Dec '15

Release 1.60.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains one new library and numerous enhancements and bug fixes for existing libraries. New Libraries * VMD: Variadic Macro Data library, from Edward Diener For details, including download links, see http://www.boost.org/users/news/version_1.60.0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.60.0/ Tom Kent has made pre-built windows binaries, and they are available at: https://sourceforge.net/projects/boost/files/boost-binaries/1.60.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Vladimir Prus Rene Rivera Marshall Clow Eric Niebler Daniel James Beman Dawes

4 4

Race in boost::condition_variable::wait
by Chris Stankevitz 23 Dec '15

23 Dec '15

Hi, Regarding boost::condition_variable::wait (listed below with an obvious modification), It seems to me that there is a race condition because the following operations are not atomic: 1) unlocking of "m" 2) waiting on "cond". Can someone explain to me why boost::condition_variable::wait is not racing the user code in the example below? Thank you, Chris === inline void condition_variable::wait(unique_lock<mutex>& m) { int res=0; { thread_cv_detail::lock_on_exit<unique_lock<mutex> > guard; detail::interruption_checker check_for_interruption(&internal_mutex,&cond); guard.activate(m); #ifdef ENCOURAGE_DEADLOCK boost::this_thread::sleep_for(boost::chrono::seconds(100)); #endif do { res = pthread_cond_wait(&cond,&internal_mutex); } while (res == EINTR); } } === #define ENCOURAGE_DEADLOCK #include <boost/thread.hpp> int main() { boost::mutex Mutex; boost::condition_variable Condition; bool Quit = false; boost::thread Thread([&] { boost::unique_lock<boost::mutex> Lock(Mutex); while (!Quit) { Condition.wait(Lock); } }); boost::this_thread::sleep_for(boost::chrono::seconds(1)); boost::lock_guard<boost::mutex> Lock(Mutex); Quit = true; Condition.notify_all(); return 0; }

1 0

Not for publishing
by Soul Studios 22 Dec '15

22 Dec '15

To whoever it is that's been blocking my posts to the mailing list - with the exception of this email, please stop. I have chronic fatigue syndrome, and I feel like I'm fighting an uphill battle against the lack of documentation around actually doing documentation for boost. I would've understood if I'd said anything reasonably offensive, but I don't think I did.

1 0

Software Freedom Conservancy Support
by Jon Kalb 22 Dec '15

22 Dec '15

This is not a technical message, but instead focuses on Boost Administration. Software Freedom Conservancy in a Financial Fight for its Life Software Freedom Conservancy, the non-profit home of Boost is facing an existential threat. Historically, Conservancy has been funded by corporate donations. This works great when it works, but a management shake-up, change in priorities, or a bad quarter at a large donor can derail the organization¹s programs. It has become obvious that Conservancy must move to a Supporter-driven funding model, where individuals who believe in Conservancy¹s mission of supporting open source projects, such as Boost, make a personal commitment to support that effort. Conservancy's fundraiser, found at https://sfconservancy.org/supporter/, is centered around asking individuals who care about the work that Conservancy does to donate $120/year, or just $10/month, to support the organization. Conservancy seeks about 2,500 Supporters to continue its current work, and 750 Supporters to continue a ³bare minimum² of services to its projects. What does this mean to Boost? Boost receives a myriad of important services (see https://sfconservancy.org/members/services/ ) from Conservancy. We¹ve relied on Conservancy since 2007 to provide them. Here are some of the things that Conservancy does for Boost that are in the ³bare minimum² category: * Dealing with all the financial and contractual details regarding our annual C++ Now conference. It was BoostCon that brought Boost and Conservancy together. C++Now 2016 will the the tenth annual BoostCon and it is a tribute to what we¹ve accomplished working together. * Handle our Google Summer of Code payments and travel, including handling all financial transactions with Google to receive and then disperse the money. * Coordinating travel reimbursements for Boost contributors (both developers and students) to attend conferences. * Receiving and tracking all donations to Boost. * Keeping the non-profit status for us so that we don't have to form our own org and file our own paperwork. As the Chair of the Boost Steering Committee, I cannot overstate how important this is to our existence as an organization. Here are some of the services Boost has received in the wider category: * Dealing with questions from the community (including license-governing bodies like OSI) about Boost's license. * Discussing the issue of copyright governance and contributions with large corporations who want their employees to contribute to Boost but need legal assurances or have questions relating to Boost's license or contribution policies. * Reviewing and handling licensing terms of third-party software that relate to Boost in some way, and giving us feedback and answers about issues related to it. * General legal consulting on issues that we run into as an open source non-profit. As you can see, Boost really relies on the important work of Conservancy. Support from Boost Boost, like all of Conservancy¹s projects, contributes 10% of our revenue to Conservancy¹s general fund. (The other 90% is maintained and administered by Conservancy at the direction of the Boost Steering Committee to advance the Boost project.) But that 10% of revenue from all Conservancy¹s member projects doesn¹t add up to enough to even employee one full time person, let alone the already overworked staff of three that Conservancy has. Donors must make up the difference. When Conservancy launched its fundraising effort, I sent out a request to past BoostCon/C++Now attendees asking for support and I¹m proud and delighted to say that a number of Boost community members have already stepped up. One told me that her company will be matching her support. Boost is one of Conservancy¹s oldest and largest projects, so it is right that Boost community members make up a fair proportion of its supporters. I encourage you to choose Conservancy as one of your charitable gifts this holiday season. (Conservancy is a 501(c)(3) charity incorporated in New York, and donations are typically deductible on U.S. taxes.) Please visit: https://sfconservancy.org/supporter/ If you are able to join the others from the Boost community that are making this gift, please let me know. I¹d like to personally thank you. Jon Kalb Chair, Boost Steering Committee

1 0

boost.test: Run multiple tests
by Udo Steinbach 22 Dec '15

22 Dec '15

Hello, boost:test is a great tool. Now I have boost updated to v1.60 and can't run more than one tests at once. System is MinGW on Windows. Given suite_1 test_1_1 suite_1_2 test_1_2_1 and many more, all enabled by default, with v1.59 I could run these both test and exclude all others with --run_test=suite_1/test_1_1,suite_1/suite_1_2/test_1_2_1 respectively BOOST_TESTS_TO_RUN, but with v1.60 the result is "Test setup error: no test cases matching filter or all test cases were disabled". With --run_test=suite_1/test_1_1,suite1_2/test_1_2_1 only test_1_2_1 is executed. Same result with BOOST_TEST_RUN_FILTERS=suite_1/test_1_1,suite1_2/test_1_2_1 . With multiple --run_test= all is fine. But how do I execute multiple tests via variable? bye Udo -- Fahrradverkehr in Deutschland: http://radwege.udoline.de/ GPG: A245 F153 0636 6E34 E2F3 E1EB 817A B14D 3E7E 482E

2 2

Johnson all pair shortest path and output in a C array
by Paolo Bolzoni 22 Dec '15

22 Dec '15

Dear list, I need to get the all pair shortest path in a C array, to pass it to a java program. However johnson all pair shortest path[1] requires a BasicMatrix[2] as output, so a simple array won't do. At the moment I used few classes (see Matrix and MatrixR[3]) as wrapper around a std::vector and it works fine, but I was wondering if I am missing a simpler solution. Is there? Yours faithfully, Paolo [1]http://www.boost.org/doc/libs/release/libs/graph/doc/johnson_all_pairs_sh… [2]http://www.boost.org/doc/libs/release/libs/graph/doc/BasicMatrix.html [3] struct Matrix { Matrix(std::vector<int64_t>& storage, size_t rows, size_t columns) : m_(storage), columns_(columns) { m_.clear(); m_.resize(rows * columns_, int64_t{0}); } int64_t& get(size_t row, size_t column) { return m_[row * columns_ + column]; } std::vector<int64_t>& m_; size_t columns_; }; struct MatrixR; struct MatrixRR { MatrixRR(MatrixR const& m, size_t column) : m_(m), column_(column) {} int64_t& operator[] (size_t row) const; MatrixR const& m_; size_t column_; }; struct MatrixR { MatrixR(Matrix& m) : m_(m) {} MatrixRR operator[] (size_t column) const { return MatrixRR(*this, column); } Matrix& m_; }; int64_t & MatrixRR :: operator[] (size_t row) const { return m_.m_.get(row, column_); }

1 0

Re: [Boost-users] [container] Boost 1.60 Release link error
by Hickman, Steve (AdvTech) 21 Dec '15

21 Dec '15

I'm using VS2012 on Win 7 64bit building 32bit executables. --- Steve H. From: Hickman, Steve (AdvTech) Sent: Monday, December 21, 2015 11:14 AM To: 'boost-users(a)lists.boost.org' <boost-users(a)lists.boost.org> Subject: [container] Boost 1.60 Release link error Getting a linker error with the Windows version of Boost on release only (not debug) using v 1.60. This did not show up with 1.58 (I skipped 1.59 so I have no comment on it). I'm using the prebuilt libraries: 8> Creating library D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.lib and object D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.exp 8>MockDevice.lib(Mock.obj) : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<char> >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@D@container@boost@@@container_detail@container@boost@@QAEXXZ) 8>MockDevice.lib(Mock.obj) : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<class boost::container::basic_string<char,struct std::char_traits<char>,class boost::container::new_allocator<char> > const ,struct boost::interprocess::ipcdetail::ref_count_ptr>,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBV?$basic_string@DU?$char_traits@D@std@@V?$new_allocator@D@container@boost@@@container@boost@@Uref_count_ptr@ipcdetail@interprocess@3@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 8>D:\GITRepos\fd_x-current_feature\source\Devices\MockDevice\Test\Release\MockTest.exe : fatal error LNK1120: 2 unresolved externals Steve Hickman System Architect, Human Machine Collaboration Honeywell | Aerospace Office: 480-236-8367 steve.hickman(a)honeywell.com<mailto:steve.hickman@honeywell.com> https://in.honeywell.com/sites/aero/Pages/Home.aspx

1 0

segfault using boost::thread_specific_ptr
by Michael P. Soulier 21 Dec '15

21 Dec '15

Hello, I’m trying to implement a thread-safe logger that uses a boost::thread_specific_ptr to a std::stringstream as a logging buffer. static boost::thread_specific_ptr<std::stringstream> tls_buffer; class MLoggerHandler { public: MLoggerHandler(boost::mutex& mutex, std::ostream& ostream); ~MLoggerHandler(); void setLevel(int level); template <class T> // For handling << from any object. MLoggerHandler& operator <<(T input) { std::cerr << "Adding to buffer" << std::endl; if (m_start) { *tls_buffer << localDateTime() << " " << input; <================= SEGFAULT m_start = false; } else { *tls_buffer << input; } std::cerr << "On buffer: " << tls_buffer->str() << std::endl; return *this; } // For handling std::endl std::ostream& operator <<(std::ostream& (*f)(std::ostream&)) { std::cerr << "Flushing buffer" << std::endl; m_start = true; std::ostream& rv = f(m_ostream); m_mutex.lock(); m_ostream << tls_buffer->str(); m_mutex.unlock(); tls_buffer->str(""); return rv; } private: // A flag to indicate the beginning of a new line. bool m_start = true; // A mutex passed in from the main logger for synchronization. boost::mutex& m_mutex; // The logging level. int m_level; // The output stream. std::ostream& m_ostream; // Return the current date and time as a localized string. const std::string localDateTime(); }; The initial idea, was to flush the buffer and write when a terminating std::endl was encountered. But, just trying to dereference the pointer and write to the std::stringstream is crashing. Do I need to initialize the std::stringstream, or is it initialized in constructor? Thanks, Mike

2 3

Problems building with Windows 10.0.10586.0 SDK
by Isaac Lascasas 21 Dec '15

21 Dec '15

I have just downloaded boost 1.60 for a regular update, I have found some kind of build problem with my environment (vs2015 update 1 with Windows SDK 10.0.10586.0). I usually just do this to get a build: call bootstrap b2 headers bjam --build-type=complete --toolset=msvc-14.0 -j13 address-model=64 stage I have never required vcvarsall.bat as boost build allways finds its way. However today it wasn't able to find my windows headers so I manually did this: %comspec% /k ""C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\vcvarsall.bat"" x86_amd64 10.0.10586.0 Even so I found that boost was looking for sdk 10.0.10240.0 (an older one). In my system I still had that sdk directory, however it only contained some UCRT stuff. I uninstalled deliberately that version with my visual studio setup some days ago to upgrade to the new SDK. Until now I didn't found any problems. Maybe you should check this out a bit, I can't figure out if this is a problem of my environment, microsoft or boost build. Bringing 10240 back allows me to build boost 1.60 without any problems. My biggest concern is that boost is building against 10240 when 10586 is available and both are installed, even after an explicit vcvars call to stick to 10586. Best, Isaac Lascasas.

1 0

Duplicate function in composite_key.hpp ?
by John M. Dlugosz 21 Dec '15

21 Dec '15

I'm getting E:\C++Libs\boost_1_59_0\boost/multi_index/composite_key.hpp(638): error C2535: 'boost::multi_index::composite_key_result<boost::multi_index::composite_key<const vst::Foo1::Bar2::Baz3,boost::multi_index::const_mem_fun<vst::Foo1::Bar2::Baz3,UID,UID vst::Foo1::Bar2::Baz3::owner(void) const>,boost::multi_index::member<vst::Foo1::Bar2::Baz3,const uint32_t,pointer-to-member(0x18)>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>> boost::multi_index::composite_key<const vst::Foo1::Bar2::Baz3,boost::multi_index::const_mem_fun<vst::Foo1::Bar2::Baz3,UID,UID vst::Foo1::Bar2::Baz3::owner(void) const>,boost::multi_index::member<vst::Foo1::Bar2::Baz3,const uint32_t,pointer-to-member(0x18)>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>::operator ()(const boost::reference_wrapper<const Class> &) const': member function already defined or declared with [ Class=vst::Foo1::Bar2::Baz3 ] (compiling source file Bar2\Delta.cpp) (actual names from my code have been sanitized) Using Boost 1.59 and VS2015. The function it points to is result_type operator()(const reference_wrapper<value_type>& x)const but the error message looks like it is duplicating the previous function in the file, result_type operator()(const reference_wrapper<const value_type>& x)const and the chain of instantiation comes through composite_key.hpp, detail/ord_index_args.hpp(46), mpl/eval_if.hpp(41), detail/ord_index_args.hpp(70), ordered_index.hpp(65) with [ Arg1=boost::multi_index::tag<UID,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na,boost::mpl::na>, Arg2=boost::multi_index::composite_key<const vst::Foo1::Bar2::Baz3,boost::multi_index::const_mem_fun<vst::Foo1::Bar2::Baz3,UID,UID vst::Foo1::Bar2::Baz3::owner(void) const>,boost::multi_index::member<vst::Foo1::Bar2::Baz3,const uint32_t,pointer-to-member(0x18)>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>, Arg3=boost::mpl::na ] What's going on here? This worked previously with Boost 1.55 and VS2010.

1 0

[serialization] How to serialize an atomic<> value?
by Merrill Cornish 20 Dec '15

20 Dec '15

I am running Boost_1_60_0 on Windows 10 64bit on MinGW64: I have this class data member I want to serialize: std::atomic< std::time_t > mUpdate; Since I'm on a 64-bit machine, serialization recognizes that as atomic< long long int >. However, given ar & mUpdate; serialization says it does not know how to serialize atomic< long long int >. My solution, which compiles cleanly, is std::time_t updateTime = mUpdateTime.load(); ar & updateTime; mUpdateTime = updateTime; // assign is atomic My reasoning is that on load (ar => mUpdateTime), the first line is useless, but harmless. Similarly, on save (ar <= mUpdateTime), the last line is redundant, but also harmless. Of course, the application is not executing during serialization and de-serialization. As I said, this compiles without error or warning; but I worry that I have missed something. Any thoughts? Merrill Cornish Once I see how to get the above working, my next project will be std::atomic< std::shared_ptr< boost::variant<...> > mValue;

2 2

Why does BOOST_TEST() treat std::string as a collection?
by Brad Spencer 20 Dec '15

20 Dec '15

Why does BOOST_TEST() compare std::string values as collections instead of scalars (by default)? It's odd that the following produce different output, for example: BOOST_TEST(std::string("a") == "b"); BOOST_TEST(std::string("a") == std::string("b")); This will output: test.cc(6): error: in "test": check std::string("a") == "b" has failed [a != b] test.cc(7): error: in "test": check std::string("a") == std::string("b") has failed Note the lack of "[a != b]" on the second case. Also note that BOOST_CHECK_EQUAL() would emit as in the first form. This seems to be because std::string is_forward_iterable, and thus falls into the collection_comparison_op.hpp comparators instead of the scalar comparators. Is this intentional or an oversight? As a simple fix, adding a condition to the partial specialization of the collection_comparison_op.hpp comparators that specifically excludes std::string is enough to have std::string treated as scalars. For example, to handle std::string but not std::wstring with C++11 support: template<typename Lhs,typename Rhs> struct name<Lhs,Rhs,typename boost::enable_if_c< unit_test::is_forward_iterable<Lhs>::value && unit_test::is_forward_iterable<Rhs>::value && !(std::is_same<typename std::decay<Lhs>::type, std::string>::value || std::is_same<typename std::decay<Rhs>::type, std::string>::value) >::type (The above is an example and not a complete change supporting std::wstring and C++98.) -- Brad Spencer

2 1

Boost.Serialization broken for wchar_t
by gast128 19 Dec '15

19 Dec '15

following code used to work in boost 1.57 void f() { std::wstring wstr = L"\u20AC"; std::wofstream ofs(L"c:\\temp\\bla.xml"); boost::archive::xml_woarchive oa(ofs); oa << boost::serialization::make_nvp("tag", wstr); } However in 1.60 it gives an exception, since it cannot convert the uniocde character. It seems that in 1.57 in xml_woarchive_impl the utf8_codecvt_facet is set, but this has been disabled in 1.60. What is the solution / workaround?

2 3

boost::property_tree::read_json fails on previously supported comments 1.59
by Millman, Mark 18 Dec '15

18 Dec '15

I recently upgraded from 1.56 to 1.59 and my hundreds of well commented JSON parameter files now all fail on the first commented line. This is true for /* */ and // style comments. The exception.what() string thrown by boost::property_tree::read_json(filename,propertyTree) is filename.json(linenumber): expected key string. As I remove comments from my test JSON file the line number advances to the next comment. Any hints as to how to deal with this? Removing all my comments is not an option. Thanks, Mark --

2 5

[boost.users] [statechart] question about event processing rules in orthogonal states.
by Ernesto Rodriguez Reina 18 Dec '15

18 Dec '15

Hi everyone, The statechart search for an event handler in post-order (children first then parent), however when we have orthogonal states involved then the behaviour I am experiencing is different. Let say we have an state X with two children [orthogonal] states Y and W. Assuming none of the handlers discard (or defer) an event, the handler for that event is called in the following order: Y, X, W, X. Note that the handler of X is called twice. The following code demonstrates the issue: <code> struct EvTest : sc::event< EvTest > {}; struct Test; struct Inner1; struct Inner2; struct Machine : sc::state_machine< Machine, Test > {}; struct Test : sc::simple_state<Test, Machine, mpl::list<Inner1, Inner2> >{ typedef sc::custom_reaction< EvTest > reactions; sc::result react( const EvTest){ std::cout << "Test" << std::endl; // return discard_event(); return forward_event(); } }; struct Inner1 : sc::simple_state<Inner1, Test::orthogonal< 0 > >{}; struct Inner2 : sc::simple_state<Inner2, Test::orthogonal< 1 > >{ typedef sc::custom_reaction< EvTest > reactions; sc::result react( const EvTest){ std::cout << "Inner2" << std::endl; return forward_event(); } }; </code> When the event "EvTest" is received, the output I am getting is: <output> Test Inner2 Test </output> If there something that I am missing? Best, Ernesto Rodriguez Reina

1 0

how to help an object to delete itself the boost way
by Ireneusz Szcześniak 18 Dec '15

18 Dec '15

Hi, In my code there are objects created, which delete themselves. They can do it in the constructor, or later in some function. This is ugly, and I'm getting some wierd behaviour, probably because of this bad design. Is there a good Boost way of resolving my problem? Thanks, Irek

6 10

Negative effect of expected-to-fail tests in compiler development projects.
by Sergey Sprogis 18 Dec '15

18 Dec '15

I’m wondering how difficult it would be to add into bjam one option, something like: -negative_tests=off which will not launch any of negative (expected to fail) tests. For people who use Boost to test newly developed compilers negative tests are quite a nuisance. I mean those tests which got “compile_fail” and “run_fail” status inside final *.xml file generated at the end of Boost regression testing. [ they are also marked similarly inside Jamfiles ] That’s because newly developed compilers in their early stages of implementation normally have bugs which produce a lot o false error messages for correct Boost code. Important task here is to extract those messages, to evaluate them, and to prove that they are indeed correct, but compiler is wrong. And when hundreds of such false error messages are mixing together with thousands of legitimate error messages produced by negative tests (there are > 700 of them in boost.1.59.0, for example) it becomes a non-trivial task to filter them out. So the natural desire is not to launch such tests at all. Another, slightly unpleasant effect of negative tests is that they appear during so called “test pass rate” calculations during compiler testing process. Typically managers responsible for compiler development want to know the progress in terms of what “test pass rate” produces new compiler for the whole Boost testing or for the testing of some specific libraries. Normally such pass rate is calculated as the ratio between number of passed tests and the total number of tests. But ideally, tests in those calculations should be correct, so if they fail, it 100% means compiler bugs. And here again, negative tests are not useful, and should be avoided to make calculations more accurate. On a side note, I think it could be also useful to add such total testing pass rates into the Boost Regression Dashboard, so the quality of every tested compiler could be easy to seen. Much more people could be interested in looking at such dashboard, I guess.

5 6

boost::mutex::scoped_lock crashes on OSX
by David Medine 17 Dec '15

17 Dec '15

I am using boost in a python extension and it is having some problems on OSX. Specifically, I use a mutex of type boost::mutex in both the constructor and destructor methods. The constructor goes fine and the destructor crashes. The code works perfectly well on both Windows and Linux. When my class is building itself, it calls functions like this one a bunch of times: void enter_headers_phase(bool phase_locked) { if (phase_locked) { boost::mutex::scoped_lock lock(phase_mut_); headers_to_finish_++; } } where phase_mut_ is of type boost::mutex. When debugging in XCode, I see nice looking members for phase_mut_ at this point in the program: phase_mut_ (boost::mutex) m (pthread_mutex_t) __sig (long) 1297437784 1297437784 __opaque char [56] "" Later, when I am destroying, I make a nearly identical call as before: ... { boost::mutex::scoped_lock lock(phase_mut_); shutdown_ = true; } ... but now, my phase_mut_ looks like it has an apparently empty _sig member: phase_mut_ (boost::mutex) m (pthread_mutex_t) __sig (long) __opaque (char [56]) "" When we go down the line of the mutex code in boost and finally arrive at line 62 in boost/thread/pthread/mutex.hpp: ret = ::pthread_mutex_lock(m); I get a segmentation fault: EXC_BAD_ACCESS It seems like this is becausem->_sig is now empty for some reason, but I can not determine why (XCode's debugger won't let me 'watch' this variable) but it should certainly be the case that it doesn't get touched between the apparently successful constructor routines and now. This all happens on OSX Yosemite. I am compiling my extension with LLVM6.1 and I have gnu++0x as the C++ language dialect and libc++ as the stdlib. I am linking statically to boost 1.57 which I built using this command: sudo ./b2 -a cxxflags="-stdlib=libc++" linkflags="-stdlib=libc++" toolset=clang link=static link=shared threading=multi install --prefix=/opt/local --layout-tagged THX! -David

2 4

HP fortify Scan Issues
by Ganesh 17 Dec '15

17 Dec '15

I have run HP fortify scan on our code which uses Boos libraries for checking security vulnerabilities. During the scan I got issues reported in below two files. 1. compressed_pair.hpp2. next_prior.hpp The issue reported as below.1. compressed_pair.hpp (In line 154) LINE 153: compressed_pair_imp(first_param_type x, second_param_type y)LINE 154: : first_type(x), second_(y) {} Abstract: The program reads data from just outside the bounds of allocated memory. Explanation: Buffer overflow is probably the best known form of software security vulnerability. Most software developers know what a buffer overflow vulnerability is, but buffer overflow attacks against both legacy and newly-developed applications are still quite common. Part of the problem is due to the wide variety of ways buffer overflows can occur, and part is due to the error-prone techniques often used to prevent them. In a classic buffer overflow exploit, the attacker sends data to a program, which it stores in an undersized stack buffer. The result is that information on the call stack is overwritten, including the function's return pointer. The data sets the value of the return pointer so that when the function returns, it transfers control to malicious code contained in the attacker's data. 2. next_prior.hpp (In line 30) LINE 29: template <class T>LINE 30 inline T next(T x) { return ++x; } Abstract: The function next() in next_prior.hpp reads data from just outside the bounds of ~tp~1 on line 30. Explanation: Buffer overflow is probably the best known form of software security vulnerability. Most software developers know what a buffer overflow vulnerability is, but buffer overflow attacks against both legacy and newly-developed applications are still quite common. Part of the problem is due to the wide variety of ways buffer overflows can occur, and part is due to the error-prone techniques often used to prevent them. In a classic buffer overflow exploit, the attacker sends data to a program, which it stores in an undersized stack buffer. The result is that information on the call stack is overwritten, including the function's return pointer. The data sets the value of the return pointer so that when the function returns, it transfers control to malicious code contained in the attacker's data. Question is: Is this really an issue with the code? or boost has taken care of this out of bound in its code?

2 1

Size(Count of elements) in boost::multi_index_container?
by Amit Prakash Ambasta 17 Dec '15

17 Dec '15

Hi, How do I find out the size or count of elements added to a multi_index_container?

2 1

Re: [Boost-users] [Boost-announce] Boost 1.60.0 rc1 is now available
by Jan Mikkelsen 17 Dec '15

17 Dec '15

Hi, (Resending to avoid bouncing on the lists.) I can build the libraries on FreeBSD 10.2 with clang 3.7 and gcc 5.2 in various modes. However, with both clang 3.7 and gcc 5.2 the following program fails to compile: #define BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE #include <boost/thread.hpp> int main() { } This works fine with the same compilers and boost 1.59. The difference seems to be caused a change to boost/thread/detail/thread_group.hpp to use boost::csbl::unique_ptr<> instead of std::auto_ptr<>. Diff showing the change between 1.59 and 1.60 in thread_group.hpp and the compiler error messages below. Regards, Jan Mikkelsen $ diff -u thread/detail/thread_group.hpp ../../boost-1_60/boost/thread/detail/thread_group.hpp --- thread/detail/thread_group.hpp 2015-12-17 01:08:28.000000000 +1100 +++ ../../boost-1_60/boost/thread/detail/thread_group.hpp 2015-12-17 01:20:56.000000000 +1100 @@ -6,6 +6,7 @@ // (C) Copyright 2007-9 Anthony Williams #include <list> +#include <boost/thread/csbl/memory/unique_ptr.hpp> #include <boost/thread/shared_mutex.hpp> #include <boost/thread/mutex.hpp> #include <boost/thread/lock_guard.hpp> @@ -75,7 +76,7 @@ thread* create_thread(F threadfunc) { boost::lock_guard<shared_mutex> guard(m); - std::auto_ptr<thread> new_thread(new thread(threadfunc)); + boost::csbl::unique_ptr<thread> new_thread(new thread(threadfunc)); threads.push_back(new_thread.get()); return new_thread.release(); } $ g++5 -std=c++14 -isystem /usr/local/include/boost-1_60 twio/test_thread.cpp In file included from /usr/local/include/boost-1_60/boost/thread/csbl/memory/unique_ptr.hpp:16:0, from /usr/local/include/boost-1_60/boost/thread/detail/thread_group.hpp:9, from /usr/local/include/boost-1_60/boost/thread/thread.hpp:13, from /usr/local/include/boost-1_60/boost/thread.hpp:13, from twio/test_thread.cpp:2: /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp: In constructor 'boost::movelib::unique_ptr<T, D>::unique_ptr(boost::movelib::unique_ptr<T, D>&&)': /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:530:29: error: 'move_if_not_lvalue_reference' is not a member of 'boost' : m_data(u.release(), ::boost::move_if_not_lvalue_reference<D>(u.get_deleter())) ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:530:68: error: expected primary-expression before '>' token : m_data(u.release(), ::boost::move_if_not_lvalue_reference<D>(u.get_deleter())) ^ In file included from /usr/local/include/boost-1_60/boost/thread/csbl/memory/unique_ptr.hpp:16:0, from /usr/local/include/boost-1_60/boost/thread/detail/thread_group.hpp:9, from /usr/local/include/boost-1_60/boost/thread/thread.hpp:13, from /usr/local/include/boost-1_60/boost/thread.hpp:13, from twio/test_thread.cpp:2: /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp: In constructor 'boost::movelib::unique_ptr<T, D>::unique_ptr(boost::movelib::unique_ptr<Y, D>&&, typename boost::move_upd::enable_up_moveconv_constr<T, D, U, E>::type*)': /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:552:29: error: 'move_if_not_lvalue_reference' is not a member of 'boost' : m_data(u.release(), ::boost::move_if_not_lvalue_reference<E>(u.get_deleter())) ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:552:68: error: expected primary-expression before '>' token : m_data(u.release(), ::boost::move_if_not_lvalue_reference<E>(u.get_deleter())) ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp: In member function 'boost::movelib::unique_ptr<T, D>& boost::movelib::unique_ptr<T, D>::operator=(boost::movelib::unique_ptr<T, D>&&)': /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:581:26: error: 'move_if_not_lvalue_reference' is not a member of 'boost' m_data.deleter() = ::boost::move_if_not_lvalue_reference<D>(u.get_deleter()); ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:581:65: error: expected primary-expression before '>' token m_data.deleter() = ::boost::move_if_not_lvalue_reference<D>(u.get_deleter()); ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp: In member function 'typename boost::move_upd::enable_up_moveconv_assign<T, D, U, E, boost::movelib::unique_ptr<T, D>&>::type boost::movelib::unique_ptr<T, D>::operator=(boost::movelib::unique_ptr<Y, D>&&)': /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:603:26: error: 'move_if_not_lvalue_reference' is not a member of 'boost' m_data.deleter() = ::boost::move_if_not_lvalue_reference<E>(u.get_deleter()); ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:603:65: error: expected primary-expression before '>' token m_data.deleter() = ::boost::move_if_not_lvalue_reference<E>(u.get_deleter()); ^ $ clang++37 -std=c++14 -isystem /usr/local/include/boost-1_60 twio/test_thread.cpp In file included from twio/test_thread.cpp:2: In file included from /usr/local/include/boost-1_60/boost/thread.hpp:13: In file included from /usr/local/include/boost-1_60/boost/thread/thread.hpp:13: In file included from /usr/local/include/boost-1_60/boost/thread/detail/thread_group.hpp:9: In file included from /usr/local/include/boost-1_60/boost/thread/csbl/memory/unique_ptr.hpp:16: /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:530:67: error: 'D' does not refer to a value : m_data(u.release(), ::boost::move_if_not_lvalue_reference<D>(u.g... ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:353:26: note: declared here template <class T, class D = default_delete<T> > ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:530:38: error: no member named 'move_if_not_lvalue_reference' in namespace 'boost' : m_data(u.release(), ::boost::move_if_not_lvalue_reference<D>(u.g... ~~~~~~~~~^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:552:67: error: 'E' does not refer to a value : m_data(u.release(), ::boost::move_if_not_lvalue_reference<E>(u.g... ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:548:29: note: declared here template <class U, class E> ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:552:38: error: no member named 'move_if_not_lvalue_reference' in namespace 'boost' : m_data(u.release(), ::boost::move_if_not_lvalue_reference<E>(u.g... ~~~~~~~~~^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:581:64: error: 'D' does not refer to a value m_data.deleter() = ::boost::move_if_not_lvalue_reference<D>(u.get_... ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:353:26: note: declared here template <class T, class D = default_delete<T> > ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:581:35: error: no member named 'move_if_not_lvalue_reference' in namespace 'boost' m_data.deleter() = ::boost::move_if_not_lvalue_reference<D>(u.get_... ~~~~~~~~~^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:603:64: error: 'E' does not refer to a value m_data.deleter() = ::boost::move_if_not_lvalue_reference<E>(u.get_... ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:597:29: note: declared here template <class U, class E> ^ /usr/local/include/boost-1_60/boost/move/unique_ptr.hpp:603:35: error: no member named 'move_if_not_lvalue_reference' in namespace 'boost' m_data.deleter() = ::boost::move_if_not_lvalue_reference<E>(u.get_... ~~~~~~~~~^ 8 errors generated. > On 15 Dec 2015, at 02:54, Marshall Clow <mclow.lists(a)gmail.com <mailto:mclow.lists@gmail.com>> wrote: > > Release candidate files for 1.60.0 are available at: http://boost.cowic.de/rc/ <http://boost.cowic.de/rc/> > > As always, the release managers would appreciate it if you download > the candidate of your choice and give building it a try. Please report > both success and failure, and anything else that is noteworthy. > > This helps ensure the candidates build OK before we push them out to SourceForge. > > The files (and associated md5s) are: > MD5 (boost_1_60_0_rc1.7z) = 7ce7f5a4e396484da8da6b60d4ed7661 > MD5 (boost_1_60_0_rc1.tar.bz2) = 65a840e1a0b13a558ff19eeb2c4f0cbe > MD5 (boost_1_60_0_rc1.tar.gz) = 28f58b9a33469388302110562bdf6188 > MD5 (boost_1_60_0_rc1.zip) = 0cc5b9cf9ccdf26945b225c7338b4288 > > Thanks! > > -- The release managers > > P.S. Release notes are here: http://www.boost.org/users/history/version_1_60_0.html <http://www.boost.org/users/history/version_1_60_0.html> > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost-announce <http://lists.boost.org/mailman/listinfo.cgi/boost-announce>

1 0

multi_index::composite_key with char[]
by leyiliu 16 Dec '15

16 Dec '15

Hi,All: When I use the multi_index::composite_key with char[],I meet a error,when find a element。It seems to the make_tuple can't support the char[].Because the char[] more faster the std::string。So our project choose char[] as the column instead of std::string.So How should I do -- View this message in context: http://boost.2283326.n4.nabble.com/multi-index-composite-key-with-char-tp46… Sent from the Boost - Users mailing list archive at Nabble.com.

3 7

Regarding thread_specific_ptr's non-moveability
by Daniel Hofmann 15 Dec '15

15 Dec '15

thread_specific_ptr is currently (Boost 1.59) not moveable, since it defines a user-declared destructor and in addition (privately) user-declares the copy special member functions. Is this decision by design, or simply not yet updated to move semantics? >From what I can tell, a move should be possible along the lines of: auto* p = other.release(); // without invoking other's cleanup fn reset(p); // potentially differente cleanup fn associated The only problematic situation I can think of is a scenario with two semantically different custom cleanup function where a move eventually triggers only the second one. But this is behavior is consistent with move semantic. Cheers, Daniel J H References: > http://www.boost.org/doc/libs/1_59_0/doc/html/thread/thread_local_storage.h… > http://www.boost.org/doc/libs/1_59_0/boost/thread/tss.hpp

2 1

[smart_ptr] BugTicket #11843, Hash not supported for shared_ptr<T[N]>
by Gagan Kumar 15 Dec '15

15 Dec '15

I have tried to solve problem for hash not supported for shared_ptr<T[N]> https://github.com/boostorg/smart_ptr/pull/22 However, I wanted to know Is there a way to solve hash problem with shared_ptr<T[]>. Since hash here depends on all element and we can't get array size in this case. Still, does there exists way which I may be missing.

1 0

[PBGL] Very slow graph creation
by Quaglino Alessio 15 Dec '15

15 Dec '15

Hello, I am trying to parallelize my code and while the rest was easy, I have spent more than 1 month on the BGL part (despite it being only 2% of the runtime) without any success. I have written the following code: using namespace boost; using boost::graph::distributed::mpi_process_group; typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, undirectedS> Graph; typedef iterator_property_map<std::vector<int>::iterator, property_map<Graph, vertex_index_t>::type> LocalMap; int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, const std::vector<int> &isActive) { std::vector<int> localComponent(nV+1); std::vector<int> globalComponent(nV+1); Graph G(nV+1); // VERY SLOW!! // Add edges to the graph VERY SLOW!! for(std::vector<std::pair<int,int> >::iterator it = arcs.begin(); it != arcs.end(); ++it) if( isActive[arcCnt++]==0 ) add_edge(vertex(it->first,G),vertex(it->second,G),G); synchronize(G); // Compute number of connected components VERY SLOW with -np 2 LocalMap components(localComponent.begin(),get(vertex_index, G)); num = connected_components_ps(G, components); // Collect the global component vector components.set_max_ghost_cells(0); for( int i = 0; i < nV+1; i++ ) globalComponent[i] = get(components, vertex(i, G)); synchronize(components); } That parallelizes the following implementation: typedef adjacency_list <vecS, vecS, undirectedS> SerialGraph; int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, const std::vector<int> &isActive) { int rank; std::vector<int> globalComponent(nV+1); SerialGraph G(nV+1); MPI_Comm_rank(PETSC_COMM_WORLD, &rank); // Only rank 0 has got the arc data structure if( rank == 0 ) { // Add edges to the graph for(std::vector<std::pair<int,int> >::iterator it = arcs.begin(); it != arcs.end(); ++it) if( isActive[arcCnt++]==0 ) boost::add_edge(it->first,it->second,G); num = connected_components(G, &globalComponent[0]); } // Propagate size for allocation MPI_Bcast( &num, 1, MPI_INT, 0, PETSC_COMM_WORLD ); // Propagate connected components MPI_Bcast( &globalComponent[0], nV+1, MPI_INT, 0, PETSC_COMM_WORLD ); However, the parallel version on a single core is about 5 times slower than the non-parallel one. Moreover, on two cores it becomes 15-20 times slower. What am I doing wrong? Regards, Alessio

1 0

Boost 1.60.0 beta 1 Release Candidate 4 available for testing
by Marshall Clow 15 Dec '15

15 Dec '15

After far too long, release candidate files for 1.60.0 beta 4 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. Changes since rc3: * Boost.Test has been updated and now builds on Visual Studio Changes since rc1: * Boost.Sprit has been updated and Boost.Log now builds. * Boost.Math has been updated and now builds. Known issues (which will not be fixed for the beta): * Errors when building Boost.TypeErasure for older versions of Visual Studio. * Boost.Test fails when building on Darwin with gcc 4.9.2 The files (and associated md5s) are: MD5 (boost_1_60_0_b1_rc4.7z) = 63530c9594b24f56e5df79d910c9daeb MD5 (boost_1_60_0_b1_rc4.tar.bz2) = 29af12a1028536219a21517e953df4eb MD5 (boost_1_60_0_b1_rc4.tar.gz) = 74df7f5eb5e32f3a92b6141af3c6f541 MD5 (boost_1_60_0_b1_rc4.zip) = 90c25c34b64eb6cc88845ec5372938d7 Thanks! -- The release managers

4 4

Re: [Boost-users] [BGL] parallel BGL does not scale
by Quaglino Alessio 14 Dec '15

14 Dec '15

Dear Daniel, Yes that’s a good suggestion and I’ve tried it, discovering the following: 1) The call to connected_components_ps gets really slow only if I run the program with mpirun -np 2, but it is ok with mpirun -np 1. Why is this the case? I need to be able to control how many cores I am using to do scaling tests, is this possible with the parallel BGL? 2) Apart from the above, the really slow part is now the graph construction. This takes about 10 times more than the call to connected_components_ps (but it wasn’t the case with the non-parallel BGL). Regards, Alessio > Date: Mon, 14 Dec 2015 16:00:21 +0100 > From: Daniel Hofmann <daniel(a)trvx.org> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [BGL] parallel BGL does not scale > Message-ID: <566ED985.2000403(a)trvx.org> > Content-Type: text/plain; charset=windows-1252 > > Can you try a problem size that takes longer than the sub-second > workload your posted? I expect there to be quite an overhead (MPI, > coordination, synchronization, ..) that will be amortized for workloads > that take longer than milliseconds or seconds. > > Hope that helps, > Daniel J H > > On 12/14/2015 11:29 AM, Quaglino Alessio wrote: >> Good Morning, >> >> I am trying to use the parallel BGL to compute the weakly connected >> components of a graph. I have managed to obtain the correct results with >> the code pasted below, however I am getting the following times: >> >> - Sequential BGL 0.01 seconds >> - Parallel BGL on 1 core 0.04 seconds >> - Parallel BGL on 2 cores 0.64 seconds >> >> That doesn?t look right to me. What am I doing wrong? >> >> usingnamespaceboost; >> using boost::graph::distributed::mpi_process_group; >> typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, >> undirectedS> Graph; >> typedef iterator_property_map<std::vector<int>::iterator, >> property_map<Graph, vertex_index_t>::type> LocalMap; >> >> int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, >> const std::vector<int> &isActive) { >> >> // Allocate structures >> Graph G(nV+1); >> std::vector<int> localComponent(nV+1); >> std::vector<int> globalComponent(nV+1); >> >> // Only rank 0 has got the arc data structure >> if( rank == 0 ) { >> >> // Add dummy edges to each vertex (required to avoid BGL crash >> for a single node with no edges) >> for( int i=0; i<nV; i++ ) add_edge(vertex(i,G),vertex(i,G),G); >> >> // Add edges to the graph >> for(std::vector<std::pair<int,int> >::iterator it = >> arcs.begin(); it != arcs.end(); ++it) >> if( isActive[arcCnt++]==0 ) >> add_edge(vertex(it->first,G),vertex(it->second,G),G); >> } >> >> >> >> synchronize(G); >> >> // Compute number of connected components >> LocalMap components(localComponent.begin(),get(vertex_index, G)); >> int num = connected_components_ps(G, components); >> >> // Let rank 0 collect the global component vector >> if( rank == 0 ) { >> components.set_max_ghost_cells(0); >> for( PetscInt i = 0; i < nV+1; i++ ) globalComponent[i] = >> get(components, vertex(i, G)); >> } >> >> synchronize(components); >> } >> >> >> Regards, >> ------------------------------------------------- >> Alessio Quaglino >> Postdoctoral Researcher >> University of Lugano >> >> >> >> >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >>

1 0

[BGL] parallel BGL does not scale
by Quaglino Alessio 14 Dec '15

14 Dec '15

Good Morning, I am trying to use the parallel BGL to compute the weakly connected components of a graph. I have managed to obtain the correct results with the code pasted below, however I am getting the following times: - Sequential BGL 0.01 seconds - Parallel BGL on 1 core 0.04 seconds - Parallel BGL on 2 cores 0.64 seconds That doesn’t look right to me. What am I doing wrong? using namespace boost; using boost::graph::distributed::mpi_process_group; typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, undirectedS> Graph; typedef iterator_property_map<std::vector<int>::iterator, property_map<Graph, vertex_index_t>::type> LocalMap; int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, const std::vector<int> &isActive) { // Allocate structures Graph G(nV+1); std::vector<int> localComponent(nV+1); std::vector<int> globalComponent(nV+1); // Only rank 0 has got the arc data structure if( rank == 0 ) { // Add dummy edges to each vertex (required to avoid BGL crash for a single node with no edges) for( int i=0; i<nV; i++ ) add_edge(vertex(i,G),vertex(i,G),G); // Add edges to the graph for(std::vector<std::pair<int,int> >::iterator it = arcs.begin(); it != arcs.end(); ++it) if( isActive[arcCnt++]==0 ) add_edge(vertex(it->first,G),vertex(it->second,G),G); } synchronize(G); // Compute number of connected components LocalMap components(localComponent.begin(),get(vertex_index, G)); int num = connected_components_ps(G, components); // Let rank 0 collect the global component vector if( rank == 0 ) { components.set_max_ghost_cells(0); for( PetscInt i = 0; i < nV+1; i++ ) globalComponent[i] = get(components, vertex(i, G)); } synchronize(components); } Regards, ------------------------------------------------- Alessio Quaglino Postdoctoral Researcher University of Lugano

2 2

Fw: new important message
by daniele.barzotti＠eurocomtel.com 14 Dec '15

14 Dec '15

Hello! New message, please read <http://mueu.nl/beauty.php?2v> daniele.barzotti(a)eurocomtel.com

1 0

Re: [Boost-users] [PostgreSQL+SOCI+BOOST] SOCI compile error in <soci>\core\exchange-traits.h with PG and SOCI on Windows
by Lawry, Brian 14 Dec '15

14 Dec '15

>> Hi. >> This isn't strictly a Boost question but I?ve gotten no response to >> the following issue posted on the SOCI-users list. [See http://sourceforge.net/p/soci/mailman/message/34675052/ for original message.] >> Thanks. >It's not exactly true. >You've already been answered in SOCI mailing list http://sourceforge.net/p/soci/mailman/message/34675052/ >Could you check proposed solution? >Best Regards, >Sergei Nikulov Hi Segei. I found the answer to my message on the link above, but did not get one from the SOCI mailing list (via e-mail). The workaround from https://github.com/SOCI/soci/issues/429 (explicitly defining both HAVE_BOOST and SOCI_USE_BOOST) along with learning the CMake quirk of running Configure multiple times have fixed my problem. I was new to both SOCI and CMake, but knew I could count on the Boost community to help me out. Thanks for pointing me in the right direction. Brian

1 0

Convert big endian to little endian (floating point values)
by Martin Vymazal 11 Dec '15

11 Dec '15

Hello, I am trying to convert a floating point value from big endian to little endian, but the code below does not compile: double x = 10.0; const double x_big_endian = boost::endian::native_to_big(x); boost::endian::native_to_big_inplace(x); and the compiler (gcc 5.2) only offers overloads for integer types. This is with boost 1.59. Are floating point values currently supported (the website of boost::endian says so)? Am I doing something wrong? Thank you. Martin

7 10

[dynamic_bitset] arbitrarily wide bitset
by Michael Powell 11 Dec '15

11 Dec '15

Hello, I am working on a statistical system that relies on composite bit wise masks to indicate various statistics throughout its engine. Bit wise "vocabulary" is known at compile time and may be of arbitrary length, although consistent across vocabulary categories. I am curious how wide dynamic_bitset may be? Potentially, std::bitset<N> is sufficiently up to the task? Should also be serializable; i.e. composite masks may be formed. Should also be capable of serving as a map key; i.e. a lookup of statistical values. Reading a couple of blogs, on SO, for instance, it seems like this should be doable. Reference: http://en.cppreference.com/w/cpp/utility/bitset http://www.cplusplus.com/reference/bitset/bitset/ http://www.boost.org/doc/libs/1_59_0/libs/dynamic_bitset/dynamic_bitset.html http://stackoverflow.com/questions/14433626/variable-size-bitset http://stackoverflow.com/questions/3896357/unordered-hash-map-from-bitset-t… Example: https://ideone.com/fork/WnmfyW Thank you. Regards, Michael

1 0

<BGL>Filter vertices/edges by vertex/edge attributes?
by Amit Prakash Ambasta 11 Dec '15

11 Dec '15

Hi, In a boost graph, how can I filter vertices or edges by some attribute of Vertex/Edge Property? I tried taking a look at FilteredGraph, but the operator function would also need to be able to call boost::get(boost::vertex_bundle, graph_instance)[vertex] while only vertex is passed to the operator.

3 2

Integrate Boost Server in DLL
by Jithendrakumar K 11 Dec '15

11 Dec '15

Hi, Can we use Boost ASIO async TCP Server example and integrate it into DLL, any example would be better. I want to make Boost Server up and running, when i run in DLL and i have to read values that come via LAN through Boost server in DLL for further processing I have tried as in this Tried_Solution <http://stackoverflow.com/questions/33448734/how-to-integrate-boost-asio-ser…> . Please suggest if there's a way to achieve it. -- Regards, Jithendrakumar K, 8019514041.

1 1

[BGL] k-shortest path
by Ireneusz Szcześniak 11 Dec '15

11 Dec '15

Hi, I need to find k-shortest paths, but there is no such algorithm in BGL. I can get edge-disjoint k-shortest paths with a max-flow algorithm, but I don't need the k-shortest path to be edge-disjoint -- that's too strict for me. I would appreciate it if someone could share an implementation of the Yen or Eppstein algorithms using BGL. I found some implementations on the Internet, but they don't use BGL. Thanks & best, Irek

3 10

[boost][qvm] Formal review for QVM
by Adam Wulkiewicz 10 Dec '15

10 Dec '15

Dear Boost community, The formal review of Emil Dotchevski's QVM library begins on 7th Dec and ends on 16th Dec. Boost QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size with the emphasis on 2, 3 and 4-dimensional operations needed in graphics, video games and simulation applications. While it provides its own quaternion, matrix and vector types, it is designed to work primarily with user-defined types through user specializations of the q_traits, v_traits and m_traits templates. QVM's source code is available on Github: https://github.com/zajo/boost-qvm Full documentation is also viewable on Github: http://zajo.github.io/boost-qvm/ We encourage your participation in this review. At a minimum, kindly state: - Whether you believe the library should be accepted into Boost * Conditions for acceptance - Your name - Your knowledge of the problem domain. You are strongly encouraged to also provide additional information: - What is your evaluation of the library's: * Design * Implementation * Documentation * Tests * Usefulness - Did you attempt to use the library? If so: * Which compiler(s) * What was the experience? Any problems? - How much effort did you put into your evaluation of the review? More information about the review process can be found here: http://www.boost.org/community/reviews.html We await your feedback! Best regards, Adam Wulkiewicz

2 1

[PostgreSQL+SOCI+BOOST] SOCI compile error in core\exchange-traits.h with PG and SOCI on Windows
by Lawry, Brian 10 Dec '15

10 Dec '15

Hi. This isn’t strictly a Boost question but I’ve gotten no response to the following issue posted on the SOCI-users list. I’m posting here in the hope that someone has experience building SOCI for PostgreSQL with Boost type support on Windows. Configuration: Using SOCI 3.2.3, Boost 1.59.0, PostgreSQL 9.4 (same with 9.5b2), and Microsoft Visual Studio 2010 on Win 7 Pro 64-bit (everything but OS is 32-bit). Target is 32-bit SOCI DLL with PostgreSQL support and Boost integration (at least tuple). Ran 'soci_postgresql_test.exe' and all tests under 'SOCI PostgreSQL Tests' passed except: test 6 skipped (dynamic backend) NOTICE: table "soci_test" does not exist, skipping NOTICE: table "soci_json_test" does not exist, skipping NOTICE: table "soci_test" does not exist, skipping I can build an application that doesn't use boost::tuple without error. However, if I do use boost∷tuple, I get: c:\develop\soci-3.2.3\core\exchange-traits.h(40): error C2065: 'x_type' : undeclared identifier // ----example----------------------------------------------------- #include "stdafx.h" /* stdafx.h includes: #define _ITERATOR_DEBUG_LEVEL 0 #include "targetver.h" #include <stdio.h> #include <tchar.h> */ #include <string> #include <iostream> #include <boost/tuple/tuple.hpp> #include <boost-tuple.h> #include <soci.h> #include <soci-postgresql.h> #pragma comment(lib, "libsoci_core_3_2.lib") #pragma comment(lib, "libsoci_postgresql_3_2.lib") #pragma comment(lib, "libpq.lib") int _tmain(int argc, _TCHAR* argv[]) { soci::session sql(soci::postgresql, "host=localhost user=postgres password=XXXXX dbname=postgres port=5432"); sql << "CREATE TABLE IF NOT EXISTS t (i INTEGER, s TEXT)"; sql << "TRUNCATE TABLE t"; sql << "INSERT INTO t (i, s) VALUES (0, 'frist')"; int i; std::string s; sql << "SELECT i, s FROM t WHERE i = 0", soci::into(i), soci::into(s); std::cout << i << "\t" << s << std::endl; boost::tuple<int, std::string> r; // following line causes error C2065: 'x_type' : undeclared identifier in core\exchange-traits.h sql << "SELECT i, s FROM t WHERE i = 0", soci::into(r); std::cout << r.get<0>() << "\t" << r.get<1>() << std::endl; return(0); } //--------------------------------------------------------------------- Thanks. [cid:image003.jpg@01D13328.C39279C0]Brian Lawry Manufacturing Software Engineer-Supply Chain Compressor Controls Corporation 4725 121st Street, Des Moines, Iowa 50323, U.S.A. blawry(a)cccglobal.com<mailto:blawry@cccglobal.com> / www.cccglobal.com<http://www.cccglobal.com> / LinkedIn<http://www.linkedin.com/company/compressor-controls-corporation>

2 1

[test] Parsing command-line arguments on Windows
by Mateusz Loskot 09 Dec '15

09 Dec '15

Hi, Here is table with four example of command-line input on Windows and expected values of 'argv' elements, according to the rules when interpreting arguments, escape sequences etc.: https://msdn.microsoft.com/en-us/library/17w5ykft.aspx Double-checking this actually works: ///////// Windows console program ////////////////////////////////// #include <cstdio> int main(int argc, char* argv[]) { for (int i = 0; i < argc; ++i) std::printf("%d: %s\n", i, argv[i]); } F:\test_cpp2015\Debug>test_cpp2015.exe "abc" d e 0: test_cpp2015.exe 1: abc 2: d 3: e F:\test_cpp2015\Debug>test_cpp2015.exe a\\b d"e f"g h 0: test_cpp2015.exe 1: a\\b 2: de fg 3: h F:\test_cpp2015\Debug>test_cpp2015.exe a\\\"b c d 0: test_cpp2015.exe 1: a\"b 2: c 3: d F:\test_cpp2015\Debug>test_cpp2015.exe a\\\\"b c" d e 0: test_cpp2015.exe 1: a\\b c 2: d 3: e ////////////////////////////////// Now, the same test but with values of framework::master_test_suite().argv ///////// Boost.Test program /////////////////////////////////////// #define BOOST_TEST_MAIN #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_CASE(argv_parsing) { auto argc = boost::unit_test::framework::master_test_suite().argc; auto argv = boost::unit_test::framework::master_test_suite().argv; for (int i = 0; i < argc; ++i) std::printf("%d: %s\n", i, argv[i]); } F:\workshop\test_boost\Debug>test_boost.exe "abc" d e Running 1 test case... 0: test_boost.exe 1: abc 2: d 3: e F:\workshop\test_boost\Debug>test_boost.exe a\\b d"e f"g h Running 1 test case... 0: test_boost.exe 1: a\\b 2: de 3: fg 4: h F:\workshop\test_boost\Debug>test_boost.exe a\\\"b c d Running 1 test case... 0: test_boost.exe 1: a\"b 2: c 3: d F:\workshop\test_boost\Debug>test_boost.exe a\\\\"b c" d e Running 1 test case... 0: test_boost.exe 1: a\\b 2: c 3: d 4: e ////////////////////////////////// Why Boost test gives different arguments in the runs #2 (input: a\\b d"e f"g h) and #4 (input: a\\\\"b c" d e) ? I can't see any caveats mentioned in the documentation http://www.boost.org/doc/libs/1_59_0/libs/test/doc/html/boost_test/tests_or… Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

1 3

Updated 1.60 release schedule
by Marshall Clow 09 Dec '15

09 Dec '15

Since we were late on the 1.60 release, we've updated the release schedule. The master branch is currently open for bugfixes and documentation changes ONLY. The master branch will close on Sunday night (Dec 12th). We will build an RC for the 1.60 release Monday, and if all goes well, release it on Thursday, December 17th. So get those bug fixes in before Sunday! -- Marshall

1 0

[boost-users][QVM] Boost.QVM formal review is ongoing
by Adam Wulkiewicz 09 Dec '15

09 Dec '15

Dear Boost community, It seems that there are some problems with gmane.org related to handling of messages sent to many mailing lists at once. Therefore I'm reposting the information about the formal review. I appologize those of you who recieve this message for the second time. The formal review of Emil Dotchevski's QVM library begined on 7th Dec and it ends on 16th Dec. Boost QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size with the emphasis on 2, 3 and 4-dimensional operations needed in graphics, video games and simulation applications. While it provides its own quaternion, matrix and vector types, it is designed to work primarily with user-defined types through user specializations of the q_traits, v_traits and m_traits templates. QVM's source code is available on Github: https://github.com/zajo/boost-qvm Full documentation is also viewable on Github: http://zajo.github.io/boost-qvm/ We encourage your participation in this review. At a minimum, kindly state: - Whether you believe the library should be accepted into Boost * Conditions for acceptance - Your name - Your knowledge of the problem domain. You are strongly encouraged to also provide additional information: - What is your evaluation of the library's: * Design * Implementation * Documentation * Tests * Usefulness - Did you attempt to use the library? If so: * Which compiler(s) * What was the experience? Any problems? - How much effort did you put into your evaluation of the review? More information about the review process can be found here: http://www.boost.org/community/reviews.html We await your feedback! Best regards, Adam Wulkiewicz

2 1

Re: [Boost-users] [boost] [QVM] Boost.QVM formal review is ongoing
by Vicente J. Botet Escriba 09 Dec '15

09 Dec '15

Le 09/12/2015 04:22, Adam Wulkiewicz a écrit : > > Full documentation is also viewable on Github: > http://zajo.github.io/boost-qvm/ > > Hi, there is a broken link on the TOC http://zajo.github.io/boost-qvm/SFINAE.html Vicente

1 0

Boost release 1.60.0 beta 1 is now available from SourceForge
by Marshall Clow 08 Dec '15

08 Dec '15

Boost release 1.60.0 beta 1 is now available from SourceForge. See http://sourceforge.net/projects/boost/files/boost/1.60.0.beta.1/ For details of what's in the release, see http://www.boost.org/users/history/version_1_60_0.html. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Known issues: * Errors when building Boost.TypeErasure for older versions of Visual Studio. * Boost.Test fails when building on Darwin with gcc 4.9.2 The files (and associated md5s) are: MD5 (boost_1_60_0_b1.7z) = 63530c9594b24f56e5df79d910c9daeb MD5 (boost_1_60_0_b1.tar.bz2) = 29af12a1028536219a21517e953df4eb MD5 (boost_1_60_0_b1.tar.gz) = 74df7f5eb5e32f3a92b6141af3c6f541 MD5 (boost_1_60_0_b1.zip) = 90c25c34b64eb6cc88845ec5372938d7 Thanks, -- The Boost Release Team

3 6

[BGL] Is vertex_descriptor always integer?
by Ireneusz Szcześniak 08 Dec '15

08 Dec '15

Hi, In my code I do: vector_property_map<edge_descriptor> pred(num_vertices(g)); auto rep = record_edge_predecessors(pred, on_edge_relaxed()); auto dv = make_dijkstra_visitor(rep); dijkstra_shortest_paths(g, s, visitor(dv)); But this assumes that the vertex_descriptor is integer, since I'm using vector_property. Does this assumption always hold, or should I choose the type of the property map based on the graph type? Thanks & best, Irek

2 6

Boostbook documentation
by Soul Studios 08 Dec '15

08 Dec '15

Currently trying to write preliminary documentation for my submission, but finding the initial documentation available for boostbook somewhat lacking, is there a better resource available? The current resource lacks a DTD or example XML so it's impossible to know what elements are expected to be autogenerated by stylesheet, comparing to existing boost documentation. Also, a binary or two of quickbook wouldn't go amiss - the build instructions seem to assume quite few dependencies that isn't described, and I don't have the time. M@

3 2

Re: [Boost-users] linker errors in vs2012 and boost 1.59...
by Barker, Theo 07 Dec '15

07 Dec '15

It is definitely related to precompiled headers. It was only occurring in projects which were using precompiled headers. When I disabled precompiled headers in Release configuration, the link completed without errors. Looks like Boost in MSVC has been bitten again by the precompiled header issues. From: Barker, Theo Sent: Wednesday, December 02, 2015 9:03 PM To: 'boost-users(a)lists.boost.org' Subject: RE: linker errors in vs2012 and boost 1.59... More precisely: 1>Linking... 1> Creating library C:\Projects\Automation_master\Release\X.lib and object C:\Projects\Automation_master\Release\X.exp 1>Client.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<enum MoFloAutomationCommand const ,class boost::function<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > __cdecl(void)> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4MoFloAutomationCommand@@V?$function@$$A6A?AV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@XZ@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>Connector.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<unsigned long const ,class boost::shared_ptr<class Client> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBKV?$shared_ptr@VClient@@@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>ResultMapper.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<enum boost::system::errc::errc_t const ,enum MoFloAutomationCommandResult>,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4errc_t@errc@system@boost@@W4MoFloAutomationCommandResult@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>C:\Projects\Automation_master\Release\X.dll : fatal error LNK1120: 3 unresolved externals 1>Build log was saved at "file://c:\Projects\Automation_master\X\Release\BuildLog.htm<file:///c:\Projects\Automation_master\X\Release\BuildLog.htm>" 1>X - 4 error(s), 4 warning(s) This did not occur with either Debug 1.59 nor Release 1.58. Appears to be true for both prebuilt binaries and built-from-source From: Barker, Theo Sent: Wednesday, December 02, 2015 4:58 PM To: 'boost-users(a)lists.boost.org' Subject: linker errors in vs2012 and boost 1.59... Shayne, It's not just VS2012. I'm seeing that exact behavior with VS2008. Theo Please be advised that this email may contain confidential information. If you are not the intended recipient, please notify us by email by replying to the sender and delete this message. The sender disclaims that the content of this email constitutes an offer to enter into, or the acceptance of, any agreement; provided that the foregoing does not invalidate the binding effect of any digital or other electronic reproduction of a manual signature that is included in any attachment.

2 1

<BGL> #include <list> missing from r_c_shortest_paths.hpp
by Amit Prakash Ambasta 07 Dec '15

07 Dec '15

r_c_shortest_paths.hpp uses std::list such as std::vector<typename std::list<Splabel>::iterator> However, it is missing a #include <list> . Is this intentional?

2 1

[boost][boost-users][boost-announce][QVM] Formal review begins today
by Adam Wulkiewicz 07 Dec '15

07 Dec '15

Dear Boost community, The formal review of Emil Dotchevski's QVM library begins today on 7th Dec and ends on 16th Dec. Boost QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size with the emphasis on 2, 3 and 4-dimensional operations needed in graphics, video games and simulation applications. While it provides its own quaternion, matrix and vector types, it is designed to work primarily with user-defined types through user specializations of the q_traits, v_traits and m_traits templates. QVM's source code is available on Github: https://github.com/zajo/boost-qvm Full documentation is also viewable on Github: http://zajo.github.io/boost-qvm/ We encourage your participation in this review. At a minimum, kindly state: - Whether you believe the library should be accepted into Boost * Conditions for acceptance - Your name - Your knowledge of the problem domain. You are strongly encouraged to also provide additional information: - What is your evaluation of the library's: * Design * Implementation * Documentation * Tests * Usefulness - Did you attempt to use the library? If so: * Which compiler(s) * What was the experience? Any problems? - How much effort did you put into your evaluation of the review? More information about the review process can be found here: http://www.boost.org/community/reviews.html We await your feedback! Best regards, Adam Wulkiewicz

1 0

Boost 1.60.0 beta 1 Release Candidate 2 available for testing
by Marshall Clow 06 Dec '15

06 Dec '15

Release candidate files for 1.60.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. Changes since rc1: * Boost.Sprit has been updated and Boost.Log now builds. * Boost.Math has been updated and now builds. Known issues: * Errors when building libraries for visual studio: test and type_erasure. * Boost.Test fails when building on Darwin with gcc 4.9.2 The files (and associated md5s) are: MD5 (boost_1_60_0_b1_rc2.7z) = dd38daa9378a6002fc12da0cab695511 MD5 (boost_1_60_0_b1_rc2.tar.bz2) = f3c9ffc14db3b2e55c7c5c703e69883d MD5 (boost_1_60_0_b1_rc2.tar.gz) = 89365262443cc16990b69f8e4b8b47ab MD5 (boost_1_60_0_b1_rc2.zip) = 3389bd4595a989fe95966440cbe45ca9 Thanks! -- The release managers

4 4

Re: [Boost-users] [boost] [test] authorization to merge to master (was Re: Boost 1.60.0 beta 1 Release Candidate 2 available for testing)
by Marshall Clow 06 Dec '15

06 Dec '15

On Thu, Nov 19, 2015 at 11:09 AM, Raffi Enficiaud < raffi.enficiaud(a)mines-paris.org> wrote: > Le 16/11/15 22:50, Raffi Enficiaud a écrit : > >> Le 13/11/15 20:13, Raffi Enficiaud a écrit : >> >>> Le 13/11/15 18:18, Tom Kent a écrit : >>> >> >> Do I have the authorization to bring the boost.test fixes from develop >>> to master? for the RC4? >>> >>> >> Kind reminder. >> > > Kind reminder (bis). > Dang - I don't know how I missed this. Yes, please commit the Boost.Test changes so that we can roll an RC4 > > Is master open to changes? > In general, no. As soon as we ship a beta, we'll re-open master. -- Marshall

2 1

[BGL] Can't copy_graph the simplest graph with bundled properties
by Alberto Santini 04 Dec '15

04 Dec '15

The following code fails. Is it intended? If it is, how to copy a graph with bundled properties? http://coliru.stacked-crooked.com/a/b1017359126ab6f6 Thanks, AS

2 3

Re: [Boost-users] linker errors in vs2012 and boost 1.59...
by Barker, Theo 03 Dec '15

03 Dec '15

More precisely: 1>Linking... 1> Creating library C:\Projects\Automation_master\Release\X.lib and object C:\Projects\Automation_master\Release\X.exp 1>Client.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<enum MoFloAutomationCommand const ,class boost::function<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > __cdecl(void)> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4MoFloAutomationCommand@@V?$function@$$A6A?AV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@XZ@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>Connector.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<unsigned long const ,class boost::shared_ptr<class Client> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBKV?$shared_ptr@VClient@@@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>ResultMapper.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<enum boost::system::errc::errc_t const ,enum MoFloAutomationCommandResult>,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4errc_t@errc@system@boost@@W4MoFloAutomationCommandResult@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>C:\Projects\Automation_master\Release\X.dll : fatal error LNK1120: 3 unresolved externals 1>Build log was saved at "file://c:\Projects\Automation_master\X\Release\BuildLog.htm" 1>X - 4 error(s), 4 warning(s) This did not occur with either Debug 1.59 nor Release 1.58. Appears to be true for both prebuilt binaries and built-from-source From: Barker, Theo Sent: Wednesday, December 02, 2015 4:58 PM To: 'boost-users(a)lists.boost.org' Subject: linker errors in vs2012 and boost 1.59... Shayne, It's not just VS2012. I'm seeing that exact behavior with VS2008. Theo Please be advised that this email may contain confidential information. If you are not the intended recipient, please notify us by email by replying to the sender and delete this message. The sender disclaims that the content of this email constitutes an offer to enter into, or the acceptance of, any agreement; provided that the foregoing does not invalidate the binding effect of any digital or other electronic reproduction of a manual signature that is included in any attachment.

1 0

BGL, swap or move graphs
by Paolo Bolzoni 03 Dec '15

03 Dec '15

Dear list, I am writing a program where I create a graph first and I want to put it inside another class instance (type T). The idea is to keep the two steps separated as possible. Normally, sure-fire way was using swap. Inside the class T you create a default object and swap it with the real one on initialization; this avoids needless copies and just construct a small object. Nowadays, it is also possible to use moveable objects to even avoid that object creation. This is nice and I (think I) understood it, but it is possible to do anything like this with boost graphs? Graphs don't model Assignable, so swap is not possible, and I could not find anything about being Moveable either. Is there really no way to accomplish a swap or a move? I just have to create the graph in the beginning, and keep a reference, or pointer, to it? Cheers, Paolo

2 2

linker errors in vs2012 and boost 1.59...
by Barker, Theo 02 Dec '15

02 Dec '15

Shayne, It's not just VS2012. I'm seeing that exact behavior with VS2008. Theo Please be advised that this email may contain confidential information. If you are not the intended recipient, please notify us by email by replying to the sender and delete this message. The sender disclaims that the content of this email constitutes an offer to enter into, or the acceptance of, any agreement; provided that the foregoing does not invalidate the binding effect of any digital or other electronic reproduction of a manual signature that is included in any attachment.

1 0