15         bool startMatch = fT[0][0] == 0 || zero_or_one(fT[1][0]);  in cleanUpParallelLines()
16         bool endMatch = fT[0][1] == 1 || zero_or_one(fT[1][1]);  in cleanUpParallelLines()
17         if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) {  in cleanUpParallelLines()
19             if (startMatch && endMatch && (fT[0][0] != 0 || !zero_or_one(fT[1][0]))  in cleanUpParallelLines()
20                     && fT[0][1] == 1 && zero_or_one(fT[1][1])) {  in cleanUpParallelLines()
33     fPt[0] = line.ptAtT(fT[0][0]);  in computePoints()
35         fPt[1] = line.ptAtT(fT[0][1]);  in computePoints()
57         fT[0][0] = numerA;  in intersectRay()
58         fT[1][0] = numerB;  in intersectRay()
71         fT[0][0] = fT[1][0] = 0;  in intersectRay()
72         fT[1][0] = fT[1][1] = 1;  in intersectRay()
120             fT[0][0] = numerA / denom;  in intersect()
121             fT[1][0] = numerB / denom;  in intersect()
222         fT[0][0] = HorizontalIntercept(line, y);  in horizontal()
223         double xIntercept = line[0].fX + fT[0][0] * (line[1].fX - line[0].fX);  in horizontal()
225             fT[1][0] = (xIntercept - left) / (right - left);  in horizontal()
229                     fT[1][index] = 1 - fT[1][index];  in horizontal()
298         fT[0][0] = VerticalIntercept(line, x);  in vertical()
299         double yIntercept = line[0].fY + fT[0][0] * (line[1].fY - line[0].fY);  in vertical()
301             fT[1][0] = (yIntercept - top) / (bottom - top);  in vertical()
305                     fT[1][index] = 1 - fT[1][index];  in vertical()