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

Using boost function with virtual methods
by przemyslaw.sliwa＠uk.bnpparibas.com 02 Jul '11

02 Jul '11

Hi, I have a simple inheritance: class A {}; class RegressionTestScenario; typedef A CurveGen; typedef boost::shared_ptr<CurveGen> CurveGenPtr; typedef boost::function<void (RegressionTestScenario*, const std::string &)> actionFuntion; typedef boost::shared_ptr<actionFuntion> actionFuntionPtr; class RegressionTestScenario { public: virtual ~RegressionTestScenario() {} virtual void doScenario() = 0; virtual boost::shared_ptr<std::string> fileName() const = 0; virtual boost::shared_ptr<std::string> print() const = 0; virtual void unwrapPackage(const std::string &contents) = 0; protected: typedef std::vector<std::pair<actionFuntionPtr, std::string> > actionCollection; actionCollection m_actionCollection; }; class CurveGenRegressionTestScenario : public RegressionTestScenario { public: virtual void doScenario(); virtual boost::shared_ptr<std::string> fileName() const; virtual boost::shared_ptr<std::string> print() const; virtual void unwrapPackage(const std::string &contents); private: CurveGenPtr m_curveGenPtr; void addAction(const std::string &action); void changeBaseDate(const std::string &argument); void changeStvParameter(const std::string &argument); void changeLtvParameter(const std::string &argument); void changeHalfLife(const std::string &argument); void changeParameterSet(const std::string &argument); void changeCurrencyCouple(const std::string &argument); }; and I am trying to use the following: actionFuntion funPtr; if(params[0]=="BaseDate") funPtr = &CurveGenRegressionTestScenario::changeBaseDate; but it fails. I have no idea why. Could someone give me a hint? This is the output from the compiler: Cheers 1>------ Build started: Project: compare, Configuration: Release Win32 ------ 1>Compiling... 1>RegressionTestMain.cpp 1>D:\Dev\SOHO_NEW\Thirdparty\boost/bind/mem_fn_template.hpp(156) : error C2440: 'newline' : cannot convert from 'RegressionTestScenario *' to 'CurveGenRegressionTestScenario *' 1> Cast from base to derived requires dynamic_cast or static_cast 1> D:\Dev\SOHO_NEW\Thirdparty\boost/bind/mem_fn_template.hpp(171) : see reference to function template instantiation 'R boost::_mfi::mf1<R,T,A1>::call<U,const std::string>(U &,const void *,B1 &) const' being compiled 1> with 1> [ 1> R=void, 1> T=CurveGenRegressionTestScenario, 1> A1=const std::string &, 1> U=RegressionTestScenario *, 1> B1=const std::string 1> ] 1> D:\Dev\SOHO_NEW\Thirdparty\boost/function/function_template.hpp(225) : see reference to function template instantiation 'R boost::_mfi::mf1<R,T,A1>::operator ()<T0>(U &,A1) const' being compiled 1> with 1> [ 1> R=void, 1> T=CurveGenRegressionTestScenario, 1> A1=const std::string &, 1> T0=RegressionTestScenario *, 1> U=RegressionTestScenario * 1> ] 1> D:\Dev\SOHO_NEW\Thirdparty\boost/function/function_template.hpp(222) : while compiling class template member function 'void boost::detail::function::function_void_mem_invoker2<MemberPtr,R,T0,T1>::invoke(boost::detail::function::function_buffer &,T0,T1)' 1> with 1> [ 1> MemberPtr=void (__thiscall CurveGenRegressionTestScenario::* )(const std::string &), 1> R=void, 1> T0=RegressionTestScenario *, 1> T1=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> & 1> ] 1> D:\Dev\SOHO_NEW\Thirdparty\boost/function/function_template.hpp(913) : see reference to class template instantiation 'boost::detail::function::function_void_mem_invoker2<MemberPtr,R,T0,T1>' being compiled 1> with 1> [ 1> MemberPtr=void (__thiscall CurveGenRegressionTestScenario::* )(const std::string &), 1> R=void, 1> T0=RegressionTestScenario *, 1> T1=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> & 1> ] 1> D:\Dev\SOHO_NEW\Thirdparty\boost/function/function_template.hpp(722) : see reference to function template instantiation 'void boost::function2<R,T0,T1>::assign_to<Functor>(Functor)' being compiled 1> with 1> [ 1> R=void, 1> T0=RegressionTestScenario *, 1> T1=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &, 1> Functor=void (__thiscall CurveGenRegressionTestScenario::* )(const std::string &) 1> ] 1> D:\Dev\SOHO_NEW\Thirdparty\boost/function/function_template.hpp(1065) : see reference to function template instantiation 'boost::function2<R,T0,T1>::function2<void(__thiscall CurveGenRegressionTestScenario::* )(const std::string &)>(Functor,int)' being compiled 1> with 1> [ 1> R=void, 1> T0=RegressionTestScenario *, 1> T1=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &, 1> Functor=void (__thiscall CurveGenRegressionTestScenario::* )(const std::string &) 1> ] 1> D:\Dev\SOHO_NEW\Thirdparty\boost/function/function_template.hpp(1105) : see reference to function template instantiation 'boost::function<Signature>::function<void(__thiscall CurveGenRegressionTestScenario::* )(const std::string &)>(Functor,int)' being compiled 1> with 1> [ 1> Signature=void (RegressionTestScenario *,const std::string &), 1> Functor=void (__thiscall CurveGenRegressionTestScenario::* )(const std::string &) 1> ] 1> .\RegressionTestMain.cpp(182) : see reference to function template instantiation 'boost::function<Signature> &boost::function<Signature>::operator =<void(__thiscall CurveGenRegressionTestScenario::* )(const std::string &)>(Functor)' being compiled 1> with 1> [ 1> Signature=void (RegressionTestScenario *,const std::string &), 1> Functor=void (__thiscall CurveGenRegressionTestScenario::* )(const std::string &) 1> ] 1>D:\Dev\SOHO_NEW\Thirdparty\boost/bind/mem_fn_template.hpp(156) : error C2647: '->*' : cannot dereference a 'void (__thiscall CurveGenRegressionTestScenario::* const )(A1)' on a 'RegressionTestScenario *' 1> with 1> [ 1> A1=const std::string & 1> ] 1>Build log was saved at "file://d:\Dev\OwnProgs\compare\compare\Release\BuildLog.htm" 1>compare - 2 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== ___________________________________________________________ This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorised copying, disclosure or distribution of the material in this e-mail is prohibited. Please refer to http://www.bnpparibas.co.uk/en/information/legal_information.asp?Code=ECAS-… for additional disclosures.

4 5

boost::serializable | Persisting a shared_ptr to XML archive
by doug livesey 02 Jul '11

02 Jul '11

Hi -- I'm trying to serialize an object in a boost::shared_ptr, here: https://github.com/biot023/cell_biots/blob/master/include/game.h#L30 My problem is that the object isn't getting persisted, only the shared_ptr (I think). The result of this save is this: https://gist.github.com/1061413 Can anyone advise me on what I'm doing wrong? I've included <boost/serialization/shared_ptr.hpp>, but I guess there's something else I need to be doing. Any & all help very gratefully received, Doug.

1 0

Re: [Boost-users] [review][assign] Formal review of Assign v2 ongoing
by er 02 Jul '11

02 Jul '11

This was posted to lib.boost.devel, but I meant to post it in boost.user as well: > About your other comments: > - operator| has a similar meaning in Boost.Range under adaptors. > - Feel free to suggest another prefix than 'do'. > - Dot is borrowed from Boost.Assign (1.0). Did you mean dot or %? The dot is a small price to pay for alternating between various ways to insert elements in a container, within one statement: put( cont )( x, y, z ).for_each( range1 )( a, b ).for_each( range2 ); The answer to "[Is it] just a quest to type less when using standard containers?" is yes, as illustrated just above, but it is quite a broad definition of standard containers. Version 2.0 provides macros to broaden it further (which was used to support Boost.MultiArray, for example). As for why such a library should exist, it depends on the degree to which you value the syntax above, which is very similar to Boost.Assign (1.0), in this case. You say "I ordinarily only initialize containers to literals when writing unit tests.". In this case, I think you are right that you can't beat C++0x initializer lists. But, you still may need to fill a container, as above. And also, consider the cases below: #include <vector> #include <queue> #include <string> #include <tuple> #include <boost/assign/v2/include/csv_deque_ext.hpp> int main() { typedef std::string s_; { typedef std::tuple<s_, int> t_; typedef std::vector<t_> v_; v_ v1 = { t_( "a", 1 ), t_( "b", 2 ), t_( "c", 3 ), t_( "d", 4 ), t_( "e", 5 ) }; using namespace boost::assign::v2; v_ v2 = converter( csv_deque<t_, 2>( "a", 1, "b", 2, "c", 3, "d", 4, "e", 5) ); } { typedef std::queue<int> q_; // Not aware that an initializer list works here using namespace boost::assign::v2; q_ q = converter( csv_deque<int, 1>( 1, 2, 3, 4, 5 ) ); } return 0; } > - Prefix _ is reserved for const objects (not sure the proper word for it) And I think this convention appears elsewhere in Boost, such as Boost.Parameter. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

4 10

Overloading boost::hash_value GCC
by André Santee 01 Jul '11

01 Jul '11

I'm having a hard time trying to compile my code here. What I'm doing is to overload the boost::hash_value function to use boost::unordered_map with a custom Vector2 class. My code: // Vector2 hash function namespace boost { inline std::size_t hash_value(Vector2 const& p) { std::size_t seed = 0; boost::hash_combine(seed, p.x); boost::hash_combine(seed, p.y); return seed; } } // namepace boost boost::unordered_map<Vector2, EntityList, boost::hash<Vector2> > buckets;[/code] It compiles and run fine on msvc 9.0 but gcc says the function does not exist (it looks like to me that it does exist!). error message: Compile++ thumb : Application <= BucketManager.cpp In file included from /boost/functional/hash/hash.hpp:510, from /boost/functional/hash.hpp:6, from /boost/unordered/unordered_map.hpp:17, from BucketManager.h:35, from BucketManager.cpp:24: /boost/functional/hash/extensions.hpp: In member function 'size_t boost::hash<T>::operator()(const T&) const [with T = math::Vector2]': /boost/unordered/detail/unique.hpp:183: instantiated from 'typename boost::unordered_detail::hash_unique_table<T>::value_type& boost::unordered_detail::hash_unique_table<T>::operator[](const typename T::key_type&) [with T = boost::unordered_detail::map<math::Vector2, boost::hash<math::Vector2>, std::equal_to<math::Vector2>, std::allocator<std::pair<const math::Vector2, std::list<RenderEntity*> > > >]' /boost/unordered/unordered_map.hpp:406: instantiated from 'T& boost::unordered_map<K, T, H, P, A>::operator[](const K&) [with K = math::Vector2, T = std::list<RenderEntity*>, H = boost::hash<math::Vector2>, P = std::equal_to<math::Vector2>, A = std::allocator<std::pair<const math::Vector2, std::list<RenderEntity*> > >]' BucketManager.cpp:128: instantiated from here /boost/functional/hash/extensions.hpp:176: error: no matching function for call to 'hash_value(const math::Vector2&)' /boost/functional/hash/hash.hpp:136: note: candidates are: size_t boost::hash_value(bool) /boost/functional/hash/hash.hpp:141: note: size_t boost::hash_value(char) /boost/functional/hash/hash.hpp:146: note: size_t boost::hash_value(unsigned char) /boost/functional/hash/hash.hpp:151: note: size_t boost::hash_value(signed char) /boost/functional/hash/hash.hpp:156: note: size_t boost::hash_value(short int) /boost/functional/hash/hash.hpp:161: note: size_t boost::hash_value(short unsigned int) /boost/functional/hash/hash.hpp:166: note: size_t boost::hash_value(int) /boost/functional/hash/hash.hpp:171: note: size_t boost::hash_value(unsigned int) /boost/functional/hash/hash.hpp:176: note: size_t boost::hash_value(long int) /boost/functional/hash/hash.hpp:181: note: size_t boost::hash_value(long unsigned int) /boost/functional/hash/hash.hpp:187: note: size_t boost::hash_value(wchar_t) /boost/functional/hash/hash.hpp:194: note: size_t boost::hash_value(boost::long_long_type) /boost/functional/hash/hash.hpp:199: note: size_t boost::hash_value(boost::ulong_long_type) /boost/functional/hash/hash.hpp:313: note: size_t boost::hash_value(float) /boost/functional/hash/hash.hpp:318: note: size_t boost::hash_value(double) /boost/functional/hash/hash.hpp:323: note: size_t boost::hash_value(long double) make: *** -- André Santee | Desenvolvedor de games andre.santee(a)jera.com.br | +55 67 8127-9528 [image: Facebook]<http://www.facebook.com/pages/Jera-Software-Agil/127079757331746> [image: Facebook] <http://twitter.com/decosantee> [image: Flickr]<http://www.flickr.com/jerasoftware> [image: LinkEdin] <http://www.linkedin.com/companies/jera?trk=fc_badge> <http://www.jera.com.br/>

2 1

problems on iterating over a fusion sequence
by Olaf Peter 01 Jul '11

01 Jul '11

Hi, in the example below, the loop runs forever. What is the reason for this? I'm using trunk 72818 Thanks, Olaf

2 1

Fwd: boost bind
by candy.chiu.ad＠gmail.com 01 Jul '11

01 Jul '11

> Hi, > A boost::bind statement in my code generated the following compilation > error: > 1>Compiling... > 1>CmsPayOffReplication.cpp > 1>.\CmsPayOffReplication.cpp(79) : error C2665: 'boost::bind' : none of > the 2 overloads could convert all the argument types > 1> C:\DiskE\OpenSource\boost_1_45_0\boost/bind/bind.hpp(1420): could > be 'boost::_bi::bind_t > boost::bindarg,QuantLib::Date,QuantLib::Period,QuantLib::Period,QuantLib::Rate>(boost::type,F,A1,A2,A3,A4,A5)' > 1> with > 1> [ > 1> R=double, > 1> F=QuantLibInterface::YieldCurveUtility *, > 1> > L=boost::_bi::list5arg,boost::_bi::valueQuantLib::Date>,boost::_bi::value,boost::_bi::value,boost::_bi::valueRate>>, > 1> T=QuantLibInterface::YieldCurveUtility, > 1> I=1, > 1> A1=boost::arg, > 1> A2=QuantLib::Date, > 1> A3=QuantLib::Period, > 1> A4=QuantLib::Period, > 1> A5=QuantLib::Rate > 1> ] > 1> C:\DiskE\OpenSource\boost_1_45_0\boost/bind/bind.hpp(1512): > or 'boost::_bi::bind_t > boost::bindarg,QuantLib::Date,QuantLib::Period,QuantLib::Period,QuantLib::Rate>(F,A1,A2,A3,A4,A5,A6)' > 1> with > 1> [ > 1> R=boost::_bi::unspecified, > 1> F=double, > 1> L=boost::_bi::list6bi::valueYieldCurveUtility > *>,boost::arg,boost::_bi::value,boost::_bi::value,boost::_bi::valuePeriod>,boost::_bi::valueQuantLib::Rate>>, > 1> T=QuantLibInterface::YieldCurveUtility, > 1> I=1, > 1> A1=QuantLibInterface::YieldCurveUtility *, > 1> A2=boost::arg, > 1> A3=QuantLib::Date, > 1> A4=QuantLib::Period, > 1> A5=QuantLib::Period, > 1> A6=QuantLib::Rate > 1> ] > 1> while trying to match the argument list '(overloaded-function, > QuantLibInterface::YieldCurveUtility *, boost::arg, const QuantLib::Date, > const QuantLib::Period, const QuantLib::Period, QuantLib::Rate)' > 1> with > 1> [ > 1> I=1 > 1> ] > I replicated the set up of the objects in simpler project, and the bind > statement compiled successfully. Can anyone shred some light on the cause > of the error? > Here is how I call boost::bind > QuantLib::Date date; > QuantLib::Period p1,p2; > QuantLib::Rate rate; > // initialization of date, p1, p2, rate > boost::functionYieldTermStructure>) > > priceWithCurve = boost::bind( > &YieldCurveUtility::priceSwap, > &YieldCurveUtility::instance(), _1, > date, period1, period2, rate ); > Thank you.

1 0

[Boost-log v1][Boost 1_46_1][MinGW 4.4.0][Windows 7] Finaly builded (partially) !!!
by Aman Feri 01 Jul '11

01 Jul '11

Hello I finally partially builded Boost_log v1 with Boost 1_46_1 using MinGW (gcc 4.4.0) on windows 7. It's a great victory for me, because it took a long time. I contribute here, if anyone need it or is able to make it work better. -------------- Error 1 -------------- Title : Compiling Boost_log v1 with Boost 1_46_1 including Filesystem v3 Symptom : error: 'external_string_type' is not a member of 'boost::filesystem3::wpath' Fix : using Filesystem_version 2 (thanks http://stackoverflow.com/questions/6076405/what-is-boost-log-how-to-get-it-… ) (don't forget to #define BOOST_FILESYSTEM_VERSION 2 in your projects using Boost_log) -------------- Error 2 -------------- Title : Using windows path Symptom : "windres.exe" + "C:\Program is not recognize as a valid command" (free translation) Fix : reinstalling MinGW, in a directory without space allowed bjam to find windres.exe -------------- Error 3 -------------- Title : (maybe a boost log v1 bug ?) Symptom : libs\log\src\event_log_backend.cpp:55: error: external linkage required for symbol 'boost::log_mt_nt5::sinks::event_log::success' because of 'dllexport' attribute Fix (seams to work, but confirmation still needed) : replace libs\log\src\event_log_backend.cpp line 55/56/57/58 from : BOOST_LOG_EXPORT const event_type_t ... to extern BOOST_LOG_EXPORT const event_type_t ... -------------- Error 4 -------------- Title : comeback of error 1 Symptom : Error 1 reproduce only on "release" build (but debug was build) Fix : no fix. Already spended 4 hours on this. I just use debug dll. Note : it implies i use debug dll for filesystem, system, thread and regex too (maybe implying i use both debug and release version in my final project) -------------- Error 5 -------------- Title : linking my project (the one that use boost log) with signle threaded instead of multi threaded Symptom : undefined reference to `boost::log_mt_nt5::basic_attribute_set<char>::~basic_attribute_set()' Fix : link your project using log v1 with libboost_log-mgw44-mt-d-1_46_1.dll not libboost_log-mgw44-d-1_46_1.dll (note the -d for "debug because i couldn't build the release cf error 4) Have a nice build !

1 0

Problem with dijkstra_shortest_paths
by Stephen Woodbridge 01 Jul '11

01 Jul '11

Hi all, I am C programmer floundering in a C++ world! I have the function that I call from C that builds a graph, runs dijkstra_shortest_paths(), then extracts the results and passes them back to a C array of structs. Code is in pastebin: http://pastebin.com/xi7vLpTx This seems to work and everything looks ok, EXCEPT the edge ids are not correct. I suspect this is because I'm not doing something correctly and I have been messing with this for a couple weeks without success, so I think its time to ask for help. So in the function: graph_add_edge(G &graph, int id, int source, int target, float8 cost) id is the edge id source is the node id at the start of the edge target is the node_id at the end of the edge cost is the cost to traverse the edge from source to target I would really appreciate it if someone could look at this and point out what I might be doing wrong. Thanks in advance, -Steve

3 11

Meta State Machine PseudoExit transitions
by Johan Gielens 01 Jul '11

01 Jul '11

Hello, I'm trying to implement a PseudoExitState in my boost meta state machine. This is the situation: http://i55.tinypic.com/2a83yar.png. Currently, when going from Transport to either Situation A or B, it throws an "no_transition" in the SubState for the "convertible event" needed by the PseudoExit state. (This is event6 in the example described below) According to the documentation (http://www.boost.org/doc/libs/1_46_1/libs/msm/doc/HTML/ch03s02.html#d0e930) and the corresponding example, there should be some kind of transition triggered by "event6" from SubState2 to Substate1 (see http://www.boost.org/doc/libs/1_46_1/libs/msm/doc/HTML/examples/DirectEntry…, in the transition table for SubFsm2). I don't see an arrow in the state diagram between SubState2 and SubState1, nor can I figure out why I would want such a transition. In my SubState's transition table, I have defined the transition from Transport to PseudoExit1 and 2: g_row< Transport , Sensor , Exit1 , &SubFront::SDownstreamCheck >, g_row< Transport , Sensor , Exit2 , &SubFront::SDownstreamNoCheck > and in the TopState from PseudoExit1 and 2 to SituationA and B: _row< Sub::exit_pt< SubFront::Exit1 > , TransportDone , SituationA >, _row< Sub::exit_pt< SubFront::Exit2 > , TransportDone , SituationB >, So do i have to handle an "TransportDone" event in the SubState? And what are my Start and End states? I would appreciate your help :) Best Regards, Johan

2 7

Re: [Boost-users] Boost-users Digest, Vol 2769, Issue 5
by Tom Tan 01 Jul '11

01 Jul '11

------------------------------ > > Date: Thu, 30 Jun 2011 15:00:13 -0400 (EDT) > From: Jeremiah Willcock <jewillco(a)osl.iu.edu> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [Graph]questions regarding > boost::graph::adjacency_list constructor prototype > > On Thu, 30 Jun 2011, Tan, Tom (Shanghai) wrote: > > > > > While studying boost.graph, I stumbled upon this constructor definition: > > > > ????template <class EdgeIterator> > > > > ??? adjacency_list(EdgeIterator first, EdgeIterator last, > > > > ????????????????????????? vertices_size_type n, > > > > ????????????????????????? edges_size_type = 0, > > > > ????????????????????????? const GraphProperty& p = GraphProperty()) > > > > ????? : Base(n, first, last), m_property(new graph_property_type(p)) > > > > { } > > > > I have 2 questions here: > > > > -????????? What does ?edges_size_type = 0,? means here?? Assigning a value to a TYPE, instead of a parameter? Can > > anyone please point me to an explanation of this grammar usage? > > It's like if the code was "edges_size_type x = 0", but since the parameter > is not used, removing the name avoids compiler warnings. Nice to know this trick. Never knew that the 'x' can be omitted in this case. > > > > > -????????? Why the necessary of edges_size_type = 0 parameter,? since there?s a range pair of ?EdgeIterator first, > > EdgeIterator last?? > > It is not necessary, since the value of that parameter is never used. It > is probably there match the interface of some other constructor, either in > adjacency_list or some other graph class. I guessed so but it's better to confirmed. Thanks for the help. -Tom

1 0

[Range] Select forward or reverse traversal at compile time?
by Alastair Rankine 01 Jul '11

01 Jul '11

Given a bidirectional range R, is it possible to select at compile time whether we want to iterate forwards or backwards? Below is a test app. At the commented line, I would like to transparently construct a forward or reverse range, ie either [begin(range), end(range)] or [rbegin(range), rend(range)] respectively, depending on the definition of the Reversed template parameter. Just to be clear, the desired output is: forward: abc reversed: abc I can make this work by using a functor class with partial specialisation to construct the iterator_range, using begin/end or rbegin/rend respectively. But it's a bit ugly and it would seem like something that boost range would provide anyway? (Note that boost::reverse() is NOT what I am after.) #include <boost/assign/list_of.hpp> #include <boost/range/algorithm/copy.hpp> #include <boost/range.hpp> #include <vector> #include <iostream> template <typename Reversed, typename Range> std::string Print(const Range& range) { typedef boost::iterator_range< typename boost::mpl::eval_if< Reversed, boost::range_reverse_iterator<const Range>, boost::range_iterator<const Range> >::type> IterRange; // want to convert it to a forward range here IterRange forwardRange(range); std::string result; boost::copy(forwardRange, std::back_inserter(result)); return result; } int main(int argc, char* argv[]) { using boost::assign::list_of; std::vector<char> a = list_of('a')('b')('c'); std::vector<char> b = list_of('c')('b')('a'); std::cout << "forward: " << Print<boost::mpl::false_>(a) << std::endl << "reversed: " << Print<boost::mpl::true_>(b) << std::endl; return 0; }

3 5

[Graph]questions regarding boost::graph::adjacency_list constructor prototype
by Tan, Tom (Shanghai) 30 Jun '11

30 Jun '11

While studying boost.graph, I stumbled upon this constructor definition: template <class EdgeIterator> adjacency_list(EdgeIterator first, EdgeIterator last, vertices_size_type n, edges_size_type = 0, const GraphProperty& p = GraphProperty()) : Base(n, first, last), m_property(new graph_property_type(p)) { } I have 2 questions here: - What does "edges_size_type = 0," means here? Assigning a value to a TYPE, instead of a parameter? Can anyone please point me to an explanation of this grammar usage? - Why the necessary of edges_size_type = 0 parameter, since there's a range pair of "EdgeIterator first, EdgeIterator last"? Does anyone have an answer? Thanks.

2 1

ptime input_facet error with %f flag at converting string to ptime (1.36, 1.44)
by Sören Freudiger 30 Jun '11

30 Jun '11

Hello I have problems with reading the time fraction at converting from string to ptime. Here is the regarding soruce code: |#include <iostream> #include <string> #include <boost/date_time.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <boost/date_time/gregorian/gregorian.hpp> #include <boost/date_time/posix_time/conversion.hpp> int main( int, char * ) { using namespace std; using namespace boost; using namespace boost::posix_time; using namespace boost::local_time; using namespace boost::gregorian; time_facet* output_facet= new time_facet(); time_input_facet* input_facet= new time_input_facet(); stringstream sstream; sstream.imbue(locale(locale::classic(), output_facet)); sstream.imbue(locale(sstream.getloc() , input_facet)); string format("%d/%m/%Y %H:%M:%S.%f"); //example works fine without %f!!! output_facet->format( format.c_str() ); input_facet->format( format.c_str() < /span>); ptime dt= microsec_clock().local_time(); sstream.str(""); sstream<< dt; cout<< sstream.str() << end l; string time_string= sstream.str(); ptime tgtDt( boost::date_time::not_a_date_time); sstream.str( time_string.c_str() ); sstream>> tgtDt; cout<< tgtDt<< endl; }| The program runs fine without the %f inside the format string. But with %f tgtDt is "not-a-date-time". I use boost 1.44 and the doc says %f shold work, because every input incompatible format flag is marked bei "!" in the documentation. Any ideas how to get the frac part out of a string?

1 0

Boost Atomic ?
by John M. Dlugosz 30 Jun '11

30 Jun '11

I was surprised to see that the Boost distribution doesn't have the "atomic" operations library. I expected it to be part of the Threading, modeled on the C++0x draft. I found <http://www.chaoticmind.net/~hcb/projects/boost.atomic/> via Google, from 2009. But N3225=10-0215 (is there a later Draft available ?) §29.2 shows lots of change bars, and the <atomic> header seems completely redone, it appears to make everything nicely templatated. I wonder if this is at all up-to-date, or why it's not already more officially part of Boost. Does anybody know? More to the point, I want to write some code that is portable across platforms, including emerging platforms like tablets which I expect will be more varied in their CPU architecture. I've been spoiled with writing x86-only for so many years! It makes sense to use the constructs that will be shipped with the compiler some day. So, where can I find that? —John

5 7

Question about fusion::map
by Frank Astier 29 Jun '11

29 Jun '11

Hi - I'm using fusion::map, and I've noticed that if I have: struct attr0 {}; typedef fusion::pair<attr0, double> Attr0; struct attr1 {}; typedef fusion::pair<attr1, double> Attr1; And then: typedef fusion::map<Attr0> ProfileType1; typedef fusion::map<Attr0, Attr1> ProfileType2; When I create N instances of ProfileType2, the process size at runtime is about twice the size of the same process creating N instances of ProfileType1. No big surprise, I guess, but if I *never* mention the type Attr1 in my code, is there a way to "remove" it at compile time from ProfileType2? I.e. I would want the compilation to remove the parts of the fusion::map that are guaranteed not to be used at runtime, so that I don't spend memory that I will never use. Is that possible? Thanks a lot! Frank fastier(a)yahoo.com

1 0

Re: [Boost-users] Using Boost::Bind
by David McCallum 29 Jun '11

29 Jun '11

I should clarify, this is what I want to achieve: boost::function<void (DBuffer&)> singleHandler; void addHandler(boost::function<void (DBuffer&)> newHandler) { singleHandler = newHandler; } The problem is that I don't know how to call boost::bind with a DBuffer parameter, where DBuffer is one of my own classes. > You will want to learn a bit more about Boost.Bind. You can bind your > pointer or variable at the bind call. Parameters at the time of bind are > copied by value. If you need a reference use the boost::ref wrapper. > Expanding your example: > void DClient::resolveHandler( const boost::system::error_code& error, > int value ); > ... > int special_number = 42; > > hostResolver->async_resolve( *nameQuery, > boost::bind(&DClient::resolveHandler, this, > boost::asio::placeholders::error, > special_number ) ); > > ------------------- > > In the above, when the handler is invoked it will pass the error value > (via the placeholder) and the value of special_number during the bind... > which is 42. If I understand you correctly, then in the following code: void DClient::resolveHandler(int param) { .... } boost::function<void (int)> functionPtr; int tempInt = 12; myHandler = boost::bind(&DClient::resolveHandler, this, tempInt); myHandler(67); The final line will call resolveHandler with a parameter of 12, rather than 67? Surely that can't be right?

3 4

Re: [Boost-users] [msm] EUML submachine without macro
by ray＠maya-studio.com 29 Jun '11

29 Jun '11

Christophe Henry wrote: > you're just a little too fast as I added the example in the 1.47 release. In > the meantime, the submachine example can be found there: > http://svn.boost.org/svn/boost/trunk/libs/msm/doc/HTML/examples/CompositeTu… Thank you for quick reply! Works like a charm. Kudos for your excellent library! Best Regards, Ray

3 4

Re: [Boost-users] Boost-users Digest, Vol 2767, Issue 2
by Marat Abrarov 29 Jun '11

29 Jun '11

> I am grateful for the link, Marat, although I can't do exactly what you are doing. We are constrained > as to what tools we can use with our embedded target's Linux. Oh, I missed this. > I've got to use the proper gcc, gmake, > and libs. It's going to be painful enough to get the target's boost libraries upgraded because some of > them will cause API breakages. Boost.Asio is header only library. I often upgrade Boost with most recent Boost.Asio version by overwriting files. Regards, Marat Abrarov.

2 1

BGL Traveling Salesman Approximation
by David Doria 29 Jun '11

29 Jun '11

Using the example here: http://www.boost.org/doc/libs/1_44_0/libs/graph/test/metric_tsp_approx.cpp I constructed this path: http://homepages.rpi.edu/~doriad/Upload/contour.png on these points: http://homepages.rpi.edu/~doriad/Upload/points.png Is this the best I can hope to do with this approximate algorithm? (There is "clearly" (to a human) a much shorter path without all of the overlapping edges on the lower part of the left side of the rectangle). The graph.txt file I used is here: http://homepages.rpi.edu/~doriad/Upload/graph.txt and the solution it gave was: 0 1 2 3 5 7 9 11 13 15 16 18 20 21 23 25 26 28 30 32 35 37 40 39 38 36 34 33 31 29 27 24 22 4 6 8 10 12 14 17 19 0 Is there anyway I can "fix" this solution? Thanks, David

2 1

filesystem3::rename error codes
by Andreas Haferburg 29 Jun '11

29 Jun '11

Greetings, I was wondering how to handle errors of filesystem3::rename(). I'd like to use the system::error_code& overload, but I can't seem to find out how to use it. The documentation at [1] points to POSIX rename(), so I'm guessing the error_code somehow corresponds to the POSIX rename() return value. I'm not a native speaker, but I find the documentation pretty vague here. The tutorial section [2] doesn't help either. For example if the target file doesn't exist, the error_code.value() is 3. But I'm not supposed to use the constant 3 in the code, am I? Are there any constants defined that correspond to these error code values? What's the proper way to do the following: TEST( BoostFilesystem3Test, testRenameFails ) { boost::system::error_code ec; boost::filesystem3::rename("c:/does/not/exist", "asdf", ec); ASSERT_EQ(3, ec.value()); } I'm going to use QFile for now, but only because their documentation is (slightly) better. I would like to use boost for as much as possible, so an explanation or pointers to better documentation would be much appreciated. Thank you. Best regards Andreas P.S. I accidentally sent this mail to the boost@ list before, sorry about that. [1] http://www.boost.org/doc/libs/1_46_1/libs/filesystem/v3/doc/reference.html#… [2] http://www.boost.org/doc/libs/1_46_1/libs/filesystem/v3/doc/tutorial.html#E…

1 0

Using Boost::Bind
by David McCallum 29 Jun '11

29 Jun '11

I'm having some difficulty passing parameters to boost::bind. The approach taken by ASIO is to pass a placeholder to bind, like so: hostResolver->async_resolve(*nameQuery, boost::bind(&DClient::resolveHandler, this, boost::asio::placeholders::error, boost::asio::placeholders::iterator)); This works fine if I want to use an error or iterator as a parameter. But what if I want to use a primitive variable, or a pointer to one of my classes? Do I need to make a placeholder for each type of parameter I want to use? I looked in ASIO's placeholders.hpp file, and I must confess I can't make sense of it at all! Any help here is appreciated.

3 3

threading/io service query
by Sean Farrow 28 Jun '11

28 Jun '11

Hi Fokes: I'm currently working on a piece of software that is using or going to use boost. There are two classes that use the boost threading components: The first MidiWidget allows the opening of midi input/output ports, I plan to associate two threads, one to receive data and one to output the data. The second is where the problem could occur, MidiSurface simulates a midi control surface, which processes midi messages. Given that there could be multiple surfaces in the program-determined by connections to the pc, and that each surface may need to process a different set of messages which are defined in an xml file, what do people consider is the best approach to firing up a thread when ever a surface is created. I'd ideally like each surfaces thread be able to examine the data contained within it's owning surface without copying the whole class. Is it better to have the thread function as a virtual function in the surface class or a separate function that takes the surface, or a reference to the surface as a parameter. Also I've got a thread safe queue, but was wondering whether there is now one included with boost-or tr1. I'm using boost 1.46.1 and visual studio 2010 sp1 with the latest windows sdk. Any help/thoughts appreciateds. Regards Sean.

1 0

BGL: Copying graphs and edge_descriptors confusion
by David Doria 28 Jun '11

28 Jun '11

I have a graph, 'inputGraph' with a bool in its bundled edge properties. If I copy that graph with: Graph g = inputGraph; there seems to be some odd behavior with the edge_descriptors. If you take a look at this example: http://programmingexamples.net/index.php?title=CPP/Boost/BGL/CopyAGraph I set one of the edges to visible=0 and then output all of the edge visibilities using the iterator from boost::edges(g) - this works properly, the edge that I set to visible=0 indeeds shows up as such. However, if I instead use the iterator from boost::edges(inputGraph) , all of the edges appear as visible! Shouldn't the edge_descriptors be identical since the graph g is an exact copy of inputGraph? Can anyone explain why the last two loops in that example do not produce the same output? Thanks, David

3 5

read_graphviz with a simple graph
by David Doria 28 Jun '11

28 Jun '11

If I have a graph with no vertex properties or edge properties: adjacency_list<vecS, vecS, undirectedS> can I read a .dot file into it with read_graphviz? I tried: dynamic_properties dp; Graph g; read_graphviz(fileinput, g, dp); but it throws an exception "Property not found: node_id". I tried to add property_map<Graph, vertex_name_t>::type name = get(vertex_name, g); dp.property("node_id",name); but I get a compiler error "No match for operator<<" Any suggestions? Thanks, David

2 14

Re: [Boost-users] boost::asio and C++0x
by Marat Abrarov 28 Jun '11

28 Jun '11

> It appears that gcc up to 4.5.2 did work; the bug was related to bleeding-edge gcc. > > I am still looking for solutions to this issue. I have successfully built my app with -std=c++0x and > boost::thread, but boost::asio gives me errors. At http://sourceforge.net/projects/asio-samples/ I use qmake to build projects under Linux. I build asio-samples with Boost 1.46.0 + Boost.Asio 1.5.3 + gcc 4.6.0. Feel free to watch at *.pro files describing qmake build dependencies at /build/qmake. Regards, Marat Abrarov.

2 1

boost::asio and C++0x
by Wilde, Donald S 28 Jun '11

28 Jun '11

Hi, All - I am having some challenges mixing boost and c++0x. My configuration: Ubuntu 10.04, gcc 4.4.3, boost 1.46.1 I've updated the libraries and headers from Ubuntu's stock boost 1.40 level, and I've tried bjam with and without 'toolset=gcc cxxflags=-std=c++0x' Either way, my Eclipse reports several errors in the external libraries: Undefined references to boost::system::generic_category() Undefined references to boost::system::system_category() (both from system and asio error headers) Undefined references to pthread_key_create and pthread_key_delete from asio/detail headers { apologies for not giving specific error details but it'd have to come from a screen shot and that's not appreciated on a mailing list } I do have access to gcc 4.5.1, but it's a custom one for our embedded Atom-based SoC. That is the eventual target, but I haven't seen how to use a specific g++ binary yet. I did see a bug tracker post in one of my google searches but I haven't been able to get back to it. I understand that this is a known issue and a moving target but I would appreciate it if someone would summarize the current state for me. Thanks in advance! -- Don Wilde

3 6

Multi_array and rotated views
by petros 28 Jun '11

28 Jun '11

Hi, I am coming back to the list with a question on multi_array views. Some time ago, I asked if I could have a view that would offer a “rotated” multi_array. That is, if I have a 3D MA (=multi_array) of dimensions (shape) {L,M,N}), I would like to obtain a reference to it which would look like {M,N,L} i.e. cyclically rotated (I would actually wish to be able to perform this rotation many times). The operation should be performed at compile time (no need/wish to do it at run time and pay the possible overhead in speed). A couple of friends suggested that I used a storage structure something like this (files are attached for convenience of inspection). namespace boost { class cyclic_storage_order { typedef detail::multi_array::size_type size_type; public: cyclic_storage_order( const std::size_t shift ) :shift_(shift) {} template <std::size_t NumDims> operator general_storage_order<NumDims>() const { boost::array<size_type,NumDims> ordering; boost::array<bool,NumDims> ascending; for (size_type i=0; i != NumDims; ++i) { ordering[i] = (i+shift_)%NumDims; ascending[i] = true; } return general_storage_order<NumDims>(ordering.begin(), ascending.begin()); } private: std::size_t shift_; }; } Now, I am trying to use this is the following example (again the file is attached): #define _SCL_SECURE_NO_WARNINGS #include <iostream> using std::cout; using std::endl; #include <boost/multi_array.hpp> using boost::multi_array; using boost::multi_array_ref; using boost::const_multi_array_ref; #include "MultiArrayRotation.h" int main(){ const unsigned short dimensionality = 3; typedef multi_array< int, dimensionality > IntArray; typedef IntArray::size_type size_type; typedef const_multi_array_ref< int, dimensionality > IntArrayCRef; boost::array<size_type,dimensionality> sizes = { { 2,3,4 } }; IntArray a( sizes ); boost::cyclic_storage_order cyclic_storage(1); boost::array<size_type,dimensionality> sizesRotated = { { 3, 4, 2 } }; IntArrayCRef rotated( a.data(), sizesRotated, cyclic_storage ); //initialize: for ( size_t i = 0 ; i != sizes[0]; ++i ) for ( size_t j = 0 ; j != sizes[1]; ++j ) for ( size_t k = 0 ; k != sizes[2]; ++k ) a[i][j][k] = (i+1) + 10 * (j+1) + 100*(k+1); typedef IntArray::const_iterator iterator3; typedef boost::subarray_gen<IntArray,2>::type::const_iterator iterator2; typedef boost::subarray_gen<IntArray,1>::type::const_iterator iterator1; for ( iterator3 it3 = a.begin(); it3 != a.end(); ++ it3 ) { cout << "in first iterator:"; boost::detail::multi_array::const_sub_array<int,2> & d2 = *it3; cout << (d2.shape())[0] << "x" << (d2.shape())[1] << endl; for ( iterator2 it2 = it3->begin(); it2 != it3->end(); ++ it2 ) { // cout << "\t" << it2->shape()[0] << endl; for ( iterator1 it1 = it2->begin(); it1 != it2->end(); ++ it1 ) cout << "\t\t" << (*it1) << endl; } } //for a rotated system: typedef IntArrayCRef::const_iterator iterator3CRef; typedef boost::subarray_gen<IntArrayCRef,2>::type::const_iterator iterator2CRef; typedef boost::subarray_gen<IntArrayCRef,1>::type::const_iterator iterator1CRef; cout << endl << "In Rotated System" << endl; for ( iterator3CRef it3 = rotated.begin(); it3 != rotated.end(); ++ it3 ) { cout << "in first iterator:"; //boost::const_multi_array_ref::const_sub_array<int,2> & d2 = *it3; cout << (it3->shape())[0] << "x" << (it3->shape())[1] << endl; for ( iterator2CRef it2 = it3->begin(); it2 != it3->end(); ++ it2 ) { // cout << "\t" << it2->shape()[0] << endl; for ( iterator1CRef it1 = it2->begin(); it1 != it2->end(); ++ it1 ) cout << "\t\t" << (*it1) << endl; } } return 1; } This gives me undesired results, though. What I have done here, is define a 2x3x4 main array with entries like abc (i.e. 3 digits). >From the value of abc I can infer the coordinates of the element in the main array. Following the cascade of iterators to sub_arrays, I see that, in the end, I obtain for each value of the first coordinate, the corresponding slices. Then I do a rotation (once) and descend down the iterators. I would expect now 3 slices (instead of 2, before), organized so that each one has the same middle digit (in the abc “representation”. This, however, is not happenning! I attach the code which I have built successfully w/msvc2010 on win7. I use boost1.45. A friend (Larry Evans) , who had offered a lot of help in the past and whom I contacted for suggestion let me know that, the program did not compile in his environment (gcc 4.6.0 and boost v1.46). Any suggestion, help will be greatly appreciated. Kind Regards, Petros

2 3

filesystem hidden files
by Kraus Philipp 28 Jun '11

28 Jun '11

Hello, I use the Boost Filesystem to browser the data within a directory. On unix systems there are file with a dot on begin, the hidden files. Is there a method for checking the path variable if the file is hidden) like path p("~/.myhiddenfile"); if (is_regular_file(p) && is_hidden(p)) I would like to exclude hidden files of my browsing list. Thanks Phil

1 0

making boost build generic library names (without -mgw45-mt-1_46_1)?
by Ákos Maróy 28 Jun '11

28 Jun '11

Hi, I wonder how can one make the boost build process create libraries with generic boost library names (like libboost_math_c99f.a) on Windows using mingw / gcc, as opposed to library names like libboost_math_c99f-mgw45-mt-1_46_1.a? Although I understand this makes sense in some contexts, a lot of times this is not convenient. For example, I'd have to update my dependencies every time I change the boost version, or the underlying gcc version changes. moreover, on other platforms (Linux, MacOS), the libraries built have the generic name (libboost_math_c99f.a) How to achieve the same effect on Windows? Akos

2 2

Does Boost use a platform-configurable [[ noreturn]] attribute ?
by John M. Dlugosz 27 Jun '11

27 Jun '11

Does the Boost 1.46 library have a macro or something that I can use to decorate a function as "noreturn" in a platform independent manner? Is there documentation on platform-independence tools that I might use in general, as Boost itself uses them? —John

1 0

Boost.Format to a string
by John M. Dlugosz 27 Jun '11

27 Jun '11

I brought this up a while back, and I ran into it again yesterday. Using boost::format to produce a string, as opposed to sending it directly to cout, is awkward. boost::format ("blah blah blah") % exp1 % exp2 %exp3 is fine in and of itself. But then what? You need to wrap the whole thing in extra parens to use str: std::string s= (boost::format ("blah blah blah") % exp1 % exp2 %exp3).str(); WHY NOT allow implicit conversion to string? Or, some other mechanism that doesn't complicate the expression and bury the interesting part? —John

2 2

[msm] how to write a generic class for all state machine back-end.
by Jerry Chen 27 Jun '11

27 Jun '11

In our project, we need a generic interface to refer to different state machine (back-end). For example, in the following codes, we want to use SMBase* to refer to any concrete state machine. SMBase should have similar interface as state machine. struct User { A(SMBase* s) : sm(s) (); SMBase* sm; ... // User can use sm->start(), sm->process_event() etc } struct SMBase { virtual void start() = 0; ... // how to design the rest ??? } // a wrapper implement SMBase template < typename SM > class SMWrapper : public SMBase{ SMWrapper(SM & s): sm(s){}; virtual void start() { sm.start(); } ... SM sm; } main() { typedef boost::msm::back::state_machine SM1; typedef boost::msm::back::state_machine SM2; User a1(new SMWrapper(SM1()) ); // Wrap the concrete state machine and pass it to User. User a2(new SMWrapper(SM2()) ); // Pass a different state machine. ... } The problem of designing SMBase is the function "process_event". We want it to to be virtual function so SMWrapper can implement it. But it also needs to be a template according to state machine interface. But we cannot have a virtual template function. How can we achieve/design this generic state machine interface? Many thanks. Jerry

4 4

Re: [Boost-users] [boost] [review][assign] Formal review of Assign v2 ends today
by Lars Viklund 27 Jun '11

27 Jun '11

On Fri, Jun 24, 2011 at 11:56:14PM +0100, John Bytheway wrote: > The formal review of the Assign v2 library upgrade by Erwann Rogard is > scheduled to end today. > > Despite the end of the review, please feel free to discuss the library > further, make any final comments, or even submit a late review. I will > certainly not declare the review request before next Monday, and will > incorporate any comments made before then. Hopefully this is not too late to be counted as a proper mini-review. The test suite for the library fails miserably on VisualAge C++ 11.1, as can be seen in the logs at [1], which doesn't bode well for a newly written library aimed for inclusion in Boost. The test suite fails similarly on SunStudio 12.1 on Solaris 10, with the results seen in [2]. As a comparison, the tests for assign_v1 passes with flying colours with VisualAge. Having the replacement library support way fewer platforms in Boost sounds very strange to me, and is alone grounds for not including the library. (I was not able to complete building the v1 tests on the Solaris box I had, as the linker seems slightly broken, something that doesn't affect the v2 tests, as none of them can compile.) The performance metrics seem to lack a very important metric - namely compile-time costs in memory usage and compile time increases. The documentation mentions compile-time costs briefly in lamenting that the test suite takes several minutes to build, which isn't horribly encouraging. A library that is intended to be easily dropped into any TU you might need it in should be very cheap to use. I currently avoid using Karma/Qi even for things where they would simplify things, solely due to the cost of including them. Regarding the code, I'm a bit concerned about the namespace layout. The current setup will cause any users of 1.0 that also happen to include 2.0 indirectly to end up with namespaces 'v2' and 'ref' injected wherever they previously did 'using namespace boost::assign;'. As for naming of the functions and types, I find them both opaque and overly generic. 'put()' has a strong risk of being used already in user code, and things like 'csv()' are utterly meaningless without having read the documentation, especially with regard to the non-type template argument. The use of asdf_aux namespaces seems a bit off, considering that the canonical naming for implementation detail is just that, 'detail'. This library feels misguided, trying to be something the name doesn't indicate it should be. I found assign_v1 to be an excellent library for quick and dirty initialization of sequences. The whole transformation pipeline that v2 introduces feels out of place and most probably belongs in a quite different library. The documentation even mentions Boost.Range's sequence adaptors - which makes me wonder if they're not better off integrated with Range? As for the tutorial, which is the closest thing to examples I find, they seem overly terse and seems to assume that the concepts used in the library are already known. My vote for this library is: NO. [1] http://www.acc.umu.se/~zao/assign_v2/vacpp-test-20110627-1014.txt [2] http://www.acc.umu.se/~zao/assign_v2/suncc-test-20110627-1044.txt -- Lars Viklund | zao(a)acc.umu.se

2 2

Re: [Boost-users] Directory Iterator / Directory "access denied" exception
by Tan, Tom (Shanghai) 27 Jun '11

27 Jun '11

I have filed a Ticket #5403 and applied a patch here some time ago: https://svn.boost.org/trac/boost/ticket/5403 Hope it works for you. -----Original Message----- Date: Fri, 24 Jun 2011 01:48:05 -0700 (PDT) From: Kiah08 <tonycaver2007(a)gmail.com> Subject: [Boost-users] Directory Iterator / Directory "access denied" exception Does anyone know of a way to handle exceptions when a directory is inaccessible? I would like to be able to resume the directory scan after the inaccessible directory. Please give an in depth example if possible. Using Boost 1.46.

1 0

GCC 4.6.0 rejects Boost Intrusive header
by Brian Wood 26 Jun '11

26 Jun '11

GCC 4.6.0 rejects the *Boost* intrusive header list.hpp. Here's the command line: g++ -std=c++0x -O2 -s -W -Wall -I /home/brian/boost_1_46_1 -c -o jaj.o jaj.cc and the output: In file included from jaj.cc:1:0: /home/brian/boost_1_46_1/*boost*/intrusive/list.hpp: In static member function =91static *boost*::intrusive::list_impl<Config>& *boost*::intrusive::list_impl<Config>::priv_container_from_end_iterator(const const_iterator&)=92: /home/brian/boost_1_46_1/*boost*/intrusive/list.hpp:1291:89: sorry, unimplemented: unexpected ast of kind field_decl /home/brian/boost_1_46_1/*boost*/intrusive/list.hpp:1291: confused by earlier errors, bailing out Preprocessed source stored into /tmp/ccRWz6ZT.out file, please attach this to your bugreport. The .cc file is one line -- an include of list.hpp. Here's the function that it is complaining about: private: static list_impl &priv_container_from_end_iterator(const const_iterator &end_iterator) { root_plus_size *r = detail::parent_from_member<root_plus_size, node> ( detail::boost_intrusive_get_pointer(end_iterator.pointed_node()), &root_plus_size::root_); data_t *d = detail::parent_from_member<data_t, root_plus_size> ( r, &data_t::root_plus_size_); list_impl *s = detail::parent_from_member<list_impl, data_t>(d, &list_impl::data_); return *s; } 1291 is the line that starts with "list_impl *s = " I'd like to be able to begin using GCC 4.6, but this is preventing me from doing so. Would someone with GCC 4.7 or 4.6.1 test this and report the results? TIA. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net <http://webebenezer.net/> Trust in the L-RD and lean not on your own understanding. In all your ways acknowledge Him and He will direct your paths. Proverbs 3:5,6

2 1

[Spirit] Problem while parsing a quoted string
by Sven Steckmann 25 Jun '11

25 Jun '11

Dear list, at the moment I am writing a grammar description in which I want to used quoted string. Up to now I hardcoded the quotes to '"', but now, I want to enable this rule working with a parameter. Maybe I am missing somethin, I hope one can give me good hint: This is the rule definition (for parsing QStrings, I took the code from the example): quotedQString %= lexeme[lit(_r1) >> +(char_ - lit(_r1)) >> lit(_r1)]; qi::rule quotedQString; I am uisng the quotedQString as follows: nextRule = quotedQString('"') [ anAction(_var,_1)]; This does not work as expected, if I parse a string looking like this "String" I always got the quotes included. My old version: quotedQString %= lexeme[lit('"') >> +(char_ - lit('"')) >> lit('"')]; works quite as expected and parses everything without quotes. Kind regards, Sven Steckmann --

1 0

[1.47.0] exception build problem
by Orhun Birsoy 25 Jun '11

25 Jun '11

When I build boost 1.47.0 beta 1 with the following command bjam --stagedir=vc10-x86-stage --layout=tagged toolset=msvc-10.0 variant=debug link=shared threading=multi runtime-link=shared address-model=32 --with-exception I get the following output. [snip] msvc.link.dll bin.v2\libs\exception\build\msvc-10.0\debug\address-model-32\threading-multi\boost_exception-mt-gd.dll msvc.manifest.dll bin.v2\libs\exception\build\msvc-10.0\debug\address-model-32\threading-multi\boost_exception-mt-gd.dll common.copy vc10-x86-stage\lib\boost_exception-mt-gd.dll bin.v2\libs\exception\build\msvc-10.0\debug\address-model-32\threading-multi\boost_exception-mt-gd.dll 1 file(s) copied. common.copy vc10-x86-stage\lib\boost_exception-mt-gd.lib The system cannot find the file specified. copy /b "bin.v2\libs\exception\build\msvc-10.0\debug\address-model-32\threading-multi\boost_exception-mt-gd.lib" + this-file-does-not-exist-A698EE7806899E69 "vc10-x86-stage\lib\boost_exception-mt-gd.lib" ...failed common.copy vc10-x86-stage\lib\boost_exception-mt-gd.lib... ...failed updating 1 target... ...updated 15 targets... It looks like boost_exception-mt-gd.dll doesn't export any symbols. -- Orhun Birsoy

1 0

[1.47.0] Beta 1 Release Notice
by Beman Dawes 25 Jun '11

25 Jun '11

Boost release 1.47.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/ New Libraries: Chrono, Geometry, Phoenix and Ratio. Updated Libraries: Accumulators, Asio, Config, DateTime, Dynamic Bitset, Foreach, Function, Function Types, Graph, Iterator, Lexical Cast, Logic, Math, Meta State Machine, MultiIndex, Proto, Spirit, Tokenizer, Utility, Wave For details of what's in the release, see http://beta.boost.org/users/news/version_1_47_0. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. There have been reports of build issues with MinGW/CGG and 64-bit Windows/VC++. These are being investigated and hopefully should be cleared up before the final release Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

4 4

Re: [Boost-users] Assign V2 - first impression
by er 24 Jun '11

24 Jun '11

Copied from devel: On 6/24/11 1:30 PM, er wrote: > On 6/24/11 9:08 AM, Stewart, Robert wrote: >> er wrote: >>> >>>> I am sure that it is a powerful library, but I really have no >>>> idea at all what is going on. I can't even parse the first >>>> line as valid C++ in any way. You need better examples, and >>>> also is that really the best way you could find to express >>>> repeating? >>> >>> If I try to imagine what the interface would look like after >>> taking into account some of the suggestions that were made, this >>> sentence: >>> >>> "Create data elements by mapping 1, 10, 100, 1000 by function >>> f, and insert each result in cont by invoking modifier >>> push_front." >> >> If I interpret that correctly, it would be clearer as: >> >> "Create elements in cont, using push_front(), by calling f() 1, 10, >> 100, and 1000 times." >> > > Apologies, I misread this. It should be : > > Map 1, 10, 100, and 1000 by function f, > which yields f( 1 ), f( 10 ), f( 100 ), f( 1000 ) > and insert each, n times, using push_front, in cont. > > T x; > > x = f( 1 ); > for(int i = 0; i < n; i++){ > cont.push_front( x ); > } > > x = f( 10 ); > for(int i = 0; i < n; i++){ > cont.push_front( x ); > } > > etc. > > The meaning of what is said next, I think, is not altered. >

1 0

[Review] The 'Type Traits Introspection' library Review starst next friday, july 1st
by Joel falcou 24 Jun '11

24 Jun '11

According to the schedule, review for the Type Traits Introspection library by Edward Diener will run from friday, July 1st to monday, july 10 2011. =========== What is it? =========== The TTI library, which is an abbreviation for the 'Type Traits Introspection' library, allows a programmer to introspect at compile time the inner elements of a C++ type. The introspection process depends on specifying the name of the inner element by different macros for different types of elements, and then using a generated metafunction to determine whether that element exists within the enclosing type. The inner elements which can be introspected are type, class template, member data, member function, static member data, and static member function. The TTI library is based on the type_traits_ext portion of the Concept Traits Library, with improvements and additions, and also reproduces functionality ( without changing existing code ), for the purposes of completeness, from Boost.MPL regarding introspection of types and templates. The purpose of the library is to provide a consistent set of interfaces for doing compile-time introspection of a type, which other template metaprogrammers can use in their code. If you are at all interested in compile-time introspection of types, please take a look at the functionality of this library. =================== Getting the library =================== The library is available at http://svn.boost.org/svn/boost/sandbox/tti/ Note that this repository will be updated up to next thursday by Edward. =================== Writing a Review =================== The reviews and all comments should be submitted to the developers list, and the email should have "[TTI] Review" at the beginning of the subject line to make sure it's not missed. Please explicitly state in your review whether the library should be accepted. The general review checklist: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? And finally, every review should answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion.

1 0

[Regex] Emulate awk
by Alessandro Candini 24 Jun '11

24 Jun '11

I have a string like the following: string myStr = "Monthly Ecosystem NPP = 0.360591 tDM/ha month"; How can I use boost regex to isolate 0.360591, as I would do in bash with a echo $myStr | awk '{ print $5 }' ? Thanks in advance. -- Alessandro Candini MEEO S.r.l. Via Saragat 9 I-44122 Ferrara, Italy Tel: +39 0532 1861501 Fax: +39 0532 1861637 http://www.meeo.it ======================================== "ATTENZIONE:le informazioni contenute in questo messaggio sono da considerarsi confidenziali ed il loro utilizzo è riservato unicamente al destinatario sopra indicato. Chi dovesse ricevere questo messaggio per errore è tenuto ad informare il mittente ed a rimuoverlo definitivamente da ogni supporto elettronico o cartaceo." "WARNING:This message contains confidential and/or proprietary information which may be subject to privilege or immunity and which is intended for use of its addressee only. Should you receive this message in error, you are kindly requested to inform the sender and to definitively remove it from any paper or electronic format."

2 1

Re: [Boost-users] [review][assign] Formal review of Assign v2 ongoing
by er 24 Jun '11

24 Jun '11

Copy from devel: > I am sure that it is a powerful library, but I really have no idea at all what is going on. I can't even parse the first line as valid C++ in any way. You need better examples, and also is that really the best way you could find to express repeating? If I try to imagine what the interface would look like after taking into account some of the suggestions that were made, this sentence: "Create data elements by mapping 1, 10, 100, 1000 by function f, and insert each result in cont by invoking modifier push_front." translates to ( push_front<1>( cont ) % ( _data = f ) % ( _repeat = n ) )( 1, 10, 100, 1000 ); Questions : - is it more readable, now? - What if each example was preceded by its English equivalent. Is this a bit of stretch or a reasonable approach? Thanks.

1 0

[Asio] Crash on service delete
by Indrek Sünter 24 Jun '11

24 Jun '11

Hi. I'm experiencing a crash when io_service destructor is called. The service was run on a separate thread and a socket was associated with it. The destruction sequence (on main thread, where the service was constructed) was as follows: // m_socket was associated with m_service m_socket->cancel(); m_socket->shutdown( boost::asio::ip::tcp::socket::shutdown_both, ec ); m_socket->close( ec ); delete m_socket; m_socket = NULL; // Delete work on the service delete m_work; m_work = NULL; // Stop the service m_service->stop(); // Join the thread this service was running on m_thread->interrupt(); m_thread->join(); delete m_thread; m_thread = NULL; // Crashes here delete m_service; m_service = NULL; Here's what VC10 reported: Access violation camc.exe!boost::asio::detail::socket_ops::send(unsigned int s, const _WSABUF * bufs, unsigned int count, int flags, boost::system::error_code & ec) Line 876 + 0x24 bytes C++ camc.exe!boost::asio::detail::socket_select_interrupter::interrupt() Line 127 + 0x18 bytes C++ camc.exe!boost::asio::detail::select_reactor::shutdown_service() Line 73 C++ camc.exe!boost::asio::detail::service_registry::~service_registry() Line 42 + 0xf bytes C++ camc.exe!boost::asio::detail::service_registry::`scalar deleting destructor'() + 0x16 bytes C++ camc.exe!boost::asio::io_service::~io_service() Line 51 + 0x1f bytes C++ camc.exe!boost::asio::io_service::`scalar deleting destructor'() + 0x16 bytes C++ Code crashes on Windows 7 (64bit, boost 1.46.1) and works on Ubuntu 11.04 (64bit, boost 1.42.0). Any ideas on what I'm missing? Thanks

1 0

Directory Iterator / Directory "access denied" exception
by Kiah08 24 Jun '11

24 Jun '11

Does anyone know of a way to handle exceptions when a directory is inaccessible? I would like to be able to resume the directory scan after the inaccessible directory. Please give an in depth example if possible. Using Boost 1.46. -- View this message in context: http://boost.2283326.n4.nabble.com/Directory-Iterator-Directory-access-deni… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Graph Isomorphism
by Evan Driscoll 24 Jun '11

24 Jun '11

I am writing a library for a variant of finite automata. States in the automata are named by "keys", which boil down to unsigned ints. For testing purposes, I'd like to be able to test whether two automata are isomorphic -- i.e. they are the same except for perhaps different keys for the corresponding states. (The motivation for this is that there are a few operations like 'determinize' that I don't want to guarantee any particular names for the output states, but I want or need to test something stronger than language equality between the actual and respected result.) One way I've thought of doing this is to convert the transition graph of each automaton to a BGL graph and use it's 'isomorphism' function to determine whether the two are isomorphic. However, I'd need to impose two extra conditions: - Edges between nodes are labeled (with the symbol that makes the automaton take that transition), and I need to make sure these match between the two graphs - Nodes are labeled (with whether they correspond to an initial and accepting state of the automaton), and I need to make sure these match up between the two graphs Does it sound like this task is something the BGL is suited for? Thanks, Evan Driscoll

3 10

compile error with boost trunk and clang trunk
by Dane Springmeyer 23 Jun '11

23 Jun '11

Anyone else running latest clang and boost and running into compile errors? I'm hitting a problem with __is_pod in type traits. More details here: https://svn.boost.org/trac/boost/ticket/5635 Let me know if there is anything else I can test to make sure its not something special about my setup. Dane

1 0

[boost 1.42, gcc 4.4, ubuntu 10.10] Program hangs when using barrier.wait() even though all threads have reached wait.
by Gareth 23 Jun '11

23 Jun '11

I'm having problems with boost::barrier. I've written a class that creates a thread pool to map evaluate an array of functions to an array of results. I've used barriers in the synchronisation. The problem is that the threads are all getting stuck at the barrier::wait calls. I've verified with gdb that all the worker threads and the manager thread are sitting in barrier::wait() however, there all stuck. I have no idea what's causing this. I've put the source code in the following github gist and also pasted it to the end of the email. https://gist.github.com/1041351 I've also checked the bugs list for any known bugs, fixed or otherwise, to do with threading and I haven't found anything. I'm not sure what I'm doing wrong. -Gareth Charnock /* compile: g++ thread_template.cpp -lboost_thread Outputs: BOOST_VERSION = 104200 Starting thread 0 Starting thread 1 Thread 0 waiting for work Thread 1 waiting for work Threads have work... */ #include <boost/version.hpp> #include <boost/thread.hpp> #include <boost/thread/barrier.hpp> #include <boost/function.hpp> #include <iostream> #include <vector> template<typename T> class Multithreader { public: Multithreader() : numCPU(sysconf(_SC_NPROCESSORS_ONLN)), _barrier(numCPU+1), mFuncs(NULL), mMapTo(NULL) { std::cout << "BOOST_VERSION = " << BOOST_VERSION << std::endl; //Start the thread pool for(long i = 0;i<numCPU;i++) { std::cout << "Starting thread "<<i<< std::endl; boost::thread(WorkerThread(i,this)); } } ~Multithreader() { //Terminate the threads //todo } void map(const std::vector<boost::function<T ()> >& funcs,std::vector<T>& mapTo) { mFuncs = &funcs; mMapTo = &mapTo; std::cout << "Threads have work..." << std::endl; _barrier.wait(); //Workers are working at this point std::cout << "Threads are working..." << std::endl; _barrier.wait(); std::cout << "Threads have finished" << std::endl; } private: const std::vector<boost::function<T ()> >* mFuncs; std::vector<T>* mMapTo; boost::barrier _barrier; size_t numCPU; class WorkerThread { public: WorkerThread(long _id,Multithreader* _parent) : id(_id),parent(_parent) { } void operator()() { while(true) { std::cout << "Thread "<<id<<" waiting for work" << std::endl; parent->_barrier.wait(); std::cout << "Thread "<<id<<" has work" << std::endl; //Do work for(long i = id;i<parent->mFuncs->size();i+=parent->numCPU) { parent->mMapTo->at(i) = parent->mFuncs->at(i)(); } parent->_barrier.wait(); std::cout << "Thread "<<id<<" finished the work" << std::endl; } } long id; Multithreader* parent; }; }; #include <boost/bind.hpp> double f(double x) { return x*2; } int main() { //Start the thread pool Multithreader<double> mt; std::vector<boost::function<double()> > work;work.resize(20); std::vector<double> results;results.resize(20); //Prepare the work for(unsigned long i = 0;i<20;i++) { work[i] = boost::bind(f,i); } //Execute in parallel mt.map(work,results); while(true) { //For the purposes of the example, keep the main thread alive //so we don't delete mt } }

2 3

Ensuring same locale for reading/writing
by Szymon Gatner 23 Jun '11

23 Jun '11

Hi, My original question comes from Random library but I guess it is not strictly Random-related. I would like to save a state of pseudo-random number generator and then restore it on different machine with potentially different locale. Random docs say tho: "The state shall be written in a platform-independent manner, but it is assumed that the locales used for writing and reading be the same." How do I assure same locale on all machines / platforms? Or more directly: how do I assure portable save/restore. -- Szymon Gatner The Lordz Games Studio www.thelordzgamesstudio.com

2 2

[multi-index] using std::distance() with ordered indices
by dv 23 Jun '11

23 Jun '11

Hello, I need to find out the size of a range defined by two ordered_non_unique iterators . Right now I just use std::distance() for this, however, the time complexity in this case is O(n). Is there some special way for calculating distances between multi-index container iterators? regards

2 1

BGL: Get a bundled property for a particular edge_descriptor
by David Doria 22 Jun '11

22 Jun '11

Consider this setup: struct MyProperty { int MyIntProperty; }; typedef adjacency_list<vecS, vecS, undirectedS, MyProperty, MyProperty> Graph; Graph g; Graph::vertex_descriptor v0 = add_vertex(g); Graph::vertex_descriptor v1 = add_vertex(g); Graph::vertex_descriptor v2 = add_vertex(g); std::pair<Graph::edge_descriptor, bool> e01 = add_edge(v0, v1, g); Now I want to get the bundled propery corresponding to e01. I tried this: property_map<Graph, int MyProperty::*>::type MyIntPropertyMap = get(&MyProperty::MyIntProperty, g); cout << MyIntPropertyMap[e01.first]; but the compiler complains about no matching operator[]. Any suggestions? I thought I had examples of all of these simple things, but I guess I'm missing at least one :) David

2 1

bjam install location
by David Doria 22 Jun '11

22 Jun '11

I ran this: ~/src/boost$ ./bootstrap.sh ~/src/boost$ ./bjam --prefix=/home/ddoria/bin The output was: The Boost C++ Libraries were successfully built! The following directory should be added to compiler include paths: /home/ddoria/src/boost The following directory should be added to linker library paths: /home/ddoria/src/boost/stage/lib I would have expected these to be more like /home/ddoria/bin/bin and /home/ddoria/bin/lib - am I misunderstanding the install process? Thanks, David

2 2

how to build boost using mingw on windows?
by Ákos Maróy 22 Jun '11

22 Jun '11

Hi, This might be a frequent question asked, but I can't seem to find a proper response. I'm trying to build boost using the current version of mingw, from under msys, but I can't seem to make it work. I tried boost 1.45.0 and 1.46.1 as well. here are my results: boost 1.45.0: akos@RAKKU /c/Users/akos/src/boost_1_45_0 $ ./bootstrap.sh --with-toolset=mingw --prefix=/c/Users/akos/usr Building Boost.Jam with toolset mingw... tools/build/v2/engine/src/bin.ntx86/bjam Unicode/ICU support for Boost.Regex?... not found. Backing up existing Boost.Build configuration in project-config.jam.3 Generating Boost.Build configuration in project-config.jam... Bootstrapping is done. To build, run: ./bjam To adjust configuration, edit 'project-config.jam'. Further information: - Command line help: ./bjam --help - Getting started guide: http://www.boost.org/more/getting_started/unix-variants.html - Boost.Build documentation: http://www.boost.org/boost-build2/doc/html/index.html akos@RAKKU /c/Users/akos/src/boost_1_45_0 $ ./bjam mingw.jam: No such file or directory c:/Users/akos/src/boost_1_45_0/tools/build/v2/build\toolset.jam:38: in toolset.u sing rule mingw.init unknown in module toolset. c:/Users/akos/src/boost_1_45_0/tools/build/v2/build\project.jam:881: in using project-config.jam:12: in modules.load c:/Users/akos/src/boost_1_45_0/tools/build/v2\build-system.jam:257: in load-conf ig c:/Users/akos/src/boost_1_45_0/tools/build/v2\build-system.jam:423: in load-conf iguration-files c:/Users/akos/src/boost_1_45_0/tools/build/v2\build-system.jam:554: in load c:\Users\akos\src\boost_1_45_0\tools\build\v2/kernel\modules.jam:283: in import c:\Users\akos\src\boost_1_45_0\tools\build\v2\kernel\bootstrap.jam:142: in boost -build c:\Users\akos\src\boost_1_45_0\boost-build.jam:17: in module scope when trying boos 1.46.1: akos@RAKKU /c/Users/akos/src/boost_1_46_1 $ ./bootstrap.sh --with-toolset=mingw --prefix=/c/Users/akos/usr Building Boost.Jam with toolset mingw... tools/build/v2/engine/src/bin.ntx86/bja m Unicode/ICU support for Boost.Regex?... not found. Generating Boost.Build configuration in project-config.jam... Bootstrapping is done. To build, run: ./bjam To adjust configuration, edit 'project-config.jam'. Further information: - Command line help: ./bjam --help - Getting started guide: http://www.boost.org/more/getting_started/unix-variants.html - Boost.Build documentation: http://www.boost.org/boost-build2/doc/html/index.html akos@RAKKU /c/Users/akos/src/boost_1_46_1 $ ./bjam mingw.jam: No such file or directory c:/Users/akos/src/boost_1_46_1/tools/build/v2/build\toolset.jam:38: in toolset.u sing rule mingw.init unknown in module toolset. c:/Users/akos/src/boost_1_46_1/tools/build/v2/build\project.jam:886: in using project-config.jam:12: in modules.load c:/Users/akos/src/boost_1_46_1/tools/build/v2\build-system.jam:257: in load-conf ig c:/Users/akos/src/boost_1_46_1/tools/build/v2\build-system.jam:423: in load-conf iguration-files c:/Users/akos/src/boost_1_46_1/tools/build/v2\build-system.jam:554: in load c:\Users\akos\src\boost_1_46_1\tools\build\v2/kernel\modules.jam:283: in import c:\Users\akos\src\boost_1_46_1\tools\build\v2\kernel\bootstrap.jam:142: in boost -build c:\Users\akos\src\boost_1_46_1\boost-build.jam:17: in module scope trying other settings, e.g. a toolset of gcc will not work :( trying the bootstrap.bat file with the same command line parameters don't work, as they expect to find the MS C++ compiler, cl. I googled this issue, but did not find a solution that would eventually work :( I wonder what the proper process is to build boost on Windows using the current version of MingW. Akos PS: the gcc version I have is: $ gcc --version gcc.exe (GCC) 4.5.2 Copyright (C) 2010 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.

2 4

boost 1.45.0 regression tests.
by Jason Nye 22 Jun '11

22 Jun '11

Hello All, Platform/toolset information: Windows, MSVC9.0, primarily 64-bit but we do have 32-bit, _SECURE_SCL=0 My company is using boost 1.45.0 and we build boost ourselves. We have a policy that for any off-the-shelf software we build from source, we run the unit tests for that package to verify a basic level of usability. When running the tests for all libraries (by using a script to CD into their respective 'test' directories and running bjam), most pass but I do get a few failures. The bjam command line I'm using for each is: bjam.exe --build-dir=%BOOST_ROOT%\..\build_x64_tests --user-config=%BOOST_ROOT%\user-config.jam link=shared address-model=64 cxxflags=/D_SECURE_SCL=0 The user-config.jam simply forces the use of the msvc90 toolset. -------------------------------------------------------------------------------------- The results: Lexical Cast ============ ... lexical_cast_loopback_test.cpp(74): error in "test_round_conversion_double": check magic_msvc == lexical_cast<T>(magic_msvc_s) failed lexical_cast_loopback_test.cpp(74): error in "test_round_conversion_long_double": check magic_msvc == lexical_cast<T>(magic_msvc_s) failed tr1.random ========== ... unknown location(0): fatal error in "test_main_caller( argc, argv )": This application has requested the Runtime to terminate it in an unusual way. Please contact the application's support team for more information. run_random.cpp(48): last checkpoint C:\Program Files (x86)\Microsoft Visual Studio 9.0\VC\INCLUDE\../include/random(850): invalid argument for subtract_with_carry[_01]::seed *** 1 failure detected in test suite "Test Program" -------------------------------------------------------------------------------------- Does anyone know what might be the cause of these failures? Maybe I'm running the tests incorrectly? Keep in mind that we absolutely need certain compiler flags - running bjam by itself will choose the wrong compiler, address model and _SECURE_SCL flags. Any help would be greatly appreciated. Regards, Jason ______________________________________________________________________________________________ [cid:image002.png@01CC3001.C8AE2BE0] Jason Nye | Principal Software Engineer 5850 Opus Parkway, Suite 300 l Minnetonka, MN 55343 952.487.9693 l 866.433.4624 l www.vitalimages.com<http://www.vitalimages.com/> A Toshiba Medical Systems Group Company ______________________________________________________________________________________________

2 1

bjam how to access python version, when installing
by Avi Bahra 22 Jun '11

22 Jun '11

In my site-config.jam file I have: using python : 2.5 # version : # cmd-or-prefix : # includes : # libraries : # condition ; I want to install my boost python extension, into site-packages. How can i access the python version defined in "using python" ? There does not seem to be any reference to this in the doc's so i'm not sure how common a request this is, or if there are better alternatives. Any help appreciated. Best regards, Ta, Avi

1 0

[iostreams] Why can't I use 'stream<file>' to write to a file?
by Wim van der Meer 22 Jun '11

22 Jun '11

Hi, I have started to use the Boost iostreams library in one of my projects. I am using the latest Boost version, 1.46.1 with a 64-bit Linux OS on a x86-64 architecture. When I compile and run the small program below, "HeavyArtillery2.txt" is created, but "HeavyArtillery1.txt" is not, and I don't understand why. Am I missing something obvious? #include <boost/iostreams/stream.hpp> #include <boost/iostreams/device/file.hpp> namespace io = boost::iostreams; int main(int argc, char *argv[]) { io::stream<io::file> out1; out1.open("HeavyArtillery1.txt"); out1 << "Reach at that Arrogance which needs thy harm,\n" "And beat it down before its sins grow worse.\n"; out1.close(); io::stream<io::file_sink> out2; out2.open("HeavyArtillery2.txt"); out2 << "Reach at that Arrogance which needs thy harm,\n" "And beat it down before its sins grow worse.\n"; out2.close(); } -- Wim van der Meer

1 0

Boost Filesystem iterator no_push
by Kiah08 22 Jun '11

22 Jun '11

I am using recursive directory iterator. When I list files and directories, my program terminates on "System Volume Information" on Windows machines. The system folder is inaccessible. I believe I need to implement the no_push() modifier. Could someone explain how to add that to this block of code? --------------------------- void initial_path( const path & directory, bool recurse_into_subdirs = true ) { if(exists(directory)) {directory_iterator end; for(directory_iterator iter(directory) ; iter != end; ++iter) if (is_directory( *iter )) {cout << iter->path() << " (directory)\n"; if( recurse_into_subdirs ) initial_path(*iter); } --------------------------- -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Filesystem-iterator-no-push-tp3615… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

BGL: Write graphviz file with invisible edges
by David Doria 22 Jun '11

22 Jun '11

I found out that if you write a graph (.dot) file like this: graph G { 0; 1; 2; 0--1; 1--2 [style=invis]; } graphviz will layout the graph as if it has two edges (0--1, and 1--2), but not display the edge between vertices 1 and 2. This is useful when trying to keep the vertices stationary and show changes to the connectivity. How would I setup the graph in BGL so I could mark particular edges so they will be written with [style=invis]? Thanks, David

2 7

Installing boost.mpi on Cray system
by khaled hamidouche 21 Jun '11

21 Jun '11

Hello I'm trying to install boost and its MPI bindings on a Cray XE6 and this is what I get after adding using mpi ; to user-config.jam: MPI auto-detection failed: unknown wrapper compiler<http://omgili.com/mailinglist/boost-users/lists/boost/org/4BC2BA3E2040204he…> /opt/cray/xt-asyncpe/4.9/bin/CC or MPI auto-detection failed: unknown wrapper compiler mpic++ (mpic++ -bash: mpic++: command not found) If I understand correctly boost only checks for mpicc and related executables and also tries mpirun. None of these are supposed to be used on an XE6 The compiler commands to use are cc, CC and ftn. More information for I think the same machine: https://www.nersc.gov/users/getting-started/<http://www.csc.fi/english/pages/louhi_guide/program_development/compilers/i…> these compiler cc, CC and ftn are using directly to compile an MPI program (don't use mpiCC to compile) Actually CC is using the GNU compiler module switch PrgEnv-pgi PrgEnv-gnu CC --version /opt/cray/xt-asyncpe/4.9/bin/CC: INFO: Compiling with XTPE_COMPILE_TARGET=native. g++ (GCC) 4.5.2 20101216 (Cray Inc.) I need to build boost mpi with this compiler (CC). How can I make bjam do that?? Thank you K.H

3 2

mpl pow10 sequence
by Olaf Peter 21 Jun '11

21 Jun '11

Hi, my first steps in mpl :>) I try to build a sequence/vector of pow10 sequence of integers and access them by index at runtime. See the last line of a concept usage. The range of exponents are in range [0..7] so the mpl::vector7 would be appropriate. Anyway, I don't get a compile able version using mpl's next, fold etc. How can I get this? Thanks, Olaf

2 2

How to bjam program_options correctly for VC++ 9 (Visual Studio 2008)?
by Petr Přikryl 21 Jun '11

21 Jun '11

Hi, I am very new to this mailing list. I tried to search the archive, but I did not find the answer... So far, I do use only BOOST_FOREACH and regex from the boost in our application. However, I am planning to extend the usage. My question is how to use the bjam correctly to compile a module for Microsoft Windows using the VC++ 9 (Visual Studio 2008)? My boost bakground... My previous experience is only with compilation of the regex. However, there are makefiles prepared for compilation by the Visual Studio C++ versions (like vc9.mak). It seems to me that bjam is prefered, and should be used whenever possible. I did download the boost_1_46_1.zip and unzipped it to d:usrboost_1_46_1 directory. Then I have followed the advice from somwhere in the doc and launched the d:usrboost_1_46_1bootstrap.bat The compilation went successfully and the d:usrboost_1_46_1bjam.exe appeared there. I did move it to the d:usrbin -- that directory is in my path. Now, I would like to know how and from where I should launch the bjam.exe to obtain the compiled libraries. Actually, I did some moves and I got some libs; however, I would like to better understand what I am doing. For example, I did compile the regex. But the libraries had the _1_46_1 in the name while the linker later expected to find only _1_46 in the name. I am afraid I do not understand more details. I tried some tutorials, but they are or too focused on something or too general (too much info). Please, can you focus on what exactly should be done for the program_options and for the regex? Thank you, Petr

1 0

Executable wrapped into another one: how to pass streams instead of real files?
by Alessandro Candini 21 Jun '11

21 Jun '11

I give you a simplified example to explain what I would like to do. I have the following code, which I cannot modify (hello.cpp): |#include <iostream> #include <fstream> using namespace std; int main( int argc, char *argv[] ) { string line; ifstream f( argv[1] ); while(!f.eof()) { getline(f, line); cout << line << endl; } return 0; } Launch example: ||caneta@host ~ $ ./hello myfile.txt 1 - This is 2 - a test 3 - file. I have a wrapper program which I need to modify: ||#include <stdio.h> #include <stdlib.h> #include <unistd.h> #include <iostream> #include <fstream> #include <sstream> using namespace std; int main () { int ret; ret = execl ("./hello", "./hello", "myfile.txt", (char *)0); return 0; }| In this way it works perfectly...but how can I modify it in order to use a stream or a string inside the wrapper program, instead of using a file name? I would like to have something like: |#include <stdio.h> #include <stdlib.h> #include <unistd.h> #include <iostream> #include <fstream> #include <sstream> using namespace std; int main () { int ret; ifstream inputFile; inputFile << "1 - This is" << endl; inputFile << "2 - a test" << endl; inputFile << "3 - file." << endl; ret = execl ("./hello", "./hello", inputFile, (char *)0); return 0; }| This last example, of course, doesn't work...how can I modify it in order to make it work? Remember that I cannot modify hello.cpp... Can the Boost.iostreams help me? Thanks in advance. -- Alessandro Candini MEEO S.r.l. Via Saragat 9 I-44122 Ferrara, Italy Tel: +39 0532 1861501 Fax: +39 0532 1861637 http://www.meeo.it ======================================== "ATTENZIONE:le informazioni contenute in questo messaggio sono da considerarsi confidenziali ed il loro utilizzo è riservato unicamente al destinatario sopra indicato. Chi dovesse ricevere questo messaggio per errore è tenuto ad informare il mittente ed a rimuoverlo definitivamente da ogni supporto elettronico o cartaceo." "WARNING:This message contains confidential and/or proprietary information which may be subject to privilege or immunity and which is intended for use of its addressee only. Should you receive this message in error, you are kindly requested to inform the sender and to definitively remove it from any paper or electronic format."

2 4

how does one build documentation for one library
by Robert Ramey 21 Jun '11

21 Jun '11

I'm interested in trying out quickbook documentation build system. To this I have studied this page. https://svn.boost.org/trac/boost/wiki/BoostDocs/GettingStarted#Howtotestyou… I've built quickbook and downloaded the other tools. I would like to test the system on one library and not occupy my system for hours trying to do this. The section How to test your build setup says: There is a set of test documentation that covers all the tools that can be used in the boost-root/doc/test directory. Building this requires quickbook, doxygen, latex, dvips and ps as well as the basic Boostbook setup. But it doesn't say what command to invoke nor what directory to invoke it from. What I would like to do is: a) cd to the library I'm interested int. eg cd c:/boostrelease/libs/fusion b) bjam html and have it build a subdirectory html (or maybe doc/html) with all the html files in it. How can I do this? Robert Ramey

3 2

lexical_cast and float
by Claude 20 Jun '11

20 Jun '11

Hi! I use this code to control if a sdt::string is a "float" value: string value("3.14"); try { lexical_cast<float>(value); } catch(bad_lexical_cast& ) { cout<<value<<" is not a float number\n"; } I always obtain a bad_lexical_cast exception. Why? -- View this message in context: http://boost.2283326.n4.nabble.com/lexical-cast-and-float-tp3609634p3609634… Sent from the Boost - Users mailing list archive at Nabble.com.

3 4

Serialization: how to inject context into save/load free functions?
by Michael Schuerig 20 Jun '11

20 Jun '11

I have a POD struct that I de/serialize through appropriately overloaded save and load free functions[*]. In my case, de/serialization involves translating between different representations (uid <-> username, gid <-> groupname). This translation is encapsulated in a class Etc and currently I just have a local variable of class Etc in both methods. I'd prefer a way to inject the Etc instance into save and load. The ideal solution would meet these criteria: * The Etc instance is created externally to save/load. * No global or quasi-global (static or singleton) variables. * No changes to the serialized struct (i.e. not an additional pointer to an Etc instance). * Usable with existing archive classes without extension. As far as I can tell, so far, I can't get all of these. I'm hoping that there is a way that I have overlooked. Michael [*] https://github.com/mschuerig/preserfs/blob/master/src/DirectoryMetadata.cpp… -- Michael Schuerig mailto:michael@schuerig.de http://www.schuerig.de/michael/

3 3

Boost.Preprocessor: expansion stops, result is further expandable
by Roman Neuhauser 20 Jun '11

20 Jun '11

Hello, I'd like to thank everybody involved in creation of Boost.Preprocessor for this cool piece of software, it does wonders. I have a possibly naive question (I'm an autodidact) which involves Boost.PP. I have stumbled upon strange behavior where the preprocessor stops expanding but the output expands further if fed to the preprocessor again. Given these directives: #include <boost/preprocessor.hpp> # #define DAPHP_REGISTER_CLASS(class_, props) \ CXXEXT_REGISTER_CLASS( \ class_ \ , BOOST_PP_SEQ_TRANSFORM(DAPHP_MAKE_PROPERTY, ~, props) \ ) # #define DAPHP_MAKE_PROPERTY(_, __, name) \ (name, IS_LONG, 0) # #define CXXEXT_REGISTER_CLASS(class_, props) \ object< class_ >::register_(); \ CXXEXT_DECLARE_PROPERTIES(class_, props) # #define CXXEXT_DECLARE_PROPERTIES(class_, props) \ BOOST_PP_SEQ_FOR_EACH( \ CXXEXT_DECLARE_PROPERTY_SEQ \ , ~ \ , BOOST_PP_SEQ_TRANSFORM(CXXEXT_PROPERTY_ADD_CLASS, class_, props) \ ) # #define CXXEXT_PROPERTY_ADD_CLASS(_, class_, prop) \ BOOST_PP_ARRAY_DATA(BOOST_PP_ARRAY_PUSH_FRONT((3, prop), class_)) # #define CXXEXT_DECLARE_PROPERTY_SEQ(_, __, elem) \ BOOST_PP_EXPAND(CXXEXT_DECLARE_PROPERTY elem) # #define CXXEXT_DECLARE_PROPERTY(native_type, name, ztype_, default_) \ object< native_type >::declare_property( \ ZEND_ACC_PUBLIC \ , ztype_ \ , BOOST_PP_STRINGIZE(name) \ , default_ \ ); # #define DAPHP_PROPS_DATE (year) (month) (day) This: DAPHP_REGISTER_CLASS(DapiDate, DAPHP_PROPS_DATE) Expands to (newlines added): object< DapiDate >::register_(); object< DapiDate >::declare_property( ZEND_ACC_PUBLIC , IS_LONG , "year" , 0 ); object< DapiDate >::declare_property( ZEND_ACC_PUBLIC , IS_LONG , "month" , 0 ); object< DapiDate >::declare_property( ZEND_ACC_PUBLIC , IS_LONG , "day" , 0 ); With these definitions added to the mix: #define DAPHP_REGISTER_CLASSES(classes) \ BOOST_PP_SEQ_FOR_EACH( \ DAPHP_REGISTER_CLASS_SEQ \ , ~ \ , classes \ ) # #define DAPHP_REGISTER_CLASS_SEQ(_, __, classprops) \ DAPHP_REGISTER_CLASS( \ BOOST_PP_TUPLE_ELEM(2, 0, classprops) \ , BOOST_PP_TUPLE_ELEM(2, 1, classprops) \ ) This: DAPHP_REGISTER_CLASSES( ((DapiDate, DAPHP_PROPS_DATE)) ) Expands to (newlines added): object< DapiDate >::register_(); BOOST_PP_SEQ_FOR_EACH( CXXEXT_DECLARE_PROPERTY_SEQ , ~ , ((DapiDate, year, IS_LONG, 0)) ((DapiDate, month, IS_LONG, 0)) ((DapiDate, day, IS_LONG, 0)) ) Which is an intermediate expansion of the above listed DAPHP_REGISTER_CLASS(DapiDate, DAPHP_PROPS_DATE). g++ 4.5.0 (MinGW) and MSVC 9 Express behave the same, which makes me believe this is a PEBKAC, but I just don't see it. Why doesn't DAPHP_REGISTER_CLASSES expand all the way as DAPHP_REGISTER_CLASS does? Please enlighten me. -- roman

2 2

Request for an addition in Boost Coding standard
by Gokulakannan Somasundaram 19 Jun '11

19 Jun '11

Hi, We have a custom memory allocator and we don't do global operator new/delete override for the obvious reasons. While the container classes being provided by Boost get the allocator as a template arguments, there are a lot of classes which do contain string and vector inside them, but don't provide the allocator as template arguments. May i request to have a coding standard to provide allocators as template arguments in all the classes that maintain private heap directly /indirectly( through the other containers )? To name a few, i saw the implementation of Boost Format, which provides the allocator for string, but not for the vectors. I also looked at the Boost filesystem, which has a string inside, but restricts itself to std::allocator. Thanks, Gokul.

7 11

[preprocessor] using ENUM_PARAMS to generate macro call arguments
by Krzysztof Czainski 18 Jun '11

18 Jun '11

Hello, I'll try to illustrate what I am trying to do on this example: #define VER 1 // given alternative sets of macros: #if VER==1 #define M0() #define M1( arg0 ) #define M2( arg0, arg1 ) #define M3( arg0, arg1, arg2 ) #define M4( arg0, arg1, arg2, arg3 ) #elif VER==2 #define V0( x ) #define V1( x, arg0 ) #define V2( x, arg0, arg1 ) #define V3( x, arg0, arg1, arg2 ) #define V4( x, arg0, arg1, arg2, arg3 ) #endif // I'm trying to write alternative versions of INVOKE for the above sets of macros, // so that the interface below needs no #ifs #if VER==1 #define INVOKE( n_args ) \ BOOST_PP_CAT(M,n_args)( BOOST_PP_ENUM_PARAMS(n_args,arg) ) #elif VER==2 #define INVOKE( n_args ) \ BOOST_PP_CAT(V,n_args)( dummy BOOST_PP_ENUM_TRAILING_PARAMS(n_args,arg) ) #endif // the interface implemented in terms of INVOKE #define A0() INVOKE(0) #define A1( arg0 ) INVOKE(1) #define A2( arg0, arg1 ) INVOKE(2) #define A3( arg0, arg1, arg2 ) INVOKE(3) #define A4( arg0, arg1, arg2, arg3 ) INVOKE(4) int main() { A2(1,2) } My goal here is to keep INVOKE as simple and non-redundant as possible, because alternative versions of INVOKE for alternative sets of given macros will be added later on. Now the call A2(1,2) doesn't compile. If I understand correctly, the reason is ENUM_PARAMS(n_args,arg) is passed to M2, while I need the result of macro expansion of ENUM_PARAMS(...) to be passed to M2. So my question is: Is there a way around this? I attached a file ready to compile with the presented code. Thanks in advance Kris

2 2

[boost] [review] [heap] Summary
by Andrew Sutton 18 Jun '11

18 Jun '11

The formal review of Tim Blechmann's Heap library has concluded. Only four votes were cast, although more people commented on issues either on the mailing list or though the Code Collaborator tool. However, from the comments received, the review identified no fundamental problems in the design or implementation of the library that would entail rejection. A such, the Boost.Heap library is ACCEPTED into Boost Votes for the library were cast by: Phil Endecott Daniel Russel Votes against: Thomas Klimpel (provisionally) Andrew Sutton Other comments received during the course of the review were generally positive, with a number of technical issues identified that need to to be addressed. The final version of the library can be fully accepted once Tim has addressed the technical issues identified during the review. Below is a summary of technical concerns. - The pairing heap has a known issue, regarding stack overflows, making it potentially unusable for production code. If the recursion issue can't be adequately solved, then the data structure should carry a much stronger warning label (i.e., put it in an experimental directory). - The performance of b_heap vs. d_ary_heap vs. priority_queue needs to be better characterized. Under what circumstances does one outperform the other. If no convincing scenario can be found where b_heap outperforms the others, then it should also be placed in an experimental directory. - The heap concepts need to be revisited as per comments on the review tool. The concepts should also describe semantics of the operations, not just the interfaces. - There were several comments on the implementation of heap stability. Three alternatives were identified: “naturally stable” heaps (of which no examples were given), the current counter based approach, and a chaining approach. No consensus on the best implementation strategy. Although the counter-based approach is probably adequate for most applications, it is not universally desirable. A more thorough investigation of alternative strategies is encouraged. It would be acceptable to document the investigation in a “Future Work” section of the library documentations (with any experiments also housed in the library). - The notion of Mergeable heaps needs to be better addressed, at least to differentiate between heaps that merge in O(n) or slower time and those that can merge in O(lg n) time. The proposed solution is to write merge as a general heap algorithm and specialize it for Mergeable heaps by calling the member function merge. Also, merge should be destructive, so merge and clear should not be needed. - The documentation must be substantially improved with respect to the overall design of heap data structures (i.e., concepts), especially mutable heaps and best practices. It also needs to provide both theoretical and performance comparisons for the different heaps. - Include documentation of the benchmarking tool in the documentation. It could be instructive for users to evaluate different heap implementations on their host or target architectures. - Document the complexity of == and < for heaps. - Address the comments and issues in the Review Tool. There were other recommendations that should be considered in the long term for the library. - Thorsten Ottosen suggest making b_heap and d_ary_heap container adaptors along the lines of std::stack, std::queue, and std::priority_queue, allowing parameterization over (e.g., stack-based container). Subsequent discussion indicates that there are some impracticalities in doing so, namely that it could invalidate other policies (e.g., stability). - Phil Endecott suggested rewriting some heaps (b_heap and d_ary_heap) in terms of more general algorithms operating on a (Random Access) Range in order to support the formulation of heap structures on other memory structures. Doing this would also help support the definition of heaps that satisfied Thorsten's request. I strongly recommend investigating Phil's suggestion, but this is not a barrier to acceptance. This feature could be added in future revisions of the library. I'd like to thank the community members who took the time to review Tim's work and especially those that submitted formal reviews. I'd also like to thank Tim (again) for his contributions and patiently answering our questions and addressing our comments. Andrew _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

about using boost on dev cpp
by prasad jondhale 18 Jun '11

18 Jun '11

hi all, i am trying to install boost library on dev cpp but not able to do it as i am new to boost so please give me step by step procedure to install it on dev cpp i am trying from last 5 days thanx

2 1

Iterators for the cartesian product
by kelvSYC 18 Jun '11

18 Jun '11

So that the wheel doesn't have to be reinvented if it's already out there, is there something in boost that will take a bunch of sequences (lists, say) and return a sequence containing the cartesian product all of them, either as a tuple or after applying a function to them? For example, is there something in boost that will, given a bunch of lists of integers, return a list of integers formed by multiplying together one member from each list?

3 6

[bind] member function as signal handler
by Tim Odenthal 17 Jun '11

17 Jun '11

Hi, all! I'd like to get a member function of an object to handle signals - is that possible with boost::bind? I tried the following, which doesn't work: SomeClass{ ... bool done_; public: void handler_done(int signal){ std::cout << "Recieved signal " << signal <<" ..." <<std::endl; done_ = true; } }; then, in the main: #include <signal.h> #include <boost/bind.hpp> ... SomeClass someClass; signal( SIGINT,boost::bind( &SomeClass::handler_done, &someClass,_1) ); ... I get the following error (g++ (Ubuntu 4.4.3-4ubuntu5) 4.4.3): error: cannot convert ‘boost::_bi::bind_t<void, boost::_mfi::mf1<void, SomeClass, int>, boost::_bi::list2<boost::_bi::value<SomeClass*>, boost::arg<1> > >’ to ‘void (*)(int)’ for argument ‘2’ to ‘void (* signal(int, void (*)(int)))(int)’ Is this generally impossible, or am I just making some stupid error from not really understanding boost::bind properly? Thanks in advance! Tim

2 1

Intel Compiler: "warning #1170: invalid redeclaration of nested class" with bimaps
by Oleksiy Atramentov 17 Jun '11

17 Jun '11

Dear Experts. I am getting "invalid redeclaration of nested class" warnings when I include "bimap/bimap.hpp" and use intel compiler(v12). Actually, these warnings are still present when the source has nothing but the #include and an empty main(). I noticed that I don't get these warnings with gcc (v4.1.2). I tried to debug the warning but I am still not sure whether the compiler (and/or boost settings for it) is beeing extra carefull and the warning is benign. Thank you, Oleksiy 1>boost/bimap/tags/support/tag_of.hpp(57): warning #1170: invalid redeclaration of nested class 1> BOOST_BIMAP_STATIC_ERROR( USING_TAG_OF_WITH_AN_UNTAGGED_TYPE, (Type) ); 1> ^ 1> 1boost/bimap/relation/support/member_with_tag.hpp(73): warning #1170: invalid redeclaration of nested class 1> BOOST_BIMAP_STATIC_ERROR( MEMBER_WITH_TAG_FAILURE, (Relation,Tag) ); 1> ^ 1> 1>boost/bimap/relation/support/value_type_of.hpp(57): warning #1170: invalid redeclaration of nested class 1> BOOST_BIMAP_SYMMETRIC_METADATA_ACCESS_BUILDER 1> ^ 1> 1>boost/bimap/relation/support/pair_type_by.hpp(48): warning #1170: invalid redeclaration of nested class 1> BOOST_BIMAP_SYMMETRIC_METADATA_ACCESS_BUILDER 1> ^ 1>

1 0

Re: [Boost-users] [Serialization] [Ptr_container] Serializing a boost::ptr_vector fails
by Philipp Münzel 17 Jun '11

17 Jun '11

I'm sorry, I simply forgot to #include <boost/ptr_container/serialize_ptr_vector.hpp> please excuse the disturbance. Regards, Philipp On 17.06.2011 16:18 "Philipp Münzel" <mailing-lists(a)philippmuenzel.de> wrote: > Dear list, > > I want to use boost::ptr_vector<> in conjunction with > boost::serialization. > The ptr_cotainer documentation says: > > > As of version 1.34.0 of Boost, the library supports serialization > > via Boost.Serialization. > > Of course, for serialization to work it is required that the stored > > type itself is serializable. For maps, both the key type and the > > mapped type must be serializable. > > However, when I create a class like this: > > #include <boost/ptr_container/ptr_vector.hpp> > #include <boost/serialization/access.hpp> > > > class Foo { > boost::ptr_vector<int> the_vector_ > friend class boost::serialization::access; > > template<class Archive> > void serialize(Archive & ar, const unsigned int) > { > ar & the_vector_; > } > } > > and then try to serialize it: > > std::ofstream ofs("filename"); > Foo f; > boost::archive::text_oarchive oa(ofs); > oa << f; > > I'm getting the following error, using gcc 4.2.1 and boost 1.46.1: > > > /usr/local/include/boost/serialization/access.hpp:118: error: 'class > boost::ptr_vector<Waypoint, boost::heap_clone_allocator, > std::allocator<void*> >' > has no member named 'serialize' > > How can I serialize a boost::ptr_container ? > > Regards, > Philipp >

1 0

[Serialization] [Ptr_container] Serializing a boost::ptr_vector fails
by Philipp Münzel 17 Jun '11

17 Jun '11

Dear list, I want to use boost::ptr_vector<> in conjunction with boost::serialization. The ptr_cotainer documentation says: > As of version 1.34.0 of Boost, the library supports serialization via Boost.Serialization. > Of course, for serialization to work it is required that the stored type itself is serializable. For maps, both the key type and the mapped type must be serializable. However, when I create a class like this: #include <boost/ptr_container/ptr_vector.hpp> #include <boost/serialization/access.hpp> class Foo { boost::ptr_vector<int> the_vector_ friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int) { ar & the_vector_; } } and then try to serialize it: std::ofstream ofs("filename"); Foo f; boost::archive::text_oarchive oa(ofs); oa << f; I'm getting the following error, using gcc 4.2.1 and boost 1.46.1: /usr/local/include/boost/serialization/access.hpp:118: error: 'class boost::ptr_vector<Waypoint, boost::heap_clone_allocator, std::allocator<void*> >' has no member named 'serialize' How can I serialize a boost::ptr_container ? Regards, Philipp

1 0

[Threads] How to keep number of running thread constant, performing different operations
by Alessandro Candini 17 Jun '11

17 Jun '11

I have a problem in organizing concurrent thread launch. My program structure is the following: #include <iostream> #include <boost/thread.hpp> using namespace std; class Worker { private: boost::thread m_Thread; public: Worker() { /* the thread is not-a-thread until we call start() */ } void start(int N) { m_Thread = boost::thread(&Worker::processQueue, this, N); } void join() { m_Thread.join(); } void processQueue(unsigned N) { /* Do some long long stuff... */ } }; int main(int argc, char* argv[]) { Worker worker_1, worker_2, worker_3, worker_4; // How to start threads and join them in order // to make constantly two of them running? return 0; } I have different threads which have to work on completely different input and output data (non critical sections): an atomic operation per thread, each one with different time execution but everyone with an intense use of the CPU. Let's say I have 10 operations to perform (10 threads): I would like to run concurrently only 2 threads because of resource consumption. My problem is that when a threads ends its execution, I would like to suddenly start another thread performing operation 3, in order to have constantly 2 threads working, and so on until the end of operations. How can I achieve this? I thought to insert my threads into a vector...but I have no idea on how start and join them in order to obtain what described above. Can anyone post me a little example? Thanks in advance. -- Alessandro Candini MEEO S.r.l. Via Saragat 9 I-44122 Ferrara, Italy Tel: +39 0532 1861501 Fax: +39 0532 1861637 http://www.meeo.it ======================================== "ATTENZIONE:le informazioni contenute in questo messaggio sono da considerarsi confidenziali ed il loro utilizzo è riservato unicamente al destinatario sopra indicato. Chi dovesse ricevere questo messaggio per errore è tenuto ad informare il mittente ed a rimuoverlo definitivamente da ogni supporto elettronico o cartaceo." "WARNING:This message contains confidential and/or proprietary information which may be subject to privilege or immunity and which is intended for use of its addressee only. Should you receive this message in error, you are kindly requested to inform the sender and to definitively remove it from any paper or electronic format."

5 8

[Python] Undefined symbol in extension library with python 3
by Vivek 17 Jun '11

17 Jun '11

I compiled and installed boost 1.46.1 from source recently using: $ ./bootstrap.sh --with-python-version=3.1 $ sudo ./bjam -j4 install I then created the following trivial python extension: #include <boost/python.hpp> struct mystruct { int i; }; BOOST_PYTHON_MODULE(test) { using namespace boost::python; class_<mystruct>("Mystruct") .def_readwrite("i", &mystruct::i) ; } and compiled and ran it, but got an undefined symbol error: $ g++ -shared question.cpp -I/usr/include/python3.1 -lboost_python3 -otest.so $ python3 Python 3.1.2 (release31-maint, Sep 17 2010, 20:34:23) [GCC 4.4.5] on linux2 Type "help", "copyright", "credits" or "license" for more information. >>> import test Traceback (most recent call last): File "<stdin>", line 1, in <module> ImportError: ./test.so: undefined symbol: _ZN5boost6python6detail11init_moduleEPKcPFvvE ldd confirms the missing symbol: $ ldd -r test.so linux-gate.so.1 => (0x00221000) libboost_python3.so.1.46.1 => /usr/local/lib/libboost_python3.so.1.46.1 (0x00a3d000) libstdc++.so.6 => /usr/lib/libstdc++.so.6 (0x0022b000) libm.so.6 => /lib/libm.so.6 (0x00960000) libc.so.6 => /lib/libc.so.6 (0x00316000) libutil.so.1 => /lib/libutil.so.1 (0x004b8000) libpthread.so.0 => /lib/libpthread.so.0 (0x00cf2000) libdl.so.2 => /lib/libdl.so.2 (0x00be4000) librt.so.1 => /lib/librt.so.1 (0x005d3000) libgcc_s.so.1 => /lib/libgcc_s.so.1 (0x00489000) /lib/ld-linux.so.2 (0x00fd5000) undefined symbol: PyExc_ImportError (/usr/local/lib/libboost_python3.so.1.46.1) undefined symbol: PyProperty_Type (/usr/local/lib/libboost_python3.so.1.46.1) ... snip ... *undefined symbol: _ZN5boost6python6detail11init_moduleEPKcPFvvE (./test.so) * undefined symbol: _Py_NoneStruct (./test.so) undefined symbol: PyLong_FromLong (./test.so) undefined symbol: PyLong_Type (./test.so) However nm confirms that the symbol exists in /usr/local/lib/libboost_python3.so.1.46.1: $ nm /usr/local/lib/libboost_python3.so.1.46.1 | c++filt | grep init_module 00031a00 T boost::python::detail::init_module(PyModuleDef&, void (*)()) I've tried running ldconfig to update the library cache, as well as compiling the extension with -lpython3.1, but no luck. Ideas appreciated, Vivek

2 1

[review][assign] Formal review of Assign v2 ongoing
by John Bytheway 16 Jun '11

16 Jun '11

For those who did not see the notices elsewhere, note that the formal review of the Assign v2 library upgrade by Erwann Rogard is ongoing, and is scheduled to continue until June 24th. Please consider looking at the library and submitting a review to the developer list (boost(a)lists.boost.org) or directly to me (in which case let me know whether you would like the review forwarded to the developer list). About Assign v2 =============== Assign v2 is an upgrade of Boost.Assign (1.0) that redefines its functionality, with optional C++0x support and new features. It is a compact interface for executing the repetitive tasks of assigning or inserting container elements. For example, std::map<std::string, int> map; // Inserts each pair ("jan", 31),...,("may", 31) in map: csv_put<2>(map, "jan", 31, "feb", 28, "mar", 31, "apr", 30, "may", 31); Please see the change log (linked below) for more detail on the motivation for this library and pointers for navigating the documentation. Where to get it =============== The documentation is online at: <http://svn.boost.org/svn/boost/sandbox/assign_v2/libs/assign/v2/doc/html/in…> With the change log at: <http://svn.boost.org/svn/boost/sandbox/assign_v2/libs/assign/v2/doc/html/bo…> The Assign v2 source can be found in the Boost sandbox at: <http://svn.boost.org/svn/boost/sandbox/assign_v2/> or downloaded from: <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=assign…> Review guidelines ================= Reviews should be submitted to the developer list (boost(a)lists.boost.org) with '[assign]' in the subject. Or if you don't wish to for some reason, you can send them privately to me. If so, please let me know whether or not you'd like your review to be forwarded to the list. All reviews are appreciated, even if you don't have time for an in-depth study. The Assign v2 library consists of several largely independent components: Reference containers and chaining, container modification and generation, and conversion of ranges to containers. If you wish, feel free to review and even vote on these separately. For your review you may wish to consider the following questions: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? And finally, every review should answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. More detail on the review process is available at: http://www.boost.org/community/reviews.html John Bytheway Review Manager

1 0

Since which boost-version is linking against boost-system required?
by Cedric Laczny 16 Jun '11

16 Jun '11

Hi, I have an application which compiles fine with boost-1.40 and 1.41 (global installation). When I try to compile that application on a system with a local (staged) installation of boost-1.46.0, it complains about undefined reference to `boost::system::get_system_category()' etc. So, now, it has to be linked also to boost-system via -lboost-system. Linking against boost_filesystem and boost_regex ist already specified. So far, so good. My question is now, since when is this required? Thank you. Best, Cedric

3 9

Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine?
by Gurcan Gulesir 16 Jun '11

16 Jun '11

> I don't know what compiler you used and what your real code looked > like, but when I tried to compile some portions of your sample code > with VC10, I got a lot of "use of undefined type" errors. I am using Eclipse IDE for C/C++ Helios Service Release 2 and Ubuntu 10.04 LTS with its built-in GCC C++ compiler and linker. My software uses Linux-specific libraries, so VC10 is currently not an option for me. If I encounter any additional problems, then I will first compile the "skeleton code" of my state machines in VC10, find and solve the problem there, and then port the solution to Eclipse in Ubuntu. So, thanks for the tip!

1 0

Serialize a vector of lists with boost
by Alessandro Candini 16 Jun '11

16 Jun '11

Hi all. I have a program, simplified as follows: |#include<vector> #include<list> #include<fstream> using namespace std; class MyObj { int val; public: MyObj(int v){ val = v; }; ~MyObj(){}; }; int main (int argc,char *argv[]) { int i, j; vector< list<MyObj*> > layers; for(i=0; i<5; i++) { list<MyObj*> tmp; for(j=0; j<10; j++) tmp.push_back(new MyObj(j) ); layers.push_back(tmp); } return 0; }| I need to serialize/deserialize the object "layers". Can anyone give me an example on how to do this with boost serialization library? Thanks in advance. -- Alessandro Candini MEEO S.r.l. Via Saragat 9 I-44122 Ferrara, Italy Tel: +39 0532 1861501 Fax: +39 0532 1861637 http://www.meeo.it ======================================== "ATTENZIONE:le informazioni contenute in questo messaggio sono da considerarsi confidenziali ed il loro utilizzo è riservato unicamente al destinatario sopra indicato. Chi dovesse ricevere questo messaggio per errore è tenuto ad informare il mittente ed a rimuoverlo definitivamente da ogni supporto elettronico o cartaceo." "WARNING:This message contains confidential and/or proprietary information which may be subject to privilege or immunity and which is intended for use of its addressee only. Should you receive this message in error, you are kindly requested to inform the sender and to definitively remove it from any paper or electronic format."

2 4

A doubt in Boost Format
by Gokulakannan Somasundaram 16 Jun '11

16 Jun '11

Hi, We are using Boost format in our project. We want to replace the normal allocator with a special allocator and we don't want any allocation be made with normal new. I was looking at the Boost fusion reference. format_class.hpp The class accepts a allocator and indeed uses it to instantiate the std::string inside. But there are two vectors inside - std::vector<format_item_t> items_; // each '%..' directive leads to a format_item std::vector<bool> bound_; // stores which arguments were bound. size() == 0 || num_args I am seeing that the vectors are not using the allocators. Is this the intended behavior? Is it right, to try to make an application not to use the normal new/delete completely? Thanks, Gokul.

4 7

Exception: adding diagnostic information from a dtor?
by Michael Schuerig 16 Jun '11

16 Jun '11

The FAQ for boost exception contain this example snippet for adding further information to an exception while the call stack is unwound catch( boost::exception & e ) { e << foo_info(foo); throw; //Okay, re-throwing the original exception object. } I like that this possible, but I think the resulting code is somewhat tedious: void foo(const string& file_name) { try { do_something_fallible(file_name); } catch( boost::exception & e ) { e << boost::errinfo_file_name(file_name); throw; } } I'd rather write it like this: void foo(const string& file_name) { diagnostic<errinfo_file_name>(file_name); do_something_fallible(file_name); } My first, non-generic attempt fails: class diagnostic { public: explicit diagnostic(const string& file_name) : file_name_(file_name) {} ~diagnostic() { if ( boost::exception_ptr e = boost::current_exception() ) { *e << boost::errinfo_file_name(file_name_.c_str()); } } private: const string file_name_; }; The requirements for boost::current_exception() state that it may only be called inside a catch block, therefore the code above is illegal to begin with. Ignoring that, operator<< doesn't appear to be suitably overloaded for this use, anyway. Now, I'm wondering, is what I'm trying to achieve a bad idea? If not, is there another way to do it? Michael -- Michael Schuerig mailto:michael@schuerig.de http://www.schuerig.de/michael/

3 7

[linking] simplifying compilation line with many boost libs
by alfC 16 Jun '11

16 Jun '11

This post is mainly about the linux distribution of boost, oriented to gcc. Given the lack of pgk-config for linux and the lack of linking pragmas in g++ I am wondering if somebody investigated the possibility of having all boost binary libraries in one file or something like that. Such that compilation line c++ -lboost_regex -lboost_system -lboost_filesystem -lboost_mpi - lboost_serialization ... can be simplified into c++ -lboost_all or simply c++ -lboost where boost_all.so have the contents of all boost libraries or references to the other boost_*.so the idea is to simplify sharing short code with other people not familiar with boost itself. Thanks, Alfredo

2 2

[filesystem]
by Ford Sleeman 15 Jun '11

15 Jun '11

Hi everybody, I am trying to use the Boost filesystem library and ran into a strange problem. When I include the library in a project (automake or standard Makefile) I can link everything and the resulting program runs fine. I get errors like this for even including the <boost/filesystem.hpp> file in a second source or header file: [my path]/boost/exception/exception.hpp:179: error: expected identifier before numeric constant [my path]/boost_1_46_1/boost/exception/exception.hpp:179: error: expected `>' before numeric constant [my path]/boost_1_46_1/boost/exception/exception.hpp:180: error: expected unqualified-id before numeric constant [my path]/boost_1_46_1/boost/exception/exception.hpp:182: error: expected identifier before numeric constant [my path]/boost_1_46_1/boost/exception/exception.hpp:182: error: expected `>' before numeric constant [my path]/boost_1_46_1/boost/exception/exception.hpp:183: error: expected unqualified-id before numeric constant [my path]/boost_1_46_1/boost/exception/exception.hpp:185: error: expected identifier before numeric constant I could not find any examples of linking multiple files in a project with the library, does such exist? Is there something special to include the headers in this situation? If I comment out the #include and any references to the boost::filesystem functions in the second source file the program will compile correctly. Thanks, Ford Sleeman NOTE: The information contained in this message may be privileged and confidential and protected from disclosure. If the reader of this message is not the intended recipient, you are hereby notified that any dissemination, distribution or copying of this communication is strictly prohibited. If you have received this communication in error, please notify us immediately by replying to the message and deleting it from your computer. -------------------------------------- VCU Health System http://www.vcuhealth.org

2 1

[math/distributions] Problem using inv-chi**2 and quantiles
by Paul Johnson 15 Jun '11

15 Jun '11

I'm trying to duplicate Excel's CHIINV to calculate confidence limits for an observed number of events. I think I'm nearly there, largely as a result of trial and error, but the boost results still significantly differ from the Excel results, so I've presumably messed up somewhere. Any advice will be *greatly* appreciated. The Excel formulas I'm using are: lo limit = CHIINV((1+$C$3)/2, 2*B6)/2 hi limit = CHIINV((1-$C$3)/2, 2*(B6+1))/2 where $C$3 is the confidence level required (95%), and B6 is the number of events observed. In Excel, 'CHIINV' is documented as: > CHIINV(probability,degrees_freedom) > Probability is a probability associated with the chi-squared distribution. > Degrees_freedom is the number of degrees of freedom. For 17 events, for example, Excel is producing limits of [9.90, 27.22]. I've attached my complete boost test program below, which I hope does the same thing, but there was a large amount of guesswork here. This program produces results of [10.67, 25.98] for 17 events. Can anyone tell me what I'm doing wrong? Thanks - Paul

3 5

[msm] EUML submachine without macro
by rayg 15 Jun '11

15 Jun '11

Hi, I'm trying to define a submachine without the BOOST_MSM_EUML_DECLARE_STATE_MACHINE macro (the "old" way - like in http://www.boost.org/doc/libs/1_46_0/libs/msm/doc/HTML/examples/SimpleTutor…) The "main" machine works as expected. However, the submachine doesn't kick in at all (the system asserts in default no-transition handler). Any ideas? Ray ------------ #include <boost/msm/front/state_machine_def.hpp> #include <boost/msm/front/euml/euml.hpp> #include <boost/msm/back/state_machine.hpp> using namespace std; using namespace boost::msm::front::euml; namespace msm = boost::msm; //#define WITH_MACROS //************ //* Events //************ BOOST_MSM_EUML_EVENT(play) BOOST_MSM_EUML_EVENT(toggle) //************* //* Submachine //************* #ifdef WITH_MACROS //************************ //* This works fine //************************ BOOST_MSM_EUML_ACTION(Song1_Entry) { template <class Event,class FSM,class STATE> void operator()(Event const&,FSM&,STATE& ) { // Called as expected std::cout << "entering: Song1" << std::endl; } }; BOOST_MSM_EUML_STATE((Song1_Entry), Song1) BOOST_MSM_EUML_STATE((), Song2) BOOST_MSM_EUML_TRANSITION_TABLE(( Song2 == Song1 + toggle, Song1 == Song2 + toggle ), sub_transition_table) BOOST_MSM_EUML_DECLARE_STATE_MACHINE((sub_transition_table, init_ << Song1), _Playing) #else //************************ //* Doesn't work //************************ struct Song1_impl : public msm::front::state<> , public msm::front::euml::euml_state<Song1_impl> { template <typename EVENT, typename FSM> void on_entry(EVENT const&, FSM& fsm) { // Not called std::cout << "entering: Song1" << std::endl; } }; struct Song2_impl : public msm::front::state<> , public msm::front::euml::euml_state<Song2_impl> { }; Song1_impl const Song1; Song2_impl const Song2; struct _Playing : public msm::front::state_machine_def< _Playing > { // Initial state typedef Song1_impl initial_state; BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE(( Song2 == Song1 + toggle, Song1 == Song2 + toggle ), sub_transition_table) }; #endif // Pick a back-end typedef msm::back::state_machine<_Playing> Playing_impl; Playing_impl const Playing; //********************************** //* Main machine //********************************** struct Empty_impl : public msm::front::state<> , public msm::front::euml::euml_state<Empty_impl> { }; Empty_impl const Empty; struct _Player : public msm::front::state_machine_def< _Player > { // Initial state typedef Empty_impl initial_state; BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE(( Playing == Empty + play ), transition_table) }; // Pick a back-end typedef msm::back::state_machine<_Player> player; int main(int argc, char* argv[]) { player p; p.start(); p.process_event( play ); return 0; } -- View this message in context: http://boost.2283326.n4.nabble.com/msm-EUML-submachine-without-macro-tp3598… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

reference_wrapper 101
by Robert Jones 15 Jun '11

15 Jun '11

I thought understood what boost::reference_wrapper was all about, and in the context of, say Boost.Bind, it seems pretty clear. But why would you define a function to RETURN a reference_wrapper? eg template <class T> struct X { std::pair<boost::reference_wrapper<T>, unsigned> getSomething(....) const; }; I suspect I'm having a 'doh' moment here! Thx, - Rob.

2 1

Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine?
by Igor R 15 Jun '11

15 Jun '11

> Thanks for the recommendation. The problem turned out to be indeed with > forward declarations. I wish the compilation errors were somewhat more > informative, so that I could find the root cause of the problem easily. I don't know what compiler you used and what your real code looked like, but when I tried to compile some portions of your sample code with VC10, I got a lot of "use of undefined type" errors.

1 0

Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine?
by Gurcan Gulesir 15 Jun '11

15 Jun '11

Thanks for the recommendation. The problem turned out to be indeed with forward declarations. I wish the compilation errors were somewhat more informative, so that I could find the root cause of the problem easily. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Igor R Sent: donderdag 9 juni 2011 18:33 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine? > Putting everything into one file, surprisingly for me, solved my problem of > not being able to nest a sub-state under a super state. Now I need to figure > out why the previous implementation (i.e., the one distributed over multiple > files) does not compile. I guess you try to use undefined (forward-declared) types in contexts where they cannot be used. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

asio ssl peer authentication, check which certificate is really authenticated
by Lloyd 15 Jun '11

15 Jun '11

Hi, I have gone through the asio ssl client and server sample and modified. The modification I have done is, added one more certificate to the client by using "ctx.load_verify_file("another_cert.pem");" Now I have two server certificates loaded for server authentication. These are self signed certificate. But in client is there any way to know which server is authenticated? In real case we will be using this for client-authentication, to know what kind of client is connected to the server. We have two types of client, and one client has only restricted privileges. Thanks, Lloyd

1 0

Boost filesystem v3 with Qt.
by Surya Kiran Gullapalli 15 Jun '11

15 Jun '11

Hello, Sorry for cross-posting. I'm facing an issue with Qt (4.7.2, installed from Qt installer) with Boost.Filesystem v3 (1.46.1) on VS2008. I'm facing linker errors with QString::toStdWString when /Zc:wchar_t is set like this: unresolved external symbol "__declspec(dllimport) public: class std::basic_string<wchar_t,struct std::char_traits<wchar_t>,class std::allocator<wchar_t> > __thiscall QString::toStdWString(void)const " (__imp_?toStdWString@QString@@QBE?AV?$basic_string@_WU?$char_traits@_W@std@@V?$allocator@_W@2@@std@@XZ) referenced in function "private: void __thiscall DirView::readDirectory(class QModelIndex const &)" (?readDirectory@DirView@@AAEXABVQModelIndex@@@Z) and linker errors with std::codecvt when /Zc:wchar_t- is set like this: unresolved external symbol "__declspec(dllimport) public: static class std::codecvt<unsigned short,char,int> const & __cdecl boost::filesystem3::path::codecvt(void)" (__imp_?codecvt@path@filesystem3@boost@@SAABV?$codecvt@GDH@std@@XZ) referenced in function "public: __thiscall boost::filesystem3::path::path<class std::basic_string<unsigned short,struct std::char_traits<unsigned short>,class std::allocator<unsigned short> > >(class std::basic_string<unsigned short,struct std::char_traits<unsigned short>,class std::allocator<unsigned short> > const &,void *)" (??$?0V?$basic_string@GU?$char_traits@G@std@@V?$allocator@G@2@@std@@@path@filesystem3@boost@@QAE@ABV?$basic_string@GU?$char_traits@G@std@@V?$allocator@G@2@@std@@PAX@Z) How can i use Qt with boost filesystem ? Thanks in advance, Surya

2 1

fast_pool_allocator question
by steviekm3 14 Jun '11

14 Jun '11

I was wondering if fast_pool_allocator will speed something up. I have a funtion say g which looks like: void g( Params p ) { std::map<double,Foo> m; for( int i = 0; i < 100000; ++it ) { m.insert( ... ) } } g gets called from about 100 different threads running on 16 processor machine. All the processors are not being used near full capacity. I did some analysis and find that most of the time one thread is in malloc system call and other threads are blocking on it. ( I guess malloc only allows serial access a certain points ). Would a fast_pool_allocator speed this up. Could I pre-allocate the memory needed using a fast_pool_allocator ? I don't want the pool to return memory to the system. Just to reuse memory that is no longer needed ( reuse memory that m has used after m goes out of scope ). -- View this message in context: http://boost.2283326.n4.nabble.com/fast-pool-allocator-question-tp3596247p3… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

Boost::Asio crashes all the time when starting multiple connections
by Andi Clemens 14 Jun '11

14 Jun '11

Hi, I have started to write a ProxyServer that analyzes TDS-packages sent from the Microsoft SQLServer Management Studio to a MS SQLServer. It seems to work fine for one or two connections, but if more connections are openend, boost suddenly crashes, mostly in the bind-template.hpp: template<class A1, class A2> result_type operator()(A1 const & a1, A2 const & a2) { list2<A1 const &, A2 const &> a(a1, a2); CRASH ===> BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0); } I have modified the code from the examples page: http://www.boost.org/doc/libs/1_46_1/doc/html/boost_asio/example/echo/async… I only added a second socket in the session class for handling the connection to the SQLServer. When I start SSMS and click on "New query", I can see two additional connections being opened, and then the program crashes. I have posted the source code here: session.h : http://pastebin.com/eC5fn7U8 session.cpp : http://pastebin.com/LDnQqCNr server.h: http://pastebin.com/1fDJU6sx server.cpp: http://pastebin.com/seMAVx4D ProxyServer.cpp: http://pastebin.com/8S7YfE8L Am I doing something wrong? Maybe the code isn't threadsafe? I'm new to boost::asio and I might have missed an important point here. Maybe I need more than one io_service object? Andi -- Using Opera's revolutionary email client: http://www.opera.com/mail/

2 2

Re: [Boost-users] [chrono] Can not build with intel-win
by Edward Rankin 14 Jun '11

14 Jun '11

On Mon, Jun 13, 2011 at 3:55 PM, <boost-users-request(a)lists.boost.org>wrote: > Message: 6 > Date: Mon, 13 Jun 2011 08:10:45 +0100 > From: Bo Jensen <jensen.bo(a)gmail.com> > To: boost-users(a)lists.boost.org > Subject: [Boost-users] [chrono] Can not build with intel-win > Message-ID: <BANLkTim7efYQfM=FhFi9m5Q2i0g8L5XG5A(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Newest intel C++ release and vs2010, can not build with chrono from trunk. > > I get : > > pnet.cpp > ..\..\..\external\boost\boost/chrono/duration.hpp(94): error: expected > an expression > && (boost::is_convertible<Rep2, > ^ > > ..\..\..\external\boost\boost/chrono/duration.hpp(124): error: > expected an expression > && (boost::is_convertible<Rep, > ^ > > compilation aborted for ..\network\pnet.cpp (code 2) > > call "C:\Program Files > (x86)\Intel\ComposerXE-2011\bin\intel64//iclvars.bat" > nul > icl @"bin\intel-win\release\threading-multi\pnet.obj.rsp" > > ...failed compile-c-c++ bin\intel-win\release\threading-multi\pnet.obj... > ...failed updating 1 target... > > > Any suggestions welcome. > > Thanks > /Bo > Yes, I get this error too. The latest beta from Intel still exhibits this problem, but I currently do not have any insight on how to fix this. Perhaps you could create a bug report. Edward

1 0

does composite_key_compare support an interface that enables comparsion of the whole tuple
by brijesh.sharma＠thomsonreuters.com 14 Jun '11

14 Jun '11

Hi, Here is what I am trying to do typedef DWORD DSIid; enum DSType { DSTypeNone = 0, DSTypeBegin, DSTypeRoot } struct SDSIOwnedByKey { SDSIOwnedByKey(DSType DSTypeOwned, DSIid DSIidOwned, DSType DSTypeOwner, DSIid DSIidOwner) : m_DSTypeOwned(DSTypeOwned), m_DSIidOwned(DSIidOwned), m_DSTypeOwner(DSTypeOwner), m_DSIidOwner(DSIidOwner) { } bool operator == (const SDSIOwnedByKey &rcComp) const { return m_DSTypeOwned == rcComp.m_DSTypeOwned && m_DSIidOwned == rcComp.m_DSIidOwned && m_DSTypeOwner == rcComp.m_DSTypeOwner && m_DSIidOwner == rcComp.m_DSIidOwner; } DSType m_DSTypeOwned; DSIid m_DSIidOwned; DSType m_DSTypeOwner; DSIid m_DSIidOwner; }; class DataStore { typedef boost::multi_index_container< SDSIOwnedByKey, boost::multi_index::indexed_by< boost::multi_index::ordered_unique<boost::multi_index::tag<ByOwnedTypeOw nerTypeOwnerIdOwnedId>, boost::multi_index::composite_key<SDSIOwnedByKey, boost::multi_index::member<SDSIOwnedByKey, DSType, &SDSIOwnedByKey::m_DSTypeOwned>, boost::multi_index::member<SDSIOwnedByKey, DSType, &SDSIOwnedByKey::m_DSTypeOwner>, boost::multi_index::member<SDSIOwnedByKey, DSIid, &SDSIOwnedByKey::m_DSIidOwner>, boost::multi_index::member<SDSIOwnedByKey, DSIid, &SDSIOwnedByKey::m_DSIidOwned> >, boost::multi_index::composite_key_compare<std::less<DSType>,std::less<DS Type>, std::less<DSIid>, std::greater<DSIid>> > > > TOwnedBySort; typedef typename TOwnedBySort::index<ByOwnedTypeOwnerTypeOwnerIdOwnedId>::type OwnedBySort_ByOwnedTypeOwnerTypeOwnerId; TOwnedBySort m_oOwnedBySort; }; Instead of >, boost::multi_index::composite_key_compare<std::less<DSType>,std::less<DS Type>, std::less<DSIid>, std::greater<DSIid>> I want to write a compare function that compared all the values in one function, like a complete record comparison something like >, boost::multi_index::composite_key_compare<SDSIOwnedByKey> And have an appropriate function which would get the whole record to compare Thanks Brijesh

2 1

[Boost Serialization] Problem serializing derived class declared in DLL
by kmdarkmaster 13 Jun '11

13 Jun '11

Dear Boost community, My problem is simple : I need to serialize a derived class (named Plugin) of a c++ class (named Base) in my main program. The derived class Plugin is declared in a DLL which is load explicitely during execution. I tried to use the macro BOOST_CLASS_EXPORT_GUID (as in the doc), this works perfectly if the derived class is in the main execution, but will give me an exception if the derived class is in the plugin DLL. Forgive me if the problem is too obvious, this is my first time using Boost and I'm still a big noob in c++. Here is my code : IN THE MAIN EXECUTION : Class Base (parent class) : Base.h : #pragma once; #include "boost\serialization\access.hpp" #include <boost\serialization\nvp.hpp> class Base { private: friend class boost::serialization::access; template void serialize(Archive & ar, const unsigned int version){} public: int a, b; Base(); virtual ~Base() { } virtual void func()= 0; // this is an abstract base class } Base.cpp: #include "StdAfx.h" #include "Base.h" Base::Base(){ a=0; b=0; } IN THE DLL (loaded explicitely) Class Plugin (Child Class) : Plugin.h: #pragma once #include "boost\serialization\access.hpp" #include <boost\serialization\nvp.hpp> #include "boost\serialization\export.hpp" #include "Base.h" class Plugin: public Base { private: friend class boost::serialization::access; template void serialize(Archive & ar, const unsigned int version){ ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(Base); ar & BOOST_SERIALIZATION_NVP(a); ar & BOOST_SERIALIZATION_NVP(b); } public: virtual void func(); }; BOOST_CLASS_EXPORT_GUID(Plugin, "Plugin") Plugin.cpp: #include "StdAfx.h" #include "Plugin.h" void Plugin::func(){ a= 5; b= 6; } THE MAIN FUNCTION (IN THE MAIN EXECUTION): ....................................... HINSTANCE hinst= LoadLibrary(L"monDLLdynamique.dll"); if (hinst) { CreatePlugin ctor= (CreatePlugin)GetProcAddress(hinst, "CreatePlugin"); Base *test= ctor(); std::ofstream ofs3("FichierPointeursDerivedDLL.xml"); { boost::archive::xml_oarchive oa(ofs3); oa << BOOST_SERIALIZATION_NVP(test); } ofs3.close(); delete test; // calls Plugin's dtor FreeLibrary(hinst); } ............................................ Any help will be very very appreciated !!! Thanks -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Serialization-Problem-serializing-… Sent from the Boost - Users mailing list archive at Nabble.com.

5 10

OSCON 2011
by Robert Ramey 13 Jun '11

13 Jun '11

http://www.oscon.com/oscon2011 I wonder if in the interest of evangilizing C++/etc. anyone would be interested in exhibiting on behalf of boost here? Robert Ramey

1 0

[chrono] Can not build with intel-win
by Bo Jensen 13 Jun '11

13 Jun '11

Newest intel C++ release and vs2010, can not build with chrono from trunk. I get : pnet.cpp ..\..\..\external\boost\boost/chrono/duration.hpp(94): error: expected an expression && (boost::is_convertible<Rep2, ^ ..\..\..\external\boost\boost/chrono/duration.hpp(124): error: expected an expression && (boost::is_convertible<Rep, ^ compilation aborted for ..\network\pnet.cpp (code 2) call "C:\Program Files (x86)\Intel\ComposerXE-2011\bin\intel64//iclvars.bat" > nul icl @"bin\intel-win\release\threading-multi\pnet.obj.rsp" ...failed compile-c-c++ bin\intel-win\release\threading-multi\pnet.obj... ...failed updating 1 target... Any suggestions welcome. Thanks /Bo

2 1

[Smart Pointers] enable_shared_from_this::shared_from_this() behaviour query
by eddyaod＠gmail.com 13 Jun '11

13 Jun '11

shared_from_this() throws bad_weak_ptr if it's called in a derived destructor even if the object is heap allocated, does anyone know if this is intended? And if so, why? Example: class DestructorCheck : public std::tr1::enable_shared_from_this <DestructorCheck> { public: DestructorCheck() { } ~DestructorCheck() { shared_from_this(); } }; BOOST_AUTO_TEST_CASE(enable_weakTests) { BOOST_CHECK_THROW( { DestructorCheck d; } , std::tr1::bad_weak_ptr ) BOOST_CHECK_NO_THROW( { std::tr1::shared_ptr<DestructorCheck> d = boost::make_shared<DestructorCheck>(); } ) }

2 2

intrusive_ptr and multi-threading
by Andrej van der Zee 13 Jun '11

13 Jun '11

Hi, I am looking for an efficient way to use boost::intrusive_ptr in a multi-threaded application. In the source-tree I encountered the macro BOOST_INTERLOCKED_INCREMENT/DECREMENT. Should I use these too and how are these implemented in Linux? Where can I find documentation on these macros? Thank you, Andrej

2 4