libstdc++-v3/testsuite/25_algorithms/set_union/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.5.2 [lib.set.union]
  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::set_union;
  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(set_union(con1.begin(), con1.end(), con2.begin(), con2.end(),
  41                    con3.begin()).ptr == array2);
  42 }
  43
  44 void
  45 test2()
  46 {
  47   int array1[] = {1};
  48   int array2[] = {0};
  49   Icontainer con1(array1, array1);
  50   Icontainer con2(array1, array1 + 1);
  51   Ocontainer con3(array2, array2 + 1);
  52   VERIFY(set_union(con1.begin(), con1.end(), con2.begin(), con2.end(),
  53                    con3.begin()).ptr == array2 + 1);
  54   VERIFY(array2[0] == 1);
  55 }
  56
  57 void
  58 test3()
  59 {
  60   int array1[] = {1};
  61   int array2[] = {0};
  62   Icontainer con1(array1, array1 + 1);
  63   Icontainer con2(array1, array1);
  64   Ocontainer con3(array2, array2 + 1);
  65   VERIFY(set_union(con1.begin(), con1.end(), con2.begin(), con2.end(),
  66                    con3.begin()).ptr == array2 + 1);
  67   VERIFY(array2[0] == 1);
  68 }
  69
  70 void
  71 test4()
  72 {
  73   int array1[]={0,1,1,2,4};
  74   int array2[]={1,2,3};
  75   int array3[6];
  76   Icontainer con1(array1, array1 + 5);
  77   Icontainer con2(array2, array2 + 3);
  78   Ocontainer con3(array3, array3 + 6);
  79   VERIFY(set_union(con1.begin(), con1.end(), con2.begin(), con2.end(),
  80                con3.begin()).ptr == array3 + 6);
  81   VERIFY(array3[0] == 0 && array3[1] == 1 && array3[2] == 1 &&
  82          array3[3] == 2 && array3[4] == 3 && array3[5] == 4);
  83 }
  84
  85 struct S
  86 {
  87   int i;
  88   int j;
  89   S() {}
  90   S(int in)
  91   {
  92     if(in > 0)
  93     {
  94       i = in;
  95       j = 1;
  96     }
  97     else
  98     {
  99       i = -in;
 100       j = 0;
 101     }
 102   }
 103 };
 104
 105 bool
 106 operator<(const S& s1, const S& s2)
 107 { return s1.i < s2.i; }
 108
 109 typedef test_container<S, input_iterator_wrapper> SIcontainer;
 110 typedef test_container<S, output_iterator_wrapper> SOcontainer;
 111
 112 void
 113 test5()
 114 {
 115   S array1[] = { -1, -1, -1, -2, -2, -4};
 116   S array2[] = { 1, 1, 1, 1, 2, 3, 4, 4};
 117   S array3[9];
 118   SIcontainer con1(array1, array1 + 6);
 119   SIcontainer con2(array2, array2 + 8);
 120   SOcontainer con3(array3, array3 + 9);
 121   VERIFY(set_union(con1.begin(), con1.end(), con2.begin(), con2.end(),
 122                    con3.begin()).ptr == array3 + 9);
 123   VERIFY(array3[0].j == 0 && array3[1].j == 0 && array3[2].j == 0 &&
 124          array3[3].j == 1 && array3[4].j == 0 && array3[5].j == 0 &&
 125          array3[6].j == 1 && array3[7].j == 0 && array3[8].j == 1);
 126 }
 127
 128 int
 129 main()
 130 {
 131   test1();
 132   test2();
 133   test3();
 134   test4();
 135   test5();
 136 }
 137