mintkv 0.1.0

A simple kv library based on btree
Documentation 
1
2
3
4
5
6
7
8
9
10


pub(crate) fn compare(a: &[u8], b: &[u8]) -> std::cmp::Ordering {
    for (ai, bi) in a.iter().zip(b.iter()) {
        match ai.cmp(bi) {
            std::cmp::Ordering::Equal => continue,
            ord => return ord
        }
    }
    a.len().cmp(&b.len())
}