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