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