Struct DependencyTree

pub struct DependencyTree { /* private fields */ }

Dependency table.

Acts as a dependency resolution cache as well.

Implementations

impl DependencyTree

pub const fn new() -> Self

Create empty dependency tree.

pub fn contains<P>(&self, path: &P) -> bool

where PathBuf: Borrow<P>, P: Ord + ?Sized,

Check if the tree contains the dependent specified by its path.

pub fn get<P>(&self, path: &P) -> Option<&[PathBuf]>

where PathBuf: Borrow<P>, P: Ord + ?Sized,

Get dependencies by path of the dependent.

pub fn insert( &mut self, dependent: PathBuf, dependencies: Vec<PathBuf>, ) -> Option<Vec<PathBuf>>

Insert new dependent and its dependencies.

Returns the previous value if any.

pub fn remove<P>(&mut self, path: &P) -> Option<Vec<PathBuf>>

where PathBuf: Borrow<P>, P: Ord + ?Sized,

Remove the dependent and its dependencies from the tree.

pub fn len(&self) -> usize

Get the number of dependents in the tree.

pub fn is_empty(&self) -> bool

Returns true if the tree doesn’t have any dependents.

pub fn iter(&self) -> Iter<'_, (PathBuf, Vec<PathBuf>)>

Get iterator over elements.

Trait Implementations

impl Debug for DependencyTree

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

Formats the value using the given formatter.

impl Default for DependencyTree

fn default() -> Self

Returns the “default value” for a type.

impl IntoIterator for DependencyTree

type Item = (PathBuf, Vec<PathBuf>)

The type of the elements being iterated over.

type IntoIter = IntoIter<<DependencyTree as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.