Struct ValueMapDiff 

pub struct ValueMapDiff<K, V> {
    pub clear: bool,
    pub del: HashSet<K>,
    pub set: HashMap<K, V>,
}

Fields

clear: bool

Whether the map should be emptied before applying the diff

del: HashSet<K>

Values to remove from the map

set: HashMap<K, V>

Values to add to the map

Trait Implementations

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for ValueMapDiff<K, V>

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

Formats the value using the given formatter.

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

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

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

where K: PartialEq + Eq + Hash, V: PartialEq,

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

where K: Serialize, V: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.