@remnic/core 9.69.3 → 9.69.5

package/dist/recall-navigate-link.d.ts

@@ -1,9 +1,15 @@
 /**
- * Recall navigation link-type parse (issue #1956 leftover).
+ * Recall navigation link-type parse (issue #1956).
  *
- * Pure. Surfaces wait. Unknown or empty is unknown_link.
+ * One allow-list covering BOTH vocabularies a traversal can meet:
+ * the navigation set this module originally defined and the persisted
+ * `MemoryLinkType` values (`follows | references | related`) that real
+ * memory frontmatter carries. Review found the narrower list silently
+ * dropped every persisted `follows`/`references`/`related` edge and
+ * rejected `relation: "related"` as unknown — a traversal over actual
+ * stored links would lose valid neighbors. Surfaces wait.
  */
-declare const NAVIGATE_LINK_TYPES: readonly ["supports", "contradicts", "elaborates", "causes", "caused_by"];
+declare const NAVIGATE_LINK_TYPES: readonly ["supports", "contradicts", "elaborates", "causes", "caused_by", "follows", "references", "related", "supersedes"];
 type NavigateLinkType = (typeof NAVIGATE_LINK_TYPES)[number];
 type ParseNavigateLinkTypeResult = {
     ok: true;

package/dist/recall-navigate-link.js

@@ -1,19 +1,7 @@
+import {
+  parseNavigateLinkType
+} from "./chunk-7O5EW7KX.js";
 import "./chunk-PZ5AY32C.js";
-
-// src/recall-navigate-link.ts
-var NAVIGATE_LINK_TYPES = [
-  "supports",
-  "contradicts",
-  "elaborates",
-  "causes",
-  "caused_by"
-];
-function parseNavigateLinkType(value) {
-  if (NAVIGATE_LINK_TYPES.includes(value)) {
-    return { ok: true, type: value };
-  }
-  return { ok: false, error: "unknown_link" };
-}
 export {
   parseNavigateLinkType
 };

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

@@ -1 +1 @@
-{"version":3,"sources":["../src/recall-navigate-link.ts"],"sourcesContent":["/**\n * Recall navigation link-type parse (issue #1956 leftover).\n *\n * Pure. Surfaces wait. Unknown or empty is unknown_link.\n */\n\nconst NAVIGATE_LINK_TYPES = [\n  \"supports\",\n  \"contradicts\",\n  \"elaborates\",\n  \"causes\",\n  \"caused_by\",\n] as const;\n\nexport type NavigateLinkType = (typeof NAVIGATE_LINK_TYPES)[number];\n\nexport type ParseNavigateLinkTypeResult =\n  | { ok: true; type: NavigateLinkType }\n  | { ok: false; error: \"unknown_link\" };\n\nexport function parseNavigateLinkType(value: string): ParseNavigateLinkTypeResult {\n  if ((NAVIGATE_LINK_TYPES as readonly string[]).includes(value)) {\n    return { ok: true, type: value as NavigateLinkType };\n  }\n  return { ok: false, error: \"unknown_link\" };\n}\n"],"mappings":";;;AAMA,IAAM,sBAAsB;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAQO,SAAS,sBAAsB,OAA4C;AAChF,MAAK,oBAA0C,SAAS,KAAK,GAAG;AAC9D,WAAO,EAAE,IAAI,MAAM,MAAM,MAA0B;AAAA,EACrD;AACA,SAAO,EAAE,IAAI,OAAO,OAAO,eAAe;AAC5C;","names":[]}
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/recall-navigate-traverse.d.ts

@@ -0,0 +1,21 @@
+declare const DEFAULT_TRAVERSE_LIMIT = 10;
+interface TraverseNeighbor {
+    targetId: string;
+    linkType: string;
+}
+type TraverseSelectionResult = {
+    ok: true;
+    neighbors: TraverseNeighbor[];
+    truncated: boolean;
+} | {
+    ok: false;
+    error: "unknown_relation" | "invalid_limit";
+};
+declare function selectTraverseNeighbors(input: {
+    links: readonly TraverseNeighbor[];
+    /** Optional relation filter; omitted means every known relation. */
+    relation?: string;
+    limit?: number;
+}): TraverseSelectionResult;
+
+export { DEFAULT_TRAVERSE_LIMIT, type TraverseNeighbor, type TraverseSelectionResult, selectTraverseNeighbors };

package/dist/recall-navigate-traverse.js

@@ -0,0 +1,44 @@
+import {
+  parseNavigateLinkType
+} from "./chunk-7O5EW7KX.js";
+import "./chunk-PZ5AY32C.js";
+
+// src/recall-navigate-traverse.ts
+var DEFAULT_TRAVERSE_LIMIT = 10;
+function selectTraverseNeighbors(input) {
+  const limit = input.limit ?? DEFAULT_TRAVERSE_LIMIT;
+  if (!Number.isFinite(limit) || !Number.isInteger(limit) || limit < 1) {
+    return { ok: false, error: "invalid_limit" };
+  }
+  if (input.relation !== void 0 && !parseNavigateLinkType(input.relation).ok) {
+    return { ok: false, error: "unknown_relation" };
+  }
+  const kept = [];
+  for (const link of input.links) {
+    if (!parseNavigateLinkType(link.linkType).ok) continue;
+    if (input.relation !== void 0 && link.linkType !== input.relation) continue;
+    if (typeof link.targetId !== "string" || link.targetId.trim() === "" || link.targetId.trim() !== link.targetId) {
+      continue;
+    }
+    kept.push({ targetId: link.targetId, linkType: link.linkType });
+  }
+  kept.sort((a, b) => {
+    if (a.linkType !== b.linkType) return a.linkType < b.linkType ? -1 : 1;
+    if (a.targetId !== b.targetId) return a.targetId < b.targetId ? -1 : 1;
+    return 0;
+  });
+  const seen = /* @__PURE__ */ new Set();
+  const deduped = [];
+  for (const link of kept) {
+    if (seen.has(link.targetId)) continue;
+    seen.add(link.targetId);
+    deduped.push(link);
+  }
+  const truncated = deduped.length > limit;
+  return { ok: true, neighbors: truncated ? deduped.slice(0, limit) : deduped, truncated };
+}
+export {
+  DEFAULT_TRAVERSE_LIMIT,
+  selectTraverseNeighbors
+};
+//# sourceMappingURL=recall-navigate-traverse.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/recall-navigate-traverse.ts"],"sourcesContent":["/**\n * Recall navigation traverse selection (issue #1956).\n *\n * Pure selection step for `traverseLinks(id, relation?, limit)`: given a\n * recalled memory's links, pick which neighbors a traverse would visit.\n * Internal; surfaces wire it in a later slice.\n */\nimport { parseNavigateLinkType } from \"./recall-navigate-link.js\";\n\nexport const DEFAULT_TRAVERSE_LIMIT = 10;\n\nexport interface TraverseNeighbor {\n  targetId: string;\n  linkType: string;\n}\n\nexport type TraverseSelectionResult =\n  | { ok: true; neighbors: TraverseNeighbor[]; truncated: boolean }\n  | { ok: false; error: \"unknown_relation\" | \"invalid_limit\" };\n\nexport function selectTraverseNeighbors(input: {\n  links: readonly TraverseNeighbor[];\n  /** Optional relation filter; omitted means every known relation. */\n  relation?: string;\n  limit?: number;\n}): TraverseSelectionResult {\n  const limit = input.limit ?? DEFAULT_TRAVERSE_LIMIT;\n  if (!Number.isFinite(limit) || !Number.isInteger(limit) || limit < 1) {\n    return { ok: false, error: \"invalid_limit\" };\n  }\n  if (input.relation !== undefined && !parseNavigateLinkType(input.relation).ok) {\n    return { ok: false, error: \"unknown_relation\" };\n  }\n\n  const kept: TraverseNeighbor[] = [];\n  // Asymmetry is intentional: a bad request (unknown relation, invalid\n  // limit) is refused, but bad stored data is skipped — stored data may\n  // predate a type or carry a malformed id, and one bad row must not fail\n  // the whole traverse. A targetId that is not a non-blank string, including\n  // undefined/null and whitespace-only, is malformed and skipped. Padded ids\n  // are NOT trimmed into validity: an id is an exact identity, and guessing\n  // the intended target is worse than skipping the row.\n  for (const link of input.links) {\n    if (!parseNavigateLinkType(link.linkType).ok) continue;\n    if (input.relation !== undefined && link.linkType !== input.relation) continue;\n    if (typeof link.targetId !== \"string\" || link.targetId.trim() === \"\" || link.targetId.trim() !== link.targetId) {\n      continue;\n    }\n    kept.push({ targetId: link.targetId, linkType: link.linkType });\n  }\n\n  // Sort BEFORE deduplicating: first-occurrence dedup on an unsorted list\n  // lets input order decide which relation survives for a target that is\n  // linked under two types, and after the cap is applied, which target is\n  // returned at all. Sorting first makes the survivor deterministic\n  // (smallest linkType wins the tie).\n  kept.sort((a, b) => {\n    if (a.linkType !== b.linkType) return a.linkType < b.linkType ? -1 : 1;\n    if (a.targetId !== b.targetId) return a.targetId < b.targetId ? -1 : 1;\n    return 0;\n  });\n\n  const seen = new Set<string>();\n  const deduped: TraverseNeighbor[] = [];\n  for (const link of kept) {\n    if (seen.has(link.targetId)) continue;\n    seen.add(link.targetId);\n    deduped.push(link);\n  }\n\n  const truncated = deduped.length > limit;\n  return { ok: true, neighbors: truncated ? deduped.slice(0, limit) : deduped, truncated };\n}\n"],"mappings":";;;;;;AASO,IAAM,yBAAyB;AAW/B,SAAS,wBAAwB,OAKZ;AAC1B,QAAM,QAAQ,MAAM,SAAS;AAC7B,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AACpE,WAAO,EAAE,IAAI,OAAO,OAAO,gBAAgB;AAAA,EAC7C;AACA,MAAI,MAAM,aAAa,UAAa,CAAC,sBAAsB,MAAM,QAAQ,EAAE,IAAI;AAC7E,WAAO,EAAE,IAAI,OAAO,OAAO,mBAAmB;AAAA,EAChD;AAEA,QAAM,OAA2B,CAAC;AAQlC,aAAW,QAAQ,MAAM,OAAO;AAC9B,QAAI,CAAC,sBAAsB,KAAK,QAAQ,EAAE,GAAI;AAC9C,QAAI,MAAM,aAAa,UAAa,KAAK,aAAa,MAAM,SAAU;AACtE,QAAI,OAAO,KAAK,aAAa,YAAY,KAAK,SAAS,KAAK,MAAM,MAAM,KAAK,SAAS,KAAK,MAAM,KAAK,UAAU;AAC9G;AAAA,IACF;AACA,SAAK,KAAK,EAAE,UAAU,KAAK,UAAU,UAAU,KAAK,SAAS,CAAC;AAAA,EAChE;AAOA,OAAK,KAAK,CAAC,GAAG,MAAM;AAClB,QAAI,EAAE,aAAa,EAAE,SAAU,QAAO,EAAE,WAAW,EAAE,WAAW,KAAK;AACrE,QAAI,EAAE,aAAa,EAAE,SAAU,QAAO,EAAE,WAAW,EAAE,WAAW,KAAK;AACrE,WAAO;AAAA,EACT,CAAC;AAED,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,UAA8B,CAAC;AACrC,aAAW,QAAQ,MAAM;AACvB,QAAI,KAAK,IAAI,KAAK,QAAQ,EAAG;AAC7B,SAAK,IAAI,KAAK,QAAQ;AACtB,YAAQ,KAAK,IAAI;AAAA,EACnB;AAEA,QAAM,YAAY,QAAQ,SAAS;AACnC,SAAO,EAAE,IAAI,MAAM,WAAW,YAAY,QAAQ,MAAM,GAAG,KAAK,IAAI,SAAS,UAAU;AACzF;","names":[]}