Lines Matching defs:test
108 const SkTSpan* test = testBounded->fBounded;
109 double startDist = test->pointFirst().distanceSquared(pt);
112 result = test->fStartT;
114 double endDist = test->pointLast().distanceSquared(pt);
117 result = test->fEndT;
156 SkTSpan* test = bounded->fBounded;
157 if (opp == test) {
158 return test;
267 double test = ((*fPart)[outer] - (*fPart)[inner]).lengthSquared();
268 if (dist > test) {
271 dist = test;
288 double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp;
289 if (precisely_zero_when_compared_to(test, maxVal)) {
292 if (approximately_zero_when_compared_to(test, maxVal)) {
296 sign = test;
299 if (test * sign < 0) {
344 SkTSpan* test = bounded->fBounded;
345 if (between(test->fStartT, t, test->fEndT)) {
346 return test;
370 SkTSpan* test = bounded->fBounded;
371 if (opp != test) {
372 foundStart |= between(test->fStartT, fCoinStart.perpT(), test->fEndT);
373 foundEnd |= between(test->fStartT, fCoinEnd.perpT(), test->fEndT);
617 SkTSpan* test = fHead;
621 while ((test = test->fNext)) {
626 bool tCollapsed = test->fCollapsed;
628 largest->fBoundsMax < test->fBoundsMax)) {
629 largest = test;
630 lCollapsed = test->fCollapsed;
708 SkTSpan* test = fCoincident;
709 while (test) {
710 if (between(test->fStartT, t, test->fEndT)) {
713 test = test->fNext;
720 const SkTSpan* test = fHead;
721 while (test) {
722 if (test->fCollapsed) {
725 test = test->next();
793 const SkTSpan* test = fHead;
794 if (!test) {
798 if (test->findOppSpan(span)) {
801 } while ((test = test->next()));
806 SkTSpan* test;
809 while ((test = next)) {
810 next = test->fNext;
811 if (!test->fBounded) {
812 if (!this->removeSpan(test)) {
1260 SkTSpan* test = fCoincident;
1262 if (!test) {
1265 if (test->fStartT < smallLimit) {
1268 if (smaller && smaller->fEndT < test->fStartT) {
1271 smaller = test;
1272 } while ((test = test->fNext));
1281 test = fCoincident;
1283 if (test->fStartT < smaller->fEndT) {
1286 SkOPASSERT(test->fStartT != smaller->fEndT);
1287 if (larger && larger->fStartT < test->fStartT) {
1291 larger = test;
1292 } while ((void) (prior = test), (test = test->fNext));
1317 SkTSpan* test = fHead;
1318 while (span != test) {
1319 result = test;
1320 test = test->fNext;
1321 SkASSERT(test);
1363 SkTSpan* test = fHead;
1366 next = test->fNext;
1367 if (test->fCoinStart.perpT() < 0 || test->fCoinEnd.perpT() < 0) {
1370 SkDVector startV = test->fCoinStart.perpPt() - test->pointFirst();
1371 SkDVector endV = test->fCoinEnd.perpPt() - test->pointLast();
1379 if (!this->removeSpans(test, opp)) {
1382 } while ((test = next));
1460 SkTSpan* test = fHead;
1462 while (test && test->fEndT < t) {
1463 prev = test;
1464 test = test->fNext;
1467 return test && test->fStartT <= t ? test : nullptr;
1493 SkTSpan* test = testBounded->fBounded;
1495 int oppSects, sects = this->intersects(span, opp, test, &oppSects);
1498 test->initBounds(opp->fCurve);
1499 opp->removeAllBut(span, test, this);
1503 this->removeAllBut(test, span, opp);
1507 if (span->removeBounded(test)) {
1510 if (test->removeBounded(span)) {
1511 opp->removeSpan(test);
1543 SkTSpan* test = first;
1547 deleteSpan |= test->removeAllBounded();
1548 } while ((test = test->fNext) != final && test);
1742 SkClosestRecord* test = &fClosest[index];
1743 if (test->matesWith(*record SkDEBUGPARAMS(i))) {
1744 if (test->fClosest > record->fClosest) {
1745 test->merge(*record);
1747 test->update(*record);
1765 const SkClosestRecord* test = closestPtrs[index];
1766 test->addIntersection(intersections);