}
    return result;
  }

  // Fingerprint2011

  @Benchmark
  byte fingerprintHashFunction(int reps) {
    return runHashFunction(reps, Hashing.fingerprint2011());
  }

  @Benchmark
  byte fingerprintChecksum(int reps) throws Exception {
    byte result = 0x01;
    for (int i = 0; i < reps; i++) {
      HashCode checksum = new Fingerprint2011().hashBytes(testBytes, 0, testBytes.length);

    byte[] bytes = "test".getBytes(UTF_8);
    assertEquals(
        1618900948208871284L, Fingerprint2011.murmurHash64WithSeed(bytes, 0, bytes.length, 1));

    bytes = "test test test".getBytes(UTF_8);
    assertEquals(
        UnsignedLong.valueOf("12313169684067793560").longValue(),
        Fingerprint2011.murmurHash64WithSeed(bytes, 0, bytes.length, 1));
  }

  public void testPutNonChars() {

    }
    return result;
  }

  // Fingerprint2011

  @Benchmark
  byte fingerprintHashFunction(int reps) {
    return runHashFunction(reps, Hashing.fingerprint2011());
  }

  @Benchmark
  byte fingerprintChecksum(int reps) throws Exception {
    byte result = 0x01;
    for (int i = 0; i < reps; i++) {
      HashCode checksum = new Fingerprint2011().hashBytes(testBytes, 0, testBytes.length);

    HashTestUtils.check2BitAvalanche(Hashing.fingerprint2011(), 100, 0.4);
    HashTestUtils.checkAvalanche(Hashing.fingerprint2011(), 100, 0.4);
    HashTestUtils.checkNo2BitCharacteristics(Hashing.fingerprint2011());
    HashTestUtils.checkNoFunnels(Hashing.fingerprint2011());
    HashTestUtils.assertInvariants(Hashing.fingerprint2011());
    assertEquals("Hashing.fingerprint2011()", Hashing.fingerprint2011().toString());
  }

   * <a href="https://en.wikipedia.org/wiki/Hash_function">hash function</a>.
   *
   * @since 31.1
   */
  public static HashFunction fingerprint2011() {
    return Fingerprint2011.FINGERPRINT_2011;
  }

  /**
   * Assigns to {@code hashCode} a "bucket" in the range {@code [0, buckets)}, in a uniform manner