Struct OverlayState 

pub struct OverlayState { /* private fields */ }

Mutable overlay state for sync replay and query freshness.

All collections are private so the by_source/by_target adjacency indexes cannot desync from added_edges: callers mutate exclusively through push_edge, remove_edge, tombstone_edge, tombstone_node, clear, and the from_edges constructor, each of which keeps the indexes consistent.

Implementations

impl OverlayState

pub fn from_edges(edges: impl IntoIterator<Item = OverlayEdge>) -> Self

Builds an overlay from a sequence of inserted edges, with the adjacency indexes constructed once up front.

Performance

This function is O(a log a) for a edges.

pub fn added_edges(&self) -> &[OverlayEdge]

Returns the inserted overlay edges in insertion order.

Performance

This method is O(1).

pub const fn overlay_edge_count(&self) -> usize

Returns the number of inserted overlay edges.

Performance

This method is O(1).

pub fn tombstoned_edge_count(&self) -> usize

Returns the number of tombstoned base edges.

Performance

This method is O(1).

pub fn tombstoned_node_count(&self) -> usize

Returns the number of tombstoned nodes.

Performance

This method is O(1).

pub fn tombstone_edge(&mut self, edge_id: u32)

Records a base edge tombstone.

Performance

This method is O(log t) for t tombstoned edge ids.

pub fn tombstone_node(&mut self, node_id: u32)

Records a node tombstone.

Performance

This method is O(log t) for t tombstoned node ids.

pub fn clear(&mut self)

Clears all overlay buffers and adjacency indexes.

pub fn has_edge_tombstones(&self) -> bool

Returns whether any base edge tombstones are recorded.

pub fn has_node_tombstones(&self) -> bool

Returns whether any node tombstones are recorded.

pub fn edge_visible(&self, edge_id: u32) -> bool

Returns whether an edge id is visible to traversal.

Performance

This method is O(log t) for t tombstoned edge ids.

pub fn node_visible(&self, node_id: u32) -> bool

Returns whether a node id is visible to traversal.

Performance

This method is O(log t) for t tombstoned node ids.

pub fn push_edge(&mut self, edge: OverlayEdge)

Records an overlay edge and updates adjacency indexes.

Performance

This method is O(log s + log t) for index map sizes s and t.

pub fn overlay_targets(&self, source: u32) -> &[u32]

Returns overlay outgoing targets for source (empty when none).

Performance

This method is O(log s) for s indexed sources.

pub fn overlay_sources(&self, target: u32) -> &[u32]

Returns overlay incoming sources for target (empty when none).

Performance

This method is O(log t) for t indexed targets.

pub fn remove_edge(&mut self, source: u32, target: u32)

Removes one overlay edge and rebuilds adjacency indexes.

Performance

This method is O(a) for a overlay edges.

Trait Implementations

impl Clone for OverlayState

fn clone(&self) -> OverlayState

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OverlayState

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

Formats the value using the given formatter.

impl Default for OverlayState

fn default() -> OverlayState

Returns the “default value” for a type.

impl Eq for OverlayState

impl PartialEq for OverlayState

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