Lines Matching defs:index
26 int index, minX, maxX, minY, maxY;
28 for (index = 1; index < 4; ++index) {
29 if (cubic[minX].fX > cubic[index].fX) {
30 minX = index;
32 if (cubic[minY].fY > cubic[index].fY) {
33 minY = index;
35 if (cubic[maxX].fX < cubic[index].fX) {
36 maxX = index;
38 if (cubic[maxY].fY < cubic[index].fY) {
39 maxY = index;
64 size_t index;
109 for (index = firstPointDegeneratesTest; index < pointDegenerates_count; ++index) {
110 const CubicPts& c = pointDegenerates[index];
116 SkDebugf("[%d] pointDegenerates order=%d\n", static_cast<int>(index), order);
120 for (index = firstNotPointDegeneratesTest; index < notPointDegenerates_count; ++index) {
121 const CubicPts& c = notPointDegenerates[index];
127 SkDebugf("[%d] notPointDegenerates order=%d\n", static_cast<int>(index), order);
132 for (index = firstLinesTest; index < lines_count; ++index) {
133 const CubicPts& c = lines[index];
139 SkDebugf("[%d] lines order=%d\n", static_cast<int>(index), order);
143 for (index = firstNotLinesTest; index < notLines_count; ++index) {
144 const CubicPts& c = notLines[index];
150 SkDebugf("[%d] notLines order=%d\n", static_cast<int>(index), order);
154 for (index = firstModEpsilonTest; index < modEpsilonLines_count; ++index) {
155 const CubicPts& c = modEpsilonLines[index];
161 SkDebugf("[%d] line mod by epsilon order=%d\n", static_cast<int>(index), order);
165 for (index = firstLessEpsilonTest; index < lessEpsilonLines_count; ++index) {
166 const CubicPts& c = lessEpsilonLines[index];
172 SkDebugf("[%d] line less by epsilon/2 order=%d\n", static_cast<int>(index), order);
177 for (index = firstNegEpsilonTest; index < negEpsilonLines_count; ++index) {
178 const CubicPts& c = negEpsilonLines[index];
184 SkDebugf("[%d] line neg by epsilon/2 order=%d\n", static_cast<int>(index), order);
188 for (index = firstQuadraticPointTest; index < quadraticPoints_count; ++index) {
189 const QuadPts& q = quadraticPoints[index];
196 SkDebugf("[%d] point quad order=%d\n", static_cast<int>(index), order);
200 for (index = firstQuadraticLineTest; index < quadraticLines_count; ++index) {
201 const QuadPts& q = quadraticLines[index];
208 SkDebugf("[%d] line quad order=%d\n", static_cast<int>(index), order);
212 for (index = firstQuadraticModLineTest; index < quadraticModEpsilonLines_count; ++index) {
213 const QuadPts& q = quadraticModEpsilonLines[index];
220 SkDebugf("[%d] line mod quad order=%d\n", static_cast<int>(index), order);
227 for (index = firstComputedLinesTest; index < lines_count; ++index) {
228 const SkDCubic& cubic = lines[index];
234 SkDebugf("[%d] line computed ends match order=%d\n", static_cast<int>(index), order);
242 SkDebugf("[%d] line computed ends order=%d\n", static_cast<int>(index), order);
258 SkDebugf("[%d] line computed tight bounds order=%d\n", static_cast<int>(index), order);