blob: e158d63a933c796de2a83fc43dadfcdef272c081 (
plain)
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
|
// { dg-options "-std=gnu++0x" }
// Copyright (C) 2011-2013 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 <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;
int val = 0;
for (; val != 100; ++val)
{
VERIFY( us.insert(val).second) ;
VERIFY( us.load_factor() <= us.max_load_factor() );
}
float cur_max_load_factor = us.max_load_factor();
int counter = 0;
std::size_t thrown_exceptions = 0;
while (true)
{
__gnu_cxx::limit_condition::set_limit(counter++);
bool do_break = false;
try
{
us.max_load_factor(.5f);
do_break = true;
}
catch (const __gnu_cxx::forced_error&)
{
VERIFY( us.max_load_factor() == cur_max_load_factor );
++thrown_exceptions;
}
// Lets check that unordered_set will still be correctly resized
// when needed
__gnu_cxx::limit_condition::set_limit(nl_size_t::max());
for (;;)
{
VERIFY( us.load_factor() <= us.max_load_factor() );
size_t nbkts = us.bucket_count();
VERIFY( us.insert(val++).second );
if (us.bucket_count() != nbkts)
break;
}
if (do_break)
break;
}
VERIFY( thrown_exceptions > 0 );
}
int main()
{
test01();
return 0;
}
|
