Rename base/hash_tables to base/containers/hash_tables.

net/base/linked_hash_map.h

 // Copyright (c) 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.
 //
 // This is a simplistic insertion-ordered map.  It behaves similarly to an STL
 // map, but only implements a small subset of the map's methods.  Internally, we
 // just keep a map and a list going in parallel.
 //
 // This class provides no thread safety guarantees, beyond what you would
 // normally see with std::list.
 //
 // Iterators should be stable in the face of mutations, except for an
 // iterator pointing to an element that was just deleted.
 
 #ifndef UTIL_GTL_LINKED_HASH_MAP_H_
 #define UTIL_GTL_LINKED_HASH_MAP_H_
 
 #include <list>
 #include <utility>
 
-#include "base/hash_tables.h"
+#include "base/containers/hash_tables.h"
 #include "base/logging.h"
 
 // This holds a list of pair<Key, Value> items.  This list is what gets
 // traversed, and it's iterators from this list that we return from
 // begin/end/find.
 //
 // We also keep a map<Key, list::iterator> for find.  Since std::list is a
 // doubly-linked list, the iterators should remain stable.
 template<class Key, class Value>
 class linked_hash_map {
@@ skipping 169 matching lines @@
 
  private:
   // The map component, used for speedy lookups
   MapType map_;
 
   // The list component, used for maintaining insertion order
   ListType list_;
 };
 
 #endif  // UTIL_GTL_LINKED_HASH_MAP_H_