16#ifndef RANGES_V3_ALGORITHM_IS_SORTED_UNTIL_HPP
17#define RANGES_V3_ALGORITHM_IS_SORTED_UNTIL_HPP
29#include <range/v3/utility/static_const.hpp>
31#include <range/v3/detail/prologue.hpp>
37 RANGES_FUNC_BEGIN(is_sorted_until)
50 template(
typename I,
typename S,
typename R =
less,
typename P = identity)(
51 requires forward_iterator<I> AND sentinel_for<S, I> AND
52 indirect_strict_weak_order<R, projected<I, P>>)
53 constexpr I RANGES_FUNC(is_sorted_until)(I
first, S last, R pred = R{}, P proj = P{})
69 template(
typename Rng,
typename R =
less,
typename P = identity)(
70 requires forward_range<Rng> AND
71 indirect_strict_weak_order<R, projected<iterator_t<Rng>, P>>)
72 constexpr borrowed_iterator_t<Rng>
73 RANGES_FUNC(is_sorted_until)(Rng && rng, R pred = R{}, P proj = P{})
75 return (*
this)(begin(rng), end(rng), std::move(pred), std::move(proj));
78 RANGES_FUNC_END(is_sorted_until)
82 using ranges::is_sorted_until;
87#include <range/v3/detail/epilogue.hpp>
typename Fn::template invoke< Args... > invoke
Evaluate the invocable Fn with the arguments Args.
Definition meta.hpp:541
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