Struct TwoTierMemory 

pub struct TwoTierMemory { /* private fields */ }

Two-tier memory: bounded short-term working store + decayed long-term store.

• Writes (put) always land in the short tier.
• get checks the short tier first, then the long tier.
• search scores both tiers with the long-term weighted formula (so cross-tier ordering is on one scale), de-duplicating by key with the short tier preferred.
• consolidate promotes qualifying short-term entries into long-term memory and removes them from the short tier.

Implementations

impl TwoTierMemory

pub fn new(short_capacity: usize) -> Self

Creates a two-tier store with default capacity/weights/scorer/policy.

pub fn with_policy(self, policy: PromotionPolicy) -> Self

Replaces the promotion policy.

pub fn short_term(&self) -> Arc<ShortTermMemory>

The short-term tier (direct access for seeding/tests).

pub fn long_term(&self) -> Arc<LongTermMemory>

The long-term tier (direct access for seeding/tests).

pub fn set_policy(&self, policy: PromotionPolicy)

Replaces the promotion policy at runtime.

pub async fn consolidate_namespace( &self, namespace: &str, ) -> Result<Vec<String>, MemoryError>

Promotes qualifying short-term entries of one namespace into long-term memory, removing promoted entries from the short tier. Returns the promoted keys.

pub async fn consolidate(&self) -> Result<Vec<String>, MemoryError>

Promotes qualifying entries across every short-term namespace.

Trait Implementations

impl Debug for TwoTierMemory

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

Formats the value using the given formatter.

impl MemoryStore for TwoTierMemory

fn put<'life0, 'life1, 'async_trait>( &'life0 self, namespace: &'life1 str, item: MemoryItem, ) -> Pin<Box<dyn Future<Output = Result<(), MemoryError>> + Send + 'async_trait>>

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

Writes/updates an item in the namespace. Re-putting an existing key refreshes its content and access time.

fn get<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, namespace: &'life1 str, key: &'life2 str, ) -> Pin<Box<dyn Future<Output = Result<Option<MemoryItem>, MemoryError>> + Send + 'async_trait>>

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

Exact key lookup (None when absent). Counts as an access.

fn search<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, query: &'life1 MemoryQuery<'life2>, ) -> Pin<Box<dyn Future<Output = Result<Vec<MemoryHit>, MemoryError>> + Send + 'async_trait>>

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

Semantic recall, best score first, capped at query.k.

fn forget<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, namespace: &'life1 str, key: &'life2 str, ) -> Pin<Box<dyn Future<Output = Result<bool, MemoryError>> + Send + 'async_trait>>

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

Removes one entry; returns whether it existed.

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

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

Drops every entry in the namespace; returns the number removed.

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

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

Number of entries stored under the namespace.