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
|
/*
* Copyright (C) 2012 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_DOM_V0_INSERTION_POINT_H_
#define THIRD_PARTY_BLINK_RENDERER_CORE_DOM_V0_INSERTION_POINT_H_
#include "third_party/blink/renderer/core/core_export.h"
#include "third_party/blink/renderer/core/css/css_selector_list.h"
#include "third_party/blink/renderer/core/dom/distributed_nodes.h"
#include "third_party/blink/renderer/core/html/html_element.h"
#include "third_party/blink/renderer/platform/wtf/casting.h"
namespace blink {
class CORE_EXPORT V0InsertionPoint : public HTMLElement {
public:
~V0InsertionPoint() override;
bool HasDistribution() const { return !distributed_nodes_.IsEmpty(); }
void SetDistributedNodes(DistributedNodes&);
void ClearDistribution() { distributed_nodes_.Clear(); }
bool IsActive() const;
bool CanBeActive() const;
bool IsContentInsertionPoint() const;
StaticNodeList* getDistributedNodes();
virtual bool CanAffectSelector() const { return false; }
void AttachLayoutTree(AttachContext&) override;
void DetachLayoutTree(bool performing_reattach) override;
void RebuildDistributedChildrenLayoutTrees(WhitespaceAttacher&);
size_t DistributedNodesSize() const { return distributed_nodes_.size(); }
Node* DistributedNodeAt(wtf_size_t index) const {
return distributed_nodes_.at(index);
}
Node* FirstDistributedNode() const {
return distributed_nodes_.IsEmpty() ? nullptr : distributed_nodes_.First();
}
Node* LastDistributedNode() const {
return distributed_nodes_.IsEmpty() ? nullptr : distributed_nodes_.Last();
}
Node* DistributedNodeNextTo(const Node* node) const {
return distributed_nodes_.NextTo(node);
}
Node* DistributedNodePreviousTo(const Node* node) const {
return distributed_nodes_.PreviousTo(node);
}
bool DistributedNodesAreFallback() const {
// We either do not have distributed children or the distributed children
// are the fallback children.
return !HasDistribution() || DistributedNodeAt(0)->parentNode() == this;
}
void RecalcStyleForInsertionPointChildren(const StyleRecalcChange);
void Trace(Visitor*) const override;
protected:
V0InsertionPoint(const QualifiedName&, Document&);
bool LayoutObjectIsNeeded(const ComputedStyle&) const override;
void ChildrenChanged(const ChildrenChange&) override;
InsertionNotificationRequest InsertedInto(ContainerNode&) override;
void RemovedFrom(ContainerNode&) override;
private:
bool IsV0InsertionPoint() const =
delete; // This will catch anyone doing an unnecessary check.
DistributedNodes distributed_nodes_;
bool registered_with_shadow_root_;
};
using DestinationInsertionPoints = HeapVector<Member<V0InsertionPoint>, 1>;
inline bool IsActiveV0InsertionPoint(const Node& node) {
auto* insertion_point = DynamicTo<V0InsertionPoint>(node);
return insertion_point && insertion_point->IsActive();
}
inline ShadowRoot* ShadowRootWhereNodeCanBeDistributedForV0(const Node& node) {
Node* parent = node.parentNode();
if (!parent)
return nullptr;
if (IsActiveV0InsertionPoint(*parent))
return node.ContainingShadowRoot();
if (auto* parent_element = DynamicTo<Element>(parent))
return parent_element->GetShadowRoot();
return nullptr;
}
const V0InsertionPoint* ResolveReprojection(const Node*);
void CollectDestinationInsertionPoints(
const Node&,
HeapVector<Member<V0InsertionPoint>, 8>& results);
template <>
inline bool IsElementOfType<const V0InsertionPoint>(const Node& node) {
return node.IsV0InsertionPoint();
}
template <>
struct DowncastTraits<V0InsertionPoint> {
static bool AllowFrom(const Node& node) { return node.IsV0InsertionPoint(); }
};
} // namespace blink
#endif // THIRD_PARTY_BLINK_RENDERER_CORE_DOM_V0_INSERTION_POINT_H_
|
