@cube-dev/ui-kit 0.192.0 → 0.193.0

package/dist/components/data/TableBase/TreeGridTable.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { mergeProps as mergeProps$1 } from "../../../utils/react/mergeProps.js";
 import { c } from "react/compiler-runtime";
 import { useEffect, useRef } from "react";

package/dist/components/data/TableBase/column-header.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { ArrowNarrowDownIcon } from "../../../icons/ArrowNarrowDownIcon.js";
 import { ArrowNarrowUpIcon } from "../../../icons/ArrowNarrowUpIcon.js";
 import { TableHeaderItem } from "./styled.js";

package/dist/components/data/TableBase/column-menu.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { __Menu } from "../../actions/Menu/Menu.js";
 import { normalizeMenuAction } from "./row-menu.js";
 import { Children, cloneElement, isValidElement } from "react";

package/dist/components/data/TableBase/column-styles.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { computeStyles, resolveRecipes } from "@tenphi/tasty";
 
 //#region src/components/data/TableBase/column-styles.ts

package/dist/components/data/TableBase/column-tint.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { getPaletteConfig } from "../../../tokens/palette-config.js";
 import { hashString } from "../../../tokens/color-theme.js";
 

package/dist/components/data/TableBase/row-menu.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { Children, Fragment, isValidElement } from "react";
 
 //#region src/components/data/TableBase/row-menu.ts

package/dist/components/data/TableBase/styled.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { _Item } from "../../content/Item/Item.js";
 import { Action } from "../../actions/Action/Action.js";
 import { keyframes, tasty } from "@tenphi/tasty";

package/dist/components/data/TableBase/table-tree.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 //#region src/components/data/TableBase/table-tree.ts
 /** Build identity and parent/child indexes without modifying consumer rows. */
 function buildTableTree(rows, getChildren, getKey) {

package/dist/components/data/TableBase/types.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 //#region src/components/data/TableBase/types.ts
 /**
 * `asc | desc` rather than React Aria's `ascending | descending`: we do not use

package/dist/components/data/TableBase/use-column-menu.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { useEvent } from "../../../_internal/hooks/use-event.js";
 import { ItemAction } from "../../actions/ItemAction/ItemAction.js";
 import { useI18n } from "../../../i18n/useI18n.js";

package/dist/components/data/TableBase/use-column-order.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { useEvent } from "../../../_internal/hooks/use-event.js";
 import { c } from "react/compiler-runtime";
 import { useState } from "react";

package/dist/components/data/TableBase/use-container-width.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { c } from "react/compiler-runtime";
 import { useLayoutEffect, useState } from "react";
 

package/dist/components/data/TableBase/use-row-move-animation.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { c } from "react/compiler-runtime";
 import { useLayoutEffect, useRef } from "react";
 
@@ -48,7 +48,11 @@ function useRowMoveAnimation(t0) {
 	if ($[1] !== bodyRef || $[2] !== duration || $[3] !== isEnabled) {
 		t3 = () => {
 			const body = bodyRef.current;
-			if (!body) return;
+			if (!body || !isEnabled || prefersReducedMotion()) {
+				previousRef.current = null;
+				previousOrderRef.current = [];
+				return;
+			}
 			const rows = Array.from(body.querySelectorAll("tr[data-element=\"Row\"][data-key]:not([data-pinned])"));
 			const next = /* @__PURE__ */ new Map();
 			for (const row of rows) next.set(row.dataset.key, row.offsetTop);
@@ -57,7 +61,7 @@ function useRowMoveAnimation(t0) {
 			const nextOrder = rows.map(_temp);
 			previousRef.current = next;
 			previousOrderRef.current = nextOrder;
-			if (!isEnabled || prefersReducedMotion() || !previous) return;
+			if (!previous) return;
 			const stillHere = new Set(nextOrder);
 			const before = previousOrder.filter((key) => stillHere.has(key));
 			const after = nextOrder.filter((key_0) => previous.has(key_0));

package/dist/components/data/TableBase/use-row-move-animation.js.map

@@ -1 +1 @@
-{"version":3,"file":"use-row-move-animation.js","names":["useLayoutEffect","useRef","RefObject","ROW_MOVE_DURATION","UseRowMoveAnimationOptions","isEnabled","bodyRef","HTMLTableSectionElement","duration","prefersReducedMotion","window","Boolean","matchMedia","matches","useRowMoveAnimation","t0","$","_c","t1","undefined","previousRef","t2","Symbol","for","previousOrderRef","t3","body","current","rows","Array","from","querySelectorAll","next","Map","row","set","dataset","key","offsetTop","previous","previousOrder","nextOrder","map","_temp","stillHere","Set","before","filter","has","after","key_0","isReorder","length","some","key_1","index","moved","row_1","get","delta","push","row_2","delta_0","style","transition","transform","row_3","clear","row_4","timer","setTimeout","clearTimeout","row_0"],"sources":["../../../../src/components/data/TableBase/use-row-move-animation.ts"],"sourcesContent":["import { useLayoutEffect, useRef } from 'react';\n\nimport type { RefObject } from 'react';\n\n/** Matches ag-grid's row animation closely enough to feel familiar. */\nexport const ROW_MOVE_DURATION = 120;\n\nexport interface UseRowMoveAnimationOptions {\n  isEnabled: boolean;\n  /** The `<tbody>` the rows live in. */\n  bodyRef: RefObject<HTMLTableSectionElement | null>;\n  /** @default 120 */\n  duration?: number;\n}\n\n/** Matches `DisplayTransition`'s check, which is the kit's existing precedent. */\nfunction prefersReducedMotion() {\n  return (\n    typeof window !== 'undefined' &&\n    Boolean(window.matchMedia?.('(prefers-reduced-motion: reduce)')?.matches)\n  );\n}\n\n/**\n * Slides rows to their new positions when the order changes.\n *\n * FLIP: the previous commit's positions are the First, this commit's are the\n * Last, and each row is Inverted with a `translateY` back to where it was and\n * then Played to zero. The DOM is already correct the whole time — only the\n * paint is behind — so a test or a screen reader sees the new order\n * immediately, and nothing has to be delayed or double-rendered.\n *\n * Sorting a table otherwise teleports every row at once, and the eye has no way\n * to follow a particular one to where it went. The whole value is in tracking\n * one row, which is why this animates positions rather than cross-fading.\n *\n * **Only a reorder**, and only rows that were already on screen. If the rows\n * common to both commits are in the same relative order, nothing animates,\n * however much their positions moved — that is a relayout, not a reorder, and\n * it covers the initial mount (widths resolving, the virtualizer measuring, a\n * scrollbar appearing), a container resize, and a filter that only removes\n * rows.\n *\n * Scrolling is not movement either, and that falls out of measuring `offsetTop`\n * rather than viewport coordinates: it is relative to the scroller's content,\n * so it does not change as the content scrolls past.\n */\nexport function useRowMoveAnimation({\n  isEnabled,\n  bodyRef,\n  duration = ROW_MOVE_DURATION,\n}: UseRowMoveAnimationOptions) {\n  const previousRef = useRef<Map<string, number> | null>(null);\n  const previousOrderRef = useRef<string[]>([]);\n\n  // No dependency array: the previous positions have to be captured after every\n  // commit, because any of them may turn out to be the one a reorder starts\n  // from.\n  useLayoutEffect(() => {\n    const body = bodyRef.current;\n\n    if (!body) return;\n\n    const rows = Array.from(\n      body.querySelectorAll<HTMLTableRowElement>(\n        // Pinned rows are excluded by the selector rather than filtered later:\n        // they do not take part in the order, so they never move.\n        'tr[data-element=\"Row\"][data-key]:not([data-pinned])',\n      ),\n    );\n\n    // `offsetTop`, not `getBoundingClientRect()`: it is relative to the\n    // scroller, so scrolling does not read as movement. Otherwise every scroll\n    // tick would look like a reorder of the whole page.\n    const next = new Map<string, number>();\n\n    for (const row of rows) next.set(row.dataset.key!, row.offsetTop);\n\n    const previous = previousRef.current;\n    const previousOrder = previousOrderRef.current;\n    const nextOrder = rows.map((row) => row.dataset.key!);\n\n    previousRef.current = next;\n    previousOrderRef.current = nextOrder;\n\n    // Checked per commit rather than once: the setting can change mid-session,\n    // and the position bookkeeping above must keep running either way so the\n    // animation is correct the moment it is turned back on.\n    if (!isEnabled || prefersReducedMotion() || !previous) return;\n\n    // Animate a REORDER, never a relayout.\n    //\n    // Positions shift for all sorts of reasons that are not a row moving: the\n    // column widths resolving after the first measure, the virtualizer taking\n    // its measurements, a scrollbar appearing, a font landing, the container\n    // being resized. Every one of those happens on the second commit of a\n    // normal mount — so keying off \"an offset changed\" animated the table into\n    // existence on load, which is exactly what a load should not do.\n    //\n    // Comparing the order of the rows common to both commits answers the real\n    // question. A relayout leaves it identical; a sort does not.\n    const stillHere = new Set(nextOrder);\n    const before = previousOrder.filter((key) => stillHere.has(key));\n    const after = nextOrder.filter((key) => previous.has(key));\n    const isReorder =\n      before.length !== after.length ||\n      before.some((key, index) => key !== after[index]);\n\n    if (!isReorder) return;\n\n    const moved: { row: HTMLTableRowElement; delta: number }[] = [];\n\n    for (const row of rows) {\n      const from = previous.get(row.dataset.key!);\n\n      // A row that was not here before has nowhere to come from. Skipped rather\n      // than bailing on the whole batch: a virtualized window swaps some of its\n      // rows on every re-sort, and refusing to animate unless ALL of them are\n      // familiar means a virtualized grid — most result grids — never animates\n      // at all.\n      if (from === undefined) continue;\n\n      const delta = from - next.get(row.dataset.key!)!;\n\n      if (delta !== 0) moved.push({ row, delta });\n    }\n\n    if (!moved.length) return;\n\n    // Invert: put every moved row back where it was, with transitions off so\n    // this jump is not itself animated.\n    for (const { row, delta } of moved) {\n      row.style.transition = 'none';\n      row.style.transform = `translateY(${delta}px)`;\n    }\n\n    // Flush the inverted state into layout, so the browser has something to\n    // animate FROM. A forced reflow rather than `requestAnimationFrame`,\n    // deliberately: rAF does not fire in a hidden tab, and a sort that lands\n    // while the tab is in the background would leave every row frozen at its\n    // old position until the next reorder. One reflow, once per animation.\n    void body.offsetHeight;\n\n    // Play.\n    for (const { row } of moved) {\n      row.style.transition = `transform ${duration}ms ease-out`;\n      row.style.transform = '';\n    }\n\n    // Clear on arrival. A `transition` left inline would go on to animate\n    // transforms this hook never set — a dragged row, for one.\n    //\n    // A timer rather than `transitionend`, for the same reason the invert does\n    // not use `requestAnimationFrame`: in a hidden tab the transition never\n    // runs, so the event never fires and every animated row keeps its inline\n    // `transition` for the rest of the session. The duration is known exactly,\n    // so there is nothing to wait to be told.\n    const clear = () => {\n      for (const { row } of moved) {\n        row.style.transition = '';\n        row.style.transform = '';\n      }\n    };\n    const timer = setTimeout(clear, duration);\n\n    return () => {\n      // A reorder landing mid-animation starts over from wherever the rows are,\n      // so nothing may be left behind.\n      clearTimeout(timer);\n      clear();\n    };\n  });\n}\n"],"mappings":";;;;;;AAKA,MAAaG,oBAAoB;;AAWjC,SAASM,uBAAuB;AAC9B,QACE,OAAOC,WAAW,eAClBC,QAAQD,OAAOE,aAAa,mCAAmC,EAAEC,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;AA4B7E,SAAOC,oBAAAC,IAAA;CAAA,MAAAC,IAAAC,EAAA,EAAA;CAA6B,MAAA,EAAAZ,WAAAC,SAAAE,UAAAU,OAAAH;CAGlC,MAAAP,WAAAU,OAAAC,SAAAhB,oBAAAe;CAEA,MAAAE,cAAoBnB,OAAmC,KAAK;CAAC,IAAAoB;AAAA,KAAAL,EAAA,OAAAM,OAAAC,IAAA,4BAAA,EAAA;AACnBF,OAAA,EAAE;AAAAL,IAAA,KAAAK;OAAAA,MAAAL,EAAA;CAA5C,MAAAQ,mBAAyBvB,OAAiBoB,GAAG;CAAC,IAAAI;AAAA,KAAAT,EAAA,OAAAV,WAAAU,EAAA,OAAAR,YAAAQ,EAAA,OAAAX,WAAA;AAK9BoB,aAAA;GACd,MAAAC,OAAapB,QAAOqB;AAEpB,OAAI,CAACD,KAAI;GAET,MAAAE,OAAaC,MAAKC,KAChBJ,KAAIK,iBAGF,wDAEJ,CAAC;GAKD,MAAAC,uBAAa,IAAIC,KAAqB;AAEtC,QAAK,MAAAC,OAAaN,KAAMI,MAAIG,IAAKD,IAAGE,QAAQC,KAAOH,IAAGI,UAAW;GAEjE,MAAAC,WAAiBnB,YAAWO;GAC5B,MAAAa,gBAAsBhB,iBAAgBG;GACtC,MAAAc,YAAkBb,KAAIc,IAAKC,MAA0B;AAErDvB,eAAWO,UAAWK;AACtBR,oBAAgBG,UAAWc;AAK3B,OAAI,CAACpC,aAAaI,sBAAmC,IAAjD,CAAyC8B,SAAQ;GAarD,MAAAK,YAAkB,IAAIC,IAAIJ,UAAU;GACpC,MAAAK,SAAeN,cAAaO,QAAQV,QAASO,UAASI,IAAKX,IAAI,CAAC;GAChE,MAAAY,QAAcR,UAASM,QAAQG,UAASX,SAAQS,IAAKX,MAAI,CAAC;AAK1D,OAAI,EAHFS,OAAMM,WAAYH,MAAKG,UACvBN,OAAMO,MAAMC,OAAAC,UAAgBlB,UAAQY,MAAMM,OAAO,EAErC;GAEd,MAAAC,QAA6D,EAAE;AAE/D,QAAK,MAAAC,SAAa7B,MAAI;IACpB,MAAAE,OAAaS,SAAQmB,IAAKxB,MAAGE,QAAQC,IAAM;AAO3C,QAAIP,SAASX,OAAW;IAExB,MAAAwC,QAAc7B,OAAOE,KAAI0B,IAAKxB,MAAGE,QAAQC,IAAO;AAEhD,QAAIsB,UAAU,EAAGH,OAAKI,KAAM;KAAA1B,KAAEA;KAAGyB;KAAS,CAAC;;AAG7C,OAAI,CAACH,MAAKJ,OAAO;AAIjB,QAAK,MAAA,EAAAlB,KAAA2B,OAAAF,OAAAG,aAAwBN,OAAK;AAChCtB,UAAG6B,MAAMC,aAAc;AACvB9B,UAAG6B,MAAME,YAAa,cAAcN,QAAK;;AAW3C,QAAK,MAAA,EAAAzB,KAAAgC,WAAiBV,OAAK;AACzBtB,UAAG6B,MAAMC,aAAc,aAAaxD,SAAQ;AAC5C0B,UAAG6B,MAAME,YAAa;;GAWxB,MAAAE,cAAc;AACZ,SAAK,MAAA,EAAAjC,KAAAkC,WAAiBZ,OAAK;AACzBtB,WAAG6B,MAAMC,aAAc;AACvB9B,WAAG6B,MAAME,YAAa;;;GAG1B,MAAAI,QAAcC,WAAWH,OAAO3D,SAAS;AAAC,gBAEnC;AAGL+D,iBAAaF,MAAM;AACnBF,WAAO;;;AAEVnD,IAAA,KAAAV;AAAAU,IAAA,KAAAR;AAAAQ,IAAA,KAAAX;AAAAW,IAAA,KAAAS;OAAAA,MAAAT,EAAA;AAjHDhB,iBAAgByB,GAiHd;;AA5HG,SAAAkB,MAAA6B,OAAA;AAAA,QAiCiCtC,MAAGE,QAAQC"}
+{"version":3,"file":"use-row-move-animation.js","names":["useLayoutEffect","useRef","RefObject","ROW_MOVE_DURATION","UseRowMoveAnimationOptions","isEnabled","bodyRef","HTMLTableSectionElement","duration","prefersReducedMotion","window","Boolean","matchMedia","matches","useRowMoveAnimation","t0","$","_c","t1","undefined","previousRef","t2","Symbol","for","previousOrderRef","t3","body","current","rows","Array","from","querySelectorAll","next","Map","row","set","dataset","key","offsetTop","previous","previousOrder","nextOrder","map","_temp","stillHere","Set","before","filter","has","after","key_0","isReorder","length","some","key_1","index","moved","row_1","get","delta","push","row_2","delta_0","style","transition","transform","row_3","clear","row_4","timer","setTimeout","clearTimeout","row_0"],"sources":["../../../../src/components/data/TableBase/use-row-move-animation.ts"],"sourcesContent":["import { useLayoutEffect, useRef } from 'react';\n\nimport type { RefObject } from 'react';\n\n/** Matches ag-grid's row animation closely enough to feel familiar. */\nexport const ROW_MOVE_DURATION = 120;\n\nexport interface UseRowMoveAnimationOptions {\n  isEnabled: boolean;\n  /** The `<tbody>` the rows live in. */\n  bodyRef: RefObject<HTMLTableSectionElement | null>;\n  /** @default 120 */\n  duration?: number;\n}\n\n/** Matches `DisplayTransition`'s check, which is the kit's existing precedent. */\nfunction prefersReducedMotion() {\n  return (\n    typeof window !== 'undefined' &&\n    Boolean(window.matchMedia?.('(prefers-reduced-motion: reduce)')?.matches)\n  );\n}\n\n/**\n * Slides rows to their new positions when the order changes.\n *\n * FLIP: the previous commit's positions are the First, this commit's are the\n * Last, and each row is Inverted with a `translateY` back to where it was and\n * then Played to zero. The DOM is already correct the whole time — only the\n * paint is behind — so a test or a screen reader sees the new order\n * immediately, and nothing has to be delayed or double-rendered.\n *\n * Sorting a table otherwise teleports every row at once, and the eye has no way\n * to follow a particular one to where it went. The whole value is in tracking\n * one row, which is why this animates positions rather than cross-fading.\n *\n * **Only a reorder**, and only rows that were already on screen. If the rows\n * common to both commits are in the same relative order, nothing animates,\n * however much their positions moved — that is a relayout, not a reorder, and\n * it covers the initial mount (widths resolving, the virtualizer measuring, a\n * scrollbar appearing), a container resize, and a filter that only removes\n * rows.\n *\n * Scrolling is not movement either, and that falls out of measuring `offsetTop`\n * rather than viewport coordinates: it is relative to the scroller's content,\n * so it does not change as the content scrolls past.\n */\nexport function useRowMoveAnimation({\n  isEnabled,\n  bodyRef,\n  duration = ROW_MOVE_DURATION,\n}: UseRowMoveAnimationOptions) {\n  const previousRef = useRef<Map<string, number> | null>(null);\n  const previousOrderRef = useRef<string[]>([]);\n\n  // No dependency array: positions are captured after every enabled commit,\n  // because any of them may be the one a reorder starts from.\n  useLayoutEffect(() => {\n    const body = bodyRef.current;\n\n    if (!body || !isEnabled || prefersReducedMotion()) {\n      // Enabling starts a fresh snapshot; disabled frames need no geometry.\n      previousRef.current = null;\n      previousOrderRef.current = [];\n      return;\n    }\n\n    const rows = Array.from(\n      body.querySelectorAll<HTMLTableRowElement>(\n        // Pinned rows are excluded by the selector rather than filtered later:\n        // they do not take part in the order, so they never move.\n        'tr[data-element=\"Row\"][data-key]:not([data-pinned])',\n      ),\n    );\n\n    // `offsetTop`, not `getBoundingClientRect()`: it is relative to the\n    // scroller, so scrolling does not read as movement. Otherwise every scroll\n    // tick would look like a reorder of the whole page.\n    const next = new Map<string, number>();\n\n    for (const row of rows) next.set(row.dataset.key!, row.offsetTop);\n\n    const previous = previousRef.current;\n    const previousOrder = previousOrderRef.current;\n    const nextOrder = rows.map((row) => row.dataset.key!);\n\n    previousRef.current = next;\n    previousOrderRef.current = nextOrder;\n\n    if (!previous) return;\n\n    // Animate a REORDER, never a relayout.\n    //\n    // Positions shift for all sorts of reasons that are not a row moving: the\n    // column widths resolving after the first measure, the virtualizer taking\n    // its measurements, a scrollbar appearing, a font landing, the container\n    // being resized. Every one of those happens on the second commit of a\n    // normal mount — so keying off \"an offset changed\" animated the table into\n    // existence on load, which is exactly what a load should not do.\n    //\n    // Comparing the order of the rows common to both commits answers the real\n    // question. A relayout leaves it identical; a sort does not.\n    const stillHere = new Set(nextOrder);\n    const before = previousOrder.filter((key) => stillHere.has(key));\n    const after = nextOrder.filter((key) => previous.has(key));\n    const isReorder =\n      before.length !== after.length ||\n      before.some((key, index) => key !== after[index]);\n\n    if (!isReorder) return;\n\n    const moved: { row: HTMLTableRowElement; delta: number }[] = [];\n\n    for (const row of rows) {\n      const from = previous.get(row.dataset.key!);\n\n      // A row that was not here before has nowhere to come from. Skipped rather\n      // than bailing on the whole batch: a virtualized window swaps some of its\n      // rows on every re-sort, and refusing to animate unless ALL of them are\n      // familiar means a virtualized grid — most result grids — never animates\n      // at all.\n      if (from === undefined) continue;\n\n      const delta = from - next.get(row.dataset.key!)!;\n\n      if (delta !== 0) moved.push({ row, delta });\n    }\n\n    if (!moved.length) return;\n\n    // Invert: put every moved row back where it was, with transitions off so\n    // this jump is not itself animated.\n    for (const { row, delta } of moved) {\n      row.style.transition = 'none';\n      row.style.transform = `translateY(${delta}px)`;\n    }\n\n    // Flush the inverted state into layout, so the browser has something to\n    // animate FROM. A forced reflow rather than `requestAnimationFrame`,\n    // deliberately: rAF does not fire in a hidden tab, and a sort that lands\n    // while the tab is in the background would leave every row frozen at its\n    // old position until the next reorder. One reflow, once per animation.\n    void body.offsetHeight;\n\n    // Play.\n    for (const { row } of moved) {\n      row.style.transition = `transform ${duration}ms ease-out`;\n      row.style.transform = '';\n    }\n\n    // Clear on arrival. A `transition` left inline would go on to animate\n    // transforms this hook never set — a dragged row, for one.\n    //\n    // A timer rather than `transitionend`, for the same reason the invert does\n    // not use `requestAnimationFrame`: in a hidden tab the transition never\n    // runs, so the event never fires and every animated row keeps its inline\n    // `transition` for the rest of the session. The duration is known exactly,\n    // so there is nothing to wait to be told.\n    const clear = () => {\n      for (const { row } of moved) {\n        row.style.transition = '';\n        row.style.transform = '';\n      }\n    };\n    const timer = setTimeout(clear, duration);\n\n    return () => {\n      // A reorder landing mid-animation starts over from wherever the rows are,\n      // so nothing may be left behind.\n      clearTimeout(timer);\n      clear();\n    };\n  });\n}\n"],"mappings":";;;;;;AAKA,MAAaG,oBAAoB;;AAWjC,SAASM,uBAAuB;AAC9B,QACE,OAAOC,WAAW,eAClBC,QAAQD,OAAOE,aAAa,mCAAmC,EAAEC,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;AA4B7E,SAAOC,oBAAAC,IAAA;CAAA,MAAAC,IAAAC,EAAA,EAAA;CAA6B,MAAA,EAAAZ,WAAAC,SAAAE,UAAAU,OAAAH;CAGlC,MAAAP,WAAAU,OAAAC,SAAAhB,oBAAAe;CAEA,MAAAE,cAAoBnB,OAAmC,KAAK;CAAC,IAAAoB;AAAA,KAAAL,EAAA,OAAAM,OAAAC,IAAA,4BAAA,EAAA;AACnBF,OAAA,EAAE;AAAAL,IAAA,KAAAK;OAAAA,MAAAL,EAAA;CAA5C,MAAAQ,mBAAyBvB,OAAiBoB,GAAG;CAAC,IAAAI;AAAA,KAAAT,EAAA,OAAAV,WAAAU,EAAA,OAAAR,YAAAQ,EAAA,OAAAX,WAAA;AAI9BoB,aAAA;GACd,MAAAC,OAAapB,QAAOqB;AAEpB,OAAI,CAACD,QAAD,CAAUrB,aAAaI,sBAAsB,EAAA;AAE/CW,gBAAWO,UAAW;AACtBH,qBAAgBG,UAAW,EAAH;AAAA;;GAI1B,MAAAC,OAAaC,MAAKC,KAChBJ,KAAIK,iBAGF,wDAEJ,CAAC;GAKD,MAAAC,uBAAa,IAAIC,KAAqB;AAEtC,QAAK,MAAAC,OAAaN,KAAMI,MAAIG,IAAKD,IAAGE,QAAQC,KAAOH,IAAGI,UAAW;GAEjE,MAAAC,WAAiBnB,YAAWO;GAC5B,MAAAa,gBAAsBhB,iBAAgBG;GACtC,MAAAc,YAAkBb,KAAIc,IAAKC,MAA0B;AAErDvB,eAAWO,UAAWK;AACtBR,oBAAgBG,UAAWc;AAE3B,OAAI,CAACF,SAAQ;GAab,MAAAK,YAAkB,IAAIC,IAAIJ,UAAU;GACpC,MAAAK,SAAeN,cAAaO,QAAQV,QAASO,UAASI,IAAKX,IAAI,CAAC;GAChE,MAAAY,QAAcR,UAASM,QAAQG,UAASX,SAAQS,IAAKX,MAAI,CAAC;AAK1D,OAAI,EAHFS,OAAMM,WAAYH,MAAKG,UACvBN,OAAMO,MAAMC,OAAAC,UAAgBlB,UAAQY,MAAMM,OAAO,EAErC;GAEd,MAAAC,QAA6D,EAAE;AAE/D,QAAK,MAAAC,SAAa7B,MAAI;IACpB,MAAAE,OAAaS,SAAQmB,IAAKxB,MAAGE,QAAQC,IAAM;AAO3C,QAAIP,SAASX,OAAW;IAExB,MAAAwC,QAAc7B,OAAOE,KAAI0B,IAAKxB,MAAGE,QAAQC,IAAO;AAEhD,QAAIsB,UAAU,EAAGH,OAAKI,KAAM;KAAA1B,KAAEA;KAAGyB;KAAS,CAAC;;AAG7C,OAAI,CAACH,MAAKJ,OAAO;AAIjB,QAAK,MAAA,EAAAlB,KAAA2B,OAAAF,OAAAG,aAAwBN,OAAK;AAChCtB,UAAG6B,MAAMC,aAAc;AACvB9B,UAAG6B,MAAME,YAAa,cAAcN,QAAK;;AAW3C,QAAK,MAAA,EAAAzB,KAAAgC,WAAiBV,OAAK;AACzBtB,UAAG6B,MAAMC,aAAc,aAAaxD,SAAQ;AAC5C0B,UAAG6B,MAAME,YAAa;;GAWxB,MAAAE,cAAc;AACZ,SAAK,MAAA,EAAAjC,KAAAkC,WAAiBZ,OAAK;AACzBtB,WAAG6B,MAAMC,aAAc;AACvB9B,WAAG6B,MAAME,YAAa;;;GAG1B,MAAAI,QAAcC,WAAWH,OAAO3D,SAAS;AAAC,gBAEnC;AAGL+D,iBAAaF,MAAM;AACnBF,WAAO;;;AAEVnD,IAAA,KAAAV;AAAAU,IAAA,KAAAR;AAAAQ,IAAA,KAAAX;AAAAW,IAAA,KAAAS;OAAAA,MAAAT,EAAA;AAnHDhB,iBAAgByB,GAmHd;;AA7HG,SAAAkB,MAAA6B,OAAA;AAAA,QAqCiCtC,MAAGE,QAAQC"}

package/dist/components/data/TableBase/use-scrollability.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { c } from "react/compiler-runtime";
 import { useLayoutEffect, useState } from "react";
 

package/dist/components/data/TableBase/use-table-columns.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { c } from "react/compiler-runtime";
 
 //#region src/components/data/TableBase/use-table-columns.ts
@@ -66,6 +66,149 @@ function clamp(value, min, max) {
 	return Math.min(Math.max(value, min), max ?? Number.POSITIVE_INFINITY);
 }
 /**
+* The visible columns in visual order. Pinned columns lead and trail
+* regardless of their position in the source array, so `aria-colindex` and DOM
+* order agree and nothing needs CSS `order:` to be reshuffled.
+*/
+function orderColumns(columns) {
+	const visible = columns.filter((column) => !column.isHidden);
+	return [
+		...visible.filter((c) => c.pin === "start"),
+		...visible.filter((c) => !c.pin),
+		...visible.filter((c) => c.pin === "end")
+	];
+}
+function toColumnSpec(column, isStructural, columnWidths) {
+	const explicit = columnWidths?.[column.key] ?? column.width;
+	const minWidth = column.minWidth ?? (explicit != null ? explicit : isStructural ? 0 : DEFAULT_MIN_WIDTH);
+	return {
+		column,
+		isStructural,
+		fixed: explicit ?? null,
+		minWidth,
+		maxWidth: column.maxWidth ?? null,
+		flex: explicit != null ? null : column.flex ?? 1
+	};
+}
+function sumFlex(specs) {
+	return specs.reduce((sum, s) => sum + (s.flex ?? 1), 0);
+}
+/**
+* Splits `available` pixels across the flex columns by weight. Each pass
+* assigns proportional widths, freezes whatever hit a bound, and re-splits the
+* leftover among the rest.
+*/
+function distributeFlexWidths(flexSpecs, available, resolved) {
+	let remaining = available;
+	let pool = flexSpecs;
+	while (pool.length > 0) {
+		const totalFlex = sumFlex(pool);
+		const nextPool = [];
+		let consumed = 0;
+		for (const spec of pool) {
+			const ideal = remaining * (spec.flex ?? 1) / (totalFlex || 1);
+			const clamped = clamp(ideal, spec.minWidth, spec.maxWidth);
+			if (clamped !== ideal) {
+				resolved.set(spec.column.key, clamped);
+				consumed += clamped;
+			} else nextPool.push(spec);
+		}
+		if (nextPool.length === pool.length) {
+			const totalLeft = sumFlex(nextPool);
+			for (const spec of nextPool) resolved.set(spec.column.key, remaining * (spec.flex ?? 1) / (totalLeft || 1));
+			break;
+		}
+		remaining -= consumed;
+		pool = nextPool;
+	}
+}
+/**
+* Each column's pixel width, keyed by column key; none before the container is
+* measured. When even the minimums do not fit, every column takes its minimum
+* and the table overflows.
+*/
+function resolveWidths(specs, containerWidth) {
+	const resolved = /* @__PURE__ */ new Map();
+	if (!(containerWidth != null && containerWidth > 0)) return {
+		resolved,
+		isOverflowing: false
+	};
+	if (specs.reduce((sum, s) => sum + (s.fixed ?? s.minWidth), 0) > containerWidth) {
+		for (const spec of specs) resolved.set(spec.column.key, spec.fixed ?? spec.minWidth);
+		return {
+			resolved,
+			isOverflowing: true
+		};
+	}
+	const fixedTotal = specs.reduce((sum, s) => sum + (s.fixed ?? 0), 0);
+	distributeFlexWidths(specs.filter((s) => s.fixed == null), containerWidth - fixedTotal, resolved);
+	for (const spec of specs) if (spec.fixed != null) resolved.set(spec.column.key, spec.fixed);
+	return {
+		resolved,
+		isOverflowing: false
+	};
+}
+/**
+* Sets each pinned column's sticky offset, which accumulates inwards from its
+* edge, and marks the innermost pinned column on each side. Returns the width
+* pinned to each side.
+*/
+function applyPinOffsets(columns) {
+	let pinnedStartWidth = 0;
+	let pinnedEndWidth = 0;
+	for (const column of columns) {
+		if (column.pin !== "start") continue;
+		column.pinOffset = pinnedStartWidth;
+		pinnedStartWidth += column.width ?? column.minWidth;
+	}
+	for (let i = columns.length - 1; i >= 0; i--) {
+		const column = columns[i];
+		if (column.pin !== "end") continue;
+		column.pinOffset = pinnedEndWidth;
+		pinnedEndWidth += column.width ?? column.minWidth;
+	}
+	const lastPinnedStart = columns.filter((c) => c.pin === "start").at(-1);
+	const firstPinnedEnd = columns.find((c) => c.pin === "end");
+	if (lastPinnedStart) lastPinnedStart.isPinEdge = true;
+	if (firstPinnedEnd) firstPinnedEnd.isPinEdge = true;
+	return {
+		pinnedStartWidth,
+		pinnedEndWidth
+	};
+}
+function resolveColumnLayout({ columns, containerWidth, columnWidths, leadingColumns, trailingColumns }) {
+	const leading = leadingColumns ?? [];
+	const trailing = trailingColumns ?? [];
+	const structuralKeys = new Set([...leading, ...trailing].map((c) => c.key));
+	const specs = orderColumns([
+		...leading,
+		...columns,
+		...trailing
+	]).map((column) => toColumnSpec(column, structuralKeys.has(column.key), columnWidths));
+	const { resolved, isOverflowing } = resolveWidths(specs, containerWidth);
+	const out = specs.map((spec, index) => ({
+		...spec.column,
+		index,
+		ariaColIndex: index + 1,
+		width: resolved.get(spec.column.key) ?? null,
+		minWidth: spec.minWidth,
+		maxWidth: spec.maxWidth,
+		flex: spec.flex,
+		align: spec.column.align ?? "start",
+		pinOffset: null,
+		isPinEdge: false,
+		isStructural: spec.isStructural
+	}));
+	const { pinnedStartWidth, pinnedEndWidth } = applyPinOffsets(out);
+	return {
+		columns: out,
+		pinnedStartWidth,
+		pinnedEndWidth,
+		totalWidth: out.every((c) => c.width != null) ? out.reduce((sum, c) => sum + (c.width ?? 0), 0) : null,
+		isOverflowing
+	};
+}
+/**
 * Normalizes the public column list into resolved leaves: visual order, ARIA
 * indices, pixel widths, and sticky offsets for pinned columns.
 *
@@ -77,180 +220,25 @@ function clamp(value, min, max) {
 * and the table scrolls horizontally.
 */
 function useTableColumns(t0) {
-	const $ = c(16);
+	const $ = c(6);
 	const { columns, containerWidth, columnWidths, leadingColumns, trailingColumns } = t0;
-	let isOverflowing;
-	let out;
-	let pinnedEndWidth;
-	let pinnedStartWidth;
 	let t1;
 	if ($[0] !== columnWidths || $[1] !== columns || $[2] !== containerWidth || $[3] !== leadingColumns || $[4] !== trailingColumns) {
-		const visible = [
-			...leadingColumns ?? [],
-			...columns,
-			...trailingColumns ?? []
-		].filter(_temp);
-		const ordered = [
-			...visible.filter(_temp2),
-			...visible.filter(_temp3),
-			...visible.filter(_temp4)
-		];
-		const structuralKeys = new Set([...leadingColumns ?? [], ...trailingColumns ?? []].map(_temp5));
-		const specs = ordered.map((column_0) => {
-			const isStructural = structuralKeys.has(column_0.key);
-			const explicit = columnWidths?.[column_0.key] ?? column_0.width;
-			const minWidth = column_0.minWidth ?? (explicit != null ? explicit : isStructural ? 0 : DEFAULT_MIN_WIDTH);
-			return {
-				column: column_0,
-				isStructural,
-				fixed: explicit ?? null,
-				minWidth,
-				maxWidth: column_0.maxWidth ?? null,
-				flex: explicit != null ? null : column_0.flex ?? 1
-			};
+		t1 = resolveColumnLayout({
+			columns,
+			containerWidth,
+			columnWidths,
+			leadingColumns,
+			trailingColumns
 		});
-		const resolved = /* @__PURE__ */ new Map();
-		isOverflowing = false;
-		if (containerWidth != null && containerWidth > 0) {
-			const fixedTotal = specs.reduce(_temp6, 0);
-			const flexSpecs = specs.filter(_temp7);
-			if (specs.reduce(_temp8, 0) > containerWidth) {
-				isOverflowing = true;
-				for (const spec of specs) resolved.set(spec.column.key, spec.fixed ?? spec.minWidth);
-			} else {
-				let remaining = containerWidth - fixedTotal;
-				let pool = flexSpecs;
-				while (pool.length > 0) {
-					const totalFlex = pool.reduce(_temp9, 0);
-					const nextPool = [];
-					let consumed = 0;
-					for (const spec_0 of pool) {
-						const ideal = remaining * (spec_0.flex ?? 1) / (totalFlex || 1);
-						const clamped = clamp(ideal, spec_0.minWidth, spec_0.maxWidth);
-						if (clamped !== ideal) {
-							resolved.set(spec_0.column.key, clamped);
-							consumed = consumed + clamped;
-						} else nextPool.push(spec_0);
-					}
-					if (nextPool.length === pool.length) {
-						const totalLeft = nextPool.reduce(_temp0, 0);
-						for (const spec_1 of nextPool) resolved.set(spec_1.column.key, remaining * (spec_1.flex ?? 1) / (totalLeft || 1));
-						break;
-					}
-					remaining = remaining - consumed;
-					pool = nextPool;
-				}
-				for (const spec_2 of specs) if (spec_2.fixed != null) resolved.set(spec_2.column.key, spec_2.fixed);
-			}
-		}
-		pinnedStartWidth = 0;
-		pinnedEndWidth = 0;
-		out = specs.map((spec_3, index) => ({
-			...spec_3.column,
-			index,
-			ariaColIndex: index + 1,
-			width: resolved.get(spec_3.column.key) ?? null,
-			minWidth: spec_3.minWidth,
-			maxWidth: spec_3.maxWidth,
-			flex: spec_3.flex,
-			align: spec_3.column.align ?? "start",
-			pinOffset: null,
-			isPinEdge: false,
-			isStructural: spec_3.isStructural
-		}));
-		for (const column_1 of out) {
-			if (column_1.pin !== "start") continue;
-			column_1.pinOffset = pinnedStartWidth;
-			pinnedStartWidth = pinnedStartWidth + (column_1.width ?? column_1.minWidth);
-		}
-		for (let i = out.length - 1; i >= 0; i--) {
-			const column_2 = out[i];
-			if (column_2.pin !== "end") continue;
-			column_2.pinOffset = pinnedEndWidth;
-			pinnedEndWidth = pinnedEndWidth + (column_2.width ?? column_2.minWidth);
-		}
-		const lastPinnedStart = out.filter(_temp1).at(-1);
-		const firstPinnedEnd = out.find(_temp10);
-		if (lastPinnedStart) lastPinnedStart.isPinEdge = true;
-		if (firstPinnedEnd) firstPinnedEnd.isPinEdge = true;
-		t1 = out.every(_temp11) ? out.reduce(_temp12, 0) : null;
 		$[0] = columnWidths;
 		$[1] = columns;
 		$[2] = containerWidth;
 		$[3] = leadingColumns;
 		$[4] = trailingColumns;
-		$[5] = isOverflowing;
-		$[6] = out;
-		$[7] = pinnedEndWidth;
-		$[8] = pinnedStartWidth;
-		$[9] = t1;
-	} else {
-		isOverflowing = $[5];
-		out = $[6];
-		pinnedEndWidth = $[7];
-		pinnedStartWidth = $[8];
-		t1 = $[9];
-	}
-	const totalWidth = t1;
-	let t2;
-	if ($[10] !== isOverflowing || $[11] !== out || $[12] !== pinnedEndWidth || $[13] !== pinnedStartWidth || $[14] !== totalWidth) {
-		t2 = {
-			columns: out,
-			pinnedStartWidth,
-			pinnedEndWidth,
-			totalWidth,
-			isOverflowing
-		};
-		$[10] = isOverflowing;
-		$[11] = out;
-		$[12] = pinnedEndWidth;
-		$[13] = pinnedStartWidth;
-		$[14] = totalWidth;
-		$[15] = t2;
-	} else t2 = $[15];
-	return t2;
-}
-function _temp12(sum_3, c_5) {
-	return sum_3 + (c_5.width ?? 0);
-}
-function _temp11(c_6) {
-	return c_6.width != null;
-}
-function _temp10(c_4) {
-	return c_4.pin === "end";
-}
-function _temp1(c_3) {
-	return c_3.pin === "start";
-}
-function _temp0(sum_2, s_3) {
-	return sum_2 + (s_3.flex ?? 1);
-}
-function _temp9(sum_1, s_2) {
-	return sum_1 + (s_2.flex ?? 1);
-}
-function _temp8(sum_0, s_1) {
-	return sum_0 + (s_1.fixed ?? s_1.minWidth);
-}
-function _temp7(s_0) {
-	return s_0.fixed == null;
-}
-function _temp6(sum, s) {
-	return sum + (s.fixed ?? 0);
-}
-function _temp5(c_2) {
-	return c_2.key;
-}
-function _temp4(c_1) {
-	return c_1.pin === "end";
-}
-function _temp3(c_0) {
-	return !c_0.pin;
-}
-function _temp2(c) {
-	return c.pin === "start";
-}
-function _temp(column) {
-	return !column.isHidden;
+		$[5] = t1;
+	} else t1 = $[5];
+	return t1;
 }
 
 //#endregion

package/dist/components/data/TableBase/use-table-columns.js.map

@@ -1 +1 @@
-{"version":3,"file":"use-table-columns.js","names":["useMemo","CubeResolvedColumn","CubeTableColumn","CubeTableColumnLayout","DEFAULT_MIN_WIDTH","freezeColumnWidths","layout","T","base","Record","columns","reduce","widths","column","isStructural","width","key","Math","round","readPath","row","path","undefined","includes","current","part","split","ValueColumn","Pick","getColumnValue","rowIndex","getValue","getColumnText","value","format","type","String","Date","toISOString","clamp","min","max","Number","POSITIVE_INFINITY","UseTableColumnsOptions","containerWidth","columnWidths","leadingColumns","trailingColumns","useTableColumns","t0","$","_c","isOverflowing","out","pinnedEndWidth","pinnedStartWidth","t1","visible","filter","_temp","ordered","_temp2","_temp3","_temp4","structuralKeys","Set","map","_temp5","specs","column_0","has","explicit","minWidth","fixed","maxWidth","flex","resolved","Map","fixedTotal","_temp6","flexSpecs","_temp7","minTotal","_temp8","spec","set","remaining","pool","length","totalFlex","_temp9","nextPool","consumed","spec_0","ideal","clamped","push","totalLeft","_temp0","spec_1","spec_2","spec_3","index","ariaColIndex","get","align","pinOffset","isPinEdge","column_1","pin","i","column_2","lastPinnedStart","_temp1","at","firstPinnedEnd","find","_temp10","every","_temp11","_temp12","totalWidth","t2","sum_3","c_5","sum","c","c_6","c_4","c_3","sum_2","s_3","s","sum_1","s_2","sum_0","s_1","s_0","c_2","c_1","c_0","isHidden"],"sources":["../../../../src/components/data/TableBase/use-table-columns.ts"],"sourcesContent":["import { useMemo } from 'react';\n\nimport type {\n  CubeResolvedColumn,\n  CubeTableColumn,\n  CubeTableColumnLayout,\n} from './types';\n\n/** @default when a column declares neither `width` nor `minWidth`. */\nexport const DEFAULT_MIN_WIDTH = 150;\n\n/**\n * Every column's current width, so a resize can change exactly one of them.\n *\n * A column with no explicit width is `flex: 1` and shares the leftover (see the\n * spec builder below). Making only the DRAGGED column fixed leaves every other\n * one in the flex pool, re-splitting a leftover that just changed — so one\n * divider moved all of them, including columns to the LEFT of the handle, which\n * cannot be what dragging a right edge means. Measured before this existed:\n * dragging column B by +8px took 3px off A, C and D each.\n *\n * Freezing first means a drag changes one width. Columns after it are pushed\n * along, which is what being after it means, and the table grows or shrinks\n * rather than the neighbours absorbing the difference.\n *\n * Structural columns are skipped — they are sized by the table, not the user.\n */\nexport function freezeColumnWidths<T>(\n  layout: CubeTableColumnLayout<T> | null,\n  base: Record<string, number>,\n): Record<string, number> {\n  return (layout?.columns ?? []).reduce<Record<string, number>>(\n    (widths, column) => {\n      if (!column.isStructural && column.width != null) {\n        widths[column.key] = Math.round(column.width);\n      }\n\n      return widths;\n    },\n    { ...base },\n  );\n}\n\n/**\n * Reads `key` as a data path. A plain key is a single property lookup; dots\n * walk nested objects (`'owner.name'`). Anything richer belongs in `getValue`.\n */\nexport function readPath(row: any, path: string): unknown {\n  if (row == null) return undefined;\n  if (!path.includes('.')) return row[path];\n\n  let current: any = row;\n\n  for (const part of path.split('.')) {\n    if (current == null) return undefined;\n    current = current[part];\n  }\n\n  return current;\n}\n\n/** Only the value-pipeline members, so both raw and resolved columns fit. */\ntype ValueColumn<T> = Pick<CubeTableColumn<T>, 'key' | 'getValue' | 'format'>;\n\nexport function getColumnValue<T>(\n  column: ValueColumn<T>,\n  row: T,\n  rowIndex: number,\n): unknown {\n  return column.getValue\n    ? column.getValue(row, rowIndex)\n    : readPath(row, column.key);\n}\n\n/**\n * Display text for a cell — what client sort, client search and TSV copy all\n * operate on. Deliberately NOT the rendered output: `render` may return\n * arbitrary React, and stringifying that is how cloud's filter ended up\n * matching `\"[object Object]\"` against the query `\"object\"`.\n *\n * Returns `null` when the column cannot produce text, so callers can skip it\n * rather than coerce a non-primitive.\n */\nexport function getColumnText<T>(\n  column: ValueColumn<T>,\n  row: T,\n  rowIndex: number,\n): string | null {\n  const value = getColumnValue(column, row, rowIndex);\n\n  if (column.format) return column.format(value, row, rowIndex);\n  if (value == null) return '';\n\n  const type = typeof value;\n\n  if (type === 'string') return value as string;\n  if (type === 'number' || type === 'boolean' || type === 'bigint') {\n    return String(value);\n  }\n  if (value instanceof Date) return value.toISOString();\n\n  return null;\n}\n\nfunction clamp(value: number, min: number, max: number | null): number {\n  return Math.min(Math.max(value, min), max ?? Number.POSITIVE_INFINITY);\n}\n\nexport interface UseTableColumnsOptions<T> {\n  columns: CubeTableColumn<T>[];\n  /** Content-box width of the scroller, or `null` before the first measure. */\n  containerWidth: number | null;\n  /** User-resized widths, keyed by column key. Wins over `column.width`. */\n  columnWidths?: Record<string, number>;\n  /** Extra leading columns owned by the table (selection, drag handle). */\n  leadingColumns?: CubeTableColumn<T>[];\n  /** Extra trailing columns owned by the table (row menu). */\n  trailingColumns?: CubeTableColumn<T>[];\n}\n\n/**\n * Normalizes the public column list into resolved leaves: visual order, ARIA\n * indices, pixel widths, and sticky offsets for pinned columns.\n *\n * Width resolution mirrors ag-grid's `fitGridWidth`: fixed columns take their\n * width, the remainder is split across flex columns by weight, and each result\n * is clamped to `[minWidth, maxWidth]`. Clamping perturbs the sum, so the\n * residual is redistributed across the still-unclamped columns until it\n * settles. When even the minimums do not fit, every column takes its minimum\n * and the table scrolls horizontally.\n */\nexport function useTableColumns<T>({\n  columns,\n  containerWidth,\n  columnWidths,\n  leadingColumns,\n  trailingColumns,\n}: UseTableColumnsOptions<T>): CubeTableColumnLayout<T> {\n  return useMemo(() => {\n    const visible = [\n      ...(leadingColumns ?? []),\n      ...columns,\n      ...(trailingColumns ?? []),\n    ].filter((column) => !column.isHidden);\n\n    // Pinned columns lead and trail regardless of their position in the source\n    // array, so `aria-colindex` and DOM order agree and nothing needs CSS\n    // `order:` to be reshuffled.\n    const ordered = [\n      ...visible.filter((c) => c.pin === 'start'),\n      ...visible.filter((c) => !c.pin),\n      ...visible.filter((c) => c.pin === 'end'),\n    ];\n\n    const structuralKeys = new Set(\n      [...(leadingColumns ?? []), ...(trailingColumns ?? [])].map((c) => c.key),\n    );\n\n    const specs = ordered.map((column) => {\n      const isStructural = structuralKeys.has(column.key);\n      const explicit = columnWidths?.[column.key] ?? column.width;\n      const minWidth =\n        column.minWidth ??\n        (explicit != null ? explicit : isStructural ? 0 : DEFAULT_MIN_WIDTH);\n\n      return {\n        column,\n        isStructural,\n        fixed: explicit ?? null,\n        minWidth,\n        maxWidth: column.maxWidth ?? null,\n        flex: explicit != null ? null : column.flex ?? 1,\n      };\n    });\n\n    const resolved = new Map<string, number>();\n    let isOverflowing = false;\n\n    if (containerWidth != null && containerWidth > 0) {\n      const fixedTotal = specs.reduce((sum, s) => sum + (s.fixed ?? 0), 0);\n      const flexSpecs = specs.filter((s) => s.fixed == null);\n      const minTotal = specs.reduce(\n        (sum, s) => sum + (s.fixed ?? s.minWidth),\n        0,\n      );\n\n      if (minTotal > containerWidth) {\n        isOverflowing = true;\n        for (const spec of specs) {\n          resolved.set(spec.column.key, spec.fixed ?? spec.minWidth);\n        }\n      } else {\n        let remaining = containerWidth - fixedTotal;\n        let pool = flexSpecs;\n\n        // Each pass assigns proportional widths, freezes whatever hit a bound,\n        // and re-splits the leftover among the rest.\n        while (pool.length > 0) {\n          const totalFlex = pool.reduce((sum, s) => sum + (s.flex ?? 1), 0);\n          const nextPool: typeof pool = [];\n          let consumed = 0;\n\n          for (const spec of pool) {\n            const ideal = (remaining * (spec.flex ?? 1)) / (totalFlex || 1);\n            const clamped = clamp(ideal, spec.minWidth, spec.maxWidth);\n\n            if (clamped !== ideal) {\n              resolved.set(spec.column.key, clamped);\n              consumed += clamped;\n            } else {\n              nextPool.push(spec);\n            }\n          }\n\n          if (nextPool.length === pool.length) {\n            // Nothing was clamped this pass — the proportional split stands.\n            const totalLeft = nextPool.reduce(\n              (sum, s) => sum + (s.flex ?? 1),\n              0,\n            );\n            for (const spec of nextPool) {\n              resolved.set(\n                spec.column.key,\n                (remaining * (spec.flex ?? 1)) / (totalLeft || 1),\n              );\n            }\n            break;\n          }\n\n          remaining -= consumed;\n          pool = nextPool;\n        }\n\n        for (const spec of specs) {\n          if (spec.fixed != null) resolved.set(spec.column.key, spec.fixed);\n        }\n      }\n    }\n\n    let pinnedStartWidth = 0;\n    let pinnedEndWidth = 0;\n\n    const out: CubeResolvedColumn<T>[] = specs.map((spec, index) => ({\n      ...spec.column,\n      index,\n      ariaColIndex: index + 1,\n      width: resolved.get(spec.column.key) ?? null,\n      minWidth: spec.minWidth,\n      maxWidth: spec.maxWidth,\n      flex: spec.flex,\n      align: spec.column.align ?? 'start',\n      pinOffset: null,\n      isPinEdge: false,\n      isStructural: spec.isStructural,\n    }));\n\n    // Sticky offsets accumulate inwards from each edge.\n    for (const column of out) {\n      if (column.pin !== 'start') continue;\n      column.pinOffset = pinnedStartWidth;\n      pinnedStartWidth += column.width ?? column.minWidth;\n    }\n\n    for (let i = out.length - 1; i >= 0; i--) {\n      const column = out[i];\n      if (column.pin !== 'end') continue;\n      column.pinOffset = pinnedEndWidth;\n      pinnedEndWidth += column.width ?? column.minWidth;\n    }\n\n    const lastPinnedStart = out.filter((c) => c.pin === 'start').at(-1);\n    const firstPinnedEnd = out.find((c) => c.pin === 'end');\n\n    if (lastPinnedStart) lastPinnedStart.isPinEdge = true;\n    if (firstPinnedEnd) firstPinnedEnd.isPinEdge = true;\n\n    const totalWidth = out.every((c) => c.width != null)\n      ? out.reduce((sum, c) => sum + (c.width ?? 0), 0)\n      : null;\n\n    return {\n      columns: out,\n      pinnedStartWidth,\n      pinnedEndWidth,\n      totalWidth,\n      isOverflowing,\n    };\n  }, [columns, containerWidth, columnWidths, leadingColumns, trailingColumns]);\n}\n"],"mappings":";;;;;AASA,MAAaI,oBAAoB;;;;;;;;;;;;;;;;;AAkBjC,SAAgBC,mBACdC,QACAE,MACwB;AACxB,SAAQF,QAAQI,WAAW,EAAE,EAAEC,QAC5BC,QAAQC,WAAW;AAClB,MAAI,CAACA,OAAOC,gBAAgBD,OAAOE,SAAS,KAC1CH,QAAOC,OAAOG,OAAOC,KAAKC,MAAML,OAAOE,MAAM;AAG/C,SAAOH;IAET,EAAE,GAAGJ,MACP,CAAC;;;;;;AAOH,SAAgBW,SAASC,KAAUC,MAAuB;AACxD,KAAID,OAAO,KAAM,QAAOE;AACxB,KAAI,CAACD,KAAKE,SAAS,IAAI,CAAE,QAAOH,IAAIC;CAEpC,IAAIG,UAAeJ;AAEnB,MAAK,MAAMK,QAAQJ,KAAKK,MAAM,IAAI,EAAE;AAClC,MAAIF,WAAW,KAAM,QAAOF;AAC5BE,YAAUA,QAAQC;;AAGpB,QAAOD;;AAMT,SAAgBK,eACdhB,QACAO,KACAU,UACS;AACT,QAAOjB,OAAOkB,WACVlB,OAAOkB,SAASX,KAAKU,SAAS,GAC9BX,SAASC,KAAKP,OAAOG,IAAI;;;;;;;;;;;AAY/B,SAAgBgB,cACdnB,QACAO,KACAU,UACe;CACf,MAAMG,QAAQJ,eAAehB,QAAQO,KAAKU,SAAS;AAEnD,KAAIjB,OAAOqB,OAAQ,QAAOrB,OAAOqB,OAAOD,OAAOb,KAAKU,SAAS;AAC7D,KAAIG,SAAS,KAAM,QAAO;CAE1B,MAAME,OAAO,OAAOF;AAEpB,KAAIE,SAAS,SAAU,QAAOF;AAC9B,KAAIE,SAAS,YAAYA,SAAS,aAAaA,SAAS,SACtD,QAAOC,OAAOH,MAAM;AAEtB,KAAIA,iBAAiBI,KAAM,QAAOJ,MAAMK,aAAa;AAErD,QAAO;;AAGT,SAASC,MAAMN,OAAeO,KAAaC,KAA4B;AACrE,QAAOxB,KAAKuB,IAAIvB,KAAKwB,IAAIR,OAAOO,IAAI,EAAEC,OAAOC,OAAOC,kBAAkB;;;;;;;;;;;;;AA0BxE,SAAOM,gBAAAC,IAAA;CAAA,MAAAC,IAAAC,EAAA,GAAA;CAA4B,MAAA,EAAA1C,SAAAmC,gBAAAC,cAAAC,gBAAAC,oBAAAE;CAMP,IAAAG;CAAA,IAAAC;CAAA,IAAAC;CAAA,IAAAC;CAAA,IAAAC;AAAA,KAAAN,EAAA,OAAAL,gBAAAK,EAAA,OAAAzC,WAAAyC,EAAA,OAAAN,kBAAAM,EAAA,OAAAJ,kBAAAI,EAAA,OAAAH,iBAAA;EAExB,MAAAU,UAAgB;GAAA,GACVX,kBAAA,EAAoB;GAAA,GACrBrC;GAAO,GACNsC,mBAAA,EAAqB;GAC1B,CAAAW,OAAQC,MAA6B;EAKtC,MAAAC,UAAgB;GAAA,GACXH,QAAOC,OAAQG,OAAyB;GAAA,GACxCJ,QAAOC,OAAQI,OAAc;GAAA,GAC7BL,QAAOC,OAAQK,OAAuB;GAC1C;EAED,MAAAC,iBAAuB,IAAIC,IACzB,CAAA,GAAKnB,kBAAA,EAAoB,EAAA,GAAOC,mBAAA,EAAqB,CAAE,CAAAmB,IAAKC,OAC9D,CAAC;EAED,MAAAC,QAAcR,QAAOM,KAAKG,aAAA;GACxB,MAAAxD,eAAqBmD,eAAcM,IAAK1D,SAAMG,IAAK;GACnD,MAAAwD,WAAiB1B,eAAejC,SAAMG,QAASH,SAAME;GACrD,MAAA0D,WACE5D,SAAM4D,aACLD,YAAY,OAAZA,WAA8B1D,eAAA,IAAAV;AAAsC,UAEhE;IAAAS,QACLA;IAAMC;IAAA4D,OAECF,YAAA;IAAgBC;IAAAE,UAEb9D,SAAM8D,YAAN;IAAuBC,MAC3BJ,YAAY,OAAZ,OAA0B3D,SAAM+D,QAAN;IACjC;IACD;EAEF,MAAAC,2BAAiB,IAAIC,KAAqB;AAC1CzB,kBAAoB;AAEpB,MAAIR,kBAAkB,QAAQA,iBAAiB,GAAC;GAC9C,MAAAkC,aAAmBV,MAAK1D,OAAQqE,QAAkC,EAAE;GACpE,MAAAC,YAAkBZ,MAAKV,OAAQuB,OAAuB;AAMtD,OALiBb,MAAK1D,OACpByE,QACA,EACD,GAEcvC,gBAAc;AAC3BQ,oBAAgBA;AAChB,SAAK,MAAAgC,QAAchB,MACjBQ,UAAQS,IAAKD,KAAIxE,OAAOG,KAAMqE,KAAIX,SAAUW,KAAIZ,SAAU;UAC3D;IAED,IAAAc,YAAgB1C,iBAAiBkC;IACjC,IAAAS,OAAWP;AAIX,WAAOO,KAAIC,SAAU,GAkCpB;KAjCC,MAAAC,YAAkBF,KAAI7E,OAAQgF,QAAiC,EAAE;KACjE,MAAAC,WAA8B,EAAE;KAChC,IAAAC,WAAe;AAEf,UAAK,MAAAC,UAAcN,MAAI;MACrB,MAAAO,QAAeR,aAAaF,OAAIT,QAAJ,MAAoBc,aAAA;MAChD,MAAAM,UAAgBzD,MAAMwD,OAAOV,OAAIZ,UAAWY,OAAIV,SAAU;AAE1D,UAAIqB,YAAYD,OAAK;AACnBlB,gBAAQS,IAAKD,OAAIxE,OAAOG,KAAMgF,QAAQ;AACtCH,kBAAAA,WAAYG;YAEZJ,UAAQK,KAAMZ,OAAK;;AAIvB,SAAIO,SAAQH,WAAYD,KAAIC,QAAO;MAEjC,MAAAS,YAAkBN,SAAQjF,OACxBwF,QACA,EACD;AACD,WAAK,MAAAC,UAAcR,SACjBf,UAAQS,IACND,OAAIxE,OAAOG,KACVuE,aAAaF,OAAIT,QAAJ,MAAoBsB,aAAA,GACnC;AAEH;;AAGFX,iBAAAA,YAAaM;AACbL,YAAOI;;AAGT,SAAK,MAAAS,UAAchC,MACjB,KAAIgB,OAAIX,SAAU,KAAMG,UAAQS,IAAKD,OAAIxE,OAAOG,KAAMqE,OAAIX,MAAO;;;AAKvElB,qBAAuB;AACvBD,mBAAqB;AAErBD,QAAqCe,MAAKF,KAAKmC,QAAAC,WAAkB;GAAA,GAC5DlB,OAAIxE;GAAO0F;GAAAC,cAEAD,QAAQ;GAACxF,OAChB8D,SAAQ4B,IAAKpB,OAAIxE,OAAOG,IAAa,IAArC;GAAqCyD,UAClCY,OAAIZ;GAASE,UACbU,OAAIV;GAASC,MACjBS,OAAIT;GAAK8B,OACRrB,OAAIxE,OAAO6F,SAAX;GAA4BC,WACxB;GAAIC,WACJ;GAAK9F,cACFuE,OAAIvE;GACnB,EAAE;AAGH,OAAK,MAAA+F,YAAgBvD,KAAG;AACtB,OAAIzC,SAAMiG,QAAS,QAAS;AAC5BjG,YAAM8F,YAAanD;AACnBA,sBAAAA,oBAAoB3C,SAAME,SAAUF,SAAM4D;;AAG5C,OAAA,IAAAsC,IAAazD,IAAGmC,SAAU,GAAGsB,KAAK,GAAGA,KAAG;GACtC,MAAAC,WAAe1D,IAAIyD;AACnB,OAAIlG,SAAMiG,QAAS,MAAO;AAC1BjG,YAAM8F,YAAapD;AACnBA,oBAAAA,kBAAkB1C,SAAME,SAAUF,SAAM4D;;EAG1C,MAAAwC,kBAAwB3D,IAAGK,OAAQuD,OAAyB,CAAAC,GAAI,GAAG;EACnE,MAAAC,iBAAuB9D,IAAG+D,KAAMC,QAAuB;AAEvD,MAAIL,gBAAiBA,iBAAeL,YAAa;AACjD,MAAIQ,eAAgBA,gBAAcR,YAAa;AAE5BnD,OAAAH,IAAGiE,MAAOC,QAErB,GADJlE,IAAG3C,OAAQ8G,SAAkC,EACzC,GAFW;AAEXtE,IAAA,KAAAL;AAAAK,IAAA,KAAAzC;AAAAyC,IAAA,KAAAN;AAAAM,IAAA,KAAAJ;AAAAI,IAAA,KAAAH;AAAAG,IAAA,KAAAE;AAAAF,IAAA,KAAAG;AAAAH,IAAA,KAAAI;AAAAJ,IAAA,KAAAK;AAAAL,IAAA,KAAAM;QAAA;AAAAJ,kBAAAF,EAAA;AAAAG,QAAAH,EAAA;AAAAI,mBAAAJ,EAAA;AAAAK,qBAAAL,EAAA;AAAAM,OAAAN,EAAA;;CAFR,MAAAuE,aAAmBjE;CAEV,IAAAkE;AAAA,KAAAxE,EAAA,QAAAE,iBAAAF,EAAA,QAAAG,OAAAH,EAAA,QAAAI,kBAAAJ,EAAA,QAAAK,oBAAAL,EAAA,QAAAuE,YAAA;AAEFC,OAAA;GAAAjH,SACI4C;GAAGE;GAAAD;GAAAmE;GAAArE;GAKb;AAAAF,IAAA,MAAAE;AAAAF,IAAA,MAAAG;AAAAH,IAAA,MAAAI;AAAAJ,IAAA,MAAAK;AAAAL,IAAA,MAAAuE;AAAAvE,IAAA,MAAAwE;OAAAA,MAAAxE,EAAA;AAAA,QANDwE;;AArJG,SAAAF,QAAAG,OAAAC,KAAA;AAAA,QAkJwBC,SAAOC,IAAChH,SAAD;;AAlJ/B,SAAAyG,QAAAQ,KAAA;AAAA,QAiJiCD,IAAChH,SAAU;;AAjJ5C,SAAAuG,QAAAW,KAAA;AAAA,QA4IoCF,IAACjB,QAAS;;AA5I9C,SAAAI,OAAAgB,KAAA;AAAA,QA2IuCH,IAACjB,QAAS;;AA3IjD,SAAAX,OAAAgC,OAAAC,KAAA;AAAA,QAsFmBN,SAAOO,IAACzD,QAAD;;AAtF1B,SAAAe,OAAA2C,OAAAC,KAAA;AAAA,QAmE6CT,SAAOO,IAACzD,QAAD;;AAnEpD,SAAAQ,OAAAoD,OAAAC,KAAA;AAAA,QAmDaX,SAAOO,IAAC3D,SAAU2D,IAAC5D;;AAnDhC,SAAAS,OAAAwD,KAAA;AAAA,QAiDqCL,IAAC3D,SAAU;;AAjDhD,SAAAM,OAAA8C,KAAAO,GAAA;AAAA,QAgD2CP,OAAOO,EAAC3D,SAAD;;AAhDlD,SAAAN,OAAAuE,KAAA;AAAA,QAwBkEZ,IAAC/G;;AAxBnE,SAAAgD,OAAA4E,KAAA;AAAA,QAoBwBb,IAACjB,QAAS;;AApBlC,SAAA/C,OAAA8E,KAAA;AAAA,QAmBwB,CAACd,IAACjB;;AAnB1B,SAAAhD,OAAAiE,GAAA;AAAA,QAkBwBA,EAACjB,QAAS;;AAlBlC,SAAAlD,MAAA/C,QAAA;AAAA,QAYkB,CAACA,OAAMiI"}
+{"version":3,"file":"use-table-columns.js","names":["useMemo","CubeResolvedColumn","CubeTableColumn","CubeTableColumnLayout","DEFAULT_MIN_WIDTH","freezeColumnWidths","layout","T","base","Record","columns","reduce","widths","column","isStructural","width","key","Math","round","readPath","row","path","undefined","includes","current","part","split","ValueColumn","Pick","getColumnValue","rowIndex","getValue","getColumnText","value","format","type","String","Date","toISOString","clamp","min","max","Number","POSITIVE_INFINITY","UseTableColumnsOptions","containerWidth","columnWidths","leadingColumns","trailingColumns","ColumnSpec","fixed","minWidth","maxWidth","flex","orderColumns","visible","filter","isHidden","c","pin","toColumnSpec","explicit","sumFlex","specs","sum","s","distributeFlexWidths","flexSpecs","available","resolved","Map","remaining","pool","length","totalFlex","nextPool","consumed","spec","ideal","clamped","set","push","totalLeft","resolveWidths","isOverflowing","isMeasured","minTotal","fixedTotal","applyPinOffsets","pinnedStartWidth","pinnedEndWidth","pinOffset","i","lastPinnedStart","at","firstPinnedEnd","find","isPinEdge","resolveColumnLayout","leading","trailing","structuralKeys","Set","map","has","out","index","ariaColIndex","get","align","totalWidth","every","useTableColumns","t0","$","_c","t1"],"sources":["../../../../src/components/data/TableBase/use-table-columns.ts"],"sourcesContent":["import { useMemo } from 'react';\n\nimport type {\n  CubeResolvedColumn,\n  CubeTableColumn,\n  CubeTableColumnLayout,\n} from './types';\n\n/** @default when a column declares neither `width` nor `minWidth`. */\nexport const DEFAULT_MIN_WIDTH = 150;\n\n/**\n * Every column's current width, so a resize can change exactly one of them.\n *\n * A column with no explicit width is `flex: 1` and shares the leftover (see the\n * spec builder below). Making only the DRAGGED column fixed leaves every other\n * one in the flex pool, re-splitting a leftover that just changed — so one\n * divider moved all of them, including columns to the LEFT of the handle, which\n * cannot be what dragging a right edge means. Measured before this existed:\n * dragging column B by +8px took 3px off A, C and D each.\n *\n * Freezing first means a drag changes one width. Columns after it are pushed\n * along, which is what being after it means, and the table grows or shrinks\n * rather than the neighbours absorbing the difference.\n *\n * Structural columns are skipped — they are sized by the table, not the user.\n */\nexport function freezeColumnWidths<T>(\n  layout: CubeTableColumnLayout<T> | null,\n  base: Record<string, number>,\n): Record<string, number> {\n  return (layout?.columns ?? []).reduce<Record<string, number>>(\n    (widths, column) => {\n      if (!column.isStructural && column.width != null) {\n        widths[column.key] = Math.round(column.width);\n      }\n\n      return widths;\n    },\n    { ...base },\n  );\n}\n\n/**\n * Reads `key` as a data path. A plain key is a single property lookup; dots\n * walk nested objects (`'owner.name'`). Anything richer belongs in `getValue`.\n */\nexport function readPath(row: any, path: string): unknown {\n  if (row == null) return undefined;\n  if (!path.includes('.')) return row[path];\n\n  let current: any = row;\n\n  for (const part of path.split('.')) {\n    if (current == null) return undefined;\n    current = current[part];\n  }\n\n  return current;\n}\n\n/** Only the value-pipeline members, so both raw and resolved columns fit. */\ntype ValueColumn<T> = Pick<CubeTableColumn<T>, 'key' | 'getValue' | 'format'>;\n\nexport function getColumnValue<T>(\n  column: ValueColumn<T>,\n  row: T,\n  rowIndex: number,\n): unknown {\n  return column.getValue\n    ? column.getValue(row, rowIndex)\n    : readPath(row, column.key);\n}\n\n/**\n * Display text for a cell — what client sort, client search and TSV copy all\n * operate on. Deliberately NOT the rendered output: `render` may return\n * arbitrary React, and stringifying that is how cloud's filter ended up\n * matching `\"[object Object]\"` against the query `\"object\"`.\n *\n * Returns `null` when the column cannot produce text, so callers can skip it\n * rather than coerce a non-primitive.\n */\nexport function getColumnText<T>(\n  column: ValueColumn<T>,\n  row: T,\n  rowIndex: number,\n): string | null {\n  const value = getColumnValue(column, row, rowIndex);\n\n  if (column.format) return column.format(value, row, rowIndex);\n  if (value == null) return '';\n\n  const type = typeof value;\n\n  if (type === 'string') return value as string;\n  if (type === 'number' || type === 'boolean' || type === 'bigint') {\n    return String(value);\n  }\n  if (value instanceof Date) return value.toISOString();\n\n  return null;\n}\n\nfunction clamp(value: number, min: number, max: number | null): number {\n  return Math.min(Math.max(value, min), max ?? Number.POSITIVE_INFINITY);\n}\n\nexport interface UseTableColumnsOptions<T> {\n  columns: CubeTableColumn<T>[];\n  /** Content-box width of the scroller, or `null` before the first measure. */\n  containerWidth: number | null;\n  /** User-resized widths, keyed by column key. Wins over `column.width`. */\n  columnWidths?: Record<string, number>;\n  /** Extra leading columns owned by the table (selection, drag handle). */\n  leadingColumns?: CubeTableColumn<T>[];\n  /** Extra trailing columns owned by the table (row menu). */\n  trailingColumns?: CubeTableColumn<T>[];\n}\n\n/** A column's sizing inputs, before the container is split between columns. */\ninterface ColumnSpec<T> {\n  column: CubeTableColumn<T>;\n  isStructural: boolean;\n  fixed: number | null;\n  minWidth: number;\n  maxWidth: number | null;\n  flex: number | null;\n}\n\n/**\n * The visible columns in visual order. Pinned columns lead and trail\n * regardless of their position in the source array, so `aria-colindex` and DOM\n * order agree and nothing needs CSS `order:` to be reshuffled.\n */\nfunction orderColumns<T>(columns: CubeTableColumn<T>[]): CubeTableColumn<T>[] {\n  const visible = columns.filter((column) => !column.isHidden);\n\n  return [\n    ...visible.filter((c) => c.pin === 'start'),\n    ...visible.filter((c) => !c.pin),\n    ...visible.filter((c) => c.pin === 'end'),\n  ];\n}\n\nfunction toColumnSpec<T>(\n  column: CubeTableColumn<T>,\n  isStructural: boolean,\n  columnWidths: Record<string, number> | undefined,\n): ColumnSpec<T> {\n  const explicit = columnWidths?.[column.key] ?? column.width;\n  const minWidth =\n    column.minWidth ??\n    (explicit != null ? explicit : isStructural ? 0 : DEFAULT_MIN_WIDTH);\n\n  return {\n    column,\n    isStructural,\n    fixed: explicit ?? null,\n    minWidth,\n    maxWidth: column.maxWidth ?? null,\n    flex: explicit != null ? null : column.flex ?? 1,\n  };\n}\n\nfunction sumFlex<T>(specs: ColumnSpec<T>[]): number {\n  return specs.reduce((sum, s) => sum + (s.flex ?? 1), 0);\n}\n\n/**\n * Splits `available` pixels across the flex columns by weight. Each pass\n * assigns proportional widths, freezes whatever hit a bound, and re-splits the\n * leftover among the rest.\n */\nfunction distributeFlexWidths<T>(\n  flexSpecs: ColumnSpec<T>[],\n  available: number,\n  resolved: Map<string, number>,\n): void {\n  let remaining = available;\n  let pool = flexSpecs;\n\n  while (pool.length > 0) {\n    const totalFlex = sumFlex(pool);\n    const nextPool: typeof pool = [];\n    let consumed = 0;\n\n    for (const spec of pool) {\n      const ideal = (remaining * (spec.flex ?? 1)) / (totalFlex || 1);\n      const clamped = clamp(ideal, spec.minWidth, spec.maxWidth);\n\n      if (clamped !== ideal) {\n        resolved.set(spec.column.key, clamped);\n        consumed += clamped;\n      } else {\n        nextPool.push(spec);\n      }\n    }\n\n    if (nextPool.length === pool.length) {\n      // Nothing was clamped this pass — the proportional split stands.\n      const totalLeft = sumFlex(nextPool);\n      for (const spec of nextPool) {\n        resolved.set(\n          spec.column.key,\n          (remaining * (spec.flex ?? 1)) / (totalLeft || 1),\n        );\n      }\n      break;\n    }\n\n    remaining -= consumed;\n    pool = nextPool;\n  }\n}\n\n/**\n * Each column's pixel width, keyed by column key; none before the container is\n * measured. When even the minimums do not fit, every column takes its minimum\n * and the table overflows.\n */\nfunction resolveWidths<T>(\n  specs: ColumnSpec<T>[],\n  containerWidth: number | null,\n): { resolved: Map<string, number>; isOverflowing: boolean } {\n  const resolved = new Map<string, number>();\n  const isMeasured = containerWidth != null && containerWidth > 0;\n\n  if (!isMeasured) return { resolved, isOverflowing: false };\n\n  const minTotal = specs.reduce((sum, s) => sum + (s.fixed ?? s.minWidth), 0);\n\n  if (minTotal > containerWidth) {\n    for (const spec of specs) {\n      resolved.set(spec.column.key, spec.fixed ?? spec.minWidth);\n    }\n\n    return { resolved, isOverflowing: true };\n  }\n\n  const fixedTotal = specs.reduce((sum, s) => sum + (s.fixed ?? 0), 0);\n\n  distributeFlexWidths(\n    specs.filter((s) => s.fixed == null),\n    containerWidth - fixedTotal,\n    resolved,\n  );\n\n  for (const spec of specs) {\n    if (spec.fixed != null) resolved.set(spec.column.key, spec.fixed);\n  }\n\n  return { resolved, isOverflowing: false };\n}\n\n/**\n * Sets each pinned column's sticky offset, which accumulates inwards from its\n * edge, and marks the innermost pinned column on each side. Returns the width\n * pinned to each side.\n */\nfunction applyPinOffsets<T>(columns: CubeResolvedColumn<T>[]): {\n  pinnedStartWidth: number;\n  pinnedEndWidth: number;\n} {\n  let pinnedStartWidth = 0;\n  let pinnedEndWidth = 0;\n\n  for (const column of columns) {\n    if (column.pin !== 'start') continue;\n    column.pinOffset = pinnedStartWidth;\n    pinnedStartWidth += column.width ?? column.minWidth;\n  }\n\n  for (let i = columns.length - 1; i >= 0; i--) {\n    const column = columns[i];\n    if (column.pin !== 'end') continue;\n    column.pinOffset = pinnedEndWidth;\n    pinnedEndWidth += column.width ?? column.minWidth;\n  }\n\n  const lastPinnedStart = columns.filter((c) => c.pin === 'start').at(-1);\n  const firstPinnedEnd = columns.find((c) => c.pin === 'end');\n\n  if (lastPinnedStart) lastPinnedStart.isPinEdge = true;\n  if (firstPinnedEnd) firstPinnedEnd.isPinEdge = true;\n\n  return { pinnedStartWidth, pinnedEndWidth };\n}\n\nfunction resolveColumnLayout<T>({\n  columns,\n  containerWidth,\n  columnWidths,\n  leadingColumns,\n  trailingColumns,\n}: UseTableColumnsOptions<T>): CubeTableColumnLayout<T> {\n  const leading = leadingColumns ?? [];\n  const trailing = trailingColumns ?? [];\n  const structuralKeys = new Set([...leading, ...trailing].map((c) => c.key));\n  const specs = orderColumns([...leading, ...columns, ...trailing]).map(\n    (column) =>\n      toColumnSpec(column, structuralKeys.has(column.key), columnWidths),\n  );\n  const { resolved, isOverflowing } = resolveWidths(specs, containerWidth);\n\n  const out: CubeResolvedColumn<T>[] = specs.map((spec, index) => ({\n    ...spec.column,\n    index,\n    ariaColIndex: index + 1,\n    width: resolved.get(spec.column.key) ?? null,\n    minWidth: spec.minWidth,\n    maxWidth: spec.maxWidth,\n    flex: spec.flex,\n    align: spec.column.align ?? 'start',\n    pinOffset: null,\n    isPinEdge: false,\n    isStructural: spec.isStructural,\n  }));\n\n  const { pinnedStartWidth, pinnedEndWidth } = applyPinOffsets(out);\n\n  const totalWidth = out.every((c) => c.width != null)\n    ? out.reduce((sum, c) => sum + (c.width ?? 0), 0)\n    : null;\n\n  return {\n    columns: out,\n    pinnedStartWidth,\n    pinnedEndWidth,\n    totalWidth,\n    isOverflowing,\n  };\n}\n\n/**\n * Normalizes the public column list into resolved leaves: visual order, ARIA\n * indices, pixel widths, and sticky offsets for pinned columns.\n *\n * Width resolution mirrors ag-grid's `fitGridWidth`: fixed columns take their\n * width, the remainder is split across flex columns by weight, and each result\n * is clamped to `[minWidth, maxWidth]`. Clamping perturbs the sum, so the\n * residual is redistributed across the still-unclamped columns until it\n * settles. When even the minimums do not fit, every column takes its minimum\n * and the table scrolls horizontally.\n */\nexport function useTableColumns<T>({\n  columns,\n  containerWidth,\n  columnWidths,\n  leadingColumns,\n  trailingColumns,\n}: UseTableColumnsOptions<T>): CubeTableColumnLayout<T> {\n  return useMemo(\n    () =>\n      resolveColumnLayout({\n        columns,\n        containerWidth,\n        columnWidths,\n        leadingColumns,\n        trailingColumns,\n      }),\n    [columns, containerWidth, columnWidths, leadingColumns, trailingColumns],\n  );\n}\n"],"mappings":";;;;;AASA,MAAaI,oBAAoB;;;;;;;;;;;;;;;;;AAkBjC,SAAgBC,mBACdC,QACAE,MACwB;AACxB,SAAQF,QAAQI,WAAW,EAAE,EAAEC,QAC5BC,QAAQC,WAAW;AAClB,MAAI,CAACA,OAAOC,gBAAgBD,OAAOE,SAAS,KAC1CH,QAAOC,OAAOG,OAAOC,KAAKC,MAAML,OAAOE,MAAM;AAG/C,SAAOH;IAET,EAAE,GAAGJ,MACP,CAAC;;;;;;AAOH,SAAgBW,SAASC,KAAUC,MAAuB;AACxD,KAAID,OAAO,KAAM,QAAOE;AACxB,KAAI,CAACD,KAAKE,SAAS,IAAI,CAAE,QAAOH,IAAIC;CAEpC,IAAIG,UAAeJ;AAEnB,MAAK,MAAMK,QAAQJ,KAAKK,MAAM,IAAI,EAAE;AAClC,MAAIF,WAAW,KAAM,QAAOF;AAC5BE,YAAUA,QAAQC;;AAGpB,QAAOD;;AAMT,SAAgBK,eACdhB,QACAO,KACAU,UACS;AACT,QAAOjB,OAAOkB,WACVlB,OAAOkB,SAASX,KAAKU,SAAS,GAC9BX,SAASC,KAAKP,OAAOG,IAAI;;;;;;;;;;;AAY/B,SAAgBgB,cACdnB,QACAO,KACAU,UACe;CACf,MAAMG,QAAQJ,eAAehB,QAAQO,KAAKU,SAAS;AAEnD,KAAIjB,OAAOqB,OAAQ,QAAOrB,OAAOqB,OAAOD,OAAOb,KAAKU,SAAS;AAC7D,KAAIG,SAAS,KAAM,QAAO;CAE1B,MAAME,OAAO,OAAOF;AAEpB,KAAIE,SAAS,SAAU,QAAOF;AAC9B,KAAIE,SAAS,YAAYA,SAAS,aAAaA,SAAS,SACtD,QAAOC,OAAOH,MAAM;AAEtB,KAAIA,iBAAiBI,KAAM,QAAOJ,MAAMK,aAAa;AAErD,QAAO;;AAGT,SAASC,MAAMN,OAAeO,KAAaC,KAA4B;AACrE,QAAOxB,KAAKuB,IAAIvB,KAAKwB,IAAIR,OAAOO,IAAI,EAAEC,OAAOC,OAAOC,kBAAkB;;;;;;;AA8BxE,SAASW,aAAgB5C,SAAqD;CAC5E,MAAM6C,UAAU7C,QAAQ8C,QAAQ3C,WAAW,CAACA,OAAO4C,SAAS;AAE5D,QAAO;EACL,GAAGF,QAAQC,QAAQE,MAAMA,EAAEC,QAAQ,QAAQ;EAC3C,GAAGJ,QAAQC,QAAQE,MAAM,CAACA,EAAEC,IAAI;EAChC,GAAGJ,QAAQC,QAAQE,MAAMA,EAAEC,QAAQ,MAAM;EAC1C;;AAGH,SAASC,aACP/C,QACAC,cACAgC,cACe;CACf,MAAMe,WAAWf,eAAejC,OAAOG,QAAQH,OAAOE;CACtD,MAAMoC,WACJtC,OAAOsC,aACNU,YAAY,OAAOA,WAAW/C,eAAe,IAAIV;AAEpD,QAAO;EACLS;EACAC;EACAoC,OAAOW,YAAY;EACnBV;EACAC,UAAUvC,OAAOuC,YAAY;EAC7BC,MAAMQ,YAAY,OAAO,OAAOhD,OAAOwC,QAAQ;EAChD;;AAGH,SAASS,QAAWC,OAAgC;AAClD,QAAOA,MAAMpD,QAAQqD,KAAKC,MAAMD,OAAOC,EAAEZ,QAAQ,IAAI,EAAE;;;;;;;AAQzD,SAASa,qBACPC,WACAC,WACAC,UACM;CACN,IAAIE,YAAYH;CAChB,IAAII,OAAOL;AAEX,QAAOK,KAAKC,SAAS,GAAG;EACtB,MAAMC,YAAYZ,QAAQU,KAAK;EAC/B,MAAMG,WAAwB,EAAE;EAChC,IAAIC,WAAW;AAEf,OAAK,MAAMC,QAAQL,MAAM;GACvB,MAAMM,QAASP,aAAaM,KAAKxB,QAAQ,MAAOqB,aAAa;GAC7D,MAAMK,UAAUxC,MAAMuC,OAAOD,KAAK1B,UAAU0B,KAAKzB,SAAS;AAE1D,OAAI2B,YAAYD,OAAO;AACrBT,aAASW,IAAIH,KAAKhE,OAAOG,KAAK+D,QAAQ;AACtCH,gBAAYG;SAEZJ,UAASM,KAAKJ,KAAK;;AAIvB,MAAIF,SAASF,WAAWD,KAAKC,QAAQ;GAEnC,MAAMS,YAAYpB,QAAQa,SAAS;AACnC,QAAK,MAAME,QAAQF,SACjBN,UAASW,IACPH,KAAKhE,OAAOG,KACXuD,aAAaM,KAAKxB,QAAQ,MAAO6B,aAAa,GAChD;AAEH;;AAGFX,eAAaK;AACbJ,SAAOG;;;;;;;;AASX,SAASQ,cACPpB,OACAlB,gBAC2D;CAC3D,MAAMwB,2BAAW,IAAIC,KAAqB;AAG1C,KAAI,EAFezB,kBAAkB,QAAQA,iBAAiB,GAE7C,QAAO;EAAEwB;EAAUe,eAAe;EAAO;AAI1D,KAFiBrB,MAAMpD,QAAQqD,KAAKC,MAAMD,OAAOC,EAAEf,SAASe,EAAEd,WAAW,EAAE,GAE5DN,gBAAgB;AAC7B,OAAK,MAAMgC,QAAQd,MACjBM,UAASW,IAAIH,KAAKhE,OAAOG,KAAK6D,KAAK3B,SAAS2B,KAAK1B,SAAS;AAG5D,SAAO;GAAEkB;GAAUe,eAAe;GAAM;;CAG1C,MAAMG,aAAaxB,MAAMpD,QAAQqD,KAAKC,MAAMD,OAAOC,EAAEf,SAAS,IAAI,EAAE;AAEpEgB,sBACEH,MAAMP,QAAQS,MAAMA,EAAEf,SAAS,KAAK,EACpCL,iBAAiB0C,YACjBlB,SACD;AAED,MAAK,MAAMQ,QAAQd,MACjB,KAAIc,KAAK3B,SAAS,KAAMmB,UAASW,IAAIH,KAAKhE,OAAOG,KAAK6D,KAAK3B,MAAM;AAGnE,QAAO;EAAEmB;EAAUe,eAAe;EAAO;;;;;;;AAQ3C,SAASI,gBAAmB9E,SAG1B;CACA,IAAI+E,mBAAmB;CACvB,IAAIC,iBAAiB;AAErB,MAAK,MAAM7E,UAAUH,SAAS;AAC5B,MAAIG,OAAO8C,QAAQ,QAAS;AAC5B9C,SAAO8E,YAAYF;AACnBA,sBAAoB5E,OAAOE,SAASF,OAAOsC;;AAG7C,MAAK,IAAIyC,IAAIlF,QAAQ+D,SAAS,GAAGmB,KAAK,GAAGA,KAAK;EAC5C,MAAM/E,SAASH,QAAQkF;AACvB,MAAI/E,OAAO8C,QAAQ,MAAO;AAC1B9C,SAAO8E,YAAYD;AACnBA,oBAAkB7E,OAAOE,SAASF,OAAOsC;;CAG3C,MAAM0C,kBAAkBnF,QAAQ8C,QAAQE,MAAMA,EAAEC,QAAQ,QAAQ,CAACmC,GAAG,GAAG;CACvE,MAAMC,iBAAiBrF,QAAQsF,MAAMtC,MAAMA,EAAEC,QAAQ,MAAM;AAE3D,KAAIkC,gBAAiBA,iBAAgBI,YAAY;AACjD,KAAIF,eAAgBA,gBAAeE,YAAY;AAE/C,QAAO;EAAER;EAAkBC;EAAgB;;AAG7C,SAASQ,oBAAuB,EAC9BxF,SACAmC,gBACAC,cACAC,gBACAC,mBACsD;CACtD,MAAMmD,UAAUpD,kBAAkB,EAAE;CACpC,MAAMqD,WAAWpD,mBAAmB,EAAE;CACtC,MAAMqD,iBAAiB,IAAIC,IAAI,CAAC,GAAGH,SAAS,GAAGC,SAAS,CAACG,KAAK7C,MAAMA,EAAE1C,IAAI,CAAC;CAC3E,MAAM+C,QAAQT,aAAa;EAAC,GAAG6C;EAAS,GAAGzF;EAAS,GAAG0F;EAAS,CAAC,CAACG,KAC/D1F,WACC+C,aAAa/C,QAAQwF,eAAeG,IAAI3F,OAAOG,IAAI,EAAE8B,aACzD,CAAC;CACD,MAAM,EAAEuB,UAAUe,kBAAkBD,cAAcpB,OAAOlB,eAAe;CAExE,MAAM4D,MAA+B1C,MAAMwC,KAAK1B,MAAM6B,WAAW;EAC/D,GAAG7B,KAAKhE;EACR6F;EACAC,cAAcD,QAAQ;EACtB3F,OAAOsD,SAASuC,IAAI/B,KAAKhE,OAAOG,IAAI,IAAI;EACxCmC,UAAU0B,KAAK1B;EACfC,UAAUyB,KAAKzB;EACfC,MAAMwB,KAAKxB;EACXwD,OAAOhC,KAAKhE,OAAOgG,SAAS;EAC5BlB,WAAW;EACXM,WAAW;EACXnF,cAAc+D,KAAK/D;EACpB,EAAE;CAEH,MAAM,EAAE2E,kBAAkBC,mBAAmBF,gBAAgBiB,IAAI;AAMjE,QAAO;EACL/F,SAAS+F;EACThB;EACAC;EACAoB,YARiBL,IAAIM,OAAOrD,MAAMA,EAAE3C,SAAS,KAAK,GAChD0F,IAAI9F,QAAQqD,KAAKN,MAAMM,OAAON,EAAE3C,SAAS,IAAI,EAAE,GAC/C;EAOFqE;EACD;;;;;;;;;;;;;AAcH,SAAO4B,gBAAAC,IAAA;CAAA,MAAAC,IAAAC,EAAA,EAAA;CAA4B,MAAA,EAAAzG,SAAAmC,gBAAAC,cAAAC,gBAAAC,oBAAAiE;CAMP,IAAAG;AAAA,KAAAF,EAAA,OAAApE,gBAAAoE,EAAA,OAAAxG,WAAAwG,EAAA,OAAArE,kBAAAqE,EAAA,OAAAnE,kBAAAmE,EAAA,OAAAlE,iBAAA;AAGtBoE,OAAAlB,oBAAoB;GAAAxF;GAAAmC;GAAAC;GAAAC;GAAAC;GAMnB,CAAC;AAAAkE,IAAA,KAAApE;AAAAoE,IAAA,KAAAxG;AAAAwG,IAAA,KAAArE;AAAAqE,IAAA,KAAAnE;AAAAmE,IAAA,KAAAlE;AAAAkE,IAAA,KAAAE;OAAAA,MAAAF,EAAA;AAAA,QANFE"}

package/dist/components/data/TableBase/use-table-search.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { useDebouncedValue } from "../../../_internal/hooks/use-debounced-value.js";
 import { getColumnText } from "./use-table-columns.js";
 import { c } from "react/compiler-runtime";

package/dist/components/data/TableBase/use-table-selection.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { useEvent } from "../../../_internal/hooks/use-event.js";
 import { RowCollection } from "./RowCollection.js";
 import { useCallback, useMemo, useRef } from "react";

package/dist/components/data/TableBase/use-table-sort.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { useEvent } from "../../../_internal/hooks/use-event.js";
 import { getColumnText, getColumnValue } from "./use-table-columns.js";
 import { c } from "react/compiler-runtime";

package/dist/components/data/TableBase/use-table-sorts.js

@@ -1,4 +1,4 @@
-/** @license MIT | @cube-dev/ui-kit v0.192.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.193.0 | Cube Dev Team */
 import { useEvent } from "../../../_internal/hooks/use-event.js";
 import { sortRows } from "./use-table-sort.js";
 import { c } from "react/compiler-runtime";