1 // { dg-options "-std=gnu++0x" }
2
3 // 2010-10-27 Paolo Carlini <paolo.carlini@oracle.com>
4 //
5 // Copyright (C) 2010-2013 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 bool test __attribute__((unused)) = true;
32 using __gnu_test::rvalstruct;
33
34 typedef std::unordered_multimap<rvalstruct, rvalstruct> Map;
35 typedef std::pair<rvalstruct, rvalstruct> Pair;
36
37 Map m;
38 VERIFY( m.empty() );
39
40 Map::iterator i = m.insert(Pair(rvalstruct(1), rvalstruct(3)));
41 VERIFY( m.size() == 1 );
42 VERIFY( std::distance(m.begin(), m.end()) == 1 );
43 VERIFY( i == m.begin() );
44 VERIFY( (i->first).val == 1 );
45 VERIFY( (i->second).val == 3 );
46 }
47
test02()48 void test02()
49 {
50 bool test __attribute__((unused)) = true;
51 using __gnu_test::rvalstruct;
52
53 typedef std::unordered_multimap<rvalstruct, rvalstruct> Map;
54 typedef std::pair<rvalstruct, rvalstruct> Pair;
55
56 Map m;
57 VERIFY( m.empty() );
58
59 m.insert(Pair(rvalstruct(2), rvalstruct(3)));
60 m.insert(Pair(rvalstruct(2), rvalstruct(7)));
61
62 VERIFY( m.size() == 2 );
63 VERIFY( std::distance(m.begin(), m.end()) == 2 );
64
65 Map::iterator i1 = m.begin();
66 Map::iterator i2 = i1;
67 ++i2;
68
69 VERIFY( (i1->first).val == 2 );
70 VERIFY( (i2->first).val == 2 );
71 VERIFY( ((i1->second).val == 3 && (i2->second).val == 7)
72 || ((i1->second).val == 7 && (i2->second).val == 3) );
73 }
74
main()75 int main()
76 {
77 test01();
78 test02();
79 return 0;
80 }
81