use-abcd 1.4.0 → 1.4.2

package/dist/index.js

@@ -1,18 +1,18 @@
-import { useSyncExternalStore as ue, useEffect as Xt, useCallback as Xe } from "react";
-import { c as io } from "./chunks/types-Dy4rYb2N.js";
-import { c as ao, b as co, a as uo, f as fo, d as lo, s as ho } from "./chunks/client-DReyDQ23.js";
-const g = {
+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-DReyDQ23.js";
+const v = {
   Remove: "remove",
   Replace: "replace",
   Add: "add"
-}, Ot = Symbol.for("__MUTATIVE_PROXY_DRAFT__"), Yt = Symbol("__MUTATIVE_RAW_RETURN_SYMBOL__"), fe = Symbol.iterator, M = {
+}, en = Symbol.for("__MUTATIVE_PROXY_DRAFT__"), Hn = Symbol("__MUTATIVE_RAW_RETURN_SYMBOL__"), ve = Symbol.iterator, E = {
   mutable: "mutable",
   immutable: "immutable"
-}, De = {};
-function te(e, t) {
+}, tt = {};
+function he(e, t) {
   return e instanceof Map ? e.has(t) : Object.prototype.hasOwnProperty.call(e, t);
 }
-function Ye(e, t) {
+function yt(e, t) {
   if (t in e) {
     let n = Reflect.getPrototypeOf(e);
     for (; n; ) {
@@ -23,89 +23,89 @@ function Ye(e, t) {
     }
   }
 }
-function He(e) {
+function nt(e) {
   return Object.getPrototypeOf(e) === Set.prototype;
 }
-function Ne(e) {
+function rt(e) {
   return Object.getPrototypeOf(e) === Map.prototype;
 }
-function A(e) {
+function x(e) {
   var t;
   return (t = e.copy) !== null && t !== void 0 ? t : e.original;
 }
-function Q(e) {
-  return !!h(e);
+function K(e) {
+  return !!d(e);
 }
-function h(e) {
-  return typeof e != "object" ? null : e?.[Ot];
+function d(e) {
+  return typeof e != "object" ? null : e?.[en];
 }
-function Le(e) {
+function it(e) {
   var t;
-  const n = h(e);
+  const n = d(e);
   return n ? (t = n.copy) !== null && t !== void 0 ? t : n.original : e;
 }
-function T(e, t) {
+function $(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, M)) === M.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, E)) === E.immutable || typeof n == "function");
 }
-function Ct(e, t = []) {
+function tn(e, t = []) {
   if (Object.hasOwnProperty.call(e, "key")) {
-    const n = e.parent.copy, r = h(F(n, e.key));
+    const n = e.parent.copy, r = d(q(n, e.key));
     if (r !== null && r?.original !== e.original)
       return null;
-    const s = e.parent.type === 3, i = s ? Array.from(e.parent.setMap.keys()).indexOf(e.key) : e.key;
-    if (!(s && n.size > i || te(n, i)))
+    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)))
       return null;
-    t.push(i);
+    t.push(s);
   }
   if (e.parent)
-    return Ct(e.parent, t);
+    return tn(e.parent, t);
   t.reverse();
   try {
-    Vt(e.copy, t);
+    Ln(e.copy, t);
   } catch {
     return null;
   }
   return t;
 }
-function K(e) {
+function ee(e) {
   return Array.isArray(e) ? 1 : e instanceof Map ? 2 : e instanceof Set ? 3 : 0;
 }
-function F(e, t) {
-  return K(e) === 2 ? e.get(t) : e[t];
+function q(e, t) {
+  return ee(e) === 2 ? e.get(t) : e[t];
 }
-function ae(e, t, n) {
-  K(e) === 2 ? e.set(t, n) : e[t] = n;
+function be(e, t, n) {
+  ee(e) === 2 ? e.set(t, n) : e[t] = n;
 }
-function Oe(e, t) {
-  const n = h(e);
-  return (n ? A(n) : e)[t];
+function Ne(e, t) {
+  const n = d(e);
+  return (n ? x(n) : e)[t];
 }
-function j(e, t) {
+function H(e, t) {
   return e === t ? e !== 0 || 1 / e === 1 / t : e !== e && t !== t;
 }
-function Ee(e) {
+function Be(e) {
   if (e)
     for (; e.finalities.revoke.length > 0; )
       e.finalities.revoke.pop()();
 }
-function U(e, t) {
+function J(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");
   }).join("/");
 }
-function Vt(e, t) {
+function Ln(e, t) {
   for (let n = 0; n < t.length - 1; n += 1) {
     const r = t[n];
-    if (e = F(K(e) === 3 ? Array.from(e) : e, r), typeof e != "object")
+    if (e = q(ee(e) === 3 ? Array.from(e) : e, r), typeof e != "object")
       throw new Error(`Cannot resolve patch at '${t.join("/")}'.`);
   }
   return e;
 }
-function Zt(e) {
+function qn(e) {
   const t = Object.create(Object.getPrototypeOf(e));
   return Reflect.ownKeys(e).forEach((n) => {
     let r = Reflect.getOwnPropertyDescriptor(e, n);
@@ -121,26 +121,26 @@ function Zt(e) {
     }), Reflect.defineProperty(t, n, r);
   }), t;
 }
-const Jt = Object.prototype.propertyIsEnumerable;
-function At(e, t) {
+const Qn = Object.prototype.propertyIsEnumerable;
+function nn(e, t) {
   let n;
   if (Array.isArray(e))
     return Array.prototype.concat.call(e);
   if (e instanceof Set) {
-    if (!He(e)) {
+    if (!nt(e)) {
       const r = Object.getPrototypeOf(e).constructor;
       return new r(e.values());
     }
     return Set.prototype.difference ? Set.prototype.difference.call(e, /* @__PURE__ */ new Set()) : new Set(e.values());
   } else if (e instanceof Map) {
-    if (!Ne(e)) {
+    if (!rt(e)) {
       const r = Object.getPrototypeOf(e).constructor;
       return new r(e);
     }
     return new Map(e);
-  } else if (t?.mark && (n = t.mark(e, M), n !== void 0) && n !== M.mutable) {
-    if (n === M.immutable)
-      return Zt(e);
+  } else if (t?.mark && (n = t.mark(e, E), n !== void 0) && n !== E.mutable) {
+    if (n === E.immutable)
+      return qn(e);
     if (typeof n == "function") {
       if (t.enablePatches || t.enableAutoFreeze)
         throw new Error("You can't use mark and patches or auto freeze together.");
@@ -149,36 +149,36 @@ function At(e, t) {
     throw new Error(`Unsupported mark result: ${n}`);
   } else if (typeof e == "object" && Object.getPrototypeOf(e) === Object.prototype) {
     const r = {};
-    return Object.keys(e).forEach((s) => {
-      r[s] = e[s];
-    }), Object.getOwnPropertySymbols(e).forEach((s) => {
-      Jt.call(e, s) && (r[s] = e[s]);
+    return Object.keys(e).forEach((i) => {
+      r[i] = e[i];
+    }), Object.getOwnPropertySymbols(e).forEach((i) => {
+      Qn.call(e, i) && (r[i] = e[i]);
     }), r;
   } else
     throw new Error("Please check mark() to ensure that it is a stable marker draftable function.");
 }
-function S(e) {
-  e.copy || (e.copy = At(e.original, e.options));
+function A(e) {
+  e.copy || (e.copy = nn(e.original, e.options));
 }
-function ee(e) {
-  if (!T(e))
-    return Le(e);
+function le(e) {
+  if (!$(e))
+    return it(e);
   if (Array.isArray(e))
-    return e.map(ee);
+    return e.map(le);
   if (e instanceof Map) {
-    const n = Array.from(e.entries()).map(([r, s]) => [
+    const n = Array.from(e.entries()).map(([r, i]) => [
       r,
-      ee(s)
+      le(i)
     ]);
-    if (!Ne(e)) {
+    if (!rt(e)) {
       const r = Object.getPrototypeOf(e).constructor;
       return new r(n);
     }
     return new Map(n);
   }
   if (e instanceof Set) {
-    const n = Array.from(e).map(ee);
-    if (!He(e)) {
+    const n = Array.from(e).map(le);
+    if (!nt(e)) {
       const r = Object.getPrototypeOf(e).constructor;
       return new r(n);
     }
@@ -186,196 +186,196 @@ function ee(e) {
   }
   const t = Object.create(Object.getPrototypeOf(e));
   for (const n in e)
-    t[n] = ee(e[n]);
+    t[n] = le(e[n]);
   return t;
 }
-function le(e) {
-  return Q(e) ? ee(e) : e;
+function we(e) {
+  return K(e) ? le(e) : e;
 }
-function x(e) {
+function z(e) {
   var t;
-  e.assignedMap = (t = e.assignedMap) !== null && t !== void 0 ? t : /* @__PURE__ */ new Map(), e.operated || (e.operated = !0, e.parent && x(e.parent));
+  e.assignedMap = (t = e.assignedMap) !== null && t !== void 0 ? t : /* @__PURE__ */ new Map(), e.operated || (e.operated = !0, e.parent && z(e.parent));
 }
-function Ve() {
+function gt() {
   throw new Error("Cannot modify frozen object");
 }
-function X(e, t, n, r, s) {
+function se(e, t, n, r, i) {
   {
-    n = n ?? /* @__PURE__ */ new WeakMap(), r = r ?? [], s = s ?? [];
+    n = n ?? /* @__PURE__ */ new WeakMap(), r = r ?? [], 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: ~/${s.slice(0, a).map((c, u) => {
+        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 f = r[u];
-          return typeof c == "object" && (f instanceof Map || f instanceof Set) ? Array.from(f.keys()).indexOf(c) : c;
+          const l = r[u];
+          return typeof c == "object" && (l instanceof Map || l instanceof Set) ? Array.from(l.keys()).indexOf(c) : c;
         }).join("/")}`);
-      r.push(o), s.push(t);
+      r.push(o), i.push(t);
     } else
       r.push(o);
   }
-  if (Object.isFrozen(e) || Q(e)) {
-    r.pop(), s.pop();
+  if (Object.isFrozen(e) || K(e)) {
+    r.pop(), i.pop();
     return;
   }
-  switch (K(e)) {
+  switch (ee(e)) {
     case 2:
       for (const [a, c] of e)
-        X(a, a, n, r, s), X(c, a, n, r, s);
-      e.set = e.clear = e.delete = Ve;
+        se(a, a, n, r, i), se(c, a, n, r, i);
+      e.set = e.clear = e.delete = gt;
       break;
     case 3:
       for (const a of e)
-        X(a, a, n, r, s);
-      e.add = e.clear = e.delete = Ve;
+        se(a, a, n, r, i);
+      e.add = e.clear = e.delete = gt;
       break;
     case 1:
       Object.freeze(e);
       let o = 0;
       for (const a of e)
-        X(a, o, n, r, s), o += 1;
+        se(a, o, n, r, i), o += 1;
       break;
     default:
       Object.freeze(e), Object.keys(e).forEach((a) => {
         const c = e[a];
-        X(c, a, n, r, s);
+        se(c, a, n, r, i);
       });
   }
-  r.pop(), s.pop();
+  r.pop(), i.pop();
 }
-function qe(e, t) {
-  const n = K(e);
+function st(e, t) {
+  const n = ee(e);
   if (n === 0)
     Reflect.ownKeys(e).forEach((r) => {
       t(r, e[r], e);
     });
   else if (n === 1) {
     let r = 0;
-    for (const s of e)
-      t(r, s, e), r += 1;
+    for (const i of e)
+      t(r, i, e), r += 1;
   } else
-    e.forEach((r, s) => t(s, r, e));
+    e.forEach((r, i) => t(i, r, e));
 }
-function Mt(e, t, n) {
-  if (Q(e) || !T(e, n) || t.has(e) || Object.isFrozen(e))
+function rn(e, t, n) {
+  if (K(e) || !$(e, n) || t.has(e) || Object.isFrozen(e))
     return;
-  const r = e instanceof Set, s = r ? /* @__PURE__ */ new Map() : void 0;
-  if (t.add(e), qe(e, (i, o) => {
+  const r = e instanceof Set, i = r ? /* @__PURE__ */ new Map() : void 0;
+  if (t.add(e), st(e, (s, o) => {
     var a;
-    if (Q(o)) {
-      const c = h(o);
-      S(c);
+    if (K(o)) {
+      const c = d(o);
+      A(c);
       const u = !((a = c.assignedMap) === null || a === void 0) && a.size || c.operated ? c.copy : c.original;
-      ae(r ? s : e, i, u);
+      be(r ? i : e, s, u);
     } else
-      Mt(o, t, n);
-  }), s) {
-    const i = e, o = Array.from(i);
-    i.clear(), o.forEach((a) => {
-      i.add(s.has(a) ? s.get(a) : a);
+      rn(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);
     });
   }
 }
-function kt(e, t) {
+function Bn(e, t) {
   const n = e.type === 3 ? e.setMap : e.copy;
-  e.finalities.revoke.length > 1 && e.assignedMap.get(t) && n && Mt(F(n, t), e.finalities.handledSet, e.options);
+  e.finalities.revoke.length > 1 && e.assignedMap.get(t) && n && rn(q(n, t), e.finalities.handledSet, e.options);
 }
-function Pe(e) {
+function Ue(e) {
   e.type === 3 && e.copy && (e.copy.clear(), e.setMap.forEach((t) => {
-    e.copy.add(Le(t));
+    e.copy.add(it(t));
   }));
 }
-function Te(e, t, n, r) {
+function Ge(e, t, n, r) {
   if (e.operated && e.assignedMap && e.assignedMap.size > 0 && !e.finalized) {
     if (n && r) {
-      const i = Ct(e);
-      i && t(e, i, n, r);
+      const s = tn(e);
+      s && t(e, s, n, r);
     }
     e.finalized = !0;
   }
 }
-function Qe(e, t, n, r) {
-  const s = h(n);
-  s && (s.callbacks || (s.callbacks = []), s.callbacks.push((i, o) => {
+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 (j(F(c, t), n)) {
-      let u = s.original;
-      s.copy && (u = s.copy), Pe(e), Te(e, r, i, o), e.options.enableAutoFreeze && (e.options.updatedValues = (a = e.options.updatedValues) !== null && a !== void 0 ? a : /* @__PURE__ */ new WeakMap(), e.options.updatedValues.set(u, s.original)), ae(c, t, u);
+    if (H(q(c, 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);
     }
-  }), e.options.enableAutoFreeze && s.finalities !== e.finalities && (e.options.enableAutoFreeze = !1)), T(n, e.options) && e.finalities.draft.push(() => {
-    const i = e.type === 3 ? e.setMap : e.copy;
-    j(F(i, t), n) && kt(e, t);
+  }), 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);
   });
 }
-function en(e, t, n, r, s) {
-  let { original: i, assignedMap: o, options: a } = e, c = e.copy;
-  c.length < i.length && ([i, c] = [c, i], [n, r] = [r, n]);
-  for (let u = 0; u < i.length; u += 1)
-    if (o.get(u.toString()) && c[u] !== i[u]) {
-      const f = t.concat([u]), l = U(f, s);
+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);
       n.push({
-        op: g.Replace,
-        path: l,
+        op: v.Replace,
+        path: f,
         // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
-        value: le(c[u])
+        value: we(c[u])
       }), r.push({
-        op: g.Replace,
-        path: l,
+        op: v.Replace,
+        path: f,
         // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
-        value: le(i[u])
+        value: we(s[u])
       });
     }
-  for (let u = i.length; u < c.length; u += 1) {
-    const f = t.concat([u]), l = U(f, s);
+  for (let u = s.length; u < c.length; u += 1) {
+    const l = t.concat([u]), f = J(l, i);
     n.push({
-      op: g.Add,
-      path: l,
+      op: v.Add,
+      path: f,
       // If it is a draft, it needs to be deep cloned, and it may also be non-draft.
-      value: le(c[u])
+      value: we(c[u])
     });
   }
-  if (i.length < c.length) {
+  if (s.length < c.length) {
     const { arrayLengthAssignment: u = !0 } = a.enablePatches;
     if (u) {
-      const f = t.concat(["length"]), l = U(f, s);
+      const l = t.concat(["length"]), f = J(l, i);
       r.push({
-        op: g.Replace,
-        path: l,
-        value: i.length
+        op: v.Replace,
+        path: f,
+        value: s.length
       });
     } else
-      for (let f = c.length; i.length < f; f -= 1) {
-        const l = t.concat([f - 1]), d = U(l, s);
+      for (let l = c.length; s.length < l; l -= 1) {
+        const f = t.concat([l - 1]), h = J(f, i);
         r.push({
-          op: g.Remove,
-          path: d
+          op: v.Remove,
+          path: h
         });
       }
   }
 }
-function tn({ original: e, copy: t, assignedMap: n }, r, s, i, o) {
+function Gn({ original: e, copy: t, assignedMap: n }, r, i, s, o) {
   n.forEach((a, c) => {
-    const u = F(e, c), f = le(F(t, c)), l = a ? te(e, c) ? g.Replace : g.Add : g.Remove;
-    if (j(u, f) && l === g.Replace)
+    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)
       return;
-    const d = r.concat(c), y = U(d, o);
-    s.push(l === g.Remove ? { op: l, path: y } : { op: l, path: y, value: f }), i.push(l === g.Add ? { op: g.Remove, path: y } : l === g.Remove ? { op: g.Add, path: y, value: u } : { op: g.Replace, path: y, value: u });
+    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 });
   });
 }
-function nn({ original: e, copy: t }, n, r, s, i) {
+function Kn({ original: e, copy: t }, n, r, i, s) {
   let o = 0;
   e.forEach((a) => {
     if (!t.has(a)) {
-      const c = n.concat([o]), u = U(c, i);
+      const c = n.concat([o]), u = J(c, s);
       r.push({
-        op: g.Remove,
+        op: v.Remove,
         path: u,
         value: a
-      }), s.unshift({
-        op: g.Add,
+      }), i.unshift({
+        op: v.Add,
         path: u,
         value: a
       });
@@ -383,13 +383,13 @@ function nn({ original: e, copy: t }, n, r, s, i) {
     o += 1;
   }), o = 0, t.forEach((a) => {
     if (!e.has(a)) {
-      const c = n.concat([o]), u = U(c, i);
+      const c = n.concat([o]), u = J(c, s);
       r.push({
-        op: g.Add,
+        op: v.Add,
         path: u,
         value: a
-      }), s.unshift({
-        op: g.Remove,
+      }), i.unshift({
+        op: v.Remove,
         path: u,
         value: a
       });
@@ -397,74 +397,74 @@ function nn({ original: e, copy: t }, n, r, s, i) {
     o += 1;
   });
 }
-function re(e, t, n, r) {
-  const { pathAsArray: s = !0 } = e.options.enablePatches;
+function _e(e, t, n, r) {
+  const { pathAsArray: i = !0 } = e.options.enablePatches;
   switch (e.type) {
     case 0:
     case 2:
-      return tn(e, t, n, r, s);
+      return Gn(e, t, n, r, i);
     case 1:
-      return en(e, t, n, r, s);
+      return Un(e, t, n, r, i);
     case 3:
-      return nn(e, t, n, r, s);
+      return Kn(e, t, n, r, i);
   }
 }
-const he = (e, t, n = !1) => {
-  if (typeof e == "object" && e !== null && (!T(e, t) || n))
+const Ae = (e, t, n = !1) => {
+  if (typeof e == "object" && e !== null && (!$(e, t) || n))
     throw new Error("Strict mode: Mutable data cannot be accessed directly, please use 'unsafe(callback)' wrap.");
-}, xe = {
+}, Ke = {
   get size() {
-    return A(h(this)).size;
+    return x(d(this)).size;
   },
   has(e) {
-    return A(h(this)).has(e);
+    return x(d(this)).has(e);
   },
   set(e, t) {
-    const n = h(this), r = A(n);
-    return (!r.has(e) || !j(r.get(e), t)) && (S(n), x(n), n.assignedMap.set(e, !0), n.copy.set(e, t), Qe(n, e, t, re)), this;
+    const n = d(this), r = x(n);
+    return (!r.has(e) || !H(r.get(e), t)) && (A(n), z(n), n.assignedMap.set(e, !0), n.copy.set(e, t), ot(n, e, t, _e)), this;
   },
   delete(e) {
     if (!this.has(e))
       return !1;
-    const t = h(this);
-    return S(t), x(t), t.original.has(e) ? t.assignedMap.set(e, !1) : t.assignedMap.delete(e), t.copy.delete(e), !0;
+    const t = d(this);
+    return A(t), z(t), t.original.has(e) ? t.assignedMap.set(e, !1) : t.assignedMap.delete(e), t.copy.delete(e), !0;
   },
   clear() {
-    const e = h(this);
+    const e = d(this);
     if (this.size) {
-      S(e), x(e), e.assignedMap = /* @__PURE__ */ new Map();
+      A(e), z(e), e.assignedMap = /* @__PURE__ */ new Map();
       for (const [t] of e.original)
         e.assignedMap.set(t, !1);
       e.copy.clear();
     }
   },
   forEach(e, t) {
-    const n = h(this);
-    A(n).forEach((r, s) => {
-      e.call(t, this.get(s), s, this);
+    const n = d(this);
+    x(n).forEach((r, i) => {
+      e.call(t, this.get(i), i, this);
     });
   },
   get(e) {
     var t, n;
-    const r = h(this), s = A(r).get(e), i = ((n = (t = r.options).mark) === null || n === void 0 ? void 0 : n.call(t, s, M)) === M.mutable;
-    if (r.options.strict && he(s, r.options, i), i || r.finalized || !T(s, r.options) || s !== r.original.get(e))
-      return s;
-    const o = De.createDraft({
-      original: s,
+    const r = d(this), i = x(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 && Ae(i, r.options, s), s || r.finalized || !$(i, r.options) || i !== r.original.get(e))
+      return i;
+    const o = tt.createDraft({
+      original: i,
       parentDraft: r,
       key: e,
       finalities: r.finalities,
       options: r.options
     });
-    return S(r), r.copy.set(e, o), o;
+    return A(r), r.copy.set(e, o), o;
   },
   keys() {
-    return A(h(this)).keys();
+    return x(d(this)).keys();
   },
   values() {
     const e = this.keys();
     return {
-      [fe]: () => this.values(),
+      [ve]: () => this.values(),
       next: () => {
         const t = e.next();
         return t.done ? t : {
@@ -477,7 +477,7 @@ const he = (e, t, n = !1) => {
   entries() {
     const e = this.keys();
     return {
-      [fe]: () => this.entries(),
+      [ve]: () => this.entries(),
       next: () => {
         const t = e.next();
         if (t.done)
@@ -490,80 +490,80 @@ const he = (e, t, n = !1) => {
       }
     };
   },
-  [fe]() {
+  [ve]() {
     return this.entries();
   }
-}, rn = Reflect.ownKeys(xe), Ze = (e, t, { isValuesIterator: n }) => () => {
-  var r, s;
-  const i = t.next();
-  if (i.done)
-    return i;
-  const o = i.value;
+}, 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 = h(a), u = ((s = (r = e.options).mark) === null || s === void 0 ? void 0 : s.call(r, a, M)) === M.mutable;
-  if (e.options.strict && he(o, e.options, u), !u && !c && T(o, e.options) && !e.finalized && e.original.has(o)) {
-    const f = De.createDraft({
+  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 && Ae(o, e.options, u), !u && !c && $(o, e.options) && !e.finalized && e.original.has(o)) {
+    const l = tt.createDraft({
       original: o,
       parentDraft: e,
       key: o,
       finalities: e.finalities,
       options: e.options
     });
-    e.setMap.set(o, f), a = f;
+    e.setMap.set(o, l), a = l;
   } else c && (a = c.proxy);
   return {
     done: !1,
     value: n ? a : [a, a]
   };
-}, pe = {
+}, Pe = {
   get size() {
-    return h(this).setMap.size;
+    return d(this).setMap.size;
   },
   has(e) {
-    const t = h(this);
+    const t = d(this);
     if (t.setMap.has(e))
       return !0;
-    S(t);
-    const n = h(e);
+    A(t);
+    const n = d(e);
     return !!(n && t.setMap.has(n.original));
   },
   add(e) {
-    const t = h(this);
-    return this.has(e) || (S(t), x(t), t.assignedMap.set(e, !0), t.setMap.set(e, e), Qe(t, e, e, re)), this;
+    const t = d(this);
+    return this.has(e) || (A(t), z(t), t.assignedMap.set(e, !0), t.setMap.set(e, e), ot(t, e, e, _e)), this;
   },
   delete(e) {
     if (!this.has(e))
       return !1;
-    const t = h(this);
-    S(t), x(t);
-    const n = h(e);
+    const t = d(this);
+    A(t), z(t);
+    const n = d(e);
     return n && t.setMap.has(n.original) ? (t.assignedMap.set(n.original, !1), t.setMap.delete(n.original)) : (!n && t.setMap.has(e) ? t.assignedMap.set(e, !1) : t.assignedMap.delete(e), t.setMap.delete(e));
   },
   clear() {
     if (!this.size)
       return;
-    const e = h(this);
-    S(e), x(e);
+    const e = d(this);
+    A(e), z(e);
     for (const t of e.original)
       e.assignedMap.set(t, !1);
     e.setMap.clear();
   },
   values() {
-    const e = h(this);
-    S(e);
+    const e = d(this);
+    A(e);
     const t = e.setMap.keys();
     return {
       [Symbol.iterator]: () => this.values(),
-      next: Ze(e, t, { isValuesIterator: !0 })
+      next: bt(e, t, { isValuesIterator: !0 })
     };
   },
   entries() {
-    const e = h(this);
-    S(e);
+    const e = d(this);
+    A(e);
     const t = e.setMap.keys();
     return {
       [Symbol.iterator]: () => this.entries(),
-      next: Ze(e, t, {
+      next: bt(e, t, {
         isValuesIterator: !1
       })
     };
@@ -571,7 +571,7 @@ const he = (e, t, n = !1) => {
   keys() {
     return this.values();
   },
-  [fe]() {
+  [ve]() {
     return this.values();
   },
   forEach(e, t) {
@@ -581,7 +581,7 @@ const he = (e, t, n = !1) => {
       e.call(t, r.value, r.value, this), r = n.next();
   }
 };
-Set.prototype.difference && Object.assign(pe, {
+Set.prototype.difference && Object.assign(Pe, {
   intersection(e) {
     return Set.prototype.intersection.call(new Set(this.values()), e);
   },
@@ -604,71 +604,71 @@ Set.prototype.difference && Object.assign(pe, {
     return Set.prototype.isDisjointFrom.call(new Set(this.values()), e);
   }
 });
-const sn = Reflect.ownKeys(pe), Et = {
+const Vn = Reflect.ownKeys(Pe), sn = {
   get(e, t, n) {
-    var r, s;
-    const i = (r = e.copy) === null || r === void 0 ? void 0 : r[t];
-    if (i && e.finalities.draftsCache.has(i))
-      return i;
-    if (t === Ot)
+    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)
       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, M), o === M.mutable)
-        return e.options.strict && he(u, e.options, !0), u;
+      if (o = e.options.mark(u, E), o === E.mutable)
+        return e.options.strict && Ae(u, e.options, !0), u;
     }
-    const a = A(e);
-    if (a instanceof Map && rn.includes(t))
-      return t === "size" ? Object.getOwnPropertyDescriptor(xe, "size").get.call(e.proxy) : xe[t].bind(e.proxy);
-    if (a instanceof Set && sn.includes(t))
-      return t === "size" ? Object.getOwnPropertyDescriptor(pe, "size").get.call(e.proxy) : pe[t].bind(e.proxy);
-    if (!te(a, t)) {
-      const u = Ye(a, t);
+    const a = x(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(Pe, "size").get.call(e.proxy) : Pe[t].bind(e.proxy);
+    if (!he(a, t)) {
+      const u = yt(a, t);
       return u ? "value" in u ? u.value : (
         // !case: support for getter
-        (s = u.get) === null || s === void 0 ? void 0 : s.call(e.proxy)
+        (i = u.get) === null || i === void 0 ? void 0 : i.call(e.proxy)
       ) : void 0;
     }
     const c = a[t];
-    if (e.options.strict && he(c, e.options), e.finalized || !T(c, e.options))
+    if (e.options.strict && Ae(c, e.options), e.finalized || !$(c, e.options))
       return c;
-    if (c === Oe(e.original, t)) {
-      if (S(e), e.copy[t] = Ge({
+    if (c === Ne(e.original, t)) {
+      if (A(e), e.copy[t] = at({
         original: e.original[t],
         parentDraft: e,
         key: e.type === 1 ? Number(t) : t,
         finalities: e.finalities,
         options: e.options
       }), typeof o == "function") {
-        const u = h(e.copy[t]);
-        return S(u), x(u), u.copy;
+        const u = d(e.copy[t]);
+        return A(u), z(u), u.copy;
       }
       return e.copy[t];
     }
-    return Q(c) && e.finalities.draftsCache.add(c), c;
+    return K(c) && e.finalities.draftsCache.add(c), c;
   },
   set(e, t, n) {
     var r;
     if (e.type === 3 || e.type === 2)
       throw new Error("Map/Set draft does not support any property assignment.");
-    let s;
-    if (e.type === 1 && t !== "length" && !(Number.isInteger(s = Number(t)) && s >= 0 && (t === 0 || s === 0 || String(s) === String(t))))
+    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 i = Ye(A(e), t);
-    if (i?.set)
-      return i.set.call(e.proxy, n), !0;
-    const o = Oe(A(e), t), a = h(o);
-    return a && j(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) : (j(n, o) && (n !== void 0 || te(e.original, t)) || (S(e), x(e), te(e.original, t) && j(n, e.original[t]) ? e.assignedMap.delete(t) : e.assignedMap.set(t, !0), e.copy[t] = n, Qe(e, t, n, re)), !0);
+    const s = yt(x(e), t);
+    if (s?.set)
+      return s.set.call(e.proxy, n), !0;
+    const o = Ne(x(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)) || (A(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);
   },
   has(e, t) {
-    return t in A(e);
+    return t in x(e);
   },
   ownKeys(e) {
-    return Reflect.ownKeys(A(e));
+    return Reflect.ownKeys(x(e));
   },
   getOwnPropertyDescriptor(e, t) {
-    const n = A(e), r = Reflect.getOwnPropertyDescriptor(n, t);
+    const n = x(e), r = Reflect.getOwnPropertyDescriptor(n, t);
     return r && {
       writable: !0,
       configurable: e.type !== 1 || t !== "length",
@@ -687,62 +687,62 @@ const sn = Reflect.ownKeys(pe), Et = {
   },
   deleteProperty(e, t) {
     var n;
-    return e.type === 1 ? Et.set.call(this, e, t, void 0, e.proxy) : (Oe(e.original, t) !== void 0 || t in e.original ? (S(e), x(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 ? sn.set.call(this, e, t, void 0, e.proxy) : (Ne(e.original, t) !== void 0 || t in e.original ? (A(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);
   }
 };
-function Ge(e) {
-  const { original: t, parentDraft: n, key: r, finalities: s, options: i } = e, o = K(t), a = {
+function at(e) {
+  const { original: t, parentDraft: n, key: r, finalities: i, options: s } = e, o = ee(t), a = {
     type: o,
     finalized: !1,
     parent: n,
     original: t,
     copy: null,
     proxy: null,
-    finalities: s,
-    options: i,
+    finalities: i,
+    options: s,
     // 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, Et);
-  if (s.revoke.push(u), a.proxy = c, n) {
-    const f = n;
-    f.finalities.draft.push((l, d) => {
-      var y, m;
-      const O = h(c);
-      let v = f.type === 3 ? f.setMap : f.copy;
-      const w = F(v, r), b = h(w);
-      if (b) {
-        let C = b.original;
-        b.operated && (C = Le(w)), Pe(b), Te(b, re, l, d), f.options.enableAutoFreeze && (f.options.updatedValues = (y = f.options.updatedValues) !== null && y !== void 0 ? y : /* @__PURE__ */ new WeakMap(), f.options.updatedValues.set(C, b.original)), ae(v, r, C);
+  const { proxy: c, revoke: u } = Proxy.revocable(o === 1 ? Object.assign([], a) : a, sn);
+  if (i.revoke.push(u), a.proxy = c, 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 P = S.original;
+        S.operated && (P = 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(P, S.original)), be(w, r, P);
       }
-      (m = O.callbacks) === null || m === void 0 || m.forEach((C) => {
-        C(l, d);
+      (g = b.callbacks) === null || g === void 0 || g.forEach((P) => {
+        P(f, h);
       });
     });
   } else {
-    const f = h(c);
-    f.finalities.draft.push((l, d) => {
-      Pe(f), Te(f, re, l, d);
+    const l = d(c);
+    l.finalities.draft.push((f, h) => {
+      Ue(l), Ge(l, _e, f, h);
     });
   }
   return c;
 }
-De.createDraft = Ge;
-function on(e, t, n, r, s) {
-  var i;
-  const o = h(e), a = (i = o?.original) !== null && i !== void 0 ? i : e, c = !!t.length;
+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;
   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 && Ee(o), s && X(u, u, o?.options.updatedValues), [
+  return o && Be(o), i && se(u, u, o?.options.updatedValues), [
     u,
-    n && c ? [{ op: g.Replace, path: [], value: t[0] }] : n,
-    r && c ? [{ op: g.Replace, path: [], value: a }] : r
+    n && c ? [{ op: v.Replace, path: [], value: t[0] }] : n,
+    r && c ? [{ op: v.Replace, path: [], value: a }] : r
   ];
 }
-function an(e, t) {
+function Yn(e, t) {
   var n;
   const r = {
     draft: [],
@@ -750,9 +750,9 @@ function an(e, t) {
     handledSet: /* @__PURE__ */ new WeakSet(),
     draftsCache: /* @__PURE__ */ new WeakSet()
   };
-  let s, i;
-  t.enablePatches && (s = [], i = []);
-  const a = ((n = t.mark) === null || n === void 0 ? void 0 : n.call(t, e, M)) === M.mutable || !T(e, t) ? e : Ge({
+  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({
     original: e,
     parentDraft: null,
     finalities: r,
@@ -761,242 +761,242 @@ function an(e, t) {
   return [
     a,
     (c = []) => {
-      const [u, f, l] = on(a, c, s, i, t.enableAutoFreeze);
-      return t.enablePatches ? [u, f, l] : u;
+      const [u, l, f] = Jn(a, c, i, s, t.enableAutoFreeze);
+      return t.enablePatches ? [u, l, f] : u;
     }
   ];
 }
-function Ie(e) {
-  const { rootDraft: t, value: n, useRawReturn: r = !1, isRoot: s = !0 } = e;
-  qe(n, (i, o, a) => {
-    const c = h(o);
+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) {
       e.isContainDraft = !0;
       const u = c.original;
       if (a instanceof Set) {
-        const f = Array.from(a);
-        a.clear(), f.forEach((l) => a.add(i === l ? u : l));
+        const l = Array.from(a);
+        a.clear(), l.forEach((f) => a.add(s === f ? u : f));
       } else
-        ae(a, i, u);
-    } else typeof o == "object" && o !== null && (e.value = o, e.isRoot = !1, Ie(e));
-  }), s && (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."));
+        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."));
 }
-function Pt(e) {
+function on(e) {
   var t;
-  const n = h(e);
-  if (!T(e, n?.options))
+  const n = d(e);
+  if (!$(e, n?.options))
     return e;
-  const r = K(e);
+  const r = ee(e);
   if (n && !n.operated)
     return n.original;
-  let s;
-  function i() {
-    s = r === 2 ? Ne(e) ? new Map(e) : new (Object.getPrototypeOf(e)).constructor(e) : r === 3 ? Array.from(n.setMap.values()) : At(e, n?.options);
+  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);
   }
   if (n) {
     n.finalized = !0;
     try {
-      i();
+      s();
     } finally {
       n.finalized = !1;
     }
   } else
-    s = e;
-  if (qe(s, (o, a) => {
-    if (n && j(F(n.original, o), a))
+    i = e;
+  if (st(i, (o, a) => {
+    if (n && H(q(n.original, o), a))
       return;
-    const c = Pt(a);
-    c !== a && (s === e && i(), ae(s, o, c));
+    const c = on(a);
+    c !== a && (i === e && s(), be(i, o, c));
   }), r === 3) {
-    const o = (t = n?.original) !== null && t !== void 0 ? t : s;
-    return He(o) ? new Set(s) : new (Object.getPrototypeOf(o)).constructor(s);
+    const o = (t = n?.original) !== null && t !== void 0 ? t : i;
+    return nt(o) ? new Set(i) : new (Object.getPrototypeOf(o)).constructor(i);
   }
-  return s;
+  return i;
 }
-function Je(e) {
-  if (!Q(e))
+function mt(e) {
+  if (!K(e))
     throw new Error(`current() is only used for Draft, parameter: ${e}`);
-  return Pt(e);
+  return on(e);
 }
-const cn = (e) => function t(n, r, s) {
-  var i, o, a;
+const Xn = (e) => function t(n, r, i) {
+  var s, o, a;
   if (typeof n == "function" && typeof r != "function")
-    return function(p, ...R) {
-      return t(p, (N) => n.call(this, N, ...R), r);
+    return function(_, ...D) {
+      return t(_, (G) => n.call(this, G, ...D), r);
     };
   const c = n, u = r;
-  let f = s;
-  if (typeof r != "function" && (f = r), f !== void 0 && Object.prototype.toString.call(f) !== "[object Object]")
-    throw new Error(`Invalid options: ${f}, 'options' should be an object.`);
-  f = Object.assign(Object.assign({}, e), f);
-  const l = Q(c) ? Je(c) : c, d = Array.isArray(f.mark) ? ((p, R) => {
-    for (const N of f.mark) {
-      if (typeof N != "function")
-        throw new Error(`Invalid mark: ${N}, 'mark' should be a function.`);
-      const J = N(p, R);
-      if (J)
-        return J;
+  let l = i;
+  if (typeof r != "function" && (l = r), 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;
     }
-  }) : f.mark, y = (i = f.enablePatches) !== null && i !== void 0 ? i : !1, m = (o = f.strict) !== null && o !== void 0 ? o : !1, v = {
-    enableAutoFreeze: (a = f.enableAutoFreeze) !== null && a !== void 0 ? a : !1,
-    mark: d,
-    strict: m,
-    enablePatches: y
+  }) : 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,
+    enablePatches: p
   };
-  if (!T(l, v) && typeof l == "object" && l !== null)
+  if (!$(f, w) && 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 [w, b] = an(l, v);
+  const [C, S] = Yn(f, w);
   if (typeof r != "function") {
-    if (!T(l, v))
+    if (!$(f, w))
       throw new Error("Invalid base state: create() only supports plain objects, arrays, Set, Map or using mark() to mark the state as immutable.");
-    return [w, b];
+    return [C, S];
   }
-  let C;
+  let P;
   try {
-    C = u(w);
-  } catch (p) {
-    throw Ee(h(w)), p;
-  }
-  const G = (p) => {
-    const R = h(w);
-    if (!Q(p)) {
-      if (p !== void 0 && !j(p, w) && R?.operated)
+    P = u(C);
+  } catch (_) {
+    throw Be(d(C)), _;
+  }
+  const V = (_) => {
+    const D = d(C);
+    if (!K(_)) {
+      if (_ !== void 0 && !H(_, C) && D?.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 J = p?.[Yt];
-      if (J) {
-        const Wt = J[0];
-        return v.strict && typeof p == "object" && p !== null && Ie({
-          rootDraft: R,
-          value: p,
+      const ce = _?.[Hn];
+      if (ce) {
+        const zn = ce[0];
+        return w.strict && typeof _ == "object" && _ !== null && We({
+          rootDraft: D,
+          value: _,
           useRawReturn: !0
-        }), b([Wt]);
+        }), S([zn]);
       }
-      if (p !== void 0)
-        return typeof p == "object" && p !== null && Ie({ rootDraft: R, value: p }), b([p]);
+      if (_ !== void 0)
+        return typeof _ == "object" && _ !== null && We({ rootDraft: D, value: _ }), S([_]);
     }
-    if (p === w || p === void 0)
-      return b([]);
-    const N = h(p);
-    if (v === N.options) {
-      if (N.operated)
+    if (_ === C || _ === void 0)
+      return S([]);
+    const G = d(_);
+    if (w === G.options) {
+      if (G.operated)
         throw new Error("Cannot return a modified child draft.");
-      return b([Je(p)]);
+      return S([mt(_)]);
     }
-    return b([p]);
+    return S([_]);
   };
-  return C instanceof Promise ? C.then(G, (p) => {
-    throw Ee(h(w)), p;
-  }) : G(C);
-}, P = cn();
+  return P instanceof Promise ? P.then(V, (_) => {
+    throw Be(d(C)), _;
+  }) : V(P);
+}, I = Xn();
 Object.prototype.constructor.toString();
-var Tt = typeof global == "object" && global && global.Object === Object && global, un = typeof self == "object" && self && self.Object === Object && self, z = Tt || un || Function("return this")(), I = z.Symbol, xt = Object.prototype, fn = xt.hasOwnProperty, ln = xt.toString, k = I ? I.toStringTag : void 0;
-function hn(e) {
-  var t = fn.call(e, k), n = e[k];
+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[k] = void 0;
+    e[ue] = void 0;
     var r = !0;
   } catch {
   }
-  var s = ln.call(e);
-  return r && (t ? e[k] = n : delete e[k]), s;
+  var i = er.call(e);
+  return r && (t ? e[ue] = n : delete e[ue]), i;
 }
-var pn = Object.prototype, dn = pn.toString;
-function _n(e) {
-  return dn.call(e);
+var nr = Object.prototype, rr = nr.toString;
+function ir(e) {
+  return rr.call(e);
 }
-var yn = "[object Null]", bn = "[object Undefined]", ke = I ? I.toStringTag : void 0;
-function V(e) {
-  return e == null ? e === void 0 ? bn : yn : ke && ke in Object(e) ? hn(e) : _n(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 Y(e) {
+function X(e) {
   return e != null && typeof e == "object";
 }
-var gn = "[object Symbol]";
-function _e(e) {
-  return typeof e == "symbol" || Y(e) && V(e) == gn;
+var ar = "[object Symbol]";
+function Z(e) {
+  return typeof e == "symbol" || X(e) && te(e) == ar;
 }
-function It(e, t) {
-  for (var n = -1, r = e == null ? 0 : e.length, s = Array(r); ++n < r; )
-    s[n] = t(e[n], n, e);
-  return s;
+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 E = Array.isArray, et = I ? I.prototype : void 0, tt = et ? et.toString : void 0;
-function Rt(e) {
+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 (E(e))
-    return It(e, Rt) + "";
-  if (_e(e))
-    return tt ? tt.call(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 mn = /\s/;
-function wn(e) {
-  for (var t = e.length; t-- && mn.test(e.charAt(t)); )
+var cr = /\s/;
+function ur(e) {
+  for (var t = e.length; t-- && cr.test(e.charAt(t)); )
     ;
   return t;
 }
-var vn = /^\s+/;
-function Sn(e) {
-  return e && e.slice(0, wn(e) + 1).replace(vn, "");
+var lr = /^\s+/;
+function fr(e) {
+  return e && e.slice(0, ur(e) + 1).replace(lr, "");
 }
-function se(e) {
+function ae(e) {
   var t = typeof e;
   return e != null && (t == "object" || t == "function");
 }
-var nt = NaN, On = /^[-+]0x[0-9a-f]+$/i, Cn = /^0b[01]+$/i, An = /^0o[0-7]+$/i, Mn = parseInt;
-function En(e) {
+var Ot = NaN, hr = /^[-+]0x[0-9a-f]+$/i, dr = /^0b[01]+$/i, pr = /^0o[0-7]+$/i, _r = parseInt;
+function yr(e) {
   if (typeof e == "number")
     return e;
-  if (_e(e))
-    return nt;
-  if (se(e)) {
+  if (Z(e))
+    return Ot;
+  if (ae(e)) {
     var t = typeof e.valueOf == "function" ? e.valueOf() : e;
-    e = se(t) ? t + "" : t;
+    e = ae(t) ? t + "" : t;
   }
   if (typeof e != "string")
     return e === 0 ? e : +e;
-  e = Sn(e);
-  var n = Cn.test(e);
-  return n || An.test(e) ? Mn(e.slice(2), n ? 2 : 8) : On.test(e) ? nt : +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;
 }
-var rt = 1 / 0, Pn = 17976931348623157e292;
-function Tn(e) {
+var Ct = 1 / 0, gr = 17976931348623157e292;
+function br(e) {
   if (!e)
     return e === 0 ? e : 0;
-  if (e = En(e), e === rt || e === -rt) {
+  if (e = yr(e), e === Ct || e === -Ct) {
     var t = e < 0 ? -1 : 1;
-    return t * Pn;
+    return t * gr;
   }
   return e === e ? e : 0;
 }
-function xn(e) {
-  var t = Tn(e), n = t % 1;
+function ln(e) {
+  var t = br(e), n = t % 1;
   return t === t ? n ? t - n : t : 0;
 }
-function In(e) {
+function me(e) {
   return e;
 }
-var Rn = "[object AsyncFunction]", jn = "[object Function]", $n = "[object GeneratorFunction]", Fn = "[object Proxy]";
-function jt(e) {
-  if (!se(e))
+var mr = "[object AsyncFunction]", Sr = "[object Function]", vr = "[object GeneratorFunction]", wr = "[object Proxy]";
+function fn(e) {
+  if (!ae(e))
     return !1;
-  var t = V(e);
-  return t == jn || t == $n || t == Rn || t == Fn;
+  var t = te(e);
+  return t == Sr || t == vr || t == mr || t == wr;
 }
-var Ce = z["__core-js_shared__"], st = (function() {
-  var e = /[^.]+$/.exec(Ce && Ce.keys && Ce.keys.IE_PROTO || "");
+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 zn(e) {
-  return !!st && st in e;
+function Or(e) {
+  return !!Mt && Mt in e;
 }
-var Dn = Function.prototype, Hn = Dn.toString;
-function W(e) {
+var Cr = Function.prototype, Mr = Cr.toString;
+function ne(e) {
   if (e != null) {
     try {
-      return Hn.call(e);
+      return Mr.call(e);
     } catch {
     }
     try {
@@ -1006,393 +1006,474 @@ function W(e) {
   }
   return "";
 }
-var Nn = /[\\^$.*+?()[\]{}|]/g, Ln = /^\[object .+?Constructor\]$/, qn = Function.prototype, Qn = Object.prototype, Gn = qn.toString, Un = Qn.hasOwnProperty, Bn = RegExp(
-  "^" + Gn.call(Un).replace(Nn, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
+var Ar = /[\\^$.*+?()[\]{}|]/g, Pr = /^\[object .+?Constructor\]$/, xr = Function.prototype, Er = Object.prototype, Tr = xr.toString, Rr = Er.hasOwnProperty, Ir = RegExp(
+  "^" + Tr.call(Rr).replace(Ar, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
 );
-function Kn(e) {
-  if (!se(e) || zn(e))
+function jr(e) {
+  if (!ae(e) || Or(e))
     return !1;
-  var t = jt(e) ? Bn : Ln;
-  return t.test(W(e));
+  var t = fn(e) ? Ir : Pr;
+  return t.test(ne(e));
 }
-function Wn(e, t) {
+function $r(e, t) {
   return e?.[t];
 }
-function Z(e, t) {
-  var n = Wn(e, t);
-  return Kn(n) ? n : void 0;
+function re(e, t) {
+  var n = $r(e, t);
+  return jr(n) ? n : void 0;
 }
-var Re = Z(z, "WeakMap");
-function Xn(e, t, n, r) {
-  for (var s = e.length, i = n + -1; ++i < s; )
-    if (t(e[i], i, e))
-      return i;
+var Ve = re(Q, "WeakMap");
+function Fr(e, t, n) {
+  switch (n.length) {
+    case 0:
+      return e.call(t);
+    case 1:
+      return e.call(t, n[0]);
+    case 2:
+      return e.call(t, n[0], n[1]);
+    case 3:
+      return e.call(t, n[0], n[1], n[2]);
+  }
+  return e.apply(t, n);
+}
+var zr = 800, Nr = 16, Dr = Date.now;
+function Hr(e) {
+  var t = 0, n = 0;
+  return function() {
+    var r = Dr(), i = Nr - (r - n);
+    if (n = r, i > 0) {
+      if (++t >= zr)
+        return arguments[0];
+    } else
+      t = 0;
+    return e.apply(void 0, arguments);
+  };
+}
+function Lr(e) {
+  return function() {
+    return e;
+  };
+}
+var At = (function() {
+  try {
+    var e = re(Object, "defineProperty");
+    return e({}, "", {}), e;
+  } catch {
+  }
+})(), qr = At ? function(e, t) {
+  return At(e, "toString", {
+    configurable: !0,
+    enumerable: !1,
+    value: Lr(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; )
+    ;
+  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;
   return -1;
 }
-var Yn = 9007199254740991, Vn = /^(?:0|[1-9]\d*)$/;
-function $t(e, t) {
+var Gr = 9007199254740991, Kr = /^(?:0|[1-9]\d*)$/;
+function ct(e, t) {
   var n = typeof e;
-  return t = t ?? Yn, !!t && (n == "number" || n != "symbol" && Vn.test(e)) && e > -1 && e % 1 == 0 && e < t;
+  return t = t ?? Gr, !!t && (n == "number" || n != "symbol" && Kr.test(e)) && e > -1 && e % 1 == 0 && e < t;
 }
-function Ft(e, t) {
+function ut(e, t) {
   return e === t || e !== e && t !== t;
 }
-var Zn = 9007199254740991;
-function Ue(e) {
-  return typeof e == "number" && e > -1 && e % 1 == 0 && e <= Zn;
+var Pt = Math.max;
+function Wr(e, t, n) {
+  return t = Pt(t === void 0 ? e.length - 1 : t, 0), function() {
+    for (var r = arguments, i = -1, s = Pt(r.length - t, 0), o = Array(s); ++i < s; )
+      o[i] = r[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);
+  };
+}
+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 ye(e) {
-  return e != null && Ue(e.length) && !jt(e);
+function xt(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 Jn = Object.prototype;
-function kn(e) {
-  var t = e && e.constructor, n = typeof t == "function" && t.prototype || Jn;
+var Yr = Object.prototype;
+function hn(e) {
+  var t = e && e.constructor, n = typeof t == "function" && t.prototype || Yr;
   return e === n;
 }
-function er(e, t) {
+function Xr(e, t) {
   for (var n = -1, r = Array(e); ++n < e; )
     r[n] = t(n);
   return r;
 }
-var tr = "[object Arguments]";
-function it(e) {
-  return Y(e) && V(e) == tr;
+var Zr = "[object Arguments]";
+function Et(e) {
+  return X(e) && te(e) == Zr;
 }
-var zt = Object.prototype, nr = zt.hasOwnProperty, rr = zt.propertyIsEnumerable, Be = it(/* @__PURE__ */ (function() {
+var dn = Object.prototype, kr = dn.hasOwnProperty, ei = dn.propertyIsEnumerable, Te = Et(/* @__PURE__ */ (function() {
   return arguments;
-})()) ? it : function(e) {
-  return Y(e) && nr.call(e, "callee") && !rr.call(e, "callee");
+})()) ? Et : function(e) {
+  return X(e) && kr.call(e, "callee") && !ei.call(e, "callee");
 };
-function sr() {
+function ti() {
   return !1;
 }
-var Dt = typeof exports == "object" && exports && !exports.nodeType && exports, ot = Dt && typeof module == "object" && module && !module.nodeType && module, ir = ot && ot.exports === Dt, at = ir ? z.Buffer : void 0, or = at ? at.isBuffer : void 0, je = or || sr, ar = "[object Arguments]", cr = "[object Array]", ur = "[object Boolean]", fr = "[object Date]", lr = "[object Error]", hr = "[object Function]", pr = "[object Map]", dr = "[object Number]", _r = "[object Object]", yr = "[object RegExp]", br = "[object Set]", gr = "[object String]", mr = "[object WeakMap]", wr = "[object ArrayBuffer]", vr = "[object DataView]", Sr = "[object Float32Array]", Or = "[object Float64Array]", Cr = "[object Int8Array]", Ar = "[object Int16Array]", Mr = "[object Int32Array]", Er = "[object Uint8Array]", Pr = "[object Uint8ClampedArray]", Tr = "[object Uint16Array]", xr = "[object Uint32Array]", _ = {};
-_[Sr] = _[Or] = _[Cr] = _[Ar] = _[Mr] = _[Er] = _[Pr] = _[Tr] = _[xr] = !0;
-_[ar] = _[cr] = _[wr] = _[ur] = _[vr] = _[fr] = _[lr] = _[hr] = _[pr] = _[dr] = _[_r] = _[yr] = _[br] = _[gr] = _[mr] = !1;
-function Ir(e) {
-  return Y(e) && Ue(e.length) && !!_[V(e)];
+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, xe = 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]", Ai = "[object Uint16Array]", Pi = "[object Uint32Array]", y = {};
+y[mi] = y[Si] = y[vi] = y[wi] = y[Oi] = y[Ci] = y[Mi] = y[Ai] = y[Pi] = !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 xi(e) {
+  return X(e) && lt(e.length) && !!y[te(e)];
 }
-function Rr(e) {
+function _n(e) {
   return function(t) {
     return e(t);
   };
 }
-var Ht = typeof exports == "object" && exports && !exports.nodeType && exports, ne = Ht && typeof module == "object" && module && !module.nodeType && module, jr = ne && ne.exports === Ht, Ae = jr && Tt.process, ct = (function() {
+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 = ne && ne.require && ne.require("util").types;
-    return e || Ae && Ae.binding && Ae.binding("util");
+    var e = pe && pe.require && pe.require("util").types;
+    return e || He && He.binding && He.binding("util");
   } catch {
   }
-})(), ut = ct && ct.isTypedArray, Nt = ut ? Rr(ut) : Ir, $r = Object.prototype, Fr = $r.hasOwnProperty;
-function zr(e, t) {
-  var n = E(e), r = !n && Be(e), s = !n && !r && je(e), i = !n && !r && !s && Nt(e), o = n || r || s || i, a = o ? er(e.length, String) : [], c = a.length;
+})(), jt = It && It.isTypedArray, ft = jt ? _n(jt) : xi, Ti = Object.prototype, Ri = Ti.hasOwnProperty;
+function Ii(e, t) {
+  var n = M(e), r = !n && Te(e), i = !n && !r && xe(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)
-    Fr.call(e, u) && !(o && // Safari 9 has enumerable `arguments.length` in strict mode.
+    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.
-    s && (u == "offset" || u == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
-    i && (u == "buffer" || u == "byteLength" || u == "byteOffset") || // Skip index properties.
-    $t(u, c))) && a.push(u);
+    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 Dr(e, t) {
+function ji(e, t) {
   return function(n) {
     return e(t(n));
   };
 }
-var Hr = Dr(Object.keys, Object), Nr = Object.prototype, Lr = Nr.hasOwnProperty;
-function qr(e) {
-  if (!kn(e))
-    return Hr(e);
+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))
-    Lr.call(e, n) && n != "constructor" && t.push(n);
+    zi.call(e, n) && n != "constructor" && t.push(n);
   return t;
 }
-function be(e) {
-  return ye(e) ? zr(e) : qr(e);
+function Re(e) {
+  return ie(e) ? Ii(e) : ht(e);
 }
-var Qr = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, Gr = /^\w*$/;
-function Ke(e, t) {
-  if (E(e))
+var Ni = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, Di = /^\w*$/;
+function dt(e, t) {
+  if (M(e))
     return !1;
   var n = typeof e;
-  return n == "number" || n == "symbol" || n == "boolean" || e == null || _e(e) ? !0 : Gr.test(e) || !Qr.test(e) || t != null && e in Object(t);
+  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 ie = Z(Object, "create");
-function Ur() {
-  this.__data__ = ie ? ie(null) : {}, this.size = 0;
+var ye = re(Object, "create");
+function Hi() {
+  this.__data__ = ye ? ye(null) : {}, this.size = 0;
 }
-function Br(e) {
+function Li(e) {
   var t = this.has(e) && delete this.__data__[e];
   return this.size -= t ? 1 : 0, t;
 }
-var Kr = "__lodash_hash_undefined__", Wr = Object.prototype, Xr = Wr.hasOwnProperty;
-function Yr(e) {
+var qi = "__lodash_hash_undefined__", Qi = Object.prototype, Bi = Qi.hasOwnProperty;
+function Ui(e) {
   var t = this.__data__;
-  if (ie) {
+  if (ye) {
     var n = t[e];
-    return n === Kr ? void 0 : n;
+    return n === qi ? void 0 : n;
   }
-  return Xr.call(t, e) ? t[e] : void 0;
+  return Bi.call(t, e) ? t[e] : void 0;
 }
-var Vr = Object.prototype, Zr = Vr.hasOwnProperty;
-function Jr(e) {
+var Gi = Object.prototype, Ki = Gi.hasOwnProperty;
+function Wi(e) {
   var t = this.__data__;
-  return ie ? t[e] !== void 0 : Zr.call(t, e);
+  return ye ? t[e] !== void 0 : Ki.call(t, e);
 }
-var kr = "__lodash_hash_undefined__";
-function es(e, t) {
+var Vi = "__lodash_hash_undefined__";
+function Ji(e, t) {
   var n = this.__data__;
-  return this.size += this.has(e) ? 0 : 1, n[e] = ie && t === void 0 ? kr : t, this;
+  return this.size += this.has(e) ? 0 : 1, n[e] = ye && t === void 0 ? Vi : t, this;
 }
-function B(e) {
+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]);
   }
 }
-B.prototype.clear = Ur;
-B.prototype.delete = Br;
-B.prototype.get = Yr;
-B.prototype.has = Jr;
-B.prototype.set = es;
-function ts() {
+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 ge(e, t) {
+function Ie(e, t) {
   for (var n = e.length; n--; )
-    if (Ft(e[n][0], t))
+    if (ut(e[n][0], t))
       return n;
   return -1;
 }
-var ns = Array.prototype, rs = ns.splice;
-function ss(e) {
-  var t = this.__data__, n = ge(t, e);
+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() : rs.call(t, n, 1), --this.size, !0;
+  return n == r ? t.pop() : Zi.call(t, n, 1), --this.size, !0;
 }
-function is(e) {
-  var t = this.__data__, n = ge(t, e);
+function es(e) {
+  var t = this.__data__, n = Ie(t, e);
   return n < 0 ? void 0 : t[n][1];
 }
-function os(e) {
-  return ge(this.__data__, e) > -1;
+function ts(e) {
+  return Ie(this.__data__, e) > -1;
 }
-function as(e, t) {
-  var n = this.__data__, r = ge(n, e);
+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 D(e) {
+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]);
   }
 }
-D.prototype.clear = ts;
-D.prototype.delete = ss;
-D.prototype.get = is;
-D.prototype.has = os;
-D.prototype.set = as;
-var oe = Z(z, "Map");
-function cs() {
+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 B(),
-    map: new (oe || D)(),
-    string: new B()
+    hash: new k(),
+    map: new (ge || B)(),
+    string: new k()
   };
 }
-function us(e) {
+function is(e) {
   var t = typeof e;
   return t == "string" || t == "number" || t == "symbol" || t == "boolean" ? e !== "__proto__" : e === null;
 }
-function me(e, t) {
+function je(e, t) {
   var n = e.__data__;
-  return us(t) ? n[typeof t == "string" ? "string" : "hash"] : n.map;
+  return is(t) ? n[typeof t == "string" ? "string" : "hash"] : n.map;
 }
-function fs(e) {
-  var t = me(this, e).delete(e);
+function ss(e) {
+  var t = je(this, e).delete(e);
   return this.size -= t ? 1 : 0, t;
 }
-function ls(e) {
-  return me(this, e).get(e);
+function os(e) {
+  return je(this, e).get(e);
 }
-function hs(e) {
-  return me(this, e).has(e);
+function as(e) {
+  return je(this, e).has(e);
 }
-function ps(e, t) {
-  var n = me(this, e), r = n.size;
+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 H(e) {
+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]);
   }
 }
-H.prototype.clear = cs;
-H.prototype.delete = fs;
-H.prototype.get = ls;
-H.prototype.has = hs;
-H.prototype.set = ps;
-var ds = "Expected a function";
-function We(e, t) {
+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(ds);
+    throw new TypeError(us);
   var n = function() {
-    var r = arguments, s = t ? t.apply(this, r) : r[0], i = n.cache;
-    if (i.has(s))
-      return i.get(s);
+    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 = i.set(s, o) || i, o;
+    return n.cache = s.set(i, o) || s, o;
   };
-  return n.cache = new (We.Cache || H)(), n;
+  return n.cache = new (pt.Cache || U)(), n;
 }
-We.Cache = H;
-var _s = 500;
-function ys(e) {
-  var t = We(e, function(r) {
-    return n.size === _s && n.clear(), r;
+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 bs = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, gs = /\\(\\)?/g, ms = ys(function(e) {
+var hs = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, ds = /\\(\\)?/g, ps = fs(function(e) {
   var t = [];
-  return e.charCodeAt(0) === 46 && t.push(""), e.replace(bs, function(n, r, s, i) {
-    t.push(s ? i.replace(gs, "$1") : r || n);
+  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;
 });
-function ws(e) {
-  return e == null ? "" : Rt(e);
+function gn(e) {
+  return e == null ? "" : un(e);
 }
-function Lt(e, t) {
-  return E(e) ? e : Ke(e, t) ? [e] : ms(ws(e));
+function bn(e, t) {
+  return M(e) ? e : dt(e, t) ? [e] : ps(gn(e));
 }
-function we(e) {
-  if (typeof e == "string" || _e(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 qt(e, t) {
-  t = Lt(t, e);
+function _t(e, t) {
+  t = bn(t, e);
   for (var n = 0, r = t.length; e != null && n < r; )
-    e = e[we(t[n++])];
+    e = e[$e(t[n++])];
   return n && n == r ? e : void 0;
 }
-function vs(e, t, n) {
-  var r = e == null ? void 0 : qt(e, t);
+function m(e, t, n) {
+  var r = e == null ? void 0 : _t(e, t);
   return r === void 0 ? n : r;
 }
-function Qt(e, t) {
-  for (var n = -1, r = t.length, s = e.length; ++n < r; )
-    e[s + n] = t[n];
+function mn(e, t) {
+  for (var n = -1, r = t.length, i = e.length; ++n < r; )
+    e[i + n] = t[n];
   return e;
 }
-var ft = I ? I.isConcatSpreadable : void 0;
-function Ss(e) {
-  return E(e) || Be(e) || !!(ft && e && e[ft]);
+var $t = N ? N.isConcatSpreadable : void 0;
+function _s(e) {
+  return M(e) || Te(e) || !!($t && e && e[$t]);
 }
-function Os(e, t, n, r, s) {
-  var i = -1, o = e.length;
-  for (n || (n = Ss), s || (s = []); ++i < o; ) {
-    var a = e[i];
-    n(a) ? Qt(s, a) : s[s.length] = a;
+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;
   }
+  return i;
+}
+function vn(e, t, n) {
+  var r = -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;
 }
-function Cs() {
-  this.__data__ = new D(), this.size = 0;
+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 As(e) {
   var t = this.__data__, n = t.delete(e);
   return this.size = t.size, n;
 }
-function Ms(e) {
+function Ps(e) {
   return this.__data__.get(e);
 }
-function Es(e) {
+function xs(e) {
   return this.__data__.has(e);
 }
-var Ps = 200;
+var Es = 200;
 function Ts(e, t) {
   var n = this.__data__;
-  if (n instanceof D) {
+  if (n instanceof B) {
     var r = n.__data__;
-    if (!oe || r.length < Ps - 1)
+    if (!ge || r.length < Es - 1)
       return r.push([e, t]), this.size = ++n.size, this;
-    n = this.__data__ = new H(r);
+    n = this.__data__ = new U(r);
   }
   return n.set(e, t), this.size = n.size, this;
 }
-function $(e) {
-  var t = this.__data__ = new D(e);
+function L(e) {
+  var t = this.__data__ = new B(e);
   this.size = t.size;
 }
-$.prototype.clear = Cs;
-$.prototype.delete = As;
-$.prototype.get = Ms;
-$.prototype.has = Es;
-$.prototype.set = Ts;
-function xs(e, t) {
-  for (var n = -1, r = e == null ? 0 : e.length, s = 0, i = []; ++n < r; ) {
+L.prototype.clear = Ms;
+L.prototype.delete = As;
+L.prototype.get = Ps;
+L.prototype.has = xs;
+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) && (i[s++] = o);
+    t(o, n, e) && (s[i++] = o);
   }
-  return i;
+  return s;
 }
-function Is() {
+function Rs() {
   return [];
 }
-var Rs = Object.prototype, js = Rs.propertyIsEnumerable, lt = Object.getOwnPropertySymbols, $s = lt ? function(e) {
-  return e == null ? [] : (e = Object(e), xs(lt(e), function(t) {
+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);
   }));
-} : Is;
+} : Rs;
 function Fs(e, t, n) {
   var r = t(e);
-  return E(e) ? r : Qt(r, n(e));
+  return M(e) ? r : mn(r, n(e));
 }
-function ht(e) {
-  return Fs(e, be, $s);
+function zt(e) {
+  return Fs(e, Re, $s);
 }
-var $e = Z(z, "DataView"), Fe = Z(z, "Promise"), ze = Z(z, "Set"), pt = "[object Map]", zs = "[object Object]", dt = "[object Promise]", _t = "[object Set]", yt = "[object WeakMap]", bt = "[object DataView]", Ds = W($e), Hs = W(oe), Ns = W(Fe), Ls = W(ze), qs = W(Re), L = V;
-($e && L(new $e(new ArrayBuffer(1))) != bt || oe && L(new oe()) != pt || Fe && L(Fe.resolve()) != dt || ze && L(new ze()) != _t || Re && L(new Re()) != yt) && (L = function(e) {
-  var t = V(e), n = t == zs ? e.constructor : void 0, r = n ? W(n) : "";
+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 bt;
+        return Nt;
       case Hs:
-        return pt;
-      case Ns:
-        return dt;
+        return Dt;
       case Ls:
-        return _t;
+        return Ht;
       case qs:
-        return yt;
+        return Lt;
     }
   return t;
 });
-var gt = z.Uint8Array, Qs = "__lodash_hash_undefined__";
-function Gs(e) {
+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 de(e) {
+function Ee(e) {
   var t = -1, n = e == null ? 0 : e.length;
-  for (this.__data__ = new H(); ++t < n; )
+  for (this.__data__ = new U(); ++t < n; )
     this.add(e[t]);
 }
-de.prototype.add = de.prototype.push = Gs;
-de.prototype.has = Us;
-function Bs(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;
@@ -1401,325 +1482,471 @@ function Bs(e, t) {
 function Ks(e, t) {
   return e.has(t);
 }
-var Ws = 1, Xs = 2;
-function Gt(e, t, n, r, s, i) {
+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 = i.get(e), f = i.get(t);
-  if (u && f)
-    return u == t && f == e;
-  var l = -1, d = !0, y = n & Xs ? new de() : void 0;
-  for (i.set(e, t), i.set(t, e); ++l < a; ) {
-    var m = e[l], O = t[l];
+  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 v = o ? r(O, m, l, t, e, i) : r(m, O, l, e, t, i);
-    if (v !== void 0) {
-      if (v)
+      var w = o ? r(b, g, f, t, e, s) : r(g, b, f, e, t, s);
+    if (w !== void 0) {
+      if (w)
         continue;
-      d = !1;
+      h = !1;
       break;
     }
-    if (y) {
-      if (!Bs(t, function(w, b) {
-        if (!Ks(y, b) && (m === w || s(m, w, n, r, i)))
-          return y.push(b);
+    if (p) {
+      if (!Gs(t, function(C, S) {
+        if (!Ks(p, S) && (g === C || i(g, C, n, r, s)))
+          return p.push(S);
       })) {
-        d = !1;
+        h = !1;
         break;
       }
-    } else if (!(m === O || s(m, O, n, r, i))) {
-      d = !1;
+    } else if (!(g === b || i(g, b, n, r, s))) {
+      h = !1;
       break;
     }
   }
-  return i.delete(e), i.delete(t), d;
+  return s.delete(e), s.delete(t), h;
 }
-function Ys(e) {
+function Js(e) {
   var t = -1, n = Array(e.size);
-  return e.forEach(function(r, s) {
-    n[++t] = [s, r];
+  return e.forEach(function(r, i) {
+    n[++t] = [i, r];
   }), n;
 }
-function Vs(e) {
+function Ys(e) {
   var t = -1, n = Array(e.size);
   return e.forEach(function(r) {
     n[++t] = r;
   }), n;
 }
-var Zs = 1, Js = 2, ks = "[object Boolean]", ei = "[object Date]", ti = "[object Error]", ni = "[object Map]", ri = "[object Number]", si = "[object RegExp]", ii = "[object Set]", oi = "[object String]", ai = "[object Symbol]", ci = "[object ArrayBuffer]", ui = "[object DataView]", mt = I ? I.prototype : void 0, Me = mt ? mt.valueOf : void 0;
-function fi(e, t, n, r, s, i, o) {
+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 ui:
+    case uo:
       if (e.byteLength != t.byteLength || e.byteOffset != t.byteOffset)
         return !1;
       e = e.buffer, t = t.buffer;
-    case ci:
-      return !(e.byteLength != t.byteLength || !i(new gt(e), new gt(t)));
+    case co:
+      return !(e.byteLength != t.byteLength || !s(new Qt(e), new Qt(t)));
     case ks:
-    case ei:
-    case ri:
-      return Ft(+e, +t);
-    case ti:
+    case eo:
+    case ro:
+      return ut(+e, +t);
+    case to:
       return e.name == t.name && e.message == t.message;
-    case si:
-    case oi:
+    case io:
+    case oo:
       return e == t + "";
-    case ni:
-      var a = Ys;
-    case ii:
-      var c = r & Zs;
-      if (a || (a = Vs), e.size != t.size && !c)
+    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 |= Js, o.set(e, t);
-      var f = Gt(a(e), a(t), r, s, i, o);
-      return o.delete(e), f;
-    case ai:
-      if (Me)
-        return Me.call(e) == Me.call(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 li = 1, hi = Object.prototype, pi = hi.hasOwnProperty;
-function di(e, t, n, r, s, i) {
-  var o = n & li, a = ht(e), c = a.length, u = ht(t), f = u.length;
-  if (c != f && !o)
+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 l = c; l--; ) {
-    var d = a[l];
-    if (!(o ? d in t : pi.call(t, d)))
+  for (var f = c; f--; ) {
+    var h = a[f];
+    if (!(o ? h in t : po.call(t, h)))
       return !1;
   }
-  var y = i.get(e), m = i.get(t);
-  if (y && m)
-    return y == t && m == e;
-  var O = !0;
-  i.set(e, t), i.set(t, e);
-  for (var v = o; ++l < c; ) {
-    d = a[l];
-    var w = e[d], b = t[d];
+  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 C = o ? r(b, w, d, t, e, i) : r(w, b, d, e, t, i);
-    if (!(C === void 0 ? w === b || s(w, b, n, r, i) : C)) {
-      O = !1;
+      var P = o ? r(S, C, h, t, e, s) : r(C, S, h, e, t, s);
+    if (!(P === void 0 ? C === S || i(C, S, n, r, s) : P)) {
+      b = !1;
       break;
     }
-    v || (v = d == "constructor");
+    w || (w = h == "constructor");
   }
-  if (O && !v) {
-    var G = e.constructor, p = t.constructor;
-    G != p && "constructor" in e && "constructor" in t && !(typeof G == "function" && G instanceof G && typeof p == "function" && p instanceof p) && (O = !1);
+  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 i.delete(e), i.delete(t), O;
+  return s.delete(e), s.delete(t), b;
 }
-var _i = 1, wt = "[object Arguments]", vt = "[object Array]", ce = "[object Object]", yi = Object.prototype, St = yi.hasOwnProperty;
-function bi(e, t, n, r, s, i) {
-  var o = E(e), a = E(t), c = o ? vt : L(e), u = a ? vt : L(t);
-  c = c == wt ? ce : c, u = u == wt ? ce : u;
-  var f = c == ce, l = u == ce, d = c == u;
-  if (d && je(e)) {
-    if (!je(t))
+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 && xe(e)) {
+    if (!xe(t))
       return !1;
-    o = !0, f = !1;
-  }
-  if (d && !f)
-    return i || (i = new $()), o || Nt(e) ? Gt(e, t, n, r, s, i) : fi(e, t, c, n, r, s, i);
-  if (!(n & _i)) {
-    var y = f && St.call(e, "__wrapped__"), m = l && St.call(t, "__wrapped__");
-    if (y || m) {
-      var O = y ? e.value() : e, v = m ? t.value() : t;
-      return i || (i = new $()), s(O, v, n, r, i);
+    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 d ? (i || (i = new $()), di(e, t, n, r, s, i)) : !1;
+  return h ? (s || (s = new L()), _o(e, t, n, r, i, s)) : !1;
 }
-function ve(e, t, n, r, s) {
-  return e === t ? !0 : e == null || t == null || !Y(e) && !Y(t) ? e !== e && t !== t : bi(e, t, n, r, ve, s);
+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 gi = 1, mi = 2;
-function wi(e, t, n, r) {
-  var s = n.length, i = s;
+var mo = 1, So = 2;
+function vo(e, t, n, r) {
+  var i = n.length, s = i;
   if (e == null)
-    return !i;
-  for (e = Object(e); s--; ) {
-    var o = n[s];
+    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 (; ++s < i; ) {
-    o = n[s];
+  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 f = new $(), l;
-      if (!(l === void 0 ? ve(u, c, gi | mi, r, f) : l))
+      var l = new L(), f;
+      if (!(f === void 0 ? Fe(u, c, mo | So, r, l) : f))
         return !1;
     }
   }
   return !0;
 }
-function Ut(e) {
-  return e === e && !se(e);
+function Cn(e) {
+  return e === e && !ae(e);
 }
-function vi(e) {
-  for (var t = be(e), n = t.length; n--; ) {
-    var r = t[n], s = e[r];
-    t[n] = [r, s, Ut(s)];
+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 Bt(e, t) {
+function Mn(e, t) {
   return function(n) {
     return n == null ? !1 : n[e] === t && (t !== void 0 || e in Object(n));
   };
 }
-function Si(e) {
-  var t = vi(e);
-  return t.length == 1 && t[0][2] ? Bt(t[0][0], t[0][1]) : function(n) {
-    return n === e || wi(n, e, t);
+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 Oi(e, t) {
+function Co(e, t) {
   return e != null && t in Object(e);
 }
-function Ci(e, t, n) {
-  t = Lt(t, e);
-  for (var r = -1, s = t.length, i = !1; ++r < s; ) {
-    var o = we(t[r]);
-    if (!(i = e != null && n(e, o)))
+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 i || ++r != s ? i : (s = e == null ? 0 : e.length, !!s && Ue(s) && $t(o, s) && (E(e) || Be(e)));
+  return s || ++r != i ? s : (i = e == null ? 0 : e.length, !!i && lt(i) && ct(o, i) && (M(e) || Te(e)));
 }
-function Ai(e, t) {
-  return e != null && Ci(e, t, Oi);
+function Ao(e, t) {
+  return e != null && Mo(e, t, Co);
 }
-var Mi = 1, Ei = 2;
-function Pi(e, t) {
-  return Ke(e) && Ut(t) ? Bt(we(e), t) : function(n) {
-    var r = vs(n, e);
-    return r === void 0 && r === t ? Ai(n, e) : ve(t, r, Mi | Ei);
+var Po = 1, xo = 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 ? Ao(n, e) : Fe(t, r, Po | xo);
   };
 }
-function Ti(e) {
+function An(e) {
   return function(t) {
     return t?.[e];
   };
 }
-function xi(e) {
+function To(e) {
   return function(t) {
-    return qt(t, e);
+    return _t(t, e);
   };
 }
-function Ii(e) {
-  return Ke(e) ? Ti(we(e)) : xi(e);
+function Ro(e) {
+  return dt(e) ? An($e(e)) : To(e);
 }
-function Se(e) {
-  return typeof e == "function" ? e : e == null ? In : typeof e == "object" ? E(e) ? Pi(e[0], e[1]) : Si(e) : Ii(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 Ri(e) {
+function Io(e) {
   return function(t, n, r) {
-    for (var s = -1, i = Object(t), o = r(t), a = o.length; a--; ) {
-      var c = o[++s];
-      if (n(i[c], c, i) === !1)
+    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;
   };
 }
-var ji = Ri();
-function $i(e, t) {
-  return e && ji(e, t, be);
+var jo = Io();
+function $o(e, t) {
+  return e && jo(e, t, Re);
 }
-function Fi(e, t) {
+function Fo(e, t) {
   return function(n, r) {
     if (n == null)
       return n;
-    if (!ye(n))
+    if (!ie(n))
       return e(n, r);
-    for (var s = n.length, i = -1, o = Object(n); ++i < s && r(o[i], i, o) !== !1; )
+    for (var i = n.length, s = -1, o = Object(n); ++s < i && r(o[s], s, o) !== !1; )
       ;
     return n;
   };
 }
-var Kt = Fi($i);
-function zi(e) {
+var ze = Fo($o);
+function fe(e) {
   var t = e == null ? 0 : e.length;
   return t ? e[t - 1] : void 0;
 }
-function Di(e, t) {
+function zo(e) {
+  return typeof e == "function" ? e : me;
+}
+function Oe(e, t) {
+  var n = M(e) ? Br : ze;
+  return n(e, zo(t));
+}
+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 Hi(e, t) {
+function Do(e, t) {
   var n = !0;
-  return Kt(e, function(r, s, i) {
-    return n = !!t(r, s, i), n;
+  return ze(e, function(r, i, s) {
+    return n = !!t(r, i, s), n;
   }), n;
 }
-function Ni(e, t, n) {
-  var r = E(e) ? Di : Hi;
-  return r(e, Se(t));
+function Ho(e, t, n) {
+  var r = M(e) ? No : Do;
+  return r(e, W(t));
 }
-function Li(e) {
+function Lo(e, t) {
+  var n = [];
+  return ze(e, function(r, i, s) {
+    t(r, i, s) && n.push(r);
+  }), n;
+}
+function Ce(e, t) {
+  var n = M(e) ? wn : Lo;
+  return n(e, W(t));
+}
+function qo(e) {
   return function(t, n, r) {
-    var s = Object(t);
-    if (!ye(t)) {
-      var i = Se(n);
-      t = be(t), n = function(a) {
-        return i(s[a], a, s);
+    var i = Object(t);
+    if (!ie(t)) {
+      var s = W(n);
+      t = Re(t), n = function(a) {
+        return s(i[a], a, i);
       };
     }
     var o = e(t, n, r);
-    return o > -1 ? s[i ? t[o] : o] : void 0;
+    return o > -1 ? i[s ? t[o] : o] : void 0;
   };
 }
-var qi = Math.max;
-function Qi(e, t, n) {
+var Qo = Math.max;
+function Bo(e, t, n) {
   var r = e == null ? 0 : e.length;
   if (!r)
     return -1;
-  var s = n == null ? 0 : xn(n);
-  return s < 0 && (s = qi(r + s, 0)), Xn(e, Se(t), s);
-}
-var Gi = Li(Qi);
-function Ui(e, t) {
-  var n = -1, r = ye(e) ? Array(e.length) : [];
-  return Kt(e, function(s, i, o) {
-    r[++n] = t(s, i, o);
+  var i = n == null ? 0 : ln(n);
+  return i < 0 && (i = Qo(r + i, 0)), Ur(e, W(t), i);
+}
+var Ze = qo(Bo);
+function Uo(e) {
+  return e && e.length ? e[0] : void 0;
+}
+function Pn(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 Bi(e, t) {
-  var n = E(e) ? It : Ui;
-  return n(e, Se(t));
+function Y(e, t) {
+  var n = M(e) ? de : Pn;
+  return n(e, W(t));
 }
-function Ki(e, t) {
-  return Os(Bi(e, t));
+function Go(e, t) {
+  return Sn(Y(e, t));
 }
-function Wi(e) {
+function Ko(e) {
   for (var t = -1, n = e == null ? 0 : e.length, r = {}; ++t < n; ) {
-    var s = e[t];
-    r[s[0]] = s[1];
+    var i = e[t];
+    r[i[0]] = i[1];
   }
   return r;
 }
-function Xi(e, t) {
-  return ve(e, t);
+function Wo(e, t) {
+  return e > t;
 }
-const Yi = (e, t) => {
-  if (!e.length) return [t];
-  const n = zi(e);
-  return n.type === "create" && t.type === "delete" ? null : n.type === "create" && t.type === "update" ? [{ ...n, data: t.data }] : n.type === "update" && t.type === "update" ? [...e.slice(0, -1), t] : n.type === "update" && t.type === "delete" ? [...e, t] : [t];
+var Vo = "[object String]";
+function Jo(e) {
+  return typeof e == "string" || !M(e) && X(e) && te(e) == Vo;
+}
+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 xn(e) {
+  if (e == null)
+    return !0;
+  if (ie(e) && (M(e) || typeof e == "string" || typeof e.splice == "function" || xe(e) || ft(e) || Te(e)))
+    return !e.length;
+  var t = F(e);
+  if (t == Xo || t == Zo)
+    return !e.size;
+  if (hn(e))
+    return !ht(e).length;
+  for (var n in e)
+    if (ea.call(e, n))
+      return !1;
+  return !0;
+}
+function O(e, t) {
+  return Fe(e, t);
+}
+var ta = Array.prototype, na = ta.join;
+function qe(e, t) {
+  return e == null ? "" : na.call(e, t);
+}
+function ra(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;
+  }
+  return c;
+}
+function Wt(e, t) {
+  return e && e.length ? En(e, W(t), Wo) : void 0;
+}
+function ia(e, t) {
+  return e && e.length ? En(e, W(t), ra) : void 0;
+}
+function sa(e, t) {
+  var n = e.length;
+  for (e.sort(t); n--; )
+    e[n] = e[n].value;
+  return e;
+}
+function oa(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)
+      return 1;
+    if (!r && !s && !u && e < t || u && n && i && !r && !s || a && n && i || !o && i || !c)
+      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);
+    }
+  }
+  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 = Pn(e, function(s, o, a) {
+    var c = de(t, function(u) {
+      return u(s);
+    });
+    return { criteria: c, index: ++r, value: s };
+  });
+  return sa(i, function(s, o) {
+    return aa(s, o, n);
+  });
+}
+var ua = An("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); )
+    ++t;
+  return t;
+}
+function wa(e) {
+  return Cs(e) ? va(e) : ua(e);
+}
+var Oa = "[object Map]", Ca = "[object Set]";
+function oe(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;
+}
+var Me = Vr(function(e, t) {
+  if (e == null)
+    return [];
+  var n = t.length;
+  return n > 1 && xt(e, t[0], t[1]) ? t = [] : n > 2 && xt(t[0], t[1], t[2]) && (t = [t[0]]), ca(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 Aa = 0;
+function Jt(e) {
+  var t = ++Aa;
+  return gn(e) + t;
+}
+const Pa = (e, t) => {
+  if (xn(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 Vi {
+class xa {
   _config;
   _state;
   _subscribers = /* @__PURE__ */ new Set();
@@ -1736,8 +1963,8 @@ class Vi {
   }
   enqueue(t) {
     this._updateState((n) => {
-      const r = [...n.queue.get(t.id) ?? []], s = Yi(r, t);
-      s ? n.queue.set(t.id, s) : n.queue.delete(t.id), n.errors.delete(t.id);
+      const r = [...n.queue.get(t.id) ?? []], i = Pa(r, t);
+      i ? n.queue.set(t.id, i) : n.queue.delete(t.id), n.errors.delete(t.id);
     }), this._scheduleFlush();
   }
   pause() {
@@ -1753,8 +1980,8 @@ class Vi {
   retryAll() {
     const t = this._state.errors;
     t.size !== 0 && (this._updateState((n) => {
-      for (const [r, s] of t)
-        n.queue.has(r) || n.queue.set(r, s.operations);
+      for (const [r, i] of t)
+        n.queue.has(r) || n.queue.set(r, i.operations);
       n.errors.clear();
     }), this._scheduleFlush());
   }
@@ -1786,7 +2013,7 @@ class Vi {
     return this._subscribers.add(t), () => this._subscribers.delete(t);
   }
   _updateState(t) {
-    this._state = P(this._state, t), this._subscribers.forEach((n) => n());
+    this._state = I(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));
@@ -1794,64 +2021,97 @@ class Vi {
   _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 || r.size === 0) return;
-    this._updateState((i) => {
-      i.inFlight = new Map(r), i.queue = /* @__PURE__ */ new Map(), i.isSyncing = !0;
+    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));
+    this._updateState((u) => {
+      u.inFlight = new Map(o), u.queue = new Map(a), u.isSyncing = !0;
     });
-    const s = Ki([...this._state.inFlight.values()]);
+    const c = Go([...this._state.inFlight.values()]);
     this._abortController = new AbortController();
     try {
-      const i = await this._config.onSync(s, this._abortController.signal);
-      this._processResults(Wi(i.map((o) => [o.id, o])));
-    } catch (i) {
-      this._handleError(i);
+      const u = await this._config.onSync(c, this._abortController.signal);
+      this._processResults(Ko(Y(u, (l) => [l.id, l])));
+    } catch (u) {
+      this._handleError(u);
     }
-    this._abortController = null, this._state.queue.size > 0 && !this._state.isPaused && this._scheduleFlush();
-  }
+    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((s) => {
-      for (const [i, o] of n)
-        if (Ni(o, (c) => t[c.id]?.status === "success")) {
-          s.errors.delete(i);
-          for (const c of o) {
-            const u = t[c.id];
-            c.type === "create" && u?.newId && u.newId !== c.id && r.push({ tempId: c.id, newId: u.newId });
-          }
-        } else {
-          const c = (s.errors.get(i)?.retries ?? 0) + 1;
-          c < this._config.maxRetries && !s.queue.has(i) && s.queue.set(i, o);
-          const u = Gi(o, (f) => t[f.id]?.status !== "success");
-          s.errors.set(i, {
-            error: t[u?.id ?? ""]?.error ?? "Unknown error",
+    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 });
+          });
+        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
           });
         }
-      s.inFlight = /* @__PURE__ */ new Map(), s.isSyncing = !1;
-    }), r.length > 0 && this._config.onIdRemap && this._config.onIdRemap(r);
-  }
+      i.inFlight = /* @__PURE__ */ new Map(), i.isSyncing = !1;
+    }), !xn(r) && this._config.onIdRemap && this._config.onIdRemap(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 = this._abortController?.signal.aborted, s = t instanceof Error ? t.message : String(t);
-    this._updateState((i) => {
+    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)
-          i.queue.has(o) || i.queue.set(o, a);
+          s.queue.has(o) || s.queue.set(o, a);
         else {
-          const c = (i.errors.get(o)?.retries ?? 0) + 1;
-          c < this._config.maxRetries && !i.queue.has(o) && i.queue.set(o, a), i.errors.set(o, {
-            error: s,
+          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, {
+            error: i,
             retries: c,
             operations: a
           });
         }
-      i.inFlight = /* @__PURE__ */ new Map(), i.isSyncing = !1;
+      s.inFlight = /* @__PURE__ */ new Map(), s.isSyncing = !1;
     });
   }
 }
-class Zi {
+class Ea {
   _cache = /* @__PURE__ */ new Map();
   _capacity;
   _ttl;
@@ -1884,7 +2144,7 @@ class Zi {
     return this._cache.size;
   }
 }
-class Ji {
+class Ta {
   _config;
   _cache;
   _state = { status: "idle", items: [] };
@@ -1892,43 +2152,43 @@ class Ji {
   _abortController = null;
   _currentContext = null;
   constructor(t) {
-    this._config = { retries: 0, ...t }, this._cache = new Zi(t.cacheCapacity, t.cacheTtl);
+    this._config = { retries: 0, ...t }, this._cache = new Ea(t.cacheCapacity, t.cacheTtl);
   }
   _getCacheKey = (t) => JSON.stringify([this._config.id, t]);
   _setState(t) {
-    this._state = P(this._state, (n) => {
+    this._state = I(this._state, (n) => {
       Object.assign(n, t);
     }), this._subscribers.forEach((n) => n());
   }
   async _fetchWithRetry(t, n) {
     const r = this._config.retries;
-    let s;
-    for (let i = 0; i <= r; i++) {
+    let i;
+    for (let s = 0; s <= r; s++) {
       if (n.aborted) throw new DOMException("Aborted", "AbortError");
       try {
-        return i > 0 && this._setState({ retryCount: i }), await this._config.onFetch(t, n);
+        return s > 0 && this._setState({ retryCount: s }), await this._config.onFetch(t, n);
       } catch (o) {
-        if (s = o, n.aborted || i === r) throw o;
+        if (i = o, n.aborted || s === r) throw o;
       }
     }
-    throw s;
+    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;
     this._abortController?.abort("New fetch request started");
-    const s = new AbortController();
-    this._abortController = s, this._currentContext = t, this._setState({ status: "fetching", error: void 0, retryCount: void 0 });
+    const i = new AbortController();
+    this._abortController = i, this._currentContext = t, this._setState({ status: "fetching", error: void 0, retryCount: void 0 });
     try {
-      const i = await this._fetchWithRetry(t, s.signal);
-      return this._cache.set(n, i), this._abortController = null, this._setState({ status: "idle", items: i, error: void 0, retryCount: void 0 }), i;
-    } catch (i) {
-      if (s.signal.aborted) return this._state.items;
+      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) {
+      if (i.signal.aborted) return this._state.items;
       throw this._abortController = null, this._setState({
         status: "error",
-        error: i instanceof Error ? i.message : String(i)
-      }), i;
+        error: s instanceof Error ? s.message : String(s)
+      }), s;
     }
   }
   async refresh(t) {
@@ -1954,24 +2214,13 @@ class Ji {
     };
   }
 }
-class ki {
+class Yt {
   _collection;
   _id;
   _cachedStatus = null;
-  _refCount = 0;
   constructor(t, n) {
     this._collection = t, this._id = n;
   }
-  // Reference counting for lifecycle management
-  _retain() {
-    this._refCount++;
-  }
-  _release() {
-    this._refCount--, this._refCount <= 0 && this._collection._releaseItem(this._id);
-  }
-  get refCount() {
-    return this._refCount;
-  }
   get id() {
     return this._id;
   }
@@ -1986,7 +2235,7 @@ class ki {
   }
   getStatus() {
     const t = this._collection.getItemStatus(this._id);
-    return Xi(this._cachedStatus, t) || (this._cachedStatus = t), this._cachedStatus;
+    return O(this._cachedStatus, t) || (this._cachedStatus = t), this._cachedStatus;
   }
   exists() {
     return this._collection.getState().items.has(this._id);
@@ -2001,50 +2250,245 @@ class ki {
     this._id = t;
   }
 }
-class q {
+const Ra = ".";
+function Xt(e, t) {
+  const n = e.lastIndexOf(t);
+  return n === -1 ? null : e.slice(0, n);
+}
+function Ia(e, t, n) {
+  return e.startsWith(t + n) ? !e.slice(t.length + 1).includes(n) : !1;
+}
+function Qe(e, t, n) {
+  return e.startsWith(t + n);
+}
+function Zt(e, t) {
+  return e.split(t).length - 1;
+}
+class kt {
+  _id;
+  _collection;
+  _cachedStatus = null;
+  constructor(t, n) {
+    this._collection = t, this._id = n;
+  }
+  get _separator() {
+    return this._collection.config.nodeSeparator ?? Ra;
+  }
+  get id() {
+    return this._id;
+  }
+  get data() {
+    return this._collection.getState().items.get(this._id);
+  }
+  get collection() {
+    return this._collection;
+  }
+  get depth() {
+    return Zt(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;
+  }
+  getParent() {
+    const t = Xt(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));
+  }
+  _generateChildId() {
+    const { getNodeId: t } = this._collection.config, n = t ? t() : Jt();
+    return qe([this._id, n], this._separator);
+  }
+  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;
+  }
+  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;
+  }
+  /**
+   * Move node to a new position within the same parent (reordering)
+   * or to a different parent (reparenting).
+   *
+   * @param targetPosition - The target position among siblings
+   * @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);
+    if (!i) return;
+    if (!n) {
+      const o = r.position;
+      if (o === t) return;
+      const c = this._collection.getNode(i).getChildren(), u = Ze(c, (l) => m(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;
+        });
+      });
+      return;
+    }
+    if (n.id === i) {
+      this.move(t);
+      return;
+    }
+    if (n.id === this._id || Qe(n.id, this._id, this._separator))
+      return;
+    const s = this.clone();
+    this._collection.batch(() => {
+      n._mergeClonedSubset(s, t), this.remove();
+    });
+  }
+  /**
+   * Clone this node and all its descendants into a Map with remapped IDs.
+   * The root of the clone has a temporary ID that will be remapped when merged.
+   * @returns Map of cloned nodes keyed by their relative path from clone root
+   */
+  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,
+      position: t.position,
+      value: t.value,
+      type: t.type
+    });
+    const s = Ce(
+      [...this._collection.items.entries()],
+      ([o]) => Qe(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;
+      i.set(u, {
+        id: u,
+        position: l.position,
+        value: l.value,
+        type: l.type
+      });
+    }), i;
+  }
+  /**
+   * Internal method to merge a cloned subset under this node.
+   * The cloned nodes will have their IDs prefixed with this node's ID.
+   */
+  _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();
+    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;
+    }
+    return Oe([...t.entries()], ([a, c]) => {
+      let u;
+      if (a === i)
+        u = s;
+      else {
+        const f = a.slice(i.length);
+        u = qe([s, f.slice(this._separator.length)], this._separator);
+      }
+      const l = {
+        id: u,
+        position: a === i ? o : c.position,
+        value: c.value,
+        type: c.type
+      };
+      this._collection.create(l);
+    }), s;
+  }
+  updateProp(t) {
+    this._collection.update(this._id, (n) => {
+      t(n.value);
+    });
+  }
+  remove() {
+    const t = [...this._collection.items.keys()], n = Y(
+      Ce(t, (i) => Qe(i, this._id, this._separator)),
+      (i) => i
+    ), r = [this._id, ...n];
+    this._collection.batch(() => {
+      const i = Me(r, (s) => -Zt(s, this._separator));
+      Oe(i, (s) => this._collection.remove(s));
+    });
+  }
+  select() {
+    this._collection.selectNode(this._id);
+  }
+  _updateId(t) {
+    this._id = t;
+  }
+}
+class R {
   // Global cache of collection instances by id
+  // 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 = q._cache.get(t.id);
+    const n = R._cache.get(t.id);
     if (n)
       return n;
-    const r = new q(t);
-    return q._cache.set(t.id, r), r;
+    const r = new R(t);
+    return R._cache.set(t.id, r), r;
   }
   // Clear a specific collection from cache
   static clear(t) {
-    q._cache.delete(t);
+    R._cache.delete(t);
   }
   // Clear all collections from cache
   static clearAll() {
-    q._cache.clear();
+    R._cache.clear();
+  }
+  // Get existing collection by ID (returns undefined if not found)
+  static getById(t) {
+    return R._cache.get(t);
   }
   id;
   config;
   _state;
   _syncQueue;
   _fetchHandler;
-  _itemCache = /* @__PURE__ */ new Map();
+  _itemCache = /* @__PURE__ */ new WeakMap();
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  _nodeCache = /* @__PURE__ */ new WeakMap();
+  _selectedNodeId = null;
   _subscribers = /* @__PURE__ */ new Set();
   _hasInitialized = !1;
   _batchMode = !1;
   constructor(t) {
     this.id = t.id, this.config = t;
-    const n = async (i) => i.map((o) => ({ id: o.id, status: "success" }));
-    this._syncQueue = new Vi({
+    const n = async (s) => s.map((o) => ({ id: o.id, status: "success" }));
+    this._syncQueue = new xa({
       debounce: t.syncDebounce ?? 300,
       maxRetries: t.syncRetries ?? 3,
       onSync: t.onSync ?? n,
-      onIdRemap: (i) => this._handleIdRemap(i)
-    }), this._fetchHandler = new Ji({
+      onIdRemap: (s) => this._handleIdRemap(s)
+    }), this._fetchHandler = new Ta({
       id: t.id,
       cacheCapacity: t.cacheCapacity ?? 10,
       cacheTtl: t.cacheTtl ?? 6e4,
       retries: t.fetchRetries ?? 0,
       onFetch: t.onFetch
     });
-    const r = this._syncQueue.getState(), s = this._fetchHandler.getState();
+    const r = this._syncQueue.getState(), i = this._fetchHandler.getState();
     this._state = {
       context: t.initialContext,
       items: /* @__PURE__ */ new Map(),
@@ -2052,8 +2496,8 @@ class q {
       loading: !1,
       syncing: !1,
       syncQueue: r,
-      fetchStatus: s.status,
-      fetchError: s.error
+      fetchStatus: i.status,
+      fetchError: i.error
     }, this._syncQueue.subscribe(() => {
       this._onSyncQueueChange();
     }), this._fetchHandler.subscribe(() => {
@@ -2088,35 +2532,35 @@ class q {
   }
   // Get item status from sync queue state
   getItemStatus(t) {
-    const { queue: n, inFlight: r, errors: s } = this._state.syncQueue, i = r.get(t);
-    if (i && i.length > 0)
+    const { queue: n, inFlight: r, errors: i } = this._state.syncQueue, s = r.get(t), o = fe(s);
+    if (o)
       return {
-        type: i[i.length - 1].type,
+        type: o.type,
         status: "syncing",
-        retries: s.get(t)?.retries ?? 0
+        retries: m(i.get(t), "retries", 0)
       };
-    const o = n.get(t);
-    if (o && o.length > 0) {
-      const c = o[o.length - 1], u = s.get(t);
+    const a = n.get(t), c = fe(a);
+    if (c) {
+      const l = i.get(t);
       return {
         type: c.type,
-        status: u ? "error" : "pending",
-        retries: u?.retries ?? 0,
-        error: u?.error
+        status: l ? "error" : "pending",
+        retries: m(l, "retries", 0),
+        error: m(l, "error")
       };
     }
-    const a = s.get(t);
-    return a ? {
+    const u = i.get(t);
+    return u ? {
       type: "update",
       status: "error",
-      retries: a.retries,
-      error: a.error
+      retries: u.retries,
+      error: u.error
     } : null;
   }
   // Create a new item (local-first)
   create(t) {
     const n = this.config.getId(t);
-    this._state = P(this._state, (r) => {
+    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 });
   }
@@ -2124,32 +2568,64 @@ class q {
   update(t, n) {
     const r = this._state.items.get(t);
     if (!r) return;
-    const s = P(r, n);
-    this._state = P(this._state, (i) => {
-      i.items.set(t, s);
-    }), this._fetchHandler.invalidateCache(), this._notifySubscribers(), this._syncQueue.enqueue({ id: t, type: "update", data: s });
+    const i = I(r, n);
+    this._state = I(this._state, (s) => {
+      s.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 = P(this._state, (r) => {
+    n && (this._state = I(this._state, (r) => {
       r.items.delete(t);
-    }), this._itemCache.delete(t), this._fetchHandler.invalidateCache(), this._notifySubscribers(), this._syncQueue.enqueue({ id: t, type: "delete", data: n }));
+    }), this._fetchHandler.invalidateCache(), this._notifySubscribers(), this._syncQueue.enqueue({ id: t, type: "delete", data: n }));
   }
-  // Get Item reference (cached) - automatically retains the item
+  // Get Item reference (cached by data object)
   getItem(t) {
-    let n = this._itemCache.get(t);
-    return n || (n = new ki(this, t), this._itemCache.set(t, n)), n._retain(), n;
+    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;
+  }
+  // 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;
+  }
+  // Execute multiple operations with single notification at the end
+  batch(t) {
+    this._batchMode = !0;
+    try {
+      t();
+    } finally {
+      this._batchMode = !1, this._notifySubscribers();
+    }
+  }
+  // Selection methods for tree nodes
+  selectNode(t) {
+    this._selectedNodeId !== t && (this._selectedNodeId = t, this._notifySubscribers());
+  }
+  deselectNode() {
+    this._selectedNodeId !== null && (this._selectedNodeId = null, this._notifySubscribers());
   }
-  // Release item from cache when ref count reaches zero
-  _releaseItem(t) {
-    this._itemCache.delete(t);
+  get selectedNodeId() {
+    return this._selectedNodeId;
+  }
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  get selectedNode() {
+    return this._selectedNodeId ? this.getNode(this._selectedNodeId) : null;
   }
   // Update context and refetch
   setContext(t) {
-    const n = this._state.context, r = P(n, t);
-    n !== r && (this._state = P(this._state, (s) => {
-      s.context = r;
+    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());
   }
   // Force refresh (bypass cache)
@@ -2168,7 +2644,7 @@ class q {
   }
   // Cleanup everything and remove from global cache
   destroy() {
-    this._syncQueue.destroy(), this._fetchHandler.destroy(), this._itemCache.clear(), this._subscribers.clear(), q._cache.delete(this.id);
+    this._syncQueue.destroy(), this._fetchHandler.destroy(), this._subscribers.clear(), R._cache.delete(this.id);
   }
   // Private methods
   async _initialFetch() {
@@ -2180,26 +2656,26 @@ class q {
   }
   _onFetchChange() {
     const t = this._fetchHandler.getState();
-    this._state = P(this._state, (n) => {
+    this._state = I(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: s } = this._state.syncQueue, i = /* @__PURE__ */ new Map();
+      const { queue: r, inFlight: i } = this._state.syncQueue, s = /* @__PURE__ */ new Map();
       for (const o of t.items) {
         const a = this.config.getId(o);
-        i.set(a, o);
+        s.set(a, o);
       }
       for (const [o, a] of r) {
-        const c = a[a.length - 1];
-        (c.type === "create" || c.type === "update") && i.set(o, c.data);
+        const c = fe(a);
+        c && (c.type === "create" || c.type === "update") && s.set(o, c.data);
       }
-      for (const [o, a] of s) {
-        const c = a[a.length - 1];
-        (c.type === "create" || c.type === "update") && i.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);
       }
-      n.items = i;
+      n.items = s;
     }), this._notifySubscribers();
   }
   _updateSyncState(t) {
-    this._state = P(this._state, (n) => {
+    this._state = I(this._state, (n) => {
       n.syncQueue = t, n.syncing = t.isSyncing, n.syncState = this._computeSyncState(n.fetchStatus, t.isSyncing);
     }), this._notifySubscribers();
   }
@@ -2214,24 +2690,27 @@ class q {
   _handleIdRemap(t) {
     if (t.length === 0) return;
     const { setId: n } = this.config;
-    this._state = P(this._state, (r) => {
-      for (const { tempId: s, newId: i } of t) {
-        const o = r.items.get(s);
+    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, i) : (o.id = i, a = o), r.items.delete(s), r.items.set(i, a);
+          n ? a = n(o, s) : (o.id = s, a = o), r.items.delete(i), r.items.set(s, a);
         }
       }
     });
-    for (const { tempId: r, newId: s } of t) {
-      const i = this._itemCache.get(r);
-      i && (i._updateId(s), this._itemCache.delete(r), this._itemCache.set(s, i));
+    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 to(e) {
-  const t = q.get(e), n = ue(
+function Da(e) {
+  const t = R.get(e), n = j(
     (r) => t.subscribe(r),
     () => t.getState(),
     () => t.getState()
@@ -2248,7 +2727,7 @@ function to(e) {
     fetchError: n.fetchError,
     // Item operations
     create: (r) => t.create(r),
-    update: (r, s) => t.update(r, s),
+    update: (r, i) => t.update(r, i),
     remove: (r) => t.remove(r),
     getItem: (r) => t.getItem(r),
     getItemStatus: (r) => t.getItemStatus(r),
@@ -2261,39 +2740,216 @@ function to(e) {
     retrySync: (r) => t.retrySync(r)
   };
 }
-function no(e) {
-  Xt(() => () => {
-    queueMicrotask(() => e._release());
-  }, [e]);
-  const t = ue(
+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);
+      return {
+        id: f.id,
+        type: f.type,
+        value: f.value,
+        ...g.length > 0 ? { children: g } : {}
+      };
+    };
+    return u(e.rootId);
+  }, [n.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,
+    // Node operations
+    getNode: (a) => t.getNode(a),
+    getNodeStatus: (a) => t.getItemStatus(a),
+    // Context & refresh
+    setContext: (a) => t.setContext(a),
+    refresh: () => t.refresh(),
+    // Sync controls
+    pauseSync: () => t.pauseSync(),
+    resumeSync: () => t.resumeSync(),
+    retrySync: (a) => t.retrySync(a),
+    // Selection
+    selectNode: (a) => t.selectNode(a),
+    deselectNode: () => t.deselectNode(),
+    selectedNodeId: i,
+    selectedNode: s,
+    // Serialization
+    toJson: o
+  };
+}
+function La(e) {
+  const t = j(
     (o) => e.collection.subscribe(o),
     () => e.data,
     () => e.data
-  ), n = ue(
+  ), n = j(
     (o) => e.collection.subscribe(o),
     () => e.getStatus(),
     () => e.getStatus()
-  ), r = ue(
+  ), r = j(
     (o) => e.collection.subscribe(o),
     () => e.exists(),
     () => e.exists()
-  ), s = Xe((o) => e.update(o), [e]), i = Xe(() => e.remove(), [e]);
-  return { data: t, status: n, update: s, remove: i, exists: r };
+  ), 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;
+}
+const $a = {
+  data: void 0,
+  status: null,
+  exists: !1,
+  isSelected: !1,
+  children: []
+};
+function Fa(e) {
+  const t = Nn(null), n = j(
+    (h) => e.collection.subscribe(h),
+    () => {
+      const h = e.getChildren(), p = t.current, g = p && !ja(p.children, h) ? p.children : h, 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 ?? $a
+  ), 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),
+    [e]
+  ), a = T(() => e.clone(), [e]), c = T(
+    (h) => e.updateProp(h),
+    [e]
+  ), u = T(() => e.remove(), [e]), l = T(() => e.select(), [e]), f = T(() => e.collection.deselectNode(), [e]);
+  return {
+    isPresent: !0,
+    data: n.data,
+    status: n.status,
+    exists: n.exists,
+    isSelected: n.isSelected,
+    depth: e.depth,
+    getParent: r,
+    children: n.children,
+    append: i,
+    prepend: s,
+    move: o,
+    clone: a,
+    updateProp: c,
+    remove: u,
+    select: l,
+    deselect: f
+  };
+}
+const za = {
+  isPresent: !1,
+  data: void 0,
+  status: null,
+  exists: !1,
+  isSelected: !1,
+  depth: 0,
+  getParent: () => null,
+  children: [],
+  append: () => "",
+  prepend: () => "",
+  move: () => {
+  },
+  clone: () => /* @__PURE__ */ new Map(),
+  updateProp: () => {
+  },
+  remove: () => {
+  },
+  select: () => {
+  },
+  deselect: () => {
+  }
+};
+function qa(e) {
+  const t = R.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),
+    () => t.selectedNode,
+    () => t.selectedNode
+  ), r = Dn(() => t.getNode("__dummy__"), [t]), i = Fa(n ?? r);
+  return n ? i : za;
+}
+function Qa(e) {
+  const t = R.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),
+    () => t.getState(),
+    () => t.getState()
+  );
+  return {
+    syncState: n.syncState,
+    syncing: n.syncing,
+    queue: n.syncQueue.queue,
+    inFlight: n.syncQueue.inFlight,
+    errors: n.syncQueue.errors,
+    isPaused: n.syncQueue.isPaused,
+    isSyncing: n.syncQueue.isSyncing
+  };
 }
 export {
-  Zi as Cache,
-  q as Collection,
-  Ji as FetchHandler,
-  ki as Item,
-  Vi as SyncQueue,
-  io as categorizeResults,
-  ao as createSyncClient,
-  co as createSyncClientFromEndpoint,
-  uo as createSyncClientWithStats,
-  fo as fetchToSyncResult,
-  lo as syncError,
-  ho as syncSuccess,
-  to as useCrud,
-  no as useItem
+  Ea as Cache,
+  R as Collection,
+  Ta as FetchHandler,
+  Yt as Item,
+  kt as Node,
+  xa 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
 };
 //# sourceMappingURL=index.js.map