Have ElementTraversal / NodeTraversal's next() methods take a reference

Source/core/dom/NodeTraversal.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
@@ skipping 17 matching lines @@
 #include "core/dom/Node.h"
 
 namespace WebCore {
 
 namespace NodeTraversal {
 
 // Does a pre-order traversal of the tree to find the next node after this one.
 // This uses the same order that tags appear in the source file. If the stayWithin
 // argument is non-null, the traversal will stop once the specified node is reached.
 // This can be used to restrict traversal to a particular sub-tree.
-Node* next(const Node*);
-Node* next(const Node*, const Node* stayWithin);
-Node* next(const ContainerNode*);
-Node* next(const ContainerNode*, const Node* stayWithin);
+Node* next(const Node&);
+Node* next(const Node&, const Node* stayWithin);
+Node* next(const ContainerNode&);
+Node* next(const ContainerNode&, const Node* stayWithin);
 
 // Like next, but skips children and starts with the next sibling.
 Node* nextSkippingChildren(const Node*);
 Node* nextSkippingChildren(const Node*, const Node* stayWithin);
 Node* nextSkippingChildren(const ContainerNode*);
 Node* nextSkippingChildren(const ContainerNode*, const Node* stayWithin);
 
 // Does a reverse pre-order traversal to find the node that comes before the current one in document order
 Node* previous(const Node*, const Node* stayWithin = 0);
 
 // Like previous, but skips children and starts with the next sibling.
 Node* previousSkippingChildren(const Node*, const Node* stayWithin = 0);
 
 // Like next, but visits parents after their children.
 Node* nextPostOrder(const Node*, const Node* stayWithin = 0);
 
 // Like previous/previousSkippingChildren, but visits parents before their children.
 Node* previousPostOrder(const Node*, const Node* stayWithin = 0);
 Node* previousSkippingChildrenPostOrder(const Node*, const Node* stayWithin = 0);
 
 // Pre-order traversal including the pseudo-elements.
 Node* previousIncludingPseudo(const Node*, const Node* stayWithin = 0);
 Node* nextIncludingPseudo(const Node*, const Node* stayWithin = 0);
 Node* nextIncludingPseudoSkippingChildren(const Node*, const Node* stayWithin = 0);
 
 Node* nextAncestorSibling(const Node*);
 Node* nextAncestorSibling(const Node*, const Node* stayWithin);
 
 template <class NodeType>
-inline Node* traverseNextTemplate(NodeType* current)
+inline Node* traverseNextTemplate(NodeType& current)
 {
-    if (current->firstChild())
-        return current->firstChild();
-    if (current->nextSibling())
-        return current->nextSibling();
-    return nextAncestorSibling(current);
+    if (current.firstChild())
+        return current.firstChild();
+    if (current.nextSibling())
+        return current.nextSibling();
+    return nextAncestorSibling(&current);
 }
-inline Node* next(const Node* current) { return traverseNextTemplate(current); }
-inline Node* next(const ContainerNode* current) { return traverseNextTemplate(current); }
+inline Node* next(const Node& current) { return traverseNextTemplate(current); }
+inline Node* next(const ContainerNode& current) { return traverseNextTemplate(current); }
 
 template <class NodeType>
-inline Node* traverseNextTemplate(NodeType* current, const Node* stayWithin)
+inline Node* traverseNextTemplate(NodeType& current, const Node* stayWithin)
 {
-    if (current->firstChild())
-        return current->firstChild();
+    if (current.firstChild())
+        return current.firstChild();
     if (current == stayWithin)
         return 0;
-    if (current->nextSibling())
-        return current->nextSibling();
-    return nextAncestorSibling(current, stayWithin);
+    if (current.nextSibling())
+        return current.nextSibling();
+    return nextAncestorSibling(&current, stayWithin);
 }
-inline Node* next(const Node* current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); }
-inline Node* next(const ContainerNode* current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); }
+inline Node* next(const Node& current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); }
+inline Node* next(const ContainerNode& current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); }
 
 template <class NodeType>
 inline Node* traverseNextSkippingChildrenTemplate(NodeType* current)
 {
     if (current->nextSibling())
         return current->nextSibling();
     return nextAncestorSibling(current);
 }
 inline Node* nextSkippingChildren(const Node* current) { return traverseNextSkippingChildrenTemplate(current); }
 inline Node* nextSkippingChildren(const ContainerNode* current) { return traverseNextSkippingChildrenTemplate(current); }
 
 template <class NodeType>
 inline Node* traverseNextSkippingChildrenTemplate(NodeType* current, const Node* stayWithin)
 {
     if (current == stayWithin)
         return 0;
     if (current->nextSibling())
         return current->nextSibling();
     return nextAncestorSibling(current, stayWithin);
 }
 inline Node* nextSkippingChildren(const Node* current, const Node* stayWithin) { return traverseNextSkippingChildrenTemplate(current, stayWithin); }
 inline Node* nextSkippingChildren(const ContainerNode* current, const Node* stayWithin) { return traverseNextSkippingChildrenTemplate(current, stayWithin); }
 
 }
 
 }
 
 #endif