11     for (int index = 0; index < i.fUsed; ++index) {  in append()  local
12         insert(i[0][index], i[1][index], i.pt(index));  in append()
37     for (int index = 0; index < fUsed; ++index) {  in coincidentUsed()  local
38         if (fIsCoincident[0] & (1 << index)) {  in coincidentUsed()
42         if (fIsCoincident[1] & (1 << index)) {  in coincidentUsed()
59     for (int index = 0; index < fUsed; ++index) {  in flip()  local
60         fT[1][index] = 1 - fT[1][index];  in flip()
70     int index;  in insert()  local
71     for (index = 0; index < fUsed; ++index) {  in insert()
72         double oldOne = fT[0][index];  in insert()
73         double oldTwo = fT[1][index];  in insert()
82                 fT[0][index] = one;  in insert()
83                 fT[1][index] = two;  in insert()
84                 fPt[index] = pt;  in insert()
89         if (pt.roughlyEqual(fPt[index])) {  in insert()
93         if (fT[0][index] > one) {  in insert()
103     int remaining = fUsed - index;  in insert()
105         memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining);  in insert()
106         memmove(&fPt2[index + 1], &fPt2[index], sizeof(fPt2[0]) * remaining);  in insert()
107         memmove(&fT[0][index + 1], &fT[0][index], sizeof(fT[0][0]) * remaining);  in insert()
108         memmove(&fT[1][index + 1], &fT[1][index], sizeof(fT[1][0]) * remaining);  in insert()
109         int clearMask = ~((1 << index) - 1);  in insert()
113     fPt[index] = pt;  in insert()
114     fT[0][index] = one;  in insert()
115     fT[1][index] = two;  in insert()
117     return index;  in insert()
130     int index = insertSwap(one, two, pt);  in insertCoincident()  local
131     int bit = 1 << index;  in insertCoincident()
144     for (int index = base; index < fUsed; ++index) {  in offset()  local
145         double val = fT[fSwap][index];  in offset()
148         fT[fSwap][index] = val;  in offset()
159 void SkIntersections::quickRemoveOne(int index, int replace) {  in quickRemoveOne()  argument
160     if (index < replace) {  in quickRemoveOne()
161         fT[0][index] = fT[0][replace];  in quickRemoveOne()
165 void SkIntersections::removeOne(int index) {  in removeOne()  argument
166     int remaining = --fUsed - index;  in removeOne()
170     memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining);  in removeOne()
171     memmove(&fPt2[index], &fPt2[index + 1], sizeof(fPt2[0]) * remaining);  in removeOne()
172     memmove(&fT[0][index], &fT[0][index + 1], sizeof(fT[0][0]) * remaining);  in removeOne()
173     memmove(&fT[1][index], &fT[1][index + 1], sizeof(fT[1][0]) * remaining);  in removeOne()
175     int coBit = fIsCoincident[0] & (1 << index);  in removeOne()
176     fIsCoincident[0] -= ((fIsCoincident[0] >> 1) & ~((1 << index) - 1)) + coBit;  in removeOne()
177     SkASSERT(!(coBit ^ (fIsCoincident[1] & (1 << index))));  in removeOne()
178     fIsCoincident[1] -= ((fIsCoincident[1] >> 1) & ~((1 << index) - 1)) + coBit;  in removeOne()
182     int index;  in swapPts()  local
183     for (index = 0; index < fUsed; ++index) {  in swapPts()
184         SkTSwap(fT[0][index], fT[1][index]);  in swapPts()