)]}'
{
  "commit": "35b655fb97b1050100c0537857e338e868408485",
  "tree": "f8c20de7098ac91511eb67e4615660dab6d0d4cd",
  "parents": [
    "756e2d53ff22126b04a2a954715e82c3111423e4"
  ],
  "author": {
    "name": "Protobuf Team Bot",
    "email": "protobuf-github-bot@google.com",
    "time": "Tue Oct 13 08:58:52 2026 -0700"
  },
  "committer": {
    "name": "Copybara-Service",
    "email": "copybara-worker@google.com",
    "time": "Tue Oct 13 09:05:00 2026 -0700"
  },
  "message": "Optimize SmallSortedMap lazy sorting and deduplication in Java Protobuf.\n\n`SmallSortedMap.ensureSortedAndDeduplicated()` is the hot fast-path guard invoked before reads, lookups, and iterations on `SmallSortedMap`. Previously, embedding the synchronized lazy sorting and deduplication logic directly inside `ensureSortedAndDeduplicated()` bloated its bytecode past the JVM\u0027s default inlining threshold (`MaxInlineSize`), preventing the fast path from inlining into callers.\n\nExtract the synchronized slow path into helper methods so `ensureSortedAndDeduplicated()` stays small enough to inline on the common fast path, and streamline in-place deduplication to avoid redundant array writes and clearing overhead when lazy sorting is triggered.\n\nPiperOrigin-RevId: 998671485\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "32010937342d007d2e71b2dbc9a683f4498b7a7d",
      "old_mode": 33188,
      "old_path": "java/core/src/main/java/com/google/protobuf/SmallSortedMap.java",
      "new_id": "958dcc11fd7244df298008dd69c715dc32cdd9ab",
      "new_mode": 33188,
      "new_path": "java/core/src/main/java/com/google/protobuf/SmallSortedMap.java"
    }
  ]
}