)]}'
{
  "commit": "7a55cd2f657d4a2f233cef74eadf73a24a200cdb",
  "tree": "4d1e3a521dc7fc083cc7ca0d673631c1dda5b943",
  "parents": [
    "f55358c60f517763307c09ae57c3eadb6d23985e"
  ],
  "author": {
    "name": "Vitaly Goldshteyn",
    "email": "goldvitaly@google.com",
    "time": "Wed Oct 21 02:09:08 2026 -0700"
  },
  "committer": {
    "name": "Copybara-Service",
    "email": "copybara-worker@google.com",
    "time": "Wed Oct 21 02:09:58 2026 -0700"
  },
  "message": "Move second-chance lookup in TryFindNewIndexWithoutProbing into type-erased encode_probed_element to reduce binary size.\n\nPreviously, `TryFindNewIndexWithoutProbing` (inlined into every template instantiation of `raw_hash_set\u003c...\u003e::transfer_unprobed_elements_to_next_capacity_fn`) contained both the unprobed element fast path and a second-chance SIMD group lookup for elements that were probed in the old table. Because `transfer_unprobed_elements_to_next_capacity_fn` is instantiated per container policy, this second-chance SIMD lookup was duplicated across every hash table instantiation.\n\nMove the second-chance lookup into `ProbedItemEncoder::EncodeProbedElement` (invoked from the type-erased `encode_probed_element` callback):\n- Simplify `TryFindNewIndexWithoutProbing`.\n\nPiperOrigin-RevId: 1003765009\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "0837bf9c713f245a2df74b7287caf400220bbd07",
      "old_mode": 33188,
      "old_path": "absl/container/internal/raw_hash_set.cc",
      "new_id": "285d269d9f1cb1ad56f587a596289a1d56085ccd",
      "new_mode": 33188,
      "new_path": "absl/container/internal/raw_hash_set.cc"
    },
    {
      "type": "modify",
      "old_id": "2d43ec49552aa100c5bc1bf2d486689e945b8dc5",
      "old_mode": 33188,
      "old_path": "absl/container/internal/raw_hash_set.h",
      "new_id": "2d9e654f25f1ec4d6eebd0780a24267a955f349b",
      "new_mode": 33188,
      "new_path": "absl/container/internal/raw_hash_set.h"
    }
  ]
}