pub struct Node {
pub layers: Vec<Vec<i64>>,
}Expand description
Per-node metadata: a list of neighbor IDs for each layer this node
lives in. layers[0] is layer 0 (densest); layers[layers.len() - 1]
is the highest layer this node reaches.
Fields§
§layers: Vec<Vec<i64>>Indexed by layer (0 = dense). layers[i] is the neighbor list
for this node at layer i. Always sorted-by-distance is not a
guaranteed invariant — pruning maintains it after each
modification, but during insert we may briefly hold an
unsorted set.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Node
impl RefUnwindSafe for Node
impl Send for Node
impl Sync for Node
impl Unpin for Node
impl UnsafeUnpin for Node
impl UnwindSafe for Node
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more