pub enum AliasTermKind {
ProjectionTy {
def_id: DefId,
},
OpaqueTy {
def_id: DefId,
},
FreeTy {
def_id: DefId,
},
}Variants§
Implementations§
Source§impl AliasTermKind
impl AliasTermKind
pub fn def_id(self) -> DefId
pub fn to_rustc_kind<'tcx>(self) -> AliasTermKind<TyCtxt<'tcx>>
Trait Implementations§
Source§impl Clone for AliasTermKind
impl Clone for AliasTermKind
Source§fn clone(&self) -> AliasTermKind
fn clone(&self) -> AliasTermKind
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for AliasTermKind
Source§impl Debug for AliasTermKind
impl Debug for AliasTermKind
impl Eq for AliasTermKind
Source§impl Hash for AliasTermKind
impl Hash for AliasTermKind
Source§impl PartialEq for AliasTermKind
impl PartialEq for AliasTermKind
impl StructuralPartialEq for AliasTermKind
Source§impl TypeFoldable for AliasTermKind
impl TypeFoldable for AliasTermKind
fn try_fold_with<F: FallibleTypeFolder>( &self, _: &mut F, ) -> Result<Self, F::Error>
fn fold_with<F: TypeFolder>(&self, _: &mut F) -> Self
Source§fn normalize(&self, genv: GlobalEnv<'_, '_>) -> Self
fn normalize(&self, genv: GlobalEnv<'_, '_>) -> Self
Normalize expressions by applying beta reductions for tuples and lambda abstractions.
Source§fn replace_holes(
&self,
f: impl FnMut(&[BoundVariableKinds], HoleKind) -> Expr,
) -> Self
fn replace_holes( &self, f: impl FnMut(&[BoundVariableKinds], HoleKind) -> Expr, ) -> Self
Replaces all holes with the result of calling a closure. The closure takes a list with
all the layers of bound variables at the point the hole was found. Each layer corresponds
to the list of bound variables at that level. The list is ordered from outermost to innermost
binder, i.e., the last element is the binder closest to the hole.
Source§fn with_holes(&self) -> Self
fn with_holes(&self) -> Self
Remove all refinements and turn each underlying
BaseTy into a TyKind::Exists with a
TyKind::Constr and a hole. For example, Vec<{v. i32[v] | v > 0}>[n] becomes
{n. Vec<{v. i32[v] | *}>[n] | *}.fn replace_evars( &self, f: &mut impl FnMut(EVid) -> Option<Expr>, ) -> Result<Self, EVid>
Source§fn shift_horizontally(&self, amount: usize) -> Self
fn shift_horizontally(&self, amount: usize) -> Self
fn shift_in_escaping(&self, amount: u32) -> Self
fn shift_out_escaping(&self, amount: u32) -> Self
fn erase_regions(&self) -> Self
Source§impl TypeVisitable for AliasTermKind
impl TypeVisitable for AliasTermKind
fn visit_with<V: TypeVisitor>(&self, _: &mut V) -> ControlFlow<V::BreakTy>
fn has_escaping_bvars(&self) -> bool
Source§fn has_escaping_bvars_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_escaping_bvars_at_or_above(&self, binder: DebruijnIndex) -> bool
Returns
true if self has any late-bound vars 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 vars that appear free.Source§fn fvars(&self) -> FxHashSet<Name>
fn fvars(&self) -> FxHashSet<Name>
Returns the set of all free variables.
For example,
Vec<i32[n]>{v : v > m} returns {n, m}.fn early_params(&self) -> FxHashSet<EarlyReftParam>
Source§fn redundant_bvars(&self) -> UnordSet<BoundVar>
fn redundant_bvars(&self) -> UnordSet<BoundVar>
Gives the indices of the provided bvars which: Read more
Auto Trait Implementations§
impl DynSend for AliasTermKind
impl DynSync for AliasTermKind
impl Freeze for AliasTermKind
impl RefUnwindSafe for AliasTermKind
impl Send for AliasTermKind
impl Sync for AliasTermKind
impl Unpin for AliasTermKind
impl UnsafeUnpin for AliasTermKind
impl UnwindSafe for AliasTermKind
Blanket Implementations§
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,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> 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 more§impl<K> IntoQueryKey<K> for K
impl<K> IntoQueryKey<K> for K
§fn into_query_key(self) -> K
fn into_query_key(self) -> K
Argument conversion from
Self to K.
This should always be a very cheap conversion, e.g. [LocalDefId::to_def_id].