pub struct HnswGraph {
pub nodes: Vec<HnswNode>,
pub entry_point: Option<usize>,
pub max_layer: usize,
/* private fields */
}Expand description
The HNSW graph: a collection of nodes with hierarchical connectivity.
Fields§
§nodes: Vec<HnswNode>§entry_point: Option<usize>§max_layer: usizeImplementations§
Source§impl HnswGraph
impl HnswGraph
Sourcepub fn new(config: HnswConfig) -> Self
pub fn new(config: HnswConfig) -> Self
Create a new, empty HNSW graph with the given configuration.
Sourcepub fn insert(&mut self, id: usize, vector: Vec<f32>)
pub fn insert(&mut self, id: usize, vector: Vec<f32>)
Insert a vector with the given id into the graph.
Uses the seeded RNG for level assignment, guaranteeing reproducibility.
Sourcepub fn search(&self, query: &[f32], k: usize, ef: usize) -> Vec<(usize, f32)>
pub fn search(&self, query: &[f32], k: usize, ef: usize) -> Vec<(usize, f32)>
Search for the k nearest neighbours to query using the greedy beam search
with candidate list size ef.
Returns (id, distance) pairs sorted by ascending distance.
Sourcepub fn node_count(&self) -> usize
pub fn node_count(&self) -> usize
Total number of nodes in the graph.
Sourcepub fn layer_count(&self) -> usize
pub fn layer_count(&self) -> usize
Number of layers in the graph (= max_layer + 1).
Auto Trait Implementations§
impl Freeze for HnswGraph
impl RefUnwindSafe for HnswGraph
impl Send for HnswGraph
impl Sync for HnswGraph
impl Unpin for HnswGraph
impl UnsafeUnpin for HnswGraph
impl UnwindSafe for HnswGraph
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> 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.