Replace use of GrTHashTable in GrFontCache with SkTDynamicHash.

src/core/SkTDynamicHash.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 SkTDynamicHash_DEFINED
 #define SkTDynamicHash_DEFINED
 
@@ skipping 117 matching lines @@
     }
 
     void reset() { 
         fCount = 0; 
         fDeleted = 0; 
         fCapacity = 0; 
         sk_free(fArray); 
         fArray = NULL; 
     }
 
+    void deleteAll() {

[mtklein, 2014/07/22 13:54:30]

I think you can do both of these just as easily from the outside with Iter.  I'd
be totally fine with these as helper standalone functions in this file that
operate on a SkTDynamicHash.  Just seems we don't need them as methods.

[jvanverth1, 2014/07/22 14:14:07]

Yup, just had that discussion here. Done.

+        int index = 0;
+        while (index < fCapacity) {
+            if (fArray[index] != Empty() && fArray[index] != Deleted()) {
+                SkDELETE(fArray[index]);
+            }
+            ++index;
+        }
+        this->reset();
+    }
+
+    void freeAll() {
+        int index = 0;
+        while (index < fCapacity) {
+            if (fArray[index] != Empty() && fArray[index] != Deleted()) {
+                sk_free(fArray[index]);
+            }
+            ++index;
+        }
+        this->reset();
+    }
+
 protected:
     // These methods are used by tests only.
 
     int capacity() const { return fCapacity; }
 
     // How many collisions do we go through before finding where this entry should be inserted?
     int countCollisions(const Key& key) const {
         int index = this->firstIndex(key);
         for (int round = 0; round < fCapacity; round++) {
             SkASSERT(index >= 0 && index < fCapacity);
@@ skipping 132 matching lines @@
     static const Key& GetKey(const T& t) { return Traits::GetKey(t); }
     static uint32_t Hash(const Key& key) { return Traits::Hash(key); }
 
     int fCount;     // Number of non Empty(), non Deleted() entries in fArray.
     int fDeleted;   // Number of Deleted() entries in fArray.
     int fCapacity;  // Number of entries in fArray.  Always a power of 2.
     T** fArray;
 };
 
 #endif