blob: a762ae5828403a5d0be59af72195876e43b730eb (
plain)
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
|
/*
Copyright (C) 2005, 2006 Apple Inc. All rights reserved.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
Some useful definitions needed for laying out elements
*/
#ifndef GapRects_h
#define GapRects_h
#include "IntRect.h"
namespace WebCore {
struct GapRects {
const IntRect& left() const { return m_left; }
const IntRect& center() const { return m_center; }
const IntRect& right() const { return m_right; }
void uniteLeft(const IntRect& r) { m_left.unite(r); }
void uniteCenter(const IntRect& r) { m_center.unite(r); }
void uniteRight(const IntRect& r) { m_right.unite(r); }
void unite(const GapRects& o) { uniteLeft(o.left()); uniteCenter(o.center()); uniteRight(o.right()); }
operator IntRect() const
{
IntRect result = m_left;
result.unite(m_center);
result.unite(m_right);
return result;
}
bool operator==(const GapRects& other)
{
return m_left == other.left() && m_center == other.center() && m_right == other.right();
}
bool operator!=(const GapRects& other) { return !(*this == other); }
private:
IntRect m_left;
IntRect m_center;
IntRect m_right;
};
} // namespace WebCore
#endif // GapRects_h
|
