759 |
|
if (c != (pc = pk.getClass()) || |
760 |
|
!(k instanceof Comparable) || |
761 |
|
(dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) { |
762 |
< |
dir = (c == pc)? 0 : c.getName().compareTo(pc.getName()); |
762 |
> |
dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName()); |
763 |
|
TreeNode r = null, s = null, pl, pr; |
764 |
|
if (dir >= 0) { |
765 |
|
if ((pl = p.left) != null && h <= pl.hash) |
823 |
|
if (c != (pc = pk.getClass()) || |
824 |
|
!(k instanceof Comparable) || |
825 |
|
(dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) { |
826 |
< |
dir = (c == pc)? 0 : c.getName().compareTo(pc.getName()); |
826 |
> |
dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName()); |
827 |
|
TreeNode r = null, s = null, pl, pr; |
828 |
|
if (dir >= 0) { |
829 |
|
if ((pl = p.left) != null && h <= pl.hash) |
1017 |
|
sib = (xp = x.parent) == null ? null : xp.right; |
1018 |
|
} |
1019 |
|
if (sib != null) { |
1020 |
< |
sib.red = (xp == null)? false : xp.red; |
1020 |
> |
sib.red = (xp == null) ? false : xp.red; |
1021 |
|
if ((sr = sib.right) != null) |
1022 |
|
sr.red = false; |
1023 |
|
} |
1055 |
|
sib = (xp = x.parent) == null ? null : xp.left; |
1056 |
|
} |
1057 |
|
if (sib != null) { |
1058 |
< |
sib.red = (xp == null)? false : xp.red; |
1058 |
> |
sib.red = (xp == null) ? false : xp.red; |
1059 |
|
if ((sl = sib.left) != null) |
1060 |
|
sl.red = false; |
1061 |
|
} |