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
|
/*
* Copyright (C) 2011 Google Inc. All Rights Reserved.
* Copyright (C) 2012 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.
*/
#ifndef TreeScope_h
#define TreeScope_h
#include "core/CoreExport.h"
#include "core/dom/DocumentOrderedMap.h"
#include "core/html/forms/RadioButtonGroupScope.h"
#include "core/layout/HitTestRequest.h"
#include "platform/heap/Handle.h"
#include "wtf/text/AtomicString.h"
namespace blink {
class ContainerNode;
class DOMSelection;
class Document;
class Element;
class HTMLMapElement;
class HitTestResult;
class IdTargetObserverRegistry;
class ScopedStyleResolver;
class Node;
// A class which inherits both Node and TreeScope must call clearRareData() in
// its destructor so that the Node destructor no longer does problematic
// NodeList cache manipulation in the destructor.
class CORE_EXPORT TreeScope : public GarbageCollectedMixin {
public:
TreeScope* parentTreeScope() const { return m_parentTreeScope; }
TreeScope* olderShadowRootOrParentTreeScope() const;
bool isInclusiveOlderSiblingShadowRootOrAncestorTreeScopeOf(
const TreeScope&) const;
Element* adjustedFocusedElement() const;
// Finds a retargeted element to the given argument, when the retargeted
// element is in this TreeScope. Returns null otherwise.
// TODO(kochi): once this algorithm is named in the spec, rename the method
// name.
Element* adjustedElement(const Element&) const;
Element* getElementById(const AtomicString&) const;
const HeapVector<Member<Element>>& getAllElementsById(
const AtomicString&) const;
bool hasElementWithId(const AtomicString& id) const;
bool containsMultipleElementsWithId(const AtomicString& id) const;
void addElementById(const AtomicString& elementId, Element*);
void removeElementById(const AtomicString& elementId, Element*);
Document& document() const {
DCHECK(m_document);
return *m_document;
}
Node* ancestorInThisScope(Node*) const;
void addImageMap(HTMLMapElement*);
void removeImageMap(HTMLMapElement*);
HTMLMapElement* getImageMap(const String& url) const;
Element* elementFromPoint(int x, int y) const;
Element* hitTestPoint(int x, int y, const HitTestRequest&) const;
HeapVector<Member<Element>> elementsFromPoint(int x, int y) const;
HeapVector<Member<Element>> elementsFromHitTestResult(HitTestResult&) const;
DOMSelection* getSelection() const;
Element* retarget(const Element& target) const;
// Find first anchor with the given name.
// First searches for an element with the given ID, but if that fails, then
// looks for an anchor with the given name. ID matching is always case
// sensitive, but Anchor name matching is case sensitive in strict mode and
// not case sensitive in quirks mode for historical compatibility reasons.
Element* findAnchor(const String& name);
// Used by the basic DOM mutation methods (e.g., appendChild()).
void adoptIfNeeded(Node&);
ContainerNode& rootNode() const { return *m_rootNode; }
IdTargetObserverRegistry& idTargetObserverRegistry() const {
return *m_idTargetObserverRegistry.get();
}
RadioButtonGroupScope& radioButtonGroupScope() {
return m_radioButtonGroupScope;
}
bool isInclusiveAncestorOf(const TreeScope&) const;
unsigned short comparePosition(const TreeScope&) const;
const TreeScope* commonAncestorTreeScope(const TreeScope& other) const;
TreeScope* commonAncestorTreeScope(TreeScope& other);
Element* getElementByAccessKey(const String& key) const;
DECLARE_VIRTUAL_TRACE();
ScopedStyleResolver* scopedStyleResolver() const {
return m_scopedStyleResolver.get();
}
ScopedStyleResolver& ensureScopedStyleResolver();
void clearScopedStyleResolver();
protected:
TreeScope(ContainerNode&, Document&);
TreeScope(Document&);
virtual ~TreeScope();
void setDocument(Document& document) { m_document = &document; }
void setParentTreeScope(TreeScope&);
void setNeedsStyleRecalcForViewportUnits();
private:
Member<ContainerNode> m_rootNode;
Member<Document> m_document;
Member<TreeScope> m_parentTreeScope;
Member<DocumentOrderedMap> m_elementsById;
Member<DocumentOrderedMap> m_imageMapsByName;
Member<IdTargetObserverRegistry> m_idTargetObserverRegistry;
Member<ScopedStyleResolver> m_scopedStyleResolver;
mutable Member<DOMSelection> m_selection;
RadioButtonGroupScope m_radioButtonGroupScope;
};
inline bool TreeScope::hasElementWithId(const AtomicString& id) const {
DCHECK(!id.isNull());
return m_elementsById && m_elementsById->contains(id);
}
inline bool TreeScope::containsMultipleElementsWithId(
const AtomicString& id) const {
return m_elementsById && m_elementsById->containsMultiple(id);
}
DEFINE_COMPARISON_OPERATORS_WITH_REFERENCES(TreeScope)
HitTestResult hitTestInDocument(
const Document*,
int x,
int y,
const HitTestRequest& = HitTestRequest::ReadOnly | HitTestRequest::Active);
} // namespace blink
#endif // TreeScope_h
|
