Struct Runs 

pub struct Runs<'a, E: IntegerElement, Bd: Bound, C: Codec<E, Bd>, const MAX_RUN: usize> { /* private fields */ }

Sparse storage as a codec, not as a separate algorithm and not as a separate crate (D-16).

A run is (length, code): length consecutive decoded elements, all of them d(code). A gap is a run whose code decodes to the alphabet’s zero, so the zeros are explicit and the arithmetic downstream stays dense. No sparse-specific speedup is claimed; the benefit is residency, and CG-03 measures it like any other codec’s.

A code is a run index, and the run’s length is what Codec::decode_len reports. MAX_RUN is the longest run the caller declares, so this tier is variable-length within a compile-time bound — which is exactly what the MAX_BLOCK spelling is for (S4, S5b).

Implementations

impl<'a, E: IntegerElement, Bd: Bound, C: Codec<E, Bd>, const MAX_RUN: usize> Runs<'a, E, Bd, C, MAX_RUN>

pub fn new(inner: C, runs: &'a [(u32, C::Code)]) -> Option<Self>

Borrow a run list.

None when a run is empty or longer than MAX_RUN, both of which mean the list describes no stream. Decided at construction, before any arithmetic, like every other non-existence in this library (C6).

pub const fn run_count(&self) -> usize

The number of stored runs, which is the residency this tier buys.

pub fn decoded_len(&self) -> usize

The decoded length of the whole run list.

CK-06 asserts this equals the declared row width, which is the invariant that lets a variable-length tier live inside Codec.

Trait Implementations

impl<'a, E: Clone + IntegerElement, Bd: Clone + Bound, C: Clone + Codec<E, Bd>, const MAX_RUN: usize> Clone for Runs<'a, E, Bd, C, MAX_RUN>

where C::Code: Clone,

fn clone(&self) -> Runs<'a, E, Bd, C, MAX_RUN>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<E: IntegerElement, Bd: Bound, C: Codec<E, Bd>, const MAX_RUN: usize> Codec<E, Bd> for Runs<'_, E, Bd, C, MAX_RUN>

const MAX_BLOCK: usize = MAX_RUN

The most alphabet elements one code can produce.

const TIER: TierId = TierId::Runs

Which tier this is, for reports and for the kappa manifest.

const IS_FIXED_WIDTH: bool = false

Is decode_len always MAX_BLOCK?

type Code = u32

The stored code type.

fn decode_len(&self, run: Self::Code) -> usize

How many elements code actually produces.

fn decode_element(&self, run: Self::Code, i: usize) -> Alphabet<E, Bd>

Decode element i of the block code names. Total for every i.

fn decode_into(&self, code: Self::Code, out: &mut [Alphabet<E, Bd>]) -> usize

Decode one code, returning how many elements were written.

fn decode_seq(&self, codes: &[Self::Code], out: &mut [Alphabet<E, Bd>]) -> usize

Bulk path, returning how many elements were written in total.

impl<'a, E: Copy + IntegerElement, Bd: Copy + Bound, C: Copy + Codec<E, Bd>, const MAX_RUN: usize> Copy for Runs<'a, E, Bd, C, MAX_RUN>

where C::Code: Copy,

impl<'a, E: Debug + IntegerElement, Bd: Debug + Bound, C: Debug + Codec<E, Bd>, const MAX_RUN: usize> Debug for Runs<'a, E, Bd, C, MAX_RUN>

where C::Code: Debug,

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

Formats the value using the given formatter.