use-abcd 1.4.3 → 1.6.0

package/dist/index.js

@@ -1,146 +1,147 @@
-import { useSyncExternalStore as j, useCallback as T, useRef as Nn, useMemo as Dn } from "react";
-import { c as Ga } from "./chunks/types-Dy4rYb2N.js";
-import { c as Wa, b as Va, a as Ja, f as Ya, d as Xa, s as Za } from "./chunks/client-BfugfaiH.js";
-const v = {
+import { useMemo as le, useSyncExternalStore as v, useCallback as S } from "react";
+import { a as oe, b as G, c as bt, d as fe, e as Je, f as he, h as Ye, S as ze, i as W, j as Ge, k as mt, l as Xe, n as gt, o as V, p as St, q as wt, r as vt, s as Mt, t as Ct, u as Ze, v as xt, w as ke, x as Ot, y as Pt, z as Rt, A as de, B as Et, C as It, D as Nt, E as zt, F as z, m as K, g as be } from "./chunks/utils-DL5mgkvm.js";
+import { H as Ds, G as Ts } from "./chunks/utils-DL5mgkvm.js";
+import { c as Qs } from "./chunks/client-lHRDCo64.js";
+const b = {
   Remove: "remove",
   Replace: "replace",
   Add: "add"
-}, en = Symbol.for("__MUTATIVE_PROXY_DRAFT__"), Hn = Symbol("__MUTATIVE_RAW_RETURN_SYMBOL__"), ve = Symbol.iterator, E = {
+}, et = Symbol.for("__MUTATIVE_PROXY_DRAFT__"), At = Symbol("__MUTATIVE_RAW_RETURN_SYMBOL__"), ee = Symbol.iterator, x = {
   mutable: "mutable",
   immutable: "immutable"
-}, tt = {};
-function he(e, t) {
+}, xe = {};
+function Y(e, t) {
   return e instanceof Map ? e.has(t) : Object.prototype.hasOwnProperty.call(e, t);
 }
-function yt(e, t) {
+function Ae(e, t) {
   if (t in e) {
     let n = Reflect.getPrototypeOf(e);
     for (; n; ) {
-      const r = Reflect.getOwnPropertyDescriptor(n, t);
-      if (r)
-        return r;
+      const s = Reflect.getOwnPropertyDescriptor(n, t);
+      if (s)
+        return s;
       n = Reflect.getPrototypeOf(n);
     }
   }
 }
-function nt(e) {
+function Oe(e) {
   return Object.getPrototypeOf(e) === Set.prototype;
 }
-function rt(e) {
+function Pe(e) {
   return Object.getPrototypeOf(e) === Map.prototype;
 }
-function P(e) {
+function C(e) {
   var t;
   return (t = e.copy) !== null && t !== void 0 ? t : e.original;
 }
-function K(e) {
-  return !!d(e);
+function T(e) {
+  return !!h(e);
 }
-function d(e) {
-  return typeof e != "object" ? null : e?.[en];
+function h(e) {
+  return typeof e != "object" ? null : e?.[et];
 }
-function it(e) {
+function Re(e) {
   var t;
-  const n = d(e);
+  const n = h(e);
   return n ? (t = n.copy) !== null && t !== void 0 ? t : n.original : e;
 }
-function $(e, t) {
+function R(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, E)) === E.immutable || typeof n == "function");
+  return Object.getPrototypeOf(e) === Object.prototype || Array.isArray(e) || e instanceof Map || e instanceof Set || !!t?.mark && ((n = t.mark(e, x)) === x.immutable || typeof n == "function");
 }
-function tn(e, t = []) {
+function tt(e, t = []) {
   if (Object.hasOwnProperty.call(e, "key")) {
-    const n = e.parent.copy, r = d(q(n, e.key));
-    if (r !== null && r?.original !== e.original)
+    const n = e.parent.copy, s = h(F(n, e.key));
+    if (s !== null && s?.original !== e.original)
       return null;
-    const i = e.parent.type === 3, s = i ? Array.from(e.parent.setMap.keys()).indexOf(e.key) : e.key;
-    if (!(i && n.size > s || he(n, s)))
+    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)))
       return null;
-    t.push(s);
+    t.push(r);
   }
   if (e.parent)
-    return tn(e.parent, t);
+    return tt(e.parent, t);
   t.reverse();
   try {
-    Ln(e.copy, t);
+    Ft(e.copy, t);
   } catch {
     return null;
   }
   return t;
 }
-function ee(e) {
+function Q(e) {
   return Array.isArray(e) ? 1 : e instanceof Map ? 2 : e instanceof Set ? 3 : 0;
 }
-function q(e, t) {
-  return ee(e) === 2 ? e.get(t) : e[t];
+function F(e, t) {
+  return Q(e) === 2 ? e.get(t) : e[t];
 }
-function be(e, t, n) {
-  ee(e) === 2 ? e.set(t, n) : e[t] = n;
+function Z(e, t, n) {
+  Q(e) === 2 ? e.set(t, n) : e[t] = n;
 }
-function Ne(e, t) {
-  const n = d(e);
-  return (n ? P(n) : e)[t];
+function pe(e, t) {
+  const n = h(e);
+  return (n ? C(n) : e)[t];
 }
-function H(e, t) {
+function A(e, t) {
   return e === t ? e !== 0 || 1 / e === 1 / t : e !== e && t !== t;
 }
-function Be(e) {
+function me(e) {
   if (e)
     for (; e.finalities.revoke.length > 0; )
       e.finalities.revoke.pop()();
 }
-function J(e, t) {
+function q(e, t) {
   return t ? e : [""].concat(e).map((n) => {
-    const r = `${n}`;
-    return r.indexOf("/") === -1 && r.indexOf("~") === -1 ? r : r.replace(/~/g, "~0").replace(/\//g, "~1");
+    const s = `${n}`;
+    return s.indexOf("/") === -1 && s.indexOf("~") === -1 ? s : s.replace(/~/g, "~0").replace(/\//g, "~1");
   }).join("/");
 }
-function Ln(e, t) {
+function Ft(e, t) {
   for (let n = 0; n < t.length - 1; n += 1) {
-    const r = t[n];
-    if (e = q(ee(e) === 3 ? Array.from(e) : e, r), typeof e != "object")
+    const s = t[n];
+    if (e = F(Q(e) === 3 ? Array.from(e) : e, s), typeof e != "object")
       throw new Error(`Cannot resolve patch at '${t.join("/")}'.`);
   }
   return e;
 }
-function qn(e) {
+function jt(e) {
   const t = Object.create(Object.getPrototypeOf(e));
   return Reflect.ownKeys(e).forEach((n) => {
-    let r = Reflect.getOwnPropertyDescriptor(e, n);
-    if (r.enumerable && r.configurable && r.writable) {
+    let s = Reflect.getOwnPropertyDescriptor(e, n);
+    if (s.enumerable && s.configurable && s.writable) {
       t[n] = e[n];
       return;
     }
-    r.writable || (r.writable = !0, r.configurable = !0), (r.get || r.set) && (r = {
+    s.writable || (s.writable = !0, s.configurable = !0), (s.get || s.set) && (s = {
       configurable: !0,
       writable: !0,
-      enumerable: r.enumerable,
+      enumerable: s.enumerable,
       value: e[n]
-    }), Reflect.defineProperty(t, n, r);
+    }), Reflect.defineProperty(t, n, s);
   }), t;
 }
-const Qn = Object.prototype.propertyIsEnumerable;
-function nn(e, t) {
+const Dt = Object.prototype.propertyIsEnumerable;
+function nt(e, t) {
   let n;
   if (Array.isArray(e))
     return Array.prototype.concat.call(e);
   if (e instanceof Set) {
-    if (!nt(e)) {
-      const r = Object.getPrototypeOf(e).constructor;
-      return new r(e.values());
+    if (!Oe(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 (!rt(e)) {
-      const r = Object.getPrototypeOf(e).constructor;
-      return new r(e);
+    if (!Pe(e)) {
+      const s = Object.getPrototypeOf(e).constructor;
+      return new s(e);
     }
     return new Map(e);
-  } else if (t?.mark && (n = t.mark(e, E), n !== void 0) && n !== E.mutable) {
-    if (n === E.immutable)
-      return qn(e);
+  } else if (t?.mark && (n = t.mark(e, x), n !== void 0) && n !== x.mutable) {
+    if (n === x.immutable)
+      return jt(e);
     if (typeof n == "function") {
       if (t.enablePatches || t.enableAutoFreeze)
         throw new Error("You can't use mark and patches or auto freeze together.");
@@ -148,323 +149,323 @@ function nn(e, t) {
     }
     throw new Error(`Unsupported mark result: ${n}`);
   } else if (typeof e == "object" && Object.getPrototypeOf(e) === Object.prototype) {
-    const r = {};
+    const s = {};
     return Object.keys(e).forEach((i) => {
-      r[i] = e[i];
+      s[i] = e[i];
     }), Object.getOwnPropertySymbols(e).forEach((i) => {
-      Qn.call(e, i) && (r[i] = e[i]);
-    }), r;
+      Dt.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 x(e) {
-  e.copy || (e.copy = nn(e.original, e.options));
+function w(e) {
+  e.copy || (e.copy = nt(e.original, e.options));
 }
-function le(e) {
-  if (!$(e))
-    return it(e);
+function J(e) {
+  if (!R(e))
+    return Re(e);
   if (Array.isArray(e))
-    return e.map(le);
+    return e.map(J);
   if (e instanceof Map) {
-    const n = Array.from(e.entries()).map(([r, i]) => [
-      r,
-      le(i)
+    const n = Array.from(e.entries()).map(([s, i]) => [
+      s,
+      J(i)
     ]);
-    if (!rt(e)) {
-      const r = Object.getPrototypeOf(e).constructor;
-      return new r(n);
+    if (!Pe(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(le);
-    if (!nt(e)) {
-      const r = Object.getPrototypeOf(e).constructor;
-      return new r(n);
+    const n = Array.from(e).map(J);
+    if (!Oe(e)) {
+      const s = Object.getPrototypeOf(e).constructor;
+      return new s(n);
     }
     return new Set(n);
   }
   const t = Object.create(Object.getPrototypeOf(e));
   for (const n in e)
-    t[n] = le(e[n]);
+    t[n] = J(e[n]);
   return t;
 }
-function we(e) {
-  return K(e) ? le(e) : e;
+function te(e) {
+  return T(e) ? J(e) : e;
 }
-function z(e) {
+function E(e) {
   var t;
-  e.assignedMap = (t = e.assignedMap) !== null && t !== void 0 ? t : /* @__PURE__ */ new Map(), e.operated || (e.operated = !0, e.parent && z(e.parent));
+  e.assignedMap = (t = e.assignedMap) !== null && t !== void 0 ? t : /* @__PURE__ */ new Map(), e.operated || (e.operated = !0, e.parent && E(e.parent));
 }
-function gt() {
+function Fe() {
   throw new Error("Cannot modify frozen object");
 }
-function se(e, t, n, r, i) {
+function B(e, t, n, s, i) {
   {
-    n = n ?? /* @__PURE__ */ new WeakMap(), r = r ?? [], i = i ?? [];
+    n = n ?? /* @__PURE__ */ new WeakMap(), s = s ?? [], i = i ?? [];
     const o = n.has(e) ? n.get(e) : e;
-    if (r.length > 0) {
-      const a = r.indexOf(o);
-      if (o && typeof o == "object" && a !== -1)
-        throw r[0] === o ? new Error("Forbids circular reference") : new Error(`Forbids circular reference: ~/${i.slice(0, a).map((c, u) => {
-          if (typeof c == "symbol")
-            return `[${c.toString()}]`;
-          const l = r[u];
-          return typeof c == "object" && (l instanceof Map || l instanceof Set) ? Array.from(l.keys()).indexOf(c) : c;
+    if (s.length > 0) {
+      const c = s.indexOf(o);
+      if (o && typeof o == "object" && c !== -1)
+        throw s[0] === o ? new Error("Forbids circular reference") : new Error(`Forbids circular reference: ~/${i.slice(0, c).map((a, u) => {
+          if (typeof a == "symbol")
+            return `[${a.toString()}]`;
+          const l = s[u];
+          return typeof a == "object" && (l instanceof Map || l instanceof Set) ? Array.from(l.keys()).indexOf(a) : a;
         }).join("/")}`);
-      r.push(o), i.push(t);
+      s.push(o), i.push(t);
     } else
-      r.push(o);
+      s.push(o);
   }
-  if (Object.isFrozen(e) || K(e)) {
-    r.pop(), i.pop();
+  if (Object.isFrozen(e) || T(e)) {
+    s.pop(), i.pop();
     return;
   }
-  switch (ee(e)) {
+  switch (Q(e)) {
     case 2:
-      for (const [a, c] of e)
-        se(a, a, n, r, i), se(c, a, n, r, i);
-      e.set = e.clear = e.delete = gt;
+      for (const [c, a] of e)
+        B(c, c, n, s, i), B(a, c, n, s, i);
+      e.set = e.clear = e.delete = Fe;
       break;
     case 3:
-      for (const a of e)
-        se(a, a, n, r, i);
-      e.add = e.clear = e.delete = gt;
+      for (const c of e)
+        B(c, c, n, s, i);
+      e.add = e.clear = e.delete = Fe;
       break;
     case 1:
       Object.freeze(e);
       let o = 0;
-      for (const a of e)
-        se(a, o, n, r, i), o += 1;
+      for (const c of e)
+        B(c, o, n, s, i), o += 1;
       break;
     default:
-      Object.freeze(e), Object.keys(e).forEach((a) => {
-        const c = e[a];
-        se(c, a, n, r, i);
+      Object.freeze(e), Object.keys(e).forEach((c) => {
+        const a = e[c];
+        B(a, c, n, s, i);
       });
   }
-  r.pop(), i.pop();
+  s.pop(), i.pop();
 }
-function st(e, t) {
-  const n = ee(e);
+function Ee(e, t) {
+  const n = Q(e);
   if (n === 0)
-    Reflect.ownKeys(e).forEach((r) => {
-      t(r, e[r], e);
+    Reflect.ownKeys(e).forEach((s) => {
+      t(s, e[s], e);
     });
   else if (n === 1) {
-    let r = 0;
+    let s = 0;
     for (const i of e)
-      t(r, i, e), r += 1;
+      t(s, i, e), s += 1;
   } else
-    e.forEach((r, i) => t(i, r, e));
+    e.forEach((s, i) => t(i, s, e));
 }
-function rn(e, t, n) {
-  if (K(e) || !$(e, n) || t.has(e) || Object.isFrozen(e))
+function st(e, t, n) {
+  if (T(e) || !R(e, n) || t.has(e) || Object.isFrozen(e))
     return;
-  const r = e instanceof Set, i = r ? /* @__PURE__ */ new Map() : void 0;
-  if (t.add(e), st(e, (s, o) => {
-    var a;
-    if (K(o)) {
-      const c = d(o);
-      x(c);
-      const u = !((a = c.assignedMap) === null || a === void 0) && a.size || c.operated ? c.copy : c.original;
-      be(r ? i : e, s, u);
+  const s = e instanceof Set, i = s ? /* @__PURE__ */ new Map() : void 0;
+  if (t.add(e), Ee(e, (r, o) => {
+    var c;
+    if (T(o)) {
+      const a = h(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);
     } else
-      rn(o, t, n);
+      st(o, t, n);
   }), i) {
-    const s = e, o = Array.from(s);
-    s.clear(), o.forEach((a) => {
-      s.add(i.has(a) ? i.get(a) : a);
+    const r = e, o = Array.from(r);
+    r.clear(), o.forEach((c) => {
+      r.add(i.has(c) ? i.get(c) : c);
     });
   }
 }
-function Bn(e, t) {
+function Tt(e, t) {
   const n = e.type === 3 ? e.setMap : e.copy;
-  e.finalities.revoke.length > 1 && e.assignedMap.get(t) && n && rn(q(n, t), e.finalities.handledSet, e.options);
+  e.finalities.revoke.length > 1 && e.assignedMap.get(t) && n && st(F(n, t), e.finalities.handledSet, e.options);
 }
-function Ue(e) {
+function ge(e) {
   e.type === 3 && e.copy && (e.copy.clear(), e.setMap.forEach((t) => {
-    e.copy.add(it(t));
+    e.copy.add(Re(t));
   }));
 }
-function Ge(e, t, n, r) {
+function Se(e, t, n, s) {
   if (e.operated && e.assignedMap && e.assignedMap.size > 0 && !e.finalized) {
-    if (n && r) {
-      const s = tn(e);
-      s && t(e, s, n, r);
+    if (n && s) {
+      const r = tt(e);
+      r && t(e, r, n, s);
     }
     e.finalized = !0;
   }
 }
-function ot(e, t, n, r) {
-  const i = d(n);
-  i && (i.callbacks || (i.callbacks = []), i.callbacks.push((s, o) => {
-    var a;
-    const c = e.type === 3 ? e.setMap : e.copy;
-    if (H(q(c, t), n)) {
+function Ie(e, t, n, s) {
+  const i = h(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), Ue(e), Ge(e, r, s, o), e.options.enableAutoFreeze && (e.options.updatedValues = (a = e.options.updatedValues) !== null && a !== void 0 ? a : /* @__PURE__ */ new WeakMap(), e.options.updatedValues.set(u, i.original)), be(c, t, u);
+      i.copy && (u = i.copy), ge(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)), Z(a, t, u);
     }
-  }), e.options.enableAutoFreeze && i.finalities !== e.finalities && (e.options.enableAutoFreeze = !1)), $(n, e.options) && e.finalities.draft.push(() => {
-    const s = e.type === 3 ? e.setMap : e.copy;
-    H(q(s, t), n) && Bn(e, t);
+  }), e.options.enableAutoFreeze && i.finalities !== e.finalities && (e.options.enableAutoFreeze = !1)), R(n, e.options) && e.finalities.draft.push(() => {
+    const r = e.type === 3 ? e.setMap : e.copy;
+    A(F(r, t), n) && Tt(e, t);
   });
 }
-function Un(e, t, n, r, i) {
-  let { original: s, assignedMap: o, options: a } = e, c = e.copy;
-  c.length < s.length && ([s, c] = [c, s], [n, r] = [r, n]);
-  for (let u = 0; u < s.length; u += 1)
-    if (o.get(u.toString()) && c[u] !== s[u]) {
-      const l = t.concat([u]), f = J(l, i);
+function qt(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);
       n.push({
-        op: v.Replace,
+        op: b.Replace,
         path: f,
         // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
-        value: we(c[u])
-      }), r.push({
-        op: v.Replace,
+        value: te(a[u])
+      }), s.push({
+        op: b.Replace,
         path: f,
         // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
-        value: we(s[u])
+        value: te(r[u])
       });
     }
-  for (let u = s.length; u < c.length; u += 1) {
-    const l = t.concat([u]), f = J(l, i);
+  for (let u = r.length; u < a.length; u += 1) {
+    const l = t.concat([u]), f = q(l, i);
     n.push({
-      op: v.Add,
+      op: b.Add,
       path: f,
       // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
-      value: we(c[u])
+      value: te(a[u])
     });
   }
-  if (s.length < c.length) {
-    const { arrayLengthAssignment: u = !0 } = a.enablePatches;
+  if (r.length < a.length) {
+    const { arrayLengthAssignment: u = !0 } = c.enablePatches;
     if (u) {
-      const l = t.concat(["length"]), f = J(l, i);
-      r.push({
-        op: v.Replace,
+      const l = t.concat(["length"]), f = q(l, i);
+      s.push({
+        op: b.Replace,
         path: f,
-        value: s.length
+        value: r.length
       });
     } else
-      for (let l = c.length; s.length < l; l -= 1) {
-        const f = t.concat([l - 1]), h = J(f, i);
-        r.push({
-          op: v.Remove,
-          path: h
+      for (let l = a.length; r.length < l; l -= 1) {
+        const f = t.concat([l - 1]), y = q(f, i);
+        s.push({
+          op: b.Remove,
+          path: y
         });
       }
   }
 }
-function Gn({ original: e, copy: t, assignedMap: n }, r, i, s, o) {
-  n.forEach((a, c) => {
-    const u = q(e, c), l = we(q(t, c)), f = a ? he(e, c) ? v.Replace : v.Add : v.Remove;
-    if (H(u, l) && f === v.Replace)
+function Qt({ 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)
       return;
-    const h = r.concat(c), p = J(h, o);
-    i.push(f === v.Remove ? { op: f, path: p } : { op: f, path: p, value: l }), s.push(f === v.Add ? { op: v.Remove, path: p } : f === v.Remove ? { op: v.Add, path: p, value: u } : { op: v.Replace, path: p, value: u });
+    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 });
   });
 }
-function Kn({ original: e, copy: t }, n, r, i, s) {
+function $t({ original: e, copy: t }, n, s, i, r) {
   let o = 0;
-  e.forEach((a) => {
-    if (!t.has(a)) {
-      const c = n.concat([o]), u = J(c, s);
-      r.push({
-        op: v.Remove,
+  e.forEach((c) => {
+    if (!t.has(c)) {
+      const a = n.concat([o]), u = q(a, r);
+      s.push({
+        op: b.Remove,
         path: u,
-        value: a
+        value: c
       }), i.unshift({
-        op: v.Add,
+        op: b.Add,
         path: u,
-        value: a
+        value: c
       });
     }
     o += 1;
-  }), o = 0, t.forEach((a) => {
-    if (!e.has(a)) {
-      const c = n.concat([o]), u = J(c, s);
-      r.push({
-        op: v.Add,
+  }), o = 0, t.forEach((c) => {
+    if (!e.has(c)) {
+      const a = n.concat([o]), u = q(a, r);
+      s.push({
+        op: b.Add,
         path: u,
-        value: a
+        value: c
       }), i.unshift({
-        op: v.Remove,
+        op: b.Remove,
         path: u,
-        value: a
+        value: c
       });
     }
     o += 1;
   });
 }
-function _e(e, t, n, r) {
+function X(e, t, n, s) {
   const { pathAsArray: i = !0 } = e.options.enablePatches;
   switch (e.type) {
     case 0:
     case 2:
-      return Gn(e, t, n, r, i);
+      return Qt(e, t, n, s, i);
     case 1:
-      return Un(e, t, n, r, i);
+      return qt(e, t, n, s, i);
     case 3:
-      return Kn(e, t, n, r, i);
+      return $t(e, t, n, s, i);
   }
 }
-const xe = (e, t, n = !1) => {
-  if (typeof e == "object" && e !== null && (!$(e, t) || n))
+const ce = (e, t, n = !1) => {
+  if (typeof e == "object" && e !== null && (!R(e, t) || n))
     throw new Error("Strict mode: Mutable data cannot be accessed directly, please use 'unsafe(callback)' wrap.");
-}, Ke = {
+}, we = {
   get size() {
-    return P(d(this)).size;
+    return C(h(this)).size;
   },
   has(e) {
-    return P(d(this)).has(e);
+    return C(h(this)).has(e);
   },
   set(e, t) {
-    const n = d(this), r = P(n);
-    return (!r.has(e) || !H(r.get(e), t)) && (x(n), z(n), n.assignedMap.set(e, !0), n.copy.set(e, t), ot(n, e, t, _e)), this;
+    const n = h(this), s = C(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;
   },
   delete(e) {
     if (!this.has(e))
       return !1;
-    const t = d(this);
-    return x(t), z(t), t.original.has(e) ? t.assignedMap.set(e, !1) : t.assignedMap.delete(e), t.copy.delete(e), !0;
+    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;
   },
   clear() {
-    const e = d(this);
+    const e = h(this);
     if (this.size) {
-      x(e), z(e), e.assignedMap = /* @__PURE__ */ new Map();
+      w(e), E(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 = d(this);
-    P(n).forEach((r, i) => {
+    const n = h(this);
+    C(n).forEach((s, i) => {
       e.call(t, this.get(i), i, this);
     });
   },
   get(e) {
     var t, n;
-    const r = d(this), i = P(r).get(e), s = ((n = (t = r.options).mark) === null || n === void 0 ? void 0 : n.call(t, i, E)) === E.mutable;
-    if (r.options.strict && xe(i, r.options, s), s || r.finalized || !$(i, r.options) || i !== r.original.get(e))
+    const s = h(this), i = C(s).get(e), r = ((n = (t = s.options).mark) === null || n === void 0 ? void 0 : n.call(t, i, x)) === x.mutable;
+    if (s.options.strict && ce(i, s.options, r), r || s.finalized || !R(i, s.options) || i !== s.original.get(e))
       return i;
-    const o = tt.createDraft({
+    const o = xe.createDraft({
       original: i,
-      parentDraft: r,
+      parentDraft: s,
       key: e,
-      finalities: r.finalities,
-      options: r.options
+      finalities: s.finalities,
+      options: s.options
     });
-    return x(r), r.copy.set(e, o), o;
+    return w(s), s.copy.set(e, o), o;
   },
   keys() {
-    return P(d(this)).keys();
+    return C(h(this)).keys();
   },
   values() {
     const e = this.keys();
     return {
-      [ve]: () => this.values(),
+      [ee]: () => this.values(),
       next: () => {
         const t = e.next();
         return t.done ? t : {
@@ -477,7 +478,7 @@ const xe = (e, t, n = !1) => {
   entries() {
     const e = this.keys();
     return {
-      [ve]: () => this.entries(),
+      [ee]: () => this.entries(),
       next: () => {
         const t = e.next();
         if (t.done)
@@ -490,80 +491,80 @@ const xe = (e, t, n = !1) => {
       }
     };
   },
-  [ve]() {
+  [ee]() {
     return this.entries();
   }
-}, Wn = Reflect.ownKeys(Ke), bt = (e, t, { isValuesIterator: n }) => () => {
-  var r, i;
-  const s = t.next();
-  if (s.done)
-    return s;
-  const o = s.value;
-  let a = e.setMap.get(o);
-  const c = d(a), u = ((i = (r = e.options).mark) === null || i === void 0 ? void 0 : i.call(r, a, E)) === E.mutable;
-  if (e.options.strict && xe(o, e.options, u), !u && !c && $(o, e.options) && !e.finalized && e.original.has(o)) {
-    const l = tt.createDraft({
+}, Ht = Reflect.ownKeys(we), 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, x)) === x.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({
       original: o,
       parentDraft: e,
       key: o,
       finalities: e.finalities,
       options: e.options
     });
-    e.setMap.set(o, l), a = l;
-  } else c && (a = c.proxy);
+    e.setMap.set(o, l), c = l;
+  } else a && (c = a.proxy);
   return {
     done: !1,
-    value: n ? a : [a, a]
+    value: n ? c : [c, c]
   };
-}, Ae = {
+}, ae = {
   get size() {
-    return d(this).setMap.size;
+    return h(this).setMap.size;
   },
   has(e) {
-    const t = d(this);
+    const t = h(this);
     if (t.setMap.has(e))
       return !0;
-    x(t);
-    const n = d(e);
+    w(t);
+    const n = h(e);
     return !!(n && t.setMap.has(n.original));
   },
   add(e) {
-    const t = d(this);
-    return this.has(e) || (x(t), z(t), t.assignedMap.set(e, !0), t.setMap.set(e, e), ot(t, e, e, _e)), this;
+    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;
   },
   delete(e) {
     if (!this.has(e))
       return !1;
-    const t = d(this);
-    x(t), z(t);
-    const n = d(e);
+    const t = h(this);
+    w(t), E(t);
+    const n = h(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 = d(this);
-    x(e), z(e);
+    const e = h(this);
+    w(e), E(e);
     for (const t of e.original)
       e.assignedMap.set(t, !1);
     e.setMap.clear();
   },
   values() {
-    const e = d(this);
-    x(e);
+    const e = h(this);
+    w(e);
     const t = e.setMap.keys();
     return {
       [Symbol.iterator]: () => this.values(),
-      next: bt(e, t, { isValuesIterator: !0 })
+      next: je(e, t, { isValuesIterator: !0 })
     };
   },
   entries() {
-    const e = d(this);
-    x(e);
+    const e = h(this);
+    w(e);
     const t = e.setMap.keys();
     return {
       [Symbol.iterator]: () => this.entries(),
-      next: bt(e, t, {
+      next: je(e, t, {
         isValuesIterator: !1
       })
     };
@@ -571,17 +572,17 @@ const xe = (e, t, n = !1) => {
   keys() {
     return this.values();
   },
-  [ve]() {
+  [ee]() {
     return this.values();
   },
   forEach(e, t) {
     const n = this.values();
-    let r = n.next();
-    for (; !r.done; )
-      e.call(t, r.value, r.value, this), r = n.next();
+    let s = n.next();
+    for (; !s.done; )
+      e.call(t, s.value, s.value, this), s = n.next();
   }
 };
-Set.prototype.difference && Object.assign(Ae, {
+Set.prototype.difference && Object.assign(ae, {
   intersection(e) {
     return Set.prototype.intersection.call(new Set(this.values()), e);
   },
@@ -604,75 +605,75 @@ Set.prototype.difference && Object.assign(Ae, {
     return Set.prototype.isDisjointFrom.call(new Set(this.values()), e);
   }
 });
-const Vn = Reflect.ownKeys(Ae), sn = {
+const Bt = Reflect.ownKeys(ae), it = {
   get(e, t, n) {
-    var r, i;
-    const s = (r = e.copy) === null || r === void 0 ? void 0 : r[t];
-    if (s && e.finalities.draftsCache.has(s))
-      return s;
-    if (t === en)
+    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)
       return e;
     let o;
     if (e.options.mark) {
       const u = t === "size" && (e.original instanceof Map || e.original instanceof Set) ? Reflect.get(e.original, t) : Reflect.get(e.original, t, n);
-      if (o = e.options.mark(u, E), o === E.mutable)
-        return e.options.strict && xe(u, e.options, !0), u;
+      if (o = e.options.mark(u, x), o === x.mutable)
+        return e.options.strict && ce(u, e.options, !0), u;
     }
-    const a = P(e);
-    if (a instanceof Map && Wn.includes(t))
-      return t === "size" ? Object.getOwnPropertyDescriptor(Ke, "size").get.call(e.proxy) : Ke[t].bind(e.proxy);
-    if (a instanceof Set && Vn.includes(t))
-      return t === "size" ? Object.getOwnPropertyDescriptor(Ae, "size").get.call(e.proxy) : Ae[t].bind(e.proxy);
-    if (!he(a, t)) {
-      const u = yt(a, t);
+    const c = C(e);
+    if (c instanceof Map && Ht.includes(t))
+      return t === "size" ? Object.getOwnPropertyDescriptor(we, "size").get.call(e.proxy) : we[t].bind(e.proxy);
+    if (c instanceof Set && Bt.includes(t))
+      return t === "size" ? Object.getOwnPropertyDescriptor(ae, "size").get.call(e.proxy) : ae[t].bind(e.proxy);
+    if (!Y(c, t)) {
+      const u = Ae(c, t);
       return u ? "value" in u ? u.value : (
         // !case: support for getter
         (i = u.get) === null || i === void 0 ? void 0 : i.call(e.proxy)
       ) : void 0;
     }
-    const c = a[t];
-    if (e.options.strict && xe(c, e.options), e.finalized || !$(c, e.options))
-      return c;
-    if (c === Ne(e.original, t)) {
-      if (x(e), e.copy[t] = at({
+    const a = c[t];
+    if (e.options.strict && ce(a, e.options), e.finalized || !R(a, e.options))
+      return a;
+    if (a === pe(e.original, t)) {
+      if (w(e), e.copy[t] = Ne({
         original: e.original[t],
         parentDraft: e,
         key: e.type === 1 ? Number(t) : t,
         finalities: e.finalities,
         options: e.options
       }), typeof o == "function") {
-        const u = d(e.copy[t]);
-        return x(u), z(u), u.copy;
+        const u = h(e.copy[t]);
+        return w(u), E(u), u.copy;
       }
       return e.copy[t];
     }
-    return K(c) && e.finalities.draftsCache.add(c), c;
+    return T(a) && e.finalities.draftsCache.add(a), a;
   },
   set(e, t, n) {
-    var r;
+    var s;
     if (e.type === 3 || e.type === 2)
       throw new Error("Map/Set draft does not support any property assignment.");
     let i;
     if (e.type === 1 && t !== "length" && !(Number.isInteger(i = Number(t)) && i >= 0 && (t === 0 || i === 0 || String(i) === String(t))))
       throw new Error("Only supports setting array indices and the 'length' property.");
-    const s = yt(P(e), t);
-    if (s?.set)
-      return s.set.call(e.proxy, n), !0;
-    const o = Ne(P(e), t), a = d(o);
-    return a && H(a.original, n) ? (e.copy[t] = n, e.assignedMap = (r = e.assignedMap) !== null && r !== void 0 ? r : /* @__PURE__ */ new Map(), e.assignedMap.set(t, !1), !0) : (H(n, o) && (n !== void 0 || he(e.original, t)) || (x(e), z(e), he(e.original, t) && H(n, e.original[t]) ? e.assignedMap.delete(t) : e.assignedMap.set(t, !0), e.copy[t] = n, ot(e, t, n, _e)), !0);
+    const r = Ae(C(e), t);
+    if (r?.set)
+      return r.set.call(e.proxy, n), !0;
+    const o = pe(C(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);
   },
   has(e, t) {
-    return t in P(e);
+    return t in C(e);
   },
   ownKeys(e) {
-    return Reflect.ownKeys(P(e));
+    return Reflect.ownKeys(C(e));
   },
   getOwnPropertyDescriptor(e, t) {
-    const n = P(e), r = Reflect.getOwnPropertyDescriptor(n, t);
-    return r && {
+    const n = C(e), s = Reflect.getOwnPropertyDescriptor(n, t);
+    return s && {
       writable: !0,
       configurable: e.type !== 1 || t !== "length",
-      enumerable: r.enumerable,
+      enumerable: s.enumerable,
       value: n[t]
     };
   },
@@ -687,11 +688,11 @@ const Vn = Reflect.ownKeys(Ae), sn = {
   },
   deleteProperty(e, t) {
     var n;
-    return e.type === 1 ? sn.set.call(this, e, t, void 0, e.proxy) : (Ne(e.original, t) !== void 0 || t in e.original ? (x(e), z(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 ? 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);
   }
 };
-function at(e) {
-  const { original: t, parentDraft: n, key: r, finalities: i, options: s } = e, o = ee(t), a = {
+function Ne(e) {
+  const { original: t, parentDraft: n, key: s, finalities: i, options: r } = e, o = Q(t), c = {
     type: o,
     finalized: !1,
     parent: n,
@@ -699,331 +700,237 @@ function at(e) {
     copy: null,
     proxy: null,
     finalities: i,
-    options: s,
+    options: r,
     // Mapping of draft Set items to their corresponding draft values.
     setMap: o === 3 ? new Map(t.entries()) : void 0
   };
-  (r || "key" in e) && (a.key = r);
-  const { proxy: c, revoke: u } = Proxy.revocable(o === 1 ? Object.assign([], a) : a, sn);
-  if (i.revoke.push(u), a.proxy = c, n) {
+  (s || "key" in e) && (c.key = s);
+  const { proxy: a, revoke: u } = Proxy.revocable(o === 1 ? Object.assign([], c) : c, it);
+  if (i.revoke.push(u), c.proxy = a, n) {
     const l = n;
-    l.finalities.draft.push((f, h) => {
-      var p, g;
-      const b = d(c);
-      let w = l.type === 3 ? l.setMap : l.copy;
-      const C = q(w, r), S = d(C);
-      if (S) {
-        let A = S.original;
-        S.operated && (A = it(C)), Ue(S), Ge(S, _e, f, h), l.options.enableAutoFreeze && (l.options.updatedValues = (p = l.options.updatedValues) !== null && p !== void 0 ? p : /* @__PURE__ */ new WeakMap(), l.options.updatedValues.set(A, S.original)), be(w, r, A);
+    l.finalities.draft.push((f, y) => {
+      var p, I;
+      const $ = h(a);
+      let M = l.type === 3 ? l.setMap : l.copy;
+      const m = F(M, s), g = h(m);
+      if (g) {
+        let _ = g.original;
+        g.operated && (_ = Re(m)), ge(g), Se(g, 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(_, g.original)), Z(M, s, _);
       }
-      (g = b.callbacks) === null || g === void 0 || g.forEach((A) => {
-        A(f, h);
+      (I = $.callbacks) === null || I === void 0 || I.forEach((_) => {
+        _(f, y);
       });
     });
   } else {
-    const l = d(c);
-    l.finalities.draft.push((f, h) => {
-      Ue(l), Ge(l, _e, f, h);
+    const l = h(a);
+    l.finalities.draft.push((f, y) => {
+      ge(l), Se(l, X, f, y);
     });
   }
-  return c;
+  return a;
 }
-tt.createDraft = at;
-function Jn(e, t, n, r, i) {
-  var s;
-  const o = d(e), a = (s = o?.original) !== null && s !== void 0 ? s : e, c = !!t.length;
+xe.createDraft = Ne;
+function Ut(e, t, n, s, i) {
+  var r;
+  const o = h(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, r);
-  const u = c ? t[0] : o ? o.operated ? o.copy : o.original : e;
-  return o && Be(o), i && se(u, u, o?.options.updatedValues), [
+      o.finalities.draft.pop()(n, s);
+  const u = a ? t[0] : o ? o.operated ? o.copy : o.original : e;
+  return o && me(o), i && B(u, u, o?.options.updatedValues), [
     u,
-    n && c ? [{ op: v.Replace, path: [], value: t[0] }] : n,
-    r && c ? [{ op: v.Replace, path: [], value: a }] : r
+    n && a ? [{ op: b.Replace, path: [], value: t[0] }] : n,
+    s && a ? [{ op: b.Replace, path: [], value: c }] : s
   ];
 }
-function Yn(e, t) {
+function Kt(e, t) {
   var n;
-  const r = {
+  const s = {
     draft: [],
     revoke: [],
     handledSet: /* @__PURE__ */ new WeakSet(),
     draftsCache: /* @__PURE__ */ new WeakSet()
   };
-  let i, s;
-  t.enablePatches && (i = [], s = []);
-  const a = ((n = t.mark) === null || n === void 0 ? void 0 : n.call(t, e, E)) === E.mutable || !$(e, t) ? e : at({
+  let i, r;
+  t.enablePatches && (i = [], r = []);
+  const c = ((n = t.mark) === null || n === void 0 ? void 0 : n.call(t, e, x)) === x.mutable || !R(e, t) ? e : Ne({
     original: e,
     parentDraft: null,
-    finalities: r,
+    finalities: s,
     options: t
   });
   return [
-    a,
-    (c = []) => {
-      const [u, l, f] = Jn(a, c, i, s, t.enableAutoFreeze);
+    c,
+    (a = []) => {
+      const [u, l, f] = Ut(c, a, i, r, t.enableAutoFreeze);
       return t.enablePatches ? [u, l, f] : u;
     }
   ];
 }
-function We(e) {
-  const { rootDraft: t, value: n, useRawReturn: r = !1, isRoot: i = !0 } = e;
-  st(n, (s, o, a) => {
-    const c = d(o);
-    if (c && t && c.finalities === t.finalities) {
+function ve(e) {
+  const { rootDraft: t, value: n, useRawReturn: s = !1, isRoot: i = !0 } = e;
+  Ee(n, (r, o, c) => {
+    const a = h(o);
+    if (a && t && a.finalities === t.finalities) {
       e.isContainDraft = !0;
-      const u = c.original;
-      if (a instanceof Set) {
-        const l = Array.from(a);
-        a.clear(), l.forEach((f) => a.add(s === f ? u : f));
+      const u = a.original;
+      if (c instanceof Set) {
+        const l = Array.from(c);
+        c.clear(), l.forEach((f) => c.add(r === f ? u : f));
       } else
-        be(a, s, 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."), r && console.warn("The return value contains drafts, please don't use 'rawReturn()' to wrap the return value."));
+        Z(c, r, u);
+    } else typeof o == "object" && o !== null && (e.value = o, e.isRoot = !1, ve(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 on(e) {
+function rt(e) {
   var t;
-  const n = d(e);
-  if (!$(e, n?.options))
+  const n = h(e);
+  if (!R(e, n?.options))
     return e;
-  const r = ee(e);
+  const s = Q(e);
   if (n && !n.operated)
     return n.original;
   let i;
-  function s() {
-    i = r === 2 ? rt(e) ? new Map(e) : new (Object.getPrototypeOf(e)).constructor(e) : r === 3 ? Array.from(n.setMap.values()) : nn(e, n?.options);
+  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);
   }
   if (n) {
     n.finalized = !0;
     try {
-      s();
+      r();
     } finally {
       n.finalized = !1;
     }
   } else
     i = e;
-  if (st(i, (o, a) => {
-    if (n && H(q(n.original, o), a))
+  if (Ee(i, (o, c) => {
+    if (n && A(F(n.original, o), c))
       return;
-    const c = on(a);
-    c !== a && (i === e && s(), be(i, o, c));
-  }), r === 3) {
+    const a = rt(c);
+    a !== c && (i === e && r(), Z(i, o, a));
+  }), s === 3) {
     const o = (t = n?.original) !== null && t !== void 0 ? t : i;
-    return nt(o) ? new Set(i) : new (Object.getPrototypeOf(o)).constructor(i);
+    return Oe(o) ? new Set(i) : new (Object.getPrototypeOf(o)).constructor(i);
   }
   return i;
 }
-function mt(e) {
-  if (!K(e))
+function De(e) {
+  if (!T(e))
     throw new Error(`current() is only used for Draft, parameter: ${e}`);
-  return on(e);
+  return rt(e);
 }
-const Xn = (e) => function t(n, r, i) {
-  var s, o, a;
-  if (typeof n == "function" && typeof r != "function")
-    return function(_, ...D) {
-      return t(_, (G) => n.call(this, G, ...D), r);
+const Wt = (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);
     };
-  const c = n, u = r;
+  const a = n, u = s;
   let l = i;
-  if (typeof r != "function" && (l = r), l !== void 0 && Object.prototype.toString.call(l) !== "[object Object]")
+  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 = K(c) ? mt(c) : c, h = Array.isArray(l.mark) ? ((_, D) => {
-    for (const G of l.mark) {
-      if (typeof G != "function")
-        throw new Error(`Invalid mark: ${G}, 'mark' should be a function.`);
-      const ce = G(_, D);
-      if (ce)
-        return ce;
+  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;
     }
-  }) : l.mark, p = (s = l.enablePatches) !== null && s !== void 0 ? s : !1, g = (o = l.strict) !== null && o !== void 0 ? o : !1, w = {
-    enableAutoFreeze: (a = l.enableAutoFreeze) !== null && a !== void 0 ? a : !1,
-    mark: h,
-    strict: g,
+  }) : l.mark, p = (r = l.enablePatches) !== null && r !== void 0 ? r : !1, I = (o = l.strict) !== null && o !== void 0 ? o : !1, M = {
+    enableAutoFreeze: (c = l.enableAutoFreeze) !== null && c !== void 0 ? c : !1,
+    mark: y,
+    strict: I,
     enablePatches: p
   };
-  if (!$(f, w) && typeof f == "object" && f !== null)
+  if (!R(f, M) && 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 [C, S] = Yn(f, w);
-  if (typeof r != "function") {
-    if (!$(f, w))
+  const [m, g] = Kt(f, M);
+  if (typeof s != "function") {
+    if (!R(f, M))
       throw new Error("Invalid base state: create() only supports plain objects, arrays, Set, Map or using mark() to mark the state as immutable.");
-    return [C, S];
+    return [m, g];
   }
-  let A;
+  let _;
   try {
-    A = u(C);
-  } catch (_) {
-    throw Be(d(C)), _;
-  }
-  const V = (_) => {
-    const D = d(C);
-    if (!K(_)) {
-      if (_ !== void 0 && !H(_, C) && D?.operated)
+    _ = 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)
         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 ce = _?.[Hn];
-      if (ce) {
-        const zn = ce[0];
-        return w.strict && typeof _ == "object" && _ !== null && We({
-          rootDraft: D,
-          value: _,
+      const L = d?.[At];
+      if (L) {
+        const yt = L[0];
+        return M.strict && typeof d == "object" && d !== null && ve({
+          rootDraft: N,
+          value: d,
           useRawReturn: !0
-        }), S([zn]);
+        }), g([yt]);
       }
-      if (_ !== void 0)
-        return typeof _ == "object" && _ !== null && We({ rootDraft: D, value: _ }), S([_]);
+      if (d !== void 0)
+        return typeof d == "object" && d !== null && ve({ rootDraft: N, value: d }), g([d]);
     }
-    if (_ === C || _ === void 0)
-      return S([]);
-    const G = d(_);
-    if (w === G.options) {
-      if (G.operated)
+    if (d === m || d === void 0)
+      return g([]);
+    const D = h(d);
+    if (M === D.options) {
+      if (D.operated)
         throw new Error("Cannot return a modified child draft.");
-      return S([mt(_)]);
+      return g([De(d)]);
     }
-    return S([_]);
+    return g([d]);
   };
-  return A instanceof Promise ? A.then(V, (_) => {
-    throw Be(d(C)), _;
-  }) : V(A);
-}, I = Xn();
+  return _ instanceof Promise ? _.then(j, (d) => {
+    throw me(h(m)), d;
+  }) : j(_);
+}, P = Wt();
 Object.prototype.constructor.toString();
-var an = typeof global == "object" && global && global.Object === Object && global, Zn = typeof self == "object" && self && self.Object === Object && self, Q = an || Zn || Function("return this")(), N = Q.Symbol, cn = Object.prototype, kn = cn.hasOwnProperty, er = cn.toString, ue = N ? N.toStringTag : void 0;
-function tr(e) {
-  var t = kn.call(e, ue), n = e[ue];
-  try {
-    e[ue] = void 0;
-    var r = !0;
-  } catch {
-  }
-  var i = er.call(e);
-  return r && (t ? e[ue] = n : delete e[ue]), i;
-}
-var nr = Object.prototype, rr = nr.toString;
-function ir(e) {
-  return rr.call(e);
-}
-var sr = "[object Null]", or = "[object Undefined]", St = N ? N.toStringTag : void 0;
-function te(e) {
-  return e == null ? e === void 0 ? or : sr : St && St in Object(e) ? tr(e) : ir(e);
-}
-function X(e) {
-  return e != null && typeof e == "object";
-}
-var ar = "[object Symbol]";
-function Z(e) {
-  return typeof e == "symbol" || X(e) && te(e) == ar;
-}
-function de(e, t) {
-  for (var n = -1, r = e == null ? 0 : e.length, i = Array(r); ++n < r; )
-    i[n] = t(e[n], n, e);
-  return i;
-}
-var M = Array.isArray, vt = N ? N.prototype : void 0, wt = vt ? vt.toString : void 0;
-function un(e) {
-  if (typeof e == "string")
-    return e;
-  if (M(e))
-    return de(e, un) + "";
-  if (Z(e))
-    return wt ? wt.call(e) : "";
-  var t = e + "";
-  return t == "0" && 1 / e == -1 / 0 ? "-0" : t;
-}
-var cr = /\s/;
-function ur(e) {
-  for (var t = e.length; t-- && cr.test(e.charAt(t)); )
+var Vt = /\s/;
+function Lt(e) {
+  for (var t = e.length; t-- && Vt.test(e.charAt(t)); )
     ;
   return t;
 }
-var lr = /^\s+/;
-function fr(e) {
-  return e && e.slice(0, ur(e) + 1).replace(lr, "");
+var Jt = /^\s+/;
+function Yt(e) {
+  return e && e.slice(0, Lt(e) + 1).replace(Jt, "");
 }
-function ae(e) {
-  var t = typeof e;
-  return e != null && (t == "object" || t == "function");
-}
-var Ot = NaN, hr = /^[-+]0x[0-9a-f]+$/i, dr = /^0b[01]+$/i, pr = /^0o[0-7]+$/i, _r = parseInt;
-function yr(e) {
+var Te = NaN, Gt = /^[-+]0x[0-9a-f]+$/i, Xt = /^0b[01]+$/i, Zt = /^0o[0-7]+$/i, kt = parseInt;
+function ne(e) {
   if (typeof e == "number")
     return e;
-  if (Z(e))
-    return Ot;
-  if (ae(e)) {
+  if (oe(e))
+    return Te;
+  if (G(e)) {
     var t = typeof e.valueOf == "function" ? e.valueOf() : e;
-    e = ae(t) ? t + "" : t;
+    e = G(t) ? t + "" : t;
   }
   if (typeof e != "string")
     return e === 0 ? e : +e;
-  e = fr(e);
-  var n = dr.test(e);
-  return n || pr.test(e) ? _r(e.slice(2), n ? 2 : 8) : hr.test(e) ? Ot : +e;
+  e = Yt(e);
+  var n = Xt.test(e);
+  return n || Zt.test(e) ? kt(e.slice(2), n ? 2 : 8) : Gt.test(e) ? Te : +e;
 }
-var Ct = 1 / 0, gr = 17976931348623157e292;
-function br(e) {
+var qe = 1 / 0, en = 17976931348623157e292;
+function tn(e) {
   if (!e)
     return e === 0 ? e : 0;
-  if (e = yr(e), e === Ct || e === -Ct) {
+  if (e = ne(e), e === qe || e === -qe) {
     var t = e < 0 ? -1 : 1;
-    return t * gr;
+    return t * en;
   }
   return e === e ? e : 0;
 }
-function ln(e) {
-  var t = br(e), n = t % 1;
+function ot(e) {
+  var t = tn(e), n = t % 1;
   return t === t ? n ? t - n : t : 0;
 }
-function me(e) {
-  return e;
-}
-var mr = "[object AsyncFunction]", Sr = "[object Function]", vr = "[object GeneratorFunction]", wr = "[object Proxy]";
-function fn(e) {
-  if (!ae(e))
-    return !1;
-  var t = te(e);
-  return t == Sr || t == vr || t == mr || t == wr;
-}
-var De = Q["__core-js_shared__"], Mt = (function() {
-  var e = /[^.]+$/.exec(De && De.keys && De.keys.IE_PROTO || "");
-  return e ? "Symbol(src)_1." + e : "";
-})();
-function Or(e) {
-  return !!Mt && Mt in e;
-}
-var Cr = Function.prototype, Mr = Cr.toString;
-function ne(e) {
-  if (e != null) {
-    try {
-      return Mr.call(e);
-    } catch {
-    }
-    try {
-      return e + "";
-    } catch {
-    }
-  }
-  return "";
-}
-var xr = /[\\^$.*+?()[\]{}|]/g, Ar = /^\[object .+?Constructor\]$/, Pr = Function.prototype, Er = Object.prototype, Tr = Pr.toString, Rr = Er.hasOwnProperty, Ir = RegExp(
-  "^" + Tr.call(Rr).replace(xr, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
-);
-function jr(e) {
-  if (!ae(e) || Or(e))
-    return !1;
-  var t = fn(e) ? Ir : Ar;
-  return t.test(ne(e));
-}
-function $r(e, t) {
-  return e?.[t];
-}
-function re(e, t) {
-  var n = $r(e, t);
-  return jr(n) ? n : void 0;
-}
-var Ve = re(Q, "WeakMap");
-function Fr(e, t, n) {
+function nn(e, t, n) {
   switch (n.length) {
     case 0:
       return e.call(t);
@@ -1036,917 +943,294 @@ function Fr(e, t, n) {
   }
   return e.apply(t, n);
 }
-var zr = 800, Nr = 16, Dr = Date.now;
-function Hr(e) {
+var sn = 800, rn = 16, on = Date.now;
+function cn(e) {
   var t = 0, n = 0;
   return function() {
-    var r = Dr(), i = Nr - (r - n);
-    if (n = r, i > 0) {
-      if (++t >= zr)
+    var s = on(), i = rn - (s - n);
+    if (n = s, i > 0) {
+      if (++t >= sn)
         return arguments[0];
     } else
       t = 0;
     return e.apply(void 0, arguments);
   };
 }
-function Lr(e) {
+function an(e) {
   return function() {
     return e;
   };
 }
-var xt = (function() {
+var ue = (function() {
   try {
-    var e = re(Object, "defineProperty");
+    var e = bt(Object, "defineProperty");
     return e({}, "", {}), e;
   } catch {
   }
-})(), qr = xt ? function(e, t) {
-  return xt(e, "toString", {
+})(), un = ue ? function(e, t) {
+  return ue(e, "toString", {
     configurable: !0,
     enumerable: !1,
-    value: Lr(t),
+    value: an(t),
     writable: !0
   });
-} : me, Qr = Hr(qr);
-function Br(e, t) {
-  for (var n = -1, r = e == null ? 0 : e.length; ++n < r && t(e[n], n, e) !== !1; )
+} : fe, ln = cn(un);
+function fn(e, t) {
+  for (var n = -1, s = e == null ? 0 : e.length; ++n < s && t(e[n], n, e) !== !1; )
     ;
   return e;
 }
-function Ur(e, t, n, r) {
-  for (var i = e.length, s = n + -1; ++s < i; )
-    if (t(e[s], s, e))
-      return s;
+function hn(e, t, n, s) {
+  for (var i = e.length, r = n + -1; ++r < i; )
+    if (t(e[r], r, e))
+      return r;
   return -1;
 }
-var Gr = 9007199254740991, Kr = /^(?:0|[1-9]\d*)$/;
-function ct(e, t) {
-  var n = typeof e;
-  return t = t ?? Gr, !!t && (n == "number" || n != "symbol" && Kr.test(e)) && e > -1 && e % 1 == 0 && e < t;
-}
-function ut(e, t) {
-  return e === t || e !== e && t !== t;
-}
-var At = Math.max;
-function Wr(e, t, n) {
-  return t = At(t === void 0 ? e.length - 1 : t, 0), function() {
-    for (var r = arguments, i = -1, s = At(r.length - t, 0), o = Array(s); ++i < s; )
-      o[i] = r[t + i];
+function dn(e, t, n) {
+  t == "__proto__" && ue ? ue(e, t, {
+    configurable: !0,
+    enumerable: !0,
+    value: n,
+    writable: !0
+  }) : e[t] = n;
+}
+var pn = Object.prototype, _n = pn.hasOwnProperty;
+function yn(e, t, n) {
+  var s = e[t];
+  (!(_n.call(e, t) && Je(s, n)) || n === void 0 && !(t in e)) && dn(e, t, n);
+}
+var Qe = Math.max;
+function bn(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; )
+      o[i] = s[t + i];
     i = -1;
-    for (var a = Array(t + 1); ++i < t; )
-      a[i] = r[i];
-    return a[t] = n(o), Fr(e, this, a);
+    for (var c = Array(t + 1); ++i < t; )
+      c[i] = s[i];
+    return c[t] = n(o), nn(e, this, c);
   };
 }
-function Vr(e, t) {
-  return Qr(Wr(e, t, me), e + "");
-}
-var Jr = 9007199254740991;
-function lt(e) {
-  return typeof e == "number" && e > -1 && e % 1 == 0 && e <= Jr;
-}
-function ie(e) {
-  return e != null && lt(e.length) && !fn(e);
-}
-function Pt(e, t, n) {
-  if (!ae(n))
-    return !1;
-  var r = typeof t;
-  return (r == "number" ? ie(n) && ct(t, n.length) : r == "string" && t in n) ? ut(n[t], e) : !1;
-}
-var Yr = Object.prototype;
-function hn(e) {
-  var t = e && e.constructor, n = typeof t == "function" && t.prototype || Yr;
-  return e === n;
-}
-function Xr(e, t) {
-  for (var n = -1, r = Array(e); ++n < e; )
-    r[n] = t(n);
-  return r;
-}
-var Zr = "[object Arguments]";
-function Et(e) {
-  return X(e) && te(e) == Zr;
-}
-var dn = Object.prototype, kr = dn.hasOwnProperty, ei = dn.propertyIsEnumerable, Te = Et(/* @__PURE__ */ (function() {
-  return arguments;
-})()) ? Et : function(e) {
-  return X(e) && kr.call(e, "callee") && !ei.call(e, "callee");
-};
-function ti() {
-  return !1;
-}
-var pn = typeof exports == "object" && exports && !exports.nodeType && exports, Tt = pn && typeof module == "object" && module && !module.nodeType && module, ni = Tt && Tt.exports === pn, Rt = ni ? Q.Buffer : void 0, ri = Rt ? Rt.isBuffer : void 0, Pe = ri || ti, ii = "[object Arguments]", si = "[object Array]", oi = "[object Boolean]", ai = "[object Date]", ci = "[object Error]", ui = "[object Function]", li = "[object Map]", fi = "[object Number]", hi = "[object Object]", di = "[object RegExp]", pi = "[object Set]", _i = "[object String]", yi = "[object WeakMap]", gi = "[object ArrayBuffer]", bi = "[object DataView]", mi = "[object Float32Array]", Si = "[object Float64Array]", vi = "[object Int8Array]", wi = "[object Int16Array]", Oi = "[object Int32Array]", Ci = "[object Uint8Array]", Mi = "[object Uint8ClampedArray]", xi = "[object Uint16Array]", Ai = "[object Uint32Array]", y = {};
-y[mi] = y[Si] = y[vi] = y[wi] = y[Oi] = y[Ci] = y[Mi] = y[xi] = y[Ai] = !0;
-y[ii] = y[si] = y[gi] = y[oi] = y[bi] = y[ai] = y[ci] = y[ui] = y[li] = y[fi] = y[hi] = y[di] = y[pi] = y[_i] = y[yi] = !1;
-function Pi(e) {
-  return X(e) && lt(e.length) && !!y[te(e)];
-}
-function _n(e) {
-  return function(t) {
-    return e(t);
-  };
-}
-var yn = typeof exports == "object" && exports && !exports.nodeType && exports, pe = yn && typeof module == "object" && module && !module.nodeType && module, Ei = pe && pe.exports === yn, He = Ei && an.process, It = (function() {
-  try {
-    var e = pe && pe.require && pe.require("util").types;
-    return e || He && He.binding && He.binding("util");
-  } catch {
-  }
-})(), jt = It && It.isTypedArray, ft = jt ? _n(jt) : Pi, Ti = Object.prototype, Ri = Ti.hasOwnProperty;
-function Ii(e, t) {
-  var n = M(e), r = !n && Te(e), i = !n && !r && Pe(e), s = !n && !r && !i && ft(e), o = n || r || i || s, a = o ? Xr(e.length, String) : [], c = a.length;
-  for (var u in e)
-    Ri.call(e, u) && !(o && // Safari 9 has enumerable `arguments.length` in strict mode.
-    (u == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
-    i && (u == "offset" || u == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
-    s && (u == "buffer" || u == "byteLength" || u == "byteOffset") || // Skip index properties.
-    ct(u, c))) && a.push(u);
-  return a;
-}
-function ji(e, t) {
-  return function(n) {
-    return e(t(n));
-  };
-}
-var $i = ji(Object.keys, Object), Fi = Object.prototype, zi = Fi.hasOwnProperty;
-function ht(e) {
-  if (!hn(e))
-    return $i(e);
-  var t = [];
-  for (var n in Object(e))
-    zi.call(e, n) && n != "constructor" && t.push(n);
-  return t;
-}
-function Re(e) {
-  return ie(e) ? Ii(e) : ht(e);
+function mn(e, t) {
+  return ln(bn(e, t, fe), e + "");
 }
-var Ni = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, Di = /^\w*$/;
-function dt(e, t) {
-  if (M(e))
+function $e(e, t, n) {
+  if (!G(n))
     return !1;
-  var n = typeof e;
-  return n == "number" || n == "symbol" || n == "boolean" || e == null || Z(e) ? !0 : Di.test(e) || !Ni.test(e) || t != null && e in Object(t);
-}
-var ye = re(Object, "create");
-function Hi() {
-  this.__data__ = ye ? ye(null) : {}, this.size = 0;
-}
-function Li(e) {
-  var t = this.has(e) && delete this.__data__[e];
-  return this.size -= t ? 1 : 0, t;
-}
-var qi = "__lodash_hash_undefined__", Qi = Object.prototype, Bi = Qi.hasOwnProperty;
-function Ui(e) {
-  var t = this.__data__;
-  if (ye) {
-    var n = t[e];
-    return n === qi ? void 0 : n;
-  }
-  return Bi.call(t, e) ? t[e] : void 0;
-}
-var Gi = Object.prototype, Ki = Gi.hasOwnProperty;
-function Wi(e) {
-  var t = this.__data__;
-  return ye ? t[e] !== void 0 : Ki.call(t, e);
-}
-var Vi = "__lodash_hash_undefined__";
-function Ji(e, t) {
-  var n = this.__data__;
-  return this.size += this.has(e) ? 0 : 1, n[e] = ye && t === void 0 ? Vi : t, this;
-}
-function k(e) {
-  var t = -1, n = e == null ? 0 : e.length;
-  for (this.clear(); ++t < n; ) {
-    var r = e[t];
-    this.set(r[0], r[1]);
-  }
-}
-k.prototype.clear = Hi;
-k.prototype.delete = Li;
-k.prototype.get = Ui;
-k.prototype.has = Wi;
-k.prototype.set = Ji;
-function Yi() {
-  this.__data__ = [], this.size = 0;
-}
-function Ie(e, t) {
-  for (var n = e.length; n--; )
-    if (ut(e[n][0], t))
-      return 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;
 }
-var Xi = Array.prototype, Zi = Xi.splice;
-function ki(e) {
-  var t = this.__data__, n = Ie(t, e);
-  if (n < 0)
-    return !1;
-  var r = t.length - 1;
-  return n == r ? t.pop() : Zi.call(t, n, 1), --this.size, !0;
-}
-function es(e) {
-  var t = this.__data__, n = Ie(t, e);
-  return n < 0 ? void 0 : t[n][1];
-}
-function ts(e) {
-  return Ie(this.__data__, e) > -1;
-}
-function ns(e, t) {
-  var n = this.__data__, r = Ie(n, e);
-  return r < 0 ? (++this.size, n.push([e, t])) : n[r][1] = t, this;
-}
-function B(e) {
-  var t = -1, n = e == null ? 0 : e.length;
-  for (this.clear(); ++t < n; ) {
-    var r = e[t];
-    this.set(r[0], r[1]);
-  }
-}
-B.prototype.clear = Yi;
-B.prototype.delete = ki;
-B.prototype.get = es;
-B.prototype.has = ts;
-B.prototype.set = ns;
-var ge = re(Q, "Map");
-function rs() {
-  this.size = 0, this.__data__ = {
-    hash: new k(),
-    map: new (ge || B)(),
-    string: new k()
-  };
-}
-function is(e) {
-  var t = typeof e;
-  return t == "string" || t == "number" || t == "symbol" || t == "boolean" ? e !== "__proto__" : e === null;
-}
-function je(e, t) {
-  var n = e.__data__;
-  return is(t) ? n[typeof t == "string" ? "string" : "hash"] : n.map;
-}
-function ss(e) {
-  var t = je(this, e).delete(e);
-  return this.size -= t ? 1 : 0, t;
-}
-function os(e) {
-  return je(this, e).get(e);
-}
-function as(e) {
-  return je(this, e).has(e);
-}
-function cs(e, t) {
-  var n = je(this, e), r = n.size;
-  return n.set(e, t), this.size += n.size == r ? 0 : 1, this;
-}
-function U(e) {
-  var t = -1, n = e == null ? 0 : e.length;
-  for (this.clear(); ++t < n; ) {
-    var r = e[t];
-    this.set(r[0], r[1]);
-  }
-}
-U.prototype.clear = rs;
-U.prototype.delete = ss;
-U.prototype.get = os;
-U.prototype.has = as;
-U.prototype.set = cs;
-var us = "Expected a function";
-function pt(e, t) {
-  if (typeof e != "function" || t != null && typeof t != "function")
-    throw new TypeError(us);
-  var n = function() {
-    var r = arguments, i = t ? t.apply(this, r) : r[0], s = n.cache;
-    if (s.has(i))
-      return s.get(i);
-    var o = e.apply(this, r);
-    return n.cache = s.set(i, o) || s, o;
-  };
-  return n.cache = new (pt.Cache || U)(), n;
-}
-pt.Cache = U;
-var ls = 500;
-function fs(e) {
-  var t = pt(e, function(r) {
-    return n.size === ls && n.clear(), r;
-  }), n = t.cache;
-  return t;
-}
-var hs = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, ds = /\\(\\)?/g, ps = fs(function(e) {
-  var t = [];
-  return e.charCodeAt(0) === 46 && t.push(""), e.replace(hs, function(n, r, i, s) {
-    t.push(i ? s.replace(ds, "$1") : r || n);
-  }), t;
-});
+var He = ze ? ze.isConcatSpreadable : void 0;
 function gn(e) {
-  return e == null ? "" : un(e);
+  return W(e) || Ge(e) || !!(He && e && e[He]);
 }
-function bn(e, t) {
-  return M(e) ? e : dt(e, t) ? [e] : ps(gn(e));
-}
-function $e(e) {
-  if (typeof e == "string" || Z(e))
-    return e;
-  var t = e + "";
-  return t == "0" && 1 / e == -1 / 0 ? "-0" : t;
-}
-function _t(e, t) {
-  t = bn(t, e);
-  for (var n = 0, r = t.length; e != null && n < r; )
-    e = e[$e(t[n++])];
-  return n && n == r ? e : void 0;
-}
-function m(e, t, n) {
-  var r = e == null ? void 0 : _t(e, t);
-  return r === void 0 ? n : r;
-}
-function mn(e, t) {
-  for (var n = -1, r = t.length, i = e.length; ++n < r; )
-    e[i + n] = t[n];
-  return e;
-}
-var $t = N ? N.isConcatSpreadable : void 0;
-function _s(e) {
-  return M(e) || Te(e) || !!($t && e && e[$t]);
-}
-function Sn(e, t, n, r, i) {
-  var s = -1, o = e.length;
-  for (n || (n = _s), i || (i = []); ++s < o; ) {
-    var a = e[s];
-    n(a) ? mn(i, a) : i[i.length] = a;
+function Sn(e, t, n, s, i) {
+  var r = -1, o = e.length;
+  for (n || (n = gn), i || (i = []); ++r < o; ) {
+    var c = e[r];
+    n(c) ? mt(i, c) : i[i.length] = c;
   }
   return i;
 }
-function vn(e, t, n) {
-  var r = -1, i = e.length;
+function wn(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 s = Array(i); ++r < i; )
-    s[r] = e[r + t];
-  return s;
-}
-var ys = "\\ud800-\\udfff", gs = "\\u0300-\\u036f", bs = "\\ufe20-\\ufe2f", ms = "\\u20d0-\\u20ff", Ss = gs + bs + ms, vs = "\\ufe0e\\ufe0f", ws = "\\u200d", Os = RegExp("[" + ws + ys + Ss + vs + "]");
-function Cs(e) {
-  return Os.test(e);
-}
-function Ms() {
-  this.__data__ = new B(), this.size = 0;
-}
-function xs(e) {
-  var t = this.__data__, n = t.delete(e);
-  return this.size = t.size, n;
-}
-function As(e) {
-  return this.__data__.get(e);
-}
-function Ps(e) {
-  return this.__data__.has(e);
-}
-var Es = 200;
-function Ts(e, t) {
-  var n = this.__data__;
-  if (n instanceof B) {
-    var r = n.__data__;
-    if (!ge || r.length < Es - 1)
-      return r.push([e, t]), this.size = ++n.size, this;
-    n = this.__data__ = new U(r);
-  }
-  return n.set(e, t), this.size = n.size, this;
-}
-function L(e) {
-  var t = this.__data__ = new B(e);
-  this.size = t.size;
-}
-L.prototype.clear = Ms;
-L.prototype.delete = xs;
-L.prototype.get = As;
-L.prototype.has = Ps;
-L.prototype.set = Ts;
-function wn(e, t) {
-  for (var n = -1, r = e == null ? 0 : e.length, i = 0, s = []; ++n < r; ) {
-    var o = e[n];
-    t(o, n, e) && (s[i++] = o);
-  }
-  return s;
-}
-function Rs() {
-  return [];
-}
-var Is = Object.prototype, js = Is.propertyIsEnumerable, Ft = Object.getOwnPropertySymbols, $s = Ft ? function(e) {
-  return e == null ? [] : (e = Object(e), wn(Ft(e), function(t) {
-    return js.call(e, t);
-  }));
-} : Rs;
-function Fs(e, t, n) {
-  var r = t(e);
-  return M(e) ? r : mn(r, n(e));
-}
-function zt(e) {
-  return Fs(e, Re, $s);
-}
-var Je = re(Q, "DataView"), Ye = re(Q, "Promise"), Xe = re(Q, "Set"), Nt = "[object Map]", zs = "[object Object]", Dt = "[object Promise]", Ht = "[object Set]", Lt = "[object WeakMap]", qt = "[object DataView]", Ns = ne(Je), Ds = ne(ge), Hs = ne(Ye), Ls = ne(Xe), qs = ne(Ve), F = te;
-(Je && F(new Je(new ArrayBuffer(1))) != qt || ge && F(new ge()) != Nt || Ye && F(Ye.resolve()) != Dt || Xe && F(new Xe()) != Ht || Ve && F(new Ve()) != Lt) && (F = function(e) {
-  var t = te(e), n = t == zs ? e.constructor : void 0, r = n ? ne(n) : "";
-  if (r)
-    switch (r) {
-      case Ns:
-        return qt;
-      case Ds:
-        return Nt;
-      case Hs:
-        return Dt;
-      case Ls:
-        return Ht;
-      case qs:
-        return Lt;
-    }
-  return t;
-});
-var Qt = Q.Uint8Array, Qs = "__lodash_hash_undefined__";
-function Bs(e) {
-  return this.__data__.set(e, Qs), this;
-}
-function Us(e) {
-  return this.__data__.has(e);
-}
-function Ee(e) {
-  var t = -1, n = e == null ? 0 : e.length;
-  for (this.__data__ = new U(); ++t < n; )
-    this.add(e[t]);
-}
-Ee.prototype.add = Ee.prototype.push = Bs;
-Ee.prototype.has = Us;
-function Gs(e, t) {
-  for (var n = -1, r = e == null ? 0 : e.length; ++n < r; )
-    if (t(e[n], n, e))
-      return !0;
-  return !1;
-}
-function Ks(e, t) {
-  return e.has(t);
-}
-var Ws = 1, Vs = 2;
-function On(e, t, n, r, i, s) {
-  var o = n & Ws, a = e.length, c = t.length;
-  if (a != c && !(o && c > a))
-    return !1;
-  var u = s.get(e), l = s.get(t);
-  if (u && l)
-    return u == t && l == e;
-  var f = -1, h = !0, p = n & Vs ? new Ee() : void 0;
-  for (s.set(e, t), s.set(t, e); ++f < a; ) {
-    var g = e[f], b = t[f];
-    if (r)
-      var w = o ? r(b, g, f, t, e, s) : r(g, b, f, e, t, s);
-    if (w !== void 0) {
-      if (w)
-        continue;
-      h = !1;
-      break;
-    }
-    if (p) {
-      if (!Gs(t, function(C, S) {
-        if (!Ks(p, S) && (g === C || i(g, C, n, r, s)))
-          return p.push(S);
-      })) {
-        h = !1;
-        break;
-      }
-    } else if (!(g === b || i(g, b, n, r, s))) {
-      h = !1;
-      break;
-    }
-  }
-  return s.delete(e), s.delete(t), h;
-}
-function Js(e) {
-  var t = -1, n = Array(e.size);
-  return e.forEach(function(r, i) {
-    n[++t] = [i, r];
-  }), n;
-}
-function Ys(e) {
-  var t = -1, n = Array(e.size);
-  return e.forEach(function(r) {
-    n[++t] = r;
-  }), n;
-}
-var Xs = 1, Zs = 2, ks = "[object Boolean]", eo = "[object Date]", to = "[object Error]", no = "[object Map]", ro = "[object Number]", io = "[object RegExp]", so = "[object Set]", oo = "[object String]", ao = "[object Symbol]", co = "[object ArrayBuffer]", uo = "[object DataView]", Bt = N ? N.prototype : void 0, Le = Bt ? Bt.valueOf : void 0;
-function lo(e, t, n, r, i, s, o) {
-  switch (n) {
-    case uo:
-      if (e.byteLength != t.byteLength || e.byteOffset != t.byteOffset)
-        return !1;
-      e = e.buffer, t = t.buffer;
-    case co:
-      return !(e.byteLength != t.byteLength || !s(new Qt(e), new Qt(t)));
-    case ks:
-    case eo:
-    case ro:
-      return ut(+e, +t);
-    case to:
-      return e.name == t.name && e.message == t.message;
-    case io:
-    case oo:
-      return e == t + "";
-    case no:
-      var a = Js;
-    case so:
-      var c = r & Xs;
-      if (a || (a = Ys), e.size != t.size && !c)
-        return !1;
-      var u = o.get(e);
-      if (u)
-        return u == t;
-      r |= Zs, o.set(e, t);
-      var l = On(a(e), a(t), r, i, s, o);
-      return o.delete(e), l;
-    case ao:
-      if (Le)
-        return Le.call(e) == Le.call(t);
-  }
-  return !1;
-}
-var fo = 1, ho = Object.prototype, po = ho.hasOwnProperty;
-function _o(e, t, n, r, i, s) {
-  var o = n & fo, a = zt(e), c = a.length, u = zt(t), l = u.length;
-  if (c != l && !o)
-    return !1;
-  for (var f = c; f--; ) {
-    var h = a[f];
-    if (!(o ? h in t : po.call(t, h)))
-      return !1;
-  }
-  var p = s.get(e), g = s.get(t);
-  if (p && g)
-    return p == t && g == e;
-  var b = !0;
-  s.set(e, t), s.set(t, e);
-  for (var w = o; ++f < c; ) {
-    h = a[f];
-    var C = e[h], S = t[h];
-    if (r)
-      var A = o ? r(S, C, h, t, e, s) : r(C, S, h, e, t, s);
-    if (!(A === void 0 ? C === S || i(C, S, n, r, s) : A)) {
-      b = !1;
-      break;
-    }
-    w || (w = h == "constructor");
-  }
-  if (b && !w) {
-    var V = e.constructor, _ = t.constructor;
-    V != _ && "constructor" in e && "constructor" in t && !(typeof V == "function" && V instanceof V && typeof _ == "function" && _ instanceof _) && (b = !1);
-  }
-  return s.delete(e), s.delete(t), b;
-}
-var yo = 1, Ut = "[object Arguments]", Gt = "[object Array]", Se = "[object Object]", go = Object.prototype, Kt = go.hasOwnProperty;
-function bo(e, t, n, r, i, s) {
-  var o = M(e), a = M(t), c = o ? Gt : F(e), u = a ? Gt : F(t);
-  c = c == Ut ? Se : c, u = u == Ut ? Se : u;
-  var l = c == Se, f = u == Se, h = c == u;
-  if (h && Pe(e)) {
-    if (!Pe(t))
-      return !1;
-    o = !0, l = !1;
-  }
-  if (h && !l)
-    return s || (s = new L()), o || ft(e) ? On(e, t, n, r, i, s) : lo(e, t, c, n, r, i, s);
-  if (!(n & yo)) {
-    var p = l && Kt.call(e, "__wrapped__"), g = f && Kt.call(t, "__wrapped__");
-    if (p || g) {
-      var b = p ? e.value() : e, w = g ? t.value() : t;
-      return s || (s = new L()), i(b, w, n, r, s);
-    }
-  }
-  return h ? (s || (s = new L()), _o(e, t, n, r, i, s)) : !1;
-}
-function Fe(e, t, n, r, i) {
-  return e === t ? !0 : e == null || t == null || !X(e) && !X(t) ? e !== e && t !== t : bo(e, t, n, r, Fe, i);
-}
-var mo = 1, So = 2;
-function vo(e, t, n, r) {
-  var i = n.length, s = i;
-  if (e == null)
-    return !s;
-  for (e = Object(e); i--; ) {
-    var o = n[i];
-    if (o[2] ? o[1] !== e[o[0]] : !(o[0] in e))
-      return !1;
-  }
-  for (; ++i < s; ) {
-    o = n[i];
-    var a = o[0], c = e[a], u = o[1];
-    if (o[2]) {
-      if (c === void 0 && !(a in e))
-        return !1;
-    } else {
-      var l = new L(), f;
-      if (!(f === void 0 ? Fe(u, c, mo | So, r, l) : f))
-        return !1;
-    }
-  }
-  return !0;
-}
-function Cn(e) {
-  return e === e && !ae(e);
-}
-function wo(e) {
-  for (var t = Re(e), n = t.length; n--; ) {
-    var r = t[n], i = e[r];
-    t[n] = [r, i, Cn(i)];
-  }
-  return t;
-}
-function Mn(e, t) {
-  return function(n) {
-    return n == null ? !1 : n[e] === t && (t !== void 0 || e in Object(n));
-  };
-}
-function Oo(e) {
-  var t = wo(e);
-  return t.length == 1 && t[0][2] ? Mn(t[0][0], t[0][1]) : function(n) {
-    return n === e || vo(n, e, t);
-  };
-}
-function Co(e, t) {
-  return e != null && t in Object(e);
-}
-function Mo(e, t, n) {
-  t = bn(t, e);
-  for (var r = -1, i = t.length, s = !1; ++r < i; ) {
-    var o = $e(t[r]);
-    if (!(s = e != null && n(e, o)))
-      break;
-    e = e[o];
-  }
-  return s || ++r != i ? s : (i = e == null ? 0 : e.length, !!i && lt(i) && ct(o, i) && (M(e) || Te(e)));
-}
-function xo(e, t) {
-  return e != null && Mo(e, t, Co);
-}
-var Ao = 1, Po = 2;
-function Eo(e, t) {
-  return dt(e) && Cn(t) ? Mn($e(e), t) : function(n) {
-    var r = m(n, e);
-    return r === void 0 && r === t ? xo(n, e) : Fe(t, r, Ao | Po);
-  };
-}
-function xn(e) {
-  return function(t) {
-    return t?.[e];
-  };
-}
-function To(e) {
-  return function(t) {
-    return _t(t, e);
-  };
-}
-function Ro(e) {
-  return dt(e) ? xn($e(e)) : To(e);
-}
-function W(e) {
-  return typeof e == "function" ? e : e == null ? me : typeof e == "object" ? M(e) ? Eo(e[0], e[1]) : Oo(e) : Ro(e);
-}
-function Io(e) {
-  return function(t, n, r) {
-    for (var i = -1, s = Object(t), o = r(t), a = o.length; a--; ) {
-      var c = o[++i];
-      if (n(s[c], c, s) === !1)
-        break;
-    }
-    return t;
-  };
+  for (var r = Array(i); ++s < i; )
+    r[s] = e[s + t];
+  return r;
 }
-var jo = Io();
-function $o(e, t) {
-  return e && jo(e, t, Re);
-}
-function Fo(e, t) {
-  return function(n, r) {
-    if (n == null)
-      return n;
-    if (!ie(n))
-      return e(n, r);
-    for (var i = n.length, s = -1, o = Object(n); ++s < i && r(o[s], s, o) !== !1; )
-      ;
-    return n;
-  };
+var vn = "\\ud800-\\udfff", Mn = "\\u0300-\\u036f", Cn = "\\ufe20-\\ufe2f", xn = "\\u20d0-\\u20ff", On = Mn + Cn + xn, Pn = "\\ufe0e\\ufe0f", Rn = "\\u200d", En = RegExp("[" + Rn + vn + On + Pn + "]");
+function In(e) {
+  return En.test(e);
 }
-var ze = Fo($o);
-function fe(e) {
-  var t = e == null ? 0 : e.length;
-  return t ? e[t - 1] : void 0;
+function Nn(e, t, n) {
+  return e === e && (n !== void 0 && (e = e <= n ? e : n), t !== void 0 && (e = e >= t ? e : t)), e;
 }
-function zo(e) {
-  return typeof e == "function" ? e : me;
+function zn(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), Nn(ne(e), t, n);
 }
-function Oe(e, t) {
-  var n = M(e) ? Br : ze;
-  return n(e, zo(t));
+function An(e) {
+  return typeof e == "function" ? e : fe;
 }
-function No(e, t) {
-  for (var n = -1, r = e == null ? 0 : e.length; ++n < r; )
-    if (!t(e[n], n, e))
-      return !1;
-  return !0;
+function k(e, t) {
+  var n = W(e) ? fn : Xe;
+  return n(e, An(t));
 }
-function Do(e, t) {
-  var n = !0;
-  return ze(e, function(r, i, s) {
-    return n = !!t(r, i, s), n;
-  }), n;
-}
-function Ho(e, t, n) {
-  var r = M(e) ? No : Do;
-  return r(e, W(t));
-}
-function Lo(e, t) {
+function Fn(e, t) {
   var n = [];
-  return ze(e, function(r, i, s) {
-    t(r, i, s) && n.push(r);
+  return Xe(e, function(s, i, r) {
+    t(s, i, r) && n.push(s);
   }), n;
 }
-function Ce(e, t) {
-  var n = M(e) ? wn : Lo;
-  return n(e, W(t));
+function se(e, t) {
+  var n = W(e) ? gt : Fn;
+  return n(e, V(t));
 }
-function qo(e) {
-  return function(t, n, r) {
+function jn(e) {
+  return function(t, n, s) {
     var i = Object(t);
-    if (!ie(t)) {
-      var s = W(n);
-      t = Re(t), n = function(a) {
-        return s(i[a], a, i);
+    if (!he(t)) {
+      var r = V(n);
+      t = St(t), n = function(c) {
+        return r(i[c], c, i);
       };
     }
-    var o = e(t, n, r);
-    return o > -1 ? i[s ? t[o] : o] : void 0;
+    var o = e(t, n, s);
+    return o > -1 ? i[r ? t[o] : o] : void 0;
   };
 }
-var Qo = Math.max;
-function Bo(e, t, n) {
-  var r = e == null ? 0 : e.length;
-  if (!r)
+var Dn = Math.max;
+function ie(e, t, n) {
+  var s = e == null ? 0 : e.length;
+  if (!s)
     return -1;
-  var i = n == null ? 0 : ln(n);
-  return i < 0 && (i = Qo(r + i, 0)), Ur(e, W(t), i);
+  var i = n == null ? 0 : ot(n);
+  return i < 0 && (i = Dn(s + i, 0)), hn(e, V(t), i);
 }
-var Ze = qo(Bo);
-function Uo(e) {
+var Be = jn(ie);
+function Tn(e) {
   return e && e.length ? e[0] : void 0;
 }
-function An(e, t) {
-  var n = -1, r = ie(e) ? Array(e.length) : [];
-  return ze(e, function(i, s, o) {
-    r[++n] = t(i, s, o);
-  }), r;
-}
-function Y(e, t) {
-  var n = M(e) ? de : An;
-  return n(e, W(t));
-}
-function Go(e, t) {
-  return Sn(Y(e, t));
-}
-function Ko(e) {
-  for (var t = -1, n = e == null ? 0 : e.length, r = {}; ++t < n; ) {
-    var i = e[t];
-    r[i[0]] = i[1];
-  }
-  return r;
-}
-function Wo(e, t) {
+function qn(e, t) {
   return e > t;
 }
-var Vo = "[object String]";
-function Jo(e) {
-  return typeof e == "string" || !M(e) && X(e) && te(e) == Vo;
+var Qn = "[object String]";
+function $n(e) {
+  return typeof e == "string" || !W(e) && wt(e) && vt(e) == Qn;
 }
-function Yo(e) {
-  var t = e == null ? 0 : e.length;
-  return t ? vn(e, 0, -1) : [];
-}
-var Xo = "[object Map]", Zo = "[object Set]", ko = Object.prototype, ea = ko.hasOwnProperty;
-function Pn(e) {
+var Hn = "[object Map]", Bn = "[object Set]", Un = Object.prototype, Kn = Un.hasOwnProperty;
+function Wn(e) {
   if (e == null)
     return !0;
-  if (ie(e) && (M(e) || typeof e == "string" || typeof e.splice == "function" || Pe(e) || ft(e) || Te(e)))
+  if (he(e) && (W(e) || typeof e == "string" || typeof e.splice == "function" || Mt(e) || Ct(e) || Ge(e)))
     return !e.length;
-  var t = F(e);
-  if (t == Xo || t == Zo)
+  var t = Ze(e);
+  if (t == Hn || t == Bn)
     return !e.size;
-  if (hn(e))
-    return !ht(e).length;
+  if (xt(e))
+    return !ke(e).length;
   for (var n in e)
-    if (ea.call(e, n))
+    if (Kn.call(e, n))
       return !1;
   return !0;
 }
-function O(e, t) {
-  return Fe(e, t);
+function ct(e, t) {
+  return Ot(e, t);
 }
-var ta = Array.prototype, na = ta.join;
-function qe(e, t) {
-  return e == null ? "" : na.call(e, t);
+var Vn = Array.prototype, Ln = Vn.join;
+function _e(e, t) {
+  return e == null ? "" : Ln.call(e, t);
 }
-function ra(e, t) {
+function Jn(e, t) {
   return e < t;
 }
-function En(e, t, n) {
-  for (var r = -1, i = e.length; ++r < i; ) {
-    var s = e[r], o = t(s);
-    if (o != null && (a === void 0 ? o === o && !Z(o) : n(o, a)))
-      var a = o, c = s;
+function at(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)))
+      var c = o, a = r;
   }
-  return c;
+  return a;
+}
+function Ue(e, t) {
+  return e && e.length ? at(e, V(t), qn) : void 0;
 }
-function Wt(e, t) {
-  return e && e.length ? En(e, W(t), Wo) : void 0;
+function Yn(e, t) {
+  return e && e.length ? at(e, V(t), Jn) : void 0;
 }
-function ia(e, t) {
-  return e && e.length ? En(e, W(t), ra) : void 0;
+function Gn(e, t, n, s) {
+  if (!G(e))
+    return e;
+  t = Pt(t, e);
+  for (var i = -1, r = t.length, o = r - 1, c = e; c != null && ++i < r; ) {
+    var a = Rt(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]) ? [] : {});
+    }
+    yn(c, a, u), c = c[a];
+  }
+  return e;
 }
-function sa(e, t) {
+function Xn(e, t) {
   var n = e.length;
   for (e.sort(t); n--; )
     e[n] = e[n].value;
   return e;
 }
-function oa(e, t) {
+function Zn(e, t) {
   if (e !== t) {
-    var n = e !== void 0, r = e === null, i = e === e, s = Z(e), o = t !== void 0, a = t === null, c = t === t, u = Z(t);
-    if (!a && !u && !s && e > t || s && o && c && !a && !u || r && o && c || !n && c || !i)
+    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)
       return 1;
-    if (!r && !s && !u && e < t || u && n && i && !r && !s || a && n && i || !o && i || !c)
+    if (!s && !r && !u && e < t || u && n && i && !s && !r || c && n && i || !o && i || !a)
       return -1;
   }
   return 0;
 }
-function aa(e, t, n) {
-  for (var r = -1, i = e.criteria, s = t.criteria, o = i.length, a = n.length; ++r < o; ) {
-    var c = oa(i[r], s[r]);
-    if (c) {
-      if (r >= a)
-        return c;
-      var u = n[r];
-      return c * (u == "desc" ? -1 : 1);
+function kn(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]);
+    if (a) {
+      if (s >= c)
+        return a;
+      var u = n[s];
+      return a * (u == "desc" ? -1 : 1);
     }
   }
   return e.index - t.index;
 }
-function ca(e, t, n) {
-  t.length ? t = de(t, function(s) {
-    return M(s) ? function(o) {
-      return _t(o, s.length === 1 ? s[0] : s);
-    } : s;
-  }) : t = [me];
-  var r = -1;
-  t = de(t, _n(W));
-  var i = An(e, function(s, o, a) {
-    var c = de(t, function(u) {
-      return u(s);
+function es(e, t, n) {
+  t.length ? t = de(t, function(r) {
+    return W(r) ? function(o) {
+      return Et(o, r.length === 1 ? r[0] : r);
+    } : r;
+  }) : t = [fe];
+  var s = -1;
+  t = de(t, It(V));
+  var i = Nt(e, function(r, o, c) {
+    var a = de(t, function(u) {
+      return u(r);
     });
-    return { criteria: c, index: ++r, value: s };
+    return { criteria: a, index: ++s, value: r };
   });
-  return sa(i, function(s, o) {
-    return aa(s, o, n);
+  return Xn(i, function(r, o) {
+    return kn(r, o, n);
   });
 }
-var ua = xn("length"), Tn = "\\ud800-\\udfff", la = "\\u0300-\\u036f", fa = "\\ufe20-\\ufe2f", ha = "\\u20d0-\\u20ff", da = la + fa + ha, pa = "\\ufe0e\\ufe0f", _a = "[" + Tn + "]", ke = "[" + da + "]", et = "\\ud83c[\\udffb-\\udfff]", ya = "(?:" + ke + "|" + et + ")", Rn = "[^" + Tn + "]", In = "(?:\\ud83c[\\udde6-\\uddff]){2}", jn = "[\\ud800-\\udbff][\\udc00-\\udfff]", ga = "\\u200d", $n = ya + "?", Fn = "[" + pa + "]?", ba = "(?:" + ga + "(?:" + [Rn, In, jn].join("|") + ")" + Fn + $n + ")*", ma = Fn + $n + ba, Sa = "(?:" + [Rn + ke + "?", ke, In, jn, _a].join("|") + ")", Vt = RegExp(et + "(?=" + et + ")|" + Sa + ma, "g");
-function va(e) {
-  for (var t = Vt.lastIndex = 0; Vt.test(e); )
+var ts = zt("length"), ut = "\\ud800-\\udfff", ns = "\\u0300-\\u036f", ss = "\\ufe20-\\ufe2f", is = "\\u20d0-\\u20ff", rs = ns + ss + is, os = "\\ufe0e\\ufe0f", cs = "[" + ut + "]", Me = "[" + rs + "]", Ce = "\\ud83c[\\udffb-\\udfff]", as = "(?:" + Me + "|" + Ce + ")", lt = "[^" + ut + "]", ft = "(?:\\ud83c[\\udde6-\\uddff]){2}", ht = "[\\ud800-\\udbff][\\udc00-\\udfff]", us = "\\u200d", dt = as + "?", pt = "[" + os + "]?", ls = "(?:" + us + "(?:" + [lt, ft, ht].join("|") + ")" + pt + dt + ")*", fs = pt + dt + ls, hs = "(?:" + [lt + Me + "?", Me, ft, ht, cs].join("|") + ")", Ke = RegExp(Ce + "(?=" + Ce + ")|" + hs + fs, "g");
+function ds(e) {
+  for (var t = Ke.lastIndex = 0; Ke.test(e); )
     ++t;
   return t;
 }
-function wa(e) {
-  return Cs(e) ? va(e) : ua(e);
+function ps(e) {
+  return In(e) ? ds(e) : ts(e);
+}
+function _s(e, t, n) {
+  return e == null ? e : Gn(e, t, n);
 }
-var Oa = "[object Map]", Ca = "[object Set]";
-function oe(e) {
+var ys = "[object Map]", bs = "[object Set]";
+function U(e) {
   if (e == null)
     return 0;
-  if (ie(e))
-    return Jo(e) ? wa(e) : e.length;
-  var t = F(e);
-  return t == Oa || t == Ca ? e.size : ht(e).length;
+  if (he(e))
+    return $n(e) ? ps(e) : e.length;
+  var t = Ze(e);
+  return t == ys || t == bs ? e.size : ke(e).length;
 }
-var Me = Vr(function(e, t) {
+var re = mn(function(e, t) {
   if (e == null)
     return [];
   var n = t.length;
-  return n > 1 && Pt(e, t[0], t[1]) ? t = [] : n > 2 && Pt(t[0], t[1], t[2]) && (t = [t[0]]), ca(e, Sn(t), []);
+  return n > 1 && $e(e, t[0], t[1]) ? t = [] : n > 2 && $e(t[0], t[1], t[2]) && (t = [t[0]]), es(e, Sn(t), []);
 });
-function Ma(e, t, n) {
-  return e && e.length ? (t = t === void 0 ? 1 : ln(t), vn(e, 0, t < 0 ? 0 : t)) : [];
-}
-var xa = 0;
-function Jt(e) {
-  var t = ++xa;
-  return gn(e) + t;
-}
-const Aa = (e, t) => {
-  if (Pn(e)) return [t];
-  const n = fe(e);
-  return O(n.type, "create") && O(t.type, "delete") ? null : O(n.type, "create") && O(t.type, "update") ? [{ ...n, data: t.data }] : O(n.type, "update") && O(t.type, "update") ? [...Yo(e), t] : O(n.type, "update") && O(t.type, "delete") ? [...e, t] : [t];
-};
-class Pa {
+function ms(e, t, n) {
+  return e && e.length ? (t = t === void 0 ? 1 : ot(t), wn(e, 0, t < 0 ? 0 : t)) : [];
+}
+const gs = (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 Ss {
   _config;
   _state;
   _subscribers = /* @__PURE__ */ new Set();
@@ -1963,7 +1247,7 @@ class Pa {
   }
   enqueue(t) {
     this._updateState((n) => {
-      const r = [...n.queue.get(t.id) ?? []], i = Aa(r, t);
+      const s = n.queue.get(t.id), i = gs(s, t);
       i ? n.queue.set(t.id, i) : n.queue.delete(t.id), n.errors.delete(t.id);
     }), this._scheduleFlush();
   }
@@ -1980,21 +1264,21 @@ class Pa {
   retryAll() {
     const t = this._state.errors;
     t.size !== 0 && (this._updateState((n) => {
-      for (const [r, i] of t)
-        n.queue.has(r) || n.queue.set(r, i.operations);
+      for (const [s, i] of t)
+        n.queue.has(s) || n.queue.set(s, i.operation);
       n.errors.clear();
     }), this._scheduleFlush());
   }
   retry(t) {
     const n = this._state.errors.get(t);
-    n && (this._updateState((r) => {
-      r.queue.has(t) || r.queue.set(t, n.operations), r.errors.delete(t);
+    n && (this._updateState((s) => {
+      s.queue.has(t) || s.queue.set(t, n.operation), s.errors.delete(t);
     }), this._scheduleFlush());
   }
   resetRetries(t) {
     this._state.errors.has(t) && this._updateState((n) => {
-      const r = n.errors.get(t);
-      r && (r.retries = 0);
+      const s = n.errors.get(t);
+      s && (s.retries = 0);
     });
   }
   destroy() {
@@ -2013,7 +1297,7 @@ class Pa {
     return this._subscribers.add(t), () => this._subscribers.delete(t);
   }
   _updateState(t) {
-    this._state = I(this._state, t), this._subscribers.forEach((n) => n());
+    this._state = P(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));
@@ -2021,97 +1305,66 @@ class Pa {
   _clearTimer() {
     this._debounceTimer && (clearTimeout(this._debounceTimer), this._debounceTimer = null);
   }
-  /**
-   * Flush pending changes to the server.
-   *
-   * Flow:
-   * 1. Move queued items to inFlight (atomic swap prevents duplicate sends)
-   * 2. Flatten all changes and optionally batch by batchSize
-   * 3. Send to server via onSync callback
-   * 4. Process results (handle success, retries, ID remapping)
-   * 5. Schedule next flush if more items queued
-   */
   async _flush() {
-    const { isPaused: t, isSyncing: n, queue: r } = this._state;
-    if (t || n || O(oe(r), 0)) return;
-    const i = m(this._config, "batchSize", 1 / 0), s = [...r.entries()], o = Ma(s, i), a = s.slice(oe(o));
+    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(U(o));
     this._updateState((l) => {
-      l.inFlight = new Map(o), l.queue = new Map(a), l.isSyncing = !0;
+      l.inFlight = new Map(o), l.queue = new Map(c), l.isSyncing = !0;
     });
-    const c = Go([...this._state.inFlight.values()]), u = this._config.getContext?.();
+    const a = [...this._state.inFlight.values()], u = this._config.getContext?.();
     this._abortController = new AbortController();
     try {
-      const l = await this._config.onSync(c, u, this._abortController.signal);
-      this._processResults(Ko(Y(l, (f) => [f.id, f])));
+      const l = await this._config.onSync(a, u, this._abortController.signal);
+      this._processResponse(l);
     } catch (l) {
       this._handleError(l);
     }
-    this._abortController = null, oe(this._state.queue) > 0 && !this._state.isPaused && this._scheduleFlush();
-  }
-  /**
-   * Process sync results and update state accordingly.
-   *
-   * For each item in flight:
-   * - If ALL operations succeeded: clear errors, collect ID remappings
-   * - If ANY operation failed: increment retry counter, re-queue if under maxRetries
-   *
-   * ID Remapping: When server assigns new IDs to created items (e.g., temp ID -> DB ID),
-   * we collect these mappings and notify via onIdRemap callback so the collection
-   * can update its local state.
-   */
-  _processResults(t) {
-    const n = this._state.inFlight, r = [];
-    this._updateState((i) => {
-      for (const [s, o] of n)
-        if (Ho(
-          o,
-          (c) => O(m(t, [c.id, "status"]), "success")
-        ))
-          i.errors.delete(s), Oe(o, (c) => {
-            const u = m(t, c.id);
-            O(c.type, "create") && m(u, "newId") && !O(m(u, "newId"), c.id) && r.push({ tempId: c.id, newId: u.newId });
-          });
+    this._abortController = null, U(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]));
+    if (this._updateState((i) => {
+      for (const [r, o] of n) {
+        const c = s.get(r);
+        if (c?.status === "success")
+          i.errors.delete(r);
         else {
-          const c = m(i.errors.get(s), "retries", 0) + 1;
-          c < this._config.maxRetries && !i.queue.has(s) && i.queue.set(s, o);
-          const u = Ze(o, (l) => !O(m(t, [l.id, "status"]), "success"));
-          i.errors.set(s, {
-            error: m(t, [m(u, "id", ""), "error"], "Unknown error"),
-            retries: c,
-            operations: o
+          const a = (i.errors.get(r)?.retries ?? 0) + 1;
+          a < this._config.maxRetries && !i.queue.has(r) && i.queue.set(r, o), i.errors.set(r, {
+            error: c?.error ?? "Unknown error",
+            retries: a,
+            operation: o
           });
         }
+      }
       i.inFlight = /* @__PURE__ */ new Map(), i.isSyncing = !1;
-    }), !Pn(r) && this._config.onIdRemap && this._config.onIdRemap(r);
+    }), this._config.onServerItems && U(t.items) > 0) {
+      const i = new Set((t.syncResults ?? []).map((o) => o.id)), r = (t.items ?? []).filter(
+        (o) => !i.has(o.id)
+      );
+      U(r) > 0 && this._config.onServerItems(r);
+    }
   }
-  /**
-   * Handle network or unexpected errors during sync.
-   *
-   * Two scenarios:
-   * 1. Aborted (e.g., SyncQueue destroyed): Re-queue all items without incrementing retries
-   * 2. Actual error: Increment retries, re-queue if under limit, record error
-   *
-   * This ensures no data loss - failed operations are preserved for retry.
-   */
   _handleError(t) {
-    const n = this._state.inFlight, r = m(this._abortController, "signal.aborted", !1), i = t instanceof Error ? t.message : String(t);
-    this._updateState((s) => {
-      for (const [o, a] of n)
-        if (r)
-          s.queue.has(o) || s.queue.set(o, a);
+    const n = this._state.inFlight, s = z(this._abortController, "signal.aborted", !1), i = t instanceof Error ? t.message : String(t);
+    this._updateState((r) => {
+      for (const [o, c] of n)
+        if (s)
+          r.queue.has(o) || r.queue.set(o, c);
         else {
-          const c = m(s.errors.get(o), "retries", 0) + 1;
-          c < this._config.maxRetries && !s.queue.has(o) && s.queue.set(o, a), s.errors.set(o, {
+          const a = (r.errors.get(o)?.retries ?? 0) + 1;
+          a < this._config.maxRetries && !r.queue.has(o) && r.queue.set(o, c), r.errors.set(o, {
             error: i,
-            retries: c,
-            operations: a
+            retries: a,
+            operation: c
           });
         }
-      s.inFlight = /* @__PURE__ */ new Map(), s.isSyncing = !1;
+      r.inFlight = /* @__PURE__ */ new Map(), r.isSyncing = !1;
     });
   }
 }
-class Ea {
+class ws {
   _cache = /* @__PURE__ */ new Map();
   _capacity;
   _ttl;
@@ -2126,8 +1379,8 @@ class Ea {
     if (this._cache.has(t))
       this._cache.delete(t);
     else if (this._cache.size >= this._capacity) {
-      const r = this._cache.keys().next().value;
-      r !== void 0 && this._cache.delete(r);
+      const s = this._cache.keys().next().value;
+      s !== void 0 && this._cache.delete(s);
     }
     this._cache.set(t, { data: n, ts: Date.now() });
   }
@@ -2144,7 +1397,7 @@ class Ea {
     return this._cache.size;
   }
 }
-class Ta {
+class vs {
   _config;
   _cache;
   _state = { status: "idle", items: [] };
@@ -2152,43 +1405,43 @@ class Ta {
   _abortController = null;
   _currentContext = null;
   constructor(t) {
-    this._config = { retries: 0, ...t }, this._cache = new Ea(t.cacheCapacity, t.cacheTtl);
+    this._config = { retries: 0, ...t }, this._cache = new ws(t.cacheCapacity, t.cacheTtl);
   }
   _getCacheKey = (t) => JSON.stringify([this._config.id, t]);
   _setState(t) {
-    this._state = I(this._state, (n) => {
+    this._state = P(this._state, (n) => {
       Object.assign(n, t);
     }), this._subscribers.forEach((n) => n());
   }
   async _fetchWithRetry(t, n) {
-    const r = this._config.retries;
+    const s = this._config.retries;
     let i;
-    for (let s = 0; s <= r; s++) {
+    for (let r = 0; r <= s; r++) {
       if (n.aborted) throw new DOMException("Aborted", "AbortError");
       try {
-        return s > 0 && this._setState({ retryCount: s }), await this._config.onFetch(t, n);
+        return r > 0 && this._setState({ retryCount: r }), await this._config.onFetch(t, n);
       } catch (o) {
-        if (i = o, n.aborted || s === r) throw o;
+        if (i = o, n.aborted || r === s) throw o;
       }
     }
     throw i;
   }
   async fetch(t) {
-    const n = this._getCacheKey(t), r = this._cache.get(n);
-    if (r !== null)
-      return this._currentContext = t, this._setState({ status: "idle", items: r, error: void 0, retryCount: void 0 }), r;
+    const n = this._getCacheKey(t), s = this._cache.get(n);
+    if (s !== null)
+      return this._currentContext = t, this._setState({ status: "idle", items: s, error: void 0, retryCount: void 0 }), s;
     this._abortController?.abort("New fetch request started");
     const i = new AbortController();
     this._abortController = i, this._currentContext = t, this._setState({ status: "fetching", error: void 0, retryCount: void 0 });
     try {
-      const s = await this._fetchWithRetry(t, i.signal);
-      return this._cache.set(n, s), this._abortController = null, this._setState({ status: "idle", items: s, error: void 0, retryCount: void 0 }), s;
-    } catch (s) {
+      const r = await this._fetchWithRetry(t, i.signal);
+      return this._cache.set(n, r), this._abortController = null, this._setState({ status: "idle", items: r, error: void 0, retryCount: void 0 }), r;
+    } catch (r) {
       if (i.signal.aborted) return this._state.items;
       throw this._abortController = null, this._setState({
         status: "error",
-        error: s instanceof Error ? s.message : String(s)
-      }), s;
+        error: r instanceof Error ? r.message : String(r)
+      }), r;
     }
   }
   async refresh(t) {
@@ -2214,7 +1467,7 @@ class Ta {
     };
   }
 }
-class Yt {
+class We {
   _collection;
   _id;
   _cachedStatus = null;
@@ -2235,36 +1488,30 @@ class Yt {
   }
   getStatus() {
     const t = this._collection.getItemStatus(this._id);
-    return O(this._cachedStatus, t) || (this._cachedStatus = t), this._cachedStatus;
+    return ct(this._cachedStatus, t) || (this._cachedStatus = t), this._cachedStatus;
   }
   exists() {
     return this._collection.getState().items.has(this._id);
   }
-  // Expose collection for useItem hook
   get collection() {
     return this._collection;
   }
-  // Internal method to update ID after server assigns permanent ID
-  // Called by Collection when handling ID remapping
-  _updateId(t) {
-    this._id = t;
-  }
 }
-const Ra = ".";
-function Xt(e, t) {
+const Ms = ".";
+function H(e, t) {
   const n = e.lastIndexOf(t);
   return n === -1 ? null : e.slice(0, n);
 }
-function Ia(e, t, n) {
+function Cs(e, t, n) {
   return e.startsWith(t + n) ? !e.slice(t.length + 1).includes(n) : !1;
 }
-function Qe(e, t, n) {
+function ye(e, t, n) {
   return e.startsWith(t + n);
 }
-function Zt(e, t) {
+function Ve(e, t) {
   return e.split(t).length - 1;
 }
-class kt {
+class Le {
   _id;
   _collection;
   _cachedStatus = null;
@@ -2272,7 +1519,7 @@ class kt {
     this._collection = t, this._id = n;
   }
   get _separator() {
-    return this._collection.config.nodeSeparator ?? Ra;
+    return this._collection.config.nodeSeparator ?? Ms;
   }
   get id() {
     return this._id;
@@ -2284,37 +1531,100 @@ class kt {
     return this._collection;
   }
   get depth() {
-    return Zt(this._id, this._separator);
+    return Ve(this._id, this._separator);
   }
   exists() {
     return this._collection.getState().items.has(this._id);
   }
   getStatus() {
     const t = this._collection.getItemStatus(this._id);
-    return O(this._cachedStatus, t) || (this._cachedStatus = t), this._cachedStatus;
+    return ct(this._cachedStatus, t) || (this._cachedStatus = t), this._cachedStatus;
+  }
+  _touch(t) {
+    this._collection.items.has(t) && this._collection.update(t, (n) => {
+      n.clientUpdatedAt = Date.now();
+    });
   }
   getParent() {
-    const t = Xt(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 = Y(
-      Ce(t, ([i]) => Ia(i, this._id, this._separator)),
-      ([i, s]) => ({ id: i, position: s.position })
-    ), r = Me(n, "position");
-    return Y(r, (i) => this._collection.getNode(i.id));
+    const t = [...this._collection.items.entries()], n = K(
+      se(t, ([i]) => Cs(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));
   }
   _generateChildId() {
-    const { getNodeId: t } = this._collection.config, n = t ? t() : Jt();
-    return qe([this._id, n], this._separator);
+    const { getNodeId: t } = this._collection.config, n = t ? t() : be();
+    return _e([this._id, n], this._separator);
+  }
+  moveUp() {
+    const t = this.data;
+    if (!t) return;
+    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;
+    const o = i[r - 1], c = o.data;
+    if (!c) return;
+    const a = t.position;
+    this._collection.batch(() => {
+      this._collection.update(o.id, (u) => {
+        u.position = a;
+      }), this._collection.update(this._id, (u) => {
+        u.position = c.position;
+      }), this._touch(n);
+    });
+  }
+  moveDown() {
+    const t = this.data;
+    if (!t) return;
+    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 >= U(i) - 1) return;
+    const o = i[r + 1], c = o.data;
+    if (!c) return;
+    const a = t.position;
+    this._collection.batch(() => {
+      this._collection.update(o.id, (u) => {
+        u.position = a;
+      }), this._collection.update(this._id, (u) => {
+        u.position = c.position;
+      }), this._touch(n);
+    });
+  }
+  setPosition(t) {
+    if (!this.data) return;
+    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 = zn(t, 0, U(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) => {
+          p.position = f;
+        });
+      }), this._touch(s);
+    });
   }
   append(t, n = "object") {
-    const r = this.getChildren(), i = Wt(r, (u) => m(u, "data.position", 0)), o = (i ? m(i, "data.position", 0) : -1) + 1, a = this._generateChildId(), c = { id: a, position: o, value: t, type: n };
-    return this._collection.create(c), a;
+    const s = this.getChildren(), i = Ue(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;
   }
   prepend(t, n = "object") {
-    const r = this.getChildren(), i = ia(r, (u) => m(u, "data.position", 0)), o = (i ? m(i, "data.position", 0) : 1) - 1, a = this._generateChildId(), c = { id: a, position: o, value: t, type: n };
-    return this._collection.create(c), a;
+    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 };
+    return this._collection.batch(() => {
+      this._collection.create(a), this._touch(this._id);
+    }), c;
   }
   /**
    * Move node to a new position within the same parent (reordering)
@@ -2324,20 +1634,20 @@ class kt {
    * @param targetParent - Optional target parent node. If not provided, moves within current parent.
    */
   move(t, n) {
-    const r = this.data;
-    if (!r) return;
-    const i = Xt(this._id, this._separator);
+    const s = this.data;
+    if (!s) return;
+    const i = H(this._id, this._separator);
     if (!i) return;
     if (!n) {
-      const o = r.position;
+      const o = s.position;
       if (o === t) return;
-      const c = this._collection.getNode(i).getChildren(), u = Ze(c, (l) => m(l, "data.position") === t);
+      const a = this._collection.getNode(i).getChildren(), u = Be(a, (l) => z(l, "data.position") === t);
       this._collection.batch(() => {
         u && this._collection.update(u.id, (l) => {
           l.position = o;
         }), this._collection.update(this._id, (l) => {
           l.position = t;
-        });
+        }), this._touch(i);
       });
       return;
     }
@@ -2345,11 +1655,11 @@ class kt {
       this.move(t);
       return;
     }
-    if (n.id === this._id || Qe(n.id, this._id, this._separator))
+    if (n.id === this._id || ye(n.id, this._id, this._separator))
       return;
-    const s = this.clone();
+    const r = this.clone();
     this._collection.batch(() => {
-      n._mergeClonedSubset(s, t), this.remove();
+      n._mergeClonedSubset(r, t), this.remove();
     });
   }
   /**
@@ -2360,19 +1670,19 @@ class kt {
   clone() {
     const t = this.data;
     if (!t) return /* @__PURE__ */ new Map();
-    const { getNodeId: n } = this._collection.config, r = n ? n() : Jt(), i = /* @__PURE__ */ new Map();
-    i.set(r, {
-      id: r,
+    const { getNodeId: n } = this._collection.config, s = n ? n() : be(), i = /* @__PURE__ */ new Map();
+    i.set(s, {
+      id: s,
       position: t.position,
       value: t.value,
       type: t.type
     });
-    const s = Ce(
+    const r = se(
       [...this._collection.items.entries()],
-      ([o]) => Qe(o, this._id, this._separator)
+      ([o]) => ye(o, this._id, this._separator)
     );
-    return Oe(s, ([o, a]) => {
-      const c = o.slice(this._id.length + 1), u = qe([r, c], this._separator), l = a;
+    return k(r, ([o, c]) => {
+      const a = o.slice(this._id.length + 1), u = _e([s, a], this._separator), l = c;
       i.set(u, {
         id: u,
         position: l.position,
@@ -2387,33 +1697,33 @@ class kt {
    */
   _mergeClonedSubset(t, n) {
     if (t.size === 0) return;
-    const r = [...t.keys()];
-    let i = Ze(r, (a) => !a.includes(this._separator));
-    if (i || (i = Uo(Me(r, (a) => a.length))), !i) return;
-    const s = this._generateChildId();
+    const s = [...t.keys()];
+    let i = Be(s, (c) => !c.includes(this._separator));
+    if (i || (i = Tn(re(s, (c) => c.length))), !i) return;
+    const r = this._generateChildId();
     let o;
     if (n !== void 0)
       o = n;
     else {
-      const a = this.getChildren(), c = Wt(a, (l) => m(l, "data.position", 0));
-      o = (c ? m(c, "data.position", 0) : -1) + 1;
+      const c = this.getChildren(), a = Ue(c, (l) => z(l, "data.position", 0));
+      o = (a ? z(a, "data.position", 0) : -1) + 1;
     }
-    return Oe([...t.entries()], ([a, c]) => {
+    return k([...t.entries()], ([c, a]) => {
       let u;
-      if (a === i)
-        u = s;
+      if (c === i)
+        u = r;
       else {
-        const f = a.slice(i.length);
-        u = qe([s, f.slice(this._separator.length)], this._separator);
+        const f = c.slice(i.length);
+        u = _e([r, f.slice(this._separator.length)], this._separator);
       }
       const l = {
         id: u,
-        position: a === i ? o : c.position,
-        value: c.value,
-        type: c.type
+        position: c === i ? o : a.position,
+        value: a.value,
+        type: a.type
       };
       this._collection.create(l);
-    }), s;
+    }), this._touch(this._id), r;
   }
   updateProp(t) {
     this._collection.update(this._id, (n) => {
@@ -2421,45 +1731,58 @@ class kt {
     });
   }
   remove() {
-    const t = [...this._collection.items.keys()], n = Y(
-      Ce(t, (i) => Qe(i, this._id, this._separator)),
-      (i) => i
-    ), r = [this._id, ...n];
+    const t = H(this._id, this._separator), n = [...this._collection.items.keys()], s = K(
+      se(n, (r) => ye(r, this._id, this._separator)),
+      (r) => r
+    ), i = [this._id, ...s];
     this._collection.batch(() => {
-      const i = Me(r, (s) => -Zt(s, this._separator));
-      Oe(i, (s) => this._collection.remove(s));
+      const r = re(i, (o) => -Ve(o, this._separator));
+      k(r, (o) => this._collection.remove(o)), t && this._touch(t);
     });
   }
   select() {
     this._collection.selectNode(this._id);
   }
-  _updateId(t) {
-    this._id = t;
-  }
 }
-class R {
-  // Global cache of collection instances by id
+function _t(e) {
+  const t = /* @__PURE__ */ new Map();
+  if (e.serverItems)
+    for (const n of e.serverItems)
+      t.set(n.id, n);
+  return {
+    context: e.initialContext,
+    items: t,
+    syncState: "idle",
+    loading: !1,
+    syncing: !1,
+    syncQueue: {
+      queue: /* @__PURE__ */ new Map(),
+      inFlight: /* @__PURE__ */ new Map(),
+      errors: /* @__PURE__ */ new Map(),
+      isSyncing: !1,
+      isPaused: !1
+    },
+    fetchStatus: "idle",
+    fetchError: void 0
+  };
+}
+class O {
   // eslint-disable-next-line @typescript-eslint/no-explicit-any
   static _cache = /* @__PURE__ */ new Map();
-  // Get or create a collection instance
   static get(t) {
-    const n = R._cache.get(t.id);
-    if (n)
-      return n;
-    const r = new R(t);
-    return R._cache.set(t.id, r), r;
+    const n = O._cache.get(t.id);
+    if (n) return n;
+    const s = new O(t);
+    return O._cache.set(t.id, s), s;
   }
-  // Clear a specific collection from cache
   static clear(t) {
-    R._cache.delete(t);
+    O._cache.get(t)?.destroy();
   }
-  // Clear all collections from cache
   static clearAll() {
-    R._cache.clear();
+    O._cache.forEach((t) => t.destroy());
   }
-  // Get existing collection by ID (returns undefined if not found)
   static getById(t) {
-    return R._cache.get(t);
+    return O._cache.get(t);
   }
   id;
   config;
@@ -2475,37 +1798,39 @@ class R {
   _batchMode = !1;
   constructor(t) {
     this.id = t.id, this.config = t;
-    const n = async (s) => s.map((o) => ({ id: o.id, status: "success" }));
-    this._syncQueue = new Pa({
+    const n = t.handler ? (o, c) => t.handler({ query: o }, c).then((a) => a.items ?? []) : async () => [], s = t.handler ? (o, c, a) => t.handler({ changes: o }, a) : async (o) => ({
+      syncResults: K(o, (c) => ({
+        status: "success",
+        id: c.id,
+        type: c.type,
+        serverSyncedAt: ""
+      })),
+      serverSyncedAt: ""
+    });
+    this._syncQueue = new Ss({
       debounce: t.syncDebounce ?? 300,
       maxRetries: t.syncRetries ?? 3,
       getContext: () => this._state.context,
-      onSync: t.onSync ?? n,
-      onIdRemap: (s) => this._handleIdRemap(s)
-    }), this._fetchHandler = new Ta({
+      onSync: s
+    }), this._fetchHandler = new vs({
       id: t.id,
       cacheCapacity: t.cacheCapacity ?? 10,
       cacheTtl: t.cacheTtl ?? 6e4,
       retries: t.fetchRetries ?? 0,
-      onFetch: t.onFetch
+      onFetch: n
     });
-    const r = this._syncQueue.getState(), i = this._fetchHandler.getState();
+    const i = this._syncQueue.getState(), r = this._fetchHandler.getState();
     this._state = {
       context: t.initialContext,
       items: /* @__PURE__ */ new Map(),
       syncState: "idle",
       loading: !1,
       syncing: !1,
-      syncQueue: r,
-      fetchStatus: i.status,
-      fetchError: i.error
-    }, this._syncQueue.subscribe(() => {
-      this._onSyncQueueChange();
-    }), this._fetchHandler.subscribe(() => {
-      this._onFetchChange();
-    }), this._initialFetch();
-  }
-  // Getters for convenience (read from state)
+      syncQueue: i,
+      fetchStatus: r.status,
+      fetchError: r.error
+    }, this._syncQueue.subscribe(() => this._onSyncQueueChange()), this._fetchHandler.subscribe(() => this._onFetchChange()), this._initialFetch();
+  }
   get context() {
     return this._state.context;
   }
@@ -2521,94 +1846,82 @@ class R {
   get syncQueue() {
     return this._state.syncQueue;
   }
-  // Subscribe to state changes
   subscribe(t) {
-    return this._subscribers.add(t), () => {
-      this._subscribers.delete(t);
-    };
+    return this._subscribers.add(t), () => this._subscribers.delete(t);
   }
-  // Get current state (for useSyncExternalStore) - returns cached reference
   getState() {
     return this._state;
   }
-  // Get item status from sync queue state
   getItemStatus(t) {
-    const { queue: n, inFlight: r, errors: i } = this._state.syncQueue, s = r.get(t), o = fe(s);
-    if (o)
+    const { queue: n, inFlight: s, errors: i } = this._state.syncQueue, r = s.get(t);
+    if (r)
       return {
-        type: o.type,
+        type: r.type,
         status: "syncing",
-        retries: m(i.get(t), "retries", 0)
+        retries: i.get(t)?.retries ?? 0
       };
-    const a = n.get(t), c = fe(a);
-    if (c) {
-      const l = i.get(t);
+    const o = n.get(t);
+    if (o) {
+      const a = i.get(t);
       return {
-        type: c.type,
-        status: l ? "error" : "pending",
-        retries: m(l, "retries", 0),
-        error: m(l, "error")
+        type: o.type,
+        status: a ? "error" : "pending",
+        retries: a?.retries ?? 0,
+        error: a?.error
       };
     }
-    const u = i.get(t);
-    return u ? {
+    const c = i.get(t);
+    return c ? {
       type: "update",
       status: "error",
-      retries: u.retries,
-      error: u.error
+      retries: c.retries,
+      error: c.error
     } : null;
   }
-  // Create a new item (local-first)
   create(t) {
-    const n = this.config.getId(t);
-    this._state = I(this._state, (r) => {
-      r.items.set(n, t);
-    }), this._fetchHandler.invalidateCache(), this._notifySubscribers(), this._syncQueue.enqueue({ id: n, type: "create", data: t });
+    const { id: n } = t;
+    return this._state = P(this._state, (s) => {
+      s.items.set(n, t);
+    }), this._fetchHandler.invalidateCache(), this._notifySubscribers(), this._syncQueue.enqueue({ id: n, type: "create", data: t }), n;
   }
-  // Update an existing item (local-first)
   update(t, n) {
-    const r = this._state.items.get(t);
-    if (!r) return;
-    const i = I(r, n);
-    this._state = I(this._state, (s) => {
-      s.items.set(t, i);
+    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);
     }), this._fetchHandler.invalidateCache(), this._notifySubscribers(), this._syncQueue.enqueue({ id: t, type: "update", data: i });
   }
-  // Remove an item (local-first)
   remove(t) {
     const n = this._state.items.get(t);
-    n && (this._state = I(this._state, (r) => {
-      r.items.delete(t);
+    n && (this._state = P(this._state, (s) => {
+      s.items.delete(t);
     }), this._fetchHandler.invalidateCache(), this._notifySubscribers(), this._syncQueue.enqueue({ id: t, type: "delete", data: n }));
   }
-  // Get Item reference (cached by data object)
   getItem(t) {
     const n = this._state.items.get(t);
-    if (!n)
-      return new Yt(this, t);
-    const r = n;
-    let i = this._itemCache.get(r);
-    return i || (i = new Yt(this, t), this._itemCache.set(r, i)), i;
+    if (!n) return new We(this, t);
+    const s = n;
+    let i = this._itemCache.get(s);
+    return i || (i = new We(this, t), this._itemCache.set(s, i)), i;
   }
-  // Get Node reference (cached by data object) - for tree collections
   getNode(t) {
     const n = this._state.items.get(t);
     if (!n)
-      return new kt(this, t);
-    const r = n;
-    let i = this._nodeCache.get(r);
-    return i || (i = new kt(this, t), this._nodeCache.set(r, i)), i;
+      return new Le(this, t);
+    const s = n;
+    let i = this._nodeCache.get(s);
+    return i || (i = new Le(this, t), this._nodeCache.set(s, i)), i;
   }
-  // Execute multiple operations with single notification at the end
   batch(t) {
+    const n = this._batchMode;
     this._batchMode = !0;
     try {
       t();
     } finally {
-      this._batchMode = !1, this._notifySubscribers();
+      this._batchMode = n, n || this._notifySubscribers();
     }
   }
-  // Selection methods for tree nodes
   selectNode(t) {
     this._selectedNodeId !== t && (this._selectedNodeId = t, this._notifySubscribers());
   }
@@ -2622,18 +1935,15 @@ class R {
   get selectedNode() {
     return this._selectedNodeId ? this.getNode(this._selectedNodeId) : null;
   }
-  // Update context and refetch
   setContext(t) {
-    const n = this._state.context, r = I(n, t);
-    n !== r && (this._state = I(this._state, (i) => {
-      i.context = r;
-    }), this._fetchHandler.fetch(r), this._notifySubscribers());
+    const n = this._state.context, s = P(n, t);
+    n !== s && (this._state = P(this._state, (i) => {
+      i.context = s;
+    }), this._fetchHandler.fetch(s), this._notifySubscribers());
   }
-  // Force refresh (bypass cache)
   async refresh() {
     this._fetchHandler.invalidateCache(), await this._fetchHandler.fetch(this._state.context);
   }
-  // SyncQueue controls
   pauseSync() {
     this._syncQueue.pause();
   }
@@ -2643,40 +1953,36 @@ class R {
   retrySync(t) {
     t ? this._syncQueue.retry(t) : this._syncQueue.retryAll();
   }
-  // Cleanup everything and remove from global cache
   destroy() {
-    this._syncQueue.destroy(), this._fetchHandler.destroy(), this._subscribers.clear(), R._cache.delete(this.id);
+    this._syncQueue.destroy(), this._fetchHandler.destroy(), this._subscribers.clear(), O._cache.delete(this.id);
   }
-  // Private methods
   async _initialFetch() {
-    this._hasInitialized || (this._hasInitialized = !0, await this._fetchHandler.fetch(this._state.context));
+    if (!this._hasInitialized) {
+      if (this._hasInitialized = !0, this.config.serverItems) {
+        this._state = P(this._state, (t) => {
+          for (const n of this.config.serverItems)
+            t.items.set(n.id, n);
+        }), this._notifySubscribers();
+        return;
+      }
+      typeof window > "u" || await this._fetchHandler.fetch(this._state.context);
+    }
   }
   _onSyncQueueChange() {
-    const t = this._syncQueue.getState();
-    this._updateSyncState(t);
+    this._updateSyncState(this._syncQueue.getState());
   }
   _onFetchChange() {
     const t = this._fetchHandler.getState();
-    this._state = I(this._state, (n) => {
+    this._state = P(this._state, (n) => {
       n.fetchStatus = t.status, n.fetchError = t.error, n.loading = t.status === "fetching", n.syncState = this._computeSyncState(t.status, n.syncQueue.isSyncing);
-      const { queue: r, inFlight: i } = this._state.syncQueue, s = /* @__PURE__ */ new Map();
-      for (const o of t.items) {
-        const a = this.config.getId(o);
-        s.set(a, o);
-      }
-      for (const [o, a] of r) {
-        const c = fe(a);
-        c && (c.type === "create" || c.type === "update") && s.set(o, c.data);
-      }
-      for (const [o, a] of i) {
-        const c = fe(a);
-        c && (c.type === "create" || c.type === "update") && s.set(o, c.data);
-      }
+      const s = /* @__PURE__ */ new Map();
+      for (const i of t.items)
+        s.set(i.id, i);
       n.items = s;
     }), this._notifySubscribers();
   }
   _updateSyncState(t) {
-    this._state = I(this._state, (n) => {
+    this._state = P(this._state, (n) => {
       n.syncQueue = t, n.syncing = t.isSyncing, n.syncState = this._computeSyncState(n.fetchStatus, t.isSyncing);
     }), this._notifySubscribers();
   }
@@ -2688,194 +1994,166 @@ class R {
       for (const t of this._subscribers)
         t();
   }
-  _handleIdRemap(t) {
-    if (t.length === 0) return;
-    const { setId: n } = this.config;
-    this._state = I(this._state, (r) => {
-      for (const { tempId: i, newId: s } of t) {
-        const o = r.items.get(i);
-        if (o) {
-          let a;
-          n ? a = n(o, s) : (o.id = s, a = o), r.items.delete(i), r.items.set(s, a);
-        }
-      }
-    });
-    for (const { newId: r } of t) {
-      const i = this._state.items.get(r);
-      if (i) {
-        const s = i, o = this._itemCache.get(s);
-        o && o._updateId(r);
-      }
-    }
-    this._notifySubscribers();
-  }
 }
-function Da(e) {
-  const t = R.get(e), n = j(
-    (r) => t.subscribe(r),
+function Es(e) {
+  const t = O.get(e), n = le(() => _t(e), [e.id]), s = v(
+    (i) => t.subscribe(i),
     () => t.getState(),
-    () => t.getState()
+    () => n
   );
   return {
-    // State (all from single immutable state object)
-    items: n.items,
-    context: n.context,
-    syncState: n.syncState,
-    syncQueue: n.syncQueue,
-    loading: n.loading,
-    syncing: n.syncing,
-    fetchStatus: n.fetchStatus,
-    fetchError: n.fetchError,
+    // State
+    items: s.items,
+    context: s.context,
+    syncState: s.syncState,
+    syncQueue: s.syncQueue,
+    loading: s.loading,
+    syncing: s.syncing,
+    fetchStatus: s.fetchStatus,
+    fetchError: s.fetchError,
     // Item operations
-    create: (r) => t.create(r),
-    update: (r, i) => t.update(r, i),
-    remove: (r) => t.remove(r),
-    getItem: (r) => t.getItem(r),
-    getItemStatus: (r) => t.getItemStatus(r),
+    create: (i) => t.create({ ...i, id: be() }),
+    update: (i, r) => t.update(i, r),
+    remove: (i) => t.remove(i),
+    getItem: (i) => t.getItem(i),
+    getItemStatus: (i) => t.getItemStatus(i),
     // Context & refresh
-    setContext: (r) => t.setContext(r),
+    setContext: (i) => t.setContext(i),
     refresh: () => t.refresh(),
     // Sync controls
     pauseSync: () => t.pauseSync(),
     resumeSync: () => t.resumeSync(),
-    retrySync: (r) => t.retrySync(r)
+    retrySync: (i) => t.retrySync(i)
   };
 }
-function Ha(e) {
-  const t = R.get(e), n = j(
-    (a) => t.subscribe(a),
-    () => t.getState(),
-    () => t.getState()
-  ), r = j(
-    (a) => t.subscribe(a),
-    () => t.items.get(e.rootId) ? t.getNode(e.rootId) : null,
-    () => t.items.get(e.rootId) ? t.getNode(e.rootId) : null
-  ), i = j(
-    (a) => t.subscribe(a),
-    () => t.selectedNodeId,
-    () => t.selectedNodeId
-  ), s = j(
-    (a) => t.subscribe(a),
-    () => t.selectedNode,
-    () => t.selectedNode
-  ), o = T(() => {
-    const a = e.nodeSeparator ?? ".", c = (l, f) => l.startsWith(f + a) ? !l.slice(f.length + 1).includes(a) : !1, u = (l) => {
-      const f = n.items.get(l);
-      if (!f) return null;
-      const h = Y(
-        Ce([...n.items.entries()], ([b]) => c(b, l)),
-        ([b, w]) => ({ id: b, position: w.position })
-      ), p = Me(h, "position"), g = Y(p, (b) => u(b.id)).filter(Boolean);
+function Is(e) {
+  const t = e, n = O.get(t), s = le(() => _t(t), [e.id]), i = v(
+    (u) => n.subscribe(u),
+    () => n.getState(),
+    () => s
+  ), r = v(
+    (u) => n.subscribe(u),
+    () => n.items.get(e.rootId) ? n.getNode(e.rootId) : null,
+    () => null
+  ), o = v(
+    (u) => n.subscribe(u),
+    () => n.selectedNodeId,
+    () => null
+  ), c = v(
+    (u) => n.subscribe(u),
+    () => n.selectedNode,
+    () => null
+  ), a = S(() => {
+    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);
+      if (!p) return null;
+      const I = K(
+        se([...i.items.entries()], ([m]) => l(m, y)),
+        ([m, g]) => ({ id: m, position: g.position })
+      ), $ = re(I, "position"), M = K($, (m) => f(m.id)).filter(Boolean);
       return {
-        id: f.id,
-        type: f.type,
-        value: f.value,
-        ...g.length > 0 ? { children: g } : {}
+        id: p.id,
+        type: p.type,
+        value: p.value,
+        ...M.length > 0 ? { children: M } : {}
       };
     };
-    return u(e.rootId);
-  }, [n.items, e.rootId, e.nodeSeparator]);
+    return f(e.rootId);
+  }, [i.items, e.rootId, e.nodeSeparator]);
   return {
     // Root node for tree operations
     rootNode: r,
     // State (all from single immutable state object)
-    items: n.items,
-    context: n.context,
-    syncState: n.syncState,
-    syncQueue: n.syncQueue,
-    loading: n.loading,
-    syncing: n.syncing,
-    fetchStatus: n.fetchStatus,
-    fetchError: n.fetchError,
+    items: i.items,
+    context: i.context,
+    syncState: i.syncState,
+    syncQueue: i.syncQueue,
+    loading: i.loading,
+    syncing: i.syncing,
+    fetchStatus: i.fetchStatus,
+    fetchError: i.fetchError,
     // Node operations
-    getNode: (a) => t.getNode(a),
-    getNodeStatus: (a) => t.getItemStatus(a),
+    getNode: (u) => n.getNode(u),
+    getNodeStatus: (u) => n.getItemStatus(u),
     // Context & refresh
-    setContext: (a) => t.setContext(a),
-    refresh: () => t.refresh(),
+    setContext: (u) => n.setContext(u),
+    refresh: () => n.refresh(),
     // Sync controls
-    pauseSync: () => t.pauseSync(),
-    resumeSync: () => t.resumeSync(),
-    retrySync: (a) => t.retrySync(a),
+    pauseSync: () => n.pauseSync(),
+    resumeSync: () => n.resumeSync(),
+    retrySync: (u) => n.retrySync(u),
     // Selection
-    selectNode: (a) => t.selectNode(a),
-    deselectNode: () => t.deselectNode(),
-    selectedNodeId: i,
-    selectedNode: s,
+    selectNode: (u) => n.selectNode(u),
+    deselectNode: () => n.deselectNode(),
+    selectedNodeId: o,
+    selectedNode: c,
     // Serialization
-    toJson: o
+    toJson: a
   };
 }
-function La(e) {
-  const t = j(
+function Ns(e) {
+  const t = v(
     (o) => e.collection.subscribe(o),
     () => e.data,
     () => e.data
-  ), n = j(
+  ), n = v(
     (o) => e.collection.subscribe(o),
     () => e.getStatus(),
     () => e.getStatus()
-  ), r = j(
+  ), s = v(
     (o) => e.collection.subscribe(o),
     () => e.exists(),
     () => e.exists()
-  ), i = T((o) => e.update(o), [e]), s = T(() => e.remove(), [e]);
-  return { data: t, status: n, update: i, remove: s, exists: r };
-}
-function ja(e, t) {
-  if (!O(oe(e), oe(t))) return !0;
-  for (let n = 0; n < oe(e); n++)
-    if (!O(e[n].id, t[n].id)) return !0;
-  return !1;
+  ), i = S((o) => e.update(o), [e]), r = S(() => e.remove(), [e]);
+  return { data: t, status: n, update: i, remove: r, exists: s };
 }
-const $a = {
-  data: void 0,
-  status: null,
-  exists: !1,
-  isSelected: !1,
-  children: []
-};
-function Fa(e) {
-  const t = Nn($a), n = j(
-    (h) => e.collection.subscribe(h),
-    () => {
-      const h = e.getChildren(), p = t.current, g = ja(p.children, h) ? h : p.children, b = {
-        data: e.data,
-        status: e.getStatus(),
-        exists: e.exists(),
-        isSelected: O(e.collection.selectedNodeId, e.id),
-        children: g
-      };
-      return O(p, b) || (t.current = b), t.current;
-    },
-    () => t.current
-  ), r = T(() => e.getParent(), [e]), i = T((h, p) => e.append(h, p), [e]), s = T((h, p) => e.prepend(h, p), [e]), o = T(
-    (h, p) => e.move(h, p),
+function xs(e) {
+  const t = S((_) => e.collection.subscribe(_), [e]), n = v(
+    t,
+    () => e.data,
+    () => e.data
+  ), s = v(
+    t,
+    () => e.getStatus(),
+    () => e.getStatus()
+  ), i = v(
+    t,
+    () => e.exists(),
+    () => e.exists()
+  ), r = v(
+    t,
+    () => e.collection.selectedNodeId === e.id,
+    () => e.collection.selectedNodeId === e.id
+  ), o = le(() => e.getChildren(), [n, e]), c = S(() => e.getParent(), [e]), a = S((_, j) => e.append(_, j), [e]), u = S((_, j) => e.prepend(_, j), [e]), l = S(
+    (_, j) => e.move(_, j),
     [e]
-  ), a = T(() => e.clone(), [e]), c = T(
-    (h) => e.updateProp(h),
+  ), f = S(() => e.moveUp(), [e]), y = S(() => e.moveDown(), [e]), p = S((_) => e.setPosition(_), [e]), I = S(() => e.clone(), [e]), $ = S(
+    (_) => e.updateProp(_),
     [e]
-  ), u = T(() => e.remove(), [e]), l = T(() => e.select(), [e]), f = T(() => e.collection.deselectNode(), [e]);
+  ), M = S(() => e.remove(), [e]), m = S(() => e.select(), [e]), g = S(() => e.collection.deselectNode(), [e]);
   return {
     isPresent: !0,
-    data: n.data,
-    status: n.status,
-    exists: n.exists,
-    isSelected: n.isSelected,
+    data: n,
+    status: s,
+    exists: i,
+    isSelected: r,
     depth: e.depth,
-    getParent: r,
-    children: n.children,
-    append: i,
-    prepend: s,
-    move: o,
-    clone: a,
-    updateProp: c,
-    remove: u,
-    select: l,
-    deselect: f
+    getParent: c,
+    children: o,
+    append: a,
+    prepend: u,
+    move: l,
+    moveUp: f,
+    moveDown: y,
+    setPosition: p,
+    clone: I,
+    updateProp: $,
+    remove: M,
+    select: m,
+    deselect: g
   };
 }
-const za = {
+const Os = {
   isPresent: !1,
   data: void 0,
   status: null,
@@ -2888,6 +2166,12 @@ const za = {
   prepend: () => "",
   move: () => {
   },
+  moveUp: () => {
+  },
+  moveDown: () => {
+  },
+  setPosition: () => {
+  },
   clone: () => /* @__PURE__ */ new Map(),
   updateProp: () => {
   },
@@ -2898,27 +2182,27 @@ const za = {
   deselect: () => {
   }
 };
-function qa(e) {
-  const t = R.getById(e);
+function zs(e) {
+  const t = O.getById(e);
   if (!t)
     throw new Error(
       `Collection with id "${e}" not found. Make sure useCrud is called first.`
     );
-  const n = j(
-    (s) => t.subscribe(s),
+  const n = v(
+    (r) => t.subscribe(r),
     () => t.selectedNode,
     () => t.selectedNode
-  ), r = Dn(() => t.getNode("__dummy__"), [t]), i = Fa(n ?? r);
-  return n ? i : za;
+  ), s = le(() => t.getNode("__dummy__"), [t]), i = xs(n ?? s);
+  return n ? i : Os;
 }
-function Qa(e) {
-  const t = R.getById(e);
+function As(e) {
+  const t = O.getById(e);
   if (!t)
     throw new Error(
       `Collection with id "${e}" not found. Make sure useCrud is called first.`
     );
-  const n = j(
-    (r) => t.subscribe(r),
+  const n = v(
+    (s) => t.subscribe(s),
     () => t.getState(),
     () => t.getState()
   );
@@ -2933,24 +2217,22 @@ function Qa(e) {
   };
 }
 export {
-  Ea as Cache,
-  R as Collection,
-  Ta as FetchHandler,
-  Yt as Item,
-  kt as Node,
-  Pa as SyncQueue,
-  Ga as categorizeResults,
-  Wa as createSyncClient,
-  Va as createSyncClientFromEndpoint,
-  Ja as createSyncClientWithStats,
-  Ya as fetchToSyncResult,
-  Xa as syncError,
-  Za as syncSuccess,
-  Da as useCrud,
-  Ha as useCrudTree,
-  La as useItem,
-  Fa as useNode,
-  qa as useSelectedNode,
-  Qa as useSyncState
+  ws as Cache,
+  O as Collection,
+  vs as FetchHandler,
+  We as Item,
+  Le as Node,
+  Ss as SyncQueue,
+  _t as buildServerSnapshot,
+  Ds as compareTimeIds,
+  Qs as createSyncClient,
+  be as getIdFromTime,
+  Ts as getTimeFromId,
+  Es as useCrud,
+  Is as useCrudTree,
+  Ns as useItem,
+  xs as useNode,
+  zs as useSelectedNode,
+  As as useSyncState
 };
 //# sourceMappingURL=index.js.map