]>
Commit | Line | Data |
---|---|---|
52a7e4c6 MA |
1 | // { dg-do run } |
2 | ||
3 | // 2005-2-17 Matt Austern <austern@apple.com> | |
4 | // | |
99dee823 | 5 | // Copyright (C) 2005-2021 Free Software Foundation, Inc. |
52a7e4c6 MA |
6 | // |
7 | // This file is part of the GNU ISO C++ Library. This library is free | |
8 | // software; you can redistribute it and/or modify it under the | |
9 | // terms of the GNU General Public License as published by the | |
748086b7 | 10 | // Free Software Foundation; either version 3, or (at your option) |
52a7e4c6 MA |
11 | // any later version. |
12 | // | |
13 | // This library is distributed in the hope that it will be useful, | |
14 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | // GNU General Public License for more details. | |
17 | // | |
18 | // You should have received a copy of the GNU General Public License along | |
748086b7 JJ |
19 | // with this library; see the file COPYING3. If not see |
20 | // <http://www.gnu.org/licenses/>. | |
52a7e4c6 MA |
21 | |
22 | // 6.3.4.5 unordered_multiset | |
23 | // range insert | |
24 | ||
25 | #include <string> | |
26 | #include <iterator> | |
27 | #include <algorithm> | |
28 | #include <tr1/unordered_set> | |
e7c59a0e | 29 | #include <testsuite_hooks.h> |
52a7e4c6 | 30 | |
52a7e4c6 MA |
31 | void test01() |
32 | { | |
33 | typedef std::tr1::unordered_multiset<std::string> Set; | |
34 | Set s; | |
35 | VERIFY(s.empty()); | |
36 | ||
37 | const int N = 10; | |
38 | const std::string A[N] = { "red", "green", "blue", "violet", "cyan", | |
39 | "magenta", "yellow", "orange", "pink", "gray" }; | |
40 | ||
41 | s.insert(A+0, A+N); | |
e7c59a0e | 42 | VERIFY(s.size() == static_cast<unsigned int>(N)); |
52a7e4c6 MA |
43 | VERIFY(std::distance(s.begin(), s.end()) == N); |
44 | ||
45 | for (int i = 0; i < N; ++i) { | |
46 | std::string str = A[i]; | |
47 | Set::iterator it = std::find(s.begin(), s.end(), str); | |
48 | VERIFY(it != s.end()); | |
49 | } | |
50 | } | |
51 | ||
52 | void test02() | |
53 | { | |
54 | typedef std::tr1::unordered_multiset<int> Set; | |
55 | Set s; | |
56 | VERIFY(s.empty()); | |
57 | ||
58 | const int N = 8; | |
59 | const int A[N] = { 3, 7, 4, 8, 2, 4, 6, 7 }; | |
60 | ||
61 | s.insert(A+0, A+N); | |
e7c59a0e | 62 | VERIFY(s.size() == static_cast<unsigned int>(N)); |
52a7e4c6 MA |
63 | VERIFY(std::distance(s.begin(), s.end()) == N); |
64 | ||
65 | VERIFY(std::count(s.begin(), s.end(), 2) == 1); | |
66 | VERIFY(std::count(s.begin(), s.end(), 3) == 1); | |
67 | VERIFY(std::count(s.begin(), s.end(), 4) == 2); | |
68 | VERIFY(std::count(s.begin(), s.end(), 6) == 1); | |
69 | VERIFY(std::count(s.begin(), s.end(), 7) == 2); | |
70 | VERIFY(std::count(s.begin(), s.end(), 8) == 1); | |
71 | } | |
72 | ||
73 | int main() | |
74 | { | |
75 | test01(); | |
76 | test02(); | |
77 | return 0; | |
78 | } |