@nvidia-elements/core 2.23.6 → 2.24.0

package/dist/dashboard/utils/layout.utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.utils.js","names":["exhaustive","dashboardExtent","isDashboardGridPlacement","isNonNullObject","value","isSupportedGridInteger","parseDashboardValue","data","throwInvalidArrangement","grid","parseGrid","ids","parseItem","item","serializeDashboardValue","layout","createDefaultDashboardLayout","reconcileDashboard","available","panels","panel","saved","reconcileSaved","options","result","reconcileNewPanels","oriented","active","orientDashboardItem","packed","settleDashboardItems","positions","items","input","initial","next","hidden","reconcileItem","resolved","savedItems","priority","constraints","areSpanConstraintsValid","limits","columnSpan","rowSpan","candidate","doDashboardGridGeometriesOverlap","other","findFirstDashboardFit","geometry","orient","placed","occupied","rows","a","b","columns","row","column","placeDashboard","request","requested","intent","source","id","constraint","desired","isPlacementValid","normalizePlacementIntent","findNormalizedPlacementPlan","orientIntent","flow","point","transposeDashboardGridGeometry","minimum"],"sources":["../../../src/dashboard/utils/layout.utils.ts"],"sourcesContent":["// SPDX-FileCopyrightText: Copyright (c) 2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.\n// SPDX-License-Identifier: Apache-2.0\n\nimport { doDashboardGridGeometriesOverlap, transposeDashboardGridGeometry } from './geometry.utils.js';\nimport { findNormalizedPlacementPlan, orientDashboardItem, settleDashboardItems } from './packing.utils.js';\n\nimport type { DashboardGridPoint, DashboardIntent } from './intent.types.js';\n\nimport type {\n  DashboardGridPlacement,\n  DashboardItem,\n  DashboardLayout,\n  DashboardSpanConstraints\n} from '../dashboard.types.js';\n\n/** Largest supported coordinate or extent, in cells. */\nconst dashboardExtent = 1_000_000;\n\nexport function isDashboardGridPlacement(value: unknown): value is DashboardGridPlacement {\n  if (!isNonNullObject(value)) return false;\n\n  return (\n    isSupportedGridInteger(value.column, 0) &&\n    isSupportedGridInteger(value.row, 0) &&\n    isSupportedGridInteger(value.columnSpan, 1) &&\n    isSupportedGridInteger(value.rowSpan, 1) &&\n    value.column + value.columnSpan <= dashboardExtent &&\n    value.row + value.rowSpan <= dashboardExtent\n  );\n}\n\nexport function parseDashboardValue(value: string): DashboardLayout | undefined {\n  if (!value) return undefined;\n\n  const data: unknown = JSON.parse(value);\n\n  if (!isNonNullObject(data) || data.version !== 1 || !Array.isArray(data.items)) {\n    throwInvalidArrangement();\n  }\n\n  const grid = parseGrid(data.grid);\n  const ids = new Set<string>();\n  const items = data.items.map(item => parseItem(item, grid, ids));\n\n  return { version: 1, grid, items };\n}\n\nfunction parseGrid(value: unknown): DashboardLayout['grid'] {\n  if (\n    !isNonNullObject(value) ||\n    (value.flow !== 'vertical' && value.flow !== 'horizontal') ||\n    !isSupportedGridInteger(value.tracks, 1)\n  ) {\n    throwInvalidArrangement();\n  }\n\n  return { flow: value.flow, tracks: value.tracks };\n}\n\nfunction parseItem(value: unknown, grid: DashboardLayout['grid'], ids: Set<string>): DashboardItem {\n  if (\n    !isNonNullObject(value) ||\n    !isDashboardGridPlacement(value) ||\n    !('id' in value) ||\n    typeof value.id !== 'string' ||\n    !value.id ||\n    ids.has(value.id)\n  ) {\n    throwInvalidArrangement();\n  }\n\n  if ((grid.flow === 'vertical' ? value.column + value.columnSpan : value.row + value.rowSpan) > grid.tracks) {\n    throwInvalidArrangement();\n  }\n\n  ids.add(value.id);\n\n  return { id: value.id, column: value.column, row: value.row, columnSpan: value.columnSpan, rowSpan: value.rowSpan };\n}\n\nfunction throwInvalidArrangement(): never {\n  throw new TypeError('Invalid dashboard arrangement');\n}\n\nexport function serializeDashboardValue(layout: DashboardLayout | undefined): string {\n  return layout ? JSON.stringify(layout) : '';\n}\n\nexport function createDefaultDashboardLayout(): DashboardLayout {\n  return { version: 1, grid: { flow: 'vertical', tracks: 12 }, items: [] };\n}\n\n/** Reconciles current members; hidden members keep placement without occupying cells. */\nexport function reconcileDashboard(\n  layout: DashboardLayout,\n  panels: readonly DashboardSpanConstraints[],\n  options: { priority?: ReadonlySet<string>; autoSettle?: boolean; hidden?: ReadonlySet<string> } = {}\n): DashboardLayout | undefined {\n  const available = new Map(panels.map(panel => [panel.id, panel]));\n  if (available.size !== panels.length || panels.some(panel => !panel.id)) return undefined;\n\n  const saved = reconcileSaved({\n    layout,\n    available,\n    priority: options.priority,\n    hidden: options.hidden\n  });\n  const result = saved && reconcileNewPanels({ ...saved, available, grid: layout.grid, hidden: options.hidden });\n  if (!result) return undefined;\n\n  const { active, items } = result;\n  const oriented = active.map(item => orientDashboardItem(item, layout.grid.flow));\n  const packed = options.autoSettle ? settleDashboardItems(oriented) : oriented;\n  if (!packed) return undefined;\n\n  const positions = new Map(packed.map(item => [item.id, orientDashboardItem(item, layout.grid.flow)]));\n\n  return {\n    version: 1,\n    grid: layout.grid,\n    items: items.map(item => positions.get(item.id) ?? item)\n  };\n}\n\nfunction reconcileNewPanels(input: {\n  available: ReadonlyMap<string, DashboardSpanConstraints>;\n  grid: DashboardLayout['grid'];\n  active: DashboardItem[];\n  items: DashboardItem[];\n  hidden?: ReadonlySet<string>;\n}) {\n  const { available, grid, active, items, hidden } = input;\n\n  for (const panel of available.values()) {\n    const initial = { id: panel.id, column: 0, row: 0, columnSpan: 1, rowSpan: 1 };\n    const next = hidden?.has(panel.id) ? initial : reconcileItem({ item: initial, limits: panel, grid, active });\n    if (!next) return undefined;\n\n    if (!hidden?.has(panel.id)) active.push(next);\n    items.push(next);\n  }\n\n  return { active, items };\n}\n\nfunction reconcileSaved(input: {\n  layout: DashboardLayout;\n  available: Map<string, DashboardSpanConstraints>;\n  priority?: ReadonlySet<string>;\n  hidden?: ReadonlySet<string>;\n}) {\n  const { layout, available, priority, hidden } = input;\n  const active: DashboardItem[] = [];\n  const resolved = new Map<string, DashboardItem>();\n  const savedItems = priority\n    ? [...layout.items.filter(item => priority.has(item.id)), ...layout.items.filter(item => !priority.has(item.id))]\n    : layout.items;\n\n  for (const saved of savedItems) {\n    const constraints = available.get(saved.id);\n\n    if (!constraints) continue;\n\n    available.delete(saved.id);\n\n    const next = hidden?.has(saved.id)\n      ? saved\n      : reconcileItem({ item: saved, limits: constraints, grid: layout.grid, active });\n    if (!next) return undefined;\n\n    if (!hidden?.has(saved.id)) active.push(next);\n    resolved.set(next.id, next);\n  }\n\n  const items = layout.items.flatMap(item => resolved.get(item.id) ?? []);\n\n  return { active, items };\n}\n\nfunction reconcileItem(input: {\n  item: DashboardItem;\n  limits: DashboardSpanConstraints;\n  grid: DashboardLayout['grid'];\n  active: DashboardItem[];\n}): DashboardItem | undefined {\n  const { item, limits, grid, active } = input;\n  if (!areSpanConstraintsValid(limits)) return undefined;\n\n  const columnSpan = Math.max(limits.minColumnSpan, Math.min(limits.maxColumnSpan, item.columnSpan));\n  const rowSpan = Math.max(limits.minRowSpan, Math.min(limits.maxRowSpan, item.rowSpan));\n  const candidate = { ...item, columnSpan, rowSpan };\n  if ((grid.flow === 'vertical' ? columnSpan : rowSpan) > grid.tracks) return undefined;\n  if (\n    isDashboardGridPlacement(candidate) &&\n    (grid.flow === 'vertical' ? candidate.column + columnSpan : candidate.row + rowSpan) <= grid.tracks &&\n    active.every(other => !doDashboardGridGeometriesOverlap(other, candidate))\n  ) {\n    return candidate;\n  }\n\n  return findFirstDashboardFit(candidate, active, grid);\n}\n\n/** Searches occupied boundaries, so sparse coordinate distances do not increase work. */\nexport function findFirstDashboardFit(\n  item: DashboardItem,\n  occupied: readonly DashboardItem[],\n  grid: DashboardLayout['grid']\n): DashboardItem | undefined {\n  const geometry = orient(item, grid.flow);\n  if (geometry.columnSpan > grid.tracks) return undefined;\n\n  const placed = occupied.map(other => orient(other, grid.flow));\n  const rows = [...new Set([0, ...placed.map(other => other.row + other.rowSpan)])].sort((a, b) => a - b);\n  const columns = [...new Set([0, ...placed.map(other => other.column + other.columnSpan)])].sort((a, b) => a - b);\n\n  for (const row of rows) {\n    for (const column of columns) {\n      const candidate = { ...geometry, column, row };\n      if (\n        column + geometry.columnSpan <= grid.tracks &&\n        isDashboardGridPlacement(candidate) &&\n        placed.every(other => !doDashboardGridGeometriesOverlap(candidate, other))\n      ) {\n        return { id: item.id, ...orient(candidate, grid.flow) };\n      }\n    }\n  }\n\n  return undefined;\n}\n\n/** Resolves directional placement collisions and optionally settles supplied panels toward the growth-axis origin. */\nexport function placeDashboard(\n  layout: DashboardLayout,\n  panels: readonly DashboardSpanConstraints[],\n  request: {\n    readonly id: string;\n    readonly intent: DashboardIntent;\n    readonly autoSettle?: boolean;\n  }\n): DashboardLayout | undefined {\n  const { id, intent } = request;\n  const requested = intent.geometry;\n  const source = layout.items.find(item => item.id === id);\n  const constraint = panels.find(panel => panel.id === id);\n  const desired = orient(requested, layout.grid.flow);\n  if (!source || !constraint || !isPlacementValid(requested, constraint)) {\n    return undefined;\n  }\n  if (desired.column + desired.columnSpan > layout.grid.tracks) return undefined;\n\n  const ids = new Set(panels.map(panel => panel.id));\n  const active = layout.items.filter(item => ids.has(item.id)).map(item => orientDashboardItem(item, layout.grid.flow));\n  const oriented = normalizePlacementIntent(intent, source, layout.grid.flow);\n  const packed = findNormalizedPlacementPlan(\n    active,\n    { id, intent: oriented },\n    { tracks: layout.grid.tracks, autoSettle: request.autoSettle }\n  );\n  if (!packed) return undefined;\n\n  const positions = new Map(packed.map(item => [item.id, orientDashboardItem(item, layout.grid.flow)]));\n\n  return {\n    ...layout,\n    items: layout.items.map(item => positions.get(item.id) ?? item)\n  };\n}\n\nfunction normalizePlacementIntent(\n  intent: DashboardIntent,\n  source: DashboardItem,\n  flow: DashboardLayout['grid']['flow']\n): DashboardIntent {\n  if (intent.kind === 'start') return orientIntent(intent, flow);\n\n  const geometry = orient(intent.geometry, flow);\n  if (source.columnSpan !== intent.geometry.columnSpan || source.rowSpan !== intent.geometry.rowSpan) {\n    return { kind: 'resize', geometry };\n  }\n\n  return intent.kind === 'resize' ? { kind: 'coordinate', geometry } : orientIntent(intent, flow);\n}\n\n/** Normalizes placement intents to vertical growth coordinates. */\nfunction orientIntent(\n  intent: Exclude<DashboardIntent, { kind: 'resize' }>,\n  flow: DashboardLayout['grid']['flow']\n): DashboardIntent {\n  const geometry = orient(intent.geometry, flow);\n\n  const point = (value: DashboardGridPoint): DashboardGridPoint =>\n    flow === 'vertical' ? value : { column: value.row, row: value.column };\n\n  switch (intent.kind) {\n    case 'coordinate':\n      return { kind: 'coordinate', geometry };\n    case 'start':\n      return { kind: 'start', geometry };\n    case 'pointer':\n      return {\n        kind: 'pointer',\n        geometry,\n        position: {\n          aimGeometry: orient(intent.position.aimGeometry, flow),\n          pointerPosition: point(intent.position.pointerPosition),\n          spacingFraction: point(intent.position.spacingFraction)\n        }\n      };\n    case 'advance':\n      return { kind: 'advance', geometry, step: point(intent.step) };\n    default: {\n      const exhaustive: never = intent;\n      return exhaustive;\n    }\n  }\n}\n\nfunction isPlacementValid(geometry: DashboardGridPlacement, limits: DashboardSpanConstraints): boolean {\n  return (\n    isDashboardGridPlacement(geometry) &&\n    areSpanConstraintsValid(limits) &&\n    geometry.columnSpan >= limits.minColumnSpan &&\n    geometry.rowSpan >= limits.minRowSpan &&\n    geometry.columnSpan <= limits.maxColumnSpan &&\n    geometry.rowSpan <= limits.maxRowSpan\n  );\n}\n\nfunction orient(geometry: DashboardGridPlacement, flow: DashboardLayout['grid']['flow']): DashboardGridPlacement {\n  return flow === 'vertical'\n    ? { column: geometry.column, row: geometry.row, columnSpan: geometry.columnSpan, rowSpan: geometry.rowSpan }\n    : transposeDashboardGridGeometry(geometry);\n}\n\nfunction areSpanConstraintsValid(value: DashboardSpanConstraints): boolean {\n  return (\n    isSupportedGridInteger(value.minColumnSpan, 1) &&\n    isSupportedGridInteger(value.minRowSpan, 1) &&\n    isSupportedGridInteger(value.maxColumnSpan, 1) &&\n    isSupportedGridInteger(value.maxRowSpan, 1) &&\n    value.minColumnSpan <= value.maxColumnSpan &&\n    value.minRowSpan <= value.maxRowSpan\n  );\n}\n\nfunction isSupportedGridInteger(value: unknown, minimum: number): value is number {\n  return typeof value === 'number' && Number.isSafeInteger(value) && value >= minimum && value <= dashboardExtent;\n}\n\nfunction isNonNullObject(value: unknown): value is Record<string, unknown> {\n  return typeof value === 'object' && value !== null;\n}\n"],"mappings":";;;AAgBA,IAAMC,IAAkB;AAExB,SAAgBC,EAAyB,GAAiD;CAGxF,OAFKC,EAAgBC,CAAK,IAGxBC,EAAuBD,EAAM,QAAQ,CAAC,KACtCC,EAAuBD,EAAM,KAAK,CAAC,KACnCC,EAAuBD,EAAM,YAAY,CAAC,KAC1CC,EAAuBD,EAAM,SAAS,CAAC,KACvCA,EAAM,SAASA,EAAM,cAAcH,KACnCG,EAAM,MAAMA,EAAM,WAAWH,IARK;AAUtC;AAEA,SAAgBK,EAAoB,GAA4C;CAC9E,IAAI,CAACF,GAAO;CAEZ,IAAMG,IAAgB,KAAK,MAAMH,CAAK;CAEtC,AAAKD,EAAgBI,CAAI,KAAKA,EAAK,YAAY,KAAM,MAAM,QAAQA,EAAK,KAAK,KAC3EC,EAAwB;CAG1B,IAAMC,IAAOC,EAAUH,EAAK,IAAI,GAC1BI,oBAAM,IAAI,IAAY;CAG5B,OAAO;EAAE,SAAS;EAAG;EAAM,OAFbJ,EAAK,MAAM,KAAI,MAAQK,EAAUC,GAAMJ,GAAME,CAAG,CAEnC;CAAM;AACnC;AAEA,SAASD,EAAU,GAAyC;CAS1D,QAPE,CAACP,EAAgBC,CAAK,KACrBA,EAAM,SAAS,cAAcA,EAAM,SAAS,gBAC7C,CAACC,EAAuBD,EAAM,QAAQ,CAAC,MAEvCI,EAAwB,GAGnB;EAAE,MAAMJ,EAAM;EAAM,QAAQA,EAAM;CAAO;AAClD;AAEA,SAASQ,EAAU,GAAgB,GAA+B,GAAiC;CAkBjG,OAhBGT,EAAgBC,CAAK,KACrBF,EAAyBE,CAAK,KAC7B,QAAQA,KACV,OAAOA,EAAM,MAAO,YACnBA,EAAM,MACP,GAAI,IAAIA,EAAM,EAAE,KAEhBI,EAAwB,IAGrBC,EAAK,SAAS,aAAaL,EAAM,SAASA,EAAM,aAAaA,EAAM,MAAMA,EAAM,WAAWK,EAAK,UAClGD,EAAwB,GAG1BG,EAAI,IAAIP,EAAM,EAAE,GAET;EAAE,IAAIA,EAAM;EAAI,QAAQA,EAAM;EAAQ,KAAKA,EAAM;EAAK,YAAYA,EAAM;EAAY,SAASA,EAAM;CAAQ;AACpH;AAEA,SAASI,IAAiC;CACxC,MAAU,UAAU,+BAA+B;AACrD;AAEA,SAAgBM,EAAwB,GAA6C;CACnF,OAAOC,IAAS,KAAK,UAAUA,CAAM,IAAI;AAC3C;AAEA,SAAgBC,IAAgD;CAC9D,OAAO;EAAE,SAAS;EAAG,MAAM;GAAE,MAAM;GAAY,QAAQ;EAAG;EAAG,OAAO,CAAC;CAAE;AACzE;AAGA,SAAgBC,EACd,GACA,GACA,IAAkG,CAAC,GACtE;CAC7B,IAAMC,IAAY,IAAI,IAAIC,EAAO,KAAI,MAAS,CAACC,EAAM,IAAIA,CAAK,CAAC,CAAC;CAChE,IAAIF,EAAU,SAASC,EAAO,UAAUA,EAAO,MAAK,MAAS,CAACC,EAAM,EAAE,GAAG;CAEzE,IAAMC,IAAQC,EAAe;EAC3B;EACA;EACA,UAAUC,EAAQ;EAClB,QAAQA,EAAQ;CAClB,CAAC,GACKC,IAASH,KAASI,EAAmB;EAAE,GAAGJ;EAAO;EAAW,MAAMN,EAAO;EAAM,QAAQQ,EAAQ;CAAO,CAAC;CAC7G,IAAI,CAACC,GAAQ;CAEb,IAAM,EAAE,WAAQ,aAAUA,GACpBE,IAAWC,EAAO,KAAI,MAAQC,EAAoBf,GAAME,EAAO,KAAK,IAAI,CAAC,GACzEc,IAASN,EAAQ,aAAaO,EAAqBJ,CAAQ,IAAIA;CACrE,IAAI,CAACG,GAAQ;CAEb,IAAME,IAAY,IAAI,IAAIF,EAAO,KAAI,MAAQ,CAAChB,EAAK,IAAIe,EAAoBf,GAAME,EAAO,KAAK,IAAI,CAAC,CAAC,CAAC;CAEpG,OAAO;EACL,SAAS;EACT,MAAMA,EAAO;EACb,OAAOiB,EAAM,KAAI,MAAQD,EAAU,IAAIlB,EAAK,EAAE,KAAKA,CAAI;CACzD;AACF;AAEA,SAASY,EAAmB,GAMzB;CACD,IAAM,EAAE,cAAW,SAAM,WAAQ,UAAO,cAAWQ;CAEnD,KAAK,IAAMb,KAASF,EAAU,OAAO,GAAG;EACtC,IAAMgB,IAAU;GAAE,IAAId,EAAM;GAAI,QAAQ;GAAG,KAAK;GAAG,YAAY;GAAG,SAAS;EAAE,GACvEe,IAAOC,GAAQ,IAAIhB,EAAM,EAAE,IAAIc,IAAUG,EAAc;GAAE,MAAMH;GAAS,QAAQd;GAAO;GAAM;EAAO,CAAC;EAC3G,IAAI,CAACe,GAAM;EAGX,AADKC,GAAQ,IAAIhB,EAAM,EAAE,KAAGO,EAAO,KAAKQ,CAAI,GAC5CH,EAAM,KAAKG,CAAI;CACjB;CAEA,OAAO;EAAE;EAAQ;CAAM;AACzB;AAEA,SAASb,EAAe,GAKrB;CACD,IAAM,EAAE,WAAQ,cAAW,aAAU,cAAWW,GAC1CN,IAA0B,CAAC,GAC3BW,oBAAW,IAAI,IAA2B,GAC1CC,IAAaC,IACf,CAAC,GAAGzB,EAAO,MAAM,QAAO,MAAQyB,EAAS,IAAI3B,EAAK,EAAE,CAAC,GAAG,GAAGE,EAAO,MAAM,QAAO,MAAQ,CAACyB,EAAS,IAAI3B,EAAK,EAAE,CAAC,CAAC,IAC9GE,EAAO;CAEX,KAAK,IAAMM,KAASkB,GAAY;EAC9B,IAAME,IAAcvB,EAAU,IAAIG,EAAM,EAAE;EAE1C,IAAI,CAACoB,GAAa;EAElB,EAAU,OAAOpB,EAAM,EAAE;EAEzB,IAAMc,IAAOC,GAAQ,IAAIf,EAAM,EAAE,IAC7BA,IACAgB,EAAc;GAAE,MAAMhB;GAAO,QAAQoB;GAAa,MAAM1B,EAAO;GAAM;EAAO,CAAC;EACjF,IAAI,CAACoB,GAAM;EAGX,AADKC,GAAQ,IAAIf,EAAM,EAAE,KAAGM,EAAO,KAAKQ,CAAI,GAC5CG,EAAS,IAAIH,EAAK,IAAIA,CAAI;CAC5B;CAIA,OAAO;EAAE;EAAQ,OAFHpB,EAAO,MAAM,SAAQ,MAAQuB,EAAS,IAAIzB,EAAK,EAAE,KAAK,CAAC,CAEpD;CAAM;AACzB;AAEA,SAASwB,EAAc,GAKO;CAC5B,IAAM,EAAE,SAAM,WAAQ,SAAM,cAAWJ;CACvC,IAAI,CAACS,EAAwBC,CAAM,GAAG;CAEtC,IAAMC,IAAa,KAAK,IAAID,EAAO,eAAe,KAAK,IAAIA,EAAO,eAAe9B,EAAK,UAAU,CAAC,GAC3FgC,IAAU,KAAK,IAAIF,EAAO,YAAY,KAAK,IAAIA,EAAO,YAAY9B,EAAK,OAAO,CAAC,GAC/EiC,IAAY;EAAE,GAAGjC;EAAM;EAAY;CAAQ;CACjD,IAAA,GAAKJ,EAAK,SAAS,aAAamC,IAAaC,KAAWpC,EAAK,SAS7D,OAPEP,EAAyB4C,CAAS,MACjCrC,EAAK,SAAS,aAAaqC,EAAU,SAASF,IAAaE,EAAU,MAAMD,MAAYpC,EAAK,UAC7FkB,EAAO,OAAM,MAAS,CAACoB,EAAiCC,GAAOF,CAAS,CAAC,IAElEA,IAGFG,EAAsBH,GAAWnB,GAAQlB,CAAI;AACtD;AAGA,SAAgBwC,EACd,GACA,GACA,GAC2B;CAC3B,IAAMC,IAAWC,EAAOtC,GAAMJ,EAAK,IAAI;CACvC,IAAIyC,EAAS,aAAazC,EAAK,QAAQ;CAEvC,IAAM2C,IAASC,EAAS,KAAI,MAASF,EAAOH,GAAOvC,EAAK,IAAI,CAAC,GACvD6C,IAAO,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,GAAGF,EAAO,KAAI,MAASJ,EAAM,MAAMA,EAAM,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAMO,IAAIC,CAAC,GAChGC,IAAU,CAAC,mBAAG,IAAI,IAAI,CAAC,GAAG,GAAGL,EAAO,KAAI,MAASJ,EAAM,SAASA,EAAM,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAMO,IAAIC,CAAC;CAE/G,KAAK,IAAME,KAAOJ,GAChB,KAAK,IAAMK,KAAUF,GAAS;EAC5B,IAAMX,IAAY;GAAE,GAAGI;GAAU;GAAQ;EAAI;EAC7C,IACES,IAAST,EAAS,cAAczC,EAAK,UACrCP,EAAyB4C,CAAS,KAClCM,EAAO,OAAM,MAAS,CAACL,EAAiCD,GAAWE,CAAK,CAAC,GAEzE,OAAO;GAAE,IAAInC,EAAK;GAAI,GAAGsC,EAAOL,GAAWrC,EAAK,IAAI;EAAE;CAE1D;AAIJ;AAGA,SAAgBmD,EACd,GACA,GACA,GAK6B;CAC7B,IAAM,EAAE,OAAI,cAAWC,GACjBC,IAAYC,EAAO,UACnBC,IAASjD,EAAO,MAAM,MAAK,MAAQF,EAAK,OAAOoD,CAAE,GACjDC,IAAa/C,EAAO,MAAK,MAASC,EAAM,OAAO6C,CAAE,GACjDE,IAAUhB,EAAOW,GAAW/C,EAAO,KAAK,IAAI;CAIlD,IAHI,CAACiD,KAAU,CAACE,KAAc,CAACE,EAAiBN,GAAWI,CAAU,KAGjEC,EAAQ,SAASA,EAAQ,aAAapD,EAAO,KAAK,QAAQ;CAE9D,IAAMJ,IAAM,IAAI,IAAIQ,EAAO,KAAI,MAASC,EAAM,EAAE,CAAC,GAC3CO,IAASZ,EAAO,MAAM,QAAO,MAAQJ,EAAI,IAAIE,EAAK,EAAE,CAAC,CAAC,CAAC,KAAI,MAAQe,EAAoBf,GAAME,EAAO,KAAK,IAAI,CAAC,GAC9GW,IAAW2C,EAAyBN,GAAQC,GAAQjD,EAAO,KAAK,IAAI,GACpEc,IAASyC,EACb3C,GACA;EAAE;EAAI,QAAQD;CAAS,GACvB;EAAE,QAAQX,EAAO,KAAK;EAAQ,YAAY8C,EAAQ;CAAW,CAC/D;CACA,IAAI,CAAChC,GAAQ;CAEb,IAAME,IAAY,IAAI,IAAIF,EAAO,KAAI,MAAQ,CAAChB,EAAK,IAAIe,EAAoBf,GAAME,EAAO,KAAK,IAAI,CAAC,CAAC,CAAC;CAEpG,OAAO;EACL,GAAGA;EACH,OAAOA,EAAO,MAAM,KAAI,MAAQgB,EAAU,IAAIlB,EAAK,EAAE,KAAKA,CAAI;CAChE;AACF;AAEA,SAASwD,EACP,GACA,GACA,GACiB;CACjB,IAAIN,EAAO,SAAS,SAAS,OAAOQ,EAAaR,GAAQS,CAAI;CAE7D,IAAMtB,IAAWC,EAAOY,EAAO,UAAUS,CAAI;CAK7C,OAJIR,EAAO,eAAeD,EAAO,SAAS,cAAcC,EAAO,YAAYD,EAAO,SAAS,UAClF;EAAE,MAAM;EAAU;CAAS,IAG7BA,EAAO,SAAS,WAAW;EAAE,MAAM;EAAc;CAAS,IAAIQ,EAAaR,GAAQS,CAAI;AAChG;AAGA,SAASD,EACP,GACA,GACiB;CACjB,IAAMrB,IAAWC,EAAOY,EAAO,UAAUS,CAAI,GAEvCC,KAAS,MACbD,MAAS,aAAapE,IAAQ;EAAE,QAAQA,EAAM;EAAK,KAAKA,EAAM;CAAO;CAEvE,QAAQ2D,EAAO,MAAf;EACE,KAAK,cACH,OAAO;GAAE,MAAM;GAAc;EAAS;EACxC,KAAK,SACH,OAAO;GAAE,MAAM;GAAS;EAAS;EACnC,KAAK,WACH,OAAO;GACL,MAAM;GACN;GACA,UAAU;IACR,aAAaZ,EAAOY,EAAO,SAAS,aAAaS,CAAI;IACrD,iBAAiBC,EAAMV,EAAO,SAAS,eAAe;IACtD,iBAAiBU,EAAMV,EAAO,SAAS,eAAe;GACxD;EACF;EACF,KAAK,WACH,OAAO;GAAE,MAAM;GAAW;GAAU,MAAMU,EAAMV,EAAO,IAAI;EAAE;EAC/D,SAEE,OAAO/D;CAEX;AACF;AAEA,SAASoE,EAAiB,GAAkC,GAA2C;CACrG,OACElE,EAAyBgD,CAAQ,KACjCR,EAAwBC,CAAM,KAC9BO,EAAS,cAAcP,EAAO,iBAC9BO,EAAS,WAAWP,EAAO,cAC3BO,EAAS,cAAcP,EAAO,iBAC9BO,EAAS,WAAWP,EAAO;AAE/B;AAEA,SAASQ,EAAO,GAAkC,GAA+D;CAC/G,OAAOqB,MAAS,aACZ;EAAE,QAAQtB,EAAS;EAAQ,KAAKA,EAAS;EAAK,YAAYA,EAAS;EAAY,SAASA,EAAS;CAAQ,IACzGwB,EAA+BxB,CAAQ;AAC7C;AAEA,SAASR,EAAwB,GAA0C;CACzE,OACErC,EAAuBD,EAAM,eAAe,CAAC,KAC7CC,EAAuBD,EAAM,YAAY,CAAC,KAC1CC,EAAuBD,EAAM,eAAe,CAAC,KAC7CC,EAAuBD,EAAM,YAAY,CAAC,KAC1CA,EAAM,iBAAiBA,EAAM,iBAC7BA,EAAM,cAAcA,EAAM;AAE9B;AAEA,SAASC,EAAuB,GAAgB,GAAkC;CAChF,OAAO,OAAOD,KAAU,YAAY,OAAO,cAAcA,CAAK,KAAKA,KAASuE,KAAWvE,KAASH;AAClG;AAEA,SAASE,EAAgB,GAAkD;CACzE,OAAO,OAAOC,KAAU,cAAYA;AACtC"}

package/dist/dashboard/utils/movement.utils.d.ts

@@ -0,0 +1,7 @@
+import type { DashboardGridPlacement, DashboardLayout } from '../dashboard.types.js';
+export interface DashboardMovementRequest {
+    readonly id: string;
+    readonly geometry: DashboardGridPlacement;
+}
+/** Snaps the carried rectangle to bounded grid coordinates; layout planning resolves its destination. */
+export declare function resolveDashboardTarget(layout: DashboardLayout, request: DashboardMovementRequest): DashboardGridPlacement | undefined;

package/dist/dashboard/utils/movement.utils.js

@@ -0,0 +1,15 @@
+// src/dashboard/utils/movement.utils.ts
+function e(e, t) {
+	let n = e.items.find((e) => e.id === t.id);
+	if (!n) return;
+	let r = e.grid.flow === "vertical" ? "column" : "row", i = r === "column" ? "columnSpan" : "rowSpan", a = {
+		column: Math.max(0, Math.round(t.geometry.column)),
+		row: Math.max(0, Math.round(t.geometry.row)),
+		columnSpan: n.columnSpan,
+		rowSpan: n.rowSpan
+	};
+	return a[r] = Math.min(e.grid.tracks - n[i], a[r]), a;
+}
+export { e as resolveDashboardTarget };
+
+//# sourceMappingURL=movement.utils.js.map

package/dist/dashboard/utils/movement.utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"movement.utils.js","names":["resolveDashboardTarget","source","layout","item","request","bounded","span","chosen"],"sources":["../../../src/dashboard/utils/movement.utils.ts"],"sourcesContent":["// SPDX-FileCopyrightText: Copyright (c) 2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.\n// SPDX-License-Identifier: Apache-2.0\n\nimport type { DashboardGridPlacement, DashboardLayout } from '../dashboard.types.js';\n\nexport interface DashboardMovementRequest {\n  readonly id: string;\n  readonly geometry: DashboardGridPlacement;\n}\n\n/** Snaps the carried rectangle to bounded grid coordinates; layout planning resolves its destination. */\nexport function resolveDashboardTarget(\n  layout: DashboardLayout,\n  request: DashboardMovementRequest\n): DashboardGridPlacement | undefined {\n  const source = layout.items.find(item => item.id === request.id);\n  if (!source) return undefined;\n\n  const bounded = layout.grid.flow === 'vertical' ? 'column' : 'row';\n  const span = bounded === 'column' ? 'columnSpan' : 'rowSpan';\n  const chosen = {\n    column: Math.max(0, Math.round(request.geometry.column)),\n    row: Math.max(0, Math.round(request.geometry.row)),\n    columnSpan: source.columnSpan,\n    rowSpan: source.rowSpan\n  };\n\n  chosen[bounded] = Math.min(layout.grid.tracks - source[span], chosen[bounded]);\n\n  return chosen;\n}\n"],"mappings":";AAWA,SAAgBA,EACd,GACA,GACoC;CACpC,IAAMC,IAASC,EAAO,MAAM,MAAK,MAAQC,EAAK,OAAOC,EAAQ,EAAE;CAC/D,IAAI,CAACH,GAAQ;CAEb,IAAMI,IAAUH,EAAO,KAAK,SAAS,aAAa,WAAW,OACvDI,IAAOD,MAAY,WAAW,eAAe,WAC7CE,IAAS;EACb,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAMH,EAAQ,SAAS,MAAM,CAAC;EACvD,KAAK,KAAK,IAAI,GAAG,KAAK,MAAMA,EAAQ,SAAS,GAAG,CAAC;EACjD,YAAYH,EAAO;EACnB,SAASA,EAAO;CAClB;CAIA,OAFA,EAAOI,KAAW,KAAK,IAAIH,EAAO,KAAK,SAASD,EAAOK,IAAOC,EAAOF,EAAQ,GAEtEE;AACT"}

package/dist/dashboard/utils/mutation.utils.d.ts

@@ -0,0 +1,2 @@
+export declare function isDashboardCatalogueMutation(host: HTMLElement, record: MutationRecord): boolean;
+export declare function isDashboardTitleMutation(host: HTMLElement, record: MutationRecord): boolean;

package/dist/dashboard/utils/mutation.utils.js

@@ -0,0 +1,19 @@
+import { matchesElementName as e } from "../../internal/utils/dom.js";
+import { DashboardPanel as t } from "../panel/panel2.js";
+// src/dashboard/utils/mutation.utils.ts
+function n(n, r) {
+	return r.attributeName === "slot" ? i(n, r.target) : r.target === n && r.type === "childList" ? [...r.addedNodes, ...r.removedNodes].some((n) => n instanceof Element && e(n, t)) : r.target === n || r.type === "attributes" && i(n, r.target);
+}
+function r(e, t) {
+	if (t.type === "childList" && i(e, t.target)) return [...t.addedNodes, ...t.removedNodes].some((e) => e instanceof Element && e.localName === "nve-dashboard-panel-header");
+	let n = t.target instanceof Element ? t.target : t.target.parentElement;
+	if (!n) return !1;
+	let r = t.attributeName === "slot" ? n.parentElement : n.closest("nve-dashboard-panel-header");
+	return r?.localName === "nve-dashboard-panel-header" && r.parentElement?.parentElement === e;
+}
+function i(n, r) {
+	return r instanceof Element && e(r, t) && r.parentElement === n;
+}
+export { n as isDashboardCatalogueMutation, r as isDashboardTitleMutation };
+
+//# sourceMappingURL=mutation.utils.js.map

package/dist/dashboard/utils/mutation.utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mutation.utils.js","names":["isDashboardCatalogueMutation","record","isDirectDashboardPanel","host","node","matchesElementName","DashboardPanel","isDashboardTitleMutation","element","header"],"sources":["../../../src/dashboard/utils/mutation.utils.ts"],"sourcesContent":["// SPDX-FileCopyrightText: Copyright (c) 2026 NVIDIA CORPORATION & AFFILIATES. All rights reserved.\n// SPDX-License-Identifier: Apache-2.0\n\nimport { matchesElementName } from '@nvidia-elements/core/internal';\n\nimport { DashboardPanel } from '../panel/panel.js';\n\nexport function isDashboardCatalogueMutation(host: HTMLElement, record: MutationRecord) {\n  if (record.attributeName === 'slot') return isDirectDashboardPanel(host, record.target);\n\n  if (record.target === host && record.type === 'childList') {\n    return [...record.addedNodes, ...record.removedNodes].some(\n      node => node instanceof Element && matchesElementName(node, DashboardPanel)\n    );\n  }\n\n  return record.target === host || (record.type === 'attributes' && isDirectDashboardPanel(host, record.target));\n}\n\nexport function isDashboardTitleMutation(host: HTMLElement, record: MutationRecord) {\n  if (record.type === 'childList' && isDirectDashboardPanel(host, record.target)) {\n    return [...record.addedNodes, ...record.removedNodes].some(\n      node => node instanceof Element && node.localName === 'nve-dashboard-panel-header'\n    );\n  }\n\n  const element = record.target instanceof Element ? record.target : record.target.parentElement;\n  if (!element) return false;\n\n  const header =\n    record.attributeName === 'slot' ? element.parentElement : element.closest('nve-dashboard-panel-header');\n\n  return header?.localName === 'nve-dashboard-panel-header' && header.parentElement?.parentElement === host;\n}\n\nfunction isDirectDashboardPanel(host: HTMLElement, node: Node): boolean {\n  return node instanceof Element && matchesElementName(node, DashboardPanel) && node.parentElement === host;\n}\n"],"mappings":";;;AAOA,SAAgBA,EAA6B,GAAmB,GAAwB;CAStF,OARIC,EAAO,kBAAkB,SAAeC,EAAuBC,GAAMF,EAAO,MAAM,IAElFA,EAAO,WAAWE,KAAQF,EAAO,SAAS,cACrC,CAAC,GAAGA,EAAO,YAAY,GAAGA,EAAO,YAAY,CAAC,CAAC,MACpD,MAAQG,aAAgB,WAAWC,EAAmBD,GAAME,CAAc,CAC5E,IAGKL,EAAO,WAAWE,KAASF,EAAO,SAAS,gBAAgBC,EAAuBC,GAAMF,EAAO,MAAM;AAC9G;AAEA,SAAgBM,EAAyB,GAAmB,GAAwB;CAClF,IAAIN,EAAO,SAAS,eAAeC,EAAuBC,GAAMF,EAAO,MAAM,GAC3E,OAAO,CAAC,GAAGA,EAAO,YAAY,GAAGA,EAAO,YAAY,CAAC,CAAC,MACpD,MAAQG,aAAgB,WAAWA,EAAK,cAAc,4BACxD;CAGF,IAAMI,IAAUP,EAAO,kBAAkB,UAAUA,EAAO,SAASA,EAAO,OAAO;CACjF,IAAI,CAACO,GAAS,OAAO;CAErB,IAAMC,IACJR,EAAO,kBAAkB,SAASO,EAAQ,gBAAgBA,EAAQ,QAAQ,4BAA4B;CAExG,OAAOC,GAAQ,cAAc,gCAAgCA,EAAO,eAAe,kBAAkBN;AACvG;AAEA,SAASD,EAAuB,GAAmB,GAAqB;CACtE,OAAOE,aAAgB,WAAWC,EAAmBD,GAAME,CAAc,KAAKF,EAAK,kBAAkBD;AACvG"}

package/dist/dashboard/utils/packing.utils.d.ts

@@ -0,0 +1,13 @@
+import type { DashboardIntent } from './intent.types.js';
+import type { DashboardItem, DashboardLayout } from '../dashboard.types.js';
+/** Applies top gravity without moving panels through an overhanging predecessor. Coordinates are growth-normalized. */
+export declare function settleDashboardItems(items: readonly DashboardItem[]): DashboardItem[] | undefined;
+/** Resolves directional collisions into vacated space, with optional final top-gravity normalization. */
+export declare function findNormalizedPlacementPlan(items: readonly DashboardItem[], request: {
+    readonly id: string;
+    readonly intent: DashboardIntent;
+}, options: {
+    tracks: number;
+    autoSettle?: boolean;
+}): DashboardItem[] | undefined;
+export declare function orientDashboardItem(item: DashboardItem, flow: DashboardLayout['grid']['flow']): DashboardItem;

package/dist/dashboard/utils/packing.utils.js

@@ -0,0 +1,421 @@
+import { doDashboardGridGeometriesOverlap as e, transposeDashboardGridGeometry as t } from "./geometry.utils.js";
+// src/dashboard/utils/packing.utils.ts
+function n(e) {
+	return e !== void 0;
+}
+var r = 1e6;
+function i(e) {
+	let t = [];
+	for (let n of [...e].sort(M)) {
+		let e = 0;
+		for (let r of t) n.column < r.column + r.columnSpan && n.column + n.columnSpan > r.column && (e = Math.max(e, r.row + r.rowSpan));
+		if (e + n.rowSpan > r) return;
+		t.push({
+			...n,
+			row: e
+		});
+	}
+	return t;
+}
+function a(e, t, n) {
+	let r = e.find((e) => e.id === t.id);
+	if (!r) return;
+	let i = h(N({
+		items: e,
+		source: r,
+		...n
+	}, t.intent), n.autoSettle);
+	return i && [...i];
+}
+function o(e, t, n) {
+	let r = s(e, t, n), i = n ? n[r] : t[r] - e[r];
+	return {
+		movementAxis: r,
+		perpendicularAxis: r === "column" ? "row" : "column",
+		movementSpanKey: r === "column" ? "columnSpan" : "rowSpan",
+		perpendicularSpanKey: r === "column" ? "rowSpan" : "columnSpan",
+		direction: i >= 0 ? 1 : -1
+	};
+}
+function s(e, t, n) {
+	return n ? n.column ? "column" : "row" : Math.abs(t.column - e.column) > Math.abs(t.row - e.row) ? "column" : "row";
+}
+function c(e, t, n) {
+	return {
+		column: Math.max(0, Math.min(n - e.columnSpan, Math.round(t.column))),
+		row: Math.max(0, Math.min(r - e.rowSpan, Math.round(t.row))),
+		columnSpan: e.columnSpan,
+		rowSpan: e.rowSpan
+	};
+}
+function l(e, t) {
+	return e.column === t.column && e.row === t.row && e.columnSpan === t.columnSpan && e.rowSpan === t.rowSpan;
+}
+function u(e, t, n) {
+	return e.items.filter((e) => e.id !== n.id && t.some((t) => t.id === e.id && (t.column !== e.column || t.row !== e.row || t.columnSpan !== e.columnSpan || t.rowSpan !== e.rowSpan)));
+}
+function d(e, t) {
+	return {
+		items: e.map((e) => ({ ...e })),
+		placedItem: { ...t },
+		priority: 1,
+		skipSettling: !0
+	};
+}
+function f(e) {
+	let t = /* @__PURE__ */ new Map();
+	for (let n of e) {
+		let e = JSON.stringify(n.items.map((e) => [
+			e.id,
+			e.column,
+			e.row,
+			e.columnSpan,
+			e.rowSpan
+		])), r = t.get(e);
+		(!r || n.priority < r.priority) && t.set(e, n);
+	}
+	return [...t.values()];
+}
+function p(e, t, n) {
+	let { items: r, source: i } = t, { movementAxis: a, perpendicularAxis: o, perpendicularSpanKey: s, direction: c } = n, l = e.map((e) => ({
+		...e,
+		quiet: u(e, r, i).every((e) => e[o] >= i[o] && e[o] + e[s] <= i[o] + i[s])
+	}));
+	return l.some((e) => e.quiet && (e.placedItem[a] - i[a]) * c > 0) ? l.filter((e) => e.quiet) : l;
+}
+function m(e, t) {
+	let { source: r, aimGeometry: i, context: a, step: o, autoSettle: s } = t, { movementAxis: c, direction: u } = a, d = o ? e.map((e) => E(e, {
+		source: r,
+		step: o,
+		autoSettle: s
+	})).filter(n) : e.map((e) => ({
+		...e,
+		distance: (e.placedItem.column - i.column) ** 2 + (e.placedItem.row - i.row) ** 2,
+		rankCoordinate: e.placedItem[c]
+	}));
+	return d.sort((e, t) => e.distance - t.distance || u * (t.rankCoordinate - e.rankCoordinate) || (l(e.placedItem, t.placedItem) ? e.priority - t.priority : 0)), d[0];
+}
+function h(e, t) {
+	if (e) return e.skipSettling || !t ? e.items : i(e.items);
+}
+function g(e, t, n) {
+	let { pointerPosition: r, spacingFraction: i } = n;
+	return r && e.find((e) => e.id !== t.id && r.column >= e.column && r.column < e.column + e.columnSpan - (i?.column ?? 0) && r.row >= e.row && r.row < e.row + e.rowSpan - (i?.row ?? 0));
+}
+function _(e, t, n) {
+	let r = e.filter((e) => e.id !== t.id).map((e) => ({
+		peer: e,
+		coverage: Math.max(0, Math.min(n.column + t.columnSpan, e.column + e.columnSpan) - Math.max(n.column, e.column)) * Math.max(0, Math.min(n.row + t.rowSpan, e.row + e.rowSpan) - Math.max(n.row, e.row)) / (Math.min(t.columnSpan, e.columnSpan) * Math.min(t.rowSpan, e.rowSpan))
+	})).filter((e) => e.coverage >= .5);
+	return r.sort((e, t) => t.coverage - e.coverage || M(e.peer, t.peer)), r[0]?.peer;
+}
+function v(e, t, n) {
+	let { movementAxis: r, perpendicularAxis: i, movementSpanKey: a, perpendicularSpanKey: o } = n;
+	return !!t && e[r] <= t[r] + t[a] && e[r] + e[a] >= t[r] && e[i] < t[i] + t[o] && e[i] + e[o] > t[i];
+}
+function y(t, n) {
+	let { items: r, source: i, tracks: a } = t, o = {
+		...n,
+		id: i.id
+	}, s = r.map((e) => e.id === i.id ? o : e);
+	if (r.every((t) => t.id === i.id || !e(t, o)) && k(s, a)) return {
+		items: s,
+		placedItem: o,
+		priority: 1
+	};
+}
+function b(e, t, n = {}) {
+	let { items: r, source: i, tracks: a, autoSettle: s } = e;
+	if (l(i, t)) return d(r, i);
+	let u = g(r, i, n);
+	if (u && u.columnSpan === i.columnSpan && u.rowSpan === i.rowSpan) return R(e, u) ?? d(r, i);
+	let h = o(i, t), v = c(i, t, a);
+	if (!u) {
+		let t = y(e, v);
+		if (t) return t;
+	}
+	let b = u ?? _(r, i, t), C = x(e, v, {
+		contact: b,
+		context: h
+	}).filter((t) => S(t, e, {
+		literal: v,
+		contact: b,
+		context: h
+	}));
+	return C.push(d(r, i)), m(p(f(C), e, h), {
+		source: i,
+		aimGeometry: t,
+		context: h,
+		autoSettle: s
+	});
+}
+function x(e, t, n) {
+	let { source: i, tracks: a } = e, { context: o } = n;
+	return f(L(i, t, n).filter((e) => e.column >= 0 && e.row >= 0 && e.column + e.columnSpan <= a && e.row + e.rowSpan <= r).flatMap((t) => w(e, t, o)));
+}
+function S(e, t, n) {
+	let { literal: r, contact: i, context: a } = n;
+	return l(e.placedItem, r) ? !0 : u(e, t.items, t.source).length > 0 && v(e.placedItem, i, a);
+}
+function C(e, t) {
+	let { items: n, source: r, autoSettle: i } = e, a = t.kind === "pointer" ? t.position.aimGeometry : t.geometry;
+	if (t.kind !== "advance" && l(r, a)) return d(n, r);
+	if (t.kind !== "advance") return b(e, a, t.kind === "pointer" ? t.position : void 0);
+	let { step: s } = t, c = o(r, t.geometry, s);
+	return m(p(f(w(e, t.geometry, c)), e, c), {
+		source: r,
+		aimGeometry: t.geometry,
+		context: c,
+		step: s,
+		autoSettle: i
+	});
+}
+function w(e, t, n) {
+	let { source: r } = e, { movementAxis: i, perpendicularAxis: a, perpendicularSpanKey: o, direction: s } = n;
+	if ((t[i] - r[i]) * s < 0) return [];
+	let c = Math.max(r[a], t[a]), l = Math.min(r[a] + r[o], t[a] + t[o]), u = T(e, t, n);
+	if (c >= l) {
+		let n = R(e, t);
+		n && u.push(n);
+	} else u.push(...z(e, t, n));
+	return u;
+}
+function T(e, t, n) {
+	let { items: i, source: a, tracks: o } = e, { movementAxis: s, movementSpanKey: c, direction: l } = n, u = (s === "column" ? o : r) - a[c], d = U(H(i.filter((e) => e.id !== a.id), t, n), u, a[c]), f = [];
+	for (let e of d) {
+		let n = Math.max(0, e[0], l > 0 ? a[s] : 0), r = Math.min(u, e[1], l < 0 ? a[s] : u);
+		if (n > r) continue;
+		let c = {
+			...t,
+			id: a.id,
+			[s]: Math.max(n, Math.min(r, t[s]))
+		}, d = i.map((e) => e.id === a.id ? c : e);
+		k(d, o) && f.push({
+			items: d,
+			placedItem: c,
+			priority: 1
+		});
+	}
+	return f;
+}
+function E(e, t) {
+	let { source: n, step: r, autoSettle: a } = t, o = a ? i(e.items) : e.items, s = o?.find((e) => e.id === n.id), c = r.column ? "column" : "row", l = r[c];
+	if (!(!o || !s || (s[c] - n[c]) * l <= 0)) return {
+		...e,
+		items: o,
+		skipSettling: !0,
+		distance: Math.abs(s[c] - n[c]),
+		rankCoordinate: s[c]
+	};
+}
+function D(e, t, n) {
+	let r = new Map(e.map((e) => [e.id, { ...e }])), i = [...t];
+	for (let a = 0; a < i.length; a++) {
+		if (a >= e.length * e.length + e.length) return;
+		let o = i[a], s = o === void 0 ? void 0 : r.get(o);
+		if (!s) return;
+		let c = W(s, [...r.values()], {
+			...n,
+			protectedIds: t
+		});
+		if (!c) return;
+		for (let e of c) r.set(e.id, e), i.push(e.id);
+	}
+	return [...r.values()];
+}
+function O(e, t) {
+	return t.column >= e.column && t.row >= e.row && t.column + t.columnSpan <= e.column + e.columnSpan && t.row + t.rowSpan <= e.row + e.rowSpan;
+}
+function k(t, n) {
+	return t.every((i, a) => i.column >= 0 && i.row >= 0 && i.column + i.columnSpan <= n && i.row + i.rowSpan <= r && t.slice(a + 1).every((t) => !e(i, t)));
+}
+function A(e, t) {
+	return {
+		id: e.id,
+		...j(e, t)
+	};
+}
+function j(e, n) {
+	return n === "vertical" ? {
+		column: e.column,
+		row: e.row,
+		columnSpan: e.columnSpan,
+		rowSpan: e.rowSpan
+	} : t(e);
+}
+function M(e, t) {
+	return e.row - t.row || e.column - t.column || (e.id < t.id ? -1 : +(e.id > t.id));
+}
+function N(e, t) {
+	switch (t.kind) {
+		case "start": return P(e, t.geometry);
+		case "resize": return F(e, t.geometry);
+		case "coordinate":
+		case "pointer":
+		case "advance": return C(e, t);
+		default: return t;
+	}
+}
+function P(e, t) {
+	let { items: n, source: r, tracks: i } = e, a = {
+		...t,
+		id: r.id,
+		columnSpan: r.columnSpan,
+		rowSpan: r.rowSpan,
+		row: 0
+	}, o = y(e, a);
+	if (o) return o;
+	let s = n.filter((e) => e.id !== r.id), c = s.length ? Math.min(...s.map((e) => e.row)) : r.rowSpan, l = Math.max(0, r.rowSpan - c), u = n.map((e) => e.id === r.id ? a : {
+		...e,
+		row: e.row + l
+	});
+	return k(u, i) ? { items: u } : void 0;
+}
+function F(e, t) {
+	let { items: n, source: r, tracks: i } = e, a = {
+		id: r.id,
+		...t
+	}, o = n.map((e) => e.id === r.id ? a : e), s = I(r, a);
+	if (!s) return k(o, i) ? { items: o } : void 0;
+	let c = D(o, /* @__PURE__ */ new Set([r.id]), {
+		movementAxis: s.movementAxis,
+		direction: s.direction,
+		tracks: i
+	});
+	return c && !k(c, i) && (c = void 0), c || s.movementAxis === "row" && s.direction === 1 || (c = D(o, /* @__PURE__ */ new Set([r.id]), {
+		movementAxis: "row",
+		direction: 1,
+		tracks: i
+	})), c && k(c, i) ? { items: c } : void 0;
+}
+function I(e, t) {
+	let n = [
+		{
+			movementAxis: "column",
+			direction: -1,
+			amount: e.column - t.column
+		},
+		{
+			movementAxis: "column",
+			direction: 1,
+			amount: t.column + t.columnSpan - e.column - e.columnSpan
+		},
+		{
+			movementAxis: "row",
+			direction: -1,
+			amount: e.row - t.row
+		},
+		{
+			movementAxis: "row",
+			direction: 1,
+			amount: t.row + t.rowSpan - e.row - e.rowSpan
+		}
+	].filter((e) => e.amount > 0);
+	return n.sort((e, t) => t.amount - e.amount || +(t.movementAxis === "row") - (e.movementAxis === "row") || t.direction - e.direction), n[0];
+}
+function L(e, t, n) {
+	let { contact: r, context: i } = n, a = [t];
+	if (!r) return a;
+	for (let n of [
+		r[i.movementAxis],
+		r[i.movementAxis] + r[i.movementSpanKey] - e[i.movementSpanKey],
+		r[i.movementAxis] - e[i.movementSpanKey],
+		r[i.movementAxis] + r[i.movementSpanKey]
+	]) a.push({
+		...t,
+		[i.movementAxis]: n
+	});
+	return a;
+}
+function R(t, n) {
+	let { items: r, source: i, tracks: a } = t, o = r.filter((t) => t.id !== i.id && e(t, n));
+	if (!o.length || !o.every((e) => O(n, e))) return;
+	let s = new Set(o.map((e) => e.id)), c = {
+		...n,
+		id: i.id
+	}, l = r.map((e) => e.id === i.id ? c : s.has(e.id) ? {
+		...e,
+		column: e.column + i.column - n.column,
+		row: e.row + i.row - n.row
+	} : e);
+	return k(l, a) ? {
+		items: l,
+		placedItem: c,
+		priority: 0
+	} : void 0;
+}
+function z(e, t, r) {
+	let { items: i, source: a } = e, { movementAxis: o, perpendicularAxis: s, movementSpanKey: c, perpendicularSpanKey: l, direction: u } = r, d = Math.max(a[s], t[s]), f = Math.min(a[s] + a[l], t[s] + t[l]), p = i.filter((e) => e.id !== a.id && e[s] < f && e[s] + e[l] > d && (u > 0 ? e[o] >= a[o] + a[c] : e[o] + e[c] <= a[o]));
+	return [null, ...new Set(p.map((e) => u > 0 ? e[o] + e[c] : e[o]))].map((n) => B(e, {
+		target: t,
+		context: r,
+		ahead: p,
+		frontier: n
+	})).filter(n);
+}
+function B(e, t) {
+	let { items: n, source: r, tracks: i } = e, { target: a, context: o, ahead: s, frontier: c } = t, { movementAxis: l, movementSpanKey: u, direction: d } = o, f = c === null ? [] : s.filter((e) => d > 0 ? e[l] + e[u] <= c : e[l] >= c), p = new Set(f.map((e) => e.id)), { lo: m, hi: h, shift: g } = V(e, {
+		crossed: f,
+		remaining: s.filter((e) => !p.has(e.id)),
+		context: o
+	});
+	if (m > h) return;
+	let _ = {
+		...a,
+		id: r.id,
+		[l]: Math.max(m, Math.min(h, a[l]))
+	}, v = /* @__PURE__ */ new Set([r.id, ...p]), y = D(n.map((e) => e.id === r.id ? _ : p.has(e.id) ? {
+		...e,
+		[l]: e[l] + g
+	} : e), v, {
+		movementAxis: l,
+		direction: d === 1 ? -1 : 1,
+		tracks: i
+	});
+	return y && k(y, i) ? {
+		items: y,
+		placedItem: _,
+		priority: 0
+	} : void 0;
+}
+function V(e, t) {
+	let { source: n, tracks: i } = e, { crossed: a, remaining: o, context: s } = t, { movementAxis: c, movementSpanKey: l, direction: u } = s;
+	return u > 0 ? {
+		lo: Math.max(n[c], a.length ? Math.max(...a.map((e) => e[c] + e[l])) - n[l] : n[c]),
+		hi: Math.min(c === "column" ? i - n[l] : r - n[l], o.length ? Math.min(...o.map((e) => e[c])) - n[l] : Infinity),
+		shift: a.length ? n[c] - Math.min(...a.map((e) => e[c])) : 0
+	} : {
+		lo: Math.max(0, o.length ? Math.max(...o.map((e) => e[c] + e[l])) : 0),
+		hi: Math.min(n[c], a.length ? Math.min(...a.map((e) => e[c])) : n[c]),
+		shift: a.length ? n[c] + n[l] - Math.max(...a.map((e) => e[c] + e[l])) : 0
+	};
+}
+function H(e, t, n) {
+	let { movementAxis: r, perpendicularAxis: i, movementSpanKey: a, perpendicularSpanKey: o } = n, s = e.filter((e) => e[i] < t[i] + t[o] && e[i] + e[o] > t[i]).map((e) => [e[r], e[r] + e[a]]).sort((e, t) => e[0] - t[0] || e[1] - t[1]), c = [];
+	for (let e of s) {
+		let t = c.at(-1);
+		t && e[0] <= t[1] ? t[1] = Math.max(t[1], e[1]) : c.push([e[0], e[1]]);
+	}
+	return c;
+}
+function U(e, t, n) {
+	let r = [], i = 0;
+	for (let t of e) i <= t[0] - n && r.push([i, t[0] - n]), i = Math.max(i, t[1]);
+	return i <= t && r.push([i, t]), r;
+}
+function W(t, n, i) {
+	let { movementAxis: a, direction: o, tracks: s, protectedIds: c } = i, l = a === "column" ? "columnSpan" : "rowSpan", u = n.filter((n) => n.id !== t.id && e(n, t)).sort((e, t) => o * (e[a] - t[a]) || M(e, t)), d = [];
+	for (let e of u) {
+		if (c.has(e.id)) return;
+		let n = {
+			...e,
+			[a]: o < 0 ? t[a] - e[l] : t[a] + t[l]
+		};
+		if (n.column < 0 || n.row < 0 || n.column + n.columnSpan > s || n.row + n.rowSpan > r) return;
+		d.push(n);
+	}
+	return d;
+}
+export { a as findNormalizedPlacementPlan, A as orientDashboardItem, i as settleDashboardItems };
+
+//# sourceMappingURL=packing.utils.js.map