ai-mind-map 1.1.0

package/dist/memory/persistent-memory.js

@@ -0,0 +1,579 @@
+/**
+ * AI Mind Map — Persistent Memory Store
+ *
+ * Long-term memory with importance decay, BM25 text search (FTS5),
+ * category/tag filtering, deduplication via text similarity, and
+ * token-budget-constrained retrieval.
+ *
+ * Inspired by Mem0's memory lifecycle:
+ *   create → access (boost) → decay → prune
+ *
+ * @module memory/persistent-memory
+ */
+// ────────────────────────────────────────────────────────────────
+// Constants
+// ────────────────────────────────────────────────────────────────
+/** Default importance by category (higher = more important). */
+const CATEGORY_IMPORTANCE = {
+    architecture: 0.9,
+    gotcha: 0.85,
+    convention: 0.8,
+    decision: 0.8,
+    lesson_learned: 0.75,
+    dependency: 0.7,
+    workflow: 0.7,
+    context: 0.6,
+    preference: 0.55,
+    todo: 0.5,
+};
+/** Rough estimate: 1 token ≈ 4 characters. */
+const CHARS_PER_TOKEN = 4;
+// ────────────────────────────────────────────────────────────────
+// PersistentMemory Class
+// ────────────────────────────────────────────────────────────────
+/**
+ * Long-term memory store with decay, boosting, FTS5 search, and deduplication.
+ *
+ * All mutations are synchronous (better-sqlite3) and WAL-mode safe.
+ */
+export class PersistentMemory {
+    db;
+    decayRate;
+    maxMemories;
+    importanceThreshold;
+    // ── Prepared statements ────────────────────────────────────
+    stmtInsert;
+    stmtUpdate;
+    stmtDelete;
+    stmtGetById;
+    stmtBumpAccess;
+    stmtAll;
+    stmtCount;
+    stmtCategoryCount;
+    stmtAvgImportance;
+    stmtOldest;
+    stmtNewest;
+    stmtTotalAccess;
+    stmtPrunable;
+    stmtSearchFts;
+    constructor(db, config) {
+        this.db = db;
+        this.decayRate = config?.decayRate ?? 0.95;
+        this.maxMemories = config?.maxMemories ?? 500;
+        this.importanceThreshold = config?.importanceThreshold ?? 0.1;
+        this.ensureSchema();
+        this.prepareStatements();
+    }
+    // ────────────────────────────────────────────────────────────
+    // Schema
+    // ────────────────────────────────────────────────────────────
+    ensureSchema() {
+        this.db.exec(`
+      CREATE TABLE IF NOT EXISTS memories (
+        id              INTEGER PRIMARY KEY AUTOINCREMENT,
+        category        TEXT NOT NULL,
+        content         TEXT NOT NULL,
+        importance      REAL NOT NULL,
+        tags            TEXT NOT NULL DEFAULT '[]',
+        related_files   TEXT NOT NULL DEFAULT '[]',
+        created_at      INTEGER NOT NULL,
+        last_accessed_at INTEGER NOT NULL,
+        access_count    INTEGER NOT NULL DEFAULT 0,
+        session_id      TEXT NOT NULL DEFAULT '',
+        source          TEXT NOT NULL DEFAULT 'agent'
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_memories_category   ON memories(category);
+      CREATE INDEX IF NOT EXISTS idx_memories_importance  ON memories(importance DESC);
+      CREATE INDEX IF NOT EXISTS idx_memories_accessed    ON memories(last_accessed_at DESC);
+    `);
+        // FTS5 virtual table — created only if it doesn't already exist.
+        // We use a content-sync approach: manual sync via triggers.
+        try {
+            this.db.exec(`
+        CREATE VIRTUAL TABLE IF NOT EXISTS memories_fts USING fts5(
+          content,
+          category,
+          tags,
+          content='memories',
+          content_rowid='id',
+          tokenize='porter unicode61'
+        );
+      `);
+        }
+        catch {
+            // FTS table may already exist; ignore duplicate errors.
+        }
+        // Sync triggers — keep FTS in lockstep with the main table.
+        this.db.exec(`
+      CREATE TRIGGER IF NOT EXISTS memories_ai AFTER INSERT ON memories BEGIN
+        INSERT INTO memories_fts(rowid, content, category, tags)
+        VALUES (new.id, new.content, new.category, new.tags);
+      END;
+
+      CREATE TRIGGER IF NOT EXISTS memories_ad AFTER DELETE ON memories BEGIN
+        INSERT INTO memories_fts(memories_fts, rowid, content, category, tags)
+        VALUES ('delete', old.id, old.content, old.category, old.tags);
+      END;
+
+      CREATE TRIGGER IF NOT EXISTS memories_au AFTER UPDATE OF content, category, tags ON memories BEGIN
+        INSERT INTO memories_fts(memories_fts, rowid, content, category, tags)
+        VALUES ('delete', old.id, old.content, old.category, old.tags);
+        INSERT INTO memories_fts(rowid, content, category, tags)
+        VALUES (new.id, new.content, new.category, new.tags);
+      END;
+    `);
+    }
+    prepareStatements() {
+        this.stmtInsert = this.db.prepare(`
+      INSERT INTO memories (category, content, importance, tags, related_files,
+                            created_at, last_accessed_at, access_count, session_id, source)
+      VALUES (?, ?, ?, ?, ?, ?, ?, 0, ?, ?)
+    `);
+        this.stmtUpdate = this.db.prepare(`
+      UPDATE memories
+      SET category = ?, content = ?, importance = ?, tags = ?, related_files = ?,
+          last_accessed_at = ?, session_id = ?, source = ?
+      WHERE id = ?
+    `);
+        this.stmtDelete = this.db.prepare(`DELETE FROM memories WHERE id = ?`);
+        this.stmtGetById = this.db.prepare(`SELECT * FROM memories WHERE id = ?`);
+        this.stmtBumpAccess = this.db.prepare(`
+      UPDATE memories
+      SET access_count = access_count + 1,
+          last_accessed_at = ?,
+          importance = MIN(1.0, importance + 0.1)
+      WHERE id = ?
+    `);
+        this.stmtAll = this.db.prepare(`SELECT * FROM memories ORDER BY importance DESC`);
+        this.stmtCount = this.db.prepare(`SELECT COUNT(*) AS cnt FROM memories`);
+        this.stmtCategoryCount = this.db.prepare(`SELECT category, COUNT(*) AS cnt FROM memories GROUP BY category`);
+        this.stmtAvgImportance = this.db.prepare(`SELECT AVG(importance) AS avg FROM memories`);
+        this.stmtOldest = this.db.prepare(`SELECT MIN(created_at) AS ts FROM memories`);
+        this.stmtNewest = this.db.prepare(`SELECT MAX(created_at) AS ts FROM memories`);
+        this.stmtTotalAccess = this.db.prepare(`SELECT SUM(access_count) AS total FROM memories`);
+        this.stmtPrunable = this.db.prepare(`
+      SELECT id FROM memories
+      WHERE importance < ?
+      ORDER BY importance ASC, last_accessed_at ASC
+      LIMIT ?
+    `);
+        this.stmtSearchFts = this.db.prepare(`
+      SELECT m.*, bm25(memories_fts, 10.0, 5.0, 2.0) AS rank
+      FROM memories_fts f
+      JOIN memories m ON m.id = f.rowid
+      WHERE memories_fts MATCH ?
+      ORDER BY rank
+    `);
+    }
+    // ────────────────────────────────────────────────────────────
+    // CRUD
+    // ────────────────────────────────────────────────────────────
+    /**
+     * Create a new memory, with automatic deduplication.
+     *
+     * If a sufficiently similar memory already exists (≥ 0.8 Jaccard similarity
+     * on word sets), the existing memory is *merged* instead of creating a
+     * duplicate.
+     *
+     * @returns The memory (new or merged).
+     */
+    createMemory(input) {
+        const now = Date.now();
+        const importance = input.importance ?? CATEGORY_IMPORTANCE[input.category] ?? 0.5;
+        const tags = input.tags ?? [];
+        const relatedFiles = input.relatedFiles ?? [];
+        const sessionId = input.sessionId ?? '';
+        const source = input.source ?? 'agent';
+        // ── Deduplication ────────────────────────────────────────
+        const existing = this.findDuplicate(input.content, input.category);
+        if (existing) {
+            return this.mergeMemory(existing, input, now);
+        }
+        // ── Insert ───────────────────────────────────────────────
+        const info = this.stmtInsert.run(input.category, input.content, importance, JSON.stringify(tags), JSON.stringify(relatedFiles), now, now, sessionId, source);
+        // ── Prune if over capacity ───────────────────────────────
+        this.pruneIfNeeded();
+        return this.rowToMemory({
+            id: Number(info.lastInsertRowid),
+            category: input.category,
+            content: input.content,
+            importance,
+            tags: JSON.stringify(tags),
+            related_files: JSON.stringify(relatedFiles),
+            created_at: now,
+            last_accessed_at: now,
+            access_count: 0,
+            session_id: sessionId,
+            source,
+        });
+    }
+    /**
+     * Retrieve a single memory by ID, boosting its importance.
+     */
+    getMemory(id) {
+        const row = this.stmtGetById.get(id);
+        if (!row)
+            return null;
+        // Boost on access
+        this.stmtBumpAccess.run(Date.now(), id);
+        // Re-read after boost
+        const updated = this.stmtGetById.get(id);
+        return this.rowToMemory(updated);
+    }
+    /**
+     * Update an existing memory.
+     */
+    updateMemory(id, updates) {
+        const existing = this.stmtGetById.get(id);
+        if (!existing)
+            return null;
+        const now = Date.now();
+        this.stmtUpdate.run(updates.category ?? existing.category, updates.content ?? existing.content, updates.importance ?? existing.importance, JSON.stringify(updates.tags ?? JSON.parse(existing.tags)), JSON.stringify(updates.relatedFiles ?? JSON.parse(existing.related_files)), now, updates.sessionId ?? existing.session_id, updates.source ?? existing.source, id);
+        const updated = this.stmtGetById.get(id);
+        return this.rowToMemory(updated);
+    }
+    /**
+     * Delete a memory by ID.
+     *
+     * @returns `true` if the memory existed.
+     */
+    deleteMemory(id) {
+        const info = this.stmtDelete.run(id);
+        return info.changes > 0;
+    }
+    // ────────────────────────────────────────────────────────────
+    // Retrieval
+    // ────────────────────────────────────────────────────────────
+    /**
+     * Query memories with optional FTS5 text search, category/tag filters,
+     * importance threshold, and token budget.
+     *
+     * Results are ranked by a composite score:
+     *   0.5 × textRelevance  +  0.3 × importance  +  0.2 × recency
+     */
+    queryMemories(query) {
+        const limit = query.limit ?? 20;
+        let rows;
+        // ── FTS path ─────────────────────────────────────────────
+        if (query.text && query.text.trim().length > 0) {
+            const ftsQuery = this.buildFtsQuery(query.text);
+            try {
+                rows = this.stmtSearchFts.all(ftsQuery);
+            }
+            catch {
+                // FTS query syntax error — fall back to LIKE search
+                rows = this.fallbackLikeSearch(query.text);
+            }
+        }
+        else {
+            rows = this.stmtAll.all();
+        }
+        // ── Post-filter ──────────────────────────────────────────
+        let memories = rows.map(r => this.rowToMemory(r));
+        if (query.categories && query.categories.length > 0) {
+            const set = new Set(query.categories);
+            memories = memories.filter(m => set.has(m.category));
+        }
+        if (query.tags && query.tags.length > 0) {
+            const tagSet = new Set(query.tags.map(t => t.toLowerCase()));
+            memories = memories.filter(m => m.tags.some(t => tagSet.has(t.toLowerCase())));
+        }
+        if (query.relatedFiles && query.relatedFiles.length > 0) {
+            const fileSet = new Set(query.relatedFiles.map(f => this.normalizePath(f)));
+            memories = memories.filter(m => m.relatedFiles.some(rf => fileSet.has(this.normalizePath(rf))));
+        }
+        if (query.minImportance !== undefined) {
+            memories = memories.filter(m => m.importance >= query.minImportance);
+        }
+        // ── Rank by composite score ──────────────────────────────
+        const now = Date.now();
+        const maxRank = rows.length > 0
+            ? Math.max(...rows.map(r => Math.abs(r.rank ?? 0)), 1)
+            : 1;
+        memories.sort((a, b) => {
+            const scoreA = this.compositeScore(a, rows, maxRank, now);
+            const scoreB = this.compositeScore(b, rows, maxRank, now);
+            return scoreB - scoreA; // descending
+        });
+        // ── Apply limit ──────────────────────────────────────────
+        memories = memories.slice(0, limit);
+        // ── Apply token budget ───────────────────────────────────
+        if (query.tokenBudget !== undefined && query.tokenBudget > 0) {
+            memories = this.applyTokenBudget(memories, query.tokenBudget);
+        }
+        // ── Boost accessed memories ──────────────────────────────
+        const bumpTxn = this.db.transaction((ids) => {
+            const bumpNow = Date.now();
+            for (const id of ids) {
+                this.stmtBumpAccess.run(bumpNow, id);
+            }
+        });
+        bumpTxn(memories.map(m => m.id));
+        return memories;
+    }
+    // ────────────────────────────────────────────────────────────
+    // Decay & Pruning
+    // ────────────────────────────────────────────────────────────
+    /**
+     * Apply time-based importance decay to all memories.
+     *
+     * Each memory's importance is multiplied by `decayRate ^ daysSinceLastAccess`.
+     * Call this periodically (e.g. once per session start).
+     */
+    applyDecay() {
+        const now = Date.now();
+        const allRows = this.stmtAll.all();
+        let decayed = 0;
+        const txn = this.db.transaction(() => {
+            const updateStmt = this.db.prepare(`UPDATE memories SET importance = ? WHERE id = ?`);
+            for (const row of allRows) {
+                const lastAccessed = row.last_accessed_at;
+                const daysSince = (now - lastAccessed) / (1000 * 60 * 60 * 24);
+                if (daysSince < 0.01)
+                    continue; // Skip very recent
+                const currentImportance = row.importance;
+                const newImportance = currentImportance * Math.pow(this.decayRate, daysSince);
+                if (Math.abs(newImportance - currentImportance) > 0.001) {
+                    updateStmt.run(Math.max(0, newImportance), row.id);
+                    decayed++;
+                }
+            }
+        });
+        txn();
+        // Prune memories that fell below threshold
+        this.pruneIfNeeded();
+        return decayed;
+    }
+    /**
+     * Remove low-importance memories when capacity is exceeded.
+     *
+     * @returns Number of memories pruned.
+     */
+    pruneIfNeeded() {
+        const countRow = this.stmtCount.get();
+        const excess = countRow.cnt - this.maxMemories;
+        if (excess <= 0)
+            return 0;
+        const toPrune = this.stmtPrunable.all(this.importanceThreshold, excess);
+        if (toPrune.length === 0)
+            return 0;
+        const txn = this.db.transaction(() => {
+            for (const { id } of toPrune) {
+                this.stmtDelete.run(id);
+            }
+        });
+        txn();
+        return toPrune.length;
+    }
+    // ────────────────────────────────────────────────────────────
+    // Bulk Operations
+    // ────────────────────────────────────────────────────────────
+    /**
+     * Export all memories as a JSON-serializable array.
+     */
+    exportMemories() {
+        const rows = this.stmtAll.all();
+        return rows.map(r => this.rowToMemory(r));
+    }
+    /**
+     * Import memories from a JSON array.
+     *
+     * Deduplication is applied per memory. Existing memories are merged.
+     *
+     * @returns Number of memories imported (created + merged).
+     */
+    importMemories(memories) {
+        let imported = 0;
+        const txn = this.db.transaction(() => {
+            for (const mem of memories) {
+                this.createMemory(mem);
+                imported++;
+            }
+        });
+        txn();
+        return imported;
+    }
+    // ────────────────────────────────────────────────────────────
+    // Statistics
+    // ────────────────────────────────────────────────────────────
+    /** Aggregate statistics about the memory store. */
+    getStats() {
+        const countRow = this.stmtCount.get();
+        const avgRow = this.stmtAvgImportance.get();
+        const oldestRow = this.stmtOldest.get();
+        const newestRow = this.stmtNewest.get();
+        const totalAccessRow = this.stmtTotalAccess.get();
+        const catRows = this.stmtCategoryCount.all();
+        const byCategory = {};
+        for (const { category, cnt } of catRows) {
+            byCategory[category] = cnt;
+        }
+        return {
+            totalMemories: countRow.cnt,
+            byCategory,
+            averageImportance: avgRow.avg ?? 0,
+            oldestCreatedAt: oldestRow.ts,
+            newestCreatedAt: newestRow.ts,
+            totalAccessCount: totalAccessRow.total ?? 0,
+        };
+    }
+    // ────────────────────────────────────────────────────────────
+    // Deduplication
+    // ────────────────────────────────────────────────────────────
+    /**
+     * Find an existing memory that's similar enough to be considered a duplicate.
+     *
+     * Uses Jaccard similarity on word sets with a threshold of 0.8.
+     */
+    findDuplicate(content, category) {
+        // Only compare within same category for speed
+        const candidates = this.db
+            .prepare(`SELECT * FROM memories WHERE category = ?`)
+            .all(category);
+        const inputWords = this.tokenize(content);
+        const SIMILARITY_THRESHOLD = 0.8;
+        for (const row of candidates) {
+            const existingWords = this.tokenize(row.content);
+            const sim = this.jaccardSimilarity(inputWords, existingWords);
+            if (sim >= SIMILARITY_THRESHOLD) {
+                return row;
+            }
+        }
+        return null;
+    }
+    /**
+     * Merge new content into an existing memory.
+     *
+     * Strategy:
+     * - Content: keep longer text (or combine if meaningfully different)
+     * - Tags: union
+     * - Files: union
+     * - Importance: max
+     * - Bump access count
+     */
+    mergeMemory(existing, input, now) {
+        const existingTags = JSON.parse(existing.tags);
+        const existingFiles = JSON.parse(existing.related_files);
+        const mergedTags = [...new Set([...existingTags, ...(input.tags ?? [])])];
+        const mergedFiles = [...new Set([...existingFiles, ...(input.relatedFiles ?? [])])];
+        // Keep the longer/more detailed content
+        const existingContent = existing.content;
+        const mergedContent = input.content.length > existingContent.length
+            ? input.content
+            : existingContent;
+        const mergedImportance = Math.min(1.0, Math.max(existing.importance, input.importance ?? CATEGORY_IMPORTANCE[input.category] ?? 0.5) + 0.05);
+        const id = existing.id;
+        this.stmtUpdate.run(input.category, mergedContent, mergedImportance, JSON.stringify(mergedTags), JSON.stringify(mergedFiles), now, input.sessionId ?? existing.session_id, input.source ?? existing.source, id);
+        // Bump access
+        this.stmtBumpAccess.run(now, id);
+        const updated = this.stmtGetById.get(id);
+        return this.rowToMemory(updated);
+    }
+    // ────────────────────────────────────────────────────────────
+    // FTS Helpers
+    // ────────────────────────────────────────────────────────────
+    /**
+     * Sanitize user input for FTS5 query syntax.
+     *
+     * Wraps each word in quotes to avoid operators being misinterpreted.
+     */
+    buildFtsQuery(text) {
+        const words = text
+            .replace(/[^\w\s]/g, ' ')
+            .split(/\s+/)
+            .filter(w => w.length > 0);
+        if (words.length === 0)
+            return '""';
+        // Join with OR for broader matching
+        return words.map(w => `"${w}"`).join(' OR ');
+    }
+    /**
+     * Fallback search when FTS query fails (e.g. special characters).
+     */
+    fallbackLikeSearch(text) {
+        const pattern = `%${text}%`;
+        return this.db
+            .prepare(`SELECT *, 0 AS rank FROM memories WHERE content LIKE ? ORDER BY importance DESC LIMIT 50`)
+            .all(pattern);
+    }
+    // ────────────────────────────────────────────────────────────
+    // Scoring & Token Budget
+    // ────────────────────────────────────────────────────────────
+    /**
+     * Compute composite relevance score for ranking.
+     *
+     * Score = 0.5 × textRelevance + 0.3 × importance + 0.2 × recency
+     */
+    compositeScore(memory, rawRows, maxRank, now) {
+        // Text relevance (from BM25 rank — lower is more relevant)
+        const rawRow = rawRows.find(r => r.id === memory.id);
+        const rank = rawRow ? Math.abs(rawRow.rank ?? 0) : 0;
+        const textScore = maxRank > 0 ? 1 - rank / maxRank : 0;
+        // Recency (exponential decay over 30 days)
+        const daysSinceAccess = (now - memory.lastAccessedAt) / (1000 * 60 * 60 * 24);
+        const recencyScore = Math.exp(-daysSinceAccess / 30);
+        return 0.5 * textScore + 0.3 * memory.importance + 0.2 * recencyScore;
+    }
+    /**
+     * Trim the result set so total estimated tokens ≤ budget.
+     */
+    applyTokenBudget(memories, budget) {
+        const result = [];
+        let usedTokens = 0;
+        for (const mem of memories) {
+            const estimatedTokens = Math.ceil(mem.content.length / CHARS_PER_TOKEN);
+            if (usedTokens + estimatedTokens > budget)
+                break;
+            result.push(mem);
+            usedTokens += estimatedTokens;
+        }
+        return result;
+    }
+    // ────────────────────────────────────────────────────────────
+    // Text Similarity Helpers
+    // ────────────────────────────────────────────────────────────
+    /** Tokenize content into a set of lowercase words. */
+    tokenize(text) {
+        return new Set(text
+            .toLowerCase()
+            .replace(/[^\w\s]/g, ' ')
+            .split(/\s+/)
+            .filter(w => w.length > 1));
+    }
+    /** Jaccard similarity between two word sets. */
+    jaccardSimilarity(a, b) {
+        if (a.size === 0 && b.size === 0)
+            return 1;
+        let intersection = 0;
+        for (const word of a) {
+            if (b.has(word))
+                intersection++;
+        }
+        const union = a.size + b.size - intersection;
+        return union === 0 ? 0 : intersection / union;
+    }
+    /** Normalize file paths for comparison. */
+    normalizePath(p) {
+        return p.replace(/\\/g, '/').toLowerCase();
+    }
+    // ────────────────────────────────────────────────────────────
+    // Row → Domain Object
+    // ────────────────────────────────────────────────────────────
+    rowToMemory(row) {
+        return {
+            id: row.id,
+            category: row.category,
+            content: row.content,
+            importance: row.importance,
+            tags: JSON.parse(row.tags || '[]'),
+            relatedFiles: JSON.parse(row.related_files || '[]'),
+            createdAt: row.created_at,
+            lastAccessedAt: row.last_accessed_at,
+            accessCount: row.access_count,
+            sessionId: row.session_id,
+            source: row.source,
+        };
+    }
+}
+//# sourceMappingURL=persistent-memory.js.map

package/dist/memory/persistent-memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"persistent-memory.js","sourceRoot":"","sources":["../../src/memory/persistent-memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAKH,mEAAmE;AACnE,YAAY;AACZ,mEAAmE;AAEnE,gEAAgE;AAChE,MAAM,mBAAmB,GAAmC;IAC1D,YAAY,EAAE,GAAG;IACjB,MAAM,EAAE,IAAI;IACZ,UAAU,EAAE,GAAG;IACf,QAAQ,EAAE,GAAG;IACb,cAAc,EAAE,IAAI;IACpB,UAAU,EAAE,GAAG;IACf,QAAQ,EAAE,GAAG;IACb,OAAO,EAAE,GAAG;IACZ,UAAU,EAAE,IAAI;IAChB,IAAI,EAAE,GAAG;CACV,CAAC;AAEF,8CAA8C;AAC9C,MAAM,eAAe,GAAG,CAAC,CAAC;AA6C1B,mEAAmE;AACnE,yBAAyB;AACzB,mEAAmE;AAEnE;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IACnB,EAAE,CAAoB;IACtB,SAAS,CAAS;IAClB,WAAW,CAAS;IACpB,mBAAmB,CAAS;IAEpC,8DAA8D;IACtD,UAAU,CAAsB;IAChC,UAAU,CAAsB;IAChC,UAAU,CAAsB;IAChC,WAAW,CAAsB;IACjC,cAAc,CAAsB;IACpC,OAAO,CAAsB;IAC7B,SAAS,CAAsB;IAC/B,iBAAiB,CAAsB;IACvC,iBAAiB,CAAsB;IACvC,UAAU,CAAsB;IAChC,UAAU,CAAsB;IAChC,eAAe,CAAsB;IACrC,YAAY,CAAsB;IAClC,aAAa,CAAsB;IAE3C,YACE,EAAqB,EACrB,MAA2F;QAE3F,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,SAAS,GAAG,MAAM,EAAE,SAAS,IAAI,IAAI,CAAC;QAC3C,IAAI,CAAC,WAAW,GAAG,MAAM,EAAE,WAAW,IAAI,GAAG,CAAC;QAC9C,IAAI,CAAC,mBAAmB,GAAG,MAAM,EAAE,mBAAmB,IAAI,GAAG,CAAC;QAE9D,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,iBAAiB,EAAE,CAAC;IAC3B,CAAC;IAED,+DAA+D;IAC/D,SAAS;IACT,+DAA+D;IAEvD,YAAY;QAClB,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;KAkBZ,CAAC,CAAC;QAEH,iEAAiE;QACjE,4DAA4D;QAC5D,IAAI,CAAC;YACH,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;OASZ,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,wDAAwD;QAC1D,CAAC;QAED,4DAA4D;QAC5D,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;KAiBZ,CAAC,CAAC;IACL,CAAC;IAEO,iBAAiB;QACvB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAIjC,CAAC,CAAC;QACH,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;KAKjC,CAAC,CAAC;QACH,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC;QACvE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC;QAC1E,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;KAMrC,CAAC,CAAC;QACH,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,iDAAiD,CAAC,CAAC;QAClF,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,sCAAsC,CAAC,CAAC;QACzE,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACtC,kEAAkE,CACnE,CAAC;QACF,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACtC,6CAA6C,CAC9C,CAAC;QACF,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC/B,4CAA4C,CAC7C,CAAC;QACF,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC/B,4CAA4C,CAC7C,CAAC;QACF,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACpC,iDAAiD,CAClD,CAAC;QACF,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;KAKnC,CAAC,CAAC;QACH,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;KAMpC,CAAC,CAAC;IACL,CAAC;IAED,+DAA+D;IAC/D,OAAO;IACP,+DAA+D;IAE/D;;;;;;;;OAQG;IACH,YAAY,CAAC,KAAwB;QACnC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,IAAI,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;QAClF,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;QAC9B,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,IAAI,EAAE,CAAC;QAC9C,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC;QACxC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,OAAO,CAAC;QAEvC,4DAA4D;QAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;QACnE,IAAI,QAAQ,EAAE,CAAC;YACb,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,CAAC;QAED,4DAA4D;QAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAC9B,KAAK,CAAC,QAAQ,EACd,KAAK,CAAC,OAAO,EACb,UAAU,EACV,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EACpB,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,EAC5B,GAAG,EACH,GAAG,EACH,SAAS,EACT,MAAM,CACP,CAAC;QAEF,4DAA4D;QAC5D,IAAI,CAAC,aAAa,EAAE,CAAC;QAErB,OAAO,IAAI,CAAC,WAAW,CAAC;YACtB,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC;YAChC,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU;YACV,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YAC1B,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC;YAC3C,UAAU,EAAE,GAAG;YACf,gBAAgB,EAAE,GAAG;YACrB,YAAY,EAAE,CAAC;YACf,UAAU,EAAE,SAAS;YACrB,MAAM;SACP,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,EAAU;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAwC,CAAC;QAC5E,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAEtB,kBAAkB;QAClB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;QAExC,sBAAsB;QACtB,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAA4B,CAAC;QACpE,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,EAAU,EAAE,OAAmC;QAC1D,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAwC,CAAC;QACjF,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;QAE3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,UAAU,CAAC,GAAG,CACjB,OAAO,CAAC,QAAQ,IAAI,QAAQ,CAAC,QAAQ,EACrC,OAAO,CAAC,OAAO,IAAI,QAAQ,CAAC,OAAO,EACnC,OAAO,CAAC,UAAU,IAAI,QAAQ,CAAC,UAAU,EACzC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAc,CAAC,CAAC,EACnE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,aAAuB,CAAC,CAAC,EACpF,GAAG,EACH,OAAO,CAAC,SAAS,IAAI,QAAQ,CAAC,UAAU,EACxC,OAAO,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,EACjC,EAAE,CACH,CAAC;QAEF,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAA4B,CAAC;QACpE,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACH,YAAY,CAAC,EAAU;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,+DAA+D;IAC/D,YAAY;IACZ,+DAA+D;IAE/D;;;;;;OAMG;IACH,aAAa,CAAC,KAAkB;QAC9B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;QAEhC,IAAI,IAA+B,CAAC;QAEpC,4DAA4D;QAC5D,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAChD,IAAI,CAAC;gBACH,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAA8B,CAAC;YACvE,CAAC;YAAC,MAAM,CAAC;gBACP,oDAAoD;gBACpD,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAA+B,CAAC;QACzD,CAAC;QAED,4DAA4D;QAC5D,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAElD,IAAI,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACtC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACvD,CAAC;QAED,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAC7D,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAC7B,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAC9C,CAAC;QACJ,CAAC;QAED,IAAI,KAAK,CAAC,YAAY,IAAI,KAAK,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5E,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAC7B,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAC/D,CAAC;QACJ,CAAC;QAED,IAAI,KAAK,CAAC,aAAa,KAAK,SAAS,EAAE,CAAC;YACtC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,KAAK,CAAC,aAAc,CAAC,CAAC;QACxE,CAAC;QAED,4DAA4D;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;YAC7B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAE,CAAC,CAAC,IAAe,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClE,CAAC,CAAC,CAAC,CAAC;QAEN,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACrB,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;YAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;YAC1D,OAAO,MAAM,GAAG,MAAM,CAAC,CAAC,aAAa;QACvC,CAAC,CAAC,CAAC;QAEH,4DAA4D;QAC5D,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAEpC,4DAA4D;QAC5D,IAAI,KAAK,CAAC,WAAW,KAAK,SAAS,IAAI,KAAK,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YAC7D,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC;QAChE,CAAC;QAED,4DAA4D;QAC5D,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,GAAa,EAAE,EAAE;YACpD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC3B,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;gBACrB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACvC,CAAC;QACH,CAAC,CAAC,CAAC;QACH,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEjC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,+DAA+D;IAC/D,kBAAkB;IAClB,+DAA+D;IAE/D;;;;;OAKG;IACH,UAAU;QACR,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAA+B,CAAC;QAChE,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACnC,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAChC,iDAAiD,CAClD,CAAC;YACF,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;gBAC1B,MAAM,YAAY,GAAG,GAAG,CAAC,gBAA0B,CAAC;gBACpD,MAAM,SAAS,GAAG,CAAC,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC/D,IAAI,SAAS,GAAG,IAAI;oBAAE,SAAS,CAAC,mBAAmB;gBAEnD,MAAM,iBAAiB,GAAG,GAAG,CAAC,UAAoB,CAAC;gBACnD,MAAM,aAAa,GAAG,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBAE9E,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,iBAAiB,CAAC,GAAG,KAAK,EAAE,CAAC;oBACxD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;oBACnD,OAAO,EAAE,CAAC;gBACZ,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QACH,GAAG,EAAE,CAAC;QAEN,2CAA2C;QAC3C,IAAI,CAAC,aAAa,EAAE,CAAC;QAErB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,aAAa;QACX,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,EAAqB,CAAC;QACzD,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QAC/C,IAAI,MAAM,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAE1B,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,EAAE,MAAM,CAAqB,CAAC;QAC5F,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEnC,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACnC,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC,CAAC,CAAC;QACH,GAAG,EAAE,CAAC;QAEN,OAAO,OAAO,CAAC,MAAM,CAAC;IACxB,CAAC;IAED,+DAA+D;IAC/D,kBAAkB;IAClB,+DAA+D;IAE/D;;OAEG;IACH,cAAc;QACZ,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAA+B,CAAC;QAC7D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,QAA6B;QAC1C,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACnC,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;gBACvB,QAAQ,EAAE,CAAC;YACb,CAAC;QACH,CAAC,CAAC,CAAC;QACH,GAAG,EAAE,CAAC;QACN,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,+DAA+D;IAC/D,aAAa;IACb,+DAA+D;IAE/D,mDAAmD;IACnD,QAAQ;QACN,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,EAAqB,CAAC;QACzD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAA4B,CAAC;QACtE,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,EAA2B,CAAC;QACjE,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,EAA2B,CAAC;QACjE,MAAM,cAAc,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,EAA8B,CAAC;QAC9E,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAyC,CAAC;QAEpF,MAAM,UAAU,GAA2B,EAAE,CAAC;QAC9C,KAAK,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,OAAO,EAAE,CAAC;YACxC,UAAU,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;QAC7B,CAAC;QAED,OAAO;YACL,aAAa,EAAE,QAAQ,CAAC,GAAG;YAC3B,UAAU;YACV,iBAAiB,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;YAClC,eAAe,EAAE,SAAS,CAAC,EAAE;YAC7B,eAAe,EAAE,SAAS,CAAC,EAAE;YAC7B,gBAAgB,EAAE,cAAc,CAAC,KAAK,IAAI,CAAC;SAC5C,CAAC;IACJ,CAAC;IAED,+DAA+D;IAC/D,gBAAgB;IAChB,+DAA+D;IAE/D;;;;OAIG;IACK,aAAa,CACnB,OAAe,EACf,QAAwB;QAExB,8CAA8C;QAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE;aACvB,OAAO,CAAC,2CAA2C,CAAC;aACpD,GAAG,CAAC,QAAQ,CAA8B,CAAC;QAE9C,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC1C,MAAM,oBAAoB,GAAG,GAAG,CAAC;QAEjC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAiB,CAAC,CAAC;YAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;YAC9D,IAAI,GAAG,IAAI,oBAAoB,EAAE,CAAC;gBAChC,OAAO,GAAG,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;OASG;IACK,WAAW,CACjB,QAAiC,EACjC,KAAwB,EACxB,GAAW;QAEX,MAAM,YAAY,GAAa,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAc,CAAC,CAAC;QACnE,MAAM,aAAa,GAAa,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,aAAuB,CAAC,CAAC;QAE7E,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,aAAa,EAAE,GAAG,CAAC,KAAK,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpF,wCAAwC;QACxC,MAAM,eAAe,GAAG,QAAQ,CAAC,OAAiB,CAAC;QACnD,MAAM,aAAa,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM;YACjE,CAAC,CAAC,KAAK,CAAC,OAAO;YACf,CAAC,CAAC,eAAe,CAAC;QAEpB,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAC/B,GAAG,EACH,IAAI,CAAC,GAAG,CACN,QAAQ,CAAC,UAAoB,EAC7B,KAAK,CAAC,UAAU,IAAI,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,GAAG,CAC/D,GAAG,IAAI,CACT,CAAC;QAEF,MAAM,EAAE,GAAG,QAAQ,CAAC,EAAY,CAAC;QACjC,IAAI,CAAC,UAAU,CAAC,GAAG,CACjB,KAAK,CAAC,QAAQ,EACd,aAAa,EACb,gBAAgB,EAChB,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,EAC1B,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAC3B,GAAG,EACH,KAAK,CAAC,SAAS,IAAI,QAAQ,CAAC,UAAU,EACtC,KAAK,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,EAC/B,EAAE,CACH,CAAC;QAEF,cAAc;QACd,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAEjC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAA4B,CAAC;QACpE,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IAED,+DAA+D;IAC/D,cAAc;IACd,+DAA+D;IAE/D;;;;OAIG;IACK,aAAa,CAAC,IAAY;QAChC,MAAM,KAAK,GAAG,IAAI;aACf,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;aACxB,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAE7B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEpC,oCAAoC;QACpC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,IAAY;QACrC,MAAM,OAAO,GAAG,IAAI,IAAI,GAAG,CAAC;QAC5B,OAAO,IAAI,CAAC,EAAE;aACX,OAAO,CACN,0FAA0F,CAC3F;aACA,GAAG,CAAC,OAAO,CAA8B,CAAC;IAC/C,CAAC;IAED,+DAA+D;IAC/D,yBAAyB;IACzB,+DAA+D;IAE/D;;;;OAIG;IACK,cAAc,CACpB,MAAc,EACd,OAAkC,EAClC,OAAe,EACf,GAAW;QAEX,2DAA2D;QAC3D,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC,EAAa,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;QACjE,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAE,MAAM,CAAC,IAAe,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,MAAM,SAAS,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAEvD,2CAA2C;QAC3C,MAAM,eAAe,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9E,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,eAAe,GAAG,EAAE,CAAC,CAAC;QAErD,OAAO,GAAG,GAAG,SAAS,GAAG,GAAG,GAAG,MAAM,CAAC,UAAU,GAAG,GAAG,GAAG,YAAY,CAAC;IACxE,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,QAAkB,EAAE,MAAc;QACzD,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,eAAe,CAAC,CAAC;YACxE,IAAI,UAAU,GAAG,eAAe,GAAG,MAAM;gBAAE,MAAM;YACjD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,UAAU,IAAI,eAAe,CAAC;QAChC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,+DAA+D;IAC/D,0BAA0B;IAC1B,+DAA+D;IAE/D,sDAAsD;IAC9C,QAAQ,CAAC,IAAY;QAC3B,OAAO,IAAI,GAAG,CACZ,IAAI;aACD,WAAW,EAAE;aACb,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;aACxB,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC7B,CAAC;IACJ,CAAC;IAED,gDAAgD;IACxC,iBAAiB,CAAC,CAAc,EAAE,CAAc;QACtD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,YAAY,EAAE,CAAC;QAClC,CAAC;QACD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC;QAC7C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;IAChD,CAAC;IAED,2CAA2C;IACnC,aAAa,CAAC,CAAS;QAC7B,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAC7C,CAAC;IAED,+DAA+D;IAC/D,sBAAsB;IACtB,+DAA+D;IAEvD,WAAW,CAAC,GAA4B;QAC9C,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAY;YACpB,QAAQ,EAAE,GAAG,CAAC,QAA0B;YACxC,OAAO,EAAE,GAAG,CAAC,OAAiB;YAC9B,UAAU,EAAE,GAAG,CAAC,UAAoB;YACpC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAE,GAAG,CAAC,IAAe,IAAI,IAAI,CAAC;YAC9C,YAAY,EAAE,IAAI,CAAC,KAAK,CAAE,GAAG,CAAC,aAAwB,IAAI,IAAI,CAAC;YAC/D,SAAS,EAAE,GAAG,CAAC,UAAoB;YACnC,cAAc,EAAE,GAAG,CAAC,gBAA0B;YAC9C,WAAW,EAAE,GAAG,CAAC,YAAsB;YACvC,SAAS,EAAE,GAAG,CAAC,UAAoB;YACnC,MAAM,EAAE,GAAG,CAAC,MAA0B;SACvC,CAAC;IACJ,CAAC;CACF"}