reflow comments in core/html/*.{cpp,h},core/html/imports

third_party/WebKit/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 137 matching lines @@
 
 template <typename Collection, typename NodeType>
 inline NodeType*
 CollectionIndexCache<Collection, NodeType>::nodeBeforeCachedNode(
     const Collection& collection,
     unsigned index) {
   DCHECK(cachedNode());  // Cache should be valid.
   unsigned currentIndex = cachedNodeIndex();
   DCHECK_GT(currentIndex, index);
 
-  // Determine if we should traverse from the beginning of the collection instead of the cached node.
+  // Determine if we should traverse from the beginning of the collection
+  // instead of the cached node.
   bool firstIsCloser = index < currentIndex - index;
   if (firstIsCloser || !collection.canTraverseBackward()) {
     NodeType* firstNode = collection.traverseToFirst();
     DCHECK(firstNode);
     setCachedNode(firstNode, 0);
     return index ? nodeAfterCachedNode(collection, index) : firstNode;
   }
 
   // Backward traversal from the cached node to the requested index.
   DCHECK(collection.canTraverseBackward());
   NodeType* currentNode =
       collection.traverseBackwardToOffset(index, *cachedNode(), currentIndex);
   DCHECK(currentNode);
   setCachedNode(currentNode, currentIndex);
   return currentNode;
 }
 
 template <typename Collection, typename NodeType>
 inline NodeType*
 CollectionIndexCache<Collection, NodeType>::nodeAfterCachedNode(
     const Collection& collection,
     unsigned index) {
   DCHECK(cachedNode());  // Cache should be valid.
   unsigned currentIndex = cachedNodeIndex();
   DCHECK_LT(currentIndex, index);
 
-  // Determine if we should traverse from the end of the collection instead of the cached node.
+  // Determine if we should traverse from the end of the collection instead of
+  // the cached node.
   bool lastIsCloser = isCachedNodeCountValid() &&
                       cachedNodeCount() - index < index - currentIndex;
   if (lastIsCloser && collection.canTraverseBackward()) {
     NodeType* lastItem = collection.traverseToLast();
     DCHECK(lastItem);
     setCachedNode(lastItem, cachedNodeCount() - 1);
     if (index < cachedNodeCount() - 1)
       return nodeBeforeCachedNode(collection, index);
     return lastItem;
   }
 
   // Forward traversal from the cached node to the requested index.
   NodeType* currentNode =
       collection.traverseForwardToOffset(index, *cachedNode(), currentIndex);
   if (!currentNode) {
     // Did not find the node. On plus side, we now know the length.
     setCachedNodeCount(currentIndex + 1);
     return nullptr;
   }
   setCachedNode(currentNode, currentIndex);
   return currentNode;
 }
 
 }  // namespace blink
 
 #endif  // CollectionIndexCache_h