Struct crc::Crc

source ·
pub struct Crc<W: Width, I: Implementation = Table<1>> {
    pub algorithm: &'static Algorithm<W>,
    /* private fields */
}
Expand description

Crc instance with a specific width, algorithm, and implementation.

Fields§

§algorithm: &'static Algorithm<W>

Implementations§

source§

impl Crc<u128, Table<1>>

source

pub const fn new(algorithm: &'static Algorithm<u128>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u128

source

pub const fn digest(&self) -> Digest<'_, u128, Table<1>>

source

pub const fn digest_with_initial( &self, initial: u128 ) -> Digest<'_, u128, Table<1>>

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.

source

pub const fn table(&self) -> &<Table<1> as Implementation>::Data<u128>

source§

impl Crc<u128, NoTable>

source

pub const fn new(algorithm: &'static Algorithm<u128>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u128

source

pub const fn digest(&self) -> Digest<'_, u128, NoTable>

source

pub const fn digest_with_initial( &self, initial: u128 ) -> Digest<'_, u128, NoTable>

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.

source§

impl Crc<u128, Table<16>>

source

pub const fn new(algorithm: &'static Algorithm<u128>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u128

source

pub const fn digest(&self) -> Digest<'_, u128, Table<16>>

source

pub const fn digest_with_initial( &self, initial: u128 ) -> Digest<'_, u128, Table<16>>

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.

source

pub const fn table(&self) -> &<Table<16> as Implementation>::Data<u128>

source§

impl Crc<u16, Table<1>>

source

pub const fn new(algorithm: &'static Algorithm<u16>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u16

source

pub const fn digest(&self) -> Digest<'_, u16, Table<1>>

source

pub const fn digest_with_initial( &self, initial: u16 ) -> Digest<'_, u16, Table<1>>

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.

source

pub const fn table(&self) -> &<Table<1> as Implementation>::Data<u16>

source§

impl Crc<u16, NoTable>

source

pub const fn new(algorithm: &'static Algorithm<u16>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u16

source

pub const fn digest(&self) -> Digest<'_, u16, NoTable>

source

pub const fn digest_with_initial( &self, initial: u16 ) -> Digest<'_, u16, NoTable>

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.

source§

impl Crc<u16, Table<16>>

source

pub const fn new(algorithm: &'static Algorithm<u16>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u16

source

pub const fn digest(&self) -> Digest<'_, u16, Table<16>>

source

pub const fn digest_with_initial( &self, initial: u16 ) -> Digest<'_, u16, Table<16>>

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.

source

pub const fn table(&self) -> &<Table<16> as Implementation>::Data<u16>

source§

impl Crc<u32, Table<1>>

source

pub const fn new(algorithm: &'static Algorithm<u32>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u32

source

pub const fn digest(&self) -> Digest<'_, u32, Table<1>>

source

pub const fn digest_with_initial( &self, initial: u32 ) -> Digest<'_, u32, Table<1>>

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.

source

pub const fn table(&self) -> &<Table<1> as Implementation>::Data<u32>

source§

impl Crc<u32, NoTable>

source

pub const fn new(algorithm: &'static Algorithm<u32>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u32

source

pub const fn digest(&self) -> Digest<'_, u32, NoTable>

source

pub const fn digest_with_initial( &self, initial: u32 ) -> Digest<'_, u32, NoTable>

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.

source§

impl Crc<u32, Table<16>>

source

pub const fn new(algorithm: &'static Algorithm<u32>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u32

source

pub const fn digest(&self) -> Digest<'_, u32, Table<16>>

source

pub const fn digest_with_initial( &self, initial: u32 ) -> Digest<'_, u32, Table<16>>

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.

source

pub const fn table(&self) -> &<Table<16> as Implementation>::Data<u32>

source§

impl Crc<u64, Table<1>>

source

pub const fn new(algorithm: &'static Algorithm<u64>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u64

source

pub const fn digest(&self) -> Digest<'_, u64, Table<1>>

source

pub const fn digest_with_initial( &self, initial: u64 ) -> Digest<'_, u64, Table<1>>

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.

source

pub const fn table(&self) -> &<Table<1> as Implementation>::Data<u64>

source§

impl Crc<u64, NoTable>

source

pub const fn new(algorithm: &'static Algorithm<u64>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u64

source

pub const fn digest(&self) -> Digest<'_, u64, NoTable>

source

pub const fn digest_with_initial( &self, initial: u64 ) -> Digest<'_, u64, NoTable>

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.

source§

impl Crc<u64, Table<16>>

source

pub const fn new(algorithm: &'static Algorithm<u64>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u64

source

pub const fn digest(&self) -> Digest<'_, u64, Table<16>>

source

pub const fn digest_with_initial( &self, initial: u64 ) -> Digest<'_, u64, Table<16>>

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.

source

pub const fn table(&self) -> &<Table<16> as Implementation>::Data<u64>

source§

impl Crc<u8, Table<1>>

source

pub const fn new(algorithm: &'static Algorithm<u8>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u8

source

pub const fn digest(&self) -> Digest<'_, u8, Table<1>>

source

pub const fn digest_with_initial(&self, initial: u8) -> Digest<'_, u8, Table<1>>

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.

source

pub const fn table(&self) -> &<Table<1> as Implementation>::Data<u8>

source§

impl Crc<u8, NoTable>

source

pub const fn new(algorithm: &'static Algorithm<u8>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u8

source

pub const fn digest(&self) -> Digest<'_, u8, NoTable>

source

pub const fn digest_with_initial(&self, initial: u8) -> Digest<'_, u8, NoTable>

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.

source§

impl Crc<u8, Table<16>>

source

pub const fn new(algorithm: &'static Algorithm<u8>) -> Self

source

pub const fn checksum(&self, bytes: &[u8]) -> u8

source

pub const fn digest(&self) -> Digest<'_, u8, Table<16>>

source

pub const fn digest_with_initial( &self, initial: u8 ) -> Digest<'_, u8, Table<16>>

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.

source

pub const fn table(&self) -> &<Table<16> as Implementation>::Data<u8>

Trait Implementations§

source§

impl<W: Clone + Width, I: Clone + Implementation> Clone for Crc<W, I>
where I::Data<W>: Clone,

source§

fn clone(&self) -> Crc<W, I>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

Auto Trait Implementations§

§

impl<W, I> Freeze for Crc<W, I>
where I: Sealed, W: 'static, <I as Implementation>::Data<W>: Freeze,

§

impl<W, I> RefUnwindSafe for Crc<W, I>
where I: Sealed, W: 'static + RefUnwindSafe, <I as Implementation>::Data<W>: RefUnwindSafe,

§

impl<W, I> Send for Crc<W, I>
where I: Sealed, W: 'static + Sync, <I as Implementation>::Data<W>: Send,

§

impl<W, I> Sync for Crc<W, I>
where I: Sealed, W: 'static + Sync, <I as Implementation>::Data<W>: Sync,

§

impl<W, I> Unpin for Crc<W, I>
where I: Sealed, W: 'static, <I as Implementation>::Data<W>: Unpin,

§

impl<W, I> UnwindSafe for Crc<W, I>
where I: Sealed, W: 'static + RefUnwindSafe, <I as Implementation>::Data<W>: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.