#include <meta/meta.hpp>
#include <range/v3/range_fwd.hpp>
#include <range/v3/functional/identity.hpp>
#include <range/v3/functional/invoke.hpp>
#include <range/v3/iterator/concepts.hpp>
#include <range/v3/iterator/traits.hpp>
#include <range/v3/range/access.hpp>
#include <range/v3/range/concepts.hpp>
#include <range/v3/range/traits.hpp>
#include <range/v3/utility/static_const.hpp>
#include <range/v3/detail/prologue.hpp>
#include <range/v3/detail/epilogue.hpp>
Go to the source code of this file.
|
| ranges::template (typename I, typename S, typename C=equal_to, typename P=identity)(AND sentinel_for< S |
| function template adjacent_find
|
|
I AND indirect_unary_predicate< C, projected< I, P > > constexpr bool RANGES_FUNC() | ranges::is_partitioned (I first, S last, C pred, P proj=P{}) |
|
| ranges::template (typename Rng, typename C=equal_to, typename P=identity)(AND indirect_relation< C |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
|
projected< iterator_t< Rng >, P > constexpr bool RANGES_FUNC() | ranges::is_partitioned (Rng &&rng, C pred, P proj=P{}) |
|