pub struct Dependency {
pub id: String,
pub label: String,
pub unsatisfied: bool,
pub via: Vec<String>,
pub cycle: Option<Cycle>,
}Expand description
One resolved depends_on edge.
Fields§
§id: String§label: String§unsatisfied: boolThe dependency appears later in the plan.
Which means the two groups depend on each other and the topological sort had to break the cycle. The plan says so rather than quietly presenting an order it could not honour.
via: Vec<String>The symbols that produced the edge — why the dependency exists.
cycle: Option<Cycle>Why the sort could not honour it, when it could not. unsatisfied says
that it happened; this says whether the cycle is in the change or only
in the grouping.
Trait Implementations§
Source§impl Clone for Dependency
impl Clone for Dependency
Source§impl Debug for Dependency
impl Debug for Dependency
impl Eq for Dependency
Source§impl PartialEq for Dependency
impl PartialEq for Dependency
impl StructuralPartialEq for Dependency
Auto Trait Implementations§
impl Freeze for Dependency
impl RefUnwindSafe for Dependency
impl Send for Dependency
impl Sync for Dependency
impl Unpin for Dependency
impl UnsafeUnpin for Dependency
impl UnwindSafe for Dependency
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.