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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
|
/*
* Copyright (c) 2012, Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "third_party/blink/renderer/platform/geometry/layout_rect.h"
#include <stdio.h>
#include <algorithm>
#include "third_party/blink/renderer/platform/geometry/double_rect.h"
#include "third_party/blink/renderer/platform/geometry/float_rect.h"
#include "third_party/blink/renderer/platform/layout_unit.h"
#include "third_party/blink/renderer/platform/wtf/text/text_stream.h"
#include "third_party/blink/renderer/platform/wtf/text/wtf_string.h"
namespace blink {
LayoutRect::LayoutRect(const FloatRect& r)
: location_(LayoutPoint(r.Location())), size_(LayoutSize(r.Size())) {}
LayoutRect::LayoutRect(const DoubleRect& r)
: location_(LayoutPoint(r.Location())), size_(LayoutSize(r.Size())) {}
bool LayoutRect::Intersects(const LayoutRect& other) const {
// Checking emptiness handles negative widths as well as zero.
return !IsEmpty() && !other.IsEmpty() && X() < other.MaxX() &&
other.X() < MaxX() && Y() < other.MaxY() && other.Y() < MaxY();
}
bool LayoutRect::Contains(const LayoutRect& other) const {
return X() <= other.X() && MaxX() >= other.MaxX() && Y() <= other.Y() &&
MaxY() >= other.MaxY();
}
void LayoutRect::Intersect(const LayoutRect& other) {
LayoutPoint new_location(std::max(X(), other.X()), std::max(Y(), other.Y()));
LayoutPoint new_max_point(std::min(MaxX(), other.MaxX()),
std::min(MaxY(), other.MaxY()));
// Return a clean empty rectangle for non-intersecting cases.
if (new_location.X() >= new_max_point.X() ||
new_location.Y() >= new_max_point.Y()) {
new_location = LayoutPoint();
new_max_point = LayoutPoint();
}
location_ = new_location;
size_ = new_max_point - new_location;
}
bool LayoutRect::InclusiveIntersect(const LayoutRect& other) {
LayoutPoint new_location(std::max(X(), other.X()), std::max(Y(), other.Y()));
LayoutPoint new_max_point(std::min(MaxX(), other.MaxX()),
std::min(MaxY(), other.MaxY()));
if (new_location.X() > new_max_point.X() ||
new_location.Y() > new_max_point.Y()) {
*this = LayoutRect();
return false;
}
location_ = new_location;
size_ = new_max_point - new_location;
return true;
}
bool LayoutRect::IntersectsInclusively(const LayoutRect& other) {
// TODO(pdr): How should negative widths or heights be handled?
return X() <= other.MaxX() && other.X() <= MaxX() && Y() <= other.MaxY() &&
other.Y() <= MaxY();
}
void LayoutRect::Unite(const LayoutRect& other) {
// Handle empty special cases first.
if (other.IsEmpty())
return;
if (IsEmpty()) {
*this = other;
return;
}
UniteEvenIfEmpty(other);
}
void LayoutRect::UniteIfNonZero(const LayoutRect& other) {
// Handle empty special cases first.
if (!other.Width() && !other.Height())
return;
if (!Width() && !Height()) {
*this = other;
return;
}
UniteEvenIfEmpty(other);
}
void LayoutRect::UniteEvenIfEmpty(const LayoutRect& other) {
LayoutPoint new_location(std::min(X(), other.X()), std::min(Y(), other.Y()));
LayoutPoint new_max_point(std::max(MaxX(), other.MaxX()),
std::max(MaxY(), other.MaxY()));
location_ = new_location;
size_ = new_max_point - new_location;
}
void LayoutRect::Scale(float s) {
location_.Scale(s, s);
size_.Scale(s);
}
void LayoutRect::Scale(float x_axis_scale, float y_axis_scale) {
location_.Scale(x_axis_scale, y_axis_scale);
size_.Scale(x_axis_scale, y_axis_scale);
}
LayoutRect UnionRect(const Vector<LayoutRect>& rects) {
LayoutRect result;
size_t count = rects.size();
for (size_t i = 0; i < count; ++i)
result.Unite(rects[i]);
return result;
}
LayoutRect UnionRectEvenIfEmpty(const Vector<LayoutRect>& rects) {
size_t count = rects.size();
if (!count)
return LayoutRect();
LayoutRect result = rects[0];
for (size_t i = 1; i < count; ++i)
result.UniteEvenIfEmpty(rects[i]);
return result;
}
LayoutRect EnclosingLayoutRect(const FloatRect& rect) {
LayoutPoint location = FlooredLayoutPoint(rect.MinXMinYCorner());
LayoutPoint max_point = CeiledLayoutPoint(rect.MaxXMaxYCorner());
return LayoutRect(location, max_point - location);
}
std::ostream& operator<<(std::ostream& ostream, const LayoutRect& rect) {
return ostream << rect.ToString();
}
String LayoutRect::ToString() const {
return String::Format("%s %s", Location().ToString().Ascii().data(),
Size().ToString().Ascii().data());
}
WTF::TextStream& operator<<(WTF::TextStream& ts, const LayoutRect& rect) {
return ts << FloatRect(rect);
}
} // namespace blink
|
