Align base::hash_map with C++11, part 2.

base/containers/small_map_unittest.cc

 // Copyright (c) 2012 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 "base/containers/small_map.h"
 
 #include <stddef.h>
 
 #include <algorithm>
 #include <functional>
@@ skipping 396 matching lines @@
   SmallMap<hash_map<int, int> > hm;
   EXPECT_EQ(0u, hm.size());
   SmallMap<std::map<int, int> > m;
   EXPECT_EQ(0u, m.size());
 }
 
 namespace {
 
 class hash_map_add_item : public hash_map<int, int> {
  public:
-  hash_map_add_item() : hash_map<int, int>() {}
-  explicit hash_map_add_item(const std::pair<int, int>& item)
-      : hash_map<int, int>() {
+  hash_map_add_item() {}
+  explicit hash_map_add_item(const std::pair<int, int>& item) {
     insert(item);
   }
 };
 
 void InitMap(ManualConstructor<hash_map_add_item>* map_ctor) {
   map_ctor->Init(std::make_pair(0, 0));
 }
 
 class hash_map_add_item_initializer {
  public:
@@ skipping 44 matching lines @@
   EXPECT_EQ(4u, m.size());
   EXPECT_EQ(0u, m.count(-1));
 
   m[5] = 5;
   EXPECT_EQ(6u, m.size());
   // Our functor adds an extra item when we convert to a map.
   EXPECT_EQ(1u, m.count(-1));
 }
 
 }  // namespace base