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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
|
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code 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
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* This file is available under and governed by the GNU General Public
* License version 2 only, as published by the Free Software Foundation.
* However, the following notice accompanied the original version of this
* file:
*
* Written by Doug Lea and Martin Buchholz with assistance from
* members of JCP JSR-166 Expert Group and released to the public
* domain, as explained at
* http://creativecommons.org/publicdomain/zero/1.0/
*/
import junit.framework.Test;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.concurrent.ThreadLocalRandom;
/**
* Contains tests applicable to all Map implementations.
*/
public class MapTest extends JSR166TestCase {
final MapImplementation impl;
/** Tests are parameterized by a Map implementation. */
MapTest(MapImplementation impl, String methodName) {
super(methodName);
this.impl = impl;
}
public static Test testSuite(MapImplementation impl) {
return newTestSuite(
parameterizedTestSuite(MapTest.class,
MapImplementation.class,
impl));
}
public void testImplSanity() {
final ThreadLocalRandom rnd = ThreadLocalRandom.current();
{
Map m = impl.emptyMap();
assertTrue(m.isEmpty());
assertEquals(0, m.size());
Object k = impl.makeKey(rnd.nextInt());
Object v = impl.makeValue(rnd.nextInt());
m.put(k, v);
assertFalse(m.isEmpty());
assertEquals(1, m.size());
assertTrue(m.containsKey(k));
assertTrue(m.containsValue(v));
}
{
Map m = impl.emptyMap();
Object v = impl.makeValue(rnd.nextInt());
if (impl.permitsNullKeys()) {
m.put(null, v);
assertTrue(m.containsKey(null));
assertTrue(m.containsValue(v));
} else {
assertThrows(NullPointerException.class, () -> m.put(null, v));
}
}
{
Map m = impl.emptyMap();
Object k = impl.makeKey(rnd.nextInt());
if (impl.permitsNullValues()) {
m.put(k, null);
assertTrue(m.containsKey(k));
assertTrue(m.containsValue(null));
} else {
assertThrows(NullPointerException.class, () -> m.put(k, null));
}
}
{
Map m = impl.emptyMap();
Object k = impl.makeKey(rnd.nextInt());
Object v1 = impl.makeValue(rnd.nextInt());
Object v2 = impl.makeValue(rnd.nextInt());
m.put(k, v1);
if (impl.supportsSetValue()) {
((Map.Entry)(m.entrySet().iterator().next())).setValue(v2);
assertSame(v2, m.get(k));
assertTrue(m.containsKey(k));
assertTrue(m.containsValue(v2));
assertFalse(m.containsValue(v1));
} else {
assertThrows(UnsupportedOperationException.class,
() -> ((Map.Entry)(m.entrySet().iterator().next())).setValue(v2));
}
}
}
/**
* Tests and extends the scenario reported in
* https://bugs.openjdk.java.net/browse/JDK-8186171
* HashMap: Entry.setValue may not work after Iterator.remove() called for previous entries
* ant -Djsr166.tckTestClass=HashMapTest -Djsr166.methodFilter=testBug8186171 -Djsr166.runsPerTest=1000 tck
*/
public void testBug8186171() {
if (!impl.supportsSetValue()) return;
final ThreadLocalRandom rnd = ThreadLocalRandom.current();
final boolean permitsNullValues = impl.permitsNullValues();
final Object v1 = (permitsNullValues && rnd.nextBoolean())
? null : impl.makeValue(1);
final Object v2 = (permitsNullValues && rnd.nextBoolean() && v1 != null)
? null : impl.makeValue(2);
// If true, always lands in first bucket in hash tables.
final boolean poorHash = rnd.nextBoolean();
class Key implements Comparable<Key> {
final int i;
Key(int i) { this.i = i; }
public int hashCode() { return poorHash ? 0 : super.hashCode(); }
public int compareTo(Key x) {
return Integer.compare(this.i, x.i);
}
}
// Both HashMap and ConcurrentHashMap have:
// TREEIFY_THRESHOLD = 8; UNTREEIFY_THRESHOLD = 6;
final int size = rnd.nextInt(1, 25);
List<Key> keys = new ArrayList<>();
for (int i = size; i-->0; ) keys.add(new Key(i));
Key keyToFrob = keys.get(rnd.nextInt(keys.size()));
Map<Key, Object> m = impl.emptyMap();
for (Key key : keys) m.put(key, v1);
for (Iterator<Map.Entry<Key, Object>> it = m.entrySet().iterator();
it.hasNext(); ) {
Map.Entry<Key, Object> entry = it.next();
if (entry.getKey() == keyToFrob)
entry.setValue(v2); // does this have the expected effect?
else
it.remove();
}
assertFalse(m.containsValue(v1));
assertTrue(m.containsValue(v2));
assertTrue(m.containsKey(keyToFrob));
assertEquals(1, m.size());
}
/**
* 8222930: ConcurrentSkipListMap.clone() shares size variable between original and clone
*/
public void testClone() {
final ThreadLocalRandom rnd = ThreadLocalRandom.current();
final int size = rnd.nextInt(4);
final Map map = impl.emptyMap();
for (int i = 0; i < size; i++)
map.put(impl.makeKey(i), impl.makeValue(i));
final Map clone = cloneableClone(map);
if (clone == null) return; // not cloneable?
assertEquals(size, map.size());
assertEquals(size, clone.size());
assertEquals(map.isEmpty(), clone.isEmpty());
clone.put(impl.makeKey(-1), impl.makeValue(-1));
assertEquals(size, map.size());
assertEquals(size + 1, clone.size());
clone.clear();
assertEquals(size, map.size());
assertEquals(0, clone.size());
assertTrue(clone.isEmpty());
}
// public void testFailsIntentionallyForDebugging() {
// fail(impl.klazz().getSimpleName());
// }
}
|
