522     ActiveEdge(const SkPoint& p0, const SkVector& v, uint16_t index0, uint16_t index1)  in ActiveEdge()
525         , fIndex1(index1)
600     bool intersect(const SkPoint& q0, const SkVector& w, uint16_t index0, uint16_t index1) const {  in intersect()
603             this->fIndex0 == index1 || this->fIndex1 == index1) {  in intersect()
650     bool equals(uint16_t index0, uint16_t index1) const {  in equals()
651         return (this->fIndex0 == index0 && this->fIndex1 == index1);  in equals()
675     bool insert(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {  in insert()  argument
682             ActiveEdge* root = fTreeHead.fChild[1] = this->allocate(p0, v, index0, index1);  in insert()
706                 if ((pred && pred->intersect(p0, v, index0, index1)) ||  in insert()
707                     (succ && succ->intersect(p0, v, index0, index1))) {  in insert()
711                 parent->fChild[dir] = curr = this->allocate(p0, v, index0, index1);  in insert()
786                  uint16_t index0, uint16_t index1, uint16_t index2) {  in replace()  argument
801             if (curr->equals(index0, index1)) {  in replace()
807                 if (curr->fIndex1 == index1) {  in replace()
827         if (pred && (pred->intersect(found) || pred->intersect(p1, v, index1, index2))) {  in replace()
830         if (succ && (succ->intersect(found) || succ->intersect(p1, v, index1, index2))) {  in replace()
835         found->fIndex0 = index1;  in replace()
844     bool remove(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {  in remove()  argument
864             if (curr->equals(index0, index1)) {  in remove()
870                 if (curr->fIndex1 == index1) {  in remove()
957     ActiveEdge * allocate(const SkPoint& p0, const SkPoint& p1, uint16_t index0, uint16_t index1) {  in allocate()  argument
963         return new(bytes) ActiveEdge(p0, p1, index0, index1);  in allocate()