Lines Matching defs:quad2
129 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2) {
132 setQuadHullSweep(quad2, tweep);
149 double mFactor = fabs(useS ? distEndRatio(sDist, quad1) : distEndRatio(tDist, quad2));
154 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0];
164 const SkDQuad& quad2) {
167 setQuadHullSweep(quad2, tweep);
198 SkDVector m1 = quad2.ptAtT(0.5) - quad2[0];
207 return checkParallel(reporter, quad1, quad2);
228 static bool orderTRange(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2,
232 orderQuads(reporter,quad2, r, &t2Array);
241 double a2 = quadAngle(reporter,quad2, t2);
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);
307 SkDPoint pt2 = quad2.ptAtT(tRange.t2);
345 bool success = orderTRange(reporter, quad1, quad2, r, &tRange);
359 SkDPoint pt2 = quad2.ptAtT(tRange.t2);
391 static void bruteForce(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2,
397 bool result = bruteMinT(reporter, quad1, quad2, &lowerRange, &upperRange);
404 const SkDQuad& quad2, bool ccw) {
406 bool result = bruteMinT(reporter, quad1, quad2, &lowerRange, &upperRange);
418 static void testQuadAngles(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2,
434 REPORTER_ASSERT(reporter, origin == quad2[0]);
437 double a2s = atan2(origin.fY - quad2[1].fY, quad2[1].fX - origin.fX);
438 double a2e = atan2(origin.fY - quad2[2].fY, quad2[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
457 SkDVector v2s = quad2[1] - quad2[0];
458 SkDVector v2e = quad2[2] - quad2[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);
586 QuadPts quad2 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
588 if (quad2.fPts[0] == quad2.fPts[2]) {
594 q2.debugSet(quad2.fPts);
619 QuadPts quad2 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
621 if (quad2.fPts[0] == quad2.fPts[2]) {
626 q2.debugSet(quad2.fPts);
813 SkDQuad quad1, quad2;
815 quad2.debugSet(qu2.fPts);
819 REPORTER_ASSERT(reporter, quad1[0] == quad2[0]);
821 i.intersect(quad1, quad2);
824 int overlap = quadHullsOverlap(reporter, quad1, quad2);
828 setQuadHullSweep(quad2, tweep);
832 bool agrees = bruteForceCheck(reporter, quad1, quad2, ccw);
833 maxR = std::min(maxR, mDistance(reporter, agrees, quad1, quad2));
837 midPointAgrees(reporter, quad1, quad2, !ccw);
839 SkDQuad q2 = quad2;
846 q2[1].fX = quad2[0].fX * (1 - hiPass) + quad2[1].fX * hiPass;
847 q2[1].fY = quad2[0].fY * (1 - hiPass) + quad2[1].fY * hiPass;
853 midPointAgrees(reporter, quad1, quad2, !ccw);
863 q2[1].fX = quad2[0].fX * (1 - midTest) + quad2[1].fX * midTest;
864 q2[1].fY = quad2[0].fY * (1 - midTest) + quad2[1].fY * midTest;
868 midPointAgrees(reporter, quad1, quad2, !ccw);