@mastra/playground-ui 67.0.0 → 68.0.0-alpha.1

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

@@ -0,0 +1,93 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+let d3_force = require("d3-force");
+// src/domains/knowledge/lib/layout.ts
+/**
+* Synchronous d3-force layout for the knowledge graph. The simulation is run
+* to a fixed tick count with deterministic initial positions (a phyllotaxis
+* spiral over the SORTED node ids), so the same input always yields the same
+* settled layout — that is what makes the layout unit-testable.
+*/
+var DEFAULT_PADDING = 28;
+var DEFAULT_TICKS = 300;
+function runLayout(nodes, edges, options = {}) {
+	const ticks = options.ticks ?? DEFAULT_TICKS;
+	const simNodes = [...nodes].sort((a, b) => a.id.localeCompare(b.id)).map((node, index) => {
+		const radius = 18 * Math.sqrt(.5 + index);
+		const angle = index * 2.399963229728653;
+		const seeded = node.initial ?? {
+			x: radius * Math.cos(angle),
+			y: radius * Math.sin(angle)
+		};
+		return {
+			id: node.id,
+			size: node.size,
+			padding: node.padding ?? DEFAULT_PADDING,
+			x: node.fixed?.x ?? seeded.x,
+			y: node.fixed?.y ?? seeded.y,
+			fx: node.fixed?.x ?? null,
+			fy: node.fixed?.y ?? null
+		};
+	});
+	const ids = new Set(simNodes.map((node) => node.id));
+	const hugs = new Set(edges.filter((edge) => edge.hug).map((edge) => `${edge.source}\u0000${edge.target}`));
+	const simEdges = edges.filter((edge) => ids.has(edge.source) && ids.has(edge.target)).map((edge) => ({
+		source: edge.source,
+		target: edge.target
+	}));
+	(0, d3_force.forceSimulation)(simNodes).force("link", (0, d3_force.forceLink)(simEdges).id((node) => node.id).distance((link) => {
+		const source = link.source;
+		const target = link.target;
+		return (hugs.has(`${source.id}\u0000${target.id}`) ? 8 : 40) + (source.size + target.size) / 2;
+	})).force("charge", (0, d3_force.forceManyBody)().strength((node) => node.size <= 24 ? -60 : -700)).force("collide", (0, d3_force.forceCollide)().radius((node) => node.size / 2 + node.padding).strength(1).iterations(3)).force("center", (0, d3_force.forceCenter)(0, 0)).force("x", (0, d3_force.forceX)(0).strength(.06)).force("y", (0, d3_force.forceY)(0).strength(.08)).stop().tick(ticks);
+	resolveOverlaps(simNodes);
+	const positions = /* @__PURE__ */ new Map();
+	for (const node of simNodes) positions.set(node.id, {
+		x: node.x ?? 0,
+		y: node.y ?? 0
+	});
+	return positions;
+}
+/**
+* Hard guarantee that no two nodes overlap: the force simulation can leave
+* residual overlaps once alpha decays, so after settling we sweep node pairs
+* and push them apart deterministically until every pair clears its combined
+* radius plus padding. Fixed (user-dragged) nodes never move.
+*/
+function resolveOverlaps(nodes) {
+	const order = [...nodes].sort((a, b) => b.size - a.size);
+	for (let sweep = 0; sweep < 600; sweep++) {
+		let moved = false;
+		for (let i = 0; i < order.length; i++) for (let j = i + 1; j < order.length; j++) {
+			const a = order[i];
+			const b = order[j];
+			if (!a || !b) continue;
+			const minDistance = a.size / 2 + b.size / 2 + Math.min(a.padding, b.padding);
+			let dx = (b.x ?? 0) - (a.x ?? 0);
+			let dy = (b.y ?? 0) - (a.y ?? 0);
+			let distance = Math.hypot(dx, dy);
+			if (distance >= minDistance) continue;
+			if (distance === 0) {
+				dx = 1;
+				dy = 0;
+				distance = 1;
+			}
+			const overlap = minDistance - distance + .5;
+			const ux = dx / distance;
+			const uy = dy / distance;
+			const aFixed = a.fx != null;
+			const bFixed = b.fx != null;
+			if (aFixed && bFixed) continue;
+			const aShare = aFixed ? 0 : bFixed ? 1 : .5;
+			const bShare = 1 - aShare;
+			a.x = (a.x ?? 0) - ux * overlap * aShare;
+			a.y = (a.y ?? 0) - uy * overlap * aShare;
+			b.x = (b.x ?? 0) + ux * overlap * bShare;
+			b.y = (b.y ?? 0) + uy * overlap * bShare;
+			moved = true;
+		}
+		if (!moved) break;
+	}
+}
+exports.runLayout = runLayout;
+
+//# sourceMappingURL=layout.cjs.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"layout.cjs.js","names":["forceSimulation","forceLink","forceManyBody","forceCollide","forceCenter","forceX","forceY"],"sources":["../../../../src/domains/knowledge/lib/layout.ts"],"sourcesContent":["/**\n * Synchronous d3-force layout for the knowledge graph. The simulation is run\n * to a fixed tick count with deterministic initial positions (a phyllotaxis\n * spiral over the SORTED node ids), so the same input always yields the same\n * settled layout — that is what makes the layout unit-testable.\n */\n\nimport { forceCenter, forceCollide, forceLink, forceManyBody, forceSimulation, forceX, forceY } from 'd3-force';\nimport type { SimulationLinkDatum, SimulationNodeDatum } from 'd3-force';\n\nexport interface LayoutNodeInput {\n  id: string;\n  /** Node diameter in px (drives collision radius and link distance). */\n  size: number;\n  /** Pinned position from a user drag — the simulation must not move it. */\n  fixed?: { x: number; y: number };\n  /** Warm-start position (e.g. spawn a new node near its first neighbor). */\n  initial?: { x: number; y: number };\n  /** Collision breathing room around the node (default 28; tiny record dots use less). */\n  padding?: number;\n}\n\nexport interface LayoutEdgeInput {\n  source: string;\n  target: string;\n  /** A11: hug links (record dot stubs / junction spokes) stay short so record markers cluster tight. */\n  hug?: boolean;\n}\n\nconst DEFAULT_PADDING = 28;\n\ninterface SimNode extends SimulationNodeDatum {\n  id: string;\n  size: number;\n  padding: number;\n}\n\ntype SimLink = SimulationLinkDatum<SimNode>;\n\nconst DEFAULT_TICKS = 300;\n\nexport function runLayout(\n  nodes: LayoutNodeInput[],\n  edges: LayoutEdgeInput[],\n  options: { ticks?: number } = {},\n): Map<string, { x: number; y: number }> {\n  const ticks = options.ticks ?? DEFAULT_TICKS;\n  const order = [...nodes].sort((a, b) => a.id.localeCompare(b.id));\n  const simNodes: SimNode[] = order.map((node, index) => {\n    // Deterministic phyllotaxis seed (same shape d3 uses internally, but keyed\n    // to the sorted index so insertion order never changes the layout).\n    const radius = 18 * Math.sqrt(0.5 + index);\n    const angle = index * 2.399963229728653;\n    const seeded = node.initial ?? { x: radius * Math.cos(angle), y: radius * Math.sin(angle) };\n    return {\n      id: node.id,\n      size: node.size,\n      padding: node.padding ?? DEFAULT_PADDING,\n      x: node.fixed?.x ?? seeded.x,\n      y: node.fixed?.y ?? seeded.y,\n      fx: node.fixed?.x ?? null,\n      fy: node.fixed?.y ?? null,\n    };\n  });\n  const ids = new Set(simNodes.map(node => node.id));\n  const hugs = new Set(edges.filter(edge => edge.hug).map(edge => `${edge.source}\\u0000${edge.target}`));\n  const simEdges: SimLink[] = edges\n    .filter(edge => ids.has(edge.source) && ids.has(edge.target))\n    .map(edge => ({ source: edge.source, target: edge.target }));\n\n  const simulation = forceSimulation(simNodes)\n    .force(\n      'link',\n      forceLink<SimNode, SimLink>(simEdges)\n        .id(node => node.id)\n        .distance(link => {\n          const source = link.source as SimNode;\n          const target = link.target as SimNode;\n          // Hug links (record stubs/spokes) keep markers tight to their cluster.\n          const hug = hugs.has(`${source.id}\\u0000${target.id}`);\n          return (hug ? 8 : 40) + (source.size + target.size) / 2;\n        }),\n    )\n    // Tiny record markers repel gently; knowledge nodes keep the strong spread.\n    .force(\n      'charge',\n      forceManyBody<SimNode>().strength(node => (node.size <= 24 ? -60 : -700)),\n    )\n    .force(\n      'collide',\n      forceCollide<SimNode>()\n        .radius(node => node.size / 2 + node.padding)\n        .strength(1)\n        .iterations(3),\n    )\n    .force('center', forceCenter(0, 0))\n    // Weak gravity keeps disconnected satellites in frame instead of flinging\n    // them to the edges of the canvas.\n    .force('x', forceX(0).strength(0.06))\n    .force('y', forceY(0).strength(0.08))\n    .stop();\n\n  simulation.tick(ticks);\n  resolveOverlaps(simNodes);\n\n  const positions = new Map<string, { x: number; y: number }>();\n  for (const node of simNodes) {\n    // No rounding: a 1px round-off can re-introduce a just-resolved overlap.\n    positions.set(node.id, { x: node.x ?? 0, y: node.y ?? 0 });\n  }\n  return positions;\n}\n\n/**\n * Hard guarantee that no two nodes overlap: the force simulation can leave\n * residual overlaps once alpha decays, so after settling we sweep node pairs\n * and push them apart deterministically until every pair clears its combined\n * radius plus padding. Fixed (user-dragged) nodes never move.\n */\nfunction resolveOverlaps(nodes: SimNode[]): void {\n  // Sorted big-first: settling the large nodes before the dots converges much\n  // faster and avoids ping-pong between hub pairs.\n  const order = [...nodes].sort((a, b) => b.size - a.size);\n  for (let sweep = 0; sweep < 600; sweep++) {\n    let moved = false;\n    for (let i = 0; i < order.length; i++) {\n      for (let j = i + 1; j < order.length; j++) {\n        const a = order[i];\n        const b = order[j];\n        if (!a || !b) continue;\n        // Pair breathing room = the smaller of the two paddings, so tiny\n        // record markers can nestle close without knowledge nodes colliding.\n        const minDistance = a.size / 2 + b.size / 2 + Math.min(a.padding, b.padding);\n        let dx = (b.x ?? 0) - (a.x ?? 0);\n        let dy = (b.y ?? 0) - (a.y ?? 0);\n        let distance = Math.hypot(dx, dy);\n        if (distance >= minDistance) continue;\n        if (distance === 0) {\n          // Perfectly stacked: separate along a deterministic axis.\n          dx = 1;\n          dy = 0;\n          distance = 1;\n        }\n        // Over-separate slightly so float noise can't re-trigger the pair.\n        const overlap = minDistance - distance + 0.5;\n        const ux = dx / distance;\n        const uy = dy / distance;\n        const aFixed = a.fx != null;\n        const bFixed = b.fx != null;\n        if (aFixed && bFixed) continue;\n        const aShare = aFixed ? 0 : bFixed ? 1 : 0.5;\n        const bShare = 1 - aShare;\n        a.x = (a.x ?? 0) - ux * overlap * aShare;\n        a.y = (a.y ?? 0) - uy * overlap * aShare;\n        b.x = (b.x ?? 0) + ux * overlap * bShare;\n        b.y = (b.y ?? 0) + uy * overlap * bShare;\n        moved = true;\n      }\n    }\n    if (!moved) break;\n  }\n}\n"],"mappings":";;;;;;;;;AA6BA,IAAM,kBAAkB;AAUxB,IAAM,gBAAgB;AAEtB,SAAgB,UACd,OACA,OACA,UAA8B,CAAC,GACQ;CACvC,MAAM,QAAQ,QAAQ,SAAS;CAE/B,MAAM,WADQ,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,EAAE,CACnC,CAAA,CAAM,KAAK,MAAM,UAAU;EAGrD,MAAM,SAAS,KAAK,KAAK,KAAK,KAAM,KAAK;EACzC,MAAM,QAAQ,QAAQ;EACtB,MAAM,SAAS,KAAK,WAAW;GAAE,GAAG,SAAS,KAAK,IAAI,KAAK;GAAG,GAAG,SAAS,KAAK,IAAI,KAAK;EAAE;EAC1F,OAAO;GACL,IAAI,KAAK;GACT,MAAM,KAAK;GACX,SAAS,KAAK,WAAW;GACzB,GAAG,KAAK,OAAO,KAAK,OAAO;GAC3B,GAAG,KAAK,OAAO,KAAK,OAAO;GAC3B,IAAI,KAAK,OAAO,KAAK;GACrB,IAAI,KAAK,OAAO,KAAK;EACvB;CACF,CAAC;CACD,MAAM,MAAM,IAAI,IAAI,SAAS,KAAI,SAAQ,KAAK,EAAE,CAAC;CACjD,MAAM,OAAO,IAAI,IAAI,MAAM,QAAO,SAAQ,KAAK,GAAG,CAAC,CAAC,KAAI,SAAQ,GAAG,KAAK,OAAO,QAAQ,KAAK,QAAQ,CAAC;CACrG,MAAM,WAAsB,MACzB,QAAO,SAAQ,IAAI,IAAI,KAAK,MAAM,KAAK,IAAI,IAAI,KAAK,MAAM,CAAC,CAAC,CAC5D,KAAI,UAAS;EAAE,QAAQ,KAAK;EAAQ,QAAQ,KAAK;CAAO,EAAE;CAkC7D,CAAA,GAhCmBA,SAAAA,gBAAAA,CAAgB,QAAQ,CAAC,CACzC,MACC,SAAA,GACAC,SAAAA,UAAAA,CAA4B,QAAQ,CAAC,CAClC,IAAG,SAAQ,KAAK,EAAE,CAAC,CACnB,UAAS,SAAQ;EAChB,MAAM,SAAS,KAAK;EACpB,MAAM,SAAS,KAAK;EAGpB,QADY,KAAK,IAAI,GAAG,OAAO,GAAG,QAAQ,OAAO,IACzC,IAAM,IAAI,OAAO,OAAO,OAAO,OAAO,QAAQ;CACxD,CAAC,CACL,CAAC,CAEA,MACC,WAAA,GACAC,SAAAA,cAAAA,CAAuB,CAAC,CAAC,UAAS,SAAS,KAAK,QAAQ,KAAK,MAAM,IAAK,CAC1E,CAAC,CACA,MACC,YAAA,GACAC,SAAAA,aAAAA,CAAsB,CAAC,CACpB,QAAO,SAAQ,KAAK,OAAO,IAAI,KAAK,OAAO,CAAC,CAC5C,SAAS,CAAC,CAAC,CACX,WAAW,CAAC,CACjB,CAAC,CACA,MAAM,WAAA,GAAUC,SAAAA,YAAAA,CAAY,GAAG,CAAC,CAAC,CAAC,CAGlC,MAAM,MAAA,GAAKC,SAAAA,OAAAA,CAAO,CAAC,CAAC,CAAC,SAAS,GAAI,CAAC,CAAC,CACpC,MAAM,MAAA,GAAKC,SAAAA,OAAAA,CAAO,CAAC,CAAC,CAAC,SAAS,GAAI,CAAC,CAAC,CACpC,KAEH,CAAA,CAAW,KAAK,KAAK;CACrB,gBAAgB,QAAQ;CAExB,MAAM,4BAAY,IAAI,IAAsC;CAC5D,KAAK,MAAM,QAAQ,UAEjB,UAAU,IAAI,KAAK,IAAI;EAAE,GAAG,KAAK,KAAK;EAAG,GAAG,KAAK,KAAK;CAAE,CAAC;CAE3D,OAAO;AACT;;;;;;;AAQA,SAAS,gBAAgB,OAAwB;CAG/C,MAAM,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;CACvD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS;EACxC,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACzC,MAAM,IAAI,MAAM;GAChB,MAAM,IAAI,MAAM;GAChB,IAAI,CAAC,KAAK,CAAC,GAAG;GAGd,MAAM,cAAc,EAAE,OAAO,IAAI,EAAE,OAAO,IAAI,KAAK,IAAI,EAAE,SAAS,EAAE,OAAO;GAC3E,IAAI,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK;GAC9B,IAAI,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK;GAC9B,IAAI,WAAW,KAAK,MAAM,IAAI,EAAE;GAChC,IAAI,YAAY,aAAa;GAC7B,IAAI,aAAa,GAAG;IAElB,KAAK;IACL,KAAK;IACL,WAAW;GACb;GAEA,MAAM,UAAU,cAAc,WAAW;GACzC,MAAM,KAAK,KAAK;GAChB,MAAM,KAAK,KAAK;GAChB,MAAM,SAAS,EAAE,MAAM;GACvB,MAAM,SAAS,EAAE,MAAM;GACvB,IAAI,UAAU,QAAQ;GACtB,MAAM,SAAS,SAAS,IAAI,SAAS,IAAI;GACzC,MAAM,SAAS,IAAI;GACnB,EAAE,KAAK,EAAE,KAAK,KAAK,KAAK,UAAU;GAClC,EAAE,KAAK,EAAE,KAAK,KAAK,KAAK,UAAU;GAClC,EAAE,KAAK,EAAE,KAAK,KAAK,KAAK,UAAU;GAClC,EAAE,KAAK,EAAE,KAAK,KAAK,KAAK,UAAU;GAClC,QAAQ;EACV;EAEF,IAAI,CAAC,OAAO;CACd;AACF"}

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

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

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

@@ -0,0 +1,92 @@
+import { forceCenter, forceCollide, forceLink, forceManyBody, forceSimulation, forceX, forceY } from "d3-force";
+// src/domains/knowledge/lib/layout.ts
+/**
+* Synchronous d3-force layout for the knowledge graph. The simulation is run
+* to a fixed tick count with deterministic initial positions (a phyllotaxis
+* spiral over the SORTED node ids), so the same input always yields the same
+* settled layout — that is what makes the layout unit-testable.
+*/
+var DEFAULT_PADDING = 28;
+var DEFAULT_TICKS = 300;
+function runLayout(nodes, edges, options = {}) {
+	const ticks = options.ticks ?? DEFAULT_TICKS;
+	const simNodes = [...nodes].sort((a, b) => a.id.localeCompare(b.id)).map((node, index) => {
+		const radius = 18 * Math.sqrt(.5 + index);
+		const angle = index * 2.399963229728653;
+		const seeded = node.initial ?? {
+			x: radius * Math.cos(angle),
+			y: radius * Math.sin(angle)
+		};
+		return {
+			id: node.id,
+			size: node.size,
+			padding: node.padding ?? DEFAULT_PADDING,
+			x: node.fixed?.x ?? seeded.x,
+			y: node.fixed?.y ?? seeded.y,
+			fx: node.fixed?.x ?? null,
+			fy: node.fixed?.y ?? null
+		};
+	});
+	const ids = new Set(simNodes.map((node) => node.id));
+	const hugs = new Set(edges.filter((edge) => edge.hug).map((edge) => `${edge.source}\u0000${edge.target}`));
+	const simEdges = edges.filter((edge) => ids.has(edge.source) && ids.has(edge.target)).map((edge) => ({
+		source: edge.source,
+		target: edge.target
+	}));
+	forceSimulation(simNodes).force("link", forceLink(simEdges).id((node) => node.id).distance((link) => {
+		const source = link.source;
+		const target = link.target;
+		return (hugs.has(`${source.id}\u0000${target.id}`) ? 8 : 40) + (source.size + target.size) / 2;
+	})).force("charge", forceManyBody().strength((node) => node.size <= 24 ? -60 : -700)).force("collide", forceCollide().radius((node) => node.size / 2 + node.padding).strength(1).iterations(3)).force("center", forceCenter(0, 0)).force("x", forceX(0).strength(.06)).force("y", forceY(0).strength(.08)).stop().tick(ticks);
+	resolveOverlaps(simNodes);
+	const positions = /* @__PURE__ */ new Map();
+	for (const node of simNodes) positions.set(node.id, {
+		x: node.x ?? 0,
+		y: node.y ?? 0
+	});
+	return positions;
+}
+/**
+* Hard guarantee that no two nodes overlap: the force simulation can leave
+* residual overlaps once alpha decays, so after settling we sweep node pairs
+* and push them apart deterministically until every pair clears its combined
+* radius plus padding. Fixed (user-dragged) nodes never move.
+*/
+function resolveOverlaps(nodes) {
+	const order = [...nodes].sort((a, b) => b.size - a.size);
+	for (let sweep = 0; sweep < 600; sweep++) {
+		let moved = false;
+		for (let i = 0; i < order.length; i++) for (let j = i + 1; j < order.length; j++) {
+			const a = order[i];
+			const b = order[j];
+			if (!a || !b) continue;
+			const minDistance = a.size / 2 + b.size / 2 + Math.min(a.padding, b.padding);
+			let dx = (b.x ?? 0) - (a.x ?? 0);
+			let dy = (b.y ?? 0) - (a.y ?? 0);
+			let distance = Math.hypot(dx, dy);
+			if (distance >= minDistance) continue;
+			if (distance === 0) {
+				dx = 1;
+				dy = 0;
+				distance = 1;
+			}
+			const overlap = minDistance - distance + .5;
+			const ux = dx / distance;
+			const uy = dy / distance;
+			const aFixed = a.fx != null;
+			const bFixed = b.fx != null;
+			if (aFixed && bFixed) continue;
+			const aShare = aFixed ? 0 : bFixed ? 1 : .5;
+			const bShare = 1 - aShare;
+			a.x = (a.x ?? 0) - ux * overlap * aShare;
+			a.y = (a.y ?? 0) - uy * overlap * aShare;
+			b.x = (b.x ?? 0) + ux * overlap * bShare;
+			b.y = (b.y ?? 0) + uy * overlap * bShare;
+			moved = true;
+		}
+		if (!moved) break;
+	}
+}
+export { runLayout };
+
+//# sourceMappingURL=layout.es.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"layout.es.js","names":[],"sources":["../../../../src/domains/knowledge/lib/layout.ts"],"sourcesContent":["/**\n * Synchronous d3-force layout for the knowledge graph. The simulation is run\n * to a fixed tick count with deterministic initial positions (a phyllotaxis\n * spiral over the SORTED node ids), so the same input always yields the same\n * settled layout — that is what makes the layout unit-testable.\n */\n\nimport { forceCenter, forceCollide, forceLink, forceManyBody, forceSimulation, forceX, forceY } from 'd3-force';\nimport type { SimulationLinkDatum, SimulationNodeDatum } from 'd3-force';\n\nexport interface LayoutNodeInput {\n  id: string;\n  /** Node diameter in px (drives collision radius and link distance). */\n  size: number;\n  /** Pinned position from a user drag — the simulation must not move it. */\n  fixed?: { x: number; y: number };\n  /** Warm-start position (e.g. spawn a new node near its first neighbor). */\n  initial?: { x: number; y: number };\n  /** Collision breathing room around the node (default 28; tiny record dots use less). */\n  padding?: number;\n}\n\nexport interface LayoutEdgeInput {\n  source: string;\n  target: string;\n  /** A11: hug links (record dot stubs / junction spokes) stay short so record markers cluster tight. */\n  hug?: boolean;\n}\n\nconst DEFAULT_PADDING = 28;\n\ninterface SimNode extends SimulationNodeDatum {\n  id: string;\n  size: number;\n  padding: number;\n}\n\ntype SimLink = SimulationLinkDatum<SimNode>;\n\nconst DEFAULT_TICKS = 300;\n\nexport function runLayout(\n  nodes: LayoutNodeInput[],\n  edges: LayoutEdgeInput[],\n  options: { ticks?: number } = {},\n): Map<string, { x: number; y: number }> {\n  const ticks = options.ticks ?? DEFAULT_TICKS;\n  const order = [...nodes].sort((a, b) => a.id.localeCompare(b.id));\n  const simNodes: SimNode[] = order.map((node, index) => {\n    // Deterministic phyllotaxis seed (same shape d3 uses internally, but keyed\n    // to the sorted index so insertion order never changes the layout).\n    const radius = 18 * Math.sqrt(0.5 + index);\n    const angle = index * 2.399963229728653;\n    const seeded = node.initial ?? { x: radius * Math.cos(angle), y: radius * Math.sin(angle) };\n    return {\n      id: node.id,\n      size: node.size,\n      padding: node.padding ?? DEFAULT_PADDING,\n      x: node.fixed?.x ?? seeded.x,\n      y: node.fixed?.y ?? seeded.y,\n      fx: node.fixed?.x ?? null,\n      fy: node.fixed?.y ?? null,\n    };\n  });\n  const ids = new Set(simNodes.map(node => node.id));\n  const hugs = new Set(edges.filter(edge => edge.hug).map(edge => `${edge.source}\\u0000${edge.target}`));\n  const simEdges: SimLink[] = edges\n    .filter(edge => ids.has(edge.source) && ids.has(edge.target))\n    .map(edge => ({ source: edge.source, target: edge.target }));\n\n  const simulation = forceSimulation(simNodes)\n    .force(\n      'link',\n      forceLink<SimNode, SimLink>(simEdges)\n        .id(node => node.id)\n        .distance(link => {\n          const source = link.source as SimNode;\n          const target = link.target as SimNode;\n          // Hug links (record stubs/spokes) keep markers tight to their cluster.\n          const hug = hugs.has(`${source.id}\\u0000${target.id}`);\n          return (hug ? 8 : 40) + (source.size + target.size) / 2;\n        }),\n    )\n    // Tiny record markers repel gently; knowledge nodes keep the strong spread.\n    .force(\n      'charge',\n      forceManyBody<SimNode>().strength(node => (node.size <= 24 ? -60 : -700)),\n    )\n    .force(\n      'collide',\n      forceCollide<SimNode>()\n        .radius(node => node.size / 2 + node.padding)\n        .strength(1)\n        .iterations(3),\n    )\n    .force('center', forceCenter(0, 0))\n    // Weak gravity keeps disconnected satellites in frame instead of flinging\n    // them to the edges of the canvas.\n    .force('x', forceX(0).strength(0.06))\n    .force('y', forceY(0).strength(0.08))\n    .stop();\n\n  simulation.tick(ticks);\n  resolveOverlaps(simNodes);\n\n  const positions = new Map<string, { x: number; y: number }>();\n  for (const node of simNodes) {\n    // No rounding: a 1px round-off can re-introduce a just-resolved overlap.\n    positions.set(node.id, { x: node.x ?? 0, y: node.y ?? 0 });\n  }\n  return positions;\n}\n\n/**\n * Hard guarantee that no two nodes overlap: the force simulation can leave\n * residual overlaps once alpha decays, so after settling we sweep node pairs\n * and push them apart deterministically until every pair clears its combined\n * radius plus padding. Fixed (user-dragged) nodes never move.\n */\nfunction resolveOverlaps(nodes: SimNode[]): void {\n  // Sorted big-first: settling the large nodes before the dots converges much\n  // faster and avoids ping-pong between hub pairs.\n  const order = [...nodes].sort((a, b) => b.size - a.size);\n  for (let sweep = 0; sweep < 600; sweep++) {\n    let moved = false;\n    for (let i = 0; i < order.length; i++) {\n      for (let j = i + 1; j < order.length; j++) {\n        const a = order[i];\n        const b = order[j];\n        if (!a || !b) continue;\n        // Pair breathing room = the smaller of the two paddings, so tiny\n        // record markers can nestle close without knowledge nodes colliding.\n        const minDistance = a.size / 2 + b.size / 2 + Math.min(a.padding, b.padding);\n        let dx = (b.x ?? 0) - (a.x ?? 0);\n        let dy = (b.y ?? 0) - (a.y ?? 0);\n        let distance = Math.hypot(dx, dy);\n        if (distance >= minDistance) continue;\n        if (distance === 0) {\n          // Perfectly stacked: separate along a deterministic axis.\n          dx = 1;\n          dy = 0;\n          distance = 1;\n        }\n        // Over-separate slightly so float noise can't re-trigger the pair.\n        const overlap = minDistance - distance + 0.5;\n        const ux = dx / distance;\n        const uy = dy / distance;\n        const aFixed = a.fx != null;\n        const bFixed = b.fx != null;\n        if (aFixed && bFixed) continue;\n        const aShare = aFixed ? 0 : bFixed ? 1 : 0.5;\n        const bShare = 1 - aShare;\n        a.x = (a.x ?? 0) - ux * overlap * aShare;\n        a.y = (a.y ?? 0) - uy * overlap * aShare;\n        b.x = (b.x ?? 0) + ux * overlap * bShare;\n        b.y = (b.y ?? 0) + uy * overlap * bShare;\n        moved = true;\n      }\n    }\n    if (!moved) break;\n  }\n}\n"],"mappings":";;;;;;;;AA6BA,IAAM,kBAAkB;AAUxB,IAAM,gBAAgB;AAEtB,SAAgB,UACd,OACA,OACA,UAA8B,CAAC,GACQ;CACvC,MAAM,QAAQ,QAAQ,SAAS;CAE/B,MAAM,WADQ,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,EAAE,CACnC,CAAA,CAAM,KAAK,MAAM,UAAU;EAGrD,MAAM,SAAS,KAAK,KAAK,KAAK,KAAM,KAAK;EACzC,MAAM,QAAQ,QAAQ;EACtB,MAAM,SAAS,KAAK,WAAW;GAAE,GAAG,SAAS,KAAK,IAAI,KAAK;GAAG,GAAG,SAAS,KAAK,IAAI,KAAK;EAAE;EAC1F,OAAO;GACL,IAAI,KAAK;GACT,MAAM,KAAK;GACX,SAAS,KAAK,WAAW;GACzB,GAAG,KAAK,OAAO,KAAK,OAAO;GAC3B,GAAG,KAAK,OAAO,KAAK,OAAO;GAC3B,IAAI,KAAK,OAAO,KAAK;GACrB,IAAI,KAAK,OAAO,KAAK;EACvB;CACF,CAAC;CACD,MAAM,MAAM,IAAI,IAAI,SAAS,KAAI,SAAQ,KAAK,EAAE,CAAC;CACjD,MAAM,OAAO,IAAI,IAAI,MAAM,QAAO,SAAQ,KAAK,GAAG,CAAC,CAAC,KAAI,SAAQ,GAAG,KAAK,OAAO,QAAQ,KAAK,QAAQ,CAAC;CACrG,MAAM,WAAsB,MACzB,QAAO,SAAQ,IAAI,IAAI,KAAK,MAAM,KAAK,IAAI,IAAI,KAAK,MAAM,CAAC,CAAC,CAC5D,KAAI,UAAS;EAAE,QAAQ,KAAK;EAAQ,QAAQ,KAAK;CAAO,EAAE;CAkC7D,gBAhCmC,QAAQ,CAAC,CACzC,MACC,QACA,UAA4B,QAAQ,CAAC,CAClC,IAAG,SAAQ,KAAK,EAAE,CAAC,CACnB,UAAS,SAAQ;EAChB,MAAM,SAAS,KAAK;EACpB,MAAM,SAAS,KAAK;EAGpB,QADY,KAAK,IAAI,GAAG,OAAO,GAAG,QAAQ,OAAO,IACzC,IAAM,IAAI,OAAO,OAAO,OAAO,OAAO,QAAQ;CACxD,CAAC,CACL,CAAC,CAEA,MACC,UACA,cAAuB,CAAC,CAAC,UAAS,SAAS,KAAK,QAAQ,KAAK,MAAM,IAAK,CAC1E,CAAC,CACA,MACC,WACA,aAAsB,CAAC,CACpB,QAAO,SAAQ,KAAK,OAAO,IAAI,KAAK,OAAO,CAAC,CAC5C,SAAS,CAAC,CAAC,CACX,WAAW,CAAC,CACjB,CAAC,CACA,MAAM,UAAU,YAAY,GAAG,CAAC,CAAC,CAAC,CAGlC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,SAAS,GAAI,CAAC,CAAC,CACpC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,SAAS,GAAI,CAAC,CAAC,CACpC,KAEH,CAAA,CAAW,KAAK,KAAK;CACrB,gBAAgB,QAAQ;CAExB,MAAM,4BAAY,IAAI,IAAsC;CAC5D,KAAK,MAAM,QAAQ,UAEjB,UAAU,IAAI,KAAK,IAAI;EAAE,GAAG,KAAK,KAAK;EAAG,GAAG,KAAK,KAAK;CAAE,CAAC;CAE3D,OAAO;AACT;;;;;;;AAQA,SAAS,gBAAgB,OAAwB;CAG/C,MAAM,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;CACvD,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,SAAS;EACxC,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACzC,MAAM,IAAI,MAAM;GAChB,MAAM,IAAI,MAAM;GAChB,IAAI,CAAC,KAAK,CAAC,GAAG;GAGd,MAAM,cAAc,EAAE,OAAO,IAAI,EAAE,OAAO,IAAI,KAAK,IAAI,EAAE,SAAS,EAAE,OAAO;GAC3E,IAAI,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK;GAC9B,IAAI,MAAM,EAAE,KAAK,MAAM,EAAE,KAAK;GAC9B,IAAI,WAAW,KAAK,MAAM,IAAI,EAAE;GAChC,IAAI,YAAY,aAAa;GAC7B,IAAI,aAAa,GAAG;IAElB,KAAK;IACL,KAAK;IACL,WAAW;GACb;GAEA,MAAM,UAAU,cAAc,WAAW;GACzC,MAAM,KAAK,KAAK;GAChB,MAAM,KAAK,KAAK;GAChB,MAAM,SAAS,EAAE,MAAM;GACvB,MAAM,SAAS,EAAE,MAAM;GACvB,IAAI,UAAU,QAAQ;GACtB,MAAM,SAAS,SAAS,IAAI,SAAS,IAAI;GACzC,MAAM,SAAS,IAAI;GACnB,EAAE,KAAK,EAAE,KAAK,KAAK,KAAK,UAAU;GAClC,EAAE,KAAK,EAAE,KAAK,KAAK,KAAK,UAAU;GAClC,EAAE,KAAK,EAAE,KAAK,KAAK,KAAK,UAAU;GAClC,EAAE,KAAK,EAAE,KAAK,KAAK,KAAK,UAAU;GAClC,QAAQ;EACV;EAEF,IAAI,CAAC,OAAO;CACd;AACF"}

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

@@ -0,0 +1,135 @@
+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.
+*/
+function pageGraphEdges(pages, mentionEdges = []) {
+	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({
+		source: page.parentId,
+		target: page.id,
+		kind: "parent"
+	});
+	const mentions = /* @__PURE__ */ new Map();
+	for (const edge of mentionEdges) {
+		if (edge.kind !== "mention" || 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 count = edge.count ?? 1;
+		if (existing) existing.count = (existing.count ?? 1) + count;
+		else mentions.set(key, {
+			source: edge.source,
+			target: edge.target,
+			kind: "mention",
+			count
+		});
+	}
+	return [...edges, ...mentions.values()];
+}
+/** Id of the placeholder circle for a declared principal that has no scope page yet. */
+function unplacedScopeId(address) {
+	return `unplaced:${address}`;
+}
+/**
+* Grants as graph pages and edges. A grant from a principal with a loaded scope page draws from that
+* page; one whose principal has no scope page yet draws from a placeholder scope (one per address), so
+* a role nobody has written to still shows what it can reach. Grants to unloaded targets are dropped.
+*/
+function grantGraph(pages, grants = []) {
+	const live = new Set(pages.filter((page) => !page.deletedAt && !page.mergedInto).map((page) => page.id));
+	const placeholders = /* @__PURE__ */ new Map();
+	const edges = /* @__PURE__ */ new Map();
+	for (const grant of grants) {
+		if (!live.has(grant.target)) continue;
+		let source = grant.principalId && live.has(grant.principalId) ? grant.principalId : null;
+		if (!source) {
+			if (grant.principalId) continue;
+			source = unplacedScopeId(grant.principal);
+			if (!placeholders.has(source)) placeholders.set(source, placeholderScope(source, grant));
+		}
+		if (source === grant.target) continue;
+		edges.set(`${source}\u0000${grant.target}`, {
+			source,
+			target: grant.target,
+			kind: "grant",
+			role: grant.role
+		});
+	}
+	return {
+		placeholders: [...placeholders.values()],
+		edges: [...edges.values()]
+	};
+}
+function placeholderScope(id, grant) {
+	const nobody = { author: "" };
+	return {
+		id,
+		scopeId: id,
+		parentId: null,
+		isScope: true,
+		address: grant.principal,
+		displayLabel: grant.principalLabel,
+		position: "",
+		name: grant.principal,
+		version: 0,
+		createdBy: nobody,
+		updatedBy: nobody,
+		createdAt: "",
+		updatedAt: ""
+	};
+}
+/** The page plus every page one edge away from it, either direction. */
+function pageNeighbourIds(pageId, edges) {
+	const ids = /* @__PURE__ */ new Set([pageId]);
+	for (const edge of edges) {
+		if (edge.source === pageId) ids.add(edge.target);
+		if (edge.target === pageId) ids.add(edge.source);
+	}
+	return ids;
+}
+/** Circle diameters: big enough for a kind label and three lines of name. */
+var KNOWLEDGE_SCOPE_SIZE = 124;
+var KNOWLEDGE_PAGE_SIZE = 108;
+/** Converts pages and their edges to React Flow elements; positions are left to the layout. */
+function toPageFlow(pages, edges, selectedId) {
+	return {
+		nodes: pages.filter((page) => !page.deletedAt && !page.mergedInto).map((page) => {
+			return {
+				id: page.id,
+				type: "page",
+				position: {
+					x: 0,
+					y: 0
+				},
+				data: {
+					page,
+					size: page.isScope ? 124 : 108,
+					selected: page.id === selectedId
+				}
+			};
+		}),
+		edges: edges.map((edge) => ({
+			id: `${edge.kind}:${edge.source}->${edge.target}`,
+			source: edge.source,
+			target: edge.target,
+			data: {
+				kind: edge.kind,
+				count: edge.count ?? 1,
+				...edge.role ? { role: edge.role } : {}
+			}
+		}))
+	};
+}
+exports.KNOWLEDGE_PAGE_SIZE = KNOWLEDGE_PAGE_SIZE;
+exports.KNOWLEDGE_SCOPE_SIZE = KNOWLEDGE_SCOPE_SIZE;
+exports.grantGraph = grantGraph;
+exports.pageGraphEdges = pageGraphEdges;
+exports.pageNeighbourIds = pageNeighbourIds;
+exports.toPageFlow = toPageFlow;
+exports.unplacedScopeId = unplacedScopeId;
+
+//# sourceMappingURL=pageGraph.cjs.js.map

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

@@ -0,0 +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"}

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

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

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

@@ -0,0 +1,128 @@
+// 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.
+*/
+function pageGraphEdges(pages, mentionEdges = []) {
+	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({
+		source: page.parentId,
+		target: page.id,
+		kind: "parent"
+	});
+	const mentions = /* @__PURE__ */ new Map();
+	for (const edge of mentionEdges) {
+		if (edge.kind !== "mention" || 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 count = edge.count ?? 1;
+		if (existing) existing.count = (existing.count ?? 1) + count;
+		else mentions.set(key, {
+			source: edge.source,
+			target: edge.target,
+			kind: "mention",
+			count
+		});
+	}
+	return [...edges, ...mentions.values()];
+}
+/** Id of the placeholder circle for a declared principal that has no scope page yet. */
+function unplacedScopeId(address) {
+	return `unplaced:${address}`;
+}
+/**
+* Grants as graph pages and edges. A grant from a principal with a loaded scope page draws from that
+* page; one whose principal has no scope page yet draws from a placeholder scope (one per address), so
+* a role nobody has written to still shows what it can reach. Grants to unloaded targets are dropped.
+*/
+function grantGraph(pages, grants = []) {
+	const live = new Set(pages.filter((page) => !page.deletedAt && !page.mergedInto).map((page) => page.id));
+	const placeholders = /* @__PURE__ */ new Map();
+	const edges = /* @__PURE__ */ new Map();
+	for (const grant of grants) {
+		if (!live.has(grant.target)) continue;
+		let source = grant.principalId && live.has(grant.principalId) ? grant.principalId : null;
+		if (!source) {
+			if (grant.principalId) continue;
+			source = unplacedScopeId(grant.principal);
+			if (!placeholders.has(source)) placeholders.set(source, placeholderScope(source, grant));
+		}
+		if (source === grant.target) continue;
+		edges.set(`${source}\u0000${grant.target}`, {
+			source,
+			target: grant.target,
+			kind: "grant",
+			role: grant.role
+		});
+	}
+	return {
+		placeholders: [...placeholders.values()],
+		edges: [...edges.values()]
+	};
+}
+function placeholderScope(id, grant) {
+	const nobody = { author: "" };
+	return {
+		id,
+		scopeId: id,
+		parentId: null,
+		isScope: true,
+		address: grant.principal,
+		displayLabel: grant.principalLabel,
+		position: "",
+		name: grant.principal,
+		version: 0,
+		createdBy: nobody,
+		updatedBy: nobody,
+		createdAt: "",
+		updatedAt: ""
+	};
+}
+/** The page plus every page one edge away from it, either direction. */
+function pageNeighbourIds(pageId, edges) {
+	const ids = /* @__PURE__ */ new Set([pageId]);
+	for (const edge of edges) {
+		if (edge.source === pageId) ids.add(edge.target);
+		if (edge.target === pageId) ids.add(edge.source);
+	}
+	return ids;
+}
+/** Circle diameters: big enough for a kind label and three lines of name. */
+var KNOWLEDGE_SCOPE_SIZE = 124;
+var KNOWLEDGE_PAGE_SIZE = 108;
+/** Converts pages and their edges to React Flow elements; positions are left to the layout. */
+function toPageFlow(pages, edges, selectedId) {
+	return {
+		nodes: pages.filter((page) => !page.deletedAt && !page.mergedInto).map((page) => {
+			return {
+				id: page.id,
+				type: "page",
+				position: {
+					x: 0,
+					y: 0
+				},
+				data: {
+					page,
+					size: page.isScope ? 124 : 108,
+					selected: page.id === selectedId
+				}
+			};
+		}),
+		edges: edges.map((edge) => ({
+			id: `${edge.kind}:${edge.source}->${edge.target}`,
+			source: edge.source,
+			target: edge.target,
+			data: {
+				kind: edge.kind,
+				count: edge.count ?? 1,
+				...edge.role ? { role: edge.role } : {}
+			}
+		}))
+	};
+}
+export { KNOWLEDGE_PAGE_SIZE, KNOWLEDGE_SCOPE_SIZE, grantGraph, pageGraphEdges, pageNeighbourIds, toPageFlow, unplacedScopeId };
+
+//# sourceMappingURL=pageGraph.es.js.map

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

@@ -0,0 +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"}

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

@@ -0,0 +1,49 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_domains_knowledge_lib_layout = require("./layout.cjs.js");
+// src/domains/knowledge/lib/pageLayout.ts
+/** Below this share of already-placed nodes the graph is laid out from scratch. */
+var WARM_SHARE = .5;
+function layoutKey(nodes, edges) {
+	const nodePart = nodes.map((node) => `${node.id}:${node.size}`).sort();
+	const edgePart = edges.map((edge) => `${edge.source}>${edge.target}`).sort();
+	return `${nodePart.join(",")}|${edgePart.join(",")}`;
+}
+/**
+* Lays out the page graph, reusing the previous layout. The same nodes and
+* edges return the previous positions as they are, so a refetch or live update
+* that changes nothing in the graph never moves a node or re-runs the solve.
+* When most nodes were already placed, they start where they sat, new pages
+* start beside a placed neighbour, and a short run only pushes apart pages that
+* overlap, so the rest stay put.
+* Otherwise the layout is solved from the deterministic cold start.
+*/
+function layoutPageGraph(previous, nodes, edges) {
+	const key = layoutKey(nodes, edges);
+	if (previous?.key === key) return previous;
+	const last = previous?.positions;
+	const known = last ? nodes.filter((node) => last.has(node.id)).length : 0;
+	if (!last || nodes.length === 0 || known / nodes.length < WARM_SHARE) return {
+		key,
+		positions: require_domains_knowledge_lib_layout.runLayout(nodes, edges)
+	};
+	const besideNeighbour = (id) => {
+		for (const edge of edges) {
+			const other = edge.source === id ? edge.target : edge.target === id ? edge.source : void 0;
+			const at = other ? last.get(other) : void 0;
+			if (at) return {
+				x: at.x + 40,
+				y: at.y + 40
+			};
+		}
+	};
+	return {
+		key,
+		positions: require_domains_knowledge_lib_layout.runLayout(nodes.map((node) => ({
+			...node,
+			initial: last.get(node.id) ?? besideNeighbour(node.id)
+		})), edges, { ticks: 0 })
+	};
+}
+exports.layoutPageGraph = layoutPageGraph;
+
+//# sourceMappingURL=pageLayout.cjs.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pageLayout.cjs.js","names":["runLayout"],"sources":["../../../../src/domains/knowledge/lib/pageLayout.ts"],"sourcesContent":["import { runLayout } from './layout';\nimport type { LayoutEdgeInput } from './layout';\n\ntype Point = { x: number; y: number };\n\nexport interface PageLayout {\n  /** Node ids, sizes and edges the positions were solved for. */\n  key: string;\n  positions: Map<string, Point>;\n}\n\n/** Below this share of already-placed nodes the graph is laid out from scratch. */\nconst WARM_SHARE = 0.5;\n\nfunction layoutKey(nodes: { id: string; size: number }[], edges: LayoutEdgeInput[]): string {\n  const nodePart = nodes.map(node => `${node.id}:${node.size}`).sort();\n  const edgePart = edges.map(edge => `${edge.source}>${edge.target}`).sort();\n  return `${nodePart.join(',')}|${edgePart.join(',')}`;\n}\n\n/**\n * Lays out the page graph, reusing the previous layout. The same nodes and\n * edges return the previous positions as they are, so a refetch or live update\n * that changes nothing in the graph never moves a node or re-runs the solve.\n * When most nodes were already placed, they start where they sat, new pages\n * start beside a placed neighbour, and a short run only pushes apart pages that\n * overlap, so the rest stay put.\n * Otherwise the layout is solved from the deterministic cold start.\n */\nexport function layoutPageGraph(\n  previous: PageLayout | undefined,\n  nodes: { id: string; size: number }[],\n  edges: LayoutEdgeInput[],\n): PageLayout {\n  const key = layoutKey(nodes, edges);\n  if (previous?.key === key) return previous;\n\n  const last = previous?.positions;\n  const known = last ? nodes.filter(node => last.has(node.id)).length : 0;\n  if (!last || nodes.length === 0 || known / nodes.length < WARM_SHARE) {\n    return { key, positions: runLayout(nodes, edges) };\n  }\n\n  const besideNeighbour = (id: string): Point | undefined => {\n    for (const edge of edges) {\n      const other = edge.source === id ? edge.target : edge.target === id ? edge.source : undefined;\n      const at = other ? last.get(other) : undefined;\n      if (at) return { x: at.x + 40, y: at.y + 40 };\n    }\n    return undefined;\n  };\n  // No force ticks: any force run drifts a settled layout. Only the overlap\n  // pass runs, pushing apart the pages a new page landed on.\n  const positions = runLayout(\n    nodes.map(node => ({ ...node, initial: last.get(node.id) ?? besideNeighbour(node.id) })),\n    edges,\n    { ticks: 0 },\n  );\n  return { key, positions };\n}\n"],"mappings":";;;;AAYA,IAAM,aAAa;AAEnB,SAAS,UAAU,OAAuC,OAAkC;CAC1F,MAAM,WAAW,MAAM,KAAI,SAAQ,GAAG,KAAK,GAAG,GAAG,KAAK,MAAM,CAAC,CAAC,KAAK;CACnE,MAAM,WAAW,MAAM,KAAI,SAAQ,GAAG,KAAK,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,KAAK;CACzE,OAAO,GAAG,SAAS,KAAK,GAAG,EAAE,GAAG,SAAS,KAAK,GAAG;AACnD;;;;;;;;;;AAWA,SAAgB,gBACd,UACA,OACA,OACY;CACZ,MAAM,MAAM,UAAU,OAAO,KAAK;CAClC,IAAI,UAAU,QAAQ,KAAK,OAAO;CAElC,MAAM,OAAO,UAAU;CACvB,MAAM,QAAQ,OAAO,MAAM,QAAO,SAAQ,KAAK,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS;CACtE,IAAI,CAAC,QAAQ,MAAM,WAAW,KAAK,QAAQ,MAAM,SAAS,YACxD,OAAO;EAAE;EAAK,WAAWA,qCAAAA,UAAU,OAAO,KAAK;CAAE;CAGnD,MAAM,mBAAmB,OAAkC;EACzD,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,QAAQ,KAAK,WAAW,KAAK,KAAK,SAAS,KAAK,WAAW,KAAK,KAAK,SAAS,KAAA;GACpF,MAAM,KAAK,QAAQ,KAAK,IAAI,KAAK,IAAI,KAAA;GACrC,IAAI,IAAI,OAAO;IAAE,GAAG,GAAG,IAAI;IAAI,GAAG,GAAG,IAAI;GAAG;EAC9C;CAEF;CAQA,OAAO;EAAE;EAAK,WALIA,qCAAAA,UAChB,MAAM,KAAI,UAAS;GAAE,GAAG;GAAM,SAAS,KAAK,IAAI,KAAK,EAAE,KAAK,gBAAgB,KAAK,EAAE;EAAE,EAAE,GACvF,OACA,EAAE,OAAO,EAAE,CAEC;CAAU;AAC1B"}

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

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

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

@@ -0,0 +1,48 @@
+import { runLayout } from "./layout.es.js";
+// src/domains/knowledge/lib/pageLayout.ts
+/** Below this share of already-placed nodes the graph is laid out from scratch. */
+var WARM_SHARE = .5;
+function layoutKey(nodes, edges) {
+	const nodePart = nodes.map((node) => `${node.id}:${node.size}`).sort();
+	const edgePart = edges.map((edge) => `${edge.source}>${edge.target}`).sort();
+	return `${nodePart.join(",")}|${edgePart.join(",")}`;
+}
+/**
+* Lays out the page graph, reusing the previous layout. The same nodes and
+* edges return the previous positions as they are, so a refetch or live update
+* that changes nothing in the graph never moves a node or re-runs the solve.
+* When most nodes were already placed, they start where they sat, new pages
+* start beside a placed neighbour, and a short run only pushes apart pages that
+* overlap, so the rest stay put.
+* Otherwise the layout is solved from the deterministic cold start.
+*/
+function layoutPageGraph(previous, nodes, edges) {
+	const key = layoutKey(nodes, edges);
+	if (previous?.key === key) return previous;
+	const last = previous?.positions;
+	const known = last ? nodes.filter((node) => last.has(node.id)).length : 0;
+	if (!last || nodes.length === 0 || known / nodes.length < WARM_SHARE) return {
+		key,
+		positions: runLayout(nodes, edges)
+	};
+	const besideNeighbour = (id) => {
+		for (const edge of edges) {
+			const other = edge.source === id ? edge.target : edge.target === id ? edge.source : void 0;
+			const at = other ? last.get(other) : void 0;
+			if (at) return {
+				x: at.x + 40,
+				y: at.y + 40
+			};
+		}
+	};
+	return {
+		key,
+		positions: runLayout(nodes.map((node) => ({
+			...node,
+			initial: last.get(node.id) ?? besideNeighbour(node.id)
+		})), edges, { ticks: 0 })
+	};
+}
+export { layoutPageGraph };
+
+//# sourceMappingURL=pageLayout.es.js.map