@opencodereview/core 1.9.1

package/dist/ai/v4/embedding/index.js

@@ -0,0 +1,10 @@
+/**
+ * Embedding providers for the V4 AI pipeline Stage 1.
+ *
+ * @since 0.4.0
+ */
+export { LocalEmbeddingProvider, tokenize, cosineSimilarity } from './local.js';
+export { findTopMatches } from './similarity.js';
+export { OpenAIEmbeddingProvider } from './openai.js';
+export { OllamaEmbeddingProvider } from './ollama.js';
+//# sourceMappingURL=index.js.map

package/dist/ai/v4/embedding/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/ai/v4/embedding/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,sBAAsB,EAAE,QAAQ,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAChF,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AACjD,OAAO,EAAE,uBAAuB,EAAE,MAAM,aAAa,CAAC;AACtD,OAAO,EAAE,uBAAuB,EAAE,MAAM,aAAa,CAAC"}

package/dist/ai/v4/embedding/local.d.ts

@@ -0,0 +1,68 @@
+/**
+ * Local Embedding Provider — TF-IDF Based
+ *
+ * For V4 MVP, we use a simple but effective approach:
+ * - TF-IDF vectorization of code blocks
+ * - Cosine similarity against defect pattern vectors
+ * - No external model dependency (zero binary deps)
+ *
+ * This can be upgraded to ONNX-based embedding (e.g. all-MiniLM-L6-v2)
+ * in the future without changing the EmbeddingProvider interface.
+ *
+ * @since 0.4.0
+ */
+import type { EmbeddingProvider } from '../types.js';
+/**
+ * Tokenize source code into meaningful tokens.
+ *
+ * Handles:
+ * - camelCase splitting: "readFile" → ["read", "file"]
+ * - snake_case splitting: "read_file" → ["read", "file"]
+ * - Punctuation removal
+ * - Number handling
+ * - Lowercasing
+ */
+export declare function tokenize(text: string): string[];
+/**
+ * Compute cosine similarity between two vectors.
+ * Returns a value in [0, 1] where 1 = identical direction.
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+export declare class LocalEmbeddingProvider implements EmbeddingProvider {
+    private maxDimension;
+    readonly name = "local-tfidf";
+    readonly dimension: number;
+    private vocabulary;
+    private idfScores;
+    private vocabularyBuilt;
+    /**
+     * @param maxDimension Maximum vocabulary size (vector dimension).
+     *   Defaults to 512. Vocabulary is truncated to this size by IDF rank.
+     */
+    constructor(maxDimension?: number);
+    /**
+     * Build vocabulary and IDF scores from a corpus of texts.
+     * Must be called before embed() to produce meaningful vectors.
+     *
+     * @param texts Corpus of text documents to build vocabulary from
+     */
+    buildVocabulary(texts: string[]): void;
+    /**
+     * Generate TF-IDF embedding vectors for the given texts.
+     *
+     * If vocabulary hasn't been built, it will be auto-built from the input texts.
+     *
+     * @param texts Array of text documents to embed
+     * @returns Array of normalized TF-IDF vectors (one per text)
+     */
+    embed(texts: string[]): Promise<number[][]>;
+    /**
+     * Generate a normalized TF-IDF vector for a single text.
+     */
+    private embedSingle;
+    /**
+     * L2-normalize a vector (unit length).
+     */
+    private normalize;
+}
+//# sourceMappingURL=local.d.ts.map

package/dist/ai/v4/embedding/local.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local.d.ts","sourceRoot":"","sources":["../../../../src/ai/v4/embedding/local.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAIrD;;;;;;;;;GASG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAW/C;AAID;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAiBjE;AAID,qBAAa,sBAAuB,YAAW,iBAAiB;IAYlD,OAAO,CAAC,YAAY;IAXhC,QAAQ,CAAC,IAAI,iBAAiB;IAC9B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAE3B,OAAO,CAAC,UAAU,CAAkC;IACpD,OAAO,CAAC,SAAS,CAAkC;IACnD,OAAO,CAAC,eAAe,CAAS;IAEhC;;;OAGG;gBACiB,YAAY,GAAE,MAAY;IAI9C;;;;;OAKG;IACH,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI;IAyCtC;;;;;;;OAOG;IACG,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;IAQjD;;OAEG;IACH,OAAO,CAAC,WAAW;IA0BnB;;OAEG;IACH,OAAO,CAAC,SAAS;CAWlB"}

package/dist/ai/v4/embedding/local.js

@@ -0,0 +1,167 @@
+/**
+ * Local Embedding Provider — TF-IDF Based
+ *
+ * For V4 MVP, we use a simple but effective approach:
+ * - TF-IDF vectorization of code blocks
+ * - Cosine similarity against defect pattern vectors
+ * - No external model dependency (zero binary deps)
+ *
+ * This can be upgraded to ONNX-based embedding (e.g. all-MiniLM-L6-v2)
+ * in the future without changing the EmbeddingProvider interface.
+ *
+ * @since 0.4.0
+ */
+// ─── Tokenization ──────────────────────────────────────────────────
+/**
+ * Tokenize source code into meaningful tokens.
+ *
+ * Handles:
+ * - camelCase splitting: "readFile" → ["read", "file"]
+ * - snake_case splitting: "read_file" → ["read", "file"]
+ * - Punctuation removal
+ * - Number handling
+ * - Lowercasing
+ */
+export function tokenize(text) {
+    // Split camelCase and PascalCase
+    const camelSplit = text.replace(/([a-z])([A-Z])/g, '$1 $2');
+    // Split snake_case
+    const snakeSplit = camelSplit.replace(/_/g, ' ');
+    // Split on non-alphanumeric characters, lowercase, filter empty
+    const tokens = snakeSplit
+        .split(/[^a-zA-Z0-9]+/)
+        .map(t => t.toLowerCase())
+        .filter(t => t.length > 1); // Filter single characters
+    return tokens;
+}
+// ─── Cosine Similarity ─────────────────────────────────────────────
+/**
+ * Compute cosine similarity between two vectors.
+ * Returns a value in [0, 1] where 1 = identical direction.
+ */
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length || a.length === 0)
+        return 0;
+    let dotProduct = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denominator = Math.sqrt(normA) * Math.sqrt(normB);
+    if (denominator === 0)
+        return 0;
+    return dotProduct / denominator;
+}
+// ─── Local TF-IDF Embedding Provider ───────────────────────────────
+export class LocalEmbeddingProvider {
+    maxDimension;
+    name = 'local-tfidf';
+    dimension;
+    vocabulary = new Map();
+    idfScores = new Map();
+    vocabularyBuilt = false;
+    /**
+     * @param maxDimension Maximum vocabulary size (vector dimension).
+     *   Defaults to 512. Vocabulary is truncated to this size by IDF rank.
+     */
+    constructor(maxDimension = 512) {
+        this.maxDimension = maxDimension;
+        this.dimension = maxDimension;
+    }
+    /**
+     * Build vocabulary and IDF scores from a corpus of texts.
+     * Must be called before embed() to produce meaningful vectors.
+     *
+     * @param texts Corpus of text documents to build vocabulary from
+     */
+    buildVocabulary(texts) {
+        if (texts.length === 0) {
+            this.vocabularyBuilt = true;
+            return;
+        }
+        // Tokenize all documents
+        const docTokenSets = texts.map(text => new Set(tokenize(text)));
+        // Count document frequency for each token
+        const docFreq = new Map();
+        for (const tokenSet of docTokenSets) {
+            for (const token of tokenSet) {
+                docFreq.set(token, (docFreq.get(token) ?? 0) + 1);
+            }
+        }
+        // Compute IDF: log(N / df)
+        const N = texts.length;
+        const idfEntries = [];
+        for (const [token, df] of docFreq.entries()) {
+            const idf = Math.log((N + 1) / (df + 1)) + 1; // smoothed IDF
+            idfEntries.push([token, idf]);
+        }
+        // Sort by IDF descending (most discriminative first), take top maxDimension
+        idfEntries.sort((a, b) => b[1] - a[1]);
+        const selected = idfEntries.slice(0, this.maxDimension);
+        // Build vocabulary mapping: token → index
+        this.vocabulary.clear();
+        this.idfScores.clear();
+        for (let i = 0; i < selected.length; i++) {
+            const [token, idf] = selected[i];
+            this.vocabulary.set(token, i);
+            this.idfScores.set(token, idf);
+        }
+        this.vocabularyBuilt = true;
+    }
+    /**
+     * Generate TF-IDF embedding vectors for the given texts.
+     *
+     * If vocabulary hasn't been built, it will be auto-built from the input texts.
+     *
+     * @param texts Array of text documents to embed
+     * @returns Array of normalized TF-IDF vectors (one per text)
+     */
+    async embed(texts) {
+        if (!this.vocabularyBuilt) {
+            this.buildVocabulary(texts);
+        }
+        return texts.map(text => this.embedSingle(text));
+    }
+    /**
+     * Generate a normalized TF-IDF vector for a single text.
+     */
+    embedSingle(text) {
+        const tokens = tokenize(text);
+        const vector = new Array(this.dimension).fill(0);
+        if (tokens.length === 0)
+            return vector;
+        // Count term frequencies
+        const tf = new Map();
+        for (const token of tokens) {
+            tf.set(token, (tf.get(token) ?? 0) + 1);
+        }
+        // Build TF-IDF vector
+        for (const [token, count] of tf.entries()) {
+            const idx = this.vocabulary.get(token);
+            if (idx !== undefined) {
+                const termFreq = count / tokens.length; // normalized TF
+                const idf = this.idfScores.get(token) ?? 1;
+                vector[idx] = termFreq * idf;
+            }
+        }
+        // L2 normalize
+        return this.normalize(vector);
+    }
+    /**
+     * L2-normalize a vector (unit length).
+     */
+    normalize(vector) {
+        let norm = 0;
+        for (const v of vector) {
+            norm += v * v;
+        }
+        norm = Math.sqrt(norm);
+        if (norm === 0)
+            return vector;
+        return vector.map(v => v / norm);
+    }
+}
+//# sourceMappingURL=local.js.map

package/dist/ai/v4/embedding/local.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local.js","sourceRoot":"","sources":["../../../../src/ai/v4/embedding/local.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAIH,sEAAsE;AAEtE;;;;;;;;;GASG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,iCAAiC;IACjC,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC,CAAC;IAC5D,mBAAmB;IACnB,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACjD,gEAAgE;IAChE,MAAM,MAAM,GAAG,UAAU;SACtB,KAAK,CAAC,eAAe,CAAC;SACtB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;SACzB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,2BAA2B;IACzD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,sEAAsE;AAEtE;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,IAAI,WAAW,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEhC,OAAO,UAAU,GAAG,WAAW,CAAC;AAClC,CAAC;AAED,sEAAsE;AAEtE,MAAM,OAAO,sBAAsB;IAYb;IAXX,IAAI,GAAG,aAAa,CAAC;IACrB,SAAS,CAAS;IAEnB,UAAU,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC5C,SAAS,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC3C,eAAe,GAAG,KAAK,CAAC;IAEhC;;;OAGG;IACH,YAAoB,eAAuB,GAAG;QAA1B,iBAAY,GAAZ,YAAY,CAAc;QAC5C,IAAI,CAAC,SAAS,GAAG,YAAY,CAAC;IAChC,CAAC;IAED;;;;;OAKG;IACH,eAAe,CAAC,KAAe;QAC7B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;YAC5B,OAAO;QACT,CAAC;QAED,yBAAyB;QACzB,MAAM,YAAY,GAAkB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAE/E,0CAA0C;QAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE,CAAC;YACpC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC7B,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,MAAM,UAAU,GAA4B,EAAE,CAAC;QAC/C,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe;YAC7D,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QAChC,CAAC;QAED,4EAA4E;QAC5E,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QAExD,0CAA0C;QAC1C,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACjC,CAAC;QAED,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;IAC9B,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,KAAK,CAAC,KAAe;QACzB,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;YAC1B,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,IAAY;QAC9B,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEjD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAEvC,yBAAyB;QACzB,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;QACrC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,CAAC;QAED,sBAAsB;QACtB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtB,MAAM,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,gBAAgB;gBACxD,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ,GAAG,GAAG,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,eAAe;QACf,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,MAAgB;QAChC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEvB,IAAI,IAAI,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAE9B,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IACnC,CAAC;CACF"}

package/dist/ai/v4/embedding/ollama.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Ollama Embedding Provider
+ *
+ * Uses Ollama's /api/embed batch API for local embedding generation.
+ * Designed for L2 SLA level where a local Ollama server is available.
+ *
+ * Recommended model: nomic-embed-text (0.3GB, 768 dims, ~0.14s/5 texts batch)
+ *
+ * @since 0.4.1
+ */
+import type { EmbeddingProvider } from '../types.js';
+/**
+ * Ollama embedding provider using the /api/embed batch API.
+ *
+ * Requires a running Ollama server with an embedding model pulled.
+ * Uses batch API (input as array) for efficient embedding generation.
+ *
+ * @example
+ * ```ts
+ * const provider = new OllamaEmbeddingProvider('nomic-embed-text', 'http://localhost:11434');
+ * const embeddings = await provider.embed(['hello world', 'foo bar']);
+ * ```
+ */
+export declare class OllamaEmbeddingProvider implements EmbeddingProvider {
+    private model;
+    private baseUrl;
+    readonly name = "ollama";
+    private _dimension;
+    /**
+     * @param model Ollama embedding model name (default: nomic-embed-text)
+     * @param baseUrl Ollama server base URL (default: http://localhost:11434)
+     */
+    constructor(model?: string, baseUrl?: string);
+    /**
+     * Embedding vector dimension.
+     * Inferred from the first successful API response.
+     * Returns 0 before the first embed() call.
+     */
+    get dimension(): number;
+    /**
+     * Generate embeddings for a batch of texts via Ollama API.
+     *
+     * Uses the batch /api/embed endpoint with input as an array.
+     * Automatically splits into sub-batches of MAX_BATCH_SIZE to avoid timeouts.
+     *
+     * @param texts Array of text strings to embed
+     * @returns Array of embedding vectors (one per text)
+     */
+    embed(texts: string[]): Promise<number[][]>;
+    /**
+     * Send a single batch to the Ollama /api/embed endpoint.
+     *
+     * Uses the batch API: input is an array of strings,
+     * response contains embeddings array matching input order.
+     */
+    private embedBatch;
+}
+//# sourceMappingURL=ollama.d.ts.map

package/dist/ai/v4/embedding/ollama.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ollama.d.ts","sourceRoot":"","sources":["../../../../src/ai/v4/embedding/ollama.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAKrD;;;;;;;;;;;GAWG;AACH,qBAAa,uBAAwB,YAAW,iBAAiB;IAS7D,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,OAAO;IATjB,QAAQ,CAAC,IAAI,YAAY;IACzB,OAAO,CAAC,UAAU,CAAK;IAEvB;;;OAGG;gBAEO,KAAK,GAAE,MAA2B,EAClC,OAAO,GAAE,MAAiC;IAGpD;;;;OAIG;IACH,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED;;;;;;;;OAQG;IACG,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;IAejD;;;;;OAKG;YACW,UAAU;CAuCzB"}

package/dist/ai/v4/embedding/ollama.js

@@ -0,0 +1,101 @@
+/**
+ * Ollama Embedding Provider
+ *
+ * Uses Ollama's /api/embed batch API for local embedding generation.
+ * Designed for L2 SLA level where a local Ollama server is available.
+ *
+ * Recommended model: nomic-embed-text (0.3GB, 768 dims, ~0.14s/5 texts batch)
+ *
+ * @since 0.4.1
+ */
+/** Maximum texts per batch to avoid timeouts */
+const MAX_BATCH_SIZE = 10;
+/**
+ * Ollama embedding provider using the /api/embed batch API.
+ *
+ * Requires a running Ollama server with an embedding model pulled.
+ * Uses batch API (input as array) for efficient embedding generation.
+ *
+ * @example
+ * ```ts
+ * const provider = new OllamaEmbeddingProvider('nomic-embed-text', 'http://localhost:11434');
+ * const embeddings = await provider.embed(['hello world', 'foo bar']);
+ * ```
+ */
+export class OllamaEmbeddingProvider {
+    model;
+    baseUrl;
+    name = 'ollama';
+    _dimension = 0;
+    /**
+     * @param model Ollama embedding model name (default: nomic-embed-text)
+     * @param baseUrl Ollama server base URL (default: http://localhost:11434)
+     */
+    constructor(model = 'nomic-embed-text', baseUrl = 'http://localhost:11434') {
+        this.model = model;
+        this.baseUrl = baseUrl;
+    }
+    /**
+     * Embedding vector dimension.
+     * Inferred from the first successful API response.
+     * Returns 0 before the first embed() call.
+     */
+    get dimension() {
+        return this._dimension;
+    }
+    /**
+     * Generate embeddings for a batch of texts via Ollama API.
+     *
+     * Uses the batch /api/embed endpoint with input as an array.
+     * Automatically splits into sub-batches of MAX_BATCH_SIZE to avoid timeouts.
+     *
+     * @param texts Array of text strings to embed
+     * @returns Array of embedding vectors (one per text)
+     */
+    async embed(texts) {
+        if (texts.length === 0)
+            return [];
+        const results = [];
+        // Process in batches of MAX_BATCH_SIZE
+        for (let i = 0; i < texts.length; i += MAX_BATCH_SIZE) {
+            const batch = texts.slice(i, i + MAX_BATCH_SIZE);
+            const batchResults = await this.embedBatch(batch);
+            results.push(...batchResults);
+        }
+        return results;
+    }
+    /**
+     * Send a single batch to the Ollama /api/embed endpoint.
+     *
+     * Uses the batch API: input is an array of strings,
+     * response contains embeddings array matching input order.
+     */
+    async embedBatch(texts) {
+        const url = `${this.baseUrl.replace(/\/+$/, '')}/api/embed`;
+        const response = await fetch(url, {
+            method: 'POST',
+            headers: {
+                'Content-Type': 'application/json',
+            },
+            body: JSON.stringify({
+                model: this.model,
+                input: texts,
+            }),
+            signal: AbortSignal.timeout(60_000),
+        });
+        if (!response.ok) {
+            const errorBody = await response.text().catch(() => 'unknown error');
+            throw new Error(`Ollama embed API error (${response.status}): ${errorBody}`);
+        }
+        const data = (await response.json());
+        if (!data.embeddings || !Array.isArray(data.embeddings)) {
+            throw new Error('Ollama embed API returned unexpected format: missing embeddings array');
+        }
+        // Infer dimension from first result
+        if (this._dimension === 0 && data.embeddings.length > 0 && data.embeddings[0]) {
+            this._dimension = data.embeddings[0].length;
+        }
+        return data.embeddings;
+    }
+}
+//# sourceMappingURL=ollama.js.map

package/dist/ai/v4/embedding/ollama.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ollama.js","sourceRoot":"","sources":["../../../../src/ai/v4/embedding/ollama.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,gDAAgD;AAChD,MAAM,cAAc,GAAG,EAAE,CAAC;AAE1B;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,uBAAuB;IASxB;IACA;IATD,IAAI,GAAG,QAAQ,CAAC;IACjB,UAAU,GAAG,CAAC,CAAC;IAEvB;;;OAGG;IACH,YACU,QAAgB,kBAAkB,EAClC,UAAkB,wBAAwB;QAD1C,UAAK,GAAL,KAAK,CAA6B;QAClC,YAAO,GAAP,OAAO,CAAmC;IACjD,CAAC;IAEJ;;;;OAIG;IACH,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,KAAK,CAAC,KAAe;QACzB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,MAAM,OAAO,GAAe,EAAE,CAAC;QAE/B,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC;YACtD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,CAAC;YACjD,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClD,OAAO,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QAChC,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,UAAU,CAAC,KAAe;QACtC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,YAAY,CAAC;QAE5D,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,EAAE;YAChC,MAAM,EAAE,MAAM;YACd,OAAO,EAAE;gBACP,cAAc,EAAE,kBAAkB;aACnC;YACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;gBACnB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,KAAK,EAAE,KAAK;aACb,CAAC;YACF,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC;SACpC,CAAC,CAAC;QAEH,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;YACjB,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;YACrE,MAAM,IAAI,KAAK,CACb,2BAA2B,QAAQ,CAAC,MAAM,MAAM,SAAS,EAAE,CAC5D,CAAC;QACJ,CAAC;QAED,MAAM,IAAI,GAAG,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAElC,CAAC;QAEF,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACxD,MAAM,IAAI,KAAK,CACb,uEAAuE,CACxE,CAAC;QACJ,CAAC;QAED,oCAAoC;QACpC,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9E,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC9C,CAAC;QAED,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;CACF"}

package/dist/ai/v4/embedding/openai.d.ts

@@ -0,0 +1,36 @@
+/**
+ * OpenAI Embedding Provider
+ *
+ * Uses OpenAI's text-embedding API for high-quality vector embeddings.
+ * Designed for L3 SLA level where remote API calls are acceptable.
+ *
+ * @since 0.4.0
+ */
+import type { EmbeddingProvider } from '../types.js';
+/**
+ * OpenAI embedding provider using the text-embedding-3-small model.
+ *
+ * Requires an API key. Batches requests to stay within API limits.
+ */
+export declare class OpenAIEmbeddingProvider implements EmbeddingProvider {
+    private apiKey;
+    private model;
+    private baseUrl;
+    readonly name = "openai";
+    readonly dimension: number;
+    constructor(apiKey: string, model?: string, baseUrl?: string);
+    /**
+     * Generate embeddings for a batch of texts via OpenAI API.
+     *
+     * Automatically splits into sub-batches if texts exceed MAX_BATCH_SIZE.
+     *
+     * @param texts Array of text strings to embed
+     * @returns Array of embedding vectors (one per text)
+     */
+    embed(texts: string[]): Promise<number[][]>;
+    /**
+     * Send a single batch to the OpenAI embeddings API.
+     */
+    private embedBatch;
+}
+//# sourceMappingURL=openai.d.ts.map

package/dist/ai/v4/embedding/openai.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"openai.d.ts","sourceRoot":"","sources":["../../../../src/ai/v4/embedding/openai.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAKrD;;;;GAIG;AACH,qBAAa,uBAAwB,YAAW,iBAAiB;IAK7D,OAAO,CAAC,MAAM;IACd,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,OAAO;IANjB,QAAQ,CAAC,IAAI,YAAY;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;gBAGjB,MAAM,EAAE,MAAM,EACd,KAAK,GAAE,MAAiC,EACxC,OAAO,GAAE,MAAoC;IAMvD;;;;;;;OAOG;IACG,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;IAejD;;OAEG;YACW,UAAU;CA+BzB"}

package/dist/ai/v4/embedding/openai.js

@@ -0,0 +1,76 @@
+/**
+ * OpenAI Embedding Provider
+ *
+ * Uses OpenAI's text-embedding API for high-quality vector embeddings.
+ * Designed for L3 SLA level where remote API calls are acceptable.
+ *
+ * @since 0.4.0
+ */
+/** Maximum texts per batch request to OpenAI embeddings API */
+const MAX_BATCH_SIZE = 2048;
+/**
+ * OpenAI embedding provider using the text-embedding-3-small model.
+ *
+ * Requires an API key. Batches requests to stay within API limits.
+ */
+export class OpenAIEmbeddingProvider {
+    apiKey;
+    model;
+    baseUrl;
+    name = 'openai';
+    dimension;
+    constructor(apiKey, model = 'text-embedding-3-small', baseUrl = 'https://api.openai.com/v1') {
+        this.apiKey = apiKey;
+        this.model = model;
+        this.baseUrl = baseUrl;
+        // text-embedding-3-small = 1536, text-embedding-3-large = 3072
+        this.dimension = model.includes('large') ? 3072 : 1536;
+    }
+    /**
+     * Generate embeddings for a batch of texts via OpenAI API.
+     *
+     * Automatically splits into sub-batches if texts exceed MAX_BATCH_SIZE.
+     *
+     * @param texts Array of text strings to embed
+     * @returns Array of embedding vectors (one per text)
+     */
+    async embed(texts) {
+        if (texts.length === 0)
+            return [];
+        const results = [];
+        // Process in batches
+        for (let i = 0; i < texts.length; i += MAX_BATCH_SIZE) {
+            const batch = texts.slice(i, i + MAX_BATCH_SIZE);
+            const batchResults = await this.embedBatch(batch);
+            results.push(...batchResults);
+        }
+        return results;
+    }
+    /**
+     * Send a single batch to the OpenAI embeddings API.
+     */
+    async embedBatch(texts) {
+        const url = `${this.baseUrl}/embeddings`;
+        const response = await fetch(url, {
+            method: 'POST',
+            headers: {
+                'Content-Type': 'application/json',
+                Authorization: `Bearer ${this.apiKey}`,
+            },
+            body: JSON.stringify({
+                model: this.model,
+                input: texts,
+            }),
+            signal: AbortSignal.timeout(30_000),
+        });
+        if (!response.ok) {
+            const errorBody = await response.text().catch(() => 'unknown error');
+            throw new Error(`OpenAI embeddings API error (${response.status}): ${errorBody}`);
+        }
+        const data = (await response.json());
+        // Sort by index to ensure order matches input
+        const sorted = data.data.sort((a, b) => a.index - b.index);
+        return sorted.map(d => d.embedding);
+    }
+}
+//# sourceMappingURL=openai.js.map

package/dist/ai/v4/embedding/openai.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"openai.js","sourceRoot":"","sources":["../../../../src/ai/v4/embedding/openai.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,+DAA+D;AAC/D,MAAM,cAAc,GAAG,IAAI,CAAC;AAE5B;;;;GAIG;AACH,MAAM,OAAO,uBAAuB;IAKxB;IACA;IACA;IAND,IAAI,GAAG,QAAQ,CAAC;IAChB,SAAS,CAAS;IAE3B,YACU,MAAc,EACd,QAAgB,wBAAwB,EACxC,UAAkB,2BAA2B;QAF7C,WAAM,GAAN,MAAM,CAAQ;QACd,UAAK,GAAL,KAAK,CAAmC;QACxC,YAAO,GAAP,OAAO,CAAsC;QAErD,+DAA+D;QAC/D,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACzD,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,KAAK,CAAC,KAAe;QACzB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,MAAM,OAAO,GAAe,EAAE,CAAC;QAE/B,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC;YACtD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,CAAC;YACjD,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClD,OAAO,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QAChC,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CAAC,KAAe;QACtC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,aAAa,CAAC;QAEzC,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,EAAE;YAChC,MAAM,EAAE,MAAM;YACd,OAAO,EAAE;gBACP,cAAc,EAAE,kBAAkB;gBAClC,aAAa,EAAE,UAAU,IAAI,CAAC,MAAM,EAAE;aACvC;YACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;gBACnB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,KAAK,EAAE,KAAK;aACb,CAAC;YACF,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC;SACpC,CAAC,CAAC;QAEH,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;YACjB,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,CAAC;YACrE,MAAM,IAAI,KAAK,CACb,gCAAgC,QAAQ,CAAC,MAAM,MAAM,SAAS,EAAE,CACjE,CAAC;QACJ,CAAC;QAED,MAAM,IAAI,GAAG,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,CAElC,CAAC;QAEF,8CAA8C;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC3D,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC;CACF"}

package/dist/ai/v4/embedding/similarity.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Cosine Similarity Utilities
+ *
+ * Vector similarity functions for the embedding recall stage.
+ * Used to compare code block embeddings against defect pattern embeddings.
+ *
+ * @since 0.4.0
+ */
+/**
+ * Compute cosine similarity between two vectors.
+ * Returns a value in [-1, 1] where 1 = identical direction, 0 = orthogonal.
+ *
+ * For TF-IDF vectors (non-negative), range is [0, 1].
+ *
+ * @param a First vector
+ * @param b Second vector
+ * @returns Cosine similarity score
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+/**
+ * Find the top-K most similar candidates to a query vector.
+ *
+ * Returns candidates that exceed the similarity threshold, sorted by
+ * descending similarity score, limited to topK results.
+ *
+ * @param query Query embedding vector
+ * @param candidates Array of candidate embedding vectors
+ * @param topK Maximum number of results to return
+ * @param threshold Minimum similarity score to include (0-1)
+ * @returns Array of { index, score } sorted by descending score
+ */
+export declare function findTopMatches(query: number[], candidates: number[][], topK: number, threshold: number): {
+    index: number;
+    score: number;
+}[];
+//# sourceMappingURL=similarity.d.ts.map

package/dist/ai/v4/embedding/similarity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity.d.ts","sourceRoot":"","sources":["../../../../src/ai/v4/embedding/similarity.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAiBjE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,MAAM,EAAE,EACf,UAAU,EAAE,MAAM,EAAE,EAAE,EACtB,IAAI,EAAE,MAAM,EACZ,SAAS,EAAE,MAAM,GAChB;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,EAAE,CAepC"}

package/dist/ai/v4/embedding/similarity.js

@@ -0,0 +1,60 @@
+/**
+ * Cosine Similarity Utilities
+ *
+ * Vector similarity functions for the embedding recall stage.
+ * Used to compare code block embeddings against defect pattern embeddings.
+ *
+ * @since 0.4.0
+ */
+/**
+ * Compute cosine similarity between two vectors.
+ * Returns a value in [-1, 1] where 1 = identical direction, 0 = orthogonal.
+ *
+ * For TF-IDF vectors (non-negative), range is [0, 1].
+ *
+ * @param a First vector
+ * @param b Second vector
+ * @returns Cosine similarity score
+ */
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length || a.length === 0)
+        return 0;
+    let dotProduct = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denominator = Math.sqrt(normA) * Math.sqrt(normB);
+    if (denominator === 0)
+        return 0;
+    return dotProduct / denominator;
+}
+/**
+ * Find the top-K most similar candidates to a query vector.
+ *
+ * Returns candidates that exceed the similarity threshold, sorted by
+ * descending similarity score, limited to topK results.
+ *
+ * @param query Query embedding vector
+ * @param candidates Array of candidate embedding vectors
+ * @param topK Maximum number of results to return
+ * @param threshold Minimum similarity score to include (0-1)
+ * @returns Array of { index, score } sorted by descending score
+ */
+export function findTopMatches(query, candidates, topK, threshold) {
+    const matches = [];
+    for (let i = 0; i < candidates.length; i++) {
+        const score = cosineSimilarity(query, candidates[i]);
+        if (score >= threshold) {
+            matches.push({ index: i, score });
+        }
+    }
+    // Sort by score descending
+    matches.sort((a, b) => b.score - a.score);
+    // Return top-K
+    return matches.slice(0, topK);
+}
+//# sourceMappingURL=similarity.js.map

package/dist/ai/v4/embedding/similarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity.js","sourceRoot":"","sources":["../../../../src/ai/v4/embedding/similarity.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,IAAI,WAAW,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEhC,OAAO,UAAU,GAAG,WAAW,CAAC;AAClC,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAe,EACf,UAAsB,EACtB,IAAY,EACZ,SAAiB;IAEjB,MAAM,OAAO,GAAuC,EAAE,CAAC;IAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAE1C,eAAe;IACf,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAChC,CAAC"}