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

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