pub struct Table<const L: usize> {}
Expand description
A table-based implementation of the CRC algorithm, with L
lanes.
The number of entries in the lookup table is L * 256
.
Trait Implementations§
source§impl<const L: usize> Implementation for Table<L>
impl<const L: usize> Implementation for Table<L>
impl<const L: usize> Copy for Table<L>
Auto Trait Implementations§
impl<const L: usize> Freeze for Table<L>
impl<const L: usize> RefUnwindSafe for Table<L>
impl<const L: usize> Send for Table<L>
impl<const L: usize> Sync for Table<L>
impl<const L: usize> Unpin for Table<L>
impl<const L: usize> UnwindSafe for Table<L>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more