reflow comments in platform/geometry

third_party/WebKit/Source/platform/geometry/Region.cpp

 /*
  * Copyright (C) 2010, 2011 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
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 113 matching lines @@
     int aY = aSpan->y;
     int aMaxY = (aSpan + 1)->y;
     int bY = bSpan->y;
     int bMaxY = (bSpan + 1)->y;
 
     Shape::SegmentIterator aSegment = aShape.segmentsBegin(aSpan);
     Shape::SegmentIterator aSegmentEnd = aShape.segmentsEnd(aSpan);
     Shape::SegmentIterator bSegment = bShape.segmentsBegin(bSpan);
     Shape::SegmentIterator bSegmentEnd = bShape.segmentsEnd(bSpan);
 
-    // Look for a non-overlapping part of the spans. If B had a segment in its previous span, then we already tested A against B within that span.
+    // Look for a non-overlapping part of the spans. If B had a segment in its
+    // previous span, then we already tested A against B within that span.
     bool aHasSegmentInSpan = aSegment != aSegmentEnd;
     bool bHasSegmentInSpan = bSegment != bSegmentEnd;
     if (aY < bY && !bHadSegmentInPreviousSpan && aHasSegmentInSpan &&
         CompareOperation::aOutsideB(result))
       return result;
     if (bY < aY && !aHadSegmentInPreviousSpan && bHasSegmentInSpan &&
         CompareOperation::bOutsideA(result))
       return result;
 
     aHadSegmentInPreviousSpan = aHasSegmentInSpan;
@@ skipping 298 matching lines @@
     int flag = 0;
     int oldFlag = 0;
 
     SegmentIterator s1 = segments1;
     SegmentIterator s2 = segments2;
 
     // Clear vector without dropping capacity.
     segments.resize(0);
     ASSERT(segments.capacity());
 
-    // Now iterate over the segments in each span and construct a new vector of segments.
+    // Now iterate over the segments in each span and construct a new vector of
+    // segments.
     while (s1 != segments1End && s2 != segments2End) {
       int test = *s1 - *s2;
       int x;
 
       if (test <= 0) {
         x = *s1;
         flag = flag ^ 1;
         ++s1;
       }
       if (test >= 0) {
@@ skipping 121 matching lines @@
 void Region::unite(const Region& region) {
   if (region.isEmpty())
     return;
   if (isRect() && m_bounds.contains(region.m_bounds))
     return;
   if (region.isRect() && region.m_bounds.contains(m_bounds)) {
     m_shape = region.m_shape;
     m_bounds = region.m_bounds;
     return;
   }
-  // FIXME: We may want another way to construct a Region without doing this test when we expect it to be false.
+  // FIXME: We may want another way to construct a Region without doing this
+  // test when we expect it to be false.
   if (!isRect() && contains(region))
     return;
 
   Shape unitedShape = Shape::unionShapes(m_shape, region.m_shape);
 
   m_shape.swap(unitedShape);
   m_bounds.unite(region.m_bounds);
 }
 
 void Region::subtract(const Region& region) {
   if (m_bounds.isEmpty())
     return;
   if (region.isEmpty())
     return;
   if (!m_bounds.intersects(region.m_bounds))
     return;
 
   Shape subtractedShape = Shape::subtractShapes(m_shape, region.m_shape);
 
   m_shape.swap(subtractedShape);
   m_bounds = m_shape.bounds();
 }
 
 void Region::translate(const IntSize& offset) {
   m_bounds.move(offset);
   m_shape.translate(offset);
 }
 
 }  // namespace blink