pub fn find<Q: ?Sized>(&mut self, key: &Q) -> Option<&mut V>
    where
        K: std::borrow::Borrow<Q>,
        Q: std::hash::Hash + Eq,
    {
        for scope in self.0.iter_mut().rev() {
            if let Some(value_found) = scope.find(key) {
                return Some(value_found);
            }
        }

        None
    }
// Recursively search for a key in the scope tree
Recursively search for a key in the scope tree
Recursively search for a key in the scope tree
pub fn find<Q: ?Sized>(&mut self, key: &Q) -> Option<&mut V>
    where
        K: std::borrow::Borrow<Q>,
        Q: std::hash::Hash + Eq,
    {
        for scope in self.0.iter_mut().rev() {
            if let Some(value_found) = scope.find(key) {
                return Some(value_found);
            }
        }
        None
    }
pub fn find < Q : ? Sized > ( & mut self , key : & Q ) -> Option < & mut V > where K : std :: borrow :: Borrow < Q > , Q : std :: hash :: Hash + Eq , { for scope in self . 0 . iter_mut ( ) . rev ( ) { if let Some ( value_found ) = scope . find ( key ) { return Some ( value_found ) ; } } None }
Recursively search for a key in the scope tree
Recursively search for a key in the scope tree
&mut self
key
&Q
&mut self
key
&Q