Rename nodes/elements traversal function names.

Source/core/xml/XPathNodeSet.cpp

 /*
  * 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
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
@@ skipping 208 matching lines @@
     for (unsigned i = 0; i < nodeCount; ++i) {
         Node* node = m_nodes[i].get();
         nodes.add(node);
         if (node->isAttributeNode())
             containsAttributeNodes = true;
     }
 
     WillBeHeapVector<RefPtrWillBeMember<Node> > sortedNodes;
     sortedNodes.reserveInitialCapacity(nodeCount);
 
-    for (Node& n : NodeTraversal::from(findRootNode(m_nodes.first().get()))) {
+    for (Node& n : NodeTraversal::startsAt(findRootNode(m_nodes.first().get()))) {
         if (nodes.contains(&n))
             sortedNodes.append(&n);
 
         if (!containsAttributeNodes || !n.isElementNode())
             continue;
 
         Element* element = toElement(&n);
         AttributeCollection attributes = element->attributes();
         AttributeCollection::iterator end = attributes.end();
         for (AttributeCollection::iterator it = attributes.begin(); it != end; ++it) {
@@ skipping 35 matching lines @@
 Node* NodeSet::anyNode() const
 {
     if (isEmpty())
         return 0;
 
     return m_nodes.at(0).get();
 }
 
 }
 }