Struct rustc_data_structures::graph::dominators::Dominators

pub struct Dominators<N: Idx> {
    post_order_rank: IndexVec<N, usize>,
    immediate_dominators: IndexVec<N, Option<N>>,
}

Fields

post_order_rank: IndexVec<N, usize>

immediate_dominators: IndexVec<N, Option<N>>

Implementations

impl<Node: Idx> Dominators<Node>

pub fn dummy() -> Self

pub fn is_reachable(&self, node: Node) -> bool

pub fn immediate_dominator(&self, node: Node) -> Node

pub fn dominators(&self, node: Node) -> Iter<'_, Node>

pub fn is_dominated_by(&self, node: Node, dom: Node) -> bool

pub fn rank_partial_cmp(&self, lhs: Node, rhs: Node) -> Option<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

impl<N: Clone + Idx> Clone for Dominators<N>

fn clone(&self) -> Dominators<N>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N: Debug + Idx> Debug for Dominators<N>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference’s “Type Layout” chapter for details on type layout guarantees.

Size: 48 bytes