@stackmemoryai/stackmemory 0.5.59 → 0.5.61

package/dist/integrations/ralph/coordination/enhanced-coordination.js

@@ -1,410 +0,0 @@
-import { fileURLToPath as __fileURLToPath } from 'url';
-import { dirname as __pathDirname } from 'path';
-const __filename = __fileURLToPath(import.meta.url);
-const __dirname = __pathDirname(__filename);
-import { EventEmitter } from "events";
-import { logger } from "../../../core/monitoring/logger.js";
-class EnhancedCoordinationSystem extends EventEmitter {
-  agents = /* @__PURE__ */ new Map();
-  messageQueue = [];
-  dependencies = /* @__PURE__ */ new Map();
-  conflicts = /* @__PURE__ */ new Map();
-  coordinationRules = [];
-  constructor() {
-    super();
-    this.setupDefaultRules();
-  }
-  /**
-   * Register an agent with the coordination system
-   */
-  registerAgent(agent) {
-    this.agents.set(agent.id, agent);
-    logger.info(`Agent ${agent.role} registered for coordination`);
-    this.broadcastMessage({
-      id: this.generateId(),
-      from: "system",
-      to: "broadcast",
-      type: "status_update",
-      content: { type: "agent_joined", agent: agent.role },
-      timestamp: Date.now(),
-      priority: "normal"
-    });
-  }
-  /**
-   * Send message between agents
-   */
-  sendMessage(message) {
-    const fullMessage = {
-      ...message,
-      id: this.generateId(),
-      timestamp: Date.now()
-    };
-    this.messageQueue.push(fullMessage);
-    this.routeMessage(fullMessage);
-    this.emit("messageReceived", fullMessage);
-  }
-  /**
-   * Broadcast message to all agents
-   */
-  broadcastMessage(message) {
-    this.sendMessage({
-      ...message,
-      to: "broadcast"
-    });
-  }
-  /**
-   * Request help from other agents
-   */
-  requestHelp(fromAgent, helpType, context) {
-    const suitableAgents = this.findSuitableHelpers(helpType);
-    this.sendMessage({
-      from: fromAgent,
-      to: suitableAgents,
-      type: "help_request",
-      content: {
-        helpType,
-        context,
-        requesterCapabilities: this.agents.get(fromAgent)?.capabilities || []
-      },
-      priority: "high"
-    });
-  }
-  /**
-   * Add task dependency
-   */
-  addDependency(dependency) {
-    this.dependencies.set(dependency.taskId, dependency);
-    this.updateCriticalPath();
-    logger.info(
-      `Added dependency: ${dependency.taskId} depends on ${dependency.dependsOn.join(", ")}`
-    );
-  }
-  /**
-   * Resolve conflicts automatically
-   */
-  async resolveConflict(conflictId) {
-    const conflict = this.conflicts.get(conflictId);
-    if (!conflict) return false;
-    try {
-      switch (conflict.resolutionStrategy) {
-        case "voting":
-          conflict.resolution = await this.resolveByVoting(conflict);
-          break;
-        case "expertise_based":
-          conflict.resolution = await this.resolveByExpertise(conflict);
-          break;
-        case "random":
-          conflict.resolution = await this.resolveRandomly(conflict);
-          break;
-        case "manager_override":
-          conflict.resolution = await this.resolveByManagerOverride(conflict);
-          break;
-      }
-      conflict.status = "resolved";
-      this.conflicts.set(conflictId, conflict);
-      this.broadcastMessage({
-        from: "system",
-        to: conflict.involvedAgents,
-        type: "status_update",
-        content: {
-          type: "conflict_resolved",
-          conflictId,
-          resolution: conflict.resolution
-        },
-        priority: "high"
-      });
-      return true;
-    } catch (error) {
-      conflict.status = "escalated";
-      logger.error(`Failed to resolve conflict ${conflictId}:`, error);
-      return false;
-    }
-  }
-  /**
-   * Get optimal task execution order considering dependencies
-   */
-  getOptimalExecutionOrder(tasks) {
-    const graph = this.buildDependencyGraph(tasks);
-    return this.topologicalSort(graph, tasks);
-  }
-  /**
-   * Detect and report coordination patterns
-   */
-  analyzeCoordinationPatterns() {
-    const patterns = {
-      communicationFrequency: /* @__PURE__ */ new Map(),
-      helpRequestPatterns: [],
-      conflictFrequency: /* @__PURE__ */ new Map(),
-      bottlenecks: this.identifyBottlenecks()
-    };
-    for (const message of this.messageQueue) {
-      const key = `${message.from}-${message.type}`;
-      patterns.communicationFrequency.set(
-        key,
-        (patterns.communicationFrequency.get(key) || 0) + 1
-      );
-    }
-    for (const conflict of this.conflicts.values()) {
-      patterns.conflictFrequency.set(
-        conflict.type,
-        (patterns.conflictFrequency.get(conflict.type) || 0) + 1
-      );
-    }
-    return patterns;
-  }
-  /**
-   * Load balancing recommendations
-   */
-  getLoadBalancingRecommendations() {
-    const recommendations = {
-      overloadedAgents: [],
-      underutilizedAgents: [],
-      suggestedReassignments: []
-    };
-    for (const agent of this.agents.values()) {
-      const workload = this.calculateAgentWorkload(agent);
-      if (workload > 0.8) {
-        recommendations.overloadedAgents.push(agent.id);
-      } else if (workload < 0.3) {
-        recommendations.underutilizedAgents.push(agent.id);
-      }
-    }
-    for (const overloaded of recommendations.overloadedAgents) {
-      for (const underutilized of recommendations.underutilizedAgents) {
-        const compatibility = this.checkAgentCompatibility(
-          overloaded,
-          underutilized
-        );
-        if (compatibility.score > 0.7) {
-          recommendations.suggestedReassignments.push({
-            fromAgent: overloaded,
-            toAgent: underutilized,
-            taskType: compatibility.bestTaskType,
-            reason: `Load balancing: ${compatibility.reason}`
-          });
-        }
-      }
-    }
-    return recommendations;
-  }
-  routeMessage(message) {
-    if (message.to === "broadcast") {
-      for (const agentId of this.agents.keys()) {
-        if (agentId !== message.from) {
-          this.deliverMessage(agentId, message);
-        }
-      }
-    } else {
-      for (const agentId of message.to) {
-        this.deliverMessage(agentId, message);
-      }
-    }
-    this.applyCoordinationRules(message);
-  }
-  deliverMessage(agentId, message) {
-    const agent = this.agents.get(agentId);
-    if (agent) {
-      logger.debug(`Message delivered to ${agent.role}: ${message.type}`);
-    }
-  }
-  findSuitableHelpers(helpType) {
-    const helpers = [];
-    for (const agent of this.agents.values()) {
-      if (this.canProvideHelp(agent, helpType)) {
-        helpers.push(agent.id);
-      }
-    }
-    return helpers;
-  }
-  canProvideHelp(agent, helpType) {
-    const capabilities = agent.capabilities || [];
-    switch (helpType) {
-      case "code_review":
-        return capabilities.includes("code_review") || agent.role === "reviewer";
-      case "debugging":
-        return capabilities.includes("debugging") || agent.role === "developer";
-      case "testing":
-        return capabilities.includes("testing") || agent.role === "tester";
-      case "optimization":
-        return capabilities.includes("optimization") || agent.role === "optimizer";
-      default:
-        return false;
-    }
-  }
-  async resolveByVoting(conflict) {
-    const votes = /* @__PURE__ */ new Map();
-    for (const agentId of conflict.involvedAgents) {
-      const agent = this.agents.get(agentId);
-      if (agent) {
-        votes.set(agentId, Math.random() > 0.5 ? "option_a" : "option_b");
-      }
-    }
-    const results = /* @__PURE__ */ new Map();
-    for (const vote of votes.values()) {
-      results.set(vote, (results.get(vote) || 0) + 1);
-    }
-    return Array.from(results.entries()).reduce(
-      (a, b) => a[1] > b[1] ? a : b
-    )[0];
-  }
-  async resolveByExpertise(conflict) {
-    let bestAgent = null;
-    let bestExpertise = 0;
-    for (const agentId of conflict.involvedAgents) {
-      const agent = this.agents.get(agentId);
-      if (agent) {
-        const expertise = this.calculateExpertise(agent, conflict.type);
-        if (expertise > bestExpertise) {
-          bestExpertise = expertise;
-          bestAgent = agent;
-        }
-      }
-    }
-    return {
-      resolutionSource: bestAgent?.id,
-      method: "expertise_based",
-      expertiseScore: bestExpertise
-    };
-  }
-  async resolveRandomly(conflict) {
-    const options = ["option_a", "option_b", "compromise"];
-    return options[Math.floor(Math.random() * options.length)];
-  }
-  async resolveByManagerOverride(conflict) {
-    const manager = Array.from(this.agents.values()).find(
-      (agent) => agent.role === "coordinator" || agent.role === "architect"
-    );
-    return {
-      resolutionSource: manager?.id || "system",
-      method: "manager_override"
-    };
-  }
-  calculateExpertise(agent, conflictType) {
-    const capabilities = agent.capabilities || [];
-    const performance = agent.performance;
-    let expertise = 0;
-    switch (conflictType) {
-      case "resource":
-        expertise += capabilities.includes("resource_optimization") ? 0.5 : 0;
-        break;
-      case "task_overlap":
-        expertise += capabilities.includes("coordination") ? 0.5 : 0;
-        break;
-    }
-    if (performance) {
-      expertise += performance.successRate * 0.3;
-      expertise += Math.min(performance.tasksCompleted / 10, 0.2);
-    }
-    return Math.min(expertise, 1);
-  }
-  buildDependencyGraph(tasks) {
-    const graph = /* @__PURE__ */ new Map();
-    for (const task of tasks) {
-      const deps = this.dependencies.get(task.id);
-      graph.set(task.id, deps?.dependsOn || []);
-    }
-    return graph;
-  }
-  topologicalSort(graph, tasks) {
-    const result = [];
-    const visited = /* @__PURE__ */ new Set();
-    const visiting = /* @__PURE__ */ new Set();
-    const visit = (taskId) => {
-      if (visited.has(taskId)) return;
-      if (visiting.has(taskId)) {
-        logger.warn(`Circular dependency detected involving task: ${taskId}`);
-        return;
-      }
-      visiting.add(taskId);
-      const deps = graph.get(taskId) || [];
-      for (const dep of deps) {
-        visit(dep);
-      }
-      visiting.delete(taskId);
-      visited.add(taskId);
-      const task = tasks.find((t) => t.id === taskId);
-      if (task) result.push(task);
-    };
-    for (const task of tasks) {
-      visit(task.id);
-    }
-    return result;
-  }
-  updateCriticalPath() {
-    logger.debug("Critical path updated");
-  }
-  identifyBottlenecks() {
-    const bottlenecks = [];
-    for (const [taskId, dep] of this.dependencies) {
-      if (dep.blockingFor.length > 2) {
-        bottlenecks.push(taskId);
-      }
-    }
-    return bottlenecks;
-  }
-  calculateAgentWorkload(agent) {
-    let workload = 0;
-    if (agent.status === "active") workload += 0.5;
-    if (agent.currentTask) workload += 0.3;
-    const recentMessages = this.messageQueue.filter(
-      (m) => (m.from === agent.id || Array.isArray(m.to) && m.to.includes(agent.id)) && Date.now() - m.timestamp < 3e5
-      // 5 minutes
-    );
-    workload += Math.min(recentMessages.length * 0.05, 0.2);
-    return Math.min(workload, 1);
-  }
-  checkAgentCompatibility(agent1Id, agent2Id) {
-    const agent1 = this.agents.get(agent1Id);
-    const agent2 = this.agents.get(agent2Id);
-    if (!agent1 || !agent2) {
-      return { score: 0, bestTaskType: "", reason: "Agent not found" };
-    }
-    const caps1 = new Set(agent1.capabilities || []);
-    const caps2 = new Set(agent2.capabilities || []);
-    const overlap = new Set([...caps1].filter((x) => caps2.has(x)));
-    const score = overlap.size / Math.max(caps1.size, caps2.size, 1);
-    return {
-      score,
-      bestTaskType: Array.from(overlap)[0] || "general",
-      reason: `Capability overlap: ${overlap.size} common skills`
-    };
-  }
-  applyCoordinationRules(message) {
-    for (const rule of this.coordinationRules) {
-      if (rule.condition(message)) {
-        rule.action(message, this);
-      }
-    }
-  }
-  setupDefaultRules() {
-    this.coordinationRules = [
-      {
-        id: "help_request_timeout",
-        condition: (msg) => msg.type === "help_request",
-        action: (msg, system) => {
-          setTimeout(() => {
-            system.broadcastMessage({
-              from: "system",
-              to: "broadcast",
-              type: "status_update",
-              content: {
-                type: "help_request_timeout",
-                originalRequest: msg.id
-              },
-              priority: "urgent"
-            });
-          }, 3e5);
-        }
-      }
-    ];
-  }
-  generateId() {
-    return `coord_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`;
-  }
-}
-var enhanced_coordination_default = EnhancedCoordinationSystem;
-export {
-  EnhancedCoordinationSystem,
-  enhanced_coordination_default as default
-};
-//# sourceMappingURL=enhanced-coordination.js.map

package/dist/integrations/ralph/coordination/enhanced-coordination.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../../src/integrations/ralph/coordination/enhanced-coordination.ts"],
-  "sourcesContent": ["/**\n * Enhanced Agent Coordination System\n * Provides advanced coordination patterns, conflict resolution, and inter-agent communication\n */\n\nimport { EventEmitter } from 'events';\nimport { logger } from '../../../core/monitoring/logger.js';\nimport { Agent, SwarmTask, CoordinationEvent } from '../types.js';\n\nexport interface CoordinationMessage {\n  id: string;\n  from: string; // agent ID\n  to: string[] | 'broadcast'; // agent IDs or broadcast\n  type:\n    | 'status_update'\n    | 'help_request'\n    | 'resource_conflict'\n    | 'task_handoff'\n    | 'knowledge_share';\n  content: any;\n  timestamp: number;\n  priority: 'low' | 'normal' | 'high' | 'urgent';\n}\n\nexport interface TaskDependency {\n  taskId: string;\n  dependsOn: string[];\n  blockingFor: string[];\n  estimatedCompletionTime: number;\n  criticalPath: boolean;\n}\n\nexport interface ConflictResolution {\n  id: string;\n  type: 'resource' | 'task_overlap' | 'knowledge_conflict' | 'priority_dispute';\n  involvedAgents: string[];\n  description: string;\n  resolutionStrategy:\n    | 'voting'\n    | 'expertise_based'\n    | 'random'\n    | 'manager_override';\n  resolution: any;\n  timestamp: number;\n  status: 'pending' | 'resolved' | 'escalated';\n}\n\nexport class EnhancedCoordinationSystem extends EventEmitter {\n  private agents: Map<string, Agent> = new Map();\n  private messageQueue: CoordinationMessage[] = [];\n  private dependencies: Map<string, TaskDependency> = new Map();\n  private conflicts: Map<string, ConflictResolution> = new Map();\n  private coordinationRules: CoordinationRule[] = [];\n\n  constructor() {\n    super();\n    this.setupDefaultRules();\n  }\n\n  /**\n   * Register an agent with the coordination system\n   */\n  registerAgent(agent: Agent): void {\n    this.agents.set(agent.id, agent);\n    logger.info(`Agent ${agent.role} registered for coordination`);\n\n    // Notify other agents\n    this.broadcastMessage({\n      id: this.generateId(),\n      from: 'system',\n      to: 'broadcast',\n      type: 'status_update',\n      content: { type: 'agent_joined', agent: agent.role },\n      timestamp: Date.now(),\n      priority: 'normal',\n    });\n  }\n\n  /**\n   * Send message between agents\n   */\n  sendMessage(message: Omit<CoordinationMessage, 'id' | 'timestamp'>): void {\n    const fullMessage: CoordinationMessage = {\n      ...message,\n      id: this.generateId(),\n      timestamp: Date.now(),\n    };\n\n    this.messageQueue.push(fullMessage);\n    this.routeMessage(fullMessage);\n    this.emit('messageReceived', fullMessage);\n  }\n\n  /**\n   * Broadcast message to all agents\n   */\n  broadcastMessage(\n    message: Omit<CoordinationMessage, 'id' | 'timestamp'>\n  ): void {\n    this.sendMessage({\n      ...message,\n      to: 'broadcast',\n    });\n  }\n\n  /**\n   * Request help from other agents\n   */\n  requestHelp(fromAgent: string, helpType: string, context: any): void {\n    const suitableAgents = this.findSuitableHelpers(helpType);\n\n    this.sendMessage({\n      from: fromAgent,\n      to: suitableAgents,\n      type: 'help_request',\n      content: {\n        helpType,\n        context,\n        requesterCapabilities: this.agents.get(fromAgent)?.capabilities || [],\n      },\n      priority: 'high',\n    });\n  }\n\n  /**\n   * Add task dependency\n   */\n  addDependency(dependency: TaskDependency): void {\n    this.dependencies.set(dependency.taskId, dependency);\n    this.updateCriticalPath();\n    logger.info(\n      `Added dependency: ${dependency.taskId} depends on ${dependency.dependsOn.join(', ')}`\n    );\n  }\n\n  /**\n   * Resolve conflicts automatically\n   */\n  async resolveConflict(conflictId: string): Promise<boolean> {\n    const conflict = this.conflicts.get(conflictId);\n    if (!conflict) return false;\n\n    try {\n      switch (conflict.resolutionStrategy) {\n        case 'voting':\n          conflict.resolution = await this.resolveByVoting(conflict);\n          break;\n        case 'expertise_based':\n          conflict.resolution = await this.resolveByExpertise(conflict);\n          break;\n        case 'random':\n          conflict.resolution = await this.resolveRandomly(conflict);\n          break;\n        case 'manager_override':\n          conflict.resolution = await this.resolveByManagerOverride(conflict);\n          break;\n      }\n\n      conflict.status = 'resolved';\n      this.conflicts.set(conflictId, conflict);\n\n      // Notify agents of resolution\n      this.broadcastMessage({\n        from: 'system',\n        to: conflict.involvedAgents,\n        type: 'status_update',\n        content: {\n          type: 'conflict_resolved',\n          conflictId,\n          resolution: conflict.resolution,\n        },\n        priority: 'high',\n      });\n\n      return true;\n    } catch (error) {\n      conflict.status = 'escalated';\n      logger.error(`Failed to resolve conflict ${conflictId}:`, error as Error);\n      return false;\n    }\n  }\n\n  /**\n   * Get optimal task execution order considering dependencies\n   */\n  getOptimalExecutionOrder(tasks: SwarmTask[]): SwarmTask[] {\n    const graph = this.buildDependencyGraph(tasks);\n    return this.topologicalSort(graph, tasks);\n  }\n\n  /**\n   * Detect and report coordination patterns\n   */\n  analyzeCoordinationPatterns(): {\n    communicationFrequency: Map<string, number>;\n    helpRequestPatterns: any[];\n    conflictFrequency: Map<string, number>;\n    bottlenecks: string[];\n  } {\n    const patterns = {\n      communicationFrequency: new Map<string, number>(),\n      helpRequestPatterns: [],\n      conflictFrequency: new Map<string, number>(),\n      bottlenecks: this.identifyBottlenecks(),\n    };\n\n    // Analyze message patterns\n    for (const message of this.messageQueue) {\n      const key = `${message.from}-${message.type}`;\n      patterns.communicationFrequency.set(\n        key,\n        (patterns.communicationFrequency.get(key) || 0) + 1\n      );\n    }\n\n    // Analyze conflicts\n    for (const conflict of this.conflicts.values()) {\n      patterns.conflictFrequency.set(\n        conflict.type,\n        (patterns.conflictFrequency.get(conflict.type) || 0) + 1\n      );\n    }\n\n    return patterns;\n  }\n\n  /**\n   * Load balancing recommendations\n   */\n  getLoadBalancingRecommendations(): {\n    overloadedAgents: string[];\n    underutilizedAgents: string[];\n    suggestedReassignments: Array<{\n      fromAgent: string;\n      toAgent: string;\n      taskType: string;\n      reason: string;\n    }>;\n  } {\n    const recommendations = {\n      overloadedAgents: [],\n      underutilizedAgents: [],\n      suggestedReassignments: [],\n    };\n\n    // Analyze agent workloads\n    for (const agent of this.agents.values()) {\n      const workload = this.calculateAgentWorkload(agent);\n\n      if (workload > 0.8) {\n        recommendations.overloadedAgents.push(agent.id);\n      } else if (workload < 0.3) {\n        recommendations.underutilizedAgents.push(agent.id);\n      }\n    }\n\n    // Generate reassignment suggestions\n    for (const overloaded of recommendations.overloadedAgents) {\n      for (const underutilized of recommendations.underutilizedAgents) {\n        const compatibility = this.checkAgentCompatibility(\n          overloaded,\n          underutilized\n        );\n        if (compatibility.score > 0.7) {\n          recommendations.suggestedReassignments.push({\n            fromAgent: overloaded,\n            toAgent: underutilized,\n            taskType: compatibility.bestTaskType,\n            reason: `Load balancing: ${compatibility.reason}`,\n          });\n        }\n      }\n    }\n\n    return recommendations;\n  }\n\n  private routeMessage(message: CoordinationMessage): void {\n    if (message.to === 'broadcast') {\n      // Route to all agents except sender\n      for (const agentId of this.agents.keys()) {\n        if (agentId !== message.from) {\n          this.deliverMessage(agentId, message);\n        }\n      }\n    } else {\n      // Route to specific agents\n      for (const agentId of message.to as string[]) {\n        this.deliverMessage(agentId, message);\n      }\n    }\n\n    // Apply coordination rules\n    this.applyCoordinationRules(message);\n  }\n\n  private deliverMessage(agentId: string, message: CoordinationMessage): void {\n    const agent = this.agents.get(agentId);\n    if (agent) {\n      // Store message for agent (in real implementation, would integrate with agent's message handler)\n      logger.debug(`Message delivered to ${agent.role}: ${message.type}`);\n    }\n  }\n\n  private findSuitableHelpers(helpType: string): string[] {\n    const helpers: string[] = [];\n\n    for (const agent of this.agents.values()) {\n      if (this.canProvideHelp(agent, helpType)) {\n        helpers.push(agent.id);\n      }\n    }\n\n    return helpers;\n  }\n\n  private canProvideHelp(agent: Agent, helpType: string): boolean {\n    // Check if agent has relevant capabilities\n    const capabilities = agent.capabilities || [];\n\n    switch (helpType) {\n      case 'code_review':\n        return (\n          capabilities.includes('code_review') || agent.role === 'reviewer'\n        );\n      case 'debugging':\n        return capabilities.includes('debugging') || agent.role === 'developer';\n      case 'testing':\n        return capabilities.includes('testing') || agent.role === 'tester';\n      case 'optimization':\n        return (\n          capabilities.includes('optimization') || agent.role === 'optimizer'\n        );\n      default:\n        return false;\n    }\n  }\n\n  private async resolveByVoting(conflict: ConflictResolution): Promise<any> {\n    // Simulate voting resolution\n    const votes = new Map();\n    for (const agentId of conflict.involvedAgents) {\n      const agent = this.agents.get(agentId);\n      if (agent) {\n        // In real implementation, would request vote from agent\n        votes.set(agentId, Math.random() > 0.5 ? 'option_a' : 'option_b');\n      }\n    }\n\n    // Count votes\n    const results = new Map();\n    for (const vote of votes.values()) {\n      results.set(vote, (results.get(vote) || 0) + 1);\n    }\n\n    // Return winning option\n    return Array.from(results.entries()).reduce((a, b) =>\n      a[1] > b[1] ? a : b\n    )[0];\n  }\n\n  private async resolveByExpertise(conflict: ConflictResolution): Promise<any> {\n    // Find most expert agent for the conflict type\n    let bestAgent = null;\n    let bestExpertise = 0;\n\n    for (const agentId of conflict.involvedAgents) {\n      const agent = this.agents.get(agentId);\n      if (agent) {\n        const expertise = this.calculateExpertise(agent, conflict.type);\n        if (expertise > bestExpertise) {\n          bestExpertise = expertise;\n          bestAgent = agent;\n        }\n      }\n    }\n\n    return {\n      resolutionSource: bestAgent?.id,\n      method: 'expertise_based',\n      expertiseScore: bestExpertise,\n    };\n  }\n\n  private async resolveRandomly(conflict: ConflictResolution): Promise<any> {\n    const options = ['option_a', 'option_b', 'compromise'];\n    return options[Math.floor(Math.random() * options.length)];\n  }\n\n  private async resolveByManagerOverride(\n    conflict: ConflictResolution\n  ): Promise<any> {\n    // Find coordinator or architect agent\n    const manager = Array.from(this.agents.values()).find(\n      (agent) => agent.role === 'coordinator' || agent.role === 'architect'\n    );\n\n    return {\n      resolutionSource: manager?.id || 'system',\n      method: 'manager_override',\n    };\n  }\n\n  private calculateExpertise(agent: Agent, conflictType: string): number {\n    // Calculate agent expertise for specific conflict type\n    const capabilities = agent.capabilities || [];\n    const performance = agent.performance;\n\n    let expertise = 0;\n\n    // Base expertise from capabilities\n    switch (conflictType) {\n      case 'resource':\n        expertise += capabilities.includes('resource_optimization') ? 0.5 : 0;\n        break;\n      case 'task_overlap':\n        expertise += capabilities.includes('coordination') ? 0.5 : 0;\n        break;\n    }\n\n    // Add performance-based expertise\n    if (performance) {\n      expertise += performance.successRate * 0.3;\n      expertise += Math.min(performance.tasksCompleted / 10, 0.2);\n    }\n\n    return Math.min(expertise, 1.0);\n  }\n\n  private buildDependencyGraph(tasks: SwarmTask[]): Map<string, string[]> {\n    const graph = new Map<string, string[]>();\n\n    for (const task of tasks) {\n      const deps = this.dependencies.get(task.id);\n      graph.set(task.id, deps?.dependsOn || []);\n    }\n\n    return graph;\n  }\n\n  private topologicalSort(\n    graph: Map<string, string[]>,\n    tasks: SwarmTask[]\n  ): SwarmTask[] {\n    const result: SwarmTask[] = [];\n    const visited = new Set<string>();\n    const visiting = new Set<string>();\n\n    const visit = (taskId: string) => {\n      if (visited.has(taskId)) return;\n      if (visiting.has(taskId)) {\n        logger.warn(`Circular dependency detected involving task: ${taskId}`);\n        return;\n      }\n\n      visiting.add(taskId);\n      const deps = graph.get(taskId) || [];\n\n      for (const dep of deps) {\n        visit(dep);\n      }\n\n      visiting.delete(taskId);\n      visited.add(taskId);\n\n      const task = tasks.find((t) => t.id === taskId);\n      if (task) result.push(task);\n    };\n\n    for (const task of tasks) {\n      visit(task.id);\n    }\n\n    return result;\n  }\n\n  private updateCriticalPath(): void {\n    // Identify critical path through dependencies\n    // Implementation would use network analysis algorithms\n    logger.debug('Critical path updated');\n  }\n\n  private identifyBottlenecks(): string[] {\n    const bottlenecks: string[] = [];\n\n    // Find tasks with many dependencies\n    for (const [taskId, dep] of this.dependencies) {\n      if (dep.blockingFor.length > 2) {\n        bottlenecks.push(taskId);\n      }\n    }\n\n    return bottlenecks;\n  }\n\n  private calculateAgentWorkload(agent: Agent): number {\n    // Calculate workload based on current tasks, message frequency, etc.\n    let workload = 0;\n\n    if (agent.status === 'active') workload += 0.5;\n    if (agent.currentTask) workload += 0.3;\n\n    // Add message handling workload\n    const recentMessages = this.messageQueue.filter(\n      (m) =>\n        (m.from === agent.id ||\n          (Array.isArray(m.to) && m.to.includes(agent.id))) &&\n        Date.now() - m.timestamp < 300000 // 5 minutes\n    );\n\n    workload += Math.min(recentMessages.length * 0.05, 0.2);\n\n    return Math.min(workload, 1.0);\n  }\n\n  private checkAgentCompatibility(\n    agent1Id: string,\n    agent2Id: string\n  ): {\n    score: number;\n    bestTaskType: string;\n    reason: string;\n  } {\n    const agent1 = this.agents.get(agent1Id);\n    const agent2 = this.agents.get(agent2Id);\n\n    if (!agent1 || !agent2) {\n      return { score: 0, bestTaskType: '', reason: 'Agent not found' };\n    }\n\n    // Check capability overlap\n    const caps1 = new Set(agent1.capabilities || []);\n    const caps2 = new Set(agent2.capabilities || []);\n    const overlap = new Set([...caps1].filter((x) => caps2.has(x)));\n\n    const score = overlap.size / Math.max(caps1.size, caps2.size, 1);\n\n    return {\n      score,\n      bestTaskType: Array.from(overlap)[0] || 'general',\n      reason: `Capability overlap: ${overlap.size} common skills`,\n    };\n  }\n\n  private applyCoordinationRules(message: CoordinationMessage): void {\n    for (const rule of this.coordinationRules) {\n      if (rule.condition(message)) {\n        rule.action(message, this);\n      }\n    }\n  }\n\n  private setupDefaultRules(): void {\n    this.coordinationRules = [\n      {\n        id: 'help_request_timeout',\n        condition: (msg) => msg.type === 'help_request',\n        action: (msg, system) => {\n          // Auto-escalate help requests after timeout\n          setTimeout(() => {\n            system.broadcastMessage({\n              from: 'system',\n              to: 'broadcast',\n              type: 'status_update',\n              content: {\n                type: 'help_request_timeout',\n                originalRequest: msg.id,\n              },\n              priority: 'urgent',\n            });\n          }, 300000); // 5 minutes\n        },\n      },\n    ];\n  }\n\n  private generateId(): string {\n    return `coord_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`;\n  }\n}\n\ninterface CoordinationRule {\n  id: string;\n  condition: (message: CoordinationMessage) => boolean;\n  action: (\n    message: CoordinationMessage,\n    system: EnhancedCoordinationSystem\n  ) => void;\n}\n\nexport default EnhancedCoordinationSystem;\n"],
-  "mappings": ";;;;AAKA,SAAS,oBAAoB;AAC7B,SAAS,cAAc;AAyChB,MAAM,mCAAmC,aAAa;AAAA,EACnD,SAA6B,oBAAI,IAAI;AAAA,EACrC,eAAsC,CAAC;AAAA,EACvC,eAA4C,oBAAI,IAAI;AAAA,EACpD,YAA6C,oBAAI,IAAI;AAAA,EACrD,oBAAwC,CAAC;AAAA,EAEjD,cAAc;AACZ,UAAM;AACN,SAAK,kBAAkB;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,OAAoB;AAChC,SAAK,OAAO,IAAI,MAAM,IAAI,KAAK;AAC/B,WAAO,KAAK,SAAS,MAAM,IAAI,8BAA8B;AAG7D,SAAK,iBAAiB;AAAA,MACpB,IAAI,KAAK,WAAW;AAAA,MACpB,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,SAAS,EAAE,MAAM,gBAAgB,OAAO,MAAM,KAAK;AAAA,MACnD,WAAW,KAAK,IAAI;AAAA,MACpB,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,SAA8D;AACxE,UAAM,cAAmC;AAAA,MACvC,GAAG;AAAA,MACH,IAAI,KAAK,WAAW;AAAA,MACpB,WAAW,KAAK,IAAI;AAAA,IACtB;AAEA,SAAK,aAAa,KAAK,WAAW;AAClC,SAAK,aAAa,WAAW;AAC7B,SAAK,KAAK,mBAAmB,WAAW;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA,EAKA,iBACE,SACM;AACN,SAAK,YAAY;AAAA,MACf,GAAG;AAAA,MACH,IAAI;AAAA,IACN,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,WAAmB,UAAkB,SAAoB;AACnE,UAAM,iBAAiB,KAAK,oBAAoB,QAAQ;AAExD,SAAK,YAAY;AAAA,MACf,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,SAAS;AAAA,QACP;AAAA,QACA;AAAA,QACA,uBAAuB,KAAK,OAAO,IAAI,SAAS,GAAG,gBAAgB,CAAC;AAAA,MACtE;AAAA,MACA,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,YAAkC;AAC9C,SAAK,aAAa,IAAI,WAAW,QAAQ,UAAU;AACnD,SAAK,mBAAmB;AACxB,WAAO;AAAA,MACL,qBAAqB,WAAW,MAAM,eAAe,WAAW,UAAU,KAAK,IAAI,CAAC;AAAA,IACtF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,gBAAgB,YAAsC;AAC1D,UAAM,WAAW,KAAK,UAAU,IAAI,UAAU;AAC9C,QAAI,CAAC,SAAU,QAAO;AAEtB,QAAI;AACF,cAAQ,SAAS,oBAAoB;AAAA,QACnC,KAAK;AACH,mBAAS,aAAa,MAAM,KAAK,gBAAgB,QAAQ;AACzD;AAAA,QACF,KAAK;AACH,mBAAS,aAAa,MAAM,KAAK,mBAAmB,QAAQ;AAC5D;AAAA,QACF,KAAK;AACH,mBAAS,aAAa,MAAM,KAAK,gBAAgB,QAAQ;AACzD;AAAA,QACF,KAAK;AACH,mBAAS,aAAa,MAAM,KAAK,yBAAyB,QAAQ;AAClE;AAAA,MACJ;AAEA,eAAS,SAAS;AAClB,WAAK,UAAU,IAAI,YAAY,QAAQ;AAGvC,WAAK,iBAAiB;AAAA,QACpB,MAAM;AAAA,QACN,IAAI,SAAS;AAAA,QACb,MAAM;AAAA,QACN,SAAS;AAAA,UACP,MAAM;AAAA,UACN;AAAA,UACA,YAAY,SAAS;AAAA,QACvB;AAAA,QACA,UAAU;AAAA,MACZ,CAAC;AAED,aAAO;AAAA,IACT,SAAS,OAAO;AACd,eAAS,SAAS;AAClB,aAAO,MAAM,8BAA8B,UAAU,KAAK,KAAc;AACxE,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,yBAAyB,OAAiC;AACxD,UAAM,QAAQ,KAAK,qBAAqB,KAAK;AAC7C,WAAO,KAAK,gBAAgB,OAAO,KAAK;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA,EAKA,8BAKE;AACA,UAAM,WAAW;AAAA,MACf,wBAAwB,oBAAI,IAAoB;AAAA,MAChD,qBAAqB,CAAC;AAAA,MACtB,mBAAmB,oBAAI,IAAoB;AAAA,MAC3C,aAAa,KAAK,oBAAoB;AAAA,IACxC;AAGA,eAAW,WAAW,KAAK,cAAc;AACvC,YAAM,MAAM,GAAG,QAAQ,IAAI,IAAI,QAAQ,IAAI;AAC3C,eAAS,uBAAuB;AAAA,QAC9B;AAAA,SACC,SAAS,uBAAuB,IAAI,GAAG,KAAK,KAAK;AAAA,MACpD;AAAA,IACF;AAGA,eAAW,YAAY,KAAK,UAAU,OAAO,GAAG;AAC9C,eAAS,kBAAkB;AAAA,QACzB,SAAS;AAAA,SACR,SAAS,kBAAkB,IAAI,SAAS,IAAI,KAAK,KAAK;AAAA,MACzD;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,kCASE;AACA,UAAM,kBAAkB;AAAA,MACtB,kBAAkB,CAAC;AAAA,MACnB,qBAAqB,CAAC;AAAA,MACtB,wBAAwB,CAAC;AAAA,IAC3B;AAGA,eAAW,SAAS,KAAK,OAAO,OAAO,GAAG;AACxC,YAAM,WAAW,KAAK,uBAAuB,KAAK;AAElD,UAAI,WAAW,KAAK;AAClB,wBAAgB,iBAAiB,KAAK,MAAM,EAAE;AAAA,MAChD,WAAW,WAAW,KAAK;AACzB,wBAAgB,oBAAoB,KAAK,MAAM,EAAE;AAAA,MACnD;AAAA,IACF;AAGA,eAAW,cAAc,gBAAgB,kBAAkB;AACzD,iBAAW,iBAAiB,gBAAgB,qBAAqB;AAC/D,cAAM,gBAAgB,KAAK;AAAA,UACzB;AAAA,UACA;AAAA,QACF;AACA,YAAI,cAAc,QAAQ,KAAK;AAC7B,0BAAgB,uBAAuB,KAAK;AAAA,YAC1C,WAAW;AAAA,YACX,SAAS;AAAA,YACT,UAAU,cAAc;AAAA,YACxB,QAAQ,mBAAmB,cAAc,MAAM;AAAA,UACjD,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,aAAa,SAAoC;AACvD,QAAI,QAAQ,OAAO,aAAa;AAE9B,iBAAW,WAAW,KAAK,OAAO,KAAK,GAAG;AACxC,YAAI,YAAY,QAAQ,MAAM;AAC5B,eAAK,eAAe,SAAS,OAAO;AAAA,QACtC;AAAA,MACF;AAAA,IACF,OAAO;AAEL,iBAAW,WAAW,QAAQ,IAAgB;AAC5C,aAAK,eAAe,SAAS,OAAO;AAAA,MACtC;AAAA,IACF;AAGA,SAAK,uBAAuB,OAAO;AAAA,EACrC;AAAA,EAEQ,eAAe,SAAiB,SAAoC;AAC1E,UAAM,QAAQ,KAAK,OAAO,IAAI,OAAO;AACrC,QAAI,OAAO;AAET,aAAO,MAAM,wBAAwB,MAAM,IAAI,KAAK,QAAQ,IAAI,EAAE;AAAA,IACpE;AAAA,EACF;AAAA,EAEQ,oBAAoB,UAA4B;AACtD,UAAM,UAAoB,CAAC;AAE3B,eAAW,SAAS,KAAK,OAAO,OAAO,GAAG;AACxC,UAAI,KAAK,eAAe,OAAO,QAAQ,GAAG;AACxC,gBAAQ,KAAK,MAAM,EAAE;AAAA,MACvB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,eAAe,OAAc,UAA2B;AAE9D,UAAM,eAAe,MAAM,gBAAgB,CAAC;AAE5C,YAAQ,UAAU;AAAA,MAChB,KAAK;AACH,eACE,aAAa,SAAS,aAAa,KAAK,MAAM,SAAS;AAAA,MAE3D,KAAK;AACH,eAAO,aAAa,SAAS,WAAW,KAAK,MAAM,SAAS;AAAA,MAC9D,KAAK;AACH,eAAO,aAAa,SAAS,SAAS,KAAK,MAAM,SAAS;AAAA,MAC5D,KAAK;AACH,eACE,aAAa,SAAS,cAAc,KAAK,MAAM,SAAS;AAAA,MAE5D;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAAA,EAEA,MAAc,gBAAgB,UAA4C;AAExE,UAAM,QAAQ,oBAAI,IAAI;AACtB,eAAW,WAAW,SAAS,gBAAgB;AAC7C,YAAM,QAAQ,KAAK,OAAO,IAAI,OAAO;AACrC,UAAI,OAAO;AAET,cAAM,IAAI,SAAS,KAAK,OAAO,IAAI,MAAM,aAAa,UAAU;AAAA,MAClE;AAAA,IACF;AAGA,UAAM,UAAU,oBAAI,IAAI;AACxB,eAAW,QAAQ,MAAM,OAAO,GAAG;AACjC,cAAQ,IAAI,OAAO,QAAQ,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,IAChD;AAGA,WAAO,MAAM,KAAK,QAAQ,QAAQ,CAAC,EAAE;AAAA,MAAO,CAAC,GAAG,MAC9C,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI;AAAA,IACpB,EAAE,CAAC;AAAA,EACL;AAAA,EAEA,MAAc,mBAAmB,UAA4C;AAE3E,QAAI,YAAY;AAChB,QAAI,gBAAgB;AAEpB,eAAW,WAAW,SAAS,gBAAgB;AAC7C,YAAM,QAAQ,KAAK,OAAO,IAAI,OAAO;AACrC,UAAI,OAAO;AACT,cAAM,YAAY,KAAK,mBAAmB,OAAO,SAAS,IAAI;AAC9D,YAAI,YAAY,eAAe;AAC7B,0BAAgB;AAChB,sBAAY;AAAA,QACd;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL,kBAAkB,WAAW;AAAA,MAC7B,QAAQ;AAAA,MACR,gBAAgB;AAAA,IAClB;AAAA,EACF;AAAA,EAEA,MAAc,gBAAgB,UAA4C;AACxE,UAAM,UAAU,CAAC,YAAY,YAAY,YAAY;AACrD,WAAO,QAAQ,KAAK,MAAM,KAAK,OAAO,IAAI,QAAQ,MAAM,CAAC;AAAA,EAC3D;AAAA,EAEA,MAAc,yBACZ,UACc;AAEd,UAAM,UAAU,MAAM,KAAK,KAAK,OAAO,OAAO,CAAC,EAAE;AAAA,MAC/C,CAAC,UAAU,MAAM,SAAS,iBAAiB,MAAM,SAAS;AAAA,IAC5D;AAEA,WAAO;AAAA,MACL,kBAAkB,SAAS,MAAM;AAAA,MACjC,QAAQ;AAAA,IACV;AAAA,EACF;AAAA,EAEQ,mBAAmB,OAAc,cAA8B;AAErE,UAAM,eAAe,MAAM,gBAAgB,CAAC;AAC5C,UAAM,cAAc,MAAM;AAE1B,QAAI,YAAY;AAGhB,YAAQ,cAAc;AAAA,MACpB,KAAK;AACH,qBAAa,aAAa,SAAS,uBAAuB,IAAI,MAAM;AACpE;AAAA,MACF,KAAK;AACH,qBAAa,aAAa,SAAS,cAAc,IAAI,MAAM;AAC3D;AAAA,IACJ;AAGA,QAAI,aAAa;AACf,mBAAa,YAAY,cAAc;AACvC,mBAAa,KAAK,IAAI,YAAY,iBAAiB,IAAI,GAAG;AAAA,IAC5D;AAEA,WAAO,KAAK,IAAI,WAAW,CAAG;AAAA,EAChC;AAAA,EAEQ,qBAAqB,OAA2C;AACtE,UAAM,QAAQ,oBAAI,IAAsB;AAExC,eAAW,QAAQ,OAAO;AACxB,YAAM,OAAO,KAAK,aAAa,IAAI,KAAK,EAAE;AAC1C,YAAM,IAAI,KAAK,IAAI,MAAM,aAAa,CAAC,CAAC;AAAA,IAC1C;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,gBACN,OACA,OACa;AACb,UAAM,SAAsB,CAAC;AAC7B,UAAM,UAAU,oBAAI,IAAY;AAChC,UAAM,WAAW,oBAAI,IAAY;AAEjC,UAAM,QAAQ,CAAC,WAAmB;AAChC,UAAI,QAAQ,IAAI,MAAM,EAAG;AACzB,UAAI,SAAS,IAAI,MAAM,GAAG;AACxB,eAAO,KAAK,gDAAgD,MAAM,EAAE;AACpE;AAAA,MACF;AAEA,eAAS,IAAI,MAAM;AACnB,YAAM,OAAO,MAAM,IAAI,MAAM,KAAK,CAAC;AAEnC,iBAAW,OAAO,MAAM;AACtB,cAAM,GAAG;AAAA,MACX;AAEA,eAAS,OAAO,MAAM;AACtB,cAAQ,IAAI,MAAM;AAElB,YAAM,OAAO,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM;AAC9C,UAAI,KAAM,QAAO,KAAK,IAAI;AAAA,IAC5B;AAEA,eAAW,QAAQ,OAAO;AACxB,YAAM,KAAK,EAAE;AAAA,IACf;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,qBAA2B;AAGjC,WAAO,MAAM,uBAAuB;AAAA,EACtC;AAAA,EAEQ,sBAAgC;AACtC,UAAM,cAAwB,CAAC;AAG/B,eAAW,CAAC,QAAQ,GAAG,KAAK,KAAK,cAAc;AAC7C,UAAI,IAAI,YAAY,SAAS,GAAG;AAC9B,oBAAY,KAAK,MAAM;AAAA,MACzB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,uBAAuB,OAAsB;AAEnD,QAAI,WAAW;AAEf,QAAI,MAAM,WAAW,SAAU,aAAY;AAC3C,QAAI,MAAM,YAAa,aAAY;AAGnC,UAAM,iBAAiB,KAAK,aAAa;AAAA,MACvC,CAAC,OACE,EAAE,SAAS,MAAM,MACf,MAAM,QAAQ,EAAE,EAAE,KAAK,EAAE,GAAG,SAAS,MAAM,EAAE,MAChD,KAAK,IAAI,IAAI,EAAE,YAAY;AAAA;AAAA,IAC/B;AAEA,gBAAY,KAAK,IAAI,eAAe,SAAS,MAAM,GAAG;AAEtD,WAAO,KAAK,IAAI,UAAU,CAAG;AAAA,EAC/B;AAAA,EAEQ,wBACN,UACA,UAKA;AACA,UAAM,SAAS,KAAK,OAAO,IAAI,QAAQ;AACvC,UAAM,SAAS,KAAK,OAAO,IAAI,QAAQ;AAEvC,QAAI,CAAC,UAAU,CAAC,QAAQ;AACtB,aAAO,EAAE,OAAO,GAAG,cAAc,IAAI,QAAQ,kBAAkB;AAAA,IACjE;AAGA,UAAM,QAAQ,IAAI,IAAI,OAAO,gBAAgB,CAAC,CAAC;AAC/C,UAAM,QAAQ,IAAI,IAAI,OAAO,gBAAgB,CAAC,CAAC;AAC/C,UAAM,UAAU,IAAI,IAAI,CAAC,GAAG,KAAK,EAAE,OAAO,CAAC,MAAM,MAAM,IAAI,CAAC,CAAC,CAAC;AAE9D,UAAM,QAAQ,QAAQ,OAAO,KAAK,IAAI,MAAM,MAAM,MAAM,MAAM,CAAC;AAE/D,WAAO;AAAA,MACL;AAAA,MACA,cAAc,MAAM,KAAK,OAAO,EAAE,CAAC,KAAK;AAAA,MACxC,QAAQ,uBAAuB,QAAQ,IAAI;AAAA,IAC7C;AAAA,EACF;AAAA,EAEQ,uBAAuB,SAAoC;AACjE,eAAW,QAAQ,KAAK,mBAAmB;AACzC,UAAI,KAAK,UAAU,OAAO,GAAG;AAC3B,aAAK,OAAO,SAAS,IAAI;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,oBAA0B;AAChC,SAAK,oBAAoB;AAAA,MACvB;AAAA,QACE,IAAI;AAAA,QACJ,WAAW,CAAC,QAAQ,IAAI,SAAS;AAAA,QACjC,QAAQ,CAAC,KAAK,WAAW;AAEvB,qBAAW,MAAM;AACf,mBAAO,iBAAiB;AAAA,cACtB,MAAM;AAAA,cACN,IAAI;AAAA,cACJ,MAAM;AAAA,cACN,SAAS;AAAA,gBACP,MAAM;AAAA,gBACN,iBAAiB,IAAI;AAAA,cACvB;AAAA,cACA,UAAU;AAAA,YACZ,CAAC;AAAA,UACH,GAAG,GAAM;AAAA,QACX;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,aAAqB;AAC3B,WAAO,SAAS,KAAK,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,OAAO,GAAG,CAAC,CAAC;AAAA,EACvE;AACF;AAWA,IAAO,gCAAQ;",
-  "names": []
-}

package/dist/integrations/ralph/index.js

@@ -1,18 +0,0 @@
-import { fileURLToPath as __fileURLToPath } from 'url';
-import { dirname as __pathDirname } from 'path';
-const __filename = __fileURLToPath(import.meta.url);
-const __dirname = __pathDirname(__filename);
-import { RalphStackMemoryBridge } from "./bridge/ralph-stackmemory-bridge.js";
-import { ContextBudgetManager } from "./context/context-budget-manager.js";
-import { StateReconciler } from "./state/state-reconciler.js";
-import { IterationLifecycle } from "./lifecycle/iteration-lifecycle.js";
-import { PerformanceOptimizer } from "./performance/performance-optimizer.js";
-export * from "./types.js";
-export {
-  ContextBudgetManager,
-  IterationLifecycle,
-  PerformanceOptimizer,
-  RalphStackMemoryBridge,
-  StateReconciler
-};
-//# sourceMappingURL=index.js.map

package/dist/integrations/ralph/index.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../src/integrations/ralph/index.ts"],
-  "sourcesContent": ["/**\n * Ralph Wiggum Loop - StackMemory Integration\n * Core module for bridging Ralph's iteration-based loops with StackMemory's persistence\n */\n\nexport { RalphStackMemoryBridge } from './bridge/ralph-stackmemory-bridge.js';\nexport { ContextBudgetManager } from './context/context-budget-manager.js';\nexport { StateReconciler } from './state/state-reconciler.js';\nexport { IterationLifecycle } from './lifecycle/iteration-lifecycle.js';\nexport { PerformanceOptimizer } from './performance/performance-optimizer.js';\nexport * from './types.js';"],
-  "mappings": ";;;;AAKA,SAAS,8BAA8B;AACvC,SAAS,4BAA4B;AACrC,SAAS,uBAAuB;AAChC,SAAS,0BAA0B;AACnC,SAAS,4BAA4B;AACrC,cAAc;",
-  "names": []
-}