Struct rustc_query_system::dep_graph::DepGraphQuery
source · pub struct DepGraphQuery {
pub graph: Graph<DepNode, ()>,
pub indices: FxHashMap<DepNode, NodeIndex>,
pub dep_index_to_index: IndexVec<DepNodeIndex, Option<NodeIndex>>,
}
Fields§
§graph: Graph<DepNode, ()>
§indices: FxHashMap<DepNode, NodeIndex>
§dep_index_to_index: IndexVec<DepNodeIndex, Option<NodeIndex>>
Implementations§
source§impl DepGraphQuery
impl DepGraphQuery
pub fn new(prev_node_count: usize) -> DepGraphQuery
pub fn push( &mut self, index: DepNodeIndex, node: DepNode, edges: &[DepNodeIndex] )
pub fn nodes(&self) -> Vec<&DepNode>
pub fn edges(&self) -> Vec<(&DepNode, &DepNode)>
fn reachable_nodes(&self, node: &DepNode, direction: Direction) -> Vec<&DepNode>
sourcepub fn transitive_predecessors(&self, node: &DepNode) -> Vec<&DepNode>
pub fn transitive_predecessors(&self, node: &DepNode) -> Vec<&DepNode>
All nodes that can reach node
.
Auto Trait Implementations§
impl RefUnwindSafe for DepGraphQuery
impl Send for DepGraphQuery
impl Sync for DepGraphQuery
impl Unpin for DepGraphQuery
impl UnwindSafe for DepGraphQuery
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle: &[QueryInfo], _guar: ErrorGuaranteed ) -> 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: 104 bytes