blob: 7b828930a0af73dbff07468aeb7837453f72060f (
plain)
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
|
// 2006-11-25 Paolo Carlini <pcarlini@suse.de>
// Copyright (C) 2006, 2007, 2009 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/>.
//
#include <set>
#include <testsuite_hooks.h>
// A few tests for equal_range, in the occasion of libstdc++/29385.
void test01()
{
bool test __attribute__((unused)) = true;
using namespace std;
set<int> s0;
typedef set<int>::iterator iterator;
typedef pair<iterator, bool> insert_return_type;
pair<iterator, iterator> pp0;
pp0 = s0.equal_range(1);
VERIFY( s0.count(1) == 0 );
VERIFY( pp0.first == s0.end() );
VERIFY( pp0.second == s0.end() );
insert_return_type irt0 = s0.insert(1);
insert_return_type irt1 = s0.insert(2);
insert_return_type irt2 = s0.insert(3);
pp0 = s0.equal_range(2);
VERIFY( s0.count(2) == 1 );
VERIFY( *pp0.first == 2 );
VERIFY( *pp0.second == 3 );
VERIFY( pp0.first == irt1.first );
VERIFY( --pp0.first == irt0.first );
VERIFY( pp0.second == irt2.first );
s0.insert(3);
insert_return_type irt3 = s0.insert(3);
insert_return_type irt4 = s0.insert(4);
pp0 = s0.equal_range(3);
VERIFY( s0.count(3) == 1 );
VERIFY( *pp0.first == 3 );
VERIFY( *pp0.second == 4 );
VERIFY( pp0.first == irt2.first );
VERIFY( --pp0.first == irt1.first );
VERIFY( pp0.second == irt4.first );
insert_return_type irt5 = s0.insert(0);
s0.insert(1);
s0.insert(1);
s0.insert(1);
pp0 = s0.equal_range(1);
VERIFY( s0.count(1) == 1 );
VERIFY( *pp0.first == 1 );
VERIFY( *pp0.second == 2 );
VERIFY( pp0.first == irt0.first );
VERIFY( --pp0.first == irt5.first );
VERIFY( pp0.second == irt1.first );
insert_return_type irt6 = s0.insert(5);
s0.insert(5);
s0.insert(5);
pp0 = s0.equal_range(5);
VERIFY( s0.count(5) == 1 );
VERIFY( *pp0.first == 5 );
VERIFY( pp0.first == irt6.first );
VERIFY( --pp0.first == irt4.first );
VERIFY( pp0.second == s0.end() );
s0.insert(4);
s0.insert(4);
s0.insert(4);
pp0 = s0.equal_range(4);
VERIFY( s0.count(4) == 1 );
VERIFY( *pp0.first == 4 );
VERIFY( *pp0.second == 5 );
VERIFY( pp0.first == irt4.first );
VERIFY( --pp0.first == irt3.first );
VERIFY( pp0.second == irt6.first );
s0.insert(0);
insert_return_type irt7 = s0.insert(0);
s0.insert(1);
pp0 = s0.equal_range(0);
VERIFY( s0.count(0) == 1 );
VERIFY( *pp0.first == 0 );
VERIFY( *pp0.second == 1 );
VERIFY( pp0.first == irt5.first );
VERIFY( pp0.first == s0.begin() );
VERIFY( pp0.second == irt0.first );
pp0 = s0.equal_range(1);
VERIFY( s0.count(1) == 1 );
VERIFY( *pp0.first == 1 );
VERIFY( *pp0.second == 2 );
VERIFY( pp0.first == irt0.first );
VERIFY( --pp0.first == irt7.first );
VERIFY( pp0.second == irt1.first );
}
int
main()
{
test01();
return 0;
}
|
