Lines Matching full:const
15 static const int kPointCount = 3;
16 static const int kPointLast = kPointCount - 1;
17 static const int kMaxIntersections = 4;
22 bool collapsed() const {
26 bool controlsInside() const {
34 SkDConic flip() const {
41 const SkDConic& set(const SkPoint pts[kPointCount], SkScalar weight) {
47 const SkDPoint& operator[](int n) const { return fPts[n]; }
54 void align(int endIndex, SkDPoint* dstPt) const {
58 SkDVector dxdyAtT(double t) const;
59 static int FindExtrema(const double src[], SkScalar weight, double tValue[1]);
61 bool hullIntersects(const SkDQuad& quad, bool* isLinear) const {
65 bool hullIntersects(const SkDConic& conic, bool* isLinear) const {
69 bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const;
71 bool isLinear(int startIndex, int endIndex) const {
75 bool monotonicInX() const {
79 bool monotonicInY() const {
83 void otherPts(int oddMan, const SkDPoint* endPt[2]) const {
87 SkDPoint ptAtT(double t) const;
93 static int RootsValidT(const double A, const double B, const double C, double s[2]) {
97 SkDConic subDivide(double t1, double t2) const;
99 static SkDConic SubDivide(const SkPoint a[kPointCount], SkScalar weight, double t1, double t2) {
105 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2,
106 SkScalar* weight) const;
108 static SkDPoint SubDivide(const SkPoint pts[kPointCount], SkScalar weight,
109 const SkDPoint& a, const SkDPoint& c,
117 void dump() const;
118 void dumpID(int id) const;
119 void dumpInner() const;
