pub struct Node {
pub vector: Vector,
pub uri: String,
pub connections: Vec<HashSet<usize>>,
pub vector_data_f32: Vec<f32>,
pub access_count: u64,
pub metadata: HashMap<String, String>,
}Expand description
Node in the HNSW graph with cache-friendly layout
Fields§
§vector: VectorVector data (stored first for cache efficiency)
uri: StringURI identifier
connections: Vec<HashSet<usize>>Connections for each layer (layer -> set of connected node IDs)
vector_data_f32: Vec<f32>Cache-friendly vector data for SIMD operations
access_count: u64Node access frequency (for cache optimization)
metadata: HashMap<String, String>Metadata for filtered search
Implementations§
Source§impl Node
impl Node
pub fn new(uri: String, vector: Vector, max_level: usize) -> Self
Sourcepub fn with_metadata(
uri: String,
vector: Vector,
max_level: usize,
metadata: HashMap<String, String>,
) -> Self
pub fn with_metadata( uri: String, vector: Vector, max_level: usize, metadata: HashMap<String, String>, ) -> Self
Create a new node with metadata
Sourcepub fn record_access(&mut self)
pub fn record_access(&mut self)
Increment access count for cache optimization
Sourcepub fn get_connections(&self, level: usize) -> Option<&HashSet<usize>>
pub fn get_connections(&self, level: usize) -> Option<&HashSet<usize>>
Get connections at a specific level
Sourcepub fn get_connections_mut(
&mut self,
level: usize,
) -> Option<&mut HashSet<usize>>
pub fn get_connections_mut( &mut self, level: usize, ) -> Option<&mut HashSet<usize>>
Get mutable connections at a specific level
Sourcepub fn add_connection(&mut self, level: usize, node_id: usize)
pub fn add_connection(&mut self, level: usize, node_id: usize)
Add a connection at a specific level
Sourcepub fn remove_connection(&mut self, level: usize, node_id: usize)
pub fn remove_connection(&mut self, level: usize, node_id: usize)
Remove a connection at a specific level
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 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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.