Rename nodes/elements traversal function names.

Source/core/dom/ElementTraversal.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, 2013 Apple Inc. All rights reserved.
  * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
  * Copyright (C) 2014 Samsung Electronics. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
@@ skipping 80 matching lines @@
     static ElementType* previousSibling(const Node&);
     template <class MatchFunc>
     static ElementType* previousSibling(const Node&, MatchFunc);
     static ElementType* nextSibling(const Node&);
     template <class MatchFunc>
     static ElementType* nextSibling(const Node&, MatchFunc);
 
     static TraversalRange<TraversalChildrenIterator<Traversal<ElementType>>> childrenOf(const Node&);
     static TraversalRange<TraversalDescendantIterator<Traversal<ElementType>>> descendantsOf(const Node&);
     static TraversalRange<TraversalInclusiveDescendantIterator<Traversal<ElementType>>> inclusiveDescendantsOf(const ElementType&);
-    static TraversalRange<TraversalInclusiveNextIterator<Traversal<ElementType>>> from(const ElementType*);
-    static TraversalRange<TraversalNextIterator<Traversal<ElementType>>> fromNext(const Node&);
+    static TraversalRange<TraversalNextIterator<Traversal<ElementType>>> startsAt(const ElementType*);
+    static TraversalRange<TraversalNextIterator<Traversal<ElementType>>> startsAfter(const Node&);
 
 private:
     template <class NodeType>
     static ElementType* firstChildTemplate(NodeType&);
     template <class NodeType>
     static ElementType* lastChildTemplate(NodeType&);
     template <class NodeType>
     static ElementType* firstAncestorOrSelfTemplate(NodeType&);
     template <class NodeType>
     static ElementType* firstWithinTemplate(NodeType&);
@@ skipping 19 matching lines @@
     return TraversalRange<TraversalDescendantIterator<Traversal<ElementType>>>(&root);
 };
 
 template <class ElementType>
 inline TraversalRange<TraversalInclusiveDescendantIterator<Traversal<ElementType>>> Traversal<ElementType>::inclusiveDescendantsOf(const ElementType& root)
 {
     return TraversalRange<TraversalInclusiveDescendantIterator<Traversal<ElementType>>>(&root);
 };
 
 template <class ElementType>
-inline TraversalRange<TraversalInclusiveNextIterator<Traversal<ElementType>>> Traversal<ElementType>::from(const ElementType* start)
+inline TraversalRange<TraversalNextIterator<Traversal<ElementType>>> Traversal<ElementType>::startsAt(const ElementType* start)
 {
-    return TraversalRange<TraversalInclusiveNextIterator<Traversal<ElementType>>>(start);
+    return TraversalRange<TraversalNextIterator<Traversal<ElementType>>>(start);
 };
 
 template <class ElementType>
-inline TraversalRange<TraversalNextIterator<Traversal<ElementType>>> Traversal<ElementType>::fromNext(const Node& start)
+inline TraversalRange<TraversalNextIterator<Traversal<ElementType>>> Traversal<ElementType>::startsAfter(const Node& start)
 {
-    return TraversalRange<TraversalNextIterator<Traversal<ElementType>>>(&start);
+    return startsAt(Traversal<ElementType>::next(start));
 };
 
 // Specialized for pure Element to exploit the fact that Elements parent is always either another Element or the root.
 template <>
 template <class NodeType>
 inline Element* Traversal<Element>::firstWithinTemplate(NodeType& current)
 {
     return firstChildTemplate(current);
 }
 
@@ skipping 262 matching lines @@
 {
     ElementType* element = Traversal<ElementType>::nextSibling(current);
     while (element && !isMatch(*element))
         element = Traversal<ElementType>::nextSibling(*element);
     return element;
 }
 
 } // namespace blink
 
 #endif