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
137
138
139
140
141
142
143
144
145
146
147
148
149
|
/*
* Copyright (C) 2006 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "SkRect.h"
void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) {
// do nothing if the params are empty
if (left >= right || top >= bottom) {
return;
}
// if we are empty, just assign
if (fLeft >= fRight || fTop >= fBottom) {
this->set(left, top, right, bottom);
} else {
if (left < fLeft) fLeft = left;
if (top < fTop) fTop = top;
if (right > fRight) fRight = right;
if (bottom > fBottom) fBottom = bottom;
}
}
void SkIRect::sort() {
if (fLeft > fRight) {
SkTSwap<int32_t>(fLeft, fRight);
}
if (fTop > fBottom) {
SkTSwap<int32_t>(fTop, fBottom);
}
}
/////////////////////////////////////////////////////////////////////////////
bool SkRect::hasValidCoordinates() const {
return SkScalarIsFinite(fLeft) &&
SkScalarIsFinite(fTop) &&
SkScalarIsFinite(fRight) &&
SkScalarIsFinite(fBottom);
}
void SkRect::sort() {
if (fLeft > fRight) {
SkTSwap<SkScalar>(fLeft, fRight);
}
if (fTop > fBottom) {
SkTSwap<SkScalar>(fTop, fBottom);
}
}
void SkRect::toQuad(SkPoint quad[4]) const {
SkASSERT(quad);
quad[0].set(fLeft, fTop);
quad[1].set(fRight, fTop);
quad[2].set(fRight, fBottom);
quad[3].set(fLeft, fBottom);
}
void SkRect::set(const SkPoint pts[], int count) {
SkASSERT((pts && count > 0) || count == 0);
if (count <= 0) {
sk_bzero(this, sizeof(SkRect));
} else {
#ifdef SK_SCALAR_SLOW_COMPARES
int32_t l, t, r, b;
l = r = SkScalarAs2sCompliment(pts[0].fX);
t = b = SkScalarAs2sCompliment(pts[0].fY);
for (int i = 1; i < count; i++) {
int32_t x = SkScalarAs2sCompliment(pts[i].fX);
int32_t y = SkScalarAs2sCompliment(pts[i].fY);
if (x < l) l = x; else if (x > r) r = x;
if (y < t) t = y; else if (y > b) b = y;
}
this->set(Sk2sComplimentAsScalar(l),
Sk2sComplimentAsScalar(t),
Sk2sComplimentAsScalar(r),
Sk2sComplimentAsScalar(b));
#else
SkScalar l, t, r, b;
l = r = pts[0].fX;
t = b = pts[0].fY;
for (int i = 1; i < count; i++) {
SkScalar x = pts[i].fX;
SkScalar y = pts[i].fY;
if (x < l) l = x; else if (x > r) r = x;
if (y < t) t = y; else if (y > b) b = y;
}
this->set(l, t, r, b);
#endif
}
}
bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right,
SkScalar bottom) {
if (left < right && top < bottom && !this->isEmpty() && // check for empties
fLeft < right && left < fRight && fTop < bottom && top < fBottom)
{
if (fLeft < left) fLeft = left;
if (fTop < top) fTop = top;
if (fRight > right) fRight = right;
if (fBottom > bottom) fBottom = bottom;
return true;
}
return false;
}
bool SkRect::intersect(const SkRect& r) {
SkASSERT(&r);
return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom);
}
void SkRect::join(SkScalar left, SkScalar top, SkScalar right,
SkScalar bottom) {
// do nothing if the params are empty
if (left >= right || top >= bottom) {
return;
}
// if we are empty, just assign
if (fLeft >= fRight || fTop >= fBottom) {
this->set(left, top, right, bottom);
} else {
if (left < fLeft) fLeft = left;
if (top < fTop) fTop = top;
if (right > fRight) fRight = right;
if (bottom > fBottom) fBottom = bottom;
}
}
|
