)]}'
{
  "commit": "24c27151be5afdcf58c03565e56d27f8a84e1407",
  "tree": "60fc95435433784a24c556db0b0eb2e576bc29d0",
  "parents": [
    "2c7ff3dc85e60e86d78283d46f7d1c8546a6aaca"
  ],
  "author": {
    "name": "Chris Povirk",
    "email": "cpovirk@google.com",
    "time": "Fri Oct 24 14:14:22 2014"
  },
  "committer": {
    "name": "Chris Povirk",
    "email": "cpovirk@google.com",
    "time": "Wed Oct 29 18:07:48 2014"
  },
  "message": "Remove the array copy from Fingerprint2011.hashBytes(byte[], int, int) method.\n\nConclusion: for hashFunctionWithOffset the improvements are visible in terms of bytes used, but also in terms of execution speed (before: 297,340; after: 173,506). Interestingly enough, there are small improvements for the hashBytes without offset version (before: 184,860; after: 164,804).\n-------------\nCreated by MOE: http://code.google.com/p/moe-java\nMOE_MIGRATED_REVID\u003d78433787\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "faeaee636c7f2c595aad6087106c3824c613dfb8",
      "old_mode": 33188,
      "old_path": "guava-tests/benchmark/com/google/common/hash/HashFunctionBenchmark.java",
      "new_id": "dbabd33f3238341075567a9a1fffe802be287e57",
      "new_mode": 33188,
      "new_path": "guava-tests/benchmark/com/google/common/hash/HashFunctionBenchmark.java"
    }
  ]
}