ep-craft 0.1.7 → 0.1.9

package/dist/node_modules/element-plus/es/components/tree/src/model/node.js

@@ -0,0 +1,245 @@
+import { isBoolean as x, isUndefined as o } from "../../../../utils/types.js";
+import { hasOwn as m, isArray as c, isFunction as D, isString as S } from "../../../../../../@vue/shared/dist/shared.esm-bundler.js";
+import { markNodeData as C, NODE_KEY as b } from "./util.js";
+import { reactive as w } from "vue";
+import z from "../../../../../../lodash-es/isNil.js";
+const v = (a) => {
+  let e = !0, t = !0, s = !0, i = !0;
+  for (let h = 0, d = a.length; h < d; h++) {
+    const r = a[h];
+    (r.checked !== !0 || r.indeterminate) && (e = !1, r.disabled || (s = !1)), (r.checked !== !1 || r.indeterminate) && (t = !1), r.isEffectivelyChecked || (i = !1);
+  }
+  return {
+    all: e,
+    none: t,
+    allWithoutDisable: s,
+    half: !e && !t,
+    isEffectivelyChecked: i
+  };
+}, n = function(a) {
+  if (a.childNodes.length === 0 || a.loading) {
+    a.isEffectivelyChecked = a.disabled || a.checked;
+    return;
+  }
+  const { all: e, none: t, half: s, isEffectivelyChecked: i } = v(a.childNodes);
+  a.isEffectivelyChecked = i, e ? (a.checked = !0, a.indeterminate = !1) : s ? (a.checked = !1, a.indeterminate = !0) : t && (a.checked = !1, a.indeterminate = !1);
+  const h = a.parent;
+  !h || h.level === 0 || a.store.checkStrictly || n(h);
+}, u = function(a, e) {
+  const t = a.store.props, s = a.data || {}, i = t[e];
+  if (D(i)) return i(s, a);
+  if (S(i)) return s[i];
+  if (o(i)) {
+    const h = s[e];
+    return o(h) ? "" : h;
+  }
+}, N = function(a, e) {
+  a.forEach((t) => {
+    t.canFocus = e, N(t.childNodes, e);
+  });
+};
+let O = 0;
+var U = class p {
+  constructor(e) {
+    this.isLeafByUser = void 0, this.isLeaf = void 0, this.isEffectivelyChecked = !1, this.id = O++, 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) 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() {
+    var h;
+    const e = this.store;
+    if (!e) throw new Error("[Node]store is required!");
+    e.registerNode(this);
+    const t = e.props;
+    if (t && typeof t.isLeaf < "u") {
+      const d = u(this, "isLeaf");
+      x(d) && (this.isLeafByUser = d);
+    }
+    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.isLeafByUser && this.expand(), c(this.data) || C(this, this.data), !this.data) return;
+    const s = e.defaultExpandedKeys, i = e.key;
+    i && !z(this.key) && s && s.includes(this.key) && this.expand(null, e.autoExpandParent), i && e.currentNodeKey !== void 0 && this.key === e.currentNodeKey && (e.currentNode && (e.currentNode.isCurrent = !1), e.currentNode = this, e.currentNode.isCurrent = !0), e.lazy && e._initDefaultCheckedNode(this), this.updateLeafState(), (this.level === 1 || ((h = this.parent) == null ? void 0 : h.expanded) === !0) && (this.canFocus = !0);
+  }
+  setData(e) {
+    c(e) || C(this, e), this.data = e, this.childNodes = [];
+    let t;
+    this.level === 0 && c(this.data) ? t = this.data : t = u(this, "children") || [];
+    for (let s = 0, i = t.length; s < i; s++) this.insertChild({ data: t[s] });
+  }
+  get label() {
+    return u(this, "label");
+  }
+  get key() {
+    const e = this.store.key;
+    return this.data ? this.data[e] : null;
+  }
+  get disabled() {
+    return u(this, "disabled");
+  }
+  get nextSibling() {
+    const e = this.parent;
+    if (e) {
+      const t = e.childNodes.indexOf(this);
+      if (t > -1) return e.childNodes[t + 1];
+    }
+    return null;
+  }
+  get previousSibling() {
+    const e = this.parent;
+    if (e) {
+      const t = e.childNodes.indexOf(this);
+      if (t > -1) return t > 0 ? e.childNodes[t - 1] : null;
+    }
+    return null;
+  }
+  contains(e, t = !0) {
+    return (this.childNodes || []).some((s) => s === e || t && s.contains(e));
+  }
+  remove() {
+    const e = this.parent;
+    e && e.removeChild(this);
+  }
+  insertChild(e, t, s) {
+    if (!e) throw new Error("InsertChild error: child is required.");
+    if (!(e instanceof p)) {
+      if (!s) {
+        const i = this.getChildren(!0);
+        i != null && i.includes(e.data) || (o(t) || t < 0 ? i == null || i.push(e.data) : i == null || i.splice(t, 0, e.data));
+      }
+      Object.assign(e, {
+        parent: this,
+        store: this.store
+      }), e = w(new p(e)), e instanceof p && e.initialize();
+    }
+    e.level = this.level + 1, o(t) || t < 0 ? this.childNodes.push(e) : this.childNodes.splice(t, 0, e), this.updateLeafState();
+  }
+  insertBefore(e, t) {
+    let s;
+    t && (s = this.childNodes.indexOf(t)), this.insertChild(e, s);
+  }
+  insertAfter(e, t) {
+    let s;
+    t && (s = this.childNodes.indexOf(t), s !== -1 && (s += 1)), this.insertChild(e, s);
+  }
+  removeChild(e) {
+    const t = this.getChildren() || [], s = t.indexOf(e.data);
+    s > -1 && t.splice(s, 1);
+    const i = this.childNodes.indexOf(e);
+    i > -1 && (this.store && this.store.deregisterNode(e), e.parent = null, this.childNodes.splice(i, 1)), this.updateLeafState();
+  }
+  removeChildByData(e) {
+    const t = this.childNodes.find((s) => s.data === e);
+    t && this.removeChild(t);
+  }
+  expand(e, t) {
+    const s = () => {
+      if (t) {
+        let i = this.parent;
+        for (; i && i.level > 0; )
+          i.expanded = !0, i = i.parent;
+      }
+      this.expanded = !0, e && e(), N(this.childNodes, !0);
+    };
+    this.shouldLoadData() ? this.loadData((i) => {
+      c(i) && (this.store.checkStrictly || (this.checked ? this.setChecked(!0, !0) : n(this)), s());
+    }) : s();
+  }
+  doCreateChildren(e, t = {}) {
+    e.forEach((s) => {
+      this.insertChild(Object.assign({ data: s }, t), void 0, !0);
+    });
+  }
+  collapse() {
+    this.expanded = !1, N(this.childNodes, !1);
+  }
+  shouldLoadData() {
+    return !!(this.store.lazy === !0 && this.store.load && !this.loaded);
+  }
+  updateLeafState() {
+    if (this.store.lazy === !0 && this.loaded !== !0 && typeof this.isLeafByUser < "u") {
+      this.isLeaf = this.isLeafByUser, this.isEffectivelyChecked = this.isLeaf && this.disabled;
+      return;
+    }
+    const e = this.childNodes;
+    if (!this.store.lazy || this.store.lazy === !0 && this.loaded === !0) {
+      this.isLeaf = !e || e.length === 0, this.isEffectivelyChecked = this.isLeaf && this.disabled;
+      return;
+    }
+    this.isLeaf = !1;
+  }
+  setChecked(e, t, s, i) {
+    if (this.indeterminate = e === "half", this.checked = e === !0, this.isEffectivelyChecked = !this.childNodes.length && (this.disabled || this.checked), this.store.checkStrictly && !t) return;
+    if (!(this.shouldLoadData() && !this.store.checkDescendants)) {
+      const d = () => {
+        if (t) {
+          const r = this.childNodes;
+          for (let y = 0, E = r.length; y < E; y++) {
+            const f = r[y];
+            i = i || e !== !1;
+            const L = f.disabled && f.isLeaf ? f.checked : i;
+            f.setChecked(L, t, !0, i);
+          }
+          const { half: l, all: k, isEffectivelyChecked: g } = v(r);
+          k || (this.checked = k, this.indeterminate = l), this.isEffectivelyChecked = this.childNodes.length ? g : this.disabled || this.checked;
+        }
+      };
+      if (this.shouldLoadData()) {
+        this.loadData(() => {
+          d(), n(this);
+        }, { checked: e !== !1 });
+        return;
+      } else d();
+    }
+    const h = this.parent;
+    !h || h.level === 0 || !s && !this.store.checkStrictly && n(h);
+  }
+  getChildren(e = !1) {
+    if (this.level === 0) return this.data;
+    const t = this.data;
+    if (!t) return null;
+    const s = this.store.props;
+    let i = "children";
+    return s && (i = s.children || "children"), o(t[i]) && (t[i] = null), e && !t[i] && (t[i] = []), t[i];
+  }
+  updateChildren() {
+    const e = this.getChildren() || [], t = this.childNodes.map((h) => h.data), s = {}, i = [];
+    e.forEach((h, d) => {
+      const r = h[b];
+      r && t.some((l) => (l == null ? void 0 : l.$treeNodeId) === r) ? s[r] = {
+        index: d,
+        data: h
+      } : i.push({
+        index: d,
+        data: h
+      });
+    }), this.store.lazy || t.forEach((h) => {
+      s[h == null ? void 0 : h.$treeNodeId] || this.removeChildByData(h);
+    }), i.forEach(({ index: h, data: d }) => {
+      this.insertChild({ data: d }, h);
+    }), this.updateLeafState();
+  }
+  loadData(e, t = {}) {
+    if (this.store.lazy === !0 && this.store.load && !this.loaded && (!this.loading || Object.keys(t).length)) {
+      this.loading = !0;
+      const s = (h) => {
+        this.childNodes = [], this.doCreateChildren(h, t), this.loaded = !0, this.loading = !1, this.updateLeafState(), e && e.call(this, h);
+      }, i = () => {
+        this.loading = !1;
+      };
+      this.store.load(this, s, i);
+    } else e && e.call(this);
+  }
+  eachNode(e) {
+    const t = [this];
+    for (; t.length; ) {
+      const s = t.shift();
+      t.unshift(...s.childNodes), e(s);
+    }
+  }
+  reInitChecked() {
+    this.store.checkStrictly || n(this);
+  }
+};
+export {
+  U as default,
+  v as getChildState
+};

package/dist/node_modules/element-plus/es/components/tree/src/model/tree-store.js

@@ -0,0 +1,208 @@
+import { isPropAbsent as N } from "../../../../utils/types.js";
+import { hasOwn as k, NOOP as p, isObject as g } from "../../../../../../@vue/shared/dist/shared.esm-bundler.js";
+import { getNodeKey as K } from "./util.js";
+import C from "./node.js";
+import { nextTick as m } from "vue";
+import y from "../../../../../../lodash-es/isNil.js";
+var D = class {
+  constructor(e) {
+    this.lazy = !1, this.checkStrictly = !1, this.autoExpandParent = !1, this.defaultExpandAll = !1, this.checkDescendants = !1, this.currentNode = null, this.currentNodeKey = null;
+    for (const t in e) k(e, t) && (this[t] = e[t]);
+    this.nodesMap = {};
+  }
+  initialize() {
+    if (this.root = new C({
+      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();
+      }, p);
+    } else this._initDefaultCheckedNodes();
+  }
+  filter(e) {
+    const t = this.filterNodeMethod, s = this.lazy, i = async function(r) {
+      const d = r.root ? r.root.childNodes : r.childNodes;
+      for (const [n, o] of d.entries())
+        o.visible = !!(t != null && t.call(o, e, o.data, o)), n % 80 === 0 && n > 0 && await m(), await i(o);
+      if (!r.visible && d.length) {
+        let n = !0;
+        n = !d.some((o) => o.visible), r.root ? r.root.visible = n === !1 : r.visible = n === !1;
+      }
+      e && r.visible && !r.isLeaf && (!s || r.loaded) && r.expand();
+    };
+    i(this);
+  }
+  setData(e) {
+    e !== this.root.data ? (this.nodesMap = {}, this.root.setData(e), this._initDefaultCheckedNodes(), this.setCurrentNodeKey(this.currentNodeKey)) : this.root.updateChildren();
+  }
+  getNode(e) {
+    if (e instanceof C) return e;
+    const t = g(e) ? K(this.key, e) : e;
+    return this.nodesMap[t] || null;
+  }
+  insertBefore(e, t) {
+    var i;
+    const s = this.getNode(t);
+    (i = s.parent) == null || i.insertBefore({ data: e }, s);
+  }
+  insertAfter(e, t) {
+    var i;
+    const s = this.getNode(t);
+    (i = s.parent) == null || i.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 = N(t) ? this.root : this.getNode(t);
+    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) {
+    const t = this.defaultCheckedKeys || [];
+    !y(e.key) && t.includes(e.key) && e.setChecked(!0, !this.checkStrictly);
+  }
+  setDefaultCheckedKey(e) {
+    e !== this.defaultCheckedKeys && (this.defaultCheckedKeys = e, this._initDefaultCheckedNodes());
+  }
+  registerNode(e) {
+    const t = this.key;
+    if (!(!e || !e.data))
+      if (!t) this.nodesMap[e.id] = e;
+      else {
+        const s = e.key;
+        y(s) || (this.nodesMap[s] = e);
+      }
+  }
+  deregisterNode(e) {
+    !this.key || !e || !e.data || (e.childNodes.forEach((t) => {
+      this.deregisterNode(t);
+    }), delete this.nodesMap[e.key]);
+  }
+  getCheckedNodes(e = !1, t = !1) {
+    const s = [], i = function(r) {
+      (r.root ? r.root.childNodes : r.childNodes).forEach((d) => {
+        (d.checked || t && d.indeterminate) && (!e || e && d.isLeaf) && s.push(d.data), i(d);
+      });
+    };
+    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((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) k(t, s) && e.push(t[s]);
+    return e;
+  }
+  updateChildren(e, t) {
+    const s = this.nodesMap[e];
+    if (!s) return;
+    const i = s.childNodes;
+    for (let r = i.length - 1; r >= 0; r--) {
+      const d = i[r];
+      this.remove(d.data);
+    }
+    for (let r = 0, d = t.length; r < d; r++) {
+      const n = t[r];
+      this.append(n, s.data);
+    }
+  }
+  _setCheckedKeys(e, t = !1, s) {
+    const i = this._getAllNodes().sort((o, c) => o.level - c.level), r = /* @__PURE__ */ Object.create(null), d = Object.keys(s);
+    i.forEach((o) => o.setChecked(!1, !1));
+    const n = (o) => {
+      o.childNodes.forEach((c) => {
+        var h;
+        r[c.data[e]] = !0, (h = c.childNodes) != null && h.length && n(c);
+      });
+    };
+    for (let o = 0, c = i.length; o < c; o++) {
+      const h = i[o], l = h.data[e].toString();
+      if (!d.includes(l)) {
+        h.checked && !r[l] && h.setChecked(!1, !1);
+        continue;
+      }
+      if (h.childNodes.length && n(h), h.isLeaf || this.checkStrictly) {
+        h.setChecked(!0, !1);
+        continue;
+      }
+      if (h.setChecked(!0, !0), t) {
+        h.setChecked(!1, !1, !0);
+        const f = function(u) {
+          u.childNodes.forEach((a) => {
+            a.isLeaf || a.setChecked(!1, !1, !0), f(a);
+          }), u.reInitChecked();
+        };
+        f(h);
+      }
+    }
+  }
+  setCheckedNodes(e, t = !1) {
+    const s = this.key, i = {};
+    e.forEach((r) => {
+      i[(r || {})[s]] = !0;
+    }), this._setCheckedKeys(s, t, i);
+  }
+  setCheckedKeys(e, t = !1) {
+    this.defaultCheckedKeys = e;
+    const s = this.key, i = {};
+    e.forEach((r) => {
+      i[r] = !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) {
+    var r;
+    const s = e[this.key], i = this.nodesMap[s];
+    this.setCurrentNode(i), t && this.currentNode && this.currentNode.level > 1 && ((r = this.currentNode.parent) == null || r.expand(null, !0));
+  }
+  setCurrentNodeKey(e, t = !0) {
+    var i;
+    if (this.currentNodeKey = e, N(e)) {
+      this.currentNode && (this.currentNode.isCurrent = !1), this.currentNode = null;
+      return;
+    }
+    const s = this.getNode(e);
+    s && (this.setCurrentNode(s), t && this.currentNode && this.currentNode.level > 1 && ((i = this.currentNode.parent) == null || i.expand(null, !0)));
+  }
+};
+export {
+  D as default
+};

package/dist/node_modules/element-plus/es/components/tree/src/model/useDragNode.js

@@ -0,0 +1,61 @@
+import { isFunction as S } from "../../../../../../@vue/shared/dist/shared.esm-bundler.js";
+import { removeClass as I, addClass as $ } from "../../../../utils/dom/style.js";
+import { useNamespace as k } from "../../../../hooks/use-namespace/index.js";
+import { ref as A, provide as B } from "vue";
+const x = Symbol("dragEvents");
+function G({ props: p, ctx: f, el$: h, dropIndicator$: E, store: c }) {
+  const u = k("tree"), d = A({
+    showDropIndicator: !1,
+    draggingNode: null,
+    dropNode: null,
+    allowDrop: !0,
+    dropType: null
+  });
+  return B(x, {
+    treeNodeDragStart: ({ event: o, treeNode: r }) => {
+      if (o.dataTransfer) {
+        if (S(p.allowDrag) && !p.allowDrag(r.node))
+          return o.preventDefault(), !1;
+        o.dataTransfer.effectAllowed = "move";
+        try {
+          o.dataTransfer.setData("text/plain", "");
+        } catch {
+        }
+        d.value.draggingNode = r, f.emit("node-drag-start", r.node, o);
+      }
+    },
+    treeNodeDragOver: ({ event: o, treeNode: r }) => {
+      if (!o.dataTransfer) return;
+      const e = r, n = d.value.dropNode;
+      n && n.node.id !== e.node.id && I(n.$el, u.is("drop-inner"));
+      const t = d.value.draggingNode;
+      if (!t || !e) return;
+      let l = !0, a = !0, i = !0, g = !0;
+      S(p.allowDrop) && (l = p.allowDrop(t.node, e.node, "prev"), g = a = p.allowDrop(t.node, e.node, "inner"), i = p.allowDrop(t.node, e.node, "next")), o.dataTransfer.dropEffect = a || l || i ? "move" : "none", (l || a || i) && (n == null ? void 0 : n.node.id) !== e.node.id && (n && f.emit("node-drag-leave", t.node, n.node, o), f.emit("node-drag-enter", t.node, e.node, o)), l || a || i ? d.value.dropNode = e : d.value.dropNode = null, e.node.nextSibling === t.node && (i = !1), e.node.previousSibling === t.node && (l = !1), e.node.contains(t.node, !1) && (a = !1), (t.node === e.node || t.node.contains(e.node)) && (l = !1, a = !1, i = !1);
+      const N = e.$el, v = N.querySelector(`.${u.be("node", "content")}`).getBoundingClientRect(), m = h.value.getBoundingClientRect(), w = h.value.scrollTop;
+      let s;
+      const C = l ? a ? 0.25 : i ? 0.45 : 1 : Number.NEGATIVE_INFINITY, P = i ? a ? 0.75 : l ? 0.55 : 0 : Number.POSITIVE_INFINITY;
+      let D = -9999;
+      const y = o.clientY - v.top;
+      y < v.height * C ? s = "before" : y > v.height * P ? s = "after" : a ? s = "inner" : s = "none";
+      const T = N.querySelector(`.${u.be("node", "expand-icon")}`).getBoundingClientRect(), b = E.value;
+      s === "before" ? D = T.top - m.top + w : s === "after" && (D = T.bottom - m.top + w), b.style.top = `${D}px`, b.style.left = `${T.right - m.left}px`, s === "inner" ? $(N, u.is("drop-inner")) : I(N, u.is("drop-inner")), d.value.showDropIndicator = s === "before" || s === "after", d.value.allowDrop = d.value.showDropIndicator || g, d.value.dropType = s, f.emit("node-drag-over", t.node, e.node, o);
+    },
+    treeNodeDragEnd: (o) => {
+      var t, l;
+      const { draggingNode: r, dropType: e, dropNode: n } = d.value;
+      if (o.preventDefault(), o.dataTransfer && (o.dataTransfer.dropEffect = "move"), r != null && r.node.data && n) {
+        const a = { data: r.node.data };
+        e !== "none" && r.node.remove(), e === "before" ? (t = n.node.parent) == null || t.insertBefore(a, n.node) : e === "after" ? (l = n.node.parent) == null || l.insertAfter(a, n.node) : e === "inner" && n.node.insertChild(a), e !== "none" && (c.value.registerNode(a), c.value.key && r.node.eachNode((i) => {
+          var g;
+          (g = c.value.nodesMap[i.data[c.value.key]]) == null || g.setChecked(i.checked, !c.value.checkStrictly);
+        })), I(n.$el, u.is("drop-inner")), f.emit("node-drag-end", r.node, n.node, e, o), e !== "none" && f.emit("node-drop", r.node, n.node, e, o);
+      }
+      r && !n && f.emit("node-drag-end", r.node, null, e, o), d.value.showDropIndicator = !1, d.value.draggingNode = null, d.value.dropNode = null, d.value.allowDrop = !0;
+    }
+  }), { dragState: d };
+}
+export {
+  x as dragEventsKey,
+  G as useDragNodeHandler
+};

package/dist/node_modules/element-plus/es/components/tree/src/model/useKeydown.js

@@ -0,0 +1,75 @@
+import { EVENT_CODE as i } from "../../../../constants/aria.js";
+import { getEventCode as m } from "../../../../utils/dom/event.js";
+import { useNamespace as b } from "../../../../hooks/use-namespace/index.js";
+import { useEventListener as h } from "../../../../../../@vueuse/core/dist/index.js";
+import { onMounted as y, onUpdated as x } from "vue";
+function w({ el$: u }, f) {
+  const l = b("tree");
+  y(() => {
+    p();
+  }), x(() => {
+    var r;
+    (r = u.value) == null || r.querySelectorAll("input[type=checkbox]").forEach((o) => {
+      o.setAttribute("tabindex", "-1");
+    });
+  });
+  function s(r, o) {
+    var t, c;
+    const n = f.value.getNode(r[o].dataset.key);
+    return n.canFocus && n.visible && (((t = n.parent) == null ? void 0 : t.expanded) || ((c = n.parent) == null ? void 0 : c.level) === 0);
+  }
+  h(u, "keydown", (r) => {
+    const o = r.target;
+    if (!o.className.includes(l.b("node"))) return;
+    const n = m(r), t = Array.from(u.value.querySelectorAll(`.${l.is("focusable")}[role=treeitem]`)), c = t.indexOf(o);
+    let e;
+    if ([i.up, i.down].includes(n)) {
+      if (r.preventDefault(), n === i.up) {
+        e = c === -1 ? 0 : c !== 0 ? c - 1 : t.length - 1;
+        const a = e;
+        for (; !s(t, e); ) {
+          if (e--, e === a) {
+            e = -1;
+            break;
+          }
+          e < 0 && (e = t.length - 1);
+        }
+      } else {
+        e = c === -1 ? 0 : c < t.length - 1 ? c + 1 : 0;
+        const a = e;
+        for (; !s(t, e); ) {
+          if (e++, e === a) {
+            e = -1;
+            break;
+          }
+          e >= t.length && (e = 0);
+        }
+      }
+      e !== -1 && t[e].focus();
+    }
+    [i.left, i.right].includes(n) && (r.preventDefault(), o.click());
+    const d = o.querySelector('[type="checkbox"]');
+    [
+      i.enter,
+      i.numpadEnter,
+      i.space
+    ].includes(n) && d && (r.preventDefault(), d.click());
+  });
+  const p = () => {
+    var n;
+    if (!u.value) return;
+    const r = Array.from(u.value.querySelectorAll(`.${l.is("focusable")}[role=treeitem]`));
+    Array.from(u.value.querySelectorAll("input[type=checkbox]")).forEach((t) => {
+      t.setAttribute("tabindex", "-1");
+    });
+    const o = u.value.querySelectorAll(`.${l.is("checked")}[role=treeitem]`);
+    if (o.length) {
+      o[0].setAttribute("tabindex", "0");
+      return;
+    }
+    (n = r[0]) == null || n.setAttribute("tabindex", "0");
+  };
+}
+export {
+  w as useKeydown
+};

package/dist/node_modules/element-plus/es/components/tree/src/model/useNodeExpandEventBroadcast.js

@@ -0,0 +1,21 @@
+import { TREE_NODE_MAP_INJECTION_KEY as t } from "../tokens.js";
+import { inject as c, onBeforeUnmount as i, provide as a } from "vue";
+function E(o) {
+  const n = c(t, null);
+  let e = {
+    treeNodeExpand: (r) => {
+      var d;
+      o.node !== r && ((d = o.node) == null || d.collapse());
+    },
+    children: /* @__PURE__ */ new Set()
+  };
+  return n && n.children.add(e), i(() => {
+    n && n.children.delete(e), e = null;
+  }), a(t, e), { broadcastExpanded: (r) => {
+    if (o.accordion)
+      for (const d of e.children) d.treeNodeExpand(r);
+  } };
+}
+export {
+  E as useNodeExpandEventBroadcast
+};

package/dist/node_modules/element-plus/es/components/tree/src/model/util.js

@@ -0,0 +1,19 @@
+const u = "$treeNodeId", c = function(r, e) {
+  !e || e.$treeNodeId || Object.defineProperty(e, u, {
+    value: r.id,
+    enumerable: !1,
+    configurable: !1,
+    writable: !1
+  });
+}, l = (r, e) => e == null ? void 0 : e[r || "$treeNodeId"], d = (r, e, o) => {
+  const t = r.value.currentNode;
+  o();
+  const n = r.value.currentNode;
+  t !== n && e("current-change", n ? n.data : null, n);
+};
+export {
+  u as NODE_KEY,
+  l as getNodeKey,
+  d as handleCurrentChange,
+  c as markNodeData
+};

package/dist/node_modules/element-plus/es/components/tree/src/tokens.js

@@ -0,0 +1,6 @@
+const E = "RootTree", N = "NodeInstance", _ = "TreeNodeMap";
+export {
+  N as NODE_INSTANCE_INJECTION_KEY,
+  E as ROOT_TREE_INJECTION_KEY,
+  _ as TREE_NODE_MAP_INJECTION_KEY
+};

package/dist/node_modules/element-plus/es/components/tree/src/tree-node-content.js

@@ -0,0 +1,5 @@
+import e from "./tree-node-content.vue_vue_type_script_lang.js";
+var _ = e;
+export {
+  _ as default
+};

package/dist/node_modules/element-plus/es/components/tree/src/tree-node-content.vue_vue_type_script_lang.js

@@ -0,0 +1,36 @@
+import { useNamespace as _ } from "../../../hooks/use-namespace/index.js";
+import { ElText as l } from "../../text/index.js";
+import { NODE_INSTANCE_INJECTION_KEY as u, ROOT_TREE_INJECTION_KEY as m } from "./tokens.js";
+import { defineComponent as p, inject as r, h as o, renderSlot as E } from "vue";
+var T = p({
+  name: "ElTreeNodeContent",
+  props: {
+    node: {
+      type: Object,
+      required: !0
+    },
+    renderContent: Function
+  },
+  setup(t) {
+    const a = _("tree"), d = r(u), s = r(m);
+    return () => {
+      const e = t.node, { data: n, store: c } = e;
+      return t.renderContent ? t.renderContent(o, {
+        _self: d,
+        node: e,
+        data: n,
+        store: c
+      }) : E(s.ctx.slots, "default", {
+        node: e,
+        data: n
+      }, () => [o(l, {
+        tag: "span",
+        truncated: !0,
+        class: a.be("node", "label")
+      }, () => [e.label])]);
+    };
+  }
+});
+export {
+  T as default
+};