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
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <unordered_set>
// template <class Key, class Hash, class Pred, class Alloc>
// bool
// operator==(const unordered_multiset<Key, Hash, Pred, Alloc>& x,
// const unordered_multiset<Key, Hash, Pred, Alloc>& y);
//
// template <class Key, class Hash, class Pred, class Alloc>
// bool
// operator!=(const unordered_multiset<Key, Hash, Pred, Alloc>& x,
// const unordered_multiset<Key, Hash, Pred, Alloc>& y);
#include <unordered_set>
#include <cassert>
int main()
{
{
typedef std::unordered_multiset<int> C;
typedef int P;
P a[] =
{
P(10),
P(20),
P(20),
P(30),
P(40),
P(50),
P(50),
P(50),
P(60),
P(70),
P(80)
};
const C c1(std::begin(a), std::end(a));
const C c2;
assert(!(c1 == c2));
assert( (c1 != c2));
}
{
typedef std::unordered_multiset<int> C;
typedef int P;
P a[] =
{
P(10),
P(20),
P(20),
P(30),
P(40),
P(50),
P(50),
P(50),
P(60),
P(70),
P(80)
};
const C c1(std::begin(a), std::end(a));
const C c2 = c1;
assert( (c1 == c2));
assert(!(c1 != c2));
}
{
typedef std::unordered_multiset<int> C;
typedef int P;
P a[] =
{
P(10),
P(20),
P(20),
P(30),
P(40),
P(50),
P(50),
P(50),
P(60),
P(70),
P(80)
};
C c1(std::begin(a), std::end(a));
C c2 = c1;
c2.rehash(30);
assert( (c1 == c2));
assert(!(c1 != c2));
c2.insert(P(90));
assert(!(c1 == c2));
assert( (c1 != c2));
c1.insert(P(90));
assert( (c1 == c2));
assert(!(c1 != c2));
}
}
|
