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
|
/*
* 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/css/CSSSelectorList.h"
#include "core/dom/shadow/ContentDistribution.h"
#include "core/dom/shadow/ShadowRoot.h"
#include "core/html/HTMLElement.h"
namespace blink {
class InsertionPoint : public HTMLElement {
public:
virtual ~InsertionPoint();
bool hasDistribution() const { return !m_distribution.isEmpty(); }
void setDistribution(ContentDistribution&);
void clearDistribution() { m_distribution.clear(); }
bool isActive() const;
bool canBeActive() const;
bool isShadowInsertionPoint() const;
bool isContentInsertionPoint() const;
PassRefPtrWillBeRawPtr<StaticNodeList> getDistributedNodes();
virtual bool canAffectSelector() const { return false; }
virtual void attach(const AttachContext& = AttachContext()) override;
virtual void detach(const AttachContext& = AttachContext()) override;
bool shouldUseFallbackElements() const;
size_t size() const { return m_distribution.size(); }
Node* at(size_t index) const { return m_distribution.at(index).get(); }
Node* first() const { return m_distribution.isEmpty() ? 0 : m_distribution.first().get(); }
Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.last().get(); }
Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); }
Node* previousTo(const Node* node) const { return m_distribution.previousTo(node); }
virtual void trace(Visitor*) override;
protected:
InsertionPoint(const QualifiedName&, Document&);
virtual bool rendererIsNeeded(const RenderStyle&) override;
virtual void childrenChanged(const ChildrenChange&) override;
virtual InsertionNotificationRequest insertedInto(ContainerNode*) override;
virtual void removedFrom(ContainerNode*) override;
virtual void willRecalcStyle(StyleRecalcChange) override;
private:
bool isInsertionPoint() const = delete; // This will catch anyone doing an unnecessary check.
ContentDistribution m_distribution;
bool m_registeredWithShadowRoot;
};
typedef WillBeHeapVector<RefPtrWillBeMember<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* shadowWhereNodeCanBeDistributed(const Node& node)
{
Node* parent = node.parentNode();
if (!parent)
return 0;
if (parent->isShadowRoot() && !toShadowRoot(parent)->isYoungest())
return node.shadowHost()->shadow();
if (isActiveInsertionPoint(*parent))
return node.shadowHost()->shadow();
if (parent->isElementNode())
return toElement(parent)->shadow();
return 0;
}
const InsertionPoint* resolveReprojection(const Node*);
void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8>& results);
} // namespace blink
#endif // InsertionPoint_h
|
