@nvidia-elements/core 2.23.5 → 2.23.6

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

@@ -1,20 +1,21 @@
 import { normalizeLayout as e } from "../model/layout.utils.js";
-import { findGroup as t, isValidInsertionIndex as n, placePanels as r, projectLayout as i } from "../model/operations.utils.js";
-import { createPlacementContext as a } from "./context.utils.js";
-import { findDeepestProjectionCarrier as o, getProjectionSignature as s, rebaseProjectedSplit as c } from "../model/projection.utils.js";
-import { findWorkspaceRegion as l, placeRegion as u } from "./region.utils.js";
-import { planGroupInsertion as d } from "./group-insertion.utils.js";
+import { sameArrayItems as t } from "../comparison.utils.js";
+import { findGroup as n, isValidInsertionIndex as r, placePanels as i, projectLayout as a, sameDestination as o } from "../model/operations.utils.js";
+import { findDeepestProjectionCarrier as s, rebaseProjectedSplit as c, sameProjectionShape as l } from "../model/projection.utils.js";
+import { createPlacementScope as u } from "./scope.utils.js";
+import { findWorkspaceRegion as d, placeRegion as f } from "./region.utils.js";
+import { planGroupInsertion as p } from "./group-insertion.utils.js";
 // src/workspace/utils/placement/planner.utils.ts
-function f() {
+function m() {
 	let e;
 	return (t) => {
-		e && m(e, t) || (e = {
+		e && _(e, t) || (e = {
 			layout: t.layout,
 			source: [...t.source],
 			available: [...t.available],
 			entries: []
 		});
-		let n = e.entries.find((e) => e.operation === t.operation && g(e.destination, t.destination));
+		let n = e.entries.find((e) => e.operation === t.operation && o(e.destination, t.destination));
 		if (!n) {
 			let { target: r, position: i, region: a, index: o } = t.destination;
 			n = {
@@ -25,39 +26,44 @@ function f() {
 					region: a,
 					index: o
 				},
-				plan: _(t)
+				plan: v(t)
 			}, e.entries.push(n);
 		}
 		return n.plan;
 	};
 }
-function p(e) {
-	return _(e);
-}
-function m(e, t) {
-	return e.layout === t.layout && h(e.source, t.source) && h(e.available, t.available);
-}
-function h(e, t) {
-	return e.length === t.length && e.every((e, n) => e === t[n]);
+function h(e, t, n) {
+	let r = {
+		layout: e.currentLayout,
+		source: e.source,
+		destination: t,
+		available: e.available,
+		projectLayout: e.projectLayout,
+		operation: n
+	};
+	return e.planPlacement ? e.planPlacement(r) : e.placementSession ? e.placementSession.plan(r) : g(r);
 }
-function g(e, t) {
-	return e.target === t.target && e.position === t.position && e.region === t.region && e.index === t.index;
+function g(e) {
+	return v(e);
 }
-function _(e) {
-	if (n(e.destination.index)) return v(e);
+function _(e, n) {
+	return e.layout === n.layout && t(e.source, n.source) && t(e.available, n.available);
 }
 function v(e) {
-	if (e.operation === "tab") return e.destination.position === "tab" ? A(e) : void 0;
-	if (e.destination.position !== "tab") return e.operation === "order" ? b(e) : e.operation === "insert" ? b(e) ?? d(e) : e.destination.region ? u(e) : A(e);
+	if (r(e.destination.index)) return y(e);
 }
 function y(e) {
-	let { layout: n, source: r, destination: a } = e, o = t(n.root, r[0]);
-	if (!o || !T(o.panels, r) || a.position === "tab") return;
-	let s = a.position === "left" || a.position === "right" ? "horizontal" : "vertical", c = e.available.filter((e) => !n.closed.includes(e)), l = r.find((e) => c.includes(e));
+	if (e.operation === "tab") return e.destination.position === "tab" ? j(e) : void 0;
+	if (e.destination.position !== "tab") return e.operation === "order" ? x(e) : e.operation === "insert" ? x(e) ?? p(e) : e.destination.region ? f(e) : j(e);
+}
+function b(e) {
+	let { layout: t, source: r, destination: i } = e, o = n(t.root, r[0]);
+	if (!o || !E(o.panels, r) || i.position === "tab") return;
+	let s = i.position === "left" || i.position === "right" ? "horizontal" : "vertical", c = e.available.filter((e) => !t.closed.includes(e)), l = r.find((e) => c.includes(e));
 	if (!l) return;
-	let u = (e.projectLayout ?? i)(n, c).root, d = E(u, a);
+	let u = (e.projectLayout ?? a)(t, c).root, d = D(u, i);
 	if (!d) return;
-	let f = S(u, {
+	let f = C(u, {
 		source: l,
 		target: d,
 		axis: s
@@ -69,19 +75,19 @@ function y(e) {
 		target: d
 	} : void 0;
 }
-function b(e) {
-	let t = y(e);
+function x(e) {
+	let t = b(e);
 	if (!t) return;
 	let { branch: n, visible: r, sourceId: i, target: a } = t, { layout: o, destination: s } = e;
-	if (!s.region && e.source.includes(s.target)) return j(o, e, n);
-	let l = D({
+	if (!s.region && e.source.includes(s.target)) return M(o, e, n);
+	let l = O({
 		branch: n,
 		sourceId: i,
 		targetNode: a,
 		destination: s
 	});
-	if (l.every((e, t) => e.child === n.children[t])) return j(o, e, n);
-	let u = x({
+	if (l.every((e, t) => e.child === n.children[t])) return M(o, e, n);
+	let u = S({
 		layout: o,
 		children: n.children,
 		reordered: l.map((e) => e.child),
@@ -93,92 +99,92 @@ function b(e) {
 		...n,
 		children: l.map((e) => e.child)
 	};
-	return j(c(u, d, l.map((e) => e.weight), e.available) ?? u, e, n);
+	return M(c(u, d, l.map((e) => e.weight), e.available) ?? u, e, n);
 }
-function x(t) {
-	let { layout: n, children: r, reordered: a, visible: c } = t, l = /* @__PURE__ */ new Map(), u = (e) => (l.has(e) || l.set(e, (t.projectLayout ?? i)({
+function S(t) {
+	let { layout: n, children: r, reordered: i, visible: o } = t, c = /* @__PURE__ */ new Map(), l = (e) => (c.has(e) || c.set(e, (t.projectLayout ?? a)({
 		version: 1,
 		root: e,
 		closed: []
-	}, c).root), l.get(e) ?? null), d = r.map((e) => o(n.root, s(e), u));
-	if (d.some((e) => !e)) return;
-	let f = /* @__PURE__ */ new Map();
-	d.forEach((e, t) => f.set(e, d[r.indexOf(a[t])]));
-	let p = e(C(n.root, f));
-	return p ? {
+	}, o).root), c.get(e) ?? null), u = r.map((e) => s(n.root, e, l));
+	if (u.some((e) => !e)) return;
+	let d = /* @__PURE__ */ new Map();
+	u.forEach((e, t) => d.set(e, u[r.indexOf(i[t])]));
+	let f = e(w(n.root, d));
+	return f ? {
 		...n,
-		root: p
+		root: f
 	} : void 0;
 }
-function S(e, t) {
+function C(e, t) {
 	if (e && e.type !== "group") {
-		if (O(e, t)) return e;
+		if (k(e, t)) return e;
 		for (let n of e.children) {
-			let e = S(n, t);
+			let e = C(n, t);
 			if (e) return e;
 		}
 	}
 }
-function C(e, t) {
+function w(e, t) {
 	return t.get(e) || (e.type === "group" ? e : {
 		...e,
-		children: e.children.map((e) => C(e, t))
+		children: e.children.map((e) => w(e, t))
 	});
 }
-function w(e, t) {
+function T(e, t) {
 	return e ? {
 		kind: t.position === "tab" ? "tab" : "split",
 		layout: e
 	} : void 0;
 }
-function T(e, t) {
+function E(e, t) {
 	return e.length === t.length && e.every((e, n) => e === t[n]);
 }
-function E(e, n) {
-	return n.region ? l(e, n.region) : t(e, n.target);
+function D(e, t) {
+	return t.region ? d(e, t.region) : n(e, t.target);
 }
-function D(e) {
+function O(e) {
 	let { branch: t, sourceId: n, targetNode: r, destination: i } = e, a = t.children.findIndex((e) => e.type === "group" && e.panels.includes(n)), o = t.children.map((e, n) => ({
 		child: e,
 		weight: t.weights[n]
-	})), c = o.splice(a, 1)[0], l = i.position === "right" || i.position === "bottom", u = o.findIndex((e) => s(e.child) === s(r)), d;
-	if (r === t) d = l ? o.length : 0;
+	})), s = o.splice(a, 1)[0], c = i.position === "right" || i.position === "bottom", u = o.findIndex((e) => l(e.child, r)), d;
+	if (r === t) d = c ? o.length : 0;
 	else {
 		if (u < 0) return t.children.map((e, n) => ({
 			child: e,
 			weight: t.weights[n]
 		}));
-		d = u + +!!l;
+		d = u + +!!c;
 	}
-	return o.splice(d, 0, c), o;
+	return o.splice(d, 0, s), o;
 }
-function O(e, t) {
-	return e.axis === t.axis && e.children.length > 1 && e.children.some((e) => e.type === "group" && e.panels.includes(t.source ?? "")) && (s(e) === s(t.target) || e.children.some((e) => s(e) === s(t.target)));
+function k(e, t) {
+	return e.axis === t.axis && e.children.length > 1 && e.children.some((e) => e.type === "group" && e.panels.includes(t.source ?? "")) && (l(e, t.target) || e.children.some((e) => l(e, t.target)));
 }
-function k(e) {
-	let { layout: t, source: n, destination: i } = e, a = r({
+function A(e) {
+	let { layout: t, source: n, destination: r } = e, a = i({
 		layout: t,
 		source: n,
-		destination: i
+		destination: r
 	});
-	return a ? w(a, i) : void 0;
+	return a ? T(a, r) : void 0;
 }
-function A(e) {
-	let n = k(e);
-	if (!n) return n;
-	let r = t((e.projectLayout ?? i)(e.layout, e.available).root, e.destination.target);
+function j(e) {
+	let t = A(e);
+	if (!t) return t;
+	let r = n((e.projectLayout ?? a)(e.layout, e.available).root, e.destination.target);
 	return {
-		...n,
-		context: a("recipient", r ?? null, e.source)
+		...t,
+		scope: u("recipient", r ?? null, e.source)
 	};
 }
-function j(e, t, n) {
+function M(e, t, n) {
 	return {
 		kind: "reorder",
 		layout: e,
-		context: a("rail", n, t.source)
+		scope: u("rail", n, t.source)
 	};
 }
-export { f as createWorkspacePlacementPlanner, p as planWorkspacePlacement };
+export { m as createWorkspacePlacementPlanner, g as planWorkspacePlacement, h as resolvePlacementPlan };
 
 //# sourceMappingURL=planner.utils.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"planner.utils.js","names":["createWorkspacePlacementPlanner","binding","samePlanningBinding","input","entry","candidate","sameDestination","planBasePlacement","planWorkspacePlacement","sameIds","left","right","id","index","isValidInsertionIndex","planPeerPlacement","localPlacement","reorderPeers","planGroupInsertion","placeRegion","peerContext","group","findGroup","layout","source","wholeGroup","destination","axis","visible","sourceId","projectedRoot","projectLayout","target","projectedTarget","branch","peerBranch","context","targetNode","peerPlacement","entries","reorderedEntries","permuteCarriers","reordered","rebaseProjectedSplit","projections","project","node","carriers","children","findDeepestProjectionCarrier","getProjectionSignature","child","carrier","replacements","slot","root","normalizeLayout","replaceCarriers","matchesPeers","found","placement","panels","findWorkspaceRegion","from","moving","after","localCandidate","placePanels","plan","recipient","createPlacementContext"],"sources":["../../../../src/workspace/utils/placement/planner.utils.ts"],"sourcesContent":["// SPDX-FileCopyrightText: Copyright (c) 2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.\n// SPDX-License-Identifier: Apache-2.0\n\nimport { normalizeLayout } from '../model/layout.utils.js';\nimport { findGroup, isValidInsertionIndex, placePanels, projectLayout } from '../model/operations.utils.js';\nimport {\n  findDeepestProjectionCarrier,\n  getProjectionSignature,\n  rebaseProjectedSplit\n} from '../model/projection.utils.js';\nimport { createPlacementContext } from './context.utils.js';\nimport { planGroupInsertion } from './group-insertion.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 { WorkspacePlacementContext } from './context.utils.js';\n\nexport interface WorkspacePlacementPlan {\n  kind: 'reorder' | 'split' | 'tab' | 'insert';\n  context?: WorkspacePlacementContext;\n  layout: WorkspaceLayout;\n}\n\ninterface PlacementInput {\n  layout: WorkspaceLayout;\n  source: string[];\n  destination: WorkspaceDestination;\n  available: string[];\n  projectLayout?: WorkspaceLayoutProjector;\n  operation: 'split' | 'order' | 'insert' | 'tab';\n}\n\nexport type WorkspacePlacementPlanner = (input: PlacementInput) => WorkspacePlacementPlan | undefined;\n\ninterface PlanningEntry {\n  operation: PlacementInput['operation'];\n  destination: WorkspaceDestination;\n  plan: WorkspacePlacementPlan | undefined;\n}\n\ninterface PlanningBinding {\n  layout: WorkspaceLayout;\n  source: string[];\n  available: string[];\n  entries: PlanningEntry[];\n}\n\n/** Requires an immutable current layout; projection callbacks are never retained. */\nexport function createWorkspacePlacementPlanner(): WorkspacePlacementPlanner {\n  let binding: PlanningBinding | undefined;\n  return input => {\n    if (!binding || !samePlanningBinding(binding, input)) {\n      binding = { layout: input.layout, source: [...input.source], available: [...input.available], entries: [] };\n    }\n    let entry = binding.entries.find(\n      candidate => candidate.operation === input.operation && sameDestination(candidate.destination, input.destination)\n    );\n    if (!entry) {\n      const { target, position, region, index } = input.destination;\n      entry = {\n        operation: input.operation,\n        destination: { target, position, region, index },\n        plan: planBasePlacement(input)\n      };\n      binding.entries.push(entry);\n    }\n    return entry.plan;\n  };\n}\n\nexport function planWorkspacePlacement(input: PlacementInput): WorkspacePlacementPlan | undefined {\n  return planBasePlacement(input);\n}\n\nfunction samePlanningBinding(binding: PlanningBinding, input: PlacementInput) {\n  return (\n    binding.layout === input.layout &&\n    sameIds(binding.source, input.source) &&\n    sameIds(binding.available, input.available)\n  );\n}\n\nfunction sameIds(left: string[], right: string[]) {\n  return left.length === right.length && left.every((id, index) => id === right[index]);\n}\n\nfunction sameDestination(left: WorkspaceDestination, right: WorkspaceDestination) {\n  return (\n    left.target === right.target &&\n    left.position === right.position &&\n    left.region === right.region &&\n    left.index === right.index\n  );\n}\n\nfunction planBasePlacement(input: PlacementInput) {\n  if (!isValidInsertionIndex(input.destination.index)) return undefined;\n  return planPeerPlacement(input);\n}\n\nfunction planPeerPlacement(input: PlacementInput) {\n  if (input.operation === 'tab') return input.destination.position === 'tab' ? localPlacement(input) : undefined;\n  if (input.destination.position === 'tab') return undefined;\n  if (input.operation === 'order') return reorderPeers(input);\n  if (input.operation === 'insert') return reorderPeers(input) ?? planGroupInsertion(input);\n  return input.destination.region ? placeRegion(input) : localPlacement(input);\n}\n\nfunction peerContext(input: PlacementInput) {\n  const { layout, source, destination } = input;\n  const group = findGroup(layout.root, source[0]);\n  if (!group || !wholeGroup(group.panels, source)) return undefined;\n  if (destination.position === 'tab') return undefined;\n  const axis = destination.position === 'left' || destination.position === 'right' ? 'horizontal' : 'vertical';\n  const visible = input.available.filter(id => !layout.closed.includes(id));\n  const sourceId = source.find(id => visible.includes(id));\n  if (!sourceId) return undefined;\n  const projectedRoot = (input.projectLayout ?? projectLayout)(layout, visible).root;\n  const target = projectedTarget(projectedRoot, destination);\n  if (!target) return undefined;\n  const branch = peerBranch(projectedRoot, { source: sourceId, target, axis });\n  return branch ? { branch, visible, sourceId, target } : undefined;\n}\n\nfunction reorderPeers(input: PlacementInput): WorkspacePlacementPlan | undefined {\n  const context = peerContext(input);\n  if (!context) return undefined;\n  const { branch, visible, sourceId, target: targetNode } = context;\n  const { layout, destination } = input;\n  if (!destination.region && input.source.includes(destination.target)) return peerPlacement(layout, input, branch);\n  const entries = reorderedEntries({ branch, sourceId, targetNode, destination });\n  if (entries.every((entry, index) => entry.child === branch.children[index]))\n    return peerPlacement(layout, input, branch);\n  const candidate = permuteCarriers({\n    layout,\n    children: branch.children,\n    reordered: entries.map(entry => entry.child),\n    visible,\n    projectLayout: input.projectLayout\n  });\n  if (!candidate) return undefined;\n  const reordered = { ...branch, children: entries.map(entry => entry.child) };\n  return peerPlacement(\n    rebaseProjectedSplit(\n      candidate,\n      reordered,\n      entries.map(entry => entry.weight),\n      input.available\n    ) ?? candidate,\n    input,\n    branch\n  );\n}\n\nfunction permuteCarriers(input: {\n  layout: WorkspaceLayout;\n  children: WorkspaceNode[];\n  reordered: WorkspaceNode[];\n  visible: string[];\n  projectLayout?: WorkspaceLayoutProjector;\n}): WorkspaceLayout | undefined {\n  const { layout, children, reordered, visible } = input;\n  const projections = new Map<WorkspaceNode, WorkspaceNode | null>();\n  const project = (node: WorkspaceNode) => {\n    if (!projections.has(node)) {\n      projections.set(\n        node,\n        (input.projectLayout ?? projectLayout)({ version: 1, root: node, closed: [] }, visible).root\n      );\n    }\n    return projections.get(node) ?? null;\n  };\n  const carriers = children.map(child =>\n    findDeepestProjectionCarrier(layout.root, getProjectionSignature(child), project)\n  );\n  if (carriers.some(carrier => !carrier)) return undefined;\n  const replacements = new Map<WorkspaceNode, WorkspaceNode>();\n  carriers.forEach((slot, index) => replacements.set(slot!, carriers[children.indexOf(reordered[index]!)]!));\n  const root = normalizeLayout(replaceCarriers(layout.root!, replacements));\n  return root ? { ...layout, root } : undefined;\n}\n\nfunction peerBranch(\n  node: WorkspaceNode | null,\n  input: { source?: string; target: WorkspaceNode; axis: WorkspaceSplit['axis'] }\n): WorkspaceSplit | undefined {\n  if (!node || node.type === 'group') return undefined;\n  if (matchesPeers(node, input)) return node;\n  for (const child of node.children) {\n    const found = peerBranch(child, input);\n    if (found) return found;\n  }\n  return undefined;\n}\n\nfunction replaceCarriers(node: WorkspaceNode, replacements: Map<WorkspaceNode, WorkspaceNode>): WorkspaceNode {\n  const payload = replacements.get(node);\n  if (payload) return payload;\n  if (node.type === 'group') return node;\n  return { ...node, children: node.children.map(child => replaceCarriers(child, replacements)) };\n}\n\nfunction placement(\n  layout: WorkspaceLayout | undefined,\n  destination: WorkspaceDestination\n): WorkspacePlacementPlan | undefined {\n  return layout ? { kind: destination.position === 'tab' ? 'tab' : 'split', layout } : undefined;\n}\n\nfunction wholeGroup(panels: string[], source: string[]) {\n  return panels.length === source.length && panels.every((id, index) => id === source[index]);\n}\n\nfunction projectedTarget(root: WorkspaceNode | null, destination: WorkspaceDestination) {\n  return destination.region ? findWorkspaceRegion(root, destination.region) : findGroup(root, destination.target);\n}\n\nfunction reorderedEntries(input: {\n  branch: WorkspaceSplit;\n  sourceId: string;\n  targetNode: WorkspaceNode;\n  destination: WorkspaceDestination;\n}) {\n  const { branch, sourceId, targetNode, destination } = input;\n  const from = branch.children.findIndex(child => child.type === 'group' && child.panels.includes(sourceId));\n  const entries = branch.children.map((child, index) => ({ child, weight: branch.weights[index]! }));\n  const moving = entries.splice(from, 1)[0]!;\n  const after = destination.position === 'right' || destination.position === 'bottom';\n  const target = entries.findIndex(entry => getProjectionSignature(entry.child) === getProjectionSignature(targetNode));\n  let index: number;\n  if (targetNode === branch) {\n    index = after ? entries.length : 0;\n  } else {\n    if (target < 0) return branch.children.map((child, slot) => ({ child, weight: branch.weights[slot]! }));\n    const offset = after ? 1 : 0;\n    index = target + offset;\n  }\n  entries.splice(index, 0, moving);\n  return entries;\n}\n\nfunction matchesPeers(\n  node: WorkspaceSplit,\n  input: { source?: string; target: WorkspaceNode; axis: WorkspaceSplit['axis'] }\n) {\n  return (\n    node.axis === input.axis &&\n    node.children.length > 1 &&\n    node.children.some(child => child.type === 'group' && child.panels.includes(input.source ?? '')) &&\n    (getProjectionSignature(node) === getProjectionSignature(input.target) ||\n      node.children.some(child => getProjectionSignature(child) === getProjectionSignature(input.target)))\n  );\n}\n\nfunction localCandidate(input: PlacementInput): WorkspacePlacementPlan | undefined {\n  const { layout, source, destination } = input;\n  const candidate = placePanels({ layout, source, destination });\n  return candidate ? placement(candidate, destination) : undefined;\n}\n\nfunction localPlacement(input: PlacementInput): WorkspacePlacementPlan | undefined {\n  const plan = localCandidate(input);\n  if (!plan) return plan;\n  const recipient = findGroup(\n    (input.projectLayout ?? projectLayout)(input.layout, input.available).root,\n    input.destination.target\n  );\n  return { ...plan, context: createPlacementContext('recipient', recipient ?? null, input.source) };\n}\n\nfunction peerPlacement(layout: WorkspaceLayout, input: PlacementInput, branch: WorkspaceSplit): WorkspacePlacementPlan {\n  return {\n    kind: 'reorder',\n    layout,\n    context: createPlacementContext('rail', branch, input.source)\n  };\n}\n"],"mappings":";;;;;;;AAkDA,SAAgBA,IAA6D;CAC3E,IAAIC;CACJ,QAAO,MAAS;EACd,AAAKA,KAAYC,EAAoBD,GAASE,CAAK,MACjD,IAAU;GAAE,QAAQA,EAAM;GAAQ,QAAQ,CAAC,GAAGA,EAAM,MAAM;GAAG,WAAW,CAAC,GAAGA,EAAM,SAAS;GAAG,SAAS,CAAC;EAAE;EAE5G,IAAIC,IAAQH,EAAQ,QAAQ,MAC1B,MAAaI,EAAU,cAAcF,EAAM,aAAaG,EAAgBD,EAAU,aAAaF,EAAM,WAAW,CAClH;EACA,IAAI,CAACC,GAAO;GACV,IAAM,EAAE,WAAQ,aAAU,WAAQ,aAAUD,EAAM;GAMlD,AALA,IAAQ;IACN,WAAWA,EAAM;IACjB,aAAa;KAAE;KAAQ;KAAU;KAAQ;IAAM;IAC/C,MAAMI,EAAkBJ,CAAK;GAC/B,GACAF,EAAQ,QAAQ,KAAKG,CAAK;EAC5B;EACA,OAAOA,EAAM;CACf;AACF;AAEA,SAAgBI,EAAuB,GAA2D;CAChG,OAAOD,EAAkBJ,CAAK;AAChC;AAEA,SAASD,EAAoB,GAA0B,GAAuB;CAC5E,OACED,EAAQ,WAAWE,EAAM,UACzBM,EAAQR,EAAQ,QAAQE,EAAM,MAAM,KACpCM,EAAQR,EAAQ,WAAWE,EAAM,SAAS;AAE9C;AAEA,SAASM,EAAQ,GAAgB,GAAiB;CAChD,OAAOC,EAAK,WAAWC,EAAM,UAAUD,EAAK,OAAO,GAAI,MAAUE,MAAOD,EAAME,EAAM;AACtF;AAEA,SAASP,EAAgB,GAA4B,GAA6B;CAChF,OACEI,EAAK,WAAWC,EAAM,UACtBD,EAAK,aAAaC,EAAM,YACxBD,EAAK,WAAWC,EAAM,UACtBD,EAAK,UAAUC,EAAM;AAEzB;AAEA,SAASJ,EAAkB,GAAuB;CAChD,IAAKO,EAAsBX,EAAM,YAAY,KAAK,GAClD,OAAOY,EAAkBZ,CAAK;AAChC;AAEA,SAASY,EAAkB,GAAuB;CAChD,IAAIZ,EAAM,cAAc,OAAO,OAAOA,EAAM,YAAY,aAAa,QAAQa,EAAeb,CAAK,IAAI,KAAA;CACrG,IAAIA,EAAM,YAAY,aAAa,OAGnC,OAFIA,EAAM,cAAc,UAAgBc,EAAad,CAAK,IACtDA,EAAM,cAAc,WAAiBc,EAAad,CAAK,KAAKe,EAAmBf,CAAK,IACjFA,EAAM,YAAY,SAASgB,EAAYhB,CAAK,IAAIa,EAAeb,CAAK;AAC7E;AAEA,SAASiB,EAAY,GAAuB;CAC1C,IAAM,EAAE,WAAQ,WAAQ,mBAAgBjB,GAClCkB,IAAQC,EAAUC,EAAO,MAAMC,EAAO,EAAE;CAE9C,IADI,CAACH,KAAS,CAACI,EAAWJ,EAAM,QAAQG,CAAM,KAC1CE,EAAY,aAAa,OAAO;CACpC,IAAMC,IAAOD,EAAY,aAAa,UAAUA,EAAY,aAAa,UAAU,eAAe,YAC5FE,IAAUzB,EAAM,UAAU,QAAO,MAAM,CAACoB,EAAO,OAAO,SAASX,CAAE,CAAC,GAClEiB,IAAWL,EAAO,MAAK,MAAMI,EAAQ,SAAShB,CAAE,CAAC;CACvD,IAAI,CAACiB,GAAU;CACf,IAAMC,KAAiB3B,EAAM,iBAAiB4B,EAAA,CAAeR,GAAQK,CAAO,CAAC,CAAC,MACxEI,IAASC,EAAgBH,GAAeJ,CAAW;CACzD,IAAI,CAACM,GAAQ;CACb,IAAME,IAASC,EAAWL,GAAe;EAAE,QAAQD;EAAU;EAAQ;CAAK,CAAC;CAC3E,OAAOK,IAAS;EAAE;EAAQ;EAAS;EAAU;CAAO,IAAI,KAAA;AAC1D;AAEA,SAASjB,EAAa,GAA2D;CAC/E,IAAMmB,IAAUhB,EAAYjB,CAAK;CACjC,IAAI,CAACiC,GAAS;CACd,IAAM,EAAE,WAAQ,YAAS,aAAU,QAAQC,MAAeD,GACpD,EAAE,WAAQ,mBAAgBjC;CAChC,IAAI,CAACuB,EAAY,UAAUvB,EAAM,OAAO,SAASuB,EAAY,MAAM,GAAG,OAAOY,EAAcf,GAAQpB,GAAO+B,CAAM;CAChH,IAAMK,IAAUC,EAAiB;EAAE;EAAQ;EAAU;EAAY;CAAY,CAAC;CAC9E,IAAID,EAAQ,OAAO,GAAO,MAAUnC,EAAM,UAAU8B,EAAO,SAASrB,EAAM,GACxE,OAAOyB,EAAcf,GAAQpB,GAAO+B,CAAM;CAC5C,IAAM7B,IAAYoC,EAAgB;EAChC;EACA,UAAUP,EAAO;EACjB,WAAWK,EAAQ,KAAI,MAASnC,EAAM,KAAK;EAC3C;EACA,eAAeD,EAAM;CACvB,CAAC;CACD,IAAI,CAACE,GAAW;CAChB,IAAMqC,IAAY;EAAE,GAAGR;EAAQ,UAAUK,EAAQ,KAAI,MAASnC,EAAM,KAAK;CAAE;CAC3E,OAAOkC,EACLK,EACEtC,GACAqC,GACAH,EAAQ,KAAI,MAASnC,EAAM,MAAM,GACjCD,EAAM,SACR,KAAKE,GACLF,GACA+B,CACF;AACF;AAEA,SAASO,EAAgB,GAMO;CAC9B,IAAM,EAAE,WAAQ,aAAU,cAAW,eAAYtC,GAC3CyC,oBAAc,IAAI,IAAyC,GAC3DC,KAAW,OACVD,EAAY,IAAIE,CAAI,KACvBF,EAAY,IACVE,IACC3C,EAAM,iBAAiB4B,EAAA,CAAe;EAAE,SAAS;EAAG,MAAMe;EAAM,QAAQ,CAAC;CAAE,GAAGlB,CAAO,CAAC,CAAC,IAC1F,GAEKgB,EAAY,IAAIE,CAAI,KAAK,OAE5BC,IAAWC,EAAS,KAAI,MAC5BC,EAA6B1B,EAAO,MAAM2B,EAAuBC,CAAK,GAAGN,CAAO,CAClF;CACA,IAAIE,EAAS,MAAK,MAAW,CAACK,CAAO,GAAG;CACxC,IAAMC,oBAAe,IAAI,IAAkC;CAC3D,EAAS,SAAS,GAAM,MAAUA,EAAa,IAAIC,GAAOP,EAASC,EAAS,QAAQN,EAAU7B,EAAO,EAAG,CAAC;CACzG,IAAM0C,IAAOC,EAAgBC,EAAgBlC,EAAO,MAAO8B,CAAY,CAAC;CACxE,OAAOE,IAAO;EAAE,GAAGhC;EAAQ;CAAK,IAAI,KAAA;AACtC;AAEA,SAASY,EACP,GACA,GAC4B;CAC5B,IAAKW,KAAQA,EAAK,SAAS,SAC3B;MAAIY,EAAaZ,GAAM3C,CAAK,GAAG,OAAO2C;EACtC,KAAK,IAAMK,KAASL,EAAK,UAAU;GACjC,IAAMa,IAAQxB,EAAWgB,GAAOhD,CAAK;GACrC,IAAIwD,GAAO,OAAOA;EACpB;CAJsC;AAMxC;AAEA,SAASF,EAAgB,GAAqB,GAAgE;CAI5G,OAHgBJ,EAAa,IAAIP,CAC7B,MACAA,EAAK,SAAS,UAAgBA,IAC3B;EAAE,GAAGA;EAAM,UAAUA,EAAK,SAAS,KAAI,MAASW,EAAgBN,GAAOE,CAAY,CAAC;CAAE;AAC/F;AAEA,SAASO,EACP,GACA,GACoC;CACpC,OAAOrC,IAAS;EAAE,MAAMG,EAAY,aAAa,QAAQ,QAAQ;EAAS;CAAO,IAAI,KAAA;AACvF;AAEA,SAASD,EAAW,GAAkB,GAAkB;CACtD,OAAOoC,EAAO,WAAWrC,EAAO,UAAUqC,EAAO,OAAO,GAAI,MAAUjD,MAAOY,EAAOX,EAAM;AAC5F;AAEA,SAASoB,EAAgB,GAA4B,GAAmC;CACtF,OAAOP,EAAY,SAASoC,EAAoBP,GAAM7B,EAAY,MAAM,IAAIJ,EAAUiC,GAAM7B,EAAY,MAAM;AAChH;AAEA,SAASc,EAAiB,GAKvB;CACD,IAAM,EAAE,WAAQ,aAAU,eAAY,mBAAgBrC,GAChD4D,IAAO7B,EAAO,SAAS,WAAU,MAASiB,EAAM,SAAS,WAAWA,EAAM,OAAO,SAAStB,CAAQ,CAAC,GACnGU,IAAUL,EAAO,SAAS,KAAK,GAAO,OAAW;EAAE;EAAO,QAAQA,EAAO,QAAQrB;CAAQ,EAAE,GAC3FmD,IAASzB,EAAQ,OAAOwB,GAAM,CAAC,CAAC,CAAC,IACjCE,IAAQvC,EAAY,aAAa,WAAWA,EAAY,aAAa,UACrEM,IAASO,EAAQ,WAAU,MAASW,EAAuB9C,EAAM,KAAK,MAAM8C,EAAuBb,CAAU,CAAC,GAChHxB;CACJ,IAAIwB,MAAeH,GACjB,IAAQ+B,IAAQ1B,EAAQ,SAAS;MAC5B;EACL,IAAIP,IAAS,GAAG,OAAOE,EAAO,SAAS,KAAK,GAAO,OAAU;GAAE;GAAO,QAAQA,EAAO,QAAQoB;EAAO,EAAE;EAEtG,IAAQtB,IADO;CAEjB;CAEA,OADAO,EAAQ,OAAO1B,GAAO,GAAGmD,CAAM,GACxBzB;AACT;AAEA,SAASmB,EACP,GACA,GACA;CACA,OACEZ,EAAK,SAAS3C,EAAM,QACpB2C,EAAK,SAAS,SAAS,KACvBA,EAAK,SAAS,MAAK,MAASK,EAAM,SAAS,WAAWA,EAAM,OAAO,SAAShD,EAAM,UAAU,EAAE,CAAC,MAC9F+C,EAAuBJ,CAAI,MAAMI,EAAuB/C,EAAM,MAAM,KACnE2C,EAAK,SAAS,MAAK,MAASI,EAAuBC,CAAK,MAAMD,EAAuB/C,EAAM,MAAM,CAAC;AAExG;AAEA,SAAS+D,EAAe,GAA2D;CACjF,IAAM,EAAE,WAAQ,WAAQ,mBAAgB/D,GAClCE,IAAY8D,EAAY;EAAE;EAAQ;EAAQ;CAAY,CAAC;CAC7D,OAAO9D,IAAYuD,EAAUvD,GAAWqB,CAAW,IAAI,KAAA;AACzD;AAEA,SAASV,EAAe,GAA2D;CACjF,IAAMoD,IAAOF,EAAe/D,CAAK;CACjC,IAAI,CAACiE,GAAM,OAAOA;CAClB,IAAMC,IAAY/C,GACfnB,EAAM,iBAAiB4B,EAAA,CAAe5B,EAAM,QAAQA,EAAM,SAAS,CAAC,CAAC,MACtEA,EAAM,YAAY,MACpB;CACA,OAAO;EAAE,GAAGiE;EAAM,SAASE,EAAuB,aAAaD,KAAa,MAAMlE,EAAM,MAAM;CAAE;AAClG;AAEA,SAASmC,EAAc,GAAyB,GAAuB,GAAgD;CACrH,OAAO;EACL,MAAM;EACN;EACA,SAASgC,EAAuB,QAAQpC,GAAQ/B,EAAM,MAAM;CAC9D;AACF"}
+{"version":3,"file":"planner.utils.js","names":["createWorkspacePlacementPlanner","binding","samePlanningBinding","input","entry","candidate","sameDestination","planBasePlacement","resolvePlacementPlan","context","planWorkspacePlacement","sameArrayItems","isValidInsertionIndex","planPeerPlacement","localPlacement","reorderPeers","planGroupInsertion","placeRegion","peerContext","group","findGroup","layout","source","wholeGroup","destination","axis","visible","id","sourceId","projectedRoot","projectLayout","target","projectedTarget","branch","peerBranch","targetNode","peerPlacement","entries","reorderedEntries","index","permuteCarriers","reordered","rebaseProjectedSplit","projections","project","node","carriers","children","findDeepestProjectionCarrier","child","carrier","replacements","root","normalizeLayout","replaceCarriers","matchesPeers","found","placement","panels","findWorkspaceRegion","from","moving","after","sameProjectionShape","childIndex","localCandidate","placePanels","plan","recipient","createPlacementScope"],"sources":["../../../../src/workspace/utils/placement/planner.utils.ts"],"sourcesContent":["// SPDX-FileCopyrightText: Copyright (c) 2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.\n// SPDX-License-Identifier: Apache-2.0\n\nimport { normalizeLayout } from '../model/layout.utils.js';\nimport {\n  findGroup,\n  isValidInsertionIndex,\n  placePanels,\n  projectLayout,\n  sameDestination\n} from '../model/operations.utils.js';\nimport { findDeepestProjectionCarrier, rebaseProjectedSplit, sameProjectionShape } from '../model/projection.utils.js';\nimport { planGroupInsertion } from './group-insertion.utils.js';\nimport { findWorkspaceRegion, placeRegion } from './region.utils.js';\nimport { createPlacementScope } from './scope.utils.js';\nimport { sameArrayItems } from '../comparison.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 { WorkspacePlacementScope } from './scope.utils.js';\nimport type { WorkspacePlacementSession } from './session.utils.js';\n\nexport interface WorkspacePlacementPlan {\n  kind: 'reorder' | 'split' | 'tab' | 'insert';\n  scope?: WorkspacePlacementScope;\n  layout: WorkspaceLayout;\n}\n\ninterface PlacementInput {\n  layout: WorkspaceLayout;\n  source: string[];\n  destination: WorkspaceDestination;\n  available: string[];\n  projectLayout?: WorkspaceLayoutProjector;\n  operation: 'split' | 'order' | 'insert' | 'tab';\n}\n\nexport type WorkspacePlacementPlanner = (input: PlacementInput) => WorkspacePlacementPlan | undefined;\n\ninterface PlanningEntry {\n  operation: PlacementInput['operation'];\n  destination: WorkspaceDestination;\n  plan: WorkspacePlacementPlan | undefined;\n}\n\ninterface PlanningBinding {\n  layout: WorkspaceLayout;\n  source: string[];\n  available: string[];\n  entries: PlanningEntry[];\n}\n\n/** Requires an immutable current layout; projection callbacks are never retained. */\nexport function createWorkspacePlacementPlanner(): WorkspacePlacementPlanner {\n  let binding: PlanningBinding | undefined;\n  return input => {\n    if (!binding || !samePlanningBinding(binding, input)) {\n      binding = { layout: input.layout, source: [...input.source], available: [...input.available], entries: [] };\n    }\n    let entry = binding.entries.find(\n      candidate => candidate.operation === input.operation && sameDestination(candidate.destination, input.destination)\n    );\n    if (!entry) {\n      const { target, position, region, index } = input.destination;\n      entry = {\n        operation: input.operation,\n        destination: { target, position, region, index },\n        plan: planBasePlacement(input)\n      };\n      binding.entries.push(entry);\n    }\n    return entry.plan;\n  };\n}\n\ninterface WorkspacePlanningContext {\n  currentLayout: WorkspaceLayout;\n  source: string[];\n  available: string[];\n  projectLayout?: WorkspaceLayoutProjector;\n  planPlacement?: WorkspacePlacementPlanner;\n  placementSession?: WorkspacePlacementSession;\n}\n\n/** Supplied planners keep their ordinary path; component gestures use their explicit session. */\nexport function resolvePlacementPlan(\n  context: WorkspacePlanningContext,\n  destination: WorkspaceDestination,\n  operation: PlacementInput['operation']\n): WorkspacePlacementPlan | undefined {\n  const input = {\n    layout: context.currentLayout,\n    source: context.source,\n    destination,\n    available: context.available,\n    projectLayout: context.projectLayout,\n    operation\n  };\n  if (context.planPlacement) return context.planPlacement(input);\n  return context.placementSession ? context.placementSession.plan(input) : planWorkspacePlacement(input);\n}\n\nexport function planWorkspacePlacement(input: PlacementInput): WorkspacePlacementPlan | undefined {\n  return planBasePlacement(input);\n}\n\nfunction samePlanningBinding(binding: PlanningBinding, input: PlacementInput) {\n  return (\n    binding.layout === input.layout &&\n    sameArrayItems(binding.source, input.source) &&\n    sameArrayItems(binding.available, input.available)\n  );\n}\n\nfunction planBasePlacement(input: PlacementInput) {\n  if (!isValidInsertionIndex(input.destination.index)) return undefined;\n  return planPeerPlacement(input);\n}\n\nfunction planPeerPlacement(input: PlacementInput) {\n  if (input.operation === 'tab') return input.destination.position === 'tab' ? localPlacement(input) : undefined;\n  if (input.destination.position === 'tab') return undefined;\n  if (input.operation === 'order') return reorderPeers(input);\n  if (input.operation === 'insert') return reorderPeers(input) ?? planGroupInsertion(input);\n  return input.destination.region ? placeRegion(input) : localPlacement(input);\n}\n\nfunction peerContext(input: PlacementInput) {\n  const { layout, source, destination } = input;\n  const group = findGroup(layout.root, source[0]);\n  if (!group || !wholeGroup(group.panels, source)) return undefined;\n  if (destination.position === 'tab') return undefined;\n  const axis = destination.position === 'left' || destination.position === 'right' ? 'horizontal' : 'vertical';\n  const visible = input.available.filter(id => !layout.closed.includes(id));\n  const sourceId = source.find(id => visible.includes(id));\n  if (!sourceId) return undefined;\n  const projectedRoot = (input.projectLayout ?? projectLayout)(layout, visible).root;\n  const target = projectedTarget(projectedRoot, destination);\n  if (!target) return undefined;\n  const branch = peerBranch(projectedRoot, { source: sourceId, target, axis });\n  return branch ? { branch, visible, sourceId, target } : undefined;\n}\n\nfunction reorderPeers(input: PlacementInput): WorkspacePlacementPlan | undefined {\n  const context = peerContext(input);\n  if (!context) return undefined;\n  const { branch, visible, sourceId, target: targetNode } = context;\n  const { layout, destination } = input;\n  if (!destination.region && input.source.includes(destination.target)) return peerPlacement(layout, input, branch);\n  const entries = reorderedEntries({ branch, sourceId, targetNode, destination });\n  if (entries.every((entry, index) => entry.child === branch.children[index]))\n    return peerPlacement(layout, input, branch);\n  const candidate = permuteCarriers({\n    layout,\n    children: branch.children,\n    reordered: entries.map(entry => entry.child),\n    visible,\n    projectLayout: input.projectLayout\n  });\n  if (!candidate) return undefined;\n  const reordered = { ...branch, children: entries.map(entry => entry.child) };\n  return peerPlacement(\n    rebaseProjectedSplit(\n      candidate,\n      reordered,\n      entries.map(entry => entry.weight),\n      input.available\n    ) ?? candidate,\n    input,\n    branch\n  );\n}\n\nfunction permuteCarriers(input: {\n  layout: WorkspaceLayout;\n  children: WorkspaceNode[];\n  reordered: WorkspaceNode[];\n  visible: string[];\n  projectLayout?: WorkspaceLayoutProjector;\n}): WorkspaceLayout | undefined {\n  const { layout, children, reordered, visible } = input;\n  const projections = new Map<WorkspaceNode, WorkspaceNode | null>();\n  const project = (node: WorkspaceNode) => {\n    if (!projections.has(node)) {\n      projections.set(\n        node,\n        (input.projectLayout ?? projectLayout)({ version: 1, root: node, closed: [] }, visible).root\n      );\n    }\n    return projections.get(node) ?? null;\n  };\n  const carriers = children.map(child => findDeepestProjectionCarrier(layout.root, child, project));\n  if (carriers.some(carrier => !carrier)) return undefined;\n  const replacements = new Map<WorkspaceNode, WorkspaceNode>();\n  carriers.forEach((carrier, index) => replacements.set(carrier!, carriers[children.indexOf(reordered[index]!)]!));\n  const root = normalizeLayout(replaceCarriers(layout.root!, replacements));\n  return root ? { ...layout, root } : undefined;\n}\n\nfunction peerBranch(\n  node: WorkspaceNode | null,\n  input: { source?: string; target: WorkspaceNode; axis: WorkspaceSplit['axis'] }\n): WorkspaceSplit | undefined {\n  if (!node || node.type === 'group') return undefined;\n  if (matchesPeers(node, input)) return node;\n  for (const child of node.children) {\n    const found = peerBranch(child, input);\n    if (found) return found;\n  }\n  return undefined;\n}\n\nfunction replaceCarriers(node: WorkspaceNode, replacements: Map<WorkspaceNode, WorkspaceNode>): WorkspaceNode {\n  const payload = replacements.get(node);\n  if (payload) return payload;\n  if (node.type === 'group') return node;\n  return { ...node, children: node.children.map(child => replaceCarriers(child, replacements)) };\n}\n\nfunction placement(\n  layout: WorkspaceLayout | undefined,\n  destination: WorkspaceDestination\n): WorkspacePlacementPlan | undefined {\n  return layout ? { kind: destination.position === 'tab' ? 'tab' : 'split', layout } : undefined;\n}\n\nfunction wholeGroup(panels: string[], source: string[]) {\n  return panels.length === source.length && panels.every((id, index) => id === source[index]);\n}\n\nfunction projectedTarget(root: WorkspaceNode | null, destination: WorkspaceDestination) {\n  return destination.region ? findWorkspaceRegion(root, destination.region) : findGroup(root, destination.target);\n}\n\nfunction reorderedEntries(input: {\n  branch: WorkspaceSplit;\n  sourceId: string;\n  targetNode: WorkspaceNode;\n  destination: WorkspaceDestination;\n}) {\n  const { branch, sourceId, targetNode, destination } = input;\n  const from = branch.children.findIndex(child => child.type === 'group' && child.panels.includes(sourceId));\n  const entries = branch.children.map((child, index) => ({ child, weight: branch.weights[index]! }));\n  const moving = entries.splice(from, 1)[0]!;\n  const after = destination.position === 'right' || destination.position === 'bottom';\n  const target = entries.findIndex(entry => sameProjectionShape(entry.child, targetNode));\n  let index: number;\n  if (targetNode === branch) {\n    index = after ? entries.length : 0;\n  } else {\n    if (target < 0) return branch.children.map((child, childIndex) => ({ child, weight: branch.weights[childIndex]! }));\n    const offset = after ? 1 : 0;\n    index = target + offset;\n  }\n  entries.splice(index, 0, moving);\n  return entries;\n}\n\nfunction matchesPeers(\n  node: WorkspaceSplit,\n  input: { source?: string; target: WorkspaceNode; axis: WorkspaceSplit['axis'] }\n) {\n  return (\n    node.axis === input.axis &&\n    node.children.length > 1 &&\n    node.children.some(child => child.type === 'group' && child.panels.includes(input.source ?? '')) &&\n    (sameProjectionShape(node, input.target) || node.children.some(child => sameProjectionShape(child, input.target)))\n  );\n}\n\nfunction localCandidate(input: PlacementInput): WorkspacePlacementPlan | undefined {\n  const { layout, source, destination } = input;\n  const candidate = placePanels({ layout, source, destination });\n  return candidate ? placement(candidate, destination) : undefined;\n}\n\nfunction localPlacement(input: PlacementInput): WorkspacePlacementPlan | undefined {\n  const plan = localCandidate(input);\n  if (!plan) return plan;\n  const recipient = findGroup(\n    (input.projectLayout ?? projectLayout)(input.layout, input.available).root,\n    input.destination.target\n  );\n  return { ...plan, scope: createPlacementScope('recipient', recipient ?? null, input.source) };\n}\n\nfunction peerPlacement(layout: WorkspaceLayout, input: PlacementInput, branch: WorkspaceSplit): WorkspacePlacementPlan {\n  return {\n    kind: 'reorder',\n    layout,\n    scope: createPlacementScope('rail', branch, input.source)\n  };\n}\n"],"mappings":";;;;;;;;AAsDA,SAAgBA,IAA6D;CAC3E,IAAIC;CACJ,QAAO,MAAS;EACd,AAAKA,KAAYC,EAAoBD,GAASE,CAAK,MACjD,IAAU;GAAE,QAAQA,EAAM;GAAQ,QAAQ,CAAC,GAAGA,EAAM,MAAM;GAAG,WAAW,CAAC,GAAGA,EAAM,SAAS;GAAG,SAAS,CAAC;EAAE;EAE5G,IAAIC,IAAQH,EAAQ,QAAQ,MAC1B,MAAaI,EAAU,cAAcF,EAAM,aAAaG,EAAgBD,EAAU,aAAaF,EAAM,WAAW,CAClH;EACA,IAAI,CAACC,GAAO;GACV,IAAM,EAAE,WAAQ,aAAU,WAAQ,aAAUD,EAAM;GAMlD,AALA,IAAQ;IACN,WAAWA,EAAM;IACjB,aAAa;KAAE;KAAQ;KAAU;KAAQ;IAAM;IAC/C,MAAMI,EAAkBJ,CAAK;GAC/B,GACAF,EAAQ,QAAQ,KAAKG,CAAK;EAC5B;EACA,OAAOA,EAAM;CACf;AACF;AAYA,SAAgBI,EACd,GACA,GACA,GACoC;CACpC,IAAML,IAAQ;EACZ,QAAQM,EAAQ;EAChB,QAAQA,EAAQ;EAChB;EACA,WAAWA,EAAQ;EACnB,eAAeA,EAAQ;EACvB;CACF;CAEA,OADIA,EAAQ,gBAAsBA,EAAQ,cAAcN,CAAK,IACtDM,EAAQ,mBAAmBA,EAAQ,iBAAiB,KAAKN,CAAK,IAAIO,EAAuBP,CAAK;AACvG;AAEA,SAAgBO,EAAuB,GAA2D;CAChG,OAAOH,EAAkBJ,CAAK;AAChC;AAEA,SAASD,EAAoB,GAA0B,GAAuB;CAC5E,OACED,EAAQ,WAAWE,EAAM,UACzBQ,EAAeV,EAAQ,QAAQE,EAAM,MAAM,KAC3CQ,EAAeV,EAAQ,WAAWE,EAAM,SAAS;AAErD;AAEA,SAASI,EAAkB,GAAuB;CAChD,IAAKK,EAAsBT,EAAM,YAAY,KAAK,GAClD,OAAOU,EAAkBV,CAAK;AAChC;AAEA,SAASU,EAAkB,GAAuB;CAChD,IAAIV,EAAM,cAAc,OAAO,OAAOA,EAAM,YAAY,aAAa,QAAQW,EAAeX,CAAK,IAAI,KAAA;CACrG,IAAIA,EAAM,YAAY,aAAa,OAGnC,OAFIA,EAAM,cAAc,UAAgBY,EAAaZ,CAAK,IACtDA,EAAM,cAAc,WAAiBY,EAAaZ,CAAK,KAAKa,EAAmBb,CAAK,IACjFA,EAAM,YAAY,SAASc,EAAYd,CAAK,IAAIW,EAAeX,CAAK;AAC7E;AAEA,SAASe,EAAY,GAAuB;CAC1C,IAAM,EAAE,WAAQ,WAAQ,mBAAgBf,GAClCgB,IAAQC,EAAUC,EAAO,MAAMC,EAAO,EAAE;CAE9C,IADI,CAACH,KAAS,CAACI,EAAWJ,EAAM,QAAQG,CAAM,KAC1CE,EAAY,aAAa,OAAO;CACpC,IAAMC,IAAOD,EAAY,aAAa,UAAUA,EAAY,aAAa,UAAU,eAAe,YAC5FE,IAAUvB,EAAM,UAAU,QAAO,MAAM,CAACkB,EAAO,OAAO,SAASM,CAAE,CAAC,GAClEC,IAAWN,EAAO,MAAK,MAAMI,EAAQ,SAASC,CAAE,CAAC;CACvD,IAAI,CAACC,GAAU;CACf,IAAMC,KAAiB1B,EAAM,iBAAiB2B,EAAA,CAAeT,GAAQK,CAAO,CAAC,CAAC,MACxEK,IAASC,EAAgBH,GAAeL,CAAW;CACzD,IAAI,CAACO,GAAQ;CACb,IAAME,IAASC,EAAWL,GAAe;EAAE,QAAQD;EAAU;EAAQ;CAAK,CAAC;CAC3E,OAAOK,IAAS;EAAE;EAAQ;EAAS;EAAU;CAAO,IAAI,KAAA;AAC1D;AAEA,SAASlB,EAAa,GAA2D;CAC/E,IAAMN,IAAUS,EAAYf,CAAK;CACjC,IAAI,CAACM,GAAS;CACd,IAAM,EAAE,WAAQ,YAAS,aAAU,QAAQ0B,MAAe1B,GACpD,EAAE,WAAQ,mBAAgBN;CAChC,IAAI,CAACqB,EAAY,UAAUrB,EAAM,OAAO,SAASqB,EAAY,MAAM,GAAG,OAAOY,EAAcf,GAAQlB,GAAO8B,CAAM;CAChH,IAAMI,IAAUC,EAAiB;EAAE;EAAQ;EAAU;EAAY;CAAY,CAAC;CAC9E,IAAID,EAAQ,OAAO,GAAO,MAAUjC,EAAM,UAAU6B,EAAO,SAASM,EAAM,GACxE,OAAOH,EAAcf,GAAQlB,GAAO8B,CAAM;CAC5C,IAAM5B,IAAYmC,EAAgB;EAChC;EACA,UAAUP,EAAO;EACjB,WAAWI,EAAQ,KAAI,MAASjC,EAAM,KAAK;EAC3C;EACA,eAAeD,EAAM;CACvB,CAAC;CACD,IAAI,CAACE,GAAW;CAChB,IAAMoC,IAAY;EAAE,GAAGR;EAAQ,UAAUI,EAAQ,KAAI,MAASjC,EAAM,KAAK;CAAE;CAC3E,OAAOgC,EACLM,EACErC,GACAoC,GACAJ,EAAQ,KAAI,MAASjC,EAAM,MAAM,GACjCD,EAAM,SACR,KAAKE,GACLF,GACA8B,CACF;AACF;AAEA,SAASO,EAAgB,GAMO;CAC9B,IAAM,EAAE,WAAQ,aAAU,cAAW,eAAYrC,GAC3CwC,oBAAc,IAAI,IAAyC,GAC3DC,KAAW,OACVD,EAAY,IAAIE,CAAI,KACvBF,EAAY,IACVE,IACC1C,EAAM,iBAAiB2B,EAAA,CAAe;EAAE,SAAS;EAAG,MAAMe;EAAM,QAAQ,CAAC;CAAE,GAAGnB,CAAO,CAAC,CAAC,IAC1F,GAEKiB,EAAY,IAAIE,CAAI,KAAK,OAE5BC,IAAWC,EAAS,KAAI,MAASC,EAA6B3B,EAAO,MAAM4B,GAAOL,CAAO,CAAC;CAChG,IAAIE,EAAS,MAAK,MAAW,CAACI,CAAO,GAAG;CACxC,IAAMC,oBAAe,IAAI,IAAkC;CAC3D,EAAS,SAAS,GAAS,MAAUA,EAAa,IAAID,GAAUJ,EAASC,EAAS,QAAQN,EAAUF,EAAO,EAAG,CAAC;CAC/G,IAAMa,IAAOC,EAAgBC,EAAgBjC,EAAO,MAAO8B,CAAY,CAAC;CACxE,OAAOC,IAAO;EAAE,GAAG/B;EAAQ;CAAK,IAAI,KAAA;AACtC;AAEA,SAASa,EACP,GACA,GAC4B;CAC5B,IAAKW,KAAQA,EAAK,SAAS,SAC3B;MAAIU,EAAaV,GAAM1C,CAAK,GAAG,OAAO0C;EACtC,KAAK,IAAMI,KAASJ,EAAK,UAAU;GACjC,IAAMW,IAAQtB,EAAWe,GAAO9C,CAAK;GACrC,IAAIqD,GAAO,OAAOA;EACpB;CAJsC;AAMxC;AAEA,SAASF,EAAgB,GAAqB,GAAgE;CAI5G,OAHgBH,EAAa,IAAIN,CAC7B,MACAA,EAAK,SAAS,UAAgBA,IAC3B;EAAE,GAAGA;EAAM,UAAUA,EAAK,SAAS,KAAI,MAASS,EAAgBL,GAAOE,CAAY,CAAC;CAAE;AAC/F;AAEA,SAASM,EACP,GACA,GACoC;CACpC,OAAOpC,IAAS;EAAE,MAAMG,EAAY,aAAa,QAAQ,QAAQ;EAAS;CAAO,IAAI,KAAA;AACvF;AAEA,SAASD,EAAW,GAAkB,GAAkB;CACtD,OAAOmC,EAAO,WAAWpC,EAAO,UAAUoC,EAAO,OAAO,GAAI,MAAU/B,MAAOL,EAAOiB,EAAM;AAC5F;AAEA,SAASP,EAAgB,GAA4B,GAAmC;CACtF,OAAOR,EAAY,SAASmC,EAAoBP,GAAM5B,EAAY,MAAM,IAAIJ,EAAUgC,GAAM5B,EAAY,MAAM;AAChH;AAEA,SAASc,EAAiB,GAKvB;CACD,IAAM,EAAE,WAAQ,aAAU,eAAY,mBAAgBnC,GAChDyD,IAAO3B,EAAO,SAAS,WAAU,MAASgB,EAAM,SAAS,WAAWA,EAAM,OAAO,SAASrB,CAAQ,CAAC,GACnGS,IAAUJ,EAAO,SAAS,KAAK,GAAO,OAAW;EAAE;EAAO,QAAQA,EAAO,QAAQM;CAAQ,EAAE,GAC3FsB,IAASxB,EAAQ,OAAOuB,GAAM,CAAC,CAAC,CAAC,IACjCE,IAAQtC,EAAY,aAAa,WAAWA,EAAY,aAAa,UACrEO,IAASM,EAAQ,WAAU,MAAS0B,EAAoB3D,EAAM,OAAO+B,CAAU,CAAC,GAClFI;CACJ,IAAIJ,MAAeF,GACjB,IAAQ6B,IAAQzB,EAAQ,SAAS;MAC5B;EACL,IAAIN,IAAS,GAAG,OAAOE,EAAO,SAAS,KAAK,GAAO,OAAgB;GAAE;GAAO,QAAQA,EAAO,QAAQ+B;EAAa,EAAE;EAElH,IAAQjC,IADO;CAEjB;CAEA,OADAM,EAAQ,OAAOE,GAAO,GAAGsB,CAAM,GACxBxB;AACT;AAEA,SAASkB,EACP,GACA,GACA;CACA,OACEV,EAAK,SAAS1C,EAAM,QACpB0C,EAAK,SAAS,SAAS,KACvBA,EAAK,SAAS,MAAK,MAASI,EAAM,SAAS,WAAWA,EAAM,OAAO,SAAS9C,EAAM,UAAU,EAAE,CAAC,MAC9F4D,EAAoBlB,GAAM1C,EAAM,MAAM,KAAK0C,EAAK,SAAS,MAAK,MAASkB,EAAoBd,GAAO9C,EAAM,MAAM,CAAC;AAEpH;AAEA,SAAS8D,EAAe,GAA2D;CACjF,IAAM,EAAE,WAAQ,WAAQ,mBAAgB9D,GAClCE,IAAY6D,EAAY;EAAE;EAAQ;EAAQ;CAAY,CAAC;CAC7D,OAAO7D,IAAYoD,EAAUpD,GAAWmB,CAAW,IAAI,KAAA;AACzD;AAEA,SAASV,EAAe,GAA2D;CACjF,IAAMqD,IAAOF,EAAe9D,CAAK;CACjC,IAAI,CAACgE,GAAM,OAAOA;CAClB,IAAMC,IAAYhD,GACfjB,EAAM,iBAAiB2B,EAAA,CAAe3B,EAAM,QAAQA,EAAM,SAAS,CAAC,CAAC,MACtEA,EAAM,YAAY,MACpB;CACA,OAAO;EAAE,GAAGgE;EAAM,OAAOE,EAAqB,aAAaD,KAAa,MAAMjE,EAAM,MAAM;CAAE;AAC9F;AAEA,SAASiC,EAAc,GAAyB,GAAuB,GAAgD;CACrH,OAAO;EACL,MAAM;EACN;EACA,OAAOiC,EAAqB,QAAQpC,GAAQ9B,EAAM,MAAM;CAC1D;AACF"}

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

@@ -3,6 +3,7 @@ import type { WorkspacePlacementIntent } from '../interaction/command.utils.js';
 import type { WorkspaceDragOffer, WorkspaceOfferContext } from '../interaction/drag-preview.utils.js';
 import type { WorkspaceLayout } from '../model/layout.utils.js';
 import type { WorkspacePlacementPlanner } from './planner.utils.js';
+import type { WorkspacePlacementSession } from './session.utils.js';
 import type { WorkspaceMeasurements } from '../presentation/measurements.utils.js';
 import type { WorkspaceEvaluation } from '../evaluation.utils.js';
 interface PreparationInput {
@@ -14,8 +15,9 @@ interface CandidateInput extends PreparationInput {
     source: string[];
     intent: WorkspacePlacementIntent;
     planner?: WorkspacePlacementPlanner;
+    placementSession?: WorkspacePlacementSession;
 }
-interface OfferInput extends CandidateInput {
+export interface WorkspacePlacementOfferInputs extends CandidateInput {
     context?: WorkspaceOfferContext;
     groupable: boolean;
     currentRegions(): WorkspacePlacedRegion[];
@@ -24,5 +26,6 @@ export declare function getAdmissiblePlacementLayout(input: CandidateInput & {
     groupable: boolean;
     candidate?: WorkspaceLayout;
 }): WorkspaceLayout | undefined;
-export declare function evaluatePlacementOffer(input: OfferInput): WorkspaceDragOffer | undefined;
+export declare function evaluatePlacementOffer(input: WorkspacePlacementOfferInputs): WorkspaceDragOffer | undefined;
+export declare function computePlacementOffer(input: WorkspacePlacementOfferInputs): WorkspaceDragOffer | undefined;
 export {};

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

@@ -1,37 +1,40 @@
-import { sameSerializedWorkspaceLayout as e } from "../model/value.utils.js";
-import { getTabCue as t } from "../presentation/groups.utils.js";
-import { planWorkspacePlacement as n } from "./planner.utils.js";
-import { preservesGroupMembership as r } from "../model/membership.utils.js";
+import { sameWorkspaceLayout as e } from "../model/value.utils.js";
+import { preservesGroupMembership as t } from "../model/membership.utils.js";
+import { getTabCue as n } from "../presentation/groups.utils.js";
+import { planWorkspacePlacement as r } from "./planner.utils.js";
 import { admitsWorkspaceMove as i } from "../geometry/sizing.utils.js";
 import { resolveSelectedPlacementPlan as a } from "./acquisition-sizing.utils.js";
 import { sizePreferredSplit as o } from "./split-sizing.utils.js";
 import { getOfferAllocation as s, getOfferPresentation as c } from "../presentation/offers.utils.js";
 // src/workspace/utils/placement/preparation.utils.ts
-function l(t) {
-	let { evaluation: n, layout: i, source: a, intent: o, groupable: s } = t;
-	if (!s && !r({
+function l(n) {
+	let { evaluation: r, layout: i, source: a, intent: o, groupable: s } = n;
+	if (!s && !t({
 		root: i.root,
 		source: a,
 		intent: o
 	})) return;
-	let c = t.candidate ?? u(t)?.layout;
-	if (c && !e(c, i) && d({
-		...t,
-		candidate: n.project(c)
+	let c = n.candidate ?? d(n)?.layout;
+	if (c && !e(c, i) && f({
+		...n,
+		candidate: r.project(c)
 	})) return c;
 }
 function u(e) {
-	let { evaluation: t, layout: r, source: i, intent: a, planner: o = n } = e, s = o({
-		layout: r,
+	return e.placementSession && !e.planner ? e.placementSession.prepareOffer(e) : p(e);
+}
+function d(e) {
+	let { evaluation: t, layout: n, source: i, intent: a, planner: o = r } = e, s = {
+		layout: n,
 		source: i,
 		destination: a.destination,
 		operation: a.kind,
 		available: t.available,
 		projectLayout: t.projectLayout
-	});
-	return s ? p(e, s) : void 0;
+	}, c = e.placementSession && !e.planner ? e.placementSession.plan(s) : o(s);
+	return c ? m(e, c) : void 0;
 }
-function d(e) {
+function f(e) {
 	return i({
 		current: e.evaluation.project(e.layout).root,
 		candidate: e.candidate.root,
@@ -42,10 +45,10 @@ function d(e) {
 		requirements: e.evaluation.requirements
 	});
 }
-function f(e) {
-	let { evaluation: t, source: n, intent: r, context: i } = e, o = i?.acquisition, s = o ? p(e, o.plan) : u(e);
+function p(e) {
+	let { evaluation: t, source: n, intent: r, context: i } = e, o = i?.acquisition, s = o ? m(e, o.plan) : d(e);
 	if (!s) return;
-	let { width: c, height: l } = t.geometry(t.project(s.layout)), d = a({
+	let { width: c, height: l } = t.geometry(t.project(s.layout)), u = a({
 		plan: s,
 		source: n,
 		available: t.available,
@@ -65,11 +68,12 @@ function f(e) {
 			width: 0,
 			height: 0
 		}),
-		requirements: t.requirements
+		requirements: t.requirements,
+		placementSession: e.planner ? void 0 : e.placementSession
 	});
-	return m(e, d ?? s, !!d);
+	return h(e, u ?? s, !!u);
 }
-function p(e, t) {
+function m(e, t) {
 	if (t.kind !== "split") return t;
 	let { evaluation: n, source: r } = e;
 	return o({
@@ -80,17 +84,17 @@ function p(e, t) {
 		preference: {
 			allocation: n.detached(r).regions,
 			requirements: n.requirements,
-			contextRect: n.contextRect
+			resolveScopeRect: n.resolveScopeRect
 		}
 	});
 }
-function m(e, n, i) {
-	let { evaluation: a, layout: o, measurements: l, source: u, intent: f } = e, p = a.project(n.layout), m = a.geometry(p), g = m.groups.find((e) => e.panels.some((e) => u.includes(e.id)));
-	if (!g) return;
-	let _ = a.client(g.rect), { cue: v, bounds: y } = f.kind === "tab" ? t({
-		group: g,
+function h(e, r, i) {
+	let { evaluation: a, layout: o, measurements: l, source: u, intent: d } = e, p = a.project(r.layout), m = a.geometry(p), h = m.groups.find((e) => e.panels.some((e) => u.includes(e.id)));
+	if (!h) return;
+	let _ = a.client(h.rect), { cue: v, bounds: y } = d.kind === "tab" ? n({
+		group: h,
 		source: u,
-		intent: f,
+		intent: d,
 		root: o.root,
 		spatial: () => a.detached(u).groups,
 		measurements: l,
@@ -100,41 +104,41 @@ function m(e, n, i) {
 	}) : {
 		cue: _,
 		bounds: a.bounds()
-	}, b = i && d({
+	}, b = i && f({
 		...e,
 		candidate: p
-	}) && (e.groupable || r({
+	}) && (e.groupable || t({
 		root: o.root,
 		source: u,
-		intent: f
+		intent: d
 	})), x = c({
-		plan: n,
+		plan: r,
 		regions: m.regions,
-		sourceKey: g.key,
+		sourceKey: h.key,
 		sourceRect: _,
 		cue: v,
 		bounds: y,
-		destination: f.destination,
+		destination: d.destination,
 		feasible: b,
-		split: f.kind === "split" ? {
+		split: d.kind === "split" ? {
 			...a.detached(u),
 			source: u
 		} : void 0,
 		client: (e) => a.client(e)
 	});
-	if (h(f, x.cue)) return {
+	if (g(d, x.cue)) return {
 		...x,
 		cue: {
-			kind: f.kind === "tab" ? "tab" : "group",
+			kind: d.kind === "tab" ? "tab" : "group",
 			rect: x.cue
 		},
 		feasible: b,
-		...s(n, b)
+		...s(r, b)
 	};
 }
-function h(e, t) {
+function g(e, t) {
 	return e.kind === "tab" || t.width !== 0 && t.height !== 0;
 }
-export { f as evaluatePlacementOffer, l as getAdmissiblePlacementLayout };
+export { p as computePlacementOffer, u as evaluatePlacementOffer, l as getAdmissiblePlacementLayout };
 
 //# sourceMappingURL=preparation.utils.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"preparation.utils.js","names":["getAdmissiblePlacementLayout","input","groupable","preservesGroupMembership","layout","candidate","placementCandidate","placementFits","evaluation","planWorkspacePlacement","plan","planner","intent","preferredPlacement","admitsWorkspaceMove","evaluatePlacementOffer","acquisition","context","fit","resolveSelectedPlacementPlan","placementOffer","sizePreferredSplit","source","geometry","group","item","panel","rect","getTabCue","target","feasible","fitted","presentation","getOfferPresentation","hasVisiblePlacementCue","getOfferAllocation","cue"],"sources":["../../../../src/workspace/utils/placement/preparation.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 { admitsWorkspaceMove } from '../geometry/sizing.utils.js';\nimport { preservesGroupMembership } from '../model/membership.utils.js';\nimport { sameSerializedWorkspaceLayout } from '../model/value.utils.js';\nimport { resolveSelectedPlacementPlan } from './acquisition-sizing.utils.js';\nimport { planWorkspacePlacement } from './planner.utils.js';\nimport { sizePreferredSplit } from './split-sizing.utils.js';\nimport { getTabCue } from '../presentation/groups.utils.js';\nimport { getOfferAllocation, getOfferPresentation } from '../presentation/offers.utils.js';\n\nimport type { WorkspacePlacedRegion } from '../geometry/allocation.utils.js';\nimport type { WorkspacePlacementIntent } from '../interaction/command.utils.js';\nimport type { WorkspaceDragOffer, WorkspaceOfferContext } from '../interaction/drag-preview.utils.js';\nimport type { WorkspaceLayout } from '../model/layout.utils.js';\nimport type { WorkspacePlacementPlan, WorkspacePlacementPlanner } from './planner.utils.js';\nimport type { WorkspaceMeasurements } from '../presentation/measurements.utils.js';\nimport type { WorkspaceEvaluation } from '../evaluation.utils.js';\n\ninterface PreparationInput {\n  evaluation: WorkspaceEvaluation;\n  layout: WorkspaceLayout;\n  measurements: WorkspaceMeasurements;\n}\n\ninterface CandidateInput extends PreparationInput {\n  source: string[];\n  intent: WorkspacePlacementIntent;\n  planner?: WorkspacePlacementPlanner;\n}\n\ninterface OfferInput extends CandidateInput {\n  context?: WorkspaceOfferContext;\n  groupable: boolean;\n  currentRegions(): WorkspacePlacedRegion[];\n}\n\nexport function getAdmissiblePlacementLayout(\n  input: CandidateInput & { groupable: boolean; candidate?: WorkspaceLayout }\n): WorkspaceLayout | undefined {\n  const { evaluation, layout, source, intent, groupable } = input;\n  if (!groupable && !preservesGroupMembership({ root: layout.root, source, intent })) {\n    return undefined;\n  }\n  const candidate = input.candidate ?? placementCandidate(input)?.layout;\n  if (!candidate || sameSerializedWorkspaceLayout(candidate, layout)) {\n    return undefined;\n  }\n  if (!placementFits({ ...input, candidate: evaluation.project(candidate) })) {\n    return undefined;\n  }\n  return candidate;\n}\n\nfunction placementCandidate(input: CandidateInput): WorkspacePlacementPlan | undefined {\n  const { evaluation, layout, source, intent, planner = planWorkspacePlacement } = input;\n  const plan = planner({\n    layout,\n    source,\n    destination: intent.destination,\n    operation: intent.kind,\n    available: evaluation.available,\n    projectLayout: evaluation.projectLayout\n  });\n  return plan ? preferredPlacement(input, plan) : undefined;\n}\n\nfunction placementFits(input: PreparationInput & { candidate: WorkspaceLayout }): boolean {\n  return admitsWorkspaceMove({\n    current: input.evaluation.project(input.layout).root,\n    candidate: input.candidate.root,\n    viewport: { width: input.measurements.width, height: input.measurements.height },\n    requirements: input.evaluation.requirements\n  });\n}\n\n// Keep discovery structural; fit the acquired candidate before admission and preview.\nexport function evaluatePlacementOffer(input: OfferInput): WorkspaceDragOffer | undefined {\n  const { evaluation, source, intent, context } = input;\n  const acquisition = context?.acquisition;\n  const plan = acquisition ? preferredPlacement(input, acquisition.plan) : placementCandidate(input);\n  if (!plan) return undefined;\n  const { width, height } = evaluation.geometry(evaluation.project(plan.layout));\n  const fit = resolveSelectedPlacementPlan({\n    plan,\n    source,\n    available: evaluation.available,\n    previous: context?.selected,\n    intent,\n    acquisition,\n    current: input.currentRegions(),\n    rect: { x: 0, y: 0, width, height },\n    clientOrigin: evaluation.client({ x: 0, y: 0, width: 0, height: 0 }),\n    requirements: evaluation.requirements\n  });\n  return placementOffer(input, fit ?? plan, !!fit);\n}\n\nfunction preferredPlacement(input: CandidateInput, plan: WorkspacePlacementPlan): WorkspacePlacementPlan {\n  if (plan.kind !== 'split') return plan;\n  const { evaluation, source } = input;\n  return sizePreferredSplit({\n    plan,\n    source,\n    available: evaluation.available,\n    projectLayout: evaluation.projectLayout,\n    preference: {\n      allocation: evaluation.detached(source).regions,\n      requirements: evaluation.requirements,\n      contextRect: evaluation.contextRect\n    }\n  });\n}\n\nfunction placementOffer(\n  input: OfferInput,\n  plan: WorkspacePlacementPlan,\n  fitted: boolean\n): WorkspaceDragOffer | undefined {\n  const { evaluation, layout, measurements, source, intent } = input;\n  const candidate = evaluation.project(plan.layout);\n  const geometry = evaluation.geometry(candidate);\n  const group = geometry.groups.find(item => item.panels.some(panel => source.includes(panel.id)));\n  if (!group) return undefined;\n  const rect = evaluation.client(group.rect);\n  const { cue, bounds } =\n    intent.kind === 'tab'\n      ? getTabCue({\n          group,\n          source,\n          intent,\n          root: layout.root,\n          spatial: () => evaluation.detached(source).groups,\n          measurements,\n          viewport: evaluation.bounds(),\n          client: target => evaluation.client(target),\n          scroll: target => evaluation.scroll(target)\n        })\n      : { cue: rect, bounds: evaluation.bounds() };\n  const feasible =\n    fitted &&\n    placementFits({ ...input, candidate }) &&\n    (input.groupable || preservesGroupMembership({ root: layout.root, source, intent }));\n  const presentation = getOfferPresentation({\n    plan,\n    regions: geometry.regions,\n    sourceKey: group.key,\n    sourceRect: rect,\n    cue,\n    bounds,\n    destination: intent.destination,\n    feasible,\n    split: intent.kind === 'split' ? { ...evaluation.detached(source), source } : undefined,\n    client: target => evaluation.client(target)\n  });\n  if (!hasVisiblePlacementCue(intent, presentation.cue)) return undefined;\n  return {\n    ...presentation,\n    cue: { kind: intent.kind === 'tab' ? 'tab' : 'group', rect: presentation.cue },\n    feasible,\n    ...getOfferAllocation(plan, feasible)\n  };\n}\n\nfunction hasVisiblePlacementCue(intent: WorkspacePlacementIntent, cue: Rect): boolean {\n  return intent.kind === 'tab' || (cue.width !== 0 && cue.height !== 0);\n}\n"],"mappings":";;;;;;;;;AAwCA,SAAgBA,EACd,GAC6B;CAC7B,IAAM,EAAE,eAAY,WAAQ,WAAQ,WAAQ,iBAAcC;CAC1D,IAAI,CAACC,KAAa,CAACC,EAAyB;EAAE,MAAMC,EAAO;EAAM;EAAQ;CAAO,CAAC,GAC/E;CAEF,IAAMC,IAAYJ,EAAM,aAAaK,EAAmBL,CAAK,CAAC,EAAE;CAChE,IAAKI,KAAa,GAA8BA,GAAWD,CAAM,KAG5DG,EAAc;EAAE,GAAGN;EAAO,WAAWO,EAAW,QAAQH,CAAS;CAAE,CAAC,GAGzE,OAAOA;AACT;AAEA,SAASC,EAAmB,GAA2D;CACrF,IAAM,EAAE,eAAY,WAAQ,WAAQ,WAAQ,aAAUG,MAA2BR,GAC3ES,IAAOC,EAAQ;EACnB;EACA;EACA,aAAaC,EAAO;EACpB,WAAWA,EAAO;EAClB,WAAWJ,EAAW;EACtB,eAAeA,EAAW;CAC5B,CAAC;CACD,OAAOE,IAAOG,EAAmBZ,GAAOS,CAAI,IAAI,KAAA;AAClD;AAEA,SAASH,EAAc,GAAmE;CACxF,OAAOO,EAAoB;EACzB,SAASb,EAAM,WAAW,QAAQA,EAAM,MAAM,CAAC,CAAC;EAChD,WAAWA,EAAM,UAAU;EAC3B,UAAU;GAAE,OAAOA,EAAM,aAAa;GAAO,QAAQA,EAAM,aAAa;EAAO;EAC/E,cAAcA,EAAM,WAAW;CACjC,CAAC;AACH;AAGA,SAAgBc,EAAuB,GAAmD;CACxF,IAAM,EAAE,eAAY,WAAQ,WAAQ,eAAYd,GAC1Ce,IAAcC,GAAS,aACvBP,IAAOM,IAAcH,EAAmBZ,GAAOe,EAAY,IAAI,IAAIV,EAAmBL,CAAK;CACjG,IAAI,CAACS,GAAM;CACX,IAAM,EAAE,UAAO,cAAWF,EAAW,SAASA,EAAW,QAAQE,EAAK,MAAM,CAAC,GACvEQ,IAAMC,EAA6B;EACvC;EACA;EACA,WAAWX,EAAW;EACtB,UAAUS,GAAS;EACnB;EACA;EACA,SAAShB,EAAM,eAAe;EAC9B,MAAM;GAAE,GAAG;GAAG,GAAG;GAAG;GAAO;EAAO;EAClC,cAAcO,EAAW,OAAO;GAAE,GAAG;GAAG,GAAG;GAAG,OAAO;GAAG,QAAQ;EAAE,CAAC;EACnE,cAAcA,EAAW;CAC3B,CAAC;CACD,OAAOY,EAAenB,GAAOiB,KAAOR,GAAM,CAAC,CAACQ,CAAG;AACjD;AAEA,SAASL,EAAmB,GAAuB,GAAsD;CACvG,IAAIH,EAAK,SAAS,SAAS,OAAOA;CAClC,IAAM,EAAE,eAAY,cAAWT;CAC/B,OAAOoB,EAAmB;EACxB;EACA;EACA,WAAWb,EAAW;EACtB,eAAeA,EAAW;EAC1B,YAAY;GACV,YAAYA,EAAW,SAASc,CAAM,CAAC,CAAC;GACxC,cAAcd,EAAW;GACzB,aAAaA,EAAW;EAC1B;CACF,CAAC;AACH;AAEA,SAASY,EACP,GACA,GACA,GACgC;CAChC,IAAM,EAAE,eAAY,WAAQ,iBAAc,WAAQ,cAAWnB,GACvDI,IAAYG,EAAW,QAAQE,EAAK,MAAM,GAC1Ca,IAAWf,EAAW,SAASH,CAAS,GACxCmB,IAAQD,EAAS,OAAO,MAAK,MAAQE,EAAK,OAAO,MAAK,MAASH,EAAO,SAASI,EAAM,EAAE,CAAC,CAAC;CAC/F,IAAI,CAACF,GAAO;CACZ,IAAMG,IAAOnB,EAAW,OAAOgB,EAAM,IAAI,GACnC,EAAE,QAAK,cACXZ,EAAO,SAAS,QACZgB,EAAU;EACR;EACA;EACA;EACA,MAAMxB,EAAO;EACb,eAAeI,EAAW,SAASc,CAAM,CAAC,CAAC;EAC3C;EACA,UAAUd,EAAW,OAAO;EAC5B,SAAQ,MAAUA,EAAW,OAAOqB,CAAM;EAC1C,SAAQ,MAAUrB,EAAW,OAAOqB,CAAM;CAC5C,CAAC,IACD;EAAE,KAAKF;EAAM,QAAQnB,EAAW,OAAO;CAAE,GACzCsB,IACJC,KACAxB,EAAc;EAAE,GAAGN;EAAO;CAAU,CAAC,MACpCA,EAAM,aAAaE,EAAyB;EAAE,MAAMC,EAAO;EAAM;EAAQ;CAAO,CAAC,IAC9E4B,IAAeC,EAAqB;EACxC;EACA,SAASV,EAAS;EAClB,WAAWC,EAAM;EACjB,YAAYG;EACZ;EACA;EACA,aAAaf,EAAO;EACpB;EACA,OAAOA,EAAO,SAAS,UAAU;GAAE,GAAGJ,EAAW,SAASc,CAAM;GAAG;EAAO,IAAI,KAAA;EAC9E,SAAQ,MAAUd,EAAW,OAAOqB,CAAM;CAC5C,CAAC;CACD,IAAKK,EAAuBtB,GAAQoB,EAAa,GAAG,GACpD,OAAO;EACL,GAAGA;EACH,KAAK;GAAE,MAAMpB,EAAO,SAAS,QAAQ,QAAQ;GAAS,MAAMoB,EAAa;EAAI;EAC7E;EACA,GAAGG,EAAmBzB,GAAMoB,CAAQ;CACtC;AACF;AAEA,SAASI,EAAuB,GAAkC,GAAoB;CACpF,OAAOtB,EAAO,SAAS,SAAUwB,EAAI,UAAU,KAAKA,EAAI,WAAW;AACrE"}
+{"version":3,"file":"preparation.utils.js","names":["getAdmissiblePlacementLayout","input","groupable","preservesGroupMembership","layout","candidate","placementCandidate","placementFits","evaluation","evaluatePlacementOffer","computePlacementOffer","planWorkspacePlacement","planning","intent","plan","planner","preferredPlacement","admitsWorkspaceMove","acquisition","context","fit","resolveSelectedPlacementPlan","placementOffer","sizePreferredSplit","source","geometry","group","item","panel","rect","getTabCue","target","feasible","fitted","presentation","getOfferPresentation","hasVisiblePlacementCue","getOfferAllocation","cue"],"sources":["../../../../src/workspace/utils/placement/preparation.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 { admitsWorkspaceMove } from '../geometry/sizing.utils.js';\nimport { preservesGroupMembership } from '../model/membership.utils.js';\nimport { sameWorkspaceLayout } from '../model/value.utils.js';\nimport { resolveSelectedPlacementPlan } from './acquisition-sizing.utils.js';\nimport { planWorkspacePlacement } from './planner.utils.js';\nimport { sizePreferredSplit } from './split-sizing.utils.js';\nimport { getTabCue } from '../presentation/groups.utils.js';\nimport { getOfferAllocation, getOfferPresentation } from '../presentation/offers.utils.js';\n\nimport type { WorkspacePlacedRegion } from '../geometry/allocation.utils.js';\nimport type { WorkspacePlacementIntent } from '../interaction/command.utils.js';\nimport type { WorkspaceDragOffer, WorkspaceOfferContext } from '../interaction/drag-preview.utils.js';\nimport type { WorkspaceLayout } from '../model/layout.utils.js';\nimport type { WorkspacePlacementPlan, WorkspacePlacementPlanner } from './planner.utils.js';\nimport type { WorkspacePlacementSession } from './session.utils.js';\nimport type { WorkspaceMeasurements } from '../presentation/measurements.utils.js';\nimport type { WorkspaceEvaluation } from '../evaluation.utils.js';\n\ninterface PreparationInput {\n  evaluation: WorkspaceEvaluation;\n  layout: WorkspaceLayout;\n  measurements: WorkspaceMeasurements;\n}\n\ninterface CandidateInput extends PreparationInput {\n  source: string[];\n  intent: WorkspacePlacementIntent;\n  planner?: WorkspacePlacementPlanner;\n  placementSession?: WorkspacePlacementSession;\n}\n\nexport interface WorkspacePlacementOfferInputs extends CandidateInput {\n  context?: WorkspaceOfferContext;\n  groupable: boolean;\n  currentRegions(): WorkspacePlacedRegion[];\n}\n\nexport function getAdmissiblePlacementLayout(\n  input: CandidateInput & { groupable: boolean; candidate?: WorkspaceLayout }\n): WorkspaceLayout | undefined {\n  const { evaluation, layout, source, intent, groupable } = input;\n  if (!groupable && !preservesGroupMembership({ root: layout.root, source, intent })) {\n    return undefined;\n  }\n  const candidate = input.candidate ?? placementCandidate(input)?.layout;\n  if (!candidate || sameWorkspaceLayout(candidate, layout)) {\n    return undefined;\n  }\n  if (!placementFits({ ...input, candidate: evaluation.project(candidate) })) {\n    return undefined;\n  }\n  return candidate;\n}\n\nexport function evaluatePlacementOffer(input: WorkspacePlacementOfferInputs): WorkspaceDragOffer | undefined {\n  return input.placementSession && !input.planner\n    ? input.placementSession.prepareOffer(input)\n    : computePlacementOffer(input);\n}\n\nfunction placementCandidate(input: CandidateInput): WorkspacePlacementPlan | undefined {\n  const { evaluation, layout, source, intent, planner = planWorkspacePlacement } = input;\n  const planning = {\n    layout,\n    source,\n    destination: intent.destination,\n    operation: intent.kind,\n    available: evaluation.available,\n    projectLayout: evaluation.projectLayout\n  };\n  const plan = input.placementSession && !input.planner ? input.placementSession.plan(planning) : planner(planning);\n  return plan ? preferredPlacement(input, plan) : undefined;\n}\n\nfunction placementFits(input: PreparationInput & { candidate: WorkspaceLayout }): boolean {\n  return admitsWorkspaceMove({\n    current: input.evaluation.project(input.layout).root,\n    candidate: input.candidate.root,\n    viewport: { width: input.measurements.width, height: input.measurements.height },\n    requirements: input.evaluation.requirements\n  });\n}\n\n// Keep discovery structural; fit the acquired candidate before admission and preview.\nexport function computePlacementOffer(input: WorkspacePlacementOfferInputs): WorkspaceDragOffer | undefined {\n  const { evaluation, source, intent, context } = input;\n  const acquisition = context?.acquisition;\n  const plan = acquisition ? preferredPlacement(input, acquisition.plan) : placementCandidate(input);\n  if (!plan) return undefined;\n  const { width, height } = evaluation.geometry(evaluation.project(plan.layout));\n  const fit = resolveSelectedPlacementPlan({\n    plan,\n    source,\n    available: evaluation.available,\n    previous: context?.selected,\n    intent,\n    acquisition,\n    current: input.currentRegions(),\n    rect: { x: 0, y: 0, width, height },\n    clientOrigin: evaluation.client({ x: 0, y: 0, width: 0, height: 0 }),\n    requirements: evaluation.requirements,\n    placementSession: input.planner ? undefined : input.placementSession\n  });\n  return placementOffer(input, fit ?? plan, !!fit);\n}\n\nfunction preferredPlacement(input: CandidateInput, plan: WorkspacePlacementPlan): WorkspacePlacementPlan {\n  if (plan.kind !== 'split') return plan;\n  const { evaluation, source } = input;\n  return sizePreferredSplit({\n    plan,\n    source,\n    available: evaluation.available,\n    projectLayout: evaluation.projectLayout,\n    preference: {\n      allocation: evaluation.detached(source).regions,\n      requirements: evaluation.requirements,\n      resolveScopeRect: evaluation.resolveScopeRect\n    }\n  });\n}\n\nfunction placementOffer(\n  input: WorkspacePlacementOfferInputs,\n  plan: WorkspacePlacementPlan,\n  fitted: boolean\n): WorkspaceDragOffer | undefined {\n  const { evaluation, layout, measurements, source, intent } = input;\n  const candidate = evaluation.project(plan.layout);\n  const geometry = evaluation.geometry(candidate);\n  const group = geometry.groups.find(item => item.panels.some(panel => source.includes(panel.id)));\n  if (!group) return undefined;\n  const rect = evaluation.client(group.rect);\n  const { cue, bounds } =\n    intent.kind === 'tab'\n      ? getTabCue({\n          group,\n          source,\n          intent,\n          root: layout.root,\n          spatial: () => evaluation.detached(source).groups,\n          measurements,\n          viewport: evaluation.bounds(),\n          client: target => evaluation.client(target),\n          scroll: target => evaluation.scroll(target)\n        })\n      : { cue: rect, bounds: evaluation.bounds() };\n  const feasible =\n    fitted &&\n    placementFits({ ...input, candidate }) &&\n    (input.groupable || preservesGroupMembership({ root: layout.root, source, intent }));\n  const presentation = getOfferPresentation({\n    plan,\n    regions: geometry.regions,\n    sourceKey: group.key,\n    sourceRect: rect,\n    cue,\n    bounds,\n    destination: intent.destination,\n    feasible,\n    split: intent.kind === 'split' ? { ...evaluation.detached(source), source } : undefined,\n    client: target => evaluation.client(target)\n  });\n  if (!hasVisiblePlacementCue(intent, presentation.cue)) return undefined;\n  return {\n    ...presentation,\n    cue: { kind: intent.kind === 'tab' ? 'tab' : 'group', rect: presentation.cue },\n    feasible,\n    ...getOfferAllocation(plan, feasible)\n  };\n}\n\nfunction hasVisiblePlacementCue(intent: WorkspacePlacementIntent, cue: Rect): boolean {\n  return intent.kind === 'tab' || (cue.width !== 0 && cue.height !== 0);\n}\n"],"mappings":";;;;;;;;;AA0CA,SAAgBA,EACd,GAC6B;CAC7B,IAAM,EAAE,eAAY,WAAQ,WAAQ,WAAQ,iBAAcC;CAC1D,IAAI,CAACC,KAAa,CAACC,EAAyB;EAAE,MAAMC,EAAO;EAAM;EAAQ;CAAO,CAAC,GAC/E;CAEF,IAAMC,IAAYJ,EAAM,aAAaK,EAAmBL,CAAK,CAAC,EAAE;CAChE,IAAKI,KAAa,GAAoBA,GAAWD,CAAM,KAGlDG,EAAc;EAAE,GAAGN;EAAO,WAAWO,EAAW,QAAQH,CAAS;CAAE,CAAC,GAGzE,OAAOA;AACT;AAEA,SAAgBI,EAAuB,GAAsE;CAC3G,OAAOR,EAAM,oBAAoB,CAACA,EAAM,UACpCA,EAAM,iBAAiB,aAAaA,CAAK,IACzCS,EAAsBT,CAAK;AACjC;AAEA,SAASK,EAAmB,GAA2D;CACrF,IAAM,EAAE,eAAY,WAAQ,WAAQ,WAAQ,aAAUK,MAA2BV,GAC3EW,IAAW;EACf;EACA;EACA,aAAaC,EAAO;EACpB,WAAWA,EAAO;EAClB,WAAWL,EAAW;EACtB,eAAeA,EAAW;CAC5B,GACMM,IAAOb,EAAM,oBAAoB,CAACA,EAAM,UAAUA,EAAM,iBAAiB,KAAKW,CAAQ,IAAIG,EAAQH,CAAQ;CAChH,OAAOE,IAAOE,EAAmBf,GAAOa,CAAI,IAAI,KAAA;AAClD;AAEA,SAASP,EAAc,GAAmE;CACxF,OAAOU,EAAoB;EACzB,SAAShB,EAAM,WAAW,QAAQA,EAAM,MAAM,CAAC,CAAC;EAChD,WAAWA,EAAM,UAAU;EAC3B,UAAU;GAAE,OAAOA,EAAM,aAAa;GAAO,QAAQA,EAAM,aAAa;EAAO;EAC/E,cAAcA,EAAM,WAAW;CACjC,CAAC;AACH;AAGA,SAAgBS,EAAsB,GAAsE;CAC1G,IAAM,EAAE,eAAY,WAAQ,WAAQ,eAAYT,GAC1CiB,IAAcC,GAAS,aACvBL,IAAOI,IAAcF,EAAmBf,GAAOiB,EAAY,IAAI,IAAIZ,EAAmBL,CAAK;CACjG,IAAI,CAACa,GAAM;CACX,IAAM,EAAE,UAAO,cAAWN,EAAW,SAASA,EAAW,QAAQM,EAAK,MAAM,CAAC,GACvEM,IAAMC,EAA6B;EACvC;EACA;EACA,WAAWb,EAAW;EACtB,UAAUW,GAAS;EACnB;EACA;EACA,SAASlB,EAAM,eAAe;EAC9B,MAAM;GAAE,GAAG;GAAG,GAAG;GAAG;GAAO;EAAO;EAClC,cAAcO,EAAW,OAAO;GAAE,GAAG;GAAG,GAAG;GAAG,OAAO;GAAG,QAAQ;EAAE,CAAC;EACnE,cAAcA,EAAW;EACzB,kBAAkBP,EAAM,UAAU,KAAA,IAAYA,EAAM;CACtD,CAAC;CACD,OAAOqB,EAAerB,GAAOmB,KAAON,GAAM,CAAC,CAACM,CAAG;AACjD;AAEA,SAASJ,EAAmB,GAAuB,GAAsD;CACvG,IAAIF,EAAK,SAAS,SAAS,OAAOA;CAClC,IAAM,EAAE,eAAY,cAAWb;CAC/B,OAAOsB,EAAmB;EACxB;EACA;EACA,WAAWf,EAAW;EACtB,eAAeA,EAAW;EAC1B,YAAY;GACV,YAAYA,EAAW,SAASgB,CAAM,CAAC,CAAC;GACxC,cAAchB,EAAW;GACzB,kBAAkBA,EAAW;EAC/B;CACF,CAAC;AACH;AAEA,SAASc,EACP,GACA,GACA,GACgC;CAChC,IAAM,EAAE,eAAY,WAAQ,iBAAc,WAAQ,cAAWrB,GACvDI,IAAYG,EAAW,QAAQM,EAAK,MAAM,GAC1CW,IAAWjB,EAAW,SAASH,CAAS,GACxCqB,IAAQD,EAAS,OAAO,MAAK,MAAQE,EAAK,OAAO,MAAK,MAASH,EAAO,SAASI,EAAM,EAAE,CAAC,CAAC;CAC/F,IAAI,CAACF,GAAO;CACZ,IAAMG,IAAOrB,EAAW,OAAOkB,EAAM,IAAI,GACnC,EAAE,QAAK,cACXb,EAAO,SAAS,QACZiB,EAAU;EACR;EACA;EACA;EACA,MAAM1B,EAAO;EACb,eAAeI,EAAW,SAASgB,CAAM,CAAC,CAAC;EAC3C;EACA,UAAUhB,EAAW,OAAO;EAC5B,SAAQ,MAAUA,EAAW,OAAOuB,CAAM;EAC1C,SAAQ,MAAUvB,EAAW,OAAOuB,CAAM;CAC5C,CAAC,IACD;EAAE,KAAKF;EAAM,QAAQrB,EAAW,OAAO;CAAE,GACzCwB,IACJC,KACA1B,EAAc;EAAE,GAAGN;EAAO;CAAU,CAAC,MACpCA,EAAM,aAAaE,EAAyB;EAAE,MAAMC,EAAO;EAAM;EAAQ;CAAO,CAAC,IAC9E8B,IAAeC,EAAqB;EACxC;EACA,SAASV,EAAS;EAClB,WAAWC,EAAM;EACjB,YAAYG;EACZ;EACA;EACA,aAAahB,EAAO;EACpB;EACA,OAAOA,EAAO,SAAS,UAAU;GAAE,GAAGL,EAAW,SAASgB,CAAM;GAAG;EAAO,IAAI,KAAA;EAC9E,SAAQ,MAAUhB,EAAW,OAAOuB,CAAM;CAC5C,CAAC;CACD,IAAKK,EAAuBvB,GAAQqB,EAAa,GAAG,GACpD,OAAO;EACL,GAAGA;EACH,KAAK;GAAE,MAAMrB,EAAO,SAAS,QAAQ,QAAQ;GAAS,MAAMqB,EAAa;EAAI;EAC7E;EACA,GAAGG,EAAmBvB,GAAMkB,CAAQ;CACtC;AACF;AAEA,SAASI,EAAuB,GAAkC,GAAoB;CACpF,OAAOvB,EAAO,SAAS,SAAUyB,EAAI,UAAU,KAAKA,EAAI,WAAW;AACrE"}