1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
/*
* Copyright 2006 The Android Open Source Project
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef SkPointPriv_DEFINED
#define SkPointPriv_DEFINED
#include "SkPoint.h"
#include "SkRect.h"
class SkPointPriv {
public:
enum Side {
kLeft_Side = -1,
kOn_Side = 0,
kRight_Side = 1,
};
static bool AreFinite(const SkPoint array[], int count) {
return SkScalarsAreFinite(&array[0].fX, count << 1);
}
static const SkScalar* AsScalars(const SkPoint& pt) { return &pt.fX; }
static bool CanNormalize(SkScalar dx, SkScalar dy) {
// Simple enough (and performance critical sometimes) so we inline it.
return (dx*dx + dy*dy) > (SK_ScalarNearlyZero * SK_ScalarNearlyZero);
}
static SkScalar DistanceToLineBetweenSqd(const SkPoint& pt, const SkPoint& a,
const SkPoint& b, Side* side = nullptr);
static SkScalar DistanceToLineBetween(const SkPoint& pt, const SkPoint& a,
const SkPoint& b, Side* side = nullptr) {
return SkScalarSqrt(DistanceToLineBetweenSqd(pt, a, b, side));
}
static SkScalar DistanceToLineSegmentBetweenSqd(const SkPoint& pt, const SkPoint& a,
const SkPoint& b);
static SkScalar DistanceToLineSegmentBetween(const SkPoint& pt, const SkPoint& a,
const SkPoint& b) {
return SkScalarSqrt(DistanceToLineSegmentBetweenSqd(pt, a, b));
}
static SkScalar DistanceToSqd(const SkPoint& pt, const SkPoint& a) {
SkScalar dx = pt.fX - a.fX;
SkScalar dy = pt.fY - a.fY;
return dx * dx + dy * dy;
}
static bool EqualsWithinTolerance(const SkPoint& p1, const SkPoint& p2) {
return !CanNormalize(p1.fX - p2.fX, p1.fY - p2.fY);
}
static bool EqualsWithinTolerance(const SkPoint& pt, const SkPoint& p, SkScalar tol) {
return SkScalarNearlyZero(pt.fX - p.fX, tol)
&& SkScalarNearlyZero(pt.fY - p.fY, tol);
}
static SkScalar LengthSqd(const SkPoint& pt) {
return SkPoint::DotProduct(pt, pt);
}
static void Negate(SkIPoint& pt) {
pt.fX = -pt.fX;
pt.fY = -pt.fY;
}
static void RotateCCW(const SkPoint& src, SkPoint* dst) {
// use a tmp in case src == dst
SkScalar tmp = src.fX;
dst->fX = src.fY;
dst->fY = -tmp;
}
static void RotateCCW(SkPoint* pt) {
RotateCCW(*pt, pt);
}
static void RotateCW(const SkPoint& src, SkPoint* dst) {
// use a tmp in case src == dst
SkScalar tmp = src.fX;
dst->fX = -src.fY;
dst->fY = tmp;
}
static void RotateCW(SkPoint* pt) {
RotateCW(*pt, pt);
}
static bool SetLengthFast(SkPoint* pt, float length);
static void SetOrthog(SkPoint* pt, const SkPoint& vec, Side side = kLeft_Side) {
// vec could be this
SkScalar tmp = vec.fX;
if (kRight_Side == side) {
pt->fX = -vec.fY;
pt->fY = tmp;
} else {
SkASSERT(kLeft_Side == side);
pt->fX = vec.fY;
pt->fY = -tmp;
}
}
// counter-clockwise fan
static void SetRectFan(SkPoint v[], SkScalar l, SkScalar t, SkScalar r, SkScalar b,
size_t stride) {
SkASSERT(stride >= sizeof(SkPoint));
((SkPoint*)((intptr_t)v + 0 * stride))->set(l, t);
((SkPoint*)((intptr_t)v + 1 * stride))->set(l, b);
((SkPoint*)((intptr_t)v + 2 * stride))->set(r, b);
((SkPoint*)((intptr_t)v + 3 * stride))->set(r, t);
}
// tri strip with two counter-clockwise triangles
static void SetRectTriStrip(SkPoint v[], SkScalar l, SkScalar t, SkScalar r, SkScalar b,
size_t stride) {
SkASSERT(stride >= sizeof(SkPoint));
((SkPoint*)((intptr_t)v + 0 * stride))->set(l, t);
((SkPoint*)((intptr_t)v + 1 * stride))->set(l, b);
((SkPoint*)((intptr_t)v + 2 * stride))->set(r, t);
((SkPoint*)((intptr_t)v + 3 * stride))->set(r, b);
}
static void SetRectTriStrip(SkPoint v[], const SkRect& rect, size_t stride) {
SetRectTriStrip(v, rect.fLeft, rect.fTop, rect.fRight, rect.fBottom, stride);
}
};
#endif
|
