On Sun, Feb 22, 2009 at 6:26 PM, Geoff McLane <ubu...@geoffair.info> wrote: > > template<class ForwardIterator, class Type, class BinaryPredicate> > ForwardIterator lower_bound( > ForwardIterator _First, > ForwardIterator _Last, > const Type& _Val, > BinaryPredicate _Comp ); > </quote> > And similarly for upper_bound ...
Yes. So the range _First to _Last is traversed, comparing items to _Val. That is, the _Comp will be called with an iterator (pointer) and a const Type&. So you don't need a two pointer version. Not that I have any objection to your patch, I just reacted to your question that you have no idea how gcc can compile this. -- Csaba/Jester ------------------------------------------------------------------------------ Open Source Business Conference (OSBC), March 24-25, 2009, San Francisco, CA -OSBC tackles the biggest issue in open source: Open Sourcing the Enterprise -Strategies to boost innovation and cut costs with open source participation -Receive a $600 discount off the registration fee with the source code: SFAD http://p.sf.net/sfu/XcvMzF8H _______________________________________________ Flightgear-devel mailing list Flightgear-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/flightgear-devel
