Replace uses of hash_map in //base

base/stl_util.h

 // Copyright (c) 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.
 
 // Derived from google3/util/gtl/stl_util.h
 
 #ifndef BASE_STL_UTIL_H_
 #define BASE_STL_UTIL_H_
 
 #include <algorithm>
@@ skipping 58 matching lines @@
 // As of 2006-04, there is no standard-blessed way of getting a
 // mutable reference to a string's internal buffer. However, issue 530
 // (http://www.open-std.org/JTC1/SC22/WG21/docs/lwg-active.html#530)
 // proposes this as the method. According to Matt Austern, this should
 // already work on all current implementations.
 inline char* string_as_array(std::string* str) {
   // DO NOT USE const_cast<char*>(str->data())
   return str->empty() ? NULL : &*str->begin();
 }
 
-// Test to see if a set, map, hash_set or hash_map contains a particular key.
+// Test to see if a set or map contains a particular key.
 // Returns true if the key is in the collection.
 template <typename Collection, typename Key>
 bool ContainsKey(const Collection& collection, const Key& key) {
   return collection.find(key) != collection.end();
 }
 
 // Test to see if a collection like a vector contains a particular value.
 // Returns true if the value is in the collection.
 template <typename Collection, typename Value>
 bool ContainsValue(const Collection& collection, const Value& value) {
@@ skipping 193 matching lines @@
           class Allocator,
           class Predicate>
 void EraseIf(std::unordered_multiset<Key, Hash, KeyEqual, Allocator>& container,
              Predicate pred) {
   internal::IterateAndEraseIf(container, pred);
 }
 
 }  // namespace base
 
 #endif  // BASE_STL_UTIL_H_