Struct depends::core::NodeState

pub struct NodeState<T, N = DependeeNodeState> { /* private fields */ }

A wrapper for some data T, tracking some context around the data’s computation state.

Implementations

impl<T, N> NodeState<T, N>where T: HashValue,

pub fn node_hash(&self) -> NodeHash

pub fn node_hash_mut(&mut self) -> &mut NodeHash

pub fn update_node_hash(&mut self, hasher: &mut impl Hasher)

Update the stored hash value of the data.

impl<T> NodeState<T, LeafNodeState>where T: UpdateLeaf,

pub fn new_leaf(data: T) -> NodeState<T, LeafNodeState>

pub fn state(&self) -> LeafState

pub fn state_mut(&mut self) -> &mut LeafState

Trait Implementations

impl<T, N> Clean for NodeState<T, N>where T: Clean,

fn clean(&mut self)

impl<T, N> Deref for NodeState<T, N>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &<NodeState<T, N> as Deref>::Target

Dereferences the value.

impl<T, N> DerefMut for NodeState<T, N>

fn deref_mut(&mut self) -> &mut <NodeState<T, N> as Deref>::Target

Mutably dereferences the value.

impl<T, N> HashValue for NodeState<T, N>where T: HashValue,

fn hash_value(&self, _: &mut impl Hasher) -> NodeHash

Either a unique number, or a value detailing that this node cannot be hashed.

impl<T, N> Named for NodeState<T, N>where T: Named,

fn name() -> &'static str

impl<T> UpdateLeaf for NodeState<T, LeafNodeState>where T: UpdateLeaf,

type Input = <T as UpdateLeaf>::Input

fn update_mut( &mut self, input: <NodeState<T, LeafNodeState> as UpdateLeaf>::Input )