pub fn remove<Q: ?Sized>(&mut self, key: &Q) -> Option<V> where Q: AsRef<[u8]> {
        let opt_old_value = BurstTrieNode::remove(self.root, key, 0, &mut self.root);
        if opt_old_value.is_some() {
            self.len -= 1;
        }
        opt_old_value
    }
/// Removes a key from the map, returning the value at the key if the key
/// was previously in the map.
///
/// # Examples
///
/// ```rust
/// use burst_trie::BurstTrieMap;
///
/// let mut a = BurstTrieMap::new();
/// assert_eq!(a.len(), 0);
/// a.insert("a", 0u32);
/// assert_eq!(a.len(), 1);
/// assert_eq!(a.remove("a"), Some(0));
/// assert_eq!(a.len(), 0);
/// ```
Removes a key from the map, returning the value at the key if the key
was previously in the map.
Removes a key from the map returning the value at the key if the key was previously in the map .
pub fn remove<Q: ?Sized>(&mut self, key: &Q) -> Option<V> where Q: AsRef<[u8]> {
        let opt_old_value = BurstTrieNode::remove(self.root, key, 0, &mut self.root);
        if opt_old_value.is_some() {
            self.len -= 1;
        }
        opt_old_value
    }
pub fn remove < Q : ? Sized > ( & mut self , key : & Q ) -> Option < V > where Q : AsRef < [ u8 ] > { let opt_old_value = BurstTrieNode :: remove ( self . root , key , 0 , & mut self . root ) ; if opt_old_value . is_some ( ) { self . len -= 1 ; } opt_old_value }
Removes a key from the map, returning the value at the key if the key
was previously in the map.
Removes a key from the map returning the value at the key if the key was previously in the map .
&mut self
key
&Q
&mut self
key
&Q
examples
```rust
use burst_trie::BurstTrieMap.


` ` ` rust use burst_trie :: BurstTrieMap .