pub fn remove<Q: ?Sized>(&mut self, node: &Q)
    where
        T: Borrow<Q>,
        Q: Hash + Eq,
    {
        self.vnodes.retain(|(_, (_node, _))| node != _node.borrow());
        self.unique.map_remove(&self.hash(node));
    }
/// Remove a node from the ring.
///
/// Any keys that were mapped to this node will be uniformly distributed
/// amongst nearby nodes.
///
/// O(k + n + log n)
///
/// ```
/// use consistent_hash_ring::*;
///
/// let mut ring = RingBuilder::default()
///     .nodes_iter(0..12)
///     .build();
/// assert_eq!(12, ring.len());
/// assert_eq!(Some(10), ring.weight(&3));
/// ring.remove(&3);
/// assert_eq!(11, ring.len());
/// assert_eq!(None, ring.weight(&3));
/// ```
Remove a node from the ring.
Any keys that were mapped to this node will be uniformly distributed
amongst nearby nodes.






Remove a node from the ring . Any keys that were mapped to this node will be uniformly distributed amongst nearby nodes .
pub fn remove<Q: ?Sized>(&mut self, node: &Q)
    where
        T: Borrow<Q>,
        Q: Hash + Eq,
    {
        self.vnodes.retain(|(_, (_node, _))| node != _node.borrow());
        self.unique.map_remove(&self.hash(node));
    }
pub fn remove < Q : ? Sized > ( & mut self , node : & Q ) where T : Borrow < Q > , Q : Hash + Eq , { self . vnodes . retain ( | ( _ , ( _node , _ ) ) | node != _node . borrow ( ) ) ; self . unique . map_remove ( & self . hash ( node ) ) ; }
Remove a node from the ring.
Remove a node from the ring .
&mut self
node
&Q
&mut self
node
&Q