bilmem 0.1.0

package/dist/jev/index.d.ts

@@ -0,0 +1,32 @@
+import { S as Scope, K as Knowledge, J as JevResult } from '../types-Nxq5Gzay.js';
+
+interface QueryContext {
+    query?: string;
+    positive?: string[];
+    negative?: string[];
+    scope?: Scope;
+}
+/**
+ * Evaluates JEV-style positive and negative contextual proximity for a knowledge unit.
+ */
+declare function evaluateJev(knowledge: Knowledge, context: QueryContext): JevResult;
+
+/**
+ * Re-ranks a small set of candidate knowledge units using JEV contextual evaluation.
+ */
+declare function rerankCandidates(candidates: Knowledge[], context: QueryContext): JevResult[];
+
+/**
+ * Formats a JevResult into a clear, inspectable explanation string.
+ */
+declare function formatJevExplanation(result: JevResult): string;
+/**
+ * Formats full "bilmem why <id>" detailed output.
+ */
+declare function formatWhyExplanation(knowledge: Knowledge): string;
+/**
+ * Formats lifecycle history for "bilmem why <id> --history".
+ */
+declare function formatWhyHistory(knowledge: Knowledge): string;
+
+export { type QueryContext, evaluateJev, formatJevExplanation, formatWhyExplanation, formatWhyHistory, rerankCandidates };

package/dist/jev/index.js

@@ -0,0 +1,269 @@
+// src/jev/scorer.ts
+var statementTokenCache = /* @__PURE__ */ new WeakMap();
+function extractTokens(text) {
+  if (!text) return /* @__PURE__ */ new Set();
+  return new Set(
+    text.toLowerCase().replace(/[^a-z0-9_-]/g, " ").split(/\s+/).filter((t) => t.length > 2)
+  );
+}
+function getKnowledgeStatementTokens(k) {
+  let tokens = statementTokenCache.get(k);
+  if (!tokens) {
+    tokens = extractTokens(k.statement);
+    statementTokenCache.set(k, tokens);
+  }
+  return tokens;
+}
+function evaluateJev(knowledge, context) {
+  const queryTokens = extractTokens(context.query);
+  const contextPos = new Set((context.positive ?? []).map((p) => p.trim().toLowerCase()));
+  const contextNeg = new Set((context.negative ?? []).map((n) => n.trim().toLowerCase()));
+  const knowPos = new Set((knowledge.positive ?? []).map((p) => p.trim().toLowerCase()));
+  const knowNeg = new Set((knowledge.negative ?? []).map((n) => n.trim().toLowerCase()));
+  const negativeConflicts = [];
+  for (const n of knowNeg) {
+    if (contextPos.has(n) || queryTokens.has(n)) {
+      negativeConflicts.push(`Knowledge forbids "${n}", which was present in context`);
+    }
+  }
+  for (const p of knowPos) {
+    if (contextNeg.has(p)) {
+      negativeConflicts.push(`Context forbids "${p}", which is required by knowledge`);
+    }
+  }
+  const positiveMatches = [];
+  for (const p of knowPos) {
+    if (contextPos.has(p)) {
+      positiveMatches.push(`Context cue: ${p}`);
+    } else {
+      for (const q of queryTokens) {
+        if (p === q || p.startsWith(q) || q.startsWith(p)) {
+          positiveMatches.push(`Query term match: ${p}`);
+          break;
+        }
+      }
+    }
+  }
+  const stmtTokens = getKnowledgeStatementTokens(knowledge);
+  let queryOverlapCount = 0;
+  for (const q of queryTokens) {
+    let matched = false;
+    for (const st of stmtTokens) {
+      if (q === st || q.startsWith(st) || st.startsWith(q)) {
+        matched = true;
+        break;
+      }
+    }
+    if (matched) {
+      queryOverlapCount++;
+      positiveMatches.push(`Statement term: ${q}`);
+    }
+  }
+  const totalCues = Math.max(1, knowPos.size);
+  const matchedCuesCount = positiveMatches.filter((m2) => m2.startsWith("Context cue") || m2.startsWith("Query term")).length;
+  const cueMatchRatio = matchedCuesCount / totalCues;
+  const tokenOverlapScore = queryTokens.size > 0 ? queryOverlapCount / Math.max(1, queryTokens.size) : 0;
+  const rawPositiveScore = 0.65 * cueMatchRatio + 0.35 * tokenOverlapScore;
+  let scopeMultiplier = 1;
+  const targetScope = (context.scope ?? "project").toLowerCase();
+  const knowScope = (knowledge.scope ?? "project").toLowerCase();
+  if (targetScope === knowScope) {
+    scopeMultiplier = 1;
+  } else if (knowScope === "global" || targetScope.startsWith(knowScope)) {
+    scopeMultiplier = 0.85;
+  } else if (knowScope === "project" && targetScope.startsWith("branch:")) {
+    scopeMultiplier = 0.9;
+  } else {
+    scopeMultiplier = 0.3;
+  }
+  const m = knowledge.metrics;
+  const evRatio = (m.support_count + 1) / (m.support_count + 2 * m.contradiction_count + 1);
+  const confidenceFactor = knowledge.confidence * evRatio;
+  let outcomeAdjustment = 0;
+  if (m.successful_outcomes > 0) {
+    outcomeAdjustment += Math.min(0.1, m.successful_outcomes * 0.03);
+  }
+  if (m.failed_outcomes > 0) {
+    outcomeAdjustment -= Math.min(0.2, m.failed_outcomes * 0.05);
+  }
+  let score = (rawPositiveScore * 0.45 + confidenceFactor * 0.4 + outcomeAdjustment) * scopeMultiplier;
+  if (knowledge.status === "stale") {
+    score *= 0.6;
+  } else if (knowledge.status === "contradicted") {
+    score *= 0.3;
+  } else if (knowledge.status === "invalid" || knowledge.status === "superseded") {
+    score *= 0.1;
+  }
+  let status = "POSSIBLE";
+  const reasons = [];
+  if (negativeConflicts.length > 0) {
+    score = Math.max(0.01, score * 0.2);
+    status = "REJECT";
+    reasons.push(`Rejected due to ${negativeConflicts.length} negative contextual conflicts.`);
+  } else if (score >= 0.45 && positiveMatches.length > 0) {
+    status = "MATCH";
+    reasons.push(`Strong contextual match with ${positiveMatches.length} matching signals.`);
+  } else if (score >= 0.25) {
+    status = "POSSIBLE";
+    reasons.push(`Potential match; partial contextual overlap.`);
+  } else {
+    status = "REJECT";
+    reasons.push(`Insufficient contextual match score (${score.toFixed(2)} < 0.25).`);
+  }
+  const finalScore = Math.round(Math.min(1, Math.max(0, score)) * 100) / 100;
+  const explanation = {
+    positiveMatches,
+    negativeConflicts,
+    score: finalScore,
+    confidence: knowledge.confidence,
+    status,
+    reasons
+  };
+  return {
+    knowledge,
+    status,
+    score: finalScore,
+    explanation
+  };
+}
+
+// src/jev/matcher.ts
+function rerankCandidates(candidates, context) {
+  const results = [];
+  for (const candidate of candidates) {
+    const res = evaluateJev(candidate, context);
+    results.push(res);
+  }
+  const statusPriority = {
+    MATCH: 3,
+    POSSIBLE: 2,
+    REJECT: 1
+  };
+  results.sort((a, b) => {
+    const prioDiff = (statusPriority[b.status] ?? 0) - (statusPriority[a.status] ?? 0);
+    if (prioDiff !== 0) return prioDiff;
+    const scoreDiff = b.score - a.score;
+    if (Math.abs(scoreDiff) > 1e-3) return scoreDiff;
+    return b.knowledge.confidence - a.knowledge.confidence;
+  });
+  return results;
+}
+
+// src/jev/explanation.ts
+function formatJevExplanation(result) {
+  const k = result.knowledge;
+  const exp = result.explanation;
+  const lines = [
+    `${exp.status}: ${k.id} (Score: ${exp.score.toFixed(2)})`,
+    ""
+  ];
+  lines.push("positive:");
+  if (exp.positiveMatches.length > 0) {
+    for (const p of exp.positiveMatches) {
+      lines.push(`  + ${p}`);
+    }
+  } else {
+    lines.push("  none");
+  }
+  lines.push("");
+  lines.push("negative conflicts:");
+  if (exp.negativeConflicts.length > 0) {
+    for (const n of exp.negativeConflicts) {
+      lines.push(`  - ${n}`);
+    }
+  } else {
+    lines.push("  none");
+  }
+  lines.push("");
+  lines.push(`confidence:`);
+  lines.push(`  ${k.confidence.toFixed(2)}`);
+  if (exp.reasons.length > 0) {
+    lines.push("");
+    lines.push(`rationale:`);
+    for (const r of exp.reasons) {
+      lines.push(`  \u2022 ${r}`);
+    }
+  }
+  return lines.join("\n");
+}
+function formatWhyExplanation(knowledge) {
+  const lines = [
+    `${knowledge.id}`,
+    "",
+    "Statement:",
+    knowledge.statement,
+    "",
+    "Evidence:"
+  ];
+  if (knowledge.evidence.length > 0) {
+    for (const e of knowledge.evidence) {
+      lines.push(`- ${e}`);
+    }
+  } else {
+    lines.push("- (No direct source references recorded)");
+  }
+  lines.push("");
+  lines.push(`Supports: ${knowledge.metrics.support_count}`);
+  lines.push(`Contradictions: ${knowledge.metrics.contradiction_count}`);
+  lines.push(`Outcomes: ${knowledge.metrics.successful_outcomes} success, ${knowledge.metrics.failed_outcomes} failed`);
+  lines.push(`Confidence: ${knowledge.confidence.toFixed(2)}`);
+  lines.push(`Scope: ${knowledge.scope}`);
+  lines.push(`Status: ${knowledge.status}`);
+  if (knowledge.positive.length > 0) {
+    lines.push("");
+    lines.push("Applicable because (positive cues):");
+    for (const p of knowledge.positive) {
+      lines.push(`+ ${p}`);
+    }
+  }
+  if (knowledge.negative.length > 0) {
+    lines.push("");
+    lines.push("Rejected contexts (negative cues):");
+    for (const n of knowledge.negative) {
+      lines.push(`- ${n}`);
+    }
+  }
+  if (knowledge.relations.length > 0) {
+    lines.push("");
+    lines.push("Relations:");
+    for (const r of knowledge.relations) {
+      lines.push(`~ ${r}`);
+    }
+  }
+  if (knowledge.temporal?.revision) {
+    lines.push("");
+    lines.push(`Revision: ${knowledge.temporal.revision}`);
+  }
+  return lines.join("\n");
+}
+function formatWhyHistory(knowledge) {
+  const lines = [knowledge.id, ""];
+  if (!knowledge.history || knowledge.history.length === 0) {
+    const date = knowledge.createdAt ? knowledge.createdAt.split("T")[0] : "unknown";
+    const stageOrStatus = (knowledge.stage || knowledge.status).toUpperCase();
+    lines.push(date);
+    lines.push(stageOrStatus);
+    lines.push(knowledge.statement);
+    return lines.join("\n");
+  }
+  for (let i = 0; i < knowledge.history.length; i++) {
+    const entry = knowledge.history[i];
+    const date = entry.timestamp ? entry.timestamp.split("T")[0] : "unknown";
+    const stageOrStatus = (entry.stage || entry.status).toUpperCase();
+    lines.push(date);
+    lines.push(stageOrStatus);
+    lines.push(entry.reason || entry.source || "Updated");
+    if (i < knowledge.history.length - 1) {
+      lines.push("");
+    }
+  }
+  return lines.join("\n");
+}
+export {
+  evaluateJev,
+  formatJevExplanation,
+  formatWhyExplanation,
+  formatWhyHistory,
+  rerankCandidates
+};
+//# sourceMappingURL=index.js.map

package/dist/jev/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/jev/scorer.ts","../../src/jev/matcher.ts","../../src/jev/explanation.ts"],"sourcesContent":["import type {\n  Knowledge,\n  JevMatchStatus,\n  JevExplanation,\n  JevResult,\n  Scope\n} from '../core/types.js';\n\nexport interface QueryContext {\n  query?: string;\n  positive?: string[];\n  negative?: string[];\n  scope?: Scope;\n}\n\nconst statementTokenCache = new WeakMap<Knowledge, Set<string>>();\n\nfunction extractTokens(text?: string): Set<string> {\n  if (!text) return new Set();\n  return new Set(\n    text\n      .toLowerCase()\n      .replace(/[^a-z0-9_-]/g, ' ')\n      .split(/\\s+/)\n      .filter((t) => t.length > 2)\n  );\n}\n\nfunction getKnowledgeStatementTokens(k: Knowledge): Set<string> {\n  let tokens = statementTokenCache.get(k);\n  if (!tokens) {\n    tokens = extractTokens(k.statement);\n    statementTokenCache.set(k, tokens);\n  }\n  return tokens;\n}\n\n/**\n * Evaluates JEV-style positive and negative contextual proximity for a knowledge unit.\n */\nexport function evaluateJev(\n  knowledge: Knowledge,\n  context: QueryContext\n): JevResult {\n  const queryTokens = extractTokens(context.query);\n  const contextPos = new Set((context.positive ?? []).map((p) => p.trim().toLowerCase()));\n  const contextNeg = new Set((context.negative ?? []).map((n) => n.trim().toLowerCase()));\n\n  const knowPos = new Set((knowledge.positive ?? []).map((p) => p.trim().toLowerCase()));\n  const knowNeg = new Set((knowledge.negative ?? []).map((n) => n.trim().toLowerCase()));\n\n  // 1. Negative Conflict Detection\n  const negativeConflicts: string[] = [];\n\n  // Knowledge forbids something present in positive context\n  for (const n of knowNeg) {\n    if (contextPos.has(n) || queryTokens.has(n)) {\n      negativeConflicts.push(`Knowledge forbids \"${n}\", which was present in context`);\n    }\n  }\n\n  // Context forbids something present in knowledge\n  for (const p of knowPos) {\n    if (contextNeg.has(p)) {\n      negativeConflicts.push(`Context forbids \"${p}\", which is required by knowledge`);\n    }\n  }\n\n  // 2. Positive Matches\n  const positiveMatches: string[] = [];\n\n  // Direct cue overlap\n  for (const p of knowPos) {\n    if (contextPos.has(p)) {\n      positiveMatches.push(`Context cue: ${p}`);\n    } else {\n      // Check if any query token matches or stems into cue\n      for (const q of queryTokens) {\n        if (p === q || p.startsWith(q) || q.startsWith(p)) {\n          positiveMatches.push(`Query term match: ${p}`);\n          break;\n        }\n      }\n    }\n  }\n\n  // Statement query token overlap\n  const stmtTokens = getKnowledgeStatementTokens(knowledge);\n  let queryOverlapCount = 0;\n  for (const q of queryTokens) {\n    let matched = false;\n    for (const st of stmtTokens) {\n      if (q === st || q.startsWith(st) || st.startsWith(q)) {\n        matched = true;\n        break;\n      }\n    }\n    if (matched) {\n      queryOverlapCount++;\n      positiveMatches.push(`Statement term: ${q}`);\n    }\n  }\n\n  // 3. Positive Score Calculation\n  const totalCues = Math.max(1, knowPos.size);\n  const matchedCuesCount = positiveMatches.filter((m) => m.startsWith('Context cue') || m.startsWith('Query term')).length;\n  const cueMatchRatio = matchedCuesCount / totalCues;\n  const tokenOverlapScore = queryTokens.size > 0 ? queryOverlapCount / Math.max(1, queryTokens.size) : 0;\n  const rawPositiveScore = 0.65 * cueMatchRatio + 0.35 * tokenOverlapScore;\n\n  // 4. Scope Alignment\n  let scopeMultiplier = 1.0;\n  const targetScope = (context.scope ?? 'project').toLowerCase();\n  const knowScope = (knowledge.scope ?? 'project').toLowerCase();\n\n  if (targetScope === knowScope) {\n    scopeMultiplier = 1.0;\n  } else if (knowScope === 'global' || targetScope.startsWith(knowScope)) {\n    scopeMultiplier = 0.85;\n  } else if (knowScope === 'project' && targetScope.startsWith('branch:')) {\n    scopeMultiplier = 0.90;\n  } else {\n    // Mismatched scopes\n    scopeMultiplier = 0.30;\n  }\n\n  // 5. Confidence and Evidence Ratio\n  const m = knowledge.metrics;\n  const evRatio = (m.support_count + 1) / (m.support_count + 2 * m.contradiction_count + 1);\n  const confidenceFactor = knowledge.confidence * evRatio;\n\n  // 6. Outcome Boost / Penalty\n  let outcomeAdjustment = 0;\n  if (m.successful_outcomes > 0) {\n    outcomeAdjustment += Math.min(0.10, m.successful_outcomes * 0.03);\n  }\n  if (m.failed_outcomes > 0) {\n    outcomeAdjustment -= Math.min(0.20, m.failed_outcomes * 0.05);\n  }\n\n  // 7. Base Combined Score\n  let score = (rawPositiveScore * 0.45 + confidenceFactor * 0.40 + outcomeAdjustment) * scopeMultiplier;\n\n  // Stale or Contradicted Status Penalty\n  if (knowledge.status === 'stale') {\n    score *= 0.6;\n  } else if (knowledge.status === 'contradicted') {\n    score *= 0.3;\n  } else if (knowledge.status === 'invalid' || knowledge.status === 'superseded') {\n    score *= 0.1;\n  }\n\n  // 8. Negative Conflict Penalty & Decision\n  let status: JevMatchStatus = 'POSSIBLE';\n  const reasons: string[] = [];\n\n  if (negativeConflicts.length > 0) {\n    // Severe penalty for negative conflicts\n    score = Math.max(0.01, score * 0.2);\n    status = 'REJECT';\n    reasons.push(`Rejected due to ${negativeConflicts.length} negative contextual conflicts.`);\n  } else if (score >= 0.45 && positiveMatches.length > 0) {\n    status = 'MATCH';\n    reasons.push(`Strong contextual match with ${positiveMatches.length} matching signals.`);\n  } else if (score >= 0.25) {\n    status = 'POSSIBLE';\n    reasons.push(`Potential match; partial contextual overlap.`);\n  } else {\n    status = 'REJECT';\n    reasons.push(`Insufficient contextual match score (${score.toFixed(2)} < 0.25).`);\n  }\n\n  const finalScore = Math.round(Math.min(1.0, Math.max(0.0, score)) * 100) / 100;\n\n  const explanation: JevExplanation = {\n    positiveMatches,\n    negativeConflicts,\n    score: finalScore,\n    confidence: knowledge.confidence,\n    status,\n    reasons\n  };\n\n  return {\n    knowledge,\n    status,\n    score: finalScore,\n    explanation\n  };\n}\n","import type { Knowledge, JevResult } from '../core/types.js';\nimport { evaluateJev, type QueryContext } from './scorer.js';\n\n/**\n * Re-ranks a small set of candidate knowledge units using JEV contextual evaluation.\n */\nexport function rerankCandidates(\n  candidates: Knowledge[],\n  context: QueryContext\n): JevResult[] {\n  const results: JevResult[] = [];\n\n  for (const candidate of candidates) {\n    const res = evaluateJev(candidate, context);\n    results.push(res);\n  }\n\n  // Sort: MATCH first, then POSSIBLE, then REJECT; within each group, highest score first\n  const statusPriority: Record<string, number> = {\n    MATCH: 3,\n    POSSIBLE: 2,\n    REJECT: 1\n  };\n\n  results.sort((a, b) => {\n    const prioDiff = (statusPriority[b.status] ?? 0) - (statusPriority[a.status] ?? 0);\n    if (prioDiff !== 0) return prioDiff;\n    const scoreDiff = b.score - a.score;\n    if (Math.abs(scoreDiff) > 0.001) return scoreDiff;\n    return b.knowledge.confidence - a.knowledge.confidence;\n  });\n\n  return results;\n}\n","import type { JevResult, Knowledge } from '../core/types.js';\n\n/**\n * Formats a JevResult into a clear, inspectable explanation string.\n */\nexport function formatJevExplanation(result: JevResult): string {\n  const k = result.knowledge;\n  const exp = result.explanation;\n\n  const lines: string[] = [\n    `${exp.status}: ${k.id} (Score: ${exp.score.toFixed(2)})`,\n    ''\n  ];\n\n  lines.push('positive:');\n  if (exp.positiveMatches.length > 0) {\n    for (const p of exp.positiveMatches) {\n      lines.push(`  + ${p}`);\n    }\n  } else {\n    lines.push('  none');\n  }\n\n  lines.push('');\n  lines.push('negative conflicts:');\n  if (exp.negativeConflicts.length > 0) {\n    for (const n of exp.negativeConflicts) {\n      lines.push(`  - ${n}`);\n    }\n  } else {\n    lines.push('  none');\n  }\n\n  lines.push('');\n  lines.push(`confidence:`);\n  lines.push(`  ${k.confidence.toFixed(2)}`);\n\n  if (exp.reasons.length > 0) {\n    lines.push('');\n    lines.push(`rationale:`);\n    for (const r of exp.reasons) {\n      lines.push(`  • ${r}`);\n    }\n  }\n\n  return lines.join('\\n');\n}\n\n/**\n * Formats full \"bilmem why <id>\" detailed output.\n */\nexport function formatWhyExplanation(knowledge: Knowledge): string {\n  const lines: string[] = [\n    `${knowledge.id}`,\n    '',\n    'Statement:',\n    knowledge.statement,\n    '',\n    'Evidence:'\n  ];\n\n  if (knowledge.evidence.length > 0) {\n    for (const e of knowledge.evidence) {\n      lines.push(`- ${e}`);\n    }\n  } else {\n    lines.push('- (No direct source references recorded)');\n  }\n\n  lines.push('');\n  lines.push(`Supports: ${knowledge.metrics.support_count}`);\n  lines.push(`Contradictions: ${knowledge.metrics.contradiction_count}`);\n  lines.push(`Outcomes: ${knowledge.metrics.successful_outcomes} success, ${knowledge.metrics.failed_outcomes} failed`);\n  lines.push(`Confidence: ${knowledge.confidence.toFixed(2)}`);\n  lines.push(`Scope: ${knowledge.scope}`);\n  lines.push(`Status: ${knowledge.status}`);\n\n  if (knowledge.positive.length > 0) {\n    lines.push('');\n    lines.push('Applicable because (positive cues):');\n    for (const p of knowledge.positive) {\n      lines.push(`+ ${p}`);\n    }\n  }\n\n  if (knowledge.negative.length > 0) {\n    lines.push('');\n    lines.push('Rejected contexts (negative cues):');\n    for (const n of knowledge.negative) {\n      lines.push(`- ${n}`);\n    }\n  }\n\n  if (knowledge.relations.length > 0) {\n    lines.push('');\n    lines.push('Relations:');\n    for (const r of knowledge.relations) {\n      lines.push(`~ ${r}`);\n    }\n  }\n\n  if (knowledge.temporal?.revision) {\n    lines.push('');\n    lines.push(`Revision: ${knowledge.temporal.revision}`);\n  }\n\n  return lines.join('\\n');\n}\n\n/**\n * Formats lifecycle history for \"bilmem why <id> --history\".\n */\nexport function formatWhyHistory(knowledge: Knowledge): string {\n  const lines: string[] = [knowledge.id, ''];\n\n  if (!knowledge.history || knowledge.history.length === 0) {\n    const date = knowledge.createdAt ? knowledge.createdAt.split('T')[0] : 'unknown';\n    const stageOrStatus = (knowledge.stage || knowledge.status).toUpperCase();\n    lines.push(date);\n    lines.push(stageOrStatus);\n    lines.push(knowledge.statement);\n    return lines.join('\\n');\n  }\n\n  for (let i = 0; i < knowledge.history.length; i++) {\n    const entry = knowledge.history[i];\n    const date = entry.timestamp ? entry.timestamp.split('T')[0] : 'unknown';\n    const stageOrStatus = (entry.stage || entry.status).toUpperCase();\n    lines.push(date);\n    lines.push(stageOrStatus);\n    lines.push(entry.reason || entry.source || 'Updated');\n    if (i < knowledge.history.length - 1) {\n      lines.push('');\n    }\n  }\n\n  return lines.join('\\n');\n}\n"],"mappings":";AAeA,IAAM,sBAAsB,oBAAI,QAAgC;AAEhE,SAAS,cAAc,MAA4B;AACjD,MAAI,CAAC,KAAM,QAAO,oBAAI,IAAI;AAC1B,SAAO,IAAI;AAAA,IACT,KACG,YAAY,EACZ,QAAQ,gBAAgB,GAAG,EAC3B,MAAM,KAAK,EACX,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAAA,EAC/B;AACF;AAEA,SAAS,4BAA4B,GAA2B;AAC9D,MAAI,SAAS,oBAAoB,IAAI,CAAC;AACtC,MAAI,CAAC,QAAQ;AACX,aAAS,cAAc,EAAE,SAAS;AAClC,wBAAoB,IAAI,GAAG,MAAM;AAAA,EACnC;AACA,SAAO;AACT;AAKO,SAAS,YACd,WACA,SACW;AACX,QAAM,cAAc,cAAc,QAAQ,KAAK;AAC/C,QAAM,aAAa,IAAI,KAAK,QAAQ,YAAY,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;AACtF,QAAM,aAAa,IAAI,KAAK,QAAQ,YAAY,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;AAEtF,QAAM,UAAU,IAAI,KAAK,UAAU,YAAY,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;AACrF,QAAM,UAAU,IAAI,KAAK,UAAU,YAAY,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;AAGrF,QAAM,oBAA8B,CAAC;AAGrC,aAAW,KAAK,SAAS;AACvB,QAAI,WAAW,IAAI,CAAC,KAAK,YAAY,IAAI,CAAC,GAAG;AAC3C,wBAAkB,KAAK,sBAAsB,CAAC,iCAAiC;AAAA,IACjF;AAAA,EACF;AAGA,aAAW,KAAK,SAAS;AACvB,QAAI,WAAW,IAAI,CAAC,GAAG;AACrB,wBAAkB,KAAK,oBAAoB,CAAC,mCAAmC;AAAA,IACjF;AAAA,EACF;AAGA,QAAM,kBAA4B,CAAC;AAGnC,aAAW,KAAK,SAAS;AACvB,QAAI,WAAW,IAAI,CAAC,GAAG;AACrB,sBAAgB,KAAK,gBAAgB,CAAC,EAAE;AAAA,IAC1C,OAAO;AAEL,iBAAW,KAAK,aAAa;AAC3B,YAAI,MAAM,KAAK,EAAE,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,GAAG;AACjD,0BAAgB,KAAK,qBAAqB,CAAC,EAAE;AAC7C;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,QAAM,aAAa,4BAA4B,SAAS;AACxD,MAAI,oBAAoB;AACxB,aAAW,KAAK,aAAa;AAC3B,QAAI,UAAU;AACd,eAAW,MAAM,YAAY;AAC3B,UAAI,MAAM,MAAM,EAAE,WAAW,EAAE,KAAK,GAAG,WAAW,CAAC,GAAG;AACpD,kBAAU;AACV;AAAA,MACF;AAAA,IACF;AACA,QAAI,SAAS;AACX;AACA,sBAAgB,KAAK,mBAAmB,CAAC,EAAE;AAAA,IAC7C;AAAA,EACF;AAGA,QAAM,YAAY,KAAK,IAAI,GAAG,QAAQ,IAAI;AAC1C,QAAM,mBAAmB,gBAAgB,OAAO,CAACA,OAAMA,GAAE,WAAW,aAAa,KAAKA,GAAE,WAAW,YAAY,CAAC,EAAE;AAClH,QAAM,gBAAgB,mBAAmB;AACzC,QAAM,oBAAoB,YAAY,OAAO,IAAI,oBAAoB,KAAK,IAAI,GAAG,YAAY,IAAI,IAAI;AACrG,QAAM,mBAAmB,OAAO,gBAAgB,OAAO;AAGvD,MAAI,kBAAkB;AACtB,QAAM,eAAe,QAAQ,SAAS,WAAW,YAAY;AAC7D,QAAM,aAAa,UAAU,SAAS,WAAW,YAAY;AAE7D,MAAI,gBAAgB,WAAW;AAC7B,sBAAkB;AAAA,EACpB,WAAW,cAAc,YAAY,YAAY,WAAW,SAAS,GAAG;AACtE,sBAAkB;AAAA,EACpB,WAAW,cAAc,aAAa,YAAY,WAAW,SAAS,GAAG;AACvE,sBAAkB;AAAA,EACpB,OAAO;AAEL,sBAAkB;AAAA,EACpB;AAGA,QAAM,IAAI,UAAU;AACpB,QAAM,WAAW,EAAE,gBAAgB,MAAM,EAAE,gBAAgB,IAAI,EAAE,sBAAsB;AACvF,QAAM,mBAAmB,UAAU,aAAa;AAGhD,MAAI,oBAAoB;AACxB,MAAI,EAAE,sBAAsB,GAAG;AAC7B,yBAAqB,KAAK,IAAI,KAAM,EAAE,sBAAsB,IAAI;AAAA,EAClE;AACA,MAAI,EAAE,kBAAkB,GAAG;AACzB,yBAAqB,KAAK,IAAI,KAAM,EAAE,kBAAkB,IAAI;AAAA,EAC9D;AAGA,MAAI,SAAS,mBAAmB,OAAO,mBAAmB,MAAO,qBAAqB;AAGtF,MAAI,UAAU,WAAW,SAAS;AAChC,aAAS;AAAA,EACX,WAAW,UAAU,WAAW,gBAAgB;AAC9C,aAAS;AAAA,EACX,WAAW,UAAU,WAAW,aAAa,UAAU,WAAW,cAAc;AAC9E,aAAS;AAAA,EACX;AAGA,MAAI,SAAyB;AAC7B,QAAM,UAAoB,CAAC;AAE3B,MAAI,kBAAkB,SAAS,GAAG;AAEhC,YAAQ,KAAK,IAAI,MAAM,QAAQ,GAAG;AAClC,aAAS;AACT,YAAQ,KAAK,mBAAmB,kBAAkB,MAAM,iCAAiC;AAAA,EAC3F,WAAW,SAAS,QAAQ,gBAAgB,SAAS,GAAG;AACtD,aAAS;AACT,YAAQ,KAAK,gCAAgC,gBAAgB,MAAM,oBAAoB;AAAA,EACzF,WAAW,SAAS,MAAM;AACxB,aAAS;AACT,YAAQ,KAAK,8CAA8C;AAAA,EAC7D,OAAO;AACL,aAAS;AACT,YAAQ,KAAK,wCAAwC,MAAM,QAAQ,CAAC,CAAC,WAAW;AAAA,EAClF;AAEA,QAAM,aAAa,KAAK,MAAM,KAAK,IAAI,GAAK,KAAK,IAAI,GAAK,KAAK,CAAC,IAAI,GAAG,IAAI;AAE3E,QAAM,cAA8B;AAAA,IAClC;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP,YAAY,UAAU;AAAA,IACtB;AAAA,IACA;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP;AAAA,EACF;AACF;;;ACvLO,SAAS,iBACd,YACA,SACa;AACb,QAAM,UAAuB,CAAC;AAE9B,aAAW,aAAa,YAAY;AAClC,UAAM,MAAM,YAAY,WAAW,OAAO;AAC1C,YAAQ,KAAK,GAAG;AAAA,EAClB;AAGA,QAAM,iBAAyC;AAAA,IAC7C,OAAO;AAAA,IACP,UAAU;AAAA,IACV,QAAQ;AAAA,EACV;AAEA,UAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,UAAM,YAAY,eAAe,EAAE,MAAM,KAAK,MAAM,eAAe,EAAE,MAAM,KAAK;AAChF,QAAI,aAAa,EAAG,QAAO;AAC3B,UAAM,YAAY,EAAE,QAAQ,EAAE;AAC9B,QAAI,KAAK,IAAI,SAAS,IAAI,KAAO,QAAO;AACxC,WAAO,EAAE,UAAU,aAAa,EAAE,UAAU;AAAA,EAC9C,CAAC;AAED,SAAO;AACT;;;AC5BO,SAAS,qBAAqB,QAA2B;AAC9D,QAAM,IAAI,OAAO;AACjB,QAAM,MAAM,OAAO;AAEnB,QAAM,QAAkB;AAAA,IACtB,GAAG,IAAI,MAAM,KAAK,EAAE,EAAE,YAAY,IAAI,MAAM,QAAQ,CAAC,CAAC;AAAA,IACtD;AAAA,EACF;AAEA,QAAM,KAAK,WAAW;AACtB,MAAI,IAAI,gBAAgB,SAAS,GAAG;AAClC,eAAW,KAAK,IAAI,iBAAiB;AACnC,YAAM,KAAK,OAAO,CAAC,EAAE;AAAA,IACvB;AAAA,EACF,OAAO;AACL,UAAM,KAAK,QAAQ;AAAA,EACrB;AAEA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,qBAAqB;AAChC,MAAI,IAAI,kBAAkB,SAAS,GAAG;AACpC,eAAW,KAAK,IAAI,mBAAmB;AACrC,YAAM,KAAK,OAAO,CAAC,EAAE;AAAA,IACvB;AAAA,EACF,OAAO;AACL,UAAM,KAAK,QAAQ;AAAA,EACrB;AAEA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,aAAa;AACxB,QAAM,KAAK,KAAK,EAAE,WAAW,QAAQ,CAAC,CAAC,EAAE;AAEzC,MAAI,IAAI,QAAQ,SAAS,GAAG;AAC1B,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,YAAY;AACvB,eAAW,KAAK,IAAI,SAAS;AAC3B,YAAM,KAAK,YAAO,CAAC,EAAE;AAAA,IACvB;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAKO,SAAS,qBAAqB,WAA8B;AACjE,QAAM,QAAkB;AAAA,IACtB,GAAG,UAAU,EAAE;AAAA,IACf;AAAA,IACA;AAAA,IACA,UAAU;AAAA,IACV;AAAA,IACA;AAAA,EACF;AAEA,MAAI,UAAU,SAAS,SAAS,GAAG;AACjC,eAAW,KAAK,UAAU,UAAU;AAClC,YAAM,KAAK,KAAK,CAAC,EAAE;AAAA,IACrB;AAAA,EACF,OAAO;AACL,UAAM,KAAK,0CAA0C;AAAA,EACvD;AAEA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,aAAa,UAAU,QAAQ,aAAa,EAAE;AACzD,QAAM,KAAK,mBAAmB,UAAU,QAAQ,mBAAmB,EAAE;AACrE,QAAM,KAAK,aAAa,UAAU,QAAQ,mBAAmB,aAAa,UAAU,QAAQ,eAAe,SAAS;AACpH,QAAM,KAAK,eAAe,UAAU,WAAW,QAAQ,CAAC,CAAC,EAAE;AAC3D,QAAM,KAAK,UAAU,UAAU,KAAK,EAAE;AACtC,QAAM,KAAK,WAAW,UAAU,MAAM,EAAE;AAExC,MAAI,UAAU,SAAS,SAAS,GAAG;AACjC,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,qCAAqC;AAChD,eAAW,KAAK,UAAU,UAAU;AAClC,YAAM,KAAK,KAAK,CAAC,EAAE;AAAA,IACrB;AAAA,EACF;AAEA,MAAI,UAAU,SAAS,SAAS,GAAG;AACjC,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,oCAAoC;AAC/C,eAAW,KAAK,UAAU,UAAU;AAClC,YAAM,KAAK,KAAK,CAAC,EAAE;AAAA,IACrB;AAAA,EACF;AAEA,MAAI,UAAU,UAAU,SAAS,GAAG;AAClC,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,YAAY;AACvB,eAAW,KAAK,UAAU,WAAW;AACnC,YAAM,KAAK,KAAK,CAAC,EAAE;AAAA,IACrB;AAAA,EACF;AAEA,MAAI,UAAU,UAAU,UAAU;AAChC,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,aAAa,UAAU,SAAS,QAAQ,EAAE;AAAA,EACvD;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;AAKO,SAAS,iBAAiB,WAA8B;AAC7D,QAAM,QAAkB,CAAC,UAAU,IAAI,EAAE;AAEzC,MAAI,CAAC,UAAU,WAAW,UAAU,QAAQ,WAAW,GAAG;AACxD,UAAM,OAAO,UAAU,YAAY,UAAU,UAAU,MAAM,GAAG,EAAE,CAAC,IAAI;AACvE,UAAM,iBAAiB,UAAU,SAAS,UAAU,QAAQ,YAAY;AACxE,UAAM,KAAK,IAAI;AACf,UAAM,KAAK,aAAa;AACxB,UAAM,KAAK,UAAU,SAAS;AAC9B,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB;AAEA,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,QAAQ,KAAK;AACjD,UAAM,QAAQ,UAAU,QAAQ,CAAC;AACjC,UAAM,OAAO,MAAM,YAAY,MAAM,UAAU,MAAM,GAAG,EAAE,CAAC,IAAI;AAC/D,UAAM,iBAAiB,MAAM,SAAS,MAAM,QAAQ,YAAY;AAChE,UAAM,KAAK,IAAI;AACf,UAAM,KAAK,aAAa;AACxB,UAAM,KAAK,MAAM,UAAU,MAAM,UAAU,SAAS;AACpD,QAAI,IAAI,UAAU,QAAQ,SAAS,GAAG;AACpC,YAAM,KAAK,EAAE;AAAA,IACf;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;","names":["m"]}

package/dist/mcp/index.d.ts

@@ -0,0 +1,13 @@
+import { McpApp } from 'mcponce';
+
+interface CreateMcpAppOptions {
+    rootDir?: string;
+    name?: string;
+    version?: string;
+}
+/**
+ * Creates the official McpApp for bilmem using mcponce.
+ */
+declare function createBilmemMcpApp(options?: CreateMcpAppOptions): McpApp;
+
+export { type CreateMcpAppOptions, createBilmemMcpApp };