/external/chromium_org/third_party/skia/tests/ |
PathOpsDCubicTest.cpp | 21 const SkDCubic& cubic = tests[index]; local 22 SkASSERT(ValidCubic(cubic)); 23 bool result = cubic.clockwise();
|
GeometryTest.cpp | 50 const SkPoint cubic[] = { local 57 REPORTER_ASSERT(reporter, nearly_equal(cubic[i], dst[i]));
|
PathOpsDRectTest.cpp | 82 const SkDCubic& cubic = cubicTests[index]; local 83 SkASSERT(ValidCubic(cubic)); 84 rect.setRawBounds(cubic); 85 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(cubic[0].fX, 86 SkTMin(cubic[1].fX, SkTMin(cubic[2].fX, cubic[3].fX)))); 87 REPORTER_ASSERT(reporter, rect.fTop == SkTMin(cubic[0].fY, 88 SkTMin(cubic[1].fY, SkTMin(cubic[2].fY, cubic[3].fY)))) [all...] |
PathOpsLineParametetersTest.cpp | 43 const SkDCubic& cubic = tests[index]; local 44 SkASSERT(ValidCubic(cubic)); 45 lineParameters.cubicEndPoints(cubic, 0, 3); 47 denormalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); 48 denormalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2); 67 normalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); 68 normalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2);
|
PathOpsTestCommon.cpp | 14 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads) { 16 cubic.toQuadraticTs(precision, &ts); 18 SkDQuad quad = cubic.toQuad(); 25 SkDCubic part = cubic.subDivide(tStart, tEnd); 34 SkDCubic cubic; local 52 cubic.set(pts); 53 CubicToQuads(cubic, cubic.calcPrecision(), quads); 74 SkDCubic cubic; local 90 cubic.set(pts) [all...] |
PathOpsCubicLineIntersectionTest.cpp | 15 SkDCubic cubic; member in struct:lineCubic 28 const SkDCubic& cubic = failLineCubicTests[iIndex].cubic; local 29 SkASSERT(ValidCubic(cubic)); 34 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); 37 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 46 int roots = i.intersect(cubic, line); 93 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) { 103 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped); 111 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped) 120 const SkDCubic& cubic = lineCubicTests[iIndex].cubic; local 187 const SkDCubic& cubic = lineCubicTests[iIndex].cubic; local [all...] |
PathOpsCubicQuadIntersectionTest.cpp | 16 SkDCubic cubic; member in struct:quadCubic 62 const SkDCubic& cubic = quadCubicTests[index].cubic; local 63 SkASSERT(ValidCubic(cubic)); 68 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); 71 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 79 int roots = i.intersect(cubic, quad); 83 SkDPoint xy1 = cubic.ptAtT(tt1); 116 static const int kCubicToQuadSubdivisionDepth = 8; // slots reserved for cubic to quads subdivision 121 // create a random non-selfintersecting cubic 140 SkDCubic cubic = {{ local [all...] |
PathOpsCubicReduceOrderTest.cpp | 16 static bool controls_inside(const SkDCubic& cubic) { 17 return between(cubic[0].fX, cubic[1].fX, cubic[3].fX) 18 && between(cubic[0].fX, cubic[2].fX, cubic[3].fX) 19 && between(cubic[0].fY, cubic[1].fY, cubic[3].fY 108 const SkDCubic& cubic = pointDegenerates[index]; local 117 const SkDCubic& cubic = notPointDegenerates[index]; local 127 const SkDCubic& cubic = lines[index]; local 136 const SkDCubic& cubic = notLines[index]; local 145 const SkDCubic& cubic = modEpsilonLines[index]; local 154 const SkDCubic& cubic = lessEpsilonLines[index]; local 164 const SkDCubic& cubic = negEpsilonLines[index]; local 175 SkDCubic cubic = quad.toCubic(); local 185 SkDCubic cubic = quad.toCubic(); local 195 SkDCubic cubic = quad.toCubic(); local [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
CubicUtilities_Test.cpp | 10 const Cubic tests[] = { 21 const Cubic& cubic = tests[index]; local 22 bool result = clockwise(cubic);
|
LineParameteters_Test.cpp | 12 const Cubic tests[] = { 45 const Cubic& cubic = tests[index]; local 46 lineParameters.cubicEndPoints(cubic); 48 denormalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); 49 denormalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2); 68 normalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1); 69 normalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2);
|
LineCubicIntersection_Test.cpp | 14 Cubic cubic; member in struct:lineCubic 26 const Cubic& cubic = lineCubicTests[index].cubic; local 28 Cubic reduce1; 30 int order1 = reduceOrder(cubic, reduce1, kReduceOrder_NoQuadraticsAllowed, 34 printf("[%d] cubic order=%d\n", (int) index, order1); 47 xy_at_t(cubic, tt1, tx1, ty1);
|
CubicReduceOrder_Test.cpp | 15 Cubic reduce; 48 const Cubic& cubic = pointDegenerates[index]; local 49 order = reduceOrder(cubic, reduce, kReduceOrder_QuadraticsAllowed, 56 const Cubic& cubic = notPointDegenerates[index]; local 57 order = reduceOrder(cubic, reduce, kReduceOrder_QuadraticsAllowed, 64 const Cubic& cubic = lines[index]; local 65 order = reduceOrder(cubic, reduce, kReduceOrder_QuadraticsAllowed 72 const Cubic& cubic = notLines[index]; local 80 const Cubic& cubic = modEpsilonLines[index]; local 88 const Cubic& cubic = lessEpsilonLines[index]; local 96 const Cubic& cubic = negEpsilonLines[index]; local 105 Cubic cubic; local 115 Cubic cubic; local 126 const Cubic& cubic = lines[index]; local [all...] |
LineCubicIntersection.cpp | 13 Find the interection of a line and cubic by solving for valid t values. 15 Analogous to line-quadratic intersection, solve line-cubic intersection by 16 representing the cubic as: 24 Then using Mathematica, solve for the values of t where the cubic intersects the 54 instead, use Numeric Solutions recipe to solve the cubic. 76 So the cubic coefficients are: 83 LineCubicIntersections(const Cubic& c, const _Line& l, Intersections& i) 84 : cubic(c) 93 Cubic r; 95 r[n].x = (cubic[n].y - line[0].y) * adj - (cubic[n].x - line[0].x) * opp 254 const Cubic& cubic; member in class:LineCubicIntersections [all...] |
ConvexHull_Test.cpp | 11 const Cubic convex[] = { 21 const Cubic bowtie[] = { 30 const Cubic arrow[] = { 39 const Cubic three[] = { 50 const Cubic triangle[] = { 75 const Cubic* data; 106 static void transform(const Cubic& cubic, const Matrix3x2& matrix, Cubic& rotPath) { 108 rotPath[index].x = cubic[index].x * matrix[0][0 232 const Cubic& cubic = set.data[inner]; local 359 const Cubic& cubic = x_cubic[index]; local [all...] |
CubicToQuadratics_Test.cpp | 8 static void test(const Cubic* cubics, const char* name, int firstTest, size_t testCount) { 11 const Cubic& cubic = cubics[index]; local 12 double precision = calcPrecision(cubic); 13 (void) cubic_to_quadratics(cubic, precision, quads); 15 printf("%s [%d] cubic to quadratics failed count=%d\n", name, (int) index, 25 Cubic cubic; local 26 quad_to_cubic(quad, cubic); 27 double precision = calcPrecision(cubic); 40 const Cubic& cubic = cubics[index]; local 63 const Cubic& cubic = cubics[index][idx2]; local 159 const Cubic& cubic = locals[x]; local 193 Cubic cubic; local 233 const Cubic& cubic = samples[x][y]; local [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
SkPathOpsBounds.cpp | 13 SkDCubic cubic; local 14 cubic.set(a); 16 dRect.setBounds(cubic);
|
SkPathOpsCubic.h | 35 static void Coefficients(const double* cubic, double* A, double* B, double* C, double* D); 43 SkDCubic cubic; local 44 cubic.set(a); 45 return cubic.findInflections(tValues); 69 SkDCubic cubic; local 70 cubic.set(a); 71 return cubic.subDivide(t1, t2); 78 SkDCubic cubic; local 79 cubic.set(pts); 80 cubic.subDivide(a, d, t1, t2, p) [all...] |
SkIntersections.cpp | 52 SkDCubic cubic; local 53 cubic.set(pts); 55 return intersectRay(cubic, line); 204 SkDCubic cubic; local 205 cubic.set(a); 206 return vertical(cubic, top, bottom, x, flipped);
|
SkPathOpsCurve.h | 28 SkDCubic cubic; local 29 cubic.set(a); 30 return cubic.ptAtT(t); 72 SkDCubic cubic; local 73 cubic.set(a); 74 return cubic.dxdyAtT(t); 111 SkDCubic cubic; local 112 cubic.set(a); 113 SkDPoint topPt = cubic.top(startT, endT); 139 SkDCubic cubic; local 166 SkDCubic cubic; local [all...] |
SkReduceOrder.cpp | 60 // note that three points in a line doesn't simplify a cubic 109 static int coincident_line(const SkDCubic& cubic, SkDCubic& reduction) { 110 reduction[0] = reduction[1] = cubic[0]; 118 static int vertical_line(const SkDCubic& cubic, SkDCubic& reduction) { 119 reduction[0] = cubic[0]; 120 reduction[1] = cubic[3]; 124 static int horizontal_line(const SkDCubic& cubic, SkDCubic& reduction) { 125 reduction[0] = cubic[0]; 126 reduction[1] = cubic[3]; 131 static int check_quadratic(const SkDCubic& cubic, SkDCubic& reduction) 275 SkDCubic cubic; local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
SVGPathSegListSource.cpp | 100 SVGPathSegCurvetoCubic* cubic = static_cast<SVGPathSegCurvetoCubic*>(m_segment.get()); local 101 point1 = FloatPoint(cubic->x1(), cubic->y1()); 102 point2 = FloatPoint(cubic->x2(), cubic->y2()); 103 targetPoint = FloatPoint(cubic->x(), cubic->y());
|
/external/chromium_org/third_party/WebKit/Source/platform/animation/ |
TimingFunction.cpp | 38 return "cubic-bezier(" + String::numberToStringECMAScript(this->x1()) + ", " + 54 // This works by taking taking the derivative of the cubic bezier, on the y 204 const CubicBezierTimingFunction& cubic = toCubicBezierTimingFunction(lhs); local 205 return (cubic == rhs);
|
/external/chromium_org/third_party/skia/src/pdf/ |
SkPDFUtils.cpp | 154 SkPoint cubic[4]; local 155 SkConvertQuadToCubic(args, cubic); 156 AppendCubic(cubic[1].fX, cubic[1].fY, cubic[2].fX, cubic[2].fY, 157 cubic[3].fX, cubic[3].fY, ¤tSegment);
|
/external/chromium_org/third_party/skia/src/utils/win/ |
SkDWriteGeometrySink.cpp | 88 } Cubic[4], Quadratic[3]; 90 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) { 91 float dx10 = cubic[1].x - cubic[0].x; 92 float dx23 = cubic[2].x - cubic[3].x; 93 float midX = cubic[0].x + dx10 * 3 / 2; 94 //NOTE: !approximately_equal(midX - cubic[3].x, dx23 * 3 / 2) 96 if (!approximately_equal(midX, (dx23 * 3 / 2) + cubic[3].x)) 118 Cubic cubic = { { prevPt.x, prevPt.y }, local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/animation/ |
CompositorAnimations.cpp | 316 const CubicBezierTimingFunction* cubic = toCubicBezierTimingFunction(timingFunction); local 318 if (cubic->subType() == CubicBezierTimingFunction::Custom) { 319 curve.add(keyframe, cubic->x1(), cubic->y1(), cubic->x2(), cubic->y2()); 323 switch (cubic->subType()) {
|