Struct ra_ap_rustc_data_structures::graph::dominators::Dominators
source · pub struct Dominators<Node: Idx> { /* private fields */ }
Implementations§
source§impl<Node: Idx> Dominators<Node>
impl<Node: Idx> Dominators<Node>
sourcepub fn is_reachable(&self, node: Node) -> bool
pub fn is_reachable(&self, node: Node) -> bool
Returns true if node is reachable from the start node.
sourcepub fn immediate_dominator(&self, node: Node) -> Option<Node>
pub fn immediate_dominator(&self, node: Node) -> Option<Node>
Returns the immediate dominator of node, if any.
sourcepub fn cmp_in_dominator_order(&self, lhs: Node, rhs: Node) -> Ordering
pub fn cmp_in_dominator_order(&self, lhs: Node, rhs: Node) -> Ordering
Provide deterministic ordering of nodes such that, if any two nodes have a dominator relationship, the dominator will always precede the dominated. (The relative ordering of two unrelated nodes will also be consistent, but otherwise the order has no meaning.) This method cannot be used to determine if either Node dominates the other.
Trait Implementations§
Auto Trait Implementations§
impl<Node> RefUnwindSafe for Dominators<Node>where
Node: RefUnwindSafe,
impl<Node> Send for Dominators<Node>where
Node: Send,
impl<Node> Sync for Dominators<Node>where
Node: Sync,
impl<Node> Unpin for Dominators<Node>where
Node: Unpin,
impl<Node> UnwindSafe for Dominators<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