simd-rs63 0.1.2

SIMD-accelerated Reed-Solomon RS(9,6) erasure coding over GF(2^8), with no unsafe code
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

use crate::gf8::lookup::{INV_TABLE, MUL_TABLE};

mod simd;
mod lookup;

pub use simd::gf8_simd_mul;
pub use simd::gf8_simd_mul_xor;

#[derive(Clone, Copy, PartialEq, Eq, Default, Debug)]
#[repr(transparent)]
pub struct GF8(u8);

impl GF8 {
    pub const fn new(value: u8) -> Self {
        GF8(value)
    }

    pub const fn inv(&self) -> GF8 {
        if self.0 == 0 {
            panic!("division by zero in GF8");
        }
        GF8(INV_TABLE[self.0 as usize])
    }

    pub const fn mul(&self, rhs: GF8) -> GF8 {
        GF8(MUL_TABLE[self.0 as usize][rhs.0 as usize])
    }

    pub const fn add(&self, rhs: GF8) -> GF8 {
        GF8(self.0 ^ rhs.0)
    }

    pub const fn value(&self) -> u8 {
        self.0
    }
}