Stop passing the root node to node lists traversal functions

Source/core/html/HTMLCollection.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
  * 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
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
@@ skipping 41 matching lines @@
     void namedPropertyEnumerator(Vector<String>& names, ExceptionState&);
 
     // Non-DOM API
     void namedItems(const AtomicString& name, Vector<RefPtr<Element> >&) const;
     bool isEmpty() const { return m_collectionIndexCache.isEmpty(*this); }
     bool hasExactlyOneItem() const { return m_collectionIndexCache.hasExactlyOneNode(*this); }
 
     // CollectionIndexCache API.
     bool canTraverseBackward() const { return !overridesItemAfter(); }
     Element* itemBefore(const Element* previousItem) const;
-    Element* traverseToFirstElement(const ContainerNode& root) const;
-    Element* traverseForwardToOffset(unsigned offset, Element& currentElement, unsigned& currentOffset, const ContainerNode& root) const;
+    Element* traverseToFirstElement() const;
+    Element* traverseForwardToOffset(unsigned offset, Element& currentElement, unsigned& currentOffset) const;
 
 protected:
     HTMLCollection(ContainerNode& base, CollectionType, ItemAfterOverrideType);
 
     class NamedItemCache {
     public:
         Vector<Element*>* getElementsById(const AtomicString& id) const { return m_idCache.get(id.impl()); }
         Vector<Element*>* getElementsByName(const AtomicString& name) const { return m_nameCache.get(name.impl()); }
         void addElementWithId(const AtomicString& id, Element* element) { addElementToMap(m_idCache, id, element); }
         void addElementWithName(const AtomicString& name, Element* element) { addElementToMap(m_nameCache, name, element); }
@@ skipping 27 matching lines @@
         m_namedItemCache = adoptPtr(new NamedItemCache);
         return *m_namedItemCache;
     }
     NamedItemCache& namedItemCache() const
     {
         ASSERT(m_namedItemCache);
         return *m_namedItemCache;
     }
 
 private:
-    Element* traverseNextElement(Element& previous, const ContainerNode& root) const;
+    Element* traverseNextElement(Element& previous) const;
 
     void invalidateIdNameCacheMaps(Document* oldDocument = 0) const
     {
         if (!hasValidIdNameCache())
             return;
 
         // Make sure we decrement the NodeListWithIdNameCache count from
         // the old document instead of the new one in the case the collection
         // is moved to a new document.
         unregisterIdNameCacheFromDocument(oldDocument ? *oldDocument : document());
@@ skipping 11 matching lines @@
     const unsigned m_shouldOnlyIncludeDirectChildren : 1;
     mutable OwnPtr<NamedItemCache> m_namedItemCache;
     mutable CollectionIndexCache<HTMLCollection, Element> m_collectionIndexCache;
 
     friend class LiveNodeListBase;
 };
 
 } // namespace
 
 #endif