reflow comments in platform/geometry

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

 /*
  * Copyright (C) 2013 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 56 matching lines @@
   polygon.overlappingEdges(minY, maxY, result);
   std::sort(result.begin(), result.end(), compareEdgeIndex);
   return result;
 }
 
 }  // anonymous namespace
 
 #define SIZEOF_ARRAY(p) (sizeof(p) / sizeof(p[0]))
 
 /**
- * Checks a right triangle. This test covers all of the trivial FloatPolygon accessors.
+ * Checks a right triangle. This test covers all of the trivial FloatPolygon
+ * accessors.
  *
  *                        200,100
  *                          /|
  *                         / |
  *                        /  |
  *                       -----
  *                 100,200   200,200
  */
 TEST(FloatPolygonTest, basics) {
   const float triangleCoordinates[] = {200, 100, 200, 200, 100, 200};
@@ skipping 162 matching lines @@
   TEST_EMPTY(emptyCoordinates4);
 
   const float emptyCoordinates5[] = {0, 0, 0, 1, 0, 2, 0, 3, 0, 1};
   TEST_EMPTY(emptyCoordinates5);
 
   const float emptyCoordinates6[] = {0, 0, 1, 0, 2, 0, 3, 0, 1, 0};
   TEST_EMPTY(emptyCoordinates6);
 }
 
 /*
- * Test FloatPolygon::contains() with a trapezoid. The vertices are listed in counter-clockwise order.
+ * Test FloatPolygon::contains() with a trapezoid. The vertices are listed in
+ * counter-clockwise order.
  *
  *        150,100   250,100
  *          +----------+
  *         /            \
  *        /              \
  *       +----------------+
  *     100,150          300,150
  */
 TEST(FloatPolygonTest, trapezoid) {
   const float trapezoidCoordinates[] = {100, 150, 300, 150, 250, 100, 150, 100};
   FloatPolygonTestValue trapezoidTestValue(
       trapezoidCoordinates, SIZEOF_ARRAY(trapezoidCoordinates), RULE_EVENODD);
   const FloatPolygon& trapezoid = trapezoidTestValue.polygon();
 
   EXPECT_FALSE(trapezoid.isEmpty());
   EXPECT_EQ(4u, trapezoid.numberOfVertices());
   EXPECT_EQ(FloatRect(100, 100, 200, 50), trapezoid.boundingBox());
 
   EXPECT_TRUE(trapezoid.contains(FloatPoint(150, 100)));
   EXPECT_TRUE(trapezoid.contains(FloatPoint(150, 101)));
   EXPECT_TRUE(trapezoid.contains(FloatPoint(200, 125)));
   EXPECT_FALSE(trapezoid.contains(FloatPoint(149, 100)));
   EXPECT_FALSE(trapezoid.contains(FloatPoint(301, 150)));
 }
 
 /*
- * Test FloatPolygon::contains() with a non-convex rectilinear polygon. The polygon has the same shape
- * as the letter "H":
+ * Test FloatPolygon::contains() with a non-convex rectilinear polygon. The
+ * polygon has the same shape as the letter "H":
  *
  *    100,100  150,100   200,100   250,100
  *       +--------+        +--------+
  *       |        |        |        |
  *       |        |        |        |
  *       |        +--------+        |
  *       |     150,150   200,150    |
  *       |                          |
  *       |     150,200   200,200    |
  *       |        +--------+        |
@@ skipping 29 matching lines @@
   EXPECT_FALSE(h.contains(FloatPoint(151, 100)));
   EXPECT_FALSE(h.contains(FloatPoint(199, 100)));
   EXPECT_FALSE(h.contains(FloatPoint(175, 125)));
   EXPECT_FALSE(h.contains(FloatPoint(151, 250)));
   EXPECT_FALSE(h.contains(FloatPoint(199, 250)));
   EXPECT_FALSE(h.contains(FloatPoint(199, 250)));
   EXPECT_FALSE(h.contains(FloatPoint(175, 225)));
 }
 
 }  // namespace blink