)]}'
{
  "commit": "c448ae220c75af3663751ab53a711c9377ced94a",
  "tree": "a27ac9102dde9aa1b96ddd4499ff44a7507c0cec",
  "parents": [
    "60a6d261ac6bd0991c5d189681701c9d91558c82"
  ],
  "author": {
    "name": "Martin Fick",
    "email": "martin.fick@linaro.org",
    "time": "Fri Jul 29 08:59:17 2022 -0600"
  },
  "committer": {
    "name": "Martin Fick",
    "email": "martin.fick@linaro.org",
    "time": "Wed Sep 14 09:53:11 2022 -0600"
  },
  "message": "Cache nameFactory changes in TaskTree\n\nWhen walking changes, it is likely that many changes will get requeried\nsince many of the changes queried will also be in the output. Cache the\noutput of these mostly small (and thus not very memory intensive)\nqueries to avoid repeating them.\n\nIn a sample walking ancestors use case this caching for over 33K\nChangeNodes results in about 1/3 of the original queries, and saves a\nsmall but measurable amount of the total time. In the case of a\ntask.config which walks all dependencies for a change when run with\nstatus:open --no-limit --task--applicable the gain can be seen below.\n\nBefore this change: 4m47s 4m56s 4m22s 5m5s 4m27s\nAfter this change:  4m18s 4m4s 4m37s 3m56s 4m5s\n\nChange-Id: Ibe04c5fae8807635be378d6627dbdc7d8bd724b9\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "6533f5a0e005615abdec9cf875f0da9e62c0c47e",
      "old_mode": 33188,
      "old_path": "src/main/java/com/googlesource/gerrit/plugins/task/TaskAttributeFactory.java",
      "new_id": "2821123fe530a0cc41ce3059038f2cfb01042b94",
      "new_mode": 33188,
      "new_path": "src/main/java/com/googlesource/gerrit/plugins/task/TaskAttributeFactory.java"
    },
    {
      "type": "modify",
      "old_id": "64b333f88f41d81891bd32668e9a83f648f4021e",
      "old_mode": 33188,
      "old_path": "src/main/java/com/googlesource/gerrit/plugins/task/TaskTree.java",
      "new_id": "2b89f90ef1180bee0817e121f4008cb12c435813",
      "new_mode": 33188,
      "new_path": "src/main/java/com/googlesource/gerrit/plugins/task/TaskTree.java"
    }
  ]
}