14#ifndef RANGES_V3_ALGORITHM_LOWER_BOUND_HPP
15#define RANGES_V3_ALGORITHM_LOWER_BOUND_HPP
29#include <range/v3/utility/static_const.hpp>
31#include <range/v3/detail/prologue.hpp>
37 RANGES_FUNC_BEGIN(lower_bound)
44 typename P = identity)(
45 requires forward_iterator<I> AND sentinel_for<S, I> AND
46 indirect_strict_weak_order<C, V
const *, projected<I, P>>)
47 constexpr I RANGES_FUNC(lower_bound)(I
first,
53 return partition_point(std::move(first),
55 detail::make_lower_bound_predicate(pred, val),
60 template(
typename Rng,
typename V,
typename C =
less,
typename P = identity)(
61 requires forward_range<Rng> AND
62 indirect_strict_weak_order<C, V
const *, projected<iterator_t<Rng>, P>>)
63 constexpr borrowed_iterator_t<Rng>
64 RANGES_FUNC(lower_bound)(Rng && rng, V
const & val, C pred = C{}, P proj = P{})
66 return partition_point(
67 rng, detail::make_lower_bound_predicate(pred, val), std::move(proj));
70 RANGES_FUNC_END(lower_bound)
74 using ranges::lower_bound;
79#include <range/v3/detail/epilogue.hpp>
front< Pair > first
Retrieve the first element of the pair Pair.
Definition meta.hpp:2251
bool_<(T::type::value< U::type::value)> less
A Boolean integral constant wrapper around true if T::type::value is less than U::type::value; false,...
Definition meta.hpp:255