]> git.ipfire.org Git - thirdparty/gcc.git/blame - libstdc++-v3/testsuite/23_containers/multimap/modifiers/insert/4.cc
Update copyright years.
[thirdparty/gcc.git] / libstdc++-v3 / testsuite / 23_containers / multimap / modifiers / insert / 4.cc
CommitLineData
52066eae 1// { dg-do run { target c++11 } }
e6a05448
PC
2
3// 2010-11-10 Paolo Carlini <paolo.carlini@oracle.com>
4//
8d9254fc 5// Copyright (C) 2010-2020 Free Software Foundation, Inc.
e6a05448
PC
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#include <iterator>
23#include <map>
24#include <testsuite_hooks.h>
25#include <testsuite_rvalref.h>
26
27void test01()
28{
e6a05448
PC
29 using __gnu_test::rvalstruct;
30
31 typedef std::multimap<rvalstruct, rvalstruct> Map;
32 typedef std::pair<rvalstruct, rvalstruct> Pair;
33
34 Map m;
35 VERIFY( m.empty() );
36
37 Map::iterator i = m.insert(m.begin(),
38 Pair(rvalstruct(1), rvalstruct(3)));
39 VERIFY( m.size() == 1 );
40 VERIFY( std::distance(m.begin(), m.end()) == 1 );
41 VERIFY( i == m.begin() );
42 VERIFY( (i->first).val == 1 );
43 VERIFY( (i->second).val == 3 );
44}
45
46void test02()
47{
e6a05448
PC
48 using __gnu_test::rvalstruct;
49
50 typedef std::multimap<rvalstruct, rvalstruct> Map;
51 typedef std::pair<rvalstruct, rvalstruct> Pair;
52
53 Map m;
54 VERIFY( m.empty() );
55
56 Map::iterator i0 = m.insert(Pair(rvalstruct(2), rvalstruct(3)));
57 m.insert(i0, Pair(rvalstruct(2), rvalstruct(7)));
58
59 VERIFY( m.size() == 2 );
60 VERIFY( std::distance(m.begin(), m.end()) == 2 );
61
62 Map::iterator i1 = m.begin();
63 Map::iterator i2 = i1;
64 ++i2;
65
66 VERIFY( (i1->first).val == 2 );
67 VERIFY( (i2->first).val == 2 );
68 VERIFY( (i1->second).val == 7 && (i2->second).val == 3 );
69}
70
71int main()
72{
73 test01();
74 test02();
75 return 0;
76}