]>
Commit | Line | Data |
---|---|---|
52066eae | 1 | // { dg-do run { target c++11 } } |
3b2524b1 | 2 | |
a945c346 | 3 | // Copyright (C) 2010-2024 Free Software Foundation, Inc. |
3b2524b1 PC |
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 | { | |
3b2524b1 PC |
29 | typedef std::unordered_map<std::string, int> Map; |
30 | typedef std::pair<const std::string, int> Pair; | |
31 | ||
32 | Map m; | |
33 | VERIFY(m.empty()); | |
34 | ||
35 | std::pair<Map::iterator, bool> p = m.insert(Pair("abcde", 3)); | |
36 | VERIFY(p.second); | |
37 | VERIFY(m.size() == 1); | |
38 | VERIFY(std::distance(m.begin(), m.end()) == 1); | |
39 | VERIFY(p.first == m.begin()); | |
40 | VERIFY(p.first->first == "abcde"); | |
41 | VERIFY(p.first->second == 3); | |
42 | } | |
43 | ||
44 | void test02() | |
45 | { | |
3b2524b1 PC |
46 | typedef std::unordered_map<std::string, int> Map; |
47 | typedef std::pair<const std::string, int> Pair; | |
48 | ||
49 | Map m; | |
50 | VERIFY(m.empty()); | |
51 | ||
52 | std::pair<Map::iterator, bool> p1 = m.insert(Pair("abcde", 3)); | |
53 | std::pair<Map::iterator, bool> p2 = m.insert(Pair("abcde", 7)); | |
54 | ||
55 | VERIFY(p1.second); | |
56 | VERIFY(!p2.second); | |
57 | VERIFY(m.size() == 1); | |
58 | VERIFY(p1.first == p2.first); | |
59 | VERIFY(p1.first->first == "abcde"); | |
60 | VERIFY(p2.first->second == 3); | |
61 | } | |
62 | ||
63 | int main() | |
64 | { | |
65 | test01(); | |
66 | test02(); | |
67 | return 0; | |
68 | } |