bors 3b150b7a8f Auto merge of #81094 - ssomers:btree_drainy_refactor_3, r=Mark-Simulacrum ...

BTreeMap: split up range_search into two stages

`range_search` expects the caller to pass the same root twice and starts searching a node for both bounds of a range. It's not very clear that in the early iterations, it searches twice in the same node. This PR splits that search up in an initial `find_leaf_edges_spanning_range` that postpones aliasing until the last second, and a second phase for continuing the search for the range in the each subtree independently (`find_lower_bound_edge` & `find_upper_bound_edge`), which greatly helps for use in #81075. It also moves those functions over to the search module.

r? `@Mark-Simulacrum`

2021-03-01 02:48:29 +00:00

..

benches

Reorder benches const variable

2020-09-29 21:39:24 +08:00

src

Auto merge of #81094 - ssomers:btree_drainy_refactor_3, r=Mark-Simulacrum

2021-03-01 02:48:29 +00:00

tests

Rollup merge of #81940 - jhpratt:stabilize-str_split_once, r=m-ou-se

2021-02-26 15:52:29 +01:00

Cargo.toml

Update compiler_builtins to 0.1.39

2021-01-07 16:16:36 +09:00