mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-18 20:27:03 +00:00
d10dc5a06f
We originally put implementation-detail function objects into individual namespaces for `std::ranges` without a good reason for doing so. This practice was continued, presumably because there was prior art. Since there's no reason to keep these namespaces, this commit removes them, which will slightly impact binary size. This commit does not apply to CPOs, some of which need additional work.
79 lines
2.7 KiB
C++
79 lines
2.7 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef _LIBCPP___ALGORITHM_RANGES_FIND_H
|
|
#define _LIBCPP___ALGORITHM_RANGES_FIND_H
|
|
|
|
#include <__algorithm/find.h>
|
|
#include <__algorithm/ranges_find_if.h>
|
|
#include <__algorithm/unwrap_range.h>
|
|
#include <__config>
|
|
#include <__functional/identity.h>
|
|
#include <__functional/invoke.h>
|
|
#include <__functional/ranges_operations.h>
|
|
#include <__iterator/concepts.h>
|
|
#include <__iterator/projected.h>
|
|
#include <__ranges/access.h>
|
|
#include <__ranges/concepts.h>
|
|
#include <__ranges/dangling.h>
|
|
#include <__utility/forward.h>
|
|
#include <__utility/move.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_PUSH_MACROS
|
|
#include <__undef_macros>
|
|
|
|
#if _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
namespace ranges {
|
|
struct __find {
|
|
template <class _Iter, class _Sent, class _Tp, class _Proj>
|
|
_LIBCPP_HIDE_FROM_ABI static constexpr _Iter
|
|
__find_unwrap(_Iter __first, _Sent __last, const _Tp& __value, _Proj& __proj) {
|
|
if constexpr (forward_iterator<_Iter>) {
|
|
auto [__first_un, __last_un] = std::__unwrap_range(__first, std::move(__last));
|
|
return std::__rewrap_range<_Sent>(
|
|
std::move(__first), std::__find(std::move(__first_un), std::move(__last_un), __value, __proj));
|
|
} else {
|
|
return std::__find(std::move(__first), std::move(__last), __value, __proj);
|
|
}
|
|
}
|
|
|
|
template <input_iterator _Ip, sentinel_for<_Ip> _Sp, class _Tp, class _Proj = identity>
|
|
requires indirect_binary_predicate<ranges::equal_to, projected<_Ip, _Proj>, const _Tp*>
|
|
[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Ip
|
|
operator()(_Ip __first, _Sp __last, const _Tp& __value, _Proj __proj = {}) const {
|
|
return __find_unwrap(std::move(__first), std::move(__last), __value, __proj);
|
|
}
|
|
|
|
template <input_range _Rp, class _Tp, class _Proj = identity>
|
|
requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Rp>, _Proj>, const _Tp*>
|
|
[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Rp>
|
|
operator()(_Rp&& __r, const _Tp& __value, _Proj __proj = {}) const {
|
|
return __find_unwrap(ranges::begin(__r), ranges::end(__r), __value, __proj);
|
|
}
|
|
};
|
|
|
|
inline namespace __cpo {
|
|
inline constexpr auto find = __find{};
|
|
} // namespace __cpo
|
|
} // namespace ranges
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP___ALGORITHM_RANGES_FIND_H
|