Struct wallet::states::States

pub struct States<K, S> {
    states: LinkedHashMap<K, StateRef<S>>,
}

Fields

states: LinkedHashMap<K, StateRef<S>>

Implementations

impl<K, S> States<K, S>where K: Hash + Eq,

pub fn new(key: K, state: S) -> Self

create a new States with the given initial state

by default this state is always assumed confirmed

pub fn contains<Q>(&self, key: &Q) -> boolwhere K: Borrow<Q>, Q: Hash + Eq + ?Sized,

check wether the given state associate to this key is present in the States

pub fn push(&mut self, key: K, state: S)

push a new unconfirmed state in the States

pub fn confirm<Q>(&mut self, key: &Q)where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

fn pop_old_confirmed_states(&mut self)

impl<K, S> States<K, S>

pub fn iter(&self) -> impl Iterator<Item = (&K, &StateRef<S>)>

iterate through the states from the confirmed one up to the most recent one.

there is always at least one element in the iterator (the confirmed one).

pub fn unconfirmed_states(&self) -> impl Iterator<Item = (&K, &StateRef<S>)>

pub fn confirmed_state(&self) -> &StateRef<S>

access the confirmed state of the store verse

pub fn last_state(&self) -> &StateRef<S>

get the last state of the store

Trait Implementations

impl<K: Debug, S: Debug> Debug for States<K, S>

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

Formats the value using the given formatter.