agentic-flow 2.0.7 → 3.0.0-alpha.2

package/dist/packages/agentdb/src/services/SonaTrajectoryService.js

@@ -0,0 +1,539 @@
+/**
+ * SonaTrajectoryService - Wraps @ruvector/sona for trajectory learning
+ *
+ * Provides trajectory recording and action prediction for agent learning.
+ * Uses @ruvector/sona for reinforcement learning when available,
+ * otherwise falls back to in-memory trajectory storage with simple
+ * frequency-based prediction.
+ *
+ * Usage:
+ *   const sona = new SonaTrajectoryService();
+ *   await sona.initialize();
+ *
+ *   // Record agent trajectories
+ *   await sona.recordTrajectory('coder', [
+ *     { state: { task: 'implement' }, action: 'write_code', reward: 0.8 },
+ *     { state: { task: 'test' }, action: 'run_tests', reward: 0.9 }
+ *   ]);
+ *
+ *   // Predict next action
+ *   const prediction = await sona.predict({ task: 'implement' });
+ */
+export class SonaTrajectoryService {
+    sona = null;
+    available = false;
+    engineType = 'js';
+    trajectories = new Map();
+    // RL Training state
+    policyConfig = {
+        learningRate: 0.001,
+        gamma: 0.99,
+        epsilon: 0.1,
+        entropyCoeff: 0.01
+    };
+    valueConfig = {
+        learningRate: 0.001,
+        gamma: 0.99,
+        lambda: 0.95
+    };
+    replayConfig = {
+        bufferSize: 10000,
+        batchSize: 32,
+        priorityAlpha: 0.6,
+        priorityBeta: 0.4
+    };
+    experienceBuffer = [];
+    metrics = {
+        episodeReward: 0,
+        avgReward: 0,
+        loss: 0,
+        epsilon: 0.1,
+        iterationCount: 0
+    };
+    policyWeights = new Map();
+    valueWeights = new Map();
+    /**
+     * Initialize the trajectory service
+     *
+     * ADR-062 Phase 2: Tries native @ruvector/sona (NAPI-RS) first,
+     * falls back to in-memory trajectory storage. Reports engine type.
+     *
+     * @returns true if @ruvector/sona was loaded, false if using fallback
+     */
+    async initialize() {
+        try {
+            const mod = await import('@ruvector/sona');
+            const SONA = mod.SONA || mod.Sona ||
+                mod.default?.SONA || mod.default?.Sona ||
+                mod.default;
+            if (SONA && typeof SONA === 'function') {
+                this.sona = new SONA();
+                this.available = true;
+                this.engineType = 'native';
+                console.log('[SonaTrajectoryService] Using native @ruvector/sona');
+                return true;
+            }
+            else if (SONA && typeof SONA === 'object') {
+                this.sona = SONA;
+                this.available = true;
+                this.engineType = 'native';
+                console.log('[SonaTrajectoryService] Using native @ruvector/sona');
+                return true;
+            }
+            this.available = false;
+            this.engineType = 'js';
+            return false;
+        }
+        catch {
+            this.available = false;
+            this.engineType = 'js';
+            return false;
+        }
+    }
+    /**
+     * Get the active engine type: 'native' or 'js'
+     */
+    getEngineType() {
+        return this.engineType;
+    }
+    /**
+     * Record a trajectory for an agent type
+     *
+     * When @ruvector/sona is available, steps are forwarded to the RL engine.
+     * Otherwise, trajectories are stored in memory for pattern analysis.
+     *
+     * @param agentType - Type of agent (e.g., 'coder', 'reviewer')
+     * @param steps - Sequence of state-action-reward tuples
+     */
+    async recordTrajectory(agentType, steps) {
+        if (steps.length === 0)
+            return;
+        const totalReward = steps.reduce((sum, s) => sum + s.reward, 0) / steps.length;
+        // Try @ruvector/sona first
+        if (this.sona) {
+            try {
+                for (const step of steps) {
+                    if (typeof this.sona.recordStep === 'function') {
+                        await this.sona.recordStep(step);
+                    }
+                    else if (typeof this.sona.record === 'function') {
+                        await this.sona.record(step);
+                    }
+                    else if (typeof this.sona.addStep === 'function') {
+                        await this.sona.addStep(step.state, step.action, step.reward);
+                    }
+                }
+                // Also store in-memory for local pattern access
+            }
+            catch {
+                // Fall through to in-memory storage
+            }
+        }
+        // In-memory storage (always maintained for local analysis)
+        if (!this.trajectories.has(agentType)) {
+            this.trajectories.set(agentType, []);
+        }
+        this.trajectories.get(agentType).push({ steps, reward: totalReward });
+    }
+    /**
+     * Predict the next action given a state
+     *
+     * When @ruvector/sona is available, uses the RL model for prediction.
+     * Otherwise, uses frequency-based prediction from stored trajectories.
+     *
+     * @param state - Current state to predict action for
+     * @returns Predicted action and confidence score
+     */
+    async predict(state) {
+        // Try @ruvector/sona first
+        if (this.sona) {
+            try {
+                let result;
+                if (typeof this.sona.predict === 'function') {
+                    result = await this.sona.predict(state);
+                }
+                else if (typeof this.sona.selectAction === 'function') {
+                    result = await this.sona.selectAction(state);
+                }
+                if (result) {
+                    return {
+                        action: result.action || result.name || String(result),
+                        confidence: result.confidence || result.probability || 0.8
+                    };
+                }
+            }
+            catch {
+                // Fall through to frequency-based prediction
+            }
+        }
+        // Frequency-based fallback: find the most common action across trajectories
+        return this.frequencyPredict();
+    }
+    /**
+     * Get trajectory patterns, optionally filtered by agent type
+     *
+     * When @ruvector/sona is available, queries the RL engine for patterns.
+     * Otherwise, returns stored trajectories.
+     *
+     * @param agentType - Optional agent type filter
+     * @returns Array of trajectory patterns
+     */
+    async getPatterns(agentType) {
+        // Try @ruvector/sona first
+        if (this.sona) {
+            try {
+                if (typeof this.sona.findPatterns === 'function') {
+                    const patterns = await this.sona.findPatterns();
+                    if (patterns && Array.isArray(patterns) && patterns.length > 0) {
+                        return patterns;
+                    }
+                }
+                else if (typeof this.sona.getPatterns === 'function') {
+                    const patterns = await this.sona.getPatterns();
+                    if (patterns && Array.isArray(patterns) && patterns.length > 0) {
+                        return patterns;
+                    }
+                }
+            }
+            catch {
+                // Fall through to in-memory trajectories
+            }
+        }
+        if (agentType) {
+            return this.trajectories.get(agentType) || [];
+        }
+        return Array.from(this.trajectories.values()).flat();
+    }
+    /**
+     * Check if @ruvector/sona is available
+     */
+    isAvailable() {
+        return this.available;
+    }
+    /**
+     * Get service statistics
+     */
+    getStats() {
+        return {
+            available: this.available,
+            trajectoryCount: Array.from(this.trajectories.values())
+                .reduce((sum, arr) => sum + arr.length, 0),
+            agentTypes: Array.from(this.trajectories.keys())
+        };
+    }
+    /**
+     * Clear all stored trajectories for an agent type, or all if not specified
+     */
+    clear(agentType) {
+        if (agentType) {
+            this.trajectories.delete(agentType);
+        }
+        else {
+            this.trajectories.clear();
+        }
+    }
+    /**
+     * Frequency-based action prediction from stored trajectories
+     */
+    frequencyPredict() {
+        const actionCounts = new Map();
+        for (const trajectories of this.trajectories.values()) {
+            for (const traj of trajectories) {
+                for (const step of traj.steps) {
+                    const entry = actionCounts.get(step.action) || { count: 0, totalReward: 0 };
+                    entry.count++;
+                    entry.totalReward += step.reward;
+                    actionCounts.set(step.action, entry);
+                }
+            }
+        }
+        if (actionCounts.size === 0) {
+            return { action: 'default', confidence: 0.5 };
+        }
+        // Find action with highest average reward
+        let bestAction = 'default';
+        let bestAvgReward = -Infinity;
+        let totalActions = 0;
+        for (const [action, entry] of actionCounts) {
+            totalActions += entry.count;
+            const avgReward = entry.totalReward / entry.count;
+            if (avgReward > bestAvgReward) {
+                bestAvgReward = avgReward;
+                bestAction = action;
+            }
+        }
+        // Confidence based on the proportion of observations
+        const bestCount = actionCounts.get(bestAction)?.count || 0;
+        const confidence = Math.min(0.95, bestCount / Math.max(totalActions, 1));
+        return { action: bestAction, confidence };
+    }
+    // ==================== RL Training Methods ====================
+    /**
+     * Train policy using Policy Gradient (REINFORCE with baseline)
+     *
+     * @param episodes - Array of trajectories to learn from
+     * @param config - Optional policy gradient configuration
+     * @returns Training loss
+     */
+    async trainPolicy(episodes, config) {
+        if (config) {
+            this.policyConfig = { ...this.policyConfig, ...config };
+        }
+        let totalLoss = 0;
+        let episodeCount = 0;
+        for (const episode of episodes) {
+            const returns = [];
+            let G = 0;
+            // Calculate returns (backwards)
+            for (let t = episode.steps.length - 1; t >= 0; t--) {
+                G = episode.steps[t].reward + this.policyConfig.gamma * G;
+                returns.unshift(G);
+            }
+            // Calculate baseline (average return)
+            const baseline = returns.reduce((a, b) => a + b, 0) / returns.length;
+            // Update policy for each step
+            for (let t = 0; t < episode.steps.length; t++) {
+                const step = episode.steps[t];
+                const advantage = returns[t] - baseline;
+                // Get or initialize policy weights for this action
+                const actionKey = step.action;
+                if (!this.policyWeights.has(actionKey)) {
+                    this.policyWeights.set(actionKey, [0]);
+                }
+                const weights = this.policyWeights.get(actionKey);
+                const gradient = advantage * this.policyConfig.learningRate;
+                weights[0] += gradient;
+                totalLoss += Math.abs(advantage);
+            }
+            episodeCount++;
+        }
+        // Update metrics
+        this.metrics.loss = totalLoss / Math.max(episodeCount, 1);
+        this.metrics.iterationCount++;
+        // Decay epsilon (exploration rate)
+        this.metrics.epsilon = Math.max(0.01, this.policyConfig.epsilon * 0.995);
+        this.policyConfig.epsilon = this.metrics.epsilon;
+        return this.metrics.loss;
+    }
+    /**
+     * Estimate value function using TD learning
+     *
+     * @param state - State to estimate value for
+     * @param reward - Observed reward
+     * @param nextState - Next state
+     * @param config - Optional value function configuration
+     * @returns Estimated value
+     */
+    async estimateValue(state, reward, nextState, config) {
+        if (config) {
+            this.valueConfig = { ...this.valueConfig, ...config };
+        }
+        const stateKey = JSON.stringify(state);
+        const nextStateKey = JSON.stringify(nextState);
+        // Get or initialize value estimates
+        const currentValue = this.valueWeights.get(stateKey) || 0;
+        const nextValue = this.valueWeights.get(nextStateKey) || 0;
+        // TD error: δ = r + γV(s') - V(s)
+        const tdError = reward + this.valueConfig.gamma * nextValue - currentValue;
+        // Update value function: V(s) ← V(s) + α·δ
+        const newValue = currentValue + this.valueConfig.learningRate * tdError;
+        this.valueWeights.set(stateKey, newValue);
+        return newValue;
+    }
+    /**
+     * Add experience to replay buffer with priority sampling
+     *
+     * @param state - Current state
+     * @param action - Action taken
+     * @param reward - Reward received
+     * @param nextState - Resulting state
+     * @param priority - Experience priority (default: 1.0)
+     */
+    addExperience(state, action, reward, nextState, priority = 1.0) {
+        // Add to buffer
+        this.experienceBuffer.push({ state, action, reward, nextState, priority });
+        // Maintain buffer size
+        if (this.experienceBuffer.length > this.replayConfig.bufferSize) {
+            this.experienceBuffer.shift();
+        }
+    }
+    /**
+     * Sample batch from experience replay buffer with priority sampling
+     *
+     * @param batchSize - Optional batch size (default: from config)
+     * @returns Batch of experiences
+     */
+    sampleExperience(batchSize) {
+        const size = batchSize || this.replayConfig.batchSize;
+        if (this.experienceBuffer.length === 0) {
+            return [];
+        }
+        // Calculate probability distribution based on priorities
+        const totalPriority = this.experienceBuffer.reduce((sum, exp) => sum + Math.pow(exp.priority, this.replayConfig.priorityAlpha), 0);
+        const batch = [];
+        for (let i = 0; i < Math.min(size, this.experienceBuffer.length); i++) {
+            // Priority sampling
+            let rand = Math.random() * totalPriority;
+            let selectedExp = this.experienceBuffer[0];
+            for (const exp of this.experienceBuffer) {
+                rand -= Math.pow(exp.priority, this.replayConfig.priorityAlpha);
+                if (rand <= 0) {
+                    selectedExp = exp;
+                    break;
+                }
+            }
+            batch.push({
+                state: selectedExp.state,
+                action: selectedExp.action,
+                reward: selectedExp.reward,
+                nextState: selectedExp.nextState
+            });
+        }
+        return batch;
+    }
+    /**
+     * Multi-agent reinforcement learning coordination
+     *
+     * @param agentStates - Map of agent IDs to their states
+     * @param jointAction - Joint action taken by all agents
+     * @param jointReward - Shared reward
+     * @returns Individual rewards for each agent
+     */
+    async multiAgentLearn(agentStates, jointAction, jointReward) {
+        const individualRewards = new Map();
+        // Distribute reward based on contribution (simplified)
+        const numAgents = agentStates.size;
+        const baseReward = jointReward / numAgents;
+        for (const [agentId, state] of agentStates) {
+            const action = jointAction.get(agentId) || 'default';
+            // Calculate individual contribution
+            const contribution = this.calculateContribution(agentId, state, action);
+            const reward = baseReward * (0.5 + contribution * 0.5);
+            individualRewards.set(agentId, reward);
+            // Record for learning
+            await this.recordTrajectory(agentId, [{
+                    state,
+                    action,
+                    reward
+                }]);
+        }
+        return individualRewards;
+    }
+    /**
+     * Transfer learning: apply knowledge from source task to target task
+     *
+     * @param sourceAgent - Agent type to transfer from
+     * @param targetAgent - Agent type to transfer to
+     * @param transferRatio - How much knowledge to transfer (0-1)
+     * @returns Success indicator
+     */
+    async transferLearning(sourceAgent, targetAgent, transferRatio = 0.7) {
+        const sourcePatterns = await this.getPatterns(sourceAgent);
+        if (sourcePatterns.length === 0) {
+            return false;
+        }
+        // Transfer policy weights
+        for (const [actionKey, weights] of this.policyWeights) {
+            if (actionKey.startsWith(sourceAgent)) {
+                const targetKey = actionKey.replace(sourceAgent, targetAgent);
+                const targetWeights = this.policyWeights.get(targetKey) || [0];
+                // Blend weights
+                for (let i = 0; i < Math.min(weights.length, targetWeights.length); i++) {
+                    targetWeights[i] = transferRatio * weights[i] + (1 - transferRatio) * targetWeights[i];
+                }
+                this.policyWeights.set(targetKey, targetWeights);
+            }
+        }
+        // Transfer value estimates
+        for (const [stateKey, value] of this.valueWeights) {
+            const state = JSON.parse(stateKey);
+            if (state.agentType === sourceAgent) {
+                const targetState = { ...state, agentType: targetAgent };
+                const targetKey = JSON.stringify(targetState);
+                const targetValue = this.valueWeights.get(targetKey) || 0;
+                this.valueWeights.set(targetKey, transferRatio * value + (1 - transferRatio) * targetValue);
+            }
+        }
+        return true;
+    }
+    /**
+     * Continuous learning: update model with new experience
+     *
+     * @param state - Current state
+     * @param action - Action taken
+     * @param reward - Reward received
+     * @param nextState - Resulting state
+     * @returns Updated value estimate
+     */
+    async continuousLearn(state, action, reward, nextState) {
+        // Add to experience replay
+        const tdError = Math.abs(reward - (this.valueWeights.get(JSON.stringify(state)) || 0));
+        this.addExperience(state, action, reward, nextState, tdError + 1);
+        // Update value function
+        const value = await this.estimateValue(state, reward, nextState);
+        // Update policy if we have enough experiences
+        if (this.experienceBuffer.length >= this.replayConfig.batchSize) {
+            const batch = this.sampleExperience();
+            // Create mini-episode from batch
+            const miniEpisode = {
+                steps: batch.map(exp => ({
+                    state: exp.state,
+                    action: exp.action,
+                    reward: exp.reward
+                })),
+                reward: batch.reduce((sum, exp) => sum + exp.reward, 0) / batch.length
+            };
+            await this.trainPolicy([miniEpisode]);
+        }
+        // Update metrics
+        this.metrics.episodeReward += reward;
+        this.metrics.avgReward = (this.metrics.avgReward * this.metrics.iterationCount + reward) / (this.metrics.iterationCount + 1);
+        return value;
+    }
+    /**
+     * Get current RL metrics
+     */
+    getRLMetrics() {
+        return { ...this.metrics };
+    }
+    /**
+     * Reset RL state (for new training session)
+     */
+    resetRL() {
+        this.policyWeights.clear();
+        this.valueWeights.clear();
+        this.experienceBuffer = [];
+        this.metrics = {
+            episodeReward: 0,
+            avgReward: 0,
+            loss: 0,
+            epsilon: this.policyConfig.epsilon,
+            iterationCount: 0
+        };
+    }
+    /**
+     * Configure RL parameters
+     */
+    configureRL(config) {
+        if (config.policy) {
+            this.policyConfig = { ...this.policyConfig, ...config.policy };
+        }
+        if (config.value) {
+            this.valueConfig = { ...this.valueConfig, ...config.value };
+        }
+        if (config.replay) {
+            this.replayConfig = { ...this.replayConfig, ...config.replay };
+        }
+    }
+    /**
+     * Calculate agent contribution to joint reward (simplified)
+     */
+    calculateContribution(agentId, state, action) {
+        // Simple heuristic: higher value states = higher contribution
+        const stateKey = JSON.stringify(state);
+        const stateValue = this.valueWeights.get(stateKey) || 0;
+        // Normalize to [0, 1]
+        return Math.max(0, Math.min(1, (stateValue + 1) / 2));
+    }
+}
+//# sourceMappingURL=SonaTrajectoryService.js.map

package/dist/packages/agentdb/src/services/SonaTrajectoryService.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SonaTrajectoryService.js","sourceRoot":"","sources":["../../../../../../packages/agentdb/src/services/SonaTrajectoryService.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAoDH,MAAM,OAAO,qBAAqB;IACxB,IAAI,GAAQ,IAAI,CAAC;IACjB,SAAS,GAAY,KAAK,CAAC;IAC3B,UAAU,GAAoB,IAAI,CAAC;IACnC,YAAY,GAAoC,IAAI,GAAG,EAAE,CAAC;IAElE,oBAAoB;IACZ,YAAY,GAAyB;QAC3C,YAAY,EAAE,KAAK;QACnB,KAAK,EAAE,IAAI;QACX,OAAO,EAAE,GAAG;QACZ,YAAY,EAAE,IAAI;KACnB,CAAC;IACM,WAAW,GAAwB;QACzC,YAAY,EAAE,KAAK;QACnB,KAAK,EAAE,IAAI;QACX,MAAM,EAAE,IAAI;KACb,CAAC;IACM,YAAY,GAA2B;QAC7C,UAAU,EAAE,KAAK;QACjB,SAAS,EAAE,EAAE;QACb,aAAa,EAAE,GAAG;QAClB,YAAY,EAAE,GAAG;KAClB,CAAC;IACM,gBAAgB,GAA4F,EAAE,CAAC;IAC/G,OAAO,GAAc;QAC3B,aAAa,EAAE,CAAC;QAChB,SAAS,EAAE,CAAC;QACZ,IAAI,EAAE,CAAC;QACP,OAAO,EAAE,GAAG;QACZ,cAAc,EAAE,CAAC;KAClB,CAAC;IACM,aAAa,GAA0B,IAAI,GAAG,EAAE,CAAC;IACjD,YAAY,GAAwB,IAAI,GAAG,EAAE,CAAC;IAEtD;;;;;;;OAOG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,gBAAgB,CAAC,CAAC;YAC3C,MAAM,IAAI,GAAI,GAAW,CAAC,IAAI,IAAK,GAAW,CAAC,IAAI;gBACrC,GAAW,CAAC,OAAO,EAAE,IAAI,IAAK,GAAW,CAAC,OAAO,EAAE,IAAI;gBACvD,GAAW,CAAC,OAAO,CAAC;YAElC,IAAI,IAAI,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE,CAAC;gBACvC,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;gBACtB,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;gBAC3B,OAAO,CAAC,GAAG,CAAC,qDAAqD,CAAC,CAAC;gBACnE,OAAO,IAAI,CAAC;YACd,CAAC;iBAAM,IAAI,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC5C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;gBACjB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;gBACtB,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;gBAC3B,OAAO,CAAC,GAAG,CAAC,qDAAqD,CAAC,CAAC;gBACnE,OAAO,IAAI,CAAC;YACd,CAAC;YAED,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;OAEG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,gBAAgB,CAAC,SAAiB,EAAE,KAAuB;QAC/D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAE/B,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAE/E,2BAA2B;QAC3B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,CAAC;gBACH,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,UAAU,EAAE,CAAC;wBAC/C,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBACnC,CAAC;yBAAM,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;wBAClD,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC/B,CAAC;yBAAM,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;wBACnD,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;oBAChE,CAAC;gBACH,CAAC;gBACD,gDAAgD;YAClD,CAAC;YAAC,MAAM,CAAC;gBACP,oCAAoC;YACtC,CAAC;QACH,CAAC;QAED,2DAA2D;QAC3D,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QACvC,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;IACzE,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,OAAO,CAAC,KAAU;QACtB,2BAA2B;QAC3B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,CAAC;gBACH,IAAI,MAAW,CAAC;gBAChB,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;oBAC5C,MAAM,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC1C,CAAC;qBAAM,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,YAAY,KAAK,UAAU,EAAE,CAAC;oBACxD,MAAM,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBAC/C,CAAC;gBAED,IAAI,MAAM,EAAE,CAAC;oBACX,OAAO;wBACL,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC;wBACtD,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,WAAW,IAAI,GAAG;qBAC3D,CAAC;gBACJ,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,6CAA6C;YAC/C,CAAC;QACH,CAAC;QAED,4EAA4E;QAC5E,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC;IACjC,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,WAAW,CAAC,SAAkB;QAClC,2BAA2B;QAC3B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,CAAC;gBACH,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,YAAY,KAAK,UAAU,EAAE,CAAC;oBACjD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;oBAChD,IAAI,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC/D,OAAO,QAAQ,CAAC;oBAClB,CAAC;gBACH,CAAC;qBAAM,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,KAAK,UAAU,EAAE,CAAC;oBACvD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;oBAC/C,IAAI,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC/D,OAAO,QAAQ,CAAC;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,yCAAyC;YAC3C,CAAC;QACH,CAAC;QAED,IAAI,SAAS,EAAE,CAAC;YACd,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QAChD,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACvD,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,eAAe,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;iBACpD,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YAC5C,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;SACjD,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAkB;QACtB,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC5B,CAAC;IACH,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkD,CAAC;QAE/E,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;YACtD,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;gBAChC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC9B,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;oBAC5E,KAAK,CAAC,KAAK,EAAE,CAAC;oBACd,KAAK,CAAC,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC;oBACjC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;QAChD,CAAC;QAED,0CAA0C;QAC1C,IAAI,UAAU,GAAG,SAAS,CAAC;QAC3B,IAAI,aAAa,GAAG,CAAC,QAAQ,CAAC;QAC9B,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,YAAY,EAAE,CAAC;YAC3C,YAAY,IAAI,KAAK,CAAC,KAAK,CAAC;YAC5B,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC;YAClD,IAAI,SAAS,GAAG,aAAa,EAAE,CAAC;gBAC9B,aAAa,GAAG,SAAS,CAAC;gBAC1B,UAAU,GAAG,MAAM,CAAC;YACtB,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;QAC3D,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC;QAEzE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC;IAC5C,CAAC;IAED,gEAAgE;IAEhE;;;;;;OAMG;IACH,KAAK,CAAC,WAAW,CAAC,QAA4B,EAAE,MAAsC;QACpF,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,CAAC,YAAY,GAAG,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,MAAM,EAAE,CAAC;QAC1D,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;YAEV,gCAAgC;YAChC,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnD,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,GAAG,CAAC,CAAC;gBAC1D,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;YAED,sCAAsC;YACtC,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;YAErE,8BAA8B;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC9B,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;gBAExC,mDAAmD;gBACnD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBACvC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,CAAC;gBAED,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;gBACnD,MAAM,QAAQ,GAAG,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC;gBAC5D,OAAO,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC;gBAEvB,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnC,CAAC;YAED,YAAY,EAAE,CAAC;QACjB,CAAC;QAED,iBAAiB;QACjB,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC;QAE9B,mCAAmC;QACnC,IAAI,CAAC,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC;QACzE,IAAI,CAAC,YAAY,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;QAEjD,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,aAAa,CAAC,KAAU,EAAE,MAAc,EAAE,SAAc,EAAE,MAAqC;QACnG,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,CAAC,WAAW,GAAG,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,MAAM,EAAE,CAAC;QACxD,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QAE/C,oCAAoC;QACpC,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAE3D,kCAAkC;QAClC,MAAM,OAAO,GAAG,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,SAAS,GAAG,YAAY,CAAC;QAE3E,2CAA2C;QAC3C,MAAM,QAAQ,GAAG,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,YAAY,GAAG,OAAO,CAAC;QACxE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAE1C,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;;;OAQG;IACH,aAAa,CAAC,KAAU,EAAE,MAAc,EAAE,MAAc,EAAE,SAAc,EAAE,WAAmB,GAAG;QAC9F,gBAAgB;QAChB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC;QAE3E,uBAAuB;QACvB,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC;YAChE,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAChC,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,gBAAgB,CAAC,SAAkB;QACjC,MAAM,IAAI,GAAG,SAAS,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC;QAEtD,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvC,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,yDAAyD;QACzD,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;QAEnI,MAAM,KAAK,GAA0E,EAAE,CAAC;QAExF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACtE,oBAAoB;YACpB,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,aAAa,CAAC;YACzC,IAAI,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YAE3C,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;gBAChE,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;oBACd,WAAW,GAAG,GAAG,CAAC;oBAClB,MAAM;gBACR,CAAC;YACH,CAAC;YAED,KAAK,CAAC,IAAI,CAAC;gBACT,KAAK,EAAE,WAAW,CAAC,KAAK;gBACxB,MAAM,EAAE,WAAW,CAAC,MAAM;gBAC1B,MAAM,EAAE,WAAW,CAAC,MAAM;gBAC1B,SAAS,EAAE,WAAW,CAAC,SAAS;aACjC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,eAAe,CACnB,WAA6B,EAC7B,WAAgC,EAChC,WAAmB;QAEnB,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEpD,uDAAuD;QACvD,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC;QACnC,MAAM,UAAU,GAAG,WAAW,GAAG,SAAS,CAAC;QAE3C,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,SAAS,CAAC;YAErD,oCAAoC;YACpC,MAAM,YAAY,GAAG,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;YACxE,MAAM,MAAM,GAAG,UAAU,GAAG,CAAC,GAAG,GAAG,YAAY,GAAG,GAAG,CAAC,CAAC;YAEvD,iBAAiB,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAEvC,sBAAsB;YACtB,MAAM,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,CAAC;oBACpC,KAAK;oBACL,MAAM;oBACN,MAAM;iBACP,CAAC,CAAC,CAAC;QACN,CAAC;QAED,OAAO,iBAAiB,CAAC;IAC3B,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,gBAAgB,CAAC,WAAmB,EAAE,WAAmB,EAAE,gBAAwB,GAAG;QAC1F,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;QAE3D,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,0BAA0B;QAC1B,KAAK,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACtD,IAAI,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC;gBACtC,MAAM,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;gBAC9D,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAE/D,gBAAgB;gBAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBACxE,aAAa,CAAC,CAAC,CAAC,GAAG,aAAa,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;gBACzF,CAAC;gBAED,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAClD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACnC,IAAI,KAAK,CAAC,SAAS,KAAK,WAAW,EAAE,CAAC;gBACpC,MAAM,WAAW,GAAG,EAAE,GAAG,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;gBACzD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;gBAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBAE1D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,aAAa,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,WAAW,CAAC,CAAC;YAC9F,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,eAAe,CAAC,KAAU,EAAE,MAAc,EAAE,MAAc,EAAE,SAAc;QAC9E,2BAA2B;QAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvF,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;QAElE,wBAAwB;QACxB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QAEjE,8CAA8C;QAC9C,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC;YAChE,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAEtC,iCAAiC;YACjC,MAAM,WAAW,GAAqB;gBACpC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACvB,KAAK,EAAE,GAAG,CAAC,KAAK;oBAChB,MAAM,EAAE,GAAG,CAAC,MAAM;oBAClB,MAAM,EAAE,GAAG,CAAC,MAAM;iBACnB,CAAC,CAAC;gBACH,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM;aACvE,CAAC;YAEF,MAAM,IAAI,CAAC,WAAW,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QACxC,CAAC;QAED,iBAAiB;QACjB,IAAI,CAAC,OAAO,CAAC,aAAa,IAAI,MAAM,CAAC;QACrC,IAAI,CAAC,OAAO,CAAC,SAAS,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;QAE7H,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,YAAY;QACV,OAAO,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,OAAO;QACL,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;QAC3B,IAAI,CAAC,OAAO,GAAG;YACb,aAAa,EAAE,CAAC;YAChB,SAAS,EAAE,CAAC;YACZ,IAAI,EAAE,CAAC;YACP,OAAO,EAAE,IAAI,CAAC,YAAY,CAAC,OAAO;YAClC,cAAc,EAAE,CAAC;SAClB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,MAIX;QACC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAClB,IAAI,CAAC,YAAY,GAAG,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QACjE,CAAC;QACD,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YACjB,IAAI,CAAC,WAAW,GAAG,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QAC9D,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAClB,IAAI,CAAC,YAAY,GAAG,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QACjE,CAAC;IACH,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,OAAe,EAAE,KAAU,EAAE,MAAc;QACvE,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAExD,sBAAsB;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;CACF","sourcesContent":["/**\n * SonaTrajectoryService - Wraps @ruvector/sona for trajectory learning\n *\n * Provides trajectory recording and action prediction for agent learning.\n * Uses @ruvector/sona for reinforcement learning when available,\n * otherwise falls back to in-memory trajectory storage with simple\n * frequency-based prediction.\n *\n * Usage:\n *   const sona = new SonaTrajectoryService();\n *   await sona.initialize();\n *\n *   // Record agent trajectories\n *   await sona.recordTrajectory('coder', [\n *     { state: { task: 'implement' }, action: 'write_code', reward: 0.8 },\n *     { state: { task: 'test' }, action: 'run_tests', reward: 0.9 }\n *   ]);\n *\n *   // Predict next action\n *   const prediction = await sona.predict({ task: 'implement' });\n */\n\nexport interface TrajectoryStep {\n  state: any;\n  action: string;\n  reward: number;\n}\n\nexport interface StoredTrajectory {\n  steps: TrajectoryStep[];\n  reward: number;\n}\n\nexport interface PredictionResult {\n  action: string;\n  confidence: number;\n}\n\nexport interface SonaStats {\n  available: boolean;\n  trajectoryCount: number;\n  agentTypes: string[];\n}\n\nexport interface PolicyGradientConfig {\n  learningRate: number;\n  gamma: number; // discount factor\n  epsilon: number; // exploration rate\n  entropyCoeff: number; // entropy regularization\n}\n\nexport interface ValueFunctionConfig {\n  learningRate: number;\n  gamma: number;\n  lambda: number; // GAE parameter\n}\n\nexport interface ExperienceReplayConfig {\n  bufferSize: number;\n  batchSize: number;\n  priorityAlpha: number;\n  priorityBeta: number;\n}\n\nexport interface RLMetrics {\n  episodeReward: number;\n  avgReward: number;\n  loss: number;\n  epsilon: number;\n  iterationCount: number;\n}\n\nexport class SonaTrajectoryService {\n  private sona: any = null;\n  private available: boolean = false;\n  private engineType: 'native' | 'js' = 'js';\n  private trajectories: Map<string, StoredTrajectory[]> = new Map();\n\n  // RL Training state\n  private policyConfig: PolicyGradientConfig = {\n    learningRate: 0.001,\n    gamma: 0.99,\n    epsilon: 0.1,\n    entropyCoeff: 0.01\n  };\n  private valueConfig: ValueFunctionConfig = {\n    learningRate: 0.001,\n    gamma: 0.99,\n    lambda: 0.95\n  };\n  private replayConfig: ExperienceReplayConfig = {\n    bufferSize: 10000,\n    batchSize: 32,\n    priorityAlpha: 0.6,\n    priorityBeta: 0.4\n  };\n  private experienceBuffer: Array<{ state: any; action: string; reward: number; nextState: any; priority: number }> = [];\n  private metrics: RLMetrics = {\n    episodeReward: 0,\n    avgReward: 0,\n    loss: 0,\n    epsilon: 0.1,\n    iterationCount: 0\n  };\n  private policyWeights: Map<string, number[]> = new Map();\n  private valueWeights: Map<string, number> = new Map();\n\n  /**\n   * Initialize the trajectory service\n   *\n   * ADR-062 Phase 2: Tries native @ruvector/sona (NAPI-RS) first,\n   * falls back to in-memory trajectory storage. Reports engine type.\n   *\n   * @returns true if @ruvector/sona was loaded, false if using fallback\n   */\n  async initialize(): Promise<boolean> {\n    try {\n      const mod = await import('@ruvector/sona');\n      const SONA = (mod as any).SONA || (mod as any).Sona ||\n                   (mod as any).default?.SONA || (mod as any).default?.Sona ||\n                   (mod as any).default;\n\n      if (SONA && typeof SONA === 'function') {\n        this.sona = new SONA();\n        this.available = true;\n        this.engineType = 'native';\n        console.log('[SonaTrajectoryService] Using native @ruvector/sona');\n        return true;\n      } else if (SONA && typeof SONA === 'object') {\n        this.sona = SONA;\n        this.available = true;\n        this.engineType = 'native';\n        console.log('[SonaTrajectoryService] Using native @ruvector/sona');\n        return true;\n      }\n\n      this.available = false;\n      this.engineType = 'js';\n      return false;\n    } catch {\n      this.available = false;\n      this.engineType = 'js';\n      return false;\n    }\n  }\n\n  /**\n   * Get the active engine type: 'native' or 'js'\n   */\n  getEngineType(): string {\n    return this.engineType;\n  }\n\n  /**\n   * Record a trajectory for an agent type\n   *\n   * When @ruvector/sona is available, steps are forwarded to the RL engine.\n   * Otherwise, trajectories are stored in memory for pattern analysis.\n   *\n   * @param agentType - Type of agent (e.g., 'coder', 'reviewer')\n   * @param steps - Sequence of state-action-reward tuples\n   */\n  async recordTrajectory(agentType: string, steps: TrajectoryStep[]): Promise<void> {\n    if (steps.length === 0) return;\n\n    const totalReward = steps.reduce((sum, s) => sum + s.reward, 0) / steps.length;\n\n    // Try @ruvector/sona first\n    if (this.sona) {\n      try {\n        for (const step of steps) {\n          if (typeof this.sona.recordStep === 'function') {\n            await this.sona.recordStep(step);\n          } else if (typeof this.sona.record === 'function') {\n            await this.sona.record(step);\n          } else if (typeof this.sona.addStep === 'function') {\n            await this.sona.addStep(step.state, step.action, step.reward);\n          }\n        }\n        // Also store in-memory for local pattern access\n      } catch {\n        // Fall through to in-memory storage\n      }\n    }\n\n    // In-memory storage (always maintained for local analysis)\n    if (!this.trajectories.has(agentType)) {\n      this.trajectories.set(agentType, []);\n    }\n    this.trajectories.get(agentType)!.push({ steps, reward: totalReward });\n  }\n\n  /**\n   * Predict the next action given a state\n   *\n   * When @ruvector/sona is available, uses the RL model for prediction.\n   * Otherwise, uses frequency-based prediction from stored trajectories.\n   *\n   * @param state - Current state to predict action for\n   * @returns Predicted action and confidence score\n   */\n  async predict(state: any): Promise<PredictionResult> {\n    // Try @ruvector/sona first\n    if (this.sona) {\n      try {\n        let result: any;\n        if (typeof this.sona.predict === 'function') {\n          result = await this.sona.predict(state);\n        } else if (typeof this.sona.selectAction === 'function') {\n          result = await this.sona.selectAction(state);\n        }\n\n        if (result) {\n          return {\n            action: result.action || result.name || String(result),\n            confidence: result.confidence || result.probability || 0.8\n          };\n        }\n      } catch {\n        // Fall through to frequency-based prediction\n      }\n    }\n\n    // Frequency-based fallback: find the most common action across trajectories\n    return this.frequencyPredict();\n  }\n\n  /**\n   * Get trajectory patterns, optionally filtered by agent type\n   *\n   * When @ruvector/sona is available, queries the RL engine for patterns.\n   * Otherwise, returns stored trajectories.\n   *\n   * @param agentType - Optional agent type filter\n   * @returns Array of trajectory patterns\n   */\n  async getPatterns(agentType?: string): Promise<StoredTrajectory[]> {\n    // Try @ruvector/sona first\n    if (this.sona) {\n      try {\n        if (typeof this.sona.findPatterns === 'function') {\n          const patterns = await this.sona.findPatterns();\n          if (patterns && Array.isArray(patterns) && patterns.length > 0) {\n            return patterns;\n          }\n        } else if (typeof this.sona.getPatterns === 'function') {\n          const patterns = await this.sona.getPatterns();\n          if (patterns && Array.isArray(patterns) && patterns.length > 0) {\n            return patterns;\n          }\n        }\n      } catch {\n        // Fall through to in-memory trajectories\n      }\n    }\n\n    if (agentType) {\n      return this.trajectories.get(agentType) || [];\n    }\n    return Array.from(this.trajectories.values()).flat();\n  }\n\n  /**\n   * Check if @ruvector/sona is available\n   */\n  isAvailable(): boolean {\n    return this.available;\n  }\n\n  /**\n   * Get service statistics\n   */\n  getStats(): SonaStats {\n    return {\n      available: this.available,\n      trajectoryCount: Array.from(this.trajectories.values())\n        .reduce((sum, arr) => sum + arr.length, 0),\n      agentTypes: Array.from(this.trajectories.keys())\n    };\n  }\n\n  /**\n   * Clear all stored trajectories for an agent type, or all if not specified\n   */\n  clear(agentType?: string): void {\n    if (agentType) {\n      this.trajectories.delete(agentType);\n    } else {\n      this.trajectories.clear();\n    }\n  }\n\n  /**\n   * Frequency-based action prediction from stored trajectories\n   */\n  private frequencyPredict(): PredictionResult {\n    const actionCounts = new Map<string, { count: number; totalReward: number }>();\n\n    for (const trajectories of this.trajectories.values()) {\n      for (const traj of trajectories) {\n        for (const step of traj.steps) {\n          const entry = actionCounts.get(step.action) || { count: 0, totalReward: 0 };\n          entry.count++;\n          entry.totalReward += step.reward;\n          actionCounts.set(step.action, entry);\n        }\n      }\n    }\n\n    if (actionCounts.size === 0) {\n      return { action: 'default', confidence: 0.5 };\n    }\n\n    // Find action with highest average reward\n    let bestAction = 'default';\n    let bestAvgReward = -Infinity;\n    let totalActions = 0;\n\n    for (const [action, entry] of actionCounts) {\n      totalActions += entry.count;\n      const avgReward = entry.totalReward / entry.count;\n      if (avgReward > bestAvgReward) {\n        bestAvgReward = avgReward;\n        bestAction = action;\n      }\n    }\n\n    // Confidence based on the proportion of observations\n    const bestCount = actionCounts.get(bestAction)?.count || 0;\n    const confidence = Math.min(0.95, bestCount / Math.max(totalActions, 1));\n\n    return { action: bestAction, confidence };\n  }\n\n  // ==================== RL Training Methods ====================\n\n  /**\n   * Train policy using Policy Gradient (REINFORCE with baseline)\n   *\n   * @param episodes - Array of trajectories to learn from\n   * @param config - Optional policy gradient configuration\n   * @returns Training loss\n   */\n  async trainPolicy(episodes: StoredTrajectory[], config?: Partial<PolicyGradientConfig>): Promise<number> {\n    if (config) {\n      this.policyConfig = { ...this.policyConfig, ...config };\n    }\n\n    let totalLoss = 0;\n    let episodeCount = 0;\n\n    for (const episode of episodes) {\n      const returns: number[] = [];\n      let G = 0;\n\n      // Calculate returns (backwards)\n      for (let t = episode.steps.length - 1; t >= 0; t--) {\n        G = episode.steps[t].reward + this.policyConfig.gamma * G;\n        returns.unshift(G);\n      }\n\n      // Calculate baseline (average return)\n      const baseline = returns.reduce((a, b) => a + b, 0) / returns.length;\n\n      // Update policy for each step\n      for (let t = 0; t < episode.steps.length; t++) {\n        const step = episode.steps[t];\n        const advantage = returns[t] - baseline;\n\n        // Get or initialize policy weights for this action\n        const actionKey = step.action;\n        if (!this.policyWeights.has(actionKey)) {\n          this.policyWeights.set(actionKey, [0]);\n        }\n\n        const weights = this.policyWeights.get(actionKey)!;\n        const gradient = advantage * this.policyConfig.learningRate;\n        weights[0] += gradient;\n\n        totalLoss += Math.abs(advantage);\n      }\n\n      episodeCount++;\n    }\n\n    // Update metrics\n    this.metrics.loss = totalLoss / Math.max(episodeCount, 1);\n    this.metrics.iterationCount++;\n\n    // Decay epsilon (exploration rate)\n    this.metrics.epsilon = Math.max(0.01, this.policyConfig.epsilon * 0.995);\n    this.policyConfig.epsilon = this.metrics.epsilon;\n\n    return this.metrics.loss;\n  }\n\n  /**\n   * Estimate value function using TD learning\n   *\n   * @param state - State to estimate value for\n   * @param reward - Observed reward\n   * @param nextState - Next state\n   * @param config - Optional value function configuration\n   * @returns Estimated value\n   */\n  async estimateValue(state: any, reward: number, nextState: any, config?: Partial<ValueFunctionConfig>): Promise<number> {\n    if (config) {\n      this.valueConfig = { ...this.valueConfig, ...config };\n    }\n\n    const stateKey = JSON.stringify(state);\n    const nextStateKey = JSON.stringify(nextState);\n\n    // Get or initialize value estimates\n    const currentValue = this.valueWeights.get(stateKey) || 0;\n    const nextValue = this.valueWeights.get(nextStateKey) || 0;\n\n    // TD error: δ = r + γV(s') - V(s)\n    const tdError = reward + this.valueConfig.gamma * nextValue - currentValue;\n\n    // Update value function: V(s) ← V(s) + α·δ\n    const newValue = currentValue + this.valueConfig.learningRate * tdError;\n    this.valueWeights.set(stateKey, newValue);\n\n    return newValue;\n  }\n\n  /**\n   * Add experience to replay buffer with priority sampling\n   *\n   * @param state - Current state\n   * @param action - Action taken\n   * @param reward - Reward received\n   * @param nextState - Resulting state\n   * @param priority - Experience priority (default: 1.0)\n   */\n  addExperience(state: any, action: string, reward: number, nextState: any, priority: number = 1.0): void {\n    // Add to buffer\n    this.experienceBuffer.push({ state, action, reward, nextState, priority });\n\n    // Maintain buffer size\n    if (this.experienceBuffer.length > this.replayConfig.bufferSize) {\n      this.experienceBuffer.shift();\n    }\n  }\n\n  /**\n   * Sample batch from experience replay buffer with priority sampling\n   *\n   * @param batchSize - Optional batch size (default: from config)\n   * @returns Batch of experiences\n   */\n  sampleExperience(batchSize?: number): Array<{ state: any; action: string; reward: number; nextState: any }> {\n    const size = batchSize || this.replayConfig.batchSize;\n\n    if (this.experienceBuffer.length === 0) {\n      return [];\n    }\n\n    // Calculate probability distribution based on priorities\n    const totalPriority = this.experienceBuffer.reduce((sum, exp) => sum + Math.pow(exp.priority, this.replayConfig.priorityAlpha), 0);\n\n    const batch: Array<{ state: any; action: string; reward: number; nextState: any }> = [];\n\n    for (let i = 0; i < Math.min(size, this.experienceBuffer.length); i++) {\n      // Priority sampling\n      let rand = Math.random() * totalPriority;\n      let selectedExp = this.experienceBuffer[0];\n\n      for (const exp of this.experienceBuffer) {\n        rand -= Math.pow(exp.priority, this.replayConfig.priorityAlpha);\n        if (rand <= 0) {\n          selectedExp = exp;\n          break;\n        }\n      }\n\n      batch.push({\n        state: selectedExp.state,\n        action: selectedExp.action,\n        reward: selectedExp.reward,\n        nextState: selectedExp.nextState\n      });\n    }\n\n    return batch;\n  }\n\n  /**\n   * Multi-agent reinforcement learning coordination\n   *\n   * @param agentStates - Map of agent IDs to their states\n   * @param jointAction - Joint action taken by all agents\n   * @param jointReward - Shared reward\n   * @returns Individual rewards for each agent\n   */\n  async multiAgentLearn(\n    agentStates: Map<string, any>,\n    jointAction: Map<string, string>,\n    jointReward: number\n  ): Promise<Map<string, number>> {\n    const individualRewards = new Map<string, number>();\n\n    // Distribute reward based on contribution (simplified)\n    const numAgents = agentStates.size;\n    const baseReward = jointReward / numAgents;\n\n    for (const [agentId, state] of agentStates) {\n      const action = jointAction.get(agentId) || 'default';\n\n      // Calculate individual contribution\n      const contribution = this.calculateContribution(agentId, state, action);\n      const reward = baseReward * (0.5 + contribution * 0.5);\n\n      individualRewards.set(agentId, reward);\n\n      // Record for learning\n      await this.recordTrajectory(agentId, [{\n        state,\n        action,\n        reward\n      }]);\n    }\n\n    return individualRewards;\n  }\n\n  /**\n   * Transfer learning: apply knowledge from source task to target task\n   *\n   * @param sourceAgent - Agent type to transfer from\n   * @param targetAgent - Agent type to transfer to\n   * @param transferRatio - How much knowledge to transfer (0-1)\n   * @returns Success indicator\n   */\n  async transferLearning(sourceAgent: string, targetAgent: string, transferRatio: number = 0.7): Promise<boolean> {\n    const sourcePatterns = await this.getPatterns(sourceAgent);\n\n    if (sourcePatterns.length === 0) {\n      return false;\n    }\n\n    // Transfer policy weights\n    for (const [actionKey, weights] of this.policyWeights) {\n      if (actionKey.startsWith(sourceAgent)) {\n        const targetKey = actionKey.replace(sourceAgent, targetAgent);\n        const targetWeights = this.policyWeights.get(targetKey) || [0];\n\n        // Blend weights\n        for (let i = 0; i < Math.min(weights.length, targetWeights.length); i++) {\n          targetWeights[i] = transferRatio * weights[i] + (1 - transferRatio) * targetWeights[i];\n        }\n\n        this.policyWeights.set(targetKey, targetWeights);\n      }\n    }\n\n    // Transfer value estimates\n    for (const [stateKey, value] of this.valueWeights) {\n      const state = JSON.parse(stateKey);\n      if (state.agentType === sourceAgent) {\n        const targetState = { ...state, agentType: targetAgent };\n        const targetKey = JSON.stringify(targetState);\n        const targetValue = this.valueWeights.get(targetKey) || 0;\n\n        this.valueWeights.set(targetKey, transferRatio * value + (1 - transferRatio) * targetValue);\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   * Continuous learning: update model with new experience\n   *\n   * @param state - Current state\n   * @param action - Action taken\n   * @param reward - Reward received\n   * @param nextState - Resulting state\n   * @returns Updated value estimate\n   */\n  async continuousLearn(state: any, action: string, reward: number, nextState: any): Promise<number> {\n    // Add to experience replay\n    const tdError = Math.abs(reward - (this.valueWeights.get(JSON.stringify(state)) || 0));\n    this.addExperience(state, action, reward, nextState, tdError + 1);\n\n    // Update value function\n    const value = await this.estimateValue(state, reward, nextState);\n\n    // Update policy if we have enough experiences\n    if (this.experienceBuffer.length >= this.replayConfig.batchSize) {\n      const batch = this.sampleExperience();\n\n      // Create mini-episode from batch\n      const miniEpisode: StoredTrajectory = {\n        steps: batch.map(exp => ({\n          state: exp.state,\n          action: exp.action,\n          reward: exp.reward\n        })),\n        reward: batch.reduce((sum, exp) => sum + exp.reward, 0) / batch.length\n      };\n\n      await this.trainPolicy([miniEpisode]);\n    }\n\n    // Update metrics\n    this.metrics.episodeReward += reward;\n    this.metrics.avgReward = (this.metrics.avgReward * this.metrics.iterationCount + reward) / (this.metrics.iterationCount + 1);\n\n    return value;\n  }\n\n  /**\n   * Get current RL metrics\n   */\n  getRLMetrics(): RLMetrics {\n    return { ...this.metrics };\n  }\n\n  /**\n   * Reset RL state (for new training session)\n   */\n  resetRL(): void {\n    this.policyWeights.clear();\n    this.valueWeights.clear();\n    this.experienceBuffer = [];\n    this.metrics = {\n      episodeReward: 0,\n      avgReward: 0,\n      loss: 0,\n      epsilon: this.policyConfig.epsilon,\n      iterationCount: 0\n    };\n  }\n\n  /**\n   * Configure RL parameters\n   */\n  configureRL(config: {\n    policy?: Partial<PolicyGradientConfig>;\n    value?: Partial<ValueFunctionConfig>;\n    replay?: Partial<ExperienceReplayConfig>;\n  }): void {\n    if (config.policy) {\n      this.policyConfig = { ...this.policyConfig, ...config.policy };\n    }\n    if (config.value) {\n      this.valueConfig = { ...this.valueConfig, ...config.value };\n    }\n    if (config.replay) {\n      this.replayConfig = { ...this.replayConfig, ...config.replay };\n    }\n  }\n\n  /**\n   * Calculate agent contribution to joint reward (simplified)\n   */\n  private calculateContribution(agentId: string, state: any, action: string): number {\n    // Simple heuristic: higher value states = higher contribution\n    const stateKey = JSON.stringify(state);\n    const stateValue = this.valueWeights.get(stateKey) || 0;\n\n    // Normalize to [0, 1]\n    return Math.max(0, Math.min(1, (stateValue + 1) / 2));\n  }\n}\n"]}