Fix cpplint errors in cc/(animation|input|layers|trees|test)/

cc/trees/layer_sorter.cc

 // Copyright 2011 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "cc/trees/layer_sorter.h"
 
 #include <algorithm>
 #include <deque>
 #include <limits>
 #include <vector>
@@ skipping 236 matching lines @@
 
   float d = gfx::DotProduct(layer_normal, z_axis);
   float n = -gfx::DotProduct(layer_normal, w);
 
   // Check if layer is parallel to the z = 0 axis which will make it
   // invisible and hence returning zero is fine.
   if (!d)
     return 0.f;
 
   // The intersection point would be given by:
-  // p + (n / d) * u  but since we are only interested in the 
+  // p + (n / d) * u  but since we are only interested in the
   // z coordinate and p's z coord is zero, all we need is the value of n/d.
   return n / d;
 }
 
 void LayerSorter::CreateGraphNodes(LayerList::iterator first,
                                    LayerList::iterator last) {
   DVLOG(2) << "Creating graph nodes:";
   float min_z = FLT_MAX;
   float max_z = -FLT_MAX;
   for (LayerList::const_iterator it = first; it < last; it++) {
@@ skipping 116 matching lines @@
 
   // Find all the nodes that don't have incoming edges.
   for (NodeList::iterator la = nodes_.begin(); la < nodes_.end(); la++) {
     if (!la->incoming.size())
       no_incoming_edge_node_list.push_back(&(*la));
   }
 
   DVLOG(2) << "Sorted list: ";
   while (active_edges_.size() || no_incoming_edge_node_list.size()) {
     while (no_incoming_edge_node_list.size()) {
-
       // It is necessary to preserve the existing ordering of layers, when there
       // are no explicit dependencies (because this existing ordering has
       // correct z-index/layout ordering). To preserve this ordering, we process
       // Nodes in the same order that they were added to the list.
       GraphNode* from_node = no_incoming_edge_node_list.front();
       no_incoming_edge_node_list.pop_front();
 
       // Add it to the final list.
       sorted_list.push_back(from_node);
 
@@ skipping 54 matching lines @@
     *it = sorted_list[count++]->layer;
 
   DVLOG(2) << "Sorting end ----";
 
   nodes_.clear();
   edges_.clear();
   active_edges_.clear();
 }
 
 }  // namespace cc