pub struct NodeState<T, N = DependeeNodeState> { /* private fields */ }
Expand description
A wrapper for some data T
, tracking some context around the data’s
computation state.
Implementations§
source§impl<T, N> NodeState<T, N>where
T: HashValue,
impl<T, N> NodeState<T, N>where T: HashValue,
pub fn node_hash(&self) -> NodeHash
pub fn node_hash_mut(&mut self) -> &mut NodeHash
sourcepub fn update_node_hash(&mut self, hasher: &mut impl Hasher)
pub fn update_node_hash(&mut self, hasher: &mut impl Hasher)
Update the stored hash value of the data.
source§impl<T> NodeState<T, LeafNodeState>where
T: UpdateLeaf,
impl<T> NodeState<T, LeafNodeState>where T: UpdateLeaf,
Trait Implementations§
source§impl<T, N> HashValue for NodeState<T, N>where
T: HashValue,
impl<T, N> HashValue for NodeState<T, N>where T: HashValue,
source§fn hash_value(&self, _: &mut impl Hasher) -> NodeHash
fn hash_value(&self, _: &mut impl Hasher) -> NodeHash
Either a unique number, or a value detailing that this node cannot be
hashed.