Hi All,

I have defined the following predicate

boost::function<bool(map_t::value_type, mxClassID)> predicate=bind(&map_t::value_type::second, _1) == _2;

which behaves as expedted.

// blah is true

bool blah = predicate(std::pair<const string, mxClassID>("foo",id), id);

How would I encorporate this into a find_if ?

i.e.

map_t::iterator pos2 = find_if(valid_arg_map().lower_bound(cmd),

                         valid_arg_map().upper_bound(cmd),

                               ???? predicate ????);

Thanks for any help

Sean     

-----Original Message-----
From: boost-users-bounces@lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Doug Gregor
Sent: Friday, April 27, 2007 11:19 AM
To: boost-users@lists.boost.org
Subject: Re: [Boost-users] BGL python: dijkstra_shortest_paths

On Apr 27, 2007, at 4:10 AM, John Reid wrote:

> ping - is absolutely no one interested in this problem?

Interesting, but swamped by everything that is not BGL. I'll take a 

look as soon as possible... sorry.

      - Doug

_______________________________________________

Boost-users mailing list

Boost-users@lists.boost.org

http://lists.boost.org/mailman/listinfo.cgi/boost-users