Struct erg_compiler::ty::free::Free

pub struct Free<T: Send + Clone>(/* private fields */);

Implementations

impl<T: CanbeFree + Send + Clone> Free<T>

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

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

impl<T: Send + Clone> 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>

impl Free<Type>

pub fn deep_clone(&self) -> Self

pub fn is_recursive(&self) -> bool

pub fn do_avoiding_recursion<O, F: FnOnce() -> O>(&self, f: F) -> O

pub fn do_avoiding_recursion_with<O, F: FnOnce() -> O>( &self, placeholder: &Type, f: F ) -> O

impl Free<TyParam>

pub fn deep_clone(&self) -> Self

pub fn is_recursive(&self) -> bool

pub fn do_avoiding_recursion<O, F: FnOnce() -> O>(&self, f: F) -> O

pub fn do_avoiding_recursion_with<O, F: FnOnce() -> O>( &self, placeholder: &TyParam, f: F ) -> O

impl<T: Send + Clone> Free<T>

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

pub fn update_init(&mut self)

impl<T: Send + Clone> 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 crack(&self) -> Ref<'_, T>

returns linked type (panic if self is unbounded) NOTE: check by .is_linked before call NOTE: Sometimes a BorrowMut error occurs when trying to pass the result of crack().clone() as an argument. Bind it to a variable beforehand.

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

pub fn unsafe_crack(&self) -> &T

pub fn addr_eq(&self, other: &Self) -> bool

impl<T: Send + Sync + 'static + Clone> Free<T>

pub fn is_linked(&self) -> bool

pub fn is_undoable_linked(&self) -> bool

pub fn is_named_unbound(&self) -> bool

pub fn is_unnamed_unbound(&self) -> bool

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

interior-mut

impl<T: Clone + Send + Sync + 'static> Free<T>

pub fn undo(&self)

interior-mut

pub fn undo_stack_size(&self) -> usize

pub fn inc_undo_count(&self)

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

pub fn unwrap_linked(self) -> T

pub fn get_linked(&self) -> Option<T>

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

pub fn get_linked_refmut(&self) -> Option<RefMut<'_, T>>

pub fn get_previous(&self) -> Option<Ref<'_, Box<FreeKind<T>>>>

pub fn detach(&self) -> Self

impl<T: Default + Clone + Debug + Send + Sync + 'static> Free<T>

pub fn dummy_link(&self)

interior-mut

impl<T: CanbeFree + Send + Clone> 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)>

:> Sub, <: Super

pub fn is_unbound(&self) -> bool

pub fn is_unbound_and_sandwiched(&self) -> bool

pub fn is_unbound_and_typed(&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 )

interior-mut if in_inst_or_gen is true, constraint will be updated forcibly

pub fn update_sub<F>(&self, f: F)

where F: FnOnce(Type) -> Type,

interior-mut

pub fn update_super<F>(&self, f: F)

where F: FnOnce(Type) -> Type,

interior-mut

pub fn update_type(&self, new_type: Type)

interior-mut

impl Free<TyParam>

pub fn map<F>(&self, f: F)

where F: Fn(TyParam) -> TyParam,

Trait Implementations

impl<T: Clone + Send + 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 + Send + Clone> Debug for Free<T>

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

Formats the value using the given formatter.

impl<T: LimitedDisplay + Send + Clone> Display for Free<T>

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

Formats the value using the given formatter.

impl HasLevel for Free<TyParam>

fn set_level(&self, level: Level)

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

fn set_lower(&self, level: Level)

fn lift(&self)

fn lower(&self)

fn generalize(&self)

fn is_generalized(&self) -> bool

impl HasLevel for Free<Type>

fn set_level(&self, level: Level)

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

fn set_lower(&self, level: Level)

fn lift(&self)

fn lower(&self)

fn generalize(&self)

fn is_generalized(&self) -> bool

impl Hash for Free<TyParam>

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 Hash for Free<Type>

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 + Send + Clone> LimitedDisplay for Free<T>

fn limited_fmt<W: Write>(&self, f: &mut W, limit: isize) -> Result

If limit was set to a negative value, it will be displayed without abbreviation. FIXME:

fn to_string_unabbreviated(&self) -> String

impl PartialEq for Free<TyParam>

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

fn eq(&self, other: &Self) -> 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: StructuralEq + CanbeFree + Clone + Default + Debug + Send + Sync + 'static> StructuralEq for Free<T>

fn structural_eq(&self, other: &Self) -> bool

impl Eq for Free<TyParam>

impl Eq for Free<Type>