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
|
/*
* Copyright (C) 2003, 2006, 2009 Apple Inc. All rights reserved.
* Copyright (C) 2010 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:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
*
* THIS SOFTWARE IS PROVIDED BY APPLE AND ITS 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 APPLE OR ITS 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 "config.h"
#include "RoundedIntRect.h"
#include "IntRect.h"
#include <algorithm>
using namespace std;
namespace WebCore {
bool RoundedIntRect::Radii::isZero() const
{
return m_topLeft.isZero() && m_topRight.isZero() && m_bottomLeft.isZero() && m_bottomRight.isZero();
}
void RoundedIntRect::Radii::scale(float factor)
{
if (factor == 1)
return;
// If either radius on a corner becomes zero, reset both radii on that corner.
m_topLeft.scale(factor);
if (!m_topLeft.width() || !m_topLeft.height())
m_topLeft = IntSize();
m_topRight.scale(factor);
if (!m_topRight.width() || !m_topRight.height())
m_topRight = IntSize();
m_bottomLeft.scale(factor);
if (!m_bottomLeft.width() || !m_bottomLeft.height())
m_bottomLeft = IntSize();
m_bottomRight.scale(factor);
if (!m_bottomRight.width() || !m_bottomRight.height())
m_bottomRight = IntSize();
}
void RoundedIntRect::Radii::expand(int topWidth, int bottomWidth, int leftWidth, int rightWidth)
{
m_topLeft.setWidth(max(0, m_topLeft.width() + leftWidth));
m_topLeft.setHeight(max(0, m_topLeft.height() + topWidth));
m_topRight.setWidth(max(0, m_topRight.width() + rightWidth));
m_topRight.setHeight(max(0, m_topRight.height() + topWidth));
m_bottomLeft.setWidth(max(0, m_bottomLeft.width() + leftWidth));
m_bottomLeft.setHeight(max(0, m_bottomLeft.height() + bottomWidth));
m_bottomRight.setWidth(max(0, m_bottomRight.width() + rightWidth));
m_bottomRight.setHeight(max(0, m_bottomRight.height() + bottomWidth));
}
void RoundedIntRect::Radii::includeLogicalEdges(const RoundedIntRect::Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge)
{
if (includeLogicalLeftEdge) {
if (isHorizontal)
m_bottomLeft = edges.bottomLeft();
else
m_topRight = edges.topRight();
m_topLeft = edges.topLeft();
}
if (includeLogicalRightEdge) {
if (isHorizontal)
m_topRight = edges.topRight();
else
m_bottomLeft = edges.bottomLeft();
m_bottomRight = edges.bottomRight();
}
}
void RoundedIntRect::Radii::excludeLogicalEdges(bool isHorizontal, bool excludeLogicalLeftEdge, bool excludeLogicalRightEdge)
{
if (excludeLogicalLeftEdge) {
if (isHorizontal)
m_bottomLeft = IntSize();
else
m_topRight = IntSize();
m_topLeft = IntSize();
}
if (excludeLogicalRightEdge) {
if (isHorizontal)
m_topRight = IntSize();
else
m_bottomLeft = IntSize();
m_bottomRight = IntSize();
}
}
RoundedIntRect::RoundedIntRect(int x, int y, int width, int height)
: m_rect(x, y, width, height)
{
}
RoundedIntRect::RoundedIntRect(const IntRect& rect, const Radii& radii)
: m_rect(rect)
, m_radii(radii)
{
}
RoundedIntRect::RoundedIntRect(const IntRect& rect, const IntSize& topLeft, const IntSize& topRight, const IntSize& bottomLeft, const IntSize& bottomRight)
: m_rect(rect)
, m_radii(topLeft, topRight, bottomLeft, bottomRight)
{
}
void RoundedIntRect::includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLeftEdge, bool includeLogicalRightEdge)
{
m_radii.includeLogicalEdges(edges, isHorizontal, includeLogicalLeftEdge, includeLogicalRightEdge);
}
void RoundedIntRect::excludeLogicalEdges(bool isHorizontal, bool excludeLogicalLeftEdge, bool excludeLogicalRightEdge)
{
m_radii.excludeLogicalEdges(isHorizontal, excludeLogicalLeftEdge, excludeLogicalRightEdge);
}
bool RoundedIntRect::isRenderable() const
{
return m_radii.topLeft().width() + m_radii.topRight().width() <= m_rect.width()
&& m_radii.bottomLeft().width() + m_radii.bottomRight().width() <= m_rect.width()
&& m_radii.topLeft().height() + m_radii.topRight().height() <= m_rect.height()
&& m_radii.bottomLeft().height() + m_radii.bottomRight().height() <= m_rect.height();
}
} // namespace WebCore
|
