@monoes/memory 1.0.0

package/dist/diskann-backend.d.ts

@@ -0,0 +1,126 @@
+/**
+ * DiskAnnBackend — SSD-resident ANN graph with in-memory compressed vectors
+ *
+ * Architecture (faithful to DiskANN / Vamana; source: arXiv:2305.04359):
+ *   (a) Adjacency-list graph persisted as a separate JSON file on disk
+ *       (NOT the SQLite rows — a distinct index artifact)
+ *   (b) Int8-quantised vectors kept in memory for fast candidate beam search
+ *       (scalar quantisation: float32 × 127 → int8, ~4× memory reduction)
+ *   (c) Full-precision re-ranking: for each beam candidate, load the original
+ *       Float32 embedding from the delegate backend and rescore with cosine
+ *
+ * This backend wraps any IMemoryBackend (delegate) and delegates all CRUD
+ * operations to it, overriding only `search()` with the DiskANN algorithm.
+ *
+ * @module v1/memory/diskann-backend
+ */
+import type { IMemoryBackend, MemoryEntry, MemoryEntryUpdate, MemoryQuery, SearchOptions, SearchResult, BackendStats, HealthCheckResult } from './types.js';
+export interface DiskAnnBackendConfig {
+    /**
+     * Filesystem path for the persisted adjacency-list graph file.
+     * Must be different from the delegate's database path.
+     */
+    graphPath: string;
+    /**
+     * Beam width (ef) — number of candidates to maintain during graph traversal.
+     * Higher values trade speed for recall. Default: 32.
+     */
+    beamWidth?: number;
+    /**
+     * Maximum outgoing edges per node (M). Default: 12.
+     */
+    maxConnections?: number;
+    /**
+     * How many beam candidates to fetch before full-precision re-ranking.
+     * Final result count is `k`; this is `k × rerankMultiplier`. Default: 3.
+     */
+    rerankMultiplier?: number;
+}
+/**
+ * DiskAnnBackend
+ *
+ * Wraps any IMemoryBackend and replaces the `search()` method with a three-phase
+ * DiskANN procedure:
+ *   1. Quantised beam search (Int8 dot products — fast, approximate)
+ *   2. Full-precision re-ranking (Float32 cosine from delegate.get())
+ *   3. Threshold filtering and top-k selection
+ *
+ * All other IMemoryBackend methods delegate directly to the inner backend.
+ */
+export declare class DiskAnnBackend implements IMemoryBackend {
+    private readonly delegate;
+    /** Adjacency list: nodeId → sorted neighbour IDs */
+    private readonly graph;
+    /**
+     * Int8 scalar-quantised embeddings for beam search.
+     * Kept entirely in memory — the critical DiskANN optimisation that avoids
+     * loading full-precision vectors during candidate generation.
+     */
+    private readonly qvecs;
+    /** Random walk entry point into the graph */
+    private entryPoint;
+    /** Whether the in-memory graph differs from the disk file */
+    private graphDirty;
+    private readonly graphPath;
+    private readonly beamWidth;
+    private readonly maxConnections;
+    private readonly rerankMultiplier;
+    constructor(delegate: IMemoryBackend, config: DiskAnnBackendConfig);
+    initialize(): Promise<void>;
+    shutdown(): Promise<void>;
+    store(entry: MemoryEntry): Promise<void>;
+    get(id: string): Promise<MemoryEntry | null>;
+    getByKey(namespace: string, key: string): Promise<MemoryEntry | null>;
+    update(id: string, update: MemoryEntryUpdate): Promise<MemoryEntry | null>;
+    delete(id: string): Promise<boolean>;
+    query(q: MemoryQuery): Promise<MemoryEntry[]>;
+    bulkInsert(entries: MemoryEntry[]): Promise<void>;
+    bulkDelete(ids: string[]): Promise<number>;
+    count(namespace?: string): Promise<number>;
+    listNamespaces(): Promise<string[]>;
+    clearNamespace(namespace: string): Promise<number>;
+    getStats(): Promise<BackendStats>;
+    healthCheck(): Promise<HealthCheckResult>;
+    /**
+     * Vector similarity search using the DiskANN beam algorithm.
+     *
+     * Phase (b): beam traversal over compressed Int8 vectors (fast, no I/O)
+     * Phase (c): full-precision cosine re-ranking via delegate.get() (accurate)
+     *
+     * Falls back to delegate.search() when no entries have been indexed yet.
+     */
+    search(queryVec: Float32Array, options: SearchOptions): Promise<SearchResult[]>;
+    /** Add or update a node in the in-memory ANN index */
+    private indexEntry;
+    /** Remove a node and all its references from the index */
+    private removeFromIndex;
+    /** Scan all existing qvecs and return the k nearest to `qvec` */
+    private greedyNearestNeighbors;
+    /**
+     * Beam search over the compressed-vector graph.
+     *
+     * Starts from `entryPoint`, expands neighbours BFS-style, and scores each
+     * visited node with Int8 dot products.  Returns up to `candidateCount` IDs
+     * sorted by descending similarity.
+     */
+    private beamSearch;
+    /** Scalar Int8 quantisation: float32 × 127 → clamped int8 */
+    private quantize;
+    /** Int8 dot product (used for beam search scoring) */
+    private dotProduct;
+    /** Full-precision cosine similarity (used for re-ranking) */
+    private cosine;
+    /**
+     * Load the persisted adjacency list from disk.
+     * Called during initialize(). A missing or corrupt file is silently ignored;
+     * the index will be rebuilt as entries are stored.
+     */
+    private loadGraph;
+    /**
+     * Persist the adjacency list to disk.
+     * Only writes when the graph has changed since the last persist.
+     * Errors are non-fatal; the graph will be rebuilt on next startup.
+     */
+    private persistGraph;
+}
+//# sourceMappingURL=diskann-backend.d.ts.map

package/dist/diskann-backend.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"diskann-backend.d.ts","sourceRoot":"","sources":["../src/diskann-backend.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAKH,OAAO,KAAK,EACV,cAAc,EACd,WAAW,EACX,iBAAiB,EACjB,WAAW,EACX,aAAa,EACb,YAAY,EACZ,YAAY,EACZ,iBAAiB,EAClB,MAAM,YAAY,CAAC;AAMpB,MAAM,WAAW,oBAAoB;IACnC;;;OAGG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;OAEG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB;;;OAGG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAiBD;;;;;;;;;;GAUG;AACH,qBAAa,cAAe,YAAW,cAAc;IAuBjD,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAtB3B,oDAAoD;IACpD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA+B;IAErD;;;;OAIG;IACH,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAgC;IAEtD,6CAA6C;IAC7C,OAAO,CAAC,UAAU,CAAqB;IAEvC,6DAA6D;IAC7D,OAAO,CAAC,UAAU,CAAS;IAE3B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;IACxC,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAS;gBAGvB,QAAQ,EAAE,cAAc,EACzC,MAAM,EAAE,oBAAoB;IAYxB,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAK3B,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IASzB,KAAK,CAAC,KAAK,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;IAKxC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAI5C,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAIrE,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,iBAAiB,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAI1E,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAMpC,KAAK,CAAC,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IAI7C,UAAU,CAAC,OAAO,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAKjD,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC;IAM1C,KAAK,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAI1C,cAAc,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAInC,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAUlD,QAAQ,IAAI,OAAO,CAAC,YAAY,CAAC;IAIjC,WAAW,IAAI,OAAO,CAAC,iBAAiB,CAAC;IAQ/C;;;;;;;OAOG;IACG,MAAM,CAAC,QAAQ,EAAE,YAAY,EAAE,OAAO,EAAE,aAAa,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IA+BrF,sDAAsD;IACtD,OAAO,CAAC,UAAU;IAsBlB,0DAA0D;IAC1D,OAAO,CAAC,eAAe;IAmBvB,iEAAiE;IACjE,OAAO,CAAC,sBAAsB;IAU9B;;;;;;OAMG;IACH,OAAO,CAAC,UAAU;IAkClB,6DAA6D;IAC7D,OAAO,CAAC,QAAQ;IAQhB,sDAAsD;IACtD,OAAO,CAAC,UAAU;IAOlB,6DAA6D;IAC7D,OAAO,CAAC,MAAM;IAgBd;;;;OAIG;YACW,SAAS;IAgBvB;;;;OAIG;YACW,YAAY;CAgB3B"}

package/dist/diskann-backend.js

@@ -0,0 +1,324 @@
+/**
+ * DiskAnnBackend — SSD-resident ANN graph with in-memory compressed vectors
+ *
+ * Architecture (faithful to DiskANN / Vamana; source: arXiv:2305.04359):
+ *   (a) Adjacency-list graph persisted as a separate JSON file on disk
+ *       (NOT the SQLite rows — a distinct index artifact)
+ *   (b) Int8-quantised vectors kept in memory for fast candidate beam search
+ *       (scalar quantisation: float32 × 127 → int8, ~4× memory reduction)
+ *   (c) Full-precision re-ranking: for each beam candidate, load the original
+ *       Float32 embedding from the delegate backend and rescore with cosine
+ *
+ * This backend wraps any IMemoryBackend (delegate) and delegates all CRUD
+ * operations to it, overriding only `search()` with the DiskANN algorithm.
+ *
+ * @module v1/memory/diskann-backend
+ */
+import { writeFile, readFile, mkdir } from 'node:fs/promises';
+import { existsSync } from 'node:fs';
+import { dirname } from 'node:path';
+// ============================================================
+// DiskAnnBackend
+// ============================================================
+/**
+ * DiskAnnBackend
+ *
+ * Wraps any IMemoryBackend and replaces the `search()` method with a three-phase
+ * DiskANN procedure:
+ *   1. Quantised beam search (Int8 dot products — fast, approximate)
+ *   2. Full-precision re-ranking (Float32 cosine from delegate.get())
+ *   3. Threshold filtering and top-k selection
+ *
+ * All other IMemoryBackend methods delegate directly to the inner backend.
+ */
+export class DiskAnnBackend {
+    delegate;
+    /** Adjacency list: nodeId → sorted neighbour IDs */
+    graph = new Map();
+    /**
+     * Int8 scalar-quantised embeddings for beam search.
+     * Kept entirely in memory — the critical DiskANN optimisation that avoids
+     * loading full-precision vectors during candidate generation.
+     */
+    qvecs = new Map();
+    /** Random walk entry point into the graph */
+    entryPoint;
+    /** Whether the in-memory graph differs from the disk file */
+    graphDirty = false;
+    graphPath;
+    beamWidth;
+    maxConnections;
+    rerankMultiplier;
+    constructor(delegate, config) {
+        this.delegate = delegate;
+        this.graphPath = config.graphPath;
+        this.beamWidth = config.beamWidth ?? 32;
+        this.maxConnections = config.maxConnections ?? 12;
+        this.rerankMultiplier = config.rerankMultiplier ?? 3;
+    }
+    // ----------------------------------------------------------------
+    // Lifecycle
+    // ----------------------------------------------------------------
+    async initialize() {
+        await this.delegate.initialize();
+        await this.loadGraph();
+    }
+    async shutdown() {
+        await this.persistGraph();
+        await this.delegate.shutdown();
+    }
+    // ----------------------------------------------------------------
+    // CRUD — fully delegated
+    // ----------------------------------------------------------------
+    async store(entry) {
+        await this.delegate.store(entry);
+        this.indexEntry(entry);
+    }
+    async get(id) {
+        return this.delegate.get(id);
+    }
+    async getByKey(namespace, key) {
+        return this.delegate.getByKey(namespace, key);
+    }
+    async update(id, update) {
+        return this.delegate.update(id, update);
+    }
+    async delete(id) {
+        const ok = await this.delegate.delete(id);
+        if (ok)
+            this.removeFromIndex(id);
+        return ok;
+    }
+    async query(q) {
+        return this.delegate.query(q);
+    }
+    async bulkInsert(entries) {
+        await this.delegate.bulkInsert(entries);
+        for (const e of entries)
+            this.indexEntry(e);
+    }
+    async bulkDelete(ids) {
+        const n = await this.delegate.bulkDelete(ids);
+        for (const id of ids)
+            this.removeFromIndex(id);
+        return n;
+    }
+    async count(namespace) {
+        return this.delegate.count(namespace);
+    }
+    async listNamespaces() {
+        return this.delegate.listNamespaces();
+    }
+    async clearNamespace(namespace) {
+        const n = await this.delegate.clearNamespace(namespace);
+        // Rebuild index — we don't track namespace per node
+        this.graph.clear();
+        this.qvecs.clear();
+        this.entryPoint = undefined;
+        this.graphDirty = true;
+        return n;
+    }
+    async getStats() {
+        return this.delegate.getStats();
+    }
+    async healthCheck() {
+        return this.delegate.healthCheck();
+    }
+    // ----------------------------------------------------------------
+    // search() — DiskANN three-phase algorithm
+    // ----------------------------------------------------------------
+    /**
+     * Vector similarity search using the DiskANN beam algorithm.
+     *
+     * Phase (b): beam traversal over compressed Int8 vectors (fast, no I/O)
+     * Phase (c): full-precision cosine re-ranking via delegate.get() (accurate)
+     *
+     * Falls back to delegate.search() when no entries have been indexed yet.
+     */
+    async search(queryVec, options) {
+        if (this.qvecs.size === 0) {
+            return this.delegate.search(queryVec, options);
+        }
+        const k = options.k;
+        const threshold = options.threshold ?? 0;
+        // Phase (b): beam search with Int8-quantised vectors
+        const qQuery = this.quantize(queryVec);
+        const candidateIds = this.beamSearch(qQuery, k * this.rerankMultiplier);
+        // Phase (c): full-precision re-ranking by loading embeddings from disk/delegate
+        const results = [];
+        for (const id of candidateIds) {
+            const entry = await this.delegate.get(id);
+            if (!entry?.embedding)
+                continue;
+            const score = this.cosine(queryVec, entry.embedding);
+            if (score >= threshold) {
+                results.push({ entry, score, distance: 1 - score });
+            }
+        }
+        results.sort((a, b) => b.score - a.score);
+        return results.slice(0, k);
+    }
+    // ----------------------------------------------------------------
+    // Index management (private)
+    // ----------------------------------------------------------------
+    /** Add or update a node in the in-memory ANN index */
+    indexEntry(entry) {
+        if (!entry.embedding)
+            return;
+        const qvec = this.quantize(entry.embedding);
+        this.qvecs.set(entry.id, qvec);
+        // Greedy M-nearest-neighbour insertion (O(n) scan over compressed vectors)
+        const neighbors = this.greedyNearestNeighbors(entry.id, qvec, this.maxConnections);
+        this.graph.set(entry.id, neighbors);
+        // Add reverse edges (backlinks) — keep outdegree bounded
+        for (const nid of neighbors) {
+            const nEdges = this.graph.get(nid) ?? [];
+            if (!nEdges.includes(entry.id) && nEdges.length < this.maxConnections * 2) {
+                this.graph.set(nid, [...nEdges, entry.id]);
+            }
+        }
+        if (!this.entryPoint)
+            this.entryPoint = entry.id;
+        this.graphDirty = true;
+    }
+    /** Remove a node and all its references from the index */
+    removeFromIndex(id) {
+        this.qvecs.delete(id);
+        const neighbors = this.graph.get(id) ?? [];
+        this.graph.delete(id);
+        // Remove backreferences from neighbours
+        for (const nid of neighbors) {
+            const edges = this.graph.get(nid);
+            if (edges) {
+                this.graph.set(nid, edges.filter(e => e !== id));
+            }
+        }
+        if (this.entryPoint === id) {
+            this.entryPoint = this.graph.keys().next().value;
+        }
+        this.graphDirty = true;
+    }
+    /** Scan all existing qvecs and return the k nearest to `qvec` */
+    greedyNearestNeighbors(excludeId, qvec, k) {
+        const scored = [];
+        for (const [id, vec] of this.qvecs) {
+            if (id === excludeId)
+                continue;
+            scored.push({ id, score: this.dotProduct(qvec, vec) });
+        }
+        scored.sort((a, b) => b.score - a.score);
+        return scored.slice(0, k).map(s => s.id);
+    }
+    /**
+     * Beam search over the compressed-vector graph.
+     *
+     * Starts from `entryPoint`, expands neighbours BFS-style, and scores each
+     * visited node with Int8 dot products.  Returns up to `candidateCount` IDs
+     * sorted by descending similarity.
+     */
+    beamSearch(qQuery, candidateCount) {
+        if (!this.entryPoint || this.qvecs.size === 0)
+            return [];
+        const visited = new Set();
+        const scored = [];
+        const frontier = [this.entryPoint];
+        visited.add(this.entryPoint);
+        const maxVisit = Math.min(this.beamWidth * 4, this.qvecs.size);
+        while (frontier.length > 0 && visited.size <= maxVisit) {
+            const current = frontier.shift();
+            const qvec = this.qvecs.get(current);
+            if (!qvec)
+                continue;
+            scored.push({ id: current, score: this.dotProduct(qQuery, qvec) });
+            // Expand graph neighbours
+            for (const nid of (this.graph.get(current) ?? [])) {
+                if (!visited.has(nid)) {
+                    visited.add(nid);
+                    frontier.push(nid);
+                }
+            }
+        }
+        scored.sort((a, b) => b.score - a.score);
+        return scored.slice(0, candidateCount).map(s => s.id);
+    }
+    // ----------------------------------------------------------------
+    // Quantisation and distance helpers
+    // ----------------------------------------------------------------
+    /** Scalar Int8 quantisation: float32 × 127 → clamped int8 */
+    quantize(vec) {
+        const q = new Int8Array(vec.length);
+        for (let i = 0; i < vec.length; i++) {
+            q[i] = Math.max(-127, Math.min(127, Math.round(vec[i] * 127)));
+        }
+        return q;
+    }
+    /** Int8 dot product (used for beam search scoring) */
+    dotProduct(a, b) {
+        const len = Math.min(a.length, b.length);
+        let sum = 0;
+        for (let i = 0; i < len; i++)
+            sum += a[i] * b[i];
+        return sum;
+    }
+    /** Full-precision cosine similarity (used for re-ranking) */
+    cosine(a, b) {
+        const len = Math.min(a.length, b.length);
+        let dot = 0, normA = 0, normB = 0;
+        for (let i = 0; i < len; i++) {
+            dot += a[i] * b[i];
+            normA += a[i] * a[i];
+            normB += b[i] * b[i];
+        }
+        const denom = Math.sqrt(normA) * Math.sqrt(normB);
+        return denom === 0 ? 0 : dot / denom;
+    }
+    // ----------------------------------------------------------------
+    // Disk persistence (graph adjacency list only — NOT the entry data)
+    // ----------------------------------------------------------------
+    /**
+     * Load the persisted adjacency list from disk.
+     * Called during initialize(). A missing or corrupt file is silently ignored;
+     * the index will be rebuilt as entries are stored.
+     */
+    async loadGraph() {
+        if (!existsSync(this.graphPath))
+            return;
+        try {
+            const raw = await readFile(this.graphPath, 'utf8');
+            const data = JSON.parse(raw);
+            this.graph.clear();
+            for (const [id, neighbors] of data.graph) {
+                this.graph.set(id, neighbors);
+            }
+            this.entryPoint = data.entryPoint;
+            this.graphDirty = false;
+        }
+        catch {
+            // Corrupt file — start with empty graph
+        }
+    }
+    /**
+     * Persist the adjacency list to disk.
+     * Only writes when the graph has changed since the last persist.
+     * Errors are non-fatal; the graph will be rebuilt on next startup.
+     */
+    async persistGraph() {
+        if (!this.graphDirty)
+            return;
+        try {
+            await mkdir(dirname(this.graphPath), { recursive: true });
+            const data = {
+                graph: [...this.graph.entries()],
+                entryPoint: this.entryPoint,
+                nodeCount: this.graph.size,
+                savedAt: Date.now(),
+            };
+            await writeFile(this.graphPath, JSON.stringify(data), 'utf8');
+            this.graphDirty = false;
+        }
+        catch {
+            // Non-fatal — graph will be rebuilt on next startup
+        }
+    }
+}
+//# sourceMappingURL=diskann-backend.js.map

package/dist/diskann-backend.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diskann-backend.js","sourceRoot":"","sources":["../src/diskann-backend.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAoDpC,+DAA+D;AAC/D,iBAAiB;AACjB,+DAA+D;AAE/D;;;;;;;;;;GAUG;AACH,MAAM,OAAO,cAAc;IAuBN;IAtBnB,oDAAoD;IACnC,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAErD;;;;OAIG;IACc,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;IAEtD,6CAA6C;IACrC,UAAU,CAAqB;IAEvC,6DAA6D;IACrD,UAAU,GAAG,KAAK,CAAC;IAEV,SAAS,CAAS;IAClB,SAAS,CAAS;IAClB,cAAc,CAAS;IACvB,gBAAgB,CAAS;IAE1C,YACmB,QAAwB,EACzC,MAA4B;QADX,aAAQ,GAAR,QAAQ,CAAgB;QAGzC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,EAAE,CAAC;QACxC,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,IAAI,EAAE,CAAC;QAClD,IAAI,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,IAAI,CAAC,CAAC;IACvD,CAAC;IAED,mEAAmE;IACnE,YAAY;IACZ,mEAAmE;IAEnE,KAAK,CAAC,UAAU;QACd,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,CAAC;QACjC,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,QAAQ;QACZ,MAAM,IAAI,CAAC,YAAY,EAAE,CAAC;QAC1B,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC;IACjC,CAAC;IAED,mEAAmE;IACnE,yBAAyB;IACzB,mEAAmE;IAEnE,KAAK,CAAC,KAAK,CAAC,KAAkB;QAC5B,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,EAAU;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,SAAiB,EAAE,GAAW;QAC3C,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,EAAU,EAAE,MAAyB;QAChD,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IAC1C,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,EAAU;QACrB,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,EAAE;YAAE,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QACjC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,CAAc;QACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,OAAsB;QACrC,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,GAAa;QAC5B,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAC9C,KAAK,MAAM,EAAE,IAAI,GAAG;YAAE,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QAC/C,OAAO,CAAC,CAAC;IACX,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,SAAkB;QAC5B,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,cAAc;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,SAAiB;QACpC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QACxD,oDAAoD;QACpD,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,KAAK,CAAC,QAAQ;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC;IAClC,CAAC;IAED,KAAK,CAAC,WAAW;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;IACrC,CAAC;IAED,mEAAmE;IACnE,2CAA2C;IAC3C,mEAAmE;IAEnE;;;;;;;OAOG;IACH,KAAK,CAAC,MAAM,CAAC,QAAsB,EAAE,OAAsB;QACzD,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACjD,CAAC;QAED,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpB,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;QAEzC,qDAAqD;QACrD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAExE,gFAAgF;QAChF,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1C,IAAI,CAAC,KAAK,EAAE,SAAS;gBAAE,SAAS;YAChC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YACrD,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,mEAAmE;IACnE,6BAA6B;IAC7B,mEAAmE;IAEnE,sDAAsD;IAC9C,UAAU,CAAC,KAAkB;QACnC,IAAI,CAAC,KAAK,CAAC,SAAS;YAAE,OAAO;QAE7B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAE/B,2EAA2E;QAC3E,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QACnF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAEpC,yDAAyD;QACzD,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACzC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,cAAc,GAAG,CAAC,EAAE,CAAC;gBAC1E,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,EAAE,CAAC;QACjD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;IACzB,CAAC;IAED,0DAA0D;IAClD,eAAe,CAAC,EAAU;QAChC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC3C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAEtB,wCAAwC;QACxC,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,UAAU,KAAK,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAA2B,CAAC;QACzE,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;IACzB,CAAC;IAED,iEAAiE;IACzD,sBAAsB,CAAC,SAAiB,EAAE,IAAe,EAAE,CAAS;QAC1E,MAAM,MAAM,GAAyC,EAAE,CAAC;QACxD,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACnC,IAAI,EAAE,KAAK,SAAS;gBAAE,SAAS;YAC/B,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QACzD,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;OAMG;IACK,UAAU,CAAC,MAAiB,EAAE,cAAsB;QAC1D,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEzD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAyC,EAAE,CAAC;QACxD,MAAM,QAAQ,GAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC7C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE7B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAE/D,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,IAAI,IAAI,QAAQ,EAAE,CAAC;YACvD,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,EAAG,CAAC;YAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YAEnE,0BAA0B;YAC1B,KAAK,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACtB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACjB,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC;IAED,mEAAmE;IACnE,oCAAoC;IACpC,mEAAmE;IAEnE,6DAA6D;IACrD,QAAQ,CAAC,GAAiB;QAChC,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,sDAAsD;IAC9C,UAAU,CAAC,CAAY,EAAE,CAAY;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,6DAA6D;IACrD,MAAM,CAAC,CAAe,EAAE,CAAe;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,GAAG,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;IACvC,CAAC;IAED,mEAAmE;IACnE,oEAAoE;IACpE,mEAAmE;IAEnE;;;;OAIG;IACK,KAAK,CAAC,SAAS;QACrB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC;YAAE,OAAO;QACxC,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YACnD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAmB,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;YAChC,CAAC;YACD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;YAClC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,wCAAwC;QAC1C,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,YAAY;QACxB,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,OAAO;QAC7B,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC1D,MAAM,IAAI,GAAmB;gBAC3B,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;gBAChC,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;gBAC1B,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;aACpB,CAAC;YACF,MAAM,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;YAC9D,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,oDAAoD;QACtD,CAAC;IACH,CAAC;CACF"}

package/dist/episodic-store.d.ts

@@ -0,0 +1,58 @@
+/**
+ * EpisodicStore — JSON-lines file-based episodic memory.
+ *
+ * Stores episodes as one JSON object per line in a .jsonl file,
+ * following the same pattern as CostTracker and SwarmCheckpointer.
+ *
+ * @module v1/memory/episodic-store
+ */
+import type { Episode, EpisodicStoreConfig } from './types.js';
+/**
+ * Accumulates agent runs into episodes and persists them as JSON-lines.
+ */
+export declare class EpisodicStore {
+    private readonly filePath;
+    private readonly maxRunsPerEpisode;
+    private readonly summarizer;
+    private currentEpisodeId;
+    private currentSessionId;
+    private currentRunIds;
+    private currentAgentSlugs;
+    private currentTaskTypes;
+    private currentContent;
+    private currentStartedAt;
+    constructor(config: EpisodicStoreConfig);
+    /** Read all episodes from the JSONL file (oldest-first). */
+    readAll(): Episode[];
+    /** Append a single episode to the file. */
+    private append;
+    /**
+     * Add a run to the current episode. Starts a new episode if none is open.
+     * Auto-closes the episode when maxRunsPerEpisode is reached.
+     *
+     * @returns The closed Episode if auto-close triggered, otherwise null.
+     */
+    addRun(runId: string, agentSlug: string, taskType: string, content: string, sessionId?: string): Promise<Episode | null>;
+    /**
+     * Close the current episode, persist it, and return it.
+     * Returns null if there is no open episode.
+     */
+    closeEpisode(): Promise<Episode | null>;
+    /**
+     * Simple substring search on episode summaries.
+     */
+    search(query: string, maxEpisodes?: number): Episode[];
+    /**
+     * Retrieve an episode by its ID.
+     */
+    getById(episodeId: string): Episode | undefined;
+    /**
+     * List all episodes for a given session.
+     */
+    listBySession(sessionId: string): Episode[];
+    /**
+     * Check whether an episode is currently open.
+     */
+    hasOpenEpisode(): boolean;
+}
+//# sourceMappingURL=episodic-store.d.ts.map

package/dist/episodic-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"episodic-store.d.ts","sourceRoot":"","sources":["../src/episodic-store.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAKH,OAAO,KAAK,EAAE,OAAO,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAS/D;;GAEG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAS;IAC3C,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAuC;IAGlE,OAAO,CAAC,gBAAgB,CAAuB;IAC/C,OAAO,CAAC,gBAAgB,CAAc;IACtC,OAAO,CAAC,aAAa,CAAgB;IACrC,OAAO,CAAC,iBAAiB,CAA0B;IACnD,OAAO,CAAC,gBAAgB,CAA0B;IAClD,OAAO,CAAC,cAAc,CAAgB;IACtC,OAAO,CAAC,gBAAgB,CAAa;gBAEzB,MAAM,EAAE,mBAAmB;IAgBvC,4DAA4D;IAC5D,OAAO,IAAI,OAAO,EAAE;IAUpB,2CAA2C;IAC3C,OAAO,CAAC,MAAM;IAQd;;;;;OAKG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC;IA8B1B;;;OAGG;IACG,YAAY,IAAI,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC;IAkC7C;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,GAAE,MAAW,GAAG,OAAO,EAAE;IAQ1D;;OAEG;IACH,OAAO,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS;IAK/C;;OAEG;IACH,aAAa,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,EAAE;IAK3C;;OAEG;IACH,cAAc,IAAI,OAAO;CAG1B"}