Struct QpTriePrefixMap 

pub struct QpTriePrefixMap<K: Clone, V>(/* private fields */);

A prefix map backed by a qp-trie

This is the fastest and default token map. This prefix map requires the qp-trie feature (enabled by default). This takes time O(longest_prefix).

Example

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

let token_map = QpTriePrefixMap::from_iter(ASCIIMATH_TOKENS);

Trait Implementations

impl<K: Clone + Clone, V: Clone> Clone for QpTriePrefixMap<K, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Clone, V: Debug> Debug for QpTriePrefixMap<K, V>

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

Formats the value using the given formatter.

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

where K: Borrow<str> + Clone,

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

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

Creates a value from an iterator.

impl<K, V> PrefixMap<V> for QpTriePrefixMap<K, V>

where K: Borrow<str> + Clone,

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