Lines Matching refs:left
37 if t.left != nil {
38 s = t.left.String() + " "
48 // Standard conventions hold for left = smaller, right = larger
49 left, right, parent *node32
174 return t.left == nil && t.right == nil
178 if t.left != nil {
179 t.left.visitInOrder(f)
188 if t.left == nil {
195 return t.left.rank
197 if t.right.rank > t.left.rank {
200 return t.left.rank
204 if t.left == nil || t.right == nil {
207 if t.right.rank < t.left.rank {
210 return t.left.rank
216 t = t.left
230 for t.left != nil {
231 t = t.left
253 // t is too big, glb is to left.
254 t = t.left
276 t = t.left
290 if t.left == nil {
293 t.left = n
298 new_l, newnode = t.left.insert(x, w)
299 t.left = new_l
304 if new_l.left.Rank() < new_l.right.Rank() {
306 t.left = new_l.rightToRoot()
328 if newrank > 1+t.left.Rank() { // rotations required
329 if new_r.right.Rank() < new_r.left.Rank() {
345 // left right
352 // left rl
355 rl := right.left
357 right.left = t
369 // left right
374 // left
378 left := t.left
379 lr := left.right
380 left.parent = t.parent
381 left.right = t
382 t.parent = left
384 t.left = lr
388 return left
391 // next returns the successor of t in a left-to-right
399 // if t is p.left, then p, else repeat.
402 if p.left == t {
411 // prev returns the predecessor of t in a left-to-right
414 // If there is a left child, it is to the left
415 l := t.left
