Home
last modified time | relevance | path

Searched refs:kPointCount (Results 1 – 10 of 10) sorted by relevance

/external/skia/src/pathops/
DSkPathOpsCubic.h21 static const int kPointCount = 4; member
22 static const int kPointLast = kPointCount - 1;
46 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
47 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
55 int convexHull(char order[kPointCount]) const;
69 static int FindInflections(const SkPoint a[kPointCount], double tValues[2]) { in FindInflections()
82 void otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const;
101 const SkDCubic& set(const SkPoint pts[kPointCount]) { in set()
111 static SkDCubic SubDivide(const SkPoint a[kPointCount], double t1, double t2) { in SubDivide()
118 …static void SubDivide(const SkPoint pts[kPointCount], const SkDPoint& a, const SkDPoint& d, double… in SubDivide()
[all …]
DSkPathOpsQuad.h22 static const int kPointCount = 3; member
23 static const int kPointLast = kPointCount - 1;
26 SkDPoint fPts[kPointCount];
50 const SkDQuad& set(const SkPoint pts[kPointCount]) { in set()
57 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
58 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
84 static SkDQuad SubDivide(const SkPoint a[kPointCount], double t1, double t2) { in SubDivide()
90 static SkDPoint SubDivide(const SkPoint pts[kPointCount], const SkDPoint& a, const SkDPoint& c, in SubDivide()
DSkPathOpsConic.h15 static const int kPointCount = 3; member
16 static const int kPointLast = kPointCount - 1;
41 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight) { in set()
99 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) { in SubDivide()
108 static SkDPoint SubDivide(const SkPoint pts[kPointCount], SkScalar weight, in SubDivide()
DSkDConicLineIntersection.cpp173 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactEndPoints()
184 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearEndPoints()
199 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactHorizontalEndPoints()
210 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearHorizontalEndPoints()
225 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactVerticalEndPoints()
236 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearVerticalEndPoints()
DSkPathOpsQuad.cpp23 for (int oddMan = 0; oddMan < kPointCount; ++oddMan) { in hullIntersects()
36 for (int n = 0; n < kPointCount; ++n) { in hullIntersects()
69 for (int opp = 1; opp < kPointCount; ++opp) { in otherPts()
DSkPathOpsCurve.h31 for (int index = 0; index < SkDQuad::kPointCount; ++index) { in set()
39 for (int index = 0; index < SkDCubic::kPointCount; ++index) { in set()
DSkPathOpsCubic.cpp202 return hullIntersects(c2.fPts, c2.kPointCount, isLinear); in hullIntersects()
206 return hullIntersects(quad.fPts, quad.kPointCount, isLinear); in hullIntersects()
301 void SkDCubic::otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const { in otherPts()
DSkPathOpsTSect.h592 for (int outer = 0; outer < TCurve::kPointCount - 1; ++outer) { in linearIntersects()
593 for (int inner = outer + 1; inner < TCurve::kPointCount; ++inner) { in linearIntersects()
611 for (int n = 0; n < OppCurve::kPointCount; ++n) { in linearIntersects()
651 const SkDPoint* otherPts[TCurve::kPointCount - 1], * oppOtherPts[OppCurve::kPointCount - 1]; in onlyEndPointsInCommon()
/external/skia/src/core/
DSkGeometry.h403 kPointCount = 1 + 2 * kQuadCount, enumerator
405 SkAutoSTMalloc<kPointCount, SkPoint> fStorage;
/external/skia/tests/
DPathOpsTestCommon.cpp269 for (int index = 0; index < SkDConic::kPointCount; ++index) { in ValidConic()