Struct depends::core::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) -> Dependency<T>

Trait Implementations

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

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

Formats the value using the given formatter.

impl<T> Identifiable for Dependency<T>where T: Identifiable,

fn id(&self) -> usize

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

fn name() -> &'static str

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

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

fn resolve( &self, visitor: &mut impl Visitor ) -> <Dependency<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.