SkTHash: remove()

tests/HashTest.cpp

 /*
  * Copyright 2015 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "SkChecksum.h"
 #include "SkString.h"
 #include "SkTHash.h"
@@ skipping 34 matching lines @@
         double* found = map.find(i);;
         REPORTER_ASSERT(r, found);
         REPORTER_ASSERT(r, *found == i*2.0);
     }
     for (int i = N; i < 2*N; i++) {
         REPORTER_ASSERT(r, !map.find(i));
     }
 
     REPORTER_ASSERT(r, map.count() == N);
 
+    for (int i = 0; i < N/2; i++) {
+        map.remove(i);
+    }
+    for (int i = 0; i < N; i++) {
+        double* found = map.find(i);
+        REPORTER_ASSERT(r, (found == nullptr) ==  (i < N/2));
+    }
+    REPORTER_ASSERT(r, map.count() == N/2);
+
     map.reset();
     REPORTER_ASSERT(r, map.count() == 0);
 }
 
 DEF_TEST(HashSet, r) {
     SkTHashSet<SkString> set;
 
     set.add(SkString("Hello"));
     set.add(SkString("World"));
 
     REPORTER_ASSERT(r, set.count() == 2);
 
     REPORTER_ASSERT(r, set.contains(SkString("Hello")));
     REPORTER_ASSERT(r, set.contains(SkString("World")));
     REPORTER_ASSERT(r, !set.contains(SkString("Goodbye")));
 
     REPORTER_ASSERT(r, set.find(SkString("Hello")));
     REPORTER_ASSERT(r, *set.find(SkString("Hello")) == SkString("Hello"));
 
+    set.remove(SkString("Hello"));
+    REPORTER_ASSERT(r, !set.contains(SkString("Hello")));
+    REPORTER_ASSERT(r, set.count() == 1);
+
     set.reset();
     REPORTER_ASSERT(r, set.count() == 0);
 }
 
 namespace {
 
 class CopyCounter {
 public:
     CopyCounter() : fID(0), fCounter(NULL) {}
 
@@ skipping 46 matching lines @@
     set.add(copyCounter2);
     REPORTER_ASSERT(r, globalCounter == 3);
     REPORTER_ASSERT(r, set.contains(copyCounter1));
     REPORTER_ASSERT(r, set.contains(copyCounter2));
     REPORTER_ASSERT(r, globalCounter == 3);
     set.add(copyCounter1);
     set.add(copyCounter2);
     // We allow copies for same-value adds for now.
     REPORTER_ASSERT(r, globalCounter == 5);
 }