Struct BijectiveBTreeMap 

pub struct BijectiveBTreeMap<L, R> { /* private fields */ }

Implementations

impl<L: Ord + Copy, R: Ord + Copy> BijectiveBTreeMap<L, R>

pub const fn new() -> Self

pub fn insert(&mut self, key: L, value: R)

pub fn get_by_left(&self, key: &L) -> Option<&R>

pub fn get_by_right(&self, value: &R) -> Option<&L>

pub fn remove_by_key(&mut self, key: &L) -> Option<R>

pub fn remove_by_value(&mut self, value: &R) -> Option<L>

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

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

Trait Implementations

impl<L: Ord + Copy, R: Ord + Copy> Clone for BijectiveBTreeMap<L, R>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<L: Ord + Copy + Debug, R: Ord + Copy + Debug> Debug for BijectiveBTreeMap<L, R>

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

Formats the value using the given formatter.

impl<L: Ord + Copy, R: Ord + Copy> Default for BijectiveBTreeMap<L, R>

fn default() -> Self

Returns the “default value” for a type.