1 // Copyright (C) 2005-2025 Free Software Foundation, Inc.
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)
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 COPYING3. If not see
16 // <http://www.gnu.org/licenses/>.
18 // 25.3.5.2 [lib.set.union]
21 #include <testsuite_hooks.h>
22 #include <testsuite_iterators.h>
24 using __gnu_test::test_container
;
25 using __gnu_test::input_iterator_wrapper
;
26 using __gnu_test::output_iterator_wrapper
;
29 typedef test_container
<int, input_iterator_wrapper
> Icontainer
;
30 typedef test_container
<int, output_iterator_wrapper
> Ocontainer
;
35 int array1
[1], array2
[1];
36 Icontainer
con1(array1
, array1
);
37 Icontainer
con2(array1
, array1
);
38 Ocontainer
con3(array2
, array2
);
39 VERIFY(set_union(con1
.begin(), con1
.end(), con2
.begin(), con2
.end(),
40 con3
.begin()).ptr
== array2
);
48 Icontainer
con1(array1
, array1
);
49 Icontainer
con2(array1
, array1
+ 1);
50 Ocontainer
con3(array2
, array2
+ 1);
51 VERIFY(set_union(con1
.begin(), con1
.end(), con2
.begin(), con2
.end(),
52 con3
.begin()).ptr
== array2
+ 1);
53 VERIFY(array2
[0] == 1);
61 Icontainer
con1(array1
, array1
+ 1);
62 Icontainer
con2(array1
, array1
);
63 Ocontainer
con3(array2
, array2
+ 1);
64 VERIFY(set_union(con1
.begin(), con1
.end(), con2
.begin(), con2
.end(),
65 con3
.begin()).ptr
== array2
+ 1);
66 VERIFY(array2
[0] == 1);
72 int array1
[]={0,1,1,2,4};
75 Icontainer
con1(array1
, array1
+ 5);
76 Icontainer
con2(array2
, array2
+ 3);
77 Ocontainer
con3(array3
, array3
+ 6);
78 VERIFY(set_union(con1
.begin(), con1
.end(), con2
.begin(), con2
.end(),
79 con3
.begin()).ptr
== array3
+ 6);
80 VERIFY(array3
[0] == 0 && array3
[1] == 1 && array3
[2] == 1 &&
81 array3
[3] == 2 && array3
[4] == 3 && array3
[5] == 4);
105 operator<(const S
& s1
, const S
& s2
)
106 { return s1
.i
< s2
.i
; }
108 typedef test_container
<S
, input_iterator_wrapper
> SIcontainer
;
109 typedef test_container
<S
, output_iterator_wrapper
> SOcontainer
;
114 S array1
[] = { -1, -1, -1, -2, -2, -4};
115 S array2
[] = { 1, 1, 1, 1, 2, 3, 4, 4};
117 SIcontainer
con1(array1
, array1
+ 6);
118 SIcontainer
con2(array2
, array2
+ 8);
119 SOcontainer
con3(array3
, array3
+ 9);
120 VERIFY(set_union(con1
.begin(), con1
.end(), con2
.begin(), con2
.end(),
121 con3
.begin()).ptr
== array3
+ 9);
122 VERIFY(array3
[0].j
== 0 && array3
[1].j
== 0 && array3
[2].j
== 0 &&
123 array3
[3].j
== 1 && array3
[4].j
== 0 && array3
[5].j
== 0 &&
124 array3
[6].j
== 1 && array3
[7].j
== 0 && array3
[8].j
== 1);