@triedotdev/mcp 1.0.169 → 1.0.171

package/dist/chunk-KCUOWRPX.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/memory/issue-store.ts","../src/memory/bm25.ts","../src/memory/compactor.ts"],"sourcesContent":["/**\n * Issue Memory Store\n * \n * Working state cache complementary to the immutable ledger.\n * \n * Architecture:\n * - Ledger (.trie/memory/ledger.json) = immutable source of truth\n * - Issue Memory = mutable working state + BM25 search index\n * \n * Issue memory provides:\n * - Fast BM25 semantic search for pattern matching\n * - Mutable state tracking (resolved, open, fixed)\n * - Goal violation metrics and progress tracking\n * - Links back to ledger via ledgerBlockHash\n * \n * Phase 1 Hardening:\n * - SHA256 hashing for proper deduplication\n * - Atomic writes to prevent corruption\n * - Rotational backups for recovery\n * - Zod validation for data integrity\n */\n\nimport { mkdir, readFile, readdir } from 'fs/promises';\nimport { createHash } from 'crypto';\nimport { existsSync } from 'fs';\nimport { join } from 'path';\nimport { getWorkingDirectory, getTrieDirectory } from '../utils/workspace.js';\nimport type { Issue } from '../types/index.js';\nimport { BM25Index } from './bm25.js';\nimport { compactOldIssues, saveCompactedSummary, getHistoricalInsights } from './compactor.js';\nimport { atomicWriteJSON } from '../utils/atomic-write.js';\nimport { withFileLock } from '../utils/file-lock.js';\nimport { BackupManager } from '../utils/backup-manager.js';\nimport { IssueIndexSchema, safeParseAndValidate } from './validation.js';\nimport { appendIssuesToLedger } from './ledger.js';\n\nexport interface StoredIssue {\n  id: string;\n  hash: string;\n  severity: string;\n  issue: string;\n  fix: string;\n  file: string;\n  line: number | undefined;\n  agent: string;\n  category: string | undefined;\n  timestamp: string;\n  project: string;\n  resolved: boolean | undefined;\n  resolvedAt: string | undefined;\n  ledgerBlockHash?: string; // Link to immutable ledger record\n}\n\nexport interface IssueSearchResult {\n  issue: StoredIssue;\n  score: number;\n  matchType: 'bm25' | 'keyword' | 'fts5';\n}\n\nexport interface IssueMemoryStats {\n  totalIssues: number;\n  activeIssues: number;  // Unresolved issues\n  issuesByAgent: Record<string, number>;\n  issuesBySeverity: Record<string, number>;  // All issues (historical)\n  activeIssuesBySeverity: Record<string, number>;  // Only unresolved\n  oldestIssue: string | undefined;\n  newestIssue: string | undefined;\n  resolvedCount: number;\n  historicalIssues: number;\n  improvementTrend: 'improving' | 'stable' | 'declining' | 'unknown';\n  capacityInfo: {\n    current: number;\n    max: number;\n    percentFull: number;\n    isAtCap: boolean;\n  };\n  deduplicationStats: {\n    duplicatesAvoided: number;\n    uniquePatterns: number;\n  };\n}\n\n/**\n * Store issues and link them to the ledger\n * \n * Flow:\n * 1. Append to ledger (immutable source of truth)\n * 2. Cache in issue memory with ledger reference\n * \n * Returns number of unique issues added (after deduplication)\n */\nexport async function storeIssues(\n  issues: Issue[],\n  project: string,\n  workDir?: string\n): Promise<{ stored: number; duplicates: number }> {\n  const projectDir = workDir || getWorkingDirectory(undefined, true);\n  const memoryDir = join(getTrieDirectory(projectDir), 'memory');\n  await mkdir(memoryDir, { recursive: true });\n  \n  const stored: StoredIssue[] = [];\n  const now = new Date().toISOString();\n  const seenHashes = new Set<string>();\n  let duplicates = 0;\n  \n  for (const issue of issues) {\n    const hash = hashIssue(issue);\n    \n    // Skip duplicates within the same scan\n    if (seenHashes.has(hash)) {\n      duplicates++;\n      continue;\n    }\n    seenHashes.add(hash);\n    \n    const storedIssue: StoredIssue = {\n      id: issue.id,\n      hash,\n      severity: issue.severity,\n      issue: issue.issue,\n      fix: issue.fix,\n      file: issue.file,\n      line: issue.line,\n      agent: issue.agent,\n      category: issue.category,\n      timestamp: now,\n      project,\n      resolved: false,\n      resolvedAt: undefined,\n      ...(issue.ledgerBlockHash && { ledgerBlockHash: issue.ledgerBlockHash }),\n    };\n    stored.push(storedIssue);\n  }\n\n  // 1. Write to ledger (immutable source of truth)\n  const ledgerBlock = await appendIssuesToLedger(stored, projectDir);\n  \n  // 2. Link issues to their ledger block\n  if (ledgerBlock) {\n    for (const issue of stored) {\n      issue.ledgerBlockHash = ledgerBlock.blockHash;\n    }\n  }\n  \n  // 3. Cache in issue memory (working state + search index)\n  const dedupedCount = await updateIssueIndex(stored, projectDir);\n  \n  return { stored: dedupedCount, duplicates: duplicates + (stored.length - dedupedCount) };\n}\n\n/**\n * Search issues using BM25 ranking (same algorithm as Elasticsearch)\n */\nexport async function searchIssues(\n  query: string,\n  options: {\n    workDir?: string;\n    limit?: number;\n    project?: string;\n    severity?: string[];\n    agent?: string;\n    includeResolved?: boolean;\n  } = {}\n): Promise<IssueSearchResult[]> {\n  const projectDir = options.workDir || getWorkingDirectory(undefined, true);\n  const limit = options.limit || 10;\n  const allIssues = await loadIssueIndex(projectDir);\n  \n  if (allIssues.length === 0) {\n    return [];\n  }\n\n  // Filter issues first\n  const filteredIssues = allIssues.filter(issue => {\n    if (options.project && issue.project !== options.project) return false;\n    if (options.severity && !options.severity.includes(issue.severity)) return false;\n    if (options.agent && issue.agent !== options.agent) return false;\n    if (!options.includeResolved && issue.resolved) return false;\n    return true;\n  });\n\n  if (filteredIssues.length === 0) {\n    return [];\n  }\n\n  // Build BM25 index\n  const bm25 = new BM25Index();\n  const issueMap = new Map<string, StoredIssue>();\n  \n  for (const issue of filteredIssues) {\n    const searchText = `${issue.issue} ${issue.fix} ${issue.file} ${issue.agent} ${issue.category || ''} ${issue.severity}`;\n    bm25.addDocument({\n      id: issue.id,\n      text: searchText,\n    });\n    issueMap.set(issue.id, issue);\n  }\n\n  // Search with BM25\n  const bm25Results = bm25.search(query, limit);\n  \n  return bm25Results.map(result => ({\n    issue: issueMap.get(result.id)!,\n    score: result.score,\n    matchType: 'bm25' as const,\n  }));\n}\n\n/**\n * Find similar issues using BM25 similarity\n */\nexport async function findSimilarIssues(\n  issue: Issue,\n  options: {\n    workDir?: string;\n    limit?: number;\n    excludeSameFile?: boolean;\n  } = {}\n): Promise<IssueSearchResult[]> {\n  // Use the issue description and fix as the query for similarity\n  const query = `${issue.issue} ${issue.fix} ${issue.agent}`;\n  const searchOptions: Parameters<typeof searchIssues>[1] = {\n    limit: (options.limit || 5) + 5, // Get extra to account for filtering\n    includeResolved: true,\n  };\n  if (options.workDir !== undefined) {\n    searchOptions.workDir = options.workDir;\n  }\n  const results = await searchIssues(query, searchOptions);\n\n  let filtered = results.filter(r => r.issue.id !== issue.id);\n  \n  if (options.excludeSameFile) {\n    filtered = filtered.filter(r => r.issue.file !== issue.file);\n  }\n  \n  return filtered.slice(0, options.limit || 5);\n}\n\n/**\n * Mark an issue as resolved\n */\nexport async function markIssueResolved(\n  issueId: string,\n  workDir?: string\n): Promise<boolean> {\n  const projectDir = workDir || getWorkingDirectory(undefined, true);\n  const memoryDir = join(getTrieDirectory(projectDir), 'memory');\n  const indexPath = join(memoryDir, 'issues.json');\n  \n  // Use file locking to prevent concurrent write conflicts\n  return withFileLock(indexPath, async () => {\n    const index = await loadIssueIndex(projectDir);\n    \n    const issue = index.find(i => i.id === issueId);\n    if (!issue) return false;\n    \n    issue.resolved = true;\n    issue.resolvedAt = new Date().toISOString();\n    \n    await saveIssueIndexInternal(index, projectDir);\n    return true;\n  }, { timeout: 10000 });\n}\n\n/**\n * Auto-resolve issues that were not found in the latest scan\n * \n * After a scan completes, this function compares new issues against stored issues.\n * Issues that were previously found in scanned files but are no longer detected\n * are automatically marked as resolved.\n * \n * @param newIssueHashes - Set of hashes from the current scan\n * @param scannedFiles - List of files that were scanned (to scope resolution)\n * @param workDir - Working directory\n * @returns Number of issues auto-resolved\n */\nexport async function autoResolveIssues(\n  newIssueHashes: Set<string>,\n  scannedFiles: string[],\n  workDir?: string\n): Promise<{ resolved: number; stillActive: number }> {\n  const projectDir = workDir || getWorkingDirectory(undefined, true);\n  const memoryDir = join(getTrieDirectory(projectDir), 'memory');\n  const indexPath = join(memoryDir, 'issues.json');\n  \n  // Use file locking to prevent concurrent write conflicts\n  return withFileLock(indexPath, async () => {\n    const index = await loadIssueIndex(projectDir);\n    \n    // Normalize scanned file paths for comparison\n    const scannedFileSet = new Set(scannedFiles.map(f => f.replace(/\\\\/g, '/')));\n    \n    const now = new Date().toISOString();\n    let resolvedCount = 0;\n    let stillActiveCount = 0;\n    \n    for (const issue of index) {\n      // Skip already resolved issues\n      if (issue.resolved) continue;\n      \n      // Normalize the issue file path\n      const normalizedFile = issue.file.replace(/\\\\/g, '/');\n      \n      // Only auto-resolve issues in files that were scanned\n      // This prevents marking issues as resolved if we just did a partial scan\n      if (!scannedFileSet.has(normalizedFile)) {\n        stillActiveCount++;\n        continue;\n      }\n      \n      // If the issue's hash is NOT in the new scan results, it's been fixed\n      if (!newIssueHashes.has(issue.hash)) {\n        issue.resolved = true;\n        issue.resolvedAt = now;\n        resolvedCount++;\n      } else {\n        stillActiveCount++;\n      }\n    }\n    \n    // Only save if we resolved something\n    if (resolvedCount > 0) {\n      await saveIssueIndexInternal(index, projectDir);\n    }\n    \n    return { resolved: resolvedCount, stillActive: stillActiveCount };\n  }, { timeout: 15000 });\n}\n\n/**\n * Resolve goal violation issues for a specific file and goal\n * Called when a goal violation is fixed\n */\nexport async function resolveGoalViolation(\n  file: string,\n  goalDescription: string,\n  workDir?: string\n): Promise<number> {\n  const projectDir = workDir || getWorkingDirectory(undefined, true);\n  const memoryDir = join(getTrieDirectory(projectDir), 'memory');\n  const indexPath = join(memoryDir, 'issues.json');\n  \n  // Use file locking to prevent concurrent write conflicts\n  let resolvedCount = await withFileLock(indexPath, async () => {\n    const index = await loadIssueIndex(projectDir);\n    \n    const now = new Date().toISOString();\n    let count = 0;\n    \n    for (const issue of index) {\n      if (issue.resolved) continue;\n      if (issue.agent !== 'goal-violation') continue;\n      \n      // Match file and goal description\n      const normalizedFile = issue.file.replace(/\\\\/g, '/');\n      const normalizedTarget = file.replace(/\\\\/g, '/');\n      \n      if (normalizedFile === normalizedTarget && \n          issue.issue.includes(`Goal \"${goalDescription}\"`)) {\n        issue.resolved = true;\n        issue.resolvedAt = now;\n        count++;\n      }\n    }\n    \n    if (count > 0) {\n      await saveIssueIndexInternal(index, projectDir);\n    }\n    \n    return count;\n  }, { timeout: 10000 });\n  \n  // Always try to resolve nudges in SQL storage, even if issue-store had nothing\n  // This handles cases where nudges exist in SQL but not in the issue index\n  try {\n    const { getStorage } = await import('../storage/tiered-storage.js');\n    const storage = getStorage(projectDir);\n    await storage.initialize();\n    const nudgeResolved = await storage.resolveNudgesForGoalViolation(file, goalDescription, workDir);\n    if (nudgeResolved > 0) {\n      console.debug(`[IssueStore] Auto-resolved ${nudgeResolved} nudge(s) for fixed goal violation`);\n      resolvedCount += nudgeResolved;\n    }\n  } catch (e) {\n    console.debug('[IssueStore] Nudge resolution failed (non-fatal):', e);\n  }\n  \n  return resolvedCount;\n}\n\n/**\n * Get hash for an issue (for external callers)\n */\nexport function getIssueHash(issue: Issue): string {\n  return hashIssue(issue);\n}\n\n/**\n * Get memory statistics including historical insights\n */\nexport async function getMemoryStats(workDir?: string): Promise<IssueMemoryStats> {\n  const projectDir = workDir || getWorkingDirectory(undefined, true);\n  const index = await loadIssueIndex(projectDir);\n  const historical = await getHistoricalInsights(projectDir);\n  \n  const MAX_ISSUES = 10000;\n  const uniqueHashes = new Set(index.map(i => i.hash));\n  \n  const stats: IssueMemoryStats = {\n    totalIssues: index.length,\n    activeIssues: 0,\n    issuesByAgent: {},\n    issuesBySeverity: {},\n    activeIssuesBySeverity: {},\n    oldestIssue: undefined,\n    newestIssue: undefined,\n    resolvedCount: 0,\n    historicalIssues: historical.totalHistoricalIssues,\n    improvementTrend: historical.improvementTrend,\n    capacityInfo: {\n      current: index.length,\n      max: MAX_ISSUES,\n      percentFull: Math.round((index.length / MAX_ISSUES) * 100),\n      isAtCap: index.length >= MAX_ISSUES,\n    },\n    deduplicationStats: {\n      duplicatesAvoided: index.length - uniqueHashes.size,\n      uniquePatterns: uniqueHashes.size,\n    },\n  };\n\n  for (const issue of index) {\n    stats.issuesByAgent[issue.agent] = (stats.issuesByAgent[issue.agent] || 0) + 1;\n    stats.issuesBySeverity[issue.severity] = (stats.issuesBySeverity[issue.severity] || 0) + 1;\n    \n    if (issue.resolved) {\n      stats.resolvedCount++;\n    } else {\n      stats.activeIssues++;\n      stats.activeIssuesBySeverity[issue.severity] = (stats.activeIssuesBySeverity[issue.severity] || 0) + 1;\n    }\n  }\n\n  if (index.length > 0) {\n    const sorted = [...index].sort((a, b) => \n      new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime()\n    );\n    const oldest = sorted[0]?.timestamp;\n    const newest = sorted[sorted.length - 1]?.timestamp;\n    if (oldest !== undefined) {\n      stats.oldestIssue = oldest;\n    }\n    if (newest !== undefined) {\n      stats.newestIssue = newest;\n    }\n  }\n\n  return stats;\n}\n\n/**\n * Get recent issues\n * @param options.includeResolved - If false (default), only returns unresolved issues\n */\nexport async function getRecentIssues(\n  options: {\n    workDir?: string;\n    limit?: number;\n    daysBack?: number;\n    includeResolved?: boolean;\n  } = {}\n): Promise<StoredIssue[]> {\n  const projectDir = options.workDir || getWorkingDirectory(undefined, true);\n  const index = await loadIssueIndex(projectDir);\n  const limit = options.limit || 20;\n  const daysBack = options.daysBack || 7;\n  const includeResolved = options.includeResolved ?? false;\n  \n  const cutoff = new Date();\n  cutoff.setDate(cutoff.getDate() - daysBack);\n  \n  return index\n    .filter(i => {\n      if (new Date(i.timestamp) < cutoff) return false;\n      if (!includeResolved && i.resolved) return false;\n      return true;\n    })\n    .sort((a, b) => new Date(b.timestamp).getTime() - new Date(a.timestamp).getTime())\n    .slice(0, limit);\n}\n\n/**\n * Purge issues from memory\n * Offers different strategies for managing memory capacity\n */\nexport async function purgeIssues(\n  strategy: 'smart' | 'resolved' | 'old' | 'all',\n  options: {\n    workDir?: string;\n    daysOld?: number;\n  } = {}\n): Promise<{ removed: number; remaining: number; strategy: string }> {\n  const projectDir = options.workDir || getWorkingDirectory(undefined, true);\n  const memoryDir = join(getTrieDirectory(projectDir), 'memory');\n  const indexPath = join(memoryDir, 'issues.json');\n  \n  // Use file locking to prevent concurrent write conflicts\n  return withFileLock(indexPath, async () => {\n    const index = await loadIssueIndex(projectDir);\n    const originalCount = index.length;\n    \n    let remaining: StoredIssue[] = [];\n    \n    switch (strategy) {\n      case 'smart':\n        // Keep: critical/high severity, recent (< 30 days), unresolved\n        const thirtyDaysAgo = new Date();\n        thirtyDaysAgo.setDate(thirtyDaysAgo.getDate() - 30);\n        \n        remaining = index.filter(i => {\n          const isRecent = new Date(i.timestamp) >= thirtyDaysAgo;\n          const isImportant = ['critical', 'high'].includes(i.severity);\n          const isUnresolved = !i.resolved;\n          \n          return isRecent || isImportant || isUnresolved;\n        });\n        break;\n        \n      case 'resolved':\n        // Remove all resolved issues\n        remaining = index.filter(i => !i.resolved);\n        break;\n        \n      case 'old':\n        // Remove issues older than specified days (default 90)\n        const daysOld = options.daysOld || 90;\n        const cutoffDate = new Date();\n        cutoffDate.setDate(cutoffDate.getDate() - daysOld);\n        \n        remaining = index.filter(i => new Date(i.timestamp) >= cutoffDate);\n        break;\n        \n      case 'all':\n        // Clear all issues (keeps compacted summaries)\n        remaining = [];\n        break;\n    }\n    \n    await saveIssueIndexInternal(remaining, projectDir);\n  \n    return {\n      removed: originalCount - remaining.length,\n      remaining: remaining.length,\n      strategy,\n    };\n  }, { timeout: 10000 });\n}\n\n/**\n * Get daily log files (legacy - deprecated)\n * \n * Note: Daily logs are redundant with the ledger.\n * The ledger provides the same information with better guarantees.\n * This function is kept for backward compatibility.\n */\nexport async function getDailyLogs(workDir?: string): Promise<string[]> {\n  const projectDir = workDir || getWorkingDirectory(undefined, true);\n  const memoryDir = join(getTrieDirectory(projectDir), 'memory');\n  \n  try {\n    if (!existsSync(memoryDir)) return [];\n    const files = await readdir(memoryDir);\n    return files\n      .filter(f => /^\\d{4}-\\d{2}-\\d{2}\\.md$/.test(f))\n      .sort()\n      .reverse();\n  } catch {\n    return [];\n  }\n}\n\n// Private helpers\n\n/**\n * Get ledger entry for an issue\n * \n * Issue memory stores working state (resolved, etc.)\n * Ledger stores immutable history (what was detected, when)\n * \n * This helper links them together for full context.\n */\nexport async function getIssueLedgerEntry(\n  issue: StoredIssue,\n  workDir?: string\n): Promise<{ block: any; entry: any } | null> {\n  if (!issue.ledgerBlockHash) return null;\n  \n  const projectDir = workDir || getWorkingDirectory(undefined, true);\n  const { getLedgerBlocks } = await import('./ledger.js');\n  const blocks = await getLedgerBlocks(projectDir);\n  \n  // Find the block this issue is linked to\n  const block = blocks.find(b => b.blockHash === issue.ledgerBlockHash);\n  if (!block) return null;\n  \n  // Find the specific entry in that block\n  const entry = block.entries.find((e: any) => e.hash === issue.hash);\n  if (!entry) return null;\n  \n  return { block, entry };\n}\n\n// Private helpers\n\n/**\n * Load issue index with validation and auto-recovery\n * \n * If the file is corrupted:\n * 1. Attempts to recover from the most recent valid backup\n * 2. Returns empty array if no valid backup exists\n */\nasync function loadIssueIndex(projectDir: string): Promise<StoredIssue[]> {\n  const indexPath = join(getTrieDirectory(projectDir), 'memory', 'issues.json');\n  \n  try {\n    if (existsSync(indexPath)) {\n      const content = await readFile(indexPath, 'utf-8');\n      const result = safeParseAndValidate(content, IssueIndexSchema);\n      \n      if (result.success) {\n        return result.data as StoredIssue[];\n      }\n      \n      // Validation failed - attempt recovery from backup\n      const errorMsg = 'success' in result && !result.success ? (result as any).error : 'Unknown validation error';\n      console.error(`   Issue index corrupted: ${errorMsg}`);\n      const backupManager = new BackupManager(indexPath);\n      \n      if (await backupManager.recoverFromBackup()) {\n        console.error('   ✅ Recovered from backup');\n        const recovered = await readFile(indexPath, 'utf-8');\n        const recoveredResult = safeParseAndValidate(recovered, IssueIndexSchema);\n        if (recoveredResult.success) {\n          return recoveredResult.data as StoredIssue[];\n        }\n      }\n      \n      console.error('   No valid backup found, starting fresh');\n    }\n  } catch {\n    // Index doesn't exist or recovery failed\n  }\n  \n  return [];\n}\n\nasync function updateIssueIndex(newIssues: StoredIssue[], projectDir: string): Promise<number> {\n  const memoryDir = join(getTrieDirectory(projectDir), 'memory');\n  await mkdir(memoryDir, { recursive: true });\n  \n  const indexPath = join(memoryDir, 'issues.json');\n  \n  // Use file locking to prevent concurrent write conflicts\n  return withFileLock(indexPath, async () => {\n    let existing = await loadIssueIndex(projectDir);\n    \n    // Intelligent deduplication: only add truly unique issues\n    // Issues are unique if they have different hash (content + file + severity + agent)\n    const hashSet = new Set(existing.map(i => i.hash));\n    const toAdd = newIssues.filter(i => !hashSet.has(i.hash));\n    const dedupedCount = toAdd.length;\n    \n    existing = [...existing, ...toAdd];\n    \n    // Intelligent compaction: summarize old issues instead of deleting\n    if (existing.length > 500) {\n      const { summary, remaining } = await compactOldIssues(existing, {\n        keepDays: 30,\n        minIssuesToCompact: 100,\n      });\n      \n      if (summary) {\n        await saveCompactedSummary(summary, projectDir);\n        existing = remaining;\n      }\n    }\n    \n    // Hard cap: prune to 10,000 if still too large\n    // Prioritize: 1) Recent issues, 2) High severity, 3) Unresolved\n    if (existing.length > 10000) {\n      existing = intelligentPrune(existing, 10000);\n    }\n    \n    // Use internal save since lock is already held\n    await saveIssueIndexInternal(existing, projectDir);\n    return dedupedCount;\n  }, { timeout: 15000 });\n}\n\n/**\n * Intelligently prune issues to target count\n * Prioritizes: recent, high severity, unresolved\n */\nfunction intelligentPrune(issues: StoredIssue[], targetCount: number): StoredIssue[] {\n  const severityWeight: Record<string, number> = {\n    critical: 100,\n    high: 50,\n    moderate: 20,\n    low: 10,\n    info: 5,\n  };\n  \n  const scored = issues.map(issue => {\n    const ageInDays = (Date.now() - new Date(issue.timestamp).getTime()) / (1000 * 60 * 60 * 24);\n    const recencyScore = Math.max(0, 100 - ageInDays * 2); // Newer = higher score\n    const severityScore = severityWeight[issue.severity] || 10;\n    const resolvedPenalty = issue.resolved ? -50 : 0;\n    \n    return {\n      issue,\n      score: recencyScore + severityScore + resolvedPenalty,\n    };\n  });\n  \n  return scored\n    .sort((a, b) => b.score - a.score)\n    .slice(0, targetCount)\n    .map(s => s.issue);\n}\n\n/**\n * Save issue index with backup and atomic write\n * \n * This is the internal version that doesn't acquire locks.\n * All public functions that call this should acquire locks first.\n * \n * 1. Creates a backup of the existing file\n * 2. Writes the new data atomically (temp file + rename)\n * 3. Maintains up to 5 rotational backups\n */\nasync function saveIssueIndexInternal(issues: StoredIssue[], projectDir: string): Promise<void> {\n  const memoryDir = join(getTrieDirectory(projectDir), 'memory');\n  await mkdir(memoryDir, { recursive: true });\n  \n  const indexPath = join(memoryDir, 'issues.json');\n  \n  // Create backup before writing\n  const backupManager = new BackupManager(indexPath);\n  await backupManager.createBackup();\n  \n  // Atomic write\n  await atomicWriteJSON(indexPath, issues);\n}\n\n/**\n * Hash an issue using SHA256 for proper deduplication\n * \n * Uses cryptographic hashing to eliminate collision risk.\n * The hash is truncated to 16 characters for storage efficiency\n * while still providing effectively zero collision probability.\n */\nfunction hashIssue(issue: Issue): string {\n  const content = `${issue.issue}|${issue.file}|${issue.severity}|${issue.agent}`;\n  return createHash('sha256').update(content).digest('hex').slice(0, 16);\n}\n\n","/**\n * BM25 Search Implementation\n * \n * BM25 (Best Match 25) is a ranking function used by search engines.\n * It's more sophisticated than TF-IDF and handles term frequency saturation.\n * \n * This is the same algorithm used by Elasticsearch.\n */\n\nexport interface BM25Document {\n  id: string;\n  text: string;\n  metadata?: Record<string, unknown>;\n}\n\nexport interface BM25Result {\n  id: string;\n  score: number;\n  metadata?: Record<string, unknown>;\n}\n\nexport class BM25Index {\n  private documents: Map<string, BM25Document> = new Map();\n  private termFrequencies: Map<string, Map<string, number>> = new Map();\n  private documentFrequencies: Map<string, number> = new Map();\n  private documentLengths: Map<string, number> = new Map();\n  private avgDocLength: number = 0;\n  private k1: number = 1.5;\n  private b: number = 0.75;\n\n  /**\n   * Add a document to the index\n   */\n  addDocument(doc: BM25Document): void {\n    const tokens = this.tokenize(doc.text);\n    this.documents.set(doc.id, doc);\n    this.documentLengths.set(doc.id, tokens.length);\n\n    const termFreq = new Map<string, number>();\n    const seenTerms = new Set<string>();\n\n    for (const token of tokens) {\n      termFreq.set(token, (termFreq.get(token) || 0) + 1);\n      \n      if (!seenTerms.has(token)) {\n        seenTerms.add(token);\n        this.documentFrequencies.set(token, (this.documentFrequencies.get(token) || 0) + 1);\n      }\n    }\n\n    this.termFrequencies.set(doc.id, termFreq);\n    this.updateAvgDocLength();\n  }\n\n  /**\n   * Add multiple documents\n   */\n  addDocuments(docs: BM25Document[]): void {\n    for (const doc of docs) {\n      this.addDocument(doc);\n    }\n  }\n\n  /**\n   * Search the index\n   */\n  search(query: string, limit: number = 10): BM25Result[] {\n    const queryTokens = this.tokenize(query);\n    const scores: Map<string, number> = new Map();\n    const N = this.documents.size;\n\n    for (const [docId] of this.documents) {\n      let score = 0;\n      const docLength = this.documentLengths.get(docId) || 0;\n      const termFreqs = this.termFrequencies.get(docId);\n\n      if (!termFreqs) continue;\n\n      for (const term of queryTokens) {\n        const tf = termFreqs.get(term) || 0;\n        if (tf === 0) continue;\n\n        const df = this.documentFrequencies.get(term) || 0;\n        const idf = Math.log((N - df + 0.5) / (df + 0.5) + 1);\n\n        const numerator = tf * (this.k1 + 1);\n        const denominator = tf + this.k1 * (1 - this.b + this.b * (docLength / this.avgDocLength));\n        \n        score += idf * (numerator / denominator);\n      }\n\n      if (score > 0) {\n        scores.set(docId, score);\n      }\n    }\n\n    return Array.from(scores.entries())\n      .sort((a, b) => b[1] - a[1])\n      .slice(0, limit)\n      .map(([id, score]) => {\n        const metadata = this.documents.get(id)?.metadata;\n        const result: BM25Result = { id, score };\n        if (metadata !== undefined) {\n          result.metadata = metadata;\n        }\n        return result;\n      });\n  }\n\n  /**\n   * Get document count\n   */\n  get size(): number {\n    return this.documents.size;\n  }\n\n  /**\n   * Clear the index\n   */\n  clear(): void {\n    this.documents.clear();\n    this.termFrequencies.clear();\n    this.documentFrequencies.clear();\n    this.documentLengths.clear();\n    this.avgDocLength = 0;\n  }\n\n  /**\n   * Serialize the index to JSON\n   */\n  serialize(): string {\n    return JSON.stringify({\n      documents: Array.from(this.documents.entries()),\n      termFrequencies: Array.from(this.termFrequencies.entries()).map(([k, v]) => [k, Array.from(v.entries())]),\n      documentFrequencies: Array.from(this.documentFrequencies.entries()),\n      documentLengths: Array.from(this.documentLengths.entries()),\n      avgDocLength: this.avgDocLength,\n    });\n  }\n\n  /**\n   * Load from serialized JSON\n   */\n  static deserialize(json: string): BM25Index {\n    const data = JSON.parse(json);\n    const index = new BM25Index();\n    \n    index.documents = new Map(data.documents);\n    index.termFrequencies = new Map(data.termFrequencies.map(([k, v]: [string, [string, number][]]) => [k, new Map(v)]));\n    index.documentFrequencies = new Map(data.documentFrequencies);\n    index.documentLengths = new Map(data.documentLengths);\n    index.avgDocLength = data.avgDocLength;\n    \n    return index;\n  }\n\n  private tokenize(text: string): string[] {\n    return text\n      .toLowerCase()\n      .replace(/[^\\w\\s]/g, ' ')\n      .split(/\\s+/)\n      .filter(token => token.length > 2 && !this.isStopWord(token));\n  }\n\n  private isStopWord(word: string): boolean {\n    const stopWords = new Set([\n      'the', 'be', 'to', 'of', 'and', 'a', 'in', 'that', 'have', 'i',\n      'it', 'for', 'not', 'on', 'with', 'he', 'as', 'you', 'do', 'at',\n      'this', 'but', 'his', 'by', 'from', 'they', 'we', 'say', 'her', 'she',\n      'or', 'an', 'will', 'my', 'one', 'all', 'would', 'there', 'their', 'what',\n      'so', 'up', 'out', 'if', 'about', 'who', 'get', 'which', 'go', 'me',\n      'when', 'make', 'can', 'like', 'time', 'no', 'just', 'him', 'know', 'take',\n      'into', 'year', 'your', 'some', 'could', 'them', 'see', 'other', 'than', 'then',\n      'now', 'look', 'only', 'come', 'its', 'over', 'also', 'back', 'after', 'use',\n      'two', 'how', 'our', 'first', 'way', 'even', 'new', 'want', 'because', 'any',\n      'these', 'give', 'day', 'most', 'us', 'should', 'been', 'has', 'was', 'are',\n    ]);\n    return stopWords.has(word);\n  }\n\n  private updateAvgDocLength(): void {\n    if (this.documentLengths.size === 0) {\n      this.avgDocLength = 0;\n      return;\n    }\n    const total = Array.from(this.documentLengths.values()).reduce((a, b) => a + b, 0);\n    this.avgDocLength = total / this.documentLengths.size;\n  }\n}\n","/**\n * Memory Compactor\n * \n * Intelligently compacts old issues into summaries instead of deleting them.\n * Preserves patterns and insights while reducing storage.\n * \n * Phase 1 Hardening:\n * - Atomic writes to prevent corruption\n * - Backup rotation for recovery\n * - Zod validation for data integrity\n */\n\nimport { mkdir, readFile } from 'fs/promises';\nimport { existsSync } from 'fs';\nimport { join } from 'path';\nimport { getTrieDirectory } from '../utils/workspace.js';\nimport type { StoredIssue } from './issue-store.js';\nimport { atomicWriteJSON } from '../utils/atomic-write.js';\nimport { BackupManager } from '../utils/backup-manager.js';\nimport { CompactedSummariesIndexSchema, safeParseAndValidate } from './validation.js';\n\nexport interface CompactedSummary {\n  period: string;\n  startDate: string;\n  endDate: string;\n  totalIssues: number;\n  resolvedCount: number;\n  bySeverity: Record<string, number>;\n  byAgent: Record<string, number>;\n  topPatterns: PatternSummary[];\n  hotFiles: { file: string; count: number }[];\n  compactedAt: string;\n}\n\nexport interface PatternSummary {\n  pattern: string;\n  count: number;\n  severity: string;\n  agent: string;\n  exampleFix: string;\n}\n\n/**\n * Compact old issues into summaries\n * Returns the compacted summary and the remaining (recent) issues\n */\nexport async function compactOldIssues(\n  issues: StoredIssue[],\n  options: {\n    keepDays?: number;\n    minIssuesToCompact?: number;\n  } = {}\n): Promise<{ summary: CompactedSummary | null; remaining: StoredIssue[] }> {\n  const keepDays = options.keepDays ?? 30;\n  const minIssues = options.minIssuesToCompact ?? 100;\n  \n  const cutoffDate = new Date();\n  cutoffDate.setDate(cutoffDate.getDate() - keepDays);\n  \n  const oldIssues = issues.filter(i => new Date(i.timestamp) < cutoffDate);\n  const recentIssues = issues.filter(i => new Date(i.timestamp) >= cutoffDate);\n  \n  // Only compact if we have enough old issues\n  if (oldIssues.length < minIssues) {\n    return { summary: null, remaining: issues };\n  }\n  \n  // Build summary\n  const summary = buildSummary(oldIssues);\n  \n  return { summary, remaining: recentIssues };\n}\n\n/**\n * Build a summary from a set of issues\n */\nfunction buildSummary(issues: StoredIssue[]): CompactedSummary {\n  const sorted = issues.sort((a, b) => \n    new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime()\n  );\n  \n  const bySeverity: Record<string, number> = {};\n  const byAgent: Record<string, number> = {};\n  const patternMap: Map<string, { count: number; issue: StoredIssue }> = new Map();\n  const fileCount: Map<string, number> = new Map();\n  \n  for (const issue of issues) {\n    // Count by severity\n    bySeverity[issue.severity] = (bySeverity[issue.severity] || 0) + 1;\n    \n    // Count by agent\n    byAgent[issue.agent] = (byAgent[issue.agent] || 0) + 1;\n    \n    // Track patterns (normalized issue text)\n    const patternKey = normalizePattern(issue.issue);\n    const existing = patternMap.get(patternKey);\n    if (existing) {\n      existing.count++;\n    } else {\n      patternMap.set(patternKey, { count: 1, issue });\n    }\n    \n    // Count files\n    const fileName = issue.file.split('/').pop() || issue.file;\n    fileCount.set(fileName, (fileCount.get(fileName) || 0) + 1);\n  }\n  \n  // Get top patterns\n  const topPatterns = Array.from(patternMap.entries())\n    .sort((a, b) => b[1].count - a[1].count)\n    .slice(0, 10)\n    .map(([pattern, data]) => ({\n      pattern: pattern.slice(0, 100),\n      count: data.count,\n      severity: data.issue.severity,\n      agent: data.issue.agent,\n      exampleFix: data.issue.fix.slice(0, 200),\n    }));\n  \n  // Get hot files\n  const hotFiles = Array.from(fileCount.entries())\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, 10)\n    .map(([file, count]) => ({ file, count }));\n  \n  return {\n    period: `${sorted[0]?.timestamp.split('T')[0]} to ${sorted[sorted.length - 1]?.timestamp.split('T')[0]}`,\n    startDate: sorted[0]?.timestamp || '',\n    endDate: sorted[sorted.length - 1]?.timestamp || '',\n    totalIssues: issues.length,\n    resolvedCount: issues.filter(i => i.resolved).length,\n    bySeverity,\n    byAgent,\n    topPatterns,\n    hotFiles,\n    compactedAt: new Date().toISOString(),\n  };\n}\n\n/**\n * Normalize issue text for pattern matching\n */\nfunction normalizePattern(text: string): string {\n  return text\n    .toLowerCase()\n    .replace(/`[^`]+`/g, 'CODE')\n    .replace(/\\b\\d+\\b/g, 'N')\n    .replace(/[\"']/g, '')\n    .replace(/\\s+/g, ' ')\n    .trim()\n    .slice(0, 150);\n}\n\n/**\n * Save compacted summary to disk with atomic write and backup\n */\nexport async function saveCompactedSummary(\n  summary: CompactedSummary,\n  projectDir: string\n): Promise<void> {\n  const memoryDir = join(getTrieDirectory(projectDir), 'memory');\n  await mkdir(memoryDir, { recursive: true });\n  \n  const summaryPath = join(memoryDir, 'compacted-summaries.json');\n  \n  let summaries: CompactedSummary[] = [];\n  try {\n    if (existsSync(summaryPath)) {\n      const content = await readFile(summaryPath, 'utf-8');\n      const result = safeParseAndValidate(content, CompactedSummariesIndexSchema);\n      if (result.success) {\n        summaries = result.data as CompactedSummary[];\n      }\n    }\n  } catch {\n    summaries = [];\n  }\n  \n  summaries.push(summary);\n  \n  // Keep only last 12 summaries (1 year of monthly summaries)\n  if (summaries.length > 12) {\n    summaries = summaries.slice(-12);\n  }\n  \n  // Create backup before writing\n  const backupManager = new BackupManager(summaryPath);\n  await backupManager.createBackup();\n  \n  // Atomic write\n  await atomicWriteJSON(summaryPath, summaries);\n}\n\n/**\n * Load compacted summaries with validation and auto-recovery\n */\nexport async function loadCompactedSummaries(projectDir: string): Promise<CompactedSummary[]> {\n  const summaryPath = join(getTrieDirectory(projectDir), 'memory', 'compacted-summaries.json');\n  \n  try {\n    if (existsSync(summaryPath)) {\n      const content = await readFile(summaryPath, 'utf-8');\n      const result = safeParseAndValidate(content, CompactedSummariesIndexSchema);\n      \n      if (result.success) {\n        return result.data as CompactedSummary[];\n      }\n      \n      // Validation failed - attempt recovery\n      const backupManager = new BackupManager(summaryPath);\n      if (await backupManager.recoverFromBackup()) {\n        const recovered = await readFile(summaryPath, 'utf-8');\n        const recoveredResult = safeParseAndValidate(recovered, CompactedSummariesIndexSchema);\n        if (recoveredResult.success) {\n          return recoveredResult.data as CompactedSummary[];\n        }\n      }\n    }\n  } catch {\n    // File doesn't exist or recovery failed\n  }\n  \n  return [];\n}\n\n/**\n * Generate a markdown summary of compacted history\n */\nexport function formatCompactedSummary(summary: CompactedSummary): string {\n  const lines: string[] = [\n    `## Compacted Summary: ${summary.period}`,\n    '',\n    `**Total Issues:** ${summary.totalIssues} (${summary.resolvedCount} resolved)`,\n    '',\n    '### By Severity',\n    ...Object.entries(summary.bySeverity).map(([s, c]) => `- ${s}: ${c}`),\n    '',\n    '### Top Patterns',\n    ...summary.topPatterns.slice(0, 5).map(p => \n      `- **${p.pattern.slice(0, 50)}...** (${p.count}x, ${p.severity})`\n    ),\n    '',\n    '### Hot Files',\n    ...summary.hotFiles.slice(0, 5).map(f => `- ${f.file}: ${f.count} issues`),\n  ];\n  \n  return lines.join('\\n');\n}\n\n/**\n * Get insights from compacted history\n */\nexport async function getHistoricalInsights(projectDir: string): Promise<{\n  totalHistoricalIssues: number;\n  recurringPatterns: PatternSummary[];\n  improvementTrend: 'improving' | 'stable' | 'declining' | 'unknown';\n}> {\n  const summaries = await loadCompactedSummaries(projectDir);\n  \n  if (summaries.length === 0) {\n    return {\n      totalHistoricalIssues: 0,\n      recurringPatterns: [],\n      improvementTrend: 'unknown',\n    };\n  }\n  \n  const totalHistoricalIssues = summaries.reduce((sum, s) => sum + s.totalIssues, 0);\n  \n  // Find patterns that appear across multiple summaries\n  const patternCounts: Map<string, PatternSummary & { appearances: number }> = new Map();\n  \n  for (const summary of summaries) {\n    for (const pattern of summary.topPatterns) {\n      const key = pattern.pattern;\n      const existing = patternCounts.get(key);\n      if (existing) {\n        existing.count += pattern.count;\n        existing.appearances++;\n      } else {\n        patternCounts.set(key, { ...pattern, appearances: 1 });\n      }\n    }\n  }\n  \n  const recurringPatterns = Array.from(patternCounts.values())\n    .filter(p => p.appearances >= 2)\n    .sort((a, b) => b.count - a.count)\n    .slice(0, 5);\n  \n  // Calculate improvement trend\n  let improvementTrend: 'improving' | 'stable' | 'declining' | 'unknown' = 'unknown';\n  \n  if (summaries.length >= 2) {\n    const recent = summaries.slice(-2);\n    const olderCount = recent[0]?.totalIssues || 0;\n    const newerCount = recent[1]?.totalIssues || 0;\n    \n    if (newerCount < olderCount * 0.8) {\n      improvementTrend = 'improving';\n    } else if (newerCount > olderCount * 1.2) {\n      improvementTrend = 'declining';\n    } else {\n      improvementTrend = 'stable';\n    }\n  }\n  \n  return {\n    totalHistoricalIssues,\n    recurringPatterns,\n    improvementTrend,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAsBA,SAAS,SAAAA,QAAO,YAAAC,WAAU,eAAe;AACzC,SAAS,kBAAkB;AAC3B,SAAS,cAAAC,mBAAkB;AAC3B,SAAS,QAAAC,aAAY;;;ACJd,IAAM,YAAN,MAAM,WAAU;AAAA,EACb,YAAuC,oBAAI,IAAI;AAAA,EAC/C,kBAAoD,oBAAI,IAAI;AAAA,EAC5D,sBAA2C,oBAAI,IAAI;AAAA,EACnD,kBAAuC,oBAAI,IAAI;AAAA,EAC/C,eAAuB;AAAA,EACvB,KAAa;AAAA,EACb,IAAY;AAAA;AAAA;AAAA;AAAA,EAKpB,YAAY,KAAyB;AACnC,UAAM,SAAS,KAAK,SAAS,IAAI,IAAI;AACrC,SAAK,UAAU,IAAI,IAAI,IAAI,GAAG;AAC9B,SAAK,gBAAgB,IAAI,IAAI,IAAI,OAAO,MAAM;AAE9C,UAAM,WAAW,oBAAI,IAAoB;AACzC,UAAM,YAAY,oBAAI,IAAY;AAElC,eAAW,SAAS,QAAQ;AAC1B,eAAS,IAAI,QAAQ,SAAS,IAAI,KAAK,KAAK,KAAK,CAAC;AAElD,UAAI,CAAC,UAAU,IAAI,KAAK,GAAG;AACzB,kBAAU,IAAI,KAAK;AACnB,aAAK,oBAAoB,IAAI,QAAQ,KAAK,oBAAoB,IAAI,KAAK,KAAK,KAAK,CAAC;AAAA,MACpF;AAAA,IACF;AAEA,SAAK,gBAAgB,IAAI,IAAI,IAAI,QAAQ;AACzC,SAAK,mBAAmB;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,MAA4B;AACvC,eAAW,OAAO,MAAM;AACtB,WAAK,YAAY,GAAG;AAAA,IACtB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,OAAe,QAAgB,IAAkB;AACtD,UAAM,cAAc,KAAK,SAAS,KAAK;AACvC,UAAM,SAA8B,oBAAI,IAAI;AAC5C,UAAM,IAAI,KAAK,UAAU;AAEzB,eAAW,CAAC,KAAK,KAAK,KAAK,WAAW;AACpC,UAAI,QAAQ;AACZ,YAAM,YAAY,KAAK,gBAAgB,IAAI,KAAK,KAAK;AACrD,YAAM,YAAY,KAAK,gBAAgB,IAAI,KAAK;AAEhD,UAAI,CAAC,UAAW;AAEhB,iBAAW,QAAQ,aAAa;AAC9B,cAAM,KAAK,UAAU,IAAI,IAAI,KAAK;AAClC,YAAI,OAAO,EAAG;AAEd,cAAM,KAAK,KAAK,oBAAoB,IAAI,IAAI,KAAK;AACjD,cAAM,MAAM,KAAK,KAAK,IAAI,KAAK,QAAQ,KAAK,OAAO,CAAC;AAEpD,cAAM,YAAY,MAAM,KAAK,KAAK;AAClC,cAAM,cAAc,KAAK,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK,KAAK,YAAY,KAAK;AAE5E,iBAAS,OAAO,YAAY;AAAA,MAC9B;AAEA,UAAI,QAAQ,GAAG;AACb,eAAO,IAAI,OAAO,KAAK;AAAA,MACzB;AAAA,IACF;AAEA,WAAO,MAAM,KAAK,OAAO,QAAQ,CAAC,EAC/B,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,KAAK,EACd,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;AACpB,YAAM,WAAW,KAAK,UAAU,IAAI,EAAE,GAAG;AACzC,YAAM,SAAqB,EAAE,IAAI,MAAM;AACvC,UAAI,aAAa,QAAW;AAC1B,eAAO,WAAW;AAAA,MACpB;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,OAAe;AACjB,WAAO,KAAK,UAAU;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,SAAK,UAAU,MAAM;AACrB,SAAK,gBAAgB,MAAM;AAC3B,SAAK,oBAAoB,MAAM;AAC/B,SAAK,gBAAgB,MAAM;AAC3B,SAAK,eAAe;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,YAAoB;AAClB,WAAO,KAAK,UAAU;AAAA,MACpB,WAAW,MAAM,KAAK,KAAK,UAAU,QAAQ,CAAC;AAAA,MAC9C,iBAAiB,MAAM,KAAK,KAAK,gBAAgB,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;AAAA,MACxG,qBAAqB,MAAM,KAAK,KAAK,oBAAoB,QAAQ,CAAC;AAAA,MAClE,iBAAiB,MAAM,KAAK,KAAK,gBAAgB,QAAQ,CAAC;AAAA,MAC1D,cAAc,KAAK;AAAA,IACrB,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,YAAY,MAAyB;AAC1C,UAAM,OAAO,KAAK,MAAM,IAAI;AAC5B,UAAM,QAAQ,IAAI,WAAU;AAE5B,UAAM,YAAY,IAAI,IAAI,KAAK,SAAS;AACxC,UAAM,kBAAkB,IAAI,IAAI,KAAK,gBAAgB,IAAI,CAAC,CAAC,GAAG,CAAC,MAAoC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AACnH,UAAM,sBAAsB,IAAI,IAAI,KAAK,mBAAmB;AAC5D,UAAM,kBAAkB,IAAI,IAAI,KAAK,eAAe;AACpD,UAAM,eAAe,KAAK;AAE1B,WAAO;AAAA,EACT;AAAA,EAEQ,SAAS,MAAwB;AACvC,WAAO,KACJ,YAAY,EACZ,QAAQ,YAAY,GAAG,EACvB,MAAM,KAAK,EACX,OAAO,WAAS,MAAM,SAAS,KAAK,CAAC,KAAK,WAAW,KAAK,CAAC;AAAA,EAChE;AAAA,EAEQ,WAAW,MAAuB;AACxC,UAAM,YAAY,oBAAI,IAAI;AAAA,MACxB;AAAA,MAAO;AAAA,MAAM;AAAA,MAAM;AAAA,MAAM;AAAA,MAAO;AAAA,MAAK;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAC3D;AAAA,MAAM;AAAA,MAAO;AAAA,MAAO;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAM;AAAA,MAAM;AAAA,MAAO;AAAA,MAAM;AAAA,MAC3D;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAO;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAM;AAAA,MAAO;AAAA,MAAO;AAAA,MAChE;AAAA,MAAM;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAM;AAAA,MAAO;AAAA,MAAO;AAAA,MAAS;AAAA,MAAS;AAAA,MAAS;AAAA,MACnE;AAAA,MAAM;AAAA,MAAM;AAAA,MAAO;AAAA,MAAM;AAAA,MAAS;AAAA,MAAO;AAAA,MAAO;AAAA,MAAS;AAAA,MAAM;AAAA,MAC/D;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAQ;AAAA,MACpE;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAS;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAS;AAAA,MAAQ;AAAA,MACzE;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAQ;AAAA,MAAS;AAAA,MACvE;AAAA,MAAO;AAAA,MAAO;AAAA,MAAO;AAAA,MAAS;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAW;AAAA,MACvE;AAAA,MAAS;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAQ;AAAA,MAAM;AAAA,MAAU;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAO;AAAA,IACxE,CAAC;AACD,WAAO,UAAU,IAAI,IAAI;AAAA,EAC3B;AAAA,EAEQ,qBAA2B;AACjC,QAAI,KAAK,gBAAgB,SAAS,GAAG;AACnC,WAAK,eAAe;AACpB;AAAA,IACF;AACA,UAAM,QAAQ,MAAM,KAAK,KAAK,gBAAgB,OAAO,CAAC,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AACjF,SAAK,eAAe,QAAQ,KAAK,gBAAgB;AAAA,EACnD;AACF;;;AChLA,SAAS,OAAO,gBAAgB;AAChC,SAAS,kBAAkB;AAC3B,SAAS,YAAY;AAgCrB,eAAsB,iBACpB,QACA,UAGI,CAAC,GACoE;AACzE,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,YAAY,QAAQ,sBAAsB;AAEhD,QAAM,aAAa,oBAAI,KAAK;AAC5B,aAAW,QAAQ,WAAW,QAAQ,IAAI,QAAQ;AAElD,QAAM,YAAY,OAAO,OAAO,OAAK,IAAI,KAAK,EAAE,SAAS,IAAI,UAAU;AACvE,QAAM,eAAe,OAAO,OAAO,OAAK,IAAI,KAAK,EAAE,SAAS,KAAK,UAAU;AAG3E,MAAI,UAAU,SAAS,WAAW;AAChC,WAAO,EAAE,SAAS,MAAM,WAAW,OAAO;AAAA,EAC5C;AAGA,QAAM,UAAU,aAAa,SAAS;AAEtC,SAAO,EAAE,SAAS,WAAW,aAAa;AAC5C;AAKA,SAAS,aAAa,QAAyC;AAC7D,QAAM,SAAS,OAAO;AAAA,IAAK,CAAC,GAAG,MAC7B,IAAI,KAAK,EAAE,SAAS,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,SAAS,EAAE,QAAQ;AAAA,EAClE;AAEA,QAAM,aAAqC,CAAC;AAC5C,QAAM,UAAkC,CAAC;AACzC,QAAM,aAAiE,oBAAI,IAAI;AAC/E,QAAM,YAAiC,oBAAI,IAAI;AAE/C,aAAW,SAAS,QAAQ;AAE1B,eAAW,MAAM,QAAQ,KAAK,WAAW,MAAM,QAAQ,KAAK,KAAK;AAGjE,YAAQ,MAAM,KAAK,KAAK,QAAQ,MAAM,KAAK,KAAK,KAAK;AAGrD,UAAM,aAAa,iBAAiB,MAAM,KAAK;AAC/C,UAAM,WAAW,WAAW,IAAI,UAAU;AAC1C,QAAI,UAAU;AACZ,eAAS;AAAA,IACX,OAAO;AACL,iBAAW,IAAI,YAAY,EAAE,OAAO,GAAG,MAAM,CAAC;AAAA,IAChD;AAGA,UAAM,WAAW,MAAM,KAAK,MAAM,GAAG,EAAE,IAAI,KAAK,MAAM;AACtD,cAAU,IAAI,WAAW,UAAU,IAAI,QAAQ,KAAK,KAAK,CAAC;AAAA,EAC5D;AAGA,QAAM,cAAc,MAAM,KAAK,WAAW,QAAQ,CAAC,EAChD,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EACtC,MAAM,GAAG,EAAE,EACX,IAAI,CAAC,CAAC,SAAS,IAAI,OAAO;AAAA,IACzB,SAAS,QAAQ,MAAM,GAAG,GAAG;AAAA,IAC7B,OAAO,KAAK;AAAA,IACZ,UAAU,KAAK,MAAM;AAAA,IACrB,OAAO,KAAK,MAAM;AAAA,IAClB,YAAY,KAAK,MAAM,IAAI,MAAM,GAAG,GAAG;AAAA,EACzC,EAAE;AAGJ,QAAM,WAAW,MAAM,KAAK,UAAU,QAAQ,CAAC,EAC5C,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,EAAE,EACX,IAAI,CAAC,CAAC,MAAM,KAAK,OAAO,EAAE,MAAM,MAAM,EAAE;AAE3C,SAAO;AAAA,IACL,QAAQ,GAAG,OAAO,CAAC,GAAG,UAAU,MAAM,GAAG,EAAE,CAAC,CAAC,OAAO,OAAO,OAAO,SAAS,CAAC,GAAG,UAAU,MAAM,GAAG,EAAE,CAAC,CAAC;AAAA,IACtG,WAAW,OAAO,CAAC,GAAG,aAAa;AAAA,IACnC,SAAS,OAAO,OAAO,SAAS,CAAC,GAAG,aAAa;AAAA,IACjD,aAAa,OAAO;AAAA,IACpB,eAAe,OAAO,OAAO,OAAK,EAAE,QAAQ,EAAE;AAAA,IAC9C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,EACtC;AACF;AAKA,SAAS,iBAAiB,MAAsB;AAC9C,SAAO,KACJ,YAAY,EACZ,QAAQ,YAAY,MAAM,EAC1B,QAAQ,YAAY,GAAG,EACvB,QAAQ,SAAS,EAAE,EACnB,QAAQ,QAAQ,GAAG,EACnB,KAAK,EACL,MAAM,GAAG,GAAG;AACjB;AAKA,eAAsB,qBACpB,SACA,YACe;AACf,QAAM,YAAY,KAAK,iBAAiB,UAAU,GAAG,QAAQ;AAC7D,QAAM,MAAM,WAAW,EAAE,WAAW,KAAK,CAAC;AAE1C,QAAM,cAAc,KAAK,WAAW,0BAA0B;AAE9D,MAAI,YAAgC,CAAC;AACrC,MAAI;AACF,QAAI,WAAW,WAAW,GAAG;AAC3B,YAAM,UAAU,MAAM,SAAS,aAAa,OAAO;AACnD,YAAM,SAAS,qBAAqB,SAAS,6BAA6B;AAC1E,UAAI,OAAO,SAAS;AAClB,oBAAY,OAAO;AAAA,MACrB;AAAA,IACF;AAAA,EACF,QAAQ;AACN,gBAAY,CAAC;AAAA,EACf;AAEA,YAAU,KAAK,OAAO;AAGtB,MAAI,UAAU,SAAS,IAAI;AACzB,gBAAY,UAAU,MAAM,GAAG;AAAA,EACjC;AAGA,QAAM,gBAAgB,IAAI,cAAc,WAAW;AACnD,QAAM,cAAc,aAAa;AAGjC,QAAM,gBAAgB,aAAa,SAAS;AAC9C;AAKA,eAAsB,uBAAuB,YAAiD;AAC5F,QAAM,cAAc,KAAK,iBAAiB,UAAU,GAAG,UAAU,0BAA0B;AAE3F,MAAI;AACF,QAAI,WAAW,WAAW,GAAG;AAC3B,YAAM,UAAU,MAAM,SAAS,aAAa,OAAO;AACnD,YAAM,SAAS,qBAAqB,SAAS,6BAA6B;AAE1E,UAAI,OAAO,SAAS;AAClB,eAAO,OAAO;AAAA,MAChB;AAGA,YAAM,gBAAgB,IAAI,cAAc,WAAW;AACnD,UAAI,MAAM,cAAc,kBAAkB,GAAG;AAC3C,cAAM,YAAY,MAAM,SAAS,aAAa,OAAO;AACrD,cAAM,kBAAkB,qBAAqB,WAAW,6BAA6B;AACrF,YAAI,gBAAgB,SAAS;AAC3B,iBAAO,gBAAgB;AAAA,QACzB;AAAA,MACF;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AAEA,SAAO,CAAC;AACV;AA6BA,eAAsB,sBAAsB,YAIzC;AACD,QAAM,YAAY,MAAM,uBAAuB,UAAU;AAEzD,MAAI,UAAU,WAAW,GAAG;AAC1B,WAAO;AAAA,MACL,uBAAuB;AAAA,MACvB,mBAAmB,CAAC;AAAA,MACpB,kBAAkB;AAAA,IACpB;AAAA,EACF;AAEA,QAAM,wBAAwB,UAAU,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,aAAa,CAAC;AAGjF,QAAM,gBAAuE,oBAAI,IAAI;AAErF,aAAW,WAAW,WAAW;AAC/B,eAAW,WAAW,QAAQ,aAAa;AACzC,YAAM,MAAM,QAAQ;AACpB,YAAM,WAAW,cAAc,IAAI,GAAG;AACtC,UAAI,UAAU;AACZ,iBAAS,SAAS,QAAQ;AAC1B,iBAAS;AAAA,MACX,OAAO;AACL,sBAAc,IAAI,KAAK,EAAE,GAAG,SAAS,aAAa,EAAE,CAAC;AAAA,MACvD;AAAA,IACF;AAAA,EACF;AAEA,QAAM,oBAAoB,MAAM,KAAK,cAAc,OAAO,CAAC,EACxD,OAAO,OAAK,EAAE,eAAe,CAAC,EAC9B,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,CAAC;AAGb,MAAI,mBAAqE;AAEzE,MAAI,UAAU,UAAU,GAAG;AACzB,UAAM,SAAS,UAAU,MAAM,EAAE;AACjC,UAAM,aAAa,OAAO,CAAC,GAAG,eAAe;AAC7C,UAAM,aAAa,OAAO,CAAC,GAAG,eAAe;AAE7C,QAAI,aAAa,aAAa,KAAK;AACjC,yBAAmB;AAAA,IACrB,WAAW,aAAa,aAAa,KAAK;AACxC,yBAAmB;AAAA,IACrB,OAAO;AACL,yBAAmB;AAAA,IACrB;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AF7NA,eAAsB,YACpB,QACA,SACA,SACiD;AACjD,QAAM,aAAa,WAAW,oBAAoB,QAAW,IAAI;AACjE,QAAM,YAAYC,MAAK,iBAAiB,UAAU,GAAG,QAAQ;AAC7D,QAAMC,OAAM,WAAW,EAAE,WAAW,KAAK,CAAC;AAE1C,QAAM,SAAwB,CAAC;AAC/B,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,QAAM,aAAa,oBAAI,IAAY;AACnC,MAAI,aAAa;AAEjB,aAAW,SAAS,QAAQ;AAC1B,UAAM,OAAO,UAAU,KAAK;AAG5B,QAAI,WAAW,IAAI,IAAI,GAAG;AACxB;AACA;AAAA,IACF;AACA,eAAW,IAAI,IAAI;AAEnB,UAAM,cAA2B;AAAA,MAC/B,IAAI,MAAM;AAAA,MACV;AAAA,MACA,UAAU,MAAM;AAAA,MAChB,OAAO,MAAM;AAAA,MACb,KAAK,MAAM;AAAA,MACX,MAAM,MAAM;AAAA,MACZ,MAAM,MAAM;AAAA,MACZ,OAAO,MAAM;AAAA,MACb,UAAU,MAAM;AAAA,MAChB,WAAW;AAAA,MACX;AAAA,MACA,UAAU;AAAA,MACV,YAAY;AAAA,MACZ,GAAI,MAAM,mBAAmB,EAAE,iBAAiB,MAAM,gBAAgB;AAAA,IACxE;AACA,WAAO,KAAK,WAAW;AAAA,EACzB;AAGA,QAAM,cAAc,MAAM,qBAAqB,QAAQ,UAAU;AAGjE,MAAI,aAAa;AACf,eAAW,SAAS,QAAQ;AAC1B,YAAM,kBAAkB,YAAY;AAAA,IACtC;AAAA,EACF;AAGA,QAAM,eAAe,MAAM,iBAAiB,QAAQ,UAAU;AAE9D,SAAO,EAAE,QAAQ,cAAc,YAAY,cAAc,OAAO,SAAS,cAAc;AACzF;AAKA,eAAsB,aACpB,OACA,UAOI,CAAC,GACyB;AAC9B,QAAM,aAAa,QAAQ,WAAW,oBAAoB,QAAW,IAAI;AACzE,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,YAAY,MAAM,eAAe,UAAU;AAEjD,MAAI,UAAU,WAAW,GAAG;AAC1B,WAAO,CAAC;AAAA,EACV;AAGA,QAAM,iBAAiB,UAAU,OAAO,WAAS;AAC/C,QAAI,QAAQ,WAAW,MAAM,YAAY,QAAQ,QAAS,QAAO;AACjE,QAAI,QAAQ,YAAY,CAAC,QAAQ,SAAS,SAAS,MAAM,QAAQ,EAAG,QAAO;AAC3E,QAAI,QAAQ,SAAS,MAAM,UAAU,QAAQ,MAAO,QAAO;AAC3D,QAAI,CAAC,QAAQ,mBAAmB,MAAM,SAAU,QAAO;AACvD,WAAO;AAAA,EACT,CAAC;AAED,MAAI,eAAe,WAAW,GAAG;AAC/B,WAAO,CAAC;AAAA,EACV;AAGA,QAAM,OAAO,IAAI,UAAU;AAC3B,QAAM,WAAW,oBAAI,IAAyB;AAE9C,aAAW,SAAS,gBAAgB;AAClC,UAAM,aAAa,GAAG,MAAM,KAAK,IAAI,MAAM,GAAG,IAAI,MAAM,IAAI,IAAI,MAAM,KAAK,IAAI,MAAM,YAAY,EAAE,IAAI,MAAM,QAAQ;AACrH,SAAK,YAAY;AAAA,MACf,IAAI,MAAM;AAAA,MACV,MAAM;AAAA,IACR,CAAC;AACD,aAAS,IAAI,MAAM,IAAI,KAAK;AAAA,EAC9B;AAGA,QAAM,cAAc,KAAK,OAAO,OAAO,KAAK;AAE5C,SAAO,YAAY,IAAI,aAAW;AAAA,IAChC,OAAO,SAAS,IAAI,OAAO,EAAE;AAAA,IAC7B,OAAO,OAAO;AAAA,IACd,WAAW;AAAA,EACb,EAAE;AACJ;AAKA,eAAsB,kBACpB,OACA,UAII,CAAC,GACyB;AAE9B,QAAM,QAAQ,GAAG,MAAM,KAAK,IAAI,MAAM,GAAG,IAAI,MAAM,KAAK;AACxD,QAAM,gBAAoD;AAAA,IACxD,QAAQ,QAAQ,SAAS,KAAK;AAAA;AAAA,IAC9B,iBAAiB;AAAA,EACnB;AACA,MAAI,QAAQ,YAAY,QAAW;AACjC,kBAAc,UAAU,QAAQ;AAAA,EAClC;AACA,QAAM,UAAU,MAAM,aAAa,OAAO,aAAa;AAEvD,MAAI,WAAW,QAAQ,OAAO,OAAK,EAAE,MAAM,OAAO,MAAM,EAAE;AAE1D,MAAI,QAAQ,iBAAiB;AAC3B,eAAW,SAAS,OAAO,OAAK,EAAE,MAAM,SAAS,MAAM,IAAI;AAAA,EAC7D;AAEA,SAAO,SAAS,MAAM,GAAG,QAAQ,SAAS,CAAC;AAC7C;AAKA,eAAsB,kBACpB,SACA,SACkB;AAClB,QAAM,aAAa,WAAW,oBAAoB,QAAW,IAAI;AACjE,QAAM,YAAYD,MAAK,iBAAiB,UAAU,GAAG,QAAQ;AAC7D,QAAM,YAAYA,MAAK,WAAW,aAAa;AAG/C,SAAO,aAAa,WAAW,YAAY;AACzC,UAAM,QAAQ,MAAM,eAAe,UAAU;AAE7C,UAAM,QAAQ,MAAM,KAAK,OAAK,EAAE,OAAO,OAAO;AAC9C,QAAI,CAAC,MAAO,QAAO;AAEnB,UAAM,WAAW;AACjB,UAAM,cAAa,oBAAI,KAAK,GAAE,YAAY;AAE1C,UAAM,uBAAuB,OAAO,UAAU;AAC9C,WAAO;AAAA,EACT,GAAG,EAAE,SAAS,IAAM,CAAC;AACvB;AAcA,eAAsB,kBACpB,gBACA,cACA,SACoD;AACpD,QAAM,aAAa,WAAW,oBAAoB,QAAW,IAAI;AACjE,QAAM,YAAYA,MAAK,iBAAiB,UAAU,GAAG,QAAQ;AAC7D,QAAM,YAAYA,MAAK,WAAW,aAAa;AAG/C,SAAO,aAAa,WAAW,YAAY;AACzC,UAAM,QAAQ,MAAM,eAAe,UAAU;AAG7C,UAAM,iBAAiB,IAAI,IAAI,aAAa,IAAI,OAAK,EAAE,QAAQ,OAAO,GAAG,CAAC,CAAC;AAE3E,UAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,QAAI,gBAAgB;AACpB,QAAI,mBAAmB;AAEvB,eAAW,SAAS,OAAO;AAEzB,UAAI,MAAM,SAAU;AAGpB,YAAM,iBAAiB,MAAM,KAAK,QAAQ,OAAO,GAAG;AAIpD,UAAI,CAAC,eAAe,IAAI,cAAc,GAAG;AACvC;AACA;AAAA,MACF;AAGA,UAAI,CAAC,eAAe,IAAI,MAAM,IAAI,GAAG;AACnC,cAAM,WAAW;AACjB,cAAM,aAAa;AACnB;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAGA,QAAI,gBAAgB,GAAG;AACrB,YAAM,uBAAuB,OAAO,UAAU;AAAA,IAChD;AAEA,WAAO,EAAE,UAAU,eAAe,aAAa,iBAAiB;AAAA,EAClE,GAAG,EAAE,SAAS,KAAM,CAAC;AACvB;AAMA,eAAsB,qBACpB,MACA,iBACA,SACiB;AACjB,QAAM,aAAa,WAAW,oBAAoB,QAAW,IAAI;AACjE,QAAM,YAAYA,MAAK,iBAAiB,UAAU,GAAG,QAAQ;AAC7D,QAAM,YAAYA,MAAK,WAAW,aAAa;AAG/C,MAAI,gBAAgB,MAAM,aAAa,WAAW,YAAY;AAC5D,UAAM,QAAQ,MAAM,eAAe,UAAU;AAE7C,UAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,QAAI,QAAQ;AAEZ,eAAW,SAAS,OAAO;AACzB,UAAI,MAAM,SAAU;AACpB,UAAI,MAAM,UAAU,iBAAkB;AAGtC,YAAM,iBAAiB,MAAM,KAAK,QAAQ,OAAO,GAAG;AACpD,YAAM,mBAAmB,KAAK,QAAQ,OAAO,GAAG;AAEhD,UAAI,mBAAmB,oBACnB,MAAM,MAAM,SAAS,SAAS,eAAe,GAAG,GAAG;AACrD,cAAM,WAAW;AACjB,cAAM,aAAa;AACnB;AAAA,MACF;AAAA,IACF;AAEA,QAAI,QAAQ,GAAG;AACb,YAAM,uBAAuB,OAAO,UAAU;AAAA,IAChD;AAEA,WAAO;AAAA,EACT,GAAG,EAAE,SAAS,IAAM,CAAC;AAIrB,MAAI;AACF,UAAM,EAAE,WAAW,IAAI,MAAM,OAAO,8BAA8B;AAClE,UAAM,UAAU,WAAW,UAAU;AACrC,UAAM,QAAQ,WAAW;AACzB,UAAM,gBAAgB,MAAM,QAAQ,8BAA8B,MAAM,iBAAiB,OAAO;AAChG,QAAI,gBAAgB,GAAG;AACrB,cAAQ,MAAM,8BAA8B,aAAa,oCAAoC;AAC7F,uBAAiB;AAAA,IACnB;AAAA,EACF,SAAS,GAAG;AACV,YAAQ,MAAM,qDAAqD,CAAC;AAAA,EACtE;AAEA,SAAO;AACT;AAKO,SAAS,aAAa,OAAsB;AACjD,SAAO,UAAU,KAAK;AACxB;AAKA,eAAsB,eAAe,SAA6C;AAChF,QAAM,aAAa,WAAW,oBAAoB,QAAW,IAAI;AACjE,QAAM,QAAQ,MAAM,eAAe,UAAU;AAC7C,QAAM,aAAa,MAAM,sBAAsB,UAAU;AAEzD,QAAM,aAAa;AACnB,QAAM,eAAe,IAAI,IAAI,MAAM,IAAI,OAAK,EAAE,IAAI,CAAC;AAEnD,QAAM,QAA0B;AAAA,IAC9B,aAAa,MAAM;AAAA,IACnB,cAAc;AAAA,IACd,eAAe,CAAC;AAAA,IAChB,kBAAkB,CAAC;AAAA,IACnB,wBAAwB,CAAC;AAAA,IACzB,aAAa;AAAA,IACb,aAAa;AAAA,IACb,eAAe;AAAA,IACf,kBAAkB,WAAW;AAAA,IAC7B,kBAAkB,WAAW;AAAA,IAC7B,cAAc;AAAA,MACZ,SAAS,MAAM;AAAA,MACf,KAAK;AAAA,MACL,aAAa,KAAK,MAAO,MAAM,SAAS,aAAc,GAAG;AAAA,MACzD,SAAS,MAAM,UAAU;AAAA,IAC3B;AAAA,IACA,oBAAoB;AAAA,MAClB,mBAAmB,MAAM,SAAS,aAAa;AAAA,MAC/C,gBAAgB,aAAa;AAAA,IAC/B;AAAA,EACF;AAEA,aAAW,SAAS,OAAO;AACzB,UAAM,cAAc,MAAM,KAAK,KAAK,MAAM,cAAc,MAAM,KAAK,KAAK,KAAK;AAC7E,UAAM,iBAAiB,MAAM,QAAQ,KAAK,MAAM,iBAAiB,MAAM,QAAQ,KAAK,KAAK;AAEzF,QAAI,MAAM,UAAU;AAClB,YAAM;AAAA,IACR,OAAO;AACL,YAAM;AACN,YAAM,uBAAuB,MAAM,QAAQ,KAAK,MAAM,uBAAuB,MAAM,QAAQ,KAAK,KAAK;AAAA,IACvG;AAAA,EACF;AAEA,MAAI,MAAM,SAAS,GAAG;AACpB,UAAM,SAAS,CAAC,GAAG,KAAK,EAAE;AAAA,MAAK,CAAC,GAAG,MACjC,IAAI,KAAK,EAAE,SAAS,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,SAAS,EAAE,QAAQ;AAAA,IAClE;AACA,UAAM,SAAS,OAAO,CAAC,GAAG;AAC1B,UAAM,SAAS,OAAO,OAAO,SAAS,CAAC,GAAG;AAC1C,QAAI,WAAW,QAAW;AACxB,YAAM,cAAc;AAAA,IACtB;AACA,QAAI,WAAW,QAAW;AACxB,YAAM,cAAc;AAAA,IACtB;AAAA,EACF;AAEA,SAAO;AACT;AAMA,eAAsB,gBACpB,UAKI,CAAC,GACmB;AACxB,QAAM,aAAa,QAAQ,WAAW,oBAAoB,QAAW,IAAI;AACzE,QAAM,QAAQ,MAAM,eAAe,UAAU;AAC7C,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,kBAAkB,QAAQ,mBAAmB;AAEnD,QAAM,SAAS,oBAAI,KAAK;AACxB,SAAO,QAAQ,OAAO,QAAQ,IAAI,QAAQ;AAE1C,SAAO,MACJ,OAAO,OAAK;AACX,QAAI,IAAI,KAAK,EAAE,SAAS,IAAI,OAAQ,QAAO;AAC3C,QAAI,CAAC,mBAAmB,EAAE,SAAU,QAAO;AAC3C,WAAO;AAAA,EACT,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,IAAI,KAAK,EAAE,SAAS,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,EAChF,MAAM,GAAG,KAAK;AACnB;AAMA,eAAsB,YACpB,UACA,UAGI,CAAC,GAC8D;AACnE,QAAM,aAAa,QAAQ,WAAW,oBAAoB,QAAW,IAAI;AACzE,QAAM,YAAYA,MAAK,iBAAiB,UAAU,GAAG,QAAQ;AAC7D,QAAM,YAAYA,MAAK,WAAW,aAAa;AAG/C,SAAO,aAAa,WAAW,YAAY;AACzC,UAAM,QAAQ,MAAM,eAAe,UAAU;AAC7C,UAAM,gBAAgB,MAAM;AAE5B,QAAI,YAA2B,CAAC;AAEhC,YAAQ,UAAU;AAAA,MAChB,KAAK;AAEH,cAAM,gBAAgB,oBAAI,KAAK;AAC/B,sBAAc,QAAQ,cAAc,QAAQ,IAAI,EAAE;AAElD,oBAAY,MAAM,OAAO,OAAK;AAC5B,gBAAM,WAAW,IAAI,KAAK,EAAE,SAAS,KAAK;AAC1C,gBAAM,cAAc,CAAC,YAAY,MAAM,EAAE,SAAS,EAAE,QAAQ;AAC5D,gBAAM,eAAe,CAAC,EAAE;AAExB,iBAAO,YAAY,eAAe;AAAA,QACpC,CAAC;AACD;AAAA,MAEF,KAAK;AAEH,oBAAY,MAAM,OAAO,OAAK,CAAC,EAAE,QAAQ;AACzC;AAAA,MAEF,KAAK;AAEH,cAAM,UAAU,QAAQ,WAAW;AACnC,cAAM,aAAa,oBAAI,KAAK;AAC5B,mBAAW,QAAQ,WAAW,QAAQ,IAAI,OAAO;AAEjD,oBAAY,MAAM,OAAO,OAAK,IAAI,KAAK,EAAE,SAAS,KAAK,UAAU;AACjE;AAAA,MAEF,KAAK;AAEH,oBAAY,CAAC;AACb;AAAA,IACJ;AAEA,UAAM,uBAAuB,WAAW,UAAU;AAElD,WAAO;AAAA,MACL,SAAS,gBAAgB,UAAU;AAAA,MACnC,WAAW,UAAU;AAAA,MACrB;AAAA,IACF;AAAA,EACF,GAAG,EAAE,SAAS,IAAM,CAAC;AACvB;AASA,eAAsB,aAAa,SAAqC;AACtE,QAAM,aAAa,WAAW,oBAAoB,QAAW,IAAI;AACjE,QAAM,YAAYA,MAAK,iBAAiB,UAAU,GAAG,QAAQ;AAE7D,MAAI;AACF,QAAI,CAACE,YAAW,SAAS,EAAG,QAAO,CAAC;AACpC,UAAM,QAAQ,MAAM,QAAQ,SAAS;AACrC,WAAO,MACJ,OAAO,OAAK,0BAA0B,KAAK,CAAC,CAAC,EAC7C,KAAK,EACL,QAAQ;AAAA,EACb,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAYA,eAAsB,oBACpB,OACA,SAC4C;AAC5C,MAAI,CAAC,MAAM,gBAAiB,QAAO;AAEnC,QAAM,aAAa,WAAW,oBAAoB,QAAW,IAAI;AACjE,QAAM,EAAE,gBAAgB,IAAI,MAAM,OAAO,sBAAa;AACtD,QAAM,SAAS,MAAM,gBAAgB,UAAU;AAG/C,QAAM,QAAQ,OAAO,KAAK,OAAK,EAAE,cAAc,MAAM,eAAe;AACpE,MAAI,CAAC,MAAO,QAAO;AAGnB,QAAM,QAAQ,MAAM,QAAQ,KAAK,CAAC,MAAW,EAAE,SAAS,MAAM,IAAI;AAClE,MAAI,CAAC,MAAO,QAAO;AAEnB,SAAO,EAAE,OAAO,MAAM;AACxB;AAWA,eAAe,eAAe,YAA4C;AACxE,QAAM,YAAYF,MAAK,iBAAiB,UAAU,GAAG,UAAU,aAAa;AAE5E,MAAI;AACF,QAAIE,YAAW,SAAS,GAAG;AACzB,YAAM,UAAU,MAAMC,UAAS,WAAW,OAAO;AACjD,YAAM,SAAS,qBAAqB,SAAS,gBAAgB;AAE7D,UAAI,OAAO,SAAS;AAClB,eAAO,OAAO;AAAA,MAChB;AAGA,YAAM,WAAW,aAAa,UAAU,CAAC,OAAO,UAAW,OAAe,QAAQ;AAClF,cAAQ,MAAM,6BAA6B,QAAQ,EAAE;AACrD,YAAM,gBAAgB,IAAI,cAAc,SAAS;AAEjD,UAAI,MAAM,cAAc,kBAAkB,GAAG;AAC3C,gBAAQ,MAAM,iCAA4B;AAC1C,cAAM,YAAY,MAAMA,UAAS,WAAW,OAAO;AACnD,cAAM,kBAAkB,qBAAqB,WAAW,gBAAgB;AACxE,YAAI,gBAAgB,SAAS;AAC3B,iBAAO,gBAAgB;AAAA,QACzB;AAAA,MACF;AAEA,cAAQ,MAAM,0CAA0C;AAAA,IAC1D;AAAA,EACF,QAAQ;AAAA,EAER;AAEA,SAAO,CAAC;AACV;AAEA,eAAe,iBAAiB,WAA0B,YAAqC;AAC7F,QAAM,YAAYH,MAAK,iBAAiB,UAAU,GAAG,QAAQ;AAC7D,QAAMC,OAAM,WAAW,EAAE,WAAW,KAAK,CAAC;AAE1C,QAAM,YAAYD,MAAK,WAAW,aAAa;AAG/C,SAAO,aAAa,WAAW,YAAY;AACzC,QAAI,WAAW,MAAM,eAAe,UAAU;AAI9C,UAAM,UAAU,IAAI,IAAI,SAAS,IAAI,OAAK,EAAE,IAAI,CAAC;AACjD,UAAM,QAAQ,UAAU,OAAO,OAAK,CAAC,QAAQ,IAAI,EAAE,IAAI,CAAC;AACxD,UAAM,eAAe,MAAM;AAE3B,eAAW,CAAC,GAAG,UAAU,GAAG,KAAK;AAGjC,QAAI,SAAS,SAAS,KAAK;AACzB,YAAM,EAAE,SAAS,UAAU,IAAI,MAAM,iBAAiB,UAAU;AAAA,QAC9D,UAAU;AAAA,QACV,oBAAoB;AAAA,MACtB,CAAC;AAED,UAAI,SAAS;AACX,cAAM,qBAAqB,SAAS,UAAU;AAC9C,mBAAW;AAAA,MACb;AAAA,IACF;AAIA,QAAI,SAAS,SAAS,KAAO;AAC3B,iBAAW,iBAAiB,UAAU,GAAK;AAAA,IAC7C;AAGA,UAAM,uBAAuB,UAAU,UAAU;AACjD,WAAO;AAAA,EACT,GAAG,EAAE,SAAS,KAAM,CAAC;AACvB;AAMA,SAAS,iBAAiB,QAAuB,aAAoC;AACnF,QAAM,iBAAyC;AAAA,IAC7C,UAAU;AAAA,IACV,MAAM;AAAA,IACN,UAAU;AAAA,IACV,KAAK;AAAA,IACL,MAAM;AAAA,EACR;AAEA,QAAM,SAAS,OAAO,IAAI,WAAS;AACjC,UAAM,aAAa,KAAK,IAAI,IAAI,IAAI,KAAK,MAAM,SAAS,EAAE,QAAQ,MAAM,MAAO,KAAK,KAAK;AACzF,UAAM,eAAe,KAAK,IAAI,GAAG,MAAM,YAAY,CAAC;AACpD,UAAM,gBAAgB,eAAe,MAAM,QAAQ,KAAK;AACxD,UAAM,kBAAkB,MAAM,WAAW,MAAM;AAE/C,WAAO;AAAA,MACL;AAAA,MACA,OAAO,eAAe,gBAAgB;AAAA,IACxC;AAAA,EACF,CAAC;AAED,SAAO,OACJ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,WAAW,EACpB,IAAI,OAAK,EAAE,KAAK;AACrB;AAYA,eAAe,uBAAuB,QAAuB,YAAmC;AAC9F,QAAM,YAAYA,MAAK,iBAAiB,UAAU,GAAG,QAAQ;AAC7D,QAAMC,OAAM,WAAW,EAAE,WAAW,KAAK,CAAC;AAE1C,QAAM,YAAYD,MAAK,WAAW,aAAa;AAG/C,QAAM,gBAAgB,IAAI,cAAc,SAAS;AACjD,QAAM,cAAc,aAAa;AAGjC,QAAM,gBAAgB,WAAW,MAAM;AACzC;AASA,SAAS,UAAU,OAAsB;AACvC,QAAM,UAAU,GAAG,MAAM,KAAK,IAAI,MAAM,IAAI,IAAI,MAAM,QAAQ,IAAI,MAAM,KAAK;AAC7E,SAAO,WAAW,QAAQ,EAAE,OAAO,OAAO,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AACvE;","names":["mkdir","readFile","existsSync","join","join","mkdir","existsSync","readFile"]}

package/dist/chunk-KDHN2ZQE.js

@@ -1,313 +0,0 @@
-// src/utils/progress.ts
-var _interactiveMode = false;
-function setInteractiveMode(enabled) {
-  _interactiveMode = enabled;
-}
-function isInteractiveMode() {
-  return _interactiveMode;
-}
-var ProgressReporter = class {
-  currentPhase = "init";
-  startTime = Date.now();
-  phaseStartTime = Date.now();
-  verbose;
-  constructor(options = {}) {
-    this.verbose = options.verbose ?? true;
-  }
-  /**
-   * Report a status update
-   */
-  report(message, detail) {
-    if (!this.verbose || _interactiveMode) return;
-    const prefix = this.getPhaseIcon(this.currentPhase);
-    const fullMessage = detail ? `${message}: ${detail}` : message;
-    console.error(`${prefix} ${fullMessage}`);
-  }
-  /**
-   * Start a new phase
-   */
-  startPhase(phase, message) {
-    this.currentPhase = phase;
-    this.phaseStartTime = Date.now();
-    this.report(message);
-  }
-  /**
-   * Update within current phase
-   */
-  update(message, detail) {
-    this.report(message, detail);
-  }
-  /**
-   * Report progress on a file
-   */
-  file(action, filePath) {
-    const fileName = filePath.split("/").pop() || filePath;
-    this.report(action, fileName);
-  }
-  /**
-   * Report an AI analysis step
-   */
-  ai(action, context) {
-    if (_interactiveMode) return;
-    const prefix = "[AI]";
-    const message = context ? `${action}: ${context}` : action;
-    console.error(`${prefix} ${message}`);
-  }
-  /**
-   * Report a finding
-   */
-  finding(severity, message) {
-    if (_interactiveMode) return;
-    const labels = {
-      critical: "[CRITICAL]",
-      serious: "[SERIOUS]",
-      moderate: "[MODERATE]",
-      low: "[LOW]"
-    };
-    console.error(`   ${labels[severity]} ${message}`);
-  }
-  /**
-   * Complete current phase
-   */
-  completePhase(summary) {
-    const elapsed = Date.now() - this.phaseStartTime;
-    this.report(`Done: ${summary}`, `(${elapsed}ms)`);
-  }
-  /**
-   * Complete the entire operation
-   */
-  complete(summary) {
-    if (_interactiveMode) return;
-    const totalElapsed = Date.now() - this.startTime;
-    console.error("");
-    console.error(`----------------------------------------`);
-    console.error(`[COMPLETE] ${summary}`);
-    console.error(`   Total time: ${(totalElapsed / 1e3).toFixed(2)}s`);
-    console.error(`----------------------------------------`);
-    console.error("");
-  }
-  /**
-   * Report an error
-   */
-  error(message, detail) {
-    if (_interactiveMode) return;
-    const fullMessage = detail ? `${message}: ${detail}` : message;
-    console.error(`[ERROR] ${fullMessage}`);
-  }
-  /**
-   * Report a warning
-   */
-  warn(message, detail) {
-    if (_interactiveMode) return;
-    const fullMessage = detail ? `${message}: ${detail}` : message;
-    console.error(`[WARN] ${fullMessage}`);
-  }
-  /**
-   * Get icon for current phase
-   */
-  getPhaseIcon(phase) {
-    const icons = {
-      "init": ">>",
-      "discovery": ">>",
-      "reading": ">>",
-      "analyzing": ">>",
-      "ai-review": "[AI]",
-      "prioritizing": ">>",
-      "complete": "[OK]"
-    };
-    return icons[phase] || ">>";
-  }
-  /**
-   * Create a sub-reporter for a specific agent
-   */
-  forAgent(agentName) {
-    return new AgentProgressReporter(agentName, this.verbose);
-  }
-};
-var AgentProgressReporter = class {
-  agentName;
-  verbose;
-  issueCount = 0;
-  issuesBySeverity = /* @__PURE__ */ new Map();
-  batchedIssues = /* @__PURE__ */ new Map();
-  criticalIssues = [];
-  seriousIssues = [];
-  flushTimer = null;
-  BATCH_DELAY_MS = 100;
-  // Batch issues for 100ms before flushing
-  constructor(agentName, verbose = true) {
-    this.agentName = agentName;
-    this.verbose = verbose;
-  }
-  start() {
-    if (!this.verbose || _interactiveMode) return;
-    console.error(`
-[SCOUT] ${this.agentName.toUpperCase()} starting...`);
-  }
-  analyzing(_file) {
-    if (!this.verbose || _interactiveMode) return;
-  }
-  aiReview(context) {
-    if (!this.verbose || _interactiveMode) return;
-    if (this.issueCount < 5) {
-      console.error(`   [AI] reviewing: ${context}`);
-    }
-  }
-  found(severity, issue, file, line) {
-    this.issueCount++;
-    const current = this.issuesBySeverity.get(severity) || 0;
-    this.issuesBySeverity.set(severity, current + 1);
-    if (severity === "critical") {
-      this.criticalIssues.push({
-        severity,
-        issue,
-        ...file !== void 0 ? { file } : {},
-        ...line !== void 0 ? { line } : {}
-      });
-      if (this.verbose && !_interactiveMode) {
-        this.flushCriticalAndSerious();
-      }
-    } else if (severity === "serious") {
-      this.seriousIssues.push({
-        severity,
-        issue,
-        ...file !== void 0 ? { file } : {},
-        ...line !== void 0 ? { line } : {}
-      });
-    }
-    if (!this.verbose || _interactiveMode) return;
-    const normalizedIssue = issue.replace(/at line \d+/gi, "").replace(/in .+$/gi, "").trim();
-    const key = `${severity}:${normalizedIssue}`;
-    if (!this.batchedIssues.has(key)) {
-      this.batchedIssues.set(key, []);
-    }
-    this.batchedIssues.get(key).push({
-      severity,
-      issue,
-      ...file !== void 0 ? { file } : {},
-      ...line !== void 0 ? { line } : {}
-    });
-    if (severity === "critical") {
-      this.flushBatchedIssues();
-    } else {
-      if (this.flushTimer) {
-        clearTimeout(this.flushTimer);
-      }
-      this.flushTimer = setTimeout(() => this.flushBatchedIssues(), this.BATCH_DELAY_MS);
-    }
-  }
-  flushCriticalAndSerious() {
-    for (const issue of this.criticalIssues) {
-      console.error(`   [CRITICAL] Found: ${issue.issue}`);
-    }
-    this.criticalIssues = [];
-  }
-  flushBatchedIssues() {
-    if (!this.verbose || _interactiveMode) return;
-    if (this.criticalIssues.length > 0) {
-      this.flushCriticalAndSerious();
-    }
-    if (this.seriousIssues.length > 0) {
-      for (const issue of this.seriousIssues.slice(0, 10)) {
-        console.error(`   [SERIOUS] Found: ${issue.issue}`);
-      }
-      if (this.seriousIssues.length > 10) {
-        console.error(`   ... and ${this.seriousIssues.length - 10} more serious issues`);
-      }
-      this.seriousIssues = [];
-    }
-    if (this.batchedIssues.size === 0) return;
-    const moderateGroups = [];
-    const lowGroups = [];
-    for (const [key, issues] of Array.from(this.batchedIssues.entries())) {
-      const [severity, pattern = ""] = key.split(":", 2);
-      const count = issues.length;
-      const examples = issues.slice(0, 2).map((i) => i.issue);
-      if (severity === "moderate") {
-        moderateGroups.push({ pattern, count, examples });
-      } else if (severity === "low") {
-        lowGroups.push({ pattern, count, examples });
-      }
-    }
-    if (moderateGroups.length > 0) {
-      for (const group of moderateGroups.slice(0, 5)) {
-        if (group.count === 1) {
-          console.error(`   [MODERATE] Found: ${group.examples[0]}`);
-        } else {
-          console.error(`   [MODERATE] Found: ${group.pattern} (${group.count} instances)`);
-        }
-      }
-      if (moderateGroups.length > 5) {
-        const remaining = moderateGroups.slice(5).reduce((sum, g) => sum + g.count, 0);
-        console.error(`   ... and ${remaining} more moderate issues`);
-      }
-    }
-    if (lowGroups.length > 0 && this.issueCount < 200) {
-      for (const group of lowGroups.slice(0, 3)) {
-        if (group.count === 1) {
-          console.error(`   [LOW] Found: ${group.examples[0]}`);
-        } else {
-          console.error(`   [LOW] Found: ${group.pattern} (${group.count} instances)`);
-        }
-      }
-      if (lowGroups.length > 3) {
-        const remaining = lowGroups.slice(3).reduce((sum, g) => sum + g.count, 0);
-        console.error(`   ... and ${remaining} more low-severity issues`);
-      }
-    } else if (lowGroups.length > 0) {
-      const totalLow = lowGroups.reduce((sum, g) => sum + g.count, 0);
-      console.error(`   [LOW] Found ${totalLow} low-severity issues (suppressed for brevity)`);
-    }
-    this.batchedIssues.clear();
-  }
-  complete(summary) {
-    if (this.flushTimer) {
-      clearTimeout(this.flushTimer);
-      this.flushTimer = null;
-    }
-    this.flushBatchedIssues();
-    if (!this.verbose || _interactiveMode) return;
-    const severityCounts = [];
-    if (this.issuesBySeverity.get("critical")) {
-      severityCounts.push(`${this.issuesBySeverity.get("critical")} critical`);
-    }
-    if (this.issuesBySeverity.get("serious")) {
-      severityCounts.push(`${this.issuesBySeverity.get("serious")} serious`);
-    }
-    if (this.issuesBySeverity.get("moderate")) {
-      severityCounts.push(`${this.issuesBySeverity.get("moderate")} moderate`);
-    }
-    if (this.issuesBySeverity.get("low")) {
-      severityCounts.push(`${this.issuesBySeverity.get("low")} low`);
-    }
-    const severitySummary = severityCounts.length > 0 ? ` (${severityCounts.join(", ")})` : "";
-    const msg = summary || `${this.issueCount} issues found${severitySummary}`;
-    console.error(`   Done: ${this.agentName}: ${msg}`);
-  }
-  getIssueCount() {
-    return this.issueCount;
-  }
-  getIssuesBySeverity() {
-    return new Map(this.issuesBySeverity);
-  }
-};
-var globalReporter = null;
-function getProgressReporter(options) {
-  if (!globalReporter) {
-    globalReporter = new ProgressReporter(options);
-  }
-  return globalReporter;
-}
-function resetProgressReporter() {
-  globalReporter = null;
-}
-
-export {
-  setInteractiveMode,
-  isInteractiveMode,
-  ProgressReporter,
-  AgentProgressReporter,
-  getProgressReporter,
-  resetProgressReporter
-};
-//# sourceMappingURL=chunk-KDHN2ZQE.js.map

package/dist/chunk-KDHN2ZQE.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/utils/progress.ts"],"sourcesContent":["/**\n * Progress Reporter for Trie Agent\n * \n * Provides real-time feedback to users as the agent works.\n * Uses console.error because MCP clients display stderr to users.\n */\n\n/**\n * Global interactive mode flag\n * When enabled, suppresses all console output (handled by InteractiveDashboard instead)\n */\nlet _interactiveMode = false;\n\n/**\n * Enable or disable interactive mode\n * When enabled, all console output from ProgressReporter and AgentProgressReporter is suppressed\n * \n * NOTE: This only sets the flag. The caller should verify that process.stdin.isTTY\n * and process.stdin.setRawMode are available before enabling interactive mode.\n */\nexport function setInteractiveMode(enabled: boolean): void {\n  _interactiveMode = enabled;\n}\n\n/**\n * Check if interactive mode is enabled\n */\nexport function isInteractiveMode(): boolean {\n  return _interactiveMode;\n}\n\nexport type ProgressPhase = \n  | 'init'\n  | 'discovery'\n  | 'reading'\n  | 'analyzing'\n  | 'ai-review'\n  | 'prioritizing'\n  | 'complete';\n\nexport interface ProgressCallback {\n  (phase: ProgressPhase, message: string, detail?: string): void;\n}\n\n/**\n * Progress Reporter - streams status updates to the user\n */\nexport class ProgressReporter {\n  private currentPhase: ProgressPhase = 'init';\n  private startTime: number = Date.now();\n  private phaseStartTime: number = Date.now();\n  private verbose: boolean;\n\n  constructor(options: { verbose?: boolean } = {}) {\n    this.verbose = options.verbose ?? true;\n  }\n\n  /**\n   * Report a status update\n   */\n  report(message: string, detail?: string): void {\n    if (!this.verbose || _interactiveMode) return;\n    \n    const prefix = this.getPhaseIcon(this.currentPhase);\n    const fullMessage = detail ? `${message}: ${detail}` : message;\n    console.error(`${prefix} ${fullMessage}`);\n  }\n\n  /**\n   * Start a new phase\n   */\n  startPhase(phase: ProgressPhase, message: string): void {\n    this.currentPhase = phase;\n    this.phaseStartTime = Date.now();\n    this.report(message);\n  }\n\n  /**\n   * Update within current phase\n   */\n  update(message: string, detail?: string): void {\n    this.report(message, detail);\n  }\n\n  /**\n   * Report progress on a file\n   */\n  file(action: string, filePath: string): void {\n    // Show just the filename for cleaner output\n    const fileName = filePath.split('/').pop() || filePath;\n    this.report(action, fileName);\n  }\n\n  /**\n   * Report an AI analysis step\n   */\n  ai(action: string, context?: string): void {\n    if (_interactiveMode) return;\n    const prefix = '[AI]';\n    const message = context ? `${action}: ${context}` : action;\n    console.error(`${prefix} ${message}`);\n  }\n\n  /**\n   * Report a finding\n   */\n  finding(severity: 'critical' | 'serious' | 'moderate' | 'low', message: string): void {\n    if (_interactiveMode) return;\n    const labels = {\n      critical: '[CRITICAL]',\n      serious: '[SERIOUS]',\n      moderate: '[MODERATE]',\n      low: '[LOW]'\n    };\n    console.error(`   ${labels[severity]} ${message}`);\n  }\n\n  /**\n   * Complete current phase\n   */\n  completePhase(summary: string): void {\n    const elapsed = Date.now() - this.phaseStartTime;\n    this.report(`Done: ${summary}`, `(${elapsed}ms)`);\n  }\n\n  /**\n   * Complete the entire operation\n   */\n  complete(summary: string): void {\n    if (_interactiveMode) return;\n    const totalElapsed = Date.now() - this.startTime;\n    console.error('');\n    console.error(`----------------------------------------`);\n    console.error(`[COMPLETE] ${summary}`);\n    console.error(`   Total time: ${(totalElapsed / 1000).toFixed(2)}s`);\n    console.error(`----------------------------------------`);\n    console.error('');\n  }\n\n  /**\n   * Report an error\n   */\n  error(message: string, detail?: string): void {\n    if (_interactiveMode) return;\n    const fullMessage = detail ? `${message}: ${detail}` : message;\n    console.error(`[ERROR] ${fullMessage}`);\n  }\n\n  /**\n   * Report a warning\n   */\n  warn(message: string, detail?: string): void {\n    if (_interactiveMode) return;\n    const fullMessage = detail ? `${message}: ${detail}` : message;\n    console.error(`[WARN] ${fullMessage}`);\n  }\n\n  /**\n   * Get icon for current phase\n   */\n  private getPhaseIcon(phase: ProgressPhase): string {\n    const icons: Record<ProgressPhase, string> = {\n      'init': '>>',\n      'discovery': '>>',\n      'reading': '>>',\n      'analyzing': '>>',\n      'ai-review': '[AI]',\n      'prioritizing': '>>',\n      'complete': '[OK]'\n    };\n    return icons[phase] || '>>';\n  }\n\n  /**\n   * Create a sub-reporter for a specific agent\n   */\n  forAgent(agentName: string): AgentProgressReporter {\n    return new AgentProgressReporter(agentName, this.verbose);\n  }\n}\n\n/**\n * Progress reporter scoped to a specific agent\n */\nexport class AgentProgressReporter {\n  private agentName: string;\n  private verbose: boolean;\n  private issueCount: number = 0;\n  private issuesBySeverity: Map<string, number> = new Map();\n  private batchedIssues: Map<string, Array<{ severity: string; issue: string; file?: string; line?: number }>> = new Map();\n  private criticalIssues: Array<{ severity: string; issue: string; file?: string; line?: number }> = [];\n  private seriousIssues: Array<{ severity: string; issue: string; file?: string; line?: number }> = [];\n  private flushTimer: NodeJS.Timeout | null = null;\n  private readonly BATCH_DELAY_MS = 100; // Batch issues for 100ms before flushing\n\n  constructor(agentName: string, verbose: boolean = true) {\n    this.agentName = agentName;\n    this.verbose = verbose;\n  }\n\n  start(): void {\n    if (!this.verbose || _interactiveMode) return;\n    console.error(`\\n[SCOUT] ${this.agentName.toUpperCase()} starting...`);\n  }\n\n  analyzing(_file: string): void {\n    if (!this.verbose || _interactiveMode) return;\n    // Suppress individual file analysis messages - they're too verbose\n    // The progress updates from streaming manager will show file progress\n  }\n\n  aiReview(context: string): void {\n    if (!this.verbose || _interactiveMode) return;\n    // Suppress AI review messages - they're too verbose during watch mode\n    // Only show if there are very few issues (indicating a focused scan)\n    if (this.issueCount < 5) {\n      console.error(`   [AI] reviewing: ${context}`);\n    }\n  }\n\n  found(severity: string, issue: string, file?: string, line?: number): void {\n    this.issueCount++;\n    \n    // Track by severity\n    const current = this.issuesBySeverity.get(severity) || 0;\n    this.issuesBySeverity.set(severity, current + 1);\n\n    // Store critical and serious issues for detailed output\n    if (severity === 'critical') {\n      this.criticalIssues.push({\n        severity,\n        issue,\n        ...(file !== undefined ? { file } : {}),\n        ...(line !== undefined ? { line } : {}),\n      });\n      // Flush critical issues immediately\n      if (this.verbose && !_interactiveMode) {\n        this.flushCriticalAndSerious();\n      }\n    } else if (severity === 'serious') {\n      this.seriousIssues.push({\n        severity,\n        issue,\n        ...(file !== undefined ? { file } : {}),\n        ...(line !== undefined ? { line } : {}),\n      });\n    }\n\n    // Batch similar issues together for cleaner output\n    if (!this.verbose || _interactiveMode) return;\n\n    // Normalize issue description for grouping (remove line numbers, file paths)\n    const normalizedIssue = issue.replace(/at line \\d+/gi, '').replace(/in .+$/gi, '').trim();\n    const key = `${severity}:${normalizedIssue}`;\n    \n    if (!this.batchedIssues.has(key)) {\n      this.batchedIssues.set(key, []);\n    }\n    this.batchedIssues.get(key)!.push({\n      severity,\n      issue,\n      ...(file !== undefined ? { file } : {}),\n      ...(line !== undefined ? { line } : {}),\n    });\n\n    // Schedule flush (debounced) - but flush immediately for critical\n    if (severity === 'critical') {\n      this.flushBatchedIssues();\n    } else {\n      if (this.flushTimer) {\n        clearTimeout(this.flushTimer);\n      }\n      this.flushTimer = setTimeout(() => this.flushBatchedIssues(), this.BATCH_DELAY_MS);\n    }\n  }\n\n  private flushCriticalAndSerious(): void {\n    // Always show critical issues immediately\n    for (const issue of this.criticalIssues) {\n      console.error(`   [CRITICAL] Found: ${issue.issue}`);\n    }\n    this.criticalIssues = [];\n  }\n\n  private flushBatchedIssues(): void {\n    if (!this.verbose || _interactiveMode) return;\n\n    // Always show critical issues immediately (should already be flushed, but double-check)\n    if (this.criticalIssues.length > 0) {\n      this.flushCriticalAndSerious();\n    }\n\n    // Show serious issues (limit to first 10 to avoid spam)\n    if (this.seriousIssues.length > 0) {\n      for (const issue of this.seriousIssues.slice(0, 10)) {\n        console.error(`   [SERIOUS] Found: ${issue.issue}`);\n      }\n      if (this.seriousIssues.length > 10) {\n        console.error(`   ... and ${this.seriousIssues.length - 10} more serious issues`);\n      }\n      this.seriousIssues = [];\n    }\n\n    if (this.batchedIssues.size === 0) return;\n\n    // For moderate and low issues, group similar ones together\n    const moderateGroups: Array<{ pattern: string; count: number; examples: string[] }> = [];\n    const lowGroups: Array<{ pattern: string; count: number; examples: string[] }> = [];\n\n    for (const [key, issues] of Array.from(this.batchedIssues.entries())) {\n      const [severity, pattern = ''] = key.split(':', 2);\n      const count = issues.length;\n      const examples = issues.slice(0, 2).map((i: { severity: string; issue: string; file?: string; line?: number }) => i.issue);\n\n      if (severity === 'moderate') {\n        moderateGroups.push({ pattern, count, examples });\n      } else if (severity === 'low') {\n        lowGroups.push({ pattern, count, examples });\n      }\n    }\n\n    // Show moderate issues (grouped, max 5 groups)\n    if (moderateGroups.length > 0) {\n      for (const group of moderateGroups.slice(0, 5)) {\n        if (group.count === 1) {\n          console.error(`   [MODERATE] Found: ${group.examples[0]}`);\n        } else {\n          console.error(`   [MODERATE] Found: ${group.pattern} (${group.count} instances)`);\n        }\n      }\n      if (moderateGroups.length > 5) {\n        const remaining = moderateGroups.slice(5).reduce((sum, g) => sum + g.count, 0);\n        console.error(`   ... and ${remaining} more moderate issues`);\n      }\n    }\n\n    // Show low issues (grouped, max 3 groups, only if not too many)\n    // Suppress low issues if there are too many total issues\n    if (lowGroups.length > 0 && this.issueCount < 200) {\n      for (const group of lowGroups.slice(0, 3)) {\n        if (group.count === 1) {\n          console.error(`   [LOW] Found: ${group.examples[0]}`);\n        } else {\n          console.error(`   [LOW] Found: ${group.pattern} (${group.count} instances)`);\n        }\n      }\n      if (lowGroups.length > 3) {\n        const remaining = lowGroups.slice(3).reduce((sum, g) => sum + g.count, 0);\n        console.error(`   ... and ${remaining} more low-severity issues`);\n      }\n    } else if (lowGroups.length > 0) {\n      // Too many issues - just show summary\n      const totalLow = lowGroups.reduce((sum, g) => sum + g.count, 0);\n      console.error(`   [LOW] Found ${totalLow} low-severity issues (suppressed for brevity)`);\n    }\n\n    this.batchedIssues.clear();\n  }\n\n  complete(summary?: string): void {\n    // Flush any remaining batched issues\n    if (this.flushTimer) {\n      clearTimeout(this.flushTimer);\n      this.flushTimer = null;\n    }\n    this.flushBatchedIssues();\n\n    if (!this.verbose || _interactiveMode) return;\n\n    // Build a better summary\n    const severityCounts: string[] = [];\n    if (this.issuesBySeverity.get('critical')) {\n      severityCounts.push(`${this.issuesBySeverity.get('critical')} critical`);\n    }\n    if (this.issuesBySeverity.get('serious')) {\n      severityCounts.push(`${this.issuesBySeverity.get('serious')} serious`);\n    }\n    if (this.issuesBySeverity.get('moderate')) {\n      severityCounts.push(`${this.issuesBySeverity.get('moderate')} moderate`);\n    }\n    if (this.issuesBySeverity.get('low')) {\n      severityCounts.push(`${this.issuesBySeverity.get('low')} low`);\n    }\n\n    const severitySummary = severityCounts.length > 0 \n      ? ` (${severityCounts.join(', ')})`\n      : '';\n    \n    const msg = summary || `${this.issueCount} issues found${severitySummary}`;\n    console.error(`   Done: ${this.agentName}: ${msg}`);\n  }\n\n  getIssueCount(): number {\n    return this.issueCount;\n  }\n\n  getIssuesBySeverity(): Map<string, number> {\n    return new Map(this.issuesBySeverity);\n  }\n}\n\n/**\n * Global singleton for easy access\n */\nlet globalReporter: ProgressReporter | null = null;\n\nexport function getProgressReporter(options?: { verbose?: boolean }): ProgressReporter {\n  if (!globalReporter) {\n    globalReporter = new ProgressReporter(options);\n  }\n  return globalReporter;\n}\n\nexport function resetProgressReporter(): void {\n  globalReporter = null;\n}\n"],"mappings":";AAWA,IAAI,mBAAmB;AAShB,SAAS,mBAAmB,SAAwB;AACzD,qBAAmB;AACrB;AAKO,SAAS,oBAA6B;AAC3C,SAAO;AACT;AAkBO,IAAM,mBAAN,MAAuB;AAAA,EACpB,eAA8B;AAAA,EAC9B,YAAoB,KAAK,IAAI;AAAA,EAC7B,iBAAyB,KAAK,IAAI;AAAA,EAClC;AAAA,EAER,YAAY,UAAiC,CAAC,GAAG;AAC/C,SAAK,UAAU,QAAQ,WAAW;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAiB,QAAuB;AAC7C,QAAI,CAAC,KAAK,WAAW,iBAAkB;AAEvC,UAAM,SAAS,KAAK,aAAa,KAAK,YAAY;AAClD,UAAM,cAAc,SAAS,GAAG,OAAO,KAAK,MAAM,KAAK;AACvD,YAAQ,MAAM,GAAG,MAAM,IAAI,WAAW,EAAE;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,OAAsB,SAAuB;AACtD,SAAK,eAAe;AACpB,SAAK,iBAAiB,KAAK,IAAI;AAC/B,SAAK,OAAO,OAAO;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAAiB,QAAuB;AAC7C,SAAK,OAAO,SAAS,MAAM;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,KAAK,QAAgB,UAAwB;AAE3C,UAAM,WAAW,SAAS,MAAM,GAAG,EAAE,IAAI,KAAK;AAC9C,SAAK,OAAO,QAAQ,QAAQ;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA,EAKA,GAAG,QAAgB,SAAwB;AACzC,QAAI,iBAAkB;AACtB,UAAM,SAAS;AACf,UAAM,UAAU,UAAU,GAAG,MAAM,KAAK,OAAO,KAAK;AACpD,YAAQ,MAAM,GAAG,MAAM,IAAI,OAAO,EAAE;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,UAAuD,SAAuB;AACpF,QAAI,iBAAkB;AACtB,UAAM,SAAS;AAAA,MACb,UAAU;AAAA,MACV,SAAS;AAAA,MACT,UAAU;AAAA,MACV,KAAK;AAAA,IACP;AACA,YAAQ,MAAM,MAAM,OAAO,QAAQ,CAAC,IAAI,OAAO,EAAE;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,SAAuB;AACnC,UAAM,UAAU,KAAK,IAAI,IAAI,KAAK;AAClC,SAAK,OAAO,SAAS,OAAO,IAAI,IAAI,OAAO,KAAK;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,SAAuB;AAC9B,QAAI,iBAAkB;AACtB,UAAM,eAAe,KAAK,IAAI,IAAI,KAAK;AACvC,YAAQ,MAAM,EAAE;AAChB,YAAQ,MAAM,0CAA0C;AACxD,YAAQ,MAAM,cAAc,OAAO,EAAE;AACrC,YAAQ,MAAM,mBAAmB,eAAe,KAAM,QAAQ,CAAC,CAAC,GAAG;AACnE,YAAQ,MAAM,0CAA0C;AACxD,YAAQ,MAAM,EAAE;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,SAAiB,QAAuB;AAC5C,QAAI,iBAAkB;AACtB,UAAM,cAAc,SAAS,GAAG,OAAO,KAAK,MAAM,KAAK;AACvD,YAAQ,MAAM,WAAW,WAAW,EAAE;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA,EAKA,KAAK,SAAiB,QAAuB;AAC3C,QAAI,iBAAkB;AACtB,UAAM,cAAc,SAAS,GAAG,OAAO,KAAK,MAAM,KAAK;AACvD,YAAQ,MAAM,UAAU,WAAW,EAAE;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,OAA8B;AACjD,UAAM,QAAuC;AAAA,MAC3C,QAAQ;AAAA,MACR,aAAa;AAAA,MACb,WAAW;AAAA,MACX,aAAa;AAAA,MACb,aAAa;AAAA,MACb,gBAAgB;AAAA,MAChB,YAAY;AAAA,IACd;AACA,WAAO,MAAM,KAAK,KAAK;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,WAA0C;AACjD,WAAO,IAAI,sBAAsB,WAAW,KAAK,OAAO;AAAA,EAC1D;AACF;AAKO,IAAM,wBAAN,MAA4B;AAAA,EACzB;AAAA,EACA;AAAA,EACA,aAAqB;AAAA,EACrB,mBAAwC,oBAAI,IAAI;AAAA,EAChD,gBAAuG,oBAAI,IAAI;AAAA,EAC/G,iBAA2F,CAAC;AAAA,EAC5F,gBAA0F,CAAC;AAAA,EAC3F,aAAoC;AAAA,EAC3B,iBAAiB;AAAA;AAAA,EAElC,YAAY,WAAmB,UAAmB,MAAM;AACtD,SAAK,YAAY;AACjB,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,QAAc;AACZ,QAAI,CAAC,KAAK,WAAW,iBAAkB;AACvC,YAAQ,MAAM;AAAA,UAAa,KAAK,UAAU,YAAY,CAAC,cAAc;AAAA,EACvE;AAAA,EAEA,UAAU,OAAqB;AAC7B,QAAI,CAAC,KAAK,WAAW,iBAAkB;AAAA,EAGzC;AAAA,EAEA,SAAS,SAAuB;AAC9B,QAAI,CAAC,KAAK,WAAW,iBAAkB;AAGvC,QAAI,KAAK,aAAa,GAAG;AACvB,cAAQ,MAAM,sBAAsB,OAAO,EAAE;AAAA,IAC/C;AAAA,EACF;AAAA,EAEA,MAAM,UAAkB,OAAe,MAAe,MAAqB;AACzE,SAAK;AAGL,UAAM,UAAU,KAAK,iBAAiB,IAAI,QAAQ,KAAK;AACvD,SAAK,iBAAiB,IAAI,UAAU,UAAU,CAAC;AAG/C,QAAI,aAAa,YAAY;AAC3B,WAAK,eAAe,KAAK;AAAA,QACvB;AAAA,QACA;AAAA,QACA,GAAI,SAAS,SAAY,EAAE,KAAK,IAAI,CAAC;AAAA,QACrC,GAAI,SAAS,SAAY,EAAE,KAAK,IAAI,CAAC;AAAA,MACvC,CAAC;AAED,UAAI,KAAK,WAAW,CAAC,kBAAkB;AACrC,aAAK,wBAAwB;AAAA,MAC/B;AAAA,IACF,WAAW,aAAa,WAAW;AACjC,WAAK,cAAc,KAAK;AAAA,QACtB;AAAA,QACA;AAAA,QACA,GAAI,SAAS,SAAY,EAAE,KAAK,IAAI,CAAC;AAAA,QACrC,GAAI,SAAS,SAAY,EAAE,KAAK,IAAI,CAAC;AAAA,MACvC,CAAC;AAAA,IACH;AAGA,QAAI,CAAC,KAAK,WAAW,iBAAkB;AAGvC,UAAM,kBAAkB,MAAM,QAAQ,iBAAiB,EAAE,EAAE,QAAQ,YAAY,EAAE,EAAE,KAAK;AACxF,UAAM,MAAM,GAAG,QAAQ,IAAI,eAAe;AAE1C,QAAI,CAAC,KAAK,cAAc,IAAI,GAAG,GAAG;AAChC,WAAK,cAAc,IAAI,KAAK,CAAC,CAAC;AAAA,IAChC;AACA,SAAK,cAAc,IAAI,GAAG,EAAG,KAAK;AAAA,MAChC;AAAA,MACA;AAAA,MACA,GAAI,SAAS,SAAY,EAAE,KAAK,IAAI,CAAC;AAAA,MACrC,GAAI,SAAS,SAAY,EAAE,KAAK,IAAI,CAAC;AAAA,IACvC,CAAC;AAGD,QAAI,aAAa,YAAY;AAC3B,WAAK,mBAAmB;AAAA,IAC1B,OAAO;AACL,UAAI,KAAK,YAAY;AACnB,qBAAa,KAAK,UAAU;AAAA,MAC9B;AACA,WAAK,aAAa,WAAW,MAAM,KAAK,mBAAmB,GAAG,KAAK,cAAc;AAAA,IACnF;AAAA,EACF;AAAA,EAEQ,0BAAgC;AAEtC,eAAW,SAAS,KAAK,gBAAgB;AACvC,cAAQ,MAAM,wBAAwB,MAAM,KAAK,EAAE;AAAA,IACrD;AACA,SAAK,iBAAiB,CAAC;AAAA,EACzB;AAAA,EAEQ,qBAA2B;AACjC,QAAI,CAAC,KAAK,WAAW,iBAAkB;AAGvC,QAAI,KAAK,eAAe,SAAS,GAAG;AAClC,WAAK,wBAAwB;AAAA,IAC/B;AAGA,QAAI,KAAK,cAAc,SAAS,GAAG;AACjC,iBAAW,SAAS,KAAK,cAAc,MAAM,GAAG,EAAE,GAAG;AACnD,gBAAQ,MAAM,uBAAuB,MAAM,KAAK,EAAE;AAAA,MACpD;AACA,UAAI,KAAK,cAAc,SAAS,IAAI;AAClC,gBAAQ,MAAM,cAAc,KAAK,cAAc,SAAS,EAAE,sBAAsB;AAAA,MAClF;AACA,WAAK,gBAAgB,CAAC;AAAA,IACxB;AAEA,QAAI,KAAK,cAAc,SAAS,EAAG;AAGnC,UAAM,iBAAgF,CAAC;AACvF,UAAM,YAA2E,CAAC;AAElF,eAAW,CAAC,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,cAAc,QAAQ,CAAC,GAAG;AACpE,YAAM,CAAC,UAAU,UAAU,EAAE,IAAI,IAAI,MAAM,KAAK,CAAC;AACjD,YAAM,QAAQ,OAAO;AACrB,YAAM,WAAW,OAAO,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAyE,EAAE,KAAK;AAEzH,UAAI,aAAa,YAAY;AAC3B,uBAAe,KAAK,EAAE,SAAS,OAAO,SAAS,CAAC;AAAA,MAClD,WAAW,aAAa,OAAO;AAC7B,kBAAU,KAAK,EAAE,SAAS,OAAO,SAAS,CAAC;AAAA,MAC7C;AAAA,IACF;AAGA,QAAI,eAAe,SAAS,GAAG;AAC7B,iBAAW,SAAS,eAAe,MAAM,GAAG,CAAC,GAAG;AAC9C,YAAI,MAAM,UAAU,GAAG;AACrB,kBAAQ,MAAM,wBAAwB,MAAM,SAAS,CAAC,CAAC,EAAE;AAAA,QAC3D,OAAO;AACL,kBAAQ,MAAM,wBAAwB,MAAM,OAAO,KAAK,MAAM,KAAK,aAAa;AAAA,QAClF;AAAA,MACF;AACA,UAAI,eAAe,SAAS,GAAG;AAC7B,cAAM,YAAY,eAAe,MAAM,CAAC,EAAE,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,OAAO,CAAC;AAC7E,gBAAQ,MAAM,cAAc,SAAS,uBAAuB;AAAA,MAC9D;AAAA,IACF;AAIA,QAAI,UAAU,SAAS,KAAK,KAAK,aAAa,KAAK;AACjD,iBAAW,SAAS,UAAU,MAAM,GAAG,CAAC,GAAG;AACzC,YAAI,MAAM,UAAU,GAAG;AACrB,kBAAQ,MAAM,mBAAmB,MAAM,SAAS,CAAC,CAAC,EAAE;AAAA,QACtD,OAAO;AACL,kBAAQ,MAAM,mBAAmB,MAAM,OAAO,KAAK,MAAM,KAAK,aAAa;AAAA,QAC7E;AAAA,MACF;AACA,UAAI,UAAU,SAAS,GAAG;AACxB,cAAM,YAAY,UAAU,MAAM,CAAC,EAAE,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,OAAO,CAAC;AACxE,gBAAQ,MAAM,cAAc,SAAS,2BAA2B;AAAA,MAClE;AAAA,IACF,WAAW,UAAU,SAAS,GAAG;AAE/B,YAAM,WAAW,UAAU,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,OAAO,CAAC;AAC9D,cAAQ,MAAM,kBAAkB,QAAQ,+CAA+C;AAAA,IACzF;AAEA,SAAK,cAAc,MAAM;AAAA,EAC3B;AAAA,EAEA,SAAS,SAAwB;AAE/B,QAAI,KAAK,YAAY;AACnB,mBAAa,KAAK,UAAU;AAC5B,WAAK,aAAa;AAAA,IACpB;AACA,SAAK,mBAAmB;AAExB,QAAI,CAAC,KAAK,WAAW,iBAAkB;AAGvC,UAAM,iBAA2B,CAAC;AAClC,QAAI,KAAK,iBAAiB,IAAI,UAAU,GAAG;AACzC,qBAAe,KAAK,GAAG,KAAK,iBAAiB,IAAI,UAAU,CAAC,WAAW;AAAA,IACzE;AACA,QAAI,KAAK,iBAAiB,IAAI,SAAS,GAAG;AACxC,qBAAe,KAAK,GAAG,KAAK,iBAAiB,IAAI,SAAS,CAAC,UAAU;AAAA,IACvE;AACA,QAAI,KAAK,iBAAiB,IAAI,UAAU,GAAG;AACzC,qBAAe,KAAK,GAAG,KAAK,iBAAiB,IAAI,UAAU,CAAC,WAAW;AAAA,IACzE;AACA,QAAI,KAAK,iBAAiB,IAAI,KAAK,GAAG;AACpC,qBAAe,KAAK,GAAG,KAAK,iBAAiB,IAAI,KAAK,CAAC,MAAM;AAAA,IAC/D;AAEA,UAAM,kBAAkB,eAAe,SAAS,IAC5C,KAAK,eAAe,KAAK,IAAI,CAAC,MAC9B;AAEJ,UAAM,MAAM,WAAW,GAAG,KAAK,UAAU,gBAAgB,eAAe;AACxE,YAAQ,MAAM,YAAY,KAAK,SAAS,KAAK,GAAG,EAAE;AAAA,EACpD;AAAA,EAEA,gBAAwB;AACtB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,sBAA2C;AACzC,WAAO,IAAI,IAAI,KAAK,gBAAgB;AAAA,EACtC;AACF;AAKA,IAAI,iBAA0C;AAEvC,SAAS,oBAAoB,SAAmD;AACrF,MAAI,CAAC,gBAAgB;AACnB,qBAAiB,IAAI,iBAAiB,OAAO;AAAA,EAC/C;AACA,SAAO;AACT;AAEO,SAAS,wBAA8B;AAC5C,mBAAiB;AACnB;","names":[]}