)]}'
{
  "commit": "1c0af131cc139f1b47bd14ead50688f50e95ef44",
  "tree": "91eda77a609ded7e93cc25d27a951f38dc2008fe",
  "parents": [
    "600fe743028cbfb640855f659e9851522214bc0b",
    "49633dc88c14008f9a405f215b60994362b36d6c"
  ],
  "author": {
    "name": "Junio C Hamano",
    "email": "gitster@pobox.com",
    "time": "Tue Jun 09 10:04:49 2026 +0900"
  },
  "committer": {
    "name": "Junio C Hamano",
    "email": "gitster@pobox.com",
    "time": "Tue Jun 09 10:04:49 2026 +0900"
  },
  "message": "Merge branch \u0027tb/bitmap-build-performance\u0027\n\nReachability bitmap generation has been significantly optimized. By\nreordering tree traversal, caching object positions, and refining how\npseudo-merge bitmaps are constructed, the performance of \"git repack\n--write-midx-bitmaps\" is improved, especially for large repositories\nand when using pseudo-merges.\n\n* tb/bitmap-build-performance:\n  pack-bitmap: build pseudo-merge bitmaps after regular bitmaps\n  pack-bitmap: remember pseudo-merge parents\n  pack-bitmap: sort bitmaps before XORing\n  pack-bitmap: cache object positions during fill\n  pack-bitmap: consolidate `find_object_pos()` success path\n  pack-bitmap: reuse stored selected bitmaps\n  pack-bitmap: check subtree bits before recursing\n  pack-bitmap: pass object position to `fill_bitmap_tree()`\n",
  "tree_diff": []
}