Move m_overridesItemAfter member from LiveNodeListBase to HTMLCollection

Source/core/html/CollectionIndexCache.h

 /*
  * Copyright (C) 2013 Apple Inc. All rights reserved.
  * Copyright (C) 2014 Samsung Electronics. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
@@ skipping 112 matching lines @@
 template <typename Collection>
 inline Node* CollectionIndexCache<Collection>::nodeAt(const Collection& collection, unsigned index)
 {
     if (cachedNode() && cachedNodeIndex() == index)
         return cachedNode();
 
     if (isCachedNodeCountValid() && cachedNodeCount() <= index)
         return 0;
 
     ContainerNode& root = collection.rootNode();
-    if (isCachedNodeCountValid() && !collection.overridesItemAfter() && isLastNodeCloserThanLastOrCachedNode(index)) {
+    if (isCachedNodeCountValid() && collection.canTraverseBackward() && isLastNodeCloserThanLastOrCachedNode(index)) {
         Node* lastNode = collection.itemBefore(0);
         ASSERT(lastNode);
         setCachedNode(lastNode, cachedNodeCount() - 1);
-    } else if (!cachedNode() || isFirstNodeCloserThanCachedNode(index) || (collection.overridesItemAfter() && index < cachedNodeIndex())) {
+    } else if (!cachedNode() || isFirstNodeCloserThanCachedNode(index) || (!collection.canTraverseBackward() && index < cachedNodeIndex())) {
         Node* firstNode = collection.traverseToFirstElement(root);
         if (!firstNode) {
             setCachedNodeCount(0);
             return 0;
         }
         setCachedNode(firstNode, 0);
         ASSERT(!cachedNodeIndex());
     }
 
     if (cachedNodeIndex() == index)
         return cachedNode();
 
     return nodeBeforeOrAfterCachedNode(collection, index, root);
 }
 
 template <typename Collection>
 inline Node* CollectionIndexCache<Collection>::nodeBeforeOrAfterCachedNode(const Collection& collection, unsigned index, const ContainerNode &root)
 {
     unsigned currentIndex = cachedNodeIndex();
     Node* currentNode = cachedNode();
     ASSERT(currentNode);
     ASSERT(currentIndex != index);
 
     if (index < cachedNodeIndex()) {
-        ASSERT(!collection.overridesItemAfter());
+        ASSERT(collection.canTraverseBackward());
         while ((currentNode = collection.itemBefore(currentNode))) {
             ASSERT(currentIndex);
             currentIndex--;
             if (currentIndex == index) {
                 setCachedNode(currentNode, currentIndex);
                 return currentNode;
             }
         }
         ASSERT_NOT_REACHED();
         return 0;
@@ skipping 26 matching lines @@
     if (cachedNodeIndex() < index)
         return false;
 
     unsigned distanceFromCachedNode = cachedNodeIndex() - index;
     return index < distanceFromCachedNode;
 }
 
 } // namespace WebCore
 
 #endif // CollectionIndexCache_h