Struct rustc_middle::ty::sty::Binder

source ·
pub struct Binder<'tcx, T> {
    value: T,
    bound_vars: &'tcx List<BoundVariableKind>,
}
Expand description

Binder is a binder for higher-ranked lifetimes or types. It is part of the compiler’s representation for things like for<'a> Fn(&'a isize) (which would be represented by the type PolyTraitRef == Binder<'tcx, TraitRef>). Note that when we instantiate, erase, or otherwise “discharge” these bound vars, we change the type from Binder<'tcx, T> to just T (see e.g., liberate_late_bound_regions).

Decodable and Encodable are implemented for Binder<T> using the impl_binder_encode_decode! macro.

Fields§

§value: T§bound_vars: &'tcx List<BoundVariableKind>

Implementations§

source§

impl<'tcx> Binder<'tcx, TraitRef<'tcx>>

source§

impl<'tcx> Binder<'tcx, TraitPredicate<'tcx>>

source§

impl<'tcx> Binder<'tcx, ExistentialPredicate<'tcx>>

source

pub fn with_self_ty(&self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx>) -> Clause<'tcx>

Given an existential predicate like ?Self: PartialEq<u32> (e.g., derived from dyn PartialEq<u32>), and a concrete type self_ty, returns a full predicate where the existentially quantified variable ?Self has been replaced with self_ty (e.g., self_ty: PartialEq<u32>, in our example).

source§

impl<'tcx> Binder<'tcx, TraitRef<'tcx>>

source

pub fn self_ty(&self) -> Binder<'tcx, Ty<'tcx>>

source

pub fn def_id(&self) -> DefId

source§

impl<'tcx> Binder<'tcx, ExistentialTraitRef<'tcx>>

source

pub fn def_id(&self) -> DefId

source

pub fn with_self_ty( &self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx> ) -> PolyTraitRef<'tcx>

Object types don’t have a self type specified. Therefore, when we convert the principal trait-ref into a normal trait-ref, you must give some self type. A common choice is mk_err() or some placeholder type.

source§

impl<'tcx> Binder<'tcx, ExistentialProjection<'tcx>>

source

pub fn with_self_ty( &self, tcx: TyCtxt<'tcx>, self_ty: Ty<'tcx> ) -> PolyProjectionPredicate<'tcx>

source

pub fn item_def_id(&self) -> DefId

source§

impl<'tcx> Binder<'tcx, TraitPredicate<'tcx>>

source

pub fn def_id(self) -> DefId

source

pub fn self_ty(self) -> Binder<'tcx, Ty<'tcx>>

source

pub fn polarity(self) -> PredicatePolarity

source§

impl<'tcx> Binder<'tcx, ProjectionPredicate<'tcx>>

source

pub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId

Returns the DefId of the trait of the associated item being projected.

source

pub fn required_poly_trait_ref(&self, tcx: TyCtxt<'tcx>) -> PolyTraitRef<'tcx>

Get the PolyTraitRef required for this projection to be well formed. Note that for generic associated types the predicates of the associated type also need to be checked.

source

pub fn term(&self) -> Binder<'tcx, Term<'tcx>>

source

pub fn projection_def_id(&self) -> DefId

The DefId of the TraitItem for the associated type.

Note that this is not the DefId of the TraitRef containing this associated type, which is in tcx.associated_item(projection_def_id()).container.

source§

impl<'tcx, T> Binder<'tcx, T>
where T: TypeVisitable<TyCtxt<'tcx>>,

source

pub fn dummy(value: T) -> Binder<'tcx, T>

Wraps value in a binder, asserting that value does not contain any bound vars that would be bound by the binder. This is commonly used to ‘inject’ a value T into a different binding level.

source

pub fn bind_with_vars( value: T, bound_vars: &'tcx List<BoundVariableKind> ) -> Binder<'tcx, T>

source§

impl<'tcx, T> Binder<'tcx, T>

source

pub fn skip_binder(self) -> T

Skips the binder and returns the “bound” value. This is a risky thing to do because it’s easy to get confused about De Bruijn indices and the like. It is usually better to discharge the binder using no_bound_vars or instantiate_bound_regions or something like that. skip_binder is only valid when you are either extracting data that has nothing to do with bound vars, you are doing some sort of test that does not involve bound regions, or you are being very careful about your depth accounting.

Some examples where skip_binder is reasonable:

  • extracting the DefId from a PolyTraitRef;
  • comparing the self type of a PolyTraitRef to see if it is equal to a type parameter X, since the type X does not reference any regions
source

pub fn bound_vars(&self) -> &'tcx List<BoundVariableKind>

source

pub fn as_ref(&self) -> Binder<'tcx, &T>

source

pub fn as_deref(&self) -> Binder<'tcx, &T::Target>
where T: Deref,

source

pub fn map_bound_ref_unchecked<F, U>(&self, f: F) -> Binder<'tcx, U>
where F: FnOnce(&T) -> U,

source

pub fn map_bound_ref<F, U: TypeVisitable<TyCtxt<'tcx>>>( &self, f: F ) -> Binder<'tcx, U>
where F: FnOnce(&T) -> U,

source

pub fn map_bound<F, U: TypeVisitable<TyCtxt<'tcx>>>( self, f: F ) -> Binder<'tcx, U>
where F: FnOnce(T) -> U,

source

pub fn try_map_bound<F, U: TypeVisitable<TyCtxt<'tcx>>, E>( self, f: F ) -> Result<Binder<'tcx, U>, E>
where F: FnOnce(T) -> Result<U, E>,

source

pub fn rebind<U>(&self, value: U) -> Binder<'tcx, U>
where U: TypeVisitable<TyCtxt<'tcx>>,

Wraps a value in a binder, using the same bound variables as the current Binder. This should not be used if the new value changes the bound variables. Note: the (old or new) value itself does not necessarily need to name all the bound variables.

This currently doesn’t do anything different than bind, because we don’t actually track bound vars. However, semantically, it is different because bound vars aren’t allowed to change here, whereas they are in bind. This may be (debug) asserted in the future.

source

pub fn no_bound_vars(self) -> Option<T>
where T: TypeVisitable<TyCtxt<'tcx>>,

Unwraps and returns the value within, but only if it contains no bound vars at all. (In other words, if this binder – and indeed any enclosing binder – doesn’t bind anything at all.) Otherwise, returns None.

(One could imagine having a method that just unwraps a single binder, but permits late-bound vars bound by enclosing binders, but that would require adjusting the debruijn indices, and given the shallow binding structure we often use, would not be that useful.)

source

pub fn split<U, V, F>(self, f: F) -> (Binder<'tcx, U>, Binder<'tcx, V>)
where F: FnOnce(T) -> (U, V),

Splits the contents into two things that share the same binder level as the original, returning two distinct binders.

f should consider bound regions at depth 1 to be free, and anything it produces with bound regions at depth 1 will be bound in the resulting return values.

source§

impl<'tcx, T> Binder<'tcx, Option<T>>

source

pub fn transpose(self) -> Option<Binder<'tcx, T>>

source§

impl<'tcx, T: IntoIterator> Binder<'tcx, T>

source

pub fn iter(self) -> impl Iterator<Item = Binder<'tcx, T::Item>>

source§

impl<'tcx> Binder<'tcx, FnSig<'tcx>>

source

pub fn inputs(&self) -> Binder<'tcx, &'tcx [Ty<'tcx>]>

source

pub fn input(&self, index: usize) -> Binder<'tcx, Ty<'tcx>>

source

pub fn inputs_and_output(&self) -> Binder<'tcx, &'tcx List<Ty<'tcx>>>

source

pub fn output(&self) -> Binder<'tcx, Ty<'tcx>>

source

pub fn c_variadic(&self) -> bool

source

pub fn unsafety(&self) -> Unsafety

source

pub fn abi(&self) -> Abi

source

pub fn is_fn_trait_compatible(&self) -> bool

Trait Implementations§

source§

impl<'tcx, T> BoundVars<TyCtxt<'tcx>> for Binder<'tcx, T>

source§

impl<'tcx, T: Clone> Clone for Binder<'tcx, T>

source§

fn clone(&self) -> Binder<'tcx, T>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<'tcx, T: Debug> Debug for Binder<'tcx, T>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'tcx, T: DebugWithInfcx<TyCtxt<'tcx>>> DebugWithInfcx<TyCtxt<'tcx>> for Binder<'tcx, T>

source§

fn fmt<Infcx: InferCtxtLike<Interner = TyCtxt<'tcx>>>( this: WithInfcx<'_, Infcx, &Self>, f: &mut Formatter<'_> ) -> Result

source§

impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, &'tcx List<Ty<'tcx>>>

source§

fn decode(decoder: &mut D) -> Self

source§

impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, ExistentialPredicate<'tcx>>

source§

fn decode(decoder: &mut D) -> Self

source§

impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, ExistentialTraitRef<'tcx>>

source§

fn decode(decoder: &mut D) -> Self

source§

impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, FnSig<'tcx>>

source§

fn decode(decoder: &mut D) -> Self

source§

impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, Predicate<'tcx>>

source§

fn decode(decoder: &mut D) -> Self

source§

impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, PredicateKind<'tcx>>

source§

fn decode(decoder: &mut D) -> Binder<'tcx, PredicateKind<'tcx>>

source§

impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, TraitPredicate<'tcx>>

source§

fn decode(decoder: &mut D) -> Self

source§

impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, TraitRef<'tcx>>

source§

fn decode(decoder: &mut D) -> Self

source§

impl<'tcx> Display for Binder<'tcx, FnSig<'tcx>>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'tcx> Display for Binder<'tcx, ProjectionPredicate<'tcx>>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'tcx> Display for Binder<'tcx, TraitPredPrintModifiersAndPath<'tcx>>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'tcx> Display for Binder<'tcx, TraitPredicate<'tcx>>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'tcx> Display for Binder<'tcx, TraitRef<'tcx>>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'tcx> Display for Binder<'tcx, TraitRefPrintOnlyTraitPath<'tcx>>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'tcx> Display for Binder<'tcx, TraitRefPrintSugared<'tcx>>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, &'tcx List<Ty<'tcx>>>

source§

fn encode(&self, e: &mut E)

source§

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, ExistentialPredicate<'tcx>>

source§

fn encode(&self, e: &mut E)

source§

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, ExistentialTraitRef<'tcx>>

source§

fn encode(&self, e: &mut E)

source§

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, FnSig<'tcx>>

source§

fn encode(&self, e: &mut E)

source§

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, Predicate<'tcx>>

source§

fn encode(&self, e: &mut E)

source§

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, PredicateKind<'tcx>>

source§

fn encode(&self, e: &mut E)

source§

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, TraitPredicate<'tcx>>

source§

fn encode(&self, e: &mut E)

source§

impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, TraitRef<'tcx>>

source§

fn encode(&self, e: &mut E)

source§

impl EraseType for Binder<'_, &List<Ty<'_>>>

§

type Result = [u8; 16]

source§

impl EraseType for Binder<'_, FnSig<'_>>

§

type Result = [u8; 24]

source§

impl<'tcx, T: Hash> Hash for Binder<'tcx, T>

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl<'tcx, '__ctx, T> HashStable<StableHashingContext<'__ctx>> for Binder<'tcx, T>
where T: HashStable<StableHashingContext<'__ctx>>,

source§

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )

source§

impl<'tcx, T> IntoDiagArg for Binder<'tcx, T>
where T: IntoDiagArg,

source§

impl<'tcx, '__lifted, T> Lift<'__lifted> for Binder<'tcx, T>
where T: Lift<'__lifted>,

§

type Lifted = Binder<'__lifted, <T as Lift<'__lifted>>::Lifted>

source§

fn lift_to_tcx( self, __tcx: TyCtxt<'__lifted> ) -> Option<Binder<'__lifted, T::Lifted>>

source§

impl<T: ParameterizedOverTcx> ParameterizedOverTcx for Binder<'static, T>

§

type Value<'tcx> = Binder<'tcx, <T as ParameterizedOverTcx>::Value<'tcx>>

source§

impl<'tcx, T: PartialEq> PartialEq for Binder<'tcx, T>

source§

fn eq(&self, other: &Binder<'tcx, T>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<'tcx, T, P: PrettyPrinter<'tcx>> Print<'tcx, P> for Binder<'tcx, T>
where T: Print<'tcx, P> + TypeFoldable<TyCtxt<'tcx>>,

source§

impl<'tcx, T: Relate<'tcx>> Relate<'tcx> for Binder<'tcx, T>

source§

fn relate<R: TypeRelation<'tcx>>( relation: &mut R, a: Binder<'tcx, T>, b: Binder<'tcx, T> ) -> RelateResult<'tcx, Binder<'tcx, T>>

source§

impl<'tcx> ToPredicate<'tcx> for Binder<'tcx, ClauseKind<'tcx>>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx> for Binder<'tcx, PredicateKind<'tcx>>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx> for Binder<'tcx, TraitRef<'tcx>>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Binder<'tcx, TraitPredicate<'tcx>>> for Binder<'tcx, TraitRef<'tcx>>

source§

fn to_predicate(self, _: TyCtxt<'tcx>) -> PolyTraitPredicate<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Clause<'tcx>> for Binder<'tcx, ClauseKind<'tcx>>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Clause<'tcx>

source§

impl<'tcx> ToPredicate<'tcx, Clause<'tcx>> for Binder<'tcx, TraitRef<'tcx>>

source§

fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Clause<'tcx>

source§

impl<'tcx, T: TypeFoldable<TyCtxt<'tcx>>> TypeFoldable<TyCtxt<'tcx>> for Binder<'tcx, T>

source§

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f). Read more
source§

fn fold_with<F>(self, folder: &mut F) -> Self
where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.
source§

impl<'tcx, T: TypeFoldable<TyCtxt<'tcx>>> TypeSuperFoldable<TyCtxt<'tcx>> for Binder<'tcx, T>

source§

fn try_super_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F ) -> Result<Self, F::Error>

Provides a default fold for a recursive type of interest. This should only be called within TypeFolder methods, when a non-custom traversal is desired for the value of the type of interest passed to that method. For example, in MyFolder::try_fold_ty(ty), it is valid to call ty.try_super_fold_with(self), but any other folding should be done with xyz.try_fold_with(self).
source§

fn super_fold_with<F>(self, folder: &mut F) -> Self
where F: TypeFolder<I>,

A convenient alternative to try_super_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_super_fold_with.
source§

impl<'tcx, T: TypeVisitable<TyCtxt<'tcx>>> TypeSuperVisitable<TyCtxt<'tcx>> for Binder<'tcx, T>

source§

fn super_visit_with<V: TypeVisitor<TyCtxt<'tcx>>>( &self, visitor: &mut V ) -> V::Result

Provides a default visit for a recursive type of interest. This should only be called within TypeVisitor methods, when a non-custom traversal is desired for the value of the type of interest passed to that method. For example, in MyVisitor::visit_ty(ty), it is valid to call ty.super_visit_with(self), but any other visiting should be done with xyz.visit_with(self).
source§

impl<'tcx, T: TypeVisitable<TyCtxt<'tcx>>> TypeVisitable<TyCtxt<'tcx>> for Binder<'tcx, T>

source§

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v). Read more
source§

impl<'tcx> Value<TyCtxt<'tcx>> for Binder<'_, FnSig<'_>>

source§

fn from_cycle_error( tcx: TyCtxt<'tcx>, cycle_error: &CycleError, guar: ErrorGuaranteed ) -> Self

source§

impl<'tcx, T: Copy> Copy for Binder<'tcx, T>

source§

impl<'tcx, T: Eq> Eq for Binder<'tcx, T>

source§

impl<'tcx, T> StructuralPartialEq for Binder<'tcx, T>

Auto Trait Implementations§

§

impl<'tcx, T> Freeze for Binder<'tcx, T>
where T: Freeze,

§

impl<'tcx, T> !RefUnwindSafe for Binder<'tcx, T>

§

impl<'tcx, T> Send for Binder<'tcx, T>
where T: Send,

§

impl<'tcx, T> Sync for Binder<'tcx, T>
where T: Sync,

§

impl<'tcx, T> Unpin for Binder<'tcx, T>
where T: Unpin,

§

impl<'tcx, T> !UnwindSafe for Binder<'tcx, T>

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> AnyEq for T
where T: Any + PartialEq,

source§

fn equals(&self, other: &(dyn Any + 'static)) -> bool

source§

fn as_any(&self) -> &(dyn Any + 'static)

source§

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

source§

fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T> ) -> &'a mut [T]

source§

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

source§

fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T> ) -> &'a mut [T]

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<_>>()).

§

type Output = R

source§

impl<Tcx, T> DepNodeParams<Tcx> for T
where Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

source§

default fn fingerprint_style() -> FingerprintStyle

source§

default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).
source§

default fn to_debug_str(&self, _: Tcx) -> String

source§

default fn recover(_: Tcx, _: &DepNode) -> Option<T>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
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<P> IntoQueryParam<P> for P

source§

impl<'tcx, T> IsSuggestable<'tcx> for T
where T: TypeVisitable<TyCtxt<'tcx>> + TypeFoldable<TyCtxt<'tcx>>,

source§

fn is_suggestable(self, tcx: TyCtxt<'tcx>, infer_suggestable: bool) -> bool

Whether this makes sense to suggest in a diagnostic. Read more
source§

fn make_suggestable( self, tcx: TyCtxt<'tcx>, infer_suggestable: bool, placeholder: Option<Ty<'tcx>> ) -> Option<T>

source§

impl<T> MaybeResult<T> for T

§

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

§

type Output = T

Should always be Self
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<'tcx, T> ToPredicate<'tcx, T> for T

source§

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T

source§

impl<T> ToString for T
where T: Display + ?Sized,

source§

default fn to_string(&self) -> String

Converts the given value to a String. Read more
source§

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

§

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>,

§

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> TypeVisitableExt<I> for T
where I: Interner, T: TypeVisitable<I>,

source§

fn has_type_flags(&self, flags: TypeFlags) -> bool

source§

fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool

Returns true if self has any late-bound regions that are either bound by binder or bound by some binder outside of binder. If binder is ty::INNERMOST, this indicates whether there are any late-bound regions that appear free.
source§

fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>

source§

fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool

Returns true if this type has any regions that escape binder (and hence are not bound by it).
source§

fn has_escaping_bound_vars(&self) -> bool

Return true if this type has regions that are not a part of the type. For example, for<'a> fn(&'a i32) return false, while fn(&'a i32) would return true. The latter can occur when traversing through the former. Read more
source§

fn has_aliases(&self) -> bool

source§

fn has_inherent_projections(&self) -> bool

source§

fn has_opaque_types(&self) -> bool

source§

fn has_coroutines(&self) -> bool

source§

fn references_error(&self) -> bool

source§

fn has_non_region_param(&self) -> bool

source§

fn has_infer_regions(&self) -> bool

source§

fn has_infer_types(&self) -> bool

source§

fn has_non_region_infer(&self) -> bool

source§

fn has_infer(&self) -> bool

source§

fn has_placeholders(&self) -> bool

source§

fn has_non_region_placeholders(&self) -> bool

source§

fn has_param(&self) -> bool

source§

fn has_free_regions(&self) -> bool

“Free” regions in this context means that it has any region that is not (a) erased or (b) late-bound.
source§

fn has_erased_regions(&self) -> bool

source§

fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.
source§

fn is_global(&self) -> bool

Indicates whether this value references only ‘global’ generic parameters that are the same regardless of what fn we are in. This is used for caching.
source§

fn has_bound_regions(&self) -> bool

True if there are any late-bound regions
source§

fn has_non_region_bound_vars(&self) -> bool

True if there are any late-bound non-region variables
source§

fn has_bound_vars(&self) -> bool

True if there are any bound variables
source§

fn still_further_specializable(&self) -> bool

Indicates whether this value still has parameters/placeholders/inference variables which could be replaced later, in a way that would change the results of impl specialization.
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.