[][src]Struct boomphf::hashmap::NoKeyBoomHashMap2

pub struct NoKeyBoomHashMap2<K, D1, D2> {
    pub mphf: Mphf<K>,
    pub values: Vec<D1>,
    pub aux_values: Vec<D2>,
}

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

Methods

impl<K, D1, D2> NoKeyBoomHashMap2<K, D1, D2> where
    K: Clone + Hash + Debug + PartialEq + Send + Sync,
    D1: Debug,
    D2: Debug
[src]

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

Trait Implementations

impl<K: Debug, D1: Debug, D2: Debug> Debug for NoKeyBoomHashMap2<K, D1, D2>
[src]

Auto Trait Implementations

impl<K, D1, D2> Send for NoKeyBoomHashMap2<K, D1, D2> where
    D1: Send,
    D2: Send,
    K: Send

impl<K, D1, D2> Sync for NoKeyBoomHashMap2<K, D1, D2> where
    D1: Sync,
    D2: Sync,
    K: Sync

Blanket Implementations

impl<T, U> Into for T where
    U: From<T>, 
[src]

impl<T> From for T
[src]

impl<T, U> TryFrom for T where
    T: From<U>, 
[src]

🔬 This is a nightly-only experimental API. (try_from)

The type returned in the event of a conversion error.

impl<T> Borrow for T where
    T: ?Sized
[src]

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T, U> TryInto for T where
    U: TryFrom<T>, 
[src]

🔬 This is a nightly-only experimental API. (try_from)

The type returned in the event of a conversion error.

impl<T> BorrowMut for T where
    T: ?Sized
[src]