fn to_splitting_sets(&self) -> Vec<NodeIdSet> {
        let potential_splitting_sets = self.to_slices(|qset| qset.splitting_threshold());
        // check to see if we aren't really a 1-quorum quorum set
        if potential_splitting_sets.len() == 1 && self.is_quorum_slice(&potential_splitting_sets[0])
        {
            vec![]
        } else {
            potential_splitting_sets
        }
    }
/// If `self` represents a symmetric quorum cluster, this function returns all minimal splitting sets of the induced FBAS,
/// but perhaps also a few extra...
If `self` represents a symmetric quorum cluster, this function returns all minimal splitting sets of the induced FBAS,
but perhaps also a few extra
If ` self ` represents a symmetric quorum cluster this function returns all minimal splitting sets of the induced FBAS but perhaps also a few extra
fn to_splitting_sets(&self) -> Vec<NodeIdSet> {
        let potential_splitting_sets = self.to_slices(|qset| qset.splitting_threshold());
        // check to see if we aren't really a 1-quorum quorum set
        if potential_splitting_sets.len() == 1 && self.is_quorum_slice(&potential_splitting_sets[0])
        {
            vec![]
        } else {
            potential_splitting_sets
        }
    }
fn to_splitting_sets ( & self ) -> Vec < NodeIdSet > { let potential_splitting_sets = self . to_slices ( | qset | qset . splitting_threshold ( ) ) ; // check to see if we aren't really a 1-quorum quorum set if potential_splitting_sets . len ( ) == 1 && self . is_quorum_slice ( & potential_splitting_sets [ 0 ] ) { vec ! [ ] } else { potential_splitting_sets } }
If `self` represents a symmetric quorum cluster, this function returns all minimal splitting sets of the induced FBAS,
but perhaps also a few extra...
If ` self ` represents a symmetric quorum cluster this function returns all minimal splitting sets of the induced FBAS but perhaps also a few extra ...
&self
&self