@unicom-cloud/ui 0.8.90 → 0.8.92

package/tree/Tree.js

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