storage: Use stl utilities from the base namespace

storage/browser/blob/blob_storage_registry.cc

 // Copyright 2015 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 "storage/browser/blob/blob_storage_registry.h"
 
 #include <stddef.h>
 
 #include <memory>
 
@@ skipping 45 matching lines @@
 BlobStorageRegistry::~BlobStorageRegistry() {
   // Note: We don't bother calling the construction complete callbacks, as we
   // are only being destructed at the end of the life of the browser process.
   // So it shouldn't matter.
 }
 
 BlobStorageRegistry::Entry* BlobStorageRegistry::CreateEntry(
     const std::string& uuid,
     const std::string& content_type,
     const std::string& content_disposition) {
-  DCHECK(!ContainsKey(blob_map_, uuid));
+  DCHECK(!base::ContainsKey(blob_map_, uuid));
   std::unique_ptr<Entry> entry(new Entry(1, BlobState::PENDING));
   entry->content_type = content_type;
   entry->content_disposition = content_disposition;
   Entry* entry_ptr = entry.get();
   blob_map_.add(uuid, std::move(entry));
   return entry_ptr;
 }
 
 bool BlobStorageRegistry::DeleteEntry(const std::string& uuid) {
   return blob_map_.erase(uuid) == 1;
@@ skipping 31 matching lines @@
   URLMap::iterator found = url_to_uuid_.find(blob_url);
   if (found == url_to_uuid_.end())
     return false;
   if (uuid)
     uuid->assign(found->second);
   url_to_uuid_.erase(found);
   return true;
 }
 
 bool BlobStorageRegistry::IsURLMapped(const GURL& blob_url) const {
-  return ContainsKey(url_to_uuid_, blob_url);
+  return base::ContainsKey(url_to_uuid_, blob_url);
 }
 
 BlobStorageRegistry::Entry* BlobStorageRegistry::GetEntryFromURL(
     const GURL& url,
     std::string* uuid) {
   URLMap::iterator found =
       url_to_uuid_.find(BlobUrlHasRef(url) ? ClearBlobUrlRef(url) : url);
   if (found == url_to_uuid_.end())
     return nullptr;
   Entry* entry = GetEntry(found->second);
   if (entry && uuid)
     uuid->assign(found->second);
   return entry;
 }
 
 }  // namespace storage