)]}'
{
  "commit": "8a1fc7d99e353a9bc7882e53c4c0d43ee200fd55",
  "tree": "286e88ac1f03a3474d2cc1cd2e6a6cebd8d861f7",
  "parents": [
    "5486627a3f7efb75be86ba186345dc3841d1c0d9"
  ],
  "author": {
    "name": "twerth",
    "email": "twerth@google.com",
    "time": "Wed Oct 28 09:52:57 2026 -0700"
  },
  "committer": {
    "name": "Copybara-Service",
    "email": "copybara-worker@google.com",
    "time": "Wed Oct 28 09:57:06 2026 -0700"
  },
  "message": "Avoid redundant entry clearing in CompactHashSet.clear()\n\nIn CompactHashSet, table entries beyond size are always unset by invariant,\nso clearing the full entries array unconditionally zeroes unallocated or\nalready-cleared slots. Adding an early return for empty sets and zeroing\nonly the occupied range (0..size) avoids unnecessary memory sweeps.\n\nPiperOrigin-RevId: 1008985602\nChange-Id: Ice519c00b308a948f97eed665f7bc3cc9a68b9ee\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "5a7ca65c7d39d09a25da7eb890e24db13a22ba16",
      "old_mode": 33188,
      "old_path": "src/main/java/com/google/devtools/build/lib/collect/compacthashset/CompactHashSet.java",
      "new_id": "84566d18bc1f2306b4f989c6a003b4955db67abc",
      "new_mode": 33188,
      "new_path": "src/main/java/com/google/devtools/build/lib/collect/compacthashset/CompactHashSet.java"
    }
  ]
}