February 2004 - Boost-users

boost::shared_ptr and stl algorithms
by Bill Eidson 14 Apr '05

14 Apr '05

std::vector< boost::shared_ptr<T> > TVec; I want to write a function object to run std::for_each. to do somework against members of T and accumulate results in functor. My attempts have failed in VC7 with memory errors in my operator() method. struct fo { bool operator()( boost::shared_ptr<T>& t ) { return true; } }; Thanks in advance bille

5 9

Will libraries built on WinNT run on Win98? (MinGW)
by Reed Hedges 31 Mar '05

31 Mar '05

I know that Win98 is not really supported, but is there any chance that libraries (specifically thread and regex) that were build on WinNT using MinGW work on Win98 (in MinGW)? My guess is no, but has anyone tried it? thanks reed

2 1

about license
by Marleny Rafferty 01 Apr '04

01 Apr '04

Hi- I am considering using boost in my applications, but I have a question about the boost license at http://www.boost.org/LICENSE_1_0.txt . It says (edited) "Permission is hereby granted, free of charge, to ... use [and] reproduce ... the Software". It also says that any derivative works must also have the same license grant. If my application uses boost libraries unchanged, is it considered a derivative work? If so, does that mean that if I distribute my compiled software, I must allow free of charge use and distribution? Thanks. -- Marleny

6 10

MultiArray questions
by Dr Mark H Phillips 24 Mar '04

24 Mar '04

Hi, I've recently found out about the existence of MultiArray and I am quite impressed! I was thinking of implementing something similar myself but now hopefully I don't have to! However I have a few questions that I'm hoping someone can answer. Question 1 ---------- In the user documentation there is an example which has some example code: for(index i = 0; i != 3; ++i) for(index j = 0; j != 4; ++j) for(index k = 0; k != 2; ++k) A[i][j][k] = values++; Why can't you change the != into <? Ie, do: for(index i = 0; i < 3; ++i) for(index j = 0; j < 4; ++j) for(index k = 0; k < 2; ++k) A[i][j][k] = values++; or can you? This would be more efficient I should think, and requiring that index types be ordered shouldn't be too onerous should it? Question 2 ---------- If I use the built-in "no-frills" C array type to represent a 2-dimensional array in row-major order, then I would access an element (i, j) by doing: a[ &a[0] + i*n + j ] where a is my m by n array. And if I wish to traverse a, in row-major order, I can do: for (int* ip=&(a[0]); ip<&(a[n*m]); ip+=n) { for (int* ijp=&(ip[0]); ijp<&(ip[n]); ++ijp) { visit(ijp); } } These are a very efficient ways of doing things, but it lacks somewhat in ease-of-generalization and in readbility. This is where the MultiArray library is useful. But do I lose in efficiency by going to MultiArray? Ie, in the simple case where base is 0, stride is 1, and when we traverse in row-major order, is the MultiArray library smart enough to do compile-time optimizations to generate code which is as efficient as the above? I am guessing that this sort of approach is what the Blitz++ library does?? Question 3 ---------- Is it possible to construct a new multi_array/multi_array_ref/const_multi_array_ref from an array_view by doing a deep copy of the view? A view is a nice way of looking at different parts of a MultiArray object in a readable way, but sometimes you might wish to turn this view into a more-efficiently represented object. Is this easy to do in the MultiArray library? Question 4 ---------- Sometimes you might have an object starts off being mostly accessed in row-major order, so you want a representation which works efficiently for this use. But down the track you might wish to change to mostly column-major access. Does MultiArray provide easy ways to transform from one underlying representation to another? Thanks, Mark Phillips.

3 2

Solaris and thread_resource_error
by Peter Jones 23 Mar '04

23 Mar '04

On Feb 1 of this year Baptiste Lepilleur posted a status report for Boost 1.31.0 Release candidate 2 on Solaris and AIX. It was mentioned that "boost.thread is now systematically failing with 'thread resource error'". I am experiencing the same thing on Solaris 8, with GCC 3.3.2 (GNU binutils) and Boost 1.31.0. Has anyone looked into this yet? If not, I am willing to track down what line in Boost.Threads is throwing thread_resource_error(). -- Peter Jones [unix;vi;crypto;c++;4wd] (http://pmade.org) PGP [5137 173E 5BFA 8C63 8982 F035 FDBB 1636 7D69 C63F]

2 3

Has mailing list 'from' address changed?
by Steve Folly 27 Feb '04

27 Feb '04

I'm not catch boost-users digest anymore with my mail rules? Vol 129 issue 3 from lists.boost.org, has a date stamp of 17:01:03. I've received a second copy from www.osl.ie.edu at 17:01:50. Is this a permanent change? -- Regards, Steve.

5 5

Re: Iterator adaptor interoperability
by Kris Braun 27 Feb '04

27 Feb '04

Dave Abrahams wrote: > Your best bet is to write an type generator: > template <class Iterator> > struct simple_iterator > { > typedef boost::transform_iterator< > do_nothing< typename Iterator::value_type > > , Iterator > > type; > }; Thank you for the quick and clear reply! I'm now having a very similar problem with a slightly more complicated example (that builds on the first): template< class Iterator > struct harder_iterator { typedef simple_iterator< Iterator >::type inner_type; typedef boost::indirect_iterator< inner_type > type; static type Create( const Iterator& iter ) { return type( inner_type( iter ) ); } }; This "composite" iterator not only has problems with comparison, but assignment from non-const to const as well. Is there a way to handle this case? Thanks, Kris __________________________________ Do you Yahoo!? Yahoo! Mail SpamGuard - Read only the mail you want. http://antispam.yahoo.com/tools

2 3

building boost 1.31.0
by Greg Silverman 27 Feb '04

27 Feb '04

Hi, I have not been able to build version 1.31.0. I run bjam -sTOOLS=gcc-nocygwin Basically, I get a lot of undefined references from the linker. The linker cannot find "cpp_main", "init_unit_test_suite", and, so on. It seems to be a problem with the testing, regression testing, unit testing, etc. Greg Silverman Northrop Grumman San Jose, CA

1 0

lambda / boost usage questions
by Luis De la Parra 26 Feb '04

26 Feb '04

hello, I don't have much experience with boost, so I'm having problems getting boost lambda to work...hope someone here can point me in the right direction. I have: class Song {public: string artist( ) const { return m_artist } string title( ) const { return m_title } private: string m_artist, m_title; } typedef boost::shared_ptr<Song> pSong; vector<pSong> c; and I am trying to use lambda to find a song in c which matches a certain artist and title...something like iterator it = find_if( c.begin(), c.end(), something ) but I havn't figured out what "something" should look like I've tried find_if(begin(),end(), (_1->artist() == "a1" && _1->title = "t1" ) ); but the compiler -- or I =) -- doesn't seem to know the type of _1 --> error: base operand of `->' has non-pointer type `const boost::lambda::lambda_functor<boost::lambda::placeholder<1> >' If I try it = find_if(begin(),end(), boost::bind(&Song::artist,_1) == "a1" ); it fails because "_1" is ambiguos (defined as lambda/placeholder and boost/arg ) using boost::lambda::bind (and not including the "normal" bind ) gives a bunch cryptic errors... I've tried several other variants with lambda / lambda::bind / boost::bind but I havn't figured it out... can anyone help me out? I'd also like to know what's the difference between boost::bind and boost::lambda::bind ? Also... is there a way to know when a lambda object is going to be constructed?, it's probably just that I don't know much about the BLL, but in cases where you have several nested lambdas and binds, I'm not sure which lambda objects will get constructed. regards, luis

3 4

bug in numeric_cast<unsigned long>, <unsigned char>, and <unsigne d int> in gcc 3.3.2
by King, William D 26 Feb '04

26 Feb '04

Hello, I am seeing a bug that the regression tests miss for numeric_cast<unsigned long> with gcc 3.3.2. Specifically, the following code is throwing an exception: double small_value = 1.25; unsigned long l=0; l = numeric_cast<unsigned long>(small_value); // throws exception! unsinged char c=0; c = numeric_cast<unsigned char>(small_value); // throws exception! I am under the impression that numeric_cast is supposed to accept losses of precision (by truncating the fractional values), and to throw exceptions only if there is a range or sign error. Is this so? This error happens only when I try to cast a value with a non-zero fraction; i.e. 1.25 breaks but 1.0 is fine. It only occurs for unsigned types -- signed int, char, and long appear to work correctly. I have found the same incorrect behavior with gcc 3.3.2 on both solaris and linux. Using sunpro on solaris, the same code runs correctly. The regression tests don't catch this, since they only test numeric_cast with integral values 1 and LONG_MAX. Any ideas? It looks like a compiler problem to me. Davis King william.d.king(a)bankofamerica.com

2 1

Boost.Test and Threads
by p.klotz＠icoserve.com 26 Feb '04

26 Feb '04

Hi After our migration from Boost 1.30.2 to Boost 1.31.0 several multithreaded tests no longer work stable. We tracked it down to the macros BOOST_UT_LOG_BEGIN and BOOST_UT_LOG_END. When one protects this macro calls with a mutex, the tests work stable again. After the investigation we found 'Support for the testing of multithreaded programs.' on the open issues list of Boost.Test. Does this mean that Boost.Test is not thread-safe at all? Do we misuse Boost.Test by calling things like BOOST_CHECK_EQUAL, BOOST_CHECK and BOOST_REQUIRE concurrently from different threads? Any clarification on this topic is welcome. Best regards, Peter.

2 1

newbie doubts in compilation process
by Gustavo Sánchez 26 Feb '04

26 Feb '04

Hi all, I am newbie in Boost libraries, and I'm specially interested in Graph Library (BGL). I'm working with VC++ 6.0 and I have a couple of questions about usign the library under this SDK. Of course I've read the Boost documentation and I know VC++ 6 doesn't pass the regresion test but I'm doubty about the compilation process. Those are the steps I followed: 1.- I did the outlined comands in getting started cd boost_1_31_0 bjam "-sTOOLS=msvc" install As result I obtained in drive C: a boost dir with "include" and "libs" subdirs and boost_date_time-vc6-mt-1_31.dll boost_date_time-vc6-mt-gd-1_31.dll boost_filesystem-vc6-mt-1_31.dll boost_filesystem-vc6-mt-gd-1_31.dll boost_regex-vc6-mt-1_31.dll boost_regex-vc6-mt-gd-1_31.dll boost_signals-vc6-mt-1_31.dll boost_signals-vc6-mt-gd-1_31.dll boost_thread-vc6-mt-gd-1_31.dll and the related .lib files. Why aren't there any .dll file of the others libraries(graph, math, type_traits...)??? 2.- I executed bjam in directory: BOOST_ROOT\libs\graph\test and what I obtained was empty directories like BOOST_ROOT\bin\boost\libs\graph\test\vector_graph_cc.test\msvc\debug just one for every test source. I supose that is due to VC++ 6.0 is not able to compile the BGL, is that the reason??? I get something similar if I executed bjam in directory: BOOST_ROOT\libs\graph\examples 3. I did that ---> A full set of tests and status tables can be run thusly on a Windows system: cd %BOOST_ROOT%\status bjam --dump-tests test >bjam.log 2>&1 start notepad bjam.log (this is just a cut of the full file ilustrating the output related to graph library) boost-test(COMPILE) "property_iter" : "libs\graph\test\property_iter.cpp" boost-test(COMPILE) "copy" : "libs\graph\test\copy.cpp" boost-test(COMPILE) "vector_graph_cc" : "libs\graph\test\vector_graph_cc.cpp" boost-test(RUN) "isomorphism" : "libs\graph\test\isomorphism.cpp" boost-test(RUN) "subgraph" : "libs\graph\test\subgraph.cpp" boost-test(COMPILE) "reverse_graph_cc" : "libs\graph\test\reverse_graph_cc.cpp" boost-test(COMPILE) "graph_concepts" : "libs\graph\test\graph_concepts.cpp" boost-test(RUN) "graph" : "libs\graph\test\graph.cpp" boost-test(COMPILE) "filtered_graph_cc" : "libs\graph\test\filtered_graph_cc.cpp" boost-test(COMPILE) "edge_list_cc" : "libs\graph\test\edge_list_cc.cpp" boost-test(COMPILE) "dijkstra_cc" : "libs\graph\test\dijkstra_cc.cpp" boost-test(COMPILE) "dfs_cc" : "libs\graph\test\dfs_cc.cpp" boost-test(RUN) "dfs" : "libs\graph\test\dfs.cpp" boost-test(COMPILE) "bfs_cc" : "libs\graph\test\bfs_cc.cpp" boost-test(RUN) "bfs" : "libs\graph\test\bfs.cpp" boost-test(COMPILE) "adj_matrix_cc" : "libs\graph\test\adj_matrix_cc.cpp" boost-test(COMPILE) "adj_list_cc" : "libs\graph\test\adj_list_cc.cpp" boost-test(RUN) "transitive_closure_test" : "libs\graph\test\transitive_closure_test.cpp" What is quite surprising to me because it's suposed VC++ can't compile all BGL, http://boost.sourceforge.net/regression-logs/cs-win32.html. Some explanation about this ??? Thanks a lot ...(I continue diving in ) --------------------------------- Antivirus Filtros antispam 6 MB gratis ¿Todavía no tienes un correo inteligente?

2 1

boost::lambda and MinGW on Windows
by Vladimir Suhoy 26 Feb '04

26 Feb '04

I have troubles compiling boost::lambda with MinGW on windows MinGW: 2.0.0-3 (yeah, I know its old) gcc: 3.2 (mingw special 20020817-1) The compiler thinks that types in boost/lambda/construct.hpp in boost::detail::destructor are undefined.. However when I put #include <boost/type_traits/remove_cv.hpp> #include <boost/type_traits/is_pointer.hpp> lines in boost/lambda/construct.hpp - then it works. _________________________________________________________________ Add photos to your messages with MSN 8. Get 2 months FREE*. http://join.msn.com/?page=features/featuredemail

1 0

RE: [Boost-users] newbie doubts in compilation process
by Ben Hutchings 26 Feb '04

26 Feb '04

Gustavo Sánchez <gustsanc(a)yahoo.es> wrote: [snip] 1.- I did the outlined comands in getting started cd boost_1_31_0 bjam "-sTOOLS=msvc" install As result I obtained in drive C: a boost dir with "include" and "libs" subdirs and [snip list of DLLs] and the related .lib files. Why aren't there any .dll file of the others libraries(graph, math, type_traits...)??? All their source code is included in header files as inline functions or function templates. Whatever code you use from them will automatically be compiled into your executable. I can't answer your other questions. Ben.

1 0

RE: [Boost-users] Re: about license
by Ben Hutchings 26 Feb '04

26 Feb '04

Darryl Green <Darryl.Green(a)unitab.com.au> wrote: > Cross posted from boost-users... > > > -----Original Message----- > > From: David Abrahams [mailto:dave@boost-consulting.com] > > Sent: Wednesday, 25 February 2004 11:43 AM > > Marleny Rafferty <marleny(a)rafferty.net> writes: > > > > > Hi- > > > > > > I am considering using boost in my applications, but I have a > > > question about the boost license at > > > http://www.boost.org/LICENSE_1_0.txt . It says (edited) > > > "Permission is hereby granted, free of charge, to ... use [and] > > > reproduce ... the Software". > > > > > > It also says that any derivative works must also have the same > > > license grant. > > > > > > If my application uses boost libraries unchanged, is it > > > considered a derivative work? > > > > Yes. > > Really? The ligitimacy of this stance seems questionable (but ianal > etc). Further I did not see it as being part of the objectives for the > license. Quite the opposite in fact. (Disclaimer: IANAL, and any reputable lawyer would take plenty of time to provide you with considered advice.) My understanding is that executable or object code is a derivative work of all the source code that it is built from. So any executable that uses a library is a derivative work of that library. (There is a question as to whether this applies to header files that only define named constants and structure layouts, but little question that it applies to inline and statically-linked function definitions. The FSF asserts that using dynamically-linked function definitions also creates a derivative work.) Your source code, however, does not become a derivative work of a library that it depends on, unless you copy part or all of the library's source code into it.

1 0

shared_ptr/shared_array Question
by voodoo4 26 Feb '04

26 Feb '04

I downloaded yesterday the boost libraries (mainly for the memory libs) and to tell the truth i'm impressed with pool and smart pointers. Especially the boost smart pointers will save me from months of coding! However i have a question about smart pointers. Let's say i have these objects(the code is just an example): class Slave { Slave(); ~Slave(); }; class Master { Master(); Master(int size); ~Master(); Slave *sl; }; I want "sl" to be an array of Slaves on the free store but the sized will be determined in the constructor. With normal pointers i would write: Master::Master(int val) { sl=new Slave[val]; } Master::~Master() { delete sl; } How can i achieve the same with boost smart pointers? I've read the manual three or four times but i still don't get how to work this out. Does this have something to do with the empty ptr? I believe solution is in front of my eyes but i'm too blind(as usual) to see it...

3 5

Boost regex_replace vc6 ATL LNK1120
by Robert McKinnon 26 Feb '04

26 Feb '04

All, I am trying to incorporate the boost::regex into an ATL project that I am working on. Everything seems to work well until I try to use the regex_replace function. When I compile I get the following error: ===== Creating library Debug/yetan.lib and object Debug/yetan.exp test.obj : error LNK2001: unresolved external symbol "void __cdecl boost::throw_exception(class exception const &)" (?throw_exception@boost@@YAXABVexception@@@Z) Debug/yetan.dll : fatal error LNK1120: 1 unresolved externals Error executing link.exe. ====== I have created Non-ATL projects and everything seems to work fine. Any guidance or suggestions would be appreciated. Thanks, Rob

3 2

disabling the building of debug libraries
by Philipp Thomas 26 Feb '04

26 Feb '04

For a Linux build, I would like to only build the static and shared libraries and omit the debug versions. What's the easiest way to achieve this? Philipp -- Philipp Thomas <pth(a)suse.de> SUSE LINUX AG, Maxfeldstr. 5, D-90409 Nuremberg, Germany

1 0

Re: [Boost-users] shared_ptr/shared_array Question
by cyril.godart＠bnpparibas.com 26 Feb '04

26 Feb '04

Hi, I suggest the following code: class Master { typedef boost::smart_ptr<Slave> slave_ptr_t; typedef boost::smart_ptr<const Slave> slave_cst_ptr_t; typedef std::vector<slave_ptr_t> vec_slaves_t; typedef std::vector<slave_cst_ptr_t> vec_cst_slaves_t;//defining this one is good practice as you'll see later Master(); Master(size_t i) { slaves_.resize(i);// assume slave has an empty ctor defined. } vec_cst_slaves_t slaves() //something like const vec_cst_slaves_t& slaves() const should work { return slaves_; //nice casting that I failed to notice until someone in this list mentioned it to me }; vec_slaves_t slaves_; }; As you rightly guessed, a big advantage of this approach is that the plumbing of copy-assigment dtor and so on reduces drastically. I find it extremely convenient, even though there is a performance hit. Regards, Cyril Godart. Internet goochrules@hotmail.com@lists.boost.org - 25/02/2004 21:09 Please respond to boost-users(a)lists.boost.org Sent by: boost-users-bounces(a)lists.boost.org To: boost-users cc: Subject: Re: [Boost-users] shared_ptr/shared_array Question On Feb 25, 2004, at 12:27 PM, voodoo4 wrote: > I downloaded yesterday the boost libraries (mainly for the memory > libs) and > to tell the truth i'm impressed with pool and smart pointers. > Especially the boost smart pointers will save me from months of coding! > However i have a question about smart pointers. > > Let's say i have these objects(the code is just an example): > > class Slave > { > Slave(); > ~Slave(); > }; > > class Master > { > Master(); > Master(int size); > ~Master(); > > Slave *sl; > }; > > I want "sl" to be an array of Slaves on the free store but the sized > will be > determined in the constructor. > > With normal pointers i would write: > > Master::Master(int val) > { > sl=new Slave[val]; > } > > Master::~Master() > { > delete sl; > } > > > How can i achieve the same with boost smart pointers? I have no idea (see below). > I've read the manual three or four times but i still don't get how to > work > this out. > Does this have something to do with the empty ptr? > I believe solution is in front of my eyes but i'm too blind(as usual) > to see > it... > I don't think you're using the right tool for the job. From what I know, smart pointers should be used when you have one object, here you (potentially) have many. I think what you really want to do here is to use a container class like stl::list or stl::vector to contain your slave objects. If you still want to use smart pointers, I guess you could use a list of smart pointers, but there's really no point for that if your slave class is properly coded (for instance, has a ctor, copy ctor, virtual dtor, and operator=). --MP _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users This message and any attachments (the "message") is intended solely for the addressees and is confidential. If you receive this message in error, please delete it and immediately notify the sender. Any use not in accord with its purpose, any dissemination or disclosure, either whole or partial, is prohibited except formal approval. The internet can not guarantee the integrity of this message. BNP PARIBAS (and its subsidiaries) shall (will) not therefore be liable for the message if modified. --------------------------------------------- Ce message et toutes les pieces jointes (ci-apres le "message") sont etablis a l'intention exclusive de ses destinataires et sont confidentiels. Si vous recevez ce message par erreur, merci de le detruire et d'en avertir immediatement l'expediteur. Toute utilisation de ce message non conforme a sa destination, toute diffusion ou toute publication, totale ou partielle, est interdite, sauf autorisation expresse. L'internet ne permettant pas d'assurer l'integrite de ce message, BNP PARIBAS (et ses filiales) decline(nt) toute responsabilite au titre de ce message, dans l'hypothese ou il aurait ete modifie.

2 1

RE: [Boost-users] Re: about license
by Darryl Green 26 Feb '04

26 Feb '04

Cross posted from boost-users... > -----Original Message----- > From: David Abrahams [mailto:dave@boost-consulting.com] > Sent: Wednesday, 25 February 2004 11:43 AM > Marleny Rafferty <marleny(a)rafferty.net> writes: > > > Hi- > > > > I am considering using boost in my applications, but I have > a question > > about the boost license at > http://www.boost.org/LICENSE_1_0.txt . It > > says (edited) > "Permission is hereby granted, free of charge, to ... > > use [and] reproduce ... the Software". > > > > It also says that any derivative works must also have the > same license > > grant. > > > > If my application uses boost libraries unchanged, is it considered a > > derivative work? > > Yes. Really? The ligitimacy of this stance seems questionable (but ianal etc). Further I did not see it as being part of the objectives for the license. Quite the opposite in fact. > > > If so, does that mean that if I distribute my compiled software, I > > must allow free of charge use and distribution? > > No, the license gives an explicit exemption for compiled code > (emphasis mine): [let me just re-insert some additioanl context here] ! The copyright notices in the Software and this entire statement ! ... ! must be included in all copies of the Software, in whole or in part, and > > all derivative works of the Software, UNLESS SUCH COPIES OR DERIVATIVE > WORKS ARE SOLELY IN THE FORM OF MACHINE-EXECUTABLE OBJECT > CODE GENERATED BY > A SOURCE LANGUAGE PROCESSOR. > I took this to mean that nobody can delete/change the copyright/license in the sources if they copy or produce a derivative work but that there is no need to include the license in a binary distribution. It did not occur to me that leaving the license in place somehow forms a viral attachment to other source in a source distribution. It potentially makes this license incompatible with the intent of other (open and closed) source licenses eg. // some_gpled_source_file.cpp // this file is distributed under the gpl // changed some stuff so we use boost libs #include <some_boost_lib> // oops - now it is some boost/gpl hybrid?????? I thought avoiding this sort of thing was precisely why the boost license was developed. I also thought this interpretation of "derived work" was somewhat contentious anyway. In a commercial context, this interpretation appears to make this license hopeless - anyone obtaining a copy of source code which uses boost (which you appear to be claiming is automatically a derivative work), appears to be free to do what they like with it. It is hardly reasonable that this occur if a company distributes source code with some particular intent/license for its use. That is even without considering the issue of copies obtained without the company/authors permission, whether the copy was obtained accidentally or criminally, and then redistributed. I'm keen to stop people copying my commercial executables, but I'm a lot more keen to stop them running off with the source code! A bit of digging through the archives finds http://aspn.activestate.com/ASPN/Mail/Message/boost/1686928 Which seems to explain why I thought the intent was what I understood it to be. Whatever the conclusion I think this needs to be in the FAQ. Regards Darryl Green. ########################################################################## This e-mail is for the use of the intended recipient(s) only. If you have received this e-mail in error, please notify the sender immediately and then delete it. If you are not the intended recipient, you must not use, disclose or distribute this e-mail without the author's prior permission. We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. ##########################################################################

2 1

Dynamically resize matrix when inserting more elements
by Lars Schouw 25 Feb '04

25 Feb '04

Guys I want to use the boost matrix and found out that I have to know the size of the matrix when I construct it. (except from resizing and loosing my data). Is there any way I can add more information to a matrix and in the samt time resize it on the fly when more memory is needed? Regards Lars Schouw Tokyo --------------------------------- Do you Yahoo!? Get better spam protection with Yahoo! Mail

1 0

RE: [Boost-users] shared_ptr/shared_array Question
by Mark Storer 25 Feb '04

25 Feb '04

I'd go with scoped_array<> by default, and only go with shared_array<> if you need to share OWNERSHIP of that array. This master/slave example doesn't give enough context to make the choice apparent. PS: There's a bug in your original code: > Master::~Master() > { > delete sl; > } If you use the [] version of new, you should use the [] version of delete: Master::~Master() { delete[] sl; } Otherwise, many implementations of 'delete' will only call the destructor of the first element in the array, and may or may not free up the entire block of memory. Some implementations may actually clean everything up properly, but I wouldn't count on it if I were you. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typdef std::disclaimer<Cardiff> Discard;

1 0

Host IP changing Thursday
by Beman Dawes 25 Feb '04

25 Feb '04

The system administrators at Indiana University are planning to change the Boost mailing lists to a new host IP address Thursday. Although the changeover itself will happen very quickly, it will take some time for the DNS change to propagate. Boost's DNS usually specifies 6 hour refreshes and 12 hour "Time to Live". We will cut that to 1 hour each from now until it is clear the change is working well. So you should see no more than a two hour outage. The last time we did something like this it went pretty smoothly, but a few people had trouble with cached copies of the IP address for a few days. Anyhow, be aware that change is coming Thursday, and that mailing list response time will be longer than usual during the changeover. Thanks, --Beman

1 0

Re: [Boost-users] boost::bind placeholders and MSVC .NET 2003 and .pch
by Vladimir Suhoy 25 Feb '04

25 Feb '04

>Could you please remove the " && BOOST_MSVC <= 1300" version check from >line >41 of boost/bind/placeholders.hpp and tell us whether this fixes the >problem? Yes, it does. Everything works right even with .pch turned on. _________________________________________________________________ Tired of spam? Get advanced junk mail protection with MSN 8. http://join.msn.com/?page=features/junkmail

2 1

Re: [Boost-users] Counting matches with Regex V4
by john.wismar＠autozone.com 25 Feb '04

25 Feb '04

Earlier, I wrote: > > <Using VC7.0> > > I'm converting to V4 of Regex, and I thought I might be able to > count regex matches using this snippet: <snip> > boost::sregex_iterator itBegin(first, last, e); > boost::sregex_iterator itEnd; > ptrdiff_t pd = std::distance(itBegin, itEnd); > > I get these errors: > > xutility(312) : error C2665: 'std::_Iter_cat' : none of the 12 overloads > can convert parameter 1 from type 'boost::sregex_iterator' <snip different _Iter_cat overloads taking integral types> > Anyone have any thoughts? Is it a VC7.0 issue? Is there a better or > different way of doing the same thing? I should have mentioned that I'm using boost 1.31.0. After some further research, I found that this DOES appear to be a VC7.0-only problem. It doesn't happen in VC7.1, notably. The problem seems to be with VC7.0's implementation of the standard library. In particular, there's another overload of std::_Iter_cat that takes a std::iterator as a parameter; this overload wasn't considered by the compiler when it generated the error message above. It looks like instead of relying on iterators to define typedefs for iterator_category, value_type, et al., the library assumes that an iterator must actually derive from std::iterator. This assumption has been removed from the library implementation in VC7.1. Given all of this, it seems like my options are to modify my copy of regex_iterator.hpp, modify my copy of <xutility>, or hope that someone has a third option. (Upgrading to vc7.1 is not an option this week. :-) -------------------------------- John Wismar jwismar(a)midsouth.rr.com ------------------------------------------------------------------------ The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

2 2

regex_replace to replace a number?
by mike.duong＠adelphia.net 25 Feb '04

25 Feb '04

Hi, I am a newbie to regex. Can anyone please help? I am trying to replace $number with a number 2 but instead it looks for argument number 12. What is the format or escape sequence format_string variable needs to be? regex e("(\\$number)"); const char* format_string = "(?12)"; regex_replace(out, file_stream.begin(), file_stream.end(), e, format_string, match_default | format_all); Thanks, Mike

2 1

regex_replace to replace a specify string
by mike.duong＠adelphia.net 24 Feb '04

24 Feb '04

Hi, Can someone please help? I would like to replace the match (*) with raw data. Is this possible? regex_replace(out, file_stream.begin(), file_stream.end(), my_regex, "(?12)", match_default | format_all); How can I replace the match with a number 2? I've tried difference combination of escape character before the 2 such as (?1\\d2) but it doesn't seems to work. Thanks, Mike

1 0

boost::bind placeholders and MSVC .NET 2003 and .pch
by Vladimir Suhoy 24 Feb '04

24 Feb '04

I have linker errors using bind placeholders. The problem is when it is used in more than one .cpp file, and precompiled headers are on (as usual - created in stdafx.cpp and used in other modules) the linker says following: error LNK2005: "class boost::arg<1> `anonymous namespace'::_1" (?_1@?A0x51895292@@3V?$arg@$00@boost@@A) already defined in jc.obj When precompiled headers are off, everything works right. _________________________________________________________________ Add photos to your messages with MSN 8. Get 2 months FREE*. http://join.msn.com/?page=features/featuredemail

2 1

Re: [Boost-users] Getting vertices names.
by Maxx Sloyko 24 Feb '04

24 Feb '04

Hi there! Here is my piece of code, where the error raises: void MyGraph::Load( string filename ) { using namespace boost; graph_traits<GraphvizDigraph>::vertex_iterator i; GraphvizDigraph g; read_graphviz(filename, g); graph_property<GraphvizDigraph, graph_name_t>::type& name = get_property( g, graph_name ); Name( name ); boost::property_map<boost::GraphvizDigraph, boost::vertex_attribute_t>::type& va = boost::get(boost::vertex_attribute, g); boost::property_map< GraphvizDigraph, vertex_name_t>::type& vn = get(vertex_name, g); /* First, lets load all needed properties for vertices */ for(i = vertices(g).first; i != vertices(g).second; ++i ) { map<string, string>& m = va[(*i)]; for( std::map<string, string>::const_iterator p_key = m.begin(); p_key != m.end(); ++p_key ) { std::cout<<vn[(*i)]<<endl; /* ^^^^ this is the line where the problem arises. he thing is to make the following line work (first argument is std::string ), but there was an error here and i decided to test like this. */ SetObjAttribute( vn[(*i)], const_cast<std::string&>(p_key->first), const_cast<std::string&>(p_key- >second) ); } } } Jeremy Siek <jsiek(a)osl.iu.edu>: > Hi Maxx, > > From what you've posted, I can't tell what the problem is. > If you post a short but complete program exhibiting the problem > I'll take a look. > > Cheers, > Jeremy > > On Feb 24, 2004, at 8:42 AM, Maxx Sloyko wrote: > > > Hi there! > > > > May be I'm asking something unbeleivably stupid, but anyway here is my > > problem. > > I need to get the names of all vertices in the graph (It is > > GraphvizDigraph), so > > ---------------------------------------------------- > > using namespace boost; > > property_map< GraphvizDigraph, > > vertex_name_t>::type& > > vn = get(vertex_name, g); > > graph_traits<GraphvizDigraph>::vertex_iterator i; > > > > for(i = vertices(g).first; i != vertices(g).second; ++i ) > > { > > std::cout<< vn[*i]<<endl; > > } > > ---------------------------------------------------- > > > > And here is the error I got: > > ---------------------------------------------------- > > c:\Documents and Settings\MAKC\My Documents\Visual Studio > > Projects\Graph\MyGraph.cpp(61) : error C2679: binary '<<' : no operator > > found which takes a right-hand operand of > > type > > 'boost::vec_adj_list_any_vertex_pa::bind_<Tag,Graph,Property>::value > > _type' (or there is no acceptable conversion) > > with > > [ > > Tag=boost::vertex_name_t, > > Graph=boost::detail::subgraph_any_pmap::bind_<boost:: > > vertex_name_t,boost: > > :GraphvizDigraph,boost::detail::vertex_property_map<boost:: > > GraphvizDigrap > > h,boost::vertex_name_t>::Property>::Graph, > > > > Property=boost::detail::vertex_property_map<boost::detail:: > > subgraph_any_p > > map::bind_<boost::vertex_name_t,boost::GraphvizDigraph,boost::detail:: > > ver > > tex_property_map<boost::GraphvizDigraph,boost::vertex_name_t>:: > > Property>: > > :Graph,boost::vertex_name_t>::Property > > ] > > ----------------------------------------------------- > > > > > > Since this code is almost "CopyPasted" from the library example, > > my beleif is that it should work. At what point I have to change my > > worldview? :) > > > > Thanks in advance. > > > > > > ------------------------------------- > > |your sincerely, Maxx, | > > | mailto:maxxua@pisem.net | > > ------------------------------------- > > _______________________________________________ > > Boost-users mailing list > > Boost-users(a)lists.boost.org > > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > > _______________________________________________ > Jeremy Siek <jsiek(a)osl.iu.edu> > http://www.osl.iu.edu/~jsiek > Ph.D. Student, Indiana University Bloomington > C++ Booster (http://www.boost.org) > Office phone: (812) 856-1820 > _______________________________________________ > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > ------------------------------------- |your sincerely, Maxx, | | mailto:maxxua@pisem.net | -------------------------------------

2 1

Getting vertices names.
by Maxx Sloyko 24 Feb '04

24 Feb '04

Hi there! May be I'm asking something unbeleivably stupid, but anyway here is my problem. I need to get the names of all vertices in the graph (It is GraphvizDigraph), so ---------------------------------------------------- using namespace boost; property_map< GraphvizDigraph, vertex_name_t>::type& vn = get(vertex_name, g); graph_traits<GraphvizDigraph>::vertex_iterator i; for(i = vertices(g).first; i != vertices(g).second; ++i ) { std::cout<< vn[*i]<<endl; } ---------------------------------------------------- And here is the error I got: ---------------------------------------------------- c:\Documents and Settings\MAKC\My Documents\Visual Studio Projects\Graph\MyGraph.cpp(61) : error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'boost::vec_adj_list_any_vertex_pa::bind_<Tag,Graph,Property>::value _type' (or there is no acceptable conversion) with [ Tag=boost::vertex_name_t, Graph=boost::detail::subgraph_any_pmap::bind_<boost::vertex_name_t,boost: :GraphvizDigraph,boost::detail::vertex_property_map<boost::GraphvizDigrap h,boost::vertex_name_t>::Property>::Graph, Property=boost::detail::vertex_property_map<boost::detail::subgraph_any_p map::bind_<boost::vertex_name_t,boost::GraphvizDigraph,boost::detail::ver tex_property_map<boost::GraphvizDigraph,boost::vertex_name_t>::Property>: :Graph,boost::vertex_name_t>::Property ] ----------------------------------------------------- Since this code is almost "CopyPasted" from the library example, my beleif is that it should work. At what point I have to change my worldview? :) Thanks in advance. ------------------------------------- |your sincerely, Maxx, | | mailto:maxxua@pisem.net | -------------------------------------

2 1

Streaming boost::optional yields inconsistent output in gcc 3.2.3
by Eelis van der Weegen 24 Feb '04

24 Feb '04

Hi, I defined the following operator to stream optional<char>'s: std::ostream & operator<< (std::ostream & os, boost::optional<char> const & op) { if (op) os << *op; else os << '_'; return os; } Now, when I use: boost::optional<char> a ('a'); std::cout << a; 'a' is printed like I expected. However, when I use: std::ostream_iterator<boost::optional<char> > oi (std::cout); *oi = a; '1' is printed and my operator is apparently ignored (I expected another 'a'). Is this a gcc (3.2.3) issue or a boost issue? And in any case: is there a workaround? Thanks, Eelis

2 2

Re: [Boost-users] Boost Newbie: Boost Libraries notincluded .....Linker Error
by Mohammed Abbas 24 Feb '04

24 Feb '04

Oooops thanks for the thought: Im running gcc on Windows XP Home Edition. -- --------- Original Message --------- DATE: Mon, 23 Feb 2004 07:50:23 From: Darren Cook <darren(a)dcook.org> To: Boost Users mailing list <boost-users(a)lists.boost.org> Cc: >> Could anyone send me a copy of the library files that aer produced... > >You didn't say which platform. > >>>I had built the Boost Libraries and was expecting that the sample > >>simple_ls program to work. Unfortunately as I compiled it I > >>had received a million plus errors due to the Linker Error. > >>.... > >>P.S. The Library folder for Boost is Empty and I includeded the Boost >Include Directory in the gcc path. > >If you post the first 4-5 and last 4-5 lines of errors (and show the full >compiler command you are using) someone may be able to help then. > >Darren > > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users > ____________________________________________________________ Find what you are looking for with the Lycos Yellow Pages http://r.lycos.com/r/yp_emailfooter/http://yellowpages.lycos.com/default.as…

1 0

Iterator adaptor interoperability
by Kris Braun 24 Feb '04

24 Feb '04

Hello, I've spent the day trying to get my iterators working after upgrading to 1.31.0. I'm almost there, but I can't seem to get const and non-const versions to compare with each other. I've tried about everything I can think of, so I'll just post a minimal test that fails in hopes that someone can see my mistake: #include <iostream> #include <list> #include <boost/iterator/transform_iterator.hpp> template< class Type > struct do_nothing { typedef Type result_type; result_type operator( )( const Type& t ) { return t; } }; template< class Iterator > class simple_iterator : public boost::transform_iterator< do_nothing< typename Iterator::value_type >, Iterator > { private: typedef boost::transform_iterator< do_nothing< typename Iterator::value_type >, Iterator > super_t; public: simple_iterator( void ) { } simple_iterator( Iterator iter ) : super_t( iter ) { } template< class Iterator2 > simple_iterator( const simple_iterator< Iterator2 >& iter ) : super_t( iter.base( ) ) { } }; typedef std::list< int > ListType; typedef simple_iterator< ListType::iterator > iterator; typedef simple_iterator< ListType::const_iterator > const_iterator; struct Foo { iterator begin( void ) { return iterator( m.begin( ) ); } const_iterator end( void ) const { return const_iterator( m.end( ) ); } ListType m; }; void foo( void ) { Foo f; for( iterator i = f.begin( ); i != f.end( ); ++i ) { } } which on VC7.1 yield src\util\test.cpp(53) : error C2678: binary '!=' : no operator found which takes a left-hand operand of type 'iterator' (or there is no acceptable conversion) Any help would be much appreciated! Cheers, Kris __________________________________ Do you Yahoo!? Yahoo! Mail SpamGuard - Read only the mail you want. http://antispam.yahoo.com/tools

2 1

Problem building boost 1.31 on True64 Unix
by Wenzel, Hans 23 Feb '04

23 Feb '04

Hi all, I'm trying to build the complete boost 1.31 on a True64 Unix V5.1A machine using the Compaq C++ V6.5-014 compiler. After invoking bjam, the compiler hangs on the last command seen below. What can I do? cxx -ptr "bin/boost/libs/filesystem/build/libboost_filesystem.so/tru64cxx65/r elease"/cxx_repository -noimplicit_include -c -std strict_ansi -nopure_cname -m sg_display_number -msg_disable 186,450,1115 -DNDEBUG -DNDEBUG -DBOOST_FILESYSTE M_DYN_LINK=1 -O2 -inline all -I"bin/boost/libs/filesystem/build" -I"/usr/loc al/boost_1_31_0" -I"/usr/local/boost_1_31_0" -o "bin/boost/libs/filesystem/bui ld/libboost_filesystem.so/tru64cxx65/release/operations_posix_windows.o" "/usr/ local/boost_1_31_0/libs/filesystem/build/../src/operations_posix_windows.cpp " Best regards HansW

1 0

Re: [Boost-users] Boost Newbie: Boost Libraries not included .....Linker Error
by Mohammed Abbas 22 Feb '04

22 Feb '04

Could anyone send me a copy of the library files that aer produced when building the boost libraries. Im not getting anything in my directory and Im already late in my project proposal. Yours MJ --------- Original Message --------- DATE: Fri, 20 Feb 2004 14:03:27 From: "Mohammed Abbas" <mjabbas(a)lycos.com> To: boost-users(a)lists.boost.org Cc: >Hi, > >Im a newbie in C++ just barely getting to grips with the Boost Libraries. I had built the Boost Libraries and was expecting that the sample simple_ls program to work. Unfortunately as I compiled it I had received a million plus errors due to the Linker Error. > >Please tell me whats wrong???????????? > >P.S. The Library folder for Boost is Empty and I includeded the Boost Include Directory in the gcc path. > >Yours, > >MJ > > >____________________________________________________________ >Find what you are looking for with the Lycos Yellow Pages >http://r.lycos.com/r/yp_emailfooter/http://yellowpages.lycos.com/default.as… >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users > ____________________________________________________________ Find what you are looking for with the Lycos Yellow Pages http://r.lycos.com/r/yp_emailfooter/http://yellowpages.lycos.com/default.as…

2 1

tokenizer and wstring with VC7.1
by Douglas G. Hanley 22 Feb '04

22 Feb '04

Has anybody managed to get tokenizer working for wide characters with VC7.1 (boost version 1.31.0)? The following example works fine... typedef tokenizer<char_separator<std::string::value_type>, std::string::const_iterator, std::string> MyTokenizer; const char_separator<std::string::value_type> sep("a"); MyTokenizer token(std::string("abacadaeafag"), sep); for (MyTokenizer::const_iterator it = token.begin(); it != token.end(); ++it) { std::cout << *it; } ...while the following example produces no output... typedef tokenizer<char_separator<std::wstring::value_type>, std::wstring::const_iterator, std::wstring> MyTokenizer; const char_separator<std::wstring::value_type> sep(L"a"); MyTokenizer token(std::wstring(L"abacadaeafag"), sep); for (MyTokenizer::const_iterator it = token.begin(); it != token.end(); ++it) { std::wcout << *it; } Cheers, Douglas.

3 5

Tokenizer Problem
by Thomas Johnson 22 Feb '04

22 Feb '04

Can anyone explain to me why the code below prints: Token: A1B21 Token: A1B Token: : Token: 12 Instead of printing: Token: A1B2 Token: : Token: 12 Token: A1B Token: : Token: 12 Using boost 1.31.0 Thanks! ---Cut here--- #include <boost/tokenizer.hpp> #include <iostream> int main() { boost::char_separator<char> sep("", ":", boost::keep_empty_tokens); boost::tokenizer< boost::char_separator<char> > stringTok(std::string("A1B2:12"),sep); boost::tokenizer< boost::char_separator<char> >::iterator tokIter=stringTok.begin(); while(tokIter!=stringTok.end()) { std::cout << "Token: " << (*tokIter) << "\n"; tokIter++; } boost::tokenizer< boost::char_separator<char> > stringTok2(std::string("A1B:12"),sep); boost::tokenizer< boost::char_separator<char> >::iterator tokIter2=stringTok2.begin(); while(tokIter2!=stringTok2.end()) { std::cout << "Token: " << (*tokIter2) << "\n"; tokIter2++; } } ---Cut Here--- -- Thomas Johnson <thomas(a)unifiedconsulting.com>

2 1

Boost Newbie: Boost Libraries not included ..... Linker Error
by Mohammed Abbas 20 Feb '04

20 Feb '04

Hi, Im a newbie in C++ just barely getting to grips with the Boost Libraries. I had built the Boost Libraries and was expecting that the sample simple_ls program to work. Unfortunately as I compiled it I had received a million plus errors due to the Linker Error. Please tell me whats wrong???????????? P.S. The Library folder for Boost is Empty and I includeded the Boost Include Directory in the gcc path. Yours, MJ ____________________________________________________________ Find what you are looking for with the Lycos Yellow Pages http://r.lycos.com/r/yp_emailfooter/http://yellowpages.lycos.com/default.as…

2 1

Semaphore and barriers for boost-threads?
by Craig Rodrigues 20 Feb '04

20 Feb '04

Hi, I am new to Boost, and like what I see. I hope to be able to use more Boost libraries in the C++ projects that I work on. Would it be a good thing to add semaphore and barrier classes to Boost Threads? For semaphores, having something analogous to the POSIX functions sem_wait() and sem_post() would be nice. For barriers, having something analogous to pthread_barrier_wait() would be nice. It is not very hard to roll your own versions of these primitives using boost::condition and boost::mutex classes, but it would be nice to have them in a library. Any opinions? Thanks. -- Craig Rodrigues http://crodrigues.org rodrigc(a)crodrigues.org

5 12

Counting matches with Regex V4
by john.wismar＠autozone.com 20 Feb '04

20 Feb '04

<Using VC7.0> I'm converting to V4 of Regex, and I thought I might be able to count regex matches using this snippet: boost::regex e; std::string::const_iterator first, last; //Initialize first, last boost::sregex_iterator itBegin(first, last, e) boost::sregex_iterator itEnd; ptrdiff_t pd = std::distance(itBegin, itEnd); I get these errors: xutility(312) : error C2665: 'std::_Iter_cat' : none of the 12 overloads can convert parameter 1 from type 'boost::sregex_iterator' xutility(127): could be 'std::_Int_iterator_tag std:: _Iter_cat(std::_Bool)' xutility(133): or 'std::_Int_iterator_tag std:: _Iter_cat(char)' xutility(139): or 'std::_Int_iterator_tag std:: _Iter_cat(signed char)' xutility(145): or 'std::_Int_iterator_tag std:: _Iter_cat(unsigned char)' xutility(151): or 'std::_Int_iterator_tag std:: _Iter_cat(short)' xutility(157): or 'std::_Int_iterator_tag std:: _Iter_cat(unsigned short)' xutility(163): or 'std::_Int_iterator_tag std:: _Iter_cat(int)' xutility(169): or 'std::_Int_iterator_tag std:: _Iter_cat(unsigned int)' xutility(175): or 'std::_Int_iterator_tag std:: _Iter_cat(long)' xutility(181): or 'std::_Int_iterator_tag std:: _Iter_cat(unsigned long)' xutility(188): or 'std::_Int_iterator_tag std::_Iter_cat (__int64)' xutility(194): or 'std::_Int_iterator_tag std:: _Iter_cat(unsigned __int64)' while trying to match the argument list '(boost::sregex_iterator)' myfile.h(47) : see reference to function template instantiation 'ptrdiff_t std::distance(_InIt,boost::sregex_iterator)' being compiled with [ _InIt=boost::sregex_iterator ] Anyone have any thoughts? Is it a VC7.0 issue? Is there a better or different way of doing the same thing? -------------------------------- John Wismar jwismar(a)midsouth.rr.com ------------------------------------------------------------------------ The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

[Graph] What can I do with null_vertex?
by Douglas Gregor 20 Feb '04

20 Feb '04

There are no semantics for null_vertex. I assume I can copy it, but can I compare it against other vertex descriptors via == and !=? Is it always different from "real" vertex descriptors? Doug

2 1

Determining offset of regex syntax errors
by Keith MacDonald 20 Feb '04

20 Feb '04

Members of class reg_expression know where they are up to while compiling, but don't include that information when they throw. It can be pretty daunting to get the "Invalid regular expression" error message, with no indication of where to start looking, so I'd like to be more helpful. Given the character offset from the start of the RE, I can put the cursor there. Any suggestions as to how to obtain that information? Thanks, Keith MacDonald

2 3

Redirecting the detailed test report
by Hermann Oliveira Rodrigues 19 Feb '04

19 Feb '04

Hi, Recently we have decided to use the Boost Test libraries to provide automated tests to our project. To help with the test result visualization, we created an utility to generate HTML pages from Boost test reports (as generated by -- report_level=detailed). In the begining of implementation, the amount of tests was small and we could just cut-and-paste the test report to a file used as the input of out in-house HTML generator. Now, the amount of tests increased and cutting-and-pasting the report become a pain. So the question: How can we send the test report to a separated file? We used unit_test_log::instance().set_log_stream( stream ) in the definition of test_suite* init_unit_test_suite( int argc, char* argv[] ) to redirect the test log and it worked fine. However, unit_test_result::instance().detailed_report( stream ) can not be used in the same way. We can not simply redirect the test output to a file (using ">") because our application prints lots of information during execution and is pretty hard to change this behaviour. Thanks in advance.

2 2

Overloading New and Delete to track memory in shared_ptr.
by Joshua Little 19 Feb '04

19 Feb '04

Hi again, Well I'm making pretty good progress in learning proper way to use shared_ptr's but I'm still a little nervous about leaking memory, especially if I manage to do something I'm not supposed to do and don't recognize that a memory leak may be occuring. I've used the overloading new/delete before to help track memory leaks and I was wondering if that would be possible with shared_ptrs. I tried my old header files with and saw tons of leaks but I think its because my New that I use logs the creation to a Tracer class but since the Delete happens in the shared_ptr, its not using the overloaded Delete that removes stuff from the tracer when its deleted. I've looked around and found some examples of making a custom deleter to pass into the shared ptr when creating a new shared_ptr which should work but I have some worries about it. I'm not quite sure what the recommended way of doing this would be. About the only thing I can think of would be to have two different deleters which would be conditionally compiled something like this : //Overloaded New to log allocation to a tracer, theres a define to add the file and line number to the new call #ifndef NDEBUG void * operator new (unsigned int size, char const * file, int line) { void * p = new (size); if (Tracer::Ready) NewTrace.Add (p, file, line); return p; } struct deleter { void operator() (void * p) const { if (Tracer::Ready) NewTrace.Remove(p); delete p; } } #else struct deleter { void operator() (void * p) const { delete p; } } #endif //NewTrace is an extern'd object in the Main.cpp file So then I'd pass in the deleter to the shared_ptr and then whichever deleter was defined would be passed into the shared_ptr. I'm kinda cobbling together a few different things I've seen but I think that with this I could include the header file in the .cpp file of any class that I want to track the memory of and then just make sure I send in the deleter when I reset or make a new shared ptr. For instance in my LoggerFactory.cpp file : #include "../include/Logger.hpp" #include "../include/LoggerFactory.hpp" #include "../include/dbnew.hpp" LoggerMap LoggerFactory::loggers; boost::shared_ptr<Logger> LoggerFactory::getInstance(std::string& logger) { boost::shared_ptr<Logger>& TheLoggerRef = loggers[logger]; if(!TheLoggerRef.get()) TheLoggerRef.reset(new Logger(logger),deleter()); return TheLoggerRef; } So then the dbnew would define the deleter to use for the Logger object, if it was a debug build it would also create the overloaded new operator, define the _FILE_ and _LINE_ macros to send into the new New operator. And if its not the debug build then essentially the normal deleter is given to the shared_ptr and everything procedes as normal. Is this a good way to go about adding memory leak checking? I've looked for a new memory leak checkers like valgrind but thats only available on Linux and I'm stuck on windows.. and all the memory checkers I've been able to find only support VC++ or borland and I use gcc. So I would like a nice simple way that I can drop right in, which is what I'm going for with the overloading new and the custom deleter. Joshua.

2 1

Concurrency support based on Boost.Threads
by Slawomir Lisznianski 19 Feb '04

19 Feb '04

License: Public Domain URL: http://www.rhapsodia.org Depends on: Boost, STL Code maturity: Beta Target platform: Any with C++ compiler. C++ compilers verified to work on: GNU g++ 3.2.x, Visual C++ 6 Service Pack 5 Description: Rhapsodia is a collection of header files implementing commonly used classes in concurrent C++ programming. Library mainly consists of implementations of: - Channel (bounded, unbounded and priority queue), - Barrier (multi-party synchronization) - Executor (replacement for direct use of thread creation and management API). Your critiques, suggestions or usage questions are much welcomed. Slawomir Lisznianski; [ www.rhapsodia.org ]

1 0

RE: [Boost-users] Mathematical expressions with containers
by Hurd, Matthew 19 Feb '04

19 Feb '04

> Russell Hind > Subject: [Boost-users] Mathematical expressions with containers > > Currently I'm doing more and more mathematical calculations on > containers, and wondered if there is any library out there that allows > containers to be placed in expressions without having to use > transform/for_each etc. > > e.g. > > std::vector<std::complex<double> > V1; > std::vector<std::complex<double> > V2; > double C1, C2; > > ... > > std::vector<std::complex<double> > Result; > > Result = C1 + V2 / (V1 * C2); > > while would be equivalent to (assuming Result has been resized) > > (I'm currently using a mixture of transforms and spirit::phoenix > (because lambda doesn't work with my compiler)) > > transform(V1.begin(), V1.end(), V2.begin(), > Result.begin(), > C1 + phoenix::arg2 / (phoenix::arg1 * C2)); > > Or something to this effect that will aid with this. > > Cheers > > Russell Seems to my quick glance you are asking for some vector operations. Have you looked at boost's ublas? Regards, Matt Hurd. IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

3 2

Any one used boost with comeau c++ compiler for visual c++.net 2003?
by Ben Polen 18 Feb '04

18 Feb '04

To the community; I'm thinking of geting comeau computing's c++ frontend for visual c++.net 2003. I was wondering if anyone has experience using those two programs in conjunction with the boost libraries. In viewing the regression test, I was also wondering why Comeau doesn't seem to compile at a rate of 100% with boost. Is that due to Comeau unconformance, boost unconformance or problems with the c++ backend program, vc 7.1, gcc 3.2 ect. Anyone have any clues? Thanks Ben _________________________________________________________________ Stay informed on Election 2004 and the race to Super Tuesday. http://special.msn.com/msn/election2004.armx

1 0

RE: [Boost-users] Trouble linking regex library on Solaris machine
by Ben Hutchings 18 Feb '04

18 Feb '04

Justin Adam Miller <millerj(a)wam.umd.edu> wrote: > Howdy. As I am only interested in using the regex library right now, I > followed the instructions for building that library only, using dmake. > Compilation went fine. When I tried using the library in a little test > program with the command: > > g++ regextest.cxx -I./boost_1_31_0 > -L./boost_1_31_0/libs/regex/build/sunpro -lboost_regex -o > regextest.cxx > > I get many undefined symbol errors. If requested, I can provide the > entire error output. It looks like you are trying to use the wrong library. SunPro refers to the Sun C++ compiler and tools whereas you are using GNU C++. You have to build the library and application with the same compiler.

2 1

Trouble linking regex library on Solaris machine
by Justin Adam Miller 18 Feb '04

18 Feb '04

Howdy. As I am only interested in using the regex library right now, I followed the instructions for building that library only, using dmake. Compilation went fine. When I tried using the library in a little test program with the command: g++ regextest.cxx -I./boost_1_31_0 -L./boost_1_31_0/libs/regex/build/sunpro -lboost_regex -o regextest.cxx I get many undefined symbol errors. If requested, I can provide the entire error output. Justin Miller

2 2

RE: [Boost-users] Re: Semaphore and barriers for boost-threads?
by Ben Hutchings 18 Feb '04

18 Feb '04

Craig Rodrigues <rodrigc(a)crodrigues.org> wrote: > It is possible to implement semaphore's with mutexes and > condition variables. I looked at the source code for > FreeBSD 5.2's implementation of semaphores to see how this was > done: > > http://www.freebsd.org/cgi/cvsweb.cgi/~checkout~/src/lib/libpthread/thre ad/thr_sem.c > > I even took a whack at writing one based on Boost (it may be buggy): > > #include <boost/thread.hpp> > #include <boost/thread/mutex.hpp> > > struct mysem { > mysem(unsigned int count): count_(count) {} > > void post() { > boost::mutex::scoped_lock l(sem_mutex_); > ++count_; > sem_cond_.notify_all(); notify_one() should be safe and more efficient here, because any of the waiters can be satisfied by the change you have made. Use notify_all() where waiters are waiting for different conditions on the same condition variable. (I'm not sure I expressed that exactly correctly - can anyone improve on that?) > } > > void wait() { > boost::mutex::scoped_lock l(sem_mutex_); > for(;;) { > > if( count_ == 0 ) sem_cond_.wait(l); This is wrong - you must always use while rather than if to test the inverse of the condition you are waiting for because it is possible that the condition is no longer true when wait() returns. (There is also a function template for wait() that tests a predicate for you.) It is even possible on some systems for wait() to return even though no-one called notify_one() or notify_all(). > else { --count_; break; } > } > } > > private: > unsigned int count_; > boost::mutex sem_mutex_; > boost::condition sem_cond_; > }; > > > What kinds of things can go wrong if I use this class? <snip> The other potential problem I see is overflow of count_, but it is exceedingly unlikely that you will be able to create enough threads to cause that.

1 0