Differential D129657 Diff 444407 libcxx/test/libcxx/algorithms/ranges_robust_against_copying_comparators.pass.cpp
Changeset View
Changeset View
Standalone View
Standalone View
libcxx/test/libcxx/algorithms/ranges_robust_against_copying_comparators.pass.cpp
| Show First 20 Lines • Show All 199 Lines • ▼ Show 20 Lines | #endif | ||||
| (void)std::ranges::search_n(first, last, count, value, Equal(&copies)); assert(copies == 0); | (void)std::ranges::search_n(first, last, count, value, Equal(&copies)); assert(copies == 0); | ||||
| (void)std::ranges::search_n(a, count, value, Equal(&copies)); assert(copies == 0); | (void)std::ranges::search_n(a, count, value, Equal(&copies)); assert(copies == 0); | ||||
| (void)std::ranges::set_difference(first, mid, mid, last, first2, Less(&copies)); assert(copies == 0); | (void)std::ranges::set_difference(first, mid, mid, last, first2, Less(&copies)); assert(copies == 0); | ||||
| (void)std::ranges::set_difference(a, b, first2, Less(&copies)); assert(copies == 0); | (void)std::ranges::set_difference(a, b, first2, Less(&copies)); assert(copies == 0); | ||||
| (void)std::ranges::set_intersection(first, mid, mid, last, first2, Less(&copies)); assert(copies == 0); | (void)std::ranges::set_intersection(first, mid, mid, last, first2, Less(&copies)); assert(copies == 0); | ||||
| (void)std::ranges::set_intersection(a, b, first2, Less(&copies)); assert(copies == 0); | (void)std::ranges::set_intersection(a, b, first2, Less(&copies)); assert(copies == 0); | ||||
| (void)std::ranges::set_symmetric_difference(first, mid, mid, last, first2, Less(&copies)); assert(copies == 0); | (void)std::ranges::set_symmetric_difference(first, mid, mid, last, first2, Less(&copies)); assert(copies == 0); | ||||
| (void)std::ranges::set_symmetric_difference(a, b, first2, Less(&copies)); assert(copies == 0); | (void)std::ranges::set_symmetric_difference(a, b, first2, Less(&copies)); assert(copies == 0); | ||||
| //(void)std::ranges::set_union(first, mid, mid, last, first2, Less(&copies)); assert(copies == 0); | (void)std::ranges::set_union(first, mid, mid, last, first2, Less(&copies)); assert(copies == 0); | ||||
| //(void)std::ranges::set_union(a, b, first2, Less(&copies)); assert(copies == 0); | (void)std::ranges::set_union(a, b, first2, Less(&copies)); assert(copies == 0); | ||||
| (void)std::ranges::sort(first, last, Less(&copies)); assert(copies == 0); | (void)std::ranges::sort(first, last, Less(&copies)); assert(copies == 0); | ||||
| (void)std::ranges::sort(a, Less(&copies)); assert(copies == 0); | (void)std::ranges::sort(a, Less(&copies)); assert(copies == 0); | ||||
| (void)std::ranges::sort_heap(first, last, Less(&copies)); assert(copies == 0); | (void)std::ranges::sort_heap(first, last, Less(&copies)); assert(copies == 0); | ||||
| (void)std::ranges::sort_heap(a, Less(&copies)); assert(copies == 0); | (void)std::ranges::sort_heap(a, Less(&copies)); assert(copies == 0); | ||||
| //if (!std::is_constant_evaluated()) { (void)std::ranges::stable_partition(first, last, UnaryTrue(&copies)); assert(copies == 0); } | //if (!std::is_constant_evaluated()) { (void)std::ranges::stable_partition(first, last, UnaryTrue(&copies)); assert(copies == 0); } | ||||
| //if (!std::is_constant_evaluated()) { (void)std::ranges::stable_partition(a, UnaryTrue(&copies)); assert(copies == 0); } | //if (!std::is_constant_evaluated()) { (void)std::ranges::stable_partition(a, UnaryTrue(&copies)); assert(copies == 0); } | ||||
| if (!std::is_constant_evaluated()) { (void)std::ranges::stable_sort(first, last, Less(&copies)); assert(copies == 0); } | if (!std::is_constant_evaluated()) { (void)std::ranges::stable_sort(first, last, Less(&copies)); assert(copies == 0); } | ||||
| if (!std::is_constant_evaluated()) { (void)std::ranges::stable_sort(a, Less(&copies)); assert(copies == 0); } | if (!std::is_constant_evaluated()) { (void)std::ranges::stable_sort(a, Less(&copies)); assert(copies == 0); } | ||||
| Show All 24 Lines | |||||