Struct fera_unionfind::IndexedHashMap

pub struct IndexedHashMap<K, V, S = RandomState> where
    K: Copy + Hash + Eq,
    S: BuildHasher,  { /* fields omitted */ }

This implements a map that can be used with UnionFind.

TODO: add docs of how to use a different hasher

Methods

impl<K, S> IndexedHashMap<K, K, S> where
    K: Copy + Hash + Eq,
    S: BuildHasher, 

fn new_parent_with_hasher(hasher: S) -> Self

impl<K, S> IndexedHashMap<K, usize, S> where
    K: Copy + Hash + Eq,
    S: BuildHasher, 

fn new_rank_with_hasher(hasher: S) -> Self

Trait Implementations

impl<K, V> Index<K> for IndexedHashMap<K, V> where
    K: Copy + Hash + Eq, 

type Output = V

The returned type after indexing.

fn index(&self, index: K) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<K, V> IndexMut<K> for IndexedHashMap<K, V> where
    K: Copy + Hash + Eq, 

fn index_mut(&mut self, index: K) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.