Struct ShaDigest

pub struct ShaDigest<'d, A, S: Borrow<Sha<'d>>> { /* private fields */ }

Available on crate feature unstable only.

An active digest

This implementation might fail after u32::MAX/8 bytes, to increase please see ::finish() length/self.cursor usage

Implementations

impl<'d, A: ShaAlgorithm, S: Borrow<Sha<'d>>> ShaDigest<'d, A, S>

pub fn new(sha: S) -> Self

Creates a new digest

pub fn restore(sha: S, ctx: &mut Context<A>) -> Self

Restores a previously saved digest.

pub fn is_busy(&self) -> bool

Returns true if the hardware is processing the next message.

pub fn update<'a>(&mut self, incoming: &'a [u8]) -> Result<&'a [u8], Infallible>

Updates the SHA digest with the provided data buffer.

pub fn finish(&mut self, output: &mut [u8]) -> Result<(), Infallible>

Finish of the calculation (if not already) and copy result to output After finish() is called update()s will contribute to a new hash which can be calculated again with finish().

Typically, output is expected to be the size of ShaAlgorithm::DIGEST_LENGTH, but smaller inputs can be given to get a “short hash”

pub fn save(&mut self, context: &mut Context<A>) -> Result<(), Infallible>

Save the current state of the digest for later continuation.

pub fn cancel(self) -> S

Discard the current digest and return the peripheral.