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

   1 // Copyright (C) 2005-2022 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.5.3 [lib.set.difference]
  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::input_iterator_wrapper;
  26 using __gnu_test::output_iterator_wrapper;
  27 using std::set_difference;
  28
  29 typedef test_container<int, input_iterator_wrapper> Icontainer;
  30 typedef test_container<int, output_iterator_wrapper> Ocontainer;
  31
  32 void
  33 test1()
  34 {
  35   int array1[1], array2[1];
  36   Icontainer con1(array1, array1);
  37   Icontainer con2(array1, array1);
  38   Ocontainer con3(array2, array2);
  39   VERIFY(set_difference(con1.begin(), con1.end(), con2.begin(), con2.end(),
  40          con3.begin()).ptr == array2);
  41 }
  42
  43 void
  44 test2()
  45 {
  46   int array1[] = {1};
  47   int array2[] = {0};
  48   Icontainer con1(array1, array1);
  49   Icontainer con2(array1, array1 + 1);
  50   Ocontainer con3(array2, array2);
  51   VERIFY(set_difference(con1.begin(), con1.end(), con2.begin(), con2.end(),
  52                           con3.begin()).ptr == array2);
  53 }
  54
  55 void
  56 test3()
  57 {
  58   int array1[] = {1};
  59   int array2[] = {0};
  60   Icontainer con1(array1, array1 + 1);
  61   Icontainer con2(array1, array1);
  62   Ocontainer con3(array2, array2 + 1);
  63   VERIFY(set_difference(con1.begin(), con1.end(), con2.begin(), con2.end(),
  64                           con3.begin()).ptr == array2 + 1);
  65 }
  66
  67 void
  68 test4()
  69 {
  70   int array1[]={0,1,1,2,4};
  71   int array2[]={1,2,3};
  72   int array3[6];
  73   Icontainer con1(array1, array1 + 5);
  74   Icontainer con2(array2, array2 + 3);
  75   Ocontainer con3(array3, array3 + 3);
  76   VERIFY(set_difference(con1.begin(), con1.end(), con2.begin(), con2.end(),
  77                           con3.begin()).ptr == array3 + 3);
  78   VERIFY(array3[0] == 0 && array3[1] == 1 && array3[2] == 4);
  79 }
  80
  81 struct S
  82 {
  83   int i;
  84   int j;
  85   S() {}
  86   S(int in)
  87   {
  88     if(in > 0)
  89     {
  90       i = in;
  91       j = 1;
  92     }
  93     else
  94     {
  95       i = -in;
  96       j = 0;
  97     }
  98   }
  99 };
 100
 101 bool
 102 operator<(const S& s1, const S& s2)
 103 { return s1.i < s2.i; }
 104
 105 typedef test_container<S, input_iterator_wrapper> SIcontainer;
 106 typedef test_container<S, output_iterator_wrapper> SOcontainer;
 107
 108 void
 109 test5()
 110 {
 111   S array1[] = { -1, -1, -1, -2, -2, -3, -4};
 112   S array2[] = { 1, 1, 1, 1, 2, 4, 4};
 113   S array3[9];
 114   SIcontainer con1(array1, array1 + 7);
 115   SIcontainer con2(array2, array2 + 7);
 116   SOcontainer con3(array3, array3 + 2);
 117   VERIFY(set_difference(con1.begin(), con1.end(), con2.begin(), con2.end(),
 118                    con3.begin()).ptr == array3 + 2);
 119   for(int i = 0; i < 2; ++i)
 120     VERIFY(array3[i].j == 0);
 121 }
 122
 123 int main()
 124 {
 125   test1();
 126   test2();
 127   test3();
 128   test4();
 129   test5();
 130 }
 131