pub enum DepError {
DerivedCycle(Vec<String>),
}Expand description
Why a component has no dependency graph.
Variants§
DerivedCycle(Vec<String>)
Derived fields that depend on each other, in the order the walk met them.
a always be b + 1 beside b always be a + 1 has no fixed point: recomputing them gives
an answer that depends on the order, and the turn semantics forbid a second round. Better
refused where it is written than settled by whichever value happened to land last.
Trait Implementations§
impl Eq for DepError
impl StructuralPartialEq for DepError
Auto Trait Implementations§
impl Freeze for DepError
impl RefUnwindSafe for DepError
impl Send for DepError
impl Sync for DepError
impl Unpin for DepError
impl UnsafeUnpin for DepError
impl UnwindSafe for DepError
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,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.