Enum CloseKind 

pub enum CloseKind {
    Transitive,
    Symmetric,
    Reflexive,
    Equivalence,
    Scc,
}

Which closure a CLOSE statement applies to a relation. Each is a compile-time graph operation over the relation’s FACT pairs (no solver cost); only Transitive rejects a cycle (it requires a DAG) — the others either expect or produce self/back pairs by design.

Variants

Transitive

TRANSITIVE — add a→c whenever a→b and b→c hold (requires a DAG).

Symmetric

SYMMETRIC — add b→a whenever a→b holds (a two-way relation).

Reflexive

REFLEXIVE — add x→x for every node the relation mentions.

Equivalence

EQUIVALENCE — reflexive + symmetric + transitive closure: groups nodes into classes (a→b iff they are connected ignoring direction).

Scc

SCC — strongly-connected grouping: a→b iff a and b reach each other (mutual reachability), plus each node to itself. Isolates directed cycles.

Trait Implementations

impl Clone for CloseKind

fn clone(&self) -> CloseKind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for CloseKind

impl Debug for CloseKind

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

Formats the value using the given formatter.

impl Eq for CloseKind

impl PartialEq for CloseKind

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