xref: /llvm-project/libcxx/include/__cxx03/__algorithm/adjacent_find.h (revision ce7771902dc50d900de639d499a60486b83f70e0)
1e78f53d1SNikolas Klauser // -*- C++ -*-
2e78f53d1SNikolas Klauser //===----------------------------------------------------------------------===//
3e78f53d1SNikolas Klauser //
4e78f53d1SNikolas Klauser // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
5e78f53d1SNikolas Klauser // See https://llvm.org/LICENSE.txt for license information.
6e78f53d1SNikolas Klauser // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7e78f53d1SNikolas Klauser //
8e78f53d1SNikolas Klauser //===----------------------------------------------------------------------===//
9e78f53d1SNikolas Klauser 
10*ce777190SNikolas Klauser #ifndef _LIBCPP___CXX03___ALGORITHM_ADJACENT_FIND_H
11*ce777190SNikolas Klauser #define _LIBCPP___CXX03___ALGORITHM_ADJACENT_FIND_H
12e78f53d1SNikolas Klauser 
1373fbae83SNikolas Klauser #include <__cxx03/__algorithm/comp.h>
1473fbae83SNikolas Klauser #include <__cxx03/__algorithm/iterator_operations.h>
1573fbae83SNikolas Klauser #include <__cxx03/__config>
1673fbae83SNikolas Klauser #include <__cxx03/__iterator/iterator_traits.h>
1773fbae83SNikolas Klauser #include <__cxx03/__utility/move.h>
18e78f53d1SNikolas Klauser 
19e78f53d1SNikolas Klauser #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
20e78f53d1SNikolas Klauser #  pragma GCC system_header
21e78f53d1SNikolas Klauser #endif
22e78f53d1SNikolas Klauser 
23e78f53d1SNikolas Klauser _LIBCPP_PUSH_MACROS
2473fbae83SNikolas Klauser #include <__cxx03/__undef_macros>
25e78f53d1SNikolas Klauser 
26e78f53d1SNikolas Klauser _LIBCPP_BEGIN_NAMESPACE_STD
27e78f53d1SNikolas Klauser 
28e78f53d1SNikolas Klauser template <class _Iter, class _Sent, class _BinaryPredicate>
29e78f53d1SNikolas Klauser _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _Iter
30e78f53d1SNikolas Klauser __adjacent_find(_Iter __first, _Sent __last, _BinaryPredicate&& __pred) {
31e78f53d1SNikolas Klauser   if (__first == __last)
32e78f53d1SNikolas Klauser     return __first;
33e78f53d1SNikolas Klauser   _Iter __i = __first;
34e78f53d1SNikolas Klauser   while (++__i != __last) {
35e78f53d1SNikolas Klauser     if (__pred(*__first, *__i))
36e78f53d1SNikolas Klauser       return __first;
37e78f53d1SNikolas Klauser     __first = __i;
38e78f53d1SNikolas Klauser   }
39e78f53d1SNikolas Klauser   return __i;
40e78f53d1SNikolas Klauser }
41e78f53d1SNikolas Klauser 
42e78f53d1SNikolas Klauser template <class _ForwardIterator, class _BinaryPredicate>
43e78f53d1SNikolas Klauser _LIBCPP_NODISCARD inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
44e78f53d1SNikolas Klauser adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) {
45e78f53d1SNikolas Klauser   return std::__adjacent_find(std::move(__first), std::move(__last), __pred);
46e78f53d1SNikolas Klauser }
47e78f53d1SNikolas Klauser 
48e78f53d1SNikolas Klauser template <class _ForwardIterator>
49e78f53d1SNikolas Klauser _LIBCPP_NODISCARD inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
50e78f53d1SNikolas Klauser adjacent_find(_ForwardIterator __first, _ForwardIterator __last) {
51e78f53d1SNikolas Klauser   return std::adjacent_find(std::move(__first), std::move(__last), __equal_to());
52e78f53d1SNikolas Klauser }
53e78f53d1SNikolas Klauser 
54e78f53d1SNikolas Klauser _LIBCPP_END_NAMESPACE_STD
55e78f53d1SNikolas Klauser 
56e78f53d1SNikolas Klauser _LIBCPP_POP_MACROS
57e78f53d1SNikolas Klauser 
58*ce777190SNikolas Klauser #endif // _LIBCPP___CXX03___ALGORITHM_ADJACENT_FIND_H
59