Lines Matching refs:coincident
899 // reduce coincident runs to single entries
947 // find the first fully coincident span
1083 // if the ends of each line intersect the opposite curve, the lines are coincident
1156 // convergence may fail if the curves are nearly coincident
1296 // check middle t value to see if it is coincident as well
1582 const SkTSpan* coincident = fCoincident;
1583 while (coincident) {
1585 coincident = coincident->fNext;
1881 gets stuck in a loop. It adds an extension to allow a coincident end
1919 SkTSpan* coincident = sect1->fCoincident;
1920 if (coincident) {
1921 // if there is more than one coincident span, check loosely to see if they should be joined
1922 if (coincident->fNext) {
1924 coincident = sect1->fCoincident;
1928 if (!coincident) {
1931 if (!coincident->fCoinStart.isMatch()) {
1934 if (!coincident->fCoinEnd.isMatch()) {
1937 double perpT = coincident->fCoinStart.perpT();
1941 int index = intersections->insertCoincident(coincident->fStartT,
1942 perpT, coincident->pointFirst());
1943 if ((intersections->insertCoincident(coincident->fEndT,
1944 coincident->fCoinEnd.perpT(),
1945 coincident->pointLast()) < 0) && index >= 0) {
1948 } while ((coincident = coincident->fNext));
2054 // if there is more than one intersection and it isn't already coincident, check