Struct rustc_middle::ty::Placeholder
source · pub struct Placeholder<T> {
pub universe: UniverseIndex,
pub name: T,
}
Expand description
The “placeholder index” fully defines a placeholder region, type, or const. Placeholders are identified by both a universe, as well as a name residing within that universe. Distinct bound regions/types/consts within the same universe simply have an unknown relationship to one another.
Fields§
§universe: UniverseIndex
§name: T
Trait Implementations§
source§impl<T: Clone> Clone for Placeholder<T>
impl<T: Clone> Clone for Placeholder<T>
source§fn clone(&self) -> Placeholder<T>
fn clone(&self) -> Placeholder<T>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<T: Debug> Debug for Placeholder<T>
impl<T: Debug> Debug for Placeholder<T>
source§impl<'tcx, T, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for Placeholder<T>where
T: Decodable<__D>,
impl<'tcx, T, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for Placeholder<T>where
T: Decodable<__D>,
source§impl<'tcx, T, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for Placeholder<T>where
T: Encodable<__E>,
impl<'tcx, T, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for Placeholder<T>where
T: Encodable<__E>,
source§impl<'tcx> From<Placeholder<BoundVar>> for ConstKind<'tcx>
impl<'tcx> From<Placeholder<BoundVar>> for ConstKind<'tcx>
source§fn from(original: PlaceholderConst<'tcx>) -> ConstKind<'tcx>
fn from(original: PlaceholderConst<'tcx>) -> ConstKind<'tcx>
Converts to this type from the input type.
source§impl<T: Hash> Hash for Placeholder<T>
impl<T: Hash> Hash for Placeholder<T>
source§impl<'__ctx, T> HashStable<StableHashingContext<'__ctx>> for Placeholder<T>where
T: HashStable<StableHashingContext<'__ctx>>,
impl<'__ctx, T> HashStable<StableHashingContext<'__ctx>> for Placeholder<T>where
T: HashStable<StableHashingContext<'__ctx>>,
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
source§impl<'tcx> Lift<'tcx> for Placeholder<BoundRegionKind>
impl<'tcx> Lift<'tcx> for Placeholder<BoundRegionKind>
type Lifted = Placeholder<BoundRegionKind>
fn lift_to_tcx(self, _: TyCtxt<'tcx>) -> Option<Self>
source§impl<'tcx> Lift<'tcx> for Placeholder<BoundVar>
impl<'tcx> Lift<'tcx> for Placeholder<BoundVar>
type Lifted = Placeholder<BoundVar>
fn lift_to_tcx(self, _: TyCtxt<'tcx>) -> Option<Self>
source§impl<T: Ord> Ord for Placeholder<T>
impl<T: Ord> Ord for Placeholder<T>
source§fn cmp(&self, other: &Placeholder<T>) -> Ordering
fn cmp(&self, other: &Placeholder<T>) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl<T: PartialEq> PartialEq<Placeholder<T>> for Placeholder<T>
impl<T: PartialEq> PartialEq<Placeholder<T>> for Placeholder<T>
source§fn eq(&self, other: &Placeholder<T>) -> bool
fn eq(&self, other: &Placeholder<T>) -> bool
source§impl<T: PartialOrd> PartialOrd<Placeholder<T>> for Placeholder<T>
impl<T: PartialOrd> PartialOrd<Placeholder<T>> for Placeholder<T>
source§fn partial_cmp(&self, other: &Placeholder<T>) -> Option<Ordering>
fn partial_cmp(&self, other: &Placeholder<T>) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl<'tcx> TypeFoldable<'tcx> for Placeholder<BoundRegionKind>
impl<'tcx> TypeFoldable<'tcx> for Placeholder<BoundRegionKind>
source§fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
_: &mut F
) -> Result<Self, F::Error>
fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
_: &mut F
) -> Result<Self, F::Error>
source§impl<'tcx> TypeFoldable<'tcx> for Placeholder<BoundVar>
impl<'tcx> TypeFoldable<'tcx> for Placeholder<BoundVar>
source§fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
_: &mut F
) -> Result<Self, F::Error>
fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
_: &mut F
) -> Result<Self, F::Error>
source§impl<'tcx> TypeVisitable<'tcx> for Placeholder<BoundRegionKind>
impl<'tcx> TypeVisitable<'tcx> for Placeholder<BoundRegionKind>
source§fn visit_with<F: TypeVisitor<'tcx>>(&self, _: &mut F) -> ControlFlow<F::BreakTy>
fn visit_with<F: TypeVisitor<'tcx>>(&self, _: &mut F) -> ControlFlow<F::BreakTy>
source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
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. Read moresource§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
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). Read moresource§fn has_escaping_bound_vars(&self) -> bool
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 morefn 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) -> Result<(), ErrorGuaranteed>
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
source§fn has_free_regions(&self) -> bool
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. Read more
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
True if there are any un-erased free regions.
source§fn is_global(&self) -> bool
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. Read more
source§fn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
True if there are any late-bound regions
source§fn still_further_specializable(&self) -> bool
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. Read moresource§impl<'tcx> TypeVisitable<'tcx> for Placeholder<BoundVar>
impl<'tcx> TypeVisitable<'tcx> for Placeholder<BoundVar>
source§fn visit_with<F: TypeVisitor<'tcx>>(&self, _: &mut F) -> ControlFlow<F::BreakTy>
fn visit_with<F: TypeVisitor<'tcx>>(&self, _: &mut F) -> ControlFlow<F::BreakTy>
source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
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. Read moresource§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
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). Read moresource§fn has_escaping_bound_vars(&self) -> bool
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 morefn 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) -> Result<(), ErrorGuaranteed>
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
source§fn has_free_regions(&self) -> bool
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. Read more
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
True if there are any un-erased free regions.
source§fn is_global(&self) -> bool
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. Read more
source§fn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
True if there are any late-bound regions
source§fn still_further_specializable(&self) -> bool
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. Read moreimpl<T: Copy> Copy for Placeholder<T>
impl<T: Eq> Eq for Placeholder<T>
impl<T> StructuralEq for Placeholder<T>
impl<T> StructuralPartialEq for Placeholder<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for Placeholder<T>where
T: RefUnwindSafe,
impl<T> Send for Placeholder<T>where
T: Send,
impl<T> Sync for Placeholder<T>where
T: Sync,
impl<T> Unpin for Placeholder<T>where
T: Unpin,
impl<T> UnwindSafe for Placeholder<T>where
T: UnwindSafe,
Blanket Implementations§
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T] ⓘ
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
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). Read more
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
This method tries to recover the query key from the given
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 moresource§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: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.