Struct NeighborStorage 

pub struct NeighborStorage { /* private fields */ }

Contiguous neighbor list storage for graph traversal

Implementations

impl NeighborStorage

pub fn new(node_count: usize, max_edges: usize) -> Option<Self>

Create new storage

pub fn get_neighbors(&self, node: usize) -> Option<&[u32]>

Get neighbor list for node

pub fn add_neighbor(&self, node: usize, neighbor: u32) -> bool

Add neighbor to node (thread-safe)

pub fn set_neighbors(&mut self, node: usize, neighbors: &[u32]) -> bool

Set all neighbors for a node (replaces existing)

pub fn prefetch(&self, node: usize)

Prefetch neighbor list for upcoming traversal

pub fn prefetch_neighbors(&self, embeddings: &EmbeddingStorage, node: usize)

Prefetch neighbors of neighbors (two-hop prefetch)

pub fn edge_count(&self, node: usize) -> usize

Get edge count for node

pub fn max_edges(&self) -> usize

Get max edges per node

pub fn node_count(&self) -> usize

Get node count

Trait Implementations

impl Drop for NeighborStorage

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl Send for NeighborStorage

impl Sync for NeighborStorage