@remnic/core 10.0.16 → 10.0.18

package/dist/chunk-ZZTOURJI.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/reasoning-trace-recall.ts"],"sourcesContent":["/**\n * Reasoning-trace recall boost (issue #564 PR 3).\n *\n * Pure helpers for:\n * - detecting whether a user query looks like a problem-solving ask\n *   (\"how do I…\", \"step by step\", etc.)\n * - boosting stored reasoning_trace memories within a result list when that\n *   condition matches.\n *\n * Callers gate these helpers behind the `recallReasoningTraceBoostEnabled`\n * config flag (default false); the helpers themselves are also no-ops when\n * `enabled` is false so they can be safely chained into the recall pipeline.\n */\n\n/**\n * Heuristic: does the incoming query read like the user wants a stored\n * solution chain (reasoning trace)?\n *\n * Positive signals:\n *  - starts with \"how do I\", \"how can I\", \"how would I\", \"how to\"\n *  - contains \"step by step\", \"walk me through\", \"work through\"\n *  - contains \"reasoning\", \"think through\", \"figure out\", \"debug\"\n *  - explicitly mentions \"trace\" or \"chain of thought\"\n *\n * This is intentionally conservative — the boost is OFF by default, so false\n * negatives are cheap, but false positives would shift retrieval for ordinary\n * queries on an opt-in install.\n */\nexport function looksLikeProblemSolvingQuery(query: string): boolean {\n  if (typeof query !== \"string\") return false;\n  const q = query.trim().toLowerCase();\n  if (q.length === 0) return false;\n\n  // Starts-with patterns.\n  const startsWithPatterns = [\n    /^how\\s+do\\s+i\\b/,\n    /^how\\s+can\\s+i\\b/,\n    /^how\\s+would\\s+i\\b/,\n    /^how\\s+should\\s+i\\b/,\n    /^how\\s+to\\b/,\n    /^what'?s?\\s+the\\s+best\\s+way\\s+to\\b/,\n    /^can\\s+you\\s+walk\\s+me\\s+through\\b/,\n    /^walk\\s+me\\s+through\\b/,\n    /^help\\s+me\\s+debug\\b/,\n    /^help\\s+me\\s+figure\\s+out\\b/,\n    /^why\\s+(does|is|did)\\b/,\n  ];\n  for (const re of startsWithPatterns) {\n    if (re.test(q)) return true;\n  }\n\n  // Anywhere-in-string phrases. These mirror the doc-comment's stated\n  // positive signals: broader variants (\"work through\", \"figure out\",\n  // \"debug this\") are included so \"how do I debug this\" doesn't have to\n  // lean on the `help me debug` starts-with entry alone, and so queries\n  // like \"work through the problem\" or \"figure out why it broke\" trigger\n  // the heuristic as the docstring claims.\n  const phrases = [\n    \"step by step\",\n    \"step-by-step\",\n    \"work through\",\n    \"walk through\",\n    \"walk me through\",\n    \"reason through\",\n    \"think through\",\n    \"figure out\",\n    \"chain of thought\",\n    \"reasoning trace\",\n    \"solution chain\",\n    \"troubleshoot\",\n    \"debug this\",\n    \"debug the\",\n    \" debug \",\n  ];\n  for (const phrase of phrases) {\n    if (q.includes(phrase)) return true;\n  }\n\n  return false;\n}\n\n/**\n * Minimal shape the boost helper needs to read from a recall result. Matches\n * QmdSearchResult as of issue #564 but kept structural so tests and future\n * callers don't have to import orchestrator-level types.\n */\nexport interface BoostableResult {\n  path: string;\n  score: number;\n  docid?: string;\n}\n\n/**\n * Path-based marker for memories that live in the dedicated\n * reasoning-traces/ subtree. Using a path segment keeps this cheap: no\n * frontmatter parsing or extra I/O is needed.\n */\nexport function isReasoningTracePath(candidatePath: string): boolean {\n  if (typeof candidatePath !== \"string\") return false;\n  // Match \"/reasoning-traces/\" as a full path segment to avoid false\n  // positives like \"my-reasoning-traces-notes/\".\n  return /(^|[\\\\/])reasoning-traces([\\\\/]|$)/.test(candidatePath);\n}\n\n/**\n * Default additive boost applied to a reasoning_trace candidate when the\n * current query looks like a problem-solving ask.\n *\n * Chosen to be roughly the same magnitude as the existing CATEGORY_BOOSTS\n * entry for reasoning_trace (0.09 in importance scoring), keeping the signal\n * visible but not overwhelming stronger lexical/vector matches.\n */\nexport const DEFAULT_REASONING_TRACE_BOOST = 0.15;\n\nexport interface ApplyReasoningTraceBoostOptions {\n  enabled: boolean;\n  query: string;\n  boost?: number;\n}\n\n/**\n * Apply a score boost to results whose path sits under reasoning-traces/\n * when the query looks like a problem-solving ask. Returns a new array;\n * the input array is not mutated.\n *\n * Ordering policy: the helper walks the results in order, boosts every\n * matching reasoning trace in place, then promotes each boosted trace\n * upward PAST any non-boosted neighbor whose score is strictly lower\n * than the trace's boosted score. Non-matching results keep their\n * incoming relative order — so reranker-driven path ordering and any\n * other upstream nudges on non-trace items are preserved. We do NOT\n * re-sort the full list, which would wipe out rerank priority on\n * non-trace items (whose numeric scores may have been left stale by the\n * rerank pass). This matters because MMR runs immediately after and\n * truncates to a topN window — globally re-sorting would silently drop\n * reranker-promoted items below the cutoff.\n *\n * No-ops (returns a copy of the input unchanged) when:\n *  - `enabled` is false,\n *  - `query` is empty / not a problem-solving ask,\n *  - the result list contains no reasoning-trace paths.\n *\n * Note on legacy paths: this helper intentionally only matches paths\n * under the dedicated `reasoning-traces/` subtree introduced by PR 3.\n * Historical reasoning_trace memories (if any) written before that\n * subtree existed were routed to `facts/<date>/` and are NOT\n * boost-eligible. Operators upgrading across that boundary should run\n * the migration CLI or rewrite old paths before enabling the boost.\n */\nexport function applyReasoningTraceBoost<R extends BoostableResult>(\n  results: readonly R[],\n  options: ApplyReasoningTraceBoostOptions,\n): R[] {\n  if (!options.enabled) return [...results];\n  if (!Array.isArray(results) || results.length === 0) return [...results];\n  if (!looksLikeProblemSolvingQuery(options.query)) return [...results];\n\n  const boostAmount =\n    typeof options.boost === \"number\" && Number.isFinite(options.boost) && options.boost >= 0\n      ? options.boost\n      : DEFAULT_REASONING_TRACE_BOOST;\n\n  // Step 1: boost the scores of matching traces, preserving positions.\n  const boosted: R[] = [];\n  let changed = false;\n  for (const r of results) {\n    if (isReasoningTracePath(r.path)) {\n      changed = true;\n      const baseScore = typeof r.score === \"number\" && Number.isFinite(r.score) ? r.score : 0;\n      boosted.push({ ...r, score: baseScore + boostAmount } as R);\n    } else {\n      boosted.push(r);\n    }\n  }\n  if (!changed) return boosted;\n\n  // Step 2: promote each boosted trace upward past any non-trace neighbor\n  // whose score is strictly lower than the boosted score. Non-trace items\n  // never move past each other, so reranker-driven ordering on non-trace\n  // items is preserved.\n  const out = boosted.slice();\n  for (let i = 0; i < out.length; i++) {\n    if (!isReasoningTracePath(out[i].path)) continue;\n    const trace = out[i];\n    const traceScore =\n      typeof trace.score === \"number\" && Number.isFinite(trace.score) ? trace.score : 0;\n    let j = i;\n    while (j > 0) {\n      const prev = out[j - 1];\n      if (isReasoningTracePath(prev.path)) break; // don't reorder traces vs each other\n      const prevScore =\n        typeof prev.score === \"number\" && Number.isFinite(prev.score) ? prev.score : 0;\n      if (prevScore >= traceScore) break;\n      out[j] = prev;\n      j -= 1;\n    }\n    if (j !== i) out[j] = trace;\n  }\n\n  return out;\n}\n"],"mappings":";AA4BO,SAAS,6BAA6B,OAAwB;AACnE,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,QAAM,IAAI,MAAM,KAAK,EAAE,YAAY;AACnC,MAAI,EAAE,WAAW,EAAG,QAAO;AAG3B,QAAM,qBAAqB;AAAA,IACzB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,aAAW,MAAM,oBAAoB;AACnC,QAAI,GAAG,KAAK,CAAC,EAAG,QAAO;AAAA,EACzB;AAQA,QAAM,UAAU;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,aAAW,UAAU,SAAS;AAC5B,QAAI,EAAE,SAAS,MAAM,EAAG,QAAO;AAAA,EACjC;AAEA,SAAO;AACT;AAkBO,SAAS,qBAAqB,eAAgC;AACnE,MAAI,OAAO,kBAAkB,SAAU,QAAO;AAG9C,SAAO,qCAAqC,KAAK,aAAa;AAChE;AAUO,IAAM,gCAAgC;AAqCtC,SAAS,yBACd,SACA,SACK;AACL,MAAI,CAAC,QAAQ,QAAS,QAAO,CAAC,GAAG,OAAO;AACxC,MAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,QAAQ,WAAW,EAAG,QAAO,CAAC,GAAG,OAAO;AACvE,MAAI,CAAC,6BAA6B,QAAQ,KAAK,EAAG,QAAO,CAAC,GAAG,OAAO;AAEpE,QAAM,cACJ,OAAO,QAAQ,UAAU,YAAY,OAAO,SAAS,QAAQ,KAAK,KAAK,QAAQ,SAAS,IACpF,QAAQ,QACR;AAGN,QAAM,UAAe,CAAC;AACtB,MAAI,UAAU;AACd,aAAW,KAAK,SAAS;AACvB,QAAI,qBAAqB,EAAE,IAAI,GAAG;AAChC,gBAAU;AACV,YAAM,YAAY,OAAO,EAAE,UAAU,YAAY,OAAO,SAAS,EAAE,KAAK,IAAI,EAAE,QAAQ;AACtF,cAAQ,KAAK,EAAE,GAAG,GAAG,OAAO,YAAY,YAAY,CAAM;AAAA,IAC5D,OAAO;AACL,cAAQ,KAAK,CAAC;AAAA,IAChB;AAAA,EACF;AACA,MAAI,CAAC,QAAS,QAAO;AAMrB,QAAM,MAAM,QAAQ,MAAM;AAC1B,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,QAAI,CAAC,qBAAqB,IAAI,CAAC,EAAE,IAAI,EAAG;AACxC,UAAM,QAAQ,IAAI,CAAC;AACnB,UAAM,aACJ,OAAO,MAAM,UAAU,YAAY,OAAO,SAAS,MAAM,KAAK,IAAI,MAAM,QAAQ;AAClF,QAAI,IAAI;AACR,WAAO,IAAI,GAAG;AACZ,YAAM,OAAO,IAAI,IAAI,CAAC;AACtB,UAAI,qBAAqB,KAAK,IAAI,EAAG;AACrC,YAAM,YACJ,OAAO,KAAK,UAAU,YAAY,OAAO,SAAS,KAAK,KAAK,IAAI,KAAK,QAAQ;AAC/E,UAAI,aAAa,WAAY;AAC7B,UAAI,CAAC,IAAI;AACT,WAAK;AAAA,IACP;AACA,QAAI,MAAM,EAAG,KAAI,CAAC,IAAI;AAAA,EACxB;AAEA,SAAO;AACT;","names":[]}