Enum GraphConstraint 

pub enum GraphConstraint {
    NodePropertyUnique {
        label: Label,
        key: String,
    },
    NodePropertyRequired {
        label: Label,
        key: String,
    },
    EdgePropertyUnique {
        label: Label,
        key: String,
    },
    EdgePropertyRequired {
        label: Label,
        key: String,
    },
}

Variants

NodePropertyUnique

Fields

label: Label

key: String

NodePropertyRequired

Fields

label: Label

key: String

EdgePropertyUnique

Fields

label: Label

key: String

EdgePropertyRequired

Fields

label: Label

key: String

Implementations

impl GraphConstraint

pub fn label(&self) -> &Label

pub fn key(&self) -> &str

Trait Implementations

impl Clone for GraphConstraint

fn clone(&self) -> GraphConstraint

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphConstraint

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphConstraint

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for GraphConstraint

impl PartialEq for GraphConstraint

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for GraphConstraint