July 2012 - Boost-users - lists.preview.boost.org

Segfault when using date_time
by Sara Siegal 01 Aug '12

01 Aug '12

I attempted to rebuild my Boost installation with nanosecond support for the date-time library. I did so by adding BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG = 1 ; to boost-build.jam and adding <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG to the jamfile in date_time/build. However, when I add this code to my application and compile, it segfaults: boost::posix_time::time_duration time1, time2; time1=boost::posix_time::seconds(3); std::cout << boost::posix_time::to_simple_string(time1) << std::endl; time2=boost::posix_time::nanoseconds(987654321); std::cout << boost::posix_time::to_simple_string(time2) << std::endl; boost::this_thread::sleep(time2); The segfault is at /archive/home/ssiegal/test/include/boost/date_time/posix_time/posix_time_config.hpp:99: (gdb) list 94 { 95 typedef gregorian::date date_type; 96 typedef time_duration time_duration_type; 97 simple_time_rep(date_type d, time_duration_type tod) : 98 day(d), 99 time_of_day(tod) 100 { 101 // make sure we have sane values for date & time 102 if(!day.is_special() && !time_of_day.is_special()){ 103 if(time_of_day >= time_duration_type(24,0,0)) { Anyone else ever see this? Is there anything else I need to do to turn on nanosecond resolution? Thanks very much!

3 2

[boost] [type_erasure] Review ends today July 27, 2012
by Lorenzo Caminiti 01 Aug '12

01 Aug '12

Hello all, On Mon, Jul 23, 2012 at 9:09 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: > On Wed, Jul 18, 2012 at 1:13 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: >> *** The review of Steven Watanabe's proposed Boost.TypeErasure library >> begins on July 18, 2012 and ends on July 27, 2012. *** > > *** Boost.TypeErasure review ends in 5 days. Please submit your reviews :D *** *** Boost.TypeErasure review ends today July 27, 2012. If you are planning to submit a review, please do so as soon as possible. *** Thank you to everyone who has commented on the library and submitted a review so far! The review manager, --Lorenzo P.S. I am considering extending the review until end of day Sunday July 29, 2012... I will keep you posted. > There have been interesting discussions on the library on the ML but I > have not received any official review yet :( Especially if you are a > user of Boost Any, Function, and Any Iterator, you definitely want to > take a look at Type Erasure as it generalizes solutions provided by > those other libraries. > > Thank you. > > The review manager. > --Lorenzo > >> THE LIBRARY >> >> C++ provides runtime polymorphism through virtual functions. They are >> a very useful feature, but they do have some limitations. >> * They are intrusive. In generic programming, we can design an >> interface which allows third-party types to be adapted to it. >> * They require dynamic memory management. Of course, most of the >> problems can be avoided by using an appropriate smart pointer type. >> Even so, it still acts like a pointer rather than a value. >> * Virtual functions' ability to apply multiple independent concepts to >> a single object is limited. >> The Boost.TypeErasure library solves these problems allowing us to >> mirror static generic programming at runtime. >> >> Library source: >> http://svn.boost.org/svn/boost/sandbox/type_erasure/ >> >> Pre-built documentation: >> http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ >> >> You can also download archives with pre-built documentation from: >> http://sourceforge.net/projects/steven-watanabe.u/files/ >> >> YOUR REVIEW >> >> Please submit a review to the mailing-list by replying to this email >> ("[boost] [type_erasure] Review ..." should be in the subject). >> >> Please state clearly whether you think this library should be accepted >> as a Boost library. >> >> Other questions you may want to consider: >> 1. What is your evaluation of the design? >> 2. What is your evaluation of the implementation? >> 3. What is your evaluation of the documentation? >> 4. What is your evaluation of the potential usefulness of the library? >> 5. Did you try to use the library? With what compiler? Did you have >> any problems? >> 6. How much effort did you put into your evaluation? A glance? A >> quick reading? In-depth study? >> 7. Are you knowledgeable about the problem domain? >> >> Thanks in advance to all who participate in the review discussion -- >> I'm looking forward to it!

4 4

[Boost.Move] Conflict between std::move and boost::move (Boost 1.49.0)
by Jonathan Jones 01 Aug '12

01 Aug '12

Hi folks, Consider the following code (which distilled from a real world example): #include <boost/move/move.hpp> #include <boost/optional/optional.hpp> #include <utility> #include <vector> typedef boost::optional<int> data_type; typedef std::vector<data_type> vector_type; vector_type func() { vector_type vv; return move(vv); } If I compile this code using Boost 1.49 on Visual Studio 2010, or on a recent version of g++ (e.g. 4.7.1) which supports some C++11 features, the code fails to compile, complaining about ambiguity between std::move and boost::move. Strangely, the code compiles fine with Apple Clang version 3.1. Is there a way to work around the compilation problem which doesn't involve explicitly qualifying the calls to move? I'd prefer to use argument-dependent-lookup. Removing the includes of boost/move.hpp is not possible. In the real world example, that header is included indirectly. I did notice that if I define the macro BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE, the compilation errors disappear. Is this the correct approach for compilers which support std::move? I find it odd that this macro isn't already defined for such compilers. Thanks in advance! Jon

5 4

accumulators: not copying doubles into the acc set
by MM 01 Aug '12

01 Aug '12

Hello, Having a list of doubles stored somewhere, is there a way not to copy the doubles into the accumulator set and just iterate somehow through the existing data in order to save memory. Imagine I have a std::vector<double> with 10million entries. Then pushing each double to the accumulator set object, then I'd imagine, at one point, the process would hold the 10 million doubles twice. Rds, MM

3 3

[context / coroutine] linker errors
by Szymon Gatner 31 Jul '12

31 Jul '12

I grabbed coroutine lib from http://olk.bplaced.net/boost-coroutine.zip and I am getting linker errors with VC2008 SP1 when trying to compile simplest example from coroutine's documentation: Error 1 error LNK2019: unresolved external symbol _jump_fcontext referenced in function "public: int __thiscall boost::coro::detail::context_base<void __cdecl(void),class boost::ctx::stack_allocator,void,0>::native_start(void)" (?native_start@?$context_base@$$A6AXXZVstack_allocator@ctx@boost@@X$0A@@detail@coro@boost@@QAEHXZ) main_2.obj context Error 2 error LNK2019: unresolved external symbol _make_fcontext referenced in function "public: __thiscall boost::coro::detail::context_base<void __cdecl(void),class boost::ctx::stack_allocator,void,0>::context_base<void __cdecl(void),class boost::ctx::stack_allocator,void,0>(class boost::ctx::stack_allocator const &,unsigned int,enum boost::coro::flag_unwind_t,bool)" (??0?$context_base@$$A6AXXZVstack_allocator@ctx@boost@@X$0A@@detail@coro@boost@@QAE@ABVstack_allocator@ctx@3@IW4flag_unwind_t@23@_N@Z) main_2.obj context btw, old documentation link (http://ok73.ok.funpic.de/boost/libs/context/doc/html/) for boost.context does not work anymore and I remember it had continuation example which is not included in library examples. Any way to get it back? -- Szymon Gatner The Lordz Games Studio www.thelordzgamesstudio.com

2 1

Re: [Boost-users] Boost 1.49 msm And_ operator
by Kamel Zaarouri, Mr 30 Jul '12

30 Jul '12

Hi, I know this may seem silly but is there an operator that I can use to combine actions in the transition table to same way I can "and" guard conditions? if I have 2 guards, g1 and g2 in the transition table I can write under guard And_<g1,g2> what if I want to execute 2 actions upon a transition, obviously I can't have And_<a1,a2> since actions do not return boolean. Any idea? Thanks. ________________________________________ From: boost-users-bounces(a)lists.boost.org [boost-users-bounces(a)lists.boost.org] on behalf of Christophe Henry [christophe.j.henry(a)googlemail.com] Sent: Wednesday, July 11, 2012 4:17 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Boost 1.49 msm problems with events > Hi, I am having problems with my transition table and events. Let me > explain the fake design that illustrates the problem: > > I have a state machine (myStateMachine) containing 2 states (s0 and s1) > and 1 substatemachine (subm1). > > the substatemachine subm1 contains an initial state 'sub0' and also s1 > (the same state as in myStateMachine). > > this is the main transition table: > > s0->s1 on event 'ES1' > s0->s2 on event 'ES2' > s0->subm1 on event 'ESUB' > > this is the submachine transition table: > > sub0->s1 on event ES1 > > now, assume that state s1 is using the event that triggered it to extract > some information i.e. > > struct s1 : public msm::front::state<> > { > template <class Event,class FSM> > void on_entry(Event const& evt,FSM& fsm) > { > evt.getEventData(); > } > } > so every event that could transition to s1 needs to implement > getEventData() method. > > ->this is normal! > > now my problem is that ESUB does NOT implement getEventData() but > apparently it should. And I don't get why. > > I am not using ESUB to transition to s1 but I am using ESUB to transition > to subm1 and subm1 contains s1 but I don't access it at that point. > > I hope this is clear. > > Thank you. Hi, this is an unfortunate limitation of msm (for composites), which I have on my list of stuff to solve asap. The problem is that though the event esub is not used to transition to s1, for the compiler it could. Whatever, it's my fault, plus I forgot it in the doc :( The solution is to help the compiler a bit by enabling on_entry with evt.getEventData() only for events having a special property, like your es1. For example: BOOST_MPL_HAS_XXX_TRAIT_DEF(get_event_data) // this event supports getEventData struct es1 { typedef int get_event_data; void getEventData(){...} }; Then use this in your state: struct s1 : public msm::front::state<> { template <class Event,class FSM> typename boost::enable_if<typename has_get_event_data<Event>::type,void>::type on_entry(Event const& evt,FSM& fsm) { evt.getEventData(); } // for events not supporting getEventData like esub template <class Event,class FSM> typename boost::disable_if<typename has_get_event_data<Event>::type,void>::type on_entry(Event const& ,FSM& ) { } }; HTH, Christophe _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Can I copy/paste Boost source code and compile directly into my application?
by Fred 29 Jul '12

29 Jul '12

Dear Boosters, I would like to use the Boost/regex library in my application, but I don't want my users to have to install Boost. My preference would be to copy a minimal set of Boost .hpp and .cpp files into a sub-directory of my application and then compile and link the boost/regex stuff in the same way as the rest of my application. Note that the regex library is not a header-only library. So, is there a reasonably straight-forward and well-accepted procedure to do this? Apologies if this topic has already been covered, but I can't seem to get a hit. Many thanks, Fred

6 7

Boost Python: add_property and shared_ptr
by Raul Durand 29 Jul '12

29 Jul '12

Hi! I've been using the boost::python library for some time with few problems but now I got stuck. Fortunately I isolated the problem. In the class Domain below I defined a property called solver which returns a shared_ptr<Solver> instance: *namespace bp=boost::python;** **class Solver **{ **public: ** bool _b; ** void func() { _b = true; } **};** **typedef shared_ptr<Solver> Solver_ptr;** ** class Domain **{ **public: ** Solver_ptr solver; ** void set_solver(Solver_ptr s) { solver = s; } **};** **typedef shared_ptr<Domain> Domain_ptr;** ** BOOST_PYTHON_MODULE(test) {** * * bp::class_<Solver, Solver_ptr>("Solver")* * .def("func", &Solver::func)* * ;* * bp::class_<Domain, Domain_ptr>("Domain")* * .def("set_solver" , &Domain::set_solver)* * .add_property("solver" , &Domain::solver)* * ;* *}* The code compiles ok. The problem appears while running in Python: *from test import * **d = Domain() **s = Solver() **d.set_solver(s) # is it ok to do that? **d.solver.func() # this line does not work* With the following error message: *Traceback (most recent call last):* * File "test_test.py", line 5, in <module>* * d.solver.func()* *Boost.Python.ArgumentError: Python argument types in* * Solver.func(Solver)* *did not match C++ signature:* * func(Solver {lvalue})* I suspect that the problem is related with add_property returning a shared_ptr<Solver> aka Solver_ptr. It seems that add_property is returning a *non lvalue* Solver object. I tried applying return value policies with no luck. How can I get Domain::solver with type Solver_ptr in Python as a lvalue ? Thanks! Raul Durand

1 0

[Iterator] swap and iter_swap do not work with zip_iterator
by Benjamin Lindley 28 Jul '12

28 Jul '12

I wanted to use zip_iterator to concurrently sort two arrays by the values in one of them. It didn't work. Most of the values were over-written by one of the pairs. I figured out that there was a problem with the swapping, so I made this small test case. Compiled with GCC 4.6.1 on Ubuntu 11.10 #include <utility> #include <iostream> #include <boost/iterator/zip_iterator.hpp> int main() { std::vector<int> a = { 1, 2 }; std::vector<int> b = { 100, 200 }; auto first = boost::make_zip_iterator( boost::make_tuple(a.begin(), b.begin())); auto last = boost::make_zip_iterator( boost::make_tuple(a.begin() + 1, b.begin() + 1)); std::cout << first->get<0>() << ' ' << last->get<0>() << '\n'; std::cout << first->get<1>() << ' ' << last->get<1>() << "\n\n"; using std::swap; using std::iter_swap; // swap(*first, *last); // doesn't compile iter_swap(first, last); std::cout << first->get<0>() << ' ' << last->get<0>() << '\n'; std::cout << first->get<1>() << ' ' << last->get<1>() << "\n\n"; } Output: 1 2 100 200 2 2 200 200 Expected Output: 1 2 100 200 2 1 200 100 Is this a known problem?

3 3

linking against boost libraries using a binary compatible compiler
by Petros 27 Jul '12

27 Jul '12

Hi, I am working on win7 with vs2010. Occasionally I want to compile with the windows intel compiler (icl, 12.1), whih is to be syntactically and binary fully compatible with the vs2010 (cl10.0). However, due to the “magic” that binds the boost code with the libraries to link against ( btw, where does this “magic” happen?), when I am building with intel, the intel libs are searched for. Building boost with the intel compiler on windows can have its moments, as witnessed by the repeated posts on the web . I would be perfectly happy with linking msvc-compiled boost with the rest of my code compiled with the intel compiler. How can this be done ? Has anyone done it ? (Someone must have thought of this – also saves from two separate builds of the boost libraries ) TVMIA, Petros

1 0

[boost] [fusion] fusion::map doesn't define 'category'
by Steve Lorimer 27 Jul '12

27 Jul '12

I am attempting to create a fusion map which looks like: map< pair<field1, int>, pair<field2, int> > I am then attempting to find out if *field1 *exists in the map using *has_key, *but am getting a compile error: error: no type named ‘category’ in ‘struct boost::fusion::result_of::as_map<boost::fusion::vector2<boost::fusion::pair<field1, int>, boost::fusion::pair<field2, int> > > Can anyone offer insight on what I'm doing wrong? I have a simple example below: #include <iostream> #include <boost/fusion/container.hpp> #include <boost/fusion/sequence.hpp> #include <boost/fusion/mpl.hpp> #include <boost/fusion/include/has_key.hpp> #include <boost/mpl/transform.hpp> namespace fusion = boost::fusion; namespace mpl = boost::mpl; *// given a field, returns a fusion pair of <field, field::type>* template<class field> struct make_pair { typedef typename fusion::result_of::make_pair<field, typename field::type>::type type; }; *// given a sequence of fields, returns a fusion map which maps field -> field::type* template<class fields> struct make_map { typedef typename mpl::transform<fields, make_pair<mpl::_1>>::type pair_sequence; typedef typename fusion::result_of::as_map<pair_sequence> type; }; *// sets boolean value to true if field is in fields* template <class field, class... fields> struct contains_key { typedef typename boost::fusion::vector<fields...> vector; typedef typename make_map<vector>::type map; typedef typename fusion::result_of::has_key<map, field>::type result; static const bool value = result(); }; struct field1 { typedef int type; }; struct field2 { typedef int type; }; int main() { std::cout << contains_key<field1, field1, field2>::value << std::endl; return 0; }

2 2

[boost] [fusion] Find the index of an item in a fusion map
by Steve 27 Jul '12

27 Jul '12

I have a fusion map in a class which I want to initialize with a variadic constructor template<typename... Args> ctor(Args... args) { ..... } I imagine I would create a fusion vector using make_vector and then iterate over the elements of the map and somehow set the value of each map pair to it's corresponding element in the vector. I think that if I could find the index position of a single element in the map, that I could then use for_each to iterate over the pairs, and use the item's index to retrieve the corresponding value from the vector. Can anyone help me with this? Perhaps there is an alternate better way to do this? TIA Steve

1 0

[Serialization and C++11] Using std::unique_ptr with boost::serialization
by berenger.morel＠neutralite.org 26 Jul '12

26 Jul '12

Hello. I am trying to serialize a node of a DP composite. This would probably be straightforward if I used raw pointers, but I am using std::unique_ptr. I am not sure it is possible, since I tried to find the word unique_ptr in my /usr/include/boost directory and found almost nothing (except interprocess and chrono which have been installed for other purposes). So, is there is a way to use serialization on unique_ptr, or is there is a reason to avoid doing this? Note: I have made some tries with using boost::serialization on my objects as if they were raw pointers and it have obviously failed, because expected type seems to be only raw pointer and unique_ptr is not compatible with it.

2 1

[BGL] inv_adjacency_iterator is missing in graph_traits.hpp
by Johan Oudinet 26 Jul '12

26 Jul '12

Hi, I have a bidirectional adjacency list and I want to use the inv_adjacent_vertices method However, the following code does not compile: typedef boost::graph_traits<Graph> Traits; typedef typename Traits::inv_adjacency_iterator inv_adjacency_iterator; inv_adjacency_iterator w, w_end; boost::tie (w, w_end) = inv_adjacent_vertices (v, g_); The problem is that inv_adjacency_iterator is not part of boost::graph_traits :-( Could you tell me how can I use the inv_adjacent_vertices method (i.e., how can I declare an inv_adjacent_iterator)? Thanks. Best regards, P.S.: I tried to use an adjacency_iterator instead but it does not work. -- Johan () ascii ribbon campaign - against html e-mail /\ www.asciiribbon.org - against proprietary attachments

2 2

Boost 1_50 does not get installed
by Panagiotis Foteinos 26 Jul '12

26 Jul '12

Greetings. I invoke ./b2 variant=release and everything seems to be fine. I can see that the thread library is created inside under $SOURCE/bin.v2/libs . Nevertheless, the command ./b2 install does not copy the libraries under /usr/local. It does nothing. All I see is many warnings similar to: **************************** skipped bin.v2/libs/thread/build/gcc-4.4.3/release/link-static for lack of bin.v2/libs/thread/build/gcc-4.4.3/release... **************************** Any ideas? Regards, Panagiotis Foteinos OS: Ubuntu, gcc 4.4.3, 64 bits

2 4

[math/distributions] invalid values for undefined moments
by Thomas Mang 26 Jul '12

26 Jul '12

Hi, According to the documentation, in boost 1-50 non-member functions of moments (e.g. mean, variance) which are not defined for a given distribution shall issue compile-time errors, or throw a domain_error at runtime otherwise. For the Cauchy Distribution, that's what it does. For the t-distribution, that's not what it does - the non-member functions happily return some complete rubbish values for mean and variance (and hence I'd also suppose standard deviation). For kurtosis and skewness it seems to work correctly but are subject to mathematical definitions. I have not tested other non-member functions. Note that there are different definitions floating around as to when a given moment is defined. The k-th moment is always defined if k < v, but in other cases opinions deviate. Wikipedia states it might be infinity under some circumstances - obviously what boost seems to having taken over. In general however I am used to - and my gut feeling the clear majority of people would have this perception; indeed I am not aware of any other source than wikipedia stating these infinity things - that moments are undefined if k >= v (see e.g. Probability and Statistics, DeGroot & Schervish 2002, for a professional textbooks and heaps of other sources). So while the boost output for variance and a t-2 distribution (or alternatively also the kurtosis of a t-4 distribution) might be considered ok by some, I'd guess to most people it would be fairly unexpected? It had been a surprise to me, at least. Code snippet: typedef boost::math::students_t_distribution<double> t_distr; // this is ok std::cout << "mean(t(2)): " << boost::math::mean( t_distr(2) ) << std::endl; // this is NOT ok - first moment not defined for given distribution std::cout << "mean(t(1)): " << boost::math::mean( t_distr(1) ) << std::endl; // this is ok std::cout << "var(t(3)): " << boost::math::variance( t_distr(3) ) << std::endl; // this might be ok or not // depending on point of view, either Inf or undefined std::cout << "var(t(2)): " << boost::math::variance( t_distr(2) ) << std::endl; // this is NOT ok - second moment not defined for the given distribution std::cout << "var(t(1)): " << boost::math::variance( t_distr(1) ) << std::endl; best, Thomas

2 1

Building Boost in Release mode
by VimalMathew＠Eaton.com 25 Jul '12

25 Jul '12

Hi, How do I build Boost in 'Release' mode for VS 10.0? Is this correct: b2 toolset=msvc-10.0 runtime-link=static link=static variant=release threading=multi -- Vimal

2 1

[MPI] all_gather() missing functionality or bug ?
by Thomas Hisch 25 Jul '12

25 Jul '12

Hello list, I discovered that the all_gather function from boost.mp throws an exception, if the local sizes of the to be gathered vector are different: terminate called after throwing an instance of 'terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::mpi::exception> >' what(): MPI_Allgather: MPI_ERR_IN_STATUS: error code in status boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::mpi::exception> >[thisch:14211] *** Process received signal *** I used the following form of the all_gather function: all_gather(comm, myvec.data(), myvec.size(), totalvec) where myvec is a std::vector<double>. As already mentioned the size of myvec can be different on each processor. The documentation [0] says that all_gather supports most uses of the MPI_Allgatherv. Therefore I am not sure if my use of all_gather is unsupported or a just a bug. all_gather works as excpected if myvec.size() is the same on all processors. ATM I use the following workaround: { //temporary all_gather fix: use MPI_Allgatherv vector<int> recvcts(numprocs); vector<int> displs(numprocs); const int nrealcoeffs = N; const int initialcoeffsperrank = nrealcoeffs/numprocs; const int remainder = nrealcoeffs%numprocs; size_t displtmp = 0; for(size_t i=0; i < numprocs; i++){ recvcts[i] = initialcoeffsperrank; if(i < remainder) recvcts[i]++; displs[i] = displtmp; displtmp += recvcts[i]; } allgradient.resize(N); MPI_Allgatherv( myvec.data(), myvec.size(), MPI_DOUBLE, totalvec.data(), recvcts.data(), displs.data(), MPI_DOUBLE, comm); } Regards Thomas [0] http://www.boost.org/doc/libs/1_50_0/doc/html/mpi/tutorial.html#mpi.c_mappi…

2 1

segfault happens when I serialize nested class in apache module
by Hassan Monfared 25 Jul '12

25 Jul '12

Hi all, Serializing simple class "A" in Apache module done without error but when I tried to serialize my complex object like "X" which has a member, type of "A", I got segfault in Apache module. ( this doesn't happen to a executable console application ) ------------------------- here is my code : --------------------- class A { private: friend class boost::serialization::access; // to enable boost "access" class to call private "serialize" method of class "A" template<class ArchT> void serialize(ArchT &ar, unsigned int version) { // method for both serializing and deserializing ar & memA; // (de)serialize member "memA" } std::string memA; // sample member public: A(){} A(std::string pmemA) : memA(pmemA) { } std::string GetMemA() { return memA; } }; class X { private: friend class boost::serialization::access; template<class ArchT> void serialize(ArchT &ar, unsigned int version) { ar & memX; ar & a; } std::string memX; A a; public: X(std::string pmemX, A pa) : memX(pmemX), a(pa) { } X(){} }; ------------------- string st=GetRandomFileName(); ofstream out(st.c_str()); boost::archive::text_oarchive out_r(out); A a("Amem"); X x("Xmem", a); out_r << x; // not works out_r << a; // works! ------------------- here is stack trace from gdb for apache ---------------- Program received signal SIGSEGV, Segmentation fault. 0xb39b846e in ?? () (gdb) backtrace #0 0xb39b846e in ?? () #1 0xb722379e in boost::serialization::typeid_system::extended_type_info_typeid_0::is_less_than(boost::serialization::extended_type_info const&) const () from /tmp/libIRSProWebApacheModule.so #2 0xb7223c61 in std::_Rb_tree<boost::serialization::typeid_system::extended_type_info_typeid_0 const*, boost::serialization::typeid_system::extended_type_info_typeid_0 const*, std::_Identity<boost::serialization::typeid_system::extended_type_info_typeid_0 const*>, boost::serialization::typeid_system::type_compare, std::allocator<boost::serialization::typeid_system::extended_type_info_typeid_0 const*> >::_M_insert_equal(boost::serialization::typeid_system::extended_type_info_typeid_0 const* const&) () from /tmp/libIRSProWebApacheModule.so #3 0xb7223b37 in boost::serialization::typeid_system::extended_type_info_typeid_0::type_register(std::type_info const&) () from /tmp/libIRSProWebApacheModule.so #4 0xb72066d2 in boost::serialization::extended_type_info_typeid<A>::extended_type_info_typeid (this=0xb735a638) at /usr/include/boost/serialization/extended_type_info_typeid.hpp:89 #5 0xb720650d in boost::serialization::detail::singleton_wrapper<boost::serialization::extended_type_info_typeid<A> >::singleton_wrapper (this=0xb735a638) at /usr/include/boost/serialization/singleton.hpp:106 #6 0xb7206572 in boost::serialization::singleton<boost::serialization::extended_type_info_typeid<A> >::get_instance () at /usr/include/boost/serialization/singleton.hpp:128 #7 0xb72064e3 in boost::serialization::singleton<boost::serialization::extended_type_info_typeid<A> >::get_const_instance () at /usr/include/boost/serialization/singleton.hpp:141 #8 0xb720637b in boost::archive::detail::oserializer<boost::archive::text_oarchive, A>::oserializer (this=0xb735a62c) at /usr/include/boost/archive/detail/oserializer.hpp:112 #9 0xb7206253 in boost::serialization::detail::singleton_wrapper<boost::archive::detail::oserializer<boost::archive::text_oarchive, A> >::singleton_wrapper (this=0xb735a62c) at /usr/include/boost/serialization/singleton.hpp:106 #10 0xb72062b8 in boost::serialization::singleton<boost::archive::detail::oserializer<boost::archive::text_oarchive, A> >::get_instance () at /usr/include/boost/serialization/singleton.hpp:128 #11 0xb71fb0ec in __static_initialization_and_destruction_1 (__initialize_p=1, __priority=65535) at /usr/include/boost/serialization/singleton.hpp:149 #12 0xb71fb161 in _GLOBAL__sub_I_IRSProWeb_InputFilter.cc(void) () at ../IRSProWeb_InputFilter.cc:242 #13 0xb7fee7fb in ?? () from /lib/ld-linux.so.2 #14 0xb7fee8e4 in ?? () from /lib/ld-linux.so.2 #15 0xb7ff2819 in ?? () from /lib/ld-linux.so.2 #16 0xb7fee61f in ?? () from /lib/ld-linux.so.2 #17 0xb7ff20c4 in ?? () from /lib/ld-linux.so.2 #18 0xb7d31be9 in ?? () from /lib/i386-linux-gnu/libdl.so.2 #19 0xb7fee61f in ?? () from /lib/ld-linux.so.2 #20 0xb7d3233a in ?? () from /lib/i386-linux-gnu/libdl.so.2 #21 0xb7d31c97 in dlopen () from /lib/i386-linux-gnu/libdl.so.2 #22 0xb7f3d100 in apr_dso_load (res_handle=0xbfffef08, path=0x8140b78 "/tmp/libIRSProWebApacheModule.so", pool=0x8140ab0) at dso/unix/dso.c:139 #23 0xb77587c7 in load_cpp_module (pool=0x8140ab0, server=0x8100ea8, server_rec=0x816dbc0, next=0x8140b50) at apache_handler.cpp:140 #24 0xb7757680 in load_handler (pool=0x8140ab0, server=0x8100ea8, server_rec=0x816dbc0, next=0x8140b50) at mod_cplusplus.c:83 #25 0xb77576d2 in load_handlers (pool=0x8140ab0, server=0x8100ea8, server_rec=0x816dbc0) at mod_cplusplus.c:89 #26 0xb7757737 in cpp_spawn_handlers (p=0x8140ab0, s=0x8100ea8) at mod_cplusplus.c:100 #27 0x0808b748 in ap_run_child_init (pchild=0x8140ab0, s=0x8100ea8) at config.c:166 #28 0x080af138 in child_main (child_num_arg=0) at event.c:2028 #29 0x080af464 in make_child (s=0x8100ea8, slot=0) at event.c:2169 #30 0x080af5ae in startup_children (number_to_start=3) at event.c:2233 #31 0x080afeba in event_run (_pconf=0x80dc0a8, plog=0x813caa0, s=0x8100ea8) at event.c:2561 #32 0x0806fa6d in ap_run_mpm (pconf=0x80dc0a8, plog=0x813caa0, s=0x8100ea8) at mpm_common.c:98 #33 0x08068fc4 in main (argc=2, argv=0xbffff3b4) at main.c:777

1 0

[interprocess] Strange behaviour after push_back in a b::i::vector of b::i::weak_ptr
by Gaetan Gaumer 24 Jul '12

24 Jul '12

Hello Ion a others interprocess guru, I'm currently using an interprocess::vector storing intreprocess::weak_ptr to data. Sometimes after adding a shared_ptr to my vector with push_back, the weak_ptr stored at the end of the vector is not the one I just inserted, but a copy of a previously inserted weak_ptr. For examples the code below : void addData (const SharableDataTypes<Data>::SharedPtrType & PData){ dataWPVector.push_back(PData); if (dataWPVector.rbegin()->lock()->getObjectId() != PData->getObjectId()){ std::cerr << "After pushback in dataWPVector vector last elem Id=" << dataWPVector.rbegin()->lock()->getObjectId() << " added cable Id =" << PData->getObjectId() << std::endl; } } spills the trace : "After pushback in dataWPVector vector last elem Id=50332165 added elem Id =352322053" which should obviously not happen. By adding some traces to the file : boost/interprocess/containers/container/vector.hpp I found that this case only happens during a resizing step when the method priv_range_insert_expand_backwards is used and in one of the 8 cases I labeled "4/8 and NOT do_after" (see http://pastebin.com/bLBwiBia line 41) For easier test, I created a sample code which try to reproduce the problem : http://pastebin.com/rdpZA7CU (Note : I used multiIndex to be the closest to our code). I compiled it with gcc44 (GCC) 4.4.0 20090514 (Red Hat 4.4.0-6) on a 64b Red Hat Enterprise Linux Server release 5.4 server using Boost V1.47 with the command : gcc44 -std=c++0x -m64 -I/path_to_boot/boost_1_47_0/include/ -lrt -lstdc++ testPushBackVector.cc -o testPushBackVector Note that this program does not reproduce the problem, as when it runs, only the priv_range_insert_new_allocation method is called. I don't know how to force the program to use priv_range_insert_expand_backwards to reproduce the problem. So now, the question : Am I doing something wrong or is this a bug ? Thanks for your help, Gaëtan

3 8

Conflict between boost::bind and winsock's bind function
by VimalMathew＠Eaton.com 24 Jul '12

24 Jul '12

Hi, I'm using winsock's bind function in my code. After adding a bunch of header files related to boost for some other added functionality, I'm getting this error: error C2668: 'boost::bind' : ambiguous call to overloaded function 1> c:\boost_1_49_0\boost\bind\bind.hpp(1480): could be 'boost::_bi::bind_t<R,F,L> boost::bind<SOCKET,sockaddr*,unsigned int>(F,A1,A2)' 1> with 1> [ 1> R=boost::_bi::unspecified, 1> F=SOCKET, 1> L=boost::_bi::list2<boost::_bi::value<sockaddr *>,boost::_bi::value<unsigned int>>, 1> A1=sockaddr *, 1> A2=unsigned int 1> ] How do I specify that I want to use winsock's bind function and not boost's? -- Vimal

2 1

Concept check negation
by Alexander Stoyan 24 Jul '12

24 Jul '12

Hi all, Is there any way to negate concept check, so that it'd be possible to assert if a type is NOT DefaultConstructible, etc. ? Thanks in advance. ============================== Never lose heart! Regards, Alexander Stoyan e-mail: alexander.stoyan, you know, at google mail dot com gtalk: alexander.stoyan, you know, at google mail dot com skype: alexander.stoyan <http://alexander-stoyan.blogspot.com/> http://alexander-stoyan.blogspot.com

2 1

Re: [Boost-users] Missing libboost_thread-vc100-mt-s-1_49.lib
by VimalMathew＠Eaton.com 24 Jul '12

24 Jul '12

Anybody? -- Vimal -----Original Message----- From: Mathew, Vimal Sent: Friday, July 20, 2012 2:32 PM To: boost-users(a)lists.boost.org Subject: Missing libboost_thread-vc100-mt-s-1_49.lib Hi, I'm trying to build a project using nmake. When I run nmake I get this error message: " LINK : fatal error LNK1104: cannot open file 'libboost_thread-vc100-mt-s-1_49.lib " Could someone tell me what I'm missing please? Thanks, Vimal

4 10

[move] case study: simple cloning smart pointer
by Krzysztof Czainski 24 Jul '12

24 Jul '12

Hello, In order to learn how to implement move semantics, I decided to write a simple cloning smart pointer (called ptr) with diagnostic information, and an example showing all constructor and assignment use cases I could think of. I wanted the pointer to be convertible (and movable) to pointers to base classes. I've prepared two versions of conversion constructors and assignment operators in ptr. In the first version I tried to write everything like Boost.Move docs for implementing Copyable and Movable classes suggest, and then added the conversion constructors and assignment operators. Then I wrote a second version, using the pass-by-value and swap idiom. Any comments about my attempts here are welcome. Did I get it right in both versions? The attached file swap_idiom.zip contains: ptr.hpp - the deffinition of the ptr class template main.cpp - example for ptr<>, showing all constructor and assignment use cases I could think of 03.txt, 03_by_value.txt, 0x.txt, 0x_by_value.txt - the output I got for both versions of ptr, in two versions of C++: 03 and 0x. For this test I used MinGW-4.5.0. Here's how the ptr<> class looks like (ptr.hpp) (note: {{{this}}} is how I mark code): {{{ extern int ptr_s; // helper for diagnostics template < class T > T* clone_me( T const* p ); template < class T > class ptr { public: explicit ptr( T* p = 0 ) : p_(p) { ++ptr_s; std::cout << "_p "; } // copy ctor ptr( ptr const& b ) : p_( clone_me(b.get()) ) { ++ptr_s; std::cout << "cp "; } // move ctor ptr( BOOST_RV_REF(ptr) b ) : p_( b.release() ) { ++ptr_s; std::cout << "mp "; } }}} So far so good. This is where the hard part comes in - the conversion constructors and assignment operators. First version looks like this: {{{ private: #if !defined(BY_VALUE) BOOST_COPYABLE_AND_MOVABLE(ptr) public: // generalized copy ctor for pointers to derived template < class U > ptr( ptr const& b, typename boost::enable_if< boost::is_convertible<U*,T*> >::type* = 0 ) : p_( clone_me(b.get()) ) { ++ptr_s; std::cout << "Cp "; } // generalized move ctor for pointers to derived template < class U > ptr( BOOST_RV_REF(ptr) b, typename boost::enable_if< boost::is_convertible<U*,T*> >::type* = 0 ) : p_( b.release() ) { ++ptr_s; std::cout << "Mp "; } ptr& operator=( BOOST_COPY_ASSIGN_REF(ptr) b ) { T* tmp = clone_me(b.get()); // this can throw boost::checked_delete(p_); p_ = tmp; return *this; } ptr& operator=( BOOST_RV_REF(ptr) b ) { boost::checked_delete(p_); p_ = b.release(); return *this; } template < class U > typename boost::enable_if< boost::is_convertible<U*,T*>, ptr& >::type operator=( ptr const& b ) { T* tmp = clone_me(b.get()); // this could throw boost::checked_delete(p_); p_ = tmp; return *this; } template < class U > typename boost::enable_if< boost::is_convertible<U*,T*>, ptr& >::type operator=( BOOST_RV_REF(ptr) b ) { boost::checked_delete(p_); p_ = b.release(); return *this; } }}} This was long, and contains some tricky places, like the one commented 'this could throw'. Did I even get it right? I think so, but I'm just beginning to learn about move semantics here ;-) Anyway, next comes the second version: implementing conversion constructors and assignment operators in terms of pass-by-value and swap. Note the use of BOOST_COPYABLE_AND_MOVABLE_ALT macro so that an operator=(ptr&) isn't inserted. {{{ #else // BY_VALUE BOOST_COPYABLE_AND_MOVABLE_ALT(ptr) public: // generalized copy/move constructor implemented by pass-by-value & steal template < class U > ptr( ptr b, typename boost::enable_if< boost::is_convertible<U*,T*> >::type* = 0 ) : p_( b.release() ) { ++ptr_s; std::cout << "Vp "; } // assignment - works for all types convertible to ptr ptr& operator=( ptr b ) { swap(*this,b); return *this; } #endif // BY_VALUE }}} Compared to the first version, this is really simple. I see no tricky parts here. The rest of ptr<> follows: {{{ ~ptr() { boost::checked_delete(p_); ++ptr_s; std::cout << "~p "; } T* get() const { return p_; } T* release() { T* r = p_; p_ = 0; return r; } friend void swap( ptr& a, ptr& b ) { boost::swap(a.p_,b.p_); std::cout << "sp "; } // reset, operator* and -> private: T* p_; }; }}} Writing the conversion constructors and assignment operators in the second version was much simpler. While version 1 contains 6 functions, version 2 contains only 2 functions. But is this always correct, and what is the cost of simplifying things? I tried to answer that question by writing the example (main.cpp). I started by preparing two diagnostic classes: {{{ struct A { static int a, c; A() { ++a; ++c; cout << "_A "; } A( A const& ) { ++a; ++c; cout << "cA "; } virtual ~A() { ++a; --c; cout << "~A "; } }; int A::a = 0; int A::c = 0; struct B : A { static int b, d; B() { ++b; ++d; cout << "_B "; } B( B const& x ) : A(x) { ++b; ++d; cout << "cB "; } ~B() { ++b; --d; cout << "~B "; } }; int B::b = 0; int B::d = 0; ptr<A> make_a() { return ptr<A>( new A ); } ptr make_b() { return ptr( new B ); } }}} Then some machinery for printing and zeroing the static variables incremented/decremented by corresponding constructors/destructors. {{{ void trace( char const* msg ) { cout << endl << boost::format("%34s P:%d A:%d B:%d eA:%d eB:%d") % msg % ptr_s % A::a % B::b % A::c % B::d << endl; ptr_s = 0; A::a = 0; B::b = 0; } #define TRACE( x ) x; trace( #x ); }}} And now main() itself, containing all use cases of ptr<> I could think of: {{{ int main() { { TRACE( ptr<A> z ) TRACE( ptr<A> a( new A ) ) TRACE( ptr b( new B ) ) TRACE( ptr<A> c( new B ) ) TRACE( ptr<A> d( a ) ) TRACE( ptr<A> e( b ) ) TRACE( ptr<A> f( boost::move(a) ) ) TRACE( ptr<A> g( boost::move(b) ) ) TRACE( ptr h( new B ) ) TRACE( ptr<A> i( boost::move(c) ) ) TRACE( ptr<A> j( i ) ) // slice TRACE( ptr<A> x( new A ) ) TRACE( x = f ) TRACE( x = h ) TRACE( x = boost::move(f) ) TRACE( x = boost::move(g) ) TRACE( x = boost::move(h) ) TRACE( x = i ) // slice } trace( "" ); { TRACE( ptr<A> a = make_a() ) TRACE( ptr<A> b = make_b() ) TRACE( ptr<A> c( make_b() ) ) TRACE( a = make_a() ) TRACE( b = make_b() ) } trace( "" ); } }}} And now for the costs. I compiled the attached code with MinGW-4.5.0 in 4 configurations: -std=c++0x disabled/enabled, and version 1/2. I compared the program output to derive the conclusions: C++03: version 1 vs. version 2: - whenever a conversion is needed (about half of the use cases above), version 2 introduces an additional temporary ptr<> object (without a deep copy); in one case it's 2 additional temporary ptr<>s; - the last 4 use cases {{{ ptr<A> b = make_b(); ptr<A> c( make_b() ); a = make_a(); b = make_b(); }}} introduce a deep copy in version 1, while while the deep copy is avoided in version 2. C++0x: version 1. vs. version 2: - whenever a conversion is needed (about half of the use cases above), version 2 introduces an additional temporary ptr<> object (without a deep copy); in one case it's 2 additional temporary ptr<>s; - no unnecessary deep copies are introduced in either version. Version 1: C++03 vs. C++0x: - the last 4 use cases {{{ ptr<A> b = make_b(); ptr<A> c( make_b() ); a = make_a(); b = make_b(); }}} introduce a deep copy in version C++03, while while the deep copy is avoided in C++0x. Version 2: C++03 vs. C++0x: - no difference. General conclusion: 'pass-by-value and swap' idiom is cool ;-) Pros: - better move emulation, - simple implementation. Cons: - additional temporary objects, that are then swapped to the right place. Thanks for staying with me ;-) Regards, Kris

3 6

[serialization - eceptions] Could not catch exceptions
by DaBoneCrack 24 Jul '12

24 Jul '12

Hi, i could not catch boost serialization exceptions. By default BOOST_NO_EXCEPTIONS is defined. All attempts to undefine it has no effect. What i try to do: <code> ... #include <boost/config.hpp> #ifdef BOOST_NO_EXCEPTIONS # undef BOOST_NO_EXCEPTIONS #endif ... more boost serialization headers included .... try { std::ifstream ifs("D:\\tmp.bin", std::ios::binary); boost::archive::binary_iarchive ia(ifs); int iIndex = 0; ia >> BOOST_SERIALIZATION_NVP("A", iIndex); ... } catch(std::exception) { ... } </code> Do i miss something to catch boost serialization exceptions? I am using vs2008. Thx for your help. -- View this message in context: http://boost.2283326.n4.nabble.com/serialization-eceptions-Could-not-catch-… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0