Index: Source/core/dom/ContainerNode.h |
diff --git a/Source/core/dom/ContainerNode.h b/Source/core/dom/ContainerNode.h |
index 16d09422fd7a8b138f534050a1570ca351ef3ff1..e7d067c65a0c214418e89b3cc08ecc581b487653 100644 |
--- a/Source/core/dom/ContainerNode.h |
+++ b/Source/core/dom/ContainerNode.h |
@@ -106,8 +106,8 @@ public: |
// However, arbitrary code may be run by beforeload handlers. |
void parserAppendChild(PassRefPtr<Node>); |
void parserRemoveChild(Node&); |
- void parserInsertBefore(PassRefPtr<Node> newChild, Node* refChild); |
- void parserTakeAllChildrenFrom(ContainerNode*); |
+ void parserInsertBefore(PassRefPtr<Node> newChild, Node& refChild); |
+ void parserTakeAllChildrenFrom(ContainerNode&); |
void removeChildren(); |
@@ -235,10 +235,10 @@ inline Node* Node::highestAncestor() const |
const int initialNodeVectorSize = 11; |
typedef Vector<RefPtr<Node>, initialNodeVectorSize> NodeVector; |
-inline void getChildNodes(Node* node, NodeVector& nodes) |
+inline void getChildNodes(Node& node, NodeVector& nodes) |
{ |
ASSERT(!nodes.size()); |
- for (Node* child = node->firstChild(); child; child = child->nextSibling()) |
+ for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
nodes.append(child); |
} |