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
|
// { dg-do run { target c++11 } }
// Copyright (C) 2012-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/>.
#include <unordered_map>
#include <testsuite_hooks.h>
void test01()
{
typedef std::unordered_map<int, int> Map;
Map m;
// Make sure max load factor is 1 so that reserved elements is directly
// the bucket count.
m.max_load_factor(1);
int i = -1;
for (;;)
{
m.reserve(m.bucket_count());
std::size_t bkts = m.bucket_count();
m.reserve(bkts);
VERIFY( m.bucket_count() == bkts );
for (++i; i < bkts; ++i)
{
m.insert(std::make_pair(i, i));
// As long as we insert less than the reserved number of elements we
// shouldn't experiment any rehash.
VERIFY( m.bucket_count() == bkts );
VERIFY( m.load_factor() <= m.max_load_factor() );
}
// One more element should rehash.
m.insert(std::make_pair(i, i));
VERIFY( m.bucket_count() != bkts );
VERIFY( m.load_factor() <= m.max_load_factor() );
if (i > 1024)
break;
}
}
int main()
{
test01();
return 0;
}
|
