Struct move_stackless_bytecode::graph::Graph
source · [−]Implementations
sourceimpl<T: Ord + Copy + Debug> Graph<T>
impl<T: Ord + Copy + Debug> Graph<T>
sourcepub fn new(entry: T, nodes: Vec<T>, edges: Vec<(T, T)>) -> Self
pub fn new(entry: T, nodes: Vec<T>, edges: Vec<(T, T)>) -> Self
This function creates a graph from a set of nodes (with a unique entry node) and a set of edges.
sourcepub fn compute_reducible(&self) -> Option<Vec<NaturalLoop<T>>>
pub fn compute_reducible(&self) -> Option<Vec<NaturalLoop<T>>>
This function computes the loop headers and natural loops of a reducible graph. If the graph is irreducible, None is returned.
Auto Trait Implementations
impl<T> RefUnwindSafe for Graph<T> where
T: RefUnwindSafe,
impl<T> Send for Graph<T> where
T: Send,
impl<T> Sync for Graph<T> where
T: Sync,
impl<T> Unpin for Graph<T> where
T: Unpin,
impl<T> UnwindSafe for Graph<T> where
T: UnwindSafe + RefUnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more