Move GrTMultiMap to src/core and rename it

src/core/SkTMultiMap.h

 
 /*
  * Copyright 2013 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
-#ifndef GrTMultiMap_DEFINED
-#define GrTMultiMap_DEFINED
+#ifndef SkTMultiMap_DEFINED
+#define SkTMultiMap_DEFINED
 
 #include "GrTypes.h"
 #include "SkTDynamicHash.h"
 
 /** A set that contains pointers to instances of T. Instances can be looked up with key Key.
  * Multiple (possibly same) values can have the same key.
  */
 template <typename T,
           typename Key,
           typename HashTraits=T>
-class GrTMultiMap {
+class SkTMultiMap {
     struct ValueList {
         explicit ValueList(T* value) : fValue(value), fNext(NULL) {}
 
         static const Key& GetKey(const ValueList& e) { return HashTraits::GetKey(*e.fValue); }
         static uint32_t Hash(const Key& key) { return HashTraits::Hash(key); }
         T* fValue;
         ValueList* fNext;
     };
 public:
-    GrTMultiMap() : fCount(0) {}
+    SkTMultiMap() : fCount(0) {}
 
-    ~GrTMultiMap() {
+    ~SkTMultiMap() {
         SkASSERT(fCount == 0);
         SkASSERT(fHash.count() == 0);
     }
 
     void insert(const Key& key, T* value) {
         ValueList* list = fHash.find(key);
         if (NULL != list) {
             // The new ValueList entry is inserted as the second element in the
             // linked list, and it will contain the value of the first element.
             ValueList* newEntry = SkNEW_ARGS(ValueList, (list->fValue));
@@ skipping 57 matching lines @@
     }
 
     int count() const { return fCount; }
 
 private:
     SkTDynamicHash<ValueList, Key> fHash;
     int fCount;
 };
 
 #endif