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

[boost::serialization]: Dies with access violation (segfaults) reading beyond the end of archive.
by Konstantin Andreev 18 Sep '06

18 Sep '06

When 1) trying to restore from archive the pointer to sample class, and 2) archive is over at this moment boost::serialization causes Access Violation Fault in file: basic_iarchive.cpp, line 470: bpis_ptr = co.bpis_ptr; The code to reproduce the fault follows. -- Konstantin Andreev. ------------------------( cut here )---------------------- #include <iostream> #include <sstream> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> class Sample { private: int pod_int; std::string pod_str; template<class Archive> void serialize(Archive & ar, const unsigned int ){ ar & pod_int & pod_str; }; friend class boost::serialization::access; friend std::ostream & operator<<(std::ostream & os, const Sample & sa ); public: Sample() {}; Sample( int _i, std::string _s ) : pod_int( _i), pod_str( _s ) {}; }; BOOST_CLASS_TRACKING(Sample, track_never) BOOST_CLASS_VERSION(Sample, 19) std::ostream & operator<<(std::ostream & os, const Sample & sa ) { return os << "-- int: " << sa.pod_int << ", str: >" << sa.pod_str << "< at 0x " << &sa << '\n'; } int main( void ) { Sample *obj_to = NULL; const Sample * const obj_fr = new Sample( 55, "**** test string *****" ); std::cout << *obj_fr; std::stringstream archbuf; boost::archive::text_oarchive *oa = new boost::archive::text_oarchive( archbuf, 3 ); *oa << obj_fr; std::cout << "-- archive content: >" << archbuf.str() << "<\n"; delete oa; boost::archive::text_iarchive *ia = new boost::archive::text_iarchive( archbuf, 3 ); *ia >> obj_to; std::cout << *obj_to; /////////////////////////////////// *ia >> obj_to; // ARCHIVE IS OVER. BOOM !!! /////////////////////////////////// std::cout << *obj_to; delete ia; return 0; }

2 2

[serialization] serialization of pointers to primitive types?
by Joaquín Mª López Muñoz 17 Sep '06

17 Sep '06

The following test program: #include <boost/archive/text_oarchive.hpp> #include <sstream> int main() { int x=0; int* const px=&x; std::ostringstream oss; boost::archive::text_oarchive oa(oss); oa<<px; return 0; } produces this error in MSVC++ 6.0: ...boost/serialization/access.hpp(109) : error C2228: left of '.serialize' must have class/struct/union type ...boost/serialization/serialization.hpp(81) : see reference to function template instantiation 'void __cdecl boost::serialization::access::serialize( class boost::archive::text_oarchive &,int &,const unsigned int)' being compiled and the following error in GCC 3.2: ...boost/serialization/access.hpp: In static member function `static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_oarchive, T = int]': ... ...boost/serialization/access.hpp:109: request for member `serialize' in `t', which is of non-aggregate type `int' I've checked the same snippet against Boost 1.33.1, CVS HEAD and RC_1_34_0, using other primitive types like std::string, same problem always. Same problem also for the loading counterpart. When the pointed-to type is not primitive, though, everything works fine, regardless of whether the type has intrusive or non intrusive serialization support. I am sure I'm doing something really stupid here, but I've been banging my head against this several hours. Some clue greatly appreciated. Thank you, Joaquín Mª López Muñoz Telefónica, Investigación y Desarrollo

3 4

[timer] Comments do not match the implementation?
by KSpam 17 Sep '06

17 Sep '06

I would like to use boost::timer to replace a timing object from another library. In looking into the header file, I noticed the following comments: // It is recommended that implementations measure wall clock rather than CPU // time since the intended use is performance measurement on systems where // total elapsed time is more important than just process or CPU time. All is well and good I thought to myself ... wall clock is exactly what I want! But alas, the implementation just wraps std::clock(). The man page for clock states the following: "The clock() function returns an approximation of processor time used by the program." In summary, the header states that the timer implementation should use wall clock time, but it ignores its own advice and uses processor time. I'm confused. Do I need to create my own timer implementation in order to use wall clock time? Thanks, Justin

2 2

Re: [Boost-users] Boost serialization : concurrency (was Possibleto append...)
by Robert Ramey 17 Sep '06

17 Sep '06

So now you know my intention - and I believe that the code reflects that. I'm guessing that the key might be that the DLL gets unloaded "too soon" so that we get a seg fault by invoking code that is no longer in memory. But as you have discovered - this is very problematic to track down and could be a subtle error of my own, an error in the language support system (loading/unloading DLLS). Overzealous optimization on the compiler's part or something else entirely. Sorry I can't be of more help. Good Luck Robert Ramey

1 0

[asio] Strange compilation error
by Christian Henning 17 Sep '06

17 Sep '06

Hi there I'm experiencing a strange compilation error that I cannot resolve myself. The following non-functionating triggers the error. I'm using VC2003 SP1. The error is due to the write() call. template <class T > void sent( const T& object ) { std::ostringstream archive_stream; boost::archive::binary_oarchive archive( archive_stream ); archive & object; std::string outbound_data = archive_stream.str(); // Format the header. std::ostringstream header_stream; header_stream << std::setw( 8 ) << std::hex << outbound_data.size(); std::string outbound_header = header_stream.str(); // Write the serialized data to the socket. We use "gather-write" to send // both the header and the data in a single write operation. std::vector<boost::asio::const_buffer> buffers; buffers.push_back(boost::asio::buffer(outbound_header)); buffers.push_back(boost::asio::buffer(outbound_data)); boost::asio::write( socket, buffers ); } This is the verbose error message: ..\..\..\External\Includes\Boost\asio\impl\write.ipp(40) : error C2825: 'Sync_Write_Stream::error_type': cannot form a qualified name ..\..\..\External\Includes\Boost\asio\impl\write.ipp(58) : see reference to function template instantiation 'size_t boost::asio::write<Sync_Write_Stream,Const_Buffers,boost::asio::detail::transfer_all_t,boost::asio::detail::throw_error_t>(Sync_Write_Stream (__stdcall &),const Const_Buffers &,Completion_Condition,Error_Handler)' being compiled with [ Sync_Write_Stream=SOCKET (int,int,int), Const_Buffers=std::vector<boost::asio::const_buffer>, Completion_Condition=boost::asio::detail::transfer_all_t, Error_Handler=boost::asio::detail::throw_error_t ] SendImages.cpp(75) : see reference to function template instantiation 'size_t boost::asio::write<SOCKET(int,int,int),std::vector<_Ty>>(Sync_Write_Stream (__stdcall &),const Const_Buffers &)' being compiled with [ _Ty=boost::asio::const_buffer, Sync_Write_Stream=SOCKET (int,int,int), Const_Buffers=std::vector<boost::asio::const_buffer> ] ..\..\..\External\Includes\Boost\asio\impl\write.ipp(40) : error C2039: 'error_type' : is not a member of 'operator``global namespace''' ..\..\..\External\Includes\Boost\asio\impl\write.ipp(40) : error C2146: syntax error : missing ';' before identifier 'e' ..\..\..\External\Includes\Boost\asio\impl\write.ipp(40) : error C2065: 'e' : undeclared identifier ..\..\..\External\Includes\Boost\asio\impl\write.ipp(41) : error C2228: left of '.write_some' must have class/struct/union type type is '__w64 unsigned int (__stdcall &)(int,int,int)' ..\..\..\External\Includes\Boost\asio\impl\write.ipp(41) : error C3861: 'e': identifier not found, even with argument-dependent lookup ..\..\..\External\Includes\Boost\asio\impl\write.ipp(44) : error C3861: 'e': identifier not found, even with argument-dependent lookup ..\..\..\External\Includes\Boost\asio\impl\write.ipp(46) : error C3861: 'e': identifier not found, even with argument-dependent lookup ..\..\..\External\Includes\Boost\asio\impl\write.ipp(50) : error C2825: 'Sync_Write_Stream::error_type': cannot form a qualified name ..\..\..\External\Includes\Boost\asio\impl\write.ipp(50) : error C2039: 'error_type' : is not a member of 'operator``global namespace''' ..\..\..\External\Includes\Boost\asio\impl\write.ipp(50) : error C2146: syntax error : missing ';' before identifier 'e' ..\..\..\External\Includes\Boost\asio\impl\write.ipp(50) : error C3861: 'e': identifier not found, even with argument-dependent lookup ..\..\..\External\Includes\Boost\asio\impl\write.ipp(51) : error C3861: 'e': identifier not found, even with argument-dependent lookup Thanks ahead, Christian

2 2

Need help with boost and dev-c++
by Craig Ritzdorf 17 Sep '06

17 Sep '06

I'm having a problem using any part of boost in dev-c++. The compiler itself seems to handle the code fine but when it trys to link i get the error: [Linker error] undefined reference to 'boost::filesystem::path::path(char const*)' I looked through the archive and found someone else (Chun Ping Wang) with this same problem but it was never answered. Thanks Craig

2 1

[function_types][review schedule] new version released
by Tobias Schwinger 17 Sep '06

17 Sep '06

Dear Boost community, a new version of the FunctionTypes candidate library has been uploaded to the vault: http://tinyurl.com/qaf5f What's new (compared to the last "official" version, not the preview)? ====================================================================== - The interface, - the documentation, - the test-suite, - carefully picked and inline-documented source code examples, - the code generator for preprocessed files is entirely written on top of Wave, - the preprocessed files and the configuration (up to a certain extent) are compiler-agnostic, - the preprocessed files do not have to be regenerated for custom configurations, unless for optimization (and changing the library code, of course), and - the library is default calling convention-agnostic, OIW the default calling convention can be changed and detected without changing the library's configuration (unless for MSVC<8 due to the lack of a 'thiscall' keyword) Unless there are any objections from the review manager regarding the fitness of the submission, we can put the library back on the review schedule -- my apologies for it took so long, BTW. Regards, Tobias

1 0

Boost-Install on Mac OS X
by Chris M 17 Sep '06

17 Sep '06

Hi I'm trying to build boost on Mac OS X 10.4.7. I had some Python issues and jam complained about Boost.Python so I downloaded and installed Python 2.4. Still though, that didn't fix it. I tried a half-hearted attempt at creating some symbolic links but decided there must be a "right" way to install boost on the latest mac OS X and was wondering if anyone here can point me toward a writeup of the process. Thanks, Chris

2 1

Properties (newbie)
by Olivier Tournaire 17 Sep '06

17 Sep '06

I have already post this email, but I cannot see it on the list. So, I post it again ... Sorry ... Hi all, I am a new boost user (2 days old ...). I just want to know a few things. 1. I use an adjacency_list with my own properties to store my graph. I just want to know if it is possible to manipulate directly the properties' values. At the moment, I use get(...) to obtain the property, make my change, and use put(...) to set the new value. 2. My graph cannot contain parallel edges, so I use a setS. However, the documentation says that listS or vecS is more efficient in time and space complexity. Is it possible to use std::vector or std::list and to disallow parallele edges ? Thanks in advance Olivier --------------------------------- Découvrez un nouveau moyen de poser toutes vos questions quelque soit le sujet ! Yahoo! Questions/Réponses pour partager vos connaissances, vos opinions et vos expériences. Cliquez ici.

3 2

Re: [Boost-users] [serialization] Purpose of load_construct_data (was: Re: Library Interface Design)
by JOAQUIN LOPEZ MU?Z 16 Sep '06

16 Sep '06

Hello again, lots of talking to each other today :) ----- Mensaje original ----- De: Robert Ramey <ramey(a)rrsd.com> Fecha: Sábado, Septiembre 16, 2006 8:03 pm Asunto: Re: [Boost-users] [serialization] Purpose of load_construct_data (was: Re: Library Interface Design) > JOAQUIN LOPEZ MU?Z wrote: [...] > > http://boost.org/libs/serialization/doc/ > > serialization.html#constructors > > where my_class serializes my_class::m *both* at > > my_class::serialize *and* my_class::(load|save)_construct_data. > > If the analysis I develop in my previous post is correct > > (is it?) this leads to my_class::m being serialized *twice* > > when a pointer to my_class is saved. Maybe it would sufice > > to rewrite this part of the documentation with a more > > sensible example like the one at test_non_default_ctor.cpp. > > What do you think? > > I agree. The fact that the example uses a member variable confuses > the issue. I'll amend the documentation accordingly. Thank you! > However, the current example does illustrate a case where it > seems impossible to avoid serializing a member twice. One > could leave it in the load_construct_data, and eliminate it from > the serialization code - but then this would work only if the > object was serialized via a pointer. If it were my program I would > say hmmmm - I'm really confusing the role of the variable m - If > its to be initialzed at construction - it shouldn't be messed with > by serialization or operator= etc. If its realy part of the objects > dynamic state - then it shouldn't be required at construction time. Well, I think the apparent puzzle stems from the incorrect assumption (IMHO) that a given member must be either part of the construction info or dynamic state --in many cases, it can be *both*, which is precisely what happens with my_class. I'd appreciate if you can consider this extension proposal that would allow for one-phase serialization while keeping the statu quo --maybe we can have our cake and eat it too :) Augment the serialization interface with a pair of new user-overridable function like this: template<typename Archive, class T> inline void construct_from_archive( Archive & ar, T * t, const unsigned int file_version) { // default implementation load_construct_data(ar,t,file_version); ar>>*t; } template<typename Archive, class T> inline void construct_to_archive( // OK, the name is ugly Archive & ar, const T * t, const unsigned int file_version) { // default implementation save_construct_data(ar,t,file_version); ar<<*t; } and use it when serializating T through a pointer. Now, if we return to the case of my_class, where my_class::m is both used at construction them and serialized as part of my_class::serialize, we can handle all situations as follows: // as in your example template<class Archive> inline void save_construct_data( Archive & ar, const my_class * t, const unsigned int) { ar << t->member; } // as in your example template<class Archive> inline void load_construct_data ( Archive & ar, my_class * t, const unsigned int) { int m; ar >> m; ::new(t)my_class(m); } // this is new template<class Archive> inline void construct_to_archive( Archive & ar, const my_class * t, const unsigned int fv) { save_construct_data(ar,t,fv); // avoid m being saved twice } // this is new template<class Archive> inline void construct_from_archive( Archive & ar, my_class * t, const unsigned int fv) { load_construct_data(ar,t,fv); // avoid m being loaded twice } My proposal basically amounts to adding a new customization point to the existing protocol for serialization of pointers. It has the following advantages: * You don't break anything (it's a pure extension). * It addresses a concern (one-phase serialization) that is conceptually different to the concerned addressed by (load|save)_construct_data (serializing non default- constructible objects), and does it so in an orthogonal manner. * It lets you solve the problem of members being both part of construction info and dynamic state, as I've (hopefully) just shown . How do you like this? > Anyway, I'll alter my example to make the variable in question > "const" and remove it from serialization which is a better > of example of the real cases where this can come up. > > Robert Ramey Best, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

Re: [Boost-users] [serialization] serialization of pointers toprimitive types?
by JOAQUIN LOPEZ MU?Z 16 Sep '06

16 Sep '06

----- Mensaje original ----- De: Robert Ramey <ramey(a)rrsd.com> Fecha: Sábado, Septiembre 16, 2006 7:50 pm Asunto: Re: [Boost-users] [serialization] serialization of pointers toprimitive types? > JOAQUIN LOPEZ MU?Z wrote: [...] > > Wouldn't it be an option that pointers to > > primitive types will be handled as non-tracked? What would be > > the overhead of that option? In case this is an option, please > > consider my vote for inclusion as a new feature in Boost 1.35. > > OK - that would work fine - but I also believe it would trip the > infamous "const trap" so that might have to be considered. Umm... Well, at first blush, seems like serializating a pointer to a primitive type is no different than serializing a pointer to a non-primitive type --the same const issues, controversial as they might be, are already present. Besides, this new feature would be a pure extension, in the sense that code that didn't compile before would do now, so, you're positively not breaking anything. [...] > So - although the problem never comes up for me I concede your > point. I have erroneously confused the identity of two concepts - > serialization and tracking. From that standpoint I'm inclined > to make the change you suggest. The only concern is that it would > breakone of the user traps that inhibits certain user behavior > because it will almost surely lead to intractible problems. Again, I don't see how ensuring that the const rule works also for primitive types is any harder than the current implementation, which only applies to non-primitive type --seems like all you've got to do is to extend the enforcement in a straightforward manner. But then again, you're the implementor and surely can see internal difficulties I'm not aware of. > Dealing with the trap is a pain - but its much less painful than > dealing with user's who have done something that is permitted and > seems natural to do end up having archives that cannot be read or > recovered. I believe that serializing someting like > std::set<int *> will eventually lead to such problems eventually > in most cases. > > To summarize, you're correct. But I'm concerned that just > "fixing" the code will create new set of problems. Thanks for addressing my concern! Well, if you're doing the change for Boost 1.35 we'll surely have plenty of time to detect any potential problems that might arise. > Robert Ramey Best regards, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

Re: [Boost-users] Comments / Advice on using Boost Test Library
by Sohail Somani 16 Sep '06

16 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Matt Schuckmann > > What I'd like to ask the Boost community about is this: how to go > > about unit testing private class methods. Hi, Rather than change the interface of my classes to use friend classes (I feel this unnecessarily clutters the interface), I do something simple and evil: #define private public #define protected public # include "MyClass.hpp" #undef private #undef protected Or something along those lines. This is permissable in unit tests, I would think. Sohail

4 4

Re: [Boost-users] [serialization] serialization of pointers to primitive types?
by JOAQUIN LOPEZ MU?Z 16 Sep '06

16 Sep '06

Hello Robert, ----- Mensaje original ----- De: Robert Ramey <ramey(a)rrsd.com> Fecha: Sábado, Septiembre 16, 2006 8:01 am Asunto: Re: [Boost-users] [serialization] serialization of pointers to primitive types? > Serialization of pointers to primitive data types is prohibited. > I'm pretty sure this is mentioned in the documentation. ( don't > have the exact reference handy) I've persued the docs and in every place where this is referred to, the statement is that primitive types are not tracked, which is IMHO different than serialization of pointers to primitive types being forbidden. Examples: - Serializable concept: "A type T is Serializable if and only if one of the following is true: * it is a primitive type. [...] * it is a pointer to a Serializable type.[...]" from which it can be deduced that a pointer to a primitive type is serializable. - Object tracking: "Default tracking traits are: * For primitive, track_never.[...]" At the risk of repeating myself, I understand what serializing a pointer to a non-tracked type involves. This is not the same as not being able to serialize the pointer in the first place, which is what happens with primitive types, to my dismay. > - and it has been noted a couple of times. The reason is that > doing this would result in ALL usages of that type being tracked > - which is probably a heck of a lot more than the user had in mind. I'm not talking about primitive types being tracked, which I agree with you implies an unacceptable burden, but about the mere possibility of serialization of a pointer to a primitive type. Wouldn't it be an option that pointers to primitive types will be handled as non-tracked? What would be the overhead of that option? In case this is an option, please consider my vote for inclusion as a new feature in Boost 1.35. > > The way to serialize pointer to primitives > (serialization_level::prmitive) is to use BOOST_STRONG_TYPEDEF to > define a new type and specify serialization function for it. This > won't work for std::string so you'll have to make a trivial > derivation of std::string if you want to serialize a pointer to a > std::string. The problem with that is that it is an intrusive solution that complicates things when dealing with generic code. Sometimes, it can be just impossible to do that intrusive change or require the user to do it. From this restriction, for instance, we have that std::set<int*> is not serializable as is. Telling the user to change her definition to something like std::set<BOOST_STRONG_TYPEDEF(...)*> just for the sake of serializability could be unacceptable in some (many?) situations. > Robert Ramey Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Writing a more readable code
by Alexander Shyrokov 16 Sep '06

16 Sep '06

How can make the following code inside of for_each more readable? void f(char*); typedef std::map<int,char> TMap; TMap a; std::for_each(a.begin(),a.end(),boost::bind(f,boost::bind(&TMap::value_type::second,_1))); Is it possible to convert boost::bind(&TMap::value_type::second,_1) to a function object or a typedef name? -- Regards, Alexander. http://sjcomp.com

4 5

Re: [Boost-users] [boost::serialization] Convert enumeration tostringand back again
by Nat Goodspeed 16 Sep '06

16 Sep '06

> ________________________________________ > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Robert Ramey > Sent: Saturday, September 16, 2006 2:27 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [boost::serialization] Convert enumeration tostringand back again > > class param_choice { > enum > { > PARAM_CHOICE_UINT8, > PARAM_CHOICE_UINT16, > PARAM_CHOICE_UINT32, > PARAM_CHOICE_INT8, > PARAM_CHOICE_BOOL > } m_current_value; > template<class Archive> > save(Archive &ar, unsigned int version) { > std::string svalue; > switch(m_current_value){ [Nat] If I were going to do this "by hand," I'd at least want to construct a map. From that I'd populate another for the reverse lookup. But that's probably because I haven't yet read up on Boost.MultiIndex. > case PARAM_CHOICE_UINT8: > svalue = "PARAM_CHOICE_UINT8"; > ... > } > ar << BOOST_SERIALIZATION_NVP(svalue); > } > template<class Archive> > load(Archive &ar, unsigned int version){ > std::string svalue; > ar >> BOOST_SERIALIZATION_NVP(svalue); > if(svalue == std::string("PARAM_CHOICE_UINT8") > m_current_value = PARAM_CHOICE_UINT8; > else > if(... > ... > } > };

1 0

Re: [Boost-users] Library Interface Design
by Nat Goodspeed 16 Sep '06

16 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Scott Meyers > Sent: Tuesday, September 12, 2006 1:09 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Library Interface Design > > I've always been a big fan of the "don't let users create objects they > can't really use" philosophy. So, in general, I don't like the idea of > "empty" objects or two-phase construction. It's too easy for people to > make mistakes. [Nat] I try to design for single-phase construction myself. The aberrant use case that I've bumped into is deserialization. Intrusive serialization can preserve single-phase construction -- but what if the class designer didn't anticipate the need to serialize? I haven't yet worked with a serialization framework smart enough to consider constructor arguments. (I haven't yet worked with the Boost Serialization library, either; forgive me if this is already a solved problem.)

8 16

Re: [Boost-users] Boost serialization : Possible to append to file?
by Robert Ramey 16 Sep '06

16 Sep '06

Daniel F. Savarese wrote: > In message <20060911172413.74527.qmail(a)web57207.mail.re3.yahoo.com>, > smith smit hson writes: >> This is regarding the boost serialization library. Is >> it possible to append to a pre-existing archive file? > > I don't think anyone's answered this yet. The answer is yes. Hmmm - that would surprise me. > > While on the topic of boost serialization, I'll add an unrelated note > that you cannot safely serialize objects from different threads when > using separate archive instances in each thread. Boost serialization > uses local static variables in places like > boost:archive::detail::oserializer::instantiate(), so even though > you're > using separate archive instances, there's only a single serializer for > a given archive type/object type pair. True - but this should be no problem since the the static object never changes. That is all the functions on this static object ar "const" so they should be re-entrant. Therefore, if you concurrently > serialize the same type of object with separate instances of the same > archive type, you can segfault. I don't see this. > The solution of course is to use > critical sections or delegate all serialization to a single thread. > But you wouldn't expect to have to do so when using separate > instances because the global behavior is not obvious to the API user. I don't think this should be necessary. If it is, then it is contraty to my intentation. Robert Ramey

1 0

[boost::serialization] Convert enumeration to string and back again
by Graham Hudspith 16 Sep '06

16 Sep '06

Another "basic" question for the list again, apologies in advance. I have a class with a data member which is an enumeration, e.g.: typedef enum param_choice { PARAM_CHOICE_UINT8, PARAM_CHOICE_UINT16, PARAM_CHOICE_UINT32, PARAM_CHOICE_INT8, PARAM_CHOICE_BOOL } param_choice_e; I can quite happily user the Boost Serialization library to save and restore a class with a data member of this type: class Stuff { friend std::ostream& operator<<(std::ostream& os, const Stuff& stuff friend class boost::serialization::access; template<class Archive> void serialize(Archive& ar, const unsigned int file_version) { ar & BOOST_SERIALIZATION_NVP(choice); } param_choice choice; public: Stuff () {} Stuff (param_choice theChoice); }; This is using XML as the file-format. The data member appears in the file as an integer. However, what I would LIKE to do is output the value of "choice" as a string (e.g. instead of outputing <choice>2</choice>, the file contains <choice>UINT32</choice>). And do a conversion when I read it all back in again, of course. Can someone please provide some pointers to where I can find out how to do this? Or an example? Is the solution going to end up along the lines of: * Split the serialize into separate load and save routines * In the save, convert the data member into a string and output this to the archive * In the load, input from the archive into a string and then store this into the data member Best regards in anticipation, Graham.

2 1

Boost serialization : Possible to append to file?
by smith smithson 16 Sep '06

16 Sep '06

Hello, This is regarding the boost serialization library. Is it possible to append to a pre-existing archive file? i.e. Create an archive file, serialize objects to it, close file, and then re-open file and append more serialized objects to it. Is this allowed? -Thanks! __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

unordered map base on how items are inserted.
by chun ping wang 16 Sep '06

16 Sep '06

I have a question on unordered_map. Are there are any boost library containers that acts like an associative array but also have the items base on how the order their inserted in. I.E. first item inserted is first one, second one is second. Thanks.

2 1

program_options : Executing methods required for options_description before methods for command line options.
by Booster Booster 15 Sep '06

15 Sep '06

Hi, I have a list of options that I want to store before parsing the command line option. For example, po::options_description desc; // This has a couple of options. boost::program_options::variable_map options; po::store(po::command_line_parser(command_args).options(desc).run(), options); The problem is I want to execute the methods that correspond to 'desc' before the methods required by 'command_args' . Is there a way to populate the variable_map in a way such that I get the required sequence ? I did some reading of the docs, but couldn't find a way to do it. Any help would be appreciated. Thanks in advance, Sandy.

1 1

calling a member function of a map iterator
by Alexander Shyrokov 15 Sep '06

15 Sep '06

I have a map<int,c*> and I would like to call a member function of the c* and provide a parameter to it. struct c{void f(char*){}}; typedef std::map<int,c*> TMap; TMap a; std::for_each(a.begin(),a.end(),boost::bind(&c::f,boost::bind(&TMap::value_type::second,_1)),NULL); I get "error C2091: function returns function" This is what I would like to replace with the for_each algorithm: for(TMap::iterator i=a.begin();i!=a.end();++i)(*i)->f(NULL); Thanks. -- Regards, Alexander. http://sjcomp.com

2 5

Re: [Boost-users] Comments / Advice on using Boost Test Library
by Sohail Somani 15 Sep '06

15 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Dave Steffen > > I just wonder: whats the big deal with breaking all the > encapsulation > > rules to do unit tests? > > Do you mean: > "why are people breaking encapsulation rules for unit tests?" > or > "why do people worry about breaking encapsulation rules > for unit tests?" Second one. I was worried for a second there that there was something I hadn't thought about :) Thanks.

1 0

Re: [Boost-users] Comments / Advice on using Boost Test Library
by Sohail Somani 15 Sep '06

15 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Aubrey, Jason > Note1: I've no idea if a formal name for this pattern exists, > if not it > does now :) > Note2: I recognize the security issues with this; however, if > it's truly > an issue I suppose the pImpl (i.e. pointer to implementation) > idiom can > be used in tandom so things are truly private from the client. I just wonder: whats the big deal with breaking all the encapsulation rules to do unit tests?

2 1

bind, and member function with a parameter
by Alexander Shyrokov 15 Sep '06

15 Sep '06

I want to call a member function with a parameter from within an algorithm. http://boost.org/libs/bind/bind.html#with_algorithms gives an example: void animation::advance(int ms); std::vector<animation> anims; std::for_each(anims.begin(), anims.end(), boost::bind(&animation::advance, _1, ms)); I am using boost::lambda:: before _1. I get an error error C2825: 'F::result_type': cannot form a qualified name I am using MS VC7.1 and boost_1_33_1 Any ideas why this does not work? Thanks.

5 13

Comments / Advice on using Boost Test Library
by Dave Steffen 15 Sep '06

15 Sep '06

Hi Folks, We've been happy Boost Test Library customers for over a year now, slowly building up a set of unit tests for a large legacy code base. There's no question that it's Good Stuff. Specifically, everything we do is some variation on a BOOST_AUTO_UNIT_TEST-y sort of thing; the extremely low amount of "typing overhead" is a big part of why so many people are writing unit tests (these unit tests are cheap, as unit tests should be). What I'd like to ask the Boost community about is this: how to go about unit testing private class methods. One answer is "don't; only unit test the public interface", which is fine as far as it goes. However, most of our work is extremely mathematical, so it's not uncommon to see something like class Base { ... public interface, etc ...}; class Derived : public Base { public: ... goodies in here ... private: double HelperFn1(); bool HelperFn2(int, double, KalmanFilter&); }; where HelperFn1 and HelperFn2 are extremely non-trivial mathematical operations. Yes, exercising the public interface will signal mistakes in the helper functions, but can't do much to poke at them in depth, or help pinpoint exactly what chunk of math isn't right. What we want is to be able to write unit tests that poke and prod such private member functions directly. Another answer is "give your class a friend "tester" class, that uses its frienship to give the unit tests access to the class' guts". We've been doing that for about a year now; not the most elegant, but an effective solution. Unfortunately, it doesn't work for the thing I wrote this afternoon; I'll skip the details. Another horrible, but effective, possibility is to #define private public #include "ClassToTest.h" ... (only in the unit test suites!) and muck about in the class's guts directly. This is the only way I know of to get into the rather complicated template-class-heirarchy-interface-wrapper thing that I just built. What kinds of techniques are you all using out there? Thanks very much for any comments! ---------------------------------------------------------------------- Dave Steffen, Ph.D. Software Engineer IV Disobey this command! Numerica Corporation ph (970) 419-8343 x27 fax (970) 223-6797 - Douglas Hofstadter dgsteffen(a)numerica.us

5 4

Re: [Boost-users] Writing a more readable code
by Nat Goodspeed 15 Sep '06

15 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of me22 > Sent: Friday, September 15, 2006 2:55 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Writing a more readable code > > use an iterator adapter that returns base_itr->second when > dereferenced. I hear that it's simple to make one with > Boost.Iterator. > > You'd then just do > std::for_each( seconder(a.begin()), seconder(a.end()), boost::bind(f,_1) > ); [Nat] The need to adapt each of a.begin() and a.end() bothers me. (I've dealt with similar but more complex situations.) Is there a nice way to combine Boost.Iterator adaptors with Boost.Range to express this less redundantly?

1 0

Re: [Boost-users] Comments / Advice on using Boost Test Library
by Sohail Somani 15 Sep '06

15 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Dave Steffen > > This is permissable in unit tests, I would think. > > Yes, this is one of the alternate approaches I've been considering. > We've got the "Bad" and the "Ugly". I'm still hoping the "Good" is > out there somewhere... :-) I'm pretty sure those are the only approaches, but I'd be glad to find a more obvious way that isn't intrusive.

1 0

Re: [Boost-users] [serialization] serialization of pointers toprimitive types?
by JOAQUIN LOPEZ MU?Z 15 Sep '06

15 Sep '06

Hi Volodya ----- Mensaje original ----- De: Vladimir Prus <ghost(a)cs.msu.su> Fecha: Viernes, Septiembre 15, 2006 6:19 pm Asunto: Re: [Boost-users] [serialization] serialization of pointers toprimitive types? > Joaquín Mª López Muñoz wrote: > > > The following test program: > > > > #include <boost/archive/text_oarchive.hpp> > > #include <sstream> > > > > int main() > > { > > int x=0; > > int* const px=&x; > > std::ostringstream oss; > > boost::archive::text_oarchive oa(oss); > > oa<<px; > > > > return 0; > > } > .... > > I've checked the same snippet against Boost 1.33.1, CVS HEAD and > > RC_1_34_0, using other primitive types like std::string, same > > problem always. Same problem also for the loading counterpart. > > When the pointed-to type is not primitive, though, everything > > works fine, regardless of whether the type has intrusive or non > > intrusive serialization support. > > > > I am sure I'm doing something really stupid here, but I've been > > banging my head against this several hours. Some clue greatly > > appreciated. > > This never worked, I think. The problem is that if you're saving > pointers,you need to check if you've already saved that pointer, > so that on loading, > you don't get two pointers to to ints, as opposed to two pointers > to a > single int, as it should be. > > This "tracking" requires runtime map, and I believe Robert decided > thatmaintaining such map for primitive type can be too expensive. > I'm not sure > how valid that point it, not how many hidden stones there are in > enablingprimitive types to be tracked. I know primitive types are not tracked, but I take that to mean that multiple pointers to the same object will result in duplicated copies in the archive, *not* that serializing a pointer will result in a compile error. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[shmem] leaving shared objects in memory
by Pataki Szilard 15 Sep '06

15 Sep '06

Hello! Can anybody tell me how can I make the shared memory segment (together with the objects constructed in it) remain in memory AFTER the process which created it terminates? E.g. Proc1 creates the segment and the objects in it. Proc2 accesses the segment and operates on the shared objects. Proc1 might get killed and I don't want this event to affect in any way Proc2. Thanks and regards, Szilard

2 1

shared_ptr without rtti
by Michael Marcin 15 Sep '06

15 Sep '06

Using WinARM version 20060606 (gcc 4.1.1) compiling with -fno-rtti gives: 1>..\..\sdk\boost\inc/boost/detail/sp_counted_impl.hpp: In member function 'virtual void* boost::detail::sp_counted_impl_pd<P, D>::get_deleter(const std::type_info&)': 1>..\..\sdk\boost\inc/boost/detail/sp_counted_impl.hpp(150): error: cannot use typeid with -fno-rtti 1>..\..\sdk\boost\inc/boost/detail/sp_counted_impl.hpp: In member function 'virtual void* boost::detail::sp_counted_impl_pda<P, D, A>::get_deleter(const std::type_info&)': 1>..\..\sdk\boost\inc/boost/detail/sp_counted_impl.hpp(220): error: cannot use typeid with -fno-rtti 1>..\..\sdk\boost\inc/boost/shared_ptr.hpp: In function 'D* boost::get_deleter(const boost::shared_ptr<U>&)': 1>..\..\sdk\boost\inc/boost/shared_ptr.hpp(540): error: cannot use typeid with -fno-rtti I thought typeid can work at compile-time without rtti (seems to for msvc8) but I guess not. Any ideas? -- Michael Marcin Method Solutions, Programmer

2 4

boost.crc
by renjh 15 Sep '06

15 Sep '06

My truncated polynominal has 83 bits, does boost.crc support it? I hope to get an example for that.

1 0

Boost::signals MT question
by Mark Wilson 14 Sep '06

14 Sep '06

Does the fact that bjam builds a "*-mt*" version of signals indicate that signals is now thread-safe? If it isn't, why is the "*-mt*" version built? Thanks, Mark

2 1

best of both worlds: ptr_vector and multi_array
by Levent Yilmaz 14 Sep '06

14 Sep '06

This question is perhaps, rather a feature request from multi_array: ptr_vector (of pointer container library) is nice but it is not multi dimensional, multi_array is nice but it is not, well, ptr_multi_array. For any single dimensional random access array there is multi_array_ref: /**/ boost::array<size_t,2> shape = {4,4}; std::vector<int> v(16); boost::multi_array_ref<int,2> mav(&v[0],shape); /**/ But, this (&v[0]) wouldn't work with ptr_vector, due to the indirected interface of pointer containers. I was thinking, one way of achieving this is to have multi_array_ref work with any random access container, rather than just plain C array. The above example would be: /**/ boost::array<size_t,2> shape = {4,4}; std::vector<int> v(16); boost::multi_array_ref< std::vector<int>, 2 > mav(v,shape); /**/ Note the change of the first template parameter of multi_array_ref from the element type to, container type. This way, it would similarly be possible to use it with ptr_vector, or any other random access container for that matter: /**/ class foo; boost::array<size_t,2> shape = {4,4}; boost::ptr_vector<foo> v(16); boost::multi_array_ref< boost::ptr_vector<foo>, 2 > mav(v,shape); /**/ The thing is, I am not sure if this can be done with the multi_array library. Or, what other ways are there to get a multi dimenstional pointer container? thanks - Levent.

1 0

Re: [Boost-users] [program_options] Linker error with MSVS 7.1
by Scott 14 Sep '06

14 Sep '06

As a follow up to my previous email regarding UNICODE problems, I tried the following on a whim: int _tmain(int argc, _TCHAR* argv[]) { try { static char* argvv[] = { "help" }; po::options_description desc("Allowed options"); desc.add_options() ("help", "produce help message") ("set,s", po::value< std::vector<std::string> >(), "Set one or more node values, overriding stored value in config file") ; po::variables_map vm; po::store(po::parse_command_line(argc, argvv, desc), vm); The program above compiles. If I switch from argvv (ANSI) to argv (UNICODE) in parse_command_line(), I get all those linker errors. The docs seem to indicate that UNICODE parsing is supported, so what am I missing? Thanks, Scott

1 0

[program_options] Linker error with MSVS 7.1
by Scott 14 Sep '06

14 Sep '06

I'm trying to link a win32 console app using program options. I have previously build boost with bjam using MSVS 7.1. My program, which is pretty basic and taken from first.cpp looks something like this: int _tmain(int argc, _TCHAR* argv[]) { try { po::options_description desc("Allowed options"); desc.add_options() ("help", "produce help message") ("set,s", po::value< std::vector<std::string> >(), "Set one or more node values, overriding stored value in config file") ; po::variables_map vm; po::store(po::parse_command_line(argc, argv, desc), vm); po::notify(vm); if (vm.count("help")) { std::cout << desc << "\n"; } [snip] The program is compiled as _UNICODE. It seems to compile ok, though I get the following warnings: ..\API\inc\boost\program_options\errors.hpp(21) : warning C4275: non dll-interface class 'std::logic_error' used as base for dll-interface class 'boost::program_options::error' C:\Program Files\Microsoft Visual Studio .NET 2003\Vc7\include\stdexcept(14) : see declaration of 'std::logic_error' ..\API\inc\boost\program_options\errors.hpp(21) : see declaration of 'boost::program_options::error' ..\API\inc\boost\program_options\variables_map.hpp(130) : warning C4273: 'boost::program_options::store' : inconsistent dll linkage ..\API\inc\boost\program_options\variables_map.hpp(138) : warning C4273: 'boost::program_options::store' : inconsistent dll linkage But then I get linker errors, like this: NwEngine.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::program_options::basic_parsed_options<unsigned short>::~basic_parsed_options<unsigned short>(void)" (__imp_??1?$basic_parsed_options@G@program_options@boost@@QAE@XZ) referenced in function _wmain I have the following lib files in my lib path: boost_program_options-vc71-mt-1_33_1.lib boost_program_options-vc71-mt-gd-1_33_1.lib libboost_program_options-vc71-mt-1_33_1.lib libboost_program_options-vc71-mt-gd-1_33_1.lib libboost_program_options-vc71-mt-s-1_33_1.lib libboost_program_options-vc71-mt-sgd-1_33_1.lib Am I supposed to do something special to link to them? I was under the impression that it worked similar to boost regex and auto-linked. Thanks, Scott

1 0

program_options application crashes when printing options descriptions
by Matt Schuckmann 14 Sep '06

14 Sep '06

At some point many of my applications that use the boost.program_options libraries started crashing when they attempt to print the options descriptions i.e. cout << opt_desc; I believe the problem started when we upgraded to boost 1.33.1 from 1.32.0 and were using MSVC 7.1. I'm not trying to figure out the problem using boost 1.33.1 using MSVC 8.0. Here is the deal if I run the debug version of one of my apps with the standard --help option it runs fine. If I run the release version part of the help message is displayed but then the application crashes If I attempt to debug the problem by launching the debug version of application from the MS debugger I get a debug assertion failed in xstring in a _SCL_SECURE_VALIDATE_RANGE check on operator += (basically the new secure checked iterators MS had introduced are complaining about an out of range iterator). Looking at the call stack the problem stemmed from line 361 of options_description.cpp (the format_paragraph function). Basically it looks like the program_options library is running afoul of the new checked iterators in MSVC 8.0 but since I do know we experienced a problem in using MSVC7.1 I think the problem is more insidious than a boundary condition check is overstepping an iterator range. Has anybody else experienced this type of problem or have any idea's on how to fix it? Thanks Matt S. FYI here is the start of my main including my add_options, store, and notify calls and the call to display the help message. o::options_description options_desc("Options"); po::variables_map vm; int _tmain(int argc, TCHAR* argv[]) { int nRetCode = 0; // initialize MFC and print and error on failure if (!AfxWinInit(::GetModuleHandle(NULL), NULL, ::GetCommandLine(), 0)) { // TODO: change error code to suit your needs _tprintf(_T("Fatal Error: MFC initialization failed\n")); nRetCode = 1; } else { //Setup our program options. options_desc.add_options() ("help,h", "Produce help message") ("cal_file,c", po::value< std::string >(), "Add use this characterization file, overrides any other options(-I)" ) ("output_file,o", po::value< std::string >(), "File to write to." ) ("input_file,i", po::value< std::string >(), "Tab delimited file to read from that characterizes frames to generate." ) ("ideal_perspective,I", "Use the default ideal perspective cubic characterization." ) ("ideal_fisheye,F", "Use the default ideal fisheye cubic characterization." ) ("num_video_streams,s", po::value<unsigned int>(), "Number of video streams to create in the iPAN file." ) ("no_gps_stream", "Don't generate a GPS stream, but do put GPS data in JPEG headers if input indicates it.") ("no_att_stream", "Don't generate a attitude stream, but do put attitude data in JPEG headers if input indicates it." ) // ("blocks,b", "Produce synchronization blocks") ; po::store( parse_command_line(argc, argv, options_desc), vm ); po::notify(vm); if( vm.count("help") ) { cout << options_desc << "\n"; return 1; }

2 3

Re: [Boost-users] Library Interface Design
by Sohail Somani 14 Sep '06

14 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > David Abrahams > Sent: Thursday, September 14, 2006 4:07 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Library Interface Design > > Scott Meyers <usenet(a)aristeia.com> writes: > > > - It has to be easy to find and fix mistakes resulting from > incorrect > > usage of an API. For example, APIs should throw exceptions clearly > > describing what needs to be done to fix the problems. > > It's always better to detect the problems at compile-time, at least in > the world of statically-checked languages. I would echo that this statement is also true for dynamically-checked languages in the obvious way. I think my python code is much easier to read if there is only one way to get a good object.

1 0

Newbie Jamfile author question
by Drumheller, Michael 14 Sep '06

14 Sep '06

(Thank you to Rene and David.) Rene, Are you referring to the parsing phase? Such behavior would not seem so harmful there (to me anyway). But if I add some actions, they get done twice, which does seem very harmful. I mean, it's like the updating phase gets done twice, not just the parsing. Here is another example Jamfile: ------------------------ begin Jamfile-------------------------- rule MyRule { Echo $(1) ; MyAction $(1) ; Depends all : $(1) ; } actions MyAction { touch $(1) ; echo $(1) andAgain ; } MyRule HelloAgain ; ------------------------ end Jamfile-------------------------- Here is the output: ------------------------ begin output-------------------------- c:/deleteme=> bjam HelloAgain HelloAgain ...found 9 targets... ...updating 1 target... MyAction HelloAgain HelloAgain andAgain ; MyAction HelloAgain HelloAgain andAgain ; ...updated 1 target... ------------------------ end Jamfile-------------------------- If the (lowercase) echo in MyAction had been a compilation, then I would have compiled all my files twice. (In fact, that is just the situation that led me construct this simple example.) Does bjam's behavior still seem OK to you? (I realize that bjam is used all the time by a zillion people--there must be somethng I'm doing wrong, or something I'm just not understanding--I'm sorry to be taking everyone's time with this.) Thanks again, Mike D. >>> -----Original Message----- >>> From: boost-users-request(a)lists.boost.org >>> [mailto:boost-users-request@lists.boost.org] >>> Sent: Wednesday, September 13, 2006 3:37 PM >>> To: boost-users(a)lists.boost.org >>> Subject: Boost-users Digest, Vol 1026, Issue 7 >>> >>> Send Boost-users mailing list submissions to >>> boost-users(a)lists.boost.org >>> >>> To subscribe or unsubscribe via the World Wide Web, visit >>> http://lists.boost.org/mailman/listinfo.cgi/boost-users >>> or, via email, send a message with subject or body 'help' to >>> boost-users-request(a)lists.boost.org >>> >>> You can reach the person managing the list at >>> boost-users-owner(a)lists.boost.org >>> >>> When replying, please edit your Subject line so it is more >>> specific than "Re: Contents of Boost-users digest..." >>> >>> >>> Today's Topics: >>> >>> 1. Re: bind, and member function with a parameter >>> (Arkadiy Vertleyb) >>> 2. multi_index library, dynamic number of indices ( Ad?n >>> Cosgaya ) >>> 3. Re: Newbie Jamfile author question (David Klein) >>> 4. Re: bind, and member function with a parameter >>> (Alexander Shyrokov) >>> 5. Re: Newbie Jamfile author question (Rene Rivera) >>> 6. mingw, bjam and Boost.Python tutorial problem >>> (Import Error) >>> (Sune Mai) >>> 7. Re: multi_index library, dynamic number of indices >>> (JOAQUIN LOPEZ MU?Z) >>> 8. Re: Library Interface Design (Jens Theisen) >>> >>> >>> ------------------------------------------------------------ >>> ---------- >>> >>> Message: 1 >>> Date: Wed, 13 Sep 2006 15:55:46 -0400 >>> From: "Arkadiy Vertleyb" <vertleyb(a)hotmail.com> >>> Subject: Re: [Boost-users] bind, and member function with a >>> parameter >>> To: boost-users(a)lists.boost.org >>> Message-ID: <ee9nob$v44$1(a)sea.gmane.org> >>> >>> "Peter Dimov" <pdimov(a)mmltd.net> wrote >>> >>> >> Just an idea -- is it possible to have one universal set of >>> >> placeholders in boost? Bind, Lambda, MPL, and possibly other >>> >> libraries could then use some sort of redirection to their >>> >> specialized placeholders... Might help to avoid some confusion. >>> > >>> > This isn't possible in general >>> >>> Not sure I understand why... >>> >>> AFAIU, placeholders are either types (MPL), in which case >>> some sort of traits can be used to redirect from, say, >>> boost::_1 to mpl::_1, or const objects (Bind, Lambda), in >>> which case some extra indirection through overload could >>> possibly do the trick something like: >>> >>> template<class T> T redirect(const T&); >>> template<int n> bind::arg<n> redirect(const boost::arg<n>&); >>> >>> Regards, >>> Arkadiy >>> >>> >>> >>> >>> >>> >>> >>> ------------------------------ >>> >>> Message: 2 >>> Date: Wed, 13 Sep 2006 17:37:44 -0300 >>> From: " Ad?n Cosgaya " <acosgaya(a)gmail.com> >>> Subject: [Boost-users] multi_index library, dynamic number >>> of indices >>> To: boost-users(a)lists.boost.org >>> Message-ID: >>> <df7e9fd90609131337u7844f495i1e857c265cb673b1(a)mail.gmail.com> >>> Content-Type: text/plain; charset="iso-8859-1" >>> >>> Hi, I am using multi_index to keep a set of d-dimensional >>> points, where each point is a vector inside the multi_index >>> container. >>> e.g (3,5,8,9,5) is a 5-dimensional point (but this can vary >>> and be 3-d, 7-d, etc..). I need to have the set sorted by >>> each of the dimensions. >>> >>> I can do it statically if I know in advance how many >>> dimensions I have, but I don't know how to make dynamic to >>> any number of dimensions. >>> >>> I currently have: >>> >>> template<int N> >>> struct nth_coordinate >>> { >>> typedef int result_type; >>> >>> int operator()(const vector<int>& x)const >>> { >>> return x[N]; >>> } >>> }; >>> >>> typedef multi_index_container< >>> vector<int>, >>> indexed_by< >>> sequenced<>, >>> ordered_non_unique<nth_coordinate<0> >, >>> ordered_non_unique<nth_coordinate<1> >, >>> ordered_non_unique<nth_coordinate<2> >, >>> ordered_non_unique<nth_coordinate<3> >, >>> ordered_non_unique<nth_coordinate<4> > >>> > >>> > multi_index_Points; >>> >>> is it possible do it without explicitly saying how many >>> indices do I need? >>> >>> Also, I am trying to create a function which receives as a >>> parameter the dimension I want to work with, but it seems >>> that I need to explicitly say the number of the index in >>> nth_index (it obviously needs a constant). For >>> example: >>> >>> int median (int d){ >>> ... >>> typedef multi_index_Points::nth_index< d >::type >>> multi_index_Points_it; ===> I would like to pass "d" as >>> a parameter >>> ... >>> } >>> >>> is there any workaround for this issues? >>> >>> would you mind pointing me in the right direction with an >>> example of how to do it with thelibrary? >>> >>> thanks in advance... >>> >>> Adan >>>

3 2

[test] Generate xml from unit tests
by Chris Weed 14 Sep '06

14 Sep '06

Hi, I would like to generate xml output from my test. The boost libraries seem to have an executable that converts the test output to xml. Is there a way to do it directly from the testing library? Chris

2 4

build regex with visual studio 2005
by Lars Schouw 14 Sep '06

14 Sep '06

I have a problem. When I build boost with visual studio 2005 regex does not get build. Anyidea how I enable this? I tried with --with-regex but this did not change I used bjam "-sTOOLS=vc-8_0" Regards Lars Schouw --------------------------------- Get your email and more, right on the new Yahoo.com

2 1

[BGL] Bipartite matching
by Swidan, Firas, Ph.D. 14 Sep '06

14 Sep '06

Hi, I was wondering if BGL contains algorithms for (weighted and unweighted) bipartite matching; the documentation site ( http://www.boost.org/libs/graph/doc/table_of_contents.html) shows no trace of such algorithms, neither does googling the users mailing list. Thanks for the help, Firas.

2 1

[Boost.Signal]
by Wu Yinghui, Freddie 14 Sep '06

14 Sep '06

Hi all, I'm a happy user of Boost.Signal, as it brings great power to our software design in terms of loosening all the coupling between components. However, I recently come across a case where a single-shot slot is desired (i.e., a signal-slot connection that is automatically disconnected once the signal is invoked for once). In our current implementation, we have to keep boost::signals::connection object around with the slot implementation, so that it can disconnect it after the first invocation. However, we have this problem of boost::signals::connection management, since one signal may be connected to different signals and we have problem identifying the correct connection to be disconnected. So my question is: Is there any easier way (i.e., ways that doesn't involve the implementation of the slot function itself) that I can add a single-shot signal-slot connection? Any suggestion is appreciated. Cheers, Freddie -- Wu Yinghui, Freddie Research & Development Senior Software Engineer Volume Interactions Pte Ltd 1 Kim Seng Promenade, #12-01 Great World City East Tower Singapore 237994 Tel: +65 62226962 (Ext 216) Fax: +65 62226215 Email: yhwu(a)volumeinteractions.com URL: http://www.volumeinteractions.com Important: This message is intended for the recipient(s) addressed above. It contains privileged and confidential information. If you are not the intended recipient, please notify the sender immediately by replying to this message and then delete it from your system. You must not read, copy, use, or disseminate this communication in any form. Thank you.

1 0

GraphViz sample help?
by Ramy Sadek 14 Sep '06

14 Sep '06

Hi All, I'm trying to create a simple C++ program that loads graphviz files (with arbitrary properties) into a mutable BGL graph by using a dynamic property map. This seemingly simple task has become a much larger task than I expected. So much so that I believe I'm barking up the wrong tree. I have been studying basic_graph<> in the python examples, trying to model my code after it, but several details elude me. So, I'm writing to ask if anyone has an example code that does this and would be kind enough to share it. It would be most helpful to me to see the concrete class definitions alongside the generic ones, to understand how to use them in my code. Thanks in advance! -Ramy

1 0

mingw, bjam and Boost.Python tutorial problem (Import Error)
by Sune Mai 14 Sep '06

14 Sep '06

Hi, I have a problem exactly similar to what is described in great detail in an earlier post to this list (with the same title): http://lists.boost.org/boost-users/2006/02/17367.php Unfortunatly, the thread ends without a solution... Just as in the above post, the dll "hello.pyd" built with bjam (following the Boost.Python tutorial) doesn't export inithello. A manual build does, and the resulting "hello.pyd" works fine when imported into python. One observation that might help pinpoint the problem is that the sizes of "hello.obj" and "hello.pyd", generated by the bjam build, are very different: hello.obj: 766 kB hello.pyd: 13 kB In the manual build they are both large (~800 kB). If any further info is needed please tell me, and I'll see what I can do - but please be very specific, since I'm an absolute newbie in the world of boost, and not a very experienced programmer in general either. Regards \Sune Mai

2 1

Re: [Boost-users] multi_index library, dynamic number of indices
by JOAQUIN LOPEZ MU?Z 13 Sep '06

13 Sep '06

Adán Cosgaya ha escrito: > Hi, I am using multi_index to keep a set of d-dimensional > points, where each point is a vector inside the multi_index > container. e.g (3,5,8,9,5) is a 5-dimensional point (but > this can vary and be 3-d, 7-d, etc..). I need to have the > set sorted by each of the dimensions. > > I can do it statically if I know in advance how many > dimensions I have, but I don't know how to make dynamic to > any number of dimensions. > > I currently have: > > template<int N> > struct nth_coordinate > { > typedef int result_type; > > int operator()(const vector<int>& x)const > { > return x[N]; > } > }; > > typedef multi_index_container< > vector<int>, > indexed_by< > sequenced<>, > ordered_non_unique<nth_coordinate<0> >, > ordered_non_unique<nth_coordinate<1> >, > ordered_non_unique<nth_coordinate<2> >, > ordered_non_unique<nth_coordinate<3> >, > ordered_non_unique<nth_coordinate<4> > > > > > multi_index_Points; > > is it possible do it without explicitly saying how many > indices do I need? Well, the short answer is no, you can't: multi_index_container is a compile-time construct, you cannot delay the specification to run time. That said, you can sort of have a kind of rudimentary dynamicity if you know the maximum number of coordinates and don't mind wasting memory and cpu cycles for those cases where the number of coordinates is less: rewrite nth_coordinate so as to not incur out of bounds accesses: template<int N> struct nth_coordinate { typedef int result_type; int operator()(const vector<int>& x)const { if(x.size()>N)return x[N]; else return 0; } }; and add as many indices to multi_index_Points as the maximum number of coordinates you know you're going to handle. > Also, I am trying to create a function which receives as a > parameter the dimension I want to work with, but it seems that > I need to explicitly say the number of the index in nth_index > (it obviously needs a constant). For example: > > int median (int d){ > ... > typedef multi_index_Points::nth_index< d >::type multi_index_Points_it; ===> I would like to pass "d" as a parameter > ... > } > > is there any workaround for this issues? Well, you're experiencing a typical clash between compile-time (or static) and run-time (or dynamic) polymorphisn. In the particular case of your median function, what you propose cannot work as is because multi_index_Points_it would be of a *different* type for each d! There are some techniques to bridge the static and dynamic worlds, all of them involving some sort of "type erasure", i.e. absorbing several different types into one polymorphic proxy type. The following is a possible realization of a dynamic median facility: class compile_time_median_table { private: template<int D> static int compile_time_median() { typedef typename multi_index_Points:: nth_index<D>::type multi_index_Points_it; ... } std::map<int,int (*)()> m; public: compile_time_median_table() { m[0]=compile_time_median<0>; ... m[6]=compile_time_median<6>; } int operator()(int d) { return m[d](); } }; int median(int d) { static compile_time_median_table t; return t(d); } Here, we perform the type erasure by storing a pointer to every different instantiation of compile_time_median<D> and using those within a proxy function int median(int) which provides the illusion of runtime polymorphism. Maybe this sort of approach does suit your needs. Best regards, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

Newbie Jamfile author question
by Drumheller, Michael 13 Sep '06

13 Sep '06

Hello: I am trying to write some Jamfiles and I am finding that bjam tends to run my rules twice. Here is a tiny demo (using Boost 1.31.1 on Windows XP, with zsh/cygwin, bjam version "3.1.13. OS=NT".). % export BOOST_ROOT=c:/boost_1_33_1; cd c:/; rm -rf deleteme; mkdir deleteme; cd deleteme; echo 'Echo Hello Twice ;' > Jamfile; bjam Hello Twice Hello Twice ...found 8 targets... (Note: If the first statement is "export BOOST_ROOT=;" instead, I get the error "Unable to load Boost.Build: could not find "boost-build.jam...Attempted search from c:\deleteme up to the root...etc.") Notice the double-execution. Here is some potentially useful extra information. I ran it with -d5, and noticed that 'Echo Hello Twice ;' was getting executed at lines 1785 and 1797 of allyourbase.jam. Here is a snippet of the -d5 output: ---------------------------------------------------------output with -d5---------------------------------------------------------- <snip> c:\boost_1_33_1\tools/build/v1\allyourbase.jam:1784:>>>>|> set gINCLUDED_AS_DEPENDANT(Jamfile) = TRUE c:\boost_1_33_1\tools/build/v1\allyourbase.jam:1785:>>>>|> include Jamfile Jamfile:1:>>>>|> Echo Hello Twice Hello Twice c:\boost_1_33_1\tools/build/v1\allyourbase.jam:1791:>>>>|> set gIN_LIB_INCLUDE = c:\boost_1_33_1\tools/build/v1\allyourbase.jam:1796:>>>>|> set gINCLUDED(Jamfile) = TRUE c:\boost_1_33_1\tools/build/v1\allyourbase.jam:1797:>>>>|> include Jamfile Jamfile:1:>>>>|> Echo Hello Twice Hello Twice make -- all make -- all <snip> --------------------------------------------------------end output with -d5------------------------------------------------------ The file allyourbase.jam is too big for this email, but I'm including the relevant snippet here, with key lines marked with "<<<<<" : ------------------------------------------------------allyourbase.jam--- --------------------------------------------- <snip> # Load a user's Jamfile(s). # rule load-jamfiles ( jamfiles * ) { # First we load the Jamfiles without generation of main targets so that # dependencies are preloaded. Then we reload the files with target # generation enabled. local jamfile ; local as-dependant = $(gIN_LIB_INCLUDE) ; local gIN_LIB_INCLUDE ; gIN_LIB_INCLUDE = TRUE ; for jamfile-path in $(jamfiles) { if ! $(gINCLUDED_AS_DEPENDANT($(jamfile-path))) { gINCLUDED_AS_DEPENDANT($(jamfile-path)) = TRUE ; include $(jamfile-path) ; <<<<< line 1785 } } if ! $(as-dependant) { gIN_LIB_INCLUDE = ; for jamfile-path in $(jamfiles) { if ! $(gINCLUDED($(jamfile-path))) { gINCLUDED($(jamfile-path)) = TRUE ; include $(jamfile-path) ; <<<<< line 1797 } } } } <snip> ------------------------------------------------------end allyourbase.jam------------------------------------------------ Can anyone reproduce and/or explain this? Thank you. Michael Drumheller Boeing Phantom Works Mathematics and Engineering Analysis 425.373.2703 michael.drumheller(a)boeing.com This email may contain proprietary information. If you are not the intended recipient please delete it and notify the sender that you received it in error.

3 2

multi_index library, dynamic number of indices
by Adán Cosgaya 13 Sep '06

13 Sep '06

Hi, I am using multi_index to keep a set of d-dimensional points, where each point is a vector inside the multi_index container. e.g (3,5,8,9,5) is a 5-dimensional point (but this can vary and be 3-d, 7-d, etc..). I need to have the set sorted by each of the dimensions. I can do it statically if I know in advance how many dimensions I have, but I don't know how to make dynamic to any number of dimensions. I currently have: template<int N> struct nth_coordinate { typedef int result_type; int operator()(const vector<int>& x)const { return x[N]; } }; typedef multi_index_container< vector<int>, indexed_by< sequenced<>, ordered_non_unique<nth_coordinate<0> >, ordered_non_unique<nth_coordinate<1> >, ordered_non_unique<nth_coordinate<2> >, ordered_non_unique<nth_coordinate<3> >, ordered_non_unique<nth_coordinate<4> > > > multi_index_Points; is it possible do it without explicitly saying how many indices do I need? Also, I am trying to create a function which receives as a parameter the dimension I want to work with, but it seems that I need to explicitly say the number of the index in nth_index (it obviously needs a constant). For example: int median (int d){ ... typedef multi_index_Points::nth_index< d >::type multi_index_Points_it; ===> I would like to pass "d" as a parameter ... } is there any workaround for this issues? would you mind pointing me in the right direction with an example of how to do it with thelibrary? thanks in advance... Adan

1 0

RV: assign shared_ptr to 0 in initialization list
by Berenguer Blasi 13 Sep '06

13 Sep '06

Hi, I've been following this thread and been unable to do the same with: boost::shared_ptr< map<string,string> > () So I can't do: constructor ( boost::shared_ptr< map<string,string> > varName = boost::shared_ptr< map<string,string> > () ) The error I get is (why/how do I specify the missing params for map?): [cc] /home/bereng/blaseek/src/lib/cppToolkit/DBHelper.h:61: error: expected a,a or a...a before a>a token [cc] /home/bereng/blaseek/src/lib/cppToolkit/DBHelper.h:61: error: wrong number of template arguments (1, should be 4) [cc] /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_ map.h:92: error: provided for atemplate<class _Key, class _Tp, class _Compare, class _Alloc> class std::mapa [cc] /home/bereng/blaseek/src/lib/cppToolkit/DBHelper.h:61: error: template argument 1 is invalid [cc] /home/bereng/blaseek/src/lib/cppToolkit/DBHelper.h:61: error: default argument missing for parameter 2 of aboost::shared_ptr<cppToolkit::ResultSet> cppToolkit::DBHelper::findObject(boost::shared_ptr<std::map<std::basic_strin g<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > >, std::string)a Thanks a lot in advance. -----Mensaje original----- De: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]En nombre de Scott Amort Enviado el: lunes, 14 de agosto de 2006 1:09 Para: boost-users(a)lists.boost.org Asunto: Re: [Boost-users] assign shared_ptr to 0 in initialization list Hi Scott, Thanks for the quick reply! On Sun, 2006-08-13 at 18:11 -0400, me22 wrote: > Instead of > > if (writer_.get() == 0) { /* create default error writer */ } > Why not just use > if ( !writer_ ) { /* create default error writer */ } > instead? This would work with ordinary pointers too. Thanks, that is clearer! > > What is the equivalent to: > > > > Parser testParser(0); > > > Parser testParser( ErrorWriterPtr() ); // would work > > I'd be tempted instead to replace the constructor definition with > Parser(ErrorWriterPtr writer = ErrorWritePtr()) > : writer_(writer) > { > } > however, to be able to just say > Parser testParser; > if you don't want to specify the writer. Perfect! Thanks again. Best, Scott _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Re: [Boost-users] bind, and member function with a parameter
by Nat Goodspeed 13 Sep '06

13 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Alexander Shyrokov > Sent: Wednesday, September 13, 2006 1:40 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] bind, and member function with a parameter > > void animation::advance(int ms); > std::vector<animation> anims; > std::for_each(anims.begin(), anims.end(), > boost::bind(&animation::advance, _1, ms)); > > I am using boost::lambda:: before _1. I get an error error C2825: > 'F::result_type': cannot form a qualified name [Nat] boost::bind defines _1 (etc.) placeholders that you must use with boost::bind(). boost::lambda defines _1 (etc.) placeholders that you must use with boost::lambda::bind(). Sadly, the two sets of placeholders are incompatible. Might that be your problem? Try explicitly qualifying your placeholder: ... boost::bind::_1 ... If that works, then adjust your using clauses appropriately.

1 0

[Regex] Japanese character equivalence is not working.
by Raveendra Madala 13 Sep '06

13 Sep '06

Hi, My name is Raveendra Madala. I work for Adobe Systems. We are using boost/regex 1.33.1 in one of our projects and we have encountered the following bug. Character Equivalence is supposed to find all variations of a given character. When we try to use this with Japanese characters regex is failing. To test this, if we have 0x30A2(Full width Katakana letter A), 0xFF71(Half width katakana letter A) and 0x32D0(Circled Katakana A) in the text and if we enter [[=a=]] where a is katakana a then regex is unable to find the three characters. This is just an example and is happening for all Japanese characters. How can we work around this issue? If you require more information on this, please do let me know. Thanks, Raveendra

3 3

Problems when compiling with Xcode
by Jaime Rios 13 Sep '06

13 Sep '06

Hi folks, I didn't see my post appear on the list, so I will post it again... This might be a silly question, or one that has already been addressed in the past, but here goes anyway. I have Xcode 2.4 and recently, I had to compile a static library for Universal code. I had to install the 10.2.8 Mac OS X sdk and when I went to compile my library, I got 66 errors :( Here is the first error I saw: from /Users/me/Documents/development/CPP/FMPlugIns/ FM85/FMPlugInSDK/plugin_u/Source/FMPlugInExample.cpp:41: from ../Libraries/FMWrapper.framework/Headers/ FMXTypes.h:15, from ../Libraries/FMWrapper.framework/Headers/ FMXClient.h:15, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/include/ gcc/darwin/3.3/c++/stdexcept:45, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/ include/gcc/darwin/3.3/c++/string:47, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/ include/gcc/darwin/3.3/c++/bits/char_traits.h:46, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/ include/gcc/darwin/3.3/c++/bits/fpos.h:45, from /Users/jaimerios/Documents/development/ cpp/Tools/boost_1_33_1/boost/compatibility/cpp_c_headers/cwchar:8, from /usr/include/wchar.h:71, from /usr/include/_types.h:27, from /usr/include/sys/_types.h:27, In file included from /usr/include/machine/_types.h:26, /usr/include/ppc/_types.h:73: error: conflicting types for `typedef union __mbstate_t __mbstate_t' The last error is the interesting one. I am assuming that the Boost sdk is forcing my compiler to look in the /usr/include path for the string header file instead of the Mac OS X 10.2.8 sdk path. Is this assumption correct? If so, how do I correct this problem? -Jaime

2 2

[fusion] transform a vector of values to refs
by Andy Little 13 Sep '06

13 Sep '06

Hi, I am trying to transform from a fusion vector of values to a fusion vector of non-const references to those values, the ultimate aim being to assign the original sequence from another sequence. The code below works ok with make_vector, but I want to be able to automate it for any fusion sequence. How can I do that? Current efforts follows: regards Andy Little #include <quan/out/current.hpp> #include <quan/matrix/out/matrix.hpp> #include <quan/operators/binary_operator_functors.hpp> #include <boost/fusion/sequence/io.hpp> #include <boost/fusion/sequence.hpp> #include <boost/ref.hpp> // try to make a function object to wrap references // in fusion style, with boost::ref struct add_reference_wrapper{ template <typename T> struct result{ typedef boost::reference_wrapper<T> type; }; template <typename T> typename result<T>::type operator()(T & t)const { return boost::ref(t); } }; int main() { using boost::fusion::at_c; typedef boost::fusion::vector4< quan::current::A, quan::current::mA, double,double > fusion_sequence_type; fusion_sequence_type sequence( quan::current::A(3), quan::current::mA(2), 1,1 ); std::cout << "before : " << sequence <<'\n'; // This works OK, and and assign the sequence to itself; std::cout << "after : " << boost::fusion::as_vector( boost::fusion::transform( boost::fusion::make_vector( boost::ref(at_c<0>(sequence)), boost::ref(at_c<1>(sequence)), boost::ref(at_c<2>(sequence)), boost::ref(at_c<3>(sequence)) ),sequence, quan::operator_plus_equals() ) ) <<'\n'; //############################################# // But cant make a vector of non const references boost::fusion::as_vector( boost::fusion::transform( sequence,add_reference_wrapper() ) ); //############################################# }

3 15

Re: [Boost-users] Library Interface Design
by Sohail Somani 13 Sep '06

13 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Roman Neuhauser > if (!initialized_) { > throw new exception("This object is broken."); > } > > That's somewhat like OOP in C, and FMPOV a huge step back. Actually, even in strict C, good programmers tend to do something like: T * make_T(T1 p1, T2 p2); T1 do_op1(T*this__,...) And make T opaque, i.e. C++ in C. Sohail

3 2

Iterating over MPL container
by Johan Torp 13 Sep '06

13 Sep '06

Given an MPL container: struct A{}; struct B{}; typedef boost::mpl::vector<A,B> AB and a templated function, specialized for all members of the MPL container: template<class T> void foo(); template<A> void foo(); template<B> void foo(); I would like to be able to generate the code: foo<A>(); foo<B>(); automatically using AB somehow. That is, I would like to iterate through the MPL container and generate a call to void Foo<T>(); for each member T in the container. How do I achieve this? Best Regards, Johan Torp -- System Developer TouchTable AB Tel: +46 (0)31 773 68 12 johan.torp(a)touchtable.se

2 1

Getting coverage results with boost.test on vc8
by imre＠u-tx.com 13 Sep '06

13 Sep '06

Hi, is such thing possible? If yes, then how can I do this? Thanks ImRe

2 1

Re: [Boost-users] Boost build error with HP aCC
by Oliver.Kowalke＠qimonda.com 13 Sep '06

13 Sep '06

> If I built libboost-filesystem on gcc on this platform and > produces a shared library, would I be able to use that > library from my own shared library that is compiled with aCC-3.x? > My thought here is NO because: It doesn't work because aCC and gcc use different name mangling for C++ classes (C++ does not define a standard decoration scheme, so each compiler uses its own). regards, Oliver

1 0

Re: [Boost-users] Boost build error with HP aCC
by Oliver.Kowalke＠qimonda.com 13 Sep '06

13 Sep '06

Hello, > Hello all, > > I'm attempting to build Boost filesystem as a shared library > on HP using aCC(I have no choice, I have to use this > compiler). Here is machine and compiler info: > > HP-UX B.11.11 U 9000/800 (tb) > aCC: HP ANSI C++ B3910B A.03.63 I've also to develop on HP/UX 11.11 PA-RISC. The aCC deployed on PA-RISC is a verry old (version 3.x) and is not conform to the current c++-standard (aCC-3.x has problems with templates). I got boost never compiled on this platform with aCC-3.x. I use gcc (depot from HP-website) and it works very well. If you can switch to Itanium-HP/UX you can use aCC-6.x which should work with boost. regards, Oliver

2 1

[date_time] Compilation error with MSVC8
by Eoin 13 Sep '06

13 Sep '06

Hello, before I explain my problem I'd like to apologize in advance if the error is on my part. Also this might have double posted because I believe I made an error initially, sorry if that's the case. I have a program using the date_time library. It compiles with msvc7.1 and MinGW but not under msvc8. Very simple usage is enough to recreate the error: #include <boost/date_time/posix_time/posix_time.hpp> ... boost::posix_time::ptime tim = boost::posix_time::second_clock::local_time(); std::cout << tim; I've attached the error output to this mail, I realize it is long but I wasn't sure if any bits could be safely left out. Any help that can be offered on this issue would be very much appreciated. Kind regards, Eoin C:\Develop\Libraries\Boost\boost\boost/range/const_iterator.hpp(37) : error C2825: 'C': must be a class or namespace when followed by '::' C:\Develop\Libraries\Boost\boost\boost/algorithm/string/replace.hpp(656) : see reference to class template instantiation 'boost::range_const_iterator<C>' being compiled with [ C=const char * ] C:\Develop\Libraries\Boost\boost\boost/date_time/time_facet.hpp(257) : see reference to function template instantiation 'void boost::algorithm::replace_all<std::basic_string<_Elem,_Traits,_Ax>,const char*,std::basic_string<_Elem,_Traits,_Ax>>(SequenceT &,const Range1T &,const Range2T &)' being compiled with [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char>, SequenceT=std::basic_string<char,std::char_traits<char>,std::allocator<char>>, Range1T=const char *, Range2T=std::basic_string<char,std::char_traits<char>,std::allocator<char>> ] C:\Develop\Libraries\Boost\boost\boost/date_time/time_facet.hpp(239) : while compiling class template member function 'std::ostreambuf_iterator<_Elem,_Traits> boost::date_time::time_facet<time_type,CharT>::put(OutItrT,std::ios_base &,char,const time_type &) const' with [ _Elem=char, _Traits=std::char_traits<char>, time_type=boost::posix_time::ptime, CharT=char, OutItrT=std::ostreambuf_iterator<char,std::char_traits<char>> ] C:\Develop\Libraries\Boost\boost\boost/date_time/posix_time/posix_time_io.hpp(51) : see reference to class template instantiation 'boost::date_time::time_facet<time_type,CharT>' being compiled with [ time_type=boost::posix_time::ptime, CharT=char ] Hello_Con\src\ConsoleTimeClient.cpp(41) : see reference to function template instantiation 'std::basic_ostream<_Elem,_Traits> &boost::posix_time::operator <<<char,std::char_traits<char>>(std::basic_ostream<_Elem,_Traits> &,const boost::posix_time::ptime &)' being compiled with [ _Elem=char, _Traits=std::char_traits<char> ] C:\Develop\Libraries\Boost\boost\boost/range/const_iterator.hpp(37) : error C2039: 'const_iterator' : is not a member of '`global namespace'' C:\Develop\Libraries\Boost\boost\boost/range/const_iterator.hpp(37) : error C2146: syntax error : missing ';' before identifier 'type' C:\Develop\Libraries\Boost\boost\boost/range/const_iterator.hpp(37) : error C2208: 'boost::type' : no members defined using this type C:\Develop\Libraries\Boost\boost\boost/range/const_iterator.hpp(37) : fatal error C1903: unable to recover from previous error(s); stopping compilation

2 2

Boost build error with HP aCC
by Mail Lists Account 13 Sep '06

13 Sep '06

Hello all, I'm attempting to build Boost filesystem as a shared library on HP using aCC(I have no choice, I have to use this compiler). Here is machine and compiler info: HP-UX B.11.11 U 9000/800 (tb) aCC: HP ANSI C++ B3910B A.03.63 I have done a libs/config/configure and generated a user.hpp file for this compiler, but using the config doesn't help any. The problem I'm having is I get a compiler error that I don't know how to work around: bash-2.05b$ ../../../tools/boost-jam-3.1.11/bin.hpux/bjam -sTOOLS=acc -sBUILD="debug <runtime-link>dynamic <threading>multi" --builddir=../HPUX-parisc64/src/boost/ --stagedir=../HPUX-parisc64/src/boost/ --without-python --with-filesystem stage Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (and if you don't know what ICU is then you probably don't need it). ...found 380 targets... ...updating 14 targets... aCC-C++-action ../HPUX-parisc64/src/boost/bin/boost/libs/filesystem/build/libboost_filesystem.a/acc/debug/threading-multi/exception.o Error 319: "/build.local/rm/3rdparty/c/boost_1_33_1/boost/mpl/aux_/preprocessed/no_ttp/apply_wrap.hpp", line 22 # The number of arguments in the template specialization does not match the number of arguments in the template declaration. : F::template apply< > ^^^^^^^^^ aCC -AA +DA2.0W -c +W823 -I/build.local/rm/3rdparty/c/boost_1_33_1 -DBOOST_FILESYSTEM_STATIC_LINK +d -mt -g -I"../HPUX-parisc64/src/boost/bin/boost/libs/filesystem/build" -I"/build.local/rm/3rdparty/c/boost_1_33_1" -I"/build.local/rm/3rdparty/c/boost_1_33_1" -o "../HPUX-parisc64/src/boost/bin/boost/libs/filesystem/build/libboost_filesystem.a/acc/debug/threading-multi/exception.o" "/build.local/rm/3rdparty/c/boost_1_33_1/libs/filesystem/build/../src/exception.cpp" ...failed aCC-C++-action ../HPUX-parisc64/src/boost/bin/boost/libs/filesystem/build/libboost_filesystem.a/acc/debug/threading-multi/exception.o... a I have done some searches but turned up short on how to get past this. Any help is greatly appreciated. Thanks in advance, Ed

2 1

Re: [Boost-users] Library Interface Design
by Sohail Somani 13 Sep '06

13 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of loufoque > You can construct safe SQL queries with streams or > printf-like syntax easily > sql << "select first_name, last_name, date_of_birth " > "from persons where id = " << id > > No need to put objects everywhere that complexify everything. Complexification is the source of all optimization. Or something like that anyway...

1 0

Re: [Boost-users] Boost serialization : Possible to append to file?
by smith smithson 12 Sep '06

12 Sep '06

[I sent this in earlier, but for some reason it didn't show up on the list. Apologies if this end's up being a duplicate] --- smith smithson <smith4894(a)yahoo.com> wrote: > > Hello, > > This is regarding the boost serialization library. > Is > it possible to append to a pre-existing archive > file? > i.e. Create an archive file, serialize objects to > it, > close file, and then re-open file and append more > serialized objects to it. Is this allowed? > > -Thanks! > > __________________________________________________ > Do You Yahoo!? > Tired of spam? Yahoo! Mail has the best spam > protection around > http://mail.yahoo.com > __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

1 0

boost filesystem using dev-cpp.
by chun ping wang 12 Sep '06

12 Sep '06

Alright i have a simple problem getting dev-cpp ide compiler to configure to run boost filesystem. I get the following error in this code. #include <boost/filesystem/operations.hpp> #include <boost/filesystem/path.hpp> #include <iostream> int main(int argc, char* argv[]) { }

1 1

boost-1-33-1 compilation problem with msvc 7/1 sp1
by Serge Skorokhodov 12 Sep '06

12 Sep '06

Hello, I'm not sure wether this has been already discussed. wave library in Boost 1-33-1 distribution fails to compile with msvc 7.1 sp1 (compiler version 13.10.6030) with the following error: vc-C++ bin\boost\libs\wave\build\libboost_wave.lib\vc-7_1\debug\rtti-off\runtime-link-static\instantiate_cpp_grammar.obj instantiate_cpp_grammar.cpp c:\boost_1_33_1\boost\spirit\core\composite\alternative.hpp(60) : fatal error C1002: compiler is out of heap space in pass 2 "cl" /Zm800 -nologo /EHsc -c /Z7 /Od /Ob0 /EHsc /MLd /Op /wd4675 /Zc:forScope /Zc:wchar_t -I"bin\boost\libs\wave\build" -I"C:\boost_1_33_1" -I"C:\Program Files\Microsoft VisualStudio .NET 2003\VC7\include" -I"C:\boost_1_33_1" -Fo"bin\boost\libs\wave\build\libboost_wave.lib\vc-7_1\debug\rtti-off\runtime-link-static\instantiate_cpp_grammar.obj" -Tp"C:\boost_1_33_1\libs\wave\build\../src/instantiate_cpp_grammar.cpp" ...failed vc-C++ bin\boost\libs\wave\build\libboost_wave.lib\vc-7_1\debug\rtti-off\runtime-link-static\instantiate_cpp_grammar.obj... Increasing the number for /Zm option does not help. -- Best regards, Serge mailto:serge.skorokhodov@tochka.ru

1 0

Re: [Boost-users] [graph] breadth_first_search with a structure
by boost＠daniel-gohlke.de 12 Sep '06

12 Sep '06

Hello Stephan, Am 12.09.2006 um 12:42 Uhr haben Sie geschrieben: > typedef adjacency_list < vecS, vecS, undirectedS, tVertex> tGraph; > > after that you get a property map from the graph: > typedef property_map<graph_t, long tVertex::*>::type tDistanceMap; I think "graph_t" should be "tGraph", shouldn't ist? When compiling your example, the VC++ compiler puts a lot of Errors: :\daten\Programme\boost/pending/property.hpp(40) : error C2039: 'kind' : is not a member of '`global namespace'' H:\daten\Programme\boost/graph/properties.hpp(198) : see reference to class template instantiation 'boost::property_kind<long dreiDmatrix::tVertex::*>' being compiled H:\daten\Programme\Matrizen\dreiDmatrix.cpp(255) : see reference to class template instantiation 'boost::property_map<class boost::adjacency_list<struct boost::vecS,struct boost::vecS,struct boost::undirectedS,struct dreiDmatrix::tVertex,str uct boost::no_property,struct boost::no_property,struct boost::listS>,long dreiDmatrix::tVertex::*>' being compiled ... and so on. What`s wrong? Thank you.

2 1

Problems when compiling with Xcode
by Jaime Rios 12 Sep '06

12 Sep '06

Hi folks, This might be a silly question, or one that has already been addressed in the past, but here goes anyway. I have Xcode 2.4 and recently, I had to compile a static library for Universal code. I had to install the 10.2.8 Mac OS X sdk and when I went to compile my library, I got 66 errors :( Here is the first error I saw: from /Users/me/Documents/development/CPP/FMPlugIns/ FM85/FMPlugInSDK/plugin_u/Source/FMPlugInExample.cpp:41: from ../Libraries/FMWrapper.framework/Headers/ FMXTypes.h:15, from ../Libraries/FMWrapper.framework/Headers/ FMXClient.h:15, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/include/ gcc/darwin/3.3/c++/stdexcept:45, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/ include/gcc/darwin/3.3/c++/string:47, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/ include/gcc/darwin/3.3/c++/bits/char_traits.h:46, from /Developer/SDKs/MacOSX10.2.8.sdk/usr/ include/gcc/darwin/3.3/c++/bits/fpos.h:45, from /Users/jaimerios/Documents/development/ cpp/Tools/boost_1_33_1/boost/compatibility/cpp_c_headers/cwchar:8, from /usr/include/wchar.h:71, from /usr/include/_types.h:27, from /usr/include/sys/_types.h:27, In file included from /usr/include/machine/_types.h:26, /usr/include/ppc/_types.h:73: error: conflicting types for `typedef union __mbstate_t __mbstate_t' The last error is the interesting one. I am assuming that the Boost sdk is forcing my compiler to look in the /usr/include path for the string header file instead of the Mac OS X 10.2.8 sdk path. Is this assumption correct? If so, how do I correct this problem? -Jaime

1 0

[graph] breadth_first_search with a structure
by boost＠daniel-gohlke.de 12 Sep '06

12 Sep '06

Hello, I have a problem with the breadth_first_search. I read the documentation and examples an can't find a solution for my problem. In order breadth_first_search uses a bfs_discovery_visitor<unsigned int * > vis(&distanceSet[0]);. This distance vector storing all distances. So, now I need more then a vector. I want use a struct for storing the distances and later some other stuff e.g. probability of distances and cumulative probabilitys. I tried several code, but get every time errors from VC++ compiler. Can anybody tell me, how do I handle this vector<struct *>. The second question is, can I abort the further evaluation of distances, if any theshold is reached? The graph has about 57000 vertices an every vertice has about 6 edges. I am interested only for the vertices in a given range (e.g. 100). Now I get all distances and copy_if the vector of distances, if the given threshold isn't reached. This is fast enough for one vertice to all others, but the program calculates the distances for each of 57000 vertices. 20 minutes are too slow. Thanks for helping me.

2 1

Re: [Boost-users] Library Interface Design
by Oliver.Kowalke＠qimonda.com 12 Sep '06

12 Sep '06

Hello Scott, > I've always been a big fan of the "don't let users create > objects they can't really use" philosophy. I also prefer this style because it could be cumbersome to detect the source of exceptions thrown by half-initialized objects in complex applications. If half-initialized objects are allowed the library developer has to provide descriptive exceptions. with best regards, Oliver

1 0

array of strings in boost python
by ctrembla＠pcigeomatics.com 12 Sep '06

12 Sep '06

Hi, newbie in python and boost::python I have a method in c++ that returns a vector of strings, how can i expose this method in python, and how should i use it in python class A { public: std::vector<std::string> getName(); }; BOOST_PYTHON_MODULE(pysession) { class_<A>("A") .def("GetName" ,&A::getName) } now in python how could i call the function getName() ? here is my error in python TypeError: No to_python (by-value) converter found for C++ type: class std::vect or<class std::basic_string<char,struct std::char_traits<char>,class std::allocat or<char> >,class std::allocator<class std::basic_string<char,struct std::char_tr aits<char>,class std::allocator<char> > > > not valid thanks, Charles.

3 3

Re: [Boost-users] 3 times slower than c++
by Qinfeng(Javen) Shi 11 Sep '06

11 Sep '06

Dear all, We are writing a python toolbox and wrapping it from c++ is much faster than pure python. But my wrapped c++ code(called in python) is 3 times(not plus a constant time) slower than the orignial c++ one. I think the difference should be a constant not a factor. Because all the computation has been taken in *.so, the extra time cost is the time python load it at the beginning. Is that right? Any opinion or suggestion about why or how to speed it up? Best wishes! Javen On 9/11/06, boost-users-request(a)lists.boost.org < boost-users-request(a)lists.boost.org> wrote: > > Send Boost-users mailing list submissions to > boost-users(a)lists.boost.org > > To subscribe or unsubscribe via the World Wide Web, visit > http://lists.boost.org/mailman/listinfo.cgi/boost-users > or, via email, send a message with subject or body 'help' to > boost-users-request(a)lists.boost.org > > You can reach the person managing the list at > boost-users-owner(a)lists.boost.org > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Boost-users digest..." > > > Today's Topics: > > 1. Re: having a problem seeding random number generator. (Jim Ingram) > 2. Re: [string_algo] wildcard support? (Pavol Droba) > 3. Re: Absolute Quanfusion : was Re: [fusion] transform a vector > of values to refs (Andy Little) > 4. Properties (newbie) (Olivier Tournaire) > 5. 3 times slower than c++? (Qinfeng(Javen) Shi ) > 6. Re: 3 times slower than c++? (Andy Little) > 7. Re: Lock pointer implementation (Mattias Br?ndstr?m) > 8. Re: Lock pointer implementation (Mattias Brandstrom) > 9. Re: Link error with boost regex and STLport (Maik Beckmann) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Sun, 10 Sep 2006 15:38:41 +0000 (UTC) > From: Jim Ingram <ingramj(a)gmail.com> > Subject: Re: [Boost-users] having a problem seeding random number > generator. > To: boost-users(a)lists.boost.org > Message-ID: <loom.20060910T172921-895(a)post.gmane.org> > Content-Type: text/plain; charset=us-ascii > > Daniel James <daniel_james <at> fmail.co.uk> writes: > > > The problem is that 'variate_generator' stores a copy of the engine, not > > a reference. > > Wow. You'd think that between the docs, the header files, and the example > code, > I would have caught that. It does make a lot more sense to have the > generator > and distribution encapsulated inside a variate_generator instead of > maintaining > them seperately. > > Thanks for pointing that out. > > -- > Jim > > > > ------------------------------ > > Message: 2 > Date: Sun, 10 Sep 2006 20:29:09 +0200 > From: Pavol Droba <droba(a)topmail.sk> > Subject: Re: [Boost-users] [string_algo] wildcard support? > To: boost-users(a)lists.boost.org > Message-ID: <45045975.1090701(a)topmail.sk> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Hi, > > Andriy Tylychko (mail.ru) wrote: > > > > > > To community and especially to Pavol Droba as the author of string_algo: > > What do you think about popularity of wildcards as the tool for > end-users? > > Is it worth to add wildcards support to the library? To what library? Is > the > > boost-development mailing list a better place for this discussion? > > I can only express my personal opinion here and that is : the wildcards > should not be a directly supported in string_algo library. > > Reason is simple: the functionality provided by wildcards is superseeded > by regex in all respects. In addition, as you have explained in your > previous mail, it is easy to convert a wildcard to a regex. > > I can't say if the support could be incorporated into Boost.Regex. > This library already support several syntaxes, so wildcards could be > just another variant. But this is more question to John Maddock. > > You can also try to cleanup your conversion utility and offer it to > boost, to get a response from whole comunity. > > Regards, > Pavol > > > ------------------------------ > > Message: 3 > Date: Sun, 10 Sep 2006 19:33:32 +0100 > From: "Andy Little" <andy(a)servocomm.freeserve.co.uk> > Subject: Re: [Boost-users] Absolute Quanfusion : was Re: [fusion] > transform a vector of values to refs > To: boost-users(a)lists.boost.org > Message-ID: <ee1lpe$trq$1(a)sea.gmane.org> > Content-Type: text/plain; format=flowed; charset="utf-8"; > reply-type=original > > > "Joel de Guzman" <joel(a)boost-consulting.com> wrote in message > news:edv1e0$n73$1@sea.gmane.org... > > > > > Sounds good. Okidoki. > > Great. I will see if I can get on with it, rather than spend more time > mucking > about with fusion ;-) > > regards > Andy Little > > > > > ------------------------------ > > Message: 4 > Date: Sun, 10 Sep 2006 21:57:17 +0200 > From: Olivier Tournaire <olitour(a)yahoo.fr> > Subject: [Boost-users] Properties (newbie) > To: boost-users(a)lists.boost.org > Message-ID: <45046E1D.7040709(a)yahoo.fr> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Hi all, > > I am a new boost user (2 days old ...). I just want to know a few things. > > 1. I use an adjacency_list with my own properties to store my graph. I > just want to know if it is possible to manipulate directly the > properties' values. At the moment, I use get(...) to obtain the > property, make my change, and use put(...) to set the new value. > > 2. My graph cannot contain parallel edges, so I use a setS. However, the > documentation says that listS or vecS is more efficient in time and > space complexity. Is it possible to use std::vector or std::list and to > disallow parallele edges ? > > Thanks in advance > Olivier > > > ------------------------------ > > Message: 5 > Date: Mon, 11 Sep 2006 09:54:43 +1000 > From: "Qinfeng(Javen) Shi " <shiqinfeng(a)gmail.com> > Subject: [Boost-users] 3 times slower than c++? > To: boost-users(a)lists.boost.org > Message-ID: > <fe76f74b0609101654o12a61256w3b6f7c4ce24cd55a(a)mail.gmail.com> > Content-Type: text/plain; charset="iso-8859-1" > > Dear all, > > I wrapped a c++ code into python. It works but it is 3 times slower than > the > orignial c++ one. > Is that normal? Is there something I can do to speed it up? > > Thanks! > > -- > Qinfeng(Javen) Shi > > Research School of Information Sciences and Engineering > Australian National University > Locked Bag 8001 > Canberra ACT 2601 >

2 1

bcp not found ?
by Shintaro Fujiwara 11 Sep '06

11 Sep '06

Hi. I tried to extract some subset of boost by bcp command but couldn't make it. [root@mama lib]# bcp --boost="/usr/local/lib" boost/regex.hpp "/home/dir/projects/segatex2.15" -bash: bcp: command not found [root@mama lib]# rpm -qa|grep boost boost-jam-3.1.13-1 boost-devel-1.33.1-5 boost-doc-1.33.1-5 boost-1.33.1-5 What's wrong or what's missing? Thanks in advance.

1 0

Re: [Boost-users] 3 times slower than c++
by Sohail Somani 11 Sep '06

11 Sep '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > Qinfeng(Javen) Shi > Sent: Monday, September 11, 2006 3:46 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] 3 times slower than c++ > > Dear all, > > We are writing a python toolbox and wrapping it from c++ is > much faster than pure python. > But my wrapped c++ code(called in python) is 3 times(not plus > a constant time) slower than the orignial c++ one. > > I think the difference should be a constant not a factor. > Because all the computation has been taken in *.so, the extra > time cost is the time python load it at the beginning. > Is that right? > > Any opinion or suggestion about why or how to speed it up? Are you wrapping with boost.python?

1 0

3 times slower than c++?
by Qinfeng(Javen) Shi 11 Sep '06

11 Sep '06

Dear all, I wrapped a c++ code into python. It works but it is 3 times slower than the orignial c++ one. Is that normal? Is there something I can do to speed it up? Thanks! -- Qinfeng(Javen) Shi Research School of Information Sciences and Engineering Australian National University Locked Bag 8001 Canberra ACT 2601

4 4

Re: [Boost-users] array of strings in boost python
by ctrembla＠pcigeomatics.com 11 Sep '06

11 Sep '06

In article <87k64aad0w.fsf__22758.9953029112$1157972153$gmane $org(a)pereiro.luannocracy.com>, dave(a)boost-consulting.com says... > <ctrembla(a)pcigeomatics.com> writes: > > > Hi, > > > > newbie in python and boost::python > > Please post Boost.Python questions to the C++-sig: > http://www.boost.org/more/mailing_lists.htm#cplussig > > > I have a method in c++ that returns a vector of strings, how can i > > expose this method in python, and how should i use it in python > > Sorry to turn the question around on you, but how do you /want/ to be > able to use it in Python? That will determine how you should expose > it. > > You might look into > http://boost.org/libs/python/doc/v2/indexing.html#vector_indexing_suite_cla… > to see if it meets your needs. > > > hi, i have exposed my c++ class using the python.boost BOOST_PYTHON_MODULE(pysession) { class_<Session> >("Session") .def("Connect" ,&Session::Connect) .def("Disconnect",&Session::Disconnect) .def("SaveSession",& Session::SaveSession) .def("SaveSessionAs", &Session ::SaveSessionAs) .def("DeleteSession", & Session::DeleteSession) .def("GetListOfServer",& Session ::GetListOfServer) ; class_<std::vector<std::string> >("STD_String") .def(vector_indexing_suite<std::vector<std::string> >()) ; } i have compiled and it generated my pyd now in python , this is were i'm stuck, i was able to retreive the iterator, how can i iterate and how can i retreive the string within the vector? oString = self.oLogin.GetListOfServer() i=0 oList = range(oString.__len__()) oIter = oString.__iter__() for i in oList: oIter = oIter.next() error log oIter = oIter.next() TypeError: No Python class registered for C++ class class std::basic_string<char ,struct std::char_traits<char>,class std::allocator<char> > thanks, charles.

1 0

boost::thread_group signal for exception and exit
by Andrew Wingorodov 11 Sep '06

11 Sep '06

What interface exists for to send a signal of exit for boost::thread ? -- andr.ru

1 0

Link error with boost regex and STLport
by Gérald FAUVELLE 11 Sep '06

11 Sep '06

Hello, I've searched in both stlport and boost forums, but I couldn't find anything yet about my problem. I'm using boost 1.33, and I tried to compiled with STL port. Boost compiles fine (except boost python, but I'll have a look later) and when I link my program, I have the following errors : boost.lib(w32_regex_traits.obj) : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __thiscall stlp_std::basic_string<unsigned short,class stlp_std::char_traits<unsigned short>,class stlp_std::allocator<unsigned short> >::basic_string<unsigned short,class stlp_std::char_traits<unsigned short>,class stlp_std::allocator<unsigned short> >(unsigned short const *,class stlp_std::allocator<unsigned short> const &)" Do you have an idea of what could be the problem, and how to solve it ? I tried with STLport 4.6.2, 5.0.2 and 5.1, and I have the same error. Thanks, Gérald

3 7

Lock pointer implementation
by Mattias Brändström 11 Sep '06

11 Sep '06

Hello! I have a small class that I would like to get some feedback on. If you have the time. =) What I would like to do is to protect an instance of some class T with a mutex. It seems to me that I would be able to do this with a smart pointer that returns a proxy class, from operator->(), that locks a mutex in its constructor and unlocks it in its destrcutor. This is my intitial implementation of such a class: #include <boost/shared_ptr.hpp> #include <boost/thread.hpp> template <typename T> class LockPointer { public: class LockProxy { public: LockProxy(boost::shared_ptr<T> p, boost::shared_ptr<boost::recursive_mutex> mutex) : p_(p), lock_(new boost::recursive_mutex::scoped_lock(*mutex)) { } boost::shared_ptr<T> operator->() { return p_; } private: boost::shared_ptr<T> p_; boost::shared_ptr<boost::recursive_mutex::scoped_lock> lock_; }; LockPointer(boost::shared_ptr<T> o) : p_(o), mutex_(new boost::recursive_mutex()) { } LockProxy operator->() { return LockProxy(p_, mutex_); } private: boost::shared_ptr<T> p_; boost::shared_ptr<boost::recursive_mutex> mutex_; }; What do you think? Would this work? Would this be equivalent to locking a member mutex in each method of T (as long as all calls to an instance of T is invoked via the same LockPointer)? For some reason this is the kind of thing I would expect to find in boost, but I have not been able to. Have I missed some part of boost that I should know about? Regards, Mattias

3 3

Properties (newbie)
by Olivier Tournaire 10 Sep '06

10 Sep '06

Hi all, I am a new boost user (2 days old ...). I just want to know a few things. 1. I use an adjacency_list with my own properties to store my graph. I just want to know if it is possible to manipulate directly the properties' values. At the moment, I use get(...) to obtain the property, make my change, and use put(...) to set the new value. 2. My graph cannot contain parallel edges, so I use a setS. However, the documentation says that listS or vecS is more efficient in time and space complexity. Is it possible to use std::vector or std::list and to disallow parallele edges ? Thanks in advance Olivier

1 0

[string_algo] wildcard support?
by Richard Dingwall 10 Sep '06

10 Sep '06

Hi, I was wondering if boost string algorithms library has any support for "wildcard" characters (eg * and ?). If not... then I'm open to suggestions :) Cheers, Richard

4 5

having a problem seeding random number generator.
by Jim Ingram 10 Sep '06

10 Sep '06

I'm just starting out with boost, and I'm playing around with the random library. I'm writing a class that is supposed to simulate a six-sided die. It compiles and everything works, except seeding the mt19937. Every time I try testing this class, I get the same numbers, no matter what value I call my seed method with. If I use the constructor that takes a seed value, I get different numbers, but reseeding the object still doesn't seem to have any effect. Any ideas? #include <boost/random.hpp> class D6 { typedef boost::mt19937 engine_t; typedef boost::uniform_int<> dist_t; typedef boost::variate_generator<engine_t, dist_t> gen_t; public: D6() : engine(), six(1, 6), die(engine, six) { } D6(boost::uint32_t s) : engine(s), six(1, 6), die(engine, six) { } int roll() { return die(); } // This method seems to do nothing. void seed(boost::uint32_t s) { engine.seed(s); } private: engine_t engine; dist_t six; gen_t die; };

3 5

Graph library read_graphviz linker problem Visual C++ 7.1
by hadi khani 10 Sep '06

10 Sep '06

Hi everybody, First I want to point out that I am very immature with Boost library, and my problem may seem very simple for you; but I would be grateful if you help me. I am trying to use Graph library especially read_graphviz function to load a DOT file. I accomplished the following steps in Visual C++ 7.1 1. Download boost_1_33_1 2. Download bjam file for windows 3. Building libbgl-viz.lib by run "bjam "-sTOOLS=vc-7_1"" command in \boost_1_33_1\libs\graph\build folder 4. Setting path for libbgl-viz.lib and other Header file in the proper dialog Tools>Options>VC++ Directories 6. At this point I try to Build and compile one of Garaph example, cc-internet.cpp, I got a linker error for read_graphviz. Any help would be appreciated. Hadi Khani Hadi Khani --------------------------------- Get your own web address for just $1.99/1st yr. We'll help. Yahoo! Small Business.

2 1

Bizarre behaviour with Microsoft compiler
by Eric Fowler 10 Sep '06

10 Sep '06

I have a fraction of code using BGL that the MS compiler has for some reason optimized into oblivion. While this is not a boost problem per se, since it appears in a compiler I have not had problems with, I suspect all those templates are confusing the MS compiler somehow. The symptom is that when I get a property of an edge, then test on that property and branch, the test is removed from the compiled assembly. Here is the code: //header typedef property<edge_weight_t, unsigned> EdgeCountProperty; typedef adjacency_list<vecS, vecS, bidirectionalS, no_property, EdgeCountProperty> Graph; typedef graph_traits<Graph>::out_edge_iterator OutEdgeIter; ..... //code property_map<Graph, edge_weight_t>::type wgt = get(edge_weight, g); OutEdgeIter ei, ee, eMax; unsigned nTopWgt = 0; unsigned nChk = 0; for(tie(ei, ee) = out_edges(v, g), eMax = ee; ei != ee; ++ei) { nChk = wgt[*ei]; ////////This 'if' is skipped, the code acts like nChk > nTopWgt is always TRUE, even when it ain't!! if(nChk > nTopWgt); { nTopWgt = nChk; eMax = ei; } } Here is the assembly: OutEdgeIter ei, ee, eMax; 00420514 lea ecx,[ei] 00420517 call boost::detail::out_edge_iter<std::vector<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,unsigned int,boost::detail::edge_desc_impl<boost::bidirectional_tag,unsigned int>,int>::out_edge_iter<std::vector<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::e 0042051C lea ecx,[ee] 0042051F call boost::detail::out_edge_iter<std::vector<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,unsigned int,boost::detail::edge_desc_impl<boost::bidirectional_tag,unsigned int>,int>::out_edge_iter<std::vector<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::e 00420524 lea ecx,[eMax] 00420527 call boost::detail::out_edge_iter<std::vector<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,unsigned int,boost::detail::edge_desc_impl<boost::bidirectional_tag,unsigned int>,int>::out_edge_iter<std::vector<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::e unsigned nTopWgt = 0; 0042052C mov dword ptr [nTopWgt],0 unsigned nChk = 0; 00420533 mov dword ptr [nChk],0 for(tie(ei, ee) = out_edges(v, g), eMax = ee; ei != ee; ++ei) 0042053A mov eax,dword ptr [g] 0042053D push eax 0042053E mov ecx,dword ptr [v] 00420541 mov edx,dword ptr [ecx] 00420543 push edx 00420544 lea eax,[ebp-198h] 0042054A push eax 0042054B call @ILT+5420(??$out_edges@Uconfig@?$adj_list_gen@ V?$adjacency_list@UvecS@boost@@U12@UbidirectionalS@2@Uno_property@2@U ?$property@W4edge_weight_t@boost@@IUno_property@2@@2@U42@UlistS@2@@boost@@ UvecS@2@U32@UbidirectionalS@2@Uno_property@2@U?$property@ W4edge_weight_t@boost@@IUno_property@2@@2@U52@UlistS@2@@detail@boost@@ U?$bidirectional_graph_helper_with_property@Uconfig@?$adj_list_gen@ V?$adjacency_list@UvecS@boost@@U12@UbidirectionalS@2@Uno_property@2@U ?$property@W4edge_weight_t@boost@@IUno_property@2@@2@U42@UlistS@2@@boost@@ UvecS@2@U32@UbidirectionalS@2@Uno_property@2@U?$property@ W4edge_weight_t@boost@@IUno_property@2@@2@U52@UlistS@2@@detail@boost @@@4@@boost@@YA?AU?$pair@U?$out_edge_iter@Viterator@?$vector@ V?$sei_@IViterator@?$list@U?$list_edge@IU?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@boost@@V?$allocator@U?$list_edge@ IU?$property@W4edge_weight_t@boost@@IUno_property@2 @@boost@@@boost@@@std@@@std@@U?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@detail@boost@@V?$allocator@ 00420550 add esp,0Ch 00420553 push eax 00420554 lea ecx,[ee] 00420557 push ecx 00420558 lea edx,[ei] 0042055B push edx 0042055C lea eax,[ebp-1A8h] 00420562 push eax 00420563 call @ILT+4705(??$tie@U?$out_edge_iter@Viterator@?$vector@ V?$sei_@IViterator@?$list@U?$list_edge@IU?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@boost@@V?$allocator@U?$list_edge@ IU?$property@W4edge_weight_t@boost@@IUno_property@2 @@boost@@@boost@@@std@@@std@@U?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@detail@boost@@V?$allocator@V ?$sei_@IViterator@?$list@U?$list_edge@IU?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@boost@@V?$allocator@U?$list_edge@ IU?$property@W4edge_weight_t@boost@@IUno_property@2 @@boost@@@boost@@@std@@@std@@U?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@detail@boost@@@std@@@std@@ IV?$edge_desc_impl@Ubidirectional_tag@boost@@I@detail@boost@@H@detail @boost@@U123@@tuples@boost@@YA?AV?$tuple@AAU ?$out_edge_iter@Viterator@?$vector@V?$sei_@IViterator@?$list@U?$list_edge@IU ?$property@W4edge_weight_t@boost@@IUno_property@2@@boost@@@boost@@ V?$allocator@U?$list_edge@IU?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@boost@@@std@@@std@ 00420568 add esp,0Ch 0042056B mov ecx,eax 0042056D call @ILT+2355(??$?4U?$out_edge_iter@Viterator@?$vector@ V?$sei_@IViterator@?$list@U?$list_edge@IU?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@boost@@V?$allocator@U?$list_edge@ IU?$property@W4edge_weight_t@boost@@IUno_property@2 @@boost@@@boost@@@std@@@std@@U?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@detail@boost@@V?$allocator@V ?$sei_@IViterator@?$list@U?$list_edge@IU?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@boost@@V?$allocator@U?$list_edge@ IU?$property@W4edge_weight_t@boost@@IUno_property@2 @@boost@@@boost@@@std@@@std@@U?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@detail@boost@@@std@@@std@@ IV?$edge_desc_impl@Ubidirectional_tag@boost@@I@detail@boost@@H@detail @boost@@U012@@?$tuple@AAU?$out_edge_iter@Viterator@?$vector@ V?$sei_@IViterator@?$list@U?$list_edge@IU?$property@W4edge_weight_t@boost@@ IUno_property@2@@boost@@@boost@@V?$allocator@U?$list_edge@ IU?$property@W4edge_weight_t@boost@@IUno_property@2 @@boost@@@boost@@@std@@@std@@U?$property@W4edge_w 00420572 mov ecx,dword ptr [ee] 00420575 mov dword ptr [eMax],ecx 00420578 mov edx,dword ptr [ebp-24h] 0042057B mov dword ptr [ebp-34h],edx 0042057E jmp foo+0B8h (420588h) 00420580 lea ecx,[ei] 00420583 call boost::iterator_facade<boost::detail::out_edge_iter<std::vector<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,unsigned int,boost::detail::edge_desc_impl<boost::bidirectional_tag,unsigned int>,int>,boost::detail::edge_desc_impl<boost::bidirectional_tag,unsigned int>,boost::random_access_traversal_tag,bo 00420588 lea eax,[ee] 0042058B push eax 0042058C lea ecx,[ei] 0042058F push ecx 00420590 call boost::operator!=<boost::detail::out_edge_iter<std::vector<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,unsigned int,boost::detail::edge_desc_impl<boost::bidirectional_tag,unsigned int>,int>,boost::detail::edge_desc_impl<boost::bidirectional_tag,unsigned int>,boost::random_access_traversal_tag,boost:: 00420595 add esp,8 00420598 movzx edx,al 0042059B test edx,edx 0042059D je foo+114h (4205E4h) { nChk = wgt[*ei]; 0042059F lea eax,[ebp-180h] 004205A5 push eax 004205A6 lea ecx,[ei] 004205A9 call boost::iterator_facade<boost::detail::out_edge_iter<std::vector<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::detail::sei_<unsigned int,std::list<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> >,std::allocator<boost::list_edge<unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property> > > >::iterator,unsigned int,boost::detail::edge_desc_impl<boost::bidirectional_tag,unsigned int>,int>,boost::detail::edge_desc_impl<boost::bidirectional_tag,unsigned int>,boost::random_access_traversal_tag,bo 004205AE sub esp,0Ch 004205B1 mov ecx,esp 004205B3 mov edx,dword ptr [eax] 004205B5 mov dword ptr [ecx],edx 004205B7 mov edx,dword ptr [eax+4] 004205BA mov dword ptr [ecx+4],edx 004205BD mov eax,dword ptr [eax+8] 004205C0 mov dword ptr [ecx+8],eax 004205C3 lea ecx,[wgt] 004205C6 call boost::adj_list_edge_property_map<boost::bidirectional_tag,unsigned int,unsigned int &,unsigned int,boost::property<enum boost::edge_weight_t,unsigned int,boost::no_property>,enum boost::edge_weight_t>::operator[] (41E2E3h) ;;LOOK MA! NO 'cmp' INSTRUCTION! WHERE'D IT GO?!!? 004205CB mov ecx,dword ptr [eax] 004205CD mov dword ptr [nChk],ecx if(nChk > nTopWgt); { nTopWgt = nChk; 004205D0 mov eax,dword ptr [nChk] 004205D3 mov dword ptr [nTopWgt],eax eMax = ei; 004205D6 mov eax,dword ptr [ei] 004205D9 mov dword ptr [eMax],eax 004205DC mov ecx,dword ptr [ebp-14h] 004205DF mov dword ptr [ebp-34h],ecx } } I repeat that this is not a boost issue per se but this bug might show up more often when compiling all those templates ... Eric

2 1

How to get a graph with edges sorted by weight (or some other property) ?
by Eric Fowler 09 Sep '06

09 Sep '06

Title says it all, I have a graph with weighted edges, and want to iterate through them in order of weights. To make it more interesting the edges are defined with setS and must be - actually, I could work around - but it would be more convenient to keep setS. A brief example would help. Thanks. Eric

2 1

[regex] Perl regex special characters
by Andriy Tylychko (mail.ru) 08 Sep '06

08 Sep '06

Hi <http://www.boost.org/libs/regex/doc/syntax_perl.html> http://www.boost.org/libs/regex/doc/syntax_perl.html says: Perl Regular Expression Syntax In Perl regular expressions, all characters match themselves except for the following special characters: .[{()\*+?|^$ Q: what about "]}" symbols? Best regards, Andriy Tylychko, telia(a)vichnavich.com www.vichnavich.com <http://www.vichnavich.com/>

3 3

How to get a graph that does not accept parallel edges?
by Eric Fowler 08 Sep '06

08 Sep '06

How do I declare a graph that does not allow parallel edges? I have come up with this but IMO it is sort of, well, kludgey: typedef adjacency_list<setS, vecS, bidirectionalS> Graph; This works because std::set does not like multiple entries. But what if for performance reasons (say) I want a listS or vecS instead of setS? In adjacency_list.hpp I find: template <> struct parallel_edge_traits<setS> { typedef disallow_parallel_edge_tag type; }; Which suggest the existence of a more elegant mechanism. Anybody know what that is? Eric

3 2

Re: [Boost-users] How to use bind/lambda in a conditional
by Baranowski, Daniel 08 Sep '06

08 Sep '06

> From: "Andriy Tylychko > > Baranowski, Daniel > > std::for_each(myVector.begin(), myVector.end(), > boost::lambda::if_then(boost::lambda::_1 == 3, [...])); > > Best regards, > Andriy Tylychko Thanks Andriy! That definitely got me on the correct track! It still took me awhile, but I got it! It looks so simple now. Anyhow, since I'm sure I'm not the only person that will ever have this problem when learning to use bind and lambda, here is a sample program that I wrote in vc8 to figure out the solution: #include <vector> #include <iostream> #include <conio.h> #include <boost/lambda/lambda.hpp> #include <boost/lambda/if.hpp> #include <boost/lambda/bind.hpp> #include <algorithm> using namespace std; using namespace boost; using boost::lambda::_1; using boost::lambda::if_then; struct MyObjectClass { MyObjectClass(int Data) : MyData(Data) { }; int GetData() const { return MyData; }; int MyData; }; class TestClass { typedef vector<MyObjectClass> t_ObjVector; t_ObjVector myVector; void PrintObj(const MyObjectClass & MyObj) { cout << MyObj.GetData() << endl; } void PrintInt(int MyInt) { cout << MyInt << endl; } public: TestClass() { myVector.push_back( MyObjectClass(1) ); myVector.push_back( MyObjectClass(2) ); myVector.push_back( MyObjectClass(2) ); myVector.push_back( MyObjectClass(3) ); myVector.push_back( MyObjectClass(3) ); myVector.push_back( MyObjectClass(4) ); } void RunTest() { // regular for loop t_ObjVector::iterator end = myVector.end(); t_ObjVector::iterator itr = myVector.begin(); for(itr; itr != end; ++itr) { if((*itr).GetData() == 3) PrintObj(*itr); } // for_each using lambda concepts for_each(myVector.begin(), myVector.end(), if_then(bind(&MyObjectClass::GetData, _1) == 3, bind(&TestClass::PrintObj, this, _1) ) ); } }; int main (int argc, char **argv) { TestClass Test; // Run the test Test.RunTest(); getch(); return 0; } Thanks again for the help! Daniel ********************************************************************************************** Disclaimer - This email and any files transmitted with it are proprietary and may contain privileged or copyright information. You must not present this message to another party without gaining permission from the sender. If you are not the intended recipient you must not copy, distribute or use this email or the information contained in it for any purpose other than to notify us. If you have received this message in error, please notify the sender immediately, and delete this email from your system. We do not guarantee that this material is free from viruses or any other defects although due care has been taken to minimize the risk. eSafe scanned this email for viruses, vandals and malicious contentAny views expressed in this message are those of the individual sender, except where the sender specifically states them to be the views of LSI. **********************************************************************************************

1 0

Re: [Boost-users] [string_algo] wildcard support?
by james.jones＠firstinvestors.com 08 Sep '06

08 Sep '06

From: "Richard Dingwall" <rdingwall(a)gmail.com> > Cheers. I was rather hoping not to have to use regular expressions; > they're kinda beyond the intended users of my program (it's for a > user-defined filter function, and I don't expect them to be familiar > with regex syntax). > > I cheaped out and used an old C wildcmp(wild.c_str(), text.c_str()) > method instead. Just because YOU use regex internally doesn't mean to have to expose full regex capabilities to the users. You could, for example, use a */? wildcard arrangement like DOS or bash shell uses, use a regex to verify that the wildcard pattern was valid, and then translate this into a real regex for the internal search. Use Boost!! Don't cheap-out. :) - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

1 0

[serialization] different behaviour between xml_wiarchive and binary_wiarchive
by Oliver Mutz 08 Sep '06

08 Sep '06

In my application I'm trying to serialize data alternatively to xml_wiarchive or binary_wiarchive. Writing and reading XML works without any problems. Binary writing seems to work too, but reading the file throws an exception with exception_code 'unregistered_class'. What I do is reading the XML data, writing binary and reading binary back in. I thought there should be no difference which kind of archive I use. Am I missing a point? I would be thankful for any hint. I know that it is hard to guess where the problem might be without seeing any code, but I by now I was not able to create some simple example which shows the same behaviour. I'm using Windows XP (SP2) with MSVC 8.0. Thanks. Oliver

2 4

How to use bind/lambda in a conditional for_each?
by Baranowski, Daniel 08 Sep '06

08 Sep '06

Hey all! I've really enjoyed using boost::bind for calling member functions and such. I wish I had found this earlier! Anyhow, I'm trying to write for_each statement that only passes the object to a function if certain conditions are met. Unfortunately, I'm not well versed enough in boost::bind (and I've never used the lambda library) so I'm not sure how to do this! Can someone lend me a hand? I couldn't find anything in the mail archives. If I were writing a regular for-loop, this is how it would look: vector<MyObjClass> myVector; myVector.push_back(MyObjClass(2)); myVector.push_back(MyObjClass(3)); myVector.push_back(MyObjClass(3)); myVector.push_back(MyObjClass(5)); myVector.push_back(MyObjClass(6)); vector<MyObjClass>::iterator end = myVector.end(); vector<MyObjClass>::iterator itr; for(itr = myVector.begin(); itr != end; ++itr) { if((*itr).GetValue() == 3) ProcessingFunction(*itr); } And here's the for_each that just passes every object into the processing function: // From inside a function in a class called ThisClass vector<MyObjClass> myVector; myVector.push_back(MyObjClass(2)); myVector.push_back(MyObjClass(3)); myVector.push_back(MyObjClass(3)); myVector.push_back(MyObjClass(5)); myVector.push_back(MyObjClass(6)); vector<MyObjClass>::iterator begin = myVector.begin(); vector<MyObjClass>::iterator end = myVector.end(); for_each(begin, end, boost::bind(&ThisClass::ProcessingFunction, this, _1)); So I guess the question is, how do I add the condition into the for_each? I know there's got to be a way! Thanks for any help! Daniel ********************************************************************************************** Disclaimer - This email and any files transmitted with it are proprietary and may contain privileged or copyright information. You must not present this message to another party without gaining permission from the sender. If you are not the intended recipient you must not copy, distribute or use this email or the information contained in it for any purpose other than to notify us. If you have received this message in error, please notify the sender immediately, and delete this email from your system. We do not guarantee that this material is free from viruses or any other defects although due care has been taken to minimize the risk. eSafe scanned this email for viruses, vandals and malicious contentAny views expressed in this message are those of the individual sender, except where the sender specifically states them to be the views of LSI. **********************************************************************************************

3 2

[Signals] Relationships to other libraries and terms
by Scott Meyers 08 Sep '06

08 Sep '06

I've been trying to make sense of Boost.Signals, especially in terms of some other libraries I'm familiar with. Part of the problem is terminology, I think, e.g., callbacks, slots, and delegates (as in .NET, but also as used by some for bound member function pointers (e.g.,http://www.codeproject.com/cpp/FastDelegate.asp)) I'm hoping people will take a look at what follows, correct any errors they see, and maybe lend additional insight so that my understanding will be improved. We start with "callable entities" -- things that can be called, e.g., function pointers, function objects, bound member functions, etc. As I understand it: - A callback (function or object) is a callable entity - A slot in Boost.Signals is a callable entity - boost::bind and boost::lambda create callable entities. - A boost::function object stores a callable entity. We also have collections of callable entities: - A .NET delegate is a collection of 0 or more callable entities with a given signature. - A signal in Boost.Signals is a collection of 0 or more callable entities with signatures compatible with a given signature. Objects of these collection types are also callable entities: - When a Boost.Signals signal or a .NET delegate is called, it invokes the callable entities it contains. Is that correct? Also, does anybody know where the name "slot" comes from in this context? I've found this term to be a stumbling block for trying to understand this stuff. Thanks, Scott

5 6

[asio] tcp::socket state query?
by Rod Morison 08 Sep '06

08 Sep '06

Is there way to query the local status of a socket in asio? Or, is there another technique for state & error management? For example, something lick the TcpSocket state in Qt v4. I.e., AbstractSocket::UnconnectedState 0 The socket is not connected. QAbstractSocket::HostLookupState 1 The socket is performing a host name lookup. QAbstractSocket::ConnectingState 2 The socket has started establishing a connection. QAbstractSocket::ConnectedState 3 A connection is established. QAbstractSocket::BoundState 4 The socket is bound to an address and port (for servers). QAbstractSocket::ClosingState 6 The socket is about to close (data may still be waiting to be written). QAbstractSocket::ListeningState 5 For internal use only. (from http://doc.trolltech.com/4.2/qabstractsocket.html#SocketState-enum) Here's why I'm asking: I'm looking at the chat_client.cpp example.The socket is connected via async_connect in the chat_client constructor. If the first resolved endpoint fails to connect the handler tries an async_connect with the next endpoint. First question: Are the async requests initiated under an io_servce (and executed by the run() method) queued in the order they are called via async_xxx calls? (I'm assuming/hoping that's a yes.) So the issue I have with the chat_client design is as follows: because iterating the endpoint list (to connect the socket) is in a handler, what if another socket operation slipped in ahead of that handler, say a write (assuming the first endpoint failed)? I'd want the do_write() function to be able to check the socket state. I can do the state control myself via the handlers and a class state variable, but is there a better way? (Similarly, this app can happily go writing to an unconnected socket--I realize it's a sample, not production code, but I'm thinking through my _real_ app here.) Hope this makes sense, Rod

1 0

[iostreams] Building with vacpp toolset
by Patrik Jonsson 07 Sep '06

07 Sep '06

Hi I'm trying to build boost with the vacpp (IBM Visual Age C++) compilers, but the iostreams library won't build. It appears to be missing include files zlib.h and bzlib.h: xlC -c -I/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1 -qNOOPTimize -qnoinline -g -qfullpath -qnotempinc -qfuncsect -qeh -qrtti -I"bin/boost/libs/iostreams/build" -I"/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1" -I"/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1" -o "bin/boost/libs/iostreams/build/libboost_iostreams.a/vacpp/debug/bzip2.o" "/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1/libs/iostreams/build/../src/bzip2.cpp" ...failed xlc-C++-action bin/boost/libs/iostreams/build/libboost_iostreams.a/vacpp/debug/bzip2.o... xlc-C++-action bin/boost/libs/iostreams/build/libboost_iostreams.a/vacpp/debug/zlib.o "/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1/libs/iostreams/build/../src/zlib.cpp", line 18.10: 1540-0836 (S) The #include file "zlib.h" is not found. xlC -c -I/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1 -qNOOPTimize -qnoinline -g -qfullpath -qnotempinc -qfuncsect -qeh -qrtti -I"bin/boost/libs/iostreams/build" -I"/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1" -I"/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1" -o "bin/boost/libs/iostreams/build/libboost_iostreams.a/vacpp/debug/zlib.o" "/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1/libs/iostreams/build/../src/zlib.cpp" ...failed xlc-C++-action bin/boost/libs/iostreams/build/libboost_iostreams.a/vacpp/debug/zlib.o... ...skipped <@boost!libs!iostreams!build/libboost_iostreams.a/vacpp/debug>libboost_iostreams-xlc-d-1_33_1.a for lack of <@boost!libs!iostreams!build/libboost_iostreams.a/vacpp/debug>libboost_iostreams-xlc-d-1_33_1.a(bzip2.o)... ...skipped <@boost!lib>libboost_iostreams-xlc-d-1_33_1.a for lack of <@boost!libs!iostreams!build/libboost_iostreams.a/vacpp/debug>libboost_iostreams-xlc-d-1_33_1.a... xlc-C++-action bin/boost/libs/iostreams/build/libboost_iostreams.a/vacpp/debug/threading-multi/bzip2.o "/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1/libs/iostreams/build/../src/bzip2.cpp", line 18.10: 1540-0836 (S) The #include file "bzlib.h" is not found. This is with xlC 8.0.0.0 on an IBM SP5 running AIX5. Any hints for resolving this would be appreciated. Thank you, /Patrik Jonsson

1 0

[wave] Building with vacpp toolset
by Patrik Jonsson 07 Sep '06

07 Sep '06

Hi I'm trying to build boost with the vacpp (IBM Visual Age C++) compilers, but the wave library won't build: xlc-C++-action bin/boost/libs/wave/build/libboost_wave.a/vacpp/debug/instantiate_cpp_grammar.o "/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1/boost/wave/cpplexer/cpp_lex_iterator.hpp", line 53.13: 1540-0038 (S) The name "typename TokenT::position_type" is not a type. <see end of message for the rest of the error, for that file> This is with xlC 8.0.0.0 on an IBM SP5 running AIX5. Any hints for resolving this would be appreciated. Thank you, /Patrik Jonsson ... "/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1/boost/wave/util/functor_input.hpp", line 43.26: 1540-0700 (I) The previous message was produced while processing "class boost::wave::cpplexer::impl::lex_iterator_functor_shim<boost::wave::cpplexer::lex_token<boost::wave::util::file_position<boost::wave::util::flex_string<char,std::char_traits<char>,std::allocator<char>,boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char,std::allocator<char> >,char *> > > > >". "/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1/boost/wave/util/functor_input.hpp", line 41.11: 1540-0700 (I) The previous message was produced while processing "class boost::wave::util::functor_input::inner<boost::wave::cpplexer::impl::lex_iterator_functor_shim<boost::wave::cpplexer::lex_token<boost::wave::util::file_position<boost::wave::util::flex_string<char,std::char_traits<char>,std::allocator<char>,boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char,std::allocator<char> >,char *> > > > > >". "/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1/boost/spirit/iterator/multi_pass.hpp", line 805.7: 1540-0700 (I) The previous message was produced while processing "class boost::spirit::multi_pass<boost::wave::cpplexer::impl::lex_iterator_functor_shim<boost::wave::cpplexer::lex_token<boost::wave::util::file_position<boost::wave::util::flex_string<char,std::char_traits<char>,std::allocator<char>,boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char,std::allocator<char> >,char *> > > > >,boost::wave::util::functor_input,boost::spirit::multi_pass_policies::ref_counted,boost::spi...". "/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1/boost/wave/cpplexer/cpp_lex_iterator.hpp", line 118.7: 1540-0700 (I) The previous message was produced while processing "class boost::wave::cpplexer::lex_iterator<boost::wave::cpplexer::lex_token<boost::wave::util::file_position<boost::wave::util::flex_string<char,std::char_traits<char>,std::allocator<char>,boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char,std::allocator<char> >,char *> > > > >". "/project/projectdirs/mp363/sunrise/pbuild/boost_1_33_1/boost/wave/grammars/cpp_grammar_gen.hpp", line 68.8: 1540-0700 (I) The previous message was produced while processing "struct boost::wave::grammars::cpp_grammar_gen<boost::wave::cpplexer::lex_iterator<boost::wave::cpplexer::lex_token<boost::wave::util::file_position<boost::wave::util::flex_string<char,std::char_traits<char>,std::allocator<char>,boost::wave::util::CowString<boost::wave::util::AllocatorStringStorage<char,std::allocator<char> >,char *> > > > > >".

1 0

ptr_container compiles slow
by LionAM 07 Sep '06

07 Sep '06

Hello! I'm using Visual C++ 6 (for an MFC-Project). When I include <boost\ptr_container\ptr_vector.hpp> in an Sourcefile, it takes over 11 seconds to compile (without less than 1 second!) If I really wanted to use ptr_containers in my Project, I would have to include it in many files. But then compilation takes too long... Are there any possibilities to speed this up? Alex -- View this message in context: http://www.nabble.com/ptr_container-compiles-slow-tf2225929.html#a6168364 Sent from the Boost - Users forum at Nabble.com.

5 13

[serialization] Newbie question on serializing a derived class
by David Pettigrew 07 Sep '06

07 Sep '06

I have a class that is derived from a GUI framework class and it seems like the serialization library will attempt to serialize the parent class but I don't own that classes code. I get an error "'GUIWidget::GUIWidget' : cannot access private member declared in class 'GUIWidget'". I do not know why it is looking in the parent class since I do not do anything with the base_object. Is there a way to get around this issue? I am doing somethine wrong? Here is the code, #include <boost/archive/tmpdir.hpp> #include <boost/archive/text_wiarchive.hpp> #include <boost/archive/text_woarchive.hpp> #include <boost/serialization/vector.hpp> #include <fstream> #include <iostream> namespace boost { namespace serialization { class access; } } class MyClass: public GUIWidget { public: MyClass(); ~MyClass(); private: std::vector<LSLogEntry> m_logEntryList; // LSLogEntry has wstring members. friend class boost::serialization::access; // When the class Archive corresponds to an output archive, the // & operator is defined similar to <<. Likewise, when the class Archive // is a type of input archive the & operator is defined similar to >>. template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & m_logEntryList; } }; // free functions void save(const MyClass& eftw, const char * filename) { std::string fullPath(boost::archive::tmpdir()); fullPath += filename; // save the schedule try { // make an archive std::wofstream ofs(fullPath.c_str()); boost::archive::text_woarchive oa(ofs); oa << eftw; } catch (boost::archive::archive_exception e) { wcout << e.what(); } } void load(MyClass& eftw, const char * filename) { std::string fullPath(boost::archive::tmpdir()); fullPath += filename; // Restore the data try { // open the archive std::wifstream ifs(fullPath.c_str()); boost::archive::text_wiarchive ia(ifs); // restore from the archive ia >> eftw; } catch (boost::archive::archive_exception e) { wcout << e.what(); } } Thanks, David

2 1

Why am I not hearing that my edge has already been added?
by Eric Fowler 07 Sep '06

07 Sep '06

I am writing a simple graph app. The edges have an unsigned integer property that is incremented every time I "add" an edge from one given node to another, thus, any given edge has an "instance" of at least one, but if there are, say, three edges from node A to node B, edge A->B has nInstances == 3. To do this I would like to attempt to add an edge between nodes, and if the edge has already been added, just bump the counter for that edge, otherwise, set the counter to 1. My basic approach is to call tie(edge_iter, boolflag) = add_edge(v0, v1, graph). If boolvar is set to false then the edge already was in the graph. The problem is that add_edge() never clears boolvar - it is always true, even when I coerce redundant edges, as in the following code: #include "stdafx.h" #include <boost/graph/adjacency_list.hpp> #include <boost/property_map.hpp> using namespace boost; using namespace std; //Don't worry about the vertex property, it is irrelevant ... struct vertex_char_t { typedef vertex_property_tag kind; }; typedef property<vertex_char_t, char> VertexCharProperty; typedef adjacency_list<vecS, vecS, directedS, VertexCharProperty> Graph; int _tmain(int argc, _TCHAR* argv[]) { Graph g(256); property_map<Graph, vertex_char_t>::type vert_char = get(vertex_char_t(), g); typedef graph_traits<Graph>::vertex_descriptor Vertex; Vertex va, vb; typedef graph_traits<Graph>::edge_descriptor Edge; Edge ei; bool bNotPresent = false; for(unsigned i = 0; i < 256; ++i) { va = vertex(0, g); vb = vertex(1, g); /* ***ADD REDUNDANT EDGES BETWEEN NODES 0, 1 */ tie(ei, bNotPresent) = add_edge(va, vb, g); //BUT MY FLAG ALWAYS == true, why? if(!bNotPresent) break; } return 0; }

2 2

[variant] MSVC7.1 produces an Internal Compiler
by Yan Zhang 07 Sep '06

07 Sep '06

I had the same problem with MSV7.1 and resolved it by using project setting: /Gm, which is under C/C++/Code Generation. Basically, you need to reduce the debug information. Yan -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of boost-users-request(a)lists.boost.org Sent: Tuesday, September 05, 2006 4:46 PM To: boost-users(a)lists.boost.org Subject: Boost-users Digest, Vol 1018, Issue 3 Send Boost-users mailing list submissions to boost-users(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit http://lists.boost.org/mailman/listinfo.cgi/boost-users or, via email, send a message with subject or body 'help' to boost-users-request(a)lists.boost.org You can reach the person managing the list at boost-users-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost-users digest..." Today's Topics: 1. [BGL] filtered graph missing vertex function (moritz Hilger) 2. Re: Boost.signals with -pthread (Ra?l Huertas) 3. Re: Building Tests With Boost Test (Roman Neuhauser) 4. Re: [BGL] filtered graph missing vertex function (Stephan Diederich) 5. [variant] MSVC7.1 produces an Internal Compiler error when variant gets too complicated (Eoin) 6. portable way to determine return type from class member function (Peter Piehler) 7. Re: [test] Running either unit tests or normal program based off of command line switches (Jason House) 8. Re: [BGL] filtered graph missing vertex function (moritz Hilger) 9. Using boost::enable_if with template copy constructors (Tim Robertson) ---------------------------------------------------------------------- Message: 1 Date: Tue, 5 Sep 2006 20:23:46 +0200 From: "moritz Hilger" <moritz.hilger(a)gmail.com> Subject: [Boost-users] [BGL] filtered graph missing vertex function To: boost-users(a)lists.boost.org Message-ID: <b48649090609051123r104f6e9dtc91a992f64bf9e9c(a)mail.gmail.com> Content-Type: text/plain; charset="iso-8859-1" is there a particular reason that the filtered graph is missing a vertex_descriptor vertex(vertices_size_type, const& filtered_graph) function? of course this would return exactly the same as the one of the underlying graph, nevertheless it would be handy for code treating filtered graphs the same way as normal ones. greetings moritz

3 5

Using boost::enable_if with template copy constructors
by Tim Robertson 07 Sep '06

07 Sep '06

Hi, Can anyone explain why the following won't compile (using g++ 3.3.2 under Linux): #include <boost/utility/enable_if.hpp> #include <boost/type_traits/is_convertible.hpp> using namespace std; struct Foo { Foo() {} template <typename T> Foo(T const & src, typename boost::enable_if< boost::is_convertible<T,Foo>, void >::type * dummy = 0) { int i = 1; // filler. } template <typename T> Foo(T const & src, typename boost::disable_if< boost::is_convertible<T,Foo>, void >::type * dummy = 0) { int i = 2; // ditto. } }; int main() { Foo f; Foo f2(f); return 0; }; When I attempt to compile this code with g++ 3.3.2, I get the following error messages: /boost/boost/type_traits/is_convertible.hpp: In instantiation of `boost::disable_if<boost::is_convertible<Foo, Foo>, void>': /boost/boost/type_traits/is_convertible.hpp:128: instantiated from `boost::detail::is_convertible_basic_impl<Foo&, Foo>' /boost/boost/type_traits/is_convertible.hpp:228: instantiated from `boost::detail::is_convertible_impl<Foo, Foo>' test.cpp:36: instantiated from `boost::detail::is_convertible_impl_dispatch<Foo, Foo>' test.cpp:36: instantiated from `boost::is_convertible<Foo, Foo>' test.cpp:36: instantiated from `boost::enable_if<boost::is_convertible<Foo, Foo>, void>' test.cpp:36: instantiated from here /boost/boost/type_traits/is_convertible.hpp:128: error: `value' is not a member of type `boost::is_convertible<Foo, Foo>' /boost/boost/type_traits/is_convertible.hpp: In instantiation of `boost::detail::is_convertible_basic_impl<Foo&, Foo>': /boost/boost/type_traits/is_convertible.hpp:228: instantiated from `boost::detail::is_convertible_impl<Foo, Foo>' test.cpp:36: instantiated from `boost::detail::is_convertible_impl_dispatch<Foo, Foo>' test.cpp:36: instantiated from `boost::is_convertible<Foo, Foo>' test.cpp:36: instantiated from `boost::enable_if<boost::is_convertible<Foo, Foo>, void>' test.cpp:36: instantiated from here /boost/boost/type_traits/is_convertible.hpp:128: error: initializing argument 1 of `static yes_type boost::detail::checker<T>::_m_check(T, int) [with T = Foo]' If I use boost::is_same<> in place of boost::is_convertible<>, everything is fine. Is there something that I'm missing, or is this a bug? Thanks in advance, Tim

2 8

[tuple] weird compile error with VC-8_0
by imre＠u-tx.com 07 Sep '06

07 Sep '06

Hi, I am getting this error message, when using boost::tuple: include\boost\tuple\detail\tuple_basic.hpp(373) : error C2039: 'tail' : is not a member of 'boost::tuples::cons<HT,TT>' 1> with 1> [ 1> HT=UTX::DB::nulled_type<unsigned char>, 1> TT=boost::tuples::null_type 1> ] The referred line is the templated constructor of the non-specialised struct cons: template <class HT2, class TT2> cons( const cons<HT2, TT2>& u ) : head(u.head), tail(u.tail) {} So it seems that somehow the non-specialised method is called for the specialised template instantiation. Has anybody seen something like this? Is there a way to circumvent it? Thx ImRe

2 1

[thread]MFC based console application cause memory leak?
by tankbattle 07 Sep '06

07 Sep '06

I’ve written a MFC based console application to test boost.thread library. However, IDE suggested that there are memory leaks in the program. All that I’ ve done is creating a class A which implements operator () and declared an instance of boost::thread which make use of A. How can that make memory leak? My IDE is vs.net 2003 and my OS is windows xp sp1. My code is as follows: // threadmemleak.cpp : // #include "stdafx.h" #include "threadmemleak.h" #ifdef _DEBUG #define new DEBUG_NEW #endif #include <boost\thread\thread.hpp> class A { public: A() { } void operator() () { //Sleep(1000); } }; // Single application object CWinApp theApp; using namespace std; int _tmain(int argc, TCHAR* argv[], TCHAR* envp[]) { int nRetCode = 0; // Initialize MFC and display error on failure if (!AfxWinInit(::GetModuleHandle(NULL), NULL, ::GetCommandLine(), 0)) { // TODO: Correct your code so as to meet your need _tprintf(_T("Fatal error: MFC initialization failed\n")); nRetCode = 1; } else { // TODO: Write your own code A a; boost::thread thread1(a); thread1.join(); } return nRetCode; } and output of IDE is Detected memory leaks! Dumping objects -> {153} normal block at 0x00376A70, 24 bytes long. Data: < \ > B0 5C 14 00 FF FF FF FF 00 00 00 00 00 00 00 00 {152} normal block at 0x00376CE0, 8 bytes long. Data: <pj7 > 70 6A 37 00 01 CD CD CD Object dump complete.

4 3