167     CompareFunc sweep_gt;  member
681         if ((c.sweep_gt(edge->fTop->fPoint, next->fTop->fPoint) && next->isRightOf(edge->fTop)) ||  in find_enclosing_edges()
682             (c.sweep_gt(next->fTop->fPoint, edge->fTop->fPoint) && edge->isLeftOf(next->fTop)) ||  in find_enclosing_edges()
711         c.sweep_gt(edge->fTop->fPoint, edge->fBottom->fPoint)) {  in insert_edge_above()
729         c.sweep_gt(edge->fTop->fPoint, edge->fBottom->fPoint)) {  in insert_edge_below()
856         if (c.sweep_gt(top->fPoint, leftTop->fPoint) && !edge->fLeft->isLeftOf(top)) {  in cleanup_active_edges()
858         } else if (c.sweep_gt(leftTop->fPoint, top->fPoint) && !edge->isRightOf(leftTop)) {  in cleanup_active_edges()
870         if (c.sweep_gt(top->fPoint, rightTop->fPoint) && !edge->fRight->isRightOf(top)) {  in cleanup_active_edges()
872         } else if (c.sweep_gt(rightTop->fPoint, top->fPoint) && !edge->isLeftOf(rightTop)) {  in cleanup_active_edges()
890     } else if (c.sweep_gt(v->fPoint, edge->fBottom->fPoint)) {  in split_edge()
931         } else if (p == edge->fBottom->fPoint || c.sweep_gt(p, edge->fBottom->fPoint)) {  in check_for_intersection()
937         } else if (p == other->fBottom->fPoint || c.sweep_gt(p, other->fBottom->fPoint)) {  in check_for_intersection()
1296         c.sweep_gt = sweep_gt_horiz;  in contours_to_polys()
1299         c.sweep_gt = sweep_gt_vert;  in contours_to_polys()