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
|
// Copyright (C) 2016-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/>.
// { dg-do run { target c++17 } }
#include <set>
#include <algorithm>
#include <testsuite_hooks.h>
using test_type = std::multiset<int>;
void
test01()
{
test_type c{ 1, 1, 2, 2, 3, 3 };
test_type::node_type node;
test_type::iterator pos;
node = c.extract(0);
VERIFY( !node );
VERIFY( node.empty() );
VERIFY( c.size() == 6 );
pos = c.insert(std::move(node));
VERIFY( !node );
VERIFY( node.empty() );
VERIFY( c.size() == 6 );
VERIFY( pos == c.end() );
node = c.extract(1);
VERIFY( (bool)node );
VERIFY( !node.empty() );
VERIFY( c.size() == 5 );
VERIFY( node.get_allocator() == c.get_allocator() );
VERIFY( node.value() == 1 );
node.value() = 4;
VERIFY( node.value() == 4 );
pos = c.insert(std::move(node));
VERIFY( !node );
VERIFY( node.empty() );
VERIFY( c.size() == 6 );
VERIFY( pos != c.end() );
VERIFY( *pos == 4 );
VERIFY( c.count(1) == 1 );
VERIFY( c.count(4) == 1 );
VERIFY( std::is_sorted(c.begin(), c.end()) );
pos = c.insert(c.begin(), std::move(node));
VERIFY( !node );
VERIFY( node.empty() );
VERIFY( c.size() == 6 );
VERIFY( pos == c.end() );
node = c.extract(1);
pos = c.insert(c.begin(), std::move(node));
VERIFY( !node );
VERIFY( c.size() == 6 );
VERIFY( pos != c.end() );
VERIFY( *pos == 1 );
test_type c2 = c;
node = c2.extract(1);
pos = c.insert(std::move(node));
VERIFY( pos != c.end() );
VERIFY( node.empty() );
VERIFY( *pos == 1 );
}
void
test02()
{
test_type c{ 1, 1, 2, 2, 3, 3 };
test_type::node_type node;
test_type::iterator pos;
node = c.extract(c.begin());
VERIFY( !node.empty() );
VERIFY( c.size() == 5 );
VERIFY( node.get_allocator() == c.get_allocator() );
VERIFY( node.value() == 1 );
pos = c.insert(std::next(c.begin()), std::move(node));
VERIFY( node.empty() );
VERIFY( c.size() == 6 );
VERIFY( pos != c.end() );
VERIFY( *pos == 1 );
VERIFY( pos == std::next(c.begin()) );
}
void
test03()
{
struct less : std::less<int> { };
using std::is_same_v;
using compat_type1 = std::multiset<int, less>;
static_assert( is_same_v<test_type::node_type, compat_type1::node_type> );
using compat_type2 = std::set<int>;
static_assert( is_same_v<test_type::node_type, compat_type2::node_type> );
using compat_type3 = std::set<int, less>;
static_assert( is_same_v<test_type::node_type, compat_type3::node_type> );
}
int
main()
{
test01();
test02();
test03();
}
|
