Add SkTHashSet::find()

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"
 #include "Test.h"
 
 // Tests use of const foreach().  map.count() is of course the better way to do this.
 static int count(const SkTHashMap<int, double>& map) {
     int n = 0;
     map.foreach([&n](int, double) { n++; });
     return n;
@@ skipping 43 matching lines @@
 
     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.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);
 }