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
|
/*
* 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 InsertionPoint_h
#define InsertionPoint_h
#include "core/CoreExport.h"
#include "core/css/CSSSelectorList.h"
#include "core/dom/shadow/DistributedNodes.h"
#include "core/dom/shadow/ShadowRoot.h"
#include "core/html/HTMLElement.h"
namespace blink {
class CORE_EXPORT InsertionPoint : public HTMLElement {
public:
~InsertionPoint() override;
bool hasDistribution() const { return !m_distributedNodes.isEmpty(); }
void setDistributedNodes(DistributedNodes&);
void clearDistribution() { m_distributedNodes.clear(); }
bool isActive() const;
bool canBeActive() const;
bool isShadowInsertionPoint() const;
bool isContentInsertionPoint() const;
StaticNodeList* getDistributedNodes();
virtual bool canAffectSelector() const { return false; }
void attachLayoutTree(const AttachContext& = AttachContext()) override;
void detachLayoutTree(const AttachContext& = AttachContext()) override;
size_t distributedNodesSize() const { return m_distributedNodes.size(); }
Node* distributedNodeAt(size_t index) const {
return m_distributedNodes.at(index);
}
Node* firstDistributedNode() const {
return m_distributedNodes.isEmpty() ? 0 : m_distributedNodes.first();
}
Node* lastDistributedNode() const {
return m_distributedNodes.isEmpty() ? 0 : m_distributedNodes.last();
}
Node* distributedNodeNextTo(const Node* node) const {
return m_distributedNodes.nextTo(node);
}
Node* distributedNodePreviousTo(const Node* node) const {
return m_distributedNodes.previousTo(node);
}
DECLARE_VIRTUAL_TRACE();
protected:
InsertionPoint(const QualifiedName&, Document&);
bool layoutObjectIsNeeded(const ComputedStyle&) override;
void childrenChanged(const ChildrenChange&) override;
InsertionNotificationRequest insertedInto(ContainerNode*) override;
void removedFrom(ContainerNode*) override;
void willRecalcStyle(StyleRecalcChange) override;
private:
bool isInsertionPoint() const =
delete; // This will catch anyone doing an unnecessary check.
DistributedNodes m_distributedNodes;
bool m_registeredWithShadowRoot;
};
typedef HeapVector<Member<InsertionPoint>, 1> DestinationInsertionPoints;
DEFINE_ELEMENT_TYPE_CASTS(InsertionPoint, isInsertionPoint());
inline bool isActiveInsertionPoint(const Node& node) {
return node.isInsertionPoint() && toInsertionPoint(node).isActive();
}
inline bool isActiveShadowInsertionPoint(const Node& node) {
return node.isInsertionPoint() &&
toInsertionPoint(node).isShadowInsertionPoint();
}
inline ElementShadow* shadowWhereNodeCanBeDistributedForV0(const Node& node) {
Node* parent = node.parentNode();
if (!parent)
return 0;
if (parent->isShadowRoot() && !toShadowRoot(parent)->isYoungest())
return node.ownerShadowHost()->shadow();
if (isActiveInsertionPoint(*parent))
return node.ownerShadowHost()->shadow();
if (parent->isElementNode())
return toElement(parent)->shadow();
return 0;
}
const InsertionPoint* resolveReprojection(const Node*);
void collectDestinationInsertionPoints(
const Node&,
HeapVector<Member<InsertionPoint>, 8>& results);
} // namespace blink
#endif // InsertionPoint_h
|
