Style bikeshed - remove extraneous whitespace

src/core/SkTDPQueue.h

 /*
  * Copyright 2015 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkTDPQueue_DEFINED
 #define SkTDPQueue_DEFINED
 
@@ skipping 16 matching lines @@
 class SkTDPQueue : public SkNoncopyable {
 public:
     SkTDPQueue() {}
 
     /** Number of items in the queue. */
     int count() const { return fArray.count(); }
 
     /** Gets the next item in the queue without popping it. */
     const T& peek() const { return fArray[0]; }
     T& peek() { return fArray[0]; }
-    
+
     /** Removes the next item. */
     void pop() {
         this->validate();
         SkDEBUGCODE(if (SkToBool(INDEX)) { *INDEX(fArray[0]) = -1; })
         if (1 == fArray.count()) {
             fArray.pop();
             return;
         }
 
         fArray[0] = fArray[fArray.count() - 1];
@@ skipping 79 matching lines @@
                 return percolated;
             }
             this->validate(index);
         } while (true);
     }
 
     void percolateDownIfNecessary(int index) {
         SkASSERT(index >= 0);
         do {
             int child = LeftOf(index);
-            
+
             if (child >= fArray.count()) {
                 // We're a leaf.
                 this->setIndex(index);
                 return;
             }
 
             if (child + 1 >= fArray.count()) {
                 // We only have a left child.
                 if (LESS(fArray[child], fArray[index])) {
                     SkTSwap(fArray[child], fArray[index]);
@@ skipping 33 matching lines @@
             int p = ParentOf(i);
             if (excludedIndex != p && excludedIndex != i) {
                 SkASSERT(!(LESS(fArray[i], fArray[p])));
                 SkASSERT(!SkToBool(INDEX) || *INDEX(fArray[i]) == i);
             }
         }
 #endif
     }
 
     SkTDArray<T> fArray;
-    
+
     typedef SkNoncopyable INHERITED;
 };
 
 #endif