@swarmdo/cli 1.4.8

package/vendor/memory/dist/persistent-sona.d.ts

@@ -0,0 +1,144 @@
+/**
+ * PersistentSonaCoordinator - SONA learning with RVF persistence
+ *
+ * Wraps RvfLearningStore to provide an in-memory pattern bank with
+ * brute-force cosine similarity, trajectory buffering, EWC tracking,
+ * and automatic periodic persistence to disk.
+ *
+ * This is intentionally decoupled from the swarmvector SONA classes:
+ * it defines its own compatible types and delegates persistence to
+ * RvfLearningStore.
+ *
+ * @module @swarmdo/memory/persistent-sona
+ */
+import type { PatternRecord, TrajectoryRecord } from './rvf-learning-store.js';
+export interface PersistentSonaConfig {
+    /** Path to the RVF learning store file */
+    storePath: string;
+    /** Cosine similarity threshold for pattern matching (default: 0.85) */
+    patternThreshold?: number;
+    /** Maximum buffered trajectories before oldest are evicted (default: 1000) */
+    maxTrajectoryBuffer?: number;
+    /** Auto-persist interval in ms (default: 30000) */
+    autoPersistInterval?: number;
+    /** Enable verbose logging (default: false) */
+    verbose?: boolean;
+}
+/**
+ * Coordinates SONA learning with persistent storage.
+ *
+ * @example
+ * ```typescript
+ * const sona = new PersistentSonaCoordinator({
+ *   storePath: './data/sona-learning.rvls',
+ * });
+ * await sona.initialize();
+ *
+ * // Store a pattern
+ * const id = sona.storePattern('query_response', embedding);
+ *
+ * // Find similar patterns
+ * const matches = sona.findSimilarPatterns(queryEmbedding, 5);
+ *
+ * // Record a trajectory
+ * sona.recordTrajectory({ id: 'traj-1', steps: [...], outcome: 'success', ... });
+ *
+ * // Periodic background learning
+ * const result = sona.runBackgroundLoop();
+ *
+ * await sona.shutdown();
+ * ```
+ */
+export declare class PersistentSonaCoordinator {
+    private store;
+    private patterns;
+    private trajectoryBuffer;
+    private ewcState;
+    private patternThreshold;
+    private maxTrajectoryBuffer;
+    private verbose;
+    private initialized;
+    constructor(config: PersistentSonaConfig);
+    /**
+     * Initialize by loading persisted state from the RVF store.
+     */
+    initialize(): Promise<void>;
+    /**
+     * Store a new pattern and return its ID.
+     *
+     * @param type - Pattern type (e.g. 'query_response', 'routing')
+     * @param embedding - The pattern embedding vector
+     * @param metadata - Optional extra metadata (currently unused, reserved)
+     * @returns The generated pattern ID
+     */
+    storePattern(type: string, embedding: number[], metadata?: Record<string, unknown>): string;
+    /**
+     * Find the k most similar patterns above the configured threshold.
+     * Uses brute-force cosine similarity (suitable for small pattern sets).
+     */
+    findSimilarPatterns(embedding: number[], k?: number): PatternRecord[];
+    /**
+     * Record a pattern usage outcome. Updates the success rate using an
+     * exponential moving average (alpha = 0.1).
+     */
+    recordPatternUsage(patternId: string, success: boolean): void;
+    /**
+     * Remove patterns that have low success rates after sufficient usage.
+     *
+     * @returns The number of patterns pruned
+     */
+    prunePatterns(minSuccessRate?: number, minUseCount?: number): number;
+    /**
+     * Buffer a completed trajectory for later processing.
+     * When the buffer exceeds maxTrajectoryBuffer, the oldest entries
+     * are evicted.
+     */
+    recordTrajectory(trajectory: TrajectoryRecord): void;
+    /**
+     * Process buffered trajectories to extract new patterns.
+     * Successful and partial trajectories are mined for high-confidence
+     * steps; new patterns are stored if they are sufficiently different
+     * from existing ones.
+     *
+     * After processing, the trajectory buffer is cleared and low-performing
+     * patterns are pruned.
+     *
+     * @returns Summary of the learning pass
+     */
+    runBackgroundLoop(): {
+        patternsLearned: number;
+        trajectoriesProcessed: number;
+    };
+    /**
+     * Flush current in-memory state to the RVF store on disk.
+     */
+    persist(): Promise<void>;
+    /**
+     * Persist state and shut down the store.
+     */
+    shutdown(): Promise<void>;
+    /**
+     * Return a summary of the coordinator's current state.
+     */
+    getStats(): {
+        patterns: number;
+        avgSuccessRate: number;
+        trajectoriesBuffered: number;
+        ewcTasksLearned: number;
+    };
+    /**
+     * Extract patterns from a trajectory's high-confidence steps.
+     * A step produces a new pattern only if no sufficiently similar
+     * pattern already exists.
+     */
+    private extractPatternsFromTrajectory;
+    /**
+     * Deterministic hash-based embedding for pattern extraction.
+     * This is a lightweight stand-in for a real embedding model,
+     * matching the approach used in SonaCoordinator.
+     */
+    private createHashEmbedding;
+    private ensureInitialized;
+    private log;
+}
+//# sourceMappingURL=persistent-sona.d.ts.map

package/vendor/memory/dist/persistent-sona.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"persistent-sona.d.ts","sourceRoot":"","sources":["../src/persistent-sona.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAKH,OAAO,KAAK,EAEV,aAAa,EAEb,gBAAgB,EACjB,MAAM,yBAAyB,CAAC;AAIjC,MAAM,WAAW,oBAAoB;IACnC,0CAA0C;IAC1C,SAAS,EAAE,MAAM,CAAC;IAClB,uEAAuE;IACvE,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,8EAA8E;IAC9E,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,mDAAmD;IACnD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,8CAA8C;IAC9C,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AA2CD;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,qBAAa,yBAAyB;IACpC,OAAO,CAAC,KAAK,CAAmB;IAChC,OAAO,CAAC,QAAQ,CAAyC;IACzD,OAAO,CAAC,gBAAgB,CAA0B;IAClD,OAAO,CAAC,QAAQ,CAA0B;IAC1C,OAAO,CAAC,gBAAgB,CAAS;IACjC,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,OAAO,CAAU;IACzB,OAAO,CAAC,WAAW,CAAS;gBAEhB,MAAM,EAAE,oBAAoB;IAcxC;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IA4BjC;;;;;;;OAOG;IACH,YAAY,CACV,IAAI,EAAE,MAAM,EACZ,SAAS,EAAE,MAAM,EAAE,EACnB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GACjC,MAAM;IAmBT;;;OAGG;IACH,mBAAmB,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC,GAAE,MAAU,GAAG,aAAa,EAAE;IAkBxE;;;OAGG;IACH,kBAAkB,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI;IAc7D;;;;OAIG;IACH,aAAa,CAAC,cAAc,GAAE,MAAY,EAAE,WAAW,GAAE,MAAU,GAAG,MAAM;IAoB5E;;;;OAIG;IACH,gBAAgB,CAAC,UAAU,EAAE,gBAAgB,GAAG,IAAI;IAgBpD;;;;;;;;;;OAUG;IACH,iBAAiB,IAAI;QACnB,eAAe,EAAE,MAAM,CAAC;QACxB,qBAAqB,EAAE,MAAM,CAAC;KAC/B;IAyBD;;OAEG;IACG,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;IAgB9B;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAW/B;;OAEG;IACH,QAAQ,IAAI;QACV,QAAQ,EAAE,MAAM,CAAC;QACjB,cAAc,EAAE,MAAM,CAAC;QACvB,oBAAoB,EAAE,MAAM,CAAC;QAC7B,eAAe,EAAE,MAAM,CAAC;KACzB;IAkBD;;;;OAIG;IACH,OAAO,CAAC,6BAA6B;IAkBrC;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAqB3B,OAAO,CAAC,iBAAiB;IAQzB,OAAO,CAAC,GAAG;CAMZ"}

package/vendor/memory/dist/persistent-sona.js

@@ -0,0 +1,332 @@
+/**
+ * PersistentSonaCoordinator - SONA learning with RVF persistence
+ *
+ * Wraps RvfLearningStore to provide an in-memory pattern bank with
+ * brute-force cosine similarity, trajectory buffering, EWC tracking,
+ * and automatic periodic persistence to disk.
+ *
+ * This is intentionally decoupled from the swarmvector SONA classes:
+ * it defines its own compatible types and delegates persistence to
+ * RvfLearningStore.
+ *
+ * @module @swarmdo/memory/persistent-sona
+ */
+import { RvfLearningStore, } from './rvf-learning-store.js';
+// ===== Constants =====
+const DEFAULT_PATTERN_THRESHOLD = 0.85;
+const DEFAULT_MAX_TRAJECTORY_BUFFER = 1000;
+const DEFAULT_AUTO_PERSIST_MS = 30_000;
+// ===== Helpers =====
+/**
+ * Compute cosine similarity between two number arrays.
+ * Returns 0 when either vector has zero magnitude.
+ */
+function cosineSimilarity(a, b) {
+    const len = Math.min(a.length, b.length);
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    // Process in groups of 4 for better throughput
+    let i = 0;
+    for (; i + 3 < len; i += 4) {
+        dot += a[i] * b[i] + a[i + 1] * b[i + 1] + a[i + 2] * b[i + 2] + a[i + 3] * b[i + 3];
+        normA += a[i] * a[i] + a[i + 1] * a[i + 1] + a[i + 2] * a[i + 2] + a[i + 3] * a[i + 3];
+        normB += b[i] * b[i] + b[i + 1] * b[i + 1] + b[i + 2] * b[i + 2] + b[i + 3] * b[i + 3];
+    }
+    for (; i < len; 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 ? dot / denom : 0;
+}
+function generateId(prefix) {
+    return `${prefix}-${Date.now()}-${Math.random().toString(36).slice(2, 8)}`;
+}
+// ===== PersistentSonaCoordinator =====
+/**
+ * Coordinates SONA learning with persistent storage.
+ *
+ * @example
+ * ```typescript
+ * const sona = new PersistentSonaCoordinator({
+ *   storePath: './data/sona-learning.rvls',
+ * });
+ * await sona.initialize();
+ *
+ * // Store a pattern
+ * const id = sona.storePattern('query_response', embedding);
+ *
+ * // Find similar patterns
+ * const matches = sona.findSimilarPatterns(queryEmbedding, 5);
+ *
+ * // Record a trajectory
+ * sona.recordTrajectory({ id: 'traj-1', steps: [...], outcome: 'success', ... });
+ *
+ * // Periodic background learning
+ * const result = sona.runBackgroundLoop();
+ *
+ * await sona.shutdown();
+ * ```
+ */
+export class PersistentSonaCoordinator {
+    store;
+    patterns = new Map();
+    trajectoryBuffer = [];
+    ewcState = null;
+    patternThreshold;
+    maxTrajectoryBuffer;
+    verbose;
+    initialized = false;
+    constructor(config) {
+        this.patternThreshold = config.patternThreshold ?? DEFAULT_PATTERN_THRESHOLD;
+        this.maxTrajectoryBuffer = config.maxTrajectoryBuffer ?? DEFAULT_MAX_TRAJECTORY_BUFFER;
+        this.verbose = config.verbose ?? false;
+        const storeConfig = {
+            storePath: config.storePath,
+            autoPersistInterval: config.autoPersistInterval ?? DEFAULT_AUTO_PERSIST_MS,
+            verbose: config.verbose,
+        };
+        this.store = new RvfLearningStore(storeConfig);
+    }
+    /**
+     * Initialize by loading persisted state from the RVF store.
+     */
+    async initialize() {
+        if (this.initialized)
+            return;
+        await this.store.initialize();
+        // Rebuild in-memory state from store
+        const patterns = await this.store.loadPatterns();
+        for (const p of patterns) {
+            this.patterns.set(p.id, p);
+        }
+        const ewc = await this.store.loadEwcState();
+        this.ewcState = ewc;
+        const trajectories = await this.store.getTrajectories();
+        // getTrajectories returns newest-first, reverse for chronological buffer
+        this.trajectoryBuffer = trajectories.reverse();
+        this.initialized = true;
+        this.log(`Initialized: ${this.patterns.size} patterns, ` +
+            `${this.trajectoryBuffer.length} trajectories, ` +
+            `EWC: ${this.ewcState ? 'yes' : 'no'}`);
+    }
+    // ===== Pattern operations =====
+    /**
+     * Store a new pattern and return its ID.
+     *
+     * @param type - Pattern type (e.g. 'query_response', 'routing')
+     * @param embedding - The pattern embedding vector
+     * @param metadata - Optional extra metadata (currently unused, reserved)
+     * @returns The generated pattern ID
+     */
+    storePattern(type, embedding, metadata) {
+        this.ensureInitialized();
+        const id = generateId('pat');
+        const record = {
+            id,
+            type,
+            embedding: [...embedding],
+            successRate: 1.0,
+            useCount: 0,
+            lastUsed: new Date().toISOString(),
+        };
+        this.patterns.set(id, record);
+        // Mark for persistence on next persist() call
+        void this.store.savePatterns([record]).catch(() => { });
+        return id;
+    }
+    /**
+     * Find the k most similar patterns above the configured threshold.
+     * Uses brute-force cosine similarity (suitable for small pattern sets).
+     */
+    findSimilarPatterns(embedding, k = 5) {
+        this.ensureInitialized();
+        const results = [];
+        for (const record of this.patterns.values()) {
+            const score = cosineSimilarity(embedding, record.embedding);
+            if (score >= this.patternThreshold) {
+                results.push({ record, score });
+            }
+        }
+        // Sort descending by score and take top-k
+        results.sort((a, b) => b.score - a.score);
+        return results.slice(0, k).map((r) => r.record);
+    }
+    /**
+     * Record a pattern usage outcome. Updates the success rate using an
+     * exponential moving average (alpha = 0.1).
+     */
+    recordPatternUsage(patternId, success) {
+        this.ensureInitialized();
+        const pattern = this.patterns.get(patternId);
+        if (!pattern)
+            return;
+        pattern.useCount++;
+        pattern.lastUsed = new Date().toISOString();
+        const alpha = 0.1;
+        const outcome = success ? 1.0 : 0.0;
+        pattern.successRate = alpha * outcome + (1 - alpha) * pattern.successRate;
+    }
+    /**
+     * Remove patterns that have low success rates after sufficient usage.
+     *
+     * @returns The number of patterns pruned
+     */
+    prunePatterns(minSuccessRate = 0.3, minUseCount = 5) {
+        this.ensureInitialized();
+        let pruned = 0;
+        for (const [id, pattern] of this.patterns) {
+            if (pattern.useCount >= minUseCount && pattern.successRate < minSuccessRate) {
+                this.patterns.delete(id);
+                pruned++;
+            }
+        }
+        if (pruned > 0) {
+            this.log(`Pruned ${pruned} low-performing patterns`);
+        }
+        return pruned;
+    }
+    // ===== Trajectory tracking =====
+    /**
+     * Buffer a completed trajectory for later processing.
+     * When the buffer exceeds maxTrajectoryBuffer, the oldest entries
+     * are evicted.
+     */
+    recordTrajectory(trajectory) {
+        this.ensureInitialized();
+        const copy = { ...trajectory };
+        this.trajectoryBuffer.push(copy);
+        // Persist to store immediately so evicted entries are not lost
+        void this.store.appendTrajectory(copy).catch(() => { });
+        while (this.trajectoryBuffer.length > this.maxTrajectoryBuffer) {
+            this.trajectoryBuffer.shift();
+        }
+    }
+    // ===== Learning loop =====
+    /**
+     * Process buffered trajectories to extract new patterns.
+     * Successful and partial trajectories are mined for high-confidence
+     * steps; new patterns are stored if they are sufficiently different
+     * from existing ones.
+     *
+     * After processing, the trajectory buffer is cleared and low-performing
+     * patterns are pruned.
+     *
+     * @returns Summary of the learning pass
+     */
+    runBackgroundLoop() {
+        this.ensureInitialized();
+        let patternsLearned = 0;
+        const trajectoriesProcessed = this.trajectoryBuffer.length;
+        for (const traj of this.trajectoryBuffer) {
+            if (traj.outcome === 'success' || traj.outcome === 'partial') {
+                patternsLearned += this.extractPatternsFromTrajectory(traj);
+            }
+        }
+        this.prunePatterns();
+        this.trajectoryBuffer = [];
+        this.log(`Background loop: ${patternsLearned} patterns learned, ` +
+            `${trajectoriesProcessed} trajectories processed`);
+        return { patternsLearned, trajectoriesProcessed };
+    }
+    // ===== Persistence =====
+    /**
+     * Flush current in-memory state to the RVF store on disk.
+     */
+    async persist() {
+        const allPatterns = Array.from(this.patterns.values());
+        await this.store.savePatterns(allPatterns);
+        if (this.ewcState) {
+            await this.store.saveEwcState(this.ewcState);
+        }
+        // Persist any buffered trajectories that have not yet been saved
+        for (const traj of this.trajectoryBuffer) {
+            await this.store.appendTrajectory(traj);
+        }
+        await this.store.persist();
+    }
+    /**
+     * Persist state and shut down the store.
+     */
+    async shutdown() {
+        if (!this.initialized)
+            return;
+        await this.persist();
+        await this.store.close();
+        this.initialized = false;
+        this.log('Shutdown complete');
+    }
+    // ===== Stats =====
+    /**
+     * Return a summary of the coordinator's current state.
+     */
+    getStats() {
+        let totalSuccessRate = 0;
+        let count = 0;
+        for (const p of this.patterns.values()) {
+            totalSuccessRate += p.successRate;
+            count++;
+        }
+        return {
+            patterns: this.patterns.size,
+            avgSuccessRate: count > 0 ? totalSuccessRate / count : 0,
+            trajectoriesBuffered: this.trajectoryBuffer.length,
+            ewcTasksLearned: this.ewcState?.tasksLearned ?? 0,
+        };
+    }
+    // ===== Private =====
+    /**
+     * Extract patterns from a trajectory's high-confidence steps.
+     * A step produces a new pattern only if no sufficiently similar
+     * pattern already exists.
+     */
+    extractPatternsFromTrajectory(trajectory) {
+        let extracted = 0;
+        for (const step of trajectory.steps) {
+            if (step.confidence < this.patternThreshold)
+                continue;
+            const embedding = this.createHashEmbedding(step.input + step.output);
+            const similar = this.findSimilarPatterns(embedding, 1);
+            if (similar.length === 0) {
+                this.storePattern(step.type, embedding);
+                extracted++;
+            }
+        }
+        return extracted;
+    }
+    /**
+     * Deterministic hash-based embedding for pattern extraction.
+     * This is a lightweight stand-in for a real embedding model,
+     * matching the approach used in SonaCoordinator.
+     */
+    createHashEmbedding(text, dim = 64) {
+        const embedding = new Array(dim).fill(0);
+        for (let i = 0; i < text.length; i++) {
+            const idx = (text.charCodeAt(i) * (i + 1)) % dim;
+            embedding[idx] += 0.1;
+        }
+        let norm = 0;
+        for (let i = 0; i < dim; i++) {
+            norm += embedding[i] * embedding[i];
+        }
+        norm = Math.sqrt(norm) || 1;
+        for (let i = 0; i < dim; i++) {
+            embedding[i] /= norm;
+        }
+        return embedding;
+    }
+    ensureInitialized() {
+        if (!this.initialized) {
+            throw new Error('PersistentSonaCoordinator has not been initialized. Call initialize() first.');
+        }
+    }
+    log(message) {
+        if (this.verbose) {
+            // eslint-disable-next-line no-console
+            console.log(`[PersistentSona] ${message}`);
+        }
+    }
+}
+//# sourceMappingURL=persistent-sona.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"persistent-sona.js","sourceRoot":"","sources":["../src/persistent-sona.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EACL,gBAAgB,GACjB,MAAM,yBAAyB,CAAC;AAuBjC,wBAAwB;AAExB,MAAM,yBAAyB,GAAG,IAAI,CAAC;AACvC,MAAM,6BAA6B,GAAG,IAAI,CAAC;AAC3C,MAAM,uBAAuB,GAAG,MAAM,CAAC;AAEvC,sBAAsB;AAEtB;;;GAGG;AACH,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IACzC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,+CAA+C;IAC/C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3B,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrF,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvF,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzF,CAAC;IACD,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACpB,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,UAAU,CAAC,MAAc;IAChC,OAAO,GAAG,MAAM,IAAI,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AAC7E,CAAC;AAED,wCAAwC;AAExC;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,OAAO,yBAAyB;IAC5B,KAAK,CAAmB;IACxB,QAAQ,GAA+B,IAAI,GAAG,EAAE,CAAC;IACjD,gBAAgB,GAAuB,EAAE,CAAC;IAC1C,QAAQ,GAAqB,IAAI,CAAC;IAClC,gBAAgB,CAAS;IACzB,mBAAmB,CAAS;IAC5B,OAAO,CAAU;IACjB,WAAW,GAAG,KAAK,CAAC;IAE5B,YAAY,MAA4B;QACtC,IAAI,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,IAAI,yBAAyB,CAAC;QAC7E,IAAI,CAAC,mBAAmB,GAAG,MAAM,CAAC,mBAAmB,IAAI,6BAA6B,CAAC;QACvF,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,KAAK,CAAC;QAEvC,MAAM,WAAW,GAA2B;YAC1C,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,mBAAmB,EAAE,MAAM,CAAC,mBAAmB,IAAI,uBAAuB;YAC1E,OAAO,EAAE,MAAM,CAAC,OAAO;SACxB,CAAC;QAEF,IAAI,CAAC,KAAK,GAAG,IAAI,gBAAgB,CAAC,WAAW,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAE7B,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QAE9B,qCAAqC;QACrC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;QAED,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;QAC5C,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;QAEpB,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC;QACxD,yEAAyE;QACzE,IAAI,CAAC,gBAAgB,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;QAE/C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,GAAG,CACN,gBAAgB,IAAI,CAAC,QAAQ,CAAC,IAAI,aAAa;YAC/C,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,iBAAiB;YAChD,QAAQ,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CACvC,CAAC;IACJ,CAAC;IAED,iCAAiC;IAEjC;;;;;;;OAOG;IACH,YAAY,CACV,IAAY,EACZ,SAAmB,EACnB,QAAkC;QAElC,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,MAAM,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC7B,MAAM,MAAM,GAAkB;YAC5B,EAAE;YACF,IAAI;YACJ,SAAS,EAAE,CAAC,GAAG,SAAS,CAAC;YACzB,WAAW,EAAE,GAAG;YAChB,QAAQ,EAAE,CAAC;YACX,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACnC,CAAC;QAEF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC9B,8CAA8C;QAC9C,KAAK,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QACvD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;OAGG;IACH,mBAAmB,CAAC,SAAmB,EAAE,IAAY,CAAC;QACpD,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,MAAM,OAAO,GAAoD,EAAE,CAAC;QAEpE,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,gBAAgB,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;YAC5D,IAAI,KAAK,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACnC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAE1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAAC,SAAiB,EAAE,OAAgB;QACpD,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC7C,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,OAAO,CAAC,QAAQ,EAAE,CAAC;QACnB,OAAO,CAAC,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAE5C,MAAM,KAAK,GAAG,GAAG,CAAC;QAClB,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QACpC,OAAO,CAAC,WAAW,GAAG,KAAK,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC;IAC5E,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,iBAAyB,GAAG,EAAE,cAAsB,CAAC;QACjE,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1C,IAAI,OAAO,CAAC,QAAQ,IAAI,WAAW,IAAI,OAAO,CAAC,WAAW,GAAG,cAAc,EAAE,CAAC;gBAC5E,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACzB,MAAM,EAAE,CAAC;YACX,CAAC;QACH,CAAC;QAED,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,GAAG,CAAC,UAAU,MAAM,0BAA0B,CAAC,CAAC;QACvD,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,kCAAkC;IAElC;;;;OAIG;IACH,gBAAgB,CAAC,UAA4B;QAC3C,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,MAAM,IAAI,GAAG,EAAE,GAAG,UAAU,EAAE,CAAC;QAC/B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEjC,+DAA+D;QAC/D,KAAK,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAEvD,OAAO,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC/D,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAChC,CAAC;IACH,CAAC;IAED,4BAA4B;IAE5B;;;;;;;;;;OAUG;IACH,iBAAiB;QAIf,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,MAAM,qBAAqB,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;QAE3D,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACzC,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC7D,eAAe,IAAI,IAAI,CAAC,6BAA6B,CAAC,IAAI,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;QAED,IAAI,CAAC,aAAa,EAAE,CAAC;QACrB,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;QAE3B,IAAI,CAAC,GAAG,CACN,oBAAoB,eAAe,qBAAqB;YACxD,GAAG,qBAAqB,yBAAyB,CAClD,CAAC;QAEF,OAAO,EAAE,eAAe,EAAE,qBAAqB,EAAE,CAAC;IACpD,CAAC;IAED,0BAA0B;IAE1B;;OAEG;IACH,KAAK,CAAC,OAAO;QACX,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QACvD,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;QAE3C,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,CAAC;QAED,iEAAiE;QACjE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACzC,MAAM,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC;QAED,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ;QACZ,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,OAAO;QAE9B,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACrB,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;IAChC,CAAC;IAED,oBAAoB;IAEpB;;OAEG;IACH,QAAQ;QAMN,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,gBAAgB,IAAI,CAAC,CAAC,WAAW,CAAC;YAClC,KAAK,EAAE,CAAC;QACV,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI;YAC5B,cAAc,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACxD,oBAAoB,EAAE,IAAI,CAAC,gBAAgB,CAAC,MAAM;YAClD,eAAe,EAAE,IAAI,CAAC,QAAQ,EAAE,YAAY,IAAI,CAAC;SAClD,CAAC;IACJ,CAAC;IAED,sBAAsB;IAEtB;;;;OAIG;IACK,6BAA6B,CAAC,UAA4B;QAChE,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;YACpC,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,gBAAgB;gBAAE,SAAS;YAEtD,MAAM,SAAS,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;YACrE,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YAEvD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;gBACxC,SAAS,EAAE,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACK,mBAAmB,CAAC,IAAY,EAAE,MAAc,EAAE;QACxD,MAAM,SAAS,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjD,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;QACxB,CAAC;QAED,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QACvB,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,iBAAiB;QACvB,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CACb,8EAA8E,CAC/E,CAAC;QACJ,CAAC;IACH,CAAC;IAEO,GAAG,CAAC,OAAe;QACzB,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,sCAAsC;YACtC,OAAO,CAAC,GAAG,CAAC,oBAAoB,OAAO,EAAE,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;CACF"}