Lines Matching refs:fChild
520 ActiveEdge() : fChild{ nullptr, nullptr }, fAbove(nullptr), fBelow(nullptr), fRed(false) {}
528 fChild[0] = nullptr;
529 fChild[1] = nullptr;
656 ActiveEdge* fChild[2];
670 fTreeHead.fChild[1] = nullptr;
680 if (!fTreeHead.fChild[1]) {
681 ActiveEdge* root = fTreeHead.fChild[1] = this->allocate(p0, v, index0, index1);
694 ActiveEdge *curr = top->fChild[1];
710 parent->fChild[dir] = curr = this->allocate(p0, v, index0, index1);
724 int dir2 = (top->fChild[1] == grandparent);
725 if (curr == parent->fChild[last]) {
726 top->fChild[dir2] = SingleRotation(grandparent, !last);
728 top->fChild[dir2] = DoubleRotation(grandparent, !last);
732 } else if (IsRed(curr->fChild[0]) && IsRed(curr->fChild[1])) {
735 curr->fChild[0]->fRed = false;
736 curr->fChild[1]->fRed = false;
738 int dir2 = (top->fChild[1] == grandparent);
739 if (curr == parent->fChild[last]) {
740 top->fChild[dir2] = SingleRotation(grandparent, !last);
742 top->fChild[dir2] = DoubleRotation(grandparent, !last);
772 curr = curr->fChild[dir];
776 fTreeHead.fChild[1]->fRed = false;
778 SkDEBUGCODE(VerifyTree(fTreeHead.fChild[1]));
786 if (!fTreeHead.fChild[1]) {
796 while (curr->fChild[dir] != nullptr) {
798 curr = curr->fChild[dir];
838 SkDEBUGCODE(VerifyTree(fTreeHead.fChild[1]));
844 if (!fTreeHead.fChild[1]) {
855 while (curr->fChild[dir] != nullptr) {
861 curr = curr->fChild[dir];
881 if (!IsRed(curr) && !IsRed(curr->fChild[dir])) {
882 if (IsRed(curr->fChild[!dir])) {
883 parent = parent->fChild[last] = SingleRotation(curr, dir);
885 ActiveEdge *s = parent->fChild[!last];
888 if (!IsRed(s->fChild[!last]) && !IsRed(s->fChild[last])) {
894 int dir2 = (grandparent->fChild[1] == parent);
896 if (IsRed(s->fChild[last])) {
897 grandparent->fChild[dir2] = DoubleRotation(parent, last);
898 } else if (IsRed(s->fChild[!last])) {
899 grandparent->fChild[dir2] = SingleRotation(parent, last);
903 curr->fRed = grandparent->fChild[dir2]->fRed = true;
904 grandparent->fChild[dir2]->fChild[0]->fRed = false;
905 grandparent->fChild[dir2]->fChild[1]->fRed = false;
934 parent->fChild[parent->fChild[1] == curr] = curr->fChild[!curr->fChild[0]];
939 if (fTreeHead.fChild[1]) {
940 fTreeHead.fChild[1]->fRed = false;
945 if (fTreeHead.fChild[1]) {
946 fTreeHead.fChild[1]->fRed = false;
949 SkDEBUGCODE(VerifyTree(fTreeHead.fChild[1]));
973 ActiveEdge* tmp = node->fChild[!dir];
975 node->fChild[!dir] = tmp->fChild[dir];
976 tmp->fChild[dir] = node;
985 node->fChild[!dir] = SingleRotation(node->fChild[!dir], !dir);
996 const ActiveEdge* left = tree->fChild[0];
997 const ActiveEdge* right = tree->fChild[1];
