Struct rustc_query_system::dep_graph::DepGraphQuery
source · 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§
source§impl<K: DepKind> DepGraphQuery<K>
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>>
sourcepub fn transitive_predecessors(&self, node: &DepNode<K>) -> Vec<&DepNode<K>>
pub fn transitive_predecessors(&self, node: &DepNode<K>) -> Vec<&DepNode<K>>
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§
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