mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-17 11:46:44 +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.
75 lines
2.6 KiB
C++
75 lines
2.6 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_NEXT_PERMUTATION_H
|
|
#define _LIBCPP___ALGORITHM_RANGES_NEXT_PERMUTATION_H
|
|
|
|
#include <__algorithm/in_found_result.h>
|
|
#include <__algorithm/iterator_operations.h>
|
|
#include <__algorithm/make_projected.h>
|
|
#include <__algorithm/next_permutation.h>
|
|
#include <__config>
|
|
#include <__functional/identity.h>
|
|
#include <__functional/ranges_operations.h>
|
|
#include <__iterator/concepts.h>
|
|
#include <__iterator/sortable.h>
|
|
#include <__ranges/access.h>
|
|
#include <__ranges/concepts.h>
|
|
#include <__ranges/dangling.h>
|
|
#include <__utility/move.h>
|
|
#include <__utility/pair.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 {
|
|
|
|
template <class _InIter>
|
|
using next_permutation_result = in_found_result<_InIter>;
|
|
|
|
struct __next_permutation {
|
|
template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
|
|
requires sortable<_Iter, _Comp, _Proj>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr next_permutation_result<_Iter>
|
|
operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
|
|
auto __result = std::__next_permutation<_RangeAlgPolicy>(
|
|
std::move(__first), std::move(__last), std::__make_projected(__comp, __proj));
|
|
return {std::move(__result.first), std::move(__result.second)};
|
|
}
|
|
|
|
template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
|
|
requires sortable<iterator_t<_Range>, _Comp, _Proj>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr next_permutation_result<borrowed_iterator_t<_Range>>
|
|
operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
|
|
auto __result = std::__next_permutation<_RangeAlgPolicy>(
|
|
ranges::begin(__range), ranges::end(__range), std::__make_projected(__comp, __proj));
|
|
return {std::move(__result.first), std::move(__result.second)};
|
|
}
|
|
};
|
|
|
|
inline namespace __cpo {
|
|
constexpr inline auto next_permutation = __next_permutation{};
|
|
} // namespace __cpo
|
|
} // namespace ranges
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP___ALGORITHM_RANGES_NEXT_PERMUTATION_H
|