Struct VarRemapping 

pub struct VarRemapping<'db> {
    pub remapping: SmallOrderedMap<VariableId, VarUsage<'db>>,
}

Remapping of lowered variable ids. Useful for convergence of branches.

Fields

remapping: SmallOrderedMap<VariableId, VarUsage<'db>>

Map from new_var to old_var (since new_var cannot appear twice, but old_var can).

Methods from Deref<Target = SmallOrderedMap<VariableId, VarUsage<'db>>>

pub fn eq_unordered(&self, other: &SmallOrderedMap<Key, Value>) -> bool

Checks if the two maps have the same keys and values.

Methods from Deref<Target = VecMap<Key, Value>>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn capacity(&self) -> usize

pub fn clear(&mut self)

pub fn contains_key<Q>(&self, key: &Q) -> bool

where Q: PartialEq<K> + ?Sized,

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

where Q: PartialEq<K> + ?Sized,

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

where Q: PartialEq<K> + ?Sized,

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

where K: PartialEq,

pub fn drain(&mut self) -> Drain<'_, K, V>

pub fn reserve(&mut self, additional: usize)

pub fn shrink_to_fit(&mut self)

pub fn get_key_value<'l, Q>(&'l self, key: &Q) -> Option<(&'l K, &'l V)>

where Q: PartialEq<K> + ?Sized,

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

where Q: PartialEq<K> + ?Sized,

pub fn entry(&mut self, key: K) -> Entry<'_, K, V>

where K: PartialEq,

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

where Q: PartialEq<K> + ?Sized,

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&K, &mut V) -> bool,

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

pub fn iter_mut(&mut self) -> IterMut<'_, K, V>

pub fn sort(&mut self)

where K: Ord,

pub unsafe fn identical(&self, other: &VecMap<K, V>) -> bool

where K: PartialEq, V: PartialEq,

Much faster than self == other, but will return false if the order of the data isn’t identical.

Safety

Note that for the order of data with two VecMaps to be identical, they must either have been both sorted, or they must have undergone the insertion and removal of keys in the same order.

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

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

Trait Implementations

impl<'db> Clone for VarRemapping<'db>

fn clone(&self) -> VarRemapping<'db>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'db> Debug for VarRemapping<'db>

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

Formats the value using the given formatter.

impl<'db> DebugWithDb<'db> for VarRemapping<'db>

type Db = LoweredFormatter<'db>

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

fn debug<'me>(&'me self, db: &'db Self::Db) -> DebugWith<'me, 'db, Self::Db>

where Self: Sized + 'me,

fn into_debug<'me>(self, db: &'db Self::Db) -> DebugWith<'me, 'db, Self::Db>

where Self: Sized + 'me,

impl<'db> Default for VarRemapping<'db>

fn default() -> VarRemapping<'db>

Returns the “default value” for a type.

impl<'db> Deref for VarRemapping<'db>

type Target = SmallOrderedMap<Id<VariableMarker>, VarUsage<'db>>

The resulting type after dereferencing.

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

Dereferences the value.

impl<'db> DerefMut for VarRemapping<'db>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'db> PartialEq for VarRemapping<'db>

fn eq(&self, other: &VarRemapping<'db>) -> 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<'db> Eq for VarRemapping<'db>

impl<'db> StructuralPartialEq for VarRemapping<'db>