1 // { dg-options "-std=gnu++0x" }
2 //
3 // Copyright (C) 2012-2013 Free Software Foundation, Inc.
4 //
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
9 // any later version.
10 //
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
15 //
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING3. If not see
18 // <http://www.gnu.org/licenses/>.
19
20 #include <unordered_map>
21 #include <vector>
22 #include <algorithm>
23 #include <testsuite_hooks.h>
24
test01()25 void test01()
26 {
27 using namespace std;
28 bool test __attribute__((unused)) = true;
29
30 unordered_multimap<int, int> mmap;
31 vector<int> values;
32
33 size_t nb_bkts = mmap.bucket_count();
34 int i = 0;
35 for (;; ++i)
36 {
37 mmap.insert(make_pair(0, i));
38 if (mmap.bucket_count() != nb_bkts)
39 // Container got rehash
40 break;
41 values.clear();
42 transform(mmap.begin(), mmap.end(), back_inserter(values),
43 [](const pair<int, int>& p) { return p.second; });
44 }
45
46 vector<int> rehash_values;
47 transform(mmap.begin(), mmap.end(), back_inserter(rehash_values),
48 [](const pair<int, int>& p) { return p.second; });
49 // Remove the value that result in a rehash
50 rehash_values.erase(remove(rehash_values.begin(), rehash_values.end(), i));
51
52 VERIFY( rehash_values == values );
53 }
54
main()55 int main()
56 {
57 test01();
58 return 0;
59 }
60