Subject: Re: [boost] [Graph] iterator range splitting
From: Sandeep Gupta (gupta.sandeep_at_[hidden])
Date: 2009-06-26 18:01:56
Was wondering if the splitting of out_edges range got fixed.
On Wed, Dec 17, 2008 at 7:52 PM, Andrew Sutton<andrew.n.sutton_at_[hidden]> wrote:
>> 1) does something like
>> template<class T>
>> inline bool
>> equal_pair(const std::pair<T, T>& p)
>> return p.first == p.second;
>> exist somewhere in std or boost? If not would it be useful to add? It
>> would help with eg if ( equal_pair(vertices(g)) ) ...
> If you're treating the pair as an iterator range, I believe Boost.Range has
> an overload named empty() that will do that for you. Otherwise, it would
> probably okay to stick it in graph_utility.hpp.
>> 2) what is the best way to test changes to the graph library?
> Build and run the test suite. You'll have to use bjam for that.
>> 3) I assume svn diff is sufficient. How do I submit the patch?
> Post the diff here. I'll pull it, apply it, and re-test it on my build
> Andrew Sutton
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk