Struct rustc_middle::dep_graph::EdgeFilter
source · pub struct EdgeFilter {
pub source: DepNodeFilter,
pub target: DepNodeFilter,
pub index_to_node: Lock<HashMap<DepNodeIndex, DepNode, BuildHasherDefault<FxHasher>>>,
}
Expand description
A filter like F -> G
where F
and G
are valid dep-node
filters. This can be used to test the source/target independently.
Fields§
§source: DepNodeFilter
§target: DepNodeFilter
§index_to_node: Lock<HashMap<DepNodeIndex, DepNode, BuildHasherDefault<FxHasher>>>
Auto Trait Implementations§
impl !RefUnwindSafe for EdgeFilter
impl Send for EdgeFilter
impl !Sync for EdgeFilter
impl Unpin for EdgeFilter
impl UnwindSafe for EdgeFilter
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: 88 bytes