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
|
/*
* Copyright (C) 2015-2016 Apple 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 INC. ``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 INC. 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 "ElementAndTextDescendantIterator.h"
#include "ShadowRoot.h"
#ifndef ComposedTreeIterator_h
#define ComposedTreeIterator_h
namespace WebCore {
class HTMLSlotElement;
class ComposedTreeIterator {
public:
ComposedTreeIterator();
ComposedTreeIterator(ContainerNode& root);
ComposedTreeIterator(ContainerNode& root, Node& current);
Node& operator*() { return current(); }
Node* operator->() { return ¤t(); }
bool operator==(const ComposedTreeIterator& other) const { return context().iterator == other.context().iterator; }
bool operator!=(const ComposedTreeIterator& other) const { return context().iterator != other.context().iterator; }
ComposedTreeIterator& operator++() { return traverseNext(); }
ComposedTreeIterator& traverseNext();
ComposedTreeIterator& traverseNextSkippingChildren();
ComposedTreeIterator& traverseNextSibling();
ComposedTreeIterator& traversePreviousSibling();
unsigned depth() const;
void dropAssertions();
private:
void initializeContextStack(ContainerNode& root, Node& current);
void traverseNextInShadowTree();
void traverseNextLeavingContext();
void traverseShadowRoot(ShadowRoot&);
#if ENABLE(SHADOW_DOM) || ENABLE(DETAILS_ELEMENT)
bool advanceInSlot(int direction);
void traverseSiblingInSlot(int direction);
#endif
struct Context {
Context() { }
explicit Context(ContainerNode& root)
: iterator(root)
{ }
Context(ContainerNode& root, Node& node, size_t slotNodeIndex = notFound)
: iterator(root, &node)
, slotNodeIndex(slotNodeIndex)
{ }
ElementAndTextDescendantIterator iterator;
size_t slotNodeIndex { notFound };
};
Context& context() { return m_contextStack.last(); }
const Context& context() const { return m_contextStack.last(); }
Node& current() { return *context().iterator; }
bool m_didDropAssertions { false };
Vector<Context, 4> m_contextStack;
};
inline ComposedTreeIterator::ComposedTreeIterator()
{
m_contextStack.uncheckedAppend({ });
}
inline ComposedTreeIterator& ComposedTreeIterator::traverseNext()
{
if (auto* shadowRoot = context().iterator->shadowRoot()) {
traverseShadowRoot(*shadowRoot);
return *this;
}
if (m_contextStack.size() > 1) {
traverseNextInShadowTree();
return *this;
}
context().iterator.traverseNext();
return *this;
}
inline ComposedTreeIterator& ComposedTreeIterator::traverseNextSkippingChildren()
{
context().iterator.traverseNextSkippingChildren();
if (!context().iterator && m_contextStack.size() > 1)
traverseNextLeavingContext();
return *this;
}
inline ComposedTreeIterator& ComposedTreeIterator::traverseNextSibling()
{
#if ENABLE(SHADOW_DOM) || ENABLE(DETAILS_ELEMENT)
if (current().parentNode()->shadowRoot()) {
traverseSiblingInSlot(1);
return *this;
}
#endif
context().iterator.traverseNextSibling();
return *this;
}
inline ComposedTreeIterator& ComposedTreeIterator::traversePreviousSibling()
{
#if ENABLE(SHADOW_DOM) || ENABLE(DETAILS_ELEMENT)
if (current().parentNode()->shadowRoot()) {
traverseSiblingInSlot(-1);
return *this;
}
#endif
context().iterator.traversePreviousSibling();
return *this;
}
inline unsigned ComposedTreeIterator::depth() const
{
unsigned depth = 0;
for (auto& context : m_contextStack)
depth += context.iterator.depth();
return depth;
}
class ComposedTreeDescendantAdapter {
public:
ComposedTreeDescendantAdapter(ContainerNode& parent)
: m_parent(parent)
{ }
ComposedTreeIterator begin() { return ComposedTreeIterator(m_parent); }
ComposedTreeIterator end() { return { }; }
ComposedTreeIterator at(const Node& child) { return ComposedTreeIterator(m_parent, const_cast<Node&>(child)); }
private:
ContainerNode& m_parent;
};
class ComposedTreeChildAdapter {
public:
class Iterator : public ComposedTreeIterator {
public:
Iterator() = default;
explicit Iterator(ContainerNode& root)
: ComposedTreeIterator(root)
{ }
Iterator(ContainerNode& root, Node& current)
: ComposedTreeIterator(root, current)
{ }
Iterator& operator++() { return static_cast<Iterator&>(traverseNextSibling()); }
Iterator& operator--() { return static_cast<Iterator&>(traversePreviousSibling()); }
};
ComposedTreeChildAdapter(ContainerNode& parent)
: m_parent(parent)
{ }
Iterator begin() { return Iterator(m_parent); }
Iterator end() { return { }; }
Iterator at(const Node& child) { return Iterator(m_parent, const_cast<Node&>(child)); }
private:
ContainerNode& m_parent;
};
// FIXME: We should have const versions too.
inline ComposedTreeDescendantAdapter composedTreeDescendants(ContainerNode& parent)
{
return ComposedTreeDescendantAdapter(parent);
}
inline ComposedTreeChildAdapter composedTreeChildren(ContainerNode& parent)
{
return ComposedTreeChildAdapter(parent);
}
enum class ComposedTreeAsTextMode { Normal, WithPointers };
WEBCORE_EXPORT String composedTreeAsText(ContainerNode& root, ComposedTreeAsTextMode = ComposedTreeAsTextMode::Normal);
}
#endif
|
