mirror of
https://github.com/rust-lang/rust.git
synced 2024-11-28 01:34:21 +00:00
88e7862dd0
BTree: no longer search arrays twice to check Ord A possible addition to / partial replacement of #83147: no longer linearly search the upper bound of a range in the initial portion of the keys we already know are below the lower bound. - Should be faster: fewer key comparisons at the cost of some instructions dealing with offsets - Makes code a little more complicated. - No longer detects ill-defined `Ord` implementations, but that wasn't a publicised feature, and was quite incomplete, and was only done in the `range` and `range_mut` methods. r? `@Mark-Simulacrum` |
||
---|---|---|
.. | ||
benches | ||
src | ||
tests | ||
Cargo.toml |