Struct Ty

pub struct Ty(Interned<TyKind>);

Tuple Fields

0: Interned<TyKind>

Implementations

impl Ty

pub fn shallow_canonicalize(&self) -> CanonicalTy

Hoist existentials and predicates inside the type stopping when encountering the first type constructor.

impl Ty

pub fn kind(&self) -> &TyKind

pub fn trait_object_dummy_self() -> Ty

Dummy type used for the Self of a TraitRef created when converting a trait object, and which gets removed in ExistentialTraitRef. This type must not appear anywhere in other converted types and must be a valid rustc type (i.e., we must be able to call to_rustc on it). TyKind::Infer(TyVid(0)) does the job, with the caveat that we must skip 0 when generating TyKind::Infer for “type holes”.

pub fn dynamic( preds: impl Into<List<Binder<ExistentialPredicate>>>, region: Region, ) -> Ty

pub fn strg_ref(re: Region, path: Path, ty: Ty) -> Ty

pub fn ptr(pk: impl Into<PtrKind>, path: impl Into<Path>) -> Ty

pub fn constr(p: impl Into<Expr>, ty: Ty) -> Ty

pub fn uninit() -> Ty

pub fn indexed(bty: BaseTy, idx: impl Into<Expr>) -> Ty

pub fn exists(ty: Binder<Ty>) -> Ty

pub fn exists_with_constr(bty: BaseTy, pred: Expr) -> Ty

pub fn discr(adt_def: AdtDef, place: Place) -> Ty

pub fn unit() -> Ty

pub fn bool() -> Ty

pub fn int(int_ty: IntTy) -> Ty

pub fn uint(uint_ty: UintTy) -> Ty

pub fn param(param_ty: ParamTy) -> Ty

pub fn downcast( adt: AdtDef, args: GenericArgs, ty: Ty, variant: VariantIdx, fields: List<Ty>, ) -> Ty

pub fn blocked(ty: Ty) -> Ty

pub fn str() -> Ty

pub fn char() -> Ty

pub fn float(float_ty: FloatTy) -> Ty

pub fn mk_ref(region: Region, ty: Ty, mutbl: Mutability) -> Ty

pub fn mk_slice(ty: Ty) -> Ty

pub fn mk_box( genv: GlobalEnv<'_, '_>, deref_ty: Ty, alloc_ty: Ty, ) -> QueryResult<Ty>

pub fn mk_box_with_default_alloc( genv: GlobalEnv<'_, '_>, deref_ty: Ty, ) -> QueryResult<Ty>

pub fn tuple(tys: impl Into<List<Ty>>) -> Ty

pub fn array(ty: Ty, c: Const) -> Ty

pub fn closure(did: DefId, tys: impl Into<List<Ty>>, args: &GenericArgs) -> Ty

pub fn coroutine(did: DefId, resume_ty: Ty, upvar_tys: List<Ty>) -> Ty

pub fn never() -> Ty

pub fn infer(vid: TyVid) -> Ty

pub fn unconstr(&self) -> (Ty, Expr)

pub fn unblocked(&self) -> Ty

pub fn is_integral(&self) -> bool

Whether the type is an int or a uint

pub fn is_bool(&self) -> bool

Whether the type is a bool

pub fn is_char(&self) -> bool

Whether the type is a char

pub fn is_uninit(&self) -> bool

pub fn is_box(&self) -> bool

pub fn is_struct(&self) -> bool

pub fn is_array(&self) -> bool

pub fn is_slice(&self) -> bool

pub fn as_bty_skipping_existentials(&self) -> Option<&BaseTy>

pub fn expect_discr(&self) -> (&AdtDef, &Place)

pub fn expect_adt(&self) -> (&AdtDef, &[GenericArg], &Expr)

pub(crate) fn expect_tuple(&self) -> &[Ty]

Trait Implementations

impl Clone for Ty

fn clone(&self) -> Ty

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Ty

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

Formats the value using the given formatter.

impl<__D: TyDecoder> Decodable<__D> for Ty

fn decode(__decoder: &mut __D) -> Self

impl<__E: TyEncoder> Encodable<__E> for Ty

fn encode(&self, __encoder: &mut __E)

impl Hash for Ty

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Ty

fn eq(&self, other: &Ty) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Pretty for Ty

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

fn default_cx(tcx: TyCtxt<'_>) -> PrettyCx<'_>

impl SliceInternable for Ty

fn storage() -> &'static InternStorage<[Self]>

impl<'tcx> ToRustc<'tcx> for Ty

type T = Ty<'tcx>

fn to_rustc(&self, tcx: TyCtxt<'tcx>) -> Self::T

impl TypeFoldable for Ty

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

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

fn normalize_projections<'tcx>( &self, genv: GlobalEnv<'_, 'tcx>, infcx: &InferCtxt<'tcx>, callsite_def_id: DefId, ) -> QueryResult<Self>

fn normalize(&self, defns: &SpecFuncDefns) -> Self

Normalize expressions by applying beta reductions for tuples and lambda abstractions.

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.

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, evars: &EVarSol) -> Self

fn shift_in_escaping(&self, amount: u32) -> Self

fn shift_out_escaping(&self, amount: u32) -> Self

fn erase_regions(&self) -> Self

impl TypeSuperFoldable for Ty

fn try_super_fold_with<F: FallibleTypeFolder>( &self, folder: &mut F, ) -> Result<Ty, F::Error>

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

impl TypeSuperVisitable for Ty

fn super_visit_with<V: TypeVisitor>( &self, visitor: &mut V, ) -> ControlFlow<V::BreakTy>

impl TypeVisitable for Ty

fn visit_with<V: TypeVisitor>(&self, visitor: &mut V) -> ControlFlow<V::BreakTy>

fn has_escaping_bvars(&self) -> 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.

fn fvars(&self) -> FxHashSet<Name>

Returns the set of all free variables. For example, Vec<i32[n]>{v : v > m} returns {n, m}.

impl Eq for Ty

impl StructuralPartialEq for Ty