October 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

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

[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

Levelization of DAG in Boost graph -- trying again
by bhattach 20 Nov '15

20 Nov '15

Not sure why my previous attempt to post a new topic didn't succeed -- page kept showing a note that the post was not accepted by the mailing list. Trying one more time. ------------------------ Although I've been using graphs for 30+ years, I'm new to Boost Graph Library. I'd like to do "classical levelization" of a DAG -- as is commonly used in applications like digital logic simulation, etc -- whereby level(v) = max_level(set of predecessors of v) + 1 I used record_distances() with breadth_first_search() and suitably defined property map, but I suspect that's returning level(v) = min_level(set of predecessors of v) + 1 Is there a simple way to use breadth_first_search() to get the level numbers I want, or do I need to write my own levelization routine? Thanks in advance for comments/suggestions/pointers. Debashis Bhattacharya -- View this message in context: http://boost.2283326.n4.nabble.com/Levelization-of-DAG-in-Boost-graph-tryin… Sent from the Boost - Users mailing list archive at Nabble.com.

2 4

[BGL] Connected components of a distributed graph with few edges
by Quaglino Alessio 06 Nov '15

06 Nov '15

Hello, I am trying to compute the number of connected components of a graph with only few edges (i.e. many vertices do not have edges). This works OK for a non-distributed graph. The simplest example of the issue I could come up with is the following: typedef adjacency_list <vecS, vecS, undirectedS> SerialGraph; 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; #ifdef PARALLEL_GRAPH Graph G(nV+1); synchronize(G); std::vector<int> localComponent(nV+1); LocalMap components(localComponent.begin(),get(vertex_index, G)); num = connected_components_ps(G, components); #else SerialGraph G(nV+1); std::vector<int> globalComponent(nV+1); num = connected_components(G, &globalComponent[0]); #endif The distributed version causes a seg fault when calling connected_components_ps, while the non-distributed works fine and correctly finds nV+1 components. If I populate the graph connecting all vertices with edges, both do work fine. What am I doing wrong? Thank you in advance. Regards, Alessio

2 8

Re: [Boost-users] Crashing Issue
by swati upadhyaya 04 Nov '15

04 Nov '15

hi I am using like this where RunningThreads_ is vector containing boost thread object pointer(handler).I am using interrupt() for the interruption of thread interruption_point() catching that interruption then joining.everytime its crashing in join() for me but for others who have the same configuration its working fine all of us has windos 8. For me also it was working last week but this week the same piece of code is crashing. :( RunningThreads_[i].handle->interrupt(); RunningThreads_[i].handle->join(); delete RunningThreads_[i].handle; On Thu, Feb 5, 2015 at 9:31 AM, swati upadhyaya <swatiupadhyaya(a)gmail.com> wrote: > RunningThreads_[i].handle->interrupt(); > LOG4CPLUS_INFO(root, "Thread Interrupted for " << > RunningThreads_[i].app_name << " successful"); > RunningThreads_[i].handle->join(); > LOG4CPLUS_INFO(root, "Waiting for thread to exit " << > RunningThreads_[i].app_name << " successful"); > delete RunningThreads_[i].handle; > LOG4CPLUS_INFO(root, "Thread handle for " << > RunningThreads_[i].app_name << " successfully deleted"); > //RunningThreads_.erase(i); > > On Wed, Feb 4, 2015 at 12:10 AM, Vicente J. Botet Escriba < > vicente.botet(a)wanadoo.fr> wrote: > >> Le 03/02/15 09:10, swati upadhyaya a écrit : >> >> In my code join() timed_joined() is crashing, I am using these API >> after interrupt(),Same piece of code is working for others but in my system >> its crashing, >> Is there some dependency problem I am using >> Boost version: 1.55.0 >> OS: Windows 8 >> IDE: Visual Studio 2010 >> >> Hi, >> >> it could help if you post the example and the backtrace. >> >> Which version/OS/compiler use others for which this works? >> >> Vicente >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >> > >

3 2

Confused about the Boost.Build documentation
by Oodini 01 Nov '15

01 Nov '15

Hello, I wanted to read the doc of Boost.Build, but I find two documentations : 1. One from the link I can find on this page : http://www.boost.org/doc/ (at the booton, or at the bottom right corner, in th menu) 2. One I found throught from Google : http://www.boost.org/doc/libs/1_59_0/doc/html/bbv2.html I am not able to find it by navigating on the Boost site. Which page is the godd one ? Thanks.

2 4

[asio] Using io_service::poll() without pthread locking and unlocking
by ☂Josh Chia (谢任中) 31 Oct '15

31 Oct '15

I'm using boost::asio to do some TCP socket communication from a single-threaded program. The program performs asynchronous reads and writes and keeps calling io_service::poll() from a busy loop. I noticed from callgrind profiling that a significant portion of time is spent on pthread locking and unlocking from io_service::poll(). If I can get rid of the lock operations, the performance will improve significantly. Is there a way to get io_service to not use locks other than hacking the source code? It's a single-threaded application so the locking is unnecessary. The main reason I'm using asio is for the abstraction that allows me to write clean, simple, code, and hope I don't have to give up performance for simplicity. Josh

2 2

[icl] 'map::_add' ignores default-constructed value
by Filip Konvička 29 Oct '15

29 Oct '15

Hi, First of all thanks very much for the ICL! I'm using a boost::icl::interval_map with my own value type (struct V) and I have a custom value combining logic by passing boost::icl::inplace_et to the map and defining my own "operator&=" that provides the logic implementation. Now what happens is that my map ignores "m += make_pair(..., V())" because the default-constructed value is considered neutral due to: boost/icl/interval_base_map.hpp: ... interval_base_map<...>::_add(const segment_type& addend) { typedef typename on_absorbtion<type,Combiner, absorbs_identities<type>::value>::type on_absorbtion_; ... const codomain_type& co_val = addend.second; if(on_absorbtion_::is_absorbable(co_val)) return this->_map.end(); This 'if' returns without actually modifying the map. Is there some public API that I can use to tell my map that it should not consider any value 'absorbable'? And is it a good idea to change this? Thank you, Filip

1 0

[MSM] Solution for: fatal error C1202: recursive type or function dependency context too complex RE-POST
by Mark Bartosik 29 Oct '15

29 Oct '15

Sorry this is a re-post because my email client had formatting enabled. I have had a major headache while using MSM eUML state transition tables, thankfully I've found a simple solution. First MSM and especially eUML are great, and that's why I persevered to find a solution. Here's the problem: Declaring a complex eUML state transition table may result in the compiler generating an error. BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE(( // row_1, // row_2, // ... // row_a, // row_b, // row_c, // // Eventually the Microsoft compiler VS2008,2010,2012,2015 will all explode with fatal C1202: recursive type or function dependency context too complex ), transition_table ); I haven't tried with gcc. The solution is to break the state table in two smaller parts rather than one big table: BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE(( // row_1, // row_2, // ... ), transition_table_part_1 ); BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE(( // row_a, // row_b, // row_c ), transition_table_part_2 ); typedef boost::mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table; // No error, even though it contains just as many rows [Waffle warning] I think that what's happening is that once the compiler has fully described the transition_table_part1 it unwinds what it is doing, it is able to unwind and 'bank' transition_table_part1 as just being a type in it's memory, and when it comes to generate transition_table via boost::mpl::join_view it just constructing the resulting type list from two sets of previously 'banked' types. This is I think why I can still nest a sub-state machine which is on the limit of the complexity of state transition table it can contain; even though nesting state machines recursively references state transition tables. Things that did not work: [ more waffle ] There are some other solutions that I tried before I had the Eureka moment. One was to try to hide a sub-state machine within a concrete class but that didn't work because the outer fsm needs to see the inner stt. Another way was to implement a sub-state machine as a concrete state (not fsm), and then add a process_event method on the class which delegated to a member fsm which was hidden from the outer fsm, I got this to work, but it did not solve the problem, and I had to abandon use of exit_pt_, although it may have brought down compile times. Another helpful advantage of this solution is that the memory required by the compiler is significantly reduced. Christophe: Would you consider adding the example above to the MSM documentation, I would suggest under: Chapter 4, Compilers / Performance, Compilers Corner Also under: Chapter 5, Questions Answers and Tips: Question: Why do I get "fatal C1202: recursive type or function dependency context too complex" Answer: Likely because a state transition table has become two complex. Split the state transition table into two parts, and then use typedef mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table to join the two parts. Question: Why does my compiler generate a fatal out of memory fatal error. Answer: Likely because a state transition table has become two complex. Try and split the most complex state transition table into two parts, and then use typedef mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table to join the two parts. - Mark Bartosik

2 1

[Boost.Proto] implementing function call operators in expression trees
by Brook Milligan 29 Oct '15

29 Oct '15

I am trying to implement function call operators with Boost.Proto but cannot seem to figure out either how to set the expression trees up or how to evaluate them properly. The code below is simplified from the “checked calculator” example in the Proto documentation to focus on implementing a single identity function resulting from the Proto expression ‘identity(_1)’. The program prints the following function( terminal(9identity_) , terminal(0) ) result=0 [ expect 3 ] so I think the expression tree is correct. (I am, however, uncertain why the placeholder is reported as ‘terminal(0)’.) When the expression tree is evaluated with IdentityGrammar transform, the result is 0 not 3 as I would have expected if the placeholder value was used. The Proto documentation seems very thorough (at least after study), but is thin on the use of functions like this and is not helping me figure out the solution. I welcome any help that will point out the flaw(s) in this code for either setting up the expression tree or getting it evaluated correctly by calling the identity function with the correct argument. Thanks for your help. Cheers, Brook #include <boost/proto/proto.hpp> #include <boost/mpl/int.hpp> #include <boost/fusion/container/vector.hpp> #include <boost/fusion/container/generation/make_vector.hpp> namespace mpl = boost::mpl; namespace proto = boost::proto; namespace fusion = boost::fusion; template<typename I> struct placeholder : I {}; struct identity : proto::callable { typedef int result_type; int operator()(int a) const { return a; } }; struct identity_ {}; struct IdentityGrammar : proto::or_< proto::when< proto::terminal<placeholder<proto::_>> , proto::functional::at(proto::_state, proto::_value) > , proto::when<proto::terminal<identity_>, proto::_void> , proto::when< proto::function<IdentityGrammar, proto::terminal<proto::_>> , proto::and_< IdentityGrammar(proto::_child1) , identity(proto::_value(proto::_child1)) > > > {}; template<typename Expr> struct identity_expr; struct identity_domain : proto::domain<proto::pod_generator<identity_expr>, IdentityGrammar> {}; template<typename Expr> struct identity_expr { BOOST_PROTO_EXTENDS(Expr, identity_expr<Expr>, identity_domain) }; identity_expr<proto::terminal<identity_>::type> const identity = {{}}; identity_expr<proto::terminal<placeholder<mpl::int_<0> > >::type> _1; int main() { auto expr = identity(_1); proto::display_expr(expr); int result = IdentityGrammar()(expr,fusion::make_vector(3)); std::cout << "result=" << result << " [ expect 3 ]" << std::endl; return 0; }

1 0

Program Options: Omit positional arguments from help
by Florian Lindner 28 Oct '15

28 Oct '15

Hello, I have this piece of code: void getOptions(int argc, char *argv[]) { namespace po = boost::program_options; po::options_description desc("Artificial testing tool."); desc.add_options() ("help", "produce help") ("participant", po::value<std::string>(), "Participant Name"); po::positional_options_description pd; pd.add("participant", 1); po::variables_map vm; //po::store(po::parse_command_line(argc, argv, desc), vm); po::store(po::command_line_parser(argc, argv).options(desc).positional(pd).run(), vm); po::notify(vm); if (vm.count("help")) { std::cout << desc << std::endl; return; } } First question: Is the usage of po::store correct that way? I've found it somehwere on the internet but the documentation mentions no alternative parser call when using positional arguments. Main question: When using help it still displays --participant, albeit it's only a placeholder for the positional argument. Is there a way to hide a options or what is the correct way? Thanks, Florian

1 0

Missing something about Boost.Graph
by Dominique Devienne 28 Oct '15

28 Oct '15

We have a graph of relational tables, with the foreign keys being the edges of the graph. We're using boost::topological_sort() to sort the graph, and have struggled in the past with Boost.Graph. Recently we had cycles appearing in our graph, so I'm revisiting this code, and I think I must be missing something fundamental about Boost.Graph, because I get what I consider incoherent results. Here are the relevant code snippets. typedef std::pair<std::size_t, std::size_t> IndexPair; std::vector<IndexPair> edges; // fill edges with pairs of integers, in range [0, 111] (at the moment) using namespace boost; typedef property<vertex_color_t, default_color_type> GraphProperty; typedef adjacency_list<vecS, vecS, directedS, GraphProperty> Graph; typedef boost::graph_traits<Graph>::vertex_descriptor Vertex; Graph G(edges.begin(), edges.end(), edges.size()); size_t max_vrtx_index = 0; for (const auto& e : boost::make_iterator_range(boost::edges(G))) { size_t s = boost::source(e, G); size_t t = boost::target(e, G); max_vrtx_index = std::max(max_vrtx_index, s); max_vrtx_index = std::max(max_vrtx_index, t); } const auto G_vrtx_count = num_vertices(G); const auto G_edge_count = num_edges(G); if (G_vrtx_count != (max_vrtx_index + 1)) { std::cout << "Graph has " << G_vrtx_count << " vertices " "and " << G_edge_count << " edges, yet in reality " "our edges refer to at most " << max_vrtx_index << " vertices!" << std::endl; } This outputs: Graph has 1137 vertices and 1137 edges, yet in reality our edges refer to at most 111 vertices! How can num_vertices() and num_edges() return the same number? Why isn't num_vertices() returning 112 as I'd expect? I'm using 1.58. Thanks, --DD

2 2

[DLL] unclear how to specify calling convention for dll::import
by Konstantin Ivlev 27 Oct '15

27 Oct '15

Hello, I've just started using Boost.DLL in order to simplify loading of various WinApi functions exclusive to specific Windows versions, however, I've faced the issue (or may be it's just misunderstanding from my side). it's pretty well-known there are multiple calling conventions around - cdecl, stdcall, fastcall, etc. most of WinApi functions are in stdcall calling convention, while default one for MSVC 2015 is cdecl (unless compiler options are changed). I've read documentation on http://apolukhin.github.io/Boost.DLL/, as well as I've scanned source code a bit, but didn't find any avidence on how to specify calling convention of function I am importing. example from tutorial9 works just fine, as it uses timeGetTime function which has no arguments. however, if I modify example (see my code below copy-pasted from tutorial9) to import function with at least one argument or more (e.g. GetStdHandle) I receive the following debugger error: Run-Time Check Failure #0 - The value of ESP was not properly saved across a function call. This is usually a result of calling a function declared with one calling convention with a function pointer declared with a different calling convention. this indicates that Boost.DLL incorrectly interpreted stdcall function as cdeacl function that caused stack corruption. I've googled a bit about calling convention and boost, and found the following two definitions: #define BOOST_BIND_ENABLE_STDCALL #define BOOST_MEM_FN_ENABLE_STDCALL unfortunately adding them has no effect. if I add explicit __stdcall into the function typedef, then program no longer compiles #include <boost/dll/import.hpp> // for import #include <iostream> #include <windows.h> namespace dll = boost::dll; int main() { typedef HANDLE(GetStdHandle_fn)(DWORD nStdHandle); // function signature boost::function<GetStdHandle_fn> plugin = dll::import<GetStdHandle_fn>( // we import using C name, not alias! Using `import<>` "Kernel32.dll", // Windows dll "GetStdHandle" // function name ); std::cout << "timeGetTime() returned " << plugin(STD_OUTPUT_HANDLE) << std::endl; return 0; }

1 0

[signals2] connected signal not being called
by Glenn Ramsey 27 Oct '15

27 Oct '15

Hi, In a program I have a function connected to to a signal that is being called periodically. At a certain point the function inexplicably stops being called. Other functions that are connected to the same signal and same group are still being called at this time. As far as I am aware disconnect() has not been called and connection.connected() returns true and connection.blocked() returns false for this function. This seems very strange to me and I'm wondering if there is something that I have overlooked. It's not the sort of thing that could be reproduced with a simple example. What would be a good way to debug this? Glenn

2 2

Interest in a Boost.Chrono/Date library
by Vicente J. Botet Escriba 26 Oct '15

26 Oct '15

Hi, maybe some of you have already see the Howard Hinnant presentation at CppCOn2015 [1] about his new data-v2 library [2]. My prototype of Boost.Chrono/Date library ([3] ] was based on the Howard original library, but when we want to reach the maximum of performances we need to use a specific date class for each usage. This is what Howard explains in his marvelous presentation ans his tiny date library My post here wants to know if there is interest in a library providing what H.H. date library provides in Boost. Note that his data-v2 library yet doesn't provides as much as Boost.Date provides but IMHO it is much elegant and efficient. If there is enough interest, I will request you to do a first review of the H.H. Date-V2 library. Then once we have a consensus I will make my POC Chrono/Date library ready for review. H.H. Date-V2 is under MIT license, which IIRC is compatible with the Boost license. I don't know yet if would need to add this license, as my POC [3] is already a good starting point, nevertheless, I would like to know if there could be any issues about having the source under both licenses. Best, Vicente [1] https://www.youtube.com/watch?v=tzyGjOm8AKo [2] https://github.com/HowardHinnant/date [3] https://github.com/viboes/chrono_date/commits/master First commit Nov/2011 Last-Mars2014

2 2

[Log] linker errors after update from 1.57 to 1.59
by Glenn Ramsey 25 Oct '15

25 Oct '15

Hi, After updating a project to use Boost 1.59 from 1.57 I am getting link errors like this: Undefined symbols for architecture i386: "boost::log::v2_mt_posix::basic_formatter<char> boost::log::v2_mt_posix::parse_formatter<char>(char const*, char const*)", referenced from: boost::log::v2_mt_posix::basic_formatter<char> boost::log::v2_mt_posix::parse_formatter<char>(char const*) BOOST_LOG_DYN_LINK has been defined and the build works with 1.57. This is on OSX 10.10.5 with Xcode 6.4 and with command line builds using clang (Apple LLVM version 6.1.0 (clang-602.0.53) (based on LLVM 3.6.0svn)). Boost was built using this command line: ./b2 --prefix=$HOME/rp/boost-1_59_0 cxxflags="-stdlib=libc++ -arch i386 -mmacosx-version-min=10.7" linkflags="-stdlib=libc++ -arch i386 -mmacosx-version-min=10.7" --with-python --with-signals --with-thread --with-date_time --with-filesystem --with-regex --with-chrono --with-log link=shared architecture=x86 install What do I need to do fix this? Glenn

1 0

[BGL] adding an edge without modifying a graph?!
by Ireneusz Szcześniak 24 Oct '15

24 Oct '15

Hi, The subject sounds crazy, I know. But I need to add reverse edges so I can run a max-flow algorithm on my graph, and I would not like to modify the input graph. I can make a copy of the graph, modify it all right, run a max-flow algorithm, and discard the modified graph, but that would be inefficient. So I wonder whether someone could share some trick on how to do that, if this is possible. I was hoping to use boost::subgraph: create a root graph, create its subgraph, and then add reverse edges only to the root graph. Unfortunately, these edges also popped up in the subgraph. Thanks & best, Irek

2 3

[BGL] augmenting for a max-flow algorithm
by Ireneusz Szcześniak 24 Oct '15

24 Oct '15

Hi, I would appreciate it if someone could define the term "augmenting" used in the documentation of the max-flow algorithms: "First, the directed graph G=(V,E) that represents the network must be augmented to include the reverse edge for every edge in E." Does it simply mean that I need to add to the graph a reverse edge? In the documentation of the boykov_kolmogorov_max_flow algorithm it's stated point-blank: "The directed graph G=(V,E) that represents the network must include a reverse edge for every edge in E". Cool, so I know that I need to add the edge with the add_edge function. To use a max-flow algorithm I need to modify my input graph. So I guess "augmenting" means just "including/adding", right? Thanks & best, Irek

1 0

BGL, swapping two graphs can invalidate vertex descriptors?
by Paolo Bolzoni 24 Oct '15

24 Oct '15

Dear list, I had to fix a bug in a program of mine using the boost graph library. In the program I need to add and remove vertices quickly, so I used listS both for edges and vertices. Besides, I need to refer to vertices with special ids (that are integers), so I added to each vertex a integer and to the graph itself a map between the ids and the vertices. The interface ensures that when vertices are added and this data structures are updated properly. For reference I put the whole (minified) graph definition after the email. Now, I had a crash when using boost::out_edges in some part of the programs and not in others. After some debugging it really seems that it happens that the vertex descriptors, that are addresses to the vertices, change after a swap. Unfortunately I could not manage to make this behaviour in a small example so I am still unsure and I decided to ask here. It is possible that swapping two graphs (with listS as OutEdgeList and VertexList) invalidates the vertex descriptors? Yours faithfully, Paolo #include <boost/graph/adjacency_list.hpp> namespace graph_prop { struct vertex { int id{}; }; struct edge { int lenght{}; }; struct graph; } typedef boost::adjacency_list< boost::listS, boost::listS, boost::undirectedS, graph_prop::vertex, graph_prop::edge, graph_prop::graph > Graph; namespace graph_prop { struct graph { std::unordered_map<int, Graph::vertex_descriptor> ids{}; }; }

1 0

problems with linking...
by Witold E Wolski 24 Oct '15

24 Oct '15

In a project which vcproj files generated with cmake I am getting the following link error fatal error LNK1104: cannot open file 'libboost_date_time-vc120-mt-gd-1_59.lib' The generate link command (VS- project -> properties -> Linker -> command line) contains however: "C:\boost\boost_1_59_0\lib\boost_date_time-vc120-mt-gd-1_59.lib" both files are present in my boost binary build. Any idea why this mixup is taking place libboost_date_time vs. boost_date_time and how I can fix the problem? Best regards Witold -- Witold Eryk Wolski

2 2

[MSM] Solution for: fatal error C1202: recursive type or function dependency context too complex
by Mark Bartosik 21 Oct '15

21 Oct '15

I have had a major headache while using MSM eUML state transition tables, thankfully I've found a simple solution.First MSM and especially eUML are great, and that's why I persevered to find a solution. Here's the problem: Declaring a complex eUML state transition table may result in the compiler generating an error. BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE((// row_1,// row_2,// ...// row_a,// row_b,// row_c,// // Eventually the Microsoft compiler VS2008,2010,2012,2015 will all explode with fatal C1202: recursive type or function dependency context too complex), transition_table ); I haven't tried with gcc. The solution is to break the state table in two smaller parts rather than one big table: BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE((// row_1,// row_2,// ...), transition_table_part_1 ); BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE((// row_a,// row_b,// row_c ), transition_table_part_2 ); typedef boost::mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table; // No error, even though it contains just as many rows [Waffle warning] I think that what's happening is that once the compiler has fully described the transition_table_part1 it unwinds what it is doing, it is able to unwind and 'bank' transition_table_part1 as just being a type in it's memory, and when it comes to generate transition_table via boost::mpl::join_view it just constructing the resulting type list from two sets of previously 'banked' types. This is I think why I can still nest a sub-state machine which is on the limit of the complexity of state transition table it can contain; even though nesting state machines recursively references state transition tables. Things that did not work: [ more waffle ] There are some other solutions that I tried before I had the Eureka moment. One was to try to hide a sub-state machine within a concrete class but that didn't work because the outer fsm needs to see the inner stt. Another way was to implement a sub-state machine as a concrete state (not fsm), and then add a process_event method on the class which delegated to a member fsm which was hidden from the outer fsm, I got this to work, but it did not solve the problem, and I had to abandon use of exit_pt_, although it may have brought down compile times. Another helpful advantage of this solution is that the memory required by the compiler is significantly reduced. Christophe:Would you consider adding the example above to the MSM documentation, I would suggest under: Chapter 4, Compilers / Performance, Compilers Corner Also under: Chapter 5, Questions Answers and Tips: Question: Why do I get "fatal C1202: recursive type or function dependency context too complex" Answer: Likely because a state transition table has become two complex. Split the state transition table into two parts, and then use typedef mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table to join the two parts. Question: Why does my compiler generate a fatal out of memory fatal error. Answer: Likely because a state transition table has become two complex. Try and split the most complex state transition table into two parts, and then use typedef mpl::joint_view< transition_table_part_1, transition_table_part_2 > transition_table to join the two parts. - Mark Bartosik

1 0

Newbie
by Gagan Kumar 21 Oct '15

21 Oct '15

I am interested in Open Source and want to contribute in BOOST, can you guide me from where should I start.

2 1

what is the problem with my async_read_some function?
by 李楠 20 Oct '15

20 Oct '15

hi all! i have a problem with the async_read_some function. i code a client to connect a server, after login the server will send a lot of FAST(FIX Adapted for Streaming) Data constantly. i just use ip::tcp::socket.async_read_some function to read the data from server, but the interface of the server software sometime show that there are some data package wait for send(maybe my client not receive then immidiately).but, when i use a commercial client to connect and receive data from the server, there is no data package wait for send on the server. my code: BODY_LEN = 1024 * 1024 * 4//4M boost::array<char, BODY_LEN> body_; void client::login_handler(const boost::system::error_code& ec, std::size_t bytes_transferred) { if (ec) { error_.code = ec.value(); strncpy(error_.msg, ec.message().c_str(), ERROR_MSG_LEN - 1); error_.msg[ERROR_MSG_LEN - 1] = '/0'; glog.error("login_handler get an error: %s", error_.msg); return; } socket_.async_read_some(boost::asio::buffer(body_), boost::bind(&client::login_handler, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); static bool first = true; if (first) { heartbeat_inteval_ = 10; first = false; send_heartbeat(); } } there is a deadline_timer to send heartbeat to server every 10 seconds , user the same socket_ . i user asio handler tracking to debug, and found that sometimes between the async_read_some function call and their callback function call are more than 100ms, i don't kown why becasue the server send data always, and other commercial client is ok? @asio|1445319300.343750|25*26|socket@00840104.async_receive @asio|1445319300.343750|<25| @asio|1445319300.390625|>26|ec=system:0,bytes_transferred=24605 @asio|1445319300.390625|26*27|socket@00840104.async_receive @asio|1445319300.390625|<26| @asio|1445319300.578125|>27|ec=system:0,bytes_transferred=15805 @asio|1445319300.593750|27*28|socket@00840104.async_receive @asio|1445319300.593750|<27| @asio|1445319300.781250|>28|ec=system:0,bytes_transferred=3939 @asio|1445319300.781250|28*29|socket@00840104.async_receive @asio|1445319300.781250|<28| @asio|1445319300.781250|>29|ec=system:0,bytes_transferred=8858 @asio|1445319300.796875|29*30|socket@00840104.async_receive @asio|1445319300.796875|<29| @asio|1445319300.796875|>30|ec=system:0,bytes_transferred=23906 @asio|1445319300.796875|30*31|socket@00840104.async_receive @asio|1445319300.796875|<30| @asio|1445319300.796875|>31|ec=system:0,bytes_transferred=25124 @asio|1445319300.796875|31*32|socket@00840104.async_receive @asio|1445319300.796875|<31| @asio|1445319300.921875|>32|ec=system:0,bytes_transferred=18061 @asio|1445319300.937500|32*33|socket@00840104.async_receive @asio|1445319300.937500|<32| @asio|1445319301.125000|>33|ec=system:0,bytes_transferred=19960 @asio|1445319301.125000|33*34|socket@00840104.async_receive @asio|1445319301.140625|<33| @asio|1445319301.140625|>34|ec=system:0,bytes_transferred=11680 could someone give some suggest? thanks a lot!

2 1

Boost compilation error under OS X 10.8.5
by Sebastian Sulger 20 Oct '15

20 Oct '15

Dear Boost Users list, I have an issue trying to compile a project under Mac OS X 10.8.5 using Boost libraries, version 1.34.1. I am using Xcode 4.6.3 and accompanying Command Line Tools. This must be an OS X specific issue, since the project compiles under CentOS Linux. I am asking this on the list in hopes that someone has used Boost in OS X development and has maybe come across a similar issue. I attach an excerpt of the compiler messages below. I have tried googling for the error, but can't seem to find satisfying answers. Please let me know if you can think of something from the top of your head or, which is more likely, if you need more info (e.g., source code excerpts) to be able to help me. Thank you very much, Best, Sebastian ######## g++ -DPARC -DCPPPA_EXPORT= -fPIC -fno-common -D__STDC_LIMIT_MACROS -g -fno-inline -Wpointer-arith -Wwrite-strings -Wno-deprecated -Wreturn-type -W -I/usr/local/include -O2 -I../../src/include -I../../LexBase/src -I/include -I/usr/local/include/boost-1_34_1 -I/Users/sebastiansulger/projects/xle/dev/xfr/src/../../bgdb -Idb_client -I./ -I../include -Ifacts -Irules -Ichoices -Iterms -Imatches -Idriver -Iparser -Itriples -Iprolog -Idebug -Inew_parser -o terms/TermStorage.o -c terms/TermStorage.cpp In file included from terms/TermStorage.cpp:9: In file included from terms/TermStorage.h:28: In file included from ./Types.h:26: In file included from /usr/local/include/boost-1_34_1/boost/functional/hash.hpp:10: /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:487:20: error: call to 'hash_value' is ambiguous return hash_value(val); ^~~~~~~~~~ /usr/include/c++/4.2.1/ext/hashtable.h:595:16: note: in instantiation of member function 'boost::hash<long long>::operator()' requested here { return _M_hash(__key) % __n; } ^ /usr/include/c++/4.2.1/ext/hashtable.h:587:16: note: in instantiation of member function '__gnu_cxx::hashtable<std::pair<const long long, unsigned int>, long long, boost::hash<long long>, std::_Select1st<std::pair<const long long, unsigned int> >, std::equal_to<long long>, std::allocator<unsigned int> >::_M_bkt_num_key' requested here { return _M_bkt_num_key(__key, _M_buckets.size()); } ^ /usr/include/c++/4.2.1/ext/hashtable.h:522:18: note: in instantiation of member function '__gnu_cxx::hashtable<std::pair<const long long, unsigned int>, long long, boost::hash<long long>, std::_Select1st<std::pair<const long long, unsigned int> >, std::equal_to<long long>, std::allocator<unsigned int> >::_M_bkt_num_key' requested here size_type __n = _M_bkt_num_key(__key); ^ /usr/include/c++/4.2.1/ext/hash_map:219:22: note: in instantiation of member function '__gnu_cxx::hashtable<std::pair<const long long, unsigned int>, long long, boost::hash<long long>, std::_Select1st<std::pair<const long long, unsigned int> >, std::equal_to<long long>, std::allocator<unsigned int> >::find' requested here { return _M_ht.find(__key); } ^ terms/TermStorage.h:97:46: note: in instantiation of member function '__gnu_cxx::hash_map<long long, unsigned int, boost::hash<long long>, std::equal_to<long long>, std::allocator<unsigned int> >::find' requested here TsHashMapIter iter = mParent->mHashMap.find(t); ^ terms/TermStorage.cpp:85:47: note: in instantiation of member function 'powerset::xfr::TermHashStorage<long long>::hashInsert' requested here uint32_t index = (uint32_t) mIntTermStorage.hashInsert(intVal); ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:105:24: note: candidate function inline std::size_t hash_value(int v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:110:24: note: candidate function inline std::size_t hash_value(unsigned int v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:115:24: note: candidate function inline std::size_t hash_value(long v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:120:24: note: candidate function inline std::size_t hash_value(unsigned long v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:229:24: note: candidate function inline std::size_t hash_value(float v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:234:24: note: candidate function inline std::size_t hash_value(double v) ^ /usr/local/include/boost-1_34_1/boost/functional/hash/hash.hpp:239:24: note: candidate function inline std::size_t hash_value(long double v) ^ 1 error generated. make[1]: *** [terms/TermStorage.o] Error 1 make: *** [build] Error 2 Sebastian-Sulgers-MacBook-Pro:dev sebastiansulger$ -- Sebastian Sulger FB Sprachwissenschaft Universität Konstanz http://ling.uni-konstanz.de/pages/home/sulger

1 0

[BGL] Assertion failed / memory leak in r_c_shortest_paths.hpp
by Alberto Santini 20 Oct '15

20 Oct '15

In the following 2-years old thread, a memory leak was experienced when using r_c_shortest_paths of the boost graph library. Jeremiah Willcock added a bunch of assertions to the code, to help identify the problem. https://groups.google.com/forum/#!topic/boost-list/W1muJiw85pA I think I now have a reproducible version of this, which I believe might be a bug. I would like some input before opening a bug report. Here is the gist: https://gist.github.com/alberto-santini/32c19530dcefb784d0f2 It contains: 1) graph.txt which contains a dump of the graph that exposes the problem 2) boost_bug.cpp which is the code used to build the graph from file and do the labelling 3) terminal_output.txt which contains the command used to compile and what happens when running the code It has been tested on Mac OS X 10.11 with GCC 5.2 and Boost 1.58. The programme doesn't necessary trigger the assertion at each run. There are runs in which it completes successfully, runs in which it segfaults without triggering any assertion and times in which it's aborted by the failed assertion. The failed assertion is: Assertion failed: (p_cur_label->b_is_valid), function r_c_shortest_paths_dispatch, file /usr/local/include/boost/graph/r_c_shortest_paths.hpp, line 472. I would like to know if you experience the same behaviour and can confirm (or at least make an educated guess) wether or not this is a bug in r_c_shortest_paths.hpp. Thanks, AS

1 1

Re: [Boost-users] [interprocess] Interprocess mutex not working / throwing exception when trying to write lock
by nav999 19 Oct '15

19 Oct '15

Dear Admin, It's ok if this does not reach the mailing list. I'm putting it up here as the answer, so that anyone browsing this Nabble forum will find it. The answer is here: http://stackoverflow.com/questions/33197889/boost-interprocess-mutex-crashe… -- View this message in context: http://boost.2283326.n4.nabble.com/interprocess-Interprocess-mutex-not-work… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[intrusive] accessing the hook type?
by Oliver Kowalke 18 Oct '15

18 Oct '15

I'd like to determine the hook type of an intrusive container (intrusive::list): template< typename List > void do_link( List & lst) { static_assert(std::is_same< typename List::???, my_hook_type >::value); lst.push_back( * this); }

2 2

boost spirit qi/karma char parsing/generating
by Ernest Zaslavsky 18 Oct '15

18 Oct '15

The question why does it treated as string character when my intention is to work with 8bit integral type? int8_t/uint8_t does not help either on most platforms it is just a define for signed/unsigned char. So, the broader question, how do you work with “byte” type when it is always treated as character? And the main question how do I force qi/karma to treat “char” as a number? P.S. cast to short is an obvious solution but it is not elegant [Read More]<http://feeds.feedburner.com/~r/sizmek-blog/~6/1> [http://www.sizmek.com/Sizmek.png]<http://www.sizmek.com/>

1 0

Boost.Python extension
by Jeff Archer 16 Oct '15

16 Oct '15

I am trying to use Boost.python to create a python extension. I have created the hello_ext example but find that I cannot import it. I am always getting the error "ImportError: No module named 'hello_ext'". Boost 1.59.0 Python 3.5 Visual Studio 2015

2 1

Re: [Boost-users] [interprocess] Interprocess mutex not working / throwing exception when trying to write lock
by Malko 16 Oct '15

16 Oct '15

Copying over here my initial reply: Hi, 1. Your lockWithWriteLock and lockWithReadLock create a lock, which locks on construction and unlocks on destruction, hence when the function returns no lock is held on the mutex. 2. The fact that you put a scope here makes me think that your intention is for the lock to be unlocked at the end of this scope (which it won't, as it is unlocked way before, as per #1). { std::cout<<"Program 1: Before first locking -------------------------- 1 v\n"; temp.sharedMutex->lockWithWriteLock(); const unsigned int SLEEP_TIME_IN_SECOND = 60; std::cout<<"Program 1: sleep for "<< SLEEP_TIME_IN_SECOND << "\n"; sleep(SLEEP_TIME_IN_SECOND); std::cout<<"Program 1: Finished sleeping\n"; } In this case though, you would perform the wait in bold while still holding the lock, and hence preventing the 2nd program from locking it. Once out of the scope you destroy the object right away. NOTE: both the issue in #1 and #2 lead to your first program possibly deleting the mutex before the 2nd program is done with it. Which leads to the issue you are experiencing. 3. If you need to have the 1st program wait for the 2nd program to be done, then do not use sleeps, use a condition_variable. -- View this message in context: http://boost.2283326.n4.nabble.com/interprocess-Interprocess-mutex-not-work… Sent from the Boost - Users mailing list archive at Nabble.com.

1 1

[Thread] Problems compiling an example from the docs
by Malko 16 Oct '15

16 Oct '15

Hi, I am trying to compile the following example: http://www.boost.org/doc/libs/1_59_0/doc/html/thread/synchronization.html#t… #include <boost/thread.hpp> #include <boost/thread/future.hpp> int parallel_sum(int* data, int size) { int sum = 0; if ( size < 1000 ) for ( int i = 0; i < size; ++i ) sum += data[i]; else { boost::future<int> handle = boost::async(parallel_sum, data+size/2, size-size/2); sum += parallel_sum(data, size/2); sum += handle.get(); } return sum; } int main() { int data[] = {1,2,3,4,5,6,7,8,9,10}; int a(parallel_sum, data, 10); return 0; } It does not compile because future is not a type in boost and async has the wrong signature. The future error goes away by defining BOOST_THREAD_PROVIDES_FUTURE, but I can not find this mentioned anywhere in the docs, I found out only looking on stack overflow. The async signature seems to require a function of arity 0. This is clang 3.4 output using Boost.1.59 and C++03: XXX/src/futtest.cpp:12:33: error: no matching function for call to 'async' boost::future<int> handle = boost::async(parallel_sum, data+size/2, size-size/2); ^~~~~~~~~~~~ /home/dev/build/third_party/64-rhel5/boost_1_59_0/include/boost/thread/future.hpp:3545:3: note: candidate function template not viable: requires 2 arguments, but 3 were provided async(launch policy, R(*f)()) { ^ /home/dev/build/third_party/64-rhel5/boost_1_59_0/include/boost/thread/future.hpp:3609:3: note: candidate function template not viable: requires 2 arguments, but 3 were provided async(launch policy, BOOST_THREAD_FWD_REF(F) f) { ^ /home/dev/build/third_party/64-rhel5/boost_1_59_0/include/boost/thread/future.hpp:3961:3: note: candidate function template not viable: requires single argument 'f', but 3 arguments were provided async(R(*f)()) { ^ /home/dev/build/third_party/64-rhel5/boost_1_59_0/include/boost/thread/future.hpp:3978:3: note: candidate function template not viable: requires single argument 'f', but 3 arguments were provided async(BOOST_THREAD_FWD_REF(F) f) { ^ XXX/src/futtest.cpp:22:7: error: excess elements in scalar initializer Is there more macro to be used to enable this to compile? Thanks P.S. It would be nice to have all the info about macro configuration for future (and async, if it has any) in the docs. -- View this message in context: http://boost.2283326.n4.nabble.com/Thread-Problems-compiling-an-example-fro… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

Xpressive regex superscript 2 and 3 parsed as plain digits
by Mia 15 Oct '15

15 Oct '15

Help pleaseI am using xpressive for text processing with regexes.Microsoft Visual C++ 13.0 on a windows 10 laptop, boost version 1_59_0 (and lib64-msvc-12.0 downloaded from sourceforge) , locale is en_US.UTF-8 .my regular expressions for catching any and all digits :wsregex any_number_regex = wsregex::compile(L"^(.*\\D)?(\\d+)(\\D.*)?$");Looks like it recognizes the superscript 2 and superscript 3 as plain “digits”all other superscript digits are not caught by this regex.examples:πr² 234³is this intentional?is this a bug?(I know I can change the regex to catch [0-9]+, this regex just one of many I use in my software!)thank youMia -- View this message in context: http://boost.2283326.n4.nabble.com/Xpressive-regex-superscript-2-and-3-pars… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Use of uninitialized value in any_range
by Auer, Jens 15 Oct '15

15 Oct '15

Hi, Valgrind reports multiple problems in our project which seem to come from boost::range::any_range. I was able to produce a small example which reproduces the problem: #include <iostream> #include <boost/range.hpp> #include <boost/range/any_range.hpp> #include <boost/range/adaptors.hpp> struct Int { Int(int i): x(i) {} int x; }; int main( int argc, char* argv[] ) { typedef boost::any_range<Int*, boost::forward_traversal_tag, Int*, std::ptrdiff_t> R; std::vector<std::unique_ptr<Int>> v; v.push_back( std::make_unique<Int>(42) ); auto f = [](std::unique_ptr<Int> const& p) {return p.get();}; R r = v | boost::adaptors::transformed(f); auto x = (*boost::begin(r))->x; std::cout << x << std::endl; return 0; } Running this, valgrind reports a "Use of uninitialized value of size 8": # g++ --version g++ (GCC) 5.2.0 # g++ -std=c++1y -o test test.cpp # valgrind --version valgrind-3.11.0 # valgrind --track-origins=yes ./test ==8119== Memcheck, a memory error detector ==8119== Copyright (C) 2002-2015, and GNU GPL'd, by Julian Seward et al. ==8119== Using Valgrind-3.11.0 and LibVEX; rerun with -h for copyright info ==8119== Command: ./test ==8119== ==8119== Use of uninitialised value of size 8 ==8119== at 0x4010B8: main (in /tmp/test) ==8119== Uninitialised value was created by a stack allocation ==8119== at 0x40315D: boost::range_detail::any_iterator<Int*, boost::iterators::forward_traversal_tag, Int*, long, boost::any_iterator_buffer<64ul> >::dereference() const (in /tmp/test) ==8119== 42 ==8119== ==8119== HEAP SUMMARY: ==8119== in use at exit: 72,704 bytes in 1 blocks ==8119== total heap usage: 3 allocs, 2 frees, 72,716 bytes allocated ==8119== ==8119== LEAK SUMMARY: ==8119== definitely lost: 0 bytes in 0 blocks ==8119== indirectly lost: 0 bytes in 0 blocks ==8119== possibly lost: 0 bytes in 0 blocks ==8119== still reachable: 72,704 bytes in 1 blocks ==8119== suppressed: 0 bytes in 0 blocks ==8119== Rerun with --leak-check=full to see details of leaked memory ==8119== ==8119== For counts of detected and suppressed errors, rerun with: -v ==8119== ERROR SUMMARY: 1 errors from 1 contexts (suppressed: 1 from 1) Best wishes, Jens -- Jens Auer | CGI | Software-Engineer CGI (Germany) GmbH & Co. KG Rheinstraße 95 | 64295 Darmstadt | Germany T: +49 6151 36860 154 jens.auer(a)cgi.com<mailto:jens.auer@cgi.com> Unsere Pflichtangaben gemäß § 35a GmbHG / §§ 161, 125a HGB finden Sie unter de.cgi.com/pflichtangaben<http://de.cgi.com/pflichtangaben>. CONFIDENTIALITY NOTICE: Proprietary/Confidential information belonging to CGI Group Inc. and its affiliates may be contained in this message. If you are not a recipient indicated or intended in this message (or responsible for delivery of this message to such person), or you think for any reason that this message may have been addressed to you in error, you may not use or copy or deliver this message to anyone else. In such case, you should destroy this message and are asked to notify the sender by reply e-mail. -- Jens Auer | CGI | Software-Engineer CGI (Germany) GmbH & Co. KG Rheinstraße 95 | 64295 Darmstadt | Germany T: +49 6151 36860 154 jens.auer(a)cgi.com<mailto:jens.auer@cgi.com> Unsere Pflichtangaben gemäß § 35a GmbHG / §§ 161, 125a HGB finden Sie unter de.cgi.com/pflichtangaben<http://de.cgi.com/pflichtangaben>. CONFIDENTIALITY NOTICE: Proprietary/Confidential information belonging to CGI Group Inc. and its affiliates may be contained in this message. If you are not a recipient indicated or intended in this message (or responsible for delivery of this message to such person), or you think for any reason that this message may have been addressed to you in error, you may not use or copy or deliver this message to anyone else. In such case, you should destroy this message and are asked to notify the sender by reply e-mail.

1 0

Boost Python having trouble with C++ int return results
by Bradley Neuberg 15 Oct '15

15 Oct '15

I'm fairly new to using Boost Python and running into some funkiness. When I try to pass back a simple int from C++ to Python, I get a Segmentation Fault. Here's the C++: #include <iostream> #include <boost/python.hpp> int helloworld() { return 10; } BOOST_PYTHON_MODULE(test_boost) { boost::python::def("helloworld", helloworld); } and here's the Python: import test_boost print(test_boost.helloworld()) The strange thing is it works fine with char const* types. Does anyone know what could cause this? Compiled on Mac OS X 10.10.5 with Anaconda Python with the following: g++ -g -shared -fPIC -I/Users/bradneuberg/anaconda/include/python2.7 test_boost.cpp -lpython2.7 -lboost_python -o test_boost.so Best, Brad Neuberg

1 0

Boost Intrusive compiler error
by Davies, John 14 Oct '15

14 Oct '15

I've been using Boost 1.55.0 that I built myself for about a year. Our team decide that we would prefer to use the pre-built files located on SourceForge as a standard (http://sourceforge.net/projects/boost/files/boost-binaries/1.55.0-build2/ ) I downloaded and installed and changed my Visual Studio 2013 project to point to the new root folder. I'm getting this error: Error 2 error C2228: left of '.select_on_container_copy_construction' must have class/struct/union c:\boostlib\boost\intrusive\detail\has_member_function_callable_with.hpp 200 1 BoostCommunication Googling hasn't helped. This code compiled on the libraries I built. I'd appreciate any help in tracking this down. ________________________________ The information contained in this message may be confidential and legally protected under applicable law. The message is intended solely for the addressee(s). If you are not the intended recipient, you are hereby notified that any use, forwarding, dissemination, or reproduction of this message is strictly prohibited and may be unlawful. If you are not the intended recipient, please contact the sender by return e-mail and destroy all copies of the original message.

2 1

Escaping boost.regex literal string fragments
by Dominique Devienne 13 Oct '15

13 Oct '15

Is there no equivalent to http://doc.qt.io/qt-4.8/qregexp.html#escape in Boost.Regex, i.e. a way to escape all special characters so they match "literally"? There are manual solutions, like http://stackoverflow.com/questions/1252992/how-to-escape-a-string-for-use-i…, but shouldn't that be part of the API? Does C++11's std::regex, based on boost::regex, include this API? Thanks, --DD

2 3

how to install boost-devel 1.59 in CentOS7
by 俊赵 13 Oct '15

13 Oct '15

Hello everyone. I want to install boost-devel 1.59 in centos7, but the default repo has only 1.53, so I have to compile it from the source code. I have download 1.59 from web page, and use ./bootstrap.sh and ./b2 install to install the boost 1.59. But when I want install other packages such as CGAL-devel, it tells me that I donnot install boost-devel 1.59, so I wonder how to install boost-devel? Thanks. Zhao Jun

3 2

boost interval container in shared memory
by Asna Ishrat 13 Oct '15

13 Oct '15

I have been trying to store boost interval map in shared memory, but my code below does not compile when I pass allocator while constructing map. After seeing template definition of boost interval_map I assume that boost icl only supports std::allocator. Is there any way to store this container in shared memory. int main () { static bip::managed_shared_memory global_mm(boost::interprocess::open_or_create, "MySharedMemory",65536 //segment name ); static bip::allocator<void, bip::managed_shared_memory::segment_manager> global_alloc(global_mm.get_segment_manager()); boost::icl::interval_map<int, int> *party = global_mm.find_or_construct<boost::icl::interval_map<int, int>>("Store")(global_alloc); party->add(make_pair(boost::icl::interval<int>::right_open(4,5),1)); std::cout << "adding result: " << *party << "\n"; }

1 0

owns_lock on lock not on mutex
by gast128 13 Oct '15

13 Oct '15

Hello all, there is an owns_lock on the lock type but not on the mutex. This is quite unhandy. Any reason why? Use case is in base-derived idiom: class Foo { public: void Process() { boost::unique_lock<boost::mutex> lck(m_mtx); Update(); } protected: void Update() { ++m_n; } boost::mutex m_mtx; int m_n; }; class Bla : public Foo { public: void Process() { boost::unique_lock<boost::mutex> lck(m_mtx); Update(); } private: void Update() { assert(m_mtx.owns_lock()); ++m_n2; Foo::Update(); } int m_n2; };

4 9

Log: [Bug] Setting attribute makes log entry disappear
by Florian Lindner 12 Oct '15

12 Oct '15

Hello, I have a tracer, that should log going in and out of a function: class Tracer { public: Tracer(Logger logger, std::string function, std::string file) : _logger(logger), _function(function), _file(file) {} ~Tracer() { using namespace boost::log; // attribute_cast<attributes::mutable_constant<int>>(core::get()->get_global_attributes()["Line"]).set(1); attribute_cast<attributes::mutable_constant<std::string>>(core::get()->get_global_attributes()["File"]).set(_file); attribute_cast<attributes::mutable_constant<std::string>>(core::get()->get_global_attributes()["Function"]).set(_function); BOOST_LOG_SEV(_logger, trivial::severity_level::trace) << "Leaving " << _function; } private: Logger _logger; std::string _function; std::string _file; }; This works fine, but as soon as I uncomment the line that sets the Line attribut I don't get any Leaving messages anymore. The attributes are added beforehand like that: using namespace boost::log; add_common_attributes(); core::get()->add_global_attribute("Scope", attributes::named_scope()); core::get()->add_global_attribute("Rank", attributes::constant<int>(5)); core::get()->add_global_attribute("Line", attributes::mutable_constant<int>(5)); core::get()->add_global_attribute("File", attributes::mutable_constant<std::string>("")); core::get()->add_global_attribute("Function", attributes::mutable_constant<std::string>("")); Setting all other attributes, similiar to Line works fine. I'm puzzled because Line does not seem to be a reserved name, it works somewhere else and the boost::log sources reveal no relevant usages of that name. What could be the problem here? I'm happy to send anyone the complate code (approx. 150 lines in total) Thanks! Florian

1 1

Boost.Fiber mini-review report
by Nat Goodspeed 10 Oct '15

10 Oct '15

The mini-review of Boost.Fiber by Oliver Kowalke ran from Friday September 4th through Sunday September 13th. There was lively discussion, but only two actual reviews: Agustín K-ballo Bergé: not yet (list of issues below) Niall Douglas: yes, plus suggestions (below)[0] In addition I received two "review withheld" notes: Vicente J. Botet Escriba wanted me to address the previous review point by point. That seems like a reasonable request, and I apologize, but I too have time pressures. Giovanni Piero Deretta made suggestions (synopsized below) with the statement that he will make a recommendation when he sees the library author's progress along those lines. While in theory these results might seem like a hung jury, the very paucity of formal reviews supports a cautious approach. The verdict is: not yet, with specific points as noted below. No reviewer explicitly designated specific points as being essential. (Niall Douglas explicitly designated his suggestions as post-adoption enhancements.) I have made an attempt to rank the recommendations received in descending order of importance to the community. My criteria are: Robustness: does lack of this request pose significant risk to a consuming program? API stability: could this request be considered an implementation detail, or would the change break early adopters? Demand: how many people requested the same thing? If you feel that I have misrepresented the importance of one of your points (or omitted something entirely), please respond. Ultimately, of course, the importance of any given point to the community at large will be reflected in the next mini-review. ----------------------------------------------------------------- Requests: Cross-thread fiber migration: Evidently the community strongly desires the ability to transfer a suspended fiber from one thread to another.[1] Of course there must be controls. Migration might be explicit; but if implicit, there must be a way to designate which fibers may and may not be migrated. An RAII class that temporarily disables migration would also be desirable -- for instance, to guarantee TLS consistency for some specific period. Cross-thread migration support implies a requirement to document the thread safety requirements of the customization API. Standard required timing specifications: meet (30.2.4 Timing specifications [thread.req.timing]). Adapt one or more existing test suites for thread facilities to validate the correctness of the Fiber library's synchronization constructs: e.g. from libc++, libstdc++, Boost.Thread, HPX. std::chrono support: ensure that wait_until() can accept any supported time_point specialization. (The library author asserts that this has already been fixed on the 'develop' branch.) C++11 compatibility: Agustín K-ballo Bergé volunteered to help with this point post-adoption. Paul Fultz offered fit::capture to emulate C++14 move capture. Document that this_fiber::yield() (et al.) are valid from main(), or in general from a thread function, as well as from explicitly-launched fibers. Make shared_state lock requirements explicit: for example, make mark_ready_and_notify_() accept a std::unique_lock<>& (or &&) to force its caller to provide one. Avoid holding mutex during condition_variable::notify_*() calls. (The library author asserts that this has already been fixed on the 'develop' branch.) packaged_task must not decay-copy its task arguments. Align fibers::async() signature, result description and invoke_helper implementation with std::async(). Avoid returning std::move(...). Wait list implementation: try an intrusive linked list of fiber_context objects. Avoid sleeping thread when no fibers are ready -- block on external event. Better handling of waiting tasks (decentralized wait queues?). Optimization to resume awakened fiber on the thread that awakens it. Template redundancy: eliminate duplication between specializations for T, T& and void. The future, shared_future, shared_state, promise and task_object templates were specifically cited. Leverage predicate-based condition::wait() overload internally. Nested schedulers: make schedulers be schedulable entities themselves. Improve robustness of `promise' handling in Asynchronous Callbacks documentation. Avoid overconfident remarks about it. Fix Note overstating the requirements on condition_variable::wait(). The discussion also surfaced the desirability of Grand Unified Future Theory, but it was generally agreed that this is out of scope. Put differently, it would be unreasonable to put the onus on Fiber to solve that very broad cross-library problem. Many thanks to all participants, and thanks especially to Oliver Kowalke for all his work on this library! Nat Goodspeed Boost.Fiber Review Manager ________________________________ [0] Niall Douglas snuck his review recommendation into the following mail message: http://lists.boost.org/Archives/boost/2015/09/225228.php (second to final paragraph). His suggestions were in private mail. [1] Giovanni Deretta suggests that it might be possible to allocate -- without actually running -- an actual kernel thread per fiber, simply to give each fiber its own TLS area.

2 1

boost::serialization bindings for PHP5 somewhere?
by Mauro Condarelli 10 Oct '15

10 Oct '15

Hi, I need to send some structures (and receive answers, of course) from a PHP5 front-end to a C++ back-end that already communicates with another C++ front-end via boost::serialization over a socket. Easiest would be to teach PHP5 to talk the same language. I know I can write a specific PHP5 extension in C++ and use boost::serialization there. Question is if such a beast (or something equivalent) already exists. Thanks in Advance Mauro

2 1

serialization code compilation problem - shared_ptr_helper.cpp in Boost 1.59
by Robert Fairlie 06 Oct '15

06 Oct '15

I tried building the serialization library only using the standard b2 approach and looking at the output. It looks like shared_ptr_helper.cpp isn’t included in the build (at least for serialization). So I just left it out of my own build and my code compiled and linked OK, and my serialization seems to be working. Does this approach sound safe or am I overlooking something?

2 1

serialization code compilation problem - shared_ptr_helper.cpp in Boost 1.59
by Robert Fairlie 06 Oct '15

06 Oct '15

Hi, I’m building the Boost serialization library in Visual Studio 2015 (for x86 and ARM) by copying the 40 or so files in libs\serialization\src and compiling them in my Visual Studio project. (I’m doing it this way because Visual Studio won’t seem to let me build everything with b2 in the ARM case). The last build of the 40 files I did used Boost 1.55 and that worked fine, but now with Boost 1.59, all files compile except shared_ptr_helper.cpp. I notice that shared_ptr_helper.cpp refers to a class called shared_ptr_helper_base, but I’ve done a full *.* search and it doesn’t seem to be declared anywhere. Also, I notice that usage of macros such as BOOST_ARCHIVE_DECL has been updated in other files, but not in shared_ptr_helper. Any advice on this would be much appreciated. Robert Fairlie

4 4

[geometry] is there an rtree version that works with boost.1.49 and MSVC2010?
by Jeff Flinn 05 Oct '15

05 Oct '15

I pulled the version down from the old svn sandbox, but msvc2010 doesn't support the variadic template args in indexable.hpp. Any help appreciated. Thanks, Jeff

2 1