@monoes/memory 1.0.5 → 1.0.6

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"}

package/dist/tiers/entity.js

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

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

@@ -1,4 +0,0 @@
-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

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

@@ -1,4 +0,0 @@
-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

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

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

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

package/dist/tiers/short-term.js

@@ -1,90 +0,0 @@
-/**
- * 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
- */
-export class ShortTermMemory {
-    /** Insertion-ordered map for FIFO eviction */
-    buffer = new Map();
-    capacity;
-    constructor(capacity = 500) {
-        this.capacity = capacity;
-    }
-    // ---- Mutation ----
-    /**
-     * Store an entry. If the buffer exceeds capacity the oldest entry
-     * (first inserted) is evicted.
-     */
-    store(entry) {
-        // If key already exists, delete first so re-insertion moves it to end
-        if (this.buffer.has(entry.id)) {
-            this.buffer.delete(entry.id);
-        }
-        this.buffer.set(entry.id, entry);
-        // FIFO eviction — remove oldest entries until within capacity
-        while (this.buffer.size > this.capacity) {
-            const oldest = this.buffer.keys().next().value;
-            if (oldest !== undefined) {
-                this.buffer.delete(oldest);
-            }
-        }
-    }
-    // ---- Retrieval ----
-    retrieve(id) {
-        return this.buffer.get(id);
-    }
-    /**
-     * Simple substring search across entry content and key fields.
-     * Returns up to `limit` matches ordered by most-recent insertion.
-     */
-    search(query, limit = 10) {
-        const lowerQuery = query.toLowerCase();
-        const results = [];
-        // Iterate in reverse insertion order (newest first) without a full array copy
-        const entries = Array.from(this.buffer.values());
-        for (let i = entries.length - 1; i >= 0; i--) {
-            if (results.length >= limit)
-                break;
-            const entry = entries[i];
-            const haystack = `${entry.key} ${entry.content}`.toLowerCase();
-            if (haystack.includes(lowerQuery)) {
-                results.push(entry);
-            }
-        }
-        return results;
-    }
-    // ---- Lifecycle ----
-    /**
-     * 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() {
-        return Array.from(this.buffer.values());
-    }
-    /**
-     * Promote all buffered entries to the given long-term backend,
-     * then clear the buffer. Returns the number of flushed entries.
-     */
-    async flush(longTermStore) {
-        const entries = Array.from(this.buffer.values());
-        if (entries.length === 0)
-            return 0;
-        await longTermStore.bulkInsert(entries);
-        const count = entries.length;
-        this.buffer.clear();
-        return count;
-    }
-    /** Remove all entries from the buffer. */
-    clear() {
-        this.buffer.clear();
-    }
-    /** Current number of entries in the buffer. */
-    get size() {
-        return this.buffer.size;
-    }
-}
-//# sourceMappingURL=short-term.js.map

package/dist/tiers/short-term.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"short-term.js","sourceRoot":"","sources":["../../src/tiers/short-term.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,MAAM,OAAO,eAAe;IAC1B,8CAA8C;IACtC,MAAM,GAA6B,IAAI,GAAG,EAAE,CAAC;IACpC,QAAQ,CAAS;IAElC,YAAY,QAAQ,GAAG,GAAG;QACxB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED,qBAAqB;IAErB;;;OAGG;IACH,KAAK,CAAC,KAAkB;QACtB,sEAAsE;QACtE,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAEjC,8DAA8D;QAC9D,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IAED,sBAAsB;IAEtB,QAAQ,CAAC,EAAU;QACjB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAa,EAAE,KAAK,GAAG,EAAE;QAC9B,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QACvC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,8EAA8E;QAC9E,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,OAAO,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;YACnC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,QAAQ,GAAG,GAAG,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,WAAW,EAAE,CAAC;YAC/D,IAAI,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBAClC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,sBAAsB;IAEtB;;;;OAIG;IACH,QAAQ;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,KAAK,CAAC,aAA6B;QACvC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QACjD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEnC,MAAM,aAAa,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,0CAA0C;IAC1C,KAAK;QACH,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,+CAA+C;IAC/C,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC1B,CAAC;CACF"}