1 // Copyright (C) 2016-2022 Free Software Foundation, Inc.
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)
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.
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/>.
18 // { dg-do run { target c++11 } }
20 #include <unordered_set>
22 #include <testsuite_hooks.h>
24 template<typename _USet
>
26 test(_USet
& us
, int threshold
)
28 auto nb_reserved
= us
.bucket_count();
29 us
.reserve(nb_reserved
);
30 auto bkts
= us
.bucket_count();
31 for (int nb_insert
= 1; nb_insert
<= threshold
; ++nb_insert
)
33 if (nb_insert
> nb_reserved
)
36 us
.reserve(nb_reserved
);
37 bkts
= us
.bucket_count();
42 VERIFY( us
.bucket_count() == bkts
);
46 template<typename _Value
>
47 using unordered_set_power2_rehash
=
48 std::_Hashtable
<_Value
, _Value
, std::allocator
<_Value
>,
49 std::__detail::_Identity
,
50 std::equal_to
<_Value
>,
52 std::__detail::_Mask_range_hashing
,
53 std::__detail::_Default_ranged_hash
,
54 std::__detail::_Power2_rehash_policy
,
55 std::__detail::_Hashtable_traits
<false, true, true>>;
57 template<typename _USet
>
72 test_cont
<std::unordered_set
<int>>();
73 test_cont
<unordered_set_power2_rehash
<int>>();