14     for (int index = 0; index < fUsed; ++index) {  in closestTo()
29     for (int index = 0; index < fUsed; ++index) {  in flip()
39     SkASSERT(fUsed <= 1 || fT[0][0] <= fT[0][1]);  in insert()
41     for (index = 0; index < fUsed; ++index) {  in insert()
57             int remaining = fUsed - index - 1;  in insert()
64             --fUsed;  in insert()
73     for (index = 0; index < fUsed; ++index) {  in insert()
78     if (fUsed >= fMax) {  in insert()
81         fUsed = 0;  in insert()
84     int remaining = fUsed - index;  in insert()
102     ++fUsed;  in insert()
103     SkASSERT(fUsed <= SK_ARRAY_COUNT(fPt));  in insert()
138     fUsed = 1;  in merge()
143     for (int index = 0; index < fUsed; ++index) {  in mostOutside()
161     int remaining = --fUsed - index;  in removeOne()