Johannes Oertel 241a3e4689 Implement append for b-trees. ... 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`.		2016-04-22 12:30:43 +02:00
..
hash	std: Stabilize APIs for the 1.9 release	2016-04-11 08:57:53 -07:00
mod.rs	Implement append for b-trees.	2016-04-22 12:30:43 +02:00