Searched refs:SkDConic (Results 1 - 25 of 25) sorted by relevance

/external/skia/src/pathops/
H A DSkPathOpsTSect.cpp19 int SkIntersections::intersect(const SkDConic& conic, const SkDQuad& quad) {
20 SkTSect<SkDConic, SkDQuad> sect1(conic
22 SkTSect<SkDQuad, SkDConic> sect2(quad
24 SkTSect<SkDConic, SkDQuad>::BinarySearch(&sect1, &sect2, this);
28 int SkIntersections::intersect(const SkDConic& conic1, const SkDConic& conic2) {
29 SkTSect<SkDConic, SkDConic> sect1(conic1
31 SkTSect<SkDConic, SkDConic> sect
[all...]
H A DSkPathOpsConic.cpp31 int SkDConic::FindExtrema(const double src[], SkScalar w, double t[1]) {
49 SkDVector SkDConic::dxdyAtT(double t) const {
83 bool SkDConic::hullIntersects(const SkDCubic& cubic, bool* isLinear) const {
87 SkDPoint SkDConic::ptAtT(double t) const {
123 SkDConic SkDConic::subDivide(double t1, double t2) const {
159 SkDConic dst = {{{{ax / az, ay / az}, {bx / bz, by / bz}, {cx / cz, cy / cz}}
165 SkDPoint SkDConic::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2,
167 SkDConic chopped = this->subDivide(t1, t2);
H A DSkPathOpsConic.h14 struct SkDConic { struct
36 SkDConic flip() const {
37 SkDConic result = {{{fPts[2], fPts[1], fPts[0]}
48 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight
73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const {
105 SkDConic subDivide(double t1, double t2) const;
107 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) {
108 SkDConic conic;
119 SkDConic conic;
H A DSkPathOpsRect.cpp30 void SkDRect::setBounds(const SkDConic& curve, const SkDConic& sub, double startT, double endT) {
36 roots = SkDConic::FindExtrema(&sub[0].fX, sub.fWeight, tValues);
39 roots += SkDConic::FindExtrema(&sub[0].fY, sub.fWeight, &tValues[roots]);
H A DSkDConicLineIntersection.cpp19 LineConicIntersections(const SkDConic& c, const SkDLine& l, SkIntersections* i)
27 LineConicIntersections(const SkDConic& c)
179 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
190 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
220 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
231 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic
[all...]
H A DSkPathOpsRect.h50 void setBounds(const SkDConic& curve) {
54 void setBounds(const SkDConic& curve, const SkDConic& sub, double tStart, double tEnd);
H A DSkIntersections.h59 SkDConic conic;
67 SkDConic conic;
74 SkDConic conic;
247 int horizontal(const SkDConic&, double left, double right, double y, bool flipped);
252 static int HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots);
261 int intersect(const SkDConic&, const SkDLine&);
262 int intersect(const SkDConic&, const SkDQuad&);
263 int intersect(const SkDConic&, const SkDConic&);
266 int intersect(const SkDCubic&, const SkDConic
[all...]
H A DSkPathOpsCurve.h52 SkDConic fConic;
115 SkDConic conic;
195 SkDConic conic;
277 SkDConic conic;
279 SkDConic dst = conic.subDivide(startT, endT);
315 SkDConic conic;
383 SkDConic conic;
388 SkDConic conic;
H A DSkPathOpsQuad.h81 bool hullIntersects(const SkDConic& , bool* isLinear) const;
H A DSkPathOpsCubic.h79 bool hullIntersects(const SkDConic& c, bool* isLinear) const;
H A DSkPathOpsCurve.cpp64 SkDConic dCurve;
H A DSkPathOpsQuad.cpp81 bool SkDQuad::hullIntersects(const SkDConic& conic, bool* isLinear) const {
H A DSkPathOpsTypes.h564 struct SkDConic;
H A DSkAddIntersections.cpp285 SkDConic conic1, conic2;
H A DSkPathOpsCubic.cpp206 bool SkDCubic::hullIntersects(const SkDConic& conic, bool* isLinear) const {
H A DSkOpSegment.cpp1591 edge->fConic[1] = SkDConic::SubDivide(fPts, fWeight, edge->fQuad[0], edge->fQuad[2],
H A DSkPathOpsDebug.cpp733 void SkDConic::debugSet(const SkDPoint* pts, SkScalar weight) {
/external/skia/tests/
H A DPathOpsDebug.cpp59 void SkDConic::dump() const {
64 void SkDConic::dumpID(int id) const {
69 void SkDConic::dumpInner() const {
415 SkDConic conic;
418 SkTSect<SkDQuad, SkDConic> q1k2(quad SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
420 SkTSect<SkDConic, SkDQuad> k1q2(conic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
421 SkTSect<SkDConic, SkDConic> k1k2(conic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
422 SkTSect<SkDConic, SkDCubic> k1c2(conic SkDEBUGPARAMS(nullptr) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
424 SkTSect<SkDCubic, SkDConic> c1k
[all...]
H A DPathOpsConicIntersectionTest.cpp47 static void chopCompare(const SkConic chopped[2], const SkDConic dChopped[2]) {
117 static void writeDPng(const SkDConic& dC, const char* name) {
119 SkDConic dConic = {{{ {dC.fPts[0].fX * scale, dC.fPts[0].fY * scale },
146 SkDConic chopped = dConic.subDivide(tIndex / (double) chops,
160 static void chopBothWays(const SkDConic& dConic, double t, const char* name) {
167 SkDConic dChopped[2];
183 const SkDConic frame0[] = {
188 const SkDConic frame1[] = {
195 const SkDConic frame2[] = {
202 const SkDConic frame
[all...]
H A DPathOpsTestCommon.h34 bool ValidConic(const SkDConic& cubic);
H A DPathOpsConicQuadIntersectionTest.cpp29 SkDConic conic;
H A DPathOpsCubicConicIntersectionTest.cpp37 SkDConic conic;
H A DPathOpsConicLineIntersectionTest.cpp32 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line,
73 SkDConic conic;
102 SkDConic conic;
H A DPathOpsTestCommon.cpp268 bool ValidConic(const SkDConic& conic) {
269 for (int index = 0; index < SkDConic::kPointCount; ++index) {
/external/skia/samplecode/
H A DSampleAAGeometry.cpp1273 SkDConic conic;

Completed in 3373 milliseconds