blob: 9097451fa3cc9c54d6624c6cd4e9b45271dd48f2 (
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
|
// 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/>.
//
// { dg-options "-std=gnu++11" }
#include <unordered_set>
#include <testsuite_hooks.h>
void test01()
{
bool test __attribute__((unused)) = true;
{
std::unordered_set<int> us;
for (int i = 0; i != 100000; ++i)
{
us.insert(i);
VERIFY( us.load_factor() <= us.max_load_factor() );
}
}
{
std::unordered_set<int> us;
us.max_load_factor(3.f);
for (int i = 0; i != 100000; ++i)
{
us.insert(i);
VERIFY( us.load_factor() <= us.max_load_factor() );
}
}
{
std::unordered_set<int> us;
us.max_load_factor(.3f);
for (int i = 0; i != 100000; ++i)
{
us.insert(i);
VERIFY( us.load_factor() <= us.max_load_factor() );
}
}
}
int main()
{
test01();
return 0;
}
|
