Flutter Engine
The Flutter Engine
Loading...
Searching...
No Matches
Public Member Functions | Static Public Member Functions | Public Attributes | List of all members
SkDLine Struct Reference

#include <SkPathOpsLine.h>

Public Member Functions

const SkDPointoperator[] (int n) const
 
SkDPointoperator[] (int n)
 
const SkDLineset (const SkPoint pts[2])
 
double exactPoint (const SkDPoint &xy) const
 
double nearPoint (const SkDPoint &xy, bool *unequal) const
 
bool nearRay (const SkDPoint &xy) const
 
SkDPoint ptAtT (double t) const
 
void dump () const
 
void dumpID (int) const
 
void dumpInner () const
 

Static Public Member Functions

static double ExactPointH (const SkDPoint &xy, double left, double right, double y)
 
static double ExactPointV (const SkDPoint &xy, double top, double bottom, double x)
 
static double NearPointH (const SkDPoint &xy, double left, double right, double y)
 
static double NearPointV (const SkDPoint &xy, double top, double bottom, double x)
 

Public Attributes

SkDPoint fPts [2]
 

Detailed Description

Definition at line 14 of file SkPathOpsLine.h.

Member Function Documentation

◆ dump()

void SkDLine::dump ( ) const

Definition at line 163 of file PathOpsDebug.cpp.

163 {
164 this->dumpInner();
165 SkDebugf("}},\n");
166}
void SK_SPI SkDebugf(const char format[],...) SK_PRINTF_LIKE(1
void dumpInner() const

◆ dumpID()

void SkDLine::dumpID ( int  id) const

Definition at line 168 of file PathOpsDebug.cpp.

168 {
169 this->dumpInner();
170 SkDebugf("}");
171 DumpID(id);
172}
void DumpID(const SkDConic &, int id)

◆ dumpInner()

void SkDLine::dumpInner ( ) const

Definition at line 174 of file PathOpsDebug.cpp.

174 {
175 SkDebugf("{{");
176 fPts[0].dump();
177 SkDebugf(", ");
178 fPts[1].dump();
179}
SkDPoint fPts[2]
void dump() const

◆ exactPoint()

double SkDLine::exactPoint ( const SkDPoint xy) const

Definition at line 26 of file SkPathOpsLine.cpp.

26 {
27 if (xy == fPts[0]) { // do cheapest test first
28 return 0;
29 }
30 if (xy == fPts[1]) {
31 return 1;
32 }
33 return -1;
34}

◆ ExactPointH()

double SkDLine::ExactPointH ( const SkDPoint xy,
double  left,
double  right,
double  y 
)
static

Definition at line 86 of file SkPathOpsLine.cpp.

86 {
87 if (xy.fY == y) {
88 if (xy.fX == left) {
89 return 0;
90 }
91 if (xy.fX == right) {
92 return 1;
93 }
94 }
95 return -1;
96}
static bool left(const SkPoint &p0, const SkPoint &p1)
static bool right(const SkPoint &p0, const SkPoint &p1)
double y

◆ ExactPointV()

double SkDLine::ExactPointV ( const SkDPoint xy,
double  top,
double  bottom,
double  x 
)
static

Definition at line 121 of file SkPathOpsLine.cpp.

121 {
122 if (xy.fX == x) {
123 if (xy.fY == top) {
124 return 0;
125 }
126 if (xy.fY == bottom) {
127 return 1;
128 }
129 }
130 return -1;
131}
double x

◆ nearPoint()

double SkDLine::nearPoint ( const SkDPoint xy,
bool *  unequal 
) const

Definition at line 36 of file SkPathOpsLine.cpp.

36 {
37 if (!AlmostBetweenUlps(fPts[0].fX, xy.fX, fPts[1].fX)
38 || !AlmostBetweenUlps(fPts[0].fY, xy.fY, fPts[1].fY)) {
39 return -1;
40 }
41 // project a perpendicular ray from the point to the line; find the T on the line
42 SkDVector len = fPts[1] - fPts[0]; // the x/y magnitudes of the line
43 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay
44 SkDVector ab0 = xy - fPts[0];
45 double numer = len.fX * ab0.fX + ab0.fY * len.fY;
46 if (!between(0, numer, denom)) {
47 return -1;
48 }
49 if (!denom) {
50 return 0;
51 }
52 double t = numer / denom;
53 SkDPoint realPt = ptAtT(t);
54 double dist = realPt.distance(xy); // OPTIMIZATION: can we compare against distSq instead ?
55 // find the ordinal in the original line with the largest unsigned exponent
56 double tiniest = std::min(std::min(std::min(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY);
57 double largest = std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY);
58 largest = std::max(largest, -tiniest);
59 if (!AlmostEqualUlps_Pin(largest, largest + dist)) { // is the dist within ULPS tolerance?
60 return -1;
61 }
62 if (unequal) {
63 *unequal = (float) largest != (float) (largest + dist);
64 }
65 t = SkPinT(t); // a looser pin breaks skpwww_lptemp_com_3
66 SkASSERT(between(0, t, 1));
67 return t;
68}
#define SkASSERT(cond)
Definition SkAssert.h:116
static bool between(SkScalar a, SkScalar b, SkScalar c)
bool AlmostEqualUlps_Pin(float a, float b)
bool AlmostBetweenUlps(float a, float b, float c)
double SkPinT(double t)
SkDPoint ptAtT(double t) const
double distance(const SkDPoint &a) const

◆ NearPointH()

double SkDLine::NearPointH ( const SkDPoint xy,
double  left,
double  right,
double  y 
)
static

Definition at line 98 of file SkPathOpsLine.cpp.

98 {
99 if (!AlmostBequalUlps(xy.fY, y)) {
100 return -1;
101 }
102 if (!AlmostBetweenUlps(left, xy.fX, right)) {
103 return -1;
104 }
105 double t = (xy.fX - left) / (right - left);
106 t = SkPinT(t);
107 SkASSERT(between(0, t, 1));
108 double realPtX = (1 - t) * left + t * right;
109 SkDVector distU = {xy.fY - y, xy.fX - realPtX};
110 double distSq = distU.fX * distU.fX + distU.fY * distU.fY;
111 double dist = sqrt(distSq); // OPTIMIZATION: can we compare against distSq instead ?
112 double tiniest = std::min(std::min(y, left), right);
113 double largest = std::max(std::max(y, left), right);
114 largest = std::max(largest, -tiniest);
115 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
116 return -1;
117 }
118 return t;
119}
bool AlmostEqualUlps(const SkPoint &pt1, const SkPoint &pt2)
bool AlmostBequalUlps(float a, float b)
SIN Vec< N, float > sqrt(const Vec< N, float > &x)
Definition SkVx.h:706

◆ NearPointV()

double SkDLine::NearPointV ( const SkDPoint xy,
double  top,
double  bottom,
double  x 
)
static

Definition at line 133 of file SkPathOpsLine.cpp.

133 {
134 if (!AlmostBequalUlps(xy.fX, x)) {
135 return -1;
136 }
137 if (!AlmostBetweenUlps(top, xy.fY, bottom)) {
138 return -1;
139 }
140 double t = (xy.fY - top) / (bottom - top);
141 t = SkPinT(t);
142 SkASSERT(between(0, t, 1));
143 double realPtY = (1 - t) * top + t * bottom;
144 SkDVector distU = {xy.fX - x, xy.fY - realPtY};
145 double distSq = distU.fX * distU.fX + distU.fY * distU.fY;
146 double dist = sqrt(distSq); // OPTIMIZATION: can we compare against distSq instead ?
147 double tiniest = std::min(std::min(x, top), bottom);
148 double largest = std::max(std::max(x, top), bottom);
149 largest = std::max(largest, -tiniest);
150 if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
151 return -1;
152 }
153 return t;
154}

◆ nearRay()

bool SkDLine::nearRay ( const SkDPoint xy) const

Definition at line 70 of file SkPathOpsLine.cpp.

70 {
71 // project a perpendicular ray from the point to the line; find the T on the line
72 SkDVector len = fPts[1] - fPts[0]; // the x/y magnitudes of the line
73 double denom = len.fX * len.fX + len.fY * len.fY; // see DLine intersectRay
74 SkDVector ab0 = xy - fPts[0];
75 double numer = len.fX * ab0.fX + ab0.fY * len.fY;
76 double t = numer / denom;
77 SkDPoint realPt = ptAtT(t);
78 double dist = realPt.distance(xy); // OPTIMIZATION: can we compare against distSq instead ?
79 // find the ordinal in the original line with the largest unsigned exponent
80 double tiniest = std::min(std::min(std::min(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY);
81 double largest = std::max(std::max(std::max(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY);
82 largest = std::max(largest, -tiniest);
83 return RoughlyEqualUlps(largest, largest + dist); // is the dist within ULPS tolerance?
84}
bool RoughlyEqualUlps(float a, float b)

◆ operator[]() [1/2]

SkDPoint & SkDLine::operator[] ( int  n)
inline

Definition at line 18 of file SkPathOpsLine.h.

18{ SkASSERT(n >= 0 && n < 2); return fPts[n]; }

◆ operator[]() [2/2]

const SkDPoint & SkDLine::operator[] ( int  n) const
inline

Definition at line 17 of file SkPathOpsLine.h.

17{ SkASSERT(n >= 0 && n < 2); return fPts[n]; }

◆ ptAtT()

SkDPoint SkDLine::ptAtT ( double  t) const

Definition at line 14 of file SkPathOpsLine.cpp.

14 {
15 if (0 == t) {
16 return fPts[0];
17 }
18 if (1 == t) {
19 return fPts[1];
20 }
21 double one_t = 1 - t;
22 SkDPoint result = { one_t * fPts[0].fX + t * fPts[1].fX, one_t * fPts[0].fY + t * fPts[1].fY };
23 return result;
24}
GAsyncResult * result

◆ set()

const SkDLine & SkDLine::set ( const SkPoint  pts[2])
inline

Definition at line 20 of file SkPathOpsLine.h.

20 {
21 fPts[0] = pts[0];
22 fPts[1] = pts[1];
23 return *this;
24 }

Member Data Documentation

◆ fPts

SkDPoint SkDLine::fPts[2]

Definition at line 15 of file SkPathOpsLine.h.


The documentation for this struct was generated from the following files: