December 2015 - Boost-users - lists.stage.boost.cppalliance.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 3

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

2 2

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

25 Apr '17

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

3 2

[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

3 3

[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 &)".

2 1

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.

4 4

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 1

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 1

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 2