Struct rustc_middle::ty::sty::Binder
source · pub struct Binder<'tcx, T>(T, &'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.
Tuple Fields
0: T
1: &'tcx List<BoundVariableKind>
Implementations
sourceimpl<'tcx> Binder<'tcx, TraitRef<'tcx>>
impl<'tcx> Binder<'tcx, TraitRef<'tcx>>
pub fn print_only_trait_path(
self
) -> Binder<'tcx, TraitRefPrintOnlyTraitPath<'tcx>>
sourceimpl<'tcx> Binder<'tcx, TraitPredicate<'tcx>>
impl<'tcx> Binder<'tcx, TraitPredicate<'tcx>>
pub fn print_modifiers_and_trait_path(
self
) -> Binder<'tcx, TraitPredPrintModifiersAndPath<'tcx>>
sourceimpl<'tcx> Binder<'tcx, ExistentialPredicate<'tcx>>
impl<'tcx> Binder<'tcx, ExistentialPredicate<'tcx>>
sourcepub fn with_self_ty(
&self,
tcx: TyCtxt<'tcx>,
self_ty: Ty<'tcx>
) -> Predicate<'tcx>
pub fn with_self_ty(
&self,
tcx: TyCtxt<'tcx>,
self_ty: Ty<'tcx>
) -> Predicate<'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).
sourceimpl<'tcx> Binder<'tcx, TraitRef<'tcx>>
impl<'tcx> Binder<'tcx, TraitRef<'tcx>>
pub fn self_ty(&self) -> Binder<'tcx, Ty<'tcx>>
pub fn def_id(&self) -> DefId
pub fn to_poly_trait_predicate(&self) -> PolyTraitPredicate<'tcx>
sourcepub fn to_poly_trait_predicate_negative_polarity(
&self
) -> PolyTraitPredicate<'tcx>
pub fn to_poly_trait_predicate_negative_polarity(
&self
) -> PolyTraitPredicate<'tcx>
Same as PolyTraitRef::to_poly_trait_predicate
but sets a negative polarity instead.
sourceimpl<'tcx> Binder<'tcx, ExistentialTraitRef<'tcx>>
impl<'tcx> Binder<'tcx, ExistentialTraitRef<'tcx>>
pub fn def_id(&self) -> DefId
sourcepub fn with_self_ty(
&self,
tcx: TyCtxt<'tcx>,
self_ty: Ty<'tcx>
) -> PolyTraitRef<'tcx>
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.
sourceimpl<'tcx, T> Binder<'tcx, T>where
T: TypeVisitable<'tcx>,
impl<'tcx, T> Binder<'tcx, T>where
T: TypeVisitable<'tcx>,
sourcepub fn dummy(value: T) -> Binder<'tcx, T>
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.
pub fn bind_with_vars(
value: T,
vars: &'tcx List<BoundVariableKind>
) -> Binder<'tcx, T>
sourceimpl<'tcx, T> Binder<'tcx, T>
impl<'tcx, T> Binder<'tcx, T>
sourcepub fn skip_binder(self) -> T
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
replace_late_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 typeX
does not reference any regions
pub fn bound_vars(&self) -> &'tcx List<BoundVariableKind>
pub fn as_ref(&self) -> Binder<'tcx, &T>
pub fn as_deref(&self) -> Binder<'tcx, &T::Target>where
T: Deref,
pub fn map_bound_ref_unchecked<F, U>(&self, f: F) -> Binder<'tcx, U>where
F: FnOnce(&T) -> U,
pub fn map_bound_ref<F, U: TypeVisitable<'tcx>>(&self, f: F) -> Binder<'tcx, U>where
F: FnOnce(&T) -> U,
pub fn map_bound<F, U: TypeVisitable<'tcx>>(self, f: F) -> Binder<'tcx, U>where
F: FnOnce(T) -> U,
pub fn try_map_bound<F, U: TypeVisitable<'tcx>, E>(
self,
f: F
) -> Result<Binder<'tcx, U>, E>where
F: FnOnce(T) -> Result<U, E>,
sourcepub fn rebind<U>(&self, value: U) -> Binder<'tcx, U>where
U: TypeVisitable<'tcx>,
pub fn rebind<U>(&self, value: U) -> Binder<'tcx, U>where
U: TypeVisitable<'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.
sourcepub fn no_bound_vars(self) -> Option<T>where
T: TypeVisitable<'tcx>,
pub fn no_bound_vars(self) -> Option<T>where
T: TypeVisitable<'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.)
sourcepub fn split<U, V, F>(self, f: F) -> (Binder<'tcx, U>, Binder<'tcx, V>)where
F: FnOnce(T) -> (U, V),
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.
sourceimpl<'tcx> Binder<'tcx, FnSig<'tcx>>
impl<'tcx> Binder<'tcx, FnSig<'tcx>>
pub fn inputs(&self) -> Binder<'tcx, &'tcx [Ty<'tcx>]>
pub fn input(&self, index: usize) -> Binder<'tcx, Ty<'tcx>>
pub fn inputs_and_output(&self) -> Binder<'tcx, &'tcx List<Ty<'tcx>>>
pub fn output(&self) -> Binder<'tcx, Ty<'tcx>>
pub fn c_variadic(&self) -> bool
pub fn unsafety(&self) -> Unsafety
pub fn abi(&self) -> Abi
sourceimpl<'tcx> Binder<'tcx, ExistentialProjection<'tcx>>
impl<'tcx> Binder<'tcx, ExistentialProjection<'tcx>>
pub fn with_self_ty(
&self,
tcx: TyCtxt<'tcx>,
self_ty: Ty<'tcx>
) -> PolyProjectionPredicate<'tcx>
pub fn item_def_id(&self) -> DefId
sourceimpl<'tcx> Binder<'tcx, TraitPredicate<'tcx>>
impl<'tcx> Binder<'tcx, TraitPredicate<'tcx>>
sourceimpl<'tcx> Binder<'tcx, ProjectionPredicate<'tcx>>
impl<'tcx> Binder<'tcx, ProjectionPredicate<'tcx>>
sourcepub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId
pub fn trait_def_id(&self, tcx: TyCtxt<'tcx>) -> DefId
Returns the DefId
of the trait of the associated item being projected.
sourcepub fn required_poly_trait_ref(&self, tcx: TyCtxt<'tcx>) -> PolyTraitRef<'tcx>
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.
pub fn term(&self) -> Binder<'tcx, Term<'tcx>>
sourcepub fn projection_def_id(&self) -> DefId
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
.
sourceimpl<'tcx> Binder<'tcx, TraitRef<'tcx>>
impl<'tcx> Binder<'tcx, TraitRef<'tcx>>
pub fn with_constness(
self,
constness: BoundConstness
) -> PolyTraitPredicate<'tcx>
pub fn without_const(self) -> PolyTraitPredicate<'tcx>
Trait Implementations
sourceimpl<'tcx> Borrow<Binder<'tcx, PredicateKind<'tcx>>> for InternedInSet<'tcx, PredicateS<'tcx>>
impl<'tcx> Borrow<Binder<'tcx, PredicateKind<'tcx>>> for InternedInSet<'tcx, PredicateS<'tcx>>
sourcefn borrow<'a>(&'a self) -> &'a Binder<'tcx, PredicateKind<'tcx>>
fn borrow<'a>(&'a self) -> &'a Binder<'tcx, PredicateKind<'tcx>>
sourceimpl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, &'tcx List<Ty<'tcx>>>
impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, &'tcx List<Ty<'tcx>>>
sourceimpl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, ExistentialPredicate<'tcx>>
impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, ExistentialPredicate<'tcx>>
sourceimpl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, ExistentialTraitRef<'tcx>>
impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, ExistentialTraitRef<'tcx>>
sourceimpl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, PredicateKind<'tcx>>
impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, PredicateKind<'tcx>>
fn decode(decoder: &mut D) -> Binder<'tcx, PredicateKind<'tcx>>
sourceimpl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, Vec<GeneratorInteriorTypeCause<'tcx>>>
impl<'tcx, D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<D> for Binder<'tcx, Vec<GeneratorInteriorTypeCause<'tcx>>>
sourceimpl<'tcx> Display for Binder<'tcx, ExistentialPredicate<'tcx>>
impl<'tcx> Display for Binder<'tcx, ExistentialPredicate<'tcx>>
sourceimpl<'tcx> Display for Binder<'tcx, ExistentialTraitRef<'tcx>>
impl<'tcx> Display for Binder<'tcx, ExistentialTraitRef<'tcx>>
sourceimpl<'tcx> Display for Binder<'tcx, ProjectionPredicate<'tcx>>
impl<'tcx> Display for Binder<'tcx, ProjectionPredicate<'tcx>>
sourceimpl<'tcx> Display for Binder<'tcx, SubtypePredicate<'tcx>>
impl<'tcx> Display for Binder<'tcx, SubtypePredicate<'tcx>>
sourceimpl<'tcx> Display for Binder<'tcx, TraitPredPrintModifiersAndPath<'tcx>>
impl<'tcx> Display for Binder<'tcx, TraitPredPrintModifiersAndPath<'tcx>>
sourceimpl<'tcx> Display for Binder<'tcx, TraitPredicate<'tcx>>
impl<'tcx> Display for Binder<'tcx, TraitPredicate<'tcx>>
sourceimpl<'tcx> Display for Binder<'tcx, TraitRefPrintOnlyTraitName<'tcx>>
impl<'tcx> Display for Binder<'tcx, TraitRefPrintOnlyTraitName<'tcx>>
sourceimpl<'tcx> Display for Binder<'tcx, TraitRefPrintOnlyTraitPath<'tcx>>
impl<'tcx> Display for Binder<'tcx, TraitRefPrintOnlyTraitPath<'tcx>>
sourceimpl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, &'tcx List<Ty<'tcx>>>
impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, &'tcx List<Ty<'tcx>>>
sourceimpl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, ExistentialPredicate<'tcx>>
impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, ExistentialPredicate<'tcx>>
sourceimpl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, ExistentialTraitRef<'tcx>>
impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, ExistentialTraitRef<'tcx>>
sourceimpl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, Vec<GeneratorInteriorTypeCause<'tcx>>>
impl<'tcx, E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<E> for Binder<'tcx, Vec<GeneratorInteriorTypeCause<'tcx>>>
sourceimpl<'tcx, '__ctx, T> HashStable<StableHashingContext<'__ctx>> for Binder<'tcx, T>where
T: HashStable<StableHashingContext<'__ctx>>,
impl<'tcx, '__ctx, T> HashStable<StableHashingContext<'__ctx>> for Binder<'tcx, T>where
T: HashStable<StableHashingContext<'__ctx>>,
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
sourceimpl<'tcx, T: Ord> Ord for Binder<'tcx, T>
impl<'tcx, T: Ord> Ord for Binder<'tcx, T>
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
sourceimpl<T: ParameterizedOverTcx> ParameterizedOverTcx for Binder<'static, T>
impl<T: ParameterizedOverTcx> ParameterizedOverTcx for Binder<'static, T>
type Value<'tcx> = Binder<'tcx, <T as ParameterizedOverTcx>::Value<'tcx>>
sourceimpl<'tcx, T: PartialEq> PartialEq<Binder<'tcx, T>> for Binder<'tcx, T>
impl<'tcx, T: PartialEq> PartialEq<Binder<'tcx, T>> for Binder<'tcx, T>
sourceimpl<'tcx, T: PartialOrd> PartialOrd<Binder<'tcx, T>> for Binder<'tcx, T>
impl<'tcx, T: PartialOrd> PartialOrd<Binder<'tcx, T>> for Binder<'tcx, T>
sourcefn partial_cmp(&self, other: &Binder<'tcx, T>) -> Option<Ordering>
fn partial_cmp(&self, other: &Binder<'tcx, T>) -> Option<Ordering>
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read moresourceimpl<'tcx, T, P: PrettyPrinter<'tcx>> Print<'tcx, P> for Binder<'tcx, T>where
T: Print<'tcx, P, Output = P, Error = P::Error> + TypeFoldable<'tcx>,
impl<'tcx, T, P: PrettyPrinter<'tcx>> Print<'tcx, P> for Binder<'tcx, T>where
T: Print<'tcx, P, Output = P, Error = P::Error> + TypeFoldable<'tcx>,
sourceimpl<'tcx, T: Relate<'tcx>> Relate<'tcx> for Binder<'tcx, T>
impl<'tcx, T: Relate<'tcx>> Relate<'tcx> for Binder<'tcx, T>
fn relate<R: TypeRelation<'tcx>>(
relation: &mut R,
a: Binder<'tcx, T>,
b: Binder<'tcx, T>
) -> RelateResult<'tcx, Binder<'tcx, T>>
sourceimpl<'tcx> ToPredicate<'tcx> for Binder<'tcx, PredicateKind<'tcx>>
impl<'tcx> ToPredicate<'tcx> for Binder<'tcx, PredicateKind<'tcx>>
fn to_predicate(self, tcx: TyCtxt<'tcx>) -> Predicate<'tcx>
sourceimpl<'tcx, T: TypeFoldable<'tcx>> TypeFoldable<'tcx> for Binder<'tcx, T>
impl<'tcx, T: TypeFoldable<'tcx>> TypeFoldable<'tcx> for Binder<'tcx, T>
sourcefn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
sourcefn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
. Read moresourceimpl<'tcx, T: TypeFoldable<'tcx>> TypeSuperFoldable<'tcx> for Binder<'tcx, T>
impl<'tcx, T: TypeFoldable<'tcx>> TypeSuperFoldable<'tcx> for Binder<'tcx, T>
sourcefn try_super_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
fn try_super_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
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)
. Read moresourcefn super_fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn super_fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
try_super_fold_with
for use with
infallible folders. Do not override this method, to ensure coherence
with try_super_fold_with
. Read moresourceimpl<'tcx, T: TypeVisitable<'tcx>> TypeSuperVisitable<'tcx> for Binder<'tcx, T>
impl<'tcx, T: TypeVisitable<'tcx>> TypeSuperVisitable<'tcx> for Binder<'tcx, T>
sourcefn super_visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
fn super_visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
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)
. Read moresourceimpl<'tcx, T: TypeVisitable<'tcx>> TypeVisitable<'tcx> for Binder<'tcx, T>
impl<'tcx, T: TypeVisitable<'tcx>> TypeVisitable<'tcx> for Binder<'tcx, T>
sourcefn visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
fn visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
sourcefn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
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. Read moresourcefn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this self
has any regions that escape binder
(and
hence are not bound by it). Read morefn has_escaping_bound_vars(&self) -> bool
fn has_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Option<ErrorGuaranteed>
fn has_param_types_or_consts(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_infer_types_or_consts(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
sourcefn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
sourcefn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
sourcefn is_global(&self) -> bool
fn is_global(&self) -> bool
sourcefn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
sourcefn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization. Read moresourceimpl<'tcx> Value<TyCtxt<'tcx>> for Binder<'_, FnSig<'_>>
impl<'tcx> Value<TyCtxt<'tcx>> for Binder<'_, FnSig<'_>>
fn from_cycle_error(tcx: TyCtxt<'tcx>) -> Self
impl<'tcx, T: Copy> Copy for Binder<'tcx, T>
impl<'tcx, T: Eq> Eq for Binder<'tcx, T>
impl<'tcx, T> StructuralEq for Binder<'tcx, T>
impl<'tcx, T> StructuralPartialEq for Binder<'tcx, T>
Auto Trait Implementations
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
sourceimpl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s 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. Read moresourceimpl<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,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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.