Uh oh!
There was an error while loading. Please reload this page.
Hard way to respect BTreeMap's minimum node length - #75105
Conversation
Flabbergasted... not that I didn't immediately realize that 3 lines of code implement the 2nd rule in #74834 and it was worth a try, but that this extra code (covering a case that I think isn't benchmarked) restores performance: I benchmarked things again, and get the same relative results (though all the clone tests are 10% slower than they were 6 hours ago, before I rebooted my PC). So now this seems like a viable PR to me. |
bors
commented
Aug 11, 2020
☔ The latest upstream changes (presumably #75329) made this pull request unmergeable. Please resolve the merge conflicts. |
Mark-Simulacrum
commented
Aug 13, 2020
@bors r+ |
bors
commented
Aug 13, 2020
📌 Commit 17ab457 has been approved by |
Mark-Simulacrum
commented
Aug 13, 2020
@bors rollup=never |
bors
commented
Aug 13, 2020
bors
commented
Aug 13, 2020
☀️ Test successful - checks-actions, checks-azure |
Resolves#74834 the hard way (though not the hardest imaginable).
Benchmarks (which are all biased/realistic, inserting keys in ascending order) say:
This difference is not caused by the
debug_assert-related code in the functionsplitpoint, it's the same without.