1 // Copyright (C) 2011-2018 Free Software Foundation, Inc.
2 //
3 // This file is part of the GNU ISO C++ Library. This library is free
4 // software; you can redistribute it and/or modify it under the
5 // terms of the GNU General Public License as published by the
6 // Free Software Foundation; either version 3, or (at your option)
7 // any later version.
8 //
9 // This library is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 // GNU General Public License for more details.
13 //
14 // You should have received a copy of the GNU General Public License along
15 // with this library; see the file COPYING3. If not see
16 // <http://www.gnu.org/licenses/>.
17 //
18 // { dg-do run { target c++11 } }
19
20 #include <unordered_set>
21
22 #include <testsuite_hooks.h>
23
24 template<typename _USet>
test()25 void test()
26 {
27 {
28 _USet us;
29 for (int i = 0; i != 100000; ++i)
30 {
31 us.insert(i);
32 VERIFY( us.load_factor() <= us.max_load_factor() );
33 }
34 }
35 {
36 _USet us;
37 us.max_load_factor(3.f);
38 for (int i = 0; i != 100000; ++i)
39 {
40 us.insert(i);
41 VERIFY( us.load_factor() <= us.max_load_factor() );
42 }
43 }
44 {
45 _USet us;
46 us.max_load_factor(.3f);
47 for (int i = 0; i != 100000; ++i)
48 {
49 us.insert(i);
50 VERIFY( us.load_factor() <= us.max_load_factor() );
51 }
52 }
53 }
54
55 template<typename _Value>
56 using unordered_set_power2_rehash =
57 std::_Hashtable<_Value, _Value, std::allocator<_Value>,
58 std::__detail::_Identity,
59 std::equal_to<_Value>,
60 std::hash<_Value>,
61 std::__detail::_Mask_range_hashing,
62 std::__detail::_Default_ranged_hash,
63 std::__detail::_Power2_rehash_policy,
64 std::__detail::_Hashtable_traits<false, true, true>>;
65
main()66 int main()
67 {
68 test<std::unordered_set<int>>();
69 test<unordered_set_power2_rehash<int>>();
70 return 0;
71 }
72