@fnndsc/orrery 0.1.0

package/dist/layout/ranked.js

@@ -0,0 +1,148 @@
+/**
+ * @file The ranked layout, declared once.
+ *
+ * A DAG drawn as the tree it is: every node hangs beneath its anchor parent
+ * (a join's extra parents are edges, not placement), a subtree occupies a
+ * contiguous span of leaf slots and its root sits over the middle of that
+ * span, tiers by depth from the roots. The same graph always lands the same
+ * way — sibling order is settled by id, so nothing depends on the order
+ * nodes happened to arrive in.
+ *
+ * This module exists because the layout was written twice. The stage drew a
+ * pipeline with the algorithm below; the preview card drew the same
+ * pipeline by spreading each tier evenly, and the two agreed on nothing —
+ * so a card and the detail it previewed were visibly different graphs. They
+ * were not made to differ; they were written separately and could not help
+ * it.
+ *
+ * The output is in LAYOUT UNITS — slot columns and tier rows — not in
+ * scene units or pixels. Each renderer scales them for the medium it
+ * paints: three.js on the stage, SVG in a card that cannot hold a WebGL
+ * context, since a grid of ninety previews would want ninety of them and a
+ * browser grants about a dozen.
+ *
+ * Deliberately dependency-free, so it can be unit tested where the scene
+ * itself cannot: three.js will not load under jest.
+ *
+ * @module
+ */
+import { NODE_RADIUS } from './types.js';
+/**
+ * Places a graph as ranked tiers.
+ *
+ * @param nodes - The graph. Parent ids naming absent nodes are ignored, so
+ *   a partial graph still places.
+ * @returns Every node's slot and tier, with the extents to fit them by.
+ */
+export function rankedLayout_compute(nodes) {
+    const byId = new Map(nodes.map((node) => [node.id, node]));
+    // Depth is the longest path from a root, so a join sits below everything
+    // it waits for rather than beside its shallowest parent.
+    const depths = new Map();
+    const depth_find = (node, trail) => {
+        const known = depths.get(node.id);
+        if (known !== undefined)
+            return known;
+        if (trail.has(node.id) || node.parentIds.length === 0) {
+            depths.set(node.id, 0);
+            return 0;
+        }
+        trail.add(node.id);
+        let deepest = 0;
+        for (const parentId of node.parentIds) {
+            const parent = byId.get(parentId);
+            if (parent)
+                deepest = Math.max(deepest, depth_find(parent, trail) + 1);
+        }
+        depths.set(node.id, deepest);
+        return deepest;
+    };
+    for (const node of nodes)
+        depth_find(node, new Set());
+    // The anchor tree: each node under its first parent present in the graph;
+    // anything without one is a root. Sibling order is settled by id so the
+    // same graph lands the same way whatever order it arrived in.
+    const children = new Map();
+    const roots = [];
+    const byIdSort = (a, b) => a.id.localeCompare(b.id, undefined, { numeric: true });
+    for (const node of nodes) {
+        const anchor = node.parentIds.find((id) => byId.has(id));
+        if (anchor === undefined) {
+            roots.push(node);
+            continue;
+        }
+        const siblings = children.get(anchor) ?? [];
+        siblings.push(node);
+        children.set(anchor, siblings);
+    }
+    roots.sort(byIdSort);
+    for (const siblings of children.values())
+        siblings.sort(byIdSort);
+    // Leaf slots: a subtree spans as many slots as it has leaves, and its
+    // root sits over the middle of that span. One walk assigns every x.
+    const xs = new Map();
+    let slot = 0;
+    const seen = new Set();
+    const place = (node) => {
+        seen.add(node.id);
+        const kids = (children.get(node.id) ?? [])
+            .filter((kid) => !seen.has(kid.id));
+        if (kids.length === 0) {
+            const x = slot++;
+            xs.set(node.id, x);
+            return [x, x];
+        }
+        let first = Number.POSITIVE_INFINITY;
+        let last = Number.NEGATIVE_INFINITY;
+        for (const kid of kids) {
+            const [low, high] = place(kid);
+            first = Math.min(first, low);
+            last = Math.max(last, high);
+        }
+        const x = (first + last) / 2;
+        xs.set(node.id, x);
+        return [first, last];
+    };
+    for (const root of roots)
+        place(root);
+    // A cycle leaves nodes the walk never reached; they still land.
+    for (const node of nodes)
+        if (!xs.has(node.id))
+            place(node);
+    const tierCount = Math.max(...Array.from(depths.values()), 0) + 1;
+    const width = Math.max(slot - 1, 0);
+    const placements = nodes.map((node) => ({
+        id: node.id,
+        x: xs.get(node.id) ?? 0,
+        tier: depths.get(node.id) ?? 0,
+    }));
+    return { placements, width, tierCount };
+}
+/** Distance between tiers, in scene units. */
+const TIER_SPACING = 2.6;
+/** Distance between sibling slots, in scene units. */
+const SIBLING_SPACING = 2.0;
+/**
+ * The ranked layout in scene units: tiers down the screen, the graph
+ * centred, every node's radius scaled by its metric (uniform when none
+ * arrived — a mode pill that changes nothing on screen reads as broken).
+ *
+ * @param nodes - The graph.
+ * @returns Every node's place and radius, in the input's order.
+ */
+export function ranked_layout(nodes) {
+    const metrics = nodes.map((n) => n.metric ?? 0);
+    const metricPeak = Math.max(...metrics, 0);
+    const layout = rankedLayout_compute(nodes);
+    const slots = new Map(layout.placements.map((placement) => [placement.id, placement]));
+    return nodes.map((node) => {
+        const at = slots.get(node.id);
+        const x = ((at?.x ?? 0) - layout.width / 2) * SIBLING_SPACING;
+        const y = ((layout.tierCount - 1) / 2 - (at?.tier ?? 0)) * TIER_SPACING;
+        const metric = node.metric ?? 0;
+        const scale = metricPeak > 0 ? 0.55 + (metric / metricPeak) * 1.0 : 1;
+        const position = [x, y, 0];
+        return { id: node.id, position, radius: NODE_RADIUS * scale };
+    });
+}
+//# sourceMappingURL=ranked.js.map

package/dist/layout/ranked.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ranked.js","sourceRoot":"","sources":["../../src/layout/ranked.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,OAAO,EAAE,WAAW,EAAa,MAAM,YAAY,CAAC;AA0BpD;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAiC;IACpE,MAAM,IAAI,GAA6B,IAAI,GAAG,CAC5C,KAAK,CAAC,GAAG,CAAC,CAAC,IAAiB,EAAyB,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CACzE,CAAC;IAEF,yEAAyE;IACzE,yDAAyD;IACzD,MAAM,MAAM,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC9C,MAAM,UAAU,GAAG,CAAC,IAAiB,EAAE,KAAkB,EAAU,EAAE;QACnE,MAAM,KAAK,GAAuB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtD,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACtC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,IAAI,OAAO,GAAW,CAAC,CAAC;QACxB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACtC,MAAM,MAAM,GAA4B,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC3D,IAAI,MAAM;gBAAE,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAC7B,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAEtD,0EAA0E;IAC1E,wEAAwE;IACxE,8DAA8D;IAC9D,MAAM,QAAQ,GAA+B,IAAI,GAAG,EAAE,CAAC;IACvD,MAAM,KAAK,GAAkB,EAAE,CAAC;IAChC,MAAM,QAAQ,GAAG,CAAC,CAAc,EAAE,CAAc,EAAU,EAAE,CAC1D,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;IACzD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAuB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAU,EAAW,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9F,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACzD,MAAM,QAAQ,GAAkB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC3D,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACjC,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACrB,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAElE,sEAAsE;IACtE,oEAAoE;IACpE,MAAM,EAAE,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC1C,IAAI,IAAI,GAAW,CAAC,CAAC;IACrB,MAAM,IAAI,GAAgB,IAAI,GAAG,EAAE,CAAC;IACpC,MAAM,KAAK,GAAG,CAAC,IAAiB,EAAoB,EAAE;QACpD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,MAAM,IAAI,GAAkB,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;aACtD,MAAM,CAAC,CAAC,GAAgB,EAAW,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,GAAW,IAAI,EAAE,CAAC;YACzB,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACnB,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,KAAK,GAAW,MAAM,CAAC,iBAAiB,CAAC;QAC7C,IAAI,IAAI,GAAW,MAAM,CAAC,iBAAiB,CAAC;QAC5C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAqB,KAAK,CAAC,GAAG,CAAC,CAAC;YACjD,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC7B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;QACD,MAAM,CAAC,GAAW,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACrC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACnB,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACvB,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IACtC,gEAAgE;IAChE,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAE5D,MAAM,SAAS,GAAW,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1E,MAAM,KAAK,GAAW,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,MAAM,UAAU,GAAsB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAiB,EAAmB,EAAE,CAAC,CAAC;QACvF,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;QACvB,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;KAC/B,CAAC,CAAC,CAAC;IACJ,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;AAC1C,CAAC;AAED,8CAA8C;AAC9C,MAAM,YAAY,GAAW,GAAG,CAAC;AACjC,sDAAsD;AACtD,MAAM,eAAe,GAAW,GAAG,CAAC;AAOpC;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,KAAqC;IACjE,MAAM,OAAO,GAAa,KAAK,CAAC,GAAG,CAAC,CAAC,CAAkB,EAAU,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IACnF,MAAM,UAAU,GAAW,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC;IACnD,MAAM,MAAM,GAAiB,oBAAoB,CAAC,KAAK,CAAC,CAAC;IACzD,MAAM,KAAK,GAAiC,IAAI,GAAG,CACjD,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,SAA0B,EAA6B,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAC5G,CAAC;IACF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAqB,EAAE,EAAE;QACzC,MAAM,EAAE,GAAgC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3D,MAAM,CAAC,GAAW,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,eAAe,CAAC;QACtE,MAAM,CAAC,GAAW,CAAC,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;QAChF,MAAM,MAAM,GAAW,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACxC,MAAM,KAAK,GAAW,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,MAAM,QAAQ,GAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,GAAG,KAAK,EAAE,CAAC;IAChE,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/layout/registry.d.ts

@@ -0,0 +1,23 @@
+import type { LayoutEngine, LayoutNode } from './types.js';
+/**
+ * Every registered engine.
+ *
+ * @returns The engines, in offering order.
+ */
+export declare function layoutEngines_list(): ReadonlyArray<LayoutEngine>;
+/**
+ * One engine by name.
+ *
+ * @param id - The engine's id.
+ * @returns The engine, or undefined when none is registered by that name.
+ */
+export declare function layoutEngine_get(id: string): LayoutEngine | undefined;
+/**
+ * What an engine needs that the nodes do not carry: an attribute is missing
+ * when no node supplies it.
+ *
+ * @param engine - The engine.
+ * @param nodes - The nodes it would run on.
+ * @returns The missing attribute names; empty when the engine can run.
+ */
+export declare function layoutNeeds_missing(engine: LayoutEngine, nodes: ReadonlyArray<LayoutNode>): string[];

package/dist/layout/registry.js

@@ -0,0 +1,165 @@
+/**
+ * @file The layout engines a surface can offer, by name.
+ *
+ * Every engine keeps the same contract (`LayoutEngine`): a pure function of
+ * nodes and physics, answering positions. A LAYOUT block lists what is
+ * registered; an engine whose `needs` the surface cannot meet is offered
+ * greyed with the reason, never run on missing data.
+ *
+ * @module
+ */
+import { accretion_layout } from './accretion.js';
+import { constellations_layout } from './constellations.js';
+import { galaxy_layout } from './galaxy.js';
+import { hierarchy_layout } from './hierarchy.js';
+import { molecule_layout } from './molecule.js';
+import { ranked_layout } from './ranked.js';
+/** A layout node as the hierarchy engines read it. */
+function hierarchyNode_of(node) {
+    const out = { id: node.id, parents: node.parents, radius: node.radius, group: node.group };
+    if (node.seed !== undefined)
+        out.seed = node.seed;
+    if (node.frozen !== undefined)
+        out.frozen = node.frozen;
+    return out;
+}
+/** A node's metric, when the surface supplied one. */
+function metric_of(node) {
+    const metric = node.attrs?.['metric'];
+    return typeof metric === 'number' ? metric : undefined;
+}
+/** Positions from a list of places. */
+function positions_of(places) {
+    const out = {};
+    for (const place of places)
+        out[place.id] = place.position;
+    return out;
+}
+/** The galaxy: the whole space finds its own rest, from the spokes arrangement. */
+const galaxyEngine = {
+    id: 'galaxy',
+    label: 'GALAXY',
+    needs: [],
+    run: (input, progress) => ({ positions: galaxy_layout(input.nodes.map(hierarchyNode_of), input.physics, progress) }),
+};
+/** Spokes: every molecule a spoke from its anchor, its chain pointing out. */
+const spokesEngine = {
+    id: 'spokes',
+    label: 'SPOKES',
+    needs: [],
+    run: (input, progress) => ({ positions: hierarchy_layout(input.nodes.map(hierarchyNode_of), input.physics, progress, 'spokes') }),
+};
+/** Clumps: the molecules packed round their anchor. */
+const clumpsEngine = {
+    id: 'clumps',
+    label: 'CLUMPS',
+    needs: [],
+    run: (input, progress) => ({ positions: hierarchy_layout(input.nodes.map(hierarchyNode_of), input.physics, progress, 'clumps') }),
+};
+/** Ranked: tiers down the screen, the tree as a schematic. */
+const rankedEngine = {
+    id: 'ranked',
+    label: 'RANKED',
+    needs: [],
+    run: (input, progress) => {
+        const nodes = input.nodes.map((node) => {
+            const out = { id: node.id, parentIds: node.parents };
+            const metric = metric_of(node);
+            if (metric !== undefined)
+                out.metric = metric;
+            return out;
+        });
+        const positions = positions_of(ranked_layout(nodes));
+        progress(1);
+        return { positions };
+    },
+};
+/** Molecule: one graph finding its own shape, sized by its metric. */
+const moleculeEngine = {
+    id: 'molecule',
+    label: 'MOLECULE',
+    needs: [],
+    run: (input, progress) => {
+        const nodes = input.nodes.map((node) => {
+            const out = { id: node.id, parents: node.parents };
+            const metric = metric_of(node);
+            if (metric !== undefined)
+                out.metric = metric;
+            return out;
+        });
+        const seed = new Map();
+        const frozen = new Set();
+        for (const node of input.nodes) {
+            if (node.seed !== undefined)
+                seed.set(node.id, node.seed);
+            if (node.frozen === true)
+                frozen.add(node.id);
+        }
+        const positions = positions_of(molecule_layout(nodes, 3, seed, input.physics, frozen));
+        progress(1);
+        return { positions };
+    },
+};
+/**
+ * Constellations: every plugin a star placed by what runs with what, every
+ * feed's stages pulled to their plugins' stars. Needs each stage's plugin.
+ */
+const constellationsEngine = {
+    id: 'constellations',
+    label: 'CONSTELLATIONS',
+    needs: ['plugin'],
+    run: (input, progress) => ({ positions: constellations_layout(input.nodes, input.physics, progress) }),
+};
+/**
+ * Hubs: the galaxy's forces on a space hung from a tree of hubs the surface
+ * names (a hub under a hub, feeds under the deepest). The same settle as
+ * the galaxy, kept under its own name so a surface remembers each apart.
+ */
+const hubsEngine = {
+    id: 'hubs',
+    label: 'HUBS',
+    needs: [],
+    run: (input, progress) => ({ positions: galaxy_layout(input.nodes.map(hierarchyNode_of), input.physics, progress) }),
+};
+/**
+ * Accretion: feeds arrive oldest first and wander until they stick, to kin
+ * more readily than to strangers — the space grown as a coral. Needs each
+ * stage's plugin; a feed's creation time orders the growth when supplied.
+ */
+const accretionEngine = {
+    id: 'accretion',
+    label: 'ACCRETION',
+    needs: ['plugin'],
+    run: (input, progress) => accretion_layout(input.nodes, input.physics, progress),
+};
+/** Every engine, in the order a LAYOUT block offers them. */
+const ENGINES = [galaxyEngine, spokesEngine, clumpsEngine, constellationsEngine, hubsEngine, accretionEngine, rankedEngine, moleculeEngine];
+/**
+ * Every registered engine.
+ *
+ * @returns The engines, in offering order.
+ */
+export function layoutEngines_list() {
+    return ENGINES;
+}
+/**
+ * One engine by name.
+ *
+ * @param id - The engine's id.
+ * @returns The engine, or undefined when none is registered by that name.
+ */
+export function layoutEngine_get(id) {
+    return ENGINES.find((engine) => engine.id === id);
+}
+/**
+ * What an engine needs that the nodes do not carry: an attribute is missing
+ * when no node supplies it.
+ *
+ * @param engine - The engine.
+ * @param nodes - The nodes it would run on.
+ * @returns The missing attribute names; empty when the engine can run.
+ */
+export function layoutNeeds_missing(engine, nodes) {
+    return engine.needs.filter((need) => !nodes.some((node) => node.attrs?.[need] !== undefined));
+}
+//# sourceMappingURL=registry.js.map

package/dist/layout/registry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.js","sourceRoot":"","sources":["../../src/layout/registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAClD,OAAO,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,gBAAgB,EAAsB,MAAM,gBAAgB,CAAC;AACtE,OAAO,EAAE,eAAe,EAAqB,MAAM,eAAe,CAAC;AACnE,OAAO,EAAE,aAAa,EAAwB,MAAM,aAAa,CAAC;AAGlE,sDAAsD;AACtD,SAAS,gBAAgB,CAAC,IAAgB;IACxC,MAAM,GAAG,GAAkB,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;IAC1G,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;QAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IAClD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;QAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACxD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,sDAAsD;AACtD,SAAS,SAAS,CAAC,IAAgB;IACjC,MAAM,MAAM,GAAY,IAAI,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,CAAC;IAC/C,OAAO,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;AACzD,CAAC;AAED,uCAAuC;AACvC,SAAS,YAAY,CAAC,MAAqD;IACzE,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,KAAK,MAAM,KAAK,IAAI,MAAM;QAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC;IAC3D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mFAAmF;AACnF,MAAM,YAAY,GAAiB;IACjC,EAAE,EAAE,QAAQ;IACZ,KAAK,EAAE,QAAQ;IACf,KAAK,EAAE,EAAE;IACT,GAAG,EAAE,CAAC,KAAkB,EAAE,QAAoC,EAAgB,EAAE,CAC9E,CAAC,EAAE,SAAS,EAAE,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;CAC7F,CAAC;AAEF,8EAA8E;AAC9E,MAAM,YAAY,GAAiB;IACjC,EAAE,EAAE,QAAQ;IACZ,KAAK,EAAE,QAAQ;IACf,KAAK,EAAE,EAAE;IACT,GAAG,EAAE,CAAC,KAAkB,EAAE,QAAoC,EAAgB,EAAE,CAC9E,CAAC,EAAE,SAAS,EAAE,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;CAC1G,CAAC;AAEF,uDAAuD;AACvD,MAAM,YAAY,GAAiB;IACjC,EAAE,EAAE,QAAQ;IACZ,KAAK,EAAE,QAAQ;IACf,KAAK,EAAE,EAAE;IACT,GAAG,EAAE,CAAC,KAAkB,EAAE,QAAoC,EAAgB,EAAE,CAC9E,CAAC,EAAE,SAAS,EAAE,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;CAC1G,CAAC;AAEF,8DAA8D;AAC9D,MAAM,YAAY,GAAiB;IACjC,EAAE,EAAE,QAAQ;IACZ,KAAK,EAAE,QAAQ;IACf,KAAK,EAAE,EAAE;IACT,GAAG,EAAE,CAAC,KAAkB,EAAE,QAAoC,EAAgB,EAAE;QAC9E,MAAM,KAAK,GAAsB,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAgB,EAAmB,EAAE;YACrF,MAAM,GAAG,GAAoB,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;YACtE,MAAM,MAAM,GAAuB,SAAS,CAAC,IAAI,CAAC,CAAC;YACnD,IAAI,MAAM,KAAK,SAAS;gBAAE,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC;YAC9C,OAAO,GAAG,CAAC;QACb,CAAC,CAAC,CAAC;QACH,MAAM,SAAS,GAAc,YAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;QAChE,QAAQ,CAAC,CAAC,CAAC,CAAC;QACZ,OAAO,EAAE,SAAS,EAAE,CAAC;IACvB,CAAC;CACF,CAAC;AAEF,sEAAsE;AACtE,MAAM,cAAc,GAAiB;IACnC,EAAE,EAAE,UAAU;IACd,KAAK,EAAE,UAAU;IACjB,KAAK,EAAE,EAAE;IACT,GAAG,EAAE,CAAC,KAAkB,EAAE,QAAoC,EAAgB,EAAE;QAC9E,MAAM,KAAK,GAAmB,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAgB,EAAgB,EAAE;YAC/E,MAAM,GAAG,GAAiB,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,MAAM,GAAuB,SAAS,CAAC,IAAI,CAAC,CAAC;YACnD,IAAI,MAAM,KAAK,SAAS;gBAAE,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC;YAC9C,OAAO,GAAG,CAAC;QACb,CAAC,CAAC,CAAC;QACH,MAAM,IAAI,GAAsB,IAAI,GAAG,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAgB,IAAI,GAAG,EAAE,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;gBAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1D,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC;QACD,MAAM,SAAS,GAAc,YAAY,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;QAClG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACZ,OAAO,EAAE,SAAS,EAAE,CAAC;IACvB,CAAC;CACF,CAAC;AAEF;;;GAGG;AACH,MAAM,oBAAoB,GAAiB;IACzC,EAAE,EAAE,gBAAgB;IACpB,KAAK,EAAE,gBAAgB;IACvB,KAAK,EAAE,CAAC,QAAQ,CAAC;IACjB,GAAG,EAAE,CAAC,KAAkB,EAAE,QAAoC,EAAgB,EAAE,CAC9E,CAAC,EAAE,SAAS,EAAE,qBAAqB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;CAC/E,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,GAAiB;IAC/B,EAAE,EAAE,MAAM;IACV,KAAK,EAAE,MAAM;IACb,KAAK,EAAE,EAAE;IACT,GAAG,EAAE,CAAC,KAAkB,EAAE,QAAoC,EAAgB,EAAE,CAC9E,CAAC,EAAE,SAAS,EAAE,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;CAC7F,CAAC;AAEF;;;;GAIG;AACH,MAAM,eAAe,GAAiB;IACpC,EAAE,EAAE,WAAW;IACf,KAAK,EAAE,WAAW;IAClB,KAAK,EAAE,CAAC,QAAQ,CAAC;IACjB,GAAG,EAAE,CAAC,KAAkB,EAAE,QAAoC,EAAgB,EAAE,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC;CACxI,CAAC;AAEF,6DAA6D;AAC7D,MAAM,OAAO,GAAgC,CAAC,YAAY,EAAE,YAAY,EAAE,YAAY,EAAE,oBAAoB,EAAE,UAAU,EAAE,eAAe,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;AAEzK;;;;GAIG;AACH,MAAM,UAAU,kBAAkB;IAChC,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAAU;IACzC,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,MAAoB,EAAW,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;AAC3E,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAAoB,EAAE,KAAgC;IACxF,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAgB,EAAW,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC;AACtI,CAAC"}

package/dist/layout/seeded.d.ts

@@ -0,0 +1,32 @@
+/**
+ * @file Chance that comes out the same every time.
+ *
+ * A layout that turns each molecule at random, so like feeds do not stand
+ * as clones, still owes the operator the same space on every device and
+ * every visit. The turn is seeded by the molecule itself — a hash of its
+ * key — so it is fixed for that molecule, and a molecule arriving later
+ * turns no other.
+ *
+ * @module
+ */
+/**
+ * A 32-bit FNV-1a hash of a string.
+ *
+ * @param text - What to hash.
+ * @returns The hash, an unsigned 32-bit integer.
+ */
+export declare function hash_of(text: string): number;
+/**
+ * A seeded source of numbers in [0, 1): a linear congruential generator.
+ *
+ * @param seed - The seed.
+ * @returns The next number each time it is called.
+ */
+export declare function random_seeded(seed: number): () => number;
+/**
+ * The source a molecule draws its chance from: seeded by its own key.
+ *
+ * @param key - The molecule's key (its group).
+ * @returns A source that runs the same way every time for that key.
+ */
+export declare function randomFor_key(key: string): () => number;

package/dist/layout/seeded.js

@@ -0,0 +1,48 @@
+/**
+ * @file Chance that comes out the same every time.
+ *
+ * A layout that turns each molecule at random, so like feeds do not stand
+ * as clones, still owes the operator the same space on every device and
+ * every visit. The turn is seeded by the molecule itself — a hash of its
+ * key — so it is fixed for that molecule, and a molecule arriving later
+ * turns no other.
+ *
+ * @module
+ */
+/**
+ * A 32-bit FNV-1a hash of a string.
+ *
+ * @param text - What to hash.
+ * @returns The hash, an unsigned 32-bit integer.
+ */
+export function hash_of(text) {
+    let hash = 0x811c9dc5;
+    for (let i = 0; i < text.length; i++) {
+        hash ^= text.charCodeAt(i);
+        hash = Math.imul(hash, 0x01000193);
+    }
+    return hash >>> 0;
+}
+/**
+ * A seeded source of numbers in [0, 1): a linear congruential generator.
+ *
+ * @param seed - The seed.
+ * @returns The next number each time it is called.
+ */
+export function random_seeded(seed) {
+    let state = seed >>> 0;
+    return () => {
+        state = (Math.imul(state, 1664525) + 1013904223) >>> 0;
+        return state / 4294967296;
+    };
+}
+/**
+ * The source a molecule draws its chance from: seeded by its own key.
+ *
+ * @param key - The molecule's key (its group).
+ * @returns A source that runs the same way every time for that key.
+ */
+export function randomFor_key(key) {
+    return random_seeded(hash_of(key));
+}
+//# sourceMappingURL=seeded.js.map

package/dist/layout/seeded.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"seeded.js","sourceRoot":"","sources":["../../src/layout/seeded.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAC,IAAY;IAClC,IAAI,IAAI,GAAW,UAAU,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,CAAC;AACpB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,IAAI,KAAK,GAAW,IAAI,KAAK,CAAC,CAAC;IAC/B,OAAO,GAAW,EAAE;QAClB,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QACvD,OAAO,KAAK,GAAG,UAAU,CAAC;IAC5B,CAAC,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,GAAW;IACvC,OAAO,aAAa,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;AACrC,CAAC"}

package/dist/layout/types.d.ts

@@ -0,0 +1,81 @@
+/**
+ * @file The layout layer's vocabulary: a point in the space, the physics a
+ * settle honours, and the contract every layout engine keeps.
+ *
+ * Nothing here knows what a node stands for. A surface translates its own
+ * domain into these shapes; an engine answers with positions.
+ *
+ * @module
+ */
+import type { Positions, Vec3 } from '../types/space.js';
+export type { Positions, Vec3 };
+/**
+ * The terms a settle honours.
+ *
+ * @property charge - Nodes repel, heavier ones harder.
+ * @property link - An edge holds its ends at the sum of their radii.
+ * @property collide - Nodes do not overlap.
+ * @property gravity - A mass-weighted pull to the centre.
+ * @property reach - How far a node's repulsion carries; unbounded when
+ *   absent. A sparse graph settles as wide as its charge carries, so a
+ *   bounded reach lets a small molecule hug itself while a crowd spreads.
+ */
+export interface PhysicsTerms {
+    charge: boolean;
+    link: boolean;
+    collide: boolean;
+    gravity: boolean;
+    reach?: number;
+}
+/** The terms a settle takes when nobody says otherwise. */
+export declare const PHYSICS_DEFAULT: PhysicsTerms;
+/** The radius a node's size is scaled against. */
+export declare const NODE_RADIUS: number;
+/**
+ * One node an engine places.
+ *
+ * @property id - Its id.
+ * @property parents - Its parents' ids, joins included.
+ * @property radius - The room it takes.
+ * @property group - The molecule it belongs to, or null for a node that
+ *   stands alone (an anchor).
+ * @property seed - Where it stood last, if anywhere.
+ * @property frozen - Holds still at its seed.
+ * @property attrs - What an engine that `needs` more reads: plugins, data
+ *   kind, creation time — whatever the surface supplied.
+ */
+export interface LayoutNode {
+    id: string;
+    parents: string[];
+    radius: number;
+    group: string | null;
+    seed?: Vec3;
+    frozen?: boolean;
+    attrs?: Record<string, number | string | string[]>;
+}
+/** What an engine is given. */
+export interface LayoutInput {
+    nodes: LayoutNode[];
+    physics: PhysicsTerms;
+}
+/** What an engine answers: every node's place, and optionally when each arrived. */
+export interface LayoutResult {
+    positions: Positions;
+    /** The moment each node joined, for a replay; absent for a layout with no history. */
+    arrival?: Record<string, number>;
+}
+/**
+ * A layout engine: a pure function of its input, run off the page.
+ *
+ * @property id - Its name on the LAYOUT block and in `layout <id>`.
+ * @property label - What the block shows.
+ * @property needs - Node attributes it reads; an engine whose needs the
+ *   surface cannot meet is offered greyed, with the reason, never run.
+ * @property run - Places every node, telling `progress` how far it has come.
+ */
+export interface LayoutEngine {
+    id: string;
+    label: string;
+    needs: ReadonlyArray<string>;
+    run(input: LayoutInput, progress: (fraction: number) => void): LayoutResult;
+}

package/dist/layout/types.js

@@ -0,0 +1,14 @@
+/**
+ * @file The layout layer's vocabulary: a point in the space, the physics a
+ * settle honours, and the contract every layout engine keeps.
+ *
+ * Nothing here knows what a node stands for. A surface translates its own
+ * domain into these shapes; an engine answers with positions.
+ *
+ * @module
+ */
+/** The terms a settle takes when nobody says otherwise. */
+export const PHYSICS_DEFAULT = { charge: true, link: true, collide: true, gravity: false };
+/** The radius a node's size is scaled against. */
+export const NODE_RADIUS = 0.55;
+//# sourceMappingURL=types.js.map

package/dist/layout/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/layout/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAyBH,2DAA2D;AAC3D,MAAM,CAAC,MAAM,eAAe,GAAiB,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AAEzG,kDAAkD;AAClD,MAAM,CAAC,MAAM,WAAW,GAAW,IAAI,CAAC"}

package/dist/scene/index.d.ts

@@ -0,0 +1,6 @@
+/**
+ * @file The scene's public face: the orrery a surface mounts.
+ *
+ * @module
+ */
+export * from './orrery.js';

package/dist/scene/index.js

@@ -0,0 +1,7 @@
+/**
+ * @file The scene's public face: the orrery a surface mounts.
+ *
+ * @module
+ */
+export * from './orrery.js';
+//# sourceMappingURL=index.js.map

package/dist/scene/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/scene/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,cAAc,aAAa,CAAC"}