//===----------------------------------------------------------------------===// // // 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 // UNSUPPORTED: libcpp-has-no-incomplete-ranges // template S1, bidirectional_iterator I2> // requires indirectly_copyable // constexpr ranges::copy_backward_result // ranges::copy_backward(I1 first, S1 last, I2 result); // template // requires indirectly_copyable, I> // constexpr ranges::copy_backward_result, I> // ranges::copy_backward(R&& r, I result); #include #include #include #include #include "almost_satisfies_types.h" #include "test_iterators.h" template > concept HasCopyBackwardIt = requires(In in, Sent sent, Out out) { std::ranges::copy_backward(in, sent, out); }; static_assert(HasCopyBackwardIt); static_assert(!HasCopyBackwardIt); static_assert(!HasCopyBackwardIt); static_assert(!HasCopyBackwardIt); static_assert(!HasCopyBackwardIt); struct NotIndirectlyCopyable {}; static_assert(!HasCopyBackwardIt); static_assert(!HasCopyBackwardIt); static_assert(!HasCopyBackwardIt); template concept HasCopyBackwardR = requires(Range range, Out out) { std::ranges::copy_backward(range, out); }; static_assert(HasCopyBackwardR, int*>); static_assert(!HasCopyBackwardR); static_assert(!HasCopyBackwardR); static_assert(!HasCopyBackwardR); static_assert(!HasCopyBackwardR); static_assert(!HasCopyBackwardR, int*>); static_assert(!HasCopyBackwardR); static_assert(!HasCopyBackwardR); static_assert(std::is_same_v, std::ranges::in_out_result>); template constexpr void test_iterators() { { // simple test { std::array in {1, 2, 3, 4}; std::array out; std::same_as> auto ret = std::ranges::copy_backward(In(in.data()), Sent(In(in.data() + in.size())), Out(out.data() + out.size())); assert(in == out); assert(base(ret.in) == in.data() + in.size()); assert(base(ret.out) == out.data()); } { std::array in {1, 2, 3, 4}; std::array out; auto range = std::ranges::subrange(In(in.data()), Sent(In(in.data() + in.size()))); std::same_as> auto ret = std::ranges::copy_backward(range, Out(out.data() + out.size())); assert(in == out); assert(base(ret.in) == in.data() + in.size()); assert(base(ret.out) == out.data()); } } { // check that an empty range works { std::array in; std::array out; auto ret = std::ranges::copy_backward(In(in.data()), Sent(In(in.data() + in.size())), Out(out.data() + out.size())); assert(base(ret.in) == in.data() + in.size()); assert(base(ret.out) == out.data()); } { std::array in; std::array out; auto range = std::ranges::subrange(In(in.data()), Sent(In(in.data() + in.size()))); auto ret = std::ranges::copy_backward(range, Out(out.data())); assert(base(ret.in) == in.data() + in.size()); assert(base(ret.out) == out.data()); } } } template constexpr void test_sentinels() { test_iterators(); test_iterators>(); test_iterators>(); } template constexpr void test_in_iterators() { test_sentinels, Out>(); test_sentinels, Out>(); test_sentinels, Out>(); } template constexpr void test_proxy_in_iterators() { test_sentinels>, Out>(); test_sentinels>, Out>(); test_sentinels>, Out>(); } constexpr bool test() { test_in_iterators>(); test_in_iterators>(); test_in_iterators>(); test_proxy_in_iterators>>(); test_proxy_in_iterators>>(); test_proxy_in_iterators>>(); { // check that ranges::dangling is returned std::array out; std::same_as> auto ret = std::ranges::copy_backward(std::array {1, 2, 3, 4}, out.data() + out.size()); assert(ret.out == out.data()); assert((out == std::array{1, 2, 3, 4})); } { // check that an iterator is returned with a borrowing range std::array in {1, 2, 3, 4}; std::array out; std::same_as> auto ret = std::ranges::copy_backward(std::views::all(in), out.data() + out.size()); assert(ret.in == in.data() + in.size()); assert(ret.out == out.data()); assert(in == out); } { // check that every element is copied exactly once struct CopyOnce { bool copied = false; constexpr CopyOnce() = default; constexpr CopyOnce(const CopyOnce& other) = delete; constexpr CopyOnce& operator=(const CopyOnce& other) { assert(!other.copied); copied = true; return *this; } }; { std::array in {}; std::array out {}; auto ret = std::ranges::copy_backward(in.begin(), in.end(), out.end()); assert(ret.in == in.end()); assert(ret.out == out.begin()); assert(std::all_of(out.begin(), out.end(), [](const auto& e) { return e.copied; })); } { std::array in {}; std::array out {}; auto ret = std::ranges::copy_backward(in, out.end()); assert(ret.in == in.end()); assert(ret.out == out.begin()); assert(std::all_of(out.begin(), out.end(), [](const auto& e) { return e.copied; })); } } { // check that the range is copied backwards struct OnlyBackwardsCopyable { OnlyBackwardsCopyable* next = nullptr; bool canCopy = false; OnlyBackwardsCopyable() = default; constexpr OnlyBackwardsCopyable& operator=(const OnlyBackwardsCopyable&) { assert(canCopy); if (next != nullptr) next->canCopy = true; return *this; } }; { std::array in {}; std::array out {}; out[1].next = &out[0]; out[2].next = &out[1]; out[2].canCopy = true; auto ret = std::ranges::copy_backward(in, out.end()); assert(ret.in == in.end()); assert(ret.out == out.begin()); assert(out[0].canCopy); assert(out[1].canCopy); assert(out[2].canCopy); } { std::array in {}; std::array out {}; out[1].next = &out[0]; out[2].next = &out[1]; out[2].canCopy = true; auto ret = std::ranges::copy_backward(in.begin(), in.end(), out.end()); assert(ret.in == in.end()); assert(ret.out == out.begin()); assert(out[0].canCopy); assert(out[1].canCopy); assert(out[2].canCopy); } } return true; } int main(int, char**) { test(); static_assert(test()); return 0; }