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
|
/*
* Copyright (C) 2009 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 WebNode_h
#define WebNode_h
#include "../platform/WebCommon.h"
#include "../platform/WebPrivatePtr.h"
#include "../platform/WebString.h"
#include "WebExceptionCode.h"
namespace WebCore { class Node; }
namespace blink {
class WebDOMEvent;
class WebDOMEventListener;
class WebDOMEventListenerPrivate;
class WebDocument;
class WebElement;
class WebFrame;
class WebNodeList;
class WebPluginContainer;
// Provides access to some properties of a DOM node.
// Note that the class design requires that neither this class nor any of its subclasses have any virtual
// methods (other than the destructor), so that it is possible to safely static_cast an instance of one
// class to the appropriate subclass based on the actual type of the wrapped WebCore::Node. For the same
// reason, subclasses must not add any additional data members.
class WebNode {
public:
virtual ~WebNode() { reset(); }
WebNode() { }
WebNode(const WebNode& n) { assign(n); }
WebNode& operator=(const WebNode& n)
{
assign(n);
return *this;
}
BLINK_EXPORT void reset();
BLINK_EXPORT void assign(const WebNode&);
BLINK_EXPORT bool equals(const WebNode&) const;
// Required for using WebNodes in std maps. Note the order used is
// arbitrary and should not be expected to have any specific meaning.
BLINK_EXPORT bool lessThan(const WebNode&) const;
bool isNull() const { return m_private.isNull(); }
enum NodeType {
ElementNode = 1,
AttributeNode = 2,
TextNode = 3,
CDataSectionNode = 4,
// EntityReferenceNodes are deprecated and impossible to create in WebKit.
EntityNode = 6,
ProcessingInstructionsNode = 7,
CommentNode = 8,
DocumentNode = 9,
DocumentTypeNode = 10,
DocumentFragmentNode = 11,
NotationNode = 12,
XPathNamespaceNode = 13,
ShadowRootNode = 14
};
BLINK_EXPORT NodeType nodeType() const;
BLINK_EXPORT WebNode parentNode() const;
BLINK_EXPORT WebString nodeName() const;
BLINK_EXPORT WebString nodeValue() const;
BLINK_EXPORT WebDocument document() const;
BLINK_EXPORT WebNode firstChild() const;
BLINK_EXPORT WebNode lastChild() const;
BLINK_EXPORT WebNode previousSibling() const;
BLINK_EXPORT WebNode nextSibling() const;
BLINK_EXPORT bool hasChildNodes() const;
BLINK_EXPORT WebNodeList childNodes();
BLINK_EXPORT WebString createMarkup() const;
BLINK_EXPORT bool isLink() const;
BLINK_EXPORT bool isTextNode() const;
BLINK_EXPORT bool isFocusable() const;
BLINK_EXPORT bool isContentEditable() const;
BLINK_EXPORT bool isElementNode() const;
// addEventListener only works with a small set of eventTypes.
BLINK_EXPORT void addEventListener(const WebString& eventType, WebDOMEventListener* listener, bool useCapture);
BLINK_EXPORT bool dispatchEvent(const WebDOMEvent&);
BLINK_EXPORT void simulateClick();
BLINK_EXPORT WebNodeList getElementsByTagName(const WebString&) const;
BLINK_EXPORT WebElement querySelector(const WebString&, WebExceptionCode&) const;
BLINK_EXPORT WebElement rootEditableElement() const;
BLINK_EXPORT bool focused() const;
BLINK_EXPORT bool remove();
// Returns true if the node has a non-empty bounding box in layout.
// This does not 100% guarantee the user can see it, but is pretty close.
// Note: This method only works properly after layout has occurred.
BLINK_EXPORT bool hasNonEmptyBoundingBox() const;
BLINK_EXPORT WebPluginContainer* pluginContainer() const;
BLINK_EXPORT WebElement shadowHost() const;
template<typename T> T to()
{
T res;
res.WebNode::assign(*this);
return res;
}
template<typename T> const T toConst() const
{
T res;
res.WebNode::assign(*this);
return res;
}
#if BLINK_IMPLEMENTATION
WebNode(const WTF::PassRefPtr<WebCore::Node>&);
WebNode& operator=(const WTF::PassRefPtr<WebCore::Node>&);
operator WTF::PassRefPtr<WebCore::Node>() const;
#endif
#if BLINK_IMPLEMENTATION
template<typename T> T* unwrap()
{
return static_cast<T*>(m_private.get());
}
template<typename T> const T* constUnwrap() const
{
return static_cast<const T*>(m_private.get());
}
#endif
protected:
WebPrivatePtr<WebCore::Node> m_private;
};
inline bool operator==(const WebNode& a, const WebNode& b)
{
return a.equals(b);
}
inline bool operator!=(const WebNode& a, const WebNode& b)
{
return !(a == b);
}
inline bool operator<(const WebNode& a, const WebNode& b)
{
return a.lessThan(b);
}
} // namespace blink
#endif
|
