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