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

   1 // Copyright (C) 2005-2025 Free Software Foundation, Inc.
   2 //
   3 // This file is part of the GNU ISO C++ Library.  This library is free
   4 // software; you can redistribute it and/or modify it under the
   5 // terms of the GNU General Public License as published by the
   6 // Free Software Foundation; either version 3, or (at your option)
   7 // any later version.
   8
   9 // This library is distributed in the hope that it will be useful,
  10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 // GNU General Public License for more details.
  13
  14 // You should have received a copy of the GNU General Public License along
  15 // with this library; see the file COPYING3.  If not see
  16 // <http://www.gnu.org/licenses/>.
  17
  18 // 25.3.4 [lib.alg.merge]
  19
  20 // <testsuite_new_operators.h> requires malloc/free.
  21 // { dg-require-effective-target hosted }
  22
  23 #include <algorithm>
  24 #include <testsuite_hooks.h>
  25 #include <testsuite_iterators.h>
  26 #include <testsuite_new_operators.h>
  27
  28 using __gnu_test::test_container;
  29 using __gnu_test::bidirectional_iterator_wrapper;
  30 using std::inplace_merge;
  31
  32 typedef test_container<int, bidirectional_iterator_wrapper> container;
  33
  34 void
  35 test1()
  36 {
  37   int array[] = { 1 };
  38   container con1(array, array);
  39   inplace_merge(con1.begin(), con1.end(), con1.end());
  40   container con2(array, array + 1);
  41   inplace_merge(con2.begin(), con2.end(), con2.end());
  42   inplace_merge(con2.begin(), con2.begin(), con2.end());
  43 }
  44
  45 void
  46 test2()
  47 {
  48   int array[] = { 0, 2, 4, 1, 3, 5 };
  49   container con(array, array + 6);
  50   inplace_merge(con.begin(), con.it(3), con.end());
  51   VERIFY( array[0] == 0 && array[1] == 1 && array[2] == 2
  52           && array[3] == 3 && array[4] == 4 && array[5] == 5 );
  53 }
  54
  55 struct S
  56 {
  57   int a;
  58   int b;
  59   S(int _a, int _b) : a(_a), b(_b) { }
  60   S() { }
  61   bool
  62   operator<(const S& _s) const
  63   { return a < _s.a; }
  64 };
  65
  66 void
  67 test3()
  68 {
  69   S s[8];
  70   s[0].a = 0;
  71   s[1].a = 1;
  72   s[2].a = 2;
  73   s[3].a = 3;
  74   s[4].a = 0;
  75   s[5].a = 1;
  76   s[6].a = 2;
  77   s[7].a = 3;
  78
  79   s[0].b = 0;
  80   s[1].b = 1;
  81   s[2].b = 2;
  82   s[3].b = 3;
  83   s[4].b = 4;
  84   s[5].b = 5;
  85   s[6].b = 6;
  86   s[7].b = 7;
  87
  88   inplace_merge(s, s + 4, s + 8);
  89   VERIFY( s[0].b == 0 && s[1].b == 4 && s[2].b == 1 && s[3].b == 5 );
  90 }
  91
  92 void
  93 test4()
  94 {
  95   S s[8];
  96   for (int pivot_idx = 0; pivot_idx < 8; ++pivot_idx)
  97     {
  98       int bval = 0;
  99       for (int i = 0; i != pivot_idx; ++i)
 100         {
 101           s[i].a = i;
 102           s[i].b = bval++;
 103         }
 104
 105       for (int i = pivot_idx; i != 8; ++i)
 106         {
 107           s[i].a = i - pivot_idx;
 108           s[i].b = bval++;
 109         }
 110
 111       inplace_merge(s, s + pivot_idx, s + 8);
 112
 113       for (int i = 1; i < 8; ++i)
 114         {
 115           VERIFY( !(s[i] < s[i - 1]) );
 116           if (s[i - 1].a == s[i].a)
 117             VERIFY( s[i - 1].b < s[i].b );
 118         }
 119     }
 120 }
 121
 122 int
 123 main()
 124 {
 125   test1();
 126   test2();
 127   test3();
 128
 129   __gnu_test::set_new_limit(sizeof(S) * 4);
 130   test3();
 131   test4();
 132
 133   __gnu_test::set_new_limit(sizeof(S));
 134   test3();
 135   test4();
 136
 137   __gnu_test::set_new_limit(0);
 138   test3();
 139   test4();
 140
 141   return 0;
 142 }