4 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
< |
import junit.framework.*; |
8 |
< |
import java.util.*; |
9 |
< |
import java.util.function.*; |
10 |
< |
import java.util.concurrent.atomic.LongAdder; |
7 |
> |
import static java.util.Spliterator.CONCURRENT; |
8 |
> |
import static java.util.Spliterator.DISTINCT; |
9 |
> |
import static java.util.Spliterator.NONNULL; |
10 |
> |
|
11 |
> |
import java.util.AbstractMap; |
12 |
> |
import java.util.Arrays; |
13 |
> |
import java.util.Collection; |
14 |
> |
import java.util.Iterator; |
15 |
> |
import java.util.Map; |
16 |
> |
import java.util.NoSuchElementException; |
17 |
> |
import java.util.Set; |
18 |
> |
import java.util.Spliterator; |
19 |
|
import java.util.concurrent.ConcurrentHashMap; |
20 |
+ |
import java.util.concurrent.atomic.LongAdder; |
21 |
+ |
import java.util.function.BiFunction; |
22 |
+ |
|
23 |
+ |
import junit.framework.Test; |
24 |
+ |
import junit.framework.TestSuite; |
25 |
|
|
26 |
|
public class ConcurrentHashMap8Test extends JSR166TestCase { |
27 |
|
public static void main(String[] args) { |
28 |
< |
junit.textui.TestRunner.run(suite()); |
28 |
> |
main(suite(), args); |
29 |
|
} |
30 |
|
public static Test suite() { |
31 |
|
return new TestSuite(ConcurrentHashMap8Test.class); |
66 |
|
} |
67 |
|
|
68 |
|
/** |
69 |
< |
* computeIfAbsent does not replace if the key is already present |
69 |
> |
* computeIfAbsent does not replace if the key is already present |
70 |
|
*/ |
71 |
|
public void testComputeIfAbsent2() { |
72 |
|
ConcurrentHashMap map = map5(); |
83 |
|
} |
84 |
|
|
85 |
|
/** |
86 |
< |
* computeIfPresent does not replace if the key is already present |
86 |
> |
* computeIfPresent does not replace if the key is already present |
87 |
|
*/ |
88 |
|
public void testComputeIfPresent() { |
89 |
|
ConcurrentHashMap map = map5(); |
100 |
|
} |
101 |
|
|
102 |
|
/** |
103 |
< |
* compute does not replace if the function returns null |
103 |
> |
* compute does not replace if the function returns null |
104 |
|
*/ |
105 |
|
public void testCompute() { |
106 |
|
ConcurrentHashMap map = map5(); |
162 |
|
Set<Integer> a = ConcurrentHashMap.<Integer>newKeySet(); |
163 |
|
assertTrue(a.isEmpty()); |
164 |
|
for (int i = 0; i < n; i++) |
165 |
< |
a.add(i); |
166 |
< |
assertFalse(a.isEmpty()); |
165 |
> |
assertTrue(a.add(i)); |
166 |
> |
assertEquals(n == 0, a.isEmpty()); |
167 |
|
assertEquals(n, a.size()); |
168 |
|
return a; |
169 |
|
} |
172 |
|
Set<Integer> a = ConcurrentHashMap.<Integer>newKeySet(); |
173 |
|
assertTrue(a.isEmpty()); |
174 |
|
for (int i = 0; i < elements.length; i++) |
175 |
< |
a.add(elements[i]); |
175 |
> |
assertTrue(a.add(elements[i])); |
176 |
|
assertFalse(a.isEmpty()); |
177 |
|
assertEquals(elements.length, a.size()); |
178 |
|
return a; |
179 |
|
} |
180 |
|
|
181 |
|
/** |
182 |
+ |
* replaceAll replaces all matching values. |
183 |
+ |
*/ |
184 |
+ |
public void testReplaceAll() { |
185 |
+ |
ConcurrentHashMap<Integer, String> map = map5(); |
186 |
+ |
map.replaceAll((x, y) -> { return x > 3 ? "Z" : y; }); |
187 |
+ |
assertEquals("A", map.get(one)); |
188 |
+ |
assertEquals("B", map.get(two)); |
189 |
+ |
assertEquals("C", map.get(three)); |
190 |
+ |
assertEquals("Z", map.get(four)); |
191 |
+ |
assertEquals("Z", map.get(five)); |
192 |
+ |
} |
193 |
+ |
|
194 |
+ |
/** |
195 |
|
* Default-constructed set is empty |
196 |
|
*/ |
197 |
|
public void testNewKeySet() { |
200 |
|
} |
201 |
|
|
202 |
|
/** |
203 |
+ |
* keySet.add adds the key with the established value to the map; |
204 |
+ |
* remove removes it. |
205 |
+ |
*/ |
206 |
+ |
public void testKeySetAddRemove() { |
207 |
+ |
ConcurrentHashMap map = map5(); |
208 |
+ |
Set set1 = map.keySet(); |
209 |
+ |
Set set2 = map.keySet(true); |
210 |
+ |
set2.add(six); |
211 |
+ |
assertTrue(((ConcurrentHashMap.KeySetView)set2).getMap() == map); |
212 |
+ |
assertTrue(((ConcurrentHashMap.KeySetView)set1).getMap() == map); |
213 |
+ |
assertEquals(set2.size(), map.size()); |
214 |
+ |
assertEquals(set1.size(), map.size()); |
215 |
+ |
assertTrue((Boolean)map.get(six)); |
216 |
+ |
assertTrue(set1.contains(six)); |
217 |
+ |
assertTrue(set2.contains(six)); |
218 |
+ |
set2.remove(six); |
219 |
+ |
assertNull(map.get(six)); |
220 |
+ |
assertFalse(set1.contains(six)); |
221 |
+ |
assertFalse(set2.contains(six)); |
222 |
+ |
} |
223 |
+ |
|
224 |
+ |
/** |
225 |
|
* keySet.addAll adds each element from the given collection |
226 |
|
*/ |
227 |
|
public void testAddAll() { |
228 |
|
Set full = populatedSet(3); |
229 |
< |
Vector v = new Vector(); |
230 |
< |
v.add(three); |
231 |
< |
v.add(four); |
184 |
< |
v.add(five); |
185 |
< |
full.addAll(v); |
229 |
> |
assertTrue(full.addAll(Arrays.asList(three, four, five))); |
230 |
> |
assertEquals(6, full.size()); |
231 |
> |
assertFalse(full.addAll(Arrays.asList(three, four, five))); |
232 |
|
assertEquals(6, full.size()); |
233 |
|
} |
234 |
|
|
238 |
|
*/ |
239 |
|
public void testAddAll2() { |
240 |
|
Set full = populatedSet(3); |
241 |
< |
Vector v = new Vector(); |
242 |
< |
v.add(three); |
243 |
< |
v.add(four); |
244 |
< |
v.add(one); // will not add this element |
199 |
< |
full.addAll(v); |
241 |
> |
// "one" is duplicate and will not be added |
242 |
> |
assertTrue(full.addAll(Arrays.asList(three, four, one))); |
243 |
> |
assertEquals(5, full.size()); |
244 |
> |
assertFalse(full.addAll(Arrays.asList(three, four, one))); |
245 |
|
assertEquals(5, full.size()); |
246 |
|
} |
247 |
|
|
250 |
|
*/ |
251 |
|
public void testAdd2() { |
252 |
|
Set full = populatedSet(3); |
253 |
< |
full.add(one); |
253 |
> |
assertFalse(full.add(one)); |
254 |
|
assertEquals(3, full.size()); |
255 |
|
} |
256 |
|
|
259 |
|
*/ |
260 |
|
public void testAdd3() { |
261 |
|
Set full = populatedSet(3); |
262 |
< |
full.add(three); |
262 |
> |
assertTrue(full.add(three)); |
263 |
> |
assertTrue(full.contains(three)); |
264 |
> |
assertFalse(full.add(three)); |
265 |
|
assertTrue(full.contains(three)); |
266 |
|
} |
267 |
|
|
268 |
|
/** |
269 |
+ |
* keySet.add throws UnsupportedOperationException if no default |
270 |
+ |
* mapped value |
271 |
+ |
*/ |
272 |
+ |
public void testAdd4() { |
273 |
+ |
Set full = map5().keySet(); |
274 |
+ |
try { |
275 |
+ |
full.add(three); |
276 |
+ |
shouldThrow(); |
277 |
+ |
} catch (UnsupportedOperationException success) {} |
278 |
+ |
} |
279 |
+ |
|
280 |
+ |
/** |
281 |
+ |
* keySet.add throws NullPointerException if the specified key is |
282 |
+ |
* null |
283 |
+ |
*/ |
284 |
+ |
public void testAdd5() { |
285 |
+ |
Set full = populatedSet(3); |
286 |
+ |
try { |
287 |
+ |
full.add(null); |
288 |
+ |
shouldThrow(); |
289 |
+ |
} catch (NullPointerException success) {} |
290 |
+ |
} |
291 |
+ |
|
292 |
+ |
/** |
293 |
+ |
* KeySetView.getMappedValue returns the map's mapped value |
294 |
+ |
*/ |
295 |
+ |
public void testGetMappedValue() { |
296 |
+ |
ConcurrentHashMap map = map5(); |
297 |
+ |
assertNull(map.keySet().getMappedValue()); |
298 |
+ |
try { |
299 |
+ |
map.keySet(null); |
300 |
+ |
shouldThrow(); |
301 |
+ |
} catch (NullPointerException success) {} |
302 |
+ |
ConcurrentHashMap.KeySetView set = map.keySet(one); |
303 |
+ |
assertFalse(set.add(one)); |
304 |
+ |
assertTrue(set.add(six)); |
305 |
+ |
assertTrue(set.add(seven)); |
306 |
+ |
assertTrue(set.getMappedValue() == one); |
307 |
+ |
assertTrue(map.get(one) != one); |
308 |
+ |
assertTrue(map.get(six) == one); |
309 |
+ |
assertTrue(map.get(seven) == one); |
310 |
+ |
} |
311 |
+ |
|
312 |
+ |
void checkSpliteratorCharacteristics(Spliterator<?> sp, |
313 |
+ |
int requiredCharacteristics) { |
314 |
+ |
assertEquals(requiredCharacteristics, |
315 |
+ |
requiredCharacteristics & sp.characteristics()); |
316 |
+ |
} |
317 |
+ |
|
318 |
+ |
/** |
319 |
+ |
* KeySetView.spliterator returns spliterator over the elements in this set |
320 |
+ |
*/ |
321 |
+ |
public void testKeySetSpliterator() { |
322 |
+ |
LongAdder adder = new LongAdder(); |
323 |
+ |
ConcurrentHashMap map = map5(); |
324 |
+ |
Set set = map.keySet(); |
325 |
+ |
Spliterator<Integer> sp = set.spliterator(); |
326 |
+ |
checkSpliteratorCharacteristics(sp, CONCURRENT | DISTINCT | NONNULL); |
327 |
+ |
assertEquals(sp.estimateSize(), map.size()); |
328 |
+ |
Spliterator<Integer> sp2 = sp.trySplit(); |
329 |
+ |
sp.forEachRemaining((Integer x) -> adder.add(x.longValue())); |
330 |
+ |
long v = adder.sumThenReset(); |
331 |
+ |
sp2.forEachRemaining((Integer x) -> adder.add(x.longValue())); |
332 |
+ |
long v2 = adder.sum(); |
333 |
+ |
assertEquals(v + v2, 15); |
334 |
+ |
} |
335 |
+ |
|
336 |
+ |
/** |
337 |
|
* keyset.clear removes all elements from the set |
338 |
|
*/ |
339 |
|
public void testClear() { |
373 |
|
* KeySet.containsAll returns true for collections with subset of elements |
374 |
|
*/ |
375 |
|
public void testContainsAll() { |
376 |
< |
Set full = populatedSet(3); |
377 |
< |
Vector v = new Vector(); |
378 |
< |
v.add(one); |
379 |
< |
v.add(two); |
380 |
< |
assertTrue(full.containsAll(v)); |
381 |
< |
v.add(six); |
267 |
< |
assertFalse(full.containsAll(v)); |
376 |
> |
Collection full = populatedSet(3); |
377 |
> |
assertTrue(full.containsAll(Arrays.asList())); |
378 |
> |
assertTrue(full.containsAll(Arrays.asList(one))); |
379 |
> |
assertTrue(full.containsAll(Arrays.asList(one, two))); |
380 |
> |
assertFalse(full.containsAll(Arrays.asList(one, two, six))); |
381 |
> |
assertFalse(full.containsAll(Arrays.asList(six))); |
382 |
|
} |
383 |
|
|
384 |
|
/** |
385 |
|
* KeySet.isEmpty is true when empty, else false |
386 |
|
*/ |
387 |
|
public void testIsEmpty() { |
388 |
< |
Set empty = ConcurrentHashMap.newKeySet(); |
389 |
< |
Set full = populatedSet(3); |
276 |
< |
assertTrue(empty.isEmpty()); |
277 |
< |
assertFalse(full.isEmpty()); |
388 |
> |
assertTrue(populatedSet(0).isEmpty()); |
389 |
> |
assertFalse(populatedSet(3).isEmpty()); |
390 |
|
} |
391 |
|
|
392 |
|
/** |
405 |
|
Integer[] elements = new Integer[size]; |
406 |
|
for (int i = 0; i < size; i++) |
407 |
|
elements[i] = i; |
408 |
< |
Collections.shuffle(Arrays.asList(elements)); |
408 |
> |
shuffle(elements); |
409 |
|
Collection<Integer> full = populatedSet(elements); |
410 |
|
|
411 |
|
Iterator it = full.iterator(); |
413 |
|
assertTrue(it.hasNext()); |
414 |
|
it.next(); |
415 |
|
} |
416 |
< |
assertFalse(it.hasNext()); |
417 |
< |
try { |
418 |
< |
it.next(); |
419 |
< |
shouldThrow(); |
420 |
< |
} catch (NoSuchElementException success) {} |
416 |
> |
assertIteratorExhausted(it); |
417 |
> |
} |
418 |
> |
|
419 |
> |
/** |
420 |
> |
* iterator of empty collections has no elements |
421 |
> |
*/ |
422 |
> |
public void testEmptyIterator() { |
423 |
> |
assertIteratorExhausted(ConcurrentHashMap.newKeySet().iterator()); |
424 |
> |
assertIteratorExhausted(new ConcurrentHashMap().entrySet().iterator()); |
425 |
> |
assertIteratorExhausted(new ConcurrentHashMap().values().iterator()); |
426 |
> |
assertIteratorExhausted(new ConcurrentHashMap().keySet().iterator()); |
427 |
|
} |
428 |
|
|
429 |
|
/** |
457 |
|
*/ |
458 |
|
public void testRemoveAll() { |
459 |
|
Set full = populatedSet(3); |
460 |
< |
Vector v = new Vector(); |
461 |
< |
v.add(one); |
462 |
< |
v.add(two); |
345 |
< |
full.removeAll(v); |
460 |
> |
assertTrue(full.removeAll(Arrays.asList(one, two))); |
461 |
> |
assertEquals(1, full.size()); |
462 |
> |
assertFalse(full.removeAll(Arrays.asList(one, two))); |
463 |
|
assertEquals(1, full.size()); |
464 |
|
} |
465 |
|
|
495 |
|
Integer[] elements = new Integer[size]; |
496 |
|
for (int i = 0; i < size; i++) |
497 |
|
elements[i] = i; |
498 |
< |
Collections.shuffle(Arrays.asList(elements)); |
498 |
> |
shuffle(elements); |
499 |
|
Collection<Integer> full = populatedSet(elements); |
500 |
|
|
501 |
|
assertTrue(Arrays.asList(elements).containsAll(Arrays.asList(full.toArray()))); |
515 |
|
a = new Integer[0]; |
516 |
|
assertSame(a, empty.toArray(a)); |
517 |
|
|
518 |
< |
a = new Integer[size/2]; |
518 |
> |
a = new Integer[size / 2]; |
519 |
|
Arrays.fill(a, 42); |
520 |
|
assertSame(a, empty.toArray(a)); |
521 |
|
assertNull(a[0]); |
525 |
|
Integer[] elements = new Integer[size]; |
526 |
|
for (int i = 0; i < size; i++) |
527 |
|
elements[i] = i; |
528 |
< |
Collections.shuffle(Arrays.asList(elements)); |
528 |
> |
shuffle(elements); |
529 |
|
Collection<Integer> full = populatedSet(elements); |
530 |
|
|
531 |
|
Arrays.fill(a, 42); |
548 |
|
Set x = populatedSet(size); |
549 |
|
Set y = serialClone(x); |
550 |
|
|
551 |
< |
assertTrue(x != y); |
551 |
> |
assertNotSame(x, y); |
552 |
|
assertEquals(x.size(), y.size()); |
436 |
– |
assertEquals(x.toString(), y.toString()); |
437 |
– |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
553 |
|
assertEquals(x, y); |
554 |
|
assertEquals(y, x); |
555 |
|
} |
556 |
|
|
442 |
– |
|
557 |
|
static final int SIZE = 10000; |
558 |
|
static ConcurrentHashMap<Long, Long> longMap; |
559 |
|
|
581 |
|
public void testForEachKeySequentially() { |
582 |
|
LongAdder adder = new LongAdder(); |
583 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
584 |
< |
m.forEachKeySequentially((Long x) -> adder.add(x.longValue())); |
584 |
> |
m.forEachKey(Long.MAX_VALUE, (Long x) -> adder.add(x.longValue())); |
585 |
|
assertEquals(adder.sum(), SIZE * (SIZE - 1) / 2); |
586 |
|
} |
587 |
|
|
591 |
|
public void testForEachValueSequentially() { |
592 |
|
LongAdder adder = new LongAdder(); |
593 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
594 |
< |
m.forEachValueSequentially((Long x) -> adder.add(x.longValue())); |
594 |
> |
m.forEachValue(Long.MAX_VALUE, (Long x) -> adder.add(x.longValue())); |
595 |
|
assertEquals(adder.sum(), SIZE * (SIZE - 1)); |
596 |
|
} |
597 |
|
|
601 |
|
public void testForEachSequentially() { |
602 |
|
LongAdder adder = new LongAdder(); |
603 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
604 |
< |
m.forEachSequentially((Long x, Long y) -> adder.add(x.longValue() + y.longValue())); |
604 |
> |
m.forEach(Long.MAX_VALUE, (Long x, Long y) -> adder.add(x.longValue() + y.longValue())); |
605 |
|
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
606 |
|
} |
607 |
|
|
611 |
|
public void testForEachEntrySequentially() { |
612 |
|
LongAdder adder = new LongAdder(); |
613 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
614 |
< |
m.forEachEntrySequentially((Map.Entry<Long,Long> e) -> adder.add(e.getKey().longValue() + e.getValue().longValue())); |
614 |
> |
m.forEachEntry(Long.MAX_VALUE, (Map.Entry<Long,Long> e) -> adder.add(e.getKey().longValue() + e.getValue().longValue())); |
615 |
|
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
616 |
|
} |
617 |
|
|
621 |
|
public void testForEachKeyInParallel() { |
622 |
|
LongAdder adder = new LongAdder(); |
623 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
624 |
< |
m.forEachKeyInParallel((Long x) -> adder.add(x.longValue())); |
624 |
> |
m.forEachKey(1L, (Long x) -> adder.add(x.longValue())); |
625 |
|
assertEquals(adder.sum(), SIZE * (SIZE - 1) / 2); |
626 |
|
} |
627 |
|
|
631 |
|
public void testForEachValueInParallel() { |
632 |
|
LongAdder adder = new LongAdder(); |
633 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
634 |
< |
m.forEachValueInParallel((Long x) -> adder.add(x.longValue())); |
634 |
> |
m.forEachValue(1L, (Long x) -> adder.add(x.longValue())); |
635 |
|
assertEquals(adder.sum(), SIZE * (SIZE - 1)); |
636 |
|
} |
637 |
|
|
641 |
|
public void testForEachInParallel() { |
642 |
|
LongAdder adder = new LongAdder(); |
643 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
644 |
< |
m.forEachInParallel((Long x, Long y) -> adder.add(x.longValue() + y.longValue())); |
644 |
> |
m.forEach(1L, (Long x, Long y) -> adder.add(x.longValue() + y.longValue())); |
645 |
|
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
646 |
|
} |
647 |
|
|
651 |
|
public void testForEachEntryInParallel() { |
652 |
|
LongAdder adder = new LongAdder(); |
653 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
654 |
< |
m.forEachEntryInParallel((Map.Entry<Long,Long> e) -> adder.add(e.getKey().longValue() + e.getValue().longValue())); |
654 |
> |
m.forEachEntry(1L, (Map.Entry<Long,Long> e) -> adder.add(e.getKey().longValue() + e.getValue().longValue())); |
655 |
|
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
656 |
|
} |
657 |
|
|
662 |
|
public void testMappedForEachKeySequentially() { |
663 |
|
LongAdder adder = new LongAdder(); |
664 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
665 |
< |
m.forEachKeySequentially((Long x) -> Long.valueOf(4 * x.longValue()), |
665 |
> |
m.forEachKey(Long.MAX_VALUE, (Long x) -> Long.valueOf(4 * x.longValue()), |
666 |
|
(Long x) -> adder.add(x.longValue())); |
667 |
|
assertEquals(adder.sum(), 4 * SIZE * (SIZE - 1) / 2); |
668 |
|
} |
674 |
|
public void testMappedForEachValueSequentially() { |
675 |
|
LongAdder adder = new LongAdder(); |
676 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
677 |
< |
m.forEachValueSequentially((Long x) -> Long.valueOf(4 * x.longValue()), |
677 |
> |
m.forEachValue(Long.MAX_VALUE, (Long x) -> Long.valueOf(4 * x.longValue()), |
678 |
|
(Long x) -> adder.add(x.longValue())); |
679 |
|
assertEquals(adder.sum(), 4 * SIZE * (SIZE - 1)); |
680 |
|
} |
686 |
|
public void testMappedForEachSequentially() { |
687 |
|
LongAdder adder = new LongAdder(); |
688 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
689 |
< |
m.forEachSequentially((Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
689 |
> |
m.forEach(Long.MAX_VALUE, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
690 |
|
(Long x) -> adder.add(x.longValue())); |
691 |
|
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
692 |
|
} |
698 |
|
public void testMappedForEachEntrySequentially() { |
699 |
|
LongAdder adder = new LongAdder(); |
700 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
701 |
< |
m.forEachEntrySequentially((Map.Entry<Long,Long> e) -> Long.valueOf(e.getKey().longValue() + e.getValue().longValue()), |
701 |
> |
m.forEachEntry(Long.MAX_VALUE, (Map.Entry<Long,Long> e) -> Long.valueOf(e.getKey().longValue() + e.getValue().longValue()), |
702 |
|
(Long x) -> adder.add(x.longValue())); |
703 |
|
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
704 |
|
} |
710 |
|
public void testMappedForEachKeyInParallel() { |
711 |
|
LongAdder adder = new LongAdder(); |
712 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
713 |
< |
m.forEachKeyInParallel((Long x) -> Long.valueOf(4 * x.longValue()), |
713 |
> |
m.forEachKey(1L, (Long x) -> Long.valueOf(4 * x.longValue()), |
714 |
|
(Long x) -> adder.add(x.longValue())); |
715 |
|
assertEquals(adder.sum(), 4 * SIZE * (SIZE - 1) / 2); |
716 |
|
} |
722 |
|
public void testMappedForEachValueInParallel() { |
723 |
|
LongAdder adder = new LongAdder(); |
724 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
725 |
< |
m.forEachValueInParallel((Long x) -> Long.valueOf(4 * x.longValue()), |
725 |
> |
m.forEachValue(1L, (Long x) -> Long.valueOf(4 * x.longValue()), |
726 |
|
(Long x) -> adder.add(x.longValue())); |
727 |
|
assertEquals(adder.sum(), 4 * SIZE * (SIZE - 1)); |
728 |
|
} |
734 |
|
public void testMappedForEachInParallel() { |
735 |
|
LongAdder adder = new LongAdder(); |
736 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
737 |
< |
m.forEachInParallel((Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
737 |
> |
m.forEach(1L, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
738 |
|
(Long x) -> adder.add(x.longValue())); |
739 |
|
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
740 |
|
} |
746 |
|
public void testMappedForEachEntryInParallel() { |
747 |
|
LongAdder adder = new LongAdder(); |
748 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
749 |
< |
m.forEachEntryInParallel((Map.Entry<Long,Long> e) -> Long.valueOf(e.getKey().longValue() + e.getValue().longValue()), |
749 |
> |
m.forEachEntry(1L, (Map.Entry<Long,Long> e) -> Long.valueOf(e.getKey().longValue() + e.getValue().longValue()), |
750 |
|
(Long x) -> adder.add(x.longValue())); |
751 |
|
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
752 |
|
} |
753 |
|
|
640 |
– |
|
754 |
|
/** |
755 |
|
* reduceKeysSequentially accumulates across all keys, |
756 |
|
*/ |
757 |
|
public void testReduceKeysSequentially() { |
758 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
759 |
|
Long r; |
760 |
< |
r = m.reduceKeysSequentially((Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
760 |
> |
r = m.reduceKeys(Long.MAX_VALUE, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
761 |
|
assertEquals((long)r, (long)SIZE * (SIZE - 1) / 2); |
762 |
|
} |
763 |
|
|
767 |
|
public void testReduceValuesSequentially() { |
768 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
769 |
|
Long r; |
770 |
< |
r = m.reduceKeysSequentially((Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
770 |
> |
r = m.reduceKeys(Long.MAX_VALUE, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
771 |
|
assertEquals((long)r, (long)SIZE * (SIZE - 1) / 2); |
772 |
|
} |
773 |
|
|
661 |
– |
|
774 |
|
/** |
775 |
|
* reduceEntriesSequentially accumulates across all entries |
776 |
|
*/ |
777 |
|
public void testReduceEntriesSequentially() { |
778 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
779 |
|
Map.Entry<Long,Long> r; |
780 |
< |
r = m.reduceEntriesSequentially(new AddKeys()); |
780 |
> |
r = m.reduceEntries(Long.MAX_VALUE, new AddKeys()); |
781 |
|
assertEquals(r.getKey().longValue(), (long)SIZE * (SIZE - 1) / 2); |
782 |
|
} |
783 |
|
|
787 |
|
public void testReduceKeysInParallel() { |
788 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
789 |
|
Long r; |
790 |
< |
r = m.reduceKeysInParallel((Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
790 |
> |
r = m.reduceKeys(1L, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
791 |
|
assertEquals((long)r, (long)SIZE * (SIZE - 1) / 2); |
792 |
|
} |
793 |
|
|
797 |
|
public void testReduceValuesInParallel() { |
798 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
799 |
|
Long r; |
800 |
< |
r = m.reduceValuesInParallel((Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
800 |
> |
r = m.reduceValues(1L, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
801 |
|
assertEquals((long)r, (long)SIZE * (SIZE - 1)); |
802 |
|
} |
803 |
|
|
807 |
|
public void testReduceEntriesInParallel() { |
808 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
809 |
|
Map.Entry<Long,Long> r; |
810 |
< |
r = m.reduceEntriesInParallel(new AddKeys()); |
810 |
> |
r = m.reduceEntries(1L, new AddKeys()); |
811 |
|
assertEquals(r.getKey().longValue(), (long)SIZE * (SIZE - 1) / 2); |
812 |
|
} |
813 |
|
|
814 |
< |
/* |
814 |
> |
/** |
815 |
|
* Mapped reduceKeysSequentially accumulates mapped keys |
816 |
|
*/ |
817 |
|
public void testMapReduceKeysSequentially() { |
818 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
819 |
< |
Long r = m.reduceKeysSequentially((Long x) -> Long.valueOf(4 * x.longValue()), |
819 |
> |
Long r = m.reduceKeys(Long.MAX_VALUE, (Long x) -> Long.valueOf(4 * x.longValue()), |
820 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
821 |
|
assertEquals((long)r, (long)4 * SIZE * (SIZE - 1) / 2); |
822 |
|
} |
823 |
|
|
824 |
< |
/* |
824 |
> |
/** |
825 |
|
* Mapped reduceValuesSequentially accumulates mapped values |
826 |
|
*/ |
827 |
|
public void testMapReduceValuesSequentially() { |
828 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
829 |
< |
Long r = m.reduceValuesSequentially((Long x) -> Long.valueOf(4 * x.longValue()), |
829 |
> |
Long r = m.reduceValues(Long.MAX_VALUE, (Long x) -> Long.valueOf(4 * x.longValue()), |
830 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
831 |
|
assertEquals((long)r, (long)4 * SIZE * (SIZE - 1)); |
832 |
|
} |
836 |
|
*/ |
837 |
|
public void testMappedReduceSequentially() { |
838 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
839 |
< |
Long r = m.reduceSequentially((Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
839 |
> |
Long r = m.reduce(Long.MAX_VALUE, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
840 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
841 |
|
|
842 |
|
assertEquals((long)r, (long)3 * SIZE * (SIZE - 1) / 2); |
843 |
|
} |
844 |
|
|
845 |
< |
/* |
845 |
> |
/** |
846 |
|
* Mapped reduceKeysInParallel, accumulates mapped keys |
847 |
|
*/ |
848 |
|
public void testMapReduceKeysInParallel() { |
849 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
850 |
< |
Long r = m.reduceKeysInParallel((Long x) -> Long.valueOf(4 * x.longValue()), |
850 |
> |
Long r = m.reduceKeys(1L, (Long x) -> Long.valueOf(4 * x.longValue()), |
851 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
852 |
|
assertEquals((long)r, (long)4 * SIZE * (SIZE - 1) / 2); |
853 |
|
} |
854 |
|
|
855 |
< |
/* |
855 |
> |
/** |
856 |
|
* Mapped reduceValuesInParallel accumulates mapped values |
857 |
|
*/ |
858 |
|
public void testMapReduceValuesInParallel() { |
859 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
860 |
< |
Long r = m.reduceValuesInParallel((Long x) -> Long.valueOf(4 * x.longValue()), |
860 |
> |
Long r = m.reduceValues(1L, (Long x) -> Long.valueOf(4 * x.longValue()), |
861 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
862 |
|
assertEquals((long)r, (long)4 * SIZE * (SIZE - 1)); |
863 |
|
} |
868 |
|
public void testMappedReduceInParallel() { |
869 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
870 |
|
Long r; |
871 |
< |
r = m.reduceInParallel((Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
871 |
> |
r = m.reduce(1L, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
872 |
|
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())); |
873 |
|
assertEquals((long)r, (long)3 * SIZE * (SIZE - 1) / 2); |
874 |
|
} |
875 |
|
|
876 |
< |
|
765 |
< |
/* |
876 |
> |
/** |
877 |
|
* reduceKeysToLongSequentially accumulates mapped keys |
878 |
|
*/ |
879 |
|
public void testReduceKeysToLongSequentially() { |
880 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
881 |
< |
long lr = m.reduceKeysToLongSequentially((Long x) -> x.longValue(), 0L, Long::sum); |
881 |
> |
long lr = m.reduceKeysToLong(Long.MAX_VALUE, (Long x) -> x.longValue(), 0L, Long::sum); |
882 |
|
assertEquals(lr, (long)SIZE * (SIZE - 1) / 2); |
883 |
|
} |
884 |
|
|
885 |
< |
/* |
885 |
> |
/** |
886 |
|
* reduceKeysToIntSequentially accumulates mapped keys |
887 |
|
*/ |
888 |
|
public void testReduceKeysToIntSequentially() { |
889 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
890 |
< |
int ir = m.reduceKeysToIntSequentially((Long x) -> x.intValue(), 0, Integer::sum); |
890 |
> |
int ir = m.reduceKeysToInt(Long.MAX_VALUE, (Long x) -> x.intValue(), 0, Integer::sum); |
891 |
|
assertEquals(ir, SIZE * (SIZE - 1) / 2); |
892 |
|
} |
893 |
|
|
894 |
< |
/* |
894 |
> |
/** |
895 |
|
* reduceKeysToDoubleSequentially accumulates mapped keys |
896 |
|
*/ |
897 |
|
public void testReduceKeysToDoubleSequentially() { |
898 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
899 |
< |
double dr = m.reduceKeysToDoubleSequentially((Long x) -> x.doubleValue(), 0.0, Double::sum); |
899 |
> |
double dr = m.reduceKeysToDouble(Long.MAX_VALUE, (Long x) -> x.doubleValue(), 0.0, Double::sum); |
900 |
|
assertEquals(dr, (double)SIZE * (SIZE - 1) / 2); |
901 |
|
} |
902 |
|
|
903 |
< |
/* |
903 |
> |
/** |
904 |
|
* reduceValuesToLongSequentially accumulates mapped values |
905 |
|
*/ |
906 |
|
public void testReduceValuesToLongSequentially() { |
907 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
908 |
< |
long lr = m.reduceValuesToLongSequentially((Long x) -> x.longValue(), 0L, Long::sum); |
908 |
> |
long lr = m.reduceValuesToLong(Long.MAX_VALUE, (Long x) -> x.longValue(), 0L, Long::sum); |
909 |
|
assertEquals(lr, (long)SIZE * (SIZE - 1)); |
910 |
|
} |
911 |
|
|
912 |
< |
/* |
912 |
> |
/** |
913 |
|
* reduceValuesToIntSequentially accumulates mapped values |
914 |
|
*/ |
915 |
|
public void testReduceValuesToIntSequentially() { |
916 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
917 |
< |
int ir = m.reduceValuesToIntSequentially((Long x) -> x.intValue(), 0, Integer::sum); |
917 |
> |
int ir = m.reduceValuesToInt(Long.MAX_VALUE, (Long x) -> x.intValue(), 0, Integer::sum); |
918 |
|
assertEquals(ir, SIZE * (SIZE - 1)); |
919 |
|
} |
920 |
|
|
921 |
< |
/* |
921 |
> |
/** |
922 |
|
* reduceValuesToDoubleSequentially accumulates mapped values |
923 |
|
*/ |
924 |
|
public void testReduceValuesToDoubleSequentially() { |
925 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
926 |
< |
double dr = m.reduceValuesToDoubleSequentially((Long x) -> x.doubleValue(), 0.0, Double::sum); |
926 |
> |
double dr = m.reduceValuesToDouble(Long.MAX_VALUE, (Long x) -> x.doubleValue(), 0.0, Double::sum); |
927 |
|
assertEquals(dr, (double)SIZE * (SIZE - 1)); |
928 |
|
} |
929 |
|
|
930 |
< |
/* |
930 |
> |
/** |
931 |
|
* reduceKeysToLongInParallel accumulates mapped keys |
932 |
|
*/ |
933 |
|
public void testReduceKeysToLongInParallel() { |
934 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
935 |
< |
long lr = m.reduceKeysToLongInParallel((Long x) -> x.longValue(), 0L, Long::sum); |
935 |
> |
long lr = m.reduceKeysToLong(1L, (Long x) -> x.longValue(), 0L, Long::sum); |
936 |
|
assertEquals(lr, (long)SIZE * (SIZE - 1) / 2); |
937 |
|
} |
938 |
|
|
939 |
< |
/* |
939 |
> |
/** |
940 |
|
* reduceKeysToIntInParallel accumulates mapped keys |
941 |
|
*/ |
942 |
|
public void testReduceKeysToIntInParallel() { |
943 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
944 |
< |
int ir = m.reduceKeysToIntInParallel((Long x) -> x.intValue(), 0, Integer::sum); |
944 |
> |
int ir = m.reduceKeysToInt(1L, (Long x) -> x.intValue(), 0, Integer::sum); |
945 |
|
assertEquals(ir, SIZE * (SIZE - 1) / 2); |
946 |
|
} |
947 |
|
|
948 |
< |
/* |
948 |
> |
/** |
949 |
|
* reduceKeysToDoubleInParallel accumulates mapped values |
950 |
|
*/ |
951 |
|
public void testReduceKeysToDoubleInParallel() { |
952 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
953 |
< |
double dr = m.reduceKeysToDoubleInParallel((Long x) -> x.doubleValue(), 0.0, Double::sum); |
953 |
> |
double dr = m.reduceKeysToDouble(1L, (Long x) -> x.doubleValue(), 0.0, Double::sum); |
954 |
|
assertEquals(dr, (double)SIZE * (SIZE - 1) / 2); |
955 |
|
} |
956 |
|
|
957 |
< |
/* |
957 |
> |
/** |
958 |
|
* reduceValuesToLongInParallel accumulates mapped values |
959 |
|
*/ |
960 |
|
public void testReduceValuesToLongInParallel() { |
961 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
962 |
< |
long lr = m.reduceValuesToLongInParallel((Long x) -> x.longValue(), 0L, Long::sum); |
962 |
> |
long lr = m.reduceValuesToLong(1L, (Long x) -> x.longValue(), 0L, Long::sum); |
963 |
|
assertEquals(lr, (long)SIZE * (SIZE - 1)); |
964 |
|
} |
965 |
|
|
966 |
< |
/* |
966 |
> |
/** |
967 |
|
* reduceValuesToIntInParallel accumulates mapped values |
968 |
|
*/ |
969 |
|
public void testReduceValuesToIntInParallel() { |
970 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
971 |
< |
int ir = m.reduceValuesToIntInParallel((Long x) -> x.intValue(), 0, Integer::sum); |
971 |
> |
int ir = m.reduceValuesToInt(1L, (Long x) -> x.intValue(), 0, Integer::sum); |
972 |
|
assertEquals(ir, SIZE * (SIZE - 1)); |
973 |
|
} |
974 |
|
|
975 |
< |
/* |
975 |
> |
/** |
976 |
|
* reduceValuesToDoubleInParallel accumulates mapped values |
977 |
|
*/ |
978 |
|
public void testReduceValuesToDoubleInParallel() { |
979 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
980 |
< |
double dr = m.reduceValuesToDoubleInParallel((Long x) -> x.doubleValue(), 0.0, Double::sum); |
980 |
> |
double dr = m.reduceValuesToDouble(1L, (Long x) -> x.doubleValue(), 0.0, Double::sum); |
981 |
|
assertEquals(dr, (double)SIZE * (SIZE - 1)); |
982 |
|
} |
983 |
|
|
988 |
|
public void testSearchKeysSequentially() { |
989 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
990 |
|
Long r; |
991 |
< |
r = m.searchKeysSequentially((Long x) -> x.longValue() == (long)(SIZE/2) ? x : null); |
991 |
> |
r = m.searchKeys(Long.MAX_VALUE, (Long x) -> x.longValue() == (long)(SIZE/2) ? x : null); |
992 |
|
assertEquals((long)r, (long)(SIZE/2)); |
993 |
< |
r = m.searchKeysSequentially((Long x) -> x.longValue() < 0L ? x : null); |
993 |
> |
r = m.searchKeys(Long.MAX_VALUE, (Long x) -> x.longValue() < 0L ? x : null); |
994 |
|
assertNull(r); |
995 |
|
} |
996 |
|
|
1001 |
|
public void testSearchValuesSequentially() { |
1002 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1003 |
|
Long r; |
1004 |
< |
r = m.searchValuesSequentially((Long x) -> x.longValue() == (long)(SIZE/2)? x : null); |
1004 |
> |
r = m.searchValues(Long.MAX_VALUE, |
1005 |
> |
(Long x) -> (x.longValue() == (long)(SIZE/2)) ? x : null); |
1006 |
|
assertEquals((long)r, (long)(SIZE/2)); |
1007 |
< |
r = m.searchValuesSequentially((Long x) -> x.longValue() < 0L ? x : null); |
1007 |
> |
r = m.searchValues(Long.MAX_VALUE, |
1008 |
> |
(Long x) -> (x.longValue() < 0L) ? x : null); |
1009 |
|
assertNull(r); |
1010 |
|
} |
1011 |
|
|
1016 |
|
public void testSearchSequentially() { |
1017 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1018 |
|
Long r; |
1019 |
< |
r = m.searchSequentially((Long x, Long y) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1019 |
> |
r = m.search(Long.MAX_VALUE, (Long x, Long y) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1020 |
|
assertEquals((long)r, (long)(SIZE/2)); |
1021 |
< |
r = m.searchSequentially((Long x, Long y) -> x.longValue() < 0L ? x : null); |
1021 |
> |
r = m.search(Long.MAX_VALUE, (Long x, Long y) -> x.longValue() < 0L ? x : null); |
1022 |
|
assertNull(r); |
1023 |
|
} |
1024 |
|
|
1029 |
|
public void testSearchEntriesSequentially() { |
1030 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1031 |
|
Long r; |
1032 |
< |
r = m.searchEntriesSequentially((Map.Entry<Long,Long> e) -> e.getKey().longValue() == (long)(SIZE/2) ? e.getKey() : null); |
1032 |
> |
r = m.searchEntries(Long.MAX_VALUE, (Map.Entry<Long,Long> e) -> e.getKey().longValue() == (long)(SIZE/2) ? e.getKey() : null); |
1033 |
|
assertEquals((long)r, (long)(SIZE/2)); |
1034 |
< |
r = m.searchEntriesSequentially((Map.Entry<Long,Long> e) -> e.getKey().longValue() < 0L ? e.getKey() : null); |
1034 |
> |
r = m.searchEntries(Long.MAX_VALUE, (Map.Entry<Long,Long> e) -> e.getKey().longValue() < 0L ? e.getKey() : null); |
1035 |
|
assertNull(r); |
1036 |
|
} |
1037 |
|
|
1042 |
|
public void testSearchKeysInParallel() { |
1043 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1044 |
|
Long r; |
1045 |
< |
r = m.searchKeysInParallel((Long x) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1045 |
> |
r = m.searchKeys(1L, (Long x) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1046 |
|
assertEquals((long)r, (long)(SIZE/2)); |
1047 |
< |
r = m.searchKeysInParallel((Long x) -> x.longValue() < 0L ? x : null); |
1047 |
> |
r = m.searchKeys(1L, (Long x) -> x.longValue() < 0L ? x : null); |
1048 |
|
assertNull(r); |
1049 |
|
} |
1050 |
|
|
1055 |
|
public void testSearchValuesInParallel() { |
1056 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1057 |
|
Long r; |
1058 |
< |
r = m.searchValuesInParallel((Long x) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1058 |
> |
r = m.searchValues(1L, (Long x) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1059 |
|
assertEquals((long)r, (long)(SIZE/2)); |
1060 |
< |
r = m.searchValuesInParallel((Long x) -> x.longValue() < 0L ? x : null); |
1060 |
> |
r = m.searchValues(1L, (Long x) -> x.longValue() < 0L ? x : null); |
1061 |
|
assertNull(r); |
1062 |
|
} |
1063 |
|
|
1068 |
|
public void testSearchInParallel() { |
1069 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1070 |
|
Long r; |
1071 |
< |
r = m.searchInParallel((Long x, Long y) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1071 |
> |
r = m.search(1L, (Long x, Long y) -> x.longValue() == (long)(SIZE/2) ? x : null); |
1072 |
|
assertEquals((long)r, (long)(SIZE/2)); |
1073 |
< |
r = m.searchInParallel((Long x, Long y) -> x.longValue() < 0L ? x : null); |
1073 |
> |
r = m.search(1L, (Long x, Long y) -> x.longValue() < 0L ? x : null); |
1074 |
|
assertNull(r); |
1075 |
|
} |
1076 |
|
|
1081 |
|
public void testSearchEntriesInParallel() { |
1082 |
|
ConcurrentHashMap<Long, Long> m = longMap(); |
1083 |
|
Long r; |
1084 |
< |
r = m.searchEntriesInParallel((Map.Entry<Long,Long> e) -> e.getKey().longValue() == (long)(SIZE/2) ? e.getKey() : null); |
1084 |
> |
r = m.searchEntries(1L, (Map.Entry<Long,Long> e) -> e.getKey().longValue() == (long)(SIZE/2) ? e.getKey() : null); |
1085 |
|
assertEquals((long)r, (long)(SIZE/2)); |
1086 |
< |
r = m.searchEntriesInParallel((Map.Entry<Long,Long> e) -> e.getKey().longValue() < 0L ? e.getKey() : null); |
1086 |
> |
r = m.searchEntries(1L, (Map.Entry<Long,Long> e) -> e.getKey().longValue() < 0L ? e.getKey() : null); |
1087 |
|
assertNull(r); |
1088 |
|
} |
1089 |
|
|
977 |
– |
/** |
978 |
– |
* Invoking task versions of bulk methods has same effect as |
979 |
– |
* parallel methods |
980 |
– |
*/ |
981 |
– |
public void testForkJoinTasks() { |
982 |
– |
LongAdder adder = new LongAdder(); |
983 |
– |
ConcurrentHashMap<Long, Long> m = longMap(); |
984 |
– |
ConcurrentHashMap.ForkJoinTasks.forEachKey |
985 |
– |
(m, (Long x) -> adder.add(x.longValue())).invoke(); |
986 |
– |
assertEquals(adder.sum(), SIZE * (SIZE - 1) / 2); |
987 |
– |
adder.reset(); |
988 |
– |
ConcurrentHashMap.ForkJoinTasks.forEachValue |
989 |
– |
(m, (Long x) -> adder.add(x.longValue())).invoke(); |
990 |
– |
assertEquals(adder.sum(), SIZE * (SIZE - 1)); |
991 |
– |
adder.reset(); |
992 |
– |
ConcurrentHashMap.ForkJoinTasks.forEach |
993 |
– |
(m, (Long x, Long y) -> adder.add(x.longValue() + y.longValue())).invoke(); |
994 |
– |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
995 |
– |
adder.reset(); |
996 |
– |
ConcurrentHashMap.ForkJoinTasks.forEachEntry |
997 |
– |
(m, |
998 |
– |
(Map.Entry<Long,Long> e) -> adder.add(e.getKey().longValue() + e.getValue().longValue())).invoke(); |
999 |
– |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
1000 |
– |
adder.reset(); |
1001 |
– |
ConcurrentHashMap.ForkJoinTasks.forEachKey |
1002 |
– |
(m, (Long x) -> Long.valueOf(4 * x.longValue()), |
1003 |
– |
(Long x) -> adder.add(x.longValue())).invoke(); |
1004 |
– |
assertEquals(adder.sum(), 4 * SIZE * (SIZE - 1) / 2); |
1005 |
– |
adder.reset(); |
1006 |
– |
ConcurrentHashMap.ForkJoinTasks.forEachValue |
1007 |
– |
(m, (Long x) -> Long.valueOf(4 * x.longValue()), |
1008 |
– |
(Long x) -> adder.add(x.longValue())).invoke(); |
1009 |
– |
assertEquals(adder.sum(), 4 * SIZE * (SIZE - 1)); |
1010 |
– |
adder.reset(); |
1011 |
– |
ConcurrentHashMap.ForkJoinTasks.forEach |
1012 |
– |
(m, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
1013 |
– |
(Long x) -> adder.add(x.longValue())).invoke(); |
1014 |
– |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
1015 |
– |
adder.reset(); |
1016 |
– |
ConcurrentHashMap.ForkJoinTasks.forEachEntry |
1017 |
– |
(m, (Map.Entry<Long,Long> e) -> Long.valueOf(e.getKey().longValue() + e.getValue().longValue()), |
1018 |
– |
(Long x) -> adder.add(x.longValue())).invoke(); |
1019 |
– |
assertEquals(adder.sum(), 3 * SIZE * (SIZE - 1) / 2); |
1020 |
– |
adder.reset(); |
1021 |
– |
|
1022 |
– |
Long r; long lr; int ir; double dr; |
1023 |
– |
r = ConcurrentHashMap.ForkJoinTasks.reduceKeys |
1024 |
– |
(m, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())).invoke(); |
1025 |
– |
assertEquals((long)r, (long)SIZE * (SIZE - 1) / 2); |
1026 |
– |
r = ConcurrentHashMap.ForkJoinTasks.reduceValues |
1027 |
– |
(m, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())).invoke(); |
1028 |
– |
assertEquals((long)r, (long)SIZE * (SIZE - 1)); |
1029 |
– |
r = ConcurrentHashMap.ForkJoinTasks.reduce |
1030 |
– |
(m, (Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue()), |
1031 |
– |
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())).invoke(); |
1032 |
– |
assertEquals((long)r, (long)3 * SIZE * (SIZE - 1) / 2); |
1033 |
– |
r = ConcurrentHashMap.ForkJoinTasks.reduceEntries |
1034 |
– |
(m, (Map.Entry<Long,Long> e) -> Long.valueOf(e.getKey().longValue() + e.getValue().longValue()), |
1035 |
– |
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())).invoke(); |
1036 |
– |
assertEquals((long)r, (long)3 * SIZE * (SIZE - 1) / 2); |
1037 |
– |
r = ConcurrentHashMap.ForkJoinTasks.reduceKeys |
1038 |
– |
(m, (Long x) -> Long.valueOf(4 * x.longValue()), |
1039 |
– |
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())).invoke(); |
1040 |
– |
assertEquals((long)r, (long)4 * SIZE * (SIZE - 1) / 2); |
1041 |
– |
lr = ConcurrentHashMap.ForkJoinTasks.reduceKeysToLong |
1042 |
– |
(m, (Long x) -> x.longValue(), 0L, Long::sum).invoke(); |
1043 |
– |
assertEquals(lr, (long)SIZE * (SIZE - 1) / 2); |
1044 |
– |
ir = ConcurrentHashMap.ForkJoinTasks.reduceKeysToInt |
1045 |
– |
(m, (Long x) -> x.intValue(), 0, Integer::sum).invoke(); |
1046 |
– |
assertEquals(ir, SIZE * (SIZE - 1) / 2); |
1047 |
– |
dr = ConcurrentHashMap.ForkJoinTasks.reduceKeysToDouble |
1048 |
– |
(m, (Long x) -> x.doubleValue(), 0.0, Double::sum).invoke(); |
1049 |
– |
assertEquals(dr, (double)SIZE * (SIZE - 1) / 2); |
1050 |
– |
r = ConcurrentHashMap.ForkJoinTasks.reduceValues |
1051 |
– |
(m, (Long x) -> Long.valueOf(4 * x.longValue()), |
1052 |
– |
(Long x, Long y) -> Long.valueOf(x.longValue() + y.longValue())).invoke(); |
1053 |
– |
assertEquals((long)r, (long)4 * SIZE * (SIZE - 1)); |
1054 |
– |
lr = ConcurrentHashMap.ForkJoinTasks.reduceValuesToLong |
1055 |
– |
(m, (Long x) -> x.longValue(), 0L, Long::sum).invoke(); |
1056 |
– |
assertEquals(lr, (long)SIZE * (SIZE - 1)); |
1057 |
– |
ir = ConcurrentHashMap.ForkJoinTasks.reduceValuesToInt |
1058 |
– |
(m, (Long x) -> x.intValue(), 0, Integer::sum).invoke(); |
1059 |
– |
assertEquals(ir, SIZE * (SIZE - 1)); |
1060 |
– |
dr = ConcurrentHashMap.ForkJoinTasks.reduceValuesToDouble |
1061 |
– |
(m, (Long x) -> x.doubleValue(), 0.0, Double::sum).invoke(); |
1062 |
– |
assertEquals(dr, (double)SIZE * (SIZE - 1)); |
1063 |
– |
r = ConcurrentHashMap.ForkJoinTasks.searchKeys |
1064 |
– |
(m, (Long x) -> x.longValue() == (long)(SIZE/2)? x : null).invoke(); |
1065 |
– |
assertEquals((long)r, (long)(SIZE/2)); |
1066 |
– |
r = ConcurrentHashMap.ForkJoinTasks.searchValues |
1067 |
– |
(m, (Long x) -> x.longValue() == (long)(SIZE/2)? x : null).invoke(); |
1068 |
– |
assertEquals((long)r, (long)(SIZE/2)); |
1069 |
– |
r = ConcurrentHashMap.ForkJoinTasks.search |
1070 |
– |
(m, (Long x, Long y) -> x.longValue() == (long)(SIZE/2)? x : null).invoke(); |
1071 |
– |
assertEquals((long)r, (long)(SIZE/2)); |
1072 |
– |
r = ConcurrentHashMap.ForkJoinTasks.searchEntries |
1073 |
– |
(m, (Map.Entry<Long,Long> e) -> e.getKey().longValue() == (long)(SIZE/2)? e.getKey() : null).invoke(); |
1074 |
– |
assertEquals((long)r, (long)(SIZE/2)); |
1075 |
– |
} |
1090 |
|
} |