Reflow comments in core/dom/.

third_party/WebKit/Source/core/dom/TreeScope.cpp

 /*
  * Copyright (C) 2011 Google Inc. All Rights Reserved.
  * Copyright (C) 2012 Apple 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:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
@@ skipping 306 matching lines @@
   return elementsFromHitTestResult(result);
 }
 
 DOMSelection* TreeScope::getSelection() const {
   if (!rootNode().document().frame())
     return nullptr;
 
   if (m_selection)
     return m_selection.get();
 
-  // FIXME: The correct selection in Shadow DOM requires that Position can have a ShadowRoot
-  // as a container.
-  // See https://bugs.webkit.org/show_bug.cgi?id=82697
+  // FIXME: The correct selection in Shadow DOM requires that Position can have
+  // a ShadowRoot as a container.  See
+  // https://bugs.webkit.org/show_bug.cgi?id=82697
   m_selection = DOMSelection::create(this);
   return m_selection.get();
 }
 
 Element* TreeScope::findAnchor(const String& name) {
   if (name.isEmpty())
     return nullptr;
   if (Element* element = getElementById(AtomicString(name)))
     return element;
   for (HTMLAnchorElement& anchor :
        Traversal<HTMLAnchorElement>::startsAfter(rootNode())) {
     if (rootNode().document().inQuirksMode()) {
       // Quirks mode, case insensitive comparison of names.
       if (equalIgnoringCase(anchor.name(), name))
         return &anchor;
     } else {
       // Strict mode, names need to match exactly.
       if (anchor.name() == name)
         return &anchor;
     }
   }
   return nullptr;
 }
 
 void TreeScope::adoptIfNeeded(Node& node) {
-  // Script is forbidden to protect against event handlers firing in the middle of rescoping
-  // in |didMoveToNewDocument| callbacks. See https://crbug.com/605766 and https://crbug.com/606651.
+  // Script is forbidden to protect against event handlers firing in the middle
+  // of rescoping in |didMoveToNewDocument| callbacks. See
+  // https://crbug.com/605766 and https://crbug.com/606651.
   ScriptForbiddenScope forbidScript;
   DCHECK(this);
   DCHECK(!node.isDocumentNode());
   TreeScopeAdopter adopter(node, *this);
   if (adopter.needsScopeChange())
     adopter.execute();
 }
 
 Element* TreeScope::retarget(const Element& target) const {
   for (const Element* ancestor = &target; ancestor;
@@ skipping 31 matching lines @@
       return toElement(eventPath->at(i).target()->toNode());
     }
   }
   return nullptr;
 }
 
 Element* TreeScope::adjustedElement(const Element& target) const {
   const Element* adjustedTarget = &target;
   for (const Element* ancestor = &target; ancestor;
        ancestor = ancestor->ownerShadowHost()) {
-    // This adjustment is done only for V1 shadows, and is skipped for V0 or UA shadows,
-    // because .pointerLockElement and .(webkit)fullscreenElement is not available for
-    // non-V1 shadow roots.
-    // TODO(kochi): Once V0 code is removed, use the same logic as .activeElement for V1.
+    // This adjustment is done only for V1 shadows, and is skipped for V0 or UA
+    // shadows, because .pointerLockElement and .(webkit)fullscreenElement is
+    // not available for non-V1 shadow roots.
+    // TODO(kochi): Once V0 code is removed, use the same logic as
+    // .activeElement for V1.
     if (ancestor->shadowRootIfV1())
       adjustedTarget = ancestor;
     if (this == ancestor->treeScope())
       return const_cast<Element*>(adjustedTarget);
   }
   return nullptr;
 }
 
 unsigned short TreeScope::comparePosition(const TreeScope& otherScope) const {
   if (otherScope == this)
@@ skipping 27 matching lines @@
                toShadowRoot(child2->rootNode()).olderShadowRoot();
            child; child = child->olderShadowRoot()) {
         if (child == child1)
           return Node::kDocumentPositionFollowing;
       }
 
       return Node::kDocumentPositionPreceding;
     }
   }
 
-  // There was no difference between the two parent chains, i.e., one was a subset of the other. The shorter
-  // chain is the ancestor.
+  // There was no difference between the two parent chains, i.e., one was a
+  // subset of the other. The shorter chain is the ancestor.
   return index1 < index2
              ? Node::kDocumentPositionFollowing |
                    Node::kDocumentPositionContainedBy
              : Node::kDocumentPositionPreceding |
                    Node::kDocumentPositionContains;
 }
 
 const TreeScope* TreeScope::commonAncestorTreeScope(
     const TreeScope& other) const {
   HeapVector<Member<const TreeScope>, 16> thisChain;
   for (const TreeScope* tree = this; tree; tree = tree->parentTreeScope())
     thisChain.append(tree);
 
   HeapVector<Member<const TreeScope>, 16> otherChain;
   for (const TreeScope* tree = &other; tree; tree = tree->parentTreeScope())
     otherChain.append(tree);
 
-  // Keep popping out the last elements of these chains until a mismatched pair is found. If |this| and |other|
-  // belong to different documents, null will be returned.
+  // Keep popping out the last elements of these chains until a mismatched pair
+  // is found. If |this| and |other| belong to different documents, null will be
+  // returned.
   const TreeScope* lastAncestor = nullptr;
   while (!thisChain.isEmpty() && !otherChain.isEmpty() &&
          thisChain.last() == otherChain.last()) {
     lastAncestor = thisChain.last();
     thisChain.removeLast();
     otherChain.removeLast();
   }
   return lastAncestor;
 }
 
@@ skipping 48 matching lines @@
   visitor->trace(m_parentTreeScope);
   visitor->trace(m_idTargetObserverRegistry);
   visitor->trace(m_selection);
   visitor->trace(m_elementsById);
   visitor->trace(m_imageMapsByName);
   visitor->trace(m_scopedStyleResolver);
   visitor->trace(m_radioButtonGroupScope);
 }
 
 }  // namespace blink