16 |
|
import java.util.Random; |
17 |
|
import java.util.Set; |
18 |
|
import java.util.concurrent.ConcurrentHashMap; |
19 |
– |
import java.util.concurrent.ExecutorService; |
20 |
– |
import java.util.concurrent.Executors; |
19 |
|
|
20 |
|
import junit.framework.Test; |
21 |
|
import junit.framework.TestSuite; |
32 |
|
* Returns a new map from Integers 1-5 to Strings "A"-"E". |
33 |
|
*/ |
34 |
|
private static ConcurrentHashMap<Integer, String> map5() { |
35 |
< |
ConcurrentHashMap map = new ConcurrentHashMap<Integer, String>(5); |
35 |
> |
ConcurrentHashMap<Integer, String> map = new ConcurrentHashMap<>(5); |
36 |
|
assertTrue(map.isEmpty()); |
37 |
|
map.put(one, "A"); |
38 |
|
map.put(two, "B"); |
835 |
|
assertEquals(mapSize, map.size()); |
836 |
|
} |
837 |
|
|
840 |
– |
/** |
841 |
– |
* Tests performance of computeIfAbsent when the element is present. |
842 |
– |
* See JDK-8161372 |
843 |
– |
* ant -Djsr166.tckTestClass=ConcurrentHashMapTest -Djsr166.methodFilter=testcomputeIfAbsent_performance -Djsr166.expensiveTests=true tck |
844 |
– |
*/ |
845 |
– |
public void testcomputeIfAbsent_performance() { |
846 |
– |
final int mapSize = 20; |
847 |
– |
final int iterations = expensiveTests ? (1 << 23) : mapSize * 2; |
848 |
– |
final int threads = expensiveTests ? 10 : 2; |
849 |
– |
final ConcurrentHashMap<Integer, Integer> map = new ConcurrentHashMap<>(); |
850 |
– |
for (int i = 0; i < mapSize; i++) |
851 |
– |
map.put(i, i); |
852 |
– |
final ExecutorService pool = Executors.newFixedThreadPool(2); |
853 |
– |
try (PoolCleaner cleaner = cleaner(pool)) { |
854 |
– |
Runnable r = new CheckedRunnable() { |
855 |
– |
public void realRun() { |
856 |
– |
int result = 0; |
857 |
– |
for (int i = 0; i < iterations; i++) |
858 |
– |
result += map.computeIfAbsent(i % mapSize, (k) -> k + k); |
859 |
– |
if (result == -42) throw new Error(); |
860 |
– |
}}; |
861 |
– |
for (int i = 0; i < threads; i++) |
862 |
– |
pool.execute(r); |
863 |
– |
} |
864 |
– |
} |
865 |
– |
|
838 |
|
} |