pub struct GraphAcyclicRule;Expand description
The dataflow graph must be acyclic (ONNX_RS §8.2 GraphAcyclicRule). Wraps
the IR’s own topological-order check.
Trait Implementations§
Source§impl ValidationRule for GraphAcyclicRule
impl ValidationRule for GraphAcyclicRule
Auto Trait Implementations§
impl Freeze for GraphAcyclicRule
impl RefUnwindSafe for GraphAcyclicRule
impl Send for GraphAcyclicRule
impl Sync for GraphAcyclicRule
impl Unpin for GraphAcyclicRule
impl UnsafeUnpin for GraphAcyclicRule
impl UnwindSafe for GraphAcyclicRule
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