pub enum MapChange<K, V> {
Insert {
key: K,
value: V,
source: Option<Uuid>,
},
Update {
key: K,
old_value: Option<V>,
new_value: V,
source: Option<Uuid>,
},
Remove {
key: K,
old_value: Option<V>,
source: Option<Uuid>,
},
Clear {
source: Option<Uuid>,
},
}Variants§
Insert
Update
Fields
§
key: K§
old_value: Option<V>What was there before. Bytes that will not read as V fall back to
what the map last held, so a key it knows always carries one.
§
new_value: VRemove
Clear
Implementations§
Trait Implementations§
impl<K: PartialEq, V: PartialEq> StructuralPartialEq for MapChange<K, V>
Auto Trait Implementations§
impl<K, V> Freeze for MapChange<K, V>
impl<K, V> RefUnwindSafe for MapChange<K, V>
impl<K, V> Send for MapChange<K, V>
impl<K, V> Sync for MapChange<K, V>
impl<K, V> Unpin for MapChange<K, V>
impl<K, V> UnsafeUnpin for MapChange<K, V>
impl<K, V> UnwindSafe for MapChange<K, V>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more