1 //===----------------------------------------------------------------------===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 9 #ifndef _LIBCPP___ALGORITHM_RANGES_IS_PERMUTATION_H 10 #define _LIBCPP___ALGORITHM_RANGES_IS_PERMUTATION_H 11 12 #include <__algorithm/is_permutation.h> 13 #include <__algorithm/iterator_operations.h> 14 #include <__config> 15 #include <__functional/identity.h> 16 #include <__functional/ranges_operations.h> 17 #include <__iterator/concepts.h> 18 #include <__iterator/distance.h> 19 #include <__iterator/projected.h> 20 #include <__ranges/access.h> 21 #include <__ranges/concepts.h> 22 #include <__utility/move.h> 23 24 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 25 # pragma GCC system_header 26 #endif 27 28 #if _LIBCPP_STD_VER >= 20 29 30 _LIBCPP_BEGIN_NAMESPACE_STD 31 32 namespace ranges { 33 namespace __is_permutation { 34 struct __fn { 35 template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, class _Pred> 36 _LIBCPP_HIDE_FROM_ABI constexpr static bool __is_permutation_func_impl( 37 _Iter1 __first1, 38 _Sent1 __last1, 39 _Iter2 __first2, 40 _Sent2 __last2, 41 _Pred& __pred, 42 _Proj1& __proj1, 43 _Proj2& __proj2) { 44 return std::__is_permutation<_RangeAlgPolicy>( 45 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1, __proj2); 46 } 47 48 template < 49 forward_iterator _Iter1, 50 sentinel_for<_Iter1> _Sent1, 51 forward_iterator _Iter2, 52 sentinel_for<_Iter2> _Sent2, 53 class _Proj1 = identity, 54 class _Proj2 = identity, 55 indirect_equivalence_relation<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Pred = ranges::equal_to> 56 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr bool operator()( 57 _Iter1 __first1, 58 _Sent1 __last1, 59 _Iter2 __first2, 60 _Sent2 __last2, 61 _Pred __pred = {}, 62 _Proj1 __proj1 = {}, 63 _Proj2 __proj2 = {}) const { 64 return __is_permutation_func_impl( 65 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1, __proj2); 66 } 67 68 template <forward_range _Range1, 69 forward_range _Range2, 70 class _Proj1 = identity, 71 class _Proj2 = identity, 72 indirect_equivalence_relation<projected<iterator_t<_Range1>, _Proj1>, 73 projected<iterator_t<_Range2>, _Proj2>> _Pred = ranges::equal_to> 74 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr bool operator()( 75 _Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { 76 if constexpr (sized_range<_Range1> && sized_range<_Range2>) { 77 if (ranges::distance(__range1) != ranges::distance(__range2)) 78 return false; 79 } 80 81 return __is_permutation_func_impl( 82 ranges::begin(__range1), 83 ranges::end(__range1), 84 ranges::begin(__range2), 85 ranges::end(__range2), 86 __pred, 87 __proj1, 88 __proj2); 89 } 90 }; 91 } // namespace __is_permutation 92 93 inline namespace __cpo { 94 inline constexpr auto is_permutation = __is_permutation::__fn{}; 95 } // namespace __cpo 96 } // namespace ranges 97 98 _LIBCPP_END_NAMESPACE_STD 99 100 #endif // _LIBCPP_STD_VER >= 20 101 102 #endif // _LIBCPP___ALGORITHM_RANGES_IS_PERMUTATION_H 103