79 bool GrTriangulator::Comparator::sweep_lt(const SkPoint& a, const SkPoint& b) const {  in sweep_lt()  function in GrTriangulator::Comparator
622     int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1;  in makeEdge()
655         c.sweep_lt(fBottom->fPoint, fTop->fPoint)) {  in insertAbove()
673         c.sweep_lt(fBottom->fPoint, fTop->fPoint)) {  in insertBelow()
711     if (!current || *current == dst || c.sweep_lt((*current)->fPoint, dst->fPoint)) {  in rewind()
726             if (c.sweep_lt(top->fPoint, dst->fPoint) &&  in rewind()
746         if (c.sweep_lt(leftTop->fPoint, top->fPoint) && !edge->fLeft->isLeftOf(top)) {  in rewind_if_necessary()
748         } else if (c.sweep_lt(top->fPoint, leftTop->fPoint) && !edge->isRightOf(leftTop)) {  in rewind_if_necessary()
750         } else if (c.sweep_lt(bottom->fPoint, leftBottom->fPoint) &&  in rewind_if_necessary()
753         } else if (c.sweep_lt(leftBottom->fPoint, bottom->fPoint) && !edge->isRightOf(leftBottom)) {  in rewind_if_necessary()
760         if (c.sweep_lt(rightTop->fPoint, top->fPoint) && !edge->fRight->isRightOf(top)) {  in rewind_if_necessary()
762         } else if (c.sweep_lt(top->fPoint, rightTop->fPoint) && !edge->isLeftOf(rightTop)) {  in rewind_if_necessary()
764         } else if (c.sweep_lt(bottom->fPoint, rightBottom->fPoint) &&  in rewind_if_necessary()
767         } else if (c.sweep_lt(rightBottom->fPoint, bottom->fPoint) &&  in rewind_if_necessary()
812     } else if (c.sweep_lt(edge->fTop->fPoint, other->fTop->fPoint)) {  in mergeEdgesAbove()
833     } else if (c.sweep_lt(edge->fBottom->fPoint, other->fBottom->fPoint)) {  in mergeEdgesBelow()
894     if (c.sweep_lt(v->fPoint, edge->fTop->fPoint)) {  in splitEdge()
901     } else if (c.sweep_lt(edge->fBottom->fPoint, v->fPoint)) {  in splitEdge()
930     if (c.sweep_lt(left->fTop->fPoint, right->fTop->fPoint)) {  in intersectEdgePair()
941     if (c.sweep_lt(right->fBottom->fPoint, left->fBottom->fPoint)) {  in intersectEdgePair()
989     while (prevV && c.sweep_lt(p, prevV->fPoint)) {  in makeSortedVertex()
993     while (nextV && c.sweep_lt(nextV->fPoint, p)) {  in makeSortedVertex()
1070         while (top && c.sweep_lt(p, top->fPoint)) {  in checkForIntersection()
1147         if (c.sweep_lt(v->fPoint, v->fPrev->fPoint)) {  in mergeCoincidentVertices()
1175 template <CompareFunc sweep_lt>
1180         if (sweep_lt(a->fPoint, b->fPoint)) {  in sorted_merge()
1211 template <CompareFunc sweep_lt>
1232     merge_sort<sweep_lt>(&front);  in merge_sort()
1233     merge_sort<sweep_lt>(&back);  in merge_sort()
1236     sorted_merge<sweep_lt>(&front, &back, vertices);  in merge_sort()
1267     } else if (c.sweep_lt(left->fTop->fPoint, right->fTop->fPoint)) {  in validate_edge_pair()
1275     } else if (c.sweep_lt(right->fBottom->fPoint, left->fBottom->fPoint)) {  in validate_edge_pair()