pub fn remove_if<P>(&self, k: &K, predicate: P) -> bool
    where
        P: Fn(V) -> bool,
    {
        let mut inner_backend = self.inner_backend.lock();
        if let Some(v) = inner_backend.get(k) {
            if predicate(v) {
                inner_backend.remove(k);
                return true;
            }
        }
        false
    }
/// "remove" a key (aka remove it from the shared backend) if the
/// specified predicate is true. If the key is removed return
/// true, otherwise return false
///
/// Note that the predicate function is called while the lock is
/// held (and thus the inner backend can't be concurrently accessed
"remove" a key (aka remove it from the shared backend) if the
specified predicate is true. If the key is removed return
true, otherwise return false

Note that the predicate function is called while the lock is
held (and thus the inner backend can't be concurrently accessed
" remove " a key ( aka remove it from the shared backend ) if the specified predicate is true . If the key is removed return true otherwise return false Note that the predicate function is called while the lock is held ( and thus the inner backend can ' t be concurrently accessed
pub fn remove_if<P>(&self, k: &K, predicate: P) -> bool
    where
        P: Fn(V) -> bool,
    {
        let mut inner_backend = self.inner_backend.lock();
        if let Some(v) = inner_backend.get(k) {
            if predicate(v) {
                inner_backend.remove(k);
                return true;
            }
        }
        false
    }
pub fn remove_if < P > ( & self , k : & K , predicate : P ) -> bool where P : Fn ( V ) -> bool , { let mut inner_backend = self . inner_backend . lock ( ) ; if let Some ( v ) = inner_backend . get ( k ) { if predicate ( v ) { inner_backend . remove ( k ) ; return true ; } } false }
"remove" a key (aka remove it from the shared backend) if the
specified predicate is true.
" remove " a key ( aka remove it from the shared backend ) if the specified predicate is true .
&self
k
&K
predicate
P
&self
k
&K
predicate
P