- Boost-users - lists.boost.org

compiling boost with mingw in winxp
by Alexis H. Rivera-Rios 18 Jun '04

18 Jun '04

Hi, I downloaded boost 1.31.0 and I'm using bjam version 3.1.10. I want to compile the code with Mingw by doing the following: bjam -s"TOOLS=mingw" and I get the following message: C:\opt\boost_1_31_0>bjam -s"TOOLS=mingw" install ...found 8817 targets... ...updating 3260 targets... MkDir1 C:\Boost MkDir1 C:\Boost\lib gcc-Link-action bin\boost\libs\date_time\build\boost_date_time.dll\mingw\debug\b oost_date_time-mgw-d-1_31.dll bin\boost\libs\date_time\build\boost_date_time.dll \mingw\debug\boost_date_time-mgw-d-1_31.lib spawn: Invalid argument I have no idea were to start looking to debug the code. If it may help, I downloaded the source code for bjam and compiled it and get the following messages: C:\opt\boost-jam-3.1.10>build mingw ### ### Using 'mingw' toolset. ### C:\opt\boost-jam-3.1.10>rd /S /Q bootstrap.mingw C:\opt\boost-jam-3.1.10>md bootstrap.mingw C:\opt\boost-jam-3.1.10>gcc -DNT -o bootstrap.mingw\jam0.exe 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 mak e1.c newstr.c option.c parse.c pathunix.c pathvms.c regexp.c rules.c scan.c sear ch.c subst.c timestamp.c variable.c modules.c strings.c filesys.c builtins.c pwd .c class.c w32_getreg.c native.c modules/set.c modules/path.c modules/regex.c m odules/property-set.c modules/sequence.c modules/order.c execnt.c: In function `execcmd': execnt.c:651: warning: passing arg 3 of `spawnvp' from incompatible pointer type execnt.c:682: warning: passing arg 3 of `spawnvp' from incompatible pointer type C:\opt\boost-jam-3.1.10>.\bootstrap.mingw\jam0 -f build.jam --toolset=mingw "--t oolset-root= " clean ...found 1 target... ...updating 1 target... .rm. clean ...updated 1 target... C:\opt\boost-jam-3.1.10>.\bootstrap.mingw\jam0 -f build.jam --toolset=mingw "--t oolset-root= " ...found 83 targets... ...updating 4 targets... .cc. bin.ntx86\yyacc.exe .cc. bin.ntx86\mkjambase.exe .cc. bin.ntx86\jam.exe execnt.c: In function `execcmd': execnt.c:651: warning: passing arg 3 of `spawnvp' from incompatible pointer type execnt.c:682: warning: passing arg 3 of `spawnvp' from incompatible pointer type .link. bin.ntx86\bjam.exe 1 file(s) copied. ...updated 4 targets... The executables are generated, but I suspect the spawn warning has to do with the build error. I'll appreciate your help, Alex ===== Programming Tutorial: In Python: To do this, do this In Perl: To do this, do this or this or this or this... In C: To do this, do this, but be careful In C++: To do this, do this, but don't do this, be careful of this, watch out for this, and whatever you do, don't do this __________________________________ Do you Yahoo!? Read only the mail you want - Yahoo! Mail SpamGuard. http://promotions.yahoo.com/new_mail

2 1

INI File Parser?
by Duane Murphy 18 Jun '04

18 Jun '04

A while back, I noted that there was an INI file parser as part of boost. It was obscure, but I think it was in the program_options library. I note references to program_options searching the web site, but I'm not finding anything in the latest builds. I'm specifically interested in parsing INI files (I'm on a Macintosh) but the program_options library also seemed interesting. Is there anything available? What's the status of the program_options library? Thanks for any pointers, ...Duane

4 4

How to Compile boost::function With a NoArg Member Function ?
by Eduardo Bezerra 17 Jun '04

17 Jun '04

Hi, I need to use boost::function in a context like this one: struct Widget { string ToString() {return "Widget"; } }; int main() { function<string () f(&Widget::ToString); } What's the correct syntax to sucessfully compile this example ? Best regards, Eduardo _________________________________________________________________ MSN Messenger: instale grátis e converse com seus amigos. http://messenger.msn.com.br

2 1

Newbie question -- graph library example
by Tim Rowe 17 Jun '04

17 Jun '04

In the example examples/file_dependencies.cpp, I can't see what either of the typedefs for Color do: typedef property_map<Graph,vertex_color_t>::type Color; If I comment then out everything seems still to work. What are they there for? TIA, Regards, Tim

2 1

[Tuple] broken for gcc-3.4.0
by Jürgen Hunold 17 Jun '04

17 Jun '04

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi ! After updating my cvs snapshot at 12.15 , the tuple library is broken for gcc 3.4.0. My own program stopped compiling and when going to libs/tuple/test and running bjam I get: In file included from /ive/hunold/packages/boost/boost/tuple/tuple.hpp:38, from ../../../libs/tuple/test/tuple_test_bench.cpp:19: /ive/hunold/packages/boost/boost/tuple/detail/tuple_basic.hpp: In function `typename boost::tuples::access_traits<typename boost::tuples::element<N, boost::tuples::cons<HT, TT> >::type>::non_const_type boost::tuples::get(boost::tuples::cons<HT, TT>&)': /ive/hunold/packages/boost/boost/tuple/detail/tuple_basic.hpp:212: error: `get_class' undeclared (first use this function) (full output of failing tests attached) So I think this is really something which gcc 3.4.0 does no handle. Yours, Jürgen - -- * Dipl.-Math. Jürgen Hunold ! Institut für Verkehrswesen, Eisenbahnbau * voice: ++49 511 762-2529 ! und -betrieb, Universität Hannover * fax : ++49 511 762-3001 ! Appelstrasse 9a, D-30167 Hannover * hunold(a)ive.uni-hannover.de ! www.ive.uni-hannover.de -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.4 (GNU/Linux) iD8DBQFA0ZJ7ljbJ/LLrxrYRAhxCAJ9xnzG7bfPORsLVU9pjhD90RjP5CQCbBgL6 g154KH2PULNGi8pBFIDsiTM= =XvKx -----END PGP SIGNATURE-----

2 3

boost::filesystem::path corruption
by Stuart Bingë 17 Jun '04

17 Jun '04

Hello all, I've recently started using some of the Boost libraries, one of which being boost::filesystem. I have however encountered a problem while using the library, which as far as I can tell is a bug. I'm not sure if anyone is aware of this problem, or if is not an issue with the library itself but rather with my configuration - in either case a description of the problem follows: Whenever I instantiate a boost::filesystem::path object and try to print out a text representation of the path using a method such as .string(), the path itself is printed out, however it looks as though the string is not terminated properly as a whole bunch of trailing garbage appears after the path. The following sample program produces the problem for me: #include <iostream> #include <boost/filesystem/path.hpp> int main(int c, char** v) { boost::filesystem::path testpath("test/path"); std::cout << testpath.native_file_string() << std::endl; return 0; } When I run this code I get output similar to the following: test/pathpÿÿÿÿtest/ÿÿÿÿdataÿÿÿÿpath... etc (a whole bunch of other random stuff like days of the week & month, as well as garbage character strings) Can anyone shed some light on this for me? I'm running boost version 1.31.0 on Gentoo Linux x86 (kernel 2.6.5-gentoo-r1) with GCC version 3.3.2, for anyone who is interested. Regards, Stuart Bingë

2 1

limiting searches in BGL
by Jason Crosswhite 16 Jun '04

16 Jun '04

Hello, I am just starting to use the BGL, and have been beating my head upon a problem. I am needing to find an irregularly bounded set of points in three dimensional space. The points are within a convex hull and the graph edges are edges in a delaunay triangulation. I want to start at a node known to be on the hull, and crawl through the inside with either depth first or breadth first search. If you are on the hull, you would not allow the search to continue outside the hull. I thought of doing this with a simple visitor, and color the unwanted vertices black. However, from inside the scope of the visitor, I do not believe I can have access to the colors. Several ugly hacks come to mind, but I would like to know if there is an easy way of doing this first? -Jason Crosswhite

3 4

Re: limiting searches in BGL
by Vladimir Prus 16 Jun '04

16 Jun '04

Hi Jason, > I am just starting to use the BGL, and have been beating my head upon a > problem. I am needing to find an irregularly bounded set of points in > three dimensional space. The points are within a convex hull and the > graph edges are edges in a delaunay triangulation. I want to start at a > node known to be on the hull, and crawl through the inside with either > depth first or breadth first search. If you are on the hull, you would > not allow the search to continue outside the hull. I think you might want to use 'TerminatorFunc' argument to depth_first_visit. That's a functor which returns true if the search should not continue after a certain vertex. - Volodya

1 0

dynamic boost::array and performance/size of STL vector
by Bo Peng 15 Jun '04

15 Jun '04

Dear list, I frequently need to use arrays with undetermined (at compile time) but constant (user specify size) size. I.e., I need something like boost::array<int> arr(5); without arr.insert etc, rather than boost::array<int,5> arr; which only accept constant array length. Of course I can use 'vector<int> arr(5)' in this case but I am worry about the performance and size overhead, specifically: 1. How is size() implemented in vector<>? I am concerned with this function since icc (intel c++ compiler) can not vectorize 'for(i=0;i<arr.size();i++)' unless arr.size() is an inlined reference to a variable. 2.Since I will have a lot of such arrays, I would also like to know how many additional variables vector<int> keeps. I.e. exactly how big is vector<int> arr(5)? It might be trivial to copy boost::array and add constructor/destructor but I do not want to re-invent the wheel. Thanks. Bo

4 5

RE: [Boost-users] Regex lookahead/lookbehind
by James Gunn 15 Jun '04

15 Jun '04

*** Before acting on this e-mail or opening any attachment you are advised to read the disclaimer at the end of this e-mail *** Hi John, > -----Original Message----- > From: John Maddock [mailto:john@johnmaddock.co.uk] > Sent: 15 June 2004 12:40 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Regex lookahead/lookbehind > > > > Hi all, > > > > Is it possible to do lookahead and/or lookbehind within > boost::regex? > > Lookahead is supported at present, lookbehind will be in the > next revision (currently in cvs in the branch called regex5). > > John. Thanks for the quick response. In the end I managed to solve my current problem without needing lookahead or lookbehind. I used your (earlier) advice of checking for word boundaries at the beginning and end of my regular expression and this has helped loads! The latest version of my postcode validation expression is shown below: (\bGIR\s0AA\b)| (\b[^QVX\W0-9][^IJZ\W\s]([0-9]{1,2}?|[ABCDEFGHJKSTUW0-9]?|[0-9][ABEHMNPRVWXY ]?) \s+\d[^CIKMOV]{2}\b) I'm certain that the expression could be made simpler and that it could also be made more efficient but I'm not sure where. Cheers, James ********************************************************************** Please note: This e-mail and its attachments contain only the opinions of the sender and do not necessarily reflect the policy(s) of the communisis group in general. Employees of the communisis group are required not to make any defamatory statements and not to infringe or authorise any infringement of copyright or any other legal right by e-mail. Any such communication is therefore outside the scope of employment of the individual concerned. The communisis group will not accept any liability in respect of such a communication. Confidentiality: This e-mail and any attachments, together with their contents, are confidential unless otherwise explicitly stated in writing by the sender of this e-mail and are for the intended recipient only. If they have come to you in error you must not take any action in respect of them, which includes but is not limited to reproducing, sending or storing them, other than to notifying the sender immediately of the mistake, and deleting the e-mail, any attachments and any reproductions made by replying to it. Viruses: This e-mail and any attachments have been scanned for viruses but we cannot guarantee that they are virus free. The recipient should check this e-mail and any attachments for viruses. The communisis group accepts no responsibility for any damage caused by any virus transmitted by this e-mail or any of its attachments. In the event of any unauthorised copying or forwarding, the recipient will be required to indemnify the communisis group against any claim for loss or damage caused by any viruses or otherwise. ********************************************************************** ______________________________________________________________________ This email has been scanned by the MessageLabs Email Security System. For more information please visit http://www.messagelabs.com/email ______________________________________________________________________

1 0