Struct LinkPlan 

pub struct LinkPlan {
    pub source_id: Uuid,
    pub target_id: Uuid,
    pub statement: PlanStatement,
}

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).

Fields

source_id: Uuid

target_id: Uuid

statement: PlanStatement

The guarded INSERT ... SELECT ... WHERE EXISTS(...) statement: its affected-row count is the endpoint-existence probe.

Trait Implementations

impl Clone for LinkPlan

fn clone(&self) -> LinkPlan

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.