Struct jiter::LazyIndexMap

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

Like IndexMap but only builds the lookup map when it’s needed.

Implementations

impl<K, V> LazyIndexMap<K, V>

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

Like IndexMap but only builds the lookup map when it’s needed.

pub fn new() -> Self

pub fn insert(&mut self, key: K, value: V)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

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

pub fn keys(&self) -> impl Iterator<Item = &K>

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

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

Trait Implementations

impl<K: Clone, V: Clone> Clone for LazyIndexMap<K, V>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

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

Formats the value using the given formatter.

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

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

fn default() -> Self

Returns the “default value” for a type.

impl<K: PartialEq, V: PartialEq> PartialEq for LazyIndexMap<K, V>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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