Enum Type 

pub enum Type {
    Bottom,
    Any,
    Primitive(BitFlags<Typ>),
    Ref(TypeRef),
    Fn(Arc<FnType>),
    Set(Arc<[Type]>),
    TVar(TVar),
    Error(Arc<Type>),
    Array(Arc<Type>),
    ByRef(Arc<Type>),
    Tuple(Arc<[Type]>),
    Struct(Arc<[(ArcStr, Type)]>),
    Variant(ArcStr, Arc<[Type]>),
    Map {
        key: Arc<Type>,
        value: Arc<Type>,
    },
    Abstract {
        id: AbstractId,
        params: Arc<[Type]>,
    },
}

Variants

Bottom

Any

Primitive(BitFlags<Typ>)

Ref(TypeRef)

Fn(Arc<FnType>)

Set(Arc<[Type]>)

TVar(TVar)

Error(Arc<Type>)

Array(Arc<Type>)

ByRef(Arc<Type>)

Tuple(Arc<[Type]>)

Struct(Arc<[(ArcStr, Type)]>)

Variant(ArcStr, Arc<[Type]>)

Map

Fields

key: Arc<Type>

value: Arc<Type>

Abstract

Fields

id: AbstractId

params: Arc<[Type]>

Implementations

impl Type

pub fn check_cast(&self, env: &Env) -> Result<()>

pub fn cast_value(&self, env: &Env, v: Value) -> Value

pub fn is_a(&self, env: &Env, v: &Value) -> bool

return true if v is structurally compatible with the type

pub fn is_a_with(&self, env: &Env, flags: BitFlags<IsAFlags>, v: &Value) -> bool

return true if v is structurally compatible with the type, with flags

impl Type

pub fn check_contains(&self, env: &Env, t: &Self) -> Result<()>

pub fn contains(&self, env: &Env, t: &Self) -> Result<bool>

pub fn contains_with_flags( &self, flags: BitFlags<ContainsFlags>, env: &Env, t: &Self, ) -> Result<bool>

impl Type

pub fn could_match(&self, env: &Env, t: &Self) -> Result<bool>

pub fn sig_matches( &self, env: &Env, impl_type: &Self, adts: &FxHashMap<AbstractId, Type>, ) -> Result<()>

impl Type

pub fn resolve_tvars(&self) -> Self

Deep-clone the type tree, replacing every bound TVar with its concrete binding (recursively). Unbound TVars are kept as fresh named TVars. This produces a snapshot that is independent of the original TVar cells.

impl Type

pub fn union(&self, env: &Env, t: &Self) -> Result<Self>

pub fn diff(&self, env: &Env, t: &Self) -> Result<Self>

impl Type

pub fn unfreeze_tvars(&self)

pub fn alias_tvars(&self, known: &mut FxHashMap<ArcStr, TVar>)

alias type variables with the same name to each other

pub fn collect_tvars(&self, known: &mut FxHashMap<ArcStr, TVar>)

pub fn check_tvars_declared(&self, declared: &FxHashSet<ArcStr>) -> Result<()>

pub fn has_unbound(&self) -> bool

pub fn bind_as(&self, t: &Self)

bind all unbound type variables to the specified type

pub fn reset_tvars(&self) -> Type

return a copy of self with all type variables unbound and unaliased. self will not be modified

pub fn replace_tvars(&self, known: &FxHashMap<ArcStr, Self>) -> Type

return a copy of self with every TVar named in known replaced with the corresponding type. TVars not in known are replaced with fresh TVars using unique names to avoid entanglement with the caller’s TVars that happen to share the same name.

impl Type

pub fn empty_tvar() -> Self

pub fn is_defined(&self) -> bool

pub fn lookup_ref(&self, env: &Env) -> Result<Type>

pub fn record_ide_refs(&self, env: &Env, fallback_scope: &ModPath)

Walk this type tree and, for every Type::Ref carrying parser-populated pos/ori, push a TypeRefSite to the IDE side-channel. Used at typedef-registration time so references inside typedef bodies (which the type system never auto-derefs) still show up in find-references results. Caller is responsible for gating on env.lsp_mode; this method recurses unconditionally once entered.

pub fn any() -> Self

pub fn boolean() -> Self

pub fn number() -> Self

pub fn int() -> Self

pub fn uint() -> Self

pub fn strip_error(&self, env: &Env) -> Option<Self>

remove the outer error type and return the inner payload, fail if self isn’t an error or contains non error types

pub fn is_bot(&self) -> bool

pub fn with_deref<R, F: FnOnce(Option<&Self>) -> R>(&self, f: F) -> R

pub fn scope_refs(&self, scope: &ModPath) -> Type

Trait Implementations

impl Clone for Type

fn clone(&self) -> Type

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Type

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

Formats the value using the given formatter.

impl Default for Type

fn default() -> Self

Returns the “default value” for a type.

impl Display for Type

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

Formats the value using the given formatter.

impl Ord for Type

fn cmp(&self, other: &Type) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Type

fn eq(&self, other: &Type) -> 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 PartialOrd for Type

fn partial_cmp(&self, other: &Type) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl PrettyDisplay for Type

fn fmt_pretty_inner(&self, buf: &mut PrettyBuf) -> Result

Do the actual pretty print. This should not be called directly, it will be called by fmt_pretty when we know it can’t fit on a single line.

fn fmt_pretty(&self, buf: &mut PrettyBuf) -> Result

This is the user facing fmt method, it will first try to format the expression on a single line, and if that is impossible it will call the pretty printer.

fn to_string_pretty(&self, limit: usize) -> LPooled<String>

Pretty print to a pooled string

impl Eq for Type

impl StructuralPartialEq for Type