15         if (!between(rangeStart, fT[0][index], rangeEnd)) {  in closestTo()
30         fT[1][index] = 1 - fT[1][index];  in flip()
35     if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) {  in insert()
39     SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);  in insert()
42         double oldOne = fT[0][index];  in insert()
43         double oldTwo = fT[1][index];  in insert()
59             memmove(&fT[0][index], &fT[0][index + 1], sizeof(fT[0][0]) * remaining);  in insert()
60             memmove(&fT[1][index], &fT[1][index + 1], sizeof(fT[1][0]) * remaining);  in insert()
74         if (fT[0][index] > one) {  in insert()
87         memmove(&fT[0][index + 1], &fT[0][index], sizeof(fT[0][0]) * remaining);  in insert()
88         memmove(&fT[1][index + 1], &fT[1][index], sizeof(fT[1][0]) * remaining);  in insert()
100     fT[0][index] = one;  in insert()
101     fT[1][index] = two;  in insert()
134     fT[0][0] = a.fT[0][aIndex];  in merge()
135     fT[1][0] = b.fT[0][bIndex];  in merge()
144         if (!between(rangeStart, fT[0][index], rangeEnd)) {  in mostOutside()
166     memmove(&fT[0][index], &fT[0][index + 1], sizeof(fT[0][0]) * remaining);  in removeOne()
167     memmove(&fT[1][index], &fT[1][index + 1], sizeof(fT[1][0]) * remaining);  in removeOne()