193     bool sweep_lt(const SkPoint& a, const SkPoint& b) const {  in sweep_lt()  function
549     if (line.intersect(bisector.fLine, &p) && !c.sweep_lt(p, top->fPoint) &&  in create_event()
550                                                c.sweep_lt(p, bottom->fPoint)) {  in create_event()
883     int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1;  in new_edge()
922         c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) {  in insert_edge_above()
940         c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) {  in insert_edge_below()
981     if (!current || *current == dst || c.sweep_lt((*current)->fPoint, dst->fPoint)) {  in rewind()
1028     } else if (c.sweep_lt(edge->fTop->fPoint, other->fTop->fPoint)) {  in merge_edges_above()
1049     } else if (c.sweep_lt(edge->fBottom->fPoint, other->fBottom->fPoint)) {  in merge_edges_below()
1107     if (c.sweep_lt(v->fPoint, edge->fTop->fPoint)) {  in split_edge()
1111     } else if (c.sweep_lt(edge->fBottom->fPoint, v->fPoint)) {  in split_edge()
1134     if (c.sweep_lt(left->fTop->fPoint, right->fTop->fPoint)) {  in intersect_edge_pair()
1145     if (c.sweep_lt(right->fBottom->fPoint, left->fBottom->fPoint)) {  in intersect_edge_pair()
1193     while (prevV && c.sweep_lt(p, prevV->fPoint)) {  in create_sorted_vertex()
1197     while (nextV && c.sweep_lt(nextV->fPoint, p)) {  in create_sorted_vertex()
1232     if (c.sweep_lt(p, min)) {  in clamp()
1234     } else if (c.sweep_lt(max, p)) {  in clamp()
1273         while (top && c.sweep_lt(p, top->fPoint)) {  in check_for_intersection()
1343         if (c.sweep_lt(v->fPoint, v->fPrev->fPoint)) {  in merge_coincident_vertices()
1385 template <CompareFunc sweep_lt>
1390         if (sweep_lt(a->fPoint, b->fPoint)) {  in sorted_merge()
1420 template <CompareFunc sweep_lt>
1441     merge_sort<sweep_lt>(&front);  in merge_sort()
1442     merge_sort<sweep_lt>(&back);  in merge_sort()
1445     sorted_merge<sweep_lt>(&front, &back, vertices);  in merge_sort()
1494     } else if (c.sweep_lt(left->fTop->fPoint, right->fTop->fPoint)) {  in validate_edge_pair()
1502     } else if (c.sweep_lt(right->fBottom->fPoint, left->fBottom->fPoint)) {  in validate_edge_pair()
1943     int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1;  in inversion()