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