@unicom-cloud/ui 0.8.90 → 0.8.91

package/tree/Tree.js

@@ -1,19 +1,593 @@
-import "react/jsx-runtime";
-import "react";
-import "@unicom-cloud/utils/is";
-import "lodash/get";
-import "lodash/has";
-import "lodash/isArray";
-import "lodash/isEqualWith";
-import "lodash/isFunction";
-import "lodash/isUndefined";
-import "../chunk/B44Hj5ad.js";
-import "@unicom-cloud/utils/class-name";
-import "../chunk/ClqoGc3r.js";
-import "./Context.js";
-import { N as T, w as b } from "../chunk/BbQEqpOn.js";
-import "./util.js";
+import { jsx as re } from "react/jsx-runtime";
+import { forwardRef as Se, useContext as ve, useRef as S, useState as Te, useImperativeHandle as Ae, useEffect as z, createElement as Ie } from "react";
+import { isEmptyObject as Me } from "@unicom-cloud/utils/is";
+import D from "lodash/get";
+import B from "lodash/has";
+import He from "lodash/isArray";
+import E from "lodash/isEqualWith";
+import $e from "lodash/isFunction";
+import se from "lodash/isUndefined";
+import "../config-provider/ConfigProvider.js";
+import le from "@unicom-cloud/utils/class-name";
+import { pickDataAttributes as We } from "../components/common/utils/pick.js";
+import { TreeContext as Re } from "./Context.js";
+import de from "./Node.js";
+import je from "./NodeList.js";
+import { getTreeDataFromTreeChildren as Fe, getCheckedKeysByInitKeys as ze, getAllCheckedKeysByCheck as Be } from "./util.js";
+import qe from "../config-provider/context.js";
+const ie = {
+  key: "key",
+  title: "title",
+  children: "children",
+  selectable: "selectable",
+  disabled: "disabled",
+  disableCheckbox: "disableCheckbox",
+  checkable: "checkable",
+  isLeaf: "isLeaf"
+}, oe = "parent", ae = "all", ye = "child", Ue = {
+  selectable: !0,
+  autoExpandParent: !0,
+  checkedStrategy: ae,
+  actionOnClick: "select",
+  allowDrop: () => !0,
+  fieldNames: ie,
+  animation: !0
+}, Ve = [
+  "style",
+  "className",
+  "height",
+  "size",
+  "blockNode",
+  "autoExpandParent",
+  "checkedStrategy",
+  "fieldNames",
+  "icons",
+  "virtualListProps",
+  "showLine",
+  "selectable",
+  "allowDrop",
+  "actionOnClick",
+  "animation"
+];
+function Ge(r, ue) {
+  const g = ve(qe), q = S(null), f = S({}), _ = S(), T = S(), M = S(), [o, k] = Te(() => {
+    var l;
+    const e = H(), t = $(e, (l = g.getPrefixCls) == null ? void 0 : l.call(g, "tree")), { checkedKeys: c, halfCheckedKeys: n } = W(
+      r.checkedKeys || r.defaultCheckedKeys || []
+    );
+    return {
+      selectedKeys: r.selectedKeys || r.defaultSelectedKeys || [],
+      checkedKeys: c,
+      halfCheckedKeys: n,
+      expandedKeys: V(
+        r.expandedKeys || r.defaultExpandedKeys
+      ),
+      loadedKeys: [],
+      loadingKeys: [],
+      currentExpandKeys: [],
+      nodeList: t
+    };
+  });
+  function C(e) {
+    const { componentConfig: t } = g ?? {}, c = e || r, n = (t == null ? void 0 : t.Tree) || {}, l = {};
+    return Ve.forEach((s) => {
+      se(c[s]) ? se(n[s]) ? l[s] = Ue[s] : l[s] = n[s] : l[s] = c[s];
+    }), l;
+  }
+  function fe(e, t) {
+    let c = e;
+    t && (c = t._key), M.current && M.current.scrollIntoView(
+      c,
+      t || f.current[c]
+    );
+  }
+  function H() {
+    return "treeData" in r ? r.treeData : Fe(r.children);
+  }
+  function he(e, t) {
+    const c = [
+      "fieldNames",
+      "selectable",
+      "draggable",
+      "checkStrictly",
+      "showLine",
+      "blockNode",
+      "checkable",
+      "treeData",
+      "children"
+    ];
+    return e.treeData !== t.treeData || e.children !== t.children || c.some((n) => E(e[n], t[n]));
+  }
+  function U(e) {
+    const t = C(), { selectable: c } = t, n = {
+      ...ie,
+      ..."treeData" in r ? t.fieldNames : {}
+    }, l = {
+      children: D(e, n.children),
+      selectable: B(e, n.selectable) ? D(e, n.selectable) : c,
+      checkable: B(e, n.checkable) ? D(e, n.checkable) : r.checkable,
+      title: D(e, n.title),
+      disabled: D(e, n.disabled),
+      disableCheckbox: D(e, n.disableCheckbox),
+      isLeaf: D(e, n.isLeaf),
+      key: D(e, n.key)
+    };
+    return B(e, n.key) || delete l.key, l;
+  }
+  function $(e, t) {
+    var y;
+    f.current = {};
+    const c = t || ((y = g.getPrefixCls) == null ? void 0 : y.call(g, "tree")), n = [];
+    let l = 0;
+    const { showLine: s, blockNode: d } = C(), i = (m, a) => {
+      const x = m.length;
+      return m.map((h, N) => {
+        const {
+          children: u,
+          selectable: L,
+          checkable: P,
+          key: b = `${(a == null ? void 0 : a._key) || ""}-${N}`,
+          ...Pe
+        } = U(h), w = {
+          // data 中含有 dataRef 时，优先级较高
+          dataRef: h,
+          draggable: r.draggable,
+          selectable: L,
+          checkable: P,
+          showLine: s,
+          blockNode: d,
+          ...h,
+          ...Pe,
+          key: b,
+          children: u,
+          _key: b,
+          _index: l++,
+          parentKey: a ? a._key : void 0,
+          pathParentKeys: a && a.pathParentKeys || [],
+          _level: a._level || 0,
+          // 保存node在sowLine模式下是否显示缩进线。如果父节点是其所在层级的最后一个节点，那么所有的子节点（包括孙子节点等）在父节点所在层级的缩进格都不显示缩进线。
+          _lineless: a && a._lineless ? [...a._lineless || [], a._isTail] : []
+        };
+        return x === N + 1 && (w.className = le(
+          `${c}-node-is-tail`,
+          w.className
+        )), n.push(w), f.current[b] = w, u && u.length && (f.current[b].children = i(u, {
+          _key: b,
+          _level: w._level + 1,
+          _lineless: w._lineless,
+          _isTail: x === N + 1,
+          pathParentKeys: [...(a == null ? void 0 : a.pathParentKeys) || [], b]
+        })), w;
+      });
+    };
+    return i(e || [], {}), n;
+  }
+  function V(e) {
+    if (!C().autoExpandParent)
+      return e || [];
+    if (!e)
+      return Object.keys(f.current).filter((c) => {
+        const n = f.current[c];
+        return n.children && n.children.length;
+      });
+    const t = {};
+    return e.forEach((c) => {
+      const n = f.current[c];
+      n && (t[c] = 1, n.pathParentKeys && n.pathParentKeys.forEach((l) => {
+        t[l] = 1;
+      }));
+    }), Object.keys(t);
+  }
+  function W(e) {
+    if (!r.checkStrictly) {
+      const { checkedKeys: t, indeterminateKeys: c } = ze(
+        e,
+        f.current
+      );
+      return {
+        checkedKeys: t,
+        halfCheckedKeys: c
+      };
+    }
+    return {
+      checkedKeys: e,
+      halfCheckedKeys: r.halfCheckedKeys || []
+    };
+  }
+  function Ke(e, t) {
+    var l;
+    const { onSelect: c } = r, n = {
+      e: t,
+      data: (l = f.current[e]) == null ? void 0 : l.dataRef,
+      // 潘启宝添加
+      node: K([e])[0]
+    };
+    if (r.multiple) {
+      const s = [...o.selectedKeys], d = s.indexOf(e);
+      d > -1 ? (s.splice(d, 1), n.selected = !1) : (n.selected = !0, s.push(e)), n.selectedNodes = K(s), "selectedKeys" in r || k((i) => {
+        const y = { ...i };
+        return y.selectedKeys = s, y;
+      }), c == null || c(s, n);
+    } else
+      n.selected = !0, n.selectedNodes = K([e]), "selectedKeys" in r || k((s) => {
+        const d = { ...s };
+        return d.selectedKeys = [e], d;
+      }), c == null || c([e], n);
+  }
+  function G(e, t, c) {
+    const { checkedStrategy: n } = C(), { onCheck: l, checkStrictly: s } = r, d = { e: c, node: K([t])[0] };
+    let i = [...o.checkedKeys || []], y = o.halfCheckedKeys;
+    if (s) {
+      e ? i = i.concat(t) : i = i.filter((a) => a !== t);
+      const m = {};
+      "checkedKeys" in r || (m.checkedKeys = i), "halfCheckedKeys" in r || (m.halfCheckedKeys = y), Me(m) || k((a) => ({ ...a, ...m }));
+    } else {
+      const { checkedKeys: m, indeterminateKeys: a } = Be(
+        t,
+        e,
+        i,
+        f.current,
+        y
+      );
+      i = m, y = a, "checkedKeys" in r ? k((x) => {
+        const h = { ...x };
+        return h.halfCheckedKeys = y, h;
+      }) : k((x) => {
+        const h = { ...x };
+        return h.checkedKeys = i, h.halfCheckedKeys = y, h;
+      }), n === oe ? i = i.filter((x) => {
+        const h = f.current[x];
+        if (!h || i.indexOf(h.parentKey) === -1)
+          return !0;
+      }) : n === ye && (i = i.filter((x) => {
+        var N, u;
+        const h = f.current[x];
+        if (!h || !((N = h.children) != null && N.length) || (u = h.children) != null && u.every((L) => i.indexOf(L._key) === -1))
+          return !0;
+      }));
+    }
+    l == null || l(i, {
+      checkedNodes: K(i),
+      checked: e,
+      halfCheckedKeys: y,
+      halfCheckedNodes: K(y),
+      ...d
+    });
+  }
+  function ke(e) {
+    if ($e(r.loadMore)) {
+      const { loadingKeys: t = [], loadedKeys: c } = o;
+      k((n) => {
+        const l = { ...n };
+        return l.loadingKeys = Array.from(/* @__PURE__ */ new Set([...t, e._key])), l.loadedKeys = c.filter((s) => s !== e._key), l;
+      }), I == null || I(K([e._key])[0]).then((n) => {
+        k((l) => {
+          const s = { ...l };
+          return s.loadingKeys = l.loadingKeys.filter((d) => d !== e._key), s.loadedKeys = Array.from(/* @__PURE__ */ new Set([...l.loadedKeys, e._key])), s;
+        }), R(!e.expanded, e._key);
+      }).catch((n) => {
+        k((l) => {
+          const s = { ...l };
+          return s.loadingKeys = l.loadingKeys.filter((d) => d !== e._key), s;
+        }), console.error("[tree]load data error: ", n);
+      }).finally(() => {
+      });
+    }
+  }
+  function me(e, t) {
+    _.current = K([t._key])[0], T.current = 0;
+    const { onDragStart: c } = r;
+    c == null || c(e, K([t._key])[0]);
+  }
+  function xe(e, t) {
+    _.current = null, T.current = 0;
+    const { onDragEnd: c } = r;
+    c == null || c(e, K([t._key])[0]);
+  }
+  function ge(e, t, c) {
+    T.current = c;
+    const { onDragOver: n } = r;
+    n == null || n(e, K([t._key])[0]);
+  }
+  function Ce(e, t) {
+    T.current = 0;
+    const { onDragLeave: c } = r;
+    c == null || c(e, K([t._key])[0]);
+  }
+  function Ne(e, t) {
+    let c = f.current[e.parentKey];
+    for (; c; ) {
+      const { _key: n, parentKey: l } = c;
+      if (n === t.props._key)
+        return !0;
+      if (l === n)
+        return;
+      c = f.current[l];
+    }
+  }
+  function J(e, t) {
+    if (e === void 0 || t === void 0)
+      return !1;
+    if (e === t)
+      return !0;
+    const c = e.key, n = t.key;
+    if (c !== void 0 || n !== void 0)
+      return c === n;
+    const l = e.props._key, s = t.props._key;
+    return l === void 0 && s === void 0 ? !1 : l === s;
+  }
+  function Q(e, t, c) {
+    if (_.current) {
+      const { allowDrop: n } = C(), { onDrop: l } = r, s = K([t._key])[0];
+      if (l && !Ne(t, _.current) && !J(_.current, s)) {
+        if (n && !n({
+          dropNode: s,
+          dragNode: _.current,
+          dropPosition: c
+        }))
+          return;
+        l({
+          dragNode: _.current,
+          dropNode: s,
+          dropPosition: c,
+          e
+        });
+      }
+    }
+  }
+  function X(e, t) {
+    const { allowDrop: c } = C();
+    let n = !0;
+    return typeof c == "function" && (n = c({
+      dropNode: K([e._key])[0],
+      dragNode: _.current,
+      dropPosition: t
+    })), n;
+  }
+  function R(e, t) {
+    const { currentExpandKeys: c, expandedKeys: n = [] } = o, { animation: l } = C(), { onExpand: s } = r;
+    if (c.indexOf(t) > -1)
+      return;
+    let d = [];
+    e ? d = Array.from(/* @__PURE__ */ new Set([...n, t])) : d = n.filter((i) => i !== t), "expandedKeys" in r || k((i) => {
+      const y = { ...i };
+      return y.expandedKeys = d, y.currentExpandKeys = l ? [...c, t] : [], y;
+    }), s == null || s(d, {
+      expanded: e,
+      node: K([t])[0],
+      expandedNodes: K(d)
+    });
+  }
+  function K(e) {
+    const { __PqbAdapterMode__: t } = r;
+    return A(
+      [].concat(e).map((n) => f.current[n]).filter(Boolean)
+    ).map((n) => t ? {
+      props: n,
+      key: e
+    } : /* @__PURE__ */ Ie(de, { ...n, key: n.key }));
+  }
+  function j(e) {
+    return {
+      expandedKeysSet: (e == null ? void 0 : e.expandedKeysSet) || new Set((o == null ? void 0 : o.expandedKeys) || []),
+      checkedKeysSet: (e == null ? void 0 : e.checkedKeysSet) || new Set((o == null ? void 0 : o.checkedKeys) || []),
+      selectedKeysSet: (e == null ? void 0 : e.selectedKeysSet) || new Set((o == null ? void 0 : o.selectedKeys) || []),
+      halfCheckedKeysSet: (e == null ? void 0 : e.halfCheckedKeysSet) || new Set((o == null ? void 0 : o.halfCheckedKeys) || [])
+    };
+  }
+  function A(e, t) {
+    const { autoExpandParent: c } = C(), { loadMore: n } = r, {
+      selectedKeys: l,
+      expandedKeys: s,
+      checkedKeys: d,
+      loadingKeys: i = [],
+      loadedKeys: y = []
+    } = o, {
+      expandedKeysSet: m,
+      checkedKeysSet: a,
+      selectedKeysSet: x,
+      halfCheckedKeysSet: h
+    } = j(t), N = (u) => {
+      const L = u.children && u.children.length, P = {
+        isLeaf: !L,
+        autoExpandParent: L ? c : !1,
+        expanded: m ? m.has(u._key) : s.indexOf(u._key) > -1
+      };
+      if (n) {
+        const b = y.indexOf(u._key) > -1;
+        P.loaded = b, P.isLeaf = L ? !1 : u.isLeaf;
+      }
+      return {
+        ...u,
+        ...P,
+        selected: x.has(u._key),
+        indeterminated: h.has(u._key),
+        loading: i.indexOf(u._key) > -1,
+        checked: a.has(u._key),
+        selectedKeys: l,
+        checkedKeys: d,
+        loadingKeys: i,
+        loadedKeys: y,
+        expandedKeys: s,
+        childrenData: u.children || [],
+        children: null
+      };
+    };
+    return He(e) ? e.map((u) => N(u)) : N(e);
+  }
+  function Y(e) {
+    k((t) => {
+      const c = { ...t }, { currentExpandKeys: n } = t;
+      return n.indexOf(e) > -1 && (c.currentExpandKeys = n.filter((l, s, d) => l !== e)), c;
+    });
+  }
+  function Z() {
+    return o;
+  }
+  Ae(ue, () => ({
+    scrollIntoView: fe,
+    handleCheck: G,
+    getTreeState: Z,
+    handleExpandEnd: Y,
+    getNodeProps: A,
+    getDataSet: j,
+    getCacheNode: K,
+    handleExpand: R,
+    handleAllowDrop: X,
+    handleNodeDrop: Q,
+    isSameNode: J
+  })), z(() => {
+    const e = q.current, t = C(e), c = C();
+    if (e !== r || !E(t, c)) {
+      const n = {};
+      if (he(
+        { prevMergedProps: t, ...e },
+        { ...c, ...r }
+      )) {
+        const s = H(), d = $(s);
+        n.treeData = s, n.nodeList = d;
+      }
+      if (n.treeData || "checkedKeys" in r && !E(e == null ? void 0 : e.checkedKeys, r.checkedKeys)) {
+        const s = "checkedKeys" in r ? r.checkedKeys : o.checkedKeys, { halfCheckedKeys: d, checkedKeys: i } = W(
+          s || []
+        );
+        E(i, o.checkedKeys) || (n.checkedKeys = i), E(d, o.halfCheckedKeys) || (n.halfCheckedKeys = d);
+      }
+      r.checkStrictly && "halfCheckedKeys" in r && !E(e == null ? void 0 : e.halfCheckedKeys, r.halfCheckedKeys) && (n.halfCheckedKeys = r.halfCheckedKeys), "expandedKeys" in r && !E(r.expandedKeys, e == null ? void 0 : e.expandedKeys) && (n.expandedKeys = r.expandedKeys, n.currentExpandKeys = c.animation ? [...n.expandedKeys ?? [], ...o.expandedKeys ?? []].reduce((s, d) => {
+        const i = s.indexOf(d);
+        return i === -1 ? s.push(d) : s.splice(i, 1), s;
+      }, []).filter((s, d, i) => {
+        var y;
+        if (f.current[s])
+          return f.current[s].pathParentKeys.some((a) => i.indexOf(a) > -1) ? !1 : (y = f.current[s].children) == null ? void 0 : y.length;
+      }) : []);
+      const l = n.currentExpandKeys || o.currentExpandKeys;
+      n.treeData && l && (n.currentExpandKeys = l.filter((s) => {
+        const d = n.treeData.find((i) => i.key === s);
+        return d && d.children && d.children.length;
+      })), Object.keys(n).length && k((s) => ({ ...s, ...n }));
+    }
+    return q.current = r, () => {
+    };
+  }), z(() => ("selectedKeys" in r && !E(r.selectedKeys, o.selectedKeys) && k((e) => {
+    const t = { ...e };
+    return t.selectedKeys = r.selectedKeys || [], t;
+  }), () => {
+  }), [r.selectedKeys, o.selectedKeys]), z(() => {
+    var l;
+    const e = H(), t = $(e, (l = g.getPrefixCls) == null ? void 0 : l.call(g, "tree")), { checkedKeys: c, halfCheckedKeys: n } = W(
+      r.checkedKeys || r.defaultCheckedKeys || []
+    );
+    return k((s) => {
+      let d = { ...s };
+      return d = {
+        ...d,
+        selectedKeys: r.selectedKeys || r.defaultSelectedKeys || [],
+        checkedKeys: c,
+        halfCheckedKeys: n,
+        expandedKeys: V(
+          r.expandedKeys || r.defaultExpandedKeys
+        ),
+        loadedKeys: [],
+        loadingKeys: [],
+        currentExpandKeys: [],
+        nodeList: t
+      }, d;
+    }), () => {
+    };
+  }, []);
+  const {
+    className: _e,
+    showLine: be,
+    size: p,
+    virtualListProps: ee,
+    height: ne,
+    style: De,
+    icons: Ee,
+    actionOnClick: Le,
+    animation: te
+  } = C(), { loadMore: I, checkable: we } = r, ce = ee ? {
+    threshold: 100,
+    ...ee
+  } : ne ? { height: ne, threshold: 100 } : {
+    threshold: null
+  }, { getPrefixCls: F, rtl: Oe } = g, O = F == null ? void 0 : F("tree");
+  return /* @__PURE__ */ re(
+    Re.Provider,
+    {
+      value: {
+        icons: Ee,
+        animation: te,
+        key2nodeProps: f.current,
+        getFieldInfo: U,
+        getTreeState: Z,
+        getNodeProps: A,
+        onExpandEnd: te ? Y : () => {
+        },
+        onSelect: Ke,
+        onCheck: G,
+        onNodeDragStart: me,
+        onNodeDragEnd: xe,
+        onNodeDragLeave: Ce,
+        onNodeDragOver: ge,
+        onNodeDrop: Q,
+        onExpand: R,
+        renderExtra: r.renderExtra,
+        renderTitle: r.renderTitle,
+        loadMore: I && ke,
+        allowDrop: X,
+        actionOnClick: Le,
+        virtualListProps: ce,
+        onNodeClick(e, t, c) {
+          var n;
+          (n = r.onNodeClick) == null || n.call(r, e, t, c);
+        }
+      },
+      children: /* @__PURE__ */ re(
+        je,
+        {
+          ref: (e) => {
+            M.current = e;
+          },
+          className: le(
+            O,
+            {
+              [`${O}-checkable`]: we,
+              [`${O}-show-line`]: be,
+              [`${O}-size-${p}`]: p,
+              [`${O}-rtl`]: Oe
+            },
+            _e
+          ),
+          style: De,
+          filterNode: r.filterNode,
+          virtualListProps: ce,
+          expandedKeys: o.expandedKeys,
+          currentExpandKeys: o.currentExpandKeys,
+          getNodeProps: A,
+          getDataSet: j,
+          nodeList: o.nodeList,
+          onMouseDown: r.onMouseDown,
+          ariaProps: {
+            role: "tree",
+            "aria-multiselectable": r.multiple,
+            tabIndex: 0,
+            ...We(r)
+          }
+        }
+      )
+    }
+  );
+}
+const v = Se(
+  Ge
+);
+v.displayName = "Tree";
+v.SHOW_PARENT = oe;
+v.SHOW_ALL = ae;
+v.SHOW_CHILD = ye;
+v.Node = de;
 export {
-  T as TreeNode,
-  b as default
+  de as TreeNode,
+  v as default
 };

package/tree/index.js

@@ -1,5 +1,6 @@
-import { N as o, w as r } from "../chunk/BbQEqpOn.js";
+import { default as r } from "./Tree.js";
+import { default as t } from "./Node.js";
 export {
-  o as TreeNode,
+  t as TreeNode,
   r as default
 };