Home
last modified time | relevance | path

Searched defs:SkDConic (Results 1 – 2 of 2) sorted by relevance

/external/skia/src/pathops/
DSkPathOpsConic.h13 struct SkDConic { struct
36 SkDConic flip() const { in flip() argument
48 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight in set() argument
73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects() argument
79 bool isLinear(int startIndex, int endIndex) const { in isLinear()
83 static int maxIntersections() { return kMaxIntersections; } in maxIntersections()
85 bool monotonicInX() const { in monotonicInX()
109 SkDConic subDivide(double t1, double t2) const; argument
110 void subDivide(double t1, double t2, SkDConic* c) const { *c = this->subDivide(t1, t2); } in subDivide() argument
112 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) { in SubDivide() argument
[all …]
/external/skqp/src/pathops/
DSkPathOpsConic.h13 struct SkDConic { struct
36 SkDConic flip() const { in flip() argument
48 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight in set() argument
73 bool hullIntersects(const SkDConic& conic, bool* isLinear) const { in hullIntersects() argument
79 bool isLinear(int startIndex, int endIndex) const { in isLinear()
83 static int maxIntersections() { return kMaxIntersections; } in maxIntersections()
85 bool monotonicInX() const { in monotonicInX()
109 SkDConic subDivide(double t1, double t2) const; argument
110 void subDivide(double t1, double t2, SkDConic* c) const { *c = this->subDivide(t1, t2); } in subDivide() argument
112 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) { in SubDivide() argument
[all …]