@agentic-qe/v3 3.0.0-alpha.10

package/dist/neural-optimizer/replay-buffer.d.ts

@@ -0,0 +1,126 @@
+/**
+ * Agentic QE v3 - Prioritized Experience Replay Buffer
+ * ADR-034: RL-based swarm topology optimization
+ *
+ * Implements prioritized experience replay for stable RL training:
+ * - Priority based on TD error (higher error = more learning potential)
+ * - Proportional prioritization with importance sampling
+ * - Circular buffer with configurable capacity
+ */
+import type { Experience, IReplayBuffer } from './types';
+/**
+ * Prioritized Experience Replay Buffer
+ *
+ * Features:
+ * - Priority based on TD error magnitude
+ * - Proportional prioritization with sum tree
+ * - Importance sampling weights for bias correction
+ */
+export declare class PrioritizedReplayBuffer implements IReplayBuffer {
+    /** Experience storage */
+    private buffer;
+    /** Sum tree for priority sampling */
+    private sumTree;
+    /** Buffer capacity */
+    private readonly capacity;
+    /** Current number of experiences */
+    private count;
+    /** Write position */
+    private writeIdx;
+    /** Priority exponent (alpha): how much to use priorities */
+    private readonly alpha;
+    /** Importance sampling exponent (beta): bias correction */
+    private beta;
+    /** Beta annealing rate */
+    private readonly betaAnnealing;
+    /** Small constant to ensure non-zero priority */
+    private readonly priorityEpsilon;
+    /** Maximum priority seen */
+    private maxPriority;
+    constructor(capacity: number, options?: {
+        alpha?: number;
+        beta?: number;
+        betaAnnealing?: number;
+    });
+    /**
+     * Get buffer length
+     */
+    get length(): number;
+    /**
+     * Add experience to buffer
+     *
+     * New experiences get max priority to ensure they're sampled at least once
+     */
+    push(experience: Experience): void;
+    /**
+     * Convert TD error to priority value
+     */
+    private getPriorityFromTdError;
+    /**
+     * Sample experiences using proportional prioritization
+     *
+     * @param batchSize - Number of experiences to sample
+     * @returns Array of experiences with importance sampling weights
+     */
+    sample(batchSize: number): Experience[];
+    /**
+     * Sample with importance sampling weights for bias correction
+     */
+    sampleWithWeights(batchSize: number): {
+        experiences: Experience[];
+        weights: number[];
+        indices: number[];
+    };
+    /**
+     * Update priorities for sampled experiences
+     *
+     * Called after computing new TD errors during training
+     */
+    updatePriorities(indices: number[], priorities: number[]): void;
+    /**
+     * Clear all experiences
+     */
+    clear(): void;
+    /**
+     * Get current beta value
+     */
+    getBeta(): number;
+    /**
+     * Get buffer statistics
+     */
+    getStats(): {
+        count: number;
+        capacity: number;
+        totalPriority: number;
+        maxPriority: number;
+        beta: number;
+    };
+}
+/**
+ * Simple uniform sampling replay buffer
+ *
+ * Use when prioritized replay is not needed
+ */
+export declare class UniformReplayBuffer implements IReplayBuffer {
+    private buffer;
+    private readonly capacity;
+    constructor(capacity: number);
+    get length(): number;
+    push(experience: Experience): void;
+    sample(batchSize: number): Experience[];
+    updatePriorities(_indices: number[], _priorities: number[]): void;
+    clear(): void;
+}
+/**
+ * Create a prioritized replay buffer
+ */
+export declare function createPrioritizedReplayBuffer(capacity: number, options?: {
+    alpha?: number;
+    beta?: number;
+    betaAnnealing?: number;
+}): PrioritizedReplayBuffer;
+/**
+ * Create a uniform replay buffer
+ */
+export declare function createUniformReplayBuffer(capacity: number): UniformReplayBuffer;
+//# sourceMappingURL=replay-buffer.d.ts.map

package/dist/neural-optimizer/replay-buffer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay-buffer.d.ts","sourceRoot":"","sources":["../../src/neural-optimizer/replay-buffer.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAyIzD;;;;;;;GAOG;AACH,qBAAa,uBAAwB,YAAW,aAAa;IAC3D,yBAAyB;IACzB,OAAO,CAAC,MAAM,CAAwB;IAEtC,qCAAqC;IACrC,OAAO,CAAC,OAAO,CAAU;IAEzB,sBAAsB;IACtB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAElC,oCAAoC;IACpC,OAAO,CAAC,KAAK,CAAa;IAE1B,qBAAqB;IACrB,OAAO,CAAC,QAAQ,CAAa;IAE7B,4DAA4D;IAC5D,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAE/B,2DAA2D;IAC3D,OAAO,CAAC,IAAI,CAAS;IAErB,0BAA0B;IAC1B,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAS;IAEvC,iDAAiD;IACjD,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAgB;IAEhD,4BAA4B;IAC5B,OAAO,CAAC,WAAW,CAAe;gBAGhC,QAAQ,EAAE,MAAM,EAChB,OAAO,GAAE;QACP,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,aAAa,CAAC,EAAE,MAAM,CAAC;KACnB;IAUR;;OAEG;IACH,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED;;;;OAIG;IACH,IAAI,CAAC,UAAU,EAAE,UAAU,GAAG,IAAI;IAalC;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAU9B;;;;;OAKG;IACH,MAAM,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,EAAE;IAiCvC;;OAEG;IACH,iBAAiB,CACf,SAAS,EAAE,MAAM,GAChB;QAAE,WAAW,EAAE,UAAU,EAAE,CAAC;QAAC,OAAO,EAAE,MAAM,EAAE,CAAC;QAAC,OAAO,EAAE,MAAM,EAAE,CAAA;KAAE;IA0CtE;;;;OAIG;IACH,gBAAgB,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,IAAI;IAS/D;;OAEG;IACH,KAAK,IAAI,IAAI;IAQb;;OAEG;IACH,OAAO,IAAI,MAAM;IAIjB;;OAEG;IACH,QAAQ,IAAI;QACV,KAAK,EAAE,MAAM,CAAC;QACd,QAAQ,EAAE,MAAM,CAAC;QACjB,aAAa,EAAE,MAAM,CAAC;QACtB,WAAW,EAAE,MAAM,CAAC;QACpB,IAAI,EAAE,MAAM,CAAC;KACd;CASF;AAMD;;;;GAIG;AACH,qBAAa,mBAAoB,YAAW,aAAa;IACvD,OAAO,CAAC,MAAM,CAAoB;IAClC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;gBAEtB,QAAQ,EAAE,MAAM;IAI5B,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,IAAI,CAAC,UAAU,EAAE,UAAU,GAAG,IAAI;IAOlC,MAAM,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,EAAE;IAgBvC,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,IAAI;IAIjE,KAAK,IAAI,IAAI;CAGd;AAMD;;GAEG;AACH,wBAAgB,6BAA6B,CAC3C,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE;IACR,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB,GACA,uBAAuB,CAEzB;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,QAAQ,EAAE,MAAM,GAAG,mBAAmB,CAE/E"}

package/dist/neural-optimizer/replay-buffer.js

@@ -0,0 +1,355 @@
+/**
+ * Agentic QE v3 - Prioritized Experience Replay Buffer
+ * ADR-034: RL-based swarm topology optimization
+ *
+ * Implements prioritized experience replay for stable RL training:
+ * - Priority based on TD error (higher error = more learning potential)
+ * - Proportional prioritization with importance sampling
+ * - Circular buffer with configurable capacity
+ */
+// ============================================================================
+// Sum Tree for Efficient Priority Sampling
+// ============================================================================
+/**
+ * Sum Tree data structure for O(log n) priority sampling
+ *
+ * A binary tree where:
+ * - Leaves store priorities
+ * - Internal nodes store sum of children
+ * - Total sum at root enables proportional sampling
+ */
+class SumTree {
+    /** Total capacity (number of leaves) */
+    capacity;
+    /** Tree array: size = 2 * capacity - 1 */
+    tree;
+    /** Current write position */
+    writeIdx = 0;
+    constructor(capacity) {
+        this.capacity = capacity;
+        // Tree has 2*n - 1 nodes for n leaves
+        this.tree = new Array(2 * capacity - 1).fill(0);
+    }
+    /**
+     * Get total priority sum (root value)
+     */
+    get total() {
+        return this.tree[0];
+    }
+    /**
+     * Add priority value at next position
+     */
+    add(priority) {
+        const leafIdx = this.writeIdx;
+        const treeIdx = this.capacity - 1 + leafIdx;
+        this.update(treeIdx, priority);
+        this.writeIdx = (this.writeIdx + 1) % this.capacity;
+        return leafIdx;
+    }
+    /**
+     * Update priority at tree index
+     */
+    update(treeIdx, priority) {
+        const change = priority - this.tree[treeIdx];
+        this.tree[treeIdx] = priority;
+        // Propagate change up to root
+        let idx = treeIdx;
+        while (idx > 0) {
+            idx = Math.floor((idx - 1) / 2);
+            this.tree[idx] += change;
+        }
+    }
+    /**
+     * Update priority at leaf index
+     */
+    updateLeaf(leafIdx, priority) {
+        const treeIdx = this.capacity - 1 + leafIdx;
+        this.update(treeIdx, priority);
+    }
+    /**
+     * Get leaf index and priority for a value in [0, total)
+     */
+    get(value) {
+        let idx = 0;
+        while (idx < this.capacity - 1) {
+            const leftChild = 2 * idx + 1;
+            const rightChild = leftChild + 1;
+            if (value <= this.tree[leftChild]) {
+                idx = leftChild;
+            }
+            else {
+                value -= this.tree[leftChild];
+                idx = rightChild;
+            }
+        }
+        const leafIdx = idx - (this.capacity - 1);
+        return {
+            leafIdx,
+            priority: this.tree[idx],
+        };
+    }
+    /**
+     * Get priority at leaf index
+     */
+    getPriority(leafIdx) {
+        const treeIdx = this.capacity - 1 + leafIdx;
+        return this.tree[treeIdx];
+    }
+    /**
+     * Get minimum non-zero priority across all leaves
+     * Used for importance sampling weight normalization
+     */
+    getMinPriority(count) {
+        let minPriority = Infinity;
+        const leafStart = this.capacity - 1;
+        for (let i = 0; i < count; i++) {
+            const priority = this.tree[leafStart + i];
+            if (priority > 0 && priority < minPriority) {
+                minPriority = priority;
+            }
+        }
+        return minPriority === Infinity ? 1e-8 : minPriority;
+    }
+    /**
+     * Clear all priorities
+     */
+    clear() {
+        this.tree.fill(0);
+        this.writeIdx = 0;
+    }
+}
+// ============================================================================
+// Prioritized Replay Buffer
+// ============================================================================
+/**
+ * Prioritized Experience Replay Buffer
+ *
+ * Features:
+ * - Priority based on TD error magnitude
+ * - Proportional prioritization with sum tree
+ * - Importance sampling weights for bias correction
+ */
+export class PrioritizedReplayBuffer {
+    /** Experience storage */
+    buffer;
+    /** Sum tree for priority sampling */
+    sumTree;
+    /** Buffer capacity */
+    capacity;
+    /** Current number of experiences */
+    count = 0;
+    /** Write position */
+    writeIdx = 0;
+    /** Priority exponent (alpha): how much to use priorities */
+    alpha;
+    /** Importance sampling exponent (beta): bias correction */
+    beta;
+    /** Beta annealing rate */
+    betaAnnealing;
+    /** Small constant to ensure non-zero priority */
+    priorityEpsilon = 0.01;
+    /** Maximum priority seen */
+    maxPriority = 1.0;
+    constructor(capacity, options = {}) {
+        this.capacity = capacity;
+        this.buffer = new Array(capacity).fill(null);
+        this.sumTree = new SumTree(capacity);
+        this.alpha = options.alpha ?? 0.6;
+        this.beta = options.beta ?? 0.4;
+        this.betaAnnealing = options.betaAnnealing ?? 0.001;
+    }
+    /**
+     * Get buffer length
+     */
+    get length() {
+        return this.count;
+    }
+    /**
+     * Add experience to buffer
+     *
+     * New experiences get max priority to ensure they're sampled at least once
+     */
+    push(experience) {
+        // Use max priority for new experiences
+        const priority = this.getPriorityFromTdError(experience.tdError || this.maxPriority);
+        this.buffer[this.writeIdx] = experience;
+        this.sumTree.updateLeaf(this.writeIdx, priority);
+        this.writeIdx = (this.writeIdx + 1) % this.capacity;
+        this.count = Math.min(this.count + 1, this.capacity);
+    }
+    /**
+     * Convert TD error to priority value
+     */
+    getPriorityFromTdError(tdError) {
+        // Priority = (|TD error| + epsilon)^alpha
+        const priority = Math.pow(Math.abs(tdError) + this.priorityEpsilon, this.alpha);
+        this.maxPriority = Math.max(this.maxPriority, priority);
+        return priority;
+    }
+    /**
+     * Sample experiences using proportional prioritization
+     *
+     * @param batchSize - Number of experiences to sample
+     * @returns Array of experiences with importance sampling weights
+     */
+    sample(batchSize) {
+        if (this.count === 0) {
+            return [];
+        }
+        const actualBatchSize = Math.min(batchSize, this.count);
+        const experiences = [];
+        const indices = [];
+        const total = this.sumTree.total;
+        const segment = total / actualBatchSize;
+        // Anneal beta towards 1.0
+        this.beta = Math.min(1.0, this.beta + this.betaAnnealing);
+        // Sample from each segment for stratified sampling
+        for (let i = 0; i < actualBatchSize; i++) {
+            const low = segment * i;
+            const high = segment * (i + 1);
+            const value = Math.random() * (high - low) + low;
+            const { leafIdx } = this.sumTree.get(value);
+            // Ensure valid experience
+            if (this.buffer[leafIdx] !== null) {
+                experiences.push(this.buffer[leafIdx]);
+                indices.push(leafIdx);
+            }
+        }
+        return experiences;
+    }
+    /**
+     * Sample with importance sampling weights for bias correction
+     */
+    sampleWithWeights(batchSize) {
+        if (this.count === 0) {
+            return { experiences: [], weights: [], indices: [] };
+        }
+        const actualBatchSize = Math.min(batchSize, this.count);
+        const experiences = [];
+        const weights = [];
+        const indices = [];
+        const total = this.sumTree.total;
+        const segment = total / actualBatchSize;
+        // Anneal beta
+        this.beta = Math.min(1.0, this.beta + this.betaAnnealing);
+        // Min probability for weight normalization - use actual minimum across all experiences
+        const minPriority = this.sumTree.getMinPriority(this.count);
+        const minProb = minPriority / total;
+        const maxWeight = Math.pow(this.count * minProb, -this.beta);
+        for (let i = 0; i < actualBatchSize; i++) {
+            const low = segment * i;
+            const high = segment * (i + 1);
+            const value = Math.random() * (high - low) + low;
+            const { leafIdx, priority } = this.sumTree.get(value);
+            if (this.buffer[leafIdx] !== null) {
+                const prob = priority / total;
+                // Importance sampling weight: (1 / (N * P(i)))^beta / max_weight
+                const weight = Math.pow(this.count * prob, -this.beta) / maxWeight;
+                experiences.push(this.buffer[leafIdx]);
+                weights.push(weight);
+                indices.push(leafIdx);
+            }
+        }
+        return { experiences, weights, indices };
+    }
+    /**
+     * Update priorities for sampled experiences
+     *
+     * Called after computing new TD errors during training
+     */
+    updatePriorities(indices, priorities) {
+        for (let i = 0; i < indices.length; i++) {
+            const idx = indices[i];
+            const tdError = priorities[i];
+            const priority = this.getPriorityFromTdError(tdError);
+            this.sumTree.updateLeaf(idx, priority);
+        }
+    }
+    /**
+     * Clear all experiences
+     */
+    clear() {
+        this.buffer.fill(null);
+        this.sumTree.clear();
+        this.count = 0;
+        this.writeIdx = 0;
+        this.maxPriority = 1.0;
+    }
+    /**
+     * Get current beta value
+     */
+    getBeta() {
+        return this.beta;
+    }
+    /**
+     * Get buffer statistics
+     */
+    getStats() {
+        return {
+            count: this.count,
+            capacity: this.capacity,
+            totalPriority: this.sumTree.total,
+            maxPriority: this.maxPriority,
+            beta: this.beta,
+        };
+    }
+}
+// ============================================================================
+// Simple Uniform Replay Buffer (Alternative)
+// ============================================================================
+/**
+ * Simple uniform sampling replay buffer
+ *
+ * Use when prioritized replay is not needed
+ */
+export class UniformReplayBuffer {
+    buffer = [];
+    capacity;
+    constructor(capacity) {
+        this.capacity = capacity;
+    }
+    get length() {
+        return this.buffer.length;
+    }
+    push(experience) {
+        if (this.buffer.length >= this.capacity) {
+            this.buffer.shift();
+        }
+        this.buffer.push(experience);
+    }
+    sample(batchSize) {
+        const actualBatchSize = Math.min(batchSize, this.buffer.length);
+        const samples = [];
+        const usedIndices = new Set();
+        while (samples.length < actualBatchSize) {
+            const idx = Math.floor(Math.random() * this.buffer.length);
+            if (!usedIndices.has(idx)) {
+                usedIndices.add(idx);
+                samples.push(this.buffer[idx]);
+            }
+        }
+        return samples;
+    }
+    updatePriorities(_indices, _priorities) {
+        // No-op for uniform sampling
+    }
+    clear() {
+        this.buffer = [];
+    }
+}
+// ============================================================================
+// Factory Functions
+// ============================================================================
+/**
+ * Create a prioritized replay buffer
+ */
+export function createPrioritizedReplayBuffer(capacity, options) {
+    return new PrioritizedReplayBuffer(capacity, options);
+}
+/**
+ * Create a uniform replay buffer
+ */
+export function createUniformReplayBuffer(capacity) {
+    return new UniformReplayBuffer(capacity);
+}
+//# sourceMappingURL=replay-buffer.js.map

package/dist/neural-optimizer/replay-buffer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay-buffer.js","sourceRoot":"","sources":["../../src/neural-optimizer/replay-buffer.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,+EAA+E;AAC/E,2CAA2C;AAC3C,+EAA+E;AAE/E;;;;;;;GAOG;AACH,MAAM,OAAO;IACX,wCAAwC;IACvB,QAAQ,CAAS;IAElC,0CAA0C;IAClC,IAAI,CAAW;IAEvB,6BAA6B;IACrB,QAAQ,GAAW,CAAC,CAAC;IAE7B,YAAY,QAAgB;QAC1B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,sCAAsC;QACtC,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,QAAgB;QAClB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC;QAE5C,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAE/B,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QACpD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,OAAe,EAAE,QAAgB;QACtC,MAAM,MAAM,GAAG,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,QAAQ,CAAC;QAE9B,8BAA8B;QAC9B,IAAI,GAAG,GAAG,OAAO,CAAC;QAClB,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;YACf,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC;QAC3B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,OAAe,EAAE,QAAgB;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC;QAC5C,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,KAAa;QACf,IAAI,GAAG,GAAG,CAAC,CAAC;QAEZ,OAAO,GAAG,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,SAAS,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;YAC9B,MAAM,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC;YAEjC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAClC,GAAG,GAAG,SAAS,CAAC;YAClB,CAAC;iBAAM,CAAC;gBACN,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC9B,GAAG,GAAG,UAAU,CAAC;YACnB,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QAC1C,OAAO;YACL,OAAO;YACP,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;SACzB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,OAAe;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC;QAC5C,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,KAAa;QAC1B,IAAI,WAAW,GAAG,QAAQ,CAAC;QAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAEpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YAC1C,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,WAAW,EAAE,CAAC;gBAC3C,WAAW,GAAG,QAAQ,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC;IACvD,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACpB,CAAC;CACF;AAED,+EAA+E;AAC/E,4BAA4B;AAC5B,+EAA+E;AAE/E;;;;;;;GAOG;AACH,MAAM,OAAO,uBAAuB;IAClC,yBAAyB;IACjB,MAAM,CAAwB;IAEtC,qCAAqC;IAC7B,OAAO,CAAU;IAEzB,sBAAsB;IACL,QAAQ,CAAS;IAElC,oCAAoC;IAC5B,KAAK,GAAW,CAAC,CAAC;IAE1B,qBAAqB;IACb,QAAQ,GAAW,CAAC,CAAC;IAE7B,4DAA4D;IAC3C,KAAK,CAAS;IAE/B,2DAA2D;IACnD,IAAI,CAAS;IAErB,0BAA0B;IACT,aAAa,CAAS;IAEvC,iDAAiD;IAChC,eAAe,GAAW,IAAI,CAAC;IAEhD,4BAA4B;IACpB,WAAW,GAAW,GAAG,CAAC;IAElC,YACE,QAAgB,EAChB,UAII,EAAE;QAEN,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,CAAC,OAAO,GAAG,IAAI,OAAO,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,GAAG,CAAC;QAClC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,GAAG,CAAC;QAChC,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,KAAK,CAAC;IACtD,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,UAAsB;QACzB,uCAAuC;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,sBAAsB,CAC1C,UAAU,CAAC,OAAO,IAAI,IAAI,CAAC,WAAW,CACvC,CAAC;QAEF,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,UAAU,CAAC;QACxC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAEjD,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QACpD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,OAAe;QAC5C,0CAA0C;QAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CACvB,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,eAAe,EACxC,IAAI,CAAC,KAAK,CACX,CAAC;QACF,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QACxD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,SAAiB;QACtB,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,MAAM,WAAW,GAAiB,EAAE,CAAC;QACrC,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACjC,MAAM,OAAO,GAAG,KAAK,GAAG,eAAe,CAAC;QAExC,0BAA0B;QAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;QAE1D,mDAAmD;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,OAAO,GAAG,CAAC,CAAC;YACxB,MAAM,IAAI,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;YAEjD,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAE5C,0BAA0B;YAC1B,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;gBAClC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAE,CAAC,CAAC;gBACxC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,iBAAiB,CACf,SAAiB;QAEjB,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QACvD,CAAC;QAED,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,MAAM,WAAW,GAAiB,EAAE,CAAC;QACrC,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACjC,MAAM,OAAO,GAAG,KAAK,GAAG,eAAe,CAAC;QAExC,cAAc;QACd,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;QAE1D,uFAAuF;QACvF,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,WAAW,GAAG,KAAK,CAAC;QACpC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,OAAO,GAAG,CAAC,CAAC;YACxB,MAAM,IAAI,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;YAEjD,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAEtD,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;gBAClC,MAAM,IAAI,GAAG,QAAQ,GAAG,KAAK,CAAC;gBAC9B,iEAAiE;gBACjE,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;gBAEnE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAE,CAAC,CAAC;gBACxC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;IAC3C,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,OAAiB,EAAE,UAAoB;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;YACtD,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,QAAQ;QAON,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,aAAa,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK;YACjC,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,IAAI,EAAE,IAAI,CAAC,IAAI;SAChB,CAAC;IACJ,CAAC;CACF;AAED,+EAA+E;AAC/E,6CAA6C;AAC7C,+EAA+E;AAE/E;;;;GAIG;AACH,MAAM,OAAO,mBAAmB;IACtB,MAAM,GAAiB,EAAE,CAAC;IACjB,QAAQ,CAAS;IAElC,YAAY,QAAgB;QAC1B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,IAAI,CAAC,UAAsB;QACzB,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,CAAC,SAAiB;QACtB,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChE,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QAEtC,OAAO,OAAO,CAAC,MAAM,GAAG,eAAe,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC3D,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1B,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACrB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,gBAAgB,CAAC,QAAkB,EAAE,WAAqB;QACxD,6BAA6B;IAC/B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;IACnB,CAAC;CACF;AAED,+EAA+E;AAC/E,oBAAoB;AACpB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,6BAA6B,CAC3C,QAAgB,EAChB,OAIC;IAED,OAAO,IAAI,uBAAuB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CAAC,QAAgB;IACxD,OAAO,IAAI,mBAAmB,CAAC,QAAQ,CAAC,CAAC;AAC3C,CAAC"}

package/dist/neural-optimizer/swarm-topology.d.ts

@@ -0,0 +1,157 @@
+/**
+ * Agentic QE v3 - Swarm Topology Implementation
+ * ADR-034: RL-based swarm topology optimization
+ *
+ * Implements a mutable swarm topology for the neural optimizer to modify.
+ */
+import type { SwarmTopology, TopologyAgent, TopologyConnection, AgentMetrics } from './types';
+/**
+ * Mutable implementation of SwarmTopology for the neural optimizer
+ */
+export declare class MutableSwarmTopology implements SwarmTopology {
+    /** Mutable agent list */
+    private _agents;
+    /** Mutable connection list */
+    private _connections;
+    /** Topology type */
+    private _type;
+    /** Topology metadata */
+    private _metadata;
+    constructor(type?: SwarmTopology['type']);
+    get agents(): TopologyAgent[];
+    get connections(): TopologyConnection[];
+    get type(): SwarmTopology['type'];
+    get metadata(): Record<string, unknown>;
+    /**
+     * Add an agent to the topology
+     */
+    addAgent(agent: TopologyAgent): void;
+    /**
+     * Remove an agent and all its connections
+     */
+    removeAgent(agentId: string): boolean;
+    /**
+     * Get agent by ID
+     */
+    getAgent(agentId: string): TopologyAgent | undefined;
+    /**
+     * Update agent metrics
+     */
+    updateAgentMetrics(agentId: string, metrics: Partial<AgentMetrics>): void;
+    /**
+     * Update agent status
+     */
+    updateAgentStatus(agentId: string, status: TopologyAgent['status']): void;
+    /**
+     * Add a connection between agents
+     */
+    addConnection(from: string, to: string, weight?: number): void;
+    /**
+     * Remove a connection
+     */
+    removeConnection(from: string, to: string): boolean;
+    /**
+     * Update connection weight
+     */
+    updateConnectionWeight(from: string, to: string, delta: number): void;
+    /**
+     * Set connection weight directly
+     */
+    setConnectionWeight(from: string, to: string, weight: number): void;
+    /**
+     * Check if connection exists
+     */
+    hasConnection(from: string, to: string): boolean;
+    /**
+     * Get connections for an agent
+     */
+    getAgentConnections(agentId: string): TopologyConnection[];
+    /**
+     * Get degree of an agent
+     */
+    getAgentDegree(agentId: string): number;
+    /**
+     * Get neighbors of an agent
+     */
+    getNeighbors(agentId: string): string[];
+    /**
+     * Calculate graph density
+     */
+    getDensity(): number;
+    /**
+     * Calculate average degree
+     */
+    getAverageDegree(): number;
+    /**
+     * Calculate minimum degree (approximates min-cut)
+     */
+    getMinDegree(): number;
+    /**
+     * Calculate average connection weight
+     */
+    getAverageWeight(): number;
+    /**
+     * Calculate weight variance
+     */
+    getWeightVariance(): number;
+    /**
+     * Calculate clustering coefficient
+     */
+    getClusteringCoefficient(): number;
+    /**
+     * Get load statistics
+     */
+    getLoadStats(): {
+        avg: number;
+        variance: number;
+        idle: number;
+        overloaded: number;
+    };
+    /**
+     * Export topology to JSON
+     */
+    toJSON(): {
+        type: string;
+        agents: TopologyAgent[];
+        connections: TopologyConnection[];
+        metadata: Record<string, unknown>;
+    };
+    /**
+     * Import topology from JSON
+     */
+    static fromJSON(data: {
+        type?: string;
+        agents: TopologyAgent[];
+        connections: TopologyConnection[];
+        metadata?: Record<string, unknown>;
+    }): MutableSwarmTopology;
+    /**
+     * Create a copy of this topology
+     */
+    clone(): MutableSwarmTopology;
+}
+/**
+ * Build a mesh topology where every agent connects to every other
+ */
+export declare function buildMeshTopology(agents: TopologyAgent[]): MutableSwarmTopology;
+/**
+ * Build a ring topology
+ */
+export declare function buildRingTopology(agents: TopologyAgent[]): MutableSwarmTopology;
+/**
+ * Build a star topology with a central hub
+ */
+export declare function buildStarTopology(agents: TopologyAgent[], hubId: string): MutableSwarmTopology;
+/**
+ * Build a hierarchical topology with a coordinator and workers
+ */
+export declare function buildHierarchicalTopology(coordinator: TopologyAgent, workers: TopologyAgent[]): MutableSwarmTopology;
+/**
+ * Create an empty topology
+ */
+export declare function createTopology(type?: SwarmTopology['type']): MutableSwarmTopology;
+/**
+ * Create an agent with default metrics
+ */
+export declare function createAgent(id: string, type: string, options?: Partial<TopologyAgent>): TopologyAgent;
+//# sourceMappingURL=swarm-topology.d.ts.map

package/dist/neural-optimizer/swarm-topology.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"swarm-topology.d.ts","sourceRoot":"","sources":["../../src/neural-optimizer/swarm-topology.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACV,aAAa,EACb,aAAa,EACb,kBAAkB,EAClB,YAAY,EACb,MAAM,SAAS,CAAC;AAMjB;;GAEG;AACH,qBAAa,oBAAqB,YAAW,aAAa;IACxD,yBAAyB;IACzB,OAAO,CAAC,OAAO,CAAuB;IAEtC,8BAA8B;IAC9B,OAAO,CAAC,YAAY,CAA4B;IAEhD,oBAAoB;IACpB,OAAO,CAAC,KAAK,CAAwB;IAErC,wBAAwB;IACxB,OAAO,CAAC,SAAS,CAA+B;gBAEpC,IAAI,GAAE,aAAa,CAAC,MAAM,CAAY;IAQlD,IAAI,MAAM,IAAI,aAAa,EAAE,CAE5B;IAED,IAAI,WAAW,IAAI,kBAAkB,EAAE,CAEtC;IAED,IAAI,IAAI,IAAI,aAAa,CAAC,MAAM,CAAC,CAEhC;IAED,IAAI,QAAQ,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAEtC;IAMD;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI;IAQpC;;OAEG;IACH,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO;IAarC;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS;IAIpD;;OAEG;IACH,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,YAAY,CAAC,GAAG,IAAI;IAOzE;;OAEG;IACH,iBAAiB,CACf,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,aAAa,CAAC,QAAQ,CAAC,GAC9B,IAAI;IAeP;;OAEG;IACH,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,GAAE,MAAY,GAAG,IAAI;IAmBnE;;OAEG;IACH,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;IAWnD;;OAEG;IACH,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAUrE;;OAEG;IACH,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAUnE;;OAEG;IACH,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;IAOhD;;OAEG;IACH,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG,kBAAkB,EAAE;IAM1D;;OAEG;IACH,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAIvC;;OAEG;IACH,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE;IAavC;;OAEG;IACH,UAAU,IAAI,MAAM;IAQpB;;OAEG;IACH,gBAAgB,IAAI,MAAM;IAU1B;;OAEG;IACH,YAAY,IAAI,MAAM;IAWtB;;OAEG;IACH,gBAAgB,IAAI,MAAM;IAO1B;;OAEG;IACH,iBAAiB,IAAI,MAAM;IAQ3B;;OAEG;IACH,wBAAwB,IAAI,MAAM;IAyBlC;;OAEG;IACH,YAAY,IAAI;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE;IAwBnF;;OAEG;IACH,MAAM,IAAI;QACR,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,aAAa,EAAE,CAAC;QACxB,WAAW,EAAE,kBAAkB,EAAE,CAAC;QAClC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACnC;IASD;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE;QACpB,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,MAAM,EAAE,aAAa,EAAE,CAAC;QACxB,WAAW,EAAE,kBAAkB,EAAE,CAAC;QAClC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KACpC,GAAG,oBAAoB;IAUxB;;OAEG;IACH,KAAK,IAAI,oBAAoB;CAG9B;AAMD;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,aAAa,EAAE,GACtB,oBAAoB,CActB;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,aAAa,EAAE,GACtB,oBAAoB,CAatB;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,aAAa,EAAE,EACvB,KAAK,EAAE,MAAM,GACZ,oBAAoB,CActB;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CACvC,WAAW,EAAE,aAAa,EAC1B,OAAO,EAAE,aAAa,EAAE,GACvB,oBAAoB,CAUtB;AAMD;;GAEG;AACH,wBAAgB,cAAc,CAC5B,IAAI,GAAE,aAAa,CAAC,MAAM,CAAY,GACrC,oBAAoB,CAEtB;AAED;;GAEG;AACH,wBAAgB,WAAW,CACzB,EAAE,EAAE,MAAM,EACV,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE,OAAO,CAAC,aAAa,CAAM,GACnC,aAAa,CAcf"}