)]}'
{
  "commit": "79519985659e34bd2d67365609a43bb90b28c262",
  "tree": "bbf8a0dd09bcee45dcfb84530b387b546c13882a",
  "parents": [
    "375b3f4b334c3f2dabf0d8b23ca9aecf99686a10"
  ],
  "author": {
    "name": "Behdad Esfahbod",
    "email": "behdad@behdad.org",
    "time": "Thu Aug 20 03:55:41 2026 -0600"
  },
  "committer": {
    "name": "Behdad Esfahbod",
    "email": "behdad@behdad.org",
    "time": "Thu Aug 20 03:55:41 2026 -0600"
  },
  "message": "[set] Compute iterator length lazily\n\nSet iteration does not always need the remaining item count. Defer the\npopulation scan until len() is first requested, using unsigned accounting\nto track advances without adding a branch to the iterator hot path.\n\nThis preserves fast length for iterator consumers that use it while\navoiding unnecessary population scans for the others. Noto Nastaliq\ndependency construction is instruction-neutral because its existing set\niterators already encounter cached populations.\n\nTested with: meson test -C build\n\nAssisted-by: OpenAI Codex \u003ccodex@openai.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "8263cf2e16e4aaf28e55e6f90aaac2dc76fd8b5d",
      "old_mode": 33188,
      "old_path": "src/hb-bit-set-invertible.hh",
      "new_id": "bb71105b0e1bb9241aa9b078958be184da3404b8",
      "new_mode": 33188,
      "new_path": "src/hb-bit-set-invertible.hh"
    },
    {
      "type": "modify",
      "old_id": "bd835f8672d3f396d0f783efcb3ace5ca1361ec6",
      "old_mode": 33188,
      "old_path": "src/test-set.cc",
      "new_id": "f47fbaaa5a5be882aaf2f3fbfad9a1c1b905d807",
      "new_mode": 33188,
      "new_path": "src/test-set.cc"
    }
  ]
}