@progress/kendo-react-treelist 9.4.0-develop.6 → 9.4.0-develop.8

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (48) hide show
  1. package/TreeList.js +1 -1
  2. package/TreeList.mjs +0 -1
  3. package/TreeListNoRecords.js +1 -1
  4. package/TreeListNoRecords.mjs +4 -5
  5. package/TreeListToolbar.js +1 -1
  6. package/TreeListToolbar.mjs +0 -1
  7. package/cells/EditCells/TreeListBooleanEditor.js +1 -1
  8. package/cells/EditCells/TreeListBooleanEditor.mjs +10 -11
  9. package/cells/EditCells/TreeListDateEditor.js +1 -1
  10. package/cells/EditCells/TreeListDateEditor.mjs +8 -9
  11. package/cells/EditCells/TreeListNumericEditor.js +1 -1
  12. package/cells/EditCells/TreeListNumericEditor.mjs +8 -9
  13. package/cells/EditCells/TreeListTextEditor.js +1 -1
  14. package/cells/EditCells/TreeListTextEditor.mjs +3 -4
  15. package/cells/FilterCells/TreeListBooleanFilter.js +1 -1
  16. package/cells/FilterCells/TreeListBooleanFilter.mjs +4 -5
  17. package/cells/FilterCells/TreeListDateFilter.js +1 -1
  18. package/cells/FilterCells/TreeListDateFilter.mjs +8 -9
  19. package/cells/FilterCells/TreeListNumericFilter.js +1 -1
  20. package/cells/FilterCells/TreeListNumericFilter.mjs +3 -4
  21. package/cells/FilterCells/TreeListTextFilter.js +1 -1
  22. package/cells/FilterCells/TreeListTextFilter.mjs +4 -5
  23. package/cells/FilterCells/utils.js +1 -1
  24. package/cells/FilterCells/utils.mjs +6 -7
  25. package/cells/TreeListCell.js +1 -1
  26. package/cells/TreeListCell.mjs +7 -8
  27. package/cells/TreeListSelectionCell.js +1 -1
  28. package/cells/TreeListSelectionCell.mjs +3 -4
  29. package/constants/index.js +1 -1
  30. package/constants/index.mjs +0 -1
  31. package/dist/cdn/js/kendo-react-treelist.js +1 -1
  32. package/header/TreeListHeaderCell.js +1 -1
  33. package/header/TreeListHeaderCell.mjs +2 -3
  34. package/header/TreeListHeaderSelectionCell.js +1 -1
  35. package/header/TreeListHeaderSelectionCell.mjs +0 -1
  36. package/index.js +2 -1
  37. package/index.mjs +12 -12
  38. package/messages/index.js +1 -1
  39. package/messages/index.mjs +5 -6
  40. package/package-metadata.js +1 -1
  41. package/package-metadata.mjs +2 -3
  42. package/package.json +9 -9
  43. package/rows/TreeListDraggableRow.js +1 -1
  44. package/rows/TreeListDraggableRow.mjs +4 -5
  45. package/rows/TreeListRow.js +1 -1
  46. package/rows/TreeListRow.mjs +9 -10
  47. package/utils/index.js +1 -1
  48. package/utils/index.mjs +5 -6
@@ -5,12 +5,11 @@
5
5
  * Licensed under commercial license. See LICENSE.md in the package root for more information
6
6
  *-------------------------------------------------------------------------------------------
7
7
  */
8
- "use client";
9
8
  import * as t from "react";
10
- import { classNames as u } from "@progress/kendo-react-common";
11
- import { TREELIST_ROW_INDEX_ATTRIBUTE as x } from "../constants/index.mjs";
12
- const k = t.forwardRef((e, o) => {
13
- const { isSelected: i, rowHeight: a, isAltRow: r, expanded: l, ariaRowIndex: c, level: d, ariaSetSize: s, ariaPosInSet: m } = e, w = u("k-table-row", "k-master-row", {
9
+ import { classNames as x } from "@progress/kendo-react-common";
10
+ import { TREELIST_ROW_INDEX_ATTRIBUTE as k } from "../constants/index.mjs";
11
+ const u = t.forwardRef((e, o) => {
12
+ const { isSelected: i, rowHeight: a, isAltRow: r, expanded: l, ariaRowIndex: d, level: c, ariaSetSize: s, ariaPosInSet: m } = e, w = x("k-table-row", "k-master-row", {
14
13
  "k-selected": i,
15
14
  "k-alt": r
16
15
  }), R = t.useMemo(
@@ -27,17 +26,17 @@ const k = t.forwardRef((e, o) => {
27
26
  ref: o,
28
27
  "aria-expanded": l,
29
28
  role: "row",
30
- "aria-rowindex": c,
31
- "aria-level": d.length,
29
+ "aria-rowindex": d,
30
+ "aria-level": c.length,
32
31
  "aria-posinset": m,
33
32
  "aria-setsize": s,
34
- [x]: e.rowIndex
33
+ [k]: e.rowIndex
35
34
  },
36
35
  e.children
37
36
  );
38
37
  return /* @__PURE__ */ t.createElement(t.Fragment, null, e.render ? e.render.call(void 0, n, e) : n);
39
38
  });
40
- k.displayName = "KendoReactTreeListRow";
39
+ u.displayName = "KendoReactTreeListRow";
41
40
  export {
42
- k as TreeListRow
41
+ u as TreeListRow
43
42
  };
package/utils/index.js CHANGED
@@ -5,4 +5,4 @@
5
5
  * Licensed under commercial license. See LICENSE.md in the package root for more information
6
6
  *-------------------------------------------------------------------------------------------
7
7
  */
8
- "use client";"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function g(n){return n!==void 0&&(typeof n=="number"||/px$/i.test(String(n)))}function u(n,o,c){const l=Array.from(n.tHead&&n.tHead.rows||[]),i=[o];let r;const h=c||(t=>window.getComputedStyle(t).height||void 0);l.forEach(t=>{const e=h(t);i.push(g(e)?parseFloat(String(e)):t.offsetHeight)});for(let t=0;t<l.length;t++)r=i.slice(0,t+1).reduce((e,s)=>e+s),Array.from(l[t].cells).forEach(e=>e.style.top=r+"px")}const a=1e6;function d(n){const{rows:o,tableViewPortHeight:c,scrollTop:l}=n;if(o.length===0)return[];const i=o[0].height,r=Math.min(Math.round(l/i),o.length),h=Math.round(c/i),t=Math.max(0,r-h),e=Math.min(o.length,r+2*h),s=o.slice(t,e),f=s[s.length-1];return t>0&&s.unshift({dataItem:{},level:[a],offsetTop:0,height:s[0].offsetTop,levelCount:0}),e<o.length-1&&s.push({dataItem:{},level:[a,a],offsetTop:f.offsetTop+f.height,height:(o.length-e)*i,levelCount:0}),s}exports.setHeaderRowsTop=u;exports.tableRowsVirtualization=d;
8
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function g(n){return n!==void 0&&(typeof n=="number"||/px$/i.test(String(n)))}function u(n,o,a){const r=Array.from(n.tHead&&n.tHead.rows||[]),i=[o];let h;const l=a||(t=>window.getComputedStyle(t).height||void 0);r.forEach(t=>{const e=l(t);i.push(g(e)?parseFloat(String(e)):t.offsetHeight)});for(let t=0;t<r.length;t++)h=i.slice(0,t+1).reduce((e,s)=>e+s),Array.from(r[t].cells).forEach(e=>e.style.top=h+"px")}const c=1e6;function d(n){const{rows:o,tableViewPortHeight:a,scrollTop:r}=n;if(o.length===0)return[];const i=o[0].height,h=Math.min(Math.round(r/i),o.length),l=Math.round(a/i),t=Math.max(0,h-l),e=Math.min(o.length,h+2*l),s=o.slice(t,e),f=s[s.length-1];return t>0&&s.unshift({dataItem:{},level:[c],offsetTop:0,height:s[0].offsetTop,levelCount:0}),e<o.length-1&&s.push({dataItem:{},level:[c,c],offsetTop:f.offsetTop+f.height,height:(o.length-e)*i,levelCount:0}),s}exports.setHeaderRowsTop=u;exports.tableRowsVirtualization=d;
package/utils/index.mjs CHANGED
@@ -5,27 +5,26 @@
5
5
  * Licensed under commercial license. See LICENSE.md in the package root for more information
6
6
  *-------------------------------------------------------------------------------------------
7
7
  */
8
- "use client";
9
8
  function g(n) {
10
9
  return n !== void 0 && (typeof n == "number" || /px$/i.test(String(n)));
11
10
  }
12
11
  function u(n, o, c) {
13
12
  const h = Array.from(n.tHead && n.tHead.rows || []), i = [o];
14
- let l;
15
- const r = c || ((t) => window.getComputedStyle(t).height || void 0);
13
+ let r;
14
+ const l = c || ((t) => window.getComputedStyle(t).height || void 0);
16
15
  h.forEach((t) => {
17
- const e = r(t);
16
+ const e = l(t);
18
17
  i.push(g(e) ? parseFloat(String(e)) : t.offsetHeight);
19
18
  });
20
19
  for (let t = 0; t < h.length; t++)
21
- l = i.slice(0, t + 1).reduce((e, s) => e + s), Array.from(h[t].cells).forEach((e) => e.style.top = l + "px");
20
+ r = i.slice(0, t + 1).reduce((e, s) => e + s), Array.from(h[t].cells).forEach((e) => e.style.top = r + "px");
22
21
  }
23
22
  const a = 1e6;
24
23
  function p(n) {
25
24
  const { rows: o, tableViewPortHeight: c, scrollTop: h } = n;
26
25
  if (o.length === 0)
27
26
  return [];
28
- const i = o[0].height, l = Math.min(Math.round(h / i), o.length), r = Math.round(c / i), t = Math.max(0, l - r), e = Math.min(o.length, l + 2 * r), s = o.slice(t, e), f = s[s.length - 1];
27
+ const i = o[0].height, r = Math.min(Math.round(h / i), o.length), l = Math.round(c / i), t = Math.max(0, r - l), e = Math.min(o.length, r + 2 * l), s = o.slice(t, e), f = s[s.length - 1];
29
28
  return t > 0 && s.unshift({
30
29
  dataItem: {},
31
30
  level: [a],