Home
last modified time | relevance | path

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

/external/skqp/src/pathops/
DSkPathOpsCubic.h18 static const int kPointCount = 4; member
19 static const int kPointLast = kPointCount - 1;
43 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
44 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
52 int convexHull(char order[kPointCount]) const;
68 static int FindInflections(const SkPoint a[kPointCount], double tValues[2]) { in FindInflections()
87 void otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const;
88 static int pointCount() { return kPointCount; } in pointCount()
110 const SkDCubic& set(const SkPoint pts[kPointCount] in set()
123 static SkDCubic SubDivide(const SkPoint a[kPointCount], double t1, double t2) { in SubDivide()
[all …]
DSkPathOpsQuad.h23 static const int kPointCount = 3; member
24 static const int kPointLast = kPointCount - 1;
27 SkDPoint fPts[kPointCount];
53 const SkDQuad& set(const SkPoint pts[kPointCount] in set()
62 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
63 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
89 static int pointCount() { return kPointCount; } in pointCount()
98 static SkDQuad SubDivide(const SkPoint a[kPointCount], double t1, double t2) { in SubDivide()
104 static SkDPoint SubDivide(const SkPoint pts[kPointCount], const SkDPoint& a, const SkDPoint& c, in SubDivide()
174 int pointCount() const override { return SkDQuad::kPointCount; } in pointCount()
DSkPathOpsConic.h14 static const int kPointCount = 3; member
15 static const int kPointLast = kPointCount - 1;
48 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight in set()
97 static int pointCount() { return kPointCount; } in pointCount()
112 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) { in SubDivide()
121 static SkDPoint SubDivide(const SkPoint pts[kPointCount], SkScalar weight, in SubDivide()
183 int pointCount() const override { return SkDConic::kPointCount; } in pointCount()
DSkDConicLineIntersection.cpp179 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactEndPoints()
190 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearEndPoints()
220 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactHorizontalEndPoints()
231 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearHorizontalEndPoints()
246 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactVerticalEndPoints()
257 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearVerticalEndPoints()
DSkPathOpsQuad.cpp49 for (int oddMan = 0; oddMan < kPointCount; ++oddMan) { in hullIntersects()
62 for (int n = 0; n < kPointCount; ++n) { in hullIntersects()
103 for (int opp = 1; opp < kPointCount; ++opp) { in otherPts()
DSkPathOpsCubic.cpp198 return hullIntersects(c2.fPts, c2.kPointCount, isLinear); in hullIntersects()
202 return hullIntersects(quad.fPts, quad.kPointCount, isLinear); in hullIntersects()
333 void SkDCubic::otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const { in otherPts()
712 for (int index = 0; index < kPointCount * 2; ++index) { in toFloatPoints()
718 return SkScalarsAreFinite(&pts->fX, kPointCount * 2); in toFloatPoints()
DSkPathOpsCurve.h31 for (int index = 0; index < SkDQuad::kPointCount; ++index) { in set()
39 for (int index = 0; index < SkDCubic::kPointCount; ++index) { in set()
/external/skia/src/pathops/
DSkPathOpsCubic.h18 static const int kPointCount = 4; member
19 static const int kPointLast = kPointCount - 1;
43 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
44 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
52 int convexHull(char order[kPointCount]) const;
68 static int FindInflections(const SkPoint a[kPointCount], double tValues[2]) { in FindInflections()
87 void otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const;
88 static int pointCount() { return kPointCount; } in pointCount()
110 const SkDCubic& set(const SkPoint pts[kPointCount] in set()
123 static SkDCubic SubDivide(const SkPoint a[kPointCount], double t1, double t2) { in SubDivide()
[all …]
DSkPathOpsQuad.h23 static const int kPointCount = 3; member
24 static const int kPointLast = kPointCount - 1;
27 SkDPoint fPts[kPointCount];
53 const SkDQuad& set(const SkPoint pts[kPointCount] in set()
62 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
63 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; }
89 static int pointCount() { return kPointCount; } in pointCount()
98 static SkDQuad SubDivide(const SkPoint a[kPointCount], double t1, double t2) { in SubDivide()
104 static SkDPoint SubDivide(const SkPoint pts[kPointCount], const SkDPoint& a, const SkDPoint& c, in SubDivide()
174 int pointCount() const override { return SkDQuad::kPointCount; } in pointCount()
DSkPathOpsConic.h14 static const int kPointCount = 3; member
15 static const int kPointLast = kPointCount - 1;
48 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight in set()
97 static int pointCount() { return kPointCount; } in pointCount()
112 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) { in SubDivide()
121 static SkDPoint SubDivide(const SkPoint pts[kPointCount], SkScalar weight, in SubDivide()
183 int pointCount() const override { return SkDConic::kPointCount; } in pointCount()
DSkDConicLineIntersection.cpp179 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactEndPoints()
190 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearEndPoints()
220 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactHorizontalEndPoints()
231 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearHorizontalEndPoints()
246 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addExactVerticalEndPoints()
257 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { in addNearVerticalEndPoints()
DSkPathOpsQuad.cpp49 for (int oddMan = 0; oddMan < kPointCount; ++oddMan) { in hullIntersects()
62 for (int n = 0; n < kPointCount; ++n) { in hullIntersects()
103 for (int opp = 1; opp < kPointCount; ++opp) { in otherPts()
DSkPathOpsCubic.cpp199 return hullIntersects(c2.fPts, SkDCubic::kPointCount, isLinear); in hullIntersects()
203 return hullIntersects(quad.fPts, SkDQuad::kPointCount, isLinear); in hullIntersects()
335 void SkDCubic::otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const { in otherPts()
714 for (int index = 0; index < kPointCount * 2; ++index) { in toFloatPoints()
720 return SkScalarsAreFinite(&pts->fX, kPointCount * 2); in toFloatPoints()
DSkPathOpsCurve.h31 for (int index = 0; index < SkDQuad::kPointCount; ++index) { in set()
39 for (int index = 0; index < SkDCubic::kPointCount; ++index) { in set()
/external/skqp/tests/
DPathOpsTestCommon.h16 static const int kPointCount = 3; member
17 SkDPoint fPts[kPointCount];
26 static const int kPointCount = 4; member
27 SkDPoint fPts[kPointCount];
DPathOpsTestCommon.cpp269 for (int index = 0; index < SkDConic::kPointCount; ++index) { in ValidConic()
/external/skia/tests/
DPathOpsTestCommon.h16 static const int kPointCount = 3; member
17 SkDPoint fPts[kPointCount];
26 static const int kPointCount = 4; member
27 SkDPoint fPts[kPointCount];
DPathOpsTestCommon.cpp264 for (int index = 0; index < SkDConic::kPointCount; ++index) { in ValidConic()
/external/dynamic_depth/internal/dynamic_depth/
Dpoint_cloud.cc17 const char kPointCount[] = "PointCount"; variable
103 DynamicDepthConst::PointCloud(), kPointCount, in Serialize()
129 if (!deserializer.ParseInt(DynamicDepthConst::PointCloud(), kPointCount, in ParseFields()
/external/skqp/src/core/
DSkGeometry.h449 kPointCount = 1 + 2 * kQuadCount, enumerator
451 SkAutoSTMalloc<kPointCount, SkPoint> fStorage;
/external/skia/src/core/
DSkGeometry.h519 kPointCount = 1 + 2 * kQuadCount, enumerator
521 SkAutoSTMalloc<kPointCount, SkPoint> fStorage;