Struct GraphTableIndex 

pub struct GraphTableIndex { /* private fields */ }

Bidirectional index for graph-table linkage

Enables efficient lookups in both directions:

• From graph node to table row
• From table row to graph node

Thread-safe with sharded locking for concurrent access.

Implementations

impl GraphTableIndex

pub fn new() -> Self

Create a new empty index

pub fn link(&self, node_id: &str, table_id: u16, row_id: u64)

Link a graph node to a table row

Creates bidirectional mapping between node_id and (table_id, row_id). Overwrites existing mappings if present.

pub fn unlink_node(&self, node_id: &str) -> Option<TableRef>

Unlink a graph node from its table row

Removes both directions of the mapping. Returns the TableRef if it existed.

pub fn unlink_row(&self, table_id: u16, row_id: u64) -> Option<String>

Unlink a table row from its graph node

Removes both directions of the mapping. Returns the node_id if it existed.

pub fn get_row_for_node(&self, node_id: &str) -> Option<TableRef>

Get the table row for a graph node

pub fn get_node_for_row(&self, table_id: u16, row_id: u64) -> Option<String>

Get the graph node for a table row

pub fn is_node_linked(&self, node_id: &str) -> bool

Check if a node is linked to a table row

pub fn is_row_linked(&self, table_id: u16, row_id: u64) -> bool

Check if a table row is linked to a graph node

pub fn nodes_for_table(&self, table_id: u16) -> Vec<(u64, String)>

Get all nodes linked to a specific table

Returns pairs of (row_id, node_id) for the given table.

pub fn stats(&self) -> GraphTableIndexStats

Get statistics about the index

pub fn clear(&self)

Clear all mappings

pub fn serialize(&self) -> Vec<u8>

Serialize to bytes for persistence

pub fn deserialize(data: &[u8]) -> Result<Self, GraphTableIndexError>

Deserialize from bytes

Trait Implementations

impl Default for GraphTableIndex

fn default() -> Self

Returns the “default value” for a type.