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
147
148
|
// Copyright (C) 2016 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++17" }
#include <unordered_map>
#include <testsuite_hooks.h>
using test_type = std::unordered_map<int, int>;
void
test01()
{
bool test __attribute__((unused)) = true;
test_type c{ {1, 10}, {2, 20}, {3, 30} };
test_type::node_type node;
test_type::insert_return_type ins;
test_type::iterator pos;
node = c.extract(0);
VERIFY( !node );
VERIFY( node.empty() );
VERIFY( c.size() == 3 );
ins = c.insert(std::move(node));
VERIFY( !node );
VERIFY( node.empty() );
VERIFY( c.size() == 3 );
VERIFY( !ins.inserted );
VERIFY( !ins.node );
VERIFY( ins.position == c.end() );
node = c.extract(1);
VERIFY( (bool)node );
VERIFY( !node.empty() );
VERIFY( c.size() == 2 );
VERIFY( node.get_allocator() == c.get_allocator() );
VERIFY( node.key() == 1 );
VERIFY( node.mapped() == 10 );
node.key() = 4;
node.mapped() = 40;
VERIFY( node.key() == 4 );
VERIFY( node.mapped() == 40 );
ins = c.insert(std::move(node));
VERIFY( !node );
VERIFY( node.empty() );
VERIFY( c.size() == 3 );
VERIFY( ins.inserted );
VERIFY( !ins.node );
VERIFY( ins.position != c.end() );
VERIFY( ins.position->first == 4 );
VERIFY( ins.position->second == 40 );
VERIFY( c.count(1) == 0 );
VERIFY( c.count(4) == 1 );
pos = c.insert(c.begin(), std::move(node));
VERIFY( !node );
VERIFY( node.empty() );
VERIFY( c.size() == 3 );
VERIFY( pos == c.end() );
pos = c.insert(c.begin(), c.extract(2));
VERIFY( c.size() == 3 );
VERIFY( pos != c.end() );
VERIFY( pos->first == 2 );
VERIFY( pos->second == 20 );
test_type c2 = c;
node = c2.extract(3);
ins = c.insert(std::move(node));
VERIFY( node.empty() );
VERIFY( ins.position != c.end() );
VERIFY( !ins.inserted );
VERIFY( !ins.node.empty() );
VERIFY( ins.node.key() == 3 );
VERIFY( ins.node.mapped() == 30 );
auto hasher = c.hash_function();
VERIFY( hasher(ins.position->first) == hasher(ins.node.key()) );
auto eq = c.key_eq();
VERIFY( eq(ins.position->first, ins.node.key()) );
}
void
test02()
{
bool test __attribute__((unused)) = true;
test_type c{ {1, 10}, {2, 20}, {3, 30} };
test_type::node_type node;
test_type::insert_return_type ins;
const int key = c.begin()->first;
node = c.extract(c.begin());
VERIFY( (bool)node );
VERIFY( !node.empty() );
VERIFY( c.size() == 2 );
VERIFY( node.get_allocator() == c.get_allocator() );
VERIFY( node.key() == key );
VERIFY( node.mapped() == (key * 10) );
ins = c.insert(std::move(node));
VERIFY( node.empty() );
VERIFY( c.size() == 3 );
VERIFY( ins.inserted );
VERIFY( !ins.node );
VERIFY( ins.position != c.end() );
VERIFY( ins.position->first == key );
VERIFY( ins.position->second == (key * 10) );
}
void
test03()
{
struct hash : std::hash<int> { };
struct equal : std::equal_to<int> { };
using std::is_same_v;
using compat_type1 = std::unordered_map<int, int, hash, equal>;
static_assert( is_same_v<test_type::node_type, compat_type1::node_type> );
using compat_type2 = std::unordered_multimap<int, int>;
static_assert( is_same_v<test_type::node_type, compat_type2::node_type> );
using compat_type3 = std::unordered_multimap<int, int, hash, equal>;
static_assert( is_same_v<test_type::node_type, compat_type3::node_type> );
}
int
main()
{
test01();
test02();
test03();
}
|
