Struct depends::core::LeafNode

pub struct LeafNode<T> { /* private fields */ }

A node which has no dependencies. Leaf nodes receive their state from outside of the graph structure from calls to update.

Implementations

impl<T> LeafNode<T>where T: UpdateLeaf,

pub fn new(data: T) -> Rc<LeafNode<T>>

Wrap this leaf in a node.

pub fn new_with_id(data: T, id: usize) -> Rc<LeafNode<T>>

Create this node with a specified Id. Useful for tests.

pub fn update(&self, input: <T as UpdateLeaf>::Input)

The public interface to provide data to mutate the inner leaf.

Trait Implementations

impl<T> Identifiable for LeafNode<T>where T: Named,

fn id(&self) -> usize

impl<T> Named for LeafNode<T>where T: Named,

fn name() -> &'static str

impl<T> Resolve for LeafNode<T>where T: UpdateLeaf,

type Output = Ref<'a, NodeState<T, LeafNodeState>>

fn resolve( &self, visitor: &mut impl Visitor ) -> <LeafNode<T> as Resolve>::Output<'_>

You’re probably looking for resolve_root. This is recursively called on each node when a graph is being resolved.

fn resolve_root(&self, visitor: &mut impl Visitor) -> Self::Output<'_>

Pass a Visitor through this node, resolve the latest version of all dependencies, reset the visitor and return this node’s output.