Struct OptionMap 

pub struct OptionMap<K, V>(pub Option<(K, V)>);

A key-value entry wrapper around Option<(K, V)> representing a singleton or empty map.

Tuple Fields

0: Option<(K, V)>

Trait Implementations

impl<K, V> Clone for OptionMap<K, V>

where K: Clone, V: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> Collection for OptionMap<K, V>

type Item = V

Type of the items of the collection.

impl<K, V> CollectionMut for OptionMap<K, V>

type ItemMut<'a> = &'a mut <OptionMap<K, V> as Collection>::Item where OptionMap<K, V>: 'a

Type of mutable references to items of the collection.

fn upcast_item_mut<'short, 'long>( r: <OptionMap<K, V> as CollectionMut>::ItemMut<'long>, ) -> <OptionMap<K, V> as CollectionMut>::ItemMut<'short>

where 'long: 'short, OptionMap<K, V>: 'long,

Changes an item mutable reference into a shorter lived mutable reference.

impl<K, V> CollectionRef for OptionMap<K, V>

type ItemRef<'a> = &'a <OptionMap<K, V> as Collection>::Item where OptionMap<K, V>: 'a

Type of references to items of the collection.

fn upcast_item_ref<'short, 'long>( r: <OptionMap<K, V> as CollectionRef>::ItemRef<'long>, ) -> <OptionMap<K, V> as CollectionRef>::ItemRef<'short>

where 'long: 'short, OptionMap<K, V>: 'long,

Changes an item reference into a shorter lived reference.

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

where K: Debug, V: Debug,

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

Formats the value using the given formatter.

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

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

Returns the “default value” for a type.

impl<'de, K, V> Deserialize<'de> for OptionMap<K, V>

where K: Deserialize<'de>, V: Deserialize<'de>,

fn deserialize<__D>( __deserializer: __D, ) -> Result<OptionMap<K, V>, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K, V, U> From<U> for OptionMap<K, V>

where U: Into<Option<(K, V)>>,

fn from(kv: U) -> OptionMap<K, V>

Converts to this type from the input type.

impl<'a, Q, K, V> Get<&'a Q> for OptionMap<K, V>

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

fn get( &self, key: &'a Q, ) -> Option<<OptionMap<K, V> as CollectionRef>::ItemRef<'_>>

Returns a reference to the item stored behind the given key (if any).

fn contains(&self, key: T) -> bool

Checks if the collection contains an item behind the given key.

impl<'a, Q, K, V> GetKeyValue<&'a Q> for OptionMap<K, V>

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

fn get_key_value( &self, key: &'a Q, ) -> Option<(<OptionMap<K, V> as KeyedRef>::KeyRef<'_>, <OptionMap<K, V> as CollectionRef>::ItemRef<'_>)>

Returns the key-value pair matching the given key.

impl<'a, Q, K, V> GetKeyValueMut<&'a Q> for OptionMap<K, V>

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

fn get_key_value_mut( &mut self, key: &'a Q, ) -> Option<(<OptionMap<K, V> as KeyedRef>::KeyRef<'_>, <OptionMap<K, V> as CollectionMut>::ItemMut<'_>)>

Returns the key-value pair matching the given key, with a mutable reference to the value.

impl<'a, Q, K, V> GetMut<&'a Q> for OptionMap<K, V>

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

fn get_mut( &mut self, key: &'a Q, ) -> Option<<OptionMap<K, V> as CollectionMut>::ItemMut<'_>>

Returns a mutable reference to the item stored behind the given key (if any).

impl<K, V> Hash for OptionMap<K, V>

where K: Hash, V: Hash,

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<K, V> IntoIterator for OptionMap<K, V>

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) -> <OptionMap<K, V> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<K, V> Iter for OptionMap<K, V>

type Iter<'a> = IntoIter<&'a V> where OptionMap<K, V>: 'a

Iterator type.

fn iter(&self) -> <OptionMap<K, V> as Iter>::Iter<'_>

Create an iterator over the items of the collection.

impl<K, V> Keyed for OptionMap<K, V>

type Key = K

Type of the keys indexing each item of the collection.

impl<K, V> KeyedRef for OptionMap<K, V>

type KeyRef<'a> = &'a <OptionMap<K, V> as Keyed>::Key where OptionMap<K, V>: 'a

Type of references to keys of the collection.

fn upcast_key_ref<'short, 'long>( r: <OptionMap<K, V> as KeyedRef>::KeyRef<'long>, ) -> <OptionMap<K, V> as KeyedRef>::KeyRef<'short>

where 'long: 'short, OptionMap<K, V>: 'long,

Changes a key reference into a shorter lived reference.

impl<K, V> Len for OptionMap<K, V>

fn len(&self) -> usize

Returns the number of elements in the collection.

fn is_empty(&self) -> bool

Checks if the collection is empty.

impl<K, V> MapIter for OptionMap<K, V>

type Iter<'a> = IntoIter<(&'a K, &'a V)> where OptionMap<K, V>: 'a

fn iter(&self) -> <OptionMap<K, V> as MapIter>::Iter<'_>

impl<K, V> MapIterMut for OptionMap<K, V>

type IterMut<'a> = IntoIter<(&'a K, &'a mut V)> where OptionMap<K, V>: 'a

fn iter_mut(&mut self) -> <OptionMap<K, V> as MapIterMut>::IterMut<'_>

impl<K, OldVal> MapMapValues<OldVal> for OptionMap<K, OldVal>

type MapValue<NewVal> = OptionMap<K, NewVal>

Output type, should be Self but with OldVal replaced with NewVal.

fn map_values<NewVal, MapFn>( self, map_fn: MapFn, ) -> <OptionMap<K, OldVal> as MapMapValues<OldVal>>::MapValue<NewVal>

where MapFn: FnMut(OldVal) -> NewVal,

Map the values into using the map_fn.

impl<K, V> Ord for OptionMap<K, V>

where K: Ord, V: Ord,

fn cmp(&self, other: &OptionMap<K, V>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<K, V> PartialEq for OptionMap<K, V>

where K: PartialEq, V: PartialEq,

fn eq(&self, other: &OptionMap<K, V>) -> 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> PartialOrd for OptionMap<K, V>

where K: PartialOrd, V: PartialOrd,

fn partial_cmp(&self, other: &OptionMap<K, V>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<K, V> Serialize for OptionMap<K, V>

where K: Serialize, V: Serialize,

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<K, V> SimpleCollectionRef for OptionMap<K, V>

fn into_ref<'r>( r: <OptionMap<K, V> as CollectionRef>::ItemRef<'r>, ) -> &'r <OptionMap<K, V> as Collection>::Item

where OptionMap<K, V>: 'r,

impl<K, V> SimpleKeyedRef for OptionMap<K, V>

fn into_ref<'r>( r: <OptionMap<K, V> as KeyedRef>::KeyRef<'r>, ) -> &'r <OptionMap<K, V> as Keyed>::Key

where OptionMap<K, V>: 'r,

impl<K, V> Copy for OptionMap<K, V>

where K: Copy, V: Copy,

impl<K, V> Eq for OptionMap<K, V>

where K: Eq, V: Eq,

impl<K, V> StructuralPartialEq for OptionMap<K, V>