@cube-dev/ui-kit 0.181.0 → 0.183.0

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

@@ -1 +1 @@
-{"version":3,"file":"use-table-selection.js","names":[],"sources":["../../../../src/components/data/TableBase/use-table-selection.ts"],"sourcesContent":["import { SelectionManager } from '@react-stately/selection';\nimport { useCallback, useMemo, useRef } from 'react';\nimport { useMultipleSelectionState } from 'react-stately';\n\nimport { useEvent } from '../../../_internal/hooks';\n\nimport { RowCollection } from './RowCollection';\n\nimport type { Key, Selection } from '@react-types/shared';\nimport type { CubeTableSelectAllMode, CubeTableSelectionMode } from './types';\n\n/**\n * Reserved key for the checkbox column. Prefixed so it cannot collide with a\n * real data key, and structural so the value pipeline, sorting and search all\n * skip it.\n */\nexport const SELECTION_COLUMN_KEY = '__cube-selection__';\n\n/** Reserved key for the row-number column. Structural, like the checkbox. */\nexport const ROW_NUMBER_COLUMN_KEY = '__cube-row-number__';\n\n/** Square-ish, so the checkbox sits centred without stealing content width. */\nexport const SELECTION_COLUMN_WIDTH: Record<string, number> = {\n  xsmall: 32,\n  small: 36,\n  medium: 44,\n  large: 48,\n  xlarge: 52,\n};\n\nexport interface UseTableSelectionOptions<T> {\n  /** Rows currently on screen — one page, or everything when unpaginated. */\n  rows: readonly T[];\n  /** Stable keys parallel to `rows`, used by tree mode. */\n  rowKeys?: readonly Key[];\n  /** Full current-page subtree; defaults to `rows`. */\n  pageRows?: readonly T[];\n  /** Stable keys parallel to `pageRows`. */\n  pageRowKeys?: readonly Key[];\n  /**\n   * Every row passing the current search/filter, across pages. Only differs\n   * from `rows` under client pagination, and only `selectAllMode=\"filtered\"`\n   * reads it.\n   */\n  filteredRows: readonly T[];\n  /** Stable keys parallel to `filteredRows`. */\n  filteredRowKeys?: readonly Key[];\n  getRowKey: (row: T, index: number) => Key;\n  selectionMode: CubeTableSelectionMode;\n  selectedKeys?: Key[] | 'all';\n  defaultSelectedKeys?: Key[] | 'all';\n  onSelectionChange?: (keys: Key[] | 'all', rows: T[]) => void;\n  selectAllMode: CubeTableSelectAllMode;\n  isRowSelectable?: (row: T) => boolean;\n  disabledKeys?: Key[];\n  tree?: {\n    rootKeys: readonly Key[];\n    childrenOf: ReadonlyMap<Key, readonly Key[]>;\n    parentOf: ReadonlyMap<Key, Key | null>;\n    behavior: 'cascade' | 'independent';\n  };\n}\n\nexport type CubeTableSelectAllState = 'none' | 'some' | 'all';\n\nfunction toSelection(keys: Key[] | 'all' | undefined): Selection | undefined {\n  if (keys === undefined) return undefined;\n\n  return keys === 'all' ? 'all' : new Set(keys);\n}\n\nfunction deriveTreeSelection(\n  source: ReadonlySet<Key>,\n  rootKeys: readonly Key[],\n  childrenOf: ReadonlyMap<Key, readonly Key[]>,\n  isEligible: (key: Key) => boolean,\n) {\n  const checked = new Set(source);\n  const indeterminate = new Set<Key>();\n\n  const visit = (\n    key: Key,\n  ): { all: boolean; any: boolean; eligible: boolean } => {\n    const children = childrenOf.get(key) ?? [];\n    const eligible = isEligible(key);\n    const explicitlySelected = eligible && source.has(key);\n\n    if (explicitlySelected) checked.add(key);\n\n    if (!children.length) {\n      const selected = eligible && checked.has(key);\n      if (!eligible) checked.delete(key);\n      return { all: !eligible || selected, any: selected, eligible };\n    }\n\n    let all = true;\n    let any = false;\n    let hasEligible = false;\n\n    for (const child of children) {\n      const result = visit(child);\n      if (result.eligible) hasEligible = true;\n      if (!result.all) all = false;\n      if (result.any) any = true;\n    }\n\n    if (!eligible) {\n      checked.delete(key);\n      indeterminate.delete(key);\n    } else if (hasEligible && all) {\n      checked.add(key);\n      indeterminate.delete(key);\n    } else if (hasEligible && any) {\n      checked.delete(key);\n      indeterminate.add(key);\n    } else if (hasEligible) {\n      // Branch keys in the public set are a normalized reflection of their\n      // descendants, not an enduring wildcard. This matters when a search\n      // hid siblings: restoring the full tree must not make those siblings\n      // selected merely because the filtered parent had been checked.\n      checked.delete(key);\n      indeterminate.delete(key);\n    } else if (!checked.has(key)) {\n      indeterminate.delete(key);\n    }\n\n    return {\n      all: !eligible || (checked.has(key) && all),\n      any: any || checked.has(key),\n      eligible: eligible || hasEligible,\n    };\n  };\n\n  rootKeys.forEach((key) => visit(key));\n  return { checked, indeterminate };\n}\n\nexport function useTableSelection<T>(options: UseTableSelectionOptions<T>) {\n  const {\n    rows,\n    rowKeys,\n    pageRows = rows,\n    pageRowKeys,\n    filteredRows,\n    filteredRowKeys,\n    getRowKey,\n    selectionMode,\n    selectedKeys: selectedKeysProp,\n    defaultSelectedKeys,\n    onSelectionChange,\n    selectAllMode,\n    isRowSelectable,\n    disabledKeys,\n    tree,\n  } = options;\n\n  const isEnabled = selectionMode !== 'none';\n\n  /**\n   * Two distinct notions of \"not available\", deliberately kept apart:\n   *\n   * - `disabledKeys` — the row is inert. Not focusable, not interactive. This\n   *   is React Aria's standard meaning.\n   * - `isRowSelectable` — the row is fully interactive, only its checkbox is\n   *   inert. This is what Cloud's tables do today.\n   *\n   * A `SelectionManager` has one `disabledBehavior`, so it gets the union under\n   * `'selection'` (neither kind can be selected) and the hard-disabled set is\n   * tracked separately for focus and interaction.\n   */\n  const hardDisabledKeys = useMemo(\n    () => new Set(disabledKeys ?? []),\n    [disabledKeys],\n  );\n\n  const unselectableKeys = useMemo(() => {\n    const keys = new Set(hardDisabledKeys);\n\n    if (isRowSelectable) {\n      // Scanned over the filtered set, not just the page: a select-all that\n      // reaches beyond the page must respect it there too.\n      filteredRows.forEach((row, index) => {\n        if (!isRowSelectable(row)) {\n          keys.add(filteredRowKeys?.[index] ?? getRowKey(row, index));\n        }\n      });\n    }\n\n    return keys;\n  }, [\n    hardDisabledKeys,\n    isRowSelectable,\n    filteredRows,\n    filteredRowKeys,\n    getRowKey,\n  ]);\n\n  const visibleGetRowKey = useCallback(\n    (row: T, index: number) => rowKeys?.[index] ?? getRowKey(row, index),\n    [rowKeys, getRowKey],\n  );\n\n  const collection = useMemo(\n    () => new RowCollection(rows, visibleGetRowKey, unselectableKeys),\n    [rows, visibleGetRowKey, unselectableKeys],\n  );\n\n  const rowByKey = useMemo(() => {\n    const map = new Map<Key, T>();\n\n    // The page first, then the wider filtered set, so a key present in both\n    // resolves to the row the user can actually see.\n    filteredRows.forEach((row, index) =>\n      map.set(filteredRowKeys?.[index] ?? getRowKey(row, index), row),\n    );\n    rows.forEach((row, index) =>\n      map.set(rowKeys?.[index] ?? getRowKey(row, index), row),\n    );\n\n    return map;\n  }, [rows, rowKeys, filteredRows, filteredRowKeys, getRowKey]);\n\n  const rowByKeyRef = useRef(rowByKey);\n\n  rowByKeyRef.current = rowByKey;\n\n  /**\n   * Where a shift-range starts, and how far it currently reaches.\n   *\n   * React Aria's `SelectionManager.extendSelection` keeps this on the `Selection`\n   * object itself (`selectedKeys.anchorKey`), which cannot survive our public\n   * API: `selectedKeys` is `Key[]`, and `useMultipleSelectionState` rebuilds\n   * whatever it is given with `new Selection(value)` — a constructor that only\n   * copies the anchor when the input is already a `Selection`, a class no\n   * package exports. A controlled table would silently reset the anchor to the\n   * clicked row and turn every shift-click into a plain toggle.\n   *\n   * So the range is computed here instead, over `RowCollection`'s index. The\n   * semantics match `extendSelection` exactly: the previous range is removed\n   * before the new one is added, so shift-clicking back shrinks the range\n   * rather than leaving the overshoot selected.\n   */\n  const anchorRef = useRef<Key | null>(null);\n  const extentRef = useRef<Key | null>(null);\n\n  const handleSelectionChange = useEvent((keys: Selection) => {\n    if (!onSelectionChange) return;\n\n    if (keys === 'all') {\n      // The sentinel means \"everything, including rows the client has not\n      // loaded\", so the row list can only ever be what is loaded.\n      onSelectionChange('all', [...rowByKeyRef.current.values()]);\n\n      return;\n    }\n\n    const list = [...keys];\n\n    onSelectionChange(\n      list,\n      list\n        .map((key) => rowByKeyRef.current.get(key))\n        .filter((row): row is T => row !== undefined),\n    );\n  });\n\n  const controlledSelection = useMemo(\n    () => toSelection(selectedKeysProp),\n    [selectedKeysProp],\n  );\n  const defaultSelection = useMemo(\n    () => toSelection(defaultSelectedKeys),\n    [defaultSelectedKeys],\n  );\n\n  const state = useMultipleSelectionState({\n    selectionMode,\n    selectedKeys: controlledSelection,\n    defaultSelectedKeys: defaultSelection,\n    disabledKeys: unselectableKeys,\n    disabledBehavior: 'selection',\n    onSelectionChange: handleSelectionChange,\n  });\n\n  const selectionManager = useMemo(\n    () => new SelectionManager(collection, state),\n    [collection, state],\n  );\n\n  const selectedKeys = state.selectedKeys;\n  const isAll = selectedKeys === 'all';\n  const isCascade =\n    tree?.behavior === 'cascade' && selectionMode === 'multiple';\n\n  const derivedSelection = useMemo(() => {\n    if (isAll) {\n      return {\n        checked: new Set(\n          [...rowByKey.keys()].filter((key) => !unselectableKeys.has(key)),\n        ),\n        indeterminate: new Set<Key>(),\n      };\n    }\n\n    if (!isCascade || !tree) {\n      return {\n        checked: new Set(selectedKeys as Set<Key>),\n        indeterminate: new Set<Key>(),\n      };\n    }\n\n    return deriveTreeSelection(\n      selectedKeys as Set<Key>,\n      tree.rootKeys,\n      tree.childrenOf,\n      (key) => !unselectableKeys.has(key),\n    );\n  }, [isAll, isCascade, selectedKeys, tree, rowByKey, unselectableKeys]);\n\n  const canSelect = useCallback(\n    (key: Key) => isEnabled && !unselectableKeys.has(key),\n    [isEnabled, unselectableKeys],\n  );\n\n  const isSelected = useCallback(\n    (key: Key) => (isAll ? canSelect(key) : derivedSelection.checked.has(key)),\n    [isAll, derivedSelection, canSelect],\n  );\n\n  const isIndeterminate = useCallback(\n    (key: Key) => derivedSelection.indeterminate.has(key),\n    [derivedSelection],\n  );\n\n  /** Keys the header checkbox acts on, which is what `selectAllMode` decides. */\n  const scopeKeys = useMemo(() => {\n    if (!isEnabled || selectionMode === 'single') return [];\n\n    const source = selectAllMode === 'page' ? pageRows : filteredRows;\n    const sourceKeys = selectAllMode === 'page' ? pageRowKeys : filteredRowKeys;\n\n    return source\n      .map((row, index) => sourceKeys?.[index] ?? getRowKey(row, index))\n      .filter((key) => !unselectableKeys.has(key));\n  }, [\n    isEnabled,\n    selectionMode,\n    selectAllMode,\n    pageRows,\n    pageRowKeys,\n    filteredRows,\n    filteredRowKeys,\n    getRowKey,\n    unselectableKeys,\n  ]);\n\n  const selectAllState: CubeTableSelectAllState = useMemo(() => {\n    if (isAll) return 'all';\n    if (!scopeKeys.length) return 'none';\n\n    const set = derivedSelection.checked;\n    let count = 0;\n\n    for (const key of scopeKeys) if (set.has(key)) count++;\n\n    return count === 0 ? 'none' : count === scopeKeys.length ? 'all' : 'some';\n  }, [isAll, derivedSelection, scopeKeys]);\n\n  const toggleSelectAll = useEvent(() => {\n    anchorRef.current = null;\n    extentRef.current = null;\n\n    if (selectAllState === 'all') {\n      // Clearing drops the whole selection, not just the scope: leaving keys\n      // selected on other pages after the user clicked an unchecked-looking\n      // box is the kind of thing nobody discovers until they delete something.\n      state.setSelectedKeys(new Set());\n\n      return;\n    }\n\n    if (selectAllMode === 'all') {\n      state.setSelectedKeys('all');\n\n      return;\n    }\n\n    const next = new Set(isAll ? [] : derivedSelection.checked);\n\n    scopeKeys.forEach((key) => next.add(key));\n    state.setSelectedKeys(\n      isCascade && tree\n        ? deriveTreeSelection(\n            next,\n            tree.rootKeys,\n            tree.childrenOf,\n            (key) => !unselectableKeys.has(key),\n          ).checked\n        : next,\n    );\n  });\n\n  const clearSelection = useEvent(() => {\n    anchorRef.current = null;\n    extentRef.current = null;\n    state.setSelectedKeys(new Set());\n  });\n\n  /**\n   * Shift held on the press that produced this change. `Checkbox` reports only\n   * the next value, so the modifier is captured from the pointer/key event on\n   * the cell and read back here.\n   */\n  const shiftRef = useRef(false);\n\n  const captureShift = useCallback((event: { shiftKey: boolean }) => {\n    shiftRef.current = event.shiftKey;\n  }, []);\n\n  /** Selectable keys between two rows, inclusive, in either direction. */\n  const keysBetween = useCallback(\n    (from: Key, to: Key) => {\n      const fromIndex = collection.indexOf(from);\n      const toIndex = collection.indexOf(to);\n\n      if (fromIndex < 0 || toIndex < 0) return [];\n\n      const [lo, hi] =\n        fromIndex <= toIndex ? [fromIndex, toIndex] : [toIndex, fromIndex];\n      const all = collection.getKeys();\n      const range: Key[] = [];\n\n      for (let i = lo; i <= hi; i++) range.push(all[i]);\n\n      return range;\n    },\n    [collection],\n  );\n\n  const toggleRow = useEvent((key: Key) => {\n    if (!canSelect(key)) return;\n\n    if (selectionMode === 'single') {\n      state.setSelectedKeys(isSelected(key) ? new Set() : new Set([key]));\n\n      return;\n    }\n\n    const applyCascade = (set: Set<Key>, target: Key, value: boolean) => {\n      if (!canSelect(target)) return;\n      if (value) set.add(target);\n      else {\n        set.delete(target);\n\n        // A checked ancestor in the normalized public key set means its whole\n        // branch is selected. Remove that derived marker before normalizing a\n        // partial deselection, or it would immediately select the child again.\n        if (isCascade && tree) {\n          let parent = tree.parentOf.get(target);\n          while (parent != null) {\n            set.delete(parent);\n            parent = tree.parentOf.get(parent);\n          }\n        }\n      }\n      if (!isCascade || !tree) return;\n      (tree.childrenOf.get(target) ?? []).forEach((child) =>\n        applyCascade(set, child, value),\n      );\n    };\n\n    const normalizeCascade = (set: Set<Key>) =>\n      isCascade && tree\n        ? deriveTreeSelection(\n            set,\n            tree.rootKeys,\n            tree.childrenOf,\n            (candidate) => !unselectableKeys.has(candidate),\n          ).checked\n        : set;\n\n    const anchor = anchorRef.current;\n\n    if (shiftRef.current && anchor != null && collection.indexOf(anchor) >= 0) {\n      const next = new Set(isAll ? scopeKeys : derivedSelection.checked);\n\n      // Drop the range this shift-click supersedes before drawing the new one,\n      // so clicking back toward the anchor shrinks the selection.\n      if (extentRef.current != null) {\n        keysBetween(anchor, extentRef.current).forEach((k) =>\n          applyCascade(next, k, false),\n        );\n      }\n\n      keysBetween(anchor, key).forEach((k) => {\n        applyCascade(next, k, true);\n      });\n\n      extentRef.current = key;\n      state.setSelectedKeys(normalizeCascade(next));\n\n      return;\n    }\n\n    anchorRef.current = key;\n    extentRef.current = null;\n    if (isCascade) {\n      const next = new Set(derivedSelection.checked);\n      applyCascade(next, key, !derivedSelection.checked.has(key));\n      state.setSelectedKeys(normalizeCascade(next));\n    } else {\n      selectionManager.toggleSelection(key);\n    }\n  });\n\n  const selectedRows = useMemo(() => {\n    if (isAll) return [...rowByKey.values()];\n\n    return [...derivedSelection.checked]\n      .map((key) => rowByKey.get(key))\n      .filter((row): row is T => row !== undefined);\n  }, [isAll, derivedSelection, rowByKey]);\n\n  return {\n    isEnabled,\n    selectionMode,\n    selectionManager,\n    collection,\n    isSelected,\n    isIndeterminate,\n    canSelect,\n    isRowDisabled: useCallback(\n      (key: Key) => hardDisabledKeys.has(key),\n      [hardDisabledKeys],\n    ),\n    toggleRow,\n    captureShift,\n    selectAllState,\n    toggleSelectAll,\n    clearSelection,\n    selectedRows,\n    selectedCount: isAll ? rowByKey.size : derivedSelection.checked.size,\n    selectedKeys: (isAll ? 'all' : [...derivedSelection.checked]) as\n      | Key[]\n      | 'all',\n  };\n}\n\nexport type CubeTableSelectionState<T> = ReturnType<\n  typeof useTableSelection<T>\n>;\n"],"mappings":";;;;;;;;;;;;;AAgBA,MAAa,uBAAuB;;AAGpC,MAAa,wBAAwB;;AAGrC,MAAa,yBAAiD;CAC5D,QAAQ;CACR,OAAO;CACP,QAAQ;CACR,OAAO;CACP,QAAQ;CACT;AAqCD,SAAS,YAAY,MAAwD;AAC3E,KAAI,SAAS,OAAW,QAAO;AAE/B,QAAO,SAAS,QAAQ,QAAQ,IAAI,IAAI,KAAK;;AAG/C,SAAS,oBACP,QACA,UACA,YACA,YACA;CACA,MAAM,UAAU,IAAI,IAAI,OAAO;CAC/B,MAAM,gCAAgB,IAAI,KAAU;CAEpC,MAAM,SACJ,QACsD;EACtD,MAAM,WAAW,WAAW,IAAI,IAAI,IAAI,EAAE;EAC1C,MAAM,WAAW,WAAW,IAAI;AAGhC,MAF2B,YAAY,OAAO,IAAI,IAAI,CAE9B,SAAQ,IAAI,IAAI;AAExC,MAAI,CAAC,SAAS,QAAQ;GACpB,MAAM,WAAW,YAAY,QAAQ,IAAI,IAAI;AAC7C,OAAI,CAAC,SAAU,SAAQ,OAAO,IAAI;AAClC,UAAO;IAAE,KAAK,CAAC,YAAY;IAAU,KAAK;IAAU;IAAU;;EAGhE,IAAI,MAAM;EACV,IAAI,MAAM;EACV,IAAI,cAAc;AAElB,OAAK,MAAM,SAAS,UAAU;GAC5B,MAAM,SAAS,MAAM,MAAM;AAC3B,OAAI,OAAO,SAAU,eAAc;AACnC,OAAI,CAAC,OAAO,IAAK,OAAM;AACvB,OAAI,OAAO,IAAK,OAAM;;AAGxB,MAAI,CAAC,UAAU;AACb,WAAQ,OAAO,IAAI;AACnB,iBAAc,OAAO,IAAI;aAChB,eAAe,KAAK;AAC7B,WAAQ,IAAI,IAAI;AAChB,iBAAc,OAAO,IAAI;aAChB,eAAe,KAAK;AAC7B,WAAQ,OAAO,IAAI;AACnB,iBAAc,IAAI,IAAI;aACb,aAAa;AAKtB,WAAQ,OAAO,IAAI;AACnB,iBAAc,OAAO,IAAI;aAChB,CAAC,QAAQ,IAAI,IAAI,CAC1B,eAAc,OAAO,IAAI;AAG3B,SAAO;GACL,KAAK,CAAC,YAAa,QAAQ,IAAI,IAAI,IAAI;GACvC,KAAK,OAAO,QAAQ,IAAI,IAAI;GAC5B,UAAU,YAAY;GACvB;;AAGH,UAAS,SAAS,QAAQ,MAAM,IAAI,CAAC;AACrC,QAAO;EAAE;EAAS;EAAe;;AAGnC,SAAgB,kBAAqB,SAAsC;CACzE,MAAM,EACJ,MACA,SACA,WAAW,MACX,aACA,cACA,iBACA,WACA,eACA,cAAc,kBACd,qBACA,mBACA,eACA,iBACA,cACA,SACE;CAEJ,MAAM,YAAY,kBAAkB;;;;;;;;;;;;;CAcpC,MAAM,mBAAmB,cACjB,IAAI,IAAI,gBAAgB,EAAE,CAAC,EACjC,CAAC,aAAa,CACf;CAED,MAAM,mBAAmB,cAAc;EACrC,MAAM,OAAO,IAAI,IAAI,iBAAiB;AAEtC,MAAI,gBAGF,cAAa,SAAS,KAAK,UAAU;AACnC,OAAI,CAAC,gBAAgB,IAAI,CACvB,MAAK,IAAI,kBAAkB,UAAU,UAAU,KAAK,MAAM,CAAC;IAE7D;AAGJ,SAAO;IACN;EACD;EACA;EACA;EACA;EACA;EACD,CAAC;CAEF,MAAM,mBAAmB,aACtB,KAAQ,UAAkB,UAAU,UAAU,UAAU,KAAK,MAAM,EACpE,CAAC,SAAS,UAAU,CACrB;CAED,MAAM,aAAa,cACX,IAAI,cAAc,MAAM,kBAAkB,iBAAiB,EACjE;EAAC;EAAM;EAAkB;EAAiB,CAC3C;CAED,MAAM,WAAW,cAAc;EAC7B,MAAM,sBAAM,IAAI,KAAa;AAI7B,eAAa,SAAS,KAAK,UACzB,IAAI,IAAI,kBAAkB,UAAU,UAAU,KAAK,MAAM,EAAE,IAAI,CAChE;AACD,OAAK,SAAS,KAAK,UACjB,IAAI,IAAI,UAAU,UAAU,UAAU,KAAK,MAAM,EAAE,IAAI,CACxD;AAED,SAAO;IACN;EAAC;EAAM;EAAS;EAAc;EAAiB;EAAU,CAAC;CAE7D,MAAM,cAAc,OAAO,SAAS;AAEpC,aAAY,UAAU;;;;;;;;;;;;;;;;;CAkBtB,MAAM,YAAY,OAAmB,KAAK;CAC1C,MAAM,YAAY,OAAmB,KAAK;CAE1C,MAAM,wBAAwB,UAAU,SAAoB;AAC1D,MAAI,CAAC,kBAAmB;AAExB,MAAI,SAAS,OAAO;AAGlB,qBAAkB,OAAO,CAAC,GAAG,YAAY,QAAQ,QAAQ,CAAC,CAAC;AAE3D;;EAGF,MAAM,OAAO,CAAC,GAAG,KAAK;AAEtB,oBACE,MACA,KACG,KAAK,QAAQ,YAAY,QAAQ,IAAI,IAAI,CAAC,CAC1C,QAAQ,QAAkB,QAAQ,OAAU,CAChD;GACD;CAWF,MAAM,QAAQ,0BAA0B;EACtC;EACA,cAX0B,cACpB,YAAY,iBAAiB,EACnC,CAAC,iBAAiB,CACnB;EASC,qBARuB,cACjB,YAAY,oBAAoB,EACtC,CAAC,oBAAoB,CACtB;EAMC,cAAc;EACd,kBAAkB;EAClB,mBAAmB;EACpB,CAAC;CAEF,MAAM,mBAAmB,cACjB,IAAI,iBAAiB,YAAY,MAAM,EAC7C,CAAC,YAAY,MAAM,CACpB;CAED,MAAM,eAAe,MAAM;CAC3B,MAAM,QAAQ,iBAAiB;CAC/B,MAAM,YACJ,MAAM,aAAa,aAAa,kBAAkB;CAEpD,MAAM,mBAAmB,cAAc;AACrC,MAAI,MACF,QAAO;GACL,SAAS,IAAI,IACX,CAAC,GAAG,SAAS,MAAM,CAAC,CAAC,QAAQ,QAAQ,CAAC,iBAAiB,IAAI,IAAI,CAAC,CACjE;GACD,+BAAe,IAAI,KAAU;GAC9B;AAGH,MAAI,CAAC,aAAa,CAAC,KACjB,QAAO;GACL,SAAS,IAAI,IAAI,aAAyB;GAC1C,+BAAe,IAAI,KAAU;GAC9B;AAGH,SAAO,oBACL,cACA,KAAK,UACL,KAAK,aACJ,QAAQ,CAAC,iBAAiB,IAAI,IAAI,CACpC;IACA;EAAC;EAAO;EAAW;EAAc;EAAM;EAAU;EAAiB,CAAC;CAEtE,MAAM,YAAY,aACf,QAAa,aAAa,CAAC,iBAAiB,IAAI,IAAI,EACrD,CAAC,WAAW,iBAAiB,CAC9B;CAED,MAAM,aAAa,aAChB,QAAc,QAAQ,UAAU,IAAI,GAAG,iBAAiB,QAAQ,IAAI,IAAI,EACzE;EAAC;EAAO;EAAkB;EAAU,CACrC;CAED,MAAM,kBAAkB,aACrB,QAAa,iBAAiB,cAAc,IAAI,IAAI,EACrD,CAAC,iBAAiB,CACnB;;CAGD,MAAM,YAAY,cAAc;AAC9B,MAAI,CAAC,aAAa,kBAAkB,SAAU,QAAO,EAAE;EAEvD,MAAM,SAAS,kBAAkB,SAAS,WAAW;EACrD,MAAM,aAAa,kBAAkB,SAAS,cAAc;AAE5D,SAAO,OACJ,KAAK,KAAK,UAAU,aAAa,UAAU,UAAU,KAAK,MAAM,CAAC,CACjE,QAAQ,QAAQ,CAAC,iBAAiB,IAAI,IAAI,CAAC;IAC7C;EACD;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD,CAAC;CAEF,MAAM,iBAA0C,cAAc;AAC5D,MAAI,MAAO,QAAO;AAClB,MAAI,CAAC,UAAU,OAAQ,QAAO;EAE9B,MAAM,MAAM,iBAAiB;EAC7B,IAAI,QAAQ;AAEZ,OAAK,MAAM,OAAO,UAAW,KAAI,IAAI,IAAI,IAAI,CAAE;AAE/C,SAAO,UAAU,IAAI,SAAS,UAAU,UAAU,SAAS,QAAQ;IAClE;EAAC;EAAO;EAAkB;EAAU,CAAC;CAExC,MAAM,kBAAkB,eAAe;AACrC,YAAU,UAAU;AACpB,YAAU,UAAU;AAEpB,MAAI,mBAAmB,OAAO;AAI5B,SAAM,gCAAgB,IAAI,KAAK,CAAC;AAEhC;;AAGF,MAAI,kBAAkB,OAAO;AAC3B,SAAM,gBAAgB,MAAM;AAE5B;;EAGF,MAAM,OAAO,IAAI,IAAI,QAAQ,EAAE,GAAG,iBAAiB,QAAQ;AAE3D,YAAU,SAAS,QAAQ,KAAK,IAAI,IAAI,CAAC;AACzC,QAAM,gBACJ,aAAa,OACT,oBACE,MACA,KAAK,UACL,KAAK,aACJ,QAAQ,CAAC,iBAAiB,IAAI,IAAI,CACpC,CAAC,UACF,KACL;GACD;CAEF,MAAM,iBAAiB,eAAe;AACpC,YAAU,UAAU;AACpB,YAAU,UAAU;AACpB,QAAM,gCAAgB,IAAI,KAAK,CAAC;GAChC;;;;;;CAOF,MAAM,WAAW,OAAO,MAAM;CAE9B,MAAM,eAAe,aAAa,UAAiC;AACjE,WAAS,UAAU,MAAM;IACxB,EAAE,CAAC;;CAGN,MAAM,cAAc,aACjB,MAAW,OAAY;EACtB,MAAM,YAAY,WAAW,QAAQ,KAAK;EAC1C,MAAM,UAAU,WAAW,QAAQ,GAAG;AAEtC,MAAI,YAAY,KAAK,UAAU,EAAG,QAAO,EAAE;EAE3C,MAAM,CAAC,IAAI,MACT,aAAa,UAAU,CAAC,WAAW,QAAQ,GAAG,CAAC,SAAS,UAAU;EACpE,MAAM,MAAM,WAAW,SAAS;EAChC,MAAM,QAAe,EAAE;AAEvB,OAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAK,OAAM,KAAK,IAAI,GAAG;AAEjD,SAAO;IAET,CAAC,WAAW,CACb;CAED,MAAM,YAAY,UAAU,QAAa;AACvC,MAAI,CAAC,UAAU,IAAI,CAAE;AAErB,MAAI,kBAAkB,UAAU;AAC9B,SAAM,gBAAgB,WAAW,IAAI,mBAAG,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;AAEnE;;EAGF,MAAM,gBAAgB,KAAe,QAAa,UAAmB;AACnE,OAAI,CAAC,UAAU,OAAO,CAAE;AACxB,OAAI,MAAO,KAAI,IAAI,OAAO;QACrB;AACH,QAAI,OAAO,OAAO;AAKlB,QAAI,aAAa,MAAM;KACrB,IAAI,SAAS,KAAK,SAAS,IAAI,OAAO;AACtC,YAAO,UAAU,MAAM;AACrB,UAAI,OAAO,OAAO;AAClB,eAAS,KAAK,SAAS,IAAI,OAAO;;;;AAIxC,OAAI,CAAC,aAAa,CAAC,KAAM;AACzB,IAAC,KAAK,WAAW,IAAI,OAAO,IAAI,EAAE,EAAE,SAAS,UAC3C,aAAa,KAAK,OAAO,MAAM,CAChC;;EAGH,MAAM,oBAAoB,QACxB,aAAa,OACT,oBACE,KACA,KAAK,UACL,KAAK,aACJ,cAAc,CAAC,iBAAiB,IAAI,UAAU,CAChD,CAAC,UACF;EAEN,MAAM,SAAS,UAAU;AAEzB,MAAI,SAAS,WAAW,UAAU,QAAQ,WAAW,QAAQ,OAAO,IAAI,GAAG;GACzE,MAAM,OAAO,IAAI,IAAI,QAAQ,YAAY,iBAAiB,QAAQ;AAIlE,OAAI,UAAU,WAAW,KACvB,aAAY,QAAQ,UAAU,QAAQ,CAAC,SAAS,MAC9C,aAAa,MAAM,GAAG,MAAM,CAC7B;AAGH,eAAY,QAAQ,IAAI,CAAC,SAAS,MAAM;AACtC,iBAAa,MAAM,GAAG,KAAK;KAC3B;AAEF,aAAU,UAAU;AACpB,SAAM,gBAAgB,iBAAiB,KAAK,CAAC;AAE7C;;AAGF,YAAU,UAAU;AACpB,YAAU,UAAU;AACpB,MAAI,WAAW;GACb,MAAM,OAAO,IAAI,IAAI,iBAAiB,QAAQ;AAC9C,gBAAa,MAAM,KAAK,CAAC,iBAAiB,QAAQ,IAAI,IAAI,CAAC;AAC3D,SAAM,gBAAgB,iBAAiB,KAAK,CAAC;QAE7C,kBAAiB,gBAAgB,IAAI;GAEvC;CAEF,MAAM,eAAe,cAAc;AACjC,MAAI,MAAO,QAAO,CAAC,GAAG,SAAS,QAAQ,CAAC;AAExC,SAAO,CAAC,GAAG,iBAAiB,QAAQ,CACjC,KAAK,QAAQ,SAAS,IAAI,IAAI,CAAC,CAC/B,QAAQ,QAAkB,QAAQ,OAAU;IAC9C;EAAC;EAAO;EAAkB;EAAS,CAAC;AAEvC,QAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA,eAAe,aACZ,QAAa,iBAAiB,IAAI,IAAI,EACvC,CAAC,iBAAiB,CACnB;EACD;EACA;EACA;EACA;EACA;EACA;EACA,eAAe,QAAQ,SAAS,OAAO,iBAAiB,QAAQ;EAChE,cAAe,QAAQ,QAAQ,CAAC,GAAG,iBAAiB,QAAQ;EAG7D"}
+{"version":3,"file":"use-table-selection.js","names":["SelectionManager","useCallback","useMemo","useRef","useMultipleSelectionState","useEvent","RowCollection","Key","Selection","CubeTableSelectAllMode","CubeTableSelectionMode","SELECTION_COLUMN_KEY","ROW_NUMBER_COLUMN_KEY","SELECTION_COLUMN_WIDTH","Record","xsmall","small","medium","large","xlarge","UseTableSelectionOptions","rows","T","rowKeys","pageRows","pageRowKeys","filteredRows","filteredRowKeys","getRowKey","row","index","selectionMode","selectedKeys","defaultSelectedKeys","onSelectionChange","keys","selectAllMode","isRowSelectable","disabledKeys","tree","rootKeys","childrenOf","ReadonlyMap","parentOf","behavior","CubeTableSelectAllState","toSelection","undefined","Set","deriveTreeSelection","source","ReadonlySet","isEligible","key","checked","indeterminate","visit","all","any","eligible","children","get","explicitlySelected","has","add","length","selected","delete","hasEligible","child","result","forEach","useTableSelection","options","selectedKeysProp","isEnabled","hardDisabledKeys","unselectableKeys","visibleGetRowKey","collection","rowByKey","map","Map","set","rowByKeyRef","current","anchorRef","extentRef","handleSelectionChange","values","list","filter","controlledSelection","defaultSelection","state","disabledBehavior","selectionManager","isAll","isCascade","derivedSelection","canSelect","isSelected","isIndeterminate","scopeKeys","sourceKeys","selectAllState","count","toggleSelectAll","setSelectedKeys","next","clearSelection","shiftRef","captureShift","event","shiftKey","keysBetween","from","to","fromIndex","indexOf","toIndex","lo","hi","getKeys","range","i","push","toggleRow","applyCascade","target","value","parent","normalizeCascade","candidate","anchor","k","toggleSelection","selectedRows","isRowDisabled","selectedCount","size","CubeTableSelectionState","ReturnType"],"sources":["../../../../src/components/data/TableBase/use-table-selection.ts"],"sourcesContent":["import { SelectionManager } from '@react-stately/selection';\nimport { useCallback, useMemo, useRef } from 'react';\nimport { useMultipleSelectionState } from 'react-stately';\n\nimport { useEvent } from '../../../_internal/hooks';\n\nimport { RowCollection } from './RowCollection';\n\nimport type { Key, Selection } from '@react-types/shared';\nimport type { CubeTableSelectAllMode, CubeTableSelectionMode } from './types';\n\n/**\n * Reserved key for the checkbox column. Prefixed so it cannot collide with a\n * real data key, and structural so the value pipeline, sorting and search all\n * skip it.\n */\nexport const SELECTION_COLUMN_KEY = '__cube-selection__';\n\n/** Reserved key for the row-number column. Structural, like the checkbox. */\nexport const ROW_NUMBER_COLUMN_KEY = '__cube-row-number__';\n\n/** Square-ish, so the checkbox sits centred without stealing content width. */\nexport const SELECTION_COLUMN_WIDTH: Record<string, number> = {\n  xsmall: 32,\n  small: 36,\n  medium: 44,\n  large: 48,\n  xlarge: 52,\n};\n\nexport interface UseTableSelectionOptions<T> {\n  /** Rows currently on screen — one page, or everything when unpaginated. */\n  rows: readonly T[];\n  /** Stable keys parallel to `rows`, used by tree mode. */\n  rowKeys?: readonly Key[];\n  /** Full current-page subtree; defaults to `rows`. */\n  pageRows?: readonly T[];\n  /** Stable keys parallel to `pageRows`. */\n  pageRowKeys?: readonly Key[];\n  /**\n   * Every row passing the current search/filter, across pages. Only differs\n   * from `rows` under client pagination, and only `selectAllMode=\"filtered\"`\n   * reads it.\n   */\n  filteredRows: readonly T[];\n  /** Stable keys parallel to `filteredRows`. */\n  filteredRowKeys?: readonly Key[];\n  getRowKey: (row: T, index: number) => Key;\n  selectionMode: CubeTableSelectionMode;\n  selectedKeys?: Key[] | 'all';\n  defaultSelectedKeys?: Key[] | 'all';\n  onSelectionChange?: (keys: Key[] | 'all', rows: T[]) => void;\n  selectAllMode: CubeTableSelectAllMode;\n  isRowSelectable?: (row: T) => boolean;\n  disabledKeys?: Key[];\n  tree?: {\n    rootKeys: readonly Key[];\n    childrenOf: ReadonlyMap<Key, readonly Key[]>;\n    parentOf: ReadonlyMap<Key, Key | null>;\n    behavior: 'cascade' | 'independent';\n  };\n}\n\nexport type CubeTableSelectAllState = 'none' | 'some' | 'all';\n\nfunction toSelection(keys: Key[] | 'all' | undefined): Selection | undefined {\n  if (keys === undefined) return undefined;\n\n  return keys === 'all' ? 'all' : new Set(keys);\n}\n\nfunction deriveTreeSelection(\n  source: ReadonlySet<Key>,\n  rootKeys: readonly Key[],\n  childrenOf: ReadonlyMap<Key, readonly Key[]>,\n  isEligible: (key: Key) => boolean,\n) {\n  const checked = new Set(source);\n  const indeterminate = new Set<Key>();\n\n  const visit = (\n    key: Key,\n  ): { all: boolean; any: boolean; eligible: boolean } => {\n    const children = childrenOf.get(key) ?? [];\n    const eligible = isEligible(key);\n    const explicitlySelected = eligible && source.has(key);\n\n    if (explicitlySelected) checked.add(key);\n\n    if (!children.length) {\n      const selected = eligible && checked.has(key);\n      if (!eligible) checked.delete(key);\n      return { all: !eligible || selected, any: selected, eligible };\n    }\n\n    let all = true;\n    let any = false;\n    let hasEligible = false;\n\n    for (const child of children) {\n      const result = visit(child);\n      if (result.eligible) hasEligible = true;\n      if (!result.all) all = false;\n      if (result.any) any = true;\n    }\n\n    if (!eligible) {\n      checked.delete(key);\n      indeterminate.delete(key);\n    } else if (hasEligible && all) {\n      checked.add(key);\n      indeterminate.delete(key);\n    } else if (hasEligible && any) {\n      checked.delete(key);\n      indeterminate.add(key);\n    } else if (hasEligible) {\n      // Branch keys in the public set are a normalized reflection of their\n      // descendants, not an enduring wildcard. This matters when a search\n      // hid siblings: restoring the full tree must not make those siblings\n      // selected merely because the filtered parent had been checked.\n      checked.delete(key);\n      indeterminate.delete(key);\n    } else if (!checked.has(key)) {\n      indeterminate.delete(key);\n    }\n\n    return {\n      all: !eligible || (checked.has(key) && all),\n      any: any || checked.has(key),\n      eligible: eligible || hasEligible,\n    };\n  };\n\n  rootKeys.forEach((key) => visit(key));\n  return { checked, indeterminate };\n}\n\nexport function useTableSelection<T>(options: UseTableSelectionOptions<T>) {\n  const {\n    rows,\n    rowKeys,\n    pageRows = rows,\n    pageRowKeys,\n    filteredRows,\n    filteredRowKeys,\n    getRowKey,\n    selectionMode,\n    selectedKeys: selectedKeysProp,\n    defaultSelectedKeys,\n    onSelectionChange,\n    selectAllMode,\n    isRowSelectable,\n    disabledKeys,\n    tree,\n  } = options;\n\n  const isEnabled = selectionMode !== 'none';\n\n  /**\n   * Two distinct notions of \"not available\", deliberately kept apart:\n   *\n   * - `disabledKeys` — the row is inert. Not focusable, not interactive. This\n   *   is React Aria's standard meaning.\n   * - `isRowSelectable` — the row is fully interactive, only its checkbox is\n   *   inert. This is what Cloud's tables do today.\n   *\n   * A `SelectionManager` has one `disabledBehavior`, so it gets the union under\n   * `'selection'` (neither kind can be selected) and the hard-disabled set is\n   * tracked separately for focus and interaction.\n   */\n  const hardDisabledKeys = useMemo(\n    () => new Set(disabledKeys ?? []),\n    [disabledKeys],\n  );\n\n  const unselectableKeys = useMemo(() => {\n    const keys = new Set(hardDisabledKeys);\n\n    if (isRowSelectable) {\n      // Scanned over the filtered set, not just the page: a select-all that\n      // reaches beyond the page must respect it there too.\n      filteredRows.forEach((row, index) => {\n        if (!isRowSelectable(row)) {\n          keys.add(filteredRowKeys?.[index] ?? getRowKey(row, index));\n        }\n      });\n    }\n\n    return keys;\n  }, [\n    hardDisabledKeys,\n    isRowSelectable,\n    filteredRows,\n    filteredRowKeys,\n    getRowKey,\n  ]);\n\n  const visibleGetRowKey = useCallback(\n    (row: T, index: number) => rowKeys?.[index] ?? getRowKey(row, index),\n    [rowKeys, getRowKey],\n  );\n\n  const collection = useMemo(\n    () => new RowCollection(rows, visibleGetRowKey, unselectableKeys),\n    [rows, visibleGetRowKey, unselectableKeys],\n  );\n\n  const rowByKey = useMemo(() => {\n    const map = new Map<Key, T>();\n\n    // The page first, then the wider filtered set, so a key present in both\n    // resolves to the row the user can actually see.\n    filteredRows.forEach((row, index) =>\n      map.set(filteredRowKeys?.[index] ?? getRowKey(row, index), row),\n    );\n    rows.forEach((row, index) =>\n      map.set(rowKeys?.[index] ?? getRowKey(row, index), row),\n    );\n\n    return map;\n  }, [rows, rowKeys, filteredRows, filteredRowKeys, getRowKey]);\n\n  const rowByKeyRef = useRef(rowByKey);\n\n  rowByKeyRef.current = rowByKey;\n\n  /**\n   * Where a shift-range starts, and how far it currently reaches.\n   *\n   * React Aria's `SelectionManager.extendSelection` keeps this on the `Selection`\n   * object itself (`selectedKeys.anchorKey`), which cannot survive our public\n   * API: `selectedKeys` is `Key[]`, and `useMultipleSelectionState` rebuilds\n   * whatever it is given with `new Selection(value)` — a constructor that only\n   * copies the anchor when the input is already a `Selection`, a class no\n   * package exports. A controlled table would silently reset the anchor to the\n   * clicked row and turn every shift-click into a plain toggle.\n   *\n   * So the range is computed here instead, over `RowCollection`'s index. The\n   * semantics match `extendSelection` exactly: the previous range is removed\n   * before the new one is added, so shift-clicking back shrinks the range\n   * rather than leaving the overshoot selected.\n   */\n  const anchorRef = useRef<Key | null>(null);\n  const extentRef = useRef<Key | null>(null);\n\n  const handleSelectionChange = useEvent((keys: Selection) => {\n    if (!onSelectionChange) return;\n\n    if (keys === 'all') {\n      // The sentinel means \"everything, including rows the client has not\n      // loaded\", so the row list can only ever be what is loaded.\n      onSelectionChange('all', [...rowByKeyRef.current.values()]);\n\n      return;\n    }\n\n    const list = [...keys];\n\n    onSelectionChange(\n      list,\n      list\n        .map((key) => rowByKeyRef.current.get(key))\n        .filter((row): row is T => row !== undefined),\n    );\n  });\n\n  const controlledSelection = useMemo(\n    () => toSelection(selectedKeysProp),\n    [selectedKeysProp],\n  );\n  const defaultSelection = useMemo(\n    () => toSelection(defaultSelectedKeys),\n    [defaultSelectedKeys],\n  );\n\n  const state = useMultipleSelectionState({\n    selectionMode,\n    selectedKeys: controlledSelection,\n    defaultSelectedKeys: defaultSelection,\n    disabledKeys: unselectableKeys,\n    disabledBehavior: 'selection',\n    onSelectionChange: handleSelectionChange,\n  });\n\n  const selectionManager = useMemo(\n    () => new SelectionManager(collection, state),\n    [collection, state],\n  );\n\n  const selectedKeys = state.selectedKeys;\n  const isAll = selectedKeys === 'all';\n  const isCascade =\n    tree?.behavior === 'cascade' && selectionMode === 'multiple';\n\n  const derivedSelection = useMemo(() => {\n    if (isAll) {\n      return {\n        checked: new Set(\n          [...rowByKey.keys()].filter((key) => !unselectableKeys.has(key)),\n        ),\n        indeterminate: new Set<Key>(),\n      };\n    }\n\n    if (!isCascade || !tree) {\n      return {\n        checked: new Set(selectedKeys as Set<Key>),\n        indeterminate: new Set<Key>(),\n      };\n    }\n\n    return deriveTreeSelection(\n      selectedKeys as Set<Key>,\n      tree.rootKeys,\n      tree.childrenOf,\n      (key) => !unselectableKeys.has(key),\n    );\n  }, [isAll, isCascade, selectedKeys, tree, rowByKey, unselectableKeys]);\n\n  const canSelect = useCallback(\n    (key: Key) => isEnabled && !unselectableKeys.has(key),\n    [isEnabled, unselectableKeys],\n  );\n\n  const isSelected = useCallback(\n    (key: Key) => (isAll ? canSelect(key) : derivedSelection.checked.has(key)),\n    [isAll, derivedSelection, canSelect],\n  );\n\n  const isIndeterminate = useCallback(\n    (key: Key) => derivedSelection.indeterminate.has(key),\n    [derivedSelection],\n  );\n\n  /** Keys the header checkbox acts on, which is what `selectAllMode` decides. */\n  const scopeKeys = useMemo(() => {\n    if (!isEnabled || selectionMode === 'single') return [];\n\n    const source = selectAllMode === 'page' ? pageRows : filteredRows;\n    const sourceKeys = selectAllMode === 'page' ? pageRowKeys : filteredRowKeys;\n\n    return source\n      .map((row, index) => sourceKeys?.[index] ?? getRowKey(row, index))\n      .filter((key) => !unselectableKeys.has(key));\n  }, [\n    isEnabled,\n    selectionMode,\n    selectAllMode,\n    pageRows,\n    pageRowKeys,\n    filteredRows,\n    filteredRowKeys,\n    getRowKey,\n    unselectableKeys,\n  ]);\n\n  const selectAllState: CubeTableSelectAllState = useMemo(() => {\n    if (isAll) return 'all';\n    if (!scopeKeys.length) return 'none';\n\n    const set = derivedSelection.checked;\n    let count = 0;\n\n    for (const key of scopeKeys) if (set.has(key)) count++;\n\n    return count === 0 ? 'none' : count === scopeKeys.length ? 'all' : 'some';\n  }, [isAll, derivedSelection, scopeKeys]);\n\n  const toggleSelectAll = useEvent(() => {\n    anchorRef.current = null;\n    extentRef.current = null;\n\n    if (selectAllState === 'all') {\n      // Clearing drops the whole selection, not just the scope: leaving keys\n      // selected on other pages after the user clicked an unchecked-looking\n      // box is the kind of thing nobody discovers until they delete something.\n      state.setSelectedKeys(new Set());\n\n      return;\n    }\n\n    if (selectAllMode === 'all') {\n      state.setSelectedKeys('all');\n\n      return;\n    }\n\n    const next = new Set(isAll ? [] : derivedSelection.checked);\n\n    scopeKeys.forEach((key) => next.add(key));\n    state.setSelectedKeys(\n      isCascade && tree\n        ? deriveTreeSelection(\n            next,\n            tree.rootKeys,\n            tree.childrenOf,\n            (key) => !unselectableKeys.has(key),\n          ).checked\n        : next,\n    );\n  });\n\n  const clearSelection = useEvent(() => {\n    anchorRef.current = null;\n    extentRef.current = null;\n    state.setSelectedKeys(new Set());\n  });\n\n  /**\n   * Shift held on the press that produced this change. `Checkbox` reports only\n   * the next value, so the modifier is captured from the pointer/key event on\n   * the cell and read back here.\n   */\n  const shiftRef = useRef(false);\n\n  const captureShift = useCallback((event: { shiftKey: boolean }) => {\n    shiftRef.current = event.shiftKey;\n  }, []);\n\n  /** Selectable keys between two rows, inclusive, in either direction. */\n  const keysBetween = useCallback(\n    (from: Key, to: Key) => {\n      const fromIndex = collection.indexOf(from);\n      const toIndex = collection.indexOf(to);\n\n      if (fromIndex < 0 || toIndex < 0) return [];\n\n      const [lo, hi] =\n        fromIndex <= toIndex ? [fromIndex, toIndex] : [toIndex, fromIndex];\n      const all = collection.getKeys();\n      const range: Key[] = [];\n\n      for (let i = lo; i <= hi; i++) range.push(all[i]);\n\n      return range;\n    },\n    [collection],\n  );\n\n  const toggleRow = useEvent((key: Key) => {\n    if (!canSelect(key)) return;\n\n    if (selectionMode === 'single') {\n      state.setSelectedKeys(isSelected(key) ? new Set() : new Set([key]));\n\n      return;\n    }\n\n    const applyCascade = (set: Set<Key>, target: Key, value: boolean) => {\n      if (!canSelect(target)) return;\n      if (value) set.add(target);\n      else {\n        set.delete(target);\n\n        // A checked ancestor in the normalized public key set means its whole\n        // branch is selected. Remove that derived marker before normalizing a\n        // partial deselection, or it would immediately select the child again.\n        if (isCascade && tree) {\n          let parent = tree.parentOf.get(target);\n          while (parent != null) {\n            set.delete(parent);\n            parent = tree.parentOf.get(parent);\n          }\n        }\n      }\n      if (!isCascade || !tree) return;\n      (tree.childrenOf.get(target) ?? []).forEach((child) =>\n        applyCascade(set, child, value),\n      );\n    };\n\n    const normalizeCascade = (set: Set<Key>) =>\n      isCascade && tree\n        ? deriveTreeSelection(\n            set,\n            tree.rootKeys,\n            tree.childrenOf,\n            (candidate) => !unselectableKeys.has(candidate),\n          ).checked\n        : set;\n\n    const anchor = anchorRef.current;\n\n    if (shiftRef.current && anchor != null && collection.indexOf(anchor) >= 0) {\n      const next = new Set(isAll ? scopeKeys : derivedSelection.checked);\n\n      // Drop the range this shift-click supersedes before drawing the new one,\n      // so clicking back toward the anchor shrinks the selection.\n      if (extentRef.current != null) {\n        keysBetween(anchor, extentRef.current).forEach((k) =>\n          applyCascade(next, k, false),\n        );\n      }\n\n      keysBetween(anchor, key).forEach((k) => {\n        applyCascade(next, k, true);\n      });\n\n      extentRef.current = key;\n      state.setSelectedKeys(normalizeCascade(next));\n\n      return;\n    }\n\n    anchorRef.current = key;\n    extentRef.current = null;\n    if (isCascade) {\n      const next = new Set(derivedSelection.checked);\n      applyCascade(next, key, !derivedSelection.checked.has(key));\n      state.setSelectedKeys(normalizeCascade(next));\n    } else {\n      selectionManager.toggleSelection(key);\n    }\n  });\n\n  const selectedRows = useMemo(() => {\n    if (isAll) return [...rowByKey.values()];\n\n    return [...derivedSelection.checked]\n      .map((key) => rowByKey.get(key))\n      .filter((row): row is T => row !== undefined);\n  }, [isAll, derivedSelection, rowByKey]);\n\n  return {\n    isEnabled,\n    selectionMode,\n    selectionManager,\n    collection,\n    isSelected,\n    isIndeterminate,\n    canSelect,\n    isRowDisabled: useCallback(\n      (key: Key) => hardDisabledKeys.has(key),\n      [hardDisabledKeys],\n    ),\n    toggleRow,\n    captureShift,\n    selectAllState,\n    toggleSelectAll,\n    clearSelection,\n    selectedRows,\n    selectedCount: isAll ? rowByKey.size : derivedSelection.checked.size,\n    selectedKeys: (isAll ? 'all' : [...derivedSelection.checked]) as\n      | Key[]\n      | 'all',\n  };\n}\n\nexport type CubeTableSelectionState<T> = ReturnType<\n  typeof useTableSelection<T>\n>;\n"],"mappings":";;;;;;;;;;;;;AAgBA,MAAaW,uBAAuB;;AAGpC,MAAaC,wBAAwB;;AAGrC,MAAaC,yBAAiD;CAC5DE,QAAQ;CACRC,OAAO;CACPC,QAAQ;CACRC,OAAO;CACPC,QAAQ;CACT;AAqCD,SAAS2B,YAAYX,MAAwD;AAC3E,KAAIA,SAASY,OAAW,QAAOA;AAE/B,QAAOZ,SAAS,QAAQ,QAAQ,IAAIa,IAAIb,KAAK;;AAG/C,SAASc,oBACPC,QACAV,UACAC,YACAW,YACA;CACA,MAAME,UAAU,IAAIN,IAAIE,OAAO;CAC/B,MAAMK,gCAAgB,IAAIP,KAAU;CAEpC,MAAMQ,SACJH,QACsD;EACtD,MAAMO,WAAWnB,WAAWoB,IAAIR,IAAI,IAAI,EAAE;EAC1C,MAAMM,WAAWP,WAAWC,IAAI;AAGhC,MAF2BM,YAAYT,OAAOa,IAAIV,IAAI,CAE9BC,SAAQU,IAAIX,IAAI;AAExC,MAAI,CAACO,SAASK,QAAQ;GACpB,MAAMC,WAAWP,YAAYL,QAAQS,IAAIV,IAAI;AAC7C,OAAI,CAACM,SAAUL,SAAQa,OAAOd,IAAI;AAClC,UAAO;IAAEI,KAAK,CAACE,YAAYO;IAAUR,KAAKQ;IAAUP;IAAU;;EAGhE,IAAIF,MAAM;EACV,IAAIC,MAAM;EACV,IAAIU,cAAc;AAElB,OAAK,MAAMC,SAAST,UAAU;GAC5B,MAAMU,SAASd,MAAMa,MAAM;AAC3B,OAAIC,OAAOX,SAAUS,eAAc;AACnC,OAAI,CAACE,OAAOb,IAAKA,OAAM;AACvB,OAAIa,OAAOZ,IAAKA,OAAM;;AAGxB,MAAI,CAACC,UAAU;AACbL,WAAQa,OAAOd,IAAI;AACnBE,iBAAcY,OAAOd,IAAI;aAChBe,eAAeX,KAAK;AAC7BH,WAAQU,IAAIX,IAAI;AAChBE,iBAAcY,OAAOd,IAAI;aAChBe,eAAeV,KAAK;AAC7BJ,WAAQa,OAAOd,IAAI;AACnBE,iBAAcS,IAAIX,IAAI;aACbe,aAAa;AAKtBd,WAAQa,OAAOd,IAAI;AACnBE,iBAAcY,OAAOd,IAAI;aAChB,CAACC,QAAQS,IAAIV,IAAI,CAC1BE,eAAcY,OAAOd,IAAI;AAG3B,SAAO;GACLI,KAAK,CAACE,YAAaL,QAAQS,IAAIV,IAAI,IAAII;GACvCC,KAAKA,OAAOJ,QAAQS,IAAIV,IAAI;GAC5BM,UAAUA,YAAYS;GACvB;;AAGH5B,UAAS+B,SAASlB,QAAQG,MAAMH,IAAI,CAAC;AACrC,QAAO;EAAEC;EAASC;EAAe;;AAGnC,SAAgBiB,kBAAqBC,SAAsC;CACzE,MAAM,EACJpD,MACAE,SACAC,WAAWH,MACXI,aACAC,cACAC,iBACAC,WACAG,eACAC,cAAc0C,kBACdzC,qBACAC,mBACAE,eACAC,iBACAC,cACAC,SACEkC;CAEJ,MAAME,YAAY5C,kBAAkB;;;;;;;;;;;;;CAcpC,MAAM6C,mBAAmB1E,cACjB,IAAI8C,IAAIV,gBAAgB,EAAE,CAAC,EACjC,CAACA,aACH,CAAC;CAED,MAAMuC,mBAAmB3E,cAAc;EACrC,MAAMiC,OAAO,IAAIa,IAAI4B,iBAAiB;AAEtC,MAAIvC,gBAGFX,cAAa6C,SAAS1C,KAAKC,UAAU;AACnC,OAAI,CAACO,gBAAgBR,IAAI,CACvBM,MAAK6B,IAAIrC,kBAAkBG,UAAUF,UAAUC,KAAKC,MAAM,CAAC;IAE7D;AAGJ,SAAOK;IACN;EACDyC;EACAvC;EACAX;EACAC;EACAC;EACD,CAAC;CAEF,MAAMkD,mBAAmB7E,aACtB4B,OAAQC,YAAkBP,UAAUO,YAAUF,UAAUC,OAAKC,QAAM,EACpE,CAACP,SAASK,UACZ,CAAC;CAED,MAAMmD,aAAa7E,cACX,IAAII,cAAce,MAAMyD,kBAAkBD,iBAAiB,EACjE;EAACxD;EAAMyD;EAAkBD;EAC3B,CAAC;CAED,MAAMG,WAAW9E,cAAc;EAC7B,MAAM+E,sBAAM,IAAIC,KAAa;AAI7BxD,eAAa6C,SAAS1C,OAAKC,YACzBmD,IAAIE,IAAIxD,kBAAkBG,YAAUF,UAAUC,OAAKC,QAAM,EAAED,MAC7D,CAAC;AACDR,OAAKkD,SAAS1C,OAAKC,YACjBmD,IAAIE,IAAI5D,UAAUO,YAAUF,UAAUC,OAAKC,QAAM,EAAED,MACrD,CAAC;AAED,SAAOoD;IACN;EAAC5D;EAAME;EAASG;EAAcC;EAAiBC;EAAU,CAAC;CAE7D,MAAMwD,cAAcjF,OAAO6E,SAAS;AAEpCI,aAAYC,UAAUL;;;;;;;;;;;;;;;;;CAkBtB,MAAMM,YAAYnF,OAAmB,KAAK;CAC1C,MAAMoF,YAAYpF,OAAmB,KAAK;CAE1C,MAAMqF,wBAAwBnF,UAAU8B,WAAoB;AAC1D,MAAI,CAACD,kBAAmB;AAExB,MAAIC,WAAS,OAAO;AAGlBD,qBAAkB,OAAO,CAAC,GAAGkD,YAAYC,QAAQI,QAAQ,CAAC,CAAC;AAE3D;;EAGF,MAAMC,OAAO,CAAC,GAAGvD,OAAK;AAEtBD,oBACEwD,MACAA,KACGT,KAAK5B,QAAQ+B,YAAYC,QAAQxB,IAAIR,IAAI,CAAC,CAC1CsC,QAAQ9D,UAAkBA,UAAQkB,OACvC,CAAC;GACD;CAWF,MAAM+C,QAAQ1F,0BAA0B;EACtC2B;EACAC,cAX0B9B,cACpB4C,YAAY4B,iBAAiB,EACnC,CAACA,iBACH,CAAC;EASCzC,qBARuB/B,cACjB4C,YAAYb,oBAAoB,EACtC,CAACA,oBACH,CAAC;EAMCK,cAAcuC;EACdkB,kBAAkB;EAClB7D,mBAAmBsD;EACpB,CAAC;CAEF,MAAMQ,mBAAmB9F,cACjB,IAAIF,iBAAiB+E,YAAYe,MAAM,EAC7C,CAACf,YAAYe,MACf,CAAC;CAED,MAAM9D,eAAe8D,MAAM9D;CAC3B,MAAMiE,QAAQjE,iBAAiB;CAC/B,MAAMkE,YACJ3D,MAAMK,aAAa,aAAab,kBAAkB;CAEpD,MAAMoE,mBAAmBjG,cAAc;AACrC,MAAI+F,MACF,QAAO;GACL3C,SAAS,IAAIN,IACX,CAAC,GAAGgC,SAAS7C,MAAM,CAAC,CAACwD,QAAQtC,UAAQ,CAACwB,iBAAiBd,IAAIV,MAAI,CACjE,CAAC;GACDE,+BAAe,IAAIP,KAAS;GAC7B;AAGH,MAAI,CAACkD,aAAa,CAAC3D,KACjB,QAAO;GACLe,SAAS,IAAIN,IAAIhB,aAAyB;GAC1CuB,+BAAe,IAAIP,KAAS;GAC7B;AAGH,SAAOC,oBACLjB,cACAO,KAAKC,UACLD,KAAKE,aACJY,UAAQ,CAACwB,iBAAiBd,IAAIV,MACjC,CAAC;IACA;EAAC4C;EAAOC;EAAWlE;EAAcO;EAAMyC;EAAUH;EAAiB,CAAC;CAEtE,MAAMuB,YAAYnG,aACfoD,UAAasB,aAAa,CAACE,iBAAiBd,IAAIV,MAAI,EACrD,CAACsB,WAAWE,iBACd,CAAC;CAED,MAAMwB,aAAapG,aAChBoD,UAAc4C,QAAQG,UAAU/C,MAAI,GAAG8C,iBAAiB7C,QAAQS,IAAIV,MAAK,EAC1E;EAAC4C;EAAOE;EAAkBC;EAC5B,CAAC;CAED,MAAME,kBAAkBrG,aACrBoD,UAAa8C,iBAAiB5C,cAAcQ,IAAIV,MAAI,EACrD,CAAC8C,iBACH,CAAC;;CAGD,MAAMI,YAAYrG,cAAc;AAC9B,MAAI,CAACyE,aAAa5C,kBAAkB,SAAU,QAAO,EAAE;EAEvD,MAAMmB,SAASd,kBAAkB,SAASZ,WAAWE;EACrD,MAAM8E,aAAapE,kBAAkB,SAASX,cAAcE;AAE5D,SAAOuB,OACJ+B,KAAKpD,OAAKC,YAAU0E,aAAa1E,YAAUF,UAAUC,OAAKC,QAAM,CAAC,CACjE6D,QAAQtC,UAAQ,CAACwB,iBAAiBd,IAAIV,MAAI,CAAC;IAC7C;EACDsB;EACA5C;EACAK;EACAZ;EACAC;EACAC;EACAC;EACAC;EACAiD;EACD,CAAC;CAEF,MAAM4B,iBAA0CvG,cAAc;AAC5D,MAAI+F,MAAO,QAAO;AAClB,MAAI,CAACM,UAAUtC,OAAQ,QAAO;EAE9B,MAAMkB,MAAMgB,iBAAiB7C;EAC7B,IAAIoD,QAAQ;AAEZ,OAAK,MAAMrD,SAAOkD,UAAW,KAAIpB,IAAIpB,IAAIV,MAAI,CAAEqD;AAE/C,SAAOA,UAAU,IAAI,SAASA,UAAUH,UAAUtC,SAAS,QAAQ;IAClE;EAACgC;EAAOE;EAAkBI;EAAU,CAAC;CAExC,MAAMI,kBAAkBtG,eAAe;AACrCiF,YAAUD,UAAU;AACpBE,YAAUF,UAAU;AAEpB,MAAIoB,mBAAmB,OAAO;AAI5BX,SAAMc,gCAAgB,IAAI5D,KAAK,CAAC;AAEhC;;AAGF,MAAIZ,kBAAkB,OAAO;AAC3B0D,SAAMc,gBAAgB,MAAM;AAE5B;;EAGF,MAAMC,OAAO,IAAI7D,IAAIiD,QAAQ,EAAE,GAAGE,iBAAiB7C,QAAQ;AAE3DiD,YAAUhC,SAASlB,UAAQwD,KAAK7C,IAAIX,MAAI,CAAC;AACzCyC,QAAMc,gBACJV,aAAa3D,OACTU,oBACE4D,MACAtE,KAAKC,UACLD,KAAKE,aACJY,UAAQ,CAACwB,iBAAiBd,IAAIV,MACjC,CAAC,CAACC,UACFuD,KACL;GACD;CAEF,MAAMC,iBAAiBzG,eAAe;AACpCiF,YAAUD,UAAU;AACpBE,YAAUF,UAAU;AACpBS,QAAMc,gCAAgB,IAAI5D,KAAK,CAAC;GAChC;;;;;;CAOF,MAAM+D,WAAW5G,OAAO,MAAM;CAE9B,MAAM6G,eAAe/G,aAAagH,UAAiC;AACjEF,WAAS1B,UAAU4B,MAAMC;IACxB,EAAE,CAAC;;CAGN,MAAMC,cAAclH,aACjBmH,MAAWC,OAAY;EACtB,MAAMC,YAAYvC,WAAWwC,QAAQH,KAAK;EAC1C,MAAMI,UAAUzC,WAAWwC,QAAQF,GAAG;AAEtC,MAAIC,YAAY,KAAKE,UAAU,EAAG,QAAO,EAAE;EAE3C,MAAM,CAACC,IAAIC,MACTJ,aAAaE,UAAU,CAACF,WAAWE,QAAQ,GAAG,CAACA,SAASF,UAAU;EACpE,MAAM7D,MAAMsB,WAAW4C,SAAS;EAChC,MAAMC,QAAe,EAAE;AAEvB,OAAK,IAAIC,IAAIJ,IAAII,KAAKH,IAAIG,IAAKD,OAAME,KAAKrE,IAAIoE,GAAG;AAEjD,SAAOD;IAET,CAAC7C,WACH,CAAC;CAED,MAAMgD,YAAY1H,UAAUgD,UAAa;AACvC,MAAI,CAAC+C,UAAU/C,MAAI,CAAE;AAErB,MAAItB,kBAAkB,UAAU;AAC9B+D,SAAMc,gBAAgBP,WAAWhD,MAAI,mBAAG,IAAIL,KAAK,GAAG,IAAIA,IAAI,CAACK,MAAI,CAAC,CAAC;AAEnE;;EAGF,MAAM2E,gBAAgB7C,OAAe8C,QAAaC,UAAmB;AACnE,OAAI,CAAC9B,UAAU6B,OAAO,CAAE;AACxB,OAAIC,MAAO/C,OAAInB,IAAIiE,OAAO;QACrB;AACH9C,UAAIhB,OAAO8D,OAAO;AAKlB,QAAI/B,aAAa3D,MAAM;KACrB,IAAI4F,SAAS5F,KAAKI,SAASkB,IAAIoE,OAAO;AACtC,YAAOE,UAAU,MAAM;AACrBhD,YAAIhB,OAAOgE,OAAO;AAClBA,eAAS5F,KAAKI,SAASkB,IAAIsE,OAAO;;;;AAIxC,OAAI,CAACjC,aAAa,CAAC3D,KAAM;AACzB,IAACA,KAAKE,WAAWoB,IAAIoE,OAAO,IAAI,EAAE,EAAE1D,SAASF,UAC3C2D,aAAa7C,OAAKd,OAAO6D,MAC3B,CAAC;;EAGH,MAAME,oBAAoBjD,UACxBe,aAAa3D,OACTU,oBACEkC,OACA5C,KAAKC,UACLD,KAAKE,aACJ4F,cAAc,CAACxD,iBAAiBd,IAAIsE,UACvC,CAAC,CAAC/E,UACF6B;EAEN,MAAMmD,SAAShD,UAAUD;AAEzB,MAAI0B,SAAS1B,WAAWiD,UAAU,QAAQvD,WAAWwC,QAAQe,OAAO,IAAI,GAAG;GACzE,MAAMzB,SAAO,IAAI7D,IAAIiD,QAAQM,YAAYJ,iBAAiB7C,QAAQ;AAIlE,OAAIiC,UAAUF,WAAW,KACvB8B,aAAYmB,QAAQ/C,UAAUF,QAAQ,CAACd,SAASgE,MAC9CP,aAAanB,QAAM0B,GAAG,MACxB,CAAC;AAGHpB,eAAYmB,QAAQjF,MAAI,CAACkB,SAASgE,QAAM;AACtCP,iBAAanB,QAAM0B,KAAG,KAAK;KAC3B;AAEFhD,aAAUF,UAAUhC;AACpByC,SAAMc,gBAAgBwB,iBAAiBvB,OAAK,CAAC;AAE7C;;AAGFvB,YAAUD,UAAUhC;AACpBkC,YAAUF,UAAU;AACpB,MAAIa,WAAW;GACb,MAAMW,SAAO,IAAI7D,IAAImD,iBAAiB7C,QAAQ;AAC9C0E,gBAAanB,QAAMxD,OAAK,CAAC8C,iBAAiB7C,QAAQS,IAAIV,MAAI,CAAC;AAC3DyC,SAAMc,gBAAgBwB,iBAAiBvB,OAAK,CAAC;QAE7Cb,kBAAiBwC,gBAAgBnF,MAAI;GAEvC;CAEF,MAAMoF,eAAevI,cAAc;AACjC,MAAI+F,MAAO,QAAO,CAAC,GAAGjB,SAASS,QAAQ,CAAC;AAExC,SAAO,CAAC,GAAGU,iBAAiB7C,QAAQ,CACjC2B,KAAK5B,WAAQ2B,SAASnB,IAAIR,OAAI,CAAC,CAC/BsC,QAAQ9D,UAAkBA,UAAQkB,OAAU;IAC9C;EAACkD;EAAOE;EAAkBnB;EAAS,CAAC;AAEvC,QAAO;EACLL;EACA5C;EACAiE;EACAjB;EACAsB;EACAC;EACAF;EACAsC,eAAezI,aACZoD,WAAauB,iBAAiBb,IAAIV,OAAI,EACvC,CAACuB,iBACH,CAAC;EACDmD;EACAf;EACAP;EACAE;EACAG;EACA2B;EACAE,eAAe1C,QAAQjB,SAAS4D,OAAOzC,iBAAiB7C,QAAQsF;EAChE5G,cAAeiE,QAAQ,QAAQ,CAAC,GAAGE,iBAAiB7C,QAAQ;EAG7D"}

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

@@ -1,7 +1,7 @@
-/** @license MIT | @cube-dev/ui-kit v0.181.0 | Cube Dev Team */
+/** @license MIT | @cube-dev/ui-kit v0.183.0 | Cube Dev Team */
 import { useEvent } from "../../../_internal/hooks/use-event.js";
 import { getColumnText, getColumnValue } from "./use-table-columns.js";
-import { useMemo } from "react";
+import { c } from "react-compiler-runtime";
 import { useCollator } from "react-aria";
 import { useControlledState } from "@react-stately/utils";
 
@@ -14,82 +14,146 @@ import { useControlledState } from "@react-stately/utils";
 * a real loss when the source order is meaningful. `disallowSortRemoval` on a
 * column reduces it to `asc ↔ desc`.
 */
-function useTableSort({ columns, rows, mode, sort: sortProp, defaultSort, onSortChange }) {
-	const collator = useCollator({
-		numeric: true,
-		sensitivity: "base"
-	});
+function useTableSort(t0) {
+	const $ = c(28);
+	const { columns, rows, mode, sort: sortProp, defaultSort, onSortChange } = t0;
+	let t1;
+	if ($[0] === Symbol.for("react.memo_cache_sentinel")) {
+		t1 = {
+			numeric: true,
+			sensitivity: "base"
+		};
+		$[0] = t1;
+	} else t1 = $[0];
+	const collator = useCollator(t1);
 	const [sort, setSort] = useControlledState(sortProp, defaultSort ?? null, onSortChange);
-	const hasSortableColumn = columns.some((column) => column.isSortable);
+	const hasSortableColumn = columns.some(_temp);
 	const resolvedMode = mode ?? (hasSortableColumn ? "client" : "off");
-	const isSortable = useEvent((column) => resolvedMode !== "off" && column.isSortable === true);
-	const toggleSort = useEvent((columnKey) => {
-		const column = columns.find((entry) => entry.key === columnKey);
-		if (!column || !isSortable(column)) return;
-		if (sort?.columnKey !== columnKey) {
-			setSort({
+	let t2;
+	if ($[1] !== resolvedMode) {
+		t2 = (column_0) => resolvedMode !== "off" && column_0.isSortable === true;
+		$[1] = resolvedMode;
+		$[2] = t2;
+	} else t2 = $[2];
+	const isSortable = useEvent(t2);
+	let t3;
+	if ($[3] !== columns || $[4] !== isSortable || $[5] !== setSort || $[6] !== sort) {
+		t3 = (columnKey) => {
+			const column_1 = columns.find((entry) => entry.key === columnKey);
+			if (!column_1 || !isSortable(column_1)) return;
+			if (sort?.columnKey !== columnKey) {
+				setSort({
+					columnKey,
+					direction: "asc"
+				});
+				return;
+			}
+			if (sort.direction === "asc") {
+				setSort({
+					columnKey,
+					direction: "desc"
+				});
+				return;
+			}
+			setSort(column_1.disallowSortRemoval ? {
 				columnKey,
 				direction: "asc"
-			});
-			return;
-		}
-		if (sort.direction === "asc") {
+			} : null);
+		};
+		$[3] = columns;
+		$[4] = isSortable;
+		$[5] = setSort;
+		$[6] = sort;
+		$[7] = t3;
+	} else t3 = $[7];
+	const toggleSort = useEvent(t3);
+	let t4;
+	if ($[8] !== columns || $[9] !== isSortable || $[10] !== setSort || $[11] !== sort) {
+		t4 = (columnKey_0, direction) => {
+			const column_2 = columns.find((entry_0) => entry_0.key === columnKey_0);
+			if (!column_2 || !isSortable(column_2)) return;
+			if (direction == null) {
+				if (sort?.columnKey !== columnKey_0 || column_2.disallowSortRemoval) return;
+				setSort(null);
+				return;
+			}
+			if (sort?.columnKey === columnKey_0 && sort.direction === direction) return;
 			setSort({
-				columnKey,
-				direction: "desc"
+				columnKey: columnKey_0,
+				direction
 			});
-			return;
-		}
-		setSort(column.disallowSortRemoval ? {
-			columnKey,
-			direction: "asc"
-		} : null);
-	});
-	/**
-	* Set the column's direction outright instead of advancing the cycle — see
-	* `use-table-sorts.ts` for why the column menu cannot reuse `toggleSort`.
-	*/
-	const setColumnSort = useEvent((columnKey, direction) => {
-		const column = columns.find((entry) => entry.key === columnKey);
-		if (!column || !isSortable(column)) return;
-		if (direction == null) {
-			if (sort?.columnKey !== columnKey || column.disallowSortRemoval) return;
-			setSort(null);
-			return;
+		};
+		$[8] = columns;
+		$[9] = isSortable;
+		$[10] = setSort;
+		$[11] = sort;
+		$[12] = t4;
+	} else t4 = $[12];
+	const setColumnSort = useEvent(t4);
+	let t5;
+	if ($[13] !== collator || $[14] !== columns || $[15] !== resolvedMode || $[16] !== rows || $[17] !== sort) {
+		bb0: {
+			if (resolvedMode !== "client" || !sort) {
+				t5 = rows;
+				break bb0;
+			}
+			let t6;
+			if ($[19] !== sort) {
+				t6 = (entry_1) => entry_1.key === sort.columnKey;
+				$[19] = sort;
+				$[20] = t6;
+			} else t6 = $[20];
+			const column_3 = columns.find(t6);
+			if (!column_3) {
+				t5 = rows;
+				break bb0;
+			}
+			const direction_0 = sort.direction === "asc" ? 1 : -1;
+			t5 = rows.map(_temp2).sort((a, b) => {
+				const result = compareByColumn(column_3, collator, a.row, a.index, b.row, b.index);
+				return result !== 0 ? result * direction_0 : a.index - b.index;
+			}).map(_temp3);
 		}
-		if (sort?.columnKey === columnKey && sort.direction === direction) return;
-		setSort({
-			columnKey,
-			direction
-		});
-	});
-	return {
-		sort,
-		sortedRows: useMemo(() => {
-			if (resolvedMode !== "client" || !sort) return rows;
-			const column = columns.find((entry) => entry.key === sort.columnKey);
-			if (!column) return rows;
-			const direction = sort.direction === "asc" ? 1 : -1;
-			return rows.map((row, index) => ({
-				row,
-				index
-			})).sort((a, b) => {
-				const result = compareByColumn(column, collator, a.row, a.index, b.row, b.index);
-				return result !== 0 ? result * direction : a.index - b.index;
-			}).map((entry) => entry.row);
-		}, [
-			resolvedMode,
+		$[13] = collator;
+		$[14] = columns;
+		$[15] = resolvedMode;
+		$[16] = rows;
+		$[17] = sort;
+		$[18] = t5;
+	} else t5 = $[18];
+	const sortedRows = t5;
+	let t6;
+	if ($[21] !== isSortable || $[22] !== resolvedMode || $[23] !== setColumnSort || $[24] !== sort || $[25] !== sortedRows || $[26] !== toggleSort) {
+		t6 = {
 			sort,
-			rows,
-			columns,
-			collator
-		]),
-		toggleSort,
-		setColumnSort,
-		isSortable,
-		mode: resolvedMode
+			sortedRows,
+			toggleSort,
+			setColumnSort,
+			isSortable,
+			mode: resolvedMode
+		};
+		$[21] = isSortable;
+		$[22] = resolvedMode;
+		$[23] = setColumnSort;
+		$[24] = sort;
+		$[25] = sortedRows;
+		$[26] = toggleSort;
+		$[27] = t6;
+	} else t6 = $[27];
+	return t6;
+}
+function _temp3(entry_2) {
+	return entry_2.row;
+}
+function _temp2(row, index) {
+	return {
+		row,
+		index
 	};
 }
+function _temp(column) {
+	return column.isSortable;
+}
 function compareByColumn(column, collator, rowA, indexA, rowB, indexB) {
 	const valueA = getColumnValue(column, rowA, indexA);
 	const valueB = getColumnValue(column, rowB, indexB);

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

@@ -1 +1 @@
-{"version":3,"file":"use-table-sort.js","names":[],"sources":["../../../../src/components/data/TableBase/use-table-sort.ts"],"sourcesContent":["import { useControlledState } from '@react-stately/utils';\nimport { useMemo } from 'react';\nimport { useCollator } from 'react-aria';\n\nimport { useEvent } from '../../../_internal/hooks';\n\nimport { getColumnText, getColumnValue } from './use-table-columns';\n\nimport type {\n  CubeTableColumn,\n  CubeTableSort,\n  CubeTableSortDirection,\n} from './types';\n\nexport type CubeTableSortMode = 'client' | 'server' | 'off';\n\nexport interface UseTableSortOptions<T> {\n  columns: CubeTableColumn<T>[];\n  rows: readonly T[];\n  /** @default 'client' when any column is sortable, else 'off' */\n  mode?: CubeTableSortMode;\n  sort?: CubeTableSort | null;\n  defaultSort?: CubeTableSort | null;\n  onSortChange?: (sort: CubeTableSort | null) => void;\n}\n\nexport interface UseTableSortResult<T> {\n  sort: CubeTableSort | null;\n  /** `rows` reordered in client mode; the original array otherwise. */\n  sortedRows: readonly T[];\n  /** Advances a column through the sort cycle. */\n  toggleSort: (columnKey: string) => void;\n  /**\n   * Sets a column's direction outright. `null` clears it.\n   *\n   * For the column menu's reserved sort keys, which have to reach a specific\n   * direction in one step rather than cycling to it.\n   */\n  setColumnSort: (\n    columnKey: string,\n    direction: CubeTableSortDirection | null,\n  ) => void;\n  isSortable: (column: CubeTableColumn<T>) => boolean;\n  /**\n   * The mode after defaulting. The renderer needs this exact answer to decide\n   * whether a header is clickable, and deriving it a second time at the call\n   * site is how `DataTable` ended up sorting on `defaultSorts` but ignoring\n   * every click.\n   */\n  mode: CubeTableSortMode;\n}\n\n/**\n * Sort state plus, in client mode, the reordered rows.\n *\n * The cycle is tri-state — `asc → desc → unsorted` — matching ag-grid's default\n * `sortingOrder`, because losing the ability to get back to the source order is\n * a real loss when the source order is meaningful. `disallowSortRemoval` on a\n * column reduces it to `asc ↔ desc`.\n */\nexport function useTableSort<T>({\n  columns,\n  rows,\n  mode,\n  sort: sortProp,\n  defaultSort,\n  onSortChange,\n}: UseTableSortOptions<T>): UseTableSortResult<T> {\n  // A collator gives locale-correct, case-insensitive ordering — \"Ä\" sorts next\n  // to \"A\" rather than after \"Z\", which a raw `<` comparison gets wrong.\n  const collator = useCollator({ numeric: true, sensitivity: 'base' });\n\n  const [sort, setSort] = useControlledState<CubeTableSort | null>(\n    sortProp as CubeTableSort | null,\n    defaultSort ?? null,\n    onSortChange as (value: CubeTableSort | null) => void,\n  );\n\n  const hasSortableColumn = columns.some((column) => column.isSortable);\n  const resolvedMode: CubeTableSortMode =\n    mode ?? (hasSortableColumn ? 'client' : 'off');\n\n  const isSortable = useEvent(\n    (column: CubeTableColumn<T>) =>\n      resolvedMode !== 'off' && column.isSortable === true,\n  );\n\n  const toggleSort = useEvent((columnKey: string) => {\n    const column = columns.find((entry) => entry.key === columnKey);\n\n    if (!column || !isSortable(column)) return;\n\n    if (sort?.columnKey !== columnKey) {\n      setSort({ columnKey, direction: 'asc' });\n\n      return;\n    }\n\n    if (sort.direction === 'asc') {\n      setSort({ columnKey, direction: 'desc' });\n\n      return;\n    }\n\n    setSort(\n      column.disallowSortRemoval ? { columnKey, direction: 'asc' } : null,\n    );\n  });\n\n  /**\n   * Set the column's direction outright instead of advancing the cycle — see\n   * `use-table-sorts.ts` for why the column menu cannot reuse `toggleSort`.\n   */\n  const setColumnSort = useEvent(\n    (columnKey: string, direction: CubeTableSortDirection | null) => {\n      const column = columns.find((entry) => entry.key === columnKey);\n\n      if (!column || !isSortable(column)) return;\n\n      if (direction == null) {\n        // Clearing a column that is not the sorted one is a no-op rather than a\n        // reset, and `disallowSortRemoval` refuses the clear outright.\n        if (sort?.columnKey !== columnKey || column.disallowSortRemoval) return;\n\n        setSort(null);\n\n        return;\n      }\n\n      if (sort?.columnKey === columnKey && sort.direction === direction) return;\n\n      setSort({ columnKey, direction });\n    },\n  );\n\n  const sortedRows = useMemo(() => {\n    if (resolvedMode !== 'client' || !sort) return rows;\n\n    const column = columns.find((entry) => entry.key === sort.columnKey);\n\n    if (!column) return rows;\n\n    const direction = sort.direction === 'asc' ? 1 : -1;\n\n    // `map`/`sort`/`map` rather than sorting in place: `rows` is the caller's\n    // array and `Array.prototype.sort` mutates. Carrying the original index also\n    // makes the sort stable across engines.\n    return rows\n      .map((row, index) => ({ row, index }))\n      .sort((a, b) => {\n        const result = compareByColumn(\n          column,\n          collator,\n          a.row,\n          a.index,\n          b.row,\n          b.index,\n        );\n\n        return result !== 0 ? result * direction : a.index - b.index;\n      })\n      .map((entry) => entry.row);\n  }, [resolvedMode, sort, rows, columns, collator]);\n\n  // The resolved mode is returned rather than left for the caller to derive\n  // again: the renderer needs the same answer to decide whether a header is\n  // clickable, and two independent derivations drift.\n  return {\n    sort,\n    sortedRows,\n    toggleSort,\n    setColumnSort,\n    isSortable,\n    mode: resolvedMode,\n  };\n}\n\nexport function compareByColumn<T>(\n  column: CubeTableColumn<T>,\n  collator: Intl.Collator,\n  rowA: T,\n  indexA: number,\n  rowB: T,\n  indexB: number,\n): number {\n  const valueA = getColumnValue(column, rowA, indexA);\n  const valueB = getColumnValue(column, rowB, indexB);\n\n  if (column.compare) return column.compare(valueA, valueB, rowA, rowB);\n\n  // Nullish always sorts first, then gets flipped with the direction. Mixing\n  // them into the value comparison instead produces an unstable order.\n  if (valueA == null && valueB == null) return 0;\n  if (valueA == null) return -1;\n  if (valueB == null) return 1;\n\n  if (typeof valueA === 'number' && typeof valueB === 'number') {\n    return valueA - valueB;\n  }\n  if (typeof valueA === 'boolean' && typeof valueB === 'boolean') {\n    return Number(valueA) - Number(valueB);\n  }\n  if (valueA instanceof Date && valueB instanceof Date) {\n    return valueA.getTime() - valueB.getTime();\n  }\n\n  // Fall back to display text, so a column with a `format` sorts the way it\n  // reads rather than the way it is stored.\n  const textA = getColumnText(column, rowA, indexA) ?? String(valueA);\n  const textB = getColumnText(column, rowB, indexB) ?? String(valueB);\n\n  return collator.compare(textA, textB);\n}\n"],"mappings":";;;;;;;;;;;;;;;;AA4DA,SAAgB,aAAgB,EAC9B,SACA,MACA,MACA,MAAM,UACN,aACA,gBACgD;CAGhD,MAAM,WAAW,YAAY;EAAE,SAAS;EAAM,aAAa;EAAQ,CAAC;CAEpE,MAAM,CAAC,MAAM,WAAW,mBACtB,UACA,eAAe,MACf,aACD;CAED,MAAM,oBAAoB,QAAQ,MAAM,WAAW,OAAO,WAAW;CACrE,MAAM,eACJ,SAAS,oBAAoB,WAAW;CAE1C,MAAM,aAAa,UAChB,WACC,iBAAiB,SAAS,OAAO,eAAe,KACnD;CAED,MAAM,aAAa,UAAU,cAAsB;EACjD,MAAM,SAAS,QAAQ,MAAM,UAAU,MAAM,QAAQ,UAAU;AAE/D,MAAI,CAAC,UAAU,CAAC,WAAW,OAAO,CAAE;AAEpC,MAAI,MAAM,cAAc,WAAW;AACjC,WAAQ;IAAE;IAAW,WAAW;IAAO,CAAC;AAExC;;AAGF,MAAI,KAAK,cAAc,OAAO;AAC5B,WAAQ;IAAE;IAAW,WAAW;IAAQ,CAAC;AAEzC;;AAGF,UACE,OAAO,sBAAsB;GAAE;GAAW,WAAW;GAAO,GAAG,KAChE;GACD;;;;;CAMF,MAAM,gBAAgB,UACnB,WAAmB,cAA6C;EAC/D,MAAM,SAAS,QAAQ,MAAM,UAAU,MAAM,QAAQ,UAAU;AAE/D,MAAI,CAAC,UAAU,CAAC,WAAW,OAAO,CAAE;AAEpC,MAAI,aAAa,MAAM;AAGrB,OAAI,MAAM,cAAc,aAAa,OAAO,oBAAqB;AAEjE,WAAQ,KAAK;AAEb;;AAGF,MAAI,MAAM,cAAc,aAAa,KAAK,cAAc,UAAW;AAEnE,UAAQ;GAAE;GAAW;GAAW,CAAC;GAEpC;AAkCD,QAAO;EACL;EACA,YAlCiB,cAAc;AAC/B,OAAI,iBAAiB,YAAY,CAAC,KAAM,QAAO;GAE/C,MAAM,SAAS,QAAQ,MAAM,UAAU,MAAM,QAAQ,KAAK,UAAU;AAEpE,OAAI,CAAC,OAAQ,QAAO;GAEpB,MAAM,YAAY,KAAK,cAAc,QAAQ,IAAI;AAKjD,UAAO,KACJ,KAAK,KAAK,WAAW;IAAE;IAAK;IAAO,EAAE,CACrC,MAAM,GAAG,MAAM;IACd,MAAM,SAAS,gBACb,QACA,UACA,EAAE,KACF,EAAE,OACF,EAAE,KACF,EAAE,MACH;AAED,WAAO,WAAW,IAAI,SAAS,YAAY,EAAE,QAAQ,EAAE;KACvD,CACD,KAAK,UAAU,MAAM,IAAI;KAC3B;GAAC;GAAc;GAAM;GAAM;GAAS;GAAS,CAAC;EAQ/C;EACA;EACA;EACA,MAAM;EACP;;AAGH,SAAgB,gBACd,QACA,UACA,MACA,QACA,MACA,QACQ;CACR,MAAM,SAAS,eAAe,QAAQ,MAAM,OAAO;CACnD,MAAM,SAAS,eAAe,QAAQ,MAAM,OAAO;AAEnD,KAAI,OAAO,QAAS,QAAO,OAAO,QAAQ,QAAQ,QAAQ,MAAM,KAAK;AAIrE,KAAI,UAAU,QAAQ,UAAU,KAAM,QAAO;AAC7C,KAAI,UAAU,KAAM,QAAO;AAC3B,KAAI,UAAU,KAAM,QAAO;AAE3B,KAAI,OAAO,WAAW,YAAY,OAAO,WAAW,SAClD,QAAO,SAAS;AAElB,KAAI,OAAO,WAAW,aAAa,OAAO,WAAW,UACnD,QAAO,OAAO,OAAO,GAAG,OAAO,OAAO;AAExC,KAAI,kBAAkB,QAAQ,kBAAkB,KAC9C,QAAO,OAAO,SAAS,GAAG,OAAO,SAAS;CAK5C,MAAM,QAAQ,cAAc,QAAQ,MAAM,OAAO,IAAI,OAAO,OAAO;CACnE,MAAM,QAAQ,cAAc,QAAQ,MAAM,OAAO,IAAI,OAAO,OAAO;AAEnE,QAAO,SAAS,QAAQ,OAAO,MAAM"}
+{"version":3,"file":"use-table-sort.js","names":["useControlledState","useMemo","useCollator","useEvent","getColumnText","getColumnValue","CubeTableColumn","CubeTableSort","CubeTableSortDirection","CubeTableSortMode","UseTableSortOptions","columns","T","rows","mode","sort","defaultSort","onSortChange","UseTableSortResult","sortedRows","toggleSort","columnKey","setColumnSort","direction","isSortable","column","useTableSort","t0","$","_c","sortProp","t1","Symbol","for","numeric","sensitivity","collator","setSort","value","hasSortableColumn","some","_temp","resolvedMode","t2","column_0","t3","column_1","find","entry","key","disallowSortRemoval","t4","columnKey_0","column_2","entry_0","t5","bb0","t6","entry_1","column_3","direction_0","map","_temp2","a","b","result","compareByColumn","row","index","_temp3","entry_2","Intl","Collator","rowA","indexA","rowB","indexB","valueA","valueB","compare","Number","Date","getTime","textA","String","textB"],"sources":["../../../../src/components/data/TableBase/use-table-sort.ts"],"sourcesContent":["import { useControlledState } from '@react-stately/utils';\nimport { useMemo } from 'react';\nimport { useCollator } from 'react-aria';\n\nimport { useEvent } from '../../../_internal/hooks';\n\nimport { getColumnText, getColumnValue } from './use-table-columns';\n\nimport type {\n  CubeTableColumn,\n  CubeTableSort,\n  CubeTableSortDirection,\n} from './types';\n\nexport type CubeTableSortMode = 'client' | 'server' | 'off';\n\nexport interface UseTableSortOptions<T> {\n  columns: CubeTableColumn<T>[];\n  rows: readonly T[];\n  /** @default 'client' when any column is sortable, else 'off' */\n  mode?: CubeTableSortMode;\n  sort?: CubeTableSort | null;\n  defaultSort?: CubeTableSort | null;\n  onSortChange?: (sort: CubeTableSort | null) => void;\n}\n\nexport interface UseTableSortResult<T> {\n  sort: CubeTableSort | null;\n  /** `rows` reordered in client mode; the original array otherwise. */\n  sortedRows: readonly T[];\n  /** Advances a column through the sort cycle. */\n  toggleSort: (columnKey: string) => void;\n  /**\n   * Sets a column's direction outright. `null` clears it.\n   *\n   * For the column menu's reserved sort keys, which have to reach a specific\n   * direction in one step rather than cycling to it.\n   */\n  setColumnSort: (\n    columnKey: string,\n    direction: CubeTableSortDirection | null,\n  ) => void;\n  isSortable: (column: CubeTableColumn<T>) => boolean;\n  /**\n   * The mode after defaulting. The renderer needs this exact answer to decide\n   * whether a header is clickable, and deriving it a second time at the call\n   * site is how `DataTable` ended up sorting on `defaultSorts` but ignoring\n   * every click.\n   */\n  mode: CubeTableSortMode;\n}\n\n/**\n * Sort state plus, in client mode, the reordered rows.\n *\n * The cycle is tri-state — `asc → desc → unsorted` — matching ag-grid's default\n * `sortingOrder`, because losing the ability to get back to the source order is\n * a real loss when the source order is meaningful. `disallowSortRemoval` on a\n * column reduces it to `asc ↔ desc`.\n */\nexport function useTableSort<T>({\n  columns,\n  rows,\n  mode,\n  sort: sortProp,\n  defaultSort,\n  onSortChange,\n}: UseTableSortOptions<T>): UseTableSortResult<T> {\n  // A collator gives locale-correct, case-insensitive ordering — \"Ä\" sorts next\n  // to \"A\" rather than after \"Z\", which a raw `<` comparison gets wrong.\n  const collator = useCollator({ numeric: true, sensitivity: 'base' });\n\n  const [sort, setSort] = useControlledState<CubeTableSort | null>(\n    sortProp as CubeTableSort | null,\n    defaultSort ?? null,\n    onSortChange as (value: CubeTableSort | null) => void,\n  );\n\n  const hasSortableColumn = columns.some((column) => column.isSortable);\n  const resolvedMode: CubeTableSortMode =\n    mode ?? (hasSortableColumn ? 'client' : 'off');\n\n  const isSortable = useEvent(\n    (column: CubeTableColumn<T>) =>\n      resolvedMode !== 'off' && column.isSortable === true,\n  );\n\n  const toggleSort = useEvent((columnKey: string) => {\n    const column = columns.find((entry) => entry.key === columnKey);\n\n    if (!column || !isSortable(column)) return;\n\n    if (sort?.columnKey !== columnKey) {\n      setSort({ columnKey, direction: 'asc' });\n\n      return;\n    }\n\n    if (sort.direction === 'asc') {\n      setSort({ columnKey, direction: 'desc' });\n\n      return;\n    }\n\n    setSort(\n      column.disallowSortRemoval ? { columnKey, direction: 'asc' } : null,\n    );\n  });\n\n  /**\n   * Set the column's direction outright instead of advancing the cycle — see\n   * `use-table-sorts.ts` for why the column menu cannot reuse `toggleSort`.\n   */\n  const setColumnSort = useEvent(\n    (columnKey: string, direction: CubeTableSortDirection | null) => {\n      const column = columns.find((entry) => entry.key === columnKey);\n\n      if (!column || !isSortable(column)) return;\n\n      if (direction == null) {\n        // Clearing a column that is not the sorted one is a no-op rather than a\n        // reset, and `disallowSortRemoval` refuses the clear outright.\n        if (sort?.columnKey !== columnKey || column.disallowSortRemoval) return;\n\n        setSort(null);\n\n        return;\n      }\n\n      if (sort?.columnKey === columnKey && sort.direction === direction) return;\n\n      setSort({ columnKey, direction });\n    },\n  );\n\n  const sortedRows = useMemo(() => {\n    if (resolvedMode !== 'client' || !sort) return rows;\n\n    const column = columns.find((entry) => entry.key === sort.columnKey);\n\n    if (!column) return rows;\n\n    const direction = sort.direction === 'asc' ? 1 : -1;\n\n    // `map`/`sort`/`map` rather than sorting in place: `rows` is the caller's\n    // array and `Array.prototype.sort` mutates. Carrying the original index also\n    // makes the sort stable across engines.\n    return rows\n      .map((row, index) => ({ row, index }))\n      .sort((a, b) => {\n        const result = compareByColumn(\n          column,\n          collator,\n          a.row,\n          a.index,\n          b.row,\n          b.index,\n        );\n\n        return result !== 0 ? result * direction : a.index - b.index;\n      })\n      .map((entry) => entry.row);\n  }, [resolvedMode, sort, rows, columns, collator]);\n\n  // The resolved mode is returned rather than left for the caller to derive\n  // again: the renderer needs the same answer to decide whether a header is\n  // clickable, and two independent derivations drift.\n  return {\n    sort,\n    sortedRows,\n    toggleSort,\n    setColumnSort,\n    isSortable,\n    mode: resolvedMode,\n  };\n}\n\nexport function compareByColumn<T>(\n  column: CubeTableColumn<T>,\n  collator: Intl.Collator,\n  rowA: T,\n  indexA: number,\n  rowB: T,\n  indexB: number,\n): number {\n  const valueA = getColumnValue(column, rowA, indexA);\n  const valueB = getColumnValue(column, rowB, indexB);\n\n  if (column.compare) return column.compare(valueA, valueB, rowA, rowB);\n\n  // Nullish always sorts first, then gets flipped with the direction. Mixing\n  // them into the value comparison instead produces an unstable order.\n  if (valueA == null && valueB == null) return 0;\n  if (valueA == null) return -1;\n  if (valueB == null) return 1;\n\n  if (typeof valueA === 'number' && typeof valueB === 'number') {\n    return valueA - valueB;\n  }\n  if (typeof valueA === 'boolean' && typeof valueB === 'boolean') {\n    return Number(valueA) - Number(valueB);\n  }\n  if (valueA instanceof Date && valueB instanceof Date) {\n    return valueA.getTime() - valueB.getTime();\n  }\n\n  // Fall back to display text, so a column with a `format` sorts the way it\n  // reads rather than the way it is stored.\n  const textA = getColumnText(column, rowA, indexA) ?? String(valueA);\n  const textB = getColumnText(column, rowB, indexB) ?? String(valueB);\n\n  return collator.compare(textA, textB);\n}\n"],"mappings":";;;;;;;;;;;;;;;;AA4DA,SAAO0B,aAAAC,IAAA;CAAA,MAAAC,IAAAC,EAAA,GAAA;CAAyB,MAAA,EAAAlB,SAAAE,MAAAC,MAAAC,MAAAe,UAAAd,aAAAC,iBAAAU;CAOP,IAAAI;AAAA,KAAAH,EAAA,OAAAI,OAAAC,IAAA,4BAAA,EAAA;AAGMF,OAAA;GAAAG,SAAW;GAAIC,aAAe;GAAQ;AAAAP,IAAA,KAAAG;OAAAA,MAAAH,EAAA;CAAnE,MAAAQ,WAAiBlC,YAAY6B,GAAuC;CAEpE,MAAA,CAAAhB,MAAAsB,WAAwBrC,mBACtB8B,UACAd,eAAA,MACAC,aACD;CAED,MAAAsB,oBAA0B5B,QAAO6B,KAAMC,MAA8B;CACrE,MAAAC,eACE5B,SAASyB,oBAAA,WAAA;CAAsC,IAAAI;AAAA,KAAAf,EAAA,OAAAc,cAAA;AAG/CC,QAAAC,aACEF,iBAAiB,SAASjB,SAAMD,eAAgB;AAAII,IAAA,KAAAc;AAAAd,IAAA,KAAAe;OAAAA,MAAAf,EAAA;CAFxD,MAAAJ,aAAmBrB,SACjBwC,GAED;CAAC,IAAAE;AAAA,KAAAjB,EAAA,OAAAjB,WAAAiB,EAAA,OAAAJ,cAAAI,EAAA,OAAAS,WAAAT,EAAA,OAAAb,MAAA;AAE0B8B,QAAAxB,cAAA;GAC1B,MAAAyB,WAAenC,QAAOoC,MAAMC,UAAWA,MAAKC,QAAS5B,UAAU;AAE/D,OAAI,CAACI,YAAD,CAAYD,WAAWC,SAAO,CAAA;AAElC,OAAIV,MAAIM,cAAgBA,WAAS;AAC/BgB,YAAQ;KAAAhB;KAAAE,WAAwB;KAAO,CAAC;AAAA;;AAK1C,OAAIR,KAAIQ,cAAe,OAAK;AAC1Bc,YAAQ;KAAAhB;KAAAE,WAAwB;KAAQ,CAAC;AAAA;;AAK3Cc,WACEZ,SAAMyB,sBAAN;IAAA7B;IAAAE,WAAqD;IAAc,GAAnE,KACD;;AACFK,IAAA,KAAAjB;AAAAiB,IAAA,KAAAJ;AAAAI,IAAA,KAAAS;AAAAT,IAAA,KAAAb;AAAAa,IAAA,KAAAiB;OAAAA,MAAAjB,EAAA;CApBD,MAAAR,aAAmBjB,SAAS0C,GAoB1B;CAAC,IAAAM;AAAA,KAAAvB,EAAA,OAAAjB,WAAAiB,EAAA,OAAAJ,cAAAI,EAAA,QAAAS,WAAAT,EAAA,QAAAb,MAAA;AAODoC,QAAAC,aAAA7B,cAAA;GACE,MAAA8B,WAAe1C,QAAOoC,MAAMO,YAAWN,QAAKC,QAAS5B,YAAU;AAE/D,OAAI,CAACI,YAAD,CAAYD,WAAWC,SAAO,CAAA;AAElC,OAAIF,aAAa,MAAI;AAGnB,QAAIR,MAAIM,cAAgBA,eAAaI,SAAMyB,oBAAoB;AAE/Db,YAAQ,KAAK;AAAA;;AAKf,OAAItB,MAAIM,cAAgBA,eAAaN,KAAIQ,cAAeA,UAAS;AAEjEc,WAAQ;IAAAhB,WAAEA;IAASE;IAAa,CAAC;;AAClCK,IAAA,KAAAjB;AAAAiB,IAAA,KAAAJ;AAAAI,IAAA,MAAAS;AAAAT,IAAA,MAAAb;AAAAa,IAAA,MAAAuB;OAAAA,MAAAvB,EAAA;CAnBH,MAAAN,gBAAsBnB,SACpBgD,GAmBD;CAAC,IAAAI;AAAA,KAAA3B,EAAA,QAAAQ,YAAAR,EAAA,QAAAjB,WAAAiB,EAAA,QAAAc,gBAAAd,EAAA,QAAAf,QAAAe,EAAA,QAAAb,MAAA;AAAAyC,OAAA;AAGA,OAAId,iBAAiB,YAAjB,CAA8B3B,MAAI;AAAEwC,SAAO1C;AAAP,UAAA2C;;GAAY,IAAAC;AAAA,OAAA7B,EAAA,QAAAb,MAAA;AAExB0C,UAAAC,YAAWV,QAAKC,QAASlC,KAAIM;AAAUO,MAAA,MAAAb;AAAAa,MAAA,MAAA6B;SAAAA,MAAA7B,EAAA;GAAnE,MAAA+B,WAAehD,QAAOoC,KAAMU,GAAwC;AAEpE,OAAI,CAAChC,UAAM;AAAE8B,SAAO1C;AAAP,UAAA2C;;GAEb,MAAAI,cAAkB7C,KAAIQ,cAAe,QAAnB,IAAA;AAKlBgC,QAAO1C,KAAIgD,IACJC,OAAiC,CAAA/C,MAChCgD,GAAAC,MAAA;IACJ,MAAAC,SAAeC,gBACbzC,UACAW,UACA2B,EAACI,KACDJ,EAACK,OACDJ,EAACG,KACDH,EAACI,MACF;AAAC,WAEKH,WAAW,IAAIA,SAAS1C,cAAYwC,EAACK,QAASJ,EAACI;KACtD,CAAAP,IACGQ,OAAqB;;AAACzC,IAAA,MAAAQ;AAAAR,IAAA,MAAAjB;AAAAiB,IAAA,MAAAc;AAAAd,IAAA,MAAAf;AAAAe,IAAA,MAAAb;AAAAa,IAAA,MAAA2B;OAAAA,MAAA3B,EAAA;CA1B/B,MAAAT,aAAmBoC;CA2B+B,IAAAE;AAAA,KAAA7B,EAAA,QAAAJ,cAAAI,EAAA,QAAAc,gBAAAd,EAAA,QAAAN,iBAAAM,EAAA,QAAAb,QAAAa,EAAA,QAAAT,cAAAS,EAAA,QAAAR,YAAA;AAK3CqC,OAAA;GAAA1C;GAAAI;GAAAC;GAAAE;GAAAE;GAAAV,MAMC4B;GACP;AAAAd,IAAA,MAAAJ;AAAAI,IAAA,MAAAc;AAAAd,IAAA,MAAAN;AAAAM,IAAA,MAAAb;AAAAa,IAAA,MAAAT;AAAAS,IAAA,MAAAR;AAAAQ,IAAA,MAAA6B;OAAAA,MAAA7B,EAAA;AAAA,QAPM6B;;AA3GF,SAAAY,OAAAC,SAAA;AAAA,QAqGetB,QAAKmB;;AArGpB,SAAAL,OAAAK,KAAAC,OAAA;AAAA,QAwFqB;EAAAD;EAAAC;EAAc;;AAxFnC,SAAA3B,MAAAhB,QAAA;AAAA,QAkB8CA,OAAMD;;AAmG3D,SAAgB0C,gBACdzC,QACAW,UACAqC,MACAC,QACAC,MACAC,QACQ;CACR,MAAMC,SAASxE,eAAeoB,QAAQgD,MAAMC,OAAO;CACnD,MAAMI,SAASzE,eAAeoB,QAAQkD,MAAMC,OAAO;AAEnD,KAAInD,OAAOsD,QAAS,QAAOtD,OAAOsD,QAAQF,QAAQC,QAAQL,MAAME,KAAK;AAIrE,KAAIE,UAAU,QAAQC,UAAU,KAAM,QAAO;AAC7C,KAAID,UAAU,KAAM,QAAO;AAC3B,KAAIC,UAAU,KAAM,QAAO;AAE3B,KAAI,OAAOD,WAAW,YAAY,OAAOC,WAAW,SAClD,QAAOD,SAASC;AAElB,KAAI,OAAOD,WAAW,aAAa,OAAOC,WAAW,UACnD,QAAOE,OAAOH,OAAO,GAAGG,OAAOF,OAAO;AAExC,KAAID,kBAAkBI,QAAQH,kBAAkBG,KAC9C,QAAOJ,OAAOK,SAAS,GAAGJ,OAAOI,SAAS;CAK5C,MAAMC,QAAQ/E,cAAcqB,QAAQgD,MAAMC,OAAO,IAAIU,OAAOP,OAAO;CACnE,MAAMQ,QAAQjF,cAAcqB,QAAQkD,MAAMC,OAAO,IAAIQ,OAAON,OAAO;AAEnE,QAAO1C,SAAS2C,QAAQI,OAAOE,MAAM"}