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 Apple Inc. All rights
reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2009, 2010, 2011 Apple Inc. All rights
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 85 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
96 virtual ~ContainerNode(); | 96 virtual ~ContainerNode(); |
97 | 97 |
98 Node* firstChild() const { return m_firstChild; } | 98 Node* firstChild() const { return m_firstChild; } |
99 Node* lastChild() const { return m_lastChild; } | 99 Node* lastChild() const { return m_lastChild; } |
100 bool hasChildren() const { return m_firstChild; } | 100 bool hasChildren() const { return m_firstChild; } |
101 | 101 |
102 bool hasOneChild() const { return m_firstChild && !m_firstChild->nextSibling
(); } | 102 bool hasOneChild() const { return m_firstChild && !m_firstChild->nextSibling
(); } |
103 bool hasOneTextChild() const { return hasOneChild() && m_firstChild->isTextN
ode(); } | 103 bool hasOneTextChild() const { return hasOneChild() && m_firstChild->isTextN
ode(); } |
104 bool hasChildCount(unsigned) const; | 104 bool hasChildCount(unsigned) const; |
105 | 105 |
106 PassRefPtr<HTMLCollection> children(); | 106 PassRefPtrWillBeRawPtr<HTMLCollection> children(); |
107 | 107 |
108 unsigned countChildren() const; | 108 unsigned countChildren() const; |
109 Node* traverseToChildAt(unsigned index) const; | 109 Node* traverseToChildAt(unsigned index) const; |
110 | 110 |
111 PassRefPtr<Element> querySelector(const AtomicString& selectors, ExceptionSt
ate&); | 111 PassRefPtr<Element> querySelector(const AtomicString& selectors, ExceptionSt
ate&); |
112 PassRefPtr<NodeList> querySelectorAll(const AtomicString& selectors, Excepti
onState&); | 112 PassRefPtrWillBeRawPtr<NodeList> querySelectorAll(const AtomicString& select
ors, ExceptionState&); |
113 | 113 |
114 void insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionState&
= ASSERT_NO_EXCEPTION); | 114 void insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionState&
= ASSERT_NO_EXCEPTION); |
115 void replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionState&
= ASSERT_NO_EXCEPTION); | 115 void replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionState&
= ASSERT_NO_EXCEPTION); |
116 void removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); | 116 void removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); |
117 void appendChild(PassRefPtr<Node> newChild, ExceptionState& = ASSERT_NO_EXCE
PTION); | 117 void appendChild(PassRefPtr<Node> newChild, ExceptionState& = ASSERT_NO_EXCE
PTION); |
118 | 118 |
119 Element* getElementById(const AtomicString& id) const; | 119 Element* getElementById(const AtomicString& id) const; |
120 PassRefPtr<HTMLCollection> getElementsByTagName(const AtomicString&); | 120 PassRefPtrWillBeRawPtr<HTMLCollection> getElementsByTagName(const AtomicStri
ng&); |
121 PassRefPtr<HTMLCollection> getElementsByTagNameNS(const AtomicString& namesp
aceURI, const AtomicString& localName); | 121 PassRefPtrWillBeRawPtr<HTMLCollection> getElementsByTagNameNS(const AtomicSt
ring& namespaceURI, const AtomicString& localName); |
122 PassRefPtr<NodeList> getElementsByName(const AtomicString& elementName); | 122 PassRefPtrWillBeRawPtr<NodeList> getElementsByName(const AtomicString& eleme
ntName); |
123 PassRefPtr<HTMLCollection> getElementsByClassName(const AtomicString& classN
ames); | 123 PassRefPtrWillBeRawPtr<HTMLCollection> getElementsByClassName(const AtomicSt
ring& classNames); |
124 PassRefPtr<RadioNodeList> radioNodeList(const AtomicString&, bool onlyMatchI
mgElements = false); | 124 PassRefPtrWillBeRawPtr<RadioNodeList> radioNodeList(const AtomicString&, boo
l onlyMatchImgElements = false); |
125 | 125 |
126 // These methods are only used during parsing. | 126 // These methods are only used during parsing. |
127 // They don't send DOM mutation events or handle reparenting. | 127 // They don't send DOM mutation events or handle reparenting. |
128 void parserAppendChild(PassRefPtr<Node>); | 128 void parserAppendChild(PassRefPtr<Node>); |
129 void parserRemoveChild(Node&); | 129 void parserRemoveChild(Node&); |
130 void parserInsertBefore(PassRefPtr<Node> newChild, Node& refChild); | 130 void parserInsertBefore(PassRefPtr<Node> newChild, Node& refChild); |
131 void parserTakeAllChildrenFrom(ContainerNode&); | 131 void parserTakeAllChildrenFrom(ContainerNode&); |
132 | 132 |
133 void removeChildren(); | 133 void removeChildren(); |
134 | 134 |
(...skipping 268 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
403 | 403 |
404 RefPtr<Node> m_currentNode; | 404 RefPtr<Node> m_currentNode; |
405 unsigned m_currentIndex; | 405 unsigned m_currentIndex; |
406 OwnPtr<Vector<RefPtr<Node> > > m_childNodes; // Lazily instantiated. | 406 OwnPtr<Vector<RefPtr<Node> > > m_childNodes; // Lazily instantiated. |
407 ChildNodesLazySnapshot* m_nextSnapshot; | 407 ChildNodesLazySnapshot* m_nextSnapshot; |
408 }; | 408 }; |
409 | 409 |
410 } // namespace WebCore | 410 } // namespace WebCore |
411 | 411 |
412 #endif // ContainerNode_h | 412 #endif // ContainerNode_h |
OLD | NEW |