pub fn clear(&mut self) {
        *self = BTreeMap { root: None, length: 0 };
    }
Returns the first entry in the map for in-place manipulation.
The key of this entry is the minimum key in the map.

# Examples
benchmarks/haystacks/code/rust-library.rs