@nvidia-elements/core 2.22.4 → 2.23.0

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

@@ -0,0 +1,259 @@
+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";
+// 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;
+}
+var a = [
+	"left",
+	"right",
+	"top",
+	"bottom"
+];
+function o(e, t, n = "root") {
+	if (e?.type === "split") {
+		if (e.children.some((e) => e.type === "group" && e.panels.every((e) => t.includes(e)))) return n;
+		for (let [r, i] of e.children.entries()) {
+			let e = o(i, t, `${n}.${r}`);
+			if (e) return e;
+		}
+	}
+}
+function s(e) {
+	let t = [], n = /* @__PURE__ */ new Set();
+	for (let r of e.existing) n.add(r.scope.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));
+	return t;
+}
+function c(n, i) {
+	let a = e(i.node).filter((e) => !n.source.includes(e)), o = (n.contextRect ?? t)({
+		members: a,
+		allocation: n.regions,
+		source: n.source
+	});
+	if (!o) return [];
+	let s = (n.contextRect ?? t)({
+		members: a,
+		allocation: n.explorationRegions ?? n.regions,
+		source: n.source
+	}), c = {
+		input: n,
+		group: i,
+		rect: o,
+		planPlacement: n.planPlacement ?? r
+	}, d = s ? {
+		...c,
+		rect: s
+	} : void 0;
+	return u(i).flatMap((e) => {
+		let t = e.interior ? c : d;
+		return t ? l(t, e) : [];
+	});
+}
+function l({ input: t, group: r, rect: i, planPlacement: 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"
+	});
+	if (!p) return [];
+	let h = n({
+		plan: p,
+		source: t.source,
+		available: t.available,
+		projectLayout: t.projectLayout
+	});
+	if (!h) return [];
+	let g = f(t, h) ?? i, _ = m(g, c);
+	if (!_) return [];
+	let v = {
+		scope: h,
+		owner: r.key,
+		boundary: h.previous ? h.next ? void 0 : "end" : "start",
+		plan: p,
+		scopeRect: g,
+		rect: _,
+		destination: u,
+		kind: p.kind === "reorder" ? "order" : "insert"
+	};
+	return (l ? d(v, t) : [v]).map((e) => ({
+		offer: e,
+		interior: l
+	}));
+}
+function u(e) {
+	let t = a.map((t) => ({
+		target: e.node,
+		key: e.key,
+		direction: t,
+		interior: !1
+	}));
+	if (e.node.type === "split") {
+		let n = e.node.axis === "horizontal" ? "left" : "top";
+		e.node.children.slice(1).forEach((r, i) => t.push({
+			target: r,
+			key: `${e.key}.${i + 1}`,
+			direction: n,
+			interior: !0
+		}));
+	}
+	return t;
+}
+function d(e, t) {
+	let n = S(e, t);
+	return n ? [{
+		...e,
+		rect: n
+	}] : [];
+}
+function f(e, n) {
+	if (!!n.previous != !!n.next) return (e.contextRect ?? t)({
+		members: n.members,
+		allocation: e.explorationRegions ?? e.regions,
+		source: e.source
+	});
+}
+function p(e, t = "root") {
+	return e?.type === "split" ? [{
+		key: t,
+		node: e
+	}, ...e.children.flatMap((e, n) => p(e, `${t}.${n}`))] : [];
+}
+function m(e, t) {
+	return t === "left" || t === "right" ? 12 <= e.width ? {
+		x: t === "left" ? e.x : e.x + e.width - 12,
+		y: e.y,
+		width: 12,
+		height: e.height
+	} : void 0 : 12 <= e.height ? {
+		x: e.x,
+		y: t === "top" ? e.y : e.y + e.height - 12,
+		width: e.width,
+		height: 12
+	} : void 0;
+}
+function h(e) {
+	if (e.destination.position === "tab") return { kind: "invalid" };
+	let t = {
+		...e.destination,
+		position: e.destination.position
+	};
+	return e.kind === "insert" ? {
+		kind: "insert",
+		destination: t
+	} : {
+		kind: "order",
+		destination: t
+	};
+}
+function g(e) {
+	let t = e.axis === "horizontal", n = t ? "x" : "y", r = t ? "width" : "height";
+	if (e.owner[r] < 12) return;
+	let i = _(e, {
+		start: n,
+		extent: r
+	});
+	return t ? {
+		x: i,
+		y: e.owner.y,
+		width: 12,
+		height: e.owner.height
+	} : {
+		x: e.owner.x,
+		y: i,
+		width: e.owner.width,
+		height: 12
+	};
+}
+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;
+	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];
+	return (a + (i && i[t] >= a && i[t] < e.recipient[t] ? i[t] : e.recipient[t])) / 2 - 6;
+}
+function v(e) {
+	let t = [...e].sort((e, t) => b(t) - b(e)), n = [], r = [];
+	for (let e of t) {
+		let t = r.filter((t) => x(e, t)).length;
+		r.push(e);
+		let i = y(e.destination.position), a = (e.destination.position === "right" || e.destination.position === "bottom" ? -1 : 1) * t * 12, o = {
+			...e.rect,
+			x: e.rect.x + (i ? a : 0),
+			y: e.rect.y + (i ? 0 : a)
+		};
+		o.x < e.scopeRect.x || o.y < e.scopeRect.y || o.x + o.width > e.scopeRect.x + e.scopeRect.width || o.y + o.height > e.scopeRect.y + e.scopeRect.height || n.push({
+			...e,
+			rect: o
+		});
+	}
+	return n;
+}
+function y(e) {
+	return e === "left" || e === "right";
+}
+function b(e) {
+	return e.destination.position === "left" || e.destination.position === "right" ? e.rect.height : e.rect.width;
+}
+function x(e, t) {
+	if (e.destination.position !== t.destination.position) return !1;
+	let n = y(e.destination.position), r = n ? "x" : "y", i = n ? "y" : "x", a = n ? "height" : "width";
+	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,
+		allocation: n.regions,
+		source: n.source
+	}), i = (n.contextRect ?? t)({
+		members: e.scope.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];
+	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({
+		owner: {
+			...e.scopeRect,
+			[s]: u,
+			[c]: d - u
+		},
+		recipient: i,
+		previous: r,
+		axis: e.scope.axis,
+		after: !1
+	});
+}
+function C(e) {
+	return e === "horizontal" ? {
+		normal: "x",
+		normalExtent: "width",
+		tangent: "y",
+		tangentSize: "height"
+	} : {
+		normal: "y",
+		normalExtent: "height",
+		tangent: "x",
+		tangentSize: "width"
+	};
+}
+export { s as createInsertionOffers, o as findSourcePeerRegionKey, S as getCurrentInsertionSeam, g as getOrderHintRect, h as getPlacementOfferIntent, v as partitionPlacementOffers, i as placementOwnsChrome };
+
+//# sourceMappingURL=insertion-offers.utils.js.map

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

@@ -0,0 +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"}

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

@@ -0,0 +1,55 @@
+import type { Point, Rect } from '@nvidia-elements/core/internal';
+import type { WorkspacePlacedRegion } from '../geometry/allocation.utils.js';
+import type { WorkspaceDragPreview, WorkspaceDropIntent, WorkspacePlacementAcquisition } from './drag-preview.utils.js';
+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 { WorkspacePlacementCatalog } from '../evaluation.utils.js';
+interface WorkspacePlacementQuery {
+    gap: number;
+    source: string[];
+    point: Point;
+    regions: WorkspacePlacedRegion[];
+    orderingRegions?: WorkspacePlacedRegion[];
+    sourceSlot?: Rect;
+    headers?: Rect[];
+    preview?: WorkspaceDragPreview;
+    local?: WorkspaceDropIntent;
+    header: boolean;
+    bounds: Rect;
+}
+type DecisionInput = WorkspacePlacementQuery & {
+    currentLayout: WorkspaceLayout;
+    available: string[];
+    projectLayout?: WorkspaceLayoutProjector;
+    planPlacement?: WorkspacePlacementPlanner;
+};
+export interface WorkspacePlacementDecision {
+    intent: WorkspaceDropIntent | undefined;
+    acquisition?: WorkspacePlacementAcquisition;
+}
+interface PointerPlacementInput {
+    placement: WorkspacePlacementCatalog;
+    canonicalRoot: WorkspaceNode | null;
+    currentLayout: WorkspaceLayout;
+    source: string[];
+    point: Point;
+    heldIntent: WorkspaceDropIntent;
+    groupable: boolean;
+    gap: number;
+    available: string[];
+    projectLayout?: WorkspaceLayoutProjector;
+    planPlacement?: WorkspacePlacementPlanner;
+}
+export declare function decidePointerPlacement(input: PointerPlacementInput): WorkspacePlacementDecision;
+/** Chooses input and availability together from the two operation-specific computed projections. */
+export declare function decidePlacement(input: DecisionInput): {
+    acquisition: {
+        plan: import("../placement/planner.utils.js").WorkspacePlacementPlan;
+        rect: Rect;
+    } | undefined;
+    intent: WorkspaceDropIntent | undefined;
+    hint: WorkspaceInsertionOffer | undefined;
+};
+export {};

package/dist/workspace/utils/interaction/placement-decision.utils.js

@@ -0,0 +1,242 @@
+import { getPanelIds as e, getSplitSide as t } from "../model/layout.utils.js";
+import { findGroup as n, projectLayout as r } from "../model/operations.utils.js";
+import { clipCue as i, matchesPlacementIntent as a } from "./drag-preview.utils.js";
+import { createContextRectResolver as o } from "../placement/context.utils.js";
+import { findWorkspaceRegion as s } from "../placement/region.utils.js";
+import { describePlacementSlot as c } from "../placement/group-insertion.utils.js";
+import { planWorkspacePlacement as l } from "../placement/planner.utils.js";
+import { createInsertionOffers as u, findSourcePeerRegionKey as d, getOrderHintRect as f, getPlacementOfferIntent as p, placementOwnsChrome as m } from "./insertion-offers.utils.js";
+import { getBoundaryPlacementOffers as h } from "./boundary.utils.js";
+import { getTabInsertionIndex as g, preservesGroupMembership as _ } from "../model/membership.utils.js";
+// src/workspace/utils/interaction/placement-decision.utils.ts
+var v = (e, t) => t.x >= e.x && t.x < e.x + e.width && t.y >= e.y && t.y < e.y + e.height;
+function y(e) {
+	let { placement: t, point: n } = e, r = !!t.headerTarget, i = x(e, t.headerTarget ?? (v(t.bounds, n) ? t.targets.find((e) => v(e.rect, n)) : void 0), r);
+	return b({
+		...t,
+		source: e.source,
+		point: n,
+		local: i,
+		header: r,
+		currentLayout: e.currentLayout,
+		gap: e.gap,
+		available: e.available,
+		projectLayout: e.projectLayout,
+		planPlacement: e.planPlacement
+	});
+}
+function b(e) {
+	let t = E({
+		...e,
+		contextRect: o()
+	}), n = O(t.offers, e), r = C(e), i = t.offers.filter((t) => w(t, r, e.bounds)), a = i.filter((e) => e.scope.key !== n).map((t) => ({
+		offer: t,
+		distance: k(t, e.point)
+	})).sort((e, t) => e.distance - t.distance)[0], s = v(e.bounds, e.point) ? t.offers.find((t) => v(t.hitRect ?? t.rect, e.point) && (!e.header || m(t))) : void 0, c = t.hit ?? s;
+	return {
+		acquisition: c ? {
+			plan: c.plan,
+			rect: c.hitRect ?? c.rect
+		} : void 0,
+		intent: D(e, c),
+		hint: T({
+			hit: c && i.includes(c) ? c : void 0,
+			selectedKey: n,
+			boundary: t.hit,
+			nearest: a
+		})
+	};
+}
+function x(e, t, n) {
+	let { reservationHit: r } = e.placement, i = !n && r, a = n && r === "tab" && e.heldIntent.kind === "tab";
+	if (i || a) return e.heldIntent;
+	if (!t) return;
+	let o = t.panels[0];
+	return o ? n ? S(e, t, o) : {
+		kind: "split",
+		destination: {
+			target: o,
+			position: I(e.point, {
+				rect: t.rect,
+				headerHeight: t.headerHeight
+			})
+		}
+	} : { kind: "invalid" };
+}
+function S(e, t, r) {
+	let i = t.tabs.find((t) => e.point.x < t.rect.x + t.rect.width / 2), a = n(e.canonicalRoot, r)?.panels ?? [], o = {
+		kind: "tab",
+		destination: {
+			target: r,
+			position: "tab",
+			index: g(a, i?.id)
+		}
+	};
+	return e.groupable || _({
+		root: e.canonicalRoot,
+		source: e.source,
+		intent: o
+	}) ? o : void 0;
+}
+function C(e) {
+	let t = e.preview;
+	if (e.sourceSlot && t?.phase === "detached" && !t.blocked && t.allocation === "reserved" && t.cue.kind === "group") return i(e.sourceSlot, e.bounds);
+}
+function w(e, t, n) {
+	if (!t) return !0;
+	let r = i(e.rect, n), a = e.destination.position === "left" || e.destination.position === "right", o = a ? "x" : "y", s = a ? "width" : "height", c = a ? "y" : "x", l = a ? "height" : "width";
+	return r[o] > t[o] && r[o] + r[s] < t[o] + t[s] ? !(r[c] >= t[c] && r[c] + r[l] <= t[c] + t[l]) : !0;
+}
+function T({ hit: e, selectedKey: t, boundary: n, nearest: r }) {
+	if (e && e.scope.key !== t) return e;
+	if (!n && r && r.distance <= 24) return r.offer;
+}
+function E(e) {
+	let t = (e.projectLayout ?? r)(e.currentLayout, e.available).root, n = e.orderingRegions ?? e.regions, i = u({
+		...e,
+		root: t,
+		regions: n,
+		explorationRegions: e.regions,
+		existing: j({
+			...e,
+			root: t
+		})
+	});
+	return h({
+		offers: i,
+		bounds: e.bounds,
+		point: e.point,
+		current: e.preview?.intent,
+		headers: e.headers ?? [],
+		geometry: {
+			regions: n,
+			source: e.source,
+			gap: e.gap,
+			contextRect: e.contextRect
+		}
+	});
+}
+function D(e, t) {
+	if (t) return p(t);
+	if (v(e.bounds, e.point)) return e.sourceSlot && v(e.sourceSlot, e.point) ? e.preview?.intent ?? e.local : e.local;
+}
+function O(e, t) {
+	let n = t.preview;
+	if (n && n.phase === "detached") return "layout" in n ? c({
+		plan: n,
+		source: t.source,
+		available: t.available,
+		projectLayout: t.projectLayout
+	})?.key : e.find((e) => a(p(e), n.intent))?.scope.key;
+}
+function k(e, t) {
+	let n = e.hitRect ?? e.rect, r = e.destination.position === "left" || e.destination.position === "right", i = r ? t.y : t.x, a = r ? n.y : n.x, o = r ? n.height : n.width;
+	if (!(i >= a && i < a + o)) return Infinity;
+	let s = r ? t.x - n.x : t.y - n.y, c = r ? n.width : n.height;
+	return Math.abs(s - c / 2);
+}
+function A(t) {
+	let { root: r, source: i } = t, a = d(r, i) ?? "root", o = s(r, a), c = n(t.currentLayout.root, i[0]);
+	if (o?.type !== "split" || !P(c, i)) return;
+	let l = (n) => n.find((e) => e.key === a)?.rect ?? t.contextRect({
+		members: e(o).filter((e) => !i.includes(e)),
+		allocation: n,
+		source: i
+	}), u = l(t.regions), f = l(t.orderingRegions ?? t.regions);
+	if (!u || !f) return;
+	let p = o.children.findIndex((e) => e.type === "group" && e.panels.some((e) => i.includes(e)));
+	if (!(p < 0)) return {
+		key: a,
+		owner: o,
+		rect: u,
+		adjacencyRect: f,
+		peers: o.children.flatMap((e, t) => t === p ? [] : [{
+			node: e,
+			index: t
+		}])
+	};
+}
+function j(e) {
+	let t = A(e);
+	if (!t) return [];
+	let n = t.peers.map((e) => ({
+		...e,
+		after: !1
+	})), r = t.peers.at(-1);
+	return r && n.push({
+		...r,
+		after: !0
+	}), n.flatMap((n, r) => M({
+		input: e,
+		owner: t,
+		entry: n,
+		slot: r
+	}));
+}
+function M({ input: n, owner: r, entry: i, slot: a }) {
+	let o = F({
+		input: n,
+		owner: r,
+		entry: i,
+		slot: a
+	});
+	if (!o) return [];
+	let { region: s, before: u } = o, d = {
+		target: e(i.node)[0],
+		region: s.key,
+		position: t(r.owner.axis, i.after ? "after" : "before")
+	}, p = (n.planPlacement ?? l)({
+		layout: n.currentLayout,
+		source: n.source,
+		destination: d,
+		available: n.available,
+		projectLayout: n.projectLayout,
+		operation: "order"
+	});
+	if (p?.kind !== "reorder") return [];
+	let m = c({
+		plan: p,
+		source: n.source,
+		available: n.available,
+		projectLayout: n.projectLayout
+	}), h = N(i, a), g = h ? r.rect : r.adjacencyRect, _ = f({
+		owner: g,
+		recipient: s.rect,
+		previous: u?.rect,
+		axis: r.owner.axis,
+		after: i.after,
+		sourceSlot: n.sourceSlot,
+		boundary: h
+	});
+	return !_ || !m ? [] : [{
+		destination: d,
+		owner: r.key,
+		boundary: h,
+		rect: _,
+		scopeRect: g,
+		scope: m,
+		plan: p,
+		kind: "order"
+	}];
+}
+function N(e, t) {
+	if (e.after) return "end";
+	if (t === 0) return "start";
+}
+function P(e, t) {
+	return !!e && e.panels.length === t.length && e.panels.every((e) => t.includes(e));
+}
+function F({ input: e, owner: t, entry: n, slot: r }) {
+	let i = e.orderingRegions ?? e.regions, a = i.find((e) => e.key === `${t.key}.${n.index}`), o = t.peers[r - 1], s = o && i.find((e) => e.key === `${t.key}.${o.index}`);
+	return !a || r > 0 && !n.after && !s ? void 0 : {
+		region: a,
+		before: s
+	};
+}
+function I(e, t) {
+	let { rect: n, headerHeight: r } = t, i = n.x + n.width / 2, a = Math.max(1, n.height - r), o = n.y + r + a / 2, s = (e.x - i) / Math.max(1, n.width / 2), c = (e.y - o) / Math.max(1, a / 2);
+	return Math.abs(s) > Math.abs(c) ? s < 0 ? "left" : "right" : c < 0 ? "top" : "bottom";
+}
+export { b as decidePlacement, y as decidePointerPlacement };
+
+//# sourceMappingURL=placement-decision.utils.js.map

package/dist/workspace/utils/interaction/placement-decision.utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"placement-decision.utils.js","names":["inside","point","rect","decidePointerPlacement","input","header","placement","local","localPlacementIntent","item","decidePlacement","boundary","placementOffers","createContextRectResolver","selectedKey","selectedScopeKey","sourceSlot","reservedSourceSlot","hints","eligiblePlacementHint","offer","nearest","distance","a","b","candidate","placementOwnsChrome","hit","acquiredIntent","placementHint","overReservedBody","reservationHit","overReservedTab","target","anchor","headerPlacementIntent","contentDirection","tab","preferred","findGroup","intent","getTabInsertionIndex","preservesGroupMembership","preview","clipCue","bounds","vertical","normal","normalSize","tangent","tangentSize","root","projectLayout","regions","offers","createInsertionOffers","orderOffers","getBoundaryPlacementOffers","getPlacementOfferIntent","describePlacementSlot","matchesPlacementIntent","start","extent","normalOffset","normalExtent","orderOwner","key","findSourcePeerRegionKey","source","owner","findWorkspaceRegion","group","wholeSource","ownerRect","region","getPanelIds","id","adjacencyRect","from","node","index","entries","peer","last","orderOffer","neighbors","orderNeighbors","destination","entry","getSplitSide","plan","planWorkspacePlacement","descriptor","orderBoundary","slot","area","getOrderHintRect","before","previous","centerX","contentHeight","headerHeight","centerY","dx","dy"],"sources":["../../../../src/workspace/utils/interaction/placement-decision.utils.ts"],"sourcesContent":["// SPDX-FileCopyrightText: Copyright (c) 2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.\n// SPDX-License-Identifier: Apache-2.0\n\nimport type { Point, Rect } from '@nvidia-elements/core/internal';\n\nimport { getBoundaryPlacementOffers } from './boundary.utils.js';\nimport { clipCue, matchesPlacementIntent } from './drag-preview.utils.js';\nimport {\n  createInsertionOffers,\n  findSourcePeerRegionKey,\n  getOrderHintRect,\n  getPlacementOfferIntent,\n  placementOwnsChrome\n} from './insertion-offers.utils.js';\nimport { getPanelIds, getSplitSide } from '../model/layout.utils.js';\nimport { getTabInsertionIndex, preservesGroupMembership } from '../model/membership.utils.js';\nimport { findGroup, projectLayout } from '../model/operations.utils.js';\nimport { createContextRectResolver } from '../placement/context.utils.js';\nimport { describePlacementSlot } from '../placement/group-insertion.utils.js';\nimport { planWorkspacePlacement } from '../placement/planner.utils.js';\nimport { findWorkspaceRegion } from '../placement/region.utils.js';\n\nimport type { WorkspacePlacedRegion } from '../geometry/allocation.utils.js';\nimport type { WorkspaceDragPreview, WorkspaceDropIntent, WorkspacePlacementAcquisition } from './drag-preview.utils.js';\nimport type { WorkspaceInsertionOffer } from './insertion-offers.utils.js';\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 { WorkspaceContextRectResolver } from '../placement/context.utils.js';\nimport type { WorkspacePlacementPlanner } from '../placement/planner.utils.js';\nimport type { WorkspaceTarget } from '../presentation/groups.utils.js';\nimport type { WorkspacePlacementCatalog } from '../evaluation.utils.js';\n\ninterface WorkspacePlacementQuery {\n  gap: number;\n  source: string[];\n  point: Point;\n  regions: WorkspacePlacedRegion[];\n  orderingRegions?: WorkspacePlacedRegion[];\n  sourceSlot?: Rect;\n  headers?: Rect[];\n  preview?: WorkspaceDragPreview;\n  local?: WorkspaceDropIntent;\n  header: boolean;\n  bounds: Rect;\n}\n\ntype DecisionInput = WorkspacePlacementQuery & {\n  currentLayout: WorkspaceLayout;\n  available: string[];\n  projectLayout?: WorkspaceLayoutProjector;\n  planPlacement?: WorkspacePlacementPlanner;\n};\n\ntype OfferInput = DecisionInput & { contextRect: WorkspaceContextRectResolver };\n\nexport interface WorkspacePlacementDecision {\n  intent: WorkspaceDropIntent | undefined;\n  acquisition?: WorkspacePlacementAcquisition;\n}\n\ninterface PointerPlacementInput {\n  placement: WorkspacePlacementCatalog;\n  canonicalRoot: WorkspaceNode | null;\n  currentLayout: WorkspaceLayout;\n  source: string[];\n  point: Point;\n  heldIntent: WorkspaceDropIntent;\n  groupable: boolean;\n  gap: number;\n  available: string[];\n  projectLayout?: WorkspaceLayoutProjector;\n  planPlacement?: WorkspacePlacementPlanner;\n}\n\nconst inside = (rect: Rect, point: Point) =>\n  point.x >= rect.x && point.x < rect.x + rect.width && point.y >= rect.y && point.y < rect.y + rect.height;\n\nexport function decidePointerPlacement(input: PointerPlacementInput): WorkspacePlacementDecision {\n  const { placement, point } = input;\n  const header = !!placement.headerTarget;\n  const target =\n    placement.headerTarget ??\n    (inside(placement.bounds, point) ? placement.targets.find(item => inside(item.rect, point)) : undefined);\n  const local = localPlacementIntent(input, target, header);\n  return decidePlacement({\n    ...placement,\n    source: input.source,\n    point,\n    local,\n    header,\n    currentLayout: input.currentLayout,\n    gap: input.gap,\n    available: input.available,\n    projectLayout: input.projectLayout,\n    planPlacement: input.planPlacement\n  });\n}\n\n/** Chooses input and availability together from the two operation-specific computed projections. */\nexport function decidePlacement(input: DecisionInput) {\n  const boundary = placementOffers({ ...input, contextRect: createContextRectResolver() });\n  const selectedKey = selectedScopeKey(boundary.offers, input);\n  const sourceSlot = reservedSourceSlot(input);\n  const hints = boundary.offers.filter(offer => eligiblePlacementHint(offer, sourceSlot, input.bounds));\n  const nearest = hints\n    .filter(offer => offer.scope.key !== selectedKey)\n    .map(offer => ({ offer, distance: distance(offer, input.point) }))\n    .sort((a, b) => a.distance - b.distance)[0];\n  const candidate = inside(input.bounds, input.point)\n    ? boundary.offers.find(\n        offer => inside(offer.hitRect ?? offer.rect, input.point) && (!input.header || placementOwnsChrome(offer))\n      )\n    : undefined;\n  const hit = boundary.hit ?? candidate;\n  return {\n    acquisition: hit ? { plan: hit.plan, rect: hit.hitRect ?? hit.rect } : undefined,\n    intent: acquiredIntent(input, hit),\n    hint: placementHint({\n      hit: hit && hints.includes(hit) ? hit : undefined,\n      selectedKey,\n      boundary: boundary.hit,\n      nearest\n    })\n  };\n}\n\nfunction localPlacementIntent(input: PointerPlacementInput, target: WorkspaceTarget | undefined, header: boolean) {\n  const { reservationHit } = input.placement;\n  const overReservedBody = !header && reservationHit;\n  const overReservedTab = header && reservationHit === 'tab' && input.heldIntent.kind === 'tab';\n  if (overReservedBody || overReservedTab) {\n    return input.heldIntent;\n  }\n  if (!target) return undefined;\n  const anchor = target.panels[0];\n  if (!anchor) return { kind: 'invalid' } as const;\n  if (header) {\n    return headerPlacementIntent(input, target, anchor);\n  }\n  return {\n    kind: 'split',\n    destination: {\n      target: anchor,\n      position: contentDirection(input.point, { rect: target.rect, headerHeight: target.headerHeight })\n    }\n  } as const;\n}\n\nfunction headerPlacementIntent(input: PointerPlacementInput, target: WorkspaceTarget, anchor: string) {\n  const tab = target.tabs.find(item => input.point.x < item.rect.x + item.rect.width / 2);\n  const preferred = findGroup(input.canonicalRoot, anchor)?.panels ?? [];\n  const index = getTabInsertionIndex(preferred, tab?.id);\n  const intent = { kind: 'tab', destination: { target: anchor, position: 'tab', index } } as const;\n  const allowed =\n    input.groupable || preservesGroupMembership({ root: input.canonicalRoot, source: input.source, intent });\n  return allowed ? intent : undefined;\n}\n\nfunction reservedSourceSlot(input: WorkspacePlacementQuery) {\n  const preview = input.preview;\n  if (\n    !input.sourceSlot ||\n    preview?.phase !== 'detached' ||\n    preview.blocked ||\n    preview.allocation !== 'reserved' ||\n    preview.cue.kind !== 'group'\n  ) {\n    return undefined;\n  }\n  return clipCue(input.sourceSlot, input.bounds);\n}\n\nfunction eligiblePlacementHint(offer: WorkspaceInsertionOffer, sourceSlot: Rect | undefined, bounds: Rect) {\n  if (!sourceSlot) return true;\n  const rect = clipCue(offer.rect, bounds);\n  const vertical = offer.destination.position === 'left' || offer.destination.position === 'right';\n  const normal = vertical ? 'x' : 'y';\n  const normalSize = vertical ? 'width' : 'height';\n  const tangent = vertical ? 'y' : 'x';\n  const tangentSize = vertical ? 'height' : 'width';\n  const normalInsideSource =\n    rect[normal] > sourceSlot[normal] && rect[normal] + rect[normalSize] < sourceSlot[normal] + sourceSlot[normalSize];\n  if (!normalInsideSource) return true;\n\n  const tangentCoveredBySource =\n    rect[tangent] >= sourceSlot[tangent] &&\n    rect[tangent] + rect[tangentSize] <= sourceSlot[tangent] + sourceSlot[tangentSize];\n  return !tangentCoveredBySource;\n}\n\nfunction placementHint({\n  hit,\n  selectedKey,\n  boundary,\n  nearest\n}: {\n  hit?: WorkspaceInsertionOffer;\n  selectedKey?: string;\n  boundary?: WorkspaceInsertionOffer;\n  nearest?: { offer: WorkspaceInsertionOffer; distance: number };\n}) {\n  if (hit && hit.scope.key !== selectedKey) return hit;\n  if (!boundary && nearest && nearest.distance <= 24) return nearest.offer;\n  return undefined;\n}\n\nfunction placementOffers(input: OfferInput) {\n  const root = (input.projectLayout ?? projectLayout)(input.currentLayout, input.available).root;\n  const regions = input.orderingRegions ?? input.regions;\n  const offers = createInsertionOffers({\n    ...input,\n    root,\n    regions,\n    explorationRegions: input.regions,\n    existing: orderOffers({ ...input, root })\n  });\n  return getBoundaryPlacementOffers({\n    offers,\n    bounds: input.bounds,\n    point: input.point,\n    current: input.preview?.intent,\n    headers: input.headers ?? [],\n    geometry: { regions, source: input.source, gap: input.gap, contextRect: input.contextRect }\n  });\n}\n\nfunction acquiredIntent(input: WorkspacePlacementQuery, hit: WorkspaceInsertionOffer | undefined) {\n  if (hit) return getPlacementOfferIntent(hit);\n  if (!inside(input.bounds, input.point)) return undefined;\n  if (input.sourceSlot && inside(input.sourceSlot, input.point)) return input.preview?.intent ?? input.local;\n  return input.local;\n}\n\nfunction selectedScopeKey(offers: WorkspaceInsertionOffer[], input: DecisionInput) {\n  const preview = input.preview;\n  if (!preview || preview.phase !== 'detached') return undefined;\n  if ('layout' in preview)\n    return describePlacementSlot({\n      plan: preview,\n      source: input.source,\n      available: input.available,\n      projectLayout: input.projectLayout\n    })?.key;\n  return offers.find(offer => matchesPlacementIntent(getPlacementOfferIntent(offer), preview.intent))?.scope.key;\n}\n\nfunction distance(offer: WorkspaceInsertionOffer, point: Point) {\n  const rect = offer.hitRect ?? offer.rect;\n  const vertical = offer.destination.position === 'left' || offer.destination.position === 'right';\n  const tangent = vertical ? point.y : point.x;\n  const start = vertical ? rect.y : rect.x;\n  const extent = vertical ? rect.height : rect.width;\n  const withinTangent = tangent >= start && tangent < start + extent;\n  if (!withinTangent) return Infinity;\n\n  const normalOffset = vertical ? point.x - rect.x : point.y - rect.y;\n  const normalExtent = vertical ? rect.width : rect.height;\n  return Math.abs(normalOffset - normalExtent / 2);\n}\n\ninterface OrderOwner {\n  key: string;\n  owner: WorkspaceSplit;\n  rect: Rect;\n  adjacencyRect: Rect;\n  peers: { node: WorkspaceNode; index: number }[];\n}\n\nfunction orderOwner(input: OfferInput & { root: WorkspaceNode | null }): OrderOwner | undefined {\n  const { root, source } = input;\n  const key = findSourcePeerRegionKey(root, source) ?? 'root';\n  const owner = findWorkspaceRegion(root, key);\n  const group = findGroup(input.currentLayout.root, source[0]);\n  if (owner?.type !== 'split' || !wholeSource(group, source)) return undefined;\n  const ownerRect = (regions: WorkspacePlacedRegion[]) =>\n    regions.find(region => region.key === key)?.rect ??\n    input.contextRect({ members: getPanelIds(owner).filter(id => !source.includes(id)), allocation: regions, source });\n  const rect = ownerRect(input.regions);\n  const adjacencyRect = ownerRect(input.orderingRegions ?? input.regions);\n  if (!rect || !adjacencyRect) return undefined;\n  const from = owner.children.findIndex(node => node.type === 'group' && node.panels.some(id => source.includes(id)));\n  if (from < 0) return undefined;\n  return {\n    key,\n    owner,\n    rect,\n    adjacencyRect,\n    peers: owner.children.flatMap((node, index) => (index === from ? [] : [{ node, index }]))\n  };\n}\n\nfunction orderOffers(input: OfferInput & { root: WorkspaceNode | null }): WorkspaceInsertionOffer[] {\n  const owner = orderOwner(input);\n  if (!owner) return [];\n  const entries = owner.peers.map(peer => ({ ...peer, after: false }));\n  const last = owner.peers.at(-1);\n  if (last) {\n    entries.push({ ...last, after: true });\n  }\n  return entries.flatMap((entry, slot) => orderOffer({ input, owner, entry, slot }));\n}\n\ninterface OrderOfferInput {\n  input: OfferInput;\n  owner: OrderOwner;\n  entry: { node: WorkspaceNode; index: number; after: boolean };\n  slot: number;\n}\n\nfunction orderOffer({ input, owner, entry, slot }: OrderOfferInput): WorkspaceInsertionOffer[] {\n  const neighbors = orderNeighbors({ input, owner, entry, slot });\n  if (!neighbors) return [];\n  const { region, before } = neighbors;\n  const destination = {\n    target: getPanelIds(entry.node)[0]!,\n    region: region.key,\n    position: getSplitSide(owner.owner.axis, entry.after ? 'after' : 'before')\n  };\n  const plan = (input.planPlacement ?? planWorkspacePlacement)({\n    layout: input.currentLayout,\n    source: input.source,\n    destination,\n    available: input.available,\n    projectLayout: input.projectLayout,\n    operation: 'order'\n  });\n  if (plan?.kind !== 'reorder') return [];\n  const descriptor = describePlacementSlot({\n    plan,\n    source: input.source,\n    available: input.available,\n    projectLayout: input.projectLayout\n  });\n  const boundary = orderBoundary(entry, slot);\n  const ownerRect = boundary ? owner.rect : owner.adjacencyRect;\n  const area = getOrderHintRect({\n    owner: ownerRect,\n    recipient: region.rect,\n    previous: before?.rect,\n    axis: owner.owner.axis,\n    after: entry.after,\n    sourceSlot: input.sourceSlot,\n    boundary\n  });\n  if (!area || !descriptor) return [];\n  return [\n    {\n      destination,\n      owner: owner.key,\n      boundary,\n      rect: area,\n      scopeRect: ownerRect,\n      scope: descriptor,\n      plan,\n      kind: 'order'\n    }\n  ];\n}\n\nfunction orderBoundary(entry: OrderOfferInput['entry'], slot: number): WorkspaceInsertionOffer['boundary'] {\n  if (entry.after) return 'end';\n  if (slot === 0) return 'start';\n  return undefined;\n}\n\nfunction wholeSource(group: ReturnType<typeof findGroup>, source: string[]) {\n  return !!group && group.panels.length === source.length && group.panels.every(id => source.includes(id));\n}\n\nfunction orderNeighbors({ input, owner, entry, slot }: Parameters<typeof orderOffer>[0]) {\n  const regions = input.orderingRegions ?? input.regions;\n  const region = regions.find(candidate => candidate.key === `${owner.key}.${entry.index}`);\n  const previous = owner.peers[slot - 1];\n  const before = previous && regions.find(candidate => candidate.key === `${owner.key}.${previous.index}`);\n  return !region || (slot > 0 && !entry.after && !before) ? undefined : { region, before };\n}\n\nfunction contentDirection(\n  point: Point,\n  input: { rect: Rect; headerHeight: number }\n): Exclude<WorkspaceDestination['position'], 'tab'> {\n  const { rect, headerHeight } = input;\n  const centerX = rect.x + rect.width / 2;\n  const contentHeight = Math.max(1, rect.height - headerHeight);\n  const centerY = rect.y + headerHeight + contentHeight / 2;\n  const dx = (point.x - centerX) / Math.max(1, rect.width / 2);\n  const dy = (point.y - centerY) / Math.max(1, contentHeight / 2);\n  if (Math.abs(dx) > Math.abs(dy)) return dx < 0 ? 'left' : 'right';\n  return dy < 0 ? 'top' : 'bottom';\n}\n"],"mappings":";;;;;;;;;;;AA2EA,IAAMA,KAAU,GAAY,MAC1BC,EAAM,KAAKC,EAAK,KAAKD,EAAM,IAAIC,EAAK,IAAIA,EAAK,SAASD,EAAM,KAAKC,EAAK,KAAKD,EAAM,IAAIC,EAAK,IAAIA,EAAK;AAErG,SAAgBC,EAAuB,GAA0D;CAC/F,IAAM,EAAE,cAAW,aAAUC,GACvBC,IAAS,CAAC,CAACC,EAAU,cAIrBC,IAAQC,EAAqBJ,GAFjCE,EAAU,iBACTN,EAAOM,EAAU,QAAQL,CAAK,IAAIK,EAAU,QAAQ,MAAK,MAAQN,EAAOS,EAAK,MAAMR,CAAK,CAAC,IAAI,KAAA,IAC9CI,CAAM;CACxD,OAAOK,EAAgB;EACrB,GAAGJ;EACH,QAAQF,EAAM;EACd;EACA;EACA;EACA,eAAeA,EAAM;EACrB,KAAKA,EAAM;EACX,WAAWA,EAAM;EACjB,eAAeA,EAAM;EACrB,eAAeA,EAAM;CACvB,CAAC;AACH;AAGA,SAAgBM,EAAgB,GAAsB;CACpD,IAAMC,IAAWC,EAAgB;EAAE,GAAGR;EAAO,aAAaS,EAA0B;CAAE,CAAC,GACjFC,IAAcC,EAAiBJ,EAAS,QAAQP,CAAK,GACrDY,IAAaC,EAAmBb,CAAK,GACrCc,IAAQP,EAAS,OAAO,QAAO,MAASQ,EAAsBC,GAAOJ,GAAYZ,EAAM,MAAM,CAAC,GAC9FiB,IAAUH,EACb,QAAO,MAASE,EAAM,MAAM,QAAQN,CAAW,CAAC,CAChD,KAAI,OAAU;EAAE;EAAO,UAAUQ,EAASF,GAAOhB,EAAM,KAAK;CAAE,EAAE,CAAC,CACjE,MAAM,GAAG,MAAMmB,EAAE,WAAWC,EAAE,QAAQ,CAAC,CAAC,IACrCC,IAAYzB,EAAOI,EAAM,QAAQA,EAAM,KAAK,IAC9CO,EAAS,OAAO,MACd,MAASX,EAAOoB,EAAM,WAAWA,EAAM,MAAMhB,EAAM,KAAK,MAAM,CAACA,EAAM,UAAUsB,EAAoBN,CAAK,EAC1G,IACA,KAAA,GACEO,IAAMhB,EAAS,OAAOc;CAC5B,OAAO;EACL,aAAaE,IAAM;GAAE,MAAMA,EAAI;GAAM,MAAMA,EAAI,WAAWA,EAAI;EAAK,IAAI,KAAA;EACvE,QAAQC,EAAexB,GAAOuB,CAAG;EACjC,MAAME,EAAc;GAClB,KAAKF,KAAOT,EAAM,SAASS,CAAG,IAAIA,IAAM,KAAA;GACxC;GACA,UAAUhB,EAAS;GACnB;EACF,CAAC;CACH;AACF;AAEA,SAASH,EAAqB,GAA8B,GAAqC,GAAiB;CAChH,IAAM,EAAE,sBAAmBJ,EAAM,WAC3B0B,IAAmB,CAACzB,KAAU0B,GAC9BC,IAAkB3B,KAAU0B,MAAmB,SAAS3B,EAAM,WAAW,SAAS;CACxF,IAAI0B,KAAoBE,GACtB,OAAO5B,EAAM;CAEf,IAAI,CAAC6B,GAAQ;CACb,IAAMC,IAASD,EAAO,OAAO;CAK7B,OAJKC,IACD7B,IACK8B,EAAsB/B,GAAO6B,GAAQC,CAAM,IAE7C;EACL,MAAM;EACN,aAAa;GACX,QAAQA;GACR,UAAUE,EAAiBhC,EAAM,OAAO;IAAE,MAAM6B,EAAO;IAAM,cAAcA,EAAO;GAAa,CAAC;EAClG;CACF,IAVoB,EAAE,MAAM,UAAU;AAWxC;AAEA,SAASE,EAAsB,GAA8B,GAAyB,GAAgB;CACpG,IAAME,IAAMJ,EAAO,KAAK,MAAK,MAAQ7B,EAAM,MAAM,IAAIK,EAAK,KAAK,IAAIA,EAAK,KAAK,QAAQ,CAAC,GAChF6B,IAAYC,EAAUnC,EAAM,eAAe8B,CAAM,CAAC,EAAE,UAAU,CAAC,GAE/DM,IAAS;EAAE,MAAM;EAAO,aAAa;GAAE,QAAQN;GAAQ,UAAU;GAAO,OADhEO,EAAqBH,GAAWD,GAAK,EAC2B;EAAM;CAAE;CAGtF,OADEjC,EAAM,aAAasC,EAAyB;EAAE,MAAMtC,EAAM;EAAe,QAAQA,EAAM;EAAQ;CAAO,CAAC,IACxFoC,IAAS,KAAA;AAC5B;AAEA,SAASvB,EAAmB,GAAgC;CAC1D,IAAM0B,IAAUvC,EAAM;CACtB,IACGA,EAAM,cACPuC,GAAS,UAAU,cACnB,GAAQ,WACRA,EAAQ,eAAe,cACvBA,EAAQ,IAAI,SAAS,SAIvB,OAAOC,EAAQxC,EAAM,YAAYA,EAAM,MAAM;AAC/C;AAEA,SAASe,EAAsB,GAAgC,GAA8B,GAAc;CACzG,IAAI,CAACH,GAAY,OAAO;CACxB,IAAMd,IAAO0C,EAAQxB,EAAM,MAAMyB,CAAM,GACjCC,IAAW1B,EAAM,YAAY,aAAa,UAAUA,EAAM,YAAY,aAAa,SACnF2B,IAASD,IAAW,MAAM,KAC1BE,IAAaF,IAAW,UAAU,UAClCG,IAAUH,IAAW,MAAM,KAC3BI,IAAcJ,IAAW,WAAW;CAQ1C,OANE5C,EAAK6C,KAAU/B,EAAW+B,MAAW7C,EAAK6C,KAAU7C,EAAK8C,KAAchC,EAAW+B,KAAU/B,EAAWgC,KAMlG,EAFL9C,EAAK+C,MAAYjC,EAAWiC,MAC5B/C,EAAK+C,KAAW/C,EAAKgD,MAAgBlC,EAAWiC,KAAWjC,EAAWkC,MAJxC;AAMlC;AAEA,SAASrB,EAAc,EACrB,QACA,gBACA,aACA,cAMC;CACD,IAAIF,KAAOA,EAAI,MAAM,QAAQb,GAAa,OAAOa;CACjD,IAAI,CAAChB,KAAYU,KAAWA,EAAQ,YAAY,IAAI,OAAOA,EAAQ;AAErE;AAEA,SAAST,EAAgB,GAAmB;CAC1C,IAAMuC,KAAQ/C,EAAM,iBAAiBgD,EAAA,CAAehD,EAAM,eAAeA,EAAM,SAAS,CAAC,CAAC,MACpFiD,IAAUjD,EAAM,mBAAmBA,EAAM,SACzCkD,IAASC,EAAsB;EACnC,GAAGnD;EACH;EACA;EACA,oBAAoBA,EAAM;EAC1B,UAAUoD,EAAY;GAAE,GAAGpD;GAAO;EAAK,CAAC;CAC1C,CAAC;CACD,OAAOqD,EAA2B;EAChC;EACA,QAAQrD,EAAM;EACd,OAAOA,EAAM;EACb,SAASA,EAAM,SAAS;EACxB,SAASA,EAAM,WAAW,CAAC;EAC3B,UAAU;GAAE;GAAS,QAAQA,EAAM;GAAQ,KAAKA,EAAM;GAAK,aAAaA,EAAM;EAAY;CAC5F,CAAC;AACH;AAEA,SAASwB,EAAe,GAAgC,GAA0C;CAChG,IAAID,GAAK,OAAO+B,EAAwB/B,CAAG;CAC3C,IAAK3B,EAAOI,EAAM,QAAQA,EAAM,KAAK,GAErC,OADIA,EAAM,cAAcJ,EAAOI,EAAM,YAAYA,EAAM,KAAK,IAAUA,EAAM,SAAS,UAAUA,EAAM,QAC9FA,EAAM;AACf;AAEA,SAASW,EAAiB,GAAmC,GAAsB;CACjF,IAAM4B,IAAUvC,EAAM;CACtB,IAAKuC,KAAWA,EAAQ,UAAU,YAQlC,OAPI,YAAYA,IACPgB,EAAsB;EAC3B,MAAMhB;EACN,QAAQvC,EAAM;EACd,WAAWA,EAAM;EACjB,eAAeA,EAAM;CACvB,CAAC,CAAC,EAAE,MACCkD,EAAO,MAAK,MAASM,EAAuBF,EAAwBtC,CAAK,GAAGuB,EAAQ,MAAM,CAAC,CAAC,EAAE,MAAM;AAC7G;AAEA,SAASrB,EAAS,GAAgC,GAAc;CAC9D,IAAMpB,IAAOkB,EAAM,WAAWA,EAAM,MAC9B0B,IAAW1B,EAAM,YAAY,aAAa,UAAUA,EAAM,YAAY,aAAa,SACnF6B,IAAUH,IAAW7C,EAAM,IAAIA,EAAM,GACrC4D,IAAQf,IAAW5C,EAAK,IAAIA,EAAK,GACjC4D,IAAShB,IAAW5C,EAAK,SAASA,EAAK;CAE7C,IAAI,EADkB+C,KAAWY,KAASZ,IAAUY,IAAQC,IACxC,OAAO;CAE3B,IAAMC,IAAejB,IAAW7C,EAAM,IAAIC,EAAK,IAAID,EAAM,IAAIC,EAAK,GAC5D8D,IAAelB,IAAW5C,EAAK,QAAQA,EAAK;CAClD,OAAO,KAAK,IAAI6D,IAAeC,IAAe,CAAC;AACjD;AAUA,SAASC,EAAW,GAA4E;CAC9F,IAAM,EAAE,SAAM,cAAW7D,GACnB8D,IAAMC,EAAwBhB,GAAMiB,CAAM,KAAK,QAC/CC,IAAQC,EAAoBnB,GAAMe,CAAG,GACrCK,IAAQhC,EAAUnC,EAAM,cAAc,MAAMgE,EAAO,EAAE;CAC3D,IAAIC,GAAO,SAAS,WAAW,CAACG,EAAYD,GAAOH,CAAM,GAAG;CAC5D,IAAMK,KAAa,MACjBpB,EAAQ,MAAK,MAAUqB,EAAO,QAAQR,CAAG,CAAC,EAAE,QAC5C9D,EAAM,YAAY;EAAE,SAASuE,EAAYN,CAAK,CAAC,CAAC,QAAO,MAAM,CAACD,EAAO,SAASQ,CAAE,CAAC;EAAG,YAAYvB;EAAS;CAAO,CAAC,GAC7GnD,IAAOuE,EAAUrE,EAAM,OAAO,GAC9ByE,IAAgBJ,EAAUrE,EAAM,mBAAmBA,EAAM,OAAO;CACtE,IAAI,CAACF,KAAQ,CAAC2E,GAAe;CAC7B,IAAMC,IAAOT,EAAM,SAAS,WAAU,MAAQU,EAAK,SAAS,WAAWA,EAAK,OAAO,MAAK,MAAMX,EAAO,SAASQ,CAAE,CAAC,CAAC;CAClH,IAAI,MAAO,IACX,OAAO;EACL;EACA;EACA;EACA;EACA,OAAOP,EAAM,SAAS,SAAS,GAAM,MAAWW,MAAUF,IAAO,CAAC,IAAI,CAAC;GAAE;GAAM;EAAM,CAAC,CAAE;CAC1F;AACF;AAEA,SAAStB,EAAY,GAA+E;CAClG,IAAMa,IAAQJ,EAAW7D,CAAK;CAC9B,IAAI,CAACiE,GAAO,OAAO,CAAC;CACpB,IAAMY,IAAUZ,EAAM,MAAM,KAAI,OAAS;EAAE,GAAGa;EAAM,OAAO;CAAM,EAAE,GAC7DC,IAAOd,EAAM,MAAM,GAAG,EAAE;CAI9B,OAHIc,KACFF,EAAQ,KAAK;EAAE,GAAGE;EAAM,OAAO;CAAK,CAAC,GAEhCF,EAAQ,SAAS,GAAO,MAASG,EAAW;EAAE;EAAO;EAAO;EAAO;CAAK,CAAC,CAAC;AACnF;AASA,SAASA,EAAW,EAAE,UAAO,UAAO,UAAO,WAAoD;CAC7F,IAAMC,IAAYC,EAAe;EAAE;EAAO;EAAO;EAAO;CAAK,CAAC;CAC9D,IAAI,CAACD,GAAW,OAAO,CAAC;CACxB,IAAM,EAAE,WAAQ,cAAWA,GACrBE,IAAc;EAClB,QAAQZ,EAAYa,EAAM,IAAI,CAAC,CAAC;EAChC,QAAQd,EAAO;EACf,UAAUe,EAAapB,EAAM,MAAM,MAAMmB,EAAM,QAAQ,UAAU,QAAQ;CAC3E,GACME,KAAQtF,EAAM,iBAAiBuF,EAAA,CAAwB;EAC3D,QAAQvF,EAAM;EACd,QAAQA,EAAM;EACd;EACA,WAAWA,EAAM;EACjB,eAAeA,EAAM;EACrB,WAAW;CACb,CAAC;CACD,IAAIsF,GAAM,SAAS,WAAW,OAAO,CAAC;CACtC,IAAME,IAAajC,EAAsB;EACvC;EACA,QAAQvD,EAAM;EACd,WAAWA,EAAM;EACjB,eAAeA,EAAM;CACvB,CAAC,GACKO,IAAWkF,EAAcL,GAAOM,CAAI,GACpCrB,IAAY9D,IAAW0D,EAAM,OAAOA,EAAM,eAC1C0B,IAAOC,EAAiB;EAC5B,OAAOvB;EACP,WAAWC,EAAO;EAClB,UAAUuB,GAAQ;EAClB,MAAM5B,EAAM,MAAM;EAClB,OAAOmB,EAAM;EACb,YAAYpF,EAAM;EAClB;CACF,CAAC;CAED,OADI,CAAC2F,KAAQ,CAACH,IAAmB,CAAC,IAC3B,CACL;EACE;EACA,OAAOvB,EAAM;EACb;EACA,MAAM0B;EACN,WAAWtB;EACX,OAAOmB;EACP;EACA,MAAM;CACR,CACF;AACF;AAEA,SAASC,EAAc,GAAiC,GAAmD;CACzG,IAAIL,EAAM,OAAO,OAAO;CACxB,IAAIM,MAAS,GAAG,OAAO;AAEzB;AAEA,SAAStB,EAAY,GAAqC,GAAkB;CAC1E,OAAO,CAAC,CAACD,KAASA,EAAM,OAAO,WAAWH,EAAO,UAAUG,EAAM,OAAO,OAAM,MAAMH,EAAO,SAASQ,CAAE,CAAC;AACzG;AAEA,SAASU,EAAe,EAAE,UAAO,UAAO,UAAO,WAA0C;CACvF,IAAMjC,IAAUjD,EAAM,mBAAmBA,EAAM,SACzCsE,IAASrB,EAAQ,MAAK,MAAa5B,EAAU,QAAQ,GAAG4C,EAAM,IAAI,GAAGmB,EAAM,OAAO,GAClFU,IAAW7B,EAAM,MAAMyB,IAAO,IAC9BG,IAASC,KAAY7C,EAAQ,MAAK,MAAa5B,EAAU,QAAQ,GAAG4C,EAAM,IAAI,GAAG6B,EAAS,OAAO;CACvG,OAAO,CAACxB,KAAWoB,IAAO,KAAK,CAACN,EAAM,SAAS,CAACS,IAAU,KAAA,IAAY;EAAE;EAAQ;CAAO;AACzF;AAEA,SAAS7D,EACP,GACA,GACkD;CAClD,IAAM,EAAE,SAAM,oBAAiBhC,GACzB+F,IAAUjG,EAAK,IAAIA,EAAK,QAAQ,GAChCkG,IAAgB,KAAK,IAAI,GAAGlG,EAAK,SAASmG,CAAY,GACtDC,IAAUpG,EAAK,IAAImG,IAAeD,IAAgB,GAClDG,KAAMtG,EAAM,IAAIkG,KAAW,KAAK,IAAI,GAAGjG,EAAK,QAAQ,CAAC,GACrDsG,KAAMvG,EAAM,IAAIqG,KAAW,KAAK,IAAI,GAAGF,IAAgB,CAAC;CAE9D,OADI,KAAK,IAAIG,CAAE,IAAI,KAAK,IAAIC,CAAE,IAAUD,IAAK,IAAI,SAAS,UACnDC,IAAK,IAAI,QAAQ;AAC1B"}

package/dist/workspace/utils/interaction/resize-input.utils.d.ts

@@ -0,0 +1 @@
+export declare function isResizeKey(key: string): boolean;