Enum EntryData

pub enum EntryData<K, V> {
    Insert {
        key: K,
        value: V,
    },
    Remove(K),
}

The data of the Entry.

Variants

Insert

Insert the key and the value.

Fields

key: K

key of the entry.

value: V

value of the entry.

Remove(K)

Remove the key.

Implementations

impl<K, V> EntryData<K, V>

pub const fn key(&self) -> &K

Returns the key of the entry.

pub const fn value(&self) -> Option<&V>

Returns the value of the entry, if None, it means the entry is marked as remove.

Trait Implementations

impl<K, V> CheapClone for EntryData<K, V>

where K: CheapClone, V: CheapClone,

fn cheap_clone(&self) -> EntryData<K, V>

Returns a copy of the value.

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

where K: Clone, V: Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for EntryData<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> Hash for EntryData<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> Ord for EntryData<K, V>

where K: Ord, V: Eq,

fn cmp(&self, other: &EntryData<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 EntryData<K, V>

where K: PartialEq, V: PartialEq,

fn eq(&self, other: &EntryData<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 EntryData<K, V>

where K: Ord, V: Eq,

fn partial_cmp(&self, other: &EntryData<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> Eq for EntryData<K, V>

where K: Eq, V: Eq,

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