Struct `Table`

struct Table<L: usize> { ... }

A table-based implementation of the CRC algorithm, with L lanes. The number of entries in the lookup table is L * 256.

Implementations

`impl<L: usize> Clone for Table<L>`

fn clone(self: &Self) -> Table<L>

`impl<L: usize> Copy for Table<L>`

`impl<L: usize> Freeze for Table<L>`

`impl<L: usize> Implementation for Table<L>`

`impl<L: usize> RefUnwindSafe for Table<L>`

`impl<L: usize> Send for Table<L>`

`impl<L: usize> Sync for Table<L>`

`impl<L: usize> Unpin for Table<L>`

`impl<L: usize> UnwindSafe for Table<L>`

`impl<T> Any for Table<L>`

fn type_id(self: &Self) -> TypeId

`impl<T> Borrow for Table<L>`

fn borrow(self: &Self) -> &T

`impl<T> BorrowMut for Table<L>`

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

`impl<T> CloneToUninit for Table<L>`

unsafe fn clone_to_uninit(self: &Self, dest: *mut u8)

`impl<T> From for Table<L>`

fn from(t: T) -> T: Returns the argument unchanged.

`impl<T, U> Into for Table<L>`

fn into(self: Self) -> U

Calls U::from(self).

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

`impl<T, U> TryFrom for Table<L>`

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

`impl<T, U> TryInto for Table<L>`

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