Struct CaughtNode 

pub struct CaughtNode {
    pub row: OwnedRow,
    pub relationships: BTreeMap<RelId, Vec<CaughtNode>>,
}

A fully-materialized node: the row cells plus eagerly drained relationships. The comparison unit for a fetch/push assertion, and the owned node a Graph::add_change_sink consumer receives.

Relationships are keyed by their resolved RelId slot in a BTreeMap, so the diff is slot-stable regardless of insertion order; the child Vec within a relationship preserves the operator’s sort order (the order is part of the contract — never re-sort it, 11 §3.8).

Fields

row: OwnedRow

relationships: BTreeMap<RelId, Vec<CaughtNode>>

Trait Implementations

impl Clone for CaughtNode

fn clone(&self) -> CaughtNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CaughtNode

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

Formats the value using the given formatter.

impl PartialEq for CaughtNode

fn eq(&self, o: &Self) -> 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 Eq for CaughtNode