pub(crate) fn resolve_evidence_and_mark_faulty(
        &mut self,
        pub_key: &PublicKey,
    ) -> Vec<ProposedBlock<ClContext>> {
        for pc in self.validation_states.values_mut() {
            pc.missing_evidence.retain(|pk| pk != pub_key);
        }
        self.consensus.mark_faulty(pub_key);
        let (complete, incomplete): (HashMap<_, _>, HashMap<_, _>) = self
            .validation_states
            .drain()
            .partition(|(_, validation_state)| validation_state.is_complete());
        self.validation_states = incomplete;
        complete
            .into_iter()
            .map(|(proposed_block, _)| proposed_block)
            .collect()
    }
/// Marks the dependencies of blocks on evidence against validator `pub_key` as resolved and
/// returns all valid blocks that have no missing dependencies left.
Marks the dependencies of blocks on evidence against validator `pub_key` as resolved and
returns all valid blocks that have no missing dependencies left.
Marks the dependencies of blocks on evidence against validator ` pub_key ` as resolved and returns all valid blocks that have no missing dependencies left .
pub(crate) fn resolve_evidence_and_mark_faulty(
        &mut self,
        pub_key: &PublicKey,
    ) -> Vec<ProposedBlock<ClContext>> {
        for pc in self.validation_states.values_mut() {
            pc.missing_evidence.retain(|pk| pk != pub_key);
        }
        self.consensus.mark_faulty(pub_key);
        let (complete, incomplete): (HashMap<_, _>, HashMap<_, _>) = self
            .validation_states
            .drain()
            .partition(|(_, validation_state)| validation_state.is_complete());
        self.validation_states = incomplete;
        complete
            .into_iter()
            .map(|(proposed_block, _)| proposed_block)
            .collect()
    }
pub ( crate ) fn resolve_evidence_and_mark_faulty ( & mut self , pub_key : & PublicKey , ) -> Vec < ProposedBlock < ClContext > > { for pc in self . validation_states . values_mut ( ) { pc . missing_evidence . retain ( | pk | pk != pub_key ) ; } self . consensus . mark_faulty ( pub_key ) ; let ( complete , incomplete ) : ( HashMap < _ , _ > , HashMap < _ , _ > ) = self . validation_states . drain ( ) . partition ( | ( _ , validation_state ) | validation_state . is_complete ( ) ) ; self . validation_states = incomplete ; complete . into_iter ( ) . map ( | ( proposed_block , _ ) | proposed_block ) . collect ( ) }
Marks the dependencies of blocks on evidence against validator `pub_key` as resolved and
returns all valid blocks that have no missing dependencies left.
Marks the dependencies of blocks on evidence against validator ` pub_key ` as resolved and returns all valid blocks that have no missing dependencies left .
&mut self
pub_key
&PublicKey
&mut self
pub_key
&PublicKey