- Boost-users - lists.boost.org

using graph_property_iter_range::const_iterator
by Jeffrey Holle 24 Sep '04

24 Sep '04

I'm using boost 1_31_0 and gcc 3.4.2. I'm adding an iterator interface to my class that abstracts use of internal boost graph properties and have had success with one exception that involves const_iterator. Here is how this class looks: struct VertexData { typedef boost::graph_property_iter_range <DataGraphT,vertex_Datum_t>::iterator iterator; typedef boost::graph_property_iter_range <DataGraphT,vertex_Datum_t>::const_iterator const_iterator; typedef Vertex_Datum value_type; VertexData(DataGraphT& dataGraph); iterator begin(void) {return boost::get_property_iter_range(dataGraph_,vertex_Datum).first;} // const_iterator begin(void) const {return boost::get_property_iter_range(dataGraph_,vertex_Datum).first;} iterator end(void) {return boost::get_property_iter_range(dataGraph_,vertex_Datum).second;} // const_iterator end(void) const {return boost::get_property_iter_range(dataGraph_,vertex_Datum).second;} When I uncomment the const begin method, I get the following compilation error: dataGraph.h:30: error: conversion from `boost::detail::lvalue_pmap_iter<boost::counting_iterator<size_t, boost::use_default, boost::use_default>, boost::subgraph_global_property_map<DataGraphT*, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int, VertexProperty>, EdgeProperty, boost::no_property, boost::listS>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int, VertexProperty>, EdgeProperty, boost::no_property, boost::listS>*, Vertex_Datum, Vertex_Datum&, vertex_Datum_t> > >' to non-scalar type `boost::detail::lvalue_pmap_iter<boost::counting_iterator<size_t, boost::use_default, boost::use_default>, boost::subgraph_global_property_map<const DataGraphT*, boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int, VertexProperty>, EdgeProperty, boost::no_property, boost::listS>, const boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int, VertexProperty>, EdgeProperty, boost::no_property, boost::listS>*, Vertex_Datum, const Vertex_Datum&, vertex_Datum_t> > >' requested Could somebody point out the problem here?

2 2

Using Boost Tuple Library instead of variadic macros
by Barak Simon 24 Sep '04

24 Sep '04

Hi, I am trying to use the Tuple library in order to provide a logging interface which can get a variable number of parameters and handle them in a type-safe manner. However, though constructing a tuple by make_tuple seems easy enough (from a logging's user point of view) implementation wise, I am not sure how to actually iterate on the make_tuple_mapper which is being provided to my logging method, as generically getting the length and using invoking "get" on it does not work due to compile-time reasons (and there are no iterators available). I am sure it must be possible to do it somehow, or else the ostream serialisation capabilities would not have been possible to implement, but I guess I am just not sophisticated enough to fully grasp the MP intricacies... My logging method currently looks like that: template<class TheTuple> inline void logTuple(TheTuple theTuple) { } which might not be the correct way about it, but I was not sure how to explicitly provide a tuple type that's created by make_tuple, let alone how to iterate on the values. Any help with this would be greatly appreciated. Thanks, Barak _________________ Barak Simon GED IT Core Platform Deutsche Bank 190 George St. Sydney, 2000 Phone +61 2 925 85070 Fax +61 2 925 95050 -- This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and destroy this e-mail. Any unauthorized copying, disclosure or distribution of the material in this e-mail is strictly forbidden.

2 1

Does BGL support hypergraph?
by Peng Yu 24 Sep '04

24 Sep '04

Hi, I notices that there is some discussion about hypergraph in the mailing list archives 2 years ago. Is hypergraph implementation in BGL now? Best wishes, Peng

2 1

RE: [Boost-users] Re: Bad interaction between boost::bindandBoost.Python?
by Nat Goodspeed 23 Sep '04

23 Sep '04

> -----Original Message----- > From: David Abrahams [mailto:dave@boost-consulting.com] > Sent: Thursday, September 23, 2004 8:24 AM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Re: Bad interaction between > boost::bindandBoost.Python? > > In principle your boost/python header has to be #included first [before boost/bind] > anyway, at least if you intend your code to run on POSIX. [Nat] ? I don't understand why that would be? Shouldn't each header #include everything to make it self-sufficient, rather than depending on the includer's prior #includes? > All I can > suggest is that you try the latest Boost CVS state, which doesn't have > this problem. A new release of Boost is imminent anyway. [Nat] That's fair, and thanks for testing it. But given the amount of time I've spent so far on this 1.31.0 upgrade, I'm going to lay low for a few days before announcing that I intend to upgrade to yet another version of Boost... ;-)

2 1

Re: A boost.graph edge problem
by Lars Kunert 23 Sep '04

23 Sep '04

Have a look at your compare operator! It orders two pairs of values (A,B)(C,D) like this: (A<B) || (!(A<B) && (C<D)) this expession equals: (A<B) || (C<D) lets consider the test case: (1,2) (2,1) Your operator will return return true in whatever order this pair is compared... I think an operator like (A<B) || ((A==B) && (C<D)) will help > ... > typedef multiset<DataEdge,ltSubgraph> Edges; > ... > struct ltSubgraph : public > std::binary_function<DataEdge,DataEdge,bool> > { > bool operator() (const DataEdge& s1, const DataEdge& s2) const > { > return s1.m_source < s2.m_source || > (!(s1.m_source < s2.m_source) && s1.m_target < s2.m_target); > } > };

1 0

A boost.graph edge problem
by Jeffrey Holle 23 Sep '04

23 Sep '04

I'm using boost 1.31.0 and gcc 3.4.2. While this problem is more of an application code problem, since I got no help on other lists, I trying this one with hopes of a response. I need to identify parallel edges from my graph, which is defined as: typedef subgraph<adjacency_list<vecS, vecS, bidirectionalS, property<vertex_index_t,int,VertexProperty>, EdgeProperty> > DataGraphT; typedef boost::graph_traits <DataGraphT>::edge_descriptor DataEdge; In the test case that I'm working on, I know I have parallel edges, actually 4 sets of 3. I'd like to use this code: DataGraph::handleParallelEdges(void) { typedef multiset<DataEdge,ltSubgraph> Edges; Edges edges; graph_traits<DataGraphT>::edge_iterator ei,ei_end; for (tie(ei,ei_end)=boost::edges(dataGraph_);ei!=ei_end;++ei) edges.insert(*ei); for (Edges::const_iterator iter = edges.begin(); iter != edges.end(); advance(iter,edges.count(*iter))) if (edges.count(*iter)>1) cout << "See duplicate" << endl; } However, when count never returns. The likely cause of this (I suspect) is the ltSubgraph functor. Its definition is: struct ltSubgraph : public std::binary_function<DataEdge,DataEdge,bool> { bool operator() (const DataEdge& s1, const DataEdge& s2) const { return s1.m_source < s2.m_source || (!(s1.m_source < s2.m_source) && s1.m_target < s2.m_target); } }; I say this because I can see that this functor is being continuously called in this infinite loop. Note that I use this functor in multiple other cases, but not with an associate container that allows duplicate keys. Is there a problem with this code?

1 1

boost graph meant to contain classes and functions?
by Stephen torri 22 Sep '04

22 Sep '04

I see that the boost graph library is used to contain data but can it be used to contain a class which a visitor moves along the graph per a preset algorithm calling interfacing functions as it moves along? Here is an example. class Color_Base { virtual ~Color_Base(){} virtual std::string get_Name () = 0; }; class Red : Color_Base { virtual ~Red (){} virtual std::string get_Name () { return std::string("Red"); } }; class Yellow : Color_Base { virtual ~Yellow (){} virtual std::string get_Name () { return std::string("Yellow"); } }; class Blue : Color_Base { virtual ~Blue (){} virtual std::string get_Name () { return std::string("Blue"); } }; So we could have a graph like | Blue -- Red | / | / | / Yellow I have a visitor called Color_Visitor which has the following pseudo code: for each vertice in graph visit vertice call get_Name() print result Stephen -- Email: storri(a)torri.org

3 4

No defines using bjam on Windows with msvc
by Phillip Seaver 22 Sep '04

22 Sep '04

As I said in an earlier post, I'm trying to start using jam for our projects. I'm using Boost.Jam ver 3.1.4. When I build on Windows with TOOLS=msvc and use "bjam -d2", the command-line doesn't have any define flags on it. Several of our source files rely on "WIN32", e.g. to determine the platform. Has anyone seen this before? I feel like I'm overlooking something obvious, but I haven't been able to figure it out. Here's the beginning of the output from "bjam -d2": ***** ...found 156 targets... ...updating 11 targets... vc-Cc ..\..\libs\ETSopt\bin\libetsopt.lib\msvc\debug\runtime-link-dynamic\etsopt .obj "cl" /Zm800 -nologo -c /Z7 /Od /Ob0 /GX /GR /MDd -I"..\..\libs\ETSopt" -I"C:\PROGRA~1\MICROS~2\VC98\include" -Fo"..\..\libs\ETSopt\bin\libetsopt.lib\ msvc\debug\runtime-link-dynamic\etsopt.obj" "etsopt.c" etsopt.c ***** Thanks in advance, Phillip

2 1

Re: [Boost-users] [Linker error] undefined reference to`boost::gregorian::greg_month::as_short_string() const'
by aqsis＠mail.tele2.co.uk 21 Sep '04

21 Sep '04

I understand what you mean now. In that case you would need to pass the filter name into the DSO function as a parameter. So your DSO declaration would look like... SHADEOP_TABLE(shadeopname) = { { "float shadeopname_fs(float, string)", "", "" }, . . }; And the argv[] argument passed to the method would contain the filter name as it's second value, i.e. SHADEOP(shadeopname_fs) { float *result = (float *)argv[0]; float x = *(float *)argv[1]; STRING_DESC *filt = (STRING_DESC *)argv[1]; if(strcmp(filt->s, "box")==0) { /* Filter with a box filter */ . . . Hope this helps. Paul G Original Message: ----------------- From: Jeff Garland jeff(a)crystalclearsoftware.com Date: Tue, 21 Sep 2004 05:15:39 -0700 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [Linker error] undefined reference to`boost::gregorian::greg_month::as_short_string() const' On Mon, 20 Sep 2004 20:33:51 -0700 (PDT), Zhoujie Mao wrote I'm going to presume the built library file libboost_date_time-gcc-1_31.a is in D:/boost/lib. Please double check that. > Below is part of my make file > CPP = g++.exe > CC = gcc.exe > WINDRES = windres.exe > RES = > OBJ = main.o $(RES) > LINKOBJ = main.o $(RES) > LIBS = -L"D:/Dev-Cpp499/lib" -L"D:/boost/lib" > -L"D:/boost/lib/libboost_date_time-gcc-1_31.a" ^^^^^^^^^^^^ this looks wrong ^^^^^^^^^^^ change it to the following: -lboost_date_time-gcc-1_31 so your LIBS line looks like: LIBS = -L"D:/Dev-Cpp499/lib" -L"D:/boost/lib" -lboost_date_time-gcc-1_31 > I did include the libboost_date_time-gcc-1_31 but it > did not work. Well, not actually because the -L controls the search path and you can't point it directly to the library.... HTH, Jeff _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users -------------------------------------------------------------------- mail2web - Check your email from the web at http://mail2web.com/ .

1 0

setting thread priority?
by Simmons, Aaron 21 Sep '04

21 Sep '04

In Boost.Threads, are there plans to allow adjustment of a thread's priority? Thanks, aaron

2 1