Struct SymbolTable

pub struct SymbolTable<K: Hash + Eq, V> { /* private fields */ }

A simple, generic symbol table

Implementations

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

pub fn new() -> SymbolTable<K, V>

Create a new, empty symbol table

pub fn with_capacity(n: usize) -> SymbolTable<K, V>

Create a symbol table with a given capacity

pub fn depth(&self) -> usize

Get the current depth

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

Register a given symbol at the current depth, returning the current definition at the current depth, if any.

pub fn get_full<Q>(&self, key: &Q) -> Option<(&V, usize)>

where Q: ?Sized + Hash + Equivalent<K>,

Get the definition of a current symbol, along with its depth, if any

pub fn get<Q>(&self, key: &Q) -> Option<&V>

where Q: ?Sized + Hash + Equivalent<K>,

Get the definition of a current symbol

pub fn get_full_mut<Q>(&mut self, key: &Q) -> Option<(&mut V, usize)>

where Q: ?Sized + Hash + Equivalent<K>,

Mutably get the definition of a current symbol, along with its depth, if any

pub fn try_get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>

where Q: ?Sized + Hash + Equivalent<K>,

Try to mutably get the definition of a current symbol at the current depth

pub fn jump_to_depth(&mut self, depth: usize)

Get the mutable definition of a current symbol, along with its depth, if any Jump to a given depth, removing obsolete definitions. Return the number of keys and definitions removed, as well as keys touched, if any.

pub fn push(&mut self)

Add a level of depth

pub fn pop(&mut self)

Try to remove a level of depth. Does nothing if depth = 0

Trait Implementations

impl<K: Clone + Hash + Eq, V: Clone> Clone for SymbolTable<K, V>

fn clone(&self) -> SymbolTable<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Hash + Eq, V: Debug> Debug for SymbolTable<K, V>

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

Formats the value using the given formatter.

impl<K: PartialEq + Hash + Eq, V: PartialEq> PartialEq for SymbolTable<K, V>

fn eq(&self, other: &SymbolTable<K, V>) -> 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<K: Eq + Hash + Eq, V: Eq> Eq for SymbolTable<K, V>

impl<K: Hash + Eq, V> StructuralPartialEq for SymbolTable<K, V>