use-abcd 1.6.4 → 1.6.7

package/dist/index.js

@@ -1,16 +1,16 @@
-import { useMemo as le, useSyncExternalStore as v, useCallback as g } from "react";
-import { b as oe, c as G, d as mt, e as fe, f as Je, h as he, j as Ye, S as ze, i as W, k as Ge, l as St, n as Xe, o as gt, p as V, q as wt, r as vt, s as Ct, t as Mt, u as xt, v as Ze, w as Ot, x as ke, y as Pt, z as Rt, A as Et, B as de, C as It, D as Nt, E as zt, F as At, a as z, m as K, g as be } from "./chunks/utils-C2wXstxP.js";
-import { H as Ts, G as qs } from "./chunks/utils-C2wXstxP.js";
-import { c as $s } from "./chunks/client-lHRDCo64.js";
-const b = {
+import { useMemo as le, useSyncExternalStore as v, useCallback as S } from "react";
+import { b as oe, c as Y, d as gt, e as fe, f as Ge, h as he, j as Xe, S as Ne, i as K, k as Ze, l as wt, n as ke, o as vt, p as W, q as Ct, r as Mt, s as xt, t as Ot, u as Pt, v as et, w as Rt, x as tt, y as Et, z as It, A as Nt, B as de, C as zt, D as At, E as Ft, F as jt, a as z, m as U, g as ze } from "./chunks/utils-C2wXstxP.js";
+import { H as Hs, G as Bs } from "./chunks/utils-C2wXstxP.js";
+import { c as Ks } from "./chunks/client-lHRDCo64.js";
+const y = {
   Remove: "remove",
   Replace: "replace",
   Add: "add"
-}, et = Symbol.for("__MUTATIVE_PROXY_DRAFT__"), Ft = Symbol("__MUTATIVE_RAW_RETURN_SYMBOL__"), ee = Symbol.iterator, O = {
+}, nt = Symbol.for("__MUTATIVE_PROXY_DRAFT__"), Dt = Symbol("__MUTATIVE_RAW_RETURN_SYMBOL__"), ee = Symbol.iterator, O = {
   mutable: "mutable",
   immutable: "immutable"
-}, xe = {};
-function Y(e, t) {
+}, Me = {};
+function J(e, t) {
   return e instanceof Map ? e.has(t) : Object.prototype.hasOwnProperty.call(e, t);
 }
 function Ae(e, t) {
@@ -24,48 +24,48 @@ function Ae(e, t) {
     }
   }
 }
-function Oe(e) {
+function xe(e) {
   return Object.getPrototypeOf(e) === Set.prototype;
 }
-function Pe(e) {
+function Oe(e) {
   return Object.getPrototypeOf(e) === Map.prototype;
 }
 function x(e) {
   var t;
   return (t = e.copy) !== null && t !== void 0 ? t : e.original;
 }
-function T(e) {
-  return !!h(e);
+function D(e) {
+  return !!d(e);
 }
-function h(e) {
-  return typeof e != "object" ? null : e?.[et];
+function d(e) {
+  return typeof e != "object" ? null : e?.[nt];
 }
-function Re(e) {
+function Pe(e) {
   var t;
-  const n = h(e);
+  const n = d(e);
   return n ? (t = n.copy) !== null && t !== void 0 ? t : n.original : e;
 }
-function R(e, t) {
+function E(e, t) {
   if (!e || typeof e != "object")
     return !1;
   let n;
   return Object.getPrototypeOf(e) === Object.prototype || Array.isArray(e) || e instanceof Map || e instanceof Set || !!t?.mark && ((n = t.mark(e, O)) === O.immutable || typeof n == "function");
 }
-function tt(e, t = []) {
+function st(e, t = []) {
   if (Object.hasOwnProperty.call(e, "key")) {
-    const n = e.parent.copy, s = h(F(n, e.key));
+    const n = e.parent.copy, s = d(F(n, e.key));
     if (s !== null && s?.original !== e.original)
       return null;
     const i = e.parent.type === 3, r = i ? Array.from(e.parent.setMap.keys()).indexOf(e.key) : e.key;
-    if (!(i && n.size > r || Y(n, r)))
+    if (!(i && n.size > r || J(n, r)))
       return null;
     t.push(r);
   }
   if (e.parent)
-    return tt(e.parent, t);
+    return st(e.parent, t);
   t.reverse();
   try {
-    jt(e.copy, t);
+    Tt(e.copy, t);
   } catch {
     return null;
   }
@@ -77,28 +77,28 @@ function $(e) {
 function F(e, t) {
   return $(e) === 2 ? e.get(t) : e[t];
 }
-function Z(e, t, n) {
+function X(e, t, n) {
   $(e) === 2 ? e.set(t, n) : e[t] = n;
 }
 function pe(e, t) {
-  const n = h(e);
+  const n = d(e);
   return (n ? x(n) : e)[t];
 }
 function A(e, t) {
   return e === t ? e !== 0 || 1 / e === 1 / t : e !== e && t !== t;
 }
-function me(e) {
+function be(e) {
   if (e)
     for (; e.finalities.revoke.length > 0; )
       e.finalities.revoke.pop()();
 }
-function q(e, t) {
+function T(e, t) {
   return t ? e : [""].concat(e).map((n) => {
     const s = `${n}`;
     return s.indexOf("/") === -1 && s.indexOf("~") === -1 ? s : s.replace(/~/g, "~0").replace(/\//g, "~1");
   }).join("/");
 }
-function jt(e, t) {
+function Tt(e, t) {
   for (let n = 0; n < t.length - 1; n += 1) {
     const s = t[n];
     if (e = F($(e) === 3 ? Array.from(e) : e, s), typeof e != "object")
@@ -106,7 +106,7 @@ function jt(e, t) {
   }
   return e;
 }
-function Dt(e) {
+function qt(e) {
   const t = Object.create(Object.getPrototypeOf(e));
   return Reflect.ownKeys(e).forEach((n) => {
     let s = Reflect.getOwnPropertyDescriptor(e, n);
@@ -122,26 +122,26 @@ function Dt(e) {
     }), Reflect.defineProperty(t, n, s);
   }), t;
 }
-const Tt = Object.prototype.propertyIsEnumerable;
-function nt(e, t) {
+const $t = Object.prototype.propertyIsEnumerable;
+function it(e, t) {
   let n;
   if (Array.isArray(e))
     return Array.prototype.concat.call(e);
   if (e instanceof Set) {
-    if (!Oe(e)) {
+    if (!xe(e)) {
       const s = Object.getPrototypeOf(e).constructor;
       return new s(e.values());
     }
     return Set.prototype.difference ? Set.prototype.difference.call(e, /* @__PURE__ */ new Set()) : new Set(e.values());
   } else if (e instanceof Map) {
-    if (!Pe(e)) {
+    if (!Oe(e)) {
       const s = Object.getPrototypeOf(e).constructor;
       return new s(e);
     }
     return new Map(e);
   } else if (t?.mark && (n = t.mark(e, O), n !== void 0) && n !== O.mutable) {
     if (n === O.immutable)
-      return Dt(e);
+      return qt(e);
     if (typeof n == "function") {
       if (t.enablePatches || t.enableAutoFreeze)
         throw new Error("You can't use mark and patches or auto freeze together.");
@@ -153,33 +153,33 @@ function nt(e, t) {
     return Object.keys(e).forEach((i) => {
       s[i] = e[i];
     }), Object.getOwnPropertySymbols(e).forEach((i) => {
-      Tt.call(e, i) && (s[i] = e[i]);
+      $t.call(e, i) && (s[i] = e[i]);
     }), s;
   } else
     throw new Error("Please check mark() to ensure that it is a stable marker draftable function.");
 }
 function w(e) {
-  e.copy || (e.copy = nt(e.original, e.options));
+  e.copy || (e.copy = it(e.original, e.options));
 }
-function J(e) {
-  if (!R(e))
-    return Re(e);
+function L(e) {
+  if (!E(e))
+    return Pe(e);
   if (Array.isArray(e))
-    return e.map(J);
+    return e.map(L);
   if (e instanceof Map) {
     const n = Array.from(e.entries()).map(([s, i]) => [
       s,
-      J(i)
+      L(i)
     ]);
-    if (!Pe(e)) {
+    if (!Oe(e)) {
       const s = Object.getPrototypeOf(e).constructor;
       return new s(n);
     }
     return new Map(n);
   }
   if (e instanceof Set) {
-    const n = Array.from(e).map(J);
-    if (!Oe(e)) {
+    const n = Array.from(e).map(L);
+    if (!xe(e)) {
       const s = Object.getPrototypeOf(e).constructor;
       return new s(n);
     }
@@ -187,20 +187,20 @@ function J(e) {
   }
   const t = Object.create(Object.getPrototypeOf(e));
   for (const n in e)
-    t[n] = J(e[n]);
+    t[n] = L(e[n]);
   return t;
 }
 function te(e) {
-  return T(e) ? J(e) : e;
+  return D(e) ? L(e) : e;
 }
-function E(e) {
+function I(e) {
   var t;
-  e.assignedMap = (t = e.assignedMap) !== null && t !== void 0 ? t : /* @__PURE__ */ new Map(), e.operated || (e.operated = !0, e.parent && E(e.parent));
+  e.assignedMap = (t = e.assignedMap) !== null && t !== void 0 ? t : /* @__PURE__ */ new Map(), e.operated || (e.operated = !0, e.parent && I(e.parent));
 }
 function Fe() {
   throw new Error("Cannot modify frozen object");
 }
-function U(e, t, n, s, i) {
+function B(e, t, n, s, i) {
   {
     n = n ?? /* @__PURE__ */ new WeakMap(), s = s ?? [], i = i ?? [];
     const o = n.has(e) ? n.get(e) : e;
@@ -217,36 +217,36 @@ function U(e, t, n, s, i) {
     } else
       s.push(o);
   }
-  if (Object.isFrozen(e) || T(e)) {
+  if (Object.isFrozen(e) || D(e)) {
     s.pop(), i.pop();
     return;
   }
   switch ($(e)) {
     case 2:
       for (const [c, a] of e)
-        U(c, c, n, s, i), U(a, c, n, s, i);
+        B(c, c, n, s, i), B(a, c, n, s, i);
       e.set = e.clear = e.delete = Fe;
       break;
     case 3:
       for (const c of e)
-        U(c, c, n, s, i);
+        B(c, c, n, s, i);
       e.add = e.clear = e.delete = Fe;
       break;
     case 1:
       Object.freeze(e);
       let o = 0;
       for (const c of e)
-        U(c, o, n, s, i), o += 1;
+        B(c, o, n, s, i), o += 1;
       break;
     default:
       Object.freeze(e), Object.keys(e).forEach((c) => {
         const a = e[c];
-        U(a, c, n, s, i);
+        B(a, c, n, s, i);
       });
   }
   s.pop(), i.pop();
 }
-function Ee(e, t) {
+function Re(e, t) {
   const n = $(e);
   if (n === 0)
     Reflect.ownKeys(e).forEach((s) => {
@@ -259,19 +259,19 @@ function Ee(e, t) {
   } else
     e.forEach((s, i) => t(i, s, e));
 }
-function st(e, t, n) {
-  if (T(e) || !R(e, n) || t.has(e) || Object.isFrozen(e))
+function rt(e, t, n) {
+  if (D(e) || !E(e, n) || t.has(e) || Object.isFrozen(e))
     return;
   const s = e instanceof Set, i = s ? /* @__PURE__ */ new Map() : void 0;
-  if (t.add(e), Ee(e, (r, o) => {
+  if (t.add(e), Re(e, (r, o) => {
     var c;
-    if (T(o)) {
-      const a = h(o);
+    if (D(o)) {
+      const a = d(o);
       w(a);
       const u = !((c = a.assignedMap) === null || c === void 0) && c.size || a.operated ? a.copy : a.original;
-      Z(s ? i : e, r, u);
+      X(s ? i : e, r, u);
     } else
-      st(o, t, n);
+      rt(o, t, n);
   }), i) {
     const r = e, o = Array.from(r);
     r.clear(), o.forEach((c) => {
@@ -279,60 +279,60 @@ function st(e, t, n) {
     });
   }
 }
-function qt(e, t) {
+function Qt(e, t) {
   const n = e.type === 3 ? e.setMap : e.copy;
-  e.finalities.revoke.length > 1 && e.assignedMap.get(t) && n && st(F(n, t), e.finalities.handledSet, e.options);
+  e.finalities.revoke.length > 1 && e.assignedMap.get(t) && n && rt(F(n, t), e.finalities.handledSet, e.options);
 }
-function Se(e) {
+function me(e) {
   e.type === 3 && e.copy && (e.copy.clear(), e.setMap.forEach((t) => {
-    e.copy.add(Re(t));
+    e.copy.add(Pe(t));
   }));
 }
-function ge(e, t, n, s) {
+function Se(e, t, n, s) {
   if (e.operated && e.assignedMap && e.assignedMap.size > 0 && !e.finalized) {
     if (n && s) {
-      const r = tt(e);
+      const r = st(e);
       r && t(e, r, n, s);
     }
     e.finalized = !0;
   }
 }
-function Ie(e, t, n, s) {
-  const i = h(n);
+function Ee(e, t, n, s) {
+  const i = d(n);
   i && (i.callbacks || (i.callbacks = []), i.callbacks.push((r, o) => {
     var c;
     const a = e.type === 3 ? e.setMap : e.copy;
     if (A(F(a, t), n)) {
       let u = i.original;
-      i.copy && (u = i.copy), Se(e), ge(e, s, r, o), e.options.enableAutoFreeze && (e.options.updatedValues = (c = e.options.updatedValues) !== null && c !== void 0 ? c : /* @__PURE__ */ new WeakMap(), e.options.updatedValues.set(u, i.original)), Z(a, t, u);
+      i.copy && (u = i.copy), me(e), Se(e, s, r, o), e.options.enableAutoFreeze && (e.options.updatedValues = (c = e.options.updatedValues) !== null && c !== void 0 ? c : /* @__PURE__ */ new WeakMap(), e.options.updatedValues.set(u, i.original)), X(a, t, u);
     }
-  }), e.options.enableAutoFreeze && i.finalities !== e.finalities && (e.options.enableAutoFreeze = !1)), R(n, e.options) && e.finalities.draft.push(() => {
+  }), e.options.enableAutoFreeze && i.finalities !== e.finalities && (e.options.enableAutoFreeze = !1)), E(n, e.options) && e.finalities.draft.push(() => {
     const r = e.type === 3 ? e.setMap : e.copy;
-    A(F(r, t), n) && qt(e, t);
+    A(F(r, t), n) && Qt(e, t);
   });
 }
-function Qt(e, t, n, s, i) {
+function Ht(e, t, n, s, i) {
   let { original: r, assignedMap: o, options: c } = e, a = e.copy;
   a.length < r.length && ([r, a] = [a, r], [n, s] = [s, n]);
   for (let u = 0; u < r.length; u += 1)
     if (o.get(u.toString()) && a[u] !== r[u]) {
-      const l = t.concat([u]), f = q(l, i);
+      const l = t.concat([u]), f = T(l, i);
       n.push({
-        op: b.Replace,
+        op: y.Replace,
         path: f,
         // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
         value: te(a[u])
       }), s.push({
-        op: b.Replace,
+        op: y.Replace,
         path: f,
         // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
         value: te(r[u])
       });
     }
   for (let u = r.length; u < a.length; u += 1) {
-    const l = t.concat([u]), f = q(l, i);
+    const l = t.concat([u]), f = T(l, i);
     n.push({
-      op: b.Add,
+      op: y.Add,
       path: f,
       // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
       value: te(a[u])
@@ -341,42 +341,42 @@ function Qt(e, t, n, s, i) {
   if (r.length < a.length) {
     const { arrayLengthAssignment: u = !0 } = c.enablePatches;
     if (u) {
-      const l = t.concat(["length"]), f = q(l, i);
+      const l = t.concat(["length"]), f = T(l, i);
       s.push({
-        op: b.Replace,
+        op: y.Replace,
         path: f,
         value: r.length
       });
     } else
       for (let l = a.length; r.length < l; l -= 1) {
-        const f = t.concat([l - 1]), y = q(f, i);
+        const f = t.concat([l - 1]), _ = T(f, i);
         s.push({
-          op: b.Remove,
-          path: y
+          op: y.Remove,
+          path: _
         });
       }
   }
 }
-function $t({ original: e, copy: t, assignedMap: n }, s, i, r, o) {
+function Bt({ original: e, copy: t, assignedMap: n }, s, i, r, o) {
   n.forEach((c, a) => {
-    const u = F(e, a), l = te(F(t, a)), f = c ? Y(e, a) ? b.Replace : b.Add : b.Remove;
-    if (A(u, l) && f === b.Replace)
+    const u = F(e, a), l = te(F(t, a)), f = c ? J(e, a) ? y.Replace : y.Add : y.Remove;
+    if (A(u, l) && f === y.Replace)
       return;
-    const y = s.concat(a), p = q(y, o);
-    i.push(f === b.Remove ? { op: f, path: p } : { op: f, path: p, value: l }), r.push(f === b.Add ? { op: b.Remove, path: p } : f === b.Remove ? { op: b.Add, path: p, value: u } : { op: b.Replace, path: p, value: u });
+    const _ = s.concat(a), p = T(_, o);
+    i.push(f === y.Remove ? { op: f, path: p } : { op: f, path: p, value: l }), r.push(f === y.Add ? { op: y.Remove, path: p } : f === y.Remove ? { op: y.Add, path: p, value: u } : { op: y.Replace, path: p, value: u });
   });
 }
-function Ht({ original: e, copy: t }, n, s, i, r) {
+function Ut({ original: e, copy: t }, n, s, i, r) {
   let o = 0;
   e.forEach((c) => {
     if (!t.has(c)) {
-      const a = n.concat([o]), u = q(a, r);
+      const a = n.concat([o]), u = T(a, r);
       s.push({
-        op: b.Remove,
+        op: y.Remove,
         path: u,
         value: c
       }), i.unshift({
-        op: b.Add,
+        op: y.Add,
         path: u,
         value: c
       });
@@ -384,13 +384,13 @@ function Ht({ original: e, copy: t }, n, s, i, r) {
     o += 1;
   }), o = 0, t.forEach((c) => {
     if (!e.has(c)) {
-      const a = n.concat([o]), u = q(a, r);
+      const a = n.concat([o]), u = T(a, r);
       s.push({
-        op: b.Add,
+        op: y.Add,
         path: u,
         value: c
       }), i.unshift({
-        op: b.Remove,
+        op: y.Remove,
         path: u,
         value: c
       });
@@ -398,59 +398,59 @@ function Ht({ original: e, copy: t }, n, s, i, r) {
     o += 1;
   });
 }
-function X(e, t, n, s) {
+function G(e, t, n, s) {
   const { pathAsArray: i = !0 } = e.options.enablePatches;
   switch (e.type) {
     case 0:
     case 2:
-      return $t(e, t, n, s, i);
+      return Bt(e, t, n, s, i);
     case 1:
-      return Qt(e, t, n, s, i);
-    case 3:
       return Ht(e, t, n, s, i);
+    case 3:
+      return Ut(e, t, n, s, i);
   }
 }
 const ce = (e, t, n = !1) => {
-  if (typeof e == "object" && e !== null && (!R(e, t) || n))
+  if (typeof e == "object" && e !== null && (!E(e, t) || n))
     throw new Error("Strict mode: Mutable data cannot be accessed directly, please use 'unsafe(callback)' wrap.");
-}, we = {
+}, ge = {
   get size() {
-    return x(h(this)).size;
+    return x(d(this)).size;
   },
   has(e) {
-    return x(h(this)).has(e);
+    return x(d(this)).has(e);
   },
   set(e, t) {
-    const n = h(this), s = x(n);
-    return (!s.has(e) || !A(s.get(e), t)) && (w(n), E(n), n.assignedMap.set(e, !0), n.copy.set(e, t), Ie(n, e, t, X)), this;
+    const n = d(this), s = x(n);
+    return (!s.has(e) || !A(s.get(e), t)) && (w(n), I(n), n.assignedMap.set(e, !0), n.copy.set(e, t), Ee(n, e, t, G)), this;
   },
   delete(e) {
     if (!this.has(e))
       return !1;
-    const t = h(this);
-    return w(t), E(t), t.original.has(e) ? t.assignedMap.set(e, !1) : t.assignedMap.delete(e), t.copy.delete(e), !0;
+    const t = d(this);
+    return w(t), I(t), t.original.has(e) ? t.assignedMap.set(e, !1) : t.assignedMap.delete(e), t.copy.delete(e), !0;
   },
   clear() {
-    const e = h(this);
+    const e = d(this);
     if (this.size) {
-      w(e), E(e), e.assignedMap = /* @__PURE__ */ new Map();
+      w(e), I(e), e.assignedMap = /* @__PURE__ */ new Map();
       for (const [t] of e.original)
         e.assignedMap.set(t, !1);
       e.copy.clear();
     }
   },
   forEach(e, t) {
-    const n = h(this);
+    const n = d(this);
     x(n).forEach((s, i) => {
       e.call(t, this.get(i), i, this);
     });
   },
   get(e) {
     var t, n;
-    const s = h(this), i = x(s).get(e), r = ((n = (t = s.options).mark) === null || n === void 0 ? void 0 : n.call(t, i, O)) === O.mutable;
-    if (s.options.strict && ce(i, s.options, r), r || s.finalized || !R(i, s.options) || i !== s.original.get(e))
+    const s = d(this), i = x(s).get(e), r = ((n = (t = s.options).mark) === null || n === void 0 ? void 0 : n.call(t, i, O)) === O.mutable;
+    if (s.options.strict && ce(i, s.options, r), r || s.finalized || !E(i, s.options) || i !== s.original.get(e))
       return i;
-    const o = xe.createDraft({
+    const o = Me.createDraft({
       original: i,
       parentDraft: s,
       key: e,
@@ -460,7 +460,7 @@ const ce = (e, t, n = !1) => {
     return w(s), s.copy.set(e, o), o;
   },
   keys() {
-    return x(h(this)).keys();
+    return x(d(this)).keys();
   },
   values() {
     const e = this.keys();
@@ -494,16 +494,16 @@ const ce = (e, t, n = !1) => {
   [ee]() {
     return this.entries();
   }
-}, Bt = Reflect.ownKeys(we), je = (e, t, { isValuesIterator: n }) => () => {
+}, Kt = Reflect.ownKeys(ge), je = (e, t, { isValuesIterator: n }) => () => {
   var s, i;
   const r = t.next();
   if (r.done)
     return r;
   const o = r.value;
   let c = e.setMap.get(o);
-  const a = h(c), u = ((i = (s = e.options).mark) === null || i === void 0 ? void 0 : i.call(s, c, O)) === O.mutable;
-  if (e.options.strict && ce(o, e.options, u), !u && !a && R(o, e.options) && !e.finalized && e.original.has(o)) {
-    const l = xe.createDraft({
+  const a = d(c), u = ((i = (s = e.options).mark) === null || i === void 0 ? void 0 : i.call(s, c, O)) === O.mutable;
+  if (e.options.strict && ce(o, e.options, u), !u && !a && E(o, e.options) && !e.finalized && e.original.has(o)) {
+    const l = Me.createDraft({
       original: o,
       parentDraft: e,
       key: o,
@@ -518,39 +518,39 @@ const ce = (e, t, n = !1) => {
   };
 }, ae = {
   get size() {
-    return h(this).setMap.size;
+    return d(this).setMap.size;
   },
   has(e) {
-    const t = h(this);
+    const t = d(this);
     if (t.setMap.has(e))
       return !0;
     w(t);
-    const n = h(e);
+    const n = d(e);
     return !!(n && t.setMap.has(n.original));
   },
   add(e) {
-    const t = h(this);
-    return this.has(e) || (w(t), E(t), t.assignedMap.set(e, !0), t.setMap.set(e, e), Ie(t, e, e, X)), this;
+    const t = d(this);
+    return this.has(e) || (w(t), I(t), t.assignedMap.set(e, !0), t.setMap.set(e, e), Ee(t, e, e, G)), this;
   },
   delete(e) {
     if (!this.has(e))
       return !1;
-    const t = h(this);
-    w(t), E(t);
-    const n = h(e);
+    const t = d(this);
+    w(t), I(t);
+    const n = d(e);
     return n && t.setMap.has(n.original) ? (t.assignedMap.set(n.original, !1), t.setMap.delete(n.original)) : (!n && t.setMap.has(e) ? t.assignedMap.set(e, !1) : t.assignedMap.delete(e), t.setMap.delete(e));
   },
   clear() {
     if (!this.size)
       return;
-    const e = h(this);
-    w(e), E(e);
+    const e = d(this);
+    w(e), I(e);
     for (const t of e.original)
       e.assignedMap.set(t, !1);
     e.setMap.clear();
   },
   values() {
-    const e = h(this);
+    const e = d(this);
     w(e);
     const t = e.setMap.keys();
     return {
@@ -559,7 +559,7 @@ const ce = (e, t, n = !1) => {
     };
   },
   entries() {
-    const e = h(this);
+    const e = d(this);
     w(e);
     const t = e.setMap.keys();
     return {
@@ -605,13 +605,13 @@ Set.prototype.difference && Object.assign(ae, {
     return Set.prototype.isDisjointFrom.call(new Set(this.values()), e);
   }
 });
-const Ut = Reflect.ownKeys(ae), it = {
+const Wt = Reflect.ownKeys(ae), ot = {
   get(e, t, n) {
     var s, i;
     const r = (s = e.copy) === null || s === void 0 ? void 0 : s[t];
     if (r && e.finalities.draftsCache.has(r))
       return r;
-    if (t === et)
+    if (t === nt)
       return e;
     let o;
     if (e.options.mark) {
@@ -620,11 +620,11 @@ const Ut = Reflect.ownKeys(ae), it = {
         return e.options.strict && ce(u, e.options, !0), u;
     }
     const c = x(e);
-    if (c instanceof Map && Bt.includes(t))
-      return t === "size" ? Object.getOwnPropertyDescriptor(we, "size").get.call(e.proxy) : we[t].bind(e.proxy);
-    if (c instanceof Set && Ut.includes(t))
+    if (c instanceof Map && Kt.includes(t))
+      return t === "size" ? Object.getOwnPropertyDescriptor(ge, "size").get.call(e.proxy) : ge[t].bind(e.proxy);
+    if (c instanceof Set && Wt.includes(t))
       return t === "size" ? Object.getOwnPropertyDescriptor(ae, "size").get.call(e.proxy) : ae[t].bind(e.proxy);
-    if (!Y(c, t)) {
+    if (!J(c, t)) {
       const u = Ae(c, t);
       return u ? "value" in u ? u.value : (
         // !case: support for getter
@@ -632,22 +632,22 @@ const Ut = Reflect.ownKeys(ae), it = {
       ) : void 0;
     }
     const a = c[t];
-    if (e.options.strict && ce(a, e.options), e.finalized || !R(a, e.options))
+    if (e.options.strict && ce(a, e.options), e.finalized || !E(a, e.options))
       return a;
     if (a === pe(e.original, t)) {
-      if (w(e), e.copy[t] = Ne({
+      if (w(e), e.copy[t] = Ie({
         original: e.original[t],
         parentDraft: e,
         key: e.type === 1 ? Number(t) : t,
         finalities: e.finalities,
         options: e.options
       }), typeof o == "function") {
-        const u = h(e.copy[t]);
-        return w(u), E(u), u.copy;
+        const u = d(e.copy[t]);
+        return w(u), I(u), u.copy;
       }
       return e.copy[t];
     }
-    return T(a) && e.finalities.draftsCache.add(a), a;
+    return D(a) && e.finalities.draftsCache.add(a), a;
   },
   set(e, t, n) {
     var s;
@@ -659,8 +659,8 @@ const Ut = Reflect.ownKeys(ae), it = {
     const r = Ae(x(e), t);
     if (r?.set)
       return r.set.call(e.proxy, n), !0;
-    const o = pe(x(e), t), c = h(o);
-    return c && A(c.original, n) ? (e.copy[t] = n, e.assignedMap = (s = e.assignedMap) !== null && s !== void 0 ? s : /* @__PURE__ */ new Map(), e.assignedMap.set(t, !1), !0) : (A(n, o) && (n !== void 0 || Y(e.original, t)) || (w(e), E(e), Y(e.original, t) && A(n, e.original[t]) ? e.assignedMap.delete(t) : e.assignedMap.set(t, !0), e.copy[t] = n, Ie(e, t, n, X)), !0);
+    const o = pe(x(e), t), c = d(o);
+    return c && A(c.original, n) ? (e.copy[t] = n, e.assignedMap = (s = e.assignedMap) !== null && s !== void 0 ? s : /* @__PURE__ */ new Map(), e.assignedMap.set(t, !1), !0) : (A(n, o) && (n !== void 0 || J(e.original, t)) || (w(e), I(e), J(e.original, t) && A(n, e.original[t]) ? e.assignedMap.delete(t) : e.assignedMap.set(t, !0), e.copy[t] = n, Ee(e, t, n, G)), !0);
   },
   has(e, t) {
     return t in x(e);
@@ -688,10 +688,10 @@ const Ut = Reflect.ownKeys(ae), it = {
   },
   deleteProperty(e, t) {
     var n;
-    return e.type === 1 ? it.set.call(this, e, t, void 0, e.proxy) : (pe(e.original, t) !== void 0 || t in e.original ? (w(e), E(e), e.assignedMap.set(t, !1)) : (e.assignedMap = (n = e.assignedMap) !== null && n !== void 0 ? n : /* @__PURE__ */ new Map(), e.assignedMap.delete(t)), e.copy && delete e.copy[t], !0);
+    return e.type === 1 ? ot.set.call(this, e, t, void 0, e.proxy) : (pe(e.original, t) !== void 0 || t in e.original ? (w(e), I(e), e.assignedMap.set(t, !1)) : (e.assignedMap = (n = e.assignedMap) !== null && n !== void 0 ? n : /* @__PURE__ */ new Map(), e.assignedMap.delete(t)), e.copy && delete e.copy[t], !0);
   }
 };
-function Ne(e) {
+function Ie(e) {
   const { original: t, parentDraft: n, key: s, finalities: i, options: r } = e, o = $(t), c = {
     type: o,
     finalized: !1,
@@ -705,45 +705,45 @@ function Ne(e) {
     setMap: o === 3 ? new Map(t.entries()) : void 0
   };
   (s || "key" in e) && (c.key = s);
-  const { proxy: a, revoke: u } = Proxy.revocable(o === 1 ? Object.assign([], c) : c, it);
+  const { proxy: a, revoke: u } = Proxy.revocable(o === 1 ? Object.assign([], c) : c, ot);
   if (i.revoke.push(u), c.proxy = a, n) {
     const l = n;
-    l.finalities.draft.push((f, y) => {
-      var p, I;
-      const H = h(a);
+    l.finalities.draft.push((f, _) => {
+      var p, N;
+      const Q = d(a);
       let C = l.type === 3 ? l.setMap : l.copy;
-      const m = F(C, s), S = h(m);
-      if (S) {
-        let _ = S.original;
-        S.operated && (_ = Re(m)), Se(S), ge(S, X, f, y), l.options.enableAutoFreeze && (l.options.updatedValues = (p = l.options.updatedValues) !== null && p !== void 0 ? p : /* @__PURE__ */ new WeakMap(), l.options.updatedValues.set(_, S.original)), Z(C, s, _);
+      const b = F(C, s), m = d(b);
+      if (m) {
+        let P = m.original;
+        m.operated && (P = Pe(b)), me(m), Se(m, G, f, _), l.options.enableAutoFreeze && (l.options.updatedValues = (p = l.options.updatedValues) !== null && p !== void 0 ? p : /* @__PURE__ */ new WeakMap(), l.options.updatedValues.set(P, m.original)), X(C, s, P);
       }
-      (I = H.callbacks) === null || I === void 0 || I.forEach((_) => {
-        _(f, y);
+      (N = Q.callbacks) === null || N === void 0 || N.forEach((P) => {
+        P(f, _);
       });
     });
   } else {
-    const l = h(a);
-    l.finalities.draft.push((f, y) => {
-      Se(l), ge(l, X, f, y);
+    const l = d(a);
+    l.finalities.draft.push((f, _) => {
+      me(l), Se(l, G, f, _);
     });
   }
   return a;
 }
-xe.createDraft = Ne;
-function Kt(e, t, n, s, i) {
+Me.createDraft = Ie;
+function Vt(e, t, n, s, i) {
   var r;
-  const o = h(e), c = (r = o?.original) !== null && r !== void 0 ? r : e, a = !!t.length;
+  const o = d(e), c = (r = o?.original) !== null && r !== void 0 ? r : e, a = !!t.length;
   if (o?.operated)
     for (; o.finalities.draft.length > 0; )
       o.finalities.draft.pop()(n, s);
   const u = a ? t[0] : o ? o.operated ? o.copy : o.original : e;
-  return o && me(o), i && U(u, u, o?.options.updatedValues), [
+  return o && be(o), i && B(u, u, o?.options.updatedValues), [
     u,
-    n && a ? [{ op: b.Replace, path: [], value: t[0] }] : n,
-    s && a ? [{ op: b.Replace, path: [], value: c }] : s
+    n && a ? [{ op: y.Replace, path: [], value: t[0] }] : n,
+    s && a ? [{ op: y.Replace, path: [], value: c }] : s
   ];
 }
-function Wt(e, t) {
+function Lt(e, t) {
   var n;
   const s = {
     draft: [],
@@ -753,7 +753,7 @@ function Wt(e, t) {
   };
   let i, r;
   t.enablePatches && (i = [], r = []);
-  const c = ((n = t.mark) === null || n === void 0 ? void 0 : n.call(t, e, O)) === O.mutable || !R(e, t) ? e : Ne({
+  const c = ((n = t.mark) === null || n === void 0 ? void 0 : n.call(t, e, O)) === O.mutable || !E(e, t) ? e : Ie({
     original: e,
     parentDraft: null,
     finalities: s,
@@ -762,15 +762,15 @@ function Wt(e, t) {
   return [
     c,
     (a = []) => {
-      const [u, l, f] = Kt(c, a, i, r, t.enableAutoFreeze);
+      const [u, l, f] = Vt(c, a, i, r, t.enableAutoFreeze);
       return t.enablePatches ? [u, l, f] : u;
     }
   ];
 }
-function ve(e) {
+function we(e) {
   const { rootDraft: t, value: n, useRawReturn: s = !1, isRoot: i = !0 } = e;
-  Ee(n, (r, o, c) => {
-    const a = h(o);
+  Re(n, (r, o, c) => {
+    const a = d(o);
     if (a && t && a.finalities === t.finalities) {
       e.isContainDraft = !0;
       const u = a.original;
@@ -778,21 +778,21 @@ function ve(e) {
         const l = Array.from(c);
         c.clear(), l.forEach((f) => c.add(r === f ? u : f));
       } else
-        Z(c, r, u);
-    } else typeof o == "object" && o !== null && (e.value = o, e.isRoot = !1, ve(e));
+        X(c, r, u);
+    } else typeof o == "object" && o !== null && (e.value = o, e.isRoot = !1, we(e));
   }), i && (e.isContainDraft || console.warn("The return value does not contain any draft, please use 'rawReturn()' to wrap the return value to improve performance."), s && console.warn("The return value contains drafts, please don't use 'rawReturn()' to wrap the return value."));
 }
-function rt(e) {
+function ct(e) {
   var t;
-  const n = h(e);
-  if (!R(e, n?.options))
+  const n = d(e);
+  if (!E(e, n?.options))
     return e;
   const s = $(e);
   if (n && !n.operated)
     return n.original;
   let i;
   function r() {
-    i = s === 2 ? Pe(e) ? new Map(e) : new (Object.getPrototypeOf(e)).constructor(e) : s === 3 ? Array.from(n.setMap.values()) : nt(e, n?.options);
+    i = s === 2 ? Oe(e) ? new Map(e) : new (Object.getPrototypeOf(e)).constructor(e) : s === 3 ? Array.from(n.setMap.values()) : it(e, n?.options);
   }
   if (n) {
     n.finalized = !0;
@@ -803,134 +803,134 @@ function rt(e) {
     }
   } else
     i = e;
-  if (Ee(i, (o, c) => {
+  if (Re(i, (o, c) => {
     if (n && A(F(n.original, o), c))
       return;
-    const a = rt(c);
-    a !== c && (i === e && r(), Z(i, o, a));
+    const a = ct(c);
+    a !== c && (i === e && r(), X(i, o, a));
   }), s === 3) {
     const o = (t = n?.original) !== null && t !== void 0 ? t : i;
-    return Oe(o) ? new Set(i) : new (Object.getPrototypeOf(o)).constructor(i);
+    return xe(o) ? new Set(i) : new (Object.getPrototypeOf(o)).constructor(i);
   }
   return i;
 }
 function De(e) {
-  if (!T(e))
+  if (!D(e))
     throw new Error(`current() is only used for Draft, parameter: ${e}`);
-  return rt(e);
+  return ct(e);
 }
-const Vt = (e) => function t(n, s, i) {
+const Jt = (e) => function t(n, s, i) {
   var r, o, c;
   if (typeof n == "function" && typeof s != "function")
-    return function(d, ...N) {
-      return t(d, (D) => n.call(this, D, ...N), s);
+    return function(h, ...g) {
+      return t(h, (j) => n.call(this, j, ...g), s);
     };
   const a = n, u = s;
   let l = i;
   if (typeof s != "function" && (l = s), l !== void 0 && Object.prototype.toString.call(l) !== "[object Object]")
     throw new Error(`Invalid options: ${l}, 'options' should be an object.`);
   l = Object.assign(Object.assign({}, e), l);
-  const f = T(a) ? De(a) : a, y = Array.isArray(l.mark) ? ((d, N) => {
-    for (const D of l.mark) {
-      if (typeof D != "function")
-        throw new Error(`Invalid mark: ${D}, 'mark' should be a function.`);
-      const L = D(d, N);
-      if (L)
-        return L;
+  const f = D(a) ? De(a) : a, _ = Array.isArray(l.mark) ? ((h, g) => {
+    for (const j of l.mark) {
+      if (typeof j != "function")
+        throw new Error(`Invalid mark: ${j}, 'mark' should be a function.`);
+      const V = j(h, g);
+      if (V)
+        return V;
     }
-  }) : l.mark, p = (r = l.enablePatches) !== null && r !== void 0 ? r : !1, I = (o = l.strict) !== null && o !== void 0 ? o : !1, C = {
+  }) : l.mark, p = (r = l.enablePatches) !== null && r !== void 0 ? r : !1, N = (o = l.strict) !== null && o !== void 0 ? o : !1, C = {
     enableAutoFreeze: (c = l.enableAutoFreeze) !== null && c !== void 0 ? c : !1,
-    mark: y,
-    strict: I,
+    mark: _,
+    strict: N,
     enablePatches: p
   };
-  if (!R(f, C) && typeof f == "object" && f !== null)
+  if (!E(f, C) && typeof f == "object" && f !== null)
     throw new Error("Invalid base state: create() only supports plain objects, arrays, Set, Map or using mark() to mark the state as immutable.");
-  const [m, S] = Wt(f, C);
+  const [b, m] = Lt(f, C);
   if (typeof s != "function") {
-    if (!R(f, C))
+    if (!E(f, C))
       throw new Error("Invalid base state: create() only supports plain objects, arrays, Set, Map or using mark() to mark the state as immutable.");
-    return [m, S];
+    return [b, m];
   }
-  let _;
+  let P;
   try {
-    _ = u(m);
-  } catch (d) {
-    throw me(h(m)), d;
-  }
-  const j = (d) => {
-    const N = h(m);
-    if (!T(d)) {
-      if (d !== void 0 && !A(d, m) && N?.operated)
+    P = u(b);
+  } catch (h) {
+    throw be(d(b)), h;
+  }
+  const Z = (h) => {
+    const g = d(b);
+    if (!D(h)) {
+      if (h !== void 0 && !A(h, b) && g?.operated)
         throw new Error("Either the value is returned as a new non-draft value, or only the draft is modified without returning any value.");
-      const L = d?.[Ft];
-      if (L) {
-        const bt = L[0];
-        return C.strict && typeof d == "object" && d !== null && ve({
-          rootDraft: N,
-          value: d,
+      const V = h?.[Dt];
+      if (V) {
+        const St = V[0];
+        return C.strict && typeof h == "object" && h !== null && we({
+          rootDraft: g,
+          value: h,
           useRawReturn: !0
-        }), S([bt]);
+        }), m([St]);
       }
-      if (d !== void 0)
-        return typeof d == "object" && d !== null && ve({ rootDraft: N, value: d }), S([d]);
+      if (h !== void 0)
+        return typeof h == "object" && h !== null && we({ rootDraft: g, value: h }), m([h]);
     }
-    if (d === m || d === void 0)
-      return S([]);
-    const D = h(d);
-    if (C === D.options) {
-      if (D.operated)
+    if (h === b || h === void 0)
+      return m([]);
+    const j = d(h);
+    if (C === j.options) {
+      if (j.operated)
         throw new Error("Cannot return a modified child draft.");
-      return S([De(d)]);
+      return m([De(h)]);
     }
-    return S([d]);
+    return m([h]);
   };
-  return _ instanceof Promise ? _.then(j, (d) => {
-    throw me(h(m)), d;
-  }) : j(_);
-}, P = Vt();
+  return P instanceof Promise ? P.then(Z, (h) => {
+    throw be(d(b)), h;
+  }) : Z(P);
+}, R = Jt();
 Object.prototype.constructor.toString();
-var Lt = /\s/;
-function Jt(e) {
-  for (var t = e.length; t-- && Lt.test(e.charAt(t)); )
+var Yt = /\s/;
+function Gt(e) {
+  for (var t = e.length; t-- && Yt.test(e.charAt(t)); )
     ;
   return t;
 }
-var Yt = /^\s+/;
-function Gt(e) {
-  return e && e.slice(0, Jt(e) + 1).replace(Yt, "");
+var Xt = /^\s+/;
+function Zt(e) {
+  return e && e.slice(0, Gt(e) + 1).replace(Xt, "");
 }
-var Te = NaN, Xt = /^[-+]0x[0-9a-f]+$/i, Zt = /^0b[01]+$/i, kt = /^0o[0-7]+$/i, en = parseInt;
+var Te = NaN, kt = /^[-+]0x[0-9a-f]+$/i, en = /^0b[01]+$/i, tn = /^0o[0-7]+$/i, nn = parseInt;
 function ne(e) {
   if (typeof e == "number")
     return e;
   if (oe(e))
     return Te;
-  if (G(e)) {
+  if (Y(e)) {
     var t = typeof e.valueOf == "function" ? e.valueOf() : e;
-    e = G(t) ? t + "" : t;
+    e = Y(t) ? t + "" : t;
   }
   if (typeof e != "string")
     return e === 0 ? e : +e;
-  e = Gt(e);
-  var n = Zt.test(e);
-  return n || kt.test(e) ? en(e.slice(2), n ? 2 : 8) : Xt.test(e) ? Te : +e;
+  e = Zt(e);
+  var n = en.test(e);
+  return n || tn.test(e) ? nn(e.slice(2), n ? 2 : 8) : kt.test(e) ? Te : +e;
 }
-var qe = 1 / 0, tn = 17976931348623157e292;
-function nn(e) {
+var qe = 1 / 0, sn = 17976931348623157e292;
+function rn(e) {
   if (!e)
     return e === 0 ? e : 0;
   if (e = ne(e), e === qe || e === -qe) {
     var t = e < 0 ? -1 : 1;
-    return t * tn;
+    return t * sn;
   }
   return e === e ? e : 0;
 }
-function ot(e) {
-  var t = nn(e), n = t % 1;
+function at(e) {
+  var t = rn(e), n = t % 1;
   return t === t ? n ? t - n : t : 0;
 }
-function sn(e, t, n) {
+function on(e, t, n) {
   switch (n.length) {
     case 0:
       return e.call(t);
@@ -943,50 +943,50 @@ function sn(e, t, n) {
   }
   return e.apply(t, n);
 }
-var rn = 800, on = 16, cn = Date.now;
-function an(e) {
+var cn = 800, an = 16, un = Date.now;
+function ln(e) {
   var t = 0, n = 0;
   return function() {
-    var s = cn(), i = on - (s - n);
+    var s = un(), i = an - (s - n);
     if (n = s, i > 0) {
-      if (++t >= rn)
+      if (++t >= cn)
         return arguments[0];
     } else
       t = 0;
     return e.apply(void 0, arguments);
   };
 }
-function un(e) {
+function fn(e) {
   return function() {
     return e;
   };
 }
 var ue = (function() {
   try {
-    var e = mt(Object, "defineProperty");
+    var e = gt(Object, "defineProperty");
     return e({}, "", {}), e;
   } catch {
   }
-})(), ln = ue ? function(e, t) {
+})(), hn = ue ? function(e, t) {
   return ue(e, "toString", {
     configurable: !0,
     enumerable: !1,
-    value: un(t),
+    value: fn(t),
     writable: !0
   });
-} : fe, fn = an(ln);
-function hn(e, t) {
+} : fe, dn = ln(hn);
+function pn(e, t) {
   for (var n = -1, s = e == null ? 0 : e.length; ++n < s && t(e[n], n, e) !== !1; )
     ;
   return e;
 }
-function dn(e, t, n, s) {
+function _n(e, t, n, s) {
   for (var i = e.length, r = n + -1; ++r < i; )
     if (t(e[r], r, e))
       return r;
   return -1;
 }
-function pn(e, t, n) {
+function yn(e, t, n) {
   t == "__proto__" && ue ? ue(e, t, {
     configurable: !0,
     enumerable: !0,
@@ -994,83 +994,83 @@ function pn(e, t, n) {
     writable: !0
   }) : e[t] = n;
 }
-var _n = Object.prototype, yn = _n.hasOwnProperty;
-function bn(e, t, n) {
+var bn = Object.prototype, mn = bn.hasOwnProperty;
+function Sn(e, t, n) {
   var s = e[t];
-  (!(yn.call(e, t) && Je(s, n)) || n === void 0 && !(t in e)) && pn(e, t, n);
+  (!(mn.call(e, t) && Ge(s, n)) || n === void 0 && !(t in e)) && yn(e, t, n);
 }
-var Qe = Math.max;
-function mn(e, t, n) {
-  return t = Qe(t === void 0 ? e.length - 1 : t, 0), function() {
-    for (var s = arguments, i = -1, r = Qe(s.length - t, 0), o = Array(r); ++i < r; )
+var $e = Math.max;
+function gn(e, t, n) {
+  return t = $e(t === void 0 ? e.length - 1 : t, 0), function() {
+    for (var s = arguments, i = -1, r = $e(s.length - t, 0), o = Array(r); ++i < r; )
       o[i] = s[t + i];
     i = -1;
     for (var c = Array(t + 1); ++i < t; )
       c[i] = s[i];
-    return c[t] = n(o), sn(e, this, c);
+    return c[t] = n(o), on(e, this, c);
   };
 }
-function Sn(e, t) {
-  return fn(mn(e, t, fe), e + "");
+function wn(e, t) {
+  return dn(gn(e, t, fe), e + "");
 }
-function $e(e, t, n) {
-  if (!G(n))
+function Qe(e, t, n) {
+  if (!Y(n))
     return !1;
   var s = typeof t;
-  return (s == "number" ? he(n) && Ye(t, n.length) : s == "string" && t in n) ? Je(n[t], e) : !1;
+  return (s == "number" ? he(n) && Xe(t, n.length) : s == "string" && t in n) ? Ge(n[t], e) : !1;
 }
-var He = ze ? ze.isConcatSpreadable : void 0;
-function gn(e) {
-  return W(e) || Ge(e) || !!(He && e && e[He]);
+var He = Ne ? Ne.isConcatSpreadable : void 0;
+function vn(e) {
+  return K(e) || Ze(e) || !!(He && e && e[He]);
 }
-function wn(e, t, n, s, i) {
+function Cn(e, t, n, s, i) {
   var r = -1, o = e.length;
-  for (n || (n = gn), i || (i = []); ++r < o; ) {
+  for (n || (n = vn), i || (i = []); ++r < o; ) {
     var c = e[r];
-    n(c) ? St(i, c) : i[i.length] = c;
+    n(c) ? wt(i, c) : i[i.length] = c;
   }
   return i;
 }
-function vn(e, t, n) {
+function Mn(e, t, n) {
   var s = -1, i = e.length;
   t < 0 && (t = -t > i ? 0 : i + t), n = n > i ? i : n, n < 0 && (n += i), i = t > n ? 0 : n - t >>> 0, t >>>= 0;
   for (var r = Array(i); ++s < i; )
     r[s] = e[s + t];
   return r;
 }
-var Cn = "\\ud800-\\udfff", Mn = "\\u0300-\\u036f", xn = "\\ufe20-\\ufe2f", On = "\\u20d0-\\u20ff", Pn = Mn + xn + On, Rn = "\\ufe0e\\ufe0f", En = "\\u200d", In = RegExp("[" + En + Cn + Pn + Rn + "]");
-function Nn(e) {
-  return In.test(e);
+var xn = "\\ud800-\\udfff", On = "\\u0300-\\u036f", Pn = "\\ufe20-\\ufe2f", Rn = "\\u20d0-\\u20ff", En = On + Pn + Rn, In = "\\ufe0e\\ufe0f", Nn = "\\u200d", zn = RegExp("[" + Nn + xn + En + In + "]");
+function An(e) {
+  return zn.test(e);
 }
-function zn(e, t, n) {
+function Fn(e, t, n) {
   return e === e && (n !== void 0 && (e = e <= n ? e : n), t !== void 0 && (e = e >= t ? e : t)), e;
 }
-function An(e, t, n) {
-  return n === void 0 && (n = t, t = void 0), n !== void 0 && (n = ne(n), n = n === n ? n : 0), t !== void 0 && (t = ne(t), t = t === t ? t : 0), zn(ne(e), t, n);
+function jn(e, t, n) {
+  return n === void 0 && (n = t, t = void 0), n !== void 0 && (n = ne(n), n = n === n ? n : 0), t !== void 0 && (t = ne(t), t = t === t ? t : 0), Fn(ne(e), t, n);
 }
-function Fn(e) {
+function Dn(e) {
   return typeof e == "function" ? e : fe;
 }
 function k(e, t) {
-  var n = W(e) ? hn : Xe;
-  return n(e, Fn(t));
+  var n = K(e) ? pn : ke;
+  return n(e, Dn(t));
 }
-function jn(e, t) {
+function Tn(e, t) {
   var n = [];
-  return Xe(e, function(s, i, r) {
+  return ke(e, function(s, i, r) {
     t(s, i, r) && n.push(s);
   }), n;
 }
 function se(e, t) {
-  var n = W(e) ? gt : jn;
-  return n(e, V(t));
+  var n = K(e) ? vt : Tn;
+  return n(e, W(t));
 }
-function Dn(e) {
+function qn(e) {
   return function(t, n, s) {
     var i = Object(t);
     if (!he(t)) {
-      var r = V(n);
-      t = wt(t), n = function(c) {
+      var r = W(n);
+      t = Ct(t), n = function(c) {
         return r(i[c], c, i);
       };
     }
@@ -1078,52 +1078,52 @@ function Dn(e) {
     return o > -1 ? i[r ? t[o] : o] : void 0;
   };
 }
-var Tn = Math.max;
+var $n = Math.max;
 function ie(e, t, n) {
   var s = e == null ? 0 : e.length;
   if (!s)
     return -1;
-  var i = n == null ? 0 : ot(n);
-  return i < 0 && (i = Tn(s + i, 0)), dn(e, V(t), i);
+  var i = n == null ? 0 : at(n);
+  return i < 0 && (i = $n(s + i, 0)), _n(e, W(t), i);
 }
-var Be = Dn(ie);
-function qn(e) {
+var Be = qn(ie);
+function Qn(e) {
   return e && e.length ? e[0] : void 0;
 }
-function Qn(e, t) {
+function Hn(e, t) {
   return e > t;
 }
-var $n = "[object String]";
-function ct(e) {
-  return typeof e == "string" || !W(e) && vt(e) && Ct(e) == $n;
+var Bn = "[object String]";
+function ut(e) {
+  return typeof e == "string" || !K(e) && Mt(e) && xt(e) == Bn;
 }
-var Hn = "[object Map]", Bn = "[object Set]", Un = Object.prototype, Kn = Un.hasOwnProperty;
-function Wn(e) {
+var Un = "[object Map]", Kn = "[object Set]", Wn = Object.prototype, Vn = Wn.hasOwnProperty;
+function Ln(e) {
   if (e == null)
     return !0;
-  if (he(e) && (W(e) || typeof e == "string" || typeof e.splice == "function" || Mt(e) || xt(e) || Ge(e)))
+  if (he(e) && (K(e) || typeof e == "string" || typeof e.splice == "function" || Ot(e) || Pt(e) || Ze(e)))
     return !e.length;
-  var t = Ze(e);
-  if (t == Hn || t == Bn)
+  var t = et(e);
+  if (t == Un || t == Kn)
     return !e.size;
-  if (Ot(e))
-    return !ke(e).length;
+  if (Rt(e))
+    return !tt(e).length;
   for (var n in e)
-    if (Kn.call(e, n))
+    if (Vn.call(e, n))
       return !1;
   return !0;
 }
-function at(e, t) {
-  return Pt(e, t);
+function lt(e, t) {
+  return Et(e, t);
 }
-var Vn = Array.prototype, Ln = Vn.join;
+var Jn = Array.prototype, Yn = Jn.join;
 function _e(e, t) {
-  return e == null ? "" : Ln.call(e, t);
+  return e == null ? "" : Yn.call(e, t);
 }
-function Jn(e, t) {
+function Gn(e, t) {
   return e < t;
 }
-function ut(e, t, n) {
+function ft(e, t, n) {
   for (var s = -1, i = e.length; ++s < i; ) {
     var r = e[s], o = t(r);
     if (o != null && (c === void 0 ? o === o && !oe(o) : n(o, c)))
@@ -1132,34 +1132,34 @@ function ut(e, t, n) {
   return a;
 }
 function Ue(e, t) {
-  return e && e.length ? ut(e, V(t), Qn) : void 0;
+  return e && e.length ? ft(e, W(t), Hn) : void 0;
 }
-function Yn(e, t) {
-  return e && e.length ? ut(e, V(t), Jn) : void 0;
+function Xn(e, t) {
+  return e && e.length ? ft(e, W(t), Gn) : void 0;
 }
-function Gn(e, t, n, s) {
-  if (!G(e))
+function Zn(e, t, n, s) {
+  if (!Y(e))
     return e;
-  t = Rt(t, e);
+  t = It(t, e);
   for (var i = -1, r = t.length, o = r - 1, c = e; c != null && ++i < r; ) {
-    var a = Et(t[i]), u = n;
+    var a = Nt(t[i]), u = n;
     if (a === "__proto__" || a === "constructor" || a === "prototype")
       return e;
     if (i != o) {
       var l = c[a];
-      u = void 0, u === void 0 && (u = G(l) ? l : Ye(t[i + 1]) ? [] : {});
+      u = void 0, u === void 0 && (u = Y(l) ? l : Xe(t[i + 1]) ? [] : {});
     }
-    bn(c, a, u), c = c[a];
+    Sn(c, a, u), c = c[a];
   }
   return e;
 }
-function Xn(e, t) {
+function kn(e, t) {
   var n = e.length;
   for (e.sort(t); n--; )
     e[n] = e[n].value;
   return e;
 }
-function Zn(e, t) {
+function es(e, t) {
   if (e !== t) {
     var n = e !== void 0, s = e === null, i = e === e, r = oe(e), o = t !== void 0, c = t === null, a = t === t, u = oe(t);
     if (!c && !u && !r && e > t || r && o && a && !c && !u || s && o && a || !n && a || !i)
@@ -1169,9 +1169,9 @@ function Zn(e, t) {
   }
   return 0;
 }
-function kn(e, t, n) {
+function ts(e, t, n) {
   for (var s = -1, i = e.criteria, r = t.criteria, o = i.length, c = n.length; ++s < o; ) {
-    var a = Zn(i[s], r[s]);
+    var a = es(i[s], r[s]);
     if (a) {
       if (s >= c)
         return a;
@@ -1181,56 +1181,56 @@ function kn(e, t, n) {
   }
   return e.index - t.index;
 }
-function es(e, t, n) {
+function ns(e, t, n) {
   t.length ? t = de(t, function(r) {
-    return W(r) ? function(o) {
-      return It(o, r.length === 1 ? r[0] : r);
+    return K(r) ? function(o) {
+      return zt(o, r.length === 1 ? r[0] : r);
     } : r;
   }) : t = [fe];
   var s = -1;
-  t = de(t, Nt(V));
-  var i = zt(e, function(r, o, c) {
+  t = de(t, At(W));
+  var i = Ft(e, function(r, o, c) {
     var a = de(t, function(u) {
       return u(r);
     });
     return { criteria: a, index: ++s, value: r };
   });
-  return Xn(i, function(r, o) {
-    return kn(r, o, n);
+  return kn(i, function(r, o) {
+    return ts(r, o, n);
   });
 }
-var ts = At("length"), lt = "\\ud800-\\udfff", ns = "\\u0300-\\u036f", ss = "\\ufe20-\\ufe2f", is = "\\u20d0-\\u20ff", rs = ns + ss + is, os = "\\ufe0e\\ufe0f", cs = "[" + lt + "]", Ce = "[" + rs + "]", Me = "\\ud83c[\\udffb-\\udfff]", as = "(?:" + Ce + "|" + Me + ")", ft = "[^" + lt + "]", ht = "(?:\\ud83c[\\udde6-\\uddff]){2}", dt = "[\\ud800-\\udbff][\\udc00-\\udfff]", us = "\\u200d", pt = as + "?", _t = "[" + os + "]?", ls = "(?:" + us + "(?:" + [ft, ht, dt].join("|") + ")" + _t + pt + ")*", fs = _t + pt + ls, hs = "(?:" + [ft + Ce + "?", Ce, ht, dt, cs].join("|") + ")", Ke = RegExp(Me + "(?=" + Me + ")|" + hs + fs, "g");
-function ds(e) {
+var ss = jt("length"), ht = "\\ud800-\\udfff", is = "\\u0300-\\u036f", rs = "\\ufe20-\\ufe2f", os = "\\u20d0-\\u20ff", cs = is + rs + os, as = "\\ufe0e\\ufe0f", us = "[" + ht + "]", ve = "[" + cs + "]", Ce = "\\ud83c[\\udffb-\\udfff]", ls = "(?:" + ve + "|" + Ce + ")", dt = "[^" + ht + "]", pt = "(?:\\ud83c[\\udde6-\\uddff]){2}", _t = "[\\ud800-\\udbff][\\udc00-\\udfff]", fs = "\\u200d", yt = ls + "?", bt = "[" + as + "]?", hs = "(?:" + fs + "(?:" + [dt, pt, _t].join("|") + ")" + bt + yt + ")*", ds = bt + yt + hs, ps = "(?:" + [dt + ve + "?", ve, pt, _t, us].join("|") + ")", Ke = RegExp(Ce + "(?=" + Ce + ")|" + ps + ds, "g");
+function _s(e) {
   for (var t = Ke.lastIndex = 0; Ke.test(e); )
     ++t;
   return t;
 }
-function ps(e) {
-  return Nn(e) ? ds(e) : ts(e);
+function ys(e) {
+  return An(e) ? _s(e) : ss(e);
 }
-function _s(e, t, n) {
-  return e == null ? e : Gn(e, t, n);
+function bs(e, t, n) {
+  return e == null ? e : Zn(e, t, n);
 }
-var ys = "[object Map]", bs = "[object Set]";
-function Q(e) {
+var ms = "[object Map]", Ss = "[object Set]";
+function q(e) {
   if (e == null)
     return 0;
   if (he(e))
-    return ct(e) ? ps(e) : e.length;
-  var t = Ze(e);
-  return t == ys || t == bs ? e.size : ke(e).length;
+    return ut(e) ? ys(e) : e.length;
+  var t = et(e);
+  return t == ms || t == Ss ? e.size : tt(e).length;
 }
-var re = Sn(function(e, t) {
+var re = wn(function(e, t) {
   if (e == null)
     return [];
   var n = t.length;
-  return n > 1 && $e(e, t[0], t[1]) ? t = [] : n > 2 && $e(t[0], t[1], t[2]) && (t = [t[0]]), es(e, wn(t), []);
+  return n > 1 && Qe(e, t[0], t[1]) ? t = [] : n > 2 && Qe(t[0], t[1], t[2]) && (t = [t[0]]), ns(e, Cn(t), []);
 });
-function ms(e, t, n) {
-  return e && e.length ? (t = t === void 0 ? 1 : ot(t), vn(e, 0, t < 0 ? 0 : t)) : [];
+function gs(e, t, n) {
+  return e && e.length ? (t = t === void 0 ? 1 : at(t), Mn(e, 0, t < 0 ? 0 : t)) : [];
 }
-const Ss = (e, t) => e ? e.type === "create" && t.type === "delete" ? null : e.type === "create" && t.type === "update" ? { ...e, data: t.data } : (e.type === "update" && t.type === "update" || e.type === "update" && t.type === "delete", t) : t;
-class gs {
+const ws = (e, t) => e ? e.type === "create" && t.type === "delete" ? null : e.type === "create" && t.type === "update" ? { ...e, data: t.data } : (e.type === "update" && t.type === "update" || e.type === "update" && t.type === "delete", t) : t;
+class vs {
   _config;
   _state;
   _subscribers = /* @__PURE__ */ new Set();
@@ -1247,7 +1247,7 @@ class gs {
   }
   enqueue(t) {
     this._updateState((n) => {
-      const s = n.queue.get(t.id), i = Ss(s, t);
+      const s = n.queue.get(t.id), i = ws(s, t);
       i ? n.queue.set(t.id, i) : n.queue.delete(t.id), n.errors.delete(t.id);
     }), this._scheduleFlush();
   }
@@ -1297,7 +1297,7 @@ class gs {
     return this._subscribers.add(t), () => this._subscribers.delete(t);
   }
   _updateState(t) {
-    this._state = P(this._state, t), this._subscribers.forEach((n) => n());
+    this._state = R(this._state, t), this._subscribers.forEach((n) => n());
   }
   _scheduleFlush() {
     this._state.isPaused || this._state.isSyncing || (this._clearTimer(), this._debounceTimer = setTimeout(() => this._flush(), this._config.debounce));
@@ -1307,8 +1307,8 @@ class gs {
   }
   async _flush() {
     const { isPaused: t, isSyncing: n, queue: s } = this._state;
-    if (t || n || Wn(s)) return;
-    const i = z(this._config, "batchSize", 1 / 0), r = [...s.entries()], o = ms(r, i), c = r.slice(Q(o));
+    if (t || n || Ln(s)) return;
+    const i = z(this._config, "batchSize", 1 / 0), r = [...s.entries()], o = gs(r, i), c = r.slice(q(o));
     this._updateState((l) => {
       l.inFlight = new Map(o), l.queue = new Map(c), l.isSyncing = !0;
     });
@@ -1320,7 +1320,7 @@ class gs {
     } catch (l) {
       this._handleError(l);
     }
-    this._abortController = null, Q(this._state.queue) > 0 && !this._state.isPaused && this._scheduleFlush();
+    this._abortController = null, q(this._state.queue) > 0 && !this._state.isPaused && this._scheduleFlush();
   }
   _processResponse(t) {
     const n = this._state.inFlight, s = new Map((t.syncResults ?? []).map((i) => [i.id, i]));
@@ -1339,11 +1339,11 @@ class gs {
         }
       }
       i.inFlight = /* @__PURE__ */ new Map(), i.isSyncing = !1;
-    }), this._config.onServerItems && Q(t.items) > 0) {
+    }), this._config.onServerItems && q(t.items) > 0) {
       const i = new Set((t.syncResults ?? []).map((o) => o.id)), r = (t.items ?? []).filter(
         (o) => !i.has(o.id)
       );
-      Q(r) > 0 && this._config.onServerItems(r);
+      q(r) > 0 && this._config.onServerItems(r);
     }
   }
   _handleError(t) {
@@ -1364,7 +1364,7 @@ class gs {
     });
   }
 }
-class ws {
+class Cs {
   _cache = /* @__PURE__ */ new Map();
   _capacity;
   _ttl;
@@ -1397,7 +1397,7 @@ class ws {
     return this._cache.size;
   }
 }
-class vs {
+class Ms {
   _config;
   _cache;
   _state = { status: "idle", items: [] };
@@ -1405,11 +1405,11 @@ class vs {
   _abortController = null;
   _currentContext = null;
   constructor(t) {
-    this._config = { retries: 0, ...t }, this._cache = new ws(t.cacheCapacity, t.cacheTtl);
+    this._config = { retries: 0, ...t }, this._cache = new Cs(t.cacheCapacity, t.cacheTtl);
   }
   _getCacheKey = (t) => JSON.stringify([this._config.id, t]);
   _setState(t) {
-    this._state = P(this._state, (n) => {
+    this._state = R(this._state, (n) => {
       Object.assign(n, t);
     }), this._subscribers.forEach((n) => n());
   }
@@ -1501,7 +1501,7 @@ class We {
   }
   getStatus() {
     const t = this._collection.getItemStatus(this._id);
-    return at(this._cachedStatus, t) || (this._cachedStatus = t), this._cachedStatus;
+    return lt(this._cachedStatus, t) || (this._cachedStatus = t), this._cachedStatus;
   }
   exists() {
     return this._collection.getState().items.has(this._id);
@@ -1510,12 +1510,12 @@ class We {
     return this._collection;
   }
 }
-const Cs = ".";
-function B(e, t) {
+const xs = ".";
+function H(e, t) {
   const n = e.lastIndexOf(t);
   return n === -1 ? null : e.slice(0, n);
 }
-function Ms(e, t, n) {
+function Os(e, t, n) {
   return e.startsWith(t + n) ? !e.slice(t.length + 1).includes(n) : !1;
 }
 function ye(e, t, n) {
@@ -1532,7 +1532,7 @@ class Le {
     this._collection = t, this._id = n;
   }
   get _separator() {
-    return this._collection.config.nodeSeparator ?? Cs;
+    return this._collection.config.nodeSeparator ?? xs;
   }
   get id() {
     return this._id;
@@ -1551,7 +1551,7 @@ class Le {
   }
   getStatus() {
     const t = this._collection.getItemStatus(this._id);
-    return at(this._cachedStatus, t) || (this._cachedStatus = t), this._cachedStatus;
+    return lt(this._cachedStatus, t) || (this._cachedStatus = t), this._cachedStatus;
   }
   _touch(t) {
     this._collection.items.has(t) && this._collection.update(t, (n) => {
@@ -1559,24 +1559,24 @@ class Le {
     });
   }
   getParent() {
-    const t = B(this._id, this._separator);
+    const t = H(this._id, this._separator);
     return t ? this._collection.getNode(t) : null;
   }
   getChildren() {
-    const t = [...this._collection.items.entries()], n = K(
-      se(t, ([i]) => Ms(i, this._id, this._separator)),
+    const t = [...this._collection.items.entries()], n = U(
+      se(t, ([i]) => Os(i, this._id, this._separator)),
       ([i, r]) => ({ id: i, position: r.position })
     ), s = re(n, "position");
-    return K(s, (i) => this._collection.getNode(i.id));
+    return U(s, (i) => this._collection.getNode(i.id));
   }
   _generateChildId() {
-    const { getNodeId: t } = this._collection.config, n = t ? t() : be();
+    const { getNodeId: t } = this._collection.config, n = t ? t() : ze();
     return _e([this._id, n], this._separator);
   }
   moveUp() {
     const t = this.data;
     if (!t) return;
-    const n = B(this._id, this._separator);
+    const n = H(this._id, this._separator);
     if (!n) return;
     const i = this._collection.getNode(n).getChildren(), r = ie(i, (u) => u.id === this._id);
     if (r <= 0) return;
@@ -1594,10 +1594,10 @@ class Le {
   moveDown() {
     const t = this.data;
     if (!t) return;
-    const n = B(this._id, this._separator);
+    const n = H(this._id, this._separator);
     if (!n) return;
     const i = this._collection.getNode(n).getChildren(), r = ie(i, (u) => u.id === this._id);
-    if (r === -1 || r >= Q(i) - 1) return;
+    if (r === -1 || r >= q(i) - 1) return;
     const o = i[r + 1], c = o.data;
     if (!c) return;
     const a = t.position;
@@ -1611,17 +1611,17 @@ class Le {
   }
   setPosition(t) {
     if (!this.data) return;
-    const s = B(this._id, this._separator);
+    const s = H(this._id, this._separator);
     if (!s) return;
     const r = this._collection.getNode(s).getChildren(), o = ie(r, (l) => l.id === this._id);
     if (o === -1) return;
-    const c = An(t, 0, Q(r) - 1);
+    const c = jn(t, 0, q(r) - 1);
     if (c === o) return;
     const a = [...r], [u] = a.splice(o, 1);
     a.splice(c, 0, u), this._collection.batch(() => {
       k(a, (l, f) => {
-        const y = l.data;
-        y && y.position !== f && this._collection.update(l.id, (p) => {
+        const _ = l.data;
+        _ && _.position !== f && this._collection.update(l.id, (p) => {
           p.position = f;
         });
       }), this._touch(s);
@@ -1634,7 +1634,7 @@ class Le {
     }), c;
   }
   prepend(t, n = "object") {
-    const s = this.getChildren(), i = Yn(s, (u) => z(u, "data.position", 0)), o = (i ? z(i, "data.position", 0) : 1) - 1, c = this._generateChildId(), a = { id: c, position: o, value: t, type: n };
+    const s = this.getChildren(), i = Xn(s, (u) => z(u, "data.position", 0)), o = (i ? z(i, "data.position", 0) : 1) - 1, c = this._generateChildId(), a = { id: c, position: o, value: t, type: n };
     return this._collection.batch(() => {
       this._collection.create(a), this._touch(this._id);
     }), c;
@@ -1649,7 +1649,7 @@ class Le {
   move(t, n) {
     const s = this.data;
     if (!s) return;
-    const i = B(this._id, this._separator);
+    const i = H(this._id, this._separator);
     if (!i) return;
     if (!n) {
       const o = s.position;
@@ -1683,7 +1683,7 @@ class Le {
   clone() {
     const t = this.data;
     if (!t) return /* @__PURE__ */ new Map();
-    const { getNodeId: n } = this._collection.config, s = n ? n() : be(), i = /* @__PURE__ */ new Map();
+    const { getNodeId: n } = this._collection.config, s = n ? n() : ze(), i = /* @__PURE__ */ new Map();
     i.set(s, {
       id: s,
       position: t.position,
@@ -1712,7 +1712,7 @@ class Le {
     if (t.size === 0) return;
     const s = [...t.keys()];
     let i = Be(s, (c) => !c.includes(this._separator));
-    if (i || (i = qn(re(s, (c) => c.length))), !i) return;
+    if (i || (i = Qn(re(s, (c) => c.length))), !i) return;
     const r = this._generateChildId();
     let o;
     if (n !== void 0)
@@ -1744,7 +1744,7 @@ class Le {
     });
   }
   remove() {
-    const t = B(this._id, this._separator), n = [...this._collection.items.keys()], s = K(
+    const t = H(this._id, this._separator), n = [...this._collection.items.keys()], s = U(
       se(n, (r) => ye(r, this._id, this._separator)),
       (r) => r
     ), i = [this._id, ...s];
@@ -1757,7 +1757,7 @@ class Le {
     this._collection.selectNode(this._id);
   }
 }
-function yt(e) {
+function mt(e) {
   const t = /* @__PURE__ */ new Map();
   if (e.serverItems)
     for (const n of e.serverItems)
@@ -1815,7 +1815,7 @@ class M {
       items: a.items ?? [],
       serverState: a.serverState
     })) : async () => ({ items: [] }), s = t.handler ? (o, c, a) => t.handler({ changes: o }, a) : async (o) => ({
-      syncResults: K(o, (c) => ({
+      syncResults: U(o, (c) => ({
         status: "success",
         id: c.id,
         type: c.type,
@@ -1823,12 +1823,12 @@ class M {
       })),
       serverSyncedAt: ""
     });
-    this._syncQueue = new gs({
+    this._syncQueue = new vs({
       debounce: t.syncDebounce ?? 300,
       maxRetries: t.syncRetries ?? 3,
       getContext: () => this._state.context,
       onSync: s
-    }), this._fetchHandler = new vs({
+    }), this._fetchHandler = new Ms({
       id: t.id,
       cacheCapacity: t.cacheCapacity ?? 10,
       cacheTtl: t.cacheTtl ?? 6e4,
@@ -1896,8 +1896,8 @@ class M {
   }
   create(t) {
     const { id: n } = t;
-    if (ct(n) && Q(n) > 0)
-      return this._state = P(this._state, (s) => {
+    if (ut(n) && q(n) > 0)
+      return this._state = R(this._state, (s) => {
         s.items.set(n, t);
       }), this._fetchHandler.invalidateCache(), this._notifySubscribers(), this._syncQueue.enqueue({ id: n, type: "create", data: t }), n;
     throw new Error("`id` property should exist and should be non-empty");
@@ -1905,14 +1905,14 @@ class M {
   update(t, n) {
     const s = this._state.items.get(t);
     if (!s) return;
-    const i = P(s, n);
-    this._state = P(this._state, (r) => {
-      _s(i, "id", t), r.items.set(t, i);
+    const i = R(s, n);
+    this._state = R(this._state, (r) => {
+      bs(i, "id", t), r.items.set(t, i);
     }), this._fetchHandler.invalidateCache(), this._notifySubscribers(), this._syncQueue.enqueue({ id: t, type: "update", data: i });
   }
   remove(t) {
     const n = this._state.items.get(t);
-    n && (this._state = P(this._state, (s) => {
+    n && (this._state = R(this._state, (s) => {
       s.items.delete(t);
     }), this._fetchHandler.invalidateCache(), this._notifySubscribers(), this._syncQueue.enqueue({ id: t, type: "delete", data: n }));
   }
@@ -1954,8 +1954,8 @@ class M {
     return this._selectedNodeId ? this.getNode(this._selectedNodeId) : null;
   }
   setContext(t) {
-    const n = this._state.context, s = P(n, t);
-    n !== s && (this._state = P(this._state, (i) => {
+    const n = this._state.context, s = R(n, t);
+    n !== s && (this._state = R(this._state, (i) => {
       i.context = s;
     }), this._fetchHandler.fetch(s), this._notifySubscribers());
   }
@@ -1977,7 +1977,7 @@ class M {
   async _initialFetch() {
     if (!this._hasInitialized) {
       if (this._hasInitialized = !0, this.config.serverItems) {
-        this._state = P(this._state, (t) => {
+        this._state = R(this._state, (t) => {
           for (const n of this.config.serverItems)
             t.items.set(n.id, n);
         }), this._notifySubscribers();
@@ -1991,7 +1991,7 @@ class M {
   }
   _onFetchChange() {
     const t = this._fetchHandler.getState();
-    this._state = P(this._state, (n) => {
+    this._state = R(this._state, (n) => {
       n.fetchStatus = t.status, n.fetchError = t.error, n.serverState = t.serverState, n.loading = t.status === "fetching", n.syncState = this._computeSyncState(t.status, n.syncQueue.isSyncing);
       const s = /* @__PURE__ */ new Map();
       for (const i of t.items)
@@ -2000,7 +2000,7 @@ class M {
     }), this._notifySubscribers();
   }
   _updateSyncState(t) {
-    this._state = P(this._state, (n) => {
+    this._state = R(this._state, (n) => {
       n.syncQueue = t, n.syncing = t.isSyncing, n.syncState = this._computeSyncState(n.fetchStatus, t.isSyncing);
     }), this._notifySubscribers();
   }
@@ -2013,8 +2013,8 @@ class M {
         t();
   }
 }
-function Es(e) {
-  const t = M.get(e), n = le(() => yt(e), [e.id]), s = v(
+function As(e) {
+  const t = M.get(e), n = le(() => mt(e), [e.id]), s = v(
     (i) => t.subscribe(i),
     () => t.getState(),
     () => n
@@ -2031,7 +2031,7 @@ function Es(e) {
     fetchError: s.fetchError,
     serverState: s.serverState,
     // Item operations
-    create: (i) => t.create({ ...i, id: be() }),
+    create: (i) => t.create(i),
     update: (i, r) => t.update(i, r),
     remove: (i) => t.remove(i),
     getItem: (i) => t.getItem(i),
@@ -2045,8 +2045,8 @@ function Es(e) {
     retrySync: (i) => t.retrySync(i)
   };
 }
-function Is(e) {
-  const t = e, n = M.get(t), s = le(() => yt(t), [e.id]), i = v(
+function Fs(e) {
+  const t = e, n = M.get(t), s = le(() => mt(t), [e.id]), i = v(
     (u) => n.subscribe(u),
     () => n.getState(),
     () => s
@@ -2062,14 +2062,14 @@ function Is(e) {
     (u) => n.subscribe(u),
     () => n.selectedNode,
     () => null
-  ), a = g(() => {
-    const u = e.nodeSeparator ?? ".", l = (y, p) => y.startsWith(p + u) ? !y.slice(p.length + 1).includes(u) : !1, f = (y) => {
-      const p = i.items.get(y);
+  ), a = S(() => {
+    const u = e.nodeSeparator ?? ".", l = (_, p) => _.startsWith(p + u) ? !_.slice(p.length + 1).includes(u) : !1, f = (_) => {
+      const p = i.items.get(_);
       if (!p) return null;
-      const I = K(
-        se([...i.items.entries()], ([m]) => l(m, y)),
-        ([m, S]) => ({ id: m, position: S.position })
-      ), H = re(I, "position"), C = K(H, (m) => f(m.id)).filter(Boolean);
+      const N = U(
+        se([...i.items.entries()], ([b]) => l(b, _)),
+        ([b, m]) => ({ id: b, position: m.position })
+      ), Q = re(N, "position"), C = U(Q, (b) => f(b.id)).filter(Boolean);
       return {
         id: p.id,
         type: p.type,
@@ -2111,69 +2111,72 @@ function Is(e) {
     toJson: a
   };
 }
-function Ns(e) {
-  const t = v(
-    (o) => e.collection.subscribe(o),
+function js(e, t) {
+  const n = t?.trackStatus ?? !0, s = v(
+    (a) => e.collection.subscribe(a),
     () => e.data,
     () => e.data
-  ), n = v(
-    (o) => e.collection.subscribe(o),
-    () => e.getStatus(),
-    () => e.getStatus()
-  ), s = v(
-    (o) => e.collection.subscribe(o),
+  ), i = v(
+    n ? (a) => e.collection.subscribe(a) : Ps,
+    n ? () => e.getStatus() : Je,
+    n ? () => e.getStatus() : Je
+  ), r = v(
+    (a) => e.collection.subscribe(a),
     () => e.exists(),
     () => e.exists()
-  ), i = g((o) => e.update(o), [e]), r = g(() => e.remove(), [e]);
-  return { data: t, status: n, update: i, remove: r, exists: s };
-}
-function xs(e) {
-  const t = g((_) => e.collection.subscribe(_), [e]), n = v(
-    t,
+  ), o = S((a) => e.update(a), [e]), c = S(() => e.remove(), [e]);
+  return { data: s, status: i, update: o, remove: c, exists: r };
+}
+const Ps = () => () => {
+}, Je = () => null;
+function Rs(e, t) {
+  const n = t?.trackStatus ?? !0, s = S((h) => e.collection.subscribe(h), [e]), i = v(
+    s,
     () => e.data,
     () => e.data
-  ), s = v(
-    t,
-    () => e.getStatus(),
-    () => e.getStatus()
-  ), i = v(
-    t,
+  ), r = v(
+    n ? s : Es,
+    n ? () => e.getStatus() : Ye,
+    n ? () => e.getStatus() : Ye
+  ), o = v(
+    s,
     () => e.exists(),
     () => e.exists()
-  ), r = v(
-    t,
+  ), c = v(
+    s,
     () => e.collection.selectedNodeId === e.id,
     () => e.collection.selectedNodeId === e.id
-  ), o = le(() => e.getChildren(), [n, e]), c = g(() => e.getParent(), [e]), a = g((_, j) => e.append(_, j), [e]), u = g((_, j) => e.prepend(_, j), [e]), l = g(
-    (_, j) => e.move(_, j),
+  ), a = le(() => e.getChildren(), [i, e]), u = S(() => e.getParent(), [e]), l = S((h, g) => e.append(h, g), [e]), f = S((h, g) => e.prepend(h, g), [e]), _ = S(
+    (h, g) => e.move(h, g),
     [e]
-  ), f = g(() => e.moveUp(), [e]), y = g(() => e.moveDown(), [e]), p = g((_) => e.setPosition(_), [e]), I = g(() => e.clone(), [e]), H = g(
-    (_) => e.updateProp(_),
+  ), p = S(() => e.moveUp(), [e]), N = S(() => e.moveDown(), [e]), Q = S((h) => e.setPosition(h), [e]), C = S(() => e.clone(), [e]), b = S(
+    (h) => e.updateProp(h),
     [e]
-  ), C = g(() => e.remove(), [e]), m = g(() => e.select(), [e]), S = g(() => e.collection.deselectNode(), [e]);
+  ), m = S(() => e.remove(), [e]), P = S(() => e.select(), [e]), Z = S(() => e.collection.deselectNode(), [e]);
   return {
     isPresent: !0,
-    data: n,
-    status: s,
-    exists: i,
-    isSelected: r,
+    data: i,
+    status: r,
+    exists: o,
+    isSelected: c,
     depth: e.depth,
-    getParent: c,
-    children: o,
-    append: a,
-    prepend: u,
-    move: l,
-    moveUp: f,
-    moveDown: y,
-    setPosition: p,
-    clone: I,
-    updateProp: H,
-    remove: C,
-    select: m,
-    deselect: S
+    getParent: u,
+    children: a,
+    append: l,
+    prepend: f,
+    move: _,
+    moveUp: p,
+    moveDown: N,
+    setPosition: Q,
+    clone: C,
+    updateProp: b,
+    remove: m,
+    select: P,
+    deselect: Z
   };
 }
-const Os = {
+const Es = () => () => {
+}, Ye = () => null, Is = {
   isPresent: !1,
   data: void 0,
   status: null,
@@ -2202,7 +2205,7 @@ const Os = {
   deselect: () => {
   }
 };
-function zs(e) {
+function Ds(e) {
   const t = M.getById(e);
   if (!t)
     throw new Error(
@@ -2212,10 +2215,10 @@ function zs(e) {
     (r) => t.subscribe(r),
     () => t.selectedNode,
     () => t.selectedNode
-  ), s = le(() => t.getNode("__dummy__"), [t]), i = xs(n ?? s);
-  return n ? i : Os;
+  ), s = le(() => t.getNode("__dummy__"), [t]), i = Rs(n ?? s);
+  return n ? i : Is;
 }
-function As(e) {
+function Ts(e) {
   const t = M.getById(e);
   if (!t)
     throw new Error(
@@ -2236,7 +2239,7 @@ function As(e) {
     isSyncing: n.syncQueue.isSyncing
   };
 }
-function Fs(e, t) {
+function qs(e, t) {
   const n = M.getById(e);
   if (!n)
     throw new Error(
@@ -2249,23 +2252,23 @@ function Fs(e, t) {
   ).serverState ?? t;
 }
 export {
-  ws as Cache,
+  Cs as Cache,
   M as Collection,
-  vs as FetchHandler,
+  Ms as FetchHandler,
   We as Item,
   Le as Node,
-  gs as SyncQueue,
-  yt as buildServerSnapshot,
-  Ts as compareTimeIds,
-  $s as createSyncClient,
-  be as getIdFromTime,
-  qs as getTimeFromId,
-  Es as useCrud,
-  Is as useCrudTree,
-  Ns as useItem,
-  xs as useNode,
-  zs as useSelectedNode,
-  Fs as useServerState,
-  As as useSyncState
+  vs as SyncQueue,
+  mt as buildServerSnapshot,
+  Hs as compareTimeIds,
+  Ks as createSyncClient,
+  ze as getIdFromTime,
+  Bs as getTimeFromId,
+  As as useCrud,
+  Fs as useCrudTree,
+  js as useItem,
+  Rs as useNode,
+  Ds as useSelectedNode,
+  qs as useServerState,
+  Ts as useSyncState
 };
 //# sourceMappingURL=index.js.map