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

template
by adel.essafi 08 Apr '04

08 Apr '04

hi list he is the source code of my project. it is an algorithms for scheduling DAG taks on machines. there is a template function that does not work well. please , can you guess where is the fault. thanks Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34/mn) ; tél : 08 92 68 13 50 (0,34/mn)

1 0

template
by adel.essafi 08 Apr '04

08 Apr '04

hi list I am developping a scheduling algorithm. here you have the source code of my project. please , can you see what is wrong with it. thanks Accédez au courrier électronique de La Poste : www.laposte.net ; 3615 LAPOSTENET (0,34/mn) ; tél : 08 92 68 13 50 (0,34/mn)

1 0

RE: [Boost-users] Re: Any Success with AIX and GCC?
by James Zappia 08 Apr '04

08 Apr '04

I've compiled gcc on aix 4.3.3 in the past and no matter what c++ program I wrote, threading or no, I needed to specify the -pthread flag to get it to compile. It's an aix runtime thing with c++, pure c programs didn't have this problem. HTH, James -----Original Message----- From: Rene Rivera [mailto:grafik.list@redshift-software.com] Sent: Wednesday, April 07, 2004 12:55 PM To: boost-users(a)lists.boost.org Subject: [Boost-users] Re: Any Success with AIX and GCC? Peter Jones wrote: > Hey, remember back when Rene Rivera said: > >>The gcc toolset is already adding the -pthread option when linking >>multi-threaded variants (lines 143-145). Are you saying you need to use >>-pthread even when linking single-threaded variants? > > > This is what "bjam -sTOOLS=gcc -sBUILD=release" produces without my > change to gcc-tools.jam: Which builds the release single-threaded variants. > gcc-Link-action > bin/boost/libs/filesystem/build/libboost_filesystem.so/gcc/release/shared-li nkable-true/libboost_filesystem-gcc-1_31.so > bin/boost/libs/filesystem/build/libboost_filesystem.so/gcc/release/shared-li nkable-true/libboost_filesystem-gcc-1_31.imp > ld: 0711-317 ERROR: Undefined symbol: .pthread_mutex_lock > ld: 0711-317 ERROR: Undefined symbol: .pthread_mutex_unlock > ld: 0711-317 ERROR: Undefined symbol: .pthread_mutex_init > ld: 0711-317 ERROR: Undefined symbol: .pthread_mutex_destroy Is there a way to tell who is referencing those symbols? As it might not be Boost code but other runtime code. -- Something to try would be to compile an empty *.so. That is compile an empty source file and try doing a "-shared" link. If you get thread errors with an empty shared library, then the problem is that the GCC+AIX runtimes require threading. And I'll fix that on the toolset, and post a patch ;-) -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com - 102708583/icq _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

ublas and matrix expression
by Russell Hind 08 Apr '04

08 Apr '04

I have an expression a = (X^T * X)^-1 * X^T * y where x is an n * k matrix and y is an n row vector How do I implement this expression in ublas? I can create and populate the matrices and can do the product of matrices and the transpose use prod and trans, but I'm unsure on the ^-1. Can I do this with ublas? (I don't know much about matrices, but have been given the above expression as a way of finding a polynomial fit for a set of data). Thanks in advance Russell

4 14

Re: [Boost-users] Installing boost libraries with MS VC 6
by dmathews 08 Apr '04

08 Apr '04

Cheers for the help -got it compiling now.

1 0

Any Success with AIX and GCC?
by Peter Jones 08 Apr '04

08 Apr '04

Has anyone had any success compiling the latest version of boost wholesale with GCC on AIX? Besides the annoying dynamic linking problems, I am also getting failed links for wchar_t stuff: ld: 0711-317 ERROR: Undefined symbol: std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >::_Rep::_S_terminal With: Boost: 1.31.0 GCC: 3.3.2 AIX: 5.2 -- Peter Jones [unix;vi;crypto;c++;4wd] (http://pmade.org) PGP [5137 173E 5BFA 8C63 8982 F035 FDBB 1636 7D69 C63F]

4 8

Build boost with Codewarrior on OS X?
by Steve Folly 07 Apr '04

07 Apr '04

Hi, Has anyone built boost with: Mac OS X Panther Codewarrior 9.2 Cross-compiled for a Win32 target (and Mach-O target, for that matter). It's the Win32 target bit I'm having problems with. Cheers, Steve.

2 1

Installing boost libraries with MS VC 6
by dmathews 07 Apr '04

07 Apr '04

Hi, I hope you don't mind a total newbie question. I'm trying to make use of some c++ code from the web in a project of my own. However this code uses boost libraries. Specifically: #include <boost/numeric/ublas/matrix.hpp> using namespace boost::numeric::ublas; So I need to install these. However I don't really know what I'm doing (!) Do I need to build/install all of Boost? As I've really not got a clue how to do this and the documentation isn't abundantly clear. I tried just copying "matrix.hpp" into the project and typing #include <matrix.hpp> but it didn't work. Any pointers to get me going greatfully appreciated. I can work in MS VC 6 or 7 Thanks in advance Dave

3 2

Boost::bind and protect
by Edward Diener 07 Apr '04

07 Apr '04

I am lost, even after looking at the code, of what protect is supposed to do in combination with boost::bind. I read this in the documentation, "Sometimes it is necessary not to evaluate the first argument, but not to evaluate some of the other arguments, even when they are nested bind subexpressions. This can be achieved with the help of another function object, protect, that masks the type so that bind does not recognize and evaluate it. When called, protect simply forwards the argument list to the other function object unmodified. The header boost/bind/protect.hpp contains an implementation of protect. To protect a bind function object from evaluation, use protect(bind(f, ...))." but the grammar, or perhaps the explanation, eludes me. Can anyone explains what it means to protect other arguments so that they are not evaluated in the context of boost::bind, perhaps by a practical example, which I think the doc could use, of what protect actually does ?

2 1

[BGL] algorithms, design
by Val Samko 05 Apr '04

05 Apr '04

Hi, I find BGL extremely useful and flexible, but I am surprised that only a small number of algorithms is included with the library, although, numerous useful algorithms are implemented and available in boost/libs/graph/example . For example, why is the edge_connectivity function only available in edge-connectivity.cpp, and is not present in the library itself? I understand that I can copy the implementation of this function into my program, but why not include it in BGL? Is there any particular reason for this? -- Val Samko http://val.digiways.com/

2 2

Spirit skip parser question.
by Jia Pu 05 Apr '04

05 Apr '04

I am trying to write a parser which skipps white space and C, Java style comments. To get familiar with spirit, I did some experiments, here is a question. First, I write a simple grammar to accept some non-white space chars. //////////////////////////////////////////////////////////////////////////// //// struct FOO_GRAMMAR : public grammar<FOO_GRAMMAR> { template <typename ScannerT> struct definition { typedef rule<ScannerT> rule_t; definition(ABNF_GRAMMAR const & self) { r_LETTER = range_p('a','z') | range_p('A','Z') | '.'; r = (+r_LETTER); } rule_t r, r_LETTER; rule_t const& start() const { return r; } }; }; //////////////////////////////////////////////////////////////////////////// //// I used FOO_GRAMMAR with space_p as skip parser: //////////////////////////////////////////////////////////////////////////// // FOO_GRAMMAR g; std::string line = "This is a test parser."; parse_info<> info = parse(line.begin(),line.end(), g, space_p); //////////////////////////////////////////////////////////////////////////// //// This works perfectly. Then, I tried to wrap the skip parser in a skip grammar, since eventually I need a more complicated parser. So I wrote the skip grammar as: //////////////////////////////////////////////////////////////////////////// /// struct SKIP_GRAMMAR : public grammar<SKIP_GRAMMAR> { template <typename ScannerT> struct definition { typedef rule<ScannerT> rule_t; definition(SKIP_GRAMMAR const & self) { rule_t r_SKIP = space_p; } rule_t r_SKIP; rule_t const& start() const { return r_SKIP; } }; }; ///////////////////////////////////////////////////////////////////////// I tried to parse the same sentence as before: /////////////////////////////////////////////////////////////////////////// FOO_GRAMMAR g; SKIP_GRAMMAR skip; std::string line = "This is a test parser."; parse_info<> info = parse(line.begin(),line.end(), g, skip); ////////////////////////////////////////////////////////////////////////// This time the parsing failed. Can anyone tell me why? I thought grammars are just like rules. And any suggestion on building a parser skipping certain pattern? I just can figure it out by reading the doc. Thank you. Jia (Jay) Pu Software Engineer LumenVox LLC ---------------------------------------------------------------------------- ------------ Anytime a linguist leaves the group the recognition rate goes up. --Fred Jelinek (then of the IBM speech group) (1988)

1 0

Unexpected behavior in filesystem
by Martin Merck 05 Apr '04

05 Apr '04

Hi, I was trying the demo code from the filesystem library (searching for a file using the directory iterator). I noticed a strange behavior of the code. In the path I was searching I had a symbolic link, which was pointing to an unexisting file. The program throws now a exception with the following reason: boost::filesystem::is_directory: "/home/merck/CVS/test": No such file or directory Here 'test' is a link to some non exisitng file. It seems logical that the exception is thrown, however I can't garantee that there will never be tangling sym-links on the system. I would prefer if the library would have a option not to follow symlinks or handel this situation by itself. Regards Martin oooooooooooooooooooooooooooooooooooooooooooooooooooooooo o Dr. Martin Merck o o Institut fuer Theoretische Physik und Astrophysik o o Am Hubland o o 97074 Wuerzburg o o Phone: +49 931 888 4933 Fax: +49 931 888 4603 o o Email: merck(a)astro.uni-wuerzburg.de o oooooooooooooooooooooooooooooooooooooooooooooooooooooooo

1 0

RE: [Boost-users] Re: about license
by Darryl Green 05 Apr '04

05 Apr '04

> -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of > David Abrahams > Sent: Sunday, 4 April 2004 2:18 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Re: about license > > This has been sitting in my "to be dealt with" pile for quite some > time, because I couldn't figure out what to do with it. > > "Darryl Green" <Darryl.Green(a)unitab.com.au> writes: > > > I've been trying to educate myself about the law in this area, > > with some help from Alexander Terekhov. I'm not at all convinced > > now that there is any derivative work produced by the compilation > > step > > I bet that's open to legal interpretation. Precisely. Thats what makes a trivial faq Q/A hard! > > > however this seems to make no difference to the result. > > Good. The intention of the license wording is to say that even if you > consider the compiled code a copy or a derivative work, the > requirement to embed a copy of the license doesn't apply to it. > > > It seems the compiled code is a translation of both works, > > I guess you mean the boost code and whatever it's compiled along with. > The latter could be nothing: there might only be boost code involved. > Anyway, can you cite something authoritative that gives compiled code > the status of a "translation" and not a "derivative work"? Actually, I'm not being careful enough with my words here - I should have said "mechanical translation". To quote from http://www.ipmall.info/hosted_resources/CopyrightCompendium/chapter_0300 .asp <quote> 306.02(a) Translations. A translation is a ren- -dering of a work from one language to another, as, for example, a work trans- -lated from Russian into French, or from German into English. However, trans- -literations and similar processes by which letters or sounds from one alpha- -bet are converted to another are not copyrightable since the conversion is merely a mechanical act. Thus, merely changing a work from the Cyrillic to the Roman alphabet would not be copyright- -able. </quote> The question is whether comiling source code is "merely a mechanical act". However, it seems reasonable to think that it is. I don't know how authoritative an answer you are looking for (presumably, in law that would need to be some sort of precedent) however Alexander did point me to the following discussion: http://www.crynwr.com/cgi-bin/ezmlm-cgi?3:mss:7659 http://www.crynwr.com/cgi-bin/ezmlm-cgi?3:mss:7663 http://www.crynwr.com/cgi-bin/ezmlm-cgi?3:mss:7679 http://www.crynwr.com/cgi-bin/ezmlm-cgi?3:mss:7680 It seems Rod Dixon at least (and he does cite some relevant material re. tests for originality) thinks that compilation doesn't produce a derivative work. Also, apparently the US copyright office thinks source code and object code are one and the same in at least some contexts - see: http://digital-law-online.info/lpdi1.0/treatise26.html <quote> VI.B. Source Code and Object Code ... Every computer program copyright case treats the copyright in the source code and the object code as equivalent... Even though source code and object code are distinct, it is still useful to maintain the concept that the source code and the object code are just different forms of the same copyrighted work. The Copyright Office regards the source code and object code as equivalent for purposes of registration... Where an applicant is unable or unwilling to deposit source code, he/she must state in writing that the work as deposited in object code contains copyrightable authorship. The Office will send a letter stating that registration has been made under its rule of doubt and warning that it has not determined the existence of copyrightable authorship. </quote> > > > agregated (a compilation) in some way then. I think whoever > > produces the compilation can license it however they like, > > subject to permission being granted by the authors of the > > original works to include their work in the compilation. > > I think the intent to grant that permission is made sufficiently > clear by the license text, don't you? No. Not so much because of the Boost license, but because of various other more exotic open source licenses such as the GPL in particular, changing the/my perception of what is "normal" or "expected" when it comes to copyright over software. I think it would be better spelt out clearly. However, I think at the end of the day the lawyers would figure it out as is - so the license meets the needs of lawyers at least. > > > I don't know if this is sufficiently clearly allowed by > > the wording of the boost license, though I think "use" > > must surely allow this for software source libs as there > > is no other way to "use" them. > > There are actually lots of ways to use them, but that is certainly *a* > use. Ok. > > > So the final answer is the same > > good. > > > but some of the questions and answers in between may be wrong. > > I don't know what _that_ means. Sorry - my earlier proposed FAQ Q/A might well be incorrect on some ponts of law but reaches the correct conclusion. > > > Have you received any feedback from lawyers about this? > > What is "this"? My earlier post containing the FAQ items, which you cced to the lawyers. I now understand the license sufficiently to use the code. I was hopeful that boost developers' time could be saved with a simple faq addition - but it my first attempt at that turns out (I think) to be innaccurate. I'm happy to put some time into correcting it, but ianal. If there is some lawyerly feedback I can use in correcting the FAQ proposal, I'm happy to do it. Beyond that, I don't want to waste more of your or the lawyers time on this. 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. ##########################################################################

1 0

[BGL] johnson_all_pairs_shortest problem compiling
by Val Samko 04 Apr '04

04 Apr '04

Hi, Why doesn't the following code compile (VC++ 7.1, g++ 3.3.3, boost 1.31.0) ? ======================================================================== #include <boost/graph/adjacency_list.hpp> #include <boost/graph/johnson_all_pairs_shortest.hpp> int main() { using namespace boost; typedef adjacency_list<vecS, vecS, bidirectionalS, boost::property<boost::vertex_index_t, int, boost::property<boost::edge_weight_t, int> > > Graph; Graph g; int distance_matrix[100][100]; johnson_all_pairs_shortest_paths(g, distance_matrix); } ======================================================================== but it compiles, if we pass the edge weight map (composed from std::map<edge_descriptor, int>) as a named parameter to johnson_all_pairs_shortest_paths ? Also, why do johnson_all_pairs_shortest_paths(g, distance_matrix); and johnson_all_pairs_shortest_paths(g, distance_matrix, weight_map(get(vertex_index, g))); produce completely different compile time errors? Finally, is it possible to use johnson_all_pairs_shortest_paths with adjacency_list<mapS, mapS, ...> ? According to the documentation, this should be possible, but this just does not compile. -- Val Samko http://val.digiways.com/

2 2

[BGL] documentation problem
by Val Samko 04 Apr '04

04 Apr '04

Hi, Is it required for a readable property map to have operator[]? At least, that is not mentioned at http://www.boost.org/libs/property_map/ReadablePropertyMap.html , so I assume, operator[] is not required. At http://www.boost.org/libs/graph/doc/johnson_all_pairs_shortest.html it is documented that weight_map named parameter must be a model of a readable property map. At johnson_all_pairs_shortest.hpp, line 101 we have w[e2] = w1[*e]; which assumes that weight_map has operator []. Is the problem in the readable property map documentation, or in the johnson_all_pairs_shortest, or I am doing something wrong? -- Val Samko http://val.digiways.com

2 2

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

04 Apr '04

> -----Original Message----- > From: David Abrahams [mailto:dave@boost-consulting.com] > Sent: Tuesday, 2 March 2004 12:43 AM > > "Darryl Green" <Darryl.Green(a)unitab.com.au> writes: > > > I'm happy to provide a patch once I'm reasonably sure I > understand the > > license. I'm assuming an email discussion will be more > productive than > > patches in the meantime. I have one more question that I > have a proposed > > FAQ answer for, but my "answer" is based purely on what I think it > > should be, not an understanding of the law. I've been trying to educate myself about the law in this area, with some help from Alexander Terekhov. I'm not at all convinced now that there is any derivative work produced by the compilation step, however this seems to make no difference to the result. It seems the compiled code is a translation of both works, agregated (a compilation) in some way then. I think whoever produces the compilation can license it however they like, subject to permission being granted by the authors of the original works to include their work in the compilation. I don't know if this is sufficiently clearly allowed by the wording of the boost license, though I think "use" must surely allow this for software source libs as there is no other way to "use" them. So the final answer is the same - but some of the questions and answers in between may be wrong. Have you received any feedback from lawyers about this? 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

[BGL] truncating dijkstra_shortest_paths
by Sven de Vries 03 Apr '04

03 Apr '04

Hi, in a given graph I want to determine whether between one (!) pair (u,v) of vertices there exists an u-v-path of length at most some given threshold and that path. I use dijkstra_shortest_paths(g,u, but to accelerate matters I would like to stop the computation as soon as the key of v becomes smaller than the threshold or v turns black. I couldn't find a hook of the dijkstra algorithm that could be used to achieve this. Do I really have to change the implementation of the dijkstra algorithm for this, or is there a better way? Thanks sven

2 1

how to package graph related data ???
by Gustavo Sánchez 02 Apr '04

02 Apr '04

Hi all, I'm developing a hardware test program with some class abstractions like resistor, diode, relay ... which I stick to the BGL graph structure in the edge properties. I so have some information associated with vertices, and the result is a set of data composed of the graph itself - an ajacency_list - the graph properties for edges and vertices and a couple of vectors for the abstractions. My problem is how can I manage all these data in an OO program. The method used in BGL examples (just declare all these in main ) is right just for that, but in a more complex object colaboration society I consider it to be simple and useless. I just use a class named GraphContainer to package all the elements, but I wonder if there is any other better aproach... class GraphContainer{ int nVertices; public: UGraph g; property_map<UGraph, vertex_index_t>::type id; property_map<UGraph, edge_name_t>::type name; property_map<UGraph, vertex_name_t>::type vname; std::map<string,boost::graph_traits<UGraph>::vertex_descriptor> vertx; // mapa vertices(string)--vertex_descriptor vector<Lampara> Lamparas; vector<Diodo> Diodos; vector<Switch> Switches; vector<Resistencia> Resistencias; vector<Bobina> Bobinas; // ---------- GraphContainer(); }; Thanks a lot... --------------------------------- Antivirus Filtros antispam 6 MB gratis ¿Todavía no tienes un correo inteligente?

1 0

Re: [boost] [BGL] forced client complexity
by Jeremy Siek 02 Apr '04

02 Apr '04

Hi, I too am dissatisfied with the complexity of many parts of the BGL... On Mar 31, 2004, at 4:48 AM, Provisional Dissonance wrote: > Is there any particular reason that a > simplified interface is not made available? Just a lack of time. The priority was placed on providing flexibility and efficiency so that the BGL components could handle any situation... that flexibility came at the price of complexity. I think a good next step would be to provide more special purpose components that are easier to use. > Perhaps a > container adapter could be packaged with the library > allowing a compromise of functionality and flexibility > for simplicity? Could you explain this "container adaptor" idea more. > #include <less_than_10_graph_headers> > ... > digraph<some_node_type,some_edge_context_type> g; > g << "vertex" << make_pair("vertex", > "implicit_vertex"); > g.add_edge("brother", "sister", "sibling"); > if(g.find(make_pair("brother", "sister"))) > related = true; Perhaps this is a good place to start. Could you explain each of the above lines of code. Then we can compare to an implementation in the current BGL and pinpoint problem areas. Cheers, Jeremy _______________________________________________ Jeremy Siek <jsiek(a)osl.iu.edu> http://www.osl.iu.edu/~jsiek Ph.D. Student, Indiana University Bloomington Graduating in August 2004 and looking for work C++ Booster (http://www.boost.org) _______________________________________________

3 6

multi_array iterator question
by James N. Knight 02 Apr '04

02 Apr '04

I am trying to sort a multi_array along a dimension that is not the last. In other words, I can sort the rows of a 2D multi_array like so: typedef boost::multi_array<double, 2> array_type; typedef array_type::iterator iterator2; typedef array_type::template subarray<1>::type::iterator iterator1; array_type A(boost::extents[10][10]); for (iterator2 i = A.begin(); i!=A.end(); ++i){ sort((*i).begin(),(*i).end()); What I can't seem to do is sort the columns. Is there a way I can create a view with the dimensions reordered? Or, can I somehow create a strided iterator that will do the job (select the values in a column)? I would like to avoid transposing the array. Pointers to the relevant documentation or suggestions are appreciated. James

1 0

Boost.Test support address
by Gennadiy Rozental 02 Apr '04

02 Apr '04

For anyone interrested, direct support address for Boost.Test issues is now rogeeff(a)patmedia.com. Old one is not free anymore and not supported accordingly. Regards, Gennadiy.

1 0

linker error creating simple unit_test (boost 1.31.0 + win32 + vc 71)
by Langston, Matthew David 02 Apr '04

02 Apr '04

I'm trying to create a simple unit test (using the Unit Test Framework) using boost 1.31.0 + win32 + vc71, but I get the following linker error due to the undefined symbol __imp___CrtSetReportHook: tests error LNK2019: unresolved external symbol __imp___CrtSetReportHook referenced in function "public: int __thiscall boost::execution_monitor::execute(bool,int)" (?execute@execution_monitor@boost@@QAEH_NH@Z) There was mention of this undefined symbol (__imp___CrtSetReportHook) in this thread: http://lists.boost.org/MailArchives/boost/msg43787.php. However, that post was concerning the Metrowerks compiler, but I am using Microsoft's vc71 compiler. Can someone help me resolve this undefined symbol (__imp___CrtSetReportHook) problem? Here is my simple "unit test suite" that I am trying to build: #include <boost/test/unit_test.hpp> #include <boost/test/included/unit_test_framework.hpp> using boost::unit_test_framework::test_suite; void test_GleamData() { BOOST_CHECK(2 == 1); // non-critical test => continue after failure } test_suite* init_unit_test_suite( int, char* [] ) { test_suite* test = BOOST_TEST_SUITE( "GleamAnalysis Test Suite" ); test -> add( BOOST_TEST_CASE( &test_GleamData ), 1 /* expected one error */ ); return test; } Warmest regards, Matt

2 1

RE: [Boost-users] Re: License compatibility issues.
by Jim.Hyslop 01 Apr '04

01 Apr '04

David Abrahams wrote: > It seems to me that we can't ask > our volunteer lawyers to draw up a list of answers to all the possible > licensing questions along these lines, nor can we reasonably make them > available as an on-demand resource for answering boost users' legal > questions. No, but I think that the interaction between the LGPL or GPL and the Boost License is probably going to be a very frequently encountered scenario. Basically, what it boils down to is: what is the compatibility between LGPL or GPL, and the Boost license? Can we draw up a list of the most common free-software licenses, say the top three, and ask the volunteer lawyers to determine whether Boost is compatible with each of the three? I don't mean to determine the various combinations and permutations, e.g. Boost and GPL and Mozilla Artistic, but the simple ones: Boost and "x", Boost and "y", etc. Until and unless such a comparison is done, though, I would echo your advice about seeking a competent legal opinion. -- Jim Hyslop Senior Software Designer Leitch Technology International Inc. (http://www.leitch.com) Columnist, C/C++ Users Journal (http://www.cuj.com/experts)

2 1

Re: License compatibility
by Cromwell Enage 01 Apr '04

01 Apr '04

Thanks, David Abrahams and Jim Hyslop! I'll heed your advice on seeking legal counsel and contacting the Free Software Foundation. Cromwell __________________________________ Do you Yahoo!? Yahoo! Small Business $15K Web Design Giveaway http://promotions.yahoo.com/design_giveaway/

1 0

RE: [Boost-users] Re: about license
by Jim.Hyslop 01 Apr '04

01 Apr '04

David Abrahams wrote: > Only the Boost code must use the Boost license; you can put any > license terms you wish on your own code. Why would you think > otherwise? Maybe he's used to the GPL, which forces its license model to be applied to the entire package? -- Jim Hyslop Senior Software Designer Leitch Technology International Inc. (http://www.leitch.com) Columnist, C/C++ Users Journal (http://www.cuj.com/experts)

1 0

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

License compatibility issues.
by Cromwell Enage 01 Apr '04

01 Apr '04

Good morning. >From previous posts regarding the License, I'm assuming the Legal Team is on this mailing list; if not, please direct me to them. Scenario I: I'm building a library that uses the Boost libraries (the ones covered by the current Boost Software License) and the Simple DirectMedia Layer, which is distributed under the terms of the GNU "Lesser" Public License <http://www.gnu.org/copyleft/lgpl.html>. Can I release my library under the Boost Software License? Can I release it under the GNU LGPL? Or can I not release it at all? Scenario II: I plan on building an application that uses the Boost libraries (the ones covered by the current Boost Software License) and the FOX GUI Toolkit, which is distributed under the terms of the GNU General Public License. According to <http://www.gnu.org/licenses/gpl-faq.html#IfLibraryIsGPL>, if I publicly distribute my application (e.g. via SourceForge.net) I must do so using the GNU GPL, since the FOX Toolkit is distributed under that license. Will the Boost Software License allow me to do this? Kind regards, Cromwell Enage __________________________________ Do you Yahoo!? Yahoo! Small Business $15K Web Design Giveaway http://promotions.yahoo.com/design_giveaway/

2 1

removing parallel edges in the Boost Graph Library?
by Nicholas Burlett 01 Apr '04

01 Apr '04

I am trying to use BGL to model a directed multigraph, but every time I try to remove just one of the edges (u,v), it removes all of the edges from u to v. My graph definition is: typedef adjacency_list<listS, listS, bidirectionalS, VertexProperty, EdgeProperty> graphdata; where VertexProperty and EdgeProperty are properties I've defined. Everything else seems to work: I have can add parallel edges, find the edge I want to remove based on the EdgeProperty, filter the graph for topological sorting, check for existing edges, etc. In the following, e is of type graph_traits<graphdata>::edge_descriptor, and g is the graph of type graphdata (defined above): std::cout << "about to remove edge\n"; DumpInfo(); remove_edge(e, g); std::cout << "removed edge\n"; DumpInfo(); Here is some sample output: about to remove edge vertex: 0 out-edges: in-edges: (1,0) (1,0) adjacent vertices: vertex: 1 out-edges: (1,0) (1,0) in-edges: adjacent vertices: 0 0 removed edge vertex: 0 out-edges: in-edges: adjacent vertices: vertex: 1 out-edges: in-edges: adjacent vertices: Note that there were two edges present before the call to remove_edge, but only one after. What am I doing wrong? I'm using version 1.31, if that helps. Thanks, Nicholas Burlett nrb23(a)cornell.edu

2 5

Re: [boost] [BGL] forced client complexity
by Cromwell Enage 31 Mar '04

31 Mar '04

prs, On reflection, I've decided to cross-list my reply. > If one accepts the axiom that "a picture is worth a > thousand words," then it naturally follows that > discussion of graphs is always overly prolix. I recently had a chat with a fellow programmer and attempted to summarize, in semi-layman terms, how the core algorithms of my multi-state-mazes library work. They're pretty simple, but I couldn't do it without paper and pencil. > Sadly, the same reasoning is also applicable to > the code of graph libraries. If a "code-visualizing compiler IDE" existed that would give us "code pictures" (plus conform to the new C++ standard, not ICE, and so on), I'm pretty sure more of us would be using it for all programming projects, not just graph applications. :) But seriously, with graph theory containing several different problem domains (search, network, AI, etc.), a graph library attempting to be generic enough for use in all of them is necessarily complex. > Boost.Graph seems to expose and require an > unnecessarily large amount of complexity, > though. If by "exposure" you mean lots of source code, I'll take that complexity any day of the week and twice on Sundays. :) The library does have a rather steep learning curve, especially if you're somewhat unfamiliar with graph theory and/or template programming. > Whereas libraries like Spirit go to great lengths > to make hard things easy, BGL seems to try only to > make hard things possible. I haven't looked at the Spirit library yet, so I can't tell you how easy it may be to use it. Perhaps getting your hands on a copy of the Boost Graph Library book will help (I don't have one, so I'm not certain). > The amount of scaffolding required > to use BGL for even the simplest of projects > often dwarfs the code size of a naive, > yet functional, special-purpose implementation. Special-purpose implementation of a graph library? Or the project? BGL aims to be as generic as the STL, but whereas each STL container deals with essentially one type of element, a graph needs to contain two types: a vertex type and an edge type. Furthermore, while most STL algorithms confine themselves to handling just those STL container elements, most graph algorithms also need the properties of vertices and/or edges as input. BGL delegates some of the responsibility of property storage to the Boost Property Map Library. I'm just glad the developers kept the complexity down to its current level. > While I understand that the BGL is deeply entrenched > in boost culture, certain academic circles, and even > publications, I nonetheless suggest that BGL lacks > the ease of use necessary for widespread adoption. Having dwelt in the academic circle known as the University of Central Florida, and thus familiar with the theoretical uses of a graph library (plus I've studied some game development apps on the side), I'd like to learn more about how the Real World would want to use BGL. > Even knowing that ease-of-use is not a criterion > for acceptance into boost, looking at what is > required of the client to use the BGL always leaves > me feeling perplexed. Is there any particular reason > that a simplified interface is not made available? Again, I don't know a simple graph problem that requires a simplified graph interface. > Perhaps a container adapter could be packaged with > the library allowing a compromise of functionality > and flexibility for simplicity? I thought the boost::vector_as_graph class template served that purpose. Wrap it around a std::vector<EdgeList>, with EdgeList = std::list<unsigned int> (or an edge list container of your choice, so long as the value type is usable as an index in the vector), and you should be good to go. > If a graphing problem is trivial, shouldn't BGL > provide a trivial solution? Why are the simplest > useful examples several hundred lines of code? The examples don't seem that big and hard to understand. Of course, quite a few of them have #ifdefs that I could do without since I don't use the compilers in question, but I can live with them. > I apologize for all of my vague criticisms - my > intention is not to flame but rather to test the > waters. Your criticisms seem healthy, and I hope my responses are helpful. > It is difficult for me to assess whether the > simplicity I yearn for isn't present for stylistic > reasons or whether it would rather necessitate a > sacrifice of flexibility, functionality or > implementation clarity. Nor is it clear to me to > what extent these criteria can be compromised to > promote clarity of client code. For what it is > worth, the kind of ease-of-use I'm imagining might > look like: #include <less_than_10_graph_headers> ... digraph<some_node_type,some_edge_context_type> g; g << "vertex" << make_pair("vertex", "implicit_vertex"); g.add_edge("brother", "sister", "sibling"); if(g.find(make_pair("brother", "sister"))) related = true; > Could someone please elucidate on why it is > impossible/impractical/unnecessary/whatever for a > graph library to have such an interface? I believe the potential for ambiguity would hinder this syntax the most. In this case, you'd have to overload operator<< to input both edges and vertices, and what if some_node_type turned out to be std::pair? You couldn't pass in make_pair(vertex,vertex) as an edge then. The same goes for g.find(); is it supposed to find a vertex, an edge, or both? Also, it seems you want to be able to use non-built-in or custom types as vertex IDs. You'll have to build your own custom-type-to-vertex map and bind it to the graph; BGL won't do it for you, to retain its genericity. Incidentally, BGL favors free functions over member functions. The rationale for that can be found in the FAQ <http://www.boost.org/libs/graph/doc/faq.html>. > Should I accept that the BGL is not the magic bullet > graph library and move on, or can this kind of > simplicity be somehow found within? Yeah, no magic bullets here. It depends on the problem you are trying to solve. Cromwell Enage __________________________________ Do you Yahoo!? Yahoo! Finance Tax Center - File online. File on time. http://taxes.yahoo.com/filing.html

1 0

Re: [BGL] forced client complexity
by Christopher D. Russell 31 Mar '04

31 Mar '04

A well written critique. I had to go look up the word "prolix" (i.e. verbose). In defense of BGL: I am no BGL expert despite having read the book several times and writing a complex client application that uses dozens of different graph types. I admit, it was some hard work getting going with BGL. However, this is because I didn't know C++ templates nearly as well as I thought I did. Certainly there's nothing in the library that would preclude anyone from writing simpler BGL-derived classes that offer solutions that are packaged to solve specific problems. Post specific problems and people will help. > It is difficult for me to assess whether the > simplicity I yearn for isn't present for stylistic > reasons or whether it would rather necessitate a > sacrifice of flexibility, functionality or > implementation clarity. Having become baseline proficient with BGL, I would disagree that it's overly complex. To me BGL is an elegant solution to a class of very complex problems that strikes a reasonable balance between complexity and flexibility. In my opinion, if you frequently use graphs BGL is well worth the investment required to learn how to use it. - Chris "Provisional Dissonance" <prosonance(a)yahoo.com> wrote in message news:20040331094800.93338.qmail@web60105.mail.yahoo.com... > If one accepts the axiom that "a picture is worth a > thousand words," then it naturally follows that > discussion of graphs is always overly prolix. Sadly, > the same reasoning is also applicable to the code of > graph libraries. Boost.Graph seems to expose and > require an unnecessarily large amount of complexity, > though. Whereas libraries like Spirit go to great > lengths to make hard things easy, BGL seems to try > only to make hard things possible. The amount of > scaffolding required to use BGL for even the simplest > of projects often dwarfs the code size of a naive, yet > functional, special-purpose implementation. > > While I understand that the BGL is deeply entrenched > in boost culture, certain academic circles, and even > publications, I nonetheless suggest that BGL lacks the > ease of use necessary for widespread adoption. Even > knowing that ease-of-use is not a criterion for > acceptance into boost, looking at what is required of > the client to use the BGL always leaves me feeling > perplexed. Is there any particular reason that a > simplified interface is not made available? Perhaps a > container adapter could be packaged with the library > allowing a compromise of functionality and flexibility > for simplicity? If a graphing problem is trivial, > shouldn't BGL provide a trivial solution? Why are the > simplest useful examples several hundred lines of > code? > > I apologize for all of my vague criticisms - my > intention is not to flame but rather to test the > waters. It is difficult for me to assess whether the > simplicity I yearn for isn't present for stylistic > reasons or whether it would rather necessitate a > sacrifice of flexibility, functionality or > implementation clarity. Nor is it clear to me to what > extent these criteria can be compromised to promote > clarity of client code. For what it is worth, the > kind of ease-of-use I'm imagining might look like: > > #include <less_than_10_graph_headers> > ... > digraph<some_node_type,some_edge_context_type> g; > g << "vertex" << make_pair("vertex", > "implicit_vertex"); > g.add_edge("brother", "sister", "sibling"); > if(g.find(make_pair("brother", "sister"))) > related = true; > > Could someone please elucidate on why it is > impossible/impractical/unnecessary/whatever for a > graph library to have such an interface? Should I > accept that the BGL is not the magic bullet graph > library and move on, or can this kind of simplicity be > somehow found within? > > Thanks in advance, > prs > > > __________________________________ > Do you Yahoo!? > Yahoo! Finance Tax Center - File online. File on time. > http://taxes.yahoo.com/filing.html > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost >

1 0

Re: boost::variant's and > 10 supported types
by Aleksey Gurtovoy 31 Mar '04

31 Mar '04

Eric Friedman writes: > Preston A. Elder wrote: > > How do I support > 10 types in a variant without having support for > > make_variant_over (since I wish to still support Borland and MSVC 6/.NET > > (aka. 7, not 7.1), as well as gcc). > > To solve your problem under the current implementation, you need a > greater value for BOOST_MPL_LIMIT_LIST_SIZE. I'm unfortunately not > attuned enough to the MPL implementation to know what is involved in > attaining this; I've CCed this to Aleksey Gurtovoy (the MPL maintainer), > who may be able to help you. Just #define-ing BOOST_MPL_LIMIT_LIST_SIZE to something that is a multiple of 10 (e.g. 20) before including Boost headers should work. -- Aleksey Gurtovoy MetaCommunications Engineering

1 0

Lambda question
by Anders Sundman 31 Mar '04

31 Mar '04

Hi all! I'm using the lambda library to compute the sum of squared differences, but I have encountered a puzzling problem. I would really appreciate if someone could explain it to me. This doesn't compile: std::inner_product(i1, i1+x, i2, 0.0, (_1 + _2), (_1*_1)(_1 - _2)); however, this does: std::inner_product(i1, i1+x, i2, 0.0, std::plus<double>(), (_1*_1)(_1 - _2)); The compiler message is very voluminous and hard to read. But I think this part might be of importance, the (double&, double) looks strange: /usr/include/c++/3.3/bits/stl_numeric.h:119: error: no match for call to `( boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambd a::arithmetic_action<boost::lambda::plus_action>, boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder <1> >, boost::lambda::lambda_functor<boost::lambda::placeholder<2> >, 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> > >) (double&, double)' /usr/include/boost/lambda/detail/lambda_functors.hpp:142: error: candidates are: typename T::sig<boost::tuples::null_type>::type boost::lambda::lambda_functor<Base>::operator()() const [with T = boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::la mbda::plus_action>, Many thanks in advance Anders Sundman

2 3

Error building Boost_1_30_0
by Albert Gome 31 Mar '04

31 Mar '04

Hi, I am build Boost_1_30_0 on HPUX11.11 using gcc 3.3.3. I m getting these errors. skipping Boost.Python library build due to missing or incorrect configuration couldn't find Python.h in "/usr/local/include/python2.2" . . . . . ...patience... ...found 2254 targets... ...updating 295 targets... gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits.o libs/regex/src/c_regex_traits.cpp: In static member function `static void boost::c_regex_traits<char>::update()': libs/regex/src/c_regex_traits.cpp:655: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:658: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:660: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:663: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) g++ -c -Wall -ftemplate-depth-100 -DBOOST_REGEX_NO_LIB=1 -DBOOST_REGEX_STATIC_LINK=1 -g -O0 -fno-inline -I"libs/regex/build" -I "/mnt/r7/apal3/lib/boost_1_30_0" -o "libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits.o" "libs/regex/build/../src/c_regex_traits.cpp" ...failed gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits.o... gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/c_regex_traits_common.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/cpp_regex_traits.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/cregex.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/fileiter.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/posix_api.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/regex.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/regex_debug.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/regex_synch.o gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/debug/runtime-link-dynamic/w32_regex_traits.o . . . . . ...skipped <libs!regex!build/libboost_regex.a/gcc/debug/runtime-link-dynamic>libboost_regex_debug.a for lack of <libs!regex!build/libboost_regex.a/gcc/debug/runtime-link-dynamic>libboost_regex_debug.a(c_regex_traits.o)... ...skipped <!libs!regex!build!bin-stage>libboost_regex_debug.a for lack of <libs!regex!build/libboost_regex.a/gcc/debug/runtime-link-dynamic>libboost_regex_debug.a... gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/release/runtime-link-dynamic/c_regex_traits.o libs/regex/src/c_regex_traits.cpp: In static member function `static void boost::c_regex_traits<char>::update()': libs/regex/src/c_regex_traits.cpp:655: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:658: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:660: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) libs/regex/src/c_regex_traits.cpp:663: call of overloaded `getlocale(int)' is ambiguous /usr/include/locale.h:114: candidates are: locale_data* getlocale(int) libs/regex/src/c_regex_traits.cpp:62: const char* <unnamed>::getlocale(int) g++ -c -Wall -ftemplate-depth-100 -DNDEBUG -DBOOST_REGEX_NO_LIB=1 -DBOOST_REGEX_STATIC_LINK=1 -O3 -finline-functions -Wno-inline -I"libs/regex/build" -I "/mnt/r7/apal3/lib/boost_1_30_0" -o "libs/regex/build/bin/libboost_regex.a/gcc/release/runtime-link-dynamic/c_regex_traits.o" "libs/regex/build/../src/c_regex_traits.cpp" ...failed gcc-C++-action libs/regex/build/bin/libboost_regex.a/gcc/release/runtime-link-dynamic/c_regex_traits.o... Does anybody know how to reolve this? Thnks Albert --------------------------------- Do you Yahoo!? Yahoo! Finance Tax Center - File online. File on time.

2 1

boost::variant's and > 10 supported types
by Preston A. Elder 31 Mar '04

31 Mar '04

Hi, How do I support > 10 types in a variant without having support for make_variant_over (since I wish to still support Borland and MSVC 6/.NET (aka. 7, not 7.1), as well as gcc). To be precise, I need 18 types to be supported. -- PreZ Founder The Neuromancy Society http://www.neuromancy.net

5 4

boost::filesystem::exists() & GetfileAttributesA
by Sebastian Orfino 31 Mar '04

31 Mar '04

Hi, I am experiencig a problem with exists() and its Windows implementation with GetFileAttributes API. I am using exists() prior to the scan of a directory to see if it exists; the fact is that on W2K (just tested it on that OS) after a day or two GetFileAttributesA() returns INVALID_FILE_ATTRIBUTES but the path does exists (it is a UNC-style path). After a restart of the app, all works fine. So, should I use exists() this way ? I don't know why not. Or just use directory_iterator and scan the hot-folder right away catching any exceptions ?. I don't want to iterate over a direcotry that doesn't exists if I could knew that in advance; besides, I don't know if that will work anyway. Does anyone know somthing about this GetFileAttributesA/boost::exists() behavior ? Thanks in advance, Sebastian.

4 6

vc7.1-stlport
by GoochRules! 31 Mar '04

31 Mar '04

Greetings, I am attempting to build boost using "-sTools=vc7.1-stlport". I have copied the STLport libaries to C:\src\lib. The STLport headers are in c:\src\include\stlport. I extracted the STLport archive to c:\src\STLport-4.6.1. I have tried STLPORT_PATH=c:\src, c:\src\lib, c:\src\include, and c:\src\include\stlport with STLPORT_VERSION unset, and set to 4.6.1, as well as both unset. Boost succeeds in building, yet does not link against the STLport libraries (as reported by depends.exe), but rather to MSVCP71.DLL and MSVCP71.DLL (the C++ and C runtime libraries provided by vc7.1 I presume). I have ensured that c:\src\lib is first in %LIB% and c:\src\include\stlport;c:\src\include; is first in %INCLUDE% Any suggestions for what my STLport setup should look like are appreciated, as well as pointers on getting boost to link against the STLport libraries. --Matthew Peltzer

3 3

Boost Python on Mac OS X
by James Mastro 31 Mar '04

31 Mar '04

Hello all, I'm trying to use Boost Python on Mac OS X 10.3. I'm following along with what is at http://www.boost.org/libs/python/doc/tutorial/doc/ building_hello_world.html. After using bjam like this: bjam -sTOOLS=darwin the following are built: libboost_python.dylib hello.so This seems to be correct. I'm not totally sure where they are supposed to go, so I put them in next to Python in the Python framework so Python could find them to import. It found them, but an "import hello" in Python resulted in: ImportError: Failure linking new module: ../../../../bin/boost/libs/python/build/libboost_python.dylib/darwin/ debug/shared-linkable-true/libboost_python.dylib: dyld: /Applications/MacPython-2.3/PythonIDE.app/Contents/MacOS/PythonIDE can't open library: ../../../../bin/boost/libs/python/build/libboost_python.dylib/darwin/ debug/shared-linkable-true/libboost_python.dylib (No such file or directory, errno = 2) Before putting the 2 libs in, "import hello" found nothing. So I assume Python is finding the hello module now, but not liking it. Can anyone show me where I've gone wrong? Many thanks. -jim

2 1

Installing pyste
by Yannick Patois 31 Mar '04

31 Mar '04

Hi, When running "bjam install" from top-level directory, even with PYTHON_ROOT set correctly, it only creates shared libs but doesnt build and install pyste. What should be done to install it properly ? I finally went to libs/python/pyste/install and executed: python setup.py install I would expect this to be wrapped in some top-level command. Did I miss something in the doc ? Thanks, Yannick

2 1

Compilation problems on Linux
by mayankg＠iiitb.ac.in 31 Mar '04

31 Mar '04

Hi, We are trying to use the libboost_python.so library in Linux with our project. When we try to compile the C++ file of our project having all the boost interfaces, we get the following compilation error only on Linux. Although on Windows it works fine. We are using the Python 2.2.3 and Boost 1.30.2 versions. /usr/include/boost/python/converter/as_to_python_function.hpp:28: sorry, unimplemented: ` method_call_expr' not supported by dump_expr /usr/include/boost/python/converter/as_to_python_function.hpp:28: sorry, unimplemented: ` method_call_expr' not supported by dump_expr /usr/include/boost/python/converter/as_to_python_function.hpp:28: sorry, unimplemented: ` method_call_expr' not supported by dump_expr /usr/include/boost/python/converter/as_to_python_function.hpp:28: sorry, unimplemented: ` method_call_expr' not supported by dump_expr Please help, Regards, Mayank

2 1

Location and namespace of a boost library (say, iterators)
by Deane Yang 31 Mar '04

31 Mar '04

I'm sorry if I'm being dumb about this, but I've run into the following difficulty a couple of times with boost libraries. I've decided to try using the new boost iterator library. Based on the documentation, I think I want to use iterator_adaptor. But scanning through the documentation, I don't immediately see - what namespace iterator_adaptor lives in. I assume it's just boost, but it probably doesn't hurt to mention this explicitly, since some boost libraries use sub-namespaces. - what header file to include. I couldn't find this in the documentation. I can figure all of this out, but it is helpful to have it specified in the documentation.

2 1

Installing Boost 1_30_0 on HPUX
by Albert Gome 31 Mar '04

31 Mar '04

Hi, I am new to BOOST and i like to install that on HPUX11.11. I have downloaded BOOST_1_30_0 and have gcc installed on HPUX. What is the efficient way of installing it. ie the parameters with the bjam. Thanks Albert __________________________________ Do you Yahoo!? Yahoo! Finance Tax Center - File online. File on time. http://taxes.yahoo.com/filing.html

2 1

[BGL] Finding out what properties exist in a graph?
by Steve Juranich 30 Mar '04

30 Mar '04

Is there an easy way to find out all of, for instance, the vertex properties associated with a graph? What I'm looking for is something like the following: <pseduocode> vector<properties> my_vertex_properties; property_iterator pi, last; for(tie(pi, last) = vertex_property_list(Graph); pi != last; ++pi) my_vertex_properties.push_back(*pi); </pseudocode> How about it? Does anything like this exist or am I just daydreaming again? Thanks. -- Stephen W. Juranich Science Applications Intl. Corp. (SAIC) (520) 570-7706

2 2

Serialization library
by Steve Folly 30 Mar '04

30 Mar '04

Hi, I'm looking using the Robert Ramey's serialization library for our own projects and would like to know it's current status. Obviously, it's not in 1.31.0, so what are the plans for it's future inclusion? Thanks. Steve.

2 1

graph, dfs search
by Peter Aronsson 30 Mar '04

30 Mar '04

Hi. I am having a problem with depth_first_search. The thing I do different is that I do not put any info in a property map and I do not want to bother myself with colormaps etc. The application code does: Graph g; pass2_visitor vis; depth_first_search(g,boost::visitor(vis)); But I get a compilation error, saying that it can not find a suitable operator+ in the property_map... See attached files for complete example. Grateful for all help! (I am running from HEAD on sourceforge cvs ) Regards Peter Aronsson -- _________________________________________________________________ / Peter Aronsson, Phd Student at PELAB (Programming Environments \ | Laboratory ) Department for Computer & Information Science | | Linköping University, Sweden | |=================================================================| | petar(a)ida.liu.se , phone +46 (0)13-28 1737 Room 3B:490 | \_________________________________________________________________/ #include "tg.hpp" int main() { TaskGraph g; pass2_visitor vis; depth_first_search(g,boost::visitor(vis)); } #ifndef _TASKGRAPH_H #define _TASKGRAPH_H #include <boost/config.hpp> #include <iostream> // for std::cout #include <utility> // for std::pair #include <algorithm> // for std::for_each #include <boost/utility.hpp> // for boost::tie #include <boost/graph/graph_traits.hpp> // for boost::graph_traits #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adjacency_iterator.hpp> #include <boost/graph/graphviz.hpp> #include <boost/graph/depth_first_search.hpp> //Task graph types using namespace std; using boost::tie; struct vertex_execcost_t { typedef boost::vertex_property_tag kind; }; struct vertex_unique_id_t { typedef boost::vertex_property_tag kind; }; struct edge_result_set_t { typedef boost::edge_property_tag kind; }; typedef boost::property<boost::vertex_name_t,string, boost::property<vertex_execcost_t,float, boost::property<vertex_unique_id_t, int > > > VertexProperty; typedef boost::property<boost::edge_weight_t, int > EdgeProperty; typedef boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, VertexProperty, EdgeProperty> TaskGraph; typedef boost::graph_traits<TaskGraph>::vertex_descriptor VertexID; class pass2_visitor : public boost::default_dfs_visitor { public: pass2_visitor(/* initialize containers to store stuff in*/) { }; template <typename Vertex, typename Graph> void discover_vertex(Vertex u, const Graph & g) const { // Do some stuff }; }; #endif

2 4

CVS import gotcha - beware!
by Steve Folly 29 Mar '04

29 Mar '04

Hi, Most of you are probably aware of this, but I just thought I'd share my experience with trying to import the new version of boost into our CVS repository using 'cvs import': It wasn't recognising new folders - e.g. boost/spirit/core and all it's contents. I was puzzling it for a while until I realised the import output was showing 'I' next to boost/spirit/core. Aha - it's ignored. DOH! Well, core files are ignored, aren't they! To all those who have been long suffering with this : don't forget to include '-I !' in the command to include all files!! I'll be happy if it helps at least one person! :) -- Regards, Steve.

1 0

RE: [Boost-users] Defining less on member variables/functions
by Chris Jurney 29 Mar '04

29 Mar '04

In this case, I could have used pair's operator<, but if I have a class by value as the second item of the pair that doesn't have a meaningful operator<, I want to ignore it in the sort. Thanks for all the help, guys. Chris -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Victor A. Wagner Jr. Sent: Friday, March 26, 2004 8:40 AM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Defining less on member variables/functions why do you want to sort ONLY on the 1st element of the pair? At Thursday 2004-03-25 11:34, you wrote: >content-class: urn:content-classes:message >Content-Type: multipart/alternative; > boundary="----_=_NextPart_001_01C41297.D800D40A" > >I've had this same pattern come up 4 or 5 times now, and each time I've >been unable to find a stl + boost solution that allowed me to do what I >want without writing my own less function. Basically, I want something >that will let me do a sort, or define a map on structs or pairs without >writing a less that compares the member variable or ..first. My last attempt: > >vector<pair<float, float>> myVector >std::sort(myVector.begin(), myVector.end(), _1.first < _2.first); > >No such luck. It looks like I can do operator * and & on lambda objects, >but not access members through them. Is there anything in boost, stl, or >elsewhere that lets me not write this: > >class myLess >{ > bool operator() (pair<float, float> a, pair<float, float>b) > {return a.first < b.first;} >} > >Thanks for any help, >Chris > > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users Victor A. Wagner Jr. http://rudbek.com The five most dangerous words in the English language: "There oughta be a law" _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Microsoft Managed C++
by Roger Wilco 29 Mar '04

29 Mar '04

I have a somewhat large (~100K lines) C++ server application. It uses Boost (lots of smart pointer use, thread use, regex), Xerces XML libraries, some MFC for GUI, and ADO for database access. I tried to build a test build of my application using Microsoft's Managed C++. I got all my code to compile, but I can't link to either Boost or Xerces XML. Is this possible? Has anyone done this? If I ultimately go the .NET route, I would replace Boost and Xerces with functionality provided by the native .NET runtime libraries. However, that would be a massive time consuming undertaking. At this point, I just want to dip my toes in the water and observe pros/cons of .NET, and have the option of migrating to .NET piecemeal. I have solid experience with C# and Java and I am extremely experienced with C++ (10 years). My main problems with C++ are: - Compile times. On my 2.8GHz dev system, a rebuild takes ~20 minutes and even a build after making a minor change takes 45 seconds. It's amazing how VC++ build speeds really have remained so stagnant despite increases in hardware speed. I realize VC++ is the slower of the IDEs for build times. - Debugging memory corruption or thread concurrency issues. This is much easier in Java/C# and the tools for assisting are much easier to use. I spent many days trying tools such as Purify for C++ and couldn't produce any fruitful results. - Diagnosing memory usage. My server application uses lots of memory. After running for several hours under production conditions it will reach around 400MB-1.3GB depending on the tasks its doing. I'd like to get a general overview of where this memory is being used. I don't suspect blatant memory leaks (new with no delete) but instead runaway caches or legitimate usage. These issues are of course still present in C#/Java but the diagnostic tools to address these issues seem to be much better. I haven't found any usable C++ tool for this issue and I rely on manually logging data points and manually trying to infer an idea of what is happening. - Java/C# is overall a better (easier/faster to develop/maintain) development platform for this type of server application work. However, I will happily stick with C++ if I can resolve these other issues. And I am of course, concerned about any performance hit when migrating to Java/C#. We max out CPU and RAM use, so these factors aren't important. I couldn't take more than a 25% drop in efficiency. Any other suggestions on my situation?

2 1

SQLite
by Witz 28 Mar '04

28 Mar '04

I don't know if this is the forum for bringing this up but ... I was wondering if anyone thinks SQLite might make a good addition to Boost - www.sqlite.org - if the author would agree to it. Ian Whittley

2 1

boost::format with non-standard string class
by Scott Lamb 27 Mar '04

27 Mar '04

Hi, I'm not real happy with std::string, largely because it seems poorly suited to UTF-8. I'm happier with other classes such as Glib::ustring. [1,2] Is it possible to use boost::format with such a class? I'd previously thought that boost as a whole expected you to use std::string, but the recent discussion of boost::regex + Glib::ustring gave me some hope. It seems the requirements for boost::regex are more simple - a bidirectional, read-only character (not byte) iterator. That should be easy enough to provide for any UTF-8 string class. I do see explicit mention of std::basic_string in the boost::format headers, but I thought I'd ask anyway. (I likely will find or make another class to avoid pulling in all of glib. But it would be similar to Glib::ustring.) [1] - more in-depth discussion of Glib::ustring vs. std::string at <http://www.gtkmm.org/gtkmm2/docs/reference/html/ classGlib_1_1ustring.html#_details> [2] - additional reasons for disliking std::string at <http://www.sgi.com/tech/stl/string_discussion.html> Thanks, Scott

1 0

boost/graph/push_relabel_max_flow::is_flow() bug?
by Arun Bhalla 27 Mar '04

27 Mar '04

Hi, I'm not really a user of Boost, but I've been referring to the Boost Graph Library code for another project. In particular, I've been looking at push_relabel_max_flow.hpp. I was writing a unit test which followed the same ideas of the is_flow() test, and it was failing on what should be a flow network with a valid maximum flow. The code in question: // a is an edge_descriptor if (capacity[a] > 0) if ((residual_capacity[a] + residual_capacity[reverse_edge[a]] != capacity[a]) || (residual_capacity[a] < 0) || (residual_capacity[reverse_edge[a]] < 0)) return false; I contend the test should actually be: // a is an edge_descriptor if (capacity[a] > 0) if ((residual_capacity[a] + residual_capacity[reverse_edge[a]] ! != capacity[a] + capacity[reverse_edge[a]]) || (residual_capacity[a] < 0) || (residual_capacity[reverse_edge[a]] < 0)) return false; I refer to an example network in CLR (1st ed.), p.589. There are several vertices, but I focus on vertices v1 and v2. In this graph, we have capacities c(v1,v2) = 10 c(v2,v1) = 4 and residual capacities cf(v1,v2) = 11 cf(v2,v1) = 3 With the above (original) test, it would fail because 11 + 3 (the sum of residual capacities) != the capacity of either edge. This would hold true if the sum of residual capacities were compared with the sum of capacities. Ordinarily this test would work if reverse_edge[a] has a capacity of 0, which would be the case if the edge (a) is in the flow network, but its reverse is not. I'm not a graph theory expert, though, so I defer to anyone who is. :) Thanks, Arun

1 0

Defining less on member variables/functions
by Chris Jurney 26 Mar '04

26 Mar '04

I've had this same pattern come up 4 or 5 times now, and each time I've been unable to find a stl + boost solution that allowed me to do what I want without writing my own less function. Basically, I want something that will let me do a sort, or define a map on structs or pairs without writing a less that compares the member variable or .first. My last attempt: vector<pair<float, float>> myVector std::sort(myVector.begin(), myVector.end(), _1.first < _2.first); No such luck. It looks like I can do operator * and & on lambda objects, but not access members through them. Is there anything in boost, stl, or elsewhere that lets me not write this: class myLess { bool operator() (pair<float, float> a, pair<float, float>b) {return a.first < b.first;} } Thanks for any help, Chris

6 8

Re: [Boost-users] MAC OS X installation of boost libs
by Michael Short 26 Mar '04

26 Mar '04

Hello I am using MAC OS X 10.3.3. First I done find the bjam tool? Second when I build the bjam tool myself I get the following error. Jamfile:71: in module scope rule unless unknown in module. I think if you could please just give me a quick step by step of what you did to setup the libs with the correct directorys you used then that would probably fix the problems. I did try following the instructions on the page you stated but just did not help. thanks Michael On Tuesday, March 23, 2004, at 09:25PM, James Mastro <jmastro(a)rochester.rr.com> wrote: >On Mar 22, 2004, at 5:12 PM, Michael Short wrote: > >> The only problem is that I am having problems installing and building >> the libs on my MAC OS X system. > >What kind of problems? What version of OS X? I built boost 1.31.0 on >OS X 10.3.2. I think the regex library gave me some problems, but I >believe everything else built OK. > >I just followed the directions here: > >http://www.boost.org/more/getting_started.html > >-jim > > >

4 7

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

RE: [Boost-users] boost::filesystem::exists() & GetfileAttributesA
by Ben Hutchings 24 Mar '04

24 Mar '04

Sebastian Orfino <sorfino(a)lanacion.com.ar> wrote: > I am experiencig a problem with exists() and its Windows > implementation with GetFileAttributes API. I am using exists() prior > to the scan of a directory to see if it exists; the fact is that on > W2K (just tested it on that OS) after a day or two > GetFileAttributesA() returns INVALID_FILE_ATTRIBUTES but the path > does exists (it is a UNC-style path). > After a restart of the app, all works fine. <snip> It couldn't possibly be related to this bug, could it: <http://support.microsoft.com/default.aspx?scid=kb;en-us;325929>? I know that that talks about Windows XP clients and NT 4 servers but MS does not always test thoroughly whether a bug found in one version of a product exists in other versions. The bug is supposed to be fixed in Windows XP SP2, by the way.

1 0

It always show compiler limitation when I use boost.python to wrap a class under MSVisualStudio .Net
by Shunming Fang 24 Mar '04

24 Mar '04

Hello, guys, I try build my c++ lib as python modules using boost.python, when compile one big class, it always show compiler limit( my ram already update to 1.5 GB) while the class can be smoothly build on other platforms like SGI, Linux(RAM 512 MB+). I don't know why? I already upgrade my MSVS .net to 2003Version, Anybody know How I can get around this problems? Thank you very much __________________________________ Do you Yahoo!? Yahoo! Finance Tax Center - File online. File on time. http://taxes.yahoo.com/filing.html

1 0

Boost error on Red Hat Linux 7.4
by Jonathan Arnold 24 Mar '04

24 Mar '04

I'm trying to build the latest (1.31.0) Boost libraries for the first time on a Red Hat Linux 7.4, gcc 2.96 system. It seems to build all the libs and such correctly, but I get the following error trying to build the test programs: gcc-C++-action bin/boost/libs/test/build/libboost_test_exec_monitor.so/gcc/debug/shared-linkable-true/test_tools.o /home/jdarnold/boost_1_31_0/libs/test/build/../src/test_tools.cpp: In method `void boost::test_toolbox::detail::print_log_value<char>::operator() (ostream &, char)': /home/jdarnold/boost_1_31_0/libs/test/build/../src/test_tools.cpp:194: parse error before `__ctype_b' /home/jdarnold/boost_1_31_0/libs/test/build/../src/test_tools.cpp:205: confused by earlier errors, bailing out set -e g++ -c -Wall -ftemplate-depth-100 -DBOOST_TEST_NO_AUTO_LINK=1 -g -O0 -fno-inline -fPIC -I"bin/boost/libs/test/build" -I "/home/jdarnold/boost_1_31_0" -o "bin/boost/libs/test/build/libboost_test_exec_monitor.so/gcc/debug/shared-linkable-true/test_tools.o" "/home/jdarnold/boost_1_31_0/libs/test/build/../src/test_tools.cpp" /usr/bin/objcopy --set-section-flags .debug_str=contents,debug "bin/boost/libs/test/build/libboost_test_exec_monitor.so/gcc/debug/shared-linkable-true/test_tools.o" What is going wrong here? Is my version of F++ too old? Thanks in advance. -- Jonathan Arnold (mailto:jdarnold@buddydog.org) Daemon Dancing in the Dark, a FreeBSD weblog: http://freebsd.amazingdev.com/blog/

1 0

Cannot use BGL & boost::format together under VS2003
by Alexeev Gleb 24 Mar '04

24 Mar '04

Hi all! The following simple sample doesn't compile on VC++ .NET 2003: #include <iostream> #include <boost/format.hpp> // without the following line everything's ok #include <boost/graph/adjacency_list.hpp> int main(){ std::cout << boost::format("%d, %s") % 5 % "some text"; return 0; } -- Best regards, Alexeev Gleb mailto:alexeev_gleb@hotbox.ru

2 2

boost/graph - induced subgraph
by Matthew Galati 24 Mar '04

24 Mar '04

Is it possible to find the minimum spanning tree of an induced subgraph? vector< graph_traits<Graph>::vertex_descriptor > vd; typedef subgraph< Graph > SubGraph; SubGraph & inducedG = subG.create_subgraph(vd.begin(), vd.end()); Here is the example I am looking at: induced verts: 1 2 3 4 5 7 Original Graph: 0 <--> 1 2 5 7 1 <--> 0 3 5 7 2 <--> 0 3 4 5 3 <--> 2 1 4 5 4 <--> 2 3 5 6 5 <--> 0 1 2 3 4 6 7 6 <--> 4 5 7 7 <--> 0 1 5 6 Induced Graph: 1 <--> 3 5 7 2 <--> 3 4 5 3 <--> 2 1 4 5 4 <--> 2 3 5 5 <--> 1 2 3 4 7 7 <--> 1 5 So, the "create_subgraph" seems to be working fine. But, when I run kruskals with: vector<graph_traits < SubGraph >::edge_descriptor> spanning_tree; kruskal_minimum_spanning_tree(inducedG, back_inserter(spanning_tree)); for (vei = spanning_tree.begin(); vei != spanning_tree.end(); ++vei) { pair<int,int> ij = incident(*vei, inducedG); int edge_index = e_index[*vei]; cout << "e_index: " << edge_index << " : " << ij.first << " " << ij.second << endl; I get a spanning tree of just 4 edges (while the subgraph has 6 vertices). Also, how does the edge_index of the subgraph correspond to the original graph? For example, edge (4,1) is not in the original graph, but it shows up in my spanning tree. Spanning Tree: e_index: 3 : 2 0 e_index: 7 : 4 0 e_index: 4 : 3 1 e_index: 8 : 4 1 Thanks, Matthew -- Matthew Galati ISE Lehigh University IBM Service Parts Solutions 610.758.4042 (Office) 610.882.0779 (Home) magh(a)lehigh.edu, magal11(a)us.ibm.com http://sagan.ie.lehigh.edu/mgalati/

4 3

boost-sandbox socket and boost 1.31.0?
by Robert Helgesson 23 Mar '04

23 Mar '04

Howdy, I'm wondering regarding the socket library found in boost-sandbox. Will it be updated to function nicely with the latest Boost release? The problem seems to be that boost::default_iterator_policies and boost::iterator_adaptor no longer work like the socket library expect. Regards -- / Robert Helgesson |-- rycee(a)home.se --\ \-- GPG Key ID: 41E95A5B --| http://www.rycee.cx/ /

3 2

Re: [Boost-users] obtaining vertex descriptor from property_map (newbie)
by Gustavo Sánchez 23 Mar '04

23 Mar '04

I tend to use a map<string, vertex_descriptor> for this. Doug Thanks for the idea, I was just thinking something like this, but I have a problem. I need the definition of the Graph typedef property<edge_name_t, std::string> EdgeProperty; typedef property<vertex_name_t, std::map<string,vertex_property??> > NameProperty; typedef property<vertex_index_t, std::size_t, NameProperty> VertexProperty; typedef adjacency_list<vecS, vecS, undirectedS, VertexProperty, EdgeProperty> UGraph; in order to get the vertex_descriptor, but I need the map<string,vertex_descriptor> for the VertexPorperty so I drop in a circular type dependency. Can you please be more verbose? thanks --------------------------------- Antivirus Filtros antispam 6 MB gratis ¿Todavía no tienes un correo inteligente?

2 1

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

linking to boost::thread
by Jerry 23 Mar '04

23 Mar '04

Hi, I've just built boost1.31.0 using bjam under Linux, apparently successfully. There don't appear to be any static libraries for boost::thread. Is this correct? If so, could someone please explain why I'm getting linker errors under g++ if I don't mention the _dynamic_ thread libs on the g++ command line, and "cannot open shared object file" at runtime if I do. Any pointers appreciated. TIA, Jerry.

2 1

shared_ptr help needed, please!
by Eric Damphousse 23 Mar '04

23 Mar '04

hi all, quick question concerning shared_ptr... not sure if things get deleted (destroyed) properly and its freaking me out. I hope this is not too long Basically, I use the BGL to store my data and that seems to be ok. The way the BGL stuff is defined is as such... Note that spObjectNode is defined as typedef boost::shared_ptr<CObject> spObjectNode // Set vertex properties typedef boost::property<boost::vertex_name_t, std::string> node_name_t; typedef boost::property<graph_node_t, spObjectNode, node_name_t> node_property_t; // Set edge properties typedef boost::property<boost::edge_name_t, std::string> connection_name_t; typedef boost::property<graph_connection_t, spObjectNode, connection_name_t> edge_property_t; // Set graph typedef adjacency_list<listS, vecS, bidirectionalS, node_property_t, edge_property_t> graph_t; // graph_t m_Graph; The function below is what I use to add a node to the BGL... template <typename T> void AddNode(const T& object) { // Create the vertex boost::shared_ptr<T> pNode(new T(object)); // Add the vertex + its name to the graph vertexdescriptor_t newNode = boost::add_vertex(node_property_t(pNode, node_name_t(pNode->GetObjectName())), m_Graph); }; The way I use the AddNode ... for example in a main.cpp: /// blablabla above CSphere sphere("sphere1"); CSceneDB::Instance().AddNode(sphere); return 0; For testing purposes, in the base class and derived classes (see below) I print a message in the destructor of the class, just to make sure things are ok. If I just have in my main the previous call then upon exit I expect and get the following message... CSceneDB cleanup CSphere cleanup CGeometry cleanup CObject cleanup Now for the source of my anxiety... I wrote a function to get back my object from the BGL and it goes like this... inline boost::shared_ptr<CObject> getNodeProperty(const vertexdescriptor_t& vertex) { boost::property_map<graph_t, graph_node_t>::type node_prop_map; node_prop_map = boost::get(graph_node_t(), m_Graph); return node_prop_map[vertex]; } boost::shared_ptr<CObject> CSceneDB::getNodebyName(const std::string& strName) { boost::shared_ptr<CObject> node_prop; boost::graph_traits<graph_t>::vertex_iterator vi, vi_end; boost::tie(vi, vi_end) = boost::vertices(m_Graph); for(; vi != vi_end; ++vi) { node_prop = getNodeProperty(*vi); if(node_prop != 0) { if(node_prop->GetObjectName() == strName) break; } } return node_prop; } template <typename T> boost::shared_ptr<T> getNode(const std::string& strName) { boost::shared_ptr<CObject> abc = getNodebyName(strName); shared_ptr<T> def = boost::dynamic_pointer_cast<T>(abc); return def; } The problem is that if I do something like this... in the main.cpp /// blablabla stuff above CSphere sphere("sphere1"); CSceneDB::Instance().AddNode(sphere); boost::shared_ptr<CSphere> abc = CSceneDB::Instance().getNode<CSphere>("sphere1"); return 0; I only get upon exit... CSceneDB cleanup what happened to CSphere cleanup, CGeometry cleanup and CObject cleanup, are they leaking? Now for a sanity check, if I do in the main.cpp ... i do NOT do the assignment boost::shared_ptr<CSphere> abc = /// blablabla stuff above CSphere sphere("sphere1"); CSceneDB::Instance().AddNode(sphere); CSceneDB::Instance().getNode<CSphere>("sphere1"); return 0; upon exit i get ... CSceneDB cleanup CSphere cleanup CGeometry cleanup CObject cleanup Can someone tell me why this is, is my assignment wrong? Any help would be greatly appreciated Eric Brief description of the classes used ofr my test // Object.h class CObject { protected: CObject(){}; protected: virtual ~CObject(){cout << "CObject cleanup" << endl;}; }; typedef boost::shared_ptr<CObject> spObjectNode; // Geometry.h class CGeometry : public CObject { protected: CGeometry(){}; protected: virtual ~CGeometry(){cout << "CGeometry cleanup" << endl;}; }; // Sphere.h class CSphere : public CGeometry { public: CSphere(){}; ~CSphere(){cout << "CSphere cleanup" << endl;}; };

3 4

dumb question: iterator dynamic_cast adapter?
by Paul Elliott 22 Mar '04

22 Mar '04

I am trying to figure out iterators and I have a dumb question: I have an iterator A_iter, that can traverse in both directions ( A_iter++ and A_iter-- ) and can do input (operator*()). Value_type = type of *A_iter is A; and A is static_cast able to B: A start; B fish = static_cast<B>(start); // OK How do I use adapters to create B_iter, which is the same as A_iter, but whose value_type= typeof *B_iter is B? I am sorry if this is a dumb question. -- Paul Elliott 1(512)837-1096 pelliott(a)io.com PMB 181, 11900 Metric Blvd Suite J http://www.io.com/~pelliott/pme/ Austin TX 78758-3117

2 1

obtaining vertex descriptor from property_map (newbie)
by Gustavo Sánchez 22 Mar '04

22 Mar '04

Dear all, We have a graph which has a property of type string associated with the vertexes. What we want to do is to obtain a vertex descriptor from a string. Could you please tell us how to implement it? Thank you in advance! --------------------------------- Antivirus Filtros antispam 6 MB gratis ¿Todavía no tienes un correo inteligente?

2 1

Controlling selection of runtime libraries
by Bob Kline 22 Mar '04

22 Mar '04

We're using Boost's regex package in a Windows environment for a server built with Microsoft Visual Studio 7.x. We'd like to be able to build our server with debugging symbols for our own code, but still use the release versions of the Microsoft runtime DLLs (because the debugging versions of the Microsoft runtime DLLs aren't redistributable, so we can't legally install them on our production server). The problem is, when we compile our own code for debugging (with -Zi and -D_DEBUG), the Boost headers detect this and do their behind-the-curtain magic to point to a version of the regex package which is linked to the debugging versions of the runtime libraries (msvcr71d and msvcp71d). We've tried using the BOOST_REGEX_NO_LIB trick, specifying the version of the regex library to which we want to link (boost_regex_vc7_mdi.lib) but this doesn't work, because although it compiles fine, the linker chokes complaining about the inability to find a bunch of severely mangled names. What's the *real* trick for using the version of the library we want? Do we need to hack the distributed makefile each time we upgrade regex? (Or worse, shuffle libraries around by renaming them?) Thanks. Bob Kline

3 4

Re: boost-sandbox socket and boost 1.31.0?
by Hugo Duncan 22 Mar '04

22 Mar '04

Robert Helgesson <rycee(a)home.se> wrote: > I'm wondering regarding the socket library found in boost-sandbox. Will > it be updated to function nicely with the latest Boost release? Hi, I have something similar that works with current boost CVS code. I have uploaded this to http://sourceforge.net/projects/giallo/ in an attempt to get this moving again. So far I have low level wrappers for sockets and named pipes. Documentation, tests are lacking. I will be adding the reactor code that I uploaded to the yahoo groups files section in due course. Hugo ps Thanks Jeff for pointing me at this post

1 0

Re: Trouble building libbgl-viz.a
by Vladimir Prus 22 Mar '04

22 Mar '04

Steve Juranich wrote: Hi Steve, sorry that it took quite some time to reply, > My version of graphviz_graph_parser.hpp has the following (lines 55-58): > > #ifndef YYSTYPE > typedef int yystype; > # define YYSTYPE yystype > #endif > > So it looks like the test is different as well as the #define arguments > being switched around. > > When I changed my lines to match your lines, I was able to get the > graphviz_graph_lex.o file, but the build chokes again when it tries to > re-run with -DGRAPHVIZ_DIRECTED=1. Could you modify yystype.h to read: #ifndef BOOST_GRAPH_YYSTYPE_H #define BOOST_GRAPH_YYSTYPE_H union yystype { int i; void* ptr; }; #define YYSTYPE yystype #endif // BOOST_GRAPH_YYSTYPE_H This works for me and it if works for you as well, I'll commit the change. - Volodya

2 2

RE: [Boost-users] regular expression searching for Glib::ustring??
by Ben Hutchings 19 Mar '04

19 Mar '04

Paul Elliott <pelliott(a)io.com> wrote: > On Thu, Mar 18, 2004 at 04:08:59PM -0000, Ben Hutchings wrote: > > Paul Elliott <pelliott(a)io.com> wrote: > > > I am using Gtkmm. I want to do boost regular expression searching > > > on Glib::ustring. <snip> > > > How would you set up boost regex to search if both the regular > > > expression and the string to be searched is a ustring? <snip> > > To create a regex from a ustring I would write something like this: > > > > boost::reg_expression<gunichar, unicode_regex_traits> re; > > In the above, you have unicode_regex_traits, which is necessary > because when I tried: > > boost::basic_regex<gunichar> regular_expression; > > I got the following error message: <snip > So this means that regex_traits<gunichar> does not work, and I > must code my own substitute for regex_traits<gunichar>. > > What are the requirements for such a traits structure? I already told you: > > I am using Boost 1.30, in which the traits are documented in > > <boost/libs/regex/traits_class_ref.htm>. I don't know whether that > > documentation still applies to 1.31. Ben.

1 0

singleton_pool compile error
by ukropina＠sfu.ca 19 Mar '04

19 Mar '04

Hi I'm trying to compile the sample code for singleton pool from http://www.boost.org/libs/pool/doc/interfaces.html just to learn how to use singleton pool. Here is the code. struct MyPoolTag { }; typedef boost::singleton_pool<MyPoolTag, sizeof(int)> my_pool; void func() { for (int i = 0; i < 10000; ++i) { int * const t = my_pool::malloc(); } my_pool::purge_memory(); } but I keep geting this error: Compiling... main.cpp c:\program files\microsoft visual studio\vc98\include\xmemory(59) : error C2248: 'object_creator' : cannot access private struct declared in class 'boost::details::pool::singleton_default<struct boost::singleton_pool<struct MyPoolTag,4,struct boost: :default_user_allocator_new_delete,class boost::details::pool::win32_mutex,32>::pool_type>' e:\lib\boost\boost\pool\detail\singleton.hpp(63) : see declaration of 'object_creator' c:\program files\microsoft visual studio\vc98\include\xmemory(59) : while compiling class-template static data member 'struct boost::details::pool::singleton_default<struct boost::singleton_pool<struct MyPoolTag,4,struct boost::default_user_ allocator_new_delete,class boost::details::pool::win32_mutex,32>::pool_type>::object_creator ol_type>::create_object' Error executing xicl6.exe. I'm using MS Visual C++ 6.0 SP5 on windows XP. What am I doing wrong ? Does anyone have a sample code for singleton pool that works on windows ? Thanks Nenad boost::details::pool::singleton_default<boost::singleton_pool<,4,boost::defa ult_user_allocator_new_delete,boost::details::pool::win32_mutex,32>::po

2 1

regular expression searching for Glib::ustring??
by Paul Elliott 19 Mar '04

19 Mar '04

I am using Gtkmm. I want to do boost regular expression searching on Glib::ustring. http://www.gtkmm.org/gtkmm2/docs/reference/html/classGlib_1_1ustring.html This class represents characters in UTF-8, so each character in the buffer is represented by a varriable number of bytes. But it does have a bidirectional iterator. How would you set up boost regex to search if both the regular expression and the string to be searched is a ustring? Does one need to override any of the types defiened in regex_traits? Thank you. BTW. Quote from:http://www.boost.org/libs/regex/doc/regex_traits.html "Under construction. The current boost.regex traits class design will be migrated to that specified in the regular expression standardization proposal." This is not very useful to someone trying to use the boost_regex library now! -- Paul Elliott 1(512)837-1096 pelliott(a)io.com PMB 181, 11900 Metric Blvd Suite J http://www.io.com/~pelliott/pme/ Austin TX 78758-3117

2 1

RE: [Boost-users] regular expression searching for Glib::ustring??
by Ben Hutchings 18 Mar '04

18 Mar '04

Paul Elliott <pelliott(a)io.com> wrote: > I am using Gtkmm. I want to do boost regular expression searching on > Glib::ustring. > http://www.gtkmm.org/gtkmm2/docs/reference/html/classGlib_1_1ustring.htm l > > This class represents characters in UTF-8, so each character in the > buffer is represented by a varriable number of bytes. But it does > have a bidirectional iterator. > > How would you set up boost regex to search if both the regular > expression and the string to be searched is a ustring? > > Does one need to override any of the types defiened in regex_traits? The character type should be gunichar. > Thank you. > > BTW. > Quote from:http://www.boost.org/libs/regex/doc/regex_traits.html > > "Under construction. > The current boost.regex traits class design will be migrated to > that specified in the regular expression standardization proposal." > > This is not very useful to someone trying to use the boost_regex > library now! I am using Boost 1.30, in which the traits are documented in <boost/libs/regex/traits_class_ref.htm>. I don't know whether that documentation still applies to 1.31. You don't necessarily need custom traits to use custom iterator types. However, you do need to define custom traits to make character classes, case folding and so on work for all Unicode characters. To create a regex from a ustring I would write something like this: boost::reg_expression<gunichar, unicode_regex_traits> re; re.assign(s.begin(), s.end(), flags); When searching in a ustring I would write code like: my_predicate pred; boost::regex_grep(pred, s.begin(), s.end(), re, flags); boost::match_results<Glib::ustring::const_iterator, std::allocator<gunichar> > results; boost::regex_search<Glib::ustring::const_iterator, std::allocator<gunichar>, gunichar, unicode_regex_traits, std::allocator<gunichar> >( s.begin(), s.end(), results, re, flags); Glib::ustring result; boost::regex_merge( std::back_inserter(result), source.begin(), source.end(), re, std::basic_string<gunichar>(repl.begin(), repl.end())), flags); (The above is untested as we're not actually using Gtkmm but it's based on what we're doing with our own UTF-8 and UTF-16 strings.)

2 1

RE: [Boost-users] regular expression searching for Glib::ustring??
by Yarwood, Martin (UK) 18 Mar '04

18 Mar '04

> "Under construction. > The current boost.regex traits class design will be migrated to > that specified in the regular expression standardization proposal." > > This is not very useful to someone trying to use the boost_regex > library now! > I'm sure they'll give you a full refund ******************************************************************** This email and any attachments are confidential to the intended recipient and may also be privileged. If you are not the intended recipient please delete it from your system and notify the sender. You should not copy it or use it for any purpose nor disclose or distribute its contents to any other person. ********************************************************************

1 0

adjacency_matrix BGL problem
by Gustavo Sánchez 18 Mar '04

18 Mar '04

Hi everybody, Is it posible to resize a graph with this representation?. The idea is start with an empty matrix and add vertex based on the new vertices and edges we read. That is, we read a new edge and if their vertex aren't in the graph we add them and then the edge. Is this posible in an adjacency_matrix representation??? Thanks a lot. --------------------------------- Antivirus Filtros antispam 6 MB gratis ¿Todavía no tienes un correo inteligente?

2 1

problem with vertex properties in BGL
by Gustavo Sánchez 17 Mar '04

17 Mar '04

I have to build a graph from data in a file, some information is strings which are related to vertexes. I want to prove if those vertexes already exist in the graph before the insert operation. Next is the source: typedef adjacency_matrix<undirectedS,VertexProperty,EdgeProperty> UGraph; // an undirected graph UGraph g(0); // start from scratch property_map<UGraph, edge_name_t>::type ename = get(edge_name, g); // not sure if this is right (the graph have no elements at this point) property_map<UGraph, vertex_name_t>::type vname = get(vertex_name, g); typedef property_map<UGraph, vertex_name_t>::type vname_type; typedef boost::property_traits<vname_type>::key_type vktype; typedef boost::property_traits<vname_type>::value_type vvtype; vktype indice_nombre; vvtype valor_nombre; for(i=0;i<datgen.NumHilos;i++){ valor_nombre = hiloNormal[i].viaOrigen; /// here we get the string indice_nombre = vname[valor_nombre]; /// here I try to get the index /// I think this is not posible because there isn't [] operator in this way valor_nombre = vname[1]; /// if I do this the compiler is right but that isn't useful for me because the information I have is the string not the index.I can use vertex iterators and search for the string, but if posible i prefer not to do that. thanks a lot. --------------------------------- Antivirus Filtros antispam 6 MB gratis ¿Todavía no tienes un correo inteligente?

2 1

Bug in Boost Graph Library?
by Heiko Bauke 17 Mar '04

17 Mar '04

Dear all, today I was engaged in searching for a bug in my program. After a while I figured out that boost::num_egdes behaves not as I expected. If G is an undirected adjacency matrix graph boost::num_egdes(G) returns the number of edges in the graph G plus the number of edges in G that are no self edges. That means almost all edges are counted twice in undirected adjacency matrix graphs. In my oppinion this behaviour is a bug. At least it makes the BGL-user's live unnecessary difficult. Let's considder the following program: #include <cstdlib> #include <iostream> #include <boost/tuple/tuple.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adjacency_matrix.hpp> template <typename Graph> void add_edges(const char * const c) { std::cout << c; Graph G(6); boost::graph_traits<Graph>::vertex_iterator v, vbegin, vend; boost::tie(vbegin, vend)=boost::vertices(G); for (v=vbegin; v!=vend; ++v) { boost::add_edge(*vbegin, *v, G); std::cout << ' ' << boost::num_edges(G); } std::cout << std::endl; } int main() { typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> adjacency_list; typedef boost::adjacency_matrix<boost::undirectedS> adjacency_matrix; add_edges<adjacency_list>("adjacency list graph :"); add_edges<adjacency_matrix>("adjacency matrix graph :"); return EXIT_SUCCESS; } It prints to stdout: adjacency list graph : 1 2 3 4 5 6 adjacency matrix graph : 1 3 5 7 9 11 So the result of the template function add_edges in the program above depends of the graph container that the function add_edges is applied to. I think this is verry unintuitive and boost::num_edges should be changed, so that alls edges in undirected adjacency matrix graphs are counted only once. Or is there a special reason that boost::num_edges is implemented in this way? with regards, Heiko -- -- Gute Sitten haben für die Gesellschaft mehr Wert als alle -- Berechnungen Newtons. (Friedrich II., der Große, 1712-1786) -- Supercomputing in Magdeburg @ http://tina.nat.uni-magdeburg.de -- Heiko Bauke @ http://www.uni-magdeburg.de/bauke

2 1

RE: [Boost-users] boost::thread problem
by Ben Hutchings 17 Mar '04

17 Mar '04

Pete <petehug(a)paradise.net.nz> wrote: > I'm having a problem with my boost multithreaded application. > My app runs fine as a Windows Service, but as a Unix daemon it > stops responding after some time. I noticed that the fewer > threads I have available, the quicker the application stops > responding: HP-UX(64) after 20mins, RH8(256) after >1hr, Linux > RH9(1024) >5hrs. This led me to assume that perhaps the threads > are not cleaned up properly. That could well be right. Perhaps there is some kind of deadlock at thread exit? > Therefore, I wrote a little test app which ought to demonstrate > the problem. To my surprise, the test application showed an > entirely different problem, but again, only under Unix (it > works as expected under Windows). I'm totally lost what the > reason is and appreciate any help. > > Expected: Actual: > --------------- --------------- > Start running Start running > Start swimming Finish running > Start cycling Start swimming > Finish swimming Finish swimming > Finish cycling Start cycling > Finish running Finish cycling > > In windows I get the actual output but under Linux RH9, I get > the Actual output. Under RH9, the first five lines of the > actual output appear immediately, but the last one takes > approx. 4secs. In other words, only the last threads don't > sleep the number of secs specified. According to the manual page: "sleep() makes the current process sleep until seconds sec- onds have elapsed or a signal arrives which is not ignored." (Note that each POSIX thread is/was implemented as a process in Linux.) If thread creation involves receiving a signal then that would explain the above behaviour. I would expect it under RH8 because that has the old LinuxThreads implementation of pthreads that uses signals heavily, but not in RH9 which has NPTL. Still, you would be better off using boost::thread::sleep() instead.

1 0

boost::thread_group design flaw
by Pete 17 Mar '04

17 Mar '04

I'm pretty convinced that there is a serious design flaw in boost::thread_group or at the very minimum, the documentation should better address the issue. Let's take a look at the thread_group.cpp example provided with boost::thread: #include <boost/thread/thread.hpp> #include <iostream> int count = 0; boost::mutex mutex; void increment_count() { boost::mutex::scoped_lock lock(mutex); std::cout << "count = " << ++count << std::endl; } int main(int argc, char* argv[]) { boost::thread_group threads; for (int i = 0; i < 10; ++i) threads.create_thread(&increment_count); threads.join_all(); } This example works fine until I make the following small change to main() which breaks it: int main(int argc, char* argv[]) { boost::thread_group threads; for (int j = 0; j < 2; ++i) { for (int i = 0; i < 10; ++i) threads.create_thread(&increment_count); threads.join_all(); } } The above code will break the second time threads.join_all() is called. The problem is that all boost::thread objects created in the first iteration survive the join_all() call. Worse still, the 2nd join_all() call sends another join() message to each thread it created but boost::thread::join() does not check the m_joinable flag and simply tries to free the system resources it previously freed again causing a system fault. To correct the problem above, I can change the code as follows: int main(int argc, char* argv[]) { boost::thread* pt[10]; boost::thread_group threads; for (int j = 0; j < 2; ++i) { for (int i = 0; i < 10; ++i) pt[i] = threads.create_thread(&increment_count); threads.join_all(); for (int i = 0; i < 10; ++i) threads.remove_thread(pt[i]); } } While this code no longer causes a GPF, I do not believe that the boost::thread objects created by boost::thread_group::create_thread() actually ever get destroyed. I have set a break point in boost::thread::~thread() but this breakpoint is never reached. If I physically delete each pt[i] after removing it from the thread_group I'm getting an assertion error telling me that the pointer I'm trying to delete is not a valid debug-heap pointer, but this error will most likely disappear if I stop using the debug heap (I haven't tried yet). As a boost::thread_group user, I made the following assumptions: - a boost::thread created through boost::thread_group::create_thread will be removed and cleaned up properly when a) the thread terminates or b) the thread_group is deleted - after returning from a call to join_all() the boost::thread_group has no boost::thread object members - I need not specifically keep track of boost::thread objects created by boost::thread_group and destruction of these objects is encapsulated within boost::thread_group I now find that none of these assumptions is quite correct. Perhaps I good immediate remedy would be to implement a boost::thread_group::clear() method which would throw an error if any of the threads where still in a running state and else would clear its threads collection and destroy the objects? How about thread objects "remembering" their membership in a thread_group so that the thread group can be informed when a thread terminates?

3 3

boost::thread problem
by Pete 17 Mar '04

17 Mar '04

I'm having a problem with my boost multithreaded application. My app runs fine as a Windows Service, but as a Unix daemon it stops responding after some time. I noticed that the fewer threads I have available, the quicker the application stops responding: HP-UX(64) after 20mins, RH8(256) after >1hr, Linux RH9(1024) >5hrs. This led me to assume that perhaps the threads are not cleaned up properly. Therefore, I wrote a little test app which ought to demonstrate the problem. To my surprise, the test application showed an entirely different problem, but again, only under Unix (it works as expected under Windows). I'm totally lost what the reason is and appreciate any help. Expected: Actual: --------------- --------------- Start running Start running Start swimming Finish running Start cycling Start swimming Finish swimming Finish swimming Finish cycling Start cycling Finish running Finish cycling In windows I get the actual output but under Linux RH9, I get the Actual output. Under RH9, the first five lines of the actual output appear immediately, but the last one takes approx. 4secs. In other words, only the last threads don't sleep the number of secs specified. #include <string> #include <list> #include <iostream> #include <unistd.h> #include <boost/thread/thread.hpp> class MyThread { protected: std::string m_strName; int m_iDuration; public: MyThread(const std::string & s, int i) : m_strName(s), m_iDuration(i) {} void operator()() { std::cout << "Start " << m_strName << std::endl; sleep(m_iDuration); std::cout << "Finish " << m_strName << std::endl; } }; int main(int argc, char *argv[]) { std::list<MyThread*> lst; std::list<MyThread*>::iterator itr; MyThread* pT; boost::thread_group tg; lst.push_back(new MyThread("running", 6)); lst.push_back(new MyThread("swimming", 2)); lst.push_back(new MyThread("cycling", 4)); for (itr = lst.begin(); itr != lst.end(); itr++) { pT = *itr; tg.create_thread(boost::ref(*pT)); } tg.join_all(); while (!lst.empty()) { delete lst.front(); lst.pop_front(); } return 1; }

2 1

Trouble building libbgl-viz.a
by Steve Juranich 16 Mar '04

16 Mar '04

Here's my system specs (let me know if I'm leaving something out): SuSE Linux 8.2 gcc v. 3.3 barbet (juranich)$ g++ -v Reading specs from /usr/lib/gcc-lib/i486-suse-linux/3.3/specs Configured with: ../configure --enable-threads=posix --prefix=/usr --with-local-prefix=/usr/local --infodir=/usr/share/info --mandir=/usr/share/man --libdir=/usr/lib --enable-languages=c,c++,f77,objc,java,ada --disable-checking --enable-libgcj --with-gxx-include-dir=/usr/include/g++ --with-slibdir=/lib --with-system-zlib --enable-shared --enable-__cxa_atexit i486-suse-linux Thread model: posix gcc version 3.3 20030226 (prerelease) (SuSE Linux) flex v. 2.5.4 bison v. 1.75 Description of problem: When I cd into $BOOST/libs/graph/src and type 'make', I get the following errors: barbet:/local/src/boost_1_31_0/libs/graph/src # make flex -Pbgl_undir_ -ographviz_graph_lex.cpp graphviz_lex.ll bison -p bgl_undir_ -d -v -o graphviz_graph_parser.cpp graphviz_parser.yy graphviz_parser.yy: warning: 1 shift/reduce conflict g++ -ftemplate-depth-50 -DGRAPHVIZ_DIRECTED=0 -I../../.. -g -c graphviz_graph_lex.cpp graphviz_lex.ll: In function `int bgl_undir_lex(yystype*)': graphviz_lex.ll:85: error: request for member `ptr' in `*lvalp', which is of non-class type `int' graphviz_lex.ll:87: error: request for member `ptr' in `*lvalp', which is of non-class type `int' make: *** [graphviz_graph_lex.o] Error 1 So, line 85 in graphviz_lex.ll looks like this: I've looked at the source with a friend who (unlike myself) actually has some experience with lex and yacc, but he couldn't spot the problem either. I know that the caveat at the top of the file says that the makefile probably won't work on my system, so are there any suggestions on what I could do to make it work? Thanks a lot. -- Stephen W. Juranich Science Applications Intl. Corp. (SAIC) (520) 570-7706

2 4

RE: [Boost-users] VC 7.1 & boost.thread
by Ben Hutchings 16 Mar '04

16 Mar '04

raja <raja(a)genesyslab.com> wrote: > Hi, > I am getting the following error. I see that it is trying to link to > the static library, but I still get this error. It's not trying to link to the static library - you are. > Would appreciate if someone can correct my usage. > Linking to lib file: lib"boost_thread"-vc71-mt-sgd-1_31.lib > > c:\Boost\include\boost-1_31\boost\config\auto_link.hpp(269) : > fatal error > C1189: #error : "Mixing a dll boost library with a static runtime is a > really bad idea..." <snip> In your project's properties, under C/C++ > Code Generation, set the Runtime Library to be "Multi-threaded DLL" in the release configuration and "Multi-threaded Debug DLL" in the debug configuration. If you are not using the Visual Studio IDE then use the /MD and /MDd compiler switches respectively.

1 0

General problem on compiling a boost regex code...
by Benjamin Kaiser [gamigo AG] 16 Mar '04

16 Mar '04

Hello, I'm using the boost library for the first time, and I get a compiler error. :-( I don't know why, because I think the boost library is installed successful (I have tested the SuSE rpm file and the download version from boost.org) I'm using gcc 3.x and boost 1.30 on SuSE Linux 9.0... Header file: ------------------------------------------- #include <string> #include <fstream> #include <syslog.h> #include <boost/regex.hpp> #include <vector> using namespace boost; ------------------------------------------- CPP file: ------------------------------------------- ... regex expression("([0-9]+)(\\-| |$)(.*)"); ... ------------------------------------------- Thats all I do alluded to the boost regex library... if I want to compile the files, I get the following compiling error: ------------------------------------------- #g++ -ansi -pedantic-errors -Wall -o statd ./projekt/statd.cpp compiling C++ using -ansi -pedantic-errors -Wall -o statd /tmp/cc2KYvxs.o(.text+0x1951): In function `Accounting::SaveTraffic()': : undefined reference to `boost::reg_expression<char, boost::regex_traits<char>, std::allocator<char> >::reg_expression[in-charge](char const*, unsigned, std::allocator<char> const&)' /tmp/cc2KYvxs.o(.text+0x1994): In function `Accounting::SaveTraffic()': : undefined reference to `boost::reg_expression<char, boost::regex_traits<char>, std::allocator<char> >::~reg_expression [in-charge]()' collect2: ld returned 1 exit status ------------------------------------------- It would be nice if someone can help me with this problem... I'm new at C++ and don't know how to fix this. :-( If I only include the regex.hpp and do the "using namespace boost" everything is compiling fine. Only if I do the "regex expression(...)" in the CPP File I get the errors... :-( Many thanks for help! If someone will help me via ICQ: 20320644 Mit freundlichen Grüßen / With best regards Benjamin Kaiser Systemprogrammierer gamigo® AG -Deutschland - Butterstr. 13 48431 Rheine Tel. +49 5971-899060 Fax +49 5971-8990611 bkaiser(a)gamigo.de (DH/DSS) PGP-Key auf Anfrage / PGP-Key on request! -------------------------------------------------- Diese E-Mail enthält vertrauliche und / oder rechtlich geschützte Informationen. Wenn Sie nicht der richtige Adressat sind oder diese E-Mail irrtümlich erhalten haben, informieren Sie bitte sofort den Absender und vernichten Sie diese Mail. Das unerlaubte Kopieren sowie die unbefugte Weitergabe dieser Mail ist nicht gestattet. This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and destroy this e-mail. Any unauthorised copying, disclosure or distribution of the material in this e-mail is strictly forbidden.

1 0

Re: [Boost-users] regex with msvc-stlport
by Juan Casanueva 16 Mar '04

16 Mar '04

Hi John, I removed BOOST_REGEX_DECL from re_custom_error_messages, re_ten_w, and re_zero_w and It now works perfectly thanks! Juan >Date: Mon, 15 Mar 2004 13:49:51 -0000 >From: "John Maddock" <john(a)johnmaddock.co.uk> >Subject: Re: [Boost-users] regex with msvc-stlport1 >To: <boost-users(a)lists.boost.org> >Message-ID: <03ff01c40a94$68740cd0$ce810252@fuji> >Content-Type: text/plain; charset="iso-8859-1" > > > I have installed stlport 4.6 and tryed to compile regex but I get the >same > > error. > > > > it creates the .lib fine, but then give some unresolved externals when > > creating the dll.. > > what are your setting in regex\user.hpp??? > >Nothing don't change it. > > > if anyone has any idea, I would apreciate it > > thanks > >The only thing I notice is that the errors are only coming from the release >dll build (and not the debug version), is that correct? > >If so it explains why I can't reproduce it, as I only have the standard >edition of vc6 available to me (which doesn't create optimised builds). > >I also notice that the symbols that the linker is complaining about, >probably don't need to be exported anyway, so can you go into both >c_regex_traits.cpp and w32_regex_traits.cpp and remove the BOOST_REGEX_DECL >specifier from the following identifiers: > >re_custom_error_messages >re_ten_w >re_zero_w > >and see if that fixes the issue? If it does be sure to let me know so that >I can patch up the source, > >Thanks, > >John. > > > >------------------------------ > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users > >End of Boost-users Digest, Vol 144, Issue 2 >******************************************* _________________________________________________________________ Add photos to your messages with MSN 8. Get 2 months FREE*. http://join.msn.com/?page=features/featuredemail

2 1

random library fibonacci bug
by Martin Wartens 16 Mar '04

16 Mar '04

There seems to be a bug in the fibonacci random generators. Only the smaller lagged_fibonacci generators work. Code Sample (tested with VC7.1) follows. The debugger says: Run-Time Check Failure #0 - The value of ESP was not properly saved across a function call. This is usually a result of calling a function declared with one calling convention with a function pointer declared with a different calling convention. //lagged_fibonacci4423 and smaller works, //>=9689 fails typedef boost::lagged_fibonacci9689 rng_type; rng_type rng; rng.seed((unsigned)time( NULL )); boost::uniform_int<size_t> uni(0,len-1); //crashes on this line. boost::variate_generator<rng_type, boost::uniform_int<size_t> > die(rng, uni);

1 0

RE: [Boost-users] boost::thread and std::system
by Ben Hutchings 16 Mar '04

16 Mar '04

Jerry Swan <jeremiah.s(a)ntlworld.com> wrote: > I'd like to be able to issue a call to std::system that will time-out > after a specified period. Is it possible to achieve this using the > boost::threads library? You can stop waiting for it to complete, but you can't terminate the external program. > If so could someone kindly sketch how this might be achieved? You need to have the calling thread create a synchronised flag (bool with condition, protected by mutex) and a child thread that calls system() and then sets the flag when that returns. The original thread then performs a timed wait for the flag to be set. Here's my solution. The synchronised flag can be encapsulated as an "event" like this: struct one_time_event { public: one_time_event() : flag(false) { } void trigger() { boost::mutex::scoped_lock lock(mutex); flag = true; cond.notify_all(); } void wait() { boost::mutex::scoped_lock lock(mutex); while (!flag) cond.wait(lock); } bool timed_wait(boost::xtime & time) { boost::mutex::scoped_lock lock(mutex); while (!flag) if (!cond.timed_wait(lock, time)) return false; return true; } private: boost::mutex mutex; boost::condition cond; bool flag; }; (This is a basic event that you use once and then throw away. More complex event classes are possible but harder to use correctly.) Using this class it's really very easy: void call_system(const char * command, one_time_event & event) { std::system(command); event.trigger(); } bool system_with_time_limit(const char * command, boost::xtime & time) { one_time_event event; boost::thread thread( boost::bind(call_system, command, boost::ref(event))); return event.timed_wait(time); } Ben.

2 1

RE: [Boost-users] Re: Using shared_ptr across shared library boun dary
by Ferdinand Prantl 16 Mar '04

16 Mar '04

> From: David Abrahams [mailto:dave@boost-consulting.com] > > "Jim.Hyslop" <Jim.Hyslop(a)Leitch.com> writes: > > It's been my experience > > (with Visual Studio, at least) that allocating memory in > > one DLL and > > deallocating it in another leads to problems. Sometimes it > > doesn't go > > noticed, but when it does, it's really noticeable. > > The library cleverly avoids that, provided the first > shared_ptr to take ownership of the memory does so in the > same DLL where the object was allocated. Actually, I came into the same problem as Jim - I had to ensure the same version of the msvcrt and moreover its debug/release versions to get the code working well. All classes in checked_delete.hpp, smart_count.hpp and shared_ptr.hpp are either templates or completely in headers. The operations with new/delete and allocators are translated/inlined by the compiler into every unit, IMHO. I could not find the trick in the implementation, how to force the deletion of the pointer by the same runtime, if new() was performed in one DLL and delete() in another one. Could you, please, point me to the right direction to the explatation? Thanks, Ferda

4 3

Newbie Q: Boost Graph stuff
by Ori 16 Mar '04

16 Mar '04

Hi everyone, I have a question concerning the Boost Graph library, specifically with strongly connected components. My problem is this: I have a graph that I need to collapse into strongly connected components, then topologically sort the resulting DAG of components. Then I want to traverse the sorted DAG (in order), and for each component (now just a vertex I guess), look up into the original graph to find all the vertices that belong to this component. The application here is a rigid body simulator, and I'm constructing a graph of contact points between bodies. The idea is to find an ordering to apply collision impulses, which logically means from the ground up. Vertices are thus bodies, and edges denote a contact (collision) case. I've constructed the original graph, and using the example online, performed the strong_components algorithm on it. However, I'm unsure of how to correctly create a graph of the components. I presume using the root_map is somehow involved, but I'm kind of at a loss. Here's what I got: // typedefs, most stolen from graph introduction at boost.org typedef std::pair<int, int> Edge; struct pen_index_t { typedef edge_property_tag kind; }; typedef property<pen_index_t, int> PenProperty; typedef adjacency_list<vecS, vecS, directedS, no_property, PenProperty> Graph; typedef adjacency_list<setS, vecS, directedS, no_property, PenProperty> ComponentGraph; typedef graph_traits<Graph>::vertex_descriptor Vertex; ... // actual code Graph contactGraph(NUM_BODIES); ... various junk to fill up the graph ... // now, collapse strongly connected components vector<int> component(num_vertices(contactGraph)); vector<Vertex> root(num_vertices(contactGraph)); bgl_named_params< Vertex*, vertex_root_t, no_property> rootMap = root_map(&root[0]); int num = strong_components(contactGraph, &component[0], rootMap); // create a new graph with each component as a vertex... // ...how? I tried variations on get(...) on the rootMap and such, but was met with the usual nightmarish stl/boost compiler errors when you mess up something involving templates : ) Any help someone out there can give is really appreciated. Thanks! ~ Ori

2 2

BUG: boost::lexical_cast ignores virtual functions.
by John F Meinel Jr 16 Mar '04

16 Mar '04

I found that when I call boost::lexical_cast<std::string>() with an object that has virtual functions, it fails to dereference the virtual functions. It also cannot use an Abstract base type. Attached is example code. I think the problem is simply that the file boost/lexical_cast.hpp, on line 185 has: Target lexical_cast(Source arg) This should be Target lexical_cast(Source& arg) At least, this fixes all of my problems. John =:-> #include <iostream> #include <string> #include <boost/lexical_cast.hpp> struct A { virtual int f() const = 0; }; struct B : A { virtual int f() const { return 1; } }; struct C : B { virtual int f() const { return 2; } }; std::ostream& operator<<(std::ostream& os, const A& a) { return os << a.f(); } int main() { C c; std::string s; std::cout << c << std::endl; //This should print 2 s = boost::lexical_cast<std::string>(c); std::cout << s << std::endl; //This should print 2 s = boost::lexical_cast<std::string, B>(c); std::cout << s << std::endl; //This returns 1, not 2 //This fails because it tries to instantiate an object of type A. Why??? s = boost::lexical_cast<std::string, A>(c); std::cout << s << std::endl; }

1 0

Problems building Boost
by Ulf Johansson 15 Mar '04

15 Mar '04

I've downloaded Boost 1.31.0 and tried to build it using the standard bjam procedure from the getting started document. I have WinXP/Home and the standard edition of VC7.1 (.NET 2003). I've tried both the vc7.1 and the vc7.1-stlport toolsets. In both cases the following libraries are generated: boost_date_time boost_filesystem boost_signals boost_thread libbost_date_time libbost_prg_exec_monitor libbost_regex libbost_signals libbost_test_exec_monitor libbost_unit_test_framework During the build process I get compiler warnings because the standard version of VC won't do advanced optimizations, but otherwise there seems to be no problem. Bjam stops after having generated the above libraries. Shouldn't there be more? What's the difference between those starting with boost and those starting with libboost? Do I have to somehow generate the remaining libraries separately? Thanks!

3 3

VC 7.1 & boost.thread
by raja 15 Mar '04

15 Mar '04

Hi, I am getting the following error. I see that it is trying to link to the static library, but I still get this error. Would appreciate if someone can correct my usage. Linking to lib file: lib"boost_thread"-vc71-mt-sgd-1_31.lib c:\Boost\include\boost-1_31\boost\config\auto_link.hpp(269) : fatal error C1189: #error : "Mixing a dll boost library with a static runtime is a really bad idea..." Here is my sample: #define _MSC_VER 1310 #define BOOST_LIB_NAME "boost_thread" #define BOOST_LIB_DIAGNOSTIC "on"// Show library file details. #include <boost/config/auto_link.hpp> #include <boost/thread/thread.hpp> #include <iostream> void hello() { std::cout << "Hello world, I'm a thread!" << std::endl; } int main(int argc, char* argv[]) { boost::thread thrd(&hello); thrd.join(); return 0; }

1 0

[BGL] Determining if a graph has a particular internal property?
by Douglas Gregor 15 Mar '04

15 Mar '04

Is this possible? A well-defined return type from get(p, g) when p is not an internal property of graph g would suffice. Doug

3 2

Re: [Boost-users] regex with msvc-stlport1
by Juan Casanueva 15 Mar '04

15 Mar '04

Hi John, I have installed stlport 4.6 and tryed to compile regex but I get the same error. vc-Link ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib Creating library ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib and object ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.exp boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_custom_error_messages@?%C:\Program" (?re_custom_error_messages@?%C:\Program) boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_ten_w@?%C:\Program" (?re_ten_w@?%C:\Program) boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_zero_w@?%C:\Program" (?re_zero_w@?%C:\Program) ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll : fatal error LNK1120: 3 unresolved externals "link" /nologo /INCREMENTAL:NO /DLL /subsystem:console /out:"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll" /IMPLIB:"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib" /LIBPATH:"C:\Program Files\Microsoft Visual Studio\STLport-4.6\lib" /LIBPATH:"C:\PROGRA~1\MICROS~2\VC98\lib" @"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.CMD" it creates the .lib fine, but then give some unresolved externals when creating the dll.. what are your setting in regex\user.hpp??? if anyone has any idea, I would apreciate it thanks Juan >>Date: Sat, 13 Mar 2004 12:31:07 -0000 >From: "John Maddock" <john(a)johnmaddock.co.uk> >Subject: Re: [Boost-users] regex with msvc-stlport >To: <boost-users(a)lists.boost.org> >Message-ID: <022501c408f7$128de550$1a520252@fuji> >Content-Type: text/plain; charset="iso-8859-1" > > > I am trying to build de regex boost library with msvc and stlport4.6.1, >with > > no success!!! > >I regularly test regex with msvc+STLPort and it works for me with >Boost.1.31.0 (OK, I use STLPort 4.6, but otherwise the same settings as you >are using). > > > I use the following to compile (release version): > >The static libs have built OK, but the dll build failed for some strange >reason, I really don't understand that... > >John. > _________________________________________________________________ STOP MORE SPAM with the new MSN 8 and get 2 months FREE* http://join.msn.com/?page=features/junkmail

2 1

Problem using Boost with Dinkumware STL library
by Darren Cox 15 Mar '04

15 Mar '04

2 1

Re: [Boost-users] mpl rational_c and fixed_c
by Aleksey Gurtovoy 15 Mar '04

15 Mar '04

Matt Calabrese writes: > A couple of days ago I started work on a library where I need a way to > represent rational numbers and fixed point precision numbers at > compile time, so I started creating a compile-time rational number type > following the style of integral_c in boost::mpl. After completing most > operations, I notices that in the mpl/math directory there were already > the beginnings of rational_c and fixed_c types, however, they are far > from complete (in rational_c there are just two static constants for > numerator and denominator and a self typedef, with no specialized > operations). Are these types still in development or are they > abandoned? They are waiting for somebody to pick them up. To some extent, that already happened with rational numbers. There are a couple of more or less complete implementations laying around: * http://tinyurl.com/2qrpq, 'rational_c' implementation by Hugo Duncan; * http://tinyurl.com/39mjl, "static_rational.hpp" by Matthias Schabel (it's a part of YANL, his dimensional analysis library). The main reason one of them is not in the library yet is that their notation for arithmetic operations leaves something to be desired -- you have to write something like rational_plus<r1,r2> instead of mpl::plus<r1,r2> Besides this issue, AFAIK these are already usable. Of course, if you would like to improve them/contribute more optimal/clean/better in any other regard implementation, please do. As for 'fixed_c', I am not aware of any publicly available implementation. Again, contributions are more than welcome! > I'd like to continue my project using > mpl::rational_c and mpl::fixed_c as I need to make them work with the > mpl integral constants anyways. > > So is development on these templates halted, meaning I should just go > ahead and finish my types, or are the types coming soon enough so I > just should just hold off and wait for the cavalry to arrive? No, please go ahead! Cavalry have enough on their plates already (among other things, a new version of the library is upcoming, with plenty of new exciting and useful stuff like associative sequences), so progress on these two is totally in your hands. -- Aleksey Gurtovoy MetaCommunications Engineering

3 5

date_time formatting compilation error
by Keith MacDonald 14 Mar '04

14 Mar '04

I'm trying to convert a gregorian::date to a string, as shown in the following code: // Build: cl /EHsc /I \CVS\boost dt.cpp #include <iostream> #include <boost/date_time/gregorian/gregorian.hpp> int main() { boost::gregorian::date today(2004, boost::gregorian::Mar, 14); std::cout << today << std::endl; return 0; } When I compile it with Visual C++ 7.1, using Boost from CVS head, I get the following error: \CVS\boost\boost\lexical_cast.hpp(150) : error C2679: binary '>>' : no operator found which takes a right-hand operand of type 'boost::date_time::date_formatter <date_type,format_type,charT>::string_type' (or there is no acceptable conversion) with [ date_type=boost::gregorian::date, format_type=boost::date_time::simple_format, charT=wchar_t ] The same thing happens when using to_simple_string and to_simple_string_type<char>, rather than operator<<. I actually want the result as a basic_string<wchar_t>, but all variations produce this same error. What am I doing wrong? Thanks, Keith MacDonald

5 11

mpl rational_c and fixed_c
by Matt Calabrese 14 Mar '04

14 Mar '04

A couple of days ago I started work on a library where I need a way to represent rational numbers and fixed point precision numbers at compile time, so I started creating a compile-time rational number type following the style of integral_c in boost::mpl. After completing most operations, I notices that in the mpl/math directory there were already the beginnings of rational_c and fixed_c types, however, they are far from complete (in rational_c there are just two static constants for numerator and denominator and a self typedef, with no specialized operations). Are these types still in development or are they abandoned? I'd like to continue my project using mpl::rational_c and mpl::fixed_c as I need to make them work with the mpl integral constants anyways. So is development on these templates halted, meaning I should just go ahead and finish my types, or are the types coming soon enough so I just should just hold off and wait for the cavalry to arrive?

1 0

RE: [Boost-users] regex with msvc-stlport
by Juan Casanueva 13 Mar '04

13 Mar '04

Hi there.... I have been playing with those settings in regex\user.hpp, but I always get the same unresolved symbols boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_custom_error_messages@?%C:\Program" (?re_custom_error_messages@?%C:\Program) boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_ten_w@?%C:\Program" (?re_ten_w@?%C:\Program) boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_zero_w@?%C:\Program" (?re_zero_w@?%C:\Program) ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll : fatal error LNK1120: 3 unresolved externals does anyone have any idea of what is wrong? thanks Juan >Date: Fri, 12 Mar 2004 10:20:47 -0800 >From: "Jia Pu" <JiaPu(a)lumenvox.com> >Subject: RE: [Boost-users] regex with msvc-stlport >To: <boost-users(a)lists.boost.org> >Message-ID: <LV-SVRSKJ0XgixKVVgx000006e5(a)lv-svr.lumenvox.com> >Content-Type: text/plain; charset="us-ascii" > >I have seen the similar problem, when I built it using intel-win32. > >I would suggest you to check regex\user.hpp. There are a couple of macros >need to be set for win32 dll. I am not sure what is the proper setting. >Just >play with it. > >// define this if the runtime library is a dll, and you >// want BOOST_REGEX_DYN_LINK to set up dll exports/imports >// with __declspec(dllexport)/__declspec(dllimport.) > #define BOOST_REGEX_HAS_DLL_RUNTIME > >// define this if you want to dynamically link to regex, >// if the runtime library is also a dll (Probably Win32 specific, >// and has no effect unless BOOST_REGEX_HAS_DLL_RUNTIME is set): > #define BOOST_REGEX_DYN_LINK > >// define this if you don't want the lib to automatically >// select its link libraries: > #define BOOST_REGEX_NO_LIB > >Hope this will help. > >-----Original Message----- >From: boost-users-bounces(a)lists.boost.org >[mailto:boost-users-bounces@lists.boost.org] On Behalf Of Juan Casanueva >Sent: Friday, March 12, 2004 7:13 AM >To: boost-users(a)lists.boost.org >Subject: [Boost-users] regex with msvc-stlport > >Hi, > >I am trying to build de regex boost library with msvc and stlport4.6.1, >with >no success!!! >help!!!! > >I use the following to compile (release version): > >cd regex >cd build >..\..\..\bjam -sTOOLS=msvc-stlport "-sSTLPORT_PATH=C:\Program >Files\Microsoft Visual Studio" "-sSTLPORT_4.6.1_PATH=C:\Program >Files\Microsoft Visual Studio\STLport-4.6.1" "-sSTLPORT_VERSION=4.6.1" >"-sBUILD=release <stlport-iostream>on <stlport-cstd-namespace>global" > >and I get the following output: > >...found 713 targets... >...updating 40 targets... >MkDir1 >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >MkDir1 >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global >MkDir1 >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits.obj >c_regex_traits.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits_common.obj >c_regex_traits_common.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\cpp_regex_traits.obj >cpp_regex_traits.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\cregex.obj >cregex.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\fileiter.obj >fileiter.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\posix_api.obj >posix_api.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\regex.obj >regex.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\regex_debug.obj >regex_debug.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\regex_synch.obj >regex_synch.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\w32_regex_traits.obj >w32_regex_traits.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\wide_posix_api.obj >wide_posix_api.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\instances.obj >instances.cpp >C:\Program Files\Microsoft Visual >Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local >variable '__tmp' used without having been initialized >vc-C++ >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\winstances.obj >winstances.cpp >C:\Program Files\Microsoft Visual >Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local >variable '__tmp' used without having been initialized vc-Archive >..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ >stlport-cstd-namespace-global\stlport-iostream-on\libboost_regex-vc6-mt-p-1_ >31.lib >Microsoft (R) Library Manager Version 6.00.8168 Copyright (C) Microsoft >Corp >1992-1998. All rights reserved. > >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits.obj" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits_common.obj >" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\cpp_regex_traits.obj" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\cregex.obj" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\fileiter.obj" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\posix_api.obj" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\regex.obj" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\regex_debug.obj" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\regex_synch.obj" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\w32_regex_traits.obj" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\wide_posix_api.obj" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\instances.obj" >"..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release >\stlport-cstd-namespace-global\stlport-iostream-on\winstances.obj" >FileClone D:\juan\open scene >graph\boost\boost_1_31_0\stage\lib\libboost_regex-vc6-mt-p-1_31.lib > 1 file(s) copied. >MkDir1 >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release >MkDir1 >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global >MkDir1 >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\c_regex_traits.obj >c_regex_traits.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\c_regex_traits_common.obj >c_regex_traits_common.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\cpp_regex_traits.obj >cpp_regex_traits.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\cregex.obj >cregex.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\fileiter.obj >fileiter.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\posix_api.obj >posix_api.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\regex.obj >regex.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\regex_debug.obj >regex_debug.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\regex_synch.obj >regex_synch.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\w32_regex_traits.obj >w32_regex_traits.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\wide_posix_api.obj >wide_posix_api.cpp >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\instances.obj >instances.cpp >C:\Program Files\Microsoft Visual >Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local >variable '__tmp' used without having been initialized >vc-C++ >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\winstances.obj >winstances.cpp >C:\Program Files\Microsoft Visual >Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local >variable '__tmp' used without having been initialized vc-Link >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib > Creating library >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib >and object >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.exp >boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol >"?re_custom_error_messages@?%C:\Program" >(?re_custom_error_messages@?%C:\Program) >boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol >"?re_ten_w@?%C:\Program" (?re_ten_w@?%C:\Program) >boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol >"?re_zero_w@?%C:\Program" (?re_zero_w@?%C:\Program) >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll >: fatal error LNK1120: 3 unresolved externals > > > "link" /nologo /INCREMENTAL:NO /DLL /subsystem:console >/out:"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\relea >se\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_ >31.dll" > >/IMPLIB:"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\re >lease\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p >-1_31.lib" > /LIBPATH:"C:\Program Files\Microsoft Visual Studio\STLport-4.6.1\lib" >/LIBPATH:"C:\PROGRA~1\MICROS~2\VC98\lib" >@"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\s >tlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.C >MD" > >...failed vc-Link >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll >..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl >port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib >... >...skipped <@boost!libs!regex!build!stage!lib>boost_regex-vc6-mt-p-1_31.dll >for lack of ><@boost!libs!regex!build\boost_regex.dll\msvc-stlport\release\stlport-cstd-n >amespace-global\stlport-iostream-on>boost_regex-vc6-mt-p-1_31.dll... >...skipped <@boost!libs!regex!build!stage!lib>boost_regex-vc6-mt-p-1_31.lib >for lack of ><@boost!libs!regex!build\boost_regex.dll\msvc-stlport\release\stlport-cstd-n >amespace-global\stlport-iostream-on>boost_regex-vc6-mt-p-1_31.lib... >...failed updating 2 targets... >...skipped 2 targets... >...updated 36 targets... > > > >Was anyone managed to get it to work? >thanks >Juan > >_________________________________________________________________ >The new MSN 8: advanced junk mail protection and 2 months FREE* >http://join.msn.com/?page=features/junkmail _________________________________________________________________ Tired of spam? Get advanced junk mail protection with MSN 8. http://join.msn.com/?page=features/junkmail

1 0

regex with msvc-stlport
by Juan Casanueva 13 Mar '04

13 Mar '04

Hi, I am trying to build de regex boost library with msvc and stlport4.6.1, with no success!!! help!!!! I use the following to compile (release version): cd regex cd build ..\..\..\bjam -sTOOLS=msvc-stlport "-sSTLPORT_PATH=C:\Program Files\Microsoft Visual Studio" "-sSTLPORT_4.6.1_PATH=C:\Program Files\Microsoft Visual Studio\STLport-4.6.1" "-sSTLPORT_VERSION=4.6.1" "-sBUILD=release <stlport-iostream>on <stlport-cstd-namespace>global" and I get the following output: ...found 713 targets... ...updating 40 targets... MkDir1 ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release MkDir1 ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global MkDir1 ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits.obj c_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits_common.obj c_regex_traits_common.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\cpp_regex_traits.obj cpp_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\cregex.obj cregex.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\fileiter.obj fileiter.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\posix_api.obj posix_api.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\regex.obj regex.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\regex_debug.obj regex_debug.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\regex_synch.obj regex_synch.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\w32_regex_traits.obj w32_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\wide_posix_api.obj wide_posix_api.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\instances.obj instances.cpp C:\Program Files\Microsoft Visual Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local variable '__tmp' used without having been initialized vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\winstances.obj winstances.cpp C:\Program Files\Microsoft Visual Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local variable '__tmp' used without having been initialized vc-Archive ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\libboost_regex-vc6-mt-p-1_31.lib Microsoft (R) Library Manager Version 6.00.8168 Copyright (C) Microsoft Corp 1992-1998. All rights reserved. "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits_common.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\cpp_regex_traits.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\cregex.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\fileiter.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\posix_api.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\regex.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\regex_debug.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\regex_synch.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\w32_regex_traits.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\wide_posix_api.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\instances.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\winstances.obj" FileClone D:\juan\open scene graph\boost\boost_1_31_0\stage\lib\libboost_regex-vc6-mt-p-1_31.lib 1 file(s) copied. MkDir1 ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release MkDir1 ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global MkDir1 ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits.obj c_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits_common.obj c_regex_traits_common.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\cpp_regex_traits.obj cpp_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\cregex.obj cregex.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\fileiter.obj fileiter.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\posix_api.obj posix_api.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\regex.obj regex.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\regex_debug.obj regex_debug.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\regex_synch.obj regex_synch.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\w32_regex_traits.obj w32_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\wide_posix_api.obj wide_posix_api.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\instances.obj instances.cpp C:\Program Files\Microsoft Visual Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local variable '__tmp' used without having been initialized vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\winstances.obj winstances.cpp C:\Program Files\Microsoft Visual Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local variable '__tmp' used without having been initialized vc-Link ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib Creating library ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib and object ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.exp boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_custom_error_messages@?%C:\Program" (?re_custom_error_messages@?%C:\Program) boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_ten_w@?%C:\Program" (?re_ten_w@?%C:\Program) boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_zero_w@?%C:\Program" (?re_zero_w@?%C:\Program) ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll : fatal error LNK1120: 3 unresolved externals "link" /nologo /INCREMENTAL:NO /DLL /subsystem:console /out:"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll" /IMPLIB:"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib" /LIBPATH:"C:\Program Files\Microsoft Visual Studio\STLport-4.6.1\lib" /LIBPATH:"C:\PROGRA~1\MICROS~2\VC98\lib" @"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.CMD" ...failed vc-Link ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib... ...skipped <@boost!libs!regex!build!stage!lib>boost_regex-vc6-mt-p-1_31.dll for lack of <@boost!libs!regex!build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on>boost_regex-vc6-mt-p-1_31.dll... ...skipped <@boost!libs!regex!build!stage!lib>boost_regex-vc6-mt-p-1_31.lib for lack of <@boost!libs!regex!build\boost_regex.dll\msvc-stlport\release\stlport-cstd-namespace-global\stlport-iostream-on>boost_regex-vc6-mt-p-1_31.lib... ...failed updating 2 targets... ...skipped 2 targets... ...updated 36 targets... Was anyone managed to get it to work? thanks Juan _________________________________________________________________ The new MSN 8: advanced junk mail protection and 2 months FREE* http://join.msn.com/?page=features/junkmail

2 1

Could your guys see what is wrong with my following c++ extension code?
by Shunming Fang 12 Mar '04

12 Mar '04

Heollo, guys, I try to wrap a c++ extension class requiring qt lib through boost.python, I failed always because of the following error: c:\Python23\include\object.h(343): error C2059: syntax error : ';' My code will link to qt-2.30nc lib (window version). I don't know why. Can someone give ahint how to fix it? Thank you very much. Fang ----------------------------------------------- #ifndef IMAGEPROCESS_H #define IMAGEPROCESS_H #ifdef IMAGEPROCESS_EXPORTS #define IMAGEPROCESS_API __declspec(dllexport) #else #define IMAGEPROCESS_API __declspec(dllimport) #endif #include <qimage.h> //#include <boost/python/class_builder.hpp> // for the python hooks into the dll #include <boost/python.hpp> #include <boost/python/module.hpp> #include <boost/python/def.hpp> using namespace boost::python; //#include <qimage.h> // This class is exported from the ImageProcess.dll class IMAGEPROCESS_API ImageProcess { public: ImageProcess(); ~ImageProcess(){}; void setContrast(float contrt); void setBrite(int brite); void adjustContrastBrite(QImage &img); private: float contrast; int brightness; }; ImageProcess::ImageProcess():contrast(1.0),brightness(0){}; //using namespace boost::python; BOOST_PYTHON_MODULE(ImageProcess) { class_<ImageProcess>("ImageProcess",init<>()) .def("setBrite",&ImageProcess::setBrite) .def("setContrast",&ImageProcess::setContrast) .def("adjustContrastBrite",&ImageProcess::adjustContrastBrite) ; } #endif __________________________________ Do you Yahoo!? Yahoo! Search - Find what you�re looking for faster http://search.yahoo.com

2 1

RE: [Boost-users] regex with msvc-stlport
by Jia Pu 12 Mar '04

12 Mar '04

I have seen the similar problem, when I built it using intel-win32. I would suggest you to check regex\user.hpp. There are a couple of macros need to be set for win32 dll. I am not sure what is the proper setting. Just play with it. // define this if the runtime library is a dll, and you // want BOOST_REGEX_DYN_LINK to set up dll exports/imports // with __declspec(dllexport)/__declspec(dllimport.) #define BOOST_REGEX_HAS_DLL_RUNTIME // define this if you want to dynamically link to regex, // if the runtime library is also a dll (Probably Win32 specific, // and has no effect unless BOOST_REGEX_HAS_DLL_RUNTIME is set): #define BOOST_REGEX_DYN_LINK // define this if you don't want the lib to automatically // select its link libraries: #define BOOST_REGEX_NO_LIB Hope this will help. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Juan Casanueva Sent: Friday, March 12, 2004 7:13 AM To: boost-users(a)lists.boost.org Subject: [Boost-users] regex with msvc-stlport Hi, I am trying to build de regex boost library with msvc and stlport4.6.1, with no success!!! help!!!! I use the following to compile (release version): cd regex cd build ..\..\..\bjam -sTOOLS=msvc-stlport "-sSTLPORT_PATH=C:\Program Files\Microsoft Visual Studio" "-sSTLPORT_4.6.1_PATH=C:\Program Files\Microsoft Visual Studio\STLport-4.6.1" "-sSTLPORT_VERSION=4.6.1" "-sBUILD=release <stlport-iostream>on <stlport-cstd-namespace>global" and I get the following output: ...found 713 targets... ...updating 40 targets... MkDir1 ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release MkDir1 ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global MkDir1 ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits.obj c_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits_common.obj c_regex_traits_common.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\cpp_regex_traits.obj cpp_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\cregex.obj cregex.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\fileiter.obj fileiter.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\posix_api.obj posix_api.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\regex.obj regex.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\regex_debug.obj regex_debug.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\regex_synch.obj regex_synch.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\w32_regex_traits.obj w32_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\wide_posix_api.obj wide_posix_api.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\instances.obj instances.cpp C:\Program Files\Microsoft Visual Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local variable '__tmp' used without having been initialized vc-C++ ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\winstances.obj winstances.cpp C:\Program Files\Microsoft Visual Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local variable '__tmp' used without having been initialized vc-Archive ..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release\ stlport-cstd-namespace-global\stlport-iostream-on\libboost_regex-vc6-mt-p-1_ 31.lib Microsoft (R) Library Manager Version 6.00.8168 Copyright (C) Microsoft Corp 1992-1998. All rights reserved. "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\c_regex_traits_common.obj " "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\cpp_regex_traits.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\cregex.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\fileiter.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\posix_api.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\regex.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\regex_debug.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\regex_synch.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\w32_regex_traits.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\wide_posix_api.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\instances.obj" "..\..\..\bin\boost\libs\regex\build\libboost_regex.lib\msvc-stlport\release \stlport-cstd-namespace-global\stlport-iostream-on\winstances.obj" FileClone D:\juan\open scene graph\boost\boost_1_31_0\stage\lib\libboost_regex-vc6-mt-p-1_31.lib 1 file(s) copied. MkDir1 ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release MkDir1 ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global MkDir1 ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\c_regex_traits.obj c_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\c_regex_traits_common.obj c_regex_traits_common.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\cpp_regex_traits.obj cpp_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\cregex.obj cregex.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\fileiter.obj fileiter.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\posix_api.obj posix_api.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\regex.obj regex.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\regex_debug.obj regex_debug.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\regex_synch.obj regex_synch.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\w32_regex_traits.obj w32_regex_traits.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\wide_posix_api.obj wide_posix_api.cpp vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\instances.obj instances.cpp C:\Program Files\Microsoft Visual Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local variable '__tmp' used without having been initialized vc-C++ ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\winstances.obj winstances.cpp C:\Program Files\Microsoft Visual Studio\STLport-4.6.1\stlport\stl/_algobase.h(64) : warning C4700: local variable '__tmp' used without having been initialized vc-Link ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib Creating library ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib and object ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.exp boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_custom_error_messages@?%C:\Program" (?re_custom_error_messages@?%C:\Program) boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_ten_w@?%C:\Program" (?re_ten_w@?%C:\Program) boost_regex-vc6-mt-p-1_31.exp : error LNK2001: unresolved external symbol "?re_zero_w@?%C:\Program" (?re_zero_w@?%C:\Program) ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll : fatal error LNK1120: 3 unresolved externals "link" /nologo /INCREMENTAL:NO /DLL /subsystem:console /out:"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\relea se\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_ 31.dll" /IMPLIB:"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\re lease\stlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p -1_31.lib" /LIBPATH:"C:\Program Files\Microsoft Visual Studio\STLport-4.6.1\lib" /LIBPATH:"C:\PROGRA~1\MICROS~2\VC98\lib" @"..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\s tlport-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.C MD" ...failed vc-Link ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.dll ..\..\..\bin\boost\libs\regex\build\boost_regex.dll\msvc-stlport\release\stl port-cstd-namespace-global\stlport-iostream-on\boost_regex-vc6-mt-p-1_31.lib ... ...skipped <@boost!libs!regex!build!stage!lib>boost_regex-vc6-mt-p-1_31.dll for lack of <@boost!libs!regex!build\boost_regex.dll\msvc-stlport\release\stlport-cstd-n amespace-global\stlport-iostream-on>boost_regex-vc6-mt-p-1_31.dll... ...skipped <@boost!libs!regex!build!stage!lib>boost_regex-vc6-mt-p-1_31.lib for lack of <@boost!libs!regex!build\boost_regex.dll\msvc-stlport\release\stlport-cstd-n amespace-global\stlport-iostream-on>boost_regex-vc6-mt-p-1_31.lib... ...failed updating 2 targets... ...skipped 2 targets... ...updated 36 targets... Was anyone managed to get it to work? thanks Juan _________________________________________________________________ The new MSN 8: advanced junk mail protection and 2 months FREE* http://join.msn.com/?page=features/junkmail _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0