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
|
// Copyright (C) 2011-2017 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++11 } }
#include <unordered_set>
#include <testsuite_hooks.h>
template<typename _USet>
void test()
{
{
_USet us;
for (int i = 0; i != 100000; ++i)
{
us.insert(i);
VERIFY( us.load_factor() <= us.max_load_factor() );
}
}
{
_USet us;
us.max_load_factor(3.f);
for (int i = 0; i != 100000; ++i)
{
us.insert(i);
VERIFY( us.load_factor() <= us.max_load_factor() );
}
}
{
_USet us;
us.max_load_factor(.3f);
for (int i = 0; i != 100000; ++i)
{
us.insert(i);
VERIFY( us.load_factor() <= us.max_load_factor() );
}
}
}
template<typename _Value>
using unordered_set_power2_rehash =
std::_Hashtable<_Value, _Value, std::allocator<_Value>,
std::__detail::_Identity,
std::equal_to<_Value>,
std::hash<_Value>,
std::__detail::_Mask_range_hashing,
std::__detail::_Default_ranged_hash,
std::__detail::_Power2_rehash_policy,
std::__detail::_Hashtable_traits<false, true, true>>;
int main()
{
test<std::unordered_set<int>>();
test<unordered_set_power2_rehash<int>>();
return 0;
}
|
