Introduce typed Node/Element iterators for range-based for loops of C++11.

Source/core/xml/XPathStep.cpp

 /*
  * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
  * Copyright (C) 2006, 2009 Apple Inc. All rights reserved.
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1. Redistributions of source code must retain the above copyright
@@ skipping 313 matching lines @@
 
         for (Node* n = context->previousSibling(); n; n = n->previousSibling()) {
             if (nodeMatches(evaluationContext, n, PrecedingSiblingAxis, nodeTest()))
                 nodes.append(n);
         }
         nodes.markSorted(false);
         return;
 
     case FollowingAxis:
         if (context->isAttributeNode()) {
-            for (Node* p = NodeTraversal::next(*toAttr(context)->ownerElement()); p; p = NodeTraversal::next(*p)) {
-                if (nodeMatches(evaluationContext, p, FollowingAxis, nodeTest()))
-                    nodes.append(p);
+            for (Node& p : NodeTraversal::fromNext(*toAttr(context)->ownerElement())) {
+                if (nodeMatches(evaluationContext, &p, FollowingAxis, nodeTest()))
+                    nodes.append(&p);
             }
         } else {
             for (Node* p = context; !isRootDomNode(p); p = p->parentNode()) {
                 for (Node* n = p->nextSibling(); n; n = n->nextSibling()) {
                     if (nodeMatches(evaluationContext, n, FollowingAxis, nodeTest()))
                         nodes.append(n);
                     for (Node* c = n->firstChild(); c; c = NodeTraversal::next(*c, n)) {
                         if (nodeMatches(evaluationContext, c, FollowingAxis, nodeTest()))
                             nodes.append(c);
                     }
@@ skipping 84 matching lines @@
         nodes.markSorted(false);
         return;
     }
     }
     ASSERT_NOT_REACHED();
 }
 
 }
 
 }