pub struct MemoryMappedVectorIndex { /* private fields */ }
Expand description
Memory-mapped vector index for large datasets
Implementations§
Source§impl MemoryMappedVectorIndex
impl MemoryMappedVectorIndex
Sourcepub fn new<P: AsRef<Path>>(path: P, config: IndexConfig) -> Result<Self>
pub fn new<P: AsRef<Path>>(path: P, config: IndexConfig) -> Result<Self>
Create a new memory-mapped vector index
Sourcepub fn load<P: AsRef<Path>>(path: P, config: IndexConfig) -> Result<Self>
pub fn load<P: AsRef<Path>>(path: P, config: IndexConfig) -> Result<Self>
Load an existing memory-mapped index
Sourcepub fn save_uri_mappings(&self) -> Result<()>
pub fn save_uri_mappings(&self) -> Result<()>
Save URI mappings to disk
Sourcepub fn stats(&self) -> MemoryMappedIndexStats
pub fn stats(&self) -> MemoryMappedIndexStats
Get index statistics
Sourcepub fn set_lazy_loading(&mut self, enabled: bool)
pub fn set_lazy_loading(&mut self, enabled: bool)
Enable or disable lazy loading
Sourcepub fn advanced_stats(&self) -> Option<MemoryMapStats>
pub fn advanced_stats(&self) -> Option<MemoryMapStats>
Get advanced memory mapping statistics
Sourcepub fn configure_numa(&mut self, numa_enabled: bool)
pub fn configure_numa(&mut self, numa_enabled: bool)
Configure NUMA allocation preferences
Trait Implementations§
Source§impl Drop for MemoryMappedVectorIndex
impl Drop for MemoryMappedVectorIndex
Source§impl VectorIndex for MemoryMappedVectorIndex
impl VectorIndex for MemoryMappedVectorIndex
Source§fn insert(&mut self, uri: String, vector: Vector) -> Result<()>
fn insert(&mut self, uri: String, vector: Vector) -> Result<()>
Insert a vector with associated URI
Source§fn search_knn(&self, query: &Vector, k: usize) -> Result<Vec<(String, f32)>>
fn search_knn(&self, query: &Vector, k: usize) -> Result<Vec<(String, f32)>>
Find k nearest neighbors
Source§fn search_threshold(
&self,
query: &Vector,
threshold: f32,
) -> Result<Vec<(String, f32)>>
fn search_threshold( &self, query: &Vector, threshold: f32, ) -> Result<Vec<(String, f32)>>
Find all vectors within threshold similarity
Source§fn add_vector(
&mut self,
id: VectorId,
vector: Vector,
_metadata: Option<HashMap<String, String>>,
) -> Result<()>
fn add_vector( &mut self, id: VectorId, vector: Vector, _metadata: Option<HashMap<String, String>>, ) -> Result<()>
Add a vector with associated ID and metadata
Source§fn update_vector(&mut self, id: VectorId, vector: Vector) -> Result<()>
fn update_vector(&mut self, id: VectorId, vector: Vector) -> Result<()>
Update an existing vector
Auto Trait Implementations§
impl Freeze for MemoryMappedVectorIndex
impl !RefUnwindSafe for MemoryMappedVectorIndex
impl Send for MemoryMappedVectorIndex
impl Sync for MemoryMappedVectorIndex
impl Unpin for MemoryMappedVectorIndex
impl !UnwindSafe for MemoryMappedVectorIndex
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.