pub fn verify(&self, password: &[u8], salt: &[u8], hash: &[u8]) -> bool {
        match *self {
            Algorithm::Single(ref p) => p.verify(password, salt, hash),
            Algorithm::Nested {
                ref inner,
                ref outer,
            } => {
                let innerput = inner.hash_with_salt(password, salt);
                outer.verify(&innerput, salt, hash)
            }
        }
    }
/// Verifies the password, salt and hash are matching by recursively
/// re-computing the hash and verifying the final value.
Verifies the password, salt and hash are matching by recursively
re-computing the hash and verifying the final value.
Verifies the password salt and hash are matching by recursively re - computing the hash and verifying the final value .
pub fn verify(&self, password: &[u8], salt: &[u8], hash: &[u8]) -> bool {
        match *self {
            Algorithm::Single(ref p) => p.verify(password, salt, hash),
            Algorithm::Nested {
                ref inner,
                ref outer,
            } => {
                let innerput = inner.hash_with_salt(password, salt);
                outer.verify(&innerput, salt, hash)
            }
        }
    }
pub fn verify ( & self , password : & [ u8 ] , salt : & [ u8 ] , hash : & [ u8 ] ) -> bool { match * self { Algorithm :: Single ( ref p ) => p . verify ( password , salt , hash ) , Algorithm :: Nested { ref inner , ref outer , } => { let innerput = inner . hash_with_salt ( password , salt ) ; outer . verify ( & innerput , salt , hash ) } } }
Verifies the password, salt and hash are matching by recursively
re-computing the hash and verifying the final value.
Verifies the password salt and hash are matching by recursively re - computing the hash and verifying the final value .
&self
password
&[u8]
salt
&[u8]
hash
&[u8]
&self
password
&[u8]
salt
&[u8]
hash
&[u8]