Lines Matching refs:fChild

537     ActiveEdge() : fChild{ nullptr, nullptr }, fAbove(nullptr), fBelow(nullptr), fRed(false) {}
545 fChild[0] = nullptr;
546 fChild[1] = nullptr;
673 ActiveEdge* fChild[2];
687 fTreeHead.fChild[1] = nullptr;
697 if (!fTreeHead.fChild[1]) {
698 ActiveEdge* root = fTreeHead.fChild[1] = this->allocate(p0, v, index0, index1);
711 ActiveEdge *curr = top->fChild[1];
727 parent->fChild[dir] = curr = this->allocate(p0, v, index0, index1);
741 int dir2 = (top->fChild[1] == grandparent);
742 if (curr == parent->fChild[last]) {
743 top->fChild[dir2] = SingleRotation(grandparent, !last);
745 top->fChild[dir2] = DoubleRotation(grandparent, !last);
749 } else if (IsRed(curr->fChild[0]) && IsRed(curr->fChild[1])) {
752 curr->fChild[0]->fRed = false;
753 curr->fChild[1]->fRed = false;
755 int dir2 = (top->fChild[1] == grandparent);
756 if (curr == parent->fChild[last]) {
757 top->fChild[dir2] = SingleRotation(grandparent, !last);
759 top->fChild[dir2] = DoubleRotation(grandparent, !last);
789 curr = curr->fChild[dir];
793 fTreeHead.fChild[1]->fRed = false;
795 SkDEBUGCODE(VerifyTree(fTreeHead.fChild[1]));
803 if (!fTreeHead.fChild[1]) {
813 while (curr->fChild[dir] != nullptr) {
815 curr = curr->fChild[dir];
855 SkDEBUGCODE(VerifyTree(fTreeHead.fChild[1]));
861 if (!fTreeHead.fChild[1]) {
872 while (curr->fChild[dir] != nullptr) {
878 curr = curr->fChild[dir];
898 if (!IsRed(curr) && !IsRed(curr->fChild[dir])) {
899 if (IsRed(curr->fChild[!dir])) {
900 parent = parent->fChild[last] = SingleRotation(curr, dir);
902 ActiveEdge *s = parent->fChild[!last];
905 if (!IsRed(s->fChild[!last]) && !IsRed(s->fChild[last])) {
911 int dir2 = (grandparent->fChild[1] == parent);
913 if (IsRed(s->fChild[last])) {
914 grandparent->fChild[dir2] = DoubleRotation(parent, last);
915 } else if (IsRed(s->fChild[!last])) {
916 grandparent->fChild[dir2] = SingleRotation(parent, last);
920 curr->fRed = grandparent->fChild[dir2]->fRed = true;
921 grandparent->fChild[dir2]->fChild[0]->fRed = false;
922 grandparent->fChild[dir2]->fChild[1]->fRed = false;
951 parent->fChild[parent->fChild[1] == curr] = curr->fChild[!curr->fChild[0]];
956 if (fTreeHead.fChild[1]) {
957 fTreeHead.fChild[1]->fRed = false;
962 if (fTreeHead.fChild[1]) {
963 fTreeHead.fChild[1]->fRed = false;
966 SkDEBUGCODE(VerifyTree(fTreeHead.fChild[1]));
990 ActiveEdge* tmp = node->fChild[!dir];
992 node->fChild[!dir] = tmp->fChild[dir];
993 tmp->fChild[dir] = node;
1002 node->fChild[!dir] = SingleRotation(node->fChild[!dir], !dir);
1013 const ActiveEdge* left = tree->fChild[0];
1014 const ActiveEdge* right = tree->fChild[1];