Lines Matching defs:edge
47 static int contains_edge(SkPoint pts[4], SkPath::Verb verb, SkScalar weight, const SkPoint& edge) {
50 if (bounds.fTop > edge.fY) {
53 if (bounds.fBottom <= edge.fY) { // check to see if y is at line end to avoid double counting
56 if (bounds.fLeft >= edge.fX) {
63 int count = (*CurveIntercept[verb * 2])(pts, weight, edge.fY, tVals);
65 // remove results to the right of edge
68 if (intersectX < edge.fX) {
72 if (intersectX > edge.fX) {
76 // if intersect x equals edge x, we need to determine if pts is to the left or right of edge
77 if (pts[0].fX < edge.fX && pts[kPtCount[verb]].fX < edge.fX) {
82 // example: edge ends 45 degree diagonal going up. If pts is to the left of edge, keep.
83 // if pts is to the right of edge, discard. With code as is, can't distiguish the two cases.
91 // skip intersections that end at edge and go up
204 int nextEdge(Contour& contour, Edge edge) {
231 if (edge == Edge::kCompare) {
235 SkASSERT(edge == Edge::kInitial);
262 // arbitrarily, choose non-horizontal edge where point <= bounds left
264 // to find edge with minimum-x
271 // if edge is up, mark contour cw, otherwise, ccw