Struct dsnp_graph_core::util::transactional_hashmap::TransactionalHashMap

pub struct TransactionalHashMap<K, V>where
    K: Eq + Hash + Clone,
    V: Clone,{ /* private fields */ }

Implementations

impl<K, V> TransactionalHashMap<K, V>where K: Eq + Hash + Clone, V: Clone,

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn inner(&self) -> &HashMap<K, V>

pub fn entry(&mut self, key: K) -> Entry<'_, K, V>

pub fn insert(&mut self, k: K, v: V) -> Option<V>

pub fn remove(&mut self, k: &K) -> Option<V>

pub fn clear(&mut self)

pub fn len(&self) -> usize

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

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

Trait Implementations

impl<K, V> Clone for TransactionalHashMap<K, V>where K: Eq + Hash + Clone + Clone, V: Clone + Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for TransactionalHashMap<K, V>where K: Eq + Hash + Clone + Debug, V: Clone + Debug,

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

Formats the value using the given formatter.

impl<K, V> Extend<(K, V)> for TransactionalHashMap<K, V>where K: Eq + Hash + Clone, V: Clone,

fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<K, V> FromIterator<(K, V)> for TransactionalHashMap<K, V>where K: Eq + Hash + Clone, V: Clone,

fn from_iter<T: IntoIterator<Item = (K, V)>>( iter: T ) -> TransactionalHashMap<K, V>

This is creating a new TransactionalHashMap from iterator and since it is initializing a new instance there is no need to track the initial items inside

impl<K, V> PartialEq for TransactionalHashMap<K, V>where K: Eq + Hash + Clone + PartialEq, V: Clone + PartialEq,

fn eq(&self, other: &TransactionalHashMap<K, V>) -> 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<K, V> Transactional for TransactionalHashMap<K, V>where K: Eq + Hash + Clone, V: Clone,

fn commit(&mut self)

fn rollback(&mut self)

impl<K, V> Eq for TransactionalHashMap<K, V>where K: Eq + Hash + Clone + Eq, V: Clone + Eq,

impl<K, V> StructuralEq for TransactionalHashMap<K, V>where K: Eq + Hash + Clone, V: Clone,

impl<K, V> StructuralPartialEq for TransactionalHashMap<K, V>where K: Eq + Hash + Clone, V: Clone,