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

[concept]
by er 22 Mar '10

22 Mar '10

Hello, With gcc version 4.4.1 (Ubuntu 4.4.1-4ubuntu9). This BOOST_CONCEPT_ASSERT((boost::SinglePassRangeConcept<boost::array<int,8u>>)); is greeted with the warning below, which is annoying. It appears that the reference T& template<typename T> struct SinglePassRangeConcept { private: T& m_range; }; is causing it, but can be eliminated by replacing T& by static T& m_range. Perhaps there is a good reason for T& rather than static T& so I stopped short of putting a request in trac. Please advise. Thanks. ../../Reposetories/boost/trunk/boost/concept/detail/has_constraints.hpp|42|instantiated from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::array<int, 8u> > >::value’| ../../Reposetories/boost/trunk/boost/concept/detail/has_constraints.hpp|45|instantiated from ‘boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::array<int, 8u> > >’| ../../Reposetories/boost/trunk/boost/mpl/if.hpp|67|instantiated from ‘boost::mpl::if_<boost::concepts::not_satisfied<boost::SinglePassRangeConcept<boost::array<int, 8u> > >, boost::concepts::constraint<boost::SinglePassRangeConcept<boost::array<int, 8u> > >, boost::concepts::requirement<boost::concepts::failed************ boost::SinglePassRangeConcept<boost::array<int, 8u> >::************> >’| ../../Reposetories/boost/trunk/boost/concept/detail/general.hpp|20|instantiated from ‘boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<boost::array<int, 8u> >)>’| /home/me/Reposetories/boost/sanbox/statistics/detail/assign/libs/assign/example/chain.cpp|42|instantiated from here| ../../Reposetories/boost/trunk/boost/range/concepts.hpp|209|warning: non-static reference ‘boost::array<int, 8u>& boost::SinglePassRangeConcept<boost::array<int, 8u> >::m_range’ in class without a constructor| /home/me/Reposetories/boost/sanbox/statistics/detail/assign/libs/assign/example/chain.cpp||In function ‘void example_ch

2 2

[proto] need explanation in implementing distributive law
by Kim Kuen Tang 22 Mar '10

22 Mar '10

Hi all, i would like to implement a grammar that transform a*(b+c) to a*b+a*c where a,b and c are terminals. The implementation of this grammar is straightforward and should compile. However i got errors that i dont understand. Below is the code that reproduces the errors. Thanks for any help, Kim # include <boost/cstdlib.hpp> # include <boost/proto/proto.hpp> # include <boost/fusion/container/list/cons.hpp> # include <boost/proto/tags.hpp> # include <boost/proto/make_expr.hpp> # define PRECISION_MAKE_tag(name) \ struct name \ { \ friend std::ostream& operator<< (std::ostream& s, name const&) \ { \ return s<< #name; \ } \ }; # define PRECISION_MAKE_terminal(name) \ proto::terminal< tag::name >::type const name = {{}} namespace proto = boost::proto; namespace tag{ PRECISION_MAKE_tag(a); PRECISION_MAKE_tag(b); PRECISION_MAKE_tag(c); } namespace mpl = boost::mpl; namespace fusion = boost::fusion; using proto::_; struct DistributiveLaw : proto::or_< proto::when< proto::multiplies< proto::terminal< _ > , proto::plus< _, _ > > , proto::plus< proto::multiplies<proto::_left,proto::_left(proto::_right)> , proto::multiplies<proto::_left,proto::_right(proto::_right)> //, proto::_right(proto::_right) >( proto::multiplies<proto::_left,proto::_left(proto::_right)> (proto::_left,proto::_left(proto::_right)) , proto::multiplies<proto::_left,proto::_right(proto::_right)> (proto::_left,proto::_right(proto::_right)) //, proto::_right(proto::_right) ) > , proto::otherwise<proto::nary_expr<_, proto::vararg<DistributiveLaw> > > > {}; PRECISION_MAKE_terminal(a); PRECISION_MAKE_terminal(b); PRECISION_MAKE_terminal(c); # undef PRECISION_MAKE_tag # undef PRECISION_MAKE_terminal int main() { proto::display_expr(a*(b+c)); proto::display_expr(DistributiveLaw()( a*(b+c) )); return boost::exit_success; }

3 4

boost::bind and max #args
by Andrej van der Zee 22 Mar '10

22 Mar '10

Hi, I need to call boost::bind with 10 arguments. I believe that the maximum is nine. Is there a way to increase this? Thank you, Andrej

4 4

Re: [Boost-users] [program-options] static linked example segfaults for exception
by Neetu Garg 22 Mar '10

22 Mar '10

Hi, Can I please get some input on this issue. Thanks for your help Regards, NG ----- Original Message ---- From: Neetu Garg <garg_neetu(a)yahoo.com> To: boost-users(a)lists.boost.org Sent: Fri, March 19, 2010 11:08:43 AM Subject: Re: program option library segfaults for exception I did little more digging into the issue If I compile and link following sample on Linux dynamically using following command g++ -c -I. -I/usr/local/include/boost-1_38 -I/usr/include testprogramoptions.cpp -o testprogramoptions.o g++ testprogramoptions.o -static-libgcc -L/u/neetug/Projects/performance/perfstat_cluster/lib -lboost_program_options-gcc41-mt -lpthread -o testprogramoptions [root@perf-tools-7 src]# ./testprogramoptions --o ERROR unknown option o ERROR Error while parsing CLI options Exiting Here "--o" is unknown option ======================================================================= If I compile and link following sample on Linux statically using following command g++ -c -I. -I/usr/local/include/boost-1_38 -I/usr/include testprogramoptions.cpp -o testprogramoptions.o g++ testprogramoptions.o -static-libgcc -Wl,-Bstatic -L/u/neetug/Projects/performance/perfstat_cluster/lib -lboost_program_options-gcc41-mt -lpthread -o testprogramoptions [root@perf-tools-7 src]# ./testprogramoptions --o Aborted Here "--o" is unknown option ======================================================================== I am not sure why the behavior is different with different linking option why I am not getting exception for static linking. Really appreciate any help in this issue. Here in the test program #include <iostream> #include <boost/program_options.hpp> namespace boostOptions = boost::program_options; using namespace std; int main(int argCount, char* argList[]) { try { boostOptions::options_description commonOpt("Options (common)"); commonOpt.add_options() ("help,h", "Produce help message.") ("version,v", "Prints perfstat version, and supported ONTAP versions.") ; boostOptions::options_description runModeOpt("Options ('run' mode)"); runModeOpt.add_options() ("clusterinfo", boostOptions::value<string>(), "cluster IP.") ("sample-interval", boostOptions::value<int>(), "Specifies statit/sysstat frequency") ; boostOptions::positional_options_description posOption; posOption.add("clusterinfo", -1); boostOptions::options_description allOptDesc("Allowed options :"); allOptDesc.add(commonOpt).add(runModeOpt); boostOptions::variables_map varMap; boostOptions::store(boostOptions::command_line_parser(argCount, argList). options(allOptDesc).positional(posOption).run(), varMap); boostOptions::notify(varMap); } catch(std::exception &e) { cout << "ERROR " << e.what() << "\n"; cout << "ERROR " << "Error while parsing CLI options Exiting" << "\n"; exit(0); } catch(...) { cout << "ERROR 1 " << "\n"; cout << "ERROR 1 " << "Error while parsing CLI options Exiting" << "\n"; exit(0); } } Regards, NG ----- Original Message ---- From: Neetu Garg <garg_neetu(a)yahoo.com> To: boost-users(a)lists.boost.org Sent: Wed, March 17, 2010 1:17:07 PM Subject: program option library segfaults for exception Sorry for the duplicate post, I think my message posted under different conversation. Hi, I have application that is using boost program option library. If I provide unknown option via CLI it should throw exception. The library is statically linked on windows and Linux environment. It works fine on windows platform I do get exception for unknown CLI option. On Linux platform I get "segfault" in place of exception for unknown CLI option. It is s a multi-threaded application and it also uses boost thread library. Application does throw exception on Linux also if I link dynamically. I am using following flags to link the library statically: LDFLAGS= -fexceptions -static-libgcc -Wl,-static -L/usr/lib -lboost_program_options-gcc41-mt -lboost_filesystem-gcc41-mt -lboost_thread-gcc41-mt -lboost_system-gcc41-mt -lnet7ssh -lbotan -ltar -lz -lrt -lpthread I am using following version of gcc: # g++ --version g++ (GCC) 4.1.1 Copyright (C) 2006 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. Here is the core dump for the segfault: (gdb) backtrace #0 __gnu_internal::get_global () at /usr/software/src/gcc-4.1.1/libstdc++-v3/libsupc++/eh_globals.cc:58 #1 0x082c0f67 in __cxa_get_globals () at /usr/software/src/gcc-4.1.1/libstdc++-v3/libsupc++/eh_globals.cc:71 #2 0x082c0b3f in __cxa_allocate_exception (thrown_size=32) at /usr/software/src/gcc-4.1.1/libstdc++-v3/libsupc++/eh_alloc.cc:154 #3 0x080a71f8 in boost::program_options::detail::cmdline::finish_option () #4 0x080a77eb in boost::program_options::detail::cmdline::run () #5 0x0806f3aa in boost::program_options::basic_command_line_parser<char>::run () #6 0x080660e9 in CLIHandler::collectCLIOptions () #7 0x0808a0d1 in perfstat::runPerfstat () #8 0x0808af3d in main () Current language: auto; currently c++ Appreciate your help Regards, NG

3 2

Compiling for Solaris X64
by Iskandar Prins 22 Mar '10

22 Mar '10

Hi All, I need some help with compiling boost for solaris x64. When I try to compile the bjam, I get a x86 version of bjam and boost, any idea what setting/flag I need to use on bjam? Regards, Iskandar Prins iprins(a)alphabay.nl

2 4

[serialization] Seek in a binary archive
by Damien R 22 Mar '10

22 Mar '10

Hi, I save fixed size objects in a binary archive and when I load the binary archive, I try to seek at a specific position. To do that I call istream.seekg() but the problem is that boost::serialization get the rdbuf of the input stream, so the seek does not work. I would like to know whether I have to create a class like basic_binary_iprimitive or whether there is a better alternative. Thanks,

1 0

Re: [Boost-users] [proto] generation of adaptive precision floating-point geometric predicates
by Kim Kuen Tang 22 Mar '10

22 Mar '10

Hi Andrew, just my thoughts on this chat. Andrew Durward schrieb: > > The central concept is that for any expression (a # b) where # is {+, -, *}, > the result can be expressed as (x + y) where x is the floating-point How about transform the expression a+b to sum_approx(a,b)+sum_diff(a,b) instead to fusion::cons<sum_approx(a,b),fusion::cons<sum_diff(a,b)> > ? The advantage of this approach is that you still get an ast where childs are held in terminal (instead in cons). > approximation of (a # b), and y is an error term whose value can also be > computed as a floating-point value. > > In toying with proto, I've been able to transform simple expressions > successfully but I can't seem to figure out how to define a grammar that > will handle arbitrary combinations of {+, -, *} recursively. Here's what > I've got so far: > > struct sum_approx{/* */}; > struct sum_error{/* */}; > > struct diff_approx{/* */}; > struct diff_error{/* */}; > > struct prod_approx{/* */}; > struct prod_error{/* */}; > > struct Transform : > proto::or_< > proto::when< > proto::plus< proto::terminal< _ >, proto::terminal< _ > > > , fusion::cons< > proto::_make_function( > sum_approx() > , proto::_left > , proto::_right > ) I dont see the meaning behind this step. If you use proto::_make_function you create a child in the ast, but you put this child in a fusion::cons. > , fusion::cons< > proto::_make_function( > sum_error() > , proto::_left > , proto::_right > ) > > > >() > > > // ... similar substitutions for minus and multiplies > > > {}; > > So the expression (a + b) yields the sequence: > sum_approx(a,b) > sum_error(a,b) > > Here's where I'm stuck. In the case of the expression (a + b)*(c - d), the > addition and subtraction should be replaced by the appropriate sequences > before the multiplication gets expanded to yield the final sequence: > prod_approx( sum_approx(a,b), diff_approx(c,d) ) > prod_error( sum_approx(a,b), diff_approx(c,d) ) > prod_approx( sum_approx(a,b), diff_error(c,d) ) > prod_error( sum_approx(a,b), diff_error(c,d) ) > prod_approx( sum_error(a,b), diff_approx(c,d) ) > prod_error( sum_error(a,b), diff_approx(c,d) ) > prod_approx( sum_error(a,b), diff_error(c,d) ) > prod_error( sum_error(a,b), diff_error(c,d) ) Are you sure that you want to get a sequence of expression instead an ast. In case you really want to get a sequence you can use proto::tag::comma to separate your child. > Obviously I need a recursive transform here but I'm not sure how to pass it > the sequences generated by both the left and right subtrees. > > Cheers, Kim Here is a toy project. Hth. # include <boost/cstdlib.hpp> # include <boost/proto/proto.hpp> # include <boost/fusion/container/list/cons.hpp> # include <boost/proto/tags.hpp> # include <boost/proto/make_expr.hpp> # define PRECISION_MAKE_tag(name) \ struct name \ { \ friend std::ostream& operator<< (std::ostream& s, name const&) \ { \ return s<< #name; \ } \ }; # define PRECISION_MAKE_terminal(name) \ proto::terminal< tag::name >::type const name = {{}} namespace proto = boost::proto; namespace tag{ PRECISION_MAKE_tag(a); PRECISION_MAKE_tag(b); PRECISION_MAKE_tag(c); PRECISION_MAKE_tag(d); PRECISION_MAKE_tag(sum_approx); PRECISION_MAKE_tag(sum_error); PRECISION_MAKE_tag(diff_approx); PRECISION_MAKE_tag(diff_error); } namespace mpl = boost::mpl; namespace fusion = boost::fusion; using proto::_; struct transform { BOOST_PROTO_CALLABLE() template<typename Sig> struct result; template<typename This,typename A0,typename A1> struct result<This(proto::tag::plus const,A0,A1)> : proto::result_of::make_expr< proto::tag::plus , typename proto::result_of::make_expr< proto::tag::function ,tag::sum_approx, A0, A1 >::type , typename proto::result_of::make_expr< proto::tag::function ,tag::sum_error, A0, A1 >::type > {}; template<typename This,typename A0,typename A1> struct result<This(proto::tag::minus const,A0,A1)> : proto::result_of::make_expr< proto::tag::minus, A0, A1 > {}; template<typename A0,typename A1> typename result<transform(proto::tag::plus const ,A0 const&, A1 const&)>::type operator()(proto::tag::plus const ,A0 const& a0,A1 const& a1) const { return proto::make_expr<proto::tag::plus>( proto::make_expr<proto::tag::function>( tag::sum_approx() , boost::ref(a0) , boost::ref(a1)) ,proto::make_expr<proto::tag::function>( tag::sum_error() , boost::ref(a0) , boost::ref(a1)) ); //return proto::make_expr<proto::tag::plus>(boost::ref(a0), boost::ref(a1)); }; template<typename A0, typename A1> typename result<transform(proto::tag::minus const ,A0 const&, A1 const&)>::type operator()(proto::tag::minus const ,A0 const& a0, A1 const& a1) const { return proto::make_expr<proto::tag::minus>(boost::ref(a0), boost::ref(a1)); }; }; struct Transform : proto::or_< proto::when< proto::plus< proto::terminal< _ >, proto::terminal< _ > > , transform( proto::tag::plus() , proto::_value(proto::_left) , proto::_value(proto::_right) ) > ,proto::when< proto::minus< proto::terminal< _ >, proto::terminal< _ > > , transform( proto::tag::minus() , proto::_value(proto::_left) , proto::_value(proto::_right) ) > , proto::otherwise<proto::nary_expr<_, proto::vararg<Transform> > > > {}; PRECISION_MAKE_terminal(a); PRECISION_MAKE_terminal(b); PRECISION_MAKE_terminal(c); PRECISION_MAKE_terminal(d); # undef PRECISION_MAKE_tag # undef PRECISION_MAKE_terminal int main() { proto::display_expr(a+b); BOOST_AUTO(expr, Transform()( (a+b)*(c-d) ) ); proto::display_expr(expr); return boost::exit_success; }

2 1

Re: [Boost-users] [proto] generation of adaptive precision floating-point geometric predicates
by Manjunath Kudlur 22 Mar '10

22 Mar '10

> Here's where I'm stuck. In the case of the expression (a + b)*(c - d), the > addition and subtraction should be replaced by the appropriate sequences > before the multiplication gets expanded to yield the final sequence: See if the following works for you. I try to replace a # b with sum(#_approx(a,b), #_error(a,b)). The display_expr looked correct, but I didn't check very carefully. #include <boost/proto/proto.hpp> #include <iostream> namespace proto = boost::proto; using proto::_; unsigned ids = 0; struct var { unsigned id; var() { id = ids++; } friend std::ostream &operator<<(std::ostream &s, var v) { s << "V" << v.id; return s; } }; struct sum_approx { friend std::ostream &operator<<(std::ostream &s, sum_approx) { s << "sum_approx"; return s; } }; struct sum_error { friend std::ostream &operator<<(std::ostream &s, sum_error) { s << "sum_error"; return s; } }; struct diff_approx { friend std::ostream &operator<<(std::ostream &s, diff_approx) { s << "diff_approx"; return s; } }; struct diff_error { friend std::ostream &operator<<(std::ostream &s, diff_error) { s << "diff_error"; return s; } }; struct prod_approx { friend std::ostream &operator<<(std::ostream &s, prod_approx) { s << "prod_approx"; return s; } }; struct prod_error { friend std::ostream &operator<<(std::ostream &s, prod_error) { s << "prod_error"; return s; } }; struct sum { friend std::ostream &operator<<(std::ostream &s, sum) { s << "sum"; return s; } }; struct grammar : proto::or_< proto::when<proto::plus<grammar, grammar>, proto::_make_function(sum(), proto::_make_function(sum_approx(), grammar(proto::_left), grammar(proto::_right)), proto::_make_function(sum_error(), grammar(proto::_left), grammar(proto::_right)))> ,proto::when<proto::minus<grammar, grammar>, proto::_make_function(sum(), proto::_make_function(diff_approx(), grammar(proto::_left), grammar(proto::_right)), proto::_make_function(diff_error(), grammar(proto::_left), grammar(proto::_right)))> ,proto::when<proto::multiplies<grammar, grammar>, proto::_make_function(sum(), proto::_make_function(prod_approx(), grammar(proto::_left), grammar(proto::_right)), proto::_make_function(prod_error(), grammar(proto::_left), grammar(proto::_right)))> , proto::terminal<var> > {}; typedef proto::terminal<var>::type Var; int main() { Var a, b, c, d; proto::display_expr(grammar()( (a+b)*(c-d) )); }

2 1

Will asio::ip::tcp::socket::read let me read all my data even if remote end is connected?
by Sean McAllister 22 Mar '10

22 Mar '10

Looking at the documentation for this function: http://www.boost.org/doc/libs/1_37_0/doc/html/boost_asio/reference/basic_st… I'm not entirely clear whether it will do what I want. Basically I'm going to be having a server send blocks of signal data (of unknown duration or length). I'd like the client to be able to read chunks of that until the remote end closes. So right now my API has the user pass in a memory buffer to fill along with a size and I repeatedly call socket::read to fill it up. What I'm curious about is if the server doesn't send a full block for the last block, and then closes the connection. Will this function still return whatever data it was able to read and then throw an exception on the next read? Or will it throw an exception on that last read, rendering the last bit of data inaccesible? Sean

2 4

IOService.run()
by Iskandar Prins 22 Mar '10

22 Mar '10

Hi, I have a question regarding the asio::deadline_timer , it seems I need to run the ioservice.run() all the time in order to update the timer, which is seems undesirable. Any idea how I can just start the timer and wait for the callback instead? Regards, Iskandar Prins IT Software Developer Alphabay Capital B.V. Singel 540 1017AZ Amsterdam Tel: +31 (0)20 755 9642 Fax: +31 (0)20 755 9601 iprins(a)alphabay.nl

3 3

Problems with copying view on mpl set on solaris compiler.
by Jonathan Chambers` 22 Mar '10

22 Mar '10

I'm trying to get the following to compile on solaris using S1S12u1; #include <boost/mpl/copy.hpp> #include <boost/mpl/set.hpp> #include <boost/type_traits.hpp> #include <boost/mpl/placeholders.hpp> #include <boost/mpl/inserter.hpp> #include <boost/mpl/insert.hpp> #include <boost/mpl/filter_view.hpp> typedef boost::mpl::copy< boost::mpl::filter_view< boost::mpl::set<int>, boost::is_same<boost::mpl::_, int> >, boost::mpl::inserter< boost::mpl::set<>, boost::mpl::insert<boost::mpl::_, boost::mpl::_> > >::type type; template <class undefined> struct Debug; Debug<type> debug; int main(int argc, char *argv[]) { return 0; } and I get the following compiler errors "boost_1_42_0/boost/mpl/aux_/filter_iter.hpp", line 66: Error: Redefining boost::mpl::next<boost::mpl::T> after use in boost::mpl::aux::filter_i ter<boost::mpl::s_iter<boost::mpl::set<int, char, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_ ::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::s_item<int, boost::mpl::set0<mpl_::na>>>, boo st::mpl::s_iter<boost::mpl::set<int, char, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, m pl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::set0<mpl_::na>>, boost::mpl::protect<boost::mpl::bin d2<boost::mpl::quote2<boost::is_same<boost::T, boost::U>, mpl_::void_>, mpl_::arg<-1>, int>, 0>>. "boost_1_42_0/boost/mpl/next_prior.hpp", line 31: Where: While specializing "boost::mpl::aux::filter_iter<boost::mpl::s_iter<boost::mpl::set <int, char, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mp l_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::s_item<int, boost::mpl::set0<mpl_::na>>>, boost::mpl::s_iter<boost::mpl::set<int, c har, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::set0<mpl_::na>>, boost::mpl::protect<boost::mpl::bind2<boost::mpl::quote2<boost::is_same<b oost::T, boost::U>, mpl_::void_>, mpl_::arg<-1>, int>, 0>>". "boost_1_42_0/boost/mpl/next_prior.hpp", line 31: Where: Specialized in boost::mpl::next<boost::mpl::aux::filter_iter<boost::mpl::s_iter<boo st::mpl::set<int, char, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::s_item<int, boost::mpl::set0<mpl_::na>>>, boost::mpl::s_iter<boost::mpl ::set<int, char, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::n a, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::set0<mpl_::na>>, boost::mpl::protect<boost::mpl::bind2<boost::mpl::quote2<boos t::is_same<boost::T, boost::U>, mpl_::void_>, mpl_::arg<-1>, int>, 0>>>. "boost_1_42_0/boost/mpl/aux_/preprocessed/plain/fold_impl.hpp", line 162: Where: Specialized in boost::mpl::aux::fold_impl<-1, boost::mpl::a ux::filter_iter<boost::mpl::s_iter<boost::mpl::set<int, char, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mp l_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::s_item<int, boost::mpl::set0<mpl_ ::na>>>, boost::mpl::s_iter<boost::mpl::set<int, char, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::set0<mpl_::na>>, boost::mpl::protect<boo st::mpl::bind2<boost::mpl::quote2<boost::is_same<boost::T, boost::U>, mpl_::void_>, mpl_::arg<-1>, int>, 0>>, boost::mpl::aux::filter_iter<boost ::mpl::s_iter<boost::mpl::set<int, char, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl _::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::set0<mpl_::na>>, boost::mpl::s_iter<boost::mpl::set<in t, char, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_: :na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::mpl::set0<mpl_::na>>, boost::mpl::protect<boost::mpl::bind2<boost::mpl::quote2<boost::is_sa me<boost::T, boost::U>, mpl_::void_>, mpl_::arg<-1>, int>, 0>>, boost::mpl::set<mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_ ::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost:: mpl::insert<mpl_::arg<-1>, mpl_::arg<-1>, mpl_::na>>. "boost_1_42_0/boost/mpl/fold.hpp", line 39: Where: Specialized in boost::mpl::fold<boost::mpl::filter_view<boost::mpl::set<int, char, mpl_:: na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::is_same<mpl_::arg<-1>, int>>, boost::mpl::set<mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boo st::mpl::insert<mpl_::arg<-1>, mpl_::arg<-1>, mpl_::na>>. "boost_1_42_0/boost/mpl/copy.hpp", line 36: Where: Specialized in boost::mpl::aux::copy_impl<boost::mpl::filter_view<boost::mpl::set<int, ch ar, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::is_same<mpl_::arg<-1>, int>>, boost::mpl::inserter<boost::mpl::set<mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl _::na, mpl_::na, mpl_::na>, boost::mpl::insert<mpl_::arg<-1>, mpl_::arg<-1>, mpl_::na>>>. "boost_1_42_0/boost/mpl/copy.hpp", line 54: Where: Specialized in boost::mpl::copy<boost::mpl::filter_view<boost::mpl::set<int, char, mpl_:: na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::is_same<mpl_::arg<-1>, int>>, boost::mpl::inserter<boost::mpl::set<mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl _::na, mpl_::na>, boost::mpl::insert<mpl_::arg<-1>, mpl_::arg<-1>, mpl_::na>>>. "filter_view.cpp", line 19: Where: Specialized in non-template code. "filter_view.cpp", line 24: Error: In this declaration "debug" is of an incomplete type "Debug<boost::mpl::s_item<int, boost::mpl::set0<mpl_::na >>>". 2 Error(s) detected. You can see by the debug that the program has managed to deduce the correct type, even though it errored. On GCC-4.1.1 this gives filter_view.cpp:24: error: aggregate 'Debug<boost::mpl::s_item<int, boost::mpl::set0<mpl_::na> > > debug' has incomplete type and cannot be defined Which is exactly what I want. Anyone else had these issues, found workarounds, etc? This problem also occurs with boost::mpl::transform_view, but appears to work for boost::mpl::joint_view. Any help appreciated. Jon. _________________________________________________________________ Send us your Hotmail stories and be featured in our newsletter http://clk.atdmt.com/UKM/go/195013117/direct/01/

1 0

blocking read after async connect
by David Kaplan 22 Mar '10

22 Mar '10

I have a class that performs a timed connect (i.e. using an async connect that returns an error if connection failed/timed-out). However every asio::read/write performed on the socket after a successful async_connect fails. Any ideas? Is it impossible to perform read/write on such a socket? do I have to stop() the io service to put it back into synchronous mode?

2 3

[fusion?] [Phoenix?] Calling arbitrary method with collection of args
by Nat Goodspeed 22 Mar '10

22 Mar '10

We have a data type equivalent to a recursive variant that can hold a few scalar types or a vector of such types. My colleague proposes that we build a template function that will accept a free function or class method (that is, any callable whose signature we can infer) plus a vector of the variant type. For each formal parameter type in the callable's signature, this function would ensure that the vector is long enough to fill it, and then that the runtime type of the appropriate vector entry is compatible with the static type of the parameter. Finally it would call the callable, filling the formal parameters from the variant vector. I strongly suspect that this function already exists in Boost. I simply don't know which library to research. (OvermindDL1?)

3 7

undefined reference to `boost::program_options
by G.NAGENDAR 22 Mar '10

22 Mar '10

Hi, When i run my C++ program which is using boost library, i am getting these errors main.o: In function `boost::program_options::variables_map::operator[](std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const': /usr/local/include/boost-1_35/boost/program_options/variables_map.hpp:161: undefined reference to `boost::program_options::abstract_variables_map::operator[](std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const' /usr/local/include/boost-1_35/boost/program_options/variables_map.hpp:161: undefined reference to `boost::program_options::abstract_variables_map::operator[](std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const' /usr/local/include/boost-1_35/boost/program_options/variables_map.hpp:161: undefined reference to `boost::program_options::abstract_variables_map::operator[](std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const' /usr/local/include/boost-1_35/boost/program_options/variables_map.hpp:161: undefined reference to `boost::program_options::abstract_variables_map::operator[](std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const Please help to solve this problem. Please... -- Thanks & Regards Nagendar

2 2

Variant and Fusion
by Matthias Vallentin 21 Mar '10

21 Mar '10

Hi, there used to be a variant adapter for fusion sequences, but it has been rightfully removed: on Wed Dec 19 2007, Joel de Guzman <joel-AT-boost-consulting.com> wrote: > I intend to remove the variant adapter from fusion. After thorough > investigation, I think now that the move to make variant a > fusion sequence is rather quirky. A variant will always > have a size==1 regardless of the number of types it can contain > and there's no way to know at compile time what it contains. > Iterating over its types is simply wrong. All these imply that > the variant is *not* a fusion sequence. Let's say I have a recursive variant and would like to flatten the variant to create some sort of heterogeneous sequence from it. Particularly, I would like to chop the variant into multiple disjunct Fusion sequences, each of which are handed to generic component that operates with Fusion sequences. The above suggests that Fusion is not the right tool. What would be a better approach to handle this problem? Should I split the variant into smaller variants instead? What made Fusion so attractive is the notion of tiers, i.e., light-weight views of references to the actual data. Is there a variant equivalent of tiers? Matthias -- Matthias Vallentin vallentin(a)icsi.berkeley.edu http://www.icir.org/matthias

2 6

Multithread event handling
by Alessandro Bellina 21 Mar '10

21 Mar '10

Hello boost, Traditionally, I think of services as having a thread pool or manually managed threads to handle requests and produce responses. I have been looking at boost::asio and tbb as an alternative to this in order to take advantage of multiple cores. Also, I think that implementing an event handler with asio or tbb should provide better performance over a threadpool. Do you have any suggestions? So far, I have implemented an example using tbb::task_group and spawned tasks. This yielded full CPU utilization, but since these are very short lived tasks, the task creation overhead took over. Using io_service, it seems to be as easy as posting to the service, and running it among different threads. Would this be the correct approach for my case? Can somebody share their experiences on libraries or patterns used to implement an event handling mechanism? Thanks, Alessandro

4 5

Possibly too newbie a question?
by Eric Whitcombe 20 Mar '10

20 Mar '10

I haven't received any response to my question. If this is is not the appropriate forum I would appreciate some suggestions as to where to ask the question. I have gone over the mailing list groups page and this seems to be the place to ask it but I could be wrong. I am stepping through interprocess shared memory code and I was a little confused by the offset_ptr code that I was hitting*. I cannot figure out how that is specified to the template of rbtree_best_fit. I see in boost/interprocess/interprocess_fwd.hpp the declaration of managed_shared_memory by typedef'ing basic_managed_shared_memory with rbtree_best_fit<mutex_family> as the AllocationAlgorithm argument but I can't figure out how offset_ptr is is supplied as the VoidPointer argument to the rbtree_best_fit template. That template has 3 arguments but the forward declaration only provides one. Are the other two somehow inferred? If so, how? * I have looked at the documentation for interprocess - including the explanation of offset_ptr. I understand the need for it. I just don't see how it is incorporated into the rbtree_best_fit template.

3 7

Re: [Boost-users] setup question
by Rick Boesch 20 Mar '10

20 Mar '10

Steven, many thanks. I tried your suggestion and was able to verify exactly what I needed to know. It seems "bjam -help" says -n will not execute the updating actions, but it says nothing about printing commands. I didn't cross check this with the Boost web page documentation which is in fact different (and says -n will print the commands). As for the email timestamp, blackouts from storms over the last few days, and a low battery on the box I sent the email from, apparently conspired to confuse the clock. Again, thanks for your help. Rick -----Original Message----- >From: Steven Watanabe <watanabesj(a)gmail.com> >Sent: Mar 19, 2010 6:56 PM >To: boost-users(a)lists.boost.org >Subject: Re: [Boost-users] setup question > >AMDG > >Rick Boesch wrote: >> Hello all -- looking for a small bit of guidance please. I'm building a 64bit Boost library from scratch. I'm fairly sure I did almost everything correctly, but would like to check one nagging detail. My system is Windows 7, Visual Studio 2005 and I'm building for 64 bit, specifically AMD64. >> >> I believe bjam.exe built correctly because my path was set up properly for the x64 toolset and bjam.exe was deposited in the auto-generated directory BOOST_ROOT\tools\jam\src\bin.ntx86_64. To do this, I ran "build vc8" on the command line. >> >> My question concerns the use of bjam along with the "using" instruction in the ...\V2\user-config.jam file. I set the "using" instruction to be >> >> using msvc : 8.0 : cl : <setup-amd64>vcvarsall ; >> >> and my command line is >> >> bjam address-model=64 --build-dir="C:\Program Files\boost\boost_1_42_0\boost-build" --build-type=complete stage >> >> I built two different ways: >> >> 1) In a virgin cmd window -- which is not set up for 64 bit tools by default -- I ran vcvarsall manually on the command line (with no args, I set it up to default to setting up 64 bit), which sets up my 64 bit environment and which I have echo to the screen "AMD64 env" for confirmation. I confirmed I was then defaulting to the correct "cl", etc., and then executed in BOOST_ROOT the bjam command line above. I have yet to test the output, but it seemed to work. >> >> 2) In another virgin cmd window, I cd'd to BOOST_ROOT and executed ONLY the bjam command line above. According to the documentation for the "using" instruction, the batch file vcvarsall (which is in my default PATH) is supposed to be called before any tools are used, but I never saw "AMD64 env" echoed to the screen, nor to a .log file which I piped to in order to make sure I didn't miss anything. Yet, bjam created an output tree containing various "address-model-64" directories. When I checked my PATH after the build, it did not contain the paths that vcvarsall is supposed to set up. >> > >The environment setup the Boost.Build does is local to each command. > >> Question: In scenario (2) above, vcvarsall clearly did not run in my cmd session, but did bjam run it in some internally generated shell? If no, why not (did I do something incorrectly)? If yes, is this why I didn't see my echo confirmation? > >You can run bjam -a -n <other options> to see the commands that >Boost.Build actually runs. > >> So I'm wondering if I have a 64 bit build or not -- and I prefer scenario (2) to scenario (1)! >> > >In Christ, >Steven Watanabe > >P.S. The timestamp on this message was 2004. >

1 0

How to use scoped_lock
by weii 20 Mar '10

20 Mar '10

Dear all, I got a compiler(gcc 3.4.5) error while using boost.thread. The following is my code: ----------------------------------------------------------------------------------------------------------------------------- #include <boost/thread/thread.hpp> #include <boost/thread/mutex.hpp> #include <boost/bind.hpp> #include <iostream> boost::mutex io_mutex; void count(int id) { boost::mutex::scoped_lock lock(io_mutex,false); for (int i = 0; i < 10; ++i) { lock.lock(); std::cout << id << ": " << i << std::endl; lock.unlock(); } } int main(int argc, char* argv[]) { boost::thread thrd1(count, 1); boost::thread thrd2(count, 2); thrd1.join(); thrd2.join(); return 0; } ----------------------------------------------------------------------------- I know I can just abandon the lock() and unlock() function since the constructor and destructor will do them for me. But I can't understand how this error occurs and why the compiler has something to do with basic_timed_mutex. Anyone can give me some clues? Thanks in advance.

2 2

Re: [Boost-users] Building boost-1.42.0 wuth VS 2005 - precompiled header error
by john blair 19 Mar '10

19 Mar '10

Thanks for the reply Paul. So this error has been discussed earlier http://lists.boost.org/boost-build/2009/08/22231.php Removing debug-store=database does work and like original poster I too am not sure what consequences that has. --- On Sat, 3/20/10, Paul A. Bristow <pbristow(a)hetp.u-net.com> wrote: > From: Paul A. Bristow <pbristow(a)hetp.u-net.com> > Subject: Re: [Boost-users] Building boost-1.42.0 wuth VS 2005 - precompiled header error > To: boost-users(a)lists.boost.org > Date: Saturday, March 20, 2010, 12:12 AM > > -----Original Message----- > > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] > On Behalf Of john blair > > Sent: Friday, March 19, 2010 2:13 AM > > To: Boost-users(a)lists.boost.org > > Subject: [Boost-users] Building boost-1.42.0 wuth VS > 2005 - precompiled header error > > > > I am trying to build boost-1.42.0 with visual studio > 2005 and getting the following error: > > assoc_laguerre.cpp > > libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : > error C2858: command-line opt > > ion 'program database name > (/Fdc:\toolchain\src\boost-1.42.0\build-win32-vc80-de > > > bug\boost\bin.v2\libs\math\build\msvc-8.0\dbg\dbg-str-dtbs\lnk-sttc\thrd-mlt\lib > > boost_math_tr1-vc80-mt-gd-1_42.pdb)' inconsistent with > precompiled header, which > > used > '/Fdc:\toolchain\src\boost-1.42.0\boost_1_42_0\vc80.pdb' > > libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : > error C2859: c:\toolchain\src > > > \boost-1.42.0\build-win32-vc80-debug\boost\bin.v2\libs\math\build\msvc-8.0\dbg\d > > > bg-str-dtbs\lnk-sttc\thrd-mlt\libboost_math_tr1-vc80-mt-gd-1_42.pdb > is not the p > > db file that was used when this precompiled header was > created, recreate the pre > > compiled header. > > ...failed updating 1 target... > > > > Anybody knows how to resolve this? > > John Maddock is the man who can definitively answer this, > but since he hasn't replied yet, > > does the > > I:\boost_1_42_0\libs\math\build\jamfile.v2 > > (re-build the pre-compiled header?) > > (cd to that directory and enter "bjam -a > > yourlogfile.log") > > do anything to help? > > Paul > > --- > Paul A. Bristow > Prizet Farmhouse > Kendal, UK LA8 8AB > +44 1539 561830, mobile +44 7714330204 > pbristow(a)hetp.u-net.com > > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

Re: [Boost-users] setup question
by Steven Watanabe 19 Mar '10

19 Mar '10

AMDG Rick Boesch wrote: > Hello all -- looking for a small bit of guidance please. I'm building a 64bit Boost library from scratch. I'm fairly sure I did almost everything correctly, but would like to check one nagging detail. My system is Windows 7, Visual Studio 2005 and I'm building for 64 bit, specifically AMD64. > > I believe bjam.exe built correctly because my path was set up properly for the x64 toolset and bjam.exe was deposited in the auto-generated directory BOOST_ROOT\tools\jam\src\bin.ntx86_64. To do this, I ran "build vc8" on the command line. > > My question concerns the use of bjam along with the "using" instruction in the ...\V2\user-config.jam file. I set the "using" instruction to be > > using msvc : 8.0 : cl : <setup-amd64>vcvarsall ; > > and my command line is > > bjam address-model=64 --build-dir="C:\Program Files\boost\boost_1_42_0\boost-build" --build-type=complete stage > > I built two different ways: > > 1) In a virgin cmd window -- which is not set up for 64 bit tools by default -- I ran vcvarsall manually on the command line (with no args, I set it up to default to setting up 64 bit), which sets up my 64 bit environment and which I have echo to the screen "AMD64 env" for confirmation. I confirmed I was then defaulting to the correct "cl", etc., and then executed in BOOST_ROOT the bjam command line above. I have yet to test the output, but it seemed to work. > > 2) In another virgin cmd window, I cd'd to BOOST_ROOT and executed ONLY the bjam command line above. According to the documentation for the "using" instruction, the batch file vcvarsall (which is in my default PATH) is supposed to be called before any tools are used, but I never saw "AMD64 env" echoed to the screen, nor to a .log file which I piped to in order to make sure I didn't miss anything. Yet, bjam created an output tree containing various "address-model-64" directories. When I checked my PATH after the build, it did not contain the paths that vcvarsall is supposed to set up. > The environment setup the Boost.Build does is local to each command. > Question: In scenario (2) above, vcvarsall clearly did not run in my cmd session, but did bjam run it in some internally generated shell? If no, why not (did I do something incorrectly)? If yes, is this why I didn't see my echo confirmation? You can run bjam -a -n <other options> to see the commands that Boost.Build actually runs. > So I'm wondering if I have a 64 bit build or not -- and I prefer scenario (2) to scenario (1)! > In Christ, Steven Watanabe P.S. The timestamp on this message was 2004.

1 0

custom allocators Re:pool_alloc
by B Hart 19 Mar '10

19 Mar '10

I am not understanding the use of pool with std::set. i.e. the release_memory() function referenced in last example shown on: http://www.boost.org/doc/libs/1_42_0/libs/pool/doc/interfaces.html seems to do nothing. I call GetProcessMemoryInfo() and don't see any change after the set has gone out of scope. maybe someone could relate what happens to the allocated memory when set goes out of scope and release_memory() isn't called versus what happens when set goes out of scope and release_memory() is called. I want to do something like: 1.std::set<unsigned int, std::less<unsigned int>, boost::pool_allocator<unsigned int>> v; 2. for(int i=0; i<(K); i++) { v.insert(i); } 3. use v 4. release_memory() on v //dump all set elements in one action. Note, without custom allocator this is very slow for large sets. 5. repeat 1-4 with a new set

6 19

[interprocesss] managed_mapped_file mutex question
by Andy Wiese 19 Mar '10

19 Mar '10

This is a somewhat different take on the question I asked earlier about interprocess mutexes in allocators. I am using a default interprocess::managed_mapped_file to hold a index for a multiprocess property store. There is one object named "index" in the mapped file, which is an interprocess::map. The map holds an interprocess::set of fixed-length strings. (I had an allocation problem with sets of string objects, but that's another topic) Many processes will both read and write this index map. Do the interprocess:: containers provide the needed synchronization, or do I need other synchronization mechanisms? If I am reading the docs correctly, it seems to say that I don't need additional synchronization if I am not adding/removing named objects. However, my tests break with multiple processes. I don't know if I just need my own synchronization or if a deeper problem is implied. Following is the simple test I have been using. Works with one process, breaks with two concurrent. (os-x 10.5, boost trunk) Thanks in advance for any advice! Andy ------------------------------------------------------- namespace bip = boost::interprocess; typedef struct { char t[64]; } thing_t; struct ThingLess { bool operator()(thing_t const & lhs, thing_t const & rhs) const { return (strcmp(lhs.t, rhs.t) < 0); } }; typedef bip::managed_mapped_file shared_store_t; typedef shared_store_t::segment_manager segment_manager_t; typedef bip::allocator<void, segment_manager_t> void_allocator_t; typedef bip::allocator<char, segment_manager_t> char_allocator_t; typedef bip::basic_string<char, std::char_traits<char>, char_allocator_t> char_string_t; typedef bip::allocator<char_string_t, segment_manager_t> char_string_allocator_t; typedef bip::allocator<thing_t, segment_manager_t> thing_allocator_t; typedef bip::set<thing_t, ThingLess, thing_allocator_t> thing_set_t; typedef std::pair<const char_string_t, thing_set_t> map_value_t; typedef bip::allocator<map_value_t, segment_manager_t> map_value_allocator_t; typedef bip::map< char_string_t, thing_set_t, std::less<char_string_t>, map_value_allocator_t> index_map_t; int main(int argc, char* argv[]) { //fork(); // forking here will usually cause a bus error int pid = getpid(); // find or create the mapped file std::auto_ptr<shared_store_t> store(new shared_store_t(bip::open_or_create, "/tmp/testindex", 1024*1024)); void_allocator_t allocator(store->get_segment_manager()); // find or create the index object index_map_t* index = store->get_segment_manager()- >find<index_map_t>("index").first; if (!index) { index = store->construct<index_map_t>("index") (std::less<char_string_t>(), allocator); assert(index); } // add pairs to the map, find them, remove them. for (int j=0; j<1000; ++j) { for (int i=0; i<100; ++i) { try { std::ostringstream ks; ks << "key" << i; std::ostringstream ts; ts << "thing" << i; // look for thing in map char_string_t key(ks.str().c_str(), allocator); index_map_t::iterator foundIt = index->find(key); if (foundIt == index->end()) { // add thing to map thing_t thing; strcpy(thing.t,ts.str().c_str()); thing_set_t thingSet(ThingLess(), allocator); thingSet.insert(thing); map_value_t entry(key,thingSet); index->insert(entry); std::cout << pid << " Added " << key << std::endl; } // look again... foundIt = index->find(key); if (foundIt != index->end()) { if (ts.str() == foundIt->second.begin()->t) { std::cout << pid << " FOUND " << key << ":"<< foundIt- >second.begin()->t << std::endl; } else { std::cout << pid << " FAILED? " << key << ":"<< foundIt- >second.begin()->t << std::endl; } } if (j%2) { // erase thing from map, every other pass just for some variety index->erase(key); std::cout << pid << " Erased " << key << std::endl; } } catch( bip::bad_alloc & ba ) { std::cout << "bad_alloc at " << j<<","<<i<< " "<< ba.what() << std::endl; } catch(std::exception & e) { std::cout << e.what() << std::endl; } catch(...) { std::cout << "some other exception" << std::endl; } } std::cout << pid << " --------- End Round " << j << " --------- " <<std::endl; } return 0; }

3 7

[proto] generation of adaptive precision floating-point geometric predicates
by Andrew Durward 19 Mar '10

19 Mar '10

Hi all, I'm exploring the possibility of using proto to transform an expression (at compile time) into a sequence of terms whose sum represents an increasingly accurate floating-point approximation of the result. The underlying idea is based on a paper by Shewchuk [1]. The central concept is that for any expression (a # b) where # is {+, -, *}, the result can be expressed as (x + y) where x is the floating-point approximation of (a # b), and y is an error term whose value can also be computed as a floating-point value. In toying with proto, I've been able to transform simple expressions successfully but I can't seem to figure out how to define a grammar that will handle arbitrary combinations of {+, -, *} recursively. Here's what I've got so far: struct sum_approx{/* */}; struct sum_error{/* */}; struct diff_approx{/* */}; struct diff_error{/* */}; struct prod_approx{/* */}; struct prod_error{/* */}; struct Transform : proto::or_< proto::when< proto::plus< proto::terminal< _ >, proto::terminal< _ > > , fusion::cons< proto::_make_function( sum_approx() , proto::_left , proto::_right ) , fusion::cons< proto::_make_function( sum_error() , proto::_left , proto::_right ) > >() > // ... similar substitutions for minus and multiplies > {}; So the expression (a + b) yields the sequence: sum_approx(a,b) sum_error(a,b) Here's where I'm stuck. In the case of the expression (a + b)*(c - d), the addition and subtraction should be replaced by the appropriate sequences before the multiplication gets expanded to yield the final sequence: prod_approx( sum_approx(a,b), diff_approx(c,d) ) prod_error( sum_approx(a,b), diff_approx(c,d) ) prod_approx( sum_approx(a,b), diff_error(c,d) ) prod_error( sum_approx(a,b), diff_error(c,d) ) prod_approx( sum_error(a,b), diff_approx(c,d) ) prod_error( sum_error(a,b), diff_approx(c,d) ) prod_approx( sum_error(a,b), diff_error(c,d) ) prod_error( sum_error(a,b), diff_error(c,d) ) Obviously I need a recursive transform here but I'm not sure how to pass it the sequences generated by both the left and right subtrees. struct Transform : proto::or_< // ... as before , proto::when< proto::multiplies< Transform, Transform > , /* WHAT_GOES_HERE */< Transform( proto::_left ) , Transform( proto::_right ) > > > {}; What exactly do I need here? A metafunction to generate the proper sequence? What's the proper syntax to invoke it? Can anybody point me in the right direction? Thanks for any help, andrew [1] Shewchuk, Jonathon. Robust Adaptive Floating-Point Geometric Predicates. http://www.cs.cmu.edu/afs/cs/project/quake/public/papers/robust-predicates.p s

1 0

Building boost-1.42.0 wuth VS 2005 - precompiled header error
by john blair 19 Mar '10

19 Mar '10

I am trying to build boost-1.42.0 with visual studio 2005 and getting the following error: assoc_laguerre.cpp libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : error C2858: command-line opt ion 'program database name (/Fdc:\toolchain\src\boost-1.42.0\build-win32-vc80-de bug\boost\bin.v2\libs\math\build\msvc-8.0\dbg\dbg-str-dtbs\lnk-sttc\thrd-mlt\lib boost_math_tr1-vc80-mt-gd-1_42.pdb)' inconsistent with precompiled header, which used '/Fdc:\toolchain\src\boost-1.42.0\boost_1_42_0\vc80.pdb' libs\math\build\..\src\tr1\assoc_laguerre.cpp(6) : error C2859: c:\toolchain\src \boost-1.42.0\build-win32-vc80-debug\boost\bin.v2\libs\math\build\msvc-8.0\dbg\d bg-str-dtbs\lnk-sttc\thrd-mlt\libboost_math_tr1-vc80-mt-gd-1_42.pdb is not the p db file that was used when this precompiled header was created, recreate the pre compiled header. ...failed updating 1 target... Anybody knows how to resolve this?

2 1

Link issue with condition_variable
by Bradley W. Settlemyer 19 Mar '10

19 Mar '10

Hello, I'm using boost for the first time and I'm struggling to link my program. I've added libboost_pthread-mt to the link link (which got most of the symbols), but I still can't seem to get the symbols for the condition variables. The issue could be with the code, as I find the lock-mutex-condition_variable interactions to be very confusing, but it does appear to be a link issue. Consider the following error message emitted during link command: mpicxx <objects> -D_FILE_OFFSET_BITS=64 -L/lib64 -lfuse -lrt -ldl -lboost_thread-mt -lpthread -o aio_benchmark src/aio/thread_pool_adaptive_writer.o: In function `aio::ThreadPoolWriter::Write(aio::File*, std::vector<int, std::allocator<int> >, void*, unsigned long)': /home/bws/sandbox/aiofs/src/aio/thread_pool_writer.cc:59: undefined reference to `boost::condition_variable::notify_all()' /home/bws/sandbox/aiofs/src/aio/thread_pool_writer.cc:63: undefined reference to `boost::condition_variable::wait(boost::unique_lock<boost::mutex>&)' src/aio/thread_pool_writer.o: In function `aio::ThreadPoolWriter::threadWait()': /home/bws/sandbox/aiofs/src/aio/thread_pool_writer.cc:76: undefined reference to `boost::condition_variable::wait(boost::unique_lock<boost::mutex>&)' /home/bws/sandbox/aiofs/src/aio/thread_pool_writer.cc:110: undefined reference to `boost::condition_variable::notify_one()' Is condition variable in a different library? I am using the boost stuff distributed with Fedora 11: boost-1.37.0-7.fc11.x86_64 boost-devel-1.37.0-7.fc11.x86_64 Cheers, Brad

2 2

Re: [Boost-users] program option library segfaults for exception
by Neetu Garg 19 Mar '10

19 Mar '10

I did little more digging into the issue If I compile and link following sample on Linux dynamically using following command g++ -c -I. -I/usr/local/include/boost-1_38 -I/usr/include testprogramoptions.cpp -o testprogramoptions.o g++ testprogramoptions.o -static-libgcc -L/u/neetug/Projects/performance/perfstat_cluster/lib -lboost_program_options-gcc41-mt -lpthread -o testprogramoptions [root@perf-tools-7 src]# ./testprogramoptions --o ERROR unknown option o ERROR Error while parsing CLI options Exiting Here "--o" is unknown option ======================================================================= If I compile and link following sample on Linux statically using following command g++ -c -I. -I/usr/local/include/boost-1_38 -I/usr/include testprogramoptions.cpp -o testprogramoptions.o g++ testprogramoptions.o -static-libgcc -Wl,-Bstatic -L/u/neetug/Projects/performance/perfstat_cluster/lib -lboost_program_options-gcc41-mt -lpthread -o testprogramoptions [root@perf-tools-7 src]# ./testprogramoptions --o Aborted Here "--o" is unknown option ======================================================================== I am not sure why the behavior is different with different linking option why I am not getting exception for static linking. Really appreciate any help in this issue. Here in the test program #include <iostream> #include <boost/program_options.hpp> namespace boostOptions = boost::program_options; using namespace std; int main(int argCount, char* argList[]) { try { boostOptions::options_description commonOpt("Options (common)"); commonOpt.add_options() ("help,h", "Produce help message.") ("version,v", "Prints perfstat version, and supported ONTAP versions.") ; boostOptions::options_description runModeOpt("Options ('run' mode)"); runModeOpt.add_options() ("clusterinfo", boostOptions::value<string>(), "cluster IP.") ("sample-interval", boostOptions::value<int>(), "Specifies statit/sysstat frequency") ; boostOptions::positional_options_description posOption; posOption.add("clusterinfo", -1); boostOptions::options_description allOptDesc("Allowed options :"); allOptDesc.add(commonOpt).add(runModeOpt); boostOptions::variables_map varMap; boostOptions::store(boostOptions::command_line_parser(argCount, argList). options(allOptDesc).positional(posOption).run(), varMap); boostOptions::notify(varMap); } catch(std::exception &e) { cout << "ERROR " << e.what() << "\n"; cout << "ERROR " << "Error while parsing CLI options Exiting" << "\n"; exit(0); } catch(...) { cout << "ERROR 1 " << "\n"; cout << "ERROR 1 " << "Error while parsing CLI options Exiting" << "\n"; exit(0); } } Regards, NG ----- Original Message ---- From: Neetu Garg <garg_neetu(a)yahoo.com> To: boost-users(a)lists.boost.org Sent: Wed, March 17, 2010 1:17:07 PM Subject: program option library segfaults for exception Sorry for the duplicate post, I think my message posted under different conversation. Hi, I have application that is using boost program option library. If I provide unknown option via CLI it should throw exception. The library is statically linked on windows and Linux environment. It works fine on windows platform I do get exception for unknown CLI option. On Linux platform I get "segfault" in place of exception for unknown CLI option. It is s a multi-threaded application and it also uses boost thread library. Application does throw exception on Linux also if I link dynamically. I am using following flags to link the library statically: LDFLAGS= -fexceptions -static-libgcc -Wl,-static -L/usr/lib -lboost_program_options-gcc41-mt -lboost_filesystem-gcc41-mt -lboost_thread-gcc41-mt -lboost_system-gcc41-mt -lnet7ssh -lbotan -ltar -lz -lrt -lpthread I am using following version of gcc: # g++ --version g++ (GCC) 4.1.1 Copyright (C) 2006 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. Here is the core dump for the segfault: (gdb) backtrace #0 __gnu_internal::get_global () at /usr/software/src/gcc-4.1.1/libstdc++-v3/libsupc++/eh_globals.cc:58 #1 0x082c0f67 in __cxa_get_globals () at /usr/software/src/gcc-4.1.1/libstdc++-v3/libsupc++/eh_globals.cc:71 #2 0x082c0b3f in __cxa_allocate_exception (thrown_size=32) at /usr/software/src/gcc-4.1.1/libstdc++-v3/libsupc++/eh_alloc.cc:154 #3 0x080a71f8 in boost::program_options::detail::cmdline::finish_option () #4 0x080a77eb in boost::program_options::detail::cmdline::run () #5 0x0806f3aa in boost::program_options::basic_command_line_parser<char>::run () #6 0x080660e9 in CLIHandler::collectCLIOptions () #7 0x0808a0d1 in perfstat::runPerfstat () #8 0x0808af3d in main () Current language: auto; currently c++ Appreciate your help Regards, NG

1 0

[Proto] Turnign grammar into primitive transform : _default is being naughty with me :(
by joel falcou 19 Mar '10

19 Mar '10

I'm polisihng some generic recursive descent grammar to evaluate various sort of expression that only differ on how nodes and leaf are treated. I was trying, once the grammar was set up using combo of transform to make a single primitive transform to speed up compile-time. Everythign worked until I hit a brick wall while trying to put the last non-generic part (the call to proto::_default) inside my own transform. Here is link to the working.cpp and not_working.cpp stand alone source file for inspection. test were done on 1.42 release. http://www.lri.fr/~falcou/tmp/working.cpp http://www.lri.fr/~falcou/tmp/not_working.cpp The error is : http://www.lri.fr/~falcou/tmp/errors.txt thanks for any pointer on this issue which, I think, is a stupid mistake on my side. -- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35

2 2

boost::asio destructor segfault?
by Sean McAllister 19 Mar '10

19 Mar '10

I've got a class that's using ASIO to run a simple server listening for command messages from a remote interface. It's got some private members to help with this (class abridged for shortness): class ClassifierContext { private: io_service ioService_; t_socket_shptr socket_; }; It runs it's event loop in it's own thread (started with boost::thread) // Hosts thread to run IO event loop void ClassifierContext::io_loop() { try { connect(); } catch (std::exception &e) { RERROR("Error connecting to site server -- %s", e.what()); } // Work object prevents run() from stopping when it runs out of work asio::io_service::work work(ioService_); ioService_.run(); } And it periodically sends data back along a single socket associated with the ioService and also has an asynchronous read pending to listen for command messages (I can post this code if needed, it's just a couple async_sends and an async_read) The problem I'm seeing comes when the destructor for the class is run: ClassifierContext::~ClassifierContext() { ioService_.stop(); } Periodically (every 20 times or so) I get a segfault when the destructor for ioService_ is called. A representative stack trace looks like this: #0 0x0921bfd6 in ?? () #1 0x08125877 in boost::asio::detail::reactor_op_queue<int>::destroy_operations ( this=0x8ec5f40) at opt/linux/include/boost/asio/detail/reactor_op_queue.hpp:268 #2 0x081274ad in boost::asio::detail::epoll_reactor<false>::shutdown_service ( this=0x8ec5ed8) at opt/linux/include/boost/asio/detail/epoll_reactor.hpp:119 #3 0x08127b3b in ~service_registry (this=0x8ec5958) at opt/linux/include/boost/asio/detail/service_registry.hpp:75 #4 0x08127c29 in ~io_service (this=0x8492360) at opt/linux/include/boost/asio/impl/io_service.ipp:62 #5 0x08117110 in ~ClassifierContext (this=0x8492360) at ClassifierContext.cpp:91 #6 0xb781cbb9 in exit () from /lib/tls/i686/cmov/libc.so.6 #7 0xb780477d in __libc_start_main () from /lib/tls/i686/cmov/libc.so.6 #8 0x081079c1 in _start () at ../sysdeps/i386/elf/start.S:119 Has anyone seen a segfault like this before? It's intermittent so that tells me there's some kind of race condition. Any idea how I can work around it?

2 8

Compile under 32bits but not under 64bits
by Juanma Font 19 Mar '10

19 Mar '10

Hello ¡¡¡ Probed with boost 1.38 and 1.40 on linux ubuntu karmic Example: check64.cpp --------------- #include "check64.hpp" int main() { point2<int> png_size1(3,4); point2<int> png_size2; wxMessageBox( wxT("Reading png dimensions prueba.png "), wxT("Hello") ); // ok, compile into 32bits and 64bits png_size2=png_size1; // ok, compile into 32bits and 64bits png_read_dimensions( "prueba.png" ); //ERROR, THIS ONLY COMPILE WITH 32bits png_size1 = png_read_dimensions( "prueba.png" ); return 0; } ---------------------------------------- The error when try to compile with 64bits is: error: no match for ‘operator=’ in ‘png_size1 = boost::gil::png_read_dimensions(const char*)()’ Anybody knows what is happening ? The head file, check64.hpp is -------------------------- check64.hpp ------------- #ifndef CHECK64_HPP_INCLUDED #define CHECK64_HPP_INCLUDED #include <boost/gil/gil_all.hpp> #include <boost/gil/extension/io/png_io.hpp> #include <wx/wx.h> using namespace boost; using namespace boost::gil; using namespace std; #endif // CHECK64_HPP_INCLUDED --------------------------end of code -------------- Thank's a lot of

2 2

vc++ assertion error upon runtime
by hitesh dhiman 19 Mar '10

19 Mar '10

Hi all, I'm trying to gain access to functions that use pointers as arguments. I have written the wrapper file that converts the arguments into pointers. The compilation works successfully, but when i try to run the code from python, it gives an assertion error: Debug Assertion Failed! Expression: Vector subscript out of range Surprisingly, this error only occurs when a particular function is called, Until that point, the code works perfectly. Could someone guide me what to do?? -- Regards, Hitesh Dhiman Electrical Engineering National University of Singapore

1 0

scoped_lock lock&unlock
by weii 19 Mar '10

19 Mar '10

Dear all, I got a compiler(gcc 3.4.5) error while using boost.thread: ----------------------------------------------------------------------------- g++ -IC:\Program Files\boost\boost_1_40 -O0 -g3 -Wall -c -fmessage-length=0 -omain.o ..\main.cpp C:/Program Files/boost/boost_1_40/boost/thread/win32/basic_timed_mutex.hpp: In member function `bool boost::detail::basic_timed_mutex::timed_lock(const Duration&) [with Duration = bool]': C:/Program Files/boost/boost_1_40/boost/thread/locks.hpp:353: instantiated from `bool boost::unique_lock<Mutex>::timed_lock(const TimeDuration&) [with TimeDuration = bool, Mutex = boost::mutex]' C:/Program Files/boost/boost_1_40/boost/thread/locks.hpp:241: instantiated from `boost::unique_lock<Mutex>::unique_lock(Mutex&, const TimeDuration&) [with TimeDuration = bool, Mutex = boost::mutex]' ..\main.cpp:17: instantiated from here C:/Program Files/boost/boost_1_40/boost/thread/win32/basic_timed_mutex.hpp:118: error: no match for 'operator+' in 'boost::get_system_time() + timeout' C:/Program Files/boost/boost_1_40/boost/date_time/time.hpp:140: note: candidates are: T boost::date_time::base_time<T, time_system>::operator+(const typename time_system::date_duration_type&) const [with T = boost::posix_time::ptime, time_system = boost::posix_time::posix_time_system] C:/Program Files/boost/boost_1_40/boost/date_time/time.hpp:160: note: T boost::date_time::base_time<T, time_system>::operator+(const typename time_system::time_duration_type&) const [with T = boost::posix_time::ptime, time_system = boost::posix_time::posix_time_system] C:/Program Files/boost/boost_1_40/boost/operators.hpp:255: note: boost::date_time::date_duration<boost::gregorian::date_duration_rep> boost::operator+(const boost::date_time::date_duration<boost::gregorian::date_duration_rep>&, const boost::date_time::date_duration<boost::gregorian::date_duration_rep>&) C:/Program Files/boost/boost_1_40/boost/date_time/posix_time/date_duration_operators.hpp:76: note: boost::posix_time::ptime boost::posix_time::operator+(const boost::posix_time::ptime&, const boost::gregorian::years&) C:/Program Files/boost/boost_1_40/boost/date_time/posix_time/date_duration_operators.hpp:32: note: boost::posix_time::ptime boost::posix_time::operator+(const boost::posix_time::ptime&, const boost::gregorian::months&) C:/Program Files/boost/boost_1_40/boost/date_time/date_duration_types.hpp:245: note: boost::gregorian::date boost::date_time::operator+(const boost::gregorian::date&, const boost::date_time::years_duration<boost::gregorian::greg_durations_config>&) C:/Program Files/boost/boost_1_40/boost/date_time/date_duration_types.hpp:133: note: boost::gregorian::date boost::date_time::operator+(const boost::gregorian::date&, const boost::date_time::months_duration<boost::gregorian::greg_durations_config>&) Build error occurred, build is stopped ----------------------------------------------------------------------------------------------------------------------------- The following is my code: ----------------------------------------------------------------------------------------------------------------------------- #include <boost/thread/thread.hpp> #include <boost/thread/mutex.hpp> #include <boost/bind.hpp> #include <iostream> boost::mutex io_mutex; void count(int id) { boost::mutex::scoped_lock lock(io_mutex,false); for (int i = 0; i < 10; ++i) { lock.lock(); std::cout << id << ": " << i << std::endl; lock.unlock(); } } int main(int argc, char* argv[]) { boost::thread thrd1(count, 1); boost::thread thrd2(count, 2); thrd1.join(); thrd2.join(); return 0; } ----------------------------------------------------------------------------- I know I can just abandon the lock() and unlock() function since the constructor and destructor will do them for me. But I can't understand how this error occurs and why the compiler has something to do with basic_timed_mutex. Anyone can give me some clues? Thanks in advance.

1 1

[interprocess] Sharing data in a peer-to-peer fashion
by Brett Gmoser 19 Mar '10

19 Mar '10

Hello, I'm working on what seems to be a fairly interesting problem, and I'm looking for any interprocess experts to lend any advice. After reading all of the documentation for Interprocess, it seems that all of the examples work with a "one parent, many children" type model. The problem that I am having is that I am working with a "many children, no parent" model. My processes are spawned by the web server (and FastCGI), so there is no easy way to modify that code to manage the interprocess data. At least one instance of my program is meant to stay alive forever, so I'm not very concerned about deleting the interprocess data at any time. My problem however is the mutexes, and the stale locks that result if one of the processes crashes or exits abnormally. It seems that once an instance of my application crashes, no other instance may ever get a lock on the shared mutex, because the original process still holds a lock. I've thought of a few different ideas to solve this problem: * Using an interprocess shared_ptr for the mutex and data, with a custom deleter to remove all instances once the last application is exiting and the use count is zero. However this suffers from the same problem - it seems the use count is never decremented when the application exits abnormally (for example, kill -9, crash, or CTRL+C). * Using a "heart beat" type system to keep track of processes. My idea was to do something like this: Keep an interprocess associative array of process ID's mapped to last heartbeat time, with each process updating it's own heartbeat. At the same time, every other process (since there is no one parent process) must keep track of the heartbeats, and remove processes from the array which have not responded with a heartbeat in awhile. The problem is this - what about the mutex for the associative array? And the locks that another application might have on them? I wind up back at the point that I started at. The stale locks are destroyed if the mutex is deleted (via boost::interprocess::named_mutex::delete), and I can detect the stale lock pretty reliably with a timed try lock (wait 30 seconds or so to aquire the lock, if it can never be acquired then there is obviously a problem). But what of thread safety, since I now have to delete the lock and re-create it, where other processes might wind up doing the same thing? And what if those other processes are also trying to obtain a lock on the mutex at the same time I'm deleting and recreating it? Those are pretty much the only ideas I've had. Does anybody have anything better? Maybe some of you have tackled a similar problem? Thanks!

2 1

passing pointers from python
by hitesh dhiman 19 Mar '10

19 Mar '10

Hi all, i'm trying to wrap c++ functions that have pointer variables. The test example i'm using is shown below: int World::addition(int* a, int* b) { int z = *a + *b; return z; } Now, i defined it in my wrapper as : .def("addition", &World::addition) My code compiles, but when I try to execute it from python, i get this error: Python Argument types in World.Addition(World, int, int) did not match C++ signature: addition(class World {lvalue}, int* , int*) The problem is, how to get hold of a pointer in python? Or is there a workaround to define the function differently in the wrapper file? -- Regards, Hitesh Dhiman Electrical Engineering National University of Singapore

2 2

Initialising boost::interprocess::basic_string using std::string
by med ennemri 19 Mar '10

19 Mar '10

Hi all How to initialising boost::interprocess::basic_string using std::string; -- One God is Allah, all prophets are humans.

2 1

[boost-users][[proto] : Seeking advice on a DSL
by Manjunath Kudlur 19 Mar '10

19 Mar '10

Hello, I want to create a DSL where users are allowed to create "free" variables and then use them are parameters and local variables in their mini-program. For example, I want to have something like int_ a,b,c; Program(&a,b) [c = b*2, a = c] The parameter with the '&' prefix represents output, the ones without represent input. So, Program(&a, b)[...] should behave as a function object with prototype void foo(int&, const int), and I should be able to do the following : int ra; BOOST_AUTO(pr, Program(&a,b) [c = b*2, a = c]); pr(ra, 4); I am seeking some advice on implementing the "evaluator" for this language. In particular, where do I store the values corresponding to these free variables? To draw parallels with Boost.Phoenix, in phoenix, arg1, arg2.. etc are uniquely typed, and the evaluator just creates a fusion::vector<...> with the values passed in, and argN evaluation just returns fusion::at_c<N>(env.args()). In my case, I could create a unique ID for each free variable, and create a std::map from ID to value, and use that as the environment. Evaluator of the free variables can then look up that map to find values. But I consider this too heavy weight. In contrast, the fusion::vector<...> would incur very little overhead during run time. I will be grateful for any suggestions on other ways to implement the evaluator. Thanks in advance, Manjunath

2 6

custom allocators, pool_alloc release_memory() seems to be broken
by B Hart 18 Mar '10

18 Mar '10

I tried contacting Stephen the pool_allocator author, but his e-mail is invalid (shouldn't the docs be updated?) Here is what I wrote in case someone else here can offer some help: I'm trying unsuccessfully to use your Boost::pool_alloc. In the documentation at the boost website: http://www.boost.org/doc/libs/1_42_0/libs/pool/doc/interfaces.html it says: // Exiting the function does NOT free the system memory allocated by the pool allocator // You must call // boost::singleton_pool<boost::pool_allocator_tag, sizeof(int)>::release_memory() // in order to force that release_memory() does not seem to work. Not sure why. I called a function in my code to verify my processes memory usage, and see that indeed memory was not being released. I also google searched and found that others experienced the same: http://groups.google.ms/group/boost-list/browse_thread/thread/7d350f4c30d76… http://article.gmane.org/gmane.comp.lib.boost.devel/179196 http://lists.boost.org/Archives/boost/2008/08/141468.php http://archives.free.net.ph/message/20080827.184624.21654313.en.html Your help on this is requested. Thanks.

2 6

shared_ptr with custom allocator but default deleter?
by Rhys Ulerich 18 Mar '10

18 Mar '10

I'm missing something w.r.t. shared_ptr and custom allocators... I'd like to use the following shared_ptr constructor template<class Y, class D, class A> shared_ptr(Y * p, D d, A a); with a custom allocator but "the usual deleter behavior". I'm confused about what to supply for 'd'. Restating my confusion, first pretend the signature was this template<class Y, class A> shared_ptr(Y * p, A a); and ignore the normal shared_ptr two argument constructor for the moment. Now pretend I could implement this hypothetical two argument version by delegating to the three argument version. What would I supply as the 'd' parameter? - Rhys

2 1

[SoC] Summer of Code
by Andrew Sutton 18 Mar '10

18 Mar '10

All, Boost is once again participating in the Google Summer of Code program. If you are a student who is interested in contributing to Boost, now would be a good time to discuss your plans on the *developer's* mailing list ( http://lists.boost.org/mailman/listinfo.cgi/boost) Student applications will be accepted here starting March 29, and can be submitted here: http://socghop.appspot.com/. If you have any questions, please feel free to ask me directly or respond to this message. Cheers, Andrew Sutton andrew.n.sutton(a)gmail.com

1 0

[asio] Problem Assignin a File Descriptor to posix:basic_stream_descriptor
by Nader Salehi 18 Mar '10

18 Mar '10

Hi All, I want to use Boost ASIO as an event manager in a server which, among other things, asynchronously writes into a file. I use open() to create my file and then try to assign it to a posix::stream_descriptor object. However, the following simple code throws an "Operation not permitted" exception. int main () { boost::asio::io_service ioService; int fd = open("./asio_sample.txt", O_WRONLY | O_CREAT | O_ASYNC | O_NONBLOCK, S_IRUSR | S_IWUSR | S_IRGRP); assert(fd != -1); boost::asio::posix::stream_descriptor descriptor(ioService); descriptor.assign(fd); return 0; } I traced down the epoll_reactor::register_descriptor() where the function fails to add the descriptor to the poll list. Any idea what I am doing wrong? I would appreciate any comment. Cheers, Nader

2 3

[graph] Problem compiling simple graph code with recent g++
by Stephen Kell 18 Mar '10

18 Mar '10

I'm having some problems with the Boost Graph library in 1.42. Specifically, if I include the graph concepts header before declaring my overloads of vertices, out_edges et al, the compiler can't see my overloads. I've produced a small-ish test case (below) which doesn't compile with g++ 4.4.3. (It's not supposed to link...) In file included from test.cpp:3: /home/srk31/opt/include/boost/graph/graph_concepts.hpp: In destructor ?boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = Gr]?: /home/srk31/opt/include/boost/graph/graph_concepts.hpp:166: instantiated from ?static void boost::concept::requirement<Model>::failed() [with Model = boost::concepts::VertexListGraphConcept<Gr>]? /home/srk31/opt/include/boost/concept_check.hpp:43: instantiated from ?void boost::function_requires(Model*) [with Model = boost::concepts::VertexListGraphConcept<Gr>]? test.cpp:49: instantiated from here /home/srk31/opt/include/boost/graph/graph_concepts.hpp:187: error: no matching function for call to ?vertices(Gr&)? /home/srk31/opt/include/boost/graph/graph_concepts.hpp: In member function ?void boost::concepts::VertexListGraph<G>::const_constraints(const G&) [with G = Gr]?: /home/srk31/opt/include/boost/graph/graph_concepts.hpp:189: instantiated from ?boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = Gr]? /home/srk31/opt/include/boost/graph/graph_concepts.hpp:166: instantiated from ?static void boost::concept::requirement<Model>::failed() [with Model = boost::concepts::VertexListGraphConcept<Gr>]? /home/srk31/opt/include/boost/concept_check.hpp:43: instantiated from ?void boost::function_requires(Model*) [with Model = boost::concepts::VertexListGraphConcept<Gr>]? test.cpp:49: instantiated from here /home/srk31/opt/include/boost/graph/graph_concepts.hpp:201: error: no matching function for call to ?vertices(const Gr&)? What's odd is that if I move the #include of boost/graph/graph_concepts.hpp to *below* my overloads, it does work. However, that code reordering is not an option in the actual context where I'm having this problem. Can anyone see anything wrong with my code, or verify that they do or don't see the same problem? I'm thinking it's a compiler bug but am not sure... will file it in gcc bugzilla if I'm not proved wrong here. It does build successfully with g++ 4.1.2. If anyone knows a workaround, or has other suggestions, I'd be very grateful. Anyway, thanks for reading! Stephen #include <utility> #include <boost/graph/graph_traits.hpp> #include <boost/graph/graph_concepts.hpp> struct Gr { }; namespace boost { template <> struct graph_traits <Gr> { typedef void *vertex_descriptor; typedef std::pair<void*, void*> edge_descriptor; typedef void **vertex_iterator; typedef directed_tag directed_category; typedef allow_parallel_edge_tag edge_parallel_category; struct traversal_tag : public virtual vertex_list_graph_tag, public virtual incidence_graph_tag {}; typedef traversal_tag traversal_category; typedef size_t vertices_size_type; typedef size_t edges_size_type; typedef size_t degree_size_type; typedef std::pair <void*, void*> *out_edge_iterator; }; typedef std::pair<graph_traits<Gr>::out_edge_iterator, graph_traits<Gr>::out_edge_iterator> edge_iter_pair; typedef std::pair<graph_traits<Gr>::vertex_iterator, graph_traits<Gr>::vertex_iterator> vertex_iter_pair; edge_iter_pair out_edges (graph_traits<Gr>::vertex_descriptor u, const Gr& g); graph_traits<Gr>::degree_size_type out_degree( graph_traits<Gr>::vertex_descriptor u, const Gr & g); graph_traits<Gr>::vertex_descriptor source( graph_traits<Gr>::edge_descriptor e, const Gr & g); graph_traits<Gr>::vertex_descriptor target( graph_traits <Gr>::edge_descriptor e, const Gr & g); vertex_iter_pair vertices (const Gr & g); graph_traits<Gr>::vertices_size_type num_vertices(const Gr & g); } // end namespace boost int main () { Gr g; boost::out_edges (*boost::vertices (g).first, g); boost::function_requires < boost::IncidenceGraphConcept < Gr > >(); boost::function_requires < boost::VertexListGraphConcept < Gr > >(); }

2 2

[Interprocess] create a managed_mapped_file without allocator mutex?
by Andy Wiese 18 Mar '10

18 Mar '10

I'm using managed_mapped_file to hold an index for a small property database. In various operations of boost ::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0ul> the process frequently blocks on boost::interprocess::interprocess_mutex::lock I synchronize all access to this file using interprocess mutex utilities, so write access is restricted to one single-threaded process at a time. I have looked for a deadlock between my outer mutex and the allocator's mutex, but I haven't been able to detect any process blocking on my mutex. It also might be that a process crashes while holding the allocator mutex, but in that case I don't know how to flush the allocators mutex (like I can with my own). I'm wondering if I need the allocator mutex at all, since I provide synchronization at a higher level. Is it possible to create a: typedef basic_managed_mapped_file< char,rbtree_best_fit< mutex_family >,iset_index > managed_mapped_file; That uses some kind of no-op mutex family? Can anyone give me a hint how to declare such a thing? Thanks much for any advice, Andy

2 2

Query Regarding mixing two different version of boost with same c++ application at same time
by akhilesh singh 18 Mar '10

18 Mar '10

Hi Boost users, Can we mix two different version of boost library(boost 1.34.1 and boost 1.39.0) with same appliaction at the same time? and if not, whether it will cause issue? Any help will be apprciated. Thanks Akhil

1 0

How are template arguments to rbtree_best_fit resolved
by Eric Whitcombe 18 Mar '10

18 Mar '10

I am stepping through interprocess shared memory code and I was a little confused by the offset_ptr code that I was hitting. I cannot figure out how that is specified to the template of rbtree_best_fit. I see in boost/interprocess/interprocess_fwd.hpp declaring managed_shared_memory by typedef'ing basic_managed_shared_memory with rbtree_best_fit<mutex_family> as the AllocationAlgorithm argument but I can't figure out how offset_ptr is is supplied as the VoidPointer argument to the rbtree_best_fit template. That template has 3 arguments but the forward declaration only provides one. Are the other two somehow inferred? If so, how?

2 1

Copy MPL sequence at runtime?
by Rhys Ulerich 18 Mar '10

18 Mar '10

Evening all, I'd like to copy the contents of a boost::mpl::vector_c (or similar) into an output iterator at runtime. I've not found a clean way to get an MPL sequence into a runtime-usable form. So far, I've gotten the included ugliness to work. 0) Is there some simple, idiomatic way to accomplish this goal that I've missed? 1) Any suggestions for how to clean this up? Specifically ways to reduce the assumptions about the underlying MPL sequence or fixes for braindead mistakes I've made? 2) Is there some way to have syntax like 'seqcopy<S>(iter)' where the iterator type is deduced but the sequence type is explicit? Thanks, Rhys #define BOOST_TEST_MODULE $Id: test_mpl.cc 996 2010-03-18 07:04:23Z rhys $ #include <boost/mpl/empty.hpp> #include <boost/mpl/front.hpp> #include <boost/mpl/pop_front.hpp> #include <boost/mpl/vector_c.hpp> #include <boost/utility.hpp> #include <boost/test/included/unit_test.hpp> using boost::disable_if; using boost::mpl::empty; using boost::mpl::front; using boost::mpl::pop_front; template<typename S, typename FI, class Enable = void> struct seqcopy { void operator()(FI fi) {} }; template<typename S, typename FI> struct seqcopy<S, FI, typename disable_if<typename empty<S>::type>::type> { void operator()(FI fi) { *fi++ = front<S>::type::value; seqcopy<typename pop_front<S>::type, FI>()(fi); } }; BOOST_AUTO_TEST_CASE( testing ) { typedef boost::mpl::vector_c<int,2,4,6> values; int a[3]; seqcopy<values, int*>()(a); BOOST_CHECK_EQUAL(a[0], 2); BOOST_CHECK_EQUAL(a[1], 4); BOOST_CHECK_EQUAL(a[2], 6); }

4 4

Problem Using managed_shared_memory
by med ennemri 18 Mar '10

18 Mar '10

Hi all I have a problem using managed_shared_memory , I can only read strings that has size less that 16 characters. This is my server code ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #include <boost/interprocess/managed_shared_memory.hpp> #include <utility> #include <iostream> int main () { using namespace boost::interprocess; typedef std::pair<std::string, int> FileState; try{ shared_memory_object::remove("MySharedMemory"); managed_shared_memory segment(create_only, "MySharedMemory", 655360); std::string str1 = "aaaaaaaaaaaaaaabbb";//client can only read <16 sized strings std::string str2 = "baaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"; std::string str3 = "caaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"; std::string *instance1 = segment.construct<std::string>("1")(str1); std::string *instance2 = segment.construct<std::string>("2")(str2); std::string *instance3 = segment.construct<std::string>("3")(str3); while(segment.get_num_named_objects() > 0) std::cout<<"Memory is ready"<<std::endl; } catch(...){ shared_memory_object::remove("MySharedMemory"); throw; } shared_memory_object::remove("MySharedMemory"); return 0; } ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// Here is my client code ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #include <boost/interprocess/managed_shared_memory.hpp> #include <cstddef> #include <utility> #include <cassert> #include <iostream> #include <fstream> int main (int argc, char *argv[]) { using namespace boost::interprocess; try{ managed_shared_memory segment(open_only, "MySharedMemory"); std::pair<std::string*, std::size_t> res; int a = 1; std::ostringstream oss; oss<<a; res = segment.find<std::string> (const_cast<char*>(oss.str().c_str())); if(res.second != 0) { std::cout<<*(res.first)<<std::endl; segment.destroy<std::string>(const_cast<char*>(oss.str().c_str())); } } catch(...){ shared_memory_object::remove("MySharedMemory"); throw; } shared_memory_object::remove("MySharedMemory"); return 0; } ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// Best Regards

2 2

Weird problem with boost::noncopyable and boost::mutex
by Daniel V 18 Mar '10

18 Mar '10

Hi, *I was doing a program in C++ where I simulate a Java's ArrayList...* * * template <class T> class Duo { public: Duo *next; T element; Duo(T el,Duo *sig) { element=el; next=sig; } ~Duo() {}; Duo* getNext() {return next;} T getElement() {return element;} void setNext(Duo *myNext) {next=myNext;} void setElement(T el){element=el;} }; template <class T> class ArrayList { public: Duo <T>*Ptr_First; Duo <T>*Ptr_Last; ArrayList(){Ptr_First = Ptr_Last = NULL;}; ~ArrayList(){} void insert(T el); std::pair<T, int> get(int index); }; template <class T> void ArrayList<T>::insert(T elem) { Duo<T> *ptr_walker = Ptr_First; Duo<T> *ptr_cache; if (Ptr_First == NULL && Ptr_Last == NULL) { Duo<T> *Ptr_temp = new Duo<T>(elem, NULL); Ptr_First = Ptr_temp; Ptr_Last = Ptr_temp; } else { while (ptr_walker->getNext() != NULL) ptr_walker = ptr_walker->getNext(); ptr_cache = ptr_walker; Duo<T> *Ptr_temp = new Duo<T>(elem, NULL); Ptr_Last = Ptr_temp; ptr_walker->setNext(Ptr_temp); } } template <class T> std::pair<T, int> ArrayList<T>::get(int index) { Duo<T> *ptr_walker; std::pair <T, int> receiver; receiver.first = ptr_walker->getElement(); receiver.second = 0; bool found = false; if ((Ptr_First == NULL) && (Ptr_Last == NULL)) return receiver; else { ptr_walker = Ptr_First; for (int i = 0; i<index; i++) { ptr_walker = ptr_walker->getNext(); } receiver.first = ptr_walker->getElement(); receiver.second = 1; return receiver; } } *The thing is that I instanciated an ArrayList object and called the "insert" method and I received an error from boost::mutex AND boost::noncopyable!! and I am not using them at all!!* *This is the code that generates the error:* ArrayList<ObjectA> myArrayListA; ObjectA myObjectA; myArrayListA.insert(myObjectA); *and the errors I got:* mkdir -p build/Debug/GNU-MacOSX rm -f build/Debug/GNU-MacOSX/main.o.d g++ -pthreads -lboost_thread -c -g -fPIC -MMD -MP -MF build/Debug/GNU-MacOSX/main.o.d -o build/Debug/GNU-MacOSX/main.o main.cpp /usr/local/include/boost/noncopyable.hpp: In copy constructor 'boost::mutex::mutex(const boost::mutex&)': In file included from main.cpp:23: /usr/local/include/boost/noncopyable.hpp:27: error: 'boost::noncopyable_::noncopyable::noncopyable(const boost::noncopyable_::noncopyable&)' is private /usr/local/include/boost/thread/pthread/mutex.hpp:31: error: within this context ObjectA.h: In copy constructor 'ObjectA::ObjectA(const ObjectA&)': ObjectA.h:18: note: synthesized method 'boost::mutex::mutex(const boost::mutex&)' first required here *Any Ideas why am I receiving this errors?* THANKS!! Dann

3 4

[multi_index] Is replace() ok within container iteration loop?
by PB 18 Mar '10

18 Mar '10

Hello, This question is about boost:multi_index_container. Code is iterating over a multi_index_container and replacing some elements. The data being replaced has nothing to do with any keys/indices. Is this allowed by multi_index_container? Thanks, Pete

2 2

[asio] async_read_until'smatch_condition requirements/guarantees
by Maxim Yanchenko 18 Mar '10

18 Mar '10

Hi Chris/All, I didn't find anything about this in the docs, so asking here. Why I'm asking: for some protocols matching condition can be pretty complex and will include some parsing of a partially received message. It would be great to reuse information that was already parsed, to avoid parsing same things many times. Also, when we finally received the whole message and match_condition returns true, the handler is invoked which will do mostly the same parsing that was already made by the match_condition - this is also a thing that would be great to avoid. 1) Is the same match_condition object used every time, or multiple copies can be created? 2) Does the state of the match_condition object persist between different condition checks? 3) How match_condition is used if we have several threads? Should I protect access to the state with this regard? 4) In which thread match_condition is executed? is it internal asio thread or one of the threads that called io_service.run()? 5) What if I call the handler code right in the match_condition if the condition is met? In this case I can reuse data I already extracted while checking the condition, and will also avoid waiting for my handler in the asio queue. 6) Same as 5), with one addition - what if I have only one thread that calls io_service.run()? Of course I can figure out all this stuff from the source code, but it's obviously subject to change, so I would better rely on something more stable, like docs (would be great to eventually have answers to the above questions in the docs). Thanks, Maxim

1 0

[boost-users] [assign] std::vector initialisation by boost::assign::list_of
by Andrey Torba 18 Mar '10

18 Mar '10

The code is compilable on msvc but is not on gcc-4.3: #include <boost/assign/list_of.hpp> #include <vector> int main() { //OK std::vector<int> v = boost::assign::list_of(1)(2); // error std::vector<int> v(boost::assign::list_of(1)(2)); return 0; } I can initialise std::vector in a first way. But the problem occurs when i try to initialise std::vector in a class initialization list: class sss { std::vector<int> v; sss() : v(boost::assign::list_of(1)(2)) {} }; -- Regards, Andrey

2 7

custom allocators, pool_alloc, more questions
by B Hart 18 Mar '10

18 Mar '10

I asked for explanation about custom allocators, but unfortunately the answers I got led to more questions which didn't get answered. Supposing a code block: { std::set<unsigned int, std::less<unsigned int>, boost::pool_allocator<unsigned int>> v; const int K = 10485750; for(int i=0; i<K; i++) { v.insert(i); } } //Does memory get released automatically here? or after the line: boost::singleton_pool<boost::pool_allocator_tag, sizeof(unsigned int)>::release_memory(); //what is release_memory() doing besides just setting the node type to a default? Why does that matter? Last, is the life of the singleton instance for the duration of program execution, or just the codeblock?

1 0

Spirit question
by philip tucker 17 Mar '10

17 Mar '10

Please see attached code. Why does line A compile while line B doesn't? Thanks.

4 5

program option library segfaults for exception
by Neetu Garg 17 Mar '10

17 Mar '10

Sorry for the duplicate post, I think my message posted under different conversation. Hi, I have application that is using boost program option library. If I provide unknown option via CLI it should throw exception. The library is statically linked on windows and Linux environment. It works fine on windows platform I do get exception for unknown CLI option. On Linux platform I get "segfault" in place of exception for unknown CLI option. It is s a multi-threaded application and it also uses boost thread library. Application does throw exception on Linux also if I link dynamically. I am using following flags to link the library statically: LDFLAGS= -fexceptions -static-libgcc -Wl,-static -L/usr/lib -lboost_program_options-gcc41-mt -lboost_filesystem-gcc41-mt -lboost_thread-gcc41-mt -lboost_system-gcc41-mt -lnet7ssh -lbotan -ltar -lz -lrt -lpthread I am using following version of gcc: # g++ --version g++ (GCC) 4.1.1 Copyright (C) 2006 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. Here is the core dump for the segfault: (gdb) backtrace #0 __gnu_internal::get_global () at /usr/software/src/gcc-4.1.1/libstdc++-v3/libsupc++/eh_globals.cc:58 #1 0x082c0f67 in __cxa_get_globals () at /usr/software/src/gcc-4.1.1/libstdc++-v3/libsupc++/eh_globals.cc:71 #2 0x082c0b3f in __cxa_allocate_exception (thrown_size=32) at /usr/software/src/gcc-4.1.1/libstdc++-v3/libsupc++/eh_alloc.cc:154 #3 0x080a71f8 in boost::program_options::detail::cmdline::finish_option () #4 0x080a77eb in boost::program_options::detail::cmdline::run () #5 0x0806f3aa in boost::program_options::basic_command_line_parser<char>::run () #6 0x080660e9 in CLIHandler::collectCLIOptions () #7 0x0808a0d1 in perfstat::runPerfstat () #8 0x0808af3d in main () Current language: auto; currently c++ Appreciate your help Regards, NG

1 0

Signal code: Address not mapped (1) eroor
by alev mutlu 17 Mar '10

17 Mar '10

Hi, I am getting the following run time errors for the code below. Any suggestions? _alev [ceng34:00724] *** Process received signal *** [ceng34:00724] Signal: Segmentation fault (11) [ceng34:00724] Signal code: Address not mapped (1) [ceng34:00724] Failing at address: 0xfffffffffffffff8 [ceng34:00724] [ 0] /lib64/libpthread.so.0 [0x315880de80] [ceng34:00724] [ 1] /usr/lib64/libstdc++.so.6(_ZN9__gnu_cxx18__exchange_and_addEPVii+0x2) [0x385dab7672] [ceng34:00724] [ 2] /usr/lib64/libstdc++.so.6(_ZNSs6assignERKSs+0x9b) [0x385da9ca4b] [ceng34:00724] [ 3] test-boost(_ZN5fieldaSERKS_+0x47) [0x42197f] [ceng34:00724] [ 4] test-boost(_ZNSt6__copyILb0ESt26random_access_iterator_tagE4copyIPK5fieldPS3_EET0_T_S8_S7_+0x3c) [0x4221be] [ceng34:00724] [ 5] test-boost(_ZSt10__copy_auxIPK5fieldPS0_ET0_T_S5_S4_+0x29) [0x422203] [ceng34:00724] [ 6] test-boost(_ZNSt13__copy_normalILb0ELb0EE6copy_nIPK5fieldPS2_EET0_T_S7_S6_+0x25) [0x42222b] [ceng34:00724] [ 7] test-boost(_ZSt4copyIPK5fieldPS0_ET0_T_S5_S4_+0x2d) [0x42225b] [ceng34:00724] [ 8] test-boost(_ZN5boost3mpi6detail12scatter_implI5fieldEEvRKNS0_12communicatorEPKT_PS7_iiN4mpl_5bool_ILb0EEE+0x90) [0x42a630] [ceng34:00724] [ 9] test-boost(_ZN5boost3mpi7scatterI5fieldEEvRKNS0_12communicatorEPKT_PS6_ii+0x50) [0x42b162] [ceng34:00724] [10] test-boost(_ZN5boost3mpi7scatterI5fieldEEvRKNS0_12communicatorERKSt6vectorIT_SaIS7_EEPS7_ii+0x55) [0x42b1db] [ceng34:00724] [11] test-boost(main+0x20e) [0x420880] [ceng34:00724] [12] /lib64/libc.so.6(__libc_start_main+0xf4) [0x3157c1d8b4] [ceng34:00724] [13] test-boost(__gxx_personality_v0+0x169) [0x420489] [ceng34:00724] *** End of error message *** mpirun noticed that job rank 0 with PID 724 on node ceng34-ib exited on signal 11 (Segmentation fault). #include <boost/mpi/environment.hpp> #include <boost/mpi/communicator.hpp> #include <boost/mpi/collectives.hpp> #include <boost/thread/barrier.hpp> #include <boost/thread/mutex.hpp> #include <boost/config.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/access.hpp> #include <boost/serialization/string.hpp> #include <boost/mpi/skeleton_and_content.hpp> #include <boost/mpi/datatype.hpp> #include <boost/mpi/allocator.hpp> #include <boost/archive/tmpdir.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/base_object.hpp> #include <boost/mpi.hpp> #include <boost/tokenizer.hpp> #include <boost/archive/tmpdir.hpp> #include <boost/archive/binary_oarchive.hpp> #include <boost/serialization/export.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/hash_map.hpp> #include <boost/serialization/map.hpp> #include <string> #include <iostream> #include <vector> #include <fstream> #define MASTER 0 int arraySize = 7; using namespace std; namespace mpi = boost::mpi; struct field { string field_name; string field_type; string field_ref; string field_colType; }; namespace boost { namespace serialization{ template<class Archive> void serialize(Archive & ar, struct field & f, unsigned int version){ ar & f.field_name; ar & f.field_type; ar & f.field_ref; ar & f.field_colType; } } } int main(int argc, char* argv[]) { mpi::environment env(argc, argv); mpi::communicator world; int m_mySize, w_mySize, kk,i; struct field *relAllValues; struct field *relMyValues; vector<struct field> C; struct field c; w_mySize = arraySize / world.size(); cout << "w_mySize = " << w_mySize << endl; if (world.rank() == MASTER){ for(int i = 0; i < arraySize; i++){ c.field_name = "field_name=" ; c.field_type = "field_type="; c.field_ref = "field_ref="; c.field_colType = "field_colType="; C.push_back(c); } m_mySize = arraySize / world.size() + arraySize % world.size(); relMyValues = (struct field *) malloc(sizeof(struct field) * w_mySize); relAllValues = (struct field *) malloc(sizeof(struct field) * arraySize); } else{ relMyValues = (struct field *) malloc(sizeof(struct field) * w_mySize); } if (world.rank() == MASTER){ scatter(world, C, relMyValues, w_mySize, 0); } else{ scatter(world, C, relMyValues, w_mySize, 0); } if (world.rank() == 1){ cout << "MY RANK IS " << world.rank() << endl; } }

2 1

[Phoenix] : Using phoenix with zip_iterator
by Manjunath Kudlur 17 Mar '10

17 Mar '10

I have the following program where I make_zip_iterator on 2 vector<int>::iterator's and am trying to pass a Phoenix expression to std::for_each on the iterator. I wrote a lazy version of tuple.get<N> for that purpose. I get a compile error because the phoenix functor only accepts references, whereas the tuple element seems to get passed by value. What am I doing wrong? Manjunath #include <iostream> #include <vector> #include <algorithm> #include <boost/iterator/zip_iterator.hpp> #include <boost/tuple/tuple.hpp> #include <boost/spirit/include/phoenix_core.hpp> #include <boost/spirit/include/phoenix_operator.hpp> #include <boost/spirit/include/phoenix_statement.hpp> #include <boost/spirit/include/phoenix_scope.hpp> #include <boost/spirit/home/phoenix/function/function.hpp> using namespace boost::phoenix; using namespace boost::phoenix::arg_names; using namespace boost::phoenix::local_names; using namespace std; namespace fusion = boost::fusion; struct print_tuple { void operator()(const boost::tuple<int&, int&>& t) const { cout << t.get<0>() << " " << t.get<1>() << "\n"; } }; struct get0_ { template<typename Arg> struct result { typedef int type; }; template<typename Arg> int operator()(Arg a1) const { return a1.get<0>(); } }; function<get0_> get0; int main() { vector<int> a(10), b(10); for(unsigned i=0, e=a.size(); i!=e; ++i) { a[i] = i; b[i] = i; } std::for_each(a.begin(), a.end(), cout << arg1); std::for_each(boost::make_zip_iterator(boost::make_tuple(a.begin(), b.begin())), boost::make_zip_iterator(boost::make_tuple(a.end(), b.end())), cout << get0(arg1)); }

3 10

[iostreams][serialization] compressed UTF-8 XML archive
by Paul 17 Mar '10

17 Mar '10

(Was: Re: [Boost-users] Filesystem, serialization, character encoding and portable software) On 14 August 2008 00:44, Robert Ramey <ramey(a)rrsd.com> wrote: > Daniel Krügler wrote: > > Robert Ramey wrote: > >> the wide character xml archives use UTF8. > >> > >> the narrow character xml archives use the currently set locale. > >> > >> Robert Ramey > > > > Sorry for asking offhand: > > > > What is the reasoning behind this different behaviour? > > I assumed that most programs built with narrow characters used > the locale concept to deal with this. > > Wide character systems lend themselves to UTF coding so I > used that for wide char archives. In order to do this, I used > Ron Garcia's UTF code conversion facet for streams. > > It would be quite easy to generate UTF coding for narrow > character archives. Just do the following: > > a) Build the UTF code conversion facet for narrow character > input (its templated on character type). > > b) When the stream is opened, attach this facet to the stream. > > Note the the output char format is not really a property of the > serialization > library, but rather an artifact of the way it has been used. That is, the > serialization library depends on the standard stream library for this > property. > > I understand that to get a UTF-8 XML file, I need to use a wide-character stream, but I can't seem to understand how I can compress a serialized UTF-8 xml archive... it seems I can either do: namespace bio = boost::iostreams; namespace fs = boost::filesystem; fs::wofstream ofs(path,ios::binary); bio::filtering_stream<bio::output,wchar_t> out; out.push(bio::gzip_compressor()); // PROBLEM: gzip_compressor only accepts char out.push(ofs); boost::archive::xml_woarchive oa(out); --- OR --- fs::ofstream ofs(path,ios::binary); bio::filtering_stream<bio::output> out; out.push(bio::gzip_compressor()); out.push(ofs); boost::archive::xml_woarchive oa(out); // PROBLEM: only accepts wostream I've googled but haven't found anything relevant... either people use an ifstream with gzip_compressor, or they don't use gzip_compressor at all. thanks, Paul

3 2

[boost-users][test] Does memory leak detection work in linux?
by Andrey Torba 17 Mar '10

17 Mar '10

Hi all, Does memory leak detection work in linux? -- Regards, Andrey

3 4

How to write a config file parser with boost::spirit that supports line comments?
by Lars Rohwedder 17 Mar '10

17 Mar '10

Hi there, I want to write a parser for config files having many entries with this format: <name> "{" <token> [ <token> ... ] "}" The format is "free-form" so there can be line breaks and other whitespaces within each entry between the tokens etc. <name> is chset_p("a-zA-Z_"), <token> is chset_p("a-zA-Z0-9_.-"). This parser works fine so far. I extended the format to allow even whitespaces etc. in the tokens. So <token> is changed to (I omit the assign_a actions): ( +chset_p("a-zA-Z0-9_.-") | ('"' >> +(!ch_p('"')) >> '"') | ('\'' >> +(!ch_p('\'')) >> '\''; which also works fine as I tested. (I know, newlines would be allowed in these tokens but I hope noone use that.) But now I want to extend the format to also allow line comments, starting with '#', ending with '\r' or '\n', and I failed: Just scanning for '#' also recognized '#' within a quoted token. But that is not the start of a comment. :-( But first searching for quotes also catched unbalanced quote chars in comments and confused the parser. What would be a working solution for this - IMHO still simple - format? (I should mention that I am stuck with boost 1.35 so I cannot use spirit2 or all the other new features in the current release. :-(( ) Lars R.

1 0

custom allocators Re:pool_alloc
by B Hart 17 Mar '10

17 Mar '10

I am not understanding the use of pool with std::set. i.e. the release_memory() function referenced in last example shown on: http://www.boost.org/doc/libs/1_42_0/libs/pool/doc/interfaces.html seems to do nothing. I call GetProcessMemoryInfo() and don't see any change after the set has gone out of scope. maybe someone could relate what happens when set goes out of scope and release_memory() isn't called versus set goes out of scope and release_memory() is called. I want to do something like: 1.std::set<unsigned int, std::less<unsigned int>, boost::pool_allocator<unsigned int>> v; 2. for(int i=0; i<(K); i++) { v.insert(i); } 3. use v 4. release_memory() on v //dump all set elements in one action 5. repeat 1-4 with a new set

1 0

[serialization] xml files that can be hand-edited
by Paul 17 Mar '10

17 Mar '10

Hi, I'd like to build some insurance into my XML files. If there is some sort of problem in the future (either with boost, or my application), I'd like to be able to hand-edit the serialized XML archive files. Even better would be to allow XML-tools to manipulate a batch of the XML files, but one thing at a time. One big problem with the current XML format is that the class_id="3" tracking_level="0" version="0" preamble is only included the FIRST time a class is dumped to the file. Example: <brother class_id="3" tracking_level="0" version="2"> .. etc, and then later in the file ... <sister> ... etc ... If something happened (eg impossible-to-upgrade-format-change) and I needed to manually move the <sister> item above the <brother> item (maybe into a different branch of tags), then I would need to KNOW that the brother class is the same as the sister class (which is not obvious) AND move the preamble into the sister tag. I would also need to re-number all the class_ids, but those appear to be only used if I'm tracking a pointer AND I have multiple instances of that pointer in the file. If the item is not a pointer, it looks like the class_id is *always* thrown away. So, I'm thinking of: a) never allow tracking (its a compromise to give me the next item) b) never writing out class_id or tracking_level c) always writing out the version the result would look like this: <brother version="2"> .. etc, and then later in the file ... <sister version="2"> That way items in the XML file could be rearranged by hand and I would not need to do the difficult task of adjusting the tag attributes. Does this sound sensible? I had a look into inheriting and creating my own archive, but it appears all of the changes required happen in the basic_oarchive_impl, which seems pretty fundamental and hard to override. Will I need to create and maintain my own patch in order to "hack" this change. Thanks, Paul

2 1

[date time] convert UTC date-time to run-time-determined local time zone
by eburkitt＠gmail.com 17 Mar '10

17 Mar '10

I'm developing a program that will perform tasks on behalf of clients in various (US) time zones. It receives a UTC date-time from the client, along with an offset from UTC and a flag as to whether the client's area observes DST. The program needs to convert the time into both its own local time and the client's local time. I have not been able to come up with a reasonable way to do either in the date-time library. The only way I can find in the library to convert UTC to local time requires me to know the time zone at compile time. For the client I have the offset from UTC and its local DST observance policy. (I can stipulate at this point that the client uses US DST rules.) For the program itself, I have only what I can query from the computer on which it runs. Am I missing something obvious?

1 0

Re: [Boost-users] How to forward to a list of boost::function?
by OvermindDL1 17 Mar '10

17 Mar '10

-----Original Message----- From: John Ky <newhoggy(a)gmail.com> Sent: Tuesday, March 16, 2010 5:29 AM To: boost-users <boost-users(a)lists.boost.org> Subject: Re: [Boost-users] How to forward to a list of boost::function? > > Hi OvermindDL1, > > I'm having trouble finding any information on this (or some of the other alternatives presented here). For example, the following page: > > http://www.boost.org/doc/libs/1_42_0/libs/fusion/doc/html/fusion/functional… > > links to a broken link: > > http://www.boost.org/doc/libs/1_42_0/libs/functional/forward/doc/html/index… > > Anywhere I can get to the documentation on this? The work was started in 1.42, however it is finished in the trunk. Look at the functional docs on the trunk and they exist there and all code there works well. Sorry that I cannot supply actual links, not at computer (am on my phone currently).

2 1

How to pass parameters to manage_shared_memory.construct() in Boost.Interprocess
by Cuneyt Taskiran 16 Mar '10

16 Mar '10

I've stared at the Boost.Interprocess documentation for hours but still haven't been able to figure this out. In the doc, they have of creating a vector in shared memory like so: //Define an STL compatible allocator of ints that allocates from the managed_shared_memory. //This allocator will allow placing containers in the segment typedef allocator<int, managed_shared_memory::segment_manager> ShmemAllocator; //Alias a vector that uses the previous STL-like allocator so that allocates //its values from the segment typedef vector<int, ShmemAllocator> MyVector; int main(int argc, char *argv[]) { //Create a new segment with given name and size managed_shared_memory segment(create_only, "MySharedMemory", 65536); //Initialize shared memory STL-compatible allocator const ShmemAllocator alloc_inst (segment.get_segment_manager()); //Construct a vector named "MyVector" in shared memory with argument alloc_inst MyVector *myvector = segment.construct<MyVector>("MyVector")(alloc_inst); Now, I understand this. What I'm stuck is how to pass a second parameter to `segment.construct()` to specify the number of elements. The interprocess document gives the prototype for `construct()` as MyType *ptr = managed_memory_segment.construct<MyType>("Name") (par1, par2...); but when I try MyVector *myvector = segment.construct<MyVector>("MyVector")(100, alloc_inst); I get compilation errors. My questions are: 1. Who actually gets passed the parameters `par1, par2` from `segment.construct`, the constructor of the object, e.g. `vector`? My understanding is that the template allocator parameter is being passed. Is that correct? 2. How can I add another parameter, in addition to `alloc_inst` that is required by the constructor of the object being created in shared memory? Thanks!

4 4

[serialization] polymorphic portable binary example not working.
by Mostafa 16 Mar '10

16 Mar '10

Hi all, Can someone please shed some light on this. I'm trying to compile the polymorphic portable binary serializor in the examples directory and getting compiler errors. Some I managed to fix because a file seemed to have been deleted and its class moved to another file, but this one has stumped me. In polymorphic_portable_binary_oarchive.hpp, its complaining about: #include <boost/archive/detail/polymorphic_oarchive_dispatch.hpp> which is needed for: typedef boost::archive::detail::polymorphic_oarchive_dispatch< portable_binary_oarchive > polymorphic_portable_binary_oarchive; Obviously polymorphic_oarchive_dispatch.hpp is missing and there isn't a class definition for polymorphic_oarchive_dispatch in any other files. (I've downloaded the boost source code so I'm not relying on any packages.) Any help on how to resolve this would be appreciated. Thanks, Mostafa

2 13

scatter error
by alev mutlu 16 Mar '10

16 Mar '10

Hi The code below compiles fine , but gives the [ceng1:23288] *** Process received signal *** [ceng1:23288] Signal: Segmentation fault (11) [ceng1:23288] Signal code: Address not mapped (1) [ceng1:23288] Failing at address: 0xfffffffffffffff9 [ceng1:23288] [ 0] /lib64/libpthread.so.0 [0x3baf40de80] [ceng1:23288] [ 1] /usr/lib64/libstdc++.so.6(_ZN9__gnu_cxx18__exchange_and_addEPVii+0x2) [0x38d9cb7672] [ceng1:23288] [ 2] /usr/lib64/libstdc++.so.6(_ZNSs6assignERKSs+0x9b) [0x38d9c9ca4b] [ceng1:23288] [ 3] test-boost(_ZN5fieldaSERKS_+0x47) [0x4219a1] [ceng1:23288] [ 4] test-boost(_ZNSt6__copyILb0ESt26random_access_iterator_tagE4copyIPK5fieldPS3_EET0_T_S8_S7_+0x3c) [0x4221e0] [ceng1:23288] [ 5] test-boost(_ZSt10__copy_auxIPK5fieldPS0_ET0_T_S5_S4_+0x29) [0x422225] [ceng1:23288] [ 6] test-boost(_ZNSt13__copy_normalILb0ELb0EE6copy_nIPK5fieldPS2_EET0_T_S7_S6_+0x25) [0x42224d] [ceng1:23288] [ 7] test-boost(_ZSt4copyIPK5fieldPS0_ET0_T_S5_S4_+0x2d) [0x42227d] [ceng1:23288] [ 8] test-boost(_ZN5boost3mpi6detail12scatter_implI5fieldEEvRKNS0_12communicatorEPKT_PS7_iiN4mpl_5bool_ILb0EEE+0x90) [0x42a652] [ceng1:23288] [ 9] test-boost(_ZN5boost3mpi7scatterI5fieldEEvRKNS0_12communicatorEPKT_PS6_ii+0x50) [0x42b184] [ceng1:23288] [10] test-boost(_ZN5boost3mpi7scatterI5fieldEEvRKNS0_12communicatorERKSt6vectorIT_SaIS7_EEPS7_ii+0x55) [0x42b1fd] [ceng1:23288] [11] test-boost(main+0x231) [0x4208a3] [ceng1:23288] [12] /lib64/libc.so.6(__libc_start_main+0xf4) [0x3bae81d8b4] [ceng1:23288] [13] test-boost(__gxx_personality_v0+0x169) [0x420489] [ceng1:23288] *** End of error message *** mpirun noticed that job rank 0 with PID 23288 on node ceng1-ib exited on signal 11 (Segmentation fault). run time errors. Is this due to miss-use of boost functions or am I doing wrong with memory allocation? #include <boost/mpi/environment.hpp> #include <boost/mpi/communicator.hpp> #include <boost/mpi/collectives.hpp> #include <boost/thread/barrier.hpp> #include <boost/thread/mutex.hpp> #include <boost/config.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/access.hpp> #include <boost/serialization/string.hpp> #include <string> #include <iostream> #include <vector> #include <fstream> #define MASTER 0 int arraySize = 7; using namespace std; namespace mpi = boost::mpi; struct field { string field_name; string field_type; string field_ref; string field_colType; }; namespace boost { namespace serialization{ template<class Archive> void serialize(Archive & ar, struct field & f, unsigned int version){ ar & f.field_name; ar & f.field_type; ar & f.field_ref; ar & f.field_colType; } } } int main(int argc, char* argv[]) { mpi::environment env(argc, argv); mpi::communicator world; int m_mySize, w_mySize, kk,i; struct field *relAllValues; struct field *relMyValues; vector<struct field> C; struct field c; w_mySize = arraySize / world.size(); cout << "w_mySize = " << w_mySize << endl; if (world.rank() == MASTER){ for(int i = 0; i < arraySize; i++){ c.field_name = "field_name=" + i; c.field_type = "field_type=" + i; c.field_ref = "field_ref=" + i; c.field_colType = "field_colType=" + i; C.push_back(c); } m_mySize = arraySize / world.size() + arraySize % world.size(); relMyValues = (struct field *) malloc(sizeof(struct field) * m_mySize); relAllValues = (struct field *) malloc(sizeof(struct field) * arraySize); } else{ relMyValues = (struct field *) malloc(sizeof(struct field) * w_mySize); } if (world.rank() == MASTER){ scatter(world, C, relMyValues, w_mySize, 0); } else{ scatter(world, C, relMyValues, w_mySize, 0); } }

2 2

regex - build problem
by Christian Meesters 16 Mar '10

16 Mar '10

Hi, I recently installed boost v1.42, everything seemed fine, but now I'm trying to use the regex-library -- and cannot compile/link my code anymore. gcc tells me that upon linking it cannot find 'libicudata.so.38', 'libicui18n.so.38', and 'libicuuc.so.38' and complaints about a number of undefined references. Indeed I have icu40 not 38 installed on my system. Just providing symbolic links with the appropriate names does not help. I then tried updating my boost build with bjam. But bjam also complaints (with ./bjam --with-regex toolset=gcc -sHAVE_ICU=1 -sICU_PATH=/usr/lib): warning! ICU configuration failed Couldn't find utypes.h in /usr/lib/include/unicode warning: Building Boost.Regex with the optional Unicode/ICU support disabled. There are no further warnings, yet linking still results in undefined references. 'utypes.h' is nowhere on my system and apparently does not come with the icu-dev package. I am running the current Ubuntu (9.10), all updates installed. boost ist compiled on my system, no package involved. And I'm using gcc 4.4 - if that matters. Now, could this be a versions issue? Any hint on where to look further? Any ideas? TIA Christian

2 2

Compiling boost using Sun C++ 5.5
by Deane Yang 16 Mar '10

16 Mar '10

I'm trying to compile on a Solaris Sparc machine with Sun C++ 5.5 some C++ code that uses the boost string algorithms library. I've tried versions 1.37, 1.38, 1.39, and 1.42. With more recent versions, I get the following error: ../../boost/boost/cstdint.hpp", line 458: Error: #error defaults not correct; you must hand modify boost/cstdint.hpp. This seems like an error that I should be able to deal with, but I'm not sure what to do. Could someone offer me some guidance?

2 1

[boost-users] [quickbook] '-' char instead of space in PDF document
by Andrey Torba 16 Mar '10

16 Mar '10

Hi all, I write my documentation using Boost.QuickBook. But there are '-' character instead of spaces In a generated PDF document in C++ code blocks . You can see it in the attached screenshot. How can i eliminate '-' chars. Thanks -- Regards, Andrey

3 3

Building boost 1.42.0 for visual studio 2008 professional
by Boost lzw 16 Mar '10

16 Mar '10

Hello boost folks, I came across the following link on how to build Boost With Visual Studio: http://blog.emptycrate.com/node/414 I have VS2008 professional on Windows XP professional with boost 1.39.0 installed, really wanted to replace it with 1.42.0. My hard disk now has about 16 GB left. Is there anybody who followed the above link to have successfully installed boost 1.42.0 in an environment like mine (i.e., is the method correct)? What should I do with the /boost directory of about 1.8GB when boost 1.39.0 was built, simply deleting it? Thanks a lot in advance, Robert

3 3

How to forward to a list of boost::function?
by John Ky 16 Mar '10

16 Mar '10

Hi all, I have a class: template<typename function_type> class function_vector { private: std::vector<boost::function<function_type> > functions; }; I want to write an operator() for this template class that takes all the arguments necessary to invoke a function of type function_type. When called, it should call each function in the functions field. How do I do this? I think Boost.Signals2 does something like this, but I can't work out how it is done. Cheers, -John

4 4

[Fusion] is mpl::insert supported for fusion::vector?
by Christian Holmquist 16 Mar '10

16 Mar '10

Hi, The following meta program compiles, except for the last (commented) line. I expected it to work since it does so for the mpl::vector case. Any ideas what I am doing wrong here? #include <boost/fusion/container/vector.hpp> #include <boost/fusion/adapted/mpl.hpp> #include <boost/mpl/insert.hpp> #include <boost/mpl/begin.hpp> #include <boost/mpl/advance.hpp> #include <boost/mpl/int.hpp> #include <boost/mpl/vector.hpp> #include <boost/mpl/equal.hpp> using namespace boost; template<class Sequence, class Pos, class T> struct insert_at { typedef typename mpl::advance<typename mpl::begin<Sequence>::type, Pos>::type itr; typedef typename mpl::insert<Sequence, itr, T>::type type; }; typedef insert_at<mpl::vector<>, mpl::int_<0>, int>::type vector1_int; BOOST_MPL_ASSERT(( mpl::equal<vector1_int, mpl::vector<int>>)); //Doesn't compile with VC2008 // typedef insert_at<fusion::vector<>, mpl::int_<0>, int>::type fusion_vector1_int; Code is using boost-trunk, rather recently updated. Thanks, Christian

2 1

Dijkstra Shortest path problem
by Kya Bey 16 Mar '10

16 Mar '10

Hi all, I'm trying to get Dijkstra's shortest path algorithm to work with my graph which has some bundled edge properties with weight as an attribute in the bundle struct edge_properties { int capacity ; double weight ; }; typedef boost::adjacency_list<listS, vecS, bidirectionalS, //directedS, property<vertex_name_t, std::string>, edge_properties> Graph; I read in the graph using the graph viz library and that works fine. (tested by printing the graph info) dynamic_properties dp; dp.property("weight", get(&edge_properties::weight, g)); dp.property("capacity", get(&edge_properties::capacity, g)); read_graphviz(in, g,dp , "name") ; I'm constantly seeing compiler errors when i use something from dijkstra-example.cpp. // Dijkstra SRC is set to 1. vertex_descriptor src = vertex(1, g); // Just as in the example std::vector<vertex_descriptor> p(num_vertices(g)); std::vector<double> d(num_vertices(g)); //RESULTS in compiler errors. See below. dijkstra_shortest_paths( g, src, predecessor_map(&p[0]).distance_map(&d[0]) ) ; //USING This call works. But have no way to get the predecessor/distance info // This fails if ***Graph*** is defined as listS,listS but works if Graph is defined as listS,vecS or vecS,vecS dijkstra_shortest_paths( g, src, weight_map(get(&edge_properties::weight,network.g)) ); The compiler error is copied. Any Pointers will be helpful. (Version of boost used = v1.34) Thanks in advance make errors /usr/include/boost/graph/dijkstra_shortest_paths.hpp: In member function 'void boost::detail::dijkstra_bfs_visitor<UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate>::examine_edge(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, Graph = const boost::adjacency_list<boost::listS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_name_t, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::no_property>, edge_properties, boost::no_property, boost::listS>, UniformCostVisitor = boost::dijkstra_visitor<boost::null_visitor>, UpdatableQueue = boost::relaxed_heap<long unsigned int, boost::indirect_cmp<double*, std::less<double> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_name_t, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, boost::no_property>, long unsigned int> >, WeightMap = boost::adj_list_edge_property_map<boost::bidirectional_tag, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, long unsigned int, const boost::property<boost::edge_bundle_t, edge_properties, boost::no_property>, boost::edge_weight_t>, ..... main.cpp:34: instantiated from here /usr/include/boost/graph/dijkstra_shortest_paths.hpp:121: error: no match for call to '(std::less<double>) (const boost::detail::error_property_not_found&, double&)' /usr/include/c++/4.3/bits/stl_function.h:229: note: candidates are: bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = double] make: *** [main.o] Error 1

2 2

Custom Edge Properties (boost-graph) - struct
by Kya Bey 16 Mar '10

16 Mar '10

Hi All , I've been trying to use a custom structure for describing the various edge properties of a graph. I'm defining a graph as the following struct edge_properties { int capacity ; double weight ; typedef struct edge_properties_tag kind ; // NOT SURE what this does ? }; typedef boost::adjacency_list<listS, vecS, bidirectionalS, property<vertex_name_t, std::string>, edge_properties > Graph; This allows me to create a Graph instance g. I've been trying to retrieve the edge properties via a get call, but have not been able to do so. To retrieve the vertex properties doing the following works property_map<Graph, vertex_name_t>::type v_names ; v_names = get(vertex_name,g) ; But on attempting to do something similar for retrieving the edge properties always fails with the following error message "test.cpp: 75: error: expected primary-expression before ',' token" test.cpp 71: property_map<Graph, edge_properties>::type epr; 72: property_map<Graph, vertex_name_t>::type v_names ; 74: v_names = get(vertex_name,g) ; 75: epr = get(edge_properties,g) ; I've tried various variants but seems to me i'm missing something fundamental in the way boost-graph keeps the edge_properties hidden. Any pointers will be useful. Thanks in advance

3 4

Review of Interval Template Library (ITL) for inclusion
by Jerry Jeremiah 16 Mar '10

16 Mar '10

> Author: Hartmut Kaiser > Date: 2010-02-19 02:22 +1300 > To: boost, boost-announce, boost-users > Subject: [boost] [Review] ITL review starts today, February 18th > > > Hi all, > > The formal review of the Interval Template Library (ITL) starts today, > February 18th, 2010 and will end February 27th, 2010. > ITL is being developed by Joachim Faulhaber. > > ------------------------------------------------ > > Everybody on this list is invited to participate in this formal review. I > hope to see your review of this library, including your vote, and I welcome > your participation in the discussions on the Boost mailing list. > > Please always state in your review, whether you think the library should be > accepted as a Boost library. > > Additionally, please consider giving feedback on the following general > topics: > > - 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? > > > Regards Hartmut > Review Manager > Firstly, I want to say that I have never participated in a review before so hopefully I can meet expectations for a good quality review. And let me also say, I am really glad that the review period was extended - I just don't have time to get onto something specific within a week. This review wasn't really an academic exercise for me. This library has a practical use for me so this review is a by-product of my attempt to see how using the library would compare with what I would have to hand write to get the same result. I work for a telecom and we have call detail records for millions of calls per day. What I want to know is how many simultaneous phone calls are there at any point in time. Traditionally, one would make an integer array of 7 days x 86400 seconds to hold the number of calls for each second in the week and then increment all the seconds between the start and end time of each call. With this library one simply inserts into an interval map the start and end times of the calls and then iterates through the map printing out the results. I read all the documentation twice. The first time didn't really make it clear how all the possible options related to each other and in what circumstances I would use each of them. But the second reading really helped. The examples in the documentation (like Table 1.3) were useful to my understanding. I thought the documentation was quite comprehensive and I really appreciated that - an example of that is Table 1.12 which I mention later on. The thing that differentiates a library from something I would write is that a library must cater for every single possible use. I thought the author went to a lot of effort to do this and the number of combinations of sets and maps that the library supports far exceeds the number of different use cases I have. The code samples helped clarify the differences between the different options. I didn't see an example where split_interval_map gave a result that was more useful than that of the interval_map. When would not joining touching intervals with the same value be the desired outcome? I guess the "time grid" could be such an example but it didn't use interval maps. I am not a meta-programming guru so looking at the source for Proto, MPL or Fusion just confuses me and I try to avoid that at all costs. I was a bit scared to look at the source for this library, but I put on a brave face and had a peek. It wasn't all that scary after all - it was quite readable. The source reminds me a lot like the STL headers which I guess isn't that surprising since it is implementing similar style containers (map and set). In the Party example a boost::itl::set<string> is used to store the names of the guests because it supports += as set union. In that example you can just as easily use: struct GuestSetT : public std::set<string> { std::set<string> & operator += (const std::set<string> & right) { insert(right.begin(), right.end()); return *this; }}; My question is, does this example really benefit from using itl::set? I do see value in itl::set and itl::map on their own but except this one use there aren't any examples that show why they would suit a particular application. I played with all the examples without any problem and I made a couple of my own. The library handled my example use cases elegantly although I certainly never did anything complicated enough to test the limits of the library. I used MSVC 2005 on Windows XP. There just wasn't time to try a full test with millions of phone calls spread over several days so I don't really have any idea how the performance compares to anything - I am depending on the table in the documentation (Table 1.12) for those answers. I was a bit concerned about the questions raised by http://comments.gmane.org/gmane.comp.lib.boost.devel/199902 - I did notice the disclaimer in the documentation saying that an interval_map of sets is a bad idea but maybe that should be explained more explicitly under the complexity topic. >From my point of view, the library has practical uses. I found the library easy to use because the documentation was comprehensive and the examples covered my use cases. I don't really understand how I think it would make a good addition to boost and so my vote is yes. Jerry Jeremiah

3 2

ASIO with SSL over UDP...
by Rick Meier 15 Mar '10

15 Mar '10

Is it possible to use the ASIO::SSL classes on a UDP connection? It appears that the SSL context will only work over TCP. Thanks Rick M

3 2

Problem with serialization!
by alev mutlu 15 Mar '10

15 Mar '10

Hi, I can not write serialization function for my structure. When I compile this I get very strange errors. Can someone help me please? #include <boost/mpi/environment.hpp> #include <boost/mpi/communicator.hpp> #include <boost/mpi/collectives.hpp> #include <boost/thread/barrier.hpp> #include <boost/thread/mutex.hpp> #include <boost/config.hpp> #include <string> #include <iostream> #include <vector> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/access.hpp> #include <boost/serialization/string.hpp> #define MASTER 0 using namespace std; namespace mpi = boost::mpi; struct field { string field_name; string field_type; string field_ref; string field_colType; }; namespace boost { namespace serialization{ template<class Archive> void serialize(Archive & ar, field & f, unsigned int version){ ar & f.field_name; ar & f.field_type; ar & f.field_ref; ar & f.field_colType; } } } int main(int argc, char* argv[]) { mpi::environment env(argc, argv); mpi::communicator world; int m_mySize, w_mySize, kk,i; field *relAllValues; field *relMyValues; vector<field> C; w_mySize = arraySize / world.size(); if (world.rank() == MASTER){ m_mySize = arraySize / world.size() + arraySize % world.size(); relMyValues = (field *) malloc(m_mySize); allValues = (int *) malloc(arraySize); } else{ relMyValues = (field *) malloc(w_mySize); } if (world.rank() == MASTER){ scatter(world, C, relMyValues, w_mySize, 0); } else{ scatter(world, a, myValues, w_mySize, 0); } }

2 4

Problem building boost::filesystem on vxworks 6.8 using windriver's workbench
by Reger, Paul 15 Mar '10

15 Mar '10

Hi, We are trying to build version 1.41 of boost::filesystem on vxworks 6.8 using windriver's workbench, using gnu c++ compiler system version 4.1.2 and we are using the build configuration: -D__VXWORKS__ -DBOOST_ASSERT_CONFIG -DBOOST_PLATFORM_CONFIG=\"$(WS_ROOT_DIR)/ThirdParty/Boost/flir//vxworks- 68.hpp\" (We generated vxworks-68.hpp from 1.41's boost/config/platform/vxworks.hpp, and it appears below). But, we are getting the compiler error: C:/AccuRev/Boost/Boost_141_Vx_Port/ThirdParty/Boost/libs/filesystem/src/ operations.cpp:62:30: error: sys/statvfs.h: No such file or directory Anyone see this problem? Got a solution? Thanks, Paul Software Engineer FLIR Systems, Inc. 27700 SW Parkway Ave. Wilsonville, OR 97070 Ph: 503.498.3069 Fx: 503.498.3910 paul.reger(a)flir.com vxworks-68.hpp follows: // Taken from boost 1.41.0 version of the vxworks.hpp platform file. // Modified for use with VxWorks 6.8 // vxWorks specific config options: #define BOOST_PLATFORM "vxWorks 6.8" // disable wide char support // we don't use it anyway #define BOOST_NO_CWCHAR #define BOOST_NO_INTRINSIC_WCHAR_T #define BOOST_NO_STD_WSTRING // added for 6.8 #define BOOST_NO_CWCTYPE // added for 6.8 #define BOOST_NO_STD_WSTREAMBUF // added for 6.8 #define BOOST_NO_SWPRINTF // added for 6.8 // Strict ansi eliminates 64-bit integers - #if defined(__GNUC__) && defined(__STRICT_ANSI__) #define BOOST_NO_INT64_T #warning - 64-bit integer support disabled. #endif // Header file inclusions #define BOOST_HAS_UNISTD_H // these allow posix_features to work, since vxWorks doesn't // define them itself //#ifndef _POSIX_TIMERS //#define _POSIX_TIMERS 1 //#endif //#ifndef _POSIX_THREADS //#define _POSIX_THREADS 1 //#endif // We use the posix schduler in priority mode // #define _POSIX_PRIORITY_SCHEDULING // vxworks doesn't work with asio serial ports // TODO: verify this is still true in 6.8 #define BOOST_ASIO_DISABLE_SERIAL_PORT // boilerplate code: #include <boost/config/posix_features.hpp> Notice to recipient: This email is meant for only the intended recipient of the transmission, and may be a communication privileged by law, subject to export control restrictions or that otherwise contains proprietary information. If you receive this email by mistake, please notify us immediately by replying to this message and then destroy it and do not review, disclose, copy or distribute it. Thank you in advance for your cooperation.

1 0

IOService and socket CAN under Linux
by Andreas Wehrmann 15 Mar '10

15 Mar '10

Hello! I'm currently working with socket CAN under Linux 2.6.25 and was wondering how I can use these with the very handy boost ioservice facility. Socket CAN is simply a raw socket created like this: socket(PF_CAN, SOCK_RAW, CAN_RAW); Does someone maybe already have a socket CAN implementation for Boost? Is there a way I can add a socket descriptor to an IOService and get a callback when the socket becomes readable, so that I can read data from the socket? The peculiarity about raw CAN sockets is, that when they become readable, you don't read the payload of the received CAN frame(s) but a struct that represents the received CAN frame. So it behaves like a datagram socket: You only read full frames. What I actually need is a notification mechanism using the IOService facility. Best regards, Andreas

2 2

[iterator] Help needed understanding output_iterator requirements
by Thomas Klimpel 15 Mar '10

15 Mar '10

Dear iterator experts, Jesse Perla recently reported that boost::multi_array fails compilation for many basic tasks on MSVC 2010. I investigated the failures, because I had already investigated other failures on MSVC 2010 reported by Jesse Perla for boost::ublas. While I'm quite familiar with boost::ublas, I'm a complete novice with respect to boost::multi_array and boost::iterator. I could track the failures to a specific (intentional?) behavior of iterator_facade from Boost.Iterator (more specifically of facade_iterator_category.hpp): http://lists.boost.org/Archives/boost/2010/03/163039.php Thomas Klimpel wrote: > What effectively happens it that the iterator gets the category > "input_iterator", but std::copy wants to have an "output_iterator". I > think I understand why the iterator doesn't satisfies the requirement > of a "forward_iterator", but it's unclear to me why it didn't qualify > as an "output_iterator". There is an "input_output_iterator_tag" in > "boost/iterator/detail/facade_iterator_category.hpp", so it would have > been possible for the iterator to be both "input_iterator" and > "output_iterator". However, it seems to me that > "input_output_iterator_tag" is never used in the Boost.Iterator > library. I would have to read more about "output_iterator" to > understand whether Boost.Iterator is correct here. With my current > understanding of "output_iterator", I would say it's a bug in > "boost/iterator/detail/facade_iterator_category.hpp". > > Perhaps somebody with more knowledge about "output_iterator" and > Boost.Iterator can explain to me why an iterator using the > "boost::random_access_traversal_tag" for the "CategoryOrTraversal" > template parameter of "iterator_facade" will never get the category > "output_iterator" (or "input_output_iterator_tag"). Of course I could go on and read more about "output_iterator", or find out whether the Boost.Iterator documentation has to say something about this issue, but since I only came to this problem because I wanted to help Jesse Perla on a problem with boost::multi_array, I would much prefer if an "iterator expert" could "take over". Regards, Thomas

1 0

Re: [Boost-users] ranking of ublas vector
by Kraus Philipp 14 Mar '10

14 Mar '10

Hi, I think the problem is: we discuss about the "rank" and the "rank index". I my problem I only need the rank index and the value to calculate a new value like: exp( -rank_index) * vec(rank_index) So the smallest element in vec will be multiply with 1 and other elements with values < 1 Phil

2 4

Re: [Boost-users] ranking of ublas vector
by Kraus Philipp 14 Mar '10

14 Mar '10

> Oops. I guess I didn't understand exactly what you wanted. The > temp vector, should contain the result you want. > > In Christ, > Steven Watanabe There is an error: I create a random vector like: [4](0.405121, 0.943918, 0.887914, 0.338921) I think it's clear that: 0.338921 < 0.405121 < 0.887914 < 0.943918 The code returns: [4](2,0,1,3) and that's wrong because the 2nd element is not the smallest value. The (mathematical) rank is: 3, 0, 2, 1 because the 3rd element is the smallest and the first the largest in the original vector. I hope that's clearer Thanks Phil

2 1

Clever simultaneous iteration over multiple containers
by Joseph Wakeling 14 Mar '10

14 Mar '10

Dear Boost users, A (possibly naïve) question, as I'm a reasonably competent C programmer but only a relative novice with C++, and just starting to get used to concepts from libraries like Boost. The BOOST_FOREACH macro provides a nice way to iterate over all the contents of a container like a vector, list, etc. But what about when several containers are involved? I'll give a concrete-ish example from a problem I'm working on. I have two vectors, vector<myClass *> v1 and vector<double> v2 where myClass is a base class and v1.size()==v2.size(). Then, what I want to do is, for(unsigned int i=0;i<v1.size();++i) v1.at(i)->func(v2.at(i)); That works, of course; I'm just wondering if there is a more elegant or compiler-friendly way of writing this along the lines of the BOOST_FOREACH macro. Initialising separate iterators for both v1 and v2 seems ugly/lots of boilerplate. I have seen the solution here: http://permalink.gmane.org/gmane.comp.lib.boost.user/31954 ... but that seems less desirable because it involves using an extra library which I don't think is standard in Linux distros. I have the impression that the zip_iterator boost lib is useful here, but did not fully understand if or how. Can anyone advise? Thanks & best wishes, -- Joe

2 2

serialization error for a struct
by alev mutlu 14 Mar '10

14 Mar '10

Hi all, I am very new to boost. I am getting a serialization error, and I have no idea about what to do #include <boost/serialization/string.hpp> //some other headers struct field { std::string field_name; std::string field_type; std::string field_ref; std::string field_colType; }; int main(int argc, char* argv[]){ vector<field> C; // other definitions // populating the C vector scatter(world, C, relMyValues, w_mySize, 0); } and I got error: struct field has no member named serialize what should I do? thank you in advance

2 2

Compilation problems with MinGW
by Benjamin Lau 14 Mar '10

14 Mar '10

Hello everyone, I successfully compiled Boost with MinGW (GCC 4.4.0 - it came installed with the Qt SDK) with all the settings on, so it has generated both dynamic and static libraries, debug and release versions, multithreaded and non-multithreaded runtimes etc. I tried to compile a small program that uses the serialization library (http://www.boost.org/doc/libs/1_42_0/libs/serialization/doc/tutorial.html#s…) and tried to link it statically with these libraries (in different compilations): libboost_serialization-mgw34-1_40.lib libboost_serialization-mgw34-mt-1_40.lib libboost_serialization-mgw34-mt-s-1_40.lib libboost_serialization-mgw34-mt-s.lib libboost_serialization-mgw34-mt.lib libboost_serialization-mgw34-s-1_40.lib libboost_serialization-mgw34-s.lib libboost_serialization-mgw34.lib Each time I compiled, it would always give me linker errors like so: undefined reference to `__gxx_personality_sj0' undefined reference to `_Unwind_SjLj_Register' undefined reference to `_Unwind_SjLj_Unregister' undefined reference to `_Unwind_SjLj_Resume' These are repeated over and over again. The compiler command and flags that I use are g++ test.cpp -o test -Ipath/to/boost/include path/to/static/library However, if I compile it with an import library like boost_serialization-mgw34.lib I don't get such errors. Searching online seems to suggest I am missing a compiler flag, but I cannot determine which one I am missing. Perhaps my Google-Fu isn't strong enough, so if I did miss out something patently obvious that could have been found online I offer my due apologies. Thanks a lot anyway! Benjamin

2 2

[serialization] installed documentation bug and suggestions.
by Mostafa 14 Mar '10

14 Mar '10

Bugs: I've had bad internet connection so I had to resort to using the installed boost docs and noticed some bugs. 1) /share/doc/boost/libs/serialization/doc/index.html has broken links in the left frame. 2) /share/doc/boost/libs/serialization/doc/archive_reference.html has broken links in the following paragraph: //Start As a convenience, small header files have been included which contain typedef for polymorphic implementation for each corresponding templated one. For example, the headers polymorphic_text_iarchive.hpp and polymorphic_text_oarchive.hpp. contain the typedef for the polymorphic implementation of the standard text archive classes text_iarchive.hpp and text_oarchive.hpp respectively. All included polymorphic archives use the same naming scheme. //End Suggestion: 1) It's not readily apparent that there's a polymorphic implementation of the serialization classes, may be this should be mentioned in the tutorial? 2) Or have a section in the Overview page categorizing the available categories of serializors as intrusive, non-intrusive, polymorphic, giving a short definition of each type, and their pros/cons. Basically what is missing is an eye-ball summary of the available serializors that this library offers, and why one would choose one over the other and vice versa. The information is there, but it is scattered and it took some digging to get to it. For example, from the overview page one cannot deduce that there exists an intrusive, or polymorphic version. It is only from Tutorials page can one immediately deduce that there is an intrusive version, and to figure out there is a polymorphic version one has to navigate the following path: Reference link in left frame -> Archive Class Reference. Also, best practices/potential pitfalls like the following suggestion: //Start // /share/doc/boost/libs/serialization/doc/tutorial.html#nonintrusiveversion Note the serialization of the base classes from the derived class. Do NOT directly call the base class serialize functions. Doing so might seem to work but will bypass the code that tracks instances written to storage to eliminate redundancies. It will also bypass the writing of class version information into the archive. For this reason, it is advisable to always make member serialize functions private. //End should be made more eye grabbing. It's very easy to accidentally skip over such information. Thanks, - Mostafa

3 4

Boost.Thread idiom
by anony 14 Mar '10

14 Mar '10

Is is possible to inherit from boost::thread and then store pointers to instantiated objects of such classes in say ptr_vector<>? I need to interrupt() a specific thread now and then and once you commit a thread to thread_group you can only interrupt them all at once.

2 4

[boost] [chrono] v0.4 New thread_clock
by vicente.botet 14 Mar '10

14 Mar '10

Hi, I'm pleased to announce the version 0.4 of the Boost.Chrono library. The implementaton is stable, I don't plan to add more features before review. I'll concentrate in improving the documentation and the tests. I know that review managers are hard to find, so if you are interested in the library, please contact me or 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…. New Features since v0.3.2: * Suspendible Clock concept + template class suspendible_clock<> * Added scope_suspend which do suspend/resume if the Clock is a model of Suspendible Clock concept, and nothing otherwise. * thread_clock support on platforms providing it natively. * Added support for wide character for stopwatch_reporter, stopclock, and stopclock_accumulator. * digital_time renamed t24_hours Perf * Added performances measures. Bug Fixes * Bug on timeval_demo. time_point t(duration(xtime(0))); // this was taken as a function declaration gettimeofday((timeval*)&t, 0); return t; time_point t(duration(xtime(0))); // this was taken as a function declaration gettimeofday((timeval*)&t, 0); return t; by timeval tv; gettimeofday(&tv, 0); xtime xt( tv.tv_sec, tv.tv_usec); return time_point(duration(xt)); * Bug on run_timer_test (add a global variable to avoid optimization that removes completely the code to be measured Best regards, _____________________ Vicente Juan Botet Escribá

2 4

ranking of ublas vector
by Kraus Philipp 14 Mar '10

14 Mar '10

Hello, I have a very large non sparse ublas vector (most long double content). I would like to sort this vector without change the vector content, but I know the rank of the elements like the smalest element in the vector is the 312 element in the original vector (for example). Is there a boost implementation for create ranking of elements? Thanks Phil

2 6

boost.units converting double tp SI prefix
by Olaf Peter 13 Mar '10

13 Mar '10

Hi, is there a way to use boost.units to convert a double automatically to a SI unit prefix, e.g. 10e-3 to 10m or 10e3 to 10k ?? The value isn't know at compile time, so the decision has to be done on runtime. Thanks, Olaf

3 2

[Boost.Intrusive] Compilation error with Visual Studio 2008
by info-tibo 13 Mar '10

13 Mar '10

Hello, For a project, I created a class allowing to reference some objects, and I use Boost.Intrusive. I started coding this class using Code::Blocks and gcc 3.4.5 . But now I want to use Visual Studio 9, and I simply added the class to the project. And then... it doesn't compile... The code is here : ----------------------------------------------------------------------------------------------------------------------------------------- #ifndef _BASE_EQUALREFSYSTEM_H_ #define _BASE_EQUALREFSYSTEM_H_ #include <boost/intrusive/list.hpp> namespace base { //! Convenient typedef typedef boost::intrusive::list_member_hook< boost::intrusive::link_mode<boost::intrusive::normal_link> > EqualRefSysHook; //! A class to handle self referencing systems /** Each object can point to a target, in order to interact with it. How to use: \code // First, you have to derivate this class class MyClass : public EqualRefSystem { // code... } // Then you can, in your main function, create these objects: MyClass* myClassPointer = new MyClass; // for example: repeated 200 times // Afterthat, you can point each object to another. When you have finished // you can simply call: delete myClassPointer; \endcode **/ class EqualRefSystem { public: //! The hook used by the intrusive list ReferencedBy EqualRefSysHook ERSMemberHook; public: //! Constructor EqualRefSystem() :Target(0),RefCount(0) {} //! Destructor /** Safe destructor : all references and target are reseted. **/ virtual ~EqualRefSystem() { resetTarget(); unlink(); } //! Returns the targeted object /** \return A pointer to the object targeted by this EqualRefSystem. **/ inline EqualRefSystem* getTarget() const { return Target; } //! Sets the target /** \param tgt : The new target. 0 means 'no target'. If tgt == this, the target is set to 0. This function is stable and very fast, you can use it without any restriction. **/ inline void setTarget(EqualRefSystem* tgt) { if(tgt == Target) return; if(tgt == this) tgt = 0; if(Target) Target->dereference(this); Target = tgt; if(Target) Target->reference(this); } //! Resets the target /** This function is a synonym for setTarget(0). **/ inline void resetTarget() { if(Target) Target->dereference(this); Target = 0; } //! Returns whether a target is set or not /** This function is a synonym for (getTarget() != 0). \return True if a target is set, else false. **/ inline bool hasTarget() const { return Target != 0; } //! Unlink from all objects which targets this one /** This function resets the target of all objects targeting this EqualRefSystem. **/ inline void unlink() { while(!ReferencedBy.empty()) ReferencedBy.begin()->resetTarget(); RefCount = 0; } //! Returns the number of objects targeting this one /** \return The number of objects targeting this EqualRefSystem. Constant-time. **/ inline unsigned int getNumberOfReferences() const { return RefCount; } private: //! Reference an object in this EqualRefSystem inline void reference(EqualRefSystem* toRef) { if(!toRef || toRef == this) return; ReferencedBy.push_back(*toRef); RefCount++; } //! Dereference an object from this EqualRefSystem inline void dereference(const EqualRefSystem* toDeref) { if(!toDeref || toDeref == this) return; ReferencedBy.erase(ReferencedBy.iterator_to(*toDeref)); RefCount--; } //! Targeted object EqualRefSystem* Target; //! Objects that reference this EqualRefSystem boost::intrusive::list< EqualRefSystem, boost::intrusive::member_hook<EqualRefSystem,EqualRefSysHook,&EqualRefSystem::ERSMemberHook>, boost::intrusive::constant_time_size<false> > ReferencedBy; //! Number of references unsigned int RefCount; }; } #endif // _BASE_EQUALREFSYSTEM_H_ ----------------------------------------------------------------------------------------------------------------------------------------- VCC told me 42 errors, all related to the first one: line 112 : C2327: 'base::EqualRefSystem::ERSMemberHook' : is not a type name, static, or enumerator I searched the doc about the C2327, but it doesn't helped me. Thanks in advance, Darktib PS: I apologize for my english, I'm french.

2 4

BOOST_STATIC_CONST
by Olivier Tournaire 13 Mar '10

13 Mar '10

Hi all, I am currently having problem with a static const class member (in a header only project): // type.hpp template< typename Property > struct property_base { typedef Property type; }; struct some_type : property_base< uint32_t > { BOOST_STATIC_CONSTANT( type, first_value = 1 ); BOOST_STATIC_CONSTANT( type, second_value = 2 ); }; // main.cpp #include "type.hpp" ... int main(int argc, char** argv) { BOOST_CHECK_EQUAL( 1 , some_type::first_value ); } This produces a link error (g++ 4.3.4): undefined reference to some_type::first_value. Everything is fine with visual ... If I add const some_type::type some_type::first_value; after the struct definition, it compiles and links fine. However, would it produce a multiple definition link error in some cases? Could you please help? Regards, Olivier

3 6

Unit Test Framework Documentation
by Olaf Peter 13 Mar '10

13 Mar '10

Hi, mabye an failure on the docs (or even my), but shouldn't the links on http://www.boost.org/doc/libs/1_42_0/libs/test/doc/html/utf/testing-tools/r… point to the documentation to the approbiate Macros?? Thanks, Olaf

2 2

[serialization] stream error when reading simple tree structure from a binary archive
by CurieCat 13 Mar '10

13 Mar '10

Hi, I tried to save a tree structure out to an archive and then read it back. If I use a text archiver, everything works fine; If I use a binary archiver, an exception of "stream error" is thrown. I managed to shorten my code as following. Can anyone give some advice? I'm using vs2008 and boost 1.42.0. Thanks. /////////////////////////////////////////////////////////////////////// #define _SCL_SECURE_NO_WARNINGS #define _CRT_SECURE_NO_WARNINGS #include <fstream> #include <boost/archive/tmpdir.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> #include <boost/archive/binary_oarchive.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/assume_abstract.hpp> #include <boost/serialization/export.hpp> class Base { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version){} public: virtual ~Base(){} }; BOOST_CLASS_EXPORT_GUID(Base, "Base") class Node : public Base { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & boost::serialization::base_object<Base>(*this); ar & parent_; ar & firstChild_; ar & nextSibling_; } public: Node* parent_; Node* firstChild_; Node* nextSibling_; Node() { parent_ = NULL; firstChild_ = NULL; nextSibling_ = NULL; } virtual ~Node(){}; bool AddChild_front(Node* node) { node->nextSibling_ = firstChild_; node->parent_ = this; firstChild_ = node; return true; } }; BOOST_CLASS_EXPORT_GUID(Node, "Node") class DeriveNode : public Node { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & boost::serialization::base_object<Node>(*this); } }; BOOST_CLASS_EXPORT_GUID(DeriveNode, "DeriveNode") int main() { Node* root = new Node; Node* bodyNode = new Node; root->AddChild_front(bodyNode); Node* headNode = new Node; Node* Eye = new Node; Node* Nose = new Node; Node* Ear = new Node; headNode->AddChild_front( Eye); headNode->AddChild_front( Nose); headNode->AddChild_front( Ear); bodyNode->AddChild_front(headNode); Node* LeftArm = new Node; Node* RightArm = new Node; Node* LeftLeg = new Node; bodyNode->AddChild_front( LeftArm); bodyNode->AddChild_front( RightArm); bodyNode->AddChild_front( LeftLeg); DeriveNode* jointRoot = new DeriveNode; bodyNode->AddChild_front( jointRoot); DeriveNode* jointChild_A = new DeriveNode; jointRoot->AddChild_front( jointChild_A); DeriveNode* jointChild_B = new DeriveNode; jointRoot->AddChild_front( jointChild_B); const Node* rootnode = root ; Node* newroot = NULL; std::ofstream ofs("filename"); { boost::archive::binary_oarchive oa(ofs); oa << rootnode; } ofs.close(); std::ifstream ifs("filename"); { boost::archive::binary_iarchive ia(ifs); ia >> newroot; } ifs.close(); return 0; }

3 2

check MPI support
by Kraus Philipp 13 Mar '10

13 Mar '10

Hello, I work for a long time again with C + + and some numerical methods must be implemented with the help of the boost, among other things, with MPI. Does the Booster precompiler flag that I can verify that the boost is compiled with MPI support like: #if defined(BOOST_WITH_MPI) #endif Thanks for help Phil

3 5

strange "fatal errors" with Boost.Test
by Christoph Groth 13 Mar '10

13 Mar '10

Dear boost experts, while adding regression tests to my project I experience very strange errors. I am using boost 1.40 and g++ 4.4 as packaged in Debian testing. The problem is that a very simple test suite, one which does almost nothing, produces the following runtime error: ################################################################ cwg@argo:/tmp/lg-bug$ ./test_all Running 1 test case... unknown location(0): fatal error in "sq_dist": signal: illegal operand; address of failing instruction: 0x00410106 *** 1 failure detected in test suite "lg" ################################################################ A quite minimal program which allows me to reproduce the bug is available from http://ilorentz.org/~cwg/lg-bug.tar.gz This is how I can reproduce it on any of my two Debian testing systems. The problem does not appear on an Ubuntu system to which I have access (with boost 1.38, but I do not think that this problem is specific to some boost version). ################################################################ cwg@argo:/tmp$ wget -q http://ilorentz.org/~cwg/lg-bug.tar.gz cwg@argo:/tmp$ tar xfz lg-bug.tar.gz cwg@argo:/tmp$ cd lg-bug/ cwg@argo:/tmp/lg-bug$ g++ -g -o test_all test_glass.cc glass.cc cwg@argo:/tmp/lg-bug$ gdb test_all GNU gdb (GDB) 7.0.1-debian Copyright (C) 2009 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html> This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Type "show copying" and "show warranty" for details. This GDB was configured as "x86_64-linux-gnu". For bug reporting instructions, please see: <http://www.gnu.org/software/gdb/bugs/>... Reading symbols from /tmp/lg-bug/test_all...done. (gdb) run Starting program: /tmp/lg-bug/test_all Running 1 test case... Program received signal SIGILL, Illegal instruction. 0x0000000000410106 in boost::itest::expectations_logger::data_flow (this=Cannot access memory at address 0x3fdffffffffffe38 ) at /usr/include/boost/test/impl/logged_expectations.ipp:188 188 BOOST_CHECK_EQUAL( *tit, DATA_SIG ); ++tit; (gdb) bt #0 0x0000000000410106 in boost::itest::expectations_logger::data_flow (this=Cannot access memory at address 0x3fdffffffffffe38 ) at /usr/include/boost/test/impl/logged_expectations.ipp:188 Cannot access memory at address 0x3fe0000000000008 ################################################################ The test case (file test_glass.cc) is just: ################################################################ #define BOOST_TEST_MODULE lg #include <boost/test/included/unit_test.hpp> #include "defs.hh" #include "glass.hh" BOOST_AUTO_TEST_CASE(sq_dist) { Levy::Vecd a(2, 1); Levy::Glass sys(Levy::Vecd(1, 1), Levy::Vecb(true, true)); } ################################################################ The two constructors in the body of the testcase do not really do anything except initializing a few numbers and std::vectors. However, the bug disappears when I comment out one of these lines. The backtrace (see log) is not really helpful to me... This is the backtrace of the problem as it appears in my full program: ################################################################ Program received signal SIGSEGV, Segmentation fault. 0x0000000000432728 in ~lazy_ostream_impl (this=0xffffccc0, __in_chrg=<value optimized out>) at /usr/include/boost/test/utils/lazy_ostream.hpp:64 64 class lazy_ostream_impl : public lazy_ostream { (gdb) bt #0 0x0000000000432728 in ~lazy_ostream_impl (this=0xffffccc0, __in_chrg=<value optimized out>) at /usr/include/boost/test/utils/lazy_ostream.hpp:64 #1 0x000000000041010f in expectations_logger (this=0x6f3730, log_file_name=..., test_or_log=false) at /usr/include/boost/test/impl/logged_expectations.ipp:87 #2 0x0000000000475c66 in boost::unit_test::ut_detail::invoker<boost::unit_test::ut_detail::unused>::invoke<void (*)()> (this=0x7fffffffceaf, f=@0x6f2a08) at /usr/include/boost/test/utils/callback.hpp:56 #3 0x00000000004718e5 in boost::unit_test::ut_detail::callback0_impl_t<boost::unit_test::ut_detail::unused, void (*)()>::invoke (this=0x6f2a00) at /usr/include/boost/test/utils/callback.hpp:89 #4 0x000000000043b773 in boost::unit_test::callback0<boost::unit_test::ut_detail::unused>::operator() (this=0x6f2ad0) at /usr/include/boost/test/utils/callback.hpp:118 #5 0x000000000042ec4f in operator() (this=0x6f7378) at /usr/include/boost/test/impl/unit_test_monitor.ipp:41 #6 0x000000000042ec32 in invoke<boost::unit_test::<unnamed>::zero_return_wrapper_t<boost::unit_test::callback0<boost::unit_test::ut_detail::unused> > > (this=0x7fffffffcf3f, f=...) at /usr/include/boost/test/utils/callback.hpp:42 #7 0x000000000042ec13 in invoke (this=0x6f7370) at /usr/include/boost/test/utils/callback.hpp:89 #8 0x0000000000443257 in boost::unit_test::callback0<int>::operator() (this=0x7fffffffdb60) at /usr/include/boost/test/utils/callback.hpp:118 #9 0x000000000043b872 in boost::detail::do_invoke<boost::scoped_ptr<boost::detail::translate_exception_base>, boost::unit_test::callback0<int> > (tr=..., F=...) at /usr/include/boost/test/impl/execution_monitor.ipp:244 #10 0x000000000040f156 in boost::execution_monitor::catch_signals (this=0x6f1d00, F=...) at /usr/include/boost/test/impl/execution_monitor.ipp:956 #11 0x000000000040f21a in boost::execution_monitor::execute (this=0x6f1d00, F=...) at /usr/include/boost/test/impl/execution_monitor.ipp:1282 #12 0x0000000000418eee in boost::unit_test::unit_test_monitor_t::execute_and_translate (this=0x6f1d00, tc=...) at /usr/include/boost/test/impl/unit_test_monitor.ipp:69 #13 0x00000000004311ee in boost::unit_test::framework_impl::visit (this=0x6f1340, tc=...) at /usr/include/boost/test/impl/framework.ipp:150 #14 0x000000000041d587 in boost::unit_test::traverse_test_tree (tc=..., V=...) at /usr/include/boost/test/impl/unit_test_suite.ipp:193 #15 0x000000000041daff in boost::unit_test::traverse_test_tree (id=65536, V=...) at /usr/include/boost/test/impl/unit_test_suite.ipp:232 #16 0x000000000041d748 in boost::unit_test::traverse_test_tree (suite=..., V=...) at /usr/include/boost/test/impl/unit_test_suite.ipp:207 #17 0x000000000041db1c in boost::unit_test::traverse_test_tree (id=1, V=...) at /usr/include/boost/test/impl/unit_test_suite.ipp:234 #18 0x000000000040ab87 in boost::unit_test::framework::run (id=1, continue_test=true) at /usr/include/boost/test/impl/framework.ipp:436 #19 0x0000000000418c5c in boost::unit_test::unit_test_main (init_func=0x41eed8 <init_unit_test_suite(int, char**)>, argc=1, argv=0x7fffffffe378) at /usr/include/boost/test/impl/unit_test_main.ipp:185 #20 0x0000000000418e56 in main (argc=1, argv=0x7fffffffe378) at /usr/include/boost/test/impl/unit_test_main.ipp:237 ################################################################ When I add change some irrelevant code the program which just shifts everything a bit the backtrace becomes different or the error disappears. So it looks like some memory corruption problem. But I'm clueless... Thank you in advance for any hints Christoph

2 2

boost.python class constructor error
by hitesh dhiman 13 Mar '10

13 Mar '10

Hi all, I'm trying out boost.python to use c++ code in python. My problem is this: In my c++ code, if i declare the class constructor in the header file, and define it in the cpp file, bjam throws a LNK2019 unresolved symbol error. The problem does not occur if i define the constructor in the header file itself. My code is shown below: *Test1.h:* #include <windows.h> //using namespace std; class World { public: World(); ~World(); void set(std::string msg) { this->msg = msg; } std::string greet() { return msg; } std::string msg; }; *Test1.cpp:* #include "Test1.h" World::World() {}; World::~World() {}; int addition(int a, int b) { int z = a + b; return z; } *Wrapper File*: #include <boost/python.hpp> #include "Test1.h" BOOST_PYTHON_MODULE(hello) { using namespace boost::python; class_<World>("World") .def("greet", &World::greet) .def("set", &World::set) ; } Is this a bug? Or there's something wrong with my coding here? -- Regards, Hitesh Dhiman Electrical Engineering National University of Singapore

2 1

[Uuid] Portable binary serialization.
by Mostafa 12 Mar '10

12 Mar '10

I'm interested in using the portable binary serialization code in [serialization]/example directory with Boost.Uuid. I've noticed that there's a fall back template function for unrecognized types in portable_binary_iarchive.hpp: 101 // default fall through for any types not specified here 102 template<class T> 103 void load(T & t){ 104 boost::intmax_t l; 105 load_impl(l, sizeof(T)); 106 // use cast to avoid compile time warning 107 t = static_cast<T>(l); 108 } that relies on the sizeof operator. Short of replacing the sizeof operator with a templated switch: //Code Sample 1 //Start code template <typename T> std::size_t my_size_of { return sizeof(T); } tempate <> std::size_t my_size_of<boost::uuids::uuid> { return boost::uuids::uuid::static_size(); } //End code or using macros ala: //CodeSample 2 //Start template <typename T> std::size_t my_size_of(T const & t) { return sizeof(T); } tempate <> std::size_t my_size_of<boost::uuids::uuid>(boost::uuids::uuid const &) { return boost::uuids::uuid::static_size(); } #define sizeof(x) my_size_of(x) #include <boost_portable_binary_serialization> #undef sizeof //End , is their something less instrusive I could do to make it work with Boost.Uuid? Thanks, Mostafa

2 2

uBlas with Atlas
by Kraus Philipp 12 Mar '10

12 Mar '10

Hello, I try to install the numerical bindings for my boost, but I can't compile the examples. I had installed and compilde the Atlas Lib 3.9.23 with Lapack support and the Boost 1.42 with MPI Support under OS X Leo. I take a look at http://www.opentissue.org/wikitissue/index.php/Boost_bindings but I had checked out the bindungs with and without the -v1 prefix and try to compile the examples under the lib directory. How can I work with the boost uBlas structures and the Atlas lib, so I can use the Cholesky factorisation with a uBlas matrix? Can you help me to install the bindings correctly? Thanks Phil

2 4

storing pointers in a std::map
by Alan Tennant 12 Mar '10

12 Mar '10

I'm having difficulty storing pointers in a std::map. I can't find anything online about it, are std::maps supposed to be able to store pointers?

5 7

Re: [Boost-users] [asio] Callbacks not getting called
by Tom Kent 12 Mar '10

12 Mar '10

So, I tried it, but surprisingly, it didn't make any difference. I'm not sure why there wasn't an error, it seems like one of HandleAccept and &HandleAccept would cause some type of error. Also, I'm not having the problem getting through the acceptor. The server successfully gets the accept callback for the connection from the client (and the client gets its callback as well). Its the aysnc_send/async_read that doesn't ever get a callback. I tried using the reference to HandleAccept in those as well, but like I said above, saw the *exact* same results. Tom -------- Original Message -------- Subject: Re: [Boost-users] [asio] Callbacks not getting called From: Rutger ter Borg (rutger_at_[hidden]) Date: 2010-03-11 16:55:43 Tom Kent wrote: > acceptor_->async_accept(*sock1_, HandleAccept); Perhaps you could try acceptor_->async_accept(*sock1_, &HandleAccept); here? Cheers, Rutger

3 3