@realflow/core 0.1.0

package/dist/algorithms.d.ts

@@ -0,0 +1,25 @@
+import type { Edge, Node } from './types.js';
+import type { FlowStore } from './store.js';
+/** Nodes with an edge pointing into the given node. */
+export declare const getIncomers: (store: FlowStore, id: string) => Node[];
+/** Nodes the given node points to. */
+export declare const getOutgoers: (store: FlowStore, id: string) => Node[];
+/** Every edge touching any of the given nodes. */
+export declare const getConnectedEdges: (store: FlowStore, ids: string[]) => Edge[];
+/**
+ * Kahn topological sort. Returns node ids in dependency order, or null if
+ * the graph contains a directed cycle.
+ */
+export declare const topologicalSort: (store: FlowStore) => string[] | null;
+export declare const hasCycle: (store: FlowStore) => boolean;
+/** Weakly connected components as arrays of node ids. */
+export declare const connectedComponents: (store: FlowStore) => string[][];
+/** BFS shortest path (by hop count). Directed by default. */
+export declare const shortestPath: (store: FlowStore, from: string, to: string, { directed }?: {
+    directed?: boolean;
+}) => string[] | null;
+/** All transitive ancestors (upstream nodes). */
+export declare const getAncestors: (store: FlowStore, id: string) => Set<string>;
+/** All transitive descendants (downstream nodes). */
+export declare const getDescendants: (store: FlowStore, id: string) => Set<string>;
+//# sourceMappingURL=algorithms.d.ts.map

package/dist/algorithms.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"algorithms.d.ts","sourceRoot":"","sources":["../src/algorithms.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC1C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAEzC,uDAAuD;AACvD,eAAO,MAAM,WAAW,GAAI,OAAO,SAAS,EAAE,IAAI,MAAM,KAAG,IAAI,EAW9D,CAAC;AAEF,sCAAsC;AACtC,eAAO,MAAM,WAAW,GAAI,OAAO,SAAS,EAAE,IAAI,MAAM,KAAG,IAAI,EAW9D,CAAC;AAEF,kDAAkD;AAClD,eAAO,MAAM,iBAAiB,GAAI,OAAO,SAAS,EAAE,KAAK,MAAM,EAAE,KAAG,IAAI,EAYvE,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,eAAe,GAAI,OAAO,SAAS,KAAG,MAAM,EAAE,GAAG,IAoB7D,CAAC;AAEF,eAAO,MAAM,QAAQ,GAAI,OAAO,SAAS,KAAG,OAA0C,CAAC;AAEvF,yDAAyD;AACzD,eAAO,MAAM,mBAAmB,GAAI,OAAO,SAAS,KAAG,MAAM,EAAE,EAsB9D,CAAC;AAEF,6DAA6D;AAC7D,eAAO,MAAM,YAAY,GACvB,OAAO,SAAS,EAChB,MAAM,MAAM,EACZ,IAAI,MAAM,EACV,eAAqB;IAAE,QAAQ,CAAC,EAAE,OAAO,CAAA;CAAO,KAC/C,MAAM,EAAE,GAAG,IAyBb,CAAC;AAEF,iDAAiD;AACjD,eAAO,MAAM,YAAY,GAAI,OAAO,SAAS,EAAE,IAAI,MAAM,KAAG,GAAG,CAAC,MAAM,CAarE,CAAC;AAEF,qDAAqD;AACrD,eAAO,MAAM,cAAc,GAAI,OAAO,SAAS,EAAE,IAAI,MAAM,KAAG,GAAG,CAAC,MAAM,CAavE,CAAC"}

package/dist/algorithms.js

@@ -0,0 +1,158 @@
+/** Nodes with an edge pointing into the given node. */
+export const getIncomers = (store, id) => {
+    const out = [];
+    const seen = new Set();
+    for (const e of store.edgesOf(id)) {
+        if (e.target === id && !seen.has(e.source)) {
+            seen.add(e.source);
+            const n = store.getNode(e.source);
+            if (n)
+                out.push(n);
+        }
+    }
+    return out;
+};
+/** Nodes the given node points to. */
+export const getOutgoers = (store, id) => {
+    const out = [];
+    const seen = new Set();
+    for (const e of store.edgesOf(id)) {
+        if (e.source === id && !seen.has(e.target)) {
+            seen.add(e.target);
+            const n = store.getNode(e.target);
+            if (n)
+                out.push(n);
+        }
+    }
+    return out;
+};
+/** Every edge touching any of the given nodes. */
+export const getConnectedEdges = (store, ids) => {
+    const seen = new Set();
+    const out = [];
+    for (const id of ids) {
+        for (const e of store.edgesOf(id)) {
+            if (!seen.has(e.id)) {
+                seen.add(e.id);
+                out.push(e);
+            }
+        }
+    }
+    return out;
+};
+/**
+ * Kahn topological sort. Returns node ids in dependency order, or null if
+ * the graph contains a directed cycle.
+ */
+export const topologicalSort = (store) => {
+    const indegree = new Map();
+    for (const n of store.getNodes())
+        indegree.set(n.id, 0);
+    for (const e of store.getEdges()) {
+        indegree.set(e.target, (indegree.get(e.target) ?? 0) + 1);
+    }
+    const queue = [];
+    for (const [id, deg] of indegree)
+        if (deg === 0)
+            queue.push(id);
+    const order = [];
+    while (queue.length > 0) {
+        const id = queue.shift();
+        order.push(id);
+        for (const e of store.edgesOf(id)) {
+            if (e.source !== id)
+                continue;
+            const d = (indegree.get(e.target) ?? 0) - 1;
+            indegree.set(e.target, d);
+            if (d === 0)
+                queue.push(e.target);
+        }
+    }
+    return order.length === store.nodes.size ? order : null;
+};
+export const hasCycle = (store) => topologicalSort(store) === null;
+/** Weakly connected components as arrays of node ids. */
+export const connectedComponents = (store) => {
+    const seen = new Set();
+    const components = [];
+    for (const start of store.nodes.keys()) {
+        if (seen.has(start))
+            continue;
+        const comp = [];
+        const stack = [start];
+        seen.add(start);
+        while (stack.length > 0) {
+            const id = stack.pop();
+            comp.push(id);
+            for (const e of store.edgesOf(id)) {
+                const other = e.source === id ? e.target : e.source;
+                if (!seen.has(other) && store.nodes.has(other)) {
+                    seen.add(other);
+                    stack.push(other);
+                }
+            }
+        }
+        components.push(comp);
+    }
+    return components;
+};
+/** BFS shortest path (by hop count). Directed by default. */
+export const shortestPath = (store, from, to, { directed = true } = {}) => {
+    if (from === to)
+        return [from];
+    const prev = new Map();
+    const queue = [from];
+    const seen = new Set([from]);
+    while (queue.length > 0) {
+        const id = queue.shift();
+        for (const e of store.edgesOf(id)) {
+            const next = e.source === id ? e.target : directed ? null : e.source;
+            if (!next || seen.has(next))
+                continue;
+            seen.add(next);
+            prev.set(next, id);
+            if (next === to) {
+                const path = [to];
+                let cur = to;
+                while (cur !== from) {
+                    cur = prev.get(cur);
+                    path.unshift(cur);
+                }
+                return path;
+            }
+            queue.push(next);
+        }
+    }
+    return null;
+};
+/** All transitive ancestors (upstream nodes). */
+export const getAncestors = (store, id) => {
+    const out = new Set();
+    const stack = [id];
+    while (stack.length > 0) {
+        const cur = stack.pop();
+        for (const e of store.edgesOf(cur)) {
+            if (e.target === cur && !out.has(e.source)) {
+                out.add(e.source);
+                stack.push(e.source);
+            }
+        }
+    }
+    return out;
+};
+/** All transitive descendants (downstream nodes). */
+export const getDescendants = (store, id) => {
+    const out = new Set();
+    const stack = [id];
+    while (stack.length > 0) {
+        const cur = stack.pop();
+        for (const e of store.edgesOf(cur)) {
+            if (e.source === cur && !out.has(e.target)) {
+                out.add(e.target);
+                stack.push(e.target);
+            }
+        }
+    }
+    return out;
+};
+//# sourceMappingURL=algorithms.js.map

package/dist/algorithms.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"algorithms.js","sourceRoot":"","sources":["../src/algorithms.ts"],"names":[],"mappings":"AAGA,uDAAuD;AACvD,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAgB,EAAE,EAAU,EAAU,EAAE;IAClE,MAAM,GAAG,GAAW,EAAE,CAAC;IACvB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,MAAM,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3C,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,sCAAsC;AACtC,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAgB,EAAE,EAAU,EAAU,EAAE;IAClE,MAAM,GAAG,GAAW,EAAE,CAAC;IACvB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,MAAM,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3C,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,kDAAkD;AAClD,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,KAAgB,EAAE,GAAa,EAAU,EAAE;IAC3E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAW,EAAE,CAAC;IACvB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACf,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAAgB,EAAmB,EAAE;IACnE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACxD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC;QACjC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,QAAQ;QAAE,IAAI,GAAG,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC1B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,CAAC,MAAM,KAAK,EAAE;gBAAE,SAAS;YAC9B,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5C,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1D,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,KAAgB,EAAW,EAAE,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC;AAEvF,yDAAyD;AACzD,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,KAAgB,EAAc,EAAE;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QAC9B,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACxB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClC,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACpD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC/C,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAChB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAEF,6DAA6D;AAC7D,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAgB,EAChB,IAAY,EACZ,EAAU,EACV,EAAE,QAAQ,GAAG,IAAI,KAA6B,EAAE,EAC/B,EAAE;IACnB,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACrE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YACtC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACf,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACnB,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;gBAChB,MAAM,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClB,IAAI,GAAG,GAAG,EAAE,CAAC;gBACb,OAAO,GAAG,KAAK,IAAI,EAAE,CAAC;oBACpB,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;oBACrB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBACpB,CAAC;gBACD,OAAO,IAAI,CAAC;YACd,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF,iDAAiD;AACjD,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAgB,EAAE,EAAU,EAAe,EAAE;IACxE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,MAAM,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;IACnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3C,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAClB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,qDAAqD;AACrD,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,KAAgB,EAAE,EAAU,EAAe,EAAE;IAC1E,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,MAAM,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;IACnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3C,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAClB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC"}

package/dist/collab.d.ts

@@ -0,0 +1,105 @@
+import type { Edge, Node, XY } from './types.js';
+import type { FlowStore } from './store.js';
+/**
+ * Transport-agnostic real-time collaboration.
+ *
+ * ReFlow's core stays zero-dependency: `Collab` captures local graph changes
+ * as element-level patches and applies remote ones, converging via
+ * last-write-wins per element. Wire it to ANY transport — a WebSocket,
+ * BroadcastChannel, WebRTC, or a Yjs `Y.Map` (see docs/collaboration.md).
+ * Remote edits bypass the local undo stack and never echo back.
+ */
+export interface GraphPatch {
+    /** Peer that produced this patch; used to drop echoes and break ties. */
+    origin: string;
+    nodes?: {
+        upsert?: Node[];
+        remove?: string[];
+    };
+    edges?: {
+        upsert?: Edge[];
+        remove?: string[];
+    };
+    /**
+     * Lamport version per element id (node or edge). Enables deterministic
+     * last-write-wins convergence regardless of delivery order — higher wins,
+     * ties broken by `origin`.
+     */
+    versions?: Record<string, number>;
+}
+export interface CollabOptions {
+    /** Unique id for this peer/tab. */
+    peerId: string;
+    /** Send a patch to every other peer. */
+    broadcast: (patch: GraphPatch) => void;
+}
+/**
+ * Bridges a FlowStore to a broadcast transport. Local commits are diffed into
+ * a patch and broadcast; incoming patches are applied without echo.
+ */
+export declare class Collab {
+    private store;
+    private peerId;
+    private broadcast;
+    private prevNodes;
+    private prevEdges;
+    private unsub;
+    private clock;
+    /** Winning version per element id (nodes and edges share the id space). */
+    private ver;
+    constructor(store: FlowStore, options: CollabOptions);
+    private onLocalCommit;
+    /**
+     * Apply a patch from another peer. Uses per-element Lamport versions for
+     * deterministic last-write-wins: an element is applied only if the incoming
+     * version beats what we've already accepted, so peers converge regardless
+     * of message order. Falls back to accept-all when a patch carries no
+     * versions (e.g. a fullState onboarding patch).
+     */
+    receive(patch: GraphPatch): void;
+    /** Full-state patch for onboarding a newly-joined peer. */
+    fullState(): GraphPatch;
+    destroy(): void;
+}
+export interface PeerState {
+    id: string;
+    name?: string;
+    color?: string;
+    /** Cursor position in flow coordinates. */
+    cursor?: XY | null;
+    /** Selected node/edge ids. */
+    selection?: string[];
+    /** Last-seen timestamp (ms), for stale-peer eviction. */
+    lastSeen?: number;
+}
+export interface PresenceOptions {
+    peerId: string;
+    broadcast: (state: PeerState) => void;
+    /** Called whenever the set of remote peers changes. */
+    onChange?: (peers: PeerState[]) => void;
+    /** Drop peers not seen for this long (ms). Default 15000. */
+    timeout?: number;
+}
+/**
+ * Lightweight presence: broadcast your cursor/selection/identity and track
+ * remote peers. Transport-agnostic, same as `Collab`.
+ */
+export declare class Presence {
+    private peerId;
+    private broadcast;
+    private onChange?;
+    private timeout;
+    private local;
+    private peers;
+    constructor(options: PresenceOptions);
+    /** Update and broadcast our local presence (merged with previous). */
+    update(state: Partial<Omit<PeerState, 'id'>>, now?: number): void;
+    /** Apply a presence update received from another peer. */
+    receive(state: PeerState, now?: number): void;
+    /** Drop peers not seen within the timeout window. */
+    prune(now?: number): void;
+    remotePeers(): PeerState[];
+    /** Remove a peer immediately (e.g. on disconnect). */
+    remove(peerId: string): void;
+}
+//# sourceMappingURL=collab.d.ts.map

package/dist/collab.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collab.d.ts","sourceRoot":"","sources":["../src/collab.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,SAAS,CAAC;AAC9C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAEzC;;;;;;;;GAQG;AAEH,MAAM,WAAW,UAAU;IACzB,yEAAyE;IACzE,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAC/C,KAAK,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAC/C;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACnC;AAaD,MAAM,WAAW,aAAa;IAC5B,mCAAmC;IACnC,MAAM,EAAE,MAAM,CAAC;IACf,wCAAwC;IACxC,SAAS,EAAE,CAAC,KAAK,EAAE,UAAU,KAAK,IAAI,CAAC;CACxC;AAKD;;;GAGG;AACH,qBAAa,MAAM;IACjB,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,SAAS,CAA8B;IAC/C,OAAO,CAAC,SAAS,CAAoB;IACrC,OAAO,CAAC,SAAS,CAAoB;IACrC,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,KAAK,CAAK;IAClB,2EAA2E;IAC3E,OAAO,CAAC,GAAG,CAA0B;gBAEzB,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,aAAa;IASpD,OAAO,CAAC,aAAa;IAuDrB;;;;;;OAMG;IACH,OAAO,CAAC,KAAK,EAAE,UAAU,GAAG,IAAI;IA4BhC,2DAA2D;IAC3D,SAAS,IAAI,UAAU;IAQvB,OAAO,IAAI,IAAI;CAGhB;AAID,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2CAA2C;IAC3C,MAAM,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC;IACnB,8BAA8B;IAC9B,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IACrB,yDAAyD;IACzD,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,CAAC,KAAK,EAAE,SAAS,KAAK,IAAI,CAAC;IACtC,uDAAuD;IACvD,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,IAAI,CAAC;IACxC,6DAA6D;IAC7D,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;GAGG;AACH,qBAAa,QAAQ;IACnB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,SAAS,CAA6B;IAC9C,OAAO,CAAC,QAAQ,CAAC,CAA+B;IAChD,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,KAAK,CAAY;IACzB,OAAO,CAAC,KAAK,CAAgC;gBAEjC,OAAO,EAAE,eAAe;IAQpC,sEAAsE;IACtE,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,SAAa,GAAG,IAAI;IAKrE,0DAA0D;IAC1D,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,SAAa,GAAG,IAAI;IAOjD,qDAAqD;IACrD,KAAK,CAAC,GAAG,SAAa,GAAG,IAAI;IAW7B,WAAW,IAAI,SAAS,EAAE;IAI1B,sDAAsD;IACtD,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;CAG7B"}

package/dist/collab.js

@@ -0,0 +1,182 @@
+const newer = (incoming, stored) => {
+    if (!stored)
+        return true;
+    if (incoming.c !== stored.c)
+        return incoming.c > stored.c;
+    return incoming.p > stored.p;
+};
+const snapshotMap = (items) => new Map(items.map((i) => [i.id, i]));
+/**
+ * Bridges a FlowStore to a broadcast transport. Local commits are diffed into
+ * a patch and broadcast; incoming patches are applied without echo.
+ */
+export class Collab {
+    store;
+    peerId;
+    broadcast;
+    prevNodes;
+    prevEdges;
+    unsub;
+    clock = 0;
+    /** Winning version per element id (nodes and edges share the id space). */
+    ver = new Map();
+    constructor(store, options) {
+        this.store = store;
+        this.peerId = options.peerId;
+        this.broadcast = options.broadcast;
+        this.prevNodes = snapshotMap(store.getNodes());
+        this.prevEdges = snapshotMap(store.getEdges());
+        this.unsub = store.subscribe('commit', () => this.onLocalCommit());
+    }
+    onLocalCommit() {
+        const nodes = this.store.getNodes();
+        const edges = this.store.getEdges();
+        const patch = { origin: this.peerId };
+        const versions = {};
+        const stamp = (id) => {
+            this.clock++;
+            this.ver.set(id, { c: this.clock, p: this.peerId });
+            versions[id] = this.clock;
+        };
+        const upNodes = [];
+        const rmNodes = [];
+        const nextNodeIds = new Set();
+        for (const n of nodes) {
+            nextNodeIds.add(n.id);
+            if (this.prevNodes.get(n.id) !== n) {
+                upNodes.push(n);
+                stamp(n.id);
+            }
+        }
+        for (const id of this.prevNodes.keys())
+            if (!nextNodeIds.has(id)) {
+                rmNodes.push(id);
+                stamp(id);
+            }
+        const upEdges = [];
+        const rmEdges = [];
+        const nextEdgeIds = new Set();
+        for (const e of edges) {
+            nextEdgeIds.add(e.id);
+            if (this.prevEdges.get(e.id) !== e) {
+                upEdges.push(e);
+                stamp(e.id);
+            }
+        }
+        for (const id of this.prevEdges.keys())
+            if (!nextEdgeIds.has(id)) {
+                rmEdges.push(id);
+                stamp(id);
+            }
+        this.prevNodes = snapshotMap(nodes);
+        this.prevEdges = snapshotMap(edges);
+        if (upNodes.length || rmNodes.length)
+            patch.nodes = { upsert: upNodes, remove: rmNodes };
+        if (upEdges.length || rmEdges.length)
+            patch.edges = { upsert: upEdges, remove: rmEdges };
+        if (patch.nodes || patch.edges) {
+            patch.versions = versions;
+            this.broadcast(patch);
+        }
+    }
+    /**
+     * Apply a patch from another peer. Uses per-element Lamport versions for
+     * deterministic last-write-wins: an element is applied only if the incoming
+     * version beats what we've already accepted, so peers converge regardless
+     * of message order. Falls back to accept-all when a patch carries no
+     * versions (e.g. a fullState onboarding patch).
+     */
+    receive(patch) {
+        if (patch.origin === this.peerId)
+            return;
+        const versions = patch.versions;
+        // Advance our Lamport clock past everything we've seen.
+        if (versions)
+            for (const v of Object.values(versions))
+                this.clock = Math.max(this.clock, v);
+        const accept = (id) => {
+            if (!versions)
+                return true;
+            const incoming = { c: versions[id] ?? 0, p: patch.origin };
+            if (!newer(incoming, this.ver.get(id)))
+                return false;
+            this.ver.set(id, incoming);
+            return true;
+        };
+        const nodesUpsert = (patch.nodes?.upsert ?? []).filter((n) => accept(n.id));
+        const nodesRemove = (patch.nodes?.remove ?? []).filter((id) => accept(id));
+        const edgesUpsert = (patch.edges?.upsert ?? []).filter((e) => accept(e.id));
+        const edgesRemove = (patch.edges?.remove ?? []).filter((id) => accept(id));
+        this.store.applyRemotePatch({
+            nodes: { upsert: nodesUpsert, remove: nodesRemove },
+            edges: { upsert: edgesUpsert, remove: edgesRemove },
+        });
+        // Keep the diff baseline in sync so remote changes aren't re-broadcast.
+        this.prevNodes = snapshotMap(this.store.getNodes());
+        this.prevEdges = snapshotMap(this.store.getEdges());
+    }
+    /** Full-state patch for onboarding a newly-joined peer. */
+    fullState() {
+        return {
+            origin: this.peerId,
+            nodes: { upsert: this.store.getNodes() },
+            edges: { upsert: this.store.getEdges() },
+        };
+    }
+    destroy() {
+        this.unsub();
+    }
+}
+/**
+ * Lightweight presence: broadcast your cursor/selection/identity and track
+ * remote peers. Transport-agnostic, same as `Collab`.
+ */
+export class Presence {
+    peerId;
+    broadcast;
+    onChange;
+    timeout;
+    local;
+    peers = new Map();
+    constructor(options) {
+        this.peerId = options.peerId;
+        this.broadcast = options.broadcast;
+        this.onChange = options.onChange;
+        this.timeout = options.timeout ?? 15000;
+        this.local = { id: options.peerId };
+    }
+    /** Update and broadcast our local presence (merged with previous). */
+    update(state, now = Date.now()) {
+        this.local = { ...this.local, ...state, id: this.peerId, lastSeen: now };
+        this.broadcast(this.local);
+    }
+    /** Apply a presence update received from another peer. */
+    receive(state, now = Date.now()) {
+        if (state.id === this.peerId)
+            return;
+        this.peers.set(state.id, { ...state, lastSeen: state.lastSeen ?? now });
+        this.prune(now);
+        this.onChange?.(this.remotePeers());
+    }
+    /** Drop peers not seen within the timeout window. */
+    prune(now = Date.now()) {
+        let changed = false;
+        for (const [id, p] of this.peers) {
+            if (now - (p.lastSeen ?? 0) > this.timeout) {
+                this.peers.delete(id);
+                changed = true;
+            }
+        }
+        if (changed)
+            this.onChange?.(this.remotePeers());
+    }
+    remotePeers() {
+        return [...this.peers.values()];
+    }
+    /** Remove a peer immediately (e.g. on disconnect). */
+    remove(peerId) {
+        if (this.peers.delete(peerId))
+            this.onChange?.(this.remotePeers());
+    }
+}
+//# sourceMappingURL=collab.js.map

package/dist/collab.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collab.js","sourceRoot":"","sources":["../src/collab.ts"],"names":[],"mappings":"AA+BA,MAAM,KAAK,GAAG,CAAC,QAAa,EAAE,MAAuB,EAAW,EAAE;IAChE,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,QAAQ,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC;QAAE,OAAO,QAAQ,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC1D,OAAO,QAAQ,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAC/B,CAAC,CAAC;AASF,MAAM,WAAW,GAAG,CAA2B,KAAU,EAAkB,EAAE,CAC3E,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAEvC;;;GAGG;AACH,MAAM,OAAO,MAAM;IACT,KAAK,CAAY;IACjB,MAAM,CAAS;IACf,SAAS,CAA8B;IACvC,SAAS,CAAoB;IAC7B,SAAS,CAAoB;IAC7B,KAAK,CAAa;IAClB,KAAK,GAAG,CAAC,CAAC;IAClB,2EAA2E;IACnE,GAAG,GAAG,IAAI,GAAG,EAAe,CAAC;IAErC,YAAY,KAAgB,EAAE,OAAsB;QAClD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC/C,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;IACrE,CAAC;IAEO,aAAa;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACpC,MAAM,KAAK,GAAe,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;QAClD,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAE5C,MAAM,KAAK,GAAG,CAAC,EAAU,EAAQ,EAAE;YACjC,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YACpD,QAAQ,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QAC5B,CAAC,CAAC;QAEF,MAAM,OAAO,GAAW,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACtC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChB,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE;YACpC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjB,KAAK,CAAC,EAAE,CAAC,CAAC;YACZ,CAAC;QAEH,MAAM,OAAO,GAAW,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACtC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChB,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE;YACpC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjB,KAAK,CAAC,EAAE,CAAC,CAAC;YACZ,CAAC;QAEH,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QAEpC,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM;YAAE,KAAK,CAAC,KAAK,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;QACzF,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM;YAAE,KAAK,CAAC,KAAK,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;QACzF,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC;YAC1B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CAAC,KAAiB;QACvB,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;YAAE,OAAO;QACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAChC,wDAAwD;QACxD,IAAI,QAAQ;YAAE,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;gBAAE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAE5F,MAAM,MAAM,GAAG,CAAC,EAAU,EAAW,EAAE;YACrC,IAAI,CAAC,QAAQ;gBAAE,OAAO,IAAI,CAAC;YAC3B,MAAM,QAAQ,GAAQ,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;YAChE,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,MAAM,WAAW,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5E,MAAM,WAAW,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3E,MAAM,WAAW,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5E,MAAM,WAAW,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAE3E,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC;YAC1B,KAAK,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;YACnD,KAAK,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE;SACpD,CAAC,CAAC;QACH,wEAAwE;QACxE,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;QACpD,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IACtD,CAAC;IAED,2DAA2D;IAC3D,SAAS;QACP,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE;YACxC,KAAK,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE;SACzC,CAAC;IACJ,CAAC;IAED,OAAO;QACL,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;CACF;AAyBD;;;GAGG;AACH,MAAM,OAAO,QAAQ;IACX,MAAM,CAAS;IACf,SAAS,CAA6B;IACtC,QAAQ,CAAgC;IACxC,OAAO,CAAS;IAChB,KAAK,CAAY;IACjB,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;IAE7C,YAAY,OAAwB;QAClC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QACjC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,KAAK,CAAC;QACxC,IAAI,CAAC,KAAK,GAAG,EAAE,EAAE,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;IACtC,CAAC;IAED,sEAAsE;IACtE,MAAM,CAAC,KAAqC,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE;QAC5D,IAAI,CAAC,KAAK,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;QACzE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAED,0DAA0D;IAC1D,OAAO,CAAC,KAAgB,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE;QACxC,IAAI,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM;YAAE,OAAO;QACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,GAAG,EAAE,CAAC,CAAC;QACxE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,qDAAqD;IACrD,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE;QACpB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACjC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;gBAC3C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACtB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;QACD,IAAI,OAAO;YAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IACnD,CAAC;IAED,WAAW;QACT,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAClC,CAAC;IAED,sDAAsD;IACtD,MAAM,CAAC,MAAc;QACnB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;YAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IACrE,CAAC;CACF"}

package/dist/geometry.d.ts

@@ -0,0 +1,33 @@
+import type { Rect, XY, Viewport, Side } from './types.js';
+export declare const clamp: (v: number, lo: number, hi: number) => number;
+export declare const rectCenter: (r: Rect) => XY;
+export declare const rectContains: (r: Rect, p: XY) => boolean;
+export declare const rectContainsRect: (outer: Rect, inner: Rect) => boolean;
+export declare const rectsIntersect: (a: Rect, b: Rect) => boolean;
+export declare const rectUnion: (a: Rect | null, b: Rect) => Rect;
+export declare const expandRect: (r: Rect, m: number) => Rect;
+export declare const rectFromPoints: (a: XY, b: XY) => Rect;
+/** Convert a screen point to flow coordinates. */
+export declare const screenToFlow: (p: XY, v: Viewport) => XY;
+/** Convert a flow point to screen coordinates. */
+export declare const flowToScreen: (p: XY, v: Viewport) => XY;
+/** The flow-space rectangle visible in a screen of the given size. */
+export declare const visibleRect: (v: Viewport, width: number, height: number) => Rect;
+/**
+ * Viewport that fits `bounds` inside a `width`x`height` screen with padding
+ * (fraction of the screen, default 0.1).
+ */
+export declare const fitRect: (bounds: Rect, width: number, height: number, padding?: number, minZoom?: number, maxZoom?: number) => Viewport;
+/**
+ * Zoom the viewport by `factor` while keeping the screen point `pivot`
+ * stationary (the classic zoom-at-cursor).
+ */
+export declare const zoomAt: (v: Viewport, factor: number, pivot: XY, minZoom: number, maxZoom: number) => Viewport;
+/** Outward unit vector for a node side. */
+export declare const sideDir: (s: Side) => XY;
+/** Default anchor point for a side of a rect (border midpoint). */
+export declare const sideAnchor: (r: Rect, s: Side) => XY;
+/** Pick the node side whose anchor is closest to pointing at `toward`. */
+export declare const closestSide: (r: Rect, toward: XY) => Side;
+export declare const snapToGrid: (p: XY, grid: number) => XY;
+//# sourceMappingURL=geometry.d.ts.map

package/dist/geometry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"geometry.d.ts","sourceRoot":"","sources":["../src/geometry.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAExD,eAAO,MAAM,KAAK,GAAI,GAAG,MAAM,EAAE,IAAI,MAAM,EAAE,IAAI,MAAM,KAAG,MAC3B,CAAC;AAEhC,eAAO,MAAM,UAAU,GAAI,GAAG,IAAI,KAAG,EAAuD,CAAC;AAE7F,eAAO,MAAM,YAAY,GAAI,GAAG,IAAI,EAAE,GAAG,EAAE,KAAG,OAC6B,CAAC;AAE5E,eAAO,MAAM,gBAAgB,GAAI,OAAO,IAAI,EAAE,OAAO,IAAI,KAAG,OAIV,CAAC;AAEnD,eAAO,MAAM,cAAc,GAAI,GAAG,IAAI,EAAE,GAAG,IAAI,KAAG,OAC8C,CAAC;AAEjG,eAAO,MAAM,SAAS,GAAI,GAAG,IAAI,GAAG,IAAI,EAAE,GAAG,IAAI,KAAG,IAUnD,CAAC;AAEF,eAAO,MAAM,UAAU,GAAI,GAAG,IAAI,EAAE,GAAG,MAAM,KAAG,IAK9C,CAAC;AAEH,eAAO,MAAM,cAAc,GAAI,GAAG,EAAE,EAAE,GAAG,EAAE,KAAG,IAK5C,CAAC;AAEH,kDAAkD;AAClD,eAAO,MAAM,YAAY,GAAI,GAAG,EAAE,EAAE,GAAG,QAAQ,KAAG,EAGhD,CAAC;AAEH,kDAAkD;AAClD,eAAO,MAAM,YAAY,GAAI,GAAG,EAAE,EAAE,GAAG,QAAQ,KAAG,EAGhD,CAAC;AAEH,sEAAsE;AACtE,eAAO,MAAM,WAAW,GAAI,GAAG,QAAQ,EAAE,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAG,IAKvE,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,OAAO,GAClB,QAAQ,IAAI,EACZ,OAAO,MAAM,EACb,QAAQ,MAAM,EACd,gBAAa,EACb,gBAAa,EACb,gBAAW,KACV,QAcF,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,MAAM,GACjB,GAAG,QAAQ,EACX,QAAQ,MAAM,EACd,OAAO,EAAE,EACT,SAAS,MAAM,EACf,SAAS,MAAM,KACd,QAQF,CAAC;AAEF,2CAA2C;AAC3C,eAAO,MAAM,OAAO,GAAI,GAAG,IAAI,KAAG,EAWjC,CAAC;AAEF,mEAAmE;AACnE,eAAO,MAAM,UAAU,GAAI,GAAG,IAAI,EAAE,GAAG,IAAI,KAAG,EAW7C,CAAC;AAEF,0EAA0E;AAC1E,eAAO,MAAM,WAAW,GAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,KAAG,IAMjD,CAAC;AAEF,eAAO,MAAM,UAAU,GAAI,GAAG,EAAE,EAAE,MAAM,MAAM,KAAG,EAG1C,CAAC"}

package/dist/geometry.js

@@ -0,0 +1,113 @@
+export const clamp = (v, lo, hi) => v < lo ? lo : v > hi ? hi : v;
+export const rectCenter = (r) => ({ x: r.x + r.width / 2, y: r.y + r.height / 2 });
+export const rectContains = (r, p) => p.x >= r.x && p.x <= r.x + r.width && p.y >= r.y && p.y <= r.y + r.height;
+export const rectContainsRect = (outer, inner) => inner.x >= outer.x &&
+    inner.y >= outer.y &&
+    inner.x + inner.width <= outer.x + outer.width &&
+    inner.y + inner.height <= outer.y + outer.height;
+export const rectsIntersect = (a, b) => a.x <= b.x + b.width && b.x <= a.x + a.width && a.y <= b.y + b.height && b.y <= a.y + a.height;
+export const rectUnion = (a, b) => {
+    if (!a)
+        return { ...b };
+    const x = Math.min(a.x, b.x);
+    const y = Math.min(a.y, b.y);
+    return {
+        x,
+        y,
+        width: Math.max(a.x + a.width, b.x + b.width) - x,
+        height: Math.max(a.y + a.height, b.y + b.height) - y,
+    };
+};
+export const expandRect = (r, m) => ({
+    x: r.x - m,
+    y: r.y - m,
+    width: r.width + 2 * m,
+    height: r.height + 2 * m,
+});
+export const rectFromPoints = (a, b) => ({
+    x: Math.min(a.x, b.x),
+    y: Math.min(a.y, b.y),
+    width: Math.abs(a.x - b.x),
+    height: Math.abs(a.y - b.y),
+});
+/** Convert a screen point to flow coordinates. */
+export const screenToFlow = (p, v) => ({
+    x: (p.x - v.x) / v.zoom,
+    y: (p.y - v.y) / v.zoom,
+});
+/** Convert a flow point to screen coordinates. */
+export const flowToScreen = (p, v) => ({
+    x: p.x * v.zoom + v.x,
+    y: p.y * v.zoom + v.y,
+});
+/** The flow-space rectangle visible in a screen of the given size. */
+export const visibleRect = (v, width, height) => ({
+    x: -v.x / v.zoom,
+    y: -v.y / v.zoom,
+    width: width / v.zoom,
+    height: height / v.zoom,
+});
+/**
+ * Viewport that fits `bounds` inside a `width`x`height` screen with padding
+ * (fraction of the screen, default 0.1).
+ */
+export const fitRect = (bounds, width, height, padding = 0.1, minZoom = 0.1, maxZoom = 2) => {
+    if (bounds.width <= 0 || bounds.height <= 0 || width <= 0 || height <= 0) {
+        return { x: 0, y: 0, zoom: 1 };
+    }
+    const zoom = clamp(Math.min((width * (1 - 2 * padding)) / bounds.width, (height * (1 - 2 * padding)) / bounds.height), minZoom, maxZoom);
+    const c = rectCenter(bounds);
+    return { x: width / 2 - c.x * zoom, y: height / 2 - c.y * zoom, zoom };
+};
+/**
+ * Zoom the viewport by `factor` while keeping the screen point `pivot`
+ * stationary (the classic zoom-at-cursor).
+ */
+export const zoomAt = (v, factor, pivot, minZoom, maxZoom) => {
+    const zoom = clamp(v.zoom * factor, minZoom, maxZoom);
+    const k = zoom / v.zoom;
+    return {
+        x: pivot.x - (pivot.x - v.x) * k,
+        y: pivot.y - (pivot.y - v.y) * k,
+        zoom,
+    };
+};
+/** Outward unit vector for a node side. */
+export const sideDir = (s) => {
+    switch (s) {
+        case 'left':
+            return { x: -1, y: 0 };
+        case 'right':
+            return { x: 1, y: 0 };
+        case 'top':
+            return { x: 0, y: -1 };
+        default:
+            return { x: 0, y: 1 };
+    }
+};
+/** Default anchor point for a side of a rect (border midpoint). */
+export const sideAnchor = (r, s) => {
+    switch (s) {
+        case 'left':
+            return { x: r.x, y: r.y + r.height / 2 };
+        case 'right':
+            return { x: r.x + r.width, y: r.y + r.height / 2 };
+        case 'top':
+            return { x: r.x + r.width / 2, y: r.y };
+        default:
+            return { x: r.x + r.width / 2, y: r.y + r.height };
+    }
+};
+/** Pick the node side whose anchor is closest to pointing at `toward`. */
+export const closestSide = (r, toward) => {
+    const c = rectCenter(r);
+    const dx = toward.x - c.x;
+    const dy = toward.y - c.y;
+    if (Math.abs(dx) > Math.abs(dy))
+        return dx > 0 ? 'right' : 'left';
+    return dy > 0 ? 'bottom' : 'top';
+};
+export const snapToGrid = (p, grid) => grid > 0
+    ? { x: Math.round(p.x / grid) * grid, y: Math.round(p.y / grid) * grid }
+    : p;
+//# sourceMappingURL=geometry.js.map