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

Re: [Boost-users] Multi-Index compound key synthesis via MPL
by Joaquín Mª López Muñoz 24 Jan '06

24 Jan '06

[Luke, this message from you shows up at Google Groups frontend, but somehow it hasn't really made it to the users list. Responding to the list in the hope that at least this answer gets properly processed.] Luke Meyers ha escrito: > The indexed_by construct for a multi_index_container can be replaced by > an mpl::vector, so that the list can be synthesized. I would like to > do the same thing with compound_key, to synthesize such a key based on > a list of types. Can I do this? Alas there's no version of composite_key accepting an MPL sequence instead of the direct enumeration of the constituent key extractors. But with a little MPL and preprocessor stuff, however, you can do what you want, see the attached snippet. HTH, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[Boost][Bind] How to bind template function member
by Marc Viala 24 Jan '06

24 Jan '06

Hi, I would like to know how I can use boost::bind with template function member? To explain my problem, you will find hereafter an example code that demonstrates it. In this code, when we try to bind the function member X::g the compiler failed with tons of error message. Am I doing something wrong? Best regards, Marc Viala mailto:mviala@acticm.com ----------------------------------- Platform: VC++ 7.1 Boost 1.33.1 ----------------------------------- #include <boost/bind.hpp> #include <boost/function.hpp> struct X { template<typename A, typename B> void g(A& a, B& b) { std::cout << a << " " << b << '\n' ; } void f(int& i) { std::cout << i << '\n'; } } ; template<typename A, typename B> void e(A& a, B& b) { std::cout << a << " " << b << '\n' ; } int main(int argc, char* argv[]) { int a = 10, b = 11 ; X x ; boost::function<void (void)> pe = boost::bind(&e<int,int>, a, b) ; // <- OK pe() ; boost::function<void (void)> pg = boost::bind(&X::g<int,int>, &x, a, b) ; // <- Don't compile? pg() ; boost::function<void (void)> pf = boost::bind(&X::f, &x, a) ; // <- OK pf() ; }

3 4

beginners problems linking serialization library
by Michael Shapiro 24 Jan '06

24 Jan '06

I am having problems linking a program using the serialization library. I have made a small program, considerably simpler than the demo.cpp listed at http://www.boost.org/libs/serialization/doc/tutorial.html and I have also tried linking demo.cpp itself. My hpp files are in /home/mshapiro.local/boost/include/boost-1_32/boost/ My libraries are in /home/mshapiro.local/boost/lib/ I have tried linking this code with gcc 3.4.5 on a linux machine using gcc -I/home/mshapiro.local/boost/include/boost-1_32/ \ -L/home/mshapiro.local/boost/lib/ \ -lboost_serialization-gcc \ demo.cpp I have tried many variations on this! (For example, I have tried g++ instead of gcc, I have tried all variations on the serialization library, such as boost_serialization-gcc-d-1_32, etc, I have tried turning off warnings as suggested in the compiler specific issues.) I can compile using the -c flag, but I cannot link it. I get a large number of error messages all of which look much like /tmp/ccuSnkzu.o(.gnu.linkonce.t._ZN5boost7archive18text_oarchive_implINS0_13text_oarchiveEED1Ev+0x51): In function `boost::archive::text_oarchive_impl<boost::archive::text_oarchive>::~text_oarchive_impl()': : undefined reference to `boost::archive::basic_text_oprimitive<std::basic_ostream<char, std::char_traits<char> > >::~basic_text_oprimitive()' I can find various references to this exact problem in the newsgroups, but can find no solution to it. Your help would be greatly appreciated. Many thanks in advance, Michael Shapiro

4 4

Re: [Boost-users] [tuple] no easy access to get function
by JOAQUIN LOPEZ MU?Z 23 Jan '06

23 Jan '06

----- Mensaje original ----- De: François Duranleau <duranlef(a)iro.umontreal.ca> Fecha: Domingo, Enero 22, 2006 6:08 am Asunto: Re: [Boost-users] [tuple] no easy access to get function > On Sat, 21 Jan 2006, JOAQUIN LOPEZ MU?Z wrote: > > > ----- Mensaje original ----- > > De: Frank Birbacher <bloodymir.crap(a)gmx.net> > > Fecha: Sábado, Enero 21, 2006 2:29 am > > Asunto: [Boost-users] [tuple] no easy access to get function > > > >> Today I wanted to std::transform a range of tuples into a > sequence of > >> one element. I thought I could just take the address of some > >> tuple::get<N> function. Maybe also specify the Tuple type as > template>> parameter [...] > >> I'd rather want to take the address of boost::tuple::get<N,Tuple>, > >> but the template parameters won't match. > > > > Maybe you forgot the final s in "tuples" when > > writing > > > > boost::tuples::get<N,Tuple> > > There is a thin wrapper declared in the boost namespace as well. > The > probleme is elsewhere. The argument to the get function is not a > boost::tuple<>, but some base class template. Thus the template > arguments > of the function are not and an integer and a tuple, but an integer > and > something else (actually, a cons<HT,TT> if you look in the code). > To take > the address of such a function, you need to bind the integer, as > well as > HT and TT, not a tuple. Yep, I see. You're right. Well, you can refer to get<> as follows boost::tuples::get<N,typename Tuple::inherited> Note that this is not relying on undocumented implementation, so called "const lists" are explained and made public at http://boost.org/libs/tuple/doc/tuple_advanced_interface.html So I'd say you can use the former reference to get safely. > > However, I am wondering if there would be a problem to declare the > thin > wrapper simply like this (example with the const version): > > template< int N , > typename Tuple > > inline > typename tuples::access_traits< > typename tuples::element< N , Tuples >::type > >::const_type > get( const Tuple& t ) > { > return tuples::get< N >( c ) ; > } > > ? That would also work, but my proposal above is simpler. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

3 2

BUG: example boost_file_dependencies.cpp does not compile.
by Robert McCullough 23 Jan '06

23 Jan '06

Hi, I have tried to compile the example boost_file_dependencies.cpp using version 1.33.1 under Linux (gcc) and Windows XP (VC 7.1) and get the same errors. It does not like the following call to dijkstra_shortest_paths_no_init(). If I commit this function out it compiles fine. Any ideas on how to fix this? // Run best-first-search from each vertex with zero in-degree. for (tie(i, iend) = vertices(g); i != iend; ++i) { if (in_degree[*i] == 0) { std::vector<graph_traits<Graph>::vertex_descriptor> pred(num_vertices(g)); property_map<Graph, vertex_index_t>::type indexmap = get(vertex_index, g); dijkstra_shortest_paths_no_init (g, *i, &pred[0], &time[0], weight, indexmap, compare, combine, 0, // Since we are using > instead of >, we (std::numeric_limits<int>::max)(), // flip 0 and inf. default_dijkstra_visitor()); } } List of some of the output. Compiling... boost_file_dependencies.cpp c:\Boost\include\boost-1_33_1\boost\property_map.hpp(25) : error C2039: 'key_type' : is not a member of 'boost::dijkstra_visitor<>' c:\Boost\include\boost-1_33_1\boost\graph\breadth_first_search.hpp(61) : see reference to class template instantiation 'boost::property_traits<PA>' being compiled with [ PA=boost::dijkstra_visitor<> ] c:\Boost\include\boost-1_33_1\boost\graph\dijkstra_shortest_paths.hpp(207) : see reference to function template instantiation 'void boost::breadth_first_visit<VertexListGraph,MutableQueue,boost::detail::dijks tra_bfs_visitor<UniformCostVisitor,UpdatableQueue,WeightMap,PredecessorMap,D istanceMap,BinaryFunction,BinaryPredicate>,ColorMap>(const IncidenceGraph &,boost::graph_traits<G>::vertex_descriptor,Buffer &,BFSVisitor,ColorMap)' being compiled with [ VertexListGraph=Graph, UniformCostVisitor=std::numeric_limits<int>::_Ty, UpdatableQueue=MutableQueue, WeightMap=boost::property_map<Graph,boost::edge_weight_t>::type, PredecessorMap=__w64 unsigned int *__w64 , DistanceMap=int *__w64 , BinaryFunction=boost::closed_plus<int>, BinaryPredicate=std::greater<int>, ColorMap=boost::dijkstra_visitor<>, IncidenceGraph=Graph, G=Graph, Buffer=MutableQueue, BFSVisitor=boost::detail::dijkstra_bfs_visitor<std::numeric_limits<int>::_Ty ,MutableQueue,boost::property_map<Graph,boost::edge_weight_t>::type,__w64 unsigned int *__w64 ,int *__w64 ,boost::closed_plus<int>,std::greater<int>> ] c:\Visual Studio Projects\boost_file_dependencies\boost_file_dependencies\boost_file_dependen cies.cpp(178) : see reference to function template instantiation 'void boost::dijkstra_shortest_paths_no_init<Graph,std::numeric_limits<int>::_Ty,s td::allocator<_Ty>::value_type*__w64 ,std::allocator<int>::value_type*__w64 ,boost::property_map<Graph,Property>::type,boost::property_map<Graph,boost:: vertex_index_t>::type,std::greater<int>,boost::closed_plus<T>,int,boost::dij kstra_visitor<>>(const VertexListGraph &,boost::graph_traits<G>::vertex_descriptor,PredecessorMap,DistanceMap,Weigh tMap,IndexMap,Compare,Combine,DistZero,DijkstraVisitor,ColorMap)' being compiled with [ _Ty=Vertex, Graph=Graph, Property=boost::edge_weight_t, T=int, VertexListGraph=Graph, G=Graph, PredecessorMap=std::allocator<Vertex>::value_type *__w64 , DistanceMap=std::allocator<int>::value_type *__w64 , WeightMap=boost::property_map<Graph,boost::edge_weight_t>::type, IndexMap=boost::property_map<Graph,boost::vertex_index_t>::type, Compare=std::greater<int>, Combine=boost::closed_plus<int>, DistZero=int, DijkstraVisitor=std::numeric_limits<int>::_Ty, ColorMap=boost::dijkstra_visitor<> ] c:\Boost\include\boost-1_33_1\boost\property_map.hpp(25) : error C2146: syntax error : missing ';' before identifier 'key_type' c:\Boost\include\boost-1_33_1\boost\property_map.hpp(26) : error C2039: 'value_type' : is not a member of 'boost::dijkstra_visitor<>' c:\Boost\include\boost-1_33_1\boost\property_map.hpp(26) : error C2146: syntax error : missing ';' before identifier 'value_type' c:\Boost\include\boost-1_33_1\boost\property_map.hpp(27) : error C2039: 'reference' : is not a member of 'boost::dijkstra_visitor<>' c:\Boost\include\boost-1_33_1\boost\property_map.hpp(27) Best regards, Robert McCullough ------------------------------ Software Engineer Promess Incorporated 11429 E. Grand River Brighton, MI. 48116 Phone: 810-229-9334 Fax: 810-229-8125 Email: rob(a)promessdev.com URL: www.promessinc.com <http://www.promessinc.com/> "Get your facts first and then you can distort them as much as you wish." --- Mark Twain

2 1

trouble building bgl-viz
by VP of Communciations 23 Jan '06

23 Jan '06

I have successfully installed boost with VC express (windows), but am having trouble getting the DOT reader going. I don't seem to have the bgl-viz library. I have followed the directions on the "getting started" page and the read_graphviz page, but I must be doing something wrong, because I am not getting the bgl-viz library. I'm new to boost and C++, so please forgive me if these are elementary questions. How do I build the bgl-viz library? Thanks.

2 1

graph compile error with gcc3.3 when edge container is slist
by Weiqing Guo 23 Jan '06

23 Jan '06

Hi, the attached source code is copied from boost_1_33_0/libs/graph/example/adjacency_list.cpp, I only changed the edge container to be slist, and include <slist.h> I compiled it on linux with AMD opteron 844 processor. gcc2.95.3 works fine, but gcc3.3 doesn't compile. I think the reason is slist is not in std namespace in gcc3.3, and adjacency_list.hpp doesn't handle this correctly for slist. > grep BOOST_STD_EXTENSION_NAMESPACE adjacency_list.hpp adjacency_list.hpp: typedef BOOST_STD_EXTENSION_NAMESPACE::slist<ValueType> type; adjacency_list.hpp: typedef BOOST_STD_EXTENSION_NAMESPACE::hash_set<ValueType> type; adjacency_list.hpp: typedef BOOST_STD_EXTENSION_NAMESPACE::hash_set<ValueType> type; adjacency_list.hpp: struct bind_ { typedef BOOST_STD_EXTENSION_NAMESPACE::hash_set<T, std::less<T> > type; }; adjacency_list.hpp: struct bind_ { typedef BOOST_STD_EXTENSION_NAMESPACE::hash_set<T, std::less<T> > type; }; should slist be handled the same way as hash_set ? thanks weiqing //======================================================================= // Copyright 1997, 1998, 1999, 2000 University of Notre Dame. // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= #include <boost/config.hpp> #include <iostream> #include <vector> #include <slist.h> #include <utility> #include <string> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graph_utility.hpp> #include <boost/property_map.hpp> /* Sample Output graph name: foo 0 --joe--> 1 1 --joe--> 0 --curly--> 2 --dick--> 3 2 --curly--> 1 --tom--> 4 3 --dick--> 1 --harry--> 4 4 --tom--> 2 --harry--> 3 (0,1) (1,2) (1,3) (2,4) (3,4) removing edge (1,3): 0 --joe--> 1 1 --joe--> 0 --curly--> 2 2 --curly--> 1 --tom--> 4 3 --harry--> 4 4 --tom--> 2 --harry--> 3 (0,1) (1,2) (2,4) (3,4) */ struct EdgeProperties { EdgeProperties(const std::string& n) : name(n) { } std::string name; }; struct VertexProperties { std::size_t index; boost::default_color_type color; }; int main(int , char* []) { using namespace boost; using namespace std; typedef adjacency_list<slistS, listS, undirectedS, VertexProperties, EdgeProperties> Graph; const int V = 5; Graph g(V); property_map<Graph, std::size_t VertexProperties::*>::type id = get(&VertexProperties::index, g); property_map<Graph, std::string EdgeProperties::*>::type name = get(&EdgeProperties::name, g); boost::graph_traits<Graph>::vertex_iterator vi, viend; int vnum = 0; for (boost::tie(vi,viend) = vertices(g); vi != viend; ++vi) id[*vi] = vnum++; add_edge(vertex(0, g), vertex(1, g), EdgeProperties("joe"), g); add_edge(vertex(1, g), vertex(2, g), EdgeProperties("curly"), g); add_edge(vertex(1, g), vertex(3, g), EdgeProperties("dick"), g); add_edge(vertex(2, g), vertex(4, g), EdgeProperties("tom"), g); add_edge(vertex(3, g), vertex(4, g), EdgeProperties("harry"), g); graph_traits<Graph>::vertex_iterator i, end; graph_traits<Graph>::out_edge_iterator ei, edge_end; for (boost::tie(i,end) = vertices(g); i != end; ++i) { cout << id[*i] << " "; for (boost::tie(ei,edge_end) = out_edges(*i, g); ei != edge_end; ++ei) cout << " --" << name[*ei] << "--> " << id[target(*ei, g)] << " "; cout << endl; } print_edges(g, id); cout << endl << "removing edge (1,3): " << endl; remove_edge(vertex(1, g), vertex(3, g), g); ei = out_edges(vertex(1, g), g).first; cout << "removing edge (" << id[source(*ei, g)] << "," << id[target(*ei, g)] << ")" << endl; remove_edge(ei, g); for(boost::tie(i,end) = vertices(g); i != end; ++i) { cout << id[*i] << " "; for (boost::tie(ei,edge_end) = out_edges(*i, g); ei != edge_end; ++ei) cout << " --" << name[*ei] << "--> " << id[target(*ei, g)] << " "; cout << endl; } print_edges(g, id); return 0; }

2 1

Signature of files saved by boost::serialization
by Bo Peng 23 Jan '06

23 Jan '06

Dear list, What would be a good way to tell if a file is saved by boost::serialization? I notice that the first several characters of binary_oarchive saved files are "\026 \0 \0 \0 \0 \0 \0 serialization" and are "22 serialization" for text_oarchive saved files. Are they reliable signatures? Many thanks in advance. Bo

2 3

Boost Graph library
by Olga Gerchikov 23 Jan '06

23 Jan '06

Hi, Does anyone know if there is a Java port of Boost Graph library? Thank you.

2 1

Boost Graph: problems using add_edge()
by João Orvalho 23 Jan '06

23 Jan '06

Hi, I am using boost 1.33.1 with Visual C++ 2002 (v 7.0.9466) and Windows XP (no service pack). I was doing some experiments with boost Graph library . When running the program i get the following error on add_edge(): ---------------------------------------------------------------------- An unhandled exception of type 'System.TypeLoadException' occurred in test.exe Additional information: Could not load type std._Ptrit<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::config::stored_vertex,int,boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::config::stored_vertex *,boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::config::stored_vertex &,boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,bo0a748880 from assembly test, Version=0.0.0.0, Culture=neutral, PublicKeyToken=null. ---------------------------------------------------------------------- The program is: ---------------------------------------------------------------------- #include <iostream> // for std::cout #include <utility> // for std::pair #include <algorithm> // for std::for_each #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> using namespace boost; int main(int,char*[]) { // create a typedef for the Graph type typedef adjacency_list<vecS, vecS, bidirectionalS> Graph; // Make convenient labels for the vertices enum { A, B, C, D, E, N }; const int num_vertices = N; const char* name = "ABCDE"; // writing out the edges in the graph typedef std::pair<int, int> Edge; Edge edge_array[] = { Edge(A,B), Edge(A,D), Edge(C,A), Edge(D,C), Edge(C,E), Edge(B,D), Edge(D,E) }; const int num_edges = sizeof(edge_array)/sizeof(edge_array[0]); // declare a graph object Graph g(num_vertices); // add the edges to the graph object for (int i = 0; i < num_edges; ++i) { add_edge(edge_array[i].first, edge_array[i].second, g); } //// get the property map for vertex indices typedef property_map<Graph, vertex_index_t>::type IndexMap; IndexMap index = get(vertex_index, g); std::cout << "vertices(g) = "; typedef graph_traits<Graph>::vertex_iterator vertex_iter; std::pair<vertex_iter, vertex_iter> vp; for (vp = vertices(g); vp.first != vp.second; ++vp.first) std::cout << index[*vp.first] << " "; std::cout << std::endl; float finish; std::cin >> finish; return 0; } ---------------------------------------------------------------------- Thanks, João Orvalho

2 1