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

[date_time] library binaries for VC7.1?
by Dan Muller 14 Aug '03

14 Aug '03

I've been using boost for a while, but now for the first time I'm using a component that isn't entirely header-based, namely date_time in boost 1.30.0. After building boost for VC7.1, I find a .lib file in boost_1_30_0\libs\date_time\build\bin\libboost_date_time.lib\msvc\debug \runtime-link-dynamic and a .dll in boost_1_30_0\libs\date_time\build \bin\boost_date_time.dll\msvc\debug\runtime-link-dynamic. There are a couple of things that I don't understand about these files. Is the .lib file supposed to be the import library for the .dll? Linking against the .lib file hasn't produced any import references in my applications. Perhaps I'm just not hitting any out-of-line functionality, but it sure seems like the .lib file is a static library rather than an import library. Also, running DUMPBIN /EXPORTS on the .dll file shows no exported symbols related to date_time classes, as far as I can see. It really looks like it's exporting a bunch of stuff related to the standard C++ library, which makes no sense to me. Can anyone clear up my confusion? -- Dan Muller "So that's what an invisible barrier looks like!" (Time Bandits)

1 0

[BGL] patch to graphviz.hpp (cvs version)
by Angus Leeming 14 Aug '03

14 Aug '03

The following trivial patch is needed to compile write_graphviz from today's CVS. Regards, Angus Index: graphviz.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/graph/graphviz.hpp,v retrieving revision 1.18 diff -u -p -r1.18 graphviz.hpp --- graphviz.hpp 12 Aug 2003 01:15:37 -0000 1.18 +++ graphviz.hpp 14 Aug 2003 11:15:49 -0000 @@ -249,7 +249,7 @@ namespace boost { GraphPropertiesWriter gpw) { typedef typename property_map<Graph, vertex_index_t>::const_type vimap_t; - vimap_t vertex_index = get(g, vertex_index_t()); + vimap_t vertex_index = get(vertex_index_t(), g); typedef typename graph_traits<Graph>::directed_category cat_type; typedef graphviz_io_traits<cat_type> Traits; std::string name = "G";

2 1

Using Boost as a Library Dependency
by Jason Winnebeck 14 Aug '03

14 Aug '03

I recently decided to refactor my library's API using the benefits given by boost::shared_ptr, so this now means my library uses boost. I'm trying to figure out how my installation process should go. Since I'm only using shared_ptr I've trimmed down a custom boost version that is only a few hundred k (rather than 10 megs) of just the files that I use. I've put the minimum boost files in my own directory structure so that my library can compile on its own. But when using the library, then what would the user do? Ideally I could have the installer for my library by copy the files to the compiler's include directory, but that's not particularly nice, espically since Boost is quite a popular library, and I don't want to litter up their include directory and most espically not overwrite any installation of Boost they have placed there. One thing that might work, if compilers support include directory "overrides" is if the user is using the full Boost library, to place its -I line before (or after?) the -I for my library, so that they can see my includes, but any boost includes will be "overridden" by their full version of Boost. But this leads to another question: If I compile my library with Boost x but the user has Boost y installed when he links with my library (I DO pass shared_ptr back and forth between user code, so it's not just used internally), what will happen? The shared_ptr interface seems to be oft changing, and so right now my code would only compile for Boost 1.30 (or later? Speaking of that, anyone know why there are no files listed for download for Boost 1.30.1 but it was announced a week ago?). I'm new to these things so I appreciate any feedback or answers you have. The library is just an open-source library I'm writing on my own free time, and I don't have a lot of experience from using/installing commercial C++ libraries to draw upon. Jason Winnebeck

5 13

visitors question
by Jérémie Leguay 14 Aug '03

14 Aug '03

Hi! I would like to use the breadth breadth_first_search with simultaneaously 2 different visitors: -the distance recorder one -one of mine I was thinking about a code like: class bfs_my_visitor:public default_bfs_visitor { ... public: bfs_stop_visitor(...) {} template < typename Vertex, typename Graph > void finish_vertex(Vertex u, const Graph & g) const { ... } }; use in: bfs_my_visitor vis(...); breadth_first_search (g,s, visitor(make_bfs_visitor(std::make_pair(record_distances(&d[0],on_tree_edge()), vis ))); But it doesn't work, can you tell the way to combine thoses visitors in the call of breadth_first_search. regards Jérémie leguay Lip6 - Paris ___________________________________________________________ Do You Yahoo!? -- Une adresse @yahoo.fr gratuite et en français ! Yahoo! Mail : http://fr.mail.yahoo.com

1 0

Filesystem lib
by ALMAZ_N 13 Aug '03

13 Aug '03

Can someone help me? Has anyone used the above boost Filesystem library on Mac OS X? If you have can you tell me the obstacles you faced and how you overcame them? I am currently including the lib in my windows project and don't seem to have any problems. Thank you Almaz

1 0

Getting std::iterator_category from boost iterator adaptor
by Raoul Gough 13 Aug '03

13 Aug '03

I have a situation where I want to specialize a class template on the basis of iterator_category, but I don't see how to get one of the standard categories when passed a boost iterator adapter. Currently, std::iterator_traits<MyIter>::iterator_category is giving me: boost::iterator_tag<boost::writable_lvalue_iterator_tag , boost::random_access_traversal_tag> I need random_access_iterator_tag for the right specialization to happen. Is there any way to get the *standard* iterator category from a boost iterator? MyIter is boost::indirect_iterator<std::vector<int *>::iterator> compiler is gcc 3.2.3 (mingw special 20030504-1) BTW, isn't this non-standard iterator_category bound to cause problems? e.g. if I use std::distance (MyIter(), MyIter()), how does the compiler know that it should use the std::random_access_iterator_tag specialization of std::distance? -- Raoul Gough "Let there be one measure for wine throughout our kingdom, and one measure for ale, and one measure for corn" - Magna Carta

2 2

[Spirit] file_iterator confusion
by Angus Leeming 13 Aug '03

13 Aug '03

Hello. I am just beginning to look at the spirit library, but am confused by the way file_iterator is working. Could anyone explain to me why this works: typedef spirit::file_iterator <char_t> iterator_t; iterator_t first(argv[1]); // check first is valid ... iterator_t last = first.make_end(); but this doesn't: typedef spirit::file_iterator <char_t> iterator_t; iterator_t first; iterator_t last; boost::tie(first, last) = open_file(argv[1]); // check first is valid ... Both codes compile, but only the first method results in the file being read. In the second instance, the correct number of chars are read, but only the first char is output (multiple times). The open_file function is simply: std::pair<iterator_t, iterator_t> open_file(char const * name) { iterator_t first(name); iterator_t last = first ? first.make_end() : iterator_t(); return std::make_pair(first, last); } Minimal sample code attached. My tests have been with boost 1.30.1. Changing the line #define FAILURE_MODE 1 toggles between the two cases. Best regards, Angus [Non-text portions of this message have been removed]

2 2

Using BGL Graphviz with MSVC7
by Trevon Fuller 12 Aug '03

12 Aug '03

Is there documentation anywhere that explains how to build and link graphviz for MSVC .NET for use with the BOOST graph library? I am trying to compile the example ospf-example.cpp from the BOOST graph library in MSVC .NET. I am using BOOST 1.30.0. I built the graphviz library using bjam with the vc7 toolset. I am getting a compile error: c:\boost_1_30_0\boost\tuple\detail\tuple_basic_no_partial_spec.hpp(83): error C2679: binary '=' : no operator found which takes a right-hand operand of type 'const boost::detail::adj_list_gen<Graph,VertexListS,OutEdgeListS,DirectedS,VertexP roperty,EdgeProperty,GraphProperty,EdgeListS>::config::edge_iterator' (or there is no acceptable conversion) with [ Graph=boost::adjacency_list<boost::vecS,boost::vecS,boost::directedS,boost:: no_property,boost::property<boost::edge_weight_t,int,boost::no_property>,boo st::no_property,boost::listS>, VertexListS=boost::vecS, OutEdgeListS=boost::vecS, DirectedS=boost::directedS, VertexProperty=boost::no_property, EdgeProperty=boost::property<boost::edge_weight_t,int,boost::no_property>, GraphProperty=boost::no_property, EdgeListS=boost::listS ] I think this error is due to the fact that MSVC does not support partial template specialization. Also, when I comment out all of the code except for the first 3 lines of the main, I get the error : dijkstra_link_state_routing error result returned from 'cl.exe' ("dijkstra_link_state_routing" is the name of the solution that contains the file ospf-example.cpp). Any suggestions anyone could offer would be appreciated. Below is the code for ospf-example.cpp. It is the same as the code on the BOOST website. Thanks, Trevon Fuller //====================================================================== // Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee, // // This file is part of the Boost Graph Library // // You should have received a copy of the License Agreement for the // Boost Graph Library along with the software; see the file LICENSE. // If not, contact Office of Research, Indiana University, // Bloomington, IN 47405. // // Permission to modify the code and to distribute the code is // granted, provided the text of this NOTICE is retained, a notice if // the code was modified is included with the above COPYRIGHT NOTICE // and with the COPYRIGHT NOTICE in the LICENSE file, and that the // LICENSE file is distributed with the modified code. // // LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. // By way of example, but not limitation, Licensor MAKES NO // REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY // PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS // OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS // OR OTHER RIGHTS. //====================================================================== #include <fstream> // for file I/O #include <boost/graph/graphviz.hpp> // for read/write_graphviz() #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/lexical_cast.hpp> int main() { using namespace boost; GraphvizDigraph g_dot; read_graphviz("figs/ospf-graph.dot", g_dot); typedef adjacency_list < vecS, vecS, directedS, no_property, property < edge_weight_t, int > > Graph; typedef graph_traits < Graph >::vertex_descriptor vertex_descriptor; Graph g(num_vertices(g_dot)); property_map < GraphvizDigraph, edge_attribute_t >::type edge_attr_map = get(edge_attribute, g_dot); graph_traits < GraphvizDigraph >::edge_iterator ei, ei_end; for (tie(ei, ei_end) = edges(g_dot); ei != ei_end; ++ei) { int weight = lexical_cast < int >(edge_attr_map[*ei]["label"]); property < edge_weight_t, int >edge_property(weight); add_edge(source(*ei, g_dot), target(*ei, g_dot), edge_property, g); } vertex_descriptor router_six; property_map < GraphvizDigraph, vertex_attribute_t >::type vertex_attr_map = get(vertex_attribute, g_dot); graph_traits < GraphvizDigraph >::vertex_iterator vi, vi_end; for (tie(vi, vi_end) = vertices(g_dot); vi != vi_end; ++vi) if ("RT6" == vertex_attr_map[*vi]["label"]) { router_six = *vi; break; } std::vector < vertex_descriptor > parent(num_vertices(g)); // All vertices start out as there own parent typedef graph_traits < Graph >::vertices_size_type size_type; for (size_type p = 0; p < num_vertices(g); ++p) parent[p] = p; #if defined(BOOST_MSVC) && BOOST_MSVC <= 1300 std::vector<int> distance(num_vertices(g)); property_map<Graph, edge_weight_t>::type weightmap = get(edge_weight, g); property_map<Graph, vertex_index_t>::type indexmap = get(vertex_index, g); dijkstra_shortest_paths (g, router_six, &parent[0], &distance[0], weightmap, indexmap, std::less<int>(), closed_plus<int>(), std::numeric_limits<int>::max(), 0, default_dijkstra_visitor()); #else dijkstra_shortest_paths(g, router_six, predecessor_map(&parent[0])); #endif graph_traits < GraphvizDigraph >::edge_descriptor e; for (size_type i = 0; i < num_vertices(g); ++i) if (parent[i] != i) { e = edge(parent[i], i, g_dot).first; edge_attr_map[e]["color"] = "black"; } #if defined(BOOST_MSVC) && BOOST_MSVC <= 1300 // VC++ can't handle write_graphviz :( { std::ofstream out("figs/ospf-sptree.dot"); out << "digraph loops {\n" << "size=\"3,3\"\n" << "ratio=\"fill\"\n" << "shape=\"box\"\n"; graph_traits<Graph>::vertex_iterator vi, vi_end; for (tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) { out << *vi << "["; for (std::map<std::string,std::string>::iterator ai vertex_attr_map[*vi].begin(); ai != vertex_attr_map[*vi].end(); ++ai) { out << ai->first << "=" << ai->second; if (next(ai) != vertex_attr_map[*vi].end()) out << ", "; } out<< "]"; } for (tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) { out << source(*ei, g) << " -> " << target(*ei, g) << "["; std::map<std::string,std::string>& attr_map = edge_attr_map[*ei]; for (std::map<std::string,std::string>::iterator eai attr_map.begin(); eai != attr_map.end(); ++eai) { out << eai->first << "=" << eai->second; if (next(eai) != attr_map.end()) out << ", "; } out<< "]"; } out << "}\n"; } #else graph_property < GraphvizDigraph, graph_edge_attribute_t >::type & graph_edge_attr_map = get_property(g_dot, graph_edge_attribute); graph_edge_attr_map["color"] = "grey"; write_graphviz("figs/ospf-sptree.dot" , g_dot); #endif std::ofstream rtable("routing-table.dat"); rtable << "Dest Next Hop Total Cost" << std::endl; for (tie(vi, vi_end) = vertices(g_dot); vi != vi_end; ++vi) if (parent[*vi] != *vi) { rtable << vertex_attr_map[*vi]["label"] << " "; vertex_descriptor v = *vi, child; int path_cost = 0; property_map < Graph, edge_weight_t >::type weight_map = get(edge_weight, g); do { path_cost += get(weight_map, edge(parent[v], v, g).first); child = v; v = parent[v]; } while (v != parent[v]); rtable << vertex_attr_map[child]["label"] << " "; rtable << path_cost << std::endl; } return EXIT_SUCCESS; }

1 0

tuples: operator ==
by Konstantin M. Litvinenko 12 Aug '03

12 Aug '03

Hello, All! I can't compile this simple test: --------------------------------------------- #include <boost/tuple/tuple.hpp> #include <iostream> using namespace boost::tuples; using namespace std; int main() { typedef tuple<int, tuple<int, int> > Tuple; Tuple t1(1, make_tuple(1, 1)); Tuple t2(2, make_tuple(2, 2)); if (get<1>(t1) == get<1>(t2)) { cout << "equal"; } else { cout << " not equal"; } return 0; } ----------------------------------------- What am I doing wrong? Compilers: Borland Builder 6 (bcc32.exe 5.6.4) and VC7 With best regards, Konstantin M. Litvinenko aka Dark Angel.

2 1

RE: [Boost-Users] boos::bind class member function
by Ioffe, Robert 12 Aug '03

12 Aug '03

Dirk, The following should not compile: for_each(v.begin(), v.end(), boost::bind(&myclass::print, _1)); since myclass::print actually takes two arguments and the first one is not the std::string, but the object of class myclass. So you should do something like this: myclass foo; for_each(v.begin(), v.end(), boost::bind(&myclass::print, foo, _1)); Have fun, Robert Ioffe -----Original Message----- From: dirk_griffioen [mailto:diddekio@yahoo.com] Sent: Tuesday, August 12, 2003 3:43 AM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] boos::bind class member function Hi, I would like to use a for_each with a class member function. The for_each in myclass::do_print below does not compile. And I simply cant figure it out. I'm using vc7.1. //////////////////////////////// void print2(std::string s) { cout << s << '\n'; } class myclass { public: void print(std::string s); void do_print(); }; void myclass::print(std::string s) { cout << s << '\n'; } void myclass::do_print() { vector<std::string> v; v.push_back("a"); v.push_back("b"); v.push_back("c"); v.push_back("d"); for_each(v.begin(), v.end(), boost::bind(boost::type<void>(), &myclass::print, _1)); } ///////////////////////////////////////// nor will for_each(v.begin(), v.end(), boost::bind(&myclass::print, _1)); for_each(v.begin(), v.end(), boost::bind(print, _1)); whereas for_each(v.begin(), v.end(), boost::bind(print2, _1)); is ok It seems natural to do, but I cant get it. Dirk Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

BUG: _DLL used to define BOOST_SIGNALS_STATIC_LINK
by kaineumann2001 12 Aug '03

12 Aug '03

Under cl(MS)/icl(Intel) compiler hash-def '_DLL' denotes dynamic linking of the C runtime library. Therefore, signals library should not use this to determine linkage (I may wish to statically link the signals library, while dynamically linking c-runtime.) see file boost/signals/detail/signals_common.hpp where the following snippet is invalid: #if defined(_MSC_VER) && defined(_DLL) # define BOOST_SIGNALS_HAS_DLL_RUNTIME #endif #if defined(BOOST_SIGNALS_HAS_DLL_RUNTIME) && !defined (BOOST_SIGNALS_STATIC_LINK) # if defined(BOOST_SIGNALS_IN_LIBRARY_SOURCE) # define BOOST_SIGNALS_DECL __declspec(dllexport) # define BOOST_SIGNALS_BUILD_DLL # else # define BOOST_SIGNALS_DECL __declspec(dllimport) # endif #endif here BOOST_SIGNALS_DECL is defined as __declspec(dllimport) as a consequence of linking the c-runtime dynamically under cl/icl compilers. But that's not what I wanted - I wanted to link signals.lib statically. This same bug is in the regex library. In fact, anyone able to fix this, should search for _DLL in the BOOST headers. Cheers, Kai

2 1

boos::bind class member function
by dirk_griffioen 12 Aug '03

12 Aug '03

Hi, I would like to use a for_each with a class member function. The for_each in myclass::do_print below does not compile. And I simply cant figure it out. I'm using vc7.1. //////////////////////////////// void print2(std::string s) { cout << s << '\n'; } class myclass { public: void print(std::string s); void do_print(); }; void myclass::print(std::string s) { cout << s << '\n'; } void myclass::do_print() { vector<std::string> v; v.push_back("a"); v.push_back("b"); v.push_back("c"); v.push_back("d"); for_each(v.begin(), v.end(), boost::bind(boost::type<void>(), &myclass::print, _1)); } ///////////////////////////////////////// nor will for_each(v.begin(), v.end(), boost::bind(&myclass::print, _1)); for_each(v.begin(), v.end(), boost::bind(print, _1)); whereas for_each(v.begin(), v.end(), boost::bind(print2, _1)); is ok It seems natural to do, but I cant get it. Dirk

1 0

how to convert c++ objects to Python?
by cavok＠filibusta.crema.unimi.it 12 Aug '03

12 Aug '03

hi, i have a c++ function that returns a reference to a c++ object. i want to expose this function to Python making it return the Python version of the object. i'm using Boost.Python. i understood that i have to use to_python_converter but the body of the A_to_Python::convert function is mystery for me. Boost documentation's example solves the problem in a manner i'm not able to apply to my case. my A object is complex and i'd like to somewhat (re)use the class_ object. ---------------- CUT HERE ---------------- #include <boost/python.hpp> using namespace boost::python; struct A { void f() {} }; A a; struct A_to_Python { static PyObject* convert(const A& a) { // documentation says: // return PyObject_New(noddy_NoddyObject, &noddy_NoddyType); } }; A& get_A() { return a; } BOOST_PYTHON_MODULE(hello) { class_<A>("A") .def("f", &A::f) ; to_python_converter<A, A_to_Python>(); def("get_A", get_A, return_value_policy<reference_existing_object>()); } ---------------- CUT HERE ---------------- please, somebody enlighten me. many thanks domenico -----[ Domenico Andreoli, aka cavok --[ http://filibusta.crema.unimi.it/~cavok/gpgkey.asc ---[ 3A0F 2F80 F79C 678A 8936 4FEE 0677 9033 A20E BC50

2 1

BGL write_graphviz and VertexList type
by Solomon Gibbs 12 Aug '03

12 Aug '03

Hello, I've been trying to use the write_graphviz function in BGL, and I've noticed that it appears to be sensitive to the type of VertexList used in the graph. adjacency_lists using a boost::vecS produce vertex indices in integer form like: graph G { 0[label="0"]; 1[label="1"]; 0--1 [label="2.8"]; } but the same code backed by boost::listS seems to not dereference completely: graph G { 0x80545f0[label="10"]; 0x8054608[label="11"]; 0x80545f0--0x8054608 [label="2.8"]; } dot doesn't like this. I notice that write_graphviz dereferences boost::graph_traits<Graph>::vertex_iterator to print the vertex. Are the listS and vecS *operators different somehow? The vector backed adjacency_list also seems to be automagically setting the vertex_index property to the actual index of the vertex in the storage vector instead of the value given in add_vertex(). My question is: Is this the expected behavior for these classes or some problem I've managed to create on my own? Thanks, Solomon

2 1

boost::python - how to expose c++ instancess?
by cavok＠filibusta.crema.unimi.it 11 Aug '03

11 Aug '03

hi, i'd like to do something like this: -------------- CUT HERE -------------- #include <boost/python.hpp> using namespace boost::python; struct A { void f() { /* do something */ } }; A a; BOOST_PYTHON_MODULE(hello) { class_<A>("A") .def("f", &A::f) ; def_readwrite("a", a); } -------------- CUT HERE -------------- i don't see how to do it with boost. any hint for a poor newbie? thanks dom -----[ Domenico Andreoli, aka cavok --[ http://filibusta.crema.unimi.it/~cavok/gpgkey.asc ---[ 3A0F 2F80 F79C 678A 8936 4FEE 0677 9033 A20E BC50

2 1

Boost smart pointers.
by Amit Bhatia 10 Aug '03

10 Aug '03

Hello All, I have been trying to understand the smart pointer library. One thing that I did not understand was in the documentationin quite beginning: "T may be an incomplete type at the point of smart pointer declaration. Unless otherwise specified, it is required that T be a complete type at points of smart pointer instantiation." So what exactly does this incomplete/complete type mean? Does this have anything to do with the class pointed to being abstract /concrete ? thanks, regards, amit.

2 1

FileSystem Link Error
by sarwanaggarwal 10 Aug '03

10 Aug '03

Hi: - managed to build "lib" using bjam tool. - copied that to a conveneient place - tried linking the "ls example" - I get a link error - file name not found. My environment is Borland Builder C++, 6.0. On MSVC++ 6.0, I get too many compile errors. Any hints? Greatly appreciated. Thanks. Sarwan

2 1

How to use wildcards in filesystem::path?
by yxh 10 Aug '03

10 Aug '03

Hello, Can I use "*.*" or "XXX?.???" in filesystem::path? I want to iterate through a directory to get file names such as "*.txt". Can anyone tell how to do this? Thanks in advance.

2 1

shared_ptr and private inheritance
by Jason Winnebeck 10 Aug '03

10 Aug '03

if class B : private A in a method of class B, given a shared_ptr<B>, is it possible to get a shared_ptr<A> that shares ownership without making boost::shared_ptr<A> a friend in class B? Jason Winnebeck

1 0

[BGL] Different types as vertices of a graph
by sashan 10 Aug '03

10 Aug '03

I'd like to use the graph library to support connections between different types of objects. To do this I've created a class GraphNode that forms the base class for various other objects that can become vertices of the graph. I've tried the following. int main(int,char*[]) { //these two classes Translate and Mesh inherit from GraphNode Translate* pT = new Translate; Mesh* pM = new Mesh; // create a typedef for the Graph type typedef adjacency_list<vecS, vecS, bidirectionalS> Graph; const int num_vertices = 2; // writing out the edges in the graph typedef std::pair<GraphNode*, GraphNode*> GraphEdge; GraphEdge edge_array[] = { GraphEdge(pT,pM) }; 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); return 0; } but get the following error message related to the fact that it can't choose a suitable overloaded add_edge function. If I replace the types in the vertex with an int it compiles happily. I'm using Boost 1.30.0 e:\Code\Edge\Console\Console.cpp(42) : error C2665: 'boost::add_edge' : none of the 2 overloads can convert parameter 1 from type 'GraphNode *' e:\Code\boost\boost\graph\detail\adjacency_list.hpp(1211): could be 'std::pair<_Ty1,_Ty2> boost::add_edge<boost::detail::adj_list_gen<Graph,VertexListS,OutEdgeListS,DirectedS,VertexProperty,EdgeProperty,GraphProperty,EdgeListS>::config>(boost::detail::adj_list_gen<Graph,VertexListS,OutEdgeListS,DirectedS,VertexProperty,EdgeProperty,GraphProperty,EdgeListS>::config::vertex_descriptor,boost::detail::adj_list_gen<Graph,VertexListS,OutEdgeListS,DirectedS,VertexProperty,EdgeProperty,GraphProperty,EdgeListS>::config::vertex_descriptor,boost::bidirectional_graph_helper_with_property<Config> &)' with [ _Ty1=boost::adj_list_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::config,boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::DirectedHelper>::edge_descriptor, _Ty2=bool, Graph=boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS>, VertexListS=boost::vecS, OutEdgeListS=boost::vecS, DirectedS=boost::bidirectionalS, VertexProperty=boost::no_property, EdgeProperty=boost::no_property, GraphProperty=boost::no_property, EdgeListS=boost::listS, Config=boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::config ] e:\Code\boost\boost\graph\detail\adjacency_list.hpp(1941): or 'std::pair<_Ty1,_Ty2> boost::add_edge<Graph,boost::detail::adj_list_gen<Graph,VertexListS,OutEdgeListS,DirectedS,VertexProperty,EdgeProperty,GraphProperty,EdgeListS>::config,boost ::detail::adj_list_gen<Graph,VertexListS,OutEdgeListS,DirectedS,VertexProperty,EdgeProperty,GraphProperty,EdgeListS>::DirectedHelper>(boost::detail::adj_list_gen<Graph,VertexListS,OutEdgeListS,DirectedS,VertexProperty,EdgeProperty,GraphProperty,EdgeListS>::config::vertex_descriptor,boost::detail::adj_list_gen<Graph,VertexListS,OutEdgeListS,DirectedS,VertexProperty,EdgeProperty,GraphProperty,EdgeListS>::config::vertex_descriptor,boost::vec_adj_list_impl<Graph,Config,Base> &)' with [ _Ty1=boost::adj_list_helper<boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::config,boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::DirectedHelper>::edge_descriptor, _Ty2=bool, Graph=boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS>, VertexListS=boost::vecS, OutEdgeListS=boost::vecS, DirectedS=boost::bidirectionalS, VertexProperty=boost::no_property, EdgeProperty=boost::no_property, GraphProperty=boost::no_property, EdgeListS=boost::listS, Config=boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::config, Base=boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS,boost::vecS,boost::bidirectionalS>,boost::vecS,boost::vecS,boost::bidirectionalS,boost::no_property,boost::no_property,boost::no_property,boost::listS>::DirectedHelper ] while trying to match the argument list '(GraphNode *, GraphNode *, Graph)' e:\Code\boost\boost\iterator_adaptors.hpp(1409) : see reference to class template instantiation 'boost::filter_iterator_generator<Predicate,Iterator,Value,Reference,Pointer,Category,Distance>' being compiled

2 1

[BGL] build problems
by Angus Leeming 09 Aug '03

09 Aug '03

Dear all, I'm a bjam newbie trying to build the BGL in boost 1.30.0 on a DEC Alpha running linux. However, the build process is failing to generate the graphviz parser and lexer: $ cd libs/graph/build $ bjam "-sTOOLS=gcc" ...found 437 targets... ...using 2 temp targets... ...updating 3 targets... ...using <libs!graph!build/liblibbgl-viz.a/gcc/debug/inlining-on/runtime-link-dynamic>graphviz_graph_lex.o... ...using <libs!graph!build/liblibbgl-viz.a/gcc/debug/inlining-on/runtime-link-dynamic>graphviz_digraph_lex.o... gcc-C++-action ../../../libs/graph/build/bin/liblibbgl-viz.a/gcc/debug/inlining-on/runtime-link-dynamic/graphviz_graph_parser.o graphviz_parser.y:44:2: #error Need to define the GRAPHVIZ_GRAPH macro to either GraphvizGraph or GraphvizDigraph. graphviz_parser.y:61: error: `GRAPHVIZ_GRAPH' was not declared in this scope graphviz_parser.y:61: error: template argument 1 is invalid graphviz_parser.y:61: error: syntax error before `;' token graphviz_parser.y:62: error: `GRAPHVIZ_GRAPH' was not declared in this scope graphviz_parser.y:62: error: template argument 1 is invalid graphviz_parser.y:62: error: syntax error before `;' token graphviz_parser.y:63: error: syntax error before `;' token [snip] This all seems very reasonable, but I do not know how to resolve the problem. I see that Jamfile.v2 has explicit rules to build graphviz_graph_lex.o, graphviz_digraph_lex.o, setting GRAPHVIZ_GRAPH appropriately. However, my version of bjam (3.1.4) does not understand Jamfile.v2 and I lack the knowledge to do the equivalent in Jamfile. I did try to append some rules to the Jamfile(see below), but unsurprisingly without success. Could anyone provide me with pointers on how to proceed? Kind regards, Angus Lex graphviz_graph_lex.cpp : graphviz_lex.l : <define>GRAPHVIZ_DIRECTED=0 <dependency>graphviz_graph_parser ; Yacc graphviz_graph_parser.cpp : graphviz_parser.y : <define>GRAPHVIZ_DIRECTED=0 ; Lex graphviz_digraph_lex.cpp : graphviz_lex.l : <define>GRAPHVIZ_DIRECTED=1 <dependency>graphviz_digraph_parser ; Yacc graphviz_digraph_parser.cpp : graphviz_parser.y : <define>GRAPHVIZ_DIRECTED=1 ; Object graphviz_graph_lex.o : graphviz_graph_lex.cpp ; Object graphviz_graph_parser.o : graphviz_graph_parser.cpp ; Object graphviz_digraph_lex.o : graphviz_digraph_lex.cpp ; Object graphviz_digraph_parser.o : graphviz_digraph_parser.cpp ;

4 7

what is wrong with boost::bind?
by yxh 08 Aug '03

08 Aug '03

Hi, I am using boost::bind from boost 1.30.0. When I type "boost::bind(", the VS.NET 20003 IDE stopped responding. What is wrong? #include <boost/bind.hpp> int main(void) { boost::bind( // IDE dies here }

5 5

use of REGEX_SEARCH to match lookahed subexpression.
by yanbelinky 08 Aug '03

08 Aug '03

Dear Regex Guru, I am trying to use REGEX_SEARCH algorithm to match lookahed subexpression. Search in the folowing strings (see below) using expression like: /exchange/test/(?!Drafts)/a.EML/b.png fails /exchange/test/Drafts/a.EML/b.gif /exchange/test/Inbox/a.EML/b.png /exchange/test/Inbox/a.EML/b.gif /exchange/test/Drafts/a.EML/b.png At the same moment I can suceesfully search using the expression: /exchange/test/Inbox/a.EML/b.(?!png). >From online documentation I realize that regex supports lookahed search. Please help me understand what I am doing wrong. P.S. It is tested with the program closely modeled from example provided for regex_search. Thank you for your help. Yan Belinky Senior Software Engineer. Whale Communications, LTD.

2 1

RE: [Boost-Users] shared_ptr memory leak (newb)
by Mark Storer 07 Aug '03

07 Aug '03

*string allocates it's own copy of the string, so your pmem pointer is leaked. STL's string templates manage their own memory, you never need to use new or delete to [de]allocate for them. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typdef std::disclaimer<Cardiff> Discard; > -----Original Message----- > From: Aaron Campbell [mailto:yg-boost-users@m.gmane.org] > Sent: Thursday, August 07, 2003 1:22 PM > To: boost-users(a)yahoogroups.com > Subject: [Boost-Users] shared_ptr memory leak (newb) > > > why does this leak memory from the first call to "new"? > how can I prevent the leak? > > wchar_t* pmem = new wchar_t[10]; > boost::shared_ptr<std::wstring> cp ( new std::wstring(pmem) ); > > thanks for the help, > .Aaron > > > > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Buy Ink Cartridges or Refill Kits for Your HP, Epson, Canon or Lexmark > Printer at Myinks.com. Free s/h on orders $50 or more to the > US & Canada. http://www.c1tracking.com/l.asp?cid=5511 > http://us.click.yahoo.com/l.m7sD/LIdGAA/qnsNAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

shared_ptr memory leak (newb)
by Aaron Campbell 07 Aug '03

07 Aug '03

why does this leak memory from the first call to "new"? how can I prevent the leak? wchar_t* pmem = new wchar_t[10]; boost::shared_ptr<std::wstring> cp ( new std::wstring(pmem) ); thanks for the help, .Aaron

1 0