Struct rustc_query_system::dep_graph::query::DepGraphQuery

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>

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

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

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

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

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

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

All nodes that can reach node.

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: 168 bytes