[−][src]Struct hayami_im::SymbolTable
A symbol table implementation supporting snapshots, i.e. an O(1)
cloning operation.
Implementations
impl<K: Hash + Eq, V> SymbolTable<K, V>
[src]
pub fn new() -> SymbolTable<K, V>
[src]
Create a new, empty symbol table
impl<K: Hash + Eq, V, S: BuildHasher> SymbolTable<K, V, S>
[src]
pub fn hasher(&self) -> &Arc<S>
[src]
Get a reference to the table's BuildHasher
pub fn with_hasher<RS>(hasher: RS) -> SymbolTable<K, V, S> where
Arc<S>: From<RS>,
[src]
Arc<S>: From<RS>,
Construct an empty hash map using the provided hasher.
impl<K: Hash + Eq, V, S: BuildHasher> SymbolTable<K, V, S>
[src]
pub fn get_prev(&self) -> Option<&Arc<SymbolTable<K, V, S>>>
[src]
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>
[src]
pub fn extend(self) -> SymbolTable<K, V, S>
[src]
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>
[src]
fn clone(&self) -> SymbolTable<K, V, S>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<K: Hash + Eq + Debug, V: Debug, S: BuildHasher> Debug for SymbolTable<K, V, S>
[src]
impl<K: Hash + Eq, V, S: BuildHasher + Default> Default for SymbolTable<K, V, S>
[src]
fn default() -> SymbolTable<K, V, S>
[src]
impl<K: Hash + Eq, V: Eq, S: BuildHasher> Eq for SymbolTable<K, V, S>
[src]
impl<K: Hash + Eq, V: Hash, S: BuildHasher> Hash for SymbolTable<K, V, S>
[src]
fn hash<H: Hasher>(&self, hasher: &mut H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<K: Hash + Eq + Clone, V: Clone, S: BuildHasher> MutSymbolMap<K> for SymbolTable<K, V, S>
[src]
fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut Self::Value> where
K: Borrow<Q>,
Q: Hash + Eq + ?Sized,
[src]
K: Borrow<Q>,
Q: Hash + Eq + ?Sized,
impl<K: Hash + Eq, V: PartialEq, S: BuildHasher> PartialEq<SymbolTable<K, V, S>> for SymbolTable<K, V, S>
[src]
impl<K: Hash + Eq + Clone, V: Clone, S: BuildHasher> SymbolMap<K> for SymbolTable<K, V, S>
[src]
type Value = V
The value stored in this symbol table
fn insert(&mut self, key: K, value: Self::Value)
[src]
fn get<Q: ?Sized>(&self, key: &Q) -> Option<&Self::Value> where
Q: Hash + Eq,
K: Borrow<Q>,
[src]
Q: Hash + Eq,
K: Borrow<Q>,
fn contains_key<Q: ?Sized>(&self, key: &Q) -> bool where
Q: Hash + Eq,
K: Borrow<Q>,
[src]
Q: Hash + Eq,
K: Borrow<Q>,
fn is_empty(&self) -> bool
[src]
fn try_get_mut<Q: ?Sized>(&mut self, key: &Q) -> Option<&mut Self::Value> where
Q: Hash + Eq,
K: Borrow<Q>,
[src]
Q: Hash + Eq,
K: Borrow<Q>,
fn push(&mut self)
[src]
fn pop(&mut self)
[src]
fn depth(&self) -> usize
[src]
impl<K: Hash + Eq + Clone, V: Clone, S: BuildHasher> SymbolStack<K> for SymbolTable<K, V, S>
[src]
Auto Trait Implementations
impl<K, V, S> RefUnwindSafe for SymbolTable<K, V, S> where
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V, S> Send for SymbolTable<K, V, S> where
K: Send + Sync,
S: Send + Sync,
V: Send + Sync,
K: Send + Sync,
S: Send + Sync,
V: Send + Sync,
impl<K, V, S> Sync for SymbolTable<K, V, S> where
K: Send + Sync,
S: Send + Sync,
V: Send + Sync,
K: Send + Sync,
S: Send + Sync,
V: Send + Sync,
impl<K, V, S> Unpin for SymbolTable<K, V, S> where
K: Unpin,
V: Unpin,
K: Unpin,
V: Unpin,
impl<K, V, S> UnwindSafe for SymbolTable<K, V, S> where
K: RefUnwindSafe + UnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe + UnwindSafe,
K: RefUnwindSafe + UnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe + UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Erasable for T
unsafe fn unerase(this: NonNull<Erased>) -> NonNull<T>
const ACK_1_1_0: bool
fn erase(this: NonNull<Self>) -> NonNull<Erased>
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,