Struct hotg_rune_compiler::lowering::NameTable

pub struct NameTable(_);

A lookup table mapping Name components back to their Entity.

Methods from Deref<Target = IndexMap<Name, Entity>>

pub fn capacity(&self) -> usize

Computes in O(1) time.

pub fn hasher(&self) -> &S

Return a reference to the map’s BuildHasher.

pub fn len(&self) -> usize

Return the number of key-value pairs in the map.

Computes in O(1) time.

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

Computes in O(1) time.

pub fn iter(&self) -> Iter<'_, K, V>

Return an iterator over the key-value pairs of the map, in their order

pub fn keys(&self) -> Keys<'_, K, V>

Return an iterator over the keys of the map, in their order

pub fn values(&self) -> Values<'_, K, V>

Return an iterator over the values of the map, in their order

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

Return true if an equivalent to key exists in the map.

Computes in O(1) time (average).

pub fn get<Q>(&self, key: &Q) -> Option<&V> where
    Q: Hash + Equivalent<K> + ?Sized, 

Return a reference to the value stored for key, if it is present, else None.

Computes in O(1) time (average).

pub fn get_key_value<Q>(&self, key: &Q) -> Option<(&K, &V)> where
    Q: Hash + Equivalent<K> + ?Sized, 

Return references to the key-value pair stored for key, if it is present, else None.

Computes in O(1) time (average).

pub fn get_full<Q>(&self, key: &Q) -> Option<(usize, &K, &V)> where
    Q: Hash + Equivalent<K> + ?Sized, 

Return item index, key and value

pub fn get_index_of<Q>(&self, key: &Q) -> Option<usize> where
    Q: Hash + Equivalent<K> + ?Sized, 

Return item index, if it exists in the map

Computes in O(1) time (average).

pub fn get_index(&self, index: usize) -> Option<(&K, &V)>

Get a key-value pair by index

Valid indices are 0 <= index < self.len()

Computes in O(1) time.

pub fn first(&self) -> Option<(&K, &V)>

Get the first key-value pair

Computes in O(1) time.

pub fn last(&self) -> Option<(&K, &V)>

Get the last key-value pair

Computes in O(1) time.

Trait Implementations

impl Clone for NameTable

fn clone(&self) -> NameTable

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NameTable

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

Formats the value using the given formatter.

impl Default for NameTable

fn default() -> NameTable

Returns the “default value” for a type.

impl Deref for NameTable

type Target = IndexMap<Name, Entity>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'de> Deserialize<'de> for NameTable

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl From<IndexMap<Name, Entity, RandomState>> for NameTable

fn from(m: IndexMap<Name, Entity>) -> Self

Performs the conversion.

impl PartialEq<NameTable> for NameTable

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

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

fn ne(&self, other: &NameTable) -> bool

This method tests for !=.

impl Serialize for NameTable

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for NameTable