)]}'
{
  "commit": "6ca34cf07372b63b2ae2c28ba4dfbe3785f08030",
  "tree": "af53609d8895f2a66f19123beca1d3f6e4a9e535",
  "parents": [
    "3708b24aee217965d7bba2a1fbcca275508936ce"
  ],
  "author": {
    "name": "Behdad Esfahbod",
    "email": "behdad@behdad.org",
    "time": "Fri Aug 21 07:32:54 2026"
  },
  "committer": {
    "name": "Behdad Esfahbod",
    "email": "behdad@behdad.org",
    "time": "Fri Aug 21 07:32:54 2026"
  },
  "message": "[int-set] Reuse the last-page cache when inserting\n\nensure_page_index_for_major went straight to a binary search of the\npage map on every call, while contains() consults the\nlast_page_map_index cache first. Check and maintain the same cache on\nthe insert path, mirroring hb_bit_set_t, which caches page lookups on\nboth reads and writes.\n\nRuns of nearby values now skip the search: BM_SetInsertOrdered_1000\nimproves 30-83% (larger sets gain more). Hash-scattered inserts\n(BM_SetInsert_1000), where the cache nearly always misses, pay 7-9%\nfor the extra compare.\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "7ecfd08789a871a6ef91bcfb35c4e2e0f74b0a98",
      "old_mode": 33188,
      "old_path": "read-fonts/src/collections/int_set/bitset.rs",
      "new_id": "9f77020f9755ac5793efd53095b4b3d227f8e183",
      "new_mode": 33188,
      "new_path": "read-fonts/src/collections/int_set/bitset.rs"
    }
  ]
}