@graphrefly/ts 0.0.0

package/dist/render/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/render/index.ts","../../src/graph/render.ts"],"sourcesContent":["export {\n\ttype DescribeToAsciiOptions,\n\ttype DescribeToD2Options,\n\ttype DescribeToJsonOptions,\n\ttype DescribeToMermaidOptions,\n\ttype DescribeToMermaidUrlOptions,\n\ttype DescribeToPrettyOptions,\n\ttype DiagramDirection,\n\tdescribeToAscii,\n\tdescribeToD2,\n\tdescribeToJson,\n\tdescribeToMermaid,\n\tdescribeToMermaidUrl,\n\tdescribeToPretty,\n\ttype MermaidLiveTheme,\n\ttype MermaidLiveUrlOptions,\n\tmermaidLiveUrl,\n} from \"../graph/render.js\";\n","/**\n * Pure renderers over `DescribeSnapshot` (D39 / D40 tail).\n *\n * Render is graph-layer presentation: no Graph method, no topology mutation, no substrate behavior.\n */\n\nimport type { DescribeEdge, DescribeNode, DescribeSnapshot } from \"./describe.js\";\n\nexport type DiagramDirection = \"TD\" | \"LR\" | \"BT\" | \"RL\";\n\nexport interface DescribeToMermaidOptions {\n\t/** Diagram direction; default \"LR\". */\n\tdirection?: DiagramDirection;\n}\n\nexport type MermaidLiveTheme = \"default\" | \"dark\" | \"forest\" | \"neutral\" | \"base\";\n\nexport interface MermaidLiveUrlOptions {\n\t/** Mermaid Live theme; default \"default\". */\n\ttheme?: MermaidLiveTheme;\n\t/** Mermaid Live auto-sync flag; default true. */\n\tautoSync?: boolean;\n}\n\nexport interface DescribeToMermaidUrlOptions\n\textends DescribeToMermaidOptions,\n\t\tMermaidLiveUrlOptions {}\n\nexport interface DescribeToD2Options {\n\t/** Diagram direction; default \"LR\". */\n\tdirection?: DiagramDirection;\n}\n\nexport interface DescribeToPrettyOptions {\n\t/** Include the Edges section; default true. */\n\tincludeEdges?: boolean;\n}\n\nexport interface DescribeToAsciiOptions {\n\t/** Include cached values; default false. */\n\tincludeValues?: boolean;\n}\n\nexport interface DescribeToJsonOptions {\n\t/** Include edges; default true. */\n\tincludeEdges?: boolean;\n\t/** JSON indent; default 2. */\n\tindent?: number;\n}\n\ninterface FlatSnapshot {\n\tname?: string;\n\tnodes: DescribeNode[];\n\tedges: DescribeEdge[];\n}\n\n/** Render a D39 describe snapshot as Mermaid flowchart text. */\nexport function describeToMermaid(\n\tsnapshot: DescribeSnapshot,\n\topts: DescribeToMermaidOptions = {},\n): string {\n\tconst direction = normalizeDirection(opts.direction);\n\tconst flat = flattenDescribe(snapshot);\n\tconst nodes = sortedNodes(flat.nodes);\n\tconst ids = new Map<string, string>();\n\tfor (let i = 0; i < nodes.length; i += 1) ids.set(nodes[i]!.id, `n${i}`);\n\n\tconst lines = [`flowchart ${direction}`];\n\tfor (const node of nodes) {\n\t\tlines.push(`  ${ids.get(node.id)!}[\"${escapeMermaidLabel(node.id)}\"]`);\n\t}\n\tfor (const edge of sortedEdges(flat.edges)) {\n\t\tconst from = ids.get(edge.from);\n\t\tconst to = ids.get(edge.to);\n\t\tif (from === undefined || to === undefined) continue;\n\t\tlines.push(`  ${from} --> ${to}`);\n\t}\n\treturn lines.join(\"\\n\");\n}\n\n/** Encode arbitrary Mermaid source as a mermaid.live deep link. */\nexport function mermaidLiveUrl(mermaidSource: string, opts: MermaidLiveUrlOptions = {}): string {\n\tconst payload = {\n\t\tcode: mermaidSource,\n\t\tmermaid: { theme: opts.theme ?? \"default\" },\n\t\tautoSync: opts.autoSync ?? true,\n\t};\n\treturn `https://mermaid.live/edit#base64:${base64UrlEncode(JSON.stringify(payload))}`;\n}\n\n/** Render a D39 describe snapshot as a mermaid.live deep link. */\nexport function describeToMermaidUrl(\n\tsnapshot: DescribeSnapshot,\n\topts: DescribeToMermaidUrlOptions = {},\n): string {\n\treturn mermaidLiveUrl(describeToMermaid(snapshot, opts), opts);\n}\n\n/** Render a D39 describe snapshot as D2 diagram text. */\nexport function describeToD2(snapshot: DescribeSnapshot, opts: DescribeToD2Options = {}): string {\n\tconst direction = normalizeDirection(opts.direction);\n\tconst flat = flattenDescribe(snapshot);\n\tconst nodes = sortedNodes(flat.nodes);\n\tconst ids = new Map<string, string>();\n\tfor (let i = 0; i < nodes.length; i += 1) ids.set(nodes[i]!.id, `n${i}`);\n\n\tconst lines = [`direction: ${d2Direction(direction)}`];\n\tfor (const node of nodes) {\n\t\tlines.push(`${ids.get(node.id)!}: \"${escapeD2Label(node.id)}\"`);\n\t}\n\tfor (const edge of sortedEdges(flat.edges)) {\n\t\tconst from = ids.get(edge.from);\n\t\tconst to = ids.get(edge.to);\n\t\tif (from === undefined || to === undefined) continue;\n\t\tlines.push(`${from} -> ${to}`);\n\t}\n\treturn lines.join(\"\\n\");\n}\n\n/** Render a D39 describe snapshot as compact human-readable plaintext. */\nexport function describeToPretty(\n\tsnapshot: DescribeSnapshot,\n\topts: DescribeToPrettyOptions = {},\n): string {\n\tconst flat = flattenDescribe(snapshot);\n\tconst includeEdges = opts.includeEdges ?? true;\n\tconst lines: string[] = [`Graph ${flat.name ?? \"(anonymous)\"}`, \"Nodes:\"];\n\tfor (const node of sortedNodes(flat.nodes)) {\n\t\tlines.push(`- ${node.id} (${node.factory}/${node.status}): ${formatValue(node)}`);\n\t}\n\tif (includeEdges) {\n\t\tlines.push(\"Edges:\");\n\t\tfor (const edge of sortedEdges(flat.edges)) lines.push(`- ${edge.from} -> ${edge.to}`);\n\t}\n\treturn lines.join(\"\\n\");\n}\n\n/** Render a D39 describe snapshot as a compact ASCII adjacency diagram. */\nexport function describeToAscii(\n\tsnapshot: DescribeSnapshot,\n\topts: DescribeToAsciiOptions = {},\n): string {\n\tconst flat = flattenDescribe(snapshot);\n\tconst outgoing = new Map<string, string[]>();\n\tfor (const edge of sortedEdges(flat.edges)) {\n\t\tconst list = outgoing.get(edge.from);\n\t\tif (list) list.push(edge.to);\n\t\telse outgoing.set(edge.from, [edge.to]);\n\t}\n\tconst lines: string[] = [`Graph ${flat.name ?? \"(anonymous)\"}`];\n\tfor (const node of sortedNodes(flat.nodes)) {\n\t\tconst value = opts.includeValues ? ` ${formatValue(node)}` : \"\";\n\t\tconst to = outgoing.get(node.id)?.join(\", \") ?? \"-\";\n\t\tlines.push(`${node.id} [${node.factory}/${node.status}${value}] -> ${to}`);\n\t}\n\treturn lines.join(\"\\n\");\n}\n\n/** Render a D39 describe snapshot as deterministic JSON text. */\nexport function describeToJson(\n\tsnapshot: DescribeSnapshot,\n\topts: DescribeToJsonOptions = {},\n): string {\n\tconst includeEdges = opts.includeEdges ?? true;\n\tconst flat = flattenDescribe(snapshot);\n\tconst payload: FlatSnapshot = {\n\t\t...(flat.name !== undefined ? { name: flat.name } : {}),\n\t\tnodes: sortedNodes(flat.nodes).map((node) => sortJsonValue(node) as DescribeNode),\n\t\tedges: includeEdges ? sortedEdges(flat.edges) : [],\n\t};\n\treturn JSON.stringify(sortJsonValue(payload), null, opts.indent ?? 2);\n}\n\nfunction flattenDescribe(snapshot: DescribeSnapshot): FlatSnapshot {\n\tconst nodes: DescribeNode[] = [];\n\tconst edges: DescribeEdge[] = [];\n\tconst visit = (snap: DescribeSnapshot): void => {\n\t\tnodes.push(...snap.nodes);\n\t\tedges.push(...snap.edges);\n\t\tfor (const child of snap.subgraphs ?? []) visit(child);\n\t};\n\tvisit(snapshot);\n\treturn { ...(snapshot.name !== undefined ? { name: snapshot.name } : {}), nodes, edges };\n}\n\nfunction sortedNodes(nodes: readonly DescribeNode[]): DescribeNode[] {\n\treturn [...nodes].sort((a, b) => compareText(a.id, b.id));\n}\n\nfunction sortedEdges(edges: readonly DescribeEdge[]): DescribeEdge[] {\n\tconst seen = new Set<string>();\n\tconst out: DescribeEdge[] = [];\n\tfor (const edge of edges) {\n\t\tconst key = `${edge.from}\\0${edge.to}`;\n\t\tif (seen.has(key)) continue;\n\t\tseen.add(key);\n\t\tout.push(edge);\n\t}\n\treturn out.sort((a, b) => compareText(a.from, b.from) || compareText(a.to, b.to));\n}\n\nfunction compareText(a: string, b: string): number {\n\treturn a < b ? -1 : a > b ? 1 : 0;\n}\n\nfunction normalizeDirection(direction: unknown): DiagramDirection {\n\tif (direction === undefined) return \"LR\";\n\tif (direction === \"TD\" || direction === \"LR\" || direction === \"BT\" || direction === \"RL\") {\n\t\treturn direction;\n\t}\n\tthrow new Error(\n\t\t`invalid diagram direction ${String(direction)}; expected one of: TD, LR, BT, RL`,\n\t);\n}\n\nfunction d2Direction(direction: DiagramDirection): string {\n\tif (direction === \"TD\") return \"down\";\n\tif (direction === \"BT\") return \"up\";\n\tif (direction === \"RL\") return \"left\";\n\treturn \"right\";\n}\n\nfunction escapeMermaidLabel(value: string): string {\n\treturn escapeQuotedLabel(value);\n}\n\nfunction escapeD2Label(value: string): string {\n\treturn escapeQuotedLabel(value);\n}\n\nfunction escapeQuotedLabel(value: string): string {\n\treturn JSON.stringify(value).slice(1, -1);\n}\n\nfunction formatValue(node: DescribeNode): string {\n\tif (!(\"value\" in node)) return \"<SENTINEL>\";\n\tconst value = node.value;\n\tif (typeof value === \"string\") return JSON.stringify(value);\n\tif (typeof value === \"number\" || typeof value === \"boolean\" || value == null)\n\t\treturn String(value);\n\ttry {\n\t\treturn JSON.stringify(value);\n\t} catch {\n\t\treturn \"[unserializable]\";\n\t}\n}\n\nfunction sortJsonValue(value: unknown, seen: WeakSet<object> = new WeakSet()): unknown {\n\tif (typeof value === \"bigint\") return value.toString();\n\tif (value === null || typeof value !== \"object\") return value;\n\tif (seen.has(value)) return \"[Circular]\";\n\tseen.add(value);\n\tif (Array.isArray(value)) {\n\t\tconst out = value.map((item) => sortJsonValue(item, seen));\n\t\tseen.delete(value);\n\t\treturn out;\n\t}\n\tconst obj = value as Record<string, unknown>;\n\tconst out: Record<string, unknown> = {};\n\tfor (const key of Object.keys(obj).sort(compareText)) out[key] = sortJsonValue(obj[key], seen);\n\tseen.delete(value);\n\treturn out;\n}\n\nconst B64 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\n\nfunction base64UrlEncode(value: string): string {\n\tconst bytes = utf8Bytes(value);\n\tlet out = \"\";\n\tfor (let i = 0; i < bytes.length; i += 3) {\n\t\tconst a = bytes[i]!;\n\t\tconst b = bytes[i + 1];\n\t\tconst c = bytes[i + 2];\n\t\tout += B64[a >> 2];\n\t\tout += B64[((a & 0x03) << 4) | ((b ?? 0) >> 4)];\n\t\tout += b === undefined ? \"=\" : B64[((b & 0x0f) << 2) | ((c ?? 0) >> 6)];\n\t\tout += c === undefined ? \"=\" : B64[c & 0x3f];\n\t}\n\treturn out.replaceAll(\"+\", \"-\").replaceAll(\"/\", \"_\").replace(/=+$/, \"\");\n}\n\nfunction utf8Bytes(value: string): number[] {\n\tconst bytes: number[] = [];\n\tfor (let i = 0; i < value.length; i += 1) {\n\t\tlet cp = value.charCodeAt(i);\n\t\tif (cp >= 0xd800 && cp <= 0xdbff && i + 1 < value.length) {\n\t\t\tconst lo = value.charCodeAt(i + 1);\n\t\t\tif (lo >= 0xdc00 && lo <= 0xdfff) {\n\t\t\t\tcp = 0x10000 + ((cp - 0xd800) << 10) + (lo - 0xdc00);\n\t\t\t\ti += 1;\n\t\t\t}\n\t\t}\n\t\tif (cp <= 0x7f) bytes.push(cp);\n\t\telse if (cp <= 0x7ff) bytes.push(0xc0 | (cp >> 6), 0x80 | (cp & 0x3f));\n\t\telse if (cp <= 0xffff)\n\t\t\tbytes.push(0xe0 | (cp >> 12), 0x80 | ((cp >> 6) & 0x3f), 0x80 | (cp & 0x3f));\n\t\telse\n\t\t\tbytes.push(\n\t\t\t\t0xf0 | (cp >> 18),\n\t\t\t\t0x80 | ((cp >> 12) & 0x3f),\n\t\t\t\t0x80 | ((cp >> 6) & 0x3f),\n\t\t\t\t0x80 | (cp & 0x3f),\n\t\t\t);\n\t}\n\treturn bytes;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACyDO,SAAS,kBACf,UACA,OAAiC,CAAC,GACzB;AACT,QAAM,YAAY,mBAAmB,KAAK,SAAS;AACnD,QAAM,OAAO,gBAAgB,QAAQ;AACrC,QAAM,QAAQ,YAAY,KAAK,KAAK;AACpC,QAAM,MAAM,oBAAI,IAAoB;AACpC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EAAG,KAAI,IAAI,MAAM,CAAC,EAAG,IAAI,IAAI,CAAC,EAAE;AAEvE,QAAM,QAAQ,CAAC,aAAa,SAAS,EAAE;AACvC,aAAW,QAAQ,OAAO;AACzB,UAAM,KAAK,KAAK,IAAI,IAAI,KAAK,EAAE,CAAE,KAAK,mBAAmB,KAAK,EAAE,CAAC,IAAI;AAAA,EACtE;AACA,aAAW,QAAQ,YAAY,KAAK,KAAK,GAAG;AAC3C,UAAM,OAAO,IAAI,IAAI,KAAK,IAAI;AAC9B,UAAM,KAAK,IAAI,IAAI,KAAK,EAAE;AAC1B,QAAI,SAAS,UAAa,OAAO,OAAW;AAC5C,UAAM,KAAK,KAAK,IAAI,QAAQ,EAAE,EAAE;AAAA,EACjC;AACA,SAAO,MAAM,KAAK,IAAI;AACvB;AAGO,SAAS,eAAe,eAAuB,OAA8B,CAAC,GAAW;AAC/F,QAAM,UAAU;AAAA,IACf,MAAM;AAAA,IACN,SAAS,EAAE,OAAO,KAAK,SAAS,UAAU;AAAA,IAC1C,UAAU,KAAK,YAAY;AAAA,EAC5B;AACA,SAAO,oCAAoC,gBAAgB,KAAK,UAAU,OAAO,CAAC,CAAC;AACpF;AAGO,SAAS,qBACf,UACA,OAAoC,CAAC,GAC5B;AACT,SAAO,eAAe,kBAAkB,UAAU,IAAI,GAAG,IAAI;AAC9D;AAGO,SAAS,aAAa,UAA4B,OAA4B,CAAC,GAAW;AAChG,QAAM,YAAY,mBAAmB,KAAK,SAAS;AACnD,QAAM,OAAO,gBAAgB,QAAQ;AACrC,QAAM,QAAQ,YAAY,KAAK,KAAK;AACpC,QAAM,MAAM,oBAAI,IAAoB;AACpC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EAAG,KAAI,IAAI,MAAM,CAAC,EAAG,IAAI,IAAI,CAAC,EAAE;AAEvE,QAAM,QAAQ,CAAC,cAAc,YAAY,SAAS,CAAC,EAAE;AACrD,aAAW,QAAQ,OAAO;AACzB,UAAM,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE,CAAE,MAAM,cAAc,KAAK,EAAE,CAAC,GAAG;AAAA,EAC/D;AACA,aAAW,QAAQ,YAAY,KAAK,KAAK,GAAG;AAC3C,UAAM,OAAO,IAAI,IAAI,KAAK,IAAI;AAC9B,UAAM,KAAK,IAAI,IAAI,KAAK,EAAE;AAC1B,QAAI,SAAS,UAAa,OAAO,OAAW;AAC5C,UAAM,KAAK,GAAG,IAAI,OAAO,EAAE,EAAE;AAAA,EAC9B;AACA,SAAO,MAAM,KAAK,IAAI;AACvB;AAGO,SAAS,iBACf,UACA,OAAgC,CAAC,GACxB;AACT,QAAM,OAAO,gBAAgB,QAAQ;AACrC,QAAM,eAAe,KAAK,gBAAgB;AAC1C,QAAM,QAAkB,CAAC,SAAS,KAAK,QAAQ,aAAa,IAAI,QAAQ;AACxE,aAAW,QAAQ,YAAY,KAAK,KAAK,GAAG;AAC3C,UAAM,KAAK,KAAK,KAAK,EAAE,KAAK,KAAK,OAAO,IAAI,KAAK,MAAM,MAAM,YAAY,IAAI,CAAC,EAAE;AAAA,EACjF;AACA,MAAI,cAAc;AACjB,UAAM,KAAK,QAAQ;AACnB,eAAW,QAAQ,YAAY,KAAK,KAAK,EAAG,OAAM,KAAK,KAAK,KAAK,IAAI,OAAO,KAAK,EAAE,EAAE;AAAA,EACtF;AACA,SAAO,MAAM,KAAK,IAAI;AACvB;AAGO,SAAS,gBACf,UACA,OAA+B,CAAC,GACvB;AACT,QAAM,OAAO,gBAAgB,QAAQ;AACrC,QAAM,WAAW,oBAAI,IAAsB;AAC3C,aAAW,QAAQ,YAAY,KAAK,KAAK,GAAG;AAC3C,UAAM,OAAO,SAAS,IAAI,KAAK,IAAI;AACnC,QAAI,KAAM,MAAK,KAAK,KAAK,EAAE;AAAA,QACtB,UAAS,IAAI,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC;AAAA,EACvC;AACA,QAAM,QAAkB,CAAC,SAAS,KAAK,QAAQ,aAAa,EAAE;AAC9D,aAAW,QAAQ,YAAY,KAAK,KAAK,GAAG;AAC3C,UAAM,QAAQ,KAAK,gBAAgB,IAAI,YAAY,IAAI,CAAC,KAAK;AAC7D,UAAM,KAAK,SAAS,IAAI,KAAK,EAAE,GAAG,KAAK,IAAI,KAAK;AAChD,UAAM,KAAK,GAAG,KAAK,EAAE,KAAK,KAAK,OAAO,IAAI,KAAK,MAAM,GAAG,KAAK,QAAQ,EAAE,EAAE;AAAA,EAC1E;AACA,SAAO,MAAM,KAAK,IAAI;AACvB;AAGO,SAAS,eACf,UACA,OAA8B,CAAC,GACtB;AACT,QAAM,eAAe,KAAK,gBAAgB;AAC1C,QAAM,OAAO,gBAAgB,QAAQ;AACrC,QAAM,UAAwB;AAAA,IAC7B,GAAI,KAAK,SAAS,SAAY,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;AAAA,IACrD,OAAO,YAAY,KAAK,KAAK,EAAE,IAAI,CAAC,SAAS,cAAc,IAAI,CAAiB;AAAA,IAChF,OAAO,eAAe,YAAY,KAAK,KAAK,IAAI,CAAC;AAAA,EAClD;AACA,SAAO,KAAK,UAAU,cAAc,OAAO,GAAG,MAAM,KAAK,UAAU,CAAC;AACrE;AAEA,SAAS,gBAAgB,UAA0C;AAClE,QAAM,QAAwB,CAAC;AAC/B,QAAM,QAAwB,CAAC;AAC/B,QAAM,QAAQ,CAAC,SAAiC;AAC/C,UAAM,KAAK,GAAG,KAAK,KAAK;AACxB,UAAM,KAAK,GAAG,KAAK,KAAK;AACxB,eAAW,SAAS,KAAK,aAAa,CAAC,EAAG,OAAM,KAAK;AAAA,EACtD;AACA,QAAM,QAAQ;AACd,SAAO,EAAE,GAAI,SAAS,SAAS,SAAY,EAAE,MAAM,SAAS,KAAK,IAAI,CAAC,GAAI,OAAO,MAAM;AACxF;AAEA,SAAS,YAAY,OAAgD;AACpE,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,YAAY,EAAE,IAAI,EAAE,EAAE,CAAC;AACzD;AAEA,SAAS,YAAY,OAAgD;AACpE,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,MAAsB,CAAC;AAC7B,aAAW,QAAQ,OAAO;AACzB,UAAM,MAAM,GAAG,KAAK,IAAI,KAAK,KAAK,EAAE;AACpC,QAAI,KAAK,IAAI,GAAG,EAAG;AACnB,SAAK,IAAI,GAAG;AACZ,QAAI,KAAK,IAAI;AAAA,EACd;AACA,SAAO,IAAI,KAAK,CAAC,GAAG,MAAM,YAAY,EAAE,MAAM,EAAE,IAAI,KAAK,YAAY,EAAE,IAAI,EAAE,EAAE,CAAC;AACjF;AAEA,SAAS,YAAY,GAAW,GAAmB;AAClD,SAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AACjC;AAEA,SAAS,mBAAmB,WAAsC;AACjE,MAAI,cAAc,OAAW,QAAO;AACpC,MAAI,cAAc,QAAQ,cAAc,QAAQ,cAAc,QAAQ,cAAc,MAAM;AACzF,WAAO;AAAA,EACR;AACA,QAAM,IAAI;AAAA,IACT,6BAA6B,OAAO,SAAS,CAAC;AAAA,EAC/C;AACD;AAEA,SAAS,YAAY,WAAqC;AACzD,MAAI,cAAc,KAAM,QAAO;AAC/B,MAAI,cAAc,KAAM,QAAO;AAC/B,MAAI,cAAc,KAAM,QAAO;AAC/B,SAAO;AACR;AAEA,SAAS,mBAAmB,OAAuB;AAClD,SAAO,kBAAkB,KAAK;AAC/B;AAEA,SAAS,cAAc,OAAuB;AAC7C,SAAO,kBAAkB,KAAK;AAC/B;AAEA,SAAS,kBAAkB,OAAuB;AACjD,SAAO,KAAK,UAAU,KAAK,EAAE,MAAM,GAAG,EAAE;AACzC;AAEA,SAAS,YAAY,MAA4B;AAChD,MAAI,EAAE,WAAW,MAAO,QAAO;AAC/B,QAAM,QAAQ,KAAK;AACnB,MAAI,OAAO,UAAU,SAAU,QAAO,KAAK,UAAU,KAAK;AAC1D,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,aAAa,SAAS;AACvE,WAAO,OAAO,KAAK;AACpB,MAAI;AACH,WAAO,KAAK,UAAU,KAAK;AAAA,EAC5B,QAAQ;AACP,WAAO;AAAA,EACR;AACD;AAEA,SAAS,cAAc,OAAgB,OAAwB,oBAAI,QAAQ,GAAY;AACtF,MAAI,OAAO,UAAU,SAAU,QAAO,MAAM,SAAS;AACrD,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AACxD,MAAI,KAAK,IAAI,KAAK,EAAG,QAAO;AAC5B,OAAK,IAAI,KAAK;AACd,MAAI,MAAM,QAAQ,KAAK,GAAG;AACzB,UAAMA,OAAM,MAAM,IAAI,CAAC,SAAS,cAAc,MAAM,IAAI,CAAC;AACzD,SAAK,OAAO,KAAK;AACjB,WAAOA;AAAA,EACR;AACA,QAAM,MAAM;AACZ,QAAM,MAA+B,CAAC;AACtC,aAAW,OAAO,OAAO,KAAK,GAAG,EAAE,KAAK,WAAW,EAAG,KAAI,GAAG,IAAI,cAAc,IAAI,GAAG,GAAG,IAAI;AAC7F,OAAK,OAAO,KAAK;AACjB,SAAO;AACR;AAEA,IAAM,MAAM;AAEZ,SAAS,gBAAgB,OAAuB;AAC/C,QAAM,QAAQ,UAAU,KAAK;AAC7B,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,UAAM,IAAI,MAAM,CAAC;AACjB,UAAM,IAAI,MAAM,IAAI,CAAC;AACrB,UAAM,IAAI,MAAM,IAAI,CAAC;AACrB,WAAO,IAAI,KAAK,CAAC;AACjB,WAAO,KAAM,IAAI,MAAS,KAAO,KAAK,MAAM,CAAE;AAC9C,WAAO,MAAM,SAAY,MAAM,KAAM,IAAI,OAAS,KAAO,KAAK,MAAM,CAAE;AACtE,WAAO,MAAM,SAAY,MAAM,IAAI,IAAI,EAAI;AAAA,EAC5C;AACA,SAAO,IAAI,WAAW,KAAK,GAAG,EAAE,WAAW,KAAK,GAAG,EAAE,QAAQ,OAAO,EAAE;AACvE;AAEA,SAAS,UAAU,OAAyB;AAC3C,QAAM,QAAkB,CAAC;AACzB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,QAAI,KAAK,MAAM,WAAW,CAAC;AAC3B,QAAI,MAAM,SAAU,MAAM,SAAU,IAAI,IAAI,MAAM,QAAQ;AACzD,YAAM,KAAK,MAAM,WAAW,IAAI,CAAC;AACjC,UAAI,MAAM,SAAU,MAAM,OAAQ;AACjC,aAAK,SAAY,KAAK,SAAW,OAAO,KAAK;AAC7C,aAAK;AAAA,MACN;AAAA,IACD;AACA,QAAI,MAAM,IAAM,OAAM,KAAK,EAAE;AAAA,aACpB,MAAM,KAAO,OAAM,KAAK,MAAQ,MAAM,GAAI,MAAQ,KAAK,EAAK;AAAA,aAC5D,MAAM;AACd,YAAM,KAAK,MAAQ,MAAM,IAAK,MAAS,MAAM,IAAK,IAAO,MAAQ,KAAK,EAAK;AAAA;AAE3E,YAAM;AAAA,QACL,MAAQ,MAAM;AAAA,QACd,MAAS,MAAM,KAAM;AAAA,QACrB,MAAS,MAAM,IAAK;AAAA,QACpB,MAAQ,KAAK;AAAA,MACd;AAAA,EACF;AACA,SAAO;AACR;","names":["out"]}

package/dist/render/index.d.cts

@@ -0,0 +1,58 @@
+import { c as DescribeSnapshot } from '../describe-Ciu8SUnN.cjs';
+import '../types-bNMSWKqF.cjs';
+import '../messages-BZqrGGm1.cjs';
+
+/**
+ * Pure renderers over `DescribeSnapshot` (D39 / D40 tail).
+ *
+ * Render is graph-layer presentation: no Graph method, no topology mutation, no substrate behavior.
+ */
+
+type DiagramDirection = "TD" | "LR" | "BT" | "RL";
+interface DescribeToMermaidOptions {
+    /** Diagram direction; default "LR". */
+    direction?: DiagramDirection;
+}
+type MermaidLiveTheme = "default" | "dark" | "forest" | "neutral" | "base";
+interface MermaidLiveUrlOptions {
+    /** Mermaid Live theme; default "default". */
+    theme?: MermaidLiveTheme;
+    /** Mermaid Live auto-sync flag; default true. */
+    autoSync?: boolean;
+}
+interface DescribeToMermaidUrlOptions extends DescribeToMermaidOptions, MermaidLiveUrlOptions {
+}
+interface DescribeToD2Options {
+    /** Diagram direction; default "LR". */
+    direction?: DiagramDirection;
+}
+interface DescribeToPrettyOptions {
+    /** Include the Edges section; default true. */
+    includeEdges?: boolean;
+}
+interface DescribeToAsciiOptions {
+    /** Include cached values; default false. */
+    includeValues?: boolean;
+}
+interface DescribeToJsonOptions {
+    /** Include edges; default true. */
+    includeEdges?: boolean;
+    /** JSON indent; default 2. */
+    indent?: number;
+}
+/** Render a D39 describe snapshot as Mermaid flowchart text. */
+declare function describeToMermaid(snapshot: DescribeSnapshot, opts?: DescribeToMermaidOptions): string;
+/** Encode arbitrary Mermaid source as a mermaid.live deep link. */
+declare function mermaidLiveUrl(mermaidSource: string, opts?: MermaidLiveUrlOptions): string;
+/** Render a D39 describe snapshot as a mermaid.live deep link. */
+declare function describeToMermaidUrl(snapshot: DescribeSnapshot, opts?: DescribeToMermaidUrlOptions): string;
+/** Render a D39 describe snapshot as D2 diagram text. */
+declare function describeToD2(snapshot: DescribeSnapshot, opts?: DescribeToD2Options): string;
+/** Render a D39 describe snapshot as compact human-readable plaintext. */
+declare function describeToPretty(snapshot: DescribeSnapshot, opts?: DescribeToPrettyOptions): string;
+/** Render a D39 describe snapshot as a compact ASCII adjacency diagram. */
+declare function describeToAscii(snapshot: DescribeSnapshot, opts?: DescribeToAsciiOptions): string;
+/** Render a D39 describe snapshot as deterministic JSON text. */
+declare function describeToJson(snapshot: DescribeSnapshot, opts?: DescribeToJsonOptions): string;
+
+export { type DescribeToAsciiOptions, type DescribeToD2Options, type DescribeToJsonOptions, type DescribeToMermaidOptions, type DescribeToMermaidUrlOptions, type DescribeToPrettyOptions, type DiagramDirection, type MermaidLiveTheme, type MermaidLiveUrlOptions, describeToAscii, describeToD2, describeToJson, describeToMermaid, describeToMermaidUrl, describeToPretty, mermaidLiveUrl };

package/dist/render/index.d.ts

@@ -0,0 +1,58 @@
+import { c as DescribeSnapshot } from '../describe-BZb7AS2y.js';
+import '../types-h12mNYbq.js';
+import '../messages-BZqrGGm1.js';
+
+/**
+ * Pure renderers over `DescribeSnapshot` (D39 / D40 tail).
+ *
+ * Render is graph-layer presentation: no Graph method, no topology mutation, no substrate behavior.
+ */
+
+type DiagramDirection = "TD" | "LR" | "BT" | "RL";
+interface DescribeToMermaidOptions {
+    /** Diagram direction; default "LR". */
+    direction?: DiagramDirection;
+}
+type MermaidLiveTheme = "default" | "dark" | "forest" | "neutral" | "base";
+interface MermaidLiveUrlOptions {
+    /** Mermaid Live theme; default "default". */
+    theme?: MermaidLiveTheme;
+    /** Mermaid Live auto-sync flag; default true. */
+    autoSync?: boolean;
+}
+interface DescribeToMermaidUrlOptions extends DescribeToMermaidOptions, MermaidLiveUrlOptions {
+}
+interface DescribeToD2Options {
+    /** Diagram direction; default "LR". */
+    direction?: DiagramDirection;
+}
+interface DescribeToPrettyOptions {
+    /** Include the Edges section; default true. */
+    includeEdges?: boolean;
+}
+interface DescribeToAsciiOptions {
+    /** Include cached values; default false. */
+    includeValues?: boolean;
+}
+interface DescribeToJsonOptions {
+    /** Include edges; default true. */
+    includeEdges?: boolean;
+    /** JSON indent; default 2. */
+    indent?: number;
+}
+/** Render a D39 describe snapshot as Mermaid flowchart text. */
+declare function describeToMermaid(snapshot: DescribeSnapshot, opts?: DescribeToMermaidOptions): string;
+/** Encode arbitrary Mermaid source as a mermaid.live deep link. */
+declare function mermaidLiveUrl(mermaidSource: string, opts?: MermaidLiveUrlOptions): string;
+/** Render a D39 describe snapshot as a mermaid.live deep link. */
+declare function describeToMermaidUrl(snapshot: DescribeSnapshot, opts?: DescribeToMermaidUrlOptions): string;
+/** Render a D39 describe snapshot as D2 diagram text. */
+declare function describeToD2(snapshot: DescribeSnapshot, opts?: DescribeToD2Options): string;
+/** Render a D39 describe snapshot as compact human-readable plaintext. */
+declare function describeToPretty(snapshot: DescribeSnapshot, opts?: DescribeToPrettyOptions): string;
+/** Render a D39 describe snapshot as a compact ASCII adjacency diagram. */
+declare function describeToAscii(snapshot: DescribeSnapshot, opts?: DescribeToAsciiOptions): string;
+/** Render a D39 describe snapshot as deterministic JSON text. */
+declare function describeToJson(snapshot: DescribeSnapshot, opts?: DescribeToJsonOptions): string;
+
+export { type DescribeToAsciiOptions, type DescribeToD2Options, type DescribeToJsonOptions, type DescribeToMermaidOptions, type DescribeToMermaidUrlOptions, type DescribeToPrettyOptions, type DiagramDirection, type MermaidLiveTheme, type MermaidLiveUrlOptions, describeToAscii, describeToD2, describeToJson, describeToMermaid, describeToMermaidUrl, describeToPretty, mermaidLiveUrl };

package/dist/render/index.js

@@ -0,0 +1,20 @@
+import "../chunk-GAJW5I5P.js";
+import {
+  describeToAscii,
+  describeToD2,
+  describeToJson,
+  describeToMermaid,
+  describeToMermaidUrl,
+  describeToPretty,
+  mermaidLiveUrl
+} from "../chunk-HDRL4VQQ.js";
+export {
+  describeToAscii,
+  describeToD2,
+  describeToJson,
+  describeToMermaid,
+  describeToMermaidUrl,
+  describeToPretty,
+  mermaidLiveUrl
+};
+//# sourceMappingURL=index.js.map

package/dist/render/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/resilience-Dig3Q7n0.d.cts

@@ -0,0 +1,45 @@
+/**
+ * Passive resilience policy helpers for graph-visible adapters (D130/D132).
+ *
+ * These helpers never schedule work and never own graph state. Drivers/adapters
+ * consume them, while graph-visible bundles expose attempts/status/errors.
+ */
+type BackoffPolicy = {
+    readonly kind: "none";
+} | {
+    readonly kind: "constant";
+    readonly delayMs: number;
+} | {
+    readonly kind: "linear";
+    readonly initialMs: number;
+    readonly stepMs: number;
+    readonly maxMs?: number;
+} | {
+    readonly kind: "exponential";
+    readonly initialMs: number;
+    readonly factor: number;
+    readonly maxMs?: number;
+} | {
+    readonly kind: "fibonacci";
+    readonly unitMs: number;
+    readonly maxMs?: number;
+};
+interface RetryPolicy {
+    /** Total attempts including the first try. */
+    readonly maxAttempts: number;
+    readonly backoff: BackoffPolicy;
+}
+type RetryState = "idle" | "running" | "waiting" | "succeeded" | "failed" | "exhausted";
+interface RetryStatus {
+    readonly attempt: number;
+    readonly maxAttempts: number;
+    readonly delayMs?: number;
+    readonly state: RetryState;
+}
+declare const noBackoff: BackoffPolicy;
+declare function retryPolicy(maxAttempts?: number, backoff?: BackoffPolicy): RetryPolicy;
+declare function shouldRetry(policy: RetryPolicy, failedAttempt: number): boolean;
+declare function nextRetryDelayMs(policy: RetryPolicy, nextAttempt: number): number | undefined;
+declare function backoffDelayMs(policy: BackoffPolicy, attempt: number): number;
+
+export { type BackoffPolicy as B, type RetryPolicy as R, type RetryState as a, type RetryStatus as b, backoffDelayMs as c, noBackoff as d, nextRetryDelayMs as n, retryPolicy as r, shouldRetry as s };

package/dist/resilience-Dig3Q7n0.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Passive resilience policy helpers for graph-visible adapters (D130/D132).
+ *
+ * These helpers never schedule work and never own graph state. Drivers/adapters
+ * consume them, while graph-visible bundles expose attempts/status/errors.
+ */
+type BackoffPolicy = {
+    readonly kind: "none";
+} | {
+    readonly kind: "constant";
+    readonly delayMs: number;
+} | {
+    readonly kind: "linear";
+    readonly initialMs: number;
+    readonly stepMs: number;
+    readonly maxMs?: number;
+} | {
+    readonly kind: "exponential";
+    readonly initialMs: number;
+    readonly factor: number;
+    readonly maxMs?: number;
+} | {
+    readonly kind: "fibonacci";
+    readonly unitMs: number;
+    readonly maxMs?: number;
+};
+interface RetryPolicy {
+    /** Total attempts including the first try. */
+    readonly maxAttempts: number;
+    readonly backoff: BackoffPolicy;
+}
+type RetryState = "idle" | "running" | "waiting" | "succeeded" | "failed" | "exhausted";
+interface RetryStatus {
+    readonly attempt: number;
+    readonly maxAttempts: number;
+    readonly delayMs?: number;
+    readonly state: RetryState;
+}
+declare const noBackoff: BackoffPolicy;
+declare function retryPolicy(maxAttempts?: number, backoff?: BackoffPolicy): RetryPolicy;
+declare function shouldRetry(policy: RetryPolicy, failedAttempt: number): boolean;
+declare function nextRetryDelayMs(policy: RetryPolicy, nextAttempt: number): number | undefined;
+declare function backoffDelayMs(policy: BackoffPolicy, attempt: number): number;
+
+export { type BackoffPolicy as B, type RetryPolicy as R, type RetryState as a, type RetryStatus as b, backoffDelayMs as c, noBackoff as d, nextRetryDelayMs as n, retryPolicy as r, shouldRetry as s };

package/dist/semantic-memory-graph-BYoIlP35.d.cts

@@ -0,0 +1,356 @@
+import { d as Graph } from './graph-s23RbbFO.cjs';
+import { N as Node } from './types-bNMSWKqF.cjs';
+import { b as StrictJsonValue } from './codec-BB7p8fJc.cjs';
+
+/**
+ * Passive semantic-memory vocabulary and deterministic helpers.
+ *
+ * D158 splits semantic memory into horizontal patterns and vertical solutions.
+ * This module intentionally owns no graph nodes, storage restore, timers,
+ * subscriptions, vector indexes, knowledge graphs, or agentic runtime.
+ */
+
+/** Stable identity for a semantic-memory fact. */
+type FactId = string;
+/** Shard partition key used by passive sharding helpers. */
+type ShardKey = string | number;
+/**
+ * A single semantic-memory fact. Pattern convention only: this is not a
+ * protocol message, storage record owner, restore contract, or graph runtime.
+ */
+interface MemoryFragment<T = unknown> {
+    readonly id: FactId;
+    readonly payload: T;
+    /** Transaction time, typically monotonic nanoseconds. */
+    readonly tNs: bigint;
+    /** Valid-time start. Undefined means unbounded past. */
+    readonly validFrom?: bigint;
+    /** Valid-time end. Undefined means currently valid. */
+    readonly validTo?: bigint;
+    /** Confidence score in the closed interval [0, 1]. */
+    readonly confidence: number;
+    readonly tags: readonly string[];
+    /** Fact ids this fragment derives from or depends on. */
+    readonly sources: readonly FactId[];
+    readonly embedding?: readonly number[];
+    readonly parentFragmentId?: FactId;
+    readonly provenance?: string;
+}
+/** Columnar passive store vocabulary for callers that keep memory facts outside GraphReFly. */
+interface FactStore<T = unknown> {
+    readonly byId: ReadonlyMap<FactId, MemoryFragment<T>>;
+}
+/** Read-only projection passed to scoring policies; it exposes no mutation surface. */
+interface StoreReadHandle<T = unknown> {
+    get(id: FactId): MemoryFragment<T> | undefined;
+    has(id: FactId): boolean;
+    readonly size: number;
+    values(): IterableIterator<MemoryFragment<T>>;
+}
+type ScoringPolicy<T = unknown> = (fragment: MemoryFragment<T>, store: StoreReadHandle<T>) => number;
+type DecayPolicy = (confidence: number, ageNs: bigint) => number;
+type AdmissionFilter<T = unknown> = (fragment: MemoryFragment<T>) => boolean;
+/** Outcome signal for policy learning. This is an application fact, not a protocol event. */
+interface OutcomeSignal {
+    readonly factId: FactId;
+    readonly reward: number;
+}
+/** Passive structured query over semantic-memory facts. */
+interface MemoryQuery {
+    readonly tags?: readonly string[];
+    readonly asOf?: bigint;
+    readonly minConfidence?: number;
+    readonly limit?: number;
+}
+interface MemoryAnswer<T = unknown> {
+    readonly query: MemoryQuery;
+    readonly results: readonly MemoryFragment<T>[];
+}
+type KnowledgeAssertionStrictJsonValue = StrictJsonValue;
+/** Passive KG endpoint vocabulary. Entity ids are DATA keys, not graph node ids. */
+interface KnowledgeAssertionSubject {
+    readonly id: FactId;
+    readonly type?: string;
+}
+/** Passive KG object/value vocabulary. */
+type KnowledgeAssertionObject = {
+    readonly kind: "entity";
+    readonly id: FactId;
+    readonly type?: string;
+} | {
+    readonly kind: "value";
+    readonly value: KnowledgeAssertionStrictJsonValue;
+    readonly valueType?: string;
+};
+/** Passive KG assertion fact consumed by lower semantic-memory graph patterns. */
+interface KnowledgeAssertion {
+    readonly id: FactId;
+    readonly recordId?: FactId;
+    readonly fragmentId?: FactId;
+    readonly subject: KnowledgeAssertionSubject;
+    readonly predicate: string;
+    readonly object: KnowledgeAssertionObject;
+    readonly confidence?: number;
+    readonly sources?: readonly FactId[];
+    readonly provenance?: string;
+}
+/** Entry vocabulary for ranked collection-like memory views. */
+interface CollectionEntry<T = unknown> {
+    readonly id: string;
+    readonly value: T;
+    readonly createdAtNs: bigint;
+    readonly lastAccessNs: bigint;
+    readonly baseScore: number;
+}
+type RankedCollectionEntry<T = unknown> = CollectionEntry<T> & {
+    readonly score: number;
+};
+type CollectionScoreFn<T = unknown> = (value: T) => number;
+/** Query shape shared by passive retrieval/ranking helpers. */
+interface RetrievalQuery {
+    readonly text?: string;
+    readonly vector?: readonly number[];
+    readonly entityIds?: readonly string[];
+    readonly context?: readonly string[];
+}
+interface VectorSearchResult<TMeta = unknown> {
+    readonly id: string;
+    readonly score: number;
+    readonly meta?: TMeta;
+}
+interface RetrievalEntry<TMem = unknown> {
+    readonly key: string;
+    readonly value: TMem;
+    readonly score: number;
+    readonly sources: ReadonlyArray<"vector" | "graph" | "store">;
+    readonly context?: readonly string[];
+}
+interface RetrievalTrace<TMem = unknown> {
+    readonly vectorCandidates: ReadonlyArray<VectorSearchResult<TMem>>;
+    readonly graphExpanded: ReadonlyArray<string>;
+    readonly ranked: ReadonlyArray<RetrievalEntry<TMem>>;
+    readonly packed: ReadonlyArray<RetrievalEntry<TMem>>;
+}
+/** Generic per-dimension thresholds. Any configured dimension below threshold is rejected. */
+type AdmissionThresholds<Dims extends string> = Partial<Record<Dims, number>>;
+interface AdmissionScoredOptions<Dims extends string, TRaw = unknown> {
+    readonly scoreFn: (raw: TRaw) => Readonly<Record<Dims, number>>;
+    readonly thresholds?: AdmissionThresholds<Dims>;
+}
+interface AdmissionScores {
+    readonly persistence: number;
+    readonly structure: number;
+    readonly personalValue: number;
+}
+interface AdmissionScore3DOptions {
+    readonly scoreFn: (raw: unknown) => AdmissionScores;
+    readonly persistenceThreshold?: number;
+    readonly personalValueThreshold?: number;
+    readonly requireStructured?: boolean;
+}
+interface ShardByTenantOptions {
+    readonly tenants?: readonly string[];
+    readonly shardCount?: number;
+}
+interface ShardByTenantConfig<T = unknown> {
+    readonly shardBy: (fragment: MemoryFragment<T>) => ShardKey;
+    readonly shardCount: number;
+}
+interface MemoryFragmentValidation {
+    readonly ok: boolean;
+    readonly errors: readonly string[];
+}
+/** Cosine similarity over zero-padded vectors. Non-finite results normalize to 0. */
+declare function cosineSimilarity(a: readonly number[], b: readonly number[]): number;
+/**
+ * Returns true when a fragment is valid at `asOf`.
+ *
+ * Omitted `asOf` has no clock to compare against, so it admits only fragments
+ * that are live and not valid-time delayed.
+ */
+declare function memoryFragmentValidAt(fragment: MemoryFragment, asOf?: bigint): boolean;
+/** Pure structured-query predicate over a single fragment. */
+declare function memoryFragmentMatchesQuery(fragment: MemoryFragment, query?: MemoryQuery): boolean;
+/** Filter and rank fragments by confidence desc, then transaction time desc. */
+declare function filterMemoryFragments<T>(fragments: Iterable<MemoryFragment<T>>, query?: MemoryQuery): readonly MemoryFragment<T>[];
+/** Validate the passive MemoryFragment shape without throwing. */
+declare function validateMemoryFragment(value: unknown): MemoryFragmentValidation;
+declare function isMemoryFragment(value: unknown): value is MemoryFragment;
+/**
+ * Generic N-dimension admission filter. Missing or non-finite thresholded scores reject.
+ */
+declare function admissionScored<Dims extends string, TRaw = unknown>(opts: AdmissionScoredOptions<Dims, TRaw>): (raw: TRaw) => boolean;
+/** Three-axis admission sugar for persistence / structure / personal-value scoring. */
+declare function admissionFilter3D(opts: AdmissionScore3DOptions): (raw: unknown) => boolean;
+/** Build a passive `{ shardBy, shardCount }` pair for tenant-isolated sharding. */
+declare function shardByTenant<T>(tenantOf: (fragment: MemoryFragment<T>) => string, opts?: ShardByTenantOptions): ShardByTenantConfig<T>;
+
+/**
+ * Graph-visible semantic-memory retrieval patterns.
+ *
+ * D158 allows horizontal semantic-memory patterns when they are ordinary graph
+ * nodes with declared deps and graph-visible facts. This file intentionally
+ * owns no storage restore/hydration, scheduler, hidden subscription, vector DB,
+ * retention loop, consolidation loop, Graph subclass, or protocol behavior.
+ */
+
+/** Query shape for the first graph-visible retrieval bundle. */
+interface MemoryRetrievalQuery extends MemoryQuery {
+    /** Optional dense embedding used only for deterministic in-memory ranking. */
+    readonly vector?: readonly number[];
+}
+interface MemoryRetrievalCursor {
+    readonly evaluation: number;
+    readonly validFragments: number;
+    readonly invalidFragments: number;
+    readonly resultCount: number;
+}
+type MemoryRetrievalStatusState = "ready" | "empty" | "partial" | "error";
+interface MemoryRetrievalStatus {
+    readonly state: MemoryRetrievalStatusState;
+    readonly query: MemoryRetrievalQuery;
+    readonly cursor: MemoryRetrievalCursor;
+}
+interface MemoryRetrievalIndex<T = unknown> {
+    readonly ids: readonly FactId[];
+    readonly byId: Readonly<Record<FactId, MemoryFragment<T>>>;
+    readonly cursor: MemoryRetrievalCursor;
+}
+type MemoryRetrievalErrorCode = "duplicate-fragment-id" | "invalid-fragments-input" | "invalid-fragment" | "invalid-query" | "invalid-query-vector";
+interface MemoryRetrievalError {
+    readonly code: MemoryRetrievalErrorCode;
+    readonly message: string;
+    readonly index?: number;
+    readonly fragment?: unknown;
+    readonly validationErrors?: readonly string[];
+    readonly cursor: MemoryRetrievalCursor;
+}
+interface MemoryRetrievalSnapshot<T = unknown> {
+    readonly fragments: readonly MemoryFragment<T>[];
+    readonly indexed: MemoryRetrievalIndex<T>;
+    readonly ranked: MemoryAnswer<T>;
+    readonly status: MemoryRetrievalStatus;
+    readonly errors: readonly MemoryRetrievalError[];
+    readonly cursor: MemoryRetrievalCursor;
+}
+type MemoryRetrievalFact<T = unknown> = MemoryRetrievalSnapshot<T>;
+interface KnowledgeGraphEntity {
+    readonly id: FactId;
+    readonly type?: string;
+    readonly assertionIds: readonly FactId[];
+    readonly subjectAssertionIds: readonly FactId[];
+    readonly objectAssertionIds: readonly FactId[];
+}
+interface KnowledgeGraphRelation {
+    readonly assertionId: FactId;
+    readonly subject: KnowledgeAssertionSubject;
+    readonly predicate: string;
+    readonly object: KnowledgeAssertionObject;
+    readonly confidence?: number;
+    readonly sources: readonly FactId[];
+    readonly provenance?: string;
+}
+interface KnowledgeGraphTopic {
+    readonly predicate: string;
+    readonly assertionIds: readonly FactId[];
+    readonly entityIds: readonly FactId[];
+}
+interface KnowledgeGraphIndex {
+    readonly assertionIds: readonly FactId[];
+    readonly entityIds: readonly FactId[];
+    readonly relationIds: readonly FactId[];
+    readonly predicates: readonly string[];
+}
+interface KnowledgeGraphPolicy {
+    readonly allowedPredicates?: readonly string[];
+    readonly requireEntityTypes?: boolean;
+}
+interface KnowledgeGraphCursor {
+    readonly evaluation: number;
+    readonly validAssertions: number;
+    readonly invalidAssertions: number;
+    readonly entityCount: number;
+    readonly relationCount: number;
+    readonly predicateCount: number;
+}
+type KnowledgeGraphStatusState = "ready" | "empty" | "partial" | "error";
+interface KnowledgeGraphStatus {
+    readonly state: KnowledgeGraphStatusState;
+    readonly cursor: KnowledgeGraphCursor;
+}
+type KnowledgeGraphErrorCode = "invalid-assertions-input" | "invalid-assertion" | "duplicate-assertion-id" | "invalid-policy" | "policy-conflict";
+interface KnowledgeGraphError {
+    readonly code: KnowledgeGraphErrorCode;
+    readonly message: string;
+    readonly index?: number;
+    readonly assertionId?: FactId;
+    readonly assertion?: unknown;
+    readonly validationErrors?: readonly string[];
+    readonly cursor: KnowledgeGraphCursor;
+}
+interface KnowledgeGraphSnapshot {
+    readonly assertions: readonly KnowledgeAssertion[];
+    readonly entities: readonly KnowledgeGraphEntity[];
+    readonly relations: readonly KnowledgeGraphRelation[];
+    readonly topics: readonly KnowledgeGraphTopic[];
+    readonly index: KnowledgeGraphIndex;
+    readonly status: KnowledgeGraphStatus;
+    readonly errors: readonly KnowledgeGraphError[];
+    readonly cursor: KnowledgeGraphCursor;
+}
+interface KnowledgeGraphReducerBundle {
+    readonly input: {
+        readonly assertions: Node<readonly unknown[]>;
+        readonly policy?: Node<KnowledgeGraphPolicy>;
+    };
+    readonly snapshot: Node<KnowledgeGraphSnapshot>;
+    readonly assertions: Node<readonly KnowledgeAssertion[]>;
+    readonly entities: Node<readonly KnowledgeGraphEntity[]>;
+    readonly relations: Node<readonly KnowledgeGraphRelation[]>;
+    readonly topics: Node<readonly KnowledgeGraphTopic[]>;
+    readonly index: Node<KnowledgeGraphIndex>;
+    readonly status: Node<KnowledgeGraphStatus>;
+    readonly errors: Node<readonly KnowledgeGraphError[]>;
+    readonly cursor: Node<KnowledgeGraphCursor>;
+}
+interface KnowledgeGraphReducerBundleOptions {
+    readonly name?: string;
+    readonly assertions: Node<readonly unknown[]>;
+    readonly policy?: Node<KnowledgeGraphPolicy>;
+}
+interface MemoryRetrievalBundle<T = unknown> {
+    readonly input: {
+        readonly fragments: Node<readonly unknown[]>;
+        readonly query: Node<MemoryRetrievalQuery>;
+    };
+    readonly snapshot: Node<MemoryRetrievalSnapshot<T>>;
+    readonly fragments: Node<readonly MemoryFragment<T>[]>;
+    readonly indexed: Node<MemoryRetrievalIndex<T>>;
+    readonly ranked: Node<MemoryAnswer<T>>;
+    readonly status: Node<MemoryRetrievalStatus>;
+    readonly errors: Node<readonly MemoryRetrievalError[]>;
+    readonly cursor: Node<MemoryRetrievalCursor>;
+}
+interface MemoryRetrievalBundleOptions {
+    readonly name?: string;
+    readonly fragments: Node<readonly unknown[]>;
+    readonly query: Node<MemoryRetrievalQuery>;
+}
+/**
+ * Build a graph-visible memory retrieval bundle from explicit fragment/query deps.
+ *
+ * Invalid fragments and ranking status are emitted as ordinary DATA facts. The
+ * bundle never owns storage restore or hidden mutation; callers that need
+ * persistence compose D161 collection/storage sidecars outside this pattern.
+ */
+declare function memoryRetrievalBundle<T = unknown>(graph: Graph, opts: MemoryRetrievalBundleOptions): MemoryRetrievalBundle<T>;
+/**
+ * D170 lower semantic-memory KG materializer.
+ *
+ * Assertion, entity, relation, and topic ids remain DATA keys. The bundle has
+ * static describe-visible topology and owns no storage, LLM extraction,
+ * scheduler, agent runtime, or dynamic graph node lifecycle.
+ */
+declare function knowledgeGraphReducerBundle(graph: Graph, opts: KnowledgeGraphReducerBundleOptions): KnowledgeGraphReducerBundle;
+
+export { type VectorSearchResult as $, type AdmissionFilter as A, type MemoryRetrievalBundle as B, type CollectionEntry as C, type DecayPolicy as D, type MemoryRetrievalBundleOptions as E, type FactId as F, type MemoryRetrievalCursor as G, type MemoryRetrievalError as H, type MemoryRetrievalErrorCode as I, type MemoryRetrievalFact as J, type KnowledgeAssertion as K, type MemoryRetrievalIndex as L, type MemoryAnswer as M, type MemoryRetrievalQuery as N, type MemoryRetrievalSnapshot as O, type MemoryRetrievalStatus as P, type MemoryRetrievalStatusState as Q, type OutcomeSignal as R, type RankedCollectionEntry as S, type RetrievalEntry as T, type RetrievalQuery as U, type RetrievalTrace as V, type ScoringPolicy as W, type ShardByTenantConfig as X, type ShardByTenantOptions as Y, type ShardKey as Z, type StoreReadHandle as _, type KnowledgeAssertionObject as a, admissionFilter3D as a0, admissionScored as a1, cosineSimilarity as a2, filterMemoryFragments as a3, isMemoryFragment as a4, memoryFragmentMatchesQuery as a5, memoryFragmentValidAt as a6, memoryRetrievalBundle as a7, shardByTenant as a8, validateMemoryFragment as a9, type KnowledgeAssertionStrictJsonValue as b, type KnowledgeAssertionSubject as c, type KnowledgeGraphCursor as d, type KnowledgeGraphEntity as e, type KnowledgeGraphError as f, type KnowledgeGraphErrorCode as g, type KnowledgeGraphIndex as h, type KnowledgeGraphPolicy as i, type KnowledgeGraphReducerBundle as j, type KnowledgeGraphReducerBundleOptions as k, type KnowledgeGraphRelation as l, type KnowledgeGraphSnapshot as m, type KnowledgeGraphStatus as n, type KnowledgeGraphStatusState as o, type KnowledgeGraphTopic as p, knowledgeGraphReducerBundle as q, type AdmissionScore3DOptions as r, type AdmissionScoredOptions as s, type AdmissionScores as t, type AdmissionThresholds as u, type CollectionScoreFn as v, type FactStore as w, type MemoryFragment as x, type MemoryFragmentValidation as y, type MemoryQuery as z };