rustc_lint::impl_trait_overcaptures

Struct VisitOpaqueTypes

source
struct VisitOpaqueTypes<'tcx, VarFn, OutlivesFn> {
    tcx: TyCtxt<'tcx>,
    parent_def_id: LocalDefId,
    in_scope_parameters: FxIndexMap<DefId, ParamKind>,
    variances: LazyCell<FxHashMap<DefId, Variance>, VarFn>,
    outlives_env: LazyCell<OutlivesEnvironment<'tcx>, OutlivesFn>,
    seen: FxIndexSet<LocalDefId>,
}

Fields§

§tcx: TyCtxt<'tcx>§parent_def_id: LocalDefId§in_scope_parameters: FxIndexMap<DefId, ParamKind>§variances: LazyCell<FxHashMap<DefId, Variance>, VarFn>§outlives_env: LazyCell<OutlivesEnvironment<'tcx>, OutlivesFn>§seen: FxIndexSet<LocalDefId>

Trait Implementations§

source§

impl<'tcx, VarFn, OutlivesFn> TypeVisitor<TyCtxt<'tcx>> for VisitOpaqueTypes<'tcx, VarFn, OutlivesFn>
where VarFn: FnOnce() -> FxHashMap<DefId, Variance>, OutlivesFn: FnOnce() -> OutlivesEnvironment<'tcx>,

source§

fn visit_binder<T: TypeVisitable<TyCtxt<'tcx>>>(&mut self, t: &Binder<'tcx, T>)

source§

fn visit_ty(&mut self, t: Ty<'tcx>)

source§

type Result = ()

source§

fn visit_region(&mut self, r: <I as Interner>::Region) -> Self::Result

source§

fn visit_const(&mut self, c: <I as Interner>::Const) -> Self::Result

source§

fn visit_predicate(&mut self, p: <I as Interner>::Predicate) -> Self::Result

source§

fn visit_clauses(&mut self, p: <I as Interner>::Clauses) -> Self::Result

source§

fn visit_error( &mut self, _guar: <I as Interner>::ErrorGuaranteed, ) -> Self::Result

Auto Trait Implementations§

§

impl<'tcx, VarFn, OutlivesFn> !Freeze for VisitOpaqueTypes<'tcx, VarFn, OutlivesFn>

§

impl<'tcx, VarFn, OutlivesFn> !RefUnwindSafe for VisitOpaqueTypes<'tcx, VarFn, OutlivesFn>

§

impl<'tcx, VarFn, OutlivesFn> !Send for VisitOpaqueTypes<'tcx, VarFn, OutlivesFn>

§

impl<'tcx, VarFn, OutlivesFn> !Sync for VisitOpaqueTypes<'tcx, VarFn, OutlivesFn>

§

impl<'tcx, VarFn, OutlivesFn> Unpin for VisitOpaqueTypes<'tcx, VarFn, OutlivesFn>
where VarFn: Unpin, OutlivesFn: Unpin,

§

impl<'tcx, VarFn, OutlivesFn> !UnwindSafe for VisitOpaqueTypes<'tcx, VarFn, OutlivesFn>

Blanket Implementations§

source§

impl<T> Aligned for T

source§

const ALIGN: Alignment = _

Alignment of Self.
source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T, R> CollectAndApply<T, R> for T

source§

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

source§

type Output = R

source§

impl<T> Filterable for T

source§

fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

Creates a filterable data provider with the given name for debugging. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<P> IntoQueryParam<P> for P

source§

impl<T> MaybeResult<T> for T

source§

type Error = !

source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

source§

impl<T> Same for T

source§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

source§

fn upcast(self, interner: I) -> U

source§

impl<I, T> UpcastFrom<I, T> for T

source§

fn upcast_from(from: T, _tcx: I) -> T

source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

impl<'a, T> Captures<'a> for T
where T: ?Sized,

source§

impl<T> ErasedDestructor for T
where T: 'static,

source§

impl<T> MaybeSendSync for T

Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.