Lines Matching refs:right
282 * left and right children may need to be searched in the case of
1863 TreeNode<K,V> right;
1886 TreeNode<K,V> pl = p.left, pr = p.right;
1940 x.left = x.right = null;
1962 if ((p = (dir <= 0) ? p.left : p.right) == null) {
1967 xp.right = x;
2076 else if ((pr = p.right) == null ||
2083 if ((p = (dir < 0) ? p.left : p.right) == null) {
2091 xp.right = x;
2133 if ((r = root) == null || r.right == null || // too small
2140 TreeNode<K,V> pr = p.right;
2146 TreeNode<K,V> sr = s.right;
2150 s.right = p;
2158 sp.right = p;
2160 if ((s.right = pr) != null)
2164 if ((p.right = sr) != null)
2173 pp.right = s;
2192 pp.right = replacement;
2193 p.left = p.right = p.parent = null;
2203 else if (p == pp.right)
2204 pp.right = null;
2221 if (p != null && (r = p.right) != null) {
2222 if ((rl = p.right = r.left) != null)
2229 pp.right = r;
2240 if ((lr = p.left = l.right) != null)
2244 else if (pp.right == p)
2245 pp.right = l;
2248 l.right = p;
2265 if ((xppr = xpp.right) != null && xppr.red) {
2272 if (x == xp.right) {
2323 if ((xpr = xp.right) != null && xpr.red) {
2327 xpr = (xp = x.parent) == null ? null : xp.right;
2332 TreeNode<K,V> sl = xpr.left, sr = xpr.right;
2345 null : xp.right;
2349 if ((sr = xpr.right) != null)
2370 TreeNode<K,V> sl = xpl.left, sr = xpl.right;
2405 TreeNode<K,V> tp = t.parent, tl = t.left, tr = t.right,
2411 if (tp != null && t != tp.left && t != tp.right)