Struct PersistentScopedMap 

pub struct PersistentScopedMap<K, V> { /* private fields */ }

Scoped hash table similar to hermes::ScopedHashTable, but scopes can be retained and reactivated after they have been popped from the table. See the module documentation for the full example and for the deviations from the C++ implementation.

Implementations

impl<K: Eq + Hash + Copy, V: Clone> PersistentScopedMap<K, V>

pub fn new() -> Self

pub fn current_scope(&self) -> ScopePtr<K, V>

Return a pointer to the current scope. The pointer may be null.

pub fn try_emplace_into_scope( &self, scope: &ScopePtr<K, V>, key: K, value: V, ) -> bool

Attempt to insert an element into the specified scope. Returns whether the insertion took place (false if key already has a binding in scope). A key may not be inserted such that it would be shadowed by another scope currently in effect. Attempting to do so results in undefined behavior.

pub fn try_emplace(&self, key: K, value: V) -> bool

Attempt to insert an element into the current scope. Returns whether the insertion took place.

pub fn put_in_scope(&self, scope: &ScopePtr<K, V>, key: K, value: V)

Insert or update a value in the specified scope. A key may not be inserted such that it would be shadowed by another scope currently in effect. Attempting to do so results in undefined behavior.

pub fn put(&self, key: K, value: V)

Insert or update an existing value in the current scope.

pub fn count(&self, key: &K) -> u32

Returns 1 if the value is defined, 0 if it’s not.

pub fn lookup(&self, key: &K) -> Option<V>

Gets the innermost value for a key, or None if none.

pub fn find(&self, key: &K) -> Option<V>

Return the innermost value for a key, or None if none.

pub fn find_with_depth(&self, key: &K) -> Option<(V, u32)>

\return the innermost value for a key along with its depth, or None if none.

pub fn find_in_current_scope(&self, key: &K) -> Option<V>

\return the value for a key if it exists in the current scope, or None if none.

pub fn activate_scope(&self, new_scope_ptr: &ScopePtr<K, V>)

pub fn flatten(&self) -> HashMap<K, V>

Gets all values currently in scope. Port of the UNIT_TEST-only test_flatten; kept pub (not test-gated) since the resolver’s own tests use it too.

pub fn keys_by_scope(&self) -> Vec<Vec<K>>

Gets keys in each scope. This may correspond to a ScopeChain. Shadowed keys are ignored. Index 0 is innermost. Port of the UNIT_TEST-only test_getKeysByScope; kept pub for the same reason as flatten.

Trait Implementations

impl<K: Eq + Hash + Copy, V: Clone> Default for PersistentScopedMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K, V> Drop for PersistentScopedMap<K, V>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.