int result = 37;
    for (int i = 0; i < reps; i++) {
      result ^= hashFunction.newHasher().putBytes(testBytes).hash().asBytes()[0];
    }
    return result;
  }

  @Benchmark
  int hashFunction(int reps) {
    HashFunction hashFunction = hashFunctionEnum.getHashFunction();
    int result = 37;
    for (int i = 0; i < reps; i++) {

    public int hashCode() {
        int result = 17;

        result = 37 * result + getGroupId().hashCode();
        result = 37 * result + getArtifactId().hashCode();
        result = 37 * result + getType().hashCode();
        if (getVersion() != null) {
            result = 37 * result + getVersion().hashCode();
        }
        result = 37 * result + (getClassifier() != null ? getClassifier().hashCode() : 0);

    int result = 37;
    for (int i = 0; i < reps; i++) {
      result ^= hashFunction.newHasher().putBytes(testBytes).hash().asBytes()[0];
    }
    return result;
  }

  @Benchmark
  int hashFunction(int reps) {
    HashFunction hashFunction = hashFunctionEnum.getHashFunction();
    int result = 37;
    for (int i = 0; i < reps; i++) {

		{1 * time.Second, "my_download_url", "1 second before the latest release"},
		{37 * time.Second, "my_download_url", "37 seconds before the latest release"},
		{60 * time.Second, "my_download_url", "1 minute before the latest release"},
		{61 * time.Second, "my_download_url", "1 minute before the latest release"},

		// Testcase index 10
		{37 * time.Minute, "my_download_url", "37 minutes before the latest release"},

    if (length >= 8) {
      long mul = K2 + length * 2L;
      long a = load64(bytes, offset) + K2;
      long b = load64(bytes, offset + length - 8);
      long c = rotateRight(b, 37) * mul + a;
      long d = (rotateRight(a, 25) + b) * mul;
      return hashLength16(c, d, mul);
    }
    if (length >= 4) {
      long mul = K2 + length * 2;
      long a = load32(bytes, offset) & 0xFFFFFFFFL;

.846733093261719,40.732395172119141,2,1.15,5.5,1,0.5,0,0,,,7,2,1,196,95,green,0.00,3.9,0.0,37,26,7.83,1287,717.01,4,Queens,071701,4071701,I,QN18,Rego Park,4108,754,743,4,Queens,074300,4074300,E,QN17,Forest Hills,4108^3389319,2,2014-03-07 15:44:50,2014-03-07 16:01:37,N,1,-73.861984252929687,40.730457305908203,-73.828269958496094,40.711036682128906,6,2.57,12.5,0,0.5,0,0,,,13,2,1,196,134,green,0.00,3.9,0.0,37,26,7.83,1287,717.01,4,Queens,071701,4071701,I,QN18,Rego Park,4108,1872,775,4,Queens,077500,4077500,I,QN60,Kew...

    assertEquals(27, stats.evictionCount());
  }

  public void testMinus() {
    CacheStats one = new CacheStats(11, 13, 17, 19, 23, 27);
    CacheStats two = new CacheStats(53, 47, 43, 41, 37, 31);

    CacheStats diff = two.minus(one);
    assertEquals(76, diff.requestCount());
    assertEquals(42, diff.hitCount());
    assertEquals(42.0 / 76, diff.hitRate());
    assertEquals(34, diff.missCount());

3389229,2,2014-03-07 09:46:32,2014-03-07 09:55:01,N,1,-73.952301025390625,40.789798736572266,-73.935806274414062,40.794448852539063,1,1.67,8,0,0.5,2,0,,,10.5,1,1,75,74,green,0.00,3.9,0.0,37,26,7.83,1267,168,1,Manhattan,016800,1016800,E,MN33,East Harlem South,3804,1553...

    assertEquals(27, stats.evictionCount());
  }

  public void testMinus() {
    CacheStats one = new CacheStats(11, 13, 17, 19, 23, 27);
    CacheStats two = new CacheStats(53, 47, 43, 41, 37, 31);

    CacheStats diff = two.minus(one);
    assertEquals(76, diff.requestCount());
    assertEquals(42, diff.hitCount());
    assertEquals(42.0 / 76, diff.hitRate());
    assertEquals(34, diff.missCount());

    long c = rotateRight(a, 37);
    a += load64(bytes, offset + 8);
    c += rotateRight(a, 7);
    a += load64(bytes, offset + 16);
    long vf = a + z;
    long vs = b + rotateRight(a, 31) + c;
    a = load64(bytes, offset + 16) + load64(bytes, offset + length - 32);
    z = load64(bytes, offset + length - 8);
    b = rotateRight(a + z, 52);
    c = rotateRight(a, 37);
    a += load64(bytes, offset + length - 24);