Struct Node 

pub struct Node {
    pub node_id: String,
    pub node_type: String,
    pub subtype: Option<String>,
    pub label: String,
    pub properties: BTreeMap<String, Value>,
    pub property_clocks: HashMap<String, LamportClock>,
    pub last_clock: LamportClock,
    pub last_add_clock: LamportClock,
    pub tombstoned: bool,
}

A materialized node in the graph.

Fields

node_id: String

node_type: String

subtype: Option<String>

label: String

properties: BTreeMap<String, Value>

property_clocks: HashMap<String, LamportClock>

Per-property clocks for LWW conflict resolution. Each property key tracks the clock of its last write, so concurrent updates to different properties don’t conflict.

last_clock: LamportClock

Clock of the entry that last modified this node. Used for add-wins semantics and label LWW.

last_add_clock: LamportClock

Clock of the most recent AddNode for this node. Used for add-wins semantics: remove only wins if its clock is strictly greater than last_add_clock.

tombstoned: bool

Whether this node has been tombstoned (removed).

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl PartialEq for Node

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