Clang format slam.

net/spdy/hpack_entry.h

 // Copyright 2014 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.
 
 #ifndef NET_SPDY_HPACK_ENTRY_H_
 #define NET_SPDY_HPACK_ENTRY_H_
 
 #include <cstddef>
 #include <set>
 #include <string>
@@ skipping 15 matching lines @@
   // The constant amount added to name().size() and value().size() to
   // get the size of an HpackEntry as defined in 3.3.1.
   static const size_t kSizeOverhead;
 
   // Implements a total ordering of HpackEntry on name(), value(), then Index()
   // ascending. Note that Index() may change over the lifetime of an HpackEntry,
   // but the relative Index() order of two entries will not. This comparator is
   // composed with the 'lookup' HpackEntry constructor to allow for efficient
   // lower-bounding of matching entries.
   struct NET_EXPORT_PRIVATE Comparator {
-    bool operator() (const HpackEntry* lhs, const HpackEntry* rhs) const;
+    bool operator()(const HpackEntry* lhs, const HpackEntry* rhs) const;
   };
   typedef std::set<HpackEntry*, Comparator> OrderedSet;
 
   // Creates an entry. Preconditions:
   // - |is_static| captures whether this entry is a member of the static
   //   or dynamic header table.
   // - |insertion_index| is this entry's index in the total set of entries ever
   //   inserted into the header table (including static entries).
   // - |total_table_insertions_or_current_size| references an externally-
   //   updated count of either the total number of header insertions (if
@@ skipping 53 matching lines @@
   size_t insertion_index_;
 
   // If |is_static_|, references the current size of the headers table.
   // Else, references the total number of header insertions which have occurred.
   const size_t* total_insertions_or_size_;
 };
 
 }  // namespace net
 
 #endif  // NET_SPDY_HPACK_ENTRY_H_