Style bikeshed - remove extraneous whitespace

tests/PathOpsConicLineIntersectionTest.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "PathOpsExtendedTest.h"
 #include "PathOpsTestCommon.h"
 #include "SkIntersections.h"
 #include "SkPathOpsConic.h"
 #include "SkPathOpsLine.h"
 #include "SkReduceOrder.h"
 #include "Test.h"
 
 static struct lineConic {
     SkDConic conic;
     SkDLine line;
     int result;
     SkDPoint expected[2];
 } lineConicTests[] = {
     {
      {{{{30.6499996,25.6499996}, {30.6499996,20.6499996}, {25.6499996,20.6499996}}}, 0.707107008f},
       {{{25.6499996,20.6499996}, {45.6500015,20.6499996}}},
-          1, 
+          1,
        {{25.6499996,20.6499996}, {0,0}}
     },
 };
 
 static size_t lineConicTests_count = SK_ARRAY_COUNT(lineConicTests);
 
 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line,
                        bool& flipped) {
     int result;
     flipped = false;
@@ skipping 58 matching lines @@
 }
 
 DEF_TEST(PathOpsConicLineIntersection, reporter) {
     for (size_t index = 0; index < lineConicTests_count; ++index) {
         int iIndex = static_cast<int>(index);
         const SkDConic& conic = lineConicTests[index].conic;
         SkASSERT(ValidConic(conic));
         const SkDLine& line = lineConicTests[index].line;
         SkASSERT(ValidLine(line));
         SkReduceOrder reducer;
-        SkPoint pts[3] = { conic.fPts.fPts[0].asSkPoint(), conic.fPts.fPts[1].asSkPoint(), 
+        SkPoint pts[3] = { conic.fPts.fPts[0].asSkPoint(), conic.fPts.fPts[1].asSkPoint(),
             conic.fPts.fPts[2].asSkPoint() };
         SkPoint reduced[3];
         SkPath::Verb order1 = SkReduceOrder::Conic(pts, conic.fWeight, reduced);
         if (order1 != SkPath::kConic_Verb) {
             SkDebugf("%s [%d] conic verb=%d\n", __FUNCTION__, iIndex, order1);
             REPORTER_ASSERT(reporter, 0);
         }
         int order2 = reducer.reduce(line);
         if (order2 < 2) {
             SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2);
@@ skipping 20 matching lines @@
             }
             if (!t1.approximatelyEqual(lineConicTests[index].expected[0])
                     && (lineConicTests[index].result == 1
                     || !t1.approximatelyEqual(lineConicTests[index].expected[1]))) {
                 SkDebugf("%s t1=(%1.9g,%1.9g)\n", __FUNCTION__, t1.fX, t1.fY);
                 REPORTER_ASSERT(reporter, 0);
             }
         }
     }
 }