//===----------------------------------------------------------------------===// // // 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 && !stdlib=libc++ // ADDITIONAL_COMPILE_FLAGS(has-fconstexpr-steps): -fconstexpr-steps=2000000 // // template // requires OutputIterator::type> // OutIter // move(InIter first, InIter last, OutIter result); #include #include #include #include #include "MoveOnly.h" #include "test_iterators.h" #include "test_macros.h" class PaddedBase { public: TEST_CONSTEXPR PaddedBase(std::int16_t a, std::int8_t b) : a_(a), b_(b) {} std::int16_t a_; std::int8_t b_; }; class Derived : public PaddedBase { public: TEST_CONSTEXPR Derived(std::int16_t a, std::int8_t b, std::int8_t c) : PaddedBase(a, b), c_(c) {} std::int8_t c_; }; template struct Test { template TEST_CONSTEXPR_CXX20 void operator()() { const unsigned N = 1000; int ia[N] = {}; for (unsigned i = 0; i < N; ++i) ia[i] = i; int ib[N] = {0}; OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib)); assert(base(r) == ib+N); for (unsigned i = 0; i < N; ++i) assert(ia[i] == ib[i]); } }; struct TestOutIters { template TEST_CONSTEXPR_CXX20 void operator()() { types::for_each( types::concatenate_t, types::type_list > >(), Test()); } }; template struct Test1 { template TEST_CONSTEXPR_CXX23 void operator()() { const unsigned N = 100; std::unique_ptr ia[N]; for (unsigned i = 0; i < N; ++i) ia[i].reset(new int(i)); std::unique_ptr ib[N]; OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib)); assert(base(r) == ib+N); for (unsigned i = 0; i < N; ++i) assert(*ib[i] == static_cast(i)); } }; struct Test1OutIters { template TEST_CONSTEXPR_CXX23 void operator()() { types::for_each(types::concatenate_t*>, types::type_list*> > >(), Test1()); } }; TEST_CONSTEXPR_CXX20 bool test() { types::for_each(types::cpp17_input_iterator_list(), TestOutIters()); if (TEST_STD_AT_LEAST_23_OR_RUNTIME_EVALUATED) types::for_each(types::cpp17_input_iterator_list*>(), Test1OutIters()); { // Make sure that padding bits aren't copied Derived src(1, 2, 3); Derived dst(4, 5, 6); std::move(static_cast(&src), static_cast(&src) + 1, static_cast(&dst)); assert(dst.a_ == 1); assert(dst.b_ == 2); assert(dst.c_ == 6); } { // Make sure that overlapping ranges can be copied int a[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; std::move(a + 3, a + 10, a); int expected[] = {4, 5, 6, 7, 8, 9, 10, 8, 9, 10}; assert(std::equal(a, a + 10, expected)); } // Make sure that the algorithm works with move-only types { // When non-trivial { MoveOnly from[3] = {1, 2, 3}; MoveOnly to[3] = {}; std::move(std::begin(from), std::end(from), std::begin(to)); assert(to[0] == MoveOnly(1)); assert(to[1] == MoveOnly(2)); assert(to[2] == MoveOnly(3)); } // When trivial { TrivialMoveOnly from[3] = {1, 2, 3}; TrivialMoveOnly to[3] = {}; std::move(std::begin(from), std::end(from), std::begin(to)); assert(to[0] == TrivialMoveOnly(1)); assert(to[1] == TrivialMoveOnly(2)); assert(to[2] == TrivialMoveOnly(3)); } } return true; } int main(int, char**) { test(); #if TEST_STD_VER >= 20 static_assert(test()); #endif return 0; }