)]}'
{
  "commit": "375b3f4b334c3f2dabf0d8b23ca9aecf99686a10",
  "tree": "478696244666478da502e17b74f6b8384b6ee482",
  "parents": [
    "4daafa07678bccc3f2afe63bb717ab33974d9433"
  ],
  "author": {
    "name": "Behdad Esfahbod",
    "email": "behdad@behdad.org",
    "time": "Thu Aug 20 03:48:08 2026 -0600"
  },
  "committer": {
    "name": "Behdad Esfahbod",
    "email": "behdad@behdad.org",
    "time": "Thu Aug 20 03:48:08 2026 -0600"
  },
  "message": "[depend] Combine edge deduplication lookup and insert\n\nUse a non-overwriting hashmap insertion to detect duplicate dependency\nedges. This avoids hashing and probing every newly inserted edge twice,\nwhile still distinguishing duplicates from allocation failures through\nthe hashmap error state.\n\nThe NotoNastaliqUrdu compile-only dependency workload saves about 2.2M\ninstructions. Its wall-time change is below measurement noise.\n\nTested with: meson test -C build\n\nAssisted-by: OpenAI Codex \u003ccodex@openai.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "a752e0e77a570d54ad847b71f320c57d1ea9d1ec",
      "old_mode": 33188,
      "old_path": "src/hb-depend-data.hh",
      "new_id": "ebb13fd1f873ef967db8fe2a16013970e3fefce4",
      "new_mode": 33188,
      "new_path": "src/hb-depend-data.hh"
    }
  ]
}