Reflow comments in core/dom/.

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

 // Copyright 2016 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "core/dom/IntersectionObservation.h"
 
 #include "core/dom/ElementRareData.h"
 #include "core/dom/IntersectionObserver.h"
 #include "core/frame/FrameView.h"
 #include "core/frame/LocalFrame.h"
@@ skipping 126 matching lines @@
   if (ancestorFrame != descendantFrame)
     return false;
 
   while (descendant && descendant != ancestor)
     descendant = descendant->containingBlock();
   return descendant;
 }
 
 bool IntersectionObservation::computeGeometry(
     IntersectionGeometry& geometry) const {
-  // In the first few lines here, before initializeGeometry is called, "return true"
-  // effectively means "if the previous observed state was that root and target were
-  // intersecting, then generate a notification indicating that they are no longer
-  // intersecting."  This happens, for example, when root or target is removed from the
-  // DOM tree and not reinserted before the next frame is generated, or display:none
-  // is set on the root or target.
+  // In the first few lines here, before initializeGeometry is called, "return
+  // true" effectively means "if the previous observed state was that root and
+  // target were intersecting, then generate a notification indicating that they
+  // are no longer intersecting."  This happens, for example, when root or
+  // target is removed from the DOM tree and not reinserted before the next
+  // frame is generated, or display:none is set on the root or target.
   Element* targetElement = target();
   if (!targetElement)
     return false;
   if (!targetElement->isConnected())
     return true;
   DCHECK(m_observer);
   Element* rootElement = m_observer->root();
   if (rootElement && !rootElement->isConnected())
     return true;
 
@@ skipping 28 matching lines @@
   return true;
 }
 
 void IntersectionObservation::computeIntersectionObservations(
     DOMHighResTimeStamp timestamp) {
   IntersectionGeometry geometry;
   if (!computeGeometry(geometry))
     return;
 
   // Some corner cases for threshold index:
-  //   - If target rect is zero area, because it has zero width and/or zero height,
+  //   - If target rect is zero area, because it has zero width and/or zero
+  //     height,
   //     only two states are recognized:
   //     - 0 means not intersecting.
   //     - 1 means intersecting.
   //     No other threshold crossings are possible.
   //   - Otherwise:
   //     - If root and target do not intersect, the threshold index is 0.
-  //     - If root and target intersect but the intersection has zero-area (i.e., they
-  //       have a coincident edge or corner), we consider the intersection to have
-  //       "crossed" a zero threshold, but not crossed any non-zero threshold.
+  //     - If root and target intersect but the intersection has zero-area
+  //       (i.e., they have a coincident edge or corner), we consider the
+  //       intersection to have "crossed" a zero threshold, but not crossed
+  //       any non-zero threshold.
   unsigned newThresholdIndex;
   float newVisibleRatio = 0;
   if (geometry.targetRect.isEmpty()) {
     newThresholdIndex = geometry.doesIntersect ? 1 : 0;
   } else if (!geometry.doesIntersect) {
     newThresholdIndex = 0;
   } else {
     float intersectionArea =
         geometry.intersectionRect.size().width().toFloat() *
         geometry.intersectionRect.size().height().toFloat();
@@ skipping 26 matching lines @@
     target()->ensureIntersectionObserverData().removeObservation(observer());
   m_observer.clear();
 }
 
 DEFINE_TRACE(IntersectionObservation) {
   visitor->trace(m_observer);
   visitor->trace(m_target);
 }
 
 }  // namespace blink