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
|
/*
* Copyright (C) 2015 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 THIRD_PARTY_BLINK_RENDERER_CORE_HTML_HTML_SLOT_ELEMENT_H_
#define THIRD_PARTY_BLINK_RENDERER_CORE_HTML_HTML_SLOT_ELEMENT_H_
#include "third_party/blink/renderer/core/core_export.h"
#include "third_party/blink/renderer/core/html/html_element.h"
namespace blink {
class AssignedNodesOptions;
class CORE_EXPORT HTMLSlotElement final : public HTMLElement {
DEFINE_WRAPPERTYPEINFO();
public:
static HTMLSlotElement* CreateUserAgentDefaultSlot(Document&);
static HTMLSlotElement* CreateUserAgentCustomAssignSlot(Document&);
HTMLSlotElement(Document&);
const HeapVector<Member<Node>>& AssignedNodes() const;
const HeapVector<Member<Node>> AssignedNodesForBinding(
const AssignedNodesOptions*);
const HeapVector<Member<Element>> AssignedElements();
const HeapVector<Member<Element>> AssignedElementsForBinding(
const AssignedNodesOptions*);
Node* FirstAssignedNode() const {
auto& nodes = AssignedNodes();
return nodes.IsEmpty() ? nullptr : nodes.front().Get();
}
Node* LastAssignedNode() const {
auto& nodes = AssignedNodes();
return nodes.IsEmpty() ? nullptr : nodes.back().Get();
}
Node* AssignedNodeNextTo(const Node&) const;
Node* AssignedNodePreviousTo(const Node&) const;
void AppendAssignedNode(Node&);
void ClearAssignedNodes();
const HeapVector<Member<Node>> FlattenedAssignedNodes();
void WillRecalcAssignedNodes() { ClearAssignedNodes(); }
void DidRecalcAssignedNodes() {
UpdateManuallyAssignedNodesOrdering();
UpdateFlatTreeNodeDataForAssignedNodes();
RecalcFlatTreeChildren();
}
void AttachLayoutTree(AttachContext&) final;
void DetachLayoutTree(bool performing_reattach) final;
void RebuildDistributedChildrenLayoutTrees(WhitespaceAttacher&);
void AttributeChanged(const AttributeModificationParams&) final;
AtomicString GetName() const;
// This method can be slow because this has to traverse the children of a
// shadow host. This method should be used only when |assigned_nodes_| is
// dirty. e.g. To detect a slotchange event in DOM mutations.
bool HasAssignedNodesSlow() const;
bool SupportsAssignment() const { return IsInV1ShadowTree(); }
void CheckFallbackAfterInsertedIntoShadowTree();
void CheckFallbackAfterRemovedFromShadowTree();
void DidSlotChange(SlotChangeType);
void DidSlotChangeAfterRemovedFromShadowTree();
void DidSlotChangeAfterRenaming();
void DispatchSlotChangeEvent();
void ClearSlotChangeEventEnqueued() { slotchange_event_enqueued_ = false; }
static AtomicString NormalizeSlotName(const AtomicString&);
void RecalcStyleForSlotChildren(const StyleRecalcChange);
// For User-Agent Shadow DOM
static const AtomicString& UserAgentCustomAssignSlotName();
static const AtomicString& UserAgentDefaultSlotName();
// For imperative Shadow DOM distribution APIs
void assign(HeapVector<Member<Node>> nodes, ExceptionState&);
const HeapLinkedHashSet<Member<Node>>& AssignedNodesCandidates() const {
return assigned_nodes_candidates_;
}
void ClearAssignedNodesCandidates();
void RemoveAssignedNodeCandidate(Node&);
void Trace(Visitor*) const override;
private:
InsertionNotificationRequest InsertedInto(ContainerNode&) final;
void RemovedFrom(ContainerNode&) final;
void EnqueueSlotChangeEvent();
bool HasSlotableChild() const;
void NotifySlottedNodesOfFlatTreeChange(
const HeapVector<Member<Node>>& old_slotted,
const HeapVector<Member<Node>>& new_slotted);
static void NotifySlottedNodesOfFlatTreeChangeNaive(
const HeapVector<Member<Node>>& old_assigned_nodes,
const HeapVector<Member<Node>>& new_assigned_nodes);
static void NotifySlottedNodesOfFlatTreeChangeByDynamicProgramming(
const HeapVector<Member<Node>>& old_slotted,
const HeapVector<Member<Node>>& new_slotted);
void SetNeedsDistributionRecalcWillBeSetNeedsAssignmentRecalc();
bool CheckNodesValidity(HeapVector<Member<Node>> nodes, ExceptionState&);
// SlotAssignnment:recalc runs in tree order. Update to assigned order.
void UpdateManuallyAssignedNodesOrdering();
void RecalcFlatTreeChildren();
void UpdateFlatTreeNodeDataForAssignedNodes();
void ClearAssignedNodesAndFlatTreeChildren();
HeapVector<Member<Node>> assigned_nodes_;
HeapVector<Member<Node>> flat_tree_children_;
bool slotchange_event_enqueued_ = false;
// For imperative Shadow DOM distribution APIs.
// LinkedHashSet because candidates are ordered.
HeapLinkedHashSet<Member<Node>> assigned_nodes_candidates_;
template <typename T, wtf_size_t S>
struct LCSArray {
LCSArray() : values(S) {}
T& operator[](wtf_size_t i) { return values[i]; }
wtf_size_t size() { return values.size(); }
Vector<T, S> values;
};
// TODO(hayato): Move this to more appropriate directory (e.g. platform/wtf)
// if there are more than one usages.
template <typename Container, typename LCSTable, typename BacktrackTable>
static void FillLongestCommonSubsequenceDynamicProgrammingTable(
const Container& seq1,
const Container& seq2,
LCSTable& lcs_table,
BacktrackTable& backtrack_table) {
const wtf_size_t rows = SafeCast<wtf_size_t>(seq1.size());
const wtf_size_t columns = SafeCast<wtf_size_t>(seq2.size());
DCHECK_GT(lcs_table.size(), rows);
DCHECK_GT(lcs_table[0].size(), columns);
DCHECK_GT(backtrack_table.size(), rows);
DCHECK_GT(backtrack_table[0].size(), columns);
for (wtf_size_t r = 0; r <= rows; ++r)
lcs_table[r][0] = 0;
for (wtf_size_t c = 0; c <= columns; ++c)
lcs_table[0][c] = 0;
for (wtf_size_t r = 1; r <= rows; ++r) {
for (wtf_size_t c = 1; c <= columns; ++c) {
if (seq1[r - 1] == seq2[c - 1]) {
lcs_table[r][c] = lcs_table[r - 1][c - 1] + 1;
backtrack_table[r][c] = std::make_pair(r - 1, c - 1);
} else if (lcs_table[r - 1][c] > lcs_table[r][c - 1]) {
lcs_table[r][c] = lcs_table[r - 1][c];
backtrack_table[r][c] = std::make_pair(r - 1, c);
} else {
lcs_table[r][c] = lcs_table[r][c - 1];
backtrack_table[r][c] = std::make_pair(r, c - 1);
}
}
}
}
friend class HTMLSlotElementTest;
friend class HTMLSlotElementInDocumentTest;
};
inline const HTMLSlotElement* ToHTMLSlotElementIfSupportsAssignmentOrNull(
const Node& node) {
if (auto* slot = DynamicTo<HTMLSlotElement>(node)) {
if (slot->SupportsAssignment())
return slot;
}
return nullptr;
}
inline HTMLSlotElement* ToHTMLSlotElementIfSupportsAssignmentOrNull(
Node& node) {
return const_cast<HTMLSlotElement*>(
ToHTMLSlotElementIfSupportsAssignmentOrNull(
static_cast<const Node&>(node)));
}
inline const HTMLSlotElement* ToHTMLSlotElementIfSupportsAssignmentOrNull(
const Node* node) {
if (!node)
return nullptr;
return ToHTMLSlotElementIfSupportsAssignmentOrNull(*node);
}
inline HTMLSlotElement* ToHTMLSlotElementIfSupportsAssignmentOrNull(
Node* node) {
return const_cast<HTMLSlotElement*>(
ToHTMLSlotElementIfSupportsAssignmentOrNull(
static_cast<const Node*>(node)));
}
} // namespace blink
#endif // THIRD_PARTY_BLINK_RENDERER_CORE_HTML_HTML_SLOT_ELEMENT_H_
|
