@monoes/memory 1.0.4 → 1.0.6

package/dist/procedural/skill-registry.js

@@ -1,56 +0,0 @@
-/**
- * SkillRegistry — JSONL-backed registry for learned skills.
- *
- * Part of Task 45 — Procedural Memory.
- */
-import { appendFileSync, readFileSync, writeFileSync, existsSync, mkdirSync } from 'fs';
-import { dirname } from 'path';
-export class SkillRegistry {
-    filePath;
-    constructor(filePath) {
-        this.filePath = filePath;
-        const dir = dirname(filePath);
-        if (!existsSync(dir)) {
-            mkdirSync(dir, { recursive: true });
-        }
-    }
-    /** Register a new learned skill */
-    register(skill) {
-        appendFileSync(this.filePath, JSON.stringify(skill) + '\n', 'utf-8');
-    }
-    /** List all registered skills */
-    list() {
-        if (!existsSync(this.filePath))
-            return [];
-        const content = readFileSync(this.filePath, 'utf-8').trim();
-        if (!content)
-            return [];
-        return content.split('\n').filter(Boolean).map((line) => JSON.parse(line));
-    }
-    /** Get a skill by ID */
-    get(skillId) {
-        return this.list().find((s) => s.skillId === skillId);
-    }
-    /**
-     * Find a skill that matches the same fingerprint (agentSlug + tool sequence).
-     * Fingerprint = agentSlug + sorted tool names joined by " -> ".
-     */
-    findByFingerprint(skill) {
-        const fp = this.buildFingerprint(skill);
-        return this.list().find((s) => this.buildFingerprint(s) === fp);
-    }
-    /** Update a skill by ID (rewrites the entire file) */
-    update(skillId, updated) {
-        const all = this.list();
-        const idx = all.findIndex((s) => s.skillId === skillId);
-        if (idx === -1)
-            return;
-        all[idx] = updated;
-        writeFileSync(this.filePath, all.map((s) => JSON.stringify(s)).join('\n') + '\n', 'utf-8');
-    }
-    buildFingerprint(skill) {
-        const toolChain = skill.actionSequence.map((a) => a.toolName).join(' -> ');
-        return `${skill.agentSlug}::${toolChain}`;
-    }
-}
-//# sourceMappingURL=skill-registry.js.map

package/dist/procedural/skill-registry.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"skill-registry.js","sourceRoot":"","sources":["../../src/procedural/skill-registry.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AACxF,OAAO,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AAG/B,MAAM,OAAO,aAAa;IAChB,QAAQ,CAAS;IAEzB,YAAY,QAAgB;QAC1B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC9B,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,mCAAmC;IACnC,QAAQ,CAAC,KAAmB;QAC1B,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC;IACvE,CAAC;IAED,iCAAiC;IACjC,IAAI;QACF,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,OAAO,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5D,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QACxB,OAAO,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAiB,CAAC,CAAC;IAC7F,CAAC;IAED,wBAAwB;IACxB,GAAG,CAAC,OAAe;QACjB,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;IACxD,CAAC;IAED;;;OAGG;IACH,iBAAiB,CAAC,KAAmB;QACnC,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,sDAAsD;IACtD,MAAM,CAAC,OAAe,EAAE,OAAqB;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;QACxD,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO;QACvB,GAAG,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;QACnB,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC;IAC7F,CAAC;IAEO,gBAAgB,CAAC,KAAmB;QAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3E,OAAO,GAAG,KAAK,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;IAC5C,CAAC;CACF"}

package/dist/procedural/types.d.ts

@@ -1,67 +0,0 @@
-/**
- * Procedural Memory Types
- *
- * Types for learning from successful agent executions.
- * Part of Task 45 — Procedural Memory.
- */
-/** Outcome of a single tool action */
-export type ActionOutcome = 'success' | 'failure' | 'partial';
-/** A single recorded action within an agent run */
-export interface ActionRecord {
-    recordId: string;
-    runId: string;
-    agentId: string;
-    agentSlug: string;
-    toolName: string;
-    toolInput: Record<string, unknown>;
-    toolOutput?: string;
-    outcome: ActionOutcome;
-    durationMs: number;
-    qualityScore?: number;
-    timestamp: string;
-}
-/** Configuration for extracting learned skills from action records */
-export interface ExtractionConfig {
-    /** Minimum number of successful occurrences before extraction (default 3) */
-    minSuccessCount: number;
-    /** Minimum average quality score threshold (default 0.75) */
-    minAvgQualityScore: number;
-    /** Maximum actions in a sequence (default 12) */
-    maxSequenceLength: number;
-    /** How far back to look in days (default 30) */
-    lookbackDays: number;
-    /** Minimum similarity for grouping sequences (default 0.85) */
-    minSimilarityForGrouping: number;
-}
-/** Default extraction configuration */
-export declare const DEFAULT_EXTRACTION_CONFIG: ExtractionConfig;
-/** Trigger condition for a learned skill */
-export interface SkillTrigger {
-    pattern: string;
-    mode: 'exact' | 'semantic';
-    minConfidence: number;
-}
-/** A learned skill extracted from repeated successful executions */
-export interface LearnedSkill {
-    skillId: string;
-    name: string;
-    agentSlug: string;
-    trigger: SkillTrigger;
-    actionSequence: ActionRecord[];
-    successCount: number;
-    avgQualityScore: number;
-    sourceRunIds: string[];
-    createdAt: string;
-    lastUpdatedAt: string;
-    version: number;
-}
-/** A group of similar action sequences discovered by the extractor */
-export interface ActionSequenceGroup {
-    agentSlug: string;
-    fingerprint: string;
-    sequences: ActionRecord[][];
-    successCount: number;
-    avgQualityScore: number;
-    runIds: string[];
-}
-//# sourceMappingURL=types.d.ts.map

package/dist/procedural/types.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/procedural/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,sCAAsC;AACtC,MAAM,MAAM,aAAa,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;AAE9D,mDAAmD;AACnD,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACnC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,aAAa,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,sEAAsE;AACtE,MAAM,WAAW,gBAAgB;IAC/B,6EAA6E;IAC7E,eAAe,EAAE,MAAM,CAAC;IACxB,6DAA6D;IAC7D,kBAAkB,EAAE,MAAM,CAAC;IAC3B,iDAAiD;IACjD,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gDAAgD;IAChD,YAAY,EAAE,MAAM,CAAC;IACrB,+DAA+D;IAC/D,wBAAwB,EAAE,MAAM,CAAC;CAClC;AAED,uCAAuC;AACvC,eAAO,MAAM,yBAAyB,EAAE,gBAMvC,CAAC;AAEF,4CAA4C;AAC5C,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,OAAO,GAAG,UAAU,CAAC;IAC3B,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,oEAAoE;AACpE,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,YAAY,CAAC;IACtB,cAAc,EAAE,YAAY,EAAE,CAAC;IAC/B,YAAY,EAAE,MAAM,CAAC;IACrB,eAAe,EAAE,MAAM,CAAC;IACxB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,sEAAsE;AACtE,MAAM,WAAW,mBAAmB;IAClC,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,YAAY,EAAE,EAAE,CAAC;IAC5B,YAAY,EAAE,MAAM,CAAC;IACrB,eAAe,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB"}

package/dist/procedural/types.js

@@ -1,15 +0,0 @@
-/**
- * Procedural Memory Types
- *
- * Types for learning from successful agent executions.
- * Part of Task 45 — Procedural Memory.
- */
-/** Default extraction configuration */
-export const DEFAULT_EXTRACTION_CONFIG = {
-    minSuccessCount: 3,
-    minAvgQualityScore: 0.75,
-    maxSequenceLength: 12,
-    lookbackDays: 30,
-    minSimilarityForGrouping: 0.85,
-};
-//# sourceMappingURL=types.js.map

package/dist/procedural/types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/procedural/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAkCH,uCAAuC;AACvC,MAAM,CAAC,MAAM,yBAAyB,GAAqB;IACzD,eAAe,EAAE,CAAC;IAClB,kBAAkB,EAAE,IAAI;IACxB,iBAAiB,EAAE,EAAE;IACrB,YAAY,EAAE,EAAE;IAChB,wBAAwB,EAAE,IAAI;CAC/B,CAAC"}

package/dist/tier-manager.d.ts

@@ -1,79 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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;IAmD/D;;;;;;;;OAQG;IACH,OAAO,CAAC,MAAM,CAAC,SAAS;IAYxB;;;;;OAKG;IACG,cAAc,IAAI,OAAO,CAAC,MAAM,CAAC;CAUxC"}

package/dist/tier-manager.js

@@ -1,173 +0,0 @@
-/**
- * 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
-        // Iterate each source directly to avoid allocating a combined array and to
-        // enable early-exit between sources once the limit is reached.
-        const seen = new Set();
-        const merged = [];
-        outer: for (const batch of [partitionedResults, shortResults, longResults, annEntries]) {
-            for (const entry of batch) {
-                if (!seen.has(entry.id)) {
-                    seen.add(entry.id);
-                    merged.push(entry);
-                }
-                if (merged.length >= limit)
-                    break outer;
-            }
-        }
-        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

@@ -1 +0,0 @@
-{"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,2EAA2E;QAC3E,+DAA+D;QAC/D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,MAAM,GAAkB,EAAE,CAAC;QAEjC,KAAK,EAAE,KAAK,MAAM,KAAK,IAAI,CAAC,kBAAkB,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,CAAC,EAAE,CAAC;YACvF,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;oBACxB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrB,CAAC;gBACD,IAAI,MAAM,CAAC,MAAM,IAAI,KAAK;oBAAE,MAAM,KAAK,CAAC;YAC1C,CAAC;QACH,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

@@ -1,45 +0,0 @@
-/**
- * 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;
-    /** Cached newest-first sorted summary list. Invalidated on store. */
-    private sortedCache;
-    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

@@ -1 +0,0 @@
-{"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;IAQzB,OAAO,CAAC,QAAQ,CAAC,OAAO;IAP1B,OAAO,CAAC,SAAS,CAA0C;IAC3D,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,MAAM,CAAS;IACvB,qEAAqE;IACrE,OAAO,CAAC,WAAW,CAAiC;gBAGjC,OAAO,EAAE,cAAc,EACxC,SAAS,SAAyB;IAKpC;;;;OAIG;IACG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IA8B3B;;;OAGG;IACG,YAAY,CAAC,OAAO,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IAsB1D;;;;OAIG;IACG,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,SAAO,GAAG,OAAO,CAAC,MAAM,CAAC;IA0BvE,0DAA0D;IAC1D,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;CAG1D"}

package/dist/tiers/contextual.js

@@ -1,109 +0,0 @@
-/**
- * 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;
-    /** Cached newest-first sorted summary list. Invalidated on store. */
-    sortedCache = null;
-    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,
-                });
-            }
-            this.sortedCache = null;
-        }
-        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);
-        this.sortedCache = null; // invalidate sort cache
-        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();
-        if (!this.sortedCache) {
-            this.sortedCache = Array.from(this.summaries.values()).sort((a, b) => b.createdAt - a.createdAt);
-        }
-        const sorted = this.sortedCache;
-        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

@@ -1 +0,0 @@
-{"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;IAQR;IAPX,SAAS,GAAgC,IAAI,GAAG,EAAE,CAAC;IAC1C,SAAS,CAAS;IAC3B,MAAM,GAAG,KAAK,CAAC;IACvB,qEAAqE;IAC7D,WAAW,GAA4B,IAAI,CAAC;IAEpD,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;YACD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QAC1B,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;QAC/C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC,wBAAwB;QAEjD,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,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CACzD,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CACpC,CAAC;QACJ,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC;QAEhC,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

@@ -1,46 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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"}