| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | ranges_robust_against_differing_projections.pass.cpp | 55 auto proj2 = [](A a) { return a.x * -1; }; in test_all() local
57 test(std::ranges::equal, in, in2, eq, proj1, proj2); in test_all()
59 test(std::ranges::is_permutation, in, in2, eq, proj1, proj2); in test_all()
60 test(std::ranges::includes, in, in2, less, proj1, proj2); in test_all()
61 test(std::ranges::find_first_of, in, in2, eq, proj1, proj2); in test_all()
62 test(std::ranges::mismatch, in, in2, eq, proj1, proj2); in test_all()
63 test(std::ranges::search, in, in2, eq, proj1, proj2); in test_all()
64 test(std::ranges::find_end, in, in2, eq, proj1, proj2); in test_all()
65 test(std::ranges::transform, in, in2, out, sum, proj1, proj2); in test_all()
68 test(std::ranges::merge, in, in2, out, less, proj1, proj2); in test_all()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| H A D | ranges_includes.pass.cpp | 47 …&& iter1, Sent1&& sent1, Iter2&& iter2, Sent2&& sent2, Comp&& comp, Proj1&& proj1, Proj2&& proj2) {
55 std::forward<Proj2>(proj2));
83 requires(Range1&& range1, Range2&& range2, Comp&& comp, Proj1&& proj1, Proj2&& proj2) {
89 std::forward<Proj2>(proj2));
311 constexpr auto proj2() { in test() function
327 …1.begin(), r1.end(), r2.begin(), r2.end(), compProjs.comp(), compProjs.proj1(), compProjs.proj2()); in test()
338 …uto result = std::ranges::includes(r1, r2, compProjs.comp(), compProjs.proj1(), compProjs.proj2()); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | ranges.is_permutation.pass.cpp | 207 counting_projection<> proj2(proj2Count); in test() local
219 auto ret = std::ranges::is_permutation(a, a + 5, b_begin, b_end, pred, proj1, proj2); in test()
229 …to ret = std::ranges::is_permutation(a, std::ranges::subrange(b_begin, b_end), pred, proj1, proj2); in test()
247 auto ret = std::ranges::is_permutation(a, a + 5, b, b + 5, pred, proj1, proj2); in test()
257 auto ret = std::ranges::is_permutation(a, b, pred, proj1, proj2); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | ranges.lexicographical_compare.pass.cpp | 211 auto proj2 = [&](int i) { ++proj2Count; return i; }; in test() local
213 …exicographical_compare(std::begin(a), std::end(a), std::begin(a), std::end(a), pred, proj1, proj2); in test()
225 auto proj2 = [&](int i) { ++proj2Count; return i; }; in test() local
227 auto ret = std::ranges::lexicographical_compare(a, a, pred, proj1, proj2); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
| H A D | ranges_partial_sort_copy.pass.cpp | 271 auto proj2 = [](A value) { return value.a * -1; }; in test() local
282 …t = std::ranges::partial_sort_copy(in.begin(), in.end(), out.begin(), out.end(), {}, proj1, proj2); in test()
291 result = std::ranges::partial_sort_copy(in, out, {}, proj1, proj2); in test()
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | algorithm | 155 F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
163 F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
417 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
423 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
456 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // Since C++20
466 Proj1 proj1 = {}, Proj2 proj2 = {}); // Since C++20
553 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
561 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
607 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
615 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| H A D | ranges_set_difference.pass.cpp | 473 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
478 …ranges::set_difference(r1.begin(), r1.end(), r2.begin(), r2.end(), out.data(), comp, proj1, proj2); in test()
503 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
508 std::ranges::set_difference(r1, r2, out.data(), comp, proj1, proj2); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| H A D | ranges_set_intersection.pass.cpp | 492 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
497 …nges::set_intersection(r1.begin(), r1.end(), r2.begin(), r2.end(), out.data(), comp, proj1, proj2); in test()
522 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
527 std::ranges::set_intersection(r1, r2, out.data(), comp, proj1, proj2); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| H A D | ranges_merge.pass.cpp | 500 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
505 std::ranges::merge(r1, r1 + 10, r2, r2 + 10, out.data(), comp, proj1, proj2); in test()
529 const auto proj2 = [&numberOfProj2](const Data& d) { in test() local
534 std::ranges::merge(r1, r2, out.data(), comp, proj1, proj2); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| H A D | ranges_set_symmetric_difference.pass.cpp | 443 constexpr auto proj2() { in test() function
470 compProjs.proj2()); in test()
483 …t_symmetric_difference(r1, r2, out.data(), compProjs.comp(), compProjs.proj1(), compProjs.proj2()); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| H A D | ranges_set_union.pass.cpp | 443 constexpr auto proj2() { in test() function
470 compProjs.proj2()); in test()
483 …std::ranges::set_union(r1, r2, out.data(), compProjs.comp(), compProjs.proj1(), compProjs.proj2()); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ |
| H A D | ranges.transform.pass.cpp | 412 auto proj2 = [&](int) { ++proj2Count; return 0; }; in test_iterators() local
416 …transform(In1(a), Sent1(In1(a + 4)), In2(b), Sent2(In2(b + 4)), Out(c.data()), pred, proj1, proj2); in test_iterators()
428 auto proj2 = [&](int) { ++proj2Count; return 0; }; in test_iterators() local
434 std::ranges::transform(range1, range2, Out(c.data()), pred, proj1, proj2); in test_iterators()
|