Lines Matching refs:pts
31 bool cubicEndPoints(const SkDCubic& pts) {
33 cubicEndPoints(pts, 0, endIndex);
38 cubicEndPoints(pts, 0, ++endIndex);
44 cubicEndPoints(pts, 0, ++endIndex); // line
55 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) {
56 if (pts[0].fY > pts[endIndex].fY) {
65 if (pts[0].fY > pts[3].fY) {
71 void cubicEndPoints(const SkDCubic& pts, int s, int e) {
72 fA = pts[s].fY - pts[e].fY;
73 fB = pts[e].fX - pts[s].fX;
74 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY;
85 void lineEndPoints(const SkDLine& pts) {
86 fA = pts[0].fY - pts[1].fY;
87 fB = pts[1].fX - pts[0].fX;
88 fC = pts[0].fX * pts[1].fY - pts[1].fX * pts[0].fY;
91 bool quadEndPoints(const SkDQuad& pts) {
92 quadEndPoints(pts, 0, 1);
97 quadEndPoints(pts, 0, 2);
104 if (pts[0].fY > pts[2].fY) {
110 void quadEndPoints(const SkDQuad& pts, int s, int e) {
111 fA = pts[s].fY - pts[e].fY;
112 fB = pts[e].fX - pts[s].fX;
113 fC = pts[s].fX * pts[e].fY - pts[e].fX * pts[s].fY;
138 void cubicDistanceY(const SkDCubic& pts, SkDCubic& distance) const {
142 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC;
146 void quadDistanceY(const SkDQuad& pts, SkDQuad& distance) const {
150 distance[index].fY = fA * pts[index].fX + fB * pts[index].fY + fC;
154 double controlPtDistance(const SkDCubic& pts, int index) const {
156 return fA * pts[index].fX + fB * pts[index].fY + fC;
159 double controlPtDistance(const SkDQuad& pts) const {
160 return fA * pts[1].fX + fB * pts[1].fY + fC;
