sigma-memory 0.1.2 → 0.2.0

package/src/vector-store.ts

@@ -0,0 +1,384 @@
+import { existsSync, mkdirSync, readFileSync, writeFileSync } from 'fs';
+import { dirname } from 'path';
+import initSqlJs, { type Database } from 'sql.js';
+import type { VectorSearchResult } from './types.js';
+
+/**
+ * Helper for loading ESM-only modules from a CJS context.
+ * Uses native import() via Function constructor to bypass
+ * TypeScript's CJS transformation of dynamic imports.
+ */
+const esmImport = new Function(
+  'specifier',
+  'return import(specifier)'
+) as (specifier: string) => Promise<any>;
+
+/**
+ * Self-contained vector store using sql.js (SQLite via WebAssembly) and
+ * @huggingface/transformers for local embeddings.
+ *
+ * Zero configuration — works out of the box on any platform.
+ * No native compilation required.
+ */
+export class VectorStore {
+  private db: Database | null = null;
+  private pipeline: any = null;
+  private dbPath: string;
+  private initialized = false;
+  private initPromise: Promise<void> | null = null;
+  private modelPromise: Promise<void> | null = null;
+
+  constructor(dbPath: string) {
+    this.dbPath = dbPath;
+  }
+
+  /**
+   * Initialize the vector store: sets up the SQLite database.
+   * The embedding model is loaded lazily on first embed operation.
+   * Safe to call multiple times — only initializes once.
+   */
+  async init(): Promise<void> {
+    if (this.initialized) return;
+    if (this.initPromise) return this.initPromise;
+
+    this.initPromise = this._init();
+    await this.initPromise;
+  }
+
+  private async _init(): Promise<void> {
+    // Ensure directory exists
+    const dir = dirname(this.dbPath);
+    if (!existsSync(dir)) {
+      mkdirSync(dir, { recursive: true });
+    }
+
+    // Initialize sql.js (loads WASM automatically)
+    const SQL = await initSqlJs();
+
+    // Load existing DB or create a new one
+    if (existsSync(this.dbPath)) {
+      const fileBuffer = readFileSync(this.dbPath);
+      this.db = new SQL.Database(fileBuffer);
+    } else {
+      this.db = new SQL.Database();
+    }
+
+    // Create schema
+    this.db.run(`
+      CREATE TABLE IF NOT EXISTS documents (
+        id INTEGER PRIMARY KEY AUTOINCREMENT,
+        file TEXT NOT NULL,
+        chunk_index INTEGER NOT NULL,
+        content TEXT NOT NULL,
+        embedding BLOB NOT NULL,
+        updated_at TEXT DEFAULT CURRENT_TIMESTAMP,
+        UNIQUE(file, chunk_index)
+      )
+    `);
+
+    // Index for fast file lookups
+    this.db.run('CREATE INDEX IF NOT EXISTS idx_documents_file ON documents(file)');
+
+    this.persist();
+    this.initialized = true;
+  }
+
+  /**
+   * Load the embedding model. Called lazily on first embed operation.
+   * Downloads the model on first use (~23MB for all-MiniLM-L6-v2).
+   */
+  private async loadEmbeddingModel(): Promise<void> {
+    if (this.pipeline) return;
+    if (this.modelPromise) return this.modelPromise;
+
+    this.modelPromise = (async () => {
+      console.log('[VectorStore] Loading embedding model (Xenova/all-MiniLM-L6-v2)...');
+      console.log('[VectorStore] First run may download the model (~23MB).');
+
+      // Dynamic ESM import for @huggingface/transformers (ESM-only package)
+      const { pipeline: createPipeline } = await esmImport('@huggingface/transformers');
+
+      this.pipeline = await createPipeline(
+        'feature-extraction',
+        'Xenova/all-MiniLM-L6-v2'
+      );
+
+      console.log('[VectorStore] Embedding model loaded.');
+    })();
+
+    await this.modelPromise;
+  }
+
+  /**
+   * Ensure the embedding model is loaded before use.
+   */
+  private async ensurePipeline(): Promise<void> {
+    if (!this.pipeline) {
+      await this.loadEmbeddingModel();
+    }
+  }
+
+  /**
+   * Persist the in-memory SQLite database to disk.
+   */
+  private persist(): void {
+    if (!this.db) return;
+    const data = this.db.export();
+    const buffer = Buffer.from(data);
+    writeFileSync(this.dbPath, buffer);
+  }
+
+  /**
+   * Embed text into a Float32Array vector (384 dimensions).
+   */
+  private async embed(text: string): Promise<Float32Array> {
+    await this.ensurePipeline();
+
+    const output = await this.pipeline(text, { pooling: 'mean', normalize: true });
+    return new Float32Array(output.data);
+  }
+
+  /**
+   * Chunk text into overlapping segments.
+   *
+   * Strategy:
+   * 1. Split by paragraphs (double newline)
+   * 2. If a paragraph exceeds 500 chars, split by sentences
+   * 3. Each chunk gets a 100-char overlap with the previous chunk
+   */
+  private chunkText(text: string): string[] {
+    const MAX_CHUNK_SIZE = 500;
+    const OVERLAP = 100;
+
+    // Split by paragraphs (double newline)
+    const paragraphs = text.split(/\n\s*\n/).filter(p => p.trim().length > 0);
+
+    const rawChunks: string[] = [];
+
+    for (const paragraph of paragraphs) {
+      const trimmed = paragraph.trim();
+
+      if (trimmed.length <= MAX_CHUNK_SIZE) {
+        rawChunks.push(trimmed);
+      } else {
+        // Split long paragraphs by sentences
+        const sentences = trimmed.split(/(?<=[.!?])\s+/);
+        let current = '';
+
+        for (const sentence of sentences) {
+          if (current.length + sentence.length + 1 > MAX_CHUNK_SIZE && current.length > 0) {
+            rawChunks.push(current.trim());
+            current = sentence;
+          } else {
+            current = current ? current + ' ' + sentence : sentence;
+          }
+        }
+
+        if (current.trim().length > 0) {
+          rawChunks.push(current.trim());
+        }
+      }
+    }
+
+    if (rawChunks.length === 0) return [];
+
+    // Apply overlap: each chunk (except the first) gets the last 100 chars
+    // of the previous chunk prepended
+    const chunks: string[] = [rawChunks[0]];
+
+    for (let i = 1; i < rawChunks.length; i++) {
+      const prevChunk = rawChunks[i - 1];
+      const overlap = prevChunk.slice(-OVERLAP);
+      chunks.push(overlap + ' ' + rawChunks[i]);
+    }
+
+    return chunks;
+  }
+
+  /**
+   * Serialize a Float32Array to a Buffer for BLOB storage.
+   */
+  private serializeEmbedding(embedding: Float32Array): Uint8Array {
+    return new Uint8Array(embedding.buffer, embedding.byteOffset, embedding.byteLength);
+  }
+
+  /**
+   * Deserialize a BLOB (Uint8Array) back to Float32Array.
+   */
+  private deserializeEmbedding(blob: Uint8Array): Float32Array {
+    // Create a proper copy to ensure alignment
+    const buffer = new ArrayBuffer(blob.byteLength);
+    new Uint8Array(buffer).set(blob);
+    return new Float32Array(buffer);
+  }
+
+  /**
+   * Compute cosine similarity between two vectors.
+   * Both vectors should be normalized (which they are from the model),
+   * so this is equivalent to the dot product.
+   */
+  private cosineSimilarity(a: Float32Array, b: Float32Array): number {
+    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;
+  }
+
+  /**
+   * Add a document to the vector store.
+   * Chunks the content, embeds each chunk, and stores in the DB.
+   * Replaces any existing chunks for this file.
+   */
+  async addDocument(file: string, content: string): Promise<void> {
+    if (!this.db) throw new Error('VectorStore not initialized. Call init() first.');
+
+    const chunks = this.chunkText(content);
+    if (chunks.length === 0) return;
+
+    // Remove existing chunks for this file
+    this.db.run('DELETE FROM documents WHERE file = ?', [file]);
+
+    // Embed and insert each chunk
+    for (let i = 0; i < chunks.length; i++) {
+      const embedding = await this.embed(chunks[i]);
+      const embeddingBlob = this.serializeEmbedding(embedding);
+      const now = new Date().toISOString();
+
+      this.db.run(
+        'INSERT INTO documents (file, chunk_index, content, embedding, updated_at) VALUES (?, ?, ?, ?, ?)',
+        [file, i, chunks[i], embeddingBlob as any, now]
+      );
+    }
+
+    this.persist();
+  }
+
+  /**
+   * Search the vector store for content similar to the query.
+   * Returns top-k results sorted by cosine similarity (descending).
+   *
+   * For performance with large DBs (>10K chunks), embeddings are loaded
+   * as Float32Array and compared using optimized JS computation.
+   */
+  async search(query: string, limit: number = 10): Promise<VectorSearchResult[]> {
+    if (!this.db) throw new Error('VectorStore not initialized. Call init() first.');
+
+    // Embed the query
+    const queryEmbedding = await this.embed(query);
+
+    // Load all documents with embeddings
+    const results = this.db.exec(
+      'SELECT file, chunk_index, content, embedding FROM documents'
+    );
+
+    if (results.length === 0 || results[0].values.length === 0) {
+      return [];
+    }
+
+    // Compute cosine similarity for each document
+    const scored: VectorSearchResult[] = [];
+
+    for (const row of results[0].values) {
+      const [file, chunkIndex, content, embeddingBlob] = row as [string, number, string, Uint8Array];
+
+      const docEmbedding = this.deserializeEmbedding(
+        embeddingBlob instanceof Uint8Array ? embeddingBlob : new Uint8Array(embeddingBlob as any)
+      );
+
+      const score = this.cosineSimilarity(queryEmbedding, docEmbedding);
+
+      scored.push({
+        file: file as string,
+        chunkIndex: chunkIndex as number,
+        content: content as string,
+        score
+      });
+    }
+
+    // Sort by score descending and return top-k
+    scored.sort((a, b) => b.score - a.score);
+    return scored.slice(0, limit);
+  }
+
+  /**
+   * Remove all chunks for a given file.
+   */
+  async removeDocument(file: string): Promise<void> {
+    if (!this.db) throw new Error('VectorStore not initialized. Call init() first.');
+
+    this.db.run('DELETE FROM documents WHERE file = ?', [file]);
+    this.persist();
+  }
+
+  /**
+   * Full reindex from a file map (filename → content).
+   * Clears all existing data and re-indexes everything.
+   */
+  async reindex(files: Map<string, string>): Promise<void> {
+    if (!this.db) throw new Error('VectorStore not initialized. Call init() first.');
+
+    // Clear all existing documents
+    this.db.run('DELETE FROM documents');
+
+    // Re-add all files
+    for (const [file, content] of files) {
+      await this.addDocument(file, content);
+    }
+
+    this.persist();
+  }
+
+  /**
+   * Get statistics about the vector store.
+   */
+  getStats(): { documentCount: number; chunkCount: number; lastUpdate: string } {
+    if (!this.db) {
+      return { documentCount: 0, chunkCount: 0, lastUpdate: '' };
+    }
+
+    const countResult = this.db.exec(
+      'SELECT COUNT(DISTINCT file) as docs, COUNT(*) as chunks FROM documents'
+    );
+    const updateResult = this.db.exec(
+      'SELECT MAX(updated_at) as last_update FROM documents'
+    );
+
+    const docs = countResult.length > 0 && countResult[0].values.length > 0
+      ? (countResult[0].values[0][0] as number)
+      : 0;
+
+    const chunks = countResult.length > 0 && countResult[0].values.length > 0
+      ? (countResult[0].values[0][1] as number)
+      : 0;
+
+    const lastUpdate = updateResult.length > 0 && updateResult[0].values.length > 0
+      ? ((updateResult[0].values[0][0] as string) || '')
+      : '';
+
+    return { documentCount: docs, chunkCount: chunks, lastUpdate };
+  }
+
+  /**
+   * Close the database connection and persist to disk.
+   */
+  close(): void {
+    if (this.db) {
+      this.persist();
+      this.db.close();
+      this.db = null;
+    }
+    this.initialized = false;
+    this.initPromise = null;
+    this.modelPromise = null;
+  }
+}

package/src/vendor.d.ts

@@ -0,0 +1,30 @@
+/**
+ * Type declarations for external dependencies.
+ * Minimal declarations to avoid needing @types packages.
+ */
+
+declare module 'sql.js' {
+  interface Database {
+    run(sql: string, params?: any[]): Database;
+    exec(sql: string): Array<{ columns: string[]; values: any[][] }>;
+    prepare(sql: string): Statement;
+    export(): Uint8Array;
+    close(): void;
+  }
+
+  interface Statement {
+    bind(params?: any[]): boolean;
+    step(): boolean;
+    get(): any[];
+    getAsObject(): Record<string, any>;
+    free(): void;
+    run(params?: any[]): void;
+  }
+
+  interface SqlJsStatic {
+    Database: new (data?: ArrayLike<number> | null) => Database;
+  }
+
+  export type { Database, Statement, SqlJsStatic };
+  export default function initSqlJs(config?: any): Promise<SqlJsStatic>;
+}

package/dist/qmd.d.ts

@@ -1,35 +0,0 @@
-import type { MemoryConfig, SearchResult } from './types.js';
-export declare class QMDManager {
-    private config;
-    private qmdCommand;
-    constructor(config: MemoryConfig);
-    /**
-     * Retourne true si QMD est installé et fonctionnel
-     */
-    isAvailable(): boolean;
-    /**
-     * Lance `qmd query` et parse les résultats
-     */
-    search(query: string, maxResults?: number): Promise<SearchResult[]>;
-    /**
-     * Lance `qmd update` pour reindexer
-     */
-    update(): Promise<boolean>;
-    /**
-     * Lance `qmd embed` pour recalculer les embeddings
-     */
-    embed(): Promise<boolean>;
-    /**
-     * Liste les collections QMD
-     */
-    collections(): Promise<string[]>;
-    /**
-     * Retourne le statut (nb fichiers, nb chunks, dernière mise à jour)
-     */
-    status(): Promise<{
-        files: number;
-        chunks: number;
-        lastUpdate: string | null;
-    } | null>;
-}
-//# sourceMappingURL=qmd.d.ts.map

package/dist/qmd.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"qmd.d.ts","sourceRoot":"","sources":["../src/qmd.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE7D,qBAAa,UAAU;IACrB,OAAO,CAAC,MAAM,CAAe;IAC7B,OAAO,CAAC,UAAU,CAAS;gBAEf,MAAM,EAAE,YAAY;IAKhC;;OAEG;IACH,WAAW,IAAI,OAAO;IAiBtB;;OAEG;IACG,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,SAAK,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAsCrE;;OAEG;IACG,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC;IAkBhC;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,OAAO,CAAC;IAkB/B;;OAEG;IACG,WAAW,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IA8BtC;;OAEG;IACG,MAAM,IAAI,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,GAAG,IAAI,CAAC;CA4B7F"}

package/dist/qmd.js

@@ -1,162 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.QMDManager = void 0;
-const child_process_1 = require("child_process");
-class QMDManager {
-    config;
-    qmdCommand;
-    constructor(config) {
-        this.config = config;
-        this.qmdCommand = config.qmdCommand || 'qmd';
-    }
-    /**
-     * Retourne true si QMD est installé et fonctionnel
-     */
-    isAvailable() {
-        if (!this.config.qmdEnabled) {
-            return false;
-        }
-        try {
-            // Teste si le binaire QMD est accessible
-            (0, child_process_1.execSync)(`${this.qmdCommand} --version`, {
-                stdio: 'ignore',
-                timeout: 5000
-            });
-            return true;
-        }
-        catch (error) {
-            return false;
-        }
-    }
-    /**
-     * Lance `qmd query` et parse les résultats
-     */
-    async search(query, maxResults = 10) {
-        if (!this.isAvailable()) {
-            return [];
-        }
-        try {
-            const output = (0, child_process_1.execSync)(`${this.qmdCommand} query "${query.replace(/"/g, '\\"')}" --limit ${maxResults} --format json`, {
-                encoding: 'utf8',
-                timeout: 30000,
-                cwd: this.config.memoryDir
-            });
-            if (!output.trim()) {
-                return [];
-            }
-            const result = JSON.parse(output);
-            // Le format attendu est { results: [{file, line, content, score}] }
-            if (result.results && Array.isArray(result.results)) {
-                return result.results.map((item) => ({
-                    file: item.file || '',
-                    line: item.line || 0,
-                    content: item.content || '',
-                    score: item.score || 0
-                }));
-            }
-            return [];
-        }
-        catch (error) {
-            // QMD search failed silently
-            return [];
-        }
-    }
-    /**
-     * Lance `qmd update` pour reindexer
-     */
-    async update() {
-        if (!this.isAvailable()) {
-            return false;
-        }
-        try {
-            (0, child_process_1.execSync)(`${this.qmdCommand} update`, {
-                stdio: 'ignore',
-                timeout: 60000,
-                cwd: this.config.memoryDir
-            });
-            return true;
-        }
-        catch (error) {
-            // QMD update failed silently
-            return false;
-        }
-    }
-    /**
-     * Lance `qmd embed` pour recalculer les embeddings
-     */
-    async embed() {
-        if (!this.isAvailable()) {
-            return false;
-        }
-        try {
-            (0, child_process_1.execSync)(`${this.qmdCommand} embed`, {
-                stdio: 'ignore',
-                timeout: 300000, // 5 minutes pour les embeddings
-                cwd: this.config.memoryDir
-            });
-            return true;
-        }
-        catch (error) {
-            // QMD embed failed silently
-            return false;
-        }
-    }
-    /**
-     * Liste les collections QMD
-     */
-    async collections() {
-        if (!this.isAvailable()) {
-            return [];
-        }
-        try {
-            const output = (0, child_process_1.execSync)(`${this.qmdCommand} collections --format json`, {
-                encoding: 'utf8',
-                timeout: 10000,
-                cwd: this.config.memoryDir
-            });
-            if (!output.trim()) {
-                return [];
-            }
-            const result = JSON.parse(output);
-            // Retourne la liste des noms de collections
-            if (result.collections && Array.isArray(result.collections)) {
-                return result.collections.map((col) => col.name || col);
-            }
-            return [];
-        }
-        catch (error) {
-            // QMD collections failed silently
-            return [];
-        }
-    }
-    /**
-     * Retourne le statut (nb fichiers, nb chunks, dernière mise à jour)
-     */
-    async status() {
-        if (!this.isAvailable()) {
-            return null;
-        }
-        try {
-            const output = (0, child_process_1.execSync)(`${this.qmdCommand} status --format json`, {
-                encoding: 'utf8',
-                timeout: 10000,
-                cwd: this.config.memoryDir
-            });
-            if (!output.trim()) {
-                return { files: 0, chunks: 0, lastUpdate: null };
-            }
-            const result = JSON.parse(output);
-            return {
-                files: result.files || 0,
-                chunks: result.chunks || 0,
-                lastUpdate: result.lastUpdate || null
-            };
-        }
-        catch (error) {
-            // QMD status check failed silently
-            return { files: 0, chunks: 0, lastUpdate: null };
-        }
-    }
-}
-exports.QMDManager = QMDManager;
-//# sourceMappingURL=qmd.js.map

package/dist/qmd.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"qmd.js","sourceRoot":"","sources":["../src/qmd.ts"],"names":[],"mappings":";;;AAAA,iDAAyC;AAGzC,MAAa,UAAU;IACb,MAAM,CAAe;IACrB,UAAU,CAAS;IAE3B,YAAY,MAAoB;QAC9B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,KAAK,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,WAAW;QACT,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YAC5B,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC;YACH,yCAAyC;YACzC,IAAA,wBAAQ,EAAC,GAAG,IAAI,CAAC,UAAU,YAAY,EAAE;gBACvC,KAAK,EAAE,QAAQ;gBACf,OAAO,EAAE,IAAI;aACd,CAAC,CAAC;YACH,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,UAAU,GAAG,EAAE;QACzC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAA,wBAAQ,EACrB,GAAG,IAAI,CAAC,UAAU,WAAW,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,aAAa,UAAU,gBAAgB,EAC9F;gBACE,QAAQ,EAAE,MAAM;gBAChB,OAAO,EAAE,KAAK;gBACd,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS;aAC3B,CACF,CAAC;YAEF,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnB,OAAO,EAAE,CAAC;YACZ,CAAC;YAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAElC,oEAAoE;YACpE,IAAI,MAAM,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;gBACpD,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAS,EAAE,EAAE,CAAC,CAAC;oBACxC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE;oBACrB,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC;oBACpB,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE;oBAC3B,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,CAAC;iBACvB,CAAC,CAAC,CAAC;YACN,CAAC;YAED,OAAO,EAAE,CAAC;QACZ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,6BAA6B;YAC7B,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM;QACV,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC;YACH,IAAA,wBAAQ,EAAC,GAAG,IAAI,CAAC,UAAU,SAAS,EAAE;gBACpC,KAAK,EAAE,QAAQ;gBACf,OAAO,EAAE,KAAK;gBACd,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS;aAC3B,CAAC,CAAC;YACH,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,6BAA6B;YAC7B,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC;YACH,IAAA,wBAAQ,EAAC,GAAG,IAAI,CAAC,UAAU,QAAQ,EAAE;gBACnC,KAAK,EAAE,QAAQ;gBACf,OAAO,EAAE,MAAM,EAAE,gCAAgC;gBACjD,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS;aAC3B,CAAC,CAAC;YACH,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,4BAA4B;YAC5B,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW;QACf,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAA,wBAAQ,EAAC,GAAG,IAAI,CAAC,UAAU,4BAA4B,EAAE;gBACtE,QAAQ,EAAE,MAAM;gBAChB,OAAO,EAAE,KAAK;gBACd,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS;aAC3B,CAAC,CAAC;YAEH,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnB,OAAO,EAAE,CAAC;YACZ,CAAC;YAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAElC,4CAA4C;YAC5C,IAAI,MAAM,CAAC,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC5D,OAAO,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;YAC/D,CAAC;YAED,OAAO,EAAE,CAAC;QACZ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,kCAAkC;YAClC,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM;QACV,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAA,wBAAQ,EAAC,GAAG,IAAI,CAAC,UAAU,uBAAuB,EAAE;gBACjE,QAAQ,EAAE,MAAM;gBAChB,OAAO,EAAE,KAAK;gBACd,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS;aAC3B,CAAC,CAAC;YAEH,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnB,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;YACnD,CAAC;YAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAElC,OAAO;gBACL,KAAK,EAAE,MAAM,CAAC,KAAK,IAAI,CAAC;gBACxB,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,CAAC;gBAC1B,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,IAAI;aACtC,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,mCAAmC;YACnC,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QACnD,CAAC;IACH,CAAC;CACF;AAhLD,gCAgLC"}