commit f6de475e5cbd143f348ff7738919e397b7fe7f57
author tfarina@chromium.org <tfarina@chromium.org@2bbb7eff-a529-9590-31e7-b0007b416f81> Sat Aug 17 00:02:59 2013 +0000
committer tfarina@chromium.org <tfarina@chromium.org@2bbb7eff-a529-9590-31e7-b0007b416f81> Sat Aug 17 00:02:59 2013 +0000
tree 8d8a123db2adbd7cbe6b55651b1c9117d6eafdb8
parent 069975678aaca6dc767e9fef3d743694443223f1

Replace uses of GrAssert by SkASSERT.

R=bsalomon@google.com

Review URL: https://codereview.chromium.org/22850006

git-svn-id: http://skia.googlecode.com/svn/trunk@10789 2bbb7eff-a529-9590-31e7-b0007b416f81

src/gpu/GrTHashCache.h

diff --git a/src/gpu/GrTHashCache.h b/src/gpu/GrTHashCache.h
index 6bd58c2..01b08e7 100644
--- a/src/gpu/GrTHashCache.h
+++ b/src/gpu/GrTHashCache.h
@@ -108,7 +108,7 @@
     if (Key::EQ(*array[high], key)) {
         // above search should have found the first occurrence if there
         // are multiple.
-        GrAssert(0 == high || Key::LT(*array[high - 1], key));
+        SkASSERT(0 == high || Key::LT(*array[high - 1], key));
         return high;
     }
 
@@ -147,7 +147,7 @@
 
     // above search should have found the first occurrence if there
     // are multiple.
-    GrAssert(0 == index || Key::LT(*array[index - 1], key));
+    SkASSERT(0 == index || Key::LT(*array[index - 1], key));
 
     for ( ; index < count() && Key::EQ(*array[index], key); ++index) {
         if (findFunc(fSorted[index])) {
@@ -184,14 +184,14 @@
 
     // remove from our sorted array
     index = this->searchArray(key);
-    GrAssert(index >= 0);
+    SkASSERT(index >= 0);
     // if there are multiple matches searchArray will give us the first match
     // march forward until we find elem.
     while (elem != fSorted[index]) {
         ++index;
-        GrAssert(index < fSorted.count());
+        SkASSERT(index < fSorted.count());
     }
-    GrAssert(elem == fSorted[index]);
+    SkASSERT(elem == fSorted[index]);
     fSorted.remove(index);
 }
 
@@ -230,7 +230,7 @@
 void GrTHashTable<T, Key, kHashBits>::validate() const {
     int count = fSorted.count();
     for (int i = 1; i < count; i++) {
-        GrAssert(Key::LT(*fSorted[i - 1], *fSorted[i]) ||
+        SkASSERT(Key::LT(*fSorted[i - 1], *fSorted[i]) ||
                  Key::EQ(*fSorted[i - 1], *fSorted[i]));
     }
 }