@stackmemoryai/stackmemory 0.5.31 → 0.5.34

package/dist/core/merge/resolution-engine.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/core/merge/resolution-engine.ts"],
-  "sourcesContent": ["/**\n * Resolution Engine\n * Implements multiple strategies for resolving merge conflicts\n */\n\nimport { v4 as uuidv4 } from 'uuid';\nimport {\n  MergeConflict,\n  ConflictResolution,\n  ResolutionStrategy,\n  TeamVote,\n  FrameStack,\n  MergeResult,\n  NotificationResult,\n} from './types.js';\nimport { Frame } from '../context/frame-manager.js';\nimport { ConflictDetector } from './conflict-detector.js';\nimport { StackDiffVisualizer } from './stack-diff.js';\nimport { logger } from '../monitoring/logger.js';\n\nexport interface ResolutionContext {\n  userId: string;\n  userRole: 'junior' | 'mid' | 'senior' | 'lead';\n  teamVotes?: TeamVote[];\n  aiConfidence?: number;\n  timeConstraint?: number; // milliseconds\n}\n\nexport class ResolutionEngine {\n  private conflictDetector: ConflictDetector;\n  private diffVisualizer: StackDiffVisualizer;\n  private resolutionHistory: Map<string, ConflictResolution> = new Map();\n\n  constructor() {\n    this.conflictDetector = new ConflictDetector();\n    this.diffVisualizer = new StackDiffVisualizer();\n  }\n\n  /**\n   * Resolve conflicts using the specified strategy\n   */\n  async resolveConflicts(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    strategy: ResolutionStrategy['type'],\n    context: ResolutionContext\n  ): Promise<MergeResult> {\n    const conflicts = this.conflictDetector.detectConflicts(stack1, stack2);\n\n    logger.info(\n      `Resolving ${conflicts.length} conflicts using ${strategy} strategy`,\n      {\n        userId: context.userId,\n        userRole: context.userRole,\n      }\n    );\n\n    let resolution: ConflictResolution;\n\n    switch (strategy) {\n      case 'keep_both':\n        resolution = await this.keepBothStrategy(\n          conflicts,\n          stack1,\n          stack2,\n          context\n        );\n        break;\n\n      case 'team_vote':\n        resolution = await this.teamVoteStrategy(\n          conflicts,\n          stack1,\n          stack2,\n          context\n        );\n        break;\n\n      case 'senior_override':\n        resolution = await this.seniorOverrideStrategy(\n          conflicts,\n          stack1,\n          stack2,\n          context\n        );\n        break;\n\n      case 'ai_suggest':\n        resolution = await this.aiSuggestStrategy(\n          conflicts,\n          stack1,\n          stack2,\n          context\n        );\n        break;\n\n      case 'hybrid':\n        resolution = await this.hybridStrategy(\n          conflicts,\n          stack1,\n          stack2,\n          context\n        );\n        break;\n\n      default:\n        throw new Error(`Unknown resolution strategy: ${strategy}`);\n    }\n\n    // Execute the merge based on resolution\n    const mergeResult = await this.executeMerge(\n      stack1,\n      stack2,\n      conflicts,\n      resolution\n    );\n\n    // Store resolution in history\n    this.storeResolution(mergeResult.mergedFrameId || '', resolution);\n\n    return mergeResult;\n  }\n\n  /**\n   * Strategy: Keep Both Solutions\n   * Creates a merged frame that includes both approaches\n   */\n  private async keepBothStrategy(\n    conflicts: MergeConflict[],\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): Promise<ConflictResolution> {\n    logger.info('Applying keep_both strategy');\n\n    const strategy: ResolutionStrategy = {\n      type: 'keep_both',\n      confidence: 0.8,\n      reasoning:\n        'Preserving both solutions to maintain all work and allow future evaluation',\n    };\n\n    // Mark all conflicts as resolved by keeping both\n    for (const conflict of conflicts) {\n      conflict.resolution = {\n        strategy,\n        resolvedBy: context.userId,\n        resolvedAt: Date.now(),\n        notes: 'Both solutions preserved in merged frame',\n      };\n    }\n\n    return {\n      strategy,\n      resolvedBy: context.userId,\n      resolvedAt: Date.now(),\n      notes: `Kept all ${stack1.frames.length + stack2.frames.length} frames from both stacks`,\n    };\n  }\n\n  /**\n   * Strategy: Team Vote\n   * Uses democratic voting to choose between options\n   */\n  private async teamVoteStrategy(\n    conflicts: MergeConflict[],\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): Promise<ConflictResolution> {\n    logger.info('Applying team_vote strategy');\n\n    if (!context.teamVotes || context.teamVotes.length === 0) {\n      throw new Error('Team vote strategy requires votes from team members');\n    }\n\n    // Count votes for each conflict\n    const voteResults = this.countVotes(context.teamVotes);\n\n    const strategy: ResolutionStrategy = {\n      type: 'team_vote',\n      confidence: this.calculateVoteConfidence(voteResults),\n      reasoning: `Team consensus from ${context.teamVotes.length} votes`,\n      votes: context.teamVotes,\n    };\n\n    // Apply vote results to conflicts\n    for (const conflict of conflicts) {\n      conflict.resolution = {\n        strategy,\n        resolvedBy: 'team_consensus',\n        resolvedAt: Date.now(),\n        notes: `Resolved by ${voteResults.consensus}% consensus`,\n      };\n    }\n\n    return {\n      strategy,\n      resolvedBy: 'team_consensus',\n      resolvedAt: Date.now(),\n      notes: `Democratic resolution with ${voteResults.consensus}% agreement`,\n    };\n  }\n\n  /**\n   * Strategy: Senior Override\n   * Senior developer's choice takes precedence\n   */\n  private async seniorOverrideStrategy(\n    conflicts: MergeConflict[],\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): Promise<ConflictResolution> {\n    logger.info('Applying senior_override strategy');\n\n    if (context.userRole !== 'senior' && context.userRole !== 'lead') {\n      throw new Error('Senior override requires senior or lead role');\n    }\n\n    // Assume stack1 is the senior's preferred choice\n    this.determinePreferredStack(stack1, stack2, context);\n\n    const strategy: ResolutionStrategy = {\n      type: 'senior_override',\n      confidence: 0.95,\n      reasoning: `Senior developer (${context.userId}) selected based on experience and architectural knowledge`,\n    };\n\n    for (const conflict of conflicts) {\n      conflict.resolution = {\n        strategy,\n        resolvedBy: context.userId,\n        resolvedAt: Date.now(),\n        notes: `Overridden by ${context.userRole} authority`,\n      };\n    }\n\n    return {\n      strategy,\n      resolvedBy: context.userId,\n      resolvedAt: Date.now(),\n      notes: `Senior override applied to all ${conflicts.length} conflicts`,\n    };\n  }\n\n  /**\n   * Strategy: AI Suggest\n   * Uses AI analysis to recommend best resolution\n   */\n  private async aiSuggestStrategy(\n    conflicts: MergeConflict[],\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): Promise<ConflictResolution> {\n    logger.info('Applying ai_suggest strategy');\n\n    // Analyze frames for quality and effectiveness\n    const analysis = await this.analyzeFrameQuality(stack1, stack2);\n\n    const strategy: ResolutionStrategy = {\n      type: 'ai_suggest',\n      confidence: context.aiConfidence || 0.85,\n      reasoning: this.generateAIReasoning(analysis),\n    };\n\n    // Apply AI recommendations to each conflict\n    for (const conflict of conflicts) {\n      const recommendation = this.getAIRecommendation(conflict, analysis);\n      conflict.resolution = {\n        strategy,\n        resolvedBy: 'ai_system',\n        resolvedAt: Date.now(),\n        notes: recommendation,\n      };\n    }\n\n    return {\n      strategy,\n      resolvedBy: 'ai_system',\n      resolvedAt: Date.now(),\n      notes: `AI analysis with ${strategy.confidence * 100}% confidence`,\n    };\n  }\n\n  /**\n   * Strategy: Hybrid\n   * Combines multiple strategies based on conflict type\n   */\n  private async hybridStrategy(\n    conflicts: MergeConflict[],\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): Promise<ConflictResolution> {\n    logger.info('Applying hybrid strategy');\n\n    const strategy: ResolutionStrategy = {\n      type: 'hybrid',\n      confidence: 0.9,\n      reasoning: 'Using optimal strategy for each conflict type',\n    };\n\n    // Apply different strategies based on conflict type\n    for (const conflict of conflicts) {\n      let subStrategy: ResolutionStrategy['type'];\n\n      switch (conflict.type) {\n        case 'parallel_solution':\n          // Keep both for parallel solutions\n          subStrategy = 'keep_both';\n          break;\n\n        case 'conflicting_decision':\n          // Use AI for decision conflicts\n          subStrategy = 'ai_suggest';\n          break;\n\n        case 'structural_divergence':\n          // Use senior override for structural issues\n          subStrategy =\n            context.userRole === 'senior' || context.userRole === 'lead'\n              ? 'senior_override'\n              : 'team_vote';\n          break;\n\n        default:\n          subStrategy = 'ai_suggest';\n      }\n\n      conflict.resolution = {\n        strategy: {\n          ...strategy,\n          reasoning: `${subStrategy} for ${conflict.type}`,\n        },\n        resolvedBy: context.userId,\n        resolvedAt: Date.now(),\n        notes: `Hybrid resolution using ${subStrategy}`,\n      };\n    }\n\n    return {\n      strategy,\n      resolvedBy: context.userId,\n      resolvedAt: Date.now(),\n      notes: `Hybrid strategy optimized for each conflict type`,\n    };\n  }\n\n  /**\n   * Execute the merge based on resolution\n   */\n  private async executeMerge(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[],\n    resolution: ConflictResolution\n  ): Promise<MergeResult> {\n    const mergedFrameId = uuidv4();\n    const rollbackPoint = this.createRollbackPoint(stack1, stack2);\n    const notifications: NotificationResult[] = [];\n\n    try {\n      // Create merged frame stack\n      const mergedFrames = this.mergeFrames(\n        stack1,\n        stack2,\n        conflicts,\n        resolution\n      );\n\n      // Validate merge integrity\n      const isValid = this.validateMerge(mergedFrames, conflicts);\n\n      if (!isValid) {\n        throw new Error('Merge validation failed');\n      }\n\n      // Send notifications\n      const notifyResults = await this.sendNotifications(conflicts, resolution);\n      notifications.push(...notifyResults);\n\n      logger.info('Merge executed successfully', {\n        mergedFrameId,\n        frameCount: mergedFrames.length,\n        strategy: resolution.strategy.type,\n      });\n\n      return {\n        success: true,\n        mergedFrameId,\n        conflicts,\n        resolution,\n        rollbackPoint,\n        notifications,\n      };\n    } catch (error: unknown) {\n      logger.error('Merge execution failed', error as Error);\n\n      return {\n        success: false,\n        conflicts,\n        resolution,\n        rollbackPoint,\n        notifications,\n      };\n    }\n  }\n\n  /**\n   * Count votes from team members\n   */\n  private countVotes(votes: TeamVote[]): {\n    frame1: number;\n    frame2: number;\n    both: number;\n    neither: number;\n    total: number;\n    consensus: number;\n  } {\n    const counts = {\n      frame1: 0,\n      frame2: 0,\n      both: 0,\n      neither: 0,\n      total: votes.length,\n      consensus: 0,\n    };\n\n    for (const vote of votes) {\n      counts[vote.choice]++;\n    }\n\n    // Calculate consensus percentage\n    const maxVotes = Math.max(\n      counts.frame1,\n      counts.frame2,\n      counts.both,\n      counts.neither\n    );\n    counts.consensus = Math.round((maxVotes / counts.total) * 100);\n\n    return counts;\n  }\n\n  /**\n   * Calculate confidence based on vote distribution\n   */\n  private calculateVoteConfidence(voteResults: { consensus: number }): number {\n    // High confidence if strong consensus\n    if (voteResults.consensus >= 80) return 0.95;\n    if (voteResults.consensus >= 60) return 0.75;\n    if (voteResults.consensus >= 40) return 0.5;\n    return 0.3;\n  }\n\n  /**\n   * Determine winner from vote results\n   */\n  private determineVoteWinner(\n    conflict: MergeConflict,\n    voteResults: {\n      frame1: number;\n      frame2: number;\n      both: number;\n      neither: number;\n    }\n  ): string {\n    if (voteResults.frame1 > voteResults.frame2) return conflict.frameId1;\n    if (voteResults.frame2 > voteResults.frame1) return conflict.frameId2;\n    if (voteResults.both > voteResults.neither) return 'both';\n    return 'neither';\n  }\n\n  /**\n   * Determine preferred stack for senior override\n   */\n  private determinePreferredStack(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): FrameStack {\n    // Check if senior owns one of the stacks\n    if (stack1.owner === context.userId) return stack1;\n    if (stack2.owner === context.userId) return stack2;\n\n    // Otherwise, prefer more recent/complete stack\n    if (stack1.lastModified > stack2.lastModified) return stack1;\n    if (\n      stack2.frames.filter((f) => f.state === 'closed').length >\n      stack1.frames.filter((f) => f.state === 'closed').length\n    ) {\n      return stack2;\n    }\n\n    return stack1;\n  }\n\n  /**\n   * Analyze frame quality for AI suggestions\n   */\n  private async analyzeFrameQuality(\n    stack1: FrameStack,\n    stack2: FrameStack\n  ): Promise<{\n    stack1: { completeness: number; efficiency: number; quality: number };\n    stack2: { completeness: number; efficiency: number; quality: number };\n  }> {\n    const analysis = {\n      stack1: {\n        completeness: this.calculateCompleteness(stack1),\n        efficiency: this.calculateEfficiency(stack1),\n        quality: this.calculateQuality(stack1),\n      },\n      stack2: {\n        completeness: this.calculateCompleteness(stack2),\n        efficiency: this.calculateEfficiency(stack2),\n        quality: this.calculateQuality(stack2),\n      },\n    };\n\n    return analysis;\n  }\n\n  /**\n   * Calculate stack completeness\n   */\n  private calculateCompleteness(stack: FrameStack): number {\n    const closedFrames = stack.frames.filter(\n      (f) => f.state === 'closed'\n    ).length;\n    return closedFrames / stack.frames.length;\n  }\n\n  /**\n   * Calculate stack efficiency\n   */\n  private calculateEfficiency(stack: FrameStack): number {\n    let totalDuration = 0;\n    let completedFrames = 0;\n\n    for (const frame of stack.frames) {\n      if (frame.closed_at && frame.created_at) {\n        totalDuration += frame.closed_at - frame.created_at;\n        completedFrames++;\n      }\n    }\n\n    if (completedFrames === 0) return 0;\n\n    const avgDuration = totalDuration / completedFrames;\n    // Normalize: 5 minutes = 1.0, longer = lower score\n    return Math.max(0, Math.min(1, 300000 / avgDuration));\n  }\n\n  /**\n   * Calculate stack quality\n   */\n  private calculateQuality(stack: FrameStack): number {\n    let qualityScore = 0;\n\n    for (const frame of stack.frames) {\n      if (frame.outputs && Object.keys(frame.outputs).length > 0)\n        qualityScore += 0.3;\n      if (frame.digest_text) qualityScore += 0.3;\n      if (frame.state === 'closed') qualityScore += 0.4;\n    }\n\n    return Math.min(1, qualityScore / stack.frames.length);\n  }\n\n  /**\n   * Generate AI reasoning for resolution\n   */\n  private generateAIReasoning(analysis: {\n    stack1: { completeness: number; efficiency: number; quality: number };\n    stack2: { completeness: number; efficiency: number; quality: number };\n  }): string {\n    const stack1Score =\n      analysis.stack1.completeness * 0.3 +\n      analysis.stack1.efficiency * 0.3 +\n      analysis.stack1.quality * 0.4;\n\n    const stack2Score =\n      analysis.stack2.completeness * 0.3 +\n      analysis.stack2.efficiency * 0.3 +\n      analysis.stack2.quality * 0.4;\n\n    if (stack1Score > stack2Score) {\n      return `Stack 1 shows higher overall quality (${(stack1Score * 100).toFixed(1)}% vs ${(stack2Score * 100).toFixed(1)}%)`;\n    } else {\n      return `Stack 2 shows higher overall quality (${(stack2Score * 100).toFixed(1)}% vs ${(stack1Score * 100).toFixed(1)}%)`;\n    }\n  }\n\n  /**\n   * Get AI recommendation for specific conflict\n   */\n  private getAIRecommendation(conflict: MergeConflict): string {\n    switch (conflict.type) {\n      case 'parallel_solution':\n        return 'Recommend keeping both solutions for A/B testing';\n\n      case 'conflicting_decision':\n        return 'Recommend the decision with higher quality score';\n\n      case 'structural_divergence':\n        return 'Recommend restructuring to accommodate both approaches';\n\n      default:\n        return 'Recommend manual review for this conflict';\n    }\n  }\n\n  /**\n   * Create rollback point before merge\n   */\n  private createRollbackPoint(\n    _stack1: FrameStack,\n    _stack2: FrameStack\n  ): string {\n    const rollbackId = uuidv4();\n\n    // Store current state for rollback (would persist in real implementation)\n\n    // In real implementation, persist this to database\n    logger.info('Created rollback point', { rollbackId });\n\n    return rollbackId;\n  }\n\n  /**\n   * Merge frames based on resolution\n   */\n  private mergeFrames(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[],\n    resolution: ConflictResolution\n  ): Frame[] {\n    const mergedFrames: Frame[] = [];\n    const processedIds = new Set<string>();\n\n    // Process based on resolution strategy\n    switch (resolution.strategy.type) {\n      case 'keep_both':\n        // Add all frames from both stacks\n        mergedFrames.push(...stack1.frames, ...stack2.frames);\n        break;\n\n      case 'team_vote':\n      case 'senior_override':\n      case 'ai_suggest':\n        // Add frames based on resolution decisions\n        for (const frame of stack1.frames) {\n          const conflict = conflicts.find((c) => c.frameId1 === frame.frame_id);\n          if (!conflict || conflict.resolution?.strategy.type === 'keep_both') {\n            mergedFrames.push(frame);\n            processedIds.add(frame.frame_id);\n          }\n        }\n\n        for (const frame of stack2.frames) {\n          if (!processedIds.has(frame.frame_id)) {\n            const conflict = conflicts.find(\n              (c) => c.frameId2 === frame.frame_id\n            );\n            if (\n              !conflict ||\n              conflict.resolution?.strategy.type === 'keep_both'\n            ) {\n              mergedFrames.push(frame);\n            }\n          }\n        }\n        break;\n\n      case 'hybrid':\n        // Complex merging based on conflict types\n        this.hybridMerge(stack1, stack2, conflicts, mergedFrames);\n        break;\n    }\n\n    return mergedFrames;\n  }\n\n  /**\n   * Hybrid merge implementation\n   */\n  private hybridMerge(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[],\n    mergedFrames: Frame[]\n  ): void {\n    const conflictMap = new Map<string, MergeConflict>();\n\n    for (const conflict of conflicts) {\n      conflictMap.set(conflict.frameId1, conflict);\n      conflictMap.set(conflict.frameId2, conflict);\n    }\n\n    // Process each frame based on its conflict type\n    for (const frame of [...stack1.frames, ...stack2.frames]) {\n      const conflict = conflictMap.get(frame.frame_id);\n\n      if (!conflict) {\n        // No conflict, add frame\n        if (!mergedFrames.find((f) => f.frame_id === frame.frame_id)) {\n          mergedFrames.push(frame);\n        }\n      } else if (conflict.type === 'parallel_solution') {\n        // Keep both for parallel solutions\n        if (!mergedFrames.find((f) => f.frame_id === frame.frame_id)) {\n          mergedFrames.push(frame);\n        }\n      }\n      // Other conflict types handled by resolution\n    }\n  }\n\n  /**\n   * Validate merge integrity\n   */\n  private validateMerge(\n    mergedFrames: Frame[],\n    conflicts: MergeConflict[]\n  ): boolean {\n    // Check for duplicate frame IDs\n    const ids = new Set<string>();\n    for (const frame of mergedFrames) {\n      if (ids.has(frame.frame_id)) {\n        logger.error('Duplicate frame ID in merge', {\n          frameId: frame.frame_id,\n        });\n        return false;\n      }\n      ids.add(frame.frame_id);\n    }\n\n    // Check parent-child relationships\n    for (const frame of mergedFrames) {\n      if (frame.parent_frame_id) {\n        const parent = mergedFrames.find(\n          (f) => f.frame_id === frame.parent_frame_id\n        );\n        if (!parent) {\n          logger.warn('Orphaned frame in merge', { frameId: frame.frame_id });\n        }\n      }\n    }\n\n    // Check all conflicts have resolutions\n    for (const conflict of conflicts) {\n      if (!conflict.resolution) {\n        logger.error('Unresolved conflict in merge', {\n          conflictId: conflict.id,\n        });\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   * Send notifications about merge\n   */\n  private async sendNotifications(\n    conflicts: MergeConflict[],\n    resolution: ConflictResolution\n  ): Promise<NotificationResult[]> {\n    const notifications: NotificationResult[] = [];\n\n    // In real implementation, send actual notifications\n    // For now, simulate notification sending\n    const notification: NotificationResult = {\n      userId: resolution.resolvedBy || 'team',\n      type: 'in-app',\n      sent: true,\n      timestamp: Date.now(),\n    };\n\n    notifications.push(notification);\n\n    logger.info('Notifications sent', { count: notifications.length });\n\n    return notifications;\n  }\n\n  /**\n   * Store resolution in history\n   */\n  private storeResolution(\n    mergeId: string,\n    resolution: ConflictResolution\n  ): void {\n    this.resolutionHistory.set(mergeId, resolution);\n\n    // In real implementation, persist to database\n    logger.info('Resolution stored in history', {\n      mergeId,\n      strategy: resolution.strategy.type,\n    });\n  }\n\n  /**\n   * Get resolution history for analysis\n   */\n  getResolutionHistory(): Map<string, ConflictResolution> {\n    return this.resolutionHistory;\n  }\n}\n"],
+  "sourcesContent": ["/**\n * Resolution Engine\n * Implements multiple strategies for resolving merge conflicts\n */\n\nimport { v4 as uuidv4 } from 'uuid';\nimport {\n  MergeConflict,\n  ConflictResolution,\n  ResolutionStrategy,\n  TeamVote,\n  FrameStack,\n  MergeResult,\n  NotificationResult,\n} from './types.js';\nimport { Frame } from '../context/index.js';\nimport { ConflictDetector } from './conflict-detector.js';\nimport { StackDiffVisualizer } from './stack-diff.js';\nimport { logger } from '../monitoring/logger.js';\n\nexport interface ResolutionContext {\n  userId: string;\n  userRole: 'junior' | 'mid' | 'senior' | 'lead';\n  teamVotes?: TeamVote[];\n  aiConfidence?: number;\n  timeConstraint?: number; // milliseconds\n}\n\nexport class ResolutionEngine {\n  private conflictDetector: ConflictDetector;\n  private diffVisualizer: StackDiffVisualizer;\n  private resolutionHistory: Map<string, ConflictResolution> = new Map();\n\n  constructor() {\n    this.conflictDetector = new ConflictDetector();\n    this.diffVisualizer = new StackDiffVisualizer();\n  }\n\n  /**\n   * Resolve conflicts using the specified strategy\n   */\n  async resolveConflicts(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    strategy: ResolutionStrategy['type'],\n    context: ResolutionContext\n  ): Promise<MergeResult> {\n    const conflicts = this.conflictDetector.detectConflicts(stack1, stack2);\n\n    logger.info(\n      `Resolving ${conflicts.length} conflicts using ${strategy} strategy`,\n      {\n        userId: context.userId,\n        userRole: context.userRole,\n      }\n    );\n\n    let resolution: ConflictResolution;\n\n    switch (strategy) {\n      case 'keep_both':\n        resolution = await this.keepBothStrategy(\n          conflicts,\n          stack1,\n          stack2,\n          context\n        );\n        break;\n\n      case 'team_vote':\n        resolution = await this.teamVoteStrategy(\n          conflicts,\n          stack1,\n          stack2,\n          context\n        );\n        break;\n\n      case 'senior_override':\n        resolution = await this.seniorOverrideStrategy(\n          conflicts,\n          stack1,\n          stack2,\n          context\n        );\n        break;\n\n      case 'ai_suggest':\n        resolution = await this.aiSuggestStrategy(\n          conflicts,\n          stack1,\n          stack2,\n          context\n        );\n        break;\n\n      case 'hybrid':\n        resolution = await this.hybridStrategy(\n          conflicts,\n          stack1,\n          stack2,\n          context\n        );\n        break;\n\n      default:\n        throw new Error(`Unknown resolution strategy: ${strategy}`);\n    }\n\n    // Execute the merge based on resolution\n    const mergeResult = await this.executeMerge(\n      stack1,\n      stack2,\n      conflicts,\n      resolution\n    );\n\n    // Store resolution in history\n    this.storeResolution(mergeResult.mergedFrameId || '', resolution);\n\n    return mergeResult;\n  }\n\n  /**\n   * Strategy: Keep Both Solutions\n   * Creates a merged frame that includes both approaches\n   */\n  private async keepBothStrategy(\n    conflicts: MergeConflict[],\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): Promise<ConflictResolution> {\n    logger.info('Applying keep_both strategy');\n\n    const strategy: ResolutionStrategy = {\n      type: 'keep_both',\n      confidence: 0.8,\n      reasoning:\n        'Preserving both solutions to maintain all work and allow future evaluation',\n    };\n\n    // Mark all conflicts as resolved by keeping both\n    for (const conflict of conflicts) {\n      conflict.resolution = {\n        strategy,\n        resolvedBy: context.userId,\n        resolvedAt: Date.now(),\n        notes: 'Both solutions preserved in merged frame',\n      };\n    }\n\n    return {\n      strategy,\n      resolvedBy: context.userId,\n      resolvedAt: Date.now(),\n      notes: `Kept all ${stack1.frames.length + stack2.frames.length} frames from both stacks`,\n    };\n  }\n\n  /**\n   * Strategy: Team Vote\n   * Uses democratic voting to choose between options\n   */\n  private async teamVoteStrategy(\n    conflicts: MergeConflict[],\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): Promise<ConflictResolution> {\n    logger.info('Applying team_vote strategy');\n\n    if (!context.teamVotes || context.teamVotes.length === 0) {\n      throw new Error('Team vote strategy requires votes from team members');\n    }\n\n    // Count votes for each conflict\n    const voteResults = this.countVotes(context.teamVotes);\n\n    const strategy: ResolutionStrategy = {\n      type: 'team_vote',\n      confidence: this.calculateVoteConfidence(voteResults),\n      reasoning: `Team consensus from ${context.teamVotes.length} votes`,\n      votes: context.teamVotes,\n    };\n\n    // Apply vote results to conflicts\n    for (const conflict of conflicts) {\n      conflict.resolution = {\n        strategy,\n        resolvedBy: 'team_consensus',\n        resolvedAt: Date.now(),\n        notes: `Resolved by ${voteResults.consensus}% consensus`,\n      };\n    }\n\n    return {\n      strategy,\n      resolvedBy: 'team_consensus',\n      resolvedAt: Date.now(),\n      notes: `Democratic resolution with ${voteResults.consensus}% agreement`,\n    };\n  }\n\n  /**\n   * Strategy: Senior Override\n   * Senior developer's choice takes precedence\n   */\n  private async seniorOverrideStrategy(\n    conflicts: MergeConflict[],\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): Promise<ConflictResolution> {\n    logger.info('Applying senior_override strategy');\n\n    if (context.userRole !== 'senior' && context.userRole !== 'lead') {\n      throw new Error('Senior override requires senior or lead role');\n    }\n\n    // Assume stack1 is the senior's preferred choice\n    this.determinePreferredStack(stack1, stack2, context);\n\n    const strategy: ResolutionStrategy = {\n      type: 'senior_override',\n      confidence: 0.95,\n      reasoning: `Senior developer (${context.userId}) selected based on experience and architectural knowledge`,\n    };\n\n    for (const conflict of conflicts) {\n      conflict.resolution = {\n        strategy,\n        resolvedBy: context.userId,\n        resolvedAt: Date.now(),\n        notes: `Overridden by ${context.userRole} authority`,\n      };\n    }\n\n    return {\n      strategy,\n      resolvedBy: context.userId,\n      resolvedAt: Date.now(),\n      notes: `Senior override applied to all ${conflicts.length} conflicts`,\n    };\n  }\n\n  /**\n   * Strategy: AI Suggest\n   * Uses AI analysis to recommend best resolution\n   */\n  private async aiSuggestStrategy(\n    conflicts: MergeConflict[],\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): Promise<ConflictResolution> {\n    logger.info('Applying ai_suggest strategy');\n\n    // Analyze frames for quality and effectiveness\n    const analysis = await this.analyzeFrameQuality(stack1, stack2);\n\n    const strategy: ResolutionStrategy = {\n      type: 'ai_suggest',\n      confidence: context.aiConfidence || 0.85,\n      reasoning: this.generateAIReasoning(analysis),\n    };\n\n    // Apply AI recommendations to each conflict\n    for (const conflict of conflicts) {\n      const recommendation = this.getAIRecommendation(conflict, analysis);\n      conflict.resolution = {\n        strategy,\n        resolvedBy: 'ai_system',\n        resolvedAt: Date.now(),\n        notes: recommendation,\n      };\n    }\n\n    return {\n      strategy,\n      resolvedBy: 'ai_system',\n      resolvedAt: Date.now(),\n      notes: `AI analysis with ${strategy.confidence * 100}% confidence`,\n    };\n  }\n\n  /**\n   * Strategy: Hybrid\n   * Combines multiple strategies based on conflict type\n   */\n  private async hybridStrategy(\n    conflicts: MergeConflict[],\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): Promise<ConflictResolution> {\n    logger.info('Applying hybrid strategy');\n\n    const strategy: ResolutionStrategy = {\n      type: 'hybrid',\n      confidence: 0.9,\n      reasoning: 'Using optimal strategy for each conflict type',\n    };\n\n    // Apply different strategies based on conflict type\n    for (const conflict of conflicts) {\n      let subStrategy: ResolutionStrategy['type'];\n\n      switch (conflict.type) {\n        case 'parallel_solution':\n          // Keep both for parallel solutions\n          subStrategy = 'keep_both';\n          break;\n\n        case 'conflicting_decision':\n          // Use AI for decision conflicts\n          subStrategy = 'ai_suggest';\n          break;\n\n        case 'structural_divergence':\n          // Use senior override for structural issues\n          subStrategy =\n            context.userRole === 'senior' || context.userRole === 'lead'\n              ? 'senior_override'\n              : 'team_vote';\n          break;\n\n        default:\n          subStrategy = 'ai_suggest';\n      }\n\n      conflict.resolution = {\n        strategy: {\n          ...strategy,\n          reasoning: `${subStrategy} for ${conflict.type}`,\n        },\n        resolvedBy: context.userId,\n        resolvedAt: Date.now(),\n        notes: `Hybrid resolution using ${subStrategy}`,\n      };\n    }\n\n    return {\n      strategy,\n      resolvedBy: context.userId,\n      resolvedAt: Date.now(),\n      notes: `Hybrid strategy optimized for each conflict type`,\n    };\n  }\n\n  /**\n   * Execute the merge based on resolution\n   */\n  private async executeMerge(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[],\n    resolution: ConflictResolution\n  ): Promise<MergeResult> {\n    const mergedFrameId = uuidv4();\n    const rollbackPoint = this.createRollbackPoint(stack1, stack2);\n    const notifications: NotificationResult[] = [];\n\n    try {\n      // Create merged frame stack\n      const mergedFrames = this.mergeFrames(\n        stack1,\n        stack2,\n        conflicts,\n        resolution\n      );\n\n      // Validate merge integrity\n      const isValid = this.validateMerge(mergedFrames, conflicts);\n\n      if (!isValid) {\n        throw new Error('Merge validation failed');\n      }\n\n      // Send notifications\n      const notifyResults = await this.sendNotifications(conflicts, resolution);\n      notifications.push(...notifyResults);\n\n      logger.info('Merge executed successfully', {\n        mergedFrameId,\n        frameCount: mergedFrames.length,\n        strategy: resolution.strategy.type,\n      });\n\n      return {\n        success: true,\n        mergedFrameId,\n        conflicts,\n        resolution,\n        rollbackPoint,\n        notifications,\n      };\n    } catch (error: unknown) {\n      logger.error('Merge execution failed', error as Error);\n\n      return {\n        success: false,\n        conflicts,\n        resolution,\n        rollbackPoint,\n        notifications,\n      };\n    }\n  }\n\n  /**\n   * Count votes from team members\n   */\n  private countVotes(votes: TeamVote[]): {\n    frame1: number;\n    frame2: number;\n    both: number;\n    neither: number;\n    total: number;\n    consensus: number;\n  } {\n    const counts = {\n      frame1: 0,\n      frame2: 0,\n      both: 0,\n      neither: 0,\n      total: votes.length,\n      consensus: 0,\n    };\n\n    for (const vote of votes) {\n      counts[vote.choice]++;\n    }\n\n    // Calculate consensus percentage\n    const maxVotes = Math.max(\n      counts.frame1,\n      counts.frame2,\n      counts.both,\n      counts.neither\n    );\n    counts.consensus = Math.round((maxVotes / counts.total) * 100);\n\n    return counts;\n  }\n\n  /**\n   * Calculate confidence based on vote distribution\n   */\n  private calculateVoteConfidence(voteResults: { consensus: number }): number {\n    // High confidence if strong consensus\n    if (voteResults.consensus >= 80) return 0.95;\n    if (voteResults.consensus >= 60) return 0.75;\n    if (voteResults.consensus >= 40) return 0.5;\n    return 0.3;\n  }\n\n  /**\n   * Determine winner from vote results\n   */\n  private determineVoteWinner(\n    conflict: MergeConflict,\n    voteResults: {\n      frame1: number;\n      frame2: number;\n      both: number;\n      neither: number;\n    }\n  ): string {\n    if (voteResults.frame1 > voteResults.frame2) return conflict.frameId1;\n    if (voteResults.frame2 > voteResults.frame1) return conflict.frameId2;\n    if (voteResults.both > voteResults.neither) return 'both';\n    return 'neither';\n  }\n\n  /**\n   * Determine preferred stack for senior override\n   */\n  private determinePreferredStack(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    context: ResolutionContext\n  ): FrameStack {\n    // Check if senior owns one of the stacks\n    if (stack1.owner === context.userId) return stack1;\n    if (stack2.owner === context.userId) return stack2;\n\n    // Otherwise, prefer more recent/complete stack\n    if (stack1.lastModified > stack2.lastModified) return stack1;\n    if (\n      stack2.frames.filter((f) => f.state === 'closed').length >\n      stack1.frames.filter((f) => f.state === 'closed').length\n    ) {\n      return stack2;\n    }\n\n    return stack1;\n  }\n\n  /**\n   * Analyze frame quality for AI suggestions\n   */\n  private async analyzeFrameQuality(\n    stack1: FrameStack,\n    stack2: FrameStack\n  ): Promise<{\n    stack1: { completeness: number; efficiency: number; quality: number };\n    stack2: { completeness: number; efficiency: number; quality: number };\n  }> {\n    const analysis = {\n      stack1: {\n        completeness: this.calculateCompleteness(stack1),\n        efficiency: this.calculateEfficiency(stack1),\n        quality: this.calculateQuality(stack1),\n      },\n      stack2: {\n        completeness: this.calculateCompleteness(stack2),\n        efficiency: this.calculateEfficiency(stack2),\n        quality: this.calculateQuality(stack2),\n      },\n    };\n\n    return analysis;\n  }\n\n  /**\n   * Calculate stack completeness\n   */\n  private calculateCompleteness(stack: FrameStack): number {\n    const closedFrames = stack.frames.filter(\n      (f) => f.state === 'closed'\n    ).length;\n    return closedFrames / stack.frames.length;\n  }\n\n  /**\n   * Calculate stack efficiency\n   */\n  private calculateEfficiency(stack: FrameStack): number {\n    let totalDuration = 0;\n    let completedFrames = 0;\n\n    for (const frame of stack.frames) {\n      if (frame.closed_at && frame.created_at) {\n        totalDuration += frame.closed_at - frame.created_at;\n        completedFrames++;\n      }\n    }\n\n    if (completedFrames === 0) return 0;\n\n    const avgDuration = totalDuration / completedFrames;\n    // Normalize: 5 minutes = 1.0, longer = lower score\n    return Math.max(0, Math.min(1, 300000 / avgDuration));\n  }\n\n  /**\n   * Calculate stack quality\n   */\n  private calculateQuality(stack: FrameStack): number {\n    let qualityScore = 0;\n\n    for (const frame of stack.frames) {\n      if (frame.outputs && Object.keys(frame.outputs).length > 0)\n        qualityScore += 0.3;\n      if (frame.digest_text) qualityScore += 0.3;\n      if (frame.state === 'closed') qualityScore += 0.4;\n    }\n\n    return Math.min(1, qualityScore / stack.frames.length);\n  }\n\n  /**\n   * Generate AI reasoning for resolution\n   */\n  private generateAIReasoning(analysis: {\n    stack1: { completeness: number; efficiency: number; quality: number };\n    stack2: { completeness: number; efficiency: number; quality: number };\n  }): string {\n    const stack1Score =\n      analysis.stack1.completeness * 0.3 +\n      analysis.stack1.efficiency * 0.3 +\n      analysis.stack1.quality * 0.4;\n\n    const stack2Score =\n      analysis.stack2.completeness * 0.3 +\n      analysis.stack2.efficiency * 0.3 +\n      analysis.stack2.quality * 0.4;\n\n    if (stack1Score > stack2Score) {\n      return `Stack 1 shows higher overall quality (${(stack1Score * 100).toFixed(1)}% vs ${(stack2Score * 100).toFixed(1)}%)`;\n    } else {\n      return `Stack 2 shows higher overall quality (${(stack2Score * 100).toFixed(1)}% vs ${(stack1Score * 100).toFixed(1)}%)`;\n    }\n  }\n\n  /**\n   * Get AI recommendation for specific conflict\n   */\n  private getAIRecommendation(conflict: MergeConflict): string {\n    switch (conflict.type) {\n      case 'parallel_solution':\n        return 'Recommend keeping both solutions for A/B testing';\n\n      case 'conflicting_decision':\n        return 'Recommend the decision with higher quality score';\n\n      case 'structural_divergence':\n        return 'Recommend restructuring to accommodate both approaches';\n\n      default:\n        return 'Recommend manual review for this conflict';\n    }\n  }\n\n  /**\n   * Create rollback point before merge\n   */\n  private createRollbackPoint(\n    _stack1: FrameStack,\n    _stack2: FrameStack\n  ): string {\n    const rollbackId = uuidv4();\n\n    // Store current state for rollback (would persist in real implementation)\n\n    // In real implementation, persist this to database\n    logger.info('Created rollback point', { rollbackId });\n\n    return rollbackId;\n  }\n\n  /**\n   * Merge frames based on resolution\n   */\n  private mergeFrames(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[],\n    resolution: ConflictResolution\n  ): Frame[] {\n    const mergedFrames: Frame[] = [];\n    const processedIds = new Set<string>();\n\n    // Process based on resolution strategy\n    switch (resolution.strategy.type) {\n      case 'keep_both':\n        // Add all frames from both stacks\n        mergedFrames.push(...stack1.frames, ...stack2.frames);\n        break;\n\n      case 'team_vote':\n      case 'senior_override':\n      case 'ai_suggest':\n        // Add frames based on resolution decisions\n        for (const frame of stack1.frames) {\n          const conflict = conflicts.find((c) => c.frameId1 === frame.frame_id);\n          if (!conflict || conflict.resolution?.strategy.type === 'keep_both') {\n            mergedFrames.push(frame);\n            processedIds.add(frame.frame_id);\n          }\n        }\n\n        for (const frame of stack2.frames) {\n          if (!processedIds.has(frame.frame_id)) {\n            const conflict = conflicts.find(\n              (c) => c.frameId2 === frame.frame_id\n            );\n            if (\n              !conflict ||\n              conflict.resolution?.strategy.type === 'keep_both'\n            ) {\n              mergedFrames.push(frame);\n            }\n          }\n        }\n        break;\n\n      case 'hybrid':\n        // Complex merging based on conflict types\n        this.hybridMerge(stack1, stack2, conflicts, mergedFrames);\n        break;\n    }\n\n    return mergedFrames;\n  }\n\n  /**\n   * Hybrid merge implementation\n   */\n  private hybridMerge(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[],\n    mergedFrames: Frame[]\n  ): void {\n    const conflictMap = new Map<string, MergeConflict>();\n\n    for (const conflict of conflicts) {\n      conflictMap.set(conflict.frameId1, conflict);\n      conflictMap.set(conflict.frameId2, conflict);\n    }\n\n    // Process each frame based on its conflict type\n    for (const frame of [...stack1.frames, ...stack2.frames]) {\n      const conflict = conflictMap.get(frame.frame_id);\n\n      if (!conflict) {\n        // No conflict, add frame\n        if (!mergedFrames.find((f) => f.frame_id === frame.frame_id)) {\n          mergedFrames.push(frame);\n        }\n      } else if (conflict.type === 'parallel_solution') {\n        // Keep both for parallel solutions\n        if (!mergedFrames.find((f) => f.frame_id === frame.frame_id)) {\n          mergedFrames.push(frame);\n        }\n      }\n      // Other conflict types handled by resolution\n    }\n  }\n\n  /**\n   * Validate merge integrity\n   */\n  private validateMerge(\n    mergedFrames: Frame[],\n    conflicts: MergeConflict[]\n  ): boolean {\n    // Check for duplicate frame IDs\n    const ids = new Set<string>();\n    for (const frame of mergedFrames) {\n      if (ids.has(frame.frame_id)) {\n        logger.error('Duplicate frame ID in merge', {\n          frameId: frame.frame_id,\n        });\n        return false;\n      }\n      ids.add(frame.frame_id);\n    }\n\n    // Check parent-child relationships\n    for (const frame of mergedFrames) {\n      if (frame.parent_frame_id) {\n        const parent = mergedFrames.find(\n          (f) => f.frame_id === frame.parent_frame_id\n        );\n        if (!parent) {\n          logger.warn('Orphaned frame in merge', { frameId: frame.frame_id });\n        }\n      }\n    }\n\n    // Check all conflicts have resolutions\n    for (const conflict of conflicts) {\n      if (!conflict.resolution) {\n        logger.error('Unresolved conflict in merge', {\n          conflictId: conflict.id,\n        });\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   * Send notifications about merge\n   */\n  private async sendNotifications(\n    conflicts: MergeConflict[],\n    resolution: ConflictResolution\n  ): Promise<NotificationResult[]> {\n    const notifications: NotificationResult[] = [];\n\n    // In real implementation, send actual notifications\n    // For now, simulate notification sending\n    const notification: NotificationResult = {\n      userId: resolution.resolvedBy || 'team',\n      type: 'in-app',\n      sent: true,\n      timestamp: Date.now(),\n    };\n\n    notifications.push(notification);\n\n    logger.info('Notifications sent', { count: notifications.length });\n\n    return notifications;\n  }\n\n  /**\n   * Store resolution in history\n   */\n  private storeResolution(\n    mergeId: string,\n    resolution: ConflictResolution\n  ): void {\n    this.resolutionHistory.set(mergeId, resolution);\n\n    // In real implementation, persist to database\n    logger.info('Resolution stored in history', {\n      mergeId,\n      strategy: resolution.strategy.type,\n    });\n  }\n\n  /**\n   * Get resolution history for analysis\n   */\n  getResolutionHistory(): Map<string, ConflictResolution> {\n    return this.resolutionHistory;\n  }\n}\n"],
   "mappings": ";;;;AAKA,SAAS,MAAM,cAAc;AAW7B,SAAS,wBAAwB;AACjC,SAAS,2BAA2B;AACpC,SAAS,cAAc;AAUhB,MAAM,iBAAiB;AAAA,EACpB;AAAA,EACA;AAAA,EACA,oBAAqD,oBAAI,IAAI;AAAA,EAErE,cAAc;AACZ,SAAK,mBAAmB,IAAI,iBAAiB;AAC7C,SAAK,iBAAiB,IAAI,oBAAoB;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,iBACJ,QACA,QACA,UACA,SACsB;AACtB,UAAM,YAAY,KAAK,iBAAiB,gBAAgB,QAAQ,MAAM;AAEtE,WAAO;AAAA,MACL,aAAa,UAAU,MAAM,oBAAoB,QAAQ;AAAA,MACzD;AAAA,QACE,QAAQ,QAAQ;AAAA,QAChB,UAAU,QAAQ;AAAA,MACpB;AAAA,IACF;AAEA,QAAI;AAEJ,YAAQ,UAAU;AAAA,MAChB,KAAK;AACH,qBAAa,MAAM,KAAK;AAAA,UACtB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA;AAAA,MAEF,KAAK;AACH,qBAAa,MAAM,KAAK;AAAA,UACtB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA;AAAA,MAEF,KAAK;AACH,qBAAa,MAAM,KAAK;AAAA,UACtB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA;AAAA,MAEF,KAAK;AACH,qBAAa,MAAM,KAAK;AAAA,UACtB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA;AAAA,MAEF,KAAK;AACH,qBAAa,MAAM,KAAK;AAAA,UACtB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA;AAAA,MAEF;AACE,cAAM,IAAI,MAAM,gCAAgC,QAAQ,EAAE;AAAA,IAC9D;AAGA,UAAM,cAAc,MAAM,KAAK;AAAA,MAC7B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAGA,SAAK,gBAAgB,YAAY,iBAAiB,IAAI,UAAU;AAEhE,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,iBACZ,WACA,QACA,QACA,SAC6B;AAC7B,WAAO,KAAK,6BAA6B;AAEzC,UAAM,WAA+B;AAAA,MACnC,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,WACE;AAAA,IACJ;AAGA,eAAW,YAAY,WAAW;AAChC,eAAS,aAAa;AAAA,QACpB;AAAA,QACA,YAAY,QAAQ;AAAA,QACpB,YAAY,KAAK,IAAI;AAAA,QACrB,OAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA,YAAY,QAAQ;AAAA,MACpB,YAAY,KAAK,IAAI;AAAA,MACrB,OAAO,YAAY,OAAO,OAAO,SAAS,OAAO,OAAO,MAAM;AAAA,IAChE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,iBACZ,WACA,QACA,QACA,SAC6B;AAC7B,WAAO,KAAK,6BAA6B;AAEzC,QAAI,CAAC,QAAQ,aAAa,QAAQ,UAAU,WAAW,GAAG;AACxD,YAAM,IAAI,MAAM,qDAAqD;AAAA,IACvE;AAGA,UAAM,cAAc,KAAK,WAAW,QAAQ,SAAS;AAErD,UAAM,WAA+B;AAAA,MACnC,MAAM;AAAA,MACN,YAAY,KAAK,wBAAwB,WAAW;AAAA,MACpD,WAAW,uBAAuB,QAAQ,UAAU,MAAM;AAAA,MAC1D,OAAO,QAAQ;AAAA,IACjB;AAGA,eAAW,YAAY,WAAW;AAChC,eAAS,aAAa;AAAA,QACpB;AAAA,QACA,YAAY;AAAA,QACZ,YAAY,KAAK,IAAI;AAAA,QACrB,OAAO,eAAe,YAAY,SAAS;AAAA,MAC7C;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA,YAAY;AAAA,MACZ,YAAY,KAAK,IAAI;AAAA,MACrB,OAAO,8BAA8B,YAAY,SAAS;AAAA,IAC5D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,uBACZ,WACA,QACA,QACA,SAC6B;AAC7B,WAAO,KAAK,mCAAmC;AAE/C,QAAI,QAAQ,aAAa,YAAY,QAAQ,aAAa,QAAQ;AAChE,YAAM,IAAI,MAAM,8CAA8C;AAAA,IAChE;AAGA,SAAK,wBAAwB,QAAQ,QAAQ,OAAO;AAEpD,UAAM,WAA+B;AAAA,MACnC,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,WAAW,qBAAqB,QAAQ,MAAM;AAAA,IAChD;AAEA,eAAW,YAAY,WAAW;AAChC,eAAS,aAAa;AAAA,QACpB;AAAA,QACA,YAAY,QAAQ;AAAA,QACpB,YAAY,KAAK,IAAI;AAAA,QACrB,OAAO,iBAAiB,QAAQ,QAAQ;AAAA,MAC1C;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA,YAAY,QAAQ;AAAA,MACpB,YAAY,KAAK,IAAI;AAAA,MACrB,OAAO,kCAAkC,UAAU,MAAM;AAAA,IAC3D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,kBACZ,WACA,QACA,QACA,SAC6B;AAC7B,WAAO,KAAK,8BAA8B;AAG1C,UAAM,WAAW,MAAM,KAAK,oBAAoB,QAAQ,MAAM;AAE9D,UAAM,WAA+B;AAAA,MACnC,MAAM;AAAA,MACN,YAAY,QAAQ,gBAAgB;AAAA,MACpC,WAAW,KAAK,oBAAoB,QAAQ;AAAA,IAC9C;AAGA,eAAW,YAAY,WAAW;AAChC,YAAM,iBAAiB,KAAK,oBAAoB,UAAU,QAAQ;AAClE,eAAS,aAAa;AAAA,QACpB;AAAA,QACA,YAAY;AAAA,QACZ,YAAY,KAAK,IAAI;AAAA,QACrB,OAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA,YAAY;AAAA,MACZ,YAAY,KAAK,IAAI;AAAA,MACrB,OAAO,oBAAoB,SAAS,aAAa,GAAG;AAAA,IACtD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,eACZ,WACA,QACA,QACA,SAC6B;AAC7B,WAAO,KAAK,0BAA0B;AAEtC,UAAM,WAA+B;AAAA,MACnC,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,WAAW;AAAA,IACb;AAGA,eAAW,YAAY,WAAW;AAChC,UAAI;AAEJ,cAAQ,SAAS,MAAM;AAAA,QACrB,KAAK;AAEH,wBAAc;AACd;AAAA,QAEF,KAAK;AAEH,wBAAc;AACd;AAAA,QAEF,KAAK;AAEH,wBACE,QAAQ,aAAa,YAAY,QAAQ,aAAa,SAClD,oBACA;AACN;AAAA,QAEF;AACE,wBAAc;AAAA,MAClB;AAEA,eAAS,aAAa;AAAA,QACpB,UAAU;AAAA,UACR,GAAG;AAAA,UACH,WAAW,GAAG,WAAW,QAAQ,SAAS,IAAI;AAAA,QAChD;AAAA,QACA,YAAY,QAAQ;AAAA,QACpB,YAAY,KAAK,IAAI;AAAA,QACrB,OAAO,2BAA2B,WAAW;AAAA,MAC/C;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA,YAAY,QAAQ;AAAA,MACpB,YAAY,KAAK,IAAI;AAAA,MACrB,OAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,aACZ,QACA,QACA,WACA,YACsB;AACtB,UAAM,gBAAgB,OAAO;AAC7B,UAAM,gBAAgB,KAAK,oBAAoB,QAAQ,MAAM;AAC7D,UAAM,gBAAsC,CAAC;AAE7C,QAAI;AAEF,YAAM,eAAe,KAAK;AAAA,QACxB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAGA,YAAM,UAAU,KAAK,cAAc,cAAc,SAAS;AAE1D,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,yBAAyB;AAAA,MAC3C;AAGA,YAAM,gBAAgB,MAAM,KAAK,kBAAkB,WAAW,UAAU;AACxE,oBAAc,KAAK,GAAG,aAAa;AAEnC,aAAO,KAAK,+BAA+B;AAAA,QACzC;AAAA,QACA,YAAY,aAAa;AAAA,QACzB,UAAU,WAAW,SAAS;AAAA,MAChC,CAAC;AAED,aAAO;AAAA,QACL,SAAS;AAAA,QACT;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,SAAS,OAAgB;AACvB,aAAO,MAAM,0BAA0B,KAAc;AAErD,aAAO;AAAA,QACL,SAAS;AAAA,QACT;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAW,OAOjB;AACA,UAAM,SAAS;AAAA,MACb,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,SAAS;AAAA,MACT,OAAO,MAAM;AAAA,MACb,WAAW;AAAA,IACb;AAEA,eAAW,QAAQ,OAAO;AACxB,aAAO,KAAK,MAAM;AAAA,IACpB;AAGA,UAAM,WAAW,KAAK;AAAA,MACpB,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,IACT;AACA,WAAO,YAAY,KAAK,MAAO,WAAW,OAAO,QAAS,GAAG;AAE7D,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,wBAAwB,aAA4C;AAE1E,QAAI,YAAY,aAAa,GAAI,QAAO;AACxC,QAAI,YAAY,aAAa,GAAI,QAAO;AACxC,QAAI,YAAY,aAAa,GAAI,QAAO;AACxC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,oBACN,UACA,aAMQ;AACR,QAAI,YAAY,SAAS,YAAY,OAAQ,QAAO,SAAS;AAC7D,QAAI,YAAY,SAAS,YAAY,OAAQ,QAAO,SAAS;AAC7D,QAAI,YAAY,OAAO,YAAY,QAAS,QAAO;AACnD,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,wBACN,QACA,QACA,SACY;AAEZ,QAAI,OAAO,UAAU,QAAQ,OAAQ,QAAO;AAC5C,QAAI,OAAO,UAAU,QAAQ,OAAQ,QAAO;AAG5C,QAAI,OAAO,eAAe,OAAO,aAAc,QAAO;AACtD,QACE,OAAO,OAAO,OAAO,CAAC,MAAM,EAAE,UAAU,QAAQ,EAAE,SAClD,OAAO,OAAO,OAAO,CAAC,MAAM,EAAE,UAAU,QAAQ,EAAE,QAClD;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,oBACZ,QACA,QAIC;AACD,UAAM,WAAW;AAAA,MACf,QAAQ;AAAA,QACN,cAAc,KAAK,sBAAsB,MAAM;AAAA,QAC/C,YAAY,KAAK,oBAAoB,MAAM;AAAA,QAC3C,SAAS,KAAK,iBAAiB,MAAM;AAAA,MACvC;AAAA,MACA,QAAQ;AAAA,QACN,cAAc,KAAK,sBAAsB,MAAM;AAAA,QAC/C,YAAY,KAAK,oBAAoB,MAAM;AAAA,QAC3C,SAAS,KAAK,iBAAiB,MAAM;AAAA,MACvC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,sBAAsB,OAA2B;AACvD,UAAM,eAAe,MAAM,OAAO;AAAA,MAChC,CAAC,MAAM,EAAE,UAAU;AAAA,IACrB,EAAE;AACF,WAAO,eAAe,MAAM,OAAO;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,OAA2B;AACrD,QAAI,gBAAgB;AACpB,QAAI,kBAAkB;AAEtB,eAAW,SAAS,MAAM,QAAQ;AAChC,UAAI,MAAM,aAAa,MAAM,YAAY;AACvC,yBAAiB,MAAM,YAAY,MAAM;AACzC;AAAA,MACF;AAAA,IACF;AAEA,QAAI,oBAAoB,EAAG,QAAO;AAElC,UAAM,cAAc,gBAAgB;AAEpC,WAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,MAAS,WAAW,CAAC;AAAA,EACtD;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,OAA2B;AAClD,QAAI,eAAe;AAEnB,eAAW,SAAS,MAAM,QAAQ;AAChC,UAAI,MAAM,WAAW,OAAO,KAAK,MAAM,OAAO,EAAE,SAAS;AACvD,wBAAgB;AAClB,UAAI,MAAM,YAAa,iBAAgB;AACvC,UAAI,MAAM,UAAU,SAAU,iBAAgB;AAAA,IAChD;AAEA,WAAO,KAAK,IAAI,GAAG,eAAe,MAAM,OAAO,MAAM;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,UAGjB;AACT,UAAM,cACJ,SAAS,OAAO,eAAe,MAC/B,SAAS,OAAO,aAAa,MAC7B,SAAS,OAAO,UAAU;AAE5B,UAAM,cACJ,SAAS,OAAO,eAAe,MAC/B,SAAS,OAAO,aAAa,MAC7B,SAAS,OAAO,UAAU;AAE5B,QAAI,cAAc,aAAa;AAC7B,aAAO,0CAA0C,cAAc,KAAK,QAAQ,CAAC,CAAC,SAAS,cAAc,KAAK,QAAQ,CAAC,CAAC;AAAA,IACtH,OAAO;AACL,aAAO,0CAA0C,cAAc,KAAK,QAAQ,CAAC,CAAC,SAAS,cAAc,KAAK,QAAQ,CAAC,CAAC;AAAA,IACtH;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,UAAiC;AAC3D,YAAQ,SAAS,MAAM;AAAA,MACrB,KAAK;AACH,eAAO;AAAA,MAET,KAAK;AACH,eAAO;AAAA,MAET,KAAK;AACH,eAAO;AAAA,MAET;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBACN,SACA,SACQ;AACR,UAAM,aAAa,OAAO;AAK1B,WAAO,KAAK,0BAA0B,EAAE,WAAW,CAAC;AAEpD,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,YACN,QACA,QACA,WACA,YACS;AACT,UAAM,eAAwB,CAAC;AAC/B,UAAM,eAAe,oBAAI,IAAY;AAGrC,YAAQ,WAAW,SAAS,MAAM;AAAA,MAChC,KAAK;AAEH,qBAAa,KAAK,GAAG,OAAO,QAAQ,GAAG,OAAO,MAAM;AACpD;AAAA,MAEF,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAEH,mBAAW,SAAS,OAAO,QAAQ;AACjC,gBAAM,WAAW,UAAU,KAAK,CAAC,MAAM,EAAE,aAAa,MAAM,QAAQ;AACpE,cAAI,CAAC,YAAY,SAAS,YAAY,SAAS,SAAS,aAAa;AACnE,yBAAa,KAAK,KAAK;AACvB,yBAAa,IAAI,MAAM,QAAQ;AAAA,UACjC;AAAA,QACF;AAEA,mBAAW,SAAS,OAAO,QAAQ;AACjC,cAAI,CAAC,aAAa,IAAI,MAAM,QAAQ,GAAG;AACrC,kBAAM,WAAW,UAAU;AAAA,cACzB,CAAC,MAAM,EAAE,aAAa,MAAM;AAAA,YAC9B;AACA,gBACE,CAAC,YACD,SAAS,YAAY,SAAS,SAAS,aACvC;AACA,2BAAa,KAAK,KAAK;AAAA,YACzB;AAAA,UACF;AAAA,QACF;AACA;AAAA,MAEF,KAAK;AAEH,aAAK,YAAY,QAAQ,QAAQ,WAAW,YAAY;AACxD;AAAA,IACJ;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,YACN,QACA,QACA,WACA,cACM;AACN,UAAM,cAAc,oBAAI,IAA2B;AAEnD,eAAW,YAAY,WAAW;AAChC,kBAAY,IAAI,SAAS,UAAU,QAAQ;AAC3C,kBAAY,IAAI,SAAS,UAAU,QAAQ;AAAA,IAC7C;AAGA,eAAW,SAAS,CAAC,GAAG,OAAO,QAAQ,GAAG,OAAO,MAAM,GAAG;AACxD,YAAM,WAAW,YAAY,IAAI,MAAM,QAAQ;AAE/C,UAAI,CAAC,UAAU;AAEb,YAAI,CAAC,aAAa,KAAK,CAAC,MAAM,EAAE,aAAa,MAAM,QAAQ,GAAG;AAC5D,uBAAa,KAAK,KAAK;AAAA,QACzB;AAAA,MACF,WAAW,SAAS,SAAS,qBAAqB;AAEhD,YAAI,CAAC,aAAa,KAAK,CAAC,MAAM,EAAE,aAAa,MAAM,QAAQ,GAAG;AAC5D,uBAAa,KAAK,KAAK;AAAA,QACzB;AAAA,MACF;AAAA,IAEF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,cACN,cACA,WACS;AAET,UAAM,MAAM,oBAAI,IAAY;AAC5B,eAAW,SAAS,cAAc;AAChC,UAAI,IAAI,IAAI,MAAM,QAAQ,GAAG;AAC3B,eAAO,MAAM,+BAA+B;AAAA,UAC1C,SAAS,MAAM;AAAA,QACjB,CAAC;AACD,eAAO;AAAA,MACT;AACA,UAAI,IAAI,MAAM,QAAQ;AAAA,IACxB;AAGA,eAAW,SAAS,cAAc;AAChC,UAAI,MAAM,iBAAiB;AACzB,cAAM,SAAS,aAAa;AAAA,UAC1B,CAAC,MAAM,EAAE,aAAa,MAAM;AAAA,QAC9B;AACA,YAAI,CAAC,QAAQ;AACX,iBAAO,KAAK,2BAA2B,EAAE,SAAS,MAAM,SAAS,CAAC;AAAA,QACpE;AAAA,MACF;AAAA,IACF;AAGA,eAAW,YAAY,WAAW;AAChC,UAAI,CAAC,SAAS,YAAY;AACxB,eAAO,MAAM,gCAAgC;AAAA,UAC3C,YAAY,SAAS;AAAA,QACvB,CAAC;AACD,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,kBACZ,WACA,YAC+B;AAC/B,UAAM,gBAAsC,CAAC;AAI7C,UAAM,eAAmC;AAAA,MACvC,QAAQ,WAAW,cAAc;AAAA,MACjC,MAAM;AAAA,MACN,MAAM;AAAA,MACN,WAAW,KAAK,IAAI;AAAA,IACtB;AAEA,kBAAc,KAAK,YAAY;AAE/B,WAAO,KAAK,sBAAsB,EAAE,OAAO,cAAc,OAAO,CAAC;AAEjE,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,SACA,YACM;AACN,SAAK,kBAAkB,IAAI,SAAS,UAAU;AAG9C,WAAO,KAAK,gCAAgC;AAAA,MAC1C;AAAA,MACA,UAAU,WAAW,SAAS;AAAA,IAChC,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,uBAAwD;AACtD,WAAO,KAAK;AAAA,EACd;AACF;",
   "names": []
 }

package/dist/core/merge/stack-diff.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/core/merge/stack-diff.ts"],
-  "sourcesContent": ["/**\n * Stack Diff Visualizer\n * Creates visual representations of frame stack divergence\n */\n\nimport {\n  StackDiff,\n  FrameStack,\n  DiffTree,\n  DiffNode,\n  DiffEdge,\n  MergeConflict,\n} from './types.js';\nimport { Frame } from '../context/frame-manager.js';\nimport { ConflictDetector } from './conflict-detector.js';\n\nexport interface VisualMarker {\n  frameId: string;\n  type: 'added' | 'removed' | 'modified' | 'conflict';\n  color: string;\n  symbol: string;\n  description: string;\n}\n\nexport interface PreviewResult {\n  mergedFrames: Frame[];\n  keptFromStack1: string[];\n  keptFromStack2: string[];\n  conflicts: MergeConflict[];\n  estimatedSuccess: number;\n}\n\nexport class StackDiffVisualizer {\n  private conflictDetector: ConflictDetector;\n\n  constructor() {\n    this.conflictDetector = new ConflictDetector();\n  }\n\n  /**\n   * Visualize divergence between two frame stacks\n   */\n  visualizeDivergence(\n    baseFrame: Frame,\n    branch1: FrameStack,\n    branch2: FrameStack\n  ): DiffTree {\n    const nodes: DiffNode[] = [];\n    const edges: DiffEdge[] = [];\n\n    // Add base node\n    nodes.push({\n      id: baseFrame.frame_id,\n      type: 'common',\n      frame: baseFrame,\n      position: { x: 0, y: 0 },\n      metadata: { label: 'Common Ancestor' },\n    });\n\n    // Process branch 1\n    const branch1Nodes = this.processBranch(\n      branch1,\n      baseFrame.frame_id,\n      -100, // Left side\n      100\n    );\n    nodes.push(...branch1Nodes.nodes);\n    edges.push(...branch1Nodes.edges);\n\n    // Process branch 2\n    const branch2Nodes = this.processBranch(\n      branch2,\n      baseFrame.frame_id,\n      100, // Right side\n      100\n    );\n    nodes.push(...branch2Nodes.nodes);\n    edges.push(...branch2Nodes.edges);\n\n    // Detect and mark conflicts\n    const conflicts = this.conflictDetector.detectConflicts(branch1, branch2);\n    this.markConflicts(nodes, edges, conflicts);\n\n    return {\n      nodes,\n      edges,\n      layout: 'tree',\n    };\n  }\n\n  /**\n   * Render conflict markers for visualization\n   */\n  renderConflictMarkers(conflicts: MergeConflict[]): VisualMarker[] {\n    const markers: VisualMarker[] = [];\n\n    for (const conflict of conflicts) {\n      markers.push({\n        frameId: conflict.frameId1,\n        type: 'conflict',\n        color: this.getSeverityColor(conflict.severity),\n        symbol: this.getConflictSymbol(conflict.type),\n        description: conflict.description,\n      });\n\n      markers.push({\n        frameId: conflict.frameId2,\n        type: 'conflict',\n        color: this.getSeverityColor(conflict.severity),\n        symbol: this.getConflictSymbol(conflict.type),\n        description: conflict.description,\n      });\n    }\n\n    return markers;\n  }\n\n  /**\n   * Generate a merge preview based on resolution strategy\n   */\n  generateMergePreview(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    strategy:\n      | 'keep_both'\n      | 'team_vote'\n      | 'senior_override'\n      | 'ai_suggest'\n      | 'hybrid'\n  ): PreviewResult {\n    const mergedFrames: Frame[] = [];\n    const keptFromStack1: string[] = [];\n    const keptFromStack2: string[] = [];\n    const conflicts = this.conflictDetector.detectConflicts(stack1, stack2);\n\n    switch (strategy) {\n      case 'keep_both':\n        return this.previewKeepBoth(stack1, stack2, conflicts);\n\n      case 'team_vote':\n        return this.previewTeamVote(stack1, stack2, conflicts);\n\n      case 'senior_override':\n        return this.previewSeniorOverride(stack1, stack2, conflicts);\n\n      case 'ai_suggest':\n        return this.previewAISuggest(stack1, stack2, conflicts);\n\n      case 'hybrid':\n        return this.previewHybrid(stack1, stack2, conflicts);\n\n      default:\n        return {\n          mergedFrames,\n          keptFromStack1,\n          keptFromStack2,\n          conflicts,\n          estimatedSuccess: 0,\n        };\n    }\n  }\n\n  /**\n   * Create a stack diff comparison\n   */\n  createStackDiff(\n    baseFrameId: string,\n    stack1: FrameStack,\n    stack2: FrameStack\n  ): StackDiff {\n    const conflicts = this.conflictDetector.detectConflicts(stack1, stack2);\n    const divergencePoint = this.findDivergencePoint(stack1, stack2);\n    const commonAncestor = this.findCommonAncestor(stack1, stack2);\n\n    // Find base frame\n    const baseFrame =\n      stack1.frames.find((f) => f.frame_id === baseFrameId) ||\n      stack2.frames.find((f) => f.frame_id === baseFrameId);\n\n    const visualRepresentation = baseFrame\n      ? this.visualizeDivergence(baseFrame, stack1, stack2)\n      : undefined;\n\n    return {\n      baseFrame: baseFrameId,\n      branch1: stack1,\n      branch2: stack2,\n      divergencePoint,\n      conflicts,\n      commonAncestor,\n      visualRepresentation,\n    };\n  }\n\n  /**\n   * Process a branch for visualization\n   */\n  private processBranch(\n    stack: FrameStack,\n    parentId: string,\n    xOffset: number,\n    yStart: number\n  ): { nodes: DiffNode[]; edges: DiffEdge[] } {\n    const nodes: DiffNode[] = [];\n    const edges: DiffEdge[] = [];\n    let yPos = yStart;\n\n    // Find frames that are children of parent\n    const children = stack.frames.filter((f) => f.parent_frame_id === parentId);\n\n    for (const frame of children) {\n      // Add node\n      nodes.push({\n        id: frame.frame_id,\n        type: xOffset < 0 ? 'branch1' : 'branch2',\n        frame,\n        position: { x: xOffset, y: yPos },\n        metadata: {\n          branch: xOffset < 0 ? 'left' : 'right',\n          depth: frame.depth,\n        },\n      });\n\n      // Add edge from parent\n      edges.push({\n        source: parentId,\n        target: frame.frame_id,\n        type: 'parent',\n        weight: 1,\n      });\n\n      // Process children recursively\n      const childResults = this.processBranch(\n        stack,\n        frame.frame_id,\n        xOffset + (xOffset < 0 ? -50 : 50),\n        yPos + 100\n      );\n\n      nodes.push(...childResults.nodes);\n      edges.push(...childResults.edges);\n\n      yPos += 150;\n    }\n\n    return { nodes, edges };\n  }\n\n  /**\n   * Mark conflicts in the visualization\n   */\n  private markConflicts(\n    nodes: DiffNode[],\n    edges: DiffEdge[],\n    conflicts: MergeConflict[]\n  ): void {\n    for (const conflict of conflicts) {\n      // Mark conflicting nodes\n      const node1 = nodes.find((n) => n.id === conflict.frameId1);\n      const node2 = nodes.find((n) => n.id === conflict.frameId2);\n\n      if (node1) {\n        node1.type = 'conflict';\n        node1.metadata = {\n          ...node1.metadata,\n          conflictType: conflict.type,\n          severity: conflict.severity,\n        };\n      }\n\n      if (node2) {\n        node2.type = 'conflict';\n        node2.metadata = {\n          ...node2.metadata,\n          conflictType: conflict.type,\n          severity: conflict.severity,\n        };\n      }\n\n      // Add conflict edge\n      if (node1 && node2) {\n        edges.push({\n          source: conflict.frameId1,\n          target: conflict.frameId2,\n          type: 'conflict',\n          weight: this.getSeverityWeight(conflict.severity),\n        });\n      }\n    }\n  }\n\n  /**\n   * Get color for severity level\n   */\n  private getSeverityColor(severity: string): string {\n    switch (severity) {\n      case 'critical':\n        return '#ff0000';\n      case 'high':\n        return '#ff6600';\n      case 'medium':\n        return '#ffaa00';\n      case 'low':\n        return '#ffdd00';\n      default:\n        return '#888888';\n    }\n  }\n\n  /**\n   * Get symbol for conflict type\n   */\n  private getConflictSymbol(type: string): string {\n    switch (type) {\n      case 'parallel_solution':\n        return '\u26A1';\n      case 'conflicting_decision':\n        return '\u26A0\uFE0F';\n      case 'structural_divergence':\n        return '\uD83D\uDD00';\n      default:\n        return '\u2753';\n    }\n  }\n\n  /**\n   * Get weight for severity level\n   */\n  private getSeverityWeight(severity: string): number {\n    switch (severity) {\n      case 'critical':\n        return 4;\n      case 'high':\n        return 3;\n      case 'medium':\n        return 2;\n      case 'low':\n        return 1;\n      default:\n        return 0;\n    }\n  }\n\n  /**\n   * Preview keep both strategy\n   */\n  private previewKeepBoth(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[]\n  ): PreviewResult {\n    const mergedFrames: Frame[] = [];\n    const keptFromStack1: string[] = [];\n    const keptFromStack2: string[] = [];\n\n    // Keep all frames from both stacks\n    for (const frame of stack1.frames) {\n      mergedFrames.push(frame);\n      keptFromStack1.push(frame.frame_id);\n    }\n\n    for (const frame of stack2.frames) {\n      // Only add if not already present\n      if (!mergedFrames.find((f) => f.frame_id === frame.frame_id)) {\n        mergedFrames.push(frame);\n        keptFromStack2.push(frame.frame_id);\n      }\n    }\n\n    // Success depends on conflict severity\n    const criticalConflicts = conflicts.filter(\n      (c) => c.severity === 'critical'\n    ).length;\n    const estimatedSuccess = Math.max(0, 1 - criticalConflicts * 0.2);\n\n    return {\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2,\n      conflicts,\n      estimatedSuccess,\n    };\n  }\n\n  /**\n   * Preview team vote strategy\n   */\n  private previewTeamVote(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[]\n  ): PreviewResult {\n    // Simulate team voting - for preview, assume 50/50 split\n    const mergedFrames: Frame[] = [];\n    const keptFromStack1: string[] = [];\n    const keptFromStack2: string[] = [];\n\n    // Add non-conflicting frames from both\n    const conflictingFrameIds = new Set<string>();\n    for (const conflict of conflicts) {\n      conflictingFrameIds.add(conflict.frameId1);\n      conflictingFrameIds.add(conflict.frameId2);\n    }\n\n    for (const frame of stack1.frames) {\n      if (!conflictingFrameIds.has(frame.frame_id)) {\n        mergedFrames.push(frame);\n        keptFromStack1.push(frame.frame_id);\n      }\n    }\n\n    for (const frame of stack2.frames) {\n      if (\n        !conflictingFrameIds.has(frame.frame_id) &&\n        !mergedFrames.find((f) => f.frame_id === frame.frame_id)\n      ) {\n        mergedFrames.push(frame);\n        keptFromStack2.push(frame.frame_id);\n      }\n    }\n\n    // For conflicts, alternate between stacks (simulating vote)\n    let useStack1 = true;\n    for (const conflict of conflicts) {\n      if (useStack1) {\n        const frame = stack1.frames.find(\n          (f) => f.frame_id === conflict.frameId1\n        );\n        if (frame) {\n          mergedFrames.push(frame);\n          keptFromStack1.push(frame.frame_id);\n        }\n      } else {\n        const frame = stack2.frames.find(\n          (f) => f.frame_id === conflict.frameId2\n        );\n        if (frame) {\n          mergedFrames.push(frame);\n          keptFromStack2.push(frame.frame_id);\n        }\n      }\n      useStack1 = !useStack1;\n    }\n\n    return {\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2,\n      conflicts,\n      estimatedSuccess: 0.75, // Team consensus usually works well\n    };\n  }\n\n  /**\n   * Preview senior override strategy\n   */\n  private previewSeniorOverride(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[]\n  ): PreviewResult {\n    // Assume stack1 is senior developer's work\n    const mergedFrames = [...stack1.frames];\n    const keptFromStack1 = stack1.frames.map((f) => f.frame_id);\n    const keptFromStack2: string[] = [];\n\n    // Add non-conflicting frames from stack2\n    const stack1Ids = new Set(keptFromStack1);\n    for (const frame of stack2.frames) {\n      const hasConflict = conflicts.some((c) => c.frameId2 === frame.frame_id);\n\n      if (!hasConflict && !stack1Ids.has(frame.frame_id)) {\n        mergedFrames.push(frame);\n        keptFromStack2.push(frame.frame_id);\n      }\n    }\n\n    return {\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2,\n      conflicts,\n      estimatedSuccess: 0.85, // Senior override is usually reliable\n    };\n  }\n\n  /**\n   * Preview AI suggest strategy\n   */\n  private previewAISuggest(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[]\n  ): PreviewResult {\n    const mergedFrames: Frame[] = [];\n    const keptFromStack1: string[] = [];\n    const keptFromStack2: string[] = [];\n\n    // AI would analyze effectiveness - simulate with heuristics\n    for (const conflict of conflicts) {\n      const frame1 = stack1.frames.find(\n        (f) => f.frame_id === conflict.frameId1\n      );\n      const frame2 = stack2.frames.find(\n        (f) => f.frame_id === conflict.frameId2\n      );\n\n      if (frame1 && frame2) {\n        // Choose based on completion and output quality\n        const score1 = this.scoreFrame(frame1);\n        const score2 = this.scoreFrame(frame2);\n\n        if (score1 >= score2) {\n          mergedFrames.push(frame1);\n          keptFromStack1.push(frame1.frame_id);\n        } else {\n          mergedFrames.push(frame2);\n          keptFromStack2.push(frame2.frame_id);\n        }\n      }\n    }\n\n    // Add non-conflicting frames\n    this.addNonConflictingFrames(\n      stack1,\n      stack2,\n      conflicts,\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2\n    );\n\n    return {\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2,\n      conflicts,\n      estimatedSuccess: 0.9, // AI suggestions are usually optimal\n    };\n  }\n\n  /**\n   * Preview hybrid strategy\n   */\n  private previewHybrid(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[]\n  ): PreviewResult {\n    const mergedFrames: Frame[] = [];\n    const keptFromStack1: string[] = [];\n    const keptFromStack2: string[] = [];\n\n    // Hybrid: Use different strategies based on conflict type\n    for (const conflict of conflicts) {\n      if (conflict.type === 'parallel_solution') {\n        // Keep both for parallel solutions\n        const frame1 = stack1.frames.find(\n          (f) => f.frame_id === conflict.frameId1\n        );\n        const frame2 = stack2.frames.find(\n          (f) => f.frame_id === conflict.frameId2\n        );\n\n        if (frame1) {\n          mergedFrames.push(frame1);\n          keptFromStack1.push(frame1.frame_id);\n        }\n        if (frame2) {\n          mergedFrames.push(frame2);\n          keptFromStack2.push(frame2.frame_id);\n        }\n      } else if (conflict.type === 'conflicting_decision') {\n        // Use AI for decisions\n        const frame1 = stack1.frames.find(\n          (f) => f.frame_id === conflict.frameId1\n        );\n        const frame2 = stack2.frames.find(\n          (f) => f.frame_id === conflict.frameId2\n        );\n\n        if (frame1 && frame2) {\n          const score1 = this.scoreFrame(frame1);\n          const score2 = this.scoreFrame(frame2);\n\n          if (score1 >= score2) {\n            mergedFrames.push(frame1);\n            keptFromStack1.push(frame1.frame_id);\n          } else {\n            mergedFrames.push(frame2);\n            keptFromStack2.push(frame2.frame_id);\n          }\n        }\n      } else {\n        // Use senior override for structural divergence\n        const frame1 = stack1.frames.find(\n          (f) => f.frame_id === conflict.frameId1\n        );\n        if (frame1) {\n          mergedFrames.push(frame1);\n          keptFromStack1.push(frame1.frame_id);\n        }\n      }\n    }\n\n    // Add non-conflicting frames\n    this.addNonConflictingFrames(\n      stack1,\n      stack2,\n      conflicts,\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2\n    );\n\n    return {\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2,\n      conflicts,\n      estimatedSuccess: 0.88, // Hybrid is very effective\n    };\n  }\n\n  /**\n   * Score a frame for quality\n   */\n  private scoreFrame(frame: Frame): number {\n    let score = 0;\n\n    if (frame.state === 'closed') score += 0.3;\n    if (frame.outputs && Object.keys(frame.outputs).length > 0) score += 0.2;\n    if (frame.digest_text) score += 0.2;\n    if (frame.closed_at && frame.created_at) {\n      const duration = frame.closed_at - frame.created_at;\n      if (duration < 600000) score += 0.3; // Less than 10 minutes\n    }\n\n    return score;\n  }\n\n  /**\n   * Add non-conflicting frames to merge\n   */\n  private addNonConflictingFrames(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[],\n    mergedFrames: Frame[],\n    keptFromStack1: string[],\n    keptFromStack2: string[]\n  ): void {\n    const conflictingIds = new Set<string>();\n    const mergedIds = new Set<string>(mergedFrames.map((f) => f.frame_id));\n\n    for (const conflict of conflicts) {\n      conflictingIds.add(conflict.frameId1);\n      conflictingIds.add(conflict.frameId2);\n    }\n\n    for (const frame of stack1.frames) {\n      if (\n        !conflictingIds.has(frame.frame_id) &&\n        !mergedIds.has(frame.frame_id)\n      ) {\n        mergedFrames.push(frame);\n        keptFromStack1.push(frame.frame_id);\n        mergedIds.add(frame.frame_id);\n      }\n    }\n\n    for (const frame of stack2.frames) {\n      if (\n        !conflictingIds.has(frame.frame_id) &&\n        !mergedIds.has(frame.frame_id)\n      ) {\n        mergedFrames.push(frame);\n        keptFromStack2.push(frame.frame_id);\n        mergedIds.add(frame.frame_id);\n      }\n    }\n  }\n\n  /**\n   * Find divergence point between stacks\n   */\n  private findDivergencePoint(stack1: FrameStack, stack2: FrameStack): number {\n    const events1 = stack1.events.sort((a, b) => a.ts - b.ts);\n    const events2 = stack2.events.sort((a, b) => a.ts - b.ts);\n\n    for (let i = 0; i < Math.min(events1.length, events2.length); i++) {\n      if (events1[i].event_id !== events2[i].event_id) {\n        return events1[i].ts;\n      }\n    }\n\n    return Math.min(\n      events1[events1.length - 1]?.ts || 0,\n      events2[events2.length - 1]?.ts || 0\n    );\n  }\n\n  /**\n   * Find common ancestor frame\n   */\n  private findCommonAncestor(\n    stack1: FrameStack,\n    stack2: FrameStack\n  ): string | undefined {\n    const frames1 = new Set(stack1.frames.map((f) => f.frame_id));\n\n    // Find the deepest common frame\n    let deepestCommon: Frame | undefined;\n    let maxDepth = -1;\n\n    for (const frame of stack2.frames) {\n      if (frames1.has(frame.frame_id) && frame.depth > maxDepth) {\n        deepestCommon = frame;\n        maxDepth = frame.depth;\n      }\n    }\n\n    return deepestCommon?.frame_id;\n  }\n}\n"],
+  "sourcesContent": ["/**\n * Stack Diff Visualizer\n * Creates visual representations of frame stack divergence\n */\n\nimport {\n  StackDiff,\n  FrameStack,\n  DiffTree,\n  DiffNode,\n  DiffEdge,\n  MergeConflict,\n} from './types.js';\nimport { Frame } from '../context/index.js';\nimport { ConflictDetector } from './conflict-detector.js';\n\nexport interface VisualMarker {\n  frameId: string;\n  type: 'added' | 'removed' | 'modified' | 'conflict';\n  color: string;\n  symbol: string;\n  description: string;\n}\n\nexport interface PreviewResult {\n  mergedFrames: Frame[];\n  keptFromStack1: string[];\n  keptFromStack2: string[];\n  conflicts: MergeConflict[];\n  estimatedSuccess: number;\n}\n\nexport class StackDiffVisualizer {\n  private conflictDetector: ConflictDetector;\n\n  constructor() {\n    this.conflictDetector = new ConflictDetector();\n  }\n\n  /**\n   * Visualize divergence between two frame stacks\n   */\n  visualizeDivergence(\n    baseFrame: Frame,\n    branch1: FrameStack,\n    branch2: FrameStack\n  ): DiffTree {\n    const nodes: DiffNode[] = [];\n    const edges: DiffEdge[] = [];\n\n    // Add base node\n    nodes.push({\n      id: baseFrame.frame_id,\n      type: 'common',\n      frame: baseFrame,\n      position: { x: 0, y: 0 },\n      metadata: { label: 'Common Ancestor' },\n    });\n\n    // Process branch 1\n    const branch1Nodes = this.processBranch(\n      branch1,\n      baseFrame.frame_id,\n      -100, // Left side\n      100\n    );\n    nodes.push(...branch1Nodes.nodes);\n    edges.push(...branch1Nodes.edges);\n\n    // Process branch 2\n    const branch2Nodes = this.processBranch(\n      branch2,\n      baseFrame.frame_id,\n      100, // Right side\n      100\n    );\n    nodes.push(...branch2Nodes.nodes);\n    edges.push(...branch2Nodes.edges);\n\n    // Detect and mark conflicts\n    const conflicts = this.conflictDetector.detectConflicts(branch1, branch2);\n    this.markConflicts(nodes, edges, conflicts);\n\n    return {\n      nodes,\n      edges,\n      layout: 'tree',\n    };\n  }\n\n  /**\n   * Render conflict markers for visualization\n   */\n  renderConflictMarkers(conflicts: MergeConflict[]): VisualMarker[] {\n    const markers: VisualMarker[] = [];\n\n    for (const conflict of conflicts) {\n      markers.push({\n        frameId: conflict.frameId1,\n        type: 'conflict',\n        color: this.getSeverityColor(conflict.severity),\n        symbol: this.getConflictSymbol(conflict.type),\n        description: conflict.description,\n      });\n\n      markers.push({\n        frameId: conflict.frameId2,\n        type: 'conflict',\n        color: this.getSeverityColor(conflict.severity),\n        symbol: this.getConflictSymbol(conflict.type),\n        description: conflict.description,\n      });\n    }\n\n    return markers;\n  }\n\n  /**\n   * Generate a merge preview based on resolution strategy\n   */\n  generateMergePreview(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    strategy:\n      | 'keep_both'\n      | 'team_vote'\n      | 'senior_override'\n      | 'ai_suggest'\n      | 'hybrid'\n  ): PreviewResult {\n    const mergedFrames: Frame[] = [];\n    const keptFromStack1: string[] = [];\n    const keptFromStack2: string[] = [];\n    const conflicts = this.conflictDetector.detectConflicts(stack1, stack2);\n\n    switch (strategy) {\n      case 'keep_both':\n        return this.previewKeepBoth(stack1, stack2, conflicts);\n\n      case 'team_vote':\n        return this.previewTeamVote(stack1, stack2, conflicts);\n\n      case 'senior_override':\n        return this.previewSeniorOverride(stack1, stack2, conflicts);\n\n      case 'ai_suggest':\n        return this.previewAISuggest(stack1, stack2, conflicts);\n\n      case 'hybrid':\n        return this.previewHybrid(stack1, stack2, conflicts);\n\n      default:\n        return {\n          mergedFrames,\n          keptFromStack1,\n          keptFromStack2,\n          conflicts,\n          estimatedSuccess: 0,\n        };\n    }\n  }\n\n  /**\n   * Create a stack diff comparison\n   */\n  createStackDiff(\n    baseFrameId: string,\n    stack1: FrameStack,\n    stack2: FrameStack\n  ): StackDiff {\n    const conflicts = this.conflictDetector.detectConflicts(stack1, stack2);\n    const divergencePoint = this.findDivergencePoint(stack1, stack2);\n    const commonAncestor = this.findCommonAncestor(stack1, stack2);\n\n    // Find base frame\n    const baseFrame =\n      stack1.frames.find((f) => f.frame_id === baseFrameId) ||\n      stack2.frames.find((f) => f.frame_id === baseFrameId);\n\n    const visualRepresentation = baseFrame\n      ? this.visualizeDivergence(baseFrame, stack1, stack2)\n      : undefined;\n\n    return {\n      baseFrame: baseFrameId,\n      branch1: stack1,\n      branch2: stack2,\n      divergencePoint,\n      conflicts,\n      commonAncestor,\n      visualRepresentation,\n    };\n  }\n\n  /**\n   * Process a branch for visualization\n   */\n  private processBranch(\n    stack: FrameStack,\n    parentId: string,\n    xOffset: number,\n    yStart: number\n  ): { nodes: DiffNode[]; edges: DiffEdge[] } {\n    const nodes: DiffNode[] = [];\n    const edges: DiffEdge[] = [];\n    let yPos = yStart;\n\n    // Find frames that are children of parent\n    const children = stack.frames.filter((f) => f.parent_frame_id === parentId);\n\n    for (const frame of children) {\n      // Add node\n      nodes.push({\n        id: frame.frame_id,\n        type: xOffset < 0 ? 'branch1' : 'branch2',\n        frame,\n        position: { x: xOffset, y: yPos },\n        metadata: {\n          branch: xOffset < 0 ? 'left' : 'right',\n          depth: frame.depth,\n        },\n      });\n\n      // Add edge from parent\n      edges.push({\n        source: parentId,\n        target: frame.frame_id,\n        type: 'parent',\n        weight: 1,\n      });\n\n      // Process children recursively\n      const childResults = this.processBranch(\n        stack,\n        frame.frame_id,\n        xOffset + (xOffset < 0 ? -50 : 50),\n        yPos + 100\n      );\n\n      nodes.push(...childResults.nodes);\n      edges.push(...childResults.edges);\n\n      yPos += 150;\n    }\n\n    return { nodes, edges };\n  }\n\n  /**\n   * Mark conflicts in the visualization\n   */\n  private markConflicts(\n    nodes: DiffNode[],\n    edges: DiffEdge[],\n    conflicts: MergeConflict[]\n  ): void {\n    for (const conflict of conflicts) {\n      // Mark conflicting nodes\n      const node1 = nodes.find((n) => n.id === conflict.frameId1);\n      const node2 = nodes.find((n) => n.id === conflict.frameId2);\n\n      if (node1) {\n        node1.type = 'conflict';\n        node1.metadata = {\n          ...node1.metadata,\n          conflictType: conflict.type,\n          severity: conflict.severity,\n        };\n      }\n\n      if (node2) {\n        node2.type = 'conflict';\n        node2.metadata = {\n          ...node2.metadata,\n          conflictType: conflict.type,\n          severity: conflict.severity,\n        };\n      }\n\n      // Add conflict edge\n      if (node1 && node2) {\n        edges.push({\n          source: conflict.frameId1,\n          target: conflict.frameId2,\n          type: 'conflict',\n          weight: this.getSeverityWeight(conflict.severity),\n        });\n      }\n    }\n  }\n\n  /**\n   * Get color for severity level\n   */\n  private getSeverityColor(severity: string): string {\n    switch (severity) {\n      case 'critical':\n        return '#ff0000';\n      case 'high':\n        return '#ff6600';\n      case 'medium':\n        return '#ffaa00';\n      case 'low':\n        return '#ffdd00';\n      default:\n        return '#888888';\n    }\n  }\n\n  /**\n   * Get symbol for conflict type\n   */\n  private getConflictSymbol(type: string): string {\n    switch (type) {\n      case 'parallel_solution':\n        return '\u26A1';\n      case 'conflicting_decision':\n        return '\u26A0\uFE0F';\n      case 'structural_divergence':\n        return '\uD83D\uDD00';\n      default:\n        return '\u2753';\n    }\n  }\n\n  /**\n   * Get weight for severity level\n   */\n  private getSeverityWeight(severity: string): number {\n    switch (severity) {\n      case 'critical':\n        return 4;\n      case 'high':\n        return 3;\n      case 'medium':\n        return 2;\n      case 'low':\n        return 1;\n      default:\n        return 0;\n    }\n  }\n\n  /**\n   * Preview keep both strategy\n   */\n  private previewKeepBoth(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[]\n  ): PreviewResult {\n    const mergedFrames: Frame[] = [];\n    const keptFromStack1: string[] = [];\n    const keptFromStack2: string[] = [];\n\n    // Keep all frames from both stacks\n    for (const frame of stack1.frames) {\n      mergedFrames.push(frame);\n      keptFromStack1.push(frame.frame_id);\n    }\n\n    for (const frame of stack2.frames) {\n      // Only add if not already present\n      if (!mergedFrames.find((f) => f.frame_id === frame.frame_id)) {\n        mergedFrames.push(frame);\n        keptFromStack2.push(frame.frame_id);\n      }\n    }\n\n    // Success depends on conflict severity\n    const criticalConflicts = conflicts.filter(\n      (c) => c.severity === 'critical'\n    ).length;\n    const estimatedSuccess = Math.max(0, 1 - criticalConflicts * 0.2);\n\n    return {\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2,\n      conflicts,\n      estimatedSuccess,\n    };\n  }\n\n  /**\n   * Preview team vote strategy\n   */\n  private previewTeamVote(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[]\n  ): PreviewResult {\n    // Simulate team voting - for preview, assume 50/50 split\n    const mergedFrames: Frame[] = [];\n    const keptFromStack1: string[] = [];\n    const keptFromStack2: string[] = [];\n\n    // Add non-conflicting frames from both\n    const conflictingFrameIds = new Set<string>();\n    for (const conflict of conflicts) {\n      conflictingFrameIds.add(conflict.frameId1);\n      conflictingFrameIds.add(conflict.frameId2);\n    }\n\n    for (const frame of stack1.frames) {\n      if (!conflictingFrameIds.has(frame.frame_id)) {\n        mergedFrames.push(frame);\n        keptFromStack1.push(frame.frame_id);\n      }\n    }\n\n    for (const frame of stack2.frames) {\n      if (\n        !conflictingFrameIds.has(frame.frame_id) &&\n        !mergedFrames.find((f) => f.frame_id === frame.frame_id)\n      ) {\n        mergedFrames.push(frame);\n        keptFromStack2.push(frame.frame_id);\n      }\n    }\n\n    // For conflicts, alternate between stacks (simulating vote)\n    let useStack1 = true;\n    for (const conflict of conflicts) {\n      if (useStack1) {\n        const frame = stack1.frames.find(\n          (f) => f.frame_id === conflict.frameId1\n        );\n        if (frame) {\n          mergedFrames.push(frame);\n          keptFromStack1.push(frame.frame_id);\n        }\n      } else {\n        const frame = stack2.frames.find(\n          (f) => f.frame_id === conflict.frameId2\n        );\n        if (frame) {\n          mergedFrames.push(frame);\n          keptFromStack2.push(frame.frame_id);\n        }\n      }\n      useStack1 = !useStack1;\n    }\n\n    return {\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2,\n      conflicts,\n      estimatedSuccess: 0.75, // Team consensus usually works well\n    };\n  }\n\n  /**\n   * Preview senior override strategy\n   */\n  private previewSeniorOverride(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[]\n  ): PreviewResult {\n    // Assume stack1 is senior developer's work\n    const mergedFrames = [...stack1.frames];\n    const keptFromStack1 = stack1.frames.map((f) => f.frame_id);\n    const keptFromStack2: string[] = [];\n\n    // Add non-conflicting frames from stack2\n    const stack1Ids = new Set(keptFromStack1);\n    for (const frame of stack2.frames) {\n      const hasConflict = conflicts.some((c) => c.frameId2 === frame.frame_id);\n\n      if (!hasConflict && !stack1Ids.has(frame.frame_id)) {\n        mergedFrames.push(frame);\n        keptFromStack2.push(frame.frame_id);\n      }\n    }\n\n    return {\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2,\n      conflicts,\n      estimatedSuccess: 0.85, // Senior override is usually reliable\n    };\n  }\n\n  /**\n   * Preview AI suggest strategy\n   */\n  private previewAISuggest(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[]\n  ): PreviewResult {\n    const mergedFrames: Frame[] = [];\n    const keptFromStack1: string[] = [];\n    const keptFromStack2: string[] = [];\n\n    // AI would analyze effectiveness - simulate with heuristics\n    for (const conflict of conflicts) {\n      const frame1 = stack1.frames.find(\n        (f) => f.frame_id === conflict.frameId1\n      );\n      const frame2 = stack2.frames.find(\n        (f) => f.frame_id === conflict.frameId2\n      );\n\n      if (frame1 && frame2) {\n        // Choose based on completion and output quality\n        const score1 = this.scoreFrame(frame1);\n        const score2 = this.scoreFrame(frame2);\n\n        if (score1 >= score2) {\n          mergedFrames.push(frame1);\n          keptFromStack1.push(frame1.frame_id);\n        } else {\n          mergedFrames.push(frame2);\n          keptFromStack2.push(frame2.frame_id);\n        }\n      }\n    }\n\n    // Add non-conflicting frames\n    this.addNonConflictingFrames(\n      stack1,\n      stack2,\n      conflicts,\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2\n    );\n\n    return {\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2,\n      conflicts,\n      estimatedSuccess: 0.9, // AI suggestions are usually optimal\n    };\n  }\n\n  /**\n   * Preview hybrid strategy\n   */\n  private previewHybrid(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[]\n  ): PreviewResult {\n    const mergedFrames: Frame[] = [];\n    const keptFromStack1: string[] = [];\n    const keptFromStack2: string[] = [];\n\n    // Hybrid: Use different strategies based on conflict type\n    for (const conflict of conflicts) {\n      if (conflict.type === 'parallel_solution') {\n        // Keep both for parallel solutions\n        const frame1 = stack1.frames.find(\n          (f) => f.frame_id === conflict.frameId1\n        );\n        const frame2 = stack2.frames.find(\n          (f) => f.frame_id === conflict.frameId2\n        );\n\n        if (frame1) {\n          mergedFrames.push(frame1);\n          keptFromStack1.push(frame1.frame_id);\n        }\n        if (frame2) {\n          mergedFrames.push(frame2);\n          keptFromStack2.push(frame2.frame_id);\n        }\n      } else if (conflict.type === 'conflicting_decision') {\n        // Use AI for decisions\n        const frame1 = stack1.frames.find(\n          (f) => f.frame_id === conflict.frameId1\n        );\n        const frame2 = stack2.frames.find(\n          (f) => f.frame_id === conflict.frameId2\n        );\n\n        if (frame1 && frame2) {\n          const score1 = this.scoreFrame(frame1);\n          const score2 = this.scoreFrame(frame2);\n\n          if (score1 >= score2) {\n            mergedFrames.push(frame1);\n            keptFromStack1.push(frame1.frame_id);\n          } else {\n            mergedFrames.push(frame2);\n            keptFromStack2.push(frame2.frame_id);\n          }\n        }\n      } else {\n        // Use senior override for structural divergence\n        const frame1 = stack1.frames.find(\n          (f) => f.frame_id === conflict.frameId1\n        );\n        if (frame1) {\n          mergedFrames.push(frame1);\n          keptFromStack1.push(frame1.frame_id);\n        }\n      }\n    }\n\n    // Add non-conflicting frames\n    this.addNonConflictingFrames(\n      stack1,\n      stack2,\n      conflicts,\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2\n    );\n\n    return {\n      mergedFrames,\n      keptFromStack1,\n      keptFromStack2,\n      conflicts,\n      estimatedSuccess: 0.88, // Hybrid is very effective\n    };\n  }\n\n  /**\n   * Score a frame for quality\n   */\n  private scoreFrame(frame: Frame): number {\n    let score = 0;\n\n    if (frame.state === 'closed') score += 0.3;\n    if (frame.outputs && Object.keys(frame.outputs).length > 0) score += 0.2;\n    if (frame.digest_text) score += 0.2;\n    if (frame.closed_at && frame.created_at) {\n      const duration = frame.closed_at - frame.created_at;\n      if (duration < 600000) score += 0.3; // Less than 10 minutes\n    }\n\n    return score;\n  }\n\n  /**\n   * Add non-conflicting frames to merge\n   */\n  private addNonConflictingFrames(\n    stack1: FrameStack,\n    stack2: FrameStack,\n    conflicts: MergeConflict[],\n    mergedFrames: Frame[],\n    keptFromStack1: string[],\n    keptFromStack2: string[]\n  ): void {\n    const conflictingIds = new Set<string>();\n    const mergedIds = new Set<string>(mergedFrames.map((f) => f.frame_id));\n\n    for (const conflict of conflicts) {\n      conflictingIds.add(conflict.frameId1);\n      conflictingIds.add(conflict.frameId2);\n    }\n\n    for (const frame of stack1.frames) {\n      if (\n        !conflictingIds.has(frame.frame_id) &&\n        !mergedIds.has(frame.frame_id)\n      ) {\n        mergedFrames.push(frame);\n        keptFromStack1.push(frame.frame_id);\n        mergedIds.add(frame.frame_id);\n      }\n    }\n\n    for (const frame of stack2.frames) {\n      if (\n        !conflictingIds.has(frame.frame_id) &&\n        !mergedIds.has(frame.frame_id)\n      ) {\n        mergedFrames.push(frame);\n        keptFromStack2.push(frame.frame_id);\n        mergedIds.add(frame.frame_id);\n      }\n    }\n  }\n\n  /**\n   * Find divergence point between stacks\n   */\n  private findDivergencePoint(stack1: FrameStack, stack2: FrameStack): number {\n    const events1 = stack1.events.sort((a, b) => a.ts - b.ts);\n    const events2 = stack2.events.sort((a, b) => a.ts - b.ts);\n\n    for (let i = 0; i < Math.min(events1.length, events2.length); i++) {\n      if (events1[i].event_id !== events2[i].event_id) {\n        return events1[i].ts;\n      }\n    }\n\n    return Math.min(\n      events1[events1.length - 1]?.ts || 0,\n      events2[events2.length - 1]?.ts || 0\n    );\n  }\n\n  /**\n   * Find common ancestor frame\n   */\n  private findCommonAncestor(\n    stack1: FrameStack,\n    stack2: FrameStack\n  ): string | undefined {\n    const frames1 = new Set(stack1.frames.map((f) => f.frame_id));\n\n    // Find the deepest common frame\n    let deepestCommon: Frame | undefined;\n    let maxDepth = -1;\n\n    for (const frame of stack2.frames) {\n      if (frames1.has(frame.frame_id) && frame.depth > maxDepth) {\n        deepestCommon = frame;\n        maxDepth = frame.depth;\n      }\n    }\n\n    return deepestCommon?.frame_id;\n  }\n}\n"],
   "mappings": ";;;;AAcA,SAAS,wBAAwB;AAkB1B,MAAM,oBAAoB;AAAA,EACvB;AAAA,EAER,cAAc;AACZ,SAAK,mBAAmB,IAAI,iBAAiB;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA,EAKA,oBACE,WACA,SACA,SACU;AACV,UAAM,QAAoB,CAAC;AAC3B,UAAM,QAAoB,CAAC;AAG3B,UAAM,KAAK;AAAA,MACT,IAAI,UAAU;AAAA,MACd,MAAM;AAAA,MACN,OAAO;AAAA,MACP,UAAU,EAAE,GAAG,GAAG,GAAG,EAAE;AAAA,MACvB,UAAU,EAAE,OAAO,kBAAkB;AAAA,IACvC,CAAC;AAGD,UAAM,eAAe,KAAK;AAAA,MACxB;AAAA,MACA,UAAU;AAAA,MACV;AAAA;AAAA,MACA;AAAA,IACF;AACA,UAAM,KAAK,GAAG,aAAa,KAAK;AAChC,UAAM,KAAK,GAAG,aAAa,KAAK;AAGhC,UAAM,eAAe,KAAK;AAAA,MACxB;AAAA,MACA,UAAU;AAAA,MACV;AAAA;AAAA,MACA;AAAA,IACF;AACA,UAAM,KAAK,GAAG,aAAa,KAAK;AAChC,UAAM,KAAK,GAAG,aAAa,KAAK;AAGhC,UAAM,YAAY,KAAK,iBAAiB,gBAAgB,SAAS,OAAO;AACxE,SAAK,cAAc,OAAO,OAAO,SAAS;AAE1C,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,IACV;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,sBAAsB,WAA4C;AAChE,UAAM,UAA0B,CAAC;AAEjC,eAAW,YAAY,WAAW;AAChC,cAAQ,KAAK;AAAA,QACX,SAAS,SAAS;AAAA,QAClB,MAAM;AAAA,QACN,OAAO,KAAK,iBAAiB,SAAS,QAAQ;AAAA,QAC9C,QAAQ,KAAK,kBAAkB,SAAS,IAAI;AAAA,QAC5C,aAAa,SAAS;AAAA,MACxB,CAAC;AAED,cAAQ,KAAK;AAAA,QACX,SAAS,SAAS;AAAA,QAClB,MAAM;AAAA,QACN,OAAO,KAAK,iBAAiB,SAAS,QAAQ;AAAA,QAC9C,QAAQ,KAAK,kBAAkB,SAAS,IAAI;AAAA,QAC5C,aAAa,SAAS;AAAA,MACxB,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,qBACE,QACA,QACA,UAMe;AACf,UAAM,eAAwB,CAAC;AAC/B,UAAM,iBAA2B,CAAC;AAClC,UAAM,iBAA2B,CAAC;AAClC,UAAM,YAAY,KAAK,iBAAiB,gBAAgB,QAAQ,MAAM;AAEtE,YAAQ,UAAU;AAAA,MAChB,KAAK;AACH,eAAO,KAAK,gBAAgB,QAAQ,QAAQ,SAAS;AAAA,MAEvD,KAAK;AACH,eAAO,KAAK,gBAAgB,QAAQ,QAAQ,SAAS;AAAA,MAEvD,KAAK;AACH,eAAO,KAAK,sBAAsB,QAAQ,QAAQ,SAAS;AAAA,MAE7D,KAAK;AACH,eAAO,KAAK,iBAAiB,QAAQ,QAAQ,SAAS;AAAA,MAExD,KAAK;AACH,eAAO,KAAK,cAAc,QAAQ,QAAQ,SAAS;AAAA,MAErD;AACE,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,kBAAkB;AAAA,QACpB;AAAA,IACJ;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,gBACE,aACA,QACA,QACW;AACX,UAAM,YAAY,KAAK,iBAAiB,gBAAgB,QAAQ,MAAM;AACtE,UAAM,kBAAkB,KAAK,oBAAoB,QAAQ,MAAM;AAC/D,UAAM,iBAAiB,KAAK,mBAAmB,QAAQ,MAAM;AAG7D,UAAM,YACJ,OAAO,OAAO,KAAK,CAAC,MAAM,EAAE,aAAa,WAAW,KACpD,OAAO,OAAO,KAAK,CAAC,MAAM,EAAE,aAAa,WAAW;AAEtD,UAAM,uBAAuB,YACzB,KAAK,oBAAoB,WAAW,QAAQ,MAAM,IAClD;AAEJ,WAAO;AAAA,MACL,WAAW;AAAA,MACX,SAAS;AAAA,MACT,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,cACN,OACA,UACA,SACA,QAC0C;AAC1C,UAAM,QAAoB,CAAC;AAC3B,UAAM,QAAoB,CAAC;AAC3B,QAAI,OAAO;AAGX,UAAM,WAAW,MAAM,OAAO,OAAO,CAAC,MAAM,EAAE,oBAAoB,QAAQ;AAE1E,eAAW,SAAS,UAAU;AAE5B,YAAM,KAAK;AAAA,QACT,IAAI,MAAM;AAAA,QACV,MAAM,UAAU,IAAI,YAAY;AAAA,QAChC;AAAA,QACA,UAAU,EAAE,GAAG,SAAS,GAAG,KAAK;AAAA,QAChC,UAAU;AAAA,UACR,QAAQ,UAAU,IAAI,SAAS;AAAA,UAC/B,OAAO,MAAM;AAAA,QACf;AAAA,MACF,CAAC;AAGD,YAAM,KAAK;AAAA,QACT,QAAQ;AAAA,QACR,QAAQ,MAAM;AAAA,QACd,MAAM;AAAA,QACN,QAAQ;AAAA,MACV,CAAC;AAGD,YAAM,eAAe,KAAK;AAAA,QACxB;AAAA,QACA,MAAM;AAAA,QACN,WAAW,UAAU,IAAI,MAAM;AAAA,QAC/B,OAAO;AAAA,MACT;AAEA,YAAM,KAAK,GAAG,aAAa,KAAK;AAChC,YAAM,KAAK,GAAG,aAAa,KAAK;AAEhC,cAAQ;AAAA,IACV;AAEA,WAAO,EAAE,OAAO,MAAM;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKQ,cACN,OACA,OACA,WACM;AACN,eAAW,YAAY,WAAW;AAEhC,YAAM,QAAQ,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,SAAS,QAAQ;AAC1D,YAAM,QAAQ,MAAM,KAAK,CAAC,MAAM,EAAE,OAAO,SAAS,QAAQ;AAE1D,UAAI,OAAO;AACT,cAAM,OAAO;AACb,cAAM,WAAW;AAAA,UACf,GAAG,MAAM;AAAA,UACT,cAAc,SAAS;AAAA,UACvB,UAAU,SAAS;AAAA,QACrB;AAAA,MACF;AAEA,UAAI,OAAO;AACT,cAAM,OAAO;AACb,cAAM,WAAW;AAAA,UACf,GAAG,MAAM;AAAA,UACT,cAAc,SAAS;AAAA,UACvB,UAAU,SAAS;AAAA,QACrB;AAAA,MACF;AAGA,UAAI,SAAS,OAAO;AAClB,cAAM,KAAK;AAAA,UACT,QAAQ,SAAS;AAAA,UACjB,QAAQ,SAAS;AAAA,UACjB,MAAM;AAAA,UACN,QAAQ,KAAK,kBAAkB,SAAS,QAAQ;AAAA,QAClD,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,UAA0B;AACjD,YAAQ,UAAU;AAAA,MAChB,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,kBAAkB,MAAsB;AAC9C,YAAQ,MAAM;AAAA,MACZ,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,kBAAkB,UAA0B;AAClD,YAAQ,UAAU;AAAA,MAChB,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,QACA,QACA,WACe;AACf,UAAM,eAAwB,CAAC;AAC/B,UAAM,iBAA2B,CAAC;AAClC,UAAM,iBAA2B,CAAC;AAGlC,eAAW,SAAS,OAAO,QAAQ;AACjC,mBAAa,KAAK,KAAK;AACvB,qBAAe,KAAK,MAAM,QAAQ;AAAA,IACpC;AAEA,eAAW,SAAS,OAAO,QAAQ;AAEjC,UAAI,CAAC,aAAa,KAAK,CAAC,MAAM,EAAE,aAAa,MAAM,QAAQ,GAAG;AAC5D,qBAAa,KAAK,KAAK;AACvB,uBAAe,KAAK,MAAM,QAAQ;AAAA,MACpC;AAAA,IACF;AAGA,UAAM,oBAAoB,UAAU;AAAA,MAClC,CAAC,MAAM,EAAE,aAAa;AAAA,IACxB,EAAE;AACF,UAAM,mBAAmB,KAAK,IAAI,GAAG,IAAI,oBAAoB,GAAG;AAEhE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,QACA,QACA,WACe;AAEf,UAAM,eAAwB,CAAC;AAC/B,UAAM,iBAA2B,CAAC;AAClC,UAAM,iBAA2B,CAAC;AAGlC,UAAM,sBAAsB,oBAAI,IAAY;AAC5C,eAAW,YAAY,WAAW;AAChC,0BAAoB,IAAI,SAAS,QAAQ;AACzC,0BAAoB,IAAI,SAAS,QAAQ;AAAA,IAC3C;AAEA,eAAW,SAAS,OAAO,QAAQ;AACjC,UAAI,CAAC,oBAAoB,IAAI,MAAM,QAAQ,GAAG;AAC5C,qBAAa,KAAK,KAAK;AACvB,uBAAe,KAAK,MAAM,QAAQ;AAAA,MACpC;AAAA,IACF;AAEA,eAAW,SAAS,OAAO,QAAQ;AACjC,UACE,CAAC,oBAAoB,IAAI,MAAM,QAAQ,KACvC,CAAC,aAAa,KAAK,CAAC,MAAM,EAAE,aAAa,MAAM,QAAQ,GACvD;AACA,qBAAa,KAAK,KAAK;AACvB,uBAAe,KAAK,MAAM,QAAQ;AAAA,MACpC;AAAA,IACF;AAGA,QAAI,YAAY;AAChB,eAAW,YAAY,WAAW;AAChC,UAAI,WAAW;AACb,cAAM,QAAQ,OAAO,OAAO;AAAA,UAC1B,CAAC,MAAM,EAAE,aAAa,SAAS;AAAA,QACjC;AACA,YAAI,OAAO;AACT,uBAAa,KAAK,KAAK;AACvB,yBAAe,KAAK,MAAM,QAAQ;AAAA,QACpC;AAAA,MACF,OAAO;AACL,cAAM,QAAQ,OAAO,OAAO;AAAA,UAC1B,CAAC,MAAM,EAAE,aAAa,SAAS;AAAA,QACjC;AACA,YAAI,OAAO;AACT,uBAAa,KAAK,KAAK;AACvB,yBAAe,KAAK,MAAM,QAAQ;AAAA,QACpC;AAAA,MACF;AACA,kBAAY,CAAC;AAAA,IACf;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,kBAAkB;AAAA;AAAA,IACpB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,sBACN,QACA,QACA,WACe;AAEf,UAAM,eAAe,CAAC,GAAG,OAAO,MAAM;AACtC,UAAM,iBAAiB,OAAO,OAAO,IAAI,CAAC,MAAM,EAAE,QAAQ;AAC1D,UAAM,iBAA2B,CAAC;AAGlC,UAAM,YAAY,IAAI,IAAI,cAAc;AACxC,eAAW,SAAS,OAAO,QAAQ;AACjC,YAAM,cAAc,UAAU,KAAK,CAAC,MAAM,EAAE,aAAa,MAAM,QAAQ;AAEvE,UAAI,CAAC,eAAe,CAAC,UAAU,IAAI,MAAM,QAAQ,GAAG;AAClD,qBAAa,KAAK,KAAK;AACvB,uBAAe,KAAK,MAAM,QAAQ;AAAA,MACpC;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,kBAAkB;AAAA;AAAA,IACpB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,iBACN,QACA,QACA,WACe;AACf,UAAM,eAAwB,CAAC;AAC/B,UAAM,iBAA2B,CAAC;AAClC,UAAM,iBAA2B,CAAC;AAGlC,eAAW,YAAY,WAAW;AAChC,YAAM,SAAS,OAAO,OAAO;AAAA,QAC3B,CAAC,MAAM,EAAE,aAAa,SAAS;AAAA,MACjC;AACA,YAAM,SAAS,OAAO,OAAO;AAAA,QAC3B,CAAC,MAAM,EAAE,aAAa,SAAS;AAAA,MACjC;AAEA,UAAI,UAAU,QAAQ;AAEpB,cAAM,SAAS,KAAK,WAAW,MAAM;AACrC,cAAM,SAAS,KAAK,WAAW,MAAM;AAErC,YAAI,UAAU,QAAQ;AACpB,uBAAa,KAAK,MAAM;AACxB,yBAAe,KAAK,OAAO,QAAQ;AAAA,QACrC,OAAO;AACL,uBAAa,KAAK,MAAM;AACxB,yBAAe,KAAK,OAAO,QAAQ;AAAA,QACrC;AAAA,MACF;AAAA,IACF;AAGA,SAAK;AAAA,MACH;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,kBAAkB;AAAA;AAAA,IACpB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,cACN,QACA,QACA,WACe;AACf,UAAM,eAAwB,CAAC;AAC/B,UAAM,iBAA2B,CAAC;AAClC,UAAM,iBAA2B,CAAC;AAGlC,eAAW,YAAY,WAAW;AAChC,UAAI,SAAS,SAAS,qBAAqB;AAEzC,cAAM,SAAS,OAAO,OAAO;AAAA,UAC3B,CAAC,MAAM,EAAE,aAAa,SAAS;AAAA,QACjC;AACA,cAAM,SAAS,OAAO,OAAO;AAAA,UAC3B,CAAC,MAAM,EAAE,aAAa,SAAS;AAAA,QACjC;AAEA,YAAI,QAAQ;AACV,uBAAa,KAAK,MAAM;AACxB,yBAAe,KAAK,OAAO,QAAQ;AAAA,QACrC;AACA,YAAI,QAAQ;AACV,uBAAa,KAAK,MAAM;AACxB,yBAAe,KAAK,OAAO,QAAQ;AAAA,QACrC;AAAA,MACF,WAAW,SAAS,SAAS,wBAAwB;AAEnD,cAAM,SAAS,OAAO,OAAO;AAAA,UAC3B,CAAC,MAAM,EAAE,aAAa,SAAS;AAAA,QACjC;AACA,cAAM,SAAS,OAAO,OAAO;AAAA,UAC3B,CAAC,MAAM,EAAE,aAAa,SAAS;AAAA,QACjC;AAEA,YAAI,UAAU,QAAQ;AACpB,gBAAM,SAAS,KAAK,WAAW,MAAM;AACrC,gBAAM,SAAS,KAAK,WAAW,MAAM;AAErC,cAAI,UAAU,QAAQ;AACpB,yBAAa,KAAK,MAAM;AACxB,2BAAe,KAAK,OAAO,QAAQ;AAAA,UACrC,OAAO;AACL,yBAAa,KAAK,MAAM;AACxB,2BAAe,KAAK,OAAO,QAAQ;AAAA,UACrC;AAAA,QACF;AAAA,MACF,OAAO;AAEL,cAAM,SAAS,OAAO,OAAO;AAAA,UAC3B,CAAC,MAAM,EAAE,aAAa,SAAS;AAAA,QACjC;AACA,YAAI,QAAQ;AACV,uBAAa,KAAK,MAAM;AACxB,yBAAe,KAAK,OAAO,QAAQ;AAAA,QACrC;AAAA,MACF;AAAA,IACF;AAGA,SAAK;AAAA,MACH;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,kBAAkB;AAAA;AAAA,IACpB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAW,OAAsB;AACvC,QAAI,QAAQ;AAEZ,QAAI,MAAM,UAAU,SAAU,UAAS;AACvC,QAAI,MAAM,WAAW,OAAO,KAAK,MAAM,OAAO,EAAE,SAAS,EAAG,UAAS;AACrE,QAAI,MAAM,YAAa,UAAS;AAChC,QAAI,MAAM,aAAa,MAAM,YAAY;AACvC,YAAM,WAAW,MAAM,YAAY,MAAM;AACzC,UAAI,WAAW,IAAQ,UAAS;AAAA,IAClC;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,wBACN,QACA,QACA,WACA,cACA,gBACA,gBACM;AACN,UAAM,iBAAiB,oBAAI,IAAY;AACvC,UAAM,YAAY,IAAI,IAAY,aAAa,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC;AAErE,eAAW,YAAY,WAAW;AAChC,qBAAe,IAAI,SAAS,QAAQ;AACpC,qBAAe,IAAI,SAAS,QAAQ;AAAA,IACtC;AAEA,eAAW,SAAS,OAAO,QAAQ;AACjC,UACE,CAAC,eAAe,IAAI,MAAM,QAAQ,KAClC,CAAC,UAAU,IAAI,MAAM,QAAQ,GAC7B;AACA,qBAAa,KAAK,KAAK;AACvB,uBAAe,KAAK,MAAM,QAAQ;AAClC,kBAAU,IAAI,MAAM,QAAQ;AAAA,MAC9B;AAAA,IACF;AAEA,eAAW,SAAS,OAAO,QAAQ;AACjC,UACE,CAAC,eAAe,IAAI,MAAM,QAAQ,KAClC,CAAC,UAAU,IAAI,MAAM,QAAQ,GAC7B;AACA,qBAAa,KAAK,KAAK;AACvB,uBAAe,KAAK,MAAM,QAAQ;AAClC,kBAAU,IAAI,MAAM,QAAQ;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,QAAoB,QAA4B;AAC1E,UAAM,UAAU,OAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE;AACxD,UAAM,UAAU,OAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE;AAExD,aAAS,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,QAAQ,QAAQ,MAAM,GAAG,KAAK;AACjE,UAAI,QAAQ,CAAC,EAAE,aAAa,QAAQ,CAAC,EAAE,UAAU;AAC/C,eAAO,QAAQ,CAAC,EAAE;AAAA,MACpB;AAAA,IACF;AAEA,WAAO,KAAK;AAAA,MACV,QAAQ,QAAQ,SAAS,CAAC,GAAG,MAAM;AAAA,MACnC,QAAQ,QAAQ,SAAS,CAAC,GAAG,MAAM;AAAA,IACrC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,mBACN,QACA,QACoB;AACpB,UAAM,UAAU,IAAI,IAAI,OAAO,OAAO,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC;AAG5D,QAAI;AACJ,QAAI,WAAW;AAEf,eAAW,SAAS,OAAO,QAAQ;AACjC,UAAI,QAAQ,IAAI,MAAM,QAAQ,KAAK,MAAM,QAAQ,UAAU;AACzD,wBAAgB;AAChB,mBAAW,MAAM;AAAA,MACnB;AAAA,IACF;AAEA,WAAO,eAAe;AAAA,EACxB;AACF;",
   "names": []
 }

package/dist/core/models/fallback-monitor.js

@@ -0,0 +1,229 @@
+import { fileURLToPath as __fileURLToPath } from 'url';
+import { dirname as __pathDirname } from 'path';
+const __filename = __fileURLToPath(import.meta.url);
+const __dirname = __pathDirname(__filename);
+import { spawn } from "child_process";
+import {
+  loadModelRouterConfig,
+  buildModelEnv
+} from "./model-router.js";
+const DEFAULT_ERROR_PATTERNS = [
+  /rate.?limit/i,
+  /429/,
+  /too.?many.?requests/i,
+  /overloaded/i,
+  /capacity/i,
+  /temporarily.?unavailable/i,
+  /503/,
+  /502/,
+  /500/,
+  /internal.?server.?error/i,
+  /timeout/i,
+  /ETIMEDOUT/,
+  /ESOCKETTIMEDOUT/,
+  /ECONNRESET/,
+  /ECONNREFUSED/
+];
+class FallbackMonitor {
+  config;
+  routerConfig = loadModelRouterConfig();
+  currentProvider = "anthropic";
+  restartCount = 0;
+  inFallback = false;
+  errorBuffer = "";
+  lastErrorTime = 0;
+  errorCount = 0;
+  constructor(config = {}) {
+    this.config = {
+      enabled: true,
+      maxRestarts: 3,
+      restartDelayMs: 2e3,
+      errorPatterns: DEFAULT_ERROR_PATTERNS,
+      ...config
+    };
+  }
+  /**
+   * Check if text contains error patterns that should trigger fallback
+   */
+  detectError(text) {
+    for (const pattern of this.config.errorPatterns) {
+      if (pattern.test(text)) {
+        return {
+          shouldFallback: true,
+          reason: pattern.source
+        };
+      }
+    }
+    return { shouldFallback: false, reason: "" };
+  }
+  /**
+   * Get environment variables for fallback provider
+   */
+  getFallbackEnv() {
+    const fallbackProvider = this.routerConfig.fallback?.provider || "qwen";
+    const providerConfig = this.routerConfig.providers[fallbackProvider];
+    if (!providerConfig) {
+      console.error(`[fallback] Provider not configured: ${fallbackProvider}`);
+      return {};
+    }
+    return buildModelEnv(providerConfig);
+  }
+  /**
+   * Check if fallback is available (has API key)
+   */
+  isFallbackAvailable() {
+    const fallbackProvider = this.routerConfig.fallback?.provider || "qwen";
+    const providerConfig = this.routerConfig.providers[fallbackProvider];
+    if (!providerConfig) return false;
+    return !!process.env[providerConfig.apiKeyEnv];
+  }
+  /**
+   * Wrap a Claude process with fallback monitoring
+   * Returns a function to spawn the process with automatic restart on failure
+   */
+  wrapProcess(command, args, options = {}) {
+    let currentProcess = null;
+    let stopped = false;
+    const startProcess = () => {
+      const env = { ...process.env, ...options.env };
+      if (this.inFallback) {
+        const fallbackEnv = this.getFallbackEnv();
+        Object.assign(env, fallbackEnv);
+        this.currentProvider = this.routerConfig.fallback?.provider || "qwen";
+      }
+      currentProcess = spawn(command, args, {
+        stdio: ["inherit", "pipe", "pipe"],
+        env,
+        cwd: options.cwd
+      });
+      currentProcess.stdout?.on("data", (data) => {
+        const text = data.toString();
+        process.stdout.write(data);
+        this.checkForErrors(text);
+      });
+      currentProcess.stderr?.on("data", (data) => {
+        const text = data.toString();
+        process.stderr.write(data);
+        this.checkForErrors(text);
+      });
+      currentProcess.on("exit", (code, _signal) => {
+        if (stopped) return;
+        if (code !== 0 && this.shouldRestart()) {
+          console.log(
+            `
+[fallback] Process exited with code ${code}, restarting with fallback...`
+          );
+          this.activateFallback("exit_code");
+          setTimeout(() => {
+            if (!stopped) {
+              startProcess();
+            }
+          }, this.config.restartDelayMs);
+        }
+      });
+      return currentProcess;
+    };
+    return {
+      start: startProcess,
+      stop: () => {
+        stopped = true;
+        currentProcess?.kill();
+      },
+      isInFallback: () => this.inFallback,
+      getCurrentProvider: () => this.currentProvider
+    };
+  }
+  /**
+   * Check output text for errors and trigger fallback if needed
+   */
+  checkForErrors(text) {
+    this.errorBuffer += text;
+    if (this.errorBuffer.length > 1e4) {
+      this.errorBuffer = this.errorBuffer.slice(-5e3);
+    }
+    const { shouldFallback, reason } = this.detectError(text);
+    if (shouldFallback) {
+      const now = Date.now();
+      if (now - this.lastErrorTime < 1e3) {
+        this.errorCount++;
+      } else {
+        this.errorCount = 1;
+      }
+      this.lastErrorTime = now;
+      if (this.errorCount >= 2 && !this.inFallback && this.isFallbackAvailable()) {
+        console.log(`
+[fallback] Detected error pattern: ${reason}`);
+        this.activateFallback(reason);
+      }
+    }
+  }
+  /**
+   * Activate fallback mode
+   */
+  activateFallback(reason) {
+    if (this.inFallback) return;
+    this.inFallback = true;
+    this.restartCount++;
+    this.currentProvider = this.routerConfig.fallback?.provider || "qwen";
+    console.log(
+      `[fallback] Switching to ${this.currentProvider} (reason: ${reason})`
+    );
+    if (this.config.onFallback) {
+      this.config.onFallback(this.currentProvider, reason);
+    }
+  }
+  /**
+   * Check if we should restart
+   */
+  shouldRestart() {
+    return this.config.enabled && this.restartCount < this.config.maxRestarts && this.isFallbackAvailable();
+  }
+  /**
+   * Reset fallback state
+   */
+  reset() {
+    this.inFallback = false;
+    this.restartCount = 0;
+    this.errorCount = 0;
+    this.errorBuffer = "";
+    this.currentProvider = "anthropic";
+  }
+  /**
+   * Get current status
+   */
+  getStatus() {
+    return {
+      inFallback: this.inFallback,
+      currentProvider: this.currentProvider,
+      restartCount: this.restartCount,
+      fallbackAvailable: this.isFallbackAvailable()
+    };
+  }
+}
+function spawnWithFallback(command, args, options = {}) {
+  const monitor = new FallbackMonitor({
+    onFallback: options.onFallback
+  });
+  const wrapper = monitor.wrapProcess(command, args, options);
+  return wrapper.start();
+}
+function getEnvWithFallback() {
+  const config = loadModelRouterConfig();
+  const env = {};
+  if (config.fallback?.enabled) {
+    const fallbackProvider = config.providers[config.fallback.provider];
+    if (fallbackProvider) {
+      env["STACKMEMORY_FALLBACK_PROVIDER"] = config.fallback.provider;
+      env["STACKMEMORY_FALLBACK_MODEL"] = fallbackProvider.model;
+      env["STACKMEMORY_FALLBACK_URL"] = fallbackProvider.baseUrl || "";
+      env["STACKMEMORY_FALLBACK_KEY_ENV"] = fallbackProvider.apiKeyEnv;
+    }
+  }
+  return env;
+}
+export {
+  FallbackMonitor,
+  getEnvWithFallback,
+  spawnWithFallback
+};
+//# sourceMappingURL=fallback-monitor.js.map

package/dist/core/models/fallback-monitor.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/core/models/fallback-monitor.ts"],
+  "sourcesContent": ["/**\n * Fallback Monitor - Watches Claude output for errors and triggers automatic fallback\n * Restarts session with Qwen when Claude fails\n */\n\nimport { spawn, ChildProcess } from 'child_process';\nimport {\n  loadModelRouterConfig,\n  buildModelEnv,\n  type ModelProvider,\n} from './model-router.js';\n\nexport interface FallbackMonitorConfig {\n  enabled: boolean;\n  maxRestarts: number;\n  restartDelayMs: number;\n  errorPatterns: RegExp[];\n  onFallback?: (provider: ModelProvider, reason: string) => void;\n  onRestore?: (provider: ModelProvider) => void;\n}\n\nconst DEFAULT_ERROR_PATTERNS = [\n  /rate.?limit/i,\n  /429/,\n  /too.?many.?requests/i,\n  /overloaded/i,\n  /capacity/i,\n  /temporarily.?unavailable/i,\n  /503/,\n  /502/,\n  /500/,\n  /internal.?server.?error/i,\n  /timeout/i,\n  /ETIMEDOUT/,\n  /ESOCKETTIMEDOUT/,\n  /ECONNRESET/,\n  /ECONNREFUSED/,\n];\n\n/**\n * FallbackMonitor watches a Claude process and restarts with fallback on errors\n */\nexport class FallbackMonitor {\n  private config: FallbackMonitorConfig;\n  private routerConfig = loadModelRouterConfig();\n  private currentProvider: ModelProvider = 'anthropic';\n  private restartCount = 0;\n  private inFallback = false;\n  private errorBuffer = '';\n  private lastErrorTime = 0;\n  private errorCount = 0;\n\n  constructor(config: Partial<FallbackMonitorConfig> = {}) {\n    this.config = {\n      enabled: true,\n      maxRestarts: 3,\n      restartDelayMs: 2000,\n      errorPatterns: DEFAULT_ERROR_PATTERNS,\n      ...config,\n    };\n  }\n\n  /**\n   * Check if text contains error patterns that should trigger fallback\n   */\n  detectError(text: string): { shouldFallback: boolean; reason: string } {\n    for (const pattern of this.config.errorPatterns) {\n      if (pattern.test(text)) {\n        return {\n          shouldFallback: true,\n          reason: pattern.source,\n        };\n      }\n    }\n    return { shouldFallback: false, reason: '' };\n  }\n\n  /**\n   * Get environment variables for fallback provider\n   */\n  getFallbackEnv(): Record<string, string> {\n    const fallbackProvider = this.routerConfig.fallback?.provider || 'qwen';\n    const providerConfig = this.routerConfig.providers[fallbackProvider];\n\n    if (!providerConfig) {\n      console.error(`[fallback] Provider not configured: ${fallbackProvider}`);\n      return {};\n    }\n\n    return buildModelEnv(providerConfig);\n  }\n\n  /**\n   * Check if fallback is available (has API key)\n   */\n  isFallbackAvailable(): boolean {\n    const fallbackProvider = this.routerConfig.fallback?.provider || 'qwen';\n    const providerConfig = this.routerConfig.providers[fallbackProvider];\n\n    if (!providerConfig) return false;\n\n    return !!process.env[providerConfig.apiKeyEnv];\n  }\n\n  /**\n   * Wrap a Claude process with fallback monitoring\n   * Returns a function to spawn the process with automatic restart on failure\n   */\n  wrapProcess(\n    command: string,\n    args: string[],\n    options: { env?: NodeJS.ProcessEnv; cwd?: string } = {}\n  ): {\n    start: () => ChildProcess;\n    stop: () => void;\n    isInFallback: () => boolean;\n    getCurrentProvider: () => ModelProvider;\n  } {\n    let currentProcess: ChildProcess | null = null;\n    let stopped = false;\n\n    const startProcess = (): ChildProcess => {\n      const env = { ...process.env, ...options.env };\n\n      // Apply fallback env if in fallback mode\n      if (this.inFallback) {\n        const fallbackEnv = this.getFallbackEnv();\n        Object.assign(env, fallbackEnv);\n        this.currentProvider = this.routerConfig.fallback?.provider || 'qwen';\n      }\n\n      currentProcess = spawn(command, args, {\n        stdio: ['inherit', 'pipe', 'pipe'],\n        env,\n        cwd: options.cwd,\n      });\n\n      // Monitor stdout\n      currentProcess.stdout?.on('data', (data: Buffer) => {\n        const text = data.toString();\n        process.stdout.write(data);\n        this.checkForErrors(text);\n      });\n\n      // Monitor stderr\n      currentProcess.stderr?.on('data', (data: Buffer) => {\n        const text = data.toString();\n        process.stderr.write(data);\n        this.checkForErrors(text);\n      });\n\n      // Handle exit\n      currentProcess.on('exit', (code, _signal) => {\n        if (stopped) return;\n\n        // Check if we should restart with fallback\n        if (code !== 0 && this.shouldRestart()) {\n          console.log(\n            `\\n[fallback] Process exited with code ${code}, restarting with fallback...`\n          );\n          this.activateFallback('exit_code');\n          setTimeout(() => {\n            if (!stopped) {\n              startProcess();\n            }\n          }, this.config.restartDelayMs);\n        }\n      });\n\n      return currentProcess;\n    };\n\n    return {\n      start: startProcess,\n      stop: () => {\n        stopped = true;\n        currentProcess?.kill();\n      },\n      isInFallback: () => this.inFallback,\n      getCurrentProvider: () => this.currentProvider,\n    };\n  }\n\n  /**\n   * Check output text for errors and trigger fallback if needed\n   */\n  private checkForErrors(text: string): void {\n    this.errorBuffer += text;\n\n    // Keep buffer manageable\n    if (this.errorBuffer.length > 10000) {\n      this.errorBuffer = this.errorBuffer.slice(-5000);\n    }\n\n    const { shouldFallback, reason } = this.detectError(text);\n\n    if (shouldFallback) {\n      const now = Date.now();\n\n      // Debounce rapid errors\n      if (now - this.lastErrorTime < 1000) {\n        this.errorCount++;\n      } else {\n        this.errorCount = 1;\n      }\n      this.lastErrorTime = now;\n\n      // Trigger fallback after multiple rapid errors\n      if (\n        this.errorCount >= 2 &&\n        !this.inFallback &&\n        this.isFallbackAvailable()\n      ) {\n        console.log(`\\n[fallback] Detected error pattern: ${reason}`);\n        this.activateFallback(reason);\n      }\n    }\n  }\n\n  /**\n   * Activate fallback mode\n   */\n  private activateFallback(reason: string): void {\n    if (this.inFallback) return;\n\n    this.inFallback = true;\n    this.restartCount++;\n    this.currentProvider = this.routerConfig.fallback?.provider || 'qwen';\n\n    console.log(\n      `[fallback] Switching to ${this.currentProvider} (reason: ${reason})`\n    );\n\n    if (this.config.onFallback) {\n      this.config.onFallback(this.currentProvider, reason);\n    }\n  }\n\n  /**\n   * Check if we should restart\n   */\n  private shouldRestart(): boolean {\n    return (\n      this.config.enabled &&\n      this.restartCount < this.config.maxRestarts &&\n      this.isFallbackAvailable()\n    );\n  }\n\n  /**\n   * Reset fallback state\n   */\n  reset(): void {\n    this.inFallback = false;\n    this.restartCount = 0;\n    this.errorCount = 0;\n    this.errorBuffer = '';\n    this.currentProvider = 'anthropic';\n  }\n\n  /**\n   * Get current status\n   */\n  getStatus(): {\n    inFallback: boolean;\n    currentProvider: ModelProvider;\n    restartCount: number;\n    fallbackAvailable: boolean;\n  } {\n    return {\n      inFallback: this.inFallback,\n      currentProvider: this.currentProvider,\n      restartCount: this.restartCount,\n      fallbackAvailable: this.isFallbackAvailable(),\n    };\n  }\n}\n\n/**\n * Create a simple fallback-aware spawn function\n */\nexport function spawnWithFallback(\n  command: string,\n  args: string[],\n  options: {\n    env?: NodeJS.ProcessEnv;\n    cwd?: string;\n    onFallback?: (provider: ModelProvider, reason: string) => void;\n  } = {}\n): ChildProcess {\n  const monitor = new FallbackMonitor({\n    onFallback: options.onFallback,\n  });\n\n  const wrapper = monitor.wrapProcess(command, args, options);\n  return wrapper.start();\n}\n\n/**\n * Quick helper to get env vars with fallback pre-configured\n */\nexport function getEnvWithFallback(): Record<string, string> {\n  const config = loadModelRouterConfig();\n  const env: Record<string, string> = {};\n\n  // Set fallback provider info for error recovery\n  if (config.fallback?.enabled) {\n    const fallbackProvider = config.providers[config.fallback.provider];\n    if (fallbackProvider) {\n      env['STACKMEMORY_FALLBACK_PROVIDER'] = config.fallback.provider;\n      env['STACKMEMORY_FALLBACK_MODEL'] = fallbackProvider.model;\n      env['STACKMEMORY_FALLBACK_URL'] = fallbackProvider.baseUrl || '';\n      env['STACKMEMORY_FALLBACK_KEY_ENV'] = fallbackProvider.apiKeyEnv;\n    }\n  }\n\n  return env;\n}\n"],
+  "mappings": ";;;;AAKA,SAAS,aAA2B;AACpC;AAAA,EACE;AAAA,EACA;AAAA,OAEK;AAWP,MAAM,yBAAyB;AAAA,EAC7B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAKO,MAAM,gBAAgB;AAAA,EACnB;AAAA,EACA,eAAe,sBAAsB;AAAA,EACrC,kBAAiC;AAAA,EACjC,eAAe;AAAA,EACf,aAAa;AAAA,EACb,cAAc;AAAA,EACd,gBAAgB;AAAA,EAChB,aAAa;AAAA,EAErB,YAAY,SAAyC,CAAC,GAAG;AACvD,SAAK,SAAS;AAAA,MACZ,SAAS;AAAA,MACT,aAAa;AAAA,MACb,gBAAgB;AAAA,MAChB,eAAe;AAAA,MACf,GAAG;AAAA,IACL;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,MAA2D;AACrE,eAAW,WAAW,KAAK,OAAO,eAAe;AAC/C,UAAI,QAAQ,KAAK,IAAI,GAAG;AACtB,eAAO;AAAA,UACL,gBAAgB;AAAA,UAChB,QAAQ,QAAQ;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AACA,WAAO,EAAE,gBAAgB,OAAO,QAAQ,GAAG;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAyC;AACvC,UAAM,mBAAmB,KAAK,aAAa,UAAU,YAAY;AACjE,UAAM,iBAAiB,KAAK,aAAa,UAAU,gBAAgB;AAEnE,QAAI,CAAC,gBAAgB;AACnB,cAAQ,MAAM,uCAAuC,gBAAgB,EAAE;AACvE,aAAO,CAAC;AAAA,IACV;AAEA,WAAO,cAAc,cAAc;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAKA,sBAA+B;AAC7B,UAAM,mBAAmB,KAAK,aAAa,UAAU,YAAY;AACjE,UAAM,iBAAiB,KAAK,aAAa,UAAU,gBAAgB;AAEnE,QAAI,CAAC,eAAgB,QAAO;AAE5B,WAAO,CAAC,CAAC,QAAQ,IAAI,eAAe,SAAS;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YACE,SACA,MACA,UAAqD,CAAC,GAMtD;AACA,QAAI,iBAAsC;AAC1C,QAAI,UAAU;AAEd,UAAM,eAAe,MAAoB;AACvC,YAAM,MAAM,EAAE,GAAG,QAAQ,KAAK,GAAG,QAAQ,IAAI;AAG7C,UAAI,KAAK,YAAY;AACnB,cAAM,cAAc,KAAK,eAAe;AACxC,eAAO,OAAO,KAAK,WAAW;AAC9B,aAAK,kBAAkB,KAAK,aAAa,UAAU,YAAY;AAAA,MACjE;AAEA,uBAAiB,MAAM,SAAS,MAAM;AAAA,QACpC,OAAO,CAAC,WAAW,QAAQ,MAAM;AAAA,QACjC;AAAA,QACA,KAAK,QAAQ;AAAA,MACf,CAAC;AAGD,qBAAe,QAAQ,GAAG,QAAQ,CAAC,SAAiB;AAClD,cAAM,OAAO,KAAK,SAAS;AAC3B,gBAAQ,OAAO,MAAM,IAAI;AACzB,aAAK,eAAe,IAAI;AAAA,MAC1B,CAAC;AAGD,qBAAe,QAAQ,GAAG,QAAQ,CAAC,SAAiB;AAClD,cAAM,OAAO,KAAK,SAAS;AAC3B,gBAAQ,OAAO,MAAM,IAAI;AACzB,aAAK,eAAe,IAAI;AAAA,MAC1B,CAAC;AAGD,qBAAe,GAAG,QAAQ,CAAC,MAAM,YAAY;AAC3C,YAAI,QAAS;AAGb,YAAI,SAAS,KAAK,KAAK,cAAc,GAAG;AACtC,kBAAQ;AAAA,YACN;AAAA,sCAAyC,IAAI;AAAA,UAC/C;AACA,eAAK,iBAAiB,WAAW;AACjC,qBAAW,MAAM;AACf,gBAAI,CAAC,SAAS;AACZ,2BAAa;AAAA,YACf;AAAA,UACF,GAAG,KAAK,OAAO,cAAc;AAAA,QAC/B;AAAA,MACF,CAAC;AAED,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,MACL,OAAO;AAAA,MACP,MAAM,MAAM;AACV,kBAAU;AACV,wBAAgB,KAAK;AAAA,MACvB;AAAA,MACA,cAAc,MAAM,KAAK;AAAA,MACzB,oBAAoB,MAAM,KAAK;AAAA,IACjC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,eAAe,MAAoB;AACzC,SAAK,eAAe;AAGpB,QAAI,KAAK,YAAY,SAAS,KAAO;AACnC,WAAK,cAAc,KAAK,YAAY,MAAM,IAAK;AAAA,IACjD;AAEA,UAAM,EAAE,gBAAgB,OAAO,IAAI,KAAK,YAAY,IAAI;AAExD,QAAI,gBAAgB;AAClB,YAAM,MAAM,KAAK,IAAI;AAGrB,UAAI,MAAM,KAAK,gBAAgB,KAAM;AACnC,aAAK;AAAA,MACP,OAAO;AACL,aAAK,aAAa;AAAA,MACpB;AACA,WAAK,gBAAgB;AAGrB,UACE,KAAK,cAAc,KACnB,CAAC,KAAK,cACN,KAAK,oBAAoB,GACzB;AACA,gBAAQ,IAAI;AAAA,qCAAwC,MAAM,EAAE;AAC5D,aAAK,iBAAiB,MAAM;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,QAAsB;AAC7C,QAAI,KAAK,WAAY;AAErB,SAAK,aAAa;AAClB,SAAK;AACL,SAAK,kBAAkB,KAAK,aAAa,UAAU,YAAY;AAE/D,YAAQ;AAAA,MACN,2BAA2B,KAAK,eAAe,aAAa,MAAM;AAAA,IACpE;AAEA,QAAI,KAAK,OAAO,YAAY;AAC1B,WAAK,OAAO,WAAW,KAAK,iBAAiB,MAAM;AAAA,IACrD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAyB;AAC/B,WACE,KAAK,OAAO,WACZ,KAAK,eAAe,KAAK,OAAO,eAChC,KAAK,oBAAoB;AAAA,EAE7B;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,SAAK,aAAa;AAClB,SAAK,eAAe;AACpB,SAAK,aAAa;AAClB,SAAK,cAAc;AACnB,SAAK,kBAAkB;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKA,YAKE;AACA,WAAO;AAAA,MACL,YAAY,KAAK;AAAA,MACjB,iBAAiB,KAAK;AAAA,MACtB,cAAc,KAAK;AAAA,MACnB,mBAAmB,KAAK,oBAAoB;AAAA,IAC9C;AAAA,EACF;AACF;AAKO,SAAS,kBACd,SACA,MACA,UAII,CAAC,GACS;AACd,QAAM,UAAU,IAAI,gBAAgB;AAAA,IAClC,YAAY,QAAQ;AAAA,EACtB,CAAC;AAED,QAAM,UAAU,QAAQ,YAAY,SAAS,MAAM,OAAO;AAC1D,SAAO,QAAQ,MAAM;AACvB;AAKO,SAAS,qBAA6C;AAC3D,QAAM,SAAS,sBAAsB;AACrC,QAAM,MAA8B,CAAC;AAGrC,MAAI,OAAO,UAAU,SAAS;AAC5B,UAAM,mBAAmB,OAAO,UAAU,OAAO,SAAS,QAAQ;AAClE,QAAI,kBAAkB;AACpB,UAAI,+BAA+B,IAAI,OAAO,SAAS;AACvD,UAAI,4BAA4B,IAAI,iBAAiB;AACrD,UAAI,0BAA0B,IAAI,iBAAiB,WAAW;AAC9D,UAAI,8BAA8B,IAAI,iBAAiB;AAAA,IACzD;AAAA,EACF;AAEA,SAAO;AACT;",
+  "names": []
+}