Struct hayami_im_rc::SymbolTable

pub struct SymbolTable<K: Hash + Eq, V, S: BuildHasher = RandomState> { /* fields omitted */ }

A symbol table implementation supporting snapshots, i.e. an O(1) cloning operation.

Faster than the implementation in snap, at the cost of not implementing Send + Sync.

Implementations

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

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

Create a new, empty symbol table

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

pub fn hasher(&self) -> &Rc<S>

Get a reference to the table's BuildHasher

pub fn with_hasher<RS>(hasher: RS) -> SymbolTable<K, V, S> where
    Rc<S>: From<RS>, 

Construct an empty hash map using the provided hasher.

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

pub fn get_prev(&self) -> Option<&Rc<SymbolTable<K, V, S>>>

Get an Arc to the previous layer's table, if there is any

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

pub fn extend(self) -> SymbolTable<K, V, S>

Get a new symbol table extending this one

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

fn fmt(&self, fmt: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<K: Hash + Eq, V, S: BuildHasher + Default> Default for SymbolTable<K, V, S>

fn default() -> SymbolTable<K, V, S>

Returns the "default value" for a type.

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

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

fn hash<H: Hasher>(&self, hasher: &mut H)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

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

fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut Self::Value> where
    K: Borrow<Q>,
    Q: Hash + Eq + ?Sized, 

Get a mutable reference to the definition of a key in the top level of this symbol table

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

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

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

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

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

type Value = V

The value stored in this symbol table

fn insert(&mut self, key: K, value: Self::Value)

Insert a key/value pair into this symbol table at the current level

fn get<Q: ?Sized>(&self, key: &Q) -> Option<&Self::Value> where
    Q: Hash + Eq,
    K: Borrow<Q>, 

Get the most recent definition of a key in this symbol table

fn contains_key<Q: ?Sized>(&self, key: &Q) -> bool where
    Q: Hash + Eq,
    K: Borrow<Q>, 

Whether this symbol table contains this key

fn is_empty(&self) -> bool

Whether this symbol table is empty

fn try_get_mut<Q: ?Sized>(&mut self, key: &Q) -> Option<&mut Self::Value> where
    Q: Hash + Eq,
    K: Borrow<Q>, 

Try to get a mutable reference to the definition of a key in the top level of this symbol table

fn push(&mut self)

Push a level onto this symbol table

fn pop(&mut self)

Pop a level from this symbol table

fn depth(&self) -> usize

Get the current depth of this symbol table

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

fn prev(&self) -> Option<&Self>

Get the previous layer of this symbol table