@nvidia-elements/core 2.23.5 → 2.23.6

package/dist/workspace/utils/interaction/insertion-offers.utils.d.ts

@@ -1,17 +1,18 @@
 import type { Rect } from '@nvidia-elements/core/internal';
-import { describePlacementSlot } from '../placement/group-insertion.utils.js';
 import type { WorkspacePlacedRegion } from '../geometry/allocation.utils.js';
 import type { WorkspaceDropIntent } from './drag-preview.utils.js';
 import type { WorkspaceLayout, WorkspaceNode } from '../model/layout.utils.js';
 import type { WorkspaceDestination } from '../model/operations.utils.js';
 import type { WorkspaceLayoutProjector } from '../model/projection.utils.js';
-import type { WorkspaceContextRectResolver } from '../placement/context.utils.js';
+import type { GroupInsertion } from '../placement/group-insertion.utils.js';
 import type { WorkspacePlacementPlan, WorkspacePlacementPlanner } from '../placement/planner.utils.js';
+import type { WorkspaceScopeRectResolver } from '../placement/scope.utils.js';
+import type { WorkspacePlacementSession } from '../placement/session.utils.js';
 export interface WorkspaceInsertionOffer {
     kind: 'order' | 'insert';
     owner: string;
     boundary?: 'start' | 'end';
-    scope: NonNullable<ReturnType<typeof describePlacementSlot>>;
+    insertion: GroupInsertion;
     plan: WorkspacePlacementPlan;
     rect: Rect;
     hitRect?: Rect;
@@ -21,7 +22,7 @@ export interface WorkspaceInsertionOffer {
 /** Gives only an explicit peer lane or structural receiving endcap priority over chrome. */
 export declare function placementOwnsChrome(offer: WorkspaceInsertionOffer): boolean;
 export declare function findSourcePeerRegionKey(node: WorkspaceNode | null, source: string[], key?: string): string | undefined;
-/** Aliases of the same planned insertion share one descriptor. */
+/** Aliases of the same planned insertion share one offer. */
 export declare function createInsertionOffers(input: {
     currentLayout: WorkspaceLayout;
     root: WorkspaceNode | null;
@@ -29,13 +30,14 @@ export declare function createInsertionOffers(input: {
     available: string[];
     projectLayout?: WorkspaceLayoutProjector;
     planPlacement?: WorkspacePlacementPlanner;
-    contextRect?: WorkspaceContextRectResolver;
+    placementSession?: WorkspacePlacementSession;
+    resolveScopeRect?: WorkspaceScopeRectResolver;
     regions: WorkspacePlacedRegion[];
     explorationRegions?: WorkspacePlacedRegion[];
     existing: WorkspaceInsertionOffer[];
     gap: number;
 }): WorkspaceInsertionOffer[];
-/** Shares the painted descriptor's exact operation with input resolution. */
+/** Shares the painted offer's exact operation with input resolution. */
 export declare function getPlacementOfferIntent(offer: WorkspaceInsertionOffer): WorkspaceDropIntent;
 /** Locates ordering availability in the computed exploration geometry, not a prospective landing. */
 export declare function getOrderHintRect(input: {
@@ -44,15 +46,15 @@ export declare function getOrderHintRect(input: {
     previous?: Rect;
     axis: 'horizontal' | 'vertical';
     after: boolean;
-    sourceSlot?: Rect;
+    sourceReservation?: Rect;
     boundary?: 'start' | 'end';
 }): Rect | undefined;
-/** Orders overlapping scope offers into lanes from outermost to innermost. */
+/** Orders overlapping insertion offers into lanes from outermost to innermost. */
 export declare function partitionPlacementOffers(offers: WorkspaceInsertionOffer[]): WorkspaceInsertionOffer[];
 /** Uses current peer geometry for interior insertion cues, before allocating the candidate. */
 export declare function getCurrentInsertionSeam(offer: WorkspaceInsertionOffer, geometry: {
     regions: WorkspacePlacedRegion[];
     source: string[];
     gap: number;
-    contextRect?: WorkspaceContextRectResolver;
+    resolveScopeRect?: WorkspaceScopeRectResolver;
 }): Rect | undefined;

package/dist/workspace/utils/interaction/insertion-offers.utils.js

@@ -1,11 +1,11 @@
 import { getPanelIds as e } from "../model/layout.utils.js";
-import { getAllocatedContextRect as t } from "../placement/context.utils.js";
-import { describePlacementSlot as n } from "../placement/group-insertion.utils.js";
-import { planWorkspacePlacement as r } from "../placement/planner.utils.js";
+import { getAllocatedScopeRect as t } from "../placement/scope.utils.js";
+import { getGroupInsertion as n } from "../placement/group-insertion.utils.js";
+import { resolvePlacementPlan as r } from "../placement/planner.utils.js";
 // src/workspace/utils/interaction/insertion-offers.utils.ts
 function i(e) {
 	let t = e.destination.region?.slice(0, e.destination.region.lastIndexOf(".")) === e.owner;
-	return e.kind === "order" || !!e.boundary || t && !!e.scope.previous && !!e.scope.next;
+	return e.kind === "order" || !!e.boundary || t && !!e.insertion.previous && !!e.insertion.next;
 }
 var a = [
 	"left",
@@ -24,62 +24,56 @@ function o(e, t, n = "root") {
 }
 function s(e) {
 	let t = [], n = /* @__PURE__ */ new Set();
-	for (let r of e.existing) n.add(r.scope.key), t.push(r);
+	for (let r of e.existing) n.add(r.insertion.key), t.push(r);
 	let r = p(e.root).flatMap((t) => c(e, t)).sort((e, t) => Number(e.interior) - Number(t.interior));
-	for (let { offer: e } of r) n.has(e.scope.key) || (n.add(e.scope.key), t.push(e));
+	for (let { offer: e } of r) n.has(e.insertion.key) || (n.add(e.insertion.key), t.push(e));
 	return t;
 }
-function c(n, i) {
-	let a = e(i.node).filter((e) => !n.source.includes(e)), o = (n.contextRect ?? t)({
-		members: a,
+function c(n, r) {
+	let i = e(r.node).filter((e) => !n.source.includes(e)), a = (n.resolveScopeRect ?? t)({
+		members: i,
 		allocation: n.regions,
 		source: n.source
 	});
-	if (!o) return [];
-	let s = (n.contextRect ?? t)({
-		members: a,
+	if (!a) return [];
+	let o = (n.resolveScopeRect ?? t)({
+		members: i,
 		allocation: n.explorationRegions ?? n.regions,
 		source: n.source
-	}), c = {
+	}), s = {
 		input: n,
-		group: i,
-		rect: o,
-		planPlacement: n.planPlacement ?? r
-	}, d = s ? {
-		...c,
-		rect: s
+		group: r,
+		rect: a
+	}, c = o ? {
+		...s,
+		rect: o
 	} : void 0;
-	return u(i).flatMap((e) => {
-		let t = e.interior ? c : d;
+	return u(r).flatMap((e) => {
+		let t = e.interior ? s : c;
 		return t ? l(t, e) : [];
 	});
 }
-function l({ input: t, group: r, rect: i, planPlacement: a }, { target: o, key: s, direction: c, interior: l }) {
+function l({ input: t, group: i, rect: a }, { target: o, key: s, direction: c, interior: l }) {
 	let u = {
 		target: e(o).find((e) => !t.source.includes(e)) ?? "",
 		region: s,
 		position: c
-	}, p = a({
-		layout: t.currentLayout,
-		source: t.source,
-		destination: u,
-		available: t.available,
-		projectLayout: t.projectLayout,
-		operation: "insert"
-	});
+	}, p = r(t, u, "insert");
 	if (!p) return [];
 	let h = n({
 		plan: p,
 		source: t.source,
 		available: t.available,
-		projectLayout: t.projectLayout
+		projectLayout: t.projectLayout,
+		placementSession: t.placementSession,
+		planPlacement: t.planPlacement
 	});
 	if (!h) return [];
-	let g = f(t, h) ?? i, _ = m(g, c);
+	let g = f(t, h) ?? a, _ = m(g, c);
 	if (!_) return [];
 	let v = {
-		scope: h,
-		owner: r.key,
+		insertion: h,
+		owner: i.key,
 		boundary: h.previous ? h.next ? void 0 : "end" : "start",
 		plan: p,
 		scopeRect: g,
@@ -118,7 +112,7 @@ function d(e, t) {
 	}] : [];
 }
 function f(e, n) {
-	if (!!n.previous != !!n.next) return (e.contextRect ?? t)({
+	if (!!n.previous != !!n.next) return (e.resolveScopeRect ?? t)({
 		members: n.members,
 		allocation: e.explorationRegions ?? e.regions,
 		source: e.source
@@ -180,7 +174,7 @@ function _(e, { start: t, extent: n }) {
 	if (e.boundary === "start") return e.owner[t];
 	let r = e.owner[t] + e.owner[n] - 12;
 	if (e.boundary === "end") return r;
-	let i = e.sourceSlot;
+	let i = e.sourceReservation;
 	if (e.after) return i && i[t] >= e.recipient[t] + e.recipient[n] ? (e.recipient[t] + e.recipient[n] + i[t]) / 2 - 6 : r;
 	if (!e.previous) return e.owner[t];
 	let a = e.previous[t] + e.previous[n];
@@ -215,18 +209,18 @@ function x(e, t) {
 	return Math.abs(e.rect[r] - t.rect[r]) < 1 && Math.max(e.rect[i], t.rect[i]) < Math.min(e.rect[i] + e.rect[a], t.rect[i] + t.rect[a]);
 }
 function S(e, n) {
-	if (e.kind !== "insert" || !e.scope.previous || !e.scope.next) return;
-	let r = (n.contextRect ?? t)({
-		members: e.scope.previous,
+	if (e.kind !== "insert" || !e.insertion.previous || !e.insertion.next) return;
+	let r = (n.resolveScopeRect ?? t)({
+		members: e.insertion.previous,
 		allocation: n.regions,
 		source: n.source
-	}), i = (n.contextRect ?? t)({
-		members: e.scope.next,
+	}), i = (n.resolveScopeRect ?? t)({
+		members: e.insertion.next,
 		allocation: n.regions,
 		source: n.source
 	});
 	if (!r || !i) return;
-	let { normal: a, normalExtent: o, tangent: s, tangentSize: c } = C(e.scope.axis), l = i[a] - r[a] - r[o];
+	let { normal: a, normalExtent: o, tangent: s, tangentSize: c } = C(e.insertion.axis), l = i[a] - r[a] - r[o];
 	if (Math.abs(l - n.gap) > 1) return;
 	let u = Math.max(r[s], i[s]), d = Math.min(r[s] + r[c], i[s] + i[c]);
 	if (!(d <= u)) return g({
@@ -237,7 +231,7 @@ function S(e, n) {
 		},
 		recipient: i,
 		previous: r,
-		axis: e.scope.axis,
+		axis: e.insertion.axis,
 		after: !1
 	});
 }

package/dist/workspace/utils/interaction/insertion-offers.utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"insertion-offers.utils.js","names":["placementOwnsChrome","childSlot","offer","directions","findSourcePeerRegionKey","node","child","source","id","key","index","owner","createInsertionOffers","offers","seen","input","candidates","splitGroups","groupInsertions","group","a","b","members","getPanelIds","rect","getAllocatedContextRect","explorationRect","context","planWorkspacePlacement","explorationContext","insertionDestinations","receivingContext","destination","createInsertionOffer","target","direction","plan","planPlacement","slot","describePlacementSlot","domain","insertionEndcap","rectArea","edgeArea","interior","interiorInsertion","candidate","destinations","seam","getCurrentInsertionSeam","getPlacementOfferIntent","getOrderHintRect","horizontal","start","extent","normal","orderAnchor","end","previousEnd","partitionPlacementOffers","sorted","tangentExtent","placed","occupied","lane","sameEdge","other","vertical","isVerticalEdge","shift","position","tangent","previous","geometry","next","axisDimensions","gap","normalExtent","from","to","tangentSize","axis"],"sources":["../../../../src/workspace/utils/interaction/insertion-offers.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';\nimport { getAllocatedContextRect } from '../placement/context.utils.js';\nimport { describePlacementSlot } from '../placement/group-insertion.utils.js';\nimport { planWorkspacePlacement } from '../placement/planner.utils.js';\n\nimport type { WorkspacePlacedRegion } from '../geometry/allocation.utils.js';\nimport type { WorkspaceDropIntent } from './drag-preview.utils.js';\nimport type { WorkspaceLayout, WorkspaceNode } from '../model/layout.utils.js';\nimport type { WorkspaceDestination } from '../model/operations.utils.js';\nimport type { WorkspaceLayoutProjector } from '../model/projection.utils.js';\nimport type { WorkspaceContextRectResolver } from '../placement/context.utils.js';\nimport type { WorkspacePlacementPlan, WorkspacePlacementPlanner } from '../placement/planner.utils.js';\n\nexport interface WorkspaceInsertionOffer {\n  kind: 'order' | 'insert';\n  owner: string;\n  boundary?: 'start' | 'end';\n  scope: NonNullable<ReturnType<typeof describePlacementSlot>>;\n  plan: WorkspacePlacementPlan;\n  rect: Rect;\n  hitRect?: Rect;\n  scopeRect: Rect;\n  destination: WorkspaceDestination;\n}\n\n/** Gives only an explicit peer lane or structural receiving endcap priority over chrome. */\nexport function placementOwnsChrome(offer: WorkspaceInsertionOffer) {\n  const childSlot = offer.destination.region?.slice(0, offer.destination.region.lastIndexOf('.')) === offer.owner;\n  return offer.kind === 'order' || !!offer.boundary || (childSlot && !!offer.scope.previous && !!offer.scope.next);\n}\n\nconst directions = ['left', 'right', 'top', 'bottom'] as const;\n\nexport function findSourcePeerRegionKey(\n  node: WorkspaceNode | null,\n  source: string[],\n  key = 'root'\n): string | undefined {\n  if (node?.type !== 'split') return undefined;\n  if (node.children.some(child => child.type === 'group' && child.panels.every(id => source.includes(id)))) return key;\n  for (const [index, child] of node.children.entries()) {\n    const owner = findSourcePeerRegionKey(child, source, `${key}.${index}`);\n    if (owner) return owner;\n  }\n  return undefined;\n}\n\n/** Aliases of the same planned insertion share one descriptor. */\nexport function createInsertionOffers(input: {\n  currentLayout: WorkspaceLayout;\n  root: WorkspaceNode | null;\n  source: string[];\n  available: string[];\n  projectLayout?: WorkspaceLayoutProjector;\n  planPlacement?: WorkspacePlacementPlanner;\n  contextRect?: WorkspaceContextRectResolver;\n  regions: WorkspacePlacedRegion[];\n  explorationRegions?: WorkspacePlacedRegion[];\n  existing: WorkspaceInsertionOffer[];\n  gap: number;\n}) {\n  const offers: WorkspaceInsertionOffer[] = [];\n  const seen = new Set<string>();\n  for (const offer of input.existing) {\n    seen.add(offer.scope.key);\n    offers.push(offer);\n  }\n  const candidates = splitGroups(input.root)\n    .flatMap(group => groupInsertions(input, group))\n    .sort((a, b) => Number(a.interior) - Number(b.interior));\n  for (const { offer } of candidates) {\n    if (seen.has(offer.scope.key)) continue;\n    seen.add(offer.scope.key);\n    offers.push(offer);\n  }\n  return offers;\n}\n\nfunction groupInsertions(\n  input: Parameters<typeof createInsertionOffers>[0],\n  group: { node: WorkspaceNode; key: string }\n): { offer: WorkspaceInsertionOffer; interior: boolean }[] {\n  const members = getPanelIds(group.node).filter(id => !input.source.includes(id));\n  const rect = (input.contextRect ?? getAllocatedContextRect)({\n    members,\n    allocation: input.regions,\n    source: input.source\n  });\n  if (!rect) return [];\n  const explorationRect = (input.contextRect ?? getAllocatedContextRect)({\n    members,\n    allocation: input.explorationRegions ?? input.regions,\n    source: input.source\n  });\n  const context = { input, group, rect, planPlacement: input.planPlacement ?? planWorkspacePlacement };\n  const explorationContext = explorationRect ? { ...context, rect: explorationRect } : undefined;\n  return insertionDestinations(group).flatMap(destination => {\n    // Receiving edges cannot depend on their own reservation; peer seams follow allocated neighbors.\n    const receivingContext = destination.interior ? context : explorationContext;\n    return receivingContext ? createInsertionOffer(receivingContext, destination) : [];\n  });\n}\n\nfunction createInsertionOffer(\n  {\n    input,\n    group,\n    rect,\n    planPlacement\n  }: {\n    input: Parameters<typeof createInsertionOffers>[0];\n    group: { node: WorkspaceNode; key: string };\n    rect: Rect;\n    planPlacement: WorkspacePlacementPlanner;\n  },\n  { target, key, direction, interior }: ReturnType<typeof insertionDestinations>[number]\n): { offer: WorkspaceInsertionOffer; interior: boolean }[] {\n  const destination: WorkspaceDestination = {\n    target: getPanelIds(target).find(id => !input.source.includes(id)) ?? '',\n    region: key,\n    position: direction\n  };\n  const plan = planPlacement({\n    layout: input.currentLayout,\n    source: input.source,\n    destination,\n    available: input.available,\n    projectLayout: input.projectLayout,\n    operation: 'insert'\n  });\n  if (!plan) return [];\n  const slot = describePlacementSlot({\n    plan,\n    source: input.source,\n    available: input.available,\n    projectLayout: input.projectLayout\n  });\n  if (!slot) return [];\n  const domain = insertionEndcap(input, slot) ?? rect;\n  const rectArea = edgeArea(domain, direction);\n  if (!rectArea) return [];\n  const offer: WorkspaceInsertionOffer = {\n    scope: slot,\n    owner: group.key,\n    boundary: !slot.previous ? 'start' : !slot.next ? 'end' : undefined,\n    plan,\n    scopeRect: domain,\n    rect: rectArea,\n    destination,\n    kind: plan.kind === 'reorder' ? 'order' : 'insert'\n  };\n  return (interior ? interiorInsertion(offer, input) : [offer]).map(candidate => ({ offer: candidate, interior }));\n}\n\nfunction insertionDestinations(group: { node: WorkspaceNode; key: string }) {\n  const destinations = directions.map(direction => ({\n    target: group.node,\n    key: group.key,\n    direction,\n    interior: false\n  }));\n  if (group.node.type === 'split') {\n    const direction = group.node.axis === 'horizontal' ? 'left' : 'top';\n    group.node.children.slice(1).forEach((target, index) =>\n      destinations.push({\n        target,\n        key: `${group.key}.${index + 1}`,\n        direction,\n        interior: true\n      })\n    );\n  }\n  return destinations;\n}\n\nfunction interiorInsertion(\n  offer: WorkspaceInsertionOffer,\n  input: Parameters<typeof createInsertionOffers>[0]\n): WorkspaceInsertionOffer[] {\n  const seam = getCurrentInsertionSeam(offer, input);\n  return seam ? [{ ...offer, rect: seam }] : [];\n}\n\nfunction insertionEndcap(\n  input: Parameters<typeof createInsertionOffers>[0],\n  slot: NonNullable<ReturnType<typeof describePlacementSlot>>\n) {\n  if (!!slot.previous === !!slot.next) return undefined;\n  return (input.contextRect ?? getAllocatedContextRect)({\n    members: slot.members,\n    allocation: input.explorationRegions ?? input.regions,\n    source: input.source\n  });\n}\n\nfunction splitGroups(node: WorkspaceNode | null, key = 'root'): { key: string; node: WorkspaceNode }[] {\n  return node?.type === 'split'\n    ? [{ key, node }, ...node.children.flatMap((child, index) => splitGroups(child, `${key}.${index}`))]\n    : [];\n}\n\nfunction edgeArea(rect: Rect, direction: (typeof directions)[number]): Rect | undefined {\n  if (direction === 'left' || direction === 'right')\n    return 12 <= rect.width\n      ? {\n          x: direction === 'left' ? rect.x : rect.x + rect.width - 12,\n          y: rect.y,\n          width: 12,\n          height: rect.height\n        }\n      : undefined;\n  return 12 <= rect.height\n    ? {\n        x: rect.x,\n        y: direction === 'top' ? rect.y : rect.y + rect.height - 12,\n        width: rect.width,\n        height: 12\n      }\n    : undefined;\n}\n\n/** Shares the painted descriptor's exact operation with input resolution. */\nexport function getPlacementOfferIntent(offer: WorkspaceInsertionOffer): WorkspaceDropIntent {\n  if (offer.destination.position === 'tab') return { kind: 'invalid' };\n  const destination = { ...offer.destination, position: offer.destination.position };\n  return offer.kind === 'insert' ? { kind: 'insert', destination } : { kind: 'order', destination };\n}\n\n/** Locates ordering availability in the computed exploration geometry, not a prospective landing. */\nexport function getOrderHintRect(input: {\n  owner: Rect;\n  recipient: Rect;\n  previous?: Rect;\n  axis: 'horizontal' | 'vertical';\n  after: boolean;\n  sourceSlot?: Rect;\n  boundary?: 'start' | 'end';\n}): Rect | undefined {\n  const horizontal = input.axis === 'horizontal';\n  const start = horizontal ? 'x' : 'y';\n  const extent = horizontal ? 'width' : 'height';\n  if (input.owner[extent] < 12) return undefined;\n  const normal = orderAnchor(input, { start, extent });\n  return horizontal\n    ? { x: normal, y: input.owner.y, width: 12, height: input.owner.height }\n    : { x: input.owner.x, y: normal, width: input.owner.width, height: 12 };\n}\n\nfunction orderAnchor(\n  input: Parameters<typeof getOrderHintRect>[0],\n  { start, extent }: { start: 'x' | 'y'; extent: 'width' | 'height' }\n) {\n  if (input.boundary === 'start') return input.owner[start];\n  const end = input.owner[start] + input.owner[extent] - 12;\n  if (input.boundary === 'end') return end;\n  const slot = input.sourceSlot;\n  if (input.after)\n    return slot && slot[start] >= input.recipient[start] + input.recipient[extent]\n      ? (input.recipient[start] + input.recipient[extent] + slot[start]) / 2 - 6\n      : end;\n  if (!input.previous) return input.owner[start];\n  const previousEnd = input.previous[start] + input.previous[extent];\n  const nextStart =\n    slot && slot[start] >= previousEnd && slot[start] < input.recipient[start] ? slot[start] : input.recipient[start];\n  return (previousEnd + nextStart) / 2 - 6;\n}\n\n/** Orders overlapping scope offers into lanes from outermost to innermost. */\nexport function partitionPlacementOffers(offers: WorkspaceInsertionOffer[]): WorkspaceInsertionOffer[] {\n  const sorted = [...offers].sort((a, b) => tangentExtent(b) - tangentExtent(a));\n  const placed: WorkspaceInsertionOffer[] = [];\n  const occupied: WorkspaceInsertionOffer[] = [];\n  for (const offer of sorted) {\n    const lane = occupied.filter(other => sameEdge(offer, other)).length;\n    occupied.push(offer);\n    const vertical = isVerticalEdge(offer.destination.position);\n    const shift =\n      (offer.destination.position === 'right' || offer.destination.position === 'bottom' ? -1 : 1) * lane * 12;\n    const rect = { ...offer.rect, x: offer.rect.x + (vertical ? shift : 0), y: offer.rect.y + (vertical ? 0 : shift) };\n    if (\n      rect.x < offer.scopeRect.x ||\n      rect.y < offer.scopeRect.y ||\n      rect.x + rect.width > offer.scopeRect.x + offer.scopeRect.width ||\n      rect.y + rect.height > offer.scopeRect.y + offer.scopeRect.height\n    ) {\n      continue;\n    }\n    placed.push({ ...offer, rect });\n  }\n  return placed;\n}\n\nfunction isVerticalEdge(position: WorkspaceDestination['position']) {\n  return position === 'left' || position === 'right';\n}\n\nfunction tangentExtent(offer: WorkspaceInsertionOffer) {\n  return offer.destination.position === 'left' || offer.destination.position === 'right'\n    ? offer.rect.height\n    : offer.rect.width;\n}\n\nfunction sameEdge(a: WorkspaceInsertionOffer, b: WorkspaceInsertionOffer) {\n  if (a.destination.position !== b.destination.position) return false;\n  const vertical = isVerticalEdge(a.destination.position);\n  const normal = vertical ? 'x' : 'y';\n  const tangent = vertical ? 'y' : 'x';\n  const extent = vertical ? 'height' : 'width';\n  return (\n    Math.abs(a.rect[normal] - b.rect[normal]) < 1 &&\n    Math.max(a.rect[tangent], b.rect[tangent]) <\n      Math.min(a.rect[tangent] + a.rect[extent], b.rect[tangent] + b.rect[extent])\n  );\n}\n\n/** Uses current peer geometry for interior insertion cues, before allocating the candidate. */\nexport function getCurrentInsertionSeam(\n  offer: WorkspaceInsertionOffer,\n  geometry: {\n    regions: WorkspacePlacedRegion[];\n    source: string[];\n    gap: number;\n    contextRect?: WorkspaceContextRectResolver;\n  }\n): Rect | undefined {\n  if (offer.kind !== 'insert' || !offer.scope.previous || !offer.scope.next) return undefined;\n  const previous = (geometry.contextRect ?? getAllocatedContextRect)({\n    members: offer.scope.previous,\n    allocation: geometry.regions,\n    source: geometry.source\n  });\n  const next = (geometry.contextRect ?? getAllocatedContextRect)({\n    members: offer.scope.next,\n    allocation: geometry.regions,\n    source: geometry.source\n  });\n  if (!previous || !next) return undefined;\n  const { normal, normalExtent, tangent, tangentSize } = axisDimensions(offer.scope.axis);\n  const gap = next[normal] - previous[normal] - previous[normalExtent];\n  if (Math.abs(gap - geometry.gap) > 1) return undefined;\n  const from = Math.max(previous[tangent], next[tangent]);\n  const to = Math.min(previous[tangent] + previous[tangentSize], next[tangent] + next[tangentSize]);\n  if (to <= from) return undefined;\n  const owner = { ...offer.scopeRect, [tangent]: from, [tangentSize]: to - from };\n  return getOrderHintRect({ owner, recipient: next, previous, axis: offer.scope.axis, after: false });\n}\n\nfunction axisDimensions(axis: 'horizontal' | 'vertical') {\n  return axis === 'horizontal'\n    ? ({ normal: 'x', normalExtent: 'width', tangent: 'y', tangentSize: 'height' } as const)\n    : ({ normal: 'y', normalExtent: 'height', tangent: 'x', tangentSize: 'width' } as const);\n}\n"],"mappings":";;;;;AA+BA,SAAgBA,EAAoB,GAAgC;CAClE,IAAMC,IAAYC,EAAM,YAAY,QAAQ,MAAM,GAAGA,EAAM,YAAY,OAAO,YAAY,GAAG,CAAC,MAAMA,EAAM;CAC1G,OAAOA,EAAM,SAAS,WAAW,CAAC,CAACA,EAAM,YAAaD,KAAa,CAAC,CAACC,EAAM,MAAM,YAAY,CAAC,CAACA,EAAM,MAAM;AAC7G;AAEA,IAAMC,IAAa;CAAC;CAAQ;CAAS;CAAO;AAAQ;AAEpD,SAAgBC,EACd,GACA,GACA,IAAM,QACc;CACpB,IAAIC,GAAM,SAAS,SACnB;MAAIA,EAAK,SAAS,MAAK,MAASC,EAAM,SAAS,WAAWA,EAAM,OAAO,OAAM,MAAMC,EAAO,SAASC,CAAE,CAAC,CAAC,GAAG,OAAOC;EACjH,KAAK,IAAM,CAACC,GAAOJ,MAAUD,EAAK,SAAS,QAAQ,GAAG;GACpD,IAAMM,IAAQP,EAAwBE,GAAOC,GAAQ,GAAGE,EAAI,GAAGC,GAAO;GACtE,IAAIC,GAAO,OAAOA;EACpB;CAJiH;AAMnH;AAGA,SAAgBC,EAAsB,GAYnC;CACD,IAAMC,IAAoC,CAAC,GACrCC,oBAAO,IAAI,IAAY;CAC7B,KAAK,IAAMZ,KAASa,EAAM,UAExB,AADAD,EAAK,IAAIZ,EAAM,MAAM,GAAG,GACxBW,EAAO,KAAKX,CAAK;CAEnB,IAAMc,IAAaC,EAAYF,EAAM,IAAI,CAAC,CACvC,SAAQ,MAASG,EAAgBH,GAAOI,CAAK,CAAC,CAAC,CAC/C,MAAM,GAAG,MAAM,OAAOC,EAAE,QAAQ,IAAI,OAAOC,EAAE,QAAQ,CAAC;CACzD,KAAK,IAAM,EAAE,cAAWL,GACtB,AAAIF,EAAK,IAAIZ,EAAM,MAAM,GAAG,MAC5BY,EAAK,IAAIZ,EAAM,MAAM,GAAG,GACxBW,EAAO,KAAKX,CAAK;CAEnB,OAAOW;AACT;AAEA,SAASK,EACP,GACA,GACyD;CACzD,IAAMI,IAAUC,EAAYJ,EAAM,IAAI,CAAC,CAAC,QAAO,MAAM,CAACJ,EAAM,OAAO,SAASP,CAAE,CAAC,GACzEgB,KAAQT,EAAM,eAAeU,EAAA,CAAyB;EAC1D;EACA,YAAYV,EAAM;EAClB,QAAQA,EAAM;CAChB,CAAC;CACD,IAAI,CAACS,GAAM,OAAO,CAAC;CACnB,IAAME,KAAmBX,EAAM,eAAeU,EAAA,CAAyB;EACrE;EACA,YAAYV,EAAM,sBAAsBA,EAAM;EAC9C,QAAQA,EAAM;CAChB,CAAC,GACKY,IAAU;EAAE;EAAO;EAAO;EAAM,eAAeZ,EAAM,iBAAiBa;CAAuB,GAC7FC,IAAqBH,IAAkB;EAAE,GAAGC;EAAS,MAAMD;CAAgB,IAAI,KAAA;CACrF,OAAOI,EAAsBX,CAAK,CAAC,CAAC,SAAQ,MAAe;EAEzD,IAAMY,IAAmBC,EAAY,WAAWL,IAAUE;EAC1D,OAAOE,IAAmBE,EAAqBF,GAAkBC,CAAW,IAAI,CAAC;CACnF,CAAC;AACH;AAEA,SAASC,EACP,EACE,UACA,UACA,SACA,oBAOF,EAAE,WAAQ,QAAK,cAAW,eAC+B;CACzD,IAAMD,IAAoC;EACxC,QAAQT,EAAYW,CAAM,CAAC,CAAC,MAAK,MAAM,CAACnB,EAAM,OAAO,SAASP,CAAE,CAAC,KAAK;EACtE,QAAQC;EACR,UAAU0B;CACZ,GACMC,IAAOC,EAAc;EACzB,QAAQtB,EAAM;EACd,QAAQA,EAAM;EACd;EACA,WAAWA,EAAM;EACjB,eAAeA,EAAM;EACrB,WAAW;CACb,CAAC;CACD,IAAI,CAACqB,GAAM,OAAO,CAAC;CACnB,IAAME,IAAOC,EAAsB;EACjC;EACA,QAAQxB,EAAM;EACd,WAAWA,EAAM;EACjB,eAAeA,EAAM;CACvB,CAAC;CACD,IAAI,CAACuB,GAAM,OAAO,CAAC;CACnB,IAAME,IAASC,EAAgB1B,GAAOuB,CAAI,KAAKd,GACzCkB,IAAWC,EAASH,GAAQL,CAAS;CAC3C,IAAI,CAACO,GAAU,OAAO,CAAC;CACvB,IAAMxC,IAAiC;EACrC,OAAOoC;EACP,OAAOnB,EAAM;EACb,UAAWmB,EAAK,WAAsBA,EAAK,OAAe,KAAA,IAAR,QAAvB;EAC3B;EACA,WAAWE;EACX,MAAME;EACN;EACA,MAAMN,EAAK,SAAS,YAAY,UAAU;CAC5C;CACA,QAAQQ,IAAWC,EAAkB3C,GAAOa,CAAK,IAAI,CAACb,CAAK,EAAA,CAAG,KAAI,OAAc;EAAE,OAAO4C;EAAW;CAAS,EAAE;AACjH;AAEA,SAAShB,EAAsB,GAA6C;CAC1E,IAAMiB,IAAe5C,EAAW,KAAI,OAAc;EAChD,QAAQgB,EAAM;EACd,KAAKA,EAAM;EACX;EACA,UAAU;CACZ,EAAE;CACF,IAAIA,EAAM,KAAK,SAAS,SAAS;EAC/B,IAAMgB,IAAYhB,EAAM,KAAK,SAAS,eAAe,SAAS;EAC9D,EAAM,KAAK,SAAS,MAAM,CAAC,CAAC,CAAC,SAAS,GAAQ,MAC5C4B,EAAa,KAAK;GAChB;GACA,KAAK,GAAG5B,EAAM,IAAI,GAAGT,IAAQ;GAC7B;GACA,UAAU;EACZ,CAAC,CACH;CACF;CACA,OAAOqC;AACT;AAEA,SAASF,EACP,GACA,GAC2B;CAC3B,IAAMG,IAAOC,EAAwB/C,GAAOa,CAAK;CACjD,OAAOiC,IAAO,CAAC;EAAE,GAAG9C;EAAO,MAAM8C;CAAK,CAAC,IAAI,CAAC;AAC9C;AAEA,SAASP,EACP,GACA,GACA;CACA,IAAI,CAAC,CAACH,EAAK,YAAa,CAAC,CAACA,EAAK,MAC/B,QAAQvB,EAAM,eAAeU,EAAA,CAAyB;EACpD,SAASa,EAAK;EACd,YAAYvB,EAAM,sBAAsBA,EAAM;EAC9C,QAAQA,EAAM;CAChB,CAAC;AACH;AAEA,SAASE,EAAY,GAA4B,IAAM,QAAgD;CACrG,OAAOZ,GAAM,SAAS,UAClB,CAAC;EAAE;EAAK;CAAK,GAAG,GAAGA,EAAK,SAAS,SAAS,GAAO,MAAUY,EAAYX,GAAO,GAAGG,EAAI,GAAGC,GAAO,CAAC,CAAC,IACjG,CAAC;AACP;AAEA,SAASiC,EAAS,GAAY,GAA0D;CAUtF,OATIR,MAAc,UAAUA,MAAc,UACjC,MAAMX,EAAK,QACd;EACE,GAAGW,MAAc,SAASX,EAAK,IAAIA,EAAK,IAAIA,EAAK,QAAQ;EACzD,GAAGA,EAAK;EACR,OAAO;EACP,QAAQA,EAAK;CACf,IACA,KAAA,IACC,MAAMA,EAAK,SACd;EACE,GAAGA,EAAK;EACR,GAAGW,MAAc,QAAQX,EAAK,IAAIA,EAAK,IAAIA,EAAK,SAAS;EACzD,OAAOA,EAAK;EACZ,QAAQ;CACV,IACA,KAAA;AACN;AAGA,SAAgB0B,EAAwB,GAAqD;CAC3F,IAAIhD,EAAM,YAAY,aAAa,OAAO,OAAO,EAAE,MAAM,UAAU;CACnE,IAAM8B,IAAc;EAAE,GAAG9B,EAAM;EAAa,UAAUA,EAAM,YAAY;CAAS;CACjF,OAAOA,EAAM,SAAS,WAAW;EAAE,MAAM;EAAU;CAAY,IAAI;EAAE,MAAM;EAAS;CAAY;AAClG;AAGA,SAAgBiD,EAAiB,GAQZ;CACnB,IAAMC,IAAarC,EAAM,SAAS,cAC5BsC,IAAQD,IAAa,MAAM,KAC3BE,IAASF,IAAa,UAAU;CACtC,IAAIrC,EAAM,MAAMuC,KAAU,IAAI;CAC9B,IAAMC,IAASC,EAAYzC,GAAO;EAAE;EAAO;CAAO,CAAC;CACnD,OAAOqC,IACH;EAAE,GAAGG;EAAQ,GAAGxC,EAAM,MAAM;EAAG,OAAO;EAAI,QAAQA,EAAM,MAAM;CAAO,IACrE;EAAE,GAAGA,EAAM,MAAM;EAAG,GAAGwC;EAAQ,OAAOxC,EAAM,MAAM;EAAO,QAAQ;CAAG;AAC1E;AAEA,SAASyC,EACP,GACA,EAAE,UAAO,aACT;CACA,IAAIzC,EAAM,aAAa,SAAS,OAAOA,EAAM,MAAMsC;CACnD,IAAMI,IAAM1C,EAAM,MAAMsC,KAAStC,EAAM,MAAMuC,KAAU;CACvD,IAAIvC,EAAM,aAAa,OAAO,OAAO0C;CACrC,IAAMnB,IAAOvB,EAAM;CACnB,IAAIA,EAAM,OACR,OAAOuB,KAAQA,EAAKe,MAAUtC,EAAM,UAAUsC,KAAStC,EAAM,UAAUuC,MAClEvC,EAAM,UAAUsC,KAAStC,EAAM,UAAUuC,KAAUhB,EAAKe,MAAU,IAAI,IACvEI;CACN,IAAI,CAAC1C,EAAM,UAAU,OAAOA,EAAM,MAAMsC;CACxC,IAAMK,IAAc3C,EAAM,SAASsC,KAAStC,EAAM,SAASuC;CAG3D,QAAQI,KADNpB,KAAQA,EAAKe,MAAUK,KAAepB,EAAKe,KAAStC,EAAM,UAAUsC,KAASf,EAAKe,KAAStC,EAAM,UAAUsC,OAC1E,IAAI;AACzC;AAGA,SAAgBM,EAAyB,GAA8D;CACrG,IAAMC,IAAS,CAAC,GAAG/C,CAAM,CAAC,CAAC,MAAM,GAAG,MAAMgD,EAAcxC,CAAC,IAAIwC,EAAczC,CAAC,CAAC,GACvE0C,IAAoC,CAAC,GACrCC,IAAsC,CAAC;CAC7C,KAAK,IAAM7D,KAAS0D,GAAQ;EAC1B,IAAMI,IAAOD,EAAS,QAAO,MAASE,EAAS/D,GAAOgE,CAAK,CAAC,CAAC,CAAC;EAC9D,EAAS,KAAKhE,CAAK;EACnB,IAAMiE,IAAWC,EAAelE,EAAM,YAAY,QAAQ,GACpDmE,KACHnE,EAAM,YAAY,aAAa,WAAWA,EAAM,YAAY,aAAa,WAAW,KAAK,KAAK8D,IAAO,IAClGxC,IAAO;GAAE,GAAGtB,EAAM;GAAM,GAAGA,EAAM,KAAK,KAAKiE,IAAWE,IAAQ;GAAI,GAAGnE,EAAM,KAAK,KAAKiE,IAAW,IAAIE;EAAO;EACjH,AACE7C,EAAK,IAAItB,EAAM,UAAU,KACzBsB,EAAK,IAAItB,EAAM,UAAU,KACzBsB,EAAK,IAAIA,EAAK,QAAQtB,EAAM,UAAU,IAAIA,EAAM,UAAU,SAC1DsB,EAAK,IAAIA,EAAK,SAAStB,EAAM,UAAU,IAAIA,EAAM,UAAU,UAI7D4D,EAAO,KAAK;GAAE,GAAG5D;GAAO;EAAK,CAAC;CAChC;CACA,OAAO4D;AACT;AAEA,SAASM,EAAe,GAA4C;CAClE,OAAOE,MAAa,UAAUA,MAAa;AAC7C;AAEA,SAAST,EAAc,GAAgC;CACrD,OAAO3D,EAAM,YAAY,aAAa,UAAUA,EAAM,YAAY,aAAa,UAC3EA,EAAM,KAAK,SACXA,EAAM,KAAK;AACjB;AAEA,SAAS+D,EAAS,GAA4B,GAA4B;CACxE,IAAI7C,EAAE,YAAY,aAAaC,EAAE,YAAY,UAAU,OAAO;CAC9D,IAAM8C,IAAWC,EAAehD,EAAE,YAAY,QAAQ,GAChDmC,IAASY,IAAW,MAAM,KAC1BI,IAAUJ,IAAW,MAAM,KAC3Bb,IAASa,IAAW,WAAW;CACrC,OACE,KAAK,IAAI/C,EAAE,KAAKmC,KAAUlC,EAAE,KAAKkC,EAAO,IAAI,KAC5C,KAAK,IAAInC,EAAE,KAAKmD,IAAUlD,EAAE,KAAKkD,EAAQ,IACvC,KAAK,IAAInD,EAAE,KAAKmD,KAAWnD,EAAE,KAAKkC,IAASjC,EAAE,KAAKkD,KAAWlD,EAAE,KAAKiC,EAAO;AAEjF;AAGA,SAAgBL,EACd,GACA,GAMkB;CAClB,IAAI/C,EAAM,SAAS,YAAY,CAACA,EAAM,MAAM,YAAY,CAACA,EAAM,MAAM,MAAM;CAC3E,IAAMsE,KAAYC,EAAS,eAAehD,EAAA,CAAyB;EACjE,SAASvB,EAAM,MAAM;EACrB,YAAYuE,EAAS;EACrB,QAAQA,EAAS;CACnB,CAAC,GACKC,KAAQD,EAAS,eAAehD,EAAA,CAAyB;EAC7D,SAASvB,EAAM,MAAM;EACrB,YAAYuE,EAAS;EACrB,QAAQA,EAAS;CACnB,CAAC;CACD,IAAI,CAACD,KAAY,CAACE,GAAM;CACxB,IAAM,EAAE,WAAQ,iBAAc,YAAS,mBAAgBC,EAAezE,EAAM,MAAM,IAAI,GAChF0E,IAAMF,EAAKnB,KAAUiB,EAASjB,KAAUiB,EAASK;CACvD,IAAI,KAAK,IAAID,IAAMH,EAAS,GAAG,IAAI,GAAG;CACtC,IAAMK,IAAO,KAAK,IAAIN,EAASD,IAAUG,EAAKH,EAAQ,GAChDQ,IAAK,KAAK,IAAIP,EAASD,KAAWC,EAASQ,IAAcN,EAAKH,KAAWG,EAAKM,EAAY;CAChG,IAAI,OAAMF,IAEV,OAAO3B,EAAiB;EAAE,OAAA;GADV,GAAGjD,EAAM;IAAYqE,IAAUO;IAAOE,IAAcD,IAAKD;EAC/C;EAAO,WAAWJ;EAAM;EAAU,MAAMxE,EAAM,MAAM;EAAM,OAAO;CAAM,CAAC;AACpG;AAEA,SAASyE,EAAe,GAAiC;CACvD,OAAOM,MAAS,eACX;EAAE,QAAQ;EAAK,cAAc;EAAS,SAAS;EAAK,aAAa;CAAS,IAC1E;EAAE,QAAQ;EAAK,cAAc;EAAU,SAAS;EAAK,aAAa;CAAQ;AACjF"}
+{"version":3,"file":"insertion-offers.utils.js","names":["placementOwnsChrome","targetsDirectChild","offer","directions","findSourcePeerRegionKey","node","child","source","id","key","index","owner","createInsertionOffers","offers","seen","input","candidates","splitGroups","groupInsertions","group","a","b","members","getPanelIds","rect","getAllocatedScopeRect","explorationRect","context","explorationContext","insertionDestinations","receivingContext","destination","createInsertionOffer","target","direction","plan","resolvePlacementPlan","insertion","getGroupInsertion","domain","insertionEndcap","rectArea","edgeArea","interior","interiorInsertion","candidate","destinations","seam","getCurrentInsertionSeam","getPlacementOfferIntent","getOrderHintRect","horizontal","start","extent","normal","orderAnchor","end","sourceReservation","previousEnd","partitionPlacementOffers","sorted","tangentExtent","placed","occupied","lane","sameEdge","other","vertical","isVerticalEdge","shift","position","tangent","previous","geometry","next","axisDimensions","gap","normalExtent","from","to","tangentSize","axis"],"sources":["../../../../src/workspace/utils/interaction/insertion-offers.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';\nimport { getGroupInsertion } from '../placement/group-insertion.utils.js';\nimport { resolvePlacementPlan } from '../placement/planner.utils.js';\nimport { getAllocatedScopeRect } from '../placement/scope.utils.js';\n\nimport type { WorkspacePlacedRegion } from '../geometry/allocation.utils.js';\nimport type { WorkspaceDropIntent } from './drag-preview.utils.js';\nimport type { WorkspaceLayout, WorkspaceNode } from '../model/layout.utils.js';\nimport type { WorkspaceDestination } from '../model/operations.utils.js';\nimport type { WorkspaceLayoutProjector } from '../model/projection.utils.js';\nimport type { GroupInsertion } from '../placement/group-insertion.utils.js';\nimport type { WorkspacePlacementPlan, WorkspacePlacementPlanner } from '../placement/planner.utils.js';\nimport type { WorkspaceScopeRectResolver } from '../placement/scope.utils.js';\nimport type { WorkspacePlacementSession } from '../placement/session.utils.js';\n\nexport interface WorkspaceInsertionOffer {\n  kind: 'order' | 'insert';\n  owner: string;\n  boundary?: 'start' | 'end';\n  insertion: GroupInsertion;\n  plan: WorkspacePlacementPlan;\n  rect: Rect;\n  hitRect?: Rect;\n  scopeRect: Rect;\n  destination: WorkspaceDestination;\n}\n\n/** Gives only an explicit peer lane or structural receiving endcap priority over chrome. */\nexport function placementOwnsChrome(offer: WorkspaceInsertionOffer) {\n  const targetsDirectChild =\n    offer.destination.region?.slice(0, offer.destination.region.lastIndexOf('.')) === offer.owner;\n  return (\n    offer.kind === 'order' ||\n    !!offer.boundary ||\n    (targetsDirectChild && !!offer.insertion.previous && !!offer.insertion.next)\n  );\n}\n\nconst directions = ['left', 'right', 'top', 'bottom'] as const;\n\nexport function findSourcePeerRegionKey(\n  node: WorkspaceNode | null,\n  source: string[],\n  key = 'root'\n): string | undefined {\n  if (node?.type !== 'split') return undefined;\n  if (node.children.some(child => child.type === 'group' && child.panels.every(id => source.includes(id)))) return key;\n  for (const [index, child] of node.children.entries()) {\n    const owner = findSourcePeerRegionKey(child, source, `${key}.${index}`);\n    if (owner) return owner;\n  }\n  return undefined;\n}\n\n/** Aliases of the same planned insertion share one offer. */\nexport function createInsertionOffers(input: {\n  currentLayout: WorkspaceLayout;\n  root: WorkspaceNode | null;\n  source: string[];\n  available: string[];\n  projectLayout?: WorkspaceLayoutProjector;\n  planPlacement?: WorkspacePlacementPlanner;\n  placementSession?: WorkspacePlacementSession;\n  resolveScopeRect?: WorkspaceScopeRectResolver;\n  regions: WorkspacePlacedRegion[];\n  explorationRegions?: WorkspacePlacedRegion[];\n  existing: WorkspaceInsertionOffer[];\n  gap: number;\n}) {\n  const offers: WorkspaceInsertionOffer[] = [];\n  const seen = new Set<string>();\n  for (const offer of input.existing) {\n    seen.add(offer.insertion.key);\n    offers.push(offer);\n  }\n  const candidates = splitGroups(input.root)\n    .flatMap(group => groupInsertions(input, group))\n    .sort((a, b) => Number(a.interior) - Number(b.interior));\n  for (const { offer } of candidates) {\n    if (seen.has(offer.insertion.key)) continue;\n    seen.add(offer.insertion.key);\n    offers.push(offer);\n  }\n  return offers;\n}\n\nfunction groupInsertions(\n  input: Parameters<typeof createInsertionOffers>[0],\n  group: { node: WorkspaceNode; key: string }\n): { offer: WorkspaceInsertionOffer; interior: boolean }[] {\n  const members = getPanelIds(group.node).filter(id => !input.source.includes(id));\n  const rect = (input.resolveScopeRect ?? getAllocatedScopeRect)({\n    members,\n    allocation: input.regions,\n    source: input.source\n  });\n  if (!rect) return [];\n  const explorationRect = (input.resolveScopeRect ?? getAllocatedScopeRect)({\n    members,\n    allocation: input.explorationRegions ?? input.regions,\n    source: input.source\n  });\n  const context = { input, group, rect };\n  const explorationContext = explorationRect ? { ...context, rect: explorationRect } : undefined;\n  return insertionDestinations(group).flatMap(destination => {\n    // Receiving edges cannot depend on their own reservation; peer seams follow allocated neighbors.\n    const receivingContext = destination.interior ? context : explorationContext;\n    return receivingContext ? createInsertionOffer(receivingContext, destination) : [];\n  });\n}\n\nfunction createInsertionOffer(\n  {\n    input,\n    group,\n    rect\n  }: {\n    input: Parameters<typeof createInsertionOffers>[0];\n    group: { node: WorkspaceNode; key: string };\n    rect: Rect;\n  },\n  { target, key, direction, interior }: ReturnType<typeof insertionDestinations>[number]\n): { offer: WorkspaceInsertionOffer; interior: boolean }[] {\n  const destination: WorkspaceDestination = {\n    target: getPanelIds(target).find(id => !input.source.includes(id)) ?? '',\n    region: key,\n    position: direction\n  };\n  const plan = resolvePlacementPlan(input, destination, 'insert');\n  if (!plan) return [];\n  const insertion = getGroupInsertion({\n    plan,\n    source: input.source,\n    available: input.available,\n    projectLayout: input.projectLayout,\n    placementSession: input.placementSession,\n    planPlacement: input.planPlacement\n  });\n  if (!insertion) return [];\n  const domain = insertionEndcap(input, insertion) ?? rect;\n  const rectArea = edgeArea(domain, direction);\n  if (!rectArea) return [];\n  const offer: WorkspaceInsertionOffer = {\n    insertion,\n    owner: group.key,\n    boundary: !insertion.previous ? 'start' : !insertion.next ? 'end' : undefined,\n    plan,\n    scopeRect: domain,\n    rect: rectArea,\n    destination,\n    kind: plan.kind === 'reorder' ? 'order' : 'insert'\n  };\n  return (interior ? interiorInsertion(offer, input) : [offer]).map(candidate => ({ offer: candidate, interior }));\n}\n\nfunction insertionDestinations(group: { node: WorkspaceNode; key: string }) {\n  const destinations = directions.map(direction => ({\n    target: group.node,\n    key: group.key,\n    direction,\n    interior: false\n  }));\n  if (group.node.type === 'split') {\n    const direction = group.node.axis === 'horizontal' ? 'left' : 'top';\n    group.node.children.slice(1).forEach((target, index) =>\n      destinations.push({\n        target,\n        key: `${group.key}.${index + 1}`,\n        direction,\n        interior: true\n      })\n    );\n  }\n  return destinations;\n}\n\nfunction interiorInsertion(\n  offer: WorkspaceInsertionOffer,\n  input: Parameters<typeof createInsertionOffers>[0]\n): WorkspaceInsertionOffer[] {\n  const seam = getCurrentInsertionSeam(offer, input);\n  return seam ? [{ ...offer, rect: seam }] : [];\n}\n\nfunction insertionEndcap(input: Parameters<typeof createInsertionOffers>[0], insertion: GroupInsertion) {\n  if (!!insertion.previous === !!insertion.next) return undefined;\n  return (input.resolveScopeRect ?? getAllocatedScopeRect)({\n    members: insertion.members,\n    allocation: input.explorationRegions ?? input.regions,\n    source: input.source\n  });\n}\n\nfunction splitGroups(node: WorkspaceNode | null, key = 'root'): { key: string; node: WorkspaceNode }[] {\n  return node?.type === 'split'\n    ? [{ key, node }, ...node.children.flatMap((child, index) => splitGroups(child, `${key}.${index}`))]\n    : [];\n}\n\nfunction edgeArea(rect: Rect, direction: (typeof directions)[number]): Rect | undefined {\n  if (direction === 'left' || direction === 'right')\n    return 12 <= rect.width\n      ? {\n          x: direction === 'left' ? rect.x : rect.x + rect.width - 12,\n          y: rect.y,\n          width: 12,\n          height: rect.height\n        }\n      : undefined;\n  return 12 <= rect.height\n    ? {\n        x: rect.x,\n        y: direction === 'top' ? rect.y : rect.y + rect.height - 12,\n        width: rect.width,\n        height: 12\n      }\n    : undefined;\n}\n\n/** Shares the painted offer's exact operation with input resolution. */\nexport function getPlacementOfferIntent(offer: WorkspaceInsertionOffer): WorkspaceDropIntent {\n  if (offer.destination.position === 'tab') return { kind: 'invalid' };\n  const destination = { ...offer.destination, position: offer.destination.position };\n  return offer.kind === 'insert' ? { kind: 'insert', destination } : { kind: 'order', destination };\n}\n\n/** Locates ordering availability in the computed exploration geometry, not a prospective landing. */\nexport function getOrderHintRect(input: {\n  owner: Rect;\n  recipient: Rect;\n  previous?: Rect;\n  axis: 'horizontal' | 'vertical';\n  after: boolean;\n  sourceReservation?: Rect;\n  boundary?: 'start' | 'end';\n}): Rect | undefined {\n  const horizontal = input.axis === 'horizontal';\n  const start = horizontal ? 'x' : 'y';\n  const extent = horizontal ? 'width' : 'height';\n  if (input.owner[extent] < 12) return undefined;\n  const normal = orderAnchor(input, { start, extent });\n  return horizontal\n    ? { x: normal, y: input.owner.y, width: 12, height: input.owner.height }\n    : { x: input.owner.x, y: normal, width: input.owner.width, height: 12 };\n}\n\nfunction orderAnchor(\n  input: Parameters<typeof getOrderHintRect>[0],\n  { start, extent }: { start: 'x' | 'y'; extent: 'width' | 'height' }\n) {\n  if (input.boundary === 'start') return input.owner[start];\n  const end = input.owner[start] + input.owner[extent] - 12;\n  if (input.boundary === 'end') return end;\n  const sourceReservation = input.sourceReservation;\n  if (input.after)\n    return sourceReservation && sourceReservation[start] >= input.recipient[start] + input.recipient[extent]\n      ? (input.recipient[start] + input.recipient[extent] + sourceReservation[start]) / 2 - 6\n      : end;\n  if (!input.previous) return input.owner[start];\n  const previousEnd = input.previous[start] + input.previous[extent];\n  const nextStart =\n    sourceReservation && sourceReservation[start] >= previousEnd && sourceReservation[start] < input.recipient[start]\n      ? sourceReservation[start]\n      : input.recipient[start];\n  return (previousEnd + nextStart) / 2 - 6;\n}\n\n/** Orders overlapping insertion offers into lanes from outermost to innermost. */\nexport function partitionPlacementOffers(offers: WorkspaceInsertionOffer[]): WorkspaceInsertionOffer[] {\n  const sorted = [...offers].sort((a, b) => tangentExtent(b) - tangentExtent(a));\n  const placed: WorkspaceInsertionOffer[] = [];\n  const occupied: WorkspaceInsertionOffer[] = [];\n  for (const offer of sorted) {\n    const lane = occupied.filter(other => sameEdge(offer, other)).length;\n    occupied.push(offer);\n    const vertical = isVerticalEdge(offer.destination.position);\n    const shift =\n      (offer.destination.position === 'right' || offer.destination.position === 'bottom' ? -1 : 1) * lane * 12;\n    const rect = { ...offer.rect, x: offer.rect.x + (vertical ? shift : 0), y: offer.rect.y + (vertical ? 0 : shift) };\n    if (\n      rect.x < offer.scopeRect.x ||\n      rect.y < offer.scopeRect.y ||\n      rect.x + rect.width > offer.scopeRect.x + offer.scopeRect.width ||\n      rect.y + rect.height > offer.scopeRect.y + offer.scopeRect.height\n    ) {\n      continue;\n    }\n    placed.push({ ...offer, rect });\n  }\n  return placed;\n}\n\nfunction isVerticalEdge(position: WorkspaceDestination['position']) {\n  return position === 'left' || position === 'right';\n}\n\nfunction tangentExtent(offer: WorkspaceInsertionOffer) {\n  return offer.destination.position === 'left' || offer.destination.position === 'right'\n    ? offer.rect.height\n    : offer.rect.width;\n}\n\nfunction sameEdge(a: WorkspaceInsertionOffer, b: WorkspaceInsertionOffer) {\n  if (a.destination.position !== b.destination.position) return false;\n  const vertical = isVerticalEdge(a.destination.position);\n  const normal = vertical ? 'x' : 'y';\n  const tangent = vertical ? 'y' : 'x';\n  const extent = vertical ? 'height' : 'width';\n  return (\n    Math.abs(a.rect[normal] - b.rect[normal]) < 1 &&\n    Math.max(a.rect[tangent], b.rect[tangent]) <\n      Math.min(a.rect[tangent] + a.rect[extent], b.rect[tangent] + b.rect[extent])\n  );\n}\n\n/** Uses current peer geometry for interior insertion cues, before allocating the candidate. */\nexport function getCurrentInsertionSeam(\n  offer: WorkspaceInsertionOffer,\n  geometry: {\n    regions: WorkspacePlacedRegion[];\n    source: string[];\n    gap: number;\n    resolveScopeRect?: WorkspaceScopeRectResolver;\n  }\n): Rect | undefined {\n  if (offer.kind !== 'insert' || !offer.insertion.previous || !offer.insertion.next) return undefined;\n  const previous = (geometry.resolveScopeRect ?? getAllocatedScopeRect)({\n    members: offer.insertion.previous,\n    allocation: geometry.regions,\n    source: geometry.source\n  });\n  const next = (geometry.resolveScopeRect ?? getAllocatedScopeRect)({\n    members: offer.insertion.next,\n    allocation: geometry.regions,\n    source: geometry.source\n  });\n  if (!previous || !next) return undefined;\n  const { normal, normalExtent, tangent, tangentSize } = axisDimensions(offer.insertion.axis);\n  const gap = next[normal] - previous[normal] - previous[normalExtent];\n  if (Math.abs(gap - geometry.gap) > 1) return undefined;\n  const from = Math.max(previous[tangent], next[tangent]);\n  const to = Math.min(previous[tangent] + previous[tangentSize], next[tangent] + next[tangentSize]);\n  if (to <= from) return undefined;\n  const owner = { ...offer.scopeRect, [tangent]: from, [tangentSize]: to - from };\n  return getOrderHintRect({ owner, recipient: next, previous, axis: offer.insertion.axis, after: false });\n}\n\nfunction axisDimensions(axis: 'horizontal' | 'vertical') {\n  return axis === 'horizontal'\n    ? ({ normal: 'x', normalExtent: 'width', tangent: 'y', tangentSize: 'height' } as const)\n    : ({ normal: 'y', normalExtent: 'height', tangent: 'x', tangentSize: 'width' } as const);\n}\n"],"mappings":";;;;;AAiCA,SAAgBA,EAAoB,GAAgC;CAClE,IAAMC,IACJC,EAAM,YAAY,QAAQ,MAAM,GAAGA,EAAM,YAAY,OAAO,YAAY,GAAG,CAAC,MAAMA,EAAM;CAC1F,OACEA,EAAM,SAAS,WACf,CAAC,CAACA,EAAM,YACPD,KAAsB,CAAC,CAACC,EAAM,UAAU,YAAY,CAAC,CAACA,EAAM,UAAU;AAE3E;AAEA,IAAMC,IAAa;CAAC;CAAQ;CAAS;CAAO;AAAQ;AAEpD,SAAgBC,EACd,GACA,GACA,IAAM,QACc;CACpB,IAAIC,GAAM,SAAS,SACnB;MAAIA,EAAK,SAAS,MAAK,MAASC,EAAM,SAAS,WAAWA,EAAM,OAAO,OAAM,MAAMC,EAAO,SAASC,CAAE,CAAC,CAAC,GAAG,OAAOC;EACjH,KAAK,IAAM,CAACC,GAAOJ,MAAUD,EAAK,SAAS,QAAQ,GAAG;GACpD,IAAMM,IAAQP,EAAwBE,GAAOC,GAAQ,GAAGE,EAAI,GAAGC,GAAO;GACtE,IAAIC,GAAO,OAAOA;EACpB;CAJiH;AAMnH;AAGA,SAAgBC,EAAsB,GAanC;CACD,IAAMC,IAAoC,CAAC,GACrCC,oBAAO,IAAI,IAAY;CAC7B,KAAK,IAAMZ,KAASa,EAAM,UAExB,AADAD,EAAK,IAAIZ,EAAM,UAAU,GAAG,GAC5BW,EAAO,KAAKX,CAAK;CAEnB,IAAMc,IAAaC,EAAYF,EAAM,IAAI,CAAC,CACvC,SAAQ,MAASG,EAAgBH,GAAOI,CAAK,CAAC,CAAC,CAC/C,MAAM,GAAG,MAAM,OAAOC,EAAE,QAAQ,IAAI,OAAOC,EAAE,QAAQ,CAAC;CACzD,KAAK,IAAM,EAAE,cAAWL,GACtB,AAAIF,EAAK,IAAIZ,EAAM,UAAU,GAAG,MAChCY,EAAK,IAAIZ,EAAM,UAAU,GAAG,GAC5BW,EAAO,KAAKX,CAAK;CAEnB,OAAOW;AACT;AAEA,SAASK,EACP,GACA,GACyD;CACzD,IAAMI,IAAUC,EAAYJ,EAAM,IAAI,CAAC,CAAC,QAAO,MAAM,CAACJ,EAAM,OAAO,SAASP,CAAE,CAAC,GACzEgB,KAAQT,EAAM,oBAAoBU,EAAA,CAAuB;EAC7D;EACA,YAAYV,EAAM;EAClB,QAAQA,EAAM;CAChB,CAAC;CACD,IAAI,CAACS,GAAM,OAAO,CAAC;CACnB,IAAME,KAAmBX,EAAM,oBAAoBU,EAAA,CAAuB;EACxE;EACA,YAAYV,EAAM,sBAAsBA,EAAM;EAC9C,QAAQA,EAAM;CAChB,CAAC,GACKY,IAAU;EAAE;EAAO;EAAO;CAAK,GAC/BC,IAAqBF,IAAkB;EAAE,GAAGC;EAAS,MAAMD;CAAgB,IAAI,KAAA;CACrF,OAAOG,EAAsBV,CAAK,CAAC,CAAC,SAAQ,MAAe;EAEzD,IAAMW,IAAmBC,EAAY,WAAWJ,IAAUC;EAC1D,OAAOE,IAAmBE,EAAqBF,GAAkBC,CAAW,IAAI,CAAC;CACnF,CAAC;AACH;AAEA,SAASC,EACP,EACE,UACA,UACA,WAMF,EAAE,WAAQ,QAAK,cAAW,eAC+B;CACzD,IAAMD,IAAoC;EACxC,QAAQR,EAAYU,CAAM,CAAC,CAAC,MAAK,MAAM,CAAClB,EAAM,OAAO,SAASP,CAAE,CAAC,KAAK;EACtE,QAAQC;EACR,UAAUyB;CACZ,GACMC,IAAOC,EAAqBrB,GAAOgB,GAAa,QAAQ;CAC9D,IAAI,CAACI,GAAM,OAAO,CAAC;CACnB,IAAME,IAAYC,EAAkB;EAClC;EACA,QAAQvB,EAAM;EACd,WAAWA,EAAM;EACjB,eAAeA,EAAM;EACrB,kBAAkBA,EAAM;EACxB,eAAeA,EAAM;CACvB,CAAC;CACD,IAAI,CAACsB,GAAW,OAAO,CAAC;CACxB,IAAME,IAASC,EAAgBzB,GAAOsB,CAAS,KAAKb,GAC9CiB,IAAWC,EAASH,GAAQL,CAAS;CAC3C,IAAI,CAACO,GAAU,OAAO,CAAC;CACvB,IAAMvC,IAAiC;EACrC;EACA,OAAOiB,EAAM;EACb,UAAWkB,EAAU,WAAsBA,EAAU,OAAe,KAAA,IAAR,QAA5B;EAChC;EACA,WAAWE;EACX,MAAME;EACN;EACA,MAAMN,EAAK,SAAS,YAAY,UAAU;CAC5C;CACA,QAAQQ,IAAWC,EAAkB1C,GAAOa,CAAK,IAAI,CAACb,CAAK,EAAA,CAAG,KAAI,OAAc;EAAE,OAAO2C;EAAW;CAAS,EAAE;AACjH;AAEA,SAAShB,EAAsB,GAA6C;CAC1E,IAAMiB,IAAe3C,EAAW,KAAI,OAAc;EAChD,QAAQgB,EAAM;EACd,KAAKA,EAAM;EACX;EACA,UAAU;CACZ,EAAE;CACF,IAAIA,EAAM,KAAK,SAAS,SAAS;EAC/B,IAAMe,IAAYf,EAAM,KAAK,SAAS,eAAe,SAAS;EAC9D,EAAM,KAAK,SAAS,MAAM,CAAC,CAAC,CAAC,SAAS,GAAQ,MAC5C2B,EAAa,KAAK;GAChB;GACA,KAAK,GAAG3B,EAAM,IAAI,GAAGT,IAAQ;GAC7B;GACA,UAAU;EACZ,CAAC,CACH;CACF;CACA,OAAOoC;AACT;AAEA,SAASF,EACP,GACA,GAC2B;CAC3B,IAAMG,IAAOC,EAAwB9C,GAAOa,CAAK;CACjD,OAAOgC,IAAO,CAAC;EAAE,GAAG7C;EAAO,MAAM6C;CAAK,CAAC,IAAI,CAAC;AAC9C;AAEA,SAASP,EAAgB,GAAoD,GAA2B;CACtG,IAAI,CAAC,CAACH,EAAU,YAAa,CAAC,CAACA,EAAU,MACzC,QAAQtB,EAAM,oBAAoBU,EAAA,CAAuB;EACvD,SAASY,EAAU;EACnB,YAAYtB,EAAM,sBAAsBA,EAAM;EAC9C,QAAQA,EAAM;CAChB,CAAC;AACH;AAEA,SAASE,EAAY,GAA4B,IAAM,QAAgD;CACrG,OAAOZ,GAAM,SAAS,UAClB,CAAC;EAAE;EAAK;CAAK,GAAG,GAAGA,EAAK,SAAS,SAAS,GAAO,MAAUY,EAAYX,GAAO,GAAGG,EAAI,GAAGC,GAAO,CAAC,CAAC,IACjG,CAAC;AACP;AAEA,SAASgC,EAAS,GAAY,GAA0D;CAUtF,OATIR,MAAc,UAAUA,MAAc,UACjC,MAAMV,EAAK,QACd;EACE,GAAGU,MAAc,SAASV,EAAK,IAAIA,EAAK,IAAIA,EAAK,QAAQ;EACzD,GAAGA,EAAK;EACR,OAAO;EACP,QAAQA,EAAK;CACf,IACA,KAAA,IACC,MAAMA,EAAK,SACd;EACE,GAAGA,EAAK;EACR,GAAGU,MAAc,QAAQV,EAAK,IAAIA,EAAK,IAAIA,EAAK,SAAS;EACzD,OAAOA,EAAK;EACZ,QAAQ;CACV,IACA,KAAA;AACN;AAGA,SAAgByB,EAAwB,GAAqD;CAC3F,IAAI/C,EAAM,YAAY,aAAa,OAAO,OAAO,EAAE,MAAM,UAAU;CACnE,IAAM6B,IAAc;EAAE,GAAG7B,EAAM;EAAa,UAAUA,EAAM,YAAY;CAAS;CACjF,OAAOA,EAAM,SAAS,WAAW;EAAE,MAAM;EAAU;CAAY,IAAI;EAAE,MAAM;EAAS;CAAY;AAClG;AAGA,SAAgBgD,EAAiB,GAQZ;CACnB,IAAMC,IAAapC,EAAM,SAAS,cAC5BqC,IAAQD,IAAa,MAAM,KAC3BE,IAASF,IAAa,UAAU;CACtC,IAAIpC,EAAM,MAAMsC,KAAU,IAAI;CAC9B,IAAMC,IAASC,EAAYxC,GAAO;EAAE;EAAO;CAAO,CAAC;CACnD,OAAOoC,IACH;EAAE,GAAGG;EAAQ,GAAGvC,EAAM,MAAM;EAAG,OAAO;EAAI,QAAQA,EAAM,MAAM;CAAO,IACrE;EAAE,GAAGA,EAAM,MAAM;EAAG,GAAGuC;EAAQ,OAAOvC,EAAM,MAAM;EAAO,QAAQ;CAAG;AAC1E;AAEA,SAASwC,EACP,GACA,EAAE,UAAO,aACT;CACA,IAAIxC,EAAM,aAAa,SAAS,OAAOA,EAAM,MAAMqC;CACnD,IAAMI,IAAMzC,EAAM,MAAMqC,KAASrC,EAAM,MAAMsC,KAAU;CACvD,IAAItC,EAAM,aAAa,OAAO,OAAOyC;CACrC,IAAMC,IAAoB1C,EAAM;CAChC,IAAIA,EAAM,OACR,OAAO0C,KAAqBA,EAAkBL,MAAUrC,EAAM,UAAUqC,KAASrC,EAAM,UAAUsC,MAC5FtC,EAAM,UAAUqC,KAASrC,EAAM,UAAUsC,KAAUI,EAAkBL,MAAU,IAAI,IACpFI;CACN,IAAI,CAACzC,EAAM,UAAU,OAAOA,EAAM,MAAMqC;CACxC,IAAMM,IAAc3C,EAAM,SAASqC,KAASrC,EAAM,SAASsC;CAK3D,QAAQK,KAHND,KAAqBA,EAAkBL,MAAUM,KAAeD,EAAkBL,KAASrC,EAAM,UAAUqC,KACvGK,EAAkBL,KAClBrC,EAAM,UAAUqC,OACa,IAAI;AACzC;AAGA,SAAgBO,EAAyB,GAA8D;CACrG,IAAMC,IAAS,CAAC,GAAG/C,CAAM,CAAC,CAAC,MAAM,GAAG,MAAMgD,EAAcxC,CAAC,IAAIwC,EAAczC,CAAC,CAAC,GACvE0C,IAAoC,CAAC,GACrCC,IAAsC,CAAC;CAC7C,KAAK,IAAM7D,KAAS0D,GAAQ;EAC1B,IAAMI,IAAOD,EAAS,QAAO,MAASE,EAAS/D,GAAOgE,CAAK,CAAC,CAAC,CAAC;EAC9D,EAAS,KAAKhE,CAAK;EACnB,IAAMiE,IAAWC,EAAelE,EAAM,YAAY,QAAQ,GACpDmE,KACHnE,EAAM,YAAY,aAAa,WAAWA,EAAM,YAAY,aAAa,WAAW,KAAK,KAAK8D,IAAO,IAClGxC,IAAO;GAAE,GAAGtB,EAAM;GAAM,GAAGA,EAAM,KAAK,KAAKiE,IAAWE,IAAQ;GAAI,GAAGnE,EAAM,KAAK,KAAKiE,IAAW,IAAIE;EAAO;EACjH,AACE7C,EAAK,IAAItB,EAAM,UAAU,KACzBsB,EAAK,IAAItB,EAAM,UAAU,KACzBsB,EAAK,IAAIA,EAAK,QAAQtB,EAAM,UAAU,IAAIA,EAAM,UAAU,SAC1DsB,EAAK,IAAIA,EAAK,SAAStB,EAAM,UAAU,IAAIA,EAAM,UAAU,UAI7D4D,EAAO,KAAK;GAAE,GAAG5D;GAAO;EAAK,CAAC;CAChC;CACA,OAAO4D;AACT;AAEA,SAASM,EAAe,GAA4C;CAClE,OAAOE,MAAa,UAAUA,MAAa;AAC7C;AAEA,SAAST,EAAc,GAAgC;CACrD,OAAO3D,EAAM,YAAY,aAAa,UAAUA,EAAM,YAAY,aAAa,UAC3EA,EAAM,KAAK,SACXA,EAAM,KAAK;AACjB;AAEA,SAAS+D,EAAS,GAA4B,GAA4B;CACxE,IAAI7C,EAAE,YAAY,aAAaC,EAAE,YAAY,UAAU,OAAO;CAC9D,IAAM8C,IAAWC,EAAehD,EAAE,YAAY,QAAQ,GAChDkC,IAASa,IAAW,MAAM,KAC1BI,IAAUJ,IAAW,MAAM,KAC3Bd,IAASc,IAAW,WAAW;CACrC,OACE,KAAK,IAAI/C,EAAE,KAAKkC,KAAUjC,EAAE,KAAKiC,EAAO,IAAI,KAC5C,KAAK,IAAIlC,EAAE,KAAKmD,IAAUlD,EAAE,KAAKkD,EAAQ,IACvC,KAAK,IAAInD,EAAE,KAAKmD,KAAWnD,EAAE,KAAKiC,IAAShC,EAAE,KAAKkD,KAAWlD,EAAE,KAAKgC,EAAO;AAEjF;AAGA,SAAgBL,EACd,GACA,GAMkB;CAClB,IAAI9C,EAAM,SAAS,YAAY,CAACA,EAAM,UAAU,YAAY,CAACA,EAAM,UAAU,MAAM;CACnF,IAAMsE,KAAYC,EAAS,oBAAoBhD,EAAA,CAAuB;EACpE,SAASvB,EAAM,UAAU;EACzB,YAAYuE,EAAS;EACrB,QAAQA,EAAS;CACnB,CAAC,GACKC,KAAQD,EAAS,oBAAoBhD,EAAA,CAAuB;EAChE,SAASvB,EAAM,UAAU;EACzB,YAAYuE,EAAS;EACrB,QAAQA,EAAS;CACnB,CAAC;CACD,IAAI,CAACD,KAAY,CAACE,GAAM;CACxB,IAAM,EAAE,WAAQ,iBAAc,YAAS,mBAAgBC,EAAezE,EAAM,UAAU,IAAI,GACpF0E,IAAMF,EAAKpB,KAAUkB,EAASlB,KAAUkB,EAASK;CACvD,IAAI,KAAK,IAAID,IAAMH,EAAS,GAAG,IAAI,GAAG;CACtC,IAAMK,IAAO,KAAK,IAAIN,EAASD,IAAUG,EAAKH,EAAQ,GAChDQ,IAAK,KAAK,IAAIP,EAASD,KAAWC,EAASQ,IAAcN,EAAKH,KAAWG,EAAKM,EAAY;CAChG,IAAI,OAAMF,IAEV,OAAO5B,EAAiB;EAAE,OAAA;GADV,GAAGhD,EAAM;IAAYqE,IAAUO;IAAOE,IAAcD,IAAKD;EAC/C;EAAO,WAAWJ;EAAM;EAAU,MAAMxE,EAAM,UAAU;EAAM,OAAO;CAAM,CAAC;AACxG;AAEA,SAASyE,EAAe,GAAiC;CACvD,OAAOM,MAAS,eACX;EAAE,QAAQ;EAAK,cAAc;EAAS,SAAS;EAAK,aAAa;CAAS,IAC1E;EAAE,QAAQ;EAAK,cAAc;EAAU,SAAS;EAAK,aAAa;CAAQ;AACjF"}

package/dist/workspace/utils/interaction/placement-decision.utils.d.ts

@@ -5,14 +5,17 @@ import type { WorkspaceInsertionOffer } from './insertion-offers.utils.js';
 import type { WorkspaceLayout, WorkspaceNode } from '../model/layout.utils.js';
 import type { WorkspaceLayoutProjector } from '../model/projection.utils.js';
 import type { WorkspacePlacementPlanner } from '../placement/planner.utils.js';
+import type { WorkspaceScopeRectResolver } from '../placement/scope.utils.js';
+import type { WorkspacePlacementSession } from '../placement/session.utils.js';
 import type { WorkspacePlacementCatalog } from '../evaluation.utils.js';
 interface WorkspacePlacementQuery {
+    resolveScopeRect?: WorkspaceScopeRectResolver;
     gap: number;
     source: string[];
     point: Point;
     regions: WorkspacePlacedRegion[];
     orderingRegions?: WorkspacePlacedRegion[];
-    sourceSlot?: Rect;
+    sourceReservation?: Rect;
     headers?: Rect[];
     preview?: WorkspaceDragPreview;
     local?: WorkspaceDropIntent;
@@ -24,6 +27,7 @@ type DecisionInput = WorkspacePlacementQuery & {
     available: string[];
     projectLayout?: WorkspaceLayoutProjector;
     planPlacement?: WorkspacePlacementPlanner;
+    placementSession?: WorkspacePlacementSession;
 };
 export interface WorkspacePlacementDecision {
     intent: WorkspaceDropIntent | undefined;
@@ -41,6 +45,7 @@ interface PointerPlacementInput {
     available: string[];
     projectLayout?: WorkspaceLayoutProjector;
     planPlacement?: WorkspacePlacementPlanner;
+    placementSession?: WorkspacePlacementSession;
 }
 export declare function decidePointerPlacement(input: PointerPlacementInput): WorkspacePlacementDecision;
 /** Chooses input and availability together from the two operation-specific computed projections. */