reflow comments in platform/geometry

third_party/WebKit/Source/platform/geometry/IntRect.h

 /*
  * Copyright (C) 2003, 2006, 2009 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 70 matching lines @@
   int width() const { return m_size.width(); }
   int height() const { return m_size.height(); }
 
   void setX(int x) { m_location.setX(x); }
   void setY(int y) { m_location.setY(y); }
   void setWidth(int width) { m_size.setWidth(width); }
   void setHeight(int height) { m_size.setHeight(height); }
 
   bool isEmpty() const { return m_size.isEmpty(); }
 
-  // NOTE: The result is rounded to integer values, and thus may be not the exact
-  // center point.
+  // NOTE: The result is rounded to integer values, and thus may be not the
+  // exact center point.
   IntPoint center() const {
     return IntPoint(x() + width() / 2, y() + height() / 2);
   }
 
   void move(const IntSize& size) { m_location += size; }
   void moveBy(const IntPoint& offset) {
     m_location.move(offset.x(), offset.y());
   }
   void move(int dx, int dy) { m_location.move(dx, dy); }
   void saturatedMove(int dx, int dy) { m_location.saturatedMove(dx, dy); }
@@ skipping 37 matching lines @@
   }  // typically bottomLeft
   IntPoint maxXMaxYCorner() const {
     return IntPoint(m_location.x() + m_size.width(),
                     m_location.y() + m_size.height());
   }  // typically bottomRight
 
   bool intersects(const IntRect&) const;
   bool contains(const IntRect&) const;
 
   // This checks to see if the rect contains x,y in the traditional sense.
-  // Equivalent to checking if the rect contains a 1x1 rect below and to the right of (px,py).
+  // Equivalent to checking if the rect contains a 1x1 rect below and to the
+  // right of (px,py).
   bool contains(int px, int py) const {
     return px >= x() && px < maxX() && py >= y() && py < maxY();
   }
   bool contains(const IntPoint& point) const {
     return contains(point.x(), point.y());
   }
 
   void intersect(const IntRect&);
   void unite(const IntRect&);
   void uniteIfNonZero(const IntRect&);
 
-  // Besides non-empty rects, this method also unites empty rects (as points or line segments).
-  // For example, union of (100, 100, 0x0) and (200, 200, 50x0) is (100, 100, 150x100).
+  // Besides non-empty rects, this method also unites empty rects (as points or
+  // line segments).  For example, union of (100, 100, 0x0) and (200, 200, 50x0)
+  // is (100, 100, 150x100).
   void uniteEvenIfEmpty(const IntRect&);
 
   void inflateX(int dx) {
     m_location.setX(m_location.x() - dx);
     m_size.setWidth(m_size.width() + dx + dx);
   }
   void inflateY(int dy) {
     m_location.setY(m_location.y() - dy);
     m_size.setHeight(m_size.height() + dy + dy);
   }
@@ skipping 70 matching lines @@
 
 // Redeclared here to avoid ODR issues.
 // See platform/testing/GeometryPrinters.h.
 void PrintTo(const IntRect&, std::ostream*);
 
 }  // namespace blink
 
 WTF_ALLOW_MOVE_INIT_AND_COMPARE_WITH_MEM_FUNCTIONS(blink::IntRect);
 
 #endif  // IntRect_h