pub fn weighted_nodes_iter<I>(mut self, weighted_nodes: I) -> Self
    where
        I: Iterator<Item = (T, usize)>,
    {
        weighted_nodes.for_each(|w_node| self.weighted_nodes.push(w_node));
        self
    }
/// Ensure that the built `Ring` contains all nodes in the provided iterator with
/// the associated number of vnodes (regardless of the default vnode count).
Ensure that the built `Ring` contains all nodes in the provided iterator with
the associated number of vnodes (regardless of the default vnode count).
Ensure that the built ` Ring ` contains all nodes in the provided iterator with the associated number of vnodes ( regardless of the default vnode count ) .
pub fn weighted_nodes_iter<I>(mut self, weighted_nodes: I) -> Self
    where
        I: Iterator<Item = (T, usize)>,
    {
        weighted_nodes.for_each(|w_node| self.weighted_nodes.push(w_node));
        self
    }
pub fn weighted_nodes_iter < I > ( mut self , weighted_nodes : I ) -> Self where I : Iterator < Item = ( T , usize ) > , { weighted_nodes . for_each ( | w_node | self . weighted_nodes . push ( w_node ) ) ; self }
Ensure that the built `Ring` contains all nodes in the provided iterator with
the associated number of vnodes (regardless of the default vnode count).
Ensure that the built ` Ring ` contains all nodes in the provided iterator with the associated number of vnodes ( regardless of the default vnode count ) .
mut self
weighted_nodes
I
mut self
weighted_nodes
I