[−][src]Struct boomphf::hashmap::BoomHashMap
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]
impl<K, D> BoomHashMap<K, D> where
K: Clone + Hash + Debug + PartialEq,
D: Debug,
pub fn new(keys: Vec<K>, data: Vec<D>) -> BoomHashMap<K, D>
[src]
pub fn new(keys: Vec<K>, data: Vec<D>) -> BoomHashMap<K, D>
Create a new hash map from the parallel array keys
and values
pub fn get(&self, kmer: &K) -> Option<&D>
[src]
pub fn get(&self, kmer: &K) -> Option<&D>
Get the value associated with key
, if available, otherwise return None
pub fn get_key_id(&self, kmer: &K) -> Option<usize>
[src]
pub fn get_key_id(&self, kmer: &K) -> Option<usize>
Get the position in the Mphf of a key, if the key exists.
pub fn len(&self) -> usize
[src]
pub fn len(&self) -> usize
Total number of key/value pairs
pub fn get_key(&self, id: usize) -> Option<&K>
[src]
pub fn get_key(&self, id: usize) -> Option<&K>
ⓘImportant traits for BoomIterator<'a, K, D>pub fn iter(&self) -> BoomIterator<K, D>
[src]
ⓘImportant traits for BoomIterator<'a, K, D>
pub fn iter(&self) -> BoomIterator<K, D>
impl<K, D> BoomHashMap<K, D> where
K: Clone + Hash + Debug + PartialEq + Send + Sync,
D: Debug,
[src]
impl<K, D> BoomHashMap<K, D> where
K: Clone + Hash + Debug + PartialEq + Send + Sync,
D: Debug,
pub fn new_parallel(keys: Vec<K>, data: Vec<D>) -> BoomHashMap<K, D>
[src]
pub fn new_parallel(keys: Vec<K>, data: Vec<D>) -> BoomHashMap<K, D>
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]
impl<'a, K: Hash, D> IntoIterator for &'a BoomHashMap<K, D>
type Item = (&'a K, &'a D)
The type of the elements being iterated over.
type IntoIter = BoomIterator<'a, K, D>
Which kind of iterator are we turning this into?
ⓘImportant traits for BoomIterator<'a, K, D>fn into_iter(self) -> BoomIterator<'a, K, D>
[src]
ⓘImportant traits for BoomIterator<'a, K, D>
fn into_iter(self) -> BoomIterator<'a, K, D>
impl<K: Debug + Hash, D: Debug> Debug for BoomHashMap<K, D>
[src]
impl<K: Debug + Hash, D: Debug> Debug for BoomHashMap<K, D>
Auto Trait Implementations
impl<K, D> Send for BoomHashMap<K, D> where
D: Send,
K: Send,
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,
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, U> Into for T where
U: From<T>,
impl<T> From for T
[src]
impl<T> From for T
impl<T, U> TryFrom for T where
T: From<U>,
[src]
impl<T, U> TryFrom for T where
T: From<U>,
type Error = !
🔬 This is a nightly-only experimental API. (
try_from
)The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T> Borrow for T where
T: ?Sized,
[src]
impl<T> Borrow for T where
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
impl<T> Any for T where
T: 'static + ?Sized,
fn get_type_id(&self) -> TypeId
[src]
fn get_type_id(&self) -> TypeId
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
🔬 This is a nightly-only experimental API. (
try_from
)The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
impl<T> BorrowMut for T where
T: ?Sized,
[src]
impl<T> BorrowMut for T where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
fn borrow_mut(&mut self) -> &mut T