Struct binjs::io::entropy::dictionary::LinearTable

pub struct LinearTable<T> where
    T: Eq + Hash + Clone,  { /* fields omitted */ }

A data structure designed to cache information accessible either by index or by value.

Methods

impl<T> LinearTable<T> where
    T: Eq + Hash + Clone, 

pub fn shared_len(&self) -> usize

The number of values representing shared dictionary entries in this table.

pub fn prelude_len(&self) -> usize

The number of values representing prelude dictionary entries in this table.

pub fn len(&self) -> usize

The number of values in this table.

impl<T> LinearTable<T> where
    T: Eq + Hash + Clone + Debug + Ord, 

pub fn new(
    value_to_instances: HashMap<T, FilesContaining, RandomState>,
    threshold: FilesContaining
) -> LinearTable<T>

Create a new LinearTable from a list of instances.

Values appearing in instances that have threshold instances or less are ignored.

pub fn with_capacity(len: usize) -> LinearTable<T>

Create an empty LinearTable.

pub fn fetch_index(&mut self, value: &T) -> Fetch<TableRef>

Attempt to get the index for a value from the LinearTable.

If the value is already in the cache, return Fetch::Hit(index), where index is the immutable index of the value. Otherwise, allocate a new slot index and return Fetch::Miss(index).

In both Fetch::Hit(index) and Fetch::Miss(index), 0 is the first value, 1 the second value, etc.

pub fn with_prelude(&self, prelude: &'a [T]) -> Result<LinearTable<T>, &'a T>

Create a copy of the current LinearTable with an added prelude dictionary.

pub fn at_index(&self, table_ref: &TableRef) -> Option<&T>

Access the contents of this table by index.

Trait Implementations

impl<T> Clone for LinearTable<T> where
    T: Clone + Eq + Hash, 

fn clone(&self) -> LinearTable<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for LinearTable<T> where
    T: Debug + Eq + Hash + Clone, 

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for LinearTable<T> where
    T: Eq + Hash + Clone + Deserialize<'de>, 

fn deserialize<__D>(
    __deserializer: __D
) -> Result<LinearTable<T>, <__D as Deserializer<'de>>::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<T> Serialize for LinearTable<T> where
    T: Eq + Hash + Clone + Serialize, 

fn serialize<__S>(
    &self,
    __serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.