@triedotdev/mcp 1.0.149 → 1.0.151

package/dist/{chunk-ZDDE442Q.js.map → chunk-7HYOJ4Q7.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/agent/goal-validator.ts"],"sourcesContent":["/**\n * Goal Validator - Helpers for goal tracking\n * \n * Goal detection is handled entirely by the AI watcher in watch.ts.\n * The AI (Anthropic) checks every changed file against user-defined goals,\n * using the Trie's priority scoring for cost control.\n * \n * This module provides:\n * - getActiveGoals: loads active goals for the AI prompt\n * - recordGoalViolationCaught: tracks when a violation is detected\n * - recordGoalViolationFixed: tracks when a violation is auto-fixed\n * - measureInitialGoalValue: measures current state for new goals\n */\n\nimport type { Goal } from './project-state.js';\nimport { getProjectState } from './project-state.js';\nimport { searchIssues } from '../memory/issue-store.js';\n\n/**\n * Get active goals for a project (used by the AI watcher)\n */\nexport async function getActiveGoals(projectPath: string): Promise<Goal[]> {\n  const projectState = getProjectState(projectPath);\n  await projectState.load();\n  return projectState.getAllGoals().filter(g => g.status === 'active');\n}\n\nexport async function recordGoalViolationCaught(\n  goal: Goal,\n  file: string,\n  projectPath: string\n): Promise<void> {\n  const projectState = getProjectState(projectPath);\n  await projectState.load();\n  \n  const metadata = goal.metadata || {};\n  const caughtCount = (metadata.caughtCount || 0) + 1;\n  \n  await projectState.updateGoal(goal.id, {\n    metadata: {\n      ...metadata,\n      caughtCount,\n      lastCaught: new Date().toISOString(),\n      lastCaughtFile: file,\n    },\n  });\n}\n\nexport async function recordGoalViolationFixed(\n  goal: Goal,\n  file: string,\n  projectPath: string\n): Promise<void> {\n  const projectState = getProjectState(projectPath);\n  await projectState.load();\n  \n  const metadata = goal.metadata || {};\n  const fixedCount = (metadata.fixedCount || 0) + 1;\n  \n  await projectState.updateGoal(goal.id, {\n    metadata: {\n      ...metadata,\n      fixedCount,\n      lastFixed: new Date().toISOString(),\n      lastFixedFile: file,\n    },\n  });\n  \n  // Resolve the goal-violation issue in the issue store\n  // This is the source of truth - measureGoalMetric() will query from here\n  const { resolveGoalViolation } = await import('../memory/issue-store.js');\n  await resolveGoalViolation(file, goal.description, projectPath);\n  \n  // Trigger immediate progress update so UI reflects the fix\n  const { getGoalManager } = await import('./goal-manager.js');\n  const goalManager = getGoalManager(projectPath);\n  await goalManager.updateGoalProgress();\n}\n\n/**\n * Measure the initial value for a new goal based on existing issues.\n * This sets a proper baseline so progress calculation works correctly.\n * \n * For reduction goals (like \"no emojis\"), we count current violations.\n * For other goals, we use semantic matching against existing issues.\n * \n * Returns the count to use as both startValue and currentValue.\n */\nexport async function measureInitialGoalValue(\n  description: string,\n  projectPath: string\n): Promise<number> {\n  try {\n    const issues = await searchIssues('', {\n      workDir: projectPath,\n      limit: 1000,\n      includeResolved: false,\n    });\n    \n    if (issues.length === 0) {\n      return 0;\n    }\n    \n    const desc = description.toLowerCase();\n    \n    // Check for goal-violation issues that might already exist for similar goals\n    const goalViolations = issues.filter(r => \n      r.issue.agent === 'goal-violation' &&\n      r.issue.issue.toLowerCase().includes(desc.slice(0, 30))\n    );\n    if (goalViolations.length > 0) {\n      return goalViolations.length;\n    }\n    \n    // Security goals\n    if (desc.includes('security') || desc.includes('vulnerab')) {\n      return issues.filter(r => \n        r.issue.agent === 'security' || r.issue.severity === 'critical'\n      ).length;\n    }\n    \n    // Type safety goals\n    if (desc.includes('type') || desc.includes('typescript') || desc.includes('any type')) {\n      return issues.filter(r => \n        r.issue.agent === 'typecheck' ||\n        r.issue.issue.toLowerCase().includes('type')\n      ).length;\n    }\n    \n    // Bug-related goals\n    if (desc.includes('bug') || desc.includes('error')) {\n      return issues.filter(r => \n        r.issue.agent === 'bug-finding' ||\n        r.issue.severity === 'critical' ||\n        r.issue.severity === 'serious'\n      ).length;\n    }\n    \n    // Dead code / unused code goals\n    if (desc.includes('dead code') || desc.includes('unused')) {\n      return issues.filter(r => {\n        const msg = r.issue.issue.toLowerCase();\n        return msg.includes('unused') || msg.includes('dead code') || msg.includes('never used');\n      }).length;\n    }\n    \n    // For custom goals like \"no emojis\", we start at 0 and let the AI scanner find violations\n    // This is correct because we don't know the count until a scan runs\n    return 0;\n  } catch {\n    return 0;\n  }\n}\n\n/**\n * Manually check files against goals\n * Returns violations found\n * \n * NOW WITH CACHING: Uses CodebaseIndex to avoid re-scanning unchanged files\n */\nexport async function checkFilesForGoalViolations(\n  goals: Goal[],\n  projectPath: string,\n  filesToCheck?: string[],\n  onProgress?: (message: string) => void,\n  signal?: AbortSignal\n): Promise<Array<{ file: string; message: string; severity: 'critical' | 'warning' | 'info' }>> {\n  // Import AI client and codebase index\n  const { isAIAvailable, runAIAnalysis } = await import('../ai/client.js');\n  const { CodebaseIndex } = await import('../context/codebase-index.js');\n  \n  if (!isAIAvailable()) {\n    throw new Error('AI not available - ANTHROPIC_API_KEY not set');\n  }\n  \n  // Initialize codebase index for caching\n  const codebaseIndex = new CodebaseIndex(projectPath);\n  \n  // Check if index needs to be built\n  if (codebaseIndex.isEmpty()) {\n    onProgress?.('Building codebase index (first-time, may take a minute)...');\n    \n    // Auto-index using same file selection as checks (most recently modified) so cache overlaps\n    const { glob } = await import('glob');\n    const { stat } = await import('fs/promises');\n    const indexPattern = `${projectPath}/**/*.{ts,tsx,js,jsx,mjs,vue,svelte,astro,py,go,rs,java,c,cpp,h,hpp,cs,rb,php,css,scss,html}`;\n    const indexFiles = await glob(indexPattern, {\n      ignore: ['**/node_modules/**', '**/dist/**', '**/build/**', '**/.git/**', '**/.trie/**', '**/coverage/**'],\n      nodir: true,\n    });\n    \n    const withStats = await Promise.all(\n      indexFiles.map(async (f) => {\n        try {\n          const stats = await stat(f);\n          return { file: f, mtime: stats.mtime.getTime() };\n        } catch {\n          return null;\n        }\n      })\n    );\n    const toIndex = withStats\n      .filter((f): f is { file: string; mtime: number } => f !== null)\n      .sort((a, b) => b.mtime - a.mtime)\n      .slice(0, 500)\n      .map((f) => f.file);\n    \n    let indexed = 0;\n    for (const filePath of toIndex) {\n      if (signal?.aborted) {\n        throw new DOMException('Scan cancelled', 'AbortError');\n      }\n      let relativePath = filePath;\n      if (filePath.toLowerCase().startsWith(projectPath.toLowerCase() + '/')) {\n        relativePath = filePath.slice(projectPath.length + 1);\n      }\n      const result = await codebaseIndex.indexFile(relativePath);\n      if (result) indexed++;\n      if (indexed % 50 === 0) {\n        onProgress?.(`Indexing files (${indexed}/${toIndex.length})...`);\n      }\n    }\n    \n    await codebaseIndex.save();\n  }\n  \n  // Get files to check\n  let files: string[] = [];\n  if (filesToCheck && filesToCheck.length > 0) {\n    files = filesToCheck;\n  } else {\n    // MANUAL CHECK MODE: Scan ALL relevant files, not just recently modified\n    const { glob } = await import('glob');\n    \n    const pattern = `${projectPath}/**/*.{ts,tsx,js,jsx,py,go,rs,java,c,cpp,h,hpp,cs,rb,php,css,scss,html,vue,svelte}`;\n    const allFiles = await glob(pattern, {\n      ignore: ['**/node_modules/**', '**/dist/**', '**/build/**', '**/.git/**', '**/.trie/**', '**/coverage/**'],\n      nodir: true,\n    });\n    \n    // For manual checks, use more files but still reasonable limit\n    // Sort by modification time to prioritize recently modified\n    const { stat } = await import('fs/promises');\n    const withStats = await Promise.all(\n      allFiles.map(async (f) => {\n        try {\n          const stats = await stat(f);\n          return { file: f, mtime: stats.mtime.getTime() };\n        } catch {\n          return null;\n        }\n      })\n    );\n    \n    files = withStats\n      .filter((f): f is { file: string; mtime: number } => f !== null)\n      .sort((a, b) => b.mtime - a.mtime)\n      .slice(0, 100) // Check up to 100 files for manual scans\n      .map(f => f.file);\n  }\n  \n  if (files.length === 0) {\n    throw new Error('No files found to check');\n  }\n\n  // Pre-index the files we're about to check so cache lookups work.\n  // The initial index may have indexed different files (first 500 from glob), while we check\n  // the 100 most recently modified - these can have zero overlap, causing every run to scan.\n  for (const filePath of files) {\n    let rel = filePath;\n    if (filePath.toLowerCase().startsWith(projectPath.toLowerCase() + '/')) {\n      rel = filePath.slice(projectPath.length + 1);\n    } else if (filePath.startsWith('/') && !filePath.toLowerCase().startsWith(projectPath.toLowerCase())) {\n      continue;\n    }\n    await codebaseIndex.indexFile(rel);\n  }\n  \n  // Check which files need scanning vs can use cached results\n  const filesToScan: string[] = [];\n  const cachedViolations: Array<{ file: string; message: string; severity: 'critical' | 'warning' | 'info' }> = [];\n  \n  for (const filePath of files) {\n    // Handle case-insensitive filesystems (macOS) and ensure we get a proper relative path\n    let relativePath = filePath;\n    if (filePath.toLowerCase().startsWith(projectPath.toLowerCase() + '/')) {\n      relativePath = filePath.slice(projectPath.length + 1);\n    } else if (filePath.startsWith('/')) {\n      // Already absolute but doesn't match projectPath - skip this file\n      // This can happen with stale cache entries from different projects\n      continue;\n    }\n    const hasChanged = await codebaseIndex.hasChanged(relativePath);\n    \n    if (hasChanged) {\n      // File changed or not indexed - needs scanning\n      // Try to index the file first; skip if it doesn't exist\n      const indexed = await codebaseIndex.indexFile(relativePath);\n      if (indexed) {\n        filesToScan.push(filePath);\n      }\n      // If indexFile returns null, file doesn't exist - skip it silently\n    } else {\n      // File unchanged - check cache for each goal\n      for (const goal of goals) {\n        const cached = codebaseIndex.getCachedViolations(relativePath, goal.id);\n        if (cached && cached.length > 0) {\n          const violation = cached[0];\n          if (violation && violation.found) {\n            cachedViolations.push({\n              file: relativePath,\n              message: `Goal \"${goal.description}\" violated in ${relativePath}: ${violation.details || 'Violation found'} [${violation.confidence || 90}% confidence] (cached)`,\n              severity: 'warning',\n            });\n          }\n        } else {\n          // No cache for this goal - needs scanning\n          if (!filesToScan.includes(filePath)) {\n            filesToScan.push(filePath);\n          }\n        }\n      }\n    }\n  }\n  \n  onProgress?.(`Checking ${filesToScan.length} files for violations...`);\n  \n  // Process files that need scanning in batches\n  const allViolations: Array<{ file: string; message: string; severity: 'critical' | 'warning' | 'info' }> = [...cachedViolations];\n  \n  if (filesToScan.length === 0) {\n    // All results from cache!\n    await codebaseIndex.save();\n    return allViolations;\n  }\n  \n  // For large file sets, process in batches to avoid token limits\n  const BATCH_SIZE = 25; // Process 25 files at a time\n  \n  const totalBatches = Math.ceil(filesToScan.length / BATCH_SIZE);\n  for (let batchStart = 0; batchStart < filesToScan.length; batchStart += BATCH_SIZE) {\n    const batchNum = Math.floor(batchStart / BATCH_SIZE) + 1;\n    onProgress?.(`Analyzing files (batch ${batchNum}/${totalBatches})...`);\n    const batchFiles = filesToScan.slice(batchStart, batchStart + BATCH_SIZE);\n    \n    // Read file contents for this batch\n    const { readFile } = await import('fs/promises');\n    const fileContents = await Promise.all(\n      batchFiles.map(async (filePath) => {\n        try {\n          const content = await readFile(filePath, 'utf-8');\n          const relativePath = filePath.replace(projectPath + '/', '');\n          return {\n            path: relativePath,\n            content: content, // Never truncate text in Trie Watch\n          };\n        } catch {\n          return null;\n        }\n      })\n    );\n    \n    const validFiles = fileContents.filter((f): f is { path: string; content: string } => f !== null);\n    \n    if (validFiles.length === 0) continue;\n    \n    // Build files block for AI\n    const filesBlock = validFiles\n      .map(f => `--- ${f.path} ---\\n${f.content}`)\n      .join('\\n\\n');\n    \n    // Build goals section\n    const goalsSection = `\nUSER-DEFINED GOALS (check EVERY file against ALL goals):\n${goals.map((g, i) => `  ${i + 1}. \"${g.description}\"`).join('\\n')}\n\nThis is a MANUAL CHECK requested by the user. Report ALL goal violations you find.\nFor emoji detection, look for Unicode emoji characters.\n`;\n  \n    // Run AI analysis\n    const result = await runAIAnalysis({\n      signal,\n      systemPrompt: `You are checking code for GOAL VIOLATIONS ONLY.\n${goalsSection}\nReply ONLY with a JSON array. Each element must have:\n- \"file\": relative file path\n- \"severity\": \"critical\" | \"major\" | \"minor\"\n- \"description\": 1-sentence description of the goal violation with specific examples\n- \"confidence\": number 0-100, how confident you are this is a violation\n- \"isGoalViolation\": true (always true for this scan)\n- \"goalIndex\": 0-based index of the violated goal\n\nCRITICAL DETECTION RULES:\n\n**EMOJIS**: Any Unicode emoji characters including but not limited to:\n- Emoticons: 😀😃😄😊🙂🙃😉😇🥰😍🤩😘😗☺️😚😙🥲\n- Symbols: ⚡️⚠️✅❌➜→←↑↓►◄▲▼★☆●○◆◇■□▪️▫️\n- Objects: 📊📈📉💻🖥️📱⌨️🖱️💾💿📀🔧🔨⚙️🛠️\n- Actions: 🔥💪👍👎👏🙌🤝✊👊🎯🎉🎊🚀\n- Weather: ☀️🌤️⛅☁️🌦️🌧️⛈️🌩️🌨️❄️\n- ALL OTHER Unicode emoji in ranges U+1F300-U+1F9FF, U+2600-U+27BF, U+2B00-U+2BFF\n\n**COLORS**: For \"purple\" or \"gradient\" goals, check:\n- CSS: purple, #purple, hsl(purple), rgb(purple), violet, #8B00FF, #9B59D6, etc.\n- Gradients: linear-gradient, radial-gradient, conic-gradient, background-image with gradients\n- Tailwind: purple-*, violet-*, bg-gradient-*\n- Styled components or CSS-in-JS with purple/violet/gradient\n\nBe EXTREMELY thorough. Check:\n1. String literals and template literals\n2. JSX/HTML content\n3. CSS files and style blocks\n4. Comments (emojis in comments still violate \"no emojis\")\n5. console.log statements\n6. Component names, variable names (if they contain emojis)\n\nIf a goal says \"no emojis\" and you see ANY emoji ANYWHERE in the file, report it.\nIf a goal says \"no console.log\" and you see console.log ANYWHERE, report it.\nIf a goal says \"no purple/gradient\" and you see ANY purple color or gradient, report it.\n\nIf no violations found, reply with: []\nOutput ONLY the JSON array, no markdown fences, no commentary.`,\n      userPrompt: `Check these ${validFiles.length} files for goal violations:\\n\\n${filesBlock}`,\n      maxTokens: 8192, // Increased for larger codebases\n      temperature: 0.1,\n    });\n    \n    // Parse response\n    let issues: Array<{\n      file: string;\n      severity: 'critical' | 'major' | 'minor';\n      description: string;\n      confidence: number;\n      isGoalViolation: boolean;\n      goalIndex?: number;\n    }> = [];\n    \n    try {\n      const cleaned = result.content.replace(/```json?\\n?|\\n?```/g, '').trim();\n      issues = JSON.parse(cleaned);\n      if (!Array.isArray(issues)) issues = [];\n    } catch (err) {\n      // Parse failed - continue to next batch\n      console.debug('[Goal Check] Batch parse failed:', err);\n      continue;\n    }\n    \n    // Convert to violation format and record\n    for (const issue of issues) {\n      if (!issue.isGoalViolation || issue.confidence < 50) continue;\n      if (issue.goalIndex == null || issue.goalIndex < 0 || issue.goalIndex >= goals.length) continue;\n      \n      const goal = goals[issue.goalIndex];\n      if (!goal) continue; // Defensive check\n      const severity = issue.severity === 'critical' ? 'critical' : 'warning';\n      const message = `Goal \"${goal.description}\" violated in ${issue.file}: ${issue.description} [${issue.confidence}% confidence]`;\n      \n      allViolations.push({\n        file: issue.file,\n        message,\n        severity,\n      });\n      \n      // Cache the result in codebase index\n      codebaseIndex.recordViolation(\n        issue.file,\n        goal.id,\n        goal.description,\n        true, // found\n        issue.description,\n        issue.confidence\n      );\n      \n      // Record violation\n      await recordGoalViolationCaught(goal, issue.file, projectPath);\n    }\n    \n    // Also record \"no violation\" for scanned files\n    for (const file of validFiles) {\n      for (let goalIdx = 0; goalIdx < goals.length; goalIdx++) {\n        const goal = goals[goalIdx];\n        if (!goal) continue;\n        const hasViolation = issues.some(i => i.file === file.path && i.goalIndex === goalIdx);\n        if (!hasViolation) {\n          codebaseIndex.recordViolation(\n            file.path,\n            goal.id,\n            goal.description,\n            false, // not found\n            undefined,\n            100\n          );\n        }\n      }\n    }\n  }\n  \n  // Save updated index\n  await codebaseIndex.save();\n  \n  return allViolations;\n}\n"],"mappings":";;;;;;;;AAqBA,eAAsB,eAAe,aAAsC;AACzE,QAAM,eAAe,gBAAgB,WAAW;AAChD,QAAM,aAAa,KAAK;AACxB,SAAO,aAAa,YAAY,EAAE,OAAO,OAAK,EAAE,WAAW,QAAQ;AACrE;AAEA,eAAsB,0BACpB,MACA,MACA,aACe;AACf,QAAM,eAAe,gBAAgB,WAAW;AAChD,QAAM,aAAa,KAAK;AAExB,QAAM,WAAW,KAAK,YAAY,CAAC;AACnC,QAAM,eAAe,SAAS,eAAe,KAAK;AAElD,QAAM,aAAa,WAAW,KAAK,IAAI;AAAA,IACrC,UAAU;AAAA,MACR,GAAG;AAAA,MACH;AAAA,MACA,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,MACnC,gBAAgB;AAAA,IAClB;AAAA,EACF,CAAC;AACH;AAEA,eAAsB,yBACpB,MACA,MACA,aACe;AACf,QAAM,eAAe,gBAAgB,WAAW;AAChD,QAAM,aAAa,KAAK;AAExB,QAAM,WAAW,KAAK,YAAY,CAAC;AACnC,QAAM,cAAc,SAAS,cAAc,KAAK;AAEhD,QAAM,aAAa,WAAW,KAAK,IAAI;AAAA,IACrC,UAAU;AAAA,MACR,GAAG;AAAA,MACH;AAAA,MACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MAClC,eAAe;AAAA,IACjB;AAAA,EACF,CAAC;AAID,QAAM,EAAE,qBAAqB,IAAI,MAAM,OAAO,2BAA0B;AACxE,QAAM,qBAAqB,MAAM,KAAK,aAAa,WAAW;AAG9D,QAAM,EAAE,eAAe,IAAI,MAAM,OAAO,4BAAmB;AAC3D,QAAM,cAAc,eAAe,WAAW;AAC9C,QAAM,YAAY,mBAAmB;AACvC;AAWA,eAAsB,wBACpB,aACA,aACiB;AACjB,MAAI;AACF,UAAM,SAAS,MAAM,aAAa,IAAI;AAAA,MACpC,SAAS;AAAA,MACT,OAAO;AAAA,MACP,iBAAiB;AAAA,IACnB,CAAC;AAED,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO;AAAA,IACT;AAEA,UAAM,OAAO,YAAY,YAAY;AAGrC,UAAM,iBAAiB,OAAO;AAAA,MAAO,OACnC,EAAE,MAAM,UAAU,oBAClB,EAAE,MAAM,MAAM,YAAY,EAAE,SAAS,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,IACxD;AACA,QAAI,eAAe,SAAS,GAAG;AAC7B,aAAO,eAAe;AAAA,IACxB;AAGA,QAAI,KAAK,SAAS,UAAU,KAAK,KAAK,SAAS,UAAU,GAAG;AAC1D,aAAO,OAAO;AAAA,QAAO,OACnB,EAAE,MAAM,UAAU,cAAc,EAAE,MAAM,aAAa;AAAA,MACvD,EAAE;AAAA,IACJ;AAGA,QAAI,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,YAAY,KAAK,KAAK,SAAS,UAAU,GAAG;AACrF,aAAO,OAAO;AAAA,QAAO,OACnB,EAAE,MAAM,UAAU,eAClB,EAAE,MAAM,MAAM,YAAY,EAAE,SAAS,MAAM;AAAA,MAC7C,EAAE;AAAA,IACJ;AAGA,QAAI,KAAK,SAAS,KAAK,KAAK,KAAK,SAAS,OAAO,GAAG;AAClD,aAAO,OAAO;AAAA,QAAO,OACnB,EAAE,MAAM,UAAU,iBAClB,EAAE,MAAM,aAAa,cACrB,EAAE,MAAM,aAAa;AAAA,MACvB,EAAE;AAAA,IACJ;AAGA,QAAI,KAAK,SAAS,WAAW,KAAK,KAAK,SAAS,QAAQ,GAAG;AACzD,aAAO,OAAO,OAAO,OAAK;AACxB,cAAM,MAAM,EAAE,MAAM,MAAM,YAAY;AACtC,eAAO,IAAI,SAAS,QAAQ,KAAK,IAAI,SAAS,WAAW,KAAK,IAAI,SAAS,YAAY;AAAA,MACzF,CAAC,EAAE;AAAA,IACL;AAIA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAQA,eAAsB,4BACpB,OACA,aACA,cACA,YACA,QAC8F;AAE9F,QAAM,EAAE,eAAe,cAAc,IAAI,MAAM,OAAO,sBAAiB;AACvE,QAAM,EAAE,cAAc,IAAI,MAAM,OAAO,8BAA8B;AAErE,MAAI,CAAC,cAAc,GAAG;AACpB,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AAGA,QAAM,gBAAgB,IAAI,cAAc,WAAW;AAGnD,MAAI,cAAc,QAAQ,GAAG;AAC3B,iBAAa,4DAA4D;AAGzE,UAAM,EAAE,KAAK,IAAI,MAAM,OAAO,MAAM;AACpC,UAAM,EAAE,KAAK,IAAI,MAAM,OAAO,aAAa;AAC3C,UAAM,eAAe,GAAG,WAAW;AACnC,UAAM,aAAa,MAAM,KAAK,cAAc;AAAA,MAC1C,QAAQ,CAAC,sBAAsB,cAAc,eAAe,cAAc,eAAe,gBAAgB;AAAA,MACzG,OAAO;AAAA,IACT,CAAC;AAED,UAAM,YAAY,MAAM,QAAQ;AAAA,MAC9B,WAAW,IAAI,OAAO,MAAM;AAC1B,YAAI;AACF,gBAAM,QAAQ,MAAM,KAAK,CAAC;AAC1B,iBAAO,EAAE,MAAM,GAAG,OAAO,MAAM,MAAM,QAAQ,EAAE;AAAA,QACjD,QAAQ;AACN,iBAAO;AAAA,QACT;AAAA,MACF,CAAC;AAAA,IACH;AACA,UAAM,UAAU,UACb,OAAO,CAAC,MAA4C,MAAM,IAAI,EAC9D,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,GAAG,EACZ,IAAI,CAAC,MAAM,EAAE,IAAI;AAEpB,QAAI,UAAU;AACd,eAAW,YAAY,SAAS;AAC9B,UAAI,QAAQ,SAAS;AACnB,cAAM,IAAI,aAAa,kBAAkB,YAAY;AAAA,MACvD;AACA,UAAI,eAAe;AACnB,UAAI,SAAS,YAAY,EAAE,WAAW,YAAY,YAAY,IAAI,GAAG,GAAG;AACtE,uBAAe,SAAS,MAAM,YAAY,SAAS,CAAC;AAAA,MACtD;AACA,YAAM,SAAS,MAAM,cAAc,UAAU,YAAY;AACzD,UAAI,OAAQ;AACZ,UAAI,UAAU,OAAO,GAAG;AACtB,qBAAa,mBAAmB,OAAO,IAAI,QAAQ,MAAM,MAAM;AAAA,MACjE;AAAA,IACF;AAEA,UAAM,cAAc,KAAK;AAAA,EAC3B;AAGA,MAAI,QAAkB,CAAC;AACvB,MAAI,gBAAgB,aAAa,SAAS,GAAG;AAC3C,YAAQ;AAAA,EACV,OAAO;AAEL,UAAM,EAAE,KAAK,IAAI,MAAM,OAAO,MAAM;AAEpC,UAAM,UAAU,GAAG,WAAW;AAC9B,UAAM,WAAW,MAAM,KAAK,SAAS;AAAA,MACnC,QAAQ,CAAC,sBAAsB,cAAc,eAAe,cAAc,eAAe,gBAAgB;AAAA,MACzG,OAAO;AAAA,IACT,CAAC;AAID,UAAM,EAAE,KAAK,IAAI,MAAM,OAAO,aAAa;AAC3C,UAAM,YAAY,MAAM,QAAQ;AAAA,MAC9B,SAAS,IAAI,OAAO,MAAM;AACxB,YAAI;AACF,gBAAM,QAAQ,MAAM,KAAK,CAAC;AAC1B,iBAAO,EAAE,MAAM,GAAG,OAAO,MAAM,MAAM,QAAQ,EAAE;AAAA,QACjD,QAAQ;AACN,iBAAO;AAAA,QACT;AAAA,MACF,CAAC;AAAA,IACH;AAEA,YAAQ,UACL,OAAO,CAAC,MAA4C,MAAM,IAAI,EAC9D,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,GAAG,EACZ,IAAI,OAAK,EAAE,IAAI;AAAA,EACpB;AAEA,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC3C;AAKA,aAAW,YAAY,OAAO;AAC5B,QAAI,MAAM;AACV,QAAI,SAAS,YAAY,EAAE,WAAW,YAAY,YAAY,IAAI,GAAG,GAAG;AACtE,YAAM,SAAS,MAAM,YAAY,SAAS,CAAC;AAAA,IAC7C,WAAW,SAAS,WAAW,GAAG,KAAK,CAAC,SAAS,YAAY,EAAE,WAAW,YAAY,YAAY,CAAC,GAAG;AACpG;AAAA,IACF;AACA,UAAM,cAAc,UAAU,GAAG;AAAA,EACnC;AAGA,QAAM,cAAwB,CAAC;AAC/B,QAAM,mBAAwG,CAAC;AAE/G,aAAW,YAAY,OAAO;AAE5B,QAAI,eAAe;AACnB,QAAI,SAAS,YAAY,EAAE,WAAW,YAAY,YAAY,IAAI,GAAG,GAAG;AACtE,qBAAe,SAAS,MAAM,YAAY,SAAS,CAAC;AAAA,IACtD,WAAW,SAAS,WAAW,GAAG,GAAG;AAGnC;AAAA,IACF;AACA,UAAM,aAAa,MAAM,cAAc,WAAW,YAAY;AAE9D,QAAI,YAAY;AAGd,YAAM,UAAU,MAAM,cAAc,UAAU,YAAY;AAC1D,UAAI,SAAS;AACX,oBAAY,KAAK,QAAQ;AAAA,MAC3B;AAAA,IAEF,OAAO;AAEL,iBAAW,QAAQ,OAAO;AACxB,cAAM,SAAS,cAAc,oBAAoB,cAAc,KAAK,EAAE;AACtE,YAAI,UAAU,OAAO,SAAS,GAAG;AAC/B,gBAAM,YAAY,OAAO,CAAC;AAC1B,cAAI,aAAa,UAAU,OAAO;AAChC,6BAAiB,KAAK;AAAA,cACpB,MAAM;AAAA,cACN,SAAS,SAAS,KAAK,WAAW,iBAAiB,YAAY,KAAK,UAAU,WAAW,iBAAiB,KAAK,UAAU,cAAc,EAAE;AAAA,cACzI,UAAU;AAAA,YACZ,CAAC;AAAA,UACH;AAAA,QACF,OAAO;AAEL,cAAI,CAAC,YAAY,SAAS,QAAQ,GAAG;AACnC,wBAAY,KAAK,QAAQ;AAAA,UAC3B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,eAAa,YAAY,YAAY,MAAM,0BAA0B;AAGrE,QAAM,gBAAqG,CAAC,GAAG,gBAAgB;AAE/H,MAAI,YAAY,WAAW,GAAG;AAE5B,UAAM,cAAc,KAAK;AACzB,WAAO;AAAA,EACT;AAGA,QAAM,aAAa;AAEnB,QAAM,eAAe,KAAK,KAAK,YAAY,SAAS,UAAU;AAC9D,WAAS,aAAa,GAAG,aAAa,YAAY,QAAQ,cAAc,YAAY;AAClF,UAAM,WAAW,KAAK,MAAM,aAAa,UAAU,IAAI;AACvD,iBAAa,0BAA0B,QAAQ,IAAI,YAAY,MAAM;AACrE,UAAM,aAAa,YAAY,MAAM,YAAY,aAAa,UAAU;AAGxE,UAAM,EAAE,SAAS,IAAI,MAAM,OAAO,aAAa;AAC/C,UAAM,eAAe,MAAM,QAAQ;AAAA,MACjC,WAAW,IAAI,OAAO,aAAa;AACjC,YAAI;AACF,gBAAM,UAAU,MAAM,SAAS,UAAU,OAAO;AAChD,gBAAM,eAAe,SAAS,QAAQ,cAAc,KAAK,EAAE;AAC3D,iBAAO;AAAA,YACL,MAAM;AAAA,YACN;AAAA;AAAA,UACF;AAAA,QACF,QAAQ;AACN,iBAAO;AAAA,QACT;AAAA,MACF,CAAC;AAAA,IACH;AAEA,UAAM,aAAa,aAAa,OAAO,CAAC,MAA8C,MAAM,IAAI;AAEhG,QAAI,WAAW,WAAW,EAAG;AAG7B,UAAM,aAAa,WAChB,IAAI,OAAK,OAAO,EAAE,IAAI;AAAA,EAAS,EAAE,OAAO,EAAE,EAC1C,KAAK,MAAM;AAGd,UAAM,eAAe;AAAA;AAAA,EAEvB,MAAM,IAAI,CAAC,GAAG,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,WAAW,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAO9D,UAAM,SAAS,MAAM,cAAc;AAAA,MACjC;AAAA,MACA,cAAc;AAAA,EAClB,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAuCR,YAAY,eAAe,WAAW,MAAM;AAAA;AAAA,EAAkC,UAAU;AAAA,MACxF,WAAW;AAAA;AAAA,MACX,aAAa;AAAA,IACf,CAAC;AAGD,QAAI,SAOC,CAAC;AAEN,QAAI;AACF,YAAM,UAAU,OAAO,QAAQ,QAAQ,uBAAuB,EAAE,EAAE,KAAK;AACvE,eAAS,KAAK,MAAM,OAAO;AAC3B,UAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,UAAS,CAAC;AAAA,IACxC,SAAS,KAAK;AAEZ,cAAQ,MAAM,oCAAoC,GAAG;AACrD;AAAA,IACF;AAGA,eAAW,SAAS,QAAQ;AAC1B,UAAI,CAAC,MAAM,mBAAmB,MAAM,aAAa,GAAI;AACrD,UAAI,MAAM,aAAa,QAAQ,MAAM,YAAY,KAAK,MAAM,aAAa,MAAM,OAAQ;AAEvF,YAAM,OAAO,MAAM,MAAM,SAAS;AAClC,UAAI,CAAC,KAAM;AACX,YAAM,WAAW,MAAM,aAAa,aAAa,aAAa;AAC9D,YAAM,UAAU,SAAS,KAAK,WAAW,iBAAiB,MAAM,IAAI,KAAK,MAAM,WAAW,KAAK,MAAM,UAAU;AAE/G,oBAAc,KAAK;AAAA,QACjB,MAAM,MAAM;AAAA,QACZ;AAAA,QACA;AAAA,MACF,CAAC;AAGD,oBAAc;AAAA,QACZ,MAAM;AAAA,QACN,KAAK;AAAA,QACL,KAAK;AAAA,QACL;AAAA;AAAA,QACA,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAGA,YAAM,0BAA0B,MAAM,MAAM,MAAM,WAAW;AAAA,IAC/D;AAGA,eAAW,QAAQ,YAAY;AAC7B,eAAS,UAAU,GAAG,UAAU,MAAM,QAAQ,WAAW;AACvD,cAAM,OAAO,MAAM,OAAO;AAC1B,YAAI,CAAC,KAAM;AACX,cAAM,eAAe,OAAO,KAAK,OAAK,EAAE,SAAS,KAAK,QAAQ,EAAE,cAAc,OAAO;AACrF,YAAI,CAAC,cAAc;AACjB,wBAAc;AAAA,YACZ,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL;AAAA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,QAAM,cAAc,KAAK;AAEzB,SAAO;AACT;","names":[]}
+{"version":3,"sources":["../src/agent/goal-validator.ts"],"sourcesContent":["/**\n * Goal Validator - Helpers for goal tracking\n * \n * Goal detection is handled entirely by the AI watcher in watch.ts.\n * The AI (Anthropic) checks every changed file against user-defined goals,\n * using the Trie's priority scoring for cost control.\n * \n * This module provides:\n * - getActiveGoals: loads active goals for the AI prompt\n * - recordGoalViolationCaught: tracks when a violation is detected\n * - recordGoalViolationFixed: tracks when a violation is auto-fixed\n * - measureInitialGoalValue: measures current state for new goals\n */\n\nimport type { Goal } from './project-state.js';\nimport { getProjectState } from './project-state.js';\nimport { searchIssues } from '../memory/issue-store.js';\n\n/**\n * Get active goals for a project (used by the AI watcher)\n */\nexport async function getActiveGoals(projectPath: string): Promise<Goal[]> {\n  const projectState = getProjectState(projectPath);\n  await projectState.load();\n  return projectState.getAllGoals().filter(g => g.status === 'active');\n}\n\nexport async function recordGoalViolationCaught(\n  goal: Goal,\n  file: string,\n  projectPath: string\n): Promise<void> {\n  const projectState = getProjectState(projectPath);\n  await projectState.load();\n  \n  const metadata = goal.metadata || {};\n  const caughtCount = (metadata.caughtCount || 0) + 1;\n  \n  await projectState.updateGoal(goal.id, {\n    metadata: {\n      ...metadata,\n      caughtCount,\n      lastCaught: new Date().toISOString(),\n      lastCaughtFile: file,\n    },\n  });\n}\n\nexport async function recordGoalViolationFixed(\n  goal: Goal,\n  file: string,\n  projectPath: string\n): Promise<void> {\n  const projectState = getProjectState(projectPath);\n  await projectState.load();\n  \n  const metadata = goal.metadata || {};\n  const fixedCount = (metadata.fixedCount || 0) + 1;\n  \n  await projectState.updateGoal(goal.id, {\n    metadata: {\n      ...metadata,\n      fixedCount,\n      lastFixed: new Date().toISOString(),\n      lastFixedFile: file,\n    },\n  });\n  \n  // Resolve the goal-violation issue in the issue store\n  // This is the source of truth - measureGoalMetric() will query from here\n  const { resolveGoalViolation } = await import('../memory/issue-store.js');\n  await resolveGoalViolation(file, goal.description, projectPath);\n  \n  // Trigger immediate progress update so UI reflects the fix\n  const { getGoalManager } = await import('./goal-manager.js');\n  const goalManager = getGoalManager(projectPath);\n  await goalManager.updateGoalProgress();\n}\n\n/**\n * Measure the initial value for a new goal based on existing issues.\n * This sets a proper baseline so progress calculation works correctly.\n * \n * For reduction goals (like \"no emojis\"), we count current violations.\n * For other goals, we use semantic matching against existing issues.\n * \n * Returns the count to use as both startValue and currentValue.\n */\nexport async function measureInitialGoalValue(\n  description: string,\n  projectPath: string\n): Promise<number> {\n  try {\n    const issues = await searchIssues('', {\n      workDir: projectPath,\n      limit: 1000,\n      includeResolved: false,\n    });\n    \n    if (issues.length === 0) {\n      return 0;\n    }\n    \n    const desc = description.toLowerCase();\n    \n    // Check for goal-violation issues that might already exist for similar goals\n    const goalViolations = issues.filter(r => \n      r.issue.agent === 'goal-violation' &&\n      r.issue.issue.toLowerCase().includes(desc.slice(0, 30))\n    );\n    if (goalViolations.length > 0) {\n      return goalViolations.length;\n    }\n    \n    // Security goals\n    if (desc.includes('security') || desc.includes('vulnerab')) {\n      return issues.filter(r => \n        r.issue.agent === 'security' || r.issue.severity === 'critical'\n      ).length;\n    }\n    \n    // Type safety goals\n    if (desc.includes('type') || desc.includes('typescript') || desc.includes('any type')) {\n      return issues.filter(r => \n        r.issue.agent === 'typecheck' ||\n        r.issue.issue.toLowerCase().includes('type')\n      ).length;\n    }\n    \n    // Bug-related goals\n    if (desc.includes('bug') || desc.includes('error')) {\n      return issues.filter(r => \n        r.issue.agent === 'bug-finding' ||\n        r.issue.severity === 'critical' ||\n        r.issue.severity === 'serious'\n      ).length;\n    }\n    \n    // Dead code / unused code goals\n    if (desc.includes('dead code') || desc.includes('unused')) {\n      return issues.filter(r => {\n        const msg = r.issue.issue.toLowerCase();\n        return msg.includes('unused') || msg.includes('dead code') || msg.includes('never used');\n      }).length;\n    }\n    \n    // For custom goals like \"no emojis\", we start at 0 and let the AI scanner find violations\n    // This is correct because we don't know the count until a scan runs\n    return 0;\n  } catch {\n    return 0;\n  }\n}\n\n/**\n * Manually check files against goals\n * Returns violations found\n * \n * NOW WITH CACHING: Uses CodebaseIndex to avoid re-scanning unchanged files\n */\nexport async function checkFilesForGoalViolations(\n  goals: Goal[],\n  projectPath: string,\n  filesToCheck?: string[],\n  onProgress?: (message: string) => void,\n  signal?: AbortSignal\n): Promise<Array<{ file: string; message: string; severity: 'critical' | 'warning' | 'info' }>> {\n  // Import AI client and codebase index\n  const { isAIAvailable, runAIAnalysis } = await import('../ai/client.js');\n  const { CodebaseIndex } = await import('../context/codebase-index.js');\n  \n  if (!isAIAvailable()) {\n    throw new Error('AI not available - ANTHROPIC_API_KEY not set');\n  }\n  \n  // Initialize codebase index for caching\n  const codebaseIndex = new CodebaseIndex(projectPath);\n  \n  // Check if index needs to be built\n  if (codebaseIndex.isEmpty()) {\n    onProgress?.('Building codebase index (first-time, may take a minute)...');\n    \n    // Auto-index using same file selection as checks (most recently modified) so cache overlaps\n    const { glob } = await import('glob');\n    const { stat } = await import('fs/promises');\n    const indexPattern = `${projectPath}/**/*.{ts,tsx,js,jsx,mjs,vue,svelte,astro,py,go,rs,java,c,cpp,h,hpp,cs,rb,php,css,scss,html}`;\n    const indexFiles = await glob(indexPattern, {\n      ignore: ['**/node_modules/**', '**/dist/**', '**/build/**', '**/.git/**', '**/.trie/**', '**/coverage/**'],\n      nodir: true,\n    });\n    \n    const withStats = await Promise.all(\n      indexFiles.map(async (f) => {\n        try {\n          const stats = await stat(f);\n          return { file: f, mtime: stats.mtime.getTime() };\n        } catch {\n          return null;\n        }\n      })\n    );\n    const toIndex = withStats\n      .filter((f): f is { file: string; mtime: number } => f !== null)\n      .sort((a, b) => b.mtime - a.mtime)\n      .slice(0, 500)\n      .map((f) => f.file);\n    \n    let indexed = 0;\n    for (const filePath of toIndex) {\n      if (signal?.aborted) {\n        throw new DOMException('Scan cancelled', 'AbortError');\n      }\n      let relativePath = filePath;\n      if (filePath.toLowerCase().startsWith(projectPath.toLowerCase() + '/')) {\n        relativePath = filePath.slice(projectPath.length + 1);\n      }\n      const result = await codebaseIndex.indexFile(relativePath);\n      if (result) indexed++;\n      if (indexed % 50 === 0) {\n        onProgress?.(`Indexing files (${indexed}/${toIndex.length})...`);\n      }\n    }\n    \n    await codebaseIndex.save();\n  }\n  \n  // Get files to check\n  let files: string[] = [];\n  if (filesToCheck && filesToCheck.length > 0) {\n    files = filesToCheck;\n  } else {\n    // MANUAL CHECK MODE: Scan ALL relevant files, not just recently modified\n    const { glob } = await import('glob');\n    \n    const pattern = `${projectPath}/**/*.{ts,tsx,js,jsx,py,go,rs,java,c,cpp,h,hpp,cs,rb,php,css,scss,html,vue,svelte}`;\n    const allFiles = await glob(pattern, {\n      ignore: ['**/node_modules/**', '**/dist/**', '**/build/**', '**/.git/**', '**/.trie/**', '**/coverage/**'],\n      nodir: true,\n    });\n    \n    // For manual checks, use more files but still reasonable limit\n    // Sort by modification time to prioritize recently modified\n    const { stat } = await import('fs/promises');\n    const withStats = await Promise.all(\n      allFiles.map(async (f) => {\n        try {\n          const stats = await stat(f);\n          return { file: f, mtime: stats.mtime.getTime() };\n        } catch {\n          return null;\n        }\n      })\n    );\n    \n    files = withStats\n      .filter((f): f is { file: string; mtime: number } => f !== null)\n      .sort((a, b) => b.mtime - a.mtime)\n      .slice(0, 100) // Check up to 100 files for manual scans\n      .map(f => f.file);\n  }\n  \n  if (files.length === 0) {\n    throw new Error('No files found to check');\n  }\n\n  // Pre-index the files we're about to check so cache lookups work.\n  // The initial index may have indexed different files (first 500 from glob), while we check\n  // the 100 most recently modified - these can have zero overlap, causing every run to scan.\n  for (const filePath of files) {\n    let rel = filePath;\n    if (filePath.toLowerCase().startsWith(projectPath.toLowerCase() + '/')) {\n      rel = filePath.slice(projectPath.length + 1);\n    } else if (filePath.startsWith('/') && !filePath.toLowerCase().startsWith(projectPath.toLowerCase())) {\n      continue;\n    }\n    await codebaseIndex.indexFile(rel);\n  }\n  \n  // Check which files need scanning vs can use cached results\n  const filesToScan: string[] = [];\n  const cachedViolations: Array<{ file: string; message: string; severity: 'critical' | 'warning' | 'info' }> = [];\n  \n  for (const filePath of files) {\n    // Handle case-insensitive filesystems (macOS) and ensure we get a proper relative path\n    let relativePath = filePath;\n    if (filePath.toLowerCase().startsWith(projectPath.toLowerCase() + '/')) {\n      relativePath = filePath.slice(projectPath.length + 1);\n    } else if (filePath.startsWith('/')) {\n      // Already absolute but doesn't match projectPath - skip this file\n      // This can happen with stale cache entries from different projects\n      continue;\n    }\n    const hasChanged = await codebaseIndex.hasChanged(relativePath);\n    \n    if (hasChanged) {\n      // File changed or not indexed - needs scanning\n      // Try to index the file first; skip if it doesn't exist\n      const indexed = await codebaseIndex.indexFile(relativePath);\n      if (indexed) {\n        filesToScan.push(filePath);\n      }\n      // If indexFile returns null, file doesn't exist - skip it silently\n    } else {\n      // File unchanged - check cache for each goal\n      for (const goal of goals) {\n        const cached = codebaseIndex.getCachedViolations(relativePath, goal.id);\n        if (cached && cached.length > 0) {\n          const violation = cached[0];\n          if (violation && violation.found) {\n            cachedViolations.push({\n              file: relativePath,\n              message: `Goal \"${goal.description}\" violated in ${relativePath}: ${violation.details || 'Violation found'} [${violation.confidence || 90}% confidence] (cached)`,\n              severity: 'warning',\n            });\n          }\n        } else {\n          // No cache for this goal - needs scanning\n          if (!filesToScan.includes(filePath)) {\n            filesToScan.push(filePath);\n          }\n        }\n      }\n    }\n  }\n  \n  onProgress?.(`Checking ${filesToScan.length} files for violations...`);\n  \n  // Process files that need scanning in batches\n  const allViolations: Array<{ file: string; message: string; severity: 'critical' | 'warning' | 'info' }> = [...cachedViolations];\n  \n  if (filesToScan.length === 0) {\n    // All results from cache!\n    await codebaseIndex.save();\n    return allViolations;\n  }\n  \n  // For large file sets, process in batches to avoid token limits\n  const BATCH_SIZE = 25; // Process 25 files at a time\n  \n  const totalBatches = Math.ceil(filesToScan.length / BATCH_SIZE);\n  for (let batchStart = 0; batchStart < filesToScan.length; batchStart += BATCH_SIZE) {\n    const batchNum = Math.floor(batchStart / BATCH_SIZE) + 1;\n    onProgress?.(`Analyzing files (batch ${batchNum}/${totalBatches})...`);\n    const batchFiles = filesToScan.slice(batchStart, batchStart + BATCH_SIZE);\n    \n    // Read file contents for this batch\n    const { readFile } = await import('fs/promises');\n    const fileContents = await Promise.all(\n      batchFiles.map(async (filePath) => {\n        try {\n          const content = await readFile(filePath, 'utf-8');\n          const relativePath = filePath.replace(projectPath + '/', '');\n          return {\n            path: relativePath,\n            content: content, // Never truncate text in Trie Watch\n          };\n        } catch {\n          return null;\n        }\n      })\n    );\n    \n    const validFiles = fileContents.filter((f): f is { path: string; content: string } => f !== null);\n    \n    if (validFiles.length === 0) continue;\n    \n    // Build files block for AI\n    const filesBlock = validFiles\n      .map(f => `--- ${f.path} ---\\n${f.content}`)\n      .join('\\n\\n');\n    \n    // Build goals section\n    const goalsSection = `\nUSER-DEFINED GOALS (check EVERY file against ALL goals):\n${goals.map((g, i) => `  ${i + 1}. \"${g.description}\"`).join('\\n')}\n\nThis is a MANUAL CHECK requested by the user. Report ALL goal violations you find.\nFor emoji detection, look for Unicode emoji characters.\n`;\n  \n    // Run AI analysis\n    const result = await runAIAnalysis({\n      ...(signal && { signal }),\n      systemPrompt: `You are checking code for GOAL VIOLATIONS ONLY.\n${goalsSection}\nReply ONLY with a JSON array. Each element must have:\n- \"file\": relative file path\n- \"severity\": \"critical\" | \"major\" | \"minor\"\n- \"description\": 1-sentence description of the goal violation with specific examples\n- \"confidence\": number 0-100, how confident you are this is a violation\n- \"isGoalViolation\": true (always true for this scan)\n- \"goalIndex\": 0-based index of the violated goal\n\nCRITICAL DETECTION RULES:\n\n**EMOJIS**: Any Unicode emoji characters including but not limited to:\n- Emoticons: 😀😃😄😊🙂🙃😉😇🥰😍🤩😘😗☺️😚😙🥲\n- Symbols: ⚡️⚠️✅❌➜→←↑↓►◄▲▼★☆●○◆◇■□▪️▫️\n- Objects: 📊📈📉💻🖥️📱⌨️🖱️💾💿📀🔧🔨⚙️🛠️\n- Actions: 🔥💪👍👎👏🙌🤝✊👊🎯🎉🎊🚀\n- Weather: ☀️🌤️⛅☁️🌦️🌧️⛈️🌩️🌨️❄️\n- ALL OTHER Unicode emoji in ranges U+1F300-U+1F9FF, U+2600-U+27BF, U+2B00-U+2BFF\n\n**COLORS**: For \"purple\" or \"gradient\" goals, check:\n- CSS: purple, #purple, hsl(purple), rgb(purple), violet, #8B00FF, #9B59D6, etc.\n- Gradients: linear-gradient, radial-gradient, conic-gradient, background-image with gradients\n- Tailwind: purple-*, violet-*, bg-gradient-*\n- Styled components or CSS-in-JS with purple/violet/gradient\n\nBe EXTREMELY thorough. Check:\n1. String literals and template literals\n2. JSX/HTML content\n3. CSS files and style blocks\n4. Comments (emojis in comments still violate \"no emojis\")\n5. console.log statements\n6. Component names, variable names (if they contain emojis)\n\nIf a goal says \"no emojis\" and you see ANY emoji ANYWHERE in the file, report it.\nIf a goal says \"no console.log\" and you see console.log ANYWHERE, report it.\nIf a goal says \"no purple/gradient\" and you see ANY purple color or gradient, report it.\n\nIf no violations found, reply with: []\nOutput ONLY the JSON array, no markdown fences, no commentary.`,\n      userPrompt: `Check these ${validFiles.length} files for goal violations:\\n\\n${filesBlock}`,\n      maxTokens: 8192, // Increased for larger codebases\n      temperature: 0.1,\n    });\n    \n    // Parse response\n    let issues: Array<{\n      file: string;\n      severity: 'critical' | 'major' | 'minor';\n      description: string;\n      confidence: number;\n      isGoalViolation: boolean;\n      goalIndex?: number;\n    }> = [];\n    \n    try {\n      const cleaned = result.content.replace(/```json?\\n?|\\n?```/g, '').trim();\n      issues = JSON.parse(cleaned);\n      if (!Array.isArray(issues)) issues = [];\n    } catch (err) {\n      // Parse failed - continue to next batch\n      console.debug('[Goal Check] Batch parse failed:', err);\n      continue;\n    }\n    \n    // Convert to violation format and record\n    for (const issue of issues) {\n      if (!issue.isGoalViolation || issue.confidence < 50) continue;\n      if (issue.goalIndex == null || issue.goalIndex < 0 || issue.goalIndex >= goals.length) continue;\n      \n      const goal = goals[issue.goalIndex];\n      if (!goal) continue; // Defensive check\n      const severity = issue.severity === 'critical' ? 'critical' : 'warning';\n      const message = `Goal \"${goal.description}\" violated in ${issue.file}: ${issue.description} [${issue.confidence}% confidence]`;\n      \n      allViolations.push({\n        file: issue.file,\n        message,\n        severity,\n      });\n      \n      // Cache the result in codebase index\n      codebaseIndex.recordViolation(\n        issue.file,\n        goal.id,\n        goal.description,\n        true, // found\n        issue.description,\n        issue.confidence\n      );\n      \n      // Record violation\n      await recordGoalViolationCaught(goal, issue.file, projectPath);\n    }\n    \n    // Also record \"no violation\" for scanned files\n    for (const file of validFiles) {\n      for (let goalIdx = 0; goalIdx < goals.length; goalIdx++) {\n        const goal = goals[goalIdx];\n        if (!goal) continue;\n        const hasViolation = issues.some(i => i.file === file.path && i.goalIndex === goalIdx);\n        if (!hasViolation) {\n          codebaseIndex.recordViolation(\n            file.path,\n            goal.id,\n            goal.description,\n            false, // not found\n            undefined,\n            100\n          );\n        }\n      }\n    }\n  }\n  \n  // Save updated index\n  await codebaseIndex.save();\n  \n  return allViolations;\n}\n"],"mappings":";;;;;;;;AAqBA,eAAsB,eAAe,aAAsC;AACzE,QAAM,eAAe,gBAAgB,WAAW;AAChD,QAAM,aAAa,KAAK;AACxB,SAAO,aAAa,YAAY,EAAE,OAAO,OAAK,EAAE,WAAW,QAAQ;AACrE;AAEA,eAAsB,0BACpB,MACA,MACA,aACe;AACf,QAAM,eAAe,gBAAgB,WAAW;AAChD,QAAM,aAAa,KAAK;AAExB,QAAM,WAAW,KAAK,YAAY,CAAC;AACnC,QAAM,eAAe,SAAS,eAAe,KAAK;AAElD,QAAM,aAAa,WAAW,KAAK,IAAI;AAAA,IACrC,UAAU;AAAA,MACR,GAAG;AAAA,MACH;AAAA,MACA,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,MACnC,gBAAgB;AAAA,IAClB;AAAA,EACF,CAAC;AACH;AAEA,eAAsB,yBACpB,MACA,MACA,aACe;AACf,QAAM,eAAe,gBAAgB,WAAW;AAChD,QAAM,aAAa,KAAK;AAExB,QAAM,WAAW,KAAK,YAAY,CAAC;AACnC,QAAM,cAAc,SAAS,cAAc,KAAK;AAEhD,QAAM,aAAa,WAAW,KAAK,IAAI;AAAA,IACrC,UAAU;AAAA,MACR,GAAG;AAAA,MACH;AAAA,MACA,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MAClC,eAAe;AAAA,IACjB;AAAA,EACF,CAAC;AAID,QAAM,EAAE,qBAAqB,IAAI,MAAM,OAAO,2BAA0B;AACxE,QAAM,qBAAqB,MAAM,KAAK,aAAa,WAAW;AAG9D,QAAM,EAAE,eAAe,IAAI,MAAM,OAAO,4BAAmB;AAC3D,QAAM,cAAc,eAAe,WAAW;AAC9C,QAAM,YAAY,mBAAmB;AACvC;AAWA,eAAsB,wBACpB,aACA,aACiB;AACjB,MAAI;AACF,UAAM,SAAS,MAAM,aAAa,IAAI;AAAA,MACpC,SAAS;AAAA,MACT,OAAO;AAAA,MACP,iBAAiB;AAAA,IACnB,CAAC;AAED,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO;AAAA,IACT;AAEA,UAAM,OAAO,YAAY,YAAY;AAGrC,UAAM,iBAAiB,OAAO;AAAA,MAAO,OACnC,EAAE,MAAM,UAAU,oBAClB,EAAE,MAAM,MAAM,YAAY,EAAE,SAAS,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,IACxD;AACA,QAAI,eAAe,SAAS,GAAG;AAC7B,aAAO,eAAe;AAAA,IACxB;AAGA,QAAI,KAAK,SAAS,UAAU,KAAK,KAAK,SAAS,UAAU,GAAG;AAC1D,aAAO,OAAO;AAAA,QAAO,OACnB,EAAE,MAAM,UAAU,cAAc,EAAE,MAAM,aAAa;AAAA,MACvD,EAAE;AAAA,IACJ;AAGA,QAAI,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,YAAY,KAAK,KAAK,SAAS,UAAU,GAAG;AACrF,aAAO,OAAO;AAAA,QAAO,OACnB,EAAE,MAAM,UAAU,eAClB,EAAE,MAAM,MAAM,YAAY,EAAE,SAAS,MAAM;AAAA,MAC7C,EAAE;AAAA,IACJ;AAGA,QAAI,KAAK,SAAS,KAAK,KAAK,KAAK,SAAS,OAAO,GAAG;AAClD,aAAO,OAAO;AAAA,QAAO,OACnB,EAAE,MAAM,UAAU,iBAClB,EAAE,MAAM,aAAa,cACrB,EAAE,MAAM,aAAa;AAAA,MACvB,EAAE;AAAA,IACJ;AAGA,QAAI,KAAK,SAAS,WAAW,KAAK,KAAK,SAAS,QAAQ,GAAG;AACzD,aAAO,OAAO,OAAO,OAAK;AACxB,cAAM,MAAM,EAAE,MAAM,MAAM,YAAY;AACtC,eAAO,IAAI,SAAS,QAAQ,KAAK,IAAI,SAAS,WAAW,KAAK,IAAI,SAAS,YAAY;AAAA,MACzF,CAAC,EAAE;AAAA,IACL;AAIA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAQA,eAAsB,4BACpB,OACA,aACA,cACA,YACA,QAC8F;AAE9F,QAAM,EAAE,eAAe,cAAc,IAAI,MAAM,OAAO,sBAAiB;AACvE,QAAM,EAAE,cAAc,IAAI,MAAM,OAAO,8BAA8B;AAErE,MAAI,CAAC,cAAc,GAAG;AACpB,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AAGA,QAAM,gBAAgB,IAAI,cAAc,WAAW;AAGnD,MAAI,cAAc,QAAQ,GAAG;AAC3B,iBAAa,4DAA4D;AAGzE,UAAM,EAAE,KAAK,IAAI,MAAM,OAAO,MAAM;AACpC,UAAM,EAAE,KAAK,IAAI,MAAM,OAAO,aAAa;AAC3C,UAAM,eAAe,GAAG,WAAW;AACnC,UAAM,aAAa,MAAM,KAAK,cAAc;AAAA,MAC1C,QAAQ,CAAC,sBAAsB,cAAc,eAAe,cAAc,eAAe,gBAAgB;AAAA,MACzG,OAAO;AAAA,IACT,CAAC;AAED,UAAM,YAAY,MAAM,QAAQ;AAAA,MAC9B,WAAW,IAAI,OAAO,MAAM;AAC1B,YAAI;AACF,gBAAM,QAAQ,MAAM,KAAK,CAAC;AAC1B,iBAAO,EAAE,MAAM,GAAG,OAAO,MAAM,MAAM,QAAQ,EAAE;AAAA,QACjD,QAAQ;AACN,iBAAO;AAAA,QACT;AAAA,MACF,CAAC;AAAA,IACH;AACA,UAAM,UAAU,UACb,OAAO,CAAC,MAA4C,MAAM,IAAI,EAC9D,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,GAAG,EACZ,IAAI,CAAC,MAAM,EAAE,IAAI;AAEpB,QAAI,UAAU;AACd,eAAW,YAAY,SAAS;AAC9B,UAAI,QAAQ,SAAS;AACnB,cAAM,IAAI,aAAa,kBAAkB,YAAY;AAAA,MACvD;AACA,UAAI,eAAe;AACnB,UAAI,SAAS,YAAY,EAAE,WAAW,YAAY,YAAY,IAAI,GAAG,GAAG;AACtE,uBAAe,SAAS,MAAM,YAAY,SAAS,CAAC;AAAA,MACtD;AACA,YAAM,SAAS,MAAM,cAAc,UAAU,YAAY;AACzD,UAAI,OAAQ;AACZ,UAAI,UAAU,OAAO,GAAG;AACtB,qBAAa,mBAAmB,OAAO,IAAI,QAAQ,MAAM,MAAM;AAAA,MACjE;AAAA,IACF;AAEA,UAAM,cAAc,KAAK;AAAA,EAC3B;AAGA,MAAI,QAAkB,CAAC;AACvB,MAAI,gBAAgB,aAAa,SAAS,GAAG;AAC3C,YAAQ;AAAA,EACV,OAAO;AAEL,UAAM,EAAE,KAAK,IAAI,MAAM,OAAO,MAAM;AAEpC,UAAM,UAAU,GAAG,WAAW;AAC9B,UAAM,WAAW,MAAM,KAAK,SAAS;AAAA,MACnC,QAAQ,CAAC,sBAAsB,cAAc,eAAe,cAAc,eAAe,gBAAgB;AAAA,MACzG,OAAO;AAAA,IACT,CAAC;AAID,UAAM,EAAE,KAAK,IAAI,MAAM,OAAO,aAAa;AAC3C,UAAM,YAAY,MAAM,QAAQ;AAAA,MAC9B,SAAS,IAAI,OAAO,MAAM;AACxB,YAAI;AACF,gBAAM,QAAQ,MAAM,KAAK,CAAC;AAC1B,iBAAO,EAAE,MAAM,GAAG,OAAO,MAAM,MAAM,QAAQ,EAAE;AAAA,QACjD,QAAQ;AACN,iBAAO;AAAA,QACT;AAAA,MACF,CAAC;AAAA,IACH;AAEA,YAAQ,UACL,OAAO,CAAC,MAA4C,MAAM,IAAI,EAC9D,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,GAAG,EACZ,IAAI,OAAK,EAAE,IAAI;AAAA,EACpB;AAEA,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,MAAM,yBAAyB;AAAA,EAC3C;AAKA,aAAW,YAAY,OAAO;AAC5B,QAAI,MAAM;AACV,QAAI,SAAS,YAAY,EAAE,WAAW,YAAY,YAAY,IAAI,GAAG,GAAG;AACtE,YAAM,SAAS,MAAM,YAAY,SAAS,CAAC;AAAA,IAC7C,WAAW,SAAS,WAAW,GAAG,KAAK,CAAC,SAAS,YAAY,EAAE,WAAW,YAAY,YAAY,CAAC,GAAG;AACpG;AAAA,IACF;AACA,UAAM,cAAc,UAAU,GAAG;AAAA,EACnC;AAGA,QAAM,cAAwB,CAAC;AAC/B,QAAM,mBAAwG,CAAC;AAE/G,aAAW,YAAY,OAAO;AAE5B,QAAI,eAAe;AACnB,QAAI,SAAS,YAAY,EAAE,WAAW,YAAY,YAAY,IAAI,GAAG,GAAG;AACtE,qBAAe,SAAS,MAAM,YAAY,SAAS,CAAC;AAAA,IACtD,WAAW,SAAS,WAAW,GAAG,GAAG;AAGnC;AAAA,IACF;AACA,UAAM,aAAa,MAAM,cAAc,WAAW,YAAY;AAE9D,QAAI,YAAY;AAGd,YAAM,UAAU,MAAM,cAAc,UAAU,YAAY;AAC1D,UAAI,SAAS;AACX,oBAAY,KAAK,QAAQ;AAAA,MAC3B;AAAA,IAEF,OAAO;AAEL,iBAAW,QAAQ,OAAO;AACxB,cAAM,SAAS,cAAc,oBAAoB,cAAc,KAAK,EAAE;AACtE,YAAI,UAAU,OAAO,SAAS,GAAG;AAC/B,gBAAM,YAAY,OAAO,CAAC;AAC1B,cAAI,aAAa,UAAU,OAAO;AAChC,6BAAiB,KAAK;AAAA,cACpB,MAAM;AAAA,cACN,SAAS,SAAS,KAAK,WAAW,iBAAiB,YAAY,KAAK,UAAU,WAAW,iBAAiB,KAAK,UAAU,cAAc,EAAE;AAAA,cACzI,UAAU;AAAA,YACZ,CAAC;AAAA,UACH;AAAA,QACF,OAAO;AAEL,cAAI,CAAC,YAAY,SAAS,QAAQ,GAAG;AACnC,wBAAY,KAAK,QAAQ;AAAA,UAC3B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,eAAa,YAAY,YAAY,MAAM,0BAA0B;AAGrE,QAAM,gBAAqG,CAAC,GAAG,gBAAgB;AAE/H,MAAI,YAAY,WAAW,GAAG;AAE5B,UAAM,cAAc,KAAK;AACzB,WAAO;AAAA,EACT;AAGA,QAAM,aAAa;AAEnB,QAAM,eAAe,KAAK,KAAK,YAAY,SAAS,UAAU;AAC9D,WAAS,aAAa,GAAG,aAAa,YAAY,QAAQ,cAAc,YAAY;AAClF,UAAM,WAAW,KAAK,MAAM,aAAa,UAAU,IAAI;AACvD,iBAAa,0BAA0B,QAAQ,IAAI,YAAY,MAAM;AACrE,UAAM,aAAa,YAAY,MAAM,YAAY,aAAa,UAAU;AAGxE,UAAM,EAAE,SAAS,IAAI,MAAM,OAAO,aAAa;AAC/C,UAAM,eAAe,MAAM,QAAQ;AAAA,MACjC,WAAW,IAAI,OAAO,aAAa;AACjC,YAAI;AACF,gBAAM,UAAU,MAAM,SAAS,UAAU,OAAO;AAChD,gBAAM,eAAe,SAAS,QAAQ,cAAc,KAAK,EAAE;AAC3D,iBAAO;AAAA,YACL,MAAM;AAAA,YACN;AAAA;AAAA,UACF;AAAA,QACF,QAAQ;AACN,iBAAO;AAAA,QACT;AAAA,MACF,CAAC;AAAA,IACH;AAEA,UAAM,aAAa,aAAa,OAAO,CAAC,MAA8C,MAAM,IAAI;AAEhG,QAAI,WAAW,WAAW,EAAG;AAG7B,UAAM,aAAa,WAChB,IAAI,OAAK,OAAO,EAAE,IAAI;AAAA,EAAS,EAAE,OAAO,EAAE,EAC1C,KAAK,MAAM;AAGd,UAAM,eAAe;AAAA;AAAA,EAEvB,MAAM,IAAI,CAAC,GAAG,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,WAAW,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAO9D,UAAM,SAAS,MAAM,cAAc;AAAA,MACjC,GAAI,UAAU,EAAE,OAAO;AAAA,MACvB,cAAc;AAAA,EAClB,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAuCR,YAAY,eAAe,WAAW,MAAM;AAAA;AAAA,EAAkC,UAAU;AAAA,MACxF,WAAW;AAAA;AAAA,MACX,aAAa;AAAA,IACf,CAAC;AAGD,QAAI,SAOC,CAAC;AAEN,QAAI;AACF,YAAM,UAAU,OAAO,QAAQ,QAAQ,uBAAuB,EAAE,EAAE,KAAK;AACvE,eAAS,KAAK,MAAM,OAAO;AAC3B,UAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,UAAS,CAAC;AAAA,IACxC,SAAS,KAAK;AAEZ,cAAQ,MAAM,oCAAoC,GAAG;AACrD;AAAA,IACF;AAGA,eAAW,SAAS,QAAQ;AAC1B,UAAI,CAAC,MAAM,mBAAmB,MAAM,aAAa,GAAI;AACrD,UAAI,MAAM,aAAa,QAAQ,MAAM,YAAY,KAAK,MAAM,aAAa,MAAM,OAAQ;AAEvF,YAAM,OAAO,MAAM,MAAM,SAAS;AAClC,UAAI,CAAC,KAAM;AACX,YAAM,WAAW,MAAM,aAAa,aAAa,aAAa;AAC9D,YAAM,UAAU,SAAS,KAAK,WAAW,iBAAiB,MAAM,IAAI,KAAK,MAAM,WAAW,KAAK,MAAM,UAAU;AAE/G,oBAAc,KAAK;AAAA,QACjB,MAAM,MAAM;AAAA,QACZ;AAAA,QACA;AAAA,MACF,CAAC;AAGD,oBAAc;AAAA,QACZ,MAAM;AAAA,QACN,KAAK;AAAA,QACL,KAAK;AAAA,QACL;AAAA;AAAA,QACA,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAGA,YAAM,0BAA0B,MAAM,MAAM,MAAM,WAAW;AAAA,IAC/D;AAGA,eAAW,QAAQ,YAAY;AAC7B,eAAS,UAAU,GAAG,UAAU,MAAM,QAAQ,WAAW;AACvD,cAAM,OAAO,MAAM,OAAO;AAC1B,YAAI,CAAC,KAAM;AACX,cAAM,eAAe,OAAO,KAAK,OAAK,EAAE,SAAS,KAAK,QAAQ,EAAE,cAAc,OAAO;AACrF,YAAI,CAAC,cAAc;AACjB,wBAAc;AAAA,YACZ,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL;AAAA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,QAAM,cAAc,KAAK;AAEzB,SAAO;AACT;","names":[]}

package/dist/{chunk-OTQEFXHU.js → chunk-ABY2R7OK.js}

@@ -7,7 +7,7 @@ import {
 } from "./chunk-43X6JBEM.js";
 import {
   getTrieDirectory
-} from "./chunk-SH7H3WRU.js";
+} from "./chunk-4TQQP7JD.js";
 
 // src/agent/insight-store.ts
 import { mkdir, readFile } from "fs/promises";
@@ -437,4 +437,4 @@ export {
   getInsightStore,
   clearInsightStores
 };
-//# sourceMappingURL=chunk-OTQEFXHU.js.map
+//# sourceMappingURL=chunk-ABY2R7OK.js.map

package/dist/{chunk-QH77RQB3.js → chunk-ED7PLRQA.js}

@@ -6,14 +6,14 @@ import {
 } from "./chunk-EFWVF6TI.js";
 import {
   appendIssuesToLedger
-} from "./chunk-ZUEAHFSY.js";
+} from "./chunk-TWPX6PHF.js";
 import {
   atomicWriteJSON
 } from "./chunk-43X6JBEM.js";
 import {
   getTrieDirectory,
   getWorkingDirectory
-} from "./chunk-SH7H3WRU.js";
+} from "./chunk-4TQQP7JD.js";
 
 // src/memory/issue-store.ts
 import { mkdir as mkdir2, readFile as readFile2, readdir } from "fs/promises";
@@ -432,8 +432,7 @@ async function storeIssues(issues, project, workDir) {
       project,
       resolved: false,
       resolvedAt: void 0,
-      ledgerBlockHash: void 0
-      // Will be set after ledger write
+      ...issue.ledgerBlockHash && { ledgerBlockHash: issue.ledgerBlockHash }
     };
     stored.push(storedIssue);
   }
@@ -675,7 +674,7 @@ async function getDailyLogs(workDir) {
 async function getIssueLedgerEntry(issue, workDir) {
   if (!issue.ledgerBlockHash) return null;
   const projectDir = workDir || getWorkingDirectory(void 0, true);
-  const { getLedgerBlocks } = await import("./ledger-43SIVE7X.js");
+  const { getLedgerBlocks } = await import("./ledger-VNA4DX3Z.js");
   const blocks = await getLedgerBlocks(projectDir);
   const block = blocks.find((b) => b.blockHash === issue.ledgerBlockHash);
   if (!block) return null;
@@ -780,4 +779,4 @@ export {
   getDailyLogs,
   getIssueLedgerEntry
 };
-//# sourceMappingURL=chunk-QH77RQB3.js.map
+//# sourceMappingURL=chunk-ED7PLRQA.js.map

package/dist/chunk-ED7PLRQA.js.map

@@ -0,0 +1 @@
+{"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 { 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 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 saveIssueIndex(index, projectDir);\n  return true;\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 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 saveIssueIndex(index, projectDir);\n  }\n  \n  return { resolved: resolvedCount, stillActive: stillActiveCount };\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 index = await loadIssueIndex(projectDir);\n  \n  const now = new Date().toISOString();\n  let resolvedCount = 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      resolvedCount++;\n    }\n  }\n  \n  if (resolvedCount > 0) {\n    await saveIssueIndex(index, projectDir);\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 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 saveIssueIndex(remaining, projectDir);\n  \n  return {\n    removed: originalCount - remaining.length,\n    remaining: remaining.length,\n    strategy,\n  };\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      console.error(`   Issue index corrupted: ${result.error}`);\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  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  await saveIssueIndex(existing, projectDir);\n  return dedupedCount;\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 * 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 saveIssueIndex(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;;;AF9NA,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,QAAQ,MAAM,eAAe,UAAU;AAE7C,QAAM,QAAQ,MAAM,KAAK,OAAK,EAAE,OAAO,OAAO;AAC9C,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,WAAW;AACjB,QAAM,cAAa,oBAAI,KAAK,GAAE,YAAY;AAE1C,QAAM,eAAe,OAAO,UAAU;AACtC,SAAO;AACT;AAcA,eAAsB,kBACpB,gBACA,cACA,SACoD;AACpD,QAAM,aAAa,WAAW,oBAAoB,QAAW,IAAI;AACjE,QAAM,QAAQ,MAAM,eAAe,UAAU;AAG7C,QAAM,iBAAiB,IAAI,IAAI,aAAa,IAAI,OAAK,EAAE,QAAQ,OAAO,GAAG,CAAC,CAAC;AAE3E,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,MAAI,gBAAgB;AACpB,MAAI,mBAAmB;AAEvB,aAAW,SAAS,OAAO;AAEzB,QAAI,MAAM,SAAU;AAGpB,UAAM,iBAAiB,MAAM,KAAK,QAAQ,OAAO,GAAG;AAIpD,QAAI,CAAC,eAAe,IAAI,cAAc,GAAG;AACvC;AACA;AAAA,IACF;AAGA,QAAI,CAAC,eAAe,IAAI,MAAM,IAAI,GAAG;AACnC,YAAM,WAAW;AACjB,YAAM,aAAa;AACnB;AAAA,IACF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AAGA,MAAI,gBAAgB,GAAG;AACrB,UAAM,eAAe,OAAO,UAAU;AAAA,EACxC;AAEA,SAAO,EAAE,UAAU,eAAe,aAAa,iBAAiB;AAClE;AAMA,eAAsB,qBACpB,MACA,iBACA,SACiB;AACjB,QAAM,aAAa,WAAW,oBAAoB,QAAW,IAAI;AACjE,QAAM,QAAQ,MAAM,eAAe,UAAU;AAE7C,QAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,MAAI,gBAAgB;AAEpB,aAAW,SAAS,OAAO;AACzB,QAAI,MAAM,SAAU;AACpB,QAAI,MAAM,UAAU,iBAAkB;AAGtC,UAAM,iBAAiB,MAAM,KAAK,QAAQ,OAAO,GAAG;AACpD,UAAM,mBAAmB,KAAK,QAAQ,OAAO,GAAG;AAEhD,QAAI,mBAAmB,oBACnB,MAAM,MAAM,SAAS,SAAS,eAAe,GAAG,GAAG;AACrD,YAAM,WAAW;AACjB,YAAM,aAAa;AACnB;AAAA,IACF;AAAA,EACF;AAEA,MAAI,gBAAgB,GAAG;AACrB,UAAM,eAAe,OAAO,UAAU;AAAA,EACxC;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,QAAQ,MAAM,eAAe,UAAU;AAC7C,QAAM,gBAAgB,MAAM;AAE5B,MAAI,YAA2B,CAAC;AAEhC,UAAQ,UAAU;AAAA,IAChB,KAAK;AAEH,YAAM,gBAAgB,oBAAI,KAAK;AAC/B,oBAAc,QAAQ,cAAc,QAAQ,IAAI,EAAE;AAElD,kBAAY,MAAM,OAAO,OAAK;AAC5B,cAAM,WAAW,IAAI,KAAK,EAAE,SAAS,KAAK;AAC1C,cAAM,cAAc,CAAC,YAAY,MAAM,EAAE,SAAS,EAAE,QAAQ;AAC5D,cAAM,eAAe,CAAC,EAAE;AAExB,eAAO,YAAY,eAAe;AAAA,MACpC,CAAC;AACD;AAAA,IAEF,KAAK;AAEH,kBAAY,MAAM,OAAO,OAAK,CAAC,EAAE,QAAQ;AACzC;AAAA,IAEF,KAAK;AAEH,YAAM,UAAU,QAAQ,WAAW;AACnC,YAAM,aAAa,oBAAI,KAAK;AAC5B,iBAAW,QAAQ,WAAW,QAAQ,IAAI,OAAO;AAEjD,kBAAY,MAAM,OAAO,OAAK,IAAI,KAAK,EAAE,SAAS,KAAK,UAAU;AACjE;AAAA,IAEF,KAAK;AAEH,kBAAY,CAAC;AACb;AAAA,EACJ;AAEA,QAAM,eAAe,WAAW,UAAU;AAE1C,SAAO;AAAA,IACL,SAAS,gBAAgB,UAAU;AAAA,IACnC,WAAW,UAAU;AAAA,IACrB;AAAA,EACF;AACF;AASA,eAAsB,aAAa,SAAqC;AACtE,QAAM,aAAa,WAAW,oBAAoB,QAAW,IAAI;AACjE,QAAM,YAAYD,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,cAAQ,MAAM,6BAA6B,OAAO,KAAK,EAAE;AACzD,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,MAAI,WAAW,MAAM,eAAe,UAAU;AAI9C,QAAM,UAAU,IAAI,IAAI,SAAS,IAAI,OAAK,EAAE,IAAI,CAAC;AACjD,QAAM,QAAQ,UAAU,OAAO,OAAK,CAAC,QAAQ,IAAI,EAAE,IAAI,CAAC;AACxD,QAAM,eAAe,MAAM;AAE3B,aAAW,CAAC,GAAG,UAAU,GAAG,KAAK;AAGjC,MAAI,SAAS,SAAS,KAAK;AACzB,UAAM,EAAE,SAAS,UAAU,IAAI,MAAM,iBAAiB,UAAU;AAAA,MAC9D,UAAU;AAAA,MACV,oBAAoB;AAAA,IACtB,CAAC;AAED,QAAI,SAAS;AACX,YAAM,qBAAqB,SAAS,UAAU;AAC9C,iBAAW;AAAA,IACb;AAAA,EACF;AAIA,MAAI,SAAS,SAAS,KAAO;AAC3B,eAAW,iBAAiB,UAAU,GAAK;AAAA,EAC7C;AAEA,QAAM,eAAe,UAAU,UAAU;AACzC,SAAO;AACT;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;AASA,eAAe,eAAe,QAAuB,YAAmC;AACtF,QAAM,YAAYD,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-23RJT5WT.js → chunk-F7BMFOZ6.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-43X6JBEM.js";
 import {
   getTrieDirectory
-} from "./chunk-SH7H3WRU.js";
+} from "./chunk-4TQQP7JD.js";
 
 // src/cli/dashboard/chat-store.ts
 import { mkdir, readFile, unlink } from "fs/promises";
@@ -345,4 +345,4 @@ export {
   getChatStore,
   clearChatStores
 };
-//# sourceMappingURL=chunk-23RJT5WT.js.map
+//# sourceMappingURL=chunk-F7BMFOZ6.js.map

package/dist/{chunk-53KUI7RQ.js → chunk-G7Q23IGF.js}

@@ -1,32 +1,32 @@
 import {
   IncidentIndex
-} from "./chunk-4C67GV3O.js";
+} from "./chunk-TCNCNWGV.js";
 import {
   TriePatternDiscovery
 } from "./chunk-ZV2K6M7T.js";
 import {
   ContextGraph
-} from "./chunk-FH335WL5.js";
-import {
-  storeIssues
-} from "./chunk-QH77RQB3.js";
+} from "./chunk-TWQPOVRA.js";
 import {
   scanForVulnerabilities
 } from "./chunk-F4NJ4CBP.js";
 import {
   scanForVibeCodeIssues
 } from "./chunk-IXO4G4D3.js";
+import {
+  storeIssues
+} from "./chunk-ED7PLRQA.js";
 import {
   getDiff,
   getRecentCommits,
   getStagedChanges,
   getUncommittedChanges,
   getWorkingTreeDiff
-} from "./chunk-ZUEAHFSY.js";
+} from "./chunk-TWPX6PHF.js";
 import {
   getTrieDirectory,
   getWorkingDirectory
-} from "./chunk-SH7H3WRU.js";
+} from "./chunk-4TQQP7JD.js";
 import {
   isInteractiveMode
 } from "./chunk-APMV77PU.js";
@@ -1439,8 +1439,33 @@ async function reasonAboutChanges(projectPath, files, options = {}) {
 }
 async function reasonAboutChangesHumanReadable(projectPath, files, options = {}) {
   const reasoning = await reasonAboutChanges(projectPath, files, options);
-  const { humanizeReasoning } = await import("./comprehension-46F7ZNKL.js");
-  return humanizeReasoning(reasoning);
+  const topFile = [...reasoning.files].sort((a, b) => b.score - a.score)[0];
+  const topReasons = topFile?.reasons?.slice(0, 3) ?? [];
+  const summaryParts = [];
+  summaryParts.push(`Risk ${reasoning.riskLevel.toUpperCase()} (${reasoning.shouldBlock ? "block" : "allow"})`);
+  if (topFile) summaryParts.push(`Most sensitive file: ${topFile.file}`);
+  if (topReasons.length) summaryParts.push(`Top reasons: ${topReasons.join("; ")}`);
+  const patterns = reasoning.matchedPatterns;
+  const incidents = reasoning.relevantIncidents;
+  const firstPattern = patterns[0];
+  const patternLine = firstPattern ? `Pattern match: ${firstPattern.data.description}` : "No known risky patterns matched.";
+  const incidentLine = incidents[0] ? `Relevant prior incident: ${incidents[0].data.description} (${incidents[0].data.severity})` : "No prior incidents linked to these files.";
+  const howBad = [
+    `Overall risk is ${reasoning.riskLevel}.`,
+    reasoning.shouldBlock ? "This is likely to break things or violate policy if pushed without review." : "This is unlikely to cause major issues if you follow normal review/testing.",
+    incidentLine
+  ].join(" ");
+  const whatToDo = [
+    reasoning.recommendation,
+    patterns.length ? `Double-check the pattern(s): ${patterns.slice(0, 2).map((p) => p.data.description).join(" | ")}.` : ""
+  ].filter(Boolean).join(" ");
+  return {
+    summary: summaryParts.join(" \u2014 "),
+    whatIFound: [patternLine, `Incidents considered: ${incidents.length}. Patterns considered: ${patterns.length}.`].join(" "),
+    howBad,
+    whatToDo,
+    original: reasoning
+  };
 }
 
 export {
@@ -1456,4 +1481,4 @@ export {
   handleCheckpointCommand,
   isTrieInitialized
 };
-//# sourceMappingURL=chunk-53KUI7RQ.js.map
+//# sourceMappingURL=chunk-G7Q23IGF.js.map