Struct imhamt::Hamt

pub struct Hamt<H: Hasher + Default, K: PartialEq + Eq + Hash, V> {
    root: Node<K, V>,
    hasher: PhantomData<H>,
}

Fields

root: Node<K, V>

hasher: PhantomData<H>

Implementations

impl<H: Hasher + Default, K: Eq + Hash, V> Hamt<H, K, V>

pub fn new() -> Self

pub fn is_empty(&self) -> bool

pub fn size(&self) -> usize

impl<H: Hasher + Default, K: Clone + Eq + Hash, V: Clone> Hamt<H, K, V>

pub fn insert(&self, k: K, v: V) -> Result<Self, InsertError>

impl<H: Hasher + Default, K: Eq + Hash + Clone, V: PartialEq + Clone> Hamt<H, K, V>

pub fn remove_match<Q>(&self, k: &Q, v: &V) -> Result<Self, RemoveError>where K: Borrow<Q>, Q: Hash + Eq,

impl<H: Hasher + Default, K: Clone + Eq + Hash, V: Clone> Hamt<H, K, V>

pub fn remove<Q>(&self, k: &Q) -> Result<Self, RemoveError>where K: Borrow<Q>, Q: Hash + Eq,

impl<H: Hasher + Default, K: Eq + Hash + Clone, V: Clone> Hamt<H, K, V>

pub fn replace(&self, k: &K, v: V) -> Result<(Self, V), ReplaceError>

Replace the element at the key by the v and return the new tree and the old value.

pub fn replace_with<F>(&self, k: &K, f: F) -> Result<Self, ReplaceError>where F: FnOnce(&V) -> V,

Replace the element at the key by the v and return the new tree and the old value.

impl<H: Hasher + Default, K: Eq + Hash + Clone, V: Clone> Hamt<H, K, V>

pub fn update<F, U>(&self, k: &K, f: F) -> Result<Self, UpdateError<U>>where F: FnOnce(&V) -> Result<Option<V>, U>, U: Error + Debug + 'static,

Update the element at the key K.

If the closure F in parameter returns None, then the key is deleted.

If the key is not present then UpdateError::KeyNotFound is returned

pub fn insert_or_update<F, E>(&self, k: K, v: V, f: F) -> Result<Self, E>where F: FnOnce(&V) -> Result<Option<V>, E>, V: Clone, E: Error + Debug + 'static,

Update or insert the element at the key K

If the element is not present, then V is added, otherwise the closure F is apply to the found element. If the closure returns None, then the key is deleted

pub fn insert_or_update_simple<F>(&self, k: K, v: V, f: F) -> Selfwhere F: for<'a> FnOnce(&'a V) -> Option<V>, V: Clone,

Update or insert the element at the key K

If the element is not present, then V is added, otherwise the closure F is apply to the found element. If the closure returns None, then the key is deleted.

This is similar to ‘insert_or_update’ except the closure shouldn’t be failing

impl<H: Hasher + Default, K: Hash + Eq, V> Hamt<H, K, V>

pub fn lookup<Q>(&self, k: &Q) -> Option<&V>where K: Borrow<Q>, Q: Hash + Eq,

Try to get the element related to key K

pub fn contains_key<Q>(&self, k: &Q) -> boolwhere K: Borrow<Q>, Q: Hash + Eq,

Check if the key is contained into the HAMT

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

Trait Implementations

impl<H: Clone + Hasher + Default, K: Clone + PartialEq + Eq + Hash, V: Clone> Clone for Hamt<H, K, V>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H: Debug + Hasher + Default, K: Debug + PartialEq + Eq + Hash, V: Debug> Debug for Hamt<H, K, V>

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

Formats the value using the given formatter.

impl<H: Hasher + Default, K: Eq + Hash, V> Default for Hamt<H, K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<H: Default + Hasher, K: Eq + Hash + Clone, V: Clone> FromIterator<(K, V)> for Hamt<H, K, V>

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

Creates a value from an iterator.

impl<'a, H: Default + Hasher, K: Eq + Hash, V> IntoIterator for &'a Hamt<H, K, V>

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

The type of the elements being iterated over.

type IntoIter = HamtIter<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<H: Default + Hasher, K: Eq + Hash, V: PartialEq> PartialEq<Hamt<H, K, V>> for Hamt<H, K, V>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<H: Default + Hasher, K: Eq + Hash, V: Eq> Eq for Hamt<H, K, V>