)]}'
{
  "commit": "e3432bdb4c14668823fbe33b0ac3b0d243e7505c",
  "tree": "c14febdecd08c2a988b4f7f9da8c0229e468d9b0",
  "parents": [
    "cb7ac42c7820c9a9796f6013e46a02092b1acf98"
  ],
  "author": {
    "name": "Protobuf Team Bot",
    "email": "protobuf-github-bot@google.com",
    "time": "Tue Oct 13 10:11:26 2026 -0700"
  },
  "committer": {
    "name": "Copybara-Service",
    "email": "copybara-worker@google.com",
    "time": "Tue Oct 13 10:15:31 2026 -0700"
  },
  "message": "Optimize SmallSortedMap.EntrySet iteration in Java Protobuf.\n\nImprove `SmallSortedMap.entrySet()`, `EntrySet.iterator()`, and `EntryIterator.next()`:\n- Remove the redundant `ensureSortedAndDeduplicated()` call in `EntrySet.iterator()` (already enforced by `entrySet()`, `EntryIterator.hasNext()`, and `EntryIterator.next()`).\n- Inline the bounds check in `EntryIterator.next()` instead of calling `hasNext()`, avoiding a second `ensureSortedAndDeduplicated()` check per element.\n- Cache `lazyEntrySet` in a local variable in `entrySet()` to avoid a second volatile read.\n\nPiperOrigin-RevId: 998716379\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "958dcc11fd7244df298008dd69c715dc32cdd9ab",
      "old_mode": 33188,
      "old_path": "java/core/src/main/java/com/google/protobuf/SmallSortedMap.java",
      "new_id": "50bd8da5e0d3c14063810919f0ce74490158f6e2",
      "new_mode": 33188,
      "new_path": "java/core/src/main/java/com/google/protobuf/SmallSortedMap.java"
    }
  ]
}