@progress/kendo-react-grid 9.4.0-develop.2 → 9.4.0-develop.21

package/utils/index.mjs

@@ -5,161 +5,160 @@
  * Licensed under commercial license. See LICENSE.md in the package root for more information
  *-------------------------------------------------------------------------------------------
  */
-"use client";
-import { gridDefaultProps as v } from "../GridColumn.mjs";
-import { getter as u } from "@progress/kendo-data-query";
-import { findGroupExpand as M, updateLeft as T, updateRight as A, tableKeyboardNavigationTools as b } from "@progress/kendo-react-data-tools";
-import { ServerFragment as D } from "./_serverModule.mjs";
+import { gridDefaultProps as w } from "../GridColumn.mjs";
+import { getter as y } from "@progress/kendo-data-query";
+import { findGroupExpand as M, updateLeft as A, updateRight as D, tableKeyboardNavigationTools as b } from "@progress/kendo-react-data-tools";
+import { ServerFragment as T } from "./_serverModule.mjs";
 import { ClientFragment as B } from "./_clientModule.mjs";
-import { GridContextMenuItemNames as x } from "../contextMenu/enums.mjs";
-function y(e, t) {
+import { GridContextMenuItemNames as g } from "../contextMenu/enums.mjs";
+function u(e, t) {
   const a = (e != null ? e : "").split(".");
-  let l = t;
-  return a.forEach((o) => {
-    l = l ? l[o] : void 0;
-  }), l;
+  let i = t;
+  return a.forEach((l) => {
+    i = i ? i[l] : void 0;
+  }), i;
 }
-function k(e, t, a, l, o, f, r, n, i, d, h = 0, c) {
-  var w;
-  let S = h;
-  for (let s = 0; s < t.length; s++) {
-    let C;
-    if (!o || t[s].value === void 0 || t[s].items === void 0) {
+function E(e, t, a, i, l, f, r, n, d, o, h = 0, s) {
+  var v;
+  let C = h;
+  for (let c = 0; c < t.length; c++) {
+    let S;
+    if (!l || t[c].value === void 0 || t[c].items === void 0) {
       e[e.length] = {
-        dataIndex: l.index,
-        dataItem: t[s],
+        dataIndex: i.index,
+        dataItem: t[c],
         rowType: "data",
         level: h,
-        group: c,
+        group: s,
         // This is related to detail-row expansion
-        expanded: (w = f ? y(f, t[s]) : d && !!(r != null && r[u(d)(t[s])])) != null ? w : !1
-      }, l.index++;
+        expanded: (v = f ? u(f, t[c]) : o && !!(r != null && r[y(o)(t[c])])) != null ? v : !1
+      }, i.index++;
       continue;
     } else {
       let I;
-      c != null && c.parents ? I = [{ field: c.field, value: c.value }, ...c.parents] : c ? I = [c] : I = [], C = {
-        field: t[s].field,
-        value: t[s].value,
+      s != null && s.parents ? I = [{ field: s.field, value: s.value }, ...s.parents] : s ? I = [s] : I = [], S = {
+        field: t[c].field,
+        value: t[c].value,
         parents: I
       };
     }
-    S = Math.max(S, h + 1);
-    let g = !1;
+    C = Math.max(C, h + 1);
+    let x = !1;
     if (f)
-      g = y(f, t[s]) !== !1;
+      x = u(f, t[c]) !== !1;
     else {
-      const I = M(n || [], C);
-      I ? g = I.expanded !== !1 : g = i !== !1;
+      const I = M(n || [], S);
+      I ? x = I.expanded !== !1 : x = d !== !1;
     }
     e[e.length] = {
       dataIndex: -1,
-      dataItem: t[s],
+      dataItem: t[c],
       level: h,
-      group: C,
+      group: S,
       rowType: "groupHeader",
-      expanded: g
-    }, g && (C.expanded = g, S = Math.max(
-      k(
+      expanded: x
+    }, x && (S.expanded = x, C = Math.max(
+      E(
         e,
-        t[s].items,
+        t[c].items,
         a,
+        i,
         l,
-        o,
         f,
         r,
         n,
-        i,
         d,
+        o,
         h + 1,
-        C
+        S
       ),
-      S
-    )), (a === "always" || g && a === "visible") && (e[e.length] = {
+      C
+    )), (a === "always" || x && a === "visible") && (e[e.length] = {
       dataIndex: -1,
-      dataItem: t[s],
+      dataItem: t[c],
       rowType: "groupFooter",
       level: h,
-      expanded: g
+      expanded: x
     });
   }
-  return S;
+  return C;
 }
-const L = (e, t) => typeof e.colSpan == "function" ? e.colSpan({ dataItem: t, column: e }) : e.colSpan || 1;
-function q(e, t) {
+const q = (e, t) => typeof e.colSpan == "function" ? e.colSpan({ dataItem: t, column: e }) : e.colSpan || 1;
+function z(e, t) {
   const a = [[]];
-  let l = 0;
+  let i = 0;
   for (let r = e.length - 1; r >= 0; r--)
-    l = Math.max(l, e[r].depth), e[r].headerColSpan = e[r].headerColSpan || 1, e[r].children.length > 0 && (e[r].headerColSpan = e[r].children.reduce(
-      (n, i) => i.hidden ? n : n + i.headerColSpan,
+    i = Math.max(i, e[r].depth), e[r].headerColSpan = e[r].headerColSpan || 1, e[r].children.length > 0 && (e[r].headerColSpan = e[r].children.reduce(
+      (n, d) => d.hidden ? n : n + d.headerColSpan,
       0
     ));
-  const o = [];
+  const l = [];
   let f = 1;
   return e.forEach((r, n) => {
     a[r.depth] = a[r.depth] || [];
-    let i = !1;
-    a[r.depth].length === 0 && (f <= 1 ? f = 1 + (r.children.length > 0 ? 0 : l - r.depth) : (f--, i = !0)), r.rowSpan = 1 + (r.children.length > 0 ? 0 : l - r.depth), r.kFirst = i, r.index = a[r.depth].length, a[r.depth].push(n), r.ariaColumnIndex = o[r.depth] ? o[r.depth] + 1 : 1;
-    for (let d = r.depth; d < r.depth + r.rowSpan; d++)
-      o[d] = (o[d] || 0) + r.headerColSpan;
-  }), T(a, e, t), A(a, e, t), a;
+    let d = !1;
+    a[r.depth].length === 0 && (f <= 1 ? f = 1 + (r.children.length > 0 ? 0 : i - r.depth) : (f--, d = !0)), r.rowSpan = 1 + (r.children.length > 0 ? 0 : i - r.depth), r.kFirst = d, r.index = a[r.depth].length, a[r.depth].push(n), r.ariaColumnIndex = l[r.depth] ? l[r.depth] + 1 : 1;
+    for (let o = r.depth; o < r.depth + r.rowSpan; o++)
+      l[o] = (l[o] || 0) + r.headerColSpan;
+  }), A(a, e, t), D(a, e, t), a;
 }
-function p(e, t, a, l = 0) {
-  const o = [];
+function j(e, t, a, i = 0) {
+  const l = [];
   if (!e)
     return [];
-  e && e.length === void 0 && (e = [e]), e.filter((n) => n && n.props ? !n.props.hidden : !n.hidden).forEach((n, i) => {
+  e && e.length === void 0 && (e = [e]), e.filter((n) => n && n.props ? !n.props.hidden : !n.hidden).forEach((n, d) => {
     n = n.props ? n.props : n;
-    const d = t[i] || null, h = p(
+    const o = t[d] || null, h = j(
       n.children,
-      d && d.children || [],
+      o && o.children || [],
       a,
-      l + 1
+      i + 1
     );
-    o.push(
+    l.push(
       Object.assign(
-        { depth: l },
-        v,
+        { depth: i },
+        w,
         h.length ? { cell: () => null, filterCell: () => null } : {},
-        d ? { width: d.width, orderIndex: d.orderIndex } : {},
+        o ? { width: o.width, orderIndex: o.orderIndex } : {},
         n,
         {
           id: n.id ? n.id : b.generateNavigatableId(`${a.prevId++}`, a.idPrefix, "column"),
-          declarationIndex: o.length,
+          declarationIndex: l.length,
           children: h,
           headerColSpan: n.headerColSpan,
           rowSpan: 0,
           columnType: n.columnType || "data",
           colSpan: n.colSpan || 1,
           isAccessible: !0,
-          left: n.lockedColumn ? d && Math.floor(d.left) : null,
-          right: n.lockedColumn ? d && Math.floor(d.right) : null
+          left: n.lockedColumn ? o && Math.floor(o.left) : null,
+          right: n.lockedColumn ? o && Math.floor(o.right) : null,
+          rowSpannable: n.rowSpannable
         }
       )
     );
   });
-  const r = (n, i) => n.orderIndex === i.orderIndex ? n.declarationIndex - i.declarationIndex : (n.orderIndex || 0) - (i.orderIndex || 0);
-  if (o.sort(r), l === 0) {
-    const n = [], i = (d, h) => d.forEach((c) => {
-      c.parentIndex = h, i(c.children, n.push(c) - 1);
+  const r = (n, d) => n.orderIndex === d.orderIndex ? n.declarationIndex - d.declarationIndex : (n.orderIndex || 0) - (d.orderIndex || 0);
+  if (l.sort(r), i === 0) {
+    const n = [], d = (o, h) => o.forEach((s) => {
+      s.parentIndex = h, d(s.children, n.push(s) - 1);
     });
-    return i(o, -1), n;
+    return d(l, -1), n;
   }
-  return o;
+  return l;
 }
-function z(e, t, a, l) {
-  let o = [];
-  Array.isArray(e) ? o = e : e && (o = e.data);
-  const f = [];
-  if (o.length > 0) {
-    let r = o[0];
+const k = (e) => Array.isArray(e) ? e : e ? e.data : [];
+function V(e, t, a, i) {
+  const l = k(e), f = [];
+  if (l.length > 0) {
+    let r = l[0];
     if (t)
-      for (let i = 0; i < t.length; i++)
+      for (let d = 0; d < t.length; d++)
         r = r.items && r.items[0];
-    Object.getOwnPropertyNames(r).forEach((i) => {
-      i !== a.column && f.push(
+    Object.getOwnPropertyNames(r).forEach((d) => {
+      d !== a.column && f.push(
         Object.assign(
           {
-            id: b.generateNavigatableId(`${l.prevId++}`, l.idPrefix, "column"),
+            id: b.generateNavigatableId(`${i.prevId++}`, i.idPrefix, "column"),
             declarationIndex: -1,
             parentIndex: -1,
             depth: 0,
@@ -175,15 +174,15 @@ function z(e, t, a, l) {
             ariaColumnIndex: 0,
             isAccessible: !0
           },
-          v,
-          { field: i }
+          w,
+          { field: d }
         )
       );
     });
   }
   return f;
 }
-const E = (e, t) => {
+const F = (e, t) => {
   let a = e[t.parentIndex];
   for (; a; ) {
     if (a.footerCell)
@@ -191,33 +190,33 @@ const E = (e, t) => {
     a = e[a.parentIndex];
   }
   return !1;
-}, V = (e) => e.filter((t) => E(e, t) ? !1 : !!t.footerCell || !(t.children && t.children.length > 0)), W = (e) => e.width !== void 0 ? Math.floor(parseFloat(e.width.toString())) + "px" : void 0, J = (e, t) => t && t.filter((a) => a.field === e).length > 0, F = (e) => (e.sort((t, a) => t.declarationIndex - a.declarationIndex), e.map((t) => {
-  const { declarationIndex: a, parentIndex: l, depth: o, headerColSpan: f, rowSpan: r, index: n, kFirst: i, children: d, ...h } = t;
-  return d.length ? {
-    children: F(d),
+}, W = (e) => e.filter((t) => F(e, t) ? !1 : !!t.footerCell || !(t.children && t.children.length > 0)), J = (e) => e.width !== void 0 ? Math.floor(parseFloat(e.width.toString())) + "px" : void 0, K = (e, t) => t && t.filter((a) => a.field === e).length > 0, p = (e) => (e.sort((t, a) => t.declarationIndex - a.declarationIndex), e.map((t) => {
+  const { declarationIndex: a, parentIndex: i, depth: l, headerColSpan: f, rowSpan: r, index: n, kFirst: d, children: o, ...h } = t;
+  return o.length ? {
+    children: p(o),
     ...h
   } : h;
-})), m = (e) => {
-  const { filterCell: t, headerCell: a, footerCell: l, cells: o, cell: f, ...r } = e;
+})), N = (e) => {
+  const { filterCell: t, headerCell: a, footerCell: i, cells: l, cell: f, rowSpannable: r, ...n } = e;
   return e.children.length ? {
-    ...r,
-    children: e.children.map(m)
-  } : r;
-}, K = typeof window != "undefined" && /Firefox/.test(window.navigator.userAgent), Q = 17895697, U = (e) => {
+    ...n,
+    children: e.children.map(N)
+  } : n;
+}, Q = typeof window != "undefined" && /Firefox/.test(window.navigator.userAgent), U = 17895697, X = (e) => {
   let t = [];
-  return e.sortable && (t = t.concat([x.sortAsc, x.sortDesc])), t;
-}, X = (e) => {
+  return e.sortable && (t = t.concat([g.sortAsc, g.sortDesc])), t;
+}, Y = (e) => {
   let t = [];
   return e.clipboard && (t = t.concat([
-    x.copySelection,
-    x.copySelectionNoHeaders,
-    x.paste
-  ])), e.editable && (t.length && (t = t.concat([x.separator])), t = t.concat([
-    x.create,
-    x.edit,
-    x.delete
-  ])), e.selectable && (t.length && (t = t.concat([x.separator])), t = t.concat([x.select])), e.reorderable && (t.length && (t = t.concat([x.separator])), t = t.concat([x.reorderRow])), t;
-}, Y = (e, t) => {
+    g.copySelection,
+    g.copySelectionNoHeaders,
+    g.paste
+  ])), e.editable && (t.length && (t = t.concat([g.separator])), t = t.concat([
+    g.create,
+    g.edit,
+    g.delete
+  ])), e.selectable && (t.length && (t = t.concat([g.separator])), t = t.concat([g.select])), e.rowReorderable && (t.length && (t = t.concat([g.separator])), t = t.concat([g.reorderRow])), t;
+}, Z = (e, t) => {
   if (!(!e && !t))
     return t ? e ? {
       ...e,
@@ -239,7 +238,10 @@ const E = (e, t) => {
         ...t.edit || {}
       }
     } : t : e;
-}, Z = () => D === B, _ = (e) => !!(e && e.$$typeof === Symbol.for("react.client.reference")), P = (e) => ({
+}, _ = (e) => {
+  var a;
+  return typeof e == "object" ? (a = e.enabled) != null ? a : !0 : e != null ? e : !1;
+}, G = () => T === B, P = (e) => !!(e && e.$$typeof === Symbol.for("react.client.reference")), ee = (e) => ({
   id: e.id,
   ariaColumnIndex: e.ariaColumnIndex,
   isSelected: e.isSelected,
@@ -265,25 +267,32 @@ const E = (e, t) => {
   rowDataIndex: e.rowDataIndex,
   columnPosition: e.columnPosition,
   group: e.group
-});
+}), te = (e) => {
+  var i, l;
+  const t = typeof e == "object" ? (i = e.enabled) != null ? i : !0 : e != null ? e : !1, a = typeof e == "object" ? (l = e.valueGetter) != null ? l : (f, r) => y(r)(f) : (f, r) => y(r)(f);
+  return { enabled: t, valueGetter: a };
+};
 export {
-  z as autoGenerateColumns,
-  m as clientColumn,
-  K as firefox,
-  Q as firefoxMaxHeight,
-  k as flatData,
-  V as footerColumns,
-  P as getClientCellProps,
-  L as getColSpan,
-  W as getColumnWidth,
-  X as getDefaultBodyContextMenuItems,
-  U as getDefaultHeadContextMenuItems,
-  y as getNestedValue,
-  Z as isClient,
-  _ as isClientReference,
-  J as isSorted,
-  q as mapColumns,
-  p as readColumns,
-  Y as resolveCells,
-  F as sanitizeColumns
+  V as autoGenerateColumns,
+  N as clientColumn,
+  Q as firefox,
+  U as firefoxMaxHeight,
+  E as flatData,
+  W as footerColumns,
+  ee as getClientCellProps,
+  q as getColSpan,
+  J as getColumnWidth,
+  k as getDataAsArray,
+  Y as getDefaultBodyContextMenuItems,
+  X as getDefaultHeadContextMenuItems,
+  u as getNestedValue,
+  te as getRowSpanOptions,
+  G as isClient,
+  P as isClientReference,
+  _ as isRowReorderEnabled,
+  K as isSorted,
+  z as mapColumns,
+  j as readColumns,
+  Z as resolveCells,
+  p as sanitizeColumns
 };

package/interfaces/GridSortSettings.js

@@ -1,8 +0,0 @@
-/**
- * @license
- *-------------------------------------------------------------------------------------------
- * Copyright © 2025 Progress Software Corporation. All rights reserved.
- * Licensed under commercial license. See LICENSE.md in the package root for more information
- *-------------------------------------------------------------------------------------------
- */
-"use client";"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=(...s)=>Object.assign({allowUnsort:!0,mode:"single"},...s),c={true:{asc:{asc:"",desc:"desc"},desc:{asc:"asc",desc:""},"":{asc:"asc",desc:"desc"}},false:{asc:{asc:"asc",desc:"desc"},desc:{asc:"asc",desc:"desc"},"":{asc:"asc",desc:"desc"}}},a={true:{asc:"desc",desc:"","":"asc"},false:{asc:"desc",desc:"asc","":"asc"}};exports.firstLevelSortSeqMap=a;exports.normalize=e;exports.sortSeqMap=c;