Struct DepGraph

Source

pub struct DepGraph<I>where
    I: Clone + Debug + Eq + Hash + PartialEq + Send + Sync + 'static,{
    pub ready_nodes: Vec<I>,
    pub deps: Arc<RwLock<HashMap<I, HashSet<I>>>>,
    pub rdeps: Arc<RwLock<HashMap<I, HashSet<I>>>>,
}

Expand description

Dependency graph

Fields§

§ready_nodes: Vec§deps: Arc<RwLock<HashMap<I, HashSet>>>§rdeps: Arc<RwLock<HashMap<I, HashSet>>>

Implementations§

Source §

impl DepGraph
where I: Clone + Debug + Eq + Hash + PartialEq + Send + Sync + 'static,

Source

pub fn new(nodes: &[Node]) -> Self

Create a new DepGraph based on a vector of edges.

Trait Implementations§

Source §

impl IntoIterator for DepGraph
where I: Clone + Debug + Eq + Hash + PartialEq + Send + Sync + 'static,

Source §

type Item = I

The type of the elements being iterated over.

Source §

type IntoIter = DepGraphIter

Which kind of iterator are we turning this into?

Source §

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

Source §

impl IntoParallelIterator for DepGraph
where I: Clone + Debug + Eq + Hash + PartialEq + Send + Sync + 'static,

Add into_par_iter() to DepGraph

Source §

type Item = Wrapper

The type of item that the parallel iterator will produce.

Source §

type Iter = DepGraphParIter

The parallel iterator type that will be created.

Source §

fn into_par_iter(self) -> Self::Iter

Converts self into a parallel iterator. Read more

Auto Trait Implementations§

§

impl UnwindSafe for DepGraph
where I: UnwindSafe,

Blanket Implementations§

Source §

impl<T> Any for T
where T: 'static + ?Sized,

Source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

Source §

impl<T> Borrow<T> for T
where T: ?Sized,

Source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

Source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

Source §

impl<T> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<T, U> Into for T
where U: From<T>,

Source §

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source §

impl<T> IntoEither for T

Source §

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §