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

Boost serialization w/gcc 3.2.3 on CentOS 4.4?
by matthew.garman＠gmail.com 04 May '07

04 May '07

We've got an in-house infrastructure that uses the boost::serialization library (from boost 1.33). Thus far, all our development has been done using gcc 3.4.5 and 3.4.6 on CentOS 4.3 and 4.4 (respectively). (Note that CentOS is practically the same as Red Hat Enterprise Linux.) Now we are forced to integrate with a 3rd party proprietary library that was built with gcc 3.2. So I installed the gcc32 package: % gcc32 --version gcc32 (GCC) 3.2.3 20030502 (Red Hat Linux 3.2.3-47.3) Copyright (C) 2002 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. If I build my program with gcc 3.2 and link against boost built with gcc 3.4, my program segfaults as soon as the first boot::serialization method is called. So I tried to rebuild boost using gcc 3.2. I did this by running the configure script, then modifying the "BJAM_CONFIG" variable of the top-level Makefile: BJAM_CONFIG= -sPYTHON_ROOT=/usr -sPYTHON_VERSION=2.3 \ -sGXX=g++32 -sGCC=gcc32 Then I ran make. First thing I noticed is that there were a *lot* of warnings, although the library did build. Same thing when building my own program: lots of warnings surrounding the boost stuff, but it does build. Also, when linking, I get this warning: /usr/bin/ld: warning: libstdc++.so.6, needed by /usr/local/lib/libboost_serialization-gcc.so, may conflict with libstdc++.so.5 Unfortunately, the program still crashes when it gets to the boost::serialization stuff. I looked at the Boost compatibility matrix, and as far as I can tell, gcc 3.2 is supported (though I definitely could have misread something!). So my hunch is that I've got a problem with my build process... but I'm not sure where. I know I've left out some details; please let me know what other info I need to provide. Suggestions or general "things to try" are welcome as well! Thanks, Matt

5 12

Regex failure when matching with a POSIX extended regexp
by Roger Leigh 03 May '07

03 May '07

Hi folks, The following code demonstrates the problem I'm having. I'm using Boost 1.33.1 (Debian), but IIRC this worked last year with the same version because I tested it; possibly a Debian-specific regression? I expect both regular expressions here to match with the value string. They certainly to with egrep. However, I only get the second to match: % g++ -c regex.cc -o regex.o && g++ -o regex regex.o -lboost_regex % ./regex It didn't match the first It matched the second Am I correct in my expectation that expression1 will match? If not, what should I be doing to make it match? Many thanks, Roger -- .''`. Roger Leigh : :' : Debian GNU/Linux http://people.debian.org/~rleigh/ `. `' Printing on GNU/Linux? http://gutenprint.sourceforge.net/ `- GPG Public Key: 0x25BFB848 Please GPG sign your mail.

3 5

[1.33.1][test][vc80] new user question concerning 1_33_1\libs\test\doc\examples\unit_test_example1.html & unit_test_example1.cpp/
by John McMahon 02 May '07

02 May '07

Hi, I've built and run this with libboost_unit_test_framework-vc80-mt-gd-1_33_1.lib in my Linker->Input->Additional Dependencies. The single test looks like this: void free_test_function() { // reports 'error in "free_test_function": test 2 == 1 failed' BOOST_CHECK(2 == 1); // non-critical test => continue after failure int* p = (int*)0; *p = 0; } When I run it, I see the falied message (2!=1), but I don't get the final 'No errors found' message since '*p=0' causes an unhandlled exception. But when I run it with #include <boost/test/included/unit_test_framework.hpp> and no library instead, it runs to completion as expected. Any idea what I'm doing wrong. thanks in advance, John McMahon

3 9

[multi_index] 2D/3D range seaching
by Chris Fairles 01 May '07

01 May '07

At first glance, it looked like the multi_index lib (perhaps combined with the range lib) might provide a convenient way to search for ranges of two+ indicies. For example, points. You have a grid of random points and you want a pair of iterators that contain all points within the cube (x1,y1,z1) and (x2,y2,z2) . I made a multi_index container with a composite key containing all three coords contained within a point class. struct point { int x, y ,z; }; struct coords_key : composite_key< point, member<point,int,x>, member<point,int,y>, member<point,int,z> >{}; struct coords{}; typedef multi_index_container< point, indexed_by< ordered_non_unique<tag<coords>, coords_key> > > point_set; int main() { point_set p; p.insert(point(1,2,2)); p.insert(point(2,3,1)); p.insert(point(1,2,3)); p.insert(point(10,3,2)); point_set::iterator it = p.lower_bound(make_tuple(1,1,1)); point_set::iterator it2 = p.upper_bound(make_tuple(3,3,3)); return 0; } it would be great if [it, it2] contained the first four points, but this is not the case. If I run this code, it == it2 == the first point. Am i barking up the wrong tree? Or is this doable. Cheers, Chris

2 3

BGL python: dijkstra_shortest_paths
by John Reid 01 May '07

01 May '07

Hi, I can't seem to use dijkstra_shortest_paths as I think I should via the python bindings. It works fine when I pass a weight_map and predecessor_map. What I want to do is to pass a predecessor_map and a distance_map. Unfortunately boost.python can't convert the arguments. I'm using a bgl that says bgl.__version__ = '1.0' although I haven't updated it from SVN recently. This works: import boost.graph as bgl graph = bgl.Graph() a = graph.add_vertex() b = graph.add_vertex() e = graph.add_edge(a, b) weights = graph.add_edge_property('integer') weights[e] = 5 predecessors = graph.add_vertex_property('vertex') bgl.dijkstra_shortest_paths( graph, a, predecessor_map = predecessors, weight_map = weights ) This doesn't work: import boost.graph as bgl graph = bgl.Graph() a = graph.add_vertex() b = graph.add_vertex() e = graph.add_edge(a, b) distances = graph.add_edge_property('float') predecessors = graph.add_vertex_property('vertex') bgl.dijkstra_shortest_paths( graph, a, predecessor_map = predecessors, distance_map = distances ) This is the error I get: <class 'Boost.Python.ArgumentError'>: Python argument types in boost.graph._graph.dijkstra_shortest_paths(Graph, Vertex) did not match C++ signature: dijkstra_shortest_paths(class boost::graph::python::basic_graph<struct boost ::bidirectionalS> graph, struct boost::graph::python::basic_descriptor<void *,st ruct boost::bidirectionalS> root_vertex, class boost::vector_property_map<struct boost::graph::python::basic_descriptor<void *,struct boost::bidirectionalS>,str uct boost::graph::python::basic_index_map<struct boost::graph::python::basic_des criptor<void *,struct boost::bidirectionalS>,struct boost::adj_list_vertex_prope rty_map<class boost::adjacency_list<struct boost::listS,struct boost::listS,stru ct boost::bidirectionalS,struct boost::property<enum boost::vertex_index_t,unsig ned int,struct boost::no_property>,struct boost::property<enum boost::edge_index _t,unsigned int,struct boost::no_property>,struct boost::no_property,struct boos t::listS>,unsigned int,unsigned int const &,enum boost::vertex_index_t> > > * pr edecessor_map=None, class boost::vector_property_map<float,struct boost::graph:: python::basic_index_map<struct boost::graph::python::basic_descriptor<void *,str uct boost::bidirectionalS>,struct boost::adj_list_vertex_property_map<class boos t::adjacency_list<struct boost::listS,struct boost::listS,struct boost::bidirect ionalS,struct boost::property<enum boost::vertex_index_t,unsigned int,struct boo st::no_property>,struct boost::property<enum boost::edge_index_t,unsigned int,st ruct boost::no_property>,struct boost::no_property,struct boost::listS>,unsigned int,unsigned int const &,enum boost::vertex_index_t> > > * distance_map=None, c lass boost::vector_property_map<float,struct boost::graph::python::basic_index_m ap<struct boost::graph::python::basic_descriptor<class boost::detail::edge_desc_ impl<struct boost::bidirectional_tag,void *>,struct boost::bidirectionalS>,struc t boost::adj_list_edge_property_map<struct boost::bidirectional_tag,unsigned int ,unsigned int const &,void *,struct boost::property<enum boost::edge_index_t,uns igned int,struct boost::no_property> const ,enum boost::edge_index_t> > > {lvalu e} weight_map, class boost::python::api::object visitor=None, class boost::vecto r_property_map<enum boost::default_color_type,struct boost::graph::python::basic _index_map<struct boost::graph::python::basic_descriptor<void *,struct boost::bi directionalS>,struct boost::adj_list_vertex_property_map<class boost::adjacency_ list<struct boost::listS,struct boost::listS,struct boost::bidirectionalS,struct boost::property<enum boost::vertex_index_t,unsigned int,struct boost::no_proper ty>,struct boost::property<enum boost::edge_index_t,unsigned int,struct boost::n o_property>,struct boost::no_property,struct boost::listS>,unsigned int,unsigned int const &,enum boost::vertex_index_t> > > * color_map=None) dijkstra_shortest_paths(class boost::graph::python::basic_graph<struct boost ::undirectedS> graph, struct boost::graph::python::basic_descriptor<void *,struc t boost::undirectedS> root_vertex, class boost::vector_property_map<struct boost ::graph::python::basic_descriptor<void *,struct boost::undirectedS>,struct boost ::graph::python::basic_index_map<struct boost::graph::python::basic_descriptor<v oid *,struct boost::undirectedS>,struct boost::adj_list_vertex_property_map<clas s boost::adjacency_list<struct boost::listS,struct boost::listS,struct boost::un directedS,struct boost::property<enum boost::vertex_index_t,unsigned int,struct boost::no_property>,struct boost::property<enum boost::edge_index_t,unsigned int ,struct boost::no_property>,struct boost::no_property,struct boost::listS>,unsig ned int,unsigned int const &,enum boost::vertex_index_t> > > * predecessor_map=N one, class boost::vector_property_map<float,struct boost::graph::python::basic_i ndex_map<struct boost::graph::python::basic_descriptor<void *,struct boost::undi rectedS>,struct boost::adj_list_vertex_property_map<class boost::adjacency_list< struct boost::listS,struct boost::listS,struct boost::undirectedS,struct boost:: property<enum boost::vertex_index_t,unsigned int,struct boost::no_property>,stru ct boost::property<enum boost::edge_index_t,unsigned int,struct boost::no_proper ty>,struct boost::no_property,struct boost::listS>,unsigned int,unsigned int con st &,enum boost::vertex_index_t> > > * distance_map=None, class boost::vector_pr operty_map<float,struct boost::graph::python::basic_index_map<struct boost::grap h::python::basic_descriptor<class boost::detail::edge_desc_impl<struct boost::un directed_tag,void *>,struct boost::undirectedS>,struct boost::adj_list_edge_prop erty_map<struct boost::undirected_tag,unsigned int,unsigned int const &,void *,s truct boost::property<enum boost::edge_index_t,unsigned int,struct boost::no_pro perty> const ,enum boost::edge_index_t> > > {lvalue} weight_map, class boost::py thon::api::object visitor=None, class boost::vector_property_map<enum boost::def ault_color_type,struct boost::graph::python::basic_index_map<struct boost::graph ::python::basic_descriptor<void *,struct boost::undirectedS>,struct boost::adj_l ist_vertex_property_map<class boost::adjacency_list<struct boost::listS,struct b oost::listS,struct boost::undirectedS,struct boost::property<enum boost::vertex_ index_t,unsigned int,struct boost::no_property>,struct boost::property<enum boos t::edge_index_t,unsigned int,struct boost::no_property>,struct boost::no_propert y,struct boost::listS>,unsigned int,unsigned int const &,enum boost::vertex_inde x_t> > > * color_map=None) For reference here is the docstring bgl gives me: Type: function Base Class: <type 'builtin_function_or_method'> String Form: <Boost.Python.function object at 0x04AEE940> Namespace: Interactive Docstring: dijkstra_shortest_paths(graph, root_vertex, predecessor_map = None, distance_map = None, weight_map = None, visitor = None) Computes the shortest paths from the root vertex to every other vertex in a graph. Parameters: graph the graph on which to compute shortest paths will run. It may be either a directed or undirected graph. root_vertex the starting vertex for the shortest-path search. predecessor_map a vertex -> vertex map that stores the predecessor of each vertex in the shortest paths tree. From a given vertex, one can follow the predecessor_map back to the root_vertex to reconstruct the shortest path. distance_map a vertex -> float map that stores the distance from the root_vertex to each vertex in the tree. A distance of infinity in this property map indicates that the vertex is unreachable from the root_vertex. weight_map an edge -> float map that stores the weight of each edge in the graph. Negative edge weights are not permitted. If no weight map is provided, each edge will be assumed to have a weight of 1.0. visitor a visitor that will receive events as the shortest-paths computation progresses. Typically this visitor should be derived from boost.graph.dijkstra_visitor. See also: bellman_ford_shortest_paths dag_shortest_paths dijkstra_visitor Complete C++ documentation is available at: http://www.boost.org/libs/graph/doc/dijkstra_shortest_paths.html Any help appreciated, John.

4 9

[Multi_index] Performance like sequenced.cpp example
by Manuel Jung 30 Apr '07

30 Apr '07

Hi, I have to count a lot of words. Up to now i did it with MySQL, because it was easy. The result is safed there anyway. Now i thought i could speed up this a little if i would use internally a Multi_index list to store the words, so i have only to insert all different words. The words are stored in a UnicodeString from the ICU library. My code is really near to the one from the example "sequenced.cpp". Im using the following definition: typedef multi_index_container< UnicodeString, indexed_by< sequenced<>, ordered_non_unique<identity<UnicodeString> > > > text_container; typedef nth_index<text_container,1>::type ordered_text; text_container tc; Im inserting new words with "tc.push_back(UnicodeString(NewWord));" And count them exactly like in the example. I thought this should be fast, but it isnt. It eats up all my CPU, but isnt fast. It is a lot slower than my old solution. I have still hope i could speed this up, before i have to switch back MySQL. The profile of a run says that "boost::multi_index::safe_mode::check_same_owner<..." eats most CPU time. Some suggesting how to speed it up with Multi_index? Or some ideas which other way would be faster than MySQL inserts? Thanks Manu

3 6

An easy to use grid like random access/dynamic container?
by Jeff 30 Apr '07

30 Apr '07

I have been using STL containers to store structures of data but I would like to know if there is an easier solution such as a dynamically sized container that stores data in a spreadsheet like fashion. For example, I would like to store rows of columns of different data types. Here is a sample of data I would like to store, also, I would like fast random access to the elements to read and modify existing data: Name, Age, HomeOwner John 42 true Mark 24 false Mary 29 true If anyone can suggest such a container please let me know. Thank you

3 3

[unit test framework] undef ref to main() when dyn linking unit_test_framework lib, boost 1.34, linux
by Chris Fairles 30 Apr '07

30 Apr '07

Testing out boost beta 1.34. I built the whole she-bang with the gcc toolset. I tried compling my unit tests and they all get: /usr/lib/gcc/x86_64-redhat-linux/4.1.1/../../../../lib64/crt1.o: In function `_start': (.text+0x20): undefined reference to `main' collect2: ld returned 1 exit status I don't use the auto test case mechanism. My tests suites look like: #include "boost/test/unit_test.hpp" using boost::unit_test::test_suite; void free_test_function() { BOOST_CHECK(1 == 1); } test_suite* init_unit_test_suite( int, char* [] ) { test_suite* test= BOOST_TEST_SUITE( "Unit test example 1" ); test->add( BOOST_TEST_CASE( &free_test_function ) ); return test; } I compile using g++ -Wall -I/usr/local/include/boost-1.34 -o unit_test unit_test_test.cpp -L/usr/local/lib64 -lboost_unit_test_framework-gcc41-mt-d If i define BOOST_TEST_DYN_LINK either in the cpp file before or after the unit_test.hpp include, or specifify it using -D on the command line I get the same results. I tried to look through the headers responsible for defining BOOST_TEST_DYN_LINK but theres a lot of references to "msvc auto-linking" which I of course do not use. Should I be defining BOOST_ALL_DYN_LINK ? I recall it not being set somewhere because boost.build v2 doesn't like it or something. Really i can't make heads or tails of what I should be defining, whether I shouldve defined something when building the unit test libs, or whether I should be defining something building my own. The docs say something about defining BOOST_TEST_DYN_LINK but as stated above, it doesn't seem to make a difference. Chris

2 3

Boost.Test and mpatrol
by KLINIK Markus SDI2-G (AREVA NP GmbH) 30 Apr '07

30 Apr '07

Hi, there seems to be a problem if Boost.Test and mpatrol are used together. The following program hangs and constantly uses more and more memory. How to reproduce the behaviour: System: Windows XP Prof. SP2 MS Visual Studio 7 mpatrol-1.4.8 boost-1.33.1 <code> #define BOOST_AUTO_TEST_MAIN #include <boost/test/auto_unit_test.hpp> BOOST_AUTO_TEST_CASE(testA) { int* a = new int[100]; } </code> After "sourcing" vsvars32.bat the following command was used to compile & link the sample. cl -Zi -EHsc -ML -Ic:\boost\include\boost-1_33_1 test.cpp -link -libpath:c:\local\lib mpatrol.lib -libpath:c:\boost\lib libboost_unit_test_framework-vc7-s.lib Static linkage of mpatrol results in the same behaviour: cl -Zi -EHsc -ML -Ic:\boost\include\boost-1_33_1 test.cpp -link -libpath:c:\local\lib libmpatrol.lib imagehlp.lib -libpath:c:\boost\lib libboost_unit_test_framework-vc7-s.lib Same with -MT, mpatrolmt.lib and libboost_unit_test_framework-vc7-mt-s.lib The combinations -MLd, mpatrol.lib and libboost_unit_test_framework-vc7-sgd.lib -MTd, mpatrolmt.lib and libboost_unit_test_framework-vc7-mt-sgd.lib do not result in the erroneous behaviour, but memory debugging is buggy because mpatrol and the M$ debug malloc implementation are incompatible (according to the mpatrol documentation/mailing list). I've posted the bug description here because I don't know where to start. Even "it is their fault" pointers would be helpful. Thanks in advance, Markus Appendix: real quick howto install mpatrol (to make it work for this example): - download from http://www.cbmamiga.demon.co.uk/mpatrol/files/mpatrol_1.4.8.tar.gz - unpack to c:\src - cmd prompt to C:\src\mpatrol\build\windows - "source" vsvars32.bat (YMMV): $ "c:\Programme\Microsoft Visual Studio .NET\Common7\Tools\vsvars32.bat" - $ nmake -f NMakefile all - copy mpatrolmt.lib to c:\local\lib - copy libmpatrolmt.lib to c:\local\lib - copy mpatrolmt.dll to a directory in $PATH (or local directory)

2 1

[SPAM:## 74%] [boost] [Review] The review of the Boost.Guid library starts today (April 30th)
by Hartmut Kaiser 30 Apr '07

30 Apr '07

Hi all, The review of the proposed Boost Guid library written by Andy Tompkins starts today (April 30th, 2007) and ends May 10th, 2007. You can download the library here: http://www.boost-consulting.com/ vault/ (file guid_v7.zip). --------------------------------------------------- About the library: Guid is a library providing an implementation of Globally Unique Identifiers. Guid's are used in many facets of programming, including databases, networks, remote procedures, serializations, transactions, identifying documents, and identifying classes. This library is efficient and is able to create name-based and random-based guids. --------------------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Regards Hartmut Review Manager _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/ listinfo.cgi/boost

1 0