pub struct PostDominators<Node: Idx> { /* private fields */ }Expand description
Represents the post-dominators of a graph’s nodes with respect to a particular exit.
Implementations§
Source§impl<Node: Idx> PostDominators<Node>
 
impl<Node: Idx> PostDominators<Node>
Sourcepub fn build<G: ControlFlowGraph<Node = Node>>(graph: &G, exit: Node) -> Self
 
pub fn build<G: ControlFlowGraph<Node = Node>>(graph: &G, exit: Node) -> Self
Constructs the post-dominators by computing the dominators on a reversed graph.
Sourcepub fn immediate_post_dominator(&self, node: Node) -> Option<Node>
 
pub fn immediate_post_dominator(&self, node: Node) -> Option<Node>
Gets the node that immediately post-dominators node, if one exists.
Sourcepub fn post_dominators(
    &self,
    node: Node,
) -> Option<impl Iterator<Item = Node> + '_>
 
pub fn post_dominators( &self, node: Node, ) -> Option<impl Iterator<Item = Node> + '_>
Gets all nodes that post-dominate node, if they exist.
Auto Trait Implementations§
impl<Node> Freeze for PostDominators<Node>
impl<Node> RefUnwindSafe for PostDominators<Node>where
    Node: RefUnwindSafe,
impl<Node> Send for PostDominators<Node>where
    Node: Send,
impl<Node> Sync for PostDominators<Node>where
    Node: Sync,
impl<Node> Unpin for PostDominators<Node>where
    Node: Unpin,
impl<Node> UnwindSafe for PostDominators<Node>where
    Node: UnwindSafe,
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