Struct LinearPrefixMap 

pub struct LinearPrefixMap<K, V>(/* private fields */);

A very simple prefix map

This prefix map stores prefix in descending order by length. While very simple, it was still reasonably fast only requires keys with equality. This might be a good choice on machines with limited memory especially if you’re parsing a very small subset of asciimath. Finding the longest prefix takes O(num_prefixes).

Implementations

impl<K, V> LinearPrefixMap<K, V>

where K: Borrow<str> + Eq,

pub fn from_vec<B>(inp: B) -> Self

where B: Into<Vec<(K, V)>>,

Create from a vector of entries

Trait Implementations

impl<K: Clone, V: Clone> Clone for LinearPrefixMap<K, V>

fn clone(&self) -> LinearPrefixMap<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for LinearPrefixMap<K, V>

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

Formats the value using the given formatter.

impl<K, V> FromIterator<(K, V)> for LinearPrefixMap<K, V>

where K: Borrow<str> + Eq,

fn from_iter<I>(iter: I) -> Self

where I: IntoIterator<Item = (K, V)>,

Creates a value from an iterator.

impl<K: PartialEq, V: PartialEq> PartialEq for LinearPrefixMap<K, V>

fn eq(&self, other: &LinearPrefixMap<K, V>) -> 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<K: Borrow<str>, V> PrefixMap<V> for LinearPrefixMap<K, V>

fn get_longest_prefix<P: AsRef<str>>(&self, inp: P) -> Option<(usize, &V)>

Get the corresponding length and value of the key that is part of the lonest prefix of inp

impl<K: Eq, V: Eq> Eq for LinearPrefixMap<K, V>

impl<K, V> StructuralPartialEq for LinearPrefixMap<K, V>