blob: 2a674c6980d984000d5356f9135c2fff5f4bbee8 (
plain)
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
|
// { dg-do run { target c++11 } }
// Copyright (C) 2012-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/>.
#include <unordered_set>
#include <testsuite_hooks.h>
void test01()
{
const int N = 1000;
typedef std::unordered_set<int> Set;
Set s;
s.reserve(N);
std::size_t bkts = s.bucket_count();
for (int i = 0; i != N; ++i)
{
s.insert(i);
// As long as we insert less than the reserved number of elements we
// shouldn't experiment any rehash.
VERIFY( s.bucket_count() == bkts );
}
}
void test02()
{
const int N = 1000;
typedef std::unordered_set<int> Set;
Set s;
s.reserve(N);
s.reserve(N);
std::size_t bkts = s.bucket_count();
for (int i = 0; i != N; ++i)
{
s.insert(i);
// As long as we insert less than the reserved number of elements we
// shouldn't experiment any rehash.
VERIFY( s.bucket_count() == bkts );
}
}
int main()
{
test01();
test02();
return 0;
}
|
