/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/ |
H A D | ranges.adjacent_find.pass.cpp | 110 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local 121 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local 135 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local 146 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
|
/llvm-project/libcxx/test/support/ |
H A D | counting_projection.h | 26 constexpr counting_projection(Proj proj, int& count) : proj_(std::move(proj)), count_(&count) {} in counting_projection()
|
/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
H A D | ranges.remove.pass.cpp | 136 auto proj = [&](CompCounter i) { in test() local 150 auto proj = [&](CompCounter i) { in test() local
|
H A D | ranges.remove_if.pass.cpp | 151 auto proj = [&](int i) { in test() local 168 auto proj = [&](int i) { in test() local
|
H A D | ranges_remove_copy_if.pass.cpp | 232 const auto proj = &Data::data; in test() local
|
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
H A D | ranges.equal.pass.cpp | 305 auto proj = [&](int i) { ++projCount; return i; }; in test() local 317 auto proj = [&](int i) { ++projCount; return i; }; in test() local 332 auto proj = [&](int i) { ++projCount; return i; }; in test() local 344 auto proj = [&](int i) { ++projCount; return i; }; in test() local 361 auto proj = [&](int i) { ++projCount; return i; }; in test() local 373 auto proj = [&](int i) { ++projCount; return i; }; in test() local
|
/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/ |
H A D | ranges.replace.pass.cpp | 165 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local 173 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
|
H A D | ranges.replace_if.pass.cpp | 145 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local 156 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
|
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.any_of/ |
H A D | ranges.any_of.pass.cpp | 94 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local 104 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local
|
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.none_of/ |
H A D | ranges.none_of.pass.cpp | 94 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local 104 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local
|
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.all_of/ |
H A D | ranges.all_of.pass.cpp | 94 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local 104 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local
|
/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/ |
H A D | ranges.copy_if.pass.cpp | 189 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local 201 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
|
/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ |
H A D | ranges.transform.unary.pass.cpp | 154 auto proj = [&](int) { ++projCount; return 0; }; in test_iterators() local 166 auto proj = [&](int) { ++projCount; return 0; }; in test_iterators() local
|
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.clamp/ |
H A D | ranges.clamp.pass.cpp | 88 auto proj = [](S const& s) -> int const& { return s.i; }; in test() local
|
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
H A D | ranges.min.pass.cpp | 127 auto proj = [](int i) { return i == 5 ? -100 : i; }; in test_initializer_list() local 211 auto proj = [](int& i) { return i == 5 ? -100 : i; }; in test_range() local
|
H A D | ranges.max.pass.cpp | 128 auto proj = [](int i) { return i == 5 ? 100 : i; }; in test_initializer_list() local 215 auto proj = [](int& i) { return i == 5 ? 100 : i; }; in test_range() local
|
H A D | ranges.minmax.pass.cpp | 132 auto proj = [](int i) { return i == 5 ? -100 : i; }; in test_initializer_list() local 212 auto proj = [](int& i) { return i == 5 ? -100 : i; }; in test_range_types() local
|
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/ |
H A D | ranges_equal_range.pass.cpp | 203 const auto proj = [](const Data& d) { return d.data; }; in test() local
|
/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
H A D | ranges_unique.pass.cpp | 186 const auto proj = &Data::data; in test() local
|
H A D | ranges_unique_copy.pass.cpp | 381 const auto proj = &Data::data; in test() local
|
/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
H A D | ranges_partition_copy.pass.cpp | 278 counting_projection proj(proj_count); in test() local
|
/llvm-project/clang/lib/Headers/openmp_wrappers/ |
H A D | complex_cmath.h | 74 template <class _Tp> std::complex<_Tp> proj(const std::complex<_Tp> &__c) { proj() function
|
/llvm-project/clang/test/CodeGen/ |
H A D | 2008-03-24-BitField-And-Alloca.c | 53 unsigned int proj : 1; member
|
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
H A D | ranges_inplace_merge.pass.cpp | 240 const auto proj = &Data::data; in test() local
|
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
H A D | ranges_includes.pass.cpp | 272 const auto proj = &Data::data; in test() local
|