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

purge_memory of fast_pool_allocator's singleton pool
by Michael Fawcett 16 Mar '06

16 Mar '06

Is there a way to purge the memory of the underlying singleton_pool used by a specific fast_pool_allocator? For example: typedef boost::fast_pool_allocator < std::pair<const int, astar_node *>, boost::default_user_allocator_new_delete, boost::details::pool::null_mutex > my_allocator; typedef std::map<int, astar_node *, std::less<int>, my_allocator> MyMap; // ...do lots of allocations // I don't care about destructors being called, just release ALL memory if (boost::singleton_pool < boost::fast_pool_allocator_tag, sizeof(my_allocator::value_type), my_allocator::user_allocator, my_allocator::mutex, my_allocator::next_size >::purge_memory() == false) { std::cout << "Failed to purge the fast_pool!!" << std::endl; } This always prints the error message for me. I suspect it has something to do with map's allocator rebinding to allocate map nodes, but I'm not sure how to solve this. Any help would be appreciated.

1 0

Re: [Boost-users] [multi_index] modify_range?
by JOAQUIN LOPEZ MU?Z 16 Mar '06

16 Mar '06

Jeff Flinn wrote: > It would be nice to have a modify_range/modify_key_range that would apply a > function object to each deref'd iterator in the range. Since the multi_index > iterator derefences to a const value_type&, one can not use std::for_each in > particular to apply modifications. Or am I missing something. Hello Jeff, I think it is possible to have what you want without requiring that a new facility be provided by Boost.MultiIndex itself. For you can write: template<typename Index,typename Modifier> void modify_range( Index& i,typename Index::iterator first,typename Index::iterator last, Modifier mod) { while(first!=last)i.modify(first++,mod); } and use it as in the following example: struct adder { adder(int n):n(n){} void operator()(int& x)const{x+=n;} private: int n; }; typedef multi_index_container< int, indexed_by< ordered_non_unique<boost::multi_index::identity<int> > > > multi_index_type; multi_index_type m; for(int i=0;i<10;++i)m.insert(i); modify_range(m,m.begin(),m.end(),adder(-2)); or with Boost.Lambda if you prefer: modify_range(m,m.begin(),m.end(),_1-=2); There is a problem, though: consider the following: // buggy call ro modify_range modify_range(m,m.begin(),m.end(),adder(2)); What's the problem with this? Well, after *increasing* the value of an element, this is repositioned further to the end of the container, and consequentely modify_range will visit it again and engage in a neverending loop (modulo overflows.) For this situations you can use a special (albeit slower) variation that records the range before starting modifying the elements: template<typename Index,typename Modifier> void modify_unstable_range( Index& i,typename Index::iterator first,typename Index::iterator last, Modifier mod) { typedef std::vector<typename Index::iterator> buffer_type; buffer_type v; while(first!=last)v.push_back(first++); for(typename buffer_type::iterator it=v.begin(),it_end=v.end(); it!=it_end;i.modify(*it++,mod)); } // calling modify_unstable_range is now OK modify_unstable_range(m,m.begin(),m.end(),adder(2)); I hope my explanations are clear enough. Does this satisfy your needs? You can find attached a complete example exercising these little utilities. modify_key_range would be a simple variation on this stuff. HTH, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 3

Re: [Boost-users] SOLVED! Re: multi_index 1.33.0, known problems withRHEL 3 compiler (gcc 3.2.3)?
by JOAQUIN LOPEZ MU?Z 16 Mar '06

16 Mar '06

----- Mensaje original ----- De: bert hubert <bert.hubert(a)netherlabs.nl> Fecha: Lunes, Marzo 13, 2006 8:32 pm Asunto: Re: [Boost-users] SOLVED! Re: multi_index 1.33.0,known problems withRHEL 3 compiler (gcc 3.2.3)? > On Mon, Mar 13, 2006 at 05:22:35PM +0100, Joaqu?n M? L?pez Mu?oz > wrote: > > I'd check the following for anomalies: > > Joaquin, I'm busy tonight with other things so I'm only able to > give you > some approximate answers, for which I apologise. I hope to be able > to give > more definitive answers Wednesday. Of course, come back when you can. > > > 1. Could you (just for tests), replace index #0, which now is > hashed,> with an ordered_unique index and rerun? A quadratic > behavior could > > be the result of a very bad hashing scheme: this is extremely > unlikely> for your current code, but who knows. > > The original container had ordered_unique as its first index and > showed a > similar (large) increase in pruning time when pruning more cache > entries. I > did not look for a power law or anything. OK, let's rule out hashing problems, then. > > > 2. Is the size of CacheEntry::d_records roughly the same between > > prunes? Could it be that the average number of records in CacheEntry > > elements is disproportionately larger on those prunes that take > > longer? > > The cache remains almost identical in size, around 50 million > entries. The > cache represents DNS records expiring, each run expires all DNS > entries that > have a 'time to die' ttd that is larger than the current time. I'm not referring here to d_entry.size(), but to the average x.d_records.size() for x in d_entry. How many records does a cache entry have on the average? Does this experience large variations? > > This holds, I think, a vital clue to the problem at hand. Records are > inserted with ever increasing ttds, generally. There is a number > of common > time-to-live numbers for DNS records, ie, 5, 60, 300, 3600, 7200, > 86400seconds. > > This means that we have a number of 'striding' ttd's being > inserted: now + > 5, now + 60, now +300 .. now +86400. Might this trigger a badly > balancedtree? It shouldn't, otherwise it would be a bug in Boost.MultiIndex. Not that I categorically deny this possibility, but I tend to think the problem might lie elsewhere. If we're left with nothing else, we could arrange a test for balancedness easily enough, please tell me so when you're ready to instrument that. > > On a related note, I wonder if chopping off the lower half of any > sort of > ordered tree might trigger worst case behaviour. Note that > CacheEntry::getTTD() which forms one index might be slow to call. The erase() part is not affected, as it doesn't invoke the comparison predicate nor the key extractor (getTTD in your case.) > > > 3. What percentage of elements of d_cache are visited on each > > prune? I.e. what is the typical value of looked/d_cache.size()? The > > nonvisited elements shoudn't have any impact on phase /*2*/, > > but they have a (minimal) impact on those operations of /*1*/ > > performing as O(n log n), such as replace(). Anyway, no amount > > on nonvisited elements can have such a huge impact on figures. > > Typically 500 elements are visited of a 50 million element > structure, so > 1e-5. Things get crazy once > 1000 elements are visited. Doesn't seem like large variatons on d_entry.size() are to be accounted for the problem, then. > > Thanks Joaquin, I hope to provide more measurements soon. > This problem is intriguing me... specially the fact that you observe quadratic behavior in a linearly-decomposable (and hence O(n)-behaved) problem. I think the following, easy test, can shed some light: to state facts, what you get is reasonably fast pruning when pruning period (and thus looked value) is low, with an explosion when pruning period reaches a given threshold, around say looked=800, right? And this happens even (quote) "without inserting something in the container in between", right? Why don't you try then the following: when pruning time is above a threshold, make doPrune do the pruning in two stages (and time each separately): 1. up to now/2. 2. up to now. According to the stated facts, making doPrune in two stages is about equivalent to making it in one fell swoop, wich implies the summed time won't change much. On the other hand, it is also equivalent to having a halved, below-threshold pruning period, thus implying contradictorily that the summed time will be much less than with one stage pruning. Why don't you do the test? Interesting things might come up... Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 3

[serialization] Problem deriving from text_oarchive_impl
by Robert S. Grimes 16 Mar '06

16 Mar '06

Hi, I'm starting to get the hang of this as I slog through, but it's still a bit rough! I'm able to derive a new archive from binary_oarchive_impl, but for some reason, I can't do the same with text_oarchive_impl. Specifically, I get the following error (from MS Visual C++ 8.0, using Boost 1.33.1): 1>..\rsg_text_oarchive.hpp(24) : error C2649: 'basic_text_oprimitive<class std::basic_ostream<char,struct std::char_traits<char> > >' : is not a 'class' 1> ..\rsg_text_oarchive.hpp(40) : see reference to class template instantiation 'rsg_text_oarchive_impl<Archive>' being compiled The similar line in the binary archive works fine. Attached are the two derived archives in question. All I'm trying to do (at this point) is add a short header in the constructor; next, I'll want to add a footer in the destructor. Thanks! -Bob

2 5

Question regarding dynamic_bitset -
by Michael 16 Mar '06

16 Mar '06

boost::dynamic_bitset<byte> m_patterndelta; // intialization of m_patterndelta .... std::vector<byte> pack; boost::to_block_range<byte>(m_patterndelta, pack.begin()); // GPF because of bad pointer in "pack". Cannot figure why, may be someone can help?

2 1

How to add linker options to installed test
by Smith Matt - matsmi 16 Mar '06

16 Mar '06

I am trying to run the tests that were installed with Boost.Regex and Boost.Function. Trouble is, the HP-UX 11.23 OS is requiring me to include "-lunwind" as one of my linker options. Is there a way to modify the Jamfile for those tests to include that option when linking? The compiler I am using is G++ 4.02. Thanks. Matt Smith Acxiom Corporation Data Compilation CWY0101-80 PO Box 2000 301 Industrial Blvd. Conway, AR 72033-2000 (501) 342-2434 Matt.Smith(a)acxiom.com *************************************************************************** The information contained in this communication is confidential, is intended only for the use of the recipient named above, and may be legally privileged. If the reader of this message is not the intended recipient, you are hereby notified that any dissemination, distribution or copying of this communication is strictly prohibited. If you have received this communication in error, please resend this communication to the sender and delete the original message or any copy of it from your computer system. Thank You. ****************************************************************************

1 0

Are Boost.Multi_Index and Boost.Format Planned for 64-bit Portability?
by Wu Yinghui, Freddie 16 Mar '06

16 Mar '06

Hi all, It's the first time I tried multi_index and format. I have to say that they are so powerful that I love them from the beginning! Nonetheless, when I enabled /Wp64 on my MSVC71 compiler, the headers gave me a lot of problems regarding possible pointer truncations (and sometimes default c'tor problems). The relevant warnings are something like the following: ==== snip <multi_index> ===== ..\..\..\boost-1.x\include\boost-1_34\boost\multi_index\detail\ord_index_node.hpp(129) : warning C4312: 'type cast' : conversion from 'boost::multi_index::detail::uintptr_type' to 'void *' of greater size ..\..\..\boost-1.x\include\boost-1_34\boost\multi_index\detail\ord_index_node.hpp(134) : warning C4311: 'type cast' : pointer truncation from 'void *' to 'boost::multi_index::detail::uintptr_type' ..\..\..\boost-1.x\include\boost-1_34\boost\multi_index\detail\ord_index_node.hpp(161) : warning C4312: 'type cast' : conversion from 'const boost::multi_index::detail::uintptr_type' to 'void *' of greater size ..\..\..\boost-1.x\include\boost-1_34\boost\multi_index\detail\ord_index_node.hpp(509) : warning C4610: struct 'boost::multi_index::detail::ordered_index_node_impl' can never be instantiated - user defined constructor required ..\..\..\boost-1.x\include\boost-1_34\boost\multi_index\detail\ord_index_node.hpp(512) : warning C4510: 'boost::multi_index::detail::ordered_index_node_trampoline<Super>' : default constructor could not be generated ..\..\..\boost-1.x\include\boost-1_34\boost\multi_index\detail\ord_index_node.hpp(562) : warning C4510: 'boost::multi_index::detail::ordered_index_node<Super>' : default constructor could not be generated ===== snip ===== ===== snip <format> ===== ..\..\..\boost-1.x\include\boost-1_34\boost\format\alt_sstream_impl.hpp(110) : warning C4244: 'argument' : conversion from 'boost::io::basic_altstringbuf<Ch,Tr,Alloc>::off_type' to 'int', possible loss of data ..\..\..\boost-1.x\include\boost-1_34\boost\format\feed_args.hpp(98) : warning C4244: 'argument' : conversion from 'const stlpd_std::iterator_traits<_Iterator>::difference_type' to 'int', possible loss of data ..\..\..\boost-1.x\include\boost-1_34\boost\format\feed_args.hpp(53) : warning C4244: 'argument' : conversion from 'stlpd_std::streamsize' to 'stlpd_std::basic_string<_CharT,_Traits,_Alloc>::size_type', possible loss of data ===== snip ===== So I just wonder if both of these libraries have any plan on considering this issue? I really love these libraries, and I want to integrate them into our future product. But if the 64-bit portability issues are not solved, I'm afraid I'll have some problem pursuading the managers. Cheers, Freddie -- Wu Yinghui, Freddie Research & Development 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.

2 1

Why google does not archive boost mailing list any more?
by gchen 16 Mar '06

16 Mar '06

I used browse boost list using Google group: http://groups.google.com/group/boost-list?lnk=oa&hl=en I feel Google group's the searching engine and interface are very handy. But recently, Google group does not archive boost list any more, why? Best Regards gchen

1 0

How to install boost if I do not need compiled libs
by Andreas Fabri 16 Mar '06

16 Mar '06

Hello, Is it correct that one only needs to install boost with bjam, if one uses compiled libs? That is, if I dont need them it is enough to unzip the tar ball and set the include path right? thanks in advance, andreas

2 1

[serialization] newbie question regarding serialization of std::list<int>
by Max Schoebinger 16 Mar '06

16 Mar '06

Hi everybody, I am new to the serialization library and encountered a simple problem which I couldn't solve. I'd like to serialize simple stl containers. A minimal example is #include <fstream> #include <list> #include <boost/serialization/list.hpp> #include <boost/archive/text_oarchive.hpp> int main(int argc, char** argv) { typedef std::list<int> List; List myList; myList.push_back(1); myList.push_back(2); myList.push_back(3); myList.push_back(4); std::ofstream ofs("archive.txt"); boost::archive::text_oarchive oa(ofs); oa << myList; } This doesn't compile under Linux using gcc-3.3 and boost-1.33.1 giving the following compiler error: /opt/toolkits/linux32/gcc-3.3/boost-1-33-1/include/boost-1_33_1/boost/archive/detail/oserializer.hpp:567: error: incomplete type `boost::STATIC_ASSERTION_FAILURE<false>' does not have member `value' Looking at the code at the given position hints that the type which should be serialized should be marked as track_never. I added the following command below the typedef of List BOOST_CLASS_TRACKING(List, boost::serialization::track_never) which also doesn't solve the problem... Maybe I am missing something very basic. I would be very thankful, if somebody could lift the curtain in front of my eyes ;-) Best Regards, Max

3 5

STLAlgorithmExtensions
by gast128 16 Mar '06

16 Mar '06

Dear all, I have a question for the Boost moderators: there seems to be already an STL extension library for Boost. This is of course great, but why isn't it in production? It seems to me that this one of the basic libraries and serves many common needs, like the copy_if request in the development group. It can almost replace our company private STL extension library except for: transform_if is_unique contains contains_if delete_all delete_if and container variants of STL algorithms (i.e. for_each(vec, fc) instead of for_each(vec.begin(), vec.end(), fc). Especially handy for implicit modifying algorithms like remove etc.) Further more there was in 2002 a discussion about a sorted vector. Didn't make it either, which is unfortunate. Wkr, me

3 3

Compilation Problem !! (Platform does not have wide character support) !!
by Patel Priyank-PPATEL1 15 Mar '06

15 Mar '06

Hi all, I am trying to compile Boost on following Solaris machine: => SunOS isdbuild9 5.8 Generic_108528-18 sun4u sparc SUNW,Sun-Fire-480R I have used following command to build boost : => ../boost-jam-3.1.12/bin.solaris/bjam -sTOOLS=gcc --libdir=./lib stage I have got following error, during compilation. ======================================================================== =================== gcc-C++-action bin/boost/libs/serialization/build/libboost_wserialization.a/gcc/debug/u tf8_codecvt_facet.o /vob/wibb_test/tools/cots/boost_1_33_1/libs/serialization/src/utf8_codec vt_facet.cpp:8:2: #error "wide char i/o not supported on this platform" set -e "g++" -c -Wall -ftemplate-depth-255 -DBOOST_LIB_DIAGNOSTIC=1 -g -O0 -fno-inline -Wno-non-virtual-dtor -Wno-ctor-dtor-privacy -I"bin/boost/libs/serialization/build" -I "/vob/wibb_test/tools/cots/boost_1_33_1" -o "bin/boost/libs/serialization/build/libboost_wserialization.a/gcc/debug/ utf8_codecvt_facet.o" "/vob/wibb_test/tools/cots/boost_1_33_1/libs/serialization/build/../src/ utf8_codecvt_facet.cpp" "/apps/public/bin/objcopy" --set-section-flags .debug_str=contents "bin/boost/libs/serialization/build/libboost_wserialization.a/gcc/debug/ utf8_codecvt_facet.o" ...failed gcc-C++-action bin/boost/libs/serialization/build/libboost_wserialization.a/gcc/debug/u tf8_codecvt_facet.o... gcc-C++-action bin/boost/libs/serialization/build/libboost_wserialization.a/gcc/debug/b asic_text_wiprimitive.o /vob/wibb_test/tools/cots/boost_1_33_1/libs/serialization/src/basic_text _wiprimitive.cpp:14:2: #error "wide char i/o not supported on this platform" ======================================================================== =================== I tried to compile with following command too, but somehow it does not skip compilation of boost_serialization library: => ../boost-jam-3.1.12/bin.solaris/bjam -sTOOLS=gcc --libdir=./lib --without-boost_serialization stage Please let me know if you have similar issue before and aware of any solution. Thanks Priyank

1 0

Need help in understanding boost lambda compile error:
by Meryl Silverburgh 15 Mar '06

15 Mar '06

Need help in understanding boost lambda compile error: I have this line of code: where grlpVector is vector<GroupResultListProcessor*> for_each(grlpVector.begin(), grlpVector.end(), boost::lambda::bind(&GroupResultListProcessorExecuter::do_process, this, *_1)); But I get this compile error, can you help me understand what's wrong? /usr/include/boost/tuple/detail/tuple_basic.hpp: In instantiation of 'boost::tuples::cons<GroupResultListProcessor, boost::tuples::null_type>': /usr/include/boost/tuple/detail/tuple_basic.hpp:329: instantiated from 'boost::tuples::cons<GroupResultListProcessorExecuter* const, boost::tuples::cons<GroupResultListProcessor, boost::tuples::null_type> >' /usr/include/boost/tuple/detail/tuple_basic.hpp:329: instantiated from 'boost::tuples::cons<void (GroupResultListProcessorExecuter::* const)(GroupResultListProcessor&), boost::tuples::cons<GroupResultListProcessorExecuter* const, boost::tuples::cons<GroupResultListProcessor, boost::tuples::null_type> > >' /usr/include/boost/lambda/detail/lambda_functor_base.hpp:151: instantiated from 'const bool boost::lambda::detail::has_null_type<boost::tuples::cons<void (GroupResultListProcessorExecuter::* const)(GroupResultListProcessor&), boost::tuples::cons<GroupResultListProcessorExecuter* const, boost::tuples::cons<GroupResultListProcessor, boost::tuples::null_type> > > >::value' /usr/include/boost/lambda/detail/lambda_functor_base.hpp:229: instantiated from 'boost::lambda::detail::deduce_non_ref_argument_types<boost::tuples::tuple<void (GroupResultListProcessorExecuter::* const)(GroupResultListProcessor&), GroupResultListProcessorExecuter* const, const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::contentsof_action>, boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type>, boost::tuples::tuple<GroupResultListProcessor*&, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> >' /usr/include/boost/lambda/detail/lambda_functor_base.hpp:412: instantiated from 'boost::lambda::lambda_functor_base<boost::lambda::action<3, boost::lambda::function_action<3, boost::lambda::detail::unspecified> >, boost::tuples::tuple<void (GroupResultListProcessorExecuter::* const)(GroupResultListProcessor&), GroupResultListProcessorExecuter* const, const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::contentsof_action>, boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> >::sig<boost::tuples::tuple<GroupResultListProcessor*&, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> >' /usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algo.h:158: instantiated from '_Function std::for_each(_InputIterator, _InputIterator, _Function) [with _InputIterator = __gnu_cxx::__normal_iterator<GroupResultListProcessor**, std::vector<GroupResultListProcessor*, std::allocator<GroupResultListProcessor*> > >, _Function = boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<3, boost::lambda::function_action<3, boost::lambda::detail::unspecified> >, boost::tuples::tuple<void (GroupResultListProcessorExecuter::* const)(GroupResultListProcessor&), GroupResultListProcessorExecuter* const, const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::contentsof_action>, boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type> > >]' ../GroupResultListProcessorExecutor.cpp:30: instantiated from here /usr/include/boost/tuple/detail/tuple_basic.hpp:419: error: cannot declare field 'boost::tuples::cons<GroupResultListProcessor, boost::tuples::null_type>::head' to be of abstract type 'GroupResultListProcessor' ../GroupResultListProcessor.h:15: note: because the following virtual functions are pure within 'GroupResultListProcessor': ../GroupResultListProcessor.h:17: note: virtual void GroupResultListProcessor::process(GroupResultList&) make: *** [GroupResultListProcessorExecutor.o] Error 1

3 2

bjam and VC8
by Andreas Fabri 15 Mar '06

15 Mar '06

Hello, I first executed C:\Program Files\Microsoft Visual Studio 8\Common7\Tools\vsvars32.bat I then called bjam "-sTools=vc-8_0" install but it installs me the libs c:/boost/lib/boost_date_time-vc71-mt-1_33_1.lib that is for the vc71 toolset. Can anybody tell me what I did wrong. thanks, andreas

4 4

[multi_index] modify_range?
by Jeff Flinn 14 Mar '06

14 Mar '06

It would be nice to have a modify_range/modify_key_range that would apply a function object to each deref'd iterator in the range. Since the multi_index iterator derefences to a const value_type&, one can not use std::for_each in particular to apply modifications. Or am I missing something. Thanks, Jeff

1 0

stopping dijkstra_shortest_path after target achieved
by Celso Pitta 14 Mar '06

14 Mar '06

Dear ALL, Its probably a easy/dummy question, but as i`m new with template programming and i`ve seen no discussion about this in the mailing list... Is there an easy/already implemented way to stop the computation of the dijkstra_shortest_path algorithm when some target vertex is marked as black?? The problem is: i have a _huge_ graph and need to calculate the shortest distance between two points, but in 90% of all use cases the these points will be very close of each other, so doesn't make sense for me to keep the calculation until all shortest paths are found.. Best regards, Celso.

3 3

Re: [Boost-users] Using bind to call a member function
by James Hughes 14 Mar '06

14 Mar '06

Also thanks, I was wondering how to do exactly the same thing the other day. James > -----Original Message----- > From: Rob Caldecott [mailto:robert.caldecott@gmail.com] > Sent: 14 March 2006 09:52 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Using bind to call a member function > > > Thankyou Stuart - it works like a charm. > > > > You certainly can - add 'this' as the first bound > parameter, like so: > > > > for_each(v.begin(), v.end(), bind(&CTest::SomeFunc, this, _1)); > > > > HTH > > Stuart Dootson > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

Using bind to call a member function
by Rob Caldecott 14 Mar '06

14 Mar '06

Greetings, Is it possible to use boost::bind in a for_each loop to call a member of the class that is making the call? For example: class CTest { public: void SomeFunc(const std::wstring& str) const { // Do something with str } void DoSomething() const { std::vector<std::wstring> v; v.push_back(L"test"); ... for_each(v.begin(), v.end(), bind(&CTest::SomeFunc, _1)); } }; Obviously the above will not compile - and I'm pretty sure that somewhere in the bind, "this" will need to be passed, but I am struggling to make this work. I know I could use a static member function or use a function object and pass it "this", but I wondered if there is a way to cut out the middle-man and call a member function directly in this way?

2 2

[serialization] Problem writing and reading in same block, with work-around
by Robert S. Grimes 14 Mar '06

14 Mar '06

Hi all, It seems there is a problem with using both an output and an input archive in the same code block. Here is a simple sample that illustrates the problem. By defining the symbol BREAK_IT, you can see the problem; not defining it, the example works. What is particularly odd is that it is throwing an std::bad_alloc from within text_iarchive_impl<Archive>::load(std::string &s) in text_iarchive_impl.ipp because the requested size is obviously wrong - for example, 3435973837!!! I can't follow well enough what is happening, but I have figured out a work-around from noticing the differences between my example and demo.cpp; in the latter, the writing and reading of an archive are performed in two separate functions, or more precisely, two different blocks. Is this normal? Have I missed the documentation about this? Still, seems rather fussy, though to be honest, I'm not likely to suffer from the workaround in "production" code, but it's a bit unnerving nonetheless... Thanks! -Bob Example follows: #include <fstream> #include <iostream> #include <string> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> class Simple { private: int anIntMember; bool aBoolMember; template<class Archive> void serialize(Archive & ar, const unsigned int file_version) { ar & BOOST_SERIALIZATION_NVP(anIntMember) & BOOST_SERIALIZATION_NVP(aBoolMember); } // Grant access to serialization library friend class boost::serialization::access; public: Simple(): anIntMember(27), aBoolMember(false) {} int GetAnIntMember() const { return anIntMember; } void SetAnIntMember(int v) { anIntMember = v; } bool GetABoolMember() const { return aBoolMember; } void SetABoolMember(bool v) { aBoolMember = v; } }; #define BREAK_IT void TestBoostText(const Simple& parms) { #ifndef BREAK_IT { #endif // Write out to boost archive std::ofstream ofs("./boost.txt"); boost::archive::text_oarchive oa(ofs); oa << parms; /// Could use a better XML element name #ifndef BREAK_IT } #endif // Read it back and check Simple rparms; std::ifstream ifs("./boost.txt"); // THIS IS THE BROKEN LINE boost::archive::text_iarchive ia(ifs); ia >> rparms; std::cout << "Checking boost read..."; if (rparms.GetAnIntMember() == 99) { std::cout << "Worked!!!" << std::endl; } else { std::cout << "Failed - appears not to have been updated" << std::endl; } } int main(int argc, char* argv[]) { Simple parms; // Modify parms for testing purposes parms.SetAnIntMember(99); // Test both binary archives TestBoostText(parms); return 0; }

2 3

Known issues loading lots of objects with xml_iarchive?
by Christopher Gillett 14 Mar '06

14 Mar '06

I am serializing a LOT of objects, one per file. I can create XML for many thousands of objects with no issue. However, when trying to load a few hundred objects (using a separate program, btw) I am hitting a boost::archive::archive_exception with a stream error while loading around the 161st file, which I believe based on stack traces is coming from within boost::archive::basic_xml_grammar<char>::parse_end_tag (). The approach I'm taking is fairly textbook, so I'm curious if there are known issues with loading a lot of files, etc. Any advice appreciate. Thanks, Chris Gillett

2 1

Re: [Boost-users] Boost Statechart: general questionss about whatthelibrary can do
by RIVASSEAU Jean Noel 13 Mar '06

13 Mar '06

Hi Andreas Hmmm, at first that sounds more like a BGL problem than one for the statechart library. What you describe above is easy to do with an appropriately designed state machine but I'm not sure it would be the right abstraction. For what real-world problem do you plan to use Statechart? Actually, after I sent the mail I thought some more and yes, I realised that this can be more of a graph problem (shortest path or such...) so it would be easy to with the BGL. But I'd like to do it with Boost Statechart since my real-world problem is at heart a state problem (statechart). What I am trying to do is: * I have an embedded software to *test*. I am trying to develop a framework for somewhat automatically testing the software. If I look at the specification of the software, I have lots of possible states (specs mention a lot of UML like diagrams). I need to test if the software correctly respects the specification, that is, if it correctly changes from one state to another according to a given event. Since the diagrams are complex, and thus the state space is huge (sometimes more than 100 states), I'd like for my framework to be able to automatically go to a given state, to be able to test the software in that particular state. Eg, if you just start by powering up the device, I'd like to compute the paths (and thus, events, that have to be translated to commands sent to the embedded device) to go to a particular state. Do you think Boost Statechart would be a good abstraction? If yes, how can I implement some of the Boost algorithms for graphs (such as shortest path) to achieve what I need? Is it even possible from a technical point of view to convert a fsm to a graph and run BGL algorithms on it ? I am already quite familiar with the BGL as I used it extensively one year ago. Thanks. > When a transition is executed (automatically, or explicitely), can I > call a function? That is, when an event is processed, can I implement > some code that will be executed each time an event is processed ? Yes, that is probably the feature every FSM library supports. Ok. Regards Jean-Noël

2 1

[UTF] expected constructor, destructor, or type conversion before ‘(’ token
by Mateusz Łoskot 13 Mar '06

13 Mar '06

Hi, Today, I tried to build Unit Test examples on my Linux box and without success so far. I use Ubuntu Breezy, so installed Boost from packages. It seems to be Boost 1.33 version: http://packages.ubuntu.com/breezy/libs/libboost-test1.33.0 GCC on my box is: mloskot@dog:~$ g++ --version g++ (GCC) 4.0.2 20050808 (prerelease) (Ubuntu 4.0.1-4ubuntu9) Next, I checkouted Boost sources from CVS to have latest examples on my disk. As a first test I tried to build boost/libs/test/example/unit_test_example_04.cpp that mainly presents usage of BOOST_AUTO_TEST_SUITE and BOOST_AUTO_TEST_CASE macros. Here is error message I got: mloskot@dog:~/dev/boost/_cvs/boost/libs/test/example$ g++ -Wall unit_test_example_04.cpp -lboost_unit_test_framework unit_test_example_04.cpp:15: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:17: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:25: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:34: error: expected constructor, destructor, or type conversion before ‘;’ token unit_test_example_04.cpp:39: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:48: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:51: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:58: error: expected constructor, destructor, or type conversion before ‘;’ token mloskot@dog:~/dev/boost/_cvs/boost/libs/test/example$ Nothing more. I also tried to compile example as simple as possible example: #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_CASE( test1 ) { // with or without some check //BOOST_CHECK( true ); } but with the same results: mloskot@dog:~/dev/geos/_cvs/geos/tests/unit$ g++ -Wall -lboost_unit_test_framework envelope_class_test.cpp envelope_class_test.cpp:2: error: expected constructor, destructor, or type conversion before ‘(’ token I really don't have any idea what's going wrong. I tried to find some help in lists archives and the only similar problem I found is not very helpful: http://thread.gmane.org/gmane.comp.lib.boost.devel/115540 It's a bit old post and I use much newer Boost, 1.33, so it seems this post does not apply to my case. Could anyone explain me how to fix it? Honestly, I suppose that I should build Boost 1.34 from CVS but I'm not sure. I use 1.34 on Windows with VC++ 8.0 and compile my own test units and examples without problems. But I'd strongly prefer to use latest stable Boost in my project, just to not to force users to build Boost themself. Here I include (long) headers inclusion path generated by g++ -H: mloskot@dog:~/dev/boost/_cvs/boost/libs/test/example$ g++ -H -Wall unit_test_example_04.cpp -lboost_unit_test_framework . /usr/include/boost/test/unit_test.hpp .. /usr/include/boost/test/test_tools.hpp ... /usr/include/boost/test/predicate_result.hpp .... /usr/include/boost/test/utils/class_properties.hpp ..... /usr/include/boost/test/detail/config.hpp ...... /usr/include/boost/config.hpp ....... /usr/include/boost/config/user.hpp ....... /usr/include/boost/config/select_compiler_config.hpp ....... /usr/include/boost/config/compiler/gcc.hpp ....... /usr/include/boost/config/select_stdlib_config.hpp ........ /usr/include/c++/4.0.2/utility ......... /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/c++config.h .......... /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/os_defines.h ........... /usr/include/features.h ............ /usr/include/sys/cdefs.h ............ /usr/include/gnu/stubs.h ......... /usr/include/c++/4.0.2/bits/stl_relops.h ......... /usr/include/c++/4.0.2/bits/stl_pair.h ....... /usr/include/boost/config/stdlib/libstdcpp3.hpp ....... /usr/include/boost/config/select_platform_config.hpp ....... /usr/include/boost/config/platform/linux.hpp ........ /usr/include/c++/4.0.2/cstdlib ......... /usr/include/c++/4.0.2/cstddef .......... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ......... /usr/include/stdlib.h .......... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h .......... /usr/include/bits/waitflags.h .......... /usr/include/bits/waitstatus.h ........... /usr/include/endian.h ............ /usr/include/bits/endian.h .......... /usr/include/xlocale.h .......... /usr/include/sys/types.h ........... /usr/include/bits/types.h ............ /usr/include/bits/wordsize.h ............ /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ............ /usr/include/bits/typesizes.h ........... /usr/include/time.h ........... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ........... /usr/include/sys/select.h ............ /usr/include/bits/select.h ............ /usr/include/bits/sigset.h ............ /usr/include/time.h ............ /usr/include/bits/time.h ........... /usr/include/sys/sysmacros.h ........... /usr/include/bits/pthreadtypes.h ............ /usr/include/bits/wordsize.h .......... /usr/include/alloca.h ........... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ........ /usr/include/boost/config/posix_features.hpp ......... /usr/include/unistd.h .......... /usr/include/bits/posix_opt.h .......... /usr/include/bits/environments.h ........... /usr/include/bits/wordsize.h .......... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h .......... /usr/include/bits/confname.h .......... /usr/include/getopt.h ....... /usr/include/boost/config/suffix.hpp ........ /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/limits.h ......... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/syslimits.h .......... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/limits.h ........... /usr/include/limits.h ............ /usr/include/bits/posix1_lim.h ............. /usr/include/bits/local_lim.h .............. /usr/include/linux/limits.h ............ /usr/include/bits/posix2_lim.h ............ /usr/include/bits/xopen_lim.h ............. /usr/include/bits/stdio_lim.h ...... /usr/include/boost/detail/workaround.hpp ..... /usr/include/boost/preprocessor/seq/for_each.hpp ...... /usr/include/boost/preprocessor/arithmetic/dec.hpp ....... /usr/include/boost/preprocessor/config/config.hpp ...... /usr/include/boost/preprocessor/repetition/for.hpp ....... /usr/include/boost/preprocessor/cat.hpp ....... /usr/include/boost/preprocessor/debug/error.hpp ....... /usr/include/boost/preprocessor/detail/auto_rec.hpp ........ /usr/include/boost/preprocessor/control/iif.hpp ....... /usr/include/boost/preprocessor/repetition/detail/for.hpp ........ /usr/include/boost/preprocessor/control/expr_iif.hpp ........ /usr/include/boost/preprocessor/logical/bool.hpp ........ /usr/include/boost/preprocessor/tuple/eat.hpp ...... /usr/include/boost/preprocessor/seq/seq.hpp ....... /usr/include/boost/preprocessor/seq/elem.hpp ........ /usr/include/boost/preprocessor/facilities/empty.hpp ...... /usr/include/boost/preprocessor/seq/size.hpp ...... /usr/include/boost/preprocessor/tuple/elem.hpp ...... /usr/include/boost/preprocessor/tuple/rem.hpp ..... /usr/include/boost/call_traits.hpp ...... /usr/include/boost/detail/call_traits.hpp ....... /usr/include/boost/type_traits/is_arithmetic.hpp ........ /usr/include/boost/type_traits/is_integral.hpp ......... /usr/include/boost/type_traits/detail/bool_trait_def.hpp .......... /usr/include/boost/type_traits/detail/template_arity_spec.hpp ........... /usr/include/boost/mpl/int.hpp ............ /usr/include/boost/mpl/int_fwd.hpp ............. /usr/include/boost/mpl/aux_/adl_barrier.hpp .............. /usr/include/boost/mpl/aux_/config/adl.hpp ............... /usr/include/boost/mpl/aux_/config/msvc.hpp ............... /usr/include/boost/mpl/aux_/config/intel.hpp ............... /usr/include/boost/mpl/aux_/config/gcc.hpp ............... /usr/include/boost/mpl/aux_/config/workaround.hpp ............. /usr/include/boost/mpl/aux_/nttp_decl.hpp .............. /usr/include/boost/mpl/aux_/config/nttp.hpp ............ /usr/include/boost/mpl/aux_/integral_wrapper.hpp ............. /usr/include/boost/mpl/integral_c_tag.hpp .............. /usr/include/boost/mpl/aux_/config/static_constant.hpp ............. /usr/include/boost/mpl/aux_/static_cast.hpp ........... /usr/include/boost/mpl/aux_/template_arity_fwd.hpp ........... /usr/include/boost/mpl/aux_/preprocessor/params.hpp ............ /usr/include/boost/mpl/aux_/config/preprocessor.hpp ............ /usr/include/boost/preprocessor/comma_if.hpp ............. /usr/include/boost/preprocessor/punctuation/comma_if.hpp .............. /usr/include/boost/preprocessor/control/if.hpp .............. /usr/include/boost/preprocessor/punctuation/comma.hpp ............ /usr/include/boost/preprocessor/repeat.hpp ............. /usr/include/boost/preprocessor/repetition/repeat.hpp .............. /usr/include/boost/preprocessor/detail/auto_rec.hpp ............ /usr/include/boost/preprocessor/inc.hpp ............. /usr/include/boost/preprocessor/arithmetic/inc.hpp ........... /usr/include/boost/mpl/aux_/config/lambda.hpp ............ /usr/include/boost/mpl/aux_/config/ttp.hpp ............ /usr/include/boost/mpl/aux_/config/ctps.hpp ........... /usr/include/boost/mpl/aux_/config/overload_resolution.hpp .......... /usr/include/boost/type_traits/integral_constant.hpp ........... /usr/include/boost/mpl/bool.hpp ............ /usr/include/boost/mpl/bool_fwd.hpp ........... /usr/include/boost/mpl/integral_c.hpp ............ /usr/include/boost/mpl/integral_c_fwd.hpp ............ /usr/include/boost/mpl/aux_/integral_wrapper.hpp .......... /usr/include/boost/mpl/aux_/lambda_support.hpp ......... /usr/include/boost/type_traits/detail/bool_trait_undef.hpp ........ /usr/include/boost/type_traits/is_float.hpp ......... /usr/include/boost/type_traits/detail/bool_trait_def.hpp .......... /usr/include/boost/type_traits/detail/template_arity_spec.hpp ......... /usr/include/boost/type_traits/detail/bool_trait_undef.hpp ........ /usr/include/boost/type_traits/detail/ice_or.hpp ........ /usr/include/boost/type_traits/detail/bool_trait_def.hpp ......... /usr/include/boost/type_traits/detail/template_arity_spec.hpp ........ /usr/include/boost/type_traits/detail/bool_trait_undef.hpp ....... /usr/include/boost/type_traits/is_pointer.hpp ........ /usr/include/boost/type_traits/is_member_pointer.hpp ......... /usr/include/boost/type_traits/config.hpp ......... /usr/include/boost/type_traits/is_member_function_pointer.hpp .......... /usr/include/boost/type_traits/detail/is_mem_fun_pointer_impl.hpp .......... /usr/include/boost/type_traits/detail/bool_trait_def.hpp ........... /usr/include/boost/type_traits/detail/template_arity_spec.hpp .......... /usr/include/boost/type_traits/detail/bool_trait_undef.hpp ......... /usr/include/boost/type_traits/detail/bool_trait_def.hpp .......... /usr/include/boost/type_traits/detail/template_arity_spec.hpp ......... /usr/include/boost/type_traits/detail/bool_trait_undef.hpp ........ /usr/include/boost/type_traits/detail/ice_and.hpp ........ /usr/include/boost/type_traits/detail/ice_not.hpp ........ /usr/include/boost/type_traits/detail/bool_trait_def.hpp ......... /usr/include/boost/type_traits/detail/template_arity_spec.hpp ........ /usr/include/boost/type_traits/detail/bool_trait_undef.hpp ..... /usr/include/boost/type_traits/add_pointer.hpp ...... /usr/include/boost/type_traits/remove_reference.hpp ....... /usr/include/boost/type_traits/broken_compiler_spec.hpp ....... /usr/include/boost/type_traits/detail/type_trait_def.hpp ........ /usr/include/boost/type_traits/detail/template_arity_spec.hpp ....... /usr/include/boost/type_traits/detail/type_trait_undef.hpp ...... /usr/include/boost/type_traits/detail/type_trait_def.hpp ....... /usr/include/boost/type_traits/detail/template_arity_spec.hpp ...... /usr/include/boost/type_traits/detail/type_trait_undef.hpp ..... /usr/include/boost/type_traits/add_const.hpp ...... /usr/include/boost/type_traits/detail/type_trait_def.hpp ....... /usr/include/boost/type_traits/detail/template_arity_spec.hpp ...... /usr/include/boost/type_traits/detail/type_trait_undef.hpp ..... /usr/include/boost/utility/addressof.hpp ..... /usr/include/c++/4.0.2/iosfwd ...... /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/c++locale.h ....... /usr/include/c++/4.0.2/cstring ........ /usr/include/string.h ......... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ....... /usr/include/c++/4.0.2/cstdio ........ /usr/include/stdio.h ......... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ......... /usr/include/libio.h .......... /usr/include/_G_config.h ........... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ........... /usr/include/wchar.h ............ /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ............ /usr/include/bits/wchar.h ........... /usr/include/gconv.h ............ /usr/include/wchar.h ............. /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ............ /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h .......... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stdarg.h ......... /usr/include/bits/stdio_lim.h ......... /usr/include/bits/sys_errlist.h ....... /usr/include/c++/4.0.2/clocale ........ /usr/include/locale.h ......... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ......... /usr/include/bits/locale.h ....... /usr/include/langinfo.h ........ /usr/include/nl_types.h ........ /usr/include/bits/locale.h ....... /usr/include/iconv.h ........ /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ....... /usr/include/libintl.h ...... /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/c++io.h ....... /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/gthr.h ........ /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/gthr-default.h ......... /usr/include/pthread.h .......... /usr/include/sched.h ........... /usr/include/time.h ........... /usr/include/bits/sched.h .......... /usr/include/time.h ........... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ........... /usr/include/bits/time.h .......... /usr/include/signal.h ........... /usr/include/bits/sigset.h .......... /usr/include/bits/setjmp.h ........... /usr/include/bits/wordsize.h .......... /usr/include/bits/wordsize.h ...... /usr/include/c++/4.0.2/cctype ....... /usr/include/ctype.h ...... /usr/include/c++/4.0.2/bits/stringfwd.h ...... /usr/include/c++/4.0.2/bits/postypes.h ....... /usr/include/c++/4.0.2/cwchar ........ /usr/include/c++/4.0.2/ctime ........ /usr/include/wchar.h ......... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stdarg.h ......... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ....... /usr/include/stdint.h ........ /usr/include/bits/wordsize.h ...... /usr/include/c++/4.0.2/bits/functexcept.h ....... /usr/include/c++/4.0.2/exception_defines.h ..... /usr/include/boost/test/detail/suppress_warnings.hpp ..... /usr/include/boost/test/detail/enable_warnings.hpp .... /usr/include/boost/test/utils/wrap_stringstream.hpp ..... /usr/include/c++/4.0.2/sstream ...... /usr/include/c++/4.0.2/istream ....... /usr/include/c++/4.0.2/ios ........ /usr/include/c++/4.0.2/exception ........ /usr/include/c++/4.0.2/bits/char_traits.h ......... /usr/include/c++/4.0.2/bits/stl_algobase.h .......... /usr/include/c++/4.0.2/climits ........... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/limits.h .......... /usr/include/c++/4.0.2/bits/cpp_type_traits.h .......... /usr/include/c++/4.0.2/bits/stl_iterator_base_types.h .......... /usr/include/c++/4.0.2/bits/stl_iterator_base_funcs.h ........... /usr/include/c++/4.0.2/bits/concept_check.h .......... /usr/include/c++/4.0.2/bits/stl_iterator.h .......... /usr/include/c++/4.0.2/debug/debug.h ........... /usr/include/c++/4.0.2/cassert ............ /usr/include/assert.h ........... /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h ........ /usr/include/c++/4.0.2/bits/localefwd.h ........ /usr/include/c++/4.0.2/bits/ios_base.h ......... /usr/include/c++/4.0.2/bits/atomicity.h .......... /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/atomic_word.h ......... /usr/include/c++/4.0.2/bits/locale_classes.h .......... /usr/include/c++/4.0.2/string ........... /usr/include/c++/4.0.2/memory ............ /usr/include/c++/4.0.2/bits/allocator.h ............. /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/c++allocator.h .............. /usr/include/c++/4.0.2/ext/mt_allocator.h ............... /usr/include/c++/4.0.2/new ............ /usr/include/c++/4.0.2/bits/stl_construct.h ............ /usr/include/c++/4.0.2/bits/stl_uninitialized.h ............ /usr/include/c++/4.0.2/bits/stl_raw_storage_iter.h ............ /usr/include/c++/4.0.2/limits ........... /usr/include/c++/4.0.2/bits/stl_function.h ........... /usr/include/c++/4.0.2/bits/basic_string.h ........... /usr/include/c++/4.0.2/algorithm ............ /usr/include/c++/4.0.2/bits/stl_algo.h ............. /usr/include/c++/4.0.2/bits/stl_heap.h ............. /usr/include/c++/4.0.2/bits/stl_tempbuf.h ........... /usr/include/c++/4.0.2/bits/basic_string.tcc ........ /usr/include/c++/4.0.2/streambuf ......... /usr/include/c++/4.0.2/bits/streambuf.tcc ........ /usr/include/c++/4.0.2/bits/basic_ios.h ......... /usr/include/c++/4.0.2/bits/streambuf_iterator.h ......... /usr/include/c++/4.0.2/bits/locale_facets.h .......... /usr/include/c++/4.0.2/cwctype ........... /usr/include/wctype.h ............ /usr/lib/gcc/x86_64-linux-gnu/4.0.2/include/stddef.h .......... /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/ctype_base.h .......... /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/ctype_inline.h .......... /usr/include/c++/4.0.2/bits/codecvt.h .......... /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/time_members.h .......... /usr/include/c++/4.0.2/x86_64-linux-gnu/bits/messages_members.h ......... /usr/include/c++/4.0.2/bits/basic_ios.tcc ....... /usr/include/c++/4.0.2/bits/istream.tcc ........ /usr/include/c++/4.0.2/locale ......... /usr/include/c++/4.0.2/bits/locale_facets.tcc .......... /usr/include/c++/4.0.2/typeinfo ........ /usr/include/c++/4.0.2/ostream ......... /usr/include/c++/4.0.2/bits/ostream.tcc ...... /usr/include/c++/4.0.2/bits/sstream.tcc ....... /usr/include/c++/4.0.2/sstream ..... /usr/include/boost/test/detail/suppress_warnings.hpp ..... /usr/include/boost/test/detail/enable_warnings.hpp .... /usr/include/boost/test/utils/basic_cstring/basic_cstring.hpp ..... /usr/include/boost/test/utils/basic_cstring/basic_cstring_fwd.hpp ..... /usr/include/boost/test/utils/basic_cstring/bcs_char_traits.hpp ...... /usr/include/boost/test/detail/suppress_warnings.hpp ...... /usr/include/boost/test/detail/enable_warnings.hpp ..... /usr/include/boost/test/detail/suppress_warnings.hpp ..... /usr/include/boost/test/detail/enable_warnings.hpp .... /usr/include/boost/shared_ptr.hpp ..... /usr/include/boost/assert.hpp ...... /usr/include/assert.h ..... /usr/include/boost/checked_delete.hpp ..... /usr/include/boost/throw_exception.hpp ..... /usr/include/boost/detail/shared_count.hpp ...... /usr/include/boost/detail/bad_weak_ptr.hpp ...... /usr/include/boost/detail/sp_counted_base.hpp ....... /usr/include/boost/detail/sp_counted_base_gcc_x86.hpp ...... /usr/include/boost/detail/sp_counted_impl.hpp ...... /usr/include/c++/4.0.2/functional .... /usr/include/boost/test/detail/suppress_warnings.hpp .... /usr/include/boost/test/detail/enable_warnings.hpp ... /usr/include/boost/test/detail/global_typedef.hpp .... /usr/include/boost/test/detail/suppress_warnings.hpp .... /usr/include/boost/test/detail/enable_warnings.hpp ... /usr/include/boost/test/detail/workaround.hpp .... /usr/include/c++/4.0.2/iterator ..... /usr/include/c++/4.0.2/bits/stream_iterator.h .... /usr/include/boost/test/detail/suppress_warnings.hpp .... /usr/include/boost/test/detail/enable_warnings.hpp ... /usr/include/boost/test/utils/basic_cstring/io.hpp .... /usr/include/boost/test/detail/suppress_warnings.hpp .... /usr/include/boost/test/detail/enable_warnings.hpp ... /usr/include/boost/preprocessor/seq/enum.hpp ... /usr/include/boost/preprocessor/arithmetic/add.hpp .... /usr/include/boost/preprocessor/control/while.hpp ..... /usr/include/boost/preprocessor/detail/auto_rec.hpp ..... /usr/include/boost/preprocessor/list/fold_left.hpp ...... /usr/include/boost/preprocessor/control/while.hpp ...... /usr/include/boost/preprocessor/detail/auto_rec.hpp ...... /usr/include/boost/preprocessor/list/detail/fold_left.hpp ....... /usr/include/boost/preprocessor/list/adt.hpp ........ /usr/include/boost/preprocessor/detail/is_binary.hpp ......... /usr/include/boost/preprocessor/detail/check.hpp ........ /usr/include/boost/preprocessor/logical/compl.hpp ..... /usr/include/boost/preprocessor/list/fold_right.hpp ...... /usr/include/boost/preprocessor/detail/auto_rec.hpp ...... /usr/include/boost/preprocessor/list/detail/fold_right.hpp ....... /usr/include/boost/preprocessor/list/reverse.hpp ..... /usr/include/boost/preprocessor/logical/bitand.hpp ..... /usr/include/boost/preprocessor/control/detail/while.hpp ... /usr/include/boost/limits.hpp ... /usr/include/boost/type_traits/is_array.hpp .... /usr/include/boost/type_traits/detail/bool_trait_def.hpp ..... /usr/include/boost/type_traits/detail/template_arity_spec.hpp .... /usr/include/boost/type_traits/detail/bool_trait_undef.hpp ... /usr/include/boost/type_traits/is_function.hpp .... /usr/include/boost/type_traits/is_reference.hpp ..... /usr/include/boost/type_traits/detail/bool_trait_def.hpp ...... /usr/include/boost/type_traits/detail/template_arity_spec.hpp ..... /usr/include/boost/type_traits/detail/bool_trait_undef.hpp .... /usr/include/boost/type_traits/detail/false_result.hpp .... /usr/include/boost/type_traits/detail/is_function_ptr_helper.hpp .... /usr/include/boost/type_traits/detail/bool_trait_def.hpp ..... /usr/include/boost/type_traits/detail/template_arity_spec.hpp .... /usr/include/boost/type_traits/detail/bool_trait_undef.hpp ... /usr/include/boost/mpl/or.hpp .... /usr/include/boost/mpl/aux_/config/use_preprocessed.hpp .... /usr/include/boost/mpl/aux_/nested_type_wknd.hpp .... /usr/include/boost/mpl/aux_/na_spec.hpp ..... /usr/include/boost/mpl/lambda_fwd.hpp ...... /usr/include/boost/mpl/void_fwd.hpp ...... /usr/include/boost/mpl/aux_/na.hpp ....... /usr/include/boost/mpl/aux_/na_fwd.hpp ...... /usr/include/boost/mpl/aux_/lambda_arity_param.hpp ..... /usr/include/boost/mpl/aux_/arity.hpp ...... /usr/include/boost/mpl/aux_/config/dtp.hpp ..... /usr/include/boost/mpl/aux_/preprocessor/enum.hpp ..... /usr/include/boost/mpl/aux_/preprocessor/def_params_tail.hpp ...... /usr/include/boost/mpl/limits/arity.hpp ...... /usr/include/boost/preprocessor/logical/and.hpp ...... /usr/include/boost/preprocessor/identity.hpp ....... /usr/include/boost/preprocessor/facilities/identity.hpp ...... /usr/include/boost/preprocessor/empty.hpp ...... /usr/include/boost/preprocessor/arithmetic/sub.hpp ..... /usr/include/boost/mpl/aux_/config/eti.hpp .... /usr/include/boost/mpl/aux_/include_preprocessed.hpp ..... /usr/include/boost/mpl/aux_/config/compiler.hpp ..... /usr/include/boost/preprocessor/stringize.hpp ..... /usr/include/boost/mpl/aux_/preprocessed/gcc/or.hpp ... /usr/include/boost/test/detail/suppress_warnings.hpp ... /usr/include/boost/test/detail/enable_warnings.hpp .. /usr/include/boost/test/unit_test_suite.hpp ... /usr/include/boost/test/utils/callback.hpp .... /usr/include/boost/test/detail/suppress_warnings.hpp .... /usr/include/boost/test/detail/enable_warnings.hpp ... /usr/include/boost/test/detail/fwd_decl.hpp ... /usr/include/c++/4.0.2/list .... /usr/include/c++/4.0.2/bits/stl_list.h .... /usr/include/c++/4.0.2/bits/list.tcc ... /usr/include/c++/4.0.2/vector .... /usr/include/c++/4.0.2/bits/stl_vector.h .... /usr/include/c++/4.0.2/bits/stl_bvector.h .... /usr/include/c++/4.0.2/bits/vector.tcc ... /usr/include/boost/test/detail/suppress_warnings.hpp ... /usr/include/boost/test/detail/enable_warnings.hpp unit_test_example_04.cpp:15: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:17: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:25: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:34: error: expected constructor, destructor, or type conversion before ‘;’ token unit_test_example_04.cpp:39: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:48: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:51: error: expected constructor, destructor, or type conversion before ‘(’ token unit_test_example_04.cpp:58: error: expected constructor, destructor, or type conversion before ‘;’ token mloskot@dog:~/dev/boost/_cvs/boost/libs/test/example$ Best regards -- Mateusz Loskot http://mateusz.loskot.net

2 11

Re: [Boost-users] SOLVED! Re: multi_index 1.33.0, known problems with RHEL 3 compiler (gcc 3.2.3)?
by JOAQUIN LOPEZ MU?Z 13 Mar '06

13 Mar '06

Hi Bert, ----- Mensaje original ----- De: bert hubert <bert.hubert(a)netherlabs.nl> Fecha: Domingo, Marzo 12, 2006 11:31 am Asunto: [Boost-users] SOLVED! Re: multi_index 1.33.0,known problems with RHEL 3 compiler (gcc 3.2.3)? > On Sat, Mar 11, 2006 at 10:03:21PM +0100, JOAQUIN_LOPEZ_MU?Z wrote: > > 2. You might try the equivalent expression: > > > > waiters_by_ttd_index_t& ttdindex= > > boost::multi_index::get<KeyTag>(d_waiters); > > Indeed, that solved the problem! I think what confused the older > 'weaker'gcc is that all this code is within a template class. > Thank you Joaquin! See > http://mailman.powerdns.com/pipermail/pdns-users/2006- > March/003140.html [...] Good! Thanks for using Boost.MultiIndex, hope you're enjoying it. > > Another question, I now have this: > struct CacheEntry > { > CacheEntry(const string& name, const vector<StoredRecord>& > records) : d_name(name), d_records(records) > {} > string d_name; > typedef vector<StoredRecord> records_t; > records_t d_records; > uint32_t getTTD() const > { > uint32_t earliest=numeric_limits<uint32_t>::max(); > for(records_t::const_iterator i=d_records.begin(); i != > d_records.end(); ++i) > earliest=min(earliest, i->d_ttd); > return earliest; > } > }; > > typedef multi_index_container< > CacheEntry, > indexed_by < > > hashed_unique<member<CacheEntry,string,&CacheEntry::d_name> >, > > ordered_non_unique<const_mem_fun<CacheEntry,uint32_t,&CacheEntry::getTT D> > > > > > cache_t; > > I then fill up a cache_t object, but I find that pruning it takes > O(n^2)time based on how many entries I prune in one go. I'm now > pruning once every > 10 seconds, which takes 10 to 20ms per try, if I prune once every > 3 minutes, > pruning takes 10 seconds! > > The odd thing is that it appears to matter how much you prune in > one go, > without inserting something in the container in between. Perhaps > the cost is > amortized? > > The pruning code: [...] So, the prunning code goes like: /* 1 */ for(j=ttdindex.begin();j!=ttdindex.end();){ // leave to-be-pruned elements at the beginning // of ttdindex } /* 2 */ ttdindex.erase(ttdindex.begin(), j); So as to make sure, where do you observe the O(n^2) behavior, /* 1 */ or /* 2 */ (or both) ? Can you time both parts separately? Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 3

"Re: serialization : XML Schema?"
by m.korbosli 13 Mar '06

13 Mar '06

Jeff Flinn wrote: >Wouldn't this be best described by the Spirit grammar definition used >by xml_iarchive? I would be grateful if you give me a link or a file in which I can find more details about that. Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34 /mn) ; tél : 08 92 68 13 50 (0,34/mn)

3 3

Build a Universal Binary Boost library for Mac OSX
by Jwahar Bammi 13 Mar '06

13 Mar '06

Will appreciate a clear recipe to build Universal Binary boost libraries for Mac OSX (darwin). Boost is so wonderful, cant say the same for bjam ,,,,,,, Google'ing only pointed to the adobe patch I tried the adobe patch. Patched boost_1_33_1/tools/build/v2/tools/ darwin.jam then issued bjam -sarch=fat -sARCH=fat -sTOOLS=darwin stage (then install) did not make universal .dylibs. I suspect its got something to do with v1 vs v2 bjam or some such, i am just not grokking it. Will appreciate a ccokbook style recipe (have no particular desire to learn bjam) thanks bammi AT memento-inc DOT com

2 1

lambda and typeof, finally an effective in-place arithmetic metafunction generator.
by pongba 13 Mar '06

13 Mar '06

Okay, just image some sort of code like this: typedef mpl::vector_c<int,1,2,3> v; typedef mpl::accumulate<v,int_<0>,MPL_METAFUNC(_1*CONS(10)+_2)>::type::value result_value; // =123 Imaginably, the implementation of MPL_METAFUNC would involve BOOST_TYPEOF to deduce the type of "_1*CONS(10)+_2" so as to construct a corresponding metafunction, that is, "mpl::plus<_2,mpl::times<_1,int_<10> > >" (CONS here is used to work around the embarrassment that 10 becomes sort of variable when passed directly to operator*, so we use CONS(10) which expands into something like "int_<10>()" which entirely preserve "10" at compile-time). Arguably this is feasible, but I lack the time to implement it fully. (although it would be pretty simple, e.g. #define DEFINE_BINARY_OP(op,mpl_binray_op) \ template <typename T, typename U> \ mpl_binary_op<T,U> operator op (T t, U u) \ { \ return mpl_binary_op<T,U>(); \ } \ DEFINE_OP(+,mpl::plus) DEFINE_OP(-,mpl::minus) DEFINE_OP(*,mpl::times) DEFINE_OP(/,mpl::divide) ... Admittedly, there exists a name confliction between mpl::_1 and lambda::_1 due to the inherent difference between type and variable in the language, so we couldn't use the same _1 and _2 in both "plus<_1,_2>" and "_1+_2". Any good remedies for that?(of course we could always turn to "_1()+_2()" in which _1/2 means mpl::_1/2) My question is: Is this valuable?(IMO,it'll make arithmetic operation in metaprogramming much easier and clearer, just watch "_1*10+_2" v.s. "mpl::plus<_2,mpl::times<_1,int_<10> > >" you'll see that). And if it is, would Dave consider adding it to MPL? Thanks in advance! -- Regards!

1 0

serialization : XML Schema?
by m.korbosli 13 Mar '06

13 Mar '06

Hi, I 'm working on a project where I want to parse XML archives generated by boost serialization library, except that I didn't find any serialization's specification or XML schema describing this mechanism. Is there any documentation providing this? Thanks Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34 /mn) ; tél : 08 92 68 13 50 (0,34/mn)

3 3

"Re: serialization : XML Schema?"
by m.korbosli 13 Mar '06

13 Mar '06

Vladimir Prus wrote: >>Was the original question about schema for specific serialized data >>types,or rather for general syntax of XML archives, regardless >>of the serialized types? It sounded like the latter for me. Yes, it's about the latter! I'm seeking a general syntax in order to verify the coherence of the serialized data when parsing XML archives. Is there anything about that? Thanks Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34 /mn) ; tél : 08 92 68 13 50 (0,34/mn)

2 1

BGL Graph - Edge_connectivity
by Adam Hartshorne 13 Mar '06

13 Mar '06

Hi All, What does the edge_connectivity function do? I can't find any reference to it in the online documentation. Adam

1 0

boost::serialization doesn't support iterators?
by 'Carlo Wood' 13 Mar '06

13 Mar '06

I looked for hours in the docs, because I couldn't believe that a serialization library that supports deep copying of pointers and STL containers wouldn't even MENTION iterators (after all, iterators are the pointers of the STL). However, it seems that boost::serialization simply does not support serializing iterators! Is this true? I really need to serialize iterators, how can I do that? -- Carlo Wood <carlo(a)alinoe.com>

6 9

Syntax of get for Variant and any_cast for Any
by Scott Meyers 13 Mar '06

13 Mar '06

It took me a little while to figure out that get<T> on a variant is really just the moral equivalent of dynamic_cast<T> with a funny syntax. I'd like to understand why, given a variant v, this syntax is used T* p = get<T>(&v); T& r = get<T>(v); instead of this: T* p = variant_cast<T*>(&v); T& r = variant_cast<T&>(v); any_cast on pointers also uses what I consider to be a counterintuitive syntax, using this (for an any object a) T* p = any_cast<T>(&a) instead of this: T* p = any_cast<T*>(&a) However, any_cast to a reference works with a syntax analogous to dynamic_cast. Implementing the "expected" syntax doesn't seem to be too difficult. For example, here's my quick cut at variant_cast: template<typename T, typename U1, typename U2, typename U3> T variant_cast(boost::variant<U1, U2, U3>& v) // ref { using namespace boost; BOOST_STATIC_ASSERT(is_reference<T>::value); return get<remove_reference<T>::type>(v); } template<typename T, typename U1, typename U2, typename U3> T variant_cast(const boost::variant<U1, U2, U3>& v) //ref-to-const { using namespace boost; BOOST_STATIC_ASSERT(is_reference<T>::value); return get<remove_reference<T>::type>(v); } template<typename T, typename U1, typename U2, typename U3> T variant_cast(boost::variant<U1, U2, U3> *pv) // ptr { using namespace boost; BOOST_STATIC_ASSERT(is_pointer<T>::value); return get<remove_pointer<T>::type>(pv); } template<typename T, typename U1, typename U2, typename U3> T variant_cast(const boost::variant<U1, U2, U3> *pv) // ptr-to-const { using namespace boost; BOOST_STATIC_ASSERT(is_pointer<T>::value); return get<remove_pointer<T>::type>(pv); } In a thread last month, Marc Mutz posted this approach to "normalizing" the syntax of any_cast: template <typename T> class any_cast2 : noncopyable { const any & m_any; public: explicit any_cast2( const any & v ) : m_any( v ) {} operator T() const { return any_cast<T>( m_any ); } }; template <typename T> class any_cast2<T*> : noncopyable { any * const m_any; public: explicit any_cast2( any * v ) : m_any( v ) {} operator T * () const { return any_cast<T>( m_any ); } }; template <typename T> class any_cast2<const T*> : noncopyable { const any * const m_any; public: explicit any_cast2( const any * v ) : m_any( v ) {} operator const T * () const { return any_cast<T>( m_any ); } }; template <typename T> class any_cast2<T&> : noncopyable { any & m_any; public: explicit any_cast2( any & v ) : m_any( v ) {} operator T & () const { return any_cast<T&>( m_any ); } }; template <typename T> class any_cast2<const T&> : noncopyable { const any & m_any; public: explicit any_cast2( const any & v ) : m_any( v ) {} operator const T & () const { return any_cast<const T&>( m_any ); } }; Maybe there are problems to these approaches -- I've hardly investigated them. But I would be interested to know if there is a good reason for the syntaxes for dynamic_cast, any_cast, and get to vary so much. Thanks, Scott

3 3

boost::serialization Bug
by Carlo Wood 13 Mar '06

13 Mar '06

Ok, it's not a "bug"... but it's damn annoying to get compiler warnings from library header. Especially when those compiler warnings are 1 page long. Is it possible to please not mention variables that aren't being used? This is what I get for a SINGLE warning: /usr/include/boost/archive/detail/interface_oarchive.hpp: In instantiation of ‘const boost::archive::detail::basic_pointer_oserializer* boost::archive::detail::interface_oarchive<Archive>::register_type(T*) [with T = std::set<DirTree, std::less<DirTree>, std::allocator<DirTree> >, Archive = boost::archive::xml_oarchive]’: /usr/include/boost/archive/detail/oserializer.hpp:332: instantiated from ‘static const boost::archive::detail::basic_pointer_oserializer* boost:: archive::detail::save_pointer_type<Archive, TPtr>::non_abstract<T>:: register_type(Archive&) [with T = std::set<DirTree, std::less<DirTree>, std::allocator<DirTree> >, Archive = boost::archive::xml_oarchive, TPtr = DirTrees*]’ /usr/include/boost/archive/detail/oserializer.hpp:349: instantiated from ‘static const boost::archive::detail::basic_pointer_oserializer* boost:: archive::detail::save_pointer_type<Archive, TPtr>::register_type(Archive&, T&) [with T = std::set<DirTree, std::less<DirTree>, std::allocator<DirTree> >, Archive = boost::archive::xml_oarchive, TPtr = DirTrees*]’ /usr/include/boost/archive/detail/oserializer.hpp:475: instantiated from ‘static void boost::archive::detail::save_pointer_type<Archive, TPtr>:: invoke(Archive&, TPtr) [with Archive = boost::archive::xml_oarchive, TPtr = DirTrees*]’ /usr/include/boost/archive/detail/oserializer.hpp:551: instantiated from ‘void boost::archive::save(Archive&, const T&) [with Archive = boost:: archive::xml_oarchive, T = DirTrees*]’ /usr/include/boost/archive/basic_xml_oarchive.hpp:84: instantiated from ‘void boost::archive::basic_xml_oarchive<Archive>::save_override(const boost::serialization::nvp<T>&, int) [with T = DirTrees* const, Archive = boost::archive::xml_oarchive]’ /usr/include/boost/archive/detail/interface_oarchive.hpp:80: instantiated from ‘Archive& boost::archive::detail::interface_oarchive<Archive>:: operator<<(const T&) [with T = boost::serialization::nvp<DirTrees* const>, Archive = boost::archive::xml_oarchive]’ ../../cppgraph/src/serialization.h:35: instantiated from ‘void Iterator<Container>::save(Archive&, unsigned int) const [with Archive = boost::archive::xml_oarchive, Container = DirTrees]’ /usr/include/boost/serialization/access.hpp:90: instantiated from ‘static void boost::serialization::access::member_save(Archive&, const T&, unsigned int) [with Archive = boost::archive::xml_oarchive, T = Iterator<DirTrees>]’ /usr/include/boost/serialization/split_member.hpp:42: instantiated from ‘static void boost::serialization::detail::member_saver<Archive, T>::invoke( Archive&, const T&, unsigned int) [with Archive = boost::archive:: xml_oarchive, T = Iterator<DirTrees>]’ /usr/include/boost/serialization/split_member.hpp:63: instantiated from ‘void boost::serialization::split_member(Archive&, T&, unsigned int) [with Archive = boost::archive::xml_oarchive, T = Iterator<DirTrees>]’ ../../cppgraph/src/serialization.h:46: instantiated from ‘void Iterator<Container>::serialize(Archive&, unsigned int) [with Archive = boost::archive::xml_oarchive, Container = DirTrees]’ /usr/include/boost/serialization/access.hpp:106: instantiated from ‘static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::xml_oarchive, T = Iterator<DirTrees>]’ /usr/include/boost/serialization/serialization.hpp:78: instantiated from ‘void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::xml_oarchive, T = Iterator<DirTrees>]’ /usr/include/boost/serialization/serialization.hpp:121: instantiated from ‘void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::xml_oarchive, T = Iterator<DirTrees>]’ /usr/include/boost/archive/detail/oserializer.hpp:148: instantiated from ‘void boost::archive::detail::oserializer<Archive, T>::save_object_data (boost::archive::detail::basic_oarchive&, const void*) const [with Archive = boost::archive::xml_oarchive, T = Iterator<DirTrees>]’ ../../cppgraph/src/serialization.cc:40: instantiated from here /usr/include/boost/archive/detail/interface_oarchive.hpp:60: warning: unused parameter ‘t’ Moreover, I normally treat warnings as errors (with -Werror); which is impossible when a third party library generates warnings. -- Carlo Wood <carlo(a)alinoe.com>

2 2

Trouble getting boost::ptr_container::ptr_map working
by Gustavo Ribeiro Alves 13 Mar '06

13 Mar '06

Hello, I'm writing an small library to represent types. Right now I'm focusing on representing type composition. For that I'm using the composite pattern as proposed by Gamma et al., so I have an abstract base class for my composites that has the virtual functions to addComposite members, but not their implementation. The header of my class looks like this: namespace dintype { class Type{ public: virtual ~Type()=0; typedef std::string Name_t; virtual void addComposition(const Name_t& name,Type* tp)=0; virtual void delComposition(const Name_t& name)=0; Type* clone() const; protected: typedef ptr_map<Name_t,Type> children_t; typedef children_t::iterator children_iterator; typedef children_t::const_iterator children_const_iterator; typedef children_t::size_type children_size_type; Type(); private: virtual Type* do_clone() const=0; }; inline Type* new_clone(const Type& c) { return c.clone(); } } The one for my composite class is: class CompositeType : public Type { private: children_t m_children; CompositeType(const CompositeType& r); virtual Type* do_clone(); protected: void clearAllCompositeChildren(); public: CompositeType(); virtual ~CompositeType(); virtual void addComposition(const Name_t& name,Type* tp); virtual void delComposition(const Name_t& name); }; Here is the implementation of the composite class: CompositeType::CompositeType(const CompositeType& r) : m_children(r.m_children.clone()) { } CompositeType::CompositeType() { } CompositeType::~CompositeType() { } void CompositeType::clearAllCompositeChildren() { m_children.erase(m_children.begin(),m_children.end()); } void CompositeType::addComposition(const Name_t& name,Type* tp) { m_children[name]=tp; // <========= THIS LINE IS THE PROBLEM } void CompositeType::delComposition(const Name_t& name) { m_children.erase(name); } I can't get the program to compile because gcc keeps complaining m_children[name] don't has operator= and that type is an abstract class and can't be initialized. I read all the boost::prt_container documentation and I couldn't find what I'm doing wrong. I also tried m_children.insert(name,tp); to no avail. I'll greatly appreciate any help. Thanks, Gustavo

1 0

Boost.Thread-RWLock
by george 12 Mar '06

12 Mar '06

hello! until boost 1.33.0 there was in the lib(boost thread) the RW locks now in 1.33.1 is of for deadlock reasons as I know... what about the next version of boost(1.33.2(??)),it would have it again? in the sandbox there is something... does somebody know when the next version will be ready?? I am working on a project and I wanna use RW locks,I dont want to use 1.33.0 RW locks not becouse I am afraid deadlock,the use of them will be simple,but becouse I want to use the latest stable vesrion. thanks!

1 0

Re: [Boost-users] multi_index 1.33.0, known problems with RHEL 3 compiler (gcc 3.2.3)?
by JOAQUIN LOPEZ MU?Z 12 Mar '06

12 Mar '06

----- Mensaje original ----- De: bert hubert <bert.hubert(a)netherlabs.nl> Fecha: Sábado, Marzo 11, 2006 6:39 pm Asunto: [Boost-users] multi_index 1.33.0,known problems with RHEL 3 compiler (gcc 3.2.3)? > Hi, > > Let me start off by saying that I consider multi_index to be the most > stunningly clever AND useful piece of c++ around. Thanks! > > A PowerDNS user on RHEL 3 with a gcc that calls itself 'gcc 3.2.3' > reportsthe following error compiling PowerDNS snapshot 576 > (http://svn.powerdns.com/snapshots/576/pdns- > 2.9.20.20060311.576.tar.gz):Message: > http://mailman.powerdns.com/pipermail/pdns-users/2006- > March/003134.html [...] > 285 typedef typename waiters_t::template index<KeyTag>::type > waiters_by_ttd_index_t;286 waiters_by_ttd_index_t& > ttdindex=d_waiters.get<KeyTag>(); > Any ideas, especially on a workaround? It compiles fine on all > gcc's I have > access to. > Hello Bert, I can try to investigate deeper into this next week, in the meantime let me suggest a couple of things: 1. Shouldn't be the expression waiters_by_ttd_index_t& ttdindex=d_waiters.get<KeyTag>(); written as waiters_by_ttd_index_t& ttdindex=d_waiters.template get<KeyTag>(); as d_waiters type is dependent on MTasker template args? Anyway, the error doesn't seem to be related to this, but who knows. 2. You might try the equivalent expression: waiters_by_ttd_index_t& ttdindex= boost::multi_index::get<KeyTag>(d_waiters); 3. Substituting identifiers (via an enum if you want to retain some legibility) for tags seem to reduce the stress on weaker compilers. If nothing of this works please let me know and I'll dig deeper once I've got access to a GCC environment next week. HTH, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

c++ parser with boost::spirit?
by Noel Yap 12 Mar '06

12 Mar '06

Has anyone created a c++ parser with boost::spirit? Thanks, Noel

8 12

[PP] comma in macro expansions
by Marc Mutz 11 Mar '06

11 Mar '06

Hi, I'm having a problem with "free" commas in macro expansions. I want to generate some function declarations (and implementations) from a user-supplied BOOST_PP_SEQ. The function declarations use enable_if to switch between two sets of interfaces based on the type that shall be returned. Nevermind the details, I've just used a trivial enabling condition here, the error is the same as when using mpl::contains<sometype, Type> in the real code. I've stripped the problem down and attached a test file, complete with my documented attempts to delay expansion of the comma somehow. The preprocessor succeeds when the enable_if or it's two template args are put into (parentheses), but this is no longer valid C++, of course. I guess I'm missing something, but I'm at the end of my Latin, as we say in Germany. Thanks, Marc -- Marc Mutz -- marc(a)klaralvdalens-datakonsult.se, mutz(a)kde.org Klarälvdalens Datakonsult AB, Platform-independent software solutions

2 1

boost::lambda question
by Robert Caldecott 11 Mar '06

11 Mar '06

OK, I'm a bit of a boost noob. I have a container of std::wstring's and I want to use a lambda expression in a for_each loop to pass each string to a WinAPI function - however, I need access to the c_str() method, and this is giving me a problem. For example, if I want to use the DeleteFile WinAPI call, I want to write something like: std::vector<std::wstring> v; ... for_each(v.begin(), v.end(), ::DeleteFile(_1)); But the above won't work as I need to pass the 'C' string to ::DeleteFile. So, I really want to be able to do something like this: for_each(v.begin(), v.end(), ::DeleteFile(_1.c_str())); Any ideas how I can access a member function (like c_str()) using a lambda placeholder?

3 3

Re: [Boost-users] boost::lambda question
by Nat Goodspeed 11 Mar '06

11 Mar '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Rob Caldecott > Sent: Saturday, March 11, 2006 12:36 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] boost::lambda question > > Thanks Sebastian, but I am still struggling to make this work. I now get > the following error: > > "error C2664: 'DeleteFileW' : cannot convert parameter 1 from 'const > boost::lambda::lambda_functor<T>' to 'LPCWSTR'" [Nat] Don't you have to bind DeleteFileW as well? Something like (untested): for_each(v.begin(), v.end(), bind(::DeleteFileW, bind(&wstring::c_str, _1))); I think this phrasing should work with either boost::lambda::bind or boost::bind.

3 2

multi_index 1.33.0, known problems with RHEL 3 compiler (gcc 3.2.3)?
by bert hubert 11 Mar '06

11 Mar '06

Hi, Let me start off by saying that I consider multi_index to be the most stunningly clever AND useful piece of c++ around. Thanks! A PowerDNS user on RHEL 3 with a gcc that calls itself 'gcc 3.2.3' reports the following error compiling PowerDNS snapshot 576 (http://svn.powerdns.com/snapshots/576/pdns-2.9.20.20060311.576.tar.gz) Message: http://mailman.powerdns.com/pipermail/pdns-users/2006-March/003134.html mtasker.cc: In member function `bool MTasker<EventKey, EventVal>::schedule() [with EventKey = PacketID, EventVal = std::string]': pdns_recursor.cc:723: instantiated from here mtasker.cc:286: no matching function for call to `boost::multi_index::multi_index_container<MTasker<PacketID, std::string>::Waiter, boost::multi_index::indexed_by<boost::multi_index::ordered_unique<boost::multi_index::member<MTasker<PacketID, std::string>::Waiter, PacketID, &MTasker<PacketID, std::string>::Waiter::key>, mpl_::na, mpl_::na>, boost::multi_index::ordered_non_unique<boost::multi_index::tag<MTasker<PacketID, std::string>::KeyTag, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, boost::multi_index::member<MTasker<PacketID, std::string>::Waiter, time_t, &MTasker<PacketID, std::string>::Waiter::ttd>, mpl_::na>, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, std::allocator<MTasker<PacketID, std::string>::Waiter> >::get()' make[3]: *** [pdns_recursor.o] Error 1 make[3]: Leaving directory /temp/pdns-2.9.20.20060311.576/pdns' To reproduce, download the tar file, run ./configure --with-modules="" ; cd pdns ; make pdns_recursor, besides boost there are no dependencies when compiled like this. Relevant details from mtasker.hh http://wiki.powerdns.com/projects/trac/browser/trunk/pdns/pdns/mtasker.cc?r… 60 struct KeyTag {}; 61 typedef multi_index_container< 62 Waiter, 63 indexed_by < 64 ordered_unique<member<Waiter,EventKey,&Waiter::key> >, 65 ordered_non_unique<tag<KeyTag>, member<Waiter,time_t,&Waiter::ttd> > 66 > 67 > waiters_t; 68 69 waiters_t d_waiters; >From mtasker.cc: http://wiki.powerdns.com/projects/trac/browser/trunk/pdns/pdns/mtasker.hh?r… 285 typedef typename waiters_t::template index<KeyTag>::type waiters_by_ttd_index_t; 286 waiters_by_ttd_index_t& ttdindex=d_waiters.get<KeyTag>(); Any ideas, especially on a workaround? It compiles fine on all gcc's I have access to. Thanks! -- http://www.PowerDNS.com Open source, database driven DNS Software http://netherlabs.nl Open and Closed source services

1 0

Books on/using Boost
by Scott Meyers 11 Mar '06

11 Mar '06

I'm interested in books on or making significant use of Boost. Books on Boost include those on the BGL and the MPL, plus Karlsson's overview of Boost. Are there others? The only book I know of that makes extensive use of Boost is "C++ Cookbook" by D. Ryan Stephens et al. from O'Reilly. Are there others? Thanks, Scott

2 1

[serialization] Creating new archives derived from polymorphic archive
by Robert S. Grimes 11 Mar '06

11 Mar '06

Hi, How do I get started? I want to create a set of custom archives that include such features as a small header, CRC, digital signatures, etc. I want to put this into a DLL, so I want to go the polymorphic route. There are directions for creating new archives from the template versions, but not for the polymorphic versions. I'm not sure the starting point is the same, so I thought I'd ask first, as this is stretching my abilities a bit. Thanks, -Bob

2 4

Re: [Boost-users] Syntax of get for Variant and any_cast for Any
by Sohail Somani 10 Mar '06

10 Mar '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Scott Meyers > Sent: Friday, March 10, 2006 2:04 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Syntax of get for Variant and > any_cast for Any > My only other knowledge of "get" is from tuple, where "get" > takes a compile-time > constant, not a type, as an argument. With that background, > I found the use of > "get" for variant initially confusing. I think it'd be > better to find a name > with the "_cast" suffix and to explicitly specify pointer and > reference types > (as with dynamic_cast) and adopt that convention. I don't > know enough about the > various Boost libraries to know whether that is a reasonable > suggestion. I think shared_ptr has dynamic_pointer_cast or something. This is much easier to read than get

1 0

[BGL] graph copy after Kruskal's algorithm?
by Alejandro Aragón 10 Mar '06

10 Mar '06

Hi all, After running Kruskal's algorithm I end up with the list of the edges that form the minimum cost. However, no new graph is created. I need the resulting graph for further computations. How do you create a graph from an existing one but only selecting the edges contained in the minimum spanning tree vector? I've seen that there are some functions to accomplish this but I couldn't find any example of how to do it: template <class EdgeIterator, class EdgePropertyIterator> adjacency_list(EdgeIterator first, EdgeIterator last, EdgePropertyIterator ep_iter, vertices_size_type n, vertices_size_type m = 0, const GraphProperty& p = GraphProperty()) The existing graph has properties in edges and vertices that I also need to keep. Can anyone help? Thank you all, A.Aragon

4 6

Re: [Boost-users] Help needed with random exponential_distribution
by dahaverk＠rockwellcollins.com 10 Mar '06

10 Mar '06

It seems my problem is with the rand48 function. With Boost_1_29_0 ---> sizeof(boost::rand48)=8 e.g. the size of a double. With Boost_1_33_1 ---> sizeof(boost::rand48)=16 e.g. twice the size of a double. Because of the truncation that happened with the boost_1_29_0 We were seeing a correctly randomized distribution for the exponential_distribution. Is this a config problem? If so, where do I fix the "boost::rand48" to be a "double" again? I did run the boost ./configure on the Boost_1_33_1 directory before I started using it on the Sun Sparc Solaris8 machine. Thanks, Dave

1 0

Boost Statechart: general questionss about what the library can do
by RIVASSEAU Jean Noel 10 Mar '06

10 Mar '06

Hi there, I am almost entirely new to state machines, finite automata (by almost I mean that I know the concept and very little of the theory). However I need to evaluate if the Boost library can meet the requirements of a project I plan to use it on. Basically I have two questions: First and most important: Is it possible to *ask* the state machine to go from a state A to a state B *automatically* ?? I mean, I am in state A. I need to go to State B, but I cannot go straight from A to B, I must go first through state C, D, E and finally B for example. Can the library automatically compute a path and generate the correct transitions (event)?? If it is not possible, I would like to know if it is a fundamental problem (theorical with state automata, common to any library implementation) or just something that Boost Statechart does not provide, but other implementations could. Note that it is not necessarily for me that the automata computes the "best" or "shortest" path (set of transitions) it must just generate correct transitions that I can log. My second question is easier, more implementation related, and I think the answer is yes, but anyway: When a transition is executed (automatically, or explicitely), can I call a function? That is, when an event is processed, can I implement some code that will be executed each time an event is processed ? Thank you!! Jean-Noël Ps: Is this the correct place to discuss Boost Statechart, since it is not yet part of the official Boost package (distribution) ?

2 1

[statechart] - passing data between states during state transission?
by Oliver.Kowalke＠infineon.com 10 Mar '06

10 Mar '06

Hello, I want to pass data from outside into the state machine and pass the data from one state to the next state during state transition. But it seams that statechart doesn't support this. Could this feature be added? What is the preferred way which statechart suggests? With best regards, Oliver #include <iostream> #include <stdexcept> #include <boost/statechart/custom_reaction.hpp> #include <boost/statechart/event.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/statechart/state_machine.hpp> namespace sc = boost::statechart; struct ev_activate : public sc::event< ev_activate > { int data; ev_activate( int d) : data( d) {} }; struct inactive; struct sm : public sc::state_machine< sm, inactive > {}; struct active : public sc::simple_state< active, sm > { active( int i) { std::cout << "active(): " << i << std::endl; } }; struct inactive : public sc::simple_state< inactive, sm > { typedef sc::custom_reaction< ev_activate > reactions; sc::result react( ev_activate const& ev) { return transit< active >( ev.data); // passing data to new state during transition } }; int main() { try { sm fsm; fsm.initiate(); fsm.process_event( ev_activate( 1) ); // passing data from outside return 0; } catch ( std::runtime_error const& e) { std::cerr << e.what() << std::endl; } catch (...) { std::cerr << "unhandled exception" << std::endl; } return -1; }

2 1

vertex property setting
by Camille Lemen 10 Mar '06

10 Mar '06

Hi all! I'm new at using boost and my request certainly is obvious but I can't manage to get the error... I am trying to set std::vector's type vertex properties in a graph. But it does not want te set a property to more than one edge. The program is the following: /****************************************code*****************************/ #include <vector> #include <iostream> #include <list> #include <map> //boost includes #include <boost/property_map.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/graph/properties.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adjacency_matrix.hpp> using namespace std; enum edge_intersec_t { edge_intersec }; enum edge_dist_t { edge_dist }; enum vertex_param_t { vertex_param}; namespace boost { BOOST_INSTALL_PROPERTY(edge, intersec); BOOST_INSTALL_PROPERTY(edge, dist); BOOST_INSTALL_PROPERTY(vertex, param); } using namespace boost; typedef property<edge_intersec_t, unsigned int, property<edge_dist_t,float> > EdgeProp; typedef property<vertex_param_t,std::vector<float> > VertexProp; typedef adjacency_list<setS,vecS, bidirectionalS,VertexProp,EdgeProp> Graph; typedef graph_traits<Graph>::edge_descriptor edge_descriptor; int main(int argc, char** argv) { int NbRegions = 9; Graph g(NbRegions); edge_descriptor e; bool inserted; tie(e,inserted) = add_edge(vertex(0,g),vertex(1,g),EdgeProp(0,20),g); tie(e,inserted) = add_edge(vertex(0,g),vertex(2,g),0,g); tie(e,inserted) = add_edge(vertex(1,g),vertex(2,g),0,g); tie(e,inserted) = add_edge(vertex(3,g),vertex(4,g),0,g); tie(e,inserted) = add_edge(vertex(3,g),vertex(5,g),0,g); tie(e,inserted) = add_edge(vertex(3,g),vertex(7,g),0,g); tie(e,inserted) = add_edge(vertex(4,g),vertex(5,g),0,g); tie(e,inserted) = add_edge(vertex(5,g),vertex(6,g),0,g); tie(e,inserted) = add_edge(vertex(1,g),vertex(4,g),50,g); tie(e,inserted) = add_edge(vertex(1,g),vertex(3,g),100,g); tie(e,inserted) = add_edge(vertex(0,g),vertex(4,g),200,g); tie(e,inserted) = add_edge(vertex(2,g),vertex(5,g),500,g); tie(e,inserted) = add_edge(vertex(2,g),vertex(6,g),20,g); tie(e,inserted) = add_edge(vertex(2,g),vertex(4,g),50,g); tie(e,inserted) = add_edge(vertex(0,g),vertex(3,g),50,g); std::vector<float> param(2); std::vector<float> propriete(2); param[0] = 800; std::cerr<<"param[0] = "<<param[0]<<std::endl; param[1] = 20; std::cerr<<"param[1] = "<<param[1]<<std::endl; put(vertex_param,g,vertex(0,g),param); propriete = get(vertex_param,g,vertex(0,g)); std::cout<<"propriete[0]: "<<propriete[0]<<", propriete[1]: "<<propriete[1]<<std::endl; param.clear(); param[0] = 2; std::cerr<<"param[0] = "<<param[0]<<std::endl; param[1] = 50; std::cerr<<"param[1] = "<<param[1]<<std::endl; put(vertex_param,g,vertex(1,g),param); propriete = get(vertex_param,g,vertex(1,g)); std::cout<<"propriete[0]: "<<propriete[0]<<", propriete[1]: "<<propriete[1]<<std::endl; return 0; } /************************************************************************/ it compiles and executes, but the property of the second vertex has not been asigned. Here is the result it gives: /***************command window*************************************/ param[0] = 800 param[1] = 20 propriete[0]: 800, propriete[1]: 20 param[0] = 2 param[1] = 50 propriete[0]: 800, propriete[1]: 20 /**************************************************************************/ I tried without using "propriete" but directly"get(vertex_param,g,vertex(1,g)) [0]", and it gives a segmentation fault during the execution which confirms that the vertex property has not been asigned to the second vertex. Thanks! Camille.

2 2

Re: [Boost-users] solved + bug with mingw (?) (was: [MPL] Need help crossing runtime boundary (lengthy))
by Ames Andreas 10 Mar '06

10 Mar '06

Hi all, I've solved my problem (FWIW, I attached member_notifier.cc). While trying it out, I observed that mingw (see attached mingw.out, it's gcc 3.4.4 with boost 1.33.0) can't compile that code. VC7.1 (boost 1.33.0) and VC8 (boost 1.33.1) accept the code and the exe runs as expected. Curiously a stripped down but very "similar" example (see attached inherit_test.cc) is also compiled by mingw. Is this mingw's or boost's fault, or is it even mine? cheers, aa -- Andreas Ames | Programmer | Comergo GmbH | Voice: +49 69 7505 3213 | andreas . ames AT comergo . com "I imagine Sisiphus as happy ..." Albert Camus

1 0

Re: [Boost-users] New User With Busted Compiler
by RIVASSEAU Jean Noel 10 Mar '06

10 Mar '06

I never used uBLAS, but the documentation for it in the 1.33.1 distribution says that gcc 3.3 is supported. Jean-Noël -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de V. Thane Norton III Envoyé : vendredi 3 mars 2006 02:27 À : Boost-users(a)lists.boost.org Objet : [Boost-users] New User With Busted Compiler I have just started using Boost, and am really enjoying using it, especially uBLAS. Unfortunately, my production code needs to use GCC 3.3 (for marketing reasons) which the Boost 1.33.1 uBLAS does not support. What is the latest version of Boost that I can use for uBLAS on GCC 3.3? Is there some hackery that I can perform to get 1.33.1 working? ----------------------------------------- V. Thane Norton III Macintosh Software Engineer Wacom Technology Corporation phone: 360.896.9833 x172 mailto:tnorton@wacom.com _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

[Announce] Mailing list downtime this Saturday
by Doug Gregor 10 Mar '06

10 Mar '06

All Boost mailing lists hosted at lists.boost.org will be down from 8pm to midnight EST this Saturday, March 11th while we migrate to a new, dedicated mail server provided by the Open Systems Lab at Indiana University. During this down time, the mail archives at lists.boost.org will be unavailable and any mail sent to lists.boost.org will be queued and forwarded. We ask that members refrain from posting messages to lists.boost.org during this time "just in case," although we expect that all mail sent during this time will be forwarded properly. If you should have any questions, please contact me directly at dgregor(a)cs.indiana.edu. Doug Gregor Boost Moderator dgregor(a)cs.indiana.edu

1 0

Date-time question
by Sliwa, Przemyslaw (London) 10 Mar '06

10 Mar '06

Hi, I would like to know if there is a way to get the string representation (3 chars) from a boost::gregorian::date, e.g. 10/03/2006 returns "Fri". This is a pretty fundamental functionality but I could not find anything in the documentation. I probably missed something. Could anyone help? Thanks Pshemek Kind regards Pshemek Przemyslaw Sliwa Global Foreign Exchange FX Risk Engine Development Merrill Lynch ( +44 (0)20 7995 4182 ) +44 (0)79 6325 2319 * Email: przemyslaw_sliwa(a)ml.com -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the sender, delete it and do not read, act upon, print, disclose, copy, retain or redistribute it. Click here for important additional terms relating to this e-mail. http://www.ml.com/email_terms/ --------------------------------------------------------

2 1

Re: [Boost-users] serialization: again a problem, failing to serializeastd::vector of pointers
by RIVASSEAU Jean Noel 10 Mar '06

10 Mar '06

Joaquín, Unfortunately, my example code which does not compile on my platform (gcc 3.4.2 on Win 2000 Pro) seems to compile with Robert's platform (same compiler !!), so it is very strange... Thus Robert has not been able to help further. Jean-Noël _____ De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Joaquín Mª López Muñoz Envoyé : vendredi 10 mars 2006 16:15 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] serialization: again a problem, failing to serializeastd::vector of pointers RIVASSEAU Jean Noel ha escrito: Hi Joaquin Jean-Noël, maybe you can try using the proposed patch at http://lists.boost.org/Archives/boost/2006/02/101539.php and report your results. I've got the hunch your problem might be related to the issue dealt with at that post. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users I replied to this, but did not hear from you again... Here was my reply below: Hello Jean-Noël, my apologies for not answering before, but I'm without a clue as to what the problem might be with your code... I suggested you applied the patches because the error messages seemed to be related to the problem I had been investigating in parallel, but looks like it is something else. Hasn't Robert assisted you? Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

Re: [Boost-users] serialization: again a problem, failing to serializeastd::vector of pointers
by Joaquín Mª López Muñoz 10 Mar '06

10 Mar '06

RIVASSEAU Jean Noel ha escrito: > Hi Joaquin > > Jean-Noël, maybe you can try using the proposed patch at > > http://lists.boost.org/Archives/boost/2006/02/101539.php > > and report your results. I've got the hunch your problem might > > be related to the issue dealt with at that post. > > Joaquín M López Muñoz > > Telefónica, Investigación y Desarrollo > > _______________________________________________ > > Boost-users mailing list > > Boost-users(a)lists.boost.org > > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > I replied to this, but did not hear from you again... Here was my > reply below: > Hello Jean-Noël, my apologies for not answering before, but I'm without a clue as to what the problem might be with your code... I suggested you applied the patches because the error messages seemed to be related to the problem I had been investigating in parallel, but looks like it is something else. Hasn't Robert assisted you? Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[BGL] Graph properties and dynamic properties
by Martin Palkovic 10 Mar '06

10 Mar '06

Hi, The example in http://www.boost.org/libs/graph/example/graphviz.cpp gives a hint how to use edge properties and vertex properties with dynamic properties when writing out the dot file. However, I would like to write out also graph properties, i.e. I have get_property(g, graph_overlap_t()) = "false"; dynamic_properties dp; dp.property("overlap", ?); dp.property("node_id", get(vertex_name_t(), g)); dp.property("strength", get(edge_strength_t(), g)); Thanks in advance for any help. Kind regards, Martin Palkovic

1 0

Re: [Boost-users] serialization: again a problem, failing to serializea std::vector of pointers
by RIVASSEAU Jean Noel 10 Mar '06

10 Mar '06

Hi Joaquin Jean-Noël, maybe you can try using the proposed patch at http://lists.boost.org/Archives/boost/2006/02/101539.php and report your results. I've got the hunch your problem might be related to the issue dealt with at that post. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users I replied to this, but did not hear from you again... Here was my reply below: At this url, I have found two hpp files. I replaced the ones that originally came with the Boost 1.3.1 distribution with these ones. I still have an error, at the same line, however it is: C:/Boost/include/boost-1_33_1/boost/archive/detail/iserializer.hpp:115: error: no type named `type' in `struct boost::serialization::type_info_implementation<std::vector<MemberVariableSpecification*, std::allocator<MemberVariableSpecification*> > >' C:/Boost/include/boost-1_33_1/boost/archive/detail/iserializer.hpp:115: error: `get_instance' is not a member of `<declaration error>' While it was: C:/Boost/include/boost-1_33_1/boost/archive/detail/iserializer.hpp:115: error: incomplete type `boost::serialization::extended_type_info_null<std::vector<MemberVariableSpecification*, std::allocator<MemberVariableSpecification*> > >' used in nested name specifier with the original code from Boost 1.33.1. So this patch effectively changed something, but it still not working. I've not read the entire thread at your url since I did not understand it (it was about a specific compiler issue ??). Any ideas? Jean-Noël

1 0

Re: [Boost-users] serialization: can someone compile this code with gcc 3.4 ?
by RIVASSEAU Jean Noel 10 Mar '06

10 Mar '06

Hello I am using gcc 3.4.2 (MinGW) and Boost 1.33.1 on Windows 2000 Professional. I am quite surprised that you manage to compile this code correctly, even with gcc. I still have the error; I tried your hints - I completely removed any header inclusion to _typeid.hpp, and included _no_rtti.hpp before any serialization or header archive, but it still fails exactly on the same problem as before (with the same error message). I am including my code here, if someone can try to compile it and report problems / successes it would be nice. Jean-Noël -----Message d'origine----- De : boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] De la part de Robert Ramey Envoyé : vendredi 3 mars 2006 17:53 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] serialization: again a problem,failing to serialize a std::vector of pointers OK - after changing some #include < to include "... I managed to compile all the modules - including ClassSpecification_serialization.cc - with the following compilers: VC 7.1, gcc 3.4, Comeau, Borland 5.64 and Borland 5.51 I compiled against my more recent version which may be different than the one you are using - I presume you're using 1.33? I did find a minor problem with gcc in some code I recently added but it is not related to this issue. So I can't reproduce your exact problem. I might give some hints though. The current system needs an extended_type_info implementation. This is specified by including a header - either extended_type_info_typeid.hpp or extended_type_info_no_rtti - which was just an example but I guess its been found to be useful now. If neither of these is expliclty #included, the system will #include extended_type_info_typeid.hpp and mark it as the "default". Its possible that in some of your files you're including "...no-rtti.pp" while in others nothing has been specified so that "..._typeid.hpp" is being included. As a test you might try including "..._no_rtti.hpp" above any serialization or archive headers. and see if that makes a difference. Robert Ramey RIVASSEAU Jean Noel wrote: > Sorry, I removed the QString stuff, so it should make more sense to > you now. I have attached the cleaned up code. If you try to compile > it, it will fail on the file > > ClassSpecification_serialization.cc > > with a message saying that there is a problem with the > extended_type_info of std::vector< MemberVariableSpecification *> > (since a member of ClassSpecification, which I serialize, is of this > type). > > Don't pay attention as to what are my real intentions on this example > code, this comes from my real project, and it would be long to > explain. Just let's say that, no, I am not trying to store class id > information into the archive, it is just that one data member of one > of object that I need to serialize has the name class_id (but it > could be named "walnut_field", the code would be the same). > > This small example code is just there to show you the bug that > occurs. > > As for the mixing of type systems (no_rtti and type_id), it was just > a test to see if that would change things. I have reverted it back in > the attached code (only no_rtti used) but it still does not work. > > Thank you > > Jean-Noël > > > > -----Message d'origine----- > De : boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] De la part de Robert > Ramey > Envoyé : jeudi 2 mars 2006 18:06 > À : boost-users(a)lists.boost.org > Objet : Re: [Boost-users] serialization: again a problem,failing to > serialize a std::vector of pointers > > I took a look at this and it made no sense to me. > > I couldn't compile it as it needed a file QString to compile. > > I did have occasion to look into the code and Its not obvious to me > what > your intention here. > > It looks like you're trying to store class id information into the > archive > so that the proper > class can be reconstructed. But that can't be it as the serialization > library already does that. > > Also I notice that you're using extended_type_info_typeid as well as > extended_type_info_no_rtti. > This is very odd to me as I would expect that one's environment > either has > rtti enable or it doesn't. > so I would expect either one or the other but not both. > > Anyway, sorrty I couldn't be more help. > > Robert Ramey > > "RIVASSEAU Jean Noel" <JN.RIVASSEAU(a)oberthurcs.com> wrote in message > news:87F60F7FA02FF749AFB02BD9FCAA6B04DA7ABF@naserv31.nanterre.oberthurcs.com... > Hello > > This is my last problem with the BSL but the most important one > (because > there is no workaround). > > I am trying to serialize a class (whose name is "ClassSpecification") > which > has a std::vector of pointers. The code for serializing the class the > pointer refer to (MemberVariableSpecification) is written and > instantiated > correctly. However I cannot correctly serialize the std::vector. It > fails > with a message complaining about: > > C:/Boost/include/boost-1_33_1/boost/archive/detail/iserializer.hpp:115: > error: incomplete type > `boost::serialization::extended_type_info_null<std::vector<MemberVariableSpecification*, > std::allocator<MemberVariableSpecification*> > >' used in nested name > specifier > > I do not understand why I need an extended_type_info for this vector. > I sure > need it for the class the pointers refer to (and I did specify it), > but the > std::vector itself is serialized as such, not as a pointer. Why do I > get > this error ??? > > Can you please check the attached code and help me? > > Thanks > > Jean-Noël > > Ps: using gcc 3.4.2 > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > > > > > > > > >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Re: [Boost-users] How to retrieve a value from a thread
by Sliwa, Przemyslaw (London) 09 Mar '06

09 Mar '06

I was though thread is created by a pointer to a function, e.g. Int foo(int x, int y, int z) { // do something with a,b,c return a+b+c; } Boost::thread pop(boost::bind(&foo, a, b, c)); // do something else pop.join(); The question is how to retrieve the result from foo running in pop. Thanks for ideas. Kind regards Pshemek Przemyslaw Sliwa Global Foreign Exchange FX Risk Engine Development Merrill Lynch ( +44 (0)20 7995 4182 ) +44 (0)79 6325 2319 * Email: przemyslaw_sliwa(a)ml.com -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Nat Goodspeed Sent: 09 March 2006 15:15 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] How to retrieve a value from a thread ________________________________________ From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Sliwa, Przemyslaw (London) Sent: Thursday, March 09, 2006 9:47 AM To: boost-users(a)lists.boost.org Subject: [Boost-users] How to retrieve a value from a thread I would like to know if it is possible to retrieve a value returned from a function which is called by a thread. [Nat] Is this thread running continuously, doing other things? Or did you start it for the purpose of calling that function, so that when the function is done the thread terminates? In Java, I've always kind of liked Doug Lea's FutureResult idiom: http://gee.oswego.edu/dl/classes/EDU/oswego/cs/dl/util/concurrent/Future Result.html I don't know of anything similar in the existing library. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the sender, delete it and do not read, act upon, print, disclose, copy, retain or redistribute it. Click here for important additional terms relating to this e-mail. http://www.ml.com/email_terms/ --------------------------------------------------------

3 2

Bug in boost/graph/detail/array_binary_tree.hpp ? [Boost 1_33_1]
by Marc Sturm 09 Mar '06

09 Mar '06

Hello, We use gcc 3.4 and 4.0 to compile our project OpenMS, which is based on boost. boost/graph/detail/array_binary_tree.hpp causes the following errors: ---------------------------------------------------- ../boost/graph/detail/array_binary_tree.hpp:157: error: no matching function for call to 'get(OpenMS::IteratorOffset<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >&, __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >&)' .../boost/graph/detail/array_binary_tree.hpp:158: error: no matching function for call to 'get(OpenMS::IteratorOffset<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >&, __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >&)' ---------------------------------------------------- This can be fixed by replacing the original lines: 157: edata[ boost::get(id, tmp) ] = i; 158: edata[ boost::get(id, value()) ] = x.i; by: 157: edata[ get(id, tmp) ] = i; 158: edata[ get(id, value()) ] = x.i; Is this a bug, or are we doing something wrong? Cheers, Marc -- ################################################## Marc Sturm University of Tuebingen Simulation of Biological Systems Sand 14, Room C323 D-72076 Tuebingen phone: +49 7071 29 70462 email: sturm(a)informatik.uni-tuebingen.de ##################################################

2 1

Re: [Boost-users] BGL connected_components for directed graphs
by Gavin Band 09 Mar '06

09 Mar '06

> Message: 1 > Date: Thu, 2 Mar 2006 15:53:40 -0500 > From: Doug Gregor <dgregor(a)cs.indiana.edu> > Subject: Re: [Boost-users] BGL connected_components for directed > graphs > To: boost-users(a)lists.boost.org > Message-ID: <a3b58932f7664328bbd614fec82f1a0e(a)cs.indiana.edu> > Content-Type: text/plain; charset=US-ASCII; format=flowed > > > On Feb 28, 2006, at 4:28 AM, Gavin Band wrote: <snip> > > Presumably this is some meta-program's way of telling me that my graph > > isn't undirected. > > Yes, that's what it's doing. connected_components() only works on > undirected graphs. > > > Is there any way to make this work for an directed > > graph? > > You can use the facilities for incremental connected components. Those > will work on an undirected graph. > In truth, our connected_components() should be modified to decide > between the DFS-based algorithm for undirected graphs and the > incremental algorithm for directed graphs. > Doug > Thank you for your answer - I will try that. However, I have some comments - forgive me if these have been made before or are just wishful thinking. As a mathematician, I tend to think of a directed graph as being also an undirected graph, just by forgetting the orientation of the edges. Then it should make sense to take connected_components() of any graph, directed or undirected, just by treating it as an undirected graph. However, I realise this conception may be naive in the context of the BGL, which has to deal with ways to store edges and their directions. Still - my graph seems to meet all of the formal requirements for connected_components, but to fail the (apparently informal) requirement that it be undirected (Under "Graph Concepts" in the documentation there is a discussion of directed vs. undirected graphs, but this stops short of a formal definition, unless I have misunderstood). Do think it is possible 1) to formalise the requirements for directed and undirected graphs, and 2) to write a graph adaptor undirected_graph<> which turns a directed graph G into its corresponding undirected graph H? Better yet, to use this (or some other method) to make the algorithms work for all graphs that they make (mathematical) sense for? Perhaps there are good reasons why this is not possible. Anyway, thanks again, Gavin.

2 1

[graph] [python]
by David E. Konerding 09 Mar '06

09 Mar '06

Hi folks, The bgl-python documentation says that the _graph.Graph.add_vertex() function returns a Vertex object. From my testing, the Vertex object that gets returned doesn't actually seem to be a member of the graph. Is this intentional? I was hoping that the returned Vertex object was valid, since I need access to it immediately. Here's a test program. I woudl expect the values for v1 and v2 to be in the graph, but they are not: =================== import boost.graph as bgl graph = bgl.Graph() v1 = graph.add_vertex() print "new v1=", v1 v2 = graph.add_vertex() print "new v2=", v2 e = graph.add_edge(v1, v2) print "new edge=", e for vertex in graph.vertices: print "vertex: ", vertex for edge in graph.edges: print "edge: ", edge print "edge source:", graph.source(e) ========================= Here's what I see: new v1= <boost.graph._graph.Vertex object at 0x40168a04> new v2= <boost.graph._graph.Vertex object at 0x40168aac> new edge= <boost.graph._graph.Edge object at 0x40164dec> vertex: <boost.graph._graph.Vertex object at 0x40168ae4> vertex: <boost.graph._graph.Vertex object at 0x40168b54> edge: <boost.graph._graph.Edge object at 0x40164d6c> edge source: <boost.graph._graph.Vertex object at 0x40168ae4> As you can see, v1 and v2 return and have different addresses than the Vertex objects that are listed by the vertices iterator. My guess here is that the Vertex objects do point to the same underlying vertex in the C++ implementation of the graph.

4 4

Re: [Boost-users] How to retrieve a value from a thread
by Nat Goodspeed 09 Mar '06

09 Mar '06

________________________________________ From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Sliwa, Przemyslaw (London) Sent: Thursday, March 09, 2006 9:47 AM To: boost-users(a)lists.boost.org Subject: [Boost-users] How to retrieve a value from a thread I would like to know if it is possible to retrieve a value returned from a function which is called by a thread. [Nat] Is this thread running continuously, doing other things? Or did you start it for the purpose of calling that function, so that when the function is done the thread terminates? In Java, I've always kind of liked Doug Lea's FutureResult idiom: http://gee.oswego.edu/dl/classes/EDU/oswego/cs/dl/util/concurrent/Future Result.html I don't know of anything similar in the existing library.

1 0

Help needed with random exponential_distribution
by dahaverk＠rockwellcollins.com 09 Mar '06

09 Mar '06

Hello, I am trying to convert from boost_1_29_0 to boost_1_33_1 with the random functions. I am using GCC 2.95.3 on Solaris 8. with the Older version of boost_1_29_0 We used the following: exp_(rnd_, 1.0/lambda_), // Initialization list Class constructor. And then used it as follows... lastArrival_ += exp_() * 1000.0; // rnd_.seed already initialized For boost_1_33_1 We changed this to be: exp_(1.0/lambda_), Then used it as follows: lastArrival_ += exp_(rnd_) * 1000.0; Declarations used: // exponential distribution to determine // arrival time double lambda_; boost::exponential_distribution<> exp_; boost::poisson_distribution<> poisson_; However, with the older 1_29 version of boost we were getting numbers such as 3.xxxxxx, 0.xxxxxxx and so on when I printed "exp_()" out. With the new boost_1_33_1 all I see printed out is "Infinite" for the value ot the "exp_(rnd_)" I'm new to boost so any help would be appreciated. This was someone else's code, and I am supposed to plug in the poisson_distribution, but I'd like it to work with the exponential_distribution as it did previously. I assume that I'm either not doing the Initialization correctly or didn't understand what the "Engine" was supposed to be to convert from the previous version. Any tips on using the boost poisson_distribution would be appreciated also. I am assuming Poisson will be initialized with "poisson_(lambda_)" and used as "lastArrival_ += poisson_(exp_) * 1000.0; " Thanks for any help. David Haverkamp

1 0

How to retrieve a value from a thread
by Sliwa, Przemyslaw (London) 09 Mar '06

09 Mar '06

All, I would like to know if it is possible to retrieve a value returned from a function which is called by a thread. Using boost::bind one can pass a list of arguments to a function which is called when the boost::thread starts. But I would like to know what will happen if the function returns a certain value, e.g. failure flag. Is there a way to retrieve it? The usual way would be to pass a reference to the function and then wait for the thread to join. Is there another way? Thanks a lot for help, Pshemek Przemyslaw Sliwa Global Foreign Exchange FX Risk Engine Development Merrill Lynch ( +44 (0)20 7995 4182 ) +44 (0)79 6325 2319 * Email: przemyslaw_sliwa(a)ml.com -------------------------------------------------------- If you are not an intended recipient of this e-mail, please notify the sender, delete it and do not read, act upon, print, disclose, copy, retain or redistribute it. Click here for important additional terms relating to this e-mail. http://www.ml.com/email_terms/ --------------------------------------------------------

1 0

[BGL] Why there is no special handler for "discover_source_vertex" event in BFS visitor?
by Dmitry 09 Mar '06

09 Mar '06

Hi there! Current implementation calls vis.discover_vertex(s, g); at this point, the same function being called for all others discovered vertices. I have one small problem wich could be nicely solved with such special handler and I believe that there are others when such handler could be usefull. Any suggestings why things is going exacly in this way? Best regards, --dima

3 2

TR1
by Thomas Gulbrandsen 09 Mar '06

09 Mar '06

Hello! I wan't to get started with tr1 and the unordered_set etc., but I can't find it. Can anyone tell me where I can download tr1 for VC8? -Thomas

3 3

Re: [Boost-users] Boost.Preprocessor with __LINE__ in MSVC71
by Wu Yinghui, Freddie 09 Mar '06

09 Mar '06

>>> -----Original Message----- >>> That's what I feel. The error message indicate that the >>> compiler somehow considers "id" and __LINE__ two identifier >>> when the error occurs. I tried using the /P parameter to dump >>> the preprocessed source, and that looked fine, though. So I >>> guess it is the problem with MSVC compiler mixing >>> preprocessing and parsing phases together... > > Yes. There is nothing that the pp-lib can do about it. I agree. But I pointed this out after much effort trying to debug the mysterious bug. Maybe it'd be better to document this in pp-lib's manual as "known issues?" That'd make future victims' lives easier. :) >>> > What do you mean by "certain scope"? Or, more precisely, >>> given a > finite scope such as that defined by a function, >>> why do you need > unique identifiers? Most of the time when >>> people want unique > identifiers, they want an identifier >>> that is unique across an entire > program or, at minimum, >>> inside a translation unit. >>> >>> Well... The scope can be the whole program, or in a >>> namespace, or in a translation unit. The unique ID is used in >>> a macro in the library for some tidious code that can be >>> automatically generated using preprocessor. > >For the record, doing this sort of thing is almost guaranteed to produce ODR >violations. With that said... Well... I think I know what I'm doing now. The use of __LINE__ (or __COUNTER__ on MSVC) is working for me after combining with some salt as keyword. Thanks for your concern, but the current solution seems suffice for me purpose. >>> Anyway, thanks for Stewart Tootill's suggestion. I had to >>> resort to using __COUNTER__ at the meantime, which seemed >>> working so far. (But one thing that worries me is that >>> __COUNTER__ is only unique within a translation unit. So what >>> if I need a unique identifier throughout the >>> program?) > >The pp-lib contains a similar construct, but it must be manually >updated. E.g. >#include BOOST_PP_UPDATE_COUNTER() >BOOST_PP_COUNTER() // 1 >#include BOOST_PP_UPDATE_COUNTER() >BOOST_PP_COUNTER() // 2 >BOOST_PP_COUNTER() // 2 >#include BOOST_PP_UPDATE_COUNTER() >BOOST_PP_COUNTER() // 3 But this is not documented. :( I didn't know its existence until you told me and then I did a grep.) >I could provide the means to seed this value for a translation unit, but I'm not >sure if this is really a good idea. Thoughts? I don't think there is a general solution for "all cases" here. (At least I don't have one with me right now.) But given some restricted usage, this solution actually works out quite well. BTW, I think I'm still sticking to __LINE__/__COUNTER__ solution for now, since it is not possible for me to encode the "#include ..." line into my macro. >Regards, >Paul Mensonides Thanks a lot for your efforts and insight! Cheers, Freddie

2 1

[Serialization] Status of bug in 1.33?
by Andrew Lin 09 Mar '06

09 Mar '06

Hi everyone, Some time back I wrote asking about a problem I was having with the 1.33 serialization library which turned out to be a bug: http://lists.boost.org/boost-users/2005/12/15969.php In short, custom archives had some kind of compilation failure which I never really understood, but which didn't fail in 1.32. Does anyone know what ever came of this? Is there a bug tracker where I can follow its status? (I didn't see it in the 1.33.1 release notes, so I'm assuming it's still broken.) I thought I'd be able to use 1.32 until 1.34 came out, but something has come up in the project which would be perfect for the multi_index library with hashing, new in 1.33. Thanks, Andrew ============================================================================================= Email transmissions can not be guaranteed to be secure or error-free, as information could be intercepted, corrupted, lost, destroyed, arrive late or incomplete, or contain viruses. The sender therefore does not accept liability for any errors or omissions in the contents of this message which arise as a result of email transmission. In addition, the information contained in this email message is intended only for use of the individual or entity named above. If the reader of this message is not the intended recipient, or the employee or agent responsible to deliver it to the intended recipient, you are hereby notified that any dissemination, distribution, or copying of this communication, disclosure of the parties to it, or any action taken or omitted to be taken in reliance on it, is strictly prohibited, and may be unlawful. If you are not the intended recipient please delete this email message. ==============================================================================================

2 1

[Lambda] Help with if_then_else
by Scott Meyers 09 Mar '06

09 Mar '06

Consider this (working) code using Boost.FileSystem: fs::directory_iterator di(dir); fs::directory_iterator end; while (di != end) { if (is_directory(*di)) cout << "D\n"; else cout << "~D\n"; ++di; } This looks like it should be lambda-able. Here's my attempt: for_each(fs::directory_iterator(dir), fs::directory_iterator(), if_then_else(bind(&fs::is_directory, _1), cout << "D\n", cout << "~D\n")); VC7.1 doesn't like this -- the diagnostics are below. Any idea how I can make this work? Thanks, Scott fs.cpp(39) : error C2784: 'const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::ifthenelse_action,boost::tuples: :tuple<boost::lambda::lambda_functor<Arg1>,boost::lambda::lambda_functor<Arg2>,boost::lambda::lambda_functor<Arg3>>>> boost::lambda::if_then_else (const boost::lambda::lambda_functor<Arg1> &,const boost::lambda::lambda_functor<Arg2> &,const boost::lambda::lambda_functor<Arg3> &)' : could no t deduce template argument for 'const boost::lambda::lambda_functor<T2> &' from 'std::basic_ostream<_Elem,_Traits>' with [ _Elem=char, _Traits=std::char_traits<char> ] D:\C++\Boost\Current\boost\lambda\if.hpp(100) : see declaration of 'boost::lambda::if_then_else' fs.cpp(39) : error C2784: 'const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::ifthenelse_action,boost::tuples: :tuple<boost::lambda::lambda_functor<Arg1>,boost::lambda::lambda_functor<Arg2>,boost::lambda::lambda_functor<Arg3>>>> boost::lambda::if_then_else (const boost::lambda::lambda_functor<Arg1> &,const boost::lambda::lambda_functor<Arg2> &,const boost::lambda::lambda_functor<Arg3> &)' : could no t deduce template argument for 'const boost::lambda::lambda_functor<T2> &' from 'std::basic_ostream<_Elem,_Traits>' with [ _Elem=char, _Traits=std::char_traits<char> ] D:\C++\Boost\Current\boost\lambda\if.hpp(100) : see declaration of 'boost::lambda::if_then_else' fs.cpp(39) : error C2784: 'const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::ifthenelse_action,boost::tuples: :tuple<boost::lambda::lambda_functor<Arg1>,boost::lambda::lambda_functor<Arg2>,boost::lambda::lambda_functor<Arg3>>>> boost::lambda::if_then_else (const boost::lambda::lambda_functor<Arg1> &,const boost::lambda::lambda_functor<Arg2> &,const boost::lambda::lambda_functor<Arg3> &)' : could no t deduce template argument for 'const boost::lambda::lambda_functor<T2> &' from 'std::basic_ostream<_Elem,_Traits>' with [ _Elem=char, _Traits=std::char_traits<char> ] D:\C++\Boost\Current\boost\lambda\if.hpp(100) : see declaration of 'boost::lambda::if_then_else' fs.cpp(39) : error C2784: 'const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::ifthenelse_action,boost::tuples: :tuple<boost::lambda::lambda_functor<Arg1>,boost::lambda::lambda_functor<Arg2>,boost::lambda::lambda_functor<Arg3>>>> boost::lambda::if_then_else (const boost::lambda::lambda_functor<Arg1> &,const boost::lambda::lambda_functor<Arg2> &,const boost::lambda::lambda_functor<Arg3> &)' : could no t deduce template argument for 'const boost::lambda::lambda_functor<T2> &' from 'std::basic_ostream<_Elem,_Traits>' with [ _Elem=char, _Traits=std::char_traits<char> ] D:\C++\Boost\Current\boost\lambda\if.hpp(100) : see declaration of 'boost::lambda::if_then_else'

4 6

[Smart_Ptr] Error in intrusive_ptr ctors' exception specification?
by Scott Meyers 08 Mar '06

08 Mar '06

Consider this constructor from the intrusive_ptr doc (http://boost.org/libs/smart_ptr/intrusive_ptr.html) intrusive_ptr(T * p, bool add_ref = true); Effects: if(p != 0 && add_ref) intrusive_ptr_add_ref(p);. Note in particular that nothing is said about exceptions being thrown. Presumably intrusive_ptr_add_ref may throw, as I can't find any restriction to the contrary. Now consider these constructors from the same document: intrusive_ptr(intrusive_ptr const & r); // never throws template<class Y> intrusive_ptr(intrusive_ptr<Y> const & r); // never throws Effects: if(r.get() != 0) intrusive_ptr_add_ref(r.get());. They are documented not to throw, yet both call intrusive_ptr_add_ref. How can it be that the top constructor above may throw, but these constructors may not? FWIW, it seems to me that all three should be allowed to throw, unless some constraint is imposed on the implementation of intrusive_ptr_add_ref. For example, perhaps intrusive_ptr_add_ref wants to throw if its reference count will overflow -- maybe because it's using only an 8-bit counter. Isn't that possible? Scott

3 2

Re: [Boost-users] Boost.Preprocessor with __LINE__ in MSVC71
by Wu Yinghui, Freddie 08 Mar '06

08 Mar '06

> What is going wrong? I tried it on VC7, VC7.1, and VC8, and it appeared to work correctly on all three versions of the compiler. >> Does anyone on the list has more insight on this issue? > I've seen strange problems related to __LINE__ on VC before, but I > can't remember off the top of my head what the issue was. > (Thinking...) It has something to do with the generation of debug > information. Okay, yes, I see the error that you are getting now. It > only happens in during a debug build. You are right. It occurs only in debug builds. (Sorry for forgetting to mention this.) > This is just one of the *many* ways in which VC's preprocessor is > wacky. It suffices to say it isn't even in the ballpark of > implementing the phases of translation correctly. That's what I feel. The error message indicate that the compiler somehow considers "id" and __LINE__ two identifier when the error occurs. I tried using the /P parameter to dump the preprocessed source, and that looked fine, though. So I guess it is the problem with MSVC compiler mixing preprocessing and parsing phases together... >> Or, what're the common ways to generate an unique identifier >> automatically within certain scope? > What do you mean by "certain scope"? Or, more precisely, given a > finite scope such as that defined by a function, why do you need > unique identifiers? Most of the time when people want unique > identifiers, they want an identifier that is unique across an entire > program or, at minimum, inside a translation unit. Well... The scope can be the whole program, or in a namespace, or in a translation unit. The unique ID is used in a macro in the library for some tidious code that can be automatically generated using preprocessor. Anyway, thanks for Stewart Tootill's suggestion. I had to resort to using __COUNTER__ at the meantime, which seemed working so far. (But one thing that worries me is that __COUNTER__ is only unique within a translation unit. So what if I need a unique identifier throughout the program?) > Regards, > Paul Mensonides Thanks for your comments. Cheers, Freddie

2 1

Newbie question
by Tom Nabhani 08 Mar '06

08 Mar '06

Hi, I'm having some difficulty using the boost libraries in my programs (I have an iBook running Panther). My boost install passes all the regression tests. My files are all stored in the appropriate places under /usr/local. But when I try to #include <boost> libraries in my programs, the compiler doesn't seem to find them. I'm assuming that there is some very simple stupid problem with the way my computer is set up, but I don't know enough about using c++ libraries to know what to do. I'm a pretty experienced Java programmer, but I'm very new to c++. Unfortuntately I don't have anyone to ask how to solve this problem. I hope this doesn't try your patience too much, but could anybody suggest how I might get this problem fixed? Thanks, Tom

3 2

[foreach] reverse foreach?
by Andy Little 08 Mar '06

08 Mar '06

FWIW Heres some sample code. Its seems a bit lopsided! std::ofstream out("toolpath_out.txt"); BOOST_FOREACH(boost::shared_ptr<section> sp,vect){ if (sp->m_action == section::reverse){ for( std::vector<std::string>::reverse_iterator iter = sp->m_vector.rbegin(); iter != sp->m_vector.rend(); ++iter){ out << *iter << '\n'; } } else { BOOST_FOREACH(std::string str,sp->m_vector){ out << str << '\n'; } } } Are there any plans for a BOOST_REVERSE_FOREACH? regards Andy Little

3 4

[MPL] Need help crossing runtime boundary (lengthy)
by Ames Andreas 08 Mar '06

08 Mar '06

Hi all, I'm new to using the MPL and I want to write a generic class, that makes it easy to provide other classes with a mechanism to notify their clients about member changes. I'll paste in some code that illustrates how I imagine this thing could look like. I've marked three places with comments ((1), (2), (3)) that contain the specific questions but I also welcome more general suggestions. For example I'd appreciate alternatives to the std::map within the Notifier. <code> template <class OBJECT_TYPE, typename MEMBER_ID_TYPE, typename ID_TO_MEMBER_MAP_TYPE> class Notifier { // an alternative combiner for signals struct notifier_combiner { typedef boost::optional< int > result_type; template <typename INPUT_ITERATOR> result_type operator()(INPUT_ITERATOR pFirst, INPUT_ITERATOR pLast) const { result_type res; for (; pFirst != pLast; ++pFirst) res = *pFirst; return res; } }; template <MEMBER_ID_TYPE id, typename MEMBER_TYPE> struct get_signal_type { typedef boost::signal< int (OBJECT_TYPE const*, MEMBER_TYPE const&), notifier_combiner > type; }; // (1) How can I get SOMETHING? It should be a sequence of all // possible signal types, most probably an mpl::set, so that each // signal type is only present once. I guess I should iterate // over the elements in ID_TO_MEMBER_MAP_TYPE and then call // get_signal_type< elem::first::value, elem::second::type >, but // I don't see exactly how to use one of the mpl-algorithms or // generic iteration. typedef boost::make_variant_over< SOMETHING >::type signals_t; // maps member ids to a variant containing the 'right' signal type typedef std::map< MEMBER_ID_TYPE, signals_t > signal_map_t; signal_map_t signal_map; public: Notifier() { // (2) How do I initialise signal_map so that all ids map to a // signals_t instance with the right default constructed // signal type assigned? I guess the answer is somewhere in // chapter 9 of "C++ template metaprogramming" but that's the // chapter that is the hardest one to grasp for me :-) } template <MEMBER_ID_TYPE id, typename MEMBER_TYPE> boost::connection connect(get_signal_type< id, MEMBER_TYPE >::type::slot_type slot) { return boost::get< get_signal_type< id, MEMBER_TYPE >::type >(signal_map[id]).connect(slot); } template <MEMBER_ID_TYPE id, typename MEMBER_TYPE> int notify(OBJECT_TYPE const *pObj, MEMBER_TYPE const &member_val) const { boost::optional< int > res = boost::get< get_signal_type< id, MEMBER_TYPE >::type >(signal_map[id])(pObj, member_val); return res ? res.get() : 0; } }; // how I'd like to use it: strcut sth_ { int i; long j; } class RandomClass { bool yesno; sth_ sth; enum MemberId { YESNO , STH }; typedef mpl::map< mpl::pair< mpl::integral_c< MemberId, YESNO >, bool > , mpl::pair< mpl::integral_c< MemberId, STH >, sth_ > > id_to_member_type_t; template < typename INTEGRAL_CONST > struct get_type_by_id { typedef mpl::at< id_to_member_type_t, INTEGRAL_CONST >::type type; }; Notifier< RandomClass // I hope incomplete type is ok here // (because Notifier only uses // RandomClass const*; OTOH, Notifier // uses a std::map which somehow // refers to RandomClass)? Anyway, // this is not crucial. , MemberId , mpl::map< mpl::pair< mpl::integral_c< MemberId, YESNO >, bool > , mpl::pair< mpl::integral_c< MemberId, YESNO >, sth_ > > > m_notifier; public: RandomClass() : yesno(false) , sth({1, 2}) { } // a client connects by specifying the member id and a callback template < MemberId id > boost::connection notify(int (pF*)(RandomClass const* , get_type_by_id< mpl::integral_c< MemberId, id > >::type const&)) { // (3) Can the compiler deduce the second template argument of // Notifier::connect? I guess not, so how could I change the // method's declaration to make that happen? return m_notifier.connect< id >(pF); } void setYesNo(bool b) { yesno = b; m_notifier<YESNO>(this, b); } void setSthI(int i) { sth.i = i; m_notifier<STH>(this, sth); } }; </code> Obviously this doesn't yet compile and there may be all sorts of errors. I hope that's ok, because I still need very basic help. TIA, aa -- Andreas Ames | Programmer | Comergo GmbH | Voice: +49 69 7505 3213 | andreas . ames AT comergo . com "I imagine Sisiphus as happy ..." Albert Camus

1 0

Re: [Boost-users] Boost.Preprocessor with __LINE__ in MSVC71
by Sohail Somani 08 Mar '06

08 Mar '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Wu > Yinghui, Freddie > Sent: Wednesday, March 08, 2006 5:45 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Boost.Preprocessor with __LINE__ in MSVC71 > > > What is going wrong? I tried it on VC7, VC7.1, and VC8, and it > appeared to work correctly on all three versions of the compiler. > > >> Does anyone on the list has more insight on this issue? > > > I've seen strange problems related to __LINE__ on VC before, but I > > can't remember off the top of my head what the issue was. > > (Thinking...) It has something to do with the generation of debug > > information. Okay, yes, I see the error that you are > getting now. It > > only happens in during a debug build. > > You are right. It occurs only in debug builds. (Sorry for > forgetting to > mention this.) When your debug information is for edit and continue iirc.

1 0

[mpl] random sequence generator, whats wrong?
by Mark Nevill 08 Mar '06

08 Mar '06

Hi, I am trying to make a template for building sequences of random numbers using Boost.Mpl, but apparently I haven't quite got the hang of it yet ;). Below is my code (adapted from the Boost.Random docs) and the compiler output (GCC v 3.4.2), I seem to have misunderstood the usage of mpl::first and mpl::second in lambdas or something. Can someone clarify what I've done wrong? The whole construct should be invoked with something like typedef utils::make_random_sequence<vector0_c<unsigned long>, utils::minstd_rand, 10>::type random_vector; to generator a vector_c of 10 random numbers. Thanks, Mark #include <cstdlib> #include <boost/static_assert.hpp> #include <boost/mpl/integral_c.hpp> #include <boost/mpl/plus.hpp> #include <boost/mpl/times.hpp> #include <boost/mpl/modulus.hpp> #include <boost/mpl/iter_fold.hpp> #include <boost/mpl/range_c.hpp> #include <boost/mpl/pair.hpp> #include <boost/mpl/erase.hpp> #include <boost/mpl/begin.hpp> #include <boost/mpl/end.hpp> #include <boost/mpl/push_back.hpp> #include <boost/mpl/lambda.hpp> #include <boost/type_traits/is_integral.hpp> namespace utils { using namespace boost::mpl; template<class T, class Formula, T seed> struct random : integral_c< T, template Formula::apply<seed>::value > { typedef random<T, Formula, value> next; template<T new_seed> struct reseed { typedef random<T, Formula, new_seed> type; }; }; template<class IntType, IntType a, IntType c, IntType m> struct linear_congruential { BOOST_STATIC_ASSERT(boost::is_integral<IntType>::value); typedef IntType value_type; template<IntType seed> struct apply : integral_c<IntType, (a * seed + c) % m> { }; }; typedef random< long, linear_congruential<long, 16807L, 0, 2147483647L>, 1043618065L > minstd_rand0; typedef random< long, linear_congruential<long, 48271L, 0, 2147483647L>, 399268537L > minstd_rand; template<class integral_sequence, class generator, size_t size> struct make_random_sequence { typedef typename iter_fold< range_c<size_t, 1, size>, pair< typename erase< integral_sequence, begin<integral_sequence>, end<integral_sequence> >::type, generator >, pair< push_back< first<_1>, second<_1> >::type, second<_1>::next > >::type type; }; } 28: error: missing `>' to terminate the template argument list 28: error: template argument 2 is invalid 28: error: expected `{' before "template" 28: error: expected unqualified-id before "template" 28: error: expected `;' before "template" C:/Boost/include/boost-1_33/boost/mpl/pair.hpp: In instantiation of `boost::mpl::first<mpl_::_1>': C:/Boost/include/boost-1_33/boost/mpl/aux_/has_tag.hpp:20: instantiated from `boost::mpl::aux::has_tag<boost::mpl::first<mpl_::_1>, mpl_::bool_< false> >' C:/Boost/include/boost-1_33/boost/mpl/sequence_tag.hpp:115: instantiated from `boost::mpl::sequence_tag<boost::mpl::first<mpl_::_1> >' C:/Boost/include/boost-1_33/boost/mpl/push_back.hpp:32: instantiated from `boost::mpl::push_back<boost::mpl::first<mpl_::_1>, boost::mpl::second<mpl_::_1> >' 85: instantiated from here C:/Boost/include/boost-1_33/boost/mpl/pair.hpp:43: error: no type named `first' in `struct mpl_::_1' 85: error: `type' is not a member of `boost::mpl::push_back<boost::mpl::first<mpl_::_1>, boost::mpl::second<mpl_::_1> >' 85: error: `type' is not a member of `boost::mpl::push_back<boost::mpl::first<mpl_::_1>, boost::mpl::second<mpl_::_1> >' C:/Boost/include/boost-1_33/boost/mpl/pair.hpp: In instantiation of `boost::mpl::second<mpl_::_1>': 86: instantiated from here C:/Boost/include/boost-1_33/boost/mpl/pair.hpp:56: error: no type named `second' in `struct mpl_::_1' 86: error: `next' is not a member of `boost::mpl::second<mpl_::_1>' 86: error: `next' is not a member of `boost::mpl::second<mpl_::_1>' 88: error: template argument 1 is invalid 88: error: template argument 2 is invalid 88: error: template argument 3 is invalid 88: error: `type' does not name a type

3 2

What's best practice to incorporate Boost.Test in own project?
by Mateusz Łoskot 08 Mar '06

08 Mar '06

Hi, I'm going to add Unit Tests to one of projects. It's quite big project, so there will be many tests suits and cases. The project build system is based on automake for Unix and nmake for Windows. I wonder what is the best practice to include Boost.Test frameworks to my own project? Currently I consider only Unit Test Framework. I see following possibilities: 1. Boost libraries are installed from official release (precompiled or compiled by user) Makefiles for my project try to detect if Boost exists and link to Unit Test Framework librar. Here Boost has to be listed in compilation requirements of my project. 2. Boost.Test libraries in binary form are included to my project tree and shipped together. So there is no requirement to have complete Boost installed, because test can link to UTF library already present 3. Include Boost.Test source code and allow user of my project to build UTF library on his own. Here I expect some problems with bjam/makefiles incompatibility. So, bjam would be required on user's platform. Simply, this solution seems to be quite confusing for user. I'd like to know your comments about which solution is best and what are possible traps hidding. Regarding the 1 solution I think there may be possible problem with using incorrect Boost.Test version. The second one involves additional work for overall projct maintenance. May be there are more possibilities I've not listed above, so please share your ideas. Thanks in advance for your comments. Best regards -- Mateusz Łoskot http://mateusz.loskot.net

3 7

Boost.Preprocessor with __LINE__ in MSVC71
by Wu Yinghui, Freddie 08 Mar '06

08 Mar '06

Hi all, I'm observing an interesting problem on MSVC71 regarding the use of __LINE__ with Boost.Preprocessor. The code looks like this ==== snip ==== #include <boost/preprocessor/cat.hpp> #define UNIQUE_ID BOOST_PP_CAT(id, __LINE__) #define UNIQUE_ID2 BOOST_PP_CAT(id, _MSC_VER) int main() { int UNIQUE_ID2 = 321; int UNIQUE_ID = 123; bool UNIQUE_ID = false; } ==== snip ==== The compiler works fine with UNIQUE_ID2, but not UNIQUE_ID. The only different in them is only the use of __LINE__ instead of _MSC_VER. Does anyone on the list has more insight on this issue? Or, what're the common ways to generate an unique identifier automatically within certain scope? Cheers, Freddie -- Wu Yinghui, Freddie Research & Development 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.

3 2

Re: [Boost-users] Boost.Preprocessor with __LINE__ in MSVC71
by Stewart Tootill 08 Mar '06

08 Mar '06

There is a known bug with MSVC71 where if you use __LINE__ too much (not sure what the limits are or under what circumstances though), you get a "Fatal Error: Out of Keys" or something similar. Instead of this, for generating unique variable names etc I have seen the __COUNTER__ macro used instead, which provides similar functionality, but doesn't seem to suffer from this issue. Yours, Stewart -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org]On Behalf Of Wu Yinghui, Freddie Sent: 08 March 2006 09:00 To: boost-users(a)lists.boost.org Subject: [Boost-users] Boost.Preprocessor with __LINE__ in MSVC71 Hi all, I'm observing an interesting problem on MSVC71 regarding the use of __LINE__ with Boost.Preprocessor. The code looks like this ==== snip ==== #include <boost/preprocessor/cat.hpp> #define UNIQUE_ID BOOST_PP_CAT(id, __LINE__) #define UNIQUE_ID2 BOOST_PP_CAT(id, _MSC_VER) int main() { int UNIQUE_ID2 = 321; int UNIQUE_ID = 123; bool UNIQUE_ID = false; } ==== snip ==== The compiler works fine with UNIQUE_ID2, but not UNIQUE_ID. The only different in them is only the use of __LINE__ instead of _MSC_VER. Does anyone on the list has more insight on this issue? Or, what're the common ways to generate an unique identifier automatically within certain scope? Cheers, Freddie -- Wu Yinghui, Freddie Research & Development 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. ________________________________________________________________________ This e-mail has been scanned for viruses by MessageLabs. ________________________________________________________________________ This e-mail has been scanned for viruses by MessageLabs.

1 0

Call for_each with boost::lambda library
by yinglcs2＠yahoo.com 08 Mar '06

08 Mar '06

Hi, I am trying to Call for_each with boost::lambda library to print out the return value of a function: vector<A> aList; for_each(aList.begin(), aList.end(), cout << bind(&A::getPriority, _1) ); This can't compile. can yo please tell me what did I do wrong? __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

[Format] Cost of using format
by Scott Meyers 08 Mar '06

08 Mar '06

I've been trying to get a handle on cost of using Boost.format by looking at the interface, reading the docs, and, until my head exploded, looking at the source code. What I'd really like to know is whether simple output without reordering incurs the cost of an allocation (for a string or maybe a stringstream) for each argument. For example, should I, as a user, expect the following to potentially cost me three dynamic memory allocations? cout << format("%1% %2% %3%") % 86 % 100.55 % "Hello"; The doc says this: > Since common stream implementations eventually call functions of the printf family for the actual formatting of numbers, in general printf will be noticeably faster than the direct stream operations And due to to the reordering overhead (allocations to store the pieces of string, stream initialisation at each item formatting, ..) the direct stream operations would be faster than boost::format, (one cas expect a ratio ranging from 2 to 5 or more) This suggests that per-argument buffering to support reordering may cost an allocation per argument, but if there is no reordering, does one pay this cost? I could figure this out on my own given enough time, but I'm hoping that others familiar with this library already know the answer and can save me the trouble. Thanks, Scott

1 0

multi_array - problems with resize
by Craig Glasgow 08 Mar '06

08 Mar '06

Hi, I'm trying to write serialization load and save methods for multi-array. For the load method I have a function with the prototype: template<class Archive, class T, std::size_t NumDims> inline void load(Archive& ar, boost::multi_array<T, NumDims>& arr, const unsigned int file_version) This function gets called when the array is serialized and should populate the multi-array arr. However this requires re-sizing arr which apparently can only be done using the extents construct e.g. arr.resize(boost::extents[3][4][2]), but I want to be able to do this for an arbitray number of dims as with reshape. Any idea how this can be done? Regards Craig

2 1

[Boost.Test] SD expo
by Sohail Somani 07 Mar '06

07 Mar '06

Is there going to be detailed coverage of boost test at SD expo? I couldn't find anything, but just thought I'd try the list. Thanks Sohail

4 3

Re: [Boost-users] portable shared library loader
by David Klein 07 Mar '06

07 Mar '06

boost-users-bounces(a)lists.boost.org wrote: > hi all, > > since i've got the hint for portable uuids on this list, another > portability question ... > > i'm building a dynamic shared library loader ... currently i'm using > the dlopen api, which works on linux (and possibly on osx), for win, > there's a simiar api ... > > is there any prebuilt wrapper for that (preferable as part of boost or > in a another bsd/lgpl-style license? > > thanks ... tim there is the 'plugin' library in the boost_sandbox on sourceforge. HTH dave

2 1

[Parameter] Constructors and more
by Johan Nilsson 07 Mar '06

07 Mar '06

Hi, I've just started playing around with Boost.Parameter. I'm in the progress of wrapping a legacy C library and some of the structs used have plenty of members, most of which have reasonable defaults. I thought that the Parameter library would be a nice fit here, but ended up with a couple of questions: 1. How can I define constructor for a class taking named parameters, without using the double parentheses syntax? The following basic idea works, but is ugly: --- ... BOOST_PARAMETER_KEYWORD(tag, minVal) BOOST_PARAMETER_KEYWORD(tag, maxVal) struct Foo { template<typename ArgPack> Foo(ArgPack& args) { m_minVal = args[minVal|0]; m_maxVal = args[maxVal|100]; } ... }; void bar() { Foo foo(( minVal = 1, maxVal = 2)); // Note double parens } --- I've experimented some with defining a parameter::parameters specification and use (the undocumented) BOOST_PARAMETER_MEMFUN, but that obviously doesn't work (forwarding, return values and constructors don't mix). It should be possible (I think) to define a BOOST_PARAMETER_CTOR macro that generate the ctor overloads and forwards to a setter method instead of the other way around. I guess I could create a free or static member function that constructs an object, but that would either force me to create heap-based objects, or invoke potentially expensive copy ctors. 2. Is there a way of detecting whether an argument was passed using position or name? Or, even better, is there a way of restricting the arguments to only be passed by name using the parameters specification? 3. Not a question really, but having a default arity of 5 seems awfully low to me. I hit that limit on first usage, and as the named parameters are supposed to be used in the interface of my wrapping library, forcing users to define BOOST_PARAMETER_MAX_ARITY "globally" feels a bit like asking for someone coming up and asking me to decode some compile errors. [I'm using the latest cvs head of boost, in combination with VC 8.0] Regards, Johan Nilsson

3 5

Boost sBUILD Features
by Robert Vinluan 07 Mar '06

07 Mar '06

Hi All, Does anybody have a link to a page that shows all the possible features (i.e. <threading>, <runtime-link>, etc.) for -sBUILD? I searched on google and the boost documentation but I can't find a good list of all the sBUILD features. I was just curious to see if I could use -sBUILD to control building 32-bit or 64-bit versions of the boost libraries. Thanks in advance, Rob

2 2

case insensitive less_than string comparison
by Matthias Kaeppler 07 Mar '06

07 Mar '06

Hi, I am aware that string_algo has an if_iequal functor. Is there also an equivalent for a less-than comparison? I have to compare strings ignoring the case but taking locales into account. Right now I'm calling boost::algorithm::to_lower on two copies of the original strings. I'm not so sure if this is very efficient when I'm comparing thousands of strings. Here's the functor as it is now: struct FileLessNameA : std::binary_function<const File&,const File&,bool> { bool operator() (const File& lhs, const File& rhs) const { std::string path1( lhs.get_name().c_str() ); std::string path2( rhs.get_name().c_str() ); boost::algorithm::to_lower( path1 ); boost::algorithm::to_lower( path2 ); return path1 < path2; } }; Any suggestions for improvements appreciated :) Regards, Matthias -- Matthias Kaeppler

7 17

(no subject)
by Karim Bakir 07 Mar '06

07 Mar '06

Hi , I have a problem, I download boost, I followed the steps on www.boost .org so first I build jam to obtain jam.exe, I copy it in my directorie where I installed boost. I run Msdos, I run VCVARS32 to set the environement of vc++ after I execute : bjam "-sTOOLS=msvc" install It compiles , however I have many errors and failed. At the end , It has copied in a directory boost include... the include , and the . lib. But I don't have all the libs I have the following message: ...failed updating 82 targets... ...skipped 60 targets... ...updated 4598 targets... Can you help me please. Thanks

2 1

String compare (instead of just less) that returns -1, 0 or 1
by Olaf van der Spek 07 Mar '06

07 Mar '06

Hi, Does Boost contain a (string) compare function that returns -1 if a < b, 0 if a == b and 1 if a > b? Doing both < and == sounds like a lot of extra work in for example sorting algorithms.

3 3

Re: [Boost-users] Linking problems with 'scoped_static_mutex_lock'fromregex library?!
by arno.schaefer＠sqs.de 07 Mar '06

07 Mar '06

Thanks for the hint and sorry for that stupid matter. Arno

1 0

[Numeric Conversion] Trivial typos in documentation
by Scott Meyers 07 Mar '06

07 Mar '06

Twice on http://boost.org/libs/numeric/conversion/doc/numeric_cast.html, "Traget" ==> "Target" Scott

1 0

Re: [Boost-users] Property map design
by Dmitry Bufistov 06 Mar '06

06 Mar '06

Hi all! Sorry if this is second time)) Regards, --dima

2 2

[multi_array] Resize changes storage order irreversibly
by Antonio Piccolboni 06 Mar '06

06 Mar '06

Hi, I noticed that after a resize the storage order is reset to the default value. This is apparent not only printing the contents (see attached test case) but also by inspecting strides() directly. Not only this breaks my program, but the only way to set the storage order is apparently in the constructor and therefore resize becomes de facto unusable for non default storage orders, so I don't even have a workaround. I couldn't find anything regarding this in the docs. I believe this is a serious bug. Can anyone advise? Antonio #include <boost/multi_array.hpp> #include <iostream> int main() { typedef boost::multi_array<double,3> array_type; int tiling_graph_storage_order[] = {2, 0, 1}; bool tiling_graph_index_order[] = {true, true, true}; array_type A(boost::extents[3][4][2], boost::general_storage_order<3>(tiling_graph_storage_order, tiling_graph_index_order)); for (int i = 0; i < 3; i++) { for (int j = 0; j < 4; j++) { for (int k = 0; k < 2; k++) { A[i][j][k] = 100 * i + 10 * j + k + 10000; } } } for (int i = 0; i < A.num_elements(); i++) { std::cout << *(A.origin() + i) << std::endl; } A.resize(boost::extents[3][4][2]); std::cout << "After resize" << std::endl; for (int i = 0; i < 3; i++) { for (int j = 0; j < 4; j++) { for (int k = 0; k < 2; k++) { std::cout << A[i][j][k] << std::endl; } } } }

2 2

Re: [Boost-users] How to organize my Unit Tests
by Dmitry Bufistov 06 Mar '06

06 Mar '06

> Mateusz Å�oskot wrote: > > >>3. Include Boost.Test source code and allow user of my project to build > >>UTF library on his own. Here I expect some problems with bjam/makefiles > >>incompatibility. So, bjam would be required on user's platform. > >>Simply, this solution seems to be quite confusing for user. > > > > Hello Mateusz, > > One obsevation concerning 3th approach for using boost.test framework. > > You just can include > > #include <boost/test/included/unit_test_framework.hpp> > > to your project and compile everything using your build system, isn't it? >Hi Dmitry, >But what about building Unit Test Framework library? >How should I provide building it? Using bjam (bjam would be requirement) >or own home-made makefiles for UTF? >Cheers It is for sure that I didn't build anything separate in boost (of cause exept the "date_time" library ) and things more or less work for me. I have just to projects in my solution - second is unit_test_framework and I doesn't link with external boost libraries. You can try to compile and execute the following code (without any external linking): Good luck! --dima // BOOST_TEST_TEST.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <boost/test/included/unit_test_framework.hpp> using namespace boost::unit_test; void test1_suit1() { BOOST_REQUIRE(false); } void test2_suit1() { BOOST_REQUIRE(false); } void test1_suit2() { BOOST_REQUIRE(false); } test_suite* init_unit_test_suite( int argc, char* argv[] ) { test_suite* master_test_unit = BOOST_TEST_SUITE("Master"); test_suite* ts_1 = BOOST_TEST_SUITE( "test_suite1" ); ts_1->add( BOOST_TEST_CASE( &test1_suit1), 1 ); ts_1->add( BOOST_TEST_CASE( &test2_suit1), 1 ); test_suite* ts_2 = BOOST_TEST_SUITE( "test_suite2" ); ts_2->add( BOOST_TEST_CASE( &test1_suit2), 1 ); /**Add test suites here in order to run them**/ master_test_unit->add(ts_1); master_test_unit->add(ts_2); return master_test_unit; }

2 1

How to organize my Unit Tests
by Mateusz Łoskot 06 Mar '06

06 Mar '06

Hi, I'd like to ask yet another questions related to Unit Test Framework usage. Especially, I'm interested in best practice of Unit Tests organization in the project. I have a project that consists of more than 100 classes. Some of those classes are general purpose (e.g. Point) but some are organized in components (e.g. spatial index component consisting of 5 classes). Now, I'd like to add Unit Tests (yes, I know I should have them prepared before I created those classes ;-)). I've read almost all docs about Boost.Test, downloaded from CVS. I know how to create Test Case and how to combine those cases into Test Suite. I also read introductory docs from "Tutorials and usage recommendations" part as well as I walked through unit_test_examples but I'm still a bit confused about the bigger picture. As far as I understand, every Test Case or Test Suite of cases is to be compiled to separate executable. Is this correct? So, unit_test_example_01.cpp and unit_test_example_02.cpp and so on create separate programs that can be executed e.g. from Visual Studio Post-Build Event as explained in docs. More precisely, every .cpp file that: - include #include <boost/test/unit_test.hpp> - uses defines cases using BOOST_AUTO_TEST_CASE - or defines suites of cases using BOOST_TEST_SUITE + BOOST_AUTO_TEST_CASE will be a separate program. Right? So, if I have 100 classes and I'd like to define Test Suite, with a number of Test Cases in every suite, for every my class then should I expect I will get 100 test executables? From Visual Studio point of view, I will have 100 projects in my test solution. Am I right? I feel I don't understand something, so I'd be very thankful for some light on this subject. So, what is the best way to organize Test Cases and Suites for my 100 classes? Should I try to build them into one executable or into number of separate executables as described in my assumptions above? If there are e.g. 100 executables for my 100 tests, how should I run them e.g. during complete rebuild of project using automake or bjam? Not using Visual Studio Post-Build Events, should I run those tests from makefiles/jamfiles or there is a kind of test runner program I can use? Best regards -- Mateusz Łoskot http://mateusz.loskot.net

3 3

Property map design
by Daniel Mitchell 06 Mar '06

06 Mar '06

I'd like to know a little more about the design rationale for property maps, specifically the (maybe implicit) decision not to overload operator[] with respect to constness. The design leads to a situation that is, in some respects, at odds with convention. The most obvious point of conflict is put_get_helper. In fact, I wouldn't be surprised if the decision not to overload operator[] was simply a consequence of writing put_get_helper. (Pure speculation.) template<class Reference, class PropertyMap> struct put_get_helper { }; template<class R, class P, class K> R get( put_get_helper<R,P> const& map, K const& key ); template<class R, class P, class K, class V> void put( put_get_helper<R,P> const& map, K const& key, V const& value ); In contrast with standard containers, the constness of the property map isn't correlated to the constness of its elements. I wonder why the above wasn't written as template<class Reference, class PropertyMap, class ConstReference> struct put_get_helper { }; template<class R, class P, class C, class K> R get( put_get_helper<R,P,C>& map, K const& key ); template<class R, class P, class C, class K> C get( put_get_helper<R,P,C> const& map, K const& key ); template<class R, class P, class C, class K, class V> void put( put_get_helper<R,P,C>& map, K const& key, V const& value ); Another point of conflict is the property_map traits class, with its nested 'type' and 'const_type'. Doesn't convention suggest that 'type const' is the appropriate type for a non-mutable property map? My initial statement was that the design leads to a situation that is *in some respects* at odds with convention. When property maps are viewed, not as first class containers of their data, but as having more-or-less the same status as container iterators, the situation clarifies. I suppose that must have been the author's intent. // A deficient, but harmless implementation of put(), get() for iterators. template<class Reference, class Iterator> struct put_get_helper { }; template<class R, class I, class K> R get( put_get_helper<R,I> const& it, K const& key ); template<class R, class I, class K, class V> void put( put_get_helper<R,I> const& it, K const& key, V const& value ); // Parallel to property_map. template<class Container> struct container_iterator { typedef typename Container::iterator type; typedef typename Container::const_iterator const_type; };

2 1

Linking problems with 'scoped_static_mutex_lock' from regex library?!
by Arno 06 Mar '06

06 Mar '06

Hi all, I have successfully build boost 1.33.1 on solaris 2.8 with SunStudio 10 with stlport and try now to build my application what was running with boost 1.31 on windows. I have had no problems during compiling my stuff all seems to be fine, but when I am linking I get some unreferenced symbols in my code what I didn't know, because I don't know, that I am using it. So the linker said, that he can't find 'boost::scoped_static_mutex_lock::~scoped_static_mutex_lock()' and 'boost::scoped_static_mutex_lock::scoped_static_mutex_loc(boost::static_mutex&,bool) '. After a littele bit of investigation I found the definition of this class in a Header 'regex/pending/static_mutex.hpp'. I link actualy the libraries 'libboost_regex-sw-1_33_1', 'libboost_thread-sw-mt-1_33_1' and 'libboost_date_time-sw-1_33_1' to my application have I to link something more or do I have to make something else to get these build running! Thanks for any help! regards Arno

2 1

Re: [Boost-users] Getting started with Boost: what did you need to know?
by Merrill Cornish 06 Mar '06

06 Mar '06

David, At the risk of annoying some Boost developers... My single biggest complaint is the Boost documentation-- not so much that the libraries are undocumented, but that it's so hard to find your way through the documentation that is provided. There is the documentation on the Boost site rooted under Libraries | Documentation. Then there is the documentation under doc/html in the Boost source tree. Then there is the documentation under libs/<libraryName>/doc in the source tree. Sometimes, they are the same, sometimes, the libs documentation has extra stuff. Why? A side effect of having HTML documentation is that there is no index--a valuable tool when you are trying find your way through new territory. The Boost documentation standard recommends having a table of contents-like list of topics on the first page of a library's documentation. Sounds good, but since there usually isn't any paragraphing levels shown, what you get is a list of topics, some of which repeat with no indication of which are subtopics of which. The naming of documentation files can be misleading also. The discussion of mutexes (with no specific mention of threads) is called "thread" while the discussion of threading (with no specific mention of mutexes) is call "threads" [note the plural]. Or, maybe it's the other way around. The available documentation takes a scatter gun approach at to the intended audience. Under mutexes (whatever its name), there is a treatise (as I remember) on all possible mutex alternatives. It's only later that the reader discovers none of them are actually implemented. Similarly, the serialization documentation has a long discussion on shared pointers in a file named shared_ptr.html. Another file named shared_ptr2.html starts out by saying that about the stuff you just read in shared_ptr.html "Unfortunately, this way of doing it suffered from some undesirable features." This is a lot like giving someone detailed driving directions only to say, "if you go this far, you've taken a wrong turn." The documentation is written so that in order to do almost anything, you have to read everything, including all of the "here are all the wrong turns I took in developing this library" pages. For example, the documentation for the serialization library seems straightforward, but you'll probably miss the special macro you are supposed to use if you are serializing an abstract class. The Boost documentation is serverly in the need of global editing. Merrill

4 4

[BGL] Why this is not compiled?
by Dmitry Bufistov 06 Mar '06

06 Mar '06

Hi all, I'm trying to compile the following code and have some compiler errors (MSVC 8). // TestBoostGraph1.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <string> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adjacency_matrix.hpp> #include <boost/graph/graphviz.hpp> #include <boost/graph/iteration_macros.hpp> #include <boost/graph/graph_utility.hpp> #include <boost/graph/copy.hpp> ///Just for read "work around" ///Two typedefs for modeling both "discrete" & "continues" nets typedef int discret_net_t; typedef double continues_net_t; /// typedef enum {PLACE, TRANSITION} node_type_t; /*! * If you need some more properties, then you should define your property class that derived from * basic_vertex_properties<>; - for nodes, * basic_edge_properties<>; - for edges * Example: struct my_node_prop : basic_vertex_properties<discret_net_t> { typedef double node_delay_t; node_delay_t m_node_delay; }; typedef CPetriNet<adj_list, boost::vecS, boost::listS, boost::bidirectionalS, my_node_prop> petri_net_t * * The types of all property values must be Copy Constructible, Assignable and Default Constructible!! */ template <class T = discret_net_t> struct basic_vertex_properties { typedef std::string node_name_type; typedef int node_index_t; basic_vertex_properties(node_type_t nt = TRANSITION) : m_node_type(nt) { m_token_number = T(0);} T m_token_number; ///Only for place, possible costruct "continues" nets node_name_type m_node_name; node_type_t m_node_type; ///Vertex could be "Place" or "transition" node_index_t m_node_index;///Internal property for convenient vertices lookup }; ///Basic properties for edge template <class T = discret_net_t> struct basic_edge_properties { typedef int edge_index_t; basic_edge_properties(T ew = 0) : m_weight(ew) {} T m_weight; ///possible construct "continues" nets edge_index_t m_edge_index; ///Internal property for convenient vertices lookup; }; using boost::bidirectionalS; using boost::directedS; using boost::no_property; struct my_ver_p : public basic_vertex_properties<discret_net_t> { double m_node_delay; }; struct my_edge_p : public basic_edge_properties<discret_net_t> { double m_edge_delay; }; int _tmain(int argc, _TCHAR* argv[]) { typedef boost::adjacency_list<boost::listS, boost::listS, directedS, my_ver_p> adj_list1_t; adj_list1_t c(10); boost::property_map<adj_list1_t, my_ver_p::node_name_type my_ver_p::* >::type node_name_map1(boost::get(&my_ver_p::m_node_name, c)); boost::print_graph(c, node_name_map1) ; return 0; } 1>------ Build started: Project: TestBoostGraph1, Configuration: Debug Win32 ------ 1>Compiling... 1>TestBoostGraph1.cpp 1>d:\documents and settings\dmitry\my documents\visual studio 2005\projects\testboostgraph1\testboostgraph1\testboostgraph1.cpp(78) : error C2664: 'boost::bundle_property_map<Graph,Descriptor,Bundle,T>::bundle_property_map(const boost::bundle_property_map<Graph,Descriptor,Bundle,T> &)' : cannot convert parameter 1 from 'boost::bundle_property_map<Graph,Descriptor,Bundle,T>' to 'const boost::bundle_property_map<Graph,Descriptor,Bundle,T> &' 1> with 1> [ 1> Graph=adj_list1_t, 1> Descriptor=void *, 1> Bundle=my_ver_p, 1> T=basic_vertex_properties<discret_net_t>::node_name_type 1> ] 1> and 1> [ 1> Graph=boost::adjacency_list<boost::listS,boost::listS,boost::directedS,my_ver_p>, 1> Descriptor=boost::detail::edge_desc_impl<boost::directed_tag,void *>, 1> Bundle=basic_vertex_properties<discret_net_t>, 1> T=basic_vertex_properties<discret_net_t>::node_name_type 1> ] 1> and 1> [ 1> Graph=adj_list1_t, 1> Descriptor=void *, 1> Bundle=my_ver_p, 1> T=basic_vertex_properties<discret_net_t>::node_name_type 1> ] 1> Reason: cannot convert from 'boost::bundle_property_map<Graph,Descriptor,Bundle,T>' to 'const boost::bundle_property_map<Graph,Descriptor,Bundle,T>' 1> with 1> [ 1> Graph=boost::adjacency_list<boost::listS,boost::listS,boost::directedS,my_ver_p>, 1> Descriptor=boost::detail::edge_desc_impl<boost::directed_tag,void *>, 1> Bundle=basic_vertex_properties<discret_net_t>, 1> T=basic_vertex_properties<discret_net_t>::node_name_type 1> ] 1> and 1> [ 1> Graph=adj_list1_t, 1> Descriptor=void *, 1> Bundle=my_ver_p, 1> T=basic_vertex_properties<discret_net_t>::node_name_type 1> ] 1> No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called 1>TestBoostGraph1 - 1 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== if change graph representation to following typedef boost::adjacency_list<boost::listS, boost::listS, directedS, basic_vertex_properties<> > adj_list1_t; then this compiles without any error: adj_list1_t c(10); boost::property_map<adj_list1_t, basic_vertex_properties<>::node_name_type basic_vertex_properties<>::* >::type node_name_map1(boost::get(&basic_vertex_properties<>::m_node_name, c)); but with this I again have some error (just change "type" to "const_type" adj_list1_t c(10); boost::property_map<adj_list1_t, basic_vertex_properties<>::node_name_type basic_vertex_properties<>::* >::const_type node_name_map1(boost::get(&basic_vertex_properties<>::m_node_name, c)); 1>------ Build started: Project: TestBoostGraph1, Configuration: Debug Win32 ------ 1>Compiling... 1>TestBoostGraph1.cpp 1>d:\documents and settings\dmitry\my documents\visual studio 2005\projects\testboostgraph1\testboostgraph1\testboostgraph1.cpp(79) : error C2664: 'boost::bundle_property_map<Graph,Descriptor,Bundle,T>::bundle_property_map(const boost::bundle_property_map<Graph,Descriptor,Bundle,T> &)' : cannot convert parameter 1 from 'boost::bundle_property_map<Graph,Descriptor,Bundle,T>' to 'const boost::bundle_property_map<Graph,Descriptor,Bundle,T> &' 1> with 1> [ 1> Graph=const adj_list1_t, 1> Descriptor=void *, 1> Bundle=basic_vertex_properties<discret_net_t>, 1> T=const basic_vertex_properties<discret_net_t>::node_name_type 1> ] 1> and 1> [ 1> Graph=adj_list1_t, 1> Descriptor=void *, 1> Bundle=basic_vertex_properties<discret_net_t>, 1> T=basic_vertex_properties<discret_net_t>::node_name_type 1> ] 1> and 1> [ 1> Graph=const adj_list1_t, 1> Descriptor=void *, 1> Bundle=basic_vertex_properties<discret_net_t>, 1> T=const basic_vertex_properties<discret_net_t>::node_name_type 1> ] 1> Reason: cannot convert from 'boost::bundle_property_map<Graph,Descriptor,Bundle,T>' to 'const boost::bundle_property_map<Graph,Descriptor,Bundle,T>' 1> with 1> [ 1> Graph=adj_list1_t, 1> Descriptor=void *, 1> Bundle=basic_vertex_properties<discret_net_t>, 1> T=basic_vertex_properties<discret_net_t>::node_name_type 1> ] 1> and 1> [ 1> Graph=const adj_list1_t, 1> Descriptor=void *, 1> Bundle=basic_vertex_properties<discret_net_t>, 1> T=const basic_vertex_properties<discret_net_t>::node_name_type 1> ] 1> No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called 1>TestBoostGraph1 - 1 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== What is wrong here? Any help would be greatly appreciated, Thanks in advance, --dima // TestBoostGraph1.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <string> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adjacency_matrix.hpp> #include <boost/graph/graphviz.hpp> #include <boost/graph/iteration_macros.hpp> #include <boost/graph/graph_utility.hpp> #include <boost/graph/copy.hpp> ///Just for read "work around" ///Two typedefs for modeling both "discrete" & "continues" nets typedef int discret_net_t; typedef double continues_net_t; /// typedef enum {PLACE, TRANSITION} node_type_t; /*! * If you need some more properties, then you should define your property class that derived from * basic_vertex_properties<>; - for nodes, * basic_edge_properties<>; - for edges * Example: struct my_node_prop : basic_vertex_properties<discret_net_t> { typedef double node_delay_t; node_delay_t m_node_delay; }; typedef CPetriNet<adj_list, boost::vecS, boost::listS, boost::bidirectionalS, my_node_prop> petri_net_t * * The types of all property values must be Copy Constructible, Assignable and Default Constructible!! */ template <class T = discret_net_t> struct basic_vertex_properties { //typedef node_type_t my_node_type; typedef std::string node_name_type; typedef int node_index_t; basic_vertex_properties(node_type_t nt = TRANSITION) : m_node_type(nt) { m_token_number = T(0);} T m_token_number; ///Only for place, possible costruct "continues" nets node_name_type m_node_name; node_type_t m_node_type; ///Vertex could be "Place" or "transition" node_index_t m_node_index;///Internal property for convenient vertices lookup }; ///Basic properties for edge template <class T = discret_net_t> struct basic_edge_properties { typedef int edge_index_t; basic_edge_properties(T ew = 0) : m_weight(ew) {} //private: T m_weight; ///possible construct "continues" nets edge_index_t m_edge_index; ///Internal property for convenient vertices lookup; }; using boost::bidirectionalS; using boost::directedS; using boost::no_property; struct my_ver_p : public basic_vertex_properties<discret_net_t> { double m_node_delay; }; struct my_edge_p : public basic_edge_properties<discret_net_t> { double m_edge_delay; }; int _tmain(int argc, _TCHAR* argv[]) { //typedef boost::adjacency_list<boost::listS, boost::listS, directedS, my_ver_p> adj_list1_t; typedef boost::adjacency_list<boost::listS, boost::listS, directedS, basic_vertex_properties<> > adj_list1_t; adj_list1_t c(10); boost::property_map<adj_list1_t, basic_vertex_properties<>::node_name_type basic_vertex_properties<>::* >::const_type node_name_map1(boost::get(&basic_vertex_properties<>::m_node_name, c)); boost::print_graph(c, node_name_map1) ; return 0; }

3 2

Resolving TR1/Boost conflicts
by Scott Meyers 06 Mar '06

06 Mar '06

Is there a Boost policy on resolving conflicts between Boost behavior and the TR1 spec? As an example, std::tr1::is_base_of<T, T> returns true, but boost::is_base_of<T, T> returns false. Changing Boost behavior would presumably break existing code, but failing to implement TR1 semantics is likely to be confusing/surprising to many. My understanding is that Boost is committed to bringing its TR1-like libraries into conformance with TR1, but it'd be helpful if people who follow Boost more closely than I could confirm that. Thanks, Scott

2 1