- Boost-users - lists.boost.org

serialization: classes with pimpls
by Noah Roberts 26 Feb '08

26 Feb '08

Any ideas? The only options I can come up with are: 1) break the pimpl idiom by removing the opaqueness or implementing private getter/setter functions for the serialize template. Still get the exception safety of using the pimpl but lose the compile-time decoupling. 2) only implement the serialize function for certain types of archives. This one seems the most interesting actually. 3) write string writers/parsers for serialize to use, which pretty much destroys the whole point of using boost::serialization in the first place. Maybe I'm missing a good option?

1 0

iterator_traits and shared_ptr
by Patrik Jonsson 26 Feb '08

26 Feb '08

Hi, I'm trying to transparently get the type of a shared_ptr or a pod pointer using iterator_traits::value_type. This fails on shared_ptr<T> with the following message: /usr/lib/gcc/x86_64-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_types.h: In instantiation of 'std::iterator_traits<boost::shared_ptr<int> >': crap.cc:5: instantiated from here /usr/lib/gcc/x86_64-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_types.h:129: error: no type named 'iterator_category' in 'class boost::shared_ptr<int>' /usr/lib/gcc/x86_64-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_iterator_base_types.h:131: error: no type named 'difference_type' in 'class boost::shared_ptr<int>' It seems shared_ptr needs difference_type and iterator_category for this to work. Is there another way to accomplish what I'm trying to do? Regards, /Patrik

2 1

[variant] make_recursive_variant containing a variant ?
by Alban Linard 26 Feb '08

26 Feb '08

Hi, i am trying to build a recursive variant containing another variant, as described in the following source code: #include <cstdlib> #include <vector> #include <string> #include <boost/variant.hpp> typedef ::boost::variant < int , bool > first_variant; typedef ::boost::make_recursive_variant < first_variant , ::std::string , ::std::vector< ::boost::recursive_variant_ > >::type second_variant; int main() { first_variant f(true); second_variant s(f); return EXIT_SUCCESS; } It does not compile (g++-4.0 and g++-4.3). It seems that the "first_variant" part of second_variant is not used. Why this behavior ? Is there a workaround ? Thanks, Alban Linard

2 5

Boost.Test unit testing examples: stale links
by Bram Kuijper 26 Feb '08

26 Feb '08

Hi all, I don't know if this is the right place for it, but I wanted to report a number of stale links on the Boost.Test website. It regards the examples of the Unit Testing Framework, example 1 to 5 on page http://www.boost.org/libs/test/doc/examples/index.html : http://www.boost.org/libs/test/doc/examples/unit_test_example1.html http://www.boost.org/libs/test/doc/examples/unit_test_example2.html http://www.boost.org/libs/test/doc/examples/unit_test_example3.html http://www.boost.org/libs/test/doc/examples/unit_test_example4.html http://www.boost.org/libs/test/doc/examples/unit_test_example5.html since I really would like to see some examples of this testing framework, I wonder if it is possible to have these examples back online? thanks, Bram Kuijper

1 0

Re: [Boost-users] boost exceptions on MacOS 10.5
by David Thulson 26 Feb '08

26 Feb '08

Hello, I have had similar problems in OSX 10.5 where exceptions are not caught, but with a different project. We are using CMake. I'm not sure how familiar you are with CMake, but it is a build system that allows you to generate projects for "native" development tools. In OSX, you can create Xcode projects or makefiles. If I use Xcode to build the project, I cannot catch exceptions consistently. If I use makefiles, it works fine. You can see the discussion on the CMake list here: http://www.cmake.org/pipermail/cmake/2008-January/019091.html The compiler flags that are used are significantly different, so that seems like a likely problem. Unfortunately, I have not had time to finish tracking the issue down. I'm not really familiar with building boost so maybe this is obvious, but how are you building it? What compiler flags are you using? David Thulson

3 2

BGL: ColorMap for depth_first_search
by Christian Sturz 26 Feb '08

26 Feb '08

Hi, I've an urgent question on a BGL algorithm. I want to use the depth_first_search algorithm from the Boost Graph Library. However, I've problems with the definition of my own ColorMap. To illustrate this, here is an example (taken from http://www.boost.org/libs/graph/example/dfs-example.cpp) int main() { // Select the graph type we wish to use typedef adjacency_list < vecS, vecS, directedS > graph_t; typedef graph_traits < graph_t >::vertices_size_type size_type; // Set up the vertex names enum { u, v, w, x, y, z, N }; char name[] = { 'u', 'v', 'w', 'x', 'y', 'z' }; // Specify the edges in the graph typedef std::pair < int, int >E; E edge_array[] = { E(u, v), E(u, x), E(x, v), E(y, x), E(v, y), E(w, y), E(w, z), E(z, z) }; graph_t g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); // Typedefs typedef boost::graph_traits < graph_t >::vertex_descriptor Vertex; typedef size_type* Iiter; // discover time and finish time properties std::vector < size_type > dtime(num_vertices(g)); std::vector < size_type > ftime(num_vertices(g)); size_type t = 0; dfs_time_visitor < size_type * >vis(&dtime[0], &ftime[0], t); // Some arbitrary vertex as root (start point of DFS) Vertex root = source( edge_array[2],g ); depth_first_search(g, visitor(vis), myColorMap, root ); return 0; } My problem is the definition of "myColorMap" which must be a model of Read/Write Property Map. However, I have no idea how to define a working ColorMap. It would be fully sufficient to take the default color map which is used when DFS is invoked with "depth_first_search(g, visitor(vis));" Do you have an idea how I define a ColorMap that I can use for "myColorMap"? Any help is appreciated. Thank you. Christian -- Psst! Geheimtipp: Online Games kostenlos spielen bei den GMX Free Games! http://games.entertainment.web.de/de/entertainment/games/free

1 0

[noob] I have pointer, ptr_list::release wants iterator
by Szczepan Hołyszewski 26 Feb '08

26 Feb '08

I have a pointer to an object that is in a ptr_list, and I want to "detach" the object from the list without deleting it. Problem: ptr_list::release() wants an iterator, not a pointer. A naive attempt at std::finding the iterator fails because ptr_list's indirection kicks in and std::find ends up wanting to compare values instead of pointers. Luckily my objects aren't equality comparable so I get a compile error instead of an elusive bug. As a workaround I just walk the list with BOOST_FOREACH() but it feels kludgy. Is there a "designed" way to feed a ptr_list an element pointer and milk the corresponding iterator? Is there a direct way do detach an item from ptr_list without deleting it? Did I overlook something obvious? Thanks in advance, Szczepan Holyszewski

2 1

BGL: ColorMap for depth_first_search
by Christian Sturz 25 Feb '08

25 Feb '08

Hi, I want to use the depth_first_search algorithm. Since I need the DFS version where a start vertex is specified, I also have to define a ColorMap. That's the function I want to use: template <class Graph, class DFSVisitor, class ColorMap> void depth_first_search(const Graph& g, DFSVisitor vis, ColorMap color, typename graph_traits<Graph>::vertex_descriptor start) However, I'm not able to define a working ColorMap. Since the map is irrelevant for me, the default ColorMap would be fully sufficient. Could you give me a hint how to create it? And another short question. I want to iterate the graph backwards via DFS. Could I use the "reverse_graph adaptor" with: depth_first_search( boost::make_reverse_graph(G), visitor( vis ) ...)? Regards, Christian -- GMX startet ShortView.de. Hier findest Du Leute mit Deinen Interessen! Jetzt dabei sein: http://www.shortview.de/?mc=sv_ext_mf@gmx

1 0

Linking problem with read_graphviz
by Michaela Kedikova 25 Feb '08

25 Feb '08

Hello, I'm new to boost(I'm working with boost_1_34_1) and I have a problem with read_graphviz. I'm working with MSVC 8. I've already built all external libraries using bjam and link them to my project. I also built libbgl-viz.lib, which contains all the source files in libs/graph/src.(As it was suggested in a thread) But I still have a link-error when I try to compile the graphviz.cpp example. I've searched in the mailing-list for solutions of this problem, but I didn't find anything, which helped me. Now I hope that somebody could give me a hint, what the problem may be. (My suggestion is, whether there is a missing object in a library or there are some difficulties between boost1_34_1 and MSVC 8.0). I post the error message below: 1>test_graphviz.obj : error LNK2019: unresolved external symbol "void __cdecl boost::read_graphviz(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &,class boost::subgraph<class boost::adjacency_list<struct boost::vecS,struct boost::vecS,struct boost::undirectedS,struct boost::property<enum boost::vertex_attribute_t,class std::map<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,struct std::less<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > >,class std::allocator<struct std::pair<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const ,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > > > >,struct boost::no_property>,struct boost::property<enum boost::edge_attribute_t,class std::map<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,struct std::less<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > >,class std::allocator<struct std::pair<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const ,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > > > >,struct boost::property<enum boost::edge_index_t,int,struct boost::no_property> >,struct boost::property<enum boost::graph_graph_attribute_t,class std::map<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,struct std::less<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > >,class std::allocator<struct std::pair<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const ,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > > > >,struct boost::property<enum boost::graph_vertex_attribute_t,class std::map<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,struct std::less<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > >,class std::allocator<struct std::pair<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const ,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > > > >,struct boost::property<enum boost::graph_edge_attribute_t,class std::map<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,struct std::less<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > >,class std::allocator<struct std::pair<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const ,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > > > >,struct boost::property<enum boost::graph_name_t,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,struct boost::no_property> > > >,struct boost::listS> > &)" (?read_graphviz@boost@@YAXABV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@AAV?$subgraph@V?$adjacency_list@UvecS@boost@@U12@UundirectedS@2@U?$property@W4vertex_attribute_t@boost@@V?$map@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V12@U?$less@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@2@V?$allocator@U?$pair@$$CBV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V12@@std@@@2@@std@@Uno_property@2@@2@U?$property@W4edge_attribute_t@boost@@V?$map@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V12@U?$less@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@2@V?$allocator@U?$pair@$$CBV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V12@@std@@@2@@std@@U?$property@W4edge_index_t@boost@@HUno_property@2@@2@@2@U?$property@W4graph_graph_attribute_t@boost@@V?$map@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V12@U?$less@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@ D@2@@std@@@2@V?$allocator@U?$pair@$$CBV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V12@@std@@@2@@std@@U?$property@W4graph_vertex_attribute_t@boost@@V?$map@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V12@U?$less@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@2@V?$allocator@U?$pair@$$CBV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V12@@std@@@2@@std@@U?$property@W4graph_edge_attribute_t@boost@@V?$map@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V12@U?$less@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@@2@V?$allocator@U?$pair@$$CBV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@V12@@std@@@2@@std@@U?$property@W4graph_name_t@boost@@V?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@Uno_property@2@@2@@2@@2@@2@UlistS@2@@boost@@@1@@Z) referenced in function _main 1>D:\Mihaela\Projects_Cpp\Test_Boost\Debug\Test_graphviz.exe : fatal error LNK1120: 1 unresolved externals Sorry for my bad english. Thanks in advance, Mishe __________________________________________________________ Sent from Yahoo! Mail. A Smarter Inbox. http://uk.docs.yahoo.com/nowyoucan.html

1 0

betweenness centrality
by ivanballatore＠libero.it 25 Feb '08

25 Feb '08

Hi, i'm an italian developper and i have a question about the function brandes_betweenness_centrality. I would know if it's possbile to run brandes_betweenness_centrality only on a subset of nodes of a graph, because the execution of the function on the entire graph is too long. I want to calculate the betweenness approximation starting from the value computed for this subset of vetexes. Sorry for my english(i'm italian...).

1 0