Convert //net and //chromecast to std::unordered_*

net/spdy/write_blocked_list.h

 // 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.
 
 #ifndef NET_SPDY_WRITE_BLOCKED_LIST_H_
 #define NET_SPDY_WRITE_BLOCKED_LIST_H_
 
 #include <stddef.h>
 
 #include <algorithm>
 #include <deque>
+#include <unordered_map>
 
-#include "base/containers/hash_tables.h"
 #include "base/logging.h"
 #include "net/spdy/spdy_protocol.h"
 
 namespace net {
 
 namespace test {
 class WriteBlockedListPeer;
 }  // namespace test
 
 template <typename IdType>
@@ skipping 120 matching lines @@
   }
 
   size_t NumBlockedStreams(SpdyPriority priority) const {
     priority = ClampPriority(priority);
     return write_blocked_lists_[priority].size();
   }
 
  private:
   friend class net::test::WriteBlockedListPeer;
 
-  typedef base::hash_map<IdType, SpdyPriority> StreamToPriorityMap;
+  using StreamToPriorityMap = std::unordered_map<IdType, SpdyPriority>;
 
   void AddStream(IdType stream_id, SpdyPriority priority, bool push_back) {
     priority = ClampPriority(priority);
     DVLOG(2) << "Adding stream " << stream_id << " at priority "
              << static_cast<int>(priority);
     bool should_insert_stream = true;
     typename StreamToPriorityMap::iterator iter =
         stream_to_priority_.find(stream_id);
     // Ensure the stream is not in the write blocked list multiple times.
     if (iter != stream_to_priority_.end()) {
@@ skipping 20 matching lines @@
       }
     }
   }
   BlockedList write_blocked_lists_[kV3LowestPriority + 1];
   StreamToPriorityMap stream_to_priority_;
 };
 
 }  // namespace net
 
 #endif  // NET_SPDY_WRITE_BLOCKED_LIST_H_