2579 |
|
final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { |
2580 |
|
if (k != null) { |
2581 |
|
TreeNode<K,V> p = this; |
2582 |
< |
do { |
2582 |
> |
do { |
2583 |
|
int ph, dir; K pk; TreeNode<K,V> q; |
2584 |
|
TreeNode<K,V> pl = p.left, pr = p.right; |
2585 |
|
if ((ph = p.hash) > h) |
3028 |
|
|
3029 |
|
static <K,V> TreeNode<K,V> balanceDeletion(TreeNode<K,V> root, |
3030 |
|
TreeNode<K,V> x) { |
3031 |
< |
for (TreeNode<K,V> xp, xpl, xpr;;) { |
3031 |
> |
for (TreeNode<K,V> xp, xpl, xpr;;) { |
3032 |
|
if (x == null || x == root) |
3033 |
|
return root; |
3034 |
|
else if ((xp = x.parent) == null) { |