Struct FlatMap 

pub struct FlatMap<K: Eq, V> { /* private fields */ }

Linear Map with no sorting guarantee and no duplicate entries

Implementations

impl<K, V> FlatMap<K, V>

where K: Eq,

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn from_entries(iter: impl Iterator<Item = FlatMapEntry<K, V>>) -> Self

inserts entries by checking for duplicates for every item if duplicate items are found, last one stays while earlier gets discarded not recommended for large list of entries, check for duplicates yourself and use FlatMap::from_entries_unchecked

pub unsafe fn from_entries_unchecked( iter: impl Iterator<Item = FlatMapEntry<K, V>>, ) -> Self

construct inner vec without checking for duplicates

pub fn get(&self, k: &K) -> Option<&V>

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

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

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

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

pub fn shrink_to_fit(&mut self)

Trait Implementations

impl<K: Eq + Clone, V: Clone> Clone for FlatMap<K, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Eq + Debug, V: Debug> Debug for FlatMap<K, V>

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

Formats the value using the given formatter.

impl<K: Eq, V> Default for FlatMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K: Eq, V, I> From<I> for FlatMap<K, V>

where I: Iterator<Item = (K, V)>,

fn from(value: I) -> Self

Converts to this type from the input type.

impl<K: Eq, V> IntoIterator for FlatMap<K, V>

type Item = FlatMapEntry<K, V>

The type of the elements being iterated over.

type IntoIter = IntoIter<FlatMapEntry<K, V>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.