@mastra/playground-ui 68.0.0-alpha.2 → 68.0.0-alpha.3

package/dist/domains/knowledge/lib/pageAddress.cjs.js

@@ -0,0 +1,29 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+// src/domains/knowledge/lib/pageAddress.ts
+/** The page's place from its root scope down, through the pages the graph holds. */
+function pagePath(page, byId) {
+	const names = [];
+	const seen = /* @__PURE__ */ new Set();
+	for (let up = page.parentId ? byId.get(page.parentId) : void 0; up && !seen.has(up.id);) {
+		seen.add(up.id);
+		names.unshift(up.isScope && up.address ? up.address : up.name);
+		up = up.parentId ? byId.get(up.parentId) : void 0;
+	}
+	return names.join(" › ");
+}
+/** How the page is addressed: its scope's address, then the keys down to it. Scopes are just their address. */
+function pageRef(page, byId) {
+	if (page.isScope) return page.address;
+	const keys = [];
+	const seen = /* @__PURE__ */ new Set();
+	for (let at = page; at && !seen.has(at.id); at = at.parentId ? byId.get(at.parentId) : void 0) {
+		seen.add(at.id);
+		if (at.isScope) return at.address ? `${at.address}#${keys.reverse().join("/")}` : void 0;
+		if (!at.key) return void 0;
+		keys.push(at.key);
+	}
+}
+exports.pagePath = pagePath;
+exports.pageRef = pageRef;
+
+//# sourceMappingURL=pageAddress.cjs.js.map

package/dist/domains/knowledge/lib/pageAddress.cjs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pageAddress.cjs.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageAddress.ts"],"sourcesContent":["import type { KnowledgePagePayload } from '../pageTypes';\n\n/** The page's place from its root scope down, through the pages the graph holds. */\nexport function pagePath(page: KnowledgePagePayload, byId: ReadonlyMap<string, KnowledgePagePayload>): string {\n  const names: string[] = [];\n  const seen = new Set<string>();\n  for (let up = page.parentId ? byId.get(page.parentId) : undefined; up && !seen.has(up.id);) {\n    seen.add(up.id);\n    names.unshift(up.isScope && up.address ? up.address : up.name);\n    up = up.parentId ? byId.get(up.parentId) : undefined;\n  }\n  return names.join(' › ');\n}\n\n/** How the page is addressed: its scope's address, then the keys down to it. Scopes are just their address. */\nexport function pageRef(\n  page: KnowledgePagePayload,\n  byId: ReadonlyMap<string, KnowledgePagePayload>,\n): string | undefined {\n  if (page.isScope) return page.address;\n  const keys: string[] = [];\n  const seen = new Set<string>();\n  for (\n    let at: KnowledgePagePayload | undefined = page;\n    at && !seen.has(at.id);\n    at = at.parentId ? byId.get(at.parentId) : undefined\n  ) {\n    seen.add(at.id);\n    if (at.isScope) return at.address ? `${at.address}#${keys.reverse().join('/')}` : undefined;\n    if (!at.key) return undefined;\n    keys.push(at.key);\n  }\n  return undefined;\n}\n"],"mappings":";;;AAGA,SAAgB,SAAS,MAA4B,MAAyD;CAC5G,MAAM,QAAkB,CAAC;CACzB,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,IAAI,KAAK,KAAK,WAAW,KAAK,IAAI,KAAK,QAAQ,IAAI,KAAA,GAAW,MAAM,CAAC,KAAK,IAAI,GAAG,EAAE,IAAI;EAC1F,KAAK,IAAI,GAAG,EAAE;EACd,MAAM,QAAQ,GAAG,WAAW,GAAG,UAAU,GAAG,UAAU,GAAG,IAAI;EAC7D,KAAK,GAAG,WAAW,KAAK,IAAI,GAAG,QAAQ,IAAI,KAAA;CAC7C;CACA,OAAO,MAAM,KAAK,KAAK;AACzB;;AAGA,SAAgB,QACd,MACA,MACoB;CACpB,IAAI,KAAK,SAAS,OAAO,KAAK;CAC9B,MAAM,OAAiB,CAAC;CACxB,MAAM,uBAAO,IAAI,IAAY;CAC7B,KACE,IAAI,KAAuC,MAC3C,MAAM,CAAC,KAAK,IAAI,GAAG,EAAE,GACrB,KAAK,GAAG,WAAW,KAAK,IAAI,GAAG,QAAQ,IAAI,KAAA,GAC3C;EACA,KAAK,IAAI,GAAG,EAAE;EACd,IAAI,GAAG,SAAS,OAAO,GAAG,UAAU,GAAG,GAAG,QAAQ,GAAG,KAAK,QAAQ,CAAC,CAAC,KAAK,GAAG,MAAM,KAAA;EAClF,IAAI,CAAC,GAAG,KAAK,OAAO,KAAA;EACpB,KAAK,KAAK,GAAG,GAAG;CAClB;AAEF"}

package/dist/domains/knowledge/lib/pageAddress.d.ts

@@ -0,0 +1 @@
+export * from '../../../src/domains/knowledge/lib/pageAddress';

package/dist/domains/knowledge/lib/pageAddress.es.js

@@ -0,0 +1,27 @@
+// src/domains/knowledge/lib/pageAddress.ts
+/** The page's place from its root scope down, through the pages the graph holds. */
+function pagePath(page, byId) {
+	const names = [];
+	const seen = /* @__PURE__ */ new Set();
+	for (let up = page.parentId ? byId.get(page.parentId) : void 0; up && !seen.has(up.id);) {
+		seen.add(up.id);
+		names.unshift(up.isScope && up.address ? up.address : up.name);
+		up = up.parentId ? byId.get(up.parentId) : void 0;
+	}
+	return names.join(" › ");
+}
+/** How the page is addressed: its scope's address, then the keys down to it. Scopes are just their address. */
+function pageRef(page, byId) {
+	if (page.isScope) return page.address;
+	const keys = [];
+	const seen = /* @__PURE__ */ new Set();
+	for (let at = page; at && !seen.has(at.id); at = at.parentId ? byId.get(at.parentId) : void 0) {
+		seen.add(at.id);
+		if (at.isScope) return at.address ? `${at.address}#${keys.reverse().join("/")}` : void 0;
+		if (!at.key) return void 0;
+		keys.push(at.key);
+	}
+}
+export { pagePath, pageRef };
+
+//# sourceMappingURL=pageAddress.es.js.map

package/dist/domains/knowledge/lib/pageAddress.es.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pageAddress.es.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageAddress.ts"],"sourcesContent":["import type { KnowledgePagePayload } from '../pageTypes';\n\n/** The page's place from its root scope down, through the pages the graph holds. */\nexport function pagePath(page: KnowledgePagePayload, byId: ReadonlyMap<string, KnowledgePagePayload>): string {\n  const names: string[] = [];\n  const seen = new Set<string>();\n  for (let up = page.parentId ? byId.get(page.parentId) : undefined; up && !seen.has(up.id);) {\n    seen.add(up.id);\n    names.unshift(up.isScope && up.address ? up.address : up.name);\n    up = up.parentId ? byId.get(up.parentId) : undefined;\n  }\n  return names.join(' › ');\n}\n\n/** How the page is addressed: its scope's address, then the keys down to it. Scopes are just their address. */\nexport function pageRef(\n  page: KnowledgePagePayload,\n  byId: ReadonlyMap<string, KnowledgePagePayload>,\n): string | undefined {\n  if (page.isScope) return page.address;\n  const keys: string[] = [];\n  const seen = new Set<string>();\n  for (\n    let at: KnowledgePagePayload | undefined = page;\n    at && !seen.has(at.id);\n    at = at.parentId ? byId.get(at.parentId) : undefined\n  ) {\n    seen.add(at.id);\n    if (at.isScope) return at.address ? `${at.address}#${keys.reverse().join('/')}` : undefined;\n    if (!at.key) return undefined;\n    keys.push(at.key);\n  }\n  return undefined;\n}\n"],"mappings":";;AAGA,SAAgB,SAAS,MAA4B,MAAyD;CAC5G,MAAM,QAAkB,CAAC;CACzB,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,IAAI,KAAK,KAAK,WAAW,KAAK,IAAI,KAAK,QAAQ,IAAI,KAAA,GAAW,MAAM,CAAC,KAAK,IAAI,GAAG,EAAE,IAAI;EAC1F,KAAK,IAAI,GAAG,EAAE;EACd,MAAM,QAAQ,GAAG,WAAW,GAAG,UAAU,GAAG,UAAU,GAAG,IAAI;EAC7D,KAAK,GAAG,WAAW,KAAK,IAAI,GAAG,QAAQ,IAAI,KAAA;CAC7C;CACA,OAAO,MAAM,KAAK,KAAK;AACzB;;AAGA,SAAgB,QACd,MACA,MACoB;CACpB,IAAI,KAAK,SAAS,OAAO,KAAK;CAC9B,MAAM,OAAiB,CAAC;CACxB,MAAM,uBAAO,IAAI,IAAY;CAC7B,KACE,IAAI,KAAuC,MAC3C,MAAM,CAAC,KAAK,IAAI,GAAG,EAAE,GACrB,KAAK,GAAG,WAAW,KAAK,IAAI,GAAG,QAAQ,IAAI,KAAA,GAC3C;EACA,KAAK,IAAI,GAAG,EAAE;EACd,IAAI,GAAG,SAAS,OAAO,GAAG,UAAU,GAAG,GAAG,QAAQ,GAAG,KAAK,QAAQ,CAAC,CAAC,KAAK,GAAG,MAAM,KAAA;EAClF,IAAI,CAAC,GAAG,KAAK,OAAO,KAAA;EACpB,KAAK,KAAK,GAAG,GAAG;CAClB;AAEF"}

package/dist/domains/knowledge/lib/pageGraph.cjs.js

@@ -2,10 +2,10 @@ Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 // src/domains/knowledge/lib/pageGraph.ts
 /**
 * Edges among loaded, live pages: a parent edge for every loaded parent, and
-* the given mention edges merged per source → target (counts summed). Self
-* mentions and edges to unloaded pages are dropped.
+* the given mention and body-link edges merged per kind and source → target
+* (counts summed). Self links and edges to unloaded pages are dropped.
 */
-function pageGraphEdges(pages, mentionEdges = []) {
+function pageGraphEdges(pages, linkEdges = []) {
 	const live = new Set(pages.filter((page) => !page.deletedAt && !page.mergedInto).map((page) => page.id));
 	const edges = [];
 	for (const page of pages) if (live.has(page.id) && page.parentId && page.parentId !== page.id && live.has(page.parentId)) edges.push({
@@ -13,22 +13,22 @@ function pageGraphEdges(pages, mentionEdges = []) {
 		target: page.id,
 		kind: "parent"
 	});
-	const mentions = /* @__PURE__ */ new Map();
-	for (const edge of mentionEdges) {
-		if (edge.kind !== "mention" || edge.source === edge.target) continue;
+	const links = /* @__PURE__ */ new Map();
+	for (const edge of linkEdges) {
+		if (edge.kind !== "mention" && edge.kind !== "link" || edge.source === edge.target) continue;
 		if (!live.has(edge.source) || !live.has(edge.target)) continue;
-		const key = `${edge.source}\u0000${edge.target}`;
-		const existing = mentions.get(key);
+		const key = `${edge.kind}\u0000${edge.source}\u0000${edge.target}`;
+		const existing = links.get(key);
 		const count = edge.count ?? 1;
 		if (existing) existing.count = (existing.count ?? 1) + count;
-		else mentions.set(key, {
+		else links.set(key, {
 			source: edge.source,
 			target: edge.target,
-			kind: "mention",
+			kind: edge.kind,
 			count
 		});
 	}
-	return [...edges, ...mentions.values()];
+	return [...edges, ...links.values()];
 }
 /** Id of the placeholder circle for a declared principal that has no scope page yet. */
 function unplacedScopeId(address) {

package/dist/domains/knowledge/lib/pageGraph.cjs.js.map

@@ -1 +1 @@
-{"version":3,"file":"pageGraph.cjs.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageGraph.ts"],"sourcesContent":["/**\n * Pure page-graph logic for the schema-4 explorer: parent links plus resolved\n * mentions between loaded pages → React Flow nodes and edges. Every scope is\n * one size and every page another, so a circle's size says what it is and its\n * name always fits inside.\n */\n\nimport type { Edge, Node } from '@xyflow/react';\n\nimport type { KnowledgePageEdge, KnowledgePagePayload, KnowledgeScopeGrantPayload } from '../pageTypes';\n\n/**\n * Edges among loaded, live pages: a parent edge for every loaded parent, and\n * the given mention edges merged per source → target (counts summed). Self\n * mentions and edges to unloaded pages are dropped.\n */\nexport function pageGraphEdges(\n  pages: KnowledgePagePayload[],\n  mentionEdges: KnowledgePageEdge[] = [],\n): KnowledgePageEdge[] {\n  const live = new Set(pages.filter(page => !page.deletedAt && !page.mergedInto).map(page => page.id));\n  const edges: KnowledgePageEdge[] = [];\n  for (const page of pages) {\n    if (live.has(page.id) && page.parentId && page.parentId !== page.id && live.has(page.parentId)) {\n      edges.push({ source: page.parentId, target: page.id, kind: 'parent' });\n    }\n  }\n  const mentions = new Map<string, KnowledgePageEdge>();\n  for (const edge of mentionEdges) {\n    if (edge.kind !== 'mention' || edge.source === edge.target) continue;\n    if (!live.has(edge.source) || !live.has(edge.target)) continue;\n    const key = `${edge.source}\\u0000${edge.target}`;\n    const existing = mentions.get(key);\n    const count = edge.count ?? 1;\n    if (existing) existing.count = (existing.count ?? 1) + count;\n    else mentions.set(key, { source: edge.source, target: edge.target, kind: 'mention', count });\n  }\n  return [...edges, ...mentions.values()];\n}\n\n/** Id of the placeholder circle for a declared principal that has no scope page yet. */\nexport function unplacedScopeId(address: string): string {\n  return `unplaced:${address}`;\n}\n\n/**\n * Grants as graph pages and edges. A grant from a principal with a loaded scope page draws from that\n * page; one whose principal has no scope page yet draws from a placeholder scope (one per address), so\n * a role nobody has written to still shows what it can reach. Grants to unloaded targets are dropped.\n */\nexport function grantGraph(\n  pages: KnowledgePagePayload[],\n  grants: readonly KnowledgeScopeGrantPayload[] = [],\n): { placeholders: KnowledgePagePayload[]; edges: KnowledgePageEdge[] } {\n  const live = new Set(pages.filter(page => !page.deletedAt && !page.mergedInto).map(page => page.id));\n  const placeholders = new Map<string, KnowledgePagePayload>();\n  const edges = new Map<string, KnowledgePageEdge>();\n  for (const grant of grants) {\n    if (!live.has(grant.target)) continue;\n    let source = grant.principalId && live.has(grant.principalId) ? grant.principalId : null;\n    if (!source) {\n      if (grant.principalId) continue;\n      source = unplacedScopeId(grant.principal);\n      if (!placeholders.has(source)) placeholders.set(source, placeholderScope(source, grant));\n    }\n    if (source === grant.target) continue;\n    edges.set(`${source}\\u0000${grant.target}`, { source, target: grant.target, kind: 'grant', role: grant.role });\n  }\n  return { placeholders: [...placeholders.values()], edges: [...edges.values()] };\n}\n\nfunction placeholderScope(id: string, grant: KnowledgeScopeGrantPayload): KnowledgePagePayload {\n  const nobody = { author: '' };\n  return {\n    id,\n    scopeId: id,\n    parentId: null,\n    isScope: true,\n    address: grant.principal,\n    displayLabel: grant.principalLabel,\n    position: '',\n    name: grant.principal,\n    version: 0,\n    createdBy: nobody,\n    updatedBy: nobody,\n    createdAt: '',\n    updatedAt: '',\n  };\n}\n\n/** The page plus every page one edge away from it, either direction. */\nexport function pageNeighbourIds(pageId: string, edges: KnowledgePageEdge[]): Set<string> {\n  const ids = new Set([pageId]);\n  for (const edge of edges) {\n    if (edge.source === pageId) ids.add(edge.target);\n    if (edge.target === pageId) ids.add(edge.source);\n  }\n  return ids;\n}\n\n/** Circle diameters: big enough for a kind label and three lines of name. */\nexport const KNOWLEDGE_SCOPE_SIZE = 124;\nexport const KNOWLEDGE_PAGE_SIZE = 108;\n\nexport type PageFlowNode = Node<{\n  page: KnowledgePagePayload;\n  size: number;\n  selected: boolean;\n}>;\n\nexport type PageFlowEdge = Edge<{ kind: KnowledgePageEdge['kind']; count: number; role?: KnowledgePageEdge['role'] }>;\n\n/** Converts pages and their edges to React Flow elements; positions are left to the layout. */\nexport function toPageFlow(\n  pages: KnowledgePagePayload[],\n  edges: KnowledgePageEdge[],\n  selectedId?: string | null,\n): { nodes: PageFlowNode[]; edges: PageFlowEdge[] } {\n  const nodes = pages\n    .filter(page => !page.deletedAt && !page.mergedInto)\n    .map((page): PageFlowNode => {\n      return {\n        id: page.id,\n        type: 'page',\n        position: { x: 0, y: 0 },\n        data: {\n          page,\n          size: page.isScope ? KNOWLEDGE_SCOPE_SIZE : KNOWLEDGE_PAGE_SIZE,\n          selected: page.id === selectedId,\n        },\n      };\n    });\n  return {\n    nodes,\n    edges: edges.map(\n      (edge): PageFlowEdge => ({\n        id: `${edge.kind}:${edge.source}->${edge.target}`,\n        source: edge.source,\n        target: edge.target,\n        data: { kind: edge.kind, count: edge.count ?? 1, ...(edge.role ? { role: edge.role } : {}) },\n      }),\n    ),\n  };\n}\n"],"mappings":";;;;;;;AAgBA,SAAgB,eACd,OACA,eAAoC,CAAC,GAChB;CACrB,MAAM,OAAO,IAAI,IAAI,MAAM,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CAAC,KAAI,SAAQ,KAAK,EAAE,CAAC;CACnG,MAAM,QAA6B,CAAC;CACpC,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,IAAI,KAAK,EAAE,KAAK,KAAK,YAAY,KAAK,aAAa,KAAK,MAAM,KAAK,IAAI,KAAK,QAAQ,GAC3F,MAAM,KAAK;EAAE,QAAQ,KAAK;EAAU,QAAQ,KAAK;EAAI,MAAM;CAAS,CAAC;CAGzE,MAAM,2BAAW,IAAI,IAA+B;CACpD,KAAK,MAAM,QAAQ,cAAc;EAC/B,IAAI,KAAK,SAAS,aAAa,KAAK,WAAW,KAAK,QAAQ;EAC5D,IAAI,CAAC,KAAK,IAAI,KAAK,MAAM,KAAK,CAAC,KAAK,IAAI,KAAK,MAAM,GAAG;EACtD,MAAM,MAAM,GAAG,KAAK,OAAO,QAAQ,KAAK;EACxC,MAAM,WAAW,SAAS,IAAI,GAAG;EACjC,MAAM,QAAQ,KAAK,SAAS;EAC5B,IAAI,UAAU,SAAS,SAAS,SAAS,SAAS,KAAK;OAClD,SAAS,IAAI,KAAK;GAAE,QAAQ,KAAK;GAAQ,QAAQ,KAAK;GAAQ,MAAM;GAAW;EAAM,CAAC;CAC7F;CACA,OAAO,CAAC,GAAG,OAAO,GAAG,SAAS,OAAO,CAAC;AACxC;;AAGA,SAAgB,gBAAgB,SAAyB;CACvD,OAAO,YAAY;AACrB;;;;;;AAOA,SAAgB,WACd,OACA,SAAgD,CAAC,GACqB;CACtE,MAAM,OAAO,IAAI,IAAI,MAAM,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CAAC,KAAI,SAAQ,KAAK,EAAE,CAAC;CACnG,MAAM,+BAAe,IAAI,IAAkC;CAC3D,MAAM,wBAAQ,IAAI,IAA+B;CACjD,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,CAAC,KAAK,IAAI,MAAM,MAAM,GAAG;EAC7B,IAAI,SAAS,MAAM,eAAe,KAAK,IAAI,MAAM,WAAW,IAAI,MAAM,cAAc;EACpF,IAAI,CAAC,QAAQ;GACX,IAAI,MAAM,aAAa;GACvB,SAAS,gBAAgB,MAAM,SAAS;GACxC,IAAI,CAAC,aAAa,IAAI,MAAM,GAAG,aAAa,IAAI,QAAQ,iBAAiB,QAAQ,KAAK,CAAC;EACzF;EACA,IAAI,WAAW,MAAM,QAAQ;EAC7B,MAAM,IAAI,GAAG,OAAO,QAAQ,MAAM,UAAU;GAAE;GAAQ,QAAQ,MAAM;GAAQ,MAAM;GAAS,MAAM,MAAM;EAAK,CAAC;CAC/G;CACA,OAAO;EAAE,cAAc,CAAC,GAAG,aAAa,OAAO,CAAC;EAAG,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC;CAAE;AAChF;AAEA,SAAS,iBAAiB,IAAY,OAAyD;CAC7F,MAAM,SAAS,EAAE,QAAQ,GAAG;CAC5B,OAAO;EACL;EACA,SAAS;EACT,UAAU;EACV,SAAS;EACT,SAAS,MAAM;EACf,cAAc,MAAM;EACpB,UAAU;EACV,MAAM,MAAM;EACZ,SAAS;EACT,WAAW;EACX,WAAW;EACX,WAAW;EACX,WAAW;CACb;AACF;;AAGA,SAAgB,iBAAiB,QAAgB,OAAyC;CACxF,MAAM,sBAAM,IAAI,IAAI,CAAC,MAAM,CAAC;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,WAAW,QAAQ,IAAI,IAAI,KAAK,MAAM;EAC/C,IAAI,KAAK,WAAW,QAAQ,IAAI,IAAI,KAAK,MAAM;CACjD;CACA,OAAO;AACT;;AAGA,IAAa,uBAAuB;AACpC,IAAa,sBAAsB;;AAWnC,SAAgB,WACd,OACA,OACA,YACkD;CAelD,OAAO;EACL,OAfY,MACX,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CACnD,KAAK,SAAuB;GAC3B,OAAO;IACL,IAAI,KAAK;IACT,MAAM;IACN,UAAU;KAAE,GAAG;KAAG,GAAG;IAAE;IACvB,MAAM;KACJ;KACA,MAAM,KAAK,UAAA,MAAA;KACX,UAAU,KAAK,OAAO;IACxB;GACF;EACF,CAEA;EACA,OAAO,MAAM,KACV,UAAwB;GACvB,IAAI,GAAG,KAAK,KAAK,GAAG,KAAK,OAAO,IAAI,KAAK;GACzC,QAAQ,KAAK;GACb,QAAQ,KAAK;GACb,MAAM;IAAE,MAAM,KAAK;IAAM,OAAO,KAAK,SAAS;IAAG,GAAI,KAAK,OAAO,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;GAAG;EAC7F,EACF;CACF;AACF"}
+{"version":3,"file":"pageGraph.cjs.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageGraph.ts"],"sourcesContent":["/**\n * Pure page-graph logic for the schema-4 explorer: parent links plus resolved\n * mentions and body links between loaded pages → React Flow nodes and edges. Every scope is\n * one size and every page another, so a circle's size says what it is and its\n * name always fits inside.\n */\n\nimport type { Edge, Node } from '@xyflow/react';\n\nimport type { KnowledgePageEdge, KnowledgePagePayload, KnowledgeScopeGrantPayload } from '../pageTypes';\n\n/**\n * Edges among loaded, live pages: a parent edge for every loaded parent, and\n * the given mention and body-link edges merged per kind and source → target\n * (counts summed). Self links and edges to unloaded pages are dropped.\n */\nexport function pageGraphEdges(\n  pages: KnowledgePagePayload[],\n  linkEdges: KnowledgePageEdge[] = [],\n): KnowledgePageEdge[] {\n  const live = new Set(pages.filter(page => !page.deletedAt && !page.mergedInto).map(page => page.id));\n  const edges: KnowledgePageEdge[] = [];\n  for (const page of pages) {\n    if (live.has(page.id) && page.parentId && page.parentId !== page.id && live.has(page.parentId)) {\n      edges.push({ source: page.parentId, target: page.id, kind: 'parent' });\n    }\n  }\n  const links = new Map<string, KnowledgePageEdge>();\n  for (const edge of linkEdges) {\n    if ((edge.kind !== 'mention' && edge.kind !== 'link') || edge.source === edge.target) continue;\n    if (!live.has(edge.source) || !live.has(edge.target)) continue;\n    const key = `${edge.kind}\\u0000${edge.source}\\u0000${edge.target}`;\n    const existing = links.get(key);\n    const count = edge.count ?? 1;\n    if (existing) existing.count = (existing.count ?? 1) + count;\n    else links.set(key, { source: edge.source, target: edge.target, kind: edge.kind, count });\n  }\n  return [...edges, ...links.values()];\n}\n\n/** Id of the placeholder circle for a declared principal that has no scope page yet. */\nexport function unplacedScopeId(address: string): string {\n  return `unplaced:${address}`;\n}\n\n/**\n * Grants as graph pages and edges. A grant from a principal with a loaded scope page draws from that\n * page; one whose principal has no scope page yet draws from a placeholder scope (one per address), so\n * a role nobody has written to still shows what it can reach. Grants to unloaded targets are dropped.\n */\nexport function grantGraph(\n  pages: KnowledgePagePayload[],\n  grants: readonly KnowledgeScopeGrantPayload[] = [],\n): { placeholders: KnowledgePagePayload[]; edges: KnowledgePageEdge[] } {\n  const live = new Set(pages.filter(page => !page.deletedAt && !page.mergedInto).map(page => page.id));\n  const placeholders = new Map<string, KnowledgePagePayload>();\n  const edges = new Map<string, KnowledgePageEdge>();\n  for (const grant of grants) {\n    if (!live.has(grant.target)) continue;\n    let source = grant.principalId && live.has(grant.principalId) ? grant.principalId : null;\n    if (!source) {\n      if (grant.principalId) continue;\n      source = unplacedScopeId(grant.principal);\n      if (!placeholders.has(source)) placeholders.set(source, placeholderScope(source, grant));\n    }\n    if (source === grant.target) continue;\n    edges.set(`${source}\\u0000${grant.target}`, { source, target: grant.target, kind: 'grant', role: grant.role });\n  }\n  return { placeholders: [...placeholders.values()], edges: [...edges.values()] };\n}\n\nfunction placeholderScope(id: string, grant: KnowledgeScopeGrantPayload): KnowledgePagePayload {\n  const nobody = { author: '' };\n  return {\n    id,\n    scopeId: id,\n    parentId: null,\n    isScope: true,\n    address: grant.principal,\n    displayLabel: grant.principalLabel,\n    position: '',\n    name: grant.principal,\n    version: 0,\n    createdBy: nobody,\n    updatedBy: nobody,\n    createdAt: '',\n    updatedAt: '',\n  };\n}\n\n/** The page plus every page one edge away from it, either direction. */\nexport function pageNeighbourIds(pageId: string, edges: KnowledgePageEdge[]): Set<string> {\n  const ids = new Set([pageId]);\n  for (const edge of edges) {\n    if (edge.source === pageId) ids.add(edge.target);\n    if (edge.target === pageId) ids.add(edge.source);\n  }\n  return ids;\n}\n\n/** Circle diameters: big enough for a kind label and three lines of name. */\nexport const KNOWLEDGE_SCOPE_SIZE = 124;\nexport const KNOWLEDGE_PAGE_SIZE = 108;\n\nexport type PageFlowNode = Node<{\n  page: KnowledgePagePayload;\n  size: number;\n  selected: boolean;\n}>;\n\nexport type PageFlowEdge = Edge<{ kind: KnowledgePageEdge['kind']; count: number; role?: KnowledgePageEdge['role'] }>;\n\n/** Converts pages and their edges to React Flow elements; positions are left to the layout. */\nexport function toPageFlow(\n  pages: KnowledgePagePayload[],\n  edges: KnowledgePageEdge[],\n  selectedId?: string | null,\n): { nodes: PageFlowNode[]; edges: PageFlowEdge[] } {\n  const nodes = pages\n    .filter(page => !page.deletedAt && !page.mergedInto)\n    .map((page): PageFlowNode => {\n      return {\n        id: page.id,\n        type: 'page',\n        position: { x: 0, y: 0 },\n        data: {\n          page,\n          size: page.isScope ? KNOWLEDGE_SCOPE_SIZE : KNOWLEDGE_PAGE_SIZE,\n          selected: page.id === selectedId,\n        },\n      };\n    });\n  return {\n    nodes,\n    edges: edges.map(\n      (edge): PageFlowEdge => ({\n        id: `${edge.kind}:${edge.source}->${edge.target}`,\n        source: edge.source,\n        target: edge.target,\n        data: { kind: edge.kind, count: edge.count ?? 1, ...(edge.role ? { role: edge.role } : {}) },\n      }),\n    ),\n  };\n}\n"],"mappings":";;;;;;;AAgBA,SAAgB,eACd,OACA,YAAiC,CAAC,GACb;CACrB,MAAM,OAAO,IAAI,IAAI,MAAM,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CAAC,KAAI,SAAQ,KAAK,EAAE,CAAC;CACnG,MAAM,QAA6B,CAAC;CACpC,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,IAAI,KAAK,EAAE,KAAK,KAAK,YAAY,KAAK,aAAa,KAAK,MAAM,KAAK,IAAI,KAAK,QAAQ,GAC3F,MAAM,KAAK;EAAE,QAAQ,KAAK;EAAU,QAAQ,KAAK;EAAI,MAAM;CAAS,CAAC;CAGzE,MAAM,wBAAQ,IAAI,IAA+B;CACjD,KAAK,MAAM,QAAQ,WAAW;EAC5B,IAAK,KAAK,SAAS,aAAa,KAAK,SAAS,UAAW,KAAK,WAAW,KAAK,QAAQ;EACtF,IAAI,CAAC,KAAK,IAAI,KAAK,MAAM,KAAK,CAAC,KAAK,IAAI,KAAK,MAAM,GAAG;EACtD,MAAM,MAAM,GAAG,KAAK,KAAK,QAAQ,KAAK,OAAO,QAAQ,KAAK;EAC1D,MAAM,WAAW,MAAM,IAAI,GAAG;EAC9B,MAAM,QAAQ,KAAK,SAAS;EAC5B,IAAI,UAAU,SAAS,SAAS,SAAS,SAAS,KAAK;OAClD,MAAM,IAAI,KAAK;GAAE,QAAQ,KAAK;GAAQ,QAAQ,KAAK;GAAQ,MAAM,KAAK;GAAM;EAAM,CAAC;CAC1F;CACA,OAAO,CAAC,GAAG,OAAO,GAAG,MAAM,OAAO,CAAC;AACrC;;AAGA,SAAgB,gBAAgB,SAAyB;CACvD,OAAO,YAAY;AACrB;;;;;;AAOA,SAAgB,WACd,OACA,SAAgD,CAAC,GACqB;CACtE,MAAM,OAAO,IAAI,IAAI,MAAM,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CAAC,KAAI,SAAQ,KAAK,EAAE,CAAC;CACnG,MAAM,+BAAe,IAAI,IAAkC;CAC3D,MAAM,wBAAQ,IAAI,IAA+B;CACjD,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,CAAC,KAAK,IAAI,MAAM,MAAM,GAAG;EAC7B,IAAI,SAAS,MAAM,eAAe,KAAK,IAAI,MAAM,WAAW,IAAI,MAAM,cAAc;EACpF,IAAI,CAAC,QAAQ;GACX,IAAI,MAAM,aAAa;GACvB,SAAS,gBAAgB,MAAM,SAAS;GACxC,IAAI,CAAC,aAAa,IAAI,MAAM,GAAG,aAAa,IAAI,QAAQ,iBAAiB,QAAQ,KAAK,CAAC;EACzF;EACA,IAAI,WAAW,MAAM,QAAQ;EAC7B,MAAM,IAAI,GAAG,OAAO,QAAQ,MAAM,UAAU;GAAE;GAAQ,QAAQ,MAAM;GAAQ,MAAM;GAAS,MAAM,MAAM;EAAK,CAAC;CAC/G;CACA,OAAO;EAAE,cAAc,CAAC,GAAG,aAAa,OAAO,CAAC;EAAG,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC;CAAE;AAChF;AAEA,SAAS,iBAAiB,IAAY,OAAyD;CAC7F,MAAM,SAAS,EAAE,QAAQ,GAAG;CAC5B,OAAO;EACL;EACA,SAAS;EACT,UAAU;EACV,SAAS;EACT,SAAS,MAAM;EACf,cAAc,MAAM;EACpB,UAAU;EACV,MAAM,MAAM;EACZ,SAAS;EACT,WAAW;EACX,WAAW;EACX,WAAW;EACX,WAAW;CACb;AACF;;AAGA,SAAgB,iBAAiB,QAAgB,OAAyC;CACxF,MAAM,sBAAM,IAAI,IAAI,CAAC,MAAM,CAAC;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,WAAW,QAAQ,IAAI,IAAI,KAAK,MAAM;EAC/C,IAAI,KAAK,WAAW,QAAQ,IAAI,IAAI,KAAK,MAAM;CACjD;CACA,OAAO;AACT;;AAGA,IAAa,uBAAuB;AACpC,IAAa,sBAAsB;;AAWnC,SAAgB,WACd,OACA,OACA,YACkD;CAelD,OAAO;EACL,OAfY,MACX,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CACnD,KAAK,SAAuB;GAC3B,OAAO;IACL,IAAI,KAAK;IACT,MAAM;IACN,UAAU;KAAE,GAAG;KAAG,GAAG;IAAE;IACvB,MAAM;KACJ;KACA,MAAM,KAAK,UAAA,MAAA;KACX,UAAU,KAAK,OAAO;IACxB;GACF;EACF,CAEA;EACA,OAAO,MAAM,KACV,UAAwB;GACvB,IAAI,GAAG,KAAK,KAAK,GAAG,KAAK,OAAO,IAAI,KAAK;GACzC,QAAQ,KAAK;GACb,QAAQ,KAAK;GACb,MAAM;IAAE,MAAM,KAAK;IAAM,OAAO,KAAK,SAAS;IAAG,GAAI,KAAK,OAAO,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;GAAG;EAC7F,EACF;CACF;AACF"}

package/dist/domains/knowledge/lib/pageGraph.es.js

@@ -1,10 +1,10 @@
 // src/domains/knowledge/lib/pageGraph.ts
 /**
 * Edges among loaded, live pages: a parent edge for every loaded parent, and
-* the given mention edges merged per source → target (counts summed). Self
-* mentions and edges to unloaded pages are dropped.
+* the given mention and body-link edges merged per kind and source → target
+* (counts summed). Self links and edges to unloaded pages are dropped.
 */
-function pageGraphEdges(pages, mentionEdges = []) {
+function pageGraphEdges(pages, linkEdges = []) {
 	const live = new Set(pages.filter((page) => !page.deletedAt && !page.mergedInto).map((page) => page.id));
 	const edges = [];
 	for (const page of pages) if (live.has(page.id) && page.parentId && page.parentId !== page.id && live.has(page.parentId)) edges.push({
@@ -12,22 +12,22 @@ function pageGraphEdges(pages, mentionEdges = []) {
 		target: page.id,
 		kind: "parent"
 	});
-	const mentions = /* @__PURE__ */ new Map();
-	for (const edge of mentionEdges) {
-		if (edge.kind !== "mention" || edge.source === edge.target) continue;
+	const links = /* @__PURE__ */ new Map();
+	for (const edge of linkEdges) {
+		if (edge.kind !== "mention" && edge.kind !== "link" || edge.source === edge.target) continue;
 		if (!live.has(edge.source) || !live.has(edge.target)) continue;
-		const key = `${edge.source}\u0000${edge.target}`;
-		const existing = mentions.get(key);
+		const key = `${edge.kind}\u0000${edge.source}\u0000${edge.target}`;
+		const existing = links.get(key);
 		const count = edge.count ?? 1;
 		if (existing) existing.count = (existing.count ?? 1) + count;
-		else mentions.set(key, {
+		else links.set(key, {
 			source: edge.source,
 			target: edge.target,
-			kind: "mention",
+			kind: edge.kind,
 			count
 		});
 	}
-	return [...edges, ...mentions.values()];
+	return [...edges, ...links.values()];
 }
 /** Id of the placeholder circle for a declared principal that has no scope page yet. */
 function unplacedScopeId(address) {

package/dist/domains/knowledge/lib/pageGraph.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"pageGraph.es.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageGraph.ts"],"sourcesContent":["/**\n * Pure page-graph logic for the schema-4 explorer: parent links plus resolved\n * mentions between loaded pages → React Flow nodes and edges. Every scope is\n * one size and every page another, so a circle's size says what it is and its\n * name always fits inside.\n */\n\nimport type { Edge, Node } from '@xyflow/react';\n\nimport type { KnowledgePageEdge, KnowledgePagePayload, KnowledgeScopeGrantPayload } from '../pageTypes';\n\n/**\n * Edges among loaded, live pages: a parent edge for every loaded parent, and\n * the given mention edges merged per source → target (counts summed). Self\n * mentions and edges to unloaded pages are dropped.\n */\nexport function pageGraphEdges(\n  pages: KnowledgePagePayload[],\n  mentionEdges: KnowledgePageEdge[] = [],\n): KnowledgePageEdge[] {\n  const live = new Set(pages.filter(page => !page.deletedAt && !page.mergedInto).map(page => page.id));\n  const edges: KnowledgePageEdge[] = [];\n  for (const page of pages) {\n    if (live.has(page.id) && page.parentId && page.parentId !== page.id && live.has(page.parentId)) {\n      edges.push({ source: page.parentId, target: page.id, kind: 'parent' });\n    }\n  }\n  const mentions = new Map<string, KnowledgePageEdge>();\n  for (const edge of mentionEdges) {\n    if (edge.kind !== 'mention' || edge.source === edge.target) continue;\n    if (!live.has(edge.source) || !live.has(edge.target)) continue;\n    const key = `${edge.source}\\u0000${edge.target}`;\n    const existing = mentions.get(key);\n    const count = edge.count ?? 1;\n    if (existing) existing.count = (existing.count ?? 1) + count;\n    else mentions.set(key, { source: edge.source, target: edge.target, kind: 'mention', count });\n  }\n  return [...edges, ...mentions.values()];\n}\n\n/** Id of the placeholder circle for a declared principal that has no scope page yet. */\nexport function unplacedScopeId(address: string): string {\n  return `unplaced:${address}`;\n}\n\n/**\n * Grants as graph pages and edges. A grant from a principal with a loaded scope page draws from that\n * page; one whose principal has no scope page yet draws from a placeholder scope (one per address), so\n * a role nobody has written to still shows what it can reach. Grants to unloaded targets are dropped.\n */\nexport function grantGraph(\n  pages: KnowledgePagePayload[],\n  grants: readonly KnowledgeScopeGrantPayload[] = [],\n): { placeholders: KnowledgePagePayload[]; edges: KnowledgePageEdge[] } {\n  const live = new Set(pages.filter(page => !page.deletedAt && !page.mergedInto).map(page => page.id));\n  const placeholders = new Map<string, KnowledgePagePayload>();\n  const edges = new Map<string, KnowledgePageEdge>();\n  for (const grant of grants) {\n    if (!live.has(grant.target)) continue;\n    let source = grant.principalId && live.has(grant.principalId) ? grant.principalId : null;\n    if (!source) {\n      if (grant.principalId) continue;\n      source = unplacedScopeId(grant.principal);\n      if (!placeholders.has(source)) placeholders.set(source, placeholderScope(source, grant));\n    }\n    if (source === grant.target) continue;\n    edges.set(`${source}\\u0000${grant.target}`, { source, target: grant.target, kind: 'grant', role: grant.role });\n  }\n  return { placeholders: [...placeholders.values()], edges: [...edges.values()] };\n}\n\nfunction placeholderScope(id: string, grant: KnowledgeScopeGrantPayload): KnowledgePagePayload {\n  const nobody = { author: '' };\n  return {\n    id,\n    scopeId: id,\n    parentId: null,\n    isScope: true,\n    address: grant.principal,\n    displayLabel: grant.principalLabel,\n    position: '',\n    name: grant.principal,\n    version: 0,\n    createdBy: nobody,\n    updatedBy: nobody,\n    createdAt: '',\n    updatedAt: '',\n  };\n}\n\n/** The page plus every page one edge away from it, either direction. */\nexport function pageNeighbourIds(pageId: string, edges: KnowledgePageEdge[]): Set<string> {\n  const ids = new Set([pageId]);\n  for (const edge of edges) {\n    if (edge.source === pageId) ids.add(edge.target);\n    if (edge.target === pageId) ids.add(edge.source);\n  }\n  return ids;\n}\n\n/** Circle diameters: big enough for a kind label and three lines of name. */\nexport const KNOWLEDGE_SCOPE_SIZE = 124;\nexport const KNOWLEDGE_PAGE_SIZE = 108;\n\nexport type PageFlowNode = Node<{\n  page: KnowledgePagePayload;\n  size: number;\n  selected: boolean;\n}>;\n\nexport type PageFlowEdge = Edge<{ kind: KnowledgePageEdge['kind']; count: number; role?: KnowledgePageEdge['role'] }>;\n\n/** Converts pages and their edges to React Flow elements; positions are left to the layout. */\nexport function toPageFlow(\n  pages: KnowledgePagePayload[],\n  edges: KnowledgePageEdge[],\n  selectedId?: string | null,\n): { nodes: PageFlowNode[]; edges: PageFlowEdge[] } {\n  const nodes = pages\n    .filter(page => !page.deletedAt && !page.mergedInto)\n    .map((page): PageFlowNode => {\n      return {\n        id: page.id,\n        type: 'page',\n        position: { x: 0, y: 0 },\n        data: {\n          page,\n          size: page.isScope ? KNOWLEDGE_SCOPE_SIZE : KNOWLEDGE_PAGE_SIZE,\n          selected: page.id === selectedId,\n        },\n      };\n    });\n  return {\n    nodes,\n    edges: edges.map(\n      (edge): PageFlowEdge => ({\n        id: `${edge.kind}:${edge.source}->${edge.target}`,\n        source: edge.source,\n        target: edge.target,\n        data: { kind: edge.kind, count: edge.count ?? 1, ...(edge.role ? { role: edge.role } : {}) },\n      }),\n    ),\n  };\n}\n"],"mappings":";;;;;;AAgBA,SAAgB,eACd,OACA,eAAoC,CAAC,GAChB;CACrB,MAAM,OAAO,IAAI,IAAI,MAAM,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CAAC,KAAI,SAAQ,KAAK,EAAE,CAAC;CACnG,MAAM,QAA6B,CAAC;CACpC,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,IAAI,KAAK,EAAE,KAAK,KAAK,YAAY,KAAK,aAAa,KAAK,MAAM,KAAK,IAAI,KAAK,QAAQ,GAC3F,MAAM,KAAK;EAAE,QAAQ,KAAK;EAAU,QAAQ,KAAK;EAAI,MAAM;CAAS,CAAC;CAGzE,MAAM,2BAAW,IAAI,IAA+B;CACpD,KAAK,MAAM,QAAQ,cAAc;EAC/B,IAAI,KAAK,SAAS,aAAa,KAAK,WAAW,KAAK,QAAQ;EAC5D,IAAI,CAAC,KAAK,IAAI,KAAK,MAAM,KAAK,CAAC,KAAK,IAAI,KAAK,MAAM,GAAG;EACtD,MAAM,MAAM,GAAG,KAAK,OAAO,QAAQ,KAAK;EACxC,MAAM,WAAW,SAAS,IAAI,GAAG;EACjC,MAAM,QAAQ,KAAK,SAAS;EAC5B,IAAI,UAAU,SAAS,SAAS,SAAS,SAAS,KAAK;OAClD,SAAS,IAAI,KAAK;GAAE,QAAQ,KAAK;GAAQ,QAAQ,KAAK;GAAQ,MAAM;GAAW;EAAM,CAAC;CAC7F;CACA,OAAO,CAAC,GAAG,OAAO,GAAG,SAAS,OAAO,CAAC;AACxC;;AAGA,SAAgB,gBAAgB,SAAyB;CACvD,OAAO,YAAY;AACrB;;;;;;AAOA,SAAgB,WACd,OACA,SAAgD,CAAC,GACqB;CACtE,MAAM,OAAO,IAAI,IAAI,MAAM,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CAAC,KAAI,SAAQ,KAAK,EAAE,CAAC;CACnG,MAAM,+BAAe,IAAI,IAAkC;CAC3D,MAAM,wBAAQ,IAAI,IAA+B;CACjD,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,CAAC,KAAK,IAAI,MAAM,MAAM,GAAG;EAC7B,IAAI,SAAS,MAAM,eAAe,KAAK,IAAI,MAAM,WAAW,IAAI,MAAM,cAAc;EACpF,IAAI,CAAC,QAAQ;GACX,IAAI,MAAM,aAAa;GACvB,SAAS,gBAAgB,MAAM,SAAS;GACxC,IAAI,CAAC,aAAa,IAAI,MAAM,GAAG,aAAa,IAAI,QAAQ,iBAAiB,QAAQ,KAAK,CAAC;EACzF;EACA,IAAI,WAAW,MAAM,QAAQ;EAC7B,MAAM,IAAI,GAAG,OAAO,QAAQ,MAAM,UAAU;GAAE;GAAQ,QAAQ,MAAM;GAAQ,MAAM;GAAS,MAAM,MAAM;EAAK,CAAC;CAC/G;CACA,OAAO;EAAE,cAAc,CAAC,GAAG,aAAa,OAAO,CAAC;EAAG,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC;CAAE;AAChF;AAEA,SAAS,iBAAiB,IAAY,OAAyD;CAC7F,MAAM,SAAS,EAAE,QAAQ,GAAG;CAC5B,OAAO;EACL;EACA,SAAS;EACT,UAAU;EACV,SAAS;EACT,SAAS,MAAM;EACf,cAAc,MAAM;EACpB,UAAU;EACV,MAAM,MAAM;EACZ,SAAS;EACT,WAAW;EACX,WAAW;EACX,WAAW;EACX,WAAW;CACb;AACF;;AAGA,SAAgB,iBAAiB,QAAgB,OAAyC;CACxF,MAAM,sBAAM,IAAI,IAAI,CAAC,MAAM,CAAC;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,WAAW,QAAQ,IAAI,IAAI,KAAK,MAAM;EAC/C,IAAI,KAAK,WAAW,QAAQ,IAAI,IAAI,KAAK,MAAM;CACjD;CACA,OAAO;AACT;;AAGA,IAAa,uBAAuB;AACpC,IAAa,sBAAsB;;AAWnC,SAAgB,WACd,OACA,OACA,YACkD;CAelD,OAAO;EACL,OAfY,MACX,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CACnD,KAAK,SAAuB;GAC3B,OAAO;IACL,IAAI,KAAK;IACT,MAAM;IACN,UAAU;KAAE,GAAG;KAAG,GAAG;IAAE;IACvB,MAAM;KACJ;KACA,MAAM,KAAK,UAAA,MAAA;KACX,UAAU,KAAK,OAAO;IACxB;GACF;EACF,CAEA;EACA,OAAO,MAAM,KACV,UAAwB;GACvB,IAAI,GAAG,KAAK,KAAK,GAAG,KAAK,OAAO,IAAI,KAAK;GACzC,QAAQ,KAAK;GACb,QAAQ,KAAK;GACb,MAAM;IAAE,MAAM,KAAK;IAAM,OAAO,KAAK,SAAS;IAAG,GAAI,KAAK,OAAO,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;GAAG;EAC7F,EACF;CACF;AACF"}
+{"version":3,"file":"pageGraph.es.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageGraph.ts"],"sourcesContent":["/**\n * Pure page-graph logic for the schema-4 explorer: parent links plus resolved\n * mentions and body links between loaded pages → React Flow nodes and edges. Every scope is\n * one size and every page another, so a circle's size says what it is and its\n * name always fits inside.\n */\n\nimport type { Edge, Node } from '@xyflow/react';\n\nimport type { KnowledgePageEdge, KnowledgePagePayload, KnowledgeScopeGrantPayload } from '../pageTypes';\n\n/**\n * Edges among loaded, live pages: a parent edge for every loaded parent, and\n * the given mention and body-link edges merged per kind and source → target\n * (counts summed). Self links and edges to unloaded pages are dropped.\n */\nexport function pageGraphEdges(\n  pages: KnowledgePagePayload[],\n  linkEdges: KnowledgePageEdge[] = [],\n): KnowledgePageEdge[] {\n  const live = new Set(pages.filter(page => !page.deletedAt && !page.mergedInto).map(page => page.id));\n  const edges: KnowledgePageEdge[] = [];\n  for (const page of pages) {\n    if (live.has(page.id) && page.parentId && page.parentId !== page.id && live.has(page.parentId)) {\n      edges.push({ source: page.parentId, target: page.id, kind: 'parent' });\n    }\n  }\n  const links = new Map<string, KnowledgePageEdge>();\n  for (const edge of linkEdges) {\n    if ((edge.kind !== 'mention' && edge.kind !== 'link') || edge.source === edge.target) continue;\n    if (!live.has(edge.source) || !live.has(edge.target)) continue;\n    const key = `${edge.kind}\\u0000${edge.source}\\u0000${edge.target}`;\n    const existing = links.get(key);\n    const count = edge.count ?? 1;\n    if (existing) existing.count = (existing.count ?? 1) + count;\n    else links.set(key, { source: edge.source, target: edge.target, kind: edge.kind, count });\n  }\n  return [...edges, ...links.values()];\n}\n\n/** Id of the placeholder circle for a declared principal that has no scope page yet. */\nexport function unplacedScopeId(address: string): string {\n  return `unplaced:${address}`;\n}\n\n/**\n * Grants as graph pages and edges. A grant from a principal with a loaded scope page draws from that\n * page; one whose principal has no scope page yet draws from a placeholder scope (one per address), so\n * a role nobody has written to still shows what it can reach. Grants to unloaded targets are dropped.\n */\nexport function grantGraph(\n  pages: KnowledgePagePayload[],\n  grants: readonly KnowledgeScopeGrantPayload[] = [],\n): { placeholders: KnowledgePagePayload[]; edges: KnowledgePageEdge[] } {\n  const live = new Set(pages.filter(page => !page.deletedAt && !page.mergedInto).map(page => page.id));\n  const placeholders = new Map<string, KnowledgePagePayload>();\n  const edges = new Map<string, KnowledgePageEdge>();\n  for (const grant of grants) {\n    if (!live.has(grant.target)) continue;\n    let source = grant.principalId && live.has(grant.principalId) ? grant.principalId : null;\n    if (!source) {\n      if (grant.principalId) continue;\n      source = unplacedScopeId(grant.principal);\n      if (!placeholders.has(source)) placeholders.set(source, placeholderScope(source, grant));\n    }\n    if (source === grant.target) continue;\n    edges.set(`${source}\\u0000${grant.target}`, { source, target: grant.target, kind: 'grant', role: grant.role });\n  }\n  return { placeholders: [...placeholders.values()], edges: [...edges.values()] };\n}\n\nfunction placeholderScope(id: string, grant: KnowledgeScopeGrantPayload): KnowledgePagePayload {\n  const nobody = { author: '' };\n  return {\n    id,\n    scopeId: id,\n    parentId: null,\n    isScope: true,\n    address: grant.principal,\n    displayLabel: grant.principalLabel,\n    position: '',\n    name: grant.principal,\n    version: 0,\n    createdBy: nobody,\n    updatedBy: nobody,\n    createdAt: '',\n    updatedAt: '',\n  };\n}\n\n/** The page plus every page one edge away from it, either direction. */\nexport function pageNeighbourIds(pageId: string, edges: KnowledgePageEdge[]): Set<string> {\n  const ids = new Set([pageId]);\n  for (const edge of edges) {\n    if (edge.source === pageId) ids.add(edge.target);\n    if (edge.target === pageId) ids.add(edge.source);\n  }\n  return ids;\n}\n\n/** Circle diameters: big enough for a kind label and three lines of name. */\nexport const KNOWLEDGE_SCOPE_SIZE = 124;\nexport const KNOWLEDGE_PAGE_SIZE = 108;\n\nexport type PageFlowNode = Node<{\n  page: KnowledgePagePayload;\n  size: number;\n  selected: boolean;\n}>;\n\nexport type PageFlowEdge = Edge<{ kind: KnowledgePageEdge['kind']; count: number; role?: KnowledgePageEdge['role'] }>;\n\n/** Converts pages and their edges to React Flow elements; positions are left to the layout. */\nexport function toPageFlow(\n  pages: KnowledgePagePayload[],\n  edges: KnowledgePageEdge[],\n  selectedId?: string | null,\n): { nodes: PageFlowNode[]; edges: PageFlowEdge[] } {\n  const nodes = pages\n    .filter(page => !page.deletedAt && !page.mergedInto)\n    .map((page): PageFlowNode => {\n      return {\n        id: page.id,\n        type: 'page',\n        position: { x: 0, y: 0 },\n        data: {\n          page,\n          size: page.isScope ? KNOWLEDGE_SCOPE_SIZE : KNOWLEDGE_PAGE_SIZE,\n          selected: page.id === selectedId,\n        },\n      };\n    });\n  return {\n    nodes,\n    edges: edges.map(\n      (edge): PageFlowEdge => ({\n        id: `${edge.kind}:${edge.source}->${edge.target}`,\n        source: edge.source,\n        target: edge.target,\n        data: { kind: edge.kind, count: edge.count ?? 1, ...(edge.role ? { role: edge.role } : {}) },\n      }),\n    ),\n  };\n}\n"],"mappings":";;;;;;AAgBA,SAAgB,eACd,OACA,YAAiC,CAAC,GACb;CACrB,MAAM,OAAO,IAAI,IAAI,MAAM,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CAAC,KAAI,SAAQ,KAAK,EAAE,CAAC;CACnG,MAAM,QAA6B,CAAC;CACpC,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,IAAI,KAAK,EAAE,KAAK,KAAK,YAAY,KAAK,aAAa,KAAK,MAAM,KAAK,IAAI,KAAK,QAAQ,GAC3F,MAAM,KAAK;EAAE,QAAQ,KAAK;EAAU,QAAQ,KAAK;EAAI,MAAM;CAAS,CAAC;CAGzE,MAAM,wBAAQ,IAAI,IAA+B;CACjD,KAAK,MAAM,QAAQ,WAAW;EAC5B,IAAK,KAAK,SAAS,aAAa,KAAK,SAAS,UAAW,KAAK,WAAW,KAAK,QAAQ;EACtF,IAAI,CAAC,KAAK,IAAI,KAAK,MAAM,KAAK,CAAC,KAAK,IAAI,KAAK,MAAM,GAAG;EACtD,MAAM,MAAM,GAAG,KAAK,KAAK,QAAQ,KAAK,OAAO,QAAQ,KAAK;EAC1D,MAAM,WAAW,MAAM,IAAI,GAAG;EAC9B,MAAM,QAAQ,KAAK,SAAS;EAC5B,IAAI,UAAU,SAAS,SAAS,SAAS,SAAS,KAAK;OAClD,MAAM,IAAI,KAAK;GAAE,QAAQ,KAAK;GAAQ,QAAQ,KAAK;GAAQ,MAAM,KAAK;GAAM;EAAM,CAAC;CAC1F;CACA,OAAO,CAAC,GAAG,OAAO,GAAG,MAAM,OAAO,CAAC;AACrC;;AAGA,SAAgB,gBAAgB,SAAyB;CACvD,OAAO,YAAY;AACrB;;;;;;AAOA,SAAgB,WACd,OACA,SAAgD,CAAC,GACqB;CACtE,MAAM,OAAO,IAAI,IAAI,MAAM,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CAAC,KAAI,SAAQ,KAAK,EAAE,CAAC;CACnG,MAAM,+BAAe,IAAI,IAAkC;CAC3D,MAAM,wBAAQ,IAAI,IAA+B;CACjD,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,CAAC,KAAK,IAAI,MAAM,MAAM,GAAG;EAC7B,IAAI,SAAS,MAAM,eAAe,KAAK,IAAI,MAAM,WAAW,IAAI,MAAM,cAAc;EACpF,IAAI,CAAC,QAAQ;GACX,IAAI,MAAM,aAAa;GACvB,SAAS,gBAAgB,MAAM,SAAS;GACxC,IAAI,CAAC,aAAa,IAAI,MAAM,GAAG,aAAa,IAAI,QAAQ,iBAAiB,QAAQ,KAAK,CAAC;EACzF;EACA,IAAI,WAAW,MAAM,QAAQ;EAC7B,MAAM,IAAI,GAAG,OAAO,QAAQ,MAAM,UAAU;GAAE;GAAQ,QAAQ,MAAM;GAAQ,MAAM;GAAS,MAAM,MAAM;EAAK,CAAC;CAC/G;CACA,OAAO;EAAE,cAAc,CAAC,GAAG,aAAa,OAAO,CAAC;EAAG,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC;CAAE;AAChF;AAEA,SAAS,iBAAiB,IAAY,OAAyD;CAC7F,MAAM,SAAS,EAAE,QAAQ,GAAG;CAC5B,OAAO;EACL;EACA,SAAS;EACT,UAAU;EACV,SAAS;EACT,SAAS,MAAM;EACf,cAAc,MAAM;EACpB,UAAU;EACV,MAAM,MAAM;EACZ,SAAS;EACT,WAAW;EACX,WAAW;EACX,WAAW;EACX,WAAW;CACb;AACF;;AAGA,SAAgB,iBAAiB,QAAgB,OAAyC;CACxF,MAAM,sBAAM,IAAI,IAAI,CAAC,MAAM,CAAC;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,WAAW,QAAQ,IAAI,IAAI,KAAK,MAAM;EAC/C,IAAI,KAAK,WAAW,QAAQ,IAAI,IAAI,KAAK,MAAM;CACjD;CACA,OAAO;AACT;;AAGA,IAAa,uBAAuB;AACpC,IAAa,sBAAsB;;AAWnC,SAAgB,WACd,OACA,OACA,YACkD;CAelD,OAAO;EACL,OAfY,MACX,QAAO,SAAQ,CAAC,KAAK,aAAa,CAAC,KAAK,UAAU,CAAC,CACnD,KAAK,SAAuB;GAC3B,OAAO;IACL,IAAI,KAAK;IACT,MAAM;IACN,UAAU;KAAE,GAAG;KAAG,GAAG;IAAE;IACvB,MAAM;KACJ;KACA,MAAM,KAAK,UAAA,MAAA;KACX,UAAU,KAAK,OAAO;IACxB;GACF;EACF,CAEA;EACA,OAAO,MAAM,KACV,UAAwB;GACvB,IAAI,GAAG,KAAK,KAAK,GAAG,KAAK,OAAO,IAAI,KAAK;GACzC,QAAQ,KAAK;GACb,QAAQ,KAAK;GACb,MAAM;IAAE,MAAM,KAAK;IAAM,OAAO,KAAK,SAAS;IAAG,GAAI,KAAK,OAAO,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;GAAG;EAC7F,EACF;CACF;AACF"}

package/dist/domains/knowledge/lib/pageRefs.cjs.js

@@ -0,0 +1,69 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+// src/domains/knowledge/lib/pageRefs.ts
+/** Same as core's `canonicalKnowledgeName`. */
+function canonicalName(name) {
+	return name.normalize("NFKC").trim().replace(/\s+/g, " ").toLowerCase();
+}
+function knowledgePageRefIndex(pages) {
+	const byId = /* @__PURE__ */ new Map();
+	const scopesByAddress = /* @__PURE__ */ new Map();
+	const childByKey = /* @__PURE__ */ new Map();
+	const byName = /* @__PURE__ */ new Map();
+	for (const page of pages) {
+		if (page.deletedAt || page.mergedInto) continue;
+		byId.set(page.id, page);
+		if (page.isScope && page.address) scopesByAddress.set(page.address, page);
+		if (!page.isScope && page.key && page.parentId) childByKey.set(`${page.parentId}\u0000${page.key}`, page);
+		const name = canonicalName(page.name);
+		byName.set(name, byName.has(name) ? null : page);
+	}
+	const byPath = (ref) => {
+		const hash = ref.indexOf("#");
+		if (hash <= 0) return void 0;
+		const scope = scopesByAddress.get(ref.slice(0, hash));
+		if (!scope) return void 0;
+		let page = scope;
+		for (const key of ref.slice(hash + 1).split("/")) {
+			page = childByKey.get(`${page.id}\u0000${key}`);
+			if (!page || page.scopeId !== scope.id) return void 0;
+		}
+		return page === scope ? void 0 : page;
+	};
+	return { resolve(raw) {
+		const ref = raw.trim();
+		if (!ref) return void 0;
+		return byId.get(ref) ?? byPath(ref) ?? scopesByAddress.get(ref) ?? byName.get(canonicalName(ref)) ?? void 0;
+	} };
+}
+var WIKILINK = /\[\[([^\]]+)\]\]/g;
+var FENCED_CODE = /^(`{3,}|~{3,})[^\n]*\n[\s\S]*?(?:^\1[ \t]*$|(?![\s\S]))/gm;
+var INLINE_CODE = /(`+)[\s\S]*?\1/g;
+/** The `[[ref]]`s in a markdown body, outside code. */
+function bodyLinkRefs(body) {
+	return [...body.replace(FENCED_CODE, "").replace(INLINE_CODE, "").matchAll(WIKILINK)].map((match) => match[1] ?? "");
+}
+/** One `link` edge per page whose body links another loaded page; `count` is how many times. */
+function bodyLinkEdges(pages) {
+	const index = knowledgePageRefIndex(pages);
+	const edges = [];
+	for (const page of pages) {
+		if (!page.body || page.deletedAt || page.mergedInto) continue;
+		const counts = /* @__PURE__ */ new Map();
+		for (const ref of bodyLinkRefs(page.body)) {
+			const target = index.resolve(ref);
+			if (target && target.id !== page.id) counts.set(target.id, (counts.get(target.id) ?? 0) + 1);
+		}
+		for (const [target, count] of counts) edges.push({
+			source: page.id,
+			target,
+			kind: "link",
+			count
+		});
+	}
+	return edges;
+}
+exports.bodyLinkEdges = bodyLinkEdges;
+exports.bodyLinkRefs = bodyLinkRefs;
+exports.knowledgePageRefIndex = knowledgePageRefIndex;
+
+//# sourceMappingURL=pageRefs.cjs.js.map

package/dist/domains/knowledge/lib/pageRefs.cjs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pageRefs.cjs.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageRefs.ts"],"sourcesContent":["/**\n * Resolves `[[ref]]` links in page bodies and notes against the pages the explorer has loaded, in the\n * order core's `run.page(ref)` uses: page id, then `scope#key/key` path, then scope address, then a\n * unique page name (an ambiguous name resolves to nothing, as it throws in core). The server does not\n * resolve body links, so a link to a page outside the loaded set stays unresolved.\n */\n\nimport type { KnowledgePageEdge, KnowledgePagePayload } from '../pageTypes';\n\nexport interface KnowledgePageRefIndex {\n  resolve: (ref: string) => KnowledgePagePayload | undefined;\n}\n\n/** Same as core's `canonicalKnowledgeName`. */\nfunction canonicalName(name: string): string {\n  return name.normalize('NFKC').trim().replace(/\\s+/g, ' ').toLowerCase();\n}\n\nexport function knowledgePageRefIndex(pages: Iterable<KnowledgePagePayload>): KnowledgePageRefIndex {\n  const byId = new Map<string, KnowledgePagePayload>();\n  const scopesByAddress = new Map<string, KnowledgePagePayload>();\n  const childByKey = new Map<string, KnowledgePagePayload>();\n  const byName = new Map<string, KnowledgePagePayload | null>();\n  for (const page of pages) {\n    if (page.deletedAt || page.mergedInto) continue;\n    byId.set(page.id, page);\n    if (page.isScope && page.address) scopesByAddress.set(page.address, page);\n    if (!page.isScope && page.key && page.parentId) childByKey.set(`${page.parentId}\\u0000${page.key}`, page);\n    const name = canonicalName(page.name);\n    byName.set(name, byName.has(name) ? null : page);\n  }\n\n  const byPath = (ref: string): KnowledgePagePayload | undefined => {\n    const hash = ref.indexOf('#');\n    if (hash <= 0) return undefined;\n    const scope = scopesByAddress.get(ref.slice(0, hash));\n    if (!scope) return undefined;\n    let page: KnowledgePagePayload | undefined = scope;\n    for (const key of ref.slice(hash + 1).split('/')) {\n      page = childByKey.get(`${page.id}\\u0000${key}`);\n      if (!page || page.scopeId !== scope.id) return undefined;\n    }\n    return page === scope ? undefined : page;\n  };\n\n  return {\n    resolve(raw) {\n      const ref = raw.trim();\n      if (!ref) return undefined;\n      return byId.get(ref) ?? byPath(ref) ?? scopesByAddress.get(ref) ?? byName.get(canonicalName(ref)) ?? undefined;\n    },\n  };\n}\n\nconst WIKILINK = /\\[\\[([^\\]]+)\\]\\]/g;\n// Code is shown as written, so a `[[ref]]` inside it is not a link.\nconst FENCED_CODE = /^(`{3,}|~{3,})[^\\n]*\\n[\\s\\S]*?(?:^\\1[ \\t]*$|(?![\\s\\S]))/gm;\nconst INLINE_CODE = /(`+)[\\s\\S]*?\\1/g;\n\n/** The `[[ref]]`s in a markdown body, outside code. */\nexport function bodyLinkRefs(body: string): string[] {\n  const prose = body.replace(FENCED_CODE, '').replace(INLINE_CODE, '');\n  return [...prose.matchAll(WIKILINK)].map(match => match[1] ?? '');\n}\n\n/** One `link` edge per page whose body links another loaded page; `count` is how many times. */\nexport function bodyLinkEdges(pages: KnowledgePagePayload[]): KnowledgePageEdge[] {\n  const index = knowledgePageRefIndex(pages);\n  const edges: KnowledgePageEdge[] = [];\n  for (const page of pages) {\n    if (!page.body || page.deletedAt || page.mergedInto) continue;\n    const counts = new Map<string, number>();\n    for (const ref of bodyLinkRefs(page.body)) {\n      const target = index.resolve(ref);\n      if (target && target.id !== page.id) counts.set(target.id, (counts.get(target.id) ?? 0) + 1);\n    }\n    for (const [target, count] of counts) edges.push({ source: page.id, target, kind: 'link', count });\n  }\n  return edges;\n}\n"],"mappings":";;;AAcA,SAAS,cAAc,MAAsB;CAC3C,OAAO,KAAK,UAAU,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,QAAQ,GAAG,CAAC,CAAC,YAAY;AACxE;AAEA,SAAgB,sBAAsB,OAA8D;CAClG,MAAM,uBAAO,IAAI,IAAkC;CACnD,MAAM,kCAAkB,IAAI,IAAkC;CAC9D,MAAM,6BAAa,IAAI,IAAkC;CACzD,MAAM,yBAAS,IAAI,IAAyC;CAC5D,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,aAAa,KAAK,YAAY;EACvC,KAAK,IAAI,KAAK,IAAI,IAAI;EACtB,IAAI,KAAK,WAAW,KAAK,SAAS,gBAAgB,IAAI,KAAK,SAAS,IAAI;EACxE,IAAI,CAAC,KAAK,WAAW,KAAK,OAAO,KAAK,UAAU,WAAW,IAAI,GAAG,KAAK,SAAS,QAAQ,KAAK,OAAO,IAAI;EACxG,MAAM,OAAO,cAAc,KAAK,IAAI;EACpC,OAAO,IAAI,MAAM,OAAO,IAAI,IAAI,IAAI,OAAO,IAAI;CACjD;CAEA,MAAM,UAAU,QAAkD;EAChE,MAAM,OAAO,IAAI,QAAQ,GAAG;EAC5B,IAAI,QAAQ,GAAG,OAAO,KAAA;EACtB,MAAM,QAAQ,gBAAgB,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC;EACpD,IAAI,CAAC,OAAO,OAAO,KAAA;EACnB,IAAI,OAAyC;EAC7C,KAAK,MAAM,OAAO,IAAI,MAAM,OAAO,CAAC,CAAC,CAAC,MAAM,GAAG,GAAG;GAChD,OAAO,WAAW,IAAI,GAAG,KAAK,GAAG,QAAQ,KAAK;GAC9C,IAAI,CAAC,QAAQ,KAAK,YAAY,MAAM,IAAI,OAAO,KAAA;EACjD;EACA,OAAO,SAAS,QAAQ,KAAA,IAAY;CACtC;CAEA,OAAO,EACL,QAAQ,KAAK;EACX,MAAM,MAAM,IAAI,KAAK;EACrB,IAAI,CAAC,KAAK,OAAO,KAAA;EACjB,OAAO,KAAK,IAAI,GAAG,KAAK,OAAO,GAAG,KAAK,gBAAgB,IAAI,GAAG,KAAK,OAAO,IAAI,cAAc,GAAG,CAAC,KAAK,KAAA;CACvG,EACF;AACF;AAEA,IAAM,WAAW;AAEjB,IAAM,cAAc;AACpB,IAAM,cAAc;;AAGpB,SAAgB,aAAa,MAAwB;CAEnD,OAAO,CAAC,GADM,KAAK,QAAQ,aAAa,EAAE,CAAC,CAAC,QAAQ,aAAa,EACtD,CAAA,CAAM,SAAS,QAAQ,CAAC,CAAC,CAAC,KAAI,UAAS,MAAM,MAAM,EAAE;AAClE;;AAGA,SAAgB,cAAc,OAAoD;CAChF,MAAM,QAAQ,sBAAsB,KAAK;CACzC,MAAM,QAA6B,CAAC;CACpC,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,CAAC,KAAK,QAAQ,KAAK,aAAa,KAAK,YAAY;EACrD,MAAM,yBAAS,IAAI,IAAoB;EACvC,KAAK,MAAM,OAAO,aAAa,KAAK,IAAI,GAAG;GACzC,MAAM,SAAS,MAAM,QAAQ,GAAG;GAChC,IAAI,UAAU,OAAO,OAAO,KAAK,IAAI,OAAO,IAAI,OAAO,KAAK,OAAO,IAAI,OAAO,EAAE,KAAK,KAAK,CAAC;EAC7F;EACA,KAAK,MAAM,CAAC,QAAQ,UAAU,QAAQ,MAAM,KAAK;GAAE,QAAQ,KAAK;GAAI;GAAQ,MAAM;GAAQ;EAAM,CAAC;CACnG;CACA,OAAO;AACT"}

package/dist/domains/knowledge/lib/pageRefs.d.ts

@@ -0,0 +1 @@
+export * from '../../../src/domains/knowledge/lib/pageRefs';

package/dist/domains/knowledge/lib/pageRefs.es.js

@@ -0,0 +1,66 @@
+// src/domains/knowledge/lib/pageRefs.ts
+/** Same as core's `canonicalKnowledgeName`. */
+function canonicalName(name) {
+	return name.normalize("NFKC").trim().replace(/\s+/g, " ").toLowerCase();
+}
+function knowledgePageRefIndex(pages) {
+	const byId = /* @__PURE__ */ new Map();
+	const scopesByAddress = /* @__PURE__ */ new Map();
+	const childByKey = /* @__PURE__ */ new Map();
+	const byName = /* @__PURE__ */ new Map();
+	for (const page of pages) {
+		if (page.deletedAt || page.mergedInto) continue;
+		byId.set(page.id, page);
+		if (page.isScope && page.address) scopesByAddress.set(page.address, page);
+		if (!page.isScope && page.key && page.parentId) childByKey.set(`${page.parentId}\u0000${page.key}`, page);
+		const name = canonicalName(page.name);
+		byName.set(name, byName.has(name) ? null : page);
+	}
+	const byPath = (ref) => {
+		const hash = ref.indexOf("#");
+		if (hash <= 0) return void 0;
+		const scope = scopesByAddress.get(ref.slice(0, hash));
+		if (!scope) return void 0;
+		let page = scope;
+		for (const key of ref.slice(hash + 1).split("/")) {
+			page = childByKey.get(`${page.id}\u0000${key}`);
+			if (!page || page.scopeId !== scope.id) return void 0;
+		}
+		return page === scope ? void 0 : page;
+	};
+	return { resolve(raw) {
+		const ref = raw.trim();
+		if (!ref) return void 0;
+		return byId.get(ref) ?? byPath(ref) ?? scopesByAddress.get(ref) ?? byName.get(canonicalName(ref)) ?? void 0;
+	} };
+}
+var WIKILINK = /\[\[([^\]]+)\]\]/g;
+var FENCED_CODE = /^(`{3,}|~{3,})[^\n]*\n[\s\S]*?(?:^\1[ \t]*$|(?![\s\S]))/gm;
+var INLINE_CODE = /(`+)[\s\S]*?\1/g;
+/** The `[[ref]]`s in a markdown body, outside code. */
+function bodyLinkRefs(body) {
+	return [...body.replace(FENCED_CODE, "").replace(INLINE_CODE, "").matchAll(WIKILINK)].map((match) => match[1] ?? "");
+}
+/** One `link` edge per page whose body links another loaded page; `count` is how many times. */
+function bodyLinkEdges(pages) {
+	const index = knowledgePageRefIndex(pages);
+	const edges = [];
+	for (const page of pages) {
+		if (!page.body || page.deletedAt || page.mergedInto) continue;
+		const counts = /* @__PURE__ */ new Map();
+		for (const ref of bodyLinkRefs(page.body)) {
+			const target = index.resolve(ref);
+			if (target && target.id !== page.id) counts.set(target.id, (counts.get(target.id) ?? 0) + 1);
+		}
+		for (const [target, count] of counts) edges.push({
+			source: page.id,
+			target,
+			kind: "link",
+			count
+		});
+	}
+	return edges;
+}
+export { bodyLinkEdges, bodyLinkRefs, knowledgePageRefIndex };
+
+//# sourceMappingURL=pageRefs.es.js.map

package/dist/domains/knowledge/lib/pageRefs.es.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pageRefs.es.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageRefs.ts"],"sourcesContent":["/**\n * Resolves `[[ref]]` links in page bodies and notes against the pages the explorer has loaded, in the\n * order core's `run.page(ref)` uses: page id, then `scope#key/key` path, then scope address, then a\n * unique page name (an ambiguous name resolves to nothing, as it throws in core). The server does not\n * resolve body links, so a link to a page outside the loaded set stays unresolved.\n */\n\nimport type { KnowledgePageEdge, KnowledgePagePayload } from '../pageTypes';\n\nexport interface KnowledgePageRefIndex {\n  resolve: (ref: string) => KnowledgePagePayload | undefined;\n}\n\n/** Same as core's `canonicalKnowledgeName`. */\nfunction canonicalName(name: string): string {\n  return name.normalize('NFKC').trim().replace(/\\s+/g, ' ').toLowerCase();\n}\n\nexport function knowledgePageRefIndex(pages: Iterable<KnowledgePagePayload>): KnowledgePageRefIndex {\n  const byId = new Map<string, KnowledgePagePayload>();\n  const scopesByAddress = new Map<string, KnowledgePagePayload>();\n  const childByKey = new Map<string, KnowledgePagePayload>();\n  const byName = new Map<string, KnowledgePagePayload | null>();\n  for (const page of pages) {\n    if (page.deletedAt || page.mergedInto) continue;\n    byId.set(page.id, page);\n    if (page.isScope && page.address) scopesByAddress.set(page.address, page);\n    if (!page.isScope && page.key && page.parentId) childByKey.set(`${page.parentId}\\u0000${page.key}`, page);\n    const name = canonicalName(page.name);\n    byName.set(name, byName.has(name) ? null : page);\n  }\n\n  const byPath = (ref: string): KnowledgePagePayload | undefined => {\n    const hash = ref.indexOf('#');\n    if (hash <= 0) return undefined;\n    const scope = scopesByAddress.get(ref.slice(0, hash));\n    if (!scope) return undefined;\n    let page: KnowledgePagePayload | undefined = scope;\n    for (const key of ref.slice(hash + 1).split('/')) {\n      page = childByKey.get(`${page.id}\\u0000${key}`);\n      if (!page || page.scopeId !== scope.id) return undefined;\n    }\n    return page === scope ? undefined : page;\n  };\n\n  return {\n    resolve(raw) {\n      const ref = raw.trim();\n      if (!ref) return undefined;\n      return byId.get(ref) ?? byPath(ref) ?? scopesByAddress.get(ref) ?? byName.get(canonicalName(ref)) ?? undefined;\n    },\n  };\n}\n\nconst WIKILINK = /\\[\\[([^\\]]+)\\]\\]/g;\n// Code is shown as written, so a `[[ref]]` inside it is not a link.\nconst FENCED_CODE = /^(`{3,}|~{3,})[^\\n]*\\n[\\s\\S]*?(?:^\\1[ \\t]*$|(?![\\s\\S]))/gm;\nconst INLINE_CODE = /(`+)[\\s\\S]*?\\1/g;\n\n/** The `[[ref]]`s in a markdown body, outside code. */\nexport function bodyLinkRefs(body: string): string[] {\n  const prose = body.replace(FENCED_CODE, '').replace(INLINE_CODE, '');\n  return [...prose.matchAll(WIKILINK)].map(match => match[1] ?? '');\n}\n\n/** One `link` edge per page whose body links another loaded page; `count` is how many times. */\nexport function bodyLinkEdges(pages: KnowledgePagePayload[]): KnowledgePageEdge[] {\n  const index = knowledgePageRefIndex(pages);\n  const edges: KnowledgePageEdge[] = [];\n  for (const page of pages) {\n    if (!page.body || page.deletedAt || page.mergedInto) continue;\n    const counts = new Map<string, number>();\n    for (const ref of bodyLinkRefs(page.body)) {\n      const target = index.resolve(ref);\n      if (target && target.id !== page.id) counts.set(target.id, (counts.get(target.id) ?? 0) + 1);\n    }\n    for (const [target, count] of counts) edges.push({ source: page.id, target, kind: 'link', count });\n  }\n  return edges;\n}\n"],"mappings":";;AAcA,SAAS,cAAc,MAAsB;CAC3C,OAAO,KAAK,UAAU,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,QAAQ,GAAG,CAAC,CAAC,YAAY;AACxE;AAEA,SAAgB,sBAAsB,OAA8D;CAClG,MAAM,uBAAO,IAAI,IAAkC;CACnD,MAAM,kCAAkB,IAAI,IAAkC;CAC9D,MAAM,6BAAa,IAAI,IAAkC;CACzD,MAAM,yBAAS,IAAI,IAAyC;CAC5D,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,aAAa,KAAK,YAAY;EACvC,KAAK,IAAI,KAAK,IAAI,IAAI;EACtB,IAAI,KAAK,WAAW,KAAK,SAAS,gBAAgB,IAAI,KAAK,SAAS,IAAI;EACxE,IAAI,CAAC,KAAK,WAAW,KAAK,OAAO,KAAK,UAAU,WAAW,IAAI,GAAG,KAAK,SAAS,QAAQ,KAAK,OAAO,IAAI;EACxG,MAAM,OAAO,cAAc,KAAK,IAAI;EACpC,OAAO,IAAI,MAAM,OAAO,IAAI,IAAI,IAAI,OAAO,IAAI;CACjD;CAEA,MAAM,UAAU,QAAkD;EAChE,MAAM,OAAO,IAAI,QAAQ,GAAG;EAC5B,IAAI,QAAQ,GAAG,OAAO,KAAA;EACtB,MAAM,QAAQ,gBAAgB,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC;EACpD,IAAI,CAAC,OAAO,OAAO,KAAA;EACnB,IAAI,OAAyC;EAC7C,KAAK,MAAM,OAAO,IAAI,MAAM,OAAO,CAAC,CAAC,CAAC,MAAM,GAAG,GAAG;GAChD,OAAO,WAAW,IAAI,GAAG,KAAK,GAAG,QAAQ,KAAK;GAC9C,IAAI,CAAC,QAAQ,KAAK,YAAY,MAAM,IAAI,OAAO,KAAA;EACjD;EACA,OAAO,SAAS,QAAQ,KAAA,IAAY;CACtC;CAEA,OAAO,EACL,QAAQ,KAAK;EACX,MAAM,MAAM,IAAI,KAAK;EACrB,IAAI,CAAC,KAAK,OAAO,KAAA;EACjB,OAAO,KAAK,IAAI,GAAG,KAAK,OAAO,GAAG,KAAK,gBAAgB,IAAI,GAAG,KAAK,OAAO,IAAI,cAAc,GAAG,CAAC,KAAK,KAAA;CACvG,EACF;AACF;AAEA,IAAM,WAAW;AAEjB,IAAM,cAAc;AACpB,IAAM,cAAc;;AAGpB,SAAgB,aAAa,MAAwB;CAEnD,OAAO,CAAC,GADM,KAAK,QAAQ,aAAa,EAAE,CAAC,CAAC,QAAQ,aAAa,EACtD,CAAA,CAAM,SAAS,QAAQ,CAAC,CAAC,CAAC,KAAI,UAAS,MAAM,MAAM,EAAE;AAClE;;AAGA,SAAgB,cAAc,OAAoD;CAChF,MAAM,QAAQ,sBAAsB,KAAK;CACzC,MAAM,QAA6B,CAAC;CACpC,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,CAAC,KAAK,QAAQ,KAAK,aAAa,KAAK,YAAY;EACrD,MAAM,yBAAS,IAAI,IAAoB;EACvC,KAAK,MAAM,OAAO,aAAa,KAAK,IAAI,GAAG;GACzC,MAAM,SAAS,MAAM,QAAQ,GAAG;GAChC,IAAI,UAAU,OAAO,OAAO,KAAK,IAAI,OAAO,IAAI,OAAO,KAAK,OAAO,IAAI,OAAO,EAAE,KAAK,KAAK,CAAC;EAC7F;EACA,KAAK,MAAM,CAAC,QAAQ,UAAU,QAAQ,MAAM,KAAK;GAAE,QAAQ,KAAK;GAAI;GAAQ,MAAM;GAAQ;EAAM,CAAC;CACnG;CACA,OAAO;AACT"}

package/dist/domains/knowledge/lib/pageTree.cjs.js

@@ -90,7 +90,12 @@ function pageAncestorIds(pages, pageId) {
 	}
 	return path;
 }
+/** A page's child count as shown: `1000+` when the server capped the count, so it never reads low. */
+function childCountLabel(page) {
+	return page.childCountCapped ? `${page.childCount ?? 0}+` : String(page.childCount ?? 0);
+}
 exports.buildPageTree = buildPageTree;
+exports.childCountLabel = childCountLabel;
 exports.comparePagePosition = comparePagePosition;
 exports.pageAncestorIds = pageAncestorIds;
 exports.visiblePageRows = visiblePageRows;

package/dist/domains/knowledge/lib/pageTree.cjs.js.map

@@ -1 +1 @@
-{"version":3,"file":"pageTree.cjs.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageTree.ts"],"sourcesContent":["/**\n * Pure page-tree logic for the schema-4 explorer: loaded pages → a sorted\n * tree, the visible rows for a set of expanded ids, and the ancestor path\n * that must open to reveal a selection. Free of React so it unit-tests alone.\n */\n\nimport type { KnowledgePagePayload } from '../pageTypes';\n\nexport interface KnowledgePageTreeNode {\n  page: KnowledgePagePayload;\n  children: KnowledgePageTreeNode[];\n}\n\nexport interface KnowledgePageTreeRow {\n  page: KnowledgePagePayload;\n  depth: number;\n  hasChildren: boolean;\n  expanded: boolean;\n}\n\n/** Sibling order: position by UTF-16 code unit (as the store defines it), then id. */\nexport function comparePagePosition(a: KnowledgePagePayload, b: KnowledgePagePayload): number {\n  if (a.position !== b.position) return a.position < b.position ? -1 : 1;\n  if (a.id === b.id) return 0;\n  return a.id < b.id ? -1 : 1;\n}\n\nfunction isLive(page: KnowledgePagePayload): boolean {\n  return !page.deletedAt && !page.mergedInto;\n}\n\n/**\n * Builds the tree from whatever pages are loaded. A page whose parent isn't\n * loaded (or is deleted/merged) becomes a root, and so does the first page (in\n * sibling order) of any parent cycle, so no loaded live page is ever lost.\n */\nexport function buildPageTree(pages: KnowledgePagePayload[]): KnowledgePageTreeNode[] {\n  const nodes = new Map<string, KnowledgePageTreeNode>();\n  for (const page of pages) {\n    if (isLive(page) && !nodes.has(page.id)) nodes.set(page.id, { page, children: [] });\n  }\n  const roots: KnowledgePageTreeNode[] = [];\n  const parentOf = new Map<KnowledgePageTreeNode, KnowledgePageTreeNode>();\n  for (const node of nodes.values()) {\n    const parent = node.page.parentId ? nodes.get(node.page.parentId) : undefined;\n    if (parent && parent !== node) {\n      parent.children.push(node);\n      parentOf.set(node, parent);\n    } else roots.push(node);\n  }\n  const reached = new Set<KnowledgePageTreeNode>();\n  const reach = (node: KnowledgePageTreeNode) => {\n    if (reached.has(node)) return;\n    reached.add(node);\n    for (const child of node.children) reach(child);\n  };\n  roots.forEach(reach);\n  // Whatever no root reaches sits in a parent cycle (or under one): cut each cycle at its first page.\n  const stranded = [...nodes.values()].filter(node => !reached.has(node));\n  stranded.sort((a, b) => comparePagePosition(a.page, b.page));\n  for (const node of stranded) {\n    if (reached.has(node)) continue;\n    // Climb to the cycle this page hangs from, then cut it at the cycle's first page.\n    const path: KnowledgePageTreeNode[] = [];\n    let at: KnowledgePageTreeNode | undefined = node;\n    while (at && !path.includes(at)) {\n      path.push(at);\n      at = parentOf.get(at);\n    }\n    const cycle = at ? path.slice(path.indexOf(at)) : [node];\n    const cut = cycle.reduce((first, member) => (comparePagePosition(member.page, first.page) < 0 ? member : first));\n    const parent = parentOf.get(cut);\n    if (parent) parent.children.splice(parent.children.indexOf(cut), 1);\n    roots.push(cut);\n    reach(cut);\n  }\n  const sort = (list: KnowledgePageTreeNode[]) => {\n    list.sort((a, b) => comparePagePosition(a.page, b.page));\n    for (const node of list) sort(node.children);\n  };\n  sort(roots);\n  return roots;\n}\n\n/** Depth-first rows for rendering, descending only into expanded pages. */\nexport function visiblePageRows(roots: KnowledgePageTreeNode[], expanded: ReadonlySet<string>): KnowledgePageTreeRow[] {\n  const rows: KnowledgePageTreeRow[] = [];\n  const walk = (list: KnowledgePageTreeNode[], depth: number) => {\n    for (const node of list) {\n      const open = expanded.has(node.page.id);\n      rows.push({ page: node.page, depth, hasChildren: node.children.length > 0, expanded: open });\n      if (open) walk(node.children, depth + 1);\n    }\n  };\n  walk(roots, 0);\n  return rows;\n}\n\n/** Ids from the root down to (not including) `pageId`; stops at unloaded parents and cycles. */\nexport function pageAncestorIds(pages: KnowledgePagePayload[], pageId: string): string[] {\n  const byId = new Map(pages.map(page => [page.id, page]));\n  const path: string[] = [];\n  const seen = new Set<string>([pageId]);\n  let parentId = byId.get(pageId)?.parentId ?? null;\n  while (parentId && byId.has(parentId) && !seen.has(parentId)) {\n    seen.add(parentId);\n    path.unshift(parentId);\n    parentId = byId.get(parentId)?.parentId ?? null;\n  }\n  return path;\n}\n"],"mappings":";;;AAqBA,SAAgB,oBAAoB,GAAyB,GAAiC;CAC5F,IAAI,EAAE,aAAa,EAAE,UAAU,OAAO,EAAE,WAAW,EAAE,WAAW,KAAK;CACrE,IAAI,EAAE,OAAO,EAAE,IAAI,OAAO;CAC1B,OAAO,EAAE,KAAK,EAAE,KAAK,KAAK;AAC5B;AAEA,SAAS,OAAO,MAAqC;CACnD,OAAO,CAAC,KAAK,aAAa,CAAC,KAAK;AAClC;;;;;;AAOA,SAAgB,cAAc,OAAwD;CACpF,MAAM,wBAAQ,IAAI,IAAmC;CACrD,KAAK,MAAM,QAAQ,OACjB,IAAI,OAAO,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,EAAE,GAAG,MAAM,IAAI,KAAK,IAAI;EAAE;EAAM,UAAU,CAAC;CAAE,CAAC;CAEpF,MAAM,QAAiC,CAAC;CACxC,MAAM,2BAAW,IAAI,IAAkD;CACvE,KAAK,MAAM,QAAQ,MAAM,OAAO,GAAG;EACjC,MAAM,SAAS,KAAK,KAAK,WAAW,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAA;EACpE,IAAI,UAAU,WAAW,MAAM;GAC7B,OAAO,SAAS,KAAK,IAAI;GACzB,SAAS,IAAI,MAAM,MAAM;EAC3B,OAAO,MAAM,KAAK,IAAI;CACxB;CACA,MAAM,0BAAU,IAAI,IAA2B;CAC/C,MAAM,SAAS,SAAgC;EAC7C,IAAI,QAAQ,IAAI,IAAI,GAAG;EACvB,QAAQ,IAAI,IAAI;EAChB,KAAK,MAAM,SAAS,KAAK,UAAU,MAAM,KAAK;CAChD;CACA,MAAM,QAAQ,KAAK;CAEnB,MAAM,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC,CAAC,QAAO,SAAQ,CAAC,QAAQ,IAAI,IAAI,CAAC;CACtE,SAAS,MAAM,GAAG,MAAM,oBAAoB,EAAE,MAAM,EAAE,IAAI,CAAC;CAC3D,KAAK,MAAM,QAAQ,UAAU;EAC3B,IAAI,QAAQ,IAAI,IAAI,GAAG;EAEvB,MAAM,OAAgC,CAAC;EACvC,IAAI,KAAwC;EAC5C,OAAO,MAAM,CAAC,KAAK,SAAS,EAAE,GAAG;GAC/B,KAAK,KAAK,EAAE;GACZ,KAAK,SAAS,IAAI,EAAE;EACtB;EAEA,MAAM,OADQ,KAAK,KAAK,MAAM,KAAK,QAAQ,EAAE,CAAC,IAAI,CAAC,IAAI,EAAA,CACrC,QAAQ,OAAO,WAAY,oBAAoB,OAAO,MAAM,MAAM,IAAI,IAAI,IAAI,SAAS,KAAM;EAC/G,MAAM,SAAS,SAAS,IAAI,GAAG;EAC/B,IAAI,QAAQ,OAAO,SAAS,OAAO,OAAO,SAAS,QAAQ,GAAG,GAAG,CAAC;EAClE,MAAM,KAAK,GAAG;EACd,MAAM,GAAG;CACX;CACA,MAAM,QAAQ,SAAkC;EAC9C,KAAK,MAAM,GAAG,MAAM,oBAAoB,EAAE,MAAM,EAAE,IAAI,CAAC;EACvD,KAAK,MAAM,QAAQ,MAAM,KAAK,KAAK,QAAQ;CAC7C;CACA,KAAK,KAAK;CACV,OAAO;AACT;;AAGA,SAAgB,gBAAgB,OAAgC,UAAuD;CACrH,MAAM,OAA+B,CAAC;CACtC,MAAM,QAAQ,MAA+B,UAAkB;EAC7D,KAAK,MAAM,QAAQ,MAAM;GACvB,MAAM,OAAO,SAAS,IAAI,KAAK,KAAK,EAAE;GACtC,KAAK,KAAK;IAAE,MAAM,KAAK;IAAM;IAAO,aAAa,KAAK,SAAS,SAAS;IAAG,UAAU;GAAK,CAAC;GAC3F,IAAI,MAAM,KAAK,KAAK,UAAU,QAAQ,CAAC;EACzC;CACF;CACA,KAAK,OAAO,CAAC;CACb,OAAO;AACT;;AAGA,SAAgB,gBAAgB,OAA+B,QAA0B;CACvF,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CACvD,MAAM,OAAiB,CAAC;CACxB,MAAM,uBAAO,IAAI,IAAY,CAAC,MAAM,CAAC;CACrC,IAAI,WAAW,KAAK,IAAI,MAAM,CAAC,EAAE,YAAY;CAC7C,OAAO,YAAY,KAAK,IAAI,QAAQ,KAAK,CAAC,KAAK,IAAI,QAAQ,GAAG;EAC5D,KAAK,IAAI,QAAQ;EACjB,KAAK,QAAQ,QAAQ;EACrB,WAAW,KAAK,IAAI,QAAQ,CAAC,EAAE,YAAY;CAC7C;CACA,OAAO;AACT"}
+{"version":3,"file":"pageTree.cjs.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageTree.ts"],"sourcesContent":["/**\n * Pure page-tree logic for the schema-4 explorer: loaded pages → a sorted\n * tree, the visible rows for a set of expanded ids, and the ancestor path\n * that must open to reveal a selection. Free of React so it unit-tests alone.\n */\n\nimport type { KnowledgePagePayload } from '../pageTypes';\n\nexport interface KnowledgePageTreeNode {\n  page: KnowledgePagePayload;\n  children: KnowledgePageTreeNode[];\n}\n\nexport interface KnowledgePageTreeRow {\n  page: KnowledgePagePayload;\n  depth: number;\n  hasChildren: boolean;\n  expanded: boolean;\n}\n\n/** Sibling order: position by UTF-16 code unit (as the store defines it), then id. */\nexport function comparePagePosition(a: KnowledgePagePayload, b: KnowledgePagePayload): number {\n  if (a.position !== b.position) return a.position < b.position ? -1 : 1;\n  if (a.id === b.id) return 0;\n  return a.id < b.id ? -1 : 1;\n}\n\nfunction isLive(page: KnowledgePagePayload): boolean {\n  return !page.deletedAt && !page.mergedInto;\n}\n\n/**\n * Builds the tree from whatever pages are loaded. A page whose parent isn't\n * loaded (or is deleted/merged) becomes a root, and so does the first page (in\n * sibling order) of any parent cycle, so no loaded live page is ever lost.\n */\nexport function buildPageTree(pages: KnowledgePagePayload[]): KnowledgePageTreeNode[] {\n  const nodes = new Map<string, KnowledgePageTreeNode>();\n  for (const page of pages) {\n    if (isLive(page) && !nodes.has(page.id)) nodes.set(page.id, { page, children: [] });\n  }\n  const roots: KnowledgePageTreeNode[] = [];\n  const parentOf = new Map<KnowledgePageTreeNode, KnowledgePageTreeNode>();\n  for (const node of nodes.values()) {\n    const parent = node.page.parentId ? nodes.get(node.page.parentId) : undefined;\n    if (parent && parent !== node) {\n      parent.children.push(node);\n      parentOf.set(node, parent);\n    } else roots.push(node);\n  }\n  const reached = new Set<KnowledgePageTreeNode>();\n  const reach = (node: KnowledgePageTreeNode) => {\n    if (reached.has(node)) return;\n    reached.add(node);\n    for (const child of node.children) reach(child);\n  };\n  roots.forEach(reach);\n  // Whatever no root reaches sits in a parent cycle (or under one): cut each cycle at its first page.\n  const stranded = [...nodes.values()].filter(node => !reached.has(node));\n  stranded.sort((a, b) => comparePagePosition(a.page, b.page));\n  for (const node of stranded) {\n    if (reached.has(node)) continue;\n    // Climb to the cycle this page hangs from, then cut it at the cycle's first page.\n    const path: KnowledgePageTreeNode[] = [];\n    let at: KnowledgePageTreeNode | undefined = node;\n    while (at && !path.includes(at)) {\n      path.push(at);\n      at = parentOf.get(at);\n    }\n    const cycle = at ? path.slice(path.indexOf(at)) : [node];\n    const cut = cycle.reduce((first, member) => (comparePagePosition(member.page, first.page) < 0 ? member : first));\n    const parent = parentOf.get(cut);\n    if (parent) parent.children.splice(parent.children.indexOf(cut), 1);\n    roots.push(cut);\n    reach(cut);\n  }\n  const sort = (list: KnowledgePageTreeNode[]) => {\n    list.sort((a, b) => comparePagePosition(a.page, b.page));\n    for (const node of list) sort(node.children);\n  };\n  sort(roots);\n  return roots;\n}\n\n/** Depth-first rows for rendering, descending only into expanded pages. */\nexport function visiblePageRows(roots: KnowledgePageTreeNode[], expanded: ReadonlySet<string>): KnowledgePageTreeRow[] {\n  const rows: KnowledgePageTreeRow[] = [];\n  const walk = (list: KnowledgePageTreeNode[], depth: number) => {\n    for (const node of list) {\n      const open = expanded.has(node.page.id);\n      rows.push({ page: node.page, depth, hasChildren: node.children.length > 0, expanded: open });\n      if (open) walk(node.children, depth + 1);\n    }\n  };\n  walk(roots, 0);\n  return rows;\n}\n\n/** Ids from the root down to (not including) `pageId`; stops at unloaded parents and cycles. */\nexport function pageAncestorIds(pages: KnowledgePagePayload[], pageId: string): string[] {\n  const byId = new Map(pages.map(page => [page.id, page]));\n  const path: string[] = [];\n  const seen = new Set<string>([pageId]);\n  let parentId = byId.get(pageId)?.parentId ?? null;\n  while (parentId && byId.has(parentId) && !seen.has(parentId)) {\n    seen.add(parentId);\n    path.unshift(parentId);\n    parentId = byId.get(parentId)?.parentId ?? null;\n  }\n  return path;\n}\n\n/** A page's child count as shown: `1000+` when the server capped the count, so it never reads low. */\nexport function childCountLabel(page: KnowledgePagePayload): string {\n  return page.childCountCapped ? `${page.childCount ?? 0}+` : String(page.childCount ?? 0);\n}\n"],"mappings":";;;AAqBA,SAAgB,oBAAoB,GAAyB,GAAiC;CAC5F,IAAI,EAAE,aAAa,EAAE,UAAU,OAAO,EAAE,WAAW,EAAE,WAAW,KAAK;CACrE,IAAI,EAAE,OAAO,EAAE,IAAI,OAAO;CAC1B,OAAO,EAAE,KAAK,EAAE,KAAK,KAAK;AAC5B;AAEA,SAAS,OAAO,MAAqC;CACnD,OAAO,CAAC,KAAK,aAAa,CAAC,KAAK;AAClC;;;;;;AAOA,SAAgB,cAAc,OAAwD;CACpF,MAAM,wBAAQ,IAAI,IAAmC;CACrD,KAAK,MAAM,QAAQ,OACjB,IAAI,OAAO,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,EAAE,GAAG,MAAM,IAAI,KAAK,IAAI;EAAE;EAAM,UAAU,CAAC;CAAE,CAAC;CAEpF,MAAM,QAAiC,CAAC;CACxC,MAAM,2BAAW,IAAI,IAAkD;CACvE,KAAK,MAAM,QAAQ,MAAM,OAAO,GAAG;EACjC,MAAM,SAAS,KAAK,KAAK,WAAW,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAA;EACpE,IAAI,UAAU,WAAW,MAAM;GAC7B,OAAO,SAAS,KAAK,IAAI;GACzB,SAAS,IAAI,MAAM,MAAM;EAC3B,OAAO,MAAM,KAAK,IAAI;CACxB;CACA,MAAM,0BAAU,IAAI,IAA2B;CAC/C,MAAM,SAAS,SAAgC;EAC7C,IAAI,QAAQ,IAAI,IAAI,GAAG;EACvB,QAAQ,IAAI,IAAI;EAChB,KAAK,MAAM,SAAS,KAAK,UAAU,MAAM,KAAK;CAChD;CACA,MAAM,QAAQ,KAAK;CAEnB,MAAM,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC,CAAC,QAAO,SAAQ,CAAC,QAAQ,IAAI,IAAI,CAAC;CACtE,SAAS,MAAM,GAAG,MAAM,oBAAoB,EAAE,MAAM,EAAE,IAAI,CAAC;CAC3D,KAAK,MAAM,QAAQ,UAAU;EAC3B,IAAI,QAAQ,IAAI,IAAI,GAAG;EAEvB,MAAM,OAAgC,CAAC;EACvC,IAAI,KAAwC;EAC5C,OAAO,MAAM,CAAC,KAAK,SAAS,EAAE,GAAG;GAC/B,KAAK,KAAK,EAAE;GACZ,KAAK,SAAS,IAAI,EAAE;EACtB;EAEA,MAAM,OADQ,KAAK,KAAK,MAAM,KAAK,QAAQ,EAAE,CAAC,IAAI,CAAC,IAAI,EAAA,CACrC,QAAQ,OAAO,WAAY,oBAAoB,OAAO,MAAM,MAAM,IAAI,IAAI,IAAI,SAAS,KAAM;EAC/G,MAAM,SAAS,SAAS,IAAI,GAAG;EAC/B,IAAI,QAAQ,OAAO,SAAS,OAAO,OAAO,SAAS,QAAQ,GAAG,GAAG,CAAC;EAClE,MAAM,KAAK,GAAG;EACd,MAAM,GAAG;CACX;CACA,MAAM,QAAQ,SAAkC;EAC9C,KAAK,MAAM,GAAG,MAAM,oBAAoB,EAAE,MAAM,EAAE,IAAI,CAAC;EACvD,KAAK,MAAM,QAAQ,MAAM,KAAK,KAAK,QAAQ;CAC7C;CACA,KAAK,KAAK;CACV,OAAO;AACT;;AAGA,SAAgB,gBAAgB,OAAgC,UAAuD;CACrH,MAAM,OAA+B,CAAC;CACtC,MAAM,QAAQ,MAA+B,UAAkB;EAC7D,KAAK,MAAM,QAAQ,MAAM;GACvB,MAAM,OAAO,SAAS,IAAI,KAAK,KAAK,EAAE;GACtC,KAAK,KAAK;IAAE,MAAM,KAAK;IAAM;IAAO,aAAa,KAAK,SAAS,SAAS;IAAG,UAAU;GAAK,CAAC;GAC3F,IAAI,MAAM,KAAK,KAAK,UAAU,QAAQ,CAAC;EACzC;CACF;CACA,KAAK,OAAO,CAAC;CACb,OAAO;AACT;;AAGA,SAAgB,gBAAgB,OAA+B,QAA0B;CACvF,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CACvD,MAAM,OAAiB,CAAC;CACxB,MAAM,uBAAO,IAAI,IAAY,CAAC,MAAM,CAAC;CACrC,IAAI,WAAW,KAAK,IAAI,MAAM,CAAC,EAAE,YAAY;CAC7C,OAAO,YAAY,KAAK,IAAI,QAAQ,KAAK,CAAC,KAAK,IAAI,QAAQ,GAAG;EAC5D,KAAK,IAAI,QAAQ;EACjB,KAAK,QAAQ,QAAQ;EACrB,WAAW,KAAK,IAAI,QAAQ,CAAC,EAAE,YAAY;CAC7C;CACA,OAAO;AACT;;AAGA,SAAgB,gBAAgB,MAAoC;CAClE,OAAO,KAAK,mBAAmB,GAAG,KAAK,cAAc,EAAE,KAAK,OAAO,KAAK,cAAc,CAAC;AACzF"}

package/dist/domains/knowledge/lib/pageTree.es.js

@@ -89,6 +89,10 @@ function pageAncestorIds(pages, pageId) {
 	}
 	return path;
 }
-export { buildPageTree, comparePagePosition, pageAncestorIds, visiblePageRows };
+/** A page's child count as shown: `1000+` when the server capped the count, so it never reads low. */
+function childCountLabel(page) {
+	return page.childCountCapped ? `${page.childCount ?? 0}+` : String(page.childCount ?? 0);
+}
+export { buildPageTree, childCountLabel, comparePagePosition, pageAncestorIds, visiblePageRows };
 
 //# sourceMappingURL=pageTree.es.js.map

package/dist/domains/knowledge/lib/pageTree.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"pageTree.es.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageTree.ts"],"sourcesContent":["/**\n * Pure page-tree logic for the schema-4 explorer: loaded pages → a sorted\n * tree, the visible rows for a set of expanded ids, and the ancestor path\n * that must open to reveal a selection. Free of React so it unit-tests alone.\n */\n\nimport type { KnowledgePagePayload } from '../pageTypes';\n\nexport interface KnowledgePageTreeNode {\n  page: KnowledgePagePayload;\n  children: KnowledgePageTreeNode[];\n}\n\nexport interface KnowledgePageTreeRow {\n  page: KnowledgePagePayload;\n  depth: number;\n  hasChildren: boolean;\n  expanded: boolean;\n}\n\n/** Sibling order: position by UTF-16 code unit (as the store defines it), then id. */\nexport function comparePagePosition(a: KnowledgePagePayload, b: KnowledgePagePayload): number {\n  if (a.position !== b.position) return a.position < b.position ? -1 : 1;\n  if (a.id === b.id) return 0;\n  return a.id < b.id ? -1 : 1;\n}\n\nfunction isLive(page: KnowledgePagePayload): boolean {\n  return !page.deletedAt && !page.mergedInto;\n}\n\n/**\n * Builds the tree from whatever pages are loaded. A page whose parent isn't\n * loaded (or is deleted/merged) becomes a root, and so does the first page (in\n * sibling order) of any parent cycle, so no loaded live page is ever lost.\n */\nexport function buildPageTree(pages: KnowledgePagePayload[]): KnowledgePageTreeNode[] {\n  const nodes = new Map<string, KnowledgePageTreeNode>();\n  for (const page of pages) {\n    if (isLive(page) && !nodes.has(page.id)) nodes.set(page.id, { page, children: [] });\n  }\n  const roots: KnowledgePageTreeNode[] = [];\n  const parentOf = new Map<KnowledgePageTreeNode, KnowledgePageTreeNode>();\n  for (const node of nodes.values()) {\n    const parent = node.page.parentId ? nodes.get(node.page.parentId) : undefined;\n    if (parent && parent !== node) {\n      parent.children.push(node);\n      parentOf.set(node, parent);\n    } else roots.push(node);\n  }\n  const reached = new Set<KnowledgePageTreeNode>();\n  const reach = (node: KnowledgePageTreeNode) => {\n    if (reached.has(node)) return;\n    reached.add(node);\n    for (const child of node.children) reach(child);\n  };\n  roots.forEach(reach);\n  // Whatever no root reaches sits in a parent cycle (or under one): cut each cycle at its first page.\n  const stranded = [...nodes.values()].filter(node => !reached.has(node));\n  stranded.sort((a, b) => comparePagePosition(a.page, b.page));\n  for (const node of stranded) {\n    if (reached.has(node)) continue;\n    // Climb to the cycle this page hangs from, then cut it at the cycle's first page.\n    const path: KnowledgePageTreeNode[] = [];\n    let at: KnowledgePageTreeNode | undefined = node;\n    while (at && !path.includes(at)) {\n      path.push(at);\n      at = parentOf.get(at);\n    }\n    const cycle = at ? path.slice(path.indexOf(at)) : [node];\n    const cut = cycle.reduce((first, member) => (comparePagePosition(member.page, first.page) < 0 ? member : first));\n    const parent = parentOf.get(cut);\n    if (parent) parent.children.splice(parent.children.indexOf(cut), 1);\n    roots.push(cut);\n    reach(cut);\n  }\n  const sort = (list: KnowledgePageTreeNode[]) => {\n    list.sort((a, b) => comparePagePosition(a.page, b.page));\n    for (const node of list) sort(node.children);\n  };\n  sort(roots);\n  return roots;\n}\n\n/** Depth-first rows for rendering, descending only into expanded pages. */\nexport function visiblePageRows(roots: KnowledgePageTreeNode[], expanded: ReadonlySet<string>): KnowledgePageTreeRow[] {\n  const rows: KnowledgePageTreeRow[] = [];\n  const walk = (list: KnowledgePageTreeNode[], depth: number) => {\n    for (const node of list) {\n      const open = expanded.has(node.page.id);\n      rows.push({ page: node.page, depth, hasChildren: node.children.length > 0, expanded: open });\n      if (open) walk(node.children, depth + 1);\n    }\n  };\n  walk(roots, 0);\n  return rows;\n}\n\n/** Ids from the root down to (not including) `pageId`; stops at unloaded parents and cycles. */\nexport function pageAncestorIds(pages: KnowledgePagePayload[], pageId: string): string[] {\n  const byId = new Map(pages.map(page => [page.id, page]));\n  const path: string[] = [];\n  const seen = new Set<string>([pageId]);\n  let parentId = byId.get(pageId)?.parentId ?? null;\n  while (parentId && byId.has(parentId) && !seen.has(parentId)) {\n    seen.add(parentId);\n    path.unshift(parentId);\n    parentId = byId.get(parentId)?.parentId ?? null;\n  }\n  return path;\n}\n"],"mappings":";;AAqBA,SAAgB,oBAAoB,GAAyB,GAAiC;CAC5F,IAAI,EAAE,aAAa,EAAE,UAAU,OAAO,EAAE,WAAW,EAAE,WAAW,KAAK;CACrE,IAAI,EAAE,OAAO,EAAE,IAAI,OAAO;CAC1B,OAAO,EAAE,KAAK,EAAE,KAAK,KAAK;AAC5B;AAEA,SAAS,OAAO,MAAqC;CACnD,OAAO,CAAC,KAAK,aAAa,CAAC,KAAK;AAClC;;;;;;AAOA,SAAgB,cAAc,OAAwD;CACpF,MAAM,wBAAQ,IAAI,IAAmC;CACrD,KAAK,MAAM,QAAQ,OACjB,IAAI,OAAO,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,EAAE,GAAG,MAAM,IAAI,KAAK,IAAI;EAAE;EAAM,UAAU,CAAC;CAAE,CAAC;CAEpF,MAAM,QAAiC,CAAC;CACxC,MAAM,2BAAW,IAAI,IAAkD;CACvE,KAAK,MAAM,QAAQ,MAAM,OAAO,GAAG;EACjC,MAAM,SAAS,KAAK,KAAK,WAAW,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAA;EACpE,IAAI,UAAU,WAAW,MAAM;GAC7B,OAAO,SAAS,KAAK,IAAI;GACzB,SAAS,IAAI,MAAM,MAAM;EAC3B,OAAO,MAAM,KAAK,IAAI;CACxB;CACA,MAAM,0BAAU,IAAI,IAA2B;CAC/C,MAAM,SAAS,SAAgC;EAC7C,IAAI,QAAQ,IAAI,IAAI,GAAG;EACvB,QAAQ,IAAI,IAAI;EAChB,KAAK,MAAM,SAAS,KAAK,UAAU,MAAM,KAAK;CAChD;CACA,MAAM,QAAQ,KAAK;CAEnB,MAAM,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC,CAAC,QAAO,SAAQ,CAAC,QAAQ,IAAI,IAAI,CAAC;CACtE,SAAS,MAAM,GAAG,MAAM,oBAAoB,EAAE,MAAM,EAAE,IAAI,CAAC;CAC3D,KAAK,MAAM,QAAQ,UAAU;EAC3B,IAAI,QAAQ,IAAI,IAAI,GAAG;EAEvB,MAAM,OAAgC,CAAC;EACvC,IAAI,KAAwC;EAC5C,OAAO,MAAM,CAAC,KAAK,SAAS,EAAE,GAAG;GAC/B,KAAK,KAAK,EAAE;GACZ,KAAK,SAAS,IAAI,EAAE;EACtB;EAEA,MAAM,OADQ,KAAK,KAAK,MAAM,KAAK,QAAQ,EAAE,CAAC,IAAI,CAAC,IAAI,EAAA,CACrC,QAAQ,OAAO,WAAY,oBAAoB,OAAO,MAAM,MAAM,IAAI,IAAI,IAAI,SAAS,KAAM;EAC/G,MAAM,SAAS,SAAS,IAAI,GAAG;EAC/B,IAAI,QAAQ,OAAO,SAAS,OAAO,OAAO,SAAS,QAAQ,GAAG,GAAG,CAAC;EAClE,MAAM,KAAK,GAAG;EACd,MAAM,GAAG;CACX;CACA,MAAM,QAAQ,SAAkC;EAC9C,KAAK,MAAM,GAAG,MAAM,oBAAoB,EAAE,MAAM,EAAE,IAAI,CAAC;EACvD,KAAK,MAAM,QAAQ,MAAM,KAAK,KAAK,QAAQ;CAC7C;CACA,KAAK,KAAK;CACV,OAAO;AACT;;AAGA,SAAgB,gBAAgB,OAAgC,UAAuD;CACrH,MAAM,OAA+B,CAAC;CACtC,MAAM,QAAQ,MAA+B,UAAkB;EAC7D,KAAK,MAAM,QAAQ,MAAM;GACvB,MAAM,OAAO,SAAS,IAAI,KAAK,KAAK,EAAE;GACtC,KAAK,KAAK;IAAE,MAAM,KAAK;IAAM;IAAO,aAAa,KAAK,SAAS,SAAS;IAAG,UAAU;GAAK,CAAC;GAC3F,IAAI,MAAM,KAAK,KAAK,UAAU,QAAQ,CAAC;EACzC;CACF;CACA,KAAK,OAAO,CAAC;CACb,OAAO;AACT;;AAGA,SAAgB,gBAAgB,OAA+B,QAA0B;CACvF,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CACvD,MAAM,OAAiB,CAAC;CACxB,MAAM,uBAAO,IAAI,IAAY,CAAC,MAAM,CAAC;CACrC,IAAI,WAAW,KAAK,IAAI,MAAM,CAAC,EAAE,YAAY;CAC7C,OAAO,YAAY,KAAK,IAAI,QAAQ,KAAK,CAAC,KAAK,IAAI,QAAQ,GAAG;EAC5D,KAAK,IAAI,QAAQ;EACjB,KAAK,QAAQ,QAAQ;EACrB,WAAW,KAAK,IAAI,QAAQ,CAAC,EAAE,YAAY;CAC7C;CACA,OAAO;AACT"}
+{"version":3,"file":"pageTree.es.js","names":[],"sources":["../../../../src/domains/knowledge/lib/pageTree.ts"],"sourcesContent":["/**\n * Pure page-tree logic for the schema-4 explorer: loaded pages → a sorted\n * tree, the visible rows for a set of expanded ids, and the ancestor path\n * that must open to reveal a selection. Free of React so it unit-tests alone.\n */\n\nimport type { KnowledgePagePayload } from '../pageTypes';\n\nexport interface KnowledgePageTreeNode {\n  page: KnowledgePagePayload;\n  children: KnowledgePageTreeNode[];\n}\n\nexport interface KnowledgePageTreeRow {\n  page: KnowledgePagePayload;\n  depth: number;\n  hasChildren: boolean;\n  expanded: boolean;\n}\n\n/** Sibling order: position by UTF-16 code unit (as the store defines it), then id. */\nexport function comparePagePosition(a: KnowledgePagePayload, b: KnowledgePagePayload): number {\n  if (a.position !== b.position) return a.position < b.position ? -1 : 1;\n  if (a.id === b.id) return 0;\n  return a.id < b.id ? -1 : 1;\n}\n\nfunction isLive(page: KnowledgePagePayload): boolean {\n  return !page.deletedAt && !page.mergedInto;\n}\n\n/**\n * Builds the tree from whatever pages are loaded. A page whose parent isn't\n * loaded (or is deleted/merged) becomes a root, and so does the first page (in\n * sibling order) of any parent cycle, so no loaded live page is ever lost.\n */\nexport function buildPageTree(pages: KnowledgePagePayload[]): KnowledgePageTreeNode[] {\n  const nodes = new Map<string, KnowledgePageTreeNode>();\n  for (const page of pages) {\n    if (isLive(page) && !nodes.has(page.id)) nodes.set(page.id, { page, children: [] });\n  }\n  const roots: KnowledgePageTreeNode[] = [];\n  const parentOf = new Map<KnowledgePageTreeNode, KnowledgePageTreeNode>();\n  for (const node of nodes.values()) {\n    const parent = node.page.parentId ? nodes.get(node.page.parentId) : undefined;\n    if (parent && parent !== node) {\n      parent.children.push(node);\n      parentOf.set(node, parent);\n    } else roots.push(node);\n  }\n  const reached = new Set<KnowledgePageTreeNode>();\n  const reach = (node: KnowledgePageTreeNode) => {\n    if (reached.has(node)) return;\n    reached.add(node);\n    for (const child of node.children) reach(child);\n  };\n  roots.forEach(reach);\n  // Whatever no root reaches sits in a parent cycle (or under one): cut each cycle at its first page.\n  const stranded = [...nodes.values()].filter(node => !reached.has(node));\n  stranded.sort((a, b) => comparePagePosition(a.page, b.page));\n  for (const node of stranded) {\n    if (reached.has(node)) continue;\n    // Climb to the cycle this page hangs from, then cut it at the cycle's first page.\n    const path: KnowledgePageTreeNode[] = [];\n    let at: KnowledgePageTreeNode | undefined = node;\n    while (at && !path.includes(at)) {\n      path.push(at);\n      at = parentOf.get(at);\n    }\n    const cycle = at ? path.slice(path.indexOf(at)) : [node];\n    const cut = cycle.reduce((first, member) => (comparePagePosition(member.page, first.page) < 0 ? member : first));\n    const parent = parentOf.get(cut);\n    if (parent) parent.children.splice(parent.children.indexOf(cut), 1);\n    roots.push(cut);\n    reach(cut);\n  }\n  const sort = (list: KnowledgePageTreeNode[]) => {\n    list.sort((a, b) => comparePagePosition(a.page, b.page));\n    for (const node of list) sort(node.children);\n  };\n  sort(roots);\n  return roots;\n}\n\n/** Depth-first rows for rendering, descending only into expanded pages. */\nexport function visiblePageRows(roots: KnowledgePageTreeNode[], expanded: ReadonlySet<string>): KnowledgePageTreeRow[] {\n  const rows: KnowledgePageTreeRow[] = [];\n  const walk = (list: KnowledgePageTreeNode[], depth: number) => {\n    for (const node of list) {\n      const open = expanded.has(node.page.id);\n      rows.push({ page: node.page, depth, hasChildren: node.children.length > 0, expanded: open });\n      if (open) walk(node.children, depth + 1);\n    }\n  };\n  walk(roots, 0);\n  return rows;\n}\n\n/** Ids from the root down to (not including) `pageId`; stops at unloaded parents and cycles. */\nexport function pageAncestorIds(pages: KnowledgePagePayload[], pageId: string): string[] {\n  const byId = new Map(pages.map(page => [page.id, page]));\n  const path: string[] = [];\n  const seen = new Set<string>([pageId]);\n  let parentId = byId.get(pageId)?.parentId ?? null;\n  while (parentId && byId.has(parentId) && !seen.has(parentId)) {\n    seen.add(parentId);\n    path.unshift(parentId);\n    parentId = byId.get(parentId)?.parentId ?? null;\n  }\n  return path;\n}\n\n/** A page's child count as shown: `1000+` when the server capped the count, so it never reads low. */\nexport function childCountLabel(page: KnowledgePagePayload): string {\n  return page.childCountCapped ? `${page.childCount ?? 0}+` : String(page.childCount ?? 0);\n}\n"],"mappings":";;AAqBA,SAAgB,oBAAoB,GAAyB,GAAiC;CAC5F,IAAI,EAAE,aAAa,EAAE,UAAU,OAAO,EAAE,WAAW,EAAE,WAAW,KAAK;CACrE,IAAI,EAAE,OAAO,EAAE,IAAI,OAAO;CAC1B,OAAO,EAAE,KAAK,EAAE,KAAK,KAAK;AAC5B;AAEA,SAAS,OAAO,MAAqC;CACnD,OAAO,CAAC,KAAK,aAAa,CAAC,KAAK;AAClC;;;;;;AAOA,SAAgB,cAAc,OAAwD;CACpF,MAAM,wBAAQ,IAAI,IAAmC;CACrD,KAAK,MAAM,QAAQ,OACjB,IAAI,OAAO,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,EAAE,GAAG,MAAM,IAAI,KAAK,IAAI;EAAE;EAAM,UAAU,CAAC;CAAE,CAAC;CAEpF,MAAM,QAAiC,CAAC;CACxC,MAAM,2BAAW,IAAI,IAAkD;CACvE,KAAK,MAAM,QAAQ,MAAM,OAAO,GAAG;EACjC,MAAM,SAAS,KAAK,KAAK,WAAW,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAA;EACpE,IAAI,UAAU,WAAW,MAAM;GAC7B,OAAO,SAAS,KAAK,IAAI;GACzB,SAAS,IAAI,MAAM,MAAM;EAC3B,OAAO,MAAM,KAAK,IAAI;CACxB;CACA,MAAM,0BAAU,IAAI,IAA2B;CAC/C,MAAM,SAAS,SAAgC;EAC7C,IAAI,QAAQ,IAAI,IAAI,GAAG;EACvB,QAAQ,IAAI,IAAI;EAChB,KAAK,MAAM,SAAS,KAAK,UAAU,MAAM,KAAK;CAChD;CACA,MAAM,QAAQ,KAAK;CAEnB,MAAM,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC,CAAC,QAAO,SAAQ,CAAC,QAAQ,IAAI,IAAI,CAAC;CACtE,SAAS,MAAM,GAAG,MAAM,oBAAoB,EAAE,MAAM,EAAE,IAAI,CAAC;CAC3D,KAAK,MAAM,QAAQ,UAAU;EAC3B,IAAI,QAAQ,IAAI,IAAI,GAAG;EAEvB,MAAM,OAAgC,CAAC;EACvC,IAAI,KAAwC;EAC5C,OAAO,MAAM,CAAC,KAAK,SAAS,EAAE,GAAG;GAC/B,KAAK,KAAK,EAAE;GACZ,KAAK,SAAS,IAAI,EAAE;EACtB;EAEA,MAAM,OADQ,KAAK,KAAK,MAAM,KAAK,QAAQ,EAAE,CAAC,IAAI,CAAC,IAAI,EAAA,CACrC,QAAQ,OAAO,WAAY,oBAAoB,OAAO,MAAM,MAAM,IAAI,IAAI,IAAI,SAAS,KAAM;EAC/G,MAAM,SAAS,SAAS,IAAI,GAAG;EAC/B,IAAI,QAAQ,OAAO,SAAS,OAAO,OAAO,SAAS,QAAQ,GAAG,GAAG,CAAC;EAClE,MAAM,KAAK,GAAG;EACd,MAAM,GAAG;CACX;CACA,MAAM,QAAQ,SAAkC;EAC9C,KAAK,MAAM,GAAG,MAAM,oBAAoB,EAAE,MAAM,EAAE,IAAI,CAAC;EACvD,KAAK,MAAM,QAAQ,MAAM,KAAK,KAAK,QAAQ;CAC7C;CACA,KAAK,KAAK;CACV,OAAO;AACT;;AAGA,SAAgB,gBAAgB,OAAgC,UAAuD;CACrH,MAAM,OAA+B,CAAC;CACtC,MAAM,QAAQ,MAA+B,UAAkB;EAC7D,KAAK,MAAM,QAAQ,MAAM;GACvB,MAAM,OAAO,SAAS,IAAI,KAAK,KAAK,EAAE;GACtC,KAAK,KAAK;IAAE,MAAM,KAAK;IAAM;IAAO,aAAa,KAAK,SAAS,SAAS;IAAG,UAAU;GAAK,CAAC;GAC3F,IAAI,MAAM,KAAK,KAAK,UAAU,QAAQ,CAAC;EACzC;CACF;CACA,KAAK,OAAO,CAAC;CACb,OAAO;AACT;;AAGA,SAAgB,gBAAgB,OAA+B,QAA0B;CACvF,MAAM,OAAO,IAAI,IAAI,MAAM,KAAI,SAAQ,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;CACvD,MAAM,OAAiB,CAAC;CACxB,MAAM,uBAAO,IAAI,IAAY,CAAC,MAAM,CAAC;CACrC,IAAI,WAAW,KAAK,IAAI,MAAM,CAAC,EAAE,YAAY;CAC7C,OAAO,YAAY,KAAK,IAAI,QAAQ,KAAK,CAAC,KAAK,IAAI,QAAQ,GAAG;EAC5D,KAAK,IAAI,QAAQ;EACjB,KAAK,QAAQ,QAAQ;EACrB,WAAW,KAAK,IAAI,QAAQ,CAAC,EAAE,YAAY;CAC7C;CACA,OAAO;AACT;;AAGA,SAAgB,gBAAgB,MAAoC;CAClE,OAAO,KAAK,mBAAmB,GAAG,KAAK,cAAc,EAAE,KAAK,OAAO,KAAK,cAAc,CAAC;AACzF"}

package/dist/domains/knowledge/lib/remarkKnowledgeLinks.cjs.js

@@ -0,0 +1,82 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+// src/domains/knowledge/lib/remarkKnowledgeLinks.ts
+var WIKILINK = /\[\[([^\]]+)\]\]/g;
+/** `[[ref]]`, or a bare `type:value#path` address such as `docs:mastra#guides/memory` (never a URL or an email). */
+var WIKILINK_OR_ADDRESS = /\[\[([^\]]+)\]\]|(?<![\w:/#@.-])([a-z][\w-]*:[\w.-]+#[\w./-]*[\w/])/g;
+/** The hast property a `[[ref]]` carries on its `<span>`; react-markdown hands it to the `span` override. */
+var KNOWLEDGE_REF_PROPERTY = "dataKnowledgeRef";
+/** Set to `'bare'` on a ref written without `[[ ]]`: it only looks like an address, so a host links it once the page resolves. */
+var KNOWLEDGE_BARE_PROPERTY = "dataKnowledgeBare";
+/**
+* A remark plugin that turns each `[[ref]]` in markdown prose into `<span data-knowledge-ref="ref">ref</span>`,
+* for a `span` override to draw as a page link. It only splits text nodes, so code, inline code and
+* existing links are left alone, and the ref stays text: nothing in a body becomes markup.
+*/
+function remarkKnowledgeLinks() {
+	return (tree) => {
+		visit(tree, WIKILINK);
+	};
+}
+/** `remarkKnowledgeLinks` for chat prose, where a model also writes a page's address bare. */
+function remarkKnowledgeChatLinks() {
+	return (tree) => {
+		visit(tree, WIKILINK_OR_ADDRESS);
+	};
+}
+function visit(node, pattern) {
+	if (node.type === "link" || node.type === "linkReference") return;
+	const children = [];
+	let changed = false;
+	for (const child of node.children) {
+		if (child.type === "text") {
+			const split = splitText(child, pattern);
+			if (split) {
+				children.push(...split);
+				changed = true;
+				continue;
+			}
+		} else if ("children" in child) visit(child, pattern);
+		children.push(child);
+	}
+	if (changed) node.children = children;
+}
+function splitText(node, pattern) {
+	const { value } = node;
+	const parts = [];
+	let last = 0;
+	for (const match of value.matchAll(pattern)) {
+		const ref = match[1] ?? match[2] ?? "";
+		const bare = match[1] === void 0;
+		if (match.index > last) parts.push({
+			type: "text",
+			value: value.slice(last, match.index)
+		});
+		parts.push({
+			type: "emphasis",
+			data: {
+				hName: "span",
+				hProperties: {
+					[KNOWLEDGE_REF_PROPERTY]: ref,
+					...bare ? { [KNOWLEDGE_BARE_PROPERTY]: "bare" } : {}
+				}
+			},
+			children: [{
+				type: "text",
+				value: ref
+			}]
+		});
+		last = match.index + match[0].length;
+	}
+	if (last === 0) return null;
+	if (last < value.length) parts.push({
+		type: "text",
+		value: value.slice(last)
+	});
+	return parts;
+}
+exports.KNOWLEDGE_BARE_PROPERTY = KNOWLEDGE_BARE_PROPERTY;
+exports.KNOWLEDGE_REF_PROPERTY = KNOWLEDGE_REF_PROPERTY;
+exports.remarkKnowledgeChatLinks = remarkKnowledgeChatLinks;
+exports.remarkKnowledgeLinks = remarkKnowledgeLinks;
+
+//# sourceMappingURL=remarkKnowledgeLinks.cjs.js.map

package/dist/domains/knowledge/lib/remarkKnowledgeLinks.cjs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"remarkKnowledgeLinks.cjs.js","names":[],"sources":["../../../../src/domains/knowledge/lib/remarkKnowledgeLinks.ts"],"sourcesContent":["import type { Parent, PhrasingContent, Root, Text } from 'mdast';\n\nconst WIKILINK = /\\[\\[([^\\]]+)\\]\\]/g;\n/** `[[ref]]`, or a bare `type:value#path` address such as `docs:mastra#guides/memory` (never a URL or an email). */\nconst WIKILINK_OR_ADDRESS = /\\[\\[([^\\]]+)\\]\\]|(?<![\\w:/#@.-])([a-z][\\w-]*:[\\w.-]+#[\\w./-]*[\\w/])/g;\n\n/** The hast property a `[[ref]]` carries on its `<span>`; react-markdown hands it to the `span` override. */\nexport const KNOWLEDGE_REF_PROPERTY = 'dataKnowledgeRef';\n/** Set to `'bare'` on a ref written without `[[ ]]`: it only looks like an address, so a host links it once the page resolves. */\nexport const KNOWLEDGE_BARE_PROPERTY = 'dataKnowledgeBare';\n\n/**\n * A remark plugin that turns each `[[ref]]` in markdown prose into `<span data-knowledge-ref=\"ref\">ref</span>`,\n * for a `span` override to draw as a page link. It only splits text nodes, so code, inline code and\n * existing links are left alone, and the ref stays text: nothing in a body becomes markup.\n */\nexport function remarkKnowledgeLinks() {\n  return (tree: Root) => {\n    visit(tree, WIKILINK);\n  };\n}\n\n/** `remarkKnowledgeLinks` for chat prose, where a model also writes a page's address bare. */\nexport function remarkKnowledgeChatLinks() {\n  return (tree: Root) => {\n    visit(tree, WIKILINK_OR_ADDRESS);\n  };\n}\n\nfunction visit(node: Parent, pattern: RegExp) {\n  if (node.type === 'link' || node.type === 'linkReference') return;\n  const children: Parent['children'] = [];\n  let changed = false;\n  for (const child of node.children) {\n    if (child.type === 'text') {\n      const split = splitText(child, pattern);\n      if (split) {\n        children.push(...split);\n        changed = true;\n        continue;\n      }\n    } else if ('children' in child) {\n      visit(child, pattern);\n    }\n    children.push(child);\n  }\n  if (changed) node.children = children;\n}\n\nfunction splitText(node: Text, pattern: RegExp): PhrasingContent[] | null {\n  const { value } = node;\n  const parts: PhrasingContent[] = [];\n  let last = 0;\n  for (const match of value.matchAll(pattern)) {\n    const ref = match[1] ?? match[2] ?? '';\n    const bare = match[1] === undefined;\n    if (match.index > last) parts.push({ type: 'text', value: value.slice(last, match.index) });\n    parts.push({\n      type: 'emphasis',\n      data: {\n        hName: 'span',\n        hProperties: { [KNOWLEDGE_REF_PROPERTY]: ref, ...(bare ? { [KNOWLEDGE_BARE_PROPERTY]: 'bare' } : {}) },\n      },\n      children: [{ type: 'text', value: ref }],\n    });\n    last = match.index + match[0].length;\n  }\n  if (last === 0) return null;\n  if (last < value.length) parts.push({ type: 'text', value: value.slice(last) });\n  return parts;\n}\n"],"mappings":";;AAEA,IAAM,WAAW;;AAEjB,IAAM,sBAAsB;;AAG5B,IAAa,yBAAyB;;AAEtC,IAAa,0BAA0B;;;;;;AAOvC,SAAgB,uBAAuB;CACrC,QAAQ,SAAe;EACrB,MAAM,MAAM,QAAQ;CACtB;AACF;;AAGA,SAAgB,2BAA2B;CACzC,QAAQ,SAAe;EACrB,MAAM,MAAM,mBAAmB;CACjC;AACF;AAEA,SAAS,MAAM,MAAc,SAAiB;CAC5C,IAAI,KAAK,SAAS,UAAU,KAAK,SAAS,iBAAiB;CAC3D,MAAM,WAA+B,CAAC;CACtC,IAAI,UAAU;CACd,KAAK,MAAM,SAAS,KAAK,UAAU;EACjC,IAAI,MAAM,SAAS,QAAQ;GACzB,MAAM,QAAQ,UAAU,OAAO,OAAO;GACtC,IAAI,OAAO;IACT,SAAS,KAAK,GAAG,KAAK;IACtB,UAAU;IACV;GACF;EACF,OAAO,IAAI,cAAc,OACvB,MAAM,OAAO,OAAO;EAEtB,SAAS,KAAK,KAAK;CACrB;CACA,IAAI,SAAS,KAAK,WAAW;AAC/B;AAEA,SAAS,UAAU,MAAY,SAA2C;CACxE,MAAM,EAAE,UAAU;CAClB,MAAM,QAA2B,CAAC;CAClC,IAAI,OAAO;CACX,KAAK,MAAM,SAAS,MAAM,SAAS,OAAO,GAAG;EAC3C,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM;EACpC,MAAM,OAAO,MAAM,OAAO,KAAA;EAC1B,IAAI,MAAM,QAAQ,MAAM,MAAM,KAAK;GAAE,MAAM;GAAQ,OAAO,MAAM,MAAM,MAAM,MAAM,KAAK;EAAE,CAAC;EAC1F,MAAM,KAAK;GACT,MAAM;GACN,MAAM;IACJ,OAAO;IACP,aAAa;MAAG,yBAAyB;KAAK,GAAI,OAAO,GAAG,0BAA0B,OAAO,IAAI,CAAC;IAAG;GACvG;GACA,UAAU,CAAC;IAAE,MAAM;IAAQ,OAAO;GAAI,CAAC;EACzC,CAAC;EACD,OAAO,MAAM,QAAQ,MAAM,EAAE,CAAC;CAChC;CACA,IAAI,SAAS,GAAG,OAAO;CACvB,IAAI,OAAO,MAAM,QAAQ,MAAM,KAAK;EAAE,MAAM;EAAQ,OAAO,MAAM,MAAM,IAAI;CAAE,CAAC;CAC9E,OAAO;AACT"}

package/dist/domains/knowledge/lib/remarkKnowledgeLinks.d.ts

@@ -0,0 +1 @@
+export * from '../../../src/domains/knowledge/lib/remarkKnowledgeLinks';