pub fn remove<Q: ?Sized>(&mut self, k: &Q)
    where
        K: Borrow<Q>,
        Q: Eq + Hash
    {
        self.0.remove(k);
    }
/// removes an element from the set, do nothing if the set does not contain the element
removes an element from the set, do nothing if the set does not contain the element
removes an element from the set do nothing if the set does not contain the element
pub fn remove<Q: ?Sized>(&mut self, k: &Q)
    where
        K: Borrow<Q>,
        Q: Eq + Hash
    {
        self.0.remove(k);
    }
pub fn remove < Q : ? Sized > ( & mut self , k : & Q ) where K : Borrow < Q > , Q : Eq + Hash { self . 0 . remove ( k ) ; }
removes an element from the set, do nothing if the set does not contain the element
removes an element from the set do nothing if the set does not contain the element
&mut self
k
&Q
&mut self
k
&Q