Horizon
lower_bound.hpp
Go to the documentation of this file.
1 // Range v3 library
3 //
4 // Copyright Eric Niebler 2014-present
5 // Copyright Casey Carter 2016
6 //
7 // Use, modification and distribution is subject to the
8 // Boost Software License, Version 1.0. (See accompanying
9 // file LICENSE_1_0.txt or copy at
10 // http://www.boost.org/LICENSE_1_0.txt)
11 //
12 // Project home: https://github.com/ericniebler/range-v3
13 //
14 #ifndef RANGES_V3_ALGORITHM_LOWER_BOUND_HPP
15 #define RANGES_V3_ALGORITHM_LOWER_BOUND_HPP
16 
17 #include <range/v3/range_fwd.hpp>
18 
29 #include <range/v3/utility/static_const.hpp>
30 
31 #include <range/v3/detail/prologue.hpp>
32 
33 namespace ranges
34 {
37  RANGES_FUNC_BEGIN(lower_bound)
38 
39 
40  template(typename I,
41  typename S,
42  typename V,
43  typename C = less,
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,
48  S last,
49  V const & val,
50  C pred = C{},
51  P proj = P{})
52  {
53  return partition_point(std::move(first),
54  std::move(last),
55  detail::make_lower_bound_predicate(pred, val),
56  std::move(proj));
57  }
58 
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{})
65  {
66  return partition_point(
67  rng, detail::make_lower_bound_predicate(pred, val), std::move(proj));
68  }
69 
70  RANGES_FUNC_END(lower_bound)
71 
72  namespace cpp20
73  {
74  using ranges::lower_bound;
75  }
77 } // namespace ranges
78 
79 #include <range/v3/detail/epilogue.hpp>
80 
81 #endif
CPP_concept indirect_strict_weak_order
\concept indirect_strict_weak_order
Definition: concepts.hpp:689
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