Struct RemoveWins 

pub struct RemoveWins;

Remove-wins bias: concurrent remove beats add.

If replica A adds an element while replica B concurrently removes it, the element will be absent after merging. This provides a “conservative” semantic where removals are respected, useful for access revocation or cleanup operations that must take precedence.

Trait Implementations

impl Clone for RemoveWins

fn clone(&self) -> RemoveWins

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RemoveWins

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

Formats the value using the given formatter.

impl Default for RemoveWins

fn default() -> RemoveWins

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for RemoveWins

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for RemoveWins

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl SetBias for RemoveWins

fn resolve( local_has_dots: bool, remote_has_dots: bool, local_removed: bool, remote_removed: bool, ) -> bool

Resolve whether to keep an element based on concurrent operations.

impl Copy for RemoveWins