kagent-ts 0.1.3 → 0.1.5

package/dist/rag/keyword-index.js

@@ -0,0 +1,161 @@
+"use strict";
+/**
+ * In-memory BM25 keyword index.
+ *
+ * Builds an inverted index from chunk text during indexing and scores
+ * documents against queries using the standard BM25 formula:
+ *
+ *   score(D, Q) = Σ IDF(qᵢ) · (f(qᵢ, D) · (k1+1)) / (f(qᵢ, D) + k1·(1 − b + b·|D|/avgdl))
+ *
+ * where:
+ *   f(qᵢ, D) = term frequency of query term qᵢ in document D
+ *   |D|       = document length (token count)
+ *   avgdl     = average document length across the corpus
+ *   k1        = term saturation parameter (default: 1.5)
+ *   b         = length normalization parameter (default: 0.75)
+ *   IDF(qᵢ)   = log((N − n(qᵢ) + 0.5) / (n(qᵢ) + 0.5) + 1)
+ *
+ * Zero external dependencies — pure TypeScript implementation suitable
+ * for knowledge bases up to ~10K chunks.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.InMemoryKeywordIndex = void 0;
+// ─── Tokenizer ──────────────────────────────────────────────────────────────
+/**
+ * Simple multilingual tokenizer.
+ *
+ * Splits on word boundaries (Unicode-aware via lookbehind/lookahead for CJK
+ * characters, plus standard whitespace/punctuation splitting for Latin text).
+ */
+function tokenize(text) {
+    const tokens = [];
+    // Insert spaces around CJK characters so they split into individual tokens,
+    // then split on non-word characters.
+    const spaced = text
+        .replace(/[一-鿿㐀-䶿]/g, " $& ")
+        .replace(/[぀-ゟ゠-ヿ]/g, " $& ") // Hiragana + Katakana
+        .replace(/[가-힯]/g, " $& ") // Hangul
+        .toLowerCase();
+    for (const token of spaced.split(/[^a-z0-9一-鿿㐀-䶿぀-ゟ゠-ヿ가-힯_]+/)) {
+        const t = token.trim();
+        if (t.length > 0)
+            tokens.push(t);
+    }
+    return tokens;
+}
+// ─── BM25 Parameters ────────────────────────────────────────────────────────
+const BM25_K1 = 1.5;
+const BM25_B = 0.75;
+// ─── InMemoryKeywordIndex ────────────────────────────────────────────────────
+class InMemoryKeywordIndex {
+    /** invertedIndex: word → Map<chunkId → term frequency> */
+    invertedIndex = new Map();
+    /** IDF values: word → idf */
+    idfValues = new Map();
+    /** Document lengths: chunkId → token count */
+    docLengths = new Map();
+    /** Average document length across the corpus. */
+    avgDocLength = 0;
+    /** Total number of indexed chunks. */
+    totalDocs = 0;
+    /** All chunks indexed (for retrieval). chunkId → RAGChunk */
+    chunks = new Map();
+    /** Next chunkId. */
+    nextId = 0;
+    // ─── Write ──────────────────────────────────────────────────────────────
+    /**
+     * Add chunks to the keyword index.
+     * Recomputes IDF and avgDocLength incrementally.
+     */
+    add(newChunks) {
+        for (const chunk of newChunks) {
+            const id = this.nextId++;
+            this.chunks.set(id, chunk);
+            const tokens = tokenize(chunk.text);
+            this.docLengths.set(id, tokens.length);
+            const tf = new Map();
+            for (const token of tokens) {
+                tf.set(token, (tf.get(token) || 0) + 1);
+            }
+            for (const [word, count] of tf) {
+                let posting = this.invertedIndex.get(word);
+                if (!posting) {
+                    posting = new Map();
+                    this.invertedIndex.set(word, posting);
+                }
+                posting.set(id, count);
+            }
+        }
+        this.recomputeStats();
+    }
+    // ─── Read ───────────────────────────────────────────────────────────────
+    /**
+     * Search for the top-K chunks matching the query using BM25 scoring.
+     */
+    search(query, topK) {
+        const queryTokens = tokenize(query);
+        if (queryTokens.length === 0 || this.totalDocs === 0)
+            return [];
+        // Aggregate BM25 scores: chunkId → score
+        const scores = new Map();
+        for (const token of queryTokens) {
+            const posting = this.invertedIndex.get(token);
+            if (!posting)
+                continue;
+            const idf = this.idfValues.get(token) || 0;
+            for (const [docId, tf] of posting) {
+                const docLen = this.docLengths.get(docId) || 1;
+                const numerator = tf * (BM25_K1 + 1);
+                const denominator = tf + BM25_K1 * (1 - BM25_B + BM25_B * (docLen / this.avgDocLength));
+                const score = idf * (numerator / denominator);
+                scores.set(docId, (scores.get(docId) || 0) + score);
+            }
+        }
+        // Sort by score descending, take top-K
+        const ranked = Array.from(scores.entries())
+            .sort((a, b) => b[1] - a[1])
+            .slice(0, topK);
+        // Map back to BM25Result
+        return ranked
+            .map(([docId, score]) => {
+            const chunk = this.chunks.get(docId);
+            if (!chunk)
+                return null;
+            return { chunk, score };
+        })
+            .filter((r) => r !== null);
+    }
+    // ─── State ──────────────────────────────────────────────────────────────
+    get size() {
+        return this.totalDocs;
+    }
+    clear() {
+        this.invertedIndex.clear();
+        this.idfValues.clear();
+        this.docLengths.clear();
+        this.chunks.clear();
+        this.avgDocLength = 0;
+        this.totalDocs = 0;
+        this.nextId = 0;
+    }
+    // ─── Stats ──────────────────────────────────────────────────────────────
+    recomputeStats() {
+        this.totalDocs = this.chunks.size;
+        // Average doc length
+        let totalLen = 0;
+        for (const len of this.docLengths.values()) {
+            totalLen += len;
+        }
+        this.avgDocLength = this.totalDocs > 0 ? totalLen / this.totalDocs : 1;
+        // IDF
+        this.idfValues.clear();
+        for (const [word, posting] of this.invertedIndex) {
+            const n = posting.size; // number of docs containing this word
+            // Smooth IDF: log((N - n + 0.5) / (n + 0.5) + 1)
+            const idf = Math.log((this.totalDocs - n + 0.5) / (n + 0.5) + 1);
+            this.idfValues.set(word, idf);
+        }
+    }
+}
+exports.InMemoryKeywordIndex = InMemoryKeywordIndex;
+//# sourceMappingURL=keyword-index.js.map

package/dist/rag/keyword-index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"keyword-index.js","sourceRoot":"","sources":["../../src/rag/keyword-index.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;GAkBG;;;AAWH,+EAA+E;AAE/E;;;;;GAKG;AACH,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,4EAA4E;IAC5E,qCAAqC;IACrC,MAAM,MAAM,GAAG,IAAI;SAChB,OAAO,CAAC,WAAW,EAAE,MAAM,CAAC;SAC5B,OAAO,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,sBAAsB;SACnD,OAAO,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,SAAS;SACnC,WAAW,EAAE,CAAC;IAEjB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,4BAA4B,CAAC,EAAE,CAAC;QAC/D,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAE/E,MAAM,OAAO,GAAG,GAAG,CAAC;AACpB,MAAM,MAAM,GAAG,IAAI,CAAC;AAEpB,gFAAgF;AAEhF,MAAa,oBAAoB;IAC/B,0DAA0D;IAClD,aAAa,GAAG,IAAI,GAAG,EAA+B,CAAC;IAE/D,6BAA6B;IACrB,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE9C,8CAA8C;IACtC,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE/C,iDAAiD;IACzC,YAAY,GAAG,CAAC,CAAC;IAEzB,sCAAsC;IAC9B,SAAS,GAAG,CAAC,CAAC;IAEtB,6DAA6D;IACrD,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE7C,oBAAoB;IACZ,MAAM,GAAG,CAAC,CAAC;IAEnB,2EAA2E;IAE3E;;;OAGG;IACH,GAAG,CAAC,SAAqB;QACvB,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC9B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAE3B,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;YAEvC,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;YACrC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,CAAC;YAED,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC/B,IAAI,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC3C,IAAI,CAAC,OAAO,EAAE,CAAC;oBACb,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;oBACpB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBACxC,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,cAAc,EAAE,CAAC;IACxB,CAAC;IAED,2EAA2E;IAE3E;;OAEG;IACH,MAAM,CAAC,KAAa,EAAE,IAAY;QAChC,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEhE,yCAAyC;QACzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEzC,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YAChC,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,OAAO;gBAAE,SAAS;YAEvB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAE3C,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC;gBAClC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/C,MAAM,SAAS,GAAG,EAAE,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;gBACrC,MAAM,WAAW,GAAG,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;gBACxF,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,SAAS,GAAG,WAAW,CAAC,CAAC;gBAE9C,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;aACxC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAElB,yBAAyB;QACzB,OAAO,MAAM;aACV,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE;YACtB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,CAAC,KAAK;gBAAE,OAAO,IAAI,CAAC;YACxB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QAC1B,CAAC,CAAC;aACD,MAAM,CAAC,CAAC,CAAC,EAAmB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAChD,CAAC;IAED,2EAA2E;IAE3E,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,2EAA2E;IAEnE,cAAc;QACpB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;QAElC,qBAAqB;QACrB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,QAAQ,IAAI,GAAG,CAAC;QAClB,CAAC;QACD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAEvE,MAAM;QACN,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACjD,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,sCAAsC;YAC9D,iDAAiD;YACjD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACjE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;CACF;AAtID,oDAsIC"}

package/dist/rag/llm-reranker.d.ts

@@ -0,0 +1,36 @@
+/**
+ * LLM-based re-ranker for retrieved results.
+ *
+ * Uses an LLM (via the framework's LLMProvider interface) to re-score
+ * candidate chunks against the original query. This is a simple, zero-new-
+ * dependency alternative to a dedicated Cross-Encoder model.
+ *
+ * For production use with high throughput, consider replacing this with
+ * a dedicated rerank API (Cohere, Jina, Voyage AI) or a locally-hosted
+ * Cross-Encoder model (e.g., BAAI/bge-reranker-v2-m3 via ONNX).
+ */
+import type { ReRanker, RAGSearchResult } from "./rag-types";
+import type { LLMProvider } from "../llm/interface";
+export interface LLMReRankerConfig {
+    /** The LLM provider to use for scoring. */
+    llm: LLMProvider;
+    /**
+     * Maximum candidates to send to the LLM in one re-rank request.
+     * Default: 20. More candidates = better comparison but higher cost.
+     */
+    maxCandidates?: number;
+    /**
+     * Model to use (overrides the LLM provider's default model).
+     * Useful for using a cheaper/faster model for re-ranking.
+     */
+    model?: string;
+}
+export declare class LLMReRanker implements ReRanker {
+    private llm;
+    private maxCandidates;
+    constructor(config: LLMReRankerConfig);
+    rerank(query: string, results: RAGSearchResult[]): Promise<RAGSearchResult[]>;
+    private buildPrompt;
+    private parseScores;
+}
+//# sourceMappingURL=llm-reranker.d.ts.map

package/dist/rag/llm-reranker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"llm-reranker.d.ts","sourceRoot":"","sources":["../../src/rag/llm-reranker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAMpD,MAAM,WAAW,iBAAiB;IAChC,2CAA2C;IAC3C,GAAG,EAAE,WAAW,CAAC;IAEjB;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAID,qBAAa,WAAY,YAAW,QAAQ;IAC1C,OAAO,CAAC,GAAG,CAAc;IACzB,OAAO,CAAC,aAAa,CAAS;gBAElB,MAAM,EAAE,iBAAiB;IAK/B,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,EAAE,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IAsCnF,OAAO,CAAC,WAAW;IA2BnB,OAAO,CAAC,WAAW;CAgBpB"}

package/dist/rag/llm-reranker.js

@@ -0,0 +1,95 @@
+"use strict";
+/**
+ * LLM-based re-ranker for retrieved results.
+ *
+ * Uses an LLM (via the framework's LLMProvider interface) to re-score
+ * candidate chunks against the original query. This is a simple, zero-new-
+ * dependency alternative to a dedicated Cross-Encoder model.
+ *
+ * For production use with high throughput, consider replacing this with
+ * a dedicated rerank API (Cohere, Jina, Voyage AI) or a locally-hosted
+ * Cross-Encoder model (e.g., BAAI/bge-reranker-v2-m3 via ONNX).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LLMReRanker = void 0;
+const types_1 = require("../messages/types");
+// ─── LLMReRanker ─────────────────────────────────────────────────────────────
+class LLMReRanker {
+    llm;
+    maxCandidates;
+    constructor(config) {
+        this.llm = config.llm;
+        this.maxCandidates = config.maxCandidates ?? 20;
+    }
+    async rerank(query, results) {
+        if (results.length <= 1)
+            return results;
+        // Limit candidates to avoid huge prompts
+        const candidates = results.slice(0, this.maxCandidates);
+        const prompt = this.buildPrompt(query, candidates);
+        const messages = [
+            { role: types_1.Role.User, content: prompt },
+        ];
+        const response = await this.llm.chat(messages);
+        const content = response.content ?? "";
+        // Parse scores from the LLM response
+        const scores = this.parseScores(content, candidates.length);
+        // Apply scores to results
+        const reranked = [];
+        for (let i = 0; i < candidates.length; i++) {
+            reranked.push({
+                chunk: candidates[i].chunk,
+                score: scores?.[i] ?? candidates[i].score,
+            });
+        }
+        // Append any overflow results with original scores
+        for (let i = this.maxCandidates; i < results.length; i++) {
+            reranked.push({ ...results[i] });
+        }
+        // Sort by new score descending
+        reranked.sort((a, b) => b.score - a.score);
+        return reranked;
+    }
+    // ─── Prompt ──────────────────────────────────────────────────────────────
+    buildPrompt(query, results) {
+        const docs = results.map((r, i) => `[${i}] ${r.chunk.text.slice(0, 500)}`).join("\n\n");
+        return [
+            `You are a relevance scoring assistant. Given a query and a list of ${results.length} document snippets, score each snippet's relevance to the query on a scale of 0–10 (integer).`,
+            "",
+            "Rules:",
+            "- 0 = completely irrelevant",
+            "- 10 = perfectly answers the query",
+            "- Score based on factual relevance, not just keyword overlap",
+            "",
+            `Query: ${query}`,
+            "",
+            "Documents:",
+            docs,
+            "",
+            `Output ONLY a JSON array of ${results.length} integers in order [score_0, score_1, ..., score_${results.length - 1}].`,
+            "Example output: [8, 3, 0, 10, 5]",
+            "",
+            "Scores:",
+        ].join("\n");
+    }
+    // ─── Parsing ─────────────────────────────────────────────────────────────
+    parseScores(raw, expectedCount) {
+        // Try to extract a JSON array from the response
+        const match = raw.match(/\[[\d,\s]+\]/);
+        if (!match)
+            return null;
+        try {
+            const arr = JSON.parse(match[0]);
+            if (!Array.isArray(arr) || arr.length === 0)
+                return null;
+            // Normalize to [0, 1]
+            const normalized = arr.map((n) => Math.max(0, Math.min(1, Number(n) / 10)));
+            return normalized;
+        }
+        catch {
+            return null;
+        }
+    }
+}
+exports.LLMReRanker = LLMReRanker;
+//# sourceMappingURL=llm-reranker.js.map

package/dist/rag/llm-reranker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"llm-reranker.js","sourceRoot":"","sources":["../../src/rag/llm-reranker.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;AAKH,6CAAyC;AAqBzC,gFAAgF;AAEhF,MAAa,WAAW;IACd,GAAG,CAAc;IACjB,aAAa,CAAS;IAE9B,YAAY,MAAyB;QACnC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC,aAAa,IAAI,EAAE,CAAC;IAClD,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,OAA0B;QACpD,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,OAAO,CAAC;QAExC,yCAAyC;QACzC,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QAExD,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAkB;YAC9B,EAAE,IAAI,EAAE,YAAI,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE;SACrC,CAAC;QAEF,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,IAAI,EAAE,CAAC;QAEvC,qCAAqC;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QAE5D,0BAA0B;QAC1B,MAAM,QAAQ,GAAsB,EAAE,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,QAAQ,CAAC,IAAI,CAAC;gBACZ,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK;gBAC1B,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK;aAC1C,CAAC,CAAC;QACL,CAAC;QAED,mDAAmD;QACnD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnC,CAAC;QAED,+BAA+B;QAC/B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC3C,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,4EAA4E;IAEpE,WAAW,CAAC,KAAa,EAAE,OAA0B;QAC3D,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAChC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CACvC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEf,OAAO;YACL,sEAAsE,OAAO,CAAC,MAAM,+FAA+F;YACnL,EAAE;YACF,QAAQ;YACR,6BAA6B;YAC7B,oCAAoC;YACpC,8DAA8D;YAC9D,EAAE;YACF,UAAU,KAAK,EAAE;YACjB,EAAE;YACF,YAAY;YACZ,IAAI;YACJ,EAAE;YACF,+BAA+B,OAAO,CAAC,MAAM,oDAAoD,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI;YACvH,kCAAkC;YAClC,EAAE;YACF,SAAS;SACV,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;IAED,4EAA4E;IAEpE,WAAW,CAAC,GAAW,EAAE,aAAqB;QACpD,gDAAgD;QAChD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;QAExB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAa,CAAC;YAC7C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YAEzD,sBAAsB;YACtB,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5E,OAAO,UAAU,CAAC;QACpB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;CACF;AA1FD,kCA0FC"}

package/dist/rag/rag-manager.d.ts

@@ -0,0 +1,54 @@
+/**
+ * RAG Manager — orchestrates document loading, embedding, and search.
+ *
+ * Lifecycle:
+ *   1. `index()` — load documents from `documentsDir`, chunk, embed, store.
+ *   2. `search(query, topK)` — embed query, search vector store, return results.
+ *   3. `clear()` — wipe all indexed data.
+ *
+ * Owned by the main Agent; created during `Agent.init()` when `rag` config
+ * is present.
+ */
+import type { RAGConfig, RAGSearchResult } from "./rag-types";
+import { Logger } from "../logging/logger";
+export declare class RAGManager {
+    private config;
+    private store;
+    private keywordIndex?;
+    private reRanker?;
+    private logger;
+    private documents;
+    private _indexed;
+    constructor(config: RAGConfig, logger?: Logger);
+    /** Whether the index has been built. */
+    get indexed(): boolean;
+    /** Number of chunks in the store. */
+    get chunkCount(): number;
+    /** Number of documents loaded. */
+    get documentCount(): number;
+    /** List of indexed document paths. */
+    get documentPaths(): string[];
+    /**
+     * Load documents, generate embeddings, and populate the vector store.
+     *
+     * Idempotent — if already indexed, calling again clears and rebuilds.
+     */
+    index(): Promise<void>;
+    /**
+     * Search the knowledge base for chunks relevant to the query.
+     *
+     * In hybrid mode (hybridSearch: true), runs both vector similarity and
+     * BM25 keyword search in parallel, then merges results via RRF.
+     *
+     * @param query Natural-language search query.
+     * @param topK  Number of results to return (overrides config default).
+     */
+    search(query: string, topK?: number): Promise<RAGSearchResult[]>;
+    /**
+     * Format search results for injection into the LLM context.
+     */
+    formatResults(results: RAGSearchResult[]): string;
+    /** Clear all indexed data. */
+    clear(): Promise<void>;
+}
+//# sourceMappingURL=rag-manager.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rag-manager.d.ts","sourceRoot":"","sources":["../../src/rag/rag-manager.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EACV,SAAS,EAET,eAAe,EAGhB,MAAM,aAAa,CAAC;AAKrB,OAAO,EAAE,MAAM,EAAiB,MAAM,mBAAmB,CAAC;AAE1D,qBAAa,UAAU;IACrB,OAAO,CAAC,MAAM,CAAY;IAC1B,OAAO,CAAC,KAAK,CAAc;IAC3B,OAAO,CAAC,YAAY,CAAC,CAAuB;IAC5C,OAAO,CAAC,QAAQ,CAAC,CAAW;IAC5B,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,SAAS,CAAqB;IACtC,OAAO,CAAC,QAAQ,CAAS;gBAEb,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,MAAM;IAiB9C,wCAAwC;IACxC,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,qCAAqC;IACrC,IAAI,UAAU,IAAI,MAAM,CAEvB;IAED,kCAAkC;IAClC,IAAI,aAAa,IAAI,MAAM,CAE1B;IAED,sCAAsC;IACtC,IAAI,aAAa,IAAI,MAAM,EAAE,CAE5B;IAED;;;;OAIG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAuD5B;;;;;;;;OAQG;IACG,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IAqDtE;;OAEG;IACH,aAAa,CAAC,OAAO,EAAE,eAAe,EAAE,GAAG,MAAM;IAkBjD,8BAA8B;IACxB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAM7B"}

package/dist/rag/rag-manager.js

@@ -0,0 +1,179 @@
+"use strict";
+/**
+ * RAG Manager — orchestrates document loading, embedding, and search.
+ *
+ * Lifecycle:
+ *   1. `index()` — load documents from `documentsDir`, chunk, embed, store.
+ *   2. `search(query, topK)` — embed query, search vector store, return results.
+ *   3. `clear()` — wipe all indexed data.
+ *
+ * Owned by the main Agent; created during `Agent.init()` when `rag` config
+ * is present.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RAGManager = void 0;
+const document_loader_1 = require("./document-loader");
+const vector_store_1 = require("./vector-store");
+const keyword_index_1 = require("./keyword-index");
+const rrf_1 = require("./rrf");
+const logger_1 = require("../logging/logger");
+class RAGManager {
+    config;
+    store;
+    keywordIndex;
+    reRanker;
+    logger;
+    documents = [];
+    _indexed = false;
+    constructor(config, logger) {
+        this.config = {
+            chunkSize: 1000,
+            chunkOverlap: 200,
+            topK: 5,
+            ...config,
+        };
+        this.store = config.store ?? new vector_store_1.InMemoryVectorStore();
+        if (this.config.hybridSearch) {
+            this.keywordIndex = new keyword_index_1.InMemoryKeywordIndex();
+        }
+        this.reRanker = config.reRanker;
+        this.logger = logger ?? new logger_1.ConsoleLogger();
+    }
+    // ─── Public API ──────────────────────────────────────────────────────────
+    /** Whether the index has been built. */
+    get indexed() {
+        return this._indexed;
+    }
+    /** Number of chunks in the store. */
+    get chunkCount() {
+        return this.store.size;
+    }
+    /** Number of documents loaded. */
+    get documentCount() {
+        return this.documents.length;
+    }
+    /** List of indexed document paths. */
+    get documentPaths() {
+        return this.documents.map((d) => d.path);
+    }
+    /**
+     * Load documents, generate embeddings, and populate the vector store.
+     *
+     * Idempotent — if already indexed, calling again clears and rebuilds.
+     */
+    async index() {
+        await this.clear();
+        this.logger.info("RAG", `Loading documents from "${this.config.documentsDir}"...`);
+        this.documents = (0, document_loader_1.loadDocuments)(this.config.documentsDir, this.config.chunkSize, this.config.chunkOverlap);
+        if (this.documents.length === 0) {
+            this.logger.warn("RAG", `No supported documents found in "${this.config.documentsDir}".`);
+            this._indexed = true;
+            return;
+        }
+        const allChunks = this.documents.flatMap((d) => d.chunks);
+        this.logger.info("RAG", `Loaded ${this.documents.length} document(s), ${allChunks.length} chunk(s).`);
+        if (allChunks.length === 0) {
+            this._indexed = true;
+            return;
+        }
+        // Generate embeddings in batches
+        this.logger.info("RAG", `Generating embeddings (model: ${this.config.embeddingProvider.model})...`);
+        const texts = allChunks.map((c) => c.text);
+        const batchSize = 20;
+        const embeddings = [];
+        for (let i = 0; i < texts.length; i += batchSize) {
+            const batch = texts.slice(i, i + batchSize);
+            const batchEmbeddings = await this.config.embeddingProvider.embed(batch);
+            embeddings.push(...batchEmbeddings);
+        }
+        // Attach embeddings to chunks
+        for (let i = 0; i < allChunks.length; i++) {
+            allChunks[i].embedding = embeddings[i];
+        }
+        await this.store.add(allChunks);
+        // Build keyword index for hybrid search (BM25)
+        if (this.keywordIndex) {
+            this.keywordIndex.add(allChunks);
+        }
+        this.logger.info("RAG", `Indexing complete — ${this.store.size} chunk(s) in vector store${this.keywordIndex ? `, ${this.keywordIndex.size} in keyword index` : ""}.`);
+        this._indexed = true;
+    }
+    /**
+     * Search the knowledge base for chunks relevant to the query.
+     *
+     * In hybrid mode (hybridSearch: true), runs both vector similarity and
+     * BM25 keyword search in parallel, then merges results via RRF.
+     *
+     * @param query Natural-language search query.
+     * @param topK  Number of results to return (overrides config default).
+     */
+    async search(query, topK) {
+        if (!this._indexed || this.store.size === 0) {
+            return [];
+        }
+        const k = topK ?? this.config.topK ?? 5;
+        // Fetch extra candidates when re-ranking so the re-ranker has more to work with
+        const fetchFactor = this.reRanker ? (this.config.hybridRetrievalFactor ?? 3) : 1;
+        let results;
+        // ── Hybrid mode: vector + BM25 → RRF fusion ──────────────────────
+        if (this.keywordIndex) {
+            const fetchK = k * fetchFactor;
+            const [queryEmbedding] = await this.config.embeddingProvider.embed([query]);
+            const [vectorResults, bm25Results] = await Promise.all([
+                this.store.search(queryEmbedding, fetchK),
+                this.keywordIndex.search(query, fetchK),
+            ]);
+            const vecRanking = vectorResults.map((r) => ({
+                chunk: r.chunk,
+                score: r.score,
+            }));
+            const bm25Ranking = bm25Results.map((r) => ({
+                chunk: r.chunk,
+                score: r.score,
+            }));
+            const fused = (0, rrf_1.rrfFusion)([vecRanking, bm25Ranking], 60, fetchK);
+            results = fused.map((f) => ({
+                chunk: f.chunk,
+                score: f.rrfScore,
+            }));
+        }
+        else {
+            // ── Pure vector mode ─────────────────────────────────────────
+            const fetchK = k * fetchFactor;
+            const [queryEmbedding] = await this.config.embeddingProvider.embed([query]);
+            results = await this.store.search(queryEmbedding, fetchK);
+        }
+        // ── Re-rank (optional) ────────────────────────────────────────────
+        if (this.reRanker && results.length > 0) {
+            results = await this.reRanker.rerank(query, results);
+        }
+        // Take final top-K
+        return results.slice(0, k);
+    }
+    /**
+     * Format search results for injection into the LLM context.
+     */
+    formatResults(results) {
+        if (results.length === 0) {
+            return "No relevant documents found in the knowledge base.";
+        }
+        const lines = [];
+        lines.push(`Found ${results.length} relevant document chunk(s):\n`);
+        for (let i = 0; i < results.length; i++) {
+            const r = results[i];
+            lines.push(`### [${i + 1}] ${r.chunk.sourcePath} (chunk ${r.chunk.chunkIndex + 1}, score: ${r.score.toFixed(3)})`);
+            lines.push(r.chunk.text);
+            lines.push("");
+        }
+        return lines.join("\n");
+    }
+    /** Clear all indexed data. */
+    async clear() {
+        await this.store.clear();
+        this.keywordIndex?.clear();
+        this.documents = [];
+        this._indexed = false;
+    }
+}
+exports.RAGManager = RAGManager;
+//# sourceMappingURL=rag-manager.js.map

package/dist/rag/rag-manager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rag-manager.js","sourceRoot":"","sources":["../../src/rag/rag-manager.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;AASH,uDAAkD;AAClD,iDAAqD;AACrD,mDAAuD;AACvD,+BAA+D;AAC/D,8CAA0D;AAE1D,MAAa,UAAU;IACb,MAAM,CAAY;IAClB,KAAK,CAAc;IACnB,YAAY,CAAwB;IACpC,QAAQ,CAAY;IACpB,MAAM,CAAS;IACf,SAAS,GAAkB,EAAE,CAAC;IAC9B,QAAQ,GAAG,KAAK,CAAC;IAEzB,YAAY,MAAiB,EAAE,MAAe;QAC5C,IAAI,CAAC,MAAM,GAAG;YACZ,SAAS,EAAE,IAAI;YACf,YAAY,EAAE,GAAG;YACjB,IAAI,EAAE,CAAC;YACP,GAAG,MAAM;SACV,CAAC;QACF,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,IAAI,kCAAmB,EAAE,CAAC;QACvD,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7B,IAAI,CAAC,YAAY,GAAG,IAAI,oCAAoB,EAAE,CAAC;QACjD,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;QAChC,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI,IAAI,sBAAa,EAAE,CAAC;IAC9C,CAAC;IAED,4EAA4E;IAE5E,wCAAwC;IACxC,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,qCAAqC;IACrC,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,kCAAkC;IAClC,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;IAC/B,CAAC;IAED,sCAAsC;IACtC,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAEnB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,2BAA2B,IAAI,CAAC,MAAM,CAAC,YAAY,MAAM,CAAC,CAAC;QACnF,IAAI,CAAC,SAAS,GAAG,IAAA,+BAAa,EAC5B,IAAI,CAAC,MAAM,CAAC,YAAY,EACxB,IAAI,CAAC,MAAM,CAAC,SAAU,EACtB,IAAI,CAAC,MAAM,CAAC,YAAa,CAC1B,CAAC;QAEF,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,oCAAoC,IAAI,CAAC,MAAM,CAAC,YAAY,IAAI,CAAC,CAAC;YAC1F,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACrB,OAAO;QACT,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC1D,IAAI,CAAC,MAAM,CAAC,IAAI,CACd,KAAK,EACL,UAAU,IAAI,CAAC,SAAS,CAAC,MAAM,iBAAiB,SAAS,CAAC,MAAM,YAAY,CAC7E,CAAC;QAEF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACrB,OAAO;QACT,CAAC;QAED,iCAAiC;QACjC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,iCAAiC,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,KAAK,MAAM,CAAC,CAAC;QACpG,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,MAAM,UAAU,GAAe,EAAE,CAAC;QAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;YACjD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;YAC5C,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACzE,UAAU,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,CAAC;QACtC,CAAC;QAED,8BAA8B;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QAED,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAEhC,+CAA+C;QAC/C,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACnC,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,uBAAuB,IAAI,CAAC,KAAK,CAAC,IAAI,4BAA4B,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,YAAY,CAAC,IAAI,mBAAmB,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACtK,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;IACvB,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,IAAa;QACvC,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC5C,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC;QACxC,gFAAgF;QAChF,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,qBAAqB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEjF,IAAI,OAA0B,CAAC;QAE/B,oEAAoE;QACpE,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,MAAM,MAAM,GAAG,CAAC,GAAG,WAAW,CAAC;YAE/B,MAAM,CAAC,cAAc,CAAC,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAE5E,MAAM,CAAC,aAAa,EAAE,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;gBACrD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC;gBACzC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC;aACxC,CAAC,CAAC;YAEH,MAAM,UAAU,GAAmB,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC3D,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,KAAK,EAAE,CAAC,CAAC,KAAK;aACf,CAAC,CAAC,CAAC;YACJ,MAAM,WAAW,GAAmB,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC1D,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,KAAK,EAAE,CAAC,CAAC,KAAK;aACf,CAAC,CAAC,CAAC;YAEJ,MAAM,KAAK,GAAG,IAAA,eAAS,EAAC,CAAC,UAAU,EAAE,WAAW,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;YAE/D,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC1B,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,KAAK,EAAE,CAAC,CAAC,QAAQ;aAClB,CAAC,CAAC,CAAC;QACN,CAAC;aAAM,CAAC;YACN,gEAAgE;YAChE,MAAM,MAAM,GAAG,CAAC,GAAG,WAAW,CAAC;YAC/B,MAAM,CAAC,cAAc,CAAC,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5E,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;QAC5D,CAAC;QAED,qEAAqE;QACrE,IAAI,IAAI,CAAC,QAAQ,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACvD,CAAC;QAED,mBAAmB;QACnB,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,OAA0B;QACtC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,oDAAoD,CAAC;QAC9D,CAAC;QAED,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,SAAS,OAAO,CAAC,MAAM,gCAAgC,CAAC,CAAC;QAEpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,UAAU,WAAW,CAAC,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACnH,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,8BAA8B;IAC9B,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,YAAY,EAAE,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACxB,CAAC;CACF;AApMD,gCAoMC"}