Struct RsCode 

pub struct RsCode { /* private fields */ }

A systematic Cauchy Reed-Solomon erasure code: k data shards plus r parity shards, recovering any k of the k + r.

Implementations

impl RsCode

pub fn new(k: usize, r: usize) -> Result<Self, FecError>

Build a (k, r) systematic Cauchy-RS code. k >= 1, r >= 1, k + r <= 256.

pub fn with_backend(self, backend: Option<GfBackend>) -> Self

Pin the GF(256) backend for this code (an A/B-bench / emulation- validation knob), or None to use the auto-detected fastest rung. The override is per-instance, so it never affects another RsCode.

pub fn k(&self) -> usize

Number of data shards.

pub fn r(&self) -> usize

Number of parity shards.

pub fn encode( &self, data: &[&[u8]], parity: &mut [&mut [u8]], ) -> Result<(), FecError>

Compute the r parity shards from the k data shards. All shards (data and parity) must have the same length.

pub fn decode(&self, shards: &mut [Option<Vec<u8>>]) -> Result<(), FecError>

Recover the missing data shards in place. shards has k + r entries (data shards first, then parity); Some = received, None = lost. On success every data-shard slot 0..k is Some. Returns TooFewShards if fewer than k survived.

Trait Implementations

impl Clone for RsCode

fn clone(&self) -> RsCode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RsCode

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

Formats the value using the given formatter.