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

   1 // Copyright (C) 2005-2022 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.1.2 [lib.stable.sort]
  19
  20 // testsuite_new_operators.h requires malloc/free.
  21 // { dg-require-effective-target hosted }
  22
  23 #include <algorithm>
  24 #include <testsuite_new_operators.h>
  25 #include <testsuite_hooks.h>
  26 #include <testsuite_iterators.h>
  27
  28 using __gnu_test::test_container;
  29 using __gnu_test::random_access_iterator_wrapper;
  30 using std::stable_sort;
  31
  32 typedef test_container<int, random_access_iterator_wrapper> Container;
  33
  34 void
  35 test1()
  36 {
  37   int array[] = { 0 };
  38   Container con(array, array);
  39   stable_sort(con.begin(), con.end());
  40 }
  41
  42 void
  43 test2()
  44 {
  45   int array[] = { 6, 5, 4, 3, 2, 1, 0 };
  46   Container con(array, array + 7);
  47   stable_sort(con.begin(), con.end());
  48   VERIFY(array[0] == 0 && array[1] == 1 && array[2] == 2 &&
  49          array[3] == 3 && array[4] == 4 && array[5] == 5 &&
  50          array[6] == 6);
  51 }
  52
  53 struct S
  54 {
  55   int i;
  56   int j;
  57   S() {}
  58   S(int in)
  59   {
  60     if(in > 0)
  61     {
  62       i = in;
  63       j = 1;
  64     }
  65     else
  66     {
  67       i = -in;
  68       j = 0;
  69     }
  70   }
  71 };
  72
  73 bool
  74 operator<(const S& s1, const S& s2)
  75 { return s1.i < s2.i; }
  76
  77 void
  78 test3()
  79 {
  80   S array[] = { -1, -2, 1, 2, -3 ,-5 ,3 , -4, 5, 4 };
  81   test_container<S, random_access_iterator_wrapper> con(array,array + 10);
  82   stable_sort(con.begin(), con.end());
  83   for(int i = 0; i < 10; ++i)
  84     VERIFY(array[i].j == i % 2);
  85 }
  86
  87 int
  88 main()
  89 {
  90   test1();
  91   test2();
  92
  93   test3();
  94
  95   __gnu_test::set_new_limit(sizeof(S) * 5);
  96   test3();
  97
  98   __gnu_test::set_new_limit(sizeof(S));
  99   test3();
 100
 101   __gnu_test::set_new_limit(0);
 102   test3();
 103 }