)]}'
{
  "commit": "7b2648f7454e4d2bfbb78e303ec23d9997e4c985",
  "tree": "15722b4aebb1b6cb0050ea78a33fdb0eb8a89d5e",
  "parents": [
    "d35c5399e3e54ac277bb391fc2f6be3e816d312b"
  ],
  "author": {
    "name": "Sahitya Chandra",
    "email": "sahityajb@gmail.com",
    "time": "Sat Jul 18 13:44:49 2026 +0530"
  },
  "committer": {
    "name": "Junio C Hamano",
    "email": "gitster@pobox.com",
    "time": "Sun Jul 19 16:21:33 2026 -0700"
  },
  "message": "wt-status: avoid repeated insertion for untracked paths\n\nwt_status_collect_untracked() copies entries from dir.entries and\ndir.ignored into string_lists using string_list_insert(). At first glance\nthis seems quadratic, because inserting into the sorted list may shift the\nbacking array, incurring O(n) work for each insert.\n\nIn practice, though, the entries in the dir struct are already sorted, so\nwe should not have to shift the array and only pay the O(log n) lookup cost\nfor each insertion. But this is subtle and depends on the behavior of\nfill_directory().\n\nCollect the entries with string_list_append() instead, then sort and\ndeduplicate each list once with string_list_sort_u(). This preserves the\nsorted, duplicate-free result while making the collection strategy explicit.\n\nSigned-off-by: Sahitya Chandra \u003csahityajb@gmail.com\u003e\nSigned-off-by: Junio C Hamano \u003cgitster@pobox.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "58461e02f886ae17555334cb7e2695834078a03e",
      "old_mode": 33188,
      "old_path": "wt-status.c",
      "new_id": "57772c7501fdbab71fe1dd621ce719eabc22acdf",
      "new_mode": 33188,
      "new_path": "wt-status.c"
    }
  ]
}