Lines Matching defs:quad1
129 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2) {
131 setQuadHullSweep(quad1, sweep);
149 double mFactor = fabs(useS ? distEndRatio(sDist, quad1) : distEndRatio(tDist, quad2));
153 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0];
163 static int quadHullsOverlap(skiatest::Reporter* reporter, const SkDQuad& quad1,
166 setQuadHullSweep(quad1, sweep);
197 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0];
207 return checkParallel(reporter, quad1, quad2);
228 static bool orderTRange(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2,
231 orderQuads(reporter, quad1, r, &t1Array);
240 double a1 = quadAngle(reporter,quad1, t1);
285 static bool bruteMinT(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2,
287 double maxRadius = std::min(maxDist(quad1), maxDist(quad2));
288 double maxQuads = std::max(maxQuad(quad1), maxQuad(quad2));
300 bool stepUp = orderTRange(reporter, quad1, quad2, r, &tRange);
302 SkDPoint pt1 = quad1.ptAtT(tRange.t1);
345 bool success = orderTRange(reporter, quad1, quad2, r, &tRange);
358 SkDPoint pt1 = quad1.ptAtT(tRange.t1);
391 static void bruteForce(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2,
397 bool result = bruteMinT(reporter, quad1, quad2, &lowerRange, &upperRange);
403 static bool bruteForceCheck(skiatest::Reporter* reporter, const SkDQuad& quad1,
406 bool result = bruteMinT(reporter, quad1, quad2, &lowerRange, &upperRange);
418 static void testQuadAngles(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2,
425 makeSegment(&contour, quad1, shortQuads[0]);
426 makeSegment(&contour, quad1, shortQuads[1]);
433 const SkDPoint& origin = quad1[0];
435 double a1s = atan2(origin.fY - quad1[1].fY, quad1[1].fX - origin.fX);
436 double a1e = atan2(origin.fY - quad1[2].fY, quad1[2].fX - origin.fX);
442 int overlap = quadHullsOverlap(reporter, quad1, quad2);
448 DumpQ(quad1, quad2, testNo);
452 overlap = quadHullsOverlap(reporter, quad1, quad2); // set a breakpoint and debug if assert fires
455 SkDVector v1s = quad1[1] - quad1[0];
456 SkDVector v1e = quad1[2] - quad1[0];
471 bruteForce(reporter, quad1, quad2, overlap > 0);
474 SkDLine rays[] = {{{origin, quad2[2]}}, {{origin, quad1[2]}}};
475 const SkDQuad* quads[] = {&quad1, &quad2};
546 firstInside = checkParallel(reporter, quad1, quad2);
554 bruteForce(reporter, quad1, quad2, firstInside);
565 SkDQuad quad0, quad1;
567 quad1.debugSet(quads[index + 1].fPts);
568 testQuadAngles(reporter, quad0, quad1, 0, &allocator);
581 QuadPts quad1 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
583 if (quad1.fPts[0] == quad1.fPts[2]) {
593 q1.debugSet(quad1.fPts);
614 QuadPts quad1 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
616 if (quad1.fPts[0] == quad1.fPts[2]) {
625 q1.debugSet(quad1.fPts);
813 SkDQuad quad1, quad2;
814 quad1.debugSet(qu1.fPts);
819 REPORTER_ASSERT(reporter, quad1[0] == quad2[0]);
821 i.intersect(quad1, quad2);
823 REPORTER_ASSERT(reporter, i.pt(0) == quad1[0]);
824 int overlap = quadHullsOverlap(reporter, quad1, quad2);
827 setQuadHullSweep(quad1, sweep);
832 bool agrees = bruteForceCheck(reporter, quad1, quad2, ccw);
833 maxR = std::min(maxR, mDistance(reporter, agrees, quad1, quad2));
837 midPointAgrees(reporter, quad1, quad2, !ccw);
838 SkDQuad q1 = quad1;
844 q1[1].fX = quad1[0].fX * (1 - hiPass) + quad1[1].fX * hiPass;
845 q1[1].fY = quad1[0].fY * (1 - hiPass) + quad1[1].fY * hiPass;
853 midPointAgrees(reporter, quad1, quad2, !ccw);
861 q1[1].fX = quad1[0].fX * (1 - midTest) + quad1[1].fX * midTest;
862 q1[1].fY = quad1[0].fY * (1 - midTest) + quad1[1].fY * midTest;
868 midPointAgrees(reporter, quad1, quad2, !ccw);