Struct WorkingMemoryBuffer 

pub struct WorkingMemoryBuffer { /* private fields */ }

Bounded in-memory buffer for agent short-term memory.

Stores the N most recent entries (text + embedding). When full, the oldest entry is evicted on each push. Supports brute-force flat scan (search) and draining all entries to an AI-Lake table (drain_to_table).

Cascade pattern

Short-term agents use only WorkingMemoryBuffer. Long-term agents cascade:

1. search queries the buffer first (fast, recent).
2. When full, drain_to_table persists to AI-Lake; continue searching via ailake::search for historical context.

Example

let mut wm = WorkingMemoryBuffer::new(100);
wm.push("Meeting notes: …", embedding, 0.8);
let top3 = wm.search(&query_vec, 3);
if wm.is_full() {
    wm.drain_to_table(&mut writer).await?;
    writer.commit().await?;
}

Implementations

impl WorkingMemoryBuffer

pub fn new(max_rows: usize) -> Self

Create buffer with at most max_rows entries. Evicts oldest on overflow.

pub fn push( &mut self, text: impl Into<String>, embedding: Vec<f32>, importance: f32, )

Add entry. If at capacity, evicts the oldest entry (FIFO).

pub fn search( &self, query: &[f32], top_k: usize, ) -> Vec<(f32, &WorkingMemoryEntry)>

Brute-force cosine similarity scan. Returns (distance, entry) pairs sorted ascending (smallest distance = most similar). Distances in [0, 2].

pub async fn drain_to_table( &mut self, writer: &mut TableWriter, ) -> AilakeResult<()>

Write all buffered entries to an AI-Lake table and clear the buffer.

Creates a RecordBatch with a chunk_text column. Call writer.commit() after to persist the snapshot.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn is_full(&self) -> bool

True when the buffer has reached its configured capacity.