Struct RehashingHashMap

Source
pub struct RehashingHashMap<K: Eq + Hash, V> { /* private fields */ }

Implementations§

Source§

impl<K, V> RehashingHashMap<K, V>
where K: Eq + Hash + Clone,

Source

pub fn new() -> RehashingHashMap<K, V>

Source

pub fn with_capacity(capacity: usize) -> RehashingHashMap<K, V>

Source

pub fn rehash(&mut self)

Source

pub fn capacity(&self) -> usize

Source

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

Source

pub fn is_rehashing(&self) -> bool

Source

pub fn shrink_to_fit(&mut self)

Source

pub fn len(&self) -> usize

Source

pub fn is_empty(&self) -> bool

Source

pub fn clear(&mut self)

Source

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

Source

pub fn get<Q>(&self, k: &Q) -> Option<&V>
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Source

pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Source

pub fn contains_key<Q>(&self, k: &Q) -> bool
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Source

pub fn remove<Q>(&mut self, k: &Q) -> Option<V>
where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Source

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

Source

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

Source

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

Source

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

Source

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

Trait Implementations§

Source§

impl<K: Debug + Eq + Hash, V: Debug> Debug for RehashingHashMap<K, V>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<K: Default + Eq + Hash, V: Default> Default for RehashingHashMap<K, V>

Source§

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

Returns the “default value” for a type. Read more
Source§

impl<K, V> Extend<(K, V)> for RehashingHashMap<K, V>
where K: Eq + Hash + Clone,

Source§

fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator. Read more
Source§

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
Source§

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)
Reserves capacity in a collection for the given number of additional elements. Read more
Source§

impl<K, V> FromIterator<(K, V)> for RehashingHashMap<K, V>
where K: Eq + Hash + Clone,

Source§

fn from_iter<T: IntoIterator<Item = (K, V)>>( iterable: T, ) -> RehashingHashMap<K, V>

Creates a value from an iterator. Read more
Source§

impl<'a, K, Q, V> Index<&'a Q> for RehashingHashMap<K, V>
where K: Eq + Hash + Clone + Borrow<Q>, Q: Eq + Hash + ?Sized,

Source§

type Output = V

The returned type after indexing.
Source§

fn index(&self, index: &Q) -> &V

Performs the indexing (container[index]) operation. Read more
Source§

impl<'a, K, V> IntoIterator for &'a RehashingHashMap<K, V>
where K: Eq + Hash + Clone,

Source§

type Item = (&'a K, &'a V)

The type of the elements being iterated over.
Source§

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?
Source§

fn into_iter(self) -> Iter<'a, K, V>

Creates an iterator from a value. Read more
Source§

impl<'a, K, V> IntoIterator for &'a mut RehashingHashMap<K, V>
where K: Eq + Hash + Clone,

Source§

type Item = (&'a K, &'a mut V)

The type of the elements being iterated over.
Source§

type IntoIter = IterMut<'a, K, V>

Which kind of iterator are we turning this into?
Source§

fn into_iter(self) -> IterMut<'a, K, V>

Creates an iterator from a value. Read more
Source§

impl<K, V> PartialEq for RehashingHashMap<K, V>
where K: Eq + Hash + Clone, V: PartialEq,

Source§

fn eq(&self, other: &RehashingHashMap<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

Auto Trait Implementations§

§

impl<K, V> Freeze for RehashingHashMap<K, V>

§

impl<K, V> RefUnwindSafe for RehashingHashMap<K, V>

§

impl<K, V> Send for RehashingHashMap<K, V>
where K: Send, V: Send,

§

impl<K, V> Sync for RehashingHashMap<K, V>
where K: Sync, V: Sync,

§

impl<K, V> Unpin for RehashingHashMap<K, V>
where K: Unpin, V: Unpin,

§

impl<K, V> UnwindSafe for RehashingHashMap<K, V>
where K: UnwindSafe, V: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.