Struct BiMap 

pub struct BiMap<K: PartialEq + Clone, V: PartialEq + Clone> { /* private fields */ }

A bidirectional map where both keys and values are unique.

Provides O(n) forward and reverse lookup, useful for managing bijections between names and indices in the elaboration context.

Implementations

impl<K: PartialEq + Clone, V: PartialEq + Clone> BiMap<K, V>

pub fn new() -> Self

Create an empty bidirectional map.

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

Insert a (key, value) pair, evicting any existing entries that conflict.

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

Forward lookup: key → value.

pub fn get_by_val(&self, val: &V) -> Option<&K>

Reverse lookup: value → key.

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

Remove by key.

pub fn remove_by_val(&mut self, val: &V) -> Option<K>

Remove by value.

pub fn len(&self) -> usize

Number of entries.

pub fn is_empty(&self) -> bool

Check if empty.

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

Check if the key exists.

pub fn contains_val(&self, val: &V) -> bool

Check if the value exists.

pub fn iter(&self) -> impl Iterator<Item = &(K, V)>

Iterate over (key, value) pairs.

pub fn clear(&mut self)

Clear all entries.

Trait Implementations

impl<K: Clone + PartialEq + Clone, V: Clone + PartialEq + Clone> Clone for BiMap<K, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + PartialEq + Clone, V: Debug + PartialEq + Clone> Debug for BiMap<K, V>

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

Formats the value using the given formatter.

impl<K: PartialEq + Clone, V: PartialEq + Clone> Default for BiMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K: PartialEq + PartialEq + Clone, V: PartialEq + PartialEq + Clone> PartialEq for BiMap<K, V>

fn eq(&self, other: &BiMap<K, V>) -> 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<K: PartialEq + Clone, V: PartialEq + Clone> StructuralPartialEq for BiMap<K, V>