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
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
/*
* 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.
*/
#ifndef LayoutRect_h
#define LayoutRect_h
#include "platform/geometry/IntRect.h"
#include "platform/geometry/LayoutBoxExtent.h"
#include "platform/geometry/LayoutPoint.h"
#include "wtf/Vector.h"
namespace WebCore {
class FloatRect;
class PLATFORM_EXPORT LayoutRect {
public:
LayoutRect() { }
LayoutRect(const LayoutPoint& location, const LayoutSize& size)
: m_location(location), m_size(size) { }
LayoutRect(LayoutUnit x, LayoutUnit y, LayoutUnit width, LayoutUnit height)
: m_location(LayoutPoint(x, y)), m_size(LayoutSize(width, height)) { }
LayoutRect(const FloatPoint& location, const FloatSize& size)
: m_location(location), m_size(size) { }
LayoutRect(const IntRect& rect) : m_location(rect.location()), m_size(rect.size()) { }
explicit LayoutRect(const FloatRect&); // don't do this implicitly since it's lossy
LayoutPoint location() const { return m_location; }
LayoutSize size() const { return m_size; }
IntPoint pixelSnappedLocation() const { return roundedIntPoint(m_location); }
IntSize pixelSnappedSize() const { return IntSize(snapSizeToPixel(m_size.width(), m_location.x()), snapSizeToPixel(m_size.height(), m_location.y())); }
void setLocation(const LayoutPoint& location) { m_location = location; }
void setSize(const LayoutSize& size) { m_size = size; }
LayoutUnit x() const { return m_location.x(); }
LayoutUnit y() const { return m_location.y(); }
LayoutUnit maxX() const { return x() + width(); }
LayoutUnit maxY() const { return y() + height(); }
LayoutUnit width() const { return m_size.width(); }
LayoutUnit height() const { return m_size.height(); }
int pixelSnappedX() const { return x().round(); }
int pixelSnappedY() const { return y().round(); }
int pixelSnappedWidth() const { return snapSizeToPixel(width(), x()); }
int pixelSnappedHeight() const { return snapSizeToPixel(height(), y()); }
int pixelSnappedMaxX() const { return (m_location.x() + m_size.width()).round(); }
int pixelSnappedMaxY() const { return (m_location.y() + m_size.height()).round(); }
void setX(LayoutUnit x) { m_location.setX(x); }
void setY(LayoutUnit y) { m_location.setY(y); }
void setWidth(LayoutUnit width) { m_size.setWidth(width); }
void setHeight(LayoutUnit height) { m_size.setHeight(height); }
bool isEmpty() const { return m_size.isEmpty(); }
// NOTE: The result is rounded to integer values, and thus may be not the exact
// center point.
LayoutPoint center() const { return LayoutPoint(x() + width() / 2, y() + height() / 2); }
void move(const LayoutSize& size) { m_location += size; }
void moveBy(const LayoutPoint& offset) { m_location.move(offset.x(), offset.y()); }
void move(LayoutUnit dx, LayoutUnit dy) { m_location.move(dx, dy); }
void expand(const LayoutSize& size) { m_size += size; }
void expand(const LayoutBoxExtent& box)
{
m_location.move(-box.left(), -box.top());
m_size.expand(box.left() + box.right(), box.top() + box.bottom());
}
void expand(LayoutUnit dw, LayoutUnit dh) { m_size.expand(dw, dh); }
void contract(const LayoutSize& size) { m_size -= size; }
void contract(const LayoutBoxExtent& box)
{
m_location.move(box.left(), box.top());
m_size.shrink(box.left() + box.right(), box.top() + box.bottom());
}
void contract(LayoutUnit dw, LayoutUnit dh) { m_size.expand(-dw, -dh); }
void shiftXEdgeTo(LayoutUnit edge)
{
LayoutUnit delta = edge - x();
setX(edge);
setWidth(std::max<LayoutUnit>(0, width() - delta));
}
void shiftMaxXEdgeTo(LayoutUnit edge)
{
LayoutUnit delta = edge - maxX();
setWidth(std::max<LayoutUnit>(0, width() + delta));
}
void shiftYEdgeTo(LayoutUnit edge)
{
LayoutUnit delta = edge - y();
setY(edge);
setHeight(std::max<LayoutUnit>(0, height() - delta));
}
void shiftMaxYEdgeTo(LayoutUnit edge)
{
LayoutUnit delta = edge - maxY();
setHeight(std::max<LayoutUnit>(0, height() + delta));
}
LayoutPoint minXMinYCorner() const { return m_location; } // typically topLeft
LayoutPoint maxXMinYCorner() const { return LayoutPoint(m_location.x() + m_size.width(), m_location.y()); } // typically topRight
LayoutPoint minXMaxYCorner() const { return LayoutPoint(m_location.x(), m_location.y() + m_size.height()); } // typically bottomLeft
LayoutPoint maxXMaxYCorner() const { return LayoutPoint(m_location.x() + m_size.width(), m_location.y() + m_size.height()); } // typically bottomRight
bool intersects(const LayoutRect&) const;
bool contains(const LayoutRect&) const;
// This checks to see if the rect contains x,y in the traditional sense.
// Equivalent to checking if the rect contains a 1x1 rect below and to the right of (px,py).
bool contains(LayoutUnit px, LayoutUnit py) const
{ return px >= x() && px < maxX() && py >= y() && py < maxY(); }
bool contains(const LayoutPoint& point) const { return contains(point.x(), point.y()); }
void intersect(const LayoutRect&);
void unite(const LayoutRect&);
void uniteIfNonZero(const LayoutRect&);
void inflateX(LayoutUnit dx)
{
m_location.setX(m_location.x() - dx);
m_size.setWidth(m_size.width() + dx + dx);
}
void inflateY(LayoutUnit dy)
{
m_location.setY(m_location.y() - dy);
m_size.setHeight(m_size.height() + dy + dy);
}
void inflate(LayoutUnit d) { inflateX(d); inflateY(d); }
void scale(float s);
void scale(float xAxisScale, float yAxisScale);
LayoutRect transposedRect() const { return LayoutRect(m_location.transposedPoint(), m_size.transposedSize()); }
static LayoutRect infiniteRect()
{
// Return a rect that is slightly smaller than the true max rect to allow pixelSnapping to round up to the nearest IntRect without overflowing.
return LayoutRect(LayoutUnit::nearlyMin() / 2, LayoutUnit::nearlyMin() / 2, LayoutUnit::nearlyMax(), LayoutUnit::nearlyMax());
}
private:
LayoutPoint m_location;
LayoutSize m_size;
};
inline LayoutRect intersection(const LayoutRect& a, const LayoutRect& b)
{
LayoutRect c = a;
c.intersect(b);
return c;
}
inline LayoutRect unionRect(const LayoutRect& a, const LayoutRect& b)
{
LayoutRect c = a;
c.unite(b);
return c;
}
PLATFORM_EXPORT LayoutRect unionRect(const Vector<LayoutRect>&);
inline bool operator==(const LayoutRect& a, const LayoutRect& b)
{
return a.location() == b.location() && a.size() == b.size();
}
inline bool operator!=(const LayoutRect& a, const LayoutRect& b)
{
return a.location() != b.location() || a.size() != b.size();
}
inline IntRect pixelSnappedIntRect(const LayoutRect& rect)
{
return IntRect(roundedIntPoint(rect.location()), IntSize(
snapSizeToPixel(rect.width(), rect.x()),
snapSizeToPixel(rect.height(), rect.y())));
}
PLATFORM_EXPORT IntRect enclosingIntRect(const LayoutRect&);
PLATFORM_EXPORT LayoutRect enclosingLayoutRect(const FloatRect&);
inline IntRect pixelSnappedIntRect(LayoutUnit left, LayoutUnit top, LayoutUnit width, LayoutUnit height)
{
return IntRect(left.round(), top.round(), snapSizeToPixel(width, left), snapSizeToPixel(height, top));
}
inline IntRect pixelSnappedIntRectFromEdges(LayoutUnit left, LayoutUnit top, LayoutUnit right, LayoutUnit bottom)
{
return IntRect(left.round(), top.round(), snapSizeToPixel(right - left, left), snapSizeToPixel(bottom - top, top));
}
inline IntRect pixelSnappedIntRect(LayoutPoint location, LayoutSize size)
{
return IntRect(roundedIntPoint(location), pixelSnappedIntSize(size, location));
}
} // namespace WebCore
#endif // LayoutRect_h
|
