Struct erg_compiler::ty::free::Free

pub struct Free<T>(_);

Implementations

impl<T: CanbeFree> Free<T>

pub fn unbound_name(&self) -> Option<Str>

pub fn constraint(&self) -> Option<Constraint>

impl<T> Free<T>

pub fn borrow(&self) -> Ref<'_, FreeKind<T>>

pub fn borrow_mut(&self) -> RefMut<'_, FreeKind<T>>

pub fn as_ptr(&self) -> *mut FreeKind<T>

very unsafe, use force_replace instead whenever possible

pub fn forced_as_ref(&self) -> &FreeKind<T>

pub fn force_replace(&self, new: FreeKind<T>)

pub fn can_borrow(&self) -> bool

pub fn can_borrow_mut(&self) -> bool

impl<T: Clone> Free<T>

pub fn clone_inner(&self) -> FreeKind<T>

impl<T: Clone + HasLevel + LimitedDisplay> Free<T>

pub fn new(f: FreeKind<T>) -> Self

pub fn new_unbound(level: Level, constraint: Constraint) -> Self

pub fn new_named_unbound(name: Str, level: Level, constraint: Constraint) -> Self

pub fn new_linked(t: T) -> Self

pub fn link(&self, to: &T)

pub fn replace(&self, to: FreeKind<T>)

pub fn forced_link(&self, to: &T)

NOTE: Do not use this except to rewrite circular references. No reference to any type variable may be left behind when rewriting. However, get_bound_types is safe because it does not return references.

pub fn undoable_link(&self, to: &T)

pub fn forced_undoable_link(&self, to: &T)

NOTE: Do not use this except to rewrite circular references. No reference to any type variable may be left behind when rewriting. However, get_bound_types is safe because it does not return references.

pub fn undo(&self)

pub fn unwrap_unbound(self) -> (Option<Str>, usize, Constraint)

pub fn unwrap_linked(self) -> T

pub fn detach(&self) -> Self

pub fn crack(&self) -> Ref<'_, T>

returns linked type (panic if self is unbounded) NOTE: check by .is_linked before call

pub fn crack_constraint(&self) -> Ref<'_, Constraint>

pub fn is_linked(&self) -> bool

pub fn is_undoable_linked(&self) -> bool

impl<T: CanbeFree> Free<T>

pub fn get_type(&self) -> Option<Type>

pub fn get_super(&self) -> Option<Type>

<: Super

pub fn get_sub(&self) -> Option<Type>

:> Sub

pub fn get_subsup(&self) -> Option<(Type, Type)>

pub fn is_unbound(&self) -> bool

pub fn constraint_is_typeof(&self) -> bool

pub fn constraint_is_sandwiched(&self) -> bool

pub fn constraint_is_uninited(&self) -> bool

pub fn update_constraint(&self, new_constraint: Constraint, in_inst_or_gen: bool)

impl Free<TyParam>

pub fn map<F>(&self, f: F)where
F: Fn(TyParam) -> TyParam,

Trait Implementations

impl<T: Clone> Clone for Free<T>

fn clone(&self) -> Free<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Free<T>

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

Formats the value using the given formatter.

impl<T: LimitedDisplay> Display for Free<T>

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

Formats the value using the given formatter.

impl<T: HasLevel> HasLevel for Free<T>

fn set_level(&self, level: Level)

fn level(&self) -> Option<Level>

fn lower(&self, level: Level)

fn lift(&self)

fn generalize(&self)

fn is_generalized(&self) -> bool

impl<T: Hash> Hash for Free<T>

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<T: LimitedDisplay> LimitedDisplay for Free<T>

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

impl<T: PartialEq> PartialEq<Free<T>> for Free<T>

fn eq(&self, other: &Free<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<T: Eq> Eq for Free<T>

impl<T> StructuralEq for Free<T>

impl<T> StructuralPartialEq for Free<T>