1 // { dg-do run { target c++11 } }
2
3 // 2010-10-27 Paolo Carlini <paolo.carlini@oracle.com>
4 //
5 // Copyright (C) 2010-2018 Free Software Foundation, Inc.
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
10 // Free Software Foundation; either version 3, or (at your option)
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
19 // with this library; see the file COPYING3. If not see
20 // <http://www.gnu.org/licenses/>.
21
22 // Single-element insert
23
24 #include <iterator>
25 #include <unordered_map>
26 #include <testsuite_hooks.h>
27 #include <testsuite_rvalref.h>
28
test01()29 void test01()
30 {
31 using __gnu_test::rvalstruct;
32
33 typedef std::unordered_multimap<rvalstruct, rvalstruct> Map;
34 typedef std::pair<rvalstruct, rvalstruct> Pair;
35
36 Map m;
37 VERIFY( m.empty() );
38
39 Map::iterator i = m.insert(Pair(rvalstruct(1), rvalstruct(3)));
40 VERIFY( m.size() == 1 );
41 VERIFY( std::distance(m.begin(), m.end()) == 1 );
42 VERIFY( i == m.begin() );
43 VERIFY( (i->first).val == 1 );
44 VERIFY( (i->second).val == 3 );
45 }
46
test02()47 void test02()
48 {
49 using __gnu_test::rvalstruct;
50
51 typedef std::unordered_multimap<rvalstruct, rvalstruct> Map;
52 typedef std::pair<rvalstruct, rvalstruct> Pair;
53
54 Map m;
55 VERIFY( m.empty() );
56
57 m.insert(Pair(rvalstruct(2), rvalstruct(3)));
58 m.insert(Pair(rvalstruct(2), rvalstruct(7)));
59
60 VERIFY( m.size() == 2 );
61 VERIFY( std::distance(m.begin(), m.end()) == 2 );
62
63 Map::iterator i1 = m.begin();
64 Map::iterator i2 = i1;
65 ++i2;
66
67 VERIFY( (i1->first).val == 2 );
68 VERIFY( (i2->first).val == 2 );
69 VERIFY( ((i1->second).val == 3 && (i2->second).val == 7)
70 || ((i1->second).val == 7 && (i2->second).val == 3) );
71 }
72
main()73 int main()
74 {
75 test01();
76 test02();
77 return 0;
78 }
79