@remnic/core 9.68.0 → 9.69.1

package/dist/recall-navigate-disclosure.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/recall-navigate-disclosure.ts"],"sourcesContent":["/**\n * Disclosure-step planning for recall navigation (issue #1956).\n *\n * The ladder itself is NOT redefined here: `types.ts` designates\n * `RECALL_DISCLOSURE_LEVELS` the single source of truth and forbids\n * hard-coding disclosure strings elsewhere, so a second copy could drift out\n * of agreement with recall validation and rendering. This module only adds\n * the rule that an expansion must go strictly deeper, so a caller cannot\n * re-pay recall budget for output it already holds. Pure — no I/O.\n */\n\nimport {\n  isRecallDisclosure,\n  RECALL_DISCLOSURE_LEVELS,\n  type RecallDisclosure,\n} from \"./types.js\";\n\nexport type DisclosureStepResult =\n  | { ok: true; from: RecallDisclosure; to: RecallDisclosure; steps: number }\n  | { ok: false; error: \"unknown_level\" | \"not_deeper\" };\n\n/** Index in the canonical shallow-to-deep ladder. Throws for a non-level. */\nexport function disclosureRank(level: string): number {\n  const index = (RECALL_DISCLOSURE_LEVELS as readonly string[]).indexOf(level);\n  if (index < 0) {\n    throw new RangeError(\n      `unknown disclosure level ${JSON.stringify(level)}; expected one of ${RECALL_DISCLOSURE_LEVELS.join(\", \")}`,\n    );\n  }\n  return index;\n}\n\n/**\n * Plan one expansion. A bad level from an agent is a typed refusal rather\n * than a throw; equal or shallower targets are `not_deeper`.\n */\nexport function planDisclosureStep(input: { from: string; to: string }): DisclosureStepResult {\n  if (!isRecallDisclosure(input.from) || !isRecallDisclosure(input.to)) {\n    return { ok: false, error: \"unknown_level\" };\n  }\n  const fromRank = disclosureRank(input.from);\n  const toRank = disclosureRank(input.to);\n  if (toRank <= fromRank) return { ok: false, error: \"not_deeper\" };\n  return { ok: true, from: input.from, to: input.to, steps: toRank - fromRank };\n}\n"],"mappings":";;;;;;;AAsBO,SAAS,eAAe,OAAuB;AACpD,QAAM,QAAS,yBAA+C,QAAQ,KAAK;AAC3E,MAAI,QAAQ,GAAG;AACb,UAAM,IAAI;AAAA,MACR,4BAA4B,KAAK,UAAU,KAAK,CAAC,qBAAqB,yBAAyB,KAAK,IAAI,CAAC;AAAA,IAC3G;AAAA,EACF;AACA,SAAO;AACT;AAMO,SAAS,mBAAmB,OAA2D;AAC5F,MAAI,CAAC,mBAAmB,MAAM,IAAI,KAAK,CAAC,mBAAmB,MAAM,EAAE,GAAG;AACpE,WAAO,EAAE,IAAI,OAAO,OAAO,gBAAgB;AAAA,EAC7C;AACA,QAAM,WAAW,eAAe,MAAM,IAAI;AAC1C,QAAM,SAAS,eAAe,MAAM,EAAE;AACtC,MAAI,UAAU,SAAU,QAAO,EAAE,IAAI,OAAO,OAAO,aAAa;AAChE,SAAO,EAAE,IAAI,MAAM,MAAM,MAAM,MAAM,IAAI,MAAM,IAAI,OAAO,SAAS,SAAS;AAC9E;","names":[]}

package/dist/recall-state-view-packet.d.ts

@@ -0,0 +1,30 @@
+import { StateLabel } from './recall-state-view.js';
+
+/**
+ * Recall state-view evidence packets (issue #1952).
+ *
+ * Groups labeled state-view entries into per-head evidence packets so
+ * superseded records stay visible as ordered history instead of being
+ * hidden or interleaved with another packet's entries. Pure. Surfaces wait.
+ */
+
+interface StateViewEntry {
+    memoryId: string;
+    stateLabel: StateLabel;
+    /** Id of the entry that superseded this one, when any. */
+    supersededById?: string;
+}
+interface StateEvidencePacket {
+    /** The current (or transition) entry this packet is about. */
+    headId: string;
+    /** Predecessors, nearest to head first. Never interleaved with other packets. */
+    historyIds: string[];
+}
+interface StateEvidencePackets {
+    packets: StateEvidencePacket[];
+    /** Historical entries whose successor is absent from the input. */
+    orphanHistoryIds: string[];
+}
+declare function buildStateEvidencePackets(entries: readonly StateViewEntry[]): StateEvidencePackets;
+
+export { type StateEvidencePacket, type StateEvidencePackets, StateLabel, type StateViewEntry, buildStateEvidencePackets };

package/dist/recall-state-view-packet.js

@@ -0,0 +1,69 @@
+import "./chunk-PZ5AY32C.js";
+
+// src/recall-state-view-packet.ts
+var STATE_LABELS = ["current", "historical", "transition"];
+function resolveHead(entry, byId) {
+  const visited = /* @__PURE__ */ new Set();
+  let current = entry;
+  let depth = 0;
+  for (; ; ) {
+    const successorId = current.supersededById;
+    if (successorId === void 0 || successorId.trim() === "") return void 0;
+    const successor = byId.get(successorId);
+    if (successor === void 0) return void 0;
+    depth += 1;
+    if (successor.stateLabel !== "historical") return { headId: successorId, depth };
+    if (visited.has(successorId)) return void 0;
+    visited.add(successorId);
+    current = successor;
+  }
+}
+function compareStrings(a, b) {
+  return a < b ? -1 : a > b ? 1 : 0;
+}
+function compareAttachments(a, b) {
+  if (a.headId !== b.headId) return compareStrings(a.headId, b.headId);
+  if (a.depth !== b.depth) return a.depth < b.depth ? -1 : 1;
+  return compareStrings(a.historyId, b.historyId);
+}
+function buildStateEvidencePackets(entries) {
+  for (const entry of entries) {
+    if (!STATE_LABELS.includes(entry.stateLabel)) {
+      throw new TypeError(
+        `unknown state label ${JSON.stringify(entry.stateLabel)}; expected one of "current", "historical", "transition"`
+      );
+    }
+  }
+  const byId = /* @__PURE__ */ new Map();
+  for (const entry of entries) {
+    if (typeof entry.memoryId !== "string" || entry.memoryId.trim() === "") continue;
+    if (!byId.has(entry.memoryId)) byId.set(entry.memoryId, entry);
+  }
+  const packets = [];
+  const packetByHead = /* @__PURE__ */ new Map();
+  const attachments = [];
+  const orphanHistoryIds = [];
+  for (const [id, entry] of byId) {
+    if (entry.stateLabel !== "historical") {
+      const packet = { headId: id, historyIds: [] };
+      packetByHead.set(id, packet);
+      packets.push(packet);
+      continue;
+    }
+    const head = resolveHead(entry, byId);
+    if (head === void 0) orphanHistoryIds.push(id);
+    else attachments.push({ headId: head.headId, historyId: id, depth: head.depth });
+  }
+  attachments.sort(compareAttachments);
+  for (const attachment of attachments) {
+    const packet = packetByHead.get(attachment.headId);
+    if (packet) packet.historyIds.push(attachment.historyId);
+  }
+  packets.sort((a, b) => compareStrings(a.headId, b.headId));
+  orphanHistoryIds.sort(compareStrings);
+  return { packets, orphanHistoryIds };
+}
+export {
+  buildStateEvidencePackets
+};
+//# sourceMappingURL=recall-state-view-packet.js.map

package/dist/recall-state-view-packet.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/recall-state-view-packet.ts"],"sourcesContent":["/**\n * Recall state-view evidence packets (issue #1952).\n *\n * Groups labeled state-view entries into per-head evidence packets so\n * superseded records stay visible as ordered history instead of being\n * hidden or interleaved with another packet's entries. Pure. Surfaces wait.\n */\nimport type { StateLabel } from \"./recall-state-view.js\";\n\nexport type { StateLabel };\n\nexport interface StateViewEntry {\n  memoryId: string;\n  stateLabel: StateLabel;\n  /** Id of the entry that superseded this one, when any. */\n  supersededById?: string;\n}\n\nexport interface StateEvidencePacket {\n  /** The current (or transition) entry this packet is about. */\n  headId: string;\n  /** Predecessors, nearest to head first. Never interleaved with other packets. */\n  historyIds: string[];\n}\n\nexport interface StateEvidencePackets {\n  packets: StateEvidencePacket[];\n  /** Historical entries whose successor is absent from the input. */\n  orphanHistoryIds: string[];\n}\n\nconst STATE_LABELS: readonly StateLabel[] = [\"current\", \"historical\", \"transition\"];\n\ninterface HeadResolution {\n  headId: string;\n  depth: number;\n}\n\ninterface Attachment {\n  headId: string;\n  historyId: string;\n  depth: number;\n}\n\n/**\n * Walk supersededById forward through intermediate historical entries and\n * stop at the first current/transition successor. Returns undefined when the\n * walk dead-ends (no or blank successor, successor id absent from the input)\n * or revisits an id (cycle), so callers treat the entry as an orphan.\n */\nfunction resolveHead(\n  entry: StateViewEntry,\n  byId: ReadonlyMap<string, StateViewEntry>,\n): HeadResolution | undefined {\n  const visited = new Set<string>();\n  let current = entry;\n  let depth = 0;\n  for (;;) {\n    const successorId = current.supersededById;\n    if (successorId === undefined || successorId.trim() === \"\") return undefined;\n    const successor = byId.get(successorId);\n    if (successor === undefined) return undefined;\n    depth += 1;\n    if (successor.stateLabel !== \"historical\") return { headId: successorId, depth };\n    if (visited.has(successorId)) return undefined;\n    visited.add(successorId);\n    current = successor;\n  }\n}\n\nfunction compareStrings(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n\nfunction compareAttachments(a: Attachment, b: Attachment): number {\n  if (a.headId !== b.headId) return compareStrings(a.headId, b.headId);\n  if (a.depth !== b.depth) return a.depth < b.depth ? -1 : 1;\n  return compareStrings(a.historyId, b.historyId);\n}\n\nexport function buildStateEvidencePackets(\n  entries: readonly StateViewEntry[],\n): StateEvidencePackets {\n  // Validate every label before any skip, dedup, or walk.\n  for (const entry of entries) {\n    if (!(STATE_LABELS as readonly string[]).includes(entry.stateLabel)) {\n      throw new TypeError(\n        `unknown state label ${JSON.stringify(entry.stateLabel)}; expected one of \"current\", \"historical\", \"transition\"`,\n      );\n    }\n  }\n\n  // Blank ids are ignored; on duplicate ids the first entry wins.\n  const byId = new Map<string, StateViewEntry>();\n  for (const entry of entries) {\n    if (typeof entry.memoryId !== \"string\" || entry.memoryId.trim() === \"\") continue;\n    if (!byId.has(entry.memoryId)) byId.set(entry.memoryId, entry);\n  }\n\n  // ponytail: per-entry chain walks are O(n^2) on one long chain; recall-sized\n  // result sets stay tiny, memoize if packet building ever moves offline.\n  const packets: StateEvidencePacket[] = [];\n  const packetByHead = new Map<string, StateEvidencePacket>();\n  const attachments: Attachment[] = [];\n  const orphanHistoryIds: string[] = [];\n\n  for (const [id, entry] of byId) {\n    if (entry.stateLabel !== \"historical\") {\n      const packet: StateEvidencePacket = { headId: id, historyIds: [] };\n      packetByHead.set(id, packet);\n      packets.push(packet);\n      continue;\n    }\n    const head = resolveHead(entry, byId);\n    if (head === undefined) orphanHistoryIds.push(id);\n    else attachments.push({ headId: head.headId, historyId: id, depth: head.depth });\n  }\n\n  attachments.sort(compareAttachments);\n  for (const attachment of attachments) {\n    const packet = packetByHead.get(attachment.headId);\n    if (packet) packet.historyIds.push(attachment.historyId);\n  }\n\n  packets.sort((a, b) => compareStrings(a.headId, b.headId));\n  orphanHistoryIds.sort(compareStrings);\n  return { packets, orphanHistoryIds };\n}\n"],"mappings":";;;AA+BA,IAAM,eAAsC,CAAC,WAAW,cAAc,YAAY;AAmBlF,SAAS,YACP,OACA,MAC4B;AAC5B,QAAM,UAAU,oBAAI,IAAY;AAChC,MAAI,UAAU;AACd,MAAI,QAAQ;AACZ,aAAS;AACP,UAAM,cAAc,QAAQ;AAC5B,QAAI,gBAAgB,UAAa,YAAY,KAAK,MAAM,GAAI,QAAO;AACnE,UAAM,YAAY,KAAK,IAAI,WAAW;AACtC,QAAI,cAAc,OAAW,QAAO;AACpC,aAAS;AACT,QAAI,UAAU,eAAe,aAAc,QAAO,EAAE,QAAQ,aAAa,MAAM;AAC/E,QAAI,QAAQ,IAAI,WAAW,EAAG,QAAO;AACrC,YAAQ,IAAI,WAAW;AACvB,cAAU;AAAA,EACZ;AACF;AAEA,SAAS,eAAe,GAAW,GAAmB;AACpD,SAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAClC;AAEA,SAAS,mBAAmB,GAAe,GAAuB;AAChE,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO,eAAe,EAAE,QAAQ,EAAE,MAAM;AACnE,MAAI,EAAE,UAAU,EAAE,MAAO,QAAO,EAAE,QAAQ,EAAE,QAAQ,KAAK;AACzD,SAAO,eAAe,EAAE,WAAW,EAAE,SAAS;AAChD;AAEO,SAAS,0BACd,SACsB;AAEtB,aAAW,SAAS,SAAS;AAC3B,QAAI,CAAE,aAAmC,SAAS,MAAM,UAAU,GAAG;AACnE,YAAM,IAAI;AAAA,QACR,uBAAuB,KAAK,UAAU,MAAM,UAAU,CAAC;AAAA,MACzD;AAAA,IACF;AAAA,EACF;AAGA,QAAM,OAAO,oBAAI,IAA4B;AAC7C,aAAW,SAAS,SAAS;AAC3B,QAAI,OAAO,MAAM,aAAa,YAAY,MAAM,SAAS,KAAK,MAAM,GAAI;AACxE,QAAI,CAAC,KAAK,IAAI,MAAM,QAAQ,EAAG,MAAK,IAAI,MAAM,UAAU,KAAK;AAAA,EAC/D;AAIA,QAAM,UAAiC,CAAC;AACxC,QAAM,eAAe,oBAAI,IAAiC;AAC1D,QAAM,cAA4B,CAAC;AACnC,QAAM,mBAA6B,CAAC;AAEpC,aAAW,CAAC,IAAI,KAAK,KAAK,MAAM;AAC9B,QAAI,MAAM,eAAe,cAAc;AACrC,YAAM,SAA8B,EAAE,QAAQ,IAAI,YAAY,CAAC,EAAE;AACjE,mBAAa,IAAI,IAAI,MAAM;AAC3B,cAAQ,KAAK,MAAM;AACnB;AAAA,IACF;AACA,UAAM,OAAO,YAAY,OAAO,IAAI;AACpC,QAAI,SAAS,OAAW,kBAAiB,KAAK,EAAE;AAAA,QAC3C,aAAY,KAAK,EAAE,QAAQ,KAAK,QAAQ,WAAW,IAAI,OAAO,KAAK,MAAM,CAAC;AAAA,EACjF;AAEA,cAAY,KAAK,kBAAkB;AACnC,aAAW,cAAc,aAAa;AACpC,UAAM,SAAS,aAAa,IAAI,WAAW,MAAM;AACjD,QAAI,OAAQ,QAAO,WAAW,KAAK,WAAW,SAAS;AAAA,EACzD;AAEA,UAAQ,KAAK,CAAC,GAAG,MAAM,eAAe,EAAE,QAAQ,EAAE,MAAM,CAAC;AACzD,mBAAiB,KAAK,cAAc;AACpC,SAAO,EAAE,SAAS,iBAAiB;AACrC;","names":[]}