Lines Matching refs:index
222 for (int index = 1; index <= iMax; ++index) {
223 double xy1 = line.fX * (testCurve[index].fY - origin.fY);
224 double xy2 = line.fY * (testCurve[index].fX - origin.fX);
225 crosses[index - 1] = AlmostBequalUlps(xy1, xy2) ? 0 : xy1 - xy2;
271 for (int index = 0; index < 2; ++index) {
272 SkDVector testLine = testCurve[index] - origin;
275 dots[index] = line.fX * testLine.fX + line.fY * testLine.fY;
276 crosses[index] = AlmostBequalUlps(xy1, xy2) ? 0 : xy1 - xy2;
317 for (int index = 1; index <= iMax; ++index) {
318 const SkDPoint& testPt = fPart.fCurve[index];
515 for (int index = 0; index < 2; ++index) {
516 SkPath::Verb cVerb = index ? rVerb : lVerb;
521 const SkOpSegment& segment = index ? *rh->segment() : *this->segment();
523 (*CurveIntersectRay[cVerb])(segment.pts(), segment.weight(), rays[index], &i);
524 double tStart = index ? rh->fStart->t() : this->fStart->t();
525 double tEnd = index ? rh->fComputedEnd->t() : this->fComputedEnd->t();
526 bool testAscends = tStart < (index ? rh->fComputedEnd->t() : this->fComputedEnd->t());
536 smallTs[index] = t = testAscends ? std::max(t, testT) : std::min(t, testT);
537 limited[index] = approximately_equal_orderable(t, tEnd);
545 for (int index = 0; index < 2; ++index) {
546 if (smallTs[index] < 0) {
549 const SkOpSegment& segment = index ? *rh->segment() : *this->segment();
550 const SkDPoint& dPt = segment.dPtAtT(smallTs[index]);
551 SkDVector cept = dPt - rays[index][0];
555 if ((index ? lPts : rPts) == 1) {
556 SkDVector total = rays[index][1] - rays[index][0];
561 SkDVector end = rays[index][1] - rays[index][0];
572 sCeptT = smallTs[index];
573 sIndex = index;
580 const SkDCurve& curve = index ? rh->fPart.fCurve : this->fPart.fCurve;
581 int ptCount = index ? rPts : lPts;
618 sCeptT = smallTs[index];
619 sIndex = index;
1021 int index;
1022 for (index = 0; index < testCount; ++index) {
1023 if (!::between(startT, testTs[index], limitT)) {
1024 testTs[index] = -1;
1032 index = 0;
1033 while (testTs[index] < 0) {
1034 ++index;
1036 index <<= 1;
1037 for (; index < testCases; ++index) {
1038 int testIndex = index >> 1;
1040 if (index & 1) {