54 |
|
} |
55 |
|
|
56 |
|
/** |
57 |
< |
* computeIfAbsent does not replace if the key is already present |
57 |
> |
* computeIfAbsent does not replace if the key is already present |
58 |
|
*/ |
59 |
|
public void testComputeIfAbsent2() { |
60 |
|
ConcurrentHashMap map = map5(); |
71 |
|
} |
72 |
|
|
73 |
|
/** |
74 |
< |
* computeIfPresent does not replace if the key is already present |
74 |
> |
* computeIfPresent does not replace if the key is already present |
75 |
|
*/ |
76 |
|
public void testComputeIfPresent() { |
77 |
|
ConcurrentHashMap map = map5(); |
88 |
|
} |
89 |
|
|
90 |
|
/** |
91 |
< |
* compute does not replace if the function returns null |
91 |
> |
* compute does not replace if the function returns null |
92 |
|
*/ |
93 |
|
public void testCompute() { |
94 |
|
ConcurrentHashMap map = map5(); |