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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 0 bytes