Struct HnswNodeCell 

pub struct HnswNodeCell {
    pub node_id: i64,
    pub layers: Vec<Vec<i64>>,
}

One HNSW node’s persisted form. layers[i] is the list of neighbor node_ids at layer i; the node lives at every layer 0..=layers.len()-1.

Fields

node_id: i64

layers: Vec<Vec<i64>>

layers[0] is the densest layer (always present); layers.len() equals the node’s max_layer + 1.

Implementations

impl HnswNodeCell

pub fn new(node_id: i64, layers: Vec<Vec<i64>>) -> Self

pub fn encode(&self) -> Result<Vec<u8>>

Encodes the cell into a freshly-allocated Vec<u8>. The result starts with the shared cell_length | kind_tag prefix and is directly usable as a slot-directory entry on a TableLeaf-style page.

pub fn decode(buf: &[u8], pos: usize) -> Result<(HnswNodeCell, usize)>

Decodes one cell starting at pos. Returns the cell plus the total bytes consumed (including the leading length varint).

Trait Implementations

impl Clone for HnswNodeCell

fn clone(&self) -> HnswNodeCell

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HnswNodeCell

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

Formats the value using the given formatter.

impl PartialEq for HnswNodeCell

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