OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
5 * Copyright (C) 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2013 Apple Inc. All r
ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2013 Apple Inc. All r
ights reserved. |
6 * | 6 * |
7 * This library is free software; you can redistribute it and/or | 7 * This library is free software; you can redistribute it and/or |
8 * modify it under the terms of the GNU Library General Public | 8 * modify it under the terms of the GNU Library General Public |
9 * License as published by the Free Software Foundation; either | 9 * License as published by the Free Software Foundation; either |
10 * version 2 of the License, or (at your option) any later version. | 10 * version 2 of the License, or (at your option) any later version. |
(...skipping 66 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
77 bool hasChildCount(unsigned) const; | 77 bool hasChildCount(unsigned) const; |
78 | 78 |
79 PassRefPtrWillBeRawPtr<HTMLCollection> children(); | 79 PassRefPtrWillBeRawPtr<HTMLCollection> children(); |
80 | 80 |
81 unsigned countChildren() const; | 81 unsigned countChildren() const; |
82 Node* traverseToChildAt(unsigned index) const; | 82 Node* traverseToChildAt(unsigned index) const; |
83 | 83 |
84 PassRefPtrWillBeRawPtr<Element> querySelector(const AtomicString& selectors,
ExceptionState&); | 84 PassRefPtrWillBeRawPtr<Element> querySelector(const AtomicString& selectors,
ExceptionState&); |
85 PassRefPtrWillBeRawPtr<StaticNodeList> querySelectorAll(const AtomicString&
selectors, ExceptionState&); | 85 PassRefPtrWillBeRawPtr<StaticNodeList> querySelectorAll(const AtomicString&
selectors, ExceptionState&); |
86 | 86 |
87 void insertBefore(PassRefPtrWillBeRawPtr<Node> newChild, Node* refChild, Exc
eptionState& = ASSERT_NO_EXCEPTION); | 87 PassRefPtrWillBeRawPtr<Node> insertBefore(PassRefPtrWillBeRawPtr<Node> newCh
ild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
88 void replaceChild(PassRefPtrWillBeRawPtr<Node> newChild, Node* oldChild, Exc
eptionState& = ASSERT_NO_EXCEPTION); | 88 void replaceChild(PassRefPtrWillBeRawPtr<Node> newChild, Node* oldChild, Exc
eptionState& = ASSERT_NO_EXCEPTION); |
89 void removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); | 89 void removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); |
90 void appendChild(PassRefPtrWillBeRawPtr<Node> newChild, ExceptionState& = AS
SERT_NO_EXCEPTION); | 90 void appendChild(PassRefPtrWillBeRawPtr<Node> newChild, ExceptionState& = AS
SERT_NO_EXCEPTION); |
91 | 91 |
92 Element* getElementById(const AtomicString& id) const; | 92 Element* getElementById(const AtomicString& id) const; |
93 PassRefPtrWillBeRawPtr<TagCollection> getElementsByTagName(const AtomicStrin
g&); | 93 PassRefPtrWillBeRawPtr<TagCollection> getElementsByTagName(const AtomicStrin
g&); |
94 PassRefPtrWillBeRawPtr<TagCollection> getElementsByTagNameNS(const AtomicStr
ing& namespaceURI, const AtomicString& localName); | 94 PassRefPtrWillBeRawPtr<TagCollection> getElementsByTagNameNS(const AtomicStr
ing& namespaceURI, const AtomicString& localName); |
95 PassRefPtrWillBeRawPtr<NameNodeList> getElementsByName(const AtomicString& e
lementName); | 95 PassRefPtrWillBeRawPtr<NameNodeList> getElementsByName(const AtomicString& e
lementName); |
96 PassRefPtrWillBeRawPtr<ClassCollection> getElementsByClassName(const AtomicS
tring& classNames); | 96 PassRefPtrWillBeRawPtr<ClassCollection> getElementsByClassName(const AtomicS
tring& classNames); |
97 PassRefPtrWillBeRawPtr<RadioNodeList> radioNodeList(const AtomicString&, boo
l onlyMatchImgElements = false); | 97 PassRefPtrWillBeRawPtr<RadioNodeList> radioNodeList(const AtomicString&, boo
l onlyMatchImgElements = false); |
(...skipping 115 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
213 inline bool checkAcceptChild(const Node* newChild, const Node* oldChild, Exc
eptionState&) const; | 213 inline bool checkAcceptChild(const Node* newChild, const Node* oldChild, Exc
eptionState&) const; |
214 inline bool containsConsideringHostElements(const Node&) const; | 214 inline bool containsConsideringHostElements(const Node&) const; |
215 inline bool isChildTypeAllowed(const Node& child) const; | 215 inline bool isChildTypeAllowed(const Node& child) const; |
216 | 216 |
217 void attachChildren(const AttachContext& = AttachContext()); | 217 void attachChildren(const AttachContext& = AttachContext()); |
218 void detachChildren(const AttachContext& = AttachContext()); | 218 void detachChildren(const AttachContext& = AttachContext()); |
219 | 219 |
220 bool getUpperLeftCorner(FloatPoint&) const; | 220 bool getUpperLeftCorner(FloatPoint&) const; |
221 bool getLowerRightCorner(FloatPoint&) const; | 221 bool getLowerRightCorner(FloatPoint&) const; |
222 | 222 |
| 223 Node* sameNode(Node* child); |
| 224 |
223 RawPtrWillBeMember<Node> m_firstChild; | 225 RawPtrWillBeMember<Node> m_firstChild; |
224 RawPtrWillBeMember<Node> m_lastChild; | 226 RawPtrWillBeMember<Node> m_lastChild; |
225 }; | 227 }; |
226 | 228 |
227 #ifndef NDEBUG | 229 #ifndef NDEBUG |
228 bool childAttachedAllowedWhenAttachingChildren(ContainerNode*); | 230 bool childAttachedAllowedWhenAttachingChildren(ContainerNode*); |
229 #endif | 231 #endif |
230 | 232 |
231 DEFINE_NODE_TYPE_CASTS(ContainerNode, isContainerNode()); | 233 DEFINE_NODE_TYPE_CASTS(ContainerNode, isContainerNode()); |
232 | 234 |
(...skipping 92 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
325 inline void getChildNodes(Node& node, NodeVector& nodes) | 327 inline void getChildNodes(Node& node, NodeVector& nodes) |
326 { | 328 { |
327 ASSERT(!nodes.size()); | 329 ASSERT(!nodes.size()); |
328 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 330 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
329 nodes.append(child); | 331 nodes.append(child); |
330 } | 332 } |
331 | 333 |
332 } // namespace WebCore | 334 } // namespace WebCore |
333 | 335 |
334 #endif // ContainerNode_h | 336 #endif // ContainerNode_h |
OLD | NEW |