fn quorum_expanders(&self, fbas: &Fbas) -> NodeIdSet {
        let mut result = bitset![];
        if self.threshold > 0 {
            for slice in self.nonempty_slices_iter(|qset| qset.threshold) {
                for node in slice.iter() {
                    if !fbas.nodes[node].quorum_set.is_quorum_slice(&slice) {
                        result.insert(node);
                    }
                }
            }
        }
        result
    }
/// Nodes that are in one of my slices but not satisfied by it, thereby potentially expanding
/// it to a larger quorum.
Nodes that are in one of my slices but not satisfied by it, thereby potentially expanding
it to a larger quorum.
Nodes that are in one of my slices but not satisfied by it thereby potentially expanding it to a larger quorum .
fn quorum_expanders(&self, fbas: &Fbas) -> NodeIdSet {
        let mut result = bitset![];
        if self.threshold > 0 {
            for slice in self.nonempty_slices_iter(|qset| qset.threshold) {
                for node in slice.iter() {
                    if !fbas.nodes[node].quorum_set.is_quorum_slice(&slice) {
                        result.insert(node);
                    }
                }
            }
        }
        result
    }
fn quorum_expanders ( & self , fbas : & Fbas ) -> NodeIdSet { let mut result = bitset ! [ ] ; if self . threshold > 0 { for slice in self . nonempty_slices_iter ( | qset | qset . threshold ) { for node in slice . iter ( ) { if ! fbas . nodes [ node ] . quorum_set . is_quorum_slice ( & slice ) { result . insert ( node ) ; } } } } result }
Nodes that are in one of my slices but not satisfied by it, thereby potentially expanding
it to a larger quorum.
Nodes that are in one of my slices but not satisfied by it thereby potentially expanding it to a larger quorum .
&self
fbas
&Fbas
&self
fbas
&Fbas