import static java.lang.Long.rotateRight;

import com.google.common.annotations.VisibleForTesting;

/**
 * Implementation of Geoff Pike's fingerprint2011 hash function. See {@link Hashing#fingerprint2011}
 * for information on the behaviour of the algorithm.
 *
 * <p>On Intel Core2 2.66, on 1000 bytes, fingerprint2011 takes 0.9 microseconds compared to
 * fingerprint at 4.0 microseconds and md5 at 4.5 microseconds.
 *

    }
    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);