SkTDynamicHash: remove need for Equals(const T&, const Key&) param.

tests/DynamicHashTest.cpp

 /*
  * Copyright 2013 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "SkTDynamicHash.h"
 #include "Test.h"
 
 namespace {
 
 struct Entry {
     int key;
     double value;
 };
 
 const int& GetKey(const Entry& entry) { return entry.key; }
 uint32_t GetHash(const int& key) { return key; }
-bool AreEqual(const Entry& entry, const int& key) { return entry.key == key; }
 
-class Hash : public SkTDynamicHash<Entry, int, GetKey, GetHash, AreEqual> {
+class Hash : public SkTDynamicHash<Entry, int, GetKey, GetHash> {
 public:
     Hash() : INHERITED() {}
 
     // Promote protected methods to public for this test.
     int capacity() const { return this->INHERITED::capacity(); }
     int countCollisions(const int& key) const { return this->INHERITED::countCollisions(key); }
 
 private:
-    typedef SkTDynamicHash<Entry, int, GetKey, GetHash, AreEqual> INHERITED;
+    typedef SkTDynamicHash<Entry, int, GetKey, GetHash> INHERITED;
 };
 
 }  // namespace
 
 #define ASSERT(x) REPORTER_ASSERT(reporter, x)
 
 DEF_TEST(DynamicHash_growth, reporter) {
     Entry a = { 1, 2.0 };
     Entry b = { 2, 3.0 };
     Entry c = { 3, 4.0 };
@@ skipping 134 matching lines @@
     for (Hash::Iter iter(&hash); !iter.done(); ++iter) {
         int key = (*iter).key;
         keys[count] = key;
         ASSERT(key != 1);
         ASSERT(hash.find(key) != NULL);
         ++count;
     }
     ASSERT(2 == count);
     ASSERT(keys[0] != keys[1]);
 }