April 2006 - Boost-users - lists.boost.org

[date-time] fatal error LNK1104
by chanekane 11 Apr '06

11 Apr '06

Hi, I am using boost version 1.33.1 and Microsoft Visual C++ 2005 Express Edition. I have made my own solution in VS to generate my library boost using only the classes I use in my project. Here all is fine. But when I compile my project. I have a Link error : fatal error LNK1104: cannot open file 'libboost_date_time-vc80-mt-1_33_1.lib' I have defined this in user.hpp in my own solution but Nothing changes : #define BOOST_ALL_DYN_LINK Thanks for your help.

1 0

Changing name of function being called in a template
by James Hughes 11 Apr '06

11 Apr '06

Hello all, I have a feeling this may be off the topic of Boost, so if anyone can point me in the direction of a better place to ask please do (a templates mailing list?). However, I post it here because I think Boost::Bind does something similar internally to what I want to do, so someone may be able to advise. I have a couple of templated class which implement a simple observer pattern (yes I know Boost has signals, but it's not thread safe). It uses a virtual function to make a call in to the observer from the subject. My own observer then derive from this class and implement the notify function. However, I would like to 'template' the name of the function, so that different instances of the template can make calls to different named function. Now in Boost:bind you specify the name of the function in the class to be called, but I don't know how to implement that in my own template class. class observer<typename T> { virtual void Notify(T&); // This is the function I want to rename according to the template } so I might want, in a different instance, the Notify function to be called, Shutdown(). Following code is NOT valid C++, but gives an idea of what I am trying to implement, but don't know enough yet to do so!! class observer<typename T, typename functionname> { virtual void <functionname>(T&) } Is there a way I can use templates to do this? Boost:bind can call a particular member function passed in as part of the template defn, how do I that? I hope that is vaguely clear... James

1 0

multitoken program_options
by Javier Gonzalez 10 Apr '06

10 Apr '06

Hi, I'm using the program_options library and wanted to have two multitoken options, but it seems the only multitoken option allowed has to be last one in the line. I want something like: ./my_program --files-a a* --files-b b* but when I declared the files-a option to be multitoken, then it treats '--files-b' like a value of the files-a option. Isn't there a way to do that? thanks Javier

1 0

[BGL]: adjacency_list_io bug?
by Sebastian Weber 10 Apr '06

10 Apr '06

Hello everybody! I'm using adjacency_list_io to import my graphs from the disk: typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS > graph_t; graph_t wwwg; //string dataFile("www.bdat"); string dataFile("www_undirected.bdat"); cout << "importing www network from file \"" << dataFile << "\" ... "; ifstream wwwDatIn(dataFile.c_str()); wwwDatIn >> read( wwwg ); wwwDatIn.close(); This works nicely with g++ 3.3, but g++ 4.0 refuse to compile this code and chokes with an error message like /home/sebi/projects/diplom/src/boost_1_33_1/boost/graph/adjacency_list_io.hpp: In member function 'boost::GraphParser<Graph_t, VertexProperty, EdgeProperty, VertexPropertySubset, EdgePropertySubset>& boost::GraphParser<Graph_t, VertexProperty, EdgeProperty, VertexPropertySubset, EdgePropertySubset>::operator()(std::istream&) [with Graph_t = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, boost::listS>, VertexProperty = boost::no_property, EdgeProperty = boost::no_property, VertexPropertySubset = boost::no_property, EdgePropertySubset = boost::no_property]': /home/sebi/projects/diplom/src/boost_1_33_1/boost/graph/adjacency_list_io.hpp:327: instantiated from 'std::istream& boost::operator>>(std::istream&, boost::GraphParser<Graph, VP, EP, VPS, EPS>) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::no_property, boost::no_property, boost::listS>, VP = boost::no_property, EP = boost::no_property, VPS = boost::no_property, EPS = boost::no_property]' I have no clue where this comes from, but it seems to be some incompatibility between g++ 4.0 and adjacency_list_io. Would be nice if someone could enlighten me or fix it. Thanks! Sebastian My system: Ubuntu 5.10, Boost 1.33.1, anything else needed?

4 8

Regex Submatch Position Question
by admin＠geocodenet.com 10 Apr '06

10 Apr '06

Hi all, Quick question about the Boost::Regex library. Is there a way to identify, with sub-matches, where a match in the search string is made and the length of the match? For instance, with the following regular expression and search string: Regex ==> "(\d+)" Search String ==> "Give me 100 dollars or give me 2001 dollars." Is there a way to determine that the subexpression matched at positions 8 and 31 in the search string, and that the lengths of the matches were three and four characters? Thanks

4 5

[boost][bgl] kevin-bacon.cpp example
by Harsh Deshmane 10 Apr '06

10 Apr '06

Hello Doug, I am trying to create a custom visitor class, for bfs, which accumulates all predecessors (based on Doug Gregor's suggestion for finding all paths between 2 vertices) I compiled and ran this example from the examples dir. However, the output is not consistent with kevin_bacon.expected in the example dir. Output I get is listed below (top lines) $ a.out William Shatner has a Bacon number of 0 has a Bacon number of 1 Denise Richards has a Bacon number of 0 has a Bacon number of 0 Patrick Stewart has a Bacon number of 0 has a Bacon number of 0 Steve Martin has a Bacon number of 0 Gerard Depardieu has a Bacon number of 0 has a Bacon number of 0 Clint Howard has a Bacon number of 0 Sean Astin has a Bacon number of 0 ..... (basically, all values are zero) except the first. http://www.boost.org/libs/graph/example/kevin-bacon.cpp I am using boost version 1.33.0/x86_64/include/boost-1_33 gcc version 3.2.3 20030502 (Red Hat Linux 3.2.3-52) If possible, can someone please check whether the output you get is the correct one ? regards, -harsh

2 1

[iterator] joint_iterator?
by Shunsuke Sogame 10 Apr '06

10 Apr '06

Hi gurus, I compared Boost.MPL Views... http://www.boost.org/libs/mpl/doc/refmanual/views.html with Boost.Iterator adaptors... http://www.boost.org/libs/iterator/doc/index.html#specialized-adaptors I think joint_iterator seems missing from Boost.Iterator. Is such iterator impossible or prohibited by STL? -- Shunsuke Sogame

2 2

[BGL] bug in PLOD algorithm
by Johan Oudinet 10 Apr '06

10 Apr '06

Hi, I'm using Parrallel Boost Graph Library to generate some graphs and compute their pagerank. I found the PLOD algorithm and I'd like using it with bidirected graphs. But, the PLOD algorithm generates self_edges whereas I put allow_self_edges to false. I look at the code in plod_generator.hpp and found that the next(directed_tag) function never uses allow_self_edges boolean ! I think it's a bug... I suggest replace: current.second = x(*gen); with: do { current.second = x(*gen); } while (current.first == current.second && !allow_self_loops); Regards, -- Johan

2 1

[Graph] How to free memory allocated when constructing a graph?
by Olivier Delalleau 10 Apr '06

10 Apr '06

I am constructing a graph exactly the same way as in the spanning tree example here: http://www.boost.org/libs/graph/example/prim-example.cpp i.e. using a constructor of the kind Graph g(edges, edges + sizeof(edges) / sizeof(E), weights, num_nodes); where Graph is some kind of adjacency_list. In my application, edges is rather big (on the order of 1e7 elements). Problem: when this constructor is called, it allocates a huge amount of memory (I see this when I do a 'top' to monitor the memory usage while in gdb). And this memory is not freed when the graph is deleted (when it gets out of the scope, or, if I use a pointer instead, when I delete it explicitely). Is there a way to recover this memory? Any hint on how to make it use less memory? Thank you, Olivier

2 1

Re: [Boost-users] FW: adjacency_list remove_edge
by Sean Kelly 10 Apr '06

10 Apr '06

Hi Doug, here is the example code that works - XFlatGraph is a listS, listS adjacency_list. Note if I replace the remove edge expression with remove_edge(*iter, _graph) the edge is intermittently not removed thanks Sean XFlatGraph& graph = _flat_view->get_graph(); XFlatEdgePMap& edge_pmap = get(kFlatGraphEdgeProperty, graph); std::list<XFlatView::edge_descriptor> scheduled_for_removal; XFlatView::edge_iterator current, end; tie(current, end) = edges(graph); for(;current!=end;++current) { if(edge_pmap[*current]->get_impl()->isSimulationOnly()) { scheduled_for_removal.push_back(*current); } } // Remove edges marked as simualtion only scheduled_for_removal.unique(); for(std::list<XFlatView::edge_descriptor>::iterator iter = scheduled_for_removal.begin(); iter != scheduled_for_removal.end(); ++iter) { remove_edge(source(*iter, graph), target(*iter,graph), graph); } System Information: compiler info: Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 13.10.3077 for 80x86 Copyright (C) Microsoft Corporation 1984-2002. All rights reserved. Boost version 1-32 -----Original Message----- From: boost-users-bounces(a)lists.boost.org [ mailto:boost-users-bounces@lists.boost.org] On Behalf Of Doug Gregor Sent: Thursday, March 02, 2006 12:42 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] FW: adjacency_list remove_edge On Mar 1, 2006, at 6:33 PM, Sean Kelly wrote: > I have observed the following behavior using the remove_edge function > and am curious if anyone else has seen this. > > remove_edge(edge_descriptor, graph) // occasionally fails in a > seemingly indeterminant way > > remove_edge(source(edge_descriptor, graph), > target(edge_descriptor, graph), > graph) // works fine It sounds like either the edge_descriptor is getting invalidated or there is a bug somewhere in remove_edge. > The adjacency list I am using is listS listS, and this is not an issue > with invalid edge_iterators, i.e. I collect all the edge_descriptors > to be removed before removing them. Are you sure that there are no duplicate edge descriptors? > I can provide more detailed info upon request. We won't be able to help without more detailed information. Doug _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1