vft 0.0.106 → 0.0.107

package/es/components/tree/model/tree-store.js

@@ -1,7 +1,7 @@
 import { hasOwn as u, isObject as C } from "@vft/utils";
 import N from "./node.js";
-import { getNodeKey as p } from "./util.js";
-class E {
+import { getNodeKey as y } from "./util.js";
+class M {
   constructor(e) {
     this.currentNode = null, this.currentNodeKey = null;
     for (const t in e)
@@ -21,17 +21,17 @@ class E {
       this._initDefaultCheckedNodes();
   }
   filter(e) {
-    const t = this.filterNodeMethod, s = this.lazy, i = function(o) {
-      const h = o.root ? o.root.childNodes : o.childNodes;
-      if (h.forEach((r) => {
-        r.visible = t.call(r, e, r.data, r), i(r);
-      }), !o.visible && h.length) {
+    const t = this.filterNodeMethod, s = this.lazy, o = function(i) {
+      const d = i.root ? i.root.childNodes : i.childNodes;
+      if (d.forEach((r) => {
+        r.visible = t.call(r, e, r.data, r), o(r);
+      }), !i.visible && d.length) {
         let r = !0;
-        r = !h.some((n) => n.visible), o.root ? o.root.visible = r === !1 : o.visible = r === !1;
+        r = !d.some((h) => h.visible), i.root ? i.root.visible = r === !1 : i.visible = r === !1;
       }
-      e && o.visible && !o.isLeaf && !s && o.expand();
+      e && i.visible && !i.isLeaf && !s && i.expand();
     };
-    i(this);
+    o(this);
   }
   setData(e) {
     e !== this.root.data ? (this.root.setData(e), this._initDefaultCheckedNodes()) : this.root.updateChildren();
@@ -39,7 +39,7 @@ class E {
   getNode(e) {
     if (e instanceof N)
       return e;
-    const t = C(e) ? p(this.key, e) : e;
+    const t = C(e) ? y(this.key, e) : e;
     return this.nodesMap[t] || null;
   }
   insertBefore(e, t) {
@@ -61,8 +61,8 @@ class E {
   _initDefaultCheckedNodes() {
     const e = this.defaultCheckedKeys || [], t = this.nodesMap;
     e.forEach((s) => {
-      const i = t[s];
-      i && i.setChecked(!0, !this.checkStrictly);
+      const o = t[s];
+      o && o.setChecked(!0, !this.checkStrictly);
     });
   }
   _initDefaultCheckedNode(e) {
@@ -81,20 +81,20 @@ class E {
     }), delete this.nodesMap[e.key]);
   }
   getCheckedNodes(e = !1, t = !1) {
-    const s = [], i = function(o) {
-      (o.root ? o.root.childNodes : o.childNodes).forEach((r) => {
-        (r.checked || t && r.indeterminate) && (!e || e && r.isLeaf) && s.push(r.data), i(r);
+    const s = [], o = function(i) {
+      (i.root ? i.root.childNodes : i.childNodes).forEach((r) => {
+        (r.checked || t && r.indeterminate) && (!e || e && r.isLeaf) && s.push(r.data), o(r);
       });
     };
-    return i(this), s;
+    return o(this), s;
   }
   getCheckedKeys(e = !1) {
     return this.getCheckedNodes(e).map((t) => (t || {})[this.key]);
   }
   getHalfCheckedNodes() {
     const e = [], t = function(s) {
-      (s.root ? s.root.childNodes : s.childNodes).forEach((o) => {
-        o.indeterminate && e.push(o.data), t(o);
+      (s.root ? s.root.childNodes : s.childNodes).forEach((i) => {
+        i.indeterminate && e.push(i.data), t(i);
       });
     };
     return t(this), e;
@@ -108,67 +108,59 @@ class E {
       u(t, s) && e.push(t[s]);
     return e;
   }
-  _updateChildren(e, t) {
-    const s = e.childNodes;
-    for (let i = s.length - 1; i >= 0; i--) {
-      const o = s[i];
-      this.remove(o.data);
+  updateChildren(e, t) {
+    const s = this.nodesMap[e];
+    if (!s)
+      return;
+    const o = s.childNodes;
+    for (let i = o.length - 1; i >= 0; i--) {
+      const d = o[i];
+      this.remove(d.data);
     }
-    for (let i = 0, o = t.length; i < o; i++) {
-      const h = t[i];
-      this.append(h, e);
+    for (let i = 0, d = t.length; i < d; i++) {
+      const r = t[i];
+      this.append(r, s.data);
     }
   }
-  updateRootChildren(e) {
-    this._updateChildren(this.root, e);
-  }
-  updateKeyChildren(e, t) {
-    const s = this.nodesMap[e];
-    s && this._updateChildren(s, t);
-  }
-  updateNodeChildren(e, t) {
-    const s = t ? this.getNode(t) : this.root;
-    this._updateChildren(s, e);
-  }
   _setCheckedKeys(e, t = !1, s) {
-    const i = this._getAllNodes().sort((r, n) => n.level - r.level), o = /* @__PURE__ */ Object.create(null), h = Object.keys(s);
-    i.forEach((r) => r.setChecked(!1, !1));
-    for (let r = 0, n = i.length; r < n; r++) {
-      const d = i[r], a = d.data[e].toString();
-      if (!h.includes(a)) {
-        d.checked && !o[a] && d.setChecked(!1, !1);
+    const o = this._getAllNodes().sort((r, h) => h.level - r.level), i = /* @__PURE__ */ Object.create(null), d = Object.keys(s);
+    o.forEach((r) => r.setChecked(!1, !1));
+    for (let r = 0, h = o.length; r < h; r++) {
+      const n = o[r], l = n.data[e].toString();
+      if (!d.includes(l)) {
+        n.checked && !i[l] && n.setChecked(!1, !1);
         continue;
       }
-      let c = d.parent;
+      let c = n.parent;
       for (; c && c.level > 0; )
-        o[c.data[e]] = !0, c = c.parent;
-      if (d.isLeaf || this.checkStrictly) {
-        d.setChecked(!0, !1);
+        i[c.data[e]] = !0, c = c.parent;
+      if (n.isLeaf || this.checkStrictly) {
+        n.setChecked(!0, !1);
         continue;
       }
-      if (d.setChecked(!0, !0), t) {
-        d.setChecked(!1, !1);
+      if (n.setChecked(!0, !0), t) {
+        n.setChecked(!1, !1);
         const f = function(k) {
-          k.childNodes.forEach((l) => {
-            l.isLeaf || l.setChecked(!1, !1), f(l);
+          k.childNodes.forEach((a) => {
+            a.isLeaf || a.setChecked(!1, !1), f(a);
           });
         };
-        f(d);
+        f(n);
       }
     }
   }
   setCheckedNodes(e, t = !1) {
-    const s = this.key, i = {};
-    e.forEach((o) => {
-      i[(o || {})[s]] = !0;
-    }), this._setCheckedKeys(s, t, i);
+    const s = this.key, o = {};
+    e.forEach((i) => {
+      o[(i || {})[s]] = !0;
+    }), this._setCheckedKeys(s, t, o);
   }
   setCheckedKeys(e, t = !1) {
     this.defaultCheckedKeys = e;
-    const s = this.key, i = {};
-    e.forEach((o) => {
-      i[o] = !0;
-    }), this._setCheckedKeys(s, t, i);
+    const s = this.key, o = {};
+    e.forEach((i) => {
+      o[i] = !0;
+    }), this._setCheckedKeys(s, t, o);
   }
   setDefaultExpandedKeys(e) {
     e = e || [], this.defaultExpandedKeys = e, e.forEach((t) => {
@@ -177,8 +169,8 @@ class E {
     });
   }
   setChecked(e, t, s) {
-    const i = this.getNode(e);
-    i && i.setChecked(!!t, s);
+    const o = this.getNode(e);
+    o && o.setChecked(!!t, s);
   }
   getCurrentNode() {
     return this.currentNode;
@@ -188,8 +180,8 @@ class E {
     t && (t.isCurrent = !1), this.currentNode = e, this.currentNode.isCurrent = !0;
   }
   setUserCurrentNode(e, t = !0) {
-    const s = e[this.key], i = this.nodesMap[s];
-    this.setCurrentNode(i), t && this.currentNode.level > 1 && this.currentNode.parent.expand(null, !0);
+    const s = e[this.key], o = this.nodesMap[s];
+    this.setCurrentNode(o), t && this.currentNode.level > 1 && this.currentNode.parent.expand(null, !0);
   }
   setCurrentNodeKey(e, t = !0) {
     if (e == null) {
@@ -199,10 +191,7 @@ class E {
     const s = this.getNode(e);
     s && (this.setCurrentNode(s), t && this.currentNode.level > 1 && this.currentNode.parent.expand(null, !0));
   }
-  getRoot() {
-    return this.root;
-  }
 }
 export {
-  E as default
+  M as default
 };

package/es/components/tree/tree.vue2.js

@@ -1,5 +1,5 @@
-import { defineComponent as _, ref as l, computed as U, watch as u, provide as f, getCurrentInstance as V } from "vue";
-import { useNamespace as G } from "../../hooks/use-namespace/index.js";
+import { defineComponent as $, ref as l, computed as j, watch as u, provide as f, getCurrentInstance as _ } from "vue";
+import { useNamespace as R } from "../../hooks/use-namespace/index.js";
 import "@popperjs/core";
 import "lodash";
 import "../../hooks/use-z-index/index.js";
@@ -7,16 +7,16 @@ import "@vueuse/core";
 import "@vft/utils";
 import "../../utils/ns-cover.js";
 import "../form/index.js";
-import J from "./model/tree-store.js";
-import { getNodeKey as L, handleCurrentChange as K } from "./model/util.js";
-import Q from "./tree-node.vue.js";
-import { useNodeExpandEventBroadcast as W } from "./model/useNodeExpandEventBroadcast.js";
-import { useDragNodeHandler as X } from "./model/useDragNode.js";
-import { useKeydown as Y } from "./model/useKeydown.js";
-import { formItemContextKey as Z } from "../form/constants.js";
-const Ce = _({
+import U from "./model/tree-store.js";
+import { getNodeKey as V, handleCurrentChange as K } from "./model/util.js";
+import G from "./tree-node.vue.js";
+import { useNodeExpandEventBroadcast as J } from "./model/useNodeExpandEventBroadcast.js";
+import { useDragNodeHandler as L } from "./model/useDragNode.js";
+import { useKeydown as Q } from "./model/useKeydown.js";
+import { formItemContextKey as W } from "../form/constants.js";
+const he = $({
   name: "VftTree",
-  components: { TreeNode: Q },
+  components: { TreeNode: G },
   props: {
     data: {
       type: Array,
@@ -98,72 +98,72 @@ const Ce = _({
     "node-drag-enter",
     "node-drag-over"
   ],
-  setup(n, o) {
-    const C = G("tree"), t = l(
-      new J({
-        key: n.nodeKey,
-        data: n.data,
-        lazy: n.lazy,
-        props: n.props,
-        load: n.load,
-        currentNodeKey: n.currentNodeKey,
-        checkStrictly: n.checkStrictly,
-        checkDescendants: n.checkDescendants,
-        defaultCheckedKeys: n.defaultCheckedKeys,
-        defaultExpandedKeys: n.defaultExpandedKeys,
-        autoExpandParent: n.autoExpandParent,
-        defaultExpandAll: n.defaultExpandAll,
-        filterNodeMethod: n.filterNodeMethod
+  setup(t, o) {
+    const C = R("tree"), n = l(
+      new U({
+        key: t.nodeKey,
+        data: t.data,
+        lazy: t.lazy,
+        props: t.props,
+        load: t.load,
+        currentNodeKey: t.currentNodeKey,
+        checkStrictly: t.checkStrictly,
+        checkDescendants: t.checkDescendants,
+        defaultCheckedKeys: t.defaultCheckedKeys,
+        defaultExpandedKeys: t.defaultExpandedKeys,
+        autoExpandParent: t.autoExpandParent,
+        defaultExpandAll: t.defaultExpandAll,
+        filterNodeMethod: t.filterNodeMethod
       })
     );
-    t.value.initialize();
-    const c = l(t.value.root), s = l(null), i = l(null), y = l(null), { broadcastExpanded: N } = W(n), { dragState: m } = X({
-      props: n,
+    n.value.initialize();
+    const c = l(n.value.root), s = l(null), i = l(null), y = l(null), { broadcastExpanded: m } = J(t), { dragState: N } = L({
+      props: t,
       ctx: o,
       el$: i,
       dropIndicator$: y,
-      store: t
+      store: n
     });
-    Y({ el$: i }, t);
-    const g = U(() => {
+    Q({ el$: i }, n);
+    const g = j(() => {
       const { childNodes: e } = c.value;
       return !e || e.length === 0 || e.every(({ visible: r }) => !r);
     });
     u(
-      () => n.currentNodeKey,
+      () => t.currentNodeKey,
       (e) => {
-        t.value.setCurrentNodeKey(e);
+        n.value.setCurrentNodeKey(e);
       }
     ), u(
-      () => n.defaultCheckedKeys,
+      () => t.defaultCheckedKeys,
       (e) => {
-        t.value.setDefaultCheckedKey(e);
+        n.value.setDefaultCheckedKey(e);
       }
     ), u(
-      () => n.defaultExpandedKeys,
+      () => t.defaultExpandedKeys,
       (e) => {
-        t.value.setDefaultExpandedKeys(e);
+        n.value.setDefaultExpandedKeys(e);
       }
     ), u(
-      () => n.data,
+      () => t.data,
       (e) => {
-        t.value.setData(e);
+        n.value.setData(e);
       },
       { deep: !0 }
     ), u(
-      () => n.checkStrictly,
+      () => t.checkStrictly,
       (e) => {
-        t.value.checkStrictly = e;
+        n.value.checkStrictly = e;
       }
     );
-    const v = (e) => {
-      if (!n.filterNodeMethod)
+    const k = (e) => {
+      if (!t.filterNodeMethod)
         throw new Error("[Tree] filterNodeMethod is required when filter");
-      t.value.filter(e);
-    }, k = (e) => L(n.nodeKey, e.data), E = (e) => {
-      if (!n.nodeKey)
+      n.value.filter(e);
+    }, v = (e) => V(t.nodeKey, e.data), E = (e) => {
+      if (!t.nodeKey)
         throw new Error("[Tree] nodeKey is required in getNodePath");
-      const r = t.value.getNode(e);
+      const r = n.value.getNode(e);
       if (!r)
         return [];
       const d = [r.data];
@@ -171,84 +171,79 @@ const Ce = _({
       for (; a && a !== c.value; )
         d.push(a.data), a = a.parent;
       return d.reverse();
-    }, p = (e, r) => t.value.getCheckedNodes(e, r), w = (e) => t.value.getCheckedKeys(e), h = () => {
-      const e = t.value.getCurrentNode();
+    }, w = (e, r) => n.value.getCheckedNodes(e, r), p = (e) => n.value.getCheckedKeys(e), h = () => {
+      const e = n.value.getCurrentNode();
       return e ? e.data : null;
     }, x = () => {
-      if (!n.nodeKey)
+      if (!t.nodeKey)
         throw new Error("[Tree] nodeKey is required in getCurrentKey");
       const e = h();
-      return e ? e[n.nodeKey] : null;
+      return e ? e[t.nodeKey] : null;
     }, B = (e, r) => {
-      if (!n.nodeKey)
+      if (!t.nodeKey)
         throw new Error("[Tree] nodeKey is required in setCheckedNodes");
-      t.value.setCheckedNodes(e, r);
+      n.value.setCheckedNodes(e, r);
     }, T = (e, r) => {
-      if (!n.nodeKey)
+      if (!t.nodeKey)
         throw new Error("[Tree] nodeKey is required in setCheckedKeys");
-      t.value.setCheckedKeys(e, r);
+      n.value.setCheckedKeys(e, r);
     }, b = (e, r, d) => {
-      t.value.setChecked(e, r, d);
-    }, S = () => t.value.getHalfCheckedNodes(), A = () => t.value.getHalfCheckedKeys(), D = (e, r = !0) => {
-      if (!n.nodeKey)
+      n.value.setChecked(e, r, d);
+    }, S = () => n.value.getHalfCheckedNodes(), A = () => n.value.getHalfCheckedKeys(), D = (e, r = !0) => {
+      if (!t.nodeKey)
         throw new Error("[Tree] nodeKey is required in setCurrentNode");
       K(
-        t,
+        n,
         o.emit,
-        () => t.value.setUserCurrentNode(e, r)
+        () => n.value.setUserCurrentNode(e, r)
       );
     }, q = (e, r = !0) => {
-      if (!n.nodeKey)
+      if (!t.nodeKey)
         throw new Error("[Tree] nodeKey is required in setCurrentKey");
       K(
-        t,
+        n,
         o.emit,
-        () => t.value.setCurrentNodeKey(e, r)
+        () => n.value.setCurrentNodeKey(e, r)
       );
-    }, F = (e) => t.value.getNode(e), H = () => t.value.getRoot(), M = (e) => {
-      t.value.remove(e);
+    }, F = (e) => n.value.getNode(e), H = (e) => {
+      n.value.remove(e);
+    }, M = (e, r) => {
+      n.value.append(e, r);
     }, P = (e, r) => {
-      t.value.append(e, r);
-    }, R = (e, r) => {
-      t.value.updateNodeChildren(e, r);
+      n.value.insertBefore(e, r);
     }, z = (e, r) => {
-      t.value.insertBefore(e, r);
-    }, O = (e) => {
-      t.value.updateRootChildren(e);
+      n.value.insertAfter(e, r);
+    }, O = (e, r, d) => {
+      m(r), o.emit("node-expand", e, r, d);
     }, I = (e, r) => {
-      t.value.insertAfter(e, r);
-    }, $ = (e, r, d) => {
-      N(r), o.emit("node-expand", e, r, d);
-    }, j = (e, r) => {
-      if (!n.nodeKey)
+      if (!t.nodeKey)
         throw new Error("[Tree] nodeKey is required in updateKeyChild");
-      t.value.updateKeyChildren(e, r);
+      n.value.updateChildren(e, r);
     };
     return f("RootTree", {
       ctx: o,
-      props: n,
-      store: t,
+      props: t,
+      store: n,
       root: c,
       currentNode: s,
-      instance: V()
-    }), f(Z, void 0), {
+      instance: _()
+    }), f(W, void 0), {
       ns: C,
       // ref
-      store: t,
+      store: n,
       root: c,
       currentNode: s,
-      dragState: m,
+      dragState: N,
       el$: i,
       dropIndicator$: y,
       // computed
       isEmpty: g,
       // methods
-      filter: v,
-      getRoot: H,
-      getNodeKey: k,
+      filter: k,
+      getNodeKey: v,
       getNodePath: E,
-      getCheckedNodes: p,
-      getCheckedKeys: w,
+      getCheckedNodes: w,
+      getCheckedKeys: p,
       getCurrentNode: h,
       getCurrentKey: x,
       setCheckedNodes: B,
@@ -259,17 +254,15 @@ const Ce = _({
       setCurrentNode: D,
       setCurrentKey: q,
       getNode: F,
-      remove: M,
-      append: P,
-      update: R,
-      insertBefore: z,
-      insertAfter: I,
-      handleNodeExpand: $,
-      updateRootChildren: O,
-      updateKeyChildren: j
+      remove: H,
+      append: M,
+      insertBefore: P,
+      insertAfter: z,
+      handleNodeExpand: O,
+      updateKeyChildren: I
     };
   }
 });
 export {
-  Ce as default
+  he as default
 };

package/es/package.json.js

@@ -1,4 +1,4 @@
-const o = "0.0.106";
+const o = "0.0.107";
 export {
   o as version
 };

package/lib/components/tree/model/tree-store.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const a=require("@vft/utils"),N=require("./node.cjs"),C=require("./util.cjs");class y{constructor(e){this.currentNode=null,this.currentNodeKey=null;for(const t in e)a.hasOwn(e,t)&&(this[t]=e[t]);this.nodesMap={}}initialize(){if(this.root=new N.default({data:this.data,store:this}),this.root.initialize(),this.lazy&&this.load){const e=this.load;e(this.root,t=>{this.root.doCreateChildren(t),this._initDefaultCheckedNodes()})}else this._initDefaultCheckedNodes()}filter(e){const t=this.filterNodeMethod,s=this.lazy,i=function(o){const n=o.root?o.root.childNodes:o.childNodes;if(n.forEach(r=>{r.visible=t.call(r,e,r.data,r),i(r)}),!o.visible&&n.length){let r=!0;r=!n.some(h=>h.visible),o.root?o.root.visible=r===!1:o.visible=r===!1}e&&o.visible&&!o.isLeaf&&!s&&o.expand()};i(this)}setData(e){e!==this.root.data?(this.root.setData(e),this._initDefaultCheckedNodes()):this.root.updateChildren()}getNode(e){if(e instanceof N.default)return e;const t=a.isObject(e)?C.getNodeKey(this.key,e):e;return this.nodesMap[t]||null}insertBefore(e,t){const s=this.getNode(t);s.parent.insertBefore({data:e},s)}insertAfter(e,t){const s=this.getNode(t);s.parent.insertAfter({data:e},s)}remove(e){const t=this.getNode(e);t&&t.parent&&(t===this.currentNode&&(this.currentNode=null),t.parent.removeChild(t))}append(e,t){const s=t?this.getNode(t):this.root;s&&s.insertChild({data:e})}_initDefaultCheckedNodes(){const e=this.defaultCheckedKeys||[],t=this.nodesMap;e.forEach(s=>{const i=t[s];i&&i.setChecked(!0,!this.checkStrictly)})}_initDefaultCheckedNode(e){(this.defaultCheckedKeys||[]).includes(e.key)&&e.setChecked(!0,!this.checkStrictly)}setDefaultCheckedKey(e){e!==this.defaultCheckedKeys&&(this.defaultCheckedKeys=e,this._initDefaultCheckedNodes())}registerNode(e){const t=this.key;!e||!e.data||(t?e.key!==void 0&&(this.nodesMap[e.key]=e):this.nodesMap[e.id]=e)}deregisterNode(e){!this.key||!e||!e.data||(e.childNodes.forEach(s=>{this.deregisterNode(s)}),delete this.nodesMap[e.key])}getCheckedNodes(e=!1,t=!1){const s=[],i=function(o){(o.root?o.root.childNodes:o.childNodes).forEach(r=>{(r.checked||t&&r.indeterminate)&&(!e||e&&r.isLeaf)&&s.push(r.data),i(r)})};return i(this),s}getCheckedKeys(e=!1){return this.getCheckedNodes(e).map(t=>(t||{})[this.key])}getHalfCheckedNodes(){const e=[],t=function(s){(s.root?s.root.childNodes:s.childNodes).forEach(o=>{o.indeterminate&&e.push(o.data),t(o)})};return t(this),e}getHalfCheckedKeys(){return this.getHalfCheckedNodes().map(e=>(e||{})[this.key])}_getAllNodes(){const e=[],t=this.nodesMap;for(const s in t)a.hasOwn(t,s)&&e.push(t[s]);return e}_updateChildren(e,t){const s=e.childNodes;for(let i=s.length-1;i>=0;i--){const o=s[i];this.remove(o.data)}for(let i=0,o=t.length;i<o;i++){const n=t[i];this.append(n,e)}}updateRootChildren(e){this._updateChildren(this.root,e)}updateKeyChildren(e,t){const s=this.nodesMap[e];s&&this._updateChildren(s,t)}updateNodeChildren(e,t){const s=t?this.getNode(t):this.root;this._updateChildren(s,e)}_setCheckedKeys(e,t=!1,s){const i=this._getAllNodes().sort((r,h)=>h.level-r.level),o=Object.create(null),n=Object.keys(s);i.forEach(r=>r.setChecked(!1,!1));for(let r=0,h=i.length;r<h;r++){const d=i[r],u=d.data[e].toString();if(!n.includes(u)){d.checked&&!o[u]&&d.setChecked(!1,!1);continue}let c=d.parent;for(;c&&c.level>0;)o[c.data[e]]=!0,c=c.parent;if(d.isLeaf||this.checkStrictly){d.setChecked(!0,!1);continue}if(d.setChecked(!0,!0),t){d.setChecked(!1,!1);const f=function(k){k.childNodes.forEach(l=>{l.isLeaf||l.setChecked(!1,!1),f(l)})};f(d)}}}setCheckedNodes(e,t=!1){const s=this.key,i={};e.forEach(o=>{i[(o||{})[s]]=!0}),this._setCheckedKeys(s,t,i)}setCheckedKeys(e,t=!1){this.defaultCheckedKeys=e;const s=this.key,i={};e.forEach(o=>{i[o]=!0}),this._setCheckedKeys(s,t,i)}setDefaultExpandedKeys(e){e=e||[],this.defaultExpandedKeys=e,e.forEach(t=>{const s=this.getNode(t);s&&s.expand(null,this.autoExpandParent)})}setChecked(e,t,s){const i=this.getNode(e);i&&i.setChecked(!!t,s)}getCurrentNode(){return this.currentNode}setCurrentNode(e){const t=this.currentNode;t&&(t.isCurrent=!1),this.currentNode=e,this.currentNode.isCurrent=!0}setUserCurrentNode(e,t=!0){const s=e[this.key],i=this.nodesMap[s];this.setCurrentNode(i),t&&this.currentNode.level>1&&this.currentNode.parent.expand(null,!0)}setCurrentNodeKey(e,t=!0){if(e==null){this.currentNode&&(this.currentNode.isCurrent=!1),this.currentNode=null;return}const s=this.getNode(e);s&&(this.setCurrentNode(s),t&&this.currentNode.level>1&&this.currentNode.parent.expand(null,!0))}getRoot(){return this.root}}exports.default=y;
+"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const a=require("@vft/utils"),N=require("./node.cjs"),C=require("./util.cjs");class y{constructor(e){this.currentNode=null,this.currentNodeKey=null;for(const t in e)a.hasOwn(e,t)&&(this[t]=e[t]);this.nodesMap={}}initialize(){if(this.root=new N.default({data:this.data,store:this}),this.root.initialize(),this.lazy&&this.load){const e=this.load;e(this.root,t=>{this.root.doCreateChildren(t),this._initDefaultCheckedNodes()})}else this._initDefaultCheckedNodes()}filter(e){const t=this.filterNodeMethod,s=this.lazy,o=function(i){const d=i.root?i.root.childNodes:i.childNodes;if(d.forEach(r=>{r.visible=t.call(r,e,r.data,r),o(r)}),!i.visible&&d.length){let r=!0;r=!d.some(c=>c.visible),i.root?i.root.visible=r===!1:i.visible=r===!1}e&&i.visible&&!i.isLeaf&&!s&&i.expand()};o(this)}setData(e){e!==this.root.data?(this.root.setData(e),this._initDefaultCheckedNodes()):this.root.updateChildren()}getNode(e){if(e instanceof N.default)return e;const t=a.isObject(e)?C.getNodeKey(this.key,e):e;return this.nodesMap[t]||null}insertBefore(e,t){const s=this.getNode(t);s.parent.insertBefore({data:e},s)}insertAfter(e,t){const s=this.getNode(t);s.parent.insertAfter({data:e},s)}remove(e){const t=this.getNode(e);t&&t.parent&&(t===this.currentNode&&(this.currentNode=null),t.parent.removeChild(t))}append(e,t){const s=t?this.getNode(t):this.root;s&&s.insertChild({data:e})}_initDefaultCheckedNodes(){const e=this.defaultCheckedKeys||[],t=this.nodesMap;e.forEach(s=>{const o=t[s];o&&o.setChecked(!0,!this.checkStrictly)})}_initDefaultCheckedNode(e){(this.defaultCheckedKeys||[]).includes(e.key)&&e.setChecked(!0,!this.checkStrictly)}setDefaultCheckedKey(e){e!==this.defaultCheckedKeys&&(this.defaultCheckedKeys=e,this._initDefaultCheckedNodes())}registerNode(e){const t=this.key;!e||!e.data||(t?e.key!==void 0&&(this.nodesMap[e.key]=e):this.nodesMap[e.id]=e)}deregisterNode(e){!this.key||!e||!e.data||(e.childNodes.forEach(s=>{this.deregisterNode(s)}),delete this.nodesMap[e.key])}getCheckedNodes(e=!1,t=!1){const s=[],o=function(i){(i.root?i.root.childNodes:i.childNodes).forEach(r=>{(r.checked||t&&r.indeterminate)&&(!e||e&&r.isLeaf)&&s.push(r.data),o(r)})};return o(this),s}getCheckedKeys(e=!1){return this.getCheckedNodes(e).map(t=>(t||{})[this.key])}getHalfCheckedNodes(){const e=[],t=function(s){(s.root?s.root.childNodes:s.childNodes).forEach(i=>{i.indeterminate&&e.push(i.data),t(i)})};return t(this),e}getHalfCheckedKeys(){return this.getHalfCheckedNodes().map(e=>(e||{})[this.key])}_getAllNodes(){const e=[],t=this.nodesMap;for(const s in t)a.hasOwn(t,s)&&e.push(t[s]);return e}updateChildren(e,t){const s=this.nodesMap[e];if(!s)return;const o=s.childNodes;for(let i=o.length-1;i>=0;i--){const d=o[i];this.remove(d.data)}for(let i=0,d=t.length;i<d;i++){const r=t[i];this.append(r,s.data)}}_setCheckedKeys(e,t=!1,s){const o=this._getAllNodes().sort((r,c)=>c.level-r.level),i=Object.create(null),d=Object.keys(s);o.forEach(r=>r.setChecked(!1,!1));for(let r=0,c=o.length;r<c;r++){const n=o[r],f=n.data[e].toString();if(!d.includes(f)){n.checked&&!i[f]&&n.setChecked(!1,!1);continue}let h=n.parent;for(;h&&h.level>0;)i[h.data[e]]=!0,h=h.parent;if(n.isLeaf||this.checkStrictly){n.setChecked(!0,!1);continue}if(n.setChecked(!0,!0),t){n.setChecked(!1,!1);const u=function(k){k.childNodes.forEach(l=>{l.isLeaf||l.setChecked(!1,!1),u(l)})};u(n)}}}setCheckedNodes(e,t=!1){const s=this.key,o={};e.forEach(i=>{o[(i||{})[s]]=!0}),this._setCheckedKeys(s,t,o)}setCheckedKeys(e,t=!1){this.defaultCheckedKeys=e;const s=this.key,o={};e.forEach(i=>{o[i]=!0}),this._setCheckedKeys(s,t,o)}setDefaultExpandedKeys(e){e=e||[],this.defaultExpandedKeys=e,e.forEach(t=>{const s=this.getNode(t);s&&s.expand(null,this.autoExpandParent)})}setChecked(e,t,s){const o=this.getNode(e);o&&o.setChecked(!!t,s)}getCurrentNode(){return this.currentNode}setCurrentNode(e){const t=this.currentNode;t&&(t.isCurrent=!1),this.currentNode=e,this.currentNode.isCurrent=!0}setUserCurrentNode(e,t=!0){const s=e[this.key],o=this.nodesMap[s];this.setCurrentNode(o),t&&this.currentNode.level>1&&this.currentNode.parent.expand(null,!0)}setCurrentNodeKey(e,t=!0){if(e==null){this.currentNode&&(this.currentNode.isCurrent=!1),this.currentNode=null;return}const s=this.getNode(e);s&&(this.setCurrentNode(s),t&&this.currentNode.level>1&&this.currentNode.parent.expand(null,!0))}}exports.default=y;

package/lib/components/tree/tree.vue2.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const d=require("vue"),j=require("../../hooks/use-namespace/index.cjs");require("@popperjs/core");require("lodash");require("../../hooks/use-z-index/index.cjs");require("@vueuse/core");require("@vft/utils");require("../../utils/ns-cover.cjs");require("../form/index.cjs");const I=require("./model/tree-store.cjs"),s=require("./model/util.cjs"),$=require("./tree-node.vue.cjs"),U=require("./model/useNodeExpandEventBroadcast.cjs"),V=require("./model/useDragNode.cjs"),G=require("./model/useKeydown.cjs"),J=require("../form/constants.cjs"),L=d.defineComponent({name:"VftTree",components:{TreeNode:$.default},props:{data:{type:Array,default:()=>[]},emptyText:{type:String},renderAfterExpand:{type:Boolean,default:!0},nodeKey:String,checkStrictly:Boolean,defaultExpandAll:Boolean,expandOnClickNode:{type:Boolean,default:!0},checkOnClickNode:Boolean,checkDescendants:{type:Boolean,default:!1},autoExpandParent:{type:Boolean,default:!0},defaultCheckedKeys:Array,defaultExpandedKeys:Array,currentNodeKey:[String,Number],renderContent:Function,showCheckbox:{type:Boolean,default:!1},draggable:{type:Boolean,default:!1},allowDrag:Function,allowDrop:Function,props:{type:Object,default:()=>({children:"children",label:"label",disabled:"disabled"})},lazy:{type:Boolean,default:!1},highlightCurrent:Boolean,load:Function,filterNodeMethod:Function,accordion:Boolean,indent:{type:Number,default:18},icon:{type:Object}},emits:["check-change","current-change","node-click","node-contextmenu","node-collapse","node-expand","check","node-drag-start","node-drag-end","node-drop","node-drag-leave","node-drag-enter","node-drag-over"],setup(n,a){const f=j.useNamespace("tree"),t=d.ref(new I.default({key:n.nodeKey,data:n.data,lazy:n.lazy,props:n.props,load:n.load,currentNodeKey:n.currentNodeKey,checkStrictly:n.checkStrictly,checkDescendants:n.checkDescendants,defaultCheckedKeys:n.defaultCheckedKeys,defaultExpandedKeys:n.defaultExpandedKeys,autoExpandParent:n.autoExpandParent,defaultExpandAll:n.defaultExpandAll,filterNodeMethod:n.filterNodeMethod}));t.value.initialize();const l=d.ref(t.value.root),i=d.ref(null),c=d.ref(null),y=d.ref(null),{broadcastExpanded:K}=U.useNodeExpandEventBroadcast(n),{dragState:C}=V.useDragNodeHandler({props:n,ctx:a,el$:c,dropIndicator$:y,store:t});G.useKeydown({el$:c},t);const N=d.computed(()=>{const{childNodes:e}=l.value;return!e||e.length===0||e.every(({visible:r})=>!r)});d.watch(()=>n.currentNodeKey,e=>{t.value.setCurrentNodeKey(e)}),d.watch(()=>n.defaultCheckedKeys,e=>{t.value.setDefaultCheckedKey(e)}),d.watch(()=>n.defaultExpandedKeys,e=>{t.value.setDefaultExpandedKeys(e)}),d.watch(()=>n.data,e=>{t.value.setData(e)},{deep:!0}),d.watch(()=>n.checkStrictly,e=>{t.value.checkStrictly=e});const g=e=>{if(!n.filterNodeMethod)throw new Error("[Tree] filterNodeMethod is required when filter");t.value.filter(e)},v=e=>s.getNodeKey(n.nodeKey,e.data),k=e=>{if(!n.nodeKey)throw new Error("[Tree] nodeKey is required in getNodePath");const r=t.value.getNode(e);if(!r)return[];const o=[r.data];let u=r.parent;for(;u&&u!==l.value;)o.push(u.data),u=u.parent;return o.reverse()},w=(e,r)=>t.value.getCheckedNodes(e,r),E=e=>t.value.getCheckedKeys(e),h=()=>{const e=t.value.getCurrentNode();return e?e.data:null},q=()=>{if(!n.nodeKey)throw new Error("[Tree] nodeKey is required in getCurrentKey");const e=h();return e?e[n.nodeKey]:null},m=(e,r)=>{if(!n.nodeKey)throw new Error("[Tree] nodeKey is required in setCheckedNodes");t.value.setCheckedNodes(e,r)},x=(e,r)=>{if(!n.nodeKey)throw new Error("[Tree] nodeKey is required in setCheckedKeys");t.value.setCheckedKeys(e,r)},B=(e,r,o)=>{t.value.setChecked(e,r,o)},b=()=>t.value.getHalfCheckedNodes(),T=()=>t.value.getHalfCheckedKeys(),S=(e,r=!0)=>{if(!n.nodeKey)throw new Error("[Tree] nodeKey is required in setCurrentNode");s.handleCurrentChange(t,a.emit,()=>t.value.setUserCurrentNode(e,r))},p=(e,r=!0)=>{if(!n.nodeKey)throw new Error("[Tree] nodeKey is required in setCurrentKey");s.handleCurrentChange(t,a.emit,()=>t.value.setCurrentNodeKey(e,r))},D=e=>t.value.getNode(e),A=()=>t.value.getRoot(),M=e=>{t.value.remove(e)},P=(e,r)=>{t.value.append(e,r)},F=(e,r)=>{t.value.updateNodeChildren(e,r)},H=(e,r)=>{t.value.insertBefore(e,r)},O=e=>{t.value.updateRootChildren(e)},R=(e,r)=>{t.value.insertAfter(e,r)},z=(e,r,o)=>{K(r),a.emit("node-expand",e,r,o)},_=(e,r)=>{if(!n.nodeKey)throw new Error("[Tree] nodeKey is required in updateKeyChild");t.value.updateKeyChildren(e,r)};return d.provide("RootTree",{ctx:a,props:n,store:t,root:l,currentNode:i,instance:d.getCurrentInstance()}),d.provide(J.formItemContextKey,void 0),{ns:f,store:t,root:l,currentNode:i,dragState:C,el$:c,dropIndicator$:y,isEmpty:N,filter:g,getRoot:A,getNodeKey:v,getNodePath:k,getCheckedNodes:w,getCheckedKeys:E,getCurrentNode:h,getCurrentKey:q,setCheckedNodes:m,setCheckedKeys:x,setChecked:B,getHalfCheckedNodes:b,getHalfCheckedKeys:T,setCurrentNode:S,setCurrentKey:p,getNode:D,remove:M,append:P,update:F,insertBefore:H,insertAfter:R,handleNodeExpand:z,updateRootChildren:O,updateKeyChildren:_}}});exports.default=L;
+"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const d=require("vue"),z=require("../../hooks/use-namespace/index.cjs");require("@popperjs/core");require("lodash");require("../../hooks/use-z-index/index.cjs");require("@vueuse/core");require("@vft/utils");require("../../utils/ns-cover.cjs");require("../form/index.cjs");const _=require("./model/tree-store.cjs"),s=require("./model/util.cjs"),j=require("./tree-node.vue.cjs"),I=require("./model/useNodeExpandEventBroadcast.cjs"),$=require("./model/useDragNode.cjs"),R=require("./model/useKeydown.cjs"),U=require("../form/constants.cjs"),V=d.defineComponent({name:"VftTree",components:{TreeNode:j.default},props:{data:{type:Array,default:()=>[]},emptyText:{type:String},renderAfterExpand:{type:Boolean,default:!0},nodeKey:String,checkStrictly:Boolean,defaultExpandAll:Boolean,expandOnClickNode:{type:Boolean,default:!0},checkOnClickNode:Boolean,checkDescendants:{type:Boolean,default:!1},autoExpandParent:{type:Boolean,default:!0},defaultCheckedKeys:Array,defaultExpandedKeys:Array,currentNodeKey:[String,Number],renderContent:Function,showCheckbox:{type:Boolean,default:!1},draggable:{type:Boolean,default:!1},allowDrag:Function,allowDrop:Function,props:{type:Object,default:()=>({children:"children",label:"label",disabled:"disabled"})},lazy:{type:Boolean,default:!1},highlightCurrent:Boolean,load:Function,filterNodeMethod:Function,accordion:Boolean,indent:{type:Number,default:18},icon:{type:Object}},emits:["check-change","current-change","node-click","node-contextmenu","node-collapse","node-expand","check","node-drag-start","node-drag-end","node-drop","node-drag-leave","node-drag-enter","node-drag-over"],setup(t,a){const f=z.useNamespace("tree"),n=d.ref(new _.default({key:t.nodeKey,data:t.data,lazy:t.lazy,props:t.props,load:t.load,currentNodeKey:t.currentNodeKey,checkStrictly:t.checkStrictly,checkDescendants:t.checkDescendants,defaultCheckedKeys:t.defaultCheckedKeys,defaultExpandedKeys:t.defaultExpandedKeys,autoExpandParent:t.autoExpandParent,defaultExpandAll:t.defaultExpandAll,filterNodeMethod:t.filterNodeMethod}));n.value.initialize();const l=d.ref(n.value.root),i=d.ref(null),c=d.ref(null),y=d.ref(null),{broadcastExpanded:K}=I.useNodeExpandEventBroadcast(t),{dragState:C}=$.useDragNodeHandler({props:t,ctx:a,el$:c,dropIndicator$:y,store:n});R.useKeydown({el$:c},n);const N=d.computed(()=>{const{childNodes:e}=l.value;return!e||e.length===0||e.every(({visible:r})=>!r)});d.watch(()=>t.currentNodeKey,e=>{n.value.setCurrentNodeKey(e)}),d.watch(()=>t.defaultCheckedKeys,e=>{n.value.setDefaultCheckedKey(e)}),d.watch(()=>t.defaultExpandedKeys,e=>{n.value.setDefaultExpandedKeys(e)}),d.watch(()=>t.data,e=>{n.value.setData(e)},{deep:!0}),d.watch(()=>t.checkStrictly,e=>{n.value.checkStrictly=e});const g=e=>{if(!t.filterNodeMethod)throw new Error("[Tree] filterNodeMethod is required when filter");n.value.filter(e)},v=e=>s.getNodeKey(t.nodeKey,e.data),k=e=>{if(!t.nodeKey)throw new Error("[Tree] nodeKey is required in getNodePath");const r=n.value.getNode(e);if(!r)return[];const o=[r.data];let u=r.parent;for(;u&&u!==l.value;)o.push(u.data),u=u.parent;return o.reverse()},w=(e,r)=>n.value.getCheckedNodes(e,r),E=e=>n.value.getCheckedKeys(e),h=()=>{const e=n.value.getCurrentNode();return e?e.data:null},q=()=>{if(!t.nodeKey)throw new Error("[Tree] nodeKey is required in getCurrentKey");const e=h();return e?e[t.nodeKey]:null},m=(e,r)=>{if(!t.nodeKey)throw new Error("[Tree] nodeKey is required in setCheckedNodes");n.value.setCheckedNodes(e,r)},x=(e,r)=>{if(!t.nodeKey)throw new Error("[Tree] nodeKey is required in setCheckedKeys");n.value.setCheckedKeys(e,r)},B=(e,r,o)=>{n.value.setChecked(e,r,o)},b=()=>n.value.getHalfCheckedNodes(),T=()=>n.value.getHalfCheckedKeys(),S=(e,r=!0)=>{if(!t.nodeKey)throw new Error("[Tree] nodeKey is required in setCurrentNode");s.handleCurrentChange(n,a.emit,()=>n.value.setUserCurrentNode(e,r))},D=(e,r=!0)=>{if(!t.nodeKey)throw new Error("[Tree] nodeKey is required in setCurrentKey");s.handleCurrentChange(n,a.emit,()=>n.value.setCurrentNodeKey(e,r))},A=e=>n.value.getNode(e),M=e=>{n.value.remove(e)},p=(e,r)=>{n.value.append(e,r)},P=(e,r)=>{n.value.insertBefore(e,r)},F=(e,r)=>{n.value.insertAfter(e,r)},H=(e,r,o)=>{K(r),a.emit("node-expand",e,r,o)},O=(e,r)=>{if(!t.nodeKey)throw new Error("[Tree] nodeKey is required in updateKeyChild");n.value.updateChildren(e,r)};return d.provide("RootTree",{ctx:a,props:t,store:n,root:l,currentNode:i,instance:d.getCurrentInstance()}),d.provide(U.formItemContextKey,void 0),{ns:f,store:n,root:l,currentNode:i,dragState:C,el$:c,dropIndicator$:y,isEmpty:N,filter:g,getNodeKey:v,getNodePath:k,getCheckedNodes:w,getCheckedKeys:E,getCurrentNode:h,getCurrentKey:q,setCheckedNodes:m,setCheckedKeys:x,setChecked:B,getHalfCheckedNodes:b,getHalfCheckedKeys:T,setCurrentNode:S,setCurrentKey:D,getNode:A,remove:M,append:p,insertBefore:P,insertAfter:F,handleNodeExpand:H,updateKeyChildren:O}}});exports.default=V;

package/lib/package.json.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e="0.0.106";exports.version=e;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e="0.0.107";exports.version=e;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "vft",
-  "version": "0.0.106",
+  "version": "0.0.107",
   "license": "MIT",
   "main": "lib/index.cjs",
   "module": "es/index.js",
@@ -57,7 +57,7 @@
     "@vft/router": "0.0.25",
     "@vft/store": "0.0.25",
     "@vft/use": "0.0.28",
-    "@vft/utils": "0.0.39",
+    "@vft/utils": "0.0.40",
     "@vft/directives": "0.0.21"
   },
   "vetur": {