| use super::{finalize, init, update_nolookup}; |
| use crate::*; |
| |
| impl Crc<u128, NoTable> { |
| pub const fn new(algorithm: &'static Algorithm<u128>) -> Self { |
| Self { |
| algorithm, |
| data: [], |
| } |
| } |
| |
| pub const fn checksum(&self, bytes: &[u8]) -> u128 { |
| let mut crc = init(self.algorithm, self.algorithm.init); |
| crc = self.update(crc, bytes); |
| finalize(self.algorithm, crc) |
| } |
| |
| const fn update(&self, crc: u128, bytes: &[u8]) -> u128 { |
| update_nolookup(crc, self.algorithm, bytes) |
| } |
| |
| pub const fn digest(&self) -> Digest<u128, NoTable> { |
| self.digest_with_initial(self.algorithm.init) |
| } |
| |
| /// Construct a `Digest` with a given initial value. |
| /// |
| /// This overrides the initial value specified by the algorithm. |
| /// The effects of the algorithm's properties `refin` and `width` |
| /// are applied to the custom initial value. |
| pub const fn digest_with_initial(&self, initial: u128) -> Digest<u128, NoTable> { |
| let value = init(self.algorithm, initial); |
| Digest::new(self, value) |
| } |
| } |
| |
| impl<'a> Digest<'a, u128, NoTable> { |
| const fn new(crc: &'a Crc<u128, NoTable>, value: u128) -> Self { |
| Digest { crc, value } |
| } |
| |
| pub fn update(&mut self, bytes: &[u8]) { |
| self.value = self.crc.update(self.value, bytes); |
| } |
| |
| pub const fn finalize(self) -> u128 { |
| finalize(self.crc.algorithm, self.value) |
| } |
| } |