__cxx03/__algorithm/ranges_next_permutation.h

0001 //===----------------------------------------------------------------------===//
0002 //
0003 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
0004 // See https://llvm.org/LICENSE.txt for license information.
0005 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
0006 //
0007 //===----------------------------------------------------------------------===//
0008
0009 #ifndef _LIBCPP___CXX03___ALGORITHM_RANGES_NEXT_PERMUTATION_H
0010 #define _LIBCPP___CXX03___ALGORITHM_RANGES_NEXT_PERMUTATION_H
0011
0012 #include <__cxx03/__algorithm/in_found_result.h>
0013 #include <__cxx03/__algorithm/iterator_operations.h>
0014 #include <__cxx03/__algorithm/make_projected.h>
0015 #include <__cxx03/__algorithm/next_permutation.h>
0016 #include <__cxx03/__config>
0017 #include <__cxx03/__functional/identity.h>
0018 #include <__cxx03/__functional/ranges_operations.h>
0019 #include <__cxx03/__iterator/concepts.h>
0020 #include <__cxx03/__iterator/sortable.h>
0021 #include <__cxx03/__ranges/access.h>
0022 #include <__cxx03/__ranges/concepts.h>
0023 #include <__cxx03/__ranges/dangling.h>
0024 #include <__cxx03/__utility/move.h>
0025 #include <__cxx03/__utility/pair.h>
0026
0027 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
0028 #  pragma GCC system_header
0029 #endif
0030
0031 _LIBCPP_PUSH_MACROS
0032 #include <__cxx03/__undef_macros>
0033
0034 #if _LIBCPP_STD_VER >= 20
0035
0036 _LIBCPP_BEGIN_NAMESPACE_STD
0037
0038 namespace ranges {
0039
0040 template <class _InIter>
0041 using next_permutation_result = in_found_result<_InIter>;
0042
0043 namespace __next_permutation {
0044
0045 struct __fn {
0046   template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
0047     requires sortable<_Iter, _Comp, _Proj>
0048   _LIBCPP_HIDE_FROM_ABI constexpr next_permutation_result<_Iter>
0049   operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
0050     auto __result = std::__next_permutation<_RangeAlgPolicy>(
0051         std::move(__first), std::move(__last), std::__make_projected(__comp, __proj));
0052     return {std::move(__result.first), std::move(__result.second)};
0053   }
0054
0055   template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
0056     requires sortable<iterator_t<_Range>, _Comp, _Proj>
0057   _LIBCPP_HIDE_FROM_ABI constexpr next_permutation_result<borrowed_iterator_t<_Range>>
0058   operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
0059     auto __result = std::__next_permutation<_RangeAlgPolicy>(
0060         ranges::begin(__range), ranges::end(__range), std::__make_projected(__comp, __proj));
0061     return {std::move(__result.first), std::move(__result.second)};
0062   }
0063 };
0064
0065 } // namespace __next_permutation
0066
0067 inline namespace __cpo {
0068 constexpr inline auto next_permutation = __next_permutation::__fn{};
0069 } // namespace __cpo
0070 } // namespace ranges
0071
0072 _LIBCPP_END_NAMESPACE_STD
0073
0074 #endif // _LIBCPP_STD_VER >= 20
0075
0076 _LIBCPP_POP_MACROS
0077
0078 #endif // _LIBCPP___CXX03___ALGORITHM_RANGES_NEXT_PERMUTATION_H