| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| H A D | ranges.lexicographical_compare.pass.cpp | 192 auto proj1 = [&](int i) { ++proj1Count; return i; }; in test() local
206 auto proj1 = [&](int i) { ++proj1Count; return i; }; in test() local
|
| /llvm-project/libcxx/test/std/algorithms/ |
| H A D | ranges_robust_against_differing_projections.pass.cpp | 54 auto proj1 = [](int x) { return x * -1; }; in test_all() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/ |
| H A D | ranges_partial_sort_copy.pass.cpp | 269 auto proj1 = [](int value) { return value * -1; }; in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | ranges.is_permutation.pass.cpp | 205 counting_projection<> proj1(proj1Count); in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| H A D | ranges_set_difference.pass.cpp | 467 const auto proj1 = [&numberOfProj1](const Data& d) { in test() local
497 const auto proj1 = [&numberOfProj1](const Data& d) { in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| H A D | ranges_merge.pass.cpp | 495 const auto proj1 = [&numberOfProj1](const Data& d) { in test() local
524 const auto proj1 = [&numberOfProj1](const Data& d) { in test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| H A D | ranges_set_intersection.pass.cpp | 486 const auto proj1 = [&numberOfProj1](const Data& d) { test() local
516 const auto proj1 = [&numberOfProj1](const Data& d) { test() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ |
| H A D | ranges.transform.binary.iterator.pass.cpp | 163 auto proj1 = [&](int) { ++proj1Count; return 0; }; in test_iterators() local
|
| H A D | ranges.transform.binary.range.pass.cpp | 176 auto proj1 = [&](int) { ++proj1Count; return 0; }; in test_iterators() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| H A D | ranges_includes.pass.cpp | 303 constexpr auto proj1() { in test() function
|
| /llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.contains/ |
| H A D | ranges.contains_subrange.pass.cpp | 289 auto proj1 = [](int i) { return i - 3; }; in test_iterators() local
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| H A D | ranges_set_union.pass.cpp | 436 constexpr auto proj1() { in test() function
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| H A D | ranges_set_symmetric_difference.pass.cpp | 436 constexpr auto proj1() { in test() function
|