Method get_or_less

cranelift/bforest/src/map.rs:117–130

Look up the value stored for `key`. If it exists, return the stored key-value pair. Otherwise, return the last key-value pair with a key that is less than or equal to `key`. If no stored keys are less than or equal to `key`, return `None`.

(
        &self,
        key: K,
        forest: &MapForest<K, V>,
        comp: &C,
    )

    ///
    /// If no stored keys are less than or equal to `key`, return `None`.
    pub fn get_or_less<C: Comparator<K>>(
        &self,
        key: K,
        forest: &MapForest<K, V>,
        comp: &C,
    ) -> Option<(K, V)> {
        self.root.expand().and_then(|root| {
            let mut path = Path::default();
            match path.find(key, root, &forest.nodes, comp) {
                Some(v) => Some((key, v)),
                None => path.prev(root, &forest.nodes),
            }
        })
    }

    /// Insert `key, value` into the map and return the old value stored for `key`, if any.
    pub fn insert<C: Comparator<K>>(