1 // Copyright (C) 2005-2016 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.5 [lib.set.symmetric.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_symmetric_difference;
28
29 typedef test_container<int, input_iterator_wrapper> Icontainer;
30 typedef test_container<int, output_iterator_wrapper> Ocontainer;
31
32 void
test1()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_symmetric_difference(con1.begin(), con1.end(), con2.begin(),
40 con2.end(), con3.begin()).ptr == array2);
41 }
42
43 void
test2()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 + 1);
51 VERIFY(set_symmetric_difference(con1.begin(), con1.end(), con2.begin(),
52 con2.end(), con3.begin()).ptr == array2 + 1);
53 }
54
55 void
test3()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_symmetric_difference(con1.begin(), con1.end(), con2.begin(),
64 con2.end(), con3.begin()).ptr == array2 + 1);
65 }
66
67 void
test4()68 test4()
69 {
70 int array1[]={0,1,1,2,4};
71 int array2[]={1,2,2,3};
72 int array3[5];
73 Icontainer con1(array1, array1 + 5);
74 Icontainer con2(array2, array2 + 4);
75 Ocontainer con3(array3, array3 + 5);
76 VERIFY(set_symmetric_difference(con1.begin(), con1.end(), con2.begin(),
77 con2.end(), con3.begin()).ptr == array3 + 5);
78 VERIFY(array3[0] == 0 && array3[1] == 1 && array3[2] == 2 &&
79 array3[3] == 3 && array3[4] == 4);
80 }
81
82 struct S
83 {
84 int i;
85 int j;
SS86 S() {}
SS87 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
operator <(const S & s1,const S & s2)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
test5()110 test5()
111 {
112 S array1[] = { -1, -1, -2, -2, -4, -5};
113 S array2[] = { 1, 1, 1, 2, 3, 4};
114 S array3[4];
115 SIcontainer con1(array1, array1 + 6);
116 SIcontainer con2(array2, array2 + 6);
117 SOcontainer con3(array3, array3 + 4);
118 VERIFY(set_symmetric_difference(con1.begin(), con1.end(), con2.begin(),
119 con2.end(), con3.begin()).ptr == array3 + 4);
120 VERIFY(array3[0].j == 1 && array3[1].j == 0 && array3[2].j == 1 &&
121 array3[3].j == 0);
122 }
123
124 int
main()125 main()
126 {
127 test1();
128 test2();
129 test3();
130 test4();
131 test5();
132 }
133
134