Lines Matching refs:kLeft_Child
140 kLeft_Child = 0, enumerator
259 n = n->fChildren[kLeft_Child]; in find()
276 n = n->fChildren[kLeft_Child]; in findFirst()
281 n = n->fChildren[kLeft_Child]; in findFirst()
296 n = n->fChildren[kLeft_Child]; in findLast()
318 n = n->fChildren[kLeft_Child]; in onCountOf()
322 count += onCountOf(n->fChildren[kLeft_Child], t); in onCountOf()
349 x->fChildren[kLeft_Child] = NULL; in insert()
358 Child pc = kLeft_Child; // suppress uninit warning in insert()
359 Child gpc = kLeft_Child; in insert()
365 pc = fComp(x->fItem, n->fItem) ? kLeft_Child : kRight_Child; in insert()
366 first = first && kLeft_Child == pc; in insert()
430 pc = (p->fChildren[kLeft_Child] == x) ? kLeft_Child : in insert()
433 gpc = (gp->fChildren[kLeft_Child] == p) ? kLeft_Child : in insert()
454 pc = kLeft_Child; in insert()
474 if (kLeft_Child == pc) { in insert()
495 Node* s = n->fChildren[kLeft_Child]; in rotateRight()
500 Child c = d->fChildren[kLeft_Child] == n ? kLeft_Child : in rotateRight()
510 n->fChildren[kLeft_Child] = b; in rotateRight()
520 GR_DEBUGASSERT(validateChildRelations(s->fChildren[kLeft_Child], true)); in rotateRight()
529 Node* b = s->fChildren[kLeft_Child]; in rotateLeft()
533 kLeft_Child; in rotateLeft()
540 s->fChildren[kLeft_Child] = n; in rotateLeft()
550 GR_DEBUGASSERT(validateChildRelations(n->fChildren[kLeft_Child], true)); in rotateLeft()
560 while (x->fChildren[kLeft_Child]) { in SuccessorNode()
561 x = x->fChildren[kLeft_Child]; in SuccessorNode()
574 if (x->fChildren[kLeft_Child]) { in PredecessorNode()
575 x = x->fChildren[kLeft_Child]; in PredecessorNode()
581 while (x->fParent && x == x->fParent->fChildren[kLeft_Child]) { in PredecessorNode()
593 bool hasLeft = SkToBool(x->fChildren[kLeft_Child]); in deleteAtNode()
595 Child c = hasLeft ? kLeft_Child : kRight_Child; in deleteAtNode()
604 while (s->fChildren[kLeft_Child]) { in deleteAtNode()
605 s = s->fChildren[kLeft_Child]; in deleteAtNode()
622 SkASSERT(c == kLeft_Child); in deleteAtNode()
641 pc = p->fChildren[kLeft_Child] == x ? kLeft_Child : kRight_Child; in deleteAtNode()
690 sl = s->fChildren[kLeft_Child]; in deleteAtNode()
704 if (kLeft_Child == pc) { in deleteAtNode()
711 sl = s->fChildren[kLeft_Child]; in deleteAtNode()
742 pc = p->fChildren[kLeft_Child] == x ? kLeft_Child : in deleteAtNode()
766 if (kLeft_Child == pc && !srRed) { in deleteAtNode()
791 if (kLeft_Child == pc) { in deleteAtNode()
818 while (fFirst->fChildren[kLeft_Child]) { in deleteAtNode()
819 fFirst = fFirst->fChildren[kLeft_Child]; in deleteAtNode()
823 SkASSERT(c == kLeft_Child); in deleteAtNode()
842 RecursiveDelete(x->fChildren[kLeft_Child]); in RecursiveDelete()
860 SkASSERT(0 == fRoot->fChildren[kLeft_Child]); in validate()
886 int cl = checkNode(n->fChildren[kLeft_Child], &leftBh); in checkNode()
899 if (n->fChildren[kLeft_Child] || in validateChildRelations()
901 if (n->fChildren[kLeft_Child] == n->fChildren[kRight_Child]) { in validateChildRelations()
904 if (n->fChildren[kLeft_Child] == n->fParent && in validateChildRelations()
912 if (n->fChildren[kLeft_Child]) { in validateChildRelations()
914 kRed_Color == n->fChildren[kLeft_Child]->fColor && in validateChildRelations()
918 if (n->fChildren[kLeft_Child]->fParent != n) { in validateChildRelations()
921 if (!(fComp(n->fChildren[kLeft_Child]->fItem, n->fItem) || in validateChildRelations()
922 (!fComp(n->fChildren[kLeft_Child]->fItem, n->fItem) && in validateChildRelations()
923 !fComp(n->fItem, n->fChildren[kLeft_Child]->fItem)))) { in validateChildRelations()