File indexing completed on 2026-05-03 08:13:09
0001
0002
0003
0004
0005
0006
0007
0008
0009 #ifndef _LIBCPP___ALGORITHM_RANGES_ADJACENT_FIND_H
0010 #define _LIBCPP___ALGORITHM_RANGES_ADJACENT_FIND_H
0011
0012 #include <__algorithm/adjacent_find.h>
0013 #include <__config>
0014 #include <__functional/identity.h>
0015 #include <__functional/ranges_operations.h>
0016 #include <__iterator/concepts.h>
0017 #include <__iterator/projected.h>
0018 #include <__ranges/access.h>
0019 #include <__ranges/concepts.h>
0020 #include <__ranges/dangling.h>
0021 #include <__utility/move.h>
0022
0023 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
0024 # pragma GCC system_header
0025 #endif
0026
0027 _LIBCPP_PUSH_MACROS
0028 #include <__undef_macros>
0029
0030 #if _LIBCPP_STD_VER >= 20
0031
0032 _LIBCPP_BEGIN_NAMESPACE_STD
0033
0034 namespace ranges {
0035 struct __adjacent_find {
0036 template <forward_iterator _Iter,
0037 sentinel_for<_Iter> _Sent,
0038 class _Proj = identity,
0039 indirect_binary_predicate<projected<_Iter, _Proj>, projected<_Iter, _Proj>> _Pred = ranges::equal_to>
0040 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Iter
0041 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const {
0042 return std::__adjacent_find(std::move(__first), std::move(__last), __pred, __proj);
0043 }
0044
0045 template <forward_range _Range,
0046 class _Proj = identity,
0047 indirect_binary_predicate<projected<iterator_t<_Range>, _Proj>, projected<iterator_t<_Range>, _Proj>>
0048 _Pred = ranges::equal_to>
0049 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Range>
0050 operator()(_Range&& __range, _Pred __pred = {}, _Proj __proj = {}) const {
0051 return std::__adjacent_find(ranges::begin(__range), ranges::end(__range), __pred, __proj);
0052 }
0053 };
0054
0055 inline namespace __cpo {
0056 inline constexpr auto adjacent_find = __adjacent_find{};
0057 }
0058 }
0059
0060 _LIBCPP_END_NAMESPACE_STD
0061
0062 #endif
0063
0064 _LIBCPP_POP_MACROS
0065
0066 #endif