Struct depends::Dependency

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

Wraps a dependency and tracks the hashed value each time it’s resolved. This allows the resolver to know if a dependency is ‘dirty’ from the perspective of the Dependee.

Implementations

impl<T> Dependency<T>

where T: Resolve,

pub fn new(dependency: T) -> Self

Trait Implementations

impl<T: Debug> Debug for Dependency<T>

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

Formats the value using the given formatter.

impl<T> Resolve for Dependency<T>

where T: Resolve, for<'a> <T as Resolve>::Output<'a>: HashValue,

type Output<'a> = DepRef<'a, <T as Resolve>::Output<'a>> where Self: 'a

fn resolve(&self, visitor: &mut impl Visitor) -> ResolveResult<Self::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 ) -> ResolveResult<Self::Output<'_>>

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