@ulrichc1/sparn 1.0.1 → 1.1.0

package/dist/hooks/post-tool-result.js

@@ -0,0 +1,269 @@
+#!/usr/bin/env node
+
+// src/utils/tokenizer.ts
+function estimateTokens(text) {
+  if (!text || text.length === 0) {
+    return 0;
+  }
+  const words = text.split(/\s+/).filter((w) => w.length > 0);
+  const wordCount = words.length;
+  const charCount = text.length;
+  const charEstimate = Math.ceil(charCount / 4);
+  const wordEstimate = Math.ceil(wordCount * 0.75);
+  return Math.max(wordEstimate, charEstimate);
+}
+
+// src/hooks/post-tool-result.ts
+function exitSuccess(output) {
+  process.stdout.write(output);
+  process.exit(0);
+}
+var COMPRESSION_THRESHOLD = 5e3;
+var TOOL_PATTERNS = {
+  fileRead: /<file_path>(.*?)<\/file_path>[\s\S]*?<content>([\s\S]*?)<\/content>/,
+  grepResult: /<pattern>(.*?)<\/pattern>[\s\S]*?<matches>([\s\S]*?)<\/matches>/,
+  gitDiff: /^diff --git/m,
+  buildOutput: /(error|warning|failed|failure)/i,
+  npmInstall: /^(npm|pnpm|yarn) (install|add|i)/m,
+  dockerLogs: /^\[?\d{4}-\d{2}-\d{2}/m,
+  testResults: /(PASS|FAIL|SKIP).*?\.test\./i,
+  typescriptErrors: /^.*\(\d+,\d+\): error TS\d+:/m,
+  webpackBuild: /webpack \d+\.\d+\.\d+/i
+};
+function compressFileRead(content, maxLines = 100) {
+  const lines = content.split("\n");
+  if (lines.length <= maxLines * 2) {
+    return content;
+  }
+  const head = lines.slice(0, maxLines);
+  const tail = lines.slice(-maxLines);
+  const omitted = lines.length - maxLines * 2;
+  return [...head, "", `... [${omitted} lines omitted] ...`, "", ...tail].join("\n");
+}
+function compressGrepResults(content, maxMatchesPerFile = 5) {
+  const lines = content.split("\n");
+  const fileMatches = /* @__PURE__ */ new Map();
+  for (const line of lines) {
+    const match = line.match(/^(.*?):(\d+):(.*)/);
+    if (match?.[1] && match[2] && match[3]) {
+      const file = match[1];
+      const lineNum = match[2];
+      const text = match[3];
+      if (!fileMatches.has(file)) {
+        fileMatches.set(file, []);
+      }
+      fileMatches.get(file)?.push(`  Line ${lineNum}: ${text.trim()}`);
+    }
+  }
+  const compressed = [];
+  for (const [file, matches] of fileMatches.entries()) {
+    compressed.push(`${file} (${matches.length} matches):`);
+    if (matches.length <= maxMatchesPerFile) {
+      compressed.push(...matches);
+    } else {
+      compressed.push(...matches.slice(0, maxMatchesPerFile));
+      compressed.push(`  ... and ${matches.length - maxMatchesPerFile} more matches`);
+    }
+    compressed.push("");
+  }
+  return compressed.join("\n");
+}
+function compressGitDiff(content) {
+  const lines = content.split("\n");
+  const files = /* @__PURE__ */ new Map();
+  let currentFile = "";
+  for (const line of lines) {
+    if (line.startsWith("diff --git")) {
+      const match = line.match(/diff --git a\/(.*?) b\/(.*)/);
+      if (match) {
+        currentFile = match[2] || "";
+        files.set(currentFile, { added: 0, removed: 0 });
+      }
+    } else if (line.startsWith("+") && !line.startsWith("+++")) {
+      const stats = files.get(currentFile);
+      if (stats) stats.added++;
+    } else if (line.startsWith("-") && !line.startsWith("---")) {
+      const stats = files.get(currentFile);
+      if (stats) stats.removed++;
+    }
+  }
+  const summary = ["Git diff summary:"];
+  for (const [file, stats] of files.entries()) {
+    summary.push(`  ${file}: +${stats.added} -${stats.removed}`);
+  }
+  return summary.join("\n");
+}
+function compressBuildOutput(content) {
+  const lines = content.split("\n");
+  const important = [];
+  for (const line of lines) {
+    if (/(error|warning|failed|failure|fatal)/i.test(line)) {
+      important.push(line);
+    }
+  }
+  if (important.length === 0) {
+    return "Build output: No errors or warnings found";
+  }
+  return ["Build errors/warnings:", ...important].join("\n");
+}
+function compressNpmInstall(content) {
+  const lines = content.split("\n");
+  const summary = [];
+  const warnings = [];
+  const errors = [];
+  for (const line of lines) {
+    if (/added \d+ packages?/i.test(line)) {
+      summary.push(line.trim());
+    }
+    if (/warn/i.test(line)) {
+      warnings.push(line.trim());
+    }
+    if (/error/i.test(line)) {
+      errors.push(line.trim());
+    }
+  }
+  if (errors.length > 0) {
+    return ["Package installation errors:", ...errors.slice(0, 5)].join("\n");
+  }
+  if (warnings.length > 0) {
+    return [
+      "Package installation completed with warnings:",
+      ...warnings.slice(0, 3),
+      warnings.length > 3 ? `... and ${warnings.length - 3} more warnings` : ""
+    ].filter(Boolean).join("\n");
+  }
+  return summary.length > 0 ? summary.join("\n") : "Package installation completed successfully";
+}
+function compressDockerLogs(content) {
+  const lines = content.split("\n");
+  const logMap = /* @__PURE__ */ new Map();
+  for (const line of lines) {
+    const normalized = line.replace(/^\[?\d{4}-\d{2}-\d{2}.*?\]\s*/, "").trim();
+    if (normalized) {
+      logMap.set(normalized, (logMap.get(normalized) || 0) + 1);
+    }
+  }
+  const summary = ["Docker logs (deduplicated):"];
+  for (const [log, count] of Array.from(logMap.entries()).slice(0, 20)) {
+    if (count > 1) {
+      summary.push(`  [${count}x] ${log}`);
+    } else {
+      summary.push(`  ${log}`);
+    }
+  }
+  if (logMap.size > 20) {
+    summary.push(`  ... and ${logMap.size - 20} more unique log lines`);
+  }
+  return summary.join("\n");
+}
+function compressTestResults(content) {
+  const lines = content.split("\n");
+  let passed = 0;
+  let failed = 0;
+  let skipped = 0;
+  const failures = [];
+  for (const line of lines) {
+    if (/PASS/i.test(line)) passed++;
+    if (/FAIL/i.test(line)) {
+      failed++;
+      failures.push(line.trim());
+    }
+    if (/SKIP/i.test(line)) skipped++;
+  }
+  const summary = [`Test Results: ${passed} passed, ${failed} failed, ${skipped} skipped`];
+  if (failures.length > 0) {
+    summary.push("", "Failed tests:");
+    summary.push(...failures.slice(0, 10));
+    if (failures.length > 10) {
+      summary.push(`... and ${failures.length - 10} more failures`);
+    }
+  }
+  return summary.join("\n");
+}
+function compressTypescriptErrors(content) {
+  const lines = content.split("\n");
+  const errorMap = /* @__PURE__ */ new Map();
+  for (const line of lines) {
+    const match = line.match(/^(.*?)\(\d+,\d+\): error (TS\d+):/);
+    if (match) {
+      const file = match[1] || "unknown";
+      const errorCode = match[2] || "TS0000";
+      const key = `${file}:${errorCode}`;
+      if (!errorMap.has(key)) {
+        errorMap.set(key, []);
+      }
+      errorMap.get(key)?.push(line);
+    }
+  }
+  const summary = ["TypeScript Errors (grouped by file):"];
+  for (const [key, errors] of errorMap.entries()) {
+    summary.push(`  ${key} (${errors.length} errors)`);
+    summary.push(`    ${errors[0]}`);
+  }
+  return summary.join("\n");
+}
+function compressToolResult(input) {
+  const tokens = estimateTokens(input);
+  if (tokens < COMPRESSION_THRESHOLD) {
+    return input;
+  }
+  if (TOOL_PATTERNS.fileRead.test(input)) {
+    const match = input.match(TOOL_PATTERNS.fileRead);
+    if (match?.[2]) {
+      const content = match[2];
+      const compressed = compressFileRead(content);
+      return input.replace(content, compressed);
+    }
+  }
+  if (TOOL_PATTERNS.grepResult.test(input)) {
+    const match = input.match(TOOL_PATTERNS.grepResult);
+    if (match?.[2]) {
+      const matches = match[2];
+      const compressed = compressGrepResults(matches);
+      return input.replace(matches, compressed);
+    }
+  }
+  if (TOOL_PATTERNS.gitDiff.test(input)) {
+    return compressGitDiff(input);
+  }
+  if (TOOL_PATTERNS.buildOutput.test(input)) {
+    return compressBuildOutput(input);
+  }
+  if (TOOL_PATTERNS.npmInstall.test(input)) {
+    return compressNpmInstall(input);
+  }
+  if (TOOL_PATTERNS.dockerLogs.test(input)) {
+    return compressDockerLogs(input);
+  }
+  if (TOOL_PATTERNS.testResults.test(input)) {
+    return compressTestResults(input);
+  }
+  if (TOOL_PATTERNS.typescriptErrors.test(input)) {
+    return compressTypescriptErrors(input);
+  }
+  const lines = input.split("\n");
+  if (lines.length > 200) {
+    return compressFileRead(input, 100);
+  }
+  return input;
+}
+async function main() {
+  try {
+    const chunks = [];
+    for await (const chunk of process.stdin) {
+      chunks.push(chunk);
+    }
+    const input = Buffer.concat(chunks).toString("utf-8");
+    const output = compressToolResult(input);
+    exitSuccess(output);
+  } catch (_error) {
+    const chunks = [];
+    for await (const chunk of process.stdin) {
+      chunks.push(chunk);
+    }
+    const input = Buffer.concat(chunks).toString("utf-8");
+    exitSuccess(input);
+  }
+}
+main();
+//# sourceMappingURL=post-tool-result.js.map

package/dist/hooks/post-tool-result.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/utils/tokenizer.ts","../../src/hooks/post-tool-result.ts"],"sourcesContent":["/**\n * Token estimation utilities.\n * Uses whitespace heuristic (~90% accuracy vs GPT tokenizer).\n */\n\n/**\n * Estimate token count for text using heuristic.\n *\n * Approximation: 1 token ≈ 4 chars or 0.75 words\n * Provides ~90% accuracy compared to GPT tokenizer, sufficient for optimization heuristics.\n *\n * @param text - Text to count\n * @returns Estimated token count\n *\n * @example\n * ```typescript\n * const tokens = estimateTokens('Hello world');\n * console.log(tokens); // ~2\n * ```\n */\nexport function estimateTokens(text: string): number {\n  if (!text || text.length === 0) {\n    return 0;\n  }\n\n  // Split on whitespace to get words\n  const words = text.split(/\\s+/).filter((w) => w.length > 0);\n  const wordCount = words.length;\n\n  // Character-based estimate\n  const charCount = text.length;\n  const charEstimate = Math.ceil(charCount / 4);\n\n  // Word-based estimate\n  const wordEstimate = Math.ceil(wordCount * 0.75);\n\n  // Return the maximum of both estimates (more conservative)\n  return Math.max(wordEstimate, charEstimate);\n}\n","#!/usr/bin/env node\n/**\n * Post-Tool-Result Hook - Claude Code hook for compressing verbose tool output\n *\n * Compresses large tool results using type-specific strategies:\n * - File reads: Truncate long files, show first/last N lines\n * - Grep results: Group by file, show match count + samples\n * - Git diffs: Summarize file changes, show stats\n * - Build output: Extract errors/warnings only\n *\n * CRITICAL: Always exits 0 (never disrupts Claude Code).\n * Falls through unmodified on error or if already small.\n */\n\nimport { estimateTokens } from '../utils/tokenizer.js';\n\n// Exit 0 wrapper for all errors\nfunction exitSuccess(output: string): void {\n  process.stdout.write(output);\n  process.exit(0);\n}\n\n// Compression threshold (only compress if over this many tokens)\nconst COMPRESSION_THRESHOLD = 5000;\n\n// Tool result patterns\nconst TOOL_PATTERNS = {\n  fileRead: /<file_path>(.*?)<\\/file_path>[\\s\\S]*?<content>([\\s\\S]*?)<\\/content>/,\n  grepResult: /<pattern>(.*?)<\\/pattern>[\\s\\S]*?<matches>([\\s\\S]*?)<\\/matches>/,\n  gitDiff: /^diff --git/m,\n  buildOutput: /(error|warning|failed|failure)/i,\n  npmInstall: /^(npm|pnpm|yarn) (install|add|i)/m,\n  dockerLogs: /^\\[?\\d{4}-\\d{2}-\\d{2}/m,\n  testResults: /(PASS|FAIL|SKIP).*?\\.test\\./i,\n  typescriptErrors: /^.*\\(\\d+,\\d+\\): error TS\\d+:/m,\n  webpackBuild: /webpack \\d+\\.\\d+\\.\\d+/i,\n};\n\n/**\n * Compress file read results\n */\nfunction compressFileRead(content: string, maxLines = 100): string {\n  const lines = content.split('\\n');\n\n  if (lines.length <= maxLines * 2) {\n    return content; // Already small enough\n  }\n\n  const head = lines.slice(0, maxLines);\n  const tail = lines.slice(-maxLines);\n  const omitted = lines.length - maxLines * 2;\n\n  return [...head, '', `... [${omitted} lines omitted] ...`, '', ...tail].join('\\n');\n}\n\n/**\n * Compress grep results\n */\nfunction compressGrepResults(content: string, maxMatchesPerFile = 5): string {\n  const lines = content.split('\\n');\n  const fileMatches = new Map<string, string[]>();\n\n  // Group matches by file\n  for (const line of lines) {\n    const match = line.match(/^(.*?):(\\d+):(.*)/);\n    if (match?.[1] && match[2] && match[3]) {\n      const file = match[1];\n      const lineNum = match[2];\n      const text = match[3];\n      if (!fileMatches.has(file)) {\n        fileMatches.set(file, []);\n      }\n      fileMatches.get(file)?.push(`  Line ${lineNum}: ${text.trim()}`);\n    }\n  }\n\n  // Build compressed output\n  const compressed: string[] = [];\n\n  for (const [file, matches] of fileMatches.entries()) {\n    compressed.push(`${file} (${matches.length} matches):`);\n\n    if (matches.length <= maxMatchesPerFile) {\n      compressed.push(...matches);\n    } else {\n      compressed.push(...matches.slice(0, maxMatchesPerFile));\n      compressed.push(`  ... and ${matches.length - maxMatchesPerFile} more matches`);\n    }\n\n    compressed.push('');\n  }\n\n  return compressed.join('\\n');\n}\n\n/**\n * Compress git diff results\n */\nfunction compressGitDiff(content: string): string {\n  const lines = content.split('\\n');\n  const files = new Map<string, { added: number; removed: number }>();\n  let currentFile = '';\n\n  for (const line of lines) {\n    if (line.startsWith('diff --git')) {\n      const match = line.match(/diff --git a\\/(.*?) b\\/(.*)/);\n      if (match) {\n        currentFile = match[2] || '';\n        files.set(currentFile, { added: 0, removed: 0 });\n      }\n    } else if (line.startsWith('+') && !line.startsWith('+++')) {\n      const stats = files.get(currentFile);\n      if (stats) stats.added++;\n    } else if (line.startsWith('-') && !line.startsWith('---')) {\n      const stats = files.get(currentFile);\n      if (stats) stats.removed++;\n    }\n  }\n\n  // Build summary\n  const summary: string[] = ['Git diff summary:'];\n\n  for (const [file, stats] of files.entries()) {\n    summary.push(`  ${file}: +${stats.added} -${stats.removed}`);\n  }\n\n  return summary.join('\\n');\n}\n\n/**\n * Compress build output (extract errors/warnings only)\n */\nfunction compressBuildOutput(content: string): string {\n  const lines = content.split('\\n');\n  const important: string[] = [];\n\n  for (const line of lines) {\n    if (/(error|warning|failed|failure|fatal)/i.test(line)) {\n      important.push(line);\n    }\n  }\n\n  if (important.length === 0) {\n    return 'Build output: No errors or warnings found';\n  }\n\n  return ['Build errors/warnings:', ...important].join('\\n');\n}\n\n/**\n * Compress npm/pnpm install output\n */\nfunction compressNpmInstall(content: string): string {\n  const lines = content.split('\\n');\n  const summary: string[] = [];\n\n  // Extract package count and warnings/errors\n  const warnings: string[] = [];\n  const errors: string[] = [];\n\n  for (const line of lines) {\n    if (/added \\d+ packages?/i.test(line)) {\n      summary.push(line.trim());\n    }\n    if (/warn/i.test(line)) {\n      warnings.push(line.trim());\n    }\n    if (/error/i.test(line)) {\n      errors.push(line.trim());\n    }\n  }\n\n  if (errors.length > 0) {\n    return ['Package installation errors:', ...errors.slice(0, 5)].join('\\n');\n  }\n\n  if (warnings.length > 0) {\n    return [\n      'Package installation completed with warnings:',\n      ...warnings.slice(0, 3),\n      warnings.length > 3 ? `... and ${warnings.length - 3} more warnings` : '',\n    ]\n      .filter(Boolean)\n      .join('\\n');\n  }\n\n  return summary.length > 0 ? summary.join('\\n') : 'Package installation completed successfully';\n}\n\n/**\n * Compress Docker logs\n */\nfunction compressDockerLogs(content: string): string {\n  const lines = content.split('\\n');\n  const logMap = new Map<string, number>();\n\n  // Deduplicate and count repeated lines\n  for (const line of lines) {\n    // Strip timestamps for deduplication\n    const normalized = line.replace(/^\\[?\\d{4}-\\d{2}-\\d{2}.*?\\]\\s*/, '').trim();\n    if (normalized) {\n      logMap.set(normalized, (logMap.get(normalized) || 0) + 1);\n    }\n  }\n\n  const summary: string[] = ['Docker logs (deduplicated):'];\n\n  for (const [log, count] of Array.from(logMap.entries()).slice(0, 20)) {\n    if (count > 1) {\n      summary.push(`  [${count}x] ${log}`);\n    } else {\n      summary.push(`  ${log}`);\n    }\n  }\n\n  if (logMap.size > 20) {\n    summary.push(`  ... and ${logMap.size - 20} more unique log lines`);\n  }\n\n  return summary.join('\\n');\n}\n\n/**\n * Compress test results\n */\nfunction compressTestResults(content: string): string {\n  const lines = content.split('\\n');\n  let passed = 0;\n  let failed = 0;\n  let skipped = 0;\n  const failures: string[] = [];\n\n  for (const line of lines) {\n    if (/PASS/i.test(line)) passed++;\n    if (/FAIL/i.test(line)) {\n      failed++;\n      failures.push(line.trim());\n    }\n    if (/SKIP/i.test(line)) skipped++;\n  }\n\n  const summary = [`Test Results: ${passed} passed, ${failed} failed, ${skipped} skipped`];\n\n  if (failures.length > 0) {\n    summary.push('', 'Failed tests:');\n    summary.push(...failures.slice(0, 10));\n    if (failures.length > 10) {\n      summary.push(`... and ${failures.length - 10} more failures`);\n    }\n  }\n\n  return summary.join('\\n');\n}\n\n/**\n * Compress TypeScript errors\n */\nfunction compressTypescriptErrors(content: string): string {\n  const lines = content.split('\\n');\n  const errorMap = new Map<string, string[]>();\n\n  for (const line of lines) {\n    const match = line.match(/^(.*?)\\(\\d+,\\d+\\): error (TS\\d+):/);\n    if (match) {\n      const file = match[1] || 'unknown';\n      const errorCode = match[2] || 'TS0000';\n      const key = `${file}:${errorCode}`;\n\n      if (!errorMap.has(key)) {\n        errorMap.set(key, []);\n      }\n      errorMap.get(key)?.push(line);\n    }\n  }\n\n  const summary = ['TypeScript Errors (grouped by file):'];\n\n  for (const [key, errors] of errorMap.entries()) {\n    summary.push(`  ${key} (${errors.length} errors)`);\n    summary.push(`    ${errors[0]}`);\n  }\n\n  return summary.join('\\n');\n}\n\n/**\n * Main compression logic\n */\nfunction compressToolResult(input: string): string {\n  const tokens = estimateTokens(input);\n\n  // Only compress if over threshold\n  if (tokens < COMPRESSION_THRESHOLD) {\n    return input;\n  }\n\n  // Detect tool result type and compress accordingly\n  if (TOOL_PATTERNS.fileRead.test(input)) {\n    const match = input.match(TOOL_PATTERNS.fileRead);\n    if (match?.[2]) {\n      const content = match[2];\n      const compressed = compressFileRead(content);\n      return input.replace(content, compressed);\n    }\n  }\n\n  if (TOOL_PATTERNS.grepResult.test(input)) {\n    const match = input.match(TOOL_PATTERNS.grepResult);\n    if (match?.[2]) {\n      const matches = match[2];\n      const compressed = compressGrepResults(matches);\n      return input.replace(matches, compressed);\n    }\n  }\n\n  if (TOOL_PATTERNS.gitDiff.test(input)) {\n    return compressGitDiff(input);\n  }\n\n  if (TOOL_PATTERNS.buildOutput.test(input)) {\n    return compressBuildOutput(input);\n  }\n\n  if (TOOL_PATTERNS.npmInstall.test(input)) {\n    return compressNpmInstall(input);\n  }\n\n  if (TOOL_PATTERNS.dockerLogs.test(input)) {\n    return compressDockerLogs(input);\n  }\n\n  if (TOOL_PATTERNS.testResults.test(input)) {\n    return compressTestResults(input);\n  }\n\n  if (TOOL_PATTERNS.typescriptErrors.test(input)) {\n    return compressTypescriptErrors(input);\n  }\n\n  // Unknown type or no compression pattern matched\n  // Apply generic truncation as fallback\n  const lines = input.split('\\n');\n  if (lines.length > 200) {\n    return compressFileRead(input, 100);\n  }\n\n  return input;\n}\n\n// Main hook logic\nasync function main(): Promise<void> {\n  try {\n    // Read stdin (tool result)\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n\n    // Compress if needed\n    const output = compressToolResult(input);\n\n    exitSuccess(output);\n  } catch (_error) {\n    // On any error, pass through original input\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n    exitSuccess(input);\n  }\n}\n\n// Run hook\nmain();\n"],"mappings":";;;AAoBO,SAAS,eAAe,MAAsB;AACnD,MAAI,CAAC,QAAQ,KAAK,WAAW,GAAG;AAC9B,WAAO;AAAA,EACT;AAGA,QAAM,QAAQ,KAAK,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC1D,QAAM,YAAY,MAAM;AAGxB,QAAM,YAAY,KAAK;AACvB,QAAM,eAAe,KAAK,KAAK,YAAY,CAAC;AAG5C,QAAM,eAAe,KAAK,KAAK,YAAY,IAAI;AAG/C,SAAO,KAAK,IAAI,cAAc,YAAY;AAC5C;;;ACrBA,SAAS,YAAY,QAAsB;AACzC,UAAQ,OAAO,MAAM,MAAM;AAC3B,UAAQ,KAAK,CAAC;AAChB;AAGA,IAAM,wBAAwB;AAG9B,IAAM,gBAAgB;AAAA,EACpB,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,SAAS;AAAA,EACT,aAAa;AAAA,EACb,YAAY;AAAA,EACZ,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,cAAc;AAChB;AAKA,SAAS,iBAAiB,SAAiB,WAAW,KAAa;AACjE,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAEhC,MAAI,MAAM,UAAU,WAAW,GAAG;AAChC,WAAO;AAAA,EACT;AAEA,QAAM,OAAO,MAAM,MAAM,GAAG,QAAQ;AACpC,QAAM,OAAO,MAAM,MAAM,CAAC,QAAQ;AAClC,QAAM,UAAU,MAAM,SAAS,WAAW;AAE1C,SAAO,CAAC,GAAG,MAAM,IAAI,QAAQ,OAAO,uBAAuB,IAAI,GAAG,IAAI,EAAE,KAAK,IAAI;AACnF;AAKA,SAAS,oBAAoB,SAAiB,oBAAoB,GAAW;AAC3E,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,cAAc,oBAAI,IAAsB;AAG9C,aAAW,QAAQ,OAAO;AACxB,UAAM,QAAQ,KAAK,MAAM,mBAAmB;AAC5C,QAAI,QAAQ,CAAC,KAAK,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG;AACtC,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,UAAU,MAAM,CAAC;AACvB,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,CAAC,YAAY,IAAI,IAAI,GAAG;AAC1B,oBAAY,IAAI,MAAM,CAAC,CAAC;AAAA,MAC1B;AACA,kBAAY,IAAI,IAAI,GAAG,KAAK,UAAU,OAAO,KAAK,KAAK,KAAK,CAAC,EAAE;AAAA,IACjE;AAAA,EACF;AAGA,QAAM,aAAuB,CAAC;AAE9B,aAAW,CAAC,MAAM,OAAO,KAAK,YAAY,QAAQ,GAAG;AACnD,eAAW,KAAK,GAAG,IAAI,KAAK,QAAQ,MAAM,YAAY;AAEtD,QAAI,QAAQ,UAAU,mBAAmB;AACvC,iBAAW,KAAK,GAAG,OAAO;AAAA,IAC5B,OAAO;AACL,iBAAW,KAAK,GAAG,QAAQ,MAAM,GAAG,iBAAiB,CAAC;AACtD,iBAAW,KAAK,aAAa,QAAQ,SAAS,iBAAiB,eAAe;AAAA,IAChF;AAEA,eAAW,KAAK,EAAE;AAAA,EACpB;AAEA,SAAO,WAAW,KAAK,IAAI;AAC7B;AAKA,SAAS,gBAAgB,SAAyB;AAChD,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,QAAQ,oBAAI,IAAgD;AAClE,MAAI,cAAc;AAElB,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,WAAW,YAAY,GAAG;AACjC,YAAM,QAAQ,KAAK,MAAM,6BAA6B;AACtD,UAAI,OAAO;AACT,sBAAc,MAAM,CAAC,KAAK;AAC1B,cAAM,IAAI,aAAa,EAAE,OAAO,GAAG,SAAS,EAAE,CAAC;AAAA,MACjD;AAAA,IACF,WAAW,KAAK,WAAW,GAAG,KAAK,CAAC,KAAK,WAAW,KAAK,GAAG;AAC1D,YAAM,QAAQ,MAAM,IAAI,WAAW;AACnC,UAAI,MAAO,OAAM;AAAA,IACnB,WAAW,KAAK,WAAW,GAAG,KAAK,CAAC,KAAK,WAAW,KAAK,GAAG;AAC1D,YAAM,QAAQ,MAAM,IAAI,WAAW;AACnC,UAAI,MAAO,OAAM;AAAA,IACnB;AAAA,EACF;AAGA,QAAM,UAAoB,CAAC,mBAAmB;AAE9C,aAAW,CAAC,MAAM,KAAK,KAAK,MAAM,QAAQ,GAAG;AAC3C,YAAQ,KAAK,KAAK,IAAI,MAAM,MAAM,KAAK,KAAK,MAAM,OAAO,EAAE;AAAA,EAC7D;AAEA,SAAO,QAAQ,KAAK,IAAI;AAC1B;AAKA,SAAS,oBAAoB,SAAyB;AACpD,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,YAAsB,CAAC;AAE7B,aAAW,QAAQ,OAAO;AACxB,QAAI,wCAAwC,KAAK,IAAI,GAAG;AACtD,gBAAU,KAAK,IAAI;AAAA,IACrB;AAAA,EACF;AAEA,MAAI,UAAU,WAAW,GAAG;AAC1B,WAAO;AAAA,EACT;AAEA,SAAO,CAAC,0BAA0B,GAAG,SAAS,EAAE,KAAK,IAAI;AAC3D;AAKA,SAAS,mBAAmB,SAAyB;AACnD,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,UAAoB,CAAC;AAG3B,QAAM,WAAqB,CAAC;AAC5B,QAAM,SAAmB,CAAC;AAE1B,aAAW,QAAQ,OAAO;AACxB,QAAI,uBAAuB,KAAK,IAAI,GAAG;AACrC,cAAQ,KAAK,KAAK,KAAK,CAAC;AAAA,IAC1B;AACA,QAAI,QAAQ,KAAK,IAAI,GAAG;AACtB,eAAS,KAAK,KAAK,KAAK,CAAC;AAAA,IAC3B;AACA,QAAI,SAAS,KAAK,IAAI,GAAG;AACvB,aAAO,KAAK,KAAK,KAAK,CAAC;AAAA,IACzB;AAAA,EACF;AAEA,MAAI,OAAO,SAAS,GAAG;AACrB,WAAO,CAAC,gCAAgC,GAAG,OAAO,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,EAC1E;AAEA,MAAI,SAAS,SAAS,GAAG;AACvB,WAAO;AAAA,MACL;AAAA,MACA,GAAG,SAAS,MAAM,GAAG,CAAC;AAAA,MACtB,SAAS,SAAS,IAAI,WAAW,SAAS,SAAS,CAAC,mBAAmB;AAAA,IACzE,EACG,OAAO,OAAO,EACd,KAAK,IAAI;AAAA,EACd;AAEA,SAAO,QAAQ,SAAS,IAAI,QAAQ,KAAK,IAAI,IAAI;AACnD;AAKA,SAAS,mBAAmB,SAAyB;AACnD,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,SAAS,oBAAI,IAAoB;AAGvC,aAAW,QAAQ,OAAO;AAExB,UAAM,aAAa,KAAK,QAAQ,iCAAiC,EAAE,EAAE,KAAK;AAC1E,QAAI,YAAY;AACd,aAAO,IAAI,aAAa,OAAO,IAAI,UAAU,KAAK,KAAK,CAAC;AAAA,IAC1D;AAAA,EACF;AAEA,QAAM,UAAoB,CAAC,6BAA6B;AAExD,aAAW,CAAC,KAAK,KAAK,KAAK,MAAM,KAAK,OAAO,QAAQ,CAAC,EAAE,MAAM,GAAG,EAAE,GAAG;AACpE,QAAI,QAAQ,GAAG;AACb,cAAQ,KAAK,MAAM,KAAK,MAAM,GAAG,EAAE;AAAA,IACrC,OAAO;AACL,cAAQ,KAAK,KAAK,GAAG,EAAE;AAAA,IACzB;AAAA,EACF;AAEA,MAAI,OAAO,OAAO,IAAI;AACpB,YAAQ,KAAK,aAAa,OAAO,OAAO,EAAE,wBAAwB;AAAA,EACpE;AAEA,SAAO,QAAQ,KAAK,IAAI;AAC1B;AAKA,SAAS,oBAAoB,SAAyB;AACpD,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,UAAU;AACd,QAAM,WAAqB,CAAC;AAE5B,aAAW,QAAQ,OAAO;AACxB,QAAI,QAAQ,KAAK,IAAI,EAAG;AACxB,QAAI,QAAQ,KAAK,IAAI,GAAG;AACtB;AACA,eAAS,KAAK,KAAK,KAAK,CAAC;AAAA,IAC3B;AACA,QAAI,QAAQ,KAAK,IAAI,EAAG;AAAA,EAC1B;AAEA,QAAM,UAAU,CAAC,iBAAiB,MAAM,YAAY,MAAM,YAAY,OAAO,UAAU;AAEvF,MAAI,SAAS,SAAS,GAAG;AACvB,YAAQ,KAAK,IAAI,eAAe;AAChC,YAAQ,KAAK,GAAG,SAAS,MAAM,GAAG,EAAE,CAAC;AACrC,QAAI,SAAS,SAAS,IAAI;AACxB,cAAQ,KAAK,WAAW,SAAS,SAAS,EAAE,gBAAgB;AAAA,IAC9D;AAAA,EACF;AAEA,SAAO,QAAQ,KAAK,IAAI;AAC1B;AAKA,SAAS,yBAAyB,SAAyB;AACzD,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,WAAW,oBAAI,IAAsB;AAE3C,aAAW,QAAQ,OAAO;AACxB,UAAM,QAAQ,KAAK,MAAM,mCAAmC;AAC5D,QAAI,OAAO;AACT,YAAM,OAAO,MAAM,CAAC,KAAK;AACzB,YAAM,YAAY,MAAM,CAAC,KAAK;AAC9B,YAAM,MAAM,GAAG,IAAI,IAAI,SAAS;AAEhC,UAAI,CAAC,SAAS,IAAI,GAAG,GAAG;AACtB,iBAAS,IAAI,KAAK,CAAC,CAAC;AAAA,MACtB;AACA,eAAS,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,IAC9B;AAAA,EACF;AAEA,QAAM,UAAU,CAAC,sCAAsC;AAEvD,aAAW,CAAC,KAAK,MAAM,KAAK,SAAS,QAAQ,GAAG;AAC9C,YAAQ,KAAK,KAAK,GAAG,KAAK,OAAO,MAAM,UAAU;AACjD,YAAQ,KAAK,OAAO,OAAO,CAAC,CAAC,EAAE;AAAA,EACjC;AAEA,SAAO,QAAQ,KAAK,IAAI;AAC1B;AAKA,SAAS,mBAAmB,OAAuB;AACjD,QAAM,SAAS,eAAe,KAAK;AAGnC,MAAI,SAAS,uBAAuB;AAClC,WAAO;AAAA,EACT;AAGA,MAAI,cAAc,SAAS,KAAK,KAAK,GAAG;AACtC,UAAM,QAAQ,MAAM,MAAM,cAAc,QAAQ;AAChD,QAAI,QAAQ,CAAC,GAAG;AACd,YAAM,UAAU,MAAM,CAAC;AACvB,YAAM,aAAa,iBAAiB,OAAO;AAC3C,aAAO,MAAM,QAAQ,SAAS,UAAU;AAAA,IAC1C;AAAA,EACF;AAEA,MAAI,cAAc,WAAW,KAAK,KAAK,GAAG;AACxC,UAAM,QAAQ,MAAM,MAAM,cAAc,UAAU;AAClD,QAAI,QAAQ,CAAC,GAAG;AACd,YAAM,UAAU,MAAM,CAAC;AACvB,YAAM,aAAa,oBAAoB,OAAO;AAC9C,aAAO,MAAM,QAAQ,SAAS,UAAU;AAAA,IAC1C;AAAA,EACF;AAEA,MAAI,cAAc,QAAQ,KAAK,KAAK,GAAG;AACrC,WAAO,gBAAgB,KAAK;AAAA,EAC9B;AAEA,MAAI,cAAc,YAAY,KAAK,KAAK,GAAG;AACzC,WAAO,oBAAoB,KAAK;AAAA,EAClC;AAEA,MAAI,cAAc,WAAW,KAAK,KAAK,GAAG;AACxC,WAAO,mBAAmB,KAAK;AAAA,EACjC;AAEA,MAAI,cAAc,WAAW,KAAK,KAAK,GAAG;AACxC,WAAO,mBAAmB,KAAK;AAAA,EACjC;AAEA,MAAI,cAAc,YAAY,KAAK,KAAK,GAAG;AACzC,WAAO,oBAAoB,KAAK;AAAA,EAClC;AAEA,MAAI,cAAc,iBAAiB,KAAK,KAAK,GAAG;AAC9C,WAAO,yBAAyB,KAAK;AAAA,EACvC;AAIA,QAAM,QAAQ,MAAM,MAAM,IAAI;AAC9B,MAAI,MAAM,SAAS,KAAK;AACtB,WAAO,iBAAiB,OAAO,GAAG;AAAA,EACpC;AAEA,SAAO;AACT;AAGA,eAAe,OAAsB;AACnC,MAAI;AAEF,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AAGpD,UAAM,SAAS,mBAAmB,KAAK;AAEvC,gBAAY,MAAM;AAAA,EACpB,SAAS,QAAQ;AAEf,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AACpD,gBAAY,KAAK;AAAA,EACnB;AACF;AAGA,KAAK;","names":[]}

package/dist/hooks/pre-prompt.cjs

@@ -0,0 +1,287 @@
+#!/usr/bin/env node
+"use strict";
+
+// src/hooks/pre-prompt.ts
+var import_node_fs = require("fs");
+var import_node_os = require("os");
+var import_node_path = require("path");
+var import_js_yaml = require("js-yaml");
+
+// src/utils/tokenizer.ts
+function estimateTokens(text) {
+  if (!text || text.length === 0) {
+    return 0;
+  }
+  const words = text.split(/\s+/).filter((w) => w.length > 0);
+  const wordCount = words.length;
+  const charCount = text.length;
+  const charEstimate = Math.ceil(charCount / 4);
+  const wordEstimate = Math.ceil(wordCount * 0.75);
+  return Math.max(wordEstimate, charEstimate);
+}
+
+// src/core/engram-scorer.ts
+function createEngramScorer(config) {
+  const { defaultTTL } = config;
+  function calculateDecay(ageInSeconds, ttlInSeconds) {
+    if (ttlInSeconds === 0) return 1;
+    if (ageInSeconds <= 0) return 0;
+    const ratio = ageInSeconds / ttlInSeconds;
+    const decay = 1 - Math.exp(-ratio);
+    return Math.max(0, Math.min(1, decay));
+  }
+  function calculateScore(entry, currentTime = Date.now()) {
+    const ageInMilliseconds = currentTime - entry.timestamp;
+    const ageInSeconds = Math.max(0, ageInMilliseconds / 1e3);
+    const decay = calculateDecay(ageInSeconds, entry.ttl);
+    let score = entry.score * (1 - decay);
+    if (entry.accessCount > 0) {
+      const accessBonus = Math.log(entry.accessCount + 1) * 0.1;
+      score = Math.min(1, score + accessBonus);
+    }
+    if (entry.isBTSP) {
+      score = Math.max(score, 0.9);
+    }
+    return Math.max(0, Math.min(1, score));
+  }
+  function refreshTTL(entry) {
+    return {
+      ...entry,
+      ttl: defaultTTL * 3600,
+      // Convert hours to seconds
+      timestamp: Date.now()
+    };
+  }
+  return {
+    calculateScore,
+    refreshTTL,
+    calculateDecay
+  };
+}
+
+// src/core/budget-pruner.ts
+function createBudgetPruner(config) {
+  const { tokenBudget, decay } = config;
+  const engramScorer = createEngramScorer(decay);
+  function tokenize(text) {
+    return text.toLowerCase().split(/\s+/).filter((word) => word.length > 0);
+  }
+  function calculateTF(term, tokens) {
+    const count = tokens.filter((t) => t === term).length;
+    return Math.sqrt(count);
+  }
+  function calculateIDF(term, allEntries) {
+    const totalDocs = allEntries.length;
+    const docsWithTerm = allEntries.filter((entry) => {
+      const tokens = tokenize(entry.content);
+      return tokens.includes(term);
+    }).length;
+    if (docsWithTerm === 0) return 0;
+    return Math.log(totalDocs / docsWithTerm);
+  }
+  function calculateTFIDF(entry, allEntries) {
+    const tokens = tokenize(entry.content);
+    if (tokens.length === 0) return 0;
+    const uniqueTerms = [...new Set(tokens)];
+    let totalScore = 0;
+    for (const term of uniqueTerms) {
+      const tf = calculateTF(term, tokens);
+      const idf = calculateIDF(term, allEntries);
+      totalScore += tf * idf;
+    }
+    return totalScore / tokens.length;
+  }
+  function getStateMultiplier(entry) {
+    if (entry.isBTSP) return 2;
+    switch (entry.state) {
+      case "active":
+        return 2;
+      case "ready":
+        return 1;
+      case "silent":
+        return 0.5;
+      default:
+        return 1;
+    }
+  }
+  function priorityScore(entry, allEntries) {
+    const tfidf = calculateTFIDF(entry, allEntries);
+    const currentScore = engramScorer.calculateScore(entry);
+    const engramDecay = 1 - currentScore;
+    const stateMultiplier = getStateMultiplier(entry);
+    return tfidf * (1 - engramDecay) * stateMultiplier;
+  }
+  function pruneToFit(entries, budget = tokenBudget) {
+    if (entries.length === 0) {
+      return {
+        kept: [],
+        removed: [],
+        originalTokens: 0,
+        prunedTokens: 0,
+        budgetUtilization: 0
+      };
+    }
+    const originalTokens = entries.reduce((sum, e) => sum + estimateTokens(e.content), 0);
+    const btspEntries = entries.filter((e) => e.isBTSP);
+    const regularEntries = entries.filter((e) => !e.isBTSP);
+    const btspTokens = btspEntries.reduce((sum, e) => sum + estimateTokens(e.content), 0);
+    const scored = regularEntries.map((entry) => ({
+      entry,
+      score: priorityScore(entry, entries),
+      tokens: estimateTokens(entry.content)
+    }));
+    scored.sort((a, b) => b.score - a.score);
+    const kept = [...btspEntries];
+    const removed = [];
+    let currentTokens = btspTokens;
+    for (const item of scored) {
+      if (currentTokens + item.tokens <= budget) {
+        kept.push(item.entry);
+        currentTokens += item.tokens;
+      } else {
+        removed.push(item.entry);
+      }
+    }
+    const budgetUtilization = budget > 0 ? currentTokens / budget : 0;
+    return {
+      kept,
+      removed,
+      originalTokens,
+      prunedTokens: currentTokens,
+      budgetUtilization
+    };
+  }
+  return {
+    pruneToFit,
+    priorityScore
+  };
+}
+function createBudgetPrunerFromConfig(realtimeConfig, decayConfig, statesConfig) {
+  return createBudgetPruner({
+    tokenBudget: realtimeConfig.tokenBudget,
+    decay: decayConfig,
+    states: statesConfig
+  });
+}
+
+// src/utils/context-parser.ts
+var import_node_crypto2 = require("crypto");
+
+// src/utils/hash.ts
+var import_node_crypto = require("crypto");
+function hashContent(content) {
+  return (0, import_node_crypto.createHash)("sha256").update(content, "utf8").digest("hex");
+}
+
+// src/utils/context-parser.ts
+function parseClaudeCodeContext(context) {
+  const entries = [];
+  const now = Date.now();
+  const lines = context.split("\n");
+  let currentBlock = [];
+  let blockType = "other";
+  for (const line of lines) {
+    const trimmed = line.trim();
+    if (trimmed.startsWith("User:") || trimmed.startsWith("Assistant:")) {
+      if (currentBlock.length > 0) {
+        entries.push(createEntry(currentBlock.join("\n"), blockType, now));
+        currentBlock = [];
+      }
+      blockType = "conversation";
+      currentBlock.push(line);
+    } else if (trimmed.includes("<function_calls>") || trimmed.includes("<invoke>") || trimmed.includes("<tool_use>")) {
+      if (currentBlock.length > 0) {
+        entries.push(createEntry(currentBlock.join("\n"), blockType, now));
+        currentBlock = [];
+      }
+      blockType = "tool";
+      currentBlock.push(line);
+    } else if (trimmed.includes("<function_results>") || trimmed.includes("</function_results>")) {
+      if (currentBlock.length > 0 && blockType !== "result") {
+        entries.push(createEntry(currentBlock.join("\n"), blockType, now));
+        currentBlock = [];
+      }
+      blockType = "result";
+      currentBlock.push(line);
+    } else if (currentBlock.length > 0) {
+      currentBlock.push(line);
+    } else if (trimmed.length > 0) {
+      currentBlock.push(line);
+      blockType = "other";
+    }
+  }
+  if (currentBlock.length > 0) {
+    entries.push(createEntry(currentBlock.join("\n"), blockType, now));
+  }
+  return entries.filter((e) => e.content.trim().length > 0);
+}
+function createEntry(content, type, baseTime) {
+  const tags = [type];
+  let initialScore = 0.5;
+  if (type === "conversation") initialScore = 0.8;
+  if (type === "tool") initialScore = 0.7;
+  if (type === "result") initialScore = 0.4;
+  return {
+    id: (0, import_node_crypto2.randomUUID)(),
+    content,
+    hash: hashContent(content),
+    timestamp: baseTime,
+    score: initialScore,
+    state: initialScore > 0.7 ? "active" : initialScore > 0.3 ? "ready" : "silent",
+    ttl: 24 * 3600,
+    // 24 hours default
+    accessCount: 0,
+    tags,
+    metadata: { type },
+    isBTSP: false
+  };
+}
+
+// src/hooks/pre-prompt.ts
+function exitSuccess(output) {
+  process.stdout.write(output);
+  process.exit(0);
+}
+async function main() {
+  try {
+    const chunks = [];
+    for await (const chunk of process.stdin) {
+      chunks.push(chunk);
+    }
+    const input = Buffer.concat(chunks).toString("utf-8");
+    const tokens = estimateTokens(input);
+    const configPath = (0, import_node_path.join)((0, import_node_os.homedir)(), ".sparn", "config.yaml");
+    let config;
+    try {
+      const configYAML = (0, import_node_fs.readFileSync)(configPath, "utf-8");
+      config = (0, import_js_yaml.load)(configYAML);
+    } catch {
+      exitSuccess(input);
+      return;
+    }
+    const { autoOptimizeThreshold, tokenBudget } = config.realtime;
+    if (tokens < autoOptimizeThreshold) {
+      exitSuccess(input);
+      return;
+    }
+    const entries = parseClaudeCodeContext(input);
+    if (entries.length === 0) {
+      exitSuccess(input);
+      return;
+    }
+    const pruner = createBudgetPrunerFromConfig(config.realtime, config.decay, config.states);
+    const result = pruner.pruneToFit(entries, tokenBudget);
+    const sorted = [...result.kept].sort((a, b) => a.timestamp - b.timestamp);
+    const optimizedContext = sorted.map((e) => e.content).join("\n\n");
+    exitSuccess(optimizedContext);
+  } catch (_error) {
+    const chunks = [];
+    for await (const chunk of process.stdin) {
+      chunks.push(chunk);
+    }
+    const input = Buffer.concat(chunks).toString("utf-8");
+    exitSuccess(input);
+  }
+}
+main();
+//# sourceMappingURL=pre-prompt.cjs.map

package/dist/hooks/pre-prompt.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/hooks/pre-prompt.ts","../../src/utils/tokenizer.ts","../../src/core/engram-scorer.ts","../../src/core/budget-pruner.ts","../../src/utils/context-parser.ts","../../src/utils/hash.ts"],"sourcesContent":["#!/usr/bin/env node\n/**\n * Pre-Prompt Hook - Claude Code hook for real-time context optimization\n *\n * Reads context from stdin, checks if tokens exceed threshold,\n * optimizes if needed, writes to stdout.\n *\n * CRITICAL: Always exits 0 (never disrupts Claude Code).\n * Falls through unmodified if under threshold or on error.\n */\n\nimport { readFileSync } from 'node:fs';\nimport { homedir } from 'node:os';\nimport { join } from 'node:path';\nimport { load as parseYAML } from 'js-yaml';\nimport { createBudgetPrunerFromConfig } from '../core/budget-pruner.js';\nimport type { SparnConfig } from '../types/config.js';\nimport { parseClaudeCodeContext } from '../utils/context-parser.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\n\n// Exit 0 wrapper for all errors\nfunction exitSuccess(output: string): void {\n  process.stdout.write(output);\n  process.exit(0);\n}\n\n// Main hook logic\nasync function main(): Promise<void> {\n  try {\n    // Read stdin (context)\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n\n    // Estimate tokens\n    const tokens = estimateTokens(input);\n\n    // Load config\n    const configPath = join(homedir(), '.sparn', 'config.yaml');\n    let config: SparnConfig;\n\n    try {\n      const configYAML = readFileSync(configPath, 'utf-8');\n      config = parseYAML(configYAML) as SparnConfig;\n    } catch {\n      // Config not found or invalid, fall through\n      exitSuccess(input);\n      return;\n    }\n\n    const { autoOptimizeThreshold, tokenBudget } = config.realtime;\n\n    // Check if optimization needed\n    if (tokens < autoOptimizeThreshold) {\n      // Under threshold, pass through unmodified\n      exitSuccess(input);\n      return;\n    }\n\n    // Parse context into entries\n    const entries = parseClaudeCodeContext(input);\n\n    if (entries.length === 0) {\n      // No entries to optimize, pass through\n      exitSuccess(input);\n      return;\n    }\n\n    // Create budget pruner\n    const pruner = createBudgetPrunerFromConfig(config.realtime, config.decay, config.states);\n\n    // Prune to fit budget\n    const result = pruner.pruneToFit(entries, tokenBudget);\n\n    // Build optimized context (chronologically ordered)\n    const sorted = [...result.kept].sort((a, b) => a.timestamp - b.timestamp);\n    const optimizedContext = sorted.map((e) => e.content).join('\\n\\n');\n\n    // Output optimized context\n    exitSuccess(optimizedContext);\n  } catch (_error) {\n    // On any error, pass through original input\n    // Read stdin again if needed (shouldn't happen, but safety fallback)\n    const chunks: Buffer[] = [];\n    for await (const chunk of process.stdin) {\n      chunks.push(chunk);\n    }\n    const input = Buffer.concat(chunks).toString('utf-8');\n    exitSuccess(input);\n  }\n}\n\n// Run hook\nmain();\n","/**\n * Token estimation utilities.\n * Uses whitespace heuristic (~90% accuracy vs GPT tokenizer).\n */\n\n/**\n * Estimate token count for text using heuristic.\n *\n * Approximation: 1 token ≈ 4 chars or 0.75 words\n * Provides ~90% accuracy compared to GPT tokenizer, sufficient for optimization heuristics.\n *\n * @param text - Text to count\n * @returns Estimated token count\n *\n * @example\n * ```typescript\n * const tokens = estimateTokens('Hello world');\n * console.log(tokens); // ~2\n * ```\n */\nexport function estimateTokens(text: string): number {\n  if (!text || text.length === 0) {\n    return 0;\n  }\n\n  // Split on whitespace to get words\n  const words = text.split(/\\s+/).filter((w) => w.length > 0);\n  const wordCount = words.length;\n\n  // Character-based estimate\n  const charCount = text.length;\n  const charEstimate = Math.ceil(charCount / 4);\n\n  // Word-based estimate\n  const wordEstimate = Math.ceil(wordCount * 0.75);\n\n  // Return the maximum of both estimates (more conservative)\n  return Math.max(wordEstimate, charEstimate);\n}\n","/**\n * Engram Scorer - Implements engram theory (memory decay)\n *\n * Neuroscience: Memories fade over time without reinforcement.\n * Application: Apply exponential decay formula to memory scores based on age and access count.\n *\n * Formula: decay = 1 - e^(-age/TTL)\n * Score adjustment: score_new = score_old * (1 - decay) + (accessCount bonus)\n */\n\nimport type { MemoryEntry } from '../types/memory.js';\n\nexport interface EngramScorerConfig {\n  /** Default TTL in hours for new entries */\n  defaultTTL: number;\n  /** Decay threshold (0.0-1.0) above which entries are marked for pruning */\n  decayThreshold: number;\n}\n\nexport interface EngramScorer {\n  /**\n   * Calculate current score for an entry based on decay and access count\n   * @param entry - Memory entry to score\n   * @param currentTime - Current timestamp in milliseconds (for testing)\n   * @returns Updated score (0.0-1.0)\n   */\n  calculateScore(entry: MemoryEntry, currentTime?: number): number;\n\n  /**\n   * Refresh TTL to default value\n   * @param entry - Entry to refresh\n   * @returns Entry with refreshed TTL and timestamp\n   */\n  refreshTTL(entry: MemoryEntry): MemoryEntry;\n\n  /**\n   * Calculate decay factor (0.0-1.0) based on age and TTL\n   * @param ageInSeconds - Age of entry in seconds\n   * @param ttlInSeconds - TTL in seconds\n   * @returns Decay factor (0.0 = fresh, 1.0 = fully decayed)\n   */\n  calculateDecay(ageInSeconds: number, ttlInSeconds: number): number;\n}\n\n/**\n * Create an engram scorer instance\n * @param config - Scorer configuration\n * @returns EngramScorer instance\n */\nexport function createEngramScorer(config: EngramScorerConfig): EngramScorer {\n  const { defaultTTL } = config;\n\n  function calculateDecay(ageInSeconds: number, ttlInSeconds: number): number {\n    if (ttlInSeconds === 0) return 1.0; // Instant decay\n    if (ageInSeconds <= 0) return 0.0; // Fresh entry\n\n    // Exponential decay: 1 - e^(-age/TTL)\n    const ratio = ageInSeconds / ttlInSeconds;\n    const decay = 1 - Math.exp(-ratio);\n\n    // Clamp to [0.0, 1.0]\n    return Math.max(0, Math.min(1, decay));\n  }\n\n  function calculateScore(entry: MemoryEntry, currentTime: number = Date.now()): number {\n    // Calculate age in seconds\n    const ageInMilliseconds = currentTime - entry.timestamp;\n    const ageInSeconds = Math.max(0, ageInMilliseconds / 1000);\n\n    // Calculate decay factor\n    const decay = calculateDecay(ageInSeconds, entry.ttl);\n\n    // Base score reduced by decay\n    let score = entry.score * (1 - decay);\n\n    // Access count bonus (diminishing returns via log)\n    if (entry.accessCount > 0) {\n      const accessBonus = Math.log(entry.accessCount + 1) * 0.1;\n      score = Math.min(1.0, score + accessBonus);\n    }\n\n    // BTSP entries maintain high score\n    if (entry.isBTSP) {\n      score = Math.max(score, 0.9);\n    }\n\n    return Math.max(0, Math.min(1, score));\n  }\n\n  function refreshTTL(entry: MemoryEntry): MemoryEntry {\n    return {\n      ...entry,\n      ttl: defaultTTL * 3600, // Convert hours to seconds\n      timestamp: Date.now(),\n    };\n  }\n\n  return {\n    calculateScore,\n    refreshTTL,\n    calculateDecay,\n  };\n}\n","/**\n * Budget-Aware Pruner - Token budget optimization\n *\n * Unlike SparsePruner which keeps top N% entries, BudgetPruner fits entries\n * within a target token budget using priority scoring that combines:\n * - TF-IDF relevance\n * - Engram decay\n * - Confidence state multipliers\n * - BTSP bypass (always included)\n *\n * Target use case: Real-time optimization for Opus model (~50K token budget)\n */\n\nimport type { RealtimeConfig } from '../types/config.js';\nimport type { MemoryEntry } from '../types/memory.js';\nimport type { PruneResult } from '../types/pruner.js';\nimport { estimateTokens } from '../utils/tokenizer.js';\nimport { createEngramScorer } from './engram-scorer.js';\n\nexport interface BudgetPrunerConfig {\n  /** Target token budget */\n  tokenBudget: number;\n  /** Decay configuration */\n  decay: {\n    defaultTTL: number;\n    decayThreshold: number;\n  };\n  /** State multipliers */\n  states: {\n    activeThreshold: number;\n    readyThreshold: number;\n  };\n}\n\nexport interface BudgetPruner {\n  /**\n   * Prune entries to fit within token budget\n   * @param entries - Memory entries to prune\n   * @param budget - Optional override budget (uses config default if not provided)\n   * @returns Result with kept/removed entries and budget utilization\n   */\n  pruneToFit(entries: MemoryEntry[], budget?: number): PruneResult & { budgetUtilization: number };\n\n  /**\n   * Calculate priority score for an entry\n   * @param entry - Entry to score\n   * @param allEntries - All entries for TF-IDF calculation\n   * @returns Priority score (higher = more important)\n   */\n  priorityScore(entry: MemoryEntry, allEntries: MemoryEntry[]): number;\n}\n\n/**\n * Create a budget-aware pruner instance\n * @param config - Pruner configuration\n * @returns BudgetPruner instance\n */\nexport function createBudgetPruner(config: BudgetPrunerConfig): BudgetPruner {\n  const { tokenBudget, decay } = config;\n  const engramScorer = createEngramScorer(decay);\n\n  function tokenize(text: string): string[] {\n    return text\n      .toLowerCase()\n      .split(/\\s+/)\n      .filter((word) => word.length > 0);\n  }\n\n  function calculateTF(term: string, tokens: string[]): number {\n    const count = tokens.filter((t) => t === term).length;\n    // Sqrt capping to prevent common words from dominating\n    return Math.sqrt(count);\n  }\n\n  function calculateIDF(term: string, allEntries: MemoryEntry[]): number {\n    const totalDocs = allEntries.length;\n    const docsWithTerm = allEntries.filter((entry) => {\n      const tokens = tokenize(entry.content);\n      return tokens.includes(term);\n    }).length;\n\n    if (docsWithTerm === 0) return 0;\n\n    return Math.log(totalDocs / docsWithTerm);\n  }\n\n  function calculateTFIDF(entry: MemoryEntry, allEntries: MemoryEntry[]): number {\n    const tokens = tokenize(entry.content);\n    if (tokens.length === 0) return 0;\n\n    const uniqueTerms = [...new Set(tokens)];\n    let totalScore = 0;\n\n    for (const term of uniqueTerms) {\n      const tf = calculateTF(term, tokens);\n      const idf = calculateIDF(term, allEntries);\n      totalScore += tf * idf;\n    }\n\n    // Normalize by entry length\n    return totalScore / tokens.length;\n  }\n\n  function getStateMultiplier(entry: MemoryEntry): number {\n    // BTSP entries get max priority (handled separately, but keep high multiplier)\n    if (entry.isBTSP) return 2.0;\n\n    // State-based multipliers\n    switch (entry.state) {\n      case 'active':\n        return 2.0;\n      case 'ready':\n        return 1.0;\n      case 'silent':\n        return 0.5;\n      default:\n        return 1.0;\n    }\n  }\n\n  function priorityScore(entry: MemoryEntry, allEntries: MemoryEntry[]): number {\n    const tfidf = calculateTFIDF(entry, allEntries);\n    const currentScore = engramScorer.calculateScore(entry);\n    const engramDecay = 1 - currentScore; // Lower decay = higher priority\n    const stateMultiplier = getStateMultiplier(entry);\n\n    // Priority = TF-IDF * (1 - decay) * state_multiplier\n    // This balances relevance, recency, and confidence state\n    return tfidf * (1 - engramDecay) * stateMultiplier;\n  }\n\n  function pruneToFit(\n    entries: MemoryEntry[],\n    budget: number = tokenBudget,\n  ): PruneResult & { budgetUtilization: number } {\n    if (entries.length === 0) {\n      return {\n        kept: [],\n        removed: [],\n        originalTokens: 0,\n        prunedTokens: 0,\n        budgetUtilization: 0,\n      };\n    }\n\n    // Calculate original token count\n    const originalTokens = entries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Step 1: Separate BTSP entries (always included, bypass budget)\n    const btspEntries = entries.filter((e) => e.isBTSP);\n    const regularEntries = entries.filter((e) => !e.isBTSP);\n\n    const btspTokens = btspEntries.reduce((sum, e) => sum + estimateTokens(e.content), 0);\n\n    // Step 2: Score regular entries\n    const scored = regularEntries.map((entry) => ({\n      entry,\n      score: priorityScore(entry, entries),\n      tokens: estimateTokens(entry.content),\n    }));\n\n    // Step 3: Sort by priority score descending\n    scored.sort((a, b) => b.score - a.score);\n\n    // Step 4: Greedy fill until budget exceeded\n    const kept: MemoryEntry[] = [...btspEntries];\n    const removed: MemoryEntry[] = [];\n    let currentTokens = btspTokens;\n\n    for (const item of scored) {\n      if (currentTokens + item.tokens <= budget) {\n        kept.push(item.entry);\n        currentTokens += item.tokens;\n      } else {\n        removed.push(item.entry);\n      }\n    }\n\n    const budgetUtilization = budget > 0 ? currentTokens / budget : 0;\n\n    return {\n      kept,\n      removed,\n      originalTokens,\n      prunedTokens: currentTokens,\n      budgetUtilization,\n    };\n  }\n\n  return {\n    pruneToFit,\n    priorityScore,\n  };\n}\n\n/**\n * Helper to create budget pruner from RealtimeConfig\n * @param realtimeConfig - Realtime configuration\n * @param decayConfig - Decay configuration\n * @param statesConfig - States configuration\n * @returns BudgetPruner instance\n */\nexport function createBudgetPrunerFromConfig(\n  realtimeConfig: RealtimeConfig,\n  decayConfig: { defaultTTL: number; decayThreshold: number },\n  statesConfig: { activeThreshold: number; readyThreshold: number },\n): BudgetPruner {\n  return createBudgetPruner({\n    tokenBudget: realtimeConfig.tokenBudget,\n    decay: decayConfig,\n    states: statesConfig,\n  });\n}\n","/**\n * Context Parser - Shared utilities for parsing agent contexts into memory entries\n *\n * Extracted from claude-code adapter to enable reuse across:\n * - Adapters (claude-code, generic)\n * - Real-time pipeline (streaming context)\n * - Hooks (pre-prompt, post-tool-result)\n */\n\nimport { randomUUID } from 'node:crypto';\nimport type { MemoryEntry } from '../types/memory.js';\nimport { hashContent } from './hash.js';\n\n/**\n * Block type classification for Claude Code context\n */\nexport type BlockType = 'conversation' | 'tool' | 'result' | 'other';\n\n/**\n * Parse Claude Code context into memory entries\n * Handles conversation turns, tool uses, and results\n * @param context - Raw context string\n * @returns Array of memory entries\n */\nexport function parseClaudeCodeContext(context: string): MemoryEntry[] {\n  const entries: MemoryEntry[] = [];\n  const now = Date.now();\n\n  // Split by conversation turns and tool boundaries\n  const lines = context.split('\\n');\n  let currentBlock: string[] = [];\n  let blockType: BlockType = 'other';\n\n  for (const line of lines) {\n    const trimmed = line.trim();\n\n    // Detect conversation turns\n    if (trimmed.startsWith('User:') || trimmed.startsWith('Assistant:')) {\n      if (currentBlock.length > 0) {\n        entries.push(createEntry(currentBlock.join('\\n'), blockType, now));\n        currentBlock = [];\n      }\n      blockType = 'conversation';\n      currentBlock.push(line);\n    }\n    // Detect tool calls\n    else if (\n      trimmed.includes('<function_calls>') ||\n      trimmed.includes('<invoke>') ||\n      trimmed.includes('<tool_use>')\n    ) {\n      if (currentBlock.length > 0) {\n        entries.push(createEntry(currentBlock.join('\\n'), blockType, now));\n        currentBlock = [];\n      }\n      blockType = 'tool';\n      currentBlock.push(line);\n    }\n    // Detect tool results\n    else if (trimmed.includes('<function_results>') || trimmed.includes('</function_results>')) {\n      if (currentBlock.length > 0 && blockType !== 'result') {\n        entries.push(createEntry(currentBlock.join('\\n'), blockType, now));\n        currentBlock = [];\n      }\n      blockType = 'result';\n      currentBlock.push(line);\n    }\n    // Continue current block\n    else if (currentBlock.length > 0) {\n      currentBlock.push(line);\n    }\n    // Start new block if line has content\n    else if (trimmed.length > 0) {\n      currentBlock.push(line);\n      blockType = 'other';\n    }\n  }\n\n  // Add final block\n  if (currentBlock.length > 0) {\n    entries.push(createEntry(currentBlock.join('\\n'), blockType, now));\n  }\n\n  return entries.filter((e) => e.content.trim().length > 0);\n}\n\n/**\n * Create a memory entry from a content block\n * @param content - Block content\n * @param type - Block type\n * @param baseTime - Base timestamp\n * @returns Memory entry\n */\nexport function createEntry(content: string, type: BlockType, baseTime: number): MemoryEntry {\n  const tags: string[] = [type];\n\n  // Assign initial score based on type\n  let initialScore = 0.5;\n  if (type === 'conversation') initialScore = 0.8; // Prioritize conversation\n  if (type === 'tool') initialScore = 0.7; // Tool calls are important\n  if (type === 'result') initialScore = 0.4; // Results can be verbose\n\n  return {\n    id: randomUUID(),\n    content,\n    hash: hashContent(content),\n    timestamp: baseTime,\n    score: initialScore,\n    state: initialScore > 0.7 ? 'active' : initialScore > 0.3 ? 'ready' : 'silent',\n    ttl: 24 * 3600, // 24 hours default\n    accessCount: 0,\n    tags,\n    metadata: { type },\n    isBTSP: false,\n  };\n}\n\n/**\n * Parse generic context (fallback for non-Claude-Code agents)\n * Splits on double newlines, treats as paragraphs\n * @param context - Raw context string\n * @returns Array of memory entries\n */\nexport function parseGenericContext(context: string): MemoryEntry[] {\n  const entries: MemoryEntry[] = [];\n  const now = Date.now();\n\n  // Split on double newlines (paragraph boundaries)\n  const blocks = context.split(/\\n\\n+/);\n\n  for (const block of blocks) {\n    const trimmed = block.trim();\n    if (trimmed.length === 0) continue;\n\n    entries.push(createEntry(trimmed, 'other', now));\n  }\n\n  return entries;\n}\n","/**\n * Content hashing utilities.\n * Uses SHA-256 for deduplication.\n */\n\nimport { createHash } from 'node:crypto';\n\n/**\n * Generate SHA-256 hash of content for deduplication.\n *\n * @param content - Content to hash\n * @returns 64-character hex string (SHA-256)\n *\n * @example\n * ```typescript\n * const hash = hashContent('Hello world');\n * console.log(hash.length); // 64\n * ```\n */\nexport function hashContent(content: string): string {\n  return createHash('sha256').update(content, 'utf8').digest('hex');\n}\n"],"mappings":";;;;AAWA,qBAA6B;AAC7B,qBAAwB;AACxB,uBAAqB;AACrB,qBAAkC;;;ACM3B,SAAS,eAAe,MAAsB;AACnD,MAAI,CAAC,QAAQ,KAAK,WAAW,GAAG;AAC9B,WAAO;AAAA,EACT;AAGA,QAAM,QAAQ,KAAK,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC1D,QAAM,YAAY,MAAM;AAGxB,QAAM,YAAY,KAAK;AACvB,QAAM,eAAe,KAAK,KAAK,YAAY,CAAC;AAG5C,QAAM,eAAe,KAAK,KAAK,YAAY,IAAI;AAG/C,SAAO,KAAK,IAAI,cAAc,YAAY;AAC5C;;;ACWO,SAAS,mBAAmB,QAA0C;AAC3E,QAAM,EAAE,WAAW,IAAI;AAEvB,WAAS,eAAe,cAAsB,cAA8B;AAC1E,QAAI,iBAAiB,EAAG,QAAO;AAC/B,QAAI,gBAAgB,EAAG,QAAO;AAG9B,UAAM,QAAQ,eAAe;AAC7B,UAAM,QAAQ,IAAI,KAAK,IAAI,CAAC,KAAK;AAGjC,WAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAAA,EACvC;AAEA,WAAS,eAAe,OAAoB,cAAsB,KAAK,IAAI,GAAW;AAEpF,UAAM,oBAAoB,cAAc,MAAM;AAC9C,UAAM,eAAe,KAAK,IAAI,GAAG,oBAAoB,GAAI;AAGzD,UAAM,QAAQ,eAAe,cAAc,MAAM,GAAG;AAGpD,QAAI,QAAQ,MAAM,SAAS,IAAI;AAG/B,QAAI,MAAM,cAAc,GAAG;AACzB,YAAM,cAAc,KAAK,IAAI,MAAM,cAAc,CAAC,IAAI;AACtD,cAAQ,KAAK,IAAI,GAAK,QAAQ,WAAW;AAAA,IAC3C;AAGA,QAAI,MAAM,QAAQ;AAChB,cAAQ,KAAK,IAAI,OAAO,GAAG;AAAA,IAC7B;AAEA,WAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAAA,EACvC;AAEA,WAAS,WAAW,OAAiC;AACnD,WAAO;AAAA,MACL,GAAG;AAAA,MACH,KAAK,aAAa;AAAA;AAAA,MAClB,WAAW,KAAK,IAAI;AAAA,IACtB;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;;;AC7CO,SAAS,mBAAmB,QAA0C;AAC3E,QAAM,EAAE,aAAa,MAAM,IAAI;AAC/B,QAAM,eAAe,mBAAmB,KAAK;AAE7C,WAAS,SAAS,MAAwB;AACxC,WAAO,KACJ,YAAY,EACZ,MAAM,KAAK,EACX,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AAAA,EACrC;AAEA,WAAS,YAAY,MAAc,QAA0B;AAC3D,UAAM,QAAQ,OAAO,OAAO,CAAC,MAAM,MAAM,IAAI,EAAE;AAE/C,WAAO,KAAK,KAAK,KAAK;AAAA,EACxB;AAEA,WAAS,aAAa,MAAc,YAAmC;AACrE,UAAM,YAAY,WAAW;AAC7B,UAAM,eAAe,WAAW,OAAO,CAAC,UAAU;AAChD,YAAM,SAAS,SAAS,MAAM,OAAO;AACrC,aAAO,OAAO,SAAS,IAAI;AAAA,IAC7B,CAAC,EAAE;AAEH,QAAI,iBAAiB,EAAG,QAAO;AAE/B,WAAO,KAAK,IAAI,YAAY,YAAY;AAAA,EAC1C;AAEA,WAAS,eAAe,OAAoB,YAAmC;AAC7E,UAAM,SAAS,SAAS,MAAM,OAAO;AACrC,QAAI,OAAO,WAAW,EAAG,QAAO;AAEhC,UAAM,cAAc,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC;AACvC,QAAI,aAAa;AAEjB,eAAW,QAAQ,aAAa;AAC9B,YAAM,KAAK,YAAY,MAAM,MAAM;AACnC,YAAM,MAAM,aAAa,MAAM,UAAU;AACzC,oBAAc,KAAK;AAAA,IACrB;AAGA,WAAO,aAAa,OAAO;AAAA,EAC7B;AAEA,WAAS,mBAAmB,OAA4B;AAEtD,QAAI,MAAM,OAAQ,QAAO;AAGzB,YAAQ,MAAM,OAAO;AAAA,MACnB,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAEA,WAAS,cAAc,OAAoB,YAAmC;AAC5E,UAAM,QAAQ,eAAe,OAAO,UAAU;AAC9C,UAAM,eAAe,aAAa,eAAe,KAAK;AACtD,UAAM,cAAc,IAAI;AACxB,UAAM,kBAAkB,mBAAmB,KAAK;AAIhD,WAAO,SAAS,IAAI,eAAe;AAAA,EACrC;AAEA,WAAS,WACP,SACA,SAAiB,aAC4B;AAC7C,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;AAAA,QACL,MAAM,CAAC;AAAA,QACP,SAAS,CAAC;AAAA,QACV,gBAAgB;AAAA,QAChB,cAAc;AAAA,QACd,mBAAmB;AAAA,MACrB;AAAA,IACF;AAGA,UAAM,iBAAiB,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGpF,UAAM,cAAc,QAAQ,OAAO,CAAC,MAAM,EAAE,MAAM;AAClD,UAAM,iBAAiB,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,MAAM;AAEtD,UAAM,aAAa,YAAY,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,EAAE,OAAO,GAAG,CAAC;AAGpF,UAAM,SAAS,eAAe,IAAI,CAAC,WAAW;AAAA,MAC5C;AAAA,MACA,OAAO,cAAc,OAAO,OAAO;AAAA,MACnC,QAAQ,eAAe,MAAM,OAAO;AAAA,IACtC,EAAE;AAGF,WAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAGvC,UAAM,OAAsB,CAAC,GAAG,WAAW;AAC3C,UAAM,UAAyB,CAAC;AAChC,QAAI,gBAAgB;AAEpB,eAAW,QAAQ,QAAQ;AACzB,UAAI,gBAAgB,KAAK,UAAU,QAAQ;AACzC,aAAK,KAAK,KAAK,KAAK;AACpB,yBAAiB,KAAK;AAAA,MACxB,OAAO;AACL,gBAAQ,KAAK,KAAK,KAAK;AAAA,MACzB;AAAA,IACF;AAEA,UAAM,oBAAoB,SAAS,IAAI,gBAAgB,SAAS;AAEhE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,cAAc;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;AASO,SAAS,6BACd,gBACA,aACA,cACc;AACd,SAAO,mBAAmB;AAAA,IACxB,aAAa,eAAe;AAAA,IAC5B,OAAO;AAAA,IACP,QAAQ;AAAA,EACV,CAAC;AACH;;;AC3MA,IAAAA,sBAA2B;;;ACJ3B,yBAA2B;AAcpB,SAAS,YAAY,SAAyB;AACnD,aAAO,+BAAW,QAAQ,EAAE,OAAO,SAAS,MAAM,EAAE,OAAO,KAAK;AAClE;;;ADGO,SAAS,uBAAuB,SAAgC;AACrE,QAAM,UAAyB,CAAC;AAChC,QAAM,MAAM,KAAK,IAAI;AAGrB,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,MAAI,eAAyB,CAAC;AAC9B,MAAI,YAAuB;AAE3B,aAAW,QAAQ,OAAO;AACxB,UAAM,UAAU,KAAK,KAAK;AAG1B,QAAI,QAAQ,WAAW,OAAO,KAAK,QAAQ,WAAW,YAAY,GAAG;AACnE,UAAI,aAAa,SAAS,GAAG;AAC3B,gBAAQ,KAAK,YAAY,aAAa,KAAK,IAAI,GAAG,WAAW,GAAG,CAAC;AACjE,uBAAe,CAAC;AAAA,MAClB;AACA,kBAAY;AACZ,mBAAa,KAAK,IAAI;AAAA,IACxB,WAGE,QAAQ,SAAS,kBAAkB,KACnC,QAAQ,SAAS,UAAU,KAC3B,QAAQ,SAAS,YAAY,GAC7B;AACA,UAAI,aAAa,SAAS,GAAG;AAC3B,gBAAQ,KAAK,YAAY,aAAa,KAAK,IAAI,GAAG,WAAW,GAAG,CAAC;AACjE,uBAAe,CAAC;AAAA,MAClB;AACA,kBAAY;AACZ,mBAAa,KAAK,IAAI;AAAA,IACxB,WAES,QAAQ,SAAS,oBAAoB,KAAK,QAAQ,SAAS,qBAAqB,GAAG;AAC1F,UAAI,aAAa,SAAS,KAAK,cAAc,UAAU;AACrD,gBAAQ,KAAK,YAAY,aAAa,KAAK,IAAI,GAAG,WAAW,GAAG,CAAC;AACjE,uBAAe,CAAC;AAAA,MAClB;AACA,kBAAY;AACZ,mBAAa,KAAK,IAAI;AAAA,IACxB,WAES,aAAa,SAAS,GAAG;AAChC,mBAAa,KAAK,IAAI;AAAA,IACxB,WAES,QAAQ,SAAS,GAAG;AAC3B,mBAAa,KAAK,IAAI;AACtB,kBAAY;AAAA,IACd;AAAA,EACF;AAGA,MAAI,aAAa,SAAS,GAAG;AAC3B,YAAQ,KAAK,YAAY,aAAa,KAAK,IAAI,GAAG,WAAW,GAAG,CAAC;AAAA,EACnE;AAEA,SAAO,QAAQ,OAAO,CAAC,MAAM,EAAE,QAAQ,KAAK,EAAE,SAAS,CAAC;AAC1D;AASO,SAAS,YAAY,SAAiB,MAAiB,UAA+B;AAC3F,QAAM,OAAiB,CAAC,IAAI;AAG5B,MAAI,eAAe;AACnB,MAAI,SAAS,eAAgB,gBAAe;AAC5C,MAAI,SAAS,OAAQ,gBAAe;AACpC,MAAI,SAAS,SAAU,gBAAe;AAEtC,SAAO;AAAA,IACL,QAAI,gCAAW;AAAA,IACf;AAAA,IACA,MAAM,YAAY,OAAO;AAAA,IACzB,WAAW;AAAA,IACX,OAAO;AAAA,IACP,OAAO,eAAe,MAAM,WAAW,eAAe,MAAM,UAAU;AAAA,IACtE,KAAK,KAAK;AAAA;AAAA,IACV,aAAa;AAAA,IACb;AAAA,IACA,UAAU,EAAE,KAAK;AAAA,IACjB,QAAQ;AAAA,EACV;AACF;;;AJ9FA,SAAS,YAAY,QAAsB;AACzC,UAAQ,OAAO,MAAM,MAAM;AAC3B,UAAQ,KAAK,CAAC;AAChB;AAGA,eAAe,OAAsB;AACnC,MAAI;AAEF,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AAGpD,UAAM,SAAS,eAAe,KAAK;AAGnC,UAAM,iBAAa,2BAAK,wBAAQ,GAAG,UAAU,aAAa;AAC1D,QAAI;AAEJ,QAAI;AACF,YAAM,iBAAa,6BAAa,YAAY,OAAO;AACnD,mBAAS,eAAAC,MAAU,UAAU;AAAA,IAC/B,QAAQ;AAEN,kBAAY,KAAK;AACjB;AAAA,IACF;AAEA,UAAM,EAAE,uBAAuB,YAAY,IAAI,OAAO;AAGtD,QAAI,SAAS,uBAAuB;AAElC,kBAAY,KAAK;AACjB;AAAA,IACF;AAGA,UAAM,UAAU,uBAAuB,KAAK;AAE5C,QAAI,QAAQ,WAAW,GAAG;AAExB,kBAAY,KAAK;AACjB;AAAA,IACF;AAGA,UAAM,SAAS,6BAA6B,OAAO,UAAU,OAAO,OAAO,OAAO,MAAM;AAGxF,UAAM,SAAS,OAAO,WAAW,SAAS,WAAW;AAGrD,UAAM,SAAS,CAAC,GAAG,OAAO,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AACxE,UAAM,mBAAmB,OAAO,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,MAAM;AAGjE,gBAAY,gBAAgB;AAAA,EAC9B,SAAS,QAAQ;AAGf,UAAM,SAAmB,CAAC;AAC1B,qBAAiB,SAAS,QAAQ,OAAO;AACvC,aAAO,KAAK,KAAK;AAAA,IACnB;AACA,UAAM,QAAQ,OAAO,OAAO,MAAM,EAAE,SAAS,OAAO;AACpD,gBAAY,KAAK;AAAA,EACnB;AACF;AAGA,KAAK;","names":["import_node_crypto","parseYAML"]}

package/dist/hooks/pre-prompt.d.cts

@@ -0,0 +1 @@
+#!/usr/bin/env node

package/dist/hooks/pre-prompt.d.ts

@@ -0,0 +1 @@
+#!/usr/bin/env node