Struct NativeStore 

pub struct NativeStore { /* private fields */ }

The default MemoryStore: the native, file-backed engine (velesdb-core’s Database/AgentMemory, requiring the persistence feature). Existing callers of MemoryService::open see no change — this is exactly what they already ran.

Implementations

impl NativeStore

pub fn open<P: AsRef<Path>>( path: P, dimension: usize, ) -> Result<Self, MemoryError>

Open (or create) a native store at path, sized for dimension.

Errors

Returns MemoryError if the store cannot be opened.

Trait Implementations

impl MemoryStore for NativeStore

Available on crate feature persistence only.

fn store( &self, id: u64, content: &str, embedding: &[f32], ) -> Result<(), MemoryError>

Store a fact with no metadata or expiry.

fn store_with_metadata( &self, id: u64, content: &str, embedding: &[f32], metadata: &Metadata, ) -> Result<(), MemoryError>

Store a fact tagged with metadata, no expiry.

fn store_with_ttl( &self, id: u64, content: &str, embedding: &[f32], ttl_seconds: u64, ) -> Result<(), MemoryError>

Store a fact that expires after ttl_seconds, no metadata.

fn update_metadata( &self, id: u64, metadata: &Metadata, ) -> Result<(), MemoryError>

Merge metadata into an already-stored fact’s payload, preserving any durable TTL. Used to combine metadata with an expiry (store both in two calls rather than needing every metadata×TTL combination as a separate primitive).

fn store_with_metadata_and_ttl( &self, id: u64, content: &str, embedding: &[f32], metadata: &Metadata, ttl_seconds: u64, ) -> Result<(), MemoryError>

Store a fact with BOTH metadata and a durable TTL, in ONE write.

fn get(&self, id: u64) -> Result<Option<(String, Vec<f32>)>, MemoryError>

A fact’s content and embedding, or None if unknown/expired.

fn get_metadata(&self, id: u64) -> Result<Option<Metadata>, MemoryError>

A fact’s raw stored payload — reserved system keys (_veles_*) included, so the service layer can check the hub flag before stripping them for the caller — or None when the fact is unknown/expired.

fn get_metadata_batch( &self, ids: &[u64], ) -> Result<Vec<Option<Metadata>>, MemoryError>

Batched Self::get_metadata: one storage round trip for every id in ids, results in the same order and length (an unknown or expired id maps to None). Same raw-payload semantics as the single-id form.

fn delete(&self, id: u64) -> Result<(), MemoryError>

Delete a fact.

fn query_filtered( &self, embedding: &[f32], k: usize, filter: &Metadata, offset: usize, ) -> Result<Vec<(u64, f32, String)>, MemoryError>

Vector search for up to k ids, narrowed to facts whose metadata exactly matches every key in filter.

fn query_excluding( &self, embedding: &[f32], k: usize, exclude: &Metadata, ) -> Result<Vec<(u64, f32, String)>, MemoryError>

Vector search for up to k ids, dropping facts whose metadata matches every key in exclude.

fn query_columnar( &self, embedding: &[f32], k: usize, filters: &[ColumnFilter], ) -> Result<Vec<Recollection>, MemoryError>

Vector search fused with structured ColumnStore predicates (ranges and comparisons, not just equality) — the engine behind crate::service::MemoryService::recall_where.

fn relate(&self, from: u64, to: u64, relation: &str) -> Result<u64, MemoryError>

Create a typed edge from -> to. Returns the edge id.

fn relations(&self, id: u64) -> Result<Vec<MemoryEdge>, MemoryError>

The outgoing edges of id.

fn incoming_relations(&self, id: u64) -> Result<Vec<MemoryEdge>, MemoryError>

The incoming edges of id — the mirror of Self::relations, with the same liveness rule applied to the far end (here the source).

fn relations_bounded( &self, id: u64, cap: usize, ) -> Result<BoundedMemoryEdges, MemoryError>

At most cap outgoing edges of id, plus whether its total degree exceeded the scan — the bounded twin of Self::relations (#1820).

fn incoming_relations_bounded( &self, id: u64, cap: usize, ) -> Result<BoundedMemoryEdges, MemoryError>

At most cap incoming edges of id, plus whether its total incoming degree exceeded the scan — the mirror of Self::relations_bounded, same O(cap) cost contract.

fn unrelate(&self, edge_id: u64) -> Result<bool, MemoryError>

Remove the edge with edge_id. Returns true when it existed — idempotent: removing an absent edge is Ok(false), never an error.

fn count(&self) -> usize

The total number of live (non-expired) tracked facts, including internal entity hubs — used as a corpus-size proxy for idf weighting.

fn edge_count(&self) -> Option<usize>

The total number of graph edges, when the backend can answer without materializing them — the observable difference between a store whose why() can walk somewhere and one where it degrades to plain similarity search.

fn list( &self, cursor: Option<u64>, limit: usize, ) -> Result<(Vec<RawListedFact>, Option<u64>), MemoryError>

One cursor page of the store’s live facts, ids ascending: up to limit entries strictly after cursor (None starts the walk), plus the cursor for the next page (None ends it). Payloads come back RAW — reserved keys and scaffolding markers included — because the policy of what a caller may see (hub filtering, key stripping) belongs to the service layer, in one place, for every backend.