Struct LinearState

pub struct LinearState {
    trees: HashMap<ItemReference, Rc<RefCell<LinearTree>>>,
}

Fields

trees: HashMap<ItemReference, Rc<RefCell<LinearTree>>>

The trees visible via references, either names or expression IDs. Multiple references can refer to the same tree

Implementations

impl LinearState

pub fn new() -> Self

pub fn check_unused(&self) -> Result<(), (Loc<ItemReference>, MutWireWitness)>

If there is an linear tree which has a leaf node that is unused, reports it as an item reference and a witness for something that needs to be used.

The item reference is chosen to be as useful to the user as possible. If there is a name alias for this item, it is used, if not, an expression reference is used

pub fn push_type(&mut self, reference: Loc<ItemReference>, ty: &ConcreteType)

pub fn push_new_expression( &mut self, expr_id: &Loc<ExprID>, ctx: &LinearCtx<'_>, )

pub fn push_new_name(&mut self, name: &Loc<NameID>, ctx: &LinearCtx<'_>)

pub fn merge( &mut self, lhs: Loc<ItemReference>, rhs: Loc<ItemReference>, ) -> Result<(), Diagnostic>

Merges two ItemReferences into a single tree. Exactly one of the items must have a pre-existing tree, or the pre-existing trees must be the same trees, otherwise it panics

pub fn add_alias_name( &mut self, from: Loc<ExprID>, to: &Loc<NameID>, ) -> Result<(), Diagnostic>

fn alias_subtree<F>( &mut self, to: Loc<ExprID>, base_expr: ExprID, idx: F, ) -> Result<(), Diagnostic>

where F: Fn(&LinearTree) -> Rc<RefCell<LinearTree>>,

pub fn alias_tuple_member( &mut self, to: Loc<ExprID>, base_expr: ExprID, idx: &Loc<u128>, ) -> Result<(), Diagnostic>

Adds from as an alias to the tree at base_expr#tuple_member. Panics if base_expr is not a tuple with at least idx elements

pub fn alias_array_member( &mut self, to: Loc<ExprID>, base_expr: ExprID, idx: &Loc<u128>, ) -> Result<(), Diagnostic>

Adds from as an alias to the tree at base_expr[idx]. Panics if base_expr is not a tuple with at least idx elements

pub fn alias_struct_member( &mut self, to: Loc<ExprID>, base_expr: ExprID, field: &Loc<Identifier>, ) -> Result<(), Diagnostic>

Adds from as an alias to the tree at base_expr#tuple_member. Panics if base_expr is not a tuple with at least idx elements

pub fn push_pattern( &mut self, pat: &Pattern, ctx: &LinearCtx<'_>, ) -> Result<(), Diagnostic>

pub fn consume_expression(&mut self, expr: &Loc<Expression>) -> Result<()>

pub fn consume_id(&mut self, id: Loc<ExprID>) -> Result<()>