pub struct ParsedGraph {
pub params: HnswParams,
pub num_vectors: usize,
pub entry_point: Option<u32>,
pub max_level: usize,
pub vector_data_offset: usize,
pub quantized_offset: Option<usize>,
pub quantized_len: usize,
/* private fields */
}Expand description
Parsed graph structure (nodes + neighbors). This is the only part that needs heap allocation. Cached in SegmentReader.
Fields§
§params: HnswParams§num_vectors: usize§entry_point: Option<u32>§max_level: usize§vector_data_offset: usizeByte offset where vector data starts in the segment slice.
quantized_offset: Option<usize>Byte offset where quantized data starts (if present).
quantized_len: usizeLength of quantized data block.
Implementations§
Auto Trait Implementations§
impl Freeze for ParsedGraph
impl RefUnwindSafe for ParsedGraph
impl Send for ParsedGraph
impl Sync for ParsedGraph
impl Unpin for ParsedGraph
impl UnsafeUnpin for ParsedGraph
impl UnwindSafe for ParsedGraph
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> 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 more