pub struct Placeholder<I, T>where
I: Interner,{
pub universe: UniverseIndex,
pub bound: T,
_tcx: PhantomData<fn() -> I>,
}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§bound: T§_tcx: PhantomData<fn() -> I>Implementations§
Source§impl<I, T> Placeholder<I, T>where
I: Interner,
impl<I, T> Placeholder<I, T>where
I: Interner,
pub fn new(universe: UniverseIndex, bound: T) -> Placeholder<I, T>
Trait Implementations§
Source§impl<I, T> Clone for Placeholder<I, T>
impl<I, T> Clone for Placeholder<I, T>
Source§fn clone(&self) -> Placeholder<I, T>
fn clone(&self) -> Placeholder<I, T>
Returns a duplicate 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<I, T> Debug for Placeholder<I, T>
impl<I, T> Debug for Placeholder<I, T>
Source§impl<I, T, __D> Decodable<__D> for Placeholder<I, T>
impl<I, T, __D> Decodable<__D> for Placeholder<I, T>
fn decode(__decoder: &mut __D) -> Placeholder<I, T>
Source§impl<I, T> Display for Placeholder<I, T>
impl<I, T> Display for Placeholder<I, T>
Source§impl<I, T, __E> Encodable<__E> for Placeholder<I, T>
impl<I, T, __E> Encodable<__E> for Placeholder<I, T>
Source§impl<I, T> Hash for Placeholder<I, T>
impl<I, T> Hash for Placeholder<I, T>
Source§impl<I, T, __CTX> HashStable<__CTX> for Placeholder<I, T>
impl<I, T, __CTX> HashStable<__CTX> for Placeholder<I, T>
fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )
Source§impl<I, U, T> Lift<U> for Placeholder<I, T>
impl<I, U, T> Lift<U> for Placeholder<I, T>
type Lifted = Placeholder<U, <T as Lift<U>>::Lifted>
fn lift_to_interner( self, cx: U, ) -> Option<Placeholder<U, <T as Lift<U>>::Lifted>>
Source§impl<I, T> Ord for Placeholder<I, T>
impl<I, T> Ord for Placeholder<I, T>
Source§fn cmp(&self, __other: &Placeholder<I, T>) -> Ordering
fn cmp(&self, __other: &Placeholder<I, 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<I, T> PartialEq for Placeholder<I, T>
impl<I, T> PartialEq for Placeholder<I, T>
Source§impl<I, T> PartialOrd for Placeholder<I, T>
impl<I, T> PartialOrd for Placeholder<I, T>
Source§impl<'tcx> PlaceholderLike<TyCtxt<'tcx>> for Placeholder<TyCtxt<'tcx>, BoundConst>
impl<'tcx> PlaceholderLike<TyCtxt<'tcx>> for Placeholder<TyCtxt<'tcx>, BoundConst>
type Bound = BoundConst
fn universe(self) -> UniverseIndex
fn var(self) -> BoundVar
fn with_updated_universe( self, ui: UniverseIndex, ) -> Placeholder<TyCtxt<'tcx>, BoundConst>
fn new( ui: UniverseIndex, bound: BoundConst, ) -> Placeholder<TyCtxt<'tcx>, BoundConst>
fn new_anon( ui: UniverseIndex, var: BoundVar, ) -> Placeholder<TyCtxt<'tcx>, BoundConst>
Source§impl<'tcx> PlaceholderLike<TyCtxt<'tcx>> for Placeholder<TyCtxt<'tcx>, BoundRegion>
impl<'tcx> PlaceholderLike<TyCtxt<'tcx>> for Placeholder<TyCtxt<'tcx>, BoundRegion>
type Bound = BoundRegion
fn universe(self) -> UniverseIndex
fn var(self) -> BoundVar
fn with_updated_universe( self, ui: UniverseIndex, ) -> Placeholder<TyCtxt<'tcx>, BoundRegion>
fn new( ui: UniverseIndex, bound: BoundRegion, ) -> Placeholder<TyCtxt<'tcx>, BoundRegion>
fn new_anon( ui: UniverseIndex, var: BoundVar, ) -> Placeholder<TyCtxt<'tcx>, BoundRegion>
Source§impl<'tcx> PlaceholderLike<TyCtxt<'tcx>> for Placeholder<TyCtxt<'tcx>, BoundTy>
impl<'tcx> PlaceholderLike<TyCtxt<'tcx>> for Placeholder<TyCtxt<'tcx>, BoundTy>
type Bound = BoundTy
fn universe(self) -> UniverseIndex
fn var(self) -> BoundVar
fn with_updated_universe( self, ui: UniverseIndex, ) -> Placeholder<TyCtxt<'tcx>, BoundTy>
fn new(ui: UniverseIndex, bound: BoundTy) -> Placeholder<TyCtxt<'tcx>, BoundTy>
fn new_anon( ui: UniverseIndex, var: BoundVar, ) -> Placeholder<TyCtxt<'tcx>, BoundTy>
Source§impl<'tcx, P> Print<'tcx, P> for Placeholder<TyCtxt<'tcx>, BoundTy>where
P: PrettyPrinter<'tcx>,
impl<'tcx, P> Print<'tcx, P> for Placeholder<TyCtxt<'tcx>, BoundTy>where
P: PrettyPrinter<'tcx>,
Source§impl<I, T> TypeFoldable<I> for Placeholder<I, T>where
I: Interner,
T: TypeFoldable<I>,
impl<I, T> TypeFoldable<I> for Placeholder<I, T>where
I: Interner,
T: TypeFoldable<I>,
Source§fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<Placeholder<I, T>, <__F as FallibleTypeFolder<I>>::Error>where
__F: FallibleTypeFolder<I>,
fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<Placeholder<I, T>, <__F as FallibleTypeFolder<I>>::Error>where
__F: FallibleTypeFolder<I>,
Source§fn fold_with<__F>(self, __folder: &mut __F) -> Placeholder<I, T>where
__F: TypeFolder<I>,
fn fold_with<__F>(self, __folder: &mut __F) -> Placeholder<I, T>where
__F: TypeFolder<I>,
Source§impl<I, T> TypeVisitable<I> for Placeholder<I, T>where
I: Interner,
T: TypeVisitable<I>,
impl<I, T> TypeVisitable<I> for Placeholder<I, T>where
I: Interner,
T: TypeVisitable<I>,
Source§fn visit_with<__V>(
&self,
__visitor: &mut __V,
) -> <__V as TypeVisitor<I>>::Resultwhere
__V: TypeVisitor<I>,
fn visit_with<__V>(
&self,
__visitor: &mut __V,
) -> <__V as TypeVisitor<I>>::Resultwhere
__V: TypeVisitor<I>,
impl<I, T> Copy for Placeholder<I, T>
impl<I, T> Eq for Placeholder<I, T>
Auto Trait Implementations§
impl<I, T> DynSend for Placeholder<I, T>where
T: DynSend,
impl<I, T> DynSync for Placeholder<I, T>where
T: DynSync,
impl<I, T> Freeze for Placeholder<I, T>where
T: Freeze,
impl<I, T> RefUnwindSafe for Placeholder<I, T>where
T: RefUnwindSafe,
impl<I, T> Send for Placeholder<I, T>where
T: Send,
impl<I, T> Sync for Placeholder<I, T>where
T: Sync,
impl<I, T> Unpin for Placeholder<I, T>where
T: Unpin,
impl<I, T> UnwindSafe for Placeholder<I, 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(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
Source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
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).
default fn to_debug_str(&self, tcx: Tcx) -> String
Source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
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
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
Source§impl<'tcx, T> IsSuggestable<'tcx> for T
impl<'tcx, T> IsSuggestable<'tcx> for T
Source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
fn has_type_flags(&self, flags: TypeFlags) -> bool
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.fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>
Source§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).Source§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_aliases(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_coroutines(&self) -> bool
fn references_error(&self) -> bool
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 has_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn has_non_region_placeholders(&self) -> bool
fn has_param(&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.
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.
Source§fn has_bound_regions(&self) -> bool
fn has_bound_regions(&self) -> bool
True if there are any late-bound regions
Source§fn has_non_region_bound_vars(&self) -> bool
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
fn has_bound_vars(&self) -> bool
True if there are any bound variables
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.Source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
Source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> 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, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
Source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<T> ErasedDestructor for Twhere
T: 'static,
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.