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

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

Problems with if_then_else_return in boost::lambda library
by Ioffe, Robert 07 Aug '03

07 Aug '03

Hi, If I have a vector of strings vector<string> v; v.push_back("One"); v.push_back("Two"); v.push_back("Three"); v.push_back("Four"); v.push_back("Five"); and define arithmetic action plus like this: namespace boost { namespace lambda { struct plain_return_type_2<arithmetic_action<plus_action>, std::string, std::string> { typedef std::string type; }; } } then the following code works just fine: cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + string(", ") + _2) << endl; and the following also works wonderfully: int i = 1; cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + bind(constructor<string>(), var(i)++, ' ') + _2) << endl; Now, if I want to use if_then_else_return as shown below, it fails miserably, producing a huge error message: cout << accumulate(v.begin(), v.end(), string(), if_then_else_return(_1 == string(), _1, _1 + bind(constructor<string>(), var(i)++, ' ') + _2)) << endl; Now for the questions: What is the proper way to use if_then_else_return? Why do I need to define a separate arithmetic action for strings, even though they are a common library type? Is there a way to say the most intuitive: cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + ", " + _2) << endl; Is there way to do more intuitive: cout << accumulate(v.begin()+1, v.end(), v.front(), _1 + string(i++, ' ') + _2) << endl; Thank you for your help. Robert Ioffe [Non-text portions of this message have been removed]

1 0