vft 0.0.239 → 0.0.241

package/es/components/tree/model/node.js

@@ -1,56 +1,53 @@
-var D = Object.defineProperty;
-var L = (a, e, t) => e in a ? D(a, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : a[e] = t;
-var h = (a, e, t) => L(a, typeof e != "symbol" ? e + "" : e, t);
-import { hasOwn as E } from "@vft/utils";
-import { reactive as b } from "vue";
-import { markNodeData as x, NODE_KEY as N } from "./util.js";
-const g = (a) => {
+import { hasOwn as m } from "@vft/utils";
+import { reactive as D } from "vue";
+import { markNodeData as C, NODE_KEY as y } from "./util.js";
+const N = (r) => {
   let e = !0, t = !0, i = !0;
-  for (let s = 0, r = a.length; s < r; s++) {
-    const d = a[s];
-    (d.checked !== !0 || d.indeterminate) && (e = !1, d.disabled || (i = !1)), (d.checked !== !1 || d.indeterminate) && (t = !1);
+  for (let s = 0, a = r.length; s < a; s++) {
+    const h = r[s];
+    (h.checked !== !0 || h.indeterminate) && (e = !1, h.disabled || (i = !1)), (h.checked !== !1 || h.indeterminate) && (t = !1);
   }
   return { all: e, none: t, allWithoutDisable: i, half: !e && !t };
-}, f = function(a) {
-  if (a.childNodes.length === 0 || a.loading) return;
-  const { all: e, none: t, half: i } = g(a.childNodes);
-  e ? (a.checked = !0, a.indeterminate = !1) : i ? (a.checked = !1, a.indeterminate = !0) : t && (a.checked = !1, a.indeterminate = !1);
-  const s = a.parent;
-  !s || s.level === 0 || a.store.checkStrictly || f(s);
-}, o = function(a, e) {
-  const t = a.store.props, i = a.data || {}, s = t[e];
+}, o = function(r) {
+  if (r.childNodes.length === 0 || r.loading) return;
+  const { all: e, none: t, half: i } = N(r.childNodes);
+  e ? (r.checked = !0, r.indeterminate = !1) : i ? (r.checked = !1, r.indeterminate = !0) : t && (r.checked = !1, r.indeterminate = !1);
+  const s = r.parent;
+  !s || s.level === 0 || r.store.checkStrictly || o(s);
+}, l = function(r, e) {
+  const t = r.store.props, i = r.data || {}, s = t[e];
   if (typeof s == "function")
-    return s(i, a);
+    return s(i, r);
   if (typeof s == "string")
     return i[s];
   if (typeof s > "u") {
-    const r = i[e];
-    return r === void 0 ? "" : r;
+    const a = i[e];
+    return a === void 0 ? "" : a;
   }
 };
-let S = 0;
-class c {
+let L = 0;
+class f {
+  id;
+  text;
+  checked;
+  indeterminate;
+  data;
+  expanded;
+  parent;
+  visible;
+  isCurrent;
+  store;
+  isLeafByUser;
+  isLeaf;
+  canFocus;
+  level;
+  loaded;
+  childNodes;
+  loading;
   constructor(e) {
-    h(this, "id");
-    h(this, "text");
-    h(this, "checked");
-    h(this, "indeterminate");
-    h(this, "data");
-    h(this, "expanded");
-    h(this, "parent");
-    h(this, "visible");
-    h(this, "isCurrent");
-    h(this, "store");
-    h(this, "isLeafByUser");
-    h(this, "isLeaf");
-    h(this, "canFocus");
-    h(this, "level");
-    h(this, "loaded");
-    h(this, "childNodes");
-    h(this, "loading");
-    this.id = S++, this.text = null, this.checked = !1, this.indeterminate = !1, this.data = null, this.expanded = !1, this.parent = null, this.visible = !0, this.isCurrent = !1, this.canFocus = !1;
+    this.id = L++, this.text = null, this.checked = !1, this.indeterminate = !1, this.data = null, this.expanded = !1, this.parent = null, this.visible = !0, this.isCurrent = !1, this.canFocus = !1;
     for (const t in e)
-      E(e, t) && (this[t] = e[t]);
+      m(e, t) && (this[t] = e[t]);
     this.level = 0, this.loaded = !1, this.childNodes = [], this.loading = !1, this.parent && (this.level = this.parent.level + 1);
   }
   initialize() {
@@ -60,29 +57,29 @@ class c {
     e.registerNode(this);
     const t = e.props;
     if (t && typeof t.isLeaf < "u") {
-      const r = o(this, "isLeaf");
-      typeof r == "boolean" && (this.isLeafByUser = r);
+      const a = l(this, "isLeaf");
+      typeof a == "boolean" && (this.isLeafByUser = a);
     }
-    if (e.lazy !== !0 && this.data ? (this.setData(this.data), e.defaultExpandAll && (this.expanded = !0, this.canFocus = !0)) : this.level > 0 && e.lazy && e.defaultExpandAll && this.expand(), Array.isArray(this.data) || x(this, this.data), !this.data) return;
+    if (e.lazy !== !0 && this.data ? (this.setData(this.data), e.defaultExpandAll && (this.expanded = !0, this.canFocus = !0)) : this.level > 0 && e.lazy && e.defaultExpandAll && this.expand(), Array.isArray(this.data) || C(this, this.data), !this.data) return;
     const i = e.defaultExpandedKeys, s = e.key;
     s && i && i.includes(this.key) && this.expand(null, e.autoExpandParent), s && e.currentNodeKey !== void 0 && this.key === e.currentNodeKey && (e.currentNode = this, e.currentNode.isCurrent = !0), e.lazy && e._initDefaultCheckedNode(this), this.updateLeafState(), this.parent && (this.level === 1 || this.parent.expanded === !0) && (this.canFocus = !0);
   }
   setData(e) {
-    Array.isArray(e) || x(this, e), this.data = e, this.childNodes = [];
+    Array.isArray(e) || C(this, e), this.data = e, this.childNodes = [];
     let t;
-    this.level === 0 && Array.isArray(this.data) ? t = this.data : t = o(this, "children") || [];
+    this.level === 0 && Array.isArray(this.data) ? t = this.data : t = l(this, "children") || [];
     for (let i = 0, s = t.length; i < s; i++)
       this.insertChild({ data: t[i] });
   }
   get label() {
-    return o(this, "label");
+    return l(this, "label");
   }
   get key() {
     const e = this.store.key;
     return this.data ? this.data[e] : null;
   }
   get disabled() {
-    return o(this, "disabled");
+    return l(this, "disabled");
   }
   get nextSibling() {
     const e = this.parent;
@@ -113,7 +110,7 @@ class c {
   }
   insertChild(e, t, i) {
     if (!e) throw new Error("InsertChild error: child is required.");
-    if (!(e instanceof c)) {
+    if (!(e instanceof f)) {
       if (!i) {
         const s = this.getChildren(!0);
         s.includes(e.data) || (typeof t > "u" || t < 0 ? s.push(e.data) : s.splice(t, 0, e.data));
@@ -121,7 +118,7 @@ class c {
       Object.assign(e, {
         parent: this,
         store: this.store
-      }), e = b(new c(e)), e instanceof c && e.initialize();
+      }), e = D(new f(e)), e instanceof f && e.initialize();
     }
     e.level = this.level + 1, typeof t > "u" || t < 0 ? this.childNodes.push(e) : this.childNodes.splice(t, 0, e), this.updateLeafState();
   }
@@ -167,7 +164,7 @@ class c {
       });
     };
     this.shouldLoadData() ? this.loadData((s) => {
-      Array.isArray(s) && (this.checked ? this.setChecked(!0, !0) : this.store.checkStrictly || f(this), i());
+      Array.isArray(s) && (this.checked ? this.setChecked(!0, !0) : this.store.checkStrictly || o(this), i());
     }) : i();
   }
   doCreateChildren(e, t = {}) {
@@ -202,25 +199,25 @@ class c {
   setChecked(e, t, i, s) {
     if (this.indeterminate = e === "half", this.checked = e === !0, this.store.checkStrictly) return;
     if (!(this.shouldLoadData() && !this.store.checkDescendants)) {
-      const { all: d, allWithoutDisable: n } = g(this.childNodes);
-      !this.isLeaf && !d && n && (this.checked = !1, e = !1);
-      const u = () => {
+      const { all: h, allWithoutDisable: d } = N(this.childNodes);
+      !this.isLeaf && !h && d && (this.checked = !1, e = !1);
+      const c = () => {
         if (t) {
-          const l = this.childNodes;
-          for (let p = 0, v = l.length; p < v; p++) {
-            const y = l[p];
+          const n = this.childNodes;
+          for (let u = 0, k = n.length; u < k; u++) {
+            const p = n[u];
             s = s || e !== !1;
-            const m = y.disabled ? y.checked : s;
-            y.setChecked(m, t, !0, s);
+            const v = p.disabled ? p.checked : s;
+            p.setChecked(v, t, !0, s);
           }
-          const { half: k, all: C } = g(l);
-          C || (this.checked = C, this.indeterminate = k);
+          const { half: x, all: g } = N(n);
+          g || (this.checked = g, this.indeterminate = x);
         }
       };
       if (this.shouldLoadData()) {
         this.loadData(
           () => {
-            u(), f(this);
+            c(), o(this);
           },
           {
             checked: e !== !1
@@ -228,10 +225,10 @@ class c {
         );
         return;
       } else
-        u();
+        c();
     }
-    const r = this.parent;
-    !r || r.level === 0 || i || f(r);
+    const a = this.parent;
+    !a || a.level === 0 || i || o(a);
   }
   getChildren(e = !1) {
     if (this.level === 0) return this.data;
@@ -242,14 +239,14 @@ class c {
     return i && (s = i.children || "children"), t[s] === void 0 && (t[s] = null), e && !t[s] && (t[s] = []), t[s];
   }
   updateChildren() {
-    const e = this.getChildren() || [], t = this.childNodes.map((r) => r.data), i = {}, s = [];
-    e.forEach((r, d) => {
-      const n = r[N];
-      !!n && t.findIndex((l) => l[N] === n) >= 0 ? i[n] = { index: d, data: r } : s.push({ index: d, data: r });
-    }), this.store.lazy || t.forEach((r) => {
-      i[r[N]] || this.removeChildByData(r);
-    }), s.forEach(({ index: r, data: d }) => {
-      this.insertChild({ data: d }, r);
+    const e = this.getChildren() || [], t = this.childNodes.map((a) => a.data), i = {}, s = [];
+    e.forEach((a, h) => {
+      const d = a[y];
+      !!d && t.findIndex((n) => n[y] === d) >= 0 ? i[d] = { index: h, data: a } : s.push({ index: h, data: a });
+    }), this.store.lazy || t.forEach((a) => {
+      i[a[y]] || this.removeChildByData(a);
+    }), s.forEach(({ index: a, data: h }) => {
+      this.insertChild({ data: h }, a);
     }), this.updateLeafState();
   }
   loadData(e, t = {}) {
@@ -264,6 +261,6 @@ class c {
   }
 }
 export {
-  c as default,
-  g as getChildState
+  f as default,
+  N as getChildState
 };

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

@@ -1,34 +1,31 @@
-var p = Object.defineProperty;
-var g = (h, e, t) => e in h ? p(h, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : h[e] = t;
-var d = (h, e, t) => g(h, typeof e != "symbol" ? e + "" : e, t);
-import { hasOwn as k, isObject as K } from "@vft/utils";
-import C from "./node.js";
-import { getNodeKey as v } from "./util.js";
-class b {
+import { hasOwn as u, isObject as C } from "@vft/utils";
+import N from "./node.js";
+import { getNodeKey as y } from "./util.js";
+class m {
+  currentNode;
+  currentNodeKey;
+  nodesMap;
+  root;
+  data;
+  lazy;
+  load;
+  filterNodeMethod;
+  key;
+  defaultCheckedKeys;
+  checkStrictly;
+  defaultExpandedKeys;
+  autoExpandParent;
+  defaultExpandAll;
+  checkDescendants;
+  props;
   constructor(e) {
-    d(this, "currentNode");
-    d(this, "currentNodeKey");
-    d(this, "nodesMap");
-    d(this, "root");
-    d(this, "data");
-    d(this, "lazy");
-    d(this, "load");
-    d(this, "filterNodeMethod");
-    d(this, "key");
-    d(this, "defaultCheckedKeys");
-    d(this, "checkStrictly");
-    d(this, "defaultExpandedKeys");
-    d(this, "autoExpandParent");
-    d(this, "defaultExpandAll");
-    d(this, "checkDescendants");
-    d(this, "props");
     this.currentNode = null, this.currentNodeKey = null;
     for (const t in e)
-      k(e, t) && (this[t] = e[t]);
+      u(e, t) && (this[t] = e[t]);
     this.nodesMap = {};
   }
   initialize() {
-    if (this.root = new C({
+    if (this.root = new N({
       data: this.data,
       store: this
     }), this.root.initialize(), this.lazy && this.load) {
@@ -41,12 +38,12 @@ class b {
   }
   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) => {
+      const d = o.root ? o.root.childNodes : o.childNodes;
+      if (d.forEach((r) => {
         r.visible = t.call(r, e, r.data, r), i(r);
-      }), !o.visible && n.length) {
+      }), !o.visible && d.length) {
         let r = !0;
-        r = !n.some((a) => a.visible), o.root ? o.root.visible = r === !1 : o.visible = r === !1;
+        r = !d.some((c) => c.visible), o.root ? o.root.visible = r === !1 : o.visible = r === !1;
       }
       e && o.visible && !o.isLeaf && !s && o.expand();
     };
@@ -56,8 +53,8 @@ class b {
     e !== this.root.data ? (this.root.setData(e), this._initDefaultCheckedNodes()) : this.root.updateChildren();
   }
   getNode(e) {
-    if (e instanceof C) return e;
-    const t = K(e) ? v(this.key, e) : e;
+    if (e instanceof N) return e;
+    const t = C(e) ? y(this.key, e) : e;
     return this.nodesMap[t] || null;
   }
   insertBefore(e, t) {
@@ -85,10 +82,10 @@ class b {
     if (!s) return;
     const i = s.childNodes;
     for (let o = i.length - 1; o >= 0; o--) {
-      const n = i[o];
-      this.remove(n.data);
+      const d = i[o];
+      this.remove(d.data);
     }
-    for (let o = 0, n = t.length; o < n; o++) {
+    for (let o = 0, d = t.length; o < d; o++) {
       const r = t[o];
       this.append(r, s.data);
     }
@@ -140,33 +137,33 @@ class b {
   _getAllNodes() {
     const e = [], t = this.nodesMap;
     for (const s in t)
-      k(t, s) && e.push(t[s]);
+      u(t, s) && e.push(t[s]);
     return e;
   }
   _setCheckedKeys(e, t = !1, s) {
-    const i = this._getAllNodes().sort((r, a) => a.level - r.level), o = /* @__PURE__ */ Object.create(null), n = Object.keys(s);
+    const i = this._getAllNodes().sort((r, c) => c.level - r.level), o = /* @__PURE__ */ Object.create(null), d = Object.keys(s);
     i.forEach((r) => r.setChecked(!1, !1));
-    for (let r = 0, a = i.length; r < a; r++) {
-      const c = i[r], u = c.data[e].toString();
-      if (!n.includes(u)) {
-        c.checked && !o[u] && c.setChecked(!1, !1);
+    for (let r = 0, c = i.length; r < c; r++) {
+      const n = i[r], l = n.data[e].toString();
+      if (!d.includes(l)) {
+        n.checked && !o[l] && n.setChecked(!1, !1);
         continue;
       }
-      let l = c.parent;
-      for (; l && l.level > 0; )
-        o[l.data[e]] = !0, l = l.parent;
-      if (c.isLeaf || this.checkStrictly) {
-        c.setChecked(!0, !1);
+      let h = n.parent;
+      for (; h && h.level > 0; )
+        o[h.data[e]] = !0, h = h.parent;
+      if (n.isLeaf || this.checkStrictly) {
+        n.setChecked(!0, !1);
         continue;
       }
-      if (c.setChecked(!0, !0), t) {
-        c.setChecked(!1, !1);
-        const N = function(y) {
-          y.childNodes.forEach((f) => {
-            f.isLeaf || f.setChecked(!1, !1), N(f);
+      if (n.setChecked(!0, !0), t) {
+        n.setChecked(!1, !1);
+        const f = function(k) {
+          k.childNodes.forEach((a) => {
+            a.isLeaf || a.setChecked(!1, !1), f(a);
           });
         };
-        N(c);
+        f(n);
       }
     }
   }
@@ -214,5 +211,5 @@ class b {
   }
 }
 export {
-  b as default
+  m as default
 };

package/es/components/tree/model/useDragNode.d.ts

@@ -27,6 +27,18 @@ export declare function useDragNodeHandler({ props, ctx, el$, dropIndicator$, st
         dropNode: null;
         allowDrop: boolean;
         dropType: null;
+    }, {
+        showDropIndicator: boolean;
+        draggingNode: null;
+        dropNode: null;
+        allowDrop: boolean;
+        dropType: null;
+    } | {
+        showDropIndicator: boolean;
+        draggingNode: null;
+        dropNode: null;
+        allowDrop: boolean;
+        dropType: null;
     }>;
 };
 export {};

package/es/components/tree/model/useDragNode.js

@@ -1,4 +1,4 @@
-import { removeClass as D, addClass as I } from "@vft/utils";
+import { removeClass as v, addClass as I } from "@vft/utils";
 import "@vueuse/core";
 import "../../../utils/ns-cover.js";
 import "lodash-es";
@@ -29,7 +29,7 @@ function G({ props: p, ctx: s, el$: h, dropIndicator$: b, store: T }) {
     },
     treeNodeDragOver: ({ event: r, treeNode: t }) => {
       const e = t, o = d.value.dropNode;
-      o && o.node.id !== e.node.id && D(o.$el, g.is("drop-inner"));
+      o && o.node.id !== e.node.id && v(o.$el, g.is("drop-inner"));
       const n = d.value.draggingNode;
       if (!n || !e) return;
       let l = !0, i = !0, f = !0, N = !0;
@@ -37,21 +37,21 @@ function G({ props: p, ctx: s, el$: h, dropIndicator$: b, store: T }) {
         n.node,
         e.node,
         "inner"
-      ), f = p.allowDrop(n.node, e.node, "next")), r.dataTransfer.dropEffect = i || l || f ? "move" : "none", (l || i || f) && (o == null ? void 0 : o.node.id) !== e.node.id && (o && s.emit("node-drag-leave", n.node, o.node, r), s.emit("node-drag-enter", n.node, e.node, r)), (l || i || f) && (d.value.dropNode = e), e.node.nextSibling === n.node && (f = !1), e.node.previousSibling === n.node && (l = !1), e.node.contains(n.node, !1) && (i = !1), (n.node === e.node || n.node.contains(e.node)) && (l = !1, i = !1, f = !1);
+      ), f = p.allowDrop(n.node, e.node, "next")), r.dataTransfer.dropEffect = i || l || f ? "move" : "none", (l || i || f) && o?.node.id !== e.node.id && (o && s.emit("node-drag-leave", n.node, o.node, r), s.emit("node-drag-enter", n.node, e.node, r)), (l || i || f) && (d.value.dropNode = e), e.node.nextSibling === n.node && (f = !1), e.node.previousSibling === n.node && (l = !1), e.node.contains(n.node, !1) && (i = !1), (n.node === e.node || n.node.contains(e.node)) && (l = !1, i = !1, f = !1);
       const u = e.$el.getBoundingClientRect(), c = h.value.getBoundingClientRect();
       let a;
       const $ = l ? i ? 0.25 : f ? 0.45 : 1 : -1, C = f ? i ? 0.75 : l ? 0.55 : 0 : 1;
       let m = -9999;
       const w = r.clientY - u.top;
       w < u.height * $ ? a = "before" : w > u.height * C ? a = "after" : i ? a = "inner" : a = "none";
-      const v = e.$el.querySelector(`.${g.be("node", "expand-icon")}`).getBoundingClientRect(), y = b.value;
-      a === "before" ? m = v.top - c.top : a === "after" && (m = v.bottom - c.top), y.style.top = `${m}px`, y.style.left = `${v.right - c.left}px`, a === "inner" ? I(e.$el, g.is("drop-inner")) : D(e.$el, g.is("drop-inner")), d.value.showDropIndicator = a === "before" || a === "after", d.value.allowDrop = d.value.showDropIndicator || N, d.value.dropType = a, s.emit("node-drag-over", n.node, e.node, r);
+      const D = e.$el.querySelector(`.${g.be("node", "expand-icon")}`).getBoundingClientRect(), y = b.value;
+      a === "before" ? m = D.top - c.top : a === "after" && (m = D.bottom - c.top), y.style.top = `${m}px`, y.style.left = `${D.right - c.left}px`, a === "inner" ? I(e.$el, g.is("drop-inner")) : v(e.$el, g.is("drop-inner")), d.value.showDropIndicator = a === "before" || a === "after", d.value.allowDrop = d.value.showDropIndicator || N, d.value.dropType = a, s.emit("node-drag-over", n.node, e.node, r);
     },
     treeNodeDragEnd: (r) => {
       const { draggingNode: t, dropType: e, dropNode: o } = d.value;
       if (r.preventDefault(), r.dataTransfer.dropEffect = "move", t && o) {
         const n = { data: t.node.data };
-        e !== "none" && t.node.remove(), e === "before" ? o.node.parent.insertBefore(n, o.node) : e === "after" ? o.node.parent.insertAfter(n, o.node) : e === "inner" && o.node.insertChild(n), e !== "none" && T.value.registerNode(n), D(o.$el, g.is("drop-inner")), s.emit(
+        e !== "none" && t.node.remove(), e === "before" ? o.node.parent.insertBefore(n, o.node) : e === "after" ? o.node.parent.insertAfter(n, o.node) : e === "inner" && o.node.insertChild(n), e !== "none" && T.value.registerNode(n), v(o.$el, g.is("drop-inner")), s.emit(
           "node-drag-end",
           t.node,
           o.node,

package/es/components/tree/model/useKeydown.js

@@ -1,4 +1,4 @@
-import { EVENT_CODE as a } from "../../../constants/aria.js";
+import { EVENT_CODE as l } from "../../../constants/aria.js";
 import { useEventListener as v } from "@vueuse/core";
 import "@vft/utils";
 import "../../../utils/ns-cover.js";
@@ -8,29 +8,29 @@ import { useNamespace as k } from "../../../hooks/use-namespace/index.js";
 import "../../../hooks/use-model-toggle/index.js";
 import "@popperjs/core";
 import "../../../hooks/use-z-index/index.js";
-function F({ el$: l }, d) {
+function F({ el$: o }, d) {
   const u = k("tree"), t = m([]), i = m([]);
   y(() => {
     p();
   }), h(() => {
-    t.value = Array.from(l.value.querySelectorAll("[role=treeitem]")), i.value = Array.from(
-      l.value.querySelectorAll("input[type=checkbox]")
+    t.value = Array.from(o.value.querySelectorAll("[role=treeitem]")), i.value = Array.from(
+      o.value.querySelectorAll("input[type=checkbox]")
     );
   }), b(i, (r) => {
-    r.forEach((o) => {
-      o.setAttribute("tabindex", "-1");
+    r.forEach((a) => {
+      a.setAttribute("tabindex", "-1");
     });
-  }), v(l, "keydown", (r) => {
-    const o = r.target;
-    if (!o.className.includes(u.b("node"))) return;
+  }), v(o, "keydown", (r) => {
+    const a = r.target;
+    if (!a.className.includes(u.b("node"))) return;
     const c = r.code;
     t.value = Array.from(
-      l.value.querySelectorAll(`.${u.is("focusable")}[role=treeitem]`)
+      o.value.querySelectorAll(`.${u.is("focusable")}[role=treeitem]`)
     );
-    const n = t.value.indexOf(o);
+    const n = t.value.indexOf(a);
     let e;
-    if ([a.up, a.down].includes(c)) {
-      if (r.preventDefault(), c === a.up) {
+    if ([l.up, l.down].includes(c)) {
+      if (r.preventDefault(), c === l.up) {
         e = n === -1 ? 0 : n !== 0 ? n - 1 : t.value.length - 1;
         const s = e;
         for (; !d.value.getNode(t.value[e].dataset.key).canFocus; ) {
@@ -53,27 +53,26 @@ function F({ el$: l }, d) {
       }
       e !== -1 && t.value[e].focus();
     }
-    [a.left, a.right].includes(c) && (r.preventDefault(), o.click());
-    const f = o.querySelector(
+    [l.left, l.right].includes(c) && (r.preventDefault(), a.click());
+    const f = a.querySelector(
       '[type="checkbox"]'
     );
-    [a.enter, a.space].includes(c) && f && (r.preventDefault(), f.click());
+    [l.enter, l.space].includes(c) && f && (r.preventDefault(), f.click());
   });
   const p = () => {
-    var o;
     t.value = Array.from(
-      l.value.querySelectorAll(`.${u.is("focusable")}[role=treeitem]`)
+      o.value.querySelectorAll(`.${u.is("focusable")}[role=treeitem]`)
     ), i.value = Array.from(
-      l.value.querySelectorAll("input[type=checkbox]")
+      o.value.querySelectorAll("input[type=checkbox]")
     );
-    const r = l.value.querySelectorAll(
+    const r = o.value.querySelectorAll(
       `.${u.is("checked")}[role=treeitem]`
     );
     if (r.length) {
       r[0].setAttribute("tabindex", "0");
       return;
     }
-    (o = t.value[0]) == null || o.setAttribute("tabindex", "0");
+    t.value[0]?.setAttribute("tabindex", "0");
   };
 }
 export {

package/es/components/tree/model/util.d.ts

@@ -4,4 +4,4 @@ import type Node from './node';
 export declare const NODE_KEY = "$treeNodeId";
 export declare const markNodeData: (node: Node, data: TreeNodeData) => void;
 export declare const getNodeKey: (key: TreeKey, data: TreeNodeData) => any;
-export declare const handleCurrentChange: (store: RootTreeType['store'], emit: SetupContext['emit'], setCurrent: () => void) => void;
+export declare const handleCurrentChange: (store: RootTreeType["store"], emit: SetupContext["emit"], setCurrent: () => void) => void;

package/es/components/tree/tree-node-content.vue.d.ts

@@ -1,14 +1,14 @@
-declare const _default: import("vue").DefineComponent<{
+declare const _default: import("vue").DefineComponent<import("vue").ExtractPropTypes<{
     node: {
         type: ObjectConstructor;
         required: true;
     };
     renderContent: FunctionConstructor;
-}, () => any, unknown, {}, {}, import("vue").ComponentOptionsMixin, import("vue").ComponentOptionsMixin, {}, string, import("vue").PublicProps, Readonly<import("vue").ExtractPropTypes<{
+}>, () => any, {}, {}, {}, import("vue").ComponentOptionsMixin, import("vue").ComponentOptionsMixin, {}, string, import("vue").PublicProps, Readonly<import("vue").ExtractPropTypes<{
     node: {
         type: ObjectConstructor;
         required: true;
     };
     renderContent: FunctionConstructor;
-}>>, {}, {}>;
+}>> & Readonly<{}>, {}, {}, {}, {}, string, import("vue").ComponentProvideOptions, true, {}, any>;
 export default _default;