Cross Reference: /external/skqp/tests/PathOpsAngleIdeas.cpp

Lines Matching refs: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 = SkTMin(maxDist(quad1), maxDist(quad2));
288     double maxQuads = SkTMax(maxQuad(quad1), maxQuad(quad2));
300             bool stepUp = orderTRange(reporter, quad1, quad2, r, &tRange);
307                 SkDPoint pt2 = quad2.ptAtT(tRange.t2);
348             bool success = orderTRange(reporter, quad1, quad2, r, &tRange);
362                 SkDPoint pt2 = quad2.ptAtT(tRange.t2);
394 static void bruteForce(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2,
400     bool result = bruteMinT(reporter, quad1, quad2, &lowerRange, &upperRange);
407         const SkDQuad& quad2, bool ccw) {
409     bool result = bruteMinT(reporter, quad1, quad2, &lowerRange, &upperRange);
421 static void testQuadAngles(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2,
437     REPORTER_ASSERT(reporter, origin == quad2[0]);
440     double a2s = atan2(origin.fY - quad2[1].fY, quad2[1].fX - origin.fX);
441     double a2e = atan2(origin.fY - quad2[2].fY, quad2[2].fX - origin.fX);
445     int overlap = quadHullsOverlap(reporter, quad1, quad2);
451         DumpQ(quad1, quad2, testNo);
455         overlap = quadHullsOverlap(reporter, quad1, quad2);  // set a breakpoint and debug if assert fires
460     SkDVector v2s = quad2[1] - quad2[0];
461     SkDVector v2e = quad2[2] - quad2[0];
474         bruteForce(reporter, quad1, quad2, overlap > 0);
477     SkDLine rays[] = {{{origin, quad2[2]}}, {{origin, quad1[2]}}};
478     const SkDQuad* quads[] = {&quad1, &quad2};
549         firstInside = checkParallel(reporter, quad1, quad2);
557     bruteForce(reporter, quad1, quad2, firstInside);
589         QuadPts quad2 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
591         if (quad2.fPts[0] == quad2.fPts[2]) {
597         q2.debugSet(quad2.fPts);
622         QuadPts quad2 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)},
624         if (quad2.fPts[0] == quad2.fPts[2]) {
629         q2.debugSet(quad2.fPts);
816         SkDQuad quad1, quad2;
818         quad2.debugSet(qu2.fPts);
822         REPORTER_ASSERT(reporter, quad1[0] == quad2[0]);
824         i.intersect(quad1, quad2);
827         int overlap = quadHullsOverlap(reporter, quad1, quad2);
831         setQuadHullSweep(quad2, tweep);
835         bool agrees = bruteForceCheck(reporter, quad1, quad2, ccw);
836         maxR = SkTMin(maxR, mDistance(reporter, agrees, quad1, quad2));
840         midPointAgrees(reporter, quad1, quad2, !ccw);
842         SkDQuad q2 = quad2;
849             q2[1].fX = quad2[0].fX * (1 - hiPass) + quad2[1].fX * hiPass;
850             q2[1].fY = quad2[0].fY * (1 - hiPass) + quad2[1].fY * hiPass;
856             midPointAgrees(reporter, quad1, quad2, !ccw);
866             q2[1].fX = quad2[0].fX * (1 - midTest) + quad2[1].fX * midTest;
867             q2[1].fY = quad2[0].fY * (1 - midTest) + quad2[1].fY * midTest;
871                 midPointAgrees(reporter, quad1, quad2, !ccw);