Enum Change 

pub enum Change {
    NodeCreated {
        id: NodeId,
        labels: LabelSet,
        properties: PropertyMap,
    },
    NodeUpdated {
        id: NodeId,
        labels_diff: LabelDiff,
        properties_diff: PropertyDiff,
    },
    NodeDeleted {
        id: NodeId,
    },
    EdgeCreated {
        id: EdgeId,
        label: DbString,
        source: NodeId,
        target: NodeId,
        properties: PropertyMap,
    },
    EdgeUpdated {
        id: EdgeId,
        properties_diff: PropertyDiff,
    },
    EdgeDeleted {
        id: EdgeId,
    },
    SchemaChanged {
        graph: GraphId,
        change: SchemaChange,
    },
    NodePropertyRemoved {
        id: NodeId,
        property: DbString,
    },
    EdgePropertyRemoved {
        id: EdgeId,
        property: DbString,
    },
    NodeLabelRemoved {
        id: NodeId,
        label: DbString,
    },
    NodesOfTypeTruncated {
        label: DbString,
    },
    EdgesOfTypeTruncated {
        label: DbString,
    },
    GraphReset {},
}

A graph or schema change carried by the WAL.

Variants

NodeCreated

Node creation.

Fields

id: NodeId

Created node ID.

labels: LabelSet

Initial labels.

properties: PropertyMap

Initial properties.

NodeUpdated

Node update.

Fields

id: NodeId

Updated node ID.

labels_diff: LabelDiff

Label changes.

properties_diff: PropertyDiff

Property changes.

NodeDeleted

Node deletion.

Fields

id: NodeId

Deleted node ID.

EdgeCreated

Edge creation.

Fields

id: EdgeId

Created edge ID.

label: DbString

Edge label.

source: NodeId

Source node ID.

target: NodeId

Target node ID.

properties: PropertyMap

Initial properties.

EdgeUpdated

Edge update.

Fields

id: EdgeId

Updated edge ID.

properties_diff: PropertyDiff

Property changes.

EdgeDeleted

Edge deletion.

Fields

id: EdgeId

Deleted edge ID.

SchemaChanged

Schema mutation.

Fields

graph: GraphId

Graph affected by the schema change.

change: SchemaChange

Schema change payload.

NodePropertyRemoved

Node property removal.

Fields

id: NodeId

Updated node ID.

property: DbString

Removed property key.

EdgePropertyRemoved

Edge property removal.

Fields

id: EdgeId

Updated edge ID.

property: DbString

Removed property key.

NodeLabelRemoved

Node label removal.

Fields

id: NodeId

Updated node ID.

label: DbString

Removed label.

NodesOfTypeTruncated

Bulk removal of every node carrying label plus all incident edges.

This is the O(1)-WAL declarative truncate change (BRIEF-150, deletion- reclamation audit Item 11). It carries only the label — never the affected node/edge ids — so a TRUNCATE NODE TYPE :L of N nodes still writes exactly one WAL change. Recovery re-derives the affected rows by walking the recovered store (“replay walks store”), marking dead every alive node with label and every alive edge incident to such a node, so the recovered state is byte-identical to MATCH (n:L) DETACH DELETE n. Live commit fan-out substitutes the change with staged per-row NodeDeleted/EdgeDeleted tombstones when the mutator captured them during execution. WAL/recovery replay carries this persisted declarative variant, so provider-owned derived state must either handle it directly or rebuild from the recovered graph snapshot before serving reads.

Fields

label: DbString

Node label whose instances (and incident edges) were removed.

EdgesOfTypeTruncated

Bulk removal of every edge carrying label.

The edge-type counterpart to Change::NodesOfTypeTruncated (TRUNCATE EDGE TYPE :L). Carries only the label (O(1) WAL); recovery re-derives the affected edges from the recovered store. Live commit fan-out substitutes the change with staged per-row EdgeDeleted tombstones when execution captured them; WAL/recovery replay carries this persisted declarative variant, so providers must handle it directly or rebuild before serving reads.

Fields

label: DbString

Edge label whose instances were removed.

GraphReset

Factory-reset of the entire graph: wipe all nodes and edges (every label, including untyped/arbitrary-label rows) and reset the schema to open (bound_type -> None), in one declarative O(1)-WAL change.

This is the DROP GRAPH factory-reset change (BRIEF-152, deletion- reclamation audit Item 10). Under D1 single-graph it targets the one bound graph. It carries nothing — never the affected node/edge ids nor any schema payload — so a reset of a graph with N rows still writes exactly one WAL change. Recovery re-derives every affected row by walking the recovered store (“replay walks store”), marking dead every alive node and edge, and forces the recovered bound_type to None, so the recovered state is byte-identical to MATCH (n) DETACH DELETE n followed by a full schema drop. Live commit fan-out substitutes the change with staged per-row NodeDeleted/EdgeDeleted tombstones when execution captured them. WAL/recovery replay carries this persisted declarative variant, so providers must handle it directly or rebuild before serving reads. The MANIFEST epoch and WAL archive lineage are untouched: a factory-reset is one committed WAL entry on top of the existing snapshot, not a file-level wipe.

Implementations

impl Change

pub const fn kind(&self) -> ChangeKind

Return the compact kind discriminant for this change.

impl Change

pub const ALL: &[fn() -> Self]

Factory table with one sample change for each Change variant.

Tests use this as an append-only ANCHOR so new WAL variants require a source-of-truth census update in selene-core.

pub const VARIANT_COUNT: usize

Number of known Change variants in this build.

pub fn variant_name(&self) -> &'static str

Stable telemetry name for this change variant.

Trait Implementations

impl Clone for Change

fn clone(&self) -> Change

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Change

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Change

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Change

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

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 Change