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
140
141
142
143
144
145
146
|
// Copyright (C) 2015 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/>.
// { dg-options "-std=gnu++14" }
#include <set>
#include <testsuite_hooks.h>
struct Cmp
{
typedef void is_transparent;
bool operator()(int i, long l) const { return i < l; }
bool operator()(long l, int i) const { return l < i; }
bool operator()(int i, int j) const { ++count; return i < j; }
static int count;
};
int Cmp::count = 0;
using test_type = std::multiset<int, Cmp>;
test_type x{ 1, 3, 3, 5 };
const test_type& cx = x;
void
test01()
{
Cmp::count = 0;
auto it = x.find(1L);
VERIFY( it != x.end() && *it == 1 );
it = x.find(2L);
VERIFY( it == x.end() );
auto cit = cx.find(3L);
VERIFY( cit != cx.end() && *cit == 3 );
cit = cx.find(2L);
VERIFY( cit == cx.end() );
VERIFY( Cmp::count == 0);
static_assert(std::is_same<decltype(it), test_type::iterator>::value,
"find returns iterator");
static_assert(std::is_same<decltype(cit), test_type::const_iterator>::value,
"const find returns const_iterator");
}
void
test02()
{
Cmp::count = 0;
auto n = x.count(1L);
VERIFY( n == 1 );
n = x.count(2L);
VERIFY( n == 0 );
auto cn = cx.count(3L);
VERIFY( cn == 2 );
cn = cx.count(2L);
VERIFY( cn == 0 );
VERIFY( Cmp::count == 0);
}
void
test03()
{
Cmp::count = 0;
auto it = x.lower_bound(1L);
VERIFY( it != x.end() && *it == 1 );
it = x.lower_bound(2L);
VERIFY( it != x.end() && *it == 3 );
auto cit = cx.lower_bound(1L);
VERIFY( cit != cx.end() && *cit == 1 );
cit = cx.lower_bound(2L);
VERIFY( cit != cx.end() && *cit == 3 );
VERIFY( Cmp::count == 0);
}
void
test04()
{
Cmp::count = 0;
auto it = x.upper_bound(1L);
VERIFY( it != x.end() && *it == 3 );
it = x.upper_bound(5L);
VERIFY( it == x.end() );
auto cit = cx.upper_bound(1L);
VERIFY( cit != cx.end() && *cit == 3 );
cit = cx.upper_bound(5L);
VERIFY( cit == cx.end() );
VERIFY( Cmp::count == 0);
}
void
test05()
{
Cmp::count = 0;
auto it = x.equal_range(1L);
VERIFY( it.first != it.second && *it.first == 1 );
it = x.equal_range(2L);
VERIFY( it.first == it.second && it.first != x.end() );
auto cit = cx.equal_range(3L);
VERIFY( cit.first != cit.second && *cit.first == 3 );
VERIFY( std::distance(cit.first, cit.second) == 2 );
cit = cx.equal_range(2L);
VERIFY( cit.first == cit.second && cit.first != cx.end() );
VERIFY( Cmp::count == 0);
}
int
main()
{
test01();
test02();
test03();
test04();
test05();
}
|
