@remnic/core 1.1.0 → 1.1.2

package/dist/chunk-J4IYOZZ5.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/importance.ts"],"sourcesContent":["/**\n * Local Importance Scoring (Phase 1B)\n *\n * Zero-LLM heuristic system that evaluates each memory's significance.\n * Analyzes content for markers like explicit importance statements,\n * personal information, instructions, emotional content, and factual density.\n */\n\nimport type { ImportanceLevel, ImportanceScore, MemoryCategory, MemoryFile } from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Marker patterns for each tier\n// ---------------------------------------------------------------------------\n\n/** Critical importance markers (0.9-1.0) */\nconst CRITICAL_PATTERNS = [\n  // Explicit importance\n  /\\b(critical|crucial|essential|must|always|never)\\b/i,\n  /\\b(important|remember this|don't forget)\\b/i,\n  // Personal identity\n  /\\b(my name is|i am|i'm called)\\b/i,\n  /\\b(my (birthday|phone|email|address|ssn|password))\\b/i,\n  // Strong preferences\n  /\\b(i (hate|love|despise|adore))\\b/i,\n  /\\b(absolutely|definitely|certainly) (not|must|should)\\b/i,\n  // Corrections (high weight)\n  /\\b(actually|no,? that's wrong|correction:?|let me correct)\\b/i,\n  /\\b(i said|i meant|i was wrong)\\b/i,\n];\n\n/** High importance markers (0.7-0.9) */\nconst HIGH_PATTERNS = [\n  // Decisions\n  /\\b(decided|decision|chose|choosing|picked|selected)\\b/i,\n  /\\b(we('ll| will) (go with|use|implement))\\b/i,\n  // Instructions\n  /\\b(make sure|ensure|always|don't|do not|never|avoid)\\b/i,\n  /\\b(you (should|must|need to))\\b/i,\n  // Temporal references (deadlines, schedules)\n  /\\b(by (monday|tuesday|wednesday|thursday|friday|saturday|sunday))\\b/i,\n  /\\b(deadline|due (date|by)|by (end of|next))\\b/i,\n  /\\b(tomorrow|next week|this week|today)\\b/i,\n  // Preferences\n  /\\b(i (prefer|like|want|need|dislike))\\b/i,\n  /\\b(my (preference|style|approach|way))\\b/i,\n  // Commitments\n  /\\b(i('ll| will)|promise|commit|guarantee)\\b/i,\n  /\\b(scheduled|appointment|meeting|call)\\b/i,\n];\n\n/** Normal importance markers (0.4-0.7) */\nconst NORMAL_PATTERNS = [\n  // Factual content\n  /\\b(is|are|was|were|has|have|does|do)\\b/i,\n  /\\b(because|since|therefore|thus|so)\\b/i,\n  // Emotional content\n  /\\b(happy|sad|frustrated|excited|worried|anxious)\\b/i,\n  /\\b(feel|feeling|felt)\\b/i,\n  // Technical details\n  /\\b(version|api|endpoint|database|server|config)\\b/i,\n  /\\b(function|class|method|variable|parameter)\\b/i,\n];\n\n/** Low importance markers (0.2-0.4) */\nconst LOW_PATTERNS = [\n  // Uncertainty\n  /\\b(maybe|perhaps|possibly|might|could be)\\b/i,\n  /\\b(i think|i guess|not sure|uncertain)\\b/i,\n  /\\b(probably|likely|seems like)\\b/i,\n  // Hedging\n  /\\b(kind of|sort of|somewhat|a bit)\\b/i,\n  /\\b(in a way|to some extent)\\b/i,\n];\n\n/** Trivial content markers (0.0-0.2) */\nconst TRIVIAL_PATTERNS = [\n  // Greetings and filler\n  /^(hi|hello|hey|yo|sup|greetings)[.!,]?\\s*$/i,\n  /^(ok|okay|k|sure|yes|no|yep|nope|yeah|nah)[.!]?\\s*$/i,\n  /^(thanks|thank you|thx|ty|cheers)[.!]?\\s*$/i,\n  /^(got it|understood|roger|copy|noted)[.!]?\\s*$/i,\n  /^(bye|goodbye|later|see ya|ttyl)[.!]?\\s*$/i,\n  /^(lol|haha|hehe|lmao|rofl)[.!]?\\s*$/i,\n  /^(hmm+|uhh*|ahh*|err*|umm*)[.!]?\\s*$/i,\n  // Very short content\n  /^.{1,10}$/,\n];\n\n// ---------------------------------------------------------------------------\n// Category-based importance boosts\n// ---------------------------------------------------------------------------\n\nconst CATEGORY_BOOSTS: Record<MemoryCategory, number> = {\n  correction: 0.15,    // Corrections are always important\n  principle: 0.12,     // Durable rules/values\n  rule: 0.11,          // Causal IF→THEN rules\n  procedure: 0.10,     // Repeatable workflows (issue #519)\n  preference: 0.10,    // User preferences matter\n  commitment: 0.10,    // Promises/obligations\n  decision: 0.08,      // Decisions with rationale\n  relationship: 0.05,  // Entity relationships\n  skill: 0.05,         // Capabilities\n  moment: 0.03,        // Emotional milestones\n  entity: 0.02,        // Entity facts\n  fact: 0.00,          // Base facts, no boost\n};\n\n// ---------------------------------------------------------------------------\n// Keyword extraction\n// ---------------------------------------------------------------------------\n\n/** Common stop words to filter out */\nconst STOP_WORDS = new Set([\n  \"a\", \"an\", \"the\", \"is\", \"are\", \"was\", \"were\", \"be\", \"been\", \"being\",\n  \"have\", \"has\", \"had\", \"do\", \"does\", \"did\", \"will\", \"would\", \"could\",\n  \"should\", \"may\", \"might\", \"must\", \"shall\", \"can\", \"need\", \"dare\",\n  \"ought\", \"used\", \"to\", \"of\", \"in\", \"for\", \"on\", \"with\", \"at\", \"by\",\n  \"from\", \"as\", \"into\", \"through\", \"during\", \"before\", \"after\", \"above\",\n  \"below\", \"between\", \"under\", \"again\", \"further\", \"then\", \"once\",\n  \"here\", \"there\", \"when\", \"where\", \"why\", \"how\", \"all\", \"each\", \"few\",\n  \"more\", \"most\", \"other\", \"some\", \"such\", \"no\", \"nor\", \"not\", \"only\",\n  \"own\", \"same\", \"so\", \"than\", \"too\", \"very\", \"just\", \"and\", \"but\",\n  \"or\", \"if\", \"because\", \"until\", \"while\", \"this\", \"that\", \"these\",\n  \"those\", \"i\", \"me\", \"my\", \"myself\", \"we\", \"our\", \"ours\", \"ourselves\",\n  \"you\", \"your\", \"yours\", \"yourself\", \"yourselves\", \"he\", \"him\", \"his\",\n  \"himself\", \"she\", \"her\", \"hers\", \"herself\", \"it\", \"its\", \"itself\",\n  \"they\", \"them\", \"their\", \"theirs\", \"themselves\", \"what\", \"which\",\n  \"who\", \"whom\", \"whose\", \"am\", \"been\", \"being\", \"about\", \"against\",\n]);\n\n/**\n * Extract salient keywords from content.\n * Returns top N keywords sorted by relevance.\n */\nfunction extractKeywords(content: string, maxKeywords: number = 5): string[] {\n  // Tokenize and normalize\n  const words = content\n    .toLowerCase()\n    .replace(/[^a-z0-9\\s-]/g, \" \")\n    .split(/\\s+/)\n    .filter((w) => w.length >= 3 && !STOP_WORDS.has(w));\n\n  // Count frequencies\n  const freq = new Map<string, number>();\n  for (const word of words) {\n    freq.set(word, (freq.get(word) ?? 0) + 1);\n  }\n\n  // Sort by frequency, take top N\n  return [...freq.entries()]\n    .sort((a, b) => b[1] - a[1])\n    .slice(0, maxKeywords)\n    .map(([word]) => word);\n}\n\n// ---------------------------------------------------------------------------\n// Main scoring function\n// ---------------------------------------------------------------------------\n\n/**\n * Calculate importance score for a memory.\n * Pure local heuristics, zero LLM calls.\n */\nexport function scoreImportance(\n  content: string,\n  category: MemoryCategory,\n  tags: string[] = [],\n): ImportanceScore {\n  const reasons: string[] = [];\n  let score = 0.5; // Start at normal baseline\n\n  const lowerContent = content.toLowerCase();\n  const contentLength = content.length;\n\n  // Check for trivial content first (short-circuit)\n  for (const pattern of TRIVIAL_PATTERNS) {\n    if (pattern.test(content)) {\n      return {\n        score: 0.1,\n        level: \"trivial\",\n        reasons: [\"Trivial content (greeting, filler, or very short)\"],\n        keywords: [],\n      };\n    }\n  }\n\n  // Check critical patterns\n  for (const pattern of CRITICAL_PATTERNS) {\n    if (pattern.test(content)) {\n      score += 0.20;\n      reasons.push(`Critical marker: ${pattern.source.slice(0, 30)}`);\n      break; // Only count once per tier\n    }\n  }\n\n  // Check high patterns\n  for (const pattern of HIGH_PATTERNS) {\n    if (pattern.test(content)) {\n      score += 0.12;\n      reasons.push(`High importance marker detected`);\n      break;\n    }\n  }\n\n  // Check low patterns (reduces score)\n  for (const pattern of LOW_PATTERNS) {\n    if (pattern.test(content)) {\n      score -= 0.15;\n      reasons.push(`Uncertainty/hedging detected`);\n      break;\n    }\n  }\n\n  // Category boost\n  const categoryBoost = CATEGORY_BOOSTS[category] ?? 0;\n  if (categoryBoost > 0) {\n    score += categoryBoost;\n    reasons.push(`Category boost: ${category}`);\n  }\n\n  // Length bonus (longer = more substance, capped)\n  if (contentLength > 200) {\n    const lengthBonus = Math.min((contentLength - 200) / 1000, 0.1);\n    score += lengthBonus;\n    if (lengthBonus > 0.05) {\n      reasons.push(\"Substantial content length\");\n    }\n  }\n\n  // Check for personal pronouns (signals personal relevance)\n  if (/\\b(my|mine|i|i'm|i've|i'd|i'll)\\b/i.test(content)) {\n    score += 0.05;\n    reasons.push(\"Personal reference\");\n  }\n\n  // Check for numbers/specifics (concrete details)\n  if (/\\b\\d{2,}\\b/.test(content) || /\\b(version|v\\d|api|config)\\b/i.test(content)) {\n    score += 0.03;\n    reasons.push(\"Contains specific details\");\n  }\n\n  // Tag-based boosts\n  const importantTags = tags.filter((t) =>\n    [\"important\", \"critical\", \"preference\", \"decision\", \"rule\", \"principle\"].includes(t.toLowerCase())\n  );\n  if (importantTags.length > 0) {\n    score += 0.05 * importantTags.length;\n    reasons.push(`Important tags: ${importantTags.join(\", \")}`);\n  }\n\n  // Clamp score to 0-1 range\n  score = Math.max(0, Math.min(1, score));\n\n  // Determine level from score\n  let level: ImportanceLevel;\n  if (score >= 0.9) {\n    level = \"critical\";\n  } else if (score >= 0.7) {\n    level = \"high\";\n  } else if (score >= 0.4) {\n    level = \"normal\";\n  } else if (score >= 0.2) {\n    level = \"low\";\n  } else {\n    level = \"trivial\";\n  }\n\n  // Extract keywords\n  const keywords = extractKeywords(content);\n\n  return {\n    score: Math.round(score * 100) / 100, // Round to 2 decimal places\n    level,\n    reasons: reasons.slice(0, 5), // Cap at 5 reasons\n    keywords,\n  };\n}\n\n/**\n * Recompute importance for an existing memory file using current local heuristics.\n */\nexport function rescoreMemoryImportance(memory: MemoryFile): ImportanceScore {\n  return scoreImportance(memory.content, memory.frontmatter.category, memory.frontmatter.tags ?? []);\n}\n\n/**\n * Get importance level from numeric score.\n */\nexport function importanceLevel(score: number): ImportanceLevel {\n  if (score >= 0.9) return \"critical\";\n  if (score >= 0.7) return \"high\";\n  if (score >= 0.4) return \"normal\";\n  if (score >= 0.2) return \"low\";\n  return \"trivial\";\n}\n\n// ---------------------------------------------------------------------------\n// Importance threshold helper (issue #372)\n// ---------------------------------------------------------------------------\n\n/**\n * Ordering for importance levels used by the extraction write gate.\n * Higher indices mean more important.\n */\nconst IMPORTANCE_LEVEL_RANK: Record<ImportanceLevel, number> = {\n  trivial: 0,\n  low: 1,\n  normal: 2,\n  high: 3,\n  critical: 4,\n};\n\n/**\n * Return true if `candidate` meets or exceeds `threshold`. Used by the\n * extraction write gate in orchestrator.persistExtraction() to drop trivial\n * content before it is written to the memory store.\n *\n * Note: callers should pass the ALREADY-BOOSTED level returned by\n * scoreImportance(), because category boosts (e.g. corrections) are applied\n * inside scoreImportance() before the level is derived.\n */\nexport function isAboveImportanceThreshold(\n  candidate: ImportanceLevel,\n  threshold: ImportanceLevel,\n): boolean {\n  return IMPORTANCE_LEVEL_RANK[candidate] >= IMPORTANCE_LEVEL_RANK[threshold];\n}\n"],"mappings":";AAeA,IAAM,oBAAoB;AAAA;AAAA,EAExB;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AACF;AAGA,IAAM,gBAAgB;AAAA;AAAA,EAEpB;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AACF;AAgBA,IAAM,eAAe;AAAA;AAAA,EAEnB;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA;AACF;AAGA,IAAM,mBAAmB;AAAA;AAAA,EAEvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAEA;AACF;AAMA,IAAM,kBAAkD;AAAA,EACtD,YAAY;AAAA;AAAA,EACZ,WAAW;AAAA;AAAA,EACX,MAAM;AAAA;AAAA,EACN,WAAW;AAAA;AAAA,EACX,YAAY;AAAA;AAAA,EACZ,YAAY;AAAA;AAAA,EACZ,UAAU;AAAA;AAAA,EACV,cAAc;AAAA;AAAA,EACd,OAAO;AAAA;AAAA,EACP,QAAQ;AAAA;AAAA,EACR,QAAQ;AAAA;AAAA,EACR,MAAM;AAAA;AACR;AAOA,IAAM,aAAa,oBAAI,IAAI;AAAA,EACzB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAC5D;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAC5D;AAAA,EAAU;AAAA,EAAO;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAQ;AAAA,EAC1D;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAM;AAAA,EAC9D;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAW;AAAA,EAAU;AAAA,EAAU;AAAA,EAAS;AAAA,EAC9D;AAAA,EAAS;AAAA,EAAW;AAAA,EAAS;AAAA,EAAS;AAAA,EAAW;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAC/D;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAC7D;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAO;AAAA,EAC3D;AAAA,EAAM;AAAA,EAAM;AAAA,EAAW;AAAA,EAAS;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAS;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EAAU;AAAA,EAAM;AAAA,EAAO;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAY;AAAA,EAAc;AAAA,EAAM;AAAA,EAAO;AAAA,EAC/D;AAAA,EAAW;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAW;AAAA,EAAM;AAAA,EAAO;AAAA,EACzD;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAU;AAAA,EAAc;AAAA,EAAQ;AAAA,EACzD;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAS;AAC1D,CAAC;AAMD,SAAS,gBAAgB,SAAiB,cAAsB,GAAa;AAE3E,QAAM,QAAQ,QACX,YAAY,EACZ,QAAQ,iBAAiB,GAAG,EAC5B,MAAM,KAAK,EACX,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;AAGpD,QAAM,OAAO,oBAAI,IAAoB;AACrC,aAAW,QAAQ,OAAO;AACxB,SAAK,IAAI,OAAO,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,EAC1C;AAGA,SAAO,CAAC,GAAG,KAAK,QAAQ,CAAC,EACtB,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,WAAW,EACpB,IAAI,CAAC,CAAC,IAAI,MAAM,IAAI;AACzB;AAUO,SAAS,gBACd,SACA,UACA,OAAiB,CAAC,GACD;AACjB,QAAM,UAAoB,CAAC;AAC3B,MAAI,QAAQ;AAEZ,QAAM,eAAe,QAAQ,YAAY;AACzC,QAAM,gBAAgB,QAAQ;AAG9B,aAAW,WAAW,kBAAkB;AACtC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,aAAO;AAAA,QACL,OAAO;AAAA,QACP,OAAO;AAAA,QACP,SAAS,CAAC,mDAAmD;AAAA,QAC7D,UAAU,CAAC;AAAA,MACb;AAAA,IACF;AAAA,EACF;AAGA,aAAW,WAAW,mBAAmB;AACvC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,eAAS;AACT,cAAQ,KAAK,oBAAoB,QAAQ,OAAO,MAAM,GAAG,EAAE,CAAC,EAAE;AAC9D;AAAA,IACF;AAAA,EACF;AAGA,aAAW,WAAW,eAAe;AACnC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,eAAS;AACT,cAAQ,KAAK,iCAAiC;AAC9C;AAAA,IACF;AAAA,EACF;AAGA,aAAW,WAAW,cAAc;AAClC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,eAAS;AACT,cAAQ,KAAK,8BAA8B;AAC3C;AAAA,IACF;AAAA,EACF;AAGA,QAAM,gBAAgB,gBAAgB,QAAQ,KAAK;AACnD,MAAI,gBAAgB,GAAG;AACrB,aAAS;AACT,YAAQ,KAAK,mBAAmB,QAAQ,EAAE;AAAA,EAC5C;AAGA,MAAI,gBAAgB,KAAK;AACvB,UAAM,cAAc,KAAK,KAAK,gBAAgB,OAAO,KAAM,GAAG;AAC9D,aAAS;AACT,QAAI,cAAc,MAAM;AACtB,cAAQ,KAAK,4BAA4B;AAAA,IAC3C;AAAA,EACF;AAGA,MAAI,qCAAqC,KAAK,OAAO,GAAG;AACtD,aAAS;AACT,YAAQ,KAAK,oBAAoB;AAAA,EACnC;AAGA,MAAI,aAAa,KAAK,OAAO,KAAK,gCAAgC,KAAK,OAAO,GAAG;AAC/E,aAAS;AACT,YAAQ,KAAK,2BAA2B;AAAA,EAC1C;AAGA,QAAM,gBAAgB,KAAK;AAAA,IAAO,CAAC,MACjC,CAAC,aAAa,YAAY,cAAc,YAAY,QAAQ,WAAW,EAAE,SAAS,EAAE,YAAY,CAAC;AAAA,EACnG;AACA,MAAI,cAAc,SAAS,GAAG;AAC5B,aAAS,OAAO,cAAc;AAC9B,YAAQ,KAAK,mBAAmB,cAAc,KAAK,IAAI,CAAC,EAAE;AAAA,EAC5D;AAGA,UAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAGtC,MAAI;AACJ,MAAI,SAAS,KAAK;AAChB,YAAQ;AAAA,EACV,WAAW,SAAS,KAAK;AACvB,YAAQ;AAAA,EACV,WAAW,SAAS,KAAK;AACvB,YAAQ;AAAA,EACV,WAAW,SAAS,KAAK;AACvB,YAAQ;AAAA,EACV,OAAO;AACL,YAAQ;AAAA,EACV;AAGA,QAAM,WAAW,gBAAgB,OAAO;AAExC,SAAO;AAAA,IACL,OAAO,KAAK,MAAM,QAAQ,GAAG,IAAI;AAAA;AAAA,IACjC;AAAA,IACA,SAAS,QAAQ,MAAM,GAAG,CAAC;AAAA;AAAA,IAC3B;AAAA,EACF;AACF;AAKO,SAAS,wBAAwB,QAAqC;AAC3E,SAAO,gBAAgB,OAAO,SAAS,OAAO,YAAY,UAAU,OAAO,YAAY,QAAQ,CAAC,CAAC;AACnG;AAKO,SAAS,gBAAgB,OAAgC;AAC9D,MAAI,SAAS,IAAK,QAAO;AACzB,MAAI,SAAS,IAAK,QAAO;AACzB,MAAI,SAAS,IAAK,QAAO;AACzB,MAAI,SAAS,IAAK,QAAO;AACzB,SAAO;AACT;AAUA,IAAM,wBAAyD;AAAA,EAC7D,SAAS;AAAA,EACT,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,UAAU;AACZ;AAWO,SAAS,2BACd,WACA,WACS;AACT,SAAO,sBAAsB,SAAS,KAAK,sBAAsB,SAAS;AAC5E;","names":[]}

package/dist/chunk-LAYN4LDC.js

@@ -1,267 +0,0 @@
-import {
-  extractJsonCandidates
-} from "./chunk-UZB5KHKX.js";
-import {
-  normalizeProcedureSteps
-} from "./chunk-QDW3E4RD.js";
-import {
-  log
-} from "./chunk-2ODBA7MQ.js";
-
-// src/extraction-judge.ts
-import { createHash } from "crypto";
-var JUDGE_SYSTEM_PROMPT = `You are a memory curator evaluating whether extracted facts are **durable** \u2014 worth storing for long-term recall across sessions.
-
-A fact is **durable** if it will still be useful 30+ days from now and is relevant across multiple sessions, not just the current task.
-
-DURABLE examples (approve):
-- Personal preferences, identities, or relationships
-- Decisions with rationale that affect future work
-- Corrections to previously held beliefs
-- Principles, rules, or constraints the user wants respected
-- Stable facts about projects, tools, or workflows
-- Commitments, deadlines, or obligations
-
-NOT DURABLE examples (reject):
-- Transient task details ("currently debugging line 42")
-- Ephemeral state ("the build is running now")
-- Routine operations ("ran npm install")
-- Conversational filler or acknowledgements
-- Information that will be stale within hours
-- Step-by-step instructions for a one-time task
-
-Return a JSON array of objects with these fields:
-- index: number (the candidate index)
-- durable: boolean (true if the fact is durable)
-- reason: string (brief explanation)
-
-Rules:
-1. Return exactly one verdict per input candidate, matched by index.
-2. The reason field must be a short phrase (under 80 characters).
-3. When in doubt lean toward durable \u2014 false negatives are worse than false positives.
-4. Output valid JSON only. No markdown fences, no commentary.
-
-Example output:
-[{"index": 0, "durable": true, "reason": "Stable personal preference"}, {"index": 1, "durable": false, "reason": "Ephemeral build status"}]`;
-var VERDICT_CACHE_MAX_SIZE = 1e4;
-var defaultVerdictCache = /* @__PURE__ */ new Map();
-function cacheKey(text, category) {
-  return createHash("sha256").update(`${text}\0${category}`).digest("hex");
-}
-function enforceMaxCacheSize(cache) {
-  if (cache.size <= VERDICT_CACHE_MAX_SIZE) return;
-  const deleteCount = Math.floor(cache.size / 2);
-  let deleted = 0;
-  for (const key of cache.keys()) {
-    if (deleted >= deleteCount) break;
-    cache.delete(key);
-    deleted++;
-  }
-}
-var AUTO_APPROVE_CATEGORIES = /* @__PURE__ */ new Set(["correction", "principle"]);
-var PROCEDURE_TRIGGER_RE = /(when you|whenever|before you|before running|always\s|first\b.*\bthen|to deploy|to ship|run these steps|follow these steps|how (i|we)\s|recipe for|workflow|each time you)/i;
-function validateProcedureExtraction(input) {
-  const steps = normalizeProcedureSteps(input.procedureSteps);
-  if (steps.length < 2) {
-    return { durable: false, reason: "Procedure requires at least two steps with intents" };
-  }
-  const combined = [input.content, ...steps.map((s) => s.intent)].join(" ").toLowerCase();
-  if (!PROCEDURE_TRIGGER_RE.test(combined)) {
-    return { durable: false, reason: "Procedure missing explicit trigger phrasing" };
-  }
-  return { durable: true, reason: "Procedure structure validated" };
-}
-async function judgeFactDurability(candidates, config, localLlm, fallbackLlm, cache) {
-  const startMs = Date.now();
-  const verdicts = /* @__PURE__ */ new Map();
-  let cached = 0;
-  let judged = 0;
-  const verdictCache = cache ?? defaultVerdictCache;
-  if (candidates.length === 0) {
-    return { verdicts, cached, judged, elapsed: 0 };
-  }
-  const pendingIndices = [];
-  for (let i = 0; i < candidates.length; i++) {
-    const c = candidates[i];
-    if (AUTO_APPROVE_CATEGORIES.has(c.category)) {
-      verdicts.set(i, {
-        durable: true,
-        reason: `Auto-approved: ${c.category} category bypasses judge`
-      });
-      continue;
-    }
-    if (c.importanceLevel === "critical") {
-      verdicts.set(i, {
-        durable: true,
-        reason: "Auto-approved: critical importance"
-      });
-      continue;
-    }
-    const key = cacheKey(c.text, c.category);
-    const cachedVerdict = verdictCache.get(key);
-    if (cachedVerdict) {
-      verdicts.set(i, cachedVerdict);
-      cached++;
-      continue;
-    }
-    pendingIndices.push(i);
-  }
-  if (pendingIndices.length === 0) {
-    return { verdicts, cached, judged, elapsed: Date.now() - startMs };
-  }
-  const batchSize = config.extractionJudgeBatchSize;
-  for (let batchStart = 0; batchStart < pendingIndices.length; batchStart += batchSize) {
-    const batchIndices = pendingIndices.slice(batchStart, batchStart + batchSize);
-    const batchPayload = batchIndices.map((idx) => ({
-      index: idx,
-      text: candidates[idx].text,
-      category: candidates[idx].category,
-      confidence: candidates[idx].confidence
-    }));
-    const userPrompt = JSON.stringify(batchPayload);
-    try {
-      const llmResponse = await callJudgeLlm(
-        userPrompt,
-        config,
-        localLlm,
-        fallbackLlm
-      );
-      if (llmResponse) {
-        const parsed = parseJudgeResponse(llmResponse, batchIndices);
-        for (const [idx, verdict] of parsed.entries()) {
-          verdicts.set(idx, verdict);
-          judged++;
-          const c = candidates[idx];
-          verdictCache.set(cacheKey(c.text, c.category), verdict);
-        }
-        enforceMaxCacheSize(verdictCache);
-      }
-    } catch (err) {
-      log.warn(
-        `extraction-judge: LLM call failed, approving batch (fail-open): ${err instanceof Error ? err.message : String(err)}`
-      );
-    }
-    for (const idx of batchIndices) {
-      if (!verdicts.has(idx)) {
-        verdicts.set(idx, {
-          durable: true,
-          reason: "Approved by default (judge unavailable or parse error)"
-        });
-      }
-    }
-  }
-  return { verdicts, cached, judged, elapsed: Date.now() - startMs };
-}
-async function callJudgeLlm(userPrompt, config, localLlm, fallbackLlm) {
-  const messages = [
-    { role: "system", content: JUDGE_SYSTEM_PROMPT },
-    { role: "user", content: userPrompt }
-  ];
-  const modelOverride = config.extractionJudgeModel || void 0;
-  const skipLocal = config.modelSource === "gateway";
-  const agentId = config.modelSource === "gateway" ? config.gatewayAgentId || void 0 : void 0;
-  if (localLlm && !skipLocal) {
-    try {
-      const result = await localLlm.chatCompletion(messages, {
-        temperature: 0.1,
-        maxTokens: 2048,
-        responseFormat: { type: "json_object" },
-        timeoutMs: 1500,
-        operation: "extraction-judge",
-        ...modelOverride ? { model: modelOverride } : {}
-      });
-      if (result?.content) {
-        return result.content;
-      }
-    } catch (err) {
-      log.debug(
-        `extraction-judge: local LLM failed, trying fallback: ${err instanceof Error ? err.message : String(err)}`
-      );
-    }
-  }
-  if (fallbackLlm) {
-    try {
-      const result = await fallbackLlm.chatCompletion(
-        messages,
-        {
-          temperature: 0.1,
-          maxTokens: 2048,
-          timeoutMs: 1500,
-          ...modelOverride ? { model: modelOverride } : {},
-          ...agentId ? { agentId } : {}
-        }
-      );
-      if (result?.content) {
-        return result.content;
-      }
-    } catch (err) {
-      log.debug(
-        `extraction-judge: fallback LLM failed: ${err instanceof Error ? err.message : String(err)}`
-      );
-    }
-  }
-  return null;
-}
-function parseJudgeResponse(raw, expectedIndices) {
-  const result = /* @__PURE__ */ new Map();
-  const expectedSet = new Set(expectedIndices);
-  try {
-    let parsed;
-    try {
-      parsed = JSON.parse(raw);
-    } catch {
-      const candidates = extractJsonCandidates(raw);
-      if (candidates.length > 0) {
-        parsed = JSON.parse(candidates[0]);
-      }
-    }
-    if (!Array.isArray(parsed)) {
-      if (parsed && typeof parsed === "object" && !Array.isArray(parsed)) {
-        const values = Object.values(parsed);
-        for (const v of values) {
-          if (Array.isArray(v)) {
-            parsed = v;
-            break;
-          }
-        }
-      }
-      if (!Array.isArray(parsed)) {
-        log.debug("extraction-judge: response is not an array, cannot parse");
-        return result;
-      }
-    }
-    for (const item of parsed) {
-      if (typeof item !== "object" || item === null || typeof item.index !== "number") {
-        continue;
-      }
-      const idx = item.index;
-      if (!expectedSet.has(idx)) continue;
-      const durable = typeof item.durable === "boolean" ? item.durable : true;
-      const reason = typeof item.reason === "string" ? item.reason.slice(0, 120) : "No reason provided";
-      result.set(idx, { durable, reason });
-    }
-  } catch (err) {
-    log.debug(
-      `extraction-judge: failed to parse response: ${err instanceof Error ? err.message : String(err)}`
-    );
-  }
-  return result;
-}
-function clearVerdictCache() {
-  defaultVerdictCache.clear();
-}
-function verdictCacheSize() {
-  return defaultVerdictCache.size;
-}
-function createVerdictCache() {
-  return /* @__PURE__ */ new Map();
-}
-
-export {
-  validateProcedureExtraction,
-  judgeFactDurability,
-  clearVerdictCache,
-  verdictCacheSize,
-  createVerdictCache
-};
-//# sourceMappingURL=chunk-LAYN4LDC.js.map

package/dist/chunk-LAYN4LDC.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/extraction-judge.ts"],"sourcesContent":["/**\n * Extraction Judge — LLM-as-judge fact-worthiness gate (issue #376).\n *\n * Evaluates extracted facts against a durability rubric before they are\n * persisted. Facts that are unlikely to be useful 30+ days from now or\n * across sessions are rejected (or shadow-logged depending on config).\n *\n * Design constraints:\n *   - Corrections and principles are auto-approved (safety bypass).\n *   - Critical-importance facts are auto-approved.\n *   - Batches respect extractionJudgeBatchSize.\n *   - Content-hash caching avoids redundant LLM calls.\n *   - Performance budget: <= 1.5s per batch.\n */\n\nimport { createHash } from \"node:crypto\";\nimport { log } from \"./logger.js\";\nimport type { PluginConfig, ImportanceLevel } from \"./types.js\";\nimport type { LocalLlmClient } from \"./local-llm.js\";\nimport type { FallbackLlmClient } from \"./fallback-llm.js\";\nimport { extractJsonCandidates } from \"./json-extract.js\";\nimport { normalizeProcedureSteps } from \"./procedural/procedure-types.js\";\n\n// ---------------------------------------------------------------------------\n// Public interfaces\n// ---------------------------------------------------------------------------\n\nexport interface JudgeCandidate {\n  text: string;\n  category: string;\n  confidence: number;\n  tags?: string[];\n  /** Local importance level, set by caller before judging. */\n  importanceLevel?: ImportanceLevel;\n}\n\nexport interface JudgeVerdict {\n  durable: boolean;\n  reason: string;\n}\n\nexport interface JudgeBatchResult {\n  verdicts: Map<number, JudgeVerdict>;\n  /** Number of verdicts served from cache. */\n  cached: number;\n  /** Number of verdicts produced by an LLM call. */\n  judged: number;\n  /** Total wall-clock time in milliseconds. */\n  elapsed: number;\n}\n\n// ---------------------------------------------------------------------------\n// Prompt (embedded; mirrors prompts/extraction_judge.prompt.md)\n// ---------------------------------------------------------------------------\n\nconst JUDGE_SYSTEM_PROMPT = `You are a memory curator evaluating whether extracted facts are **durable** — worth storing for long-term recall across sessions.\n\nA fact is **durable** if it will still be useful 30+ days from now and is relevant across multiple sessions, not just the current task.\n\nDURABLE examples (approve):\n- Personal preferences, identities, or relationships\n- Decisions with rationale that affect future work\n- Corrections to previously held beliefs\n- Principles, rules, or constraints the user wants respected\n- Stable facts about projects, tools, or workflows\n- Commitments, deadlines, or obligations\n\nNOT DURABLE examples (reject):\n- Transient task details (\"currently debugging line 42\")\n- Ephemeral state (\"the build is running now\")\n- Routine operations (\"ran npm install\")\n- Conversational filler or acknowledgements\n- Information that will be stale within hours\n- Step-by-step instructions for a one-time task\n\nReturn a JSON array of objects with these fields:\n- index: number (the candidate index)\n- durable: boolean (true if the fact is durable)\n- reason: string (brief explanation)\n\nRules:\n1. Return exactly one verdict per input candidate, matched by index.\n2. The reason field must be a short phrase (under 80 characters).\n3. When in doubt lean toward durable — false negatives are worse than false positives.\n4. Output valid JSON only. No markdown fences, no commentary.\n\nExample output:\n[{\"index\": 0, \"durable\": true, \"reason\": \"Stable personal preference\"}, {\"index\": 1, \"durable\": false, \"reason\": \"Ephemeral build status\"}]`;\n\n// ---------------------------------------------------------------------------\n// Content-hash cache (in-memory, per-process fallback)\n// ---------------------------------------------------------------------------\n\n/** Maximum entries before evicting the oldest half. */\nconst VERDICT_CACHE_MAX_SIZE = 10_000;\n\n/** Module-level fallback cache, used when callers do not pass their own. */\nconst defaultVerdictCache = new Map<string, JudgeVerdict>();\n\nfunction cacheKey(text: string, category: string): string {\n  return createHash(\"sha256\").update(`${text}\\0${category}`).digest(\"hex\");\n}\n\n/**\n * Enforce the max-size invariant on a verdict cache. When the cache exceeds\n * VERDICT_CACHE_MAX_SIZE, the oldest half of entries are deleted (Map\n * iteration order is insertion order).\n */\nfunction enforceMaxCacheSize(cache: Map<string, JudgeVerdict>): void {\n  if (cache.size <= VERDICT_CACHE_MAX_SIZE) return;\n  const deleteCount = Math.floor(cache.size / 2);\n  let deleted = 0;\n  for (const key of cache.keys()) {\n    if (deleted >= deleteCount) break;\n    cache.delete(key);\n    deleted++;\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Categories that bypass the judge (safety / correctness)\n// ---------------------------------------------------------------------------\n\nconst AUTO_APPROVE_CATEGORIES = new Set([\"correction\", \"principle\"]);\n\n/** Explicit trigger phrasing — procedures must match to persist (issue #519). */\nconst PROCEDURE_TRIGGER_RE =\n  /(when you|whenever|before you|before running|always\\s|first\\b.*\\bthen|to deploy|to ship|run these steps|follow these steps|how (i|we)\\s|recipe for|workflow|each time you)/i;\n\n/**\n * Deterministic gate for extracted `procedure` memories: ≥2 steps with non-empty\n * intents and explicit trigger wording in title and/or steps.\n */\nexport function validateProcedureExtraction(input: {\n  content: string;\n  procedureSteps?: unknown;\n}): JudgeVerdict {\n  const steps = normalizeProcedureSteps(input.procedureSteps);\n  if (steps.length < 2) {\n    return { durable: false, reason: \"Procedure requires at least two steps with intents\" };\n  }\n  const combined = [input.content, ...steps.map((s) => s.intent)].join(\" \").toLowerCase();\n  if (!PROCEDURE_TRIGGER_RE.test(combined)) {\n    return { durable: false, reason: \"Procedure missing explicit trigger phrasing\" };\n  }\n  return { durable: true, reason: \"Procedure structure validated\" };\n}\n\n// ---------------------------------------------------------------------------\n// Core judge function\n// ---------------------------------------------------------------------------\n\n/**\n * Evaluate a batch of candidate facts for durability.\n *\n * Auto-approves corrections, principles, and critical-importance facts.\n * Remaining candidates are batched (up to extractionJudgeBatchSize),\n * checked against an in-memory content-hash cache, and sent to the LLM\n * for verdict.\n */\nexport async function judgeFactDurability(\n  candidates: JudgeCandidate[],\n  config: PluginConfig,\n  localLlm: LocalLlmClient | null,\n  fallbackLlm: FallbackLlmClient | null,\n  cache?: Map<string, JudgeVerdict>,\n): Promise<JudgeBatchResult> {\n  const startMs = Date.now();\n  const verdicts = new Map<number, JudgeVerdict>();\n  let cached = 0;\n  let judged = 0;\n\n  // Use caller-provided cache for per-orchestrator scoping, or fall back\n  // to the module-level default cache.\n  const verdictCache = cache ?? defaultVerdictCache;\n\n  if (candidates.length === 0) {\n    return { verdicts, cached, judged, elapsed: 0 };\n  }\n\n  // Indices that need LLM judgment\n  const pendingIndices: number[] = [];\n\n  for (let i = 0; i < candidates.length; i++) {\n    const c = candidates[i];\n\n    // Auto-approve safety categories\n    if (AUTO_APPROVE_CATEGORIES.has(c.category)) {\n      verdicts.set(i, {\n        durable: true,\n        reason: `Auto-approved: ${c.category} category bypasses judge`,\n      });\n      continue;\n    }\n\n    // Auto-approve critical importance\n    if (c.importanceLevel === \"critical\") {\n      verdicts.set(i, {\n        durable: true,\n        reason: \"Auto-approved: critical importance\",\n      });\n      continue;\n    }\n\n    // Check cache\n    const key = cacheKey(c.text, c.category);\n    const cachedVerdict = verdictCache.get(key);\n    if (cachedVerdict) {\n      verdicts.set(i, cachedVerdict);\n      cached++;\n      continue;\n    }\n\n    pendingIndices.push(i);\n  }\n\n  // If all resolved without LLM, return early\n  if (pendingIndices.length === 0) {\n    return { verdicts, cached, judged, elapsed: Date.now() - startMs };\n  }\n\n  // Batch the pending candidates up to batchSize\n  const batchSize = config.extractionJudgeBatchSize;\n  for (let batchStart = 0; batchStart < pendingIndices.length; batchStart += batchSize) {\n    const batchIndices = pendingIndices.slice(batchStart, batchStart + batchSize);\n    const batchPayload = batchIndices.map((idx) => ({\n      index: idx,\n      text: candidates[idx].text,\n      category: candidates[idx].category,\n      confidence: candidates[idx].confidence,\n    }));\n\n    const userPrompt = JSON.stringify(batchPayload);\n\n    try {\n      const llmResponse = await callJudgeLlm(\n        userPrompt,\n        config,\n        localLlm,\n        fallbackLlm,\n      );\n\n      if (llmResponse) {\n        const parsed = parseJudgeResponse(llmResponse, batchIndices);\n        for (const [idx, verdict] of parsed.entries()) {\n          verdicts.set(idx, verdict);\n          judged++;\n          // Cache the verdict\n          const c = candidates[idx];\n          verdictCache.set(cacheKey(c.text, c.category), verdict);\n        }\n        // Evict oldest entries if cache exceeds max size\n        enforceMaxCacheSize(verdictCache);\n      }\n    } catch (err) {\n      // Fail-open: if the LLM call fails, approve all candidates in this batch\n      log.warn(\n        `extraction-judge: LLM call failed, approving batch (fail-open): ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n\n    // Fill in any missing verdicts from this batch (fail-open: approve)\n    for (const idx of batchIndices) {\n      if (!verdicts.has(idx)) {\n        verdicts.set(idx, {\n          durable: true,\n          reason: \"Approved by default (judge unavailable or parse error)\",\n        });\n      }\n    }\n  }\n\n  return { verdicts, cached, judged, elapsed: Date.now() - startMs };\n}\n\n// ---------------------------------------------------------------------------\n// LLM call helpers\n// ---------------------------------------------------------------------------\n\nasync function callJudgeLlm(\n  userPrompt: string,\n  config: PluginConfig,\n  localLlm: LocalLlmClient | null,\n  fallbackLlm: FallbackLlmClient | null,\n): Promise<string | null> {\n  const messages: Array<{ role: \"system\" | \"user\"; content: string }> = [\n    { role: \"system\", content: JUDGE_SYSTEM_PROMPT },\n    { role: \"user\", content: userPrompt },\n  ];\n\n  const modelOverride = config.extractionJudgeModel || undefined;\n\n  // When modelSource is \"gateway\", skip localLlm and go directly to fallback\n  // (the gateway-routed backend). This respects the operator's explicit\n  // routing preference.\n  const skipLocal = config.modelSource === \"gateway\";\n\n  // Resolve the gateway agent ID so the fallback LLM routes through the\n  // correct agent persona's model chain — identical to the pattern used\n  // by ExtractionEngine.withGatewayAgent().\n  const agentId =\n    config.modelSource === \"gateway\"\n      ? (config.gatewayAgentId || undefined)\n      : undefined;\n\n  // Try local LLM first (unless modelSource says gateway)\n  if (localLlm && !skipLocal) {\n    try {\n      const result = await (localLlm as any).chatCompletion(messages, {\n        temperature: 0.1,\n        maxTokens: 2048,\n        responseFormat: { type: \"json_object\" },\n        timeoutMs: 1500,\n        operation: \"extraction-judge\",\n        ...(modelOverride ? { model: modelOverride } : {}),\n      });\n      if (result?.content) {\n        return result.content;\n      }\n    } catch (err) {\n      log.debug(\n        `extraction-judge: local LLM failed, trying fallback: ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n  }\n\n  // Try fallback LLM\n  if (fallbackLlm) {\n    try {\n      const result = await fallbackLlm.chatCompletion(\n        messages as Array<{ role: \"system\" | \"user\" | \"assistant\"; content: string }>,\n        {\n          temperature: 0.1,\n          maxTokens: 2048,\n          timeoutMs: 1500,\n          ...(modelOverride ? { model: modelOverride } : {}),\n          ...(agentId ? { agentId } : {}),\n        },\n      );\n      if (result?.content) {\n        return result.content;\n      }\n    } catch (err) {\n      log.debug(\n        `extraction-judge: fallback LLM failed: ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n  }\n\n  return null;\n}\n\n// ---------------------------------------------------------------------------\n// Response parsing\n// ---------------------------------------------------------------------------\n\nfunction parseJudgeResponse(\n  raw: string,\n  expectedIndices: number[],\n): Map<number, JudgeVerdict> {\n  const result = new Map<number, JudgeVerdict>();\n  const expectedSet = new Set(expectedIndices);\n\n  try {\n    // Try direct parse first, then fall back to JSON extraction\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(raw);\n    } catch {\n      const candidates = extractJsonCandidates(raw);\n      if (candidates.length > 0) {\n        parsed = JSON.parse(candidates[0]);\n      }\n    }\n\n    if (!Array.isArray(parsed)) {\n      // Might be wrapped in an object with a key\n      if (parsed && typeof parsed === \"object\" && !Array.isArray(parsed)) {\n        const values = Object.values(parsed as Record<string, unknown>);\n        for (const v of values) {\n          if (Array.isArray(v)) {\n            parsed = v;\n            break;\n          }\n        }\n      }\n      if (!Array.isArray(parsed)) {\n        log.debug(\"extraction-judge: response is not an array, cannot parse\");\n        return result;\n      }\n    }\n\n    for (const item of parsed) {\n      if (\n        typeof item !== \"object\" ||\n        item === null ||\n        typeof (item as any).index !== \"number\"\n      ) {\n        continue;\n      }\n      const idx = (item as any).index as number;\n      if (!expectedSet.has(idx)) continue;\n\n      const durable =\n        typeof (item as any).durable === \"boolean\"\n          ? (item as any).durable\n          : true; // fail-open\n      const reason =\n        typeof (item as any).reason === \"string\"\n          ? ((item as any).reason as string).slice(0, 120)\n          : \"No reason provided\";\n\n      result.set(idx, { durable, reason });\n    }\n  } catch (err) {\n    log.debug(\n      `extraction-judge: failed to parse response: ${err instanceof Error ? err.message : String(err)}`,\n    );\n  }\n\n  return result;\n}\n\n// ---------------------------------------------------------------------------\n// Cache management (exposed for testing)\n// ---------------------------------------------------------------------------\n\n/** Clear the in-memory default verdict cache. Primarily for tests. */\nexport function clearVerdictCache(): void {\n  defaultVerdictCache.clear();\n}\n\n/** Return the current default verdict cache size. Primarily for tests. */\nexport function verdictCacheSize(): number {\n  return defaultVerdictCache.size;\n}\n\n/** Create a new per-instance verdict cache. Orchestrators should hold one. */\nexport function createVerdictCache(): Map<string, JudgeVerdict> {\n  return new Map();\n}\n"],"mappings":";;;;;;;;;;;AAeA,SAAS,kBAAkB;AAwC3B,IAAM,sBAAsB;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;AAuC5B,IAAM,yBAAyB;AAG/B,IAAM,sBAAsB,oBAAI,IAA0B;AAE1D,SAAS,SAAS,MAAc,UAA0B;AACxD,SAAO,WAAW,QAAQ,EAAE,OAAO,GAAG,IAAI,KAAK,QAAQ,EAAE,EAAE,OAAO,KAAK;AACzE;AAOA,SAAS,oBAAoB,OAAwC;AACnE,MAAI,MAAM,QAAQ,uBAAwB;AAC1C,QAAM,cAAc,KAAK,MAAM,MAAM,OAAO,CAAC;AAC7C,MAAI,UAAU;AACd,aAAW,OAAO,MAAM,KAAK,GAAG;AAC9B,QAAI,WAAW,YAAa;AAC5B,UAAM,OAAO,GAAG;AAChB;AAAA,EACF;AACF;AAMA,IAAM,0BAA0B,oBAAI,IAAI,CAAC,cAAc,WAAW,CAAC;AAGnE,IAAM,uBACJ;AAMK,SAAS,4BAA4B,OAG3B;AACf,QAAM,QAAQ,wBAAwB,MAAM,cAAc;AAC1D,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO,EAAE,SAAS,OAAO,QAAQ,qDAAqD;AAAA,EACxF;AACA,QAAM,WAAW,CAAC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,EAAE,YAAY;AACtF,MAAI,CAAC,qBAAqB,KAAK,QAAQ,GAAG;AACxC,WAAO,EAAE,SAAS,OAAO,QAAQ,8CAA8C;AAAA,EACjF;AACA,SAAO,EAAE,SAAS,MAAM,QAAQ,gCAAgC;AAClE;AAcA,eAAsB,oBACpB,YACA,QACA,UACA,aACA,OAC2B;AAC3B,QAAM,UAAU,KAAK,IAAI;AACzB,QAAM,WAAW,oBAAI,IAA0B;AAC/C,MAAI,SAAS;AACb,MAAI,SAAS;AAIb,QAAM,eAAe,SAAS;AAE9B,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO,EAAE,UAAU,QAAQ,QAAQ,SAAS,EAAE;AAAA,EAChD;AAGA,QAAM,iBAA2B,CAAC;AAElC,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,UAAM,IAAI,WAAW,CAAC;AAGtB,QAAI,wBAAwB,IAAI,EAAE,QAAQ,GAAG;AAC3C,eAAS,IAAI,GAAG;AAAA,QACd,SAAS;AAAA,QACT,QAAQ,kBAAkB,EAAE,QAAQ;AAAA,MACtC,CAAC;AACD;AAAA,IACF;AAGA,QAAI,EAAE,oBAAoB,YAAY;AACpC,eAAS,IAAI,GAAG;AAAA,QACd,SAAS;AAAA,QACT,QAAQ;AAAA,MACV,CAAC;AACD;AAAA,IACF;AAGA,UAAM,MAAM,SAAS,EAAE,MAAM,EAAE,QAAQ;AACvC,UAAM,gBAAgB,aAAa,IAAI,GAAG;AAC1C,QAAI,eAAe;AACjB,eAAS,IAAI,GAAG,aAAa;AAC7B;AACA;AAAA,IACF;AAEA,mBAAe,KAAK,CAAC;AAAA,EACvB;AAGA,MAAI,eAAe,WAAW,GAAG;AAC/B,WAAO,EAAE,UAAU,QAAQ,QAAQ,SAAS,KAAK,IAAI,IAAI,QAAQ;AAAA,EACnE;AAGA,QAAM,YAAY,OAAO;AACzB,WAAS,aAAa,GAAG,aAAa,eAAe,QAAQ,cAAc,WAAW;AACpF,UAAM,eAAe,eAAe,MAAM,YAAY,aAAa,SAAS;AAC5E,UAAM,eAAe,aAAa,IAAI,CAAC,SAAS;AAAA,MAC9C,OAAO;AAAA,MACP,MAAM,WAAW,GAAG,EAAE;AAAA,MACtB,UAAU,WAAW,GAAG,EAAE;AAAA,MAC1B,YAAY,WAAW,GAAG,EAAE;AAAA,IAC9B,EAAE;AAEF,UAAM,aAAa,KAAK,UAAU,YAAY;AAE9C,QAAI;AACF,YAAM,cAAc,MAAM;AAAA,QACxB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAEA,UAAI,aAAa;AACf,cAAM,SAAS,mBAAmB,aAAa,YAAY;AAC3D,mBAAW,CAAC,KAAK,OAAO,KAAK,OAAO,QAAQ,GAAG;AAC7C,mBAAS,IAAI,KAAK,OAAO;AACzB;AAEA,gBAAM,IAAI,WAAW,GAAG;AACxB,uBAAa,IAAI,SAAS,EAAE,MAAM,EAAE,QAAQ,GAAG,OAAO;AAAA,QACxD;AAEA,4BAAoB,YAAY;AAAA,MAClC;AAAA,IACF,SAAS,KAAK;AAEZ,UAAI;AAAA,QACF,mEAAmE,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACrH;AAAA,IACF;AAGA,eAAW,OAAO,cAAc;AAC9B,UAAI,CAAC,SAAS,IAAI,GAAG,GAAG;AACtB,iBAAS,IAAI,KAAK;AAAA,UAChB,SAAS;AAAA,UACT,QAAQ;AAAA,QACV,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,UAAU,QAAQ,QAAQ,SAAS,KAAK,IAAI,IAAI,QAAQ;AACnE;AAMA,eAAe,aACb,YACA,QACA,UACA,aACwB;AACxB,QAAM,WAAgE;AAAA,IACpE,EAAE,MAAM,UAAU,SAAS,oBAAoB;AAAA,IAC/C,EAAE,MAAM,QAAQ,SAAS,WAAW;AAAA,EACtC;AAEA,QAAM,gBAAgB,OAAO,wBAAwB;AAKrD,QAAM,YAAY,OAAO,gBAAgB;AAKzC,QAAM,UACJ,OAAO,gBAAgB,YAClB,OAAO,kBAAkB,SAC1B;AAGN,MAAI,YAAY,CAAC,WAAW;AAC1B,QAAI;AACF,YAAM,SAAS,MAAO,SAAiB,eAAe,UAAU;AAAA,QAC9D,aAAa;AAAA,QACb,WAAW;AAAA,QACX,gBAAgB,EAAE,MAAM,cAAc;AAAA,QACtC,WAAW;AAAA,QACX,WAAW;AAAA,QACX,GAAI,gBAAgB,EAAE,OAAO,cAAc,IAAI,CAAC;AAAA,MAClD,CAAC;AACD,UAAI,QAAQ,SAAS;AACnB,eAAO,OAAO;AAAA,MAChB;AAAA,IACF,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,wDAAwD,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC1G;AAAA,IACF;AAAA,EACF;AAGA,MAAI,aAAa;AACf,QAAI;AACF,YAAM,SAAS,MAAM,YAAY;AAAA,QAC/B;AAAA,QACA;AAAA,UACE,aAAa;AAAA,UACb,WAAW;AAAA,UACX,WAAW;AAAA,UACX,GAAI,gBAAgB,EAAE,OAAO,cAAc,IAAI,CAAC;AAAA,UAChD,GAAI,UAAU,EAAE,QAAQ,IAAI,CAAC;AAAA,QAC/B;AAAA,MACF;AACA,UAAI,QAAQ,SAAS;AACnB,eAAO,OAAO;AAAA,MAChB;AAAA,IACF,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,0CAA0C,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC5F;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAMA,SAAS,mBACP,KACA,iBAC2B;AAC3B,QAAM,SAAS,oBAAI,IAA0B;AAC7C,QAAM,cAAc,IAAI,IAAI,eAAe;AAE3C,MAAI;AAEF,QAAI;AACJ,QAAI;AACF,eAAS,KAAK,MAAM,GAAG;AAAA,IACzB,QAAQ;AACN,YAAM,aAAa,sBAAsB,GAAG;AAC5C,UAAI,WAAW,SAAS,GAAG;AACzB,iBAAS,KAAK,MAAM,WAAW,CAAC,CAAC;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAE1B,UAAI,UAAU,OAAO,WAAW,YAAY,CAAC,MAAM,QAAQ,MAAM,GAAG;AAClE,cAAM,SAAS,OAAO,OAAO,MAAiC;AAC9D,mBAAW,KAAK,QAAQ;AACtB,cAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,qBAAS;AACT;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC1B,YAAI,MAAM,0DAA0D;AACpE,eAAO;AAAA,MACT;AAAA,IACF;AAEA,eAAW,QAAQ,QAAQ;AACzB,UACE,OAAO,SAAS,YAChB,SAAS,QACT,OAAQ,KAAa,UAAU,UAC/B;AACA;AAAA,MACF;AACA,YAAM,MAAO,KAAa;AAC1B,UAAI,CAAC,YAAY,IAAI,GAAG,EAAG;AAE3B,YAAM,UACJ,OAAQ,KAAa,YAAY,YAC5B,KAAa,UACd;AACN,YAAM,SACJ,OAAQ,KAAa,WAAW,WAC1B,KAAa,OAAkB,MAAM,GAAG,GAAG,IAC7C;AAEN,aAAO,IAAI,KAAK,EAAE,SAAS,OAAO,CAAC;AAAA,IACrC;AAAA,EACF,SAAS,KAAK;AACZ,QAAI;AAAA,MACF,+CAA+C,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,IACjG;AAAA,EACF;AAEA,SAAO;AACT;AAOO,SAAS,oBAA0B;AACxC,sBAAoB,MAAM;AAC5B;AAGO,SAAS,mBAA2B;AACzC,SAAO,oBAAoB;AAC7B;AAGO,SAAS,qBAAgD;AAC9D,SAAO,oBAAI,IAAI;AACjB;","names":[]}

package/dist/chunk-LK6SGL53.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/runtime/child-process.ts"],"sourcesContent":["import { createRequire } from \"node:module\";\nimport type {\n  ChildProcess as NodeChildProcess,\n  SpawnOptions,\n  SpawnSyncOptionsWithStringEncoding,\n  SpawnSyncReturns,\n} from \"node:child_process\";\n\nconst require = createRequire(import.meta.url);\n\ntype ChildProcessModule = typeof import(\"node:child_process\");\n\nfunction loadModule(): ChildProcessModule {\n  return require(\"node:child_process\") as ChildProcessModule;\n}\n\nexport type CommandChildProcess = NodeChildProcess;\n\nexport function launchProcess(\n  command: string,\n  args: string[],\n  options?: SpawnOptions,\n): CommandChildProcess {\n  const moduleApi = loadModule();\n  const launch = moduleApi[\"spawn\"] as (\n    command: string,\n    args?: readonly string[],\n    options?: SpawnOptions,\n  ) => CommandChildProcess;\n  return launch(command, args, options);\n}\n\nexport function launchProcessSync(\n  command: string,\n  args: string[],\n  options: SpawnSyncOptionsWithStringEncoding,\n): SpawnSyncReturns<string> {\n  const moduleApi = loadModule();\n  const launchSync = moduleApi[\"spawnSync\"] as (\n    command: string,\n    args: readonly string[],\n    options: SpawnSyncOptionsWithStringEncoding,\n  ) => SpawnSyncReturns<string>;\n  return launchSync(command, args, options);\n}\n"],"mappings":";AAAA,SAAS,qBAAqB;AAQ9B,IAAMA,WAAU,cAAc,YAAY,GAAG;AAI7C,SAAS,aAAiC;AACxC,SAAOA,SAAQ,oBAAoB;AACrC;AAIO,SAAS,cACd,SACA,MACA,SACqB;AACrB,QAAM,YAAY,WAAW;AAC7B,QAAM,SAAS,UAAU,OAAO;AAKhC,SAAO,OAAO,SAAS,MAAM,OAAO;AACtC;AAEO,SAAS,kBACd,SACA,MACA,SAC0B;AAC1B,QAAM,YAAY,WAAW;AAC7B,QAAM,aAAa,UAAU,WAAW;AAKxC,SAAO,WAAW,SAAS,MAAM,OAAO;AAC1C;","names":["require"]}