23 {{{{945.08099365234375, 747.1619873046875}, {982.5679931640625, 747.1619873046875}, {1013.6290283203125, 719.656005859375}, {1019.1910400390625, 683.72601318359375}}},
24 {{{945, 747}, {976.0660400390625, 747}, {998.03302001953125, 725.03302001953125}}}},
26 {{{{778, 14089}, {778, 14091.208984375}, {776.20916748046875, 14093}, {774, 14093}}},
27 {{{778, 14089}, {777.99957275390625, 14090.65625}, {776.82843017578125, 14091.828125}}}},
29 {{{{1020.08099,672.161987}, {1020.08002,630.73999}, {986.502014,597.161987}, {945.080994,597.161987}}},
30 {{{1020,672}, {1020,640.93396}, {998.03302,618.96698}}}},
32 {{{{778, 14089}, {778, 14091.208984375}, {776.20916748046875, 14093}, {774, 14093}}},
33 {{{778, 14089}, {777.99957275390625, 14090.65625}, {776.82843017578125, 14091.828125}}}},
35 {{{{1110, 817}, {1110.55225f, 817}, {1111, 817.447693f}, {1111, 818}}},
36 {{{1110.70715f, 817.292908f}, {1110.41406f, 817.000122f}, {1110, 817}}}},
38 {{{{1110, 817}, {1110.55225f, 817}, {1111, 817.447693f}, {1111, 818}}},
39 {{{1111, 818}, {1110.99988f, 817.585876f}, {1110.70715f, 817.292908f}}}},
41 {{{{55, 207}, {52.238574981689453, 207}, {50, 204.76142883300781}, {50, 202}}},
42 {{{55, 207}, {52.929431915283203, 206.99949645996094},
43 {51.464466094970703, 205.53553771972656}}}},
45 {{{{49, 47}, {49, 74.614250183105469}, {26.614250183105469, 97}, {-1, 97}}},
46 {{{-8.659739592076221e-015, 96.991401672363281}, {20.065492630004883, 96.645187377929688},
47 {34.355339050292969, 82.355339050292969}}}},
49 {{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}},
50 {{{18,226}, {14.686291694641113,226}, {12.342399597167969,228.3424072265625}}}},
52 {{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}},
53 {{{12.342399597167969,228.3424072265625}, {10,230.68629455566406}, {10,234}}}},
59 int iIndex =
static_cast<int>(index);
62 cubic.debugSet(c.
fPts);
71 int order2 = reduce2.
reduce(quad);
73 SkDebugf(
"[%d] cubic order=%d\n", iIndex, order1);
77 SkDebugf(
"[%d] quad order=%d\n", iIndex, order2);
82 for (
int pt = 0; pt < roots; ++pt) {
83 double tt1 = i[0][pt];
85 double tt2 = i[1][pt];
88 SkDebugf(
"%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
89 __FUNCTION__, iIndex, pt, tt1, xy1.
fX, xy1.
fY, tt2, xy2.
fX, xy2.
fY);
static struct quadCubic quadCubicTests[]
static const int quadCubicTests_count
static void cubicQuadIntersection(skiatest::Reporter *reporter, int index)
bool ValidCubic(const SkDCubic &cubic)
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]
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)