Struct Ty

pub struct Ty(HashConsed<TyKind>);

A type.

Warning: for performance reasons, the Drive and DriveMut impls of Ty don’t explore the contents of the type, they only yield a pointer to the type itself. To recurse into the type, use drive_inner{_mut} or visit_inside.

Tuple Fields

0: HashConsed<TyKind>

Implementations

impl Ty

pub fn new(kind: TyKind) -> Self

pub fn kind(&self) -> &TyKind

pub fn drive_inner<V: Visitor>(&self, visitor: &mut V)

pub fn drive_inner_mut<V: VisitorMut>(&mut self, visitor: &mut V)

impl Ty

pub fn is_unit(&self) -> bool

Return true if it is actually unit (i.e.: 0-tuple)

pub fn mk_unit() -> Ty

Return the unit type

pub fn is_scalar(&self) -> bool

Return true if this is a scalar type

pub fn is_unsigned_scalar(&self) -> bool

pub fn is_signed_scalar(&self) -> bool

pub fn is_box(&self) -> bool

Return true if the type is Box

pub fn as_box(&self) -> Option<&Ty>

pub fn as_array_or_slice(&self) -> Option<&Ty>

pub fn as_tuple(&self) -> Option<&Vector<TypeVarId, Ty>>

pub fn as_adt(&self) -> Option<(TypeId, &GenericArgs)>

pub fn visit_inside<V>(visitor: V) -> VisitInsideTy<V>

Wrap a visitor to make it visit the contents of types it encounters.

pub fn visit_inside_stateless<V>(visitor: V) -> VisitInsideTy<V>

Wrap a stateless visitor to make it visit the contents of types it encounters. This will only visit each type once and cache the results. For this to behave as expecte, the visitor must be stateless. The performance impact does not appear to be significant.

impl Ty

pub fn substitute(&mut self, generics: &GenericArgs)

Methods from Deref<Target = TyKind>

pub fn variant_name(&self) -> &'static str

pub fn is_adt(&self) -> bool

pub fn is_type_var(&self) -> bool

pub fn is_literal(&self) -> bool

pub fn is_never(&self) -> bool

pub fn is_ref(&self) -> bool

pub fn is_raw_ptr(&self) -> bool

pub fn is_trait_type(&self) -> bool

pub fn is_dyn_trait(&self) -> bool

pub fn is_arrow(&self) -> bool

pub fn as_adt(&self) -> Option<(&TypeId, &GenericArgs)>

pub fn as_type_var(&self) -> Option<&TypeVarId>

pub fn as_literal(&self) -> Option<&LiteralTy>

pub fn as_never(&self) -> Option<()>

pub fn as_ref(&self) -> Option<(&Region, &Ty, &RefKind)>

pub fn as_raw_ptr(&self) -> Option<(&Ty, &RefKind)>

pub fn as_trait_type(&self) -> Option<(&TraitRef, &TraitItemName)>

pub fn as_dyn_trait(&self) -> Option<&ExistentialPredicate>

pub fn as_arrow(&self) -> Option<(&Vector<RegionId, RegionVar>, &Vec<Ty>, &Ty)>

pub fn variant_index_arity(&self) -> (u32, usize)

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 Deref for Ty

Convenience for migration purposes.

type Target = TyKind

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'de> Deserialize<'de> for Ty

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Drive for Ty

See comment on Ty: this impl doesn’t recurse into the contents of the type.

fn drive<V: Visitor>(&self, visitor: &mut V)

impl DriveMut for Ty

See comment on Ty: this impl doesn’t recurse into the contents of the type.

fn drive_mut<V: VisitorMut>(&mut self, visitor: &mut V)

impl<C: AstFormatter> FmtWithCtx<C> for Ty

fn fmt_with_ctx(&self, ctx: &C) -> String

fn fmt_with_ctx_and_indent(&self, _tab: &str, _ctx: &C) -> String

fn with_ctx<'a>(&'a self, ctx: &'a C) -> impl Display + 'a

Returns a struct that implements Display. This allows the following:

impl<'a> Formatter<&Ty> for FmtCtx<'a>

fn format_object(&self, x: &Ty) -> String

impl From<TyKind> for Ty

fn from(kind: TyKind) -> Ty

Converts to this type from the input type.

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 Serialize for Ty

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl DerefPure for Ty

For deref patterns.

impl Eq for Ty

impl StructuralPartialEq for Ty