pub fn exclusion_list(&self) -> HashSet<&LeafIndex> {
        // Collect the new leaves' indexes so we can filter them out in the resolution
        // later
        let new_leaves_indexes: HashSet<&LeafIndex> = self
            .invitation_list
            .iter()
            .map(|(index, _)| index)
            .collect();
        new_leaves_indexes
    }
/// This function creates a `HashSet` of node indexes of the new nodes that
/// were added to the tree. The `HashSet` will be querried by the
/// `resolve()` function to filter out those nodes from the resolution.
This function creates a `HashSet` of node indexes of the new nodes that
were added to the tree. The `HashSet` will be querried by the
`resolve()` function to filter out those nodes from the resolution.
This function creates a ` HashSet ` of node indexes of the new nodes that were added to the tree . The ` HashSet ` will be querried by the ` resolve () ` function to filter out those nodes from the resolution .
pub fn exclusion_list(&self) -> HashSet<&LeafIndex> {
        // Collect the new leaves' indexes so we can filter them out in the resolution
        // later
        let new_leaves_indexes: HashSet<&LeafIndex> = self
            .invitation_list
            .iter()
            .map(|(index, _)| index)
            .collect();
        new_leaves_indexes
    }
pub fn exclusion_list ( & self ) -> HashSet < & LeafIndex > { // Collect the new leaves' indexes so we can filter them out in the resolution // later let new_leaves_indexes : HashSet < & LeafIndex > = self . invitation_list . iter ( ) . map ( | ( index , _ ) | index ) . collect ( ) ; new_leaves_indexes }
This function creates a `HashSet` of node indexes of the new nodes that
were added to the tree.
This function creates a ` HashSet ` of node indexes of the new nodes that were added to the tree .
&self
&self