Struct RelationshipCycle 

pub struct RelationshipCycle {
    pub members: Vec<String>,
    pub rel_type: String,
}

A cycle detected over the hierarchical relationship edges.

Only inverse-pair types (parent ↔ child, employer ↔ employee) participate: they describe a hierarchy, so a cycle is data that cannot be true — and it is what makes family-chart’s d3.hierarchy() allocate forever on a person page. Symmetric types (spouse, sibling) and plain directed types cycle legitimately and are ignored.

Fields

members: Vec<String>

Note URLs forming the cycle, in traversal order: each entry is the Self::rel_type of the entry before it, and the last closes back onto the first.

rel_type: String

The canonical relation type whose edges close the cycle (e.g. “child”).

Trait Implementations

impl Clone for RelationshipCycle

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RelationshipCycle

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for RelationshipCycle

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for RelationshipCycle

impl PartialEq for RelationshipCycle

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for RelationshipCycle

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 RelationshipCycle