pub struct CachingStore<'a> { /* private fields */ }Implementations§
Source§impl<'a> CachingStore<'a>
impl<'a> CachingStore<'a>
pub fn new(inner: &'a dyn Store) -> Self
Sourcepub fn prewarm_vectors(&self, corpus: Vec<Memory>)
pub fn prewarm_vectors(&self, corpus: Vec<Memory>)
Serve vector_search from an in-memory corpus instead of re-reading and re-parsing every embedding blob through the store’s connection mutex on each call. The caller must supply exactly the rows the store’s own vector_search would scan: embedding present, tier hot, not superseded.
pub fn prewarm(&self) -> Result<()>
Trait Implementations§
Source§impl Store for CachingStore<'_>
impl Store for CachingStore<'_>
fn get_relations( &self, node_id: Uuid, relation_type: Option<RelationType>, ) -> Result<Vec<Relation>>
fn store_memory(&self, memory: &Memory) -> Result<()>
fn get_memory(&self, id: Uuid) -> Result<Option<Memory>>
fn delete_memory(&self, id: Uuid) -> Result<()>
Source§fn remove_memory(&self, id: Uuid) -> Result<bool>
fn remove_memory(&self, id: Uuid) -> Result<bool>
delete_memory that also reports whether a row was there to remove,
so a forget of an unknown id can be answered as such instead of
silently succeeding.Source§fn source_admits(&self, memory: &Memory, source: &str) -> Result<bool>
fn source_admits(&self, memory: &Memory, source: &str) -> Result<bool>
Whether
memory answers a recall scoped to source. Consolidation
leaves the raws archived and the distillate tagged ‘consolidation’, so
a store that tracks distillation must let a distillate answer for the
sources of its raws, or a source filter finds nothing once its raws
are consolidated. The default is the plain column comparison for
stores that never consolidate.Source§fn record_accesses(&self, ids: &[Uuid]) -> Result<()>
fn record_accesses(&self, ids: &[Uuid]) -> Result<()>
Count one access on each of
ids and stamp them with the current
time; confidence is left alone. A recall touches every result it
returns, so an implementation should batch these into one write
rather than take the writer lock per row. Ids the store does not
hold are ignored.Source§fn chunk_window(&self, memory_id: Uuid, ord: usize) -> Result<Option<String>>
fn chunk_window(&self, memory_id: Uuid, ord: usize) -> Result<Option<String>>
The text around a memory’s chunk
ord: that chunk joined with one
neighbour on each side. None for a store that keeps no chunks.fn store_entity(&self, entity: &Entity) -> Result<()>
fn get_entity(&self, id: Uuid) -> Result<Option<Entity>>
fn find_entity_by_name(&self, name: &str) -> Result<Option<Entity>>
fn store_conversation(&self, conversation: &Conversation) -> Result<()>
fn store_relation(&self, relation: &Relation) -> Result<()>
fn vector_search( &self, embedding: &[f32], limit: usize, ) -> Result<Vec<(Memory, f32)>>
Source§fn filtered_vector_search(
&self,
embedding: &[f32],
source: Option<&str>,
memory_type: Option<MemoryType>,
project_path: Option<&str>,
limit: usize,
) -> Result<Vec<(Memory, f32)>>
fn filtered_vector_search( &self, embedding: &[f32], source: Option<&str>, memory_type: Option<MemoryType>, project_path: Option<&str>, limit: usize, ) -> Result<Vec<(Memory, f32)>>
Cosine search restricted to memories matching
source, memory_type,
and/or project_path, scanned exhaustively over that subset. Read morefn traverse( &self, start_id: Uuid, depth: u32, ) -> Result<Vec<(Memory, Vec<Relation>)>>
fn memories_by_source(&self, source: &str) -> Result<Vec<Memory>>
fn memories_by_type(&self, memory_type: MemoryType) -> Result<Vec<Memory>>
fn update_memory(&self, memory: &Memory) -> Result<()>
fn record_access(&self, memory: &Memory) -> Result<()>
fn bm25_search(&self, query: &str, limit: usize) -> Result<Vec<Memory>>
fn get_memory_with_embedding(&self, id: Uuid) -> Result<Option<Memory>>
fn memory_count(&self) -> Result<usize>
fn all_memory_ids(&self) -> Result<Vec<Uuid>>
fn all_relations(&self) -> Result<Vec<Relation>>
Auto Trait Implementations§
impl<'a> !Freeze for CachingStore<'a>
impl<'a> !RefUnwindSafe for CachingStore<'a>
impl<'a> !UnwindSafe for CachingStore<'a>
impl<'a> Forget for CachingStore<'a>
impl<'a> Move for CachingStore<'a>
impl<'a> Send for CachingStore<'a>
impl<'a> Sync for CachingStore<'a>
impl<'a> Unpin for CachingStore<'a>
impl<'a> UnsafeUnpin for CachingStore<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Converts
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Converts
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
impl<T> Fruit for T
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more