Struct BruteForceStore 

pub struct BruteForceStore { /* private fields */ }

Pure‑Rust brute‑force vector store backed by MessagePack on disk. Enabled by the internal feature (on by default).

Implementations

impl BruteForceStore

pub fn open_or_create(folder: &Path) -> Result<BruteForceStore>

Open an existing store or create a new one with the default RRF ranker.

pub fn open_or_create_with_ranker( folder: &Path, ranker: Box<dyn Ranker>, ) -> Result<BruteForceStore>

Open an existing store or create a new one with a custom ranker.

pub fn save(&self) -> Result<()>

Serialise the current state to the on‑disk MessagePack file.

pub fn flush(&self) -> Result<()>

Persist in-memory changes to disk if the store is dirty.

No-op when nothing has changed since the last save or flush. Called automatically on Drop.

Trait Implementations

impl Clone for BruteForceStore

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BruteForceStore

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

Formats the value using the given formatter.

impl Drop for BruteForceStore

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl VectorStore for BruteForceStore

fn insert<'life0, 'async_trait>( &'life0 self, chunks: Vec<StoredChunk>, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Insert chunks along with their pre-computed embedding vectors.

fn search<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, query_vec: &'life1 [f32], query_text: &'life2 str, top_k: usize, threshold: f64, ) -> Pin<Box<dyn Future<Output = Result<Vec<ScoredChunk>>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Hybrid search: delegates to the store’s active ranker if supported, otherwise uses the backend’s built-in ranking.

fn delete_by_source<'life0, 'life1, 'async_trait>( &'life0 self, source: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Remove all chunks belonging to source_file.

fn len(&self) -> usize

Total number of stored chunks.

fn sources(&self) -> HashSet<SourceFile>

All unique source file names currently in the store.

fn set_ranker(&self, ranker: Box<dyn Ranker>) -> Result<()>

Replace the active ranking strategy.

fn ranker_name(&self) -> Option<String>

Return the name of the active ranker, if accessible.

fn validate_embedder(&self, meta: &EmbeddingMetadata) -> Result<()>

Validate that meta (from the current Embedder) is compatible with this store’s index.

fn flush(&self) -> Result<()>

Persist any buffered writes to stable storage.

fn manifest(&self) -> Option<IndexManifest>

Return the reproducibility manifest for this index, if available.

fn record_manifest(&self, manifest: IndexManifest) -> Result<()>

Record an IndexManifest for reproducibility.

fn is_empty(&self) -> bool

Returns true when the store contains no chunks.