@monoes/memory 1.0.0

package/dist/tier-manager.d.ts

@@ -0,0 +1,79 @@
+/**
+ * TierManager — Routes memory operations to the correct tier (Task 09)
+ *
+ * Coordinates short-term (in-memory), long-term (persistent backend),
+ * entity (JSON-lines KV), and contextual (session summaries) tiers.
+ *
+ * @module v1/memory/tier-manager
+ */
+import type { IMemoryBackend, MemoryEntry, MemoryEntryInput, MemoryTier, TierManagerConfig } from './types.js';
+import { ShortTermMemory } from './tiers/short-term.js';
+import { EntityMemory } from './tiers/entity.js';
+import { ContextualMemory } from './tiers/contextual.js';
+import { PartitionedHNSW, type PartitionedHNSWConfig } from './partitioned-hnsw.js';
+import { DiskAnnBackend, type DiskAnnBackendConfig } from './diskann-backend.js';
+export declare class TierManager {
+    readonly shortTerm: ShortTermMemory;
+    readonly entity: EntityMemory;
+    readonly contextual: ContextualMemory;
+    /** Timestamp-partitioned HNSW for temporally-local semantic search.
+     *  Source: ICDE 2025 Timestamp-Partitioned HNSW */
+    readonly partitionedIndex: PartitionedHNSW;
+    /**
+     * Optional DiskANN backend for large-scale ANN search (Tier 4).
+     * Activated by passing `diskAnnConfig` to the constructor.
+     * Wraps the longTermBackend so all CRUD still flows through the delegate;
+     * `search()` uses the disk-resident graph + quantised beam search.
+     * Source: arXiv:2305.04359
+     */
+    readonly diskann?: DiskAnnBackend;
+    private readonly longTermBackend;
+    private readonly config;
+    constructor(longTermBackend: IMemoryBackend, config?: Partial<TierManagerConfig>, partitionedHNSWConfig?: PartitionedHNSWConfig, diskAnnConfig?: DiskAnnBackendConfig);
+    /**
+     * Store a memory entry, routing to the correct tier.
+     *
+     * - `short-term` goes to the in-memory buffer
+     * - `long-term` (or unspecified) goes to the persistent backend
+     *
+     * All entries are also indexed in the timestamp-partitioned HNSW for
+     * temporally-local search (ICDE 2025).
+     *
+     * Returns the generated entry ID.
+     */
+    store(input: MemoryEntryInput & {
+        tier?: MemoryTier;
+    }): Promise<string>;
+    /**
+     * Merged search across partitioned HNSW, short-term buffer, long-term backend,
+     * and (when configured) DiskANN beam search.
+     *
+     * Order of precedence:
+     *  1. Partitioned HNSW (newest buckets first — temporal locality)
+     *  2. Short-term in-memory buffer
+     *  3. Long-term persistent backend (metadata / hybrid query)
+     *  4. DiskANN ANN search — only when diskAnnConfig was supplied; uses a
+     *     character-frequency proxy embedding as the query vector (approximation)
+     *
+     * Results are deduplicated by entry ID.
+     */
+    search(query: string, limit?: number): Promise<MemoryEntry[]>;
+    /**
+     * Derive a fixed-length Float32 proxy embedding from plain text.
+     *
+     * Maps character byte values into a 128-dimensional L2-normalised vector.
+     * This is NOT a semantic embedding — it is solely used to drive DiskANN
+     * beam traversal when no real embedding generator is available at this
+     * call site.  Quality of DiskANN results improves dramatically when entries
+     * are stored with real semantic embeddings.
+     */
+    private static textToVec;
+    /**
+     * Flush the short-term buffer into the long-term backend.
+     * Promoted entries are also added to the partitioned HNSW index so they
+     * remain visible in partition-based searches after promotion.
+     * Returns the number of entries promoted.
+     */
+    flushShortTerm(): Promise<number>;
+}
+//# sourceMappingURL=tier-manager.d.ts.map

package/dist/tier-manager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tier-manager.d.ts","sourceRoot":"","sources":["../src/tier-manager.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EACV,cAAc,EACd,WAAW,EACX,gBAAgB,EAChB,UAAU,EACV,iBAAiB,EAClB,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,KAAK,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AACpF,OAAO,EAAE,cAAc,EAAE,KAAK,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AAEjF,qBAAa,WAAW;IACtB,QAAQ,CAAC,SAAS,EAAE,eAAe,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAC9B,QAAQ,CAAC,UAAU,EAAE,gBAAgB,CAAC;IAEtC;uDACmD;IACnD,QAAQ,CAAC,gBAAgB,EAAE,eAAe,CAAC;IAE3C;;;;;;OAMG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,cAAc,CAAC;IAElC,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAiB;IACjD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAoB;gBAGzC,eAAe,EAAE,cAAc,EAC/B,MAAM,GAAE,OAAO,CAAC,iBAAiB,CAAM,EACvC,qBAAqB,GAAE,qBAA0B,EACjD,aAAa,CAAC,EAAE,oBAAoB;IA4BtC;;;;;;;;;;OAUG;IACG,KAAK,CAAC,KAAK,EAAE,gBAAgB,GAAG;QAAE,IAAI,CAAC,EAAE,UAAU,CAAA;KAAE,GAAG,OAAO,CAAC,MAAM,CAAC;IAgB7E;;;;;;;;;;;;OAYG;IACG,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IA+C/D;;;;;;;;OAQG;IACH,OAAO,CAAC,MAAM,CAAC,SAAS;IAYxB;;;;;OAKG;IACG,cAAc,IAAI,OAAO,CAAC,MAAM,CAAC;CAUxC"}

package/dist/tier-manager.js

@@ -0,0 +1,169 @@
+/**
+ * TierManager — Routes memory operations to the correct tier (Task 09)
+ *
+ * Coordinates short-term (in-memory), long-term (persistent backend),
+ * entity (JSON-lines KV), and contextual (session summaries) tiers.
+ *
+ * @module v1/memory/tier-manager
+ */
+import { createDefaultEntry } from './types.js';
+import { ShortTermMemory } from './tiers/short-term.js';
+import { EntityMemory } from './tiers/entity.js';
+import { ContextualMemory } from './tiers/contextual.js';
+import { PartitionedHNSW } from './partitioned-hnsw.js';
+import { DiskAnnBackend } from './diskann-backend.js';
+export class TierManager {
+    shortTerm;
+    entity;
+    contextual;
+    /** Timestamp-partitioned HNSW for temporally-local semantic search.
+     *  Source: ICDE 2025 Timestamp-Partitioned HNSW */
+    partitionedIndex;
+    /**
+     * Optional DiskANN backend for large-scale ANN search (Tier 4).
+     * Activated by passing `diskAnnConfig` to the constructor.
+     * Wraps the longTermBackend so all CRUD still flows through the delegate;
+     * `search()` uses the disk-resident graph + quantised beam search.
+     * Source: arXiv:2305.04359
+     */
+    diskann;
+    longTermBackend;
+    config;
+    constructor(longTermBackend, config = {}, partitionedHNSWConfig = {}, diskAnnConfig) {
+        this.config = {
+            shortTermCapacity: config.shortTermCapacity ?? 500,
+            entityStorePath: config.entityStorePath ?? './data/memory/entities.jsonl',
+            contextualNamespace: config.contextualNamespace ?? 'contextual-summaries',
+            autoFlushOnSessionEnd: config.autoFlushOnSessionEnd ?? true,
+        };
+        // If diskAnnConfig is supplied, wrap longTermBackend in a DiskAnnBackend.
+        // All CRUD still delegates to the original backend; search() uses DiskANN.
+        if (diskAnnConfig) {
+            const diskannBackend = new DiskAnnBackend(longTermBackend, diskAnnConfig);
+            this.diskann = diskannBackend;
+            this.longTermBackend = diskannBackend;
+        }
+        else {
+            this.longTermBackend = longTermBackend;
+        }
+        this.shortTerm = new ShortTermMemory(this.config.shortTermCapacity);
+        this.entity = new EntityMemory(this.config.entityStorePath);
+        this.contextual = new ContextualMemory(this.longTermBackend, this.config.contextualNamespace);
+        this.partitionedIndex = new PartitionedHNSW(partitionedHNSWConfig);
+    }
+    /**
+     * Store a memory entry, routing to the correct tier.
+     *
+     * - `short-term` goes to the in-memory buffer
+     * - `long-term` (or unspecified) goes to the persistent backend
+     *
+     * All entries are also indexed in the timestamp-partitioned HNSW for
+     * temporally-local search (ICDE 2025).
+     *
+     * Returns the generated entry ID.
+     */
+    async store(input) {
+        const entry = createDefaultEntry(input);
+        const tier = input.tier ?? 'long-term';
+        if (tier === 'short-term') {
+            this.shortTerm.store(entry);
+        }
+        else {
+            await this.longTermBackend.store(entry);
+        }
+        // Index in partitioned HNSW for temporal-locality search
+        this.partitionedIndex.add(entry);
+        return entry.id;
+    }
+    /**
+     * Merged search across partitioned HNSW, short-term buffer, long-term backend,
+     * and (when configured) DiskANN beam search.
+     *
+     * Order of precedence:
+     *  1. Partitioned HNSW (newest buckets first — temporal locality)
+     *  2. Short-term in-memory buffer
+     *  3. Long-term persistent backend (metadata / hybrid query)
+     *  4. DiskANN ANN search — only when diskAnnConfig was supplied; uses a
+     *     character-frequency proxy embedding as the query vector (approximation)
+     *
+     * Results are deduplicated by entry ID.
+     */
+    async search(query, limit = 10) {
+        // 1. Partitioned HNSW — nearest neighbours in recent time buckets first
+        const partitionedResults = this.partitionedIndex.search(null, // no raw embedding at this call-site; uses text fallback
+        query, limit);
+        // 2. Short-term results (synchronous)
+        const shortResults = this.shortTerm.search(query, limit);
+        // 3. Long-term results via the backend query interface
+        const longResults = await this.longTermBackend.query({
+            type: 'hybrid',
+            content: query,
+            limit,
+        });
+        // 4. DiskANN ANN search (activated when diskann is configured)
+        //    Uses a character-frequency proxy embedding to drive beam search.
+        //    Re-ranking in DiskAnnBackend.search() uses the actual stored embeddings.
+        let annEntries = [];
+        if (this.diskann) {
+            try {
+                const proxyVec = TierManager.textToVec(query);
+                const annResults = await this.diskann.search(proxyVec, { k: limit });
+                annEntries = annResults.map(r => r.entry);
+            }
+            catch {
+                // Non-fatal; DiskANN is best-effort
+            }
+        }
+        // Deduplicate by id: partitioned > short-term > long-term > diskann
+        const seen = new Set();
+        const merged = [];
+        for (const entry of [...partitionedResults, ...shortResults, ...longResults, ...annEntries]) {
+            if (!seen.has(entry.id)) {
+                seen.add(entry.id);
+                merged.push(entry);
+            }
+            if (merged.length >= limit)
+                break;
+        }
+        return merged;
+    }
+    /**
+     * Derive a fixed-length Float32 proxy embedding from plain text.
+     *
+     * Maps character byte values into a 128-dimensional L2-normalised vector.
+     * This is NOT a semantic embedding — it is solely used to drive DiskANN
+     * beam traversal when no real embedding generator is available at this
+     * call site.  Quality of DiskANN results improves dramatically when entries
+     * are stored with real semantic embeddings.
+     */
+    static textToVec(text, dims = 128) {
+        const vec = new Float32Array(dims);
+        for (let i = 0; i < text.length; i++) {
+            vec[i % dims] += text.charCodeAt(i) / 255;
+        }
+        let norm = 0;
+        for (const v of vec)
+            norm += v * v;
+        norm = Math.sqrt(norm) || 1;
+        for (let i = 0; i < dims; i++)
+            vec[i] /= norm;
+        return vec;
+    }
+    /**
+     * Flush the short-term buffer into the long-term backend.
+     * Promoted entries are also added to the partitioned HNSW index so they
+     * remain visible in partition-based searches after promotion.
+     * Returns the number of entries promoted.
+     */
+    async flushShortTerm() {
+        // Snapshot the entries before flush so we can index them afterwards.
+        // ShortTermMemory.flush() clears the buffer, so we must read first.
+        const toPromote = this.shortTerm.snapshot();
+        const count = await this.shortTerm.flush(this.longTermBackend);
+        for (const entry of toPromote) {
+            this.partitionedIndex.add(entry);
+        }
+        return count;
+    }
+}
+//# sourceMappingURL=tier-manager.js.map

package/dist/tier-manager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tier-manager.js","sourceRoot":"","sources":["../src/tier-manager.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AASH,OAAO,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAChD,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,eAAe,EAA8B,MAAM,uBAAuB,CAAC;AACpF,OAAO,EAAE,cAAc,EAA6B,MAAM,sBAAsB,CAAC;AAEjF,MAAM,OAAO,WAAW;IACb,SAAS,CAAkB;IAC3B,MAAM,CAAe;IACrB,UAAU,CAAmB;IAEtC;uDACmD;IAC1C,gBAAgB,CAAkB;IAE3C;;;;;;OAMG;IACM,OAAO,CAAkB;IAEjB,eAAe,CAAiB;IAChC,MAAM,CAAoB;IAE3C,YACE,eAA+B,EAC/B,SAAqC,EAAE,EACvC,wBAA+C,EAAE,EACjD,aAAoC;QAEpC,IAAI,CAAC,MAAM,GAAG;YACZ,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,IAAI,GAAG;YAClD,eAAe,EAAE,MAAM,CAAC,eAAe,IAAI,8BAA8B;YACzE,mBAAmB,EAAE,MAAM,CAAC,mBAAmB,IAAI,sBAAsB;YACzE,qBAAqB,EAAE,MAAM,CAAC,qBAAqB,IAAI,IAAI;SAC5D,CAAC;QAEF,0EAA0E;QAC1E,2EAA2E;QAC3E,IAAI,aAAa,EAAE,CAAC;YAClB,MAAM,cAAc,GAAG,IAAI,cAAc,CAAC,eAAe,EAAE,aAAa,CAAC,CAAC;YACzE,IAAqC,CAAC,OAAO,GAAG,cAAc,CAAC;YAChE,IAAI,CAAC,eAAe,GAAG,cAAc,CAAC;QACxC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACzC,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACpE,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;QAC5D,IAAI,CAAC,UAAU,GAAG,IAAI,gBAAgB,CACpC,IAAI,CAAC,eAAe,EACpB,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAChC,CAAC;QACF,IAAI,CAAC,gBAAgB,GAAG,IAAI,eAAe,CAAC,qBAAqB,CAAC,CAAC;IACrE,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,KAAK,CAAC,KAA+C;QACzD,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,WAAW,CAAC;QAEvC,IAAI,IAAI,KAAK,YAAY,EAAE,CAAC;YAC1B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1C,CAAC;QAED,yDAAyD;QACzD,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEjC,OAAO,KAAK,CAAC,EAAE,CAAC;IAClB,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,KAAK,GAAG,EAAE;QACpC,wEAAwE;QACxE,MAAM,kBAAkB,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CACrD,IAAI,EAAU,yDAAyD;QACvE,KAAK,EACL,KAAK,CACN,CAAC;QAEF,sCAAsC;QACtC,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAEzD,uDAAuD;QACvD,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC;YACnD,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,KAAK;YACd,KAAK;SACN,CAAC,CAAC;QAEH,+DAA+D;QAC/D,sEAAsE;QACtE,8EAA8E;QAC9E,IAAI,UAAU,GAAkB,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,WAAW,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBAC9C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;gBACrE,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC5C,CAAC;YAAC,MAAM,CAAC;gBACP,oCAAoC;YACtC,CAAC;QACH,CAAC;QAED,oEAAoE;QACpE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,MAAM,GAAkB,EAAE,CAAC;QAEjC,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,kBAAkB,EAAE,GAAG,YAAY,EAAE,GAAG,WAAW,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC;YAC5F,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;YACD,IAAI,MAAM,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;QACpC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;OAQG;IACK,MAAM,CAAC,SAAS,CAAC,IAAY,EAAE,IAAI,GAAG,GAAG;QAC/C,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QAC5C,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,CAAC,IAAI,GAAG;YAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QAC9C,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,cAAc;QAClB,qEAAqE;QACrE,oEAAoE;QACpE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC/D,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

package/dist/tiers/contextual.d.ts

@@ -0,0 +1,43 @@
+/**
+ * ContextualMemory — Compressed session summaries (Task 09)
+ *
+ * Wraps an IMemoryBackend to persist session summaries and
+ * provides token-budget-aware retrieval of relevant context.
+ *
+ * @module v1/memory/tiers/contextual
+ */
+import type { IMemoryBackend } from '../types.js';
+export interface SessionSummary {
+    sessionId: string;
+    agentSlugs: string[];
+    summary: string;
+    tokenCount: number;
+    createdAt: number;
+}
+export declare class ContextualMemory {
+    private readonly backend;
+    private summaries;
+    private readonly namespace;
+    private warmed;
+    constructor(backend: IMemoryBackend, namespace?: string);
+    /**
+     * Load persisted summaries from the backend into the in-memory cache.
+     * Called automatically before the first read so cross-session summaries
+     * are visible without an explicit initialization step.
+     */
+    warm(): Promise<void>;
+    /**
+     * Persist a session summary both in the local map and the
+     * backing memory store.
+     */
+    storeSummary(summary: SessionSummary): Promise<void>;
+    /**
+     * Retrieve summaries whose content matches the query (simple
+     * substring match over the local cache), respecting a maximum
+     * token budget. Summaries are returned newest-first.
+     */
+    retrieveContext(query: string, maxTokens?: number): Promise<string>;
+    /** Look up a summary by session ID (local cache only). */
+    getSummary(sessionId: string): SessionSummary | undefined;
+}
+//# sourceMappingURL=contextual.d.ts.map

package/dist/tiers/contextual.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"contextual.d.ts","sourceRoot":"","sources":["../../src/tiers/contextual.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAoB,MAAM,aAAa,CAAC;AAGpE,MAAM,WAAW,cAAc;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,qBAAa,gBAAgB;IAMzB,OAAO,CAAC,QAAQ,CAAC,OAAO;IAL1B,OAAO,CAAC,SAAS,CAA0C;IAC3D,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,MAAM,CAAS;gBAGJ,OAAO,EAAE,cAAc,EACxC,SAAS,SAAyB;IAKpC;;;;OAIG;IACG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IA6B3B;;;OAGG;IACG,YAAY,CAAC,OAAO,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IAqB1D;;;;OAIG;IACG,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,SAAO,GAAG,OAAO,CAAC,MAAM,CAAC;IAuBvE,0DAA0D;IAC1D,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;CAG1D"}

package/dist/tiers/contextual.js

@@ -0,0 +1,102 @@
+/**
+ * ContextualMemory — Compressed session summaries (Task 09)
+ *
+ * Wraps an IMemoryBackend to persist session summaries and
+ * provides token-budget-aware retrieval of relevant context.
+ *
+ * @module v1/memory/tiers/contextual
+ */
+import { createDefaultEntry } from '../types.js';
+export class ContextualMemory {
+    backend;
+    summaries = new Map();
+    namespace;
+    warmed = false;
+    constructor(backend, namespace = 'contextual-summaries') {
+        this.backend = backend;
+        this.namespace = namespace;
+    }
+    /**
+     * Load persisted summaries from the backend into the in-memory cache.
+     * Called automatically before the first read so cross-session summaries
+     * are visible without an explicit initialization step.
+     */
+    async warm() {
+        if (this.warmed)
+            return;
+        this.warmed = true;
+        try {
+            const entries = await this.backend.query({
+                type: 'hybrid',
+                namespace: this.namespace,
+                tags: ['session-summary'],
+                limit: 10000,
+            });
+            for (const entry of entries) {
+                const sessionId = entry.metadata?.sessionId;
+                if (!sessionId || this.summaries.has(sessionId))
+                    continue;
+                this.summaries.set(sessionId, {
+                    sessionId,
+                    agentSlugs: entry.metadata?.agentSlugs ?? [],
+                    summary: entry.content,
+                    tokenCount: entry.metadata?.tokenCount ?? 0,
+                    createdAt: entry.createdAt,
+                });
+            }
+        }
+        catch {
+            // Backend unavailable — proceed with empty cache
+        }
+    }
+    /**
+     * Persist a session summary both in the local map and the
+     * backing memory store.
+     */
+    async storeSummary(summary) {
+        this.summaries.set(summary.sessionId, summary);
+        const input = {
+            key: `ctx-summary:${summary.sessionId}`,
+            content: summary.summary,
+            namespace: this.namespace,
+            tags: ['session-summary', ...summary.agentSlugs],
+            metadata: {
+                sessionId: summary.sessionId,
+                agentSlugs: summary.agentSlugs,
+                tokenCount: summary.tokenCount,
+            },
+        };
+        const entry = createDefaultEntry(input);
+        entry.createdAt = summary.createdAt;
+        entry.updatedAt = summary.createdAt;
+        await this.backend.store(entry);
+    }
+    /**
+     * Retrieve summaries whose content matches the query (simple
+     * substring match over the local cache), respecting a maximum
+     * token budget. Summaries are returned newest-first.
+     */
+    async retrieveContext(query, maxTokens = 2000) {
+        await this.warm();
+        const lowerQuery = query.toLowerCase();
+        const sorted = Array.from(this.summaries.values()).sort((a, b) => b.createdAt - a.createdAt);
+        const parts = [];
+        let budget = maxTokens;
+        for (const s of sorted) {
+            if (budget <= 0)
+                break;
+            if (s.summary.toLowerCase().includes(lowerQuery) || lowerQuery === '') {
+                if (s.tokenCount <= budget) {
+                    parts.push(s.summary);
+                    budget -= s.tokenCount;
+                }
+            }
+        }
+        return parts.join('\n\n');
+    }
+    /** Look up a summary by session ID (local cache only). */
+    getSummary(sessionId) {
+        return this.summaries.get(sessionId);
+    }
+}
+//# sourceMappingURL=contextual.js.map

package/dist/tiers/contextual.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"contextual.js","sourceRoot":"","sources":["../../src/tiers/contextual.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AAUjD,MAAM,OAAO,gBAAgB;IAMR;IALX,SAAS,GAAgC,IAAI,GAAG,EAAE,CAAC;IAC1C,SAAS,CAAS;IAC3B,MAAM,GAAG,KAAK,CAAC;IAEvB,YACmB,OAAuB,EACxC,SAAS,GAAG,sBAAsB;QADjB,YAAO,GAAP,OAAO,CAAgB;QAGxC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO;QACxB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QAEnB,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;gBACvC,IAAI,EAAE,QAAQ;gBACd,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,IAAI,EAAE,CAAC,iBAAiB,CAAC;gBACzB,KAAK,EAAE,KAAK;aACb,CAAC,CAAC;YAEH,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,SAA+B,CAAC;gBAClE,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC;oBAAE,SAAS;gBAE1D,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE;oBAC5B,SAAS;oBACT,UAAU,EAAG,KAAK,CAAC,QAAQ,EAAE,UAAuB,IAAI,EAAE;oBAC1D,OAAO,EAAE,KAAK,CAAC,OAAO;oBACtB,UAAU,EAAG,KAAK,CAAC,QAAQ,EAAE,UAAqB,IAAI,CAAC;oBACvD,SAAS,EAAE,KAAK,CAAC,SAAS;iBAC3B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,iDAAiD;QACnD,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,YAAY,CAAC,OAAuB;QACxC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAE/C,MAAM,KAAK,GAAqB;YAC9B,GAAG,EAAE,eAAe,OAAO,CAAC,SAAS,EAAE;YACvC,OAAO,EAAE,OAAO,CAAC,OAAO;YACxB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,IAAI,EAAE,CAAC,iBAAiB,EAAE,GAAG,OAAO,CAAC,UAAU,CAAC;YAChD,QAAQ,EAAE;gBACR,SAAS,EAAE,OAAO,CAAC,SAAS;gBAC5B,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,UAAU,EAAE,OAAO,CAAC,UAAU;aAC/B;SACF,CAAC;QAEF,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;QACxC,KAAK,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QACpC,KAAK,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QACpC,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,eAAe,CAAC,KAAa,EAAE,SAAS,GAAG,IAAI;QACnD,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CACrD,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CACpC,CAAC;QAEF,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,MAAM,GAAG,SAAS,CAAC;QAEvB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,MAAM,IAAI,CAAC;gBAAE,MAAM;YACvB,IAAI,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,UAAU,KAAK,EAAE,EAAE,CAAC;gBACtE,IAAI,CAAC,CAAC,UAAU,IAAI,MAAM,EAAE,CAAC;oBAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBACtB,MAAM,IAAI,CAAC,CAAC,UAAU,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,0DAA0D;IAC1D,UAAU,CAAC,SAAiB;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACvC,CAAC;CACF"}

package/dist/tiers/entity.d.ts

@@ -0,0 +1,46 @@
+/**
+ * EntityMemory — Named-entity key-value facts stored as JSON-lines (Task 09)
+ *
+ * Uses a simple `.jsonl` file for persistence (no native dependencies).
+ * Each line is a JSON-serialised EntityFact. On mutation the full set is
+ * rewritten — acceptable for the expected cardinality of entity facts.
+ *
+ * @module v1/memory/tiers/entity
+ */
+export interface EntityFact {
+    entity: string;
+    factType: string;
+    value: string;
+    confidence: number;
+    sourceRunId: string;
+    createdAt: number;
+    expiresAt?: number;
+}
+export declare class EntityMemory {
+    private readonly dbPath;
+    constructor(dbPath: string);
+    /**
+     * Store (or upsert) a fact. If a fact with the same (entity, factType)
+     * already exists it is replaced.
+     */
+    store(fact: EntityFact): void;
+    /**
+     * Delete facts for an entity, optionally scoped to a factType.
+     * Returns the number of facts removed.
+     */
+    delete(entity: string, factType?: string): number;
+    /** Remove all facts whose expiresAt is in the past. */
+    pruneExpired(): number;
+    /**
+     * Retrieve all non-expired facts for an entity,
+     * sorted by confidence descending.
+     */
+    retrieve(entity: string): EntityFact[];
+    /** Return all non-expired facts of a given type. */
+    findByFactType(factType: string): EntityFact[];
+    /** No-op for file-based storage. */
+    close(): void;
+    private readAll;
+    private writeAll;
+}
+//# sourceMappingURL=entity.d.ts.map

package/dist/tiers/entity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity.d.ts","sourceRoot":"","sources":["../../src/tiers/entity.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAKH,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;gBAEpB,MAAM,EAAE,MAAM;IAW1B;;;OAGG;IACH,KAAK,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI;IAa7B;;;OAGG;IACH,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,MAAM;IAYjD,uDAAuD;IACvD,YAAY,IAAI,MAAM;IAatB;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU,EAAE;IAWtC,oDAAoD;IACpD,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,UAAU,EAAE;IAW9C,oCAAoC;IACpC,KAAK,IAAI,IAAI;IAMb,OAAO,CAAC,OAAO;IAUf,OAAO,CAAC,QAAQ;CAIjB"}

package/dist/tiers/entity.js

@@ -0,0 +1,106 @@
+/**
+ * EntityMemory — Named-entity key-value facts stored as JSON-lines (Task 09)
+ *
+ * Uses a simple `.jsonl` file for persistence (no native dependencies).
+ * Each line is a JSON-serialised EntityFact. On mutation the full set is
+ * rewritten — acceptable for the expected cardinality of entity facts.
+ *
+ * @module v1/memory/tiers/entity
+ */
+import { existsSync, readFileSync, writeFileSync, mkdirSync } from 'node:fs';
+import { dirname } from 'node:path';
+export class EntityMemory {
+    dbPath;
+    constructor(dbPath) {
+        this.dbPath = dbPath;
+        // Ensure parent directory exists
+        const dir = dirname(this.dbPath);
+        if (!existsSync(dir)) {
+            mkdirSync(dir, { recursive: true });
+        }
+    }
+    // ---- Mutation ----
+    /**
+     * Store (or upsert) a fact. If a fact with the same (entity, factType)
+     * already exists it is replaced.
+     */
+    store(fact) {
+        const all = this.readAll();
+        const idx = all.findIndex((f) => f.entity === fact.entity && f.factType === fact.factType);
+        if (idx >= 0) {
+            all[idx] = fact;
+        }
+        else {
+            all.push(fact);
+        }
+        this.writeAll(all);
+    }
+    /**
+     * Delete facts for an entity, optionally scoped to a factType.
+     * Returns the number of facts removed.
+     */
+    delete(entity, factType) {
+        const all = this.readAll();
+        const remaining = all.filter((f) => {
+            if (f.entity !== entity)
+                return true;
+            if (factType !== undefined && f.factType !== factType)
+                return true;
+            return false;
+        });
+        const removed = all.length - remaining.length;
+        if (removed > 0)
+            this.writeAll(remaining);
+        return removed;
+    }
+    /** Remove all facts whose expiresAt is in the past. */
+    pruneExpired() {
+        const now = Date.now();
+        const all = this.readAll();
+        const remaining = all.filter((f) => f.expiresAt === undefined || f.expiresAt > now);
+        const removed = all.length - remaining.length;
+        if (removed > 0)
+            this.writeAll(remaining);
+        return removed;
+    }
+    // ---- Retrieval ----
+    /**
+     * Retrieve all non-expired facts for an entity,
+     * sorted by confidence descending.
+     */
+    retrieve(entity) {
+        const now = Date.now();
+        return this.readAll()
+            .filter((f) => f.entity === entity &&
+            (f.expiresAt === undefined || f.expiresAt > now))
+            .sort((a, b) => b.confidence - a.confidence);
+    }
+    /** Return all non-expired facts of a given type. */
+    findByFactType(factType) {
+        const now = Date.now();
+        return this.readAll().filter((f) => f.factType === factType &&
+            (f.expiresAt === undefined || f.expiresAt > now));
+    }
+    // ---- Lifecycle ----
+    /** No-op for file-based storage. */
+    close() {
+        // intentionally empty
+    }
+    // ---- Private helpers ----
+    readAll() {
+        if (!existsSync(this.dbPath))
+            return [];
+        const raw = readFileSync(this.dbPath, 'utf-8').trim();
+        if (raw.length === 0)
+            return [];
+        return raw
+            .split('\n')
+            .filter(Boolean)
+            .map((line) => JSON.parse(line));
+    }
+    writeAll(facts) {
+        const data = facts.map((f) => JSON.stringify(f)).join('\n');
+        writeFileSync(this.dbPath, data.length > 0 ? data + '\n' : '', 'utf-8');
+    }
+}
+//# sourceMappingURL=entity.js.map

package/dist/tiers/entity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity.js","sourceRoot":"","sources":["../../src/tiers/entity.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAYpC,MAAM,OAAO,YAAY;IACN,MAAM,CAAS;IAEhC,YAAY,MAAc;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,iCAAiC;QACjC,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IAED,qBAAqB;IAErB;;;OAGG;IACH,KAAK,CAAC,IAAgB;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,GAAG,CAAC,SAAS,CACvB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAChE,CAAC;QACF,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;YACb,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,MAAc,EAAE,QAAiB;QACtC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACjC,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;gBAAE,OAAO,IAAI,CAAC;YACrC,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ;gBAAE,OAAO,IAAI,CAAC;YACnE,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;QAC9C,IAAI,OAAO,GAAG,CAAC;YAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,uDAAuD;IACvD,YAAY;QACV,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,CAC1B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,CACtD,CAAC;QACF,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;QAC9C,IAAI,OAAO,GAAG,CAAC;YAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,sBAAsB;IAEtB;;;OAGG;IACH,QAAQ,CAAC,MAAc;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC,OAAO,EAAE;aAClB,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,MAAM,KAAK,MAAM;YACnB,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CACnD;aACA,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IACjD,CAAC;IAED,oDAAoD;IACpD,cAAc,CAAC,QAAgB;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,MAAM,CAC1B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,QAAQ,KAAK,QAAQ;YACvB,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CACnD,CAAC;IACJ,CAAC;IAED,sBAAsB;IAEtB,oCAAoC;IACpC,KAAK;QACH,sBAAsB;IACxB,CAAC;IAED,4BAA4B;IAEpB,OAAO;QACb,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QACtD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAChC,OAAO,GAAG;aACP,KAAK,CAAC,IAAI,CAAC;aACX,MAAM,CAAC,OAAO,CAAC;aACf,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAe,CAAC,CAAC;IACnD,CAAC;IAEO,QAAQ,CAAC,KAAmB;QAClC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5D,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC1E,CAAC;CACF"}

package/dist/tiers/index.d.ts

@@ -0,0 +1,4 @@
+export { ShortTermMemory } from './short-term.js';
+export { EntityMemory, type EntityFact } from './entity.js';
+export { ContextualMemory, type SessionSummary } from './contextual.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/tiers/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/tiers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,KAAK,UAAU,EAAE,MAAM,aAAa,CAAC;AAC5D,OAAO,EAAE,gBAAgB,EAAE,KAAK,cAAc,EAAE,MAAM,iBAAiB,CAAC"}

package/dist/tiers/index.js

@@ -0,0 +1,4 @@
+export { ShortTermMemory } from './short-term.js';
+export { EntityMemory } from './entity.js';
+export { ContextualMemory } from './contextual.js';
+//# sourceMappingURL=index.js.map

package/dist/tiers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/tiers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAmB,MAAM,aAAa,CAAC;AAC5D,OAAO,EAAE,gBAAgB,EAAuB,MAAM,iBAAiB,CAAC"}

package/dist/tiers/short-term.d.ts

@@ -0,0 +1,42 @@
+/**
+ * ShortTermMemory — In-memory Map-based buffer (Task 09)
+ *
+ * Holds entries for the current run only. Supports FIFO eviction
+ * when capacity is exceeded and bulk flush to a long-term backend.
+ *
+ * @module v1/memory/tiers/short-term
+ */
+import type { MemoryEntry, IMemoryBackend } from '../types.js';
+export declare class ShortTermMemory {
+    /** Insertion-ordered map for FIFO eviction */
+    private buffer;
+    private readonly capacity;
+    constructor(capacity?: number);
+    /**
+     * Store an entry. If the buffer exceeds capacity the oldest entry
+     * (first inserted) is evicted.
+     */
+    store(entry: MemoryEntry): void;
+    retrieve(id: string): MemoryEntry | undefined;
+    /**
+     * Simple substring search across entry content and key fields.
+     * Returns up to `limit` matches ordered by most-recent insertion.
+     */
+    search(query: string, limit?: number): MemoryEntry[];
+    /**
+     * Return a stable copy of all currently buffered entries without mutating
+     * the buffer. Used by callers (e.g. TierManager) that need to process
+     * entries alongside a flush operation.
+     */
+    snapshot(): MemoryEntry[];
+    /**
+     * Promote all buffered entries to the given long-term backend,
+     * then clear the buffer. Returns the number of flushed entries.
+     */
+    flush(longTermStore: IMemoryBackend): Promise<number>;
+    /** Remove all entries from the buffer. */
+    clear(): void;
+    /** Current number of entries in the buffer. */
+    get size(): number;
+}
+//# sourceMappingURL=short-term.d.ts.map

package/dist/tiers/short-term.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"short-term.d.ts","sourceRoot":"","sources":["../../src/tiers/short-term.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAE/D,qBAAa,eAAe;IAC1B,8CAA8C;IAC9C,OAAO,CAAC,MAAM,CAAuC;IACrD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;gBAEtB,QAAQ,SAAM;IAM1B;;;OAGG;IACH,KAAK,CAAC,KAAK,EAAE,WAAW,GAAG,IAAI;IAmB/B,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAI7C;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,WAAW,EAAE;IAoBhD;;;;OAIG;IACH,QAAQ,IAAI,WAAW,EAAE;IAIzB;;;OAGG;IACG,KAAK,CAAC,aAAa,EAAE,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC;IAU3D,0CAA0C;IAC1C,KAAK,IAAI,IAAI;IAIb,+CAA+C;IAC/C,IAAI,IAAI,IAAI,MAAM,CAEjB;CACF"}