libstdc++-v3/testsuite/25_algorithms/move_backward/1.cc

   1 // { dg-do run { target c++11 } }
   2
   3 // Copyright (C) 2007-2025 Free Software Foundation, Inc.
   4 //
   5 // This file is part of the GNU ISO C++ Library.  This library is free
   6 // software; you can redistribute it and/or modify it under the
   7 // terms of the GNU General Public License as published by the
   8 // Free Software Foundation; either version 3, or (at your option)
   9 // any later version.
  10
  11 // This library is distributed in the hope that it will be useful,
  12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 // GNU General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License along
  17 // with this library; see the file COPYING3.  If not see
  18 // <http://www.gnu.org/licenses/>.
  19
  20 #undef _GLIBCXX_CONCEPT_CHECKS
  21
  22 #include <algorithm>
  23 #include <testsuite_hooks.h>
  24 #include <testsuite_iterators.h>
  25 #include <testsuite_rvalref.h>
  26
  27 using __gnu_test::test_container;
  28 using __gnu_test::bidirectional_iterator_wrapper;
  29 using __gnu_test::rvalstruct;
  30 using std::move_backward;
  31
  32 typedef test_container<rvalstruct,
  33                        bidirectional_iterator_wrapper> container_in;
  34 typedef test_container<rvalstruct,
  35                        bidirectional_iterator_wrapper> container_out;
  36
  37 void test01()
  38 {
  39   int inarray[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
  40   const int size = sizeof(inarray) / sizeof(int);
  41
  42   rvalstruct in[size], out[size];
  43   std::copy(inarray, inarray + size, in);
  44   std::fill(out, out + size, 0);
  45
  46   container_in incon(in, in + size);
  47   container_out outcon(out, out + size);
  48
  49   move_backward(incon.begin(), incon.end(), outcon.end());
  50   VERIFY( std::equal(out, out + size, inarray) );
  51   for (int z = 0; z < size; ++z)
  52     VERIFY( out[z].valid );
  53   for (int z = 0; z < size; ++z)
  54     VERIFY( !in[z].valid );
  55 }
  56
  57
  58 int main()
  59 {
  60   test01();
  61   return 0;
  62 }