1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
// Copyright (C) 2005-2022 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// 25.3.4 [lib.alg.merge]
#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
#include <testsuite_new_operators.h>
using __gnu_test::test_container;
using __gnu_test::bidirectional_iterator_wrapper;
using std::inplace_merge;
typedef test_container<int, bidirectional_iterator_wrapper> container;
void
test1()
{
int array[] = { 1 };
container con1(array, array);
inplace_merge(con1.begin(), con1.end(), con1.end());
container con2(array, array + 1);
inplace_merge(con2.begin(), con2.end(), con2.end());
inplace_merge(con2.begin(), con2.begin(), con2.end());
}
void
test2()
{
int array[] = { 0, 2, 4, 1, 3, 5 };
container con(array, array + 6);
inplace_merge(con.begin(), con.it(3), con.end());
VERIFY( array[0] == 0 && array[1] == 1 && array[2] == 2
&& array[3] == 3 && array[4] == 4 && array[5] == 5 );
}
struct S
{
int a;
int b;
S(int _a, int _b) : a(_a), b(_b) { }
S() { }
bool
operator<(const S& _s) const
{ return a < _s.a; }
};
void
test3()
{
S s[8];
s[0].a = 0;
s[1].a = 1;
s[2].a = 2;
s[3].a = 3;
s[4].a = 0;
s[5].a = 1;
s[6].a = 2;
s[7].a = 3;
s[0].b = 0;
s[1].b = 1;
s[2].b = 2;
s[3].b = 3;
s[4].b = 4;
s[5].b = 5;
s[6].b = 6;
s[7].b = 7;
inplace_merge(s, s + 4, s + 8);
VERIFY( s[0].b == 0 && s[1].b == 4 && s[2].b == 1 && s[3].b == 5 );
}
void
test4()
{
S s[8];
for (int pivot_idx = 0; pivot_idx < 8; ++pivot_idx)
{
int bval = 0;
for (int i = 0; i != pivot_idx; ++i)
{
s[i].a = i;
s[i].b = bval++;
}
for (int i = pivot_idx; i != 8; ++i)
{
s[i].a = i - pivot_idx;
s[i].b = bval++;
}
inplace_merge(s, s + pivot_idx, s + 8);
for (int i = 1; i < 8; ++i)
{
VERIFY( !(s[i] < s[i - 1]) );
if (s[i - 1].a == s[i].a)
VERIFY( s[i - 1].b < s[i].b );
}
}
}
int
main()
{
test1();
test2();
test3();
__gnu_test::set_new_limit(sizeof(S) * 4);
test3();
test4();
__gnu_test::set_new_limit(sizeof(S));
test3();
test4();
__gnu_test::set_new_limit(0);
test3();
test4();
return 0;
}
|
