Speed up GrResourceCache lookup by inlining GrBinHashKey comparisons

tests/HashCacheTest.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 
 #include "Test.h"
 
@@ skipping 21 matching lines @@
         return elem->fValue < 0;
     }
 };
 
 class HashKey {
 public:
     HashKey(int key) : fKey(key) {}
 
     uint32_t getHash() const { return fKey; }
 
-    static bool LT(const HashElement& entry, const HashKey& key) {
+    static bool LessThan(const HashElement& entry, const HashKey& key) {
         return entry.fKey < key.fKey;
     }
-    static bool EQ(const HashElement& entry, const HashKey& key) {
+    static bool Equals(const HashElement& entry, const HashKey& key) {
         return entry.fKey == key.fKey;
     }
 
 #ifdef SK_DEBUG
-    static uint32_t GetHash(const HashElement& entry) {
-        return entry.fKey;
-    }
-    static bool LT(const HashElement& a, const HashElement& b) {
+    static bool LessThan(const HashElement& a, const HashElement& b) {
         return a.fKey < b.fKey;
     }
-    static bool EQ(const HashElement& a, const HashElement& b) {
+    static bool Equals(const HashElement& a, const HashElement& b) {
         return a.fKey == b.fKey;
     }
 #endif
 
 protected:
     int fKey;
 };
 
 ////////////////////////////////////////////////////////////////////////////////
 static void TestHashCache(skiatest::Reporter* reporter) {
@@ skipping 88 matching lines @@
         HashElement* found = cache.find(0);
         REPORTER_ASSERT(reporter, NULL == found);
     }
 }
 
 ////////////////////////////////////////////////////////////////////////////////
 #include "TestClassDef.h"
 DEFINE_TESTCLASS("HashCache", HashCacheTestClass, TestHashCache)
 
 #endif