old-autovect-branch/libstdc++-v3/testsuite/25_algorithms/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, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  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::input_iterator_wrapper;
  27 using __gnu_test::output_iterator_wrapper;
  28 using std::merge;
  29
  30 typedef test_container<int, input_iterator_wrapper> Icontainer;
  31 typedef test_container<int, output_iterator_wrapper> Ocontainer;
  32
  33 void
  34 test1()
  35 {
  36   int array1[1], array2[1];
  37   Icontainer con1(array1, array1);
  38   Icontainer con2(array1, array1);
  39   Ocontainer con3(array2, array2);
  40   VERIFY(merge(con1.begin(), con1.end(), con2.begin(), con2.end(),
  41                con3.begin()).ptr == array2);
  42 }
  43
  44 void
  45 test2()
  46 {
  47   int array1[]={0,1,4};
  48   int array2[]={2,3};
  49   int array3[5];
  50   Icontainer con1(array1, array1 + 3);
  51   Icontainer con2(array2, array2 + 2);
  52   Ocontainer con3(array3, array3 + 5);
  53   VERIFY(merge(con1.begin(), con1.end(), con2.begin(), con2.end(),
  54                con3.begin()).ptr == array3 + 5);
  55   VERIFY(array3[0] == 0 && array3[1] == 1 && array3[2] == 2 &&
  56          array3[3] == 3 && array3[4] == 4);
  57
  58 }
  59
  60 struct S
  61 {
  62   int i;
  63   int j;
  64   S() {}
  65   S(int in)
  66   {
  67     if(in > 0)
  68     {
  69       i = in;
  70       j = 1;
  71     }
  72     else
  73     {
  74       i = -in;
  75       j = 0;
  76     }
  77   }
  78 };
  79
  80 bool
  81 operator<(const S& s1, const S& s2)
  82 { return s1.i < s2.i; }
  83
  84 void
  85 test3()
  86 {
  87   S array1[] = { -1 , -3};
  88   S array2[] = { 1, 2, 3};
  89   S array3[5];
  90   merge(array1, array1 + 2, array2, array2 + 3, array3);
  91   VERIFY(array3[0].j == 0 && array3[1].j == 1 && array3[2].j == 1 &&
  92          array3[3].j == 0 && array3[4].j == 1);
  93 }
  94
  95 int
  96 main()
  97 {
  98   test1();
  99   test2();
 100   test3();
 101 }