34 |
|
} |
35 |
|
|
36 |
|
/** |
37 |
< |
* Returns a new map from Integers 1-5 to Strings "A"-"E". |
37 |
> |
* Returns a new map from Items 1-5 to Strings "A"-"E". |
38 |
|
*/ |
39 |
< |
private static ConcurrentHashMap map5() { |
40 |
< |
ConcurrentHashMap map = new ConcurrentHashMap(5); |
39 |
> |
private static ConcurrentHashMap<Item,String> map5() { |
40 |
> |
ConcurrentHashMap<Item,String> map = new ConcurrentHashMap<Item,String>(5); |
41 |
|
assertTrue(map.isEmpty()); |
42 |
|
map.put(one, "A"); |
43 |
|
map.put(two, "B"); |
45 |
|
map.put(four, "D"); |
46 |
|
map.put(five, "E"); |
47 |
|
assertFalse(map.isEmpty()); |
48 |
< |
assertEquals(5, map.size()); |
48 |
> |
mustEqual(5, map.size()); |
49 |
|
return map; |
50 |
|
} |
51 |
|
|
53 |
|
* getOrDefault returns value if present, else default |
54 |
|
*/ |
55 |
|
public void testGetOrDefault() { |
56 |
< |
ConcurrentHashMap map = map5(); |
57 |
< |
assertEquals(map.getOrDefault(one, "Z"), "A"); |
58 |
< |
assertEquals(map.getOrDefault(six, "Z"), "Z"); |
56 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
57 |
> |
mustEqual(map.getOrDefault(one, "Z"), "A"); |
58 |
> |
mustEqual(map.getOrDefault(six, "Z"), "Z"); |
59 |
|
} |
60 |
|
|
61 |
|
/** |
62 |
|
* computeIfAbsent adds when the given key is not present |
63 |
|
*/ |
64 |
|
public void testComputeIfAbsent() { |
65 |
< |
ConcurrentHashMap map = map5(); |
65 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
66 |
|
map.computeIfAbsent(six, x -> "Z"); |
67 |
|
assertTrue(map.containsKey(six)); |
68 |
|
} |
71 |
|
* computeIfAbsent does not replace if the key is already present |
72 |
|
*/ |
73 |
|
public void testComputeIfAbsent2() { |
74 |
< |
ConcurrentHashMap map = map5(); |
75 |
< |
assertEquals("A", map.computeIfAbsent(one, x -> "Z")); |
74 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
75 |
> |
mustEqual("A", map.computeIfAbsent(one, x -> "Z")); |
76 |
|
} |
77 |
|
|
78 |
|
/** |
79 |
|
* computeIfAbsent does not add if function returns null |
80 |
|
*/ |
81 |
|
public void testComputeIfAbsent3() { |
82 |
< |
ConcurrentHashMap map = map5(); |
82 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
83 |
|
map.computeIfAbsent(six, x -> null); |
84 |
|
assertFalse(map.containsKey(six)); |
85 |
|
} |
88 |
|
* computeIfPresent does not replace if the key is already present |
89 |
|
*/ |
90 |
|
public void testComputeIfPresent() { |
91 |
< |
ConcurrentHashMap map = map5(); |
91 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
92 |
|
map.computeIfPresent(six, (x, y) -> "Z"); |
93 |
|
assertFalse(map.containsKey(six)); |
94 |
|
} |
97 |
|
* computeIfPresent adds when the given key is not present |
98 |
|
*/ |
99 |
|
public void testComputeIfPresent2() { |
100 |
< |
ConcurrentHashMap map = map5(); |
101 |
< |
assertEquals("Z", map.computeIfPresent(one, (x, y) -> "Z")); |
100 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
101 |
> |
mustEqual("Z", map.computeIfPresent(one, (x, y) -> "Z")); |
102 |
|
} |
103 |
|
|
104 |
|
/** |
105 |
|
* compute does not replace if the function returns null |
106 |
|
*/ |
107 |
|
public void testCompute() { |
108 |
< |
ConcurrentHashMap map = map5(); |
108 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
109 |
|
map.compute(six, (x, y) -> null); |
110 |
|
assertFalse(map.containsKey(six)); |
111 |
|
} |
114 |
|
* compute adds when the given key is not present |
115 |
|
*/ |
116 |
|
public void testCompute2() { |
117 |
< |
ConcurrentHashMap map = map5(); |
118 |
< |
assertEquals("Z", map.compute(six, (x, y) -> "Z")); |
117 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
118 |
> |
mustEqual("Z", map.compute(six, (x, y) -> "Z")); |
119 |
|
} |
120 |
|
|
121 |
|
/** |
122 |
|
* compute replaces when the given key is present |
123 |
|
*/ |
124 |
|
public void testCompute3() { |
125 |
< |
ConcurrentHashMap map = map5(); |
126 |
< |
assertEquals("Z", map.compute(one, (x, y) -> "Z")); |
125 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
126 |
> |
mustEqual("Z", map.compute(one, (x, y) -> "Z")); |
127 |
|
} |
128 |
|
|
129 |
|
/** |
130 |
|
* compute removes when the given key is present and function returns null |
131 |
|
*/ |
132 |
|
public void testCompute4() { |
133 |
< |
ConcurrentHashMap map = map5(); |
133 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
134 |
|
map.compute(one, (x, y) -> null); |
135 |
|
assertFalse(map.containsKey(one)); |
136 |
|
} |
139 |
|
* merge adds when the given key is not present |
140 |
|
*/ |
141 |
|
public void testMerge1() { |
142 |
< |
ConcurrentHashMap map = map5(); |
143 |
< |
assertEquals("Y", map.merge(six, "Y", (x, y) -> "Z")); |
142 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
143 |
> |
mustEqual("Y", map.merge(six, "Y", (x, y) -> "Z")); |
144 |
|
} |
145 |
|
|
146 |
|
/** |
147 |
|
* merge replaces when the given key is present |
148 |
|
*/ |
149 |
|
public void testMerge2() { |
150 |
< |
ConcurrentHashMap map = map5(); |
151 |
< |
assertEquals("Z", map.merge(one, "Y", (x, y) -> "Z")); |
150 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
151 |
> |
mustEqual("Z", map.merge(one, "Y", (x, y) -> "Z")); |
152 |
|
} |
153 |
|
|
154 |
|
/** |
155 |
|
* merge removes when the given key is present and function returns null |
156 |
|
*/ |
157 |
|
public void testMerge3() { |
158 |
< |
ConcurrentHashMap map = map5(); |
158 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
159 |
|
map.merge(one, "Y", (x, y) -> null); |
160 |
|
assertFalse(map.containsKey(one)); |
161 |
|
} |
162 |
|
|
163 |
< |
static Set<Integer> populatedSet(int n) { |
164 |
< |
Set<Integer> a = ConcurrentHashMap.<Integer>newKeySet(); |
163 |
> |
static Set<Item> populatedSet(int n) { |
164 |
> |
Set<Item> a = ConcurrentHashMap.<Item>newKeySet(); |
165 |
|
assertTrue(a.isEmpty()); |
166 |
|
for (int i = 0; i < n; i++) |
167 |
< |
assertTrue(a.add(i)); |
168 |
< |
assertEquals(n == 0, a.isEmpty()); |
169 |
< |
assertEquals(n, a.size()); |
167 |
> |
mustAdd(a, i); |
168 |
> |
mustEqual(n == 0, a.isEmpty()); |
169 |
> |
mustEqual(n, a.size()); |
170 |
|
return a; |
171 |
|
} |
172 |
|
|
173 |
< |
static Set populatedSet(Integer[] elements) { |
174 |
< |
Set<Integer> a = ConcurrentHashMap.<Integer>newKeySet(); |
173 |
> |
static Set<Item> populatedSet(Item[] elements) { |
174 |
> |
Set<Item> a = ConcurrentHashMap.<Item>newKeySet(); |
175 |
|
assertTrue(a.isEmpty()); |
176 |
< |
for (Integer element : elements) |
176 |
> |
for (Item element : elements) |
177 |
|
assertTrue(a.add(element)); |
178 |
|
assertFalse(a.isEmpty()); |
179 |
< |
assertEquals(elements.length, a.size()); |
179 |
> |
mustEqual(elements.length, a.size()); |
180 |
|
return a; |
181 |
|
} |
182 |
|
|
184 |
|
* replaceAll replaces all matching values. |
185 |
|
*/ |
186 |
|
public void testReplaceAll() { |
187 |
< |
ConcurrentHashMap<Integer, String> map = map5(); |
188 |
< |
map.replaceAll((x, y) -> (x > 3) ? "Z" : y); |
189 |
< |
assertEquals("A", map.get(one)); |
190 |
< |
assertEquals("B", map.get(two)); |
191 |
< |
assertEquals("C", map.get(three)); |
192 |
< |
assertEquals("Z", map.get(four)); |
193 |
< |
assertEquals("Z", map.get(five)); |
187 |
> |
ConcurrentHashMap<Item, String> map = map5(); |
188 |
> |
map.replaceAll((x, y) -> (x.value > 3) ? "Z" : y); |
189 |
> |
mustEqual("A", map.get(one)); |
190 |
> |
mustEqual("B", map.get(two)); |
191 |
> |
mustEqual("C", map.get(three)); |
192 |
> |
mustEqual("Z", map.get(four)); |
193 |
> |
mustEqual("Z", map.get(five)); |
194 |
|
} |
195 |
|
|
196 |
|
/** |
197 |
|
* Default-constructed set is empty |
198 |
|
*/ |
199 |
|
public void testNewKeySet() { |
200 |
< |
Set a = ConcurrentHashMap.newKeySet(); |
200 |
> |
Set<Item> a = ConcurrentHashMap.<Item>newKeySet(); |
201 |
|
assertTrue(a.isEmpty()); |
202 |
|
} |
203 |
|
|
206 |
|
* remove removes it. |
207 |
|
*/ |
208 |
|
public void testKeySetAddRemove() { |
209 |
< |
ConcurrentHashMap map = map5(); |
210 |
< |
Set set1 = map.keySet(); |
211 |
< |
Set set2 = map.keySet(true); |
209 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
210 |
> |
Set<Item> set1 = map.keySet(); |
211 |
> |
Set<Item> set2 = map.keySet("added"); |
212 |
|
set2.add(six); |
213 |
|
assertSame(map, ((ConcurrentHashMap.KeySetView)set2).getMap()); |
214 |
|
assertSame(map, ((ConcurrentHashMap.KeySetView)set1).getMap()); |
215 |
< |
assertEquals(set2.size(), map.size()); |
216 |
< |
assertEquals(set1.size(), map.size()); |
217 |
< |
assertTrue((Boolean)map.get(six)); |
218 |
< |
assertTrue(set1.contains(six)); |
219 |
< |
assertTrue(set2.contains(six)); |
220 |
< |
set2.remove(six); |
215 |
> |
mustEqual(set2.size(), map.size()); |
216 |
> |
mustEqual(set1.size(), map.size()); |
217 |
> |
assertEquals(map.get(six), "added"); |
218 |
> |
mustContain(set1, six); |
219 |
> |
mustContain(set2, six); |
220 |
> |
mustRemove(set2, six); |
221 |
|
assertNull(map.get(six)); |
222 |
< |
assertFalse(set1.contains(six)); |
223 |
< |
assertFalse(set2.contains(six)); |
222 |
> |
mustNotContain(set1, six); |
223 |
> |
mustNotContain(set2, six); |
224 |
|
} |
225 |
|
|
226 |
|
/** |
227 |
|
* keySet.addAll adds each element from the given collection |
228 |
|
*/ |
229 |
|
public void testAddAll() { |
230 |
< |
Set full = populatedSet(3); |
230 |
> |
Set<Item> full = populatedSet(3); |
231 |
|
assertTrue(full.addAll(Arrays.asList(three, four, five))); |
232 |
< |
assertEquals(6, full.size()); |
232 |
> |
mustEqual(6, full.size()); |
233 |
|
assertFalse(full.addAll(Arrays.asList(three, four, five))); |
234 |
< |
assertEquals(6, full.size()); |
234 |
> |
mustEqual(6, full.size()); |
235 |
|
} |
236 |
|
|
237 |
|
/** |
239 |
|
* already exist in the set |
240 |
|
*/ |
241 |
|
public void testAddAll2() { |
242 |
< |
Set full = populatedSet(3); |
242 |
> |
Set<Item> full = populatedSet(3); |
243 |
|
// "one" is duplicate and will not be added |
244 |
|
assertTrue(full.addAll(Arrays.asList(three, four, one))); |
245 |
< |
assertEquals(5, full.size()); |
245 |
> |
mustEqual(5, full.size()); |
246 |
|
assertFalse(full.addAll(Arrays.asList(three, four, one))); |
247 |
< |
assertEquals(5, full.size()); |
247 |
> |
mustEqual(5, full.size()); |
248 |
|
} |
249 |
|
|
250 |
|
/** |
251 |
|
* keySet.add will not add the element if it already exists in the set |
252 |
|
*/ |
253 |
|
public void testAdd2() { |
254 |
< |
Set full = populatedSet(3); |
254 |
> |
Set<Item> full = populatedSet(3); |
255 |
|
assertFalse(full.add(one)); |
256 |
< |
assertEquals(3, full.size()); |
256 |
> |
mustEqual(3, full.size()); |
257 |
|
} |
258 |
|
|
259 |
|
/** |
260 |
|
* keySet.add adds the element when it does not exist in the set |
261 |
|
*/ |
262 |
|
public void testAdd3() { |
263 |
< |
Set full = populatedSet(3); |
263 |
> |
Set<Item> full = populatedSet(3); |
264 |
|
assertTrue(full.add(three)); |
265 |
< |
assertTrue(full.contains(three)); |
265 |
> |
mustContain(full, three); |
266 |
|
assertFalse(full.add(three)); |
267 |
< |
assertTrue(full.contains(three)); |
267 |
> |
mustContain(full, three); |
268 |
|
} |
269 |
|
|
270 |
|
/** |
272 |
|
* mapped value |
273 |
|
*/ |
274 |
|
public void testAdd4() { |
275 |
< |
Set full = map5().keySet(); |
275 |
> |
Set<Item> full = map5().keySet(); |
276 |
|
try { |
277 |
|
full.add(three); |
278 |
|
shouldThrow(); |
284 |
|
* null |
285 |
|
*/ |
286 |
|
public void testAdd5() { |
287 |
< |
Set full = populatedSet(3); |
287 |
> |
Set<Item> full = populatedSet(3); |
288 |
|
try { |
289 |
|
full.add(null); |
290 |
|
shouldThrow(); |
295 |
|
* KeySetView.getMappedValue returns the map's mapped value |
296 |
|
*/ |
297 |
|
public void testGetMappedValue() { |
298 |
< |
ConcurrentHashMap map = map5(); |
298 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
299 |
|
assertNull(map.keySet().getMappedValue()); |
300 |
+ |
String added = "added"; |
301 |
|
try { |
302 |
|
map.keySet(null); |
303 |
|
shouldThrow(); |
304 |
|
} catch (NullPointerException success) {} |
305 |
< |
ConcurrentHashMap.KeySetView set = map.keySet(one); |
305 |
> |
ConcurrentHashMap.KeySetView<Item,String> set = map.keySet(added); |
306 |
|
assertFalse(set.add(one)); |
307 |
|
assertTrue(set.add(six)); |
308 |
|
assertTrue(set.add(seven)); |
309 |
< |
assertSame(one, set.getMappedValue()); |
310 |
< |
assertNotSame(one, map.get(one)); |
311 |
< |
assertSame(one, map.get(six)); |
312 |
< |
assertSame(one, map.get(seven)); |
309 |
> |
assertSame(added, set.getMappedValue()); |
310 |
> |
assertNotSame(added, map.get(one)); |
311 |
> |
assertSame(added, map.get(six)); |
312 |
> |
assertSame(added, map.get(seven)); |
313 |
|
} |
314 |
|
|
315 |
|
void checkSpliteratorCharacteristics(Spliterator<?> sp, |
316 |
|
int requiredCharacteristics) { |
317 |
< |
assertEquals(requiredCharacteristics, |
317 |
> |
mustEqual(requiredCharacteristics, |
318 |
|
requiredCharacteristics & sp.characteristics()); |
319 |
|
} |
320 |
|
|
323 |
|
*/ |
324 |
|
public void testKeySetSpliterator() { |
325 |
|
LongAdder adder = new LongAdder(); |
326 |
< |
ConcurrentHashMap map = map5(); |
327 |
< |
Set set = map.keySet(); |
328 |
< |
Spliterator<Integer> sp = set.spliterator(); |
326 |
> |
ConcurrentHashMap<Item,String> map = map5(); |
327 |
> |
Set<Item> set = map.keySet(); |
328 |
> |
Spliterator<Item> sp = set.spliterator(); |
329 |
|
checkSpliteratorCharacteristics(sp, CONCURRENT | DISTINCT | NONNULL); |
330 |
< |
assertEquals(sp.estimateSize(), map.size()); |
331 |
< |
Spliterator<Integer> sp2 = sp.trySplit(); |
332 |
< |
sp.forEachRemaining((Integer x) -> adder.add(x.longValue())); |
330 |
> |
mustEqual(sp.estimateSize(), map.size()); |
331 |
> |
Spliterator<Item> sp2 = sp.trySplit(); |
332 |
> |
sp.forEachRemaining((Item x) -> adder.add(x.longValue())); |
333 |
|
long v = adder.sumThenReset(); |
334 |
< |
sp2.forEachRemaining((Integer x) -> adder.add(x.longValue())); |
334 |
> |
sp2.forEachRemaining((Item x) -> adder.add(x.longValue())); |
335 |
|
long v2 = adder.sum(); |
336 |
< |
assertEquals(v + v2, 15); |
336 |
> |
mustEqual(v + v2, 15); |
337 |
|
} |
338 |
|
|
339 |
|
/** |
340 |
|
* keyset.clear removes all elements from the set |
341 |
|
*/ |
342 |
|
public void testClear() { |
343 |
< |
Set full = populatedSet(3); |
343 |
> |
Set<Item> full = populatedSet(3); |
344 |
|
full.clear(); |
345 |
< |
assertEquals(0, full.size()); |
345 |
> |
mustEqual(0, full.size()); |
346 |
|
} |
347 |
|
|
348 |
|
/** |
349 |
|
* keyset.contains returns true for added elements |
350 |
|
*/ |
351 |
|
public void testContains() { |
352 |
< |
Set full = populatedSet(3); |
353 |
< |
assertTrue(full.contains(one)); |
354 |
< |
assertFalse(full.contains(five)); |
352 |
> |
Set<Item> full = populatedSet(3); |
353 |
> |
mustContain(full, one); |
354 |
> |
mustNotContain(full, five); |
355 |
|
} |
356 |
|
|
357 |
|
/** |
358 |
|
* KeySets with equal elements are equal |
359 |
|
*/ |
360 |
|
public void testEquals() { |
361 |
< |
Set a = populatedSet(3); |
362 |
< |
Set b = populatedSet(3); |
361 |
> |
Set<Item> a = populatedSet(3); |
362 |
> |
Set<Item> b = populatedSet(3); |
363 |
|
assertTrue(a.equals(b)); |
364 |
|
assertTrue(b.equals(a)); |
365 |
< |
assertEquals(a.hashCode(), b.hashCode()); |
366 |
< |
a.add(m1); |
365 |
> |
mustEqual(a.hashCode(), b.hashCode()); |
366 |
> |
a.add(minusOne); |
367 |
|
assertFalse(a.equals(b)); |
368 |
|
assertFalse(b.equals(a)); |
369 |
< |
b.add(m1); |
369 |
> |
b.add(minusOne); |
370 |
|
assertTrue(a.equals(b)); |
371 |
|
assertTrue(b.equals(a)); |
372 |
< |
assertEquals(a.hashCode(), b.hashCode()); |
372 |
> |
mustEqual(a.hashCode(), b.hashCode()); |
373 |
|
} |
374 |
|
|
375 |
|
/** |
376 |
|
* KeySet.containsAll returns true for collections with subset of elements |
377 |
|
*/ |
378 |
|
public void testContainsAll() { |
379 |
< |
Collection full = populatedSet(3); |
379 |
> |
Collection<Item> full = populatedSet(3); |
380 |
|
assertTrue(full.containsAll(Arrays.asList())); |
381 |
|
assertTrue(full.containsAll(Arrays.asList(one))); |
382 |
|
assertTrue(full.containsAll(Arrays.asList(one, two))); |
397 |
|
* set |
398 |
|
*/ |
399 |
|
public void testIterator() { |
400 |
< |
Collection empty = ConcurrentHashMap.newKeySet(); |
400 |
> |
Collection<Item> empty = ConcurrentHashMap.<Item>newKeySet(); |
401 |
|
int size = 20; |
402 |
|
assertFalse(empty.iterator().hasNext()); |
403 |
|
try { |
405 |
|
shouldThrow(); |
406 |
|
} catch (NoSuchElementException success) {} |
407 |
|
|
408 |
< |
Integer[] elements = new Integer[size]; |
408 |
< |
for (int i = 0; i < size; i++) |
409 |
< |
elements[i] = i; |
408 |
> |
Item[] elements = seqItems(size); |
409 |
|
shuffle(elements); |
410 |
< |
Collection<Integer> full = populatedSet(elements); |
410 |
> |
Collection<Item> full = populatedSet(elements); |
411 |
|
|
412 |
< |
Iterator it = full.iterator(); |
412 |
> |
Iterator<? extends Item> it = full.iterator(); |
413 |
|
for (int j = 0; j < size; j++) { |
414 |
|
assertTrue(it.hasNext()); |
415 |
|
it.next(); |
422 |
|
*/ |
423 |
|
public void testEmptyIterator() { |
424 |
|
assertIteratorExhausted(ConcurrentHashMap.newKeySet().iterator()); |
425 |
< |
assertIteratorExhausted(new ConcurrentHashMap().entrySet().iterator()); |
426 |
< |
assertIteratorExhausted(new ConcurrentHashMap().values().iterator()); |
427 |
< |
assertIteratorExhausted(new ConcurrentHashMap().keySet().iterator()); |
425 |
> |
assertIteratorExhausted(new ConcurrentHashMap<Item,String>().entrySet().iterator()); |
426 |
> |
assertIteratorExhausted(new ConcurrentHashMap<Item,String>().values().iterator()); |
427 |
> |
assertIteratorExhausted(new ConcurrentHashMap<Item,String>().keySet().iterator()); |
428 |
|
} |
429 |
|
|
430 |
|
/** |
431 |
|
* KeySet.iterator.remove removes current element |
432 |
|
*/ |
433 |
|
public void testIteratorRemove() { |
434 |
< |
Set q = populatedSet(3); |
435 |
< |
Iterator it = q.iterator(); |
434 |
> |
Set<Item> q = populatedSet(3); |
435 |
> |
Iterator<Item> it = q.iterator(); |
436 |
|
Object removed = it.next(); |
437 |
|
it.remove(); |
438 |
|
|
446 |
|
* KeySet.toString holds toString of elements |
447 |
|
*/ |
448 |
|
public void testToString() { |
449 |
< |
assertEquals("[]", ConcurrentHashMap.newKeySet().toString()); |
450 |
< |
Set full = populatedSet(3); |
449 |
> |
mustEqual("[]", ConcurrentHashMap.newKeySet().toString()); |
450 |
> |
Set<Item> full = populatedSet(3); |
451 |
|
String s = full.toString(); |
452 |
|
for (int i = 0; i < 3; ++i) |
453 |
|
assertTrue(s.contains(String.valueOf(i))); |
457 |
|
* KeySet.removeAll removes all elements from the given collection |
458 |
|
*/ |
459 |
|
public void testRemoveAll() { |
460 |
< |
Set full = populatedSet(3); |
460 |
> |
Set<Item> full = populatedSet(3); |
461 |
|
assertTrue(full.removeAll(Arrays.asList(one, two))); |
462 |
< |
assertEquals(1, full.size()); |
462 |
> |
mustEqual(1, full.size()); |
463 |
|
assertFalse(full.removeAll(Arrays.asList(one, two))); |
464 |
< |
assertEquals(1, full.size()); |
464 |
> |
mustEqual(1, full.size()); |
465 |
|
} |
466 |
|
|
467 |
|
/** |
468 |
|
* KeySet.remove removes an element |
469 |
|
*/ |
470 |
|
public void testRemove() { |
471 |
< |
Set full = populatedSet(3); |
471 |
> |
Set<Item> full = populatedSet(3); |
472 |
|
full.remove(one); |
473 |
< |
assertFalse(full.contains(one)); |
474 |
< |
assertEquals(2, full.size()); |
473 |
> |
mustNotContain(full, one); |
474 |
> |
mustEqual(2, full.size()); |
475 |
|
} |
476 |
|
|
477 |
|
/** |
478 |
|
* keySet.size returns the number of elements |
479 |
|
*/ |
480 |
|
public void testSize() { |
481 |
< |
Set empty = ConcurrentHashMap.newKeySet(); |
482 |
< |
Set full = populatedSet(3); |
483 |
< |
assertEquals(3, full.size()); |
484 |
< |
assertEquals(0, empty.size()); |
481 |
> |
Set<Item> empty = ConcurrentHashMap.newKeySet(); |
482 |
> |
Set<Item> full = populatedSet(3); |
483 |
> |
mustEqual(3, full.size()); |
484 |
> |
mustEqual(0, empty.size()); |
485 |
|
} |
486 |
|
|
487 |
|
/** |
493 |
|
assertTrue(Arrays.equals(new Object[0], a)); |
494 |
|
assertSame(Object[].class, a.getClass()); |
495 |
|
int size = 20; |
496 |
< |
Integer[] elements = new Integer[size]; |
498 |
< |
for (int i = 0; i < size; i++) |
499 |
< |
elements[i] = i; |
496 |
> |
Item[] elements = seqItems(size); |
497 |
|
shuffle(elements); |
498 |
< |
Collection<Integer> full = populatedSet(elements); |
498 |
> |
Collection<Item> full = populatedSet(elements); |
499 |
|
|
500 |
|
assertTrue(Arrays.asList(elements).containsAll(Arrays.asList(full.toArray()))); |
501 |
|
assertTrue(full.containsAll(Arrays.asList(full.toArray()))); |
503 |
|
} |
504 |
|
|
505 |
|
/** |
506 |
< |
* toArray(Integer array) returns an Integer array containing all |
506 |
> |
* toArray(Item array) returns an Item array containing all |
507 |
|
* elements from the set |
508 |
|
*/ |
509 |
|
public void testToArray2() { |
510 |
< |
Collection empty = ConcurrentHashMap.newKeySet(); |
511 |
< |
Integer[] a; |
510 |
> |
Collection<Item> empty = ConcurrentHashMap.<Item>newKeySet(); |
511 |
> |
Item[] a; |
512 |
|
int size = 20; |
513 |
|
|
514 |
< |
a = new Integer[0]; |
514 |
> |
a = new Item[0]; |
515 |
|
assertSame(a, empty.toArray(a)); |
516 |
|
|
517 |
< |
a = new Integer[size / 2]; |
518 |
< |
Arrays.fill(a, 42); |
517 |
> |
a = new Item[size / 2]; |
518 |
> |
Arrays.fill(a, fortytwo); |
519 |
|
assertSame(a, empty.toArray(a)); |
520 |
|
assertNull(a[0]); |
521 |
|
for (int i = 1; i < a.length; i++) |
522 |
< |
assertEquals(42, (int) a[i]); |
522 |
> |
mustEqual(42, a[i]); |
523 |
|
|
524 |
< |
Integer[] elements = new Integer[size]; |
528 |
< |
for (int i = 0; i < size; i++) |
529 |
< |
elements[i] = i; |
524 |
> |
Item[] elements = seqItems(size); |
525 |
|
shuffle(elements); |
526 |
< |
Collection<Integer> full = populatedSet(elements); |
526 |
> |
Collection<Item> full = populatedSet(elements); |
527 |
|
|
528 |
< |
Arrays.fill(a, 42); |
528 |
> |
Arrays.fill(a, fortytwo); |
529 |
|
assertTrue(Arrays.asList(elements).containsAll(Arrays.asList(full.toArray(a)))); |
530 |
|
for (int i = 0; i < a.length; i++) |
531 |
< |
assertEquals(42, (int) a[i]); |
532 |
< |
assertSame(Integer[].class, full.toArray(a).getClass()); |
531 |
> |
mustEqual(42, a[i]); |
532 |
> |
assertSame(Item[].class, full.toArray(a).getClass()); |
533 |
|
|
534 |
< |
a = new Integer[size]; |
535 |
< |
Arrays.fill(a, 42); |
534 |
> |
a = new Item[size]; |
535 |
> |
Arrays.fill(a, fortytwo); |
536 |
|
assertSame(a, full.toArray(a)); |
537 |
|
assertTrue(Arrays.asList(elements).containsAll(Arrays.asList(full.toArray(a)))); |
538 |
|
} |
542 |
|
*/ |
543 |
|
public void testSerialization() throws Exception { |
544 |
|
int size = 20; |
545 |
< |
Set x = populatedSet(size); |
546 |
< |
Set y = serialClone(x); |
545 |
> |
Set<Item> x = populatedSet(size); |
546 |
> |
Set<Item> y = serialClone(x); |
547 |
|
|
548 |
|
assertNotSame(x, y); |
549 |
< |
assertEquals(x.size(), y.size()); |
550 |
< |
assertEquals(x, y); |
551 |
< |
assertEquals(y, x); |
549 |
> |
mustEqual(x.size(), y.size()); |
550 |
> |
mustEqual(x, y); |
551 |
> |
mustEqual(y, x); |
552 |
|
} |
553 |
|
|
554 |
|
static final int SIZE = 10000; |
579 |
|
LongAdder adder = new LongAdder(); |
580 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
581 |
|
m.forEachKey(Long.MAX_VALUE, (Long x) -> adder.add(x.longValue())); |
582 |
< |
assertEquals(adder.sum(), SIZE * (SIZE - 1) / 2); |
582 |
> |
mustEqual(adder.sum(), SIZE * (SIZE - 1) / 2); |
583 |
|
} |
584 |
|
|
585 |
|
/** |
589 |
|
LongAdder adder = new LongAdder(); |
590 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
591 |
|
m.forEachValue(Long.MAX_VALUE, (Long x) -> adder.add(x.longValue())); |
592 |
< |
assertEquals(adder.sum(), SIZE * (SIZE - 1)); |
592 |
> |
mustEqual(adder.sum(), SIZE * (SIZE - 1)); |
593 |
|
} |
594 |
|
|
595 |
|
/** |
599 |
|
LongAdder adder = new LongAdder(); |
600 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
601 |
|
m.forEach(Long.MAX_VALUE, (Long x, Long y) -> adder.add(x.longValue() + y.longValue())); |
602 |
< |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
602 |
> |
mustEqual(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
603 |
|
} |
604 |
|
|
605 |
|
/** |
609 |
|
LongAdder adder = new LongAdder(); |
610 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
611 |
|
m.forEachEntry(Long.MAX_VALUE, (Map.Entry<Long,Long> e) -> adder.add(e.getKey().longValue() + e.getValue().longValue())); |
612 |
< |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
612 |
> |
mustEqual(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
613 |
|
} |
614 |
|
|
615 |
|
/** |
619 |
|
LongAdder adder = new LongAdder(); |
620 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
621 |
|
m.forEachKey(1L, (Long x) -> adder.add(x.longValue())); |
622 |
< |
assertEquals(adder.sum(), SIZE * (SIZE - 1) / 2); |
622 |
> |
mustEqual(adder.sum(), SIZE * (SIZE - 1) / 2); |
623 |
|
} |
624 |
|
|
625 |
|
/** |
629 |
|
LongAdder adder = new LongAdder(); |
630 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
631 |
|
m.forEachValue(1L, (Long x) -> adder.add(x.longValue())); |
632 |
< |
assertEquals(adder.sum(), SIZE * (SIZE - 1)); |
632 |
> |
mustEqual(adder.sum(), SIZE * (SIZE - 1)); |
633 |
|
} |
634 |
|
|
635 |
|
/** |
639 |
|
LongAdder adder = new LongAdder(); |
640 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
641 |
|
m.forEach(1L, (Long x, Long y) -> adder.add(x.longValue() + y.longValue())); |
642 |
< |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
642 |
> |
mustEqual(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
643 |
|
} |
644 |
|
|
645 |
|
/** |
649 |
|
LongAdder adder = new LongAdder(); |
650 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
651 |
|
m.forEachEntry(1L, (Map.Entry<Long,Long> e) -> adder.add(e.getKey().longValue() + e.getValue().longValue())); |
652 |
< |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
652 |
> |
mustEqual(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
653 |
|
} |
654 |
|
|
655 |
|
/** |
661 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
662 |
|
m.forEachKey(Long.MAX_VALUE, (Long x) -> Long.valueOf(4 * x.longValue()), |
663 |
|
(Long x) -> adder.add(x.longValue())); |
664 |
< |
assertEquals(adder.sum(), 4 * SIZE * (SIZE - 1) / 2); |
664 |
> |
mustEqual(adder.sum(), 4 * SIZE * (SIZE - 1) / 2); |
665 |
|
} |
666 |
|
|
667 |
|
/** |
673 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
674 |
|
m.forEachValue(Long.MAX_VALUE, (Long x) -> Long.valueOf(4 * x.longValue()), |
675 |
|
(Long x) -> adder.add(x.longValue())); |
676 |
< |
assertEquals(adder.sum(), 4 * SIZE * (SIZE - 1)); |
676 |
> |
mustEqual(adder.sum(), 4 * SIZE * (SIZE - 1)); |
677 |
|
} |
678 |
|
|
679 |
|
/** |
685 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
686 |
|
m.forEach(Long.MAX_VALUE, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
687 |
|
(Long x) -> adder.add(x.longValue())); |
688 |
< |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
688 |
> |
mustEqual(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
689 |
|
} |
690 |
|
|
691 |
|
/** |
697 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
698 |
|
m.forEachEntry(Long.MAX_VALUE, (Map.Entry<Long,Long> e) -> Long.valueOf(e.getKey().longValue() + e.getValue().longValue()), |
699 |
|
(Long x) -> adder.add(x.longValue())); |
700 |
< |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
700 |
> |
mustEqual(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
701 |
|
} |
702 |
|
|
703 |
|
/** |
709 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
710 |
|
m.forEachKey(1L, (Long x) -> Long.valueOf(4 * x.longValue()), |
711 |
|
(Long x) -> adder.add(x.longValue())); |
712 |
< |
assertEquals(adder.sum(), 4 * SIZE * (SIZE - 1) / 2); |
712 |
> |
mustEqual(adder.sum(), 4 * SIZE * (SIZE - 1) / 2); |
713 |
|
} |
714 |
|
|
715 |
|
/** |
721 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
722 |
|
m.forEachValue(1L, (Long x) -> Long.valueOf(4 * x.longValue()), |
723 |
|
(Long x) -> adder.add(x.longValue())); |
724 |
< |
assertEquals(adder.sum(), 4 * SIZE * (SIZE - 1)); |
724 |
> |
mustEqual(adder.sum(), 4 * SIZE * (SIZE - 1)); |
725 |
|
} |
726 |
|
|
727 |
|
/** |
733 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
734 |
|
m.forEach(1L, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
735 |
|
(Long x) -> adder.add(x.longValue())); |
736 |
< |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
736 |
> |
mustEqual(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
737 |
|
} |
738 |
|
|
739 |
|
/** |
745 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
746 |
|
m.forEachEntry(1L, (Map.Entry<Long,Long> e) -> Long.valueOf(e.getKey().longValue() + e.getValue().longValue()), |
747 |
|
(Long x) -> adder.add(x.longValue())); |
748 |
< |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
748 |
> |
mustEqual(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
749 |
|
} |
750 |
|
|
751 |
|
/** |
755 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
756 |
|
Long r; |
757 |
|
r = m.reduceKeys(Long.MAX_VALUE, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
758 |
< |
assertEquals((long)r, (long)SIZE * (SIZE - 1) / 2); |
758 |
> |
mustEqual((long)r, (long)SIZE * (SIZE - 1) / 2); |
759 |
|
} |
760 |
|
|
761 |
|
/** |
765 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
766 |
|
Long r; |
767 |
|
r = m.reduceKeys(Long.MAX_VALUE, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
768 |
< |
assertEquals((long)r, (long)SIZE * (SIZE - 1) / 2); |
768 |
> |
mustEqual((long)r, (long)SIZE * (SIZE - 1) / 2); |
769 |
|
} |
770 |
|
|
771 |
|
/** |
775 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
776 |
|
Map.Entry<Long,Long> r; |
777 |
|
r = m.reduceEntries(Long.MAX_VALUE, new AddKeys()); |
778 |
< |
assertEquals(r.getKey().longValue(), (long)SIZE * (SIZE - 1) / 2); |
778 |
> |
mustEqual(r.getKey().longValue(), (long)SIZE * (SIZE - 1) / 2); |
779 |
|
} |
780 |
|
|
781 |
|
/** |
785 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
786 |
|
Long r; |
787 |
|
r = m.reduceKeys(1L, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
788 |
< |
assertEquals((long)r, (long)SIZE * (SIZE - 1) / 2); |
788 |
> |
mustEqual((long)r, (long)SIZE * (SIZE - 1) / 2); |
789 |
|
} |
790 |
|
|
791 |
|
/** |
795 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
796 |
|
Long r; |
797 |
|
r = m.reduceValues(1L, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
798 |
< |
assertEquals((long)r, (long)SIZE * (SIZE - 1)); |
798 |
> |
mustEqual((long)r, (long)SIZE * (SIZE - 1)); |
799 |
|
} |
800 |
|
|
801 |
|
/** |
805 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
806 |
|
Map.Entry<Long,Long> r; |
807 |
|
r = m.reduceEntries(1L, new AddKeys()); |
808 |
< |
assertEquals(r.getKey().longValue(), (long)SIZE * (SIZE - 1) / 2); |
808 |
> |
mustEqual(r.getKey().longValue(), (long)SIZE * (SIZE - 1) / 2); |
809 |
|
} |
810 |
|
|
811 |
|
/** |
815 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
816 |
|
Long r = m.reduceKeys(Long.MAX_VALUE, (Long x) -> Long.valueOf(4 * x.longValue()), |
817 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
818 |
< |
assertEquals((long)r, (long)4 * SIZE * (SIZE - 1) / 2); |
818 |
> |
mustEqual((long)r, (long)4 * SIZE * (SIZE - 1) / 2); |
819 |
|
} |
820 |
|
|
821 |
|
/** |
825 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
826 |
|
Long r = m.reduceValues(Long.MAX_VALUE, (Long x) -> Long.valueOf(4 * x.longValue()), |
827 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
828 |
< |
assertEquals((long)r, (long)4 * SIZE * (SIZE - 1)); |
828 |
> |
mustEqual((long)r, (long)4 * SIZE * (SIZE - 1)); |
829 |
|
} |
830 |
|
|
831 |
|
/** |
836 |
|
Long r = m.reduce(Long.MAX_VALUE, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
837 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
838 |
|
|
839 |
< |
assertEquals((long)r, (long)3 * SIZE * (SIZE - 1) / 2); |
839 |
> |
mustEqual((long)r, (long)3 * SIZE * (SIZE - 1) / 2); |
840 |
|
} |
841 |
|
|
842 |
|
/** |
846 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
847 |
|
Long r = m.reduceKeys(1L, (Long x) -> Long.valueOf(4 * x.longValue()), |
848 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
849 |
< |
assertEquals((long)r, (long)4 * SIZE * (SIZE - 1) / 2); |
849 |
> |
mustEqual((long)r, (long)4 * SIZE * (SIZE - 1) / 2); |
850 |
|
} |
851 |
|
|
852 |
|
/** |
856 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
857 |
|
Long r = m.reduceValues(1L, (Long x) -> Long.valueOf(4 * x.longValue()), |
858 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
859 |
< |
assertEquals((long)r, (long)4 * SIZE * (SIZE - 1)); |
859 |
> |
mustEqual((long)r, (long)4 * SIZE * (SIZE - 1)); |
860 |
|
} |
861 |
|
|
862 |
|
/** |
867 |
|
Long r; |
868 |
|
r = m.reduce(1L, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
869 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
870 |
< |
assertEquals((long)r, (long)3 * SIZE * (SIZE - 1) / 2); |
870 |
> |
mustEqual((long)r, (long)3 * SIZE * (SIZE - 1) / 2); |
871 |
|
} |
872 |
|
|
873 |
|
/** |
876 |
|
public void testReduceKeysToLongSequentially() { |
877 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
878 |
|
long lr = m.reduceKeysToLong(Long.MAX_VALUE, (Long x) -> x.longValue(), 0L, Long::sum); |
879 |
< |
assertEquals(lr, (long)SIZE * (SIZE - 1) / 2); |
879 |
> |
mustEqual(lr, (long)SIZE * (SIZE - 1) / 2); |
880 |
|
} |
881 |
|
|
882 |
|
/** |
885 |
|
public void testReduceKeysToIntSequentially() { |
886 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
887 |
|
int ir = m.reduceKeysToInt(Long.MAX_VALUE, (Long x) -> x.intValue(), 0, Integer::sum); |
888 |
< |
assertEquals(ir, SIZE * (SIZE - 1) / 2); |
888 |
> |
mustEqual(ir, SIZE * (SIZE - 1) / 2); |
889 |
|
} |
890 |
|
|
891 |
|
/** |
894 |
|
public void testReduceKeysToDoubleSequentially() { |
895 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
896 |
|
double dr = m.reduceKeysToDouble(Long.MAX_VALUE, (Long x) -> x.doubleValue(), 0.0, Double::sum); |
897 |
< |
assertEquals(dr, (double)SIZE * (SIZE - 1) / 2); |
897 |
> |
mustEqual(dr, (double)SIZE * (SIZE - 1) / 2); |
898 |
|
} |
899 |
|
|
900 |
|
/** |
903 |
|
public void testReduceValuesToLongSequentially() { |
904 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
905 |
|
long lr = m.reduceValuesToLong(Long.MAX_VALUE, (Long x) -> x.longValue(), 0L, Long::sum); |
906 |
< |
assertEquals(lr, (long)SIZE * (SIZE - 1)); |
906 |
> |
mustEqual(lr, (long)SIZE * (SIZE - 1)); |
907 |
|
} |
908 |
|
|
909 |
|
/** |
912 |
|
public void testReduceValuesToIntSequentially() { |
913 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
914 |
|
int ir = m.reduceValuesToInt(Long.MAX_VALUE, (Long x) -> x.intValue(), 0, Integer::sum); |
915 |
< |
assertEquals(ir, SIZE * (SIZE - 1)); |
915 |
> |
mustEqual(ir, SIZE * (SIZE - 1)); |
916 |
|
} |
917 |
|
|
918 |
|
/** |
921 |
|
public void testReduceValuesToDoubleSequentially() { |
922 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
923 |
|
double dr = m.reduceValuesToDouble(Long.MAX_VALUE, (Long x) -> x.doubleValue(), 0.0, Double::sum); |
924 |
< |
assertEquals(dr, (double)SIZE * (SIZE - 1)); |
924 |
> |
mustEqual(dr, (double)SIZE * (SIZE - 1)); |
925 |
|
} |
926 |
|
|
927 |
|
/** |
930 |
|
public void testReduceKeysToLongInParallel() { |
931 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
932 |
|
long lr = m.reduceKeysToLong(1L, (Long x) -> x.longValue(), 0L, Long::sum); |
933 |
< |
assertEquals(lr, (long)SIZE * (SIZE - 1) / 2); |
933 |
> |
mustEqual(lr, (long)SIZE * (SIZE - 1) / 2); |
934 |
|
} |
935 |
|
|
936 |
|
/** |
939 |
|
public void testReduceKeysToIntInParallel() { |
940 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
941 |
|
int ir = m.reduceKeysToInt(1L, (Long x) -> x.intValue(), 0, Integer::sum); |
942 |
< |
assertEquals(ir, SIZE * (SIZE - 1) / 2); |
942 |
> |
mustEqual(ir, SIZE * (SIZE - 1) / 2); |
943 |
|
} |
944 |
|
|
945 |
|
/** |
948 |
|
public void testReduceKeysToDoubleInParallel() { |
949 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
950 |
|
double dr = m.reduceKeysToDouble(1L, (Long x) -> x.doubleValue(), 0.0, Double::sum); |
951 |
< |
assertEquals(dr, (double)SIZE * (SIZE - 1) / 2); |
951 |
> |
mustEqual(dr, (double)SIZE * (SIZE - 1) / 2); |
952 |
|
} |
953 |
|
|
954 |
|
/** |
957 |
|
public void testReduceValuesToLongInParallel() { |
958 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
959 |
|
long lr = m.reduceValuesToLong(1L, (Long x) -> x.longValue(), 0L, Long::sum); |
960 |
< |
assertEquals(lr, (long)SIZE * (SIZE - 1)); |
960 |
> |
mustEqual(lr, (long)SIZE * (SIZE - 1)); |
961 |
|
} |
962 |
|
|
963 |
|
/** |
966 |
|
public void testReduceValuesToIntInParallel() { |
967 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
968 |
|
int ir = m.reduceValuesToInt(1L, (Long x) -> x.intValue(), 0, Integer::sum); |
969 |
< |
assertEquals(ir, SIZE * (SIZE - 1)); |
969 |
> |
mustEqual(ir, SIZE * (SIZE - 1)); |
970 |
|
} |
971 |
|
|
972 |
|
/** |
975 |
|
public void testReduceValuesToDoubleInParallel() { |
976 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
977 |
|
double dr = m.reduceValuesToDouble(1L, (Long x) -> x.doubleValue(), 0.0, Double::sum); |
978 |
< |
assertEquals(dr, (double)SIZE * (SIZE - 1)); |
978 |
> |
mustEqual(dr, (double)SIZE * (SIZE - 1)); |
979 |
|
} |
980 |
|
|
981 |
|
/** |
986 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
987 |
|
Long r; |
988 |
|
r = m.searchKeys(Long.MAX_VALUE, (Long x) -> x.longValue() == (long)(SIZE/2) ? x : null); |
989 |
< |
assertEquals((long)r, (long)(SIZE/2)); |
989 |
> |
mustEqual((long)r, (long)(SIZE/2)); |
990 |
|
r = m.searchKeys(Long.MAX_VALUE, (Long x) -> x.longValue() < 0L ? x : null); |
991 |
|
assertNull(r); |
992 |
|
} |
1000 |
|
Long r; |
1001 |
|
r = m.searchValues(Long.MAX_VALUE, |
1002 |
|
(Long x) -> (x.longValue() == (long)(SIZE/2)) ? x : null); |
1003 |
< |
assertEquals((long)r, (long)(SIZE/2)); |
1003 |
> |
mustEqual((long)r, (long)(SIZE/2)); |
1004 |
|
r = m.searchValues(Long.MAX_VALUE, |
1005 |
|
(Long x) -> (x.longValue() < 0L) ? x : null); |
1006 |
|
assertNull(r); |
1014 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1015 |
|
Long r; |
1016 |
|
r = m.search(Long.MAX_VALUE, (Long x, Long y) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1017 |
< |
assertEquals((long)r, (long)(SIZE/2)); |
1017 |
> |
mustEqual((long)r, (long)(SIZE/2)); |
1018 |
|
r = m.search(Long.MAX_VALUE, (Long x, Long y) -> x.longValue() < 0L ? x : null); |
1019 |
|
assertNull(r); |
1020 |
|
} |
1027 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1028 |
|
Long r; |
1029 |
|
r = m.searchEntries(Long.MAX_VALUE, (Map.Entry<Long,Long> e) -> e.getKey().longValue() == (long)(SIZE/2) ? e.getKey() : null); |
1030 |
< |
assertEquals((long)r, (long)(SIZE/2)); |
1030 |
> |
mustEqual((long)r, (long)(SIZE/2)); |
1031 |
|
r = m.searchEntries(Long.MAX_VALUE, (Map.Entry<Long,Long> e) -> e.getKey().longValue() < 0L ? e.getKey() : null); |
1032 |
|
assertNull(r); |
1033 |
|
} |
1040 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1041 |
|
Long r; |
1042 |
|
r = m.searchKeys(1L, (Long x) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1043 |
< |
assertEquals((long)r, (long)(SIZE/2)); |
1043 |
> |
mustEqual((long)r, (long)(SIZE/2)); |
1044 |
|
r = m.searchKeys(1L, (Long x) -> x.longValue() < 0L ? x : null); |
1045 |
|
assertNull(r); |
1046 |
|
} |
1053 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1054 |
|
Long r; |
1055 |
|
r = m.searchValues(1L, (Long x) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1056 |
< |
assertEquals((long)r, (long)(SIZE/2)); |
1056 |
> |
mustEqual((long)r, (long)(SIZE/2)); |
1057 |
|
r = m.searchValues(1L, (Long x) -> x.longValue() < 0L ? x : null); |
1058 |
|
assertNull(r); |
1059 |
|
} |
1066 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1067 |
|
Long r; |
1068 |
|
r = m.search(1L, (Long x, Long y) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1069 |
< |
assertEquals((long)r, (long)(SIZE/2)); |
1069 |
> |
mustEqual((long)r, (long)(SIZE/2)); |
1070 |
|
r = m.search(1L, (Long x, Long y) -> x.longValue() < 0L ? x : null); |
1071 |
|
assertNull(r); |
1072 |
|
} |
1079 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1080 |
|
Long r; |
1081 |
|
r = m.searchEntries(1L, (Map.Entry<Long,Long> e) -> e.getKey().longValue() == (long)(SIZE/2) ? e.getKey() : null); |
1082 |
< |
assertEquals((long)r, (long)(SIZE/2)); |
1082 |
> |
mustEqual((long)r, (long)(SIZE/2)); |
1083 |
|
r = m.searchEntries(1L, (Map.Entry<Long,Long> e) -> e.getKey().longValue() < 0L ? e.getKey() : null); |
1084 |
|
assertNull(r); |
1085 |
|
} |
1093 |
|
final int mapSize = 20; |
1094 |
|
final int iterations = expensiveTests ? (1 << 23) : mapSize * 2; |
1095 |
|
final int threads = expensiveTests ? 10 : 2; |
1096 |
< |
final ConcurrentHashMap<Integer, Integer> map = new ConcurrentHashMap<>(); |
1097 |
< |
for (int i = 0; i < mapSize; i++) |
1098 |
< |
map.put(i, i); |
1096 |
> |
final ConcurrentHashMap<Item, Item> map = new ConcurrentHashMap<>(); |
1097 |
> |
for (int i = 0; i < mapSize; i++) { |
1098 |
> |
Item I = itemFor(i); |
1099 |
> |
map.put(I, I); |
1100 |
> |
} |
1101 |
|
final ExecutorService pool = Executors.newFixedThreadPool(2); |
1102 |
|
try (PoolCleaner cleaner = cleaner(pool)) { |
1103 |
|
Runnable r = new CheckedRunnable() { |
1104 |
|
public void realRun() { |
1105 |
|
int result = 0; |
1106 |
|
for (int i = 0; i < iterations; i++) |
1107 |
< |
result += map.computeIfAbsent(i % mapSize, k -> k + k); |
1107 |
> |
result += map.computeIfAbsent(itemFor(i % mapSize), k -> itemFor(k.value * 2)).value; |
1108 |
|
if (result == -42) throw new Error(); |
1109 |
|
}}; |
1110 |
|
for (int i = 0; i < threads; i++) |