166     CompareFunc sweep_lt;  member
639     int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1;  in new_edge()
683             (c.sweep_lt(edge->fBottom->fPoint, next->fBottom->fPoint) &&  in find_enclosing_edges()
685             (c.sweep_lt(next->fBottom->fPoint, edge->fBottom->fPoint) &&  in find_enclosing_edges()
800     } else if (c.sweep_lt(edge->fTop->fPoint, other->fTop->fPoint)) {  in merge_edges_above()
820     } else if (c.sweep_lt(edge->fBottom->fPoint, other->fBottom->fPoint)) {  in merge_edges_below()
860         } else if (c.sweep_lt(bottom->fPoint, leftBottom->fPoint) &&  in cleanup_active_edges()
863         } else if (c.sweep_lt(leftBottom->fPoint, bottom->fPoint) && !edge->isRightOf(leftBottom)) {  in cleanup_active_edges()
874         } else if (c.sweep_lt(bottom->fPoint, rightBottom->fPoint) &&  in cleanup_active_edges()
877         } else if (c.sweep_lt(rightBottom->fPoint, bottom->fPoint) &&  in cleanup_active_edges()
888     if (c.sweep_lt(v->fPoint, edge->fTop->fPoint)) {  in split_edge()
928         if (p == edge->fTop->fPoint || c.sweep_lt(p, edge->fTop->fPoint)) {  in check_for_intersection()
934         } else if (p == other->fTop->fPoint || c.sweep_lt(p, other->fTop->fPoint)) {  in check_for_intersection()
942             while (c.sweep_lt(p, nextV->fPoint)) {  in check_for_intersection()
945             while (c.sweep_lt(nextV->fPoint, p)) {  in check_for_intersection()
1000         if (c.sweep_lt(v->fPoint, v->fPrev->fPoint)) {  in merge_coincident_vertices()
1100         if (c.sweep_lt(a->fPoint, b->fPoint)) {  in sorted_merge()
1151                     if (c.sweep_lt(pv->fPoint, v->fPoint)) {  in simplify()
1295         c.sweep_lt = sweep_lt_horiz;  in contours_to_polys()
1298         c.sweep_lt = sweep_lt_vert;  in contours_to_polys()