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

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