pub fn find_quorum_expanders(fbas: &Fbas) -> NodeIdSet {
    info!("Starting to look for quorum expanders...");
    let mut result = NodeIdSet::new();
    for quorum_set in fbas.nodes.iter().map(|node| &node.quorum_set).unique() {
        result.union_with(&quorum_set.quorum_expanders(fbas));
    }
    info!("Found {} quorum expanders.", result.len());
    result
}
/// Finds all nodes that can potentially make quorums smaller by more than one node (i.e., more
/// than by just themselves) by changing their quorum sets or lying about them.
Finds all nodes that can potentially make quorums smaller by more than one node  by changing their quorum sets or lying about them.
Finds all nodes that can potentially make quorums smaller by more than one node by changing their quorum sets or lying about them .
pub fn find_quorum_expanders(fbas: &Fbas) -> NodeIdSet {
    info!("Starting to look for quorum expanders...");
    let mut result = NodeIdSet::new();
    for quorum_set in fbas.nodes.iter().map(|node| &node.quorum_set).unique() {
        result.union_with(&quorum_set.quorum_expanders(fbas));
    }
    info!("Found {} quorum expanders.", result.len());
    result
}
pub fn find_quorum_expanders ( fbas : & Fbas ) -> NodeIdSet { info ! ( " " ) ; let mut result = NodeIdSet :: new ( ) ; for quorum_set in fbas . nodes . iter ( ) . map ( | node | & node . quorum_set ) . unique ( ) { result . union_with ( & quorum_set . quorum_expanders ( fbas ) ) ; } info ! ( " " result len ( ) ) ; result }
Finds all nodes that can potentially make quorums smaller by more than one node (i.e., more
than by just themselves) by changing their quorum sets or lying about them.
Finds all nodes that can potentially make quorums smaller by more than one node ( i . e . more than by just themselves ) by changing their quorum sets or lying about them .
fbas
&Fbas
fbas
&Fbas