/external/skia/tests/ |
H A D | PathOpsTestCommon.h | 16 static const int kPointCount = 3; member in struct:QuadPts 17 SkDPoint fPts[kPointCount]; 26 static const int kPointCount = 4; member in struct:CubicPts 27 SkDPoint fPts[kPointCount];
|
H A D | PathOpsTestCommon.cpp | 269 for (int index = 0; index < SkDConic::kPointCount; ++index) {
|
/external/skqp/tests/ |
H A D | PathOpsTestCommon.h | 16 static const int kPointCount = 3; member in struct:QuadPts 17 SkDPoint fPts[kPointCount]; 26 static const int kPointCount = 4; member in struct:CubicPts 27 SkDPoint fPts[kPointCount];
|
H A D | PathOpsTestCommon.cpp | 269 for (int index = 0; index < SkDConic::kPointCount; ++index) {
|
/external/skia/src/pathops/ |
H A D | SkPathOpsQuad.h | 22 static const int kPointCount = 3; member in struct:SkDQuad 23 static const int kPointLast = kPointCount - 1; 26 SkDPoint fPts[kPointCount]; 52 const SkDQuad& set(const SkPoint pts[kPointCount] 61 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; } 62 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; } 92 static SkDQuad SubDivide(const SkPoint a[kPointCount], double t1, double t2) { 98 static SkDPoint SubDivide(const SkPoint pts[kPointCount], const SkDPoint& a, const SkDPoint& c,
|
H A D | SkPathOpsCubic.h | 17 static const int kPointCount = 4; member in struct:SkDCubic 18 static const int kPointLast = kPointCount - 1; 42 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; } 43 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; } 51 int convexHull(char order[kPointCount]) const; 67 static int FindInflections(const SkPoint a[kPointCount], double tValues[2]) { 85 void otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const; 106 const SkDCubic& set(const SkPoint pts[kPointCount] 118 static SkDCubic SubDivide(const SkPoint a[kPointCount], double t1, double t2) { 125 static void SubDivide(const SkPoint pts[kPointCount], cons [all...] |
H A D | SkPathOpsConic.h | 15 static const int kPointCount = 3; member in struct:SkDConic 16 static const int kPointLast = kPointCount - 1; 48 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight 107 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) { 116 static SkDPoint SubDivide(const SkPoint pts[kPointCount], SkScalar weight,
|
H A D | SkDConicLineIntersection.cpp | 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::kPointLast) { 246 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { 257 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
|
H A D | SkPathOpsQuad.cpp | 48 for (int oddMan = 0; oddMan < kPointCount; ++oddMan) { 61 for (int n = 0; n < kPointCount; ++n) { 102 for (int opp = 1; opp < kPointCount; ++opp) {
|
H A D | SkPathOpsCubic.cpp | 199 return hullIntersects(c2.fPts, c2.kPointCount, isLinear); 203 return hullIntersects(quad.fPts, quad.kPointCount, isLinear); 336 void SkDCubic::otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const { 715 for (int index = 0; index < kPointCount * 2; ++index) { 721 return SkScalarsAreFinite(&pts->fX, kPointCount * 2);
|
H A D | SkPathOpsCurve.h | 31 for (int index = 0; index < SkDQuad::kPointCount; ++index) { 39 for (int index = 0; index < SkDCubic::kPointCount; ++index) {
|
H A D | SkPathOpsTSect.h | 616 for (int outer = 0; outer < TCurve::kPointCount - 1; ++outer) { 617 for (int inner = outer + 1; inner < TCurve::kPointCount; ++inner) { 635 for (int n = 0; n < OppCurve::kPointCount; ++n) { 675 const SkDPoint* otherPts[TCurve::kPointCount - 1], * oppOtherPts[OppCurve::kPointCount - 1];
|
/external/skqp/src/pathops/ |
H A D | SkPathOpsQuad.h | 22 static const int kPointCount = 3; member in struct:SkDQuad 23 static const int kPointLast = kPointCount - 1; 26 SkDPoint fPts[kPointCount]; 52 const SkDQuad& set(const SkPoint pts[kPointCount] 61 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; } 62 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; } 92 static SkDQuad SubDivide(const SkPoint a[kPointCount], double t1, double t2) { 98 static SkDPoint SubDivide(const SkPoint pts[kPointCount], const SkDPoint& a, const SkDPoint& c,
|
H A D | SkPathOpsCubic.h | 17 static const int kPointCount = 4; member in struct:SkDCubic 18 static const int kPointLast = kPointCount - 1; 42 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; } 43 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < kPointCount); return fPts[n]; } 51 int convexHull(char order[kPointCount]) const; 67 static int FindInflections(const SkPoint a[kPointCount], double tValues[2]) { 85 void otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const; 106 const SkDCubic& set(const SkPoint pts[kPointCount] 118 static SkDCubic SubDivide(const SkPoint a[kPointCount], double t1, double t2) { 125 static void SubDivide(const SkPoint pts[kPointCount], cons [all...] |
H A D | SkPathOpsConic.h | 15 static const int kPointCount = 3; member in struct:SkDConic 16 static const int kPointLast = kPointCount - 1; 48 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight 107 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) { 116 static SkDPoint SubDivide(const SkPoint pts[kPointCount], SkScalar weight,
|
H A D | SkDConicLineIntersection.cpp | 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::kPointLast) { 246 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) { 257 for (int cIndex = 0; cIndex < SkDConic::kPointCount; cIndex += SkDConic::kPointLast) {
|
H A D | SkPathOpsQuad.cpp | 45 for (int oddMan = 0; oddMan < kPointCount; ++oddMan) { 58 for (int n = 0; n < kPointCount; ++n) { 99 for (int opp = 1; opp < kPointCount; ++opp) {
|
H A D | SkPathOpsCubic.cpp | 199 return hullIntersects(c2.fPts, c2.kPointCount, isLinear); 203 return hullIntersects(quad.fPts, quad.kPointCount, isLinear); 336 void SkDCubic::otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const { 715 for (int index = 0; index < kPointCount * 2; ++index) { 721 return SkScalarsAreFinite(&pts->fX, kPointCount * 2);
|
H A D | SkPathOpsCurve.h | 31 for (int index = 0; index < SkDQuad::kPointCount; ++index) { 39 for (int index = 0; index < SkDCubic::kPointCount; ++index) {
|
H A D | SkPathOpsTSect.h | 616 for (int outer = 0; outer < TCurve::kPointCount - 1; ++outer) { 617 for (int inner = outer + 1; inner < TCurve::kPointCount; ++inner) { 635 for (int n = 0; n < OppCurve::kPointCount; ++n) { 675 const SkDPoint* otherPts[TCurve::kPointCount - 1], * oppOtherPts[OppCurve::kPointCount - 1];
|
/external/skia/src/core/ |
H A D | SkGeometry.h | 446 kPointCount = 1 + 2 * kQuadCount, enumerator in enum:SkAutoConicToQuads::__anon20666 448 SkAutoSTMalloc<kPointCount, SkPoint> fStorage;
|
/external/skqp/src/core/ |
H A D | SkGeometry.h | 446 kPointCount = 1 + 2 * kQuadCount, enumerator in enum:SkAutoConicToQuads::__anon21334 448 SkAutoSTMalloc<kPointCount, SkPoint> fStorage;
|