Function sled_search::pred_incl

pub fn pred_incl(
    tree: &Tree, 
    key: &[u8]
) -> Result<Option<(Vec<u8>, Vec<u8>)>, ()>

Find the entry at the given key or the greatest that precedes it if no entry for the key exists.