]> git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/23_containers/unordered_map/insert/map_single_move-2.cc
Update copyright years.
[thirdparty/gcc.git] / libstdc++-v3 / testsuite / 23_containers / unordered_map / insert / map_single_move-2.cc
1 // { dg-do run { target c++11 } }
2
3 // 2010-10-27 Paolo Carlini <paolo.carlini@oracle.com>
4 //
5 // Copyright (C) 2010-2020 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
29 void test01()
30 {
31 using __gnu_test::rvalstruct;
32
33 typedef std::unordered_map<rvalstruct, rvalstruct> Map;
34 typedef std::pair<rvalstruct, rvalstruct> Pair;
35
36 Map m;
37 VERIFY( m.empty());
38
39 std::pair<Map::iterator, bool> p = m.insert(Pair(rvalstruct(1),
40 rvalstruct(3)));
41 VERIFY( p.second );
42 VERIFY( m.size() == 1 );
43 VERIFY( std::distance(m.begin(), m.end()) == 1 );
44 VERIFY( p.first == m.begin() );
45 VERIFY( (p.first->first).val == 1 );
46 VERIFY( (p.first->second).val == 3 );
47 }
48
49 void test02()
50 {
51 using __gnu_test::rvalstruct;
52
53 typedef std::unordered_map<rvalstruct, rvalstruct> Map;
54 typedef std::pair<rvalstruct, rvalstruct> Pair;
55
56 Map m;
57 VERIFY( m.empty() );
58
59 std::pair<Map::iterator, bool> p1 = m.insert(Pair(rvalstruct(2),
60 rvalstruct(3)));
61 std::pair<Map::iterator, bool> p2 = m.insert(Pair(rvalstruct(2),
62 rvalstruct(7)));
63
64 VERIFY( p1.second );
65 VERIFY( !p2.second );
66 VERIFY( m.size() == 1 );
67 VERIFY( p1.first == p2.first );
68 VERIFY( (p1.first->first).val == 2 );
69 VERIFY( (p2.first->second).val == 3 );
70 }
71
72 int main()
73 {
74 test01();
75 test02();
76 return 0;
77 }