]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/23_containers/unordered_set/insert/hash_policy.cc
1 // { dg-options "-std=gnu++11" }
3 // Copyright (C) 2011-2016 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING3. If not see
18 // <http://www.gnu.org/licenses/>.
20 #include <unordered_set>
23 #include <ext/throw_allocator.h>
24 #include <testsuite_hooks.h>
28 bool test
__attribute__((unused
)) = true;
30 typedef std::numeric_limits
<std::size_t> nl_size_t
;
31 std::unordered_set
<int, std::hash
<int>, std::equal_to
<int>,
32 __gnu_cxx::throw_allocator_limit
<int> > us
;
34 int scheduled_throw_counter
= 0;
35 std::size_t thrown_exceptions
= 0;
36 for (int i
= 0; i
!= nb
; ++i
)
38 if ((float)(us
.size() + 1)
39 / (float)us
.bucket_count() >= us
.max_load_factor())
41 // We are going to need a rehash, lets introduce allocation issues:
42 __gnu_cxx::limit_condition::set_limit(scheduled_throw_counter
++);
46 VERIFY(us
.insert(i
).second
);
47 scheduled_throw_counter
= 0;
49 catch (const __gnu_cxx::forced_error
&)
54 VERIFY( us
.load_factor() <= us
.max_load_factor() );
55 __gnu_cxx::limit_condition::set_limit(nl_size_t::max());
58 VERIFY( thrown_exceptions
!= 0 );
59 // Check that all values have been inserted:
60 for (int i
= 0; i
!= nb
; ++i
)
62 VERIFY( us
.count(i
) == 1 );
68 bool test
__attribute__((unused
)) = true;
70 typedef std::numeric_limits
<std::size_t> nl_size_t
;
71 std::unordered_set
<int, std::hash
<int>, std::equal_to
<int>,
72 __gnu_cxx::throw_allocator_limit
<int> > us
;
74 int scheduled_throw_counter
= 0;
75 std::size_t thrown_exceptions
= 0;
76 for (int i
= 0; i
!= nb
; ++i
)
78 if ((float)(us
.size() + 2)
79 / (float)us
.bucket_count() >= us
.max_load_factor())
81 // We are going to need a rehash, lets introduce allocation issues:
82 __gnu_cxx::limit_condition::set_limit(scheduled_throw_counter
++);
86 std::vector
<int> v
= { i
, i
};
87 // Check the insert range robustness
88 us
.insert(v
.begin(), v
.end());
89 scheduled_throw_counter
= 0;
91 catch (const __gnu_cxx::forced_error
&)
96 VERIFY( us
.load_factor() <= us
.max_load_factor() );
97 __gnu_cxx::limit_condition::set_limit(nl_size_t::max());
100 VERIFY( thrown_exceptions
!= 0 );
101 // Check that all values have been inserted:
102 for (int i
= 0; i
!= nb
; ++i
)
104 VERIFY( us
.count(i
) == 1 );