Struct rustc_data_structures::graph::dominators::Dominators[−][src]

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

[src]

pub fn dominators(&self, node: Node) -> Iter<'_, Node>ⓘ
Notable traits for Iter<'dom, Node>
`impl<'dom, Node: Idx> Iterator for Iter<'dom, Node> type Item = Node;`

[src]

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

[src]

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

[src]

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

[src]

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

Returns a copy of the value. Read more

1.0.0[src]

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

Performs copy-assignment from source. Read more

[src]

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

[src]

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

Formats the value using the given formatter. Read more

Auto Trait Implementations

impl<N> RefUnwindSafe for Dominators<N> where
N: RefUnwindSafe,

impl<N> Send for Dominators<N> where
N: Send,

impl<N> Sync for Dominators<N> where
N: Sync,

impl<N> Unpin for Dominators<N> where
N: Unpin,

impl<N> UnwindSafe for Dominators<N> where
N: UnwindSafe,

Blanket Implementations

[src]

impl<T> Any for T where
T: 'static + ?Sized,

[src]

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

[src]

impl<T> Borrow<T> for T where
T: ?Sized,

[src]

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

[src]

impl<T> BorrowMut<T> for T where
T: ?Sized,

[src]

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

[src]

impl<T> From<T> for T

[src]

pub fn from(t: T) -> T

Performs the conversion.

[src]

impl<T, U> Into for T where
U: From<T>,

[src]

pub fn into(self) -> U

Performs the conversion.

[src]

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

[src]

pub fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

[src]

pub fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

[src]

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

[src]

pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

[src]

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

[src]

pub fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

[src]

impl<'a, T> Captures<'a> for T where
T: ?Sized,

[src]

impl<T> Erased for T

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

Struct rustc_data_structures::graph::dominators::Dominators[−][src]

Fields

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>ⓘNotable traits for Iter<'dom, Node>impl<'dom, Node: Idx> Iterator for Iter<'dom, Node> type Item = Node;

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

pub fn rank_partial_cmp(&self, lhs: Node, rhs: Node) -> Option<Ordering>

Trait Implementations

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

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

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

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

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

Auto Trait Implementations

impl<N> RefUnwindSafe for Dominators<N> where N: RefUnwindSafe,

impl<N> Send for Dominators<N> where N: Send,

impl<N> Sync for Dominators<N> where N: Sync,

impl<N> Unpin for Dominators<N> where N: Unpin,

impl<N> UnwindSafe for Dominators<N> where N: UnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

pub fn into(self) -> U

impl<T> ToOwned for T where T: Clone,

type Owned = T

pub fn to_owned(&self) -> T

pub fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<'a, T> Captures<'a> for T where T: ?Sized,

impl<T> Erased for T

Layout

pub fn dominators(&self, node: Node) -> Iter<'_, Node>ⓘ
Notable traits for Iter<'dom, Node>
`impl<'dom, Node: Idx> Iterator for Iter<'dom, Node> type Item = Node;`

impl<N> RefUnwindSafe for Dominators<N> where
N: RefUnwindSafe,

impl<N> Send for Dominators<N> where
N: Send,

impl<N> Sync for Dominators<N> where
N: Sync,

impl<N> Unpin for Dominators<N> where
N: Unpin,

impl<N> UnwindSafe for Dominators<N> where
N: UnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<'a, T> Captures<'a> for T where
T: ?Sized,