)]}'
{
  "commit": "102a701020f13a81e2a25a28c873eede732d2d33",
  "tree": "80aca0a322a9b960147e92aded11b4d423db5dfa",
  "parents": [
    "b20e49f5e6057cd03fc73c9b1525a1f3b36d4cb9",
    "e2a870fd9ed3d3a0d70f2945c5a91ff9d60d011b"
  ],
  "author": {
    "name": "Jonathan Brouwer",
    "email": "jonathantbrouwer@gmail.com",
    "time": "Mon Mar 23 12:14:52 2026 +0100"
  },
  "committer": {
    "name": "GitHub",
    "email": "noreply@github.com",
    "time": "Mon Mar 23 12:14:52 2026 +0100"
  },
  "message": "Rollup merge of #153107 - asder8215:btreemap_append_optimized, r\u003dMark-Simulacrum\n\nOptimize BTreeMap::append() using CursorMut\n\nSince [`BTreeMap::merge`](https://github.com/rust-lang/rust/pull/152418#issuecomment-3959764862) uses `CursorMut` to avoid reconstructing the map from scratch and instead inserting other `BTreeMap` at the right places or overwriting the value in self `BTreeMap` on conflict, we might as well do the same for `BTreeMap::append`. This also means that some of the code in `append.rs` can be removed; `bulk_push()` however is used by `bulk_build_from_sorted_iterator()`, which is used by the `From`/`FromIterator` trait impl on `BTreeMap`. Feels like we should rename the file or place the `bulk_push()` in an existing file.\n\nThe same additional optimization consideration that `BTreeMap::merge` has is also applied to `BTreeMap::append`.\n\nr? @Mark-Simulacrum  since Mark has seen the `BTreeMap::merge` code already (only diff is the `Ordering::Equal` case and now one of the test assertions on a panic case has the correct value now).\n",
  "tree_diff": []
}