Struct PgVectorIndex 

pub struct PgVectorIndex { /* private fields */ }

PostgreSQL vector index backed by the pgvector extension.

All operations are async over a shared PgPool (MVCC, connection-pooled). The relation named table holds (id BIGINT PK, vec vector(N)) rows.

Implementations

impl PgVectorIndex

pub async fn new(url: &str, table: &str, dim: usize) -> Result<Self>

Connect to url (libpq connstring / postgresql://…), create the vector table + HNSW cosine index if missing, and return a ready index.

dim is enforced by the fixed vector(dim) column; vectors whose length differs from dim are rejected by pgvector on insert.

pub fn pool(&self) -> &PgPool

Underlying connection pool.

Callers that need cross-table transactional consistency — e.g. pruning a law’s chunks plus their vectors atomically in one transaction — can pool().begin() and run their own DML on the same pool the index uses. This preserves the table-name encapsulation while letting the caller coordinate a multi-statement transaction.

pub async fn remove_in_tx( &self, tx: &mut PgConnection, ids: &[u64], ) -> Result<()>

Remove vectors by external IDs within a caller-provided transaction.

Enables atomic cross-table deletes: begin a tx on pool, delete related rows in other relations (chunks, edges, …), call this with the same &mut PgConnection, then commit(). A failure anywhere rolls back the whole set — no orphaned vectors or chunks. The table name stays encapsulated (format! over the validated identifier).

Trait Implementations

impl AsyncVectorIndex for PgVectorIndex

fn add<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, vectors: &'life1 [Vec<f32>], ids: &'life2 [u64], ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

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

Upsert vectors keyed by their explicit external IDs.

fn remove<'life0, 'life1, 'async_trait>( &'life0 self, ids: &'life1 [u64], ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

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

Remove vectors by their external IDs.

fn search<'life0, 'life1, 'async_trait>( &'life0 self, query: &'life1 [f32], k: usize, ) -> Pin<Box<dyn Future<Output = Result<Vec<SearchHit>>> + Send + 'async_trait>>

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

Search for the k nearest neighbors of query.

fn search_filtered<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, query: &'life1 [f32], k: usize, allowlist: &'life2 [u64], ) -> Pin<Box<dyn Future<Output = Result<Vec<SearchHit>>> + Send + 'async_trait>>

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

Search restricted to an allowlist of candidate IDs.

fn len<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = Result<usize>> + Send + 'async_trait>>

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

Number of vectors currently indexed.

fn dim(&self) -> usize

Vector dimensionality.

fn is_empty<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = Result<bool>> + Send + 'async_trait>>

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

Whether the index is empty.