reflow comments in platform/geometry

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

 /*
  * Copyright (C) 2012 Adobe Systems Incorporated. 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.
@@ skipping 68 matching lines @@
   typedef PODIntervalTree<float, FloatPolygonEdge*> EdgeIntervalTree;
 
   bool containsNonZero(const FloatPoint&) const;
   bool containsEvenOdd(const FloatPoint&) const;
 
   std::unique_ptr<Vector<FloatPoint>> m_vertices;
   WindRule m_fillRule;
   FloatRect m_boundingBox;
   bool m_empty;
   Vector<FloatPolygonEdge> m_edges;
-  EdgeIntervalTree
-      m_edgeTree;  // Each EdgeIntervalTree node stores minY, maxY, and a ("UserData") pointer to a FloatPolygonEdge.
+  EdgeIntervalTree m_edgeTree;  // Each EdgeIntervalTree node stores minY, maxY,
+                                // and a ("UserData") pointer to a
+                                // FloatPolygonEdge.
 };
 
 class PLATFORM_EXPORT VertexPair {
  public:
   virtual ~VertexPair() {}
 
   virtual const FloatPoint& vertex1() const = 0;
   virtual const FloatPoint& vertex2() const = 0;
 
   float minX() const { return std::min(vertex1().x(), vertex2().x()); }
@@ skipping 29 matching lines @@
     ASSERT(m_polygon && m_polygon->numberOfEdges() > 1);
     return m_polygon->edgeAt((m_edgeIndex + 1) % m_polygon->numberOfEdges());
   }
 
   const FloatPolygon* polygon() const { return m_polygon; }
   unsigned vertexIndex1() const { return m_vertexIndex1; }
   unsigned vertexIndex2() const { return m_vertexIndex2; }
   unsigned edgeIndex() const { return m_edgeIndex; }
 
  private:
-  // Edge vertex index1 is less than index2, except the last edge, where index2 is 0. When a polygon edge
-  // is defined by 3 or more colinear vertices, index2 can be the the index of the last colinear vertex.
+  // Edge vertex index1 is less than index2, except the last edge, where index2
+  // is 0. When a polygon edge is defined by 3 or more colinear vertices, index2
+  // can be the the index of the last colinear vertex.
   unsigned m_vertexIndex1;
   unsigned m_vertexIndex2;
   unsigned m_edgeIndex;
   const FloatPolygon* m_polygon;
 };
 
 // These structures are used by PODIntervalTree for debugging.
 #ifndef NDEBUG
 template <>
 struct ValueToString<float> {
   STATIC_ONLY(ValueToString);
   static String toString(const float value) { return String::number(value); }
 };
 
 template <>
 struct ValueToString<FloatPolygonEdge*> {
   STATIC_ONLY(ValueToString);
   static String toString(const FloatPolygonEdge* edge) {
     return String::format("%p (%f,%f %f,%f)", edge, edge->vertex1().x(),
                           edge->vertex1().y(), edge->vertex2().x(),
                           edge->vertex2().y());
   }
 };
 #endif
 
 }  // namespace blink
 
 #endif  // FloatPolygon_h