Merge reload-branch up to revision 101000
[official-gcc.git] / libstdc++-v3 / testsuite / 25_algorithms / set_symmetric_difference / 1.cc
blob932eb4f41cfc90cf894ce3d4b4f3ebac3cf89c77
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.
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.
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.
19 // 25.3.5.5 [lib.set.symmetric.difference]
21 #include <algorithm>
22 #include <testsuite_hooks.h>
23 #include <testsuite_iterators.h>
25 using __gnu_test::test_container;
26 using __gnu_test::input_iterator_wrapper;
27 using __gnu_test::output_iterator_wrapper;
28 using std::set_symmetric_difference;
30 typedef test_container<int, input_iterator_wrapper> Icontainer;
31 typedef test_container<int, output_iterator_wrapper> Ocontainer;
33 void
34 test1()
36 int array1[1], array2[1];
37 Icontainer con1(array1, array1);
38 Icontainer con2(array1, array1);
39 Ocontainer con3(array2, array2);
40 VERIFY(set_symmetric_difference(con1.begin(), con1.end(), con2.begin(),
41 con2.end(), con3.begin()).ptr == array2);
44 void
45 test2()
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_symmetric_difference(con1.begin(), con1.end(), con2.begin(),
53 con2.end(), con3.begin()).ptr == array2 + 1);
56 void
57 test3()
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_symmetric_difference(con1.begin(), con1.end(), con2.begin(),
65 con2.end(), con3.begin()).ptr == array2 + 1);
68 void
69 test4()
71 int array1[]={0,1,1,2,4};
72 int array2[]={1,2,2,3};
73 int array3[5];
74 Icontainer con1(array1, array1 + 5);
75 Icontainer con2(array2, array2 + 4);
76 Ocontainer con3(array3, array3 + 5);
77 VERIFY(set_symmetric_difference(con1.begin(), con1.end(), con2.begin(),
78 con2.end(), con3.begin()).ptr == array3 + 5);
79 VERIFY(array3[0] == 0 && array3[1] == 1 && array3[2] == 2 &&
80 array3[3] == 3 && array3[4] == 4);
83 struct S
85 int i;
86 int j;
87 S() {}
88 S(int in)
90 if(in > 0)
92 i = in;
93 j = 1;
95 else
97 i = -in;
98 j = 0;
103 bool
104 operator<(const S& s1, const S& s2)
105 { return s1.i < s2.i; }
107 typedef test_container<S, input_iterator_wrapper> SIcontainer;
108 typedef test_container<S, output_iterator_wrapper> SOcontainer;
110 void
111 test5()
113 S array1[] = { -1, -1, -2, -2, -4, -5};
114 S array2[] = { 1, 1, 1, 2, 3, 4};
115 S array3[4];
116 SIcontainer con1(array1, array1 + 6);
117 SIcontainer con2(array2, array2 + 6);
118 SOcontainer con3(array3, array3 + 4);
119 VERIFY(set_symmetric_difference(con1.begin(), con1.end(), con2.begin(),
120 con2.end(), con3.begin()).ptr == array3 + 4);
121 VERIFY(array3[0].j == 1 && array3[1].j == 0 && array3[2].j == 1 &&
122 array3[3].j == 0);
125 int
126 main()
128 test1();
129 test2();
130 test3();
131 test4();
132 test5();