pub fn apply<D, B2>(&self, mmr: &mut MutableMmr<D, B2>) -> Result<(), MerkleMountainRangeError>
    where
        D: Digest,
        B2: ArrayLike<Value = Hash>,
    {
        for node in &self.nodes_added {
            mmr.push(node.clone())?;
        }
        mmr.deleted.or_inplace(&self.nodes_deleted);
        Ok(())
    }
/// Apply this checkpoint to the MMR provided. Take care: The `deleted` set is not compressed after returning
/// from here.
Apply this checkpoint to the MMR provided. Take care: The `deleted` set is not compressed after returning
from here.
Apply this checkpoint to the MMR provided . Take care : The ` deleted ` set is not compressed after returning from here .
pub fn apply<D, B2>(&self, mmr: &mut MutableMmr<D, B2>) -> Result<(), MerkleMountainRangeError>
    where
        D: Digest,
        B2: ArrayLike<Value = Hash>,
    {
        for node in &self.nodes_added {
            mmr.push(node.clone())?;
        }
        mmr.deleted.or_inplace(&self.nodes_deleted);
        Ok(())
    }
pub fn apply < D , B2 > ( & self , mmr : & mut MutableMmr < D , B2 > ) -> Result < ( ) , MerkleMountainRangeError > where D : Digest , B2 : ArrayLike < Value = Hash > , { for node in & self . nodes_added { mmr . push ( node . clone ( ) ) ? ; } mmr . deleted . or_inplace ( & self . nodes_deleted ) ; Ok ( ( ) ) }
Apply this checkpoint to the MMR provided.
Apply this checkpoint to the MMR provided .
&self
mmr
&mut MutableMmr<D, B2>
&self
mmr
&mut MutableMmr<D, B2>