Lines Matching defs:to
13 After computing raw intersections, post process all segments to:
14 - find small collections of points that can be collapsed to a single point
15 - find missing intersections to resolve differences caused by different algorithms
27 // to=0,1 to=0,1
157 bool to = *sumWinding != 0;
158 bool result = gUnaryActiveEdge[from][to];
514 // there's nothing to do
515 // if two orderable angles are adjacent, and both are next to orderable angles,
516 // and one has winding computed, transfer to the other
607 // move start and end to the same point
615 Mi stands for Minuend (see wiki subtraction, analogous to difference)
646 // more than one viable candidate -- measure angles to find best
719 SkDebugf("%s from:[%d] to:[%d] start=%d end=%d\n",
751 // more than one viable candidate -- measure angles to find best
815 SkDebugf("%s from:[%d] to:[%d] start=%d end=%d\n",
883 SkDebugf("%s from:[%d] to:[%d] start=%d end=%d\n",
1177 // reset visited flag back to false
1224 // coincidence needs to be detected. This may not be true.
1325 // find range of spans to consider merging
1362 // check to see if the candidate meets specific criteria:
1465 // quads (and cubics) can loop back to nearly a line so that an opposite curve
1469 // 'ends are extremes in x or y' is cheaper to compute and real-world common
1692 // measure distance and see if it's small enough to denote coincidence
