1 // { dg-options "-std=gnu++0x" }
3 // 2010-10-27 Paolo Carlini <paolo.carlini@oracle.com>
5 // Copyright (C) 2010 Free Software Foundation, Inc.
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)
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.
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/>.
22 // Single-element insert
25 #include <unordered_map>
26 #include <testsuite_hooks.h>
27 #include <testsuite_rvalref.h>
31 bool test __attribute__((unused)) = true;
32 using __gnu_test::rvalstruct;
34 typedef std::unordered_multimap<int, rvalstruct> Map;
35 typedef std::pair<const int, rvalstruct> Pair;
40 Map::iterator i = m.insert(Pair(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 == 1 );
45 VERIFY( (i->second).val == 3 );
50 bool test __attribute__((unused)) = true;
51 using __gnu_test::rvalstruct;
53 typedef std::unordered_multimap<int, rvalstruct> Map;
54 typedef std::pair<const int, rvalstruct> Pair;
59 m.insert(Pair(2, rvalstruct(3)));
60 m.insert(Pair(2, rvalstruct(7)));
62 VERIFY( m.size() == 2 );
63 VERIFY( std::distance(m.begin(), m.end()) == 2 );
65 Map::iterator i1 = m.begin();
66 Map::iterator i2 = i1;
69 VERIFY( i1->first == 2 );
70 VERIFY( i2->first == 2 );
71 VERIFY( ((i1->second).val == 3 && (i2->second).val == 7)
72 || ((i1->second).val == 7 && (i2->second).val == 3) );