Struct ProgressiveSearch 

pub struct ProgressiveSearch { /* private fields */ }

Three-tier progressive search index.

See the module-level documentation for tier descriptions.

Implementations

impl ProgressiveSearch

pub fn new() -> Self

Create a new, empty index.

pub fn insert(&mut self, id: &str, embedding: Vec<f32>, metadata: Value)

Insert an entry into the index.

pub fn search(&self, query: &[f32], k: usize) -> Vec<SearchResult>

Search for the k nearest entries to query.

Returns results sorted by descending cosine similarity.

Stub behaviour

The current implementation performs brute-force cosine similarity over all entries. This will be replaced by a real HNSW graph when rvf-index is available.

pub fn len(&self) -> usize

Return the number of entries in the index.

pub fn is_empty(&self) -> bool

Return true when the index contains no entries.

pub fn save(&self, path: &Path) -> Result<()>

Persist the index to path as JSON.

pub fn load(path: &Path) -> Result<Self>

Load a previously saved index from path.

Trait Implementations

impl Clone for ProgressiveSearch

fn clone(&self) -> ProgressiveSearch

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ProgressiveSearch

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for ProgressiveSearch

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for ProgressiveSearch

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for ProgressiveSearch

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.