)]}'
{
  "commit": "dd610aeda684e42d3933a719cbd59ffbcdfdbcaa",
  "tree": "3001212a96785e66a7d82e18116badd5007bc0ef",
  "parents": [
    "3787e3c16ced0e3a614766dfbb55f8cbd70762c1",
    "b3dfeebb92630c54db1e4f03dbcff0e05208c4c1"
  ],
  "author": {
    "name": "Junio C Hamano",
    "email": "gitster@pobox.com",
    "time": "Fri Aug 12 09:47:39 2016 -0700"
  },
  "committer": {
    "name": "Junio C Hamano",
    "email": "gitster@pobox.com",
    "time": "Fri Aug 12 09:47:39 2016 -0700"
  },
  "message": "Merge branch \u0027kw/patch-ids-optim\u0027\n\nWhen \"git rebase\" tries to compare set of changes on the updated\nupstream and our own branch, it computes patch-id for all of these\nchanges and attempts to find matches. This has been optimized by\nlazily computing the full patch-id (which is expensive) to be\ncompared only for changes that touch the same set of paths.\n\n* kw/patch-ids-optim:\n  rebase: avoid computing unnecessary patch IDs\n  patch-ids: add flag to create the diff patch id using header only data\n  patch-ids: replace the seen indicator with a commit pointer\n  patch-ids: stop using a hand-rolled hashmap implementation\n",
  "tree_diff": []
}