@wrenautomation/orrery 0.0.0-stage → 0.24.1

package/LICENSE.md

@@ -0,0 +1,61 @@
+# PolyForm Strict License 1.0.0
+
+<https://polyformproject.org/licenses/strict/1.0.0>
+
+## Acceptance
+
+In order to get any license under these terms, you must agree to them as both strict obligations and conditions to all your licenses.
+
+## Copyright License
+
+The licensor grants you a copyright license for the software to do everything you might do with the software that would otherwise infringe the licensor's copyright in it for any permitted purpose, other than distributing the software or making changes or new works based on the software.
+
+## Patent License
+
+The licensor grants you a patent license for the software that covers patent claims the licensor can license, or becomes able to license, that you would infringe by using the software.
+
+## Noncommercial Purposes
+
+Any noncommercial purpose is a permitted purpose.
+
+## Personal Uses
+
+Personal use for research, experiment, and testing for the benefit of public knowledge, personal study, private entertainment, hobby projects, amateur pursuits, or religious observance, without any anticipated commercial application, is use for a permitted purpose.
+
+## Noncommercial Organizations
+
+Use by any charitable organization, educational institution, public research organization, public safety or health organization, environmental protection organization, or government institution is use for a permitted purpose regardless of the source of funding or obligations resulting from the funding.
+
+## Fair Use
+
+You may have "fair use" rights for the software under the law. These terms do not limit them.
+
+## No Other Rights
+
+These terms do not allow you to sublicense or transfer any of your licenses to anyone else, or prevent the licensor from granting licenses to anyone else.  These terms do not imply any other licenses.
+
+## Patent Defense
+
+If you make any written claim that the software infringes or contributes to infringement of any patent, your patent license for the software granted under these terms ends immediately. If your company makes such a claim, your patent license ends immediately for work on behalf of your company.
+
+## Violations
+
+The first time you are notified in writing that you have violated any of these terms, or done anything with the software not covered by your licenses, your licenses can nonetheless continue if you come into full compliance with these terms, and take practical steps to correct past violations, within 32 days of receiving notice.  Otherwise, all your licenses end immediately.
+
+## No Liability
+
+***As far as the law allows, the software comes as is, without any warranty or condition, and the licensor will not be liable to you for any damages arising out of these terms or the use or nature of the software, under any kind of legal claim.***
+
+## Definitions
+
+The **licensor** is the individual or entity offering these terms, and the **software** is the software the licensor makes available under these terms.
+
+**You** refers to the individual or entity agreeing to these terms.
+
+**Your company** is any legal entity, sole proprietorship, or other kind of organization that you work for, plus all organizations that have control over, are under the control of, or are under common control with that organization.  **Control** means ownership of substantially all the assets of an entity, or the power to direct its management and policies by vote, contract, or otherwise.  Control can be direct or indirect.
+
+**Your licenses** are all the licenses granted to you for the software under these terms.
+
+**Use** means anything you do with the software requiring one of your licenses.
+
+Required Notice: Copyright 2026 William Jin (https://wrenautomation.com)

package/README.md

@@ -1,3 +1,23 @@
-# Temporary Holding Version
+# orrery
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+The logic of a map you fold. No renderer, no framework: each map draws its own frames.
+
+- `tree`: the fold tree. A depth cut, plus nodes opened or closed by hand. `openSet`, `toggle`, `reveal`, `stepDepth`, `fullDepth`.
+- `nest`: nested layout over an engine you pass (ELK, a grid, your own). Open containers are sized by their kids. Positions add up to the root. A cache re-lays only the changed path.
+- `glide`: the motion between two frames. Marks that stay slide, new ones grow out of an anchor, gone ones shrink into it. `Marks` says which elements are marks.
+
+Depends on nothing. Runs in a browser: `glide` measures the DOM and uses the Web Animations API.
+
+```sh
+npm i @wrenautomation/orrery
+```
+
+```ts
+import { nest, openSet } from "@wrenautomation/orrery";
+
+const open = openSet(nodes, { depth: 1, open: { "pkg:core": true } });
+const map = await nest({ nodes, root: "repo", open, size, pad, engine: myLayout });
+// map.boxes: absolute, parents first. map.levels: each open container's own layout.
+```
+
+Used by kestrel's viewer and wren's metro map.

package/dist/glide.d.ts

@@ -0,0 +1,63 @@
+/**
+ * The glide between two frames of a map (a depth step, a node opened or folded), from wren's metro
+ * map. Marks that stay slide and scale to their new place, marks that appear grow out of the
+ * anchor, marks that go shrink into it. Imperative: it measures the DOM after the renderer
+ * commits and uses the Web Animations API, so it costs no re-render. Which elements are marks is
+ * the renderer's (`Marks`).
+ */
+export type Point = readonly [x: number, y: number];
+export declare const GLIDE_MS: {
+    readonly move: 460;
+    readonly fade: 180;
+    readonly shrink: 380;
+};
+export interface Marks {
+    /** Selector for every element that can glide. */
+    select: string;
+    /** Its key across frames. Null: it cannot glide. */
+    key(el: Element): string | null;
+    /** Selector for lines and other parts that fade in under the marks. */
+    fresh?: string;
+    /** Keys that keep their width (metro's hub). */
+    fixedWidth?(key: string): boolean;
+    /** Map units in one screen px for a frame: a transform on a mark is in its map's units. */
+    units?(frame: Element): number;
+}
+export interface Box {
+    n: Element & ElementCSSInlineStyle;
+    x: number;
+    y: number;
+    w: number;
+    h: number;
+}
+/** Every mark of a frame, with its centre and size on the screen, in screen px. */
+export declare function snapshot(frame: Element | null | undefined, marks: Marks): Map<string, Box>;
+/** The centre of an element on the screen: where a group grows from. */
+export declare function centreOf(n: Element | null): Point | null;
+/**
+ * Play the new frame from `before` (a snapshot taken before the renderer committed). Same-DOM
+ * renderers (a FLIP) call this; marks that went are already gone. Returns the glide's length in ms.
+ */
+export declare function play(o: {
+    before: Map<string, Box>;
+    next: Element;
+    marks: Marks;
+    anchor?: Point | null | undefined;
+    anchorKey?: string | null | undefined;
+}): number;
+/**
+ * Glide from `old` (a copy of the last frame, laid over the map) to `next` (the live frame).
+ * Marks that go shrink into the anchor; the rest of the old frame fades. Returns how long the old
+ * frame must stay, in ms.
+ */
+export declare function glide(o: {
+    old: Element;
+    next: Element;
+    marks: Marks;
+    anchor?: Point | null | undefined;
+    anchorKey?: string | null | undefined;
+}): number;
+/** Fade the new frame in when there is nothing to glide from (reduced motion). */
+export declare function fadeIn(next: Element): void;
+/** The map's own height eases between two frames. */
+export declare function glideHeight(host: HTMLElement, from: number, to: number): void;

package/dist/glide.js

@@ -0,0 +1,144 @@
+/**
+ * The glide between two frames of a map (a depth step, a node opened or folded), from wren's metro
+ * map. Marks that stay slide and scale to their new place, marks that appear grow out of the
+ * anchor, marks that go shrink into it. Imperative: it measures the DOM after the renderer
+ * commits and uses the Web Animations API, so it costs no re-render. Which elements are marks is
+ * the renderer's (`Marks`).
+ */
+const EASE = "cubic-bezier(.22,1,.36,1)";
+export const GLIDE_MS = { move: 460, fade: 180, shrink: 380 };
+/** Whether this environment can measure and animate. happy-dom cannot. */
+const canGlide = (n) => typeof n.getBoundingClientRect === "function" && typeof n.animate === "function";
+/** Every mark of a frame, with its centre and size on the screen, in screen px. */
+export function snapshot(frame, marks) {
+    const out = new Map();
+    if (!frame)
+        return out;
+    for (const n of frame.querySelectorAll(marks.select)) {
+        const k = marks.key(n);
+        if (!k || !canGlide(n))
+            continue;
+        const b = n.getBoundingClientRect();
+        out.set(k, { n, x: b.left + b.width / 2, y: b.top + b.height / 2, w: b.width, h: b.height });
+    }
+    return out;
+}
+/** The centre of an element on the screen: where a group grows from. */
+export function centreOf(n) {
+    if (!n || typeof n.getBoundingClientRect !== "function")
+        return null;
+    const b = n.getBoundingClientRect();
+    return [b.left + b.width / 2, b.top + b.height / 2];
+}
+/** SVG: from the screen matrix. Else 1; an HTML renderer under a scale passes its own. */
+function svgUnits(frame) {
+    const a = frame.getScreenCTM?.()?.a;
+    return a ? 1 / a : 1;
+}
+const origin = (n) => {
+    n.style.transformBox = "fill-box";
+    n.style.transformOrigin = "center";
+};
+/**
+ * Play the new frame from `before` (a snapshot taken before the renderer committed). Same-DOM
+ * renderers (a FLIP) call this; marks that went are already gone. Returns the glide's length in ms.
+ */
+export function play(o) {
+    const after = snapshot(o.next, o.marks);
+    const k = (o.marks.units ?? svgUnits)(o.next);
+    const to = o.anchorKey ? after.get(o.anchorKey) : undefined;
+    const anchor = to ? [to.x, to.y] : (o.anchor ?? null);
+    if (o.marks.fresh)
+        for (const n of o.next.querySelectorAll(o.marks.fresh))
+            n.animate?.([{ opacity: 0 }, { opacity: 1 }], {
+                duration: 320,
+                delay: 80,
+                easing: "ease-out",
+                fill: "backwards",
+            });
+    for (const [key, a] of after) {
+        const prev = o.before.get(key);
+        origin(a.n);
+        if (prev) {
+            const sx = o.marks.fixedWidth?.(key) ? 1 : prev.w / a.w;
+            const sy = prev.h / a.h;
+            const moved = Math.abs(prev.x - a.x) > 0.5 || Math.abs(prev.y - a.y) > 0.5;
+            if (moved || Math.abs(sy - 1) > 0.02 || Math.abs(sx - 1) > 0.02)
+                a.n.animate([
+                    {
+                        transform: `translate(${(prev.x - a.x) * k}px,${(prev.y - a.y) * k}px) scale(${Math.abs(sx - 1) > 0.02 ? sx : 1},${Math.abs(sy - 1) > 0.02 ? sy : 1})`,
+                    },
+                    { transform: "none" },
+                ], { duration: GLIDE_MS.move, easing: EASE });
+        }
+        else if (a !== to) {
+            // It grows out of the anchor, the way a closing mark goes back in.
+            const [ax, ay] = anchor ?? [a.x, a.y];
+            a.n.animate([
+                { opacity: 0, transform: `translate(${(ax - a.x) * k}px,${(ay - a.y) * k}px) scale(.4)` },
+                { opacity: 1, transform: "none" },
+            ], { duration: GLIDE_MS.move, delay: 40, easing: EASE, fill: "backwards" });
+        }
+        else {
+            // The mark a group folds into fills in as its kids reach it.
+            a.n.animate([
+                { opacity: 0, transform: "scale(.6)" },
+                { opacity: 1, transform: "none" },
+            ], { duration: GLIDE_MS.move, delay: GLIDE_MS.shrink * 0.4, easing: EASE, fill: "backwards" });
+        }
+    }
+    return GLIDE_MS.move;
+}
+/**
+ * Glide from `old` (a copy of the last frame, laid over the map) to `next` (the live frame).
+ * Marks that go shrink into the anchor; the rest of the old frame fades. Returns how long the old
+ * frame must stay, in ms.
+ */
+export function glide(o) {
+    const before = snapshot(o.old, o.marks);
+    const after = snapshot(o.next, o.marks);
+    const kOld = (o.marks.units ?? svgUnits)(o.old);
+    const to = o.anchorKey ? after.get(o.anchorKey) : undefined;
+    const anchor = to ? [to.x, to.y] : (o.anchor ?? null);
+    const gone = [...before].filter(([k]) => !after.has(k)).map(([, b]) => b);
+    for (const [k, b] of before)
+        if (after.has(k))
+            b.n.style.opacity = "0";
+    const goneSet = new Set(gone.map((b) => b.n));
+    for (const c of o.old.children) {
+        if (goneSet.has(c) || gone.some((b) => c.contains(b.n)))
+            continue;
+        c.animate?.([{ opacity: 1 }, { opacity: 0 }], {
+            duration: GLIDE_MS.fade,
+            easing: "ease-out",
+            fill: "forwards",
+        });
+    }
+    for (const b of gone) {
+        const [ax, ay] = anchor ?? [b.x, b.y];
+        origin(b.n);
+        b.n.animate([
+            { opacity: 1, transform: "none" },
+            {
+                opacity: 0,
+                transform: `translate(${(ax - b.x) * kOld}px,${(ay - b.y) * kOld}px) scale(.4)`,
+            },
+        ], { duration: GLIDE_MS.shrink, easing: EASE, fill: "forwards" });
+    }
+    play({ before, next: o.next, marks: o.marks, anchor, anchorKey: o.anchorKey });
+    return gone.length ? GLIDE_MS.shrink : GLIDE_MS.fade;
+}
+/** Fade the new frame in when there is nothing to glide from (reduced motion). */
+export function fadeIn(next) {
+    next.animate?.([{ opacity: 0 }, { opacity: 1 }], { duration: 200 });
+}
+/** The map's own height eases between two frames. */
+export function glideHeight(host, from, to) {
+    if (from === to)
+        return;
+    host.animate?.([{ height: `${from}px` }, { height: `${to}px` }], {
+        duration: GLIDE_MS.move,
+        easing: EASE,
+    });
+}
+//# sourceMappingURL=glide.js.map

package/dist/glide.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"glide.js","sourceRoot":"","sources":["../src/glide.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,MAAM,IAAI,GAAG,2BAA2B,CAAC;AACzC,MAAM,CAAC,MAAM,QAAQ,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAW,CAAC;AAuBvE,0EAA0E;AAC1E,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAE,EAAE,CAC9B,OAAO,CAAC,CAAC,qBAAqB,KAAK,UAAU,IAAI,OAAO,CAAC,CAAC,OAAO,KAAK,UAAU,CAAC;AAEnF,mFAAmF;AACnF,MAAM,UAAU,QAAQ,CAAC,KAAiC,EAAE,KAAY;IACtE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAe,CAAC;IACnC,IAAI,CAAC,KAAK;QAAE,OAAO,GAAG,CAAC;IACvB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,gBAAgB,CAAkC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;QACtF,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,SAAS;QACjC,MAAM,CAAC,GAAG,CAAC,CAAC,qBAAqB,EAAE,CAAC;QACpC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,QAAQ,CAAC,CAAiB;IACxC,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,qBAAqB,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC;IACrE,MAAM,CAAC,GAAG,CAAC,CAAC,qBAAqB,EAAE,CAAC;IACpC,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,0FAA0F;AAC1F,SAAS,QAAQ,CAAC,KAAc;IAC9B,MAAM,CAAC,GAAI,KAAuB,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,CAAC;IACvD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,CAAwB,EAAE,EAAE;IAC1C,CAAC,CAAC,KAAK,CAAC,YAAY,GAAG,UAAU,CAAC;IAClC,CAAC,CAAC,KAAK,CAAC,eAAe,GAAG,QAAQ,CAAC;AACrC,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,IAAI,CAAC,CAMpB;IACC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC9C,MAAM,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,MAAM,MAAM,GAAiB,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC;IACpE,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK;QACf,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;YACpD,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE;gBAC5C,QAAQ,EAAE,GAAG;gBACb,KAAK,EAAE,EAAE;gBACT,MAAM,EAAE,UAAU;gBAClB,IAAI,EAAE,WAAW;aAClB,CAAC,CAAC;IACP,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxD,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YAC3E,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI;gBAC7D,CAAC,CAAC,CAAC,CAAC,OAAO,CACT;oBACE;wBACE,SAAS,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG;qBACvJ;oBACD,EAAE,SAAS,EAAE,MAAM,EAAE;iBACtB,EACD,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAC1C,CAAC;QACN,CAAC;aAAM,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YACpB,mEAAmE;YACnE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC,CAAC,OAAO,CACT;gBACE,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,aAAa,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,eAAe,EAAE;gBACzF,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE;aAClC,EACD,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,CACxE,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,6DAA6D;YAC7D,CAAC,CAAC,CAAC,CAAC,OAAO,CACT;gBACE,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE;gBACtC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE;aAClC,EACD,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,GAAG,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,CAC3F,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,CAAC;AACvB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAC,CAMrB;IACC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChD,MAAM,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,MAAM,MAAM,GAAiB,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC;IACpE,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1E,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM;QAAE,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,GAAG,GAAG,CAAC;IACvE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAU,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAE,SAAS;QAClE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE;YAC5C,QAAQ,EAAE,QAAQ,CAAC,IAAI;YACvB,MAAM,EAAE,UAAU;YAClB,IAAI,EAAE,UAAU;SACjB,CAAC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACZ,CAAC,CAAC,CAAC,CAAC,OAAO,CACT;YACE,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE;YACjC;gBACE,OAAO,EAAE,CAAC;gBACV,SAAS,EAAE,aAAa,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,eAAe;aAChF;SACF,EACD,EAAE,QAAQ,EAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,CAC9D,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;IAC/E,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;AACvD,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,MAAM,CAAC,IAAa;IAClC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;AACtE,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,WAAW,CAAC,IAAiB,EAAE,IAAY,EAAE,EAAU;IACrE,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO;IACxB,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE;QAC/D,QAAQ,EAAE,QAAQ,CAAC,IAAI;QACvB,MAAM,EAAE,IAAI;KACb,CAAC,CAAC;AACL,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+export * from "./glide.js";
+export * from "./nest.js";
+export * from "./tree.js";

package/dist/index.js

@@ -0,0 +1,4 @@
+export * from "./glide.js";
+export * from "./nest.js";
+export * from "./tree.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC"}

package/dist/nest.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Nested layout over a fold: each open container lays out its kids once, an open kid's size is its
+ * own layout plus padding, and positions add up to the root. The engine is the caller's (ELK,
+ * a grid, metro's placement): orrery only orders the calls, sizes the containers and caches.
+ */
+import type { FoldNode } from "./tree.js";
+export interface Size {
+    w: number;
+    h: number;
+}
+/** A kid as the engine gets it: open kids are sized by their own layout. */
+export interface Kid extends Size {
+    id: string;
+    open: boolean;
+}
+/** One container's layout, kid positions relative to its content box. `extra`: the engine's own (edge routes). */
+export interface Laid<T = unknown> extends Size {
+    at: Readonly<Record<string, readonly [x: number, y: number]>>;
+    extra?: T;
+}
+export type Engine<T> = (container: string, kids: readonly Kid[]) => Promise<Laid<T>>;
+/** Room an open container keeps around its kids: a title bar on top. */
+export interface Pad {
+    top: number;
+    side: number;
+    bottom: number;
+}
+/** A box on the canvas, absolute. `parent`: the open container it is drawn in. */
+export interface Placed extends Size {
+    id: string;
+    x: number;
+    y: number;
+    open: boolean;
+    parent?: string;
+}
+/** An open container's layout, with the absolute origin of its content box. */
+export interface Level<T> {
+    id: string;
+    x: number;
+    y: number;
+    laid: Laid<T>;
+}
+export interface Nested<T> extends Size {
+    /** Parents before their kids. */
+    boxes: Placed[];
+    levels: Level<T>[];
+}
+/** Layouts by container and input; a fold re-lays only the containers on the changed path. */
+export type NestCache<T> = Map<string, Laid<T>>;
+export declare function nest<T>(o: {
+    nodes: readonly FoldNode[];
+    /** The container drawn as the canvas: always laid out, never a box. Its kids name it as parent. */
+    root: string;
+    /** From `openSet`: the containers that show open. */
+    open: ReadonlySet<string>;
+    /** A closed box's size. */
+    size(id: string): Size;
+    pad: Pad;
+    engine: Engine<T>;
+    cache?: NestCache<T>;
+}): Promise<Nested<T>>;

package/dist/nest.js

@@ -0,0 +1,50 @@
+export async function nest(o) {
+    const kids = new Map();
+    for (const n of o.nodes)
+        if (n.parent)
+            (kids.get(n.parent) ?? kids.set(n.parent, []).get(n.parent))?.push(n.id);
+    const opens = (id) => o.open.has(id) && (kids.get(id)?.length ?? 0) > 0;
+    const laid = new Map();
+    const lay = async (id) => {
+        const list = await Promise.all((kids.get(id) ?? []).map(async (k) => {
+            if (!opens(k))
+                return { id: k, ...o.size(k), open: false };
+            const in_ = await lay(k);
+            return {
+                id: k,
+                w: Math.max(o.size(k).w, in_.w + 2 * o.pad.side),
+                h: in_.h + o.pad.top + o.pad.bottom,
+                open: true,
+            };
+        }));
+        const key = `${id}\0${JSON.stringify(list)}`;
+        const hit = o.cache?.get(key) ?? (await o.engine(id, list));
+        o.cache?.set(key, hit);
+        laid.set(id, hit);
+        return hit;
+    };
+    const top = await lay(o.root);
+    const boxes = [];
+    const levels = [];
+    const place = (id, x, y, parent) => {
+        const l = laid.get(id);
+        levels.push({ id, x, y, laid: l });
+        for (const k of kids.get(id) ?? []) {
+            const [kx, ky] = l.at[k] ?? [0, 0];
+            const open = opens(k);
+            const inner = open ? laid.get(k) : undefined;
+            const s = inner
+                ? {
+                    w: Math.max(o.size(k).w, inner.w + 2 * o.pad.side),
+                    h: inner.h + o.pad.top + o.pad.bottom,
+                }
+                : o.size(k);
+            boxes.push({ id: k, x: x + kx, y: y + ky, ...s, open, ...(parent ? { parent } : {}) });
+            if (inner)
+                place(k, x + kx + (s.w - inner.w) / 2, y + ky + o.pad.top, k);
+        }
+    };
+    place(o.root, 0, 0);
+    return { w: top.w, h: top.h, boxes, levels };
+}
+//# sourceMappingURL=nest.js.map

package/dist/nest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nest.js","sourceRoot":"","sources":["../src/nest.ts"],"names":[],"mappings":"AA2DA,MAAM,CAAC,KAAK,UAAU,IAAI,CAAI,CAW7B;IACC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK;QACrB,IAAI,CAAC,CAAC,MAAM;YAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACzF,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAChF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAmB,CAAC;IAExC,MAAM,GAAG,GAAG,KAAK,EAAE,EAAU,EAAoB,EAAE;QACjD,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,GAAG,CAC5B,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAgB,EAAE;YACjD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;YAC3D,MAAM,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO;gBACL,EAAE,EAAE,CAAC;gBACL,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;gBAChD,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM;gBACnC,IAAI,EAAE,IAAI;aACX,CAAC;QACJ,CAAC,CAAC,CACH,CAAC;QACF,MAAM,GAAG,GAAG,GAAG,EAAE,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7C,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAClB,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,MAAM,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAE9B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,CAAS,EAAE,CAAS,EAAE,MAAe,EAAE,EAAE;QAClE,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAY,CAAC;QAClC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACnC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAa,CAAC,CAAC,CAAC,SAAS,CAAC;YAC1D,MAAM,CAAC,GAAG,KAAK;gBACb,CAAC,CAAC;oBACE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;oBAClD,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM;iBACtC;gBACH,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACvF,IAAI,KAAK;gBAAE,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC,CAAC;IACF,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,OAAO,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AAC/C,CAAC"}

package/dist/tree.d.ts

@@ -0,0 +1,42 @@
+/**
+ * The fold tree (from wren's metro map, designs/2026-10-23-metro-fold-tree.md). A node holds
+ * marks and nodes, to any depth. The viewer's fold is a depth cut and hand changes on top: a node is open when its depth is
+ * under the cut, unless the viewer opened or closed it by hand.
+ */
+export interface FoldNode {
+    id: string;
+    /** The node it sits in. None: the map itself. */
+    parent?: string | undefined;
+    /** The name in the breadcrumb. */
+    label: string;
+    /** Opens by hand only: the depth cut never opens it. */
+    hand?: boolean | undefined;
+}
+/** Nodes opened (true) or closed (false) by hand, over the depth cut. */
+export type OpenMap = Readonly<Record<string, boolean>>;
+/** What the viewer folded: the depth cut and the hand changes. */
+export interface Fold {
+    depth: number;
+    open: OpenMap;
+}
+/** How deep each node sits: 0 for a node in the map itself. */
+export declare function depthsOf(nodes: readonly FoldNode[]): Map<string, number>;
+/** The cut that opens every node. 0 when there is none. */
+export declare function fullDepth(nodes: readonly FoldNode[]): number;
+/** The node and the nodes it sits in, outermost first. */
+export declare function pathTo(nodes: readonly FoldNode[], id: string): FoldNode[];
+/**
+ * The nodes that show open: open by the cut or by hand, inside nodes that show open too. A node
+ * inside a closed one never counts, so two folds that draw the same map give the same set.
+ */
+export declare function openSet(nodes: readonly FoldNode[], fold: Fold): Set<string>;
+/** A stable key for an open set. */
+export declare const openKey: (open: ReadonlySet<string>) => string;
+/** Open or close one node by hand. Opening opens the nodes it sits in too. */
+export declare function toggle(nodes: readonly FoldNode[], fold: Fold, id: string, on: boolean): Fold;
+/** Open the path to a node and close the rest. */
+export declare function reveal(nodes: readonly FoldNode[], id: string | undefined): Fold;
+/** Step the cut by `d` (pinch in: +1, out: -1). Hand changes clear. */
+export declare function stepDepth(nodes: readonly FoldNode[], depth: number, d: number): Fold;
+/** Every node open, the ones that open by hand too: what a focus shows. */
+export declare const allOpen: (nodes: readonly FoldNode[]) => Set<string>;

package/dist/tree.js

@@ -0,0 +1,89 @@
+/**
+ * The fold tree (from wren's metro map, designs/2026-10-23-metro-fold-tree.md). A node holds
+ * marks and nodes, to any depth. The viewer's fold is a depth cut and hand changes on top: a node is open when its depth is
+ * under the cut, unless the viewer opened or closed it by hand.
+ */
+/** How deep each node sits: 0 for a node in the map itself. */
+export function depthsOf(nodes) {
+    const by = new Map(nodes.map((n) => [n.id, n]));
+    const out = new Map();
+    const at = (id, seen) => {
+        const known = out.get(id);
+        if (known !== undefined)
+            return known;
+        const p = by.get(id)?.parent;
+        // A parent that is not a node, or a loop, ends the walk.
+        const d = p && by.has(p) && seen < by.size ? at(p, seen + 1) + 1 : 0;
+        out.set(id, d);
+        return d;
+    };
+    for (const n of nodes)
+        at(n.id, 0);
+    return out;
+}
+/** The cut that opens every node. 0 when there is none. */
+export function fullDepth(nodes) {
+    const depth = depthsOf(nodes);
+    const cut = nodes.filter((n) => !n.hand).map((n) => (depth.get(n.id) ?? 0) + 1);
+    return cut.length ? Math.max(...cut) : 0;
+}
+/** The node and the nodes it sits in, outermost first. */
+export function pathTo(nodes, id) {
+    const by = new Map(nodes.map((n) => [n.id, n]));
+    const out = [];
+    for (let n = by.get(id); n && out.length <= by.size; n = n.parent ? by.get(n.parent) : undefined)
+        out.unshift(n);
+    return out;
+}
+/**
+ * The nodes that show open: open by the cut or by hand, inside nodes that show open too. A node
+ * inside a closed one never counts, so two folds that draw the same map give the same set.
+ */
+export function openSet(nodes, fold) {
+    const depth = depthsOf(nodes);
+    const own = (n) => fold.open[n.id] ?? (!n.hand && (depth.get(n.id) ?? 0) < fold.depth);
+    const out = new Set();
+    // Outermost first, so a parent is decided before its children.
+    for (const n of [...nodes].sort((a, b) => (depth.get(a.id) ?? 0) - (depth.get(b.id) ?? 0)))
+        if (own(n) && (!n.parent || out.has(n.parent) || !depth.has(n.parent)))
+            out.add(n.id);
+    return out;
+}
+/** A stable key for an open set. */
+export const openKey = (open) => [...open].sort().join("|");
+/** Open or close one node by hand. Opening opens the nodes it sits in too. */
+export function toggle(nodes, fold, id, on) {
+    const now = openSet(nodes, fold);
+    const depth = depthsOf(nodes);
+    const next = { ...fold.open };
+    const by = new Map(nodes.map((n) => [n.id, n]));
+    const set = (k, v) => {
+        // A change that equals the cut is no change.
+        if (v === (!by.get(k)?.hand && (depth.get(k) ?? 0) < fold.depth))
+            delete next[k];
+        else
+            next[k] = v;
+    };
+    if (on)
+        for (const n of pathTo(nodes, id))
+            if (!now.has(n.id))
+                set(n.id, true);
+    if (!on)
+        set(id, false);
+    return { depth: fold.depth, open: next };
+}
+/** Open the path to a node and close the rest. */
+export function reveal(nodes, id) {
+    return {
+        depth: 0,
+        open: Object.fromEntries((id ? pathTo(nodes, id) : []).map((n) => [n.id, true])),
+    };
+}
+/** Step the cut by `d` (pinch in: +1, out: -1). Hand changes clear. */
+export function stepDepth(nodes, depth, d) {
+    const full = fullDepth(nodes);
+    return { depth: Math.max(0, Math.min(full, Math.min(depth, full) + d)), open: {} };
+}
+/** Every node open, the ones that open by hand too: what a focus shows. */
+export const allOpen = (nodes) => new Set(nodes.map((n) => n.id));
+//# sourceMappingURL=tree.js.map

package/dist/tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.js","sourceRoot":"","sources":["../src/tree.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAqBH,+DAA+D;AAC/D,MAAM,UAAU,QAAQ,CAAC,KAA0B;IACjD,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,EAAE,GAAG,CAAC,EAAU,EAAE,IAAY,EAAU,EAAE;QAC9C,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACtC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;QAC7B,yDAAyD;QACzD,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACf,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACnC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,SAAS,CAAC,KAA0B;IAClD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChF,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED,0DAA0D;AAC1D,MAAM,UAAU,MAAM,CAAC,KAA0B,EAAE,EAAU;IAC3D,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS;QAC9F,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjB,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,OAAO,CAAC,KAA0B,EAAE,IAAU;IAC5D,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,CAAC,CAAW,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACjG,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,+DAA+D;IAC/D,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACxF,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACxF,OAAO,GAAG,CAAC;AACb,CAAC;AAED,oCAAoC;AACpC,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,IAAyB,EAAU,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAEzF,8EAA8E;AAC9E,MAAM,UAAU,MAAM,CAAC,KAA0B,EAAE,IAAU,EAAE,EAAU,EAAE,EAAW;IACpF,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,IAAI,GAA4B,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IACvD,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAU,EAAE,EAAE;QACpC,6CAA6C;QAC7C,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;;YAC5E,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC,CAAC;IACF,IAAI,EAAE;QAAE,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC/E,IAAI,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACxB,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC3C,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,MAAM,CAAC,KAA0B,EAAE,EAAsB;IACvE,OAAO;QACL,KAAK,EAAE,CAAC;QACR,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;KACjF,CAAC;AACJ,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,SAAS,CAAC,KAA0B,EAAE,KAAa,EAAE,CAAS;IAC5E,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9B,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;AACrF,CAAC;AAED,2EAA2E;AAC3E,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,KAA0B,EAAe,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC"}

package/package.json

@@ -1,6 +1,31 @@
 {
   "name": "@wrenautomation/orrery",
-  "version": "0.0.0-stage",
-  "stub": true,
-  "description": "Temporary package placeholder for staged publishing"
+  "version": "0.24.1",
+  "description": "The logic of a map you fold: the fold tree, nested layout over any engine, and the glide between frames. No renderer, no framework.",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/wrenautomation/engine.git",
+    "directory": "packages/orrery"
+  },
+  "license": "PolyForm-Strict-1.0.0",
+  "files": [
+    "dist",
+    "!dist/**/*.test.*",
+    "README.md",
+    "LICENSE.md"
+  ],
+  "publishConfig": {
+    "access": "public"
+  },
+  "type": "module",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    }
+  },
+  "scripts": {
+    "typecheck": "tsc --noEmit",
+    "build": "sh ../../scripts/build.sh"
+  }
 }