Style bikeshed - remove extraneous whitespace

tools/sk_tool_utils.h

 /*
  * Copyright 2014 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef sk_tool_utils_DEFINED
 #define sk_tool_utils_DEFINED
 
@@ skipping 149 matching lines @@
                 }
             }
 
             return true;
         }
 
         // The following 7 methods are needed by the topological sort
         static void SetTempMark(TopoTestNode* node) { node->fTempMark = true; }
         static void ResetTempMark(TopoTestNode* node) { node->fTempMark = false; }
         static bool IsTempMarked(TopoTestNode* node) { return node->fTempMark; }
-        static void Output(TopoTestNode* node, int outputPos) { 
+        static void Output(TopoTestNode* node, int outputPos) {
             SkASSERT(-1 != outputPos);
-            node->fOutputPos = outputPos; 
+            node->fOutputPos = outputPos;
         }
         static bool WasOutput(TopoTestNode* node) { return (-1 != node->fOutputPos); }
         static int NumDependencies(TopoTestNode* node) { return node->fDependencies.count(); }
-        static TopoTestNode* Dependency(TopoTestNode* node, int index) { 
+        static TopoTestNode* Dependency(TopoTestNode* node, int index) {
             return node->fDependencies[index];
         }
 
         // Helper functions for TopoSortBench & TopoSortTest
         static void AllocNodes(SkTDArray<TopoTestNode*>* graph, int num) {
             graph->setReserve(num);
 
             for (int i = 0; i < num; ++i) {
                 *graph->append() = new TopoTestNode(i);
             }
@@ skipping 29 matching lines @@
         int  fID;
         int  fOutputPos;
         bool fTempMark;
 
         SkTDArray<TopoTestNode*> fDependencies;
     };
 
 }  // namespace sk_tool_utils
 
 #endif  // sk_tool_utils_DEFINED