February 2007 - Boost-users

Build difficulty on Darwin
by Rick Mann 06 Feb '07

06 Feb '07

Hi. I'm trying to build boost (to support a different project), and I'm having a certain amount of difficulty. I run: > $ bjam "-sTOOLS=darwin" stage and it goes off and churns for a bit, but a few things fail: > darwin-Link-DyLib-action bin/boost/libs/test/build/ > libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/ > libboost_prg_exec_monitor-d-1_33_1.dylib > ld: Undefined symbols: > __Z8cpp_mainiPPc > /usr/bin/libtool: internal link edit command failed > > DYLD_LIBRARY_PATH=bin/boost/libs/test/build/ > libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true > export DYLD_LIBRARY_PATH > ld -dynamic -m -r -d -o "bin/boost/libs/test/build/ > libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/ > libboost_prg_exec_monitor-d-1_33_1.lo" "bin/boost/libs/test/build/ > libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/ > execution_monitor.o" "bin/boost/libs/test/build/ > libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/ > cpp_main.o" \ > && \ > c++ -g -o "bin/boost/libs/test/build/ > libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/ > libboost_prg_exec_monitor-d-1_33_1.dylib" "bin/boost/libs/test/ > build/libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable- > true/libboost_prg_exec_monitor-d-1_33_1.lo" \ > \ > -dynamiclib -install_name "libboost_prg_exec_monitor- > d-1_33_1.dylib" \ > && \ > rm -f "bin/boost/libs/test/build/ > libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/ > libboost_prg_exec_monitor-d-1_33_1.lo" > > ...failed darwin-Link-DyLib-action bin/boost/libs/test/build/ > libboost_prg_exec_monitor.dylib/darwin/debug/shared-linkable-true/ > libboost_prg_exec_monitor-d-1_33_1.dylib... > ...skipped <@boost!lib>libboost_prg_exec_monitor-d-1_33_1.dylib for > lack of <@boost!libs!test!build/libboost_prg_exec_monitor.dylib/ > darwin/debug/shared-linkable-true>libboost_prg_exec_monitor- > d-1_33_1.dylib... > MkDir1 bin/boost/libs/test/build/libboost_prg_exec_monitor.dylib/ > darwin/release There are a few other failures (6 in all): libboost_prg_exec_monitor-d-1_33_1.dylib libboost_prg_exec_monitor-1_33_1.dylib libboost_test_exec_monitor-d-1_33_1.dylib libboost_test_exec_monitor-1_33_1.dylib libboost_unit_test_framework-d-1_33_1.dylib libboost_unit_test_framework-1_33_1.dylib In the end, I am unable to build a GNU tool that relies on boost regex, which is really all I want to do. Any help would be much appreciated. Thanks! (Current Mac OS X 10.4.8, current Xcode tools 2.4.1) -- Rick

1 0

How to wrap a static function, which returns a reference to a static object.
by Jin Sun 06 Feb '07

06 Feb '07

I am learning Boost Python. One question is bothering me. I have some code like the following. class A { Public: static B* getB() { return _B;} private: A(); staitc B* _B; } How to wrap function getB()? thanks!!! Jin Sun --------------------------------------------------------- Rekhi Hall 301 1400 Townsend Dr. Houghton MI, 49931 USA Phone: 906-370-2261 ---------------------------------------------------------

1 0

problem with unit test framework
by Vincent Torri 05 Feb '07

05 Feb '07

Hey, I'm trying to use the unit test framework of Boost, but my program seg fault. My code is based on that example: http://boost.org/libs/test/example/unit_test_example3.cpp Here is the code : http://rafb.net/p/5UDMk864.html Here is the backtrace : http://rafb.net/p/GT86KB44.html does someone see the problem ? thank you Vincent Torri

3 7

seed for hash
by Rares Vernica 05 Feb '07

05 Feb '07

Hi, Does the hash function uses a seed? If a call: boost::hash<std::string> string_hash; std::size_t h = string_hash("Hash me"); and then after a year I call again: string_hash("Hash me"); Does it return the same value? Thanks a lot, Ray

2 2

[boost::serialization] Howto store derived classes through pointer to base - with templates and own archive?
by Marc Wäckerlin 05 Feb '07

05 Feb '07

Hi I have the following problem: My class structure is somehow like that: class A; // is pure virtual template <int NUM, typename ENUM> class B: public A; [...] I use my BinaryWrite archive class, as specified in thread: "[boost::serialization] Binary Stream with noAdditional Info: Here's the solution! [Howto derieve ownserialization archive?]" Now, when I try to stream a std::vector < boost::shared_ptr < A > > then I see in the function-trace log, that my writer has been called for the parent type A, but not for the derived types (B, C, ...). After this, I read again the "Except for one special case" part in the Archive Class Reference manual. After this, I added the following code in front of my archive type: ==================================================================== namespace image { class BinaryWriter; class BinaryReader; } #define BOOST_ARCHIVE_CUSTOM_OARCHIVE_TYPES ::image::BinaryWriter #define BOOST_ARCHIVE_CUSTOM_IARCHIVE_TYPES ::image::BinaryReader #include <boost/archive/detail/iserializer.hpp> #include <boost/archive/detail/oserializer.hpp> #include <boost/archive/detail/common_iarchive.hpp> #include <boost/archive/detail/common_oarchive.hpp> #include <boost/serialization/export.hpp> ==================================================================== But it still does not step into the correct child. After some more reading, I guess, that I'd have to use BOOST_CLASS_EXPORT(B), but that does not compile, because B is a template class. What's wrong, what's missing, what do I have to do? Thank you Regards Marc

4 11

Re: [Boost-users] [graph] BFS and dedicated color map
by Dmitry 05 Feb '07

05 Feb '07

"Jens Muller" <jens.mueller(a)ira.uka.de> wrote in message news:<eq58j2$v4m$1(a)sea.gmane.org>... > > Jens, > > I think that you are missing something. As for me, the property_traits class > > is just a way of uniform data manipulation. > > If every pm needed to be a class, there would be no need for the > *_traits template classes. > > http://www.boost.org/libs/graph/doc/leda_conversion.html > > The Adaptor pattern [12] typically requires that the adaptee object be > contained inside a new class that provides the desired interface. This > containment is not required when wrapping a graph for BGL because the > BGL graph interface consists solely of free (global) functions. Instead > of creating a new graph class, you need to overload all the free > functions required by the interface. We call this free function wrapper > approach external adaptation > > ... > > All types associated with a BGL graph class are accessed though the > graph_traits class. We can partially specialize this traits class for > the LEDA GRAPH class in the following way. > > > The same is done here for vectors and the like. > Unfortunately I can't follow this :-( > > Your class has to be a model of > > this abstract concept. (To be a Read Property Map it is enough to have 3 > > typedefs and get() function, see Concept Checking Class in the documentation > > that you referred). > > Yes, it says the get() free function and 3 typedefs in property_traits > need to be defined. > > Anyway, it works now, see attachments. The changes in "bfs_map_test.cpp" are exactly I was thinking of) > One question remains, though: > > template<typename Graph, typename ReadablePropertyMap, typename ColorValue> > ColorValue MapAsColorMap<Graph, ReadablePropertyMap, > ColorValue>::get(key_type key) > { > return (boost::get(pm_, key)==white_) ? > boost::color_traits<ColorValue>::white() > : > boost::color_traits<ColorValue>::black(); > } > > > works, while get(pm_, key) without boost:: doesn't. > > Shouldn't the right get function be found by Koenig lookup? Probably yes, but AFAIK not all compilers have it implemented. > http://www.boost.org/libs/property_map/ReadablePropertyMap.html says, > too, that get is required, not boost::get ... I think this is because ReadablePropertyMapConcept class already defined in boost:: namespace. Regards, --Dmitry.

1 0

Re: [Boost-users] [graph] BFS and dedicated color map
by Dmitry 04 Feb '07

04 Feb '07

"Jens Muller" <jens.mueller(a)ira.uka.de> wrote in message news:<eq4poi$go9$1(a)sea.gmane.org>... > Dmitry schrieb: > > Jens, the ReadablePropertyMap parameter has to be a class with the following > > typedef at least: > > > > typedef value_type some_type; > > > > > Why? > > http://www.boost.org/libs/property_map/ReadablePropertyMap.html says: > > Associated Types > Value Type boost::property_traits<PMap>::value_type The type of the > property. > > That's what these traits classes are for: external adaption. > > You replied to the fixed version where I use property_traits. Jens, I think that you are missing something. As for me, the property_traits class is just a way of uniform data manipulation. Your class has to be a model of this abstract concept. (To be a Read Property Map it is enough to have 3 typedefs and get() function, see Concept Checking Class in the documentation that you referred). --Dmitry

2 1

Re: [Boost-users] [BGL] Max (min) cycle ratio
by Dmitry 04 Feb '07

04 Feb '07

Doug, It's there (in the Algorithm/graph directory). Pleas take a look. WBR --Dmitry > Hello, > > On Fri, 2006-12-08 at 18:33 +0100, Dmitry wrote: > > For a some time I've been using my own implementation for calculating of the > > minimum cycle ratio of the directed multigraph, it based on the approach > > described in the paper > > "Numerical Computation of Spectral Elements in MAX-PLUS algebra" and seems > > has complexity close to linear in the respect of the edges number (both in > > memory and time). > > > > Does current BGL has some solutions for cycle ratio problem? > > We do not have any algorithm implementations for this problem in the > BGL. > > > I would like to > > try to contribute my "perfect" implementation to BGL if it's possible. What > > is need to be done for it? > > Great! The major components of an algorithm submission to the BGL are: > > - The algorithm implementation itself: please be sure to follow the > general coding style of the BGL > - Documentation: Should be written in HTML, with the same format and > style as existing BGL algorithms. > - Tests: Please provide a standalone testcase that builds a few sample > graphs, runs the algorithm, and checks the results. I strongly suggest > using adjacency_list<listS, listS, ...> for the graph type, because that > tends to find many common mistakes in BGL algorithms. > - Examples: Please provide at least one example file that illustrates > how to use your algorithm. This example is typically part of the > documentation. > > When you're ready to submit your algorithm implementation, please upload > it to the Boost file vault at http://www.boost-consulting.com/vault/ and > send a message to the Boost list to tell us that it's there. We'll give > the code an informal review and, once everything's in good shape, > integrate it into Boost CVS for an upcoming Boost release. > > We're looking forward to including your algorithm implementation in the > BGL! > > Cheers, > Doug

1 0

[graph] BFS and dedicated color map
by Jens Müller 04 Feb '07

04 Feb '07

The BGL implementation of breadth-first search uses a dedicated color map. I had the following idea: Some algorithms don't need to distinguish black/gray, but have an unused value in e.g. a distance map, e.g. -1, to which the map can be initialised. So I tried to write a map adapter which can be passed such a map together with the value indicating "white". This adapter will return white whenever the value in the underlying map equals this value, black otherwise. Unfortunately, my C++ seems to be too bad to implement this ... Please see the attached source files ... The errors I'm currently getting: In file included from bfs_map_test.cpp:14: bfs_distmap_as_color_map.hpp:42: error: ISO C++ forbids declaration of `graph_traits' with no type bfs_distmap_as_color_map.hpp:42: error: expected `;' before '<' token bfs_distmap_as_color_map.hpp:47: error: `key_type' has not been declared bfs_distmap_as_color_map.hpp:47: error: ISO C++ forbids declaration of `key' with no type bfs_distmap_as_color_map.hpp:62: error: `ColorValue MapAsColorMap<Graph, ReadablePropertyMap, ColorValue>::get' is not a static member of `class MapAsColorMap<Graph, ReadablePropertyMap, ColorValue>' bfs_distmap_as_color_map.hpp:62: error: template definition of non-template `ColorValue MapAsColorMap<Graph, ReadablePropertyMap, ColorValue>::get' bfs_distmap_as_color_map.hpp:62: error: `key_type' was not declared in this scope bfs_distmap_as_color_map.hpp:63: error: expected `;' before '{' token bfs_distmap_as_color_map.hpp:70: error: `key_type' has not been declared bfs_distmap_as_color_map.hpp:71: error: ISO C++ forbids declaration of `key' with no type bfs_distmap_as_color_map.hpp: In instantiation of `MapAsColorMap<main(int, char**)::Graph, size_t[], int>': bfs_map_test.cpp:58: instantiated from here bfs_distmap_as_color_map.hpp:49: error: `size_t[]' is not a class, struct, or union type bfs_distmap_as_color_map.hpp:58: error: `size_t[]' is not a class, struct, or union type bfs_map_test.cpp: In function `int main(int, char**)': bfs_map_test.cpp:58: error: no matching function for call to `MapAsColorMap<main(int, char**)::Graph, size_t[], int>::MapAsColorMap(size_t[5], int)' bfs_distmap_as_color_map.hpp:40: note: candidates are: MapAsColorMap<main(int, char**)::Graph, size_t[], int>::MapAsColorMap(const MapAsColorMap<main(int, char**)::Graph, size_t[], int>&) bfs_map_test.cpp:71: error: `copy_graph' undeclared (first use this function) bfs_map_test.cpp:71: error: (Each undeclared identifier is reported only once for each function it appears in.) bfs_map_test.cpp:88: error: `print_parent' undeclared (first use this function) bfs_map_test.cpp:88: error: expected primary-expression before '>' token bfs_map_test.cpp:91: error: expected `}' at end of input g++34 -c -o bfs_map_test.o -g -Wall -Wno-deprecated -pipe -O -I. -I/home/jmueller/software-gcc34/boost/include/boost-1_33_1 -I/sw/linux/LEDA/LEDA-5.0.1/include -I/sw/linux/LEDA/LEDA-5.0.1/incl -I/sw/linux/LEDA/LEDA-5.0.1/incl_old bfs_map_test.cpp Could someone point out the most stupid bugs? Thanks a lot in advance ...

2 7

array sink of unknown size
by grahamspam＠earthlink.net 04 Feb '07

04 Feb '07

Hello, I need a filtering_ostream that efficiently yields a char* and it's size (i.e., it allocates the memory it needs). I have no way of knowing or predicting the number of chars resulting from uncompressing the input (?). For efficiency it would be nice to specify an estimate and a "chunking" size, but the filtering_ostream would actually allocate all that is needed. I looked at this: boost::iostreams::stream< boost::iostreams::array_sink > but it seems to need a terminating char* or a size in its ctor. What is recommended? Thanks!

1 0