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