)]}'
{
  "commit": "21c76f4d2861122087c5f695f441bbd012c36f9d",
  "tree": "7ef22e646a84e5d1d052a8dada0d24d16bb689d0",
  "parents": [
    "fe8235a9799c0e6b0d49d1d46431e232ab26324d"
  ],
  "author": {
    "name": "Shawn O. Pearce",
    "email": "sop@google.com",
    "time": "Fri Jun 17 09:54:49 2011 -0700"
  },
  "committer": {
    "name": "Shawn O. Pearce",
    "email": "sop@google.com",
    "time": "Fri Jun 17 09:54:49 2011 -0700"
  },
  "message": "Make Prolog.copyHash an IdentityHashMap\n\nThe map is used only for VariableTerms that have not yet\nbeen resolved to a value. In this case the only equality\nthat makes sense is identity equality. The identity map\nis faster as it always avoids the virtual hashCode()\nand equals() methods on the keys.\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "a8900263983b7dca659f89fd580d47199052ad24",
      "old_mode": 33188,
      "old_path": "src/lang/Prolog.java",
      "new_id": "d744667792a415f0ef71d29a7eb372ae11fdc096",
      "new_mode": 33188,
      "new_path": "src/lang/Prolog.java"
    }
  ]
}
