ghagga-core 2.8.0 → 2.9.0

package/dist/search/indexer.js

@@ -0,0 +1,196 @@
+/**
+ * Search Indexer — builds and maintains an inverted index for BM25 search.
+ *
+ * Tokenizes documents, builds an inverted index with positional data,
+ * and supports incremental indexing (add/remove documents).
+ * No external dependencies — pure TypeScript implementation.
+ */
+// ─── Tokenizer ─────────────────────────────────────────────────
+/**
+ * Common English stop words to exclude from indexing.
+ * Keeps the index lean and improves search relevance.
+ */
+export const STOP_WORDS = new Set([
+    'a', 'an', 'and', 'are', 'as', 'at', 'be', 'but', 'by',
+    'for', 'if', 'in', 'into', 'is', 'it', 'no', 'not', 'of',
+    'on', 'or', 'such', 'that', 'the', 'their', 'then', 'there',
+    'these', 'they', 'this', 'to', 'was', 'will', 'with',
+]);
+/** Minimum token length to index. */
+const MIN_TOKEN_LENGTH = 2;
+/**
+ * Tokenize text into lowercase terms, filtering stop words and short tokens.
+ *
+ * @param text - Raw text to tokenize.
+ * @returns Array of normalized tokens in order of appearance.
+ */
+export function tokenize(text) {
+    return text
+        .toLowerCase()
+        .replace(/[^a-z0-9_-]/g, ' ')
+        .split(/\s+/)
+        .filter((token) => token.length >= MIN_TOKEN_LENGTH && !STOP_WORDS.has(token));
+}
+// ─── SearchIndexer ─────────────────────────────────────────────
+export class SearchIndexer {
+    /** Inverted index: term -> posting list with positions. */
+    terms = new Map();
+    /** Per-document term counts for BM25 length normalization. */
+    docLengths = new Map();
+    /** Stored documents for retrieval. */
+    documents = new Map();
+    /** Running sum of all document lengths for avgDocLength. */
+    totalTerms = 0;
+    // ── Public API ──────────────────────────────────────────────
+    /** Number of indexed documents. */
+    get totalDocs() {
+        return this.documents.size;
+    }
+    /** Average document length in terms. Returns 0 when empty. */
+    get avgDocLength() {
+        return this.documents.size === 0 ? 0 : this.totalTerms / this.documents.size;
+    }
+    /**
+     * Index a single document.
+     * If the document ID already exists, it is replaced (remove + add).
+     */
+    addDocument(doc) {
+        // Replace if exists
+        if (this.documents.has(doc.id)) {
+            this.removeDocument(doc.id);
+        }
+        this.documents.set(doc.id, doc);
+        const tokens = tokenize(doc.content);
+        this.docLengths.set(doc.id, tokens.length);
+        this.totalTerms += tokens.length;
+        // Build term frequency and position maps for this document
+        const termPositions = new Map();
+        for (let i = 0; i < tokens.length; i++) {
+            const token = tokens[i];
+            const positions = termPositions.get(token);
+            if (positions) {
+                positions.push(i);
+            }
+            else {
+                termPositions.set(token, [i]);
+            }
+        }
+        // Update the inverted index
+        for (const [term, positions] of termPositions) {
+            const posting = {
+                docId: doc.id,
+                tf: positions.length,
+                positions,
+            };
+            const existing = this.terms.get(term);
+            if (existing) {
+                existing.df += 1;
+                existing.postings.push(posting);
+            }
+            else {
+                this.terms.set(term, { df: 1, postings: [posting] });
+            }
+        }
+    }
+    /**
+     * Index multiple documents at once.
+     */
+    addDocuments(docs) {
+        for (const doc of docs) {
+            this.addDocument(doc);
+        }
+    }
+    /**
+     * Remove a document from the index by ID.
+     * Returns true if the document was found and removed.
+     */
+    removeDocument(docId) {
+        const doc = this.documents.get(docId);
+        if (!doc)
+            return false;
+        const docLength = this.docLengths.get(docId) ?? 0;
+        this.totalTerms -= docLength;
+        this.docLengths.delete(docId);
+        this.documents.delete(docId);
+        // Remove postings for this document from every term
+        for (const [term, stats] of this.terms) {
+            const idx = stats.postings.findIndex((p) => p.docId === docId);
+            if (idx !== -1) {
+                stats.postings.splice(idx, 1);
+                stats.df -= 1;
+                // Clean up empty term entries
+                if (stats.postings.length === 0) {
+                    this.terms.delete(term);
+                }
+            }
+        }
+        return true;
+    }
+    /** Check if a document ID is already indexed. */
+    hasDocument(docId) {
+        return this.documents.has(docId);
+    }
+    /** Get a stored document by ID. */
+    getDocument(docId) {
+        return this.documents.get(docId);
+    }
+    // ── Snapshot (serialization) ─────────────────────────────────
+    /**
+     * Export the full index as a JSON-serializable snapshot.
+     * Use this for persistence (save to disk / SQLite / etc.).
+     */
+    toSnapshot() {
+        const termsObj = {};
+        for (const [term, stats] of this.terms) {
+            termsObj[term] = stats;
+        }
+        const docLengthsObj = {};
+        for (const [docId, length] of this.docLengths) {
+            docLengthsObj[docId] = length;
+        }
+        const documentsObj = {};
+        for (const [docId, doc] of this.documents) {
+            documentsObj[docId] = doc;
+        }
+        return {
+            version: 1,
+            totalDocs: this.documents.size,
+            avgDocLength: this.avgDocLength,
+            docLengths: docLengthsObj,
+            terms: termsObj,
+            documents: documentsObj,
+        };
+    }
+    /**
+     * Restore the index from a snapshot.
+     * Clears any existing state before loading.
+     */
+    static fromSnapshot(snapshot) {
+        const indexer = new SearchIndexer();
+        for (const [term, stats] of Object.entries(snapshot.terms)) {
+            indexer.terms.set(term, stats);
+        }
+        for (const [docId, length] of Object.entries(snapshot.docLengths)) {
+            indexer.docLengths.set(docId, length);
+        }
+        for (const [docId, doc] of Object.entries(snapshot.documents)) {
+            indexer.documents.set(docId, doc);
+        }
+        // Recompute totalTerms from docLengths
+        indexer.totalTerms = 0;
+        for (const length of indexer.docLengths.values()) {
+            indexer.totalTerms += length;
+        }
+        return indexer;
+    }
+    // ── Internal accessors (used by SearchEngine) ────────────────
+    /** Get term stats from the inverted index. */
+    getTermStats(term) {
+        return this.terms.get(term);
+    }
+    /** Get the term count for a specific document. */
+    getDocLength(docId) {
+        return this.docLengths.get(docId) ?? 0;
+    }
+}
+//# sourceMappingURL=indexer.js.map

package/dist/search/indexer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexer.js","sourceRoot":"","sources":["../../src/search/indexer.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,kEAAkE;AAElE;;;GAGG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IAChC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI;IACtD,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI;IACxD,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO;IAC3D,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;CACrD,CAAC,CAAC;AAEH,qCAAqC;AACrC,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAE3B;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;SAC5B,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,IAAI,gBAAgB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;AACnF,CAAC;AAED,kEAAkE;AAElE,MAAM,OAAO,aAAa;IACxB,2DAA2D;IACnD,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;IAE7C,8DAA8D;IACtD,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE/C,sCAAsC;IAC9B,SAAS,GAAG,IAAI,GAAG,EAA0B,CAAC;IAEtD,4DAA4D;IACpD,UAAU,GAAG,CAAC,CAAC;IAEvB,+DAA+D;IAE/D,mCAAmC;IACnC,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC7B,CAAC;IAED,8DAA8D;IAC9D,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC/E,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,GAAmB;QAC7B,oBAAoB;QACpB,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,CAAC;QAED,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAEhC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,MAAM,CAAC;QAEjC,2DAA2D;QAC3D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;YACzB,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC3C,IAAI,SAAS,EAAE,CAAC;gBACd,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,4BAA4B;QAC5B,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,aAAa,EAAE,CAAC;YAC9C,MAAM,OAAO,GAAgB;gBAC3B,KAAK,EAAE,GAAG,CAAC,EAAE;gBACb,EAAE,EAAE,SAAS,CAAC,MAAM;gBACpB,SAAS;aACV,CAAC;YAEF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;gBACjB,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,IAAsB;QACjC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,KAAa;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,GAAG;YAAE,OAAO,KAAK,CAAC;QAEvB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,CAAC,UAAU,IAAI,SAAS,CAAC;QAC7B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAE7B,oDAAoD;QACpD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACvC,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;YAC/D,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;gBACf,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBAC9B,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;gBAEd,8BAA8B;gBAC9B,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAChC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,iDAAiD;IACjD,WAAW,CAAC,KAAa;QACvB,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,mCAAmC;IACnC,WAAW,CAAC,KAAa;QACvB,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,gEAAgE;IAEhE;;;OAGG;IACH,UAAU;QACR,MAAM,QAAQ,GAA8B,EAAE,CAAC;QAC/C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;QACzB,CAAC;QAED,MAAM,aAAa,GAA2B,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC9C,aAAa,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;QAChC,CAAC;QAED,MAAM,YAAY,GAAmC,EAAE,CAAC;QACxD,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC1C,YAAY,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;QAC5B,CAAC;QAED,OAAO;YACL,OAAO,EAAE,CAAC;YACV,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;YAC9B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,UAAU,EAAE,aAAa;YACzB,KAAK,EAAE,QAAQ;YACf,SAAS,EAAE,YAAY;SACxB,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,YAAY,CAAC,QAAuB;QACzC,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QAEpC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3D,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACjC,CAAC;QAED,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;YAClE,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACxC,CAAC;QAED,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YAC9D,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACpC,CAAC;QAED,uCAAuC;QACvC,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC;QACvB,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,OAAO,CAAC,UAAU,IAAI,MAAM,CAAC;QAC/B,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,gEAAgE;IAEhE,8CAA8C;IAC9C,YAAY,CAAC,IAAY;QACvB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,kDAAkD;IAClD,YAAY,CAAC,KAAa;QACxB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;CACF"}

package/dist/search/searcher.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Search Engine — BM25 ranked retrieval over the inverted index.
+ *
+ * Implements the Okapi BM25 scoring function for ranking documents
+ * by relevance to a free-text query. No external dependencies.
+ *
+ * BM25 formula:
+ *   score(D, Q) = SUM_i IDF(qi) * (tf(qi, D) * (k1 + 1)) / (tf(qi, D) + k1 * (1 - b + b * |D| / avgdl))
+ *
+ * Where:
+ *   - IDF(qi) = ln((N - df(qi) + 0.5) / (df(qi) + 0.5) + 1)
+ *   - tf(qi, D) = frequency of term qi in document D
+ *   - |D| = document length in terms
+ *   - avgdl = average document length
+ *   - k1 = term frequency saturation (default 1.2)
+ *   - b = document length normalization (default 0.75)
+ */
+import type { SearchIndexer } from './indexer.js';
+import type { BM25Params, SearchOptions, SearchResult } from './types.js';
+export declare class SearchEngine {
+    private indexer;
+    private k1;
+    private b;
+    constructor(indexer: SearchIndexer, params?: BM25Params);
+    /**
+     * Search the index with a free-text query using BM25 scoring.
+     *
+     * @param query - Natural language search query (e.g., "memory leak in connection pool").
+     * @param options - Search options (limit, source filter, min score).
+     * @returns Ranked array of search results, highest score first.
+     */
+    search(query: string, options?: SearchOptions): SearchResult[];
+}
+//# sourceMappingURL=searcher.d.ts.map

package/dist/search/searcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"searcher.d.ts","sourceRoot":"","sources":["../../src/search/searcher.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAClD,OAAO,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAS1E,qBAAa,YAAY;IACvB,OAAO,CAAC,OAAO,CAAgB;IAC/B,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,CAAC,CAAS;gBAEN,OAAO,EAAE,aAAa,EAAE,MAAM,GAAE,UAAe;IAM3D;;;;;;OAMG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,aAAkB,GAAG,YAAY,EAAE;CAsEnE"}

package/dist/search/searcher.js

@@ -0,0 +1,101 @@
+/**
+ * Search Engine — BM25 ranked retrieval over the inverted index.
+ *
+ * Implements the Okapi BM25 scoring function for ranking documents
+ * by relevance to a free-text query. No external dependencies.
+ *
+ * BM25 formula:
+ *   score(D, Q) = SUM_i IDF(qi) * (tf(qi, D) * (k1 + 1)) / (tf(qi, D) + k1 * (1 - b + b * |D| / avgdl))
+ *
+ * Where:
+ *   - IDF(qi) = ln((N - df(qi) + 0.5) / (df(qi) + 0.5) + 1)
+ *   - tf(qi, D) = frequency of term qi in document D
+ *   - |D| = document length in terms
+ *   - avgdl = average document length
+ *   - k1 = term frequency saturation (default 1.2)
+ *   - b = document length normalization (default 0.75)
+ */
+import { tokenize } from './indexer.js';
+// ─── Default BM25 Parameters ──────────────────────────────────
+const DEFAULT_K1 = 1.2;
+const DEFAULT_B = 0.75;
+// ─── SearchEngine ──────────────────────────────────────────────
+export class SearchEngine {
+    indexer;
+    k1;
+    b;
+    constructor(indexer, params = {}) {
+        this.indexer = indexer;
+        this.k1 = params.k1 ?? DEFAULT_K1;
+        this.b = params.b ?? DEFAULT_B;
+    }
+    /**
+     * Search the index with a free-text query using BM25 scoring.
+     *
+     * @param query - Natural language search query (e.g., "memory leak in connection pool").
+     * @param options - Search options (limit, source filter, min score).
+     * @returns Ranked array of search results, highest score first.
+     */
+    search(query, options = {}) {
+        const { limit = 10, source, minScore = 0 } = options;
+        const queryTerms = tokenize(query);
+        if (queryTerms.length === 0)
+            return [];
+        const totalDocs = this.indexer.totalDocs;
+        if (totalDocs === 0)
+            return [];
+        const avgDocLength = this.indexer.avgDocLength;
+        // Collect scores for each document that matches at least one query term
+        const docScores = new Map();
+        for (const term of queryTerms) {
+            const termStats = this.indexer.getTermStats(term);
+            if (!termStats)
+                continue;
+            // IDF: inverse document frequency with BM25 smoothing
+            const idf = Math.log((totalDocs - termStats.df + 0.5) / (termStats.df + 0.5) + 1);
+            for (const posting of termStats.postings) {
+                const docLength = this.indexer.getDocLength(posting.docId);
+                // BM25 term score
+                const tfNorm = (posting.tf * (this.k1 + 1)) /
+                    (posting.tf + this.k1 * (1 - this.b + this.b * (docLength / avgDocLength)));
+                const termScore = idf * tfNorm;
+                const existing = docScores.get(posting.docId);
+                if (existing) {
+                    existing.score += termScore;
+                    existing.matchedTerms.add(term);
+                }
+                else {
+                    docScores.set(posting.docId, {
+                        score: termScore,
+                        matchedTerms: new Set([term]),
+                    });
+                }
+            }
+        }
+        // Build results, applying filters
+        const results = [];
+        for (const [docId, { score, matchedTerms }] of docScores) {
+            if (score < minScore)
+                continue;
+            const document = this.indexer.getDocument(docId);
+            if (!document)
+                continue;
+            if (source && document.source !== source)
+                continue;
+            results.push({
+                document,
+                score,
+                matchedTerms: [...matchedTerms],
+            });
+        }
+        // Sort by score descending, then by recency (newer first) as tiebreaker
+        results.sort((a, b) => {
+            const scoreDiff = b.score - a.score;
+            if (Math.abs(scoreDiff) > 0.001)
+                return scoreDiff;
+            return b.document.createdAt.localeCompare(a.document.createdAt);
+        });
+        return results.slice(0, limit);
+    }
+}
+//# sourceMappingURL=searcher.js.map

package/dist/search/searcher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"searcher.js","sourceRoot":"","sources":["../../src/search/searcher.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAIxC,iEAAiE;AAEjE,MAAM,UAAU,GAAG,GAAG,CAAC;AACvB,MAAM,SAAS,GAAG,IAAI,CAAC;AAEvB,kEAAkE;AAElE,MAAM,OAAO,YAAY;IACf,OAAO,CAAgB;IACvB,EAAE,CAAS;IACX,CAAC,CAAS;IAElB,YAAY,OAAsB,EAAE,SAAqB,EAAE;QACzD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,IAAI,UAAU,CAAC;QAClC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,SAAS,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,KAAa,EAAE,UAAyB,EAAE;QAC/C,MAAM,EAAE,KAAK,GAAG,EAAE,EAAE,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC;QAErD,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEvC,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC;QACzC,IAAI,SAAS,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAE/B,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC;QAE/C,wEAAwE;QACxE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwD,CAAC;QAElF,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YAClD,IAAI,CAAC,SAAS;gBAAE,SAAS;YAEzB,sDAAsD;YACtD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAElF,KAAK,MAAM,OAAO,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;gBACzC,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAE3D,kBAAkB;gBAClB,MAAM,MAAM,GACV,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;oBAC5B,CAAC,OAAO,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBAE9E,MAAM,SAAS,GAAG,GAAG,GAAG,MAAM,CAAC;gBAE/B,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC9C,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,KAAK,IAAI,SAAS,CAAC;oBAC5B,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClC,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE;wBAC3B,KAAK,EAAE,SAAS;wBAChB,YAAY,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;qBAC9B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,kCAAkC;QAClC,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;YACzD,IAAI,KAAK,GAAG,QAAQ;gBAAE,SAAS;YAE/B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAExB,IAAI,MAAM,IAAI,QAAQ,CAAC,MAAM,KAAK,MAAM;gBAAE,SAAS;YAEnD,OAAO,CAAC,IAAI,CAAC;gBACX,QAAQ;gBACR,KAAK;gBACL,YAAY,EAAE,CAAC,GAAG,YAAY,CAAC;aAChC,CAAC,CAAC;QACL,CAAC;QAED,wEAAwE;QACxE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACpB,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;YACpC,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,KAAK;gBAAE,OAAO,SAAS,CAAC;YAClD,OAAO,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;QAEH,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;CACF"}

package/dist/search/types.d.ts

@@ -0,0 +1,81 @@
+/**
+ * Semantic Search Types
+ *
+ * Types for searching over historical review comments and PR descriptions.
+ * Uses BM25 text scoring — no external embedding dependencies required.
+ */
+/** A searchable document representing a review comment or PR description. */
+export interface SearchDocument {
+    /** Unique identifier for this document. */
+    id: string;
+    /** The full text content to index and search. */
+    content: string;
+    /** Source of the document (review comment, PR description, etc.). */
+    source: SearchDocumentSource;
+    /** Associated PR number, if applicable. */
+    prNumber?: number;
+    /** File paths related to this document. */
+    filePaths?: string[];
+    /** ISO timestamp when the document was created. */
+    createdAt: string;
+    /** Optional metadata for filtering or display. */
+    metadata?: Record<string, unknown>;
+}
+export type SearchDocumentSource = 'review-comment' | 'pr-description' | 'review-summary';
+/** A single term entry in the inverted index. */
+export interface TermPosting {
+    /** Document ID. */
+    docId: string;
+    /** Term frequency in this document. */
+    tf: number;
+    /** Positions of the term in the document (for phrase queries). */
+    positions: number[];
+}
+/** Statistics for a single term across the corpus. */
+export interface TermStats {
+    /** Number of documents containing this term (document frequency). */
+    df: number;
+    /** Postings list for this term. */
+    postings: TermPosting[];
+}
+/** Serializable snapshot of the inverted index. */
+export interface IndexSnapshot {
+    /** Version tag for forward-compatible deserialization. */
+    version: 1;
+    /** Total number of indexed documents. */
+    totalDocs: number;
+    /** Average document length (in terms). */
+    avgDocLength: number;
+    /** Per-document term counts (docId -> number of terms). */
+    docLengths: Record<string, number>;
+    /** The inverted index: term -> stats. */
+    terms: Record<string, TermStats>;
+    /** Stored documents for retrieval. */
+    documents: Record<string, SearchDocument>;
+}
+/** A single search result with its relevance score. */
+export interface SearchResult {
+    /** The matched document. */
+    document: SearchDocument;
+    /** BM25 relevance score (higher = more relevant). */
+    score: number;
+    /** Matched terms from the query that appeared in this document. */
+    matchedTerms: string[];
+}
+/** Options for configuring search behavior. */
+export interface SearchOptions {
+    /** Maximum number of results to return. Defaults to 10. */
+    limit?: number;
+    /** Filter results by document source. */
+    source?: SearchDocumentSource;
+    /** Minimum BM25 score threshold. Results below this are excluded. Defaults to 0. */
+    minScore?: number;
+}
+/** BM25 tuning parameters. */
+export interface BM25Params {
+    /** Term frequency saturation parameter. Higher values give more weight to term frequency. Defaults to 1.2. */
+    k1?: number;
+    /** Document length normalization parameter (0 = no normalization, 1 = full). Defaults to 0.75. */
+    b?: number;
+}
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/search/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,6EAA6E;AAC7E,MAAM,WAAW,cAAc;IAC7B,2CAA2C;IAC3C,EAAE,EAAE,MAAM,CAAC;IAEX,iDAAiD;IACjD,OAAO,EAAE,MAAM,CAAC;IAEhB,qEAAqE;IACrE,MAAM,EAAE,oBAAoB,CAAC;IAE7B,2CAA2C;IAC3C,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB,2CAA2C;IAC3C,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IAErB,mDAAmD;IACnD,SAAS,EAAE,MAAM,CAAC;IAElB,kDAAkD;IAClD,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED,MAAM,MAAM,oBAAoB,GAAG,gBAAgB,GAAG,gBAAgB,GAAG,gBAAgB,CAAC;AAI1F,iDAAiD;AACjD,MAAM,WAAW,WAAW;IAC1B,mBAAmB;IACnB,KAAK,EAAE,MAAM,CAAC;IAEd,uCAAuC;IACvC,EAAE,EAAE,MAAM,CAAC;IAEX,kEAAkE;IAClE,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB;AAED,sDAAsD;AACtD,MAAM,WAAW,SAAS;IACxB,qEAAqE;IACrE,EAAE,EAAE,MAAM,CAAC;IAEX,mCAAmC;IACnC,QAAQ,EAAE,WAAW,EAAE,CAAC;CACzB;AAED,mDAAmD;AACnD,MAAM,WAAW,aAAa;IAC5B,0DAA0D;IAC1D,OAAO,EAAE,CAAC,CAAC;IAEX,yCAAyC;IACzC,SAAS,EAAE,MAAM,CAAC;IAElB,0CAA0C;IAC1C,YAAY,EAAE,MAAM,CAAC;IAErB,2DAA2D;IAC3D,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEnC,yCAAyC;IACzC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAEjC,sCAAsC;IACtC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;CAC3C;AAID,uDAAuD;AACvD,MAAM,WAAW,YAAY;IAC3B,4BAA4B;IAC5B,QAAQ,EAAE,cAAc,CAAC;IAEzB,qDAAqD;IACrD,KAAK,EAAE,MAAM,CAAC;IAEd,mEAAmE;IACnE,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAED,+CAA+C;AAC/C,MAAM,WAAW,aAAa;IAC5B,2DAA2D;IAC3D,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,yCAAyC;IACzC,MAAM,CAAC,EAAE,oBAAoB,CAAC;IAE9B,oFAAoF;IACpF,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,8BAA8B;AAC9B,MAAM,WAAW,UAAU;IACzB,8GAA8G;IAC9G,EAAE,CAAC,EAAE,MAAM,CAAC;IAEZ,kGAAkG;IAClG,CAAC,CAAC,EAAE,MAAM,CAAC;CACZ"}

package/dist/search/types.js

@@ -0,0 +1,8 @@
+/**
+ * Semantic Search Types
+ *
+ * Types for searching over historical review comments and PR descriptions.
+ * Uses BM25 text scoring — no external embedding dependencies required.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/search/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/search/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/self-improve/index.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Self-Improving Review Loop
+ *
+ * Tracks which findings get accepted/rejected by users and uses that
+ * signal to derive improvement rules for future reviews.
+ */
+export type FindingOutcome = 'accepted' | 'rejected' | 'modified';
+export interface FindingFeedback {
+    findingHash: string;
+    outcome: FindingOutcome;
+    category: string;
+    severity: string;
+    modelUsed: string;
+    recordedAt: string;
+}
+export interface ImprovementRule {
+    pattern: string;
+    category: string;
+    action: 'suppress' | 'boost_priority';
+    confidence: number;
+    sampleCount: number;
+}
+/**
+ * Append a feedback record to the JSONL file at storagePath.
+ * Creates the file (and parent directories) if they do not exist.
+ */
+export declare function recordFeedback(feedback: FindingFeedback, storagePath: string): Promise<void>;
+/**
+ * Load all feedback records from a JSONL file.
+ * Returns an empty array if the file does not exist.
+ */
+export declare function loadFeedback(storagePath: string): Promise<FindingFeedback[]>;
+/**
+ * Derive improvement rules from accumulated feedback.
+ *
+ * Logic per category:
+ * - rejection_rate > 0.7 AND sampleCount >= 5 → suppress
+ * - acceptance_rate > 0.8 AND sampleCount >= 5 → boost_priority
+ *
+ * Returns rules sorted by confidence descending.
+ */
+export declare function deriveRules(feedback: FindingFeedback[]): ImprovementRule[];
+/**
+ * Format derived improvement rules as a prompt section.
+ *
+ * Injects rules into the system prompt so the agent adjusts its behavior
+ * based on historical feedback.
+ *
+ * @param rules - Derived rules from deriveRules()
+ * @returns Formatted string for injection into system prompt
+ */
+export declare function formatRulesForPrompt(rules: ImprovementRule[]): string;
+//# sourceMappingURL=index.d.ts.map

package/dist/self-improve/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/self-improve/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,MAAM,MAAM,cAAc,GAAG,UAAU,GAAG,UAAU,GAAG,UAAU,CAAC;AAElE,MAAM,WAAW,eAAe;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,cAAc,CAAC;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,UAAU,GAAG,gBAAgB,CAAC;IACtC,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB;AAID;;;GAGG;AACH,wBAAsB,cAAc,CAClC,QAAQ,EAAE,eAAe,EACzB,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,IAAI,CAAC,CAQf;AAED;;;GAGG;AACH,wBAAsB,YAAY,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,CAqBlF;AAQD;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,QAAQ,EAAE,eAAe,EAAE,GAAG,eAAe,EAAE,CA4C1E;AAID;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,MAAM,CA4BrE"}

package/dist/self-improve/index.js

@@ -0,0 +1,136 @@
+/**
+ * Self-Improving Review Loop
+ *
+ * Tracks which findings get accepted/rejected by users and uses that
+ * signal to derive improvement rules for future reviews.
+ */
+import { appendFileSync, existsSync, mkdirSync, readFileSync } from 'node:fs';
+import { dirname } from 'node:path';
+// ─── Storage ─────────────────────────────────────────────────────
+/**
+ * Append a feedback record to the JSONL file at storagePath.
+ * Creates the file (and parent directories) if they do not exist.
+ */
+export async function recordFeedback(feedback, storagePath) {
+    const dir = dirname(storagePath);
+    if (!existsSync(dir)) {
+        mkdirSync(dir, { recursive: true });
+    }
+    const line = `${JSON.stringify(feedback)}\n`;
+    appendFileSync(storagePath, line, 'utf-8');
+}
+/**
+ * Load all feedback records from a JSONL file.
+ * Returns an empty array if the file does not exist.
+ */
+export async function loadFeedback(storagePath) {
+    if (!existsSync(storagePath)) {
+        return [];
+    }
+    const raw = readFileSync(storagePath, 'utf-8').trim();
+    if (!raw)
+        return [];
+    const records = [];
+    for (const line of raw.split('\n')) {
+        const trimmed = line.trim();
+        if (!trimmed)
+            continue;
+        try {
+            const parsed = JSON.parse(trimmed);
+            records.push(parsed);
+        }
+        catch {
+            // Skip malformed lines
+        }
+    }
+    return records;
+}
+// ─── Rule Derivation ─────────────────────────────────────────────
+const MIN_SAMPLE_COUNT = 5;
+const SUPPRESS_REJECTION_THRESHOLD = 0.7;
+const BOOST_ACCEPTANCE_THRESHOLD = 0.8;
+/**
+ * Derive improvement rules from accumulated feedback.
+ *
+ * Logic per category:
+ * - rejection_rate > 0.7 AND sampleCount >= 5 → suppress
+ * - acceptance_rate > 0.8 AND sampleCount >= 5 → boost_priority
+ *
+ * Returns rules sorted by confidence descending.
+ */
+export function deriveRules(feedback) {
+    if (feedback.length === 0)
+        return [];
+    // Group by category
+    const byCategory = new Map();
+    for (const fb of feedback) {
+        const existing = byCategory.get(fb.category) ?? [];
+        existing.push(fb);
+        byCategory.set(fb.category, existing);
+    }
+    const rules = [];
+    for (const [category, records] of byCategory) {
+        const total = records.length;
+        if (total < MIN_SAMPLE_COUNT)
+            continue;
+        const rejected = records.filter((r) => r.outcome === 'rejected').length;
+        const accepted = records.filter((r) => r.outcome === 'accepted').length;
+        const rejectionRate = rejected / total;
+        const acceptanceRate = accepted / total;
+        if (rejectionRate > SUPPRESS_REJECTION_THRESHOLD) {
+            rules.push({
+                pattern: `category:${category}`,
+                category,
+                action: 'suppress',
+                confidence: Math.round(rejectionRate * 100) / 100,
+                sampleCount: total,
+            });
+        }
+        else if (acceptanceRate > BOOST_ACCEPTANCE_THRESHOLD) {
+            rules.push({
+                pattern: `category:${category}`,
+                category,
+                action: 'boost_priority',
+                confidence: Math.round(acceptanceRate * 100) / 100,
+                sampleCount: total,
+            });
+        }
+    }
+    // Sort by confidence descending
+    return rules.sort((a, b) => b.confidence - a.confidence);
+}
+// ─── Prompt Formatting ────────────────────────────────────────────
+/**
+ * Format derived improvement rules as a prompt section.
+ *
+ * Injects rules into the system prompt so the agent adjusts its behavior
+ * based on historical feedback.
+ *
+ * @param rules - Derived rules from deriveRules()
+ * @returns Formatted string for injection into system prompt
+ */
+export function formatRulesForPrompt(rules) {
+    if (rules.length === 0)
+        return '';
+    const lines = [
+        '## Review Improvement Rules',
+        '',
+        'Based on past feedback, apply these adjustments to your review:',
+        '',
+    ];
+    for (const rule of rules) {
+        if (rule.action === 'suppress') {
+            lines.push(`- **SUPPRESS** findings in category \`${rule.category}\` — ` +
+                `${Math.round(rule.confidence * 100)}% rejection rate across ${rule.sampleCount} samples. ` +
+                `Only report if you have very strong evidence.`);
+        }
+        else {
+            lines.push(`- **PRIORITIZE** findings in category \`${rule.category}\` — ` +
+                `${Math.round(rule.confidence * 100)}% acceptance rate across ${rule.sampleCount} samples. ` +
+                `These findings are highly valued by the team.`);
+        }
+    }
+    lines.push('');
+    return lines.join('\n');
+}
+//# sourceMappingURL=index.js.map

package/dist/self-improve/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/self-improve/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAC9E,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAuBpC,oEAAoE;AAEpE;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,QAAyB,EACzB,WAAmB;IAEnB,MAAM,GAAG,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;IACjC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC7C,cAAc,CAAC,WAAW,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;AAC7C,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,WAAmB;IACpD,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,GAAG,GAAG,YAAY,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;IACtD,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,CAAC;IAEpB,MAAM,OAAO,GAAsB,EAAE,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAoB,CAAC;YACtD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;QAAC,MAAM,CAAC;YACP,uBAAuB;QACzB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,oEAAoE;AAEpE,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAC3B,MAAM,4BAA4B,GAAG,GAAG,CAAC;AACzC,MAAM,0BAA0B,GAAG,GAAG,CAAC;AAEvC;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,QAA2B;IACrD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,oBAAoB;IACpB,MAAM,UAAU,GAAG,IAAI,GAAG,EAA6B,CAAC;IACxD,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACnD,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,KAAK,GAAsB,EAAE,CAAC;IAEpC,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,UAAU,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;QAC7B,IAAI,KAAK,GAAG,gBAAgB;YAAE,SAAS;QAEvC,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC,MAAM,CAAC;QACxE,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,UAAU,CAAC,CAAC,MAAM,CAAC;QAExE,MAAM,aAAa,GAAG,QAAQ,GAAG,KAAK,CAAC;QACvC,MAAM,cAAc,GAAG,QAAQ,GAAG,KAAK,CAAC;QAExC,IAAI,aAAa,GAAG,4BAA4B,EAAE,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC;gBACT,OAAO,EAAE,YAAY,QAAQ,EAAE;gBAC/B,QAAQ;gBACR,MAAM,EAAE,UAAU;gBAClB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,GAAG,CAAC,GAAG,GAAG;gBACjD,WAAW,EAAE,KAAK;aACnB,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,cAAc,GAAG,0BAA0B,EAAE,CAAC;YACvD,KAAK,CAAC,IAAI,CAAC;gBACT,OAAO,EAAE,YAAY,QAAQ,EAAE;gBAC/B,QAAQ;gBACR,MAAM,EAAE,gBAAgB;gBACxB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,GAAG,CAAC,GAAG,GAAG;gBAClD,WAAW,EAAE,KAAK;aACnB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;AAC3D,CAAC;AAED,qEAAqE;AAErE;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAwB;IAC3D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,MAAM,KAAK,GAAa;QACtB,6BAA6B;QAC7B,EAAE;QACF,iEAAiE;QACjE,EAAE;KACH,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAC/B,KAAK,CAAC,IAAI,CACR,yCAAyC,IAAI,CAAC,QAAQ,OAAO;gBAC3D,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC,2BAA2B,IAAI,CAAC,WAAW,YAAY;gBAC3F,+CAA+C,CAClD,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CACR,2CAA2C,IAAI,CAAC,QAAQ,OAAO;gBAC7D,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC,4BAA4B,IAAI,CAAC,WAAW,YAAY;gBAC5F,+CAA+C,CAClD,CAAC;QACJ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}