Struct BiDirHashMap

pub struct BiDirHashMap<K, V> { /* private fields */ }

Implementations

impl<K, V> BiDirHashMap<K, V>

where K: Hash + Eq + Clone, V: Hash + Eq + Clone,

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

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

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

where Q: Hash + Eq + ?Sized, K: Borrow<Q>,

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

pub fn contains_value<Q>(&self, value: &Q) -> bool

where Q: Hash + Eq + ?Sized, V: Borrow<Q>,

pub fn value_of(&self, node: &K) -> Option<&V>

pub fn key_of(&self, value: &V) -> Option<&K>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

pub fn forward_map(&self) -> &HashMap<K, V, BuildHasherDefault<FxHasher>>

pub fn backward_map(&self) -> &HashMap<V, K, BuildHasherDefault<FxHasher>>

pub fn into_inner( self, ) -> (HashMap<K, V, BuildHasherDefault<FxHasher>>, HashMap<V, K, BuildHasherDefault<FxHasher>>)

Trait Implementations

impl<K, V> Clone for BiDirHashMap<K, V>

where K: Clone, V: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for BiDirHashMap<K, V>

where K: Debug, V: Debug,

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

Formats the value using the given formatter.

impl<K, V> Default for BiDirHashMap<K, V>

fn default() -> BiDirHashMap<K, V>

Returns the “default value” for a type.

impl<K, V> From<HashMap<K, V, BuildHasherDefault<FxHasher>>> for BiDirHashMap<K, V>

where K: Hash + Eq + Clone, V: Hash + Eq + Clone,

fn from( forward_map: HashMap<K, V, BuildHasherDefault<FxHasher>>, ) -> BiDirHashMap<K, V>

Converts to this type from the input type.

impl<K, V> FromIterator<(K, V)> for BiDirHashMap<K, V>

where K: Hash + Eq + Clone, V: Hash + Eq + Clone,

fn from_iter<T>(iter: T) -> BiDirHashMap<K, V>

where T: IntoIterator<Item = (K, V)>,

Creates a value from an iterator.

impl<K, V> Visit for BiDirHashMap<K, V>

where K: Hash + Eq + Clone + Default + Visit, V: Hash + Eq + Clone + Default + Visit,

fn visit(&mut self, name: &str, visitor: &mut Visitor) -> Result<(), VisitError>

Read or write this value, depending on whether Visitor::is_reading() is true or false.