)]}'
{
  "commit": "f1f5de442faf85724e67917cd24df6b7275ca360",
  "tree": "bcc60826e270b10c1dd28367c63394caa019b52d",
  "parents": [
    "5d826e972970a784bd7a7bdf587512510097b8c7"
  ],
  "author": {
    "name": "Derrick Stolee",
    "email": "dstolee@microsoft.com",
    "time": "Wed Jan 16 10:25:58 2019 -0800"
  },
  "committer": {
    "name": "Junio C Hamano",
    "email": "gitster@pobox.com",
    "time": "Thu Jan 17 13:44:37 2019 -0800"
  },
  "message": "revision: add mark_tree_uninteresting_sparse\n\nIn preparation for a new algorithm that walks fewer trees when\ncreating a pack from a set of revisions, create a method that\ntakes an oidset of tree oids and marks reachable objects as\nUNINTERESTING.\n\nThe current implementation uses the existing\nmark_tree_uninteresting to recursively walk the trees and blobs.\nThis will walk the same number of trees as the old mechanism. To\nensure that mark_tree_uninteresting walks the tree, we need to\nremove the UNINTERESTING flag before calling the method. This\nimplementation will be replaced entirely in a later commit.\n\nThere is one new assumption in this approach: we are also given\nthe oids of the interesting trees. This implementation does not\nuse those trees at the moment, but we will use them in a later\nrewrite of this method.\n\nSigned-off-by: Derrick Stolee \u003cdstolee@microsoft.com\u003e\nSigned-off-by: Junio C Hamano \u003cgitster@pobox.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "13e0519c0241635c0c1fd14a7ff12e9478c70bd4",
      "old_mode": 33188,
      "old_path": "revision.c",
      "new_id": "60421f3a106de5d700aac775abbda0dbd33b8a7d",
      "new_mode": 33188,
      "new_path": "revision.c"
    },
    {
      "type": "modify",
      "old_id": "7987bfcd2e9bd6ee7bac4f1cbeb10af17ab40b50",
      "old_mode": 33188,
      "old_path": "revision.h",
      "new_id": "df684701b9386131e9243069a31cc60926b279f7",
      "new_mode": 33188,
      "new_path": "revision.h"
    }
  ]
}