Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(294)

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

Issue 422463002: Hide isXXX() type checking methods in subclasses (Closed) Base URL: svn://svn.chromium.org/blink/trunk
Patch Set: Created 6 years, 5 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
« no previous file with comments | « Source/core/dom/CharacterData.h ('k') | Source/core/dom/Document.h » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
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 168 matching lines...) Expand 10 before | Expand all | Expand 10 after
179 ContainerNode(TreeScope*, ConstructionType = CreateContainer); 179 ContainerNode(TreeScope*, ConstructionType = CreateContainer);
180 180
181 #if !ENABLE(OILPAN) 181 #if !ENABLE(OILPAN)
182 void removeDetachedChildren(); 182 void removeDetachedChildren();
183 #endif 183 #endif
184 184
185 void setFirstChild(Node* child) { m_firstChild = child; } 185 void setFirstChild(Node* child) { m_firstChild = child; }
186 void setLastChild(Node* child) { m_lastChild = child; } 186 void setLastChild(Node* child) { m_lastChild = child; }
187 187
188 private: 188 private:
189 bool isContainerNode() const WTF_DELETED_FUNCTION; // Hide to catch useless calls.
190 bool isTextNode() const WTF_DELETED_FUNCTION; // Hide to catch useless calls .
191
189 void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild); 192 void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild);
190 void insertBeforeCommon(Node& nextChild, Node& oldChild); 193 void insertBeforeCommon(Node& nextChild, Node& oldChild);
191 void appendChildCommon(Node& child); 194 void appendChildCommon(Node& child);
192 void updateTreeAfterInsertion(Node& child); 195 void updateTreeAfterInsertion(Node& child);
193 void willRemoveChildren(); 196 void willRemoveChildren();
194 void willRemoveChild(Node& child); 197 void willRemoveChild(Node& child);
195 void removeDetachedChildrenInContainer(ContainerNode&); 198 void removeDetachedChildrenInContainer(ContainerNode&);
196 void addChildNodesToDeletionQueue(Node*&, Node*&, ContainerNode&); 199 void addChildNodesToDeletionQueue(Node*&, Node*&, ContainerNode&);
197 200
198 void notifyNodeInsertedInternal(Node&, NodeVector& postInsertionNotification Targets); 201 void notifyNodeInsertedInternal(Node&, NodeVector& postInsertionNotification Targets);
(...skipping 120 matching lines...) Expand 10 before | Expand all | Expand 10 after
319 inline void getChildNodes(Node& node, NodeVector& nodes) 322 inline void getChildNodes(Node& node, NodeVector& nodes)
320 { 323 {
321 ASSERT(!nodes.size()); 324 ASSERT(!nodes.size());
322 for (Node* child = node.firstChild(); child; child = child->nextSibling()) 325 for (Node* child = node.firstChild(); child; child = child->nextSibling())
323 nodes.append(child); 326 nodes.append(child);
324 } 327 }
325 328
326 } // namespace blink 329 } // namespace blink
327 330
328 #endif // ContainerNode_h 331 #endif // ContainerNode_h
OLDNEW
« no previous file with comments | « Source/core/dom/CharacterData.h ('k') | Source/core/dom/Document.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698