)]}'
{
  "commit": "9e4ccf89b2da3d0ad2d253150bf646da3353e1e4",
  "tree": "06782bd25cdb8d03dc90d74a2a59cf1ae8c95409",
  "parents": [
    "a7e66a61ce1d9ae0de3660f314fd1ddc6d6e2ba6"
  ],
  "author": {
    "name": "Jukka Lehtosalo",
    "email": "jukka.lehtosalo@iki.fi",
    "time": "Fri Feb 13 12:51:16 2026 +0000"
  },
  "committer": {
    "name": "GitHub",
    "email": "noreply@github.com",
    "time": "Fri Feb 13 12:51:16 2026 +0000"
  },
  "message": "Micro-optimize transitive depencency hash calculation (#20798)\n\nIn small incrementals runs targeting a very large code base, the\n`transitive_dep_hash` function used up to 9% of total CPU.\nMicro-optimize it by avoiding json dump, dict construction and `hex()`\ncalls.\n\nI\u0027ll verify that this helps after this has been merged, but the improved\nperformance (esp. without orjson) seems very likely.",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "9187e56148c1c94792770f51e6107a1dee120c56",
      "old_mode": 33188,
      "old_path": "mypy/build.py",
      "new_id": "1dbbc86fea7f7018ac047d7285736411505230eb",
      "new_mode": 33188,
      "new_path": "mypy/build.py"
    }
  ]
}
