14     for (int index = 0; index < fUsed; ++index) {  in closestTo()  local
15         if (!between(rangeStart, fT[0][index], rangeEnd)) {  in closestTo()
18         const SkDPoint& iPt = fPt[index];  in closestTo()
22             closest = index;  in closestTo()
29     for (int index = 0; index < fUsed; ++index) {  in flip()  local
30         fT[1][index] = 1 - fT[1][index];  in flip()
40     int index;  in insert()  local
41     for (index = 0; index < fUsed; ++index) {  in insert()
42         double oldOne = fT[0][index];  in insert()
43         double oldTwo = fT[1][index];  in insert()
57             int remaining = fUsed - index - 1;  in insert()
58             memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining);  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()
61             int clearMask = ~((1 << index) - 1);  in insert()
68         if (pt.roughlyEqual(fPt[index])) {  in insert()
73     for (index = 0; index < fUsed; ++index) {  in insert()
74         if (fT[0][index] > one) {  in insert()
84     int remaining = fUsed - index;  in insert()
86         memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining);  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()
89         int clearMask = ~((1 << index) - 1);  in insert()
93     fPt[index] = pt;  in insert()
100     fT[0][index] = one;  in insert()
101     fT[1][index] = two;  in insert()
104     return index;  in insert()
117     int index = insertSwap(one, two, pt);  in insertCoincident()  local
118     if (index >= 0) {  in insertCoincident()
119         setCoincident(index);  in insertCoincident()
121     return index;  in insertCoincident()
124 void SkIntersections::setCoincident(int index) {  in setCoincident()  argument
125     SkASSERT(index >= 0);  in setCoincident()
126     int bit = 1 << index;  in setCoincident()
143     for (int index = 0; index < fUsed; ++index) {  in mostOutside()  local
144         if (!between(rangeStart, fT[0][index], rangeEnd)) {  in mostOutside()
148             result = index;  in mostOutside()
152         SkDVector test = fPt[index] - origin;  in mostOutside()
154             result = index;  in mostOutside()
160 void SkIntersections::removeOne(int index) {  in removeOne()  argument
161     int remaining = --fUsed - index;  in removeOne()
165     memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining);  in removeOne()
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()
169     int coBit = fIsCoincident[0] & (1 << index);  in removeOne()
170     fIsCoincident[0] -= ((fIsCoincident[0] >> 1) & ~((1 << index) - 1)) + coBit;  in removeOne()
171     SkASSERT(!(coBit ^ (fIsCoincident[1] & (1 << index))));  in removeOne()
172     fIsCoincident[1] -= ((fIsCoincident[1] >> 1) & ~((1 << index) - 1)) + coBit;  in removeOne()