960 |
|
sib = (xp = x.parent) == null ? null : xp.right; |
961 |
|
} |
962 |
|
if (sib != null) { |
963 |
< |
sib.red = (xp == null)? false : xp.red; |
963 |
> |
sib.red = (xp == null) ? false : xp.red; |
964 |
|
if ((sr = sib.right) != null) |
965 |
|
sr.red = false; |
966 |
|
} |
998 |
|
sib = (xp = x.parent) == null ? null : xp.left; |
999 |
|
} |
1000 |
|
if (sib != null) { |
1001 |
< |
sib.red = (xp == null)? false : xp.red; |
1001 |
> |
sib.red = (xp == null) ? false : xp.red; |
1002 |
|
if ((sl = sib.left) != null) |
1003 |
|
sl.red = false; |
1004 |
|
} |
1025 |
|
* we apply a transform that spreads the impact of higher bits |
1026 |
|
* downward. There is a tradeoff between speed, utility, and |
1027 |
|
* quality of bit-spreading. Because many common sets of hashes |
1028 |
< |
* are already reaonably distributed across bits (so don't benefit |
1028 |
> |
* are already reasonably distributed across bits (so don't benefit |
1029 |
|
* from spreading), and because we use trees to handle large sets |
1030 |
|
* of collisions in bins, we don't need excessively high quality. |
1031 |
|
*/ |
1553 |
|
if (tabAt(tab, i) == f) { |
1554 |
|
count = 1; |
1555 |
|
TreeNode p = t.getTreeNode(h, k, t.root); |
1556 |
< |
Object pv = (p == null)? null : p.val; |
1556 |
> |
Object pv = (p == null) ? null : p.val; |
1557 |
|
if ((val = mf.remap(k, (V)pv)) != null) { |
1558 |
|
if (p != null) |
1559 |
|
p.val = val; |