One SkTSearch to rule them all. Allow key to be of different type than the array.

src/core/SkBitmapHeap.h

 
 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #ifndef SkBitmapHeap_DEFINED
 #define SkBitmapHeap_DEFINED
 
@@ skipping 220 matching lines @@
         const uint32_t fWidth;
         const uint32_t fHeight;
 
         // TODO: Generalize the LRU caching mechanism
         LookupEntry* fMoreRecentlyUsed;
         LookupEntry* fLessRecentlyUsed;
 
         uint32_t fStorageSlot; // slot of corresponding bitmap in fStorage.
 
         /**
-         * Compare two LookupEntry pointers, returning -1, 0, 1 for sorting.
+         * Compare two LookupEntry pointers for sorting and searching.
          */
-        static int Compare(const LookupEntry* a, const LookupEntry* b);
+        static bool Less(const LookupEntry& a, const LookupEntry& b);
     };
 
     /**
      * Remove the entry from the lookup table. Also deletes the entry pointed
      * to by the table. Therefore, if a pointer to that one was passed in, the
      * pointer should no longer be used, since the object to which it points has
      * been deleted.
      * @return The index in the lookup table of the entry before removal.
      */
     int removeEntryFromLookupTable(LookupEntry*);
@@ skipping 44 matching lines @@
     const int32_t fOwnerCount;
     size_t fBytesAllocated;
 
     bool fDeferAddingOwners;
     SkTDArray<int> fDeferredEntries;
 
     typedef SkBitmapHeapReader INHERITED;
 };
 
 #endif // SkBitmapHeap_DEFINED