Struct Scope

pub struct Scope<K: Hash + Eq, V>(/* private fields */);

Structure for storing an AST node as a hashmap node inside of a vector.

To use this structure, a node type has to implament Hash and Eq (similar to PartialEq).

Implementations

impl<K: Hash + Eq, V> Scope<K, V>

pub fn new() -> Self

Creates a new, empty scope.

pub fn enter_scope(&mut self)

Creates a new scope at top of stack, acting as a new scope.

pub fn leave_scope(&mut self)

Leaves the scope by popping the top value of the HashMap vector stack.

pub fn get(&self, item: &K) -> Option<&V>

Scans bottom-up from the scope stack to find the specified item argument. This method recurses down the branches of the stack until it finds the item (linear search).

pub fn insert(&mut self, key: K, value: V) -> Option<V>

Inserts a new item into the stack.

NOTE: This will panic if a fatal error occurs if inserting into a broken stack.

pub fn depth(&self) -> usize

Gets the depth of the entire Scope data structure.