]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/23_containers/unordered_set/hash_policy/rehash.cc
1 // Copyright (C) 2011-2013 Free Software Foundation, Inc.
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)
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.
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/>.
18 // { dg-options "-std=gnu++0x" }
20 #include <unordered_set>
21 #include <testsuite_hooks.h>
25 bool test
__attribute__((unused
)) = true;
26 std::unordered_set
<int> us
;
27 typedef typename
std::unordered_set
<int>::size_type size_type
;
28 bool rehashed
= false;
29 for (int i
= 0; i
!= 100000; ++i
)
31 size_type bkt_count
= us
.bucket_count();
33 if (bkt_count
!= us
.bucket_count())
35 // Container has been rehashed, lets check that it won't be rehash again
36 // if we remove and restore the last 2 inserted elements:
38 bkt_count
= us
.bucket_count();
39 VERIFY( us
.erase(i
) == 1 );
40 VERIFY( bkt_count
== us
.bucket_count() );
43 VERIFY( us
.erase(i
- 1) == 1 );
44 VERIFY( bkt_count
== us
.bucket_count() );
46 VERIFY( us
.insert(i
- 1).second
);
47 VERIFY( bkt_count
== us
.bucket_count() );
49 VERIFY( us
.insert(i
).second
);
50 VERIFY( bkt_count
== us
.bucket_count() );
54 // At lest we check a rehash once: