141         kRight_Child = 1  enumerator
264             n = n->fChildren[kRight_Child];  in find()
283                 n = n->fChildren[kRight_Child];  in findFirst()
302             n = n->fChildren[kRight_Child];  in findLast()
323                 count += onCountOf(n->fChildren[kRight_Child], t);  in onCountOf()
326             n = n->fChildren[kRight_Child];  in onCountOf()
350     x->fChildren[kRight_Child] = NULL;  in insert()
365         pc = fComp(x->fItem, n->fItem) ? kLeft_Child : kRight_Child;  in insert()
367         last = last && kRight_Child == pc;  in insert()
431                                                     kRight_Child;  in insert()
434                                                           kRight_Child;  in insert()
449         if (kRight_Child == pc) {  in insert()
460             pc = kRight_Child;  in insert()
497     Node* b = s->fChildren[kRight_Child];  in rotateRight()
501                                              kRight_Child;  in rotateRight()
508     s->fChildren[kRight_Child] = n;  in rotateRight()
518     GR_DEBUGASSERT(validateChildRelations(n->fChildren[kRight_Child], true));  in rotateRight()
527     Node* s = n->fChildren[kRight_Child];  in rotateLeft()
532         Child c = d->fChildren[kRight_Child] == n ? kRight_Child :  in rotateLeft()
542     n->fChildren[kRight_Child] = b;  in rotateLeft()
552     GR_DEBUGASSERT(validateChildRelations(s->fChildren[kRight_Child], true));  in rotateLeft()
558     if (x->fChildren[kRight_Child]) {  in SuccessorNode()
559         x = x->fChildren[kRight_Child];  in SuccessorNode()
565     while (x->fParent && x == x->fParent->fChildren[kRight_Child]) {  in SuccessorNode()
576         while (x->fChildren[kRight_Child]) {  in PredecessorNode()
577             x = x->fChildren[kRight_Child];  in PredecessorNode()
594     bool hasRight = SkToBool(x->fChildren[kRight_Child]);  in deleteAtNode()
595     Child c = hasLeft ? kLeft_Child : kRight_Child;  in deleteAtNode()
603         Node* s = x->fChildren[kRight_Child];  in deleteAtNode()
612         c = kRight_Child;  in deleteAtNode()
625                 SkASSERT(c == kRight_Child);  in deleteAtNode()
641     pc = p->fChildren[kLeft_Child] == x ? kLeft_Child : kRight_Child;  in deleteAtNode()
691             sr = s->fChildren[kRight_Child];  in deleteAtNode()
712                 sr = s->fChildren[kRight_Child];  in deleteAtNode()
743                                                               kRight_Child;  in deleteAtNode()
773         } else if (kRight_Child == pc && !slRed) {  in deleteAtNode()
816             SkASSERT(c == kRight_Child);  in deleteAtNode()
825             while (fLast->fChildren[kRight_Child]) {  in deleteAtNode()
826                 fLast = fLast->fChildren[kRight_Child];  in deleteAtNode()
843         RecursiveDelete(x->fChildren[kRight_Child]);  in RecursiveDelete()
861             SkASSERT(0 == fRoot->fChildren[kRight_Child]);  in validate()
887         int cr = checkNode(n->fChildren[kRight_Child], &rightBh);  in checkNode()
900             n->fChildren[kRight_Child]) {  in validateChildRelations()
901             if (n->fChildren[kLeft_Child] == n->fChildren[kRight_Child]) {  in validateChildRelations()
908             if (n->fChildren[kRight_Child] == n->fParent &&  in validateChildRelations()
927             if (n->fChildren[kRight_Child]) {  in validateChildRelations()
929                     kRed_Color == n->fChildren[kRight_Child]->fColor &&  in validateChildRelations()
933                 if (n->fChildren[kRight_Child]->fParent != n) {  in validateChildRelations()
936                 if (!(fComp(n->fItem, n->fChildren[kRight_Child]->fItem) ||  in validateChildRelations()
937                       (!fComp(n->fChildren[kRight_Child]->fItem, n->fItem) &&  in validateChildRelations()
938                        !fComp(n->fItem, n->fChildren[kRight_Child]->fItem)))) {  in validateChildRelations()