Struct HamtMap

pub struct HamtMap<K, V, IS = ShareStore<K, V>, H = DefaultHasher> { /* private fields */ }

Implementations

impl<K, V, IS, H> HamtMap<K, V, IS, H>

where K: Eq + Send + Sync + Hash, V: Send + Sync, IS: ItemStore<K, V>, H: Hasher + Default,

pub fn new() -> HamtMap<K, V, IS, H>

pub fn iter<'a>(&'a self) -> HamtMapIterator<'a, K, V, IS, H>

pub fn find<'a>(&'a self, key: &K) -> Option<&'a V>

pub fn len(&self) -> usize

pub fn insert(self, key: K, value: V) -> (HamtMap<K, V, IS, H>, bool)

Inserts a key-value pair into the map. An existing value for a key is replaced by the new value. The first tuple element of the return value is the new map instance representing the map after the insertion. The second tuple element is true if the size of the map was changed by the operation and false otherwise.

pub fn remove(self, key: &K) -> (HamtMap<K, V, IS, H>, bool)

Removes a key-value pair from the map. The first tuple element of the return value is the new map instance representing the map after the insertion. The second tuple element is true if the size of the map was changed by the operation and false otherwise.

pub fn plus(self, key: K, val: V) -> HamtMap<K, V, IS, H>

Inserts a key-value pair into the map. Same as insert() but with a return type that’s better suited to chaining multiple calls together.

pub fn minus(self, key: &K) -> HamtMap<K, V, IS, H>

Removes a key-value pair from the map. Same as remove() but with a return type that’s better suited to chaining multiple call together

Trait Implementations

impl<K, V, IS, H> Clone for HamtMap<K, V, IS, H>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V, IS, H> Default for HamtMap<K, V, IS, H>

where K: Eq + Send + Sync + Hash, V: Send + Sync, IS: ItemStore<K, V>, H: Hasher + Default,

fn default() -> HamtMap<K, V, IS, H>

Returns the “default value” for a type.

impl<K, V, IS, H> FromIterator<(K, V)> for HamtMap<K, V, IS, H>

where K: Eq + Send + Sync + Hash, V: Send + Sync, IS: ItemStore<K, V>, H: Hasher + Default,

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

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

Creates a value from an iterator.

impl<'a, K, V, IS, H> IntoIterator for &'a HamtMap<K, V, IS, H>

where K: Eq + Send + Sync + Hash + 'a, V: Send + Sync + 'a, IS: ItemStore<K, V> + 'a, H: Hasher + Default + 'a,

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

The type of the elements being iterated over.

type IntoIter = HamtMapIterator<'a, K, V, IS, H>

Which kind of iterator are we turning this into?

fn into_iter(self) -> HamtMapIterator<'a, K, V, IS, H>

Creates an iterator from a value.

impl<K, V, IS, H> PartialEq for HamtMap<K, V, IS, H>

where K: Eq + Send + Sync + Hash, V: PartialEq + Send + Sync, IS: ItemStore<K, V>, H: Hasher + Default,

fn eq(&self, other: &HamtMap<K, V, IS, H>) -> bool

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

fn ne(&self, other: &HamtMap<K, V, IS, H>) -> bool

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

impl<K, V, IS, H> Eq for HamtMap<K, V, IS, H>

where K: Eq + Send + Sync + Hash, V: Eq + Send + Sync, IS: ItemStore<K, V>, H: Hasher + Default,