Home
last modified time | relevance | path

Searched refs:next_permutation (Results 1 – 25 of 31) sorted by relevance

12

/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.permutation.generators/
H A Dranges.next_permutation.pass.cpp45 concept HasNextPermutationR = requires(Range range) { std::ranges::next_permutation(range); };
114 return std::ranges::next_permutation(range.begin(), range.end()); in test_all_permutations()
118 return std::ranges::next_permutation(range); in test_all_permutations()
131 std::same_as<Result> decltype(auto) result = std::ranges::next_permutation(begin, end); in test_one()
143 std::same_as<Result> decltype(auto) result = std::ranges::next_permutation(range); in test_one()
195 auto result = std::ranges::next_permutation(in.begin(), in.end(), &A::comp); in test()
204 auto result = std::ranges::next_permutation(in, &A::comp); in test()
223 auto result = std::ranges::next_permutation(in.begin(), in.end(), {}, &A::negate); in test()
232 auto result = std::ranges::next_permutation(in, {}, &A::negate); in test()
249 std::ranges::next_permutation(begin, end); in test()
[all …]
H A Dnext_permutation.pass.cpp47 x = std::next_permutation(Iter(ia), Iter(ia+e)); in test()
H A Dnext_permutation_comp.pass.cpp49 x = std::next_permutation(Iter(ia), Iter(ia+e), C()); in test()
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dnext_permutation.h62 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in next_permutation() function
72 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) in next_permutation() function
74 return _VSTD::next_permutation(__first, __last, in next_permutation()
H A Dranges_next_permutation.h64 constexpr inline auto next_permutation = __next_permutation::__fn{};
/llvm-project-15.0.7/libcxx/test/libcxx/algorithms/
H A Drobust_against_cpp20_hostile_iterators.compile.pass.cpp157 (void) std::next_permutation(it, it); in test()
158 (void) std::next_permutation(it, it, pred); in test()
H A Dranges_robust_against_copying_comparators.pass.cpp168 (void)std::ranges::next_permutation(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
169 (void)std::ranges::next_permutation(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
H A Dranges_robust_against_copying_projections.pass.cpp151 (void)std::ranges::next_permutation(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
152 (void)std::ranges::next_permutation(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
H A Drobust_against_copying_comparators.pass.cpp169 (void)std::next_permutation(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/
H A Dstable_sort.pass.cpp42 } while (std::next_permutation(f, l)); in test_sort_helper()
/llvm-project-15.0.7/libcxx/test/std/algorithms/
H A Drobust_re_difference_type.compile.pass.cpp187 (void)std::next_permutation(first, last); in all_the_algorithms()
188 (void)std::next_permutation(first, last, std::less<void*>()); in all_the_algorithms()
H A Dranges_robust_against_nonbool_predicates.pass.cpp143 test(std::ranges::next_permutation, in, binary_pred); in test_all()
H A Dranges_robust_against_proxy_iterators.pass.cpp172 test(std::ranges::next_permutation, in); in run_tests()
H A Dranges_robust_against_dangling.pass.cpp205 dangling_1st<next_permutation_result<dangling>>(std::ranges::next_permutation, in); in test_all()
H A Dranges_robust_against_omitting_invoke.pass.cpp172 test(std::ranges::next_permutation, in, &Foo::binary_pred, &Bar::val); in test_all()
/llvm-project-15.0.7/libcxx/docs/DesignDocs/
H A DDebugMode.rst33 many algorithms such as ``binary_search``, ``merge``, ``next_permutation``, and ``sort``, wrap the
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_stackdepot_test.cpp186 std::next_permutation(frames.begin(), frames.end()); in TEST_P()
H A Dsanitizer_stack_store_test.cpp42 std::next_permutation(frames.begin(), frames.end()); in ForEachTrace()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/
H A Dsort.pass.cpp42 } while (std::next_permutation(f, l)); in test_sort_helper()
/llvm-project-15.0.7/llvm/unittests/DebugInfo/PDB/
H A DHashTableTest.cpp205 } while (std::next_permutation(Streams.begin(), Streams.end())); in TEST()
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DTripleTest.cpp880 } while (std::next_permutation(std::begin(I), std::end(I))); in TEST()
885 } while (std::next_permutation(std::begin(J), std::end(J))); in TEST()
895 } while (std::next_permutation(std::begin(I), std::end(I))); in TEST()
900 } while (std::next_permutation(std::begin(J), std::end(J))); in TEST()
911 } while (std::next_permutation(std::begin(I), std::end(I))); in TEST()
916 } while (std::next_permutation(std::begin(J), std::end(J))); in TEST()
925 } while (std::next_permutation(std::begin(J), std::end(J))); in TEST()
/llvm-project-15.0.7/libcxx/test/std/library/description/conventions/customization.point.object/
H A Dniebloid.compile.pass.cpp109 static_assert(test(std::ranges::next_permutation, a));
/llvm-project-15.0.7/libcxx/docs/Status/
H A DRangesAlgorithms.csv85 Permutation,next_permutation,Nikolas Klauser,`D129859 <https://llvm.org/D129859>`_,✅
/llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/
H A DIntegerPolyhedronTest.cpp127 } while (std::next_permutation(perm.begin(), perm.end())); in checkPermutationsSample()
/llvm-project-15.0.7/libcxx/include/
H A Dalgorithm1045 …ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // Si…
1051 …ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // Si…
1689 next_permutation(BidirectionalIterator first, BidirectionalIterator last);
1693 next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1772 #include <__algorithm/next_permutation.h>

12