Lines Matching defs:winding
59 int winding = 0;
86 // use first derivative to determine if intersection is contributing +1 or -1 to winding
95 winding += (int) directions[index];
97 return winding; // note winding indicates containership, not contour direction
209 int winding = 0;
232 winding += contains_edge(pts, verb, conic_weight(iter, verb), contour.fMinXY);
257 return winding;
270 int winding = this->nextEdge(contour, Edge::kCompare);
273 test.fContained = winding != 0;
274 return -1 <= winding && winding <= 1;
401 // if sorted has no grandchildren, no child has to fix its children's winding