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

   1 // Copyright (C) 2005 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 2, 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 COPYING.  If not, write to the Free
  16 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
  17 // USA.
  18
  19 // 25.3.4 [lib.alg.merge]
  20
  21 #include <algorithm>
  22 #include <testsuite_hooks.h>
  23 #include <testsuite_iterators.h>
  24
  25 using __gnu_test::test_container;
  26 using __gnu_test::bidirectional_iterator_wrapper;
  27 using std::inplace_merge;
  28
  29 typedef test_container<int, bidirectional_iterator_wrapper> container;
  30
  31
  32 void
  33 test1()
  34 {
  35   int array[]={1};
  36   container con1(array, array);
  37   inplace_merge(con1.begin(), con1.end(), con1.end());
  38   container con2(array, array + 1);
  39   inplace_merge(con2.begin(), con2.end(), con2.end());
  40   inplace_merge(con2.begin(), con2.begin(), con2.end());
  41 }
  42
  43 void
  44 test2()
  45 {
  46   int array[]={0,2,4,1,3,5};
  47   container con(array, array + 6);
  48   inplace_merge(con.begin(), con.it(3), con.end());
  49   VERIFY(array[0] == 0 && array[1] == 1 && array[2] == 2 &&
  50          array[3] == 3 && array[4] == 4 && array[5] == 5);
  51 }
  52
  53 struct S
  54 {
  55   int a;
  56   int b;
  57   S(int _a, int _b) : a(_a), b(_b) { }
  58   S() { }
  59   bool
  60   operator<(const S& _s) const
  61   { return _s.a < a; }
  62 };
  63
  64 void
  65 test3()
  66 {
  67   S s[4];
  68   s[0].a = 0;
  69   s[1].a = 1;
  70   s[2].a = 0;
  71   s[3].a = 1;
  72   s[0].b = 0;
  73   s[1].b = 0;
  74   s[2].b = 1;
  75   s[3].b = 1;
  76   inplace_merge(s, s + 2, s + 4);
  77   VERIFY(s[0].b == 0 && s[1].b == 1 && s[2].b == 0 && s[3].b == 1);
  78 }
  79
  80 int
  81 main()
  82 {
  83   test1();
  84 }