agentdb 3.1.0 → 3.3.0

package/dist/src/controllers/episode-hybrid.d.ts

@@ -0,0 +1,82 @@
+/**
+ * Hybrid (dense + BM25) episode retrieval for ReflexionMemory (ADR-016).
+ *
+ * Dense search alone misses episodes whose wording matches the query but whose embedding does not (names, error
+ * codes, numbers). This keeps a BM25 index over the most recent episodes, rebuilt only when the episodes table
+ * changes, and fuses its ranking with the dense ranking by reciprocal-rank fusion. On LongMemEval session retrieval
+ * (benchmarks/longmemeval, which runs these ranking functions over turn chunks, not the episode store), the same
+ * fusion lifts recall_all@5 over dense-only ranking of the same chunks from 0.883 to 0.900 (S) and from 0.630 to
+ * 0.719 (M), with the default MiniLM embedder. See ADR-016.
+ */
+import type { IDatabaseConnection } from '../types/database.types.js';
+/**
+ * Episodes indexed for BM25, newest first; older episodes are still found by dense search. The first search in a
+ * process builds the index (about 200 ms at 10k episodes, 1 s at 50k); later writes are appended incrementally.
+ */
+export declare const HYBRID_MAX_INDEXED: number;
+/** The candidate pool each side contributes before fusion. */
+export declare const HYBRID_MAX_POOL = 500;
+/** Weight of the BM25 ranking against the dense ranking. Equal weights won on LongMemEval_M; see ADR-016. */
+export declare const HYBRID_LEXICAL_WEIGHT = 1;
+interface EpisodeTextRow {
+    id: number;
+    task: string | null;
+    input: string | null;
+    output: string | null;
+    critique: string | null;
+}
+/**
+ * A BM25 index over episode text. New episodes are appended incrementally (the common write-then-read pattern);
+ * the index is rebuilt only when rows were deleted or replaced, or it has grown past 1.25x its cap.
+ */
+export declare class EpisodeLexicalIndex {
+    private readonly db;
+    private readonly maxDocs;
+    private count;
+    private maxId;
+    private ids;
+    private index;
+    constructor(db: IDatabaseConnection, maxDocs?: number);
+    private static textOf;
+    private refresh;
+    /**
+     * Apply an in-place edit of one episode without a rebuild. `before` must be the row as it was indexed.
+     * A no-op when the index is not built yet (the next search builds it from current rows) or the episode
+     * is outside the indexed window.
+     */
+    update(before: EpisodeTextRow, after: EpisodeTextRow): void;
+    /**
+     * Force a full rebuild on the next search. Needed after an in-place edit: an UPDATE changes
+     * neither COUNT(*) nor MAX(id), so refresh() alone would keep serving the old text.
+     */
+    invalidate(): void;
+    /** Episode ids with a BM25 match, best first, at most `limit`. */
+    search(query: string, limit: number): {
+        id: number;
+        score: number;
+    }[];
+}
+/**
+ * Weighted RRF scores of a dense ranking (best first) and a lexical ranking (best first) over episode ids.
+ * Episodes only in the lexical list are ranked just past the dense pool on the dense side.
+ */
+export declare function fuseEpisodeScores(denseIds: readonly number[], lexical: readonly {
+    id: number;
+}[], lexicalWeight?: number): Map<number, number>;
+/** Ids ordered by score, ties broken by dense order, then by newer id. */
+export declare function orderByScore(score: ReadonlyMap<number, number>, denseIds?: readonly number[]): number[];
+/** Fused ranking of episode ids, best first. */
+export declare function fuseEpisodeRankings(denseIds: readonly number[], lexical: readonly {
+    id: number;
+}[], lexicalWeight?: number): number[];
+/** Candidates the cross-encoder reads: the top `RERANK_DEPTH` of each ranking (the configuration benchmarked in ADR-016). */
+export declare const RERANK_DEPTH = 60;
+/** Weight of the cross-encoder rank in the fusion; best on LongMemEval_M (ADR-016). */
+export declare const RERANK_WEIGHT = 8;
+/**
+ * Adds `RERANK_WEIGHT`/(k + cross-encoder rank) to each candidate's fused score, in place. Candidates without text
+ * are skipped. Throws if the model cannot be loaded; the caller keeps the hybrid order.
+ */
+export declare function applyCrossEncoder(query: string, score: Map<number, number>, candidates: readonly number[], textOf: (id: number) => string | undefined, model?: string): Promise<void>;
+export {};
+//# sourceMappingURL=episode-hybrid.d.ts.map

package/dist/src/controllers/episode-hybrid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"episode-hybrid.d.ts","sourceRoot":"","sources":["../../../src/controllers/episode-hybrid.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAItE;;;GAGG;AACH,eAAO,MAAM,kBAAkB,QAA0E,CAAC;AAM1G,8DAA8D;AAC9D,eAAO,MAAM,eAAe,MAAM,CAAC;AACnC,6GAA6G;AAC7G,eAAO,MAAM,qBAAqB,IAAI,CAAC;AAGvC,UAAU,cAAc;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB;AAED;;;GAGG;AACH,qBAAa,mBAAmB;IAO5B,OAAO,CAAC,QAAQ,CAAC,EAAE;IACnB,OAAO,CAAC,QAAQ,CAAC,OAAO;IAP1B,OAAO,CAAC,KAAK,CAAM;IACnB,OAAO,CAAC,KAAK,CAAK;IAClB,OAAO,CAAC,GAAG,CAAgB;IAC3B,OAAO,CAAC,KAAK,CAA0B;gBAGpB,EAAE,EAAE,mBAAmB,EACvB,OAAO,SAAqB;IAG/C,OAAO,CAAC,MAAM,CAAC,MAAM;IAIrB,OAAO,CAAC,OAAO;IA4Bf;;;;OAIG;IACH,MAAM,CAAC,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,cAAc,GAAG,IAAI;IAO3D;;;OAGG;IACH,UAAU,IAAI,IAAI;IAOlB,kEAAkE;IAClE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE;CAStE;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,SAAS;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,EAAE,EAAE,aAAa,SAAwB,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAS7J;AAED,0EAA0E;AAC1E,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAE,SAAS,MAAM,EAAO,GAAG,MAAM,EAAE,CAM3G;AAED,gDAAgD;AAChD,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,SAAS;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,EAAE,EAAE,aAAa,SAAwB,GAAG,MAAM,EAAE,CAEpJ;AAED,6HAA6H;AAC7H,eAAO,MAAM,YAAY,KAAK,CAAC;AAC/B,uFAAuF;AACvF,eAAO,MAAM,aAAa,IAAI,CAAC;AAE/B;;;GAGG;AACH,wBAAsB,iBAAiB,CACrC,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1B,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,EAC1C,KAAK,CAAC,EAAE,MAAM,GACb,OAAO,CAAC,IAAI,CAAC,CAKf"}

package/dist/src/controllers/episode-hybrid.js

@@ -0,0 +1,140 @@
+import { Bm25Index, tokenize } from '../search/conversation-retrieval.js';
+import { crossEncoderScores } from '../search/cross-encoder.js';
+/**
+ * Episodes indexed for BM25, newest first; older episodes are still found by dense search. The first search in a
+ * process builds the index (about 200 ms at 10k episodes, 1 s at 50k); later writes are appended incrementally.
+ */
+export const HYBRID_MAX_INDEXED = clampInt(process.env.AGENTDB_HYBRID_MAX_EPISODES, 10_000, 1, 1_000_000);
+function clampInt(raw, fallback, min, max) {
+    const n = Math.floor(Number(raw));
+    return Number.isFinite(n) && n >= min ? Math.min(n, max) : fallback;
+}
+/** The candidate pool each side contributes before fusion. */
+export const HYBRID_MAX_POOL = 500;
+/** Weight of the BM25 ranking against the dense ranking. Equal weights won on LongMemEval_M; see ADR-016. */
+export const HYBRID_LEXICAL_WEIGHT = 1;
+const RRF_K = 60;
+/**
+ * A BM25 index over episode text. New episodes are appended incrementally (the common write-then-read pattern);
+ * the index is rebuilt only when rows were deleted or replaced, or it has grown past 1.25x its cap.
+ */
+export class EpisodeLexicalIndex {
+    db;
+    maxDocs;
+    count = -1;
+    maxId = 0;
+    ids = [];
+    index = null;
+    constructor(db, maxDocs = HYBRID_MAX_INDEXED) {
+        this.db = db;
+        this.maxDocs = maxDocs;
+    }
+    static textOf(r) {
+        return tokenize([r.task, r.input, r.output, r.critique].filter(Boolean).join('\n'));
+    }
+    refresh() {
+        const sig = this.db.prepare('SELECT COUNT(*) AS c, MAX(id) AS m FROM episodes').get();
+        const count = sig?.c ?? 0;
+        const maxId = sig?.m ?? 0;
+        if (this.index && count === this.count && maxId === this.maxId)
+            return;
+        if (this.index && count > this.count && maxId > this.maxId && this.ids.length < this.maxDocs * 1.25) {
+            const added = this.db
+                .prepare('SELECT id, task, input, output, critique FROM episodes WHERE id > ? ORDER BY id ASC')
+                .all(this.maxId);
+            if (this.count + added.length === count) {
+                for (const r of added) {
+                    this.index.add(EpisodeLexicalIndex.textOf(r));
+                    this.ids.push(r.id);
+                }
+                this.count = count;
+                this.maxId = maxId;
+                return;
+            }
+        }
+        const rows = this.db
+            .prepare('SELECT id, task, input, output, critique FROM episodes ORDER BY id DESC LIMIT ?')
+            .all(this.maxDocs);
+        this.index = new Bm25Index(rows.map(r => EpisodeLexicalIndex.textOf(r)));
+        this.ids = rows.map(r => r.id);
+        this.count = count;
+        this.maxId = maxId;
+    }
+    /**
+     * Apply an in-place edit of one episode without a rebuild. `before` must be the row as it was indexed.
+     * A no-op when the index is not built yet (the next search builds it from current rows) or the episode
+     * is outside the indexed window.
+     */
+    update(before, after) {
+        if (!this.index)
+            return;
+        const doc = this.ids.indexOf(before.id);
+        if (doc < 0)
+            return;
+        this.index.replace(doc, EpisodeLexicalIndex.textOf(before), EpisodeLexicalIndex.textOf(after));
+    }
+    /**
+     * Force a full rebuild on the next search. Needed after an in-place edit: an UPDATE changes
+     * neither COUNT(*) nor MAX(id), so refresh() alone would keep serving the old text.
+     */
+    invalidate() {
+        this.index = null;
+        this.ids = [];
+        this.count = -1;
+        this.maxId = 0;
+    }
+    /** Episode ids with a BM25 match, best first, at most `limit`. */
+    search(query, limit) {
+        this.refresh();
+        if (!this.index || this.ids.length === 0)
+            return [];
+        const scores = this.index.score(tokenize(query, 256));
+        const hits = [];
+        for (let i = 0; i < scores.length; i++)
+            if (scores[i] > 0)
+                hits.push({ id: this.ids[i], score: scores[i] });
+        hits.sort((a, z) => z.score - a.score || z.id - a.id);
+        return hits.slice(0, limit);
+    }
+}
+/**
+ * Weighted RRF scores of a dense ranking (best first) and a lexical ranking (best first) over episode ids.
+ * Episodes only in the lexical list are ranked just past the dense pool on the dense side.
+ */
+export function fuseEpisodeScores(denseIds, lexical, lexicalWeight = HYBRID_LEXICAL_WEIGHT) {
+    const score = new Map();
+    const denseMiss = denseIds.length + 1;
+    denseIds.forEach((id, r) => score.set(id, 1 / (RRF_K + r + 1)));
+    lexical.forEach(({ id }, r) => {
+        const base = score.get(id) ?? 1 / (RRF_K + denseMiss);
+        score.set(id, base + lexicalWeight / (RRF_K + r + 1));
+    });
+    return score;
+}
+/** Ids ordered by score, ties broken by dense order, then by newer id. */
+export function orderByScore(score, denseIds = []) {
+    const order = new Map();
+    denseIds.forEach((id, i) => order.set(id, i));
+    return [...score.entries()]
+        .sort((a, z) => z[1] - a[1] || (order.get(a[0]) ?? Infinity) - (order.get(z[0]) ?? Infinity) || z[0] - a[0])
+        .map(([id]) => id);
+}
+/** Fused ranking of episode ids, best first. */
+export function fuseEpisodeRankings(denseIds, lexical, lexicalWeight = HYBRID_LEXICAL_WEIGHT) {
+    return orderByScore(fuseEpisodeScores(denseIds, lexical, lexicalWeight), denseIds);
+}
+/** Candidates the cross-encoder reads: the top `RERANK_DEPTH` of each ranking (the configuration benchmarked in ADR-016). */
+export const RERANK_DEPTH = 60;
+/** Weight of the cross-encoder rank in the fusion; best on LongMemEval_M (ADR-016). */
+export const RERANK_WEIGHT = 8;
+/**
+ * Adds `RERANK_WEIGHT`/(k + cross-encoder rank) to each candidate's fused score, in place. Candidates without text
+ * are skipped. Throws if the model cannot be loaded; the caller keeps the hybrid order.
+ */
+export async function applyCrossEncoder(query, score, candidates, textOf, model) {
+    const ids = candidates.filter(id => score.has(id) && textOf(id));
+    const ce = await crossEncoderScores(query, ids.map(id => textOf(id)), model);
+    const byCe = ids.map((_, i) => i).sort((a, z) => ce[z] - ce[a] || a - z);
+    byCe.forEach((i, r) => score.set(ids[i], score.get(ids[i]) + RERANK_WEIGHT / (RRF_K + r + 1)));
+}
+//# sourceMappingURL=episode-hybrid.js.map

package/dist/src/controllers/episode-hybrid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"episode-hybrid.js","sourceRoot":"","sources":["../../../src/controllers/episode-hybrid.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,qCAAqC,CAAC;AAC1E,OAAO,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAEhE;;;GAGG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,2BAA2B,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;AAE1G,SAAS,QAAQ,CAAC,GAAuB,EAAE,QAAgB,EAAE,GAAW,EAAE,GAAW;IACnF,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;AACtE,CAAC;AACD,8DAA8D;AAC9D,MAAM,CAAC,MAAM,eAAe,GAAG,GAAG,CAAC;AACnC,6GAA6G;AAC7G,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC;AACvC,MAAM,KAAK,GAAG,EAAE,CAAC;AAUjB;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IAOX;IACA;IAPX,KAAK,GAAG,CAAC,CAAC,CAAC;IACX,KAAK,GAAG,CAAC,CAAC;IACV,GAAG,GAAa,EAAE,CAAC;IACnB,KAAK,GAAqB,IAAI,CAAC;IAEvC,YACmB,EAAuB,EACvB,UAAU,kBAAkB;QAD5B,OAAE,GAAF,EAAE,CAAqB;QACvB,YAAO,GAAP,OAAO,CAAqB;IAC5C,CAAC;IAEI,MAAM,CAAC,MAAM,CAAC,CAAiB;QACrC,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACtF,CAAC;IAEO,OAAO;QACb,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAkC,kDAAkD,CAAC,CAAC,GAAG,EAAE,CAAC;QACvH,MAAM,KAAK,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK;YAAE,OAAO;QACvE,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,EAAE,CAAC;YACpG,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE;iBAClB,OAAO,CAAiB,qFAAqF,CAAC;iBAC9G,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,KAAK,KAAK,EAAE,CAAC;gBACxC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;oBACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC9C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACtB,CAAC;gBACD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;gBACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;gBACnB,OAAO;YACT,CAAC;QACH,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CAAiB,iFAAiF,CAAC;aAC1G,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,MAAsB,EAAE,KAAqB;QAClD,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACxC,IAAI,GAAG,GAAG,CAAC;YAAE,OAAO;QACpB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,mBAAmB,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,mBAAmB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IACjG,CAAC;IAED;;;OAGG;IACH,UAAU;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,kEAAkE;IAClE,MAAM,CAAC,KAAa,EAAE,KAAa;QACjC,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QACtD,MAAM,IAAI,GAAoC,EAAE,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5G,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACtD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,QAA2B,EAAE,OAAkC,EAAE,aAAa,GAAG,qBAAqB;IACtI,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACtC,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC;QACtD,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,aAAa,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IACH,OAAO,KAAK,CAAC;AACf,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,YAAY,CAAC,KAAkC,EAAE,WAA8B,EAAE;IAC/F,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9C,OAAO,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;SACxB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3G,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;AACvB,CAAC;AAED,gDAAgD;AAChD,MAAM,UAAU,mBAAmB,CAAC,QAA2B,EAAE,OAAkC,EAAE,aAAa,GAAG,qBAAqB;IACxI,OAAO,YAAY,CAAC,iBAAiB,CAAC,QAAQ,EAAE,OAAO,EAAE,aAAa,CAAC,EAAE,QAAQ,CAAC,CAAC;AACrF,CAAC;AAED,6HAA6H;AAC7H,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC;AAC/B,uFAAuF;AACvF,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAE/B;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,KAAa,EACb,KAA0B,EAC1B,UAA6B,EAC7B,MAA0C,EAC1C,KAAc;IAEd,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,MAAM,EAAE,GAAG,MAAM,kBAAkB,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC9E,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACzE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAG,aAAa,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAClG,CAAC"}