pub fn assume_crash_faulty(&mut self, nodes: &NodeIdSet) {
        for node_id in nodes.iter() {
            self.nodes[node_id].quorum_set = QuorumSet::new_unsatisfiable();
        }
    }
/// Assume in the following that `nodes` can exhibit crash failures with the "goal" of
/// blocking individual nodes or the whole FBAS. For keeping node IDs unchanged, this method
/// doesn't delete the node entirely but only makes it unsatisfiable.
Assume in the following that `nodes` can exhibit crash failures with the "goal" of
blocking individual nodes or the whole FBAS. For keeping node IDs unchanged, this method
doesn't delete the node entirely but only makes it unsatisfiable.
Assume in the following that ` nodes ` can exhibit crash failures with the " goal " of blocking individual nodes or the whole FBAS . For keeping node IDs unchanged this method doesn ' t delete the node entirely but only makes it unsatisfiable .
pub fn assume_crash_faulty(&mut self, nodes: &NodeIdSet) {
        for node_id in nodes.iter() {
            self.nodes[node_id].quorum_set = QuorumSet::new_unsatisfiable();
        }
    }
pub fn assume_crash_faulty ( & mut self , nodes : & NodeIdSet ) { for node_id in nodes . iter ( ) { self . nodes [ node_id ] . quorum_set = QuorumSet :: new_unsatisfiable ( ) ; } }
Assume in the following that `nodes` can exhibit crash failures with the "goal" of
blocking individual nodes or the whole FBAS.
Assume in the following that ` nodes ` can exhibit crash failures with the " goal " of blocking individual nodes or the whole FBAS .
&mut self
nodes
&NodeIdSet
&mut self
nodes
&NodeIdSet