Enum IntCode 

pub enum IntCode {
    Uncompressed,
    Constant,
    For,
    BitPacking,
    ZigZag,
    Sparse,
    Dict,
    RunEnd,
    Sequence,
    Rle,
    Pco,
}

Unique identifier for integer compression schemes.

NOTE: Variant order matters for tie-breaking; For must precede BitPacking to avoid unnecessary patches.

Variants

Uncompressed

No compression applied.

Constant

Constant encoding for arrays with a single distinct value.

For

Frame of Reference encoding - subtracts minimum value then bitpacks.

BitPacking

BitPacking encoding - compresses non-negative integers by reducing bit width.

ZigZag

ZigZag encoding - transforms negative integers to positive for better bitpacking.

Sparse

Sparse encoding - optimizes null-dominated or single-value-dominated arrays.

Dict

Dictionary encoding - creates a dictionary of unique values.

RunEnd

Run-end encoding - run-length encoding with end positions.

Sequence

Sequence encoding - detects sequential patterns.

Rle

RLE encoding - generic run-length encoding.

Pco

Pco (pcodec) compression for integers.

Trait Implementations

impl Clone for IntCode

fn clone(&self) -> IntCode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IntCode

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

Formats the value using the given formatter.

impl Hash for IntCode

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 Ord for IntCode

fn cmp(&self, other: &IntCode) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for IntCode

fn eq(&self, other: &IntCode) -> 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 PartialOrd for IntCode

fn partial_cmp(&self, other: &IntCode) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Sequence for IntCode

const CARDINALITY: usize

Number of values of type Self.

fn next(&self) -> Option<Self>

Returns value following *self or None if this was the end.

fn previous(&self) -> Option<Self>

Returns value preceding *self or None if this was the beginning.

fn first() -> Option<Self>

Returns the first value of type Self.

fn last() -> Option<Self>

Returns the last value of type Self.

impl Copy for IntCode

impl Eq for IntCode

impl StructuralPartialEq for IntCode