21 #ifndef RANGES_V3_ALGORITHM_IS_PARTITIONED_HPP
22 #define RANGES_V3_ALGORITHM_IS_PARTITIONED_HPP
35 #include <range/v3/utility/static_const.hpp>
37 #include <range/v3/detail/prologue.hpp>
43 RANGES_FUNC_BEGIN(is_partitioned)
46 template(
typename I,
typename S,
typename C,
typename P = identity)(
47 requires input_iterator<I> AND sentinel_for<S, I> AND
49 constexpr
bool RANGES_FUNC(is_partitioned)(I
first, S last, C pred, P proj = P{})
61 template(
typename Rng,
typename C,
typename P = identity)(
62 requires input_range<Rng> AND
64 constexpr
bool RANGES_FUNC(is_partitioned)(Rng && rng, C pred, P proj = P{})
66 return (*
this)(begin(rng), end(rng), std::move(pred), std::move(proj));
69 RANGES_FUNC_END(is_partitioned)
73 using ranges::is_partitioned;
78 #include <range/v3/detail/epilogue.hpp>
CPP_concept indirect_unary_predicate
\concept indirect_unary_predicate
Definition: concepts.hpp:632
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