1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
// Copyright (C) 2008-2018 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
//
// { dg-do run { target c++11 } }
#include <set>
#include <unordered_map>
#include <testsuite_hooks.h>
using namespace std;
void test01()
{
typedef unordered_multimap<int,double> Container;
typedef Container::const_iterator iterator;
typedef pair<iterator,iterator> itpair;
Container m({ { 1, 1.0 }, { 1, 2.0 }, { 1, 237.0 } });
VERIFY(m.size() == 3);
itpair ip = m.equal_range(1);
VERIFY(distance(ip.first, ip.second) == 3);
set<double> s = { 1.0, 2.0, 237.0 };
for (iterator i = ip.first; i != ip.second; ++i)
s.erase (i->second);
VERIFY(s.empty());
m = { {5, 55.0}, { 5, 66.0 }, { 42, 4242.0 } };
VERIFY(m.size() == 3);
ip = m.equal_range(5);
VERIFY(distance(ip.first, ip.second) == 2);
s = { 55.0, 66.0 };
for (iterator i = ip.first; i != ip.second; ++i)
s.erase (i->second);
VERIFY(s.empty());
m.insert({ { 7, 77.0 }, { 7, 88.0 } });
VERIFY(m.size() == 5);
VERIFY(m.count(5) == 2);
VERIFY(m.count(42) == 1);
VERIFY(m.count(7) == 2);
}
int main()
{
__gnu_test::set_memory_limits();
test01();
}
|
