Struct NonEmptyIndexMap 

pub struct NonEmptyIndexMap<K, V, S = RandomState> { /* private fields */ }

A wrapper around ::indexmap::IndexMap that is guaranteed to have at least one element by the Rust’s type system: it consists of a first element and an indexed map (which could be empty) rest elements.

Implementations

impl<K, V> NonEmptyIndexMap<K, V, RandomState>

pub fn new(key: K, value: V) -> Self

Creates a map with a default hasher.

pub fn with_capacity(key: K, value: V, capacity: usize) -> Self

Creates a map with a given capacity.

pub fn from_item_and_iterator( key: K, value: V, i: impl IntoIterator<Item = (K, V)>, ) -> Self

where K: Hash + Eq,

Creates a map from an item (a key and a value pair) standart hash map.

pub fn from_iterator(i: impl IntoIterator<Item = (K, V)>) -> Result<Self, Error>

where K: Hash + Eq,

Creates a map from a given iterator with a default hasher.

impl<K, V, S> NonEmptyIndexMap<K, V, S>

where K: Eq + Hash, S: BuildHasher,

pub fn with_hasher(key: K, value: V, hash_builder: S) -> Self

Creates a map with a given hasher.

pub fn with_capacity_and_hasher( key: K, value: V, capacity: usize, hash_builder: S, ) -> Self

Creates a map with a given capacity and a given hasher.

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

Iterates over key-value pairs of the map in an immutable way.

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

Iterates over key-value pairs of the map in a mutable way.

pub fn from_iter_with_hasher( i: impl IntoIterator<Item = (K, V)>, hasher: S, ) -> Result<Self, Error>

Creates a map from a given iterator with a given hasher.

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

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

Gets a value associated with a given key, if any.

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

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

Checks whether a given key exists in the map.

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

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

Gets a value associated with a given key, if any.

pub fn remove_entry<Q>(&mut self, key: &Q) -> Result<Option<(K, V)>, Error>

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

Removes and returns an element associated with a given key, if any.

An attempt to remove the last element will cause an Error to be returned.

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

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

Removes and element associated with a given key and return its value, if any.

An attempt to remove the last element will cause an Error to be returned.

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

Inserts a key-value pair into the map. If the map have already had an element associated with a given key, the associated value is updated and the old one is returned.

pub fn len(&self) -> usize

Returns the number of elements in the map.

pub fn is_empty(&self) -> bool

Checks whether or not the map is empty.

As one would expect it always evaluates to false :)

assert!(!NonEmptyIndexMap::new("key", "value").is_empty());

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

Returns an entry that corresponds to a given key.

pub fn get_first(&self) -> (&K, &V)

Gets an immutable reference to the firs element (only the value).

pub fn get_first_mut(&mut self) -> (&mut K, &mut V)

Gets a mutable reference to the firs element (only the value).

pub fn get_rest(&self) -> &IndexMap<K, V, S>

Gets an immutable reference to the rest indexed map of elements.

pub fn get_rest_mut(&mut self) -> &mut IndexMap<K, V, S>

Gets a mutable reference to the rest indexed map of elements.

pub fn remove_first(&mut self) -> Result<(), Error>

Attempts to remove the first element. Will fail if it is the only one element in the map.

pub fn retain<F>(&mut self, keep: F) -> Result<(), Error>

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

Scans the collection and keeps only the items on which the provided keep function returns true. Will fail if in the end only one element will remain.

Trait Implementations

impl<K: Clone, V: Clone, S: Clone> Clone for NonEmptyIndexMap<K, V, S>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V, S> Debug for NonEmptyIndexMap<K, V, S>

where K: Eq + Hash + Debug, V: Debug, S: BuildHasher,

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

Formats the value using the given formatter.

impl<'de, K, V, S> Deserialize<'de> for NonEmptyIndexMap<K, V, S>

where K: Deserialize<'de> + Eq + Hash, V: Deserialize<'de>, S: BuildHasher + Default,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K, V, S> Extend<(K, V)> for NonEmptyIndexMap<K, V, S>

where K: Eq + Hash, S: BuildHasher,

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

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

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.

impl<K: Eq + Hash, V, S: BuildHasher> Into<IndexMap<K, V, S>> for NonEmptyIndexMap<K, V, S>

fn into(self) -> IndexMap<K, V, S>

Converts this type into the (usually inferred) input type.

impl<K, V, S> IntoIterator for NonEmptyIndexMap<K, V, S>

where K: Eq + Hash, S: BuildHasher,

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K, V, S1, S2> PartialEq<NonEmptyIndexMap<K, V, S1>> for NonEmptyIndexMap<K, V, S2>

where K: Hash + Eq, V: Eq, S1: BuildHasher, S2: BuildHasher,

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<K, V, H> Serialize for NonEmptyIndexMap<K, V, H>

where K: Serialize + Eq + Hash, V: Serialize, H: BuildHasher,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<K, V, S> Eq for NonEmptyIndexMap<K, V, S>

where K: Hash + Eq, V: Eq, S: BuildHasher,