Struct LinkPlan 

pub struct LinkPlan { /* private fields */ }

Write plan for a link op (create a typed directed edge). Endpoint existence is checked structurally, not via an unanchored plan-level guard: statement is a guarded INSERT ... SELECT ... WHERE EXISTS shape whose SELECT re-probes both endpoints inside the transaction, so the runner’s affected-row check on this one statement is the in-transaction existence probe (ADR-099 acceptance criteria’s dangling-edge case — [delete(X, hard), link(A, X)] — is closed by this guard failing once X is gone, regardless of statement ordering convention).

Implementations

impl LinkPlan

pub fn source_id(&self) -> Uuid

The canonical source endpoint used by the prepared statement.

pub fn target_id(&self) -> Uuid

The canonical target endpoint used by the prepared statement.

pub fn disposition(&self) -> EdgeUpsertDisposition

Whether this atomic link created, replaced, or explicitly resurrected its natural-key row.

Trait Implementations

impl Clone for LinkPlan

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 LinkPlan

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

Formats the value using the given formatter.