pub struct IndexedHashMap<K, V, S = RandomState>{ /* private fields */ }Expand description
This implements a map that can be used with UnionFind.
TODO: add docs of how to use a different hasher
Implementations§
Source§impl<K, S> IndexedHashMap<K, K, S>
impl<K, S> IndexedHashMap<K, K, S>
pub fn new_parent_with_hasher(hasher: S) -> Self
Source§impl<K, S> IndexedHashMap<K, usize, S>
impl<K, S> IndexedHashMap<K, usize, S>
pub fn new_rank_with_hasher(hasher: S) -> Self
Trait Implementations§
Source§impl<K, V> Index<K> for IndexedHashMap<K, V>
impl<K, V> Index<K> for IndexedHashMap<K, V>
Auto Trait Implementations§
impl<K, V, S> Freeze for IndexedHashMap<K, V, S>where
S: Freeze,
impl<K, V, S> RefUnwindSafe for IndexedHashMap<K, V, S>
impl<K, V, S> Send for IndexedHashMap<K, V, S>
impl<K, V, S> Sync for IndexedHashMap<K, V, S>
impl<K, V, S> Unpin for IndexedHashMap<K, V, S>
impl<K, V, S> UnwindSafe for IndexedHashMap<K, V, S>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more