Lines Matching refs:quad1
129 static bool checkParallel(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2)… in checkParallel() argument
131 setQuadHullSweep(quad1, sweep); in checkParallel()
149 double mFactor = fabs(useS ? distEndRatio(sDist, quad1) : distEndRatio(tDist, quad2)); in checkParallel()
153 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in checkParallel()
163 static int quadHullsOverlap(skiatest::Reporter* reporter, const SkDQuad& quad1, in quadHullsOverlap() argument
166 setQuadHullSweep(quad1, sweep); in quadHullsOverlap()
197 SkDVector m0 = quad1.ptAtT(0.5) - quad1[0]; in quadHullsOverlap()
207 return checkParallel(reporter, quad1, quad2); in quadHullsOverlap()
228 static bool orderTRange(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, in orderTRange() argument
231 orderQuads(reporter, quad1, r, &t1Array); in orderTRange()
240 double a1 = quadAngle(reporter,quad1, t1); in orderTRange()
285 static bool bruteMinT(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, in bruteMinT() argument
287 double maxRadius = std::min(maxDist(quad1), maxDist(quad2)); in bruteMinT()
288 double maxQuads = std::max(maxQuad(quad1), maxQuad(quad2)); in bruteMinT()
300 bool stepUp = orderTRange(reporter, quad1, quad2, r, &tRange); in bruteMinT()
302 SkDPoint pt1 = quad1.ptAtT(tRange.t1); in bruteMinT()
348 bool success = orderTRange(reporter, quad1, quad2, r, &tRange); in bruteMinT()
361 SkDPoint pt1 = quad1.ptAtT(tRange.t1); in bruteMinT()
394 static void bruteForce(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, in bruteForce() argument
400 bool result = bruteMinT(reporter, quad1, quad2, &lowerRange, &upperRange); in bruteForce()
406 static bool bruteForceCheck(skiatest::Reporter* reporter, const SkDQuad& quad1, in bruteForceCheck() argument
409 bool result = bruteMinT(reporter, quad1, quad2, &lowerRange, &upperRange); in bruteForceCheck()
421 static void testQuadAngles(skiatest::Reporter* reporter, const SkDQuad& quad1, const SkDQuad& quad2, in testQuadAngles() argument
428 makeSegment(&contour, quad1, shortQuads[0]); in testQuadAngles()
429 makeSegment(&contour, quad1, shortQuads[1]); in testQuadAngles()
436 const SkDPoint& origin = quad1[0]; in testQuadAngles()
438 double a1s = atan2(origin.fY - quad1[1].fY, quad1[1].fX - origin.fX); in testQuadAngles()
439 double a1e = atan2(origin.fY - quad1[2].fY, quad1[2].fX - origin.fX); in testQuadAngles()
445 int overlap = quadHullsOverlap(reporter, quad1, quad2); in testQuadAngles()
451 DumpQ(quad1, quad2, testNo); in testQuadAngles()
455 … overlap = quadHullsOverlap(reporter, quad1, quad2); // set a breakpoint and debug if assert fires in testQuadAngles()
458 SkDVector v1s = quad1[1] - quad1[0]; in testQuadAngles()
459 SkDVector v1e = quad1[2] - quad1[0]; in testQuadAngles()
474 bruteForce(reporter, quad1, quad2, overlap > 0); in testQuadAngles()
477 SkDLine rays[] = {{{origin, quad2[2]}}, {{origin, quad1[2]}}}; in testQuadAngles()
478 const SkDQuad* quads[] = {&quad1, &quad2}; in testQuadAngles()
549 firstInside = checkParallel(reporter, quad1, quad2); in testQuadAngles()
557 bruteForce(reporter, quad1, quad2, firstInside); in testQuadAngles()
568 SkDQuad quad0, quad1; in DEF_TEST() local
570 quad1.debugSet(quads[index + 1].fPts); in DEF_TEST()
571 testQuadAngles(reporter, quad0, quad1, 0, &allocator); in DEF_TEST()
584 QuadPts quad1 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}, in DEF_TEST() local
586 if (quad1.fPts[0] == quad1.fPts[2]) { in DEF_TEST()
596 q1.debugSet(quad1.fPts); in DEF_TEST()
617 QuadPts quad1 = {{origin, {ran.nextRangeF(-1000, 1000), ran.nextRangeF(-1000, 1000)}, in DEF_TEST() local
619 if (quad1.fPts[0] == quad1.fPts[2]) { in DEF_TEST()
628 q1.debugSet(quad1.fPts); in DEF_TEST()
816 SkDQuad quad1, quad2; in DEF_TEST() local
817 quad1.debugSet(qu1.fPts); in DEF_TEST()
822 REPORTER_ASSERT(reporter, quad1[0] == quad2[0]); in DEF_TEST()
824 i.intersect(quad1, quad2); in DEF_TEST()
826 REPORTER_ASSERT(reporter, i.pt(0) == quad1[0]); in DEF_TEST()
827 int overlap = quadHullsOverlap(reporter, quad1, quad2); in DEF_TEST()
830 setQuadHullSweep(quad1, sweep); in DEF_TEST()
835 bool agrees = bruteForceCheck(reporter, quad1, quad2, ccw); in DEF_TEST()
836 maxR = std::min(maxR, mDistance(reporter, agrees, quad1, quad2)); in DEF_TEST()
840 midPointAgrees(reporter, quad1, quad2, !ccw); in DEF_TEST()
841 SkDQuad q1 = quad1; in DEF_TEST()
847 q1[1].fX = quad1[0].fX * (1 - hiPass) + quad1[1].fX * hiPass; in DEF_TEST()
848 q1[1].fY = quad1[0].fY * (1 - hiPass) + quad1[1].fY * hiPass; in DEF_TEST()
856 midPointAgrees(reporter, quad1, quad2, !ccw); in DEF_TEST()
864 q1[1].fX = quad1[0].fX * (1 - midTest) + quad1[1].fX * midTest; in DEF_TEST()
865 q1[1].fY = quad1[0].fY * (1 - midTest) + quad1[1].fY * midTest; in DEF_TEST()
871 midPointAgrees(reporter, quad1, quad2, !ccw); in DEF_TEST()