Home
last modified time | relevance | path

Searched refs:proj2Count (Results 1 – 5 of 5) sorted by relevance

/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/
H A Dranges.is_permutation.pass.cpp199 int proj2Count = 0; in test() local
201 predCount = proj1Count = proj2Count = 0; in test()
206 counting_projection<> proj2(proj2Count); in test()
223 assert(proj2Count == 0); in test()
233 assert(proj2Count == 0); in test()
251 assert(proj2Count == expected); in test()
261 assert(proj2Count == expected); in test()
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/
H A Dranges.lexicographical_compare.pass.cpp193 auto proj2Count = 0; in test() local
194 auto proj2 = [&](int i) { ++proj2Count; return i; }; in test()
200 assert(proj2Count == 10); in test()
207 auto proj2Count = 0; in test() local
208 auto proj2 = [&](int i) { ++proj2Count; return i; }; in test()
214 assert(proj2Count == 10); in test()
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/
H A Dranges.find_first_of.pass.cpp204 int proj2Count = 0; in test() local
205 auto proj2Counter = [&](int i) { ++proj2Count; return i; }; in test()
211 assert(proj2Count <= 8); in test()
218 int proj2Count = 0; in test() local
219 auto proj2Counter = [&](int i) { ++proj2Count; return i; }; in test()
224 assert(proj2Count == 8); in test()
/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/
H A Dranges.transform.binary.iterator.pass.cpp161 int proj2Count = 0; in test_iterators() local
164 auto proj2 = [&](int) { ++proj2Count; return 0; }; in test_iterators()
171 assert(proj2Count == 4); in test_iterators()
H A Dranges.transform.binary.range.pass.cpp174 int proj2Count = 0; in test_iterators() local
177 auto proj2 = [&](int) { ++proj2Count; return 0; }; in test_iterators()
186 assert(proj2Count == 4); in test_iterators()