Enum Hamt 

pub enum Hamt<K, V, HamtRef> {
    Empty,
    Leaf(HashBits, K, V),
    Bitmap(Size, Bitmap, Vec<HamtRef>),
    Collision(HashBits, Vec<(K, V)>),
}

Variants

Empty

Leaf(HashBits, K, V)

Bitmap(Size, Bitmap, Vec<HamtRef>)

Collision(HashBits, Vec<(K, V)>)

Implementations

impl<K, V, HamtRef> Hamt<K, V, HamtRef>

where K: Hash + Eq + Clone, V: Clone, HamtRef: Clone + Deref<Target = Hamt<K, V, HamtRef>> + From<Hamt<K, V, HamtRef>>,

pub fn new() -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn iter(&self) -> Iter<'_, K, V, HamtRef>

Returns a key value iterator.

pub fn keys(&self) -> Keys<'_, K, V, HamtRef>

Returns an iterator that visits every key in an unspecified order.

pub fn values(&self) -> Values<'_, K, V, HamtRef>

Returns an iterator that visits every value in an unspecified order.

pub fn get<Q>(&self, k: &Q) -> Option<&V>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns a reference to the value corresponding to the given key, or None if there is no value associated with the key.

pub fn contains_key<Q>(&self, k: &Q) -> bool

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns true if the map contains the given key.

pub fn insert<Q, R>(&self, k: &Q, v: &R) -> Self

where K: Borrow<Q>, Q: Hash + Eq + ToOwned<Owned = K> + ?Sized, V: Borrow<R>, R: ToOwned<Owned = V> + ?Sized,

pub fn remove<Q>(&self, k: &Q) -> Self

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns a new map without an entry corresponding to the given key.

pub fn adjust<F, Q>(&self, key: &Q, f: F) -> Self

where F: FnOnce(&V) -> V, K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Modifies the value tied to the given key with the function f. Otherwise, the map returned is identical.

pub fn update<F, Q>(&self, key: &Q, f: F) -> Self

where F: FnOnce(&V) -> Option<V>, K: Borrow<Q>, Q: Hash + Eq + ToOwned<Owned = K> + ?Sized,

Updates the value at the given key using f. If f returns None, then the entry is removed.

pub fn alter<F, Q>(&self, key: &Q, f: F) -> Self

where F: FnOnce(Option<&V>) -> Option<V>, K: Borrow<Q>, Q: Hash + Eq + ToOwned<Owned = K> + ?Sized,

Updates the value at the given key using f as in Self::update. If no value exists for the given key, then f is passed None.

Trait Implementations

impl<K: Clone, V: Clone, HamtRef: Clone> Clone for Hamt<K, V, HamtRef>

fn clone(&self) -> Hamt<K, V, HamtRef>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug, HamtRef: Debug> Debug for Hamt<K, V, HamtRef>

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

Formats the value using the given formatter.

impl<K, V> From<Hamt<K, V, ArcTrick<K, V>>> for ArcTrick<K, V>

fn from(t: Hamt<K, V, ArcTrick<K, V>>) -> Self

Converts to this type from the input type.

impl<K, V> From<Hamt<K, V, RcTrick<K, V>>> for RcTrick<K, V>

fn from(t: Hamt<K, V, RcTrick<K, V>>) -> Self

Converts to this type from the input type.

impl<'a, K, V, HamtRef> FromIterator<(&'a K, &'a V)> for Hamt<K, V, HamtRef>

where K: Eq + Hash + Clone, V: Clone, HamtRef: Clone + Deref<Target = Hamt<K, V, HamtRef>> + From<Hamt<K, V, HamtRef>>,

fn from_iter<T>(iterator: T) -> Self

where T: IntoIterator<Item = (&'a K, &'a V)>,

Creates a value from an iterator.

impl<K, V, HamtRef> FromIterator<(K, V)> for Hamt<K, V, HamtRef>

where K: Eq + Hash + Clone, V: Clone, HamtRef: Clone + Deref<Target = Hamt<K, V, HamtRef>> + From<Hamt<K, V, HamtRef>>,

fn from_iter<T>(iterator: T) -> Self

where T: IntoIterator<Item = (K, V)>,

Creates a value from an iterator.

impl<'a, K, Q, V, HamtRef> Index<&'a Q> for Hamt<K, V, HamtRef>

where K: Hash + Eq + Clone + Borrow<Q>, V: Clone, Q: Eq + Hash + ?Sized, HamtRef: Clone + Deref<Target = Hamt<K, V, HamtRef>> + From<Hamt<K, V, HamtRef>>,

type Output = V

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<'a, K, V, HamtRef> IntoIterator for &'a Hamt<K, V, HamtRef>

where K: 'a + Clone + Hash + Eq, V: 'a + Clone, HamtRef: 'a + Clone + Deref<Target = Hamt<K, V, HamtRef>> + From<Hamt<K, V, HamtRef>>,

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = Iter<'a, K, V, HamtRef>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K, V, HamtRef> PartialEq for Hamt<K, V, HamtRef>

where K: PartialEq, V: PartialEq, HamtRef: PartialEq,

fn eq(&self, other: &Hamt<K, V, HamtRef>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K, V, HamtRef> Eq for Hamt<K, V, HamtRef>

where K: Eq, V: Eq, HamtRef: Eq,