Struct boomphf_patched::hashmap::NoKeyBoomHashMap

pub struct NoKeyBoomHashMap<K, D1> {
    pub mphf: Mphf<K>,
    pub values: Vec<D1>,
}

A HashMap data structure where the mapping between keys and values is encoded in a Mphf. Keys are not stored - this can greatly improve the memory consumption, but can only be used if you can guarantee that you will only query for keys that were in the original set. Querying for a new key will return a random value, silently.

Fields

mphf: Mphf<K>

values: Vec<D1>

Implementations

impl<K, D1> NoKeyBoomHashMap<K, D1>where
    K: Hash + Debug + PartialEq + Send + Sync,
    D1: Debug,

pub fn new_parallel(keys: Vec<K>, values: Vec<D1>) -> NoKeyBoomHashMap<K, D1>

pub fn new_with_mphf(mphf: Mphf<K>, values: Vec<D1>) -> NoKeyBoomHashMap<K, D1>

pub fn get<Q>(&self, kmer: &Q) -> Option<&D1>where
    K: Borrow<Q>,
    Q: Hash + Eq + ?Sized,

Get the value associated with key, if available, otherwise return None

Trait Implementations

impl<K: Clone, D1: Clone> Clone for NoKeyBoomHashMap<K, D1>

fn clone(&self) -> NoKeyBoomHashMap<K, D1>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug, D1: Debug> Debug for NoKeyBoomHashMap<K, D1>

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

Formats the value using the given formatter.

impl<K, D1> FromIterator<(K, D1)> for NoKeyBoomHashMap<K, D1>where
    K: Hash + Debug + PartialEq + Send + Sync,
    D1: Debug,

fn from_iter<I: IntoIterator<Item = (K, D1)>>(iter: I) -> Self

Creates a value from an iterator.