241a3e4689
The algorithm implemented here is linear in the size of the two b-trees. It firsts creates a `MergeIter` from the two b-trees and then builds a new b-tree by pushing key-value pairs from the `MergeIter` into nodes at the right heights. Three functions for stealing have been added to the implementation of `Handle` as well as a getter for the height of a `NodeRef`. The docs have been updated with performance information about `BTreeMap::append` and the remark about B has been removed now that it is the same for all instances of `BTreeMap`. |
||
|---|---|---|
| .. | ||
| btree | ||
| bench.rs | ||
| binary_heap.rs | ||
| enum_set.rs | ||
| fmt.rs | ||
| lib.rs | ||
| linked_list.rs | ||
| slice.rs | ||
| str.rs | ||
| string.rs | ||
| vec_deque.rs | ||
| vec.rs | ||