sled_search
pub fn pred(tree: &Tree, key: &[u8]) -> Result<Option<(Vec<u8>, Vec<u8>)>, ()>
Find the greatest entry that precedes the given key.