Struct rustc_query_system::dep_graph::query::DepGraphQuery[−][src]

pub struct DepGraphQuery<K> {
    pub graph: Graph<DepNode<K>, ()>,
    pub indices: FxHashMap<DepNode<K>, NodeIndex>,
    pub dep_index_to_index: IndexVec<DepNodeIndex, Option<NodeIndex>>,
}

Fields

graph: Graph<DepNode<K>, ()>indices: FxHashMap<DepNode<K>, NodeIndex>dep_index_to_index: IndexVec<DepNodeIndex, Option<NodeIndex>>

Implementations

impl<K: DepKind> DepGraphQuery<K>[src]

pub fn new(prev_node_count: usize) -> DepGraphQuery<K>[src]

pub fn push(
    &mut self,
    index: DepNodeIndex,
    node: DepNode<K>,
    edges: &[DepNodeIndex]
)[src]

pub fn nodes(&self) -> Vec<&DepNode<K>>[src]

pub fn edges(&self) -> Vec<(&DepNode<K>, &DepNode<K>)>[src]

fn reachable_nodes(
    &self,
    node: &DepNode<K>,
    direction: Direction
) -> Vec<&DepNode<K>>[src]

pub fn transitive_predecessors(&self, node: &DepNode<K>) -> Vec<&DepNode<K>>[src]

All nodes that can reach node.

Auto Trait Implementations

impl<K> RefUnwindSafe for DepGraphQuery<K> where
    K: RefUnwindSafe, 

impl<K> Send for DepGraphQuery<K> where
    K: Send, 

impl<K> Sync for DepGraphQuery<K> where
    K: Sync, 

impl<K> Unpin for DepGraphQuery<K> where
    K: Unpin, 

impl<K> UnwindSafe for DepGraphQuery<K> where
    K: UnwindSafe, 

Blanket Implementations

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

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

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

The type returned in the event of a conversion error.