pub fn remove_left<Q: ?Sized>(&mut self, left: &Q) -> Option<R>
    where
        L: Borrow<Q>,
        Q: Hash + Eq,
    {
        let &mut BiMap {
            ref mut len,
            ref mut left_data,
            ref mut right_data,
            ref left_hasher,
            ref right_hasher,
        } = self;
        Self::remove(left, left_data, right_data, left_hasher, right_hasher, len)
            .map(|(_key, value)| value)
    }
/// Removes a key from the left of the hashmap. Returns the value from the right of the hashmap
/// that was associated with this key, if it existed. Will remove both the left and right sides
/// of the pair, if it exists, meaning that `get_right` will no longer work for the value
/// associated with the key that is removed.
///
/// ```
/// # use isomorphism::BiMap;
/// let mut map = BiMap::new();
/// map.insert("Hello", 5);
///
/// assert_eq!(Some(&5), map.get_left("Hello"));
/// assert_eq!(Some(&"Hello"), map.get_right(&5));
///
/// let old = map.remove_left("Hello");
/// assert_eq!(Some(5), old);
///
/// assert_eq!(None, map.get_left("Hello"));
/// assert_eq!(None, map.get_right(&5));
/// ```
Removes a key from the left of the hashmap. Returns the value from the right of the hashmap
that was associated with this key, if it existed. Will remove both the left and right sides
of the pair, if it exists, meaning that `get_right` will no longer work for the value
associated with the key that is removed.


Removes a key from the left of the hashmap . Returns the value from the right of the hashmap that was associated with this key if it existed . Will remove both the left and right sides of the pair if it exists meaning that ` get_right ` will no longer work for the value associated with the key that is removed .
pub fn remove_left<Q: ?Sized>(&mut self, left: &Q) -> Option<R>
    where
        L: Borrow<Q>,
        Q: Hash + Eq,
    {
        let &mut BiMap {
            ref mut len,
            ref mut left_data,
            ref mut right_data,
            ref left_hasher,
            ref right_hasher,
        } = self;
        Self::remove(left, left_data, right_data, left_hasher, right_hasher, len)
            .map(|(_key, value)| value)
    }
pub fn remove_left < Q : ? Sized > ( & mut self , left : & Q ) -> Option < R > where L : Borrow < Q > , Q : Hash + Eq , { let & mut BiMap { ref mut len , ref mut left_data , ref mut right_data , ref left_hasher , ref right_hasher , } = self ; Self :: remove ( left , left_data , right_data , left_hasher , right_hasher , len ) . map ( | ( _key , value ) | value ) }
Removes a key from the left of the hashmap.
Removes a key from the left of the hashmap .
&mut self
left
&Q
&mut self
left
&Q
use isomorphism::bimap;
let mut map = BiMap::new();
map.insert("Hello", 5).



let old = map.remove_left("Hello");
assert_eq!(Some(5), old).


let mut map = BiMap :: new () ; map . insert ( " Hello " 5 ) . let old = map . remove_left ( " Hello " ) ; assert_eq! ( Some ( 5 ) old ) .