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
|
// Copyright (C) 2016-2019 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 <algorithm>
#include <testsuite_hooks.h>
using test_type = std::unordered_multimap<int, int>;
struct hash {
auto operator()(int i) const noexcept { return ~std::hash<int>()(i); }
};
struct equal : std::equal_to<> { };
void
test01()
{
const test_type c0{ {1, 10}, {1, 11}, {2, 20}, {2, 21}, {3, 30}, {3, 31} };
test_type c1 = c0, c2 = c0;
c1.merge(c2);
for (auto& i : c1)
VERIFY( c1.count(i.first) == (2 * c0.count(i.first)) );
VERIFY( c2.empty() );
c1.clear();
c2 = c0;
c1.merge(std::move(c2));
VERIFY( c1 == c0 );
VERIFY( c2.empty() );
}
void
test02()
{
const test_type c0{ {1, 10}, {1, 11}, {2, 20}, {2, 21}, {3, 30}, {3, 31} };
test_type c1 = c0;
std::unordered_multimap<int, int, hash, equal> c2( c0.begin(), c0.end() );
c1.merge(c2);
VERIFY( c1.size() == (2 * c0.size()) );
for (auto& i : c1)
VERIFY( c1.count(i.first) == (2 * c0.count(i.first)) );
VERIFY( c2.empty() );
c1.clear();
c2.insert( c0.begin(), c0.end() );
c1.merge(std::move(c2));
VERIFY( c1 == c0 );
VERIFY( c2.empty() );
}
void
test03()
{
const test_type c0{ {1, 10}, {1, 11}, {2, 20}, {2, 21}, {3, 30}, {3, 31} };
test_type c1 = c0;
std::unordered_multimap<int, int, hash, equal> c2( c0.begin(), c0.end() );
c1.merge(c2);
VERIFY( c1.size() == (2 * c0.size()) );
for (auto& i : c1)
VERIFY( c1.count(i.first) == (2 * c0.count(i.first)) );
VERIFY( c2.empty() );
c1.clear();
c2.insert( c0.begin(), c0.end() );
c1.merge(std::move(c2));
VERIFY( c1 == c0 );
VERIFY( c2.empty() );
}
void
test04()
{
const test_type c0{ {1, 10}, {1, 11}, {2, 20}, {2, 21}, {3, 30}, {3, 31} };
test_type c1 = c0;
std::unordered_map<int, int, hash, equal> c2( c0.begin(), c0.end() );
c1.merge(c2);
VERIFY( c1.size() == (1.5 * c0.size()) );
for (auto& i : c1)
VERIFY( c1.count(i.first) == (1.5 * c0.count(i.first)) );
VERIFY( c2.empty() );
c1.clear();
c2.insert( c0.begin(), c0.end() );
c1.merge(std::move(c2));
VERIFY( c1.size() == (0.5 * c0.size()) );
VERIFY( c2.empty() );
}
int
main()
{
test01();
test02();
test03();
test04();
}
|
