Remove uses of base::hash_map from //chrome

chrome/browser/sync_file_system/drive_backend/metadata_database_unittest.cc

 // Copyright 2013 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 "chrome/browser/sync_file_system/drive_backend/metadata_database.h"
 
 #include <stdint.h>
 
 #include <unordered_map>
 #include <utility>
@@ skipping 86 matching lines @@
 template <typename Container>
 void ExpectEquivalentMaps(const Container& left, const Container& right);
 
 template <typename Key, typename Value>
 void ExpectEquivalent(const std::map<Key, Value>& left,
                       const std::map<Key, Value>& right) {
   ExpectEquivalentMaps(left, right);
 }
 
 template <typename Key, typename Value>
-void ExpectEquivalent(const base::hash_map<Key, Value>& left,
-                      const base::hash_map<Key, Value>& right) {
+void ExpectEquivalent(const std::unordered_map<Key, Value>& left,
+                      const std::unordered_map<Key, Value>& right) {
   // Convert from a hash container to an ordered container for comparison.
   ExpectEquivalentMaps(std::map<Key, Value>(left.begin(), left.end()),
                        std::map<Key, Value>(right.begin(), right.end()));
 }
 
 template <typename Key, typename Value>
 void ExpectEquivalent(
     const std::unordered_map<Key, std::unique_ptr<Value>>& left,
     const std::unordered_map<Key, std::unique_ptr<Value>>& right) {
   // Convert from a hash container to an ordered container for comparison.
@@ skipping 10 matching lines @@
 template <typename Container>
 void ExpectEquivalentSets(const Container& left, const Container& right);
 
 template <typename Value, typename Comparator>
 void ExpectEquivalent(const std::set<Value, Comparator>& left,
                       const std::set<Value, Comparator>& right) {
   return ExpectEquivalentSets(left, right);
 }
 
 template <typename Value>
-void ExpectEquivalent(const base::hash_set<Value>& left,
-                      const base::hash_set<Value>& right) {
+void ExpectEquivalent(const std::unordered_set<Value>& left,
+                      const std::unordered_set<Value>& right) {
   // Convert from a hash container to an ordered container for comparison.
   return ExpectEquivalentSets(std::set<Value>(left.begin(), left.end()),
                               std::set<Value>(right.begin(), right.end()));
 }
 
 void ExpectEquivalent(const TrackerIDSet& left,
                       const TrackerIDSet& right) {
   {
     SCOPED_TRACE("Expect equivalent active_tracker");
     EXPECT_EQ(left.active_tracker(), right.active_tracker());
@@ skipping 1017 matching lines @@
   EXPECT_TRUE(file->HasKey("details"));
 
   ASSERT_TRUE(files->GetDictionary(1, &file));
   EXPECT_TRUE(file->GetString("title", &str) && str == "file_0");
   EXPECT_TRUE(file->GetString("type", &str) && str == "file");
   EXPECT_TRUE(file->HasKey("details"));
 }
 
 }  // namespace drive_backend
 }  // namespace sync_file_system