| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| H A D | ranges_inplace_merge.pass.cpp | 301 int numberOfComp = 0; in test() local
307 counting_predicate{std::ranges::less{}, numberOfComp}, in test()
314 assert(numberOfComp <= static_cast<int>(in.size() - 1)); in test()
315 assert(numberOfProj <= 2 * numberOfComp); in test()
320 int numberOfComp = 0; in test() local
325 counting_predicate{std::ranges::less{}, numberOfComp}, in test()
329 assert(numberOfComp <= static_cast<int>(in.size() - 1)); in test()
330 assert(numberOfProj <= 2 * numberOfComp); in test()
|
| H A D | ranges_merge.pass.cpp | 486 std::size_t numberOfComp = 0; in test() local
490 const auto comp = [&numberOfComp](int x, int y) { in test()
491 ++numberOfComp; in test()
507 assert(numberOfComp < out.size()); in test()
515 std::size_t numberOfComp = 0; in test() local
519 const auto comp = [&numberOfComp](int x, int y) { in test()
520 ++numberOfComp; in test()
536 assert(numberOfComp < out.size()); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| H A D | ranges_unique.pass.cpp | 214 int numberOfComp = 0; in test() local
219 counting_predicate{std::ranges::equal_to{}, numberOfComp}, in test()
223 assert(numberOfComp == in.size() - 1); in test()
229 int numberOfComp = 0; in test() local
232 … in, counting_predicate{std::ranges::equal_to{}, numberOfComp}, counting_projection{numberOfProj}); in test()
235 assert(numberOfComp == in.size() - 1); in test()
|
| H A D | ranges_unique_copy.pass.cpp | 411 int numberOfComp = 0; in test() local
417 counting_predicate{std::ranges::equal_to{}, numberOfComp}, in test()
422 assert(numberOfComp == in.size() - 1); in test()
428 int numberOfComp = 0; in test() local
433 counting_predicate{std::ranges::equal_to{}, numberOfComp}, in test()
438 assert(numberOfComp == in.size() - 1); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| H A D | ranges_set_difference.pass.cpp | 459 std::size_t numberOfComp = 0; in test() local
463 const auto comp = [&numberOfComp](int x, int y) { in test()
464 ++numberOfComp; in test()
481 assert(numberOfComp < maxOperation); in test()
489 std::size_t numberOfComp = 0; in test() local
493 const auto comp = [&numberOfComp](int x, int y) { in test()
494 ++numberOfComp; in test()
511 assert(numberOfComp < maxOperation); 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 | 478 std::size_t numberOfComp = 0; in test() local
482 const auto comp = [&numberOfComp](int x, int y) { in test()
483 ++numberOfComp; in test()
500 assert(numberOfComp < maxOperation); in test()
508 std::size_t numberOfComp = 0; in test() local
512 const auto comp = [&numberOfComp](int x, int y) { in test()
513 ++numberOfComp; in test()
530 assert(numberOfComp < maxOperation); in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| H A D | ranges_includes.pass.cpp | 293 std::size_t numberOfComp = 0; in test() member
299 ++numberOfComp; in test()
329 assert(compProjs.numberOfComp < maxOperation); in test()
340 assert(compProjs.numberOfComp < maxOperation); 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 | 425 std::size_t numberOfComp = 0; in test() member
431 ++numberOfComp; in test()
473 assert(compProjs.numberOfComp < maxOperation); in test()
486 assert(compProjs.numberOfComp < maxOperation); 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 | 425 std::size_t numberOfComp = 0; in test() member
431 ++numberOfComp; in test()
473 assert(compProjs.numberOfComp < maxOperation); in test()
486 assert(compProjs.numberOfComp < maxOperation); in test()
|