23 {{{{{0.00000000000000000, -1.8135968446731567 },
24 {0.00000000000000000, -1.0033817291259766 },
25 {-0.0073835160583257675, 0.00000000000000000 }}}, 2.26585215e+11f},
26 {{{0.00000000000000000, -1.0000113248825073 },
27 {-2.4824290449032560e-05, -1.0000115633010864 },
28 {-0.0073835160583257675, 0.00000000000000000 }}}},
30 {{{{{494.348663,224.583771}, {494.365143,224.633194}, {494.376404,224.684067}}}, 0.998645842f},
31 {{{494.30481,224.474213}, {494.334961,224.538284}, {494.355774,224.605927}}}},
33 {{{{{494.348663,224.583771}, {494.365143,224.633194}, {494.376404,224.684067}}}, 0.998645842f},
34 {{{494.355774f, 224.605927f}, {494.363708f, 224.631714f}, {494.370148f, 224.657471f}}}},
50 int order1 = reduce2.
reduce(conic.fPts);
51 int order2 = reduce1.
reduce(quad);
53 SkDebugf(
"[%d] conic order=%d\n", index, order1);
57 SkDebugf(
"[%d] quad order=%d\n", index, order2);
62 for (
int pt = 0; pt < roots; ++pt) {
63 double tt1 = i[0][pt];
65 double tt2 = i[1][pt];
68 SkDebugf(
"%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
69 __FUNCTION__, index, pt, tt1, xy1.
fX, xy1.
fY, tt2, xy2.
fX, xy2.
fY);
static const int conicQuadTests_count
static void conicQuadIntersection(skiatest::Reporter *reporter, int index)
static struct conicQuad conicQuadTests[]
bool ValidConic(const SkDConic &conic)
bool ValidQuad(const SkDQuad &quad)
void SK_SPI SkDebugf(const char format[],...) SK_PRINTF_LIKE(1
#define DEF_TEST(name, reporter)
#define REPORTER_ASSERT(r, cond,...)
Type::kYUV Type::kRGBA() int(0.7 *637)
int intersect(const SkDLine &, const SkDLine &)
SkDPoint fPts[kPointCount]
bool approximatelyEqual(const SkDPoint &a) const
void debugSet(const SkDPoint *pts)
SkDPoint ptAtT(double t) const
int reduce(const SkDCubic &cubic, Quadratics)