Struct rustc_middle::ty::IsSuggestableVisitor
source · Fields§
§tcx: TyCtxt<'tcx>§infer_suggestable: boolTrait Implementations§
source§impl<'tcx> TypeVisitor<'tcx> for IsSuggestableVisitor<'tcx>
impl<'tcx> TypeVisitor<'tcx> for IsSuggestableVisitor<'tcx>
type BreakTy = ()
fn visit_ty(&mut self, t: Ty<'tcx>) -> ControlFlow<Self::BreakTy>
fn visit_const(&mut self, c: Const<'tcx>) -> ControlFlow<Self::BreakTy>
fn visit_binder<T: TypeVisitable<'tcx>>(
&mut self,
t: &Binder<'tcx, T>
) -> ControlFlow<Self::BreakTy>
fn visit_region(&mut self, r: Region<'tcx>) -> ControlFlow<Self::BreakTy>
fn visit_predicate(&mut self, p: Predicate<'tcx>) -> ControlFlow<Self::BreakTy>
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for IsSuggestableVisitor<'tcx>
impl<'tcx> !Send for IsSuggestableVisitor<'tcx>
impl<'tcx> !Sync for IsSuggestableVisitor<'tcx>
impl<'tcx> Unpin for IsSuggestableVisitor<'tcx>
impl<'tcx> !UnwindSafe for IsSuggestableVisitor<'tcx>
Blanket Implementations§
source§impl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
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, _: &[QueryInfo]) -> 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: 16 bytes