]>
Commit | Line | Data |
---|---|---|
180ecd6a MA |
1 | // { dg-do run } |
2 | ||
3 | // 2005-2-17 Matt Austern <austern@apple.com> | |
4 | // | |
83ffe9cd | 5 | // Copyright (C) 2005-2023 Free Software Foundation, Inc. |
180ecd6a 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) |
180ecd6a 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/>. | |
180ecd6a MA |
21 | |
22 | // 6.3.4.5 unordered_multiset | |
23 | // Single-element insert | |
24 | ||
25 | #include <string> | |
26 | #include <iterator> | |
27 | #include <tr1/unordered_set> | |
28 | #include "testsuite_hooks.h" | |
29 | ||
180ecd6a MA |
30 | void test01() |
31 | { | |
32 | typedef std::tr1::unordered_multiset<std::string> Set; | |
33 | Set s; | |
34 | VERIFY(s.empty()); | |
35 | ||
36 | Set::iterator i = s.insert("abcde"); | |
37 | VERIFY(s.size() == 1); | |
38 | VERIFY(std::distance(s.begin(), s.end()) == 1); | |
39 | VERIFY(i == s.begin()); | |
40 | VERIFY(*i == "abcde"); | |
41 | } | |
42 | ||
43 | void test02() | |
44 | { | |
45 | typedef std::tr1::unordered_multiset<std::string> Set; | |
46 | Set s; | |
47 | VERIFY(s.empty()); | |
48 | ||
49 | s.insert("abcde"); | |
50 | Set::iterator i = s.insert("abcde"); | |
51 | VERIFY(s.size() == 2); | |
52 | VERIFY(std::distance(s.begin(), s.end()) == 2); | |
53 | VERIFY(*i == "abcde"); | |
f92ab29f | 54 | |
180ecd6a MA |
55 | Set::iterator i2 = s.begin(); |
56 | ++i2; | |
57 | VERIFY(i == s.begin() || i == i2); | |
58 | VERIFY(*(s.begin()) == "abcde" && *i2 == "abcde"); | |
59 | } | |
60 | ||
61 | int main() | |
62 | { | |
63 | test01(); | |
64 | test02(); | |
65 | return 0; | |
66 | } |