[][src]Struct boomphf::hashmap::BoomHashMap

pub struct BoomHashMap<K: Hash, D> { /* fields omitted */ }

A HashMap data structure where the mapping between keys and values is encoded in a Mphf. This lets us store the keys and values in dense arrays, with ~3 bits/item overhead in the Mphf.

Methods

impl<K, D> BoomHashMap<K, D> where
    K: Clone + Hash + Debug + PartialEq,
    D: Debug
[src]

Create a new hash map from the parallel array keys and values

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

Get the position in the Mphf of a key, if the key exists.

Total number of key/value pairs

Important traits for BoomIterator<'a, K, D>

impl<K, D> BoomHashMap<K, D> where
    K: Clone + Hash + Debug + PartialEq + Send + Sync,
    D: Debug
[src]

Create a new hash map from the parallel array keys and values, using a parallelized method to construct the Mphf.

Trait Implementations

impl<'a, K: Hash, D> IntoIterator for &'a BoomHashMap<K, D>
[src]

The type of the elements being iterated over.

Which kind of iterator are we turning this into?

impl<K: Debug + Hash, D: Debug> Debug for BoomHashMap<K, D>
[src]

Auto Trait Implementations

impl<K, D> Send for BoomHashMap<K, D> where
    D: Send,
    K: Send

impl<K, D> Sync for BoomHashMap<K, D> where
    D: 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]