#include <utility>
#include <concepts/concepts.hpp>
#include <range/v3/algorithm/find.hpp>
#include <range/v3/detail/config.hpp>
#include <range/v3/functional/comparisons.hpp>
#include <range/v3/functional/identity.hpp>
#include <range/v3/iterator/concepts.hpp>
#include <range/v3/range/access.hpp>
#include <range/v3/range/concepts.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 T, typename P=identity)(AND sentinel_for< S |
| function template contains
|
|
I AND indirect_relation< equal_to, projected< I, P >, const T * > constexpr bool RANGES_FUNC() | ranges::contains (I first, S last, const T &val, P proj={}) |
|
| ranges::template (typename Rng, typename T, typename P=identity)(AND indirect_relation< equal_to |
| This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
|
const T *constexpr bool RANGES_FUNC() | ranges::contains (Rng &&rng, const T &val, P proj={}) |
|
|
| ranges::projected< iterator_t< Rng >, P > |
|