pub struct TrieMap<K, V, A = u8> { /* private fields */ }
Implementations
sourceimpl<K, V, A: Clone + Eq + Hash> TrieMap<K, V, A>
impl<K, V, A: Clone + Eq + Hash> TrieMap<K, V, A>
pub fn new() -> Self
pub fn clear(&mut self)
pub fn contains<T: AsRef<[A]> + ?Sized>(&self, key: &T) -> boolwhere
K: Borrow<T>,
pub fn get<T: AsRef<[A]> + ?Sized>(&self, key: &T) -> Option<&V>where
K: Borrow<T>,
pub fn get_mut<T: AsRef<[A]> + ?Sized>(&mut self, key: &T) -> Option<&mut V>where
K: Borrow<T>,
pub fn insert<T: AsRef<[A]> + ?Sized>(&mut self, key: &T, val: V) -> Option<V>where
K: Borrow<T>,
pub fn is_empty(&self) -> bool
pub fn iter(&self) -> Iter<'_, &V>
pub fn iter_mut(&mut self) -> Iter<'_, &mut V>
pub fn iter_prefix<T: AsRef<[A]> + ?Sized>(&self, prefix: &T) -> Iter<'_, &V>where
K: Borrow<T>,
pub fn iter_prefix_mut<T: AsRef<[A]> + ?Sized>(
&mut self,
prefix: &T
) -> Iter<'_, &mut V>where
K: Borrow<T>,
pub fn len(&self) -> usize
Trait Implementations
Auto Trait Implementations
impl<K, V, A> RefUnwindSafe for TrieMap<K, V, A>where
A: RefUnwindSafe,
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V, A> Send for TrieMap<K, V, A>where
A: Send,
K: Send,
V: Send,
impl<K, V, A> Sync for TrieMap<K, V, A>where
A: Sync,
K: Sync,
V: Sync,
impl<K, V, A> Unpin for TrieMap<K, V, A>where
A: Unpin,
K: Unpin,
V: Unpin,
impl<K, V, A> UnwindSafe for TrieMap<K, V, A>where
A: UnwindSafe,
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more