Horizon
contains.hpp
Go to the documentation of this file.
1 // Range v3 library
3 //
4 // Copyright Johel Guerrero 2019
5 //
6 // Use, modification and distribution is subject to the
7 // Boost Software License, Version 1.0. (See accompanying
8 // file LICENSE_1_0.txt or copy at
9 // http://www.boost.org/LICENSE_1_0.txt)
10 //
11 // Project home: https://github.com/ericniebler/range-v3
12 //
13 #ifndef RANGES_V3_ALGORITHM_CONTAINS_HPP
14 #define RANGES_V3_ALGORITHM_CONTAINS_HPP
15 
16 #include <utility>
17 
18 #include <concepts/concepts.hpp>
19 
21 #include <range/v3/detail/config.hpp>
27 
28 #include <range/v3/detail/prologue.hpp>
29 
30 namespace ranges
31 {
34  RANGES_FUNC_BEGIN(contains)
35 
36 
37  template(typename I, typename S, typename T, typename P = identity)(
38  requires input_iterator<I> AND sentinel_for<S, I> AND
39  indirect_relation<equal_to, projected<I, P>, const T *>)
40  constexpr bool RANGES_FUNC(contains)(I first, S last, const T & val, P proj = {})
41  {
42  return find(std::move(first), last, val, std::move(proj)) != last;
43  }
44 
46  template(typename Rng, typename T, typename P = identity)(
47  requires input_range<Rng> AND
48  indirect_relation<equal_to, projected<iterator_t<Rng>, P>, const T *>)
49  constexpr bool RANGES_FUNC(contains)(Rng && rng, const T & val, P proj = {})
50  {
51  return (*this)(begin(rng), end(rng), val, std::move(proj));
52  }
53 
54  RANGES_FUNC_END(contains)
56 } // namespace ranges
57 
58 #include <range/v3/detail/epilogue.hpp>
59 
60 #endif // RANGES_V3_ALGORITHM_CONTAINS_HPP
template(typename Rng, typename T, typename P=identity)(requires input_range< Rng > AND indirect_relation< equal_to
This is an overloaded member function, provided for convenience. It differs from the above function o...
CPP_concept sentinel_for
\concept sentinel_for
Definition: concepts.hpp:306
CPP_concept input_iterator
\concept input_iterator
Definition: concepts.hpp:362
CPP_concept indirect_relation
\concept indirect_relation
Definition: concepts.hpp:670
decltype(begin(declval(Rng &))) iterator_t
Definition: access.hpp:698
front< Pair > first
Retrieve the first element of the pair Pair.
Definition: meta.hpp:2251
drop< L, min< find_index< L, T >, size< L > >> find
Return the tail of the list L starting at the first occurrence of T, if any such element exists; the ...
Definition: meta.hpp:2388
Definition: comparisons.hpp:28
Definition: identity.hpp:25