HomeSort by relevance Sort by last modified time
    Searched refs:SkDPoint (Results 1 - 25 of 80) sorted by null

1 2 3 4

  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsTriangle.h 14 SkDPoint fPts[3];
16 bool contains(const SkDPoint& pt) const;
SkPathOpsPoint.cpp 9 SkDVector operator-(const SkDPoint& a, const SkDPoint& b) {
14 SkDPoint operator+(const SkDPoint& a, const SkDVector& b) {
15 SkDPoint v = {a.fX + b.fX, a.fY + b.fY};
SkPathOpsLine.h 13 SkDPoint fPts[2];
15 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 2); return fPts[n]; }
16 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 2); return fPts[n]; }
29 double exactPoint(const SkDPoint& xy) const;
30 static double ExactPointH(const SkDPoint& xy, double left, double right, double y);
31 static double ExactPointV(const SkDPoint& xy, double top, double bottom, double x);
32 double isLeft(const SkDPoint& pt) const;
33 double nearPoint(const SkDPoint& xy) const;
34 bool nearRay(const SkDPoint& xy) const;
35 static double NearPointH(const SkDPoint& xy, double left, double right, double y)
    [all...]
SkPathOpsQuad.h 16 SkDPoint pts[5];
20 SkDPoint fPts[3];
33 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 3); return fPts[n]; }
34 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 3); return fPts[n]; }
37 void align(int endIndex, SkDPoint* dstPt) const;
43 double nearestT(const SkDPoint&) const;
44 bool pointInHull(const SkDPoint&) const;
45 SkDPoint ptAtT(double t) const;
55 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const
    [all...]
SkPathOpsCubic.h 18 SkDPoint pts[7];
22 SkDPoint fPts[4];
33 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 4); return fPts[n]; }
34 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 4); return fPts[n]; }
36 void align(int endIndex, int ctrlIndex, SkDPoint* dstPt) const;
56 SkDPoint ptAtT(double t) const;
68 void subDivide(const SkDPoint& a, const SkDPoint& d, double t1, double t2, SkDPoint p[2]) const;
70 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1
    [all...]
SkPathOpsPoint.h 20 friend SkDPoint operator+(const SkDPoint& a, const SkDVector& b);
64 struct SkDPoint {
73 friend SkDVector operator-(const SkDPoint& a, const SkDPoint& b);
75 friend bool operator==(const SkDPoint& a, const SkDPoint& b) {
79 friend bool operator!=(const SkDPoint& a, const SkDPoint& b) {
102 bool approximatelyEqual(const SkDPoint& a) const
    [all...]
SkIntersectionHelper.h 80 bool isPartial(double t1, double t2, const SkDPoint& pt1, const SkDPoint& pt2) const {
83 SkDPoint midPtByT = segment.dPtAtT(mid);
84 SkDPoint midPtByAvg = SkDPoint::Mid(pt1, pt2);
146 SkDPoint::dump(pts()[0]);
147 SkDPoint::dump(pts()[1]);
149 SkDPoint::dump(pts()[2]);
152 SkDPoint::dump(pts()[3]);
SkPathOpsLine.cpp 38 double SkDLine::isLeft(const SkDPoint& pt) const {
44 SkDPoint SkDLine::ptAtT(double t) const {
52 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY };
56 double SkDLine::exactPoint(const SkDPoint& xy) const {
66 double SkDLine::nearPoint(const SkDPoint& xy) const {
80 SkDPoint realPt = ptAtT(t);
94 bool SkDLine::nearRay(const SkDPoint& xy) const {
101 SkDPoint realPt = ptAtT(t);
116 SkDPoint pt = {x2, y2};
123 double SkDLine::ExactPointH(const SkDPoint& xy, double left, double right, double y)
    [all...]
SkPathOpsRect.h 15 void add(const SkDPoint& pt) {
30 bool contains(const SkDPoint& pt) const {
43 void set(const SkDPoint& pt) {
SkPathOpsCurve.h 14 static SkDPoint dline_xy_at_t(const SkPoint a[2], double t) {
20 static SkDPoint dquad_xy_at_t(const SkPoint a[3], double t) {
26 static SkDPoint dcubic_xy_at_t(const SkPoint a[4], double t) {
32 static SkDPoint (* const CurveDPointAtT[])(const SkPoint[], double ) = {
105 SkDPoint topPt = quad.top(startT, endT);
112 SkDPoint topPt = cubic.top(startT, endT);
126 SkDPoint dst[2] = { line.ptAtT(startT), line.ptAtT(endT) };
  /external/skia/src/pathops/
SkPathOpsTriangle.h 14 SkDPoint fPts[3];
16 bool contains(const SkDPoint& pt) const;
SkPathOpsPoint.cpp 9 SkDVector operator-(const SkDPoint& a, const SkDPoint& b) {
14 SkDPoint operator+(const SkDPoint& a, const SkDVector& b) {
15 SkDPoint v = {a.fX + b.fX, a.fY + b.fY};
SkPathOpsLine.h 13 SkDPoint fPts[2];
15 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 2); return fPts[n]; }
16 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 2); return fPts[n]; }
29 double exactPoint(const SkDPoint& xy) const;
30 static double ExactPointH(const SkDPoint& xy, double left, double right, double y);
31 static double ExactPointV(const SkDPoint& xy, double top, double bottom, double x);
32 double isLeft(const SkDPoint& pt) const;
33 double nearPoint(const SkDPoint& xy) const;
34 bool nearRay(const SkDPoint& xy) const;
35 static double NearPointH(const SkDPoint& xy, double left, double right, double y)
    [all...]
SkPathOpsQuad.h 16 SkDPoint pts[5];
20 SkDPoint fPts[3];
33 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 3); return fPts[n]; }
34 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 3); return fPts[n]; }
37 void align(int endIndex, SkDPoint* dstPt) const;
43 double nearestT(const SkDPoint&) const;
44 bool pointInHull(const SkDPoint&) const;
45 SkDPoint ptAtT(double t) const;
55 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const
    [all...]
SkPathOpsCubic.h 18 SkDPoint pts[7];
22 SkDPoint fPts[4];
33 const SkDPoint& operator[](int n) const { SkASSERT(n >= 0 && n < 4); return fPts[n]; }
34 SkDPoint& operator[](int n) { SkASSERT(n >= 0 && n < 4); return fPts[n]; }
36 void align(int endIndex, int ctrlIndex, SkDPoint* dstPt) const;
56 SkDPoint ptAtT(double t) const;
68 void subDivide(const SkDPoint& a, const SkDPoint& d, double t1, double t2, SkDPoint p[2]) const;
70 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1
    [all...]
SkPathOpsPoint.h 20 friend SkDPoint operator+(const SkDPoint& a, const SkDVector& b);
64 struct SkDPoint {
73 friend SkDVector operator-(const SkDPoint& a, const SkDPoint& b);
75 friend bool operator==(const SkDPoint& a, const SkDPoint& b) {
79 friend bool operator!=(const SkDPoint& a, const SkDPoint& b) {
102 bool approximatelyEqual(const SkDPoint& a) const
    [all...]
SkIntersectionHelper.h 80 bool isPartial(double t1, double t2, const SkDPoint& pt1, const SkDPoint& pt2) const {
83 SkDPoint midPtByT = segment.dPtAtT(mid);
84 SkDPoint midPtByAvg = SkDPoint::Mid(pt1, pt2);
146 SkDPoint::dump(pts()[0]);
147 SkDPoint::dump(pts()[1]);
149 SkDPoint::dump(pts()[2]);
152 SkDPoint::dump(pts()[3]);
SkPathOpsLine.cpp 38 double SkDLine::isLeft(const SkDPoint& pt) const {
44 SkDPoint SkDLine::ptAtT(double t) const {
52 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY };
56 double SkDLine::exactPoint(const SkDPoint& xy) const {
66 double SkDLine::nearPoint(const SkDPoint& xy) const {
80 SkDPoint realPt = ptAtT(t);
94 bool SkDLine::nearRay(const SkDPoint& xy) const {
101 SkDPoint realPt = ptAtT(t);
116 SkDPoint pt = {x2, y2};
123 double SkDLine::ExactPointH(const SkDPoint& xy, double left, double right, double y)
    [all...]
SkPathOpsRect.h 15 void add(const SkDPoint& pt) {
30 bool contains(const SkDPoint& pt) const {
43 void set(const SkDPoint& pt) {
SkPathOpsCurve.h 14 static SkDPoint dline_xy_at_t(const SkPoint a[2], double t) {
20 static SkDPoint dquad_xy_at_t(const SkPoint a[3], double t) {
26 static SkDPoint dcubic_xy_at_t(const SkPoint a[4], double t) {
32 static SkDPoint (* const CurveDPointAtT[])(const SkPoint[], double ) = {
105 SkDPoint topPt = quad.top(startT, endT);
112 SkDPoint topPt = cubic.top(startT, endT);
126 SkDPoint dst[2] = { line.ptAtT(startT), line.ptAtT(endT) };
  /external/skia/tests/
PathOpsDQuadTest.cpp 21 static const SkDPoint inPoint[]= {
29 static const SkDPoint outPoint[]= {
PathOpsTestCommon.h 19 bool ValidPoint(const SkDPoint& pt);
PathOpsDLineTest.cpp 20 static const SkDPoint left[] = {
39 const SkDPoint& pt = left[index];
50 SkDPoint mid = line.ptAtT(.5);
PathOpsDPointTest.cpp 11 static const SkDPoint tests[] = {
25 const SkDPoint& pt = tests[index];
27 SkDPoint p = pt;
PathOpsCubicLineIntersectionTest.cpp 67 SkDPoint xy1 = cubic.ptAtT(tt1);
69 SkDPoint xy2 = line.ptAtT(tt2);
97 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1);
98 SkDPoint sect = cubic.ptAtT(cubicT);
103 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007);
105 SkDPoint nextL = line.ptAtT(i[1][0] + 0.0000007);

Completed in 332 milliseconds

1 2 3 4