Struct I64Map 

pub struct I64Map<V> { /* private fields */ }

High-performance HashMap for i64 keys. Supports the full i64 key domain. i64::MIN is stored out of band so the hot open-addressed table can continue using it as its empty-slot sentinel.

Implementations

impl<V> I64Map<V>

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn capacity(&self) -> usize

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

Reserves capacity for at least additional more elements to be inserted in the map. The collection may reserve more space to avoid frequent reallocations.

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

pub fn get(&self, key: i64) -> Option<&V>

pub fn get_mut(&mut self, key: i64) -> Option<&mut V>

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

pub fn remove(&mut self, key: i64) -> Option<V>

pub fn shrink_to_fit(&mut self)

Shrink the map to fit its current contents, releasing excess memory.

Call this after removing many entries to reclaim memory.

pub fn clear(&mut self)

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

pub fn keys(&self) -> impl Iterator<Item = i64> + '_

pub fn values(&self) -> impl Iterator<Item = &V>

pub fn iter_mut(&mut self) -> impl Iterator<Item = (i64, &mut V)>

pub fn retain<F>(&mut self, f: F)

where F: FnMut(i64, &mut V) -> bool,

Retains only the elements specified by the predicate.

In other words, remove all entries (k, v) where f(k, &mut v) returns false.

pub fn drain(&mut self) -> Drain<V>

Drains all entries from the map, returning an iterator over them

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

Trait Implementations

impl<V: Clone> Clone for I64Map<V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V> Default for I64Map<V>

fn default() -> Self

Returns the “default value” for a type.

impl<V> Drop for I64Map<V>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl<V> IntoIterator for I64Map<V>

type Item = (i64, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.