- Boost-users - lists.boost.org

Egg Review ends today
by dan marsden 20 Apr '08

20 Apr '08

The review of the Egg library by Shunsuke Sogame ends today. If anybody is still considering doing a review, please do still submit it, even if it is a few days late. It will take a short while for me to summarise the discussion during the review period. The review result will be posted shortly. Thanks Dan Marsden Review Manager __________________________________________________________ Sent from Yahoo! Mail. A Smarter Email http://uk.docs.yahoo.com/nowyoucan.html

1 0

release 1_34 for borland
by Totte Karlsson 20 Apr '08

20 Apr '08

Hi I want to use boost threads classes with borland and I found that the latest release don't support borland compiler. How or where can I download a windows installer for boost release 1_34 ? thanks -totte

2 1

Re: [Boost-users] [multi_index] custom template class for handle multi_index map
by damny＠web.de 20 Apr '08

20 Apr '08

hi joaquin, a) here's a ready to use code snippet (see below). i isolating the problem by writing the snippet to the reuse of objects or using local temporary objects; i thought multi_index maps store copies of data objects, that where inserted. am i wrong? b) why it isn't possible to write (with "?" is a class attribute or template parameter; see snippet): template<typename MAP, typename ELM, typename SC1, typename IT1, typename SC2, typename IT2> const ELM *tCanMap<MAP,ELM,SC1,IT1,SC2,IT2>::getmapelm(STRING stNme) const { IT1 itr = this->_mpMap.get<?>().find(stNme); if ( itr != this->_mpMap.get<?>().end() ) { return &(*itr); } } thank you daniel //--- BEG ---------------------------------------------------------------------- #if defined(_Windows) || defined(_MSC_VER) || defined (__GNUC__) #define STRICT #include <windows.h> #endif #include <string> #define BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING #define BOOST_MULTI_INDEX_ENABLE_SAFE_MODE #include <boost/multi_index_container.hpp> #include <boost/multi_index/member.hpp> #include <boost/multi_index/mem_fun.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/hashed_index.hpp> //------------------------------------------------------------------------------ #define UINT32 unsigned long #define STRING std::string //------------------------------------------------------------------------------ // choose one //#define VERSION01 //#define VERSION02 //#define VERSION03 //#define VERSION04 //------------------------------------------------------------------------------ template<typename MAP, typename ELM, typename SC1, typename IT1, typename SC2, typename IT2> class tCanMap { protected: mutable MAP _mpMap; // map mutable SC1 *_scNme; // sorting criteria name ... have to init from derived class mutable SC2 *_scDat; // sorting criteria name ... have to init from derived class public: tCanMap (); MAP &getmap () const; UINT32 setmapelm (ELM val); #if defined (VERSION01) || defined (VERSION02) const ELM *getmapelm (STRING stNme) const; const ELM *getmapelm (UINT32 uiDat) const; #endif }; template<typename MAP, typename ELM, typename SC1, typename IT1, typename SC2, typename IT2> tCanMap<MAP,ELM,SC1,IT1,SC2,IT2>::tCanMap() { this->_scNme = NULL; this->_scDat = NULL; } template<typename MAP, typename ELM, typename SC1, typename IT1, typename SC2, typename IT2> MAP &tCanMap<MAP,ELM,SC1,IT1,SC2,IT2>::getmap() const { return this->_mpMap; } template<typename MAP, typename ELM, typename SC1, typename IT1, typename SC2, typename IT2> UINT32 tCanMap<MAP,ELM,SC1,IT1,SC2,IT2>::setmapelm(ELM val) { if (this!=NULL) { this->_mpMap.insert(val); return 0; } return 1; } #if defined (VERSION01) || defined (VERSION02) template<typename MAP, typename ELM, typename SC1, typename IT1, typename SC2, typename IT2> const ELM *tCanMap<MAP,ELM,SC1,IT1,SC2,IT2>::getmapelm(STRING stNme) const { try { if ( this!=NULL && this->_scNme!=NULL ) { IT1 itr = this->_scNme->find(stNme); if ( itr != this->_scNme->end() ) { return &(*itr); } } } catch(...) {} return NULL; } template<typename MAP, typename ELM, typename SC1, typename IT1, typename SC2, typename IT2> const ELM *tCanMap<MAP,ELM,SC1,IT1,SC2,IT2>::getmapelm(UINT32 uiDat) const { try { if ( this!=NULL && this->_scDat!=NULL ) { IT2 itr = this->_scDat->find(uiDat); if ( itr != this->_scDat->end() ) { return &(*itr); } } } catch(...) {} return NULL; } #endif //------------------------------------------------------------------------------ class cClass00 { private: STRING _nme; UINT32 _dat; public: cClass00() {} cClass00(STRING nme, UINT32 dat) { this->_nme=nme; this->_dat=dat; } STRING getnme () const { return this->_nme; } UINT32 getdat () const { return this->_dat; } }; typedef boost::multi_index_container < cClass00, boost::multi_index::indexed_by < boost::multi_index::hashed_unique < BOOST_MULTI_INDEX_CONST_MEM_FUN(cClass00,STRING,getnme) >, boost::multi_index::ordered_unique < BOOST_MULTI_INDEX_CONST_MEM_FUN(cClass00,UINT32,getdat) > > > mClass00; typedef mClass00::nth_index<0>::type mClass00ByNme; typedef mClass00ByNme::iterator mClass00ByNmeItr; typedef mClass00::nth_index<1>::type mClass00ByDat; typedef mClass00ByDat::iterator mClass00ByDatItr; //------------------------------------------------------------------------------ class cClass01 : public tCanMap<mClass00,cClass00,mClass00ByNme,mClass00ByNmeItr,mClass00ByDat,mClass00ByDatItr> { private: STRING _nme; UINT32 _dat; public: cClass01() {} cClass01(STRING nme, UINT32 dat) { this->_nme=nme; this->_dat=dat; this->_scNme = &(this->_mpMap.get<0>()); this->_scDat = &(this->_mpMap.get<1>()); } STRING getnme() const { return this->_nme; } UINT32 getdat() const { return this->_dat; } #if defined (VERSION03) || defined (VERSION04) const cClass00 *getmapelm (STRING stNme) const { try { if ( this!=NULL ) { mClass00ByNmeItr itr = this->_mpMap.get<0>().find(stNme); if ( itr != this->_mpMap.get<0>().end() ) { return &(*itr); } } } catch(...) {} return NULL; } const cClass00 *getmapelm (UINT32 uiDat) const { try { if ( this!=NULL ) { mClass00ByDatItr itr = this->_mpMap.get<1>().find(uiDat); if ( itr != this->_mpMap.get<1>().end() ) { return &(*itr); } } } catch(...) {} return NULL; } #endif }; typedef boost::multi_index_container < cClass01, boost::multi_index::indexed_by < boost::multi_index::hashed_unique < BOOST_MULTI_INDEX_CONST_MEM_FUN(cClass01,STRING,getnme) >, boost::multi_index::ordered_unique < BOOST_MULTI_INDEX_CONST_MEM_FUN(cClass01,UINT32,getdat) > > > mClass01; typedef mClass01::nth_index<0>::type mClass01ByNme; typedef mClass01ByNme::iterator mClass01ByNmeItr; typedef mClass01::nth_index<1>::type mClass01ByDat; typedef mClass01ByDat::iterator mClass01ByDatItr; //------------------------------------------------------------------------------ class cClass02 : public tCanMap<mClass01,cClass01,mClass01ByNme,mClass01ByNmeItr,mClass01ByDat,mClass01ByDatItr> { public: cClass02() { this->_scNme = &(this->_mpMap.get<0>()); this->_scDat = &(this->_mpMap.get<1>()); } #if defined (VERSION03) || defined (VERSION04) const cClass01 *getmapelm (STRING stNme) const { try { if ( this!=NULL ) { mClass01ByNmeItr itr = this->_mpMap.get<0>().find(stNme); if ( itr != this->_mpMap.get<0>().end() ) { return &(*itr); } } } catch(...) {} return NULL; } const cClass01 *getmapelm (UINT32 uiDat) const { try { if ( this!=NULL ) { mClass01ByDatItr itr = this->_mpMap.get<1>().find(uiDat); if ( itr != this->_mpMap.get<1>().end() ) { return &(*itr); } } } catch(...) {} return NULL; } #endif }; //------------------------------------------------------------------------------ int main(void) { #if defined (VERSION01) || defined (VERSION03) // works fine in any case cClass00 objClass00_01 = cClass00( "elm00_01", 1 ); cClass00 objClass00_02 = cClass00( "elm00_02", 2 ); cClass00 objClass00_03 = cClass00( "elm00_03", 3 ); cClass00 objClass00_04 = cClass00( "elm00_04", 4 ); cClass01 objClass01_01 = cClass01( "elm01_01", 11 ); cClass01 objClass01_02 = cClass01( "elm01_02", 12 ); objClass01_01.setmapelm( objClass00_01 ); objClass01_01.setmapelm( objClass00_02 ); objClass01_02.setmapelm( objClass00_03 ); objClass01_02.setmapelm( objClass00_04 ); cClass02 *ptrClass02_01 = new cClass02(); ptrClass02_01->setmapelm( objClass01_01 ); ptrClass02_01->setmapelm( objClass01_02 ); printf("START\n"); printf("\n"); printf( "1. try: %02d\n", ptrClass02_01->getmapelm("elm01_01")->getdat() ); printf( "2. try: %02d\n", ptrClass02_01->getmapelm("elm01_02")->getdat() ); printf("\n"); printf( "3. try: %02d\n", ptrClass02_01->getmapelm("elm01_01")->getmapelm("elm00_01")->getdat() ); printf( "4. try: %02d\n", ptrClass02_01->getmapelm("elm01_02")->getmapelm("elm00_04")->getdat() ); printf("\n"); printf( "5. try: %s\n", ptrClass02_01->getmapelm("elm01_01")->getmapelm(2)->getnme().c_str() ); printf( "6. try: %s\n", ptrClass02_01->getmapelm("elm01_02")->getmapelm(3)->getnme().c_str() ); printf("\n"); printf("DONE\n"); #elif defined (VERSION02) || defined (VERSION04) // run into segvault if object become overwritten OR // object for filling multi_index is only a local variable of a filling function cClass02 *ptrClass02 = new cClass02(); cClass01 objClass01; cClass00 objClass00; objClass01 = cClass01("elm01_01", 11); objClass00 = cClass00("elm00_01", 1); objClass01.setmapelm(objClass00); objClass00 = cClass00("elm00_02", 2); objClass01.setmapelm(objClass00); objClass01 = cClass01("elm01_02", 12); objClass00 = cClass00("elm00_03", 4); objClass01.setmapelm(objClass00); objClass00 = cClass00("elm00_04", 3); objClass01.setmapelm(objClass00); ptrClass02->setmapelm(objClass01); printf("START\n"); printf( "dat = %d\n", ptrClass02->getmapelm("elm01_01")->getdat() ); // seg_vault // printf( "dat = %d\n", ptrClass02->getmapelm("elm01_02")->getdat() ); // works fine printf("DONE\n"); #endif } //--- END ---------------------------------------------------------------------- ______________________________________________________ Bis 50 MB Dateianhänge? Kein Problem! http://freemail.web.de/club/landingpage.htm/?mc=025556

2 1

[thread] more problems with condition
by Anteru 20 Apr '08

20 Apr '08

Hi, I've posted this to the users list as well, but it might have got lost as I replied on the original thread. Well, I still have problems with the conditions, even with the latest SVN. The problem seems to be that inside a block like: Lock lock (mutex); while (something.empty ()) cond.wait (mutex); I'm still getting into a state where something.empty () == false and yet I'm waiting on the condition. The only other access happens via: Lock lock (mutex); something.push (...); cond.notify_one (); So I don't get it how something can go wrong, unless the transition from mutex.unlock () to cond.wait () is not fully atomic and the following happens: Thread 1: while (something.empty ()) cond.wait (mutex); // starts, releaes lock but is not waiting yet Now comes Thread 2: Lock lock (); something.push cond.notify_one (); // Nobody waiting lock.release (); Thread 1 again: cond.wait (mutex); // starts waiting I had a similar problem with my own condition implementation on Windows, with exactly the same syndromes (I've been following the "Strategies for Implementing POSIX Condition Variables on Win32" http://www.cs.wustl.edu/~schmidt/win32-cv-1.html - only got it working properly with SignalObjectAndWait). Currently, it always leaves exactly *one* thread waiting, while previously, it left several threads waiting, so it has improved but there is still a problem. Any ideas? Anything I can do to track this down further? Cheers, Anteru

3 3

[statechart] Using fast_pool_allocator along with state_machine
by Babi Seal 19 Apr '08

19 Apr '08

Hi, I would like to avoid fragmentation and perhaps reduce the time spent entering and leaving state in my state machine by leveraging the fast_pool_allocator. My very limited understanding of allocators comes from Scott Meyer's Effective STL and his references to articles on the Web. From reading the implementation of state_machine, I am not clear what the template-arguments for the UserAllocator should be if I wish to use the fast_pool_allocator as the UserAllocator parameter for state-machine. If I specified boost::fast_pool_allocator<int> does the library take care of somehow doing a rebind and allocating the right amount of memory for the states ? >From reading the changeset documentation (Point 2, Breaking Change of 14 August 2005) I see that " this considerably simplifies memory management customization. A user now only needs to pass his own allocator to state_machine<> and no longer has to separately overload operator new/delete for his state classes" Any guidance would be really appreciated ? Thanks #ifndef __STATE_H_INCL__ #define __STATE_H_INCL__ #include <boost/statechart/state_machine.hpp> #include <boost/statechart/state.hpp> #include <boost/statechart/transition.hpp> #include <boost/pool/pool_alloc.hpp> namespace sc = boost::statechart; // We need to forward-declare the initial state because it can // only be defined at a point where the state machine is // defined. struct Enabled; struct Machine : sc::state_machine< Machine, Enabled, boost::fast_pool_allocator< int > > /* ??? is this right ? */ { Machine(); ~Machine() { terminate(); } int ContextAssociatedwithStateMachine; }; #endif ____________________________________________________________________________________ Be a better friend, newshound, and know-it-all with Yahoo! Mobile. Try it now. http://mobile.yahoo.com/;_ylt=Ahu06i62sR8HDtDypao8Wcj9tAcJ

2 1

[ptr_container] Pair type for boost::ptr_map?
by Robert Dailey 19 Apr '08

19 Apr '08

Hi, I have the following code: void HandlePair( std::pair<int, char*>& mypair ) { } void main() { boost::ptr_map<int, char> mymap; HandlePair( *mymap.begin() ); } What's the proper way to accept pairs in the HandlePair function? I can't seem to find a boost::ptr_pair anywhere, or something like that.

3 2

[program_options] debug assertion with options_description
by Nicholas Clark 19 Apr '08

19 Apr '08

I just received a huge application that uses boost for just about everything. I am receiving a debug assertion when trying to add program descriptions. To help isolate the error I have built a very simple example and am still getting the crash. For reference I am using boost 1.32. When I moved to any of the newer versions of boost this specific error goes away but I rack up a list of compiler errors a mile long. I am trying to fix this issue without moving to a newer version of boost because this is a legacy application and we have a minimum amount of time/budget. The last compiled version delivered by the old contractor does not have this error. This previous version was built with VS71 but we are using VS80 (with SP2) . could this be the difference? #include <boost/program_options.hpp> namespace po = boost::program_options; using namespace std; using namespace boost::program_options; int _tmain(int argc, _TCHAR* argv[]) { po::options_description desc("Allowed options"); desc.add_options() ("help,H", "produce help message") ; return 0; } Again a debug assert is triggered when calling 'add_options' with boost 1.32 but not in newer version using VS80 with SP2. Thanks! Nick --------------------------------------------------- Nicholas Clark (Nick) Sr. Computer Scientist ReallaeR, LLC ( <http://www.reallaer.com/> www.ReallaeR.com) (800) 816-1913 ext.316 <mailto:clark@reallaer.com> clark(a)reallaer.com

2 1

general question on testing
by Ovanes Markarian 18 Apr '08

18 Apr '08

Hello *, I have a question regarding testing. I would like to test my implementation how it bahaves in multi-threaded environment within different compilation units. Does anyone have ideas how I can generate from my c++ project (no perl or other scripting tools) (possibly with preprocessor ??) multiple compilation units in an automated way. Many thanks, Ovanes

2 2

spirit's functor_parser<functor>
by Olaf Peter 18 Apr '08

18 Apr '08

Hi, I'm using a lot of functor parsers and combine them in one grammar. Now, my grammar explodes at the time. Therefore I want to split/compile the functor parsers into separate files. This requires a forward declaration. Well, how to perform this?? spirit::functor_parser<functor> functor_p; is an instance. Thanks, Olaf

2 3

[regex] 1.35 missing lib on Windows?
by Larry 18 Apr '08

18 Apr '08

I built 1.35 on Windows XP using MS Visual Studio .NET 2003 using bjam --toolset=msvc-7.1 install No errors in the build. Including <boost/regex.hpp> in a cpp file compiles OK using IDE but the link fails missing libboost_regex-vc71-mt-gd-1_35.lib and the lib is not present in the "install" lib directory. The project is being built with compiler option /MDd. Is this a Boost build failure or should I have specified something else to get the lib created or to use a different lib? Anyone know? Larry

3 3