23 Algorithms library [algorithms]

23.7 Sorting and related operations [alg.sorting]

23.7.3 Binary search [alg.binary.search]

23.7.3.1 lower_­bound [lower.bound]

🔗
template<class ForwardIterator, class T> constexpr ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last, const T& value); template<class ForwardIterator, class T, class Compare> constexpr ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1
#
Requires: The elements e of [first, last) shall be partitioned with respect to the expression e < value or comp(e, value).
2
#
Returns: The furthermost iterator i in the range [first, last] such that for every iterator j in the range [first, i) the following corresponding conditions hold: *j < value or comp(*j, value) != false.
3
#
Complexity: At most comparisons.