Lines Matching defs:index
56 int index, minX, maxX, minY, maxY;
60 for (index = 1; index < 3; ++index) {
61 if (quad[minX].fX > quad[index].fX) {
62 minX = index;
64 if (quad[minY].fY > quad[index].fY) {
65 minY = index;
67 if (quad[maxX].fX < quad[index].fX) {
68 maxX = index;
70 if (quad[maxY].fY < quad[index].fY) {
71 maxY = index;
74 for (index = 0; index < 3; ++index) {
75 if (AlmostEqualUlps(quad[index].fX, quad[minX].fX)) {
76 minXSet |= 1 << index;
78 if (AlmostEqualUlps(quad[index].fY, quad[minY].fY)) {
79 minYSet |= 1 << index;
189 int index, minX, maxX, minY, maxY;
193 for (index = 1; index < 4; ++index) {
194 if (cubic[minX].fX > cubic[index].fX) {
195 minX = index;
197 if (cubic[minY].fY > cubic[index].fY) {
198 minY = index;
200 if (cubic[maxX].fX < cubic[index].fX) {
201 maxX = index;
203 if (cubic[maxY].fY < cubic[index].fY) {
204 maxY = index;
207 for (index = 0; index < 4; ++index) {
208 double cx = cubic[index].fX;
209 double cy = cubic[index].fY;
213 minXSet |= 1 << index;
214 minYSet |= 1 << index;
219 minXSet |= 1 << index;
222 minYSet |= 1 << index;
252 for (int index = 0; index < order; ++index) {
253 *reducePts++ = reducer.fLine[index].asSkPoint();
278 for (int index = 0; index < order; ++index) {
279 *reducePts++ = reducer.fQuad[index].asSkPoint();