@cube-dev/ui-kit 0.0.0-canary-c325dcb → 0.0.0-canary-162cdb3

package/dist/components/layout/Board/grid-core/layout.js

@@ -1,186 +0,0 @@
-/** @license MIT | @cube-dev/ui-kit v0.0.0-canary-c325dcb | Cube Dev Team */
-import { getAllCollisions, getFirstCollision } from "./collision.js";
-import { sortLayoutItems } from "./sort.js";
-
-//#region src/components/layout/Board/grid-core/layout.ts
-/**
-* Core layout manipulation utilities.
-*
-* Vendored from react-grid-layout v2 (`src/core/layout.ts`).
-* See ./NOTICE.md for attribution and license.
-*
-* These functions create, modify, and query grid layouts. Most functions treat
-* layouts as immutable and return new arrays/objects, but a few mutate items in
-* place for performance (documented per function).
-*/
-/**
-* Get the bottom-most Y coordinate of the layout (max of y + h).
-*/
-function bottom(layout) {
-	let max = 0;
-	for (let i = 0; i < layout.length; i++) {
-		const item = layout[i];
-		if (item !== void 0) {
-			const bottomY = item.y + item.h;
-			if (bottomY > max) max = bottomY;
-		}
-	}
-	return max;
-}
-/** Get a layout item by its ID. */
-function getLayoutItem(layout, id) {
-	for (let i = 0; i < layout.length; i++) {
-		const item = layout[i];
-		if (item !== void 0 && item.i === id) return item;
-	}
-}
-/** Get all static items from the layout. */
-function getStatics(layout) {
-	return layout.filter((l) => l.static === true);
-}
-/** Clone a layout item (shallow copy, boolean flags normalized). */
-function cloneLayoutItem(layoutItem) {
-	return {
-		i: layoutItem.i,
-		x: layoutItem.x,
-		y: layoutItem.y,
-		w: layoutItem.w,
-		h: layoutItem.h,
-		minW: layoutItem.minW,
-		maxW: layoutItem.maxW,
-		minH: layoutItem.minH,
-		maxH: layoutItem.maxH,
-		moved: Boolean(layoutItem.moved),
-		static: Boolean(layoutItem.static),
-		isDraggable: layoutItem.isDraggable,
-		isResizable: layoutItem.isResizable,
-		resizeHandles: layoutItem.resizeHandles,
-		constraints: layoutItem.constraints,
-		isBounded: layoutItem.isBounded
-	};
-}
-/** Clone an entire layout. */
-function cloneLayout(layout) {
-	const newLayout = new Array(layout.length);
-	for (let i = 0; i < layout.length; i++) {
-		const item = layout[i];
-		if (item !== void 0) newLayout[i] = cloneLayoutItem(item);
-	}
-	return newLayout;
-}
-/** Replace a layout item in a layout (matched by `i`). Other items untouched. */
-function modifyLayout(layout, layoutItem) {
-	const newLayout = new Array(layout.length);
-	for (let i = 0; i < layout.length; i++) {
-		const item = layout[i];
-		if (item !== void 0) if (layoutItem.i === item.i) newLayout[i] = layoutItem;
-		else newLayout[i] = item;
-	}
-	return newLayout;
-}
-/**
-* Ensure all layout items fit within the grid bounds.
-*
-* **IMPORTANT**: mutates the layout items in place for performance. Clone the
-* layout first (e.g. with `cloneLayout()`) if you need immutability.
-*/
-function correctBounds(layout, bounds) {
-	const collidesWith = getStatics(layout);
-	for (let i = 0; i < layout.length; i++) {
-		const l = layout[i];
-		if (l === void 0) continue;
-		if (l.x + l.w > bounds.cols) l.x = bounds.cols - l.w;
-		if (l.x < 0) {
-			l.x = 0;
-			l.w = bounds.cols;
-		}
-		if (!l.static) collidesWith.push(l);
-		else while (getFirstCollision(collidesWith, l)) l.y++;
-	}
-	return layout;
-}
-/**
-* Move a layout element to a new position.
-*
-* Handles collision detection and cascading movements. Does not compact the
-* layout - call the compactor separately.
-*
-* **Note**: mutates the `l` parameter directly for performance.
-*/
-function moveElement(layout, l, x, y, isUserAction, preventCollision, compactType, cols, allowOverlap, options) {
-	if (l.static && l.isDraggable !== true) return [...layout];
-	if (l.y === y && l.x === x) return [...layout];
-	const oldX = l.x;
-	const oldY = l.y;
-	if (typeof x === "number") l.x = x;
-	if (typeof y === "number") l.y = y;
-	l.moved = true;
-	let sorted = sortLayoutItems(layout, compactType);
-	if (compactType === "vertical" && typeof y === "number" ? oldY >= y : compactType === "horizontal" && typeof x === "number" ? oldX >= x : false) sorted = sorted.reverse();
-	const collisions = getAllCollisions(sorted, l);
-	const hasCollisions = collisions.length > 0;
-	if (hasCollisions && allowOverlap) return cloneLayout(layout);
-	if (hasCollisions && preventCollision) {
-		const resolved = options?.resolveCollision?.({
-			layout,
-			item: l,
-			collisions,
-			from: {
-				x: oldX,
-				y: oldY
-			}
-		});
-		if (resolved) return resolved;
-		l.x = oldX;
-		l.y = oldY;
-		l.moved = false;
-		return layout;
-	}
-	let resultLayout = [...layout];
-	for (let i = 0; i < collisions.length; i++) {
-		const collision = collisions[i];
-		if (collision === void 0) continue;
-		if (collision.moved) continue;
-		if (collision.static) resultLayout = moveElementAwayFromCollision(resultLayout, collision, l, isUserAction, compactType, cols);
-		else resultLayout = moveElementAwayFromCollision(resultLayout, l, collision, isUserAction, compactType, cols);
-	}
-	return resultLayout;
-}
-/**
-* Move an item away from a collision. Attempts to move up/left first if there's
-* room, otherwise moves it down/right.
-*/
-function moveElementAwayFromCollision(layout, collidesWith, itemToMove, isUserAction, compactType, cols) {
-	const compactH = compactType === "horizontal";
-	const compactV = compactType === "vertical";
-	const preventCollision = collidesWith.static;
-	if (isUserAction) {
-		isUserAction = false;
-		const fakeItem = {
-			x: compactH ? Math.max(collidesWith.x - itemToMove.w, 0) : itemToMove.x,
-			y: compactV ? Math.max(collidesWith.y - itemToMove.h, 0) : itemToMove.y,
-			w: itemToMove.w,
-			h: itemToMove.h,
-			i: "-1"
-		};
-		const firstCollision = getFirstCollision(layout, fakeItem);
-		const collisionNorth = firstCollision !== void 0 && firstCollision.y + firstCollision.h > collidesWith.y;
-		const collisionWest = firstCollision !== void 0 && collidesWith.x + collidesWith.w > firstCollision.x;
-		if (!firstCollision) return moveElement(layout, itemToMove, compactH ? fakeItem.x : void 0, compactV ? fakeItem.y : void 0, isUserAction, preventCollision, compactType, cols);
-		if (collisionNorth && compactV) return moveElement(layout, itemToMove, void 0, itemToMove.y + 1, isUserAction, preventCollision, compactType, cols);
-		if (collisionNorth && compactType === null) {
-			collidesWith.y = itemToMove.y;
-			itemToMove.y = itemToMove.y + itemToMove.h;
-			return [...layout];
-		}
-		if (collisionWest && compactH) return moveElement(layout, collidesWith, itemToMove.x, void 0, isUserAction, preventCollision, compactType, cols);
-	}
-	const newX = compactH ? itemToMove.x + 1 : void 0;
-	const newY = compactV ? itemToMove.y + 1 : void 0;
-	if (newX === void 0 && newY === void 0) return [...layout];
-	return moveElement(layout, itemToMove, newX, newY, isUserAction, preventCollision, compactType, cols);
-}
-
-//#endregion
-export { bottom, cloneLayout, cloneLayoutItem, correctBounds, getLayoutItem, getStatics, modifyLayout, moveElement };
-//# sourceMappingURL=layout.js.map

package/dist/components/layout/Board/grid-core/layout.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"layout.js","names":["getAllCollisions","getFirstCollision","sortLayoutItems","CompactType","Layout","LayoutItem","MoveElementOptions","Mutable","bottom","layout","max","i","length","item","undefined","bottomY","y","h","getLayoutItem","id","getStatics","filter","l","static","cloneLayoutItem","layoutItem","x","w","minW","maxW","minH","maxH","moved","Boolean","isDraggable","isResizable","resizeHandles","constraints","isBounded","cloneLayout","newLayout","Array","modifyLayout","withLayoutItem","itemKey","cb","correctBounds","bounds","cols","collidesWith","push","moveElement","isUserAction","preventCollision","compactType","allowOverlap","options","oldX","oldY","sorted","movingUp","reverse","collisions","hasCollisions","resolved","resolveCollision","from","resultLayout","collision","moveElementAwayFromCollision","itemToMove","compactH","compactV","fakeItem","Math","firstCollision","collisionNorth","collisionWest","newX","newY","validateLayout","contextName","requiredProps","const","isArray","Error","key","value","Number","isNaN","String"],"sources":["../../../../../src/components/layout/Board/grid-core/layout.ts"],"sourcesContent":["/**\n * Core layout manipulation utilities.\n *\n * Vendored from react-grid-layout v2 (`src/core/layout.ts`).\n * See ./NOTICE.md for attribution and license.\n *\n * These functions create, modify, and query grid layouts. Most functions treat\n * layouts as immutable and return new arrays/objects, but a few mutate items in\n * place for performance (documented per function).\n */\n\nimport { getAllCollisions, getFirstCollision } from './collision';\nimport { sortLayoutItems } from './sort';\n\nimport type {\n  CompactType,\n  Layout,\n  LayoutItem,\n  MoveElementOptions,\n  Mutable,\n} from './types';\n\n// ============================================================================\n// Layout Queries\n// ============================================================================\n\n/**\n * Get the bottom-most Y coordinate of the layout (max of y + h).\n */\nexport function bottom(layout: Layout): number {\n  let max = 0;\n  for (let i = 0; i < layout.length; i++) {\n    const item = layout[i];\n    if (item !== undefined) {\n      const bottomY = item.y + item.h;\n      if (bottomY > max) max = bottomY;\n    }\n  }\n  return max;\n}\n\n/** Get a layout item by its ID. */\nexport function getLayoutItem(\n  layout: Layout,\n  id: string,\n): LayoutItem | undefined {\n  for (let i = 0; i < layout.length; i++) {\n    const item = layout[i];\n    if (item !== undefined && item.i === id) {\n      return item;\n    }\n  }\n  return undefined;\n}\n\n/** Get all static items from the layout. */\nexport function getStatics(layout: Layout): LayoutItem[] {\n  return layout.filter((l): l is LayoutItem => l.static === true);\n}\n\n// ============================================================================\n// Layout Cloning\n// ============================================================================\n\n/** Clone a layout item (shallow copy, boolean flags normalized). */\nexport function cloneLayoutItem(layoutItem: LayoutItem): LayoutItem {\n  return {\n    i: layoutItem.i,\n    x: layoutItem.x,\n    y: layoutItem.y,\n    w: layoutItem.w,\n    h: layoutItem.h,\n    minW: layoutItem.minW,\n    maxW: layoutItem.maxW,\n    minH: layoutItem.minH,\n    maxH: layoutItem.maxH,\n    moved: Boolean(layoutItem.moved),\n    static: Boolean(layoutItem.static),\n    isDraggable: layoutItem.isDraggable,\n    isResizable: layoutItem.isResizable,\n    resizeHandles: layoutItem.resizeHandles,\n    constraints: layoutItem.constraints,\n    isBounded: layoutItem.isBounded,\n  };\n}\n\n/** Clone an entire layout. */\nexport function cloneLayout(layout: Layout): LayoutItem[] {\n  const newLayout: LayoutItem[] = new Array(layout.length);\n  for (let i = 0; i < layout.length; i++) {\n    const item = layout[i];\n    if (item !== undefined) {\n      newLayout[i] = cloneLayoutItem(item);\n    }\n  }\n  return newLayout;\n}\n\n// ============================================================================\n// Layout Modification\n// ============================================================================\n\n/** Replace a layout item in a layout (matched by `i`). Other items untouched. */\nexport function modifyLayout(\n  layout: Layout,\n  layoutItem: LayoutItem,\n): LayoutItem[] {\n  const newLayout: LayoutItem[] = new Array(layout.length);\n  for (let i = 0; i < layout.length; i++) {\n    const item = layout[i];\n    if (item !== undefined) {\n      if (layoutItem.i === item.i) {\n        newLayout[i] = layoutItem;\n      } else {\n        newLayout[i] = item;\n      }\n    }\n  }\n  return newLayout;\n}\n\n/**\n * Apply a transformation to a layout item. Finds the item by key, clones it,\n * applies the callback, and returns [new layout, modified item | null].\n */\nexport function withLayoutItem(\n  layout: Layout,\n  itemKey: string,\n  cb: (item: LayoutItem) => LayoutItem,\n): [LayoutItem[], LayoutItem | null] {\n  let item = getLayoutItem(layout, itemKey);\n  if (!item) {\n    return [[...layout], null];\n  }\n\n  item = cb(cloneLayoutItem(item));\n  const newLayout = modifyLayout(layout, item);\n\n  return [newLayout, item];\n}\n\n// ============================================================================\n// Bounds Correction\n// ============================================================================\n\n/**\n * Ensure all layout items fit within the grid bounds.\n *\n * **IMPORTANT**: mutates the layout items in place for performance. Clone the\n * layout first (e.g. with `cloneLayout()`) if you need immutability.\n */\nexport function correctBounds(\n  layout: Mutable<LayoutItem>[],\n  bounds: { cols: number },\n): LayoutItem[] {\n  const collidesWith = getStatics(layout);\n\n  for (let i = 0; i < layout.length; i++) {\n    const l = layout[i];\n    if (l === undefined) continue;\n\n    // Overflows right\n    if (l.x + l.w > bounds.cols) {\n      l.x = bounds.cols - l.w;\n    }\n\n    // Overflows left\n    if (l.x < 0) {\n      l.x = 0;\n      l.w = bounds.cols;\n    }\n\n    if (!l.static) {\n      collidesWith.push(l);\n    } else {\n      // Static items that collide with other statics must be moved down\n      while (getFirstCollision(collidesWith, l)) {\n        l.y++;\n      }\n    }\n  }\n\n  return layout;\n}\n\n// ============================================================================\n// Move Operations\n// ============================================================================\n\n/**\n * Move a layout element to a new position.\n *\n * Handles collision detection and cascading movements. Does not compact the\n * layout - call the compactor separately.\n *\n * **Note**: mutates the `l` parameter directly for performance.\n */\nexport function moveElement(\n  layout: Layout,\n  l: LayoutItem,\n  x: number | undefined,\n  y: number | undefined,\n  isUserAction: boolean | undefined,\n  preventCollision: boolean | undefined,\n  compactType: CompactType,\n  cols: number,\n  allowOverlap?: boolean,\n  options?: MoveElementOptions,\n): LayoutItem[] {\n  // Static items can't be moved unless explicitly draggable\n  if (l.static && l.isDraggable !== true) {\n    return [...layout];\n  }\n\n  // Short-circuit if position unchanged\n  if (l.y === y && l.x === x) {\n    return [...layout];\n  }\n\n  const oldX = l.x;\n  const oldY = l.y;\n\n  // Update position (mutates l directly - see JSDoc note)\n  if (typeof x === 'number') (l as Mutable<LayoutItem>).x = x;\n  if (typeof y === 'number') (l as Mutable<LayoutItem>).y = y;\n  (l as Mutable<LayoutItem>).moved = true;\n\n  // Sort for proper collision detection order\n  let sorted = sortLayoutItems(layout, compactType);\n  const movingUp =\n    compactType === 'vertical' && typeof y === 'number'\n      ? oldY >= y\n      : compactType === 'horizontal' && typeof x === 'number'\n        ? oldX >= x\n        : false;\n\n  if (movingUp) {\n    sorted = sorted.reverse();\n  }\n\n  const collisions = getAllCollisions(sorted, l);\n  const hasCollisions = collisions.length > 0;\n\n  // Handle overlap mode - just clone and return\n  if (hasCollisions && allowOverlap) {\n    return cloneLayout(layout);\n  }\n\n  // Handle prevent collision mode. A resolver may rewrite the layout instead of\n  // refusing the move outright - shrinking the item into the room that is there,\n  // or trading places with the widget already in it (see `collision-modes.ts`).\n  // Its result is required to be overlap-free, so nothing downstream has to\n  // change; when it declines, we revert exactly as before.\n  if (hasCollisions && preventCollision) {\n    const resolved = options?.resolveCollision?.({\n      layout,\n      item: l,\n      collisions,\n      from: { x: oldX, y: oldY },\n    });\n    if (resolved) return resolved;\n\n    // Revert position. Return same reference to signal no change occurred.\n    (l as Mutable<LayoutItem>).x = oldX;\n    (l as Mutable<LayoutItem>).y = oldY;\n    (l as Mutable<LayoutItem>).moved = false;\n    return layout as LayoutItem[];\n  }\n\n  // Resolve collisions by moving other items\n  let resultLayout: LayoutItem[] = [...layout];\n  for (let i = 0; i < collisions.length; i++) {\n    const collision = collisions[i];\n    if (collision === undefined) continue;\n\n    // Skip already-moved items to prevent infinite loops\n    if (collision.moved) continue;\n\n    // Static items can't be moved - move the dragged item instead\n    if (collision.static) {\n      resultLayout = moveElementAwayFromCollision(\n        resultLayout,\n        collision,\n        l,\n        isUserAction,\n        compactType,\n        cols,\n      );\n    } else {\n      resultLayout = moveElementAwayFromCollision(\n        resultLayout,\n        l,\n        collision,\n        isUserAction,\n        compactType,\n        cols,\n      );\n    }\n  }\n\n  return resultLayout;\n}\n\n/**\n * Move an item away from a collision. Attempts to move up/left first if there's\n * room, otherwise moves it down/right.\n */\nexport function moveElementAwayFromCollision(\n  layout: Layout,\n  collidesWith: LayoutItem,\n  itemToMove: LayoutItem,\n  isUserAction: boolean | undefined,\n  compactType: CompactType,\n  cols: number,\n): LayoutItem[] {\n  const compactH = compactType === 'horizontal';\n  const compactV = compactType === 'vertical';\n  const preventCollision = collidesWith.static;\n\n  // Try to move up/left first (only on primary collision from user action)\n  if (isUserAction) {\n    isUserAction = false; // Only try this once\n\n    // Create a fake item to test if there's room above/left\n    const fakeItem: LayoutItem = {\n      x: compactH ? Math.max(collidesWith.x - itemToMove.w, 0) : itemToMove.x,\n      y: compactV ? Math.max(collidesWith.y - itemToMove.h, 0) : itemToMove.y,\n      w: itemToMove.w,\n      h: itemToMove.h,\n      i: '-1',\n    };\n\n    const firstCollision = getFirstCollision(layout, fakeItem);\n    const collisionNorth =\n      firstCollision !== undefined &&\n      firstCollision.y + firstCollision.h > collidesWith.y;\n    const collisionWest =\n      firstCollision !== undefined &&\n      collidesWith.x + collidesWith.w > firstCollision.x;\n\n    // No collision above/left - we can move there\n    if (!firstCollision) {\n      return moveElement(\n        layout,\n        itemToMove,\n        compactH ? fakeItem.x : undefined,\n        compactV ? fakeItem.y : undefined,\n        isUserAction,\n        preventCollision,\n        compactType,\n        cols,\n      );\n    }\n\n    // Handle specific collision cases\n    if (collisionNorth && compactV) {\n      return moveElement(\n        layout,\n        itemToMove,\n        undefined,\n        itemToMove.y + 1,\n        isUserAction,\n        preventCollision,\n        compactType,\n        cols,\n      );\n    }\n\n    if (collisionNorth && compactType === null) {\n      // Swap positions in free-form mode\n      (collidesWith as Mutable<LayoutItem>).y = itemToMove.y;\n      (itemToMove as Mutable<LayoutItem>).y = itemToMove.y + itemToMove.h;\n      return [...layout];\n    }\n\n    if (collisionWest && compactH) {\n      return moveElement(\n        layout,\n        collidesWith,\n        itemToMove.x,\n        undefined,\n        isUserAction,\n        preventCollision,\n        compactType,\n        cols,\n      );\n    }\n  }\n\n  // Default: move down/right by 1\n  const newX = compactH ? itemToMove.x + 1 : undefined;\n  const newY = compactV ? itemToMove.y + 1 : undefined;\n\n  if (newX === undefined && newY === undefined) {\n    return [...layout];\n  }\n\n  return moveElement(\n    layout,\n    itemToMove,\n    newX,\n    newY,\n    isUserAction,\n    preventCollision,\n    compactType,\n    cols,\n  );\n}\n\n// ============================================================================\n// Validation\n// ============================================================================\n\n/** Validate that a layout has the required numeric properties. */\nexport function validateLayout(\n  layout: Layout,\n  contextName: string = 'Layout',\n): void {\n  const requiredProps = ['x', 'y', 'w', 'h'] as const;\n\n  if (!Array.isArray(layout)) {\n    throw new Error(`${contextName} must be an array!`);\n  }\n\n  for (let i = 0; i < layout.length; i++) {\n    const item = layout[i];\n    if (item === undefined) continue;\n\n    for (const key of requiredProps) {\n      const value = item[key];\n      if (typeof value !== 'number' || Number.isNaN(value)) {\n        throw new Error(\n          `Board: ${contextName}[${i}].${key} must be a number! ` +\n            `Received: ${String(value)} (${typeof value})`,\n        );\n      }\n    }\n\n    if (item.i !== undefined && typeof item.i !== 'string') {\n      throw new Error(\n        `Board: ${contextName}[${i}].i must be a string! ` +\n          `Received: ${String(item.i)} (${typeof item.i})`,\n      );\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AA6BA,SAAgBQ,OAAOC,QAAwB;CAC7C,IAAIC,MAAM;AACV,MAAK,IAAIC,IAAI,GAAGA,IAAIF,OAAOG,QAAQD,KAAK;EACtC,MAAME,OAAOJ,OAAOE;AACpB,MAAIE,SAASC,QAAW;GACtB,MAAMC,UAAUF,KAAKG,IAAIH,KAAKI;AAC9B,OAAIF,UAAUL,IAAKA,OAAMK;;;AAG7B,QAAOL;;;AAIT,SAAgBQ,cACdT,QACAU,IACwB;AACxB,MAAK,IAAIR,IAAI,GAAGA,IAAIF,OAAOG,QAAQD,KAAK;EACtC,MAAME,OAAOJ,OAAOE;AACpB,MAAIE,SAASC,UAAaD,KAAKF,MAAMQ,GACnC,QAAON;;;;AAOb,SAAgBO,WAAWX,QAA8B;AACvD,QAAOA,OAAOY,QAAQC,MAAuBA,EAAEC,WAAW,KAAK;;;AAQjE,SAAgBC,gBAAgBC,YAAoC;AAClE,QAAO;EACLd,GAAGc,WAAWd;EACde,GAAGD,WAAWC;EACdV,GAAGS,WAAWT;EACdW,GAAGF,WAAWE;EACdV,GAAGQ,WAAWR;EACdW,MAAMH,WAAWG;EACjBC,MAAMJ,WAAWI;EACjBC,MAAML,WAAWK;EACjBC,MAAMN,WAAWM;EACjBC,OAAOC,QAAQR,WAAWO,MAAM;EAChCT,QAAQU,QAAQR,WAAWF,OAAO;EAClCW,aAAaT,WAAWS;EACxBC,aAAaV,WAAWU;EACxBC,eAAeX,WAAWW;EAC1BC,aAAaZ,WAAWY;EACxBC,WAAWb,WAAWa;EACvB;;;AAIH,SAAgBC,YAAY9B,QAA8B;CACxD,MAAM+B,YAA0B,IAAIC,MAAMhC,OAAOG,OAAO;AACxD,MAAK,IAAID,IAAI,GAAGA,IAAIF,OAAOG,QAAQD,KAAK;EACtC,MAAME,OAAOJ,OAAOE;AACpB,MAAIE,SAASC,OACX0B,WAAU7B,KAAKa,gBAAgBX,KAAK;;AAGxC,QAAO2B;;;AAQT,SAAgBE,aACdjC,QACAgB,YACc;CACd,MAAMe,YAA0B,IAAIC,MAAMhC,OAAOG,OAAO;AACxD,MAAK,IAAID,IAAI,GAAGA,IAAIF,OAAOG,QAAQD,KAAK;EACtC,MAAME,OAAOJ,OAAOE;AACpB,MAAIE,SAASC,OACX,KAAIW,WAAWd,MAAME,KAAKF,EACxB6B,WAAU7B,KAAKc;MAEfe,WAAU7B,KAAKE;;AAIrB,QAAO2B;;;;;;;;AAiCT,SAAgBM,cACdrC,QACAsC,QACc;CACd,MAAME,eAAe7B,WAAWX,OAAO;AAEvC,MAAK,IAAIE,IAAI,GAAGA,IAAIF,OAAOG,QAAQD,KAAK;EACtC,MAAMW,IAAIb,OAAOE;AACjB,MAAIW,MAAMR,OAAW;AAGrB,MAAIQ,EAAEI,IAAIJ,EAAEK,IAAIoB,OAAOC,KACrB1B,GAAEI,IAAIqB,OAAOC,OAAO1B,EAAEK;AAIxB,MAAIL,EAAEI,IAAI,GAAG;AACXJ,KAAEI,IAAI;AACNJ,KAAEK,IAAIoB,OAAOC;;AAGf,MAAI,CAAC1B,EAAEC,OACL0B,cAAaC,KAAK5B,EAAE;MAGpB,QAAOrB,kBAAkBgD,cAAc3B,EAAE,CACvCA,GAAEN;;AAKR,QAAOP;;;;;;;;;;AAeT,SAAgB0C,YACd1C,QACAa,GACAI,GACAV,GACAoC,cACAC,kBACAC,aACAN,MACAO,cACAC,SACc;AAEd,KAAIlC,EAAEC,UAAUD,EAAEY,gBAAgB,KAChC,QAAO,CAAC,GAAGzB,OAAO;AAIpB,KAAIa,EAAEN,MAAMA,KAAKM,EAAEI,MAAMA,EACvB,QAAO,CAAC,GAAGjB,OAAO;CAGpB,MAAMgD,OAAOnC,EAAEI;CACf,MAAMgC,OAAOpC,EAAEN;AAGf,KAAI,OAAOU,MAAM,SAAU,CAACJ,EAA0BI,IAAIA;AAC1D,KAAI,OAAOV,MAAM,SAAU,CAACM,EAA0BN,IAAIA;AAC1D,CAACM,EAA0BU,QAAQ;CAGnC,IAAI2B,SAASzD,gBAAgBO,QAAQ6C,YAAY;AAQjD,KANEA,gBAAgB,cAAc,OAAOtC,MAAM,WACvC0C,QAAQ1C,IACRsC,gBAAgB,gBAAgB,OAAO5B,MAAM,WAC3C+B,QAAQ/B,IACR,MAGNiC,UAASA,OAAOE,SAAS;CAG3B,MAAMC,aAAa9D,iBAAiB2D,QAAQrC,EAAE;CAC9C,MAAMyC,gBAAgBD,WAAWlD,SAAS;AAG1C,KAAImD,iBAAiBR,aACnB,QAAOhB,YAAY9B,OAAO;AAQ5B,KAAIsD,iBAAiBV,kBAAkB;EACrC,MAAMW,WAAWR,SAASS,mBAAmB;GAC3CxD;GACAI,MAAMS;GACNwC;GACAI,MAAM;IAAExC,GAAG+B;IAAMzC,GAAG0C;IAAK;GAC1B,CAAC;AACF,MAAIM,SAAU,QAAOA;AAGrB,EAAC1C,EAA0BI,IAAI+B;AAC/B,EAACnC,EAA0BN,IAAI0C;AAC/B,EAACpC,EAA0BU,QAAQ;AACnC,SAAOvB;;CAIT,IAAI0D,eAA6B,CAAC,GAAG1D,OAAO;AAC5C,MAAK,IAAIE,IAAI,GAAGA,IAAImD,WAAWlD,QAAQD,KAAK;EAC1C,MAAMyD,YAAYN,WAAWnD;AAC7B,MAAIyD,cAActD,OAAW;AAG7B,MAAIsD,UAAUpC,MAAO;AAGrB,MAAIoC,UAAU7C,OACZ4C,gBAAeE,6BACbF,cACAC,WACA9C,GACA8B,cACAE,aACAN,KACD;MAEDmB,gBAAeE,6BACbF,cACA7C,GACA8C,WACAhB,cACAE,aACAN,KACD;;AAIL,QAAOmB;;;;;;AAOT,SAAgBE,6BACd5D,QACAwC,cACAqB,YACAlB,cACAE,aACAN,MACc;CACd,MAAMuB,WAAWjB,gBAAgB;CACjC,MAAMkB,WAAWlB,gBAAgB;CACjC,MAAMD,mBAAmBJ,aAAa1B;AAGtC,KAAI6B,cAAc;AAChBA,iBAAe;EAGf,MAAMqB,WAAuB;GAC3B/C,GAAG6C,WAAWG,KAAKhE,IAAIuC,aAAavB,IAAI4C,WAAW3C,GAAG,EAAE,GAAG2C,WAAW5C;GACtEV,GAAGwD,WAAWE,KAAKhE,IAAIuC,aAAajC,IAAIsD,WAAWrD,GAAG,EAAE,GAAGqD,WAAWtD;GACtEW,GAAG2C,WAAW3C;GACdV,GAAGqD,WAAWrD;GACdN,GAAG;GACJ;EAED,MAAMgE,iBAAiB1E,kBAAkBQ,QAAQgE,SAAS;EAC1D,MAAMG,iBACJD,mBAAmB7D,UACnB6D,eAAe3D,IAAI2D,eAAe1D,IAAIgC,aAAajC;EACrD,MAAM6D,gBACJF,mBAAmB7D,UACnBmC,aAAavB,IAAIuB,aAAatB,IAAIgD,eAAejD;AAGnD,MAAI,CAACiD,eACH,QAAOxB,YACL1C,QACA6D,YACAC,WAAWE,SAAS/C,IAAIZ,QACxB0D,WAAWC,SAASzD,IAAIF,QACxBsC,cACAC,kBACAC,aACAN,KACD;AAIH,MAAI4B,kBAAkBJ,SACpB,QAAOrB,YACL1C,QACA6D,YACAxD,QACAwD,WAAWtD,IAAI,GACfoC,cACAC,kBACAC,aACAN,KACD;AAGH,MAAI4B,kBAAkBtB,gBAAgB,MAAM;AAE1C,GAACL,aAAqCjC,IAAIsD,WAAWtD;AACrD,GAACsD,WAAmCtD,IAAIsD,WAAWtD,IAAIsD,WAAWrD;AAClE,UAAO,CAAC,GAAGR,OAAO;;AAGpB,MAAIoE,iBAAiBN,SACnB,QAAOpB,YACL1C,QACAwC,cACAqB,WAAW5C,GACXZ,QACAsC,cACAC,kBACAC,aACAN,KACD;;CAKL,MAAM8B,OAAOP,WAAWD,WAAW5C,IAAI,IAAIZ;CAC3C,MAAMiE,OAAOP,WAAWF,WAAWtD,IAAI,IAAIF;AAE3C,KAAIgE,SAAShE,UAAaiE,SAASjE,OACjC,QAAO,CAAC,GAAGL,OAAO;AAGpB,QAAO0C,YACL1C,QACA6D,YACAQ,MACAC,MACA3B,cACAC,kBACAC,aACAN,KACD"}

package/dist/components/layout/Board/grid-core/placement.d.ts

@@ -1,58 +0,0 @@
-
-import { Layout, LayoutItem } from "./types.js";
-
-//#region src/components/layout/Board/grid-core/placement.d.ts
-/**
- * The first position at or below the preferred cell where `item` fits without
- * overlapping any of `others` (which must themselves be overlap-free), scanning
- * left-to-right then top-to-bottom and never past `maxRows`; if the band below
- * is full, upward toward the top.
- *
- * This is the rule the board itself applies when it has to land a widget that
- * cannot stay where it was dropped, so using it for a programmatic add is what
- * makes the two agree.
- *
- * A finite `maxRows` mirrors the `gridBounds` constraint the normal landing path
- * applies (`clamp(y, 0, maxRows - h)`): the item's bottom edge stays within the
- * row limit even when the landing cell is blocked, so the downward scan cannot
- * push it off the board. If the whole valid band is full the item is clamped to
- * the limit — bounds win over overlap, exactly as `gridBounds` does. With an
- * unbounded `maxRows` there is always a free slot below every existing item, so
- * the downward scan terminates on its own.
- *
- * The returned item is a copy; `item` is not mutated. Its `w` is capped to
- * `cols`, and no other dimension is changed — this never resizes to fit.
- */
-declare function placeInFreeSlot(others: Layout, item: LayoutItem, cols: number, maxRows?: number): LayoutItem;
-/**
- * Tile every item evenly across both axes of a `cols × rows` grid, keeping the
- * row structure the layout already has: items are grouped into visual rows by
- * their current `y`, `rows` is divided across those groups, and `cols` across
- * each group's members.
- *
- * So three items on one line become three equal full-height columns; move one
- * below and the top line becomes two half-width cells while the lower item
- * spans the full width at half height. Grouping by `y` rather than reflowing
- * from scratch is what makes the result recognisably the user's arrangement
- * instead of an arbitrary repack.
- *
- * A visual row holding more items than the grid is wide is wrapped into
- * sub-rows of at most `cols`, so nothing tiles past the right edge. That can
- * take the result past `rows`; the caller decides whether to grow the grid or
- * let its bounds clip.
- *
- * This is the one operation that deliberately GROWS items — every gesture-driven
- * path refuses to, because growing on a move is a surprise. Here it is the whole
- * point, which is why it is a call the app makes rather than a mode the board is
- * in. Returns new items in the input's order; the input is not mutated.
- */
-declare function distributeEvenly(layout: Layout, {
-  cols,
-  rows
-}: {
-  cols: number;
-  rows: number;
-}): LayoutItem[];
-//#endregion
-export { distributeEvenly, placeInFreeSlot };
-//# sourceMappingURL=placement.d.ts.map

package/dist/components/layout/Board/grid-core/placement.js

@@ -1,153 +0,0 @@
-/** @license MIT | @cube-dev/ui-kit v0.0.0-canary-c325dcb | Cube Dev Team */
-import { collides } from "./collision.js";
-
-//#region src/components/layout/Board/grid-core/placement.ts
-/**
-* Placing items into a grid without dragging them there.
-*
-* A board's own gestures resolve placement through the compactor and the
-* collision resolver. An app that adds a widget programmatically — a toolbar
-* drop, a widget moved between boards by code, an "arrange these for me"
-* command — has to answer the same question with no gesture in hand, and had no
-* way to ask the engine for the answer. Left to solve it themselves, apps
-* re-implement the scan, and the same drop lands in two different cells
-* depending on whether a pointer or a code path served it.
-*
-* Original UI Kit code (not vendored from react-grid-layout).
-*/
-/**
-* The first position at or below the preferred cell where `item` fits without
-* overlapping any of `others` (which must themselves be overlap-free), scanning
-* left-to-right then top-to-bottom and never past `maxRows`; if the band below
-* is full, upward toward the top.
-*
-* This is the rule the board itself applies when it has to land a widget that
-* cannot stay where it was dropped, so using it for a programmatic add is what
-* makes the two agree.
-*
-* A finite `maxRows` mirrors the `gridBounds` constraint the normal landing path
-* applies (`clamp(y, 0, maxRows - h)`): the item's bottom edge stays within the
-* row limit even when the landing cell is blocked, so the downward scan cannot
-* push it off the board. If the whole valid band is full the item is clamped to
-* the limit — bounds win over overlap, exactly as `gridBounds` does. With an
-* unbounded `maxRows` there is always a free slot below every existing item, so
-* the downward scan terminates on its own.
-*
-* The returned item is a copy; `item` is not mutated. Its `w` is capped to
-* `cols`, and no other dimension is changed — this never resizes to fit.
-*/
-function placeInFreeSlot(others, item, cols, maxRows = Infinity) {
-	const w = Math.min(item.w, cols);
-	const maxY = Number.isFinite(maxRows) ? Math.max(0, maxRows - item.h) : Infinity;
-	const fits = (x, y) => !others.some((o) => collides(o, {
-		...item,
-		x,
-		y,
-		w
-	}));
-	const preferX = Math.min(Math.max(0, item.x), cols - w);
-	const startY = Math.min(Math.max(0, item.y), maxY);
-	if (fits(preferX, startY)) return {
-		...item,
-		x: preferX,
-		y: startY,
-		w
-	};
-	const scanBottom = Number.isFinite(maxRows) ? maxY : startY + others.reduce((m, o) => Math.max(m, o.y + o.h), 0) + 1;
-	for (let y = startY; y <= scanBottom; y++) for (let x = 0; x <= cols - w; x++) if (fits(x, y)) return {
-		...item,
-		x,
-		y,
-		w
-	};
-	for (let y = startY - 1; y >= 0; y--) for (let x = 0; x <= cols - w; x++) if (fits(x, y)) return {
-		...item,
-		x,
-		y,
-		w
-	};
-	return {
-		...item,
-		x: preferX,
-		y: startY,
-		w
-	};
-}
-/**
-* Split `total` cells across `parts` groups as evenly as possible: each group
-* gets at least one, and the first `total % parts` groups get one extra so the
-* pieces sum to `total`. With more groups than cells every group still gets one
-* and the sum overflows, which the grid's own bounds then clip — the best
-* available answer when there is less than a cell to go round.
-*/
-function splitEvenly(total, parts) {
-	if (parts <= 0) return [];
-	const base = Math.max(1, Math.floor(total / parts));
-	const remainder = base * parts >= total ? 0 : total - base * parts;
-	return Array.from({ length: parts }, (_, i) => base + (i < remainder ? 1 : 0));
-}
-/**
-* Tile every item evenly across both axes of a `cols × rows` grid, keeping the
-* row structure the layout already has: items are grouped into visual rows by
-* their current `y`, `rows` is divided across those groups, and `cols` across
-* each group's members.
-*
-* So three items on one line become three equal full-height columns; move one
-* below and the top line becomes two half-width cells while the lower item
-* spans the full width at half height. Grouping by `y` rather than reflowing
-* from scratch is what makes the result recognisably the user's arrangement
-* instead of an arbitrary repack.
-*
-* A visual row holding more items than the grid is wide is wrapped into
-* sub-rows of at most `cols`, so nothing tiles past the right edge. That can
-* take the result past `rows`; the caller decides whether to grow the grid or
-* let its bounds clip.
-*
-* This is the one operation that deliberately GROWS items — every gesture-driven
-* path refuses to, because growing on a move is a surprise. Here it is the whole
-* point, which is why it is a call the app makes rather than a mode the board is
-* in. Returns new items in the input's order; the input is not mutated.
-*/
-function distributeEvenly(layout, { cols, rows }) {
-	if (layout.length === 0) return [];
-	const gridCols = Math.max(1, cols);
-	const gridRows = Math.max(1, rows);
-	const sorted = [...layout].sort((a, b) => a.y !== b.y ? a.y - b.y : a.x - b.x);
-	const groups = [];
-	let lastY = null;
-	for (const item of sorted) {
-		if (lastY === null || item.y !== lastY) {
-			groups.push([]);
-			lastY = item.y;
-		}
-		groups[groups.length - 1].push(item);
-	}
-	const rowGroups = [];
-	for (const group of groups) if (group.length <= gridCols) rowGroups.push(group);
-	else for (let i = 0; i < group.length; i += gridCols) rowGroups.push(group.slice(i, i + gridCols));
-	const rowHeights = splitEvenly(gridRows, rowGroups.length);
-	const placed = /* @__PURE__ */ new Map();
-	let y = 0;
-	rowGroups.forEach((group, gi) => {
-		const h = rowHeights[gi];
-		const widths = splitEvenly(gridCols, group.length);
-		let x = 0;
-		group.forEach((item, ci) => {
-			const w = widths[ci];
-			placed.set(item.i, {
-				...item,
-				x,
-				y,
-				w,
-				h
-			});
-			x += w;
-		});
-		y += h;
-	});
-	return layout.map((item) => placed.get(item.i) ?? item);
-}
-
-//#endregion
-export { distributeEvenly, placeInFreeSlot };
-//# sourceMappingURL=placement.js.map

package/dist/components/layout/Board/grid-core/placement.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"placement.js","names":["collides","Layout","LayoutItem","placeInFreeSlot","others","item","cols","maxRows","Infinity","w","Math","min","maxY","Number","isFinite","max","h","fits","x","y","some","o","preferX","startY","scanBottom","reduce","m","splitEvenly","total","parts","base","floor","remainder","Array","from","length","_","i","distributeEvenly","layout","rows","gridCols","gridRows","sorted","sort","a","b","groups","lastY","push","rowGroups","group","slice","rowHeights","placed","Map","forEach","gi","widths","ci","set","map","get"],"sources":["../../../../../src/components/layout/Board/grid-core/placement.ts"],"sourcesContent":["/**\n * Placing items into a grid without dragging them there.\n *\n * A board's own gestures resolve placement through the compactor and the\n * collision resolver. An app that adds a widget programmatically — a toolbar\n * drop, a widget moved between boards by code, an \"arrange these for me\"\n * command — has to answer the same question with no gesture in hand, and had no\n * way to ask the engine for the answer. Left to solve it themselves, apps\n * re-implement the scan, and the same drop lands in two different cells\n * depending on whether a pointer or a code path served it.\n *\n * Original UI Kit code (not vendored from react-grid-layout).\n */\n\nimport { collides } from './collision';\n\nimport type { Layout, LayoutItem } from './types';\n\n/**\n * The first position at or below the preferred cell where `item` fits without\n * overlapping any of `others` (which must themselves be overlap-free), scanning\n * left-to-right then top-to-bottom and never past `maxRows`; if the band below\n * is full, upward toward the top.\n *\n * This is the rule the board itself applies when it has to land a widget that\n * cannot stay where it was dropped, so using it for a programmatic add is what\n * makes the two agree.\n *\n * A finite `maxRows` mirrors the `gridBounds` constraint the normal landing path\n * applies (`clamp(y, 0, maxRows - h)`): the item's bottom edge stays within the\n * row limit even when the landing cell is blocked, so the downward scan cannot\n * push it off the board. If the whole valid band is full the item is clamped to\n * the limit — bounds win over overlap, exactly as `gridBounds` does. With an\n * unbounded `maxRows` there is always a free slot below every existing item, so\n * the downward scan terminates on its own.\n *\n * The returned item is a copy; `item` is not mutated. Its `w` is capped to\n * `cols`, and no other dimension is changed — this never resizes to fit.\n */\nexport function placeInFreeSlot(\n  others: Layout,\n  item: LayoutItem,\n  cols: number,\n  maxRows = Infinity,\n): LayoutItem {\n  const w = Math.min(item.w, cols);\n  const maxY = Number.isFinite(maxRows)\n    ? Math.max(0, maxRows - item.h)\n    : Infinity;\n  const fits = (x: number, y: number) =>\n    !others.some((o) => collides(o, { ...item, x, y, w }));\n  const preferX = Math.min(Math.max(0, item.x), cols - w);\n  const startY = Math.min(Math.max(0, item.y), maxY);\n  if (fits(preferX, startY)) return { ...item, x: preferX, y: startY, w };\n  const scanBottom = Number.isFinite(maxRows)\n    ? maxY\n    : startY + others.reduce((m, o) => Math.max(m, o.y + o.h), 0) + 1;\n  for (let y = startY; y <= scanBottom; y++) {\n    for (let x = 0; x <= cols - w; x++) {\n      if (fits(x, y)) return { ...item, x, y, w };\n    }\n  }\n  // The landing row (clamped to the limit) and everything below it were full;\n  // look upward for a free slot still inside the board before giving up.\n  for (let y = startY - 1; y >= 0; y--) {\n    for (let x = 0; x <= cols - w; x++) {\n      if (fits(x, y)) return { ...item, x, y, w };\n    }\n  }\n  return { ...item, x: preferX, y: startY, w };\n}\n\n/**\n * Split `total` cells across `parts` groups as evenly as possible: each group\n * gets at least one, and the first `total % parts` groups get one extra so the\n * pieces sum to `total`. With more groups than cells every group still gets one\n * and the sum overflows, which the grid's own bounds then clip — the best\n * available answer when there is less than a cell to go round.\n */\nfunction splitEvenly(total: number, parts: number): number[] {\n  if (parts <= 0) return [];\n  const base = Math.max(1, Math.floor(total / parts));\n  const remainder = base * parts >= total ? 0 : total - base * parts;\n  return Array.from(\n    { length: parts },\n    (_, i) => base + (i < remainder ? 1 : 0),\n  );\n}\n\n/**\n * Tile every item evenly across both axes of a `cols × rows` grid, keeping the\n * row structure the layout already has: items are grouped into visual rows by\n * their current `y`, `rows` is divided across those groups, and `cols` across\n * each group's members.\n *\n * So three items on one line become three equal full-height columns; move one\n * below and the top line becomes two half-width cells while the lower item\n * spans the full width at half height. Grouping by `y` rather than reflowing\n * from scratch is what makes the result recognisably the user's arrangement\n * instead of an arbitrary repack.\n *\n * A visual row holding more items than the grid is wide is wrapped into\n * sub-rows of at most `cols`, so nothing tiles past the right edge. That can\n * take the result past `rows`; the caller decides whether to grow the grid or\n * let its bounds clip.\n *\n * This is the one operation that deliberately GROWS items — every gesture-driven\n * path refuses to, because growing on a move is a surprise. Here it is the whole\n * point, which is why it is a call the app makes rather than a mode the board is\n * in. Returns new items in the input's order; the input is not mutated.\n */\nexport function distributeEvenly(\n  layout: Layout,\n  { cols, rows }: { cols: number; rows: number },\n): LayoutItem[] {\n  if (layout.length === 0) return [];\n\n  const gridCols = Math.max(1, cols);\n  const gridRows = Math.max(1, rows);\n\n  const sorted = [...layout].sort((a, b) =>\n    a.y !== b.y ? a.y - b.y : a.x - b.x,\n  );\n\n  const groups: LayoutItem[][] = [];\n  let lastY: number | null = null;\n  for (const item of sorted) {\n    if (lastY === null || item.y !== lastY) {\n      groups.push([]);\n      lastY = item.y;\n    }\n    groups[groups.length - 1].push(item);\n  }\n\n  const rowGroups: LayoutItem[][] = [];\n  for (const group of groups) {\n    if (group.length <= gridCols) {\n      rowGroups.push(group);\n    } else {\n      for (let i = 0; i < group.length; i += gridCols) {\n        rowGroups.push(group.slice(i, i + gridCols));\n      }\n    }\n  }\n\n  const rowHeights = splitEvenly(gridRows, rowGroups.length);\n  const placed = new Map<string, LayoutItem>();\n  let y = 0;\n  rowGroups.forEach((group, gi) => {\n    const h = rowHeights[gi];\n    const widths = splitEvenly(gridCols, group.length);\n    let x = 0;\n    group.forEach((item, ci) => {\n      const w = widths[ci];\n      placed.set(item.i, { ...item, x, y, w, h });\n      x += w;\n    });\n    y += h;\n  });\n\n  // Emit in the caller's order, not the sort's: a layout is keyed by `i`, and\n  // reordering it would churn every consumer that diffs the array positionally.\n  return layout.map((item) => placed.get(item.i) ?? item);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCA,SAAgBG,gBACdC,QACAC,MACAC,MACAC,UAAUC,UACE;CACZ,MAAMC,IAAIC,KAAKC,IAAIN,KAAKI,GAAGH,KAAK;CAChC,MAAMM,OAAOC,OAAOC,SAASP,QAAQ,GACjCG,KAAKK,IAAI,GAAGR,UAAUF,KAAKW,EAAE,GAC7BR;CACJ,MAAMS,QAAQC,GAAWC,MACvB,CAACf,OAAOgB,MAAMC,MAAMrB,SAASqB,GAAG;EAAE,GAAGhB;EAAMa;EAAGC;EAAGV;EAAG,CAAC,CAAC;CACxD,MAAMa,UAAUZ,KAAKC,IAAID,KAAKK,IAAI,GAAGV,KAAKa,EAAE,EAAEZ,OAAOG,EAAE;CACvD,MAAMc,SAASb,KAAKC,IAAID,KAAKK,IAAI,GAAGV,KAAKc,EAAE,EAAEP,KAAK;AAClD,KAAIK,KAAKK,SAASC,OAAO,CAAE,QAAO;EAAE,GAAGlB;EAAMa,GAAGI;EAASH,GAAGI;EAAQd;EAAG;CACvE,MAAMe,aAAaX,OAAOC,SAASP,QAAQ,GACvCK,OACAW,SAASnB,OAAOqB,QAAQC,GAAGL,MAAMX,KAAKK,IAAIW,GAAGL,EAAEF,IAAIE,EAAEL,EAAE,EAAE,EAAE,GAAG;AAClE,MAAK,IAAIG,IAAII,QAAQJ,KAAKK,YAAYL,IACpC,MAAK,IAAID,IAAI,GAAGA,KAAKZ,OAAOG,GAAGS,IAC7B,KAAID,KAAKC,GAAGC,EAAE,CAAE,QAAO;EAAE,GAAGd;EAAMa;EAAGC;EAAGV;EAAG;AAK/C,MAAK,IAAIU,IAAII,SAAS,GAAGJ,KAAK,GAAGA,IAC/B,MAAK,IAAID,IAAI,GAAGA,KAAKZ,OAAOG,GAAGS,IAC7B,KAAID,KAAKC,GAAGC,EAAE,CAAE,QAAO;EAAE,GAAGd;EAAMa;EAAGC;EAAGV;EAAG;AAG/C,QAAO;EAAE,GAAGJ;EAAMa,GAAGI;EAASH,GAAGI;EAAQd;EAAG;;;;;;;;;AAU9C,SAASkB,YAAYC,OAAeC,OAAyB;AAC3D,KAAIA,SAAS,EAAG,QAAO,EAAE;CACzB,MAAMC,OAAOpB,KAAKK,IAAI,GAAGL,KAAKqB,MAAMH,QAAQC,MAAM,CAAC;CACnD,MAAMG,YAAYF,OAAOD,SAASD,QAAQ,IAAIA,QAAQE,OAAOD;AAC7D,QAAOI,MAAMC,KACX,EAAEC,QAAQN,OAAO,GAChBO,GAAGC,MAAMP,QAAQO,IAAIL,YAAY,IAAI,GACvC;;;;;;;;;;;;;;;;;;;;;;;;AAyBH,SAAgBM,iBACdC,QACA,EAAEjC,MAAMkC,QACM;AACd,KAAID,OAAOJ,WAAW,EAAG,QAAO,EAAE;CAElC,MAAMM,WAAW/B,KAAKK,IAAI,GAAGT,KAAK;CAClC,MAAMoC,WAAWhC,KAAKK,IAAI,GAAGyB,KAAK;CAElC,MAAMG,SAAS,CAAC,GAAGJ,OAAO,CAACK,MAAMC,GAAGC,MAClCD,EAAE1B,MAAM2B,EAAE3B,IAAI0B,EAAE1B,IAAI2B,EAAE3B,IAAI0B,EAAE3B,IAAI4B,EAAE5B,EACnC;CAED,MAAM6B,SAAyB,EAAE;CACjC,IAAIC,QAAuB;AAC3B,MAAK,MAAM3C,QAAQsC,QAAQ;AACzB,MAAIK,UAAU,QAAQ3C,KAAKc,MAAM6B,OAAO;AACtCD,UAAOE,KAAK,EAAE,CAAC;AACfD,WAAQ3C,KAAKc;;AAEf4B,SAAOA,OAAOZ,SAAS,GAAGc,KAAK5C,KAAK;;CAGtC,MAAM6C,YAA4B,EAAE;AACpC,MAAK,MAAMC,SAASJ,OAClB,KAAII,MAAMhB,UAAUM,SAClBS,WAAUD,KAAKE,MAAM;KAErB,MAAK,IAAId,IAAI,GAAGA,IAAIc,MAAMhB,QAAQE,KAAKI,SACrCS,WAAUD,KAAKE,MAAMC,MAAMf,GAAGA,IAAII,SAAS,CAAC;CAKlD,MAAMY,aAAa1B,YAAYe,UAAUQ,UAAUf,OAAO;CAC1D,MAAMmB,yBAAS,IAAIC,KAAyB;CAC5C,IAAIpC,IAAI;AACR+B,WAAUM,SAASL,OAAOM,OAAO;EAC/B,MAAMzC,IAAIqC,WAAWI;EACrB,MAAMC,SAAS/B,YAAYc,UAAUU,MAAMhB,OAAO;EAClD,IAAIjB,IAAI;AACRiC,QAAMK,SAASnD,MAAMsD,OAAO;GAC1B,MAAMlD,IAAIiD,OAAOC;AACjBL,UAAOM,IAAIvD,KAAKgC,GAAG;IAAE,GAAGhC;IAAMa;IAAGC;IAAGV;IAAGO;IAAG,CAAC;AAC3CE,QAAKT;IACL;AACFU,OAAKH;GACL;AAIF,QAAOuB,OAAOsB,KAAKxD,SAASiD,OAAOQ,IAAIzD,KAAKgC,EAAE,IAAIhC,KAAK"}

package/dist/components/layout/Board/grid-core/sort.js

@@ -1,37 +0,0 @@
-/** @license MIT | @cube-dev/ui-kit v0.0.0-canary-c325dcb | Cube Dev Team */
-//#region src/components/layout/Board/grid-core/sort.ts
-/**
-* Sort layout items based on the compaction type.
-*
-* - Vertical compaction: sort by row (y) then column (x)
-* - Horizontal compaction: sort by column (x) then row (y)
-* - No compaction (null): return original order
-*/
-function sortLayoutItems(layout, compactType) {
-	if (compactType === "horizontal") return sortLayoutItemsByColRow(layout);
-	if (compactType === "vertical") return sortLayoutItemsByRowCol(layout);
-	if (compactType === "wrap") return sortLayoutItemsByRowCol(layout);
-	return [...layout];
-}
-/**
-* Sort layout items by row ascending, then column ascending.
-*/
-function sortLayoutItemsByRowCol(layout) {
-	return [...layout].sort((a, b) => {
-		if (a.y !== b.y) return a.y - b.y;
-		return a.x - b.x;
-	});
-}
-/**
-* Sort layout items by column ascending, then row ascending.
-*/
-function sortLayoutItemsByColRow(layout) {
-	return [...layout].sort((a, b) => {
-		if (a.x !== b.x) return a.x - b.x;
-		return a.y - b.y;
-	});
-}
-
-//#endregion
-export { sortLayoutItems, sortLayoutItemsByColRow, sortLayoutItemsByRowCol };
-//# sourceMappingURL=sort.js.map

package/dist/components/layout/Board/grid-core/sort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort.js","names":["CompactType","Layout","LayoutItem","sortLayoutItems","layout","compactType","sortLayoutItemsByColRow","sortLayoutItemsByRowCol","sort","a","b","y","x"],"sources":["../../../../../src/components/layout/Board/grid-core/sort.ts"],"sourcesContent":["/**\n * Sorting utilities for grid layouts.\n *\n * Vendored from react-grid-layout v2 (`src/core/sort.ts`).\n * See ./NOTICE.md for attribution and license.\n */\n\nimport type { CompactType, Layout, LayoutItem } from './types';\n\n/**\n * Sort layout items based on the compaction type.\n *\n * - Vertical compaction: sort by row (y) then column (x)\n * - Horizontal compaction: sort by column (x) then row (y)\n * - No compaction (null): return original order\n */\nexport function sortLayoutItems(\n  layout: Layout,\n  compactType: CompactType,\n): LayoutItem[] {\n  if (compactType === 'horizontal') {\n    return sortLayoutItemsByColRow(layout);\n  }\n  if (compactType === 'vertical') {\n    return sortLayoutItemsByRowCol(layout);\n  }\n  if (compactType === 'wrap') {\n    // Wrap mode uses row-col order (reading order: left-to-right, top-to-bottom)\n    return sortLayoutItemsByRowCol(layout);\n  }\n  // No compaction - return a copy to maintain immutability\n  return [...layout];\n}\n\n/**\n * Sort layout items by row ascending, then column ascending.\n */\nexport function sortLayoutItemsByRowCol(layout: Layout): LayoutItem[] {\n  return [...layout].sort((a, b) => {\n    if (a.y !== b.y) {\n      return a.y - b.y;\n    }\n    return a.x - b.x;\n  });\n}\n\n/**\n * Sort layout items by column ascending, then row ascending.\n */\nexport function sortLayoutItemsByColRow(layout: Layout): LayoutItem[] {\n  return [...layout].sort((a, b) => {\n    if (a.x !== b.x) {\n      return a.x - b.x;\n    }\n    return a.y - b.y;\n  });\n}\n"],"mappings":";;;;;;;;;AAgBA,SAAgBG,gBACdC,QACAC,aACc;AACd,KAAIA,gBAAgB,aAClB,QAAOC,wBAAwBF,OAAO;AAExC,KAAIC,gBAAgB,WAClB,QAAOE,wBAAwBH,OAAO;AAExC,KAAIC,gBAAgB,OAElB,QAAOE,wBAAwBH,OAAO;AAGxC,QAAO,CAAC,GAAGA,OAAO;;;;;AAMpB,SAAgBG,wBAAwBH,QAA8B;AACpE,QAAO,CAAC,GAAGA,OAAO,CAACI,MAAMC,GAAGC,MAAM;AAChC,MAAID,EAAEE,MAAMD,EAAEC,EACZ,QAAOF,EAAEE,IAAID,EAAEC;AAEjB,SAAOF,EAAEG,IAAIF,EAAEE;GACf;;;;;AAMJ,SAAgBN,wBAAwBF,QAA8B;AACpE,QAAO,CAAC,GAAGA,OAAO,CAACI,MAAMC,GAAGC,MAAM;AAChC,MAAID,EAAEG,MAAMF,EAAEE,EACZ,QAAOH,EAAEG,IAAIF,EAAEE;AAEjB,SAAOH,EAAEE,IAAID,EAAEC;GACf"}