Jacob Pratt 5c47d0bef9 Rollup merge of #152418 - asder8215:btreemap_merge_optimized, r=Mark-Simulacrum ...

`BTreeMap::merge` optimized

This is an optimized version of https://github.com/rust-lang/rust/pull/151981. See [ACP](https://github.com/rust-lang/libs-team/issues/739#issuecomment-3873487320) for more information on `BTreeMap::merge` does.

CC @programmerjake. Let me know what you think of how I'm using `CursorMut` and `IntoIter` here and whether the unsafe code here looks good. I decided to use `ptr::read()` and `ptr::write()` to grab the value from `CursorMut` as `V` than `&mut V`, use it within the `conflict` function, and overwrite the content of conflicting key afterward.

I know this needs some polishing, especially with refactoring some redundant looking code in a nicer way, some of which could probably just be public API methods for `CursorMut`. It does pass all the tests that I currently have for `BTreeMap::merge` (inspired from `BTreeMap::append`) though, so that's good.

2026-02-24 22:51:38 -05:00

..

benches

Use rand crate more idiomatically

2026-01-07 22:31:33 +02:00

testing

[std][BTree] Create tests for keys which can be == without being identical

2025-08-20 03:39:40 +08:00

tests

Rollup merge of #152418 - asder8215:btreemap_merge_optimized, r=Mark-Simulacrum

2026-02-24 22:51:38 -05:00

Cargo.toml

btree: cleanup difference, intersection, is_subset

2025-11-04 15:37:54 +00:00

lib.rs

Remove or allow unused features in library doc and tests

2026-02-13 09:27:16 +08:00