Home
last modified time | relevance | path

Searched refs:SkDCubic (Results 1 – 25 of 42) sorted by relevance

12

/external/skia/src/pathops/
DSkPathOpsTSect.cpp37 int SkIntersections::intersect(const SkDCubic& cubic, const SkDQuad& quad) { in intersect()
38 SkTSect<SkDCubic, SkDQuad> sect1(cubic in intersect()
40 SkTSect<SkDQuad, SkDCubic> sect2(quad in intersect()
42 SkTSect<SkDCubic, SkDQuad>::BinarySearch(&sect1, &sect2, this); in intersect()
46 int SkIntersections::intersect(const SkDCubic& cubic, const SkDConic& conic) { in intersect()
47 SkTSect<SkDCubic, SkDConic> sect1(cubic in intersect()
49 SkTSect<SkDConic, SkDCubic> sect2(conic in intersect()
51 SkTSect<SkDCubic, SkDConic>::BinarySearch(&sect1, &sect2, this); in intersect()
55 int SkIntersections::intersect(const SkDCubic& cubic1, const SkDCubic& cubic2) { in intersect()
56 SkTSect<SkDCubic, SkDCubic> sect1(cubic1 in intersect()
[all …]
DSkPathOpsCubic.h16 struct SkDCubic { struct
68 SkDCubic cubic; in FindInflections() argument
78 bool hullIntersects(const SkDCubic& c2, bool* isLinear) const; argument
106 const SkDCubic& set(const SkPoint pts[kPointCount] in set() argument
116 SkDCubic subDivide(double t1, double t2) const;
118 static SkDCubic SubDivide(const SkPoint a[kPointCount], double t1, double t2) { in SubDivide() argument
119 SkDCubic cubic; in SubDivide()
127 SkDCubic cubic; in SubDivide() argument
131 double top(const SkDCubic& dCurve, double startT, double endT, SkDPoint*topPt) const;
158 const SkDCubic first() const { in first() argument
[all …]
DSkIntersections.h84 SkDCubic cubic; in cubicHorizontal()
91 SkDCubic cubic; in cubicVertical()
98 SkDCubic cubic; in cubicLine()
240 void cubicInsert(double one, double two, const SkDPoint& pt, const SkDCubic& c1,
241 const SkDCubic& c2);
246 int horizontal(const SkDCubic&, double y, double tRange[3]);
248 int horizontal(const SkDCubic&, double left, double right, double y, bool flipped);
249 int horizontal(const SkDCubic&, double left, double right, double y, double tRange[3]);
264 int intersect(const SkDCubic&, const SkDLine&);
265 int intersect(const SkDCubic&, const SkDQuad&);
[all …]
DSkDCubicLineIntersection.cpp85 LineCubicIntersections(const SkDCubic& c, const SkDLine& l, SkIntersections* i) in LineCubicIntersections()
124 SkDCubic c; in intersectRay()
130 SkDCubic::Coefficients(&c[0].fX, &A, &B, &C, &D); in intersectRay()
131 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in intersectRay()
140 int extrema = SkDCubic::FindExtrema(&c[0].fX, extremeTs); in intersectRay()
141 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots); in intersectRay()
167 static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) { in HorizontalIntersect()
169 SkDCubic::Coefficients(&c[0].fY, &A, &B, &C, &D); in HorizontalIntersect()
171 int count = SkDCubic::RootsValidT(A, B, C, D, roots); in HorizontalIntersect()
176 int extrema = SkDCubic::FindExtrema(&c[0].fY, extremeTs); in HorizontalIntersect()
[all …]
DSkPathOpsCubic.cpp17 const int SkDCubic::gPrecisionUnit = 256; // FIXME: test different values in test framework
19 void SkDCubic::align(int endIndex, int ctrlIndex, SkDPoint* dstPt) const { in align()
30 double SkDCubic::binarySearch(double min, double max, double axisIntercept, in binarySearch()
79 double SkDCubic::calcPrecision() const { in calcPrecision()
103 SkDCubicPair SkDCubic::chopAt(double t) const { in chopAt()
125 void SkDCubic::Coefficients(const double* src, double* A, double* B, double* C, double* D) { in Coefficients()
135 bool SkDCubic::endsAreExtremaInXOrY() const { in endsAreExtremaInXOrY()
149 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const { in hullIntersects()
198 bool SkDCubic::hullIntersects(const SkDCubic& c2, bool* isLinear) const { in hullIntersects()
202 bool SkDCubic::hullIntersects(const SkDQuad& quad, bool* isLinear) const { in hullIntersects()
[all …]
DSkReduceOrder.cpp103 static int coincident_line(const SkDCubic& cubic, SkDCubic& reduction) { in coincident_line()
108 static int reductionLineCount(const SkDCubic& reduction) { in reductionLineCount()
112 static int vertical_line(const SkDCubic& cubic, SkDCubic& reduction) { in vertical_line()
118 static int horizontal_line(const SkDCubic& cubic, SkDCubic& reduction) { in horizontal_line()
125 static int check_quadratic(const SkDCubic& cubic, SkDCubic& reduction) { in check_quadratic()
151 static int check_linear(const SkDCubic& cubic, in check_linear()
152 int minX, int maxX, int minY, int maxY, SkDCubic& reduction) { in check_linear()
188 int SkReduceOrder::reduce(const SkDCubic& cubic, Quadratics allowQuadratics) { in reduce()
273 SkDCubic cubic; in Cubic()
DSkLineParameters.h31 bool cubicEndPoints(const SkDCubic& pts) { in cubicEndPoints()
71 void cubicEndPoints(const SkDCubic& pts, int s, int e) { in cubicEndPoints()
77 double cubicPart(const SkDCubic& part) { in cubicPart()
138 void cubicDistanceY(const SkDCubic& pts, SkDCubic& distance) const { in cubicDistanceY()
154 double controlPtDistance(const SkDCubic& pts, int index) const { in controlPtDistance()
DSkPathOpsRect.cpp47 void SkDRect::setBounds(const SkDCubic& curve, const SkDCubic& sub, double startT, double endT) { in setBounds()
53 roots = SkDCubic::FindExtrema(&sub[0].fX, tValues); in setBounds()
56 roots += SkDCubic::FindExtrema(&sub[0].fY, &tValues[roots]); in setBounds()
DSkOpCubicHull.cpp9 static bool rotate(const SkDCubic& cubic, int zero, int index, SkDCubic& rotPath) { in rotate()
55 int SkDCubic::convexHull(char order[4]) const { in convexHull()
79 SkDCubic rotPath; in convexHull()
136 SkDCubic midPath; in convexHull()
DSkPathOpsCurve.h38 void set(const SkDCubic& cubic) { in set()
39 for (int index = 0; index < SkDCubic::kPointCount; ++index) { in set()
53 SkDCubic fCubic;
121 SkDCubic cubic; in dcubic_xy_at_t()
201 SkDCubic cubic; in dcubic_dxdy_at_t()
284 SkDCubic cubic; in cubic_is_vertical()
286 SkDCubic dst = cubic.subDivide(startT, endT); in cubic_is_vertical()
322 SkDCubic cubic; in cubic_intersect_ray()
393 SkDCubic cubic; in cubic_intercept_h()
398 SkDCubic cubic; in cubic_intercept_v()
DSkPathOpsRect.h56 void setBounds(const SkDCubic& curve) { in setBounds()
60 void setBounds(const SkDCubic& curve, const SkDCubic& sub, double tStart, double tEnd);
DSkReduceOrder.h22 int reduce(const SkDCubic& cubic, Quadratics);
32 SkDCubic fCubic;
DSkOpEdgeBuilder.cpp268 int breaks = SkDCubic::ComplexBreak(pointsPtr, splitT); in walk()
287 SkDCubic part = SkDCubic::SubDivide(pointsPtr, split->fT[0], split->fT[1]); in walk()
320 SkDCubic part = SkDCubic::SubDivide(pointsPtr, split->fT[0], in walk()
DSkPathOpsQuad.h82 bool hullIntersects(const SkDCubic& , bool* isLinear) const;
111 SkDCubic debugToCubic() const;
DSkDCubicToQuads.cpp35 SkDQuad SkDCubic::toQuad() const { in toQuad()
/external/skia/tests/
DPathOpsDebug.cpp75 void SkDCubic::dump() const { in dump()
80 void SkDCubic::dumpID(int id) const { in dumpID()
88 void SkDCubic::dumpInner() const { in dumpInner()
416 SkDCubic cubic; in DontCallDebugSpan()
419 SkTSect<SkDQuad, SkDCubic> q1c2(quad SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
422 … SkTSect<SkDConic, SkDCubic> k1c2(conic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
423 SkTSect<SkDCubic, SkDQuad> c1q2(cubic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
424 … SkTSect<SkDCubic, SkDConic> c1k2(cubic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
425 … SkTSect<SkDCubic, SkDCubic> c1c2(cubic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); in DontCallDebugSpan()
446 SkDCubic cubic; in DontCallDebugT()
[all …]
DPathOpsTestCommon.cpp16 static double calc_t_div(const SkDCubic& cubic, double precision, double start) { in calc_t_div()
18 SkDCubic sub; in calc_t_div()
19 const SkDCubic* cPtr; in calc_t_div()
27 const SkDCubic& c = *cPtr; in calc_t_div()
39 static bool add_simple_ts(const SkDCubic& cubic, double precision, SkTArray<double, true>* ts) { in add_simple_ts()
51 static void addTs(const SkDCubic& cubic, double precision, double start, double end, in addTs()
63 static void toQuadraticTs(const SkDCubic* cubic, double precision, SkTArray<double, true>* ts) { in toQuadraticTs()
119 SkDCubic part = cubic->subDivide(0, inflectT[0]); in toQuadraticTs()
133 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads) { in CubicToQuads()
146 SkDCubic part = cubic.subDivide(tStart, tEnd); in CubicToQuads()
[all …]
DPathOpsCubicReduceOrderTest.cpp16 static bool controls_inside(const SkDCubic& cubic) {
23 static bool tiny(const SkDCubic& cubic) {
44 static void find_tight_bounds(const SkDCubic& cubic, SkDRect& bounds) {
109 SkDCubic cubic; in DEF_TEST()
120 SkDCubic cubic; in DEF_TEST()
132 SkDCubic cubic; in DEF_TEST()
143 SkDCubic cubic; in DEF_TEST()
154 SkDCubic cubic; in DEF_TEST()
165 SkDCubic cubic; in DEF_TEST()
177 SkDCubic cubic; in DEF_TEST()
[all …]
DPathOpsCubicLineIntersectionIdeas.cpp54 static double binary_search(const SkDCubic& cubic, double step, const SkDPoint& pt, double t, in binary_search()
155 SkDCubic cubic; in DEF_TEST()
161 SkDCubic::Coefficients(&cubic[0].fY, &A, &B, &C, &D); in DEF_TEST()
164 int realRoots = SkDCubic::RootsReal(A, B, C, D, allRoots); in DEF_TEST()
254 SkDCubic cubic; in testOneFailure()
258 SkDCubic::Coefficients(&cubic[0].fY, &A, &B, &C, &D); in testOneFailure()
261 int realRoots = SkDCubic::RootsReal(A, B, C, D, allRoots); in testOneFailure()
DPathOpsTestCommon.h32 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads);
35 bool ValidCubic(const SkDCubic& cubic);
DPathOpsCubicLineIntersectionTest.cpp29 SkDCubic cubic; in testFail()
101 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) { in doIntersect()
129 SkDCubic cubic; in testOne()
196 SkDCubic cubic; in DEF_TEST()
DPathOpsCubicIntersectionTest.cpp24 SkDCubic c1, c2; in standardTestCases()
389 SkDCubic c1, c2; in oneOff()
495 SkDCubic c1, c2; in CubicIntersection_RandTest()
532 SkDCubic c1, c2; in intersectionFinder()
651 int breaks = SkDCubic::ComplexBreak(c, loopT); in selfOneOff()
657 SkDCubic chopped[2]; in selfOneOff()
DPathOpsDRectTest.cpp37 static void setRawBounds(const SkDCubic& cubic, SkDRect* rect) { in setRawBounds()
63 SkDCubic cubic; in DEF_TEST()
DPathOpsDCubicTest.cpp20 SkDCubic cubic; in DEF_TEST()
DPathOpsLineParametetersTest.cpp44 SkDCubic cubic; in DEF_TEST()

12