cc: Use std::map instead of hash_map for TaskGraphRunner namespaces.

cc/resources/task_graph_runner.h

 // Copyright 2014 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 CC_RESOURCES_TASK_GRAPH_RUNNER_H_
 #define CC_RESOURCES_TASK_GRAPH_RUNNER_H_
 
+#include <map>
 #include <string>
 #include <vector>
 
-#include "base/containers/scoped_ptr_hash_map.h"
 #include "base/memory/ref_counted.h"
 #include "base/synchronization/condition_variable.h"
 #include "base/threading/simple_thread.h"
 #include "cc/base/cc_export.h"
 #include "cc/base/scoped_ptr_deque.h"
 
 namespace cc {
 namespace internal {
 
 class CC_EXPORT Task : public base::RefCountedThreadSafe<Task> {
@@ skipping 131 matching lines @@
     // Ordered set of tasks that are ready to run.
     PrioritizedTask::Vector ready_to_run_tasks;
 
     // Completed tasks not yet collected by origin thread.
     Task::Vector completed_tasks;
 
     // Number of currently running tasks.
     size_t num_running_tasks;
   };
 
-  typedef base::ScopedPtrHashMap<int, TaskNamespace> TaskNamespaceMap;
+  typedef std::map<int, TaskNamespace> TaskNamespaceMap;
 
   static bool CompareTaskPriority(const PrioritizedTask& a,
                                   const PrioritizedTask& b) {
     // In this system, numerically lower priority is run first.
     return a.priority > b.priority;
   }
 
   static bool CompareTaskNamespacePriority(const TaskNamespace* a,
                                            const TaskNamespace* b) {
     DCHECK(!a->ready_to_run_tasks.empty());
@@ skipping 56 matching lines @@
 
   ScopedPtrDeque<base::DelegateSimpleThread> workers_;
 
   DISALLOW_COPY_AND_ASSIGN(TaskGraphRunner);
 };
 
 }  // namespace internal
 }  // namespace cc
 
 #endif  // CC_RESOURCES_TASK_GRAPH_RUNNER_H_