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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
// { dg-options "-std=gnu++11" }
// Copyright (C) 2011-2015 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 <vector>
#include <limits>
#include <ext/throw_allocator.h>
#include <testsuite_hooks.h>
void test01()
{
bool test __attribute__((unused)) = true;
typedef std::numeric_limits<std::size_t> nl_size_t;
std::unordered_set<int, std::hash<int>, std::equal_to<int>,
__gnu_cxx::throw_allocator_limit<int> > us;
const int nb = 100;
int scheduled_throw_counter = 0;
std::size_t thrown_exceptions = 0;
for (int i = 0; i != nb; ++i)
{
if ((float)(us.size() + 1)
/ (float)us.bucket_count() >= us.max_load_factor())
{
// We are going to need a rehash, lets introduce allocation issues:
__gnu_cxx::limit_condition::set_limit(scheduled_throw_counter++);
}
try
{
VERIFY(us.insert(i).second);
scheduled_throw_counter = 0;
}
catch (const __gnu_cxx::forced_error&)
{
++thrown_exceptions;
--i;
}
VERIFY( us.load_factor() <= us.max_load_factor() );
__gnu_cxx::limit_condition::set_limit(nl_size_t::max());
}
VERIFY( thrown_exceptions != 0 );
// Check that all values have been inserted:
for (int i = 0; i != nb; ++i)
{
VERIFY( us.count(i) == 1 );
}
}
void test02()
{
bool test __attribute__((unused)) = true;
typedef std::numeric_limits<std::size_t> nl_size_t;
std::unordered_set<int, std::hash<int>, std::equal_to<int>,
__gnu_cxx::throw_allocator_limit<int> > us;
const int nb = 100;
int scheduled_throw_counter = 0;
std::size_t thrown_exceptions = 0;
for (int i = 0; i != nb; ++i)
{
if ((float)(us.size() + 2)
/ (float)us.bucket_count() >= us.max_load_factor())
{
// We are going to need a rehash, lets introduce allocation issues:
__gnu_cxx::limit_condition::set_limit(scheduled_throw_counter++);
}
try
{
std::vector<int> v = { i, i };
// Check the insert range robustness
us.insert(v.begin(), v.end());
scheduled_throw_counter = 0;
}
catch (const __gnu_cxx::forced_error&)
{
++thrown_exceptions;
--i;
}
VERIFY( us.load_factor() <= us.max_load_factor() );
__gnu_cxx::limit_condition::set_limit(nl_size_t::max());
}
VERIFY( thrown_exceptions != 0 );
// Check that all values have been inserted:
for (int i = 0; i != nb; ++i)
{
VERIFY( us.count(i) == 1 );
}
}
int main()
{
test01();
test02();
return 0;
}
|
