|
|
template <class ForIter, class T> ForIter lower_bound(ForIter start, ForIter end, const T &val); template <class ForIter, class T, class Comp> ForIter lower_bound(ForIter start, ForIter end, const T &val, Comp cmpfn);
The lower_bound( ) algorithm finds the first point in the sequence defined by start and end that is not less than val. It returns an iterator to this point.
The second form allows you to specify a comparison function that determines when one element is less than another.
|
|