]>
Commit | Line | Data |
---|---|---|
1 | // Copyright (C) 2005-2014 Free Software Foundation, Inc. | |
2 | // | |
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) | |
7 | // any later version. | |
8 | // | |
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. | |
13 | // | |
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/>. | |
17 | ||
18 | // 6.3 Unordered associative containers | |
19 | ||
20 | #include <tr1/unordered_set> | |
21 | #include <testsuite_hooks.h> | |
22 | ||
23 | // libstdc++/23465 | |
24 | void test01() | |
25 | { | |
26 | bool test __attribute__((unused)) = true; | |
27 | ||
28 | for (float lf = 0.1; lf < 101.0; lf *= 10.0) | |
29 | for (int size = 1; size <= 6561; size *= 3) | |
30 | { | |
31 | std::tr1::unordered_set<int> us1, us2; | |
32 | typedef std::tr1::unordered_set<int>::local_iterator local_iterator; | |
33 | typedef std::tr1::unordered_set<int>::size_type size_type; | |
34 | ||
35 | us1.max_load_factor(lf); | |
36 | ||
37 | for (int i = 0; i < size; ++i) | |
38 | us1.insert(i); | |
39 | ||
40 | us2 = us1; | |
41 | ||
42 | VERIFY( us2.size() == us1.size() ); | |
43 | VERIFY( us2.bucket_count() == us1.bucket_count() ); | |
44 | ||
45 | for (size_type b = 0; b < us1.bucket_count(); ++b) | |
46 | { | |
47 | size_type cnt = 0; | |
48 | for (local_iterator it1 = us1.begin(b), it2 = us2.begin(b); | |
49 | it1 != us1.end(b) && it2 != us2.end(b); ++it1, ++it2) | |
50 | { | |
51 | VERIFY( *it1 == *it2 ); | |
52 | ++cnt; | |
53 | } | |
54 | VERIFY( cnt == us1.bucket_size(b) ); | |
55 | } | |
56 | } | |
57 | } | |
58 | ||
59 | int main() | |
60 | { | |
61 | test01(); | |
62 | return 0; | |
63 | } |