libstdc++-v3/testsuite/25_algorithms/inplace_merge/49559.cc

   1 // { dg-options "-std=gnu++11" }
   2
   3 // Copyright (C) 2011-2016 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 // XXX FIXME:  parallel-mode should deal correctly with moveable-only types
  23 // per C++0x, at minimum smoothly fall back to serial.
  24 #undef _GLIBCXX_PARALLEL
  25
  26 #include <algorithm>
  27 #include <testsuite_hooks.h>
  28 #include <testsuite_iterators.h>
  29 #include <testsuite_rvalref.h>
  30
  31 using __gnu_test::test_container;
  32 using __gnu_test::bidirectional_iterator_wrapper;
  33 using __gnu_test::rvalstruct;
  34
  35 typedef test_container<rvalstruct, bidirectional_iterator_wrapper> Container;
  36
  37 const int A[] = { 0, 1, 2, 3, 4, 5 };
  38 const int N = 6;
  39
  40 bool are_ordered(const rvalstruct& lhs, const rvalstruct& rhs)
  41 { return lhs < rhs; }
  42
  43 // libstdc++/49559
  44 void test01()
  45 {
  46   bool test __attribute__((unused)) = true;
  47
  48   rvalstruct s1[6];
  49   std::copy(A, A + N, s1);
  50   Container con1(s1, s1 + N);
  51   std::inplace_merge(con1.begin(), con1.it(4), con1.end());
  52   VERIFY( s1[0] == 0 && s1[1] == 1 && s1[2] == 2
  53           && s1[3] == 3 && s1[4] == 4 && s1[5] == 5 );
  54   VERIFY( s1[0].valid && s1[1].valid && s1[2].valid
  55           && s1[3].valid && s1[4].valid && s1[5].valid );
  56
  57   rvalstruct s2[6];
  58   std::copy(A, A + N, s2);
  59   Container con2(s2, s2 + N);
  60   std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered);
  61   VERIFY( s2[0] == 0 && s2[1] == 1 && s2[2] == 2
  62           && s2[3] == 3 && s2[4] == 4 && s2[5] == 5 );
  63   VERIFY( s2[0].valid && s2[1].valid && s2[2].valid
  64           && s2[3].valid && s2[4].valid && s2[5].valid );
  65 }
  66
  67 int
  68 main()
  69 {
  70   test01();
  71   return 0;
  72 }