/// Remove the key from the Trie. If the key has an associated value, this
/// is returned. If the key is not present or has an associated value of
/// None, None is returned.
Remove the key from the Trie. If the key has an associated value, this
is returned. If the key is not present or has an associated value of
None, None is returned.
Remove the key from the Trie . If the key has an associated value this is returned . If the key is not present or has an associated value of None None is returned .
pub fn remove<K: IntoIterator<Item = A>>(&mut self, key: K) -> Option<V> {
        let closure = |mut n: &mut Node<A, V>| {
            let present = n.terminated;
            n.terminated = false;
            (present, n.pair.value.take())
        };
        let result = self.contains_internal_mut(key, closure);
        if result.0 {
            self.count -= 1;
        }
        result.1
    }
pub fn remove < K : IntoIterator < Item = A > > ( & mut self , key : K ) -> Option < V > { let closure = | mut n : & mut Node < A , V > | { let present = n . terminated ; n . terminated = false ; ( present , n . pair . value . take ( ) ) } ; let result = self . contains_internal_mut ( key , closure ) ; if result . 0 { self . count -= 1 ; } result . 1 }
Remove the key from the Trie.
Remove the key from the Trie .
&mut self
key
K