entangle-ui 0.9.0 → 0.11.0

package/dist/esm/components/editor/NodeGraph/nodeGraphMath.js

@@ -0,0 +1,350 @@
+/**
+ * Fallback size used when a node has no measured DOM size yet (first paint
+ * before `ResizeObserver` has fired) and no explicit `node.width`/`height`.
+ */
+const DEFAULT_NODE_WIDTH = 180;
+const DEFAULT_NODE_HEIGHT = 80;
+/**
+ * Resolve a node's effective bounding box.
+ *
+ * Priority: explicit `node.width`/`node.height` > measured DOM size >
+ * `defaults`. This keeps consumer-controlled fixed-size nodes deterministic
+ * while letting auto-sized nodes pick up their real dimensions for
+ * hit-testing, marquee selection, and `fitToContent`.
+ */
+function getNodeBox(node, measuredSize, defaults = {
+    width: DEFAULT_NODE_WIDTH,
+    height: DEFAULT_NODE_HEIGHT,
+}) {
+    return {
+        x: node.position.x,
+        y: node.position.y,
+        width: node.width ?? measuredSize?.width ?? defaults.width,
+        height: node.height ?? measuredSize?.height ?? defaults.height,
+    };
+}
+/**
+ * Unit vector pointing away from a port along its side. Used as the
+ * tangent direction for the Bézier handle on that endpoint.
+ */
+function sideVector(side) {
+    switch (side) {
+        case 'left':
+            return { x: -1, y: 0 };
+        case 'right':
+            return { x: 1, y: 0 };
+        case 'top':
+            return { x: 0, y: -1 };
+        case 'bottom':
+            return { x: 0, y: 1 };
+        default: {
+            const _unreached = side;
+            return _unreached;
+        }
+    }
+}
+/**
+ * Compute control points for a Cubic Bézier connecting `source` (on side
+ * `srcSide`) to `target` (on side `tgtSide`). The handle length scales
+ * with the distance between the endpoints, with a floor so short edges
+ * still curve visibly.
+ */
+function getBezierControlPoints(source, srcSide, target, tgtSide) {
+    const dx = target.x - source.x;
+    const dy = target.y - source.y;
+    const dist = Math.hypot(dx, dy);
+    const srcHorizontal = srcSide === 'left' || srcSide === 'right';
+    const tgtHorizontal = tgtSide === 'left' || tgtSide === 'right';
+    const srcAxis = srcHorizontal ? Math.abs(dx) : Math.abs(dy);
+    const tgtAxis = tgtHorizontal ? Math.abs(dx) : Math.abs(dy);
+    const minHandle = 32;
+    const srcLen = Math.max(minHandle, srcAxis * 0.5, dist * 0.25);
+    const tgtLen = Math.max(minHandle, tgtAxis * 0.5, dist * 0.25);
+    const srcVec = sideVector(srcSide);
+    const tgtVec = sideVector(tgtSide);
+    return {
+        p0: source,
+        c1: { x: source.x + srcVec.x * srcLen, y: source.y + srcVec.y * srcLen },
+        c2: { x: target.x + tgtVec.x * tgtLen, y: target.y + tgtVec.y * tgtLen },
+        p3: target,
+    };
+}
+/**
+ * Evaluate a Cubic Bézier at parameter `t` in `[0, 1]`.
+ */
+function evaluateBezier(cp, t) {
+    const it = 1 - t;
+    const it2 = it * it;
+    const t2 = t * t;
+    const w0 = it2 * it;
+    const w1 = 3 * it2 * t;
+    const w2 = 3 * it * t2;
+    const w3 = t2 * t;
+    return {
+        x: cp.p0.x * w0 + cp.c1.x * w1 + cp.c2.x * w2 + cp.p3.x * w3,
+        y: cp.p0.y * w0 + cp.c1.y * w1 + cp.c2.y * w2 + cp.p3.y * w3,
+    };
+}
+/**
+ * Test whether a world point is within `threshold` world units of the
+ * Bézier curve. Samples the curve at fixed intervals and measures
+ * point-to-segment distance.
+ */
+function isPointNearBezier(point, cp, threshold, samples = 24) {
+    let prev = cp.p0;
+    for (let i = 1; i <= samples; i++) {
+        const t = i / samples;
+        const curr = evaluateBezier(cp, t);
+        if (pointToSegmentDistance(point, prev, curr) <= threshold)
+            return true;
+        prev = curr;
+    }
+    return false;
+}
+/**
+ * Test whether a world point is inside (or on the edge of) a node box.
+ */
+function isPointInNode(point, node, measuredSize, defaults) {
+    const box = getNodeBox(node, measuredSize, defaults);
+    return (point.x >= box.x &&
+        point.x <= box.x + box.width &&
+        point.y >= box.y &&
+        point.y <= box.y + box.height);
+}
+/** True when a rectangle contains a point. */
+function isPointInRect(point, rect) {
+    return (point.x >= rect.x &&
+        point.x <= rect.x + rect.width &&
+        point.y >= rect.y &&
+        point.y <= rect.y + rect.height);
+}
+/** True when two axis-aligned rectangles overlap (non-strict). */
+function rectsIntersect(a, b) {
+    return (a.x < b.x + b.width &&
+        a.x + a.width > b.x &&
+        a.y < b.y + b.height &&
+        a.y + a.height > b.y);
+}
+/**
+ * True when `inner` is fully contained inside `outer` (closed comparison —
+ * a rectangle that touches the outer's edge counts as contained). Used by
+ * the group-drag controller to decide which nodes ride along with their
+ * enclosing group.
+ */
+function rectContains(outer, inner) {
+    return (inner.x >= outer.x &&
+        inner.y >= outer.y &&
+        inner.x + inner.width <= outer.x + outer.width &&
+        inner.y + inner.height <= outer.y + outer.height);
+}
+/**
+ * Compute the tight bounding box of a node list, factoring in measured /
+ * default sizes. Returns a zero-width rect at the origin when the list
+ * is empty.
+ */
+function computeNodesBounds(nodes, measuredSizes, defaults) {
+    if (nodes.length === 0)
+        return { x: 0, y: 0, width: 0, height: 0 };
+    let minX = Infinity;
+    let minY = Infinity;
+    let maxX = -Infinity;
+    let maxY = -Infinity;
+    for (const node of nodes) {
+        const box = getNodeBox(node, measuredSizes?.(node.id), defaults);
+        if (box.x < minX)
+            minX = box.x;
+        if (box.y < minY)
+            minY = box.y;
+        if (box.x + box.width > maxX)
+            maxX = box.x + box.width;
+        if (box.y + box.height > maxY)
+            maxY = box.y + box.height;
+    }
+    return { x: minX, y: minY, width: maxX - minX, height: maxY - minY };
+}
+/**
+ * Snap a world-space delta to the nearest grid increment. Pass `false`
+ * for `grid` to return the delta unchanged.
+ */
+function snapDelta(delta, grid) {
+    if (grid === false || grid <= 0)
+        return delta;
+    return {
+        x: Math.round(delta.x / grid) * grid,
+        y: Math.round(delta.y / grid) * grid,
+    };
+}
+/**
+ * Resolve the next selection for a click on `id`, honouring the additive
+ * modifier (shift / cmd / ctrl). Non-additive replaces the selection with
+ * just `id`; additive toggles `id` in/out of the current set. Shared by the
+ * node-drag, group-drag, and edge-click paths so the toggle semantics stay
+ * identical everywhere.
+ */
+function toggleSelected(ids, id, additive) {
+    if (!additive)
+        return [id];
+    return ids.includes(id)
+        ? ids.filter(existing => existing !== id)
+        : [...ids, id];
+}
+/** Minimum size (in world units) a group can be resized down to. */
+const MIN_GROUP_SIZE = 32;
+/**
+ * Compute the new group bounds during a resize gesture, given the
+ * original bounds, the cumulative drag delta, and which handle is being
+ * dragged. Enforces a minimum size on each axis so the group doesn't
+ * collapse to zero.
+ */
+function applyGroupResize(start, handle, delta, minSize = MIN_GROUP_SIZE) {
+    let { x, y, width, height } = start;
+    const movesLeft = handle === 'nw' || handle === 'w' || handle === 'sw';
+    const movesRight = handle === 'ne' || handle === 'e' || handle === 'se';
+    const movesTop = handle === 'nw' || handle === 'n' || handle === 'ne';
+    const movesBottom = handle === 'sw' || handle === 's' || handle === 'se';
+    if (movesLeft) {
+        const dx = Math.min(delta.x, start.width - minSize);
+        x = start.x + dx;
+        width = start.width - dx;
+    }
+    else if (movesRight) {
+        width = Math.max(minSize, start.width + delta.x);
+    }
+    if (movesTop) {
+        const dy = Math.min(delta.y, start.height - minSize);
+        y = start.y + dy;
+        height = start.height - dy;
+    }
+    else if (movesBottom) {
+        height = Math.max(minSize, start.height + delta.y);
+    }
+    return { x, y, width, height };
+}
+/**
+ * Resolve a port reference to its **world-space** position + side using
+ * the slot-registered port position lookup. Returns `null` when the node
+ * is missing or the port hasn't been measured yet (the slot's
+ * `useLayoutEffect` hasn't run).
+ */
+function resolvePortRef(ref, getNodeById, getPortPosition) {
+    const node = getNodeById(ref.node);
+    if (!node)
+        return null;
+    const portPos = getPortPosition(ref.node, ref.port);
+    if (!portPos)
+        return null;
+    return {
+        node,
+        position: {
+            x: node.position.x + portPos.x,
+            y: node.position.y + portPos.y,
+        },
+        side: portPos.side,
+        ...(portPos.dataType !== undefined ? { dataType: portPos.dataType } : {}),
+    };
+}
+/**
+ * Resolve both endpoints of an edge to world-space positions + sides.
+ * Returns `null` when either endpoint can't be resolved (missing node or
+ * not-yet-measured port).
+ */
+function resolveEdgeEndpoints(edge, getNodeById, getPortPosition) {
+    const src = resolvePortRef(edge.source, getNodeById, getPortPosition);
+    if (!src)
+        return null;
+    const tgt = resolvePortRef(edge.target, getNodeById, getPortPosition);
+    if (!tgt)
+        return null;
+    return {
+        source: src.position,
+        srcSide: src.side,
+        target: tgt.position,
+        tgtSide: tgt.side,
+    };
+}
+/**
+ * Apply a selection-driven cascade delete to a graph snapshot. Removes
+ * the selected nodes / edges / groups and additionally drops any edge
+ * whose source or target node was removed — eliminates the classic
+ * "orphan edge dangling off a deleted node" bug. Pure function; returns
+ * the same array references when nothing was removed.
+ *
+ * Used internally by `<NodeGraph>` when no `onDelete` is supplied, and
+ * exported so consumers who DO supply `onDelete` (e.g. to snapshot for
+ * undo, log telemetry, show confirmations) can reuse the same logic
+ * without rewriting the filter.
+ */
+function applyCascadeDelete(input, selection) {
+    const removedNodeIds = new Set(selection.nodes);
+    const removedEdgeIds = new Set(selection.edges);
+    const removedGroupIds = new Set(selection.groups);
+    const nodes = removedNodeIds.size > 0
+        ? input.nodes.filter(n => !removedNodeIds.has(n.id))
+        : input.nodes;
+    const edges = input.edges.filter(e => !removedEdgeIds.has(e.id) &&
+        !removedNodeIds.has(e.source.node) &&
+        !removedNodeIds.has(e.target.node));
+    const groups = removedGroupIds.size > 0
+        ? input.groups.filter(g => !removedGroupIds.has(g.id))
+        : input.groups;
+    return {
+        nodes,
+        // Keep the input array reference when nothing changed — lets the
+        // consumer skip an unnecessary `setEdges` if they want to.
+        edges: edges.length === input.edges.length ? input.edges : edges,
+        groups,
+    };
+}
+/**
+ * Find the topmost edge whose Bézier passes within `threshold` world units
+ * of `point`. Iterates in reverse so the last-drawn edge wins, matching what
+ * the user sees on top. Returns the edge id, or `null` when none is hit.
+ *
+ * Used for pointer hover + click selection + right-click targeting of edges,
+ * which are drawn on a canvas (no DOM to hit-test against).
+ */
+function findEdgeAtPoint(point, edges, getNodeById, getPortPosition, threshold) {
+    for (let i = edges.length - 1; i >= 0; i--) {
+        const edge = edges[i];
+        if (!edge)
+            continue;
+        const ends = resolveEdgeEndpoints(edge, getNodeById, getPortPosition);
+        if (!ends)
+            continue;
+        const cp = getBezierControlPoints(ends.source, ends.srcSide, ends.target, ends.tgtSide);
+        // Broad-phase rejection: a cubic Bézier is contained within the convex
+        // hull of its control points, so a point outside their bounding box
+        // (expanded by `threshold`) can never be within `threshold` of the curve.
+        // Skips the 24-sample distance test for the vast majority of edges on
+        // large graphs — turns hover/click hit-testing from O(edges × 24) into a
+        // couple of comparisons per non-candidate edge.
+        if (point.x < Math.min(cp.p0.x, cp.c1.x, cp.c2.x, cp.p3.x) - threshold)
+            continue;
+        if (point.x > Math.max(cp.p0.x, cp.c1.x, cp.c2.x, cp.p3.x) + threshold)
+            continue;
+        if (point.y < Math.min(cp.p0.y, cp.c1.y, cp.c2.y, cp.p3.y) - threshold)
+            continue;
+        if (point.y > Math.max(cp.p0.y, cp.c1.y, cp.c2.y, cp.p3.y) + threshold)
+            continue;
+        if (isPointNearBezier(point, cp, threshold))
+            return edge.id;
+    }
+    return null;
+}
+// ─── Internals ───
+function pointToSegmentDistance(p, a, b) {
+    const abx = b.x - a.x;
+    const aby = b.y - a.y;
+    const lenSq = abx * abx + aby * aby;
+    if (lenSq === 0)
+        return Math.hypot(p.x - a.x, p.y - a.y);
+    let t = ((p.x - a.x) * abx + (p.y - a.y) * aby) / lenSq;
+    if (t < 0)
+        t = 0;
+    else if (t > 1)
+        t = 1;
+    return Math.hypot(p.x - (a.x + t * abx), p.y - (a.y + t * aby));
+}
+
+export { DEFAULT_NODE_HEIGHT, DEFAULT_NODE_WIDTH, MIN_GROUP_SIZE, applyCascadeDelete, applyGroupResize, computeNodesBounds, evaluateBezier, findEdgeAtPoint, getBezierControlPoints, getNodeBox, isPointInNode, isPointInRect, isPointNearBezier, rectContains, rectsIntersect, resolveEdgeEndpoints, resolvePortRef, sideVector, snapDelta, toggleSelected };
+//# sourceMappingURL=nodeGraphMath.js.map

package/dist/esm/components/editor/NodeGraph/nodeGraphMath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeGraphMath.js","sources":["src/components/editor/NodeGraph/nodeGraphMath.ts"],"sourcesContent":["import type {\n  NodeGraphEdge,\n  NodeGraphNode,\n  NodeGraphPortRef,\n  NodeGraphPortSide,\n} from './NodeGraph.types';\nimport type {\n  NodeGraphMeasuredSize,\n  NodeGraphPortPosition,\n} from './NodeGraphStore';\nimport type { Point2D } from '@/components/primitives/canvas/canvas.types';\nimport type { WorldRect } from '@/components/primitives/viewport';\n\n/**\n * Fallback size used when a node has no measured DOM size yet (first paint\n * before `ResizeObserver` has fired) and no explicit `node.width`/`height`.\n */\nexport const DEFAULT_NODE_WIDTH = 180;\nexport const DEFAULT_NODE_HEIGHT = 80;\n\ninterface NodeBox {\n  x: number;\n  y: number;\n  width: number;\n  height: number;\n}\n\n/**\n * Read the function used to look up the registered port position. Pure\n * resolver — the math module takes this as an argument so it stays free\n * of a store dependency.\n */\nexport type PortPositionLookup = (\n  nodeId: string,\n  portId: string\n) => NodeGraphPortPosition | null;\n\n/** Read the measured size of a node wrapper (or null if not measured yet). */\nexport type MeasuredSizeLookup = (\n  nodeId: string\n) => NodeGraphMeasuredSize | null;\n\n/**\n * O(1) node-by-id lookup. Hot resolvers ({@link resolvePortRef},\n * {@link resolveEdgeEndpoints}) take this instead of an array to keep edge\n * drawing at `O(edges)` rather than `O(edges × nodes)`.\n */\nexport type NodeLookup = (id: string) => NodeGraphNode | undefined;\n\n/**\n * Resolve a node's effective bounding box.\n *\n * Priority: explicit `node.width`/`node.height` > measured DOM size >\n * `defaults`. This keeps consumer-controlled fixed-size nodes deterministic\n * while letting auto-sized nodes pick up their real dimensions for\n * hit-testing, marquee selection, and `fitToContent`.\n */\nexport function getNodeBox(\n  node: NodeGraphNode,\n  measuredSize?: NodeGraphMeasuredSize | null,\n  defaults: { width: number; height: number } = {\n    width: DEFAULT_NODE_WIDTH,\n    height: DEFAULT_NODE_HEIGHT,\n  }\n): NodeBox {\n  return {\n    x: node.position.x,\n    y: node.position.y,\n    width: node.width ?? measuredSize?.width ?? defaults.width,\n    height: node.height ?? measuredSize?.height ?? defaults.height,\n  };\n}\n\n/**\n * Unit vector pointing away from a port along its side. Used as the\n * tangent direction for the Bézier handle on that endpoint.\n */\nexport function sideVector(side: NodeGraphPortSide): Point2D {\n  switch (side) {\n    case 'left':\n      return { x: -1, y: 0 };\n    case 'right':\n      return { x: 1, y: 0 };\n    case 'top':\n      return { x: 0, y: -1 };\n    case 'bottom':\n      return { x: 0, y: 1 };\n    default: {\n      const _unreached: never = side;\n      return _unreached;\n    }\n  }\n}\n\nexport interface BezierControlPoints {\n  /** Source endpoint. */\n  p0: Point2D;\n  /** Source-side control point. */\n  c1: Point2D;\n  /** Target-side control point. */\n  c2: Point2D;\n  /** Target endpoint. */\n  p3: Point2D;\n}\n\n/**\n * Compute control points for a Cubic Bézier connecting `source` (on side\n * `srcSide`) to `target` (on side `tgtSide`). The handle length scales\n * with the distance between the endpoints, with a floor so short edges\n * still curve visibly.\n */\nexport function getBezierControlPoints(\n  source: Point2D,\n  srcSide: NodeGraphPortSide,\n  target: Point2D,\n  tgtSide: NodeGraphPortSide\n): BezierControlPoints {\n  const dx = target.x - source.x;\n  const dy = target.y - source.y;\n  const dist = Math.hypot(dx, dy);\n\n  const srcHorizontal = srcSide === 'left' || srcSide === 'right';\n  const tgtHorizontal = tgtSide === 'left' || tgtSide === 'right';\n  const srcAxis = srcHorizontal ? Math.abs(dx) : Math.abs(dy);\n  const tgtAxis = tgtHorizontal ? Math.abs(dx) : Math.abs(dy);\n  const minHandle = 32;\n  const srcLen = Math.max(minHandle, srcAxis * 0.5, dist * 0.25);\n  const tgtLen = Math.max(minHandle, tgtAxis * 0.5, dist * 0.25);\n\n  const srcVec = sideVector(srcSide);\n  const tgtVec = sideVector(tgtSide);\n\n  return {\n    p0: source,\n    c1: { x: source.x + srcVec.x * srcLen, y: source.y + srcVec.y * srcLen },\n    c2: { x: target.x + tgtVec.x * tgtLen, y: target.y + tgtVec.y * tgtLen },\n    p3: target,\n  };\n}\n\n/**\n * Evaluate a Cubic Bézier at parameter `t` in `[0, 1]`.\n */\nexport function evaluateBezier(cp: BezierControlPoints, t: number): Point2D {\n  const it = 1 - t;\n  const it2 = it * it;\n  const t2 = t * t;\n  const w0 = it2 * it;\n  const w1 = 3 * it2 * t;\n  const w2 = 3 * it * t2;\n  const w3 = t2 * t;\n  return {\n    x: cp.p0.x * w0 + cp.c1.x * w1 + cp.c2.x * w2 + cp.p3.x * w3,\n    y: cp.p0.y * w0 + cp.c1.y * w1 + cp.c2.y * w2 + cp.p3.y * w3,\n  };\n}\n\n/**\n * Test whether a world point is within `threshold` world units of the\n * Bézier curve. Samples the curve at fixed intervals and measures\n * point-to-segment distance.\n */\nexport function isPointNearBezier(\n  point: Point2D,\n  cp: BezierControlPoints,\n  threshold: number,\n  samples = 24\n): boolean {\n  let prev = cp.p0;\n  for (let i = 1; i <= samples; i++) {\n    const t = i / samples;\n    const curr = evaluateBezier(cp, t);\n    if (pointToSegmentDistance(point, prev, curr) <= threshold) return true;\n    prev = curr;\n  }\n  return false;\n}\n\n/**\n * Test whether a world point is inside (or on the edge of) a node box.\n */\nexport function isPointInNode(\n  point: Point2D,\n  node: NodeGraphNode,\n  measuredSize?: NodeGraphMeasuredSize | null,\n  defaults?: { width: number; height: number }\n): boolean {\n  const box = getNodeBox(node, measuredSize, defaults);\n  return (\n    point.x >= box.x &&\n    point.x <= box.x + box.width &&\n    point.y >= box.y &&\n    point.y <= box.y + box.height\n  );\n}\n\n/** True when a rectangle contains a point. */\nexport function isPointInRect(point: Point2D, rect: WorldRect): boolean {\n  return (\n    point.x >= rect.x &&\n    point.x <= rect.x + rect.width &&\n    point.y >= rect.y &&\n    point.y <= rect.y + rect.height\n  );\n}\n\n/** True when two axis-aligned rectangles overlap (non-strict). */\nexport function rectsIntersect(a: WorldRect, b: WorldRect): boolean {\n  return (\n    a.x < b.x + b.width &&\n    a.x + a.width > b.x &&\n    a.y < b.y + b.height &&\n    a.y + a.height > b.y\n  );\n}\n\n/**\n * True when `inner` is fully contained inside `outer` (closed comparison —\n * a rectangle that touches the outer's edge counts as contained). Used by\n * the group-drag controller to decide which nodes ride along with their\n * enclosing group.\n */\nexport function rectContains(outer: WorldRect, inner: WorldRect): boolean {\n  return (\n    inner.x >= outer.x &&\n    inner.y >= outer.y &&\n    inner.x + inner.width <= outer.x + outer.width &&\n    inner.y + inner.height <= outer.y + outer.height\n  );\n}\n\n/**\n * Compute the tight bounding box of a node list, factoring in measured /\n * default sizes. Returns a zero-width rect at the origin when the list\n * is empty.\n */\nexport function computeNodesBounds(\n  nodes: ReadonlyArray<NodeGraphNode>,\n  measuredSizes?: MeasuredSizeLookup,\n  defaults?: { width: number; height: number }\n): WorldRect {\n  if (nodes.length === 0) return { x: 0, y: 0, width: 0, height: 0 };\n  let minX = Infinity;\n  let minY = Infinity;\n  let maxX = -Infinity;\n  let maxY = -Infinity;\n  for (const node of nodes) {\n    const box = getNodeBox(node, measuredSizes?.(node.id), defaults);\n    if (box.x < minX) minX = box.x;\n    if (box.y < minY) minY = box.y;\n    if (box.x + box.width > maxX) maxX = box.x + box.width;\n    if (box.y + box.height > maxY) maxY = box.y + box.height;\n  }\n  return { x: minX, y: minY, width: maxX - minX, height: maxY - minY };\n}\n\n/**\n * Snap a world-space delta to the nearest grid increment. Pass `false`\n * for `grid` to return the delta unchanged.\n */\nexport function snapDelta(delta: Point2D, grid: number | false): Point2D {\n  if (grid === false || grid <= 0) return delta;\n  return {\n    x: Math.round(delta.x / grid) * grid,\n    y: Math.round(delta.y / grid) * grid,\n  };\n}\n\n/**\n * Resolve the next selection for a click on `id`, honouring the additive\n * modifier (shift / cmd / ctrl). Non-additive replaces the selection with\n * just `id`; additive toggles `id` in/out of the current set. Shared by the\n * node-drag, group-drag, and edge-click paths so the toggle semantics stay\n * identical everywhere.\n */\nexport function toggleSelected(\n  ids: ReadonlyArray<string>,\n  id: string,\n  additive: boolean\n): string[] {\n  if (!additive) return [id];\n  return ids.includes(id)\n    ? ids.filter(existing => existing !== id)\n    : [...ids, id];\n}\n\n/** Minimum size (in world units) a group can be resized down to. */\nexport const MIN_GROUP_SIZE = 32;\n\n/**\n * Compute the new group bounds during a resize gesture, given the\n * original bounds, the cumulative drag delta, and which handle is being\n * dragged. Enforces a minimum size on each axis so the group doesn't\n * collapse to zero.\n */\nexport function applyGroupResize(\n  start: WorldRect,\n  handle: 'nw' | 'n' | 'ne' | 'e' | 'se' | 's' | 'sw' | 'w',\n  delta: Point2D,\n  minSize = MIN_GROUP_SIZE\n): WorldRect {\n  let { x, y, width, height } = start;\n\n  const movesLeft = handle === 'nw' || handle === 'w' || handle === 'sw';\n  const movesRight = handle === 'ne' || handle === 'e' || handle === 'se';\n  const movesTop = handle === 'nw' || handle === 'n' || handle === 'ne';\n  const movesBottom = handle === 'sw' || handle === 's' || handle === 'se';\n\n  if (movesLeft) {\n    const dx = Math.min(delta.x, start.width - minSize);\n    x = start.x + dx;\n    width = start.width - dx;\n  } else if (movesRight) {\n    width = Math.max(minSize, start.width + delta.x);\n  }\n  if (movesTop) {\n    const dy = Math.min(delta.y, start.height - minSize);\n    y = start.y + dy;\n    height = start.height - dy;\n  } else if (movesBottom) {\n    height = Math.max(minSize, start.height + delta.y);\n  }\n  return { x, y, width, height };\n}\n\n/**\n * Resolve a port reference to its **world-space** position + side using\n * the slot-registered port position lookup. Returns `null` when the node\n * is missing or the port hasn't been measured yet (the slot's\n * `useLayoutEffect` hasn't run).\n */\nexport function resolvePortRef(\n  ref: NodeGraphPortRef,\n  getNodeById: NodeLookup,\n  getPortPosition: PortPositionLookup\n): {\n  node: NodeGraphNode;\n  position: Point2D;\n  side: NodeGraphPortSide;\n  dataType?: string;\n} | null {\n  const node = getNodeById(ref.node);\n  if (!node) return null;\n  const portPos = getPortPosition(ref.node, ref.port);\n  if (!portPos) return null;\n  return {\n    node,\n    position: {\n      x: node.position.x + portPos.x,\n      y: node.position.y + portPos.y,\n    },\n    side: portPos.side,\n    ...(portPos.dataType !== undefined ? { dataType: portPos.dataType } : {}),\n  };\n}\n\n/**\n * Resolve both endpoints of an edge to world-space positions + sides.\n * Returns `null` when either endpoint can't be resolved (missing node or\n * not-yet-measured port).\n */\nexport function resolveEdgeEndpoints(\n  edge: NodeGraphEdge,\n  getNodeById: NodeLookup,\n  getPortPosition: PortPositionLookup\n): {\n  source: Point2D;\n  srcSide: NodeGraphPortSide;\n  target: Point2D;\n  tgtSide: NodeGraphPortSide;\n} | null {\n  const src = resolvePortRef(edge.source, getNodeById, getPortPosition);\n  if (!src) return null;\n  const tgt = resolvePortRef(edge.target, getNodeById, getPortPosition);\n  if (!tgt) return null;\n  return {\n    source: src.position,\n    srcSide: src.side,\n    target: tgt.position,\n    tgtSide: tgt.side,\n  };\n}\n\n/**\n * Apply a selection-driven cascade delete to a graph snapshot. Removes\n * the selected nodes / edges / groups and additionally drops any edge\n * whose source or target node was removed — eliminates the classic\n * \"orphan edge dangling off a deleted node\" bug. Pure function; returns\n * the same array references when nothing was removed.\n *\n * Used internally by `<NodeGraph>` when no `onDelete` is supplied, and\n * exported so consumers who DO supply `onDelete` (e.g. to snapshot for\n * undo, log telemetry, show confirmations) can reuse the same logic\n * without rewriting the filter.\n */\nexport function applyCascadeDelete<TNode extends { id: string }>(\n  input: {\n    nodes: ReadonlyArray<TNode>;\n    edges: ReadonlyArray<NodeGraphEdge>;\n    groups: ReadonlyArray<{ id: string }>;\n  },\n  selection: {\n    nodes: ReadonlyArray<string>;\n    edges: ReadonlyArray<string>;\n    groups: ReadonlyArray<string>;\n  }\n): {\n  nodes: TNode[] | ReadonlyArray<TNode>;\n  edges: NodeGraphEdge[] | ReadonlyArray<NodeGraphEdge>;\n  groups: typeof input.groups;\n} {\n  const removedNodeIds = new Set(selection.nodes);\n  const removedEdgeIds = new Set(selection.edges);\n  const removedGroupIds = new Set(selection.groups);\n\n  const nodes =\n    removedNodeIds.size > 0\n      ? input.nodes.filter(n => !removedNodeIds.has(n.id))\n      : input.nodes;\n  const edges = input.edges.filter(\n    e =>\n      !removedEdgeIds.has(e.id) &&\n      !removedNodeIds.has(e.source.node) &&\n      !removedNodeIds.has(e.target.node)\n  );\n  const groups =\n    removedGroupIds.size > 0\n      ? input.groups.filter(g => !removedGroupIds.has(g.id))\n      : input.groups;\n\n  return {\n    nodes,\n    // Keep the input array reference when nothing changed — lets the\n    // consumer skip an unnecessary `setEdges` if they want to.\n    edges: edges.length === input.edges.length ? input.edges : edges,\n    groups,\n  };\n}\n\n/**\n * Find the topmost edge whose Bézier passes within `threshold` world units\n * of `point`. Iterates in reverse so the last-drawn edge wins, matching what\n * the user sees on top. Returns the edge id, or `null` when none is hit.\n *\n * Used for pointer hover + click selection + right-click targeting of edges,\n * which are drawn on a canvas (no DOM to hit-test against).\n */\nexport function findEdgeAtPoint(\n  point: Point2D,\n  edges: ReadonlyArray<NodeGraphEdge>,\n  getNodeById: NodeLookup,\n  getPortPosition: PortPositionLookup,\n  threshold: number\n): string | null {\n  for (let i = edges.length - 1; i >= 0; i--) {\n    const edge = edges[i];\n    if (!edge) continue;\n    const ends = resolveEdgeEndpoints(edge, getNodeById, getPortPosition);\n    if (!ends) continue;\n    const cp = getBezierControlPoints(\n      ends.source,\n      ends.srcSide,\n      ends.target,\n      ends.tgtSide\n    );\n    // Broad-phase rejection: a cubic Bézier is contained within the convex\n    // hull of its control points, so a point outside their bounding box\n    // (expanded by `threshold`) can never be within `threshold` of the curve.\n    // Skips the 24-sample distance test for the vast majority of edges on\n    // large graphs — turns hover/click hit-testing from O(edges × 24) into a\n    // couple of comparisons per non-candidate edge.\n    if (point.x < Math.min(cp.p0.x, cp.c1.x, cp.c2.x, cp.p3.x) - threshold)\n      continue;\n    if (point.x > Math.max(cp.p0.x, cp.c1.x, cp.c2.x, cp.p3.x) + threshold)\n      continue;\n    if (point.y < Math.min(cp.p0.y, cp.c1.y, cp.c2.y, cp.p3.y) - threshold)\n      continue;\n    if (point.y > Math.max(cp.p0.y, cp.c1.y, cp.c2.y, cp.p3.y) + threshold)\n      continue;\n    if (isPointNearBezier(point, cp, threshold)) return edge.id;\n  }\n  return null;\n}\n\n// ─── Internals ───\n\nfunction pointToSegmentDistance(p: Point2D, a: Point2D, b: Point2D): number {\n  const abx = b.x - a.x;\n  const aby = b.y - a.y;\n  const lenSq = abx * abx + aby * aby;\n  if (lenSq === 0) return Math.hypot(p.x - a.x, p.y - a.y);\n  let t = ((p.x - a.x) * abx + (p.y - a.y) * aby) / lenSq;\n  if (t < 0) t = 0;\n  else if (t > 1) t = 1;\n  return Math.hypot(p.x - (a.x + t * abx), p.y - (a.y + t * aby));\n}\n"],"names":[],"mappings":"AAaA;;;AAGG;AACI,MAAM,kBAAkB,GAAG;AAC3B,MAAM,mBAAmB,GAAG;AA+BnC;;;;;;;AAOG;SACa,UAAU,CACxB,IAAmB,EACnB,YAA2C,EAC3C,QAAA,GAA8C;AAC5C,IAAA,KAAK,EAAE,kBAAkB;AACzB,IAAA,MAAM,EAAE,mBAAmB;AAC5B,CAAA,EAAA;IAED,OAAO;AACL,QAAA,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;AAClB,QAAA,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAClB,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,YAAY,EAAE,KAAK,IAAI,QAAQ,CAAC,KAAK;QAC1D,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,YAAY,EAAE,MAAM,IAAI,QAAQ,CAAC,MAAM;KAC/D;AACH;AAEA;;;AAGG;AACG,SAAU,UAAU,CAAC,IAAuB,EAAA;IAChD,QAAQ,IAAI;AACV,QAAA,KAAK,MAAM;YACT,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE;AACxB,QAAA,KAAK,OAAO;YACV,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;AACvB,QAAA,KAAK,KAAK;YACR,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;AACxB,QAAA,KAAK,QAAQ;YACX,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;QACvB,SAAS;YACP,MAAM,UAAU,GAAU,IAAI;AAC9B,YAAA,OAAO,UAAU;QACnB;;AAEJ;AAaA;;;;;AAKG;AACG,SAAU,sBAAsB,CACpC,MAAe,EACf,OAA0B,EAC1B,MAAe,EACf,OAA0B,EAAA;IAE1B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC;IAE/B,MAAM,aAAa,GAAG,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK,OAAO;IAC/D,MAAM,aAAa,GAAG,OAAO,KAAK,MAAM,IAAI,OAAO,KAAK,OAAO;IAC/D,MAAM,OAAO,GAAG,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IAC3D,MAAM,OAAO,GAAG,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IAC3D,MAAM,SAAS,GAAG,EAAE;AACpB,IAAA,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,GAAG,GAAG,EAAE,IAAI,GAAG,IAAI,CAAC;AAC9D,IAAA,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,GAAG,GAAG,EAAE,IAAI,GAAG,IAAI,CAAC;AAE9D,IAAA,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC;AAClC,IAAA,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC;IAElC,OAAO;AACL,QAAA,EAAE,EAAE,MAAM;QACV,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,EAAE;QACxE,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,EAAE;AACxE,QAAA,EAAE,EAAE,MAAM;KACX;AACH;AAEA;;AAEG;AACG,SAAU,cAAc,CAAC,EAAuB,EAAE,CAAS,EAAA;AAC/D,IAAA,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC;AAChB,IAAA,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE;AACnB,IAAA,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC;AAChB,IAAA,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE;AACnB,IAAA,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;AACtB,IAAA,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE;AACtB,IAAA,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC;IACjB,OAAO;AACL,QAAA,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE;AAC5D,QAAA,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE;KAC7D;AACH;AAEA;;;;AAIG;AACG,SAAU,iBAAiB,CAC/B,KAAc,EACd,EAAuB,EACvB,SAAiB,EACjB,OAAO,GAAG,EAAE,EAAA;AAEZ,IAAA,IAAI,IAAI,GAAG,EAAE,CAAC,EAAE;AAChB,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE;AACjC,QAAA,MAAM,CAAC,GAAG,CAAC,GAAG,OAAO;QACrB,MAAM,IAAI,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,CAAC;QAClC,IAAI,sBAAsB,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,SAAS;AAAE,YAAA,OAAO,IAAI;QACvE,IAAI,GAAG,IAAI;IACb;AACA,IAAA,OAAO,KAAK;AACd;AAEA;;AAEG;AACG,SAAU,aAAa,CAC3B,KAAc,EACd,IAAmB,EACnB,YAA2C,EAC3C,QAA4C,EAAA;IAE5C,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,EAAE,YAAY,EAAE,QAAQ,CAAC;AACpD,IAAA,QACE,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAChB,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK;AAC5B,QAAA,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;QAChB,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM;AAEjC;AAEA;AACM,SAAU,aAAa,CAAC,KAAc,EAAE,IAAe,EAAA;AAC3D,IAAA,QACE,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;QACjB,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK;AAC9B,QAAA,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;QACjB,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM;AAEnC;AAEA;AACM,SAAU,cAAc,CAAC,CAAY,EAAE,CAAY,EAAA;IACvD,QACE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK;QACnB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACnB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM;QACpB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAExB;AAEA;;;;;AAKG;AACG,SAAU,YAAY,CAAC,KAAgB,EAAE,KAAgB,EAAA;AAC7D,IAAA,QACE,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC;AAClB,QAAA,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC;AAClB,QAAA,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK;AAC9C,QAAA,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM;AAEpD;AAEA;;;;AAIG;SACa,kBAAkB,CAChC,KAAmC,EACnC,aAAkC,EAClC,QAA4C,EAAA;AAE5C,IAAA,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;IAClE,IAAI,IAAI,GAAG,QAAQ;IACnB,IAAI,IAAI,GAAG,QAAQ;AACnB,IAAA,IAAI,IAAI,GAAG,CAAC,QAAQ;AACpB,IAAA,IAAI,IAAI,GAAG,CAAC,QAAQ;AACpB,IAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AACxB,QAAA,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,EAAE,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC;AAChE,QAAA,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI;AAAE,YAAA,IAAI,GAAG,GAAG,CAAC,CAAC;AAC9B,QAAA,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI;AAAE,YAAA,IAAI,GAAG,GAAG,CAAC,CAAC;QAC9B,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,GAAG,IAAI;YAAE,IAAI,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK;QACtD,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,IAAI;YAAE,IAAI,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM;IAC1D;IACA,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE;AACtE;AAEA;;;AAGG;AACG,SAAU,SAAS,CAAC,KAAc,EAAE,IAAoB,EAAA;AAC5D,IAAA,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC;AAAE,QAAA,OAAO,KAAK;IAC7C,OAAO;AACL,QAAA,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI;AACpC,QAAA,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI;KACrC;AACH;AAEA;;;;;;AAMG;SACa,cAAc,CAC5B,GAA0B,EAC1B,EAAU,EACV,QAAiB,EAAA;AAEjB,IAAA,IAAI,CAAC,QAAQ;QAAE,OAAO,CAAC,EAAE,CAAC;AAC1B,IAAA,OAAO,GAAG,CAAC,QAAQ,CAAC,EAAE;AACpB,UAAE,GAAG,CAAC,MAAM,CAAC,QAAQ,IAAI,QAAQ,KAAK,EAAE;AACxC,UAAE,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC;AAClB;AAEA;AACO,MAAM,cAAc,GAAG;AAE9B;;;;;AAKG;AACG,SAAU,gBAAgB,CAC9B,KAAgB,EAChB,MAAyD,EACzD,KAAc,EACd,OAAO,GAAG,cAAc,EAAA;IAExB,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,KAAK;AAEnC,IAAA,MAAM,SAAS,GAAG,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,GAAG,IAAI,MAAM,KAAK,IAAI;AACtE,IAAA,MAAM,UAAU,GAAG,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,GAAG,IAAI,MAAM,KAAK,IAAI;AACvE,IAAA,MAAM,QAAQ,GAAG,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,GAAG,IAAI,MAAM,KAAK,IAAI;AACrE,IAAA,MAAM,WAAW,GAAG,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,GAAG,IAAI,MAAM,KAAK,IAAI;IAExE,IAAI,SAAS,EAAE;AACb,QAAA,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC;AACnD,QAAA,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE;AAChB,QAAA,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,EAAE;IAC1B;SAAO,IAAI,UAAU,EAAE;AACrB,QAAA,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;IAClD;IACA,IAAI,QAAQ,EAAE;AACZ,QAAA,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,OAAO,CAAC;AACpD,QAAA,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE;AAChB,QAAA,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,EAAE;IAC5B;SAAO,IAAI,WAAW,EAAE;AACtB,QAAA,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IACpD;IACA,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE;AAChC;AAEA;;;;;AAKG;SACa,cAAc,CAC5B,GAAqB,EACrB,WAAuB,EACvB,eAAmC,EAAA;IAOnC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC;AAClC,IAAA,IAAI,CAAC,IAAI;AAAE,QAAA,OAAO,IAAI;AACtB,IAAA,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC;AACnD,IAAA,IAAI,CAAC,OAAO;AAAE,QAAA,OAAO,IAAI;IACzB,OAAO;QACL,IAAI;AACJ,QAAA,QAAQ,EAAE;YACR,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;YAC9B,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;AAC/B,SAAA;QACD,IAAI,EAAE,OAAO,CAAC,IAAI;QAClB,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,GAAG,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC;KAC1E;AACH;AAEA;;;;AAIG;SACa,oBAAoB,CAClC,IAAmB,EACnB,WAAuB,EACvB,eAAmC,EAAA;AAOnC,IAAA,MAAM,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,eAAe,CAAC;AACrE,IAAA,IAAI,CAAC,GAAG;AAAE,QAAA,OAAO,IAAI;AACrB,IAAA,MAAM,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,eAAe,CAAC;AACrE,IAAA,IAAI,CAAC,GAAG;AAAE,QAAA,OAAO,IAAI;IACrB,OAAO;QACL,MAAM,EAAE,GAAG,CAAC,QAAQ;QACpB,OAAO,EAAE,GAAG,CAAC,IAAI;QACjB,MAAM,EAAE,GAAG,CAAC,QAAQ;QACpB,OAAO,EAAE,GAAG,CAAC,IAAI;KAClB;AACH;AAEA;;;;;;;;;;;AAWG;AACG,SAAU,kBAAkB,CAChC,KAIC,EACD,SAIC,EAAA;IAMD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC;IAC/C,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC;IAC/C,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC;AAEjD,IAAA,MAAM,KAAK,GACT,cAAc,CAAC,IAAI,GAAG;UAClB,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;AACnD,UAAE,KAAK,CAAC,KAAK;IACjB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAC9B,CAAC,IACC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACzB,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;QAClC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CACrC;AACD,IAAA,MAAM,MAAM,GACV,eAAe,CAAC,IAAI,GAAG;UACnB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;AACrD,UAAE,KAAK,CAAC,MAAM;IAElB,OAAO;QACL,KAAK;;;AAGL,QAAA,KAAK,EAAE,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK;QAChE,MAAM;KACP;AACH;AAEA;;;;;;;AAOG;AACG,SAAU,eAAe,CAC7B,KAAc,EACd,KAAmC,EACnC,WAAuB,EACvB,eAAmC,EACnC,SAAiB,EAAA;AAEjB,IAAA,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC1C,QAAA,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;AACrB,QAAA,IAAI,CAAC,IAAI;YAAE;QACX,MAAM,IAAI,GAAG,oBAAoB,CAAC,IAAI,EAAE,WAAW,EAAE,eAAe,CAAC;AACrE,QAAA,IAAI,CAAC,IAAI;YAAE;QACX,MAAM,EAAE,GAAG,sBAAsB,CAC/B,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,OAAO,CACb;;;;;;;AAOD,QAAA,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS;YACpE;AACF,QAAA,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS;YACpE;AACF,QAAA,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS;YACpE;AACF,QAAA,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS;YACpE;AACF,QAAA,IAAI,iBAAiB,CAAC,KAAK,EAAE,EAAE,EAAE,SAAS,CAAC;YAAE,OAAO,IAAI,CAAC,EAAE;IAC7D;AACA,IAAA,OAAO,IAAI;AACb;AAEA;AAEA,SAAS,sBAAsB,CAAC,CAAU,EAAE,CAAU,EAAE,CAAU,EAAA;IAChE,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;IACnC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACxD,IAAA,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK;IACvD,IAAI,CAAC,GAAG,CAAC;QAAE,CAAC,GAAG,CAAC;SACX,IAAI,CAAC,GAAG,CAAC;QAAE,CAAC,GAAG,CAAC;AACrB,IAAA,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACjE;;;;"}

package/dist/esm/components/editor/NodeGraph/sortSlots.js

@@ -0,0 +1,69 @@
+import React from 'react';
+import { devWarn } from '../../../utils/devWarn.js';
+import { NODE_GRAPH_SLOT } from './NodeGraph.types.js';
+
+function getSlotKind(el) {
+    if (typeof el.type !== 'function' && typeof el.type !== 'object') {
+        return null;
+    }
+    const marker = el.type[NODE_GRAPH_SLOT];
+    return marker ?? null;
+}
+/**
+ * Walk `<NodeGraph>` children, recognise the compound slot subcomponents
+ * (`<NodeGraph.Background>`, `<NodeGraph.Minimap>`, `<NodeGraph.Toolbar>`,
+ * `<NodeGraph.SpawnPalette>`), and collect their props. Anything else
+ * triggers a dev-time warning — the main component never renders raw
+ * children, only the recognised slots in the right places of its tree.
+ */
+function sortSlots(children) {
+    // `null as T | null` (rather than `: T | null = null`) keeps the flow type a
+    // nullable union: these are only ever assigned inside the `forEach` callback
+    // below, and TypeScript can't see closure mutations, so a plain `= null`
+    // would narrow them to `null` and make the `!== null` checks below look dead.
+    let backgroundProps = null;
+    let minimapProps = null;
+    let spawnPaletteProps = null;
+    const toolbars = [];
+    React.Children.forEach(children, child => {
+        if (!React.isValidElement(child)) {
+            if (child != null && child !== false) {
+                devWarn('[NodeGraph] children must be slot subcomponents (<NodeGraph.Background />, <NodeGraph.Minimap />, <NodeGraph.Toolbar />, <NodeGraph.SpawnPalette />).');
+            }
+            return;
+        }
+        const kind = getSlotKind(child);
+        if (kind === 'background') {
+            backgroundProps = child.props;
+        }
+        else if (kind === 'minimap') {
+            minimapProps = child.props;
+        }
+        else if (kind === 'toolbar') {
+            toolbars.push(child.props);
+        }
+        else if (kind === 'spawn-palette') {
+            spawnPaletteProps = child.props;
+        }
+        else {
+            const dn = child.type
+                ?.displayName;
+            if (dn?.startsWith('NodeGraph.')) {
+                devWarn(`[NodeGraph] child "${dn}" looks like a slot subcomponent but lacks the ` +
+                    'NODE_GRAPH_SLOT marker. If you wrapped it in React.memo or HOCs, copy the ' +
+                    'marker symbol over to the wrapper.');
+            }
+        }
+    });
+    return {
+        hasBackground: backgroundProps !== null,
+        backgroundProps,
+        hasMinimap: minimapProps !== null,
+        minimapProps,
+        toolbars,
+        spawnPaletteProps,
+    };
+}
+
+export { sortSlots };
+//# sourceMappingURL=sortSlots.js.map

package/dist/esm/components/editor/NodeGraph/sortSlots.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sortSlots.js","sources":["src/components/editor/NodeGraph/sortSlots.ts"],"sourcesContent":["import React from 'react';\n\nimport { devWarn } from '@/utils/devWarn';\n\nimport { NODE_GRAPH_SLOT } from './NodeGraph.types';\nimport {\n  NodeGraphBackground,\n  NodeGraphMinimap,\n  NodeGraphSpawnPalette,\n  NodeGraphToolbar,\n} from './NodeGraphSlots';\n\nimport type { NodeGraphSlotKind, NodeGraphSlotMarker } from './NodeGraph.types';\n\ntype NodeGraphBackgroundProps = React.ComponentProps<\n  typeof NodeGraphBackground\n>;\ntype NodeGraphMinimapProps = React.ComponentProps<typeof NodeGraphMinimap>;\ntype NodeGraphToolbarProps = React.ComponentProps<typeof NodeGraphToolbar>;\ntype NodeGraphSpawnPaletteProps = React.ComponentProps<\n  typeof NodeGraphSpawnPalette\n>;\n\nexport interface SortedSlots {\n  hasBackground: boolean;\n  backgroundProps: NodeGraphBackgroundProps | null;\n  hasMinimap: boolean;\n  minimapProps: NodeGraphMinimapProps | null;\n  /** Multiple toolbars can co-exist (e.g. top-left + top-right). */\n  toolbars: ReadonlyArray<NodeGraphToolbarProps>;\n  spawnPaletteProps: NodeGraphSpawnPaletteProps | null;\n}\n\nfunction getSlotKind(el: React.ReactElement): NodeGraphSlotKind | null {\n  if (typeof el.type !== 'function' && typeof el.type !== 'object') {\n    return null;\n  }\n  const marker = (el.type as Partial<NodeGraphSlotMarker>)[NODE_GRAPH_SLOT];\n  return marker ?? null;\n}\n\n/**\n * Walk `<NodeGraph>` children, recognise the compound slot subcomponents\n * (`<NodeGraph.Background>`, `<NodeGraph.Minimap>`, `<NodeGraph.Toolbar>`,\n * `<NodeGraph.SpawnPalette>`), and collect their props. Anything else\n * triggers a dev-time warning — the main component never renders raw\n * children, only the recognised slots in the right places of its tree.\n */\nexport function sortSlots(children: React.ReactNode): SortedSlots {\n  // `null as T | null` (rather than `: T | null = null`) keeps the flow type a\n  // nullable union: these are only ever assigned inside the `forEach` callback\n  // below, and TypeScript can't see closure mutations, so a plain `= null`\n  // would narrow them to `null` and make the `!== null` checks below look dead.\n  let backgroundProps = null as NodeGraphBackgroundProps | null;\n  let minimapProps = null as NodeGraphMinimapProps | null;\n  let spawnPaletteProps = null as NodeGraphSpawnPaletteProps | null;\n  const toolbars: NodeGraphToolbarProps[] = [];\n  React.Children.forEach(children, child => {\n    if (!React.isValidElement(child)) {\n      if (child != null && child !== false) {\n        devWarn(\n          '[NodeGraph] children must be slot subcomponents (<NodeGraph.Background />, <NodeGraph.Minimap />, <NodeGraph.Toolbar />, <NodeGraph.SpawnPalette />).'\n        );\n      }\n      return;\n    }\n    const kind = getSlotKind(child);\n    if (kind === 'background') {\n      backgroundProps = child.props as NodeGraphBackgroundProps;\n    } else if (kind === 'minimap') {\n      minimapProps = child.props as NodeGraphMinimapProps;\n    } else if (kind === 'toolbar') {\n      toolbars.push(child.props as NodeGraphToolbarProps);\n    } else if (kind === 'spawn-palette') {\n      spawnPaletteProps = child.props as NodeGraphSpawnPaletteProps;\n    } else {\n      const dn = (child.type as { displayName?: string } | undefined)\n        ?.displayName;\n      if (dn?.startsWith('NodeGraph.')) {\n        devWarn(\n          `[NodeGraph] child \"${dn}\" looks like a slot subcomponent but lacks the ` +\n            'NODE_GRAPH_SLOT marker. If you wrapped it in React.memo or HOCs, copy the ' +\n            'marker symbol over to the wrapper.'\n        );\n      }\n    }\n  });\n  return {\n    hasBackground: backgroundProps !== null,\n    backgroundProps,\n    hasMinimap: minimapProps !== null,\n    minimapProps,\n    toolbars,\n    spawnPaletteProps,\n  };\n}\n"],"names":[],"mappings":";;;;AAiCA,SAAS,WAAW,CAAC,EAAsB,EAAA;AACzC,IAAA,IAAI,OAAO,EAAE,CAAC,IAAI,KAAK,UAAU,IAAI,OAAO,EAAE,CAAC,IAAI,KAAK,QAAQ,EAAE;AAChE,QAAA,OAAO,IAAI;IACb;IACA,MAAM,MAAM,GAAI,EAAE,CAAC,IAAqC,CAAC,eAAe,CAAC;IACzE,OAAO,MAAM,IAAI,IAAI;AACvB;AAEA;;;;;;AAMG;AACG,SAAU,SAAS,CAAC,QAAyB,EAAA;;;;;IAKjD,IAAI,eAAe,GAAG,IAAuC;IAC7D,IAAI,YAAY,GAAG,IAAoC;IACvD,IAAI,iBAAiB,GAAG,IAAyC;IACjE,MAAM,QAAQ,GAA4B,EAAE;IAC5C,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,IAAG;QACvC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE;YAChC,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,EAAE;gBACpC,OAAO,CACL,uJAAuJ,CACxJ;YACH;YACA;QACF;AACA,QAAA,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC;AAC/B,QAAA,IAAI,IAAI,KAAK,YAAY,EAAE;AACzB,YAAA,eAAe,GAAG,KAAK,CAAC,KAAiC;QAC3D;AAAO,aAAA,IAAI,IAAI,KAAK,SAAS,EAAE;AAC7B,YAAA,YAAY,GAAG,KAAK,CAAC,KAA8B;QACrD;AAAO,aAAA,IAAI,IAAI,KAAK,SAAS,EAAE;AAC7B,YAAA,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,KAA8B,CAAC;QACrD;AAAO,aAAA,IAAI,IAAI,KAAK,eAAe,EAAE;AACnC,YAAA,iBAAiB,GAAG,KAAK,CAAC,KAAmC;QAC/D;aAAO;AACL,YAAA,MAAM,EAAE,GAAI,KAAK,CAAC;AAChB,kBAAE,WAAW;AACf,YAAA,IAAI,EAAE,EAAE,UAAU,CAAC,YAAY,CAAC,EAAE;gBAChC,OAAO,CACL,CAAA,mBAAA,EAAsB,EAAE,CAAA,+CAAA,CAAiD;oBACvE,4EAA4E;AAC5E,oBAAA,oCAAoC,CACvC;YACH;QACF;AACF,IAAA,CAAC,CAAC;IACF,OAAO;QACL,aAAa,EAAE,eAAe,KAAK,IAAI;QACvC,eAAe;QACf,UAAU,EAAE,YAAY,KAAK,IAAI;QACjC,YAAY;QACZ,QAAQ;QACR,iBAAiB;KAClB;AACH;;;;"}

package/dist/esm/components/editor/NodeGraph/useDragGesture.js

@@ -0,0 +1,63 @@
+"use client";
+import { useRef, useLayoutEffect, useCallback } from 'react';
+
+/**
+ * Mechanical lifecycle for a pointer-capture drag gesture, shared by the node
+ * and group drag controllers. Owns pointer capture, document listener
+ * attach/detach, the per-pointer id guard, and cleanup on unmount — leaving
+ * each hook to supply only its own move / cancel / up business logic. Document
+ * listeners exist only while a gesture is in flight, so there's zero
+ * pointermove cost between drags.
+ */
+function useDragGesture() {
+    const activeRef = useRef(null);
+    // Release in-flight document listeners if the component unmounts mid-drag.
+    useLayoutEffect(() => {
+        return () => {
+            activeRef.current?.teardown();
+            activeRef.current = null;
+        };
+    }, []);
+    const begin = useCallback((event, handlers) => {
+        activeRef.current?.teardown();
+        const pointerId = event.pointerId;
+        event.currentTarget.setPointerCapture(pointerId);
+        const handleMove = (e) => {
+            if (e.pointerId !== pointerId)
+                return;
+            handlers.onMove(e);
+        };
+        const handleCancel = (e) => {
+            if (e.pointerId !== pointerId)
+                return;
+            teardown();
+            handlers.onCancel();
+        };
+        // Function declaration (hoisted) so the handlers above can close over it.
+        function teardown() {
+            document.removeEventListener('pointermove', handleMove);
+            document.removeEventListener('pointercancel', handleCancel);
+            if (activeRef.current?.pointerId === pointerId) {
+                activeRef.current = null;
+            }
+        }
+        document.addEventListener('pointermove', handleMove);
+        document.addEventListener('pointercancel', handleCancel);
+        activeRef.current = { pointerId, teardown };
+    }, []);
+    const finish = useCallback((event) => {
+        const active = activeRef.current;
+        if (active?.pointerId !== event.pointerId)
+            return false;
+        const target = event.currentTarget;
+        if (target.hasPointerCapture(event.pointerId)) {
+            target.releasePointerCapture(event.pointerId);
+        }
+        active.teardown();
+        return true;
+    }, []);
+    return { begin, finish };
+}
+
+export { useDragGesture };
+//# sourceMappingURL=useDragGesture.js.map

package/dist/esm/components/editor/NodeGraph/useDragGesture.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"useDragGesture.js","sources":["src/components/editor/NodeGraph/useDragGesture.ts"],"sourcesContent":["'use client';\n\nimport { useCallback, useLayoutEffect, useRef } from 'react';\n\nimport type React from 'react';\n\ninterface ActiveGesture {\n  pointerId: number;\n  teardown: () => void;\n}\n\nexport interface DragGestureHandlers {\n  /** Fired on each document `pointermove` for the captured pointer. */\n  onMove: (event: PointerEvent) => void;\n  /**\n   * Fired on `pointercancel` for the captured pointer. Document listeners are\n   * already detached by the time this runs — just reset business state.\n   */\n  onCancel: () => void;\n}\n\nexport interface DragGestureControls {\n  /**\n   * Begin a pointer-drag on `event.currentTarget`: capture the pointer, attach\n   * document `pointermove` / `pointercancel` listeners, and remember the\n   * gesture so `finish` (or unmount) can release it. Any gesture still in\n   * flight is torn down first — defensive against a lost `pointercancel`\n   * (e.g. pointer capture dropped on alt-tab between moves).\n   */\n  begin: (\n    event: React.PointerEvent<HTMLElement>,\n    handlers: DragGestureHandlers\n  ) => void;\n  /**\n   * Finish from a `pointerup` handler: release pointer capture and detach the\n   * document listeners. Returns `false` when the up doesn't belong to the\n   * active gesture (stale or secondary pointer) so the caller can bail.\n   */\n  finish: (event: React.PointerEvent<HTMLElement>) => boolean;\n}\n\n/**\n * Mechanical lifecycle for a pointer-capture drag gesture, shared by the node\n * and group drag controllers. Owns pointer capture, document listener\n * attach/detach, the per-pointer id guard, and cleanup on unmount — leaving\n * each hook to supply only its own move / cancel / up business logic. Document\n * listeners exist only while a gesture is in flight, so there's zero\n * pointermove cost between drags.\n */\nexport function useDragGesture(): DragGestureControls {\n  const activeRef = useRef<ActiveGesture | null>(null);\n\n  // Release in-flight document listeners if the component unmounts mid-drag.\n  useLayoutEffect(() => {\n    return () => {\n      activeRef.current?.teardown();\n      activeRef.current = null;\n    };\n  }, []);\n\n  const begin = useCallback(\n    (\n      event: React.PointerEvent<HTMLElement>,\n      handlers: DragGestureHandlers\n    ): void => {\n      activeRef.current?.teardown();\n\n      const pointerId = event.pointerId;\n      event.currentTarget.setPointerCapture(pointerId);\n\n      const handleMove = (e: PointerEvent): void => {\n        if (e.pointerId !== pointerId) return;\n        handlers.onMove(e);\n      };\n      const handleCancel = (e: PointerEvent): void => {\n        if (e.pointerId !== pointerId) return;\n        teardown();\n        handlers.onCancel();\n      };\n      // Function declaration (hoisted) so the handlers above can close over it.\n      function teardown(): void {\n        document.removeEventListener('pointermove', handleMove);\n        document.removeEventListener('pointercancel', handleCancel);\n        if (activeRef.current?.pointerId === pointerId) {\n          activeRef.current = null;\n        }\n      }\n\n      document.addEventListener('pointermove', handleMove);\n      document.addEventListener('pointercancel', handleCancel);\n      activeRef.current = { pointerId, teardown };\n    },\n    []\n  );\n\n  const finish = useCallback(\n    (event: React.PointerEvent<HTMLElement>): boolean => {\n      const active = activeRef.current;\n      if (active?.pointerId !== event.pointerId) return false;\n      const target = event.currentTarget;\n      if (target.hasPointerCapture(event.pointerId)) {\n        target.releasePointerCapture(event.pointerId);\n      }\n      active.teardown();\n      return true;\n    },\n    []\n  );\n\n  return { begin, finish };\n}\n"],"names":[],"mappings":";;;AAyCA;;;;;;;AAOG;;AAED;;;AAIE;AACE;AACA;AACF;;;AAQE;AAEA;AACA;AAEA;AACE;;AACA;AACF;AACA;AACE;;AACA;;AAEF;;AAEA;AACE;AACA;;AAEE;;;AAIJ;AACA;;;AAMJ;AAEI;AACA;AAA2C;AAC3C;;AAEE;;;AAGF;;AAKJ;AACF;;"}