]>
Commit | Line | Data |
---|---|---|
52066eae | 1 | // { dg-do run { target c++11 } } |
2514d7f1 | 2 | |
a945c346 | 3 | // Copyright (C) 2012-2024 Free Software Foundation, Inc. |
2514d7f1 FD |
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_set> | |
21 | #include <testsuite_hooks.h> | |
22 | ||
2514d7f1 FD |
23 | void test01() |
24 | { | |
25 | const int N = 1000; | |
26 | ||
27 | typedef std::unordered_multiset<int> MSet; | |
28 | MSet s; | |
29 | s.reserve(N * 2); | |
30 | ||
31 | std::size_t bkts = s.bucket_count(); | |
32 | for (int i = 0; i != N; ++i) | |
33 | { | |
34 | s.insert(i); | |
35 | s.insert(i); | |
36 | // As long as we insert less than the reserved number of elements we | |
37 | // shouldn't experiment any rehash. | |
38 | VERIFY( s.bucket_count() == bkts ); | |
39 | } | |
40 | } | |
41 | ||
42 | int main() | |
43 | { | |
44 | test01(); | |
45 | return 0; | |
46 | } |