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

mpi: is_mpi_datatype
by Hicham Mouline 11 Dec '10

11 Dec '10

Hello A polymorphic struct with 2 doubles and 1 virtual function is not intended to be marked as is_mpi_datatype : mpl_true, is it? regards,

2 1

Problem compiling: 64bit, link=shared, runtime-link=shared
by Thomas 11 Dec '10

11 Dec '10

Hallo, I need help compiling boost. My setup: Windows SDK v7.0 Boost 1.45 My configuration: bjam --prefic=c:\boost --with-thread --with-system --with-filesystem --with-program_options --with-date_time link=shared threading=multi address-model=64 runtime-link=shared toolset=msvc stage in boost/config/user.hpp I activated #define BOOST_ALL_DYN_LINK Linking fails with: thread.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __cdecl boost::gregorian::greg_month::greg_month(unsigned short)" (__imp_??0greg_month@gregorian@boost@@QEAA@G@Z) referenced in function "public: __cdecl boost::gregorian::date::date(enum boost::date_time::special_values)" (??0date@gregorian@boost@@QEAA@W4special_values@date_time@2@@Z) bin.v2\libs\thread\build\msvc-9.0\release\address-model-64\threading-multi\boost_thread-vc90-mt-1_45.dll : fatal error LNK1120: 1 unresolved externals Thanks!

1 0

Range - Char literal question
by Rao, Anant 10 Dec '10

10 Dec '10

Hi, I need to iterate thru strings (For various reasons, I can't use string or vector<char> containers). I found that boost::range exactly fits the bill for me. I get all the convenience of an iterator (from as_literal.hpp). I have a piece of code char* char_s = "I am fine"; char *cp; std::size_t sz = strlen(char_s); const char* str_end1 = str_begin( char_s ) + sz; for (cp = str_begin(char_s); cp != str_end(char_s); ++cp) cout << *cp; I have couple of questions: 1. In the loop, boost::range seems to be calling strlen every iteration. This is an overhead. I was wondering if there's a way I can pass in the length myself so that boost::range would use it and avoid calling strlen(). 2. If it's not possible, is there a way for me to use iterators (boost or non-boost) over char strings? Thanks so much in advance for your help, Anant The information contained in this email message and its attachments is intended only for the private and confidential use of the recipient(s) named above, unless the sender expressly agrees otherwise. Transmission of email over the Internet is not a secure communications medium. If you are requesting or have requested the transmittal of personal data, as defined in applicable privacy laws by means of email or in an attachment to email, you must select a more secure alternate means of transmittal that supports your obligations to protect such personal data. If the reader of this message is not the intended recipient and/or you have received this email in error, you must take no action based on the information in this email and you are hereby notified that any dissemination, misuse or copying or disclosure of this communication is strictly prohibited. If you have received this communication in error, please notify us immediately by email and delete the original message.

7 15

[Units] derived units of SI system (newbie)
by André Berthe 10 Dec '10

10 Dec '10

Dear List, I would like to calculate a shear stress based on a shear rate and a viscosity using Boost.Units. Here I have problems using derived dimensions and conversion factors based on a existing system. The error messages of my compiler are in German, so I tried to document my problems with a test code: <main.cpp> #include <boost/units/systems/si/dynamic_viscosity.hpp> #include "stress.h" #include "shearrate.h" namespace bu = boost::units; namespace SI = bu::si; main(){ //Define a quantity of unit stress. Unfortunately there is no //realization of the defined physical dimension stress in si. //So a user defined type from stress.h (see below) is used: bu::quantity<SI::stress> WSS_x; //Define a shear rate. I did not understand how to use a //inverse time as dimension. Therefore I defined the derived //dimension per_time in shearrate.h. Is it possible to add it to //the si system (as I tried) or do I have to define //my own system and a conversion factor? bu::quantity<SI::per_time> WSR_x(1*per_second); //There is a existing si type for the dynamic viscosity. //However, there is no defined constant. How is the //correct way to assign a value? Should I define this //constant? bu::quantity<SI::dynamic_viscosity> eta; //Calculation of the shear stress. It seems that this calculation //tries to use a »sizeof« on eta, that seems to have a // incomplete type //(»boost::STATIC_ASSERTION_FAILURE<false>«). And there //seems to be something wrong with the conversion. //Do I have to define a conversion factor? Or is this error //caused by my previous mistakes? WSS_x=WSR_x/eta; } </main.cpp> Included header file 1: <stress.h> #include <boost/units/systems/si/base.hpp> #include <boost/units/physical_dimensions/stress.hpp> #include <boost/units/make_system.hpp> namespace boost { namespace units { namespace si { typedef unit<stress_dimension,si::system> stress; } // namespace si } // namespace units } // namespace boost </stress.h> Included header file 2: <shearrate.h> #include <boost/units/base_dimension.hpp> #include <boost/units/derived_dimension.hpp> #include <boost/units/io.hpp> #include <boost/units/quantity.hpp> #include <boost/units/static_constant.hpp> #include <boost/units/unit.hpp> #include <boost/units/base_unit.hpp> #include <boost/units/systems/si/time.hpp> namespace boost { namespace units { namespace si { typedef derived_dimension< time_base_dimension,-1>::type per_time_dimension; // [1/m] typedef unit< si::per_time_dimension, si::system > per_time; static const per_time per_second; static const per_time per_seconds; } } } Thank you, André

2 1

Possible bug: ostringstream
by Jammy Cheng Chen 10 Dec '10

10 Dec '10

Hi All, I have come across a bug associated the following code, it work fine in VS2008 release mode and crash in debug mode, I did some research found it should be a bug in the microsoft implementation of ostringstream, Is anybody know how to fix this or alternative way? Any ideas would be appreciated. BTW: I must use std::ostringstream because actually lot of dependencies dll was developed with std::ostringstream.str() return. I don't want change the dependencies project it wastes too much. std::string result( "" ); size_t length = source.size(); std::ostringstream offset; long offsetsToSource = 12135L; offset << offsetsToSource; std::string nsource = offset.str(); result.reserve( nsource.length() * 1.6 ); std::for_each( nsource.begin(), nsource.end(),ToXML( result, "\"&<>" ) ); msvcp90d.dll!std::_Container_base_secure::_Orphan_all() Line 223 + 0x5 bytes C++ msvcp90d.dll!std::_Container_base_secure::~_Container_base_secure() Line 115 C++ msvcp90d.dll!std::_String_base::~_String_base() + 0x11 bytes C++ msvcp90d.dll!std::_String_val<unsigned short,std::allocator<unsigned short> >::~_String_val<unsigned short,std::allocator<unsigned short> >() + 0x11 bytes C++ msvcp90d.dll!std::basic_string<char,std::char_traits<char>,std::allocato r<char> >::~basic_string<char,std::char_traits<char>,std::allocator<char> >() Line 917 + 0xf bytes C++ getMetaData.dll!getQMAttributes(Av::Generic::ContainerIF * pcFile=0x026a0924, Av::Generic::MasterMobIF * pMasterMob=0x0278d234, Av::Generic::TapeMobIF * pTapeMob=0x0279275c, MobInfo & mobInfo={...}) Line 748 + 0x73 bytes C++

3 3

[Fusion] Runtime complexity of boost::fusion::find?
by Clinton Mead 10 Dec '10

10 Dec '10

Hi everyone On the following documentation page: http://www.boost.org/doc/libs/1_45_0/libs/fusion/doc/html/fusion/algorithm/… It mentions that the computational complexity for "find" is linear. However, I can not understand how this is the case. As far as I understand all find needs to do is to look through types, simply iterating through the sequence types at compile time using result_of::next<X>::type where where X is initially result_of::begin<SEQ>::type. So I can't see how any actual work is done by find. Am I missing something here? I'm working on a parameter library, and I assumed things like "find" used constant or no time to execute. Could people please explain how find could use linear time? Thanks Clinton

2 1

Re: [Boost-users] variant over base and derived classes
by Hicham Mouline 09 Dec '10

09 Dec '10

> ----Original Message----- >From: "Dave Abrahams" [dave(a)boostpro.com] >Date: 09/12/2010 05:00 PM >To: boost-users(a)lists.boost.org >Subject: Re: [Boost-users] variant over base and derived classes >At Thu, 09 Dec 2010 09:15:45 -0500, >Hicham Mouline wrote: >> >> >> >Subject: Re: [Boost-users] variant over base and derived classes >> >> >(sorry if this is a top post, my phone shows no msg quotes) >> >> >I'm no expert on this, but isn't there an compile time function to >> >testing if an instance is derived from another (in introspection or >> >something)? You could then maybe sort the variant types for most to >> >least derived and then test untill you find the suitable cast? >> >> >Just brainstorming pretty much. Hope its useful! >> >Best, >> >Dee >> >> yes, there is boost::is_base_of or some metafct like that in type_traits. >> not quite sure how to implement the sort though? >> will checkout mpl::sort with binary predicate base_or_derived. >> I have under 10 types, so compile time should be ok >> thanks, >I haven't looked at your use-case in detail, but it's a bit of a >stretch to imagine a case in which runtime polymorphism via virtual >functions would be useful inside a variant, since you need to know the >most derived type of each stored thing anyhow. Are you going to be >referring to the stored items via a base class pointer? >-- >Dave Abrahams >BoostPro Computing >http://www.boostpro.com I have a class hierarchy that I want to be able to mpi::broadcast. mpi::broadcast not being able to polymorphically receive the object on the receiver's end forced me to wrap all the hierarchy in a variant, which I can send and it works at reception as well. at reception, mpi::broadcast requires the real object to exist already. The code that sends with mpi::broadcast receives a base class reference (or pointer). The code that receives with mpi::broadcast doesn't know what it is receiving. Apparently, boost::serialization can deal with base pointers fine, and I think it creates on the heap the loaded objects, or? The solution w variant works here, I am trying to simplify. thanks,

1 0

lib - errata
by Tim St. Clair 09 Dec '10

09 Dec '10

Is there a simple loc to see a libraries errata over versions? -- Cheers, Timothy St. Clair

1 0

Re: [Boost-users] variant over base and derived classes
by Hicham Mouline 09 Dec '10

09 Dec '10

>-----Original Message----- >From: "Diederick C. Niehorster" [dcnieho(a)gmail.com] >Date: 09/12/2010 01:51 PM >To: boost-users(a)lists.boost.org >Subject: Re: [Boost-users] variant over base and derived classes >(sorry if this is a top post, my phone shows no msg quotes) >I'm no expert on this, but isn't there an compile time function to >testing if an instance is derived from another (in introspection or >something)? You could then maybe sort the variant types for most to >least derived and then test untill you find the suitable cast? >Just brainstorming pretty much. Hope its useful! >Best, >Dee yes, there is boost::is_base_of or some metafct like that in type_traits. not quite sure how to implement the sort though? will checkout mpl::sort with binary predicate base_or_derived. I have under 10 types, so compile time should be ok thanks,

2 1

iostream gzip / bzip header
by Kraus Philipp 09 Dec '10

09 Dec '10

Hello, I'm using bzip and gzip iostreams algorithms, but is there a solution to remove the header data of the compressed stream? I need only the compressed data not the header. Thanks Phil

2 1

Re: [Boost-users] variant over base and derived classes
by Hicham Mouline 09 Dec '10

09 Dec '10

-----Original Message----- From: "Hicham Mouline" [hicham(a)mouline.org] Date: 09/12/2010 03:22 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] variant over base and derived classes >>-----Original Message----- >>From: "Diederick C. Niehorster" [dcnieho_at_[hidden]] >>Date: 09/12/2010 01:51 PM >>To: boost-users_at_[hidden] >>Subject: Re: [Boost-users] variant over base and derived classes >>(sorry if this is a top post, my phone shows no msg quotes) >>I'm no expert on this, but isn't there an compile time function to >>testing if an instance is derived from another (in introspection or >>something)? You could then maybe sort the variant types for most to >>least derived and then test untill you find the suitable cast? >>Just brainstorming pretty much. Hope its useful! >>Best, >>Dee >yes, there is boost::is_base_of or some metafct like that in type_traits. >not quite sure how to implement the sort though? >will checkout mpl::sort with binary predicate base_or_derived. >I have under 10 types, so compile time should be ok >thanks, This works. The source is pasted below. I am however obliged to 1. declare a default-constructed variant 2. call mpl::for_each on the sequence of types in the variant a assign functor to assign to the variant. Is there a way I can embed/simplify this 2 stage construction? regards, Here is the source :-) #include <iostream> #include <boost/variant.hpp> #include <boost/type_traits/is_base_and_derived.hpp> #include <boost/mpl/sort.hpp> #include <boost/mpl/vector.hpp> #include <boost/mpl/lambda.hpp> #include <boost/mpl/for_each.hpp> #include <boost/mpl/not.hpp> #include <boost/mpl/logical.hpp> struct S { virtual ~S() {} }; struct Deriv1 : public S { virtual ~Deriv1() {} }; struct Deriv2 : public S { virtual ~Deriv2() {} }; struct Deriv3 : public Deriv2 { virtual ~Deriv3() {} }; typedef boost::variant<S,Deriv1, Deriv2, Deriv3> my_variant_t; typedef boost::mpl::sort<my_variant_t::types, boost::mpl::not_<boost::is_base_and_derived<boost::mpl::_,boost::mpl::_> > >::type v0_sorted_t; template <typename Variant, typename Base> struct assign { assign(Variant& v, const Base& b) : v_(v), assigned_(false), b_(b) {} template <typename T> void operator()(const T&) { std::cout<< typeid(T).name() <<std::endl; if (!assigned_) { const T* t = dynamic_cast<const T*>(&b_); if (t!=0) { v_ = (*t); assigned_ = true; } } } private: Variant& v_; bool assigned_; const Base& b_; }; int main() { S s; Deriv1 d1; Deriv2 d2; Deriv3 d3; const S& base = s; my_variant_t vvv; boost::mpl::for_each<v0_sorted_t>( assign<my_variant_t,S>(vvv, base) ); std::cout<< vvv.which() <<std::endl; return 0; }

2 1

Re: [Boost-users] variant over base and derived classes
by Hicham Mouline 09 Dec '10

09 Dec '10

>>-----Original Message----- >>From: "Diederick C. Niehorster" [dcnieho_at_[hidden]] >>Date: 09/12/2010 01:51 PM >>To: boost-users_at_[hidden] >>Subject: Re: [Boost-users] variant over base and derived classes >>(sorry if this is a top post, my phone shows no msg quotes) >>I'm no expert on this, but isn't there an compile time function to >>testing if an instance is derived from another (in introspection or >>something)? You could then maybe sort the variant types for most to >>least derived and then test untill you find the suitable cast? >>Just brainstorming pretty much. Hope its useful! >>Best, >>Dee >yes, there is boost::is_base_of or some metafct like that in type_traits. >not quite sure how to implement the sort though? >will checkout mpl::sort with binary predicate base_or_derived. >I have under 10 types, so compile time should be ok >thanks, This works. The source is pasted below. I am however obliged to 1. declare a default-constructed variant 2. call mpl::for_each on the sequence of types in the variant a assign functor to assign to the variant. Is there a way I can embed/simplify this 2 stage construction? regards,

1 0

Re: [Boost-users] mpi/serialization: broadcast function and the value argument
by Hicham Mouline 09 Dec '10

09 Dec '10

-----Original Message----- From: "Matthias Troyer" [troyer(a)phys.ethz.ch] Date: 09/12/2010 02:39 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] mpi/serialization: broadcast function and the value argument >On Dec 8, 2010, at 5:50 PM, Hicham Mouline wrote: >> Following a suggestion from another thread, I have tried broadcasting in a polymorphic way. >> >> I have a hierarchy of polymorphic struct (they have 2 virtual functions). I was wondering if it was possible/allowed to >> >> root process: >> base* b; /// b points to an actual derived struct but may also point the base struct (not abstract) >> broadcast( ..., b, ...); >> >> slave processes: >> base* b; >> broadcast( ..., b, ...); /// broadcast constructs the appropriate struct and makes b point to where it did that >> >> assuming all the conditions for pointer to class conditions are satisfied for the serialization library. >> >If serialization works on your polymorphic class then this should work as well. >Matthias It appears the implementation of mpi::broadcast(), according to this post, http://lists.boost.org/boost-users/2010/12/64802.php and I confirm that expects an already built object to call the (de)serialization procedure on. Therefore, this seems a specific issue that mpi::broadcast() may want to handle differently, could you confirm/correct? thanks,

1 0

serialization: const char*
by Hicham Mouline 09 Dec '10

09 Dec '10

hello, serializing a const char* is not allowed I gather? char* seems not to be allowed either. primitive types pointers are not serializable? I have a struct S{ double d; char c[SIZE]; const char* x; }; template <typename Archive> void serialize(Archive& ar, S& s, const unsigned int version) { ar & s.d; ar & s.c; ar & s.x; } the 3rd one seems to cause the compile error, removing constness didn't help. is one supposed to an array of char or a std::string instead regards,

3 2

mpi/serialization: broadcast function and the value argument
by Hicham Mouline 09 Dec '10

09 Dec '10

Following a suggestion from another thread, I have tried broadcasting in a polymorphic way. I have a hierarchy of polymorphic struct (they have 2 virtual functions). I was wondering if it was possible/allowed to root process: base* b; /// b points to an actual derived struct but may also point the base struct (not abstract) broadcast( ..., b, ...); slave processes: base* b; broadcast( ..., b, ...); /// broadcast constructs the appropriate struct and makes b point to where it did that assuming all the conditions for pointer to class conditions are satisfied for the serialization library. Otherwise, perhaps a solution with a boost::variant over the base struct and all of its derived is the way to go? Thanks,

2 1

Re: [Boost-users] variant over base and derived classes
by Hicham Mouline 09 Dec '10

09 Dec '10

>> -----Original Message----- >> From: Hicham Mouline [mailto:hicham@mouline.org] >> Sent: 09 December 2010 00:04 >> To: 'boost-users(a)lists.boost.org' >> Subject: variant over base and derived classes >> >> hello, >> <snip> >> >> typedef boost::variant<S,Deriv1, Deriv2, Deriv3> my_variant_t; >> >> Deriv3 d3; >> >> struct print_type: public boost::static_visitor<> { >> template <typename T> >> void operator()(const T&) const >> { >> std::cout<< typeid(T).name() <<std::endl; >> } >> }; >> >> const S& s = d3; >> my_variant_t v = s; >> boost::apply_visitor( print_type(), v ); >> >> This prints S. >> >> Is it a truncated copy of d3 that is stored v? >Yes. >> How do I construct v polymorphically so that the real object is stored? >> >> regards, >You have to downcast before creating the variant. >boost::variant only uses the static type of the object. >In Christ, >Steven Watanabe If I am given a const S* sptr, how do I construct an instance of the above variant then? const Deriv1* d1ptr; const Deriv2* d2ptr; const Deriv3* d3ptr; my_variant_t v = ((d1ptr = dynamic_cast<const Deriv1*>(sptr)) != 0 )? *d1ptr: ((d2ptr = dynamic_cast<const Deriv2*>(sptr)) != 0 )? *d2ptr: ((d3ptr = dynamic_cast<const Deriv3*>(sptr)) != 0 )? *d3ptr: *sptr; Is there a better way of writing this? rds, -------------------------------------------- Trying to do this more generically, I've thought of call mpl::for_each on the ::types of the variant to see which dynamic_cast works. The problem is that I need the most derived type to be stored in the variant. I can see how to do it by a virtual function but that is completely intrusive. regards,

2 1

Re: [Boost-users] [Proto] Failed to Mimic the "Lazy Vector" Example
by Hossein Haeri 09 Dec '10

09 Dec '10

Hi Thomas, > > Trying to mimic what comes in the Lazy Vector example > > http://www.boost.org/doc/libs/1_45_0/doc/html/proto/users_guide.html#boost_… <snip> > The type EmtDomain is incomplete when it is used in EmtExpr > (proto::extends ...). So is also lazy_vector_domain when it is used in lazy_vector_expr. What's different here? (See below.) > The solution is to forward declare EmtExpr, define the Domain and then > define the expression wrapper. Thanks, that works. :) But, I do still wonder why the same order of definition for Lazy Vector didn't work here: Grammar > Forward Declaration of Domain > (Context) > Expression Wrapper > Domain Do you mind shedding light on this too? TIA, --Hossein

1 0

Re: [Boost-users] mpi: sending/receiving different types
by Hicham Mouline 09 Dec '10

09 Dec '10

>The way we do this is send a special message saying that a broadcast >will be sent next. > Brian > >probe() checks only for messages sent by send(), not by broadcast(). >Matthias Thanks, I spend most of my time broadcasting, and sometimes sending.... I guess that means in the slave processes: . use mpi::broadcast() . if the received value is a signal that a send() to me will be issued next, then I'll recv() About the broadcast() function, I obviously have many types of messages to send, would you rather: 1. send a broadcast with just an int (like a tag) to tell which broadcast is following next or 2. construct a virtual base class my_mpi_broadcast , derive all the sendable broadcasts from it, from sender, send actual instance of derived from my_mpi_broadcast, and at receiver, can the mechanism reconstruct for me the derived class? (with boost::serialization) Is 2 doable at all? If so, pros/cons regards,

2 4

variant over base and derived classes
by Hicham Mouline 09 Dec '10

09 Dec '10

hello, How to determine the actual type of the object stored in a variant? struct S { virtual ~S() {} }; struct Deriv1 : public S { virtual ~Deriv1() {} }; struct Deriv2 : public S { virtual ~Deriv2() {} }; struct Deriv3 : public Deriv2 { virtual ~Deriv3() {} }; typedef boost::variant<S,Deriv1, Deriv2, Deriv3> my_variant_t; Deriv3 d3; struct print_type: public boost::static_visitor<> { template <typename T> void operator()(const T&) const { std::cout<< typeid(T).name() <<std::endl; } }; const S& s = d3; my_variant_t v = s; boost::apply_visitor( print_type(), v ); This prints S. Is it a truncated copy of d3 that is stored v? How do I construct v polymorphically so that the real object is stored? regards,

3 2

Re: [Boost-users] variant over base and derived classes
by Hicham Mouline 09 Dec '10

09 Dec '10

>> -----Original Message----- >> From: Hicham Mouline [mailto:hicham@mouline.org] >> Sent: 09 December 2010 00:04 >> To: 'boost-users(a)lists.boost.org' >> Subject: variant over base and derived classes >> >> hello, >> >> How to determine the actual type of the object stored in a variant? >> >> struct S { >> virtual ~S() >> {} >> }; >> >> struct Deriv1 : public S { >> virtual ~Deriv1() >> {} >> }; >> >> struct Deriv2 : public S { >> virtual ~Deriv2() >> {} >> }; >> >> struct Deriv3 : public Deriv2 { >> virtual ~Deriv3() >> {} >> }; >> >> typedef boost::variant<S,Deriv1, Deriv2, Deriv3> my_variant_t; >> >> Deriv3 d3; >> >> struct print_type: public boost::static_visitor<> { >> template <typename T> >> void operator()(const T&) const >> { >> std::cout<< typeid(T).name() <<std::endl; >> } >> }; >> >> const S& s = d3; >> my_variant_t v = s; >> boost::apply_visitor( print_type(), v ); >> >> This prints S. >> >> Is it a truncated copy of d3 that is stored v? >Yes. >> How do I construct v polymorphically so that the real object is stored? >> >> regards, >You have to downcast before creating the variant. >boost::variant only uses the static type of the object. >In Christ, >Steven Watanabe If I am given a const S* sptr, how do I construct an instance of the above variant then? const Deriv1* d1ptr; const Deriv2* d2ptr; const Deriv3* d3ptr; my_variant_t v = ((d1ptr = dynamic_cast<const Deriv1*>(sptr)) != 0 )? *d1ptr: ((d2ptr = dynamic_cast<const Deriv2*>(sptr)) != 0 )? *d2ptr: ((d3ptr = dynamic_cast<const Deriv3*>(sptr)) != 0 )? *d3ptr: *sptr; Is there a better way of writing this? rds,

1 0

emacs mode for quickbook?
by Wilhelm 09 Dec '10

09 Dec '10

Hi, does anybody know of there is already an emacs-mode for quickbook? -- Wilhelm

2 1

[Proto] Failed to Mimic the "Lazy Vector" Example
by Hossein Haeri 08 Dec '10

08 Dec '10

Dear all, Trying to mimic what comes in the Lazy Vector example http://www.boost.org/doc/libs/1_45_0/doc/html/proto/users_guide.html#boost_… I get a strange error speaking about result_of and the like. My guess is that there is some specialisation of a function object which does do the job for std::vector<> that I need to also specialise for my class. I can't find any track of that thing though. And, I might be totally wrong too... Anyway, for your reference, I have put the code as well as the error message that I get in GCC 4.5.1, MinGW, WinXP, SP3 in the PS section of this posting. Any ideas please? TIA,--Hossein <Code> #include <iostream> #include <boost/proto/proto.hpp> namespace mpl = boost::mpl; namespace proto = boost::proto; using proto::_; struct EWBase {}; typedef proto::terminal<double (*) (double)> FunctionType; struct EmtGrammar: proto::or_ < proto::terminal<EWBase>, proto::shift_right<EmtGrammar, FunctionType> > {}; struct EmtDomain; template<typename Expr> struct EmtExpr : proto::extends<Expr, EmtExpr<Expr>, EmtDomain> { typedef proto::extends<Expr, EmtExpr<Expr>, EmtDomain> base_type; EmtExpr( Expr const & expr = Expr() ) : base_type( expr ) {} }; template< typename T > struct Emt : EmtExpr<typename proto::terminal<EWBase>::type> { typedef typename proto::terminal<EWBase>::type expr_type; Emt(): EmtExpr<expr_type>(expr_type::make(EWBase())) {} }; struct EmtDomain : proto::domain<proto::generator<EmtExpr>, EmtGrammar> {}; int main() { return 0; } </Code> <Error Message> -------------- Build: Debug in ProtoGame2 --------------- Compiling: main.cpp In file included from D:\Sources\Boost\boost_1_42_0/boost/proto/traits.hpp:34:0, from D:\Sources\Boost\boost_1_42_0/boost/proto/expr.hpp:27, from D:\Sources\Boost\boost_1_42_0/boost/proto/core.hpp:17, from D:\Sources\Boost\boost_1_42_0/boost/proto/proto.hpp:12, from D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:3: D:\Sources\Boost\boost_1_42_0/boost/utility/result_of.hpp: In instantiation of 'boost::detail::result_of_nested_result<EmtDomain, EmtDomain(boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list1<const EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >&>, 1l>)>': D:\Sources\Boost\boost_1_42_0/boost/utility/result_of.hpp:75:1: instantiated from 'boost::detail::result_of_impl<EmtDomain, EmtDomain(boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list1<const EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >&>, 1l>), false>' D:\Sources\Boost\boost_1_42_0/boost/utility/detail/result_of_iterate.hpp:24:109: instantiated from 'boost::result_of<EmtDomain(boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list1<const EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >&>, 1l>)>' D:\Sources\Boost\boost_1_42_0/boost/preprocessor/iteration/detail/local.hpp:34:1: instantiated from 'boost::proto::exprns_::extends<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l>, EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >, EmtDomain, 0l>' D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:25:1: instantiated from 'EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >' D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:36:1: instantiated from here D:\Sources\Boost\boost_1_42_0/boost/utility/result_of.hpp:68:1: error: invalid use of incomplete type 'struct EmtDomain' D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:20:8: error: forward declaration of 'struct EmtDomain' In file included from D:\Sources\Boost\boost_1_42_0/boost/proto/extends.hpp:533:0, from D:\Sources\Boost\boost_1_42_0/boost/proto/core.hpp:23, from D:\Sources\Boost\boost_1_42_0/boost/proto/proto.hpp:12, from D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:3: D:\Sources\Boost\boost_1_42_0/boost/preprocessor/iteration/detail/local.hpp: In instantiation of 'boost::proto::exprns_::extends<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l>, EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >, EmtDomain, 0l>': D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:25:1: instantiated from 'EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >' D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:36:1: instantiated from here D:\Sources\Boost\boost_1_42_0/boost/preprocessor/iteration/detail/local.hpp:34:1: error: no type named 'type' in 'struct boost::result_of<EmtDomain(boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list1<const EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >&>, 1l>)>' In file included from D:\Sources\Boost\boost_1_42_0/boost/proto/traits.hpp:34:0, from D:\Sources\Boost\boost_1_42_0/boost/proto/expr.hpp:27, from D:\Sources\Boost\boost_1_42_0/boost/proto/core.hpp:17, from D:\Sources\Boost\boost_1_42_0/boost/proto/proto.hpp:12, from D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:3: D:\Sources\Boost\boost_1_42_0/boost/utility/result_of.hpp: In instantiation of 'boost::detail::result_of_nested_result<EmtDomain, EmtDomain(boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list1<EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >&>, 1l>)>': D:\Sources\Boost\boost_1_42_0/boost/utility/result_of.hpp:75:1: instantiated from 'boost::detail::result_of_impl<EmtDomain, EmtDomain(boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list1<EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >&>, 1l>), false>' D:\Sources\Boost\boost_1_42_0/boost/utility/detail/result_of_iterate.hpp:24:109: instantiated from 'boost::result_of<EmtDomain(boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list1<EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >&>, 1l>)>' D:\Sources\Boost\boost_1_42_0/boost/preprocessor/iteration/detail/local.hpp:34:1: instantiated from 'boost::proto::exprns_::extends<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l>, EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >, EmtDomain, 0l>' D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:25:1: instantiated from 'EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >' D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:36:1: instantiated from here D:\Sources\Boost\boost_1_42_0/boost/utility/result_of.hpp:68:1: error: invalid use of incomplete type 'struct EmtDomain' D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:20:8: error: forward declaration of 'struct EmtDomain' In file included from D:\Sources\Boost\boost_1_42_0/boost/proto/extends.hpp:533:0, from D:\Sources\Boost\boost_1_42_0/boost/proto/core.hpp:23, from D:\Sources\Boost\boost_1_42_0/boost/proto/proto.hpp:12, from D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:3: D:\Sources\Boost\boost_1_42_0/boost/preprocessor/iteration/detail/local.hpp: In instantiation of 'boost::proto::exprns_::extends<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l>, EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >, EmtDomain, 0l>': D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:25:1: instantiated from 'EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >' D:\My Documents\My Programmes\Tutorial\Proto\ProtoGame2\main.cpp:36:1: instantiated from here D:\Sources\Boost\boost_1_42_0/boost/preprocessor/iteration/detail/local.hpp:34:1: error: no type named 'type' in 'struct boost::result_of<EmtDomain(boost::proto::exprns_::expr<boost::proto::tag::function, boost::proto::argsns_::list1<EmtExpr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<EWBase>, 0l> >&>, 1l>)>' Process terminated with status 1 (0 minutes, 2 seconds) 6 errors, 0 warnings </Error Message>

2 1

Re: [Boost-users] mpi: sending/receiving different types
by Hicham Mouline 08 Dec '10

08 Dec '10

-----Original Message----- From: "Riccardo Murri" [riccardo.murri(a)gmail.com] Date: 08/12/2010 01:50 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] mpi: sending/receiving different types >> 2. the root sends directly a reference to a base class of anything sendable, >> then the receivers construct the derived classes on reception with >> broadcast. The T is then the base class type. >> > There's a risk of slicing here, i.e., if you pass a reference to a > base class, only the base class data will be serialized and received. > As far as I understand, Boost.Serialization (hence Boost.MPI) will do > the correct thing if you use *pointers* instead: i.e., you send a > pointer to a (derived) class and you receive it through a pointer to > the base class. > (Beware: I have not checked!) Does Boost.Serialization/MPI construct an object on the heap when it deserializes? e.g. master: base* b = &derived; broadcast( world, b, 0 ); slave: base* b; broadcast( world, b, 0 ); /// does this create the appropriate derived class on the heap, and make b point to it? Is this what you meant? Another question, the base struct contains a double and 2 char[8] fields, but also a virtual function. Does this mean it shouldn't be set as being a MPI data type because of its polymorphism? Thanks,

1 0

[Serialization] Inconsistent tracking_level when switching from static to DLL
by Guy Prémont 08 Dec '10

08 Dec '10

Hi, I am using boost (1.40) serialization on Windows (VS 2008) to serialize a complex hierarchy of classes. My application is composed of different modules, each having its own serialization library. I have a Core library, with a CoreSerialization library, that defines a bunch of classes and base data types; I also have a Vehicle library, with a separate VehicleSerialization library, the defines some other classes with base classes in Core and that also use some user data types defined in Core. Using static libraries, everything saves and loads perfectly. We recently switched to using DLLs. When loading and saving with an application that only uses core (as Dlls) everything serializes perfectly. We can load files that were generated by an older application (using static libraries), save them and load them back. If the application also uses the Vehicle libraries, it can load older files (generated using static libraries), save them, but fails to load them back. The difference between the files generated with a DLL application and a static link application, lies in the tracking of certain classes. Since the serialization is split between 2 DLLs, the tracking level (by default selectively) will actually depends on what classes are serialized in the DLL and may be different in different DLLs. This seems to be cause by the various singleton that are created, notably pointer_oserializer<T> and oserializer<T>. In a statically linked application, there is only one instance on those singleton, in a DLL linked application, there is one instance of the singleton for each DLL. I've also noticed that in my Core DLL, for certain type, there are both notably pointer_oserializer<T> and oserializer<T>, while in the Vehicle DLL, there is only notably oserializer<T>, hence the difference in tracking level. There is an easy fix here, not to use selective tracking but track always or never, explicitly. But still, there seems to be some data that needs to be shared across various serialization DLLs. I am a bit worry about some other bugs popping out relative to it. Has this bug ever been found? It may be a side effect of putting serialization code in DLLs, the documentation on that subject is a bit sparse. Thanks for any inputs Guy -- Guy Prémont, D.Sc. Architecte logiciel senior / Senior software architect CM Labs Simulations Inc. <blocked::http://www.cm-labs.com/> http://www.cm-labs.com/ Tel. 514-287-1166 ext. 237

2 5

Re: [Boost-users] [gil] Using gil::color_converted_view with gil::for_each_pixel (Christian Henning)
by Chris Yuen 08 Dec '10

08 Dec '10

Dear Christian, > > > > 2. This compiles > > > > gil::gil_function_requires<gil::ImageViewConcept<int> >(); > What do you mean? This shouldn't compile? I was under the impression that the point of gil_function_requires is to do static checking to ensure that a type is compatible with an GIL type? (Something akin to BOOST_CONCEPT_ASSERT) Is an int supposed to be compatible with ImageViewConcept? From the GIL tutorial http://stlab.adobe.com/gil/html/giltutorial.html#GenericVersionSec, it seems like it's being used as a static type check, and int clearly isn't compatible to an image view. Am I missing something? Best regards, Chris Yuen

2 1

[DateTime] overflow in posix_time::microseconds
by gast128 08 Dec '10

08 Dec '10

Hello all, we encountered an overflow in posix_time::microseconds: //about 40 years (1970-2010) const __int64 n = 1267195987000000; boost::posix_time::microseconds td(n); //overflow The overflow is easy explainable since date_time::subsecond_duration first multiplies it causing the overflow and then divides by 1000000. There are already multiple posts spended on this, but I saw no definitive answer. Can someone help? Alternatively we could work around it by first divide the hour part out of it (which makes the number smaller) before adding to a ptime, but preferably we would like this to see solved in the library itself.

1 1

Re: [Boost-users] mpi non-blocking communication
by Hicham Mouline 08 Dec '10

08 Dec '10

> (1) You must initialize MPI with MPI_Init_thread() instead of >MPI_Init(). The boost::mpi::communicator ctor uses MPI_Init(), so you >must run the initialization yourself and *then* create the >communicator object. For instance:: > MPI_Init_thread(&argc, &argv, MPI_THREAD_SERIALIZED) > // ... > mpi::communicator world; Riccardo, I have the following code in my main: int main(int argc, char* argv[]) { boost::mpi::environment env(argc, argv); const int mpi_thread_support = MPI::Init_thread(argc, argv, MPI_THREAD_SERIALIZED ); if (mpi_thread_support != MPI_THREAD_SERIALIZED) { std::cerr<< "MPI implementation does not support threads" <<std::endl; return 1; } boost::mpi::communicator world; ... } This prints an error however: Calling MPI_Init or MPI_Init_thread twice is erroneous. How does 1 avoid that the mpi::communicator constructor calling MPI_INIT twice? Perhaps it's the environment constructor that calls MPI_INIT? rds,

2 5

error when compiling boost 1.45
by Sean Farrow 08 Dec '10

08 Dec '10

Hi: I'[m trying to compile boost 1.45, with zlib/bzip2 support in the io streams library. My command line is: bjam toolset=msvc --stagedir=stage/vc/v10/32-bit -sZLIB_SOURCE="c:\progra~1\zlib" -sBZIP2_SOURCE="c:\progra~1\bzip2" --build-type=complete >boost.txt I get the following warning: LINK : fatal error LNK1181: cannot open input file 'boost_zlib.lib' This command line worked for compiling 1.44. Anyone got any ideas? Cheers Sean.

1 0

Re: [Boost-users] Code stopped compile after migrating 1.42->1.45 (worked around)
by Pavel Pervov 08 Dec '10

08 Dec '10

I've worked it around with the specialisation boost::lambda::bind<int> for now and filed a ticket #4962 (https://svn.boost.org/trac/boost/ticket/4962) WBR, Pavel. --- This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorized copying, disclosure or distribution of the material in this e-mail is strictly forbidden. Please refer to http://www.db.com/en/content/eu_disclosures.htm for additional EU corporate and regulatory disclosures.

1 0

Code stopped compile after migrating 1.42->1.45
by Pavel Pervov 07 Dec '10

07 Dec '10

I'm compiling my codebase with Microsoft Visual C++ 8/9 (Visual Studio 2005/2008) Here is an example code which I've crafted from what I have in my codebase: //------- code start -------------------------------- #include <algorithm> #include <map> #include <string> #include <iostream> #include <boost/lambda/lambda.hpp> #include <boost/lambda/bind.hpp> typedef std::map<int, int> MyMap; std::ostream& operator << (std::ostream& outs, const MyMap& a) { std::for_each(a.begin(), a.end(), outs << boost::lambda::bind(&A::value_type::second, boost::lambda::_1) << "\n"); return outs; } int main() { MyMap a; std::cout << a; } //------- code end --------------------------------- This code stopped compiling after I've migrated from boost version 1.42 to version 1.45. Any ideas would be appreciated. Regards, Pavel --- This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorized copying, disclosure or distribution of the material in this e-mail is strictly forbidden. Please refer to http://www.db.com/en/content/eu_disclosures.htm for additional EU corporate and regulatory disclosures.

2 1

[Fusion] Flatten a sequence of sequences
by Clinton Mead 07 Dec '10

07 Dec '10

Hi All Lets say I have something like the following: make_vector(1, make_vector('b', 3, make_vector(4, 5.5), "six"), 7, 8) I want to produce an function f such that f(make_vector(1, make_vector('b', 3, make_vector(4, 5.5), "six"), 7, 8)) -> [1,'b',3,4,5.5,"six",7,8] i.e. a flattened version of the sequence. I don't mind if this is a view of the original sequence or an actual vector. I don't mind a solution in C++0x if it can compile on GCC 4.5.1. Thanks

3 2

[interprocess]/[thread] - named_recursive_mutex spurious wake using scoped_lock
by Daniel Biagini 07 Dec '10

07 Dec '10

I'm running boost 1.43 on linux and seeing an issue where the scoped_lock<named_recursive_mutex> timed lock is returning immediately when another thread holds the lock. The lock is being stored in shared memory Am I doing something wrong? The code in question is the azLog function below, (I included some other relevant snips as well). thanks! Dan #define LOCK_WAIT_TIME 5; //seconds static named_recursive_mutex *globalLock = create_logger_lock(); static named_recursive_mutex *create_logger_lock () { named_recursive_mutex *ptr = NULL; if (globalLock) { return(globalLock); } deadlock_count = 0; lock_timeout = LOCK_WAIT_TIME; try { ptr = new named_recursive_mutex(open_or_create, (getShareName() + GLOBAL_LOCK).c_str()); } catch (const interprocess_exception &ie) { cerr << "FATAL: Couldn't initialize the logging subsytem, IE err:" << ie.what() << endl; throw; } catch (const std::exception &se) { cerr << "FATAL: Couldn't initialize the logging subsytem, std err:" << se.what() << endl; throw; } return(ptr); } void azLog(AZ_LOG_SEVERITY sev, AZ_LOG_COMPONENT comp, const string& log_str) { ptime to = second_clock::local_time() + seconds(lock_timeout); scoped_lock<named_recursive_mutex> lock(*globalLock, to); while(!lock.owns() && (second_clock::local_time() < to)) { cerr << pthread_self() << ": SPURIOUS WAKE!!" << to_simple_string(second_clock::local_time()) << " <=:=> " << to_simple_string(to) << endl; lock.timed_lock(to); } .....

1 0

[BGL] vertex, edge, and face properties of graph?
by Anders Wallin 07 Dec '10

07 Dec '10

Hi All, I'm implementing a half-edge data structure(*) based on adjacency_list. I'm storing vertex and edge properties as bundled properties (classes VertProps and EdgeProps), and can read/write them conveniently with e.g.: graph[vertexDescriptor].vertProp_a = 2 and x = graph[edgeDescriptor].edgeProp_b etc. I also need to keep track of the faces of the planar graph, and I'm wondering if there's a built-in way of doing this that would allow me to read/write face-properties via the same syntax: graph[faceDescriptor].faceProperty Could I derive my half-edge-class from adjacency_list, store and update a property-map for face-data, and provide a new overload for operator[] that takes a faceDescriptor type? or is there a better way? any examples available? thanks, AW (*) see e.g. http://www.holmes3d.net/graphics/dcel/

2 1

Re: [Boost-users] Code stopped compile after migrating 1.42->1.45
by Pavel Pervov 07 Dec '10

07 Dec '10

Small correction to the code: //------- code start -------------------------------- #include <algorithm> #include <map> #include <string> #include <iostream> #include <boost/lambda/lambda.hpp> #include <boost/lambda/bind.hpp> typedef std::map<int, int> MyMap; std::ostream& operator << (std::ostream& outs, const MyMap& a) { std::for_each(a.begin(), a.end(), outs << boost::lambda::bind(&MyMap::value_type::second, boost::lambda::_1) << "\n"); return outs; } int main() { MyMap a; std::cout << a; } //------- code end --------------------------------- Pavel --- This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorized copying, disclosure or distribution of the material in this e-mail is strictly forbidden. Please refer to http://www.db.com/en/content/eu_disclosures.htm for additional EU corporate and regulatory disclosures.

2 1

BOOST Filesystem file_size problem
by Claude 07 Dec '10

07 Dec '10

Hi! I have a problem with file_size () If I try to use file_size () like this: MyFileName string ("myFile"); file_size (path (MyFileName)); [...] Undefined reference to `boost:: filesystem2:: detail:: file_size_api (std:: basic_string <char, std:: char_traits <char>, std:: allocator <char>> const &) '[...] What is wrong? -- View this message in context: http://boost.2283326.n4.nabble.com/BOOST-Filesystem-file-size-problem-tp307… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

[statechart] optional<event> - warning
by Igor R 07 Dec '10

07 Dec '10

Hello, When I define optional<my_event>, I get a warning (MSVC10): warning C4291: 'void *boost::statechart::event<MostDerived>::operator new(size_t,void *)' : no matching operator delete found; memory will not be freed if initialization throws an exception In class statechart::event I see 2 overloads of operator new: void * operator new( std::size_t size ) void * operator new( std::size_t, void * p ) But only 1 operator delete: void operator delete( void * pEvent ) i.e., no placement delete. Is this intentional? Thanks.

2 4

Object pool
by Lloyd 07 Dec '10

07 Dec '10

Hi, I have gone through the object pool documentation, but could not find a clear answer to my doubt. I want to make a pool of 10 objects. As and when an object need to be created, the pool will be searched for free objects, then the free ones will be chosen. Otherwise it will wait until any of the object is free. Is this possible with object pool? My questions are... How can I allocate 10 objects in single shot? How can I get the reference to unused object from the pool? Is there a same mechanism for threads as well? Thanks in advance, Lloyd

2 1

Boost 1.39.0 program options.
by Sunil Thomas 07 Dec '10

07 Dec '10

Hi, Has any one else had a *glibc error (invalid free/delete issue)* pointing to boost_program-options in boost 1.39.0? Program exits with glibc error (double free; although nothing obvious stands out). Running valgrind hasn't really helped a lot. Is this a known boost issue in 1.39.0? I am using non-multithreaded versions of the boost libs: program-options, regex, iostreams, python, filesystem, system, date_time, unit_test_framework, and multithreaded version only for boost lib: thread. I've reached my wit's end on this problem that occurs only on linux (red hat 5, GNU compilers, GCC version 4.1.2) and any advice is helpful. Greatly appreciate if you could share your experience on how you fixed it. Thanks! --Tom.

2 1

Building boost on AIX6.
by Pat Suwalski 06 Dec '10

06 Dec '10

Hello, I'm having a lot of difficulty building boost on AIX6 with gcc. Searching for my problem just came up with a bunch of Windows users not settings their variables correctly. That does not seem to be the case for me. I'm dealing with v1.34.1, because apparently that works well on AIX. I had no problem building bjam. But then: -bash-3.2$ pwd /home/pats/boost-1.34.1 -bash-3.2$ ./tools/jam/src/bin.aix/bjam Unable to load Boost.Build: could not find build system. --------------------------------------------------------- /home/pats/boost-1.34.1/boost-build.jam attempted to load the build system by invoking 'boost-build tools/build/v2 ;' but we were unable to find "bootstrap.jam" in the specified directory or in BOOST_BUILD_PATH (searching /usr/share/boost-build, /home/pats/boost-1.34.1/tools/build/v2). Please consult the documentation at 'http://www.boost.org'. -bash-3.2$ ls -la /home/pats/boost-1.34.1/tools/build/v2/bootstrap.jam -rw-r--r-- 1 pats staff 761 Oct 29 2003 /home/pats/boost-1.34.1/tools/build/v2/bootstrap.jam Clearly the file is there. Setting explicit $BOOST_BUILD_ROOT and $BOOST_ROOT changes nothing, other than the error message output not mentioning /usr/share. So, the error message is lying, or there is something less obvious wrong. I had no issues building the same source tree on Suse and Solaris. Any advice? Many thanks, --Pat

1 0

Fwd: building Regex for Builder C++ 6.0
by Aleksandr Razov 06 Dec '10

06 Dec '10

Hello, I have a problem with building Regex for Builder C++ 6.0 When I execute make -fbcb6.mak I get following errors MAKE Version 5.2 Copyright (c) 1987, 2000 Borland bcc32 @MAKE0000.@@@ Borland C++ 5.6 for Win32 Copyright (c) 1993, 2002 Borland ../src/c_regex_traits.cpp: bcc32 @MAKE0001.@@@ Borland C++ 5.6 for Win32 Copyright (c) 1993, 2002 Borland ../src/cpp_regex_traits.cpp: bcc32 @MAKE0002.@@@ Borland C++ 5.6 for Win32 Copyright (c) 1993, 2002 Borland ../src/cregex.cpp: Error E2316 ../../../boost/functional/hash/hash.hpp 64: 'long_long_type' is > not a member of 'boost' Error E2356 ../../../boost/functional/hash/hash.hpp 64: Type mismatch in > redecla ration of 'boost::hash_value(bool)' Error E2344 ../../../boost/functional/hash/hash.hpp 48: Earlier declaration > of ' boost::hash_value(bool)' Error E2063 ../../../boost/functional/hash/hash.hpp 64: Illegal > initialization Error E2293 ../../../boost/functional/hash/hash.hpp 64: ) expected Error E2316 ../../../boost/functional/hash/hash.hpp 65: 'ulong_long_type' is > not a member of 'boost' Error E2238 ../../../boost/functional/hash/hash.hpp 65: Multiple declaration > for 'boost::hash_value(bool)' Error E2344 ../../../boost/functional/hash/hash.hpp 64: Earlier declaration > of ' boost::hash_value(bool)' Error E2063 ../../../boost/functional/hash/hash.hpp 65: Illegal > initialization Error E2293 ../../../boost/functional/hash/hash.hpp 65: ) expected Error E2171 ../../../boost/functional/hash/hash.hpp 137: Body has already > been d efined for function 'boost::hash_value(bool)' Error E2451 ../../../boost/functional/hash/hash.hpp 138: Undefined symbol > 'v' in function boost::hash_value(bool) Error E2316 ../../../boost/functional/hash/hash.hpp 194: 'long_long_type' is > not a member of 'boost' Error E2092 ../../../boost/functional/hash/hash.hpp 194: Storage class > 'inline' is not allowed here Error E2445 ../../../boost/functional/hash/hash.hpp 194: Variable > 'hash_value' i s initialized more than once Error E2063 ../../../boost/functional/hash/hash.hpp 194: Illegal > initialization Error E2293 ../../../boost/functional/hash/hash.hpp 194: ) expected Error E2316 ../../../boost/functional/hash/hash.hpp 434: 'long_long_type' is > not a member of 'boost' Error E2299 ../../../boost/functional/hash/hash.hpp 434: Cannot generate > templat e specialization from 'hash<T>' Error E2428 ../../../boost/functional/hash/hash.hpp 434: Templates must be > class es or functions Error E2316 ../../../boost/functional/hash/hash.hpp 435: 'ulong_long_type' > is no t a member of 'boost' Error E2299 ../../../boost/functional/hash/hash.hpp 435: Cannot generate > templat e specialization from 'hash<T>' Error E2428 ../../../boost/functional/hash/hash.hpp 435: Templates must be > class es or functions *** 23 errors in Compile *** > ** error 1 ** deleting bcb\libboost_regex-bcb-s-1_45\cregex.obj Please. Could anybody help me to resolve the problem. Thank you in advance. Aleksandr

2 1

compile time (template or preprocessor) text processing
by Laszlo Marak 06 Dec '10

06 Dec '10

Hello, My question is c++ related (I like to call the topic extreme c++ programming). We all know the excellent boost python framework, which exports c++ functions to python with spectacular elegance. As for the documentation of those functions boost offers a string parameter, which can contain the description of the particular function. Sometimes this documentation is already written (for example in doxygen). It would be good to import this documentation somehow to python. Is there a possibility to generate a std::string from a FILE following some rules using template meta-programming (or possibly the preprocessor)? For example my_function.cpp ///************* // this is the documentation of my_function // void my_function() { cout << "I've been called.\n" } boost_export.cpp def( "my_function", &my_function, (args()), generate_the_doc_in_compile_time_from<>("my_function.cpp") ) Here the generate_the_doc_in_compile_time_from<>("my_function.cpp") would hard-wire the docs into def at compile time, so it would no longer depend on my_function.cpp. Any ideas would be greatly appreciated. UJ

3 2

Lookup on composite key in MultiIndex
by Chris Jewell 06 Dec '10

06 Dec '10

Hi All, A question about fast lookup on ordered indices, if I may. I have a data structure: struct Individual { double I; double N; ... } I need some way of indexing Individuals such that I can perform queries such as "Return the set of Individuals such that Individual::I < T and Individual::N > N". I'm currently using a MultiIndex that orders the individuals by Individual::I, and therefore gives me fast lookups on the I field. I had thought about creating a composite key on both I and N, and then using the range() method to return iterators to the required individuals. However, I can't seem to find the correct syntax for a predicate for the composite key. Can anyone help me out? Is there a better way to achieve what I need? Thanks, Chris -- Dr Chris Jewell Department of Statistics University of Warwick Coventry CV4 7AL UK Tel: +44 (0)24 7615 0778

2 2

counting_range and irange
by Mathias Gaunard 06 Dec '10

06 Dec '10

What is the difference between counting_range and irange?

1 0

[Quickbook 1.4] template for link to issue ?
by Martin Moene 06 Dec '10

06 Dec '10

Hi, Still using Quickbook 1.4, I've not been able to create a template for linking to items in our issue database. Writing out the following works: \[[@https://host.domain/issues/view.php?id=121 #121]\] Text.. Giving: [#121] Text... I tried (several variations of) a macro like: [template issue[key] [@https://host.domain/issues/view.php?id=[key] #[key]] ] Using: * \[[issue 121]\] Text... However none had the desired effect. (I prefer to include the \[, \] inside the template.) Should I write the template differently, or do I have to upgrade to a newer version of Quickbook? Can someone give a hint? Thanks in advance. Martin Moene

2 2

mpi: sending/receiving different types
by Hicham Mouline 06 Dec '10

06 Dec '10

Hi, I will be sending messages of different kinds. The destination will not know what kind of message it is trying to receive. Imagine I send many messages of the same kind. I understand the tag in send/receive will be different in each case? Or can I send 2 messages of the same king with the same tag? That way the receiver can use the tag to identify what it is it is receiving. If so, is the receiver supposed to use the recv() function with different template argument T until the call succeeds ? Or should I always use packed_<oi>archive? rds,

3 4

Re: [Boost-users] [gil] Using gil::color_converted_view with gil::for_each_pixel
by Chris Yuen 05 Dec '10

05 Dec '10

Hello Christian, Thanks for your guidance! I took a look at semantic_at_c() and get_color() and they seem to do the trick! Here's a couple of more questions. I've posted a compiling, annotated code at http://boost.codepad.org/Fy2vP73l Below is the more elaborate description of my questions which can be found in the code: 1. Can I specify which channel to get in nth_channel_view()? For example, if I want to set the red channel to 255 for all the pixels, I would do gil::fil_pixels(gil::nth_channel_view(view, 0), 255). However, that only works if our view is rgb8 or bgr8, not argb8. Is there a way I can say something like gil::fill_pixels(gil::nth_channel_view(view, gil::find_channel_for_view(view, gil::red_t())), 255) ??? 2. This compiles gil::gil_function_requires<gil::ImageViewConcept<int> >(); Strange. Any ideas? Best regards, Chris Yuen P.S. I am definitely interested in reviewing the extension! Apparently I'm a begginer in GIL. How would you like me to review and where should I write to?

2 1

Help with Visual Studio settings for Boost Serialization
by Abdullah ARSLAN 05 Dec '10

05 Dec '10

I am trying to implement very simple sample of boost serialization. I have a sample class, class1. It only contains a simple int variable. I followed the examples given here : http://www.boost.org/doc/libs/1_45_0/libs/serialization/doc/index.html <http://www.boost.org/doc/libs/1_45_0/libs/serialization/doc/index.html> I also think that i followed this guideline : http://beta.boost.org/doc/libs/1_44_0/more/getting_started/windows.html but i am not sure... Here is the error i get: error LNK2019: unresolved external symbol "private: void __thiscall class1::serialize<class boost::archive::text..... Could you help me with this error or could you guide me with installation and running a very simple serialization example, step by step... like download this, install this and etc... I am using visual studio 2008 express... Thanks in advance..

4 6

[message_queue.hpp]is it possible to retrieve a file descriptor for a boost message queue
by rohini chandra pallapothu 05 Dec '10

05 Dec '10

Hi, Could you anyone please let me know if it is possible to wait on a boost message queue (even if it is in the future versions of boost). I could not find any function from the boost documentation that can be used to retrieve a file descriptor of boost message queue.I wanted to get it confirmed. Best Regards, Rohini Chandra

1 0

Lexical_cast and hex number
by Claude 05 Dec '10

05 Dec '10

Hi! It is possibile to transform a string representing a hexadecimal number in the format "0xnumber" or "number" (without "0x") in an integer with lexical_cast<>? -- View this message in context: http://boost.2283326.n4.nabble.com/Lexical-cast-and-hex-number-tp3070247p30… Sent from the Boost - Users mailing list archive at Nabble.com.

3 8

[iostreams] How do you flush an entire filter chain?
by Adam Nielsen 05 Dec '10

05 Dec '10

Hi all, I have some code that uses standard C++ iostreams and I would like to use Boost iostreams to insert a filter in the process to provide transparent XOR encryption/decryption without needing to modify the existing code. I have written a filter that applies the algorithm, and I create a filtering_stream<io::seekable> "stack" which has the XOR filter pushed onto it, followed by the original iostream. I then pass this stack along to the original function and for the most part it works. However when the original code tries to flush() the changes back to disk, the filter only calls flush() on the first item in the stack. This means the XOR algorithm has its flush() function called, but the iostream (next in line on the stack) does not. If I remove the XOR algorithm (leaving the filter stack in place) then it does call flush() on the original iostream now that it is the first element in the stack. So I would like to know if there is a way to flush an entire filter stack, rather than just the top-most element in the stack. My XOR filter function doesn't actually perform any caching so its flush() function simply returns true, as this seems to be required from what I could make out in the docs about flushing. I was unable to find any mention in the docs of how flush() should behave in a filter (not even a function signature) so I am not sure if this is correct! I just copied it off some of the test code as that was the only place I could find anything about it. Many thanks, Adam.

1 0

[gil] Using gil::color_converted_view with gil::for_each_pixel
by Chris Yuen 04 Dec '10

04 Dec '10

Hey guys, I realized that writing to gil::color_converted_view doesn't affect the underlying view's data. I wonder if that's correct? For example, let's say that I want to write a program that will take the value of the red channel and set the blue channel's value to half of that. Here's my failed attempt: template <typename SrcView> void half_red_to_blue(SrcView & view) { // Since SrcView might be RGB or BGR or some other types, // I decided to use a color_converted_view to ensure that I'm // accessing the correct channels type gil::color_converted_view_type<SrcView, gil::rgb8_pixel_t>::type MyView; MyView my_view = gil::color_converted_view<gil::rgb8_pixel_t>(view): struct my_lambda { void operator()(gil::rgb8_pixel_t & p) { p[2] = p[0] / 2; } }; gil::for_each_pixel(my_view, my_lambda()); } However, it only works when SrcView is not actually gil::rgb8_view_t. If I call, e.g. half_red_to_blue<gil::bgr8_view_t>(view), the view is not changed at all! I inspected a little in the debugger and it seems the write operation is writing to some kind of proxy location instead of the original pixels. Any ideas? Thanks in advance! Best regards, Chris Yuen

2 1

Runtime identity
by Robert Jones 04 Dec '10

04 Dec '10

I'm not sure if this is a stupid question, but is there a runtime equivalent of boost.mpl's identity metafunction? Something that just returns it's single argument, eg., template <typename T> T identity( T t ) { return t; } I think it's trivially simple to write, but I wonder if it already exists in Boost or indeed the STL? (I need this because I need to pass a function object which simply returns an object I already have - maybe I've missed a more obvious method?) Thx, Rob.

5 7

[Process] Can't build example
by benedikt.leschitzki＠gmx.de 04 Dec '10

04 Dec '10

Hi there, I just downloaded the current version of the Process library and tried to build the first example from the tutorial [1], but I get the following error: ############################################################### C:\Programme\boost\boost\process\detail\pipe.hpp||In constructor 'boost::process::detail::pipe::pipe()':| C:\Programme\boost\boost\process\detail\pipe.hpp|129|error: no matching function for call to 'boost::system::system_error::system_error(DWORD, const boost::system::error_category& (&)(), const char [54])'| C:\Programme\boost\boost\system\system_error.hpp|43|note: candidates are: boost::system::system_error::system_error(int, const boost::system::error_category&, const char*)| C:\Programme\boost\boost\system\system_error.hpp|39|note: boost::system::system_error::system_error(int, const boost::system::error_category&, const std::string&)| C:\Programme\boost\boost\system\system_error.hpp|36|note: boost::system::system_error::system_error(int, const boost::system::error_category&)| C:\Programme\boost\boost\system\system_error.hpp|33|note: boost::system::system_error::system_error(boost::system::error_code, const char*)| C:\Programme\boost\boost\system\system_error.hpp|30|note: boost::system::system_error::system_error(boost::system::error_code, const std::string&)| C:\Programme\boost\boost\system\system_error.hpp|27|note: boost::system::system_error::system_error(boost::system::error_code)| C:\Programme\boost\boost\system\system_error.hpp|25|note: boost::system::system_error::system_error(const boost::system::system_error&)| C:\Programme\boost\boost\process\detail\win32_ops.hpp||In function 'boost::shared_array<char> boost::process::detail::collection_to_win32_cmdline(const Arguments&)':| C:\Programme\boost\boost\process\detail\win32_ops.hpp|87|error: '::strcat_s' has not been declared| C:\Programme\boost\boost\process\detail\win32_ops.hpp||In function 'boost::shared_array<char> boost::process::detail::environment_to_win32_strings(const boost::process::environment&)':| C:\Programme\boost\boost\process\detail\win32_ops.hpp|127|error: '::memcpy_s' has not been declared| C:\Programme\boost\boost\process\detail\win32_ops.hpp||In function 'PROCESS_INFORMATION boost::process::detail::win32_start(const Executable&, const Arguments&, const boost::process::environment&, boost::process::detail::stream_info&, boost::process::detail::stream_info&, boost::process::detail::stream_info&, const boost::process::detail::win32_setup&)':| C:\Programme\boost\boost\process\detail\win32_ops.hpp|333|error: '::strcpy_s' has not been declared| C:\Programme\boost\boost\process\detail\win32_ops.hpp|340|error: '::strcpy_s' has not been declared| C:\Programme\boost\boost\process\self.hpp|90|warning: declaration of 'char** boost::process::__p__environ()' has 'extern' and is initialized| C:\Programme\boost\boost\process\self.hpp|90|error: invalid pure specifier (only '= 0' is allowed) before 'GetEnvironmentStrings'| C:\Programme\boost\boost\process\self.hpp|90|error: function 'char** boost::process::__p__environ()' is initialized like a variable| C:\Programme\boost\boost\system\error_code.hpp|214|warning: 'boost::system::posix_category' defined but not used| C:\Programme\boost\boost\system\error_code.hpp|215|warning: 'boost::system::errno_ecat' defined but not used| C:\Programme\boost\boost\system\error_code.hpp|216|warning: 'boost::system::native_ecat' defined but not used| ||=== Build finished: 7 errors, 4 warnings ===| ############################################################### What should I do? I'm using g++ version 4.4.1 from the mingw Package under Windows XP 32 bit. [1] http://www.highscore.de/boost/process/process/tutorials.html#process.tutori…

1 0

Problem building boost 1.45.0
by benedikt.leschitzki＠gmx.de 04 Dec '10

04 Dec '10

Hi, I just downloaded the latest boost version and wanted to build the library for MS-Windows XP 32 bit using the mingw compiler set. According to [1], building should be done using bootstrap.bat to build the bootstrap.bat. If I start it, it just gives me this message, no matter what first argument I give (I tried gcc, gcc-nocygwin, mingw): ######################################################################## Building Boost.Jam build engine Failed to build Boost.Jam build engine. Please consult bjam.log for furter diagnostics. You can try to obtain a prebuilt binary from http://sf.net/project/showfiles.php?group_id=7586&package_id=72941 Also, you can file an issue at http://svn.boost.org Please attach bjam.log in that case. ######################################################################## bjam.log: ######################################################################## ### ### "Could not find a suitable toolset." ### ### You can specify the toolset as the argument, i.e.: ### .\build.bat msvc ### ### Toolsets supported by this script are: borland, como, gcc, gcc-nocygwin, ### intel-win32, metrowerks, mingw, msvc, vc7, vc8, vc9, vc10 ### ######################################################################## Trying to build boost with the precompiled bjam (03.1.18) yields the following error: ######################################################################## C:/Programme/boost_1_45_0/tools/build/v2/build\configure.jam:145: in builds-raw *** argument error * rule UPDATE_NOW ( targets * : log ? : ignore-minus-n ? ) * called with: ( <pbin.v2\libs\regex\build\gcc-mingw-4.4.1\debug>has_icu.exe : : ignore-minus-n : ignore-minus-q ) * extra argument ignore-minus-q (builtin):see definition of rule 'UPDATE_NOW' being called [Entire error is here: http://boost.codepad.org/PbZYNTm5] ######################################################################## What should I do to build boost successfully? My g++ version is 4.4.1. [1] http://permalink.gmane.org/gmane.comp.lib.boost.build/23347

3 4

[Spirit 2] Questions related to generating grammars meta-dynamically
by Max Motovilov 03 Dec '10

03 Dec '10

I'm trying to create a serialization facility that builds the underlying Spirit grammars based on a data model extracted from user-supplied types (I guess meta-dynamically ought to be the right word :) ). In doing so, I seem to quickly run out of documentation coverage and accumulate questions that are not easily answered by perusing the source code. Here are the more painful members of that collection, posted in the hopes that someone more informed might answer them for me: - What are the respective scopes of the rule and the grammar? Specifically, within a parser expression (situated within a grammar's constructor, according to the pattern established in the examples) which of the locals<> can I refer to in the sub-expressions specifying explicit parser parameters and semantic actions? - I'd like to write a functor that selects one of the grammars from a list (Fusion sequence), and passes an argument (inherited attribute) to it; the [parser-like] result returned by this functor would then be used in an enclosing parser expression. Is there an easily computable type that such a functor can return? I have noticed that the implementations of grammar<>::operator() return a very intricate construct that would be hard to replicate outside Spirit code -- proto::terminal< spirit::qi::parameterized_nonterminal< start_type, supplied-argument-types... > > -- but maybe there is a simpler front-end type the above is convertible to and that will still work as a component of parser expression? Thanks in advance, ...Max...

4 6

[netlib] Update: 0.9 will not be header-only
by Dean Michael Berris 03 Dec '10

03 Dec '10

Hi Everyone, To those who are following the development of cpp-netlib (which shall be submitted for review /soon/ as Boost.Netlib), the current state of 0.9-devel and thus what's going to come out officially as 0.9 in a couple of weeks, will not be header-only. Aside from the obvious reason that the compile-times are starting to become unbearable (>10 minutes to build the whole test suite!!) and after noticing that the intended simplicity of the API with tag-metafunction dispatch is limiting the expressiveness of the HTTP client types, the 0.9 release will be the first release that will require an externally linked-in static library. The biggest culprit at the moment has been the implementation of the URI parser that uses Boost.Spirit Qi and >10 rules in the URI parsing grammar. The URI implementation is really declarative and nicely written (thanks go out to Jeroen Habraken for making that happen). The down-side of this has been the compile times: building the simple HTTP client takes close to one minute on the machine I'm using -- and by moving it to an externally-linked static lib, the compile of the same HTTP client is cut down to 10 seconds. Before you ask if I'm using GCC, the answer is no, I'm using Clang when developing so that I get as much speed as I can when doing the edit-rebuild-test cycle. I've written about what I've been doing and what I'll be doing in my three recent articles at C++ Soup. If you want to get more details, please follow the links below. http://cplusplus-soup.com/2010/12/03/cpp-netlib-moving-away-from-header-onl… http://cplusplus-soup.com/2010/12/02/cpp-netlib-demolition-day/ http://cplusplus-soup.com/2010/12/01/cpp-netlib-reducing-compilation-times/ Have a great weekend everyone, please send your qestions/comments/suggestions over either directly to me or through the various mailing lists (Boost-devel, Boost-users, cpp-netlib-devel). -- Dean Michael Berris deanberris.com

1 0

NewBie: help needed generating documentation with quickbook and bjam
by Wilhelm 03 Dec '10

03 Dec '10

Hello, this is a absolute newbie question: I try to write some documentation using quickbook. I was able to generate a .xml file. But now I have no idea how to produce a html or pdf version thereof. I read some documentation about bjam and installed the neccessary libraries (I hope). But I didn't find any documentation about how to write a .jam file for this purpose. Can someone help solving this (dumb) question? -- Wilhelm

1 0

boost/parameter/keyword.hpp warning, TI compiler
by Krzysztof Czainski 03 Dec '10

03 Dec '10

Hello, When I compile a file, that consists of only one line: #include <boost/parameter/keyword.hpp> with a Texas Intstruments compiler for DSP (cgtools-6.1.12); boost-1.45.0, I get this warning: boost/parameter/aux_/void.hpp, line 20: warning #1369-D: static local variables of extern inline function are not resolved to single copy. Not ANSI C++ Compliant It referes to: inline void_& void_reference() { static void_ instance; return instance; } In this particular context this warning seams harmless, so I would like to suppress it. As far as I know, this compiler doesn't have a #pragma warning(disable:1369) equivalent... I know how suppress this kind of warning globally, but I would not like that, because in other contexts this is an important warning. Any ideas, how I could suppress this warning locally, in code perhaps? Cheers Kris

3 4

[Units] unary minus on units is counter intuitive (or a bug)
by alfC 03 Dec '10

03 Dec '10

Hi, I found this counterintuitive result of applying the unary minus operator to a unit "- si::meter" is the same as "si::meter" (or any other unit). or worst std::cout << - si::meter*1. << std::endl; // prints 1*m i.e. the minus is explicitly ignored. The root of the problem is this curious line in boost/units/unit.hpp /// unit runtime unary minus template<class Dim,class System> typename unary_minus_typeof_helper< unit<Dim,System> >::type operator-(const unit<Dim,System>&) { typedef typename unary_minus_typeof_helper< unit<Dim,System> >::type type; return type(); } a more intuitive result (but not completely elegant) could be attained by defining instead: template<class Dimension, class System> quantity<unit<Dim, System> > operator-(unit<Dim, System> const& u){ return -1.*u; } This is a definition that I could add BUT it will conflict with the original definition. Another way, could be to specialize unary_minus_typeof_helper<...>::type to be something that is not a unit but holds the negative "direction" and the cast to Type(-1)*unit quantity but it seems overly complicated for the purpose. Note aside: Why would I need "minus units" in the first place? The original code that produced the confusion was - kB*T which appears commonly in physics. kB is the "atomic" unit of entropy/ specific heat (atomic::heat_capacity) and T is a temperature quantity. This was parsed as (-kB)*T and then as kB*T i.e. the minus sign was ignored all together. In my opinion unary operator- should not be defined for units in the first place. The current definition only makes things worst, by creating a counter intuitive result AND making the fix conflict with the definition. Thoughts? Thank you, Alfredo

3 2

mpi all_reduce
by Kraus Philipp 03 Dec '10

03 Dec '10

Hello, how can I use the mpi::all_reduce with std::accumulate? I would reduce the values of each process with a sum function Thanks Phil

3 2

boost-1.45.0 / MSVC 9.0: bjam --layout=system fails
by Roman Neuhauser 03 Dec '10

03 Dec '10

hello, i'm trying to build 1.45.0 on Windows 7 with MSVC 9.0. I'm using the Windows SDK shell. "bootstrap; bjam" passes. "bootstrap; bjam --layout=system" fails: c:/MinGW/msys/1.0/home/roman/wc/boost_1_45_0/tools/build/v2/build\virtual-target.jam:1066: in virtual-target.register-actual-name from module virtual-target error: Duplicate name of actual target: <pstage\lib>libboost_date_time.lib error: previous virtual target { common%common.copy-libboost_date_time.lib.STATIC_LIB { msvc%msvc.archive-libboost_date_time.lib.STATIC_LIB { msvc%msvc.compile.c++-gregorian\greg_month.obj.OBJ { gregorian/greg_month.cpp.CPP } } { msvc%msvc.compile.c++-gregorian\greg_weekday.obj.OBJ { gregorian/greg_weekday.cpp.CPP } } { msvc%msvc.compile.c++-gregorian\date_generators.obj.OBJ { gregorian/date_generators.cpp.CPP } } } } error: created from ./stage-proper error: another virtual target { common%common.copy-libboost_date_time.lib.STATIC_LIB { msvc%msvc.archive-libboost_date_time.lib.STATIC_LIB { msvc%msvc.compile.c++-gregorian\greg_month.obj.OBJ { gregorian/greg_month.cpp.CPP } } { msvc%msvc.compile.c++-gregorian\greg_weekday.obj.OBJ { gregorian/greg_weekday.cpp.CPP } } { msvc%msvc.compile.c++-gregorian\date_generators.obj.OBJ { gregorian/date_generators.cpp.CPP } } } } error: created from ./stage-proper error: added properties: <debug-symbols>off <define>NDEBUG <inlining>full <optimization>speed <runtime-debugging>off <variant>release error: removed properties: <debug-symbols>on <inlining>off <optimization>off <runtime-debugging>on <variant>debug c:/MinGW/msys/1.0/home/roman/wc/boost_1_45_0/tools/build/v2/build\virtual-target.jam:490: in actualize-no-scanner from module object(file-target)@3863 c:/MinGW/msys/1.0/home/roman/wc/boost_1_45_0/tools/build/v2/build\virtual-target.jam:135: in object(file-target)(a)3863.actualize from module object(file-target)@3863 c:/MinGW/msys/1.0/home/roman/wc/boost_1_45_0/tools/build/v2\build-system.jam:748: in load from module build-system c:\MinGW\msys\1.0\home\roman\wc\boost_1_45_0\tools\build\v2/kernel\modules.jam:283: in import from module modules c:\MinGW\msys\1.0\home\roman\wc\boost_1_45_0\tools\build\v2\kernel\bootstrap.jam:142: in boost-build from module c:\MinGW\msys\1.0\home\roman\wc\boost_1_45_0\boost-build.jam:17: in module scopefrom module i need the system layout build. how can i get around the error? -- roman

3 4

Nested If in boost:mpl::if_
by Leon Sit 02 Dec '10

02 Dec '10

hi all I am trying to use mpl to do some simple type computation that involves nest if statements The logic is somewhat like if(T is Libor) return LiborType if( or( or(T = Euribor, T = EURLibor), is_base_of(T, Libor) ), ConstrType2, if( or(is_base_of(T, Euribor), is_base_of(T, EURLibor)), ConstrType1, ConstrType ) ) When I first coded it and instantiate T with some derived class of Libor, the final type is always a generic type. Few more testing shows that the inner if_ in the code below typedef typename boost::mpl::if_ < boost::is_same<InType, QuantLib::Libor>, QuantLib::Libor, boost::mpl::if_ < boost::mpl::or_ < boost::is_same<InType, QuantLib::Euribor>, boost::is_same<InType, QuantLib::EURLibor>, boost::is_base_of<QuantLib::Libor, InType> > ConstrType2, boost::mpl::if_ < boost::mpl::or_ < boost::is_base_of<QuantLib::Euribor, InType>, boost::is_base_of<QuantLib::EURLibor, InType> >, ConstrType1, ConstrType > > >::type Type; does not reduce to ConstrType1/ConstrType2/ConstrType but the whole is used as a type. So the final Type is just a type with 3 nested if_ class inside. I tried linearising the logic but this introduces other problem. Is this a bug or a limitation of mpl::if_? Thanks

2 1

[Boost.Test] does not always include checkpoint information
by Peter Soetens 02 Dec '10

02 Dec '10

I'm using boost 1.40. When parsing the output of a Boost.Test xml file, I sometimes get this error: "test-result.xml:cvc-complex-type.2.4.b: The content of element 'Exception' is not complete. One of '{LastCheckpoint}' is expected." (output from Hudson Test plugin). It appears that It does not consider the entry point of the unit test function as a checkpoint, while the documentation says it does. I can 'fix' this by inserting check/pass points at the beginning of every function, but shouldn't Boost.Test do this automatically ? Peter

2 1

mpi non-blocking communication
by Kraus Philipp 02 Dec '10

02 Dec '10

Hello, I have some problems with the MPI non-blocking communication, but I can be a thinking error. The CPU 0 (rank 0) creates a loop with this: while (true) { std::string l_str; p_com.irecv( mpi::any_source, LOGGER_MPI_TAG, l_str ); } p_com is the commuicator object. All other CPUs (!= 0) can send a message to CPU 0, which should be received. The CPUs (!=0) can send a message, but they need not, so I would create this with non-blocking communication. At this time my l_str is alway empty, so it seems that the message, that are send, not transmittet, received or not inserted into l_str. I hope the problems is described in a clear way. I would like that the CPU 0 can receive message of there are some and all other CPUs can send messages. Thanks Phil

3 14

Writing an inline nullary function object?
by Robert Jones 02 Dec '10

02 Dec '10

How can I write an inline nullary function object, returning a fixed value? The equivalent of this... int x = 4; int f( ) { return x; } boost::function<int()> g = f; but without defining the intermediate f()? I thought this might work... boost::function<int()> g = bind(bind(apply<int>(), _1 ), x ); but maybe I've not got it quite right? Thx - Rob.

3 4

[Units] Converting from angular_velocity to degrees_per_second
by Andrew Hundt 01 Dec '10

01 Dec '10

I need to make a conversion from a general angular_velocity to degrees/second. For example: boost::units::quantity< boost::units::si::angular_velocity> m_speed((30.0*boost::units::si::radians_per_second)); uint32_t result = static_cast<uint32_t>(boost::units::quantity<boost::units::si::angular_velocity,uint32_t>(m_speed*boost::units::degree::degrees/boost::units::si::seconds).value()); However it fails to compile in gcc 4.4, reporting: error:incomplete type '[type removed]' used in nested name specifier Could someone explain the proper syntax to achieve the desired type specification and subsequent conversion? Do I need to specify a degrees_per_second unit, and if so, how? Thank you in advance for your help. Cheers! Andrew Hundt

2 3

[interprocess] Named mutex
by Chard 01 Dec '10

01 Dec '10

Ion, anyone, I'm trying to use a named mutex to control access to a file. The example given here: http://www.boost.org/doc/libs/1_45_0/doc/html/interprocess/synchronization_… seems to be a starting point. However, I'm not exactly sure what this example is demonstrating. For example: - it appears to be attempting to control access to a file called "file_name". However, streams are opened on the file so, AFAICT, if interleaving calls from two processes stream out to it, the outcome will be unpredictable (even under controlled lock, due to the file-pointer position) ? - the file is thrown away at process exit; what would this mean if the other process is accessing it? - the 'mutex_remove' object causes removal of the named mutex on construction. I presume this is to demonstrate a clean up of a residual named mutex if a previous execution did not exit cleanly. However, if process 1 starts up and executes until just after the mutex creation, then process 2 starts up and executes the mutex_remove, the mutex appears to be in an invalid state, and the scoped_lock calls have no effect - this is certainly the case on Windows. This would defeat the whole point. Any clarification appreciated...

1 0

[spirit] This parser hang
by Kamil Zubair 01 Dec '10

01 Dec '10

This code: std::string s("blablabla"); std::string::iterator start = s.begin(); std::string::iterator finish = s.end(); bool result = phrase_parse(start, finish, +(!char_(':')), space); It's just a simple parser that match string which doesn't have ':' character in it right ? But when I run it, function phrase_parse is hang, it never return anything. I'm using boost 1.44 with VC 2008

3 4

[range] Tuple initialization?
by Marcin Zalewski 01 Dec '10

01 Dec '10

I have a following fragment of code: local = boost::begin(f(*current)); local_end = boost::end(f(*current)); local and local_end are two iterators, f is a function that returns a range, and current is some iterator I have around. I would like to initialize two iterators from the range returned by f, but it seems that I only have two choices: create a local range variable or call f twice and have two temporary ranges. Am I missing something, or are these indeed the only choices? Would it be reasonable to have a begin_end (or such) function that returns a tuple of iterators from a range for tuple initialization of two iterators? Currently, the range concepts do not require anything of the sort. Thanks, Marcin

1 0

Valgrind false positive in make_shared
by Dave Steffen 01 Dec '10

01 Dec '10

> Date: Thu, 18 Nov 2010 19:51:55 +0200 > From: "Peter Dimov" <pdimov(a)pdimov.com> > > Dave Steffen wrote: > > I got this bad behavior with GCC 4.4.4. It goes away with GCC 4.2.4. > > What is the definition of std::forward in GCC 4.4.4? What happens if you > > change boost::detail::sp_forward in make_shared.hpp:150: > ::new( pv ) T( boost::detail::sp_forward<Arg1>( arg1 ), > > boost::detail::sp_forward<Args>( args )... ); > > to std::forward, do you get a compile warning on this line and does > Valgrind still warn? Hi Coming back to this issue after a week or two... trying the above made no difference: no compiler warnings, and no change in Valgrind's error messages. Any thoughts? Thanks! -- Dave Steffen, Ph.D. - Software Engineer Numerica Corporation <http://www.numerica.us> 4850 Hahns Peak Drive, Suite 200 Loveland, Colorado 80538 main (970) 461-2000 x 227 direct (970) 612-2327 Email: dave.steffen(a)numerica.us fax (970) 461-2004 This message and any attachments are intended only for the individual or entity to which the message is addressed. This is a private message and may contain privileged information. If you are neither the intended recipient nor the agent responsible for delivering the message to the intended recipient, you are hereby notified that any review, retransmission, dissemination, or taking of any action in reliance upon, the information in this communication is strictly prohibited, and may be unlawful. If you feel you have received this communication in error, please notify me immediately by returning this email to me and deleting it from your computer.

2 4

[BGL] Searching for a convenient way to combine predicates for filtered_graph
by Cedric Laczny 01 Dec '10

01 Dec '10

Hi, I was wondering if there is a convenient (and to some extent intuitive) way to combine several predicates used in filtering a graph? The idea is to have some predicates defined and arbitrarily combine them so that the filtered_graph will check for compliance of each individual predicate and either make this vertex/edge visible or not. Of course, the predicates should be specific to vertices or edges, respectively, when being combined. When using std::vector or such, they would need to be all of the same type which does not seem very nice/feasible IMHO. Also defining a "big" predicate having a multitude of "smaller" predicates as members is not really an option as this is very restricted. Something like big_predicate = predicate1 || predicate2 || predicate3 (syntax should just illustrate the idea) maybe? Best, Cedric

3 9

[ serialisation ] 1.45 portable binary archive fails for shared_ptr on AIX/v11.1
by Avi Bahra 01 Dec '10

01 Dec '10

// This file is used to show problem with the portable binary archive(1.45) // when using the AIX/v11.1 compiler // // This test passes on Linux:gcc-4.2.1/HPUX:acc but crashes on AIX. // #include <assert.h> #include <iostream> #include <fstream> #include "portable_binary_oarchive.hpp" #include "portable_binary_iarchive.hpp" #include <boost/serialization/string.hpp> #include <boost/serialization/shared_ptr.hpp> #include <boost/serialization/weak_ptr.hpp> class CLimit { public: CLimit(const std::string& name) : name_(name) {} CLimit() {} const std::string& name() const { return name_;} private: std::string name_; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int) { ar & name_; } }; class InLimit { public: InLimit(const std::string& name,boost::shared_ptr<CLimit> l) : name_(name), limit_(l) {} InLimit() {} const std::string& name() const { return name_;} CLimit* limit() const { return limit_.get();} private: std::string name_; boost::shared_ptr<CLimit> limit_; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int) { ar & name_; ar & limit_; } }; int main() { std::string fileName= "pba.txt"; { const InLimit saved; std::ofstream ofs( fileName.c_str(), std::ios::binary); portable_binary_oarchive oa(ofs); oa << saved; std::cout << "saved OK\n"; } { InLimit restored; std::ifstream ifs( fileName.c_str(), std::ios::binary); portable_binary_iarchive ia( ifs ); ia >> restored; std::cout << "restored OK\n"; } return 0; } // ---------------------------------------------------------------- Best regards, Ta, Avi

1 0

Re: [Boost-users] [Bind] Retrun-type of bind expressions (SOLVED)
by Cedric Laczny 01 Dec '10

01 Dec '10

Hi, I found out how to specify the return type using boost::function and boost::bind, basically thanks to http://stackoverflow.com/questions/1044703/how-do-you-pass-boostbind-object… to-a-function/1044732#1044732 Say we are given two function objects (DefaultConstructible, CopyConstructible and only having "bool operator()"). As a little side note, it might be necessary to include "typedef bool return_type" in the definition of the functions objects (struct, class) (s. http://www.boost.org/doc/libs/1_45_0/libs/bind/bind.html#with_function_obje…) Then the return type can be declared as follows: typedef boost::function< bool( ARG-TYPE ) > CombinedPred; CombinedPred combined_pred = boost::bind(functor1, _1) && boost::bind(functor2, _1) where ARG-TYPE is the input paramter type the operator() was defined for in the functors (e.g. int, if operator() is working on ints). The basic idea is that functors that "return" bool and have the same input argument type will also have the same type(s) when being combined, e.g. by logical operators. Other combinations are of course also possible as boost::bind provides several overloaded operators like "&&", "||", "!" etc. Best, Cedric

1 0

Re: [Boost-users] Understanding Threads: Slow on Win32 with DLL
by Simon Adler 01 Dec '10

01 Dec '10

Hello Nat, Yes - i am sure that every Thread is just computing the reduced number - i tested it more than once. They are not producing log output. I have a timer to measure the time basing on the Frequency Performance Counter. After 5 seconds of runtime I do an output of the average computation time. Will now try to eliminate the dll - have a little luck that the required class has no dependencies, so it will take not long - will show the results shorty. Simon

1 0

[BGL] reverse_graph and filter_graph does not compile on 1.45
by gast128 01 Dec '10

01 Dec '10

Hello all, we got here a situation on VS2008 which did compile on 1.44 with a reverse graph of a filtered graph. I get constantly a f*cking 'You seem to be top-posting. Don't do that.' error from gmane, so I give up to include a reproducable case. It's easy to do it urself by making a construct like 'boost::make_reverse_graph (fgraph), where fgraph is a fitlered graph.' Anyone?

2 4

program options parse string
by Lloyd 01 Dec '10

01 Dec '10

Hi, I want to parse a simple string using boost program options. Let the string to parse look like this The input string looks like this string str="ARG1=hai ARG2=long string with space ARG3=12" This is how the command should be parsed ARG1="hai" ARG2="long string with space" ARG3=12 This is how my program looks like string in="ARG1=hai ARG2=long string with space ARG3=12"; options_description desc("OPT"); desc.add_options() ("CMD",value<string>(),""), ("ARG",value<string>(),""), ("TYPE",value<int>(),"") ; variables_map vm; stringstream ss(in); store(parse_config_file(ss,desc),vm); notify(vm); if(vm.count("ARG1")) { cout<<"ARG1:"<<vm["ARG1"].as<string>()<<endl; } But it prints ARG1:hai ARG2=long string with space ARG3=12 How can I split it into different options? Thanks in advance, Lloyd

1 0

Understanding Threads: Slow on Win32 with DLL
by Simon Adler 01 Dec '10

01 Dec '10

Hello Boost-Users, I have a strange Problem and also a theorie to solve it. I do not realy understand the reason and hope for somebody how may explain the problem. I am using boost.threads to execute some algorithms in parallel. I will post source code in detail if this is required. I have some work to do which is similar for different Data. Concrete: I compute some Forces on a Deformationmodel of geometrical Edges. I create for n available Processors n-1 Threads so lets say we have 10.000 Edges 3 times 2500 are processed from boost threads and 2500 are processed by the main thread. Because this is a worker crew i join the threads and will be finished. All this is done in Win32 using Visual Studio Express and Boost. I create some wrapper Structure at the moment struct Wrappy { void operator()( EdgeProcessor * array, int count) { for (int i = 0; i < count; i++) array[i]->compute(); } } My main application is creating a EdgeProcessor Array of 10000 Elements. In boost::thread constructor I give a ptr to the elements the thread should compute and count is for every thread 2500. You'll see - everything is straight forward and worked fine in a lot of situations. Now EdgeProcessor is a class compiled in a seperate dll (Multithreaded DLL) doing a lot of calls - some recursive, Just basic C++ calls, no std contaiiners in use. If I process all Elements with the main application using no threads it takes 0,07 sec and i have 100% usage of one CPU (have an I5, so 25% in total) If I use threads, i got 0,19 sec - more than twice the time. If I use just one boost::thread - not processing in main app - again 0,07 sec. If I use all threads all four cpus are in 100% usage - they are all together working but require more than twice the time - Yes i am sure that every thread is just working on 2500 Elements. If more than one thread is calling the EdgeProcessor, the task is done very slow. The data for the EdgeProcessor is by the way parallel, so every EdgeProcessor has its own data and there are no intersections or synchronisations at all. I assume that there is a realy big overhead because of the dll. Maybe the access of the class can not be done in parallel or not as fast as in a static case. Maybe there is a hidden synchronisation. Do you have some explanation for this? I use the same approach on other parts of the application without problems. The only difference is a) using of a class Instance within a dll and b) the compute will result i a couple of recursive calls (traversing tree) I have experience in this, but this behavior is strange. I am sorry if this is a little win32 / dll / visual studio like, but i am not sure where to ask. Thanks for your ideas! Simon

2 1

Boost 1.45 compile error
by gast128 01 Dec '10

01 Dec '10

Hello all, just tried out Boost 1.45 on VStudio 2003 but I got a compile error by only including type_traits: #include <boost/type_traits.hpp> int main() { return 0; } C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(160) : error C2027: use of undefined type '<Unknown>' C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(143) : see declaration of '<Unknown>' C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(160) : see reference to class template instantiation '<Unknown>' being compiled C:\Work Sdk\boost_1_45_0\boost\type_traits\common_type.hpp(121) : see reference to class template instantiation '<Unknown>' being compiled C:\Work Sdk\boost_1_45_0\boost\type_traits\common_type.hpp(123) : see reference to class template instantiation 'boost::type_traits_detail::common_type_2<T,U>' being compiled C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(160) : error C2146: syntax error : missing ';' before identifier 'wrapped_type' C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(160) : error C2501: '<Unknown>' : missing storage-class or type specifiers C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(161) : error C2653: 'wrapped_type' : is not a class or namespace name afaik it seems located on 121 in 'boost/type_traits/coomon_type.hpp' Anyone can help?

5 4

Usign boost::bind with a call to member function
by przemyslaw.sliwa＠uk.bnpparibas.com 30 Nov '10

30 Nov '10

Hello, I would like to replace this trivial loop for(size_t i=0; i<intersection.size(); i++) { domCcyEventPtrs.push_back(events->event(domCcy, intersection[i])); } with a call to std::transform and boost::bind. The events object is actually a boost_shared_ptr<> of a certain type. domCcyEventPtrs and intersection are std::vector<> objects. Can this be done? Cheers ___________________________________________________________ This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorised copying, disclosure or distribution of the material in this e-mail is prohibited. Please refer to http://www.bnpparibas.co.uk/en/information/legal_information.asp?Code=ECAS-… for additional disclosures.

2 1

[BGL] Serializing a filtered_graph
by Cedric Laczny 30 Nov '10

30 Nov '10

Hi, I was wondering if there is a way to serialize filtered_graphs? My first attempts fail because keep_all seems not to be serializable: /usr/include/boost/serialization/access.hpp:109: error: ‘struct boost::keep_all’ has no member named ‘serialize’ I have no problems serializing even custom adjacency_lists using the same approach. Besides discussing if it actually makes sense to serialize a filtered_graph, I am interested in suggestions on how to achieve it (if it is indeed possible). Thank you. Best regards, Cedric

3 6

[Bind] Retrun-type of bind expressions
by Cedric Laczny 30 Nov '10

30 Nov '10

Hello, I am currently trying to find a way to conveniently combine different predicates for a boost::filtered_graph. boost::filtered_graph needs a specification of the template-arguments. Therefore it important to know the return type of a bound expression. I have read that actually the return type of bound expression is "undeterminated" and one should rather use boost::function. However, I could not come up with an idea to realize the following, either with bind or with function: using namespace boost; // Both predicates are function objects: Default Constructible, Copy Constructible and only having "template< class V > bool operator()( const V& v)" Pred1 pred1; Pred2 pred2; filtered_graph< MyGraph, keep_all, ?bind_return_type?> fg( g, keep_all(), bind<bool>(pred1, _1) && bind<bool>(pred2, _1)); The question is now how to specify the bind_return_type, or how to do this with boost::function? Besides that, I hope that the logical combination (both predicates should hold) and use of bind() in the example is correct?! Best, Cedric

1 0

Boost Graph Adjacency matrix to boost uBLAS integer matrix
by Masanao Yajima 30 Nov '10

30 Nov '10

Hi List I am wondering if there is any function that I can use to extract the actual adjacency matrix (square 0/1 matrix) from adjacency_matrix graph object and convert it into uBLAS integer matrix. I can create an zero matrix, and then get the edge list from the graph and go through it one by one to form such a matrix. But if anyone know any better way around, I would appreciate your input. Thank you. Masanao

2 1

[BGL] Boost 1.45 implicit graph A* example crashes
by Szymon Gatner 30 Nov '10

30 Nov '10

Hi, I just tried running example included with BGL astar_maze.cpp and it crashes every time I do that. Call stack (VC++ 2008 SP1): > astar_maze.exe!boost::unordered_detail::hash_table<boost::unordered_detail::set<vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > >::find_iterator(boost::unordered_detail::hash_bucket<std::allocator<boost::array<unsigned int,2> > > * bucket=0xcfec9914, const boost::array<unsigned int,2> & k=0x002cf0d8) Line 55 + 0x3 bytes C++ astar_maze.exe!boost::unordered_detail::hash_table<boost::unordered_detail::set<vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > >::find(const boost::array<unsigned int,2> & k=0x002cf0d8) Line 583 + 0x10 bytes C++ astar_maze.exe!boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > >::find(const boost::array<unsigned int,2> & k=0x002cf0d8) Line 400 + 0x13 bytes C++ astar_maze.exe!boost::set_contains<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> >,boost::array<unsigned int,2> >(const boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > & s={...}, const boost::array<unsigned int,2> & x=0x002cf0d8) Line 21 + 0x23 bytes C++ astar_maze.exe!boost::is_not_in_subset<boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > >::operator()<boost::array<unsigned int,2> >(const boost::array<unsigned int,2> & x=0x002cf0d8) Line 60 + 0xf bytes C++ astar_maze.exe!boost::filter_iterator<boost::is_not_in_subset<boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > >,boost::transform_iterator<boost::detail::grid_graph_vertex_at<boost::grid_graph<2,unsigned int,unsigned int> >,boost::counting_iterator<unsigned int,boost::use_default,boost::use_default>,boost::use_default,boost::use_default> >::satisfy_predicate() Line 100 + 0x41 bytes C++ astar_maze.exe!boost::filter_iterator<boost::is_not_in_subset<boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > >,boost::transform_iterator<boost::detail::grid_graph_vertex_at<boost::grid_graph<2,unsigned int,unsigned int> >,boost::counting_iterator<unsigned int,boost::use_default,boost::use_default>,boost::use_default,boost::use_default> >::filter_iterator<boost::is_not_in_subset<boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > >,boost::transform_iterator<boost::detail::grid_graph_vertex_at<boost::grid_graph<2,unsigned int,unsigned int> >,boost::counting_iterator<unsigned int,boost::use_default,boost::use_default>,boost::use_default,boost::use_default> >(boost::is_not_in_subset<boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > > f={...}, boost::transform_iterator<boost::detail::grid_graph_vertex_at<boost::grid_graph<2,unsigned int,unsigned int> >,boost::counting_iterator<unsigned int,boost::use_default,boost::use_default>,boost::use_default,boost::use_default> x={...}, boost::transform_iterator<boost::detail::grid_graph_vertex_at<boost::grid_graph<2,unsigned int,unsigned int> >,boost::counting_iterator<unsigned int,boost::use_default,boost::use_default>,boost::use_default,boost::use_default> end_={...}) Line 60 C++ astar_maze.exe!boost::vertices<boost::grid_graph<2,unsigned int,unsigned int>,boost::keep_all,boost::is_not_in_subset<boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > > >(const boost::filtered_graph<boost::grid_graph<2,unsigned int,unsigned int>,boost::keep_all,boost::is_not_in_subset<boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > > > & g={...}) Line 285 + 0x5e bytes C++ astar_maze.exe!boost::astar_search<boost::filtered_graph<boost::grid_graph<2,unsigned int,unsigned int>,boost::keep_all,boost::is_not_in_subset<boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > > >,euclidean_heuristic,astar_goal_visitor,boost::associative_property_map<boost::unordered_map<boost::array<unsigned int,2>,boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<std::pair<boost::array<unsigned int,2> const ,boost::array<unsigned int,2> > > > >,boost::shared_array_property_map<double,boost::grid_graph_index_map<boost::grid_graph<2,unsigned int,unsigned int>,boost::array<unsigned int,2>,unsigned int> >,boost::associative_property_map<boost::unordered_map<boost::array<unsigned int,2>,double,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<std::pair<boost::array<unsigned int,2> const ,double> > > >,boost::static_property_map<double>,boost::grid_graph_index_map<boost::grid_graph<2,unsigned int,unsigned int>,boost::array<unsigned int,2>,unsigned int>,boost::shared_array_property_map<enum boost::default_color_type,boost::grid_graph_index_map<boost::grid_graph<2,unsigned int,unsigned int>,boost::array<unsigned int,2>,unsigned int> >,std::less<double>,boost::closed_plus<double>,double,double>(const boost::filtered_graph<boost::grid_graph<2,unsigned int,unsigned int>,boost::keep_all,boost::is_not_in_subset<boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > > > & g={...}, boost::array<unsigned int,2> s=0x002cf660, euclidean_heuristic h={...}, astar_goal_visitor vis={...}, boost::associative_property_map<boost::unordered_map<boost::array<unsigned int,2>,boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<std::pair<boost::array<unsigned int,2> const ,boost::array<unsigned int,2> > > > > predecessor={...}, boost::shared_array_property_map<double,boost::grid_graph_index_map<boost::grid_graph<2,unsigned int,unsigned int>,boost::array<unsigned int,2>,unsigned int> > cost={...}, boost::associative_property_map<boost::unordered_map<boost::array<unsigned int,2>,double,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<std::pair<boost::array<unsigned int,2> const ,double> > > > distance={...}, boost::static_property_map<double> weight={...}, boost::grid_graph_index_map<boost::grid_graph<2,unsigned int,unsigned int>,boost::array<unsigned int,2>,unsigned int> index_map={...}, boost::shared_array_property_map<enum boost::default_color_type,boost::grid_graph_index_map<boost::grid_graph<2,unsigned int,unsigned int>,boost::array<unsigned int,2>,unsigned int> > color={...}, std::less<double> compare=less, boost::closed_plus<double> combine={...}, double inf=1.7976931348623157e+308, double zero=0.00000000000000000) Line 287 + 0x10 bytes C++ astar_maze.exe!boost::astar_search<boost::filtered_graph<boost::grid_graph<2,unsigned int,unsigned int>,boost::keep_all,boost::is_not_in_subset<boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > > >,euclidean_heuristic,astar_goal_visitor,enum boost::graph_visitor_t,boost::bgl_named_params<boost::associative_property_map<boost::unordered_map<boost::array<unsigned int,2>,double,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<std::pair<boost::array<unsigned int,2> const ,double> > > >,enum boost::vertex_distance_t,boost::bgl_named_params<boost::associative_property_map<boost::unordered_map<boost::array<unsigned int,2>,boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<std::pair<boost::array<unsigned int,2> const ,boost::array<unsigned int,2> > > > >,enum boost::vertex_predecessor_t,boost::bgl_named_params<boost::static_property_map<double>,enum boost::edge_weight_t,boost::no_property> > > >(const boost::filtered_graph<boost::grid_graph<2,unsigned int,unsigned int>,boost::keep_all,boost::is_not_in_subset<boost::unordered_set<boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<boost::array<unsigned int,2> > > > > & g={...}, boost::array<unsigned int,2> s=0x002cf8e8, euclidean_heuristic h={...}, const boost::bgl_named_params<astar_goal_visitor,enum boost::graph_visitor_t,boost::bgl_named_params<boost::associative_property_map<boost::unordered_map<boost::array<unsigned int,2>,double,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<std::pair<boost::array<unsigned int,2> const ,double> > > >,enum boost::vertex_distance_t,boost::bgl_named_params<boost::associative_property_map<boost::unordered_map<boost::array<unsigned int,2>,boost::array<unsigned int,2>,vertex_hash,std::equal_to<boost::array<unsigned int,2> >,std::allocator<std::pair<boost::array<unsigned int,2> const ,boost::array<unsigned int,2> > > > >,enum boost::vertex_predecessor_t,boost::bgl_named_params<boost::static_property_map<double>,enum boost::edge_weight_t,boost::no_property> > > > & params={...}) Line 341 + 0x267 bytes C++ astar_maze.exe!maze::solve() Line 191 + 0xa2 bytes C++ astar_maze.exe!main(int argc=1, const char * * argv=0x00882610) Line 305 + 0xb bytes C++ astar_maze.exe!__tmainCRTStartup() Line 586 + 0x19 bytes C astar_maze.exe!mainCRTStartup() Line 403 C kernel32.dll!7593eccb() [Frames below may be incorrect and/or missing, no symbols loaded for kernel32.dll] ntdll.dll!7779d24d() ntdll.dll!7779d45f()

2 1

Parsing math expression
by Eloi Du Bois 30 Nov '10

30 Nov '10

Hi all, Is there a simple math expression parser in boost ? I only need to parse those kind of expression: "1+2/3". I have been thinking on boost::spirit, but it is quite hard for what I need. - Eloi.

3 8

Fwd: boost::interprocess_exception::library_error
by rohini chandra pallapothu 30 Nov '10

30 Nov '10

Hi, I forgot to mention that the exception was from the receive( ) method. Thanks & Regards, Rohini Chandra P ---------- Forwarded message ---------- From: rohini chandra pallapothu <rohinichandrap(a)gmail.com> Date: Mon, Nov 29, 2010 at 7:14 PM Subject: boost::interprocess_exception::library_error To: boost-users(a)lists.boost.org Hi, I am trying to use boost message queues for interprocess communincation between a command and a server. I had been receiving the below exception in the server. *boost::interprocess_exception::library_error* Below is the server code I had problems with. The exception was consistent when the maximum message size argument of the method was greater than the size of the data I was trying to send. I am trying to send an integer. When I assigned the max_msg_size variable a size greater than the size of int, it threw an exception. When I assigned the size of int, it is working fine. I got this working just before I was about to send this mail. But I want to understand the correct reason behind the exception. Is it not allowed to send a message which is less than the maximum message size because the name maximum message size itself says that it should only not exceed. I am working on a 64 bit SUSE 11. I am new to boost and Linux. I had even tried to change the /proc/sys/kernel/shmmax value after reading one of the discussion on the same exception in the BOOST archives which did not work. Could anyone please help. Please let me know if you need more information. *std::size_t max_msg_size=sizeof(int);* ============testsvc================= #include <boost/interprocess/sync/named_mutex.hpp> #include <boost/interprocess/ipc/message_queue.hpp> #include <iostream> using namespace std; using namespace boost::interprocess; int main(){ cout<<"in main"<<endl; cout<<"size of int is "<<sizeof(int)<<endl; //4 on my platform unsigned int priority; std::size_t recvd_size; std::size_t max_msg_size=sizeof(int); //not working when assigned a larger value than I was sending. std::size_t max_no_msgs=10; int i; message_queue::remove("TestQueue"); cout<<"message queue removed if any"<<endl; try{ //create a message queue. message_queue mq(create_only,"TestQueue",max_no_msgs,max_msg_size); cout<<"message queue created"<<endl; mq.receive(&i,sizeof(i),recvd_size,priority); } catch(interprocess_exception &ex){ std::cout <<ex.what() << std::endl; return 1; } cout<<"message received"<<endl; cout<<"message received is"<<i<<endl; return 0; } ==================== Thanks in advance. Best Regards, Rohini Chandra

1 0

[boost-users] [boost_thread] Condition
by Eloi Du Bois 30 Nov '10

30 Nov '10

Hi all, I would like to know how can I do the following: I have n working threads. Each one has a loop preceded by a wait condition (1). When the wait condition is unlocked, the thread takes a task on a queue, and process the task. I need to make something in the submit task function that wait until all processes are on the wait condition (1). How can I do that ? I tried a while(!_nWorking) {} but this is not clean. Here follows my threads function: void ProcessingThread::dispatcher( const int idx ) { using namespace boost; mutex::scoped_lock readyLocker( _dispatchMutex[idx] ); while( !_bDispStop ) { --_nWorking; // Wait for a task _condProcessIn[idx].wait( readyLocker ); ++_nWorking; while( !_bDispStop && !_pendingQueues[idx].empty() ) { _pendingQueuesMutex[idx].lock(); Task task = _pendingQueues[idx].front(); _pendingQueues[idx].pop_front(); _pendingQueuesMutex[idx].unlock(); // Process node assert( task._proc ); assert( task._procData ); task._proc->execute( task._range, *task._procData ); } } } Launched via: _nWorking = _nCpu; for( std::size_t i = 0; i < _nCpu; ++i ) { // Create dispatcher thread _dispThrdGroup.create_thread( boost::bind( &ProcessingThread::dispatcher, this, i ) ); } Submit task function: void ProcessingThread::submitProcess( ProcessLauncher * proc, const FrameRange & range, ProcessData & procData ) { // Get the index of the less used queue std::size_t idx = getLessUsedQueueIdx(); _pendingQueuesMutex[idx].lock(); // Append a task to the less used queue _pendingQueues[ idx ].push_back( Task( proc, range, procData ) ); // Signal that a task is ready _condProcessIn[idx].notify_one(); _pendingQueuesMutex[idx].unlock(); /// UGLY ! while( _nWorking ) { } } Thank you in advance, Eloi Du Bois.

2 3

Boost iostreams and ios_state
by Damien Kick 29 Nov '10

29 Nov '10

I'm trying to compile the following with VS 2005 and Boost 1.40.0 but it isn't compiling for me. Should it? Any suggestions for getting this to work? Here is the jist of what I'm trying to do: #include <boost/io/ios_state.hpp> #include <boost/iostreams/device/array.hpp> #include <boost/iostreams/stream.hpp> #include <boost/cstdint.hpp> #include <boost/scoped_array.hpp> int main() { typedef boost::iostreams::basic_array<boost::uint8_t> Uint8Array; typedef boost::iostreams::stream<Uint8Array> Stream; boost::scoped_array<boost::uint8_t> buffer(new boost::uint8_t[1]); Stream stream(buffer.get(), 1); boost::io::ios_all_saver ias(stream); } And here is the compilation error: error C2664: 'boost::io::basic_ios_all_saver<Ch>::basic_ios_all_saver (std::basic_ios<_Elem,_Traits> &)' : cannot convert parameter 1 from 'Stream' to 'std::basic_ios<_Elem,_Traits> &' with [ Ch=char, _Elem=char, _Traits=std::char_traits<char> ] and [ _Elem=char, _Traits=std::char_traits<char> ]

1 1

error when building boost 1.45
by Kenny Riddile 29 Nov '10

29 Nov '10

I am trying to build 1.45 with the following command on Win7 x64 with MSVC 9: bjam variant=release link=shared threading=multi runtime-link=shared --layout=tagged install and I get the following output: warning: No toolsets are configured. warning: Configuring default toolset "msvc". warning: If the default is wrong, your build may not work correctly. warning: Use the "toolset=xxxxx" option to override our guess. warning: For more configuration options, please consult warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\configure.jam:145: in builds-raw *** argument error * rule UPDATE_NOW ( targets * : log ? : ignore-minus-n ? ) * called with: ( <pbin.v2\libs\regex\build\msvc-9.0\debug>has_icu.exe <pbin.v2\libs\regex\build\msvc-9.0\debug>has_icu.pdb : : ignore-minus-n : ignore-minus-q ) * extra argument ignore-minus-q (builtin):see definition of rule 'UPDATE_NOW' being called C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\configure.jam:179: in configure.builds C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\configure.jam:216: in object(check-target-builds-worker)(a)385.check C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/kernel\modules.jam:103: in modules.call-in C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/util\indirect.jam:96: in indirect.call C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1012: in targets.evaluate-requirements C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1393: in basic-target.compute-usage-requirements C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\alias.jam:47: in compute-usage-requirements C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1319: in object(alias-target-class)(a)389.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:732: in generate-really C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:704: in object(main-target)(a)820.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:848: in targets.generate-from-reference C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1217: in generate-dependencies C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1268: in object(typed-target)(a)392.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:732: in generate-really C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:704: in object(main-target)(a)821.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:848: in targets.generate-from-reference C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1217: in generate-dependencies C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1266: in object(typed-target)(a)145.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:732: in generate-really C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:704: in object(main-target)(a)802.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:258: in object(project-target)(a)127.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:848: in targets.generate-from-reference C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1217: in generate-dependencies C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1268: in object(install-target-class)(a)50.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:732: in generate-really C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:704: in object(main-target)(a)610.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:848: in targets.generate-from-reference C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1217: in generate-dependencies C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1268: in object(alias-target-class)(a)44.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:732: in generate-really C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:704: in object(main-target)(a)609.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:848: in targets.generate-from-reference C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1217: in generate-dependencies C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1268: in object(alias-target-class)(a)43.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:732: in generate-really C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:704: in object(main-target)(a)608.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:848: in targets.generate-from-reference C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1217: in generate-dependencies C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1268: in object(alias-target-class)(a)60.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:732: in generate-really C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:704: in object(main-target)(a)614.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:848: in targets.generate-from-reference C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1217: in generate-dependencies C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:1268: in alias-target-class.generate Jamroot:648: in build-multiple Jamroot:612: in object(top-level-target)(a)66.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:732: in generate-really C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2/build\targets.jam:704: in object(main-target)(a)618.generate C:/Users/kriddile/Desktop/boost_1_45_0/boost_1_45_0/tools/build/v2\build-system.jam:735: in load C:\Users\kriddile\Desktop\boost_1_45_0\boost_1_45_0\tools\build\v2/kernel\modules.jam:283: in import C:\Users\kriddile\Desktop\boost_1_45_0\boost_1_45_0\tools\build\v2\kernel\bootstrap.jam:142: in boost-build C:\Users\kriddile\Desktop\boost_1_45_0\boost_1_45_0\boost-build.jam:17: in module scope

2 2

[log] When is it planned to enter Boost officially?
by Igor R 29 Nov '10

29 Nov '10

Hello, I intend to integrate Log library into my project, and I'm wondering whether it's about to enter the official Boost release. Or, at least, is its interface stable enough, so that if I integrate it now, I won't have to re-write everything, when the library finally enters Boost? Thanks.

1 0

[polygon] Compiling polygon under Windows
by Josh Pieper 29 Nov '10

29 Nov '10

Hello, I have been compiling boost::polygon under Windows (VS2008, MSVC9.0 specifically) and have run into a minor problem with boost::polygon's detection of Microsoft's compiler. Specifically, it tests for the WIN32 preprocessor define instead of _WIN32. WIN32 isn't actually defined by the compiler, but by windows.h, and not all translation units actually need to include that header. _WIN32 is defined by the compiler, and boost has the similar BOOST_MSVC preprocessor define which could also be used. While there is some disagreement among the existing boost libraries about the best mechanism to check this, some check _WIN32, some check BOOST_MSVC, and some check both or others at the same time. I propose the following patch to the 1.45.0 boost::polygon sources to make the detection of the MSVC compiler more robust. Regards, Josh Pieper Index: boost/polygon/gtl.hpp =================================================================== --- boost/polygon/gtl.hpp +++ boost/polygon/gtl.hpp @@ -12,7 +12,7 @@ #pragma warning (disable:1125) #endif -#ifdef WIN32 +#ifdef _WIN32 #pragma warning( disable: 4996 ) #pragma warning( disable: 4800 ) #endif Index: polygon/isotropy.hpp =================================================================== --- boost/polygon/isotropy.hpp +++ boost/polygon/isotropy.hpp @@ -48,7 +48,7 @@ #include <boost/mpl/or.hpp> #else -#ifdef WIN32 +#ifdef _WIN32 #define BOOST_POLYGON_MSVC #endif #ifdef __ICC @@ -290,7 +290,7 @@ template <typename T> struct gtl_if { -#ifdef WIN32 +#ifdef _WIN32 typedef gtl_no type; #endif };

4 4

[interprocess] file_mapping/mapped_region on empty file throws?
by Jeff Flinn 29 Nov '10

29 Nov '10

The following appears to throw an interprocess_exception with boost_1_44_0 compiled with MSVC8 running on windows XP. using namespace boost::interprocess; file_mapping fm("empty.txt", read_only); mapped_region mr( fm, read_only); Is there a reason I can't just get back a null address and zero size? I've wrapped this to get back a begin/end range and an empty range is a valid condition. Thanks, Jeff

2 2

[Units] Defining units with conversions local to class instances
by Andrew Hundt 29 Nov '10

29 Nov '10

I'm looking to define local units specific to each instance of a class. In this specific case I need to define a unit called "ticks" that is an angle defined relative to degree_base_unit and radian_base_unit. Local unit definitions are required because I am dealing with varying physical motors that measure their position in "ticks". The number of ticks per radian is arbitrarily defined by the manufacturer, so each class needs an independent "ticks" definition for that specific device loaded by a config file at runtime (so the user is not required to recompile every time they use a new motor). Some of the pieces I need look to be there within a combination of the examples: http://www.boost.org/doc/libs/1_45_0/libs/units/example/runtime_conversion_… - Defines a runtime conversion for global units defined to exist at compile time <http://www.boost.org/doc/libs/1_45_0/libs/units/example/runtime_conversion_…> http://www.boost.org/doc/libs/1_45_0/libs/units/example/radar_beam_height.c… - Defines a global unit defined at compile time <http://www.boost.org/doc/libs/1_45_0/libs/units/example/radar_beam_height.c…> http://www.boost.org/doc/libs/1_45_0/libs/units/example/runtime_unit.cpp - Only works for units defined at compile time The key problem here is that I need to define my units locally since they are irrelevant anywhere else while retaining the conversion and type safety of boost.units. It looks like the macros BOOST_UNITS_DEFINE_CONVERSION_FACTOR and BOOST_UNITS_DEFINE_CONVERSION_FACTOR_TEMPLATE both require definition in the global namespace. Any thoughts would be greatly appreciated. Cheers! Andrew Hundt

1 0

[Interprocess] Minimum allocation size for managed_shared_memorty
by Aditya Gadre 29 Nov '10

29 Nov '10

I have a question about Boost.Interprocess library. I am sharing a fixed size boost::interprocess::vector using managed_shared_memory. The vector length is 100 and the type of element in the vector is boost::array<float, 2>. That makes (vector::size)*sizeof(boost::array<float, 2> = 100*8 = 800. . If I create a managed_shared_memory segment with length 800 bytes and create a vector in that segment, then boost::interprocess::bad_alloc is thrown. If however I create a segment with a length of say 8000 and then create the vector, then everything works well. So my question is what is the minimum size required for a managed_shared_memory segment apart from what the size of a vector? Thanks, - Aditya

2 3

[Boost-users] [message_queue.hpp]boost::interprocess_exception::library_error
by rohini chandra pallapothu 29 Nov '10

29 Nov '10

Hi, I am trying to use boost message queues for interprocess communincation between a command and a server. I had been receiving the below exception in the server. boost::interprocess_exception::library_error Below is the server code I had problems with. The exception was consistent when the maximum message size argument passed to the constructor while creating a message queue was greater than the size of the data I was trying to receive.I am trying to receive an integer. When I assigned the max_msg_size variable a size greater than the size of int, it threw an exception. When I assigned the size of int, it is working fine. But I want to understand the correct reason behind the exception. Is it not allowed to receive a message which is less than the maximum message size because the name maximum message size itself says that it should only not exceed. I am working on a 64 bit SUSE 11. I had even tried to change the /proc/sys/kernel/shmmax value after reading one of the discussion on the same exception in the BOOST archives which did not work. Could anyone please help. Please let me know if you need more information. #include <boost/interprocess/sync/named_mutex.hpp> #include <boost/interprocess/ipc/message_queue.hpp> #include <iostream> using namespace std; using namespace boost::interprocess; int main(){ cout<<"in main"<<endl; cout<<"size of int is "<<sizeof(int)<<endl; //4 on my platform unsigned int priority; std::size_t recvd_size; std::size_t max_msg_size=sizeof(int); //not working when assigned a larger value than I was sending. std::size_t max_no_msgs=10; int i; message_queue::remove("TestQueue"); cout<<"message queue removed if any"<<endl; try{ //create a message queue. message_queue mq(create_only,"TestQueue",max_no_msgs,max_msg_size); cout<<"message queue created"<<endl; mq.receive(&i,sizeof(i),recvd_size,priority); } catch(interprocess_exception &ex){ std::cout <<ex.what() << std::endl; return 1; } cout<<"message received"<<endl; cout<<"message received is"<<i<<endl; return 0; } Thanks in advance. Best Regards, Rohini Chandra

1 0

Usage of Boost.Optional
by John Dlugosz 29 Nov '10

29 Nov '10

I have a situation where 'optional' is a good fit. However, I can't quite figure out how to use it for what I want. It appears to be geared around passing and returning instances, but I want to use it as a member. Consider: class C { D* d; // ... real code has much more stuff, naturally public: D(params) : d(0) { // ... if (I_ended_up_needing_d) d= new D (blahblah); // ... } ~D() { delete d; // harmless if zero } }; There is a single ownership of d by the instance, and it is not polymorphic but an exact type known at compile time. Making it a pointer adds overhead of using the heap, makes it harder to write EH-safe code for the constructor in more realistic situations, and requires adding explicit code to the destructor. Using a smart pointer only adds overhead, might take care of the EH and housekeeping, but still uses the heap. The 'optional' class provides for in-place storage, which it can use for an initialized instance, or it could be nil. That's exactly what I want. But, how do I tell optional<D> to construct at some point within the 'if' statement of my code? Assigning requires duplicating the object, and this type is not meant to be copied and has copy constructing and assignment disabled. Based on how the class works, I should be able to say "turn it on, now" and use an in-place factory. But the function to do that is not present in the class. class C { optional<D> d; public: D(params) : d(boost::none_t) { if (I_ended_up_needing_d) d.reset (in_place(blahblah)); } }; Am I missing something, or is the class missing something? I'm using Boost 1.43 in the project, and basing the above on the documentation for that version. The 'news' for 1.44 does not list Optional as having changed. Thanks, --John (sorry about the corporate footer) TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

6 11

[BGL] BFS < given distance.
by Adam Spargo 29 Nov '10

29 Nov '10

Hi, I have finally managed to implement my genome assembly algorithm! Except one part is too slow. I'm doing a breadth first search starting from each vertex i in an undirected graph, looking for its mate-pair (another given vertex j, of approximately known distance, where distance is the same as summed edge weight). Ideally I want to follow the BFS until either (i) I find the mate-pair vertex j (ii) I have visited all vertices up to some given distance away from the source vertex i. I want to bail out of the algorithm at the first occurrance of either (i) or (ii) and not carry on to search through the rest of the graph, which is very large. So I'm wondering if anybody has had a similar requirement and if they implemented a BFS visitor which accomplishes it? I have managed to limit it to the same connected component, but it still takes too long. The limiting distance is small and so I could just write something, but it would obviously be more elegant to use a BFS visitor. Thanks for any advice, Adam. -- Dr Adam Spargo High Performance Assembly Group email: aws(a)sanger.ac.uk Wellcome Trust Sanger Institute Tel: +44 (0)1223 834244 x7728 Hinxton, Cambridge CB10 1SA Fax: +44 (0)1223 494919 -- The Wellcome Trust Sanger Institute is operated by Genome Research Limited, a charity registered in England with number 1021457 and a company registered in England with number 2742969, whose registered office is 215 Euston Road, London, NW1 2BE.

2 4

thread group
by Lloyd Kanakkassery 29 Nov '10

29 Nov '10

Hi, I am creating "n" number of thread in a loop like this. for(int i=0;i<n;++i) { boost::shared_ptr<boost::thread> th(new boost::thread(boost::bind(&Enum::Execute,shared_from_this(),i,x))); } How can I join all these threads? The approach I used is given below... Before the loop I have created a thread_group object boost::thread_group tg; for(int i=0;i<n;++i) { boost::shared_ptr<boost::thread> th(new boost::thread(boost::bind(&Enum::Execute,shared_from_this(),i,x))); tg.add_thread(th.get()); } tg.join_all(); But the threads are not joined, it is exiting without completion. What could be the mistake I am doing? Thanks, Lloyd

3 2

[thread][repost] recursive shared mutex
by JOAQUIN M. LOPEZ MUÑOZ 29 Nov '10

29 Nov '10

[Trying my luck again with this query.] Hi, Boost.Threads provides a recursive mutex and a shared mutex, but no recursive *and* shared mutex. Would it be a good idea to add this to the library? How hard is it to construct a recursive shared mutex from boost::sahred_mutex (i.e. adding reentrancy to boost::shared_mutex)? Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

5 7

Visiting an element of fusion sequence, selected at run-time
by Max Motovilov 29 Nov '10

29 Nov '10

Here's a seemingly simple problem that I have spent most of my Thanksgiving weekend on, and still don't have enough to boast: Given: 1. A Boost.Fusion-compatible sequence; 2. An integral value i computed at runtime, known to be within 0..size(sequence); implement an algorithm applying some sort of a generic visitor to the i-th element of the sequence. However long I looked through the documentation, I didn't find a ready solution. Here's the best I was able to come up with on my own: ====================================================================== struct at_v { template<typename Seq, typename N> struct result : public fusion::result_of::at<Seq,N> {}; template<typename Seq, typename N> typename result<Seq,N>::type operator()( Seq& seq, N ) const { return fusion::at<N>( seq ); } }; template<typename F, typename Seq, typename IntV> void apply_at( F f, Seq& seq, IntV i ) { fusion::for_each( fusion::as_vector( mpl::range_c< IntV, 0, IntV( fusion::result_of::size<Seq>::type::value ) >() ), phoenix::if_( phoenix::arg_names::arg1 == i ) [ phoenix::function<F>( f )( phoenix::function<at_v>()( phoenix::ref( seq ), phoenix::arg_names::arg1 ) ) ] ); } ====================================================================== Drawbacks: 1. Requires a Boost.Phoenix-compliant visitor -- even though I managed to hide the Phoenix dependency inside apply_at(), it still requires a full-blown templatized result metafunction as part of the visitor even though the latter is not expected to return a value. Be nice to have simpler requirements for a visitor. 2. Can't figure out an easy way of returning a value from the visitor. I tried some constructs using fusion::fold() but only halfheartedly: the big problem is that there is no obvious way to specify that the visitor always returns results of the same type, no matter what argument type it is given. Note that the function calls the visitor only once, so, in principle, there should always be exactly one value to return (index out of bounds should naturally be a contract violation, which is not checked in my version). 3. The complexity is O( size(sequence) ) which is quite atrocious for random access (even though in practice it should not be much of a problem given that it simply means N integer comparisons with a relatively small N). Still, a O( log N ) or even a constant-time implementation should be quite possible... Even though the solution above should be sufficient for my purposes I'm still openly wondering whether I have overlooked something in the Boost libraries and/or whether someone more versed in Fusion/Phoenix/MPL might suggest a better approach. Thanks in advance for any responses, ...Max... PS. Without fusion::as_vector() around the index sequence constructor, GCC 4.4.3 complained of not being able to match operator(), suggestive of a forwarding function problem: looks like operator* on an iterator over mpl::range_c<> returns something that can't be digested by a Phoenix actor. I wonder if this should really be taken care of by the Fusion adapter for MPL sequences? PPS. Is there better documentation for Boost.Phoenix than what's at http://www.boost.org/doc/libs/1_45_0/libs/spirit/phoenix ? Not even a straightforward reference manual?

2 2

using boost serialization with uint64_t, stream error (vista 64bit)
by emeplease 29 Nov '10

29 Nov '10

Hi, I am having difficulties in using boost serialization under ** Windows Vista 64bit **. My boost libraries are built in 64bit. (I have attached the test program below) It seems that boost serialization is not able to serialize uint64_t with maximum value or anything larger then "14757395258967641292", as shown in main() " check_serialization( test64t, "boost::uint64_t" );" Also, If I use multiple inheritance, like below, "YYConfig" and " typedef YYConfig<FakeC, FakeB> MyConfig;" and trying to serialize "MyConfig" , stream error can occurr. Thank you very much for your help. Best Regards, Joseph Here is my output =========== uint32_t ================ succeeded =========== boost::uint64_t ================ failed Input : 18446744073709551615 Output : 14757395258967641292 The following will throw exception : stream error //serialize_and_deserialize( cfg ); Press any key to continue . . . Test Code ===================================================================================== #include<iostream> #include<boost/cstdint.hpp> #include<boost/archive/text_oarchive.hpp> #include<boost/archive/text_iarchive.hpp> #include<sstream> #include<cstdlib> using namespace std; template< class T1, class T2> struct YYConfig : public T1 , public T2 { public: friend class boost::serialization::access; template<class Archive> void serialize(Archive& ar, const unsigned int version) { ar& boost::serialization::base_object< T1> (*this); ar& boost::serialization::base_object< T2> (*this); } }; class FakeB { public: int x; FakeB(): x(0){} friend class boost::serialization::access; template<class Archive> void serialize(Archive& ar, const unsigned int version) { ar& x; } }; class FakeC { public: boost::uint64_t targetNumSamples; friend class boost::serialization::access; FakeC() : targetNumSamples( std::numeric_limits< boost::uint64_t>::max() ){} template<class Archive> void serialize(Archive& ar, const unsigned int version) { ar& targetNumSamples; } }; // ======================= Testing ================================/ template<typename T> T serialize_and_deserialize( T typeValue1 ) { T typeValue2; // Set std::string content; std::ostringstream oss; { boost::archive::text_oarchive oa(oss); oa<< typeValue1; content = oss.str(); } // Extract std::istringstream iss( content ); { boost::archive::text_iarchive ia( iss ); ia>> typeValue2; } return typeValue2; } template<typename T> bool check_serialization( T typeValue1, std::string testName ) { T typeValue2 = serialize_and_deserialize( typeValue1 ); std::cout<< std::endl<< "=========== "<< testName<< " ================"; if( typeValue1 == typeValue2 ){ std::cout<< std::endl<< "succeeded "; return true; } else{ std::cout<< std::endl<< "failed "; std::cout<< std::endl<< "Input : "<< typeValue1; std::cout<< std::endl<< "Output : "<< typeValue2; std::cout<< std::endl; return false; } } typedef YYConfig<FakeC, FakeB> MyConfig; int main(int argc, char** argv ) { boost::uint32_t test32t = std::numeric_limits< boost::uint32_t>::max(); boost::uint64_t test64t = std::numeric_limits< boost::uint64_t>::max(); check_serialization( test32t, "uint32_t" ); check_serialization( test64t, "boost::uint64_t" ); std::cout<< std::endl<< "The following will throw exception : stream error"<< std::endl ; system("pause"); MyConfig cfg; serialize_and_deserialize( cfg ); return 0; }

1 0