Struct HashPrefixMap 

pub struct HashPrefixMap<K, V, S = RandomState>(/* private fields */);

A prefix map that uses length buckets and hashmaps for lookups

For asciimath, the default hasher makes this the third fastest prefix map. If the qp-trie feature isn’t enabled, this will be the default. Finding the longest prefix takes O(len_search_key), but if all keys are long and roughly the same length this may be faster than QpTriePrefixMap.

Example

use asciimath_parser::prefix_map::HashPrefixMap;
use asciimath_parser::{ASCIIMATH_TOKENS};

let token_map = HashPrefixMap::from_iter(ASCIIMATH_TOKENS);

Implementations

impl<K, V, S> HashPrefixMap<K, V, S>

where K: Borrow<str> + Hash + Eq, S: BuildHasher + Default,

pub fn from_iter_hasher<T, I>(iter: T) -> Self

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

Create from an iterator and custom hasher

Trait Implementations

impl<K: Clone, V: Clone, S: Clone> Clone for HashPrefixMap<K, V, S>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug, S: Debug> Debug for HashPrefixMap<K, V, S>

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

Formats the value using the given formatter.

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

where K: Borrow<str> + Hash + Eq,

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

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

Creates a value from an iterator.

impl<K, V, S> PrefixMap<V> for HashPrefixMap<K, V, S>

where K: Borrow<str> + Hash + Eq, S: BuildHasher,

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