| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.permutation.generators/ |
| H A D | ranges.prev_permutation.pass.cpp | 45 concept HasPrevPermutationR = requires(Range range) { std::ranges::prev_permutation(range); };
114 return std::ranges::prev_permutation(range.begin(), range.end()); in test_all_permutations()
118 return std::ranges::prev_permutation(range); in test_all_permutations()
131 std::same_as<Result> decltype(auto) result = std::ranges::prev_permutation(begin, end); in test_one()
143 std::same_as<Result> decltype(auto) result = std::ranges::prev_permutation(range); in test_one()
195 auto result = std::ranges::prev_permutation(in.begin(), in.end(), &A::comp); in test()
204 auto result = std::ranges::prev_permutation(in, &A::comp); in test()
223 auto result = std::ranges::prev_permutation(in.begin(), in.end(), {}, &A::negate); in test()
232 auto result = std::ranges::prev_permutation(in, {}, &A::negate); in test()
249 std::ranges::prev_permutation(begin, end); in test()
[all …]
|
| H A D | prev_permutation.pass.cpp | 47 x = std::prev_permutation(Iter(ia), Iter(ia+e)); in test()
|
| H A D | prev_permutation_comp.pass.cpp | 49 x = std::prev_permutation(Iter(ia), Iter(ia+e), C()); in test()
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | prev_permutation.h | 62 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in prev_permutation() function
72 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) in prev_permutation() function
74 return _VSTD::prev_permutation(__first, __last, in prev_permutation()
|
| H A D | ranges_prev_permutation.h | 68 constexpr inline auto prev_permutation = __prev_permutation::__fn{};
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_cpp20_hostile_iterators.compile.pass.cpp | 171 (void) std::prev_permutation(it, it); in test()
172 (void) std::prev_permutation(it, it, pred); in test()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 186 (void)std::ranges::prev_permutation(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
187 (void)std::ranges::prev_permutation(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 169 (void)std::ranges::prev_permutation(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
170 (void)std::ranges::prev_permutation(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | robust_against_copying_comparators.pass.cpp | 180 (void)std::prev_permutation(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_re_difference_type.compile.pass.cpp | 201 (void)std::prev_permutation(first, last); in all_the_algorithms()
202 (void)std::prev_permutation(first, last, std::less<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_nonbool_predicates.pass.cpp | 142 test(std::ranges::prev_permutation, in, binary_pred); in test_all()
|
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 171 test(std::ranges::prev_permutation, in); in run_tests()
|
| H A D | ranges_robust_against_dangling.pass.cpp | 204 dangling_1st<prev_permutation_result<dangling>>(std::ranges::prev_permutation, in); in test_all()
|
| H A D | ranges_robust_against_omitting_invoke.pass.cpp | 171 test(std::ranges::prev_permutation, in, &Foo::binary_pred, &Bar::val); in test_all()
|
| H A D | robust_against_proxy_iterators_lifetime_bugs.pass.cpp | 751 test(simple_in, [&](I b, I e) { std::prev_permutation(b, e); }); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/library/description/conventions/customization.point.object/ |
| H A D | niebloid.compile.pass.cpp | 118 static_assert(test(std::ranges::prev_permutation, a));
|
| /llvm-project-15.0.7/libcxx/docs/Status/ |
| H A D | RangesAlgorithms.csv | 86 Permutation,prev_permutation,Nikolas Klauser,`D129859 <https://llvm.org/D129859>`_,✅
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | algorithm | 1030 …ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // Si…
1036 …ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // Si…
1697 prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
1701 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1781 #include <__algorithm/prev_permutation.h>
|
| H A D | CMakeLists.txt | 69 __algorithm/prev_permutation.h
|
| H A D | module.modulemap.in | 311 module prev_permutation { private header "__algorithm/prev_permutation.h" }
|
| /llvm-project-15.0.7/llvm/utils/gn/secondary/libcxx/include/ |
| H A D | BUILD.gn | 138 "__algorithm/prev_permutation.h",
|
| /llvm-project-15.0.7/clang/include/clang/Tooling/Inclusions/ |
| H A D | StdSymbolMap.inc | 894 SYMBOL(prev_permutation, std::, <algorithm>)
|