Struct IndexedRLE 

pub struct IndexedRLE<T: Clone + Eq, S = usize> {
    pub token: T,
    pub start: S,
}

Represents an individual run of a specific token.

Individual runs are of indefinite length by themselves. The end of the run (and thus the length) is dictated by the start value of the next run in your sequence.

Type T is the token value that you’re encoding. Type S is the sequence index type. The default of usize should work for most cases, but you can save space if you know that your token sequences have a length that can be specified with a smaller sized type.

Fields

token: T

start: S

Implementations

impl<T: Clone + Eq, S> IndexedRLE<T, S>

pub fn new(token: T, start: S) -> Self

pub fn memory_size(&self) -> usize

The amount of memory it takes to store this data.

Trait Implementations

impl<T: Clone + Clone + Eq, S: Clone> Clone for IndexedRLE<T, S>

fn clone(&self) -> IndexedRLE<T, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Clone + Eq, S: Copy + PartialEq + PartialOrd> MergableSpan for IndexedRLE<T, S>

fn can_append(&self, other: &Self) -> bool

See if the other item can be appended to self. can_append will always be called immediately before append.

fn append(&mut self, other: Self)

Merge the passed item into self. Essentially, self = self + other.

fn prepend(&mut self, other: Self)

Append an item at the start of this item. self = other + self.