Lines Matching defs:left
57 left: GeneratePayloadTree(depth - 1, tag),
173 node.left = this.root_;
178 node.left = this.root_.left;
179 this.root_.left = null;
202 if (!this.root_.left) {
206 this.root_ = this.root_.left;
260 // the left subtree.
263 } else if (this.root_.left) {
264 return this.findMax(this.root_.left);
299 // the L tree of the algorithm. The left child of the dummy node
300 // will hold the R tree of the algorithm. Using a dummy node, left
302 var dummy, left, right;
303 dummy = left = right = new SplayTree.Node(null, null);
307 if (!current.left) {
310 if (key < current.left.key) {
312 var tmp = current.left;
313 current.left = tmp.right;
316 if (!current.left) {
321 right.left = current;
323 current = current.left;
329 // Rotate left.
331 current.right = tmp.left;
332 tmp.left = current;
338 // Link left.
339 left.right = current;
340 left = current;
347 left.right = current.left;
348 right.left = current.right;
349 current.left = dummy.right;
350 current.right = dummy.left;
370 SplayTree.Node.prototype.left = null;
389 var left = current.left;
390 if (left) left.traverse_(f);
