pub enum Problem {
Twice(String),
NoNode {
from: String,
to: String,
end: String,
},
FeedsItself(String),
Cycle(Vec<String>),
NoSource,
NoSink,
SourceHasInputs(String),
NoInput(String),
SinkNotLeaf(String),
LeafNotSink(String),
Unresolved {
id: String,
why: String,
},
}Expand description
Something wrong with a graph (Graph::check). The texts are general; an application
can word them its own way by matching on the variant.
Variants§
Twice(String)
Two nodes have this id.
NoNode
An edge names a node that is not there (end).
FeedsItself(String)
Cycle(Vec<String>)
The nodes that could not be ordered.
NoSource
NoSink
SourceHasInputs(String)
NoInput(String)
A step or sink with nothing feeding it.
SinkNotLeaf(String)
LeafNotSink(String)
A leaf that is not a sink.
Unresolved
The application could not resolve what the node names.
Trait Implementations§
impl Eq for Problem
impl StructuralPartialEq for Problem
Auto Trait Implementations§
impl Forget for Problem
impl Freeze for Problem
impl Move for Problem
impl RefUnwindSafe for Problem
impl Send for Problem
impl Sync for Problem
impl Unpin for Problem
impl UnsafeUnpin for Problem
impl UnwindSafe for Problem
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.