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

package/utils/data-operations.mjs

@@ -5,48 +5,47 @@
  * Licensed under commercial license. See LICENSE.md in the package root for more information
  *-------------------------------------------------------------------------------------------
  */
-"use client";
-import { orderBy as s, filterBy as D } from "@progress/kendo-data-query";
-import { extendDataItem as y, mapTree as v, getItemPath as P, getNestedValue as g } from "@progress/kendo-react-common";
-function i(r, n, t) {
-  return t ? { ...r, [n]: t.length ? [...t] : void 0 } : r && r[n] ? [...r[n]] : [];
+import { orderBy as v, filterBy as s } from "@progress/kendo-data-query";
+import { extendDataItem as y, mapTree as C, getItemPath as P, getNestedValue as g } from "@progress/kendo-react-common";
+function i(t, n, r) {
+  return r ? { ...t, [n]: r.length ? [...r] : void 0 } : t && t[n] ? [...t[n]] : [];
 }
-function C(r, n, t) {
-  if (r[t]) {
-    const o = i(r, t, s(i(r, t), n)), e = i(o, t).map((c) => C(c, n, t));
-    return { ...o, [t]: e };
+function B(t, n, r) {
+  if (t[r]) {
+    const o = i(t, r, v(i(t, r), n)), e = i(o, r).map((c) => B(c, n, r));
+    return { ...o, [r]: e };
   }
-  return r;
+  return t;
 }
-function $(r, n, t) {
-  let o = s(r, n);
-  return o = o.map((e) => C(e, n, t)), o;
+function E(t, n, r) {
+  let o = v(t, n);
+  return o = o.map((e) => B(e, n, r)), o;
 }
-function B(r, n, t) {
-  let o = i(r, t);
+function x(t, n, r) {
+  let o = i(t, r);
   if (o && o.length) {
-    o = o.map((h) => B(h, n, t));
-    const a = D(o, {
-      filters: [{ filters: n, logic: "and" }, { operator: (h) => !!(h[t] || []).length }],
+    o = o.map((a) => x(a, n, r));
+    const l = s(o, {
+      filters: [{ filters: n, logic: "and" }, { operator: (a) => !!(a[r] || []).length }],
       logic: "or"
     });
-    return i(r, t, a);
+    return i(t, r, l);
   }
-  return r;
+  return t;
 }
-function k(r, n, t) {
-  let o = { [t]: [...r] };
-  return o = B(o, n, t), o[t] || [];
+function $(t, n, r) {
+  let o = { [r]: [...t] };
+  return o = x(o, n, r), o[r] || [];
 }
-function N(r, n, t) {
+function k(t, n, r) {
   const o = [], e = [];
-  for (let c = r.length - 1; c >= 0; c--) {
-    const a = r[c];
+  for (let c = t.length - 1; c >= 0; c--) {
+    const l = t[c];
     o.push({
-      root: a,
-      data: n(a),
+      root: l,
+      data: n(l),
       level: [c],
-      levelCount: r.length
+      levelCount: t.length
     });
   }
   for (; o.length > 0; ) {
@@ -54,70 +53,86 @@ function N(r, n, t) {
     if (e.push({
       dataItem: c.root,
       level: [...c.level],
-      ...t(c.root),
+      ...r(c.root),
       levelCount: c.levelCount
     }), c.data.length)
-      for (let a = c.data.length - 1; a >= 0; a--) {
-        const h = c.data[a];
+      for (let l = c.data.length - 1; l >= 0; l--) {
+        const a = c.data[l];
         o.push({
-          root: h,
-          data: n(h),
-          level: [...c.level, a],
+          root: a,
+          data: n(a),
+          level: [...c.level, l],
           levelCount: c.data.length
         });
       }
   }
   return e;
 }
-const S = (r, n, t) => {
-  const o = (l) => !!g(n, l), e = (l) => !!g(t, l), c = (l) => {
+const N = (t, n, r) => {
+  const o = (h) => !!g(n, h), e = (h) => !!g(r, h), c = (h) => {
     const f = [];
-    return o(l) && e(l) && f.push(...g(t, l)), f;
-  }, a = (l, f, p) => {
-    f.push({ ...l, level: p }), c(l).forEach((x) => a(x, f, p + 1));
-  }, h = [];
-  return r.forEach((l) => a(l, h, 0)), h;
-}, V = (r, n, t, o) => {
-  let e = {}, c = [], a;
-  return r.forEach((h) => e[n(h)] = { ...h }), r.forEach((h) => {
-    a = e[t(h)], a ? (a[o] = a[o] || [], a[o].push(e[n(h)])) : c.push(e[n(h)]);
+    return o(h) && e(h) && f.push(...g(r, h)), f;
+  }, l = (h, f, p) => {
+    f.push({ ...h, level: p }), c(h).forEach((D) => l(D, f, p + 1));
+  }, a = [];
+  return t.forEach((h) => l(h, a, 0)), a;
+}, V = (t, n, r, o) => {
+  let e = {}, c = [], l;
+  return t.forEach((a) => e[n(a)] = { ...a }), t.forEach((a) => {
+    l = e[r(a)], l ? (l[o] = l[o] || [], l[o].push(e[n(a)])) : c.push(e[n(a)]);
   }), c;
-}, j = (r, n, t) => y(r, n, t), q = (r, n, t) => [...v(
-  [{ [n]: [...r] }],
+}, j = (t, n, r) => y(t, n, r), q = (t, n, r) => [...C(
+  [{ [n]: [...t] }],
   n,
-  (e) => T(e, t, n)
-)[0][n]], T = (r, n, t) => {
-  const o = r[t] || [], e = o.findIndex(n);
+  (e) => T(e, r, n)
+)[0][n]], T = (t, n, r) => {
+  const o = t[r] || [], e = o.findIndex(n);
   if (e !== -1) {
     const c = [...o];
     return c.splice(e, 1), {
-      ...r,
-      [t]: c
+      ...t,
+      [r]: c
     };
   }
-  return r;
-}, z = (r, n, t, o) => v(
-  r,
+  return t;
+}, z = (t, n, r, o) => C(
+  t,
   n,
-  (e) => t(e) ? { ...e, [n]: o(e[n] || []) } : e
-), u = (r, n, t) => P(r, n, t), A = (r, n, t, o) => {
-  const e = [...r], c = u(e, n, o), a = c.pop(), h = c.pop(), l = n[n.length - 1];
-  if (t) {
-    const p = u(e, t, o).pop();
-    (h ? h[o] : e).splice(l, 1), p[o] = p[o] || [], p[o].push(a);
+  (e) => r(e) ? { ...e, [n]: o(e[n] || []) } : e
+), u = (t, n, r) => P(t, n, r), A = (t, n, r, o) => {
+  const e = [...t], c = u(e, n, o), l = c.pop(), a = c.pop(), h = n[n.length - 1];
+  if (r) {
+    const p = u(e, r, o).pop();
+    (a ? a[o] : e).splice(h, 1), p[o] = p[o] || [], p[o].push(l);
   } else
-    (h ? h[o] : e).splice(l, 1), e.push(a);
+    (a ? a[o] : e).splice(h, 1), e.push(l);
   return e;
+}, G = (t, n) => ({
+  ...t,
+  filters: t.filters.map((r) => ({ ...r, value: n }))
+}), H = (t) => t != null && t.filters.length && t.filters[0].value || "", J = (t, n) => {
+  if (n && !t)
+    return n;
+  if (t && !n)
+    return t;
+  if (t && n)
+    return {
+      logic: "and",
+      filters: [t, n]
+    };
 };
 export {
+  J as combineFilters,
   V as createDataTree,
   j as extendDataItem,
-  k as filterBy,
-  N as flatData,
+  $ as filterBy,
+  k as flatData,
   u as getItemPath,
+  G as getSearchFromString,
+  H as getStringFromSearch,
   z as modifySubItems,
   A as moveTreeItem,
-  $ as orderBy,
+  E as orderBy,
   q as removeItems,
-  S as treeToFlat
+  N as treeToFlat
 };

package/utils/group-operations.js

@@ -5,4 +5,4 @@
  * 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 a=require("@progress/kendo-react-common"),d="groupId",n="items",r=(e,t,s)=>{e.items&&(e[d]=`${s}${s&&"_"}${e.value}${e.field}`,t>1&&e.items.forEach(o=>r(o,t-1,e[d])))},c=e=>{const{group:t}=e;if(t&&t.length&&e.data)return e.data.forEach(s=>r(s,t.length,""))},I=e=>{const t=[];return a.mapTree(e.data,n,s=>{s[d]&&t.push(s[d])}),t},u=e=>a.mapTree(e.data,n,t=>a.extendDataItem(t,n,{expanded:!e.collapsedIds.some(s=>s===t[d])}));exports.getGroupIds=I;exports.setExpandedState=u;exports.setGroupIds=c;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("@progress/kendo-react-common"),d="groupId",n="items",r=(e,t,s)=>{e.items&&(e[d]=`${s}${s&&"_"}${e.value}${e.field}`,t>1&&e.items.forEach(o=>r(o,t-1,e[d])))},c=e=>{const{group:t}=e;if(t&&t.length&&e.data)return e.data.forEach(s=>r(s,t.length,""))},I=e=>{const t=[];return a.mapTree(e.data,n,s=>{s[d]&&t.push(s[d])}),t},u=e=>a.mapTree(e.data,n,t=>a.extendDataItem(t,n,{expanded:!e.collapsedIds.some(s=>s===t[d])}));exports.getGroupIds=I;exports.setExpandedState=u;exports.setGroupIds=c;

package/utils/group-operations.mjs

@@ -5,20 +5,19 @@
  * Licensed under commercial license. See LICENSE.md in the package root for more information
  *-------------------------------------------------------------------------------------------
  */
-"use client";
 import { mapTree as n, extendDataItem as I } from "@progress/kendo-react-common";
-const a = "groupId", d = "items", c = (t, e, s) => {
-  t.items && (t[a] = `${s}${s && "_"}${t.value}${t.field}`, e > 1 && t.items.forEach((r) => c(r, e - 1, t[a])));
+const a = "groupId", d = "items", r = (t, e, s) => {
+  t.items && (t[a] = `${s}${s && "_"}${t.value}${t.field}`, e > 1 && t.items.forEach((c) => r(c, e - 1, t[a])));
 }, f = (t) => {
   const { group: e } = t;
   if (e && e.length && t.data)
-    return t.data.forEach((s) => c(s, e.length, ""));
-}, l = (t) => {
+    return t.data.forEach((s) => r(s, e.length, ""));
+}, m = (t) => {
   const e = [];
   return n(t.data, d, (s) => {
     s[a] && e.push(s[a]);
   }), e;
-}, m = (t) => n(
+}, E = (t) => n(
   t.data,
   d,
   (e) => I(e, d, {
@@ -26,7 +25,7 @@ const a = "groupId", d = "items", c = (t, e, s) => {
   })
 );
 export {
-  l as getGroupIds,
-  m as setExpandedState,
+  m as getGroupIds,
+  E as setExpandedState,
   f as setGroupIds
 };

package/virtualization/columns.js

@@ -5,4 +5,4 @@
  * 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"});function k(b){const{enabled:S,columns:l=[],tableViewPortWidth:w,scrollLeft:g,getColSpan:m,dataItem:C}=b,h=l.map(()=>1),i=l.map(()=>!1);if(!S)return{colSpans:h,hiddenColumns:i};const n=l.map(e=>parseFloat((e.width||"").toString())||10);let o=0;for(let e=0;e<l.length;e++){if(l[e].locked)continue;let c=1;if(m!==void 0){let r=m(l[e],C);r>2?c=r-1:r===2&&(c=r)}const O=e<n.length-1?n[e+1]*c:0;if(o+n[e]+O<g)i[e]=!0,o+=n[e];else break}const y=n.reduce((e,c)=>e+c,0);o=0;for(let e=l.length-1;e>=0;e--)if(!l[e].locked)if(o+2*n[e]<y-w-g)i[e]=!0,o+=n[e];else break;const t=[...i],f=e=>e;let s=t.lastIndexOf(!1),p=t.some(f),u=t.every(f),a,d;for(;p&&t.length&&(s!==-1||u);){for(s<t.length-1&&(a=u?t.length:t.length-s-1,d=t.length-a,d===0&&(d=a-1),i[d]=!1,h[d]=a,t.splice(s+1,a));t.length&&!t[t.length-1];)t.pop();s=t.lastIndexOf(!1),p=t.some(f),u=t.every(f)}return{colSpans:h,hiddenColumns:i}}exports.tableColumnsVirtualization=k;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function k(b){const{enabled:S,columns:l=[],tableViewPortWidth:w,scrollLeft:g,getColSpan:m,dataItem:C}=b,h=l.map(()=>1),i=l.map(()=>!1);if(!S)return{colSpans:h,hiddenColumns:i};const n=l.map(e=>parseFloat((e.width||"").toString())||10);let o=0;for(let e=0;e<l.length;e++){if(l[e].locked)continue;let f=1;if(m!==void 0){let c=m(l[e],C);c>2?f=c-1:c===2&&(f=c)}const O=e<n.length-1?n[e+1]*f:0;if(o+n[e]+O<g)i[e]=!0,o+=n[e];else break}const y=n.reduce((e,f)=>e+f,0);o=0;for(let e=l.length-1;e>=0;e--)if(!l[e].locked)if(o+2*n[e]<y-w-g)i[e]=!0,o+=n[e];else break;const t=[...i],r=e=>e;let s=t.lastIndexOf(!1),p=t.some(r),u=t.every(r),a,d;for(;p&&t.length&&(s!==-1||u);){for(s<t.length-1&&(a=u?t.length:t.length-s-1,d=t.length-a,d===0&&(d=a-1),i[d]=!1,h[d]=a,t.splice(s+1,a));t.length&&!t[t.length-1];)t.pop();s=t.lastIndexOf(!1),p=t.some(r),u=t.every(r)}return{colSpans:h,hiddenColumns:i}}exports.tableColumnsVirtualization=k;

package/virtualization/columns.mjs

@@ -5,7 +5,6 @@
  * Licensed under commercial license. See LICENSE.md in the package root for more information
  *-------------------------------------------------------------------------------------------
  */
-"use client";
 function I(b) {
   const { enabled: w, columns: l = [], tableViewPortWidth: x, scrollLeft: g, getColSpan: p, dataItem: C } = b, r = l.map(() => 1), i = l.map(() => !1);
   if (!w)
@@ -17,8 +16,8 @@ function I(b) {
       continue;
     let f = 1;
     if (p !== void 0) {
-      let h = p(l[e], C);
-      h > 2 ? f = h - 1 : h === 2 && (f = h);
+      let c = p(l[e], C);
+      c > 2 ? f = c - 1 : c === 2 && (f = c);
     }
     const k = e < n.length - 1 ? n[e + 1] * f : 0;
     if (o + n[e] + k < g)
@@ -34,12 +33,12 @@ function I(b) {
         i[e] = !0, o += n[e];
       else
         break;
-  const t = [...i], c = (e) => e;
-  let s = t.lastIndexOf(!1), m = t.some(c), u = t.every(c), d, a;
+  const t = [...i], h = (e) => e;
+  let s = t.lastIndexOf(!1), m = t.some(h), u = t.every(h), d, a;
   for (; m && t.length && (s !== -1 || u); ) {
     for (s < t.length - 1 && (d = u ? t.length : t.length - s - 1, a = t.length - d, a === 0 && (a = d - 1), i[a] = !1, r[a] = d, t.splice(s + 1, d)); t.length && !t[t.length - 1]; )
       t.pop();
-    s = t.lastIndexOf(!1), m = t.some(c), u = t.every(c);
+    s = t.lastIndexOf(!1), m = t.some(h), u = t.every(h);
   }
   return { colSpans: r, hiddenColumns: i };
 }