1923 |
|
final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) { |
1924 |
|
if (k != null) { |
1925 |
|
TreeNode<K,V> p = this; |
1926 |
< |
do { |
1926 |
> |
do { |
1927 |
|
int ph, dir; K pk; TreeNode<K,V> q; |
1928 |
|
TreeNode<K,V> pl = p.left, pr = p.right; |
1929 |
|
if ((ph = p.hash) > h) |
2378 |
|
|
2379 |
|
static <K,V> TreeNode<K,V> balanceDeletion(TreeNode<K,V> root, |
2380 |
|
TreeNode<K,V> x) { |
2381 |
< |
for (TreeNode<K,V> xp, xpl, xpr;;) { |
2381 |
> |
for (TreeNode<K,V> xp, xpl, xpr;;) { |
2382 |
|
if (x == null || x == root) |
2383 |
|
return root; |
2384 |
|
else if ((xp = x.parent) == null) { |