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
150
151
152
153
154
155
156
157
158
159
160
|
/*
* Copyright (C) 2010 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.
*/
#ifndef ANDROID_UI_RECT_H
#define ANDROID_UI_RECT_H
#include <utils/Log.h>
namespace android {
namespace uirenderer {
///////////////////////////////////////////////////////////////////////////////
// Structs
///////////////////////////////////////////////////////////////////////////////
struct Rect {
float left;
float top;
float right;
float bottom;
Rect():
left(0),
top(0),
right(0),
bottom(0) {
}
Rect(float left, float top, float right, float bottom):
left(left),
top(top),
right(right),
bottom(bottom) {
}
Rect(const Rect& r) {
set(r);
}
Rect(Rect& r) {
set(r);
}
Rect& operator=(const Rect& r) {
set(r);
return *this;
}
Rect& operator=(Rect& r) {
set(r);
return *this;
}
friend int operator==(const Rect& a, const Rect& b) {
return !memcmp(&a, &b, sizeof(a));
}
friend int operator!=(const Rect& a, const Rect& b) {
return memcmp(&a, &b, sizeof(a));
}
bool isEmpty() const {
return left >= right || top >= bottom;
}
void setEmpty() {
memset(this, 0, sizeof(*this));
}
void set(float left, float top, float right, float bottom) {
this->left = left;
this->right = right;
this->top = top;
this->bottom = bottom;
}
void set(const Rect& r) {
set(r.left, r.top, r.right, r.bottom);
}
inline float getWidth() const {
return right - left;
}
inline float getHeight() const {
return bottom - top;
}
bool intersects(float left, float top, float right, float bottom) const {
return left < right && top < bottom &&
this->left < this->right && this->top < this->bottom &&
this->left < right && left < this->right &&
this->top < bottom && top < this->bottom;
}
bool intersects(const Rect& r) const {
return intersects(r.left, r.top, r.right, r.bottom);
}
bool intersect(float left, float top, float right, float bottom) {
if (left < right && top < bottom && !this->isEmpty() &&
this->left < right && left < this->right &&
this->top < bottom && top < this->bottom) {
if (this->left < left) this->left = left;
if (this->top < top) this->top = top;
if (this->right > right) this->right = right;
if (this->bottom > bottom) this->bottom = bottom;
return true;
}
return false;
}
bool intersect(const Rect& r) {
return intersect(r.left, r.top, r.right, r.bottom);
}
bool unionWith(const Rect& r) {
if (r.left < r.right && r.top < r.bottom) {
if (left < right && top < bottom) {
if (left > r.left) left = r.left;
if (top > r.top) top = r.top;
if (right < r.right) right = r.right;
if (bottom < r.bottom) bottom = r.bottom;
return true;
} else {
left = r.left;
top = r.top;
right = r.right;
bottom = r.bottom;
return true;
}
}
return false;
}
void dump() const {
LOGD("Rect[l=%f t=%f r=%f b=%f]", left, top, right, bottom);
}
}; // struct Rect
}; // namespace uirenderer
}; // namespace android
#endif // ANDROID_RECT_H
|
