@unicom-cloud/ui 0.8.66 → 0.8.67

package/chunk/{DnvO8A0Z.js → DFrfrmfK.js}

@@ -1,30 +1,30 @@
-import { jsxs as Se, jsx as E } from "react/jsx-runtime";
-import { H as ve, z as Ve, G as Pe } from "./CSC_V_25.js";
+import { jsxs as Se, jsx as W } from "react/jsx-runtime";
+import { H as Ve, z as ve, G as Pe } from "./CSC_V_25.js";
 import Ke from "lodash/debounce";
 import B from "lodash/isArray";
-import W from "lodash/isFunction";
-import Ie from "lodash/isNil";
-import { forwardRef as ue, useRef as w, useCallback as K, useMemo as Y, useImperativeHandle as de, useContext as fe, useState as ee, useEffect as ce } from "react";
-import { d as he } from "./-zpSUpGE.js";
-import { useId as _e } from "../hooks/useId.js";
-import { useIsFirstRender as Te } from "../hooks/useIsFirstRender.js";
-import { useMergeProps as Oe } from "../hooks/useMergeProps.js";
-import { useMergeValue as ie } from "../hooks/useMergeValue.js";
+import E from "lodash/isFunction";
+import _e from "lodash/isNil";
+import { forwardRef as ue, useRef as D, useCallback as K, useMemo as Y, useImperativeHandle as de, useContext as fe, useState as ee, useEffect as ce } from "react";
+import { a as he } from "./BJQ5UNa-.js";
+import { a as Ie } from "./DRtM649q.js";
+import { u as Te } from "./CLiqJm_T.js";
+import { c as Oe } from "./B5gK1Idp.js";
+import { R as ie } from "./HDUQku8d.js";
 import xe from "../SelectView.js";
-import { T as O, g as Le, a as Re, b as we } from "./CVkHTbic.js";
-import De from "../Trigger.js";
-import { y as Z } from "./BAWsPQBM.js";
-import "../utils/is.js";
+import { T as O, g as Le, a as we, b as De } from "./DsRSHWtX.js";
+import Re from "../Trigger.js";
+import { m as Z } from "./JPPo5nY_.js";
+import "./CkNSv2U7.js";
 import He from "lodash/isString";
 import H from "lodash/get";
-import { useForceUpdate as Ne } from "../hooks/useForceUpdate.js";
-import { useUpdateEffect as te } from "../hooks/useUpdateEffect.js";
+import { c as Ne } from "./BP9sYyk9.js";
+import { c as te } from "./BbEYToV1.js";
 import oe from "lodash/isEqualWith";
 import me from "lodash/isPlainObject";
-import Ee from "lodash/isUndefined";
-import { usePrevious as Fe } from "../hooks/usePrevious.js";
+import We from "lodash/isUndefined";
+import { n as Ae } from "./DU6bs_19.js";
 import se from "lodash/isPlainObject.js";
-function We(t, a) {
+function Ee(t, a) {
   const {
     value: n,
     multiple: f,
@@ -34,11 +34,11 @@ function We(t, a) {
     treeData: u,
     treeProps: p,
     prefixCls: l,
-    treeCheckable: V
-  } = t, C = p && p.renderTitle, m = w(), d = K(
+    treeCheckable: v
+  } = t, C = p && p.renderTitle, m = D(), d = K(
     (b, { checkedNodes: o, checked: s, node: g }) => {
       const P = b.map((y) => {
-        const T = o.find((I) => I && I.props._key === y);
+        const T = o.find((_) => _ && _.props._key === y);
         return T ? {
           label: T.props.title,
           value: T.props._key,
@@ -54,7 +54,7 @@ function We(t, a) {
       });
     },
     [t.onChange, n]
-  ), _ = K(
+  ), I = K(
     (b, { node: o, selected: s }) => {
       let g = [
         {
@@ -73,13 +73,13 @@ function We(t, a) {
       t.onChange(g, { trigger: o == null ? void 0 : o.props, selected: s });
     },
     [t.onChange, n, f]
-  ), D = K((b, { node: o, e: s }) => {
-    var I, N;
+  ), R = K((b, { node: o, e: s }) => {
+    var _, N;
     const { checked: g, checkable: P, disabled: y, disableCheckbox: T } = o.props;
-    m.current && !T && !y && P !== !1 && ((N = (I = m.current) == null ? void 0 : I.handleCheck) == null || N.call(I, !g, o.props._key, s));
+    m.current && !T && !y && P !== !1 && ((N = (_ = m.current) == null ? void 0 : _.handleCheck) == null || N.call(_, !g, o.props._key, s));
   }, []), x = K(
     (b) => {
-      if (W(h)) {
+      if (E(h)) {
         const o = b.props.dataRef;
         return h(b, o);
       }
@@ -98,7 +98,7 @@ function We(t, a) {
         const P = s.substring(0, g + 1), y = s.substring(g + o.length);
         return /* @__PURE__ */ Se("span", { children: [
           P,
-          /* @__PURE__ */ E("span", { className: `${l}-highlight`, children: s.substring(g, o.length + 1) }),
+          /* @__PURE__ */ W("span", { className: `${l}-highlight`, children: s.substring(g, o.length + 1) }),
           y
         ] });
       }
@@ -108,13 +108,13 @@ function We(t, a) {
   ), S = Y(() => t.treeCheckable ? {
     onCheck: d,
     checkedKeys: n.map((b) => b.value)
-  } : {}, [d, n, t.treeCheckable]), G = Y(() => t.treeCheckable ? [] : n.map((b) => b.value), [t.treeCheckable, n]), F = K(
+  } : {}, [d, n, t.treeCheckable]), G = Y(() => t.treeCheckable ? [] : n.map((b) => b.value), [t.treeCheckable, n]), A = K(
     (b, o) => {
-      t.treeCheckable ? D(b, o) : _(b, o);
+      t.treeCheckable ? R(b, o) : I(b, o);
     },
-    [t.treeCheckable, D, _]
+    [t.treeCheckable, R, I]
   );
-  return de(a, () => m.current, []), /* @__PURE__ */ E(
+  return de(a, () => m.current, []), /* @__PURE__ */ W(
     O,
     {
       ref: m,
@@ -122,7 +122,7 @@ function We(t, a) {
       blockNode: !0,
       filterNode: t.filterNode,
       ...p,
-      checkable: V,
+      checkable: v,
       multiple: f,
       loadMore: t.loadMore ? x : void 0,
       checkedStrategy: i,
@@ -134,12 +134,12 @@ function We(t, a) {
       treeData: u,
       fieldNames: t.fieldNames,
       renderTitle: q,
-      onSelect: F,
+      onSelect: A,
       selectedKeys: G
     }
   );
 }
-const Ae = ue(We), be = {
+const Fe = ue(Ee), be = {
   key: "key",
   title: "title",
   children: "children",
@@ -153,8 +153,8 @@ const Ae = ue(We), be = {
   let h = 0;
   const i = (e, u) => {
     const p = e.length;
-    return e.map((l, V) => {
-      const C = H(l, n.children) || l[n.children], m = H(l, n.key) || l[n.key] || `${(u == null ? void 0 : u._key) || ""}-${V}`, d = {
+    return e.map((l, v) => {
+      const C = H(l, n.children) || l[n.children], m = H(l, n.key) || l[n.key] || `${(u == null ? void 0 : u._key) || ""}-${v}`, d = {
         ...l,
         title: H(l, n.title) || l[n.title],
         selectable: H(l, n.selectable) || l[n.selectable],
@@ -170,7 +170,7 @@ const Ae = ue(We), be = {
         _level: u._level || 0,
         _index: h++
       };
-      return p === V + 1 && (d.className = Z(
+      return p === v + 1 && (d.className = Z(
         `${a}-node-is-tail`,
         d.className
       )), f[m] = d, C && C.length && (f[m].children = i(C, {
@@ -181,20 +181,20 @@ const Ae = ue(We), be = {
     });
   };
   return i(t || [], {}), f;
-}, Me = (t, a) => {
+}, $e = (t, a) => {
   const { getPrefixCls: n } = fe(he), f = {
     ...be,
     ...a
-  }, h = Ne(), i = n("tree"), e = w(
+  }, h = Ne(), i = n("tree"), e = D(
     ae(t, i, f)
   );
   return te(() => {
     e.current = ae(t, i, f), h();
   }, [t]), e.current;
-}, j = (t) => {
+}, z = (t) => {
   let a = t;
   return B(t) || (a = t == null ? [] : [t]), a.map((n) => me(n) ? n.value : n);
-}, z = (t, a, n) => t == null ? [] : (B(t) ? t : [t]).map((h) => {
+}, U = (t, a, n) => t == null ? [] : (B(t) ? t : [t]).map((h) => {
   let i = me(h) ? { ...h } : { value: h, label: void 0 };
   const e = a[i.value];
   if (e)
@@ -206,8 +206,8 @@ const Ae = ue(We), be = {
       ...u
     };
   }
-  return Ee(i.label) && (i.label = i.value), i;
-}), $e = (t, a, n, f) => {
+  return We(i.label) && (i.label = i.value), i;
+}), Me = (t, a, n, f) => {
   if (!f.treeCheckStrictly) {
     const { checkedKeys: h, indeterminateKeys: i } = Le(t, a);
     let e = h;
@@ -222,35 +222,35 @@ const Ae = ue(We), be = {
     })), e;
   }
   return n.current = [], t;
-}, Ue = (t, a, n) => {
-  const f = w([]), h = () => {
+}, je = (t, a, n) => {
+  const f = D([]), h = () => {
     const l = t.value || t.defaultValue || [];
     if (t.treeCheckable) {
-      const V = $e(
-        j(l),
+      const v = Me(
+        z(l),
         a,
         n,
         t
-      ), C = z(
+      ), C = U(
         l,
         a,
         f.current
       );
-      return z(
-        V,
+      return U(
+        v,
         a,
         C
       );
     }
-    return z(l, a);
+    return U(l, a);
   }, [i, e] = ee(h), u = (l) => {
     f.current = l, e(l);
   };
   te(() => {
     const l = h();
     "value" in t && (t.labelInValue ? oe(
-      j(i),
-      j(l)
+      z(i),
+      z(l)
     ) || u(l) : oe(i, l) || u(l));
   }, [
     t.treeCheckedStrategy,
@@ -260,11 +260,11 @@ const Ae = ue(We), be = {
     a
   ]);
   const p = K(
-    (l, V) => {
+    (l, v) => {
       const { onChange: C, labelInValue: m } = t, d = t.multiple || t.treeCheckable;
       "value" in t || u(l);
-      let _;
-      d ? _ = l.map((D) => m ? { label: D.label, value: D.value } : D.value) : _ = m ? l[0] : l[0] && l[0].value, C == null || C(_, V);
+      let I;
+      d ? I = l.map((R) => m ? { label: R.label, value: R.value } : R.value) : I = m ? l[0] : l[0] && l[0].value, C == null || C(I, v);
     },
     [
       t.onChange,
@@ -276,22 +276,22 @@ const Ae = ue(We), be = {
   );
   return [i, p];
 };
-function je(t) {
-  const a = Fe(t) || {}, n = () => t.treeData || Re(t.children), [f, h] = ee(n());
+function ze(t) {
+  const a = Ae(t) || {}, n = () => t.treeData || we(t.children), [f, h] = ee(n());
   return te(() => {
     (t.treeData !== a.treeData || t.children !== a.children) && h(n());
   }, [t]), [f];
 }
-const ze = {
+const Ue = {
   bordered: !0,
   treeCheckedStrategy: O.SHOW_CHILD,
   fieldNames: be
 }, Be = { bottom: 4 }, qe = (t, a) => {
   const { getPrefixCls: n, renderEmpty: f, componentConfig: h, rtl: i } = fe(he), e = Oe(
     t,
-    ze,
+    Ue,
     h == null ? void 0 : h.TreeSelect
-  ), u = Te(), p = w(), l = w(null), V = w(null), C = w([]), [m] = je(e), d = Me(m, e.fieldNames), [_, D] = ee(), [x, q] = ie(!1, {
+  ), u = Te(), p = D(), l = D(null), v = D(null), C = D([]), [m] = ze(e), d = $e(m, e.fieldNames), [I, R] = ee(), [x, q] = ie(!1, {
     value: e.popupVisible
   }), [S, G] = ie(
     void 0,
@@ -299,40 +299,41 @@ const ze = {
     {
       value: "inputValue" in e ? e.inputValue || "" : void 0
     }
-  ), F = w(S), b = w(null), { onInputValueChange: o } = e, [s, g] = Ue(
+  ), A = D(S), b = D(null), { onInputValueChange: o } = e, [s, g] = je(
     e,
     d,
     C
-  ), P = e.multiple || e.treeCheckable, y = n("tree-select"), T = S && !W(e.onSearch), I = _e(`${y}-popup-`), N = (r) => {
+  ), P = e.multiple || e.treeCheckable, y = n("tree-select"), T = S && !E(e.onSearch), _ = Ie(`${y}-popup-`), N = (r) => {
     var c;
     r !== x && (q(r), (c = e.onVisibleChange) == null || c.call(e, r));
   }, J = (r, c) => {
-    (r !== F.current || c !== b.current) && (G(r), F.current = r, b.current = c, o == null || o(r, c));
+    (r !== A.current || c !== b.current) && (G(r), A.current = r, b.current = c, o == null || o(r, c));
   }, ge = K(
     (r) => Ke(async (k) => {
-      if (W(e.onSearch)) {
+      if (E(e.onSearch)) {
         await e.onSearch(k);
         return;
       }
-      if (!k) return m;
-      const v = /* @__PURE__ */ new Set();
+      if (!k)
+        return m;
+      const V = /* @__PURE__ */ new Set();
       Object.keys(d).forEach((L) => {
-        const R = d[L];
-        let $ = !1;
-        if (W(e.filterTreeNode))
-          e.filterTreeNode(k, /* @__PURE__ */ E(O.Node, { ...R })) && ($ = !0);
+        const w = d[L];
+        let M = !1;
+        if (E(e.filterTreeNode))
+          e.filterTreeNode(k, /* @__PURE__ */ W(O.Node, { ...w })) && (M = !0);
         else {
-          const U = R.value || R._key;
-          U && U.indexOf(k) > -1 && ($ = !0);
+          const j = w.value || w._key;
+          j && j.indexOf(k) > -1 && (M = !0);
         }
-        $ && v.add(R.key);
-      }), D(v);
+        M && V.add(w.key);
+      }), R(V);
     }, 100)(r),
     [e.onSearch, m, d, e.filterTreeNode]
   ), re = K(() => {
     let r = !0;
     se(e.showSearch) && (r = e.showSearch.retainInputValueWhileSelect !== !1), e.multiple && !r && S !== void 0 && J("", "optionChecked");
-  }, [S, e.multiple, JSON.stringify(e.showSearch)]), M = K(
+  }, [S, e.multiple, JSON.stringify(e.showSearch)]), $ = K(
     (r, c) => {
       g(r, c), re(), P || N(!1);
     },
@@ -340,44 +341,44 @@ const ze = {
   ), pe = (r, c, k) => {
     if (k.stopPropagation(), r.disabled)
       return;
-    const v = se(r.value) ? r.value.value : r.value;
-    if (!e.treeCheckable || e.treeCheckStrictly || !d[v]) {
-      const R = s.filter(($, U) => U !== c);
-      M(R, {
-        trigger: d[v] || r,
+    const V = se(r.value) ? r.value.value : r.value;
+    if (!e.treeCheckable || e.treeCheckStrictly || !d[V]) {
+      const w = s.filter((M, j) => j !== c);
+      $(w, {
+        trigger: d[V] || r,
         checked: !1,
         selected: !1
       });
       return;
     }
-    const L = we(
-      v,
+    const L = De(
+      V,
       !1,
-      j(s),
+      z(s),
       d,
       C.current
     );
-    C.current = L.indeterminateKeys, M(z(L.checkedKeys, d, s), {
-      trigger: d[v],
+    C.current = L.indeterminateKeys, $(U(L.checkedKeys, d, s), {
+      trigger: d[V],
       checked: !1,
       selected: !1
     });
   };
   function Q(r) {
-    return ve(r) || Ve(r) || Pe(r);
+    return Ve(r) || ve(r) || Pe(r);
   }
   ce(() => {
-    S !== void 0 && ge(S), S !== F.current && (F.current = S);
+    S !== void 0 && ge(S), S !== A.current && (A.current = S);
   }, [S]);
   const X = Y(() => {
     let r = [];
     if (S)
       for (const c in d) {
-        const v = [...d[c].pathParentKeys, c];
-        v.some((L) => _ && _.has(L)) && (r = r.concat(v));
+        const V = [...d[c].pathParentKeys, c];
+        V.some((L) => I && I.has(L)) && (r = r.concat(V));
       }
     return Array.from(new Set(r));
-  }, [S, d, _]);
+  }, [S, d, I]);
   ce(() => {
     x ? setTimeout(() => {
       const r = s[0];
@@ -385,14 +386,14 @@ const ze = {
     }) : u || S && J("", "optionListHide");
   }, [x]), de(a, () => ({
     focus() {
-      V.current && V.current.focus();
+      v.current && v.current.focus();
     },
     blur() {
-      V.current && V.current.blur();
+      v.current && v.current.blur();
     },
     getRootDOMNode: () => {
       var r, c;
-      return (c = (r = V.current) == null ? void 0 : r.getRootDOMNode) == null ? void 0 : c.call(r);
+      return (c = (r = v.current) == null ? void 0 : r.getRootDOMNode) == null ? void 0 : c.call(r);
     }
   }));
   const Ce = K(
@@ -401,17 +402,17 @@ const ze = {
   ), ke = K(
     (r) => {
       const { disabled: c, value: k } = r || {};
-      let v = r == null ? void 0 : r.label;
-      return W(e.renderFormat) && (v = e.renderFormat(
+      let V = r == null ? void 0 : r.label;
+      return E(e.renderFormat) && (V = e.renderFormat(
         d[k] || null,
         e.labelInValue ? r : k
-      )), { text: v || k || "", disabled: c };
+      )), { text: V || k || "", disabled: c };
     },
     [e.renderFormat, e.labelInValue, d]
   ), ye = (r) => {
     g(r, {});
-  }, ne = (r) => /* @__PURE__ */ E(
-    De,
+  }, ne = (r) => /* @__PURE__ */ W(
+    Re,
     {
       autoAlignPopupWidth: !1,
       autoAlignPopupMinWidth: !0,
@@ -428,9 +429,9 @@ const ze = {
         e.triggerProps && e.triggerProps.className
       ),
       popup: () => {
-        var v, L, R;
-        const c = e.dropdownRender, k = T && Q(X) || Q(m) ? e.notFoundContent || (f == null ? void 0 : f("TreeSelect")) : /* @__PURE__ */ E(
-          Ae,
+        var V, L, w;
+        const c = e.dropdownRender, k = T && Q(X) || Q(m) ? e.notFoundContent || (f == null ? void 0 : f("TreeSelect")) : /* @__PURE__ */ W(
+          Fe,
           {
             prefixCls: y,
             ref: l,
@@ -438,23 +439,23 @@ const ze = {
             inputValue: S,
             filterNode: Ce,
             value: s,
-            onChange: M,
+            onChange: $,
             multiple: P,
             treeData: m
           }
         );
-        return /* @__PURE__ */ E(
+        return /* @__PURE__ */ W(
           "div",
           {
-            id: I,
+            id: _,
             className: Z(`${y}-popup`, {
               [`${y}-rtl-popup`]: i
             }),
             style: {
-              maxHeight: (v = e.treeProps) != null && v.height || (R = (L = e.treeProps) == null ? void 0 : L.virtualListProps) != null && R.height ? "unset" : "",
+              maxHeight: (V = e.treeProps) != null && V.height || (w = (L = e.treeProps) == null ? void 0 : L.virtualListProps) != null && w.height ? "unset" : "",
               ...e.dropdownMenuStyle
             },
-            children: W(c) ? c(k) : k
+            children: E(c) ? c(k) : k
           }
         );
       },
@@ -472,12 +473,12 @@ const ze = {
       (k) => e.labelInValue ? { label: k.label, value: k.value } : k.value
     ) : r = e.labelInValue ? s[0] : (c = s[0]) == null ? void 0 : c.value, e.triggerElement({ value: r });
   })() : e.triggerElement;
-  return Ie(le) ? /* @__PURE__ */ E(
+  return _e(le) ? /* @__PURE__ */ W(
     xe,
     {
-      ref: V,
+      ref: v,
       rtl: i,
-      ariaControls: I,
+      ariaControls: _,
       ...e,
       popupVisible: x,
       value: !P && B(s) ? s[0] : s,
@@ -490,7 +491,7 @@ const ze = {
       onRemoveCheckedItem: pe,
       onClear: (r) => {
         var c;
-        r.stopPropagation(), M([], {}), (c = e.onClear) == null || c.call(e, !!x);
+        r.stopPropagation(), $([], {}), (c = e.onClear) == null || c.call(e, !!x);
       },
       onKeyDown: (r) => {
         var c;
@@ -505,14 +506,14 @@ const ze = {
       renderView: ne
     }
   ) : ne(le);
-}, Ge = ue(qe), A = Ge;
-A.displayName = "TreeSelect";
-A.Node = O.Node;
-A.SHOW_ALL = O.SHOW_ALL;
-A.SHOW_PARENT = O.SHOW_PARENT;
-A.SHOW_CHILD = O.SHOW_CHILD;
+}, Ge = ue(qe), F = Ge;
+F.displayName = "TreeSelect";
+F.Node = O.Node;
+F.SHOW_ALL = O.SHOW_ALL;
+F.SHOW_PARENT = O.SHOW_PARENT;
+F.SHOW_CHILD = O.SHOW_CHILD;
 const St = O.Node;
 export {
-  A as T,
+  F as T,
   St as a
 };

package/chunk/DGTIZ_0O.js

@@ -0,0 +1,6 @@
+function r(t) {
+  return typeof t == "string" ? t.replace(/(\s{2,})|(\s{1,}$)/g, (e) => " ".repeat(e.length)) : t;
+}
+export {
+  r as l
+};

package/chunk/DJfpiZn_.js

@@ -0,0 +1,25 @@
+import { useState as v, useEffect as s } from "react";
+function f(o) {
+  const [e, t] = v({
+    value: o,
+    resolve: (r) => {
+    }
+  });
+  return s(() => {
+    e.resolve(e.value);
+  }, [e]), [
+    e.value,
+    (r) => new Promise((l) => {
+      t((n) => {
+        let u = r;
+        return typeof r == "function" && (u = r(n.value)), {
+          value: u,
+          resolve: l
+        };
+      });
+    })
+  ];
+}
+export {
+  f as i
+};

package/chunk/DKr2_PYd.js

@@ -0,0 +1,34 @@
+import w from "lodash/debounce";
+import { useState as c, useDeferredValue as h, useCallback as u, useEffect as a } from "react";
+const l = (r = !1) => {
+  const [i, o] = c({
+    width: window.innerWidth,
+    height: window.innerHeight
+  }), s = h(
+    i
+    // 延迟一个值与防抖和节流之间有什么不同？
+    // 防抖 是指在用户停止输入一段时间（例如一秒钟）之后再更新列表。
+    // 节流 是指每隔一段时间（例如最多每秒一次）更新列表。
+    // 虽然这些技术在某些情况下是有用的，但 useDeferredValue 更适合优化渲染，因为它与 React 自身深度集成，并且能够适应用户的设备。
+    // 与防抖或节流不同，useDeferredValue 不需要选择任何固定延迟时间。如果用户的设备很快（比如性能强劲的笔记本电脑），延迟的重渲染几乎会立即发生并且不会被察觉。如果用户的设备较慢，那么列表会相应地“滞后”于输入，滞后的程度与设备的速度有关。
+    // 此外，与防抖或节流不同，useDeferredValue 执行的延迟重新渲染默认是可中断的。这意味着，如果 React 正在重新渲染一个大型列表，但用户进行了另一次键盘输入，React 会放弃该重新渲染，先处理键盘输入，然后再次开始在后台渲染。相比之下，防抖和节流仍会产生不顺畅的体验，因为它们是阻塞的：它们仅仅是将渲染阻塞键盘输入的时刻推迟了。
+    // 如果你要优化的工作不是在渲染期间发生的，那么防抖和节流仍然非常有用。例如，它们可以让你减少网络请求的次数。你也可以同时使用这些技术。
+  );
+  function t(e) {
+    const n = e.currentTarget || e.target || window;
+    o({
+      width: n.innerWidth,
+      height: n.innerHeight
+    });
+  }
+  const d = u(w(t, 123), []);
+  return a(() => {
+    const e = r ? d : t;
+    return window.addEventListener("resize", e), () => {
+      window.removeEventListener("resize", e);
+    };
+  }, []), s;
+};
+export {
+  l
+};

package/chunk/DNUz6zgo.js

@@ -0,0 +1,11 @@
+function a(i, n, r, b) {
+  const c = n || {}, o = r || {}, s = i || {}, u = b ? new Set(b) : new Set(
+    Object.keys(s).concat(Object.keys(c)).concat(Object.keys(o))
+  ), t = {};
+  return u.forEach((e) => {
+    s[e] !== void 0 ? t[e] = s[e] : e in o ? t[e] = o[e] : e in c && (t[e] = c[e]);
+  }), t;
+}
+export {
+  a as b
+};

package/chunk/DRtM649q.js

@@ -0,0 +1,11 @@
+import { useState as r, useEffect as u } from "react";
+const n = {};
+function c(e) {
+  const [o, f] = r();
+  return u(() => {
+    n[e] = e in n ? n[e] : 0, f(n[e]), n[e] += 1;
+  }, []), typeof o == "number" ? `${e}${o}` : void 0;
+}
+export {
+  c as a
+};

package/chunk/DS_mUWn6.js

@@ -0,0 +1,41 @@
+import { jsx as t, Fragment as l } from "react/jsx-runtime";
+import h from "lodash/escapeRegExp";
+import m from "lodash/isArray";
+import { cloneElement as a } from "react";
+function x({
+  nodeList: r,
+  pattern: i,
+  highlightClassName: o
+}) {
+  if (!i)
+    return r;
+  const n = (e) => e && e.props && typeof e.props.children == "string" ? a(
+    e,
+    void 0,
+    /* @__PURE__ */ t(
+      c,
+      {
+        text: e.props.children,
+        keyword: i,
+        highlightClassName: o
+      }
+    )
+  ) : e;
+  return m(r) ? r.map((e) => n(e)) : n(r);
+}
+function c({
+  text: r,
+  keyword: i,
+  highlightClassName: o
+}) {
+  if (!i)
+    return /* @__PURE__ */ t(l, { children: r });
+  i.length > 1e3 && (i = i.slice(0, 1e3));
+  const n = new RegExp(`(${h(i)})`, "i"), e = r.split(n);
+  return /* @__PURE__ */ t(l, { children: e.map(
+    (s, p) => n.test(s) ? /* @__PURE__ */ t("span", { className: o, children: s }, p) : /* @__PURE__ */ t("span", { children: s }, p)
+  ) });
+}
+export {
+  x as E
+};

package/chunk/DU6bs_19.js

@@ -0,0 +1,10 @@
+import { useRef as t, useEffect as n } from "react";
+function c(r) {
+  const e = t();
+  return n(() => {
+    e.current = r;
+  }), e.current;
+}
+export {
+  c as n
+};