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

Re: [Boost-users] [interprocess] shared_memory_object constructor with create_only parameter
by Philipp Hamann 28 Jan '10

28 Jan '10

Hi all, I am sorry. I made a mistake. My first problem is solved. It is not a bug. > I have some problems using the shared_memory_object constructor with the > create_only parameter. > The goal is to allow only one process to write to the shared memory. So > I create a shared_memory_object with the create_only parameter. For the > first process this is successful (as I assumed), but for the second > process (same parameters) this is successful, too (not as I assumed). > The documentation of boost says that it should throw an exception, if > the shared memory is allready created. Is this a bug or a misuse or > understanding of the library? But the second problem concerning shared_memory_object::remove(const char* name) is still present. > I realized another problem. If I call the static function > shared_memory_object::remove(const char* name), the memory should be > removed only when no further process has access to the memory. This > seems also not to work. I did the following: > 1. create shared memory for writing. > 2. open shared memory for reading > 3. shared_memory_object::remove(const char* name) (from the reading > process) > 4. reopen the shared memory for reading -> exception: can not find the file Thanks for your help and apoligizes for bothering you with my first problem. Philipp

2 4

serialization: pointer reconstruction
by Noah Roberts 27 Jan '10

27 Jan '10

A while back I asked about saving a pointer to an item in another class that is stored as a direct instance variable (no pointer). Here's a brief illustration: struct A { }; struct B { A a; }; struct C { A * a; // points to a B::a. }; I have an idea how to store and restore these relationships but I'd like to see if there are any improvement ideas and/or direction to existing behavior I'm not seeing in the documentation. My idea is to first store B::a (which simply makes sense in my problem anyway) and when I do this to call some custom support functions to generate a unique ID for the object at that address and store it first, then the rest of the data in A. This would appear in A::serialize and the unique ID would be stored in the Archive (added behavior) as a map from address to uid. Then when storing C I would request the unique ID for the address the pointer stores and store it. On reading I read B::a first and it sort of reverses the process. The uid is read and then A::serialize stores the uid and 'this' in the archive map in a uid->address format. I then read the uid on reading C::a and request the address from the archive using that value. I've already subclassed the Archive in order to pass around other load information needed by classes that didn't have local copies, so that's the easy part (though it wasn't a straight forward operation). The question I have though is that since the pointer archiving already must use some similar type of API, can I use it instead of rolling my own and how would I do that?

2 3

Issues with unnamed enums
by Kyle Altendorf 27 Jan '10

27 Jan '10

I have just tried to use Boost for the first time and it appears to not take kindly to unnamed enums from another library I use and (once those were named) some Microsoft SDK. I am using: Windows XP SP3 Visual Studio 2008 SP1 Boost 1.41.0 More specifically, after adding '#include <boost/foreach.hpp>' I started getting compilation errors such as: 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\korvis\korvislibs\khmilib\kvdisplay.h(18) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2143: syntax error : missing ',' before 'constant' kvdisplay.h(18) is the definition of an unnamed enum in another library I use. iterator_facade.hpp(43) is (including comments before it): > // This forward declaration is required for the friend declaration > // in iterator_core_access > template <class I, class V, class TC, class R, class D> class iterator_facade; I went through and named a each of the unnamed enums as the compiler referenced them until I got to an issue with shlwapi.h from a Microsoft SDK. Here's the complete compiler error list at that point: 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\program files\microsoft sdks\windows\v6.0a\include\shlwapi.h(1550) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : error C2143: syntax error : missing ',' before 'constant' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(479) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(479) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\program files\microsoft sdks\windows\v6.0a\include\shlwapi.h(1550) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(479) : error C2143: syntax error : missing ',' before 'constant' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(484) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(484) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(485) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(485) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(487) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(487) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(488) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(488) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(489) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(489) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(490) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(490) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(494) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(494) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(501) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(508) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(43) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(566) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(566) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\program files\microsoft sdks\windows\v6.0a\include\shlwapi.h(1550) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(566) : error C2143: syntax error : missing ',' before 'constant' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2988: unrecognizable template declaration/definition 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2059: syntax error : 'constant' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2065: 'V' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2065: 'TC' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2065: 'R' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(567) : error C2065: 'D' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(572) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(572) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\program files\microsoft sdks\windows\v6.0a\include\shlwapi.h(1550) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(573) : error C2065: 'V' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(573) : error C2065: 'TC' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(573) : error C2065: 'R' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(573) : error C2065: 'D' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(574) : error C2334: unexpected token(s) preceding '{'; skipping apparent function body 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(721) : error C3855: 'boost::iterator_facade': template parameter '__formal' is incompatible with the declaration 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(721) : error C2977: 'boost::iterator_facade' : too many template arguments 1> c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(601) : see declaration of 'boost::iterator_facade' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(724) : error C2332: 'class' : missing tag name 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(724) : error C2011: '<unnamed-tag>' : 'enum' type redefinition 1> c:\program files\microsoft sdks\windows\v6.0a\include\shlwapi.h(1550) : see declaration of '<unnamed-tag>' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(724) : error C2143: syntax error : missing ',' before 'constant' 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(725) : error C2065: 'V' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(725) : error C2065: 'R' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(725) : error C2065: 'TC' : undeclared identifier 1>c:\korvis\boost\include\boost\iterator\iterator_facade.hpp(726) : fatal error C1903: unable to recover from previous error(s); stopping compilation Am I correct that the unnamed enums are somehow causing the problem? Any help you can offer understanding or resolving this issue would be greatly appreciated. Thanks for your time, -kyle

2 2

Query re connected components in the Boost Graph Library
by Christopher Henrich 27 Jan '10

27 Jan '10

The connected_components function in the BGL returns the connected component information in a "ComponentMap," in which the value for node i is the number c[i] of the component containing that node. Is the sequence of component numbers "restricted growth" ? That is, can I assume that c[0] = 0 and for i > 0, c[i] <= 1 + max(c[0], ..., c[i-1])? It would appear that this would be true, as a consequence of the easiest way to use depth-first search to find the components. And a brief attempt to read the source code encourages me to believe it. But I may not have understood the source code. And I do not find it stated in the boost documentation, nor in /The Boost Graph Library/. Thanks in advance for clarification on this point. Christopher Henrich chenrich(a)monmouth.com mathinteract.com

1 0

[thread] Is a call to interrupt_all blocking?
by Sachin Garg 27 Jan '10

27 Jan '10

Does a call to interrupt_all blocks the calling thread, waiting for all threads to be interrupted? Or is it supposed to return immediately and let the threads hit their interruption points later? I have a thread_group and I want to call interrupt_all to stop all threads in the group from 'within' one of the threads in that group. This would be possible only if interrupt_all in not blocking, otherwise I will need to somehow signal some other thread to do the interrupt_all on that group. SG

4 8

Question on grammar
by Manjunath Kudlur 27 Jan '10

27 Jan '10

I am sure this has been asked before, but I am not able to find an answer to my specific question in the archives. I wanted to create a grammar that can accept statements like if_(expr)[ statement-list ].else_[statement-list]. I created a if_expr type using proto::extends, and added a member called else_ to it, of type proto::function<proto::terminal<if_then_else>, Expr const&>. The code is given below. I am trying to match statements of the above form. Look for if_only_grammar and if_grammar below. The main function has 2 cases, one with just if_ and another with if_ and else_. My grammar matches neither of them. What am I doing wrong? I am quite the newbie to proto, so I am not still able to parse the compiler error message and understand it yet. I will be grateful for any help. Thanks, Manjunath #include <boost/proto/proto.hpp> #include <boost/mpl/bool.hpp> #include <boost/mpl/assert.hpp> #include <iostream> #include <sstream> #include <string> using namespace boost; using namespace std; unsigned int ids; template<typename VT> struct Var { unsigned int id; Var() { id = ++ids; } }; struct if_fun {}; struct program {}; struct if_then_else {}; struct if_domain; template <typename Expr> struct if_expr : proto::extends<Expr, if_expr<Expr>, if_domain> { typedef proto::extends<Expr, if_expr<Expr>, if_domain> base_type; using base_type::operator =; typedef typename proto::result_of::make_expr<proto::tag::function, if_then_else, Expr const &>::type else_type; else_type else_; if_expr(Expr const &e = Expr()) : base_type(e) , else_(proto::make_expr<proto::tag::function>(if_then_else(), boost::ref(e))) {} }; struct if_domain : proto::domain<proto::generator<if_expr> > { }; struct napl_grammar; struct arith_expr_grammar; struct rel_expr_grammar; struct assign_grammar; struct statement_grammar; struct bb_grammar; struct if_only_grammar : proto::or_< proto::subscript<proto::function<if_expr<proto::terminal<if_fun>::type>, rel_expr_grammar >, bb_grammar> > { }; struct if_grammar : proto::or_< if_only_grammar, proto::subscript<proto::function<proto::terminal<if_then_else>, if_only_grammar>, bb_grammar> > { }; struct arith_expr_grammar : proto::or_< proto::plus< arith_expr_grammar, arith_expr_grammar>, proto::minus< arith_expr_grammar, arith_expr_grammar>, proto::multiplies< arith_expr_grammar, arith_expr_grammar>, proto::divides< arith_expr_grammar, arith_expr_grammar>, proto::terminal<Var<int> >, proto::terminal<int>, rel_expr_grammar > { }; struct rel_expr_grammar : proto::or_< proto::less< arith_expr_grammar, arith_expr_grammar>, proto::greater< arith_expr_grammar, arith_expr_grammar>, proto::less_equal< arith_expr_grammar, arith_expr_grammar>, proto::greater_equal< arith_expr_grammar, arith_expr_grammar>, proto::equal_to< arith_expr_grammar, arith_expr_grammar>, proto::not_equal_to< arith_expr_grammar, arith_expr_grammar>, proto::logical_not< rel_expr_grammar> > { }; struct assign_grammar : proto::or_< proto::assign<proto::terminal<Var<int> >, arith_expr_grammar>, proto::assign<proto::terminal<Var<int> >, rel_expr_grammar> > { }; struct statement_grammar : proto::or_< assign_grammar, if_grammar > { }; struct bb_grammar : proto::or_< statement_grammar, proto::comma<bb_grammar, statement_grammar> > { }; struct napl_grammar : proto::or_< proto::terminal<program>, proto::subscript<proto::terminal<program>, bb_grammar> > { }; template<typename Expr> void check_and_execute(const Expr &e, mpl::true_) { cout << "Program printer TBD.\n"; } template<typename Expr> void check_and_execute(const Expr &e, mpl::false_) { cout << "Should not be here\n"; } template<typename Expr> void check_grammar(const Expr &e) { BOOST_MPL_ASSERT_MSG((proto::matches<Expr, napl_grammar>::value), SYNTAX_NOT_CORRECT, (void)); check_and_execute(e, proto::matches<Expr, napl_grammar>()); //cout << napl_grammar()(e) << "\n"; } int main() { proto::terminal<Var<int> >::type i1, i2, i3, i4, i5; proto::terminal<program>::type Program; if_expr<proto::terminal<if_fun>::type> if_; int i=4242; check_grammar( Program[ if_(i1 < i2) [ i2 ] ]); /* check_grammar( Program[ if_(i1 < i2) [ i2 ].else_[ i3 ] ]); */ }

2 2

[multi_index] modify_key with an iterator to composite_key
by Christian Holmquist 27 Jan '10

27 Jan '10

Hi, >From what I've found on the net (here: http://groups.google.com/group/boost-list/browse_thread/thread/687ce9662a4c…) about this problem, Joaquin explains that modify_key on a composite_key isn't supported. Relevant part from that thread is: When you use modify_key, you modifier functor is passed > *the key* rather than the whole element as is the case > with modify. In this particular situation, the key is > a composite key; so the key object (defined privately > by composite_key) is some entity that somehow references > entry::m_x and entry::m_y. This object is not exposed > to the public and you're not supposed to try to use > it or modify it, hence the problems you're seeing. > In short, when using composite_key you cannot use > modify_key. The alternative must be to use modify() instead, so I'd like to know how to get the best performance in the following scenario: My index is specified as. namespace bmi = boost::multi_index; struct Index : boost::mpl::vector2 < bmi::hashed_unique<bmi::member<Entry, std::string, &Entry::m_Name> >, bmi::ordered_non_unique < bmi::composite_key < Entry, bmi::member<Entry, int, &Entry::m_State>, bmi::member<Entry, int, &Entry::m_Timestamp> > > > {}; I frequently updated Entry::m_State and Entry::m_Timestamp, but never Entry::m_Name during the lifetime of an entry, thus I expected modify_key to be faster since the expensive hash index don't need to be updated. Since I cannot tell modify() which parts of the Entry I'm about to update, I don't see how I can avoid the rehashing. Maybe there's a better way to configure the index? I'm using Entry::m_State for an equal_range() search, while Entry::m_Timestamp is only for ordering (I bump the timestamp everytime I change m_State). I am using boost.1.35 btw Any response much appreciated, Christian

3 4

Is it possible to sort the vertices in adjacency_list ?
by Konstantin Silav 27 Jan '10

27 Jan '10

Hi, we have a graph with bundled properties for vertices, edges and graph it self. The vertices have X and Y Cartesian coordinates. Now I'd like to SORT them along one of the axis. Is it possible to do it "inside" the graph? Which container should i choose? Custom one? Does this change the edge mapping? Or do I need to copy the vertices in one external container? Thanks in advance!

1 0

Designing a table-like data structure with Fusion
by Matthias Vallentin 27 Jan '10

27 Jan '10

I am in the process of designing a table-like data structure and would like to hear your feedback on the choice of Fusion for this task. In the context of databases, a table contains multiple columns that exhibit different types (short, unsigned int, long long, etc...). Columns must be added at runtime. The table is column-oriented in that it stores each column individually, yet provides a row-oriented interface to add data. The table structure (aka. schema) remains immutable once all columns have been added. To benefit from the heterogeneous nature of Fusion, I would consider a table row a fusion::vector, maybe created using fusion::vector_tie from some arbitrary data. At the very high level, I think of something along the lines of: template <typename T> struct column { void write(const T& x) { // Store x in some fashion (memory or disk). } }; struct table { --> fusion::vector<???> cols; template <typename C> void add_column(C* c) { fusion::push_back(cols, c); } template<typename R> void write(const R& row) { // Writer simply calls c->write(x). fusion::for_each(fusion::zip(row, cols), writer()); } }; int main() { table t; ... auto* ic = new column<int>(); auto* dc = new column<double>(); t.add_column(ic); t.add_column(dc); ... } As you can see (at the mark -->), I need to cross at some point the compile-time/runtime boundary but I am having trouble designing that interface. Perhaps boost::variant might help here to bound the potential number of types? Any kind of thoughts are appreciated. Matthias -- Matthias Vallentin vallentin(a)icsi.berkeley.edu http://www.icir.org/matthias

2 2

BOOST_FUSION_ADAPT_STRUCT: non intrusive macro, get a fusion sequence of struct member types and member names
by Hicham Mouline 27 Jan '10

27 Jan '10

Hello, I am aware that it is planned to implement metafunctions that returned the list of member types of a struct, as well as members names, as fusion/mpl sequences. The macro uses some PP magic. My project has progressed that I think I need this feature to proceed. I may try my hand at implementing these features... Which files in boost/fusion are involved in the implementation of the macro? regards,

4 8

concise error messages
by Manjunath Kudlur 27 Jan '10

27 Jan '10

Hello, I wrote a small DSEL with proto. An example program can be found in the main function below. I use BOOST_MPL_ASSERT_MSG to check an expression against a grammar, and can make the compiler output a small string if the syntax is wrong. But I can do it only for the entire program. Is there a way to do finer grain grammar checking with proto? For example, I haven't defined the "<" operator for expressions, but when I use it in the DSEL code, I get 10 pages of error messages from g++, with the SYNTAX_NOT_CORRECT string somewhere. I would like to get somewhat more accurate than this. Any pointers? Thanks, Manjunath #include <boost/proto/proto.hpp> #include <boost/mpl/assert.hpp> #include <iostream> #include <sstream> #include <string> using namespace boost; using namespace std; unsigned int ids; template<typename VT> struct Var { unsigned int id; Var() { id = ++ids; } }; struct if_fun {}; struct program {}; struct VarName : proto::callable { typedef string result_type; template<typename T> result_type operator()(const Var<T> &v) { stringstream s; s << "V" << v.id; return string(s.str()); } result_type construct(string &l, string op, string &r) { return string(l + op + r); } result_type operator()(proto::tag::plus, string l, string r) { return construct(l, string(" + "), r); } result_type operator()(proto::tag::minus, string l, string r) { return construct(l, string(" - "), r); } result_type operator()(proto::tag::divides, string l, string r) { return construct(l, string(" / "), r); } result_type operator()(proto::tag::multiplies, string l, string r) { return construct(l, string(" * "), r); } result_type operator()(proto::tag::assign, string l, string r) { return string(construct(l, string(" = "), r) + string(";")); } result_type operator()(const int &x) { stringstream s; s << x; return string(s.str()); } result_type operator()(const if_fun&) { return string("if"); } result_type operator()(const program&) { return string("program"); } result_type operator()(proto::tag::function, string l, string r) { stringstream s; s << l << "(" << r << ")"; return string(s.str()); } result_type operator()(proto::tag::subscript, string l, string r) { stringstream s; s << l << " [\n"; s << r; s << "\n]\n"; return string(s.str()); } result_type operator()(proto::tag::comma, string l, string r) { stringstream s; s << l << "\n"; s << r; return string(s.str()); } }; struct napl_grammar; struct expr_grammar; struct bb_grammar; struct if_grammar : proto::or_< proto::when<proto::terminal<if_fun>, VarName(proto::_value)>, proto::when<proto::function<proto::terminal<if_fun>, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), if_grammar(proto::_left), expr_grammar(proto::_right))> > { }; struct expr_grammar : proto::or_< proto::when<proto::plus< expr_grammar, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), expr_grammar(proto::_left), expr_grammar(proto::_right))>, proto::when<proto::minus< expr_grammar, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), expr_grammar(proto::_left), expr_grammar(proto::_right))>, proto::when<proto::multiplies< expr_grammar, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), expr_grammar(proto::_left), expr_grammar(proto::_right))>, proto::when<proto::divides< expr_grammar, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), expr_grammar(proto::_left), expr_grammar(proto::_right))>, proto::when<proto::assign< proto::terminal<Var<int> >, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), expr_grammar(proto::_left), expr_grammar(proto::_right))>, proto::when<proto::terminal<Var<int> >, VarName(proto::_value)>, proto::when<proto::terminal<int>, VarName(proto::_value)>, proto::when<proto::subscript<if_grammar, bb_grammar>, VarName(proto::tag_of<proto::_expr>(), if_grammar(proto::_left), bb_grammar(proto::_right))> > { }; struct bb_grammar : proto::or_< proto::when<expr_grammar, expr_grammar(proto::_expr)>, proto::when<proto::comma<bb_grammar, expr_grammar>, VarName(proto::tag_of<proto::_expr>(), bb_grammar(proto::_left), expr_grammar(proto::_right))> > { }; struct napl_grammar : proto::or_< proto::when<proto::terminal<program>, VarName(proto::_value)>, proto::when<proto::subscript<proto::terminal<program>, bb_grammar>, VarName(proto::tag_of<proto::_expr>(), napl_grammar(proto::_left), bb_grammar(proto::_right))> > { }; template<typename Expr> void check_grammar(const Expr &e) { BOOST_MPL_ASSERT_MSG((proto::matches<Expr, napl_grammar>::value), SYNTAX_NOT_CORRECT, (void)); cout << napl_grammar()(e) << "\n"; } template<typename Expr> void check_if_grammar(const Expr&) { BOOST_MPL_ASSERT_MSG((proto::matches<Expr, if_grammar>::value), IF_SYNTAX_NOT_CORRECT, (if_grammar)); } template<typename Expr> void check_expr_grammar(const Expr &e) { BOOST_MPL_ASSERT_MSG((proto::matches<Expr, expr_grammar>::value), EXPR_SYNTAX_NOT_CORRECT, (expr_grammar)); cout << expr_grammar()(e) << "\n"; } template<typename Expr> void check_bb_grammar(const Expr &e) { BOOST_MPL_ASSERT_MSG((proto::matches<Expr, bb_grammar>::value), BB_SYNTAX_NOT_CORRECT, (bb_grammar)); cout << bb_grammar()(e) << "\n"; } int main() { proto::terminal<Var<int> >::type i1, i2, i3, i4, i5; proto::terminal<program>::type Program; proto::terminal<if_fun>::type if_; check_grammar( Program[ i2 = 1 + i2, i3 = i3 * i3, i3=i4/i4, i3=i5-23, if_(i1) [ i2=1, i2, if_(i2) [ i3=1, i3=i5, if_(i3) [ i1=1, i4=42+i4 ] ] ] ] ); /* check_if_grammar( if_(i1)); check_bb_grammar((i4=i1+i2+42, i2=2, i3=i2/42, if_(i1)[i2=3, i3=0])); */ }

4 4

Newbie: Compiling Boost 1.28.0 or later for 64-bit Solaris 10
by Gregory Tyler 27 Jan '10

27 Jan '10

Hi, I'm new to Boost, and I have not used C++ in years. I have been asked to determine whether Boost 1.28.0 (or a later version, if necessary) can be compiled for 64-bit Solaris 10, and if so, then what precautions must be taken. I found this page, which seems to suggest that Boost cannot currently be compiled for Solaris 10: http://groups.google.com/group/boost-list/browse_thread/thread/091716aaf543… On the other hand, this page seem to suggest that it is possible: http://shoaibmir.wordpress.com/2009/08/12/building-boost-under-solaris/ Does anyone have any advice or suggestions? If it matters, I have a Java/JEE background. Thanks in advance, Greg _________________________________________________________________ Hotmail: Trusted email with Microsoft’s powerful SPAM protection. http://clk.atdmt.com/GBL/go/196390706/direct/01/

2 1

[libboost_mpi-vc90-mt-gd-1_40 . lib]Where can I get this library?
by Juliet Villanueva 27 Jan '10

27 Jan '10

Hi: I am trying to configure MPI boost, when you finish all the steps that come within the documentation, and try to compile a simple example, visual compiler tells me that the library lacks libboost_mpi-vc90-mt-gd-1_40 . lib, which is not where you get, I already have installed JAM on my computer, along with the installation of MPI and MPICH2 Boost, recognizes all of MPI include, with out any problem, it only takes me that library, I hope I can help. Tania. Encuentra las mejores recetas en Yahoo! Cocina. http://mx.mujer.yahoo.com/cocina/

2 1

help
by sebastian cheung 27 Jan '10

27 Jan '10

where to begin? I think I have downloaded Boost 1_40 zip, not sure how to start anything with it or do useful appplications? Help

3 3

Re: [Boost-users] C++ and quality of software
by Kenneth Laskoski 26 Jan '10

26 Jan '10

I risk keeping on spamming, but anyway, here are some words from inside Google. Sean Parent once worked at Adobe, where it acted as Adobe Source ibraries developer. ASL is a fine library that I often use as a complement to boost. He recently (Oct 2009) wrote in the asl-devel mailing list: <citation> I'm now at Google working on ChromeOS. The Google style guide (adhered to by most of Google) has made it a bit difficult for me to spend too much time on ASL. [...] Some of the more challenging parts are - limited use of Boost, no exception handling, and discouraged copy and assignment. Right now I feel like I'm coding with one hand behind my back </citation> I think that style guide is pretty phased out by now, almost twelve years after the C++98 Standard. Yours, Kenneth

1 0

Thread-safe singleton pattern
by Andrew Chinkoff 26 Jan '10

26 Jan '10

Having considered [ http://www.research.ibm.com/designpatterns/pubs/ph-jun96.txt] I propose singleton implementation. I had attached "singleton.hpp" to this letter. Below is the test program: #include <stdio.h> #include <singleton.hpp> class A : public boost::Singleton<A> { // // Only Singleton class can create and delete us! // SINGLETON_IS_MY_FRIEND; public: void foo(){ printf("foo!\n"); } A(){ printf("A()\n"); } ~A(){ printf("~A()\n"); } }; void main() { // It is not compiled: //A a = A::Instance(); // That is exactly as it should be used: A::Instance().foo(); } Test program outputs: A() foo! ~A() Does Boost community think that boost::Singleton is convenient solution?

2 1

[boost-users][propertytree] How to access xml attributes.
by Germán Diago 26 Jan '10

26 Jan '10

Hello. I've been reading the docs for boost.ptree and I couldn't find how to access xml attributes. I just found how to access the text for the elements. Is it possible to access attributes? Thanks in advance.

1 0

[function] rare crash on destroy
by Igor R 26 Jan '10

26 Jan '10

Hello, In my application I use to "post" a pointer to a dynamically allocated boost::function to a hidden window in the following manner (WinXP, MSVC9.0, 1.41): typedf function<void(void)> Functor; #define AM_FUNCTOR (WM_USER+79) // called from some "worker" thread void post(const Functor &func) { Functor *f = new Functor(func); PostMessage(hWind_, AM_FUNCTOR, 0, reinterpret_cast<LPARAM>(f)); } // Window procedure, called from the window thread LRESULT CALLBACK WndProc(HWND hwnd, UINT msg, WPARAM wParam, LPARAM lParam) { switch(msg) { case AM_FUNCTOR: { Functor *f = reinterpret_cast<Functor *>(lParam); (*f)(); delete f; } //.... } post() is called several times per second. Sometimes - but *very* rarely - the line "delete f" causes a crash (Access violation reading location 0xfeeefef6). The application is compiled with /Ox /GL, linked with /LTCG. What could be wrong with this code? Callstack: function_base.hpp, line 323: functor_manager_common::manage_small(): reinterpret_cast<functor_type*>(&out_buffer.data)->~Functor(); // THIS LINE CRASHES function_base.hpp, line 432: functor_manager::manage(): manager(in_buffer, out_buffer, op, tag_type()); The assembly code looks like this: 100134C9 mov esi,dword ptr [esi+0Ch] 100134CC test esi,esi 100134CE je boost::detail::function::functor_manager_common::manage_small+9Eh 100134D0 mov eax,dword ptr [esi] 100134D2 mov ecx,dword ptr [eax+8] // CRASHES HERE, as eax == 0xfeeefeee 100134D5 push esi 100134D6 call ecx Thanks in advance.

3 6

multi_index_container assertion after crash
by Eli Zakashansky 26 Jan '10

26 Jan '10

Hi, I have an application which uses a persistent multi_index_container (I am using bip::managed_mapped_file && after openning the file I do "container = mappedFile->find_or_construct(...)"). I have an interesting behavior when my process crashes/stopped during massive use of the multi_index_container after the process restarts I don't experience any problems reading or inserting new elements to the container but if I try to erase elements or call mutli_index_container::clear (Debug mode only BOOST_MULTI_INDEX_ENABLE_SAFE_MODE is defined) an assertion pops up (safe_mode::Check_same_owner / safe_mode::Check_valid_iterator). At first I thought that this kind of assertion fails due to concurrency issue, but it is not the case (I verified that this data structure is not accessed from more than one thread at a time, during this time the container is locked). Does anyone has any idea what can cause this situation? Or has a resolution ? Thanks a lot in advance, Eli.

5 16

Tracking down a race condition
by Stephen Torri 26 Jan '10

26 Jan '10

In the logging example I have been working on to learn more about boost threads I have run across what I think is a race condition. If I compile and run this sample program it will sometimes write out an error message to a file. For example: 2010-01-23_16:2:23 (pid=10948 thread_id=0x92ce448) (II) funky Other times I see the file is blank. So can I say conclusively that its a race condition? No. Either what is happening is a race condition where the file is closed before the contents are written to the file or something else is causing the logging message to be written sometimes and not at others. So to recap: --- How can you track down a race condition? --- Can I use 'strace' or 'gdb'? Stephen ------------------------------------------- #include <boost/cstdint.hpp> #include <boost/shared_ptr.hpp> #include <boost/thread/mutex.hpp> #include <boost/thread/condition_variable.hpp> #include <boost/thread/thread.hpp> #include <boost/utility.hpp> #include <boost/thread/once.hpp> #include <boost/scoped_ptr.hpp> #include <boost/type_traits/aligned_storage.hpp> #include <boost/bind.hpp> #include <boost/format.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <boost/cstdint.hpp> #include <fstream> #include <sstream> #include <vector> namespace myproject { namespace api { /*! * \brief Trace level constants * \date 2003 * \author Stephen Torri */ class TraceLevel { public: enum Values { NONE = 0, WARN = 10, ERROR = 20, INFO = 30, DEBUG = 40, DETAIL = 50, DATA = 60 }; }; } // namespace api } // namespace myproject namespace myproject { namespace interface { class ITraceable { public: typedef boost::shared_ptr<ITraceable> ptr_t; virtual std::string get_Formatted_String() = 0; virtual boost::uint32_t getLevel() = 0; virtual boost::uint32_t getPID() = 0; virtual boost::thread::id getThreadID() = 0; }; } // namespace interface } // namespace myproject namespace myproject { namespace trace { class StringTraceable : public interface::ITraceable { public: StringTraceable ( boost::uint32_t area, boost::uint32_t level, std::string name ) : m_area ( area ), m_level ( level ), m_name ( name ) { #ifndef WIN32 m_pid = getpid(); #else m_pid = GetCurrentProcessId(); #endif /* WIN32 */ m_thread_id = boost::this_thread::get_id(); } virtual ~StringTraceable(){} virtual std::string get_Formatted_String() { return m_name; } virtual boost::uint32_t getLevel() { return m_level; } virtual boost::uint32_t getPID() { return m_pid; } virtual boost::thread::id getThreadID() { return m_thread_id; } private: boost::uint32_t m_area; boost::uint32_t m_level; boost::uint32_t m_pid; boost::thread::id m_thread_id; std::string m_name; }; template <typename UnsignedType> class NumberTraceable : public interface::ITraceable { public: NumberTraceable ( boost::uint32_t area, boost::uint32_t level, std::string name, UnsignedType line ) : m_area ( area ), m_level ( level ), m_name ( name ), m_line ( line ) { #ifndef WIN32 m_pid = getpid(); #else m_pid = GetCurrentProcessId(); #endif /* WIN32 */ m_thread_id = boost::this_thread::get_id(); } virtual ~NumberTraceable(){} virtual std::string get_Formatted_String() { return m_name; } virtual boost::uint32_t getLevel() { return m_level; } virtual boost::uint32_t getPID() { return m_pid; } virtual boost::thread::id getThreadID() { return m_thread_id; } private: boost::uint32_t m_area; boost::uint32_t m_level; boost::uint32_t m_pid; boost::thread::id m_thread_id; std::string m_name; UnsignedType m_line; }; template <typename T> struct storage_for { boost::aligned_storage<sizeof(T), boost::alignment_of<T>::value> data; }; template <typename T> class Singleton : boost::noncopyable { public: static T& Instance() { boost::call_once ( init, m_flag ); return *m_obj; } static void init () { m_obj.reset ( new T() ); } protected: ~Singleton(){} Singleton(){} private: static boost::scoped_ptr<T> m_obj; static boost::once_flag m_flag; }; } // namespace trace } // namespace trace template <typename T> boost::scoped_ptr<T> myproject::trace::Singleton<T>::m_obj ( 0 ); template <typename T> boost::once_flag myproject::trace::Singleton<T>::m_flag = BOOST_ONCE_INIT; namespace myproject { namespace trace { class Trace_State_Utils { public: static std::string get_Level_String ( boost::uint32_t level ) { // Write message prefix if ( level == api::TraceLevel::WARN ) { return "(WW) "; } else if ( level == api::TraceLevel::ERROR ) { return "(EE) "; } else if ( level == api::TraceLevel::INFO ) { return "(II) "; } else if ( level == api::TraceLevel::DEBUG ) { return "(DEBUG) "; } else if ( level == api::TraceLevel::DETAIL ) { return "(DETAIL) "; } else if ( level == api::TraceLevel::DATA ) { return "(DATA) "; } else { // We should not be here abort(); } } }; /* Idea taken from http://www.codeproject.com/debug/xytrace.asp * (28 Jan 2002 - Xiangyang Liu) * * I have modified this so that we don't use varargs and use constant types */ class Trace_State { public: typedef boost::shared_ptr<Trace_State> ptr_t; Trace_State() : m_file_prefix ( "Trace" ) {} virtual ~Trace_State(); Trace_State ( std::string prefix ); void set_Trace_File_Prefix ( std::string name ); void set_Trace_Level ( boost::uint32_t level ); void set_Trace_Area_Mask ( boost::uint32_t mask ); void open_Trace_File ( void ); std::string get_ID_String ( void ); void close_Trace_File ( void ); boost::uint32_t get_Trace_Level ( void ) const; boost::uint32_t get_Trace_Area_Mask ( void ) const; bool is_Valid_Level ( boost::uint32_t lvl ); bool is_Valid_Area_Mask ( boost::uint32_t mask ); void write_Message ( interface::ITraceable::ptr_t trace ) { // Write ID m_log_stream << boost::format("%s (pid=%d thread_id=" ) % this->get_ID_String() % trace->getPID() << trace->getThreadID() << ") " << std::flush; m_log_stream << Trace_State_Utils::get_Level_String(trace->getLevel()) << trace->get_Formatted_String() << std::endl << std::flush; } private: std::string m_file_prefix; std::ofstream m_log_stream; }; } /* namespace trace */ } /* namespace trace */ namespace myproject { namespace trace { Trace_State::Trace_State( std::string prefix ) : m_file_prefix ( prefix ) {} Trace_State::~Trace_State() { this->close_Trace_File(); } void Trace_State::set_Trace_File_Prefix ( std::string name ) { } bool Trace_State::is_Valid_Level ( boost::uint32_t lvl ) { return true; } bool Trace_State::is_Valid_Area_Mask ( boost::uint32_t ) { return true; } void Trace_State::set_Trace_Level ( boost::uint32_t level ) { } void Trace_State::set_Trace_Area_Mask ( boost::uint32_t mask ) { } void Trace_State::open_Trace_File ( void ) { if ( ! m_log_stream.is_open() ) { // Create file name std::stringstream name; name << boost::format("%s_%s.txt") % m_file_prefix % this->get_ID_String(); std::string file_name = name.str(); m_log_stream.open ( file_name.c_str() ); } } std::string Trace_State::get_ID_String ( void ) { // Create id string std::stringstream name; // Get current time boost::posix_time::ptime now = boost::posix_time::second_clock::local_time(); std::tm tm_ref = boost::posix_time::to_tm ( now ); boost::gregorian::date today = now.date(); name << boost::format ( "%1%_%2%:%3%:%4%" ) % boost::gregorian::to_iso_extended_string ( today ) % tm_ref.tm_hour % tm_ref.tm_min % tm_ref.tm_sec; return name.str(); } void Trace_State::close_Trace_File ( void ) { if ( m_log_stream.is_open() ) { m_log_stream << std::flush; m_log_stream.close(); } } boost::uint32_t Trace_State::get_Trace_Level ( void ) const { return 0; } boost::uint32_t Trace_State::get_Trace_Area_Mask ( void ) const { return 0; } } /* namespace trace */ } /* namespace trace */ namespace myproject { namespace trace { // // Turn Trace into a singleton class that contains a worker thread // - Wait for data // - If data exists then process // - Else wait // Add method for adding a ITraceable object. This will lock the logging vector, add // element then signal the boost condition variable class Trace : public Singleton<Trace> { friend class Singleton<Trace>; public: ~Trace(); static void write_Trace ( boost::uint32_t area, boost::uint32_t level, std::string name ) { interface::ITraceable::ptr_t string_ptr ( new StringTraceable ( area, level, name ) ); Trace::Instance().add_Trace ( string_ptr ); } template <typename UnsignedType> static void write_Trace ( boost::uint32_t area, boost::uint32_t level, std::string format, UnsignedType value ) { interface::ITraceable::ptr_t unsigned_ptr ( new NumberTraceable<UnsignedType> ( area, level, format, value ) ); Trace::Instance().add_Trace ( unsigned_ptr ); } void add_Trace ( interface::ITraceable::ptr_t trace ); void set_Trace_Level ( boost::uint32_t level ); void set_Trace_Area_Mask ( boost::uint32_t mask ); void open_Trace_File (); void close_Trace_File(); private: Trace(); // Worker thread functions void threadMain(); void processTraces(boost::unique_lock<boost::mutex>& lock); // Synchronization variables boost::mutex m_lock; boost::condition_variable m_condition; // Data variables typedef std::vector < myproject::interface::ITraceable::ptr_t > QueueType; QueueType m_queue; // Thread variables boost::shared_ptr<boost::thread> m_thread; bool m_hasWork; // Logging Trace_State m_state; }; } /* namespace trace */ } /* namespace myproject */ namespace myproject { namespace trace { Trace::Trace () : m_hasWork ( true ), m_state ( "Trace" ) { // start thread m_thread = boost::shared_ptr<boost::thread> ( new boost::thread ( boost::bind ( &Trace::threadMain, this ) ) ); } Trace::~Trace() { // stop thread { boost::lock_guard<boost::mutex> lock ( m_lock ); m_hasWork = false; } m_condition.notify_one(); m_thread->join(); } void Trace::add_Trace ( interface::ITraceable::ptr_t trace ) { // lock queue { boost::lock_guard<boost::mutex> lock ( m_lock ); m_queue.push_back ( trace ); } m_condition.notify_one(); } void Trace::threadMain() { boost::unique_lock<boost::mutex> lock ( m_lock ); while ( m_hasWork ) { if ( m_queue.size() == 0 ) { m_condition.wait ( lock ); } else { this->processTraces(lock); } } } void Trace::processTraces(boost::unique_lock<boost::mutex>& lock) { assert ( lock.owns_lock() ); QueueType local_queue ( m_queue.begin(), m_queue.end() ); m_queue.clear(); lock.unlock(); for ( QueueType::iterator pos = local_queue.begin(); pos != local_queue.end(); pos++ ) { myproject::interface::ITraceable::ptr_t trace_obj = (*pos); m_state.write_Message ( trace_obj ); } lock.lock(); } void Trace::set_Trace_Level ( boost::uint32_t level ) { m_state.set_Trace_Level ( level ); } void Trace::set_Trace_Area_Mask ( boost::uint32_t mask ) { m_state.set_Trace_Area_Mask ( mask ); } void Trace::open_Trace_File() { m_state.open_Trace_File(); } void Trace::close_Trace_File() { m_state.close_Trace_File(); } } /* namespace trace */ } /* namespace myproject */ int main ( int, char** ) { namespace trace = myproject::trace; namespace api = myproject::api; trace::Trace::Instance().open_Trace_File(); myproject::interface::ITraceable::ptr_t tmp_ptr ( new trace::StringTraceable( 0, api::TraceLevel::INFO, "funky" ) ); trace::Trace::Instance().add_Trace ( tmp_ptr ); trace::Trace::Instance().close_Trace_File(); }

3 4

[chrono] v0.3.2 New frequency, lifetime and percentage stopwatch_accumulator features
by vicente.botet 26 Jan '10

26 Jan '10

Hi, I have update the Boost.Chrono library with some minor features, a lot of bug fixes, and started the tutorial with some examples of features interesting people since the last version. New Features: * Added overloading for operator/(Integer/Duration) (used to get the frequency) * Added frequency, lifetime and percentage to the stopwatch_accumulator. The default format is "%c times, sum%ss, min%ms, max%Ms, mean%as, frequency%fherzs, lifetime%ls, percentage=%p%\n", where %c : the counter of the number of times the pair start/stop has been called. %s : the sum of the samples of elapsed time between the call to start/stop. %m : the min of the samples of elapsed time between the call to start/stop. %M : the max of the samples of elapsed time between the call to start/stop. %a : the mean of the samples of elapsed time between the call to start/stop. %f : the frequency of calls to start. %l : the lifetime of the stopwatch_accumulator. %p : the percentage of time spent by this stopwatch respect to its lifetime. Bug Fixes * Specific formatters didn't work completly * Replace duration(0) by duration::zero() on template classes. * suspend didn't work: partial_ not initialized neither taken in account by the elapsed function. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. SVN repository http://svn.boost.org/svn/boost/sandbox/chrono. I would like to thanks particularly Andrew Chinkoff for his suggestion of the frequency feature and all those that have tried the library and reported the bugs they found, either on this ML or personally. I would really appreciate if people having the possibility to test on other platforms/compilers report me how the library works. As you can see the library is already on the review schedule, waiting for a review manager and a date for the review. I expect to add yet some features for the review release as thread clocks, and suspensible clocks i.e. clocks that can be suspended/resumed. Any idea for better naming the concepts/classes is welcome. Hoping this release works better for you, Vicente (See below the contents of preceding releases) ----- Original Message ----- From: "vicente.botet" <vicente.botet(a)wanadoo.fr> To: <boost-users(a)lists.boost.org>; <boost(a)lists.boost.org> Sent: Wednesday, January 20, 2010 11:02 PM Subject: [chrono] v0.3.1 Support for wide characters Hi, this new version includes: * Added support for wide characters on formatters. * Added chrono.hpp and stopwatches.hpp header files at the boost level. * Update of the doc taking care of preceding comments. Comments are welcome :) Best, Vicente ----- Original Message ----- From: "vicente.botet" <vicente.botet(a)wanadoo.fr> To: <boost(a)lists.boost.org>; <boost-users(a)lists.boost.org> Sent: Sunday, January 17, 2010 9:14 PM Subject: [chrono] v0.3 New Stopwatch Feature Hi, I'm pleased to announce the new version of the Boost.Chrono library. The implementaton is quite stable; the new interface could suffer of some modifications, renaming, ... as far as you submit some proposals. I would request a formal review soon and I will need a review manager. I know that review managers are hard to find, so if you are interested in the library, please the Review Wizards. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. I've tested it with gcc and MSVC. Previoous version of the library have been testted on Mac, but I'm not able to test this platform. Could someone check if there are some regressions on Mac? New Features: * Process cpu clocks * Independent process cpu clocks for real, user, system process CPU time * Global process cpu clock for real, user, system process CPU time * Stopwatch concept measuring elapsed time between different points in time associated to the operations start, stop, suspend and resume. * stopwatch is a model Stopwatch measuring the elapsed time between the start and the stop operations. * stopwatch_accumulator is a model Stopwatch allowing to accumulate several time samples and give the average, ... * Scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopwatch Formatter concept * stopwatch formatter "%ds\n" * stopwatch accumulator formatter "%c times, sum%ss, min%ms, max%Ms, mean%as\n" * time formatter "real %rs, cpu %cs (%p%), user %us, system %ss\n" * digital_time decomposition class separating days, hours,minutes,seconds, nanoseconds from any duration class (looking for a better name) * digital_time formatter "%d days(s) %h:%m:%s.%n\n" * stopwatch_reporter is a convenient generic class reporting elapsed time for the Stopwatch concept. * stopclock<Clock> shortcut stopwatch_reporter<stopwatch<Clcok>> * typeof registration for classes duration and time_point Depreceated Features: * The classes process_times, process_clock, process_timer, timer and run_timer are now deprecated as the preceding additions are more generic. However for backward compatibility they are preserved until inclusion of the library in Boost. Next follows the equivalences: timer<> ~ stopwatch<> process_timer ~ stopwatch<process_cpu_clock> run_timer ~ stopclock<> Bug Fixes * Try to correct warning C4251: 'boost::chrono::run_timer::m_format' : class 'std::basic_string<_Elem,_Traits,_Ax>' needs to have dll-interface to be used by clients of class 'boost::chrono::run_timer', by don't including inlines functions using the std::string m_format. For people that doesn't know it yet, Boost.Chrono library provides: * The C++0x Standard Library's common_type. * The C++0x Standard Library's compile-time rational arithmetic. * The C++0x Standard Library's time utilities, including: * Class template duration * Class template time_point * Clocks: * system_clock * monotonic_clock * high_resolution_clock * typeof registration for classes duration and time_point * Process clocks: * process_real_CPU_clocks, capturing real-CPU times. * process_user_CPU_clocks, capturing user-CPU times. * process_system_CPU_clocks, capturing system-CPU times. * process_cpu_clock, tuple-like class capturing at once real, user-CPU, and system-CPU times. * Stopwatches: * stopwatch, capturing elapsed Clock times. * stopwatch_accumulator, capturing cummulated elapsed Clock times. * scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopclocks or Stopwatch reporters: * stopwatch_reporter, convenient reporting of models of Stopwatch results. * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> Best regards, _____________________ Vicente Juan Botet Escribá

1 0

Boost::Asio - blocking read on socket does not disconnect when socket closed from other thread
by Nick Aschberger 25 Jan '10

25 Jan '10

Hi Folks, Boost version is 1.36, OS is linux rhel-4. I have an application with two threads. The secondary thread is a worker thread that manages a boost::asio tcp/ip socket. The worker thread performs blocking reads as per: try { boost::system::error_code error; boost::asio::read(mysocket, boost::asio::buffer(inputbuffer, size_to_read), boost::asio::transfer_all(), error); if(error) { throw boost::system::system_error(error); } } catch(boost::system::system_error se){ // log error here return false; } In the main application thread, in response to the user choosing to close the connection, I do: mysocket.cancel(); mysocket.close(); I would expect the worker thread to return from the blocking boost::asio::read call, with an error. This occurs on windows, but does not happen on the linux build of my app - it never returns from the above call. Why does the second thread never return? What am I doing wrong? I have considered: - implementing a timeout - but I don't want to move to async sockets. - It seems SO_RCVTIMEO, is wrapped by boost::asio::read, so no hope there. - I could kill the thread but that means it isn't cleaned up properly, so that is no good. What am I doing wrong? cheers Nick Aschberger

2 3

Boost 1.33.1 on 64-Bit Solaris/GNU gcc 3.4.6/BJam 3.1.11
by Gregory Tyler 25 Jan '10

25 Jan '10

Hi, I'm new to Boost, and I have not used C++ in years. I have been asked to determine whether Boost 1.33.1 can be compiled for 64-bit Solaris, and if so, then what precautions must be taken. I found this page, which seems to suggest that Boost cannot currently be compiled for Solaris 10: http://groups.google.com/group/boost-list/browse_thread/thread/091716aaf543… On the other hand, this page seem to suggest that it is possible: http://shoaibmir.wordpress.com/2009/08/12/building-boost-under-solaris/ With GNU gcc 3.4.6, I seem to have successfully built BJam 3.1.11, the version of Boost Jam which is contemporary with Boost 1.33.1. When I try to build Boost, I'm getting the following error: PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:1585: in find-compatible-subvariant *** argument error * rule split-target-subvariant ( target-var properties-var toolset-var variant-var : subvariant ) * called with: ( sv-target sv-properties sv-toolset sv-variant : <@boost!libs!serialization!build>libboost_serialization.a|gcc//<cxxflags>-Wno-non-virtual-dtor -Wno-ctor-dtor-privacy/<define>BOOST_LIB_DIAGNOSTIC=1/<sysinclude>PATH_TO_BOOST_HOME/<tag><prefix>-gcc-1_33_1/<address-model>default/<architecture>native/<build>yes/<debug-symbols>on/<inlining>off/<instruction-set>default/<object-model>default/<optimization>off/<profiling>off/<rtti>on/<runtime-link>dynamic/<shared-linkable>false/<target-type>LIB/<threading>single/<vtable-thunks>default|gcc| <@boost!libs!serialization!build>libboost_serialization.a|gcc/debug/<address-model>default/<architecture>native/<debug-symbols>on/<inlining>off/<instruction-set>default/<object-model>default/<optimization>off/<profiling>off/<rtti>on/<shared-linkable>false/<threading>single/<vtable-thunks>default/<cxxflags>-Wno-non-virtual-dtor -Wno-ctor-dtor-privacy/<define>BOOST_LIB_DIAGNOSTIC=1/<sysinclude>PATH_TO_BOOST_HOME/<tag><prefix>-gcc-d-1_33_1/<build>yes/<runtime-link>dynamic/<target-type>LIB|gcc|debug ) * extra argument <@boost!libs!serialization!build>libboost_serialization.a|gcc/debug/<address-model>default/<architecture>native/<debug-symbols>on/<inlining>off/<instruction-set>default/<object-model>default/<optimization>off/<profiling>off/<rtti>on/<shared-linkable>false/<threading>single/<vtable-thunks>default/<cxxflags>-Wno-non-virtual-dtor -Wno-ctor-dtor-privacy/<define>BOOST_LIB_DIAGNOSTIC=1/<sysinclude>PATH_TO_BOOST_HOME/<tag><prefix>-gcc-d-1_33_1/<build>yes/<runtime-link>dynamic/<target-type>LIB|gcc|debug PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:2032:see definition of rule 'split-target-subvariant' being called PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:1654: in link-libraries PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:1857: in generate-dependencies PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:1964: in subvariant-target PATH_TO_BOOST_HOME/tools/build/v1/boost-base.jam:2406: in stage Jamfile:226: in load-jamfiles PATH_TO_BOOST_HOME/tools/build/v1/bootstrap.jam:21: in boost-build PATH_TO_BOOST_HOME/boost-build.jam:16: in module scope Does this look familiar to anyone? What am I doing incorrectly? Thanks in advance, Greg _________________________________________________________________ Hotmail: Free, trusted and rich email service. http://clk.atdmt.com/GBL/go/196390708/direct/01/

2 1

[smart pointer] need .get() to access derived class method?
by Diederick C. Niehorster 25 Jan '10

25 Jan '10

Hi All, I am trying to wrap my head around using shared pointer, but I find the documentation hard to follow, not being a professional programmer. I have a base class, from which many classes are derived and I hold the derived class instance as a point of type baseclass. Usually, I only need access to the base class methods, but now i need to access some of the derived class's methods. How do I do that from a shared pointer? I now have some mix of shared_pointer and "old style" pointer logic in my code, what am I missing? --- _pcStim = boost::shared_ptr<CStim>(new CStimUniform2D()); // create derived instance and store as base CStim* pCStimU = _pcStim.get(); // get raw pointer ((boost::shared_ptr<CStimUniform2D>)(_pcStim))->setNPointGround()=300; // this does not work, what do I need here? ((CStimUniform2D*)pCStimU)->SetPointColor()=_pRoomData->dotColor(); // casting the raw pointer I am fine. --- Best regards and thank you for your reply, Diederick Niehorster

2 3

bjam with cross toolchain
by Pascal Kesseli 25 Jan '10

25 Jan '10

Hi everyone Currently, I am trying to get bjam compile boost using an embedded toolchain. The toolchain runs on windows, but the target is a linux device. The toolchain behaves more or less like a normal linux toolchian and I am using msys to simulate the shell environment. Trying to compile boost immediately issues the following errors: "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -g -mthreads -Winvalid-pch -DBOOST_ALL_NO_LIB=1 -DBOOST_BUILD_PCH_ENABLED -I"bin.v2\libs\math\build\gcc-3.3.2\debug\link-static\threading-multi\..\src \tr1" -I"." -I"libs\math\src\tr1" -c -o "bin.v2\libs\math\build\gcc-3.3.2\debug\link-static\threading-multi\ellint_2 f.o" "libs\math\build\..\src\tr1\ellint_2f.cpp" ...failed gcc.compile.c++ bin.v2\libs\math\build\gcc-3.3.2\debug\link-static\threading-multi\ellint_2f .o... gcc.compile.c++ bin.v2\libs\math\build\gcc-3.3.2\debug\link-static\threading-multi\ellint_3f .o cc1plus: error: invalid option `threads' cc1plus: error: unrecognized option `-Winvalid-pch' >From what I perceive here, I would say bjam tries to use the toolchain as a MinGW toolchain. How can I tell boost to use Linux toolchain settings, so use -pthread instead of -mthread and omit that strange "-Winvalid-pch" parameter? Thanks for any suggestions and best regards Pascal

2 1