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
|
// { dg-do run { target c++11 } }
//
// Copyright (C) 2012-2018 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 <unordered_set>
#include <vector>
#include <algorithm>
#include <testsuite_hooks.h>
namespace
{
struct pair_hash
{
std::size_t
operator()(const std::pair<int, int>& p) const noexcept
{ return std::hash<int>()(p.first); }
};
struct pair_equal_to
{
bool
operator()(const std::pair<int, int>& x,
const std::pair<int, int>& y) const noexcept
{ return x.first == y.first; }
};
}
void test01()
{
using namespace std;
unordered_multiset<pair<int, int>, pair_hash, pair_equal_to> mset;
vector<int> values;
size_t nb_bkts = mset.bucket_count();
int i = 0;
for (;; ++i)
{
mset.insert(make_pair(0, i));
if (mset.bucket_count() != nb_bkts)
// Container got rehash
break;
values.clear();
transform(mset.begin(), mset.end(), back_inserter(values),
[](const pair<int, int>& p) { return p.second; });
}
vector<int> rehash_values;
transform(mset.begin(), mset.end(), back_inserter(rehash_values),
[](const pair<int, int>& p) { return p.second; });
// Remove the value that result in a rehash
rehash_values.erase(remove(rehash_values.begin(), rehash_values.end(), i));
VERIFY( rehash_values == values );
}
int main()
{
test01();
return 0;
}
|
