15 |
|
import java.util.AbstractMap; |
16 |
|
import java.util.Arrays; |
17 |
|
import java.util.Collection; |
18 |
– |
import java.util.Comparator; |
18 |
|
import java.util.ConcurrentModificationException; |
19 |
|
import java.util.Enumeration; |
20 |
|
import java.util.HashMap; |
2416 |
|
return; |
2417 |
|
} |
2418 |
|
if (U.compareAndSwapInt(this, SIZECTL, sc = sizeCtl, sc - 1)) { |
2419 |
< |
if ((sc - 2) != resizeStamp(n)) |
2419 |
> |
if ((sc - 2) != resizeStamp(n) << RESIZE_STAMP_SHIFT) |
2420 |
|
return; |
2421 |
|
finishing = advance = true; |
2422 |
|
i = n; // recheck before commit |
2578 |
|
final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { |
2579 |
|
if (k != null) { |
2580 |
|
TreeNode<K,V> p = this; |
2581 |
< |
do { |
2581 |
> |
do { |
2582 |
|
int ph, dir; K pk; TreeNode<K,V> q; |
2583 |
|
TreeNode<K,V> pl = p.left, pr = p.right; |
2584 |
|
if ((ph = p.hash) > h) |
3027 |
|
|
3028 |
|
static <K,V> TreeNode<K,V> balanceDeletion(TreeNode<K,V> root, |
3029 |
|
TreeNode<K,V> x) { |
3030 |
< |
for (TreeNode<K,V> xp, xpl, xpr;;) { |
3030 |
> |
for (TreeNode<K,V> xp, xpl, xpr;;) { |
3031 |
|
if (x == null || x == root) |
3032 |
|
return root; |
3033 |
|
else if ((xp = x.parent) == null) { |