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

/external/skia/src/pathops/
H A DSkPathOpsQuad.h22 static const int kPointCount = 3; member in struct:SkDQuad
23 static const int kPointLast = kPointCount - 1;
26 SkDPoint fPts[kPointCount];
50 const SkDQuad& set(const SkPoint pts[kPointCount]) {
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) {
90 static SkDPoint SubDivide(const SkPoint pts[kPointCount], const SkDPoint& a, const SkDPoint& c,
H A DSkPathOpsCubic.h21 static const int kPointCount = 4; member in struct:SkDCubic
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]) {
82 void otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const;
101 const SkDCubic& set(const SkPoint pts[kPointCount]) {
111 static SkDCubic SubDivide(const SkPoint a[kPointCount], double t1, double t2) {
118 static void SubDivide(const SkPoint pts[kPointCount], cons
[all...]
H A DSkPathOpsConic.h15 static const int kPointCount = 3; member in struct:SkDConic
16 static const int kPointLast = kPointCount - 1;
41 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight) {
99 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) {
108 static SkDPoint SubDivide(const SkPoint pts[kPointCount], SkScalar weight,
H A DSkDConicLineIntersection.cpp173 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
184 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
199 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
210 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
225 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
236 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
H A DSkPathOpsQuad.cpp23 for (int oddMan = 0; oddMan < kPointCount; ++oddMan) {
36 for (int n = 0; n < kPointCount; ++n) {
69 for (int opp = 1; opp < kPointCount; ++opp) {
H A DSkPathOpsCurve.h31 for (int index = 0; index < SkDQuad::kPointCount; ++index) {
39 for (int index = 0; index < SkDCubic::kPointCount; ++index) {
H A DSkPathOpsCubic.cpp202 return hullIntersects(c2.fPts, c2.kPointCount, isLinear);
206 return hullIntersects(quad.fPts, quad.kPointCount, isLinear);
301 void SkDCubic::otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const {
H A DSkPathOpsTSect.h592 for (int outer = 0; outer < TCurve::kPointCount - 1; ++outer) {
593 for (int inner = outer + 1; inner < TCurve::kPointCount; ++inner) {
611 for (int n = 0; n < OppCurve::kPointCount; ++n) {
651 const SkDPoint* otherPts[TCurve::kPointCount - 1], * oppOtherPts[OppCurve::kPointCount - 1];
/external/skia/src/core/
H A DSkGeometry.h403 kPointCount = 1 + 2 * kQuadCount, enumerator in enum:SkAutoConicToQuads::__anon17251
405 SkAutoSTMalloc<kPointCount, SkPoint> fStorage;
/external/skia/tests/
H A DPathOpsTestCommon.cpp269 for (int index = 0; index < SkDConic::kPointCount; ++index) {

Completed in 903 milliseconds