Reflow comments in core/dom/.

third_party/WebKit/Source/core/dom/shadow/FlatTreeTraversal.cpp

 /*
  * Copyright (C) 2012 Google Inc. 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.
  *     * Neither the name of Google Inc. nor the names of its
@@ skipping 97 matching lines @@
   if (!slot)
     return nullptr;
   for (HTMLSlotElement* next = slot->assignedSlot(); next;
        next = next->assignedSlot()) {
     slot = next;
   }
   return slot;
 }
 
 // TODO(hayato): This may return a wrong result for a node which is not in a
-// document flat tree.  See FlatTreeTraversalTest's redistribution test for details.
+// document flat tree.  See FlatTreeTraversalTest's redistribution test for
+// details.
 Node* FlatTreeTraversal::traverseSiblings(const Node& node,
                                           TraversalDirection direction) {
   if (node.isChildOfV1ShadowHost())
     return traverseSiblingsForV1HostChild(node, direction);
 
   if (shadowWhereNodeCanBeDistributedForV0(node))
     return traverseSiblingsForV0Distribution(node, direction);
 
   if (Node* found = resolveDistributionStartingAt(
           direction == TraversalDirectionForward ? node.nextSibling()
@@ skipping 40 matching lines @@
   if (Node* found = (direction == TraversalDirectionForward
                          ? finalDestination->distributedNodeNextTo(&node)
                          : finalDestination->distributedNodePreviousTo(&node)))
     return found;
   return traverseSiblings(*finalDestination, direction);
 }
 
 ContainerNode* FlatTreeTraversal::traverseParent(
     const Node& node,
     ParentTraversalDetails* details) {
-  // TODO(hayato): Stop this hack for a pseudo element because a pseudo element is not a child of its parentOrShadowHostNode() in a flat tree.
+  // TODO(hayato): Stop this hack for a pseudo element because a pseudo element
+  // is not a child of its parentOrShadowHostNode() in a flat tree.
   if (node.isPseudoElement())
     return node.parentOrShadowHostNode();
 
   if (node.isChildOfV1ShadowHost()) {
     HTMLSlotElement* slot = finalDestinationSlotFor(node);
     if (!slot)
       return nullptr;
     return traverseParent(*slot);
   }
 
@@ skipping 12 matching lines @@
   return traverseParentOrHost(node);
 }
 
 ContainerNode* FlatTreeTraversal::traverseParentForV0(
     const Node& node,
     ParentTraversalDetails* details) {
   if (shadowWhereNodeCanBeDistributedForV0(node)) {
     if (const InsertionPoint* insertionPoint = resolveReprojection(&node)) {
       if (details)
         details->didTraverseInsertionPoint(insertionPoint);
-      // The node is distributed. But the distribution was stopped at this insertion point.
+      // The node is distributed. But the distribution was stopped at this
+      // insertion point.
       if (shadowWhereNodeCanBeDistributedForV0(*insertionPoint))
         return nullptr;
       return traverseParent(*insertionPoint);
     }
     return nullptr;
   }
   ContainerNode* parent = traverseParentOrHost(node);
   if (isActiveInsertionPoint(*parent))
     return nullptr;
   return parent;
@@ skipping 152 matching lines @@
 
 Node& FlatTreeTraversal::lastWithinOrSelf(const Node& node) {
   assertPrecondition(node);
   Node* lastDescendant = lastWithin(node);
   Node& result = lastDescendant ? *lastDescendant : const_cast<Node&>(node);
   assertPostcondition(&result);
   return result;
 }
 
 }  // namespace blink