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
231
232
233
234
235
236
237
238
239
240
241
242
243
|
/*
* Copyright (C) 2011 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 "config.h"
#include "core/editing/RenderedPosition.h"
#include "core/dom/Position.h"
#include "core/editing/VisiblePosition.h"
namespace WebCore {
static inline RenderObject* rendererFromPosition(const Position& position)
{
ASSERT(position.isNotNull());
Node* rendererNode = 0;
switch (position.anchorType()) {
case Position::PositionIsOffsetInAnchor:
rendererNode = position.computeNodeAfterPosition();
if (!rendererNode || !rendererNode->renderer())
rendererNode = position.anchorNode()->lastChild();
break;
case Position::PositionIsBeforeAnchor:
case Position::PositionIsAfterAnchor:
break;
case Position::PositionIsBeforeChildren:
rendererNode = position.anchorNode()->firstChild();
break;
case Position::PositionIsAfterChildren:
rendererNode = position.anchorNode()->lastChild();
break;
}
if (!rendererNode || !rendererNode->renderer())
rendererNode = position.anchorNode();
return rendererNode->renderer();
}
RenderedPosition::RenderedPosition(const VisiblePosition& position)
: m_renderer(0)
, m_inlineBox(0)
, m_offset(0)
, m_prevLeafChild(uncachedInlineBox())
, m_nextLeafChild(uncachedInlineBox())
{
if (position.isNull())
return;
position.getInlineBoxAndOffset(m_inlineBox, m_offset);
if (m_inlineBox)
m_renderer = m_inlineBox->renderer();
else
m_renderer = rendererFromPosition(position.deepEquivalent());
}
RenderedPosition::RenderedPosition(const Position& position, EAffinity affinity)
: m_renderer(0)
, m_inlineBox(0)
, m_offset(0)
, m_prevLeafChild(uncachedInlineBox())
, m_nextLeafChild(uncachedInlineBox())
{
if (position.isNull())
return;
position.getInlineBoxAndOffset(affinity, m_inlineBox, m_offset);
if (m_inlineBox)
m_renderer = m_inlineBox->renderer();
else
m_renderer = rendererFromPosition(position);
}
InlineBox* RenderedPosition::prevLeafChild() const
{
if (m_prevLeafChild == uncachedInlineBox())
m_prevLeafChild = m_inlineBox->prevLeafChildIgnoringLineBreak();
return m_prevLeafChild;
}
InlineBox* RenderedPosition::nextLeafChild() const
{
if (m_nextLeafChild == uncachedInlineBox())
m_nextLeafChild = m_inlineBox->nextLeafChildIgnoringLineBreak();
return m_nextLeafChild;
}
bool RenderedPosition::isEquivalent(const RenderedPosition& other) const
{
return (m_renderer == other.m_renderer && m_inlineBox == other.m_inlineBox && m_offset == other.m_offset)
|| (atLeftmostOffsetInBox() && other.atRightmostOffsetInBox() && prevLeafChild() == other.m_inlineBox)
|| (atRightmostOffsetInBox() && other.atLeftmostOffsetInBox() && nextLeafChild() == other.m_inlineBox);
}
unsigned char RenderedPosition::bidiLevelOnLeft() const
{
InlineBox* box = atLeftmostOffsetInBox() ? prevLeafChild() : m_inlineBox;
return box ? box->bidiLevel() : 0;
}
unsigned char RenderedPosition::bidiLevelOnRight() const
{
InlineBox* box = atRightmostOffsetInBox() ? nextLeafChild() : m_inlineBox;
return box ? box->bidiLevel() : 0;
}
RenderedPosition RenderedPosition::leftBoundaryOfBidiRun(unsigned char bidiLevelOfRun)
{
if (!m_inlineBox || bidiLevelOfRun > m_inlineBox->bidiLevel())
return RenderedPosition();
InlineBox* box = m_inlineBox;
do {
InlineBox* prev = box->prevLeafChildIgnoringLineBreak();
if (!prev || prev->bidiLevel() < bidiLevelOfRun)
return RenderedPosition(box->renderer(), box, box->caretLeftmostOffset());
box = prev;
} while (box);
ASSERT_NOT_REACHED();
return RenderedPosition();
}
RenderedPosition RenderedPosition::rightBoundaryOfBidiRun(unsigned char bidiLevelOfRun)
{
if (!m_inlineBox || bidiLevelOfRun > m_inlineBox->bidiLevel())
return RenderedPosition();
InlineBox* box = m_inlineBox;
do {
InlineBox* next = box->nextLeafChildIgnoringLineBreak();
if (!next || next->bidiLevel() < bidiLevelOfRun)
return RenderedPosition(box->renderer(), box, box->caretRightmostOffset());
box = next;
} while (box);
ASSERT_NOT_REACHED();
return RenderedPosition();
}
bool RenderedPosition::atLeftBoundaryOfBidiRun(ShouldMatchBidiLevel shouldMatchBidiLevel, unsigned char bidiLevelOfRun) const
{
if (!m_inlineBox)
return false;
if (atLeftmostOffsetInBox()) {
if (shouldMatchBidiLevel == IgnoreBidiLevel)
return !prevLeafChild() || prevLeafChild()->bidiLevel() < m_inlineBox->bidiLevel();
return m_inlineBox->bidiLevel() >= bidiLevelOfRun && (!prevLeafChild() || prevLeafChild()->bidiLevel() < bidiLevelOfRun);
}
if (atRightmostOffsetInBox()) {
if (shouldMatchBidiLevel == IgnoreBidiLevel)
return nextLeafChild() && m_inlineBox->bidiLevel() < nextLeafChild()->bidiLevel();
return nextLeafChild() && m_inlineBox->bidiLevel() < bidiLevelOfRun && nextLeafChild()->bidiLevel() >= bidiLevelOfRun;
}
return false;
}
bool RenderedPosition::atRightBoundaryOfBidiRun(ShouldMatchBidiLevel shouldMatchBidiLevel, unsigned char bidiLevelOfRun) const
{
if (!m_inlineBox)
return false;
if (atRightmostOffsetInBox()) {
if (shouldMatchBidiLevel == IgnoreBidiLevel)
return !nextLeafChild() || nextLeafChild()->bidiLevel() < m_inlineBox->bidiLevel();
return m_inlineBox->bidiLevel() >= bidiLevelOfRun && (!nextLeafChild() || nextLeafChild()->bidiLevel() < bidiLevelOfRun);
}
if (atLeftmostOffsetInBox()) {
if (shouldMatchBidiLevel == IgnoreBidiLevel)
return prevLeafChild() && m_inlineBox->bidiLevel() < prevLeafChild()->bidiLevel();
return prevLeafChild() && m_inlineBox->bidiLevel() < bidiLevelOfRun && prevLeafChild()->bidiLevel() >= bidiLevelOfRun;
}
return false;
}
Position RenderedPosition::positionAtLeftBoundaryOfBiDiRun() const
{
ASSERT(atLeftBoundaryOfBidiRun());
if (atLeftmostOffsetInBox())
return createLegacyEditingPosition(m_renderer->node(), m_offset);
return createLegacyEditingPosition(nextLeafChild()->renderer()->node(), nextLeafChild()->caretLeftmostOffset());
}
Position RenderedPosition::positionAtRightBoundaryOfBiDiRun() const
{
ASSERT(atRightBoundaryOfBidiRun());
if (atRightmostOffsetInBox())
return createLegacyEditingPosition(m_renderer->node(), m_offset);
return createLegacyEditingPosition(prevLeafChild()->renderer()->node(), prevLeafChild()->caretRightmostOffset());
}
IntRect RenderedPosition::absoluteRect(LayoutUnit* extraWidthToEndOfLine) const
{
if (isNull())
return IntRect();
IntRect localRect = pixelSnappedIntRect(m_renderer->localCaretRect(m_inlineBox, m_offset, extraWidthToEndOfLine));
return localRect == IntRect() ? IntRect() : m_renderer->localToAbsoluteQuad(FloatRect(localRect)).enclosingBoundingBox();
}
bool renderObjectContainsPosition(RenderObject* target, const Position& position)
{
for (RenderObject* renderer = rendererFromPosition(position); renderer && renderer->node(); renderer = renderer->parent()) {
if (renderer == target)
return true;
}
return false;
}
};
|
