Struct PostgresSearchStore 

pub struct PostgresSearchStore { /* private fields */ }

Postgres-backed search storage.

Implements both SearchBackend (the index) and DocumentSource (reading records back out of their own tables), because both need the same connection pool and the same identifier-safety rules. SearchPlugin::postgres() installs one instance as both.

The pool is installed at startup (PostgresSearchStore::install_pool), so the store can be constructed by the plugin builder before an AppState exists.

Implementations

impl PostgresSearchStore

pub fn new(dimensions: Option<usize>) -> Self

Create a store whose pool is installed later.

pub fn install_pool(&self, pool: Pool<RuntimeConnection>)

Install the application’s connection pool. Idempotent; the first call wins.

pub fn vector_mode(&self) -> Option<VectorMode>

The resolved vector storage mode, once ensure_index has run.

pub fn vector_column_width(&self) -> Option<usize>

Declared width of the physical embedding_vec column, if it exists.

Independent of Self::vector_mode: the column can outlive the mode that created it.

Trait Implementations

impl Debug for PostgresSearchStore

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

Formats the value using the given formatter.

impl DocumentSource for PostgresSearchStore

fn fetch<'a>( &'a self, definition: &'a IndexDefinition, ids: &'a [i64], ) -> BoxFuture<'a, SearchResult<Vec<SearchDocument>>>

Fetch the documents for ids.

fn scan<'a>( &'a self, definition: &'a IndexDefinition, after: Option<i64>, limit: usize, ) -> BoxFuture<'a, SearchResult<Vec<SearchDocument>>>

Return up to limit documents whose id is greater than after, ordered by ascending id.

impl SearchBackend for PostgresSearchStore

fn name(&self) -> &'static str

Stable backend name, used in errors and logs.

fn capabilities(&self) -> BackendCapabilities

What this backend supports.

fn write_watermark(&self) -> BoxFuture<'_, SearchResult<Option<String>>>

A marker for “now” on the backend’s own clock, for index_unless_newer.

fn index_unless_newer<'a>( &'a self, definition: &'a IndexDefinition, documents: &'a [IndexedDocument], watermark: Option<&'a str>, ) -> BoxFuture<'a, SearchResult<()>>

Index documents, but do not overwrite a document that has been written since watermark.

fn ensure_index<'a>( &'a self, definition: &'a IndexDefinition, ) -> BoxFuture<'a, SearchResult<()>>

Create or migrate the storage for definition. Must be idempotent — it runs on every boot — and must reject a definition that fails IndexDefinition::validate.

fn index<'a>( &'a self, definition: &'a IndexDefinition, documents: &'a [IndexedDocument], ) -> BoxFuture<'a, SearchResult<()>>

Upsert documents, keyed by (index, id). Must be idempotent: the reindex job delivers at least once.

fn delete<'a>( &'a self, definition: &'a IndexDefinition, ids: &'a [i64], ) -> BoxFuture<'a, SearchResult<()>>

Remove documents by record id. Removing an absent id is a no-op, not an error — deletes are replayed.

fn clear<'a>( &'a self, definition: &'a IndexDefinition, ) -> BoxFuture<'a, SearchResult<()>>

Remove every document in the index.

fn keyword_search<'a>( &'a self, definition: &'a IndexDefinition, query: &'a KeywordQuery, ) -> BoxFuture<'a, SearchResult<Page<SearchHit>>>

Ranked, paginated keyword search. See KeywordQuery for the query semantics every backend must implement.

fn vector_search<'a>( &'a self, definition: &'a IndexDefinition, query: &'a VectorQuery, ) -> BoxFuture<'a, SearchResult<Vec<SearchHit>>>

k-NN search over the embedded field.

fn embedding<'a>( &'a self, definition: &'a IndexDefinition, id: i64, filter: &'a SearchFilter, ) -> BoxFuture<'a, SearchResult<Option<Vec<f32>>>>

Read back the stored embedding for one record, so “find records like this one” needs no re-embedding.