Enum GraphStrategy 

pub enum GraphStrategy {
    AddWins,
    RemoveWins,
}

Strategy for handling graph conflicts

Variants

AddWins

Add-Wins: Vertices and edges are never removed, only marked as deleted

RemoveWins

Remove-Wins: Deleted vertices and edges are completely removed

Trait Implementations

impl Clone for GraphStrategy

fn clone(&self) -> GraphStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphStrategy

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphStrategy

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for GraphStrategy

fn eq(&self, other: &GraphStrategy) -> 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 Serialize for GraphStrategy

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for GraphStrategy

impl StructuralPartialEq for GraphStrategy