clarity-mind 0.1.0

package/README.md

@@ -0,0 +1,71 @@
+# clarity-mind
+
+[![npm](https://img.shields.io/npm/v/clarity-mind?color=6366F1)](https://www.npmjs.com/package/clarity-mind)
+[![MIT](https://img.shields.io/npm/l/clarity-mind?color=64748B)](https://github.com/udielenberg/clarity/blob/main/LICENSE)
+
+The **headless engine** behind [clarity](https://github.com/udielenberg/clarity) — a better-UX, open-source mind-mapping library.
+
+Framework-agnostic and **DOM-free**: an immutable tree model, a tidy-tree layout, undo/redo, and Markdown/JSON I/O. Bring your own renderer — or use the React binding, [`@clarity-mind/react`](https://www.npmjs.com/package/@clarity-mind/react).
+
+```bash
+npm install clarity-mind
+```
+
+## Example
+
+```ts
+import { createStore, layout, toMarkdown, fromMarkdown } from "clarity-mind";
+
+// A store wraps the tree with undo/redo + change subscriptions.
+const store = createStore("Roadmap");
+const q1 = store.addChild(store.rootId, "Q1");
+store.addChild(q1, "Ship v1");
+store.setText(q1, "Q1 — launch");
+
+// Deterministic, two-sided "tidy tree" layout. You supply node sizes, so it
+// works with any measuring strategy (DOM, canvas, a fixed grid…).
+const { boxes, edges, bounds } = layout(store.map.root, {
+  measure: (node) => ({ width: node.text.length * 8 + 24, height: 32 }),
+});
+
+// Round-trips through plain Markdown outlines.
+const md = toMarkdown(store.map.root);
+const tree = fromMarkdown(md);
+
+store.undo();
+store.redo();
+```
+
+## What's in the box
+
+| Area                      | Exports                                                                                                              |
+| ------------------------- | -------------------------------------------------------------------------------------------------------------------- |
+| **Model** (pure tree ops) | `createMap`, `node`, `insertChild`, `removeNode`, `moveNode`, `updateNode`, `toggleCollapsed`, `findNode`, `walk`, … |
+| **Store** (stateful)      | `createStore`, `MindMapStore` — `addChild`, `addSibling`, `setText`, `move`, `remove`, `undo`, `redo`, `subscribe`   |
+| **Layout**                | `layout(root, options)` → `{ boxes, edges, bounds }`                                                                 |
+| **History**               | `History` — the undo/redo stack                                                                                      |
+| **I/O**                   | `toMarkdown` / `fromMarkdown`, `toJSON` / `fromJSON` (versioned)                                                     |
+
+Every model operation is **pure** — it returns a new tree and never mutates its input, which is what makes undo/redo and predictable rendering trivial. Moves are cycle-safe (you can't drop a node into its own descendant).
+
+## Types
+
+Fully typed, `strict` + `noUncheckedIndexedAccess`. Key shapes:
+
+```ts
+interface MindNode {
+  id: string;
+  text: string;
+  children: MindNode[];
+  collapsed?: boolean;
+  note?: string;
+}
+
+interface MindMap {
+  root: MindNode;
+}
+```
+
+## License
+
+[MIT](https://github.com/udielenberg/clarity/blob/main/LICENSE) © udielenberg

package/dist/history.d.ts

@@ -0,0 +1,22 @@
+/**
+ * A tiny generic undo/redo stack.
+ *
+ * Because every model operation returns a new immutable tree, "undo" is just
+ * "point back at the previous snapshot" — no inverse commands needed.
+ */
+export declare class History<T> {
+    private stack;
+    private index;
+    private readonly limit;
+    constructor(initial: T, limit?: number);
+    /** The current state. */
+    get current(): T;
+    /** Push a new state, discarding any redo history beyond the current point. */
+    push(state: T): void;
+    canUndo(): boolean;
+    canRedo(): boolean;
+    /** Step back one state (no-op if none). Returns the new current state. */
+    undo(): T;
+    /** Step forward one state (no-op if none). Returns the new current state. */
+    redo(): T;
+}

package/dist/history.js

@@ -0,0 +1,50 @@
+/**
+ * A tiny generic undo/redo stack.
+ *
+ * Because every model operation returns a new immutable tree, "undo" is just
+ * "point back at the previous snapshot" — no inverse commands needed.
+ */
+export class History {
+    constructor(initial, limit = 200) {
+        this.stack = [initial];
+        this.index = 0;
+        this.limit = Math.max(1, limit);
+    }
+    /** The current state. */
+    get current() {
+        return this.stack[this.index];
+    }
+    /** Push a new state, discarding any redo history beyond the current point. */
+    push(state) {
+        if (state === this.current)
+            return;
+        this.stack = this.stack.slice(0, this.index + 1);
+        this.stack.push(state);
+        this.index += 1;
+        // Trim from the front if we exceed the limit.
+        if (this.stack.length > this.limit) {
+            const overflow = this.stack.length - this.limit;
+            this.stack = this.stack.slice(overflow);
+            this.index -= overflow;
+        }
+    }
+    canUndo() {
+        return this.index > 0;
+    }
+    canRedo() {
+        return this.index < this.stack.length - 1;
+    }
+    /** Step back one state (no-op if none). Returns the new current state. */
+    undo() {
+        if (this.canUndo())
+            this.index -= 1;
+        return this.current;
+    }
+    /** Step forward one state (no-op if none). Returns the new current state. */
+    redo() {
+        if (this.canRedo())
+            this.index += 1;
+        return this.current;
+    }
+}
+//# sourceMappingURL=history.js.map

package/dist/history.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"history.js","sourceRoot":"","sources":["../src/history.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,OAAO,OAAO;IAKlB,YAAY,OAAU,EAAE,KAAK,GAAG,GAAG;QACjC,IAAI,CAAC,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,yBAAyB;IACzB,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC;IACjC,CAAC;IAED,8EAA8E;IAC9E,IAAI,CAAC,KAAQ;QACX,IAAI,KAAK,KAAK,IAAI,CAAC,OAAO;YAAE,OAAO;QACnC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAChB,8CAA8C;QAC9C,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;YAChD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC;QACzB,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACxB,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5C,CAAC;IAED,0EAA0E;IAC1E,IAAI;QACF,IAAI,IAAI,CAAC,OAAO,EAAE;YAAE,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QACpC,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,6EAA6E;IAC7E,IAAI;QACF,IAAI,IAAI,CAAC,OAAO,EAAE;YAAE,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QACpC,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;CACF"}

package/dist/index.d.ts

@@ -0,0 +1,13 @@
+/**
+ * clarity-mind — headless mind-mapping engine.
+ *
+ * Framework-agnostic and DOM-free: data model, layout, undo/redo, and I/O.
+ * Pair it with a rendering binding (e.g. `@clarity-mind/react`) to draw a map.
+ */
+export type { MindNode, MindMap } from "./model.js";
+export { createId, node, createMap, cloneNode, findNode, findParent, isAncestor, updateNode, insertChild, removeNode, toggleCollapsed, moveNode, walk, countNodes, } from "./model.js";
+export { History } from "./history.js";
+export { MindMapStore, createStore, type Unsubscribe } from "./store.js";
+export { layout, type Box, type Edge, type Size, type LayoutResult, type LayoutOptions, } from "./layout.js";
+export { toMarkdown, fromMarkdown } from "./io/markdown.js";
+export { toJSON, fromJSON, FORMAT_VERSION } from "./io/json.js";

package/dist/index.js

@@ -0,0 +1,7 @@
+export { createId, node, createMap, cloneNode, findNode, findParent, isAncestor, updateNode, insertChild, removeNode, toggleCollapsed, moveNode, walk, countNodes, } from "./model.js";
+export { History } from "./history.js";
+export { MindMapStore, createStore } from "./store.js";
+export { layout, } from "./layout.js";
+export { toMarkdown, fromMarkdown } from "./io/markdown.js";
+export { toJSON, fromJSON, FORMAT_VERSION } from "./io/json.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":"AAOA,OAAO,EACL,QAAQ,EACR,IAAI,EACJ,SAAS,EACT,SAAS,EACT,QAAQ,EACR,UAAU,EACV,UAAU,EACV,UAAU,EACV,WAAW,EACX,UAAU,EACV,eAAe,EACf,QAAQ,EACR,IAAI,EACJ,UAAU,GACX,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,YAAY,EAAE,WAAW,EAAoB,MAAM,YAAY,CAAC;AAEzE,OAAO,EACL,MAAM,GAMP,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAC5D,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC"}

package/dist/io/json.d.ts

@@ -0,0 +1,11 @@
+/**
+ * JSON import/export with validation.
+ *
+ * The on-disk shape is versioned so future changes can migrate old files.
+ */
+import type { MindMap } from "../model.js";
+export declare const FORMAT_VERSION: 1;
+/** Serialize a map to a JSON string. */
+export declare function toJSON(map: MindMap, pretty?: boolean): string;
+/** Parse and validate a JSON string into a map. Throws on malformed input. */
+export declare function fromJSON(text: string): MindMap;

package/dist/io/json.js

@@ -0,0 +1,47 @@
+export const FORMAT_VERSION = 1;
+/** Serialize a map to a JSON string. */
+export function toJSON(map, pretty = true) {
+    const payload = { version: FORMAT_VERSION, root: map.root };
+    return JSON.stringify(payload, null, pretty ? 2 : undefined);
+}
+function validateNode(value, path) {
+    if (typeof value !== "object" || value === null) {
+        throw new Error(`clarity: ${path} must be an object`);
+    }
+    const obj = value;
+    if (typeof obj.id !== "string" || obj.id.length === 0) {
+        throw new Error(`clarity: ${path}.id must be a non-empty string`);
+    }
+    if (typeof obj.text !== "string") {
+        throw new Error(`clarity: ${path}.text must be a string`);
+    }
+    if (!Array.isArray(obj.children)) {
+        throw new Error(`clarity: ${path}.children must be an array`);
+    }
+    const children = obj.children.map((c, i) => validateNode(c, `${path}.children[${i}]`));
+    const result = { id: obj.id, text: obj.text, children };
+    if (typeof obj.collapsed === "boolean")
+        result.collapsed = obj.collapsed;
+    if (typeof obj.note === "string")
+        result.note = obj.note;
+    return result;
+}
+/** Parse and validate a JSON string into a map. Throws on malformed input. */
+export function fromJSON(text) {
+    let data;
+    try {
+        data = JSON.parse(text);
+    }
+    catch {
+        throw new Error("clarity: invalid JSON");
+    }
+    if (typeof data !== "object" || data === null) {
+        throw new Error("clarity: expected an object at the top level");
+    }
+    const obj = data;
+    if (obj.version !== FORMAT_VERSION) {
+        throw new Error(`clarity: unsupported format version ${String(obj.version)}`);
+    }
+    return { root: validateNode(obj.root, "root") };
+}
+//# sourceMappingURL=json.js.map

package/dist/io/json.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json.js","sourceRoot":"","sources":["../../src/io/json.ts"],"names":[],"mappings":"AAOA,MAAM,CAAC,MAAM,cAAc,GAAG,CAAU,CAAC;AAOzC,wCAAwC;AACxC,MAAM,UAAU,MAAM,CAAC,GAAY,EAAE,MAAM,GAAG,IAAI;IAChD,MAAM,OAAO,GAAkB,EAAE,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;IAC3E,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,YAAY,CAAC,KAAc,EAAE,IAAY;IAChD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAChD,MAAM,IAAI,KAAK,CAAC,YAAY,IAAI,oBAAoB,CAAC,CAAC;IACxD,CAAC;IACD,MAAM,GAAG,GAAG,KAAgC,CAAC;IAC7C,IAAI,OAAO,GAAG,CAAC,EAAE,KAAK,QAAQ,IAAI,GAAG,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtD,MAAM,IAAI,KAAK,CAAC,YAAY,IAAI,gCAAgC,CAAC,CAAC;IACpE,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CAAC,YAAY,IAAI,wBAAwB,CAAC,CAAC;IAC5D,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CAAC,YAAY,IAAI,4BAA4B,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACzC,YAAY,CAAC,CAAC,EAAE,GAAG,IAAI,aAAa,CAAC,GAAG,CAAC,CAC1C,CAAC;IACF,MAAM,MAAM,GAAa,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC;IAClE,IAAI,OAAO,GAAG,CAAC,SAAS,KAAK,SAAS;QAAE,MAAM,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC;IACzE,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ;QAAE,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;IACzD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,IAAI,IAAa,CAAC;IAClB,IAAI,CAAC;QACH,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;IAC3C,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAC9C,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;IAClE,CAAC;IACD,MAAM,GAAG,GAAG,IAA+B,CAAC;IAC5C,IAAI,GAAG,CAAC,OAAO,KAAK,cAAc,EAAE,CAAC;QACnC,MAAM,IAAI,KAAK,CACb,uCAAuC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAC7D,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;AAClD,CAAC"}

package/dist/io/markdown.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Markdown import/export.
+ *
+ * A map serializes to an indented bullet list — the format people already use
+ * for outlines, so it round-trips cleanly and pastes into any editor. Two
+ * spaces of indentation per level; the first bullet is the root.
+ *
+ * Example:
+ *   - My ideas
+ *     - First branch
+ *       - Detail
+ *     - Second branch
+ */
+import { type MindNode } from "../model.js";
+/** Serialize a tree to an indented Markdown bullet list. */
+export declare function toMarkdown(root: MindNode): string;
+/**
+ * Parse an indented bullet list back into a tree.
+ *
+ * If the text has a single top-level bullet, it becomes the root. If it has
+ * several (or none), they are wrapped under a synthetic root titled `rootText`.
+ */
+export declare function fromMarkdown(text: string, rootText?: string): MindNode;

package/dist/io/markdown.js

@@ -0,0 +1,79 @@
+/**
+ * Markdown import/export.
+ *
+ * A map serializes to an indented bullet list — the format people already use
+ * for outlines, so it round-trips cleanly and pastes into any editor. Two
+ * spaces of indentation per level; the first bullet is the root.
+ *
+ * Example:
+ *   - My ideas
+ *     - First branch
+ *       - Detail
+ *     - Second branch
+ */
+import { node } from "../model.js";
+const INDENT = "  ";
+/** Serialize a tree to an indented Markdown bullet list. */
+export function toMarkdown(root) {
+    const lines = [];
+    const go = (n, depth) => {
+        const text = n.text.replace(/\r?\n/g, " ").trimEnd();
+        lines.push(`${INDENT.repeat(depth)}- ${text}`);
+        for (const c of n.children)
+            go(c, depth + 1);
+    };
+    go(root, 0);
+    return lines.join("\n");
+}
+function parseLine(line) {
+    // Accept "-", "*", or "+" bullets. Indentation may be spaces or tabs.
+    const match = /^([ \t]*)[-*+]\s+(.*)$/.exec(line);
+    if (!match)
+        return null;
+    const indent = match[1] ?? "";
+    const text = (match[2] ?? "").trim();
+    // A tab counts as two spaces; otherwise depth is spaces / 2 (rounded down).
+    const spaces = indent.replace(/\t/g, INDENT).length;
+    return { depth: Math.floor(spaces / 2), text };
+}
+/**
+ * Parse an indented bullet list back into a tree.
+ *
+ * If the text has a single top-level bullet, it becomes the root. If it has
+ * several (or none), they are wrapped under a synthetic root titled `rootText`.
+ */
+export function fromMarkdown(text, rootText = "Map") {
+    const parsed = text
+        .split(/\r?\n/)
+        .map(parseLine)
+        .filter((p) => p !== null && p.text.length > 0);
+    if (parsed.length === 0)
+        return node(rootText);
+    // Normalize depths so the shallowest line is depth 0.
+    const minDepth = Math.min(...parsed.map((p) => p.depth));
+    for (const p of parsed)
+        p.depth -= minDepth;
+    const topLevel = parsed.filter((p) => p.depth === 0);
+    const singleRoot = topLevel.length === 1;
+    // Build using a stack of { depth, node }.
+    const roots = [];
+    const stack = [];
+    for (const p of parsed) {
+        const n = node(p.text);
+        while (stack.length > 0 && stack[stack.length - 1].depth >= p.depth) {
+            stack.pop();
+        }
+        const parent = stack[stack.length - 1];
+        if (parent) {
+            parent.node.children.push(n);
+        }
+        else {
+            roots.push(n);
+        }
+        stack.push({ depth: p.depth, node: n });
+    }
+    if (singleRoot && roots.length === 1)
+        return roots[0];
+    return node(rootText, roots);
+}
+//# sourceMappingURL=markdown.js.map

package/dist/io/markdown.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"markdown.js","sourceRoot":"","sources":["../../src/io/markdown.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,OAAO,EAAE,IAAI,EAAiB,MAAM,aAAa,CAAC;AAElD,MAAM,MAAM,GAAG,IAAI,CAAC;AAEpB,4DAA4D;AAC5D,MAAM,UAAU,UAAU,CAAC,IAAc;IACvC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,EAAE,GAAG,CAAC,CAAW,EAAE,KAAa,EAAE,EAAE;QACxC,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;QACrD,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QAC/C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ;YAAE,EAAE,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC;IACF,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACZ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAQD,SAAS,SAAS,CAAC,IAAY;IAC7B,sEAAsE;IACtE,MAAM,KAAK,GAAG,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACrC,4EAA4E;IAC5E,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC;IACpD,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;AACjD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY,EAAE,QAAQ,GAAG,KAAK;IACzD,MAAM,MAAM,GAAG,IAAI;SAChB,KAAK,CAAC,OAAO,CAAC;SACd,GAAG,CAAC,SAAS,CAAC;SACd,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE/D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC;IAE/C,sDAAsD;IACtD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACzD,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,CAAC,CAAC,KAAK,IAAI,QAAQ,CAAC;IAE5C,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;IACrD,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;IAEzC,0CAA0C;IAC1C,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAwC,EAAE,CAAC;IAEtD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACrE,KAAK,CAAC,GAAG,EAAE,CAAC;QACd,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,IAAI,UAAU,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,CAAC,CAAE,CAAC;IACvD,OAAO,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AAC/B,CAAC"}

package/dist/layout.d.ts

@@ -0,0 +1,58 @@
+/**
+ * The layout engine.
+ *
+ * Turns a {@link MindNode} tree into positioned boxes that a renderer can draw.
+ * It is **headless**: it does not measure text itself (that needs a DOM/canvas),
+ * so the caller supplies a `measure` function. The result is a flat map of
+ * `id -> Box` plus the parent→child edges.
+ *
+ * Algorithm: a variable-size "tidy tree" laid out on two sides of a central
+ * root (the classic mind-map look). First-level children are split between the
+ * right and left sides; each side grows outward horizontally and stacks
+ * vertically without overlap. Each side is vertically centered against the
+ * taller one so the root sits in the middle.
+ */
+import type { MindNode } from "./model.js";
+/** A positioned node. `x`/`y` is the top-left corner. */
+export interface Box {
+    id: string;
+    x: number;
+    y: number;
+    width: number;
+    height: number;
+    /** Depth from the root (root = 0). */
+    depth: number;
+    /** Which side of the root this box sits on. The root itself is `"root"`. */
+    side: "left" | "right" | "root";
+}
+/** A connector from a parent box to a child box. */
+export interface Edge {
+    from: string;
+    to: string;
+}
+export interface LayoutResult {
+    boxes: Map<string, Box>;
+    edges: Edge[];
+    /** Bounding box of the whole map. */
+    bounds: {
+        x: number;
+        y: number;
+        width: number;
+        height: number;
+    };
+}
+export interface Size {
+    width: number;
+    height: number;
+}
+export interface LayoutOptions {
+    /** Measure a node's rendered size. Defaults to a rough text estimate. */
+    measure?: (node: MindNode) => Size;
+    /** Horizontal gap between a parent and its children. Default 48. */
+    hGap?: number;
+    /** Vertical gap between sibling subtrees. Default 16. */
+    vGap?: number;
+    /** Lay children out on both sides of the root (true) or only the right. Default true. */
+    twoSided?: boolean;
+}
+export declare function layout(root: MindNode, options?: LayoutOptions): LayoutResult;

package/dist/layout.js

@@ -0,0 +1,154 @@
+const defaultMeasure = (n) => ({
+    width: Math.max(48, n.text.length * 8 + 24),
+    height: 32,
+});
+/** Children that participate in layout (collapsed nodes hide theirs). */
+function visibleChildren(n) {
+    return n.collapsed ? [] : n.children;
+}
+/** Build the working tree and measure every node. */
+function build(node, measure) {
+    return {
+        node,
+        size: measure(node),
+        children: visibleChildren(node).map((c) => build(c, measure)),
+        cy: 0,
+        extent: 0,
+    };
+}
+/**
+ * Pass 1 (vertical): assign each subtree a vertical center relative to a local
+ * cursor starting at 0. A leaf reserves its own height; a parent centers on the
+ * span of its children. Returns the total height consumed.
+ */
+function layoutVertical(work, vGap, cursor) {
+    if (work.children.length === 0) {
+        work.cy = cursor.y + work.size.height / 2;
+        work.extent = work.size.height;
+        cursor.y += work.size.height + vGap;
+        return;
+    }
+    for (const child of work.children) {
+        layoutVertical(child, vGap, cursor);
+    }
+    const first = work.children[0];
+    const last = work.children[work.children.length - 1];
+    // Guarantee the parent's own height fits even if its children span less.
+    const childSpan = last.cy + last.size.height / 2 - (first.cy - first.size.height / 2);
+    work.extent = Math.max(childSpan, work.size.height);
+    work.cy = (first.cy + last.cy) / 2;
+}
+/** Shift a whole subtree vertically by `dy`. */
+function shiftVertical(work, dy) {
+    work.cy += dy;
+    for (const child of work.children)
+        shiftVertical(child, dy);
+}
+/**
+ * Pass 2 (horizontal): walk outward from the root assigning x. For the right
+ * side, a child sits to the right of its parent; for the left side, to the left.
+ * Emits boxes and edges.
+ */
+function emit(work, parentLeft, parentWidth, depth, side, hGap, out) {
+    let x;
+    if (side === "left") {
+        // Child's right edge sits `hGap` to the left of the parent's left edge.
+        x = parentLeft - hGap - work.size.width;
+    }
+    else if (side === "right") {
+        x = parentLeft + parentWidth + hGap;
+    }
+    else {
+        // Root: centered on x = 0.
+        x = -work.size.width / 2;
+    }
+    out.boxes.set(work.node.id, {
+        id: work.node.id,
+        x,
+        y: work.cy - work.size.height / 2,
+        width: work.size.width,
+        height: work.size.height,
+        depth,
+        side,
+    });
+    // Below the root, children always inherit their parent's side.
+    for (const child of work.children) {
+        out.edges.push({ from: work.node.id, to: child.node.id });
+        emit(child, x, work.size.width, depth + 1, side, hGap, out);
+    }
+}
+export function layout(root, options = {}) {
+    const measure = options.measure ?? defaultMeasure;
+    const hGap = options.hGap ?? 48;
+    const vGap = options.vGap ?? 16;
+    const twoSided = options.twoSided ?? true;
+    const rootWork = build(root, measure);
+    const rootSize = rootWork.size;
+    // Split first-level children between the two sides.
+    const firstLevel = rootWork.children;
+    let rightWorks;
+    let leftWorks;
+    if (twoSided && firstLevel.length > 1) {
+        const half = Math.ceil(firstLevel.length / 2);
+        rightWorks = firstLevel.slice(0, half);
+        leftWorks = firstLevel.slice(half);
+    }
+    else {
+        rightWorks = firstLevel;
+        leftWorks = [];
+    }
+    // Vertical pass, independently per side.
+    const measureSide = (works) => {
+        const cursor = { y: 0 };
+        for (const w of works)
+            layoutVertical(w, vGap, cursor);
+        return works.length === 0 ? 0 : cursor.y - vGap;
+    };
+    const rightHeight = measureSide(rightWorks);
+    const leftHeight = measureSide(leftWorks);
+    const sidesHeight = Math.max(rightHeight, leftHeight);
+    const overallHeight = Math.max(sidesHeight, rootSize.height);
+    // Center each side vertically within the overall height.
+    for (const w of rightWorks)
+        shiftVertical(w, (overallHeight - rightHeight) / 2);
+    for (const w of leftWorks)
+        shiftVertical(w, (overallHeight - leftHeight) / 2);
+    rootWork.cy = overallHeight / 2;
+    const out = { boxes: new Map(), edges: [] };
+    // Emit root box (centered on origin).
+    out.boxes.set(root.id, {
+        id: root.id,
+        x: -rootSize.width / 2,
+        y: rootWork.cy - rootSize.height / 2,
+        width: rootSize.width,
+        height: rootSize.height,
+        depth: 0,
+        side: "root",
+    });
+    const rootLeft = -rootSize.width / 2;
+    for (const w of rightWorks) {
+        out.edges.push({ from: root.id, to: w.node.id });
+        emit(w, rootLeft, rootSize.width, 1, "right", hGap, out);
+    }
+    for (const w of leftWorks) {
+        out.edges.push({ from: root.id, to: w.node.id });
+        emit(w, rootLeft, rootSize.width, 1, "left", hGap, out);
+    }
+    // Compute bounds.
+    let minX = Infinity;
+    let minY = Infinity;
+    let maxX = -Infinity;
+    let maxY = -Infinity;
+    for (const b of out.boxes.values()) {
+        minX = Math.min(minX, b.x);
+        minY = Math.min(minY, b.y);
+        maxX = Math.max(maxX, b.x + b.width);
+        maxY = Math.max(maxY, b.y + b.height);
+    }
+    return {
+        boxes: out.boxes,
+        edges: out.edges,
+        bounds: { x: minX, y: minY, width: maxX - minX, height: maxY - minY },
+    };
+}
+//# sourceMappingURL=layout.js.map

package/dist/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sourceRoot":"","sources":["../src/layout.ts"],"names":[],"mappings":"AA0DA,MAAM,cAAc,GAAG,CAAC,CAAW,EAAQ,EAAE,CAAC,CAAC;IAC7C,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC;IAC3C,MAAM,EAAE,EAAE;CACX,CAAC,CAAC;AAEH,yEAAyE;AACzE,SAAS,eAAe,CAAC,CAAW;IAClC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;AACvC,CAAC;AAYD,qDAAqD;AACrD,SAAS,KAAK,CAAC,IAAc,EAAE,OAA8B;IAC3D,OAAO;QACL,IAAI;QACJ,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC;QACnB,QAAQ,EAAE,eAAe,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAC7D,EAAE,EAAE,CAAC;QACL,MAAM,EAAE,CAAC;KACV,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,IAAU,EAAE,IAAY,EAAE,MAAqB;IACrE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC/B,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACpC,OAAO;IACT,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC;IAChC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;IACtD,yEAAyE;IACzE,MAAM,SAAS,GACb,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpD,IAAI,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;AACrC,CAAC;AAED,gDAAgD;AAChD,SAAS,aAAa,CAAC,IAAU,EAAE,EAAU;IAC3C,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;QAAE,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AAC9D,CAAC;AAED;;;;GAIG;AACH,SAAS,IAAI,CACX,IAAU,EACV,UAAkB,EAClB,WAAmB,EACnB,KAAa,EACb,IAA+B,EAC/B,IAAY,EACZ,GAA+C;IAE/C,IAAI,CAAS,CAAC;IACd,IAAI,IAAI,KAAK,MAAM,EAAE,CAAC;QACpB,wEAAwE;QACxE,CAAC,GAAG,UAAU,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;IAC1C,CAAC;SAAM,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;QAC5B,CAAC,GAAG,UAAU,GAAG,WAAW,GAAG,IAAI,CAAC;IACtC,CAAC;SAAM,CAAC;QACN,2BAA2B;QAC3B,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE;QAC1B,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;QAChB,CAAC;QACD,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;QACjC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK;QACtB,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM;QACxB,KAAK;QACL,IAAI;KACL,CAAC,CAAC;IAEH,+DAA+D;IAC/D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1D,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAC9D,CAAC;AACH,CAAC;AAED,MAAM,UAAU,MAAM,CACpB,IAAc,EACd,UAAyB,EAAE;IAE3B,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,cAAc,CAAC;IAClD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC;IAChC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC;IAChC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,IAAI,CAAC;IAE1C,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC;IAE/B,oDAAoD;IACpD,MAAM,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC;IACrC,IAAI,UAAkB,CAAC;IACvB,IAAI,SAAiB,CAAC;IACtB,IAAI,QAAQ,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC9C,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACvC,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;SAAM,CAAC;QACN,UAAU,GAAG,UAAU,CAAC;QACxB,SAAS,GAAG,EAAE,CAAC;IACjB,CAAC;IAED,yCAAyC;IACzC,MAAM,WAAW,GAAG,CAAC,KAAa,EAAU,EAAE;QAC5C,MAAM,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QACvD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC;IAClD,CAAC,CAAC;IACF,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;IAC5C,MAAM,UAAU,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;IACtD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IAE7D,yDAAyD;IACzD,KAAK,MAAM,CAAC,IAAI,UAAU;QACxB,aAAa,CAAC,CAAC,EAAE,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,aAAa,CAAC,CAAC,EAAE,CAAC,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IAE9E,QAAQ,CAAC,EAAE,GAAG,aAAa,GAAG,CAAC,CAAC;IAEhC,MAAM,GAAG,GAAG,EAAE,KAAK,EAAE,IAAI,GAAG,EAAe,EAAE,KAAK,EAAE,EAAY,EAAE,CAAC;IAEnE,sCAAsC;IACtC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;QACrB,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,CAAC,EAAE,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC;QACtB,CAAC,EAAE,QAAQ,CAAC,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC;QACpC,KAAK,EAAE,QAAQ,CAAC,KAAK;QACrB,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,KAAK,EAAE,CAAC;QACR,IAAI,EAAE,MAAM;KACb,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAC3D,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAC1D,CAAC;IAED,kBAAkB;IAClB,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACnC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAED,OAAO;QACL,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,MAAM,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE;KACtE,CAAC;AACJ,CAAC"}

package/dist/model.d.ts

@@ -0,0 +1,60 @@
+/**
+ * The clarity data model.
+ *
+ * A mind map is a single tree of {@link MindNode}s. Every operation in this
+ * module is **pure**: it returns a new tree and never mutates its input. That
+ * makes undo/redo trivial (keep old references) and rendering predictable.
+ */
+/** A single topic in the map. */
+export interface MindNode {
+    /** Stable unique id. */
+    id: string;
+    /** The topic text. */
+    text: string;
+    /** Child topics, in display order. */
+    children: MindNode[];
+    /** When true, children are hidden (and treated as absent by layout). */
+    collapsed?: boolean;
+    /** Optional longer note attached to the topic. */
+    note?: string;
+}
+/** A whole map. Thin wrapper so the shape can grow (themes, meta) without churn. */
+export interface MindMap {
+    root: MindNode;
+}
+/** Generate a collision-resistant id. Deterministic-enough for a session, unique across maps. */
+export declare function createId(): string;
+/** Create a node. Pass an explicit `id` (e.g. in tests) or let one be generated. */
+export declare function node(text: string, children?: MindNode[], opts?: {
+    id?: string;
+    collapsed?: boolean;
+    note?: string;
+}): MindNode;
+/** Create a map from a root node (or root text). */
+export declare function createMap(root: MindNode | string): MindMap;
+/** Deep clone a subtree. */
+export declare function cloneNode(n: MindNode): MindNode;
+/** Depth-first find. Returns the node with `id`, or `undefined`. */
+export declare function findNode(root: MindNode, id: string): MindNode | undefined;
+/** Find the parent of `id`. Returns `undefined` for the root or a missing id. */
+export declare function findParent(root: MindNode, id: string): MindNode | undefined;
+/** True if `ancestorId` is `id` or an ancestor of `id`. Used to block illegal moves. */
+export declare function isAncestor(root: MindNode, ancestorId: string, id: string): boolean;
+/** Update a node's fields (text/note/collapsed). Returns a new tree. */
+export declare function updateNode(root: MindNode, id: string, patch: Partial<Omit<MindNode, "id" | "children">>): MindNode;
+/** Insert `child` under `parentId` at `index` (clamped; defaults to the end). */
+export declare function insertChild(root: MindNode, parentId: string, child: MindNode, index?: number): MindNode;
+/** Remove the subtree rooted at `id`. Throws if `id` is the root. Returns a new tree. */
+export declare function removeNode(root: MindNode, id: string): MindNode;
+/** Toggle (or set) the collapsed flag on a node. Returns a new tree. */
+export declare function toggleCollapsed(root: MindNode, id: string, value?: boolean): MindNode;
+/**
+ * Move the subtree `id` under `newParentId` at `index`.
+ * Throws if the move would create a cycle (moving a node into its own descendant)
+ * or if either node is missing. Returns a new tree.
+ */
+export declare function moveNode(root: MindNode, id: string, newParentId: string, index?: number): MindNode;
+/** Visit every node depth-first (parent before children). */
+export declare function walk(root: MindNode, visit: (n: MindNode, depth: number) => void): void;
+/** Count all nodes in the tree. */
+export declare function countNodes(root: MindNode): number;

package/dist/model.js

@@ -0,0 +1,154 @@
+/**
+ * The clarity data model.
+ *
+ * A mind map is a single tree of {@link MindNode}s. Every operation in this
+ * module is **pure**: it returns a new tree and never mutates its input. That
+ * makes undo/redo trivial (keep old references) and rendering predictable.
+ */
+let idCounter = 0;
+/** Generate a collision-resistant id. Deterministic-enough for a session, unique across maps. */
+export function createId() {
+    idCounter += 1;
+    const rand = Math.random().toString(36).slice(2, 8);
+    return `n${idCounter.toString(36)}-${rand}`;
+}
+/** Create a node. Pass an explicit `id` (e.g. in tests) or let one be generated. */
+export function node(text, children = [], opts = {}) {
+    return {
+        id: opts.id ?? createId(),
+        text,
+        children,
+        ...(opts.collapsed ? { collapsed: true } : {}),
+        ...(opts.note !== undefined ? { note: opts.note } : {}),
+    };
+}
+/** Create a map from a root node (or root text). */
+export function createMap(root) {
+    return { root: typeof root === "string" ? node(root) : root };
+}
+/** Deep clone a subtree. */
+export function cloneNode(n) {
+    return { ...n, children: n.children.map(cloneNode) };
+}
+/** Depth-first find. Returns the node with `id`, or `undefined`. */
+export function findNode(root, id) {
+    if (root.id === id)
+        return root;
+    for (const child of root.children) {
+        const hit = findNode(child, id);
+        if (hit)
+            return hit;
+    }
+    return undefined;
+}
+/** Find the parent of `id`. Returns `undefined` for the root or a missing id. */
+export function findParent(root, id) {
+    for (const child of root.children) {
+        if (child.id === id)
+            return root;
+        const hit = findParent(child, id);
+        if (hit)
+            return hit;
+    }
+    return undefined;
+}
+/** True if `ancestorId` is `id` or an ancestor of `id`. Used to block illegal moves. */
+export function isAncestor(root, ancestorId, id) {
+    const ancestor = findNode(root, ancestorId);
+    if (!ancestor)
+        return false;
+    return !!findNode(ancestor, id);
+}
+/**
+ * Return a new tree where the node matching `id` is replaced by `fn(node)`.
+ * Only the path to that node is rebuilt; untouched subtrees are shared.
+ */
+function transform(root, id, fn) {
+    if (root.id === id)
+        return fn(root);
+    let changed = false;
+    const children = root.children.map((child) => {
+        const next = transform(child, id, fn);
+        if (next !== child)
+            changed = true;
+        return next;
+    });
+    return changed ? { ...root, children } : root;
+}
+/** Update a node's fields (text/note/collapsed). Returns a new tree. */
+export function updateNode(root, id, patch) {
+    return transform(root, id, (n) => ({ ...n, ...patch }));
+}
+/** Insert `child` under `parentId` at `index` (clamped; defaults to the end). */
+export function insertChild(root, parentId, child, index = Number.POSITIVE_INFINITY) {
+    return transform(root, parentId, (p) => {
+        const children = [...p.children];
+        const i = Math.max(0, Math.min(index, children.length));
+        children.splice(i, 0, child);
+        return { ...p, children };
+    });
+}
+/** Remove the subtree rooted at `id`. Throws if `id` is the root. Returns a new tree. */
+export function removeNode(root, id) {
+    if (root.id === id) {
+        throw new Error("clarity: cannot remove the root node");
+    }
+    const recur = (n) => {
+        let changed = false;
+        const kept = n.children.filter((c) => c.id !== id);
+        if (kept.length !== n.children.length)
+            changed = true;
+        const children = kept.map((c) => {
+            const next = recur(c);
+            if (next !== c)
+                changed = true;
+            return next;
+        });
+        return changed ? { ...n, children } : n;
+    };
+    return recur(root);
+}
+/** Toggle (or set) the collapsed flag on a node. Returns a new tree. */
+export function toggleCollapsed(root, id, value) {
+    return transform(root, id, (n) => ({
+        ...n,
+        collapsed: value ?? !n.collapsed,
+    }));
+}
+/**
+ * Move the subtree `id` under `newParentId` at `index`.
+ * Throws if the move would create a cycle (moving a node into its own descendant)
+ * or if either node is missing. Returns a new tree.
+ */
+export function moveNode(root, id, newParentId, index = Number.POSITIVE_INFINITY) {
+    if (id === root.id)
+        throw new Error("clarity: cannot move the root node");
+    if (id === newParentId)
+        throw new Error("clarity: cannot move a node into itself");
+    if (isAncestor(root, id, newParentId)) {
+        throw new Error("clarity: cannot move a node into its own descendant");
+    }
+    const subtree = findNode(root, id);
+    if (!subtree)
+        throw new Error(`clarity: node "${id}" not found`);
+    if (!findNode(root, newParentId))
+        throw new Error(`clarity: node "${newParentId}" not found`);
+    const detached = removeNode(root, id);
+    return insertChild(detached, newParentId, cloneNode(subtree), index);
+}
+/** Visit every node depth-first (parent before children). */
+export function walk(root, visit) {
+    const go = (n, depth) => {
+        visit(n, depth);
+        for (const c of n.children)
+            go(c, depth + 1);
+    };
+    go(root, 0);
+}
+/** Count all nodes in the tree. */
+export function countNodes(root) {
+    let count = 0;
+    walk(root, () => (count += 1));
+    return count;
+}
+//# sourceMappingURL=model.js.map

package/dist/model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.js","sourceRoot":"","sources":["../src/model.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAqBH,IAAI,SAAS,GAAG,CAAC,CAAC;AAElB,iGAAiG;AACjG,MAAM,UAAU,QAAQ;IACtB,SAAS,IAAI,CAAC,CAAC;IACf,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpD,OAAO,IAAI,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;AAC9C,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,IAAI,CAClB,IAAY,EACZ,WAAuB,EAAE,EACzB,OAA4D,EAAE;IAE9D,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,QAAQ,EAAE;QACzB,IAAI;QACJ,QAAQ;QACR,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9C,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACxD,CAAC;AACJ,CAAC;AAED,oDAAoD;AACpD,MAAM,UAAU,SAAS,CAAC,IAAuB;IAC/C,OAAO,EAAE,IAAI,EAAE,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AAChE,CAAC;AAED,4BAA4B;AAC5B,MAAM,UAAU,SAAS,CAAC,CAAW;IACnC,OAAO,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;AACvD,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,QAAQ,CAAC,IAAc,EAAE,EAAU;IACjD,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAChC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAChC,IAAI,GAAG;YAAE,OAAO,GAAG,CAAC;IACtB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,UAAU,CAAC,IAAc,EAAE,EAAU;IACnD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC;QACjC,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAClC,IAAI,GAAG;YAAE,OAAO,GAAG,CAAC;IACtB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,wFAAwF;AACxF,MAAM,UAAU,UAAU,CACxB,IAAc,EACd,UAAkB,EAClB,EAAU;IAEV,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAC5C,IAAI,CAAC,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC5B,OAAO,CAAC,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAChB,IAAc,EACd,EAAU,EACV,EAA6B;IAE7B,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACtC,IAAI,IAAI,KAAK,KAAK;YAAE,OAAO,GAAG,IAAI,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IACH,OAAO,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAChD,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,UAAU,CACxB,IAAc,EACd,EAAU,EACV,KAAiD;IAEjD,OAAO,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,WAAW,CACzB,IAAc,EACd,QAAgB,EAChB,KAAe,EACf,KAAK,GAAG,MAAM,CAAC,iBAAiB;IAEhC,OAAO,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE;QACrC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QACxD,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC7B,OAAO,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,UAAU,CAAC,IAAc,EAAE,EAAU;IACnD,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC1D,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAW,EAAY,EAAE;QACtC,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACnD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,CAAC,MAAM;YAAE,OAAO,GAAG,IAAI,CAAC;QACtD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,IAAI,KAAK,CAAC;gBAAE,OAAO,GAAG,IAAI,CAAC;YAC/B,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC;IACF,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC;AACrB,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,eAAe,CAC7B,IAAc,EACd,EAAU,EACV,KAAe;IAEf,OAAO,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjC,GAAG,CAAC;QACJ,SAAS,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS;KACjC,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CACtB,IAAc,EACd,EAAU,EACV,WAAmB,EACnB,KAAK,GAAG,MAAM,CAAC,iBAAiB;IAEhC,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE;QAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAC1E,IAAI,EAAE,KAAK,WAAW;QACpB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC7D,IAAI,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;IACzE,CAAC;IACD,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACnC,IAAI,CAAC,OAAO;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,EAAE,aAAa,CAAC,CAAC;IACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,kBAAkB,WAAW,aAAa,CAAC,CAAC;IAE9D,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACtC,OAAO,WAAW,CAAC,QAAQ,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC;AACvE,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,IAAI,CAClB,IAAc,EACd,KAA2C;IAE3C,MAAM,EAAE,GAAG,CAAC,CAAW,EAAE,KAAa,EAAE,EAAE;QACxC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ;YAAE,EAAE,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC;IACF,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACd,CAAC;AAED,mCAAmC;AACnC,MAAM,UAAU,UAAU,CAAC,IAAc;IACvC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/store.d.ts

@@ -0,0 +1,37 @@
+import { type MindMap, type MindNode } from "./model.js";
+export type Unsubscribe = () => void;
+export declare class MindMapStore {
+    private history;
+    private listeners;
+    constructor(root: MindNode | string, historyLimit?: number);
+    /** The current map (immutable snapshot). */
+    get map(): MindMap;
+    /** The root node's id — handy since callers often add to the root. */
+    get rootId(): string;
+    /** Subscribe to changes. Returns an unsubscribe function. */
+    subscribe(listener: () => void): Unsubscribe;
+    private commit;
+    private emit;
+    /** Add a child topic under `parentId`. Returns the new node's id. */
+    addChild(parentId: string, text?: string, index?: number): string;
+    /** Add a sibling after `siblingId`. Throws if `siblingId` is the root. Returns the new id. */
+    addSibling(siblingId: string, text?: string): string;
+    /** Change a node's text. */
+    setText(id: string, text: string): void;
+    /** Change a node's note. */
+    setNote(id: string, note: string): void;
+    /** Remove a subtree. */
+    remove(id: string): void;
+    /** Toggle (or set) a node's collapsed flag. */
+    toggleCollapse(id: string, value?: boolean): void;
+    /** Move a subtree under a new parent. */
+    move(id: string, newParentId: string, index?: number): void;
+    /** Replace the whole map (e.g. after an import). Resets nothing but the current state. */
+    replace(map: MindMap): void;
+    canUndo(): boolean;
+    canRedo(): boolean;
+    undo(): void;
+    redo(): void;
+}
+/** Convenience factory. */
+export declare function createStore(root: MindNode | string): MindMapStore;

package/dist/store.js

@@ -0,0 +1,125 @@
+/**
+ * An ergonomic, mutable-feeling wrapper over the pure model + history.
+ *
+ * The store holds the current {@link MindMap} and an undo stack. Every mutating
+ * method applies a pure operation, records the new snapshot, and notifies
+ * subscribers. This is what a UI binding (e.g. the React package) drives.
+ */
+import { History } from "./history.js";
+import { createMap, insertChild, moveNode, node, removeNode, toggleCollapsed, updateNode, } from "./model.js";
+export class MindMapStore {
+    constructor(root, historyLimit = 200) {
+        this.listeners = new Set();
+        this.history = new History(createMap(root), historyLimit);
+    }
+    /** The current map (immutable snapshot). */
+    get map() {
+        return this.history.current;
+    }
+    /** The root node's id — handy since callers often add to the root. */
+    get rootId() {
+        return this.map.root.id;
+    }
+    /** Subscribe to changes. Returns an unsubscribe function. */
+    subscribe(listener) {
+        this.listeners.add(listener);
+        return () => this.listeners.delete(listener);
+    }
+    commit(nextRoot) {
+        if (nextRoot === this.map.root)
+            return;
+        this.history.push({ root: nextRoot });
+        this.emit();
+    }
+    emit() {
+        for (const l of this.listeners)
+            l();
+    }
+    /** Add a child topic under `parentId`. Returns the new node's id. */
+    addChild(parentId, text = "", index) {
+        const child = node(text);
+        this.commit(insertChild(this.map.root, parentId, child, index));
+        return child.id;
+    }
+    /** Add a sibling after `siblingId`. Throws if `siblingId` is the root. Returns the new id. */
+    addSibling(siblingId, text = "") {
+        const parent = findParentId(this.map.root, siblingId);
+        if (!parent)
+            throw new Error("clarity: cannot add a sibling to the root");
+        const idx = childIndex(this.map.root, parent, siblingId);
+        const child = node(text);
+        this.commit(insertChild(this.map.root, parent, child, idx + 1));
+        return child.id;
+    }
+    /** Change a node's text. */
+    setText(id, text) {
+        this.commit(updateNode(this.map.root, id, { text }));
+    }
+    /** Change a node's note. */
+    setNote(id, note) {
+        this.commit(updateNode(this.map.root, id, { note }));
+    }
+    /** Remove a subtree. */
+    remove(id) {
+        this.commit(removeNode(this.map.root, id));
+    }
+    /** Toggle (or set) a node's collapsed flag. */
+    toggleCollapse(id, value) {
+        this.commit(toggleCollapsed(this.map.root, id, value));
+    }
+    /** Move a subtree under a new parent. */
+    move(id, newParentId, index) {
+        this.commit(moveNode(this.map.root, id, newParentId, index));
+    }
+    /** Replace the whole map (e.g. after an import). Resets nothing but the current state. */
+    replace(map) {
+        this.history.push(map);
+        this.emit();
+    }
+    canUndo() {
+        return this.history.canUndo();
+    }
+    canRedo() {
+        return this.history.canRedo();
+    }
+    undo() {
+        if (!this.canUndo())
+            return;
+        this.history.undo();
+        this.emit();
+    }
+    redo() {
+        if (!this.canRedo())
+            return;
+        this.history.redo();
+        this.emit();
+    }
+}
+function findParentId(root, id) {
+    for (const child of root.children) {
+        if (child.id === id)
+            return root.id;
+        const hit = findParentId(child, id);
+        if (hit)
+            return hit;
+    }
+    return undefined;
+}
+function childIndex(root, parentId, childId) {
+    const find = (n) => {
+        if (n.id === parentId)
+            return n.children.findIndex((c) => c.id === childId);
+        for (const c of n.children) {
+            const i = find(c);
+            if (i !== -1)
+                return i;
+        }
+        return -1;
+    };
+    return find(root);
+}
+/** Convenience factory. */
+export function createStore(root) {
+    return new MindMapStore(root);
+}
+//# sourceMappingURL=store.js.map

package/dist/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../src/store.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EACL,SAAS,EACT,WAAW,EACX,QAAQ,EACR,IAAI,EACJ,UAAU,EACV,eAAe,EACf,UAAU,GAGX,MAAM,YAAY,CAAC;AAIpB,MAAM,OAAO,YAAY;IAIvB,YAAY,IAAuB,EAAE,YAAY,GAAG,GAAG;QAF/C,cAAS,GAAG,IAAI,GAAG,EAAc,CAAC;QAGxC,IAAI,CAAC,OAAO,GAAG,IAAI,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,YAAY,CAAC,CAAC;IAC5D,CAAC;IAED,4CAA4C;IAC5C,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;IAC9B,CAAC;IAED,sEAAsE;IACtE,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;IAC1B,CAAC;IAED,6DAA6D;IAC7D,SAAS,CAAC,QAAoB;QAC5B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7B,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAEO,MAAM,CAAC,QAAkB;QAC/B,IAAI,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,IAAI;YAAE,OAAO;QACvC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAEO,IAAI;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS;YAAE,CAAC,EAAE,CAAC;IACtC,CAAC;IAED,qEAAqE;IACrE,QAAQ,CAAC,QAAgB,EAAE,IAAI,GAAG,EAAE,EAAE,KAAc;QAClD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAChE,OAAO,KAAK,CAAC,EAAE,CAAC;IAClB,CAAC;IAED,8FAA8F;IAC9F,UAAU,CAAC,SAAiB,EAAE,IAAI,GAAG,EAAE;QACrC,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QACtD,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;QAC1E,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAChE,OAAO,KAAK,CAAC,EAAE,CAAC;IAClB,CAAC;IAED,4BAA4B;IAC5B,OAAO,CAAC,EAAU,EAAE,IAAY;QAC9B,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,4BAA4B;IAC5B,OAAO,CAAC,EAAU,EAAE,IAAY;QAC9B,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,wBAAwB;IACxB,MAAM,CAAC,EAAU;QACf,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,+CAA+C;IAC/C,cAAc,CAAC,EAAU,EAAE,KAAe;QACxC,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,yCAAyC;IACzC,IAAI,CAAC,EAAU,EAAE,WAAmB,EAAE,KAAc;QAClD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,0FAA0F;IAC1F,OAAO,CAAC,GAAY;QAClB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IAChC,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IAChC,CAAC;IAED,IAAI;QACF,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YAAE,OAAO;QAC5B,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACpB,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAED,IAAI;QACF,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YAAE,OAAO;QAC5B,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACpB,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;CACF;AAED,SAAS,YAAY,CAAC,IAAc,EAAE,EAAU;IAC9C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,GAAG,GAAG,YAAY,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACpC,IAAI,GAAG;YAAE,OAAO,GAAG,CAAC;IACtB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,UAAU,CAAC,IAAc,EAAE,QAAgB,EAAE,OAAe;IACnE,MAAM,IAAI,GAAG,CAAC,CAAW,EAAU,EAAE;QACnC,IAAI,CAAC,CAAC,EAAE,KAAK,QAAQ;YAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;QAC5E,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,KAAK,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC,CAAC;IACF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;AACpB,CAAC;AAED,2BAA2B;AAC3B,MAAM,UAAU,WAAW,CAAC,IAAuB;IACjD,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;AAChC,CAAC"}

package/package.json

@@ -0,0 +1,45 @@
+{
+  "name": "clarity-mind",
+  "version": "0.1.0",
+  "description": "Headless, framework-agnostic mind-mapping engine: data model, tidy-tree layout, undo/redo, Markdown/JSON I/O.",
+  "keywords": [
+    "mind-map",
+    "mindmap",
+    "brainstorming",
+    "layout",
+    "tidy-tree",
+    "tree",
+    "diagram",
+    "headless"
+  ],
+  "license": "MIT",
+  "author": "udielenberg <udielenberg@users.noreply.github.com>",
+  "homepage": "https://github.com/udielenberg/clarity#readme",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/udielenberg/clarity.git",
+    "directory": "packages/core"
+  },
+  "bugs": {
+    "url": "https://github.com/udielenberg/clarity/issues"
+  },
+  "type": "module",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "README.md"
+  ],
+  "sideEffects": false,
+  "scripts": {
+    "build": "tsc -p tsconfig.build.json",
+    "dev": "tsc -p tsconfig.build.json --watch",
+    "prepublishOnly": "npm run build"
+  }
+}