cubic_to_quadratics(cubic, calcPrecision(cubic), quads1);
for (idx2 = 0; idx2 < quads1.count(); ++idx2) {
const Quadratic& q = quads1[idx2];
- SkDebugf(" {{%1.9g,%1.9g}, {%1.9g,%1.9g}, {%1.9g,%1.9g}},\n",
+ SkDebugf(" {{%1.9g,%1.9g}, {%1.9g,%1.9g}, {%1.9g,%1.9g}},\n",
q[0].x, q[0].y, q[1].x, q[1].y, q[2].x, q[2].y);
}
SkDebugf("\n");
dst[1] = src[1];
dst[2] = src[2];
dst[3] = src[3];
- return;
+ return;
}
double ax = dst[0].x = interp_cubic_coords(&src[0].x, t1);
double ay = dst[0].y = interp_cubic_coords(&src[0].y, t1);
for (int d = c + 1 ; d < 7; ++d) {
for (int e = SkPath::kWinding_FillType ; e <= SkPath::kEvenOdd_FillType; ++e) {
for (int f = SkPath::kWinding_FillType ; f <= SkPath::kEvenOdd_FillType; ++f) {
-
+
#if 0
if (state.a == fail[0] && state.b == fail[1] && state.c == fail[2] && state.d == fail[3]
&& a == fail[4] && b == fail[5] && c == fail[6] && d == fail[7]) {
|| sk_double_isnan(fLeft) || sk_double_isnan(fRight)
|| sk_double_isnan(fTop) || sk_double_isnan(fBottom);
}
-
+
void setCubicBounds(const SkPoint a[4]) {
_Rect dRect;
MAKE_CONST_CUBIC(cubic, a);
}
return sum <= 0;
}
-
+
bool monotonic_in_y(int tStart, int tEnd) const {
if (fVerb != SkPath::kCubic_Verb) {
return false;
}
}
}
-
+
void subDivideBounds(int start, int end, Bounds& bounds) const {
SkPoint edge[4];
subDivide(start, end, edge);
SkBitmap* referenceBitmap = NULL;
sk_tools::PictureRenderer* referenceRenderer;
// If the renderer uses a BBoxHierarchy, then the reference renderer
- // will be the same renderer, without the bbh.
+ // will be the same renderer, without the bbh.
AutoRestoreBbhType arbbh;
if (sk_tools::PictureRenderer::kNone_BBoxHierarchyType !=
renderer.getBBoxHierarchyType()) {