fn to_minimal_quorums(&self, fbas: &Fbas) -> Vec<NodeIdSet> {
        let quorums = self.to_quorum_slices();
        if self.contains_duplicates() {
            remove_non_minimal_x(quorums, is_minimal_for_quorum, fbas)
        } else {
            quorums
        }
    }
/// Makes sense if the quorum set represents a symmetric quorum cluster...
Makes sense if the quorum set represents a symmetric quorum cluster
Makes sense if the quorum set represents a symmetric quorum cluster
fn to_minimal_quorums(&self, fbas: &Fbas) -> Vec<NodeIdSet> {
        let quorums = self.to_quorum_slices();
        if self.contains_duplicates() {
            remove_non_minimal_x(quorums, is_minimal_for_quorum, fbas)
        } else {
            quorums
        }
    }
fn to_minimal_quorums ( & self , fbas : & Fbas ) -> Vec < NodeIdSet > { let quorums = self . to_quorum_slices ( ) ; if self . contains_duplicates ( ) { remove_non_minimal_x ( quorums , is_minimal_for_quorum , fbas ) } else { quorums } }
Makes sense if the quorum set represents a symmetric quorum cluster...
Makes sense if the quorum set represents a symmetric quorum cluster ...
&self
fbas
&Fbas
&self
fbas
&Fbas