Some usability ideas around SkTHash.

tests/ChecksumTest.cpp

 /*
  * Copyright 2012 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 "SkRandom.h"
 #include "Test.h"
@@ skipping 32 matching lines @@
         for (size_t j = 0; j < SK_ARRAY_COUNT(tweaked); ++j) {
             const uint32_t saved = tweaked[j];
             tweaked[j] = rand.nextU();
             const uint32_t tweakedHash = algorithm(tweaked, kBytes);
             ASSERT(tweakedHash != hash);
             ASSERT(tweakedHash == algorithm(tweaked, kBytes));
             tweaked[j] = saved;
         }
     }
 }
+
+DEF_TEST(GoodHash, r) {
+    ASSERT(SkGoodHash(( int32_t)4) ==  614249093);  // 4 bytes.  Hits SkChecksum::Mix fast path.
+    ASSERT(SkGoodHash((uint32_t)4) ==  614249093);  // (Ditto)
+
+    // None of these are 4 byte sized, so they use SkChecksum::Murmur3, not SkChecksum::Mix.
+    ASSERT(SkGoodHash((uint64_t)4) == 3491892518);
+    ASSERT(SkGoodHash((uint16_t)4) ==  899251846);
+    ASSERT(SkGoodHash( (uint8_t)4) ==  962700458);
+
+    // Tests SkString is correctly specialized.
+    ASSERT(SkGoodHash(SkString("Hi")) == 55667557);
+}