17         bool startMatch = fT[0][0] == 0 || zero_or_one(fT[1][0]);  in cleanUpParallelLines()
18         bool endMatch = fT[0][1] == 1 || zero_or_one(fT[1][1]);  in cleanUpParallelLines()
19         if ((!startMatch && !endMatch) || approximately_equal(fT[0][0], fT[0][1])) {  in cleanUpParallelLines()
21             if (startMatch && endMatch && (fT[0][0] != 0 || !zero_or_one(fT[1][0]))  in cleanUpParallelLines()
22                     && fT[0][1] == 1 && zero_or_one(fT[1][1])) {  in cleanUpParallelLines()
35     fPt[0] = line.ptAtT(fT[0][0]);  in computePoints()
37         fPt[1] = line.ptAtT(fT[0][1]);  in computePoints()
59         fT[0][0] = numerA;  in intersectRay()
60         fT[1][0] = numerB;  in intersectRay()
73         fT[0][0] = fT[1][0] = 0;  in intersectRay()
74         fT[1][0] = fT[1][1] = 1;  in intersectRay()
122             fT[0][0] = numerA / denom;  in intersect()
123             fT[1][0] = numerB / denom;  in intersect()
226         fT[0][0] = HorizontalIntercept(line, y);  in horizontal()
227         double xIntercept = line[0].fX + fT[0][0] * (line[1].fX - line[0].fX);  in horizontal()
229             fT[1][0] = (xIntercept - left) / (right - left);  in horizontal()
233                     fT[1][index] = 1 - fT[1][index];  in horizontal()
304         fT[0][0] = VerticalIntercept(line, x);  in vertical()
305         double yIntercept = line[0].fY + fT[0][0] * (line[1].fY - line[0].fY);  in vertical()
307             fT[1][0] = (yIntercept - top) / (bottom - top);  in vertical()
311                     fT[1][index] = 1 - fT[1][index];  in vertical()