)]}'
{
  "commit": "b07dd9078b8ba5f3b7f5c88f84f7ee9c34fa65e1",
  "tree": "67c9dbfe2caf17a70870bebd1ee2cc49085635dc",
  "parents": [
    "e2067b49ecaef9b7f51a17ce251f9207f72ef52d"
  ],
  "author": {
    "name": "Meet Soni",
    "email": "meetsoni3017@gmail.com",
    "time": "Fri Feb 14 10:11:29 2025 +0530"
  },
  "committer": {
    "name": "Junio C Hamano",
    "email": "gitster@pobox.com",
    "time": "Thu Feb 13 21:33:00 2025 -0800"
  },
  "message": "merge-recursive: optimize time complexity for process_renames\n\nAvoid O(n^2) complexity in `process_renames()` when building a sorted\n`string_list` by constructing it unsorted and sorting it afterward,\nreducing the complexity to O(n log n).\n\nSigned-off-by: Meet Soni \u003cmeetsoni3017@gmail.com\u003e\nSigned-off-by: Junio C Hamano \u003cgitster@pobox.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "5dfaf32b2c18809209da4a0fa306b23b7e08c98e",
      "old_mode": 33188,
      "old_path": "merge-recursive.c",
      "new_id": "884ccf99a58d3b41a5d592ddb1167bc011a3d965",
      "new_mode": 33188,
      "new_path": "merge-recursive.c"
    }
  ]
}