pub struct AddWins;Expand description
Add-wins bias: concurrent add beats remove.
This is the default and most common choice for collaborative applications. If replica A adds an element while replica B concurrently removes it, the element will be present after merging. This provides an “optimistic” or “available” semantic where data tends to be preserved.
Trait Implementations§
Source§impl<'de> Deserialize<'de> for AddWins
impl<'de> Deserialize<'de> for AddWins
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Copy for AddWins
Auto Trait Implementations§
impl Freeze for AddWins
impl RefUnwindSafe for AddWins
impl Send for AddWins
impl Sync for AddWins
impl Unpin for AddWins
impl UnwindSafe for AddWins
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