Remove SkBitmapCache::Find/Add(_,width,height,_) in favor of using rect

src/core/SkBitmapCache.cpp

 /*
  * Copyright 2014 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "SkBitmapCache.h"
 #include "SkResourceCache.h"
 #include "SkMipMap.h"
@@ skipping 82 matching lines @@
                         const SkBitmap& result) {
     if (0 == invScaleX || 0 == invScaleY) {
         // degenerate, and the key we use for mipmaps
         return;
     }
     SkASSERT(result.isImmutable());
     SkResourceCache::Add(SkNEW_ARGS(BitmapRec, (src.getGenerationID(), invScaleX, invScaleY,
                                                 get_bounds_from_bitmap(src), result)));
 }
 
-bool SkBitmapCache::Find(uint32_t genID, int width, int height, SkBitmap* result) {
-    return Find(genID, SkIRect::MakeWH(width, height), result);
-}
-
-bool SkBitmapCache::Add(uint32_t genID, int width, int height, const SkBitmap& result) {
-    return Add(genID, SkIRect::MakeWH(width, height), result);
-}
-
 bool SkBitmapCache::Find(uint32_t genID, const SkIRect& subset, SkBitmap* result) {
     BitmapKey key(genID, SK_Scalar1, SK_Scalar1, subset);
     return find_and_return(key, result);
 }
 
 bool SkBitmapCache::Add(uint32_t genID, const SkIRect& subset, const SkBitmap& result) {
     SkASSERT(result.isImmutable());
 
     if (subset.isEmpty()
         || subset.top() < 0
@@ skipping 38 matching lines @@
     }
     return result;
 }
 
 void SkMipMapCache::Add(const SkBitmap& src, const SkMipMap* result) {
     if (result) {
         SkResourceCache::Add(SkNEW_ARGS(MipMapRec, (src, result)));
     }
 }