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

Newbie: Boost for Windows"
by John Read 25 Mar '06

25 Mar '06

David Abrahams <dave_at_[hidden]> wrote: >That's a tough row to hoe. MinGW is a non-cygwin toolset. If you try >to build bjam under cygwin, you'll get a cygwin version of bjam. I >suggest you remove MinGW/bin from your path (maybe even uninstall >MinGW) and use the gcc-nocygwin toolset >(http://www.boost.org/tools/build/v1/gcc-nocygwin-tools.html) *or* you >give up on the cygwin environment and use the MinGW toolset from a >regular windows command prompt. It is not cygwin per se. I simply would like a proper shell to do my work in. Would using the MSYS command prompt make my row any less rocky? Also, when I use a DOS prompt and run build.bat from the jam_src directory, I seem to use the msvc toolset. This generates a bin.ntx86 directory with a bjam.exe. Looks like I am still not getting the toolset pointing to the gcc compiler. Is there any doc on how to compile Boost using the MinGW toolset and the gcc compiler on windows (preferably with some useable shell, not the DOS prompt)? If no, I will be glad to document this for us all when I get it sorted. Thanks, John --------------------------------- Yahoo! Messenger with Voice. Make PC-to-Phone Calls to the US (and 30+ countries) for 2¢/min or less.

3 2

Re: [Boost-users] [LAMBDA] minimal installation
by Sohail Somani 25 Mar '06

25 Mar '06

Have you tried using bcp (http://www.boost.org/tools/bcp/bcp.html)? Sorry for top-posting, but when I get html emails, outlook looks out. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Andreas Sæbjørnsen Sent: Friday, March 24, 2006 3:21 PM To: boost-users(a)lists.boost.org Subject: [Boost-users] [LAMBDA] minimal installation Since we are interested in using Boost::Lambda in our project and can not depend on the whole of the Boost library because of size restrictions we are interested in including a minimum Lambda subset of Boost. From what I understand only header files are needed in order to use Lambda, so that leads me to believe such a subset should be possible. In an initial experiment I created such a subset, but was unable to make it smaller than 13.3mb. Is it possible to create a subset of Boost to use Lambda which would be around 1mb or less? If so, has anybody already created such a subset? 4096 Mar 24 12:34 config 2050 Mar 24 12:31 config.hpp 4096 Mar 24 12:34 detail 1039 Mar 24 12:33 indirect_reference.hpp 4096 Mar 24 12:34 iterator 4096 Mar 24 12:24 lambda 4096 Mar 24 12:31 mpl 1821 Mar 24 12:34 pointee.hpp 4096 Mar 24 12:34 preprocessor 3626 Mar 24 12:33 ref.hpp 4523 Mar 24 12:33 static_assert.hpp 7844 Mar 24 12:33 static_warning.hpp 4096 Mar 24 12:34 tuple 4096 Mar 24 12:28 type_traits 4096 Mar 24 12:34 utility 13344MB Thanks Andreas Saebjoernsen

2 1

I can't get signals library statically linked
by Marco Cecchetti 24 Mar '06

24 Mar '06

Hi, I've the following problem: I'm using in a program the boost signals library. I compile and link the program with the command below: "g++ -static -o sig.exe -g2 -O0 -I<path to boost include files> -L<path to boost libs> main.cpp -lboost_signals-mgw-d" and I've put the line : "#define BOOST_SIGNALS_STATIC_LINK" in my source code. I'm under the windows platform and I'm using mingw (gcc 3.4.2) and boost 1.33.1 . The program compiles and links without any error but when I try to run it a dialog window says to me that the application has failed to start because "boost_signals-mgw-1_33_1.dll" was not found. It seems that the signal library is not linked statically but I don't succeed in figuring out the reason of this behavior. If I add to the PATH variable the path to the boost libs the program runs properly but I need to get the signal library statically linked, so some help will be very usefull. -- Using Opera's revolutionary e-mail client: http://www.opera.com/mail/

1 0

Large boost::multi_array Problem
by Adam Hartshorne 24 Mar '06

24 Mar '06

Hi, I have the following problem, I make a boost::multi_array<float,2> of size X by X. I initialise this using the following line typedef boost::multi_array<float, 2> array_type; array_type D(boost::extents[num_vertices][num_vertices]); This works fine up to a size of 5000 x 5000 then my program crashes at the definition stage due to memory requirements. I am assuming the boost::extents call stops my program creating a multi array of a size bigger than 5000 x 5000. However in certain situations I need a bigger 2D array, any thoughts on how I can achieve this? Adam

4 4

Re: [Boost-users] [date_time] How to create a date from string withspecific format?
by Andrew Holden 24 Mar '06

24 Mar '06

> -----Original Message----- > From: Christian Henning [mailto:chhenning@gmail.com] > Sent: Tuesday, March 21, 2006 4:23 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [date_time] How to create a date from string > withspecific format? > > Hi Dean, thanks for the answer. > > Since, I know the format of the date strings I could also use > boost::regex for the general format and then feeding a date object > with the values. If I get an exception during the date object > contruction I know that the user provided me with garbage. > > > Any thoughts on that? > > Thanks again, > Christian Have you considered using Regex's submatches? A slightly modified example follows. // date format: mm-dd-yyyy boost::regex oDateReg( "(\\d{2})-(\\d{2})-(\\d{4})" ); std::string strDate( "11-33-1997" ); boost::smatch dateMatch; if( boost::regex_match( strDate , dateMatch , oDateReg )) { try { std::string strMonth = dateMatch[1]; std::string strDay = dateMatch[2]; std::string strYear = dateMatch[3]; unsigned int nYear = boost::lexical_cast<unsigned int>(strYear); unsigned int nMonth = boost::lexical_cast<unsigned int>(strMonth); unsigned int nDay = boost::lexical_cast<unsigned int>(strDay); date d( nYear, nMonth, nDay ); date::ymd_type ymd = d.year_month_day(); } catch( std::out_of_range oEx ) { std::cout << "Error: " << oEx.what() << std::endl; } } There are two advantages to this. First, you no longer need to count characters when extracting the date components. Second, you have a little more freedom in defining your date format. For example, you could use the following definition for oDateReg to also accept single-digit months and/or days: boost::regex oDateReg( "(\\d{1,2})-(\\d{1,2})-(\\d{4})" ); Andrew Holden

4 12

typecasting a boost::shared_ptr ?
by Dhanvi Kapila 24 Mar '06

24 Mar '06

Hi Friends, I have a boost::shared_ptr that stores a pointer to a base class ( class B1 ) and derived classes ( class D1 , class D2 ) both inheriting from the same Base class. The Constructors I have another set of factory classes ( base class : class base1, derived class : class derv1 & class derv2 ) whoose constructors accepts boost::shared_ptr of B1. When constructing derv1: I would like to cast pointer as D1 and ,when constructing derv2 : cast pointer as D2, but the only way I can access the class functions is through a shared_ptr to B1. My question is how do I cast B1 to get D1 and D2 in the constructors for derv1 and derv2 respectively ? the pseudo code is base1* createBase( boost::shared_ptr<B1> b_ptr , int type ) { if( type == 1 ) return new derv1( boost::polymorphic_downcast<AAAA> b_ptr ); else return new derv2( boost::polymorphic_downcast<XXXX> b_ptr ); } what do i write in the place of AAAA & XXXX for the code to wrk ?? Sorry for the long question, but could not express it in any shorter way.. thanks for ur patience and replies Dhanvi

2 1

Building multi-architecture on Mac OS X (Darwin)
by Ken Anderson 24 Mar '06

24 Mar '06

I'm trying to determine the proper command line parameters to build boost universal (i386 & ppc) on a Mac OS X machine. Can anyone give me any recommendations? I need to have this passed to the compiler and linker: -arch i386 -arch pcc Thanks, Ken

2 1

Re: [Boost-users] [iostreams] inverse and "stateful" filters
by EMalenfant＠interstarinc.com 24 Mar '06

24 Mar '06

From: EMalenfant(a)interstarinc.com > Consider the following, using dictionary_output_filter from > the tutorial: > (http://www.boost.org/libs/iostreams/doc/index.html?path=2.2.6.3) > > namespace io = boost::iostreams; > > const std::string source("This foo will be bar"); > > io::example::dictionary dict; > dict.add("foo", "bar"); > > io::filtering_istream in; > in.push(io::invert(io::example::dictionary_output_filter(dict))); > in.push(io::array_source(source.c_str(), source.length())); > > io::copy(in, std::cout); > > Output: > This bar will be > > instead of the expected: > This bar will be bar > Digging a bit, I found that I could "fix" that problem by modifying invert::read() as follows: template<typename Source> std::streamsize read(Source& src, char* s, std::streamsize n) { typedef detail::counted_array_sink<char_type> array_sink; typedef composite<filter_ref, array_sink> filtered_array_sink; assert((flags() & f_write) == 0); if (flags() == 0) { flags() = f_read; buf().set(0, 0); } filtered_array_sink snk(filter(), array_sink(s, n)); int_type status; for ( status = traits_type::good(); snk.second().count() < n && status == traits_type::good(); ) { status = buf().fill(src); buf().flush(snk); } // "Fix": When eof is reached on the input, close the filter so that it writes // any buffered input it may have. if ((snk.second().count() == 0) && (status == traits_type::eof())){ snk.close(); } //... "fix" ends here return snk.second().count() == 0 && status == traits_type::eof() ? -1 : snk.second().count(); } Looking at this, however, I wondered what would happen if the filter has buffered more characters than what would fit in the array_sink. So I tested with a very long (around 300) last word in the input. Result: An infinite loop in non_blocking_adapter::write(), desperately calling write() on a full counted_array_sink. Guess I'll forget about invert and write an InputFilter...

1 0

lexical_cast problem with OS X gcc -fast option
by Colin Dewey 23 Mar '06

23 Mar '06

If I compile the following code (test.cc): #include <iostream> #include <string> #include "boost/lexical_cast.hpp" int main() { int i; std::string s("3"); try { i = boost::lexical_cast<int>(s); } catch (boost::bad_lexical_cast& e) { std::cerr << "Error in conversion\n"; } } with the "-fast" and "-mcpu=G4" options for gcc 3.3 on MacOS X 10.4.5, like so: g++ -I. -ggdb -fast -mcpu=G4 test.cc -o test I get a Bus error when I run the compiled program. I do not get this error when I omit the "-fast -mcpu=G4" options. Here is the trace from gdb: Program received signal EXC_BAD_ACCESS, Could not access memory. Reason: KERN_PROTECTION_FAILURE at address: 0x00000000 0x00017d44 in std::locale::operator= () at test.cc:11 11 } (gdb) backtrace #0 0x00017d44 in std::locale::operator= () at test.cc:11 #1 0x00019e54 in std::ios_base::_M_init () at test.cc:11 #2 0x0001a8c0 in std::basic_ios<char, std::char_traits<char> >::init () at test.cc:11 #3 0x0004b30c in boost::detail::lexical_stream<int, std::string>::lexical_stream (this=0xbffff6f0) at /usr/include/gcc/darwin/3.3-fast/c++/istream:98 #4 0x0004aed8 in boost::lexical_cast<int, std::string> (arg=@0xbffff9e0) at boost/lexical_cast.hpp:135 #5 0x000028e8 in main () at test.cc:10 Any help with this would be greatly appreciated. Thanks!

2 1

Newbie: Boost for Windows
by John Read 23 Mar '06

23 Mar '06

I have to work on Windows, but I don't have any idea about compilers and environments on this platform. My preference would be to use a CygWin environment with MinGW's gcc compiler to facilitate setting up a scripted nightly build incorporating Boost and my own code. Some others might want to use native Microsoft compilers and tools though. Steps so far: 1) Got/installed MinGW: MinGW-5.0.0.exe 2) Got/installed Boost: boost_1_33_1.exe 3) Opened Cygwin terminal and added MinGW/bin to path 4) cd-ed to boost_1_33_1/tools/build/jam_scr 5) . build.sh > result.txt Got these errors in results.txt: ### ### Using 'gcc' toolset. ### rm -rf bootstrap mkdir bootstrap gcc -o bootstrap/jam0 command.c compile.c execnt.c execunix.c execvms.c expand.c filent.c fileos2.c fileunix.c filevms.c glob.c hash.c hdrmacro.c headers.c jam.c jambase.c jamgram.c lists.c make.c make1.c newstr.c option.c parse.c pathunix.c pathvms.c regexp.c rules.c scan.c search.c subst.c timestamp.c variable.c modules.c strings.c filesys.c builtins.c pwd.c class.c native.c modules/set.c modules/path.c modules/regex.c modules/property-set.c modules/sequence.c modules/order.c execunix.c:19:24: sys/times.h: No such file or directory execunix.c: In function `execwait': execunix.c:187: error: storage size of 'old_time' isn't known execunix.c:187: error: storage size of 'new_time' isn't known fileunix.c:95:17: ar.h: No such file or directory fileunix.c: In function `file_archscan': fileunix.c:232: error: storage size of 'ar_hdr' isn't known fileunix.c:241: error: `SARMAG' undeclared (first use in this function) fileunix.c:241: error: (Each undeclared identifier is reported only once fileunix.c:241: error: for each function it appears in.) fileunix.c:242: error: `ARMAG' undeclared (first use in this function) I suspect that there is more involved in getting a proper Windows development environment set up. Can anyone point me in the right direction? A simple list of steps would be great. If none exists, I will provide one to the group once I have this sorted out. Thanks, John __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

Re: [Boost-users] portable uuid generator - seed
by Oliver.Kowalke＠infineon.com 23 Mar '06

23 Mar '06

Hi Andy, as you mentioned in t he source std::time(0) is not a good truly-random seed. Maybe you could use boost::posix_time::microsec_clock::universal_time().time_of_day().total_ nanoseconds() ? Regards, Oliver >hi andy, > >On Fri, 2006-03-03 at 14:26 +0000, Andy Tompkins wrote: >> I am currently working on a guid class. It is not quite done yet, but >> is quite >> functional. It does have a portable function to create guids. I have >> put it >> in the boost vault (guid.zip) in the hopes that it may one day be a >> boost >> library. > >well, the api looks really good (very similar to my libuuid wrapper) ... >but i'm a bit lost building it ... >i guess i have to run bjam, but how do i have to use it? up to now i was >just using emerging boost, but i have to experience in building it :-/ > >thanks ... tim > >-- >TimBlechmann(a)gmx.de ICQ: 96771783 >http://www.mokabar.tk > >Linux is like a wigwam: no windows, no gates, apache inside, stable.

3 2

Re: [Boost-users] asio review results - asio accepted
by RIVASSEAU Jean Noel 23 Mar '06

23 Mar '06

Thanks, actually I wrote the first message because I do not have access to the web right now, and would have liked a short explanation on the ML, but I should have explained that... I'll have a look at it this evening. 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 Markus Schöpflin Envoyé : jeudi 23 mars 2006 15:39 À : boost-users(a)lists.boost.org Objet : Re: [Boost-users] asio review results - asio accepted RIVASSEAU Jean Noel wrote: > Could you just explain very shortly what Asio is about ? See http://asio.sourceforge.net/ Markus _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Re: [Boost-users] asio review results - asio accepted
by RIVASSEAU Jean Noel 23 Mar '06

23 Mar '06

Could you just explain very shortly what Asio is about ? 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 Jeff Garland Envoyé : jeudi 23 mars 2006 15:18 À : boost-users(a)lists.boost.org Objet : [Boost-users] asio review results - asio accepted Cross-post from development list ---- All - I'm pleased to announce that asio has been accepted into Boost. As usual with a Boost review, the asio review generated plenty of discussion, issues, and controversy. Comments ranged from high praise, including success stories of projects in production, to serious design concerns and issues. On balance, in my judgment, asio provides a generally solid library that is ready for inclusion into the Boost library -- providing key functionality in an area that developers have a strong need. Of course, like anything else, asio is not perfect -- a number of key issues were uncovered during the review. In terms of required changes I'm only going to cite a few: - Fixes to dynamic memory allocation issues - Interface changes to support ipv4 and ipv6 seamlessly at runtime - Improvements to support strongly typed socket interfaces Chris has communicated a couple possible solutions to the memory allocation issue and I'll ask that the interface and other changes for this issue continue to be discussed on the Boost list so consensus can be achieved on the best resolution. Other key improvements that should be explored as future enhancements include: - Possible removal of some of the c-style interfaces - Exploration of higher level iostream integrations - Performance improvements - Improved documentation (wouldn't be Boost w/o this one) Chris has a much longer list of changes garnered from the review and is well on his way to addressing many of them. Note that there were several threads and discussions about performance, which is particularly critical for the domain covered by asio. One of the performance issues is the dynamic memory allocation issue cited above. In general, the reviewers have extremely high expectations here. However, after reviewing the discussion and library it's my belief that many developers will find asio performance sufficient to build significant projects with only the memory allocation changes. I expect Chris will be able to address some of the other performance issues cited by reviewers in asio over time. Once again I'll apologize to the Boost community for the delay in the review results. The delay was entirely due to my own personal scheduling issues and should not reflect on asio in any way. Thanks again to all the reviewers for their effort and especially to Chris for his tremendous effort in bringing asio to Boost! Jeff _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

asio review results - asio accepted
by Jeff Garland 23 Mar '06

23 Mar '06

Cross-post from development list ---- All - I'm pleased to announce that asio has been accepted into Boost. As usual with a Boost review, the asio review generated plenty of discussion, issues, and controversy. Comments ranged from high praise, including success stories of projects in production, to serious design concerns and issues. On balance, in my judgment, asio provides a generally solid library that is ready for inclusion into the Boost library -- providing key functionality in an area that developers have a strong need. Of course, like anything else, asio is not perfect -- a number of key issues were uncovered during the review. In terms of required changes I'm only going to cite a few: - Fixes to dynamic memory allocation issues - Interface changes to support ipv4 and ipv6 seamlessly at runtime - Improvements to support strongly typed socket interfaces Chris has communicated a couple possible solutions to the memory allocation issue and I'll ask that the interface and other changes for this issue continue to be discussed on the Boost list so consensus can be achieved on the best resolution. Other key improvements that should be explored as future enhancements include: - Possible removal of some of the c-style interfaces - Exploration of higher level iostream integrations - Performance improvements - Improved documentation (wouldn't be Boost w/o this one) Chris has a much longer list of changes garnered from the review and is well on his way to addressing many of them. Note that there were several threads and discussions about performance, which is particularly critical for the domain covered by asio. One of the performance issues is the dynamic memory allocation issue cited above. In general, the reviewers have extremely high expectations here. However, after reviewing the discussion and library it's my belief that many developers will find asio performance sufficient to build significant projects with only the memory allocation changes. I expect Chris will be able to address some of the other performance issues cited by reviewers in asio over time. Once again I'll apologize to the Boost community for the delay in the review results. The delay was entirely due to my own personal scheduling issues and should not reflect on asio in any way. Thanks again to all the reviewers for their effort and especially to Chris for his tremendous effort in bringing asio to Boost! Jeff

1 0

SubjectObserver, boost::Signals and thread safety.
by James Hughes 23 Mar '06

23 Mar '06

I notice from the signals documentation that it is not yet thread safe - since I need a thread safe subjectobserver pattern, should I quickly knock one up (!) or is it likely that signals will be thread safe in the near future? James

1 0

[uBLAS + Serialization] Is This Safe?
by Wu Yinghui, Freddie 23 Mar '06

23 Mar '06

Hi all, I found that uBLAS doesn't have Serialization support built in. So in my code, I do the following: ===== snip ===== class A { typedef boost::numeric::ublas::c_vector<float, 3> container_t; public: // Other member functions... private: friend class boost::serialization::access; template <typename Archive> void serialize(Archive &ar, unsigned int version) { container_t::pointer data = data_.data(); container_t::value_type (*p)[3] = reinterpret_cast<container_t::value_type (*)[3]>(data); ar & boost::serialization::make_nvp("data", *p); } private: // The data field to be serialized container_t data_; }; ===== snip ===== While this code seems to be working on my machine, there is reinterpret_cast<> in place in order to grab the content of the vector, as you can see. So my question is: Is this way of performing serialization safe/ portable/ etc.? Any idea? 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.

1 0

Boost Integer Traits 64-bit Support
by Wu Yinghui, Freddie 23 Mar '06

23 Mar '06

Just a quick question, does Boost integer traits classes support 64-bit integral types? I didn't seem to be able to get the following code compile: #include <boost/integer.hpp> #include <boost/integer/integer_mask.hpp> typedef typename boost::int_t<64> int_type; typedef boost::high_bit_mask_t<63> high_bit_type; I know that I can use boost::int64_t, but the problem is that the "64" here is not fixed in my code. It is dependent on some other parameters, so it could be 32 too. Am I missing anything? 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.

4 4

Re: [Boost-users] [Unit-Test] How to test private functions
by Shugar, Ben USC-RR 22 Mar '06

22 Mar '06

Try calling it inside a constructor or calling them from inside a public test method. Remember the publis test method is just for that purpose -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Leif Gruenwoldt Sent: Wednesday, March 22, 2006 11:55 AM To: boost-users(a)lists.boost.org Subject: [Boost-users] [Unit-Test] How to test private functions Is there a way to test the private functions of a class without moving them into public scope during test? What are some strategies for this? I was hoping to add "friend class boost::unit_test::test_suite;" to my class but that didn't work. -- Leif Gruenwoldt _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[iostreams] inverse and "stateful" filters
by EMalenfant＠interstarinc.com 22 Mar '06

22 Mar '06

Hi, I wanted an InputFilter for removing comments from C++ source files. Since it seemed easier to write an OutputFilter, I decided to write that, and use iostreams::inverse to make an InputFilter out of it. However, it seems that inverse can't be used with "stateful" filters. Consider the following, using dictionary_output_filter from the tutorial: (http://www.boost.org/libs/iostreams/doc/index.html?path=2.2.6.3) namespace io = boost::iostreams; const std::string source("This foo will be bar"); io::example::dictionary dict; dict.add("foo", "bar"); io::filtering_istream in; in.push(io::invert(io::example::dictionary_output_filter(dict))); in.push(io::array_source(source.c_str(), source.length())); io::copy(in, std::cout); Output: This bar will be instead of the expected: This bar will be bar Is this a "known limitation"? Is there a workaround? Am I doing something silly? ----------------------------- Éric A conclusion is the place where you got tired of thinking

1 0

How can I package boost library in a rpm?
by yinglcs2＠yahoo.com 22 Mar '06

22 Mar '06

Hi, If I need to build the boost library myself, how can I package it as a RPM? Thank you. __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

1 0

Re: [Boost-users] Boost.Regex - why does it core dump?
by Smith Matt - matsmi 22 Mar '06

22 Mar '06

> Oh !*^% it's an outstanding shared_ptr bug: if you define > BOOST_SP_USE_PTHREADS both when building regex and again in your application > this problem will go away. I'll go off and nag the people responsible ;-> Well, surprisingly enough (because, as I understand it, gcc on HP-UX does not support multi-threading), that worked! Thanks for your help, John! Matt ************************************************************************* 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

Re: [Boost-users] [date_time] How to create a date from stringwithspecific format?
by Andrew Holden 22 Mar '06

22 Mar '06

> -----Original Message----- > From: Christian Henning [mailto:chhenning@gmail.com] > Sent: Wednesday, March 22, 2006 9:22 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [date_time] How to create a date from > stringwithspecific format? > > Andrew, thanks for pointing out the submatch feature. Unfortunately no > match can be found when I try your code. Is it working on your > machine? Here, the dateMatch container size just 1. > > Any ideas why? > > Christian The code seems to work correctly on my machine (MSVC8 with Boost 1.33.1). It throws an out of range error because strDate specifies November 33. If I change strDate to 11-30-1997, then I can "cout << d" and get the date.

3 2

Re: [Boost-users] [date_time] How to create a date fromstringwithspecific format?
by Andrew Holden 22 Mar '06

22 Mar '06

> -----Original Message----- > From: Christian Henning > > int _tmain(int argc, _TCHAR* argv[]) > { > //second approach > boost::regex oDateReg2( "\\d{2}-\\d{2}-\\d{4}" ); The parentheses in my version of the example were important. They specify the size of the match object, as well as the exact portions of the string to capture. This line should read as follows: boost::regex oDateReg2( "(\\d{2})-(\\d{2})-(\\d{4})" ); or if you wish to allow single-digit months and days, boost::regex oDateReg2( "(\\d{1,2})-(\\d{1,2})-(\\d{4})" ); FYI, the order of the match object is the same as the CLOSING parentheses. This is good to know if you ever start nesting them. > > When I run the captures_examples of the regex lib the smatch stuff > works. But not here. Very strange. > > Thanks, > Christian > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

boost, COM and .NET [maybe OT]
by Thomas Laguzzi 22 Mar '06

22 Mar '06

Hello there, I'd like to thank Alan for the reply to my previous post. I'm sorry if this message is OT. What I ask is not a technical detail, but an opinion from you, c++ gurus :) Finally I've setup a simply class hierarchy that derives from a common object. Each class has: 1) Smart Pointer (boost::intrusiveptr),typedef intrusiveptr<ClassName> ClassName_Ptr; 2) Array of smart pointers ( typedef array <ClassName_Ptr> ClassName_Array) Everything works fine , and I'm happy :) the framework has no depends , it's self-contained and performant :) It is composed by a bunch of classes, but with MANY members. Now, I've got to make this small framework usable from: 1) .COM for compatibility 2) .NET for future applications and of course 3) c++ and boost :) All the three ways use the "allocate and forget about it" paradigm for memory allocation. I only use c++ types and I don't have ANY pointer used directly in the code. Changing to .NET is not hard and doesn't require wrapper classes (since the lib is self-contained), just some preprocessor programming and recompiling. Option 3) require no change :) What I worry about is .COM interop. Since classes are not derived from interfaces, I would require a lot of wrappers to native classes (because i don't want to use directly COM rules and types). So I see two solutions: 1) ok, write these wrappers as "external" code (I have lot's of properties and methods to wrap), maybe by using GCCXML and an automatic generator. 2) write base Interfaces and derive my framework classes from these, eventually adapting intrusive_ptr to use COM AddRef's 3) use .NET to COM interop and resolve problem 1 and 2 together, but distribuite 200MB of dll's Anyone has experience with intrusive_ptr (or shared_ptr) and COM pointers? Any idea about the general problem? Thanks & Sorry for my English! Thomas

2 1

Boost.Regex - why does it core dump?
by Smith Matt - matsmi 22 Mar '06

22 Mar '06

I have built Boost 1.33.1 on a HP-UX 11.22 OS with GCC 4.02. I have created a little test program, and when it gets to the following line of code it core dumps. boost::regex Exp( "[0-9]" ); This happens when I link both statically or dynamically. Any insights into what might be the problem would be greatly appreciated. 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. ****************************************************************************

3 7

Re: [Boost-users] Boost.Regex - why does it core dump?
by Smith Matt - matsmi 22 Mar '06

22 Mar '06

> 1) add a try catch block and verify that the dump isn't a result of an uncaught exception. Done. Same result. > 2) provide a backtrace? Okay; here it is: Program terminated with signal 11, Segmentation fault. #0 0x407c851 in boost::detail::atomic_increment (pw=0x400087a4) at sp_counted_base_gcc_ia64.hpp:38 38 "r"(pw)); (gdb) backtrace #0 0x407c851 in boost::detail::atomic_increment (pw=0x400087a4) at sp_counted_base_gcc_ia64.hpp:38 #1 0x407cc60 in boost::detail::sp_counted_base::add_ref_copy (this=0x400087a0) at sp_counted_base_gcc_ia64.hpp:117 #2 0x407cdb0 in boost::detail::shared_count::shared_count (this=0x7ffff0f8, r=@0x7ffff128) at shared_count.hpp:170 #3 0x4087700 in boost::shared_ptr<boost::re_detail::cpp_regex_traits_implementation<char > >::boost::shared_ptr<boost::re_detail::cpp_regex_traits_implementation<c har> > (this=0x7ffff0f4) at shared_ptr.hpp:106 #4 0x40af160 in std::pair<boost::shared_ptr<boost::re_detail::cpp_regex_traits_implement ation<char> >,boost::re_detail::cpp_regex_traits_base<char> const* >::std::pair<boost::shared_ptr<boost::re_detail::cpp_regex_traits_implem entation<char> >,boost::re_detail::cpp_regex_traits_base<char> const* > (this=0x7ffff0f4, __a=@0x7ffff124, __b=@0x7ffff0f0) at stl_pair.h:85 #5 0x4119f40 in boost::object_cache<boost::re_detail::cpp_regex_traits_base<char>,boost: :re_detail::cpp_regex_traits_implementation<char> >::do_get ( k=@0x7ffff1b0, max_cache_size=5) at object_cache.hpp:122 #6 0x411b190 in boost::object_cache<boost::re_detail::cpp_regex_traits_base<char>,boost: :re_detail::cpp_regex_traits_implementation<char> >::get ( k=@0x7ffff1b0, max_cache_size=5) at object_cache.hpp:78 #7 0x411b250 in boost::shared_ptr<boost::re_detail::cpp_regex_traits_implementation<char > > boost::re_detail::create_cpp_regex_traits<char> (l=@0x7ffff1e0) at cpp_regex_traits.hpp:822 #8 0x411b380 in boost::cpp_regex_traits<char>::boost::cpp_regex_traits<char> ( this=0x40008760) at cpp_regex_traits.hpp:842 #9 0x411b480 in boost::regex_traits<char,boost::cpp_regex_traits<char> >::boost::regex_traits<char,boost::cpp_regex_traits<char> > (this=0x40008760) at regex_traits.hpp:68 #10 0x411b500 in boost::regex_traits_wrapper<boost::regex_traits<char,boost::cpp_regex_tr aits<char> > >::boost::regex_traits_wrapper<boost::regex_traits<char,boost::cpp_regex _traits<char> > > (this=0x40008760) at regex_traits.hpp:162 #11 0x411b5b0 in boost::re_detail::regex_data<char,boost::regex_traits<char,boost::cpp_re gex_traits<char> > >::boost::re_detail::regex_data<char,boost::regex_traits<char,boost::cpp _regex_traits<char> > > (this=0x4000f410) at basic_regex.hpp:54 #12 0x411b740 in boost::re_detail::basic_regex_implementation<char,boost::regex_traits<ch ar,boost::cpp_regex_traits<char> > >::boost::re_detail::basic_regex_implementation<char,boost::regex_traits <char,boost::cpp_regex_traits<char> > > ( this=0x4000f410) at basic_regex.hpp:85 #13 0x411b880 in boost::basic_regex<char,boost::regex_traits<char,boost::cpp_regex_traits <char> > >::do_assign (this=0x7ffff2d8, p1=0x404d950 ".", p2=0x404d951 "", f=0) at basic_regex.hpp:517 #14 0x4079f10 in boost::basic_regex<char,boost::regex_traits<char,boost::cpp_regex_traits <char> > >::assign+0x90 () #15 0x407a000 in boost::basic_regex<char,boost::regex_traits<char,boost::cpp_regex_traits <char> > >::assign+0xc0 () #16 0x407a100 in boost::basic_regex<char,boost::regex_traits<char,boost::cpp_regex_traits <char> > >::boost::basic_regex<char,boost::regex_traits<char,boost::cpp_regex_tra its<char> > >+0xd0 () #17 0x4067ee0:0 in ValidateArgs+0x430 () #18 0x4068800:0 in main+0xc0 () Current language: auto; currently c++ ************************************************************************* 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. *************************************************************************

2 1

Re: [Boost-users] [regex] Working with wchar_t on olderUNIXplatforms
by Andrei Tarassov 22 Mar '06

22 Mar '06

As I understand using this feature requires ICU. Unfortunately, this is not an option for us :-( Andrei -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of John Maddock Sent: Tuesday, March 21, 2006 20:54 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [regex] Working with wchar_t on olderUNIXplatforms > I am intrigued with what you said about converting data from UTF-8 to > UTF-32 on the fly. It is absolutely not a problem to convert my > Unicode strings to UTF-8 encoded strings. Where could I read about > those on the fly conversions and what limitations do they have (e.g. > how locale settings are handled)? What locale settings? UTF-8 is mostly locale-independent (as an encoding), the only locale specific code is in the traits class to handle collation: and it only sees UTF-32 code points. The on-the-fly conversions are performed by iterator adapters in boost/regex/pending/unicode_iterator.hpp and the docs for the Unicode aware code is here: http://www.boost.org/libs/regex/doc/icu_strings.html John. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

file-system "system_complete()" and C:/
by Matt England 22 Mar '06

22 Mar '06

The following is a note of my developers that was attached to a bug close report. Is this special check for to convert "x:" to "x:/" a good practice for the Boost file-system library usage? Is there a better way to do this and/or are we missing something? -Matt The boost system_complete() function is used to convert relative paths into absolute paths. For some reason, boost interprets 'c:' as an incomplete path, and the windows boost behavior is to initially complete the path to the working directory. In other words 'c:' was becoming (in my case) 'c:/mydata/'. I added a check in Client.cpp to see if the --get parameter is equal to 'x:' and if it is, convert it to 'x:/'.

2 1

Re: [Boost-users] [date_time] How to create a date from string with specific format?
by Dean Sturtevant 21 Mar '06

21 Mar '06

Good question -- this is the kind of thing I've been struggling with lately (I tried to post a question about it to the group, but I worded it poorly and the moderator rejected it). Anyway, here's the solution I came up with. I am sure there are better ones! - Dean //! Utility function to split apart string. Returns # of components. inline int split_into_two_or_less(const std::string& s, char sep, std::string& first, std::string& second) { int sep_pos = static_cast<int>(s.find(sep)); if (sep_pos == -1) { first = s; return 1; } else { first = s.substr(0,sep_pos); second = s.substr(sep_pos+1); return 2; } } class expected_character : public boost::bad_lexical_cast { char _messagebuf[81]; public: expected_character(const char* who, char ch, const char* str, int pos) { snprintf(_messagebuf, sizeof(_messagebuf), "%s: Expected '%c' at position %d in \"%s\"", who, ch, pos, str); _messagebuf[sizeof(_messagebuf)-1] = '\0'; } const char* what() const throw() { return _messagebuf; } }; //! Parse date string of form YYYY-MM-DD // Code adapted from boost/date_time/date_parsing.hpp's parse_undelimited_date() template <class date_type> inline date_type parse_delimited_iso_8601_date(const std::string& s) { int offsets[] = {4,1,2,1,2}; int pos = 0; typedef typename date_type::year_type year_type; typename date_type::ymd_type ymd((year_type::min)(),1,1); // TODO: Is there a boost macro for sizeof(a)/sizeof(type)? or for the end of an array? boost::offset_separator osf(offsets, offsets+sizeof(offsets)/sizeof(offsets[0])); boost::tokenizer<boost::offset_separator> tok(s, osf); for(boost::tokenizer<boost::offset_separator>::iterator ti=tok.begin(); ti!=tok.end();++ti) { switch(pos) { case 0: ymd.year = boost::lexical_cast<unsigned short>(*ti); break; case 1: if (*ti != "-") { throw expected_character("parse_delimited_iso_8601_date", '-', s.c_str(), 5); } break; case 2: ymd.month = boost::lexical_cast<unsigned short>(*ti); break; case 3: if (*ti != "-") { throw expected_character("parse_delimited_iso_8601_date", '-', s.c_str(), 7); } break; case 4: ymd.day = boost::lexical_cast<unsigned short>(*ti); break; } pos++; } return date_type(ymd); }

2 1

Re: [Boost-users] enable_shared_from_this - or an alternative..
by Nat Goodspeed 21 Mar '06

21 Mar '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Felipe Magno de Almeida > Sent: Tuesday, March 21, 2006 1:15 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] enable_shared_from_this - or an alternative.. > > > [Nat] > > for this use case, I see no particular advantage to using weak_ptr > > rather than a dumb pointer. > > weak-ptr is thread-safe. [Nat] Okay, that's worth remembering, thanks. Our project is single-threaded, so the issue didn't arise for us.

1 0

[date_time] How to create a date from string with specific format?
by Christian Henning 21 Mar '06

21 Mar '06

Hi there, I would like to create a date object from a string with a specific format ( mm-dd-yyyy ). How to I do that? Thanks ahead, Christian

1 0

Re: [Boost-users] Boost.Regex - why does it core dump?
by Smith Matt - matsmi 21 Mar '06

21 Mar '06

> > I have built Boost 1.33.1 on a HP-UX 11.22 OS with GCC 4.02. > > Just a wild suggestion: I take it that gcc-4.02 is not your default g++ > compiler (the one you get when you invoke g++)? If so are you certain that > the lib was built with gcc-4 and not the default compiler? It would > certainly cause that kind of issue if that's the case. gcc-4.02 IS the default compiler, so that is what the libraries and my test program are built with. Thanks. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users *************************************************************************** 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

Re: [Boost-users] [regex] Working with wchar_t on older UNIXplatforms
by Andrei Tarassov 21 Mar '06

21 Mar '06

John, Thanks for help! I've managed to create my own traits classes and even made the whole stuff compile, but I found that it would not work :-) Right now I am doing intermediate encoding/decoding between wchar_t and the local encoding (which is determined by the locale). However, I do not like that approach much. I am intrigued with what you said about converting data from UTF-8 to UTF-32 on the fly. It is absolutely not a problem to convert my Unicode strings to UTF-8 encoded strings. Where could I read about those on the fly conversions and what limitations do they have (e.g. how locale settings are handled)? Thanks, Andrei -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of John Maddock Sent: Tuesday, March 21, 2006 12:36 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [regex] Working with wchar_t on older UNIXplatforms > Now I tried to integrate wregex in the software, but it just would > not compile complaining about missing wstring (and defined > BOOST_NO_WREGEX). I tried to make up my own regex character traits > class, but this does not seem to help, because some other > classes/types (such as sub_match) make use of basic_string<charT>. > > Is there any way to bypass the problem? OK all the following comments apply to 1.33.1. There are two easy options and one harder option: Easy option #1, use STLport if it supports wstring. Easy option #2, use the ICU/Unicode support in 1.33.1 to search your data directly (as long as it's in UTF-8, UTF-16 or UTF-32 format). You'll get back iterators into your data (whatever encoding it's in), so there's no problems determining offsets etc. The slightly harder option, as you've guessed already: write your own traits class, from 1.33 onwards you can use vector<charT> in place of basic_string<charT> in the traits class. If you take a look at the traits class used by the Unicode/ICU support code it should give you the general idea, and there are docs here: http://www.boost.org/libs/regex/doc/concepts.html#traits And finally... if you data is in MBCS format you might get some ideas from the unicode suuport code in 1.33.x: basically in order to handle multibyte encodings it converts from UTF-8 or UTF-16 to UTF-32 code points on the fly. Of course this requires that the on-the-fly conversions are bidirectional, this works OK for Unicode, but I'm not sure about how far you would get with other encodings. HTH, John. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Re: [Boost-users] enable_shared_from_this - or an alternative..
by Nat Goodspeed 21 Mar '06

21 Mar '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Felipe Magno de Almeida > Sent: Monday, March 20, 2006 8:53 PM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] enable_shared_from_this - or an alternative.. > > On 3/20/06, Nat Goodspeed <ngoodspeed(a)solidworks.com> wrote: > > > Indeed, for our purposes, we don't WANT smart pointers in the registry. > > Couldnt be a weak_ptr ? [Nat] It could. But AFAICT the big advantage of a weak_ptr over a dumb base* pointer is that a weak_ptr can detect when the referenced object has been deleted. Since our base-class destructor unregisters the object, deleting the registered pointer, that becomes a non-issue. So for this use case, I see no particular advantage to using weak_ptr rather than a dumb pointer. Indeed, for this use case, there appear to be a couple of advantages to using a dumb pointer. It's cheaper than a weak_ptr. But more importantly, it works regardless of whether the referenced object is allocated on the heap, on the stack or in static storage. That's useful to us, as we do have a number of tracked objects declared statically.

2 1

Re: [Boost-users] how to use shared_ptr to wrap std::vector andreturnfrom function?
by Sohail Somani 21 Mar '06

21 Mar '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > David Abrahams > Sent: Tuesday, March 21, 2006 4:25 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] how to use shared_ptr to wrap > std::vector andreturnfrom function? > > "Sohail Somani" <s.somani(a)fincad.com> writes: > > >> -----Original Message----- > >> From: boost-users-bounces(a)lists.boost.org > >> [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > >> kdsfinger(a)gmail.com > >> Sent: Monday, March 20, 2006 9:59 AM > >> To: Boost-users(a)lists.boost.org > >> Subject: [Boost-users] how to use shared_ptr to wrap > >> std::vector and returnfrom function? > >> > >> hi, Boost users > >> > >> Suppose I created a large data in a function and want to > >> return it back to where the function was called. I want to > >> return the pointer so that the deep copy of the large data is > >> not needed and memory leak is nicely handled. Can someone let > >> me know how to do it? > > > > This is what auto_ptr is for, shared_ptr is overkill as far as I can > > tell > > unless you have to cross DLL boundaries, or you need a custom deletion > routine, or a base class of the object pointed to might not have a > virtual destructor, ... As far as I can tell! Sheesh :)

1 0

Re: [Boost-users] lexical_cast and string to wstring!
by Andrew Holden 21 Mar '06

21 Mar '06

> -----Original Message----- > From: Thomas Gulbrandsen [mailto:thomas@tansa.no] > Sent: Tuesday, March 21, 2006 11:30 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] lexical_cast and string to wstring! > > Hello! > > I have to convert a std::wstring to a std::string and tried the following > small test program. > But this will not compile on MSVC8.0 or MSVC7.1. > Is the boost::lexical_cast suppost to handle this conversion? As far I know, it's not (corrections, anybody?). My usual method to perform this conversion on Windows is to use WideCharToMultiByte, found in the Windows Platform SDK. Note, however, this function is designed to work with C-style strings and/or fixed-width. You might consider a function similar to the following (warning: untested code): #include <string> #include <windows.h> std::string NarrowString (const std::wstring &src) { //A temporary buffer to store the converted string. //It must be large enough to store the string. char buffer[100]; //Convert the string to UTF-8 and store it in the local buffer. //If you're looking for your native encoding, replace //CP_UTF8 with CP_ACP and look into the dwFlags, lpDefaultChar, and //lpUsedDefaultChar parameters to WideCharToMultiByte. int narrowWidth = WideCharToMultiByte (CP_UTF8, 0, src.data(), src.length(), buffer, sizeof buffer, NULL, NULL); //Convert the buffer to a string and return it return std::string (buffer, narrowWidth); } Other platforms have a similar facility. If you're looking for a cross-platform solution, I would recommend the ICU library. Also, as I understand it, ICU is the "similar facility" for several variants of Unix.

2 1

Boost Regex 'Split' Question
by admin＠geocodenet.com 21 Mar '06

21 Mar '06

Hi all, I have Boost 1.33.1 and VC++ 7.1. I'm currently writing some apps that perform splitting, searching, replacing, etc. using Boost Regex++. I've nailed the searching, but am having trouble with the splitting. Basically I need to know how to convert the result of a regex_token_iterator to a C-style string (don't ask...) that I can display using the old-style printf() function. Can anyone out there give me an idea how to implement such a beast? Thanks in advance.

2 2

Question on ptr_vector class
by Sebastien Fortier 21 Mar '06

21 Mar '06

I would like to define two different sorting predicates for a class but I do not understand how to do this. //meteorlogicalObj.hpp class meteorlogicalObj { public: meteorlogicalObj(int val, Point pt) : val_(val), pt_(pt){} virtual ~meteorlogicalObj() {} // how would I go about creating these sorting functions that would work with the ptr_vector class bool sortOnValue(const meteorlogicalObj&, const meteorlogicalObj&); bool sortOnPoint(const meteorlogicalObj&, const meteorlogicalObj&); // ... private: int val_; Point pt_; }; //meteorlogicalObj.cpp #include "meteorlogicalObj.h" bool meteorlogicalObj::sortOnValue(const meteorlogicalObj& metObj, const meteorlogicalObj& other) { return (metObj.val_ < other.val_); } bool meteorlogicalObj::sortOnPoint(const meteorlogicalObj& metObj, const meteorlogicalObj& other) { return (metObj.pt_ < other.pt_); } //main.cpp boost::ptr_vector<meteorlogicalObj> metObjVec; //... fill vector metObjVec.sort( sortOnValue() ); // this does not work, what is missing??? metObjVec.sort( sortOnPoint() ); // this does not work, what is missing??? I can see that I probably need the indect_fun but I do not know how to wrap my sorting function to pass them to the sorting function Thank you for your assistance!

2 1

Newbie Question: Boost Regex
by admin＠geocodenet.com 21 Mar '06

21 Mar '06

Hi, I have a newbie question here. I'm trying to use the Boost regex in an application, but I keep getting strange errors. How can I compile the regex code into a DLL or LIB that I can link to from my app -- I'm looking for the path of least resistance here. The version is 1.33.1, the platform is VC++ 7.1. The most recent error is the following: xp_regex_match error LNK2019: unresolved external symbol "private: class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > & __thiscall boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::do_assign(char const *,char const *,unsigned int)" (?do_assign@?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@boost@@AAEAAV12@PBD0I@Z) referenced in function "public: class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > & __thiscall boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::assign(char const *,char const *,unsigned int)" (?assign@?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@boost@@QAEAAV12@PBD0I@Z) xp_regex_match error LNK2019: unresolved external symbol "public: bool __thiscall boost::re_detail::perl_matcher<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator,class std::allocator<struct boost::sub_match<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator> >,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::find(void)" (?find@?$perl_matcher@Vconst_iterator@?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V?$allocator@U?$sub_match@Vconst_iterator@?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@boost@@@3@U?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@re_detail@boost@@QAE_NXZ) referenced in function "bool __cdecl boost::regex_search<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator,class std::allocator<struct boost::sub_match<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator> >,char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator,class boost::match_results<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator,class std::allocator<struct boost::sub_match<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator> > > &,class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > const &,enum boost::regex_constants::_match_flags,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator)" (??$regex_search@Vconst_iterator@?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V?$allocator@U?$sub_match@Vconst_iterator@?$basic_string@DU?$char_t xp_regex_match error LNK2019: unresolved external symbol "public: __thiscall boost::re_detail::perl_matcher<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator,class std::allocator<struct boost::sub_match<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator> >,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::perl_matcher<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator,class std::allocator<struct boost::sub_match<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator> >,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator,class boost::match_results<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator,class std::allocator<struct boost::sub_match<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator> > > &,class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > const &,enum boost::regex_constants::_match_flags,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::const_iterator)" (??0?$perl_matcher@Vconst_iterator@?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V?$allocator@U?$sub_match@Vconst_iterator@?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@boost@@@3@U?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@re_detail@boost@@QAE@Vconst_iterator@?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@0AAV?$match_results@Vconst_iterator@?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V?$allocator@U?$sub_match@Vconst_iterator@?$basic_string@DU?$ xp_regex_match fatal error LNK1120: 3 unresolved externals Any feedback is appreciated. Thanks!

3 3

lexical_cast and string to wstring!
by Thomas Gulbrandsen 21 Mar '06

21 Mar '06

Hello! I have to convert a std::wstring to a std::string and tried the following small test program. #include <iostream> #include <string> #include <boost/lexical_cast.hpp> int main(int argc, char** argv) { std::wstring ws(L"Hello"); std::string s(boost::lexical_cast<std::string>(ws); std::cout << s << std::endl; return 0; } But this will not compile on MSVC8.0 or MSVC7.1. Is the boost::lexical_cast suppost to handle this conversion? Thanks, Thomas Gulbrandsen

1 0

Re: [Boost-users] Question on ptr_vector class
by David Klein 21 Mar '06

21 Mar '06

boost-users-bounces(a)lists.boost.org wrote: > I would like to define two different sorting predicates for a class > but I do not understand how to do this. > > //meteorlogicalObj.hpp > class meteorlogicalObj { > public: > meteorlogicalObj(int val, Point pt) : val_(val), pt_(pt){} > virtual ~meteorlogicalObj() {} > > // how would I go about creating these sorting functions that would > work with the ptr_vector class > bool sortOnValue(const meteorlogicalObj&, const meteorlogicalObj&); > bool sortOnPoint(const meteorlogicalObj&, const meteorlogicalObj&); > // ... > private: > int val_; > Point pt_; > }; > > //meteorlogicalObj.cpp > #include "meteorlogicalObj.h" > > bool meteorlogicalObj::sortOnValue(const meteorlogicalObj& metObj, > const meteorlogicalObj& other) > { > return (metObj.val_ < other.val_); > } > > > bool meteorlogicalObj::sortOnPoint(const meteorlogicalObj& metObj, > const meteorlogicalObj& other) > { > return (metObj.pt_ < other.pt_); > } > > //main.cpp > boost::ptr_vector<meteorlogicalObj> metObjVec; > > //... fill vector > > metObjVec.sort( sortOnValue() ); // this does not work, what is > missing??? metObjVec.sort( sortOnPoint() ); // this does not work, > what is missing??? > > I can see that I probably need the indect_fun but I do not know how to > wrap my sorting function to pass them to the sorting function > > > > Thank you for your assistance! > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users hi sebastien, try the following changes... 1) make the sort function static class meteorlogicalObj { ... static bool sortOnValue(const meteorlogicalObj&, const meteorlogicalObj&); ... }; 2) call sort like this metObjVec.sort(&meteorlogicalObj::sortOnValue); HTH dave

1 0

[date_time] How to create a date from string with specific format?
by Christian Henning 21 Mar '06

21 Mar '06

Hi there, I would like to create a date object from a string with a specific format ( mm-dd-yyyy ). How to I do that? Thanks ahaed, Christian

1 0

Re: [Boost-users] Question on ptr_vector class
by David Klein 21 Mar '06

21 Mar '06

boost-users-bounces(a)lists.boost.org wrote: > I would like to define two different sorting predicates for a class > but I do not understand how to do this. > > //meteorlogicalObj.hpp > class meteorlogicalObj { > public: > meteorlogicalObj(int val, Point pt) : val_(val), pt_(pt){} > virtual ~meteorlogicalObj() {} > > // how would I go about creating these sorting functions that would > work with the ptr_vector class > bool sortOnValue(const meteorlogicalObj&, const meteorlogicalObj&); > bool sortOnPoint(const meteorlogicalObj&, const meteorlogicalObj&); > // ... > private: > int val_; > Point pt_; > }; > > //meteorlogicalObj.cpp > #include "meteorlogicalObj.h" > > bool meteorlogicalObj::sortOnValue(const meteorlogicalObj& metObj, > const meteorlogicalObj& other) > { > return (metObj.val_ < other.val_); > } > > > bool meteorlogicalObj::sortOnPoint(const meteorlogicalObj& metObj, > const meteorlogicalObj& other) > { > return (metObj.pt_ < other.pt_); > } > > //main.cpp > boost::ptr_vector<meteorlogicalObj> metObjVec; > > //... fill vector > > metObjVec.sort( sortOnValue() ); // this does not work, what is > missing??? metObjVec.sort( sortOnPoint() ); // this does not work, > what is missing??? > > I can see that I probably need the indect_fun but I do not know how to > wrap my sorting function to pass them to the sorting function > > > > Thank you for your assistance! > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users hi sebastien, try the following changes... 1) make the sort function static class meteorlogicalObj { ... static bool sortOnValue(const meteorlogicalObj&, const meteorlogicalObj&); ... }; 2) call sort like this metObjVec.sort(&meteorlogicalObj::sortOnValue); HTH dave

1 0

Re: [Boost-users] how to use shared_ptr to wrap std::vector and returnfrom function?
by Sohail Somani 21 Mar '06

21 Mar '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > kdsfinger(a)gmail.com > Sent: Monday, March 20, 2006 9:59 AM > To: Boost-users(a)lists.boost.org > Subject: [Boost-users] how to use shared_ptr to wrap > std::vector and returnfrom function? > > hi, Boost users > > Suppose I created a large data in a function and want to > return it back to where the function was called. I want to > return the pointer so that the deep copy of the large data is > not needed and memory leak is nicely handled. Can someone let > me know how to do it? This is what auto_ptr is for, shared_ptr is overkill as far as I can tell: #include <iostream> #include <memory> #include <vector> typedef std::auto_ptr<std::vector<double> > avd; avd getV() { avd a(new std::vector<double>); a->reserve(2); a->push_back(1.0); a->push_back(2.0); return a; } int main() { const avd a = getV(); std::vector<double> & ref = *a; std::cout << ref[0] << " " << ref[1] << std::endl; ref[0]=5; std::cout << ref[0] << " " << ref[1] << std::endl; }

2 1

[regex] Working with wchar_t on older UNIX platforms
by Andrei Tarassov 21 Mar '06

21 Mar '06

Hi! I am experiencing a problem with integrating boost::regex into one of software projects. The problem is that the project supports a number of old operating systems (such as AIX 4.3.3 and HP-UX 11.00), where full support for functions working with wide characters (wchar_t) does not exist. This causes GCC to be compiled without wstring support. On the other hand, we do use wchar_t to the extent allowed by these operating systems and find the limited support more or less enough. Now I tried to integrate wregex in the software, but it just would not compile complaining about missing wstring (and defined BOOST_NO_WREGEX). I tried to make up my own regex character traits class, but this does not seem to help, because some other classes/types (such as sub_match) make use of basic_string<charT>. Is there any way to bypass the problem? I could be using the plain-char version of regex, but that causes me problems with determining the position of a match in the original wide-character string (conversion from wchar_t to char could involve some multibyte encoding). Thanks, -- ANDREI TARASSOV Software Engineer III Altiris OÜ T > +372 6507154 M > +372 53403298 www.altiris.com Security. Compliance. Patch management. IT service management. Altiris solves your most pressing IT issues. www.altiris.com

2 1

Boost.regex examples using boost::mapfile::iterator and std::string::const_iterator
by John Grabner 21 Mar '06

21 Mar '06

I used the regex library from version 1.28.0 with BCB6. I was able to have a single function CommentsStrings::MatchFound(boost::match_result<std::string::const_iterator> what); to process both a std::string and a boost::mapfile. The calling functions are: //--------------------------------------------------------------------------- void CommentsStrings::Analyse(const std::string& Buffer) { Buffer_ = Buffer; AllCommentsStrings_.clear(); // find comments and strings std::string::const_iterator start, end; start = Buffer_.begin(); end = Buffer_.end(); boost::regex_grep( std::bind1st(std::mem_fun(&CommentsStrings::MatchFound), this), start, end, CommentStringExpression); } //--------------------------------------------------------------------------- void CommentsStrings::Analyse(const char *file) { currentFile = file; AllCommentsStrings_.clear(); // find comments and strings boost::mapfile f(currentFile.c_str()); boost::mapfile::iterator start, end; start = f.begin(); end = f.end(); boost::regex_grep( std::bind1st(std::mem_fun(&CommentsStrings::MatchFound), this), start, end, CommentStringExpression); } Now I am using BDS2006 and boost 1_33_1 I am getting an error Could not find a match for 'std::bind1st<std::mem_fun_t<bool,CommentsStrings,smatch> >::operator ()(cmatch)'. I know that the iterator for std::string is a class and not a char pointer. I am at a loss as how to proceed. John.

2 1

boost/thread/once.hpp - problem with boost::call_once() on MSVC++ on AMD64
by Bill Somerville 21 Mar '06

21 Mar '06

Hi I'm having trouble linking a program that uses boost::call_once() on a Windows AMD64 machine. I get a link error saying _InterlockedCompareExchange() is undefined - this should be an intrinsic function on this platform but I think the code in thread/src/once.cpp where the address is taken of the intrinsic function has fooled the development system. It works OK on IA64 were the function is also intrinsic. We are building statically so it's possible that we are not passing some compiler switch that fixes this - but I don't see it. Has anyone else hit this problem with 64-bit AMD64 code and boost::call_once() on Windows? Compiler version is: Microsoft (R) C/C++ Optimizing Compiler Version 14.00.40121 for AMD64 Bill Somerville

1 1

2D multiindex container or simply vector<vector<T> > ?
by Sliwa, Przemyslaw (London) 21 Mar '06

21 Mar '06

What is better? What is the added value by using 2D multi index container vs. vector<vector<T> >? Can anyone explain me the difference quickly? Thanks for help 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

Thank you !! - Joaquin & all
by Aashit Soni 21 Mar '06

21 Mar '06

Hi Joaquin, If you remember i had few questions sometime back on multi-index-container. You helped me figure it out. Last week i was able to squeeze 70%- 80% more performance with the new implementation of my storage classes, with the help of hash_index and ordered_index. This is tremendous result and i owe it to you. !!! Thank you very much for such wonderful data-structure. I appreciate all your help, that you have extended. This is first performance result, which is like a tip of an iceberg. I have still more rounds of scenerios to test upon. But this kind of results is really encouraging and i am sure now i will able to take it up forward. I am worried with the licensing issues and support provided for the boost library. If anyone can point me out in that direction. Once again thanks to Joagin and all on the list. regards, aashit

5 5

Re: [Boost-users] enable_shared_from_this - or an alternative..
by Nat Goodspeed 21 Mar '06

21 Mar '06

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of James Hughes > Sent: Monday, March 20, 2006 11:29 AM > To: 'boost-users(a)lists.boost.org' > Subject: Re: [Boost-users] enable_shared_from_this - or an alternative.. > > > >I have a couple of classes that I want to self register > > themselves with a > > >monitoring class. To do this they must pass a shared_ptr of > > themselves to > > >the monitor register function. > > > > > >Therefore I need to make a shared_ptr form the this pointer, in the > > >constructor. [Nat] We have a similar need: the base class registers in a central registry; we have many subclasses of the base class. We use dumb base* pointers for this purpose. We can get away with that because, just as the base-class constructor registers each instance, so the base-class virtual destructor unregisters the instance. Indeed, for our purposes, we don't WANT smart pointers in the registry. If the last smart-pointer reference to a heap object goes away, we don't want the reference in the registry to make the instance immortal. In that case, the smart pointer to the heap object decrements the count to 0, the object is destroyed, and its destructor unregisters the instance. A side benefit is that we don't have to care whether the instance is static, auto or heap. Nor do we need factory functions.

2 1

Support for Thread lib on MinGW?
by Matt England 20 Mar '06

20 Mar '06

Will Boost ever support the Thread library for mingw? As per http://boost.org/more/getting_started.html#auto-link : " <libthread>: For technical reasons static linking is supported on only one Windows compiler (Visual C++). " -Matt

1 1

System call to get current process memory usage?
by Matt England 20 Mar '06

20 Mar '06

What if any system calls exist to get the current process' system memory usage (including all of the current process' threads)? I'm trying to write unit tests to make sure that my memory allocation processes (for Boost "smart pointers) are actually deallocating correctly after thousands of dynamic allocations...and my presumption is that a process-memory "self check" thoughout this process will be very useful for my self-running unit test. I'd prefer cross-platform calls (be it POSIX, unix/linux, Boost C++, etc...preferably not win32-specific if I can avoid it, but if I must I will) if I can get them, but I'll take a system specific all (for my testing prototype) if I must. Thanks for any help, -Matt

1 1

how to use shared_ptr to wrap std::vector and return from function?
by kdsfinger＠gmail.com 20 Mar '06

20 Mar '06

hi, Boost users Suppose I created a large data in a function and want to return it back to where the function was called. I want to return the pointer so that the deep copy of the large data is not needed and memory leak is nicely handled. Can someone let me know how to do it? Here is something come up in my mind: boost::shared_ptr< std::vector<int> > getV(){ boost::shared_ptr< std::vector<int> > v; v->push_back(1); v->push_back(2); // bla bla bla return v; } int main(){ boost::shared_ptr< std::vector<int> > v = getV(); std::cout << v->at(0); return 0; } I got the following message when run the program: /usr/include/boost/shared_ptr.hpp:253: T* boost::shared_ptr<T>::operator->() const [with T = std::vector<int, std::allocator<int> >]: Assertion `px != 0' failed. Aborted How can I get it correct? Is there any deep copy when the getV() return the shared_ptr? Thanks a lot. zl2k

2 1

Re: [Boost-users] enable_shared_from_this - or an alternative..
by James Hughes 20 Mar '06

20 Mar '06

> -----Original Message----- > From: Alan M. Carroll [mailto:amc@network-geographics.com] > Sent: 20 March 2006 13:44 > To: boost-users(a)lists.boost.org > Cc: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] enable_shared_from_this - or an > alternative.. > > > At 04:13 AM 3/20/2006, James Hughes wrote: > >Hello All, > > > >I have a couple of classes that I want to self register > themselves with a > >monitoring class. To do this they must pass a shared_ptr of > themselves to > >the monitor register function. > > > >Therefore I need to make a shared_ptr form the this pointer, in the > >constructor. > > Why not use intrusive_ptr? Way back when, I wrote my own > equivalent of that instead of using Boost.shared_ptr partly > for this very reason (i.e., having to use smart pointers in > constructors). > Ah, just read my Boost book on intrusive pointers and I think they would work. Not sure I will use for current issues, as have now written code for a factory mechanism (which appears to work!), but certainly worth knowing for the future. Thanks Rgds James

1 0

Unicode support
by Calderon Hector 20 Mar '06

20 Mar '06

Is there any rationale for not supporting Unicode in some boost libraries (e.g. filesystem, program_options)? ++Hector C. ---------------------------------- --------------------------------- Yahoo! Mail Use Photomail to share photos without annoying attachments.

3 5

Re: [Boost-users] enable_shared_from_this - or an alternative..
by James Hughes 20 Mar '06

20 Mar '06

> > > >> > > _______________________________________________ > > Boost-users mailing list > > Boost-users(a)lists.boost.org > > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > > is the following snipped what you have in mind? > > struct base {}; > struct derived1 : public base {}; > struct derived2 : public derived1 {}; > > typedef boost::shared_ptr<base> base_ptr; > > struct monitor > { > void > add( const base_ptr & _ptr) > { > // ... > } > }; > > struct factory > { > factory( monitor & _monitor ) : > monitor_(_monitor) > { > } > > template<typename T> > boost::shared_ptr<T> > create( void ) > { > boost::shared_ptr<T> tmp(new T); > monitor_.add(tmp); > return tmp; > } > > private: > monitor & monitor_; > }; > > void > foo( void ) > { > monitor m; > factory f(m); > f.create<derived1>(); > f.create<derived2>(); > } > > -- dave > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > Hi Dave, Yes, I think that pretty much does exactly what I require. And gives me a (almost comnpletely) generic factory class to boot! Thanks very much! James

1 0

bjam and Intel 8 on windows
by Andreas Fabri 20 Mar '06

20 Mar '06

Hello, I just tried to install boost for the Intel 8 Compiler. bjam.exe "-sTOOLS=intel-win32" install failed updating 948 targets... skipped 412 targets... updated 3323 targets... Didn't I choose the right toolset? If I only want to create program_options, is this the right command: bjam.exe "-sTOOLS=intel-win32 --with-program_options" install thanks in advance, andreas

1 0

Re: [Boost-users] enable_shared_from_this - or an alternative..
by Alan M. Carroll 20 Mar '06

20 Mar '06

At 04:13 AM 3/20/2006, James Hughes wrote: >Hello All, > >I have a couple of classes that I want to self register themselves with a >monitoring class. To do this they must pass a shared_ptr of themselves to >the monitor register function. > >Therefore I need to make a shared_ptr form the this pointer, in the >constructor. Why not use intrusive_ptr? Way back when, I wrote my own equivalent of that instead of using Boost.shared_ptr partly for this very reason (i.e., having to use smart pointers in constructors).

1 0

Re: [Boost-users] enable_shared_from_this - or an alternative..
by David Klein 20 Mar '06

20 Mar '06

boost-users-bounces(a)lists.boost.org wrote: >> -----Original Message----- >> From: David Klein [mailto:d.klein@ascaron.com] >> Sent: 20 March 2006 10:27 >> To: boost-users(a)lists.boost.org >> Subject: Re: [Boost-users] enable_shared_from_this - or an >> alternative.. >>> [snip] > > Thanks Dave, that does cover the problem well. > > However, I cannot use the null deleter mechanism suggested as the > shared_ptr is passed on to monitor and is used there. The second > scheme, using a factory fucntion, would seem to be approriate, > however, how to I handle creation when the CSource1 class is actually > to be used as a base class? If the factory function is in CSource1, > it doesnt know about any derived classes. I don't want to have to > write factory functions in every dervied class - that seems a waste. > Is there a correct technique for getting around this issue? I am > assuming a template of some description, but now sure what that > entails. > > > > > James > >> > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users is the following snipped what you have in mind? struct base {}; struct derived1 : public base {}; struct derived2 : public derived1 {}; typedef boost::shared_ptr<base> base_ptr; struct monitor { void add( const base_ptr & _ptr) { // ... } }; struct factory { factory( monitor & _monitor ) : monitor_(_monitor) { } template<typename T> boost::shared_ptr<T> create( void ) { boost::shared_ptr<T> tmp(new T); monitor_.add(tmp); return tmp; } private: monitor & monitor_; }; void foo( void ) { monitor m; factory f(m); f.create<derived1>(); f.create<derived2>(); } -- dave

1 0

Re: [Boost-users] enable_shared_from_this - or an alternative..
by James Hughes 20 Mar '06

20 Mar '06

> -----Original Message----- > From: David Klein [mailto:d.klein@ascaron.com] > Sent: 20 March 2006 10:27 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] enable_shared_from_this - or an > alternative.. > > > boost-users-bounces(a)lists.boost.org wrote: > > Hello All, > > > > I have a couple of classes that I want to self register themselves > > with a monitoring class. To do this they must pass a shared_ptr of > > themselves to the monitor register function. > > > > Therefore I need to make a shared_ptr form the this pointer, in the > > constructor. > > > > I have derived my classes from > enabled_shared_from_this...(code to get > > monitor omitted) > > > > //psuedo code.. > > monitor::AddSource1(boost::shared_ptr<CSource1>); > > monitor::AddSource2(boost::shared_ptr<CSource2>); > > > > class CSource1 : public enable_shared_from_this<CSource1> > > { > > CSource1() { Monitor->AddSource(shared_from_this()); }; > > } > > > > and > > > > class CSource2 : public base1, public > > enable_shared_from_this<CSource2> { > > CSource2() { Monitor->AddSource(shared_from_this()); };} > > } > > > > > > This all compile fine, but when run, the shared_from_this call > > asserts with a bad weak ptr - at the time of calling the > weak_ptr has > > no content, and looking at the boost code, I cannot see where it is > > supposed to get set to access the this value. > > > > Should I be using enable_shared_from_this in this way or is there a > > better way to convert the this ptr to a shared_ptr in a constructor > > that I need to use. > > > > > > James > > _______________________________________________ > > Boost-users mailing list > > Boost-users(a)lists.boost.org > > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > hi james, > > see: http://boost.org/libs/smart_ptr/sp_techniques.html#in_constructor > > HTH dave > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users Thanks Dave, that does cover the problem well. However, I cannot use the null deleter mechanism suggested as the shared_ptr is passed on to monitor and is used there. The second scheme, using a factory fucntion, would seem to be approriate, however, how to I handle creation when the CSource1 class is actually to be used as a base class? If the factory function is in CSource1, it doesnt know about any derived classes. I don't want to have to write factory functions in every dervied class - that seems a waste. Is there a correct technique for getting around this issue? I am assuming a template of some description, but now sure what that entails. James >

1 0

enable_shared_from_this - or an alternative..
by James Hughes 20 Mar '06

20 Mar '06

Hello All, I have a couple of classes that I want to self register themselves with a monitoring class. To do this they must pass a shared_ptr of themselves to the monitor register function. Therefore I need to make a shared_ptr form the this pointer, in the constructor. I have derived my classes from enabled_shared_from_this...(code to get monitor omitted) //psuedo code.. monitor::AddSource1(boost::shared_ptr<CSource1>); monitor::AddSource2(boost::shared_ptr<CSource2>); class CSource1 : public enable_shared_from_this<CSource1> { CSource1() { Monitor->AddSource(shared_from_this()); }; } and class CSource2 : public base1, public enable_shared_from_this<CSource2> { CSource2() { Monitor->AddSource(shared_from_this()); };} } This all compile fine, but when run, the shared_from_this call asserts with a bad weak ptr - at the time of calling the weak_ptr has no content, and looking at the boost code, I cannot see where it is supposed to get set to access the this value. Should I be using enable_shared_from_this in this way or is there a better way to convert the this ptr to a shared_ptr in a constructor that I need to use. James

2 1

Re: [Boost-users] enable_shared_from_this - or an alternative..
by David Klein 20 Mar '06

20 Mar '06

boost-users-bounces(a)lists.boost.org wrote: > Hello All, > > I have a couple of classes that I want to self register themselves > with a monitoring class. To do this they must pass a shared_ptr of > themselves to the monitor register function. > > Therefore I need to make a shared_ptr form the this pointer, in the > constructor. > > I have derived my classes from enabled_shared_from_this...(code to get > monitor omitted) > > //psuedo code.. > monitor::AddSource1(boost::shared_ptr<CSource1>); > monitor::AddSource2(boost::shared_ptr<CSource2>); > > class CSource1 : public enable_shared_from_this<CSource1> > { > CSource1() { Monitor->AddSource(shared_from_this()); }; > } > > and > > class CSource2 : public base1, public > enable_shared_from_this<CSource2> { > CSource2() { Monitor->AddSource(shared_from_this()); };} > } > > > This all compile fine, but when run, the shared_from_this call > asserts with a bad weak ptr - at the time of calling the weak_ptr has > no content, and looking at the boost code, I cannot see where it is > supposed to get set to access the this value. > > Should I be using enable_shared_from_this in this way or is there a > better way to convert the this ptr to a shared_ptr in a constructor > that I need to use. > > > James > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users hi james, see: http://boost.org/libs/smart_ptr/sp_techniques.html#in_constructor HTH dave

1 0

newbie question: how to make boost helloworld in linux
by kdsfinger＠gmail.com 20 Mar '06

20 Mar '06

hi, boost users Can someone tell me how to build boost helloworld.cpp in linux using g++? I have boost installed via yum in my fc3 box. Here is my code. //test.cpp #include <boost/shared_ptr.hpp> #include <iostream> int main(){ std::cout<<"helloworld"; return 0; } g++ test.cpp //can't find boost. Thanks in advance. zl2k

1 0

MPL to get rid of cumbersome switch
by John Christopher 19 Mar '06

19 Mar '06

Hi; The program belows compiles and works but I'd like to simplify it, maybe using MPL. I spent some fascinating time educating myself on MPL, reading C++ Template Metaprogramming, but I am still at sea... to say the least. Basically the Functor contains a switch statement that is not convenient especially as the number of T classes will increase dramatically. Many thanks for any help on that JCR #include <iostream> #include <vector> #include <boost/mpl/vector.hpp> struct Tbase { Tbase() { std::cout << "Tbase" << std::endl; } }; struct T0 : public Tbase { T0() { std::cout << "T0" << std::endl; } }; struct T1 : public Tbase { T1() { std::cout << "T1" << std::endl; } }; typedef boost::mpl::vector<T0, T1> s; std::vector<Tbase*> vec; struct Functor { void operator()(const int& i) { switch(i) { case 0: vec.push_back(new T0); break; case 1: vec.push_back(new T1); break; } // I'd like to simplify the above swtich statement by writing something like: vec.push_back(new boost::mpl::at<s,i>::type); // but it does not compile and MinGW returns: // error: i cannot appear in a constant expression // error: template argument 2 is invalid. } }; int main (int argc, char ** argv) { std::vector<int> runtimeVec; runtimeVec.push_back(0); runtimeVec.push_back(1); runtimeVec.push_back(0); std::for_each(runtimeVec.begin(), runtimeVec.end(), Functor()); std::cout << vec.size() << std::endl; return 0; }

5 9

Regex Bug in 1.33.1
by Olaf Bachmann 19 Mar '06

19 Mar '06

Hi, there seems to be a bug in version 1.33.1 of boost::regex: boost::regex_replace(std::string("foo"), boost::regex(".*"), "bar") returns "barbar" whereas 1.31.0 returns just "bar" (as I would expect). Any fix or hints out there? Thanks, Olaf

2 1

Help with intrusive_ptr
by Thomas Laguzzi 17 Mar '06

17 Mar '06

Hello, I use intrusive_ptr with a class that holds the refcount and I derive from that class all my other classes. class TObject { public : int refcount ; TObject () { refcount = 0;} } I have defined the intrusive_..._addref and _release to increase and decrease/delete that refcount and everything works good! Anywhay sometimes I need to assign a derived object to another derived object of the same type instrusive_ptr <Derived> A = new Derived; . . . the problem: *A = *Derived(constr parameters). The point is that the refcount is assigned too (and becames 0) How are instrusive_addref and _release supposed to be implemented ? Any quick and clean solution for that ? I cannot write assignment operator for every derived class because... there are a lot of members :) Really thanks! Thomas

2 1

Re: [Boost-users] [Variant]Pointers to using pointers
by Alan M. Carroll 17 Mar '06

17 Mar '06

1 0

Unknown toolset: gcc-stlport
by Phlip 17 Mar '06

17 Mar '06

Boosties: We have a cross-platform solution using GNU g++ and VC7. Both sides use STLport. The documentation says to bond Boost (1.33.1) with STLport with this incantation: ./configure --with-toolset=gcc-stlport It emits: ### Unknown toolset: gcc-stlport ### ### Known toolsets are: acc, borland, cc, como, darwin, gcc, gcc-nocygwin, intel -linux, intel-win32, kcc, kylix, metrowerks, mingw, mipspro, msvc, qcc, sunpro, tru64cxx, vacpp, vc7, vmsdecc with no -stlport anywhere. When we try to wing it with just toolset=gcc, we get error messages. Googling for these reveals others got them too when they did not use the STLport toolset. I have heard that STLport now has an option to bond to Boost. Is that why Boost dropped an option to bond to STLport? If so, why did the same version of Boost like --with-toolset=vc-7_1-stlport? -- Phlip http://www.greencheese.org/ZeekLand <-- NOT a blog!!

1 0

[Variant]Pointers to using pointers
by Conway Allen 17 Mar '06

17 Mar '06

The following, I suppose, produces a memory leak... is there any way to avoid this? Don't use variant with pointers... ? variant<T1*,T2*> vt; vt = new T1; vt = new T2; Thanks, Allen.

1 0

[unit-test] Can'f find boost::unit_test::register_exception_translator
by Gustavo Ribeiro Alves 17 Mar '06

17 Mar '06

I'm trying to register some user exceptions on the unit_test framework so I did the following: #include <boost/test/unit_test.hpp> using boost::unit_test::register_exception_translator; . . . void translate_InvalidInterval(const Interval::InvalidInterval& e) { } void translate_NotIntercept(const Interval::NotIntercept& e) { } interval_test_suite::interval_test_suite() : test_suite ("interval_test_suite") { boost::unit_test::register_exception_translator<Interval::InvalidInterval> (translate_InvalidInterval); boost::unit_test::register_exception_translator< Interval::NotIntercept> (translate_NotIntercept); . . . } I get the following compile error: error: 'boost::unit_test::register_exception_translator' has not been declared I tried to grep all .hpp files on /boost/test to find if some of them have this function. The only one (execution_monitor.hpp) I found has it as part of a class. I was expecting it as a template function in the framework. So, how what do I have to include to make this work?

2 1

signals disconnect based on equivalent slots
by James Burgess 17 Mar '06

17 Mar '06

This works on gcc3.3 and gcc4.0 (OSX) but doesn't compile on vc8.0 I'm wondering whether it should and I've just messed up somewhere installing boost 1.33 or vc8 (VS 2005). I noted that the regression test does not perform this form of disconnect, is that the manual telling me this isn't supported? I get a very similar error if I try a functor (using bind) rather than example below ~ "can't convert to 'const int'". There's some comments in signal_template.hpp that indicate vc 6.0 and 7.0 have problems with this, maybe that #ifdef needs to include vc8? cheers, - James. #include <iostream> #include <boost/signals.hpp> void rfun() { std::cerr << "Hello World\n"; } int _tmain(int argc, char* argv[]) { boost::signal<void()> sig; sig.connect(&rfun); sig.disconnect(&rfun); return 0; } 1>------ Build started: Project: testsignals, Configuration: Debug Win32 ------ 1>Compiling... 1>testsignals.cpp 1>i:\testsignals\testsignals.cpp(19) : error C2664: 'boost::signal0<R,Combiner,Group,GroupCompare,SlotFunction>::disconnect' : cannot convert parameter 1 from 'void (__cdecl *)(void)' to 'const int &' 1> with 1> [ 1> R=void, 1> Combiner=boost::last_value<void>, 1> Group=int, 1> GroupCompare=std::less<int>, 1> SlotFunction=boost::function<void (void)> 1> ] 1> Reason: cannot convert from 'void (__cdecl *)(void)' to 'const int' 1> There is no context in which this conversion is possible

2 1

[optional] mixed (optional<T>, T)-operator== missing by design?
by Marc Mutz 17 Mar '06

17 Mar '06

Hi, In 1.33.1, comparing an optional<T> to it's T fails, since although T implicitly converts to optional<T>, op== being templated, implicit conversions are not considered. Is this by design? If so, what's the rationale for this? I repeatedly find myself in the need to compare an optional<T> member to a passed in T, e.g. in a setT( const T & ), in order to check for a no-op operation and suppress notifications in this case, e.g.: class Foo { boost::optional<T> mT; boost::signal< void(const optional<T>&) > tChangedSignal; void setT( const T & t ) { if ( t == mT ) return; mT = t; tChangedSignal( mT ); // mark cached values dirty, etc, etc... } }; -- Marc Mutz -- marc(a)klaralvdalens-datakonsult.se, mutz(a)kde.org Klarälvdalens Datakonsult AB, Platform-independent software solutions

2 2

Re: [Boost-users] Are Boost.Multi_Index and Boost.Format Planned for64-bitPortability?
by Wu Yinghui, Freddie 17 Mar '06

17 Mar '06

> Hello Freddie, > > As for Boost.MultiIndex, I can confirm the lib does work in 64-bit > environments (for instance, Linux PPC64, Tru64) and must also work > for Win64, although I've never had actual reports about this latter > platform (if you've got access to Win64, you might want to try and > tell back.) With respect to /Wp64 warnings, they are of two > kinds: > > * C4312/C4311, conversions between differently sized types: this > is a case of /Wp64 being too dumb in its analysis of the type > boost::multi_index::detail::uintptr_type; this type is defined with > some metaprogramming machinery to be some integral type > with the same size as void*. So, it is unsigned int in Win32 and > unsigned long long in Win64. But /Wp64 sees it defined as > unsigned int, hence the warning. It is as if you had: > > #ifdef _WIN64 > typedef unsigned int integral_type; > #else > typedef unsigned long long integral_type; > #endif > void *p; > integral_type x=(integral_type)p; > > /Wp64 is not able to see that integral_type will be > defined as unsigned long long in Win64, and emits a C4311. Thanks for your helpful explanation. Since this types of warnings flood the compiler output, which very difficult for us to notice other more valuable warnings. Guess we'll need to figure out some way to "hide" the stupid compiler behaviour? > * Complains about some internal node classes not being > constructable or about their automatic default constructors > being impossible to generate. I don't see what this has to do > with 64-bit portability; in any case, the compiler is right about > the analysis, but not about the consequences: these classes > are in effect never default constructed, their lifetime being > managed through an allocator interface. This is just an > overzealous warning. Hmm... In this case, I guess I'd just try to add some default constructors for these classes without implementing them. That way, I can at least get away with this type of warnings. > So, Boost.MultiIndex must work in Win64, the best way to > check this out is to actually try. I do not have the 64-bit machine with me yet. But I'll report back later once I actually have the chance to try it out. > As for Boost.Format, I cannot say cause I'm not the maintainer, > but in any case it seems to work on other 64-bit environments > as per the regression tests, and potential 64-bit problems > should be easy to tackle. Thanks for your insights! > Joaqu?n M L?pez Mu?oz > Telef?nica, Investigaci?n y Desarrollo > 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

[iostreams] - device ready for non-blocking operations?
by Oliver.Kowalke＠infineon.com 17 Mar '06

17 Mar '06

Hello, is a device, which read and write member-functions could be non-blocking, per default ready for non-blocking operations - or what do I have to do in order to make it properly working with iostreams? Regards, Oliver

1 0

[serialization] My implementation of serialization of STL iterators.
by Carlo Wood 17 Mar '06

17 Mar '06

I succeeded in writing code that successfully serializes my data structures, which contain a LOT a iterators, and even vectors of iterators. However, the end result turned out to be extremely slow (it takes several minutes), due to some inefficiency in boost::serialization (it should be possible to serialize this in a few seconds). I didn't investigate why boost::serialization becomes so slow, but I suppose it is caused by the fact that as a result of how things are serialized, the structure written to file is several thousands of levels deep (meaning, that in the XML file the indentation of the output is also many thousands of TAB's deep). I'm going to approach my problem of serialization in a different way now - making a copy of the data structure, such that the result can be serialized without needing to serialize iterators. Nevertheless, I don't want to keep my solution for the iterators from others; so below follows a brief overview of what I made. An average serialize() function looks as follows: template<class Archive> void Data::serialize(Archive& ar, unsigned int const) { ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(BaseClass); ar & BOOST_SERIALIZATION_NVP(M_variable); ar & BOOST_SERIALIZATION_ITERATOR_NVP(container, M_iterator); ar & BOOST_SERIALIZATION_ITERATOR_NVP(container, M_vector_of_iterators); } where BOOST_SERIALIZATION_ITERATOR_NVP is my invention ;). 'container' has to be the container that the iterator(s) point at. In the case of a vector of iterators, that is the container that the iterators point at, not the vector. Ie, M_iterator could of type std::set<FooBar>::iterator, then container is the std::set<FooBar> container, and M_vector_of_iterators would be of type std::vector<std::set<FooBar>::iterator>. Both, the container type (std::set<FooBar>) as well as the type of it's elements need to be tracked; hence, the above would need: BOOST_CLASS_TRACKING(FooBar, boost::serialization::track_always); BOOST_CLASS_TRACKING(std::set<FooBar>, boost::serialization::track_always); This would then first serialize the container (if not already done) and then serialize the element that the iterator points to (if not already done). I defined BOOST_SERIALIZATION_ITERATOR_NVP as follows: // This macro generates the name string (from 'name'). #define BOOST_SERIALIZATION_ITERATOR_NVP(container, name) \ serialization_iterator_nvp(container, BOOST_PP_STRINGIZE(name), name) where serialization_iterator_nvp is an heavily overload, inline template function: template<typename Container> inline boost::serialization::nvp<IteratorWrapper<Container, typename Container::iterator> > serialization_iterator_nvp(Container& container, char const* name, typename Container::iterator const& t) { IteratorWrapper<Container, typename Container::iterator> tmp(container, const_cast<typename Container::iterator&>(t)); return boost::serialization::nvp<IteratorWrapper<Container, typename Container::iterator> >(name, tmp); } template<typename Container> inline boost::serialization::nvp<IteratorWrapper<Container, typename Container::const_iterator> > serialization_iterator_nvp(Container& container, char const* name, typename Container::const_iterator const& t) { IteratorWrapper<Container, typename Container::const_iterator> tmp(container, const_cast<typename Container::const_iterator&>(t)); return boost::serialization::nvp<IteratorWrapper<Container, typename Container::const_iterator> >(name, tmp); } // Specialization for std::set, because for that container, the iterator and const_iterator are the same type! template<typename T> inline boost::serialization::nvp<IteratorWrapper<std::set<T>, typename std::set<T>::const_iterator> > serialization_iterator_nvp(std::set<T>& container, char const* name, typename std::set<T>::const_iterator const& t) { IteratorWrapper<std::set<T>, typename std::set<T>::const_iterator> tmp(container, const_cast<typename std::set<T>::const_iterator&>(t)); return boost::serialization::nvp<IteratorWrapper<std::set<T>, typename std::set<T>::const_iterator> >(name, tmp); } And in order for BOOST_SERIALIZATION_ITERATOR_NVP to also deal with vectors of iterators: template<typename Container> inline boost::serialization::nvp<VectorIteratorWrapper<Container, typename Container::iterator> > serialization_iterator_nvp(Container& container, char const* name, std::vector<typename Container::iterator> const& v) { VectorIteratorWrapper<Container, typename Container::iterator> tmp(container, const_cast<std::vector<typename Container::iterator>&>(v)); return boost::serialization::nvp<VectorIteratorWrapper<Container, typename Container::iterator> >(name, tmp); } template<typename Container> inline boost::serialization::nvp<VectorIteratorWrapper<Container, typename Container::const_iterator> > serialization_iterator_nvp(Container& container, char const* name, std::vector<typename Container::const_iterator> const& v) { VectorIteratorWrapper<Container, typename Container::const_iterator> tmp(container, const_cast<std::vector<typename Container::const_iterator>&>(v)); return boost::serialization::nvp<VectorIteratorWrapper<Container, typename Container::const_iterator> >(name, tmp); } // Specialization for std::set, because for that container, the iterator and const_iterator are the same type! template<typename T> inline boost::serialization::nvp<VectorIteratorWrapper<std::set<T>, typename std::set<T>::const_iterator> > serialization_iterator_nvp(std::set<T>& container, char const* name, std::vector<typename std::set<T>::const_iterator> const& v) { VectorIteratorWrapper<std::set<T>, typename std::set<T>::const_iterator> tmp(container, const_cast<std::vector<typename std::set<T>::const_iterator>&>(v)); return boost::serialization::nvp<VectorIteratorWrapper<std::set<T>, typename std::set<T>::const_iterator> >(name, tmp); } This uses two template class wrappers (which are declared before these functions in my file): IteratorWrapper and VectorIteratorWrapper. Their definitions are as follows: // A wrapper for iterators. template<class Container, typename Iterator> class IteratorWrapper { public: IteratorWrapper(Container& container, Iterator& iter) : M_container(container), M_iter(iter) { } private: Container& M_container; // The container. Iterator& M_iter; // The actual iterator. public: template<class Archive> void save(Archive& ar, unsigned int const) const { BOOST_STATIC_ASSERT(boost::serialization::tracking_level<Container>::type::value == boost::serialization::track_always); BOOST_STATIC_ASSERT(boost::serialization::tracking_level<typename Container::value_type>::type::value == boost::serialization::track_always); ar << boost::serialization::make_nvp("container", M_container); bool is_end = M_iter == M_container.end(); ar << boost::serialization::make_nvp("end", is_end); if (!is_end) ar << boost::serialization::make_nvp("element", *M_iter); } template<class Archive> void load(Archive& ar, unsigned int const) { ar >> boost::serialization::make_nvp("container", M_container); bool is_end; ar >> boost::serialization::make_nvp("end", is_end); if (!is_end) { typename Container::value_type* tmp_value; ar >> boost::serialization::make_nvp("element", tmp_value); } else M_iter = M_container.end(); } BOOST_SERIALIZATION_SPLIT_MEMBER() }; // A wrapper for a vector of iterators. template<class Container, typename Iterator> class VectorIteratorWrapper { public: VectorIteratorWrapper(Container& container, std::vector<Iterator>& iter) : M_container(container), M_vec(iter) { } private: Container& M_container; // The container. std::vector<Iterator>& M_vec; // The actual vector of iterators. public: template<class Archive> void save(Archive& ar, unsigned int const) const { BOOST_STATIC_ASSERT(boost::serialization::tracking_level<Container>::type::value == boost::serialization::track_always); BOOST_STATIC_ASSERT(boost::serialization::tracking_level<typename Container::value_type>::type::value == boost::serialization::track_always); int count = M_vec.size(); ar << BOOST_SERIALIZATION_NVP(count); for (typename std::vector<Iterator>::const_iterator iter = M_vec.begin(); iter != M_vec.end(); ++iter) { IteratorWrapper<Container, Iterator> iter_functor(M_container, const_cast<Iterator&>(*iter)); ar << boost::serialization::make_nvp("item", iter_functor); } } template<class Archive> void load(Archive& ar, unsigned int const) { int count; ar >> BOOST_SERIALIZATION_NVP(count); while(count--) { Iterator tmp_iter; IteratorWrapper<Container, Iterator> iter_functor(M_container, tmp_iter); ar >> boost::serialization::make_nvp("item", iter_functor); M_vec.push_back(tmp_iter); } } BOOST_SERIALIZATION_SPLIT_MEMBER() }; In both cases, the assertions make sure you didn't forget the two BOOST_CLASS_TRACKING lines. Have fun with it, Carlo Wood <carlo(a)alinoe.com> PS I didn't test the load() functions, but the resulting archive (I used xml) looked correct, thus, the serialization works.

1 0

Re: [Boost-users] boost::multi_index_container::erase very slow on FreeBSD 6.0
by JOAQUIN LOPEZ MU?Z 16 Mar '06

16 Mar '06

----- Mensaje original ----- De: bert hubert <bert.hubert(a)netherlabs.nl> Fecha: Jueves, Marzo 16, 2006 10:59 pm Asunto: [Boost-users] boost::multi_index_container::erase very slow on FreeBSD 6.0 > Ok, regarding my previous message, I've now boiled down the > problem of > quadratically slower erases to something that does happen on > FreeBSD 6.0 and > doesn't happen on my Linux machines. > > The problem may be due to: > 1) boost::multi_index container (highly unlikely) > 2) g++ allocator > 3) FreeBSD libc, if the g++ allocator relies on it > 4) FreeBSD kernel > > And I don't even know where to start. > Hello Bert, I've just compiled and run your benchmark in Windows (with minor modifications to substitute for Unix-specific timing functions) and the behavior is O(N). I'm sorry I can't be more helpful, the following is a series of steps you can use to gain more insight into the problem: 1) Use a multimap instead of the multi_index_container. Double the number of elements to compensate for the fact that the multi-index container takes more memory per element (as it has two indices.) 2) Undo 1) and try running the 100..5000 loop in reverse order 5000..100. What do you get? If the quadratic behavior shows as we approach n=100 (the opposite of the original benchmark) I would tend to think the issue has to do with memory fragmentation. 3) Try a pool allocator like for instance boost::fast_pool_allocator: http://boost.org/libs/pool/doc/interfaces/pool_alloc.html I hope some of this can shed some light. Joaquín M López Muñoz Telefónica, Investigsción y Desarrollo

2 1

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

16 Mar '06

----- Mensaje original ----- De: Jeff Flinn <TriumphSprint2000(a)hotmail.com> Fecha: Jueves, Marzo 16, 2006 11:09 pm Asunto: Re: [Boost-users] [multi_index] modify_range? > Joaquín Mª López Muñoz wrote: > > So wouldn't the only use of modify_unstable_range be for modifying > keys and > indirect members? So only a single modify_unstable_range calling > .modify_key > would suffice? Just thinking out loud here, until I have access to > the docs. I'm not sure I'm making my point. There are two orthogonal issues to consider here: 1 Whether you are modyfing whole elements (A) or keys (B). 2 Whether the modification is "stable" (1) or not (2). The four combinations are actual possibilities: A1: modify_range A2: modify_unstable_range B1: modify_key_range B2: modify_key_unstable_range where B1 and B2 (which are not given in my previous snippet) are written exactly as A1 and A2, respectively, except that where it read .modify(...) you've got to write .modify_key(...). "Stability" is not dependant on whether you're modifying elements or keys: you can get stable and unstable range modifications both ways. What defines a stable range modification of the form modify[_key]_range(i,first,last,mod) is that, after modifying an element pointed to by iterator it, the resulting repositioning does not lie inside [++it,last), i.e. we're sure we won't visit the element again. You can see in my previous snippets examples of stable and unstable range modifications. > > Thanks for your library and your help. :) > > Jeff You're welcome, thank you for using the Boost.MultiIndex. Joaquín M López Muñoz Telefónica, Inevstigación y Desarrollo _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

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