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

boost::shared_ptr and stl algorithms
by Bill Eidson 15 Apr '05

15 Apr '05

std::vector< boost::shared_ptr<T> > TVec; I want to write a function object to run std::for_each. to do somework against members of T and accumulate results in functor. My attempts have failed in VC7 with memory errors in my operator() method. struct fo { bool operator()( boost::shared_ptr<T>& t ) { return true; } }; Thanks in advance bille

5 9

BGL and reversing / moving edges
by joshrose 17 Dec '03

17 Dec '03

G'day, I was hoping someone might be able to tell me if they've run into any situations using BGL where they needed to move (or reverse (i.e. flip the source and target)) an edge within a graph implemented as an adjacency_list. I'm working on an implementation of an algorithm for max. weight bipartite matching ("the assignment problem"), and one of the assumptions in the algorithm is that non-matched edges are directed from one subgraph, A, to the other subgraph, B, and matched edges are directed the other way. Over the course of growing the matching, a simple way to add and remove edges from the candidate set is just to reverse the edge, thus the need for some way to reverse the edge within BGL. I don't think I can just remove and then re-add the edge in the other direction, primarily because doing so will (I believe) invalidate any edge_descriptors referring to that edge. In particular, there are property maps keeping track of the weight of edges, the predecessors of certain nodes, etc. that use edge descriptors as keys. I've spent a fair bit of time reading the documentation and looking through the implementation of adjacency_lists (incl. edge_list_impl), and I'm not really sure of a way to either move an edge directly within a graph, or even to create a new edge from another s.t. they have the same edge_descriptor (in general a bad thing, probably). Anyone have any thoughts on this? Thanks, -Josh

4 10

bug report: boost::tokenizer with VC6
by Navi Singh 09 Feb '03

09 Feb '03

The boost release 1.28.0 of the tokenizer library has the following problem: There are 5 examples, namely, simple_example_1.cpp thru simple_example_5.cpp If I change the main() in each of the 5 to to main1() thru main5() and return 0; the vc60 compiler generates an internal compiler error when parsing the file boost\iterator_adapters.hpp on line 869, where it is parsing the following lines: reference operator*() const { return policies().dereference(*this); }

3 2

Q: Graphs. Sorting edges. Possible? How to?
by stas_fomin 07 Nov '02

07 Nov '02

Hello. I a newbie in BGL and I rewrite my LEDA code now... I have to sort (order) edges according to some functor. For example (simplified): typedef adjacency_list<vecS, vecS, bidirectionalS> MyGraph; typedef graph_traits < MyGraph >::edge_descriptor MyGraphEdge; typedef graph_traits < MyGraph >::edge_iterator MyEdgeIter; class MyCompareEdges{ public: bool operator()(MyGraphEdge e1, MyGraphEdge e2) const { return true; } }; .... { MyGraph Gr(10); MyEdgeIter ei_beg, ei_end; MyCompareEdges comp; tie(ei_beg, ei_end) = edges(Gr); std::sort(ei_beg, ei_end, comp); //Error C2676 } And I have error C2676 (below the message...). Questions: 1. Is it possible to sort edges in the graph? 2. How to... Thanks all in advance... Stas Fomin. P.S. vecS, setS, listS for edge container... - C2676. ------------------------------ d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp(264) : error C2676: binary '+=' : 'class std::list<struct boost::list_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost:: no_property> > >::iterator' does not define this operator or a conversion to a type acceptable to the predefined operator d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp (911) : see reference to function template instantiation 'void __thiscall boost::default_iterator_policies::advance(struct boost::iterator_adaptor<class std::list<struct boost::lis t_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost::no_property> > >::iterator,struct boost::detail::undirected_edge_iter_policies,class boost::detail::edge_desc_impl<struct boost::b idirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int> *,struct boost::multi_pass_input_iterator_tag,int> &,i nt)' being compiled Error executing cl.exe.

4 7

[random] Known problems compiling random lib with Dinkumware STL?
by Chris Russell 16 Oct '02

16 Oct '02

I'm using the Intel 6.0 compiler under MS Visual Studio 6.0 SP6 and just attempted to plug the Dinkumware STL distribution into the mix. I ran into a slew of compile-time errors in the random library and am wondering if anyone has seen this before I ride into battle. Thanks - Chris

3 4

Possible bug in boost_1_28
by Christopher Henrich 11 Oct '02

11 Oct '02

This bug comes up when I try to include <boost/array.hpp> in certain CodeWarrior projects. (CodeWarrior 8.0, running under Mac OS 10.1.5 on G3 "beige tower") If I initialize the project with stationery "C++ Console Mach-O", and I change HelloWorld.cp to include <boost/array.hpp>, then I get this error message: Error: undefined identifier 'ptrdiff_t' suffix.hpp line 204 included from config.hpp: 57 array.hpp:27 HelloWorld.cp: 10 If I initialize with PowerPlant stationery, I do not have this problem. Chris Henrich

6 6

Use a shared_ptr as a 'backpointer'?
by dick.bridges＠tais.com 04 Oct '02

04 Oct '02

I run into situations where it's useful for an object to have a 'backpointer' to the object instance that created it (example below). Is there a pattern/idiom for doing this using shared_ptr? Or maybe I need to re-think the idea of the backpointer in the first place? class Bar; class Foo { public: Foo(Bar* b) : p(b){} private: Foo() : p(0){} shared_ptr<Bar> p; } class Bar { void doit() { new Foo(???); // <<< new Foo(this) obviously won't work. } }

3 2

Loki vs. Boost
by Hamlet 02 Oct '02

02 Oct '02

Hi, I'm (desperately) looking for a serious comparative review of Loki vs. Boost libraries. Although the differences are quite clear, still it would be nice to see a serious comparison, especially in the features that exists in both places, i.e. smart pointers, small obj. allocator, type traits and template meta-programming. Does anybody knows if there exists such a paper somewhere, or alternatively have his own insights about the libraries? Thanks, Ariel

2 1

BOOST_PARAM_TEST_CASE and uncaught exceptions
by Alisdair Meredith 02 Oct '02

02 Oct '02

I have a case where my test case passed to BOOST_PARAM_TEST_CASE is throwing an exception I was not expecting. This seems to still result in the correct number of calls to the test case, but the first parameter in the list is passed every time. Is this a feature of my compiler, or an issue with the library? Using Borland C++ Builder 5 (should be same as free command-line compiler) -- AlisdairM

2 1

RE: [Boost-Users] Re: Use a shared_ptr as a 'backpointer'?
by dick.bridges＠tais.com 30 Sep '02

30 Sep '02

1) There are circumstances where the 'creator' should stick around as long as one or more 'creations' still exist (e.g., a [network] session that's created various asynchronous conversations). 2) I haven't had time to check, but I think this is the as-yet-not-but-soon-to-be-released implementation of intrusive pointers. Interesting: search google for "intrusive pointer" (quotes not required). I got five hits - all of the URLs start with www.boost.org/. BTW: Really slick. Trying to figure out where to keep "THE POINTER" was driving me nuts. I'd completely forgotten about intrusive pointers. Thanks. A *LOT*. Mark Storer <mstorer@cardiff To: "'Boost-Users(a)yahoogroups.com'" <Boost-Users(a)yahoogroups.com> .com> cc: Subject: RE: [Boost-Users] Re: Use a shared_ptr as a 'backpointer'? 09/30/2002 09:36 AM Please respond to Boost-Users I've got a comment and a question... 1) Couldn't the "backpointer" just be a constant reference? Backpointers, in my mind, don't have anything to do with ownership, so a shared_ptr woulnd't be appropriate. 2) shared_from_this? I can't find that one in any of the headers or docs I downloaded with 1.28. I did find shared_count in (oddly enough) shared_count.hpp, which looks like it would prevent two seperate shared_ptr's from causing a double-delete... pretty slick, but I couldn't find any docs on it. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: David Abrahams [mailto:yg-boost-users@m.gmane.org] Sent: Sunday, September 29, 2002 4:12 PM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] Re: Use a shared_ptr as a 'backpointer'? <dick.bridges(a)tais.com> wrote in message news:OF699D7956.EED22A4F-ON88256C43.00722AD0@tais.net... > I run into situations where it's useful for an object to have a > 'backpointer' to the object instance that created it (example below). Is > there a pattern/idiom for doing this using shared_ptr? Or maybe I need to > re-think the idea of the backpointer in the first place? > class Bar; class Foo { public: Foo(shared_ptr<Bar>); private: shared_ptr<Bar> p; }; class Bar : boost::shared_count { void doit() { new Foo(boost::shared_from_this(this)); // <<< new Foo(this) obviously won't work. } }; HTH, Dave -- ----------------------------------------------------------- David Abrahams * Boost Consulting dave(a)boost-consulting.com * http://www.boost-consulting.com 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/ 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