lowerBound overloads
Synopses
Declared in <bdlb_algorithmworkaroundutil.h>
Return an iterator to the first element not less than value.
template<
class FORWARD_IT,
class TYPE>
static
FORWARD_IT
lowerBound(
FORWARD_IT first,
FORWARD_IT last,
TYPE const& value);
Return an iterator to the first element not less than value, using comp.
template<
class FORWARD_IT,
class TYPE,
class COMPARE>
static
FORWARD_IT
lowerBound(
FORWARD_IT first,
FORWARD_IT last,
TYPE const& value,
COMPARE comp);
Return Value
iterator to the first element not less than value, or last if none
Parameters
Name |
Description |
first |
beginning of the sorted range to search |
last |
end of the sorted range to search |
value |
value to compare against elements in the range |
comp |
comparison functor inducing a strict weak ordering |
Created with MrDocs