Struct Algorithm

pub struct Algorithm<T> {
    pub endian: Endian,
    pub poly: T,
    pub init: T,
    pub refin: bool,
    pub refout: bool,
    pub xorout: T,
    pub residue: T,
}

CRC algorithm.

Fields

endian: Endian

poly: T

init: T

refin: bool

refout: bool

xorout: T

residue: T

Implementations

impl Algorithm<u16>

pub const fn new( endian: Endian, poly: u16, init: u16, refin: bool, refout: bool, xorout: u16, ) -> (Self, u16, [u16; 256])

pub const fn to_endian_bytes(n: u16, endian: Endian) -> [u8; 2]

pub const fn initialize(init: u16, refin: bool) -> u16

Initialize value.

pub const fn optional_reflection(refin: bool, refout: bool, value: u16) -> u16

Optional reflection.

pub const fn finalize(refin: bool, refout: bool, xorout: u16, value: u16) -> u16

Finalize value. Change value to checksum.

pub const fn finalize_to_endian_bytes( endian: Endian, refin: bool, refout: bool, xorout: u16, value: u16, ) -> [u8; 2]

Finalize to endian bytes.

pub const fn calc_byte_with_reciprocal_poly( reciprocal_poly: u16, refin: bool, byte: u8, ) -> u16

Caluculate byte with reciprocal polynomial.

pub const fn create_table(poly: u16, refin: bool) -> [u16; 256]

Create table.

pub const fn calc_bytes_with_values( refin: bool, value: u16, bytes: &[u8], table: &[u16; 256], ) -> u16

Caluculate bytes with values.

impl Algorithm<u32>

pub const fn new( endian: Endian, poly: u32, init: u32, refin: bool, refout: bool, xorout: u32, ) -> (Self, u32, [u32; 256])

pub const fn to_endian_bytes(n: u32, endian: Endian) -> [u8; 4]

pub const fn initialize(init: u32, refin: bool) -> u32

Initialize value.

pub const fn optional_reflection(refin: bool, refout: bool, value: u32) -> u32

Optional reflection.

pub const fn finalize(refin: bool, refout: bool, xorout: u32, value: u32) -> u32

Finalize value. Change value to checksum.

pub const fn finalize_to_endian_bytes( endian: Endian, refin: bool, refout: bool, xorout: u32, value: u32, ) -> [u8; 4]

Finalize to endian bytes.

pub const fn calc_byte_with_reciprocal_poly( reciprocal_poly: u32, refin: bool, byte: u8, ) -> u32

Caluculate byte with reciprocal polynomial.

pub const fn create_table(poly: u32, refin: bool) -> [u32; 256]

Create table.

pub const fn calc_bytes_with_values( refin: bool, value: u32, bytes: &[u8], table: &[u32; 256], ) -> u32

Caluculate bytes with values.

impl Algorithm<u64>

pub const fn new( endian: Endian, poly: u64, init: u64, refin: bool, refout: bool, xorout: u64, ) -> (Self, u64, [u64; 256])

pub const fn to_endian_bytes(n: u64, endian: Endian) -> [u8; 8]

pub const fn initialize(init: u64, refin: bool) -> u64

Initialize value.

pub const fn optional_reflection(refin: bool, refout: bool, value: u64) -> u64

Optional reflection.

pub const fn finalize(refin: bool, refout: bool, xorout: u64, value: u64) -> u64

Finalize value. Change value to checksum.

pub const fn finalize_to_endian_bytes( endian: Endian, refin: bool, refout: bool, xorout: u64, value: u64, ) -> [u8; 8]

Finalize to endian bytes.

pub const fn calc_byte_with_reciprocal_poly( reciprocal_poly: u64, refin: bool, byte: u8, ) -> u64

Caluculate byte with reciprocal polynomial.

pub const fn create_table(poly: u64, refin: bool) -> [u64; 256]

Create table.

pub const fn calc_bytes_with_values( refin: bool, value: u64, bytes: &[u8], table: &[u64; 256], ) -> u64

Caluculate bytes with values.

impl Algorithm<u128>

pub const fn new( endian: Endian, poly: u128, init: u128, refin: bool, refout: bool, xorout: u128, ) -> (Self, u128, [u128; 256])

pub const fn to_endian_bytes(n: u128, endian: Endian) -> [u8; 16]

pub const fn initialize(init: u128, refin: bool) -> u128

Initialize value.

pub const fn optional_reflection(refin: bool, refout: bool, value: u128) -> u128

Optional reflection.

pub const fn finalize( refin: bool, refout: bool, xorout: u128, value: u128, ) -> u128

Finalize value. Change value to checksum.

pub const fn finalize_to_endian_bytes( endian: Endian, refin: bool, refout: bool, xorout: u128, value: u128, ) -> [u8; 16]

Finalize to endian bytes.

pub const fn calc_byte_with_reciprocal_poly( reciprocal_poly: u128, refin: bool, byte: u8, ) -> u128

Caluculate byte with reciprocal polynomial.

pub const fn create_table(poly: u128, refin: bool) -> [u128; 256]

Create table.

pub const fn calc_bytes_with_values( refin: bool, value: u128, bytes: &[u8], table: &[u128; 256], ) -> u128

Caluculate bytes with values.

Trait Implementations

impl<T: Clone> Clone for Algorithm<T>

fn clone(&self) -> Algorithm<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Algorithm<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Hash> Hash for Algorithm<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: PartialEq> PartialEq for Algorithm<T>

fn eq(&self, other: &Algorithm<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Copy> Copy for Algorithm<T>

impl<T: Eq> Eq for Algorithm<T>

impl<T> StructuralPartialEq for Algorithm<T>