538     ActiveEdge(const SkPoint& p0, const SkVector& v, uint16_t index0, uint16_t index1)  in ActiveEdge()
541         , fIndex1(index1)
616     bool intersect(const SkPoint& q0, const SkVector& w, uint16_t index0, uint16_t index1) const {  in intersect()
619             this->fIndex0 == index1 || this->fIndex1 == index1) {  in intersect()
666     bool equals(uint16_t index0, uint16_t index1) const {  in equals()
667         return (this->fIndex0 == index0 && this->fIndex1 == index1);  in equals()
691     bool insert(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {  in insert()  argument
698             ActiveEdge* root = fTreeHead.fChild[1] = this->allocate(p0, v, index0, index1);  in insert()
722                 if ((pred && pred->intersect(p0, v, index0, index1)) ||  in insert()
723                     (succ && succ->intersect(p0, v, index0, index1))) {  in insert()
727                 parent->fChild[dir] = curr = this->allocate(p0, v, index0, index1);  in insert()
802                  uint16_t index0, uint16_t index1, uint16_t index2) {  in replace()  argument
817             if (curr->equals(index0, index1)) {  in replace()
823                 if (curr->fIndex1 == index1) {  in replace()
843         if (pred && (pred->intersect(found) || pred->intersect(p1, v, index1, index2))) {  in replace()
846         if (succ && (succ->intersect(found) || succ->intersect(p1, v, index1, index2))) {  in replace()
851         found->fIndex0 = index1;  in replace()
860     bool remove(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {  in remove()  argument
880             if (curr->equals(index0, index1)) {  in remove()
886                 if (curr->fIndex1 == index1) {  in remove()
973     ActiveEdge * allocate(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {  in allocate()  argument
979         return new(bytes) ActiveEdge(p0, p1, index0, index1);  in allocate()