)]}'
{
  "commit": "0f6e5037d40db4768e8b61aea22c68c9711ce544",
  "tree": "cf43012483aec4b0ac9d57080dd8c055b6cbf626",
  "parents": [
    "e4ef0485fd78fcb05866ea78df35796b904e4a8e",
    "a79e3519d66671a408041dac8c56d99078de41f2"
  ],
  "author": {
    "name": "Junio C Hamano",
    "email": "gitster@pobox.com",
    "time": "Mon Jul 28 12:02:34 2025 -0700"
  },
  "committer": {
    "name": "Junio C Hamano",
    "email": "gitster@pobox.com",
    "time": "Mon Jul 28 12:02:34 2025 -0700"
  },
  "message": "Merge branch \u0027rs/pop-recent-commit-with-prio-queue\u0027\n\nThe pop_most_recent_commit() function can have quite expensive\nworst case performance characteristics, which has been optimized by\nusing prio-queue data structure.\n\n* rs/pop-recent-commit-with-prio-queue:\n  commit: use prio_queue_replace() in pop_most_recent_commit()\n  prio-queue: add prio_queue_replace()\n  commit: convert pop_most_recent_commit() to prio_queue\n",
  "tree_diff": []
}