//===----------------------------------------------------------------------===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// // UNSUPPORTED: c++03, c++11, c++14, c++17 // template S, weakly_incrementable O> // requires indirectly_copyable // constexpr ranges::reverse_copy_result // ranges::reverse_copy(I first, S last, O result); // template // requires indirectly_copyable, O> // constexpr ranges::reverse_copy_result, O> // ranges::reverse_copy(R&& r, O result); // #include #include #include #include #include "almost_satisfies_types.h" #include "test_iterators.h" template > concept HasReverseCopyIt = requires(Iter first, Sent last, Out out) { std::ranges::reverse_copy(first, last, out); }; template concept HasReverseCopyR = requires(Range range, Out out) { std::ranges::reverse_copy(range, out); }; static_assert(HasReverseCopyIt); static_assert(!HasReverseCopyIt); static_assert(!HasReverseCopyIt); static_assert(!HasReverseCopyIt); static_assert(!HasReverseCopyIt); static_assert(!HasReverseCopyIt); static_assert(!HasReverseCopyIt); static_assert(HasReverseCopyR>); static_assert(!HasReverseCopyR); static_assert(!HasReverseCopyR); static_assert(!HasReverseCopyR>); static_assert(!HasReverseCopyR, OutputIteratorNotIndirectlyWritable>); static_assert(!HasReverseCopyR, OutputIteratorNotInputOrOutputIterator>); static_assert(std::is_same_v, std::ranges::in_out_result>); template constexpr void test(std::array value, std::array expected) { { std::array out; std::same_as> decltype(auto) ret = std::ranges::reverse_copy(Iter(value.data()), Sent(Iter(value.data() + value.size())), OutIter(out.data())); assert(base(ret.in) == value.data() + value.size()); assert(base(ret.out) == out.data() + out.size()); assert(out == expected); } { std::array out; auto range = std::ranges::subrange(Iter(value.data()), Sent(Iter(value.data() + value.size()))); std::same_as> decltype(auto) ret = std::ranges::reverse_copy(range, OutIter(out.data())); assert(base(ret.in) == value.data() + value.size()); assert(base(ret.out) == out.data() + out.size()); assert(out == expected); } } template constexpr void test_iterators() { // simple test test({1, 2, 3, 4}, {4, 3, 2, 1}); // check that an empty range works test({}, {}); // check that a single element range works test({1}, {1}); // check that a two element range works test({1, 2}, {2, 1}); } template constexpr void test_out_iterators() { test_iterators, Sent>(); test_iterators, Sent>(); test_iterators, Sent>(); test_iterators, Sent>(); test_iterators, Sent>(); test_iterators(); } constexpr bool test() { test_out_iterators>(); test_out_iterators>(); test_out_iterators>(); test_out_iterators(); test_out_iterators(); { struct AssignmentCounter { int* counter; constexpr AssignmentCounter(int* counter_) : counter(counter_) {} constexpr AssignmentCounter& operator=(const AssignmentCounter&) { ++*counter; return *this; } }; { int c = 0; AssignmentCounter a[] = {&c, &c, &c, &c}; AssignmentCounter b[] = {&c, &c, &c, &c}; std::ranges::reverse_copy(a, a + 4, b); assert(c == 4); } { int c = 0; AssignmentCounter a[] = {&c, &c, &c, &c}; AssignmentCounter b[] = {&c, &c, &c, &c}; std::ranges::reverse_copy(a, b); assert(c == 4); } } return true; } int main(int, char**) { test(); static_assert(test()); return 0; }