Struct BiMap 

pub struct BiMap<L: Hash + Eq, R: Hash + Eq> { /* private fields */ }

Implementations

impl<L: Eq + Hash + Clone, R: Eq + Hash + Clone> BiMap<L, R>

pub fn new() -> Self

pub fn from<const N: usize>(pairs: [(L, R); N]) -> Self

pub fn len(&self) -> usize

pub fn into_inner(self) -> (HashMap<L, R>, HashMap<R, L>)

pub fn into_reversed(self) -> BiMap<R, L>

pub fn into_left_map(self) -> HashMap<L, R>

pub fn into_right_map(self) -> HashMap<R, L>

pub fn insert(&mut self, left: L, right: R)

pub fn get_left(&self, left: &L) -> Option<&R>

pub fn get_right(&self, right: &R) -> Option<&L>

pub fn contains_left(&self, left: &L) -> bool

pub fn contains_right(&self, right: &R) -> bool

pub fn remove_left(&mut self, left: &L) -> Option<R>

pub fn remove_right(&mut self, right: &R) -> Option<L>

pub fn right_values(&self) -> impl Iterator<Item = &R>

pub fn left_values(&self) -> impl Iterator<Item = &L>

pub fn iter(&self) -> impl Iterator<Item = (&L, &R)>

Trait Implementations

impl<L: Clone + Hash + Eq, R: Clone + Hash + Eq> Clone for BiMap<L, R>

fn clone(&self) -> BiMap<L, R>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<L: Debug + Hash + Eq, R: Debug + Hash + Eq> Debug for BiMap<L, R>

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

Formats the value using the given formatter.

impl<'de, L, R> Deserialize<'de> for BiMap<L, R>

where L: Deserialize<'de> + Hash + Eq, R: Deserialize<'de> + Hash + Eq,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<L: Eq + Hash + Eq, R: Eq + Hash + Eq> Eq for BiMap<L, R>

impl<L: Eq + Hash + Clone, R: Eq + Hash + Clone> IntoIterator for BiMap<L, R>

type Item = (L, R)

The type of the elements being iterated over.

type IntoIter = IntoIter<L, R>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<L: PartialEq + Hash + Eq, R: PartialEq + Hash + Eq> PartialEq for BiMap<L, R>

fn eq(&self, other: &BiMap<L, R>) -> 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<L, R> Serialize for BiMap<L, R>

where L: Serialize + Hash + Eq, R: Serialize + Hash + Eq,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<L: Hash + Eq, R: Hash + Eq> StructuralPartialEq for BiMap<L, R>