HomeSort by relevance Sort by last modified time
    Searched defs:kPointCount (Results 1 - 4 of 4) sorted by null

  /external/skia/src/pathops/
SkPathOpsConic.h 15 static const int kPointCount = 3;
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,
SkPathOpsQuad.h 22 static const int kPointCount = 3;
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,
SkPathOpsCubic.h 21 static const int kPointCount = 4;
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], const SkDPoint& a, const SkDPoint& d, double t1
    [all...]
  /external/skia/src/core/
SkGeometry.h 403 kPointCount = 1 + 2 * kQuadCount,
405 SkAutoSTMalloc<kPointCount, SkPoint> fStorage;

Completed in 39 milliseconds