)]}'
{
  "commit": "8ca6ac1d64acf639728f77c8f8b275efc3eb196c",
  "tree": "f0f8b0189f41327eeaa959d62f8484de541aeede",
  "parents": [
    "363d28993fe5ad6f136d41815fc5d50756998a00"
  ],
  "author": {
    "name": "Lucas De Marchi",
    "email": "lucas.de.marchi@gmail.com",
    "time": "Wed May 25 11:24:38 2011 -0300"
  },
  "committer": {
    "name": "Lucas De Marchi",
    "email": "lucas.de.marchi@gmail.com",
    "time": "Wed May 25 11:24:38 2011 -0300"
  },
  "message": "Do not hash twice\n\nSets already use the __hash__() method of each object to decide if an\nobject is in it. When we use the sha1 we are therefore hashing twice.\n\nThe impact is on performance. Following the performance before and after\nthis patch to parse the entire Linux Kernel tree with a big exclude\nlist.\n\nBefore:\n\treal\t2m20.959s\n\tuser\t2m16.888s\n\tsys\t0m1.386s\n\nAfter:\n\treal\t1m35.169s\n\tuser\t1m28.719s\n\tsys\t0m1.354s\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "1ca48fcaa76649850f5b4f4e390956c15ae69bf3",
      "old_mode": 33261,
      "old_path": "codespell.py",
      "new_id": "4b4ef51e03f2e18f06e16b3a1dda3b031cec2b5d",
      "new_mode": 33261,
      "new_path": "codespell.py"
    }
  ]
}
