]>
Commit | Line | Data |
---|---|---|
52066eae | 1 | // { dg-do run { target c++11 } } |
e6a05448 PC |
2 | |
3 | // 2010-11-10 Paolo Carlini <paolo.carlini@oracle.com> | |
4 | // | |
a5544970 | 5 | // Copyright (C) 2010-2019 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 | ||
27 | void test01() | |
28 | { | |
e6a05448 PC |
29 | using __gnu_test::rvalstruct; |
30 | ||
31 | typedef std::multimap<int, rvalstruct> Map; | |
32 | typedef std::pair<const int, rvalstruct> Pair; | |
33 | ||
34 | Map m; | |
35 | VERIFY( m.empty() ); | |
36 | ||
37 | Map::iterator i = m.insert(m.begin(), Pair(1, rvalstruct(3))); | |
38 | VERIFY( m.size() == 1 ); | |
39 | VERIFY( std::distance(m.begin(), m.end()) == 1 ); | |
40 | VERIFY( i == m.begin() ); | |
41 | VERIFY( i->first == 1 ); | |
42 | VERIFY( (i->second).val == 3 ); | |
43 | } | |
44 | ||
45 | void test02() | |
46 | { | |
e6a05448 PC |
47 | using __gnu_test::rvalstruct; |
48 | ||
49 | typedef std::multimap<int, rvalstruct> Map; | |
50 | typedef std::pair<const int, rvalstruct> Pair; | |
51 | ||
52 | Map m; | |
53 | VERIFY( m.empty() ); | |
54 | ||
55 | Map::iterator i0 = m.insert(m.begin(), Pair(2, rvalstruct(3))); | |
56 | m.insert(i0, Pair(2, rvalstruct(7))); | |
57 | ||
58 | VERIFY( m.size() == 2 ); | |
59 | VERIFY( std::distance(m.begin(), m.end()) == 2 ); | |
60 | ||
61 | Map::iterator i1 = m.begin(); | |
62 | Map::iterator i2 = i1; | |
63 | ++i2; | |
64 | ||
65 | VERIFY( i1->first == 2 ); | |
66 | VERIFY( i2->first == 2 ); | |
67 | VERIFY( (i1->second).val == 7 && (i2->second).val == 3 ); | |
68 | } | |
69 | ||
70 | int main() | |
71 | { | |
72 | test01(); | |
73 | test02(); | |
74 | return 0; | |
75 | } |