)]}'
{
  "commit": "d522178b54087d2c3855484c1899ce99ad278169",
  "tree": "e54b9b2ec152ecd0e6322888b35bae821cb702e4",
  "parents": [
    "486d2e66fdc681398c9fb317f12ce9f299798edf"
  ],
  "author": {
    "name": "Evan Brown CA",
    "email": "ezb@google.com",
    "time": "Tue Oct 13 12:26:41 2026 -0700"
  },
  "committer": {
    "name": "Copybara-Service",
    "email": "copybara-worker@google.com",
    "time": "Tue Oct 13 12:27:28 2026 -0700"
  },
  "message": "Add branch prediction hints to the H2 match loops in `find_large` and `find_or_prepare_insert_large`.\n\nIn the previous range-for loop, clang would by default predict that the loop would have multiple iterations. We change the code to instead predict one iteration of the loop (which is the common case for find-hit). Even with iFDO enabled (in which case the ABSL_PREDICT_TRUE/ABSL_PREDICT_FALSE aren\u0027t as important), splitting the loop entry condition from the loop continuation condition allows for better optimization because the probability of loop entry is very different from loop continuation.\n\nPiperOrigin-RevId: 998814452\nChange-Id: Ic4dfa2ad21a0fdb12f1350f71d3e36a6f7cd7cfa\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "e1de6e0be03c45b3d3065c4bdf9c347244ea9d9a",
      "old_mode": 33188,
      "old_path": "absl/container/internal/raw_hash_set.h",
      "new_id": "1792ec25a25c05033c45388951a529959331c7e4",
      "new_mode": 33188,
      "new_path": "absl/container/internal/raw_hash_set.h"
    }
  ]
}