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 82 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
93 PassRefPtrWillBeRawPtr<Node> appendChild(PassRefPtrWillBeRawPtr<Node> newChi
ld, ExceptionState& = ASSERT_NO_EXCEPTION); | 93 PassRefPtrWillBeRawPtr<Node> appendChild(PassRefPtrWillBeRawPtr<Node> newChi
ld, ExceptionState& = ASSERT_NO_EXCEPTION); |
94 | 94 |
95 Element* getElementById(const AtomicString& id) const; | 95 Element* getElementById(const AtomicString& id) const; |
96 PassRefPtrWillBeRawPtr<TagCollection> getElementsByTagName(const AtomicStrin
g&); | 96 PassRefPtrWillBeRawPtr<TagCollection> getElementsByTagName(const AtomicStrin
g&); |
97 PassRefPtrWillBeRawPtr<TagCollection> getElementsByTagNameNS(const AtomicStr
ing& namespaceURI, const AtomicString& localName); | 97 PassRefPtrWillBeRawPtr<TagCollection> getElementsByTagNameNS(const AtomicStr
ing& namespaceURI, const AtomicString& localName); |
98 PassRefPtrWillBeRawPtr<NameNodeList> getElementsByName(const AtomicString& e
lementName); | 98 PassRefPtrWillBeRawPtr<NameNodeList> getElementsByName(const AtomicString& e
lementName); |
99 PassRefPtrWillBeRawPtr<ClassCollection> getElementsByClassName(const AtomicS
tring& classNames); | 99 PassRefPtrWillBeRawPtr<ClassCollection> getElementsByClassName(const AtomicS
tring& classNames); |
100 PassRefPtrWillBeRawPtr<RadioNodeList> radioNodeList(const AtomicString&, boo
l onlyMatchImgElements = false); | 100 PassRefPtrWillBeRawPtr<RadioNodeList> radioNodeList(const AtomicString&, boo
l onlyMatchImgElements = false); |
101 | 101 |
102 // These methods are only used during parsing. | 102 // These methods are only used during parsing. |
103 // They don't send DOM mutation events or handle reparenting. | 103 // They don't send DOM mutation events or accept DocumentFragments. |
104 void parserAppendChild(PassRefPtrWillBeRawPtr<Node>); | 104 void parserAppendChild(PassRefPtrWillBeRawPtr<Node>); |
105 void parserRemoveChild(Node&); | 105 void parserRemoveChild(Node&); |
106 void parserInsertBefore(PassRefPtrWillBeRawPtr<Node> newChild, Node& refChil
d); | 106 void parserInsertBefore(PassRefPtrWillBeRawPtr<Node> newChild, Node& refChil
d); |
107 void parserTakeAllChildrenFrom(ContainerNode&); | 107 void parserTakeAllChildrenFrom(ContainerNode&); |
108 | 108 |
109 void removeChildren(SubtreeModificationAction = DispatchSubtreeModifiedEvent
); | 109 void removeChildren(SubtreeModificationAction = DispatchSubtreeModifiedEvent
); |
110 | 110 |
111 void cloneChildNodes(ContainerNode* clone); | 111 void cloneChildNodes(ContainerNode* clone); |
112 | 112 |
113 virtual void attach(const AttachContext& = AttachContext()) override; | 113 virtual void attach(const AttachContext& = AttachContext()) override; |
(...skipping 252 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
366 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) | 366 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) |
367 { | 367 { |
368 ASSERT(!nodes.size()); | 368 ASSERT(!nodes.size()); |
369 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 369 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
370 nodes.append(child); | 370 nodes.append(child); |
371 } | 371 } |
372 | 372 |
373 } // namespace blink | 373 } // namespace blink |
374 | 374 |
375 #endif // ContainerNode_h | 375 #endif // ContainerNode_h |
OLD | NEW |