Lines Matching defs:fChildren
147 Node* fChildren[2];
257 n = n->fChildren[kLeft_Child];
262 n = n->fChildren[kRight_Child];
274 n = n->fChildren[kLeft_Child];
279 n = n->fChildren[kLeft_Child];
281 n = n->fChildren[kRight_Child];
294 n = n->fChildren[kLeft_Child];
300 n = n->fChildren[kRight_Child];
316 n = n->fChildren[kLeft_Child];
320 count += onCountOf(n->fChildren[kLeft_Child], t);
321 count += onCountOf(n->fChildren[kRight_Child], t);
324 n = n->fChildren[kRight_Child];
347 x->fChildren[kLeft_Child] = NULL;
348 x->fChildren[kRight_Child] = NULL;
368 n = p->fChildren[pc];
384 p->fChildren[pc] = x;
395 GrAssert(NULL == p || p->fChildren[pc] == x);
396 GrAssert(NULL == gp || gp->fChildren[gpc] == p);
410 Node* u = gp->fChildren[1-gpc];
428 pc = (p->fChildren[kLeft_Child] == x) ? kLeft_Child :
431 gpc = (gp->fChildren[kLeft_Child] == p) ? kLeft_Child :
439 GrAssert(NULL == gp->fChildren[1-gpc] || kBlack_Color == gp->fChildren[1-gpc]->fColor);
465 GrAssert(NULL == p->fChildren[1-pc] ||
466 kBlack_Color == p->fChildren[1-pc]->fColor);
493 Node* s = n->fChildren[kLeft_Child];
495 Node* b = s->fChildren[kRight_Child];
498 Child c = d->fChildren[kLeft_Child] == n ? kLeft_Child :
500 d->fChildren[c] = s;
506 s->fChildren[kRight_Child] = n;
508 n->fChildren[kLeft_Child] = b;
516 GR_DEBUGASSERT(validateChildRelations(n->fChildren[kRight_Child], true));
518 GR_DEBUGASSERT(validateChildRelations(s->fChildren[kLeft_Child], true));
525 Node* s = n->fChildren[kRight_Child];
527 Node* b = s->fChildren[kLeft_Child];
530 Child c = d->fChildren[kRight_Child] == n ? kRight_Child :
532 d->fChildren[c] = s;
538 s->fChildren[kLeft_Child] = n;
540 n->fChildren[kRight_Child] = b;
548 GR_DEBUGASSERT(validateChildRelations(n->fChildren[kLeft_Child], true));
550 GR_DEBUGASSERT(validateChildRelations(s->fChildren[kRight_Child], true));
556 if (NULL != x->fChildren[kRight_Child]) {
557 x = x->fChildren[kRight_Child];
558 while (NULL != x->fChildren[kLeft_Child]) {
559 x = x->fChildren[kLeft_Child];
563 while (NULL != x->fParent && x == x->fParent->fChildren[kRight_Child]) {
572 if (NULL != x->fChildren[kLeft_Child]) {
573 x = x->fChildren[kLeft_Child];
574 while (NULL != x->fChildren[kRight_Child]) {
575 x = x->fChildren[kRight_Child];
579 while (NULL != x->fParent && x == x->fParent->fChildren[kLeft_Child]) {
591 bool hasLeft = NULL != x->fChildren[kLeft_Child];
592 bool hasRight = NULL != x->fChildren[kRight_Child];
601 Node* s = x->fChildren[kRight_Child];
602 while (NULL != s->fChildren[kLeft_Child]) {
603 s = s->fChildren[kLeft_Child];
615 fRoot = x->fChildren[c];
639 pc = p->fChildren[kLeft_Child] == x ? kLeft_Child : kRight_Child;
641 if (NULL == x->fChildren[c]) {
651 p->fChildren[pc] = NULL;
661 Node* s = p->fChildren[1-pc];
688 sl = s->fChildren[kLeft_Child];
689 sr = s->fChildren[kRight_Child];
709 sl = s->fChildren[kLeft_Child];
710 sr = s->fChildren[kRight_Child];
740 pc = p->fChildren[kLeft_Child] == x ? kLeft_Child :
744 s = p->fChildren[1-pc];
770 //sl = s->fChildren[kLeft_Child]; don't need this
777 //sr = s->fChildren[kRight_Child]; don't need this
809 GrAssert(kRed_Color == x->fChildren[c]->fColor);
812 Node* c1 = x->fChildren[c];
816 while (NULL != fFirst->fChildren[kLeft_Child]) {
817 fFirst = fFirst->fChildren[kLeft_Child];
823 while (NULL != fLast->fChildren[kRight_Child]) {
824 fLast = fLast->fChildren[kRight_Child];
829 p->fChildren[pc] = c1;
840 RecursiveDelete(x->fChildren[kLeft_Child]);
841 RecursiveDelete(x->fChildren[kRight_Child]);
858 GrAssert(0 == fRoot->fChildren[kLeft_Child]);
859 GrAssert(0 == fRoot->fChildren[kRight_Child]);
884 int cl = checkNode(n->fChildren[kLeft_Child], &leftBh);
885 int cr = checkNode(n->fChildren[kRight_Child], &rightBh);
897 if (NULL != n->fChildren[kLeft_Child] ||
898 NULL != n->fChildren[kRight_Child]) {
899 if (n->fChildren[kLeft_Child] == n->fChildren[kRight_Child]) {
902 if (n->fChildren[kLeft_Child] == n->fParent &&
906 if (n->fChildren[kRight_Child] == n->fParent &&
910 if (NULL != n->fChildren[kLeft_Child]) {
912 kRed_Color == n->fChildren[kLeft_Child]->fColor &&
916 if (n->fChildren[kLeft_Child]->fParent != n) {
919 if (!(fComp(n->fChildren[kLeft_Child]->fItem, n->fItem) ||
920 (!fComp(n->fChildren[kLeft_Child]->fItem, n->fItem) &&
921 !fComp(n->fItem, n->fChildren[kLeft_Child]->fItem)))) {
925 if (NULL != n->fChildren[kRight_Child]) {
927 kRed_Color == n->fChildren[kRight_Child]->fColor &&
931 if (n->fChildren[kRight_Child]->fParent != n) {
934 if (!(fComp(n->fItem, n->fChildren[kRight_Child]->fItem) ||
935 (!fComp(n->fChildren[kRight_Child]->fItem, n->fItem) &&
936 !fComp(n->fItem, n->fChildren[kRight_Child]->fItem)))) {
