]>
Commit | Line | Data |
---|---|---|
180ecd6a 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. |
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.6 unordered_multimap | |
23 | // Single-element insert | |
24 | ||
25 | #include <string> | |
26 | #include <iterator> | |
27 | #include <tr1/unordered_map> | |
28 | #include "testsuite_hooks.h" | |
29 | ||
180ecd6a MA |
30 | void test01() |
31 | { | |
32 | typedef std::tr1::unordered_multimap<std::string, int> Map; | |
33 | typedef std::pair<const std::string, int> Pair; | |
34 | ||
35 | Map m; | |
36 | VERIFY(m.empty()); | |
37 | ||
38 | Map::iterator i = m.insert(Pair("abcde", 3)); | |
39 | VERIFY(m.size() == 1); | |
40 | VERIFY(std::distance(m.begin(), m.end()) == 1); | |
41 | VERIFY(i == m.begin()); | |
42 | VERIFY(i->first == "abcde"); | |
43 | VERIFY(i->second == 3); | |
44 | } | |
45 | ||
46 | void test02() | |
47 | { | |
48 | typedef std::tr1::unordered_multimap<std::string, int> Map; | |
49 | typedef std::pair<const std::string, int> Pair; | |
50 | ||
51 | Map m; | |
52 | VERIFY(m.empty()); | |
53 | ||
54 | m.insert(Pair("abcde", 3)); | |
55 | m.insert(Pair("abcde", 7)); | |
56 | ||
57 | VERIFY(m.size() == 2); | |
58 | VERIFY(std::distance(m.begin(), m.end()) == 2); | |
59 | ||
60 | Map::iterator i1 = m.begin(); | |
61 | Map::iterator i2 = i1; | |
62 | ++i2; | |
63 | ||
64 | VERIFY(i1->first == "abcde"); | |
65 | VERIFY(i2->first == "abcde"); | |
66 | VERIFY((i1->second == 3 && i2->second == 7) || | |
67 | (i1->second == 7 && i2->second == 3)); | |
68 | } | |
69 | ||
70 | int main() | |
71 | { | |
72 | test01(); | |
73 | test02(); | |
74 | return 0; | |
75 | } |