53 {
55 pathStr.
appendf(
" path.moveTo(%1.9g, %1.9g);\n", quad[0].fX, quad[0].fY);
56 pathStr.
appendf(
" path.quadTo(%1.9g, %1.9g, %1.9g, %1.9g);\n", quad[1].fX,
57 quad[1].fY, quad[2].fX, quad[2].fY);
58 pathStr.
appendf(
" path.moveTo(%1.9g, %1.9g);\n", line[0].fX, line[0].fY);
59 pathStr.
appendf(
" path.lineTo(%1.9g, %1.9g);\n", line[1].fX, line[1].fY);
60
62 bool flipped = false;
64 bool found = false;
65 for (
int index = 0; index <
result; ++index) {
66 double quadT = intersections[0][index];
68 double lineT = intersections[1][index];
71 found = true;
72 }
73 }
75}
static int doIntersect(SkIntersections &intersections, const SkDQuad &quad, const SkDLine &line, bool &flipped)
#define REPORTER_ASSERT(r, cond,...)
void void void appendf(const char format[],...) SK_PRINTF_LIKE(2
bool approximatelyEqual(const SkDPoint &a) const
SkDPoint ptAtT(double t) const