Struct rustc_middle::dep_graph::DepGraphQuery
source · pub struct DepGraphQuery {
pub graph: Graph<DepNode, ()>,
pub indices: HashMap<DepNode, NodeIndex, BuildHasherDefault<FxHasher>>,
pub dep_index_to_index: IndexVec<DepNodeIndex, Option<NodeIndex>>,
}
Fields§
§graph: Graph<DepNode, ()>
§indices: HashMap<DepNode, NodeIndex, BuildHasherDefault<FxHasher>>
§dep_index_to_index: IndexVec<DepNodeIndex, Option<NodeIndex>>
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<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
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