@remnic/core 9.69.33 → 9.69.35

package/dist/causal-trajectory-graph.d.ts

@@ -1,15 +1,17 @@
 import { a as GraphEdge } from './graph-DRkl22KE.js';
 import { CausalTrajectoryRecord } from './causal-trajectory.js';
 import './capabilities.js';
-import './types-igV4-sbB.js';
+import './types-yDgWDkrJ.js';
 import './message-parts/index.js';
 import './bounded-jsonl-state.js';
 import './operator-doctor-types.js';
 import './external-wiki-config.js';
+import './recall-state-view.js';
 import './contradiction-config.js';
 import './graph-path-scoring-config.js';
 import './deep-recall-config.js';
 import './active-context-config.js';
+import './local-llm-config.js';
 import './semantic-merge-config.js';
 import './types-continuity.js';
 import './objective-state.js';

package/dist/{chunk-CDKHKZL5.js → chunk-2524MOWK.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-HL4DB7TO.js";
 import {
   launchProcess
-} from "./chunk-O75CRYGF.js";
+} from "./chunk-ZEFVK7XC.js";
 
 // src/compat/checks.ts
 import { access, readFile } from "fs/promises";
@@ -647,4 +647,4 @@ async function runCompatChecks(options) {
 export {
   runCompatChecks
 };
-//# sourceMappingURL=chunk-CDKHKZL5.js.map
+//# sourceMappingURL=chunk-2524MOWK.js.map

package/dist/{chunk-HVAEXYPL.js → chunk-255PC37A.js}

@@ -4,21 +4,16 @@ import {
 
 // src/recall-state-view.ts
 var DEFAULT_RECALL_STATE_VIEWS = false;
-var CHANGE_WORDS = ["before", "after", "switch", "switches", "switched", "switching", "change", "changes", "changed", "changing"];
+var CHANGE_WORDS = ["switch", "switches", "switched", "switching", "change", "changes", "changed", "changing"];
+var CHANGE_PHRASE_RE = /\bwhen\s+did\b|\bused\s+to\b/;
+var CHANGE_WORD_RE = new RegExp(`\\b(?:${CHANGE_WORDS.join("|")})\\b`);
+var EVENT_POINTER_RE = /\b(?:before|after)\s+(?:the|a|an|this|that|these|those)\b/;
 function parseRecallStateViews(raw) {
   return coerceBooleanLike(raw, "recallStateViews") === true;
 }
 function isChangeOrientedQuery(query) {
   const lower = query.toLowerCase();
-  if (lower.includes("when did") || lower.includes("used to")) return true;
-  return CHANGE_WORDS.some((word) => {
-    const idx = lower.indexOf(word);
-    if (idx < 0) return false;
-    const before = idx === 0 || !/[a-z0-9]/.test(lower[idx - 1] ?? "");
-    const afterIdx = idx + word.length;
-    const after = afterIdx >= lower.length || !/[a-z0-9]/.test(lower[afterIdx] ?? "");
-    return before && after;
-  });
+  return CHANGE_PHRASE_RE.test(lower) || CHANGE_WORD_RE.test(lower) || EVENT_POINTER_RE.test(lower);
 }
 function shouldWidenSuperseded(successorId, candidateIds) {
   return typeof successorId === "string" && successorId.length > 0 && candidateIds.has(successorId);
@@ -42,7 +37,7 @@ function buildSuccessorMap(results, chains) {
   }
   return byPred;
 }
-function labelFor(id, result, byPred, admittedIds) {
+function labelFor(id, result, byPred, admittedIds, asOfMs) {
   const successorId = result.supersededBy ?? byPred.get(id);
   const isPred = shouldWidenSuperseded(successorId, admittedIds);
   let isSucc = false;
@@ -55,34 +50,61 @@ function labelFor(id, result, byPred, admittedIds) {
   if (isPred && isSucc) return "transition";
   if (isPred) return "historical";
   if (isSucc) return "current";
-  return result.status === "superseded" ? "historical" : "current";
+  if (result.status === "superseded") {
+    return asOfMs === null ? "historical" : snapshotStateLabel(result, asOfMs);
+  }
+  return "current";
+}
+function snapshotStateLabel(result, asOfMs) {
+  const supersededAtMs = Date.parse(result.supersededAt ?? "");
+  return Number.isFinite(supersededAtMs) && supersededAtMs <= asOfMs ? "historical" : "current";
 }
 function annotateStateView(results, query, chains, options = {}) {
   const enabled = options.enabled === true;
   if (!enabled || !isChangeOrientedQuery(query)) return results;
+  const asOfMs = typeof options.asOfMs === "number" && Number.isFinite(options.asOfMs) ? options.asOfMs : null;
   const byPred = buildSuccessorMap(results, chains);
   const candidateIds = /* @__PURE__ */ new Set();
   for (const result of results) {
     const id = resultStateViewId(result);
     if (id) candidateIds.add(id);
   }
-  const admitted = [];
-  for (const result of results) {
+  const isSupersededRow = (result) => {
     const id = resultStateViewId(result);
-    const successorId = result.supersededBy ?? byPred.get(id);
-    const superseded = result.status === "superseded" || Boolean(result.supersededBy) || byPred.has(id);
-    if (!superseded || shouldWidenSuperseded(successorId, candidateIds)) {
-      admitted.push(result);
+    return {
+      superseded: result.status === "superseded" || Boolean(result.supersededBy) || byPred.has(id),
+      successorId: result.supersededBy ?? byPred.get(id)
+    };
+  };
+  let admitted;
+  if (asOfMs !== null) {
+    admitted = results.slice();
+  } else {
+    admitted = [];
+    for (const result of results) {
+      const { superseded, successorId } = isSupersededRow(result);
+      if (!superseded || shouldWidenSuperseded(successorId, candidateIds)) {
+        admitted.push(result);
+      }
+    }
+    let admittedIds2 = new Set(admitted.map(resultStateViewId).filter(Boolean));
+    for (let changed = true; changed; ) {
+      changed = false;
+      for (let i = admitted.length - 1; i >= 0; i -= 1) {
+        const row = admitted[i];
+        const { superseded, successorId } = isSupersededRow(row);
+        if (superseded && !shouldWidenSuperseded(successorId, admittedIds2)) {
+          admitted.splice(i, 1);
+          changed = true;
+        }
+      }
+      if (changed) admittedIds2 = new Set(admitted.map(resultStateViewId).filter(Boolean));
     }
   }
-  const admittedIds = /* @__PURE__ */ new Set();
-  for (const result of admitted) {
-    const id = resultStateViewId(result);
-    if (id) admittedIds.add(id);
-  }
+  const admittedIds = new Set(admitted.map(resultStateViewId).filter(Boolean));
   return admitted.map((result) => {
     const id = resultStateViewId(result);
-    return { ...result, stateLabel: labelFor(id, result, byPred, admittedIds) };
+    return { ...result, stateLabel: labelFor(id, result, byPred, admittedIds, asOfMs) };
   });
 }
 
@@ -95,4 +117,4 @@ export {
   resultStateViewId,
   annotateStateView
 };
-//# sourceMappingURL=chunk-HVAEXYPL.js.map
+//# sourceMappingURL=chunk-255PC37A.js.map

package/dist/chunk-255PC37A.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/recall-state-view.ts"],"sourcesContent":["/**\n * Recall state views (issue #1952).\n *\n * Config key: `recallStateViews` (default false). When false, annotateStateView\n * is identity: same array reference, no `stateLabel`. config.ts is at its\n * fileSizeGrandfather ceiling, so parseConfig wiring waits for a later PR.\n * Call `parseRecallStateViews` at the recall seam when that lands.\n *\n * Change-intent morphology lives here (do not grow intent.ts). A superseded\n * memory is admitted only when its successor is also in the candidate set.\n */\nimport { coerceBooleanLike } from \"./connectors/coerce.js\";\n\nexport type StateLabel = \"current\" | \"historical\" | \"transition\";\n\nexport interface StateViewChain {\n  predecessorId: string;\n  successorId: string;\n  supersededAt?: string;\n}\n\nexport interface StateViewResult {\n  id?: string;\n  docid?: string;\n  status?: string;\n  supersededBy?: string;\n  supersededAt?: string;\n  stateLabel?: StateLabel;\n}\n\nexport const DEFAULT_RECALL_STATE_VIEWS = false;\n\nconst CHANGE_WORDS = [\"switch\", \"switches\", \"switched\", \"switching\", \"change\", \"changes\", \"changed\", \"changing\"];\n\n// Phrase matches are token-bounded: \"when Didi\" must not fire the\n// \"when did\" phrase, and \"confused to\" must not fire \"used to\".\nconst CHANGE_PHRASE_RE = /\\bwhen\\s+did\\b|\\bused\\s+to\\b/;\nconst CHANGE_WORD_RE = new RegExp(`\\\\b(?:${CHANGE_WORDS.join(\"|\")})\\\\b`);\n// Bare \"before\"/\"after\" are ordinary sequencing (\"before lunch\",\n// \"after install\"). They carry change intent only when they point at a\n// specific event through a determiner (\"before the move\", \"after the\n// cutover\").\nconst EVENT_POINTER_RE = /\\b(?:before|after)\\s+(?:the|a|an|this|that|these|those)\\b/;\n\nexport function parseRecallStateViews(raw: unknown): boolean {\n  return coerceBooleanLike(raw, \"recallStateViews\") === true;\n}\n\nexport function isChangeOrientedQuery(query: string): boolean {\n  const lower = query.toLowerCase();\n  return CHANGE_PHRASE_RE.test(lower) || CHANGE_WORD_RE.test(lower) || EVENT_POINTER_RE.test(lower);\n}\n\nexport function shouldWidenSuperseded(\n  successorId: string | undefined,\n  candidateIds: ReadonlySet<string>,\n): boolean {\n  return typeof successorId === \"string\" && successorId.length > 0 && candidateIds.has(successorId);\n}\n\nexport function formatSupersededPrefix(date: string, successorId: string): string {\n  return `[superseded ${date} by ${successorId}]`;\n}\n\nexport function resultStateViewId(result: StateViewResult): string {\n  return result.id ?? result.docid ?? \"\";\n}\n\nfunction buildSuccessorMap(results: readonly StateViewResult[], chains: readonly StateViewChain[]): Map<string, string> {\n  const byPred = new Map<string, string>();\n  for (const chain of chains) {\n    if (chain.predecessorId && chain.successorId) {\n      byPred.set(chain.predecessorId, chain.successorId);\n    }\n  }\n  for (const result of results) {\n    const id = resultStateViewId(result);\n    if (id && result.supersededBy) byPred.set(id, result.supersededBy);\n  }\n  return byPred;\n}\n\nfunction labelFor(\n  id: string,\n  result: StateViewResult,\n  byPred: Map<string, string>,\n  admittedIds: ReadonlySet<string>,\n  asOfMs: number | null,\n): StateLabel {\n  const successorId = result.supersededBy ?? byPred.get(id);\n  const isPred = shouldWidenSuperseded(successorId, admittedIds);\n  let isSucc = false;\n  for (const [predId, succId] of byPred) {\n    if (succId === id && admittedIds.has(predId)) {\n      isSucc = true;\n      break;\n    }\n  }\n  if (isPred && isSucc) return \"transition\";\n  if (isPred) return \"historical\";\n  if (isSucc) return \"current\";\n  if (result.status === \"superseded\") {\n    // #1952 asOf mode: the successor is legitimately absent under the\n    // historical pin. The row was the live fact at the snapshot when the\n    // recorded supersession postdates the pin (\"current\" relative to\n    // the snapshot); already replaced at the pin is \"historical\".\n    return asOfMs === null ? \"historical\" : snapshotStateLabel(result, asOfMs);\n  }\n  return \"current\";\n}\n\nfunction snapshotStateLabel(result: StateViewResult, asOfMs: number): StateLabel {\n  const supersededAtMs = Date.parse(result.supersededAt ?? \"\");\n  return Number.isFinite(supersededAtMs) && supersededAtMs <= asOfMs\n    ? \"historical\"\n    : \"current\";\n}\n\nexport function annotateStateView<T extends StateViewResult>(\n  results: T[],\n  query: string,\n  chains: readonly StateViewChain[],\n  options: { enabled?: boolean; asOfMs?: number } = {},\n): T[] {\n  const enabled = options.enabled === true;\n  if (!enabled || !isChangeOrientedQuery(query)) return results;\n  // #1952 asOf mode: under a historical pin the pipeline's isValidAsOf\n  // gate already decided validity at the pinned instant, so a predecessor\n  // must not be discarded merely because its successor is absent under\n  // the same filter. A valid asOf result is never emptied here.\n  const asOfMs =\n    typeof options.asOfMs === \"number\" && Number.isFinite(options.asOfMs)\n      ? options.asOfMs\n      : null;\n\n  const byPred = buildSuccessorMap(results, chains);\n  const candidateIds = new Set<string>();\n  for (const result of results) {\n    const id = resultStateViewId(result);\n    if (id) candidateIds.add(id);\n  }\n\n  const isSupersededRow = (result: T): { superseded: boolean; successorId: string | undefined } => {\n    const id = resultStateViewId(result);\n    return {\n      superseded: result.status === \"superseded\" || Boolean(result.supersededBy) || byPred.has(id),\n      successorId: result.supersededBy ?? byPred.get(id),\n    };\n  };\n\n  let admitted: T[];\n  if (asOfMs !== null) {\n    admitted = results.slice();\n  } else {\n    admitted = [];\n    for (const result of results) {\n      const { superseded, successorId } = isSupersededRow(result);\n      if (!superseded || shouldWidenSuperseded(successorId, candidateIds)) {\n        admitted.push(result);\n      }\n    }\n\n    // #1952 contract: superseded never appears without its successor. A\n    // successor can itself be dropped (filtered elsewhere, or transitively\n    // orphaned), so reconcile to a fixpoint instead of trusting the first pass.\n    let admittedIds = new Set(admitted.map(resultStateViewId).filter(Boolean));\n    for (let changed = true; changed; ) {\n      changed = false;\n      for (let i = admitted.length - 1; i >= 0; i -= 1) {\n        const row = admitted[i]!;\n        const { superseded, successorId } = isSupersededRow(row);\n        if (superseded && !shouldWidenSuperseded(successorId, admittedIds)) {\n          admitted.splice(i, 1);\n          changed = true;\n        }\n      }\n      if (changed) admittedIds = new Set(admitted.map(resultStateViewId).filter(Boolean));\n    }\n  }\n\n  const admittedIds = new Set(admitted.map(resultStateViewId).filter(Boolean));\n  return admitted.map((result) => {\n    const id = resultStateViewId(result);\n    return { ...result, stateLabel: labelFor(id, result, byPred, admittedIds, asOfMs) };\n  });\n}\n"],"mappings":";;;;;AA8BO,IAAM,6BAA6B;AAE1C,IAAM,eAAe,CAAC,UAAU,YAAY,YAAY,aAAa,UAAU,WAAW,WAAW,UAAU;AAI/G,IAAM,mBAAmB;AACzB,IAAM,iBAAiB,IAAI,OAAO,SAAS,aAAa,KAAK,GAAG,CAAC,MAAM;AAKvE,IAAM,mBAAmB;AAElB,SAAS,sBAAsB,KAAuB;AAC3D,SAAO,kBAAkB,KAAK,kBAAkB,MAAM;AACxD;AAEO,SAAS,sBAAsB,OAAwB;AAC5D,QAAM,QAAQ,MAAM,YAAY;AAChC,SAAO,iBAAiB,KAAK,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK,iBAAiB,KAAK,KAAK;AAClG;AAEO,SAAS,sBACd,aACA,cACS;AACT,SAAO,OAAO,gBAAgB,YAAY,YAAY,SAAS,KAAK,aAAa,IAAI,WAAW;AAClG;AAEO,SAAS,uBAAuB,MAAc,aAA6B;AAChF,SAAO,eAAe,IAAI,OAAO,WAAW;AAC9C;AAEO,SAAS,kBAAkB,QAAiC;AACjE,SAAO,OAAO,MAAM,OAAO,SAAS;AACtC;AAEA,SAAS,kBAAkB,SAAqC,QAAwD;AACtH,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,SAAS,QAAQ;AAC1B,QAAI,MAAM,iBAAiB,MAAM,aAAa;AAC5C,aAAO,IAAI,MAAM,eAAe,MAAM,WAAW;AAAA,IACnD;AAAA,EACF;AACA,aAAW,UAAU,SAAS;AAC5B,UAAM,KAAK,kBAAkB,MAAM;AACnC,QAAI,MAAM,OAAO,aAAc,QAAO,IAAI,IAAI,OAAO,YAAY;AAAA,EACnE;AACA,SAAO;AACT;AAEA,SAAS,SACP,IACA,QACA,QACA,aACA,QACY;AACZ,QAAM,cAAc,OAAO,gBAAgB,OAAO,IAAI,EAAE;AACxD,QAAM,SAAS,sBAAsB,aAAa,WAAW;AAC7D,MAAI,SAAS;AACb,aAAW,CAAC,QAAQ,MAAM,KAAK,QAAQ;AACrC,QAAI,WAAW,MAAM,YAAY,IAAI,MAAM,GAAG;AAC5C,eAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,MAAI,UAAU,OAAQ,QAAO;AAC7B,MAAI,OAAQ,QAAO;AACnB,MAAI,OAAQ,QAAO;AACnB,MAAI,OAAO,WAAW,cAAc;AAKlC,WAAO,WAAW,OAAO,eAAe,mBAAmB,QAAQ,MAAM;AAAA,EAC3E;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,QAAyB,QAA4B;AAC/E,QAAM,iBAAiB,KAAK,MAAM,OAAO,gBAAgB,EAAE;AAC3D,SAAO,OAAO,SAAS,cAAc,KAAK,kBAAkB,SACxD,eACA;AACN;AAEO,SAAS,kBACd,SACA,OACA,QACA,UAAkD,CAAC,GAC9C;AACL,QAAM,UAAU,QAAQ,YAAY;AACpC,MAAI,CAAC,WAAW,CAAC,sBAAsB,KAAK,EAAG,QAAO;AAKtD,QAAM,SACJ,OAAO,QAAQ,WAAW,YAAY,OAAO,SAAS,QAAQ,MAAM,IAChE,QAAQ,SACR;AAEN,QAAM,SAAS,kBAAkB,SAAS,MAAM;AAChD,QAAM,eAAe,oBAAI,IAAY;AACrC,aAAW,UAAU,SAAS;AAC5B,UAAM,KAAK,kBAAkB,MAAM;AACnC,QAAI,GAAI,cAAa,IAAI,EAAE;AAAA,EAC7B;AAEA,QAAM,kBAAkB,CAAC,WAAwE;AAC/F,UAAM,KAAK,kBAAkB,MAAM;AACnC,WAAO;AAAA,MACL,YAAY,OAAO,WAAW,gBAAgB,QAAQ,OAAO,YAAY,KAAK,OAAO,IAAI,EAAE;AAAA,MAC3F,aAAa,OAAO,gBAAgB,OAAO,IAAI,EAAE;AAAA,IACnD;AAAA,EACF;AAEA,MAAI;AACJ,MAAI,WAAW,MAAM;AACnB,eAAW,QAAQ,MAAM;AAAA,EAC3B,OAAO;AACL,eAAW,CAAC;AACZ,eAAW,UAAU,SAAS;AAC5B,YAAM,EAAE,YAAY,YAAY,IAAI,gBAAgB,MAAM;AAC1D,UAAI,CAAC,cAAc,sBAAsB,aAAa,YAAY,GAAG;AACnE,iBAAS,KAAK,MAAM;AAAA,MACtB;AAAA,IACF;AAKA,QAAIA,eAAc,IAAI,IAAI,SAAS,IAAI,iBAAiB,EAAE,OAAO,OAAO,CAAC;AACzE,aAAS,UAAU,MAAM,WAAW;AAClC,gBAAU;AACV,eAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;AAChD,cAAM,MAAM,SAAS,CAAC;AACtB,cAAM,EAAE,YAAY,YAAY,IAAI,gBAAgB,GAAG;AACvD,YAAI,cAAc,CAAC,sBAAsB,aAAaA,YAAW,GAAG;AAClE,mBAAS,OAAO,GAAG,CAAC;AACpB,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI,QAAS,CAAAA,eAAc,IAAI,IAAI,SAAS,IAAI,iBAAiB,EAAE,OAAO,OAAO,CAAC;AAAA,IACpF;AAAA,EACF;AAEA,QAAM,cAAc,IAAI,IAAI,SAAS,IAAI,iBAAiB,EAAE,OAAO,OAAO,CAAC;AAC3E,SAAO,SAAS,IAAI,CAAC,WAAW;AAC9B,UAAM,KAAK,kBAAkB,MAAM;AACnC,WAAO,EAAE,GAAG,QAAQ,YAAY,SAAS,IAAI,QAAQ,QAAQ,aAAa,MAAM,EAAE;AAAA,EACpF,CAAC;AACH;","names":["admittedIds"]}