aboutsummaryrefslogtreecommitdiff
path: root/libcxx/test/libcxx/algorithms/ranges_robust_against_copying_projections.pass.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'libcxx/test/libcxx/algorithms/ranges_robust_against_copying_projections.pass.cpp')
-rw-r--r--libcxx/test/libcxx/algorithms/ranges_robust_against_copying_projections.pass.cpp8
1 files changed, 4 insertions, 4 deletions
diff --git a/libcxx/test/libcxx/algorithms/ranges_robust_against_copying_projections.pass.cpp b/libcxx/test/libcxx/algorithms/ranges_robust_against_copying_projections.pass.cpp
index ed6277e9eb86..aa75226d6295 100644
--- a/libcxx/test/libcxx/algorithms/ranges_robust_against_copying_projections.pass.cpp
+++ b/libcxx/test/libcxx/algorithms/ranges_robust_against_copying_projections.pass.cpp
@@ -148,8 +148,8 @@ constexpr bool all_the_algorithms()
(void)std::ranges::minmax_element(a, Less(), Proj(&copies)); assert(copies == 0);
(void)std::ranges::mismatch(first, last, first2, last2, Equal(), Proj(&copies), Proj(&copies)); assert(copies == 0);
(void)std::ranges::mismatch(a, b, Equal(), Proj(&copies), Proj(&copies)); assert(copies == 0);
- //(void)std::ranges::next_permutation(first, last, Less(), Proj(&copies)); assert(copies == 0);
- //(void)std::ranges::next_permutation(a, Less(), Proj(&copies)); assert(copies == 0);
+ (void)std::ranges::next_permutation(first, last, Less(), Proj(&copies)); assert(copies == 0);
+ (void)std::ranges::next_permutation(a, Less(), Proj(&copies)); assert(copies == 0);
(void)std::ranges::none_of(first, last, UnaryTrue(), Proj(&copies)); assert(copies == 0);
(void)std::ranges::none_of(a, UnaryTrue(), Proj(&copies)); assert(copies == 0);
(void)std::ranges::nth_element(first, mid, last, Less(), Proj(&copies)); assert(copies == 0);
@@ -166,8 +166,8 @@ constexpr bool all_the_algorithms()
(void)std::ranges::partition_point(a, UnaryTrue(), Proj(&copies)); assert(copies == 0);
(void)std::ranges::pop_heap(first, last, Less(), Proj(&copies)); assert(copies == 0);
(void)std::ranges::pop_heap(a, Less(), Proj(&copies)); assert(copies == 0);
- //(void)std::ranges::prev_permutation(first, last, Less(), Proj(&copies)); assert(copies == 0);
- //(void)std::ranges::prev_permutation(a, Less(), Proj(&copies)); assert(copies == 0);
+ (void)std::ranges::prev_permutation(first, last, Less(), Proj(&copies)); assert(copies == 0);
+ (void)std::ranges::prev_permutation(a, Less(), Proj(&copies)); assert(copies == 0);
(void)std::ranges::push_heap(first, last, Less(), Proj(&copies)); assert(copies == 0);
(void)std::ranges::push_heap(a, Less(), Proj(&copies)); assert(copies == 0);
(void)std::ranges::remove_copy(first, last, first2, value, Proj(&copies)); assert(copies == 0);