)]}'
{
  "commit": "995e4286a047b32aebf8ce540908edb7fbd93f76",
  "tree": "9c8e89d7dd7b33908ce7925df1bf7f67cade01db",
  "parents": [
    "e30618cbd1919df61b3f17486af44ac78c24cae5"
  ],
  "author": {
    "name": "Subbaiah Venkata",
    "email": "kvsnaidu@sapnaidu.net",
    "time": "Tue Oct 16 23:27:06 2007 -0700"
  },
  "committer": {
    "name": "Linus Torvalds",
    "email": "torvalds@woody.linux-foundation.org",
    "time": "Wed Oct 17 08:42:52 2007 -0700"
  },
  "message": "lib/sort.c optimization\n\nHello, I fixed and tested a small bug in lib/sort.c file, heap sort\nfunction.\n\nThe fix avoids unnecessary swap of contents when i is 0 (saves few loads\nand stores), which happens every time sort function is called.  I felt the\nfix is worth bringing it to your attention given the importance and\nfrequent use of the sort function.\n\nAcked-by: Matt Mackall \u003cmpm@selenic.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "961567894d16b89a208244ea957e44a3d9afd668",
      "old_mode": 33188,
      "old_path": "lib/sort.c",
      "new_id": "6abbaf3d5858e587705881a4ab6d45a65b8f4e89",
      "new_mode": 33188,
      "new_path": "lib/sort.c"
    }
  ]
}