508     ActiveEdge(const SkPoint& p0, const SkVector& v, uint16_t index0, uint16_t index1)  in ActiveEdge()
510         , fIndex0(index0)
586     bool intersect(const SkPoint& q0, const SkVector& w, uint16_t index0, uint16_t index1) const {  in intersect()
588         if (this->fIndex0 == index0 || this->fIndex1 == index0 ||  in intersect()
636     bool equals(uint16_t index0, uint16_t index1) const {  in equals()
637         return (this->fIndex0 == index0 && this->fIndex1 == index1);  in equals()
661     bool insert(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {  in insert()  argument
668             ActiveEdge* root = fTreeHead.fChild[1] = this->allocate(p0, v, index0, index1);  in insert()
692                 if ((pred && pred->intersect(p0, v, index0, index1)) ||  in insert()
693                     (succ && succ->intersect(p0, v, index0, index1))) {  in insert()
697                 parent->fChild[dir] = curr = this->allocate(p0, v, index0, index1);  in insert()
737             if (curr->fIndex0 == index0) {  in insert()
772                  uint16_t index0, uint16_t index1, uint16_t index2) {  in replace()  argument
787             if (curr->equals(index0, index1)) {  in replace()
830     bool remove(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {  in remove()  argument
850             if (curr->equals(index0, index1)) {  in remove()
943     ActiveEdge * allocate(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {  in allocate()  argument
949         return new(bytes) ActiveEdge(p0, p1, index0, index1);  in allocate()