pub enum GraphError {
DuplicateFinding(FindingId),
UnknownFinding(FindingId),
DuplicateEdge {
cause: FindingId,
effect: FindingId,
},
Cycle {
cycle: Vec<FindingId>,
},
}Expand description
Rejected FindingGraph mutations. Every invalid state is an error, not
a panic — callers decide how to surface it.
Variants§
DuplicateFinding(FindingId)
add_finding saw an id that is already in the graph.
UnknownFinding(FindingId)
add_edge referenced an id with no finding in the graph.
DuplicateEdge
add_edge saw a cause → effect pair that is already stored.
Cycle
add_edge would close a loop; the path lists the finding ids that
would form it (first and last entry are the same id).
Trait Implementations§
Source§impl Debug for GraphError
impl Debug for GraphError
Source§impl Display for GraphError
impl Display for GraphError
impl Eq for GraphError
Source§impl Error for GraphError
impl Error for GraphError
1.30.0 · Source§fn source(&self) -> Option<&(dyn Error + 'static)>
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns the lower-level source of this error, if any. Read more
1.0.0 · Source§fn description(&self) -> &str
fn description(&self) -> &str
👎Deprecated since 1.42.0:
use the Display impl or to_string()
Source§impl PartialEq for GraphError
impl PartialEq for GraphError
impl StructuralPartialEq for GraphError
Auto Trait Implementations§
impl Freeze for GraphError
impl RefUnwindSafe for GraphError
impl Send for GraphError
impl Sync for GraphError
impl Unpin for GraphError
impl UnsafeUnpin for GraphError
impl UnwindSafe for GraphError
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<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.