[−][src]Struct rustc_query_system::dep_graph::query::DepGraphQuery
Fields
graph: Graph<DepNode<K>, ()>indices: FxHashMap<DepNode<K>, NodeIndex>Implementations
impl<K: DepKind> DepGraphQuery<K>[src]
pub fn new(
nodes: &[DepNode<K>],
edges: &[(DepNode<K>, DepNode<K>)]
) -> DepGraphQuery<K>[src]
nodes: &[DepNode<K>],
edges: &[(DepNode<K>, DepNode<K>)]
) -> DepGraphQuery<K>
pub fn contains_node(&self, node: &DepNode<K>) -> bool[src]
pub fn nodes(&self) -> Vec<&DepNode<K>>[src]
pub fn edges(&self) -> Vec<(&DepNode<K>, &DepNode<K>)>[src]
pub(in dep_graph::query) fn reachable_nodes(
&self,
node: &DepNode<K>,
direction: Direction
) -> Vec<&DepNode<K>>[src]
&self,
node: &DepNode<K>,
direction: Direction
) -> Vec<&DepNode<K>>
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,
K: RefUnwindSafe,
impl<K> Send for DepGraphQuery<K> where
K: Send,
K: Send,
impl<K> Sync for DepGraphQuery<K> where
K: Sync,
K: Sync,
impl<K> Unpin for DepGraphQuery<K> where
K: Unpin,
K: Unpin,
impl<K> UnwindSafe for DepGraphQuery<K> where
K: UnwindSafe,
K: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T[src]
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,