pub fn create_digest(&self) -> Box<dyn DynDigest> {
        let ret: Box<dyn sha2::digest::DynDigest> = match self {
            HashAlgorithm::SHA1 => Box::new(sha1::Sha1::new()),
            HashAlgorithm::SHA256 => Box::new(Sha256::new()),
        };

        return ret;
    }
/// Based on the `GitOid`'s hashing algorithm, generate an instance of
/// a digester
Based on the `GitOid`'s hashing algorithm, generate an instance of
a digester
Based on the ` GitOid ` ' s hashing algorithm generate an instance of a digester
pub fn create_digest(&self) -> Box<dyn DynDigest> {
        let ret: Box<dyn sha2::digest::DynDigest> = match self {
            HashAlgorithm::SHA1 => Box::new(sha1::Sha1::new()),
            HashAlgorithm::SHA256 => Box::new(Sha256::new()),
        };
        return ret;
    }
pub fn create_digest ( & self ) -> Box < dyn DynDigest > { let ret : Box < dyn sha2 :: digest :: DynDigest > = match self { HashAlgorithm :: SHA1 => Box :: new ( sha1 :: Sha1 :: new ( ) ) , HashAlgorithm :: SHA256 => Box :: new ( Sha256 :: new ( ) ) , } ; return ret ; }
Based on the `GitOid`'s hashing algorithm, generate an instance of
a digester
Based on the ` GitOid ` ' s hashing algorithm generate an instance of a digester
&self
&self