1*4bdff4beSrobert //===----------------------------------------------------------------------===// 2*4bdff4beSrobert // 3*4bdff4beSrobert // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4*4bdff4beSrobert // See https://llvm.org/LICENSE.txt for license information. 5*4bdff4beSrobert // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6*4bdff4beSrobert // 7*4bdff4beSrobert //===----------------------------------------------------------------------===// 8*4bdff4beSrobert 9*4bdff4beSrobert #ifndef _LIBCPP___ALGORITHM_RANGES_NEXT_PERMUTATION_H 10*4bdff4beSrobert #define _LIBCPP___ALGORITHM_RANGES_NEXT_PERMUTATION_H 11*4bdff4beSrobert 12*4bdff4beSrobert #include <__algorithm/in_found_result.h> 13*4bdff4beSrobert #include <__algorithm/iterator_operations.h> 14*4bdff4beSrobert #include <__algorithm/make_projected.h> 15*4bdff4beSrobert #include <__algorithm/next_permutation.h> 16*4bdff4beSrobert #include <__config> 17*4bdff4beSrobert #include <__functional/identity.h> 18*4bdff4beSrobert #include <__functional/ranges_operations.h> 19*4bdff4beSrobert #include <__iterator/concepts.h> 20*4bdff4beSrobert #include <__iterator/sortable.h> 21*4bdff4beSrobert #include <__ranges/access.h> 22*4bdff4beSrobert #include <__ranges/concepts.h> 23*4bdff4beSrobert #include <__ranges/dangling.h> 24*4bdff4beSrobert #include <__utility/move.h> 25*4bdff4beSrobert #include <__utility/pair.h> 26*4bdff4beSrobert 27*4bdff4beSrobert #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 28*4bdff4beSrobert # pragma GCC system_header 29*4bdff4beSrobert #endif 30*4bdff4beSrobert 31*4bdff4beSrobert #if _LIBCPP_STD_VER > 17 32*4bdff4beSrobert 33*4bdff4beSrobert _LIBCPP_BEGIN_NAMESPACE_STD 34*4bdff4beSrobert 35*4bdff4beSrobert namespace ranges { 36*4bdff4beSrobert 37*4bdff4beSrobert template <class _InIter> 38*4bdff4beSrobert using next_permutation_result = in_found_result<_InIter>; 39*4bdff4beSrobert 40*4bdff4beSrobert namespace __next_permutation { 41*4bdff4beSrobert 42*4bdff4beSrobert struct __fn { 43*4bdff4beSrobert template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity> 44*4bdff4beSrobert requires sortable<_Iter, _Comp, _Proj> 45*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI constexpr next_permutation_result<_Iter> operator__fn46*4bdff4beSrobert operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { 47*4bdff4beSrobert auto __result = std::__next_permutation<_RangeAlgPolicy>( 48*4bdff4beSrobert std::move(__first), std::move(__last), std::__make_projected(__comp, __proj)); 49*4bdff4beSrobert return {std::move(__result.first), std::move(__result.second)}; 50*4bdff4beSrobert } 51*4bdff4beSrobert 52*4bdff4beSrobert template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity> 53*4bdff4beSrobert requires sortable<iterator_t<_Range>, _Comp, _Proj> 54*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI constexpr next_permutation_result<borrowed_iterator_t<_Range>> operator__fn55*4bdff4beSrobert operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { 56*4bdff4beSrobert auto __result = std::__next_permutation<_RangeAlgPolicy>( 57*4bdff4beSrobert ranges::begin(__range), ranges::end(__range), std::__make_projected(__comp, __proj)); 58*4bdff4beSrobert return {std::move(__result.first), std::move(__result.second)}; 59*4bdff4beSrobert } 60*4bdff4beSrobert }; 61*4bdff4beSrobert 62*4bdff4beSrobert } // namespace __next_permutation 63*4bdff4beSrobert 64*4bdff4beSrobert inline namespace __cpo { 65*4bdff4beSrobert constexpr inline auto next_permutation = __next_permutation::__fn{}; 66*4bdff4beSrobert } // namespace __cpo 67*4bdff4beSrobert } // namespace ranges 68*4bdff4beSrobert 69*4bdff4beSrobert _LIBCPP_END_NAMESPACE_STD 70*4bdff4beSrobert 71*4bdff4beSrobert #endif // _LIBCPP_STD_VER > 17 72*4bdff4beSrobert 73*4bdff4beSrobert #endif // _LIBCPP___ALGORITHM_RANGES_NEXT_PERMUTATION_H 74