)]}'
{
  "commit": "efe8aabffd25d13b14587acb614780139fbe415d",
  "tree": "b57bed9d75f8503a7b259eaf16fef508a5bb7270",
  "parents": [
    "93d657610677baef395991e46517915317fa7cbc"
  ],
  "author": {
    "name": "jhorvitz",
    "email": "jhorvitz@google.com",
    "time": "Wed Aug 26 13:19:37 2026 -0700"
  },
  "committer": {
    "name": "Copybara-Service",
    "email": "copybara-worker@google.com",
    "time": "Wed Aug 26 13:21:29 2026 -0700"
  },
  "message": "Inline singleton pieces in `NestedSet#splitIfExceedsMaximumSize`.\n\nWhen splitting a `NestedSet` whose successor count is not evenly divisible\nby `maxDegree`, the final piece would previously be stored as a single-element\n`Object[]`. When added as a transitive member to a new `NestedSet`, this violated the invariant that non-leaf transitive arrays have length \u003e\u003d 2.\n\nFix by directly inlining singleton pieces into the pieces array.\n\nPiperOrigin-RevId: 971463001\nChange-Id: If49958361412fbe45a9e35b2670d310f6147b645\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "ce6fe3c2ee86f2f8e8aadf81969d2f29df0e3fab",
      "old_mode": 33188,
      "old_path": "src/main/java/com/google/devtools/build/lib/collect/nestedset/NestedSet.java",
      "new_id": "76daac364ef76d739bd02888d659d950555acd16",
      "new_mode": 33188,
      "new_path": "src/main/java/com/google/devtools/build/lib/collect/nestedset/NestedSet.java"
    },
    {
      "type": "modify",
      "old_id": "a736e4185c298820dd802599c558a544eecbfefb",
      "old_mode": 33188,
      "old_path": "src/test/java/com/google/devtools/build/lib/collect/nestedset/NestedSetTopologyTest.java",
      "new_id": "7fdde6a3def7ea08ccdf4abd1a857da02176c4b5",
      "new_mode": 33188,
      "new_path": "src/test/java/com/google/devtools/build/lib/collect/nestedset/NestedSetTopologyTest.java"
    }
  ]
}