Source/core/dom/ContainerNode.h - Issue 132923003: Make sure the rootNode of a LiveNodeListBase is always a ContainerNode

Side by Side Diff: Source/core/dom/ContainerNode.h

Issue 132923003: Make sure the rootNode of a LiveNodeListBase is always a ContainerNode (Closed) Base URL: svn://svn.chromium.org/blink/trunk

Patch Set: Slightly clearer cast Created 6 years, 11 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View unified diff | Download patch | Annotate | Revision Log

« Source/core/dom/ChildNodeList.h ('K') | « Source/core/dom/ClassNodeList.cpp ('k') | Source/core/dom/ContainerNode.cpp » ('j') | Source/core/dom/NodeRareData.h » ('J')

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 83 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
94 unsigned childElementCount() const;	94 unsigned childElementCount() const;

95	95

96 unsigned childNodeCount() const;	96 unsigned childNodeCount() const;

97 Node* childNode(unsigned index) const;	97 Node* childNode(unsigned index) const;

98	98

99 void insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION);	99 void insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION);

100 void replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionState& = ASSERT_NO_EXCEPTION);	100 void replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionState& = ASSERT_NO_EXCEPTION);

101 void removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION);	101 void removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION);

102 void appendChild(PassRefPtr<Node> newChild, ExceptionState& = ASSERT_NO_EXCE PTION);	102 void appendChild(PassRefPtr<Node> newChild, ExceptionState& = ASSERT_NO_EXCE PTION);

103	103

	104 PassRefPtr<NodeList> getElementsByTagName(const AtomicString&);

	105 PassRefPtr<NodeList> getElementsByTagNameNS(const AtomicString& namespaceURI , const AtomicString& localName);

	106 PassRefPtr<NodeList> getElementsByName(const AtomicString& elementName);

	107 PassRefPtr<NodeList> getElementsByClassName(const AtomicString& classNames);

	108 PassRefPtr<RadioNodeList> radioNodeList(const AtomicString&, bool onlyMatchI mgElements = false);

	109

104 // These methods are only used during parsing.	110 // These methods are only used during parsing.

105 // They don't send DOM mutation events or handle reparenting.	111 // They don't send DOM mutation events or handle reparenting.

106 // However, arbitrary code may be run by beforeload handlers.	112 // However, arbitrary code may be run by beforeload handlers.

107 void parserAppendChild(PassRefPtr<Node>);	113 void parserAppendChild(PassRefPtr<Node>);

108 void parserRemoveChild(Node&);	114 void parserRemoveChild(Node&);

109 void parserInsertBefore(PassRefPtr<Node> newChild, Node& refChild);	115 void parserInsertBefore(PassRefPtr<Node> newChild, Node& refChild);

110 void parserTakeAllChildrenFrom(ContainerNode&);	116 void parserTakeAllChildrenFrom(ContainerNode&);

111	117

112 void removeChildren();	118 void removeChildren();

113	119

(...skipping 198 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
312	318

313 RefPtr<Node> m_currentNode;	319 RefPtr<Node> m_currentNode;

314 unsigned m_currentIndex;	320 unsigned m_currentIndex;

315 OwnPtr<Vector<RefPtr<Node> > > m_childNodes; // Lazily instantiated.	321 OwnPtr<Vector<RefPtr<Node> > > m_childNodes; // Lazily instantiated.

316 ChildNodesLazySnapshot* m_nextSnapshot;	322 ChildNodesLazySnapshot* m_nextSnapshot;

317 };	323 };

318	324

319 } // namespace WebCore	325 } // namespace WebCore

320	326

321 #endif // ContainerNode_h	327 #endif // ContainerNode_h

OLD	NEW