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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
// { dg-do run { target c++11 } }
// 2011-10-28 Paolo Carlini <paolo.carlini@oracle.com>
// Copyright (C) 2011-2019 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/>.
//
#include <unordered_map>
#include <testsuite_hooks.h>
void test01()
{
using namespace std;
typedef unordered_multimap<int, int>::value_type value_type;
unordered_multimap<int, int> umm0;
VERIFY( umm0.count(0) == 0 );
VERIFY( umm0.count(1) == 0 );
umm0.insert(value_type(1, 1));
VERIFY( umm0.count(0) == 0 );
VERIFY( umm0.count(1) == 1 );
umm0.insert(value_type(1, 2));
VERIFY( umm0.count(0) == 0 );
VERIFY( umm0.count(1) == 2 );
umm0.insert(value_type(2, 1));
VERIFY( umm0.count(2) == 1 );
umm0.insert(value_type(3, 1));
umm0.insert(value_type(3, 2));
umm0.insert(value_type(3, 3));
VERIFY( umm0.count(3) == 3 );
umm0.erase(2);
VERIFY( umm0.count(2) == 0 );
umm0.erase(0);
VERIFY( umm0.count(0) == 0 );
unordered_multimap<int, int> umm1(umm0);
VERIFY( umm1.count(0) == 0 );
VERIFY( umm1.count(1) == 2 );
VERIFY( umm1.count(2) == 0 );
VERIFY( umm1.count(3) == 3 );
umm0.clear();
VERIFY( umm0.count(0) == 0 );
VERIFY( umm0.count(1) == 0 );
VERIFY( umm0.count(2) == 0 );
VERIFY( umm0.count(3) == 0 );
umm1.insert(value_type(4, 1));
umm1.insert(value_type(5, 1));
umm1.insert(value_type(5, 2));
umm1.insert(value_type(5, 3));
umm1.insert(value_type(5, 4));
VERIFY( umm1.count(4) == 1 );
VERIFY( umm1.count(5) == 4 );
umm1.erase(1);
VERIFY( umm1.count(1) == 0 );
umm1.erase(umm1.find(5));
VERIFY( umm1.count(5) == 3 );
umm1.insert(value_type(1, 1));
umm1.insert(value_type(1, 2));
VERIFY( umm1.count(1) == 2 );
umm1.erase(5);
VERIFY( umm1.count(5) == 0 );
umm1.erase(umm1.find(4));
VERIFY( umm1.count(4) == 0 );
umm1.clear();
VERIFY( umm1.count(0) == 0 );
VERIFY( umm1.count(1) == 0 );
VERIFY( umm1.count(2) == 0 );
VERIFY( umm1.count(3) == 0 );
VERIFY( umm1.count(4) == 0 );
VERIFY( umm1.count(5) == 0 );
}
int main()
{
test01();
return 0;
}
|
