@framers/agentos 0.1.125 → 0.1.127

package/dist/memory/pipeline/consolidation/ConsolidationLoop.js

@@ -0,0 +1,583 @@
+/**
+ * @fileoverview ConsolidationLoop — self-improving background memory maintenance.
+ *
+ * Runs 6 ordered consolidation steps that mirror the brain's offline
+ * slow-wave-sleep consolidation process:
+ *
+ * 1. **Prune** — soft-delete traces whose Ebbinghaus strength has decayed
+ *    below the configurable `pruneThreshold`.
+ * 2. **Merge** — deduplicate near-identical traces. Uses embedding cosine
+ *    similarity when available, falls back to exact content-hash comparison.
+ * 3. **Strengthen** — read retrieval-feedback co-usage signals and record
+ *    Hebbian co-activation edges in the memory graph.
+ * 4. **Derive** — (requires LLM) detect clusters of related memories and
+ *    synthesise higher-level insight traces from them.
+ * 5. **Compact** — promote old, high-retrieval episodic traces to semantic
+ *    type (lightweight episodic-to-semantic migration).
+ * 6. **Re-index** — rebuild the FTS5 index and log the consolidation run
+ *    to the `consolidation_log` table.
+ *
+ * A simple boolean mutex prevents concurrent runs. If `run()` is called
+ * while a cycle is already in progress, it returns immediately with zero
+ * counts.
+ *
+ * @module agentos/memory/consolidation/ConsolidationLoop
+ */
+import { sha256 } from '../../core/util/crossPlatformCrypto.js';
+import { computeCurrentStrength } from '../../core/decay/DecayModel.js';
+import { buildInitialTraceMetadata, parseTraceMetadata, readPersistedDecayState, withPersistedDecayState, } from '../../retrieval/store/tracePersistence.js';
+// ---------------------------------------------------------------------------
+// Defaults
+// ---------------------------------------------------------------------------
+/** Default prune threshold — traces weaker than this are soft-deleted. */
+const DEFAULT_PRUNE_THRESHOLD = 0.05;
+/** Default merge threshold — cosine similarity above this triggers merge. */
+const DEFAULT_MERGE_THRESHOLD = 0.95;
+/** Default max new insights derived per consolidation cycle. */
+const DEFAULT_MAX_DERIVED = 5;
+/** Default minimum cluster size for the derive step. */
+const DEFAULT_MIN_CLUSTER_SIZE = 5;
+/** Age threshold for compact step (7 days in ms). */
+const COMPACT_AGE_MS = 7 * 24 * 60 * 60 * 1000;
+/** Minimum retrieval count for an episodic trace to be compacted. */
+const COMPACT_MIN_RETRIEVAL_COUNT = 3;
+// ---------------------------------------------------------------------------
+// ConsolidationLoop
+// ---------------------------------------------------------------------------
+/**
+ * Self-improving background consolidation loop with 6 ordered steps:
+ * prune, merge, strengthen, derive, compact, re-index.
+ *
+ * All database operations use the async `StorageAdapter` API through
+ * the shared {@link SqliteBrain} connection. The `run()` method is async
+ * to accommodate both the database calls and the LLM-backed derive step.
+ */
+export class ConsolidationLoop {
+    /**
+     * @param brain       - The agent's SQLite brain database connection.
+     * @param memoryGraph - The memory association graph for co-activation and clustering.
+     * @param options     - Optional LLM invoker, embedding function, and
+     *   personality mutation store for derive, merge, and decay steps respectively.
+     */
+    constructor(brain, memoryGraph, options) {
+        this.brain = brain;
+        this.memoryGraph = memoryGraph;
+        this.options = options;
+        /**
+         * Simple mutex flag. When `true`, a consolidation cycle is in progress
+         * and any concurrent `run()` call returns immediately with zero counts.
+         */
+        this._running = false;
+    }
+    // ---------------------------------------------------------------------------
+    // Public API
+    // ---------------------------------------------------------------------------
+    /**
+     * Run one full consolidation cycle.
+     *
+     * The mutex prevents concurrent runs — if `_running` is already true,
+     * returns immediately with a zero-count result.
+     *
+     * @param config - Optional overrides for consolidation thresholds.
+     * @returns Consolidation statistics (pruned, merged, derived, compacted, durationMs).
+     */
+    async run(config) {
+        // Mutex guard — if already running, return zero-count result immediately.
+        if (this._running) {
+            return {
+                pruned: 0,
+                merged: 0,
+                derived: 0,
+                compacted: 0,
+                durationMs: 0,
+                personalityDecayed: 0,
+            };
+        }
+        this._running = true;
+        const startTime = Date.now();
+        try {
+            const pruneThreshold = config?.pruneThreshold ?? DEFAULT_PRUNE_THRESHOLD;
+            const mergeThreshold = config?.mergeThreshold ?? DEFAULT_MERGE_THRESHOLD;
+            const maxDerived = config?.maxDerivedPerCycle ?? DEFAULT_MAX_DERIVED;
+            const minClusterSize = config?.minClusterSize ?? DEFAULT_MIN_CLUSTER_SIZE;
+            // Step 1: Prune
+            const pruned = await this._prune(pruneThreshold);
+            // Step 2: Merge
+            const merged = await this._merge(mergeThreshold);
+            // Step 3: Strengthen (co-activation from feedback)
+            const strengthened = await this._strengthen();
+            // Step 4: Derive (requires LLM)
+            const derived = await this._derive(minClusterSize, maxDerived);
+            // Step 5: Compact (episodic → semantic promotion)
+            const compacted = await this._compact();
+            // Step 5.5: Personality mutation decay (between compact and reindex)
+            const personalityDecayed = await this._decayPersonality();
+            // Step 6: Re-index (FTS rebuild + consolidation log)
+            const durationMs = Date.now() - startTime;
+            await this._reindex(pruned, merged, derived + strengthened, compacted, durationMs);
+            return {
+                pruned,
+                merged,
+                derived: derived + strengthened,
+                compacted,
+                durationMs,
+                personalityDecayed,
+            };
+        }
+        finally {
+            this._running = false;
+        }
+    }
+    /**
+     * Whether consolidation is currently running.
+     * Useful for callers to check before scheduling a new run.
+     */
+    get isRunning() {
+        return this._running;
+    }
+    // ---------------------------------------------------------------------------
+    // Step 1: Prune — soft-delete traces below strength threshold
+    // ---------------------------------------------------------------------------
+    /**
+     * Query all non-deleted traces and soft-delete those whose current
+     * Ebbinghaus strength has decayed below `threshold`.
+     *
+     * @param threshold - Minimum strength to survive pruning.
+     * @returns Number of traces pruned.
+     */
+    async _prune(threshold) {
+        const now = Date.now();
+        const rows = await this.brain.all(`SELECT id, type, scope, content, embedding, strength, created_at,
+              last_accessed, retrieval_count, tags, emotions, metadata, deleted
+       FROM memory_traces
+       WHERE deleted = 0`);
+        let pruned = 0;
+        for (const row of rows) {
+            const trace = this._rowToMinimalTrace(row);
+            const strength = computeCurrentStrength(trace, now);
+            if (strength < threshold) {
+                await this.brain.run(`UPDATE memory_traces SET deleted = 1 WHERE id = ?`, [row.id]);
+                pruned++;
+            }
+        }
+        return pruned;
+    }
+    // ---------------------------------------------------------------------------
+    // Step 2: Merge — deduplicate near-identical traces
+    // ---------------------------------------------------------------------------
+    /**
+     * Find and merge trace pairs with very similar content.
+     *
+     * When an embedding function is available, cosine similarity is used.
+     * Otherwise falls back to exact content hash comparison (SHA-256).
+     *
+     * Merge semantics:
+     * - The trace with more retrievals survives; the other is soft-deleted.
+     * - Tags are unioned (JSON arrays merged, deduplicated).
+     * - Emotional vectors are averaged.
+     * - The survivor takes the maximum strength of the pair.
+     *
+     * @param threshold - Cosine similarity above which two traces are merged.
+     * @returns Number of traces merged (deleted).
+     */
+    async _merge(threshold) {
+        const rows = await this.brain.all(`SELECT id, type, scope, content, embedding, strength, created_at,
+              last_accessed, retrieval_count, tags, emotions, metadata, deleted
+       FROM memory_traces
+       WHERE deleted = 0`);
+        if (rows.length < 2)
+            return 0;
+        let merged = 0;
+        const deletedIds = new Set();
+        if (this.options?.embedFn) {
+            // Embedding-based merge: compute all embeddings, then compare pairwise.
+            const texts = rows.map((r) => r.content);
+            const embeddings = await this.options.embedFn(texts);
+            for (let i = 0; i < rows.length; i++) {
+                if (deletedIds.has(rows[i].id))
+                    continue;
+                for (let j = i + 1; j < rows.length; j++) {
+                    if (deletedIds.has(rows[j].id))
+                        continue;
+                    const sim = this._cosineSimilarity(embeddings[i], embeddings[j]);
+                    if (sim >= threshold) {
+                        await this._mergeTracePair(rows[i], rows[j], deletedIds);
+                        merged++;
+                    }
+                }
+            }
+        }
+        else {
+            // Fallback: exact content hash comparison.
+            const hashMap = new Map();
+            for (const row of rows) {
+                if (deletedIds.has(row.id))
+                    continue;
+                const hash = await sha256(row.content);
+                const existing = hashMap.get(hash);
+                if (existing && !deletedIds.has(existing.id)) {
+                    await this._mergeTracePair(existing, row, deletedIds);
+                    merged++;
+                }
+                else {
+                    hashMap.set(hash, row);
+                }
+            }
+        }
+        return merged;
+    }
+    /**
+     * Merge two traces: keep the one with more retrievals, soft-delete the other.
+     * Union tags, average emotions, take max strength.
+     *
+     * @param a          - First trace row.
+     * @param b          - Second trace row.
+     * @param deletedIds - Set tracking which IDs have been soft-deleted this cycle.
+     */
+    async _mergeTracePair(a, b, deletedIds) {
+        const survivor = a.retrieval_count >= b.retrieval_count ? a : b;
+        const loser = survivor === a ? b : a;
+        // Union tags.
+        let survivorTags = [];
+        let loserTags = [];
+        try {
+            survivorTags = JSON.parse(survivor.tags);
+        }
+        catch { /* empty */ }
+        try {
+            loserTags = JSON.parse(loser.tags);
+        }
+        catch { /* empty */ }
+        const mergedTags = [...new Set([...survivorTags, ...loserTags])];
+        // Average emotions.
+        let survivorEmotions = {};
+        let loserEmotions = {};
+        try {
+            survivorEmotions = JSON.parse(survivor.emotions);
+        }
+        catch { /* empty */ }
+        try {
+            loserEmotions = JSON.parse(loser.emotions);
+        }
+        catch { /* empty */ }
+        const avgEmotions = this._averageEmotions(survivorEmotions, loserEmotions);
+        // Max strength.
+        const maxStrength = Math.max(survivor.strength, loser.strength);
+        const survivorMetadata = parseTraceMetadata(survivor.metadata);
+        const loserMetadata = parseTraceMetadata(loser.metadata);
+        const survivorDecay = readPersistedDecayState(survivorMetadata, survivor.retrieval_count);
+        const loserDecay = readPersistedDecayState(loserMetadata, loser.retrieval_count);
+        const mergedLastAccessed = Math.max(survivor.last_accessed ?? survivor.created_at, loser.last_accessed ?? loser.created_at);
+        const mergedMetadata = JSON.stringify(withPersistedDecayState(survivorMetadata, {
+            stability: Math.max(survivorDecay.stability, loserDecay.stability),
+            accessCount: survivorDecay.accessCount + loserDecay.accessCount,
+            reinforcementInterval: Math.max(survivorDecay.reinforcementInterval, loserDecay.reinforcementInterval),
+            ...((survivorDecay.nextReinforcementAt !== undefined ||
+                loserDecay.nextReinforcementAt !== undefined)
+                ? {
+                    nextReinforcementAt: Math.max(survivorDecay.nextReinforcementAt ?? 0, loserDecay.nextReinforcementAt ?? 0),
+                }
+                : {}),
+        }));
+        // Update survivor.
+        await this.brain.run(`UPDATE memory_traces
+       SET tags = ?, emotions = ?, strength = ?, retrieval_count = ?, last_accessed = ?, metadata = ?
+       WHERE id = ?`, [
+            JSON.stringify(mergedTags),
+            JSON.stringify(avgEmotions),
+            maxStrength,
+            survivor.retrieval_count + loser.retrieval_count,
+            mergedLastAccessed,
+            mergedMetadata,
+            survivor.id,
+        ]);
+        // Soft-delete loser.
+        await this.brain.run(`UPDATE memory_traces SET deleted = 1 WHERE id = ?`, [loser.id]);
+        deletedIds.add(loser.id);
+    }
+    // ---------------------------------------------------------------------------
+    // Step 3: Strengthen — co-activation from retrieval feedback
+    // ---------------------------------------------------------------------------
+    /**
+     * Query the `retrieval_feedback` table for traces that were co-used
+     * (same query string, both with signal = 'used') and record Hebbian
+     * co-activation edges in the memory graph.
+     *
+     * @returns Number of co-activation pairs strengthened.
+     */
+    async _strengthen() {
+        // Find all queries where at least 2 traces were 'used'.
+        const queryRows = await this.brain.all(`SELECT query FROM retrieval_feedback
+       WHERE signal = 'used' AND query IS NOT NULL
+       GROUP BY query
+       HAVING COUNT(DISTINCT trace_id) >= 2`);
+        let strengthened = 0;
+        for (const { query } of queryRows) {
+            const traceRows = await this.brain.all(`SELECT DISTINCT trace_id, query FROM retrieval_feedback
+         WHERE signal = 'used' AND query = ?`, [query]);
+            const traceIds = traceRows.map((r) => r.trace_id);
+            if (traceIds.length >= 2) {
+                // Ensure nodes exist before recording co-activation.
+                for (const id of traceIds) {
+                    if (!this.memoryGraph.hasNode(id)) {
+                        await this.memoryGraph.addNode(id, {
+                            type: 'episodic',
+                            scope: 'thread',
+                            scopeId: 'consolidation',
+                            strength: 1.0,
+                            createdAt: Date.now(),
+                        });
+                    }
+                }
+                await this.memoryGraph.recordCoActivation(traceIds);
+                strengthened++;
+            }
+        }
+        return strengthened;
+    }
+    // ---------------------------------------------------------------------------
+    // Step 4: Derive — LLM-based insight synthesis from clusters
+    // ---------------------------------------------------------------------------
+    /**
+     * Detect memory clusters and use the LLM to derive higher-level insights.
+     *
+     * Skips entirely if no `llmInvoker` was provided. For each of the top-N
+     * clusters (by size), collects member trace contents and sends them to the
+     * LLM with a concise instruction prompt.
+     *
+     * @param minClusterSize - Minimum cluster size for `detectClusters()`.
+     * @param maxDerived     - Maximum number of insights to create this cycle.
+     * @returns Number of insight traces created.
+     */
+    async _derive(minClusterSize, maxDerived) {
+        if (!this.options?.llmInvoker)
+            return 0;
+        const clusters = await this.memoryGraph.detectClusters(minClusterSize);
+        if (clusters.length === 0)
+            return 0;
+        // Sort by cluster size descending, take top N.
+        const sorted = [...clusters].sort((a, b) => b.memberIds.length - a.memberIds.length);
+        const topClusters = sorted.slice(0, maxDerived);
+        let derived = 0;
+        for (const cluster of topClusters) {
+            // Collect content from cluster member traces.
+            const contents = [];
+            for (const memberId of cluster.memberIds) {
+                const row = await this.brain.get(`SELECT content FROM memory_traces WHERE id = ? AND deleted = 0`, [memberId]);
+                if (row)
+                    contents.push(row.content);
+            }
+            if (contents.length < 2)
+                continue;
+            try {
+                const prompt = 'Given these related memories, derive one concise higher-level insight:\n\n' +
+                    contents.join('\n');
+                const insight = await this.options.llmInvoker(prompt);
+                if (!insight?.trim())
+                    continue;
+                // Store as a new semantic trace.
+                const now = Date.now();
+                const id = `insight_${now}_${derived}`;
+                await this.brain.run(`INSERT INTO memory_traces
+             (id, type, scope, content, strength, created_at, retrieval_count, tags, emotions, metadata, deleted)
+           VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)`, [
+                    id,
+                    'semantic',
+                    'user',
+                    insight.trim(),
+                    0.7,
+                    now,
+                    0,
+                    JSON.stringify(['derived', 'insight']),
+                    JSON.stringify({}),
+                    JSON.stringify(buildInitialTraceMetadata({ sourceCluster: cluster.clusterId })),
+                    0,
+                ]);
+                derived++;
+            }
+            catch {
+                // LLM failures are non-critical; skip this cluster.
+            }
+        }
+        return derived;
+    }
+    // ---------------------------------------------------------------------------
+    // Step 5: Compact — episodic → semantic migration for old high-retrieval traces
+    // ---------------------------------------------------------------------------
+    /**
+     * Find episodic traces older than 7 days with high retrieval count and
+     * promote them to semantic type.
+     *
+     * This is a lightweight version of compaction — full LLM-based summarization
+     * via the CompactionEngine is deferred. For now, the trace type is simply
+     * changed to 'semantic' and the timestamp is logged.
+     *
+     * @returns Number of traces compacted.
+     */
+    async _compact() {
+        const now = Date.now();
+        const cutoff = now - COMPACT_AGE_MS;
+        const rows = await this.brain.all(`SELECT id FROM memory_traces
+       WHERE deleted = 0
+         AND type = 'episodic'
+         AND created_at < ?
+         AND retrieval_count >= ?`, [cutoff, COMPACT_MIN_RETRIEVAL_COUNT]);
+        if (rows.length === 0)
+            return 0;
+        for (const row of rows) {
+            await this.brain.run(`UPDATE memory_traces SET type = 'semantic' WHERE id = ?`, [row.id]);
+        }
+        return rows.length;
+    }
+    // ---------------------------------------------------------------------------
+    // Step 5.5: Personality decay — reduce mutation strengths and prune expired
+    // ---------------------------------------------------------------------------
+    /**
+     * Decay all active personality mutations by the configured rate.
+     *
+     * Delegates to {@link PersonalityMutationStore.decayAll} when a store is
+     * provided. Mutations whose strength drops at or below 0.1 are pruned.
+     *
+     * This step sits between compact and reindex to ensure personality decay
+     * is captured in the same consolidation cycle as memory maintenance.
+     *
+     * @returns Number of personality mutations pruned (deleted), or 0 if no
+     *   store is configured.
+     */
+    async _decayPersonality() {
+        if (!this.options?.personalityMutationStore) {
+            return 0;
+        }
+        const rate = this.options.personalityDecayRate ?? 0.05;
+        try {
+            const result = await this.options.personalityMutationStore.decayAll(rate);
+            return result.decayed + result.pruned;
+        }
+        catch {
+            // Personality decay failures are non-critical — do not block consolidation.
+            return 0;
+        }
+    }
+    // ---------------------------------------------------------------------------
+    // Step 6: Re-index — FTS rebuild + consolidation log
+    // ---------------------------------------------------------------------------
+    /**
+     * Rebuild the FTS5 index to reflect any content changes from the cycle,
+     * and write a summary row to the `consolidation_log` table.
+     *
+     * @param pruned    - Number of traces pruned.
+     * @param merged    - Number of traces merged.
+     * @param derived   - Number of insights derived (includes strengthened edges).
+     * @param compacted - Number of traces compacted.
+     * @param durationMs - Total cycle duration in milliseconds.
+     */
+    async _reindex(pruned, merged, derived, compacted, durationMs) {
+        // Rebuild FTS5 index.
+        // The 'rebuild' command reconstructs the FTS index from the content table.
+        try {
+            await this.brain.exec(this.brain.features.fts.rebuildCommand('memory_traces_fts'));
+        }
+        catch {
+            // FTS rebuild may fail if the table structure has drifted; non-critical.
+        }
+        // Log the consolidation run.
+        await this.brain.run(`INSERT INTO consolidation_log (ran_at, pruned, merged, derived, compacted, duration_ms)
+       VALUES (?, ?, ?, ?, ?, ?)`, [Date.now(), pruned, merged, derived, compacted, durationMs]);
+    }
+    // ---------------------------------------------------------------------------
+    // Private helpers
+    // ---------------------------------------------------------------------------
+    /**
+     * Convert a raw `TraceRow` into a minimal `MemoryTrace`-compatible shape
+     * that `computeCurrentStrength()` can consume.
+     *
+     * Only the fields required by the Ebbinghaus formula are populated:
+     * `encodingStrength`, `stability` (derived from strength as a proxy),
+     * and `lastAccessedAt`.
+     *
+     * @param row - Raw SQLite row from `memory_traces`.
+     * @returns A minimal MemoryTrace object.
+     */
+    _rowToMinimalTrace(row) {
+        const now = Date.now();
+        const metadata = parseTraceMetadata(row.metadata);
+        const decayState = readPersistedDecayState(metadata, row.retrieval_count);
+        return {
+            id: row.id,
+            type: row.type,
+            scope: row.scope,
+            scopeId: typeof metadata.scopeId === 'string' ? metadata.scopeId : '',
+            content: row.content,
+            entities: Array.isArray(metadata.entities)
+                ? metadata.entities.filter((entity) => typeof entity === 'string')
+                : [],
+            tags: [],
+            provenance: {
+                sourceType: 'observation',
+                sourceTimestamp: row.created_at,
+                confidence: 1,
+                verificationCount: 0,
+            },
+            emotionalContext: {
+                valence: 0,
+                arousal: 0,
+                dominance: 0,
+                intensity: 0,
+                gmiMood: 'neutral',
+            },
+            // The `strength` column stores the current encoding strength.
+            encodingStrength: row.strength,
+            stability: decayState.stability,
+            retrievalCount: row.retrieval_count,
+            lastAccessedAt: row.last_accessed ?? row.created_at,
+            accessCount: decayState.accessCount,
+            reinforcementInterval: decayState.reinforcementInterval,
+            ...(decayState.nextReinforcementAt !== undefined
+                ? { nextReinforcementAt: decayState.nextReinforcementAt }
+                : {}),
+            associatedTraceIds: [],
+            createdAt: row.created_at,
+            updatedAt: now,
+            isActive: row.deleted === 0,
+        };
+    }
+    /**
+     * Compute cosine similarity between two embedding vectors.
+     *
+     * @param a - First vector.
+     * @param b - Second vector.
+     * @returns Cosine similarity in [-1, 1].
+     */
+    _cosineSimilarity(a, b) {
+        if (a.length !== b.length || a.length === 0)
+            return 0;
+        let dot = 0;
+        let normA = 0;
+        let normB = 0;
+        for (let i = 0; i < a.length; i++) {
+            dot += a[i] * b[i];
+            normA += a[i] * a[i];
+            normB += b[i] * b[i];
+        }
+        const denom = Math.sqrt(normA) * Math.sqrt(normB);
+        return denom === 0 ? 0 : dot / denom;
+    }
+    /**
+     * Average two emotion objects by computing the mean of all shared numeric keys.
+     *
+     * @param a - First emotion record.
+     * @param b - Second emotion record.
+     * @returns Averaged emotion record.
+     */
+    _averageEmotions(a, b) {
+        const allKeys = new Set([...Object.keys(a), ...Object.keys(b)]);
+        const result = {};
+        for (const key of allKeys) {
+            const va = a[key] ?? 0;
+            const vb = b[key] ?? 0;
+            result[key] = (va + vb) / 2;
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=ConsolidationLoop.js.map

package/dist/memory/pipeline/consolidation/ConsolidationLoop.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ConsolidationLoop.js","sourceRoot":"","sources":["../../../../src/memory/pipeline/consolidation/ConsolidationLoop.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,wCAAwC,CAAC;AAKhE,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAC;AAExE,OAAO,EACL,yBAAyB,EACzB,kBAAkB,EAClB,uBAAuB,EACvB,uBAAuB,GACxB,MAAM,2CAA2C,CAAC;AA6BnD,8EAA8E;AAC9E,WAAW;AACX,8EAA8E;AAE9E,0EAA0E;AAC1E,MAAM,uBAAuB,GAAG,IAAI,CAAC;AAErC,6EAA6E;AAC7E,MAAM,uBAAuB,GAAG,IAAI,CAAC;AAErC,gEAAgE;AAChE,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAE9B,wDAAwD;AACxD,MAAM,wBAAwB,GAAG,CAAC,CAAC;AAEnC,qDAAqD;AACrD,MAAM,cAAc,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAE/C,qEAAqE;AACrE,MAAM,2BAA2B,GAAG,CAAC,CAAC;AAEtC,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,OAAO,iBAAiB;IAO5B;;;;;OAKG;IACH,YACmB,KAAkB,EAClB,WAAyB,EACzB,OAkBhB;QApBgB,UAAK,GAAL,KAAK,CAAa;QAClB,gBAAW,GAAX,WAAW,CAAc;QACzB,YAAO,GAAP,OAAO,CAkBvB;QAjCH;;;WAGG;QACK,aAAQ,GAAG,KAAK,CAAC;IA8BtB,CAAC;IAEJ,8EAA8E;IAC9E,aAAa;IACb,8EAA8E;IAE9E;;;;;;;;OAQG;IACH,KAAK,CAAC,GAAG,CAAC,MAA6C;QACrD,0EAA0E;QAC1E,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,OAAO;gBACL,MAAM,EAAE,CAAC;gBACT,MAAM,EAAE,CAAC;gBACT,OAAO,EAAE,CAAC;gBACV,SAAS,EAAE,CAAC;gBACZ,UAAU,EAAE,CAAC;gBACb,kBAAkB,EAAE,CAAC;aACtB,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,IAAI,CAAC;YACH,MAAM,cAAc,GAAG,MAAM,EAAE,cAAc,IAAI,uBAAuB,CAAC;YACzE,MAAM,cAAc,GAAG,MAAM,EAAE,cAAc,IAAI,uBAAuB,CAAC;YACzE,MAAM,UAAU,GAAG,MAAM,EAAE,kBAAkB,IAAI,mBAAmB,CAAC;YACrE,MAAM,cAAc,GAAG,MAAM,EAAE,cAAc,IAAI,wBAAwB,CAAC;YAE1E,gBAAgB;YAChB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;YAEjD,gBAAgB;YAChB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;YAEjD,mDAAmD;YACnD,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;YAE9C,gCAAgC;YAChC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC;YAE/D,kDAAkD;YAClD,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;YAExC,qEAAqE;YACrE,MAAM,kBAAkB,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAE1D,qDAAqD;YACrD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAC1C,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,GAAG,YAAY,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;YAEnF,OAAO;gBACL,MAAM;gBACN,MAAM;gBACN,OAAO,EAAE,OAAO,GAAG,YAAY;gBAC/B,SAAS;gBACT,UAAU;gBACV,kBAAkB;aACnB,CAAC;QACJ,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,8EAA8E;IAC9E,8DAA8D;IAC9D,8EAA8E;IAE9E;;;;;;OAMG;IACK,KAAK,CAAC,MAAM,CAAC,SAAiB;QACpC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAC/B;;;yBAGmB,CACpB,CAAC;QAEF,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;YAC3C,MAAM,QAAQ,GAAG,sBAAsB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACpD,IAAI,QAAQ,GAAG,SAAS,EAAE,CAAC;gBACzB,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAClB,mDAAmD,EACnD,CAAC,GAAG,CAAC,EAAE,CAAC,CACT,CAAC;gBACF,MAAM,EAAE,CAAC;YACX,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,8EAA8E;IAC9E,oDAAoD;IACpD,8EAA8E;IAE9E;;;;;;;;;;;;;;OAcG;IACK,KAAK,CAAC,MAAM,CAAC,SAAiB;QACpC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAC/B;;;yBAGmB,CACpB,CAAC;QAEF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC;QAE9B,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QAErC,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC;YAC1B,wEAAwE;YACxE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YACzC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAErD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzC,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;wBAAE,SAAS;oBAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAE,EAAE,UAAU,CAAC,CAAC,CAAE,CAAC,CAAC;oBACnE,IAAI,GAAG,IAAI,SAAS,EAAE,CAAC;wBACrB,MAAM,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,CAAC,CAAE,EAAE,UAAU,CAAC,CAAC;wBAC3D,MAAM,EAAE,CAAC;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,2CAA2C;YAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;YAE5C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAS;gBACrC,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACvC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACnC,IAAI,QAAQ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC7C,MAAM,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;oBACtD,MAAM,EAAE,CAAC;gBACX,CAAC;qBAAM,CAAC;oBACN,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;OAOG;IACK,KAAK,CAAC,eAAe,CAAC,CAAW,EAAE,CAAW,EAAE,UAAuB;QAC7E,MAAM,QAAQ,GAAG,CAAC,CAAC,eAAe,IAAI,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,KAAK,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAErC,cAAc;QACd,IAAI,YAAY,GAAa,EAAE,CAAC;QAChC,IAAI,SAAS,GAAa,EAAE,CAAC;QAC7B,IAAI,CAAC;YAAC,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC;QACvE,IAAI,CAAC;YAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC;QACjE,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAEjE,oBAAoB;QACpB,IAAI,gBAAgB,GAA2B,EAAE,CAAC;QAClD,IAAI,aAAa,GAA2B,EAAE,CAAC;QAC/C,IAAI,CAAC;YAAC,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC;QAC/E,IAAI,CAAC;YAAC,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,aAAa,CAAC,CAAC;QAE3E,gBAAgB;QAChB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;QAChE,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC/D,MAAM,aAAa,GAAG,kBAAkB,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,aAAa,GAAG,uBAAuB,CAAC,gBAAgB,EAAE,QAAQ,CAAC,eAAe,CAAC,CAAC;QAC1F,MAAM,UAAU,GAAG,uBAAuB,CAAC,aAAa,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC;QACjF,MAAM,kBAAkB,GAAG,IAAI,CAAC,GAAG,CACjC,QAAQ,CAAC,aAAa,IAAI,QAAQ,CAAC,UAAU,EAC7C,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,UAAU,CACxC,CAAC;QACF,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,CACnC,uBAAuB,CAAC,gBAAgB,EAAE;YACxC,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,SAAS,EAAE,UAAU,CAAC,SAAS,CAAC;YAClE,WAAW,EAAE,aAAa,CAAC,WAAW,GAAG,UAAU,CAAC,WAAW;YAC/D,qBAAqB,EAAE,IAAI,CAAC,GAAG,CAC7B,aAAa,CAAC,qBAAqB,EACnC,UAAU,CAAC,qBAAqB,CACjC;YACD,GAAG,CAAC,CAAC,aAAa,CAAC,mBAAmB,KAAK,SAAS;gBAClD,UAAU,CAAC,mBAAmB,KAAK,SAAS,CAAC;gBAC7C,CAAC,CAAC;oBACE,mBAAmB,EAAE,IAAI,CAAC,GAAG,CAC3B,aAAa,CAAC,mBAAmB,IAAI,CAAC,EACtC,UAAU,CAAC,mBAAmB,IAAI,CAAC,CACpC;iBACF;gBACH,CAAC,CAAC,EAAE,CAAC;SACR,CAAC,CACH,CAAC;QAEF,mBAAmB;QACnB,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAClB;;oBAEc,EACd;YACE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC;YAC1B,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC;YAC3B,WAAW;YACX,QAAQ,CAAC,eAAe,GAAG,KAAK,CAAC,eAAe;YAChD,kBAAkB;YAClB,cAAc;YACd,QAAQ,CAAC,EAAE;SACZ,CACF,CAAC;QAEF,qBAAqB;QACrB,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAClB,mDAAmD,EACnD,CAAC,KAAK,CAAC,EAAE,CAAC,CACX,CAAC;QAEF,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,8EAA8E;IAC9E,6DAA6D;IAC7D,8EAA8E;IAE9E;;;;;;OAMG;IACK,KAAK,CAAC,WAAW;QACvB,wDAAwD;QACxD,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CACpC;;;4CAGsC,CACvC,CAAC;QAEF,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,SAAS,EAAE,CAAC;YAClC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CACpC;6CACqC,EACrC,CAAC,KAAK,CAAC,CACR,CAAC;YAEF,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAClD,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACzB,qDAAqD;gBACrD,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;oBAC1B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;wBAClC,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,EAAE;4BACjC,IAAI,EAAE,UAAU;4BAChB,KAAK,EAAE,QAAQ;4BACf,OAAO,EAAE,eAAe;4BACxB,QAAQ,EAAE,GAAG;4BACb,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;yBACtB,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;gBACD,MAAM,IAAI,CAAC,WAAW,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;gBACpD,YAAY,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;QAED,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,8EAA8E;IAC9E,6DAA6D;IAC7D,8EAA8E;IAE9E;;;;;;;;;;OAUG;IACK,KAAK,CAAC,OAAO,CAAC,cAAsB,EAAE,UAAkB;QAC9D,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,UAAU;YAAE,OAAO,CAAC,CAAC;QAExC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC;QACvE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEpC,+CAA+C;QAC/C,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACrF,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAEhD,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;YAClC,8CAA8C;YAC9C,MAAM,QAAQ,GAAa,EAAE,CAAC;YAC9B,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;gBACzC,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAC9B,gEAAgE,EAChE,CAAC,QAAQ,CAAC,CACX,CAAC;gBACF,IAAI,GAAG;oBAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACtC,CAAC;YAED,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAElC,IAAI,CAAC;gBACH,MAAM,MAAM,GACV,4EAA4E;oBAC5E,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAEtB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBACtD,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE;oBAAE,SAAS;gBAE/B,iCAAiC;gBACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACvB,MAAM,EAAE,GAAG,WAAW,GAAG,IAAI,OAAO,EAAE,CAAC;gBAEvC,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAClB;;oDAE0C,EAC1C;oBACE,EAAE;oBACF,UAAU;oBACV,MAAM;oBACN,OAAO,CAAC,IAAI,EAAE;oBACd,GAAG;oBACH,GAAG;oBACH,CAAC;oBACD,IAAI,CAAC,SAAS,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBACtC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;oBAClB,IAAI,CAAC,SAAS,CAAC,yBAAyB,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;oBAC/E,CAAC;iBACF,CACF,CAAC;gBAEF,OAAO,EAAE,CAAC;YACZ,CAAC;YAAC,MAAM,CAAC;gBACP,oDAAoD;YACtD,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,8EAA8E;IAC9E,gFAAgF;IAChF,8EAA8E;IAE9E;;;;;;;;;OASG;IACK,KAAK,CAAC,QAAQ;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,GAAG,GAAG,cAAc,CAAC;QAEpC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAC/B;;;;kCAI4B,EAC5B,CAAC,MAAM,EAAE,2BAA2B,CAAC,CACtC,CAAC;QAEF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEhC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAClB,yDAAyD,EACzD,CAAC,GAAG,CAAC,EAAE,CAAC,CACT,CAAC;QACJ,CAAC;QAED,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,8EAA8E;IAC9E,4EAA4E;IAC5E,8EAA8E;IAE9E;;;;;;;;;;;OAWG;IACK,KAAK,CAAC,iBAAiB;QAC7B,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,wBAAwB,EAAE,CAAC;YAC5C,OAAO,CAAC,CAAC;QACX,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,oBAAoB,IAAI,IAAI,CAAC;QAEvD,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,wBAAwB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC1E,OAAO,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;QACxC,CAAC;QAAC,MAAM,CAAC;YACP,4EAA4E;YAC5E,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,qDAAqD;IACrD,8EAA8E;IAE9E;;;;;;;;;OASG;IACK,KAAK,CAAC,QAAQ,CACpB,MAAc,EACd,MAAc,EACd,OAAe,EACf,SAAiB,EACjB,UAAkB;QAElB,sBAAsB;QACtB,2EAA2E;QAC3E,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC,CAAC;QACrF,CAAC;QAAC,MAAM,CAAC;YACP,yEAAyE;QAC3E,CAAC;QAED,6BAA6B;QAC7B,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAClB;iCAC2B,EAC3B,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,CAAC,CAC7D,CAAC;IACJ,CAAC;IAED,8EAA8E;IAC9E,kBAAkB;IAClB,8EAA8E;IAE9E;;;;;;;;;;OAUG;IACK,kBAAkB,CAAC,GAAa;QACtC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAClD,MAAM,UAAU,GAAG,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,eAAe,CAAC,CAAC;QAC1E,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,IAAI,EAAE,GAAG,CAAC,IAAkB;YAC5B,KAAK,EAAE,GAAG,CAAC,KAAoB;YAC/B,OAAO,EAAE,OAAO,QAAQ,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACrE,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC;gBACxC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,MAAM,EAAoB,EAAE,CAAC,OAAO,MAAM,KAAK,QAAQ,CAAC;gBACpF,CAAC,CAAC,EAAE;YACN,IAAI,EAAE,EAAE;YACR,UAAU,EAAE;gBACV,UAAU,EAAE,aAAa;gBACzB,eAAe,EAAE,GAAG,CAAC,UAAU;gBAC/B,UAAU,EAAE,CAAC;gBACb,iBAAiB,EAAE,CAAC;aACrB;YACD,gBAAgB,EAAE;gBAChB,OAAO,EAAE,CAAC;gBACV,OAAO,EAAE,CAAC;gBACV,SAAS,EAAE,CAAC;gBACZ,SAAS,EAAE,CAAC;gBACZ,OAAO,EAAE,SAAS;aACnB;YACD,8DAA8D;YAC9D,gBAAgB,EAAE,GAAG,CAAC,QAAQ;YAC9B,SAAS,EAAE,UAAU,CAAC,SAAS;YAC/B,cAAc,EAAE,GAAG,CAAC,eAAe;YACnC,cAAc,EAAE,GAAG,CAAC,aAAa,IAAI,GAAG,CAAC,UAAU;YACnD,WAAW,EAAE,UAAU,CAAC,WAAW;YACnC,qBAAqB,EAAE,UAAU,CAAC,qBAAqB;YACvD,GAAG,CAAC,UAAU,CAAC,mBAAmB,KAAK,SAAS;gBAC9C,CAAC,CAAC,EAAE,mBAAmB,EAAE,UAAU,CAAC,mBAAmB,EAAE;gBACzD,CAAC,CAAC,EAAE,CAAC;YACP,kBAAkB,EAAE,EAAE;YACtB,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,SAAS,EAAE,GAAG;YACd,QAAQ,EAAE,GAAG,CAAC,OAAO,KAAK,CAAC;SAC5B,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACK,iBAAiB,CAAC,CAAW,EAAE,CAAW;QAChD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEtD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;YACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;YACvB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACzB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;IACvC,CAAC;IAED;;;;;;OAMG;IACK,gBAAgB,CACtB,CAAyB,EACzB,CAAyB;QAEzB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,MAAM,GAA2B,EAAE,CAAC;QAE1C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}