Clang format slam.

net/quic/congestion_control/quic_max_sized_map.h

Index: net/quic/congestion_control/quic_max_sized_map.h
diff --git a/net/quic/congestion_control/quic_max_sized_map.h b/net/quic/congestion_control/quic_max_sized_map.h
index a4ed7769d61015fd7a607543226fdb6ac2245278..150ab56f65956f2374a05c48aa88b849801b02e3 100644
--- a/net/quic/congestion_control/quic_max_sized_map.h
+++ b/net/quic/congestion_control/quic_max_sized_map.h
@@ -23,16 +23,11 @@ class QuicMaxSizedMap {
   typedef typename std::multimap<Key, Value>::const_iterator ConstIterator;
 
   explicit QuicMaxSizedMap(size_t max_numer_of_items)
-      : max_numer_of_items_(max_numer_of_items) {
-  }
+      : max_numer_of_items_(max_numer_of_items) {}
 
-  size_t MaxSize() const {
-    return max_numer_of_items_;
-  }
+  size_t MaxSize() const { return max_numer_of_items_; }
 
-  size_t Size() const {
-    return table_.size();
-  }
+  size_t Size() const { return table_.size(); }
 
   void Insert(const Key& k, const Value& value) {
     if (Size() == MaxSize()) {
@@ -50,17 +45,11 @@ class QuicMaxSizedMap {
   }
 
   // STL style const_iterator support.
-  ConstIterator Find(const Key& k) const {
-    return table_.find(k);
-  }
+  ConstIterator Find(const Key& k) const { return table_.find(k); }
 
-  ConstIterator Begin() const {
-    return ConstIterator(table_.begin());
-  }
+  ConstIterator Begin() const { return ConstIterator(table_.begin()); }
 
-  ConstIterator End() const {
-    return ConstIterator(table_.end());
-  }
+  ConstIterator End() const { return ConstIterator(table_.end()); }
 
  private:
   typedef typename std::multimap<Key, Value>::iterator TableIterator;