@progress/kendo-vue-treeview 5.3.0-dev.202409130647 → 5.3.0-develop.1

package/handleTreeViewCheckChange.js

@@ -0,0 +1,8 @@
+/**
+ * @license
+ *-------------------------------------------------------------------------------------------
+ * Copyright © 2024 Progress Software Corporation. All rights reserved.
+ * Licensed under commercial license. See LICENSE.md in the package root for more information
+ *-------------------------------------------------------------------------------------------
+ */
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const g=require("./utils/itemUtils.js"),I=require("./utils/itemIdUtils.js"),h=require("./utils/misc.js"),x=require("./utils/consts.js");function m(i,t,n,s={},d){if(!n||!n.length)return[];const{ids:c,idField:r}=O(t),l=r?h.getNestedValue(r,i.item):i.itemHierarchicalIndex,u=c.indexOf(l),f=u===-1,a=d||x.CHILDREN_FIELD;let e;return s.singleMode?e=f?[l]:[]:(e=c.slice(),f?e.push(l):e.splice(u,1),s.checkChildren&&k(i.item,i.itemHierarchicalIndex,f,r,a,e),s.checkParents&&p(i.itemHierarchicalIndex,f,r,a,e,n)),h.isArray(t)?e:Object.assign({},t,{ids:e})}function O(i){let t,n;return h.isArray(i)?t=i:(t=i.ids||[],n=i.idField),{ids:t,idField:n}}function k(i,t,n,s,d,c){g.getAllDirectIndirectChildrenIds(i,t,d,s).forEach(r=>{n&&c.indexOf(r)===-1?c.push(r):!n&&c.indexOf(r)>-1&&c.splice(c.indexOf(r),1)})}function p(i,t,n,s,d,c){const r=a();let l=r.next();t?u():f();function u(){for(;!l.done;){const{id:e,item:o}=l.value;if(d.indexOf(e)===-1&&g.areAllDirectChildrenChecked(o,e,n,s,d))d.push(e),l=r.next();else break}}function f(){for(;!l.done;){const{id:e}=l.value,o=d.indexOf(e);if(o>-1)d.splice(o,1),l=r.next();else break}}function*a(){if(n){const e=g.getAllParents(i,s,c);for(let o=e.length-1;o>-1;o--)yield{id:h.getNestedValue(n,e[o]),item:t?e[o]:void 0}}else{let e=I.getDirectParentId(i);for(;e;)yield{id:e,item:t?I.getItemById(e,c,s):void 0},e=I.getDirectParentId(e)}}}exports.handleTreeViewCheckChange=m;

package/handleTreeViewCheckChange.mjs

@@ -0,0 +1,64 @@
+/**
+ * @license
+ *-------------------------------------------------------------------------------------------
+ * Copyright © 2024 Progress Software Corporation. All rights reserved.
+ * Licensed under commercial license. See LICENSE.md in the package root for more information
+ *-------------------------------------------------------------------------------------------
+ */
+import { getAllDirectIndirectChildrenIds as I, areAllDirectChildrenChecked as p, getAllParents as g } from "./utils/itemUtils.mjs";
+import { getDirectParentId as u, getItemById as O } from "./utils/itemIdUtils.mjs";
+import { getNestedValue as m, isArray as x } from "./utils/misc.mjs";
+import { CHILDREN_FIELD as k } from "./utils/consts.mjs";
+function E(i, n, t, o = {}, f) {
+  if (!t || !t.length)
+    return [];
+  const { ids: l, idField: r } = C(n), c = r ? m(r, i.item) : i.itemHierarchicalIndex, h = l.indexOf(c), d = h === -1, a = f || k;
+  let e;
+  return o.singleMode ? e = d ? [c] : [] : (e = l.slice(), d ? e.push(c) : e.splice(h, 1), o.checkChildren && w(i.item, i.itemHierarchicalIndex, d, r, a, e), o.checkParents && D(i.itemHierarchicalIndex, d, r, a, e, t)), x(n) ? e : Object.assign({}, n, { ids: e });
+}
+function C(i) {
+  let n, t;
+  return x(i) ? n = i : (n = i.ids || [], t = i.idField), { ids: n, idField: t };
+}
+function w(i, n, t, o, f, l) {
+  I(i, n, f, o).forEach((r) => {
+    t && l.indexOf(r) === -1 ? l.push(r) : !t && l.indexOf(r) > -1 && l.splice(l.indexOf(r), 1);
+  });
+}
+function D(i, n, t, o, f, l) {
+  const r = a();
+  let c = r.next();
+  n ? h() : d();
+  function h() {
+    for (; !c.done; ) {
+      const { id: e, item: s } = c.value;
+      if (f.indexOf(e) === -1 && p(s, e, t, o, f))
+        f.push(e), c = r.next();
+      else
+        break;
+    }
+  }
+  function d() {
+    for (; !c.done; ) {
+      const { id: e } = c.value, s = f.indexOf(e);
+      if (s > -1)
+        f.splice(s, 1), c = r.next();
+      else
+        break;
+    }
+  }
+  function* a() {
+    if (t) {
+      const e = g(i, o, l);
+      for (let s = e.length - 1; s > -1; s--)
+        yield { id: m(t, e[s]), item: n ? e[s] : void 0 };
+    } else {
+      let e = u(i);
+      for (; e; )
+        yield { id: e, item: n ? O(e, l, o) : void 0 }, e = u(e);
+    }
+  }
+}
+export {
+  E as handleTreeViewCheckChange
+};