@nvidia-elements/core 2.22.4 → 2.23.0

package/dist/workspace/utils/placement/acquisition-sizing.utils.js

@@ -0,0 +1,152 @@
+import { getPanelIds as e } from "../model/layout.utils.js";
+import { projectLayout as t } from "../model/operations.utils.js";
+import { matchesPlacementIntent as n } from "../interaction/drag-preview.utils.js";
+import { getAllocatedContextRect as r, getContextKey as i } from "./context.utils.js";
+import { rebaseProjectedSplit as a } from "../model/projection.utils.js";
+import { describePlacementSlot as o } from "./group-insertion.utils.js";
+import { getMinimumWorkspaceDimensions as s } from "../geometry/sizing.utils.js";
+import { fitSizes as c } from "../geometry/partition.utils.js";
+import { allocateWorkspace as l } from "../geometry/allocation.utils.js";
+// src/workspace/utils/placement/acquisition-sizing.utils.ts
+function u(e) {
+	let t = o(e);
+	if (!d(t, o({
+		...e,
+		plan: { layout: e.previous }
+	}))) return e.plan;
+	let n = p(e, t.axis), r = n.allocate(e.plan.layout).groups.find((t) => t.group.panels.every((t) => e.source.includes(t)));
+	if (!r) return;
+	if (f(n, r.rect)) return e.plan;
+	let i = h(n, r.key), a = i && _(n, i, r.key), s = a && n.allocate(a).groups.find((e) => e.key === r.key);
+	return a && f(n, s?.rect) ? {
+		...e.plan,
+		layout: a
+	} : void 0;
+}
+function d(e, t) {
+	return !!e?.previous && !!e.next && !!t && (e.axis !== t.axis || i(e.members) !== i(t.members));
+}
+function f(e, t) {
+	return !!t && e.covers(t, "x") && e.covers(t, "y");
+}
+function p(e, n) {
+	let r = n === "horizontal" ? "x" : "y", i = r === "x" ? "width" : "height", a = (t) => t === r ? {
+		start: e.acquisition.rect[r],
+		end: e.acquisition.rect[r] + e.acquisition.rect[i]
+	} : {
+		start: e.acquisition.point[t],
+		end: e.acquisition.point[t]
+	};
+	return {
+		input: e,
+		axis: r,
+		extent: i,
+		range: a,
+		covers: (e, t) => m(e, t, a(t)),
+		allocate: (n) => l({
+			root: t(n, e.available).root,
+			rect: e.rect,
+			minimum: (t) => s(t, e.requirements),
+			policy: "stop",
+			gap: e.requirements.gap
+		})
+	};
+}
+function m(e, t, n) {
+	let r = e[t] + e[t === "x" ? "width" : "height"];
+	return n.start === n.end ? e[t] <= n.start && n.start < r : e[t] <= n.start + 1e-7 && r >= n.end - 1e-7;
+}
+function h(e, t) {
+	let n = t.split("."), r = e.input.plan.layout;
+	for (let t = 1; t < n.length - 1; t++) {
+		if (!r) return;
+		let i = n.slice(0, t).join("."), a = e.allocate(r).regions, o = a.find((e) => e.key === i), s = a.find((e) => e.key === `${i}.${n[t]}`);
+		if (o.node.type !== "split") return;
+		let c = o.node.axis === "horizontal" ? "x" : "y";
+		e.covers(s.rect, c) || (r = g({
+			fit: e,
+			layout: r,
+			parent: o,
+			index: Number(n[t])
+		}));
+	}
+	return r;
+}
+function g({ fit: t, layout: n, parent: i, index: o }) {
+	if (i.node.type !== "split") return;
+	let l = i.node.axis === "horizontal" ? "width" : "height", u = i.node.children.map((e) => s(e, t.input.requirements)[l]), d = i.rect[l] - t.input.requirements.gap * (u.length - 1), f = i.node.children.map((n, i) => i === o ? 0 : r({
+		members: e(n),
+		allocation: t.input.current,
+		source: t.input.source
+	})?.[l]);
+	if (f.some((e) => e === void 0) || y(u) > d) return;
+	let p = f.map((e) => e);
+	return p[o] = Math.max(u[o], d - y(p)), a(n, i.node, c(p, u, d), t.input.available) ?? n;
+}
+function _(e, t, n) {
+	let r = e.allocate(t), i = r.regions.find((e) => e.key === n.split(".").slice(0, -1).join("."));
+	if (i.node.type !== "split") return;
+	let o = r.groups.find((e) => e.key === n), s = Number(n.split(".").at(-1)), c = v({
+		fit: e,
+		owner: {
+			...i,
+			node: i.node
+		},
+		incoming: o.rect,
+		index: s
+	});
+	if (c) return a(t, i.node, c, e.input.available) ?? t;
+}
+function v(e) {
+	let { fit: t, owner: n, incoming: r, index: i } = e, { axis: a, extent: o } = t, l = n.node.children.map((e) => s(e, t.input.requirements)[o]), u = l.slice(0, i), d = l.slice(i + 1), f = Math.max(n.rect[a] + y(u) + t.input.requirements.gap * i, t.range(a).end - r[o]), p = Math.min(n.rect[a] + n.rect[o] - y(d) - t.input.requirements.gap * d.length - r[o], t.range(a).start);
+	if (f > p) return;
+	let m = Math.max(f, Math.min(r[a], p));
+	return [
+		...c(n.node.weights.slice(0, i), u, m - n.rect[a] - t.input.requirements.gap * i),
+		r[o],
+		...c(n.node.weights.slice(i + 1), d, n.rect[a] + n.rect[o] - m - r[o] - t.input.requirements.gap * d.length)
+	];
+}
+var y = (e) => e.reduce((e, t) => e + t, 0);
+function b(e) {
+	let t = e.previous;
+	if (C(t, e.intent) && !e.acquisition) return;
+	if (!S(t, e.source) || !x(t, e.plan)) return e.plan;
+	let n = o({
+		...e,
+		plan: t
+	}), r = o(e);
+	if (n && n.key === r?.key) return {
+		...e.plan,
+		layout: t.layout
+	};
+	if (!e.acquisition) return e.plan;
+	let { rect: i, point: a } = e.acquisition;
+	return u({
+		...e,
+		previous: t.layout,
+		acquisition: {
+			rect: {
+				...i,
+				x: i.x - e.clientOrigin.x,
+				y: i.y - e.clientOrigin.y
+			},
+			point: {
+				x: a.x - e.clientOrigin.x,
+				y: a.y - e.clientOrigin.y
+			}
+		}
+	});
+}
+function x(e, t) {
+	return ["order", "insert"].includes(e.intent.kind) && ["insert", "reorder"].includes(t.kind);
+}
+function S(e, t) {
+	return e?.phase === "detached" && !e.blocked && e.allocation === "reserved" && i(e.source) === i(t);
+}
+function C(e, t) {
+	return e?.phase === "detached" && e.blocked && n(e.intent, t);
+}
+export { u as fitAcquiredPlacement, b as resolveSelectedPlacementPlan };
+
+//# sourceMappingURL=acquisition-sizing.utils.js.map

package/dist/workspace/utils/placement/acquisition-sizing.utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"acquisition-sizing.utils.js","names":["fitAcquiredPlacement","next","describePlacementSlot","input","crossScopeInterior","fit","acquisitionFit","moving","group","id","coversAcquisition","ancestors","fitReceivingPath","layout","fitIncoming","achieved","prior","getContextKey","rect","axis","direction","extent","range","dimension","coversRange","allocateWorkspace","projectLayout","getMinimumWorkspaceDimensions","node","end","path","depth","key","regions","parent","region","receiving","fitAncestor","size","minima","child","budget","extents","slot","index","getAllocatedContextRect","getPanelIds","value","sum","preferred","rebaseProjectedSplit","fitSizes","allocation","owner","incoming","sizes","incomingSizes","before","after","start","position","values","total","resolveSelectedPlacementPlan","blockedSelection","selectedReservation","spatialReservation","current","point","preview","plan","source","matchesPlacementIntent","intent"],"sources":["../../../../src/workspace/utils/placement/acquisition-sizing.utils.ts"],"sourcesContent":["// SPDX-FileCopyrightText: Copyright (c) 2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.\n// SPDX-License-Identifier: Apache-2.0\n\nimport type { Point, Rect } from '@nvidia-elements/core/internal';\n\nimport { allocateWorkspace } from '../geometry/allocation.utils.js';\nimport { fitSizes } from '../geometry/partition.utils.js';\nimport { getMinimumWorkspaceDimensions } from '../geometry/sizing.utils.js';\nimport { matchesPlacementIntent } from '../interaction/drag-preview.utils.js';\nimport { getPanelIds } from '../model/layout.utils.js';\nimport { projectLayout } from '../model/operations.utils.js';\nimport { rebaseProjectedSplit } from '../model/projection.utils.js';\nimport { getAllocatedContextRect, getContextKey } from './context.utils.js';\nimport { describePlacementSlot } from './group-insertion.utils.js';\n\nimport type { WorkspacePlacedRegion } from '../geometry/allocation.utils.js';\nimport type { WorkspaceRequirements } from '../geometry/sizing.utils.js';\nimport type { WorkspaceDragPreview, WorkspaceDropIntent } from '../interaction/drag-preview.utils.js';\nimport type { WorkspaceLayout, WorkspaceSplit } from '../model/layout.utils.js';\nimport type { WorkspacePlacementPlan } from './planner.utils.js';\n\ninterface AcquisitionInput {\n  plan: WorkspacePlacementPlan;\n  previous: WorkspaceLayout;\n  source: string[];\n  available: string[];\n  current: WorkspacePlacedRegion[];\n  rect: Rect;\n  acquisition: { rect: Rect; point: Point };\n  requirements: WorkspaceRequirements;\n}\n\ninterface Fit {\n  input: AcquisitionInput;\n  axis: 'x' | 'y';\n  extent: 'width' | 'height';\n  range: (axis: 'x' | 'y') => { start: number; end: number };\n  covers: (rect: Rect, axis: 'x' | 'y') => boolean;\n  allocate: (layout: WorkspaceLayout) => ReturnType<typeof allocateWorkspace>;\n}\n\n/** Fits a cross-scope interior reservation to its acquired allocation without retaining a hidden target. */\nexport function fitAcquiredPlacement(input: AcquisitionInput): WorkspacePlacementPlan | undefined {\n  const next = describePlacementSlot(input);\n  const prior = describePlacementSlot({ ...input, plan: { layout: input.previous } });\n  if (!crossScopeInterior(next, prior)) return input.plan;\n  const fit = acquisitionFit(input, next.axis);\n  const moving = fit\n    .allocate(input.plan.layout)\n    .groups.find(group => group.group.panels.every(id => input.source.includes(id)));\n  if (!moving) return undefined;\n  if (coversAcquisition(fit, moving.rect)) return input.plan;\n  const ancestors = fitReceivingPath(fit, moving.key);\n  const layout = ancestors && fitIncoming(fit, ancestors, moving.key);\n  const achieved = layout && fit.allocate(layout).groups.find(group => group.key === moving.key);\n  return layout && coversAcquisition(fit, achieved?.rect) ? { ...input.plan, layout } : undefined;\n}\n\nfunction crossScopeInterior(\n  next: ReturnType<typeof describePlacementSlot>,\n  prior: ReturnType<typeof describePlacementSlot>\n): next is NonNullable<typeof next> {\n  return (\n    !!next?.previous &&\n    !!next.next &&\n    !!prior &&\n    (next.axis !== prior.axis || getContextKey(next.members) !== getContextKey(prior.members))\n  );\n}\n\nfunction coversAcquisition(fit: Fit, rect?: Rect) {\n  return !!rect && fit.covers(rect, 'x') && fit.covers(rect, 'y');\n}\n\nfunction acquisitionFit(input: AcquisitionInput, direction: WorkspaceSplit['axis']): Fit {\n  const axis = direction === 'horizontal' ? 'x' : 'y';\n  const extent = axis === 'x' ? 'width' : 'height';\n  const range = (dimension: 'x' | 'y') =>\n    dimension === axis\n      ? { start: input.acquisition.rect[axis], end: input.acquisition.rect[axis] + input.acquisition.rect[extent] }\n      : { start: input.acquisition.point[dimension], end: input.acquisition.point[dimension] };\n  return {\n    input,\n    axis,\n    extent,\n    range,\n    covers: (rect, dimension) => coversRange(rect, dimension, range(dimension)),\n    allocate: layout =>\n      allocateWorkspace({\n        root: projectLayout(layout, input.available).root,\n        rect: input.rect,\n        minimum: node => getMinimumWorkspaceDimensions(node, input.requirements),\n        policy: 'stop',\n        gap: input.requirements.gap\n      })\n  };\n}\n\nfunction coversRange(rect: Rect, axis: 'x' | 'y', range: { start: number; end: number }) {\n  const end = rect[axis] + rect[axis === 'x' ? 'width' : 'height'];\n  return range.start === range.end\n    ? rect[axis] <= range.start && range.start < end\n    : rect[axis] <= range.start + 1e-7 && end >= range.end - 1e-7;\n}\n\nfunction fitReceivingPath(fit: Fit, moving: string) {\n  const path = moving.split('.');\n  let layout: WorkspaceLayout | undefined = fit.input.plan.layout;\n  for (let depth = 1; depth < path.length - 1; depth++) {\n    if (!layout) return undefined;\n    const key = path.slice(0, depth).join('.');\n    const regions = fit.allocate(layout).regions;\n    const parent = regions.find(region => region.key === key)!;\n    const receiving = regions.find(region => region.key === `${key}.${path[depth]}`)!;\n    if (parent.node.type !== 'split') return undefined;\n    const axis = parent.node.axis === 'horizontal' ? 'x' : 'y';\n    if (!fit.covers(receiving.rect, axis)) {\n      layout = fitAncestor({ fit, layout, parent, index: Number(path[depth]) });\n    }\n  }\n  return layout;\n}\n\nfunction fitAncestor({\n  fit,\n  layout,\n  parent,\n  index\n}: {\n  fit: Fit;\n  layout: WorkspaceLayout;\n  parent: WorkspacePlacedRegion;\n  index: number;\n}) {\n  if (parent.node.type !== 'split') return undefined;\n  const size = parent.node.axis === 'horizontal' ? 'width' : 'height';\n  const minima = parent.node.children.map(child => getMinimumWorkspaceDimensions(child, fit.input.requirements)[size]);\n  const budget = parent.rect[size] - fit.input.requirements.gap * (minima.length - 1);\n  const extents = parent.node.children.map((child, slot) =>\n    slot === index\n      ? 0\n      : getAllocatedContextRect({\n          members: getPanelIds(child),\n          allocation: fit.input.current,\n          source: fit.input.source\n        })?.[size]\n  );\n  if (extents.some(value => value === undefined) || sum(minima) > budget) return undefined;\n  const preferred = extents.map(value => value!);\n  preferred[index] = Math.max(minima[index]!, budget - sum(preferred));\n  return rebaseProjectedSplit(layout, parent.node, fitSizes(preferred, minima, budget), fit.input.available) ?? layout;\n}\n\nfunction fitIncoming(fit: Fit, layout: WorkspaceLayout, key: string) {\n  const allocation = fit.allocate(layout);\n  const owner = allocation.regions.find(region => region.key === key.split('.').slice(0, -1).join('.'))!;\n  if (owner.node.type !== 'split') return undefined;\n  const incoming = allocation.groups.find(group => group.key === key)!;\n  const index = Number(key.split('.').at(-1));\n  const sizes = incomingSizes({ fit, owner: { ...owner, node: owner.node }, incoming: incoming.rect, index });\n  if (!sizes) return undefined;\n\n  const rebased = rebaseProjectedSplit(layout, owner.node, sizes, fit.input.available);\n  return rebased ?? layout;\n}\n\nfunction incomingSizes(input: {\n  fit: Fit;\n  owner: WorkspacePlacedRegion & { node: WorkspaceSplit };\n  incoming: Rect;\n  index: number;\n}) {\n  const { fit, owner, incoming, index } = input;\n  const { axis, extent } = fit;\n  const minima = owner.node.children.map(child => getMinimumWorkspaceDimensions(child, fit.input.requirements)[extent]);\n  const before = minima.slice(0, index);\n  const after = minima.slice(index + 1);\n  const start = Math.max(\n    owner.rect[axis] + sum(before) + fit.input.requirements.gap * index,\n    fit.range(axis).end - incoming[extent]\n  );\n  const end = Math.min(\n    owner.rect[axis] + owner.rect[extent] - sum(after) - fit.input.requirements.gap * after.length - incoming[extent],\n    fit.range(axis).start\n  );\n  if (start > end) return undefined;\n  const position = Math.max(start, Math.min(incoming[axis], end));\n  return [\n    ...fitSizes(\n      owner.node.weights.slice(0, index),\n      before,\n      position - owner.rect[axis] - fit.input.requirements.gap * index\n    ),\n    incoming[extent],\n    ...fitSizes(\n      owner.node.weights.slice(index + 1),\n      after,\n      owner.rect[axis] + owner.rect[extent] - position - incoming[extent] - fit.input.requirements.gap * after.length\n    )\n  ];\n}\n\nconst sum = (values: number[]) => values.reduce((total, value) => total + value, 0);\n\n/** Reuses the actual selected reservation before considering a different spatial offer. */\nexport function resolveSelectedPlacementPlan(\n  input: Omit<AcquisitionInput, 'previous' | 'acquisition'> & {\n    previous?: WorkspaceDragPreview;\n    acquisition?: { rect: Rect; point: Point };\n    clientOrigin: Rect;\n    intent: WorkspaceDropIntent;\n  }\n): WorkspacePlacementPlan | undefined {\n  const prior = input.previous;\n  if (blockedSelection(prior, input.intent) && !input.acquisition) return undefined;\n  if (!selectedReservation(prior, input.source) || !spatialReservation(prior, input.plan)) return input.plan;\n  const current = describePlacementSlot({ ...input, plan: prior });\n  const next = describePlacementSlot(input);\n  if (current && current.key === next?.key) return { ...input.plan, layout: prior.layout };\n  if (!input.acquisition) return input.plan;\n  const { rect, point } = input.acquisition;\n  return fitAcquiredPlacement({\n    ...input,\n    previous: prior.layout,\n    acquisition: {\n      rect: { ...rect, x: rect.x - input.clientOrigin.x, y: rect.y - input.clientOrigin.y },\n      point: { x: point.x - input.clientOrigin.x, y: point.y - input.clientOrigin.y }\n    }\n  });\n}\n\nfunction spatialReservation(preview: WorkspaceDragPreview, plan: WorkspacePlacementPlan) {\n  return ['order', 'insert'].includes(preview.intent.kind) && ['insert', 'reorder'].includes(plan.kind);\n}\n\nfunction selectedReservation(\n  preview: WorkspaceDragPreview | undefined,\n  source: string[]\n): preview is Extract<WorkspaceDragPreview, { phase: 'detached' }> & { allocation: 'reserved' } {\n  return (\n    preview?.phase === 'detached' &&\n    !preview.blocked &&\n    preview.allocation === 'reserved' &&\n    getContextKey(preview.source) === getContextKey(source)\n  );\n}\n\nfunction blockedSelection(preview: WorkspaceDragPreview | undefined, intent: WorkspaceDropIntent) {\n  return preview?.phase === 'detached' && preview.blocked && matchesPlacementIntent(preview.intent, intent);\n}\n"],"mappings":";;;;;;;;;;AA0CA,SAAgBA,EAAqB,GAA6D;CAChG,IAAMC,IAAOC,EAAsBC,CAAK;CAExC,IAAI,CAACC,EAAmBH,GADVC,EAAsB;EAAE,GAAGC;EAAO,MAAM,EAAE,QAAQA,EAAM,SAAS;CAAE,CACnD,CAAK,GAAG,OAAOA,EAAM;CACnD,IAAME,IAAMC,EAAeH,GAAOF,EAAK,IAAI,GACrCM,IAASF,EACZ,SAASF,EAAM,KAAK,MAAM,CAAC,CAC3B,OAAO,MAAK,MAASK,EAAM,MAAM,OAAO,OAAM,MAAML,EAAM,OAAO,SAASM,CAAE,CAAC,CAAC;CACjF,IAAI,CAACF,GAAQ;CACb,IAAIG,EAAkBL,GAAKE,EAAO,IAAI,GAAG,OAAOJ,EAAM;CACtD,IAAMQ,IAAYC,EAAiBP,GAAKE,EAAO,GAAG,GAC5CM,IAASF,KAAaG,EAAYT,GAAKM,GAAWJ,EAAO,GAAG,GAC5DQ,IAAWF,KAAUR,EAAI,SAASQ,CAAM,CAAC,CAAC,OAAO,MAAK,MAASL,EAAM,QAAQD,EAAO,GAAG;CAC7F,OAAOM,KAAUH,EAAkBL,GAAKU,GAAU,IAAI,IAAI;EAAE,GAAGZ,EAAM;EAAM;CAAO,IAAI,KAAA;AACxF;AAEA,SAASC,EACP,GACA,GACkC;CAClC,OACE,CAAC,CAACH,GAAM,YACR,CAAC,CAACA,EAAK,QACP,CAAC,CAACe,MACDf,EAAK,SAASe,EAAM,QAAQC,EAAchB,EAAK,OAAO,MAAMgB,EAAcD,EAAM,OAAO;AAE5F;AAEA,SAASN,EAAkB,GAAU,GAAa;CAChD,OAAO,CAAC,CAACQ,KAAQb,EAAI,OAAOa,GAAM,GAAG,KAAKb,EAAI,OAAOa,GAAM,GAAG;AAChE;AAEA,SAASZ,EAAe,GAAyB,GAAwC;CACvF,IAAMa,IAAOC,MAAc,eAAe,MAAM,KAC1CC,IAASF,MAAS,MAAM,UAAU,UAClCG,KAAS,MACbC,MAAcJ,IACV;EAAE,OAAOhB,EAAM,YAAY,KAAKgB;EAAO,KAAKhB,EAAM,YAAY,KAAKgB,KAAQhB,EAAM,YAAY,KAAKkB;CAAQ,IAC1G;EAAE,OAAOlB,EAAM,YAAY,MAAMoB;EAAY,KAAKpB,EAAM,YAAY,MAAMoB;CAAW;CAC3F,OAAO;EACL;EACA;EACA;EACA;EACA,SAAS,GAAM,MAAcC,EAAYN,GAAMK,GAAWD,EAAMC,CAAS,CAAC;EAC1E,WAAU,MACRE,EAAkB;GAChB,MAAMC,EAAcb,GAAQV,EAAM,SAAS,CAAC,CAAC;GAC7C,MAAMA,EAAM;GACZ,UAAS,MAAQwB,EAA8BC,GAAMzB,EAAM,YAAY;GACvE,QAAQ;GACR,KAAKA,EAAM,aAAa;EAC1B,CAAC;CACL;AACF;AAEA,SAASqB,EAAY,GAAY,GAAiB,GAAuC;CACvF,IAAMK,IAAMX,EAAKC,KAAQD,EAAKC,MAAS,MAAM,UAAU;CACvD,OAAOG,EAAM,UAAUA,EAAM,MACzBJ,EAAKC,MAASG,EAAM,SAASA,EAAM,QAAQO,IAC3CX,EAAKC,MAASG,EAAM,QAAQ,QAAQO,KAAOP,EAAM,MAAM;AAC7D;AAEA,SAASV,EAAiB,GAAU,GAAgB;CAClD,IAAMkB,IAAOvB,EAAO,MAAM,GAAG,GACzBM,IAAsCR,EAAI,MAAM,KAAK;CACzD,KAAK,IAAI0B,IAAQ,GAAGA,IAAQD,EAAK,SAAS,GAAG,KAAS;EACpD,IAAI,CAACjB,GAAQ;EACb,IAAMmB,IAAMF,EAAK,MAAM,GAAGC,CAAK,CAAC,CAAC,KAAK,GAAG,GACnCE,IAAU5B,EAAI,SAASQ,CAAM,CAAC,CAAC,SAC/BqB,IAASD,EAAQ,MAAK,MAAUE,EAAO,QAAQH,CAAG,GAClDI,IAAYH,EAAQ,MAAK,MAAUE,EAAO,QAAQ,GAAGH,EAAI,GAAGF,EAAKC,IAAQ;EAC/E,IAAIG,EAAO,KAAK,SAAS,SAAS;EAClC,IAAMf,IAAOe,EAAO,KAAK,SAAS,eAAe,MAAM;EACvD,AAAK7B,EAAI,OAAO+B,EAAU,MAAMjB,CAAI,MAClC,IAASkB,EAAY;GAAE;GAAK;GAAQ;GAAQ,OAAO,OAAOP,EAAKC,EAAM;EAAE,CAAC;CAE5E;CACA,OAAOlB;AACT;AAEA,SAASwB,EAAY,EACnB,QACA,WACA,WACA,YAMC;CACD,IAAIH,EAAO,KAAK,SAAS,SAAS;CAClC,IAAMI,IAAOJ,EAAO,KAAK,SAAS,eAAe,UAAU,UACrDK,IAASL,EAAO,KAAK,SAAS,KAAI,MAASP,EAA8Ba,GAAOnC,EAAI,MAAM,YAAY,CAAC,CAACiC,EAAK,GAC7GG,IAASP,EAAO,KAAKI,KAAQjC,EAAI,MAAM,aAAa,OAAOkC,EAAO,SAAS,IAC3EG,IAAUR,EAAO,KAAK,SAAS,KAAK,GAAO,MAC/CS,MAASC,IACL,IACAC,EAAwB;EACtB,SAASC,EAAYN,CAAK;EAC1B,YAAYnC,EAAI,MAAM;EACtB,QAAQA,EAAI,MAAM;CACpB,CAAC,CAAC,GAAGiC,EACX;CACA,IAAII,EAAQ,MAAK,MAASK,MAAU,KAAA,CAAS,KAAKC,EAAIT,CAAM,IAAIE,GAAQ;CACxE,IAAMQ,IAAYP,EAAQ,KAAI,MAASK,CAAM;CAE7C,OADA,EAAUH,KAAS,KAAK,IAAIL,EAAOK,IAASH,IAASO,EAAIC,CAAS,CAAC,GAC5DC,EAAqBrC,GAAQqB,EAAO,MAAMiB,EAASF,GAAWV,GAAQE,CAAM,GAAGpC,EAAI,MAAM,SAAS,KAAKQ;AAChH;AAEA,SAASC,EAAY,GAAU,GAAyB,GAAa;CACnE,IAAMsC,IAAa/C,EAAI,SAASQ,CAAM,GAChCwC,IAAQD,EAAW,QAAQ,MAAK,MAAUjB,EAAO,QAAQH,EAAI,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC;CACpG,IAAIqB,EAAM,KAAK,SAAS,SAAS;CACjC,IAAMC,IAAWF,EAAW,OAAO,MAAK,MAAS5C,EAAM,QAAQwB,CAAG,GAC5DY,IAAQ,OAAOZ,EAAI,MAAM,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GACpCuB,IAAQC,EAAc;EAAE;EAAK,OAAO;GAAE,GAAGH;GAAO,MAAMA,EAAM;EAAK;EAAG,UAAUC,EAAS;EAAM;CAAM,CAAC;CAC1G,IAAKC,GAGL,OADgBL,EAAqBrC,GAAQwC,EAAM,MAAME,GAAOlD,EAAI,MAAM,SACnE,KAAWQ;AACpB;AAEA,SAAS2C,EAAc,GAKpB;CACD,IAAM,EAAE,QAAK,UAAO,aAAU,aAAUrD,GAClC,EAAE,SAAM,cAAWE,GACnBkC,IAASc,EAAM,KAAK,SAAS,KAAI,MAAS1B,EAA8Ba,GAAOnC,EAAI,MAAM,YAAY,CAAC,CAACgB,EAAO,GAC9GoC,IAASlB,EAAO,MAAM,GAAGK,CAAK,GAC9Bc,IAAQnB,EAAO,MAAMK,IAAQ,CAAC,GAC9Be,IAAQ,KAAK,IACjBN,EAAM,KAAKlC,KAAQ6B,EAAIS,CAAM,IAAIpD,EAAI,MAAM,aAAa,MAAMuC,GAC9DvC,EAAI,MAAMc,CAAI,CAAC,CAAC,MAAMmC,EAASjC,EACjC,GACMQ,IAAM,KAAK,IACfwB,EAAM,KAAKlC,KAAQkC,EAAM,KAAKhC,KAAU2B,EAAIU,CAAK,IAAIrD,EAAI,MAAM,aAAa,MAAMqD,EAAM,SAASJ,EAASjC,IAC1GhB,EAAI,MAAMc,CAAI,CAAC,CAAC,KAClB;CACA,IAAIwC,IAAQ9B,GAAK;CACjB,IAAM+B,IAAW,KAAK,IAAID,GAAO,KAAK,IAAIL,EAASnC,IAAOU,CAAG,CAAC;CAC9D,OAAO;EACL,GAAGsB,EACDE,EAAM,KAAK,QAAQ,MAAM,GAAGT,CAAK,GACjCa,GACAG,IAAWP,EAAM,KAAKlC,KAAQd,EAAI,MAAM,aAAa,MAAMuC,CAC7D;EACAU,EAASjC;EACT,GAAG8B,EACDE,EAAM,KAAK,QAAQ,MAAMT,IAAQ,CAAC,GAClCc,GACAL,EAAM,KAAKlC,KAAQkC,EAAM,KAAKhC,KAAUuC,IAAWN,EAASjC,KAAUhB,EAAI,MAAM,aAAa,MAAMqD,EAAM,MAC3G;CACF;AACF;AAEA,IAAMV,KAAO,MAAqBa,EAAO,QAAQ,GAAO,MAAUC,IAAQf,GAAO,CAAC;AAGlF,SAAgBgB,EACd,GAMoC;CACpC,IAAM/C,IAAQb,EAAM;CACpB,IAAI6D,EAAiBhD,GAAOb,EAAM,MAAM,KAAK,CAACA,EAAM,aAAa;CACjE,IAAI,CAAC8D,EAAoBjD,GAAOb,EAAM,MAAM,KAAK,CAAC+D,EAAmBlD,GAAOb,EAAM,IAAI,GAAG,OAAOA,EAAM;CACtG,IAAMgE,IAAUjE,EAAsB;EAAE,GAAGC;EAAO,MAAMa;CAAM,CAAC,GACzDf,IAAOC,EAAsBC,CAAK;CACxC,IAAIgE,KAAWA,EAAQ,QAAQlE,GAAM,KAAK,OAAO;EAAE,GAAGE,EAAM;EAAM,QAAQa,EAAM;CAAO;CACvF,IAAI,CAACb,EAAM,aAAa,OAAOA,EAAM;CACrC,IAAM,EAAE,SAAM,aAAUA,EAAM;CAC9B,OAAOH,EAAqB;EAC1B,GAAGG;EACH,UAAUa,EAAM;EAChB,aAAa;GACX,MAAM;IAAE,GAAGE;IAAM,GAAGA,EAAK,IAAIf,EAAM,aAAa;IAAG,GAAGe,EAAK,IAAIf,EAAM,aAAa;GAAE;GACpF,OAAO;IAAE,GAAGiE,EAAM,IAAIjE,EAAM,aAAa;IAAG,GAAGiE,EAAM,IAAIjE,EAAM,aAAa;GAAE;EAChF;CACF,CAAC;AACH;AAEA,SAAS+D,EAAmB,GAA+B,GAA8B;CACvF,OAAO,CAAC,SAAS,QAAQ,CAAC,CAAC,SAASG,EAAQ,OAAO,IAAI,KAAK,CAAC,UAAU,SAAS,CAAC,CAAC,SAASC,EAAK,IAAI;AACtG;AAEA,SAASL,EACP,GACA,GAC8F;CAC9F,OACEI,GAAS,UAAU,cACnB,CAACA,EAAQ,WACTA,EAAQ,eAAe,cACvBpD,EAAcoD,EAAQ,MAAM,MAAMpD,EAAcsD,CAAM;AAE1D;AAEA,SAASP,EAAiB,GAA2C,GAA6B;CAChG,OAAOK,GAAS,UAAU,cAAcA,EAAQ,WAAWG,EAAuBH,EAAQ,QAAQI,CAAM;AAC1G"}

package/dist/workspace/utils/placement/context.utils.d.ts

@@ -0,0 +1,36 @@
+import type { Rect } from '@nvidia-elements/core/internal';
+import type { WorkspacePlacedRegion } from '../geometry/allocation.utils.js';
+import type { WorkspaceNode } from '../model/layout.utils.js';
+export interface WorkspacePlacementContext {
+    kind: 'rail' | 'recipient';
+    members: string[];
+}
+export interface WorkspaceContextProxy {
+    key: string;
+    rect: Rect;
+}
+interface ContextRectInput {
+    members: string[];
+    allocation: WorkspacePlacedRegion[];
+    source: string[];
+}
+export type WorkspaceContextRectResolver = (input: ContextRectInput) => Rect | undefined;
+/** Identifies an operating region independently of path changes or sibling order. */
+export declare function getContextKey(members: string[]): string;
+export declare function createPlacementContext(kind: WorkspacePlacementContext['kind'], node: WorkspaceNode | null, source: string[]): WorkspacePlacementContext;
+/** Includes surviving peers whose computed allocation changes under split constraints. */
+export declare function getAffectedSplitContext(input: {
+    baseline: WorkspacePlacedRegion[];
+    achieved: WorkspacePlacedRegion[];
+    source: string[];
+    recipient: string[];
+}): WorkspacePlacementContext;
+/** Seeds operating-region proxies before their selection can change during animation. */
+export declare function allocateContextProxies(input: {
+    catalog: WorkspacePlacedRegion[];
+    allocation: WorkspacePlacedRegion[];
+    source: string[];
+}): WorkspaceContextProxy[];
+export declare function getAllocatedContextRect(input: ContextRectInput): Rect | undefined;
+export declare function createContextRectResolver(): WorkspaceContextRectResolver;
+export {};

package/dist/workspace/utils/placement/context.utils.js

@@ -0,0 +1,135 @@
+import { getPanelIds as e } from "../model/layout.utils.js";
+// src/workspace/utils/placement/context.utils.ts
+function t(e) {
+	return JSON.stringify([...e].sort());
+}
+function n(t, n, r) {
+	let i = new Set(r);
+	return {
+		kind: t,
+		members: e(n).filter((e) => t === "rail" || !i.has(e))
+	};
+}
+function r(t) {
+	let n = new Map(t.achieved.flatMap((e) => e.node.type === "group" ? e.node.panels.map((t) => [t, e.rect]) : [])), r = new Set(t.recipient);
+	for (let e of t.baseline) if (e.node.type === "group") for (let a of e.node.panels) {
+		if (t.source.includes(a)) continue;
+		let o = n.get(a);
+		o && i(e.rect, o) && r.add(a);
+	}
+	let a = t.baseline.filter((t) => {
+		let n = e(t.node);
+		return [...r].every((e) => n.includes(e));
+	}).at(-1);
+	return a ? {
+		kind: a.node.type === "group" ? "recipient" : "rail",
+		members: e(a.node)
+	} : {
+		kind: "recipient",
+		members: t.recipient
+	};
+}
+function i(e, t) {
+	return [
+		"x",
+		"y",
+		"width",
+		"height"
+	].some((n) => Math.abs(e[n] - t[n]) > 1e-6);
+}
+function a(n) {
+	let r = new Set(n.source), i = /* @__PURE__ */ new Map();
+	for (let a of n.catalog) {
+		let n = e(a.node), o = n.filter((e) => !r.has(e));
+		if (o.length) for (let e of [n, o]) i.set(t(e), e);
+	}
+	let a = c(n.allocation);
+	return [...i].flatMap(([e, t]) => {
+		let n = l({
+			members: t,
+			geometry: a,
+			carried: r
+		});
+		return n ? [{
+			key: e,
+			rect: n
+		}] : [];
+	});
+}
+function o(e) {
+	return l({
+		members: e.members,
+		geometry: c(e.allocation),
+		carried: new Set(e.source)
+	});
+}
+function s() {
+	let e = /* @__PURE__ */ new WeakMap();
+	return (t) => {
+		let n = e.get(t.allocation);
+		return n || (n = c(t.allocation), e.set(t.allocation, n)), l({
+			members: t.members,
+			geometry: n,
+			carried: new Set(t.source)
+		});
+	};
+}
+function c(n) {
+	let r = n.filter((e) => e.node.type === "group"), i = new Map(n.map((e) => [e.key, e])), a = /* @__PURE__ */ new Map();
+	for (let t of r) e(t.node).forEach((e) => a.set(e, t.key));
+	let o = /* @__PURE__ */ new Map();
+	for (let e of n) {
+		let n = r.filter((t) => d(t.key, e.key)).map((e) => e.key);
+		o.set(t(n), e.rect);
+	}
+	return {
+		leaves: r,
+		byKey: i,
+		groupByMember: a,
+		exact: o
+	};
+}
+function l(n) {
+	let { members: r, geometry: i, carried: a } = n, o = new Set(r.flatMap((e) => i.groupByMember.get(e) ?? []));
+	if (!o.size) return;
+	let s = i.exact.get(t([...o]));
+	if (s) return s;
+	let c = u([...o]), l = i.byKey.get(c);
+	if (l?.node.type !== "split") return;
+	let { depth: p, first: m, last: h } = f([...o], c);
+	if (i.leaves.filter((e) => {
+		let t = Number(e.key.split(".")[p]);
+		return d(e.key, c) && t >= m && t <= h;
+	}).some((t) => !o.has(t.key) && !e(t.node).every((e) => a.has(e)))) return;
+	let g = i.byKey.get(`${c}.${m}`), _ = i.byKey.get(`${c}.${h}`);
+	if (g && _) return l.node.axis === "horizontal" ? {
+		x: g.rect.x,
+		y: l.rect.y,
+		width: _.rect.x + _.rect.width - g.rect.x,
+		height: l.rect.height
+	} : {
+		x: l.rect.x,
+		y: g.rect.y,
+		width: l.rect.width,
+		height: _.rect.y + _.rect.height - g.rect.y
+	};
+}
+function u(e) {
+	let t = e[0].split(".");
+	for (; !e.every((e) => d(e, t.join(".")));) t.pop();
+	return t.join(".");
+}
+function d(e, t) {
+	return e === t || e.startsWith(`${t}.`);
+}
+function f(e, t) {
+	let n = t.split(".").length, r = e.map((e) => Number(e.split(".")[n]));
+	return {
+		depth: n,
+		first: Math.min(...r),
+		last: Math.max(...r)
+	};
+}
+export { a as allocateContextProxies, s as createContextRectResolver, n as createPlacementContext, r as getAffectedSplitContext, o as getAllocatedContextRect, t as getContextKey };
+
+//# sourceMappingURL=context.utils.js.map

package/dist/workspace/utils/placement/context.utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"context.utils.js","names":["getContextKey","members","createPlacementContext","carried","source","getPanelIds","node","kind","id","getAffectedSplitContext","achieved","input","region","affected","after","changedRect","candidate","before","key","allocateContextProxies","memberships","full","remaining","geometry","allocationIndex","rect","resolveContextRegion","getAllocatedContextRect","createContextRectResolver","indices","leaves","regions","byKey","groupByMember","leaf","exact","keys","descendant","selected","prefix","commonRegion","parent","childRange","index","depth","first","last","parts"],"sources":["../../../../src/workspace/utils/placement/context.utils.ts"],"sourcesContent":["// SPDX-FileCopyrightText: Copyright (c) 2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.\n// SPDX-License-Identifier: Apache-2.0\n\nimport type { Rect } from '@nvidia-elements/core/internal';\n\nimport { getPanelIds } from '../model/layout.utils.js';\n\nimport type { WorkspacePlacedRegion } from '../geometry/allocation.utils.js';\nimport type { WorkspaceNode } from '../model/layout.utils.js';\n\nexport interface WorkspacePlacementContext {\n  kind: 'rail' | 'recipient';\n  members: string[];\n}\n\nexport interface WorkspaceContextProxy {\n  key: string;\n  rect: Rect;\n}\n\ninterface ContextRectInput {\n  members: string[];\n  allocation: WorkspacePlacedRegion[];\n  source: string[];\n}\n\nexport type WorkspaceContextRectResolver = (input: ContextRectInput) => Rect | undefined;\n\n/** Identifies an operating region independently of path changes or sibling order. */\nexport function getContextKey(members: string[]): string {\n  return JSON.stringify([...members].sort());\n}\n\nexport function createPlacementContext(\n  kind: WorkspacePlacementContext['kind'],\n  node: WorkspaceNode | null,\n  source: string[]\n): WorkspacePlacementContext {\n  const carried = new Set(source);\n  return { kind, members: getPanelIds(node).filter(id => kind === 'rail' || !carried.has(id)) };\n}\n\n/** Includes surviving peers whose computed allocation changes under split constraints. */\nexport function getAffectedSplitContext(input: {\n  baseline: WorkspacePlacedRegion[];\n  achieved: WorkspacePlacedRegion[];\n  source: string[];\n  recipient: string[];\n}): WorkspacePlacementContext {\n  const achieved = new Map(\n    input.achieved.flatMap(region =>\n      region.node.type === 'group' ? region.node.panels.map(id => [id, region.rect] as const) : []\n    )\n  );\n  const affected = new Set(input.recipient);\n  for (const region of input.baseline) {\n    if (region.node.type !== 'group') continue;\n    for (const id of region.node.panels) {\n      if (input.source.includes(id)) continue;\n      const after = achieved.get(id);\n      if (after && changedRect(region.rect, after)) {\n        affected.add(id);\n      }\n    }\n  }\n  const region = input.baseline\n    .filter(candidate => {\n      const members = getPanelIds(candidate.node);\n      return [...affected].every(id => members.includes(id));\n    })\n    .at(-1);\n  return region\n    ? { kind: region.node.type === 'group' ? 'recipient' : 'rail', members: getPanelIds(region.node) }\n    : { kind: 'recipient', members: input.recipient };\n}\n\nfunction changedRect(before: Rect, after: Rect) {\n  return (['x', 'y', 'width', 'height'] as const).some(key => Math.abs(before[key] - after[key]) > 0.000001);\n}\n\n/** Seeds operating-region proxies before their selection can change during animation. */\nexport function allocateContextProxies(input: {\n  catalog: WorkspacePlacedRegion[];\n  allocation: WorkspacePlacedRegion[];\n  source: string[];\n}): WorkspaceContextProxy[] {\n  const carried = new Set(input.source);\n  const memberships = new Map<string, string[]>();\n  for (const region of input.catalog) {\n    const full = getPanelIds(region.node);\n    const remaining = full.filter(id => !carried.has(id));\n    if (!remaining.length) continue;\n    for (const members of [full, remaining]) {\n      memberships.set(getContextKey(members), members);\n    }\n  }\n  const geometry = allocationIndex(input.allocation);\n  return [...memberships].flatMap(([key, members]) => {\n    const rect = resolveContextRegion({ members, geometry, carried });\n    return rect ? [{ key, rect }] : [];\n  });\n}\n\nexport function getAllocatedContextRect(input: ContextRectInput): Rect | undefined {\n  return resolveContextRegion({\n    members: input.members,\n    geometry: allocationIndex(input.allocation),\n    carried: new Set(input.source)\n  });\n}\n\nexport function createContextRectResolver(): WorkspaceContextRectResolver {\n  const indices = new WeakMap<WorkspacePlacedRegion[], ReturnType<typeof allocationIndex>>();\n  return input => {\n    let geometry = indices.get(input.allocation);\n    if (!geometry) {\n      geometry = allocationIndex(input.allocation);\n      indices.set(input.allocation, geometry);\n    }\n    return resolveContextRegion({ members: input.members, geometry, carried: new Set(input.source) });\n  };\n}\n\nfunction allocationIndex(regions: WorkspacePlacedRegion[]) {\n  const leaves = regions.filter(region => region.node.type === 'group');\n  const byKey = new Map(regions.map(region => [region.key, region]));\n  const groupByMember = new Map<string, string>();\n  for (const leaf of leaves) {\n    getPanelIds(leaf.node).forEach(id => groupByMember.set(id, leaf.key));\n  }\n  const exact = new Map<string, Rect>();\n  for (const region of regions) {\n    const keys = leaves.filter(leaf => descendant(leaf.key, region.key)).map(leaf => leaf.key);\n    exact.set(getContextKey(keys), region.rect);\n  }\n  return { leaves, byKey, groupByMember, exact };\n}\n\nfunction resolveContextRegion(input: {\n  members: string[];\n  geometry: ReturnType<typeof allocationIndex>;\n  carried: Set<string>;\n}): Rect | undefined {\n  const { members, geometry, carried } = input;\n  const selected = new Set(members.flatMap(id => geometry.groupByMember.get(id) ?? []));\n  if (!selected.size) return undefined;\n  const exact = geometry.exact.get(getContextKey([...selected]));\n  if (exact) return exact;\n  const prefix = commonRegion([...selected]);\n  const parent = geometry.byKey.get(prefix);\n  if (parent?.node.type !== 'split') return undefined;\n  const { depth, first, last } = childRange([...selected], prefix);\n  const covered = geometry.leaves.filter(leaf => {\n    const index = Number(leaf.key.split('.')[depth]);\n    return descendant(leaf.key, prefix) && index >= first && index <= last;\n  });\n  if (covered.some(leaf => !selected.has(leaf.key) && !getPanelIds(leaf.node).every(id => carried.has(id))))\n    return undefined;\n  const before = geometry.byKey.get(`${prefix}.${first}`);\n  const after = geometry.byKey.get(`${prefix}.${last}`);\n  if (!before || !after) return undefined;\n  return parent.node.axis === 'horizontal'\n    ? {\n        x: before.rect.x,\n        y: parent.rect.y,\n        width: after.rect.x + after.rect.width - before.rect.x,\n        height: parent.rect.height\n      }\n    : {\n        x: parent.rect.x,\n        y: before.rect.y,\n        width: parent.rect.width,\n        height: after.rect.y + after.rect.height - before.rect.y\n      };\n}\n\nfunction commonRegion(keys: string[]): string {\n  const parts = keys[0]!.split('.');\n  while (!keys.every(key => descendant(key, parts.join('.')))) {\n    parts.pop();\n  }\n  return parts.join('.');\n}\n\nfunction descendant(key: string, parent: string): boolean {\n  return key === parent || key.startsWith(`${parent}.`);\n}\n\nfunction childRange(keys: string[], parent: string) {\n  const depth = parent.split('.').length;\n  const indices = keys.map(key => Number(key.split('.')[depth]));\n  return { depth, first: Math.min(...indices), last: Math.max(...indices) };\n}\n"],"mappings":";;AA6BA,SAAgBA,EAAc,GAA2B;CACvD,OAAO,KAAK,UAAU,CAAC,GAAGC,CAAO,CAAC,CAAC,KAAK,CAAC;AAC3C;AAEA,SAAgBC,EACd,GACA,GACA,GAC2B;CAC3B,IAAMC,IAAU,IAAI,IAAIC,CAAM;CAC9B,OAAO;EAAE;EAAM,SAASC,EAAYC,CAAI,CAAC,CAAC,QAAO,MAAMC,MAAS,UAAU,CAACJ,EAAQ,IAAIK,CAAE,CAAC;CAAE;AAC9F;AAGA,SAAgBC,EAAwB,GAKV;CAC5B,IAAMC,IAAW,IAAI,IACnBC,EAAM,SAAS,SAAQ,MACrBC,EAAO,KAAK,SAAS,UAAUA,EAAO,KAAK,OAAO,KAAI,MAAM,CAACJ,GAAII,EAAO,IAAI,CAAU,IAAI,CAAC,CAC7F,CACF,GACMC,IAAW,IAAI,IAAIF,EAAM,SAAS;CACxC,KAAK,IAAMC,KAAUD,EAAM,UACzB,IAAIC,EAAO,KAAK,SAAS,SACzB,KAAK,IAAMJ,KAAMI,EAAO,KAAK,QAAQ;EACnC,IAAID,EAAM,OAAO,SAASH,CAAE,GAAG;EAC/B,IAAMM,IAAQJ,EAAS,IAAIF,CAAE;EAC7B,AAAIM,KAASC,EAAYH,EAAO,MAAME,CAAK,KACzCD,EAAS,IAAIL,CAAE;CAEnB;CAEF,IAAMI,IAASD,EAAM,SAClB,QAAO,MAAa;EACnB,IAAMV,IAAUI,EAAYW,EAAU,IAAI;EAC1C,OAAO,CAAC,GAAGH,CAAQ,CAAC,CAAC,OAAM,MAAMZ,EAAQ,SAASO,CAAE,CAAC;CACvD,CAAC,CAAC,CACD,GAAG,EAAE;CACR,OAAOI,IACH;EAAE,MAAMA,EAAO,KAAK,SAAS,UAAU,cAAc;EAAQ,SAASP,EAAYO,EAAO,IAAI;CAAE,IAC/F;EAAE,MAAM;EAAa,SAASD,EAAM;CAAU;AACpD;AAEA,SAASI,EAAY,GAAc,GAAa;CAC9C,OAAQ;EAAC;EAAK;EAAK;EAAS;CAAQ,CAAC,CAAW,MAAK,MAAO,KAAK,IAAIE,EAAOC,KAAOJ,EAAMI,EAAI,IAAI,IAAQ;AAC3G;AAGA,SAAgBC,EAAuB,GAIX;CAC1B,IAAMhB,IAAU,IAAI,IAAIQ,EAAM,MAAM,GAC9BS,oBAAc,IAAI,IAAsB;CAC9C,KAAK,IAAMR,KAAUD,EAAM,SAAS;EAClC,IAAMU,IAAOhB,EAAYO,EAAO,IAAI,GAC9BU,IAAYD,EAAK,QAAO,MAAM,CAAClB,EAAQ,IAAIK,CAAE,CAAC;EACpD,IAAKc,EAAU,QACf,KAAK,IAAMrB,KAAW,CAACoB,GAAMC,CAAS,GACpC,EAAY,IAAItB,EAAcC,CAAO,GAAGA,CAAO;CAEnD;CACA,IAAMsB,IAAWC,EAAgBb,EAAM,UAAU;CACjD,OAAO,CAAC,GAAGS,CAAW,CAAC,CAAC,SAAS,CAACF,GAAKjB,OAAa;EAClD,IAAMwB,IAAOC,EAAqB;GAAE;GAAS;GAAU;EAAQ,CAAC;EAChE,OAAOD,IAAO,CAAC;GAAE;GAAK;EAAK,CAAC,IAAI,CAAC;CACnC,CAAC;AACH;AAEA,SAAgBE,EAAwB,GAA2C;CACjF,OAAOD,EAAqB;EAC1B,SAASf,EAAM;EACf,UAAUa,EAAgBb,EAAM,UAAU;EAC1C,SAAS,IAAI,IAAIA,EAAM,MAAM;CAC/B,CAAC;AACH;AAEA,SAAgBiB,IAA0D;CACxE,IAAMC,oBAAU,IAAI,QAAqE;CACzF,QAAO,MAAS;EACd,IAAIN,IAAWM,EAAQ,IAAIlB,EAAM,UAAU;EAK3C,OAJKY,MACH,IAAWC,EAAgBb,EAAM,UAAU,GAC3CkB,EAAQ,IAAIlB,EAAM,YAAYY,CAAQ,IAEjCG,EAAqB;GAAE,SAASf,EAAM;GAAS;GAAU,SAAS,IAAI,IAAIA,EAAM,MAAM;EAAE,CAAC;CAClG;AACF;AAEA,SAASa,EAAgB,GAAkC;CACzD,IAAMM,IAASC,EAAQ,QAAO,MAAUnB,EAAO,KAAK,SAAS,OAAO,GAC9DoB,IAAQ,IAAI,IAAID,EAAQ,KAAI,MAAU,CAACnB,EAAO,KAAKA,CAAM,CAAC,CAAC,GAC3DqB,oBAAgB,IAAI,IAAoB;CAC9C,KAAK,IAAMC,KAAQJ,GACjB,EAAYI,EAAK,IAAI,CAAC,CAAC,SAAQ,MAAMD,EAAc,IAAIzB,GAAI0B,EAAK,GAAG,CAAC;CAEtE,IAAMC,oBAAQ,IAAI,IAAkB;CACpC,KAAK,IAAMvB,KAAUmB,GAAS;EAC5B,IAAMK,IAAON,EAAO,QAAO,MAAQO,EAAWH,EAAK,KAAKtB,EAAO,GAAG,CAAC,CAAC,CAAC,KAAI,MAAQsB,EAAK,GAAG;EACzF,EAAM,IAAIlC,EAAcoC,CAAI,GAAGxB,EAAO,IAAI;CAC5C;CACA,OAAO;EAAE;EAAQ;EAAO;EAAe;CAAM;AAC/C;AAEA,SAASc,EAAqB,GAIT;CACnB,IAAM,EAAE,YAAS,aAAU,eAAYf,GACjC2B,IAAW,IAAI,IAAIrC,EAAQ,SAAQ,MAAMsB,EAAS,cAAc,IAAIf,CAAE,KAAK,CAAC,CAAC,CAAC;CACpF,IAAI,CAAC8B,EAAS,MAAM;CACpB,IAAMH,IAAQZ,EAAS,MAAM,IAAIvB,EAAc,CAAC,GAAGsC,CAAQ,CAAC,CAAC;CAC7D,IAAIH,GAAO,OAAOA;CAClB,IAAMI,IAASC,EAAa,CAAC,GAAGF,CAAQ,CAAC,GACnCG,IAASlB,EAAS,MAAM,IAAIgB,CAAM;CACxC,IAAIE,GAAQ,KAAK,SAAS,SAAS;CACnC,IAAM,EAAE,UAAO,UAAO,YAASC,EAAW,CAAC,GAAGJ,CAAQ,GAAGC,CAAM;CAK/D,IAJgBhB,EAAS,OAAO,QAAO,MAAQ;EAC7C,IAAMoB,IAAQ,OAAOT,EAAK,IAAI,MAAM,GAAG,CAAC,CAACU,EAAM;EAC/C,OAAOP,EAAWH,EAAK,KAAKK,CAAM,KAAKI,KAASE,KAASF,KAASG;CACpE,CACI,CAAA,CAAQ,MAAK,MAAQ,CAACR,EAAS,IAAIJ,EAAK,GAAG,KAAK,CAAC7B,EAAY6B,EAAK,IAAI,CAAC,CAAC,OAAM,MAAM/B,EAAQ,IAAIK,CAAE,CAAC,CAAC,GACtG;CACF,IAAMS,IAASM,EAAS,MAAM,IAAI,GAAGgB,EAAO,GAAGM,GAAO,GAChD/B,IAAQS,EAAS,MAAM,IAAI,GAAGgB,EAAO,GAAGO,GAAM;CACpD,IAAK7B,KAAWH,GAChB,OAAO2B,EAAO,KAAK,SAAS,eACxB;EACE,GAAGxB,EAAO,KAAK;EACf,GAAGwB,EAAO,KAAK;EACf,OAAO3B,EAAM,KAAK,IAAIA,EAAM,KAAK,QAAQG,EAAO,KAAK;EACrD,QAAQwB,EAAO,KAAK;CACtB,IACA;EACE,GAAGA,EAAO,KAAK;EACf,GAAGxB,EAAO,KAAK;EACf,OAAOwB,EAAO,KAAK;EACnB,QAAQ3B,EAAM,KAAK,IAAIA,EAAM,KAAK,SAASG,EAAO,KAAK;CACzD;AACN;AAEA,SAASuB,EAAa,GAAwB;CAC5C,IAAMO,IAAQX,EAAK,EAAE,CAAE,MAAM,GAAG;CAChC,OAAO,CAACA,EAAK,OAAM,MAAOC,EAAWnB,GAAK6B,EAAM,KAAK,GAAG,CAAC,CAAC,IACxD,EAAM,IAAI;CAEZ,OAAOA,EAAM,KAAK,GAAG;AACvB;AAEA,SAASV,EAAW,GAAa,GAAyB;CACxD,OAAOnB,MAAQuB,KAAUvB,EAAI,WAAW,GAAGuB,EAAO,EAAE;AACtD;AAEA,SAASC,EAAW,GAAgB,GAAgB;CAClD,IAAME,IAAQH,EAAO,MAAM,GAAG,CAAC,CAAC,QAC1BZ,IAAUO,EAAK,KAAI,MAAO,OAAOlB,EAAI,MAAM,GAAG,CAAC,CAAC0B,EAAM,CAAC;CAC7D,OAAO;EAAE;EAAO,OAAO,KAAK,IAAI,GAAGf,CAAO;EAAG,MAAM,KAAK,IAAI,GAAGA,CAAO;CAAE;AAC1E"}

package/dist/workspace/utils/placement/group-insertion.utils.d.ts

@@ -0,0 +1,26 @@
+import type { WorkspaceLayout } from '../model/layout.utils.js';
+import type { WorkspaceDestination } from '../model/operations.utils.js';
+import type { WorkspaceLayoutProjector } from '../model/projection.utils.js';
+import type { WorkspacePlacementPlan } from './planner.utils.js';
+interface InsertionInput {
+    layout: WorkspaceLayout;
+    source: string[];
+    destination: WorkspaceDestination;
+    available: string[];
+    projectLayout?: WorkspaceLayoutProjector;
+}
+export declare function planGroupInsertion(input: InsertionInput): WorkspacePlacementPlan | undefined;
+export declare function describePlacementSlot(input: {
+    plan: Pick<WorkspacePlacementPlan, 'layout'>;
+    source: string[];
+    available: string[];
+    projectLayout?: WorkspaceLayoutProjector;
+}): {
+    axis: "horizontal" | "vertical";
+    index: number;
+    members: string[];
+    previous: string[] | undefined;
+    next: string[] | undefined;
+    key: string;
+} | undefined;
+export {};

package/dist/workspace/utils/placement/group-insertion.utils.js

@@ -0,0 +1,171 @@
+import { getPanelIds as e, getSplitSide as t } from "../model/layout.utils.js";
+import { createDetachedLayout as n, projectLayout as r } from "../model/operations.utils.js";
+import { findDeepestProjectionCarrier as i, getProjectionSignature as a, rebaseProjectedSplit as o } from "../model/projection.utils.js";
+import { findWorkspaceRegion as s, placeRegion as c } from "./region.utils.js";
+// src/workspace/utils/placement/group-insertion.utils.ts
+function l(e) {
+	let t = m(e);
+	if (!t) return;
+	let n = u(e, t);
+	return n ? d({
+		input: e,
+		context: t,
+		topology: n
+	}) : void 0;
+}
+function u(o, s) {
+	let { peers: l, slot: u, visible: d, root: f, axis: p } = s, m = l[Math.min(u, l.length - 1)], h = o.projectLayout ?? r, g = i(f, a(m.node), (e) => {
+		let t = n({
+			version: 1,
+			root: e,
+			closed: []
+		}, o.source);
+		return h(t, d).root;
+	}), _ = g && y(f, g);
+	if (!_ || !g) return;
+	let v = u < l.length, b = {
+		target: e(g)[0],
+		region: _,
+		position: t(p, v ? "before" : "after")
+	};
+	return c({
+		...o,
+		destination: b
+	});
+}
+function d({ input: t, context: n, topology: i }) {
+	let { owner: a, peers: o, visible: s, axis: c } = n, l = (t.projectLayout ?? r)(i.layout, s).root, u = t.source.filter((e) => s.includes(e)), d = _(l, u);
+	if (!d || d.axis !== c || d.children.length !== o.length + 1) return;
+	let f = g({
+		branch: d,
+		peers: o,
+		moving: u
+	});
+	if (!f) return;
+	let p = b({
+		layout: i.layout,
+		branch: d,
+		weights: f,
+		available: t.available
+	});
+	if (p) return {
+		kind: "insert",
+		layout: p,
+		context: {
+			kind: "rail",
+			members: [.../* @__PURE__ */ new Set([...e(a), ...u])]
+		}
+	};
+}
+function f(e) {
+	let { destination: t, layout: n } = e;
+	if (!t.region || t.position === "tab") return;
+	let i = e.available.filter((e) => !n.closed.includes(e)), a = (e.projectLayout ?? r)(n, i).root, o = s(a, t.region);
+	if (!a || !o) return;
+	let c = t.position === "left" || t.position === "right" ? "horizontal" : "vertical", l = p({
+		root: a,
+		target: o,
+		key: t.region,
+		axis: c
+	});
+	if (l) return {
+		visible: i,
+		root: a,
+		target: o,
+		axis: c,
+		owner: l
+	};
+}
+function p(e) {
+	if (e.target.type === "split" && e.target.axis === e.axis) return e.target;
+	let t = s(e.root, e.key.split(".").slice(0, -1).join("."));
+	return t?.type === "split" && t.axis === e.axis ? t : e.target.type === "split" ? e.target : void 0;
+}
+function m(t) {
+	let r = f(t);
+	if (!r) return;
+	let { owner: i, target: a, axis: o } = r, s = n({
+		version: 1,
+		root: i,
+		closed: []
+	}, t.source).root;
+	if (!s) return;
+	let c = h(s, o), l = new Set(e(a).filter((e) => !t.source.includes(e))), u = c.flatMap((t, n) => e(t.node).every((e) => l.has(e)) ? [n] : []);
+	if (!u.length) return;
+	let d = t.destination.position === "left" || t.destination.position === "top";
+	return {
+		...r,
+		peers: c,
+		slot: d ? u[0] : u.at(-1) + 1
+	};
+}
+function h(e, t) {
+	return e.type !== "split" || e.axis !== t ? [{
+		node: e,
+		weight: 1
+	}] : e.children.map((t, n) => ({
+		node: t,
+		weight: e.weights[n]
+	}));
+}
+function g(e) {
+	let t = e.peers.reduce((e, t) => e + t.weight, 0) / e.peers.length, n = e.branch.children.map((n) => {
+		if (v(n, e.moving)) return t;
+		let r = e.peers.findIndex((e) => a(e.node) === a(n));
+		if (!(r < 0)) return e.peers[r].weight;
+	});
+	return n.every((e) => e !== void 0) ? n : void 0;
+}
+function _(e, t) {
+	if (e?.type === "split") {
+		if (e.children.some((e) => e.type === "group" && e.panels.length > 0 && v(e, t))) return e;
+		for (let n of e.children) {
+			let e = _(n, t);
+			if (e) return e;
+		}
+	}
+}
+function v(e, t) {
+	return e.type === "group" && e.panels.every((e) => t.includes(e));
+}
+function y(e, t, n = "root") {
+	if (e === t) return n;
+	if (e.type === "split") for (let [r, i] of e.children.entries()) {
+		let e = y(i, t, `${n}.${r}`);
+		if (e) return e;
+	}
+}
+function b(e) {
+	let t = o(e.layout, e.branch, e.weights, e.available);
+	if (t) return t;
+	let n = e.weights.reduce((e, t) => e + t, 0);
+	return e.branch.weights.every((t, r) => Math.abs(t - e.weights[r] / n) < 1e-10) ? e.layout : void 0;
+}
+function x(t) {
+	let n = t.available.filter((e) => !t.plan.layout.closed.includes(e)), i = t.source.filter((e) => n.includes(e)), a = _((t.projectLayout ?? r)(t.plan.layout, n).root, i);
+	if (!a) return;
+	let o = a.children.findIndex((e) => v(e, i));
+	if (!(o < 0)) return {
+		axis: a.axis,
+		index: o,
+		members: e(a).filter((e) => !i.includes(e)),
+		previous: a.children[o - 1] ? e(a.children[o - 1]) : void 0,
+		next: a.children[o + 1] ? e(a.children[o + 1]) : void 0,
+		key: JSON.stringify([
+			a.axis,
+			o,
+			S(t.plan.layout.root),
+			t.plan.layout.closed
+		])
+	};
+}
+function S(e) {
+	return e ? e.type === "group" ? [
+		"group",
+		e.panels,
+		e.active
+	] : [e.axis, e.children.map(S)] : null;
+}
+export { x as describePlacementSlot, l as planGroupInsertion };
+
+//# sourceMappingURL=group-insertion.utils.js.map

package/dist/workspace/utils/placement/group-insertion.utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"group-insertion.utils.js","names":["planGroupInsertion","context","insertionContext","input","topology","insertionTopology","sizeInsertion","donor","peers","slot","projectLayoutForCandidate","projectLayout","carrier","findDeepestProjectionCarrier","root","getProjectionSignature","residualLayout","createDetachedLayout","node","visible","key","nodeKey","before","destination","getPanelIds","getSplitSide","axis","placeRegion","projectedRoot","moving","id","branch","movingOwner","weights","insertedWeights","layout","insertionWeights","owner","insertionBasis","target","findWorkspaceRegion","insertionOwner","parent","basis","residual","insertionPeers","selected","matches","peer","index","incoming","sum","isMovingGroup","child","weight","found","rebased","rebaseProjectedSplit","total","describePlacementSlot","placementShape"],"sources":["../../../../src/workspace/utils/placement/group-insertion.utils.ts"],"sourcesContent":["// SPDX-FileCopyrightText: Copyright (c) 2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.\n// SPDX-License-Identifier: Apache-2.0\n\nimport { getPanelIds, getSplitSide } from '../model/layout.utils.js';\nimport { createDetachedLayout, projectLayout } from '../model/operations.utils.js';\nimport {\n  findDeepestProjectionCarrier,\n  getProjectionSignature,\n  rebaseProjectedSplit\n} from '../model/projection.utils.js';\nimport { findWorkspaceRegion, placeRegion } from './region.utils.js';\n\nimport type { WorkspaceLayout, WorkspaceNode, WorkspaceSplit } from '../model/layout.utils.js';\nimport type { WorkspaceDestination } from '../model/operations.utils.js';\nimport type { WorkspaceLayoutProjector } from '../model/projection.utils.js';\nimport type { WorkspacePlacementPlan } from './planner.utils.js';\n\ninterface InsertionInput {\n  layout: WorkspaceLayout;\n  source: string[];\n  destination: WorkspaceDestination;\n  available: string[];\n  projectLayout?: WorkspaceLayoutProjector;\n}\n\nexport function planGroupInsertion(input: InsertionInput): WorkspacePlacementPlan | undefined {\n  const context = insertionContext(input);\n  if (!context) return undefined;\n  const topology = insertionTopology(input, context);\n  return topology ? sizeInsertion({ input, context, topology }) : undefined;\n}\n\nfunction insertionTopology(input: InsertionInput, context: NonNullable<ReturnType<typeof insertionContext>>) {\n  const { peers, slot, visible, root, axis } = context;\n  const donorIndex = Math.min(slot, peers.length - 1);\n  const donor = peers[donorIndex]!;\n  const projectLayoutForCandidate = input.projectLayout ?? projectLayout;\n  const carrier = findDeepestProjectionCarrier(root, getProjectionSignature(donor.node), node => {\n    const residualLayout = createDetachedLayout({ version: 1, root: node, closed: [] }, input.source);\n    return projectLayoutForCandidate(residualLayout, visible).root;\n  });\n  const key = carrier && nodeKey(root, carrier);\n  if (!key || !carrier) return undefined;\n  const before = slot < peers.length;\n  const destination: WorkspaceDestination = {\n    target: getPanelIds(carrier)[0]!,\n    region: key,\n    position: getSplitSide(axis, before ? 'before' : 'after')\n  };\n  const topology = placeRegion({ ...input, destination });\n  return topology;\n}\n\nfunction sizeInsertion({\n  input,\n  context,\n  topology\n}: {\n  input: InsertionInput;\n  context: NonNullable<ReturnType<typeof insertionContext>>;\n  topology: WorkspacePlacementPlan;\n}): WorkspacePlacementPlan | undefined {\n  const { owner, peers, visible, axis } = context;\n  const projectedRoot = (input.projectLayout ?? projectLayout)(topology.layout, visible).root;\n  const moving = input.source.filter(id => visible.includes(id));\n  const branch = movingOwner(projectedRoot, moving);\n  if (!branch || branch.axis !== axis || branch.children.length !== peers.length + 1) return undefined;\n  const weights = insertedWeights({\n    branch,\n    peers,\n    moving\n  });\n  if (!weights) return undefined;\n  const layout = insertionWeights({ layout: topology.layout, branch, weights, available: input.available });\n  if (!layout) return undefined;\n  return {\n    kind: 'insert',\n    layout,\n    context: { kind: 'rail', members: [...new Set([...getPanelIds(owner), ...moving])] }\n  };\n}\n\nfunction insertionBasis(input: InsertionInput) {\n  const { destination, layout } = input;\n  if (!destination.region || destination.position === 'tab') return undefined;\n  const visible = input.available.filter(id => !layout.closed.includes(id));\n  const root = (input.projectLayout ?? projectLayout)(layout, visible).root;\n  const target = findWorkspaceRegion(root, destination.region);\n  if (!root || !target) return undefined;\n  const axis: WorkspaceSplit['axis'] =\n    destination.position === 'left' || destination.position === 'right' ? 'horizontal' : 'vertical';\n  const owner = insertionOwner({ root, target, key: destination.region, axis });\n  if (!owner) return undefined;\n  return {\n    visible,\n    root,\n    target,\n    axis,\n    owner\n  };\n}\n\nfunction insertionOwner(input: {\n  root: WorkspaceNode;\n  target: WorkspaceNode;\n  key: string;\n  axis: WorkspaceSplit['axis'];\n}) {\n  if (input.target.type === 'split' && input.target.axis === input.axis) return input.target;\n  const parent = findWorkspaceRegion(input.root, input.key.split('.').slice(0, -1).join('.'));\n  if (parent?.type === 'split' && parent.axis === input.axis) return parent;\n  return input.target.type === 'split' ? input.target : undefined;\n}\n\nfunction insertionContext(input: InsertionInput) {\n  const basis = insertionBasis(input);\n  if (!basis) return undefined;\n  const { owner, target, axis } = basis;\n  const residual = createDetachedLayout({ version: 1, root: owner, closed: [] }, input.source).root;\n  if (!residual) return undefined;\n  const peers = insertionPeers(residual, axis);\n  const selected = new Set(getPanelIds(target).filter(id => !input.source.includes(id)));\n  const matches = peers.flatMap((peer, index) => (getPanelIds(peer.node).every(id => selected.has(id)) ? [index] : []));\n  if (!matches.length) return undefined;\n  const before = input.destination.position === 'left' || input.destination.position === 'top';\n  return { ...basis, peers, slot: before ? matches[0]! : matches.at(-1)! + 1 };\n}\n\nfunction insertionPeers(residual: WorkspaceNode, axis: WorkspaceSplit['axis']) {\n  if (residual.type !== 'split' || residual.axis !== axis) return [{ node: residual, weight: 1 }];\n  return residual.children.map((node, index) => ({ node, weight: residual.weights[index]! }));\n}\n\nfunction insertedWeights(input: {\n  branch: WorkspaceSplit;\n  peers: { node: WorkspaceNode; weight: number }[];\n  moving: string[];\n}) {\n  const incoming = input.peers.reduce((sum, peer) => sum + peer.weight, 0) / input.peers.length;\n  const weights = input.branch.children.map(child => {\n    if (isMovingGroup(child, input.moving)) return incoming;\n    const index = input.peers.findIndex(peer => getProjectionSignature(peer.node) === getProjectionSignature(child));\n    if (index < 0) return undefined;\n    const weight = input.peers[index]!.weight;\n    return weight;\n  });\n  return weights.every((weight): weight is number => weight !== undefined) ? weights : undefined;\n}\n\nfunction movingOwner(node: WorkspaceNode | null, moving: string[]): WorkspaceSplit | undefined {\n  if (node?.type !== 'split') return undefined;\n  if (node.children.some(child => child.type === 'group' && child.panels.length > 0 && isMovingGroup(child, moving)))\n    return node;\n  for (const child of node.children) {\n    const found = movingOwner(child, moving);\n    if (found) return found;\n  }\n  return undefined;\n}\n\nfunction isMovingGroup(node: WorkspaceNode, moving: string[]) {\n  return node.type === 'group' && node.panels.every(id => moving.includes(id));\n}\n\nfunction nodeKey(node: WorkspaceNode, target: WorkspaceNode, key = 'root'): string | undefined {\n  if (node === target) return key;\n  if (node.type !== 'split') return undefined;\n  for (const [index, child] of node.children.entries()) {\n    const found = nodeKey(child, target, `${key}.${index}`);\n    if (found) return found;\n  }\n  return undefined;\n}\n\nfunction insertionWeights(input: {\n  layout: WorkspaceLayout;\n  branch: WorkspaceSplit;\n  weights: number[];\n  available: string[];\n}) {\n  const rebased = rebaseProjectedSplit(input.layout, input.branch, input.weights, input.available);\n  if (rebased) return rebased;\n  const total = input.weights.reduce((sum, weight) => sum + weight, 0);\n  return input.branch.weights.every((weight, index) => Math.abs(weight - input.weights[index]! / total) < 1e-10)\n    ? input.layout\n    : undefined;\n}\n\nexport function describePlacementSlot(input: {\n  plan: Pick<WorkspacePlacementPlan, 'layout'>;\n  source: string[];\n  available: string[];\n  projectLayout?: WorkspaceLayoutProjector;\n}) {\n  const visible = input.available.filter(id => !input.plan.layout.closed.includes(id));\n  const moving = input.source.filter(id => visible.includes(id));\n  const owner = movingOwner((input.projectLayout ?? projectLayout)(input.plan.layout, visible).root, moving);\n  if (!owner) return undefined;\n  const index = owner.children.findIndex(child => isMovingGroup(child, moving));\n  if (index < 0) return undefined;\n  return {\n    axis: owner.axis,\n    index,\n    members: getPanelIds(owner).filter(id => !moving.includes(id)),\n    previous: owner.children[index - 1] ? getPanelIds(owner.children[index - 1]!) : undefined,\n    next: owner.children[index + 1] ? getPanelIds(owner.children[index + 1]!) : undefined,\n    key: JSON.stringify([owner.axis, index, placementShape(input.plan.layout.root), input.plan.layout.closed])\n  };\n}\n\nfunction placementShape(node: WorkspaceNode | null): unknown {\n  if (!node) return null;\n  return node.type === 'group' ? ['group', node.panels, node.active] : [node.axis, node.children.map(placementShape)];\n}\n"],"mappings":";;;;;AAyBA,SAAgBA,EAAmB,GAA2D;CAC5F,IAAMC,IAAUC,EAAiBC,CAAK;CACtC,IAAI,CAACF,GAAS;CACd,IAAMG,IAAWC,EAAkBF,GAAOF,CAAO;CACjD,OAAOG,IAAWE,EAAc;EAAE;EAAO;EAAS;CAAS,CAAC,IAAI,KAAA;AAClE;AAEA,SAASD,EAAkB,GAAuB,GAA2D;CAC3G,IAAM,EAAE,UAAO,SAAM,YAAS,SAAM,YAASJ,GAEvCM,IAAQC,EADK,KAAK,IAAIC,GAAMD,EAAM,SAAS,CAC7B,IACdE,IAA4BP,EAAM,iBAAiBQ,GACnDC,IAAUC,EAA6BC,GAAMC,EAAuBR,EAAM,IAAI,IAAG,MAAQ;EAC7F,IAAMS,IAAiBC,EAAqB;GAAE,SAAS;GAAG,MAAMC;GAAM,QAAQ,CAAC;EAAE,GAAGf,EAAM,MAAM;EAChG,OAAOO,EAA0BM,GAAgBG,CAAO,CAAC,CAAC;CAC5D,CAAC,GACKC,IAAMR,KAAWS,EAAQP,GAAMF,CAAO;CAC5C,IAAI,CAACQ,KAAO,CAACR,GAAS;CACtB,IAAMU,IAASb,IAAOD,EAAM,QACtBe,IAAoC;EACxC,QAAQC,EAAYZ,CAAO,CAAC,CAAC;EAC7B,QAAQQ;EACR,UAAUK,EAAaC,GAAMJ,IAAS,WAAW,OAAO;CAC1D;CAEA,OADiBK,EAAY;EAAE,GAAGxB;EAAO;CAAY,CAC9C;AACT;AAEA,SAASG,EAAc,EACrB,UACA,YACA,eAKqC;CACrC,IAAM,EAAE,UAAO,UAAO,YAAS,YAASL,GAClC2B,KAAiBzB,EAAM,iBAAiBQ,EAAA,CAAeP,EAAS,QAAQe,CAAO,CAAC,CAAC,MACjFU,IAAS1B,EAAM,OAAO,QAAO,MAAMgB,EAAQ,SAASW,CAAE,CAAC,GACvDC,IAASC,EAAYJ,GAAeC,CAAM;CAChD,IAAI,CAACE,KAAUA,EAAO,SAASL,KAAQK,EAAO,SAAS,WAAWvB,EAAM,SAAS,GAAG;CACpF,IAAMyB,IAAUC,EAAgB;EAC9B;EACA;EACA;CACF,CAAC;CACD,IAAI,CAACD,GAAS;CACd,IAAME,IAASC,EAAiB;EAAE,QAAQhC,EAAS;EAAQ;EAAQ;EAAS,WAAWD,EAAM;CAAU,CAAC;CACxG,IAAKgC,GACL,OAAO;EACL,MAAM;EACN;EACA,SAAS;GAAE,MAAM;GAAQ,SAAS,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAGX,EAAYa,CAAK,GAAG,GAAGR,CAAM,CAAC,CAAC;EAAE;CACrF;AACF;AAEA,SAASS,EAAe,GAAuB;CAC7C,IAAM,EAAE,gBAAa,cAAWnC;CAChC,IAAI,CAACoB,EAAY,UAAUA,EAAY,aAAa,OAAO;CAC3D,IAAMJ,IAAUhB,EAAM,UAAU,QAAO,MAAM,CAACgC,EAAO,OAAO,SAASL,CAAE,CAAC,GAClEhB,KAAQX,EAAM,iBAAiBQ,EAAA,CAAewB,GAAQhB,CAAO,CAAC,CAAC,MAC/DoB,IAASC,EAAoB1B,GAAMS,EAAY,MAAM;CAC3D,IAAI,CAACT,KAAQ,CAACyB,GAAQ;CACtB,IAAMb,IACJH,EAAY,aAAa,UAAUA,EAAY,aAAa,UAAU,eAAe,YACjFc,IAAQI,EAAe;EAAE;EAAM;EAAQ,KAAKlB,EAAY;EAAQ;CAAK,CAAC;CAC5E,IAAKc,GACL,OAAO;EACL;EACA;EACA;EACA;EACA;CACF;AACF;AAEA,SAASI,EAAe,GAKrB;CACD,IAAItC,EAAM,OAAO,SAAS,WAAWA,EAAM,OAAO,SAASA,EAAM,MAAM,OAAOA,EAAM;CACpF,IAAMuC,IAASF,EAAoBrC,EAAM,MAAMA,EAAM,IAAI,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC;CAE1F,OADIuC,GAAQ,SAAS,WAAWA,EAAO,SAASvC,EAAM,OAAauC,IAC5DvC,EAAM,OAAO,SAAS,UAAUA,EAAM,SAAS,KAAA;AACxD;AAEA,SAASD,EAAiB,GAAuB;CAC/C,IAAMyC,IAAQL,EAAenC,CAAK;CAClC,IAAI,CAACwC,GAAO;CACZ,IAAM,EAAE,UAAO,WAAQ,YAASA,GAC1BC,IAAW3B,EAAqB;EAAE,SAAS;EAAG,MAAMoB;EAAO,QAAQ,CAAC;CAAE,GAAGlC,EAAM,MAAM,CAAC,CAAC;CAC7F,IAAI,CAACyC,GAAU;CACf,IAAMpC,IAAQqC,EAAeD,GAAUlB,CAAI,GACrCoB,IAAW,IAAI,IAAItB,EAAYe,CAAM,CAAC,CAAC,QAAO,MAAM,CAACpC,EAAM,OAAO,SAAS2B,CAAE,CAAC,CAAC,GAC/EiB,IAAUvC,EAAM,SAAS,GAAM,MAAWgB,EAAYwB,EAAK,IAAI,CAAC,CAAC,OAAM,MAAMF,EAAS,IAAIhB,CAAE,CAAC,IAAI,CAACmB,CAAK,IAAI,CAAC,CAAE;CACpH,IAAI,CAACF,EAAQ,QAAQ;CACrB,IAAMzB,IAASnB,EAAM,YAAY,aAAa,UAAUA,EAAM,YAAY,aAAa;CACvF,OAAO;EAAE,GAAGwC;EAAO;EAAO,MAAMrB,IAASyB,EAAQ,KAAMA,EAAQ,GAAG,EAAE,IAAK;CAAE;AAC7E;AAEA,SAASF,EAAe,GAAyB,GAA8B;CAE7E,OADID,EAAS,SAAS,WAAWA,EAAS,SAASlB,IAAa,CAAC;EAAE,MAAMkB;EAAU,QAAQ;CAAE,CAAC,IACvFA,EAAS,SAAS,KAAK,GAAM,OAAW;EAAE;EAAM,QAAQA,EAAS,QAAQK;CAAQ,EAAE;AAC5F;AAEA,SAASf,EAAgB,GAItB;CACD,IAAMgB,IAAW/C,EAAM,MAAM,QAAQ,GAAK,MAASgD,IAAMH,EAAK,QAAQ,CAAC,IAAI7C,EAAM,MAAM,QACjF8B,IAAU9B,EAAM,OAAO,SAAS,KAAI,MAAS;EACjD,IAAIiD,EAAcC,GAAOlD,EAAM,MAAM,GAAG,OAAO+C;EAC/C,IAAMD,IAAQ9C,EAAM,MAAM,WAAU,MAAQY,EAAuBiC,EAAK,IAAI,MAAMjC,EAAuBsC,CAAK,CAAC;EAC/G,IAAI,MAAQ,IAEZ,OADelD,EAAM,MAAM8C,EAAM,CAAE;CAErC,CAAC;CACD,OAAOhB,EAAQ,OAAO,MAA6BqB,MAAW,KAAA,CAAS,IAAIrB,IAAU,KAAA;AACvF;AAEA,SAASD,EAAY,GAA4B,GAA8C;CAC7F,IAAId,GAAM,SAAS,SACnB;MAAIA,EAAK,SAAS,MAAK,MAASmC,EAAM,SAAS,WAAWA,EAAM,OAAO,SAAS,KAAKD,EAAcC,GAAOxB,CAAM,CAAC,GAC/G,OAAOX;EACT,KAAK,IAAMmC,KAASnC,EAAK,UAAU;GACjC,IAAMqC,IAAQvB,EAAYqB,GAAOxB,CAAM;GACvC,IAAI0B,GAAO,OAAOA;EACpB;CAJS;AAMX;AAEA,SAASH,EAAc,GAAqB,GAAkB;CAC5D,OAAOlC,EAAK,SAAS,WAAWA,EAAK,OAAO,OAAM,MAAMW,EAAO,SAASC,CAAE,CAAC;AAC7E;AAEA,SAAST,EAAQ,GAAqB,GAAuB,IAAM,QAA4B;CAC7F,IAAIH,MAASqB,GAAQ,OAAOnB;CAC5B,IAAIF,EAAK,SAAS,SAClB,KAAK,IAAM,CAAC+B,GAAOI,MAAUnC,EAAK,SAAS,QAAQ,GAAG;EACpD,IAAMqC,IAAQlC,EAAQgC,GAAOd,GAAQ,GAAGnB,EAAI,GAAG6B,GAAO;EACtD,IAAIM,GAAO,OAAOA;CACpB;AAEF;AAEA,SAASnB,EAAiB,GAKvB;CACD,IAAMoB,IAAUC,EAAqBtD,EAAM,QAAQA,EAAM,QAAQA,EAAM,SAASA,EAAM,SAAS;CAC/F,IAAIqD,GAAS,OAAOA;CACpB,IAAME,IAAQvD,EAAM,QAAQ,QAAQ,GAAK,MAAWgD,IAAMG,GAAQ,CAAC;CACnE,OAAOnD,EAAM,OAAO,QAAQ,OAAO,GAAQ,MAAU,KAAK,IAAImD,IAASnD,EAAM,QAAQ8C,KAAUS,CAAK,IAAI,KAAK,IACzGvD,EAAM,SACN,KAAA;AACN;AAEA,SAAgBwD,EAAsB,GAKnC;CACD,IAAMxC,IAAUhB,EAAM,UAAU,QAAO,MAAM,CAACA,EAAM,KAAK,OAAO,OAAO,SAAS2B,CAAE,CAAC,GAC7ED,IAAS1B,EAAM,OAAO,QAAO,MAAMgB,EAAQ,SAASW,CAAE,CAAC,GACvDO,IAAQL,GAAa7B,EAAM,iBAAiBQ,EAAA,CAAeR,EAAM,KAAK,QAAQgB,CAAO,CAAC,CAAC,MAAMU,CAAM;CACzG,IAAI,CAACQ,GAAO;CACZ,IAAMY,IAAQZ,EAAM,SAAS,WAAU,MAASe,EAAcC,GAAOxB,CAAM,CAAC;CAC5E,IAAI,MAAQ,IACZ,OAAO;EACL,MAAMQ,EAAM;EACZ;EACA,SAASb,EAAYa,CAAK,CAAC,CAAC,QAAO,MAAM,CAACR,EAAO,SAASC,CAAE,CAAC;EAC7D,UAAUO,EAAM,SAASY,IAAQ,KAAKzB,EAAYa,EAAM,SAASY,IAAQ,EAAG,IAAI,KAAA;EAChF,MAAMZ,EAAM,SAASY,IAAQ,KAAKzB,EAAYa,EAAM,SAASY,IAAQ,EAAG,IAAI,KAAA;EAC5E,KAAK,KAAK,UAAU;GAACZ,EAAM;GAAMY;GAAOW,EAAezD,EAAM,KAAK,OAAO,IAAI;GAAGA,EAAM,KAAK,OAAO;EAAM,CAAC;CAC3G;AACF;AAEA,SAASyD,EAAe,GAAqC;CAE3D,OADK1C,IACEA,EAAK,SAAS,UAAU;EAAC;EAASA,EAAK;EAAQA,EAAK;CAAM,IAAI,CAACA,EAAK,MAAMA,EAAK,SAAS,IAAI0C,CAAc,CAAC,IADhG;AAEpB"}

package/dist/workspace/utils/placement/origin.utils.d.ts

@@ -0,0 +1,13 @@
+import type { WorkspaceDragCue, WorkspaceDragOffer, WorkspaceDropIntent } from '../interaction/drag-preview.utils.js';
+import type { WorkspaceLayout } from '../model/layout.utils.js';
+/** Reserves the actual unchanged origin, including a source with no neighboring group. */
+export declare function createInitialReservation(input: {
+    layout: WorkspaceLayout;
+    source: string[];
+    available: string[];
+    cue: WorkspaceDragCue;
+    evaluate(intent: WorkspaceDropIntent): WorkspaceDragOffer | undefined;
+}): {
+    intent: WorkspaceDropIntent;
+    offer: WorkspaceDragOffer;
+};