1 // { dg-do run { target c++11 } }
2
3 // Copyright (C) 2010-2018 Free Software Foundation, Inc.
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
test01()27 void test01()
28 {
29 typedef std::unordered_multimap<std::string, int> Map;
30 typedef std::pair<const std::string, int> Pair;
31
32 Map m;
33 VERIFY(m.empty());
34
35 Map::iterator i = m.insert(Pair("abcde", 3));
36 VERIFY(m.size() == 1);
37 VERIFY(std::distance(m.begin(), m.end()) == 1);
38 VERIFY(i == m.begin());
39 VERIFY(i->first == "abcde");
40 VERIFY(i->second == 3);
41 }
42
test02()43 void test02()
44 {
45 typedef std::unordered_multimap<std::string, int> Map;
46 typedef std::pair<const std::string, int> Pair;
47
48 Map m;
49 VERIFY(m.empty());
50
51 m.insert(Pair("abcde", 3));
52 m.insert(Pair("abcde", 7));
53
54 VERIFY(m.size() == 2);
55 VERIFY(std::distance(m.begin(), m.end()) == 2);
56
57 Map::iterator i1 = m.begin();
58 Map::iterator i2 = i1;
59 ++i2;
60
61 VERIFY(i1->first == "abcde");
62 VERIFY(i2->first == "abcde");
63 VERIFY((i1->second == 3 && i2->second == 7) ||
64 (i1->second == 7 && i2->second == 3));
65 }
66
main()67 int main()
68 {
69 test01();
70 test02();
71 return 0;
72 }
73