@mhmo91/schmancy 0.5.21 → 0.5.23

package/dist/{context-object-u5gBaozZ.js → context-object-BE1o2XB3.js}

@@ -1,5 +1,5 @@
-import { Subject as pe, BehaviorSubject as Q, throttleTime as oe } from "rxjs";
-var ce = Symbol.for("immer-nothing"), $ = Symbol.for("immer-draftable"), l = Symbol.for("immer-state"), fe = process.env.NODE_ENV !== "production" ? [function(t) {
+import { Subject as de, BehaviorSubject as Q, throttleTime as oe } from "rxjs";
+var ce = Symbol.for("immer-nothing"), w = Symbol.for("immer-draftable"), l = Symbol.for("immer-state"), fe = process.env.NODE_ENV !== "production" ? [function(t) {
   return `The plugin for '${t}' has not been loaded into Immer. To enable the plugin, import and call \`enable${t}()\` when initializing your application.`;
 }, function(t) {
   return `produce can only be called on things that are draftable: plain objects, arrays, Map, Set or classes that are marked with '[immerable]: true'. Got '${t}'`;
@@ -17,38 +17,38 @@ function _(t, ...e) {
   }
   throw new Error(`[Immer] minified error nr: ${t}. Full error at: https://bit.ly/3cXEKWf`);
 }
-var E = Object.getPrototypeOf;
-function w(t) {
+var $ = Object.getPrototypeOf;
+function S(t) {
   return !!t && !!t[l];
 }
-function v(t) {
-  return !!t && (he(t) || Array.isArray(t) || !!t[$] || !!t.constructor?.[$] || A(t) || R(t));
+function g(t) {
+  return !!t && (he(t) || Array.isArray(t) || !!t[w] || !!t.constructor?.[w] || I(t) || R(t));
 }
 var ye = Object.prototype.constructor.toString();
 function he(t) {
   if (!t || typeof t != "object") return !1;
-  const e = E(t);
+  const e = $(t);
   if (e === null) return !0;
   const r = Object.hasOwnProperty.call(e, "constructor") && e.constructor;
   return r === Object || typeof r == "function" && Function.toString.call(r) === ye;
 }
-function j(t, e) {
-  T(t) === 0 ? Reflect.ownKeys(t).forEach((r) => {
+function D(t, e) {
+  A(t) === 0 ? Reflect.ownKeys(t).forEach((r) => {
     e(r, t[r], t);
   }) : t.forEach((r, s) => e(s, r, t));
 }
-function T(t) {
+function A(t) {
   const e = t[l];
-  return e ? e.type_ : Array.isArray(t) ? 1 : A(t) ? 2 : R(t) ? 3 : 0;
+  return e ? e.type_ : Array.isArray(t) ? 1 : I(t) ? 2 : R(t) ? 3 : 0;
 }
 function C(t, e) {
-  return T(t) === 2 ? t.has(e) : Object.prototype.hasOwnProperty.call(t, e);
+  return A(t) === 2 ? t.has(e) : Object.prototype.hasOwnProperty.call(t, e);
 }
 function ue(t, e, r) {
-  const s = T(t);
+  const s = A(t);
   s === 2 ? t.set(e, r) : s === 3 ? t.add(r) : t[e] = r;
 }
-function A(t) {
+function I(t) {
   return t instanceof Map;
 }
 function R(t) {
@@ -58,7 +58,7 @@ function f(t) {
   return t.copy_ || t.base_;
 }
 function J(t, e) {
-  if (A(t)) return new Map(t);
+  if (I(t)) return new Map(t);
   if (R(t)) return new Set(t);
   if (Array.isArray(t)) return Array.prototype.slice.call(t);
   const r = he(t);
@@ -70,82 +70,82 @@ function J(t, e) {
       const h = n[a], c = s[h];
       c.writable === !1 && (c.writable = !0, c.configurable = !0), (c.get || c.set) && (s[h] = { configurable: !0, writable: !0, enumerable: c.enumerable, value: t[h] });
     }
-    return Object.create(E(t), s);
+    return Object.create($(t), s);
   }
   {
-    const s = E(t);
+    const s = $(t);
     if (s !== null && r) return { ...t };
     const n = Object.create(s);
     return Object.assign(n, t);
   }
 }
 function G(t, e = !1) {
-  return F(t) || w(t) || !v(t) || (T(t) > 1 && (t.set = t.add = t.clear = t.delete = _e), Object.freeze(t), e && Object.entries(t).forEach(([r, s]) => G(s, !0))), t;
+  return F(t) || S(t) || !g(t) || (A(t) > 1 && Object.defineProperties(t, { set: { value: N }, add: { value: N }, clear: { value: N }, delete: { value: N } }), Object.freeze(t), e && Object.values(t).forEach((r) => G(r, !0))), t;
 }
-function _e() {
+function N() {
   _(2);
 }
 function F(t) {
   return Object.isFrozen(t);
 }
-var P, U = {};
-function S(t) {
-  const e = U[t];
+var j, K = {};
+function v(t) {
+  const e = K[t];
   return e || _(0, t), e;
 }
-function N() {
-  return P;
+function M() {
+  return j;
 }
-function Y(t, e) {
-  e && (S("Patches"), t.patches_ = [], t.inversePatches_ = [], t.patchListener_ = e);
+function X(t, e) {
+  e && (v("Patches"), t.patches_ = [], t.inversePatches_ = [], t.patchListener_ = e);
 }
-function K(t) {
-  W(t), t.drafts_.forEach(be), t.drafts_ = null;
+function U(t) {
+  L(t), t.drafts_.forEach(_e), t.drafts_ = null;
 }
-function W(t) {
-  t === P && (P = t.parent_);
+function L(t) {
+  t === j && (j = t.parent_);
 }
-function Z(t) {
-  return P = { drafts_: [], parent_: P, immer_: t, canAutoFreeze_: !0, unfinalizedDrafts_: 0 };
+function Y(t) {
+  return j = { drafts_: [], parent_: j, immer_: t, canAutoFreeze_: !0, unfinalizedDrafts_: 0 };
 }
-function be(t) {
+function _e(t) {
   const e = t[l];
   e.type_ === 0 || e.type_ === 1 ? e.revoke_() : e.revoked_ = !0;
 }
-function H(t, e) {
+function Z(t, e) {
   e.unfinalizedDrafts_ = e.drafts_.length;
   const r = e.drafts_[0];
-  return t !== void 0 && t !== r ? (r[l].modified_ && (K(e), _(4)), v(t) && (t = M(e, t), e.parent_ || z(e, t)), e.patches_ && S("Patches").generateReplacementPatches_(r[l].base_, t, e.patches_, e.inversePatches_)) : t = M(e, r, []), K(e), e.patches_ && e.patchListener_(e.patches_, e.inversePatches_), t !== ce ? t : void 0;
+  return t !== void 0 && t !== r ? (r[l].modified_ && (U(e), _(4)), g(t) && (t = z(e, t), e.parent_ || T(e, t)), e.patches_ && v("Patches").generateReplacementPatches_(r[l].base_, t, e.patches_, e.inversePatches_)) : t = z(e, r, []), U(e), e.patches_ && e.patchListener_(e.patches_, e.inversePatches_), t !== ce ? t : void 0;
 }
-function M(t, e, r) {
+function z(t, e, r) {
   if (F(e)) return e;
   const s = e[l];
-  if (!s) return j(e, (n, a) => ee(t, s, e, n, a, r)), e;
+  if (!s) return D(e, (n, a) => ee(t, s, e, n, a, r)), e;
   if (s.scope_ !== t) return e;
-  if (!s.modified_) return z(t, s.base_, !0), s.base_;
+  if (!s.modified_) return T(t, s.base_, !0), s.base_;
   if (!s.finalized_) {
     s.finalized_ = !0, s.scope_.unfinalizedDrafts_--;
     const n = s.copy_;
     let a = n, h = !1;
-    s.type_ === 3 && (a = new Set(n), n.clear(), h = !0), j(a, (c, i) => ee(t, s, n, c, i, r, h)), z(t, n, !1), r && t.patches_ && S("Patches").generatePatches_(s, r, t.patches_, t.inversePatches_);
+    s.type_ === 3 && (a = new Set(n), n.clear(), h = !0), D(a, (c, i) => ee(t, s, n, c, i, r, h)), T(t, n, !1), r && t.patches_ && v("Patches").generatePatches_(s, r, t.patches_, t.inversePatches_);
   }
   return s.copy_;
 }
 function ee(t, e, r, s, n, a, h) {
-  if (process.env.NODE_ENV !== "production" && n === r && _(5), w(n)) {
-    const c = M(t, n, a && e && e.type_ !== 3 && !C(e.assigned_, s) ? a.concat(s) : void 0);
-    if (ue(r, s, c), !w(c)) return;
+  if (process.env.NODE_ENV !== "production" && n === r && _(5), S(n)) {
+    const c = z(t, n, a && e && e.type_ !== 3 && !C(e.assigned_, s) ? a.concat(s) : void 0);
+    if (ue(r, s, c), !S(c)) return;
     t.canAutoFreeze_ = !1;
   } else h && r.add(n);
-  if (v(n) && !F(n)) {
+  if (g(n) && !F(n)) {
     if (!t.immer_.autoFreeze_ && t.unfinalizedDrafts_ < 1) return;
-    M(t, n), e && e.scope_.parent_ || typeof s == "symbol" || !Object.prototype.propertyIsEnumerable.call(r, s) || z(t, n);
+    z(t, n), e && e.scope_.parent_ || typeof s == "symbol" || !(I(r) ? r.has(s) : Object.prototype.propertyIsEnumerable.call(r, s)) || T(t, n);
   }
 }
-function z(t, e, r = !1) {
+function T(t, e, r = !1) {
   !t.parent_ && t.immer_.autoFreeze_ && t.canAutoFreeze_ && G(e, r);
 }
-var L = { get(t, e) {
+var W = { get(t, e) {
   if (e === l) return t;
   const r = f(t);
   if (!C(r, e)) return function(n, a, h) {
@@ -153,7 +153,7 @@ var L = { get(t, e) {
     return c ? "value" in c ? c.value : c.get?.call(n.draft_) : void 0;
   }(t, r, e);
   const s = r[e];
-  return t.finalized_ || !v(s) ? s : s === V(t.base_, e) ? (B(t), t.copy_[e] = I(s, t)) : s;
+  return t.finalized_ || !g(s) ? s : s === V(t.base_, e) ? (B(t), t.copy_[e] = P(s, t)) : s;
 }, has: (t, e) => e in f(t), ownKeys: (t) => Reflect.ownKeys(f(t)), set(t, e, r) {
   const s = te(f(t), e);
   if (s?.set) return s.set.call(t.draft_, r), !0;
@@ -161,69 +161,69 @@ var L = { get(t, e) {
     const h = V(f(t), e), c = h?.[l];
     if (c && c.base_ === r) return t.copy_[e] = r, t.assigned_[e] = !1, !0;
     if (((n = r) === (a = h) ? n !== 0 || 1 / n == 1 / a : n != n && a != a) && (r !== void 0 || C(t.base_, e))) return !0;
-    B(t), g(t);
+    B(t), b(t);
   }
   var n, a;
   return t.copy_[e] === r && (r !== void 0 || e in t.copy_) || Number.isNaN(r) && Number.isNaN(t.copy_[e]) || (t.copy_[e] = r, t.assigned_[e] = !0), !0;
-}, deleteProperty: (t, e) => (V(t.base_, e) !== void 0 || e in t.base_ ? (t.assigned_[e] = !1, B(t), g(t)) : delete t.assigned_[e], t.copy_ && delete t.copy_[e], !0), getOwnPropertyDescriptor(t, e) {
+}, deleteProperty: (t, e) => (V(t.base_, e) !== void 0 || e in t.base_ ? (t.assigned_[e] = !1, B(t), b(t)) : delete t.assigned_[e], t.copy_ && delete t.copy_[e], !0), getOwnPropertyDescriptor(t, e) {
   const r = f(t), s = Reflect.getOwnPropertyDescriptor(r, e);
   return s && { writable: !0, configurable: t.type_ !== 1 || e !== "length", enumerable: s.enumerable, value: r[e] };
 }, defineProperty() {
   _(11);
-}, getPrototypeOf: (t) => E(t.base_), setPrototypeOf() {
+}, getPrototypeOf: (t) => $(t.base_), setPrototypeOf() {
   _(12);
-} }, x = {};
+} }, E = {};
 function V(t, e) {
   const r = t[l];
   return (r ? f(r) : t)[e];
 }
 function te(t, e) {
   if (!(e in t)) return;
-  let r = E(t);
+  let r = $(t);
   for (; r; ) {
     const s = Object.getOwnPropertyDescriptor(r, e);
     if (s) return s;
-    r = E(r);
+    r = $(r);
   }
 }
-function g(t) {
-  t.modified_ || (t.modified_ = !0, t.parent_ && g(t.parent_));
+function b(t) {
+  t.modified_ || (t.modified_ = !0, t.parent_ && b(t.parent_));
 }
 function B(t) {
   t.copy_ || (t.copy_ = J(t.base_, t.scope_.immer_.useStrictShallowCopy_));
 }
-j(L, (t, e) => {
-  x[t] = function() {
+D(W, (t, e) => {
+  E[t] = function() {
     return arguments[0] = arguments[0][0], e.apply(this, arguments);
   };
-}), x.deleteProperty = function(t, e) {
-  return process.env.NODE_ENV !== "production" && isNaN(parseInt(e)) && _(13), x.set.call(this, t, e, void 0);
-}, x.set = function(t, e, r) {
-  return process.env.NODE_ENV !== "production" && e !== "length" && isNaN(parseInt(e)) && _(14), L.set.call(this, t[0], e, r, t[0]);
+}), E.deleteProperty = function(t, e) {
+  return process.env.NODE_ENV !== "production" && isNaN(parseInt(e)) && _(13), E.set.call(this, t, e, void 0);
+}, E.set = function(t, e, r) {
+  return process.env.NODE_ENV !== "production" && e !== "length" && isNaN(parseInt(e)) && _(14), W.set.call(this, t[0], e, r, t[0]);
 };
-function I(t, e) {
-  const r = A(t) ? S("MapSet").proxyMap_(t, e) : R(t) ? S("MapSet").proxySet_(t, e) : function(s, n) {
-    const a = Array.isArray(s), h = { type_: a ? 1 : 0, scope_: n ? n.scope_ : N(), modified_: !1, finalized_: !1, assigned_: {}, parent_: n, base_: s, draft_: null, copy_: null, revoke_: null, isManual_: !1 };
-    let c = h, i = L;
-    a && (c = [h], i = x);
-    const { revoke: o, proxy: p } = Proxy.revocable(c, i);
-    return h.draft_ = p, h.revoke_ = o, p;
+function P(t, e) {
+  const r = I(t) ? v("MapSet").proxyMap_(t, e) : R(t) ? v("MapSet").proxySet_(t, e) : function(s, n) {
+    const a = Array.isArray(s), h = { type_: a ? 1 : 0, scope_: n ? n.scope_ : M(), modified_: !1, finalized_: !1, assigned_: {}, parent_: n, base_: s, draft_: null, copy_: null, revoke_: null, isManual_: !1 };
+    let c = h, i = W;
+    a && (c = [h], i = E);
+    const { revoke: o, proxy: d } = Proxy.revocable(c, i);
+    return h.draft_ = d, h.revoke_ = o, d;
   }(t, e);
-  return (e ? e.scope_ : N()).drafts_.push(r), r;
+  return (e ? e.scope_ : M()).drafts_.push(r), r;
 }
 function le(t) {
-  if (!v(t) || F(t)) return t;
+  if (!g(t) || F(t)) return t;
   const e = t[l];
   let r;
   if (e) {
     if (!e.modified_) return e.base_;
     e.finalized_ = !0, r = J(t, e.scope_.immer_.useStrictShallowCopy_);
   } else r = J(t, !0);
-  return j(r, (s, n) => {
+  return D(r, (s, n) => {
     ue(r, s, le(n));
   }), e && (e.finalized_ = !1), r;
 }
-var de, re, se, b = new class {
+var pe, re, se, p = new class {
   constructor(t) {
     this.autoFreeze_ = !0, this.useStrictShallowCopy_ = !1, this.produce = (e, r, s) => {
       if (typeof e == "function" && typeof r != "function") {
@@ -235,20 +235,20 @@ var de, re, se, b = new class {
         };
       }
       let n;
-      if (typeof r != "function" && _(6), s !== void 0 && typeof s != "function" && _(7), v(e)) {
-        const a = Z(this), h = I(e, void 0);
+      if (typeof r != "function" && _(6), s !== void 0 && typeof s != "function" && _(7), g(e)) {
+        const a = Y(this), h = P(e, void 0);
         let c = !0;
         try {
           n = r(h), c = !1;
         } finally {
-          c ? K(a) : W(a);
+          c ? U(a) : L(a);
         }
-        return Y(a, s), H(n, a);
+        return X(a, s), Z(n, a);
       }
       if (!e || typeof e != "object") {
         if (n = r(e), n === void 0 && (n = e), n === ce && (n = void 0), this.autoFreeze_ && G(n, !0), s) {
           const a = [], h = [];
-          S("Patches").generateReplacementPatches_(e, n, a, h), s(a, h);
+          v("Patches").generateReplacementPatches_(e, n, a, h), s(a, h);
         }
         return n;
       }
@@ -262,17 +262,17 @@ var de, re, se, b = new class {
     }, typeof t?.autoFreeze == "boolean" && this.setAutoFreeze(t.autoFreeze), typeof t?.useStrictShallowCopy == "boolean" && this.setUseStrictShallowCopy(t.useStrictShallowCopy);
   }
   createDraft(t) {
-    v(t) || _(8), w(t) && (t = function(s) {
-      return w(s) || _(10, s), le(s);
+    g(t) || _(8), S(t) && (t = function(s) {
+      return S(s) || _(10, s), le(s);
     }(t));
-    const e = Z(this), r = I(t, void 0);
-    return r[l].isManual_ = !0, W(e), r;
+    const e = Y(this), r = P(t, void 0);
+    return r[l].isManual_ = !0, L(e), r;
   }
   finishDraft(t, e) {
     const r = t && t[l];
     r && r.isManual_ || _(9);
     const { scope_: s } = r;
-    return Y(s, e), H(void 0, s);
+    return X(s, e), Z(void 0, s);
   }
   setAutoFreeze(t) {
     this.autoFreeze_ = t;
@@ -290,11 +290,10 @@ var de, re, se, b = new class {
       }
     }
     r > -1 && (e = e.slice(r + 1));
-    const s = S("Patches").applyPatches_;
-    return w(t) ? s(t, e) : this.produce(t, (n) => s(n, e));
+    const s = v("Patches").applyPatches_;
+    return S(t) ? s(t, e) : this.produce(t, (n) => s(n, e));
   }
-}(), d = b.produce;
-b.produceWithPatches.bind(b), b.setAutoFreeze.bind(b), b.setUseStrictShallowCopy.bind(b), b.applyPatches.bind(b), b.createDraft.bind(b), b.finishDraft.bind(b);
+}().produce;
 class u extends Error {
   constructor(e, r, s) {
     super(e), this.name = "StoreError", this.cause = r, this.context = s, this.timestamp = /* @__PURE__ */ new Date(), Error.captureStackTrace && Error.captureStackTrace(this, u);
@@ -317,7 +316,7 @@ class me {
     this.data = null;
   }
 }
-class ge {
+class be {
   constructor(e) {
     this.key = e;
   }
@@ -340,7 +339,7 @@ class ge {
     localStorage.removeItem(this.key);
   }
 }
-class ve {
+class ge {
   constructor(e) {
     this.key = e;
   }
@@ -424,12 +423,12 @@ const y = class y {
 };
 y.DB_NAME = "StoreDB", y.STORE_NAME = "states", y.DB_VERSION = 1;
 let q = y;
-function Se(t, e) {
+function ve(t, e) {
   switch (t) {
     case "local":
-      return new ge(e);
+      return new be(e);
     case "session":
-      return new ve(e);
+      return new ge(e);
     case "indexeddb":
       return new q(e);
     default:
@@ -439,7 +438,7 @@ function Se(t, e) {
 (function() {
   class t extends Map {
     constructor(i, o) {
-      super(), this[l] = { type_: 2, parent_: o, scope_: o ? o.scope_ : N(), modified_: !1, finalized_: !1, copy_: void 0, assigned_: void 0, base_: i, draft_: this, isManual_: !1, revoked_: !1 };
+      super(), this[l] = { type_: 2, parent_: o, scope_: o ? o.scope_ : M(), modified_: !1, finalized_: !1, copy_: void 0, assigned_: void 0, base_: i, draft_: this, isManual_: !1, revoked_: !1 };
     }
     get size() {
       return f(this[l]).size;
@@ -448,31 +447,31 @@ function Se(t, e) {
       return f(this[l]).has(i);
     }
     set(i, o) {
-      const p = this[l];
-      return n(p), f(p).has(i) && f(p).get(i) === o || (e(p), g(p), p.assigned_.set(i, !0), p.copy_.set(i, o), p.assigned_.set(i, !0)), this;
+      const d = this[l];
+      return n(d), f(d).has(i) && f(d).get(i) === o || (e(d), b(d), d.assigned_.set(i, !0), d.copy_.set(i, o), d.assigned_.set(i, !0)), this;
     }
     delete(i) {
       if (!this.has(i)) return !1;
       const o = this[l];
-      return n(o), e(o), g(o), o.base_.has(i) ? o.assigned_.set(i, !1) : o.assigned_.delete(i), o.copy_.delete(i), !0;
+      return n(o), e(o), b(o), o.base_.has(i) ? o.assigned_.set(i, !1) : o.assigned_.delete(i), o.copy_.delete(i), !0;
     }
     clear() {
       const i = this[l];
-      n(i), f(i).size && (e(i), g(i), i.assigned_ = /* @__PURE__ */ new Map(), j(i.base_, (o) => {
+      n(i), f(i).size && (e(i), b(i), i.assigned_ = /* @__PURE__ */ new Map(), D(i.base_, (o) => {
         i.assigned_.set(o, !1);
       }), i.copy_.clear());
     }
     forEach(i, o) {
-      f(this[l]).forEach((p, m, we) => {
+      f(this[l]).forEach((d, m, Se) => {
         i.call(o, this.get(m), m, this);
       });
     }
     get(i) {
       const o = this[l];
       n(o);
-      const p = f(o).get(i);
-      if (o.finalized_ || !v(p) || p !== o.base_.get(i)) return p;
-      const m = I(p, o);
+      const d = f(o).get(i);
+      if (o.finalized_ || !g(d) || d !== o.base_.get(i)) return d;
+      const m = P(d, o);
       return e(o), o.copy_.set(i, m), m;
     }
     keys() {
@@ -490,8 +489,8 @@ function Se(t, e) {
       return { [Symbol.iterator]: () => this.entries(), next: () => {
         const o = i.next();
         if (o.done) return o;
-        const p = this.get(o.value);
-        return { done: !1, value: [o.value, p] };
+        const d = this.get(o.value);
+        return { done: !1, value: [o.value, d] };
       } };
     }
     [Symbol.iterator]() {
@@ -503,7 +502,7 @@ function Se(t, e) {
   }
   class r extends Set {
     constructor(i, o) {
-      super(), this[l] = { type_: 3, parent_: o, scope_: o ? o.scope_ : N(), modified_: !1, finalized_: !1, copy_: void 0, base_: i, draft_: this, drafts_: /* @__PURE__ */ new Map(), revoked_: !1, isManual_: !1 };
+      super(), this[l] = { type_: 3, parent_: o, scope_: o ? o.scope_ : M(), modified_: !1, finalized_: !1, copy_: void 0, base_: i, draft_: this, drafts_: /* @__PURE__ */ new Map(), revoked_: !1, isManual_: !1 };
     }
     get size() {
       return f(this[l]).size;
@@ -514,16 +513,16 @@ function Se(t, e) {
     }
     add(i) {
       const o = this[l];
-      return n(o), this.has(i) || (s(o), g(o), o.copy_.add(i)), this;
+      return n(o), this.has(i) || (s(o), b(o), o.copy_.add(i)), this;
     }
     delete(i) {
       if (!this.has(i)) return !1;
       const o = this[l];
-      return n(o), s(o), g(o), o.copy_.delete(i) || !!o.drafts_.has(i) && o.copy_.delete(o.drafts_.get(i));
+      return n(o), s(o), b(o), o.copy_.delete(i) || !!o.drafts_.has(i) && o.copy_.delete(o.drafts_.get(i));
     }
     clear() {
       const i = this[l];
-      n(i), f(i).size && (s(i), g(i), i.copy_.clear());
+      n(i), f(i).size && (s(i), b(i), i.copy_.clear());
     }
     values() {
       const i = this[l];
@@ -540,15 +539,15 @@ function Se(t, e) {
       return this.values();
     }
     forEach(i, o) {
-      const p = this.values();
-      let m = p.next();
-      for (; !m.done; ) i.call(o, m.value, m.value, this), m = p.next();
+      const d = this.values();
+      let m = d.next();
+      for (; !m.done; ) i.call(o, m.value, m.value, this), m = d.next();
     }
   }
   function s(c) {
     c.copy_ || (c.copy_ = /* @__PURE__ */ new Set(), c.base_.forEach((i) => {
-      if (v(i)) {
-        const o = I(i, c);
+      if (g(i)) {
+        const o = P(i, c);
         c.drafts_.set(i, o), c.copy_.add(o);
       } else c.copy_.add(i);
     }));
@@ -561,18 +560,18 @@ function Se(t, e) {
     return new t(c, i);
   }, proxySet_: function(c, i) {
     return new r(c, i);
-  } }, U[a = "MapSet"] || (U[a] = h);
-})(), de = $;
-class X {
+  } }, K[a = "MapSet"] || (K[a] = h);
+})(), pe = w;
+class H {
   constructor(e, r, s) {
     let n;
-    this.storageType = e, this.key = r, this[de] = !0, this._ready = !1, this._destroy$ = new pe(), this.error$ = new Q(null), n = s instanceof Map ? new Map(s) : Array.isArray(s) ? [...s] : s && typeof s == "object" ? { ...s } : s;
+    this.storageType = e, this.key = r, this[pe] = !0, this._ready = !1, this._destroy$ = new de(), this.error$ = new Q(null), n = s instanceof Map ? new Map(s) : Array.isArray(s) ? [...s] : s && typeof s == "object" ? { ...s } : s;
     try {
-      this.defaultValue = this.isImmerDraftable(n) ? d(n, (a) => a) : n;
+      this.defaultValue = this.isImmerDraftable(n) ? p(n, (a) => a) : n;
     } catch {
       this.defaultValue = n;
     }
-    this.$ = new Q(this.defaultValue), this.storage = Se(e, r), e === "memory" ? this._ready = !0 : this.initializeFromStorage();
+    this.$ = new Q(this.defaultValue), this.storage = ve(e, r), e === "memory" ? this._ready = !0 : this.initializeFromStorage();
   }
   get ready() {
     return this._ready;
@@ -584,14 +583,14 @@ class X {
     return this.$.getValue();
   }
   isImmerDraftable(e) {
-    return e !== null && typeof e == "object" && (Array.isArray(e) || e instanceof Map || e instanceof Set || Object.getPrototypeOf(e) === Object.prototype || e[$] === !0);
+    return e !== null && typeof e == "object" && (Array.isArray(e) || e instanceof Map || e instanceof Set || Object.getPrototypeOf(e) === Object.prototype || e[w] === !0);
   }
   destroy() {
     this._destroy$.next(), this._destroy$.complete(), this.$.complete(), this.error$.complete();
   }
   replace(e) {
     try {
-      const r = this.isImmerDraftable(e) ? d(e, (s) => s) : e;
+      const r = this.isImmerDraftable(e) ? p(e, (s) => s) : e;
       this.updateState(r);
     } catch (r) {
       const s = new u(`Error replacing state in ${this.key}`, r);
@@ -601,7 +600,7 @@ class X {
   updateState(e) {
     try {
       let r;
-      r = this.isImmerDraftable(e) ? d(e, (s) => s) : e, this.$.next(r), this.storageType !== "memory" && this.persistToStorage(r).catch((s) => {
+      r = this.isImmerDraftable(e) ? p(e, (s) => s) : e, this.$.next(r), this.storageType !== "memory" && this.persistToStorage(r).catch((s) => {
         const n = new u(`Error saving to ${this.storageType} storage for ${this.key}`, s);
         this.error$.next(n);
       });
@@ -616,7 +615,7 @@ class X {
       if (e) {
         const r = this.processStoredValue(e);
         try {
-          const s = this.isImmerDraftable(r) ? d(r, (n) => n) : r;
+          const s = this.isImmerDraftable(r) ? p(r, (n) => n) : r;
           this.updateState(s);
         } catch {
           this.updateState(r);
@@ -635,10 +634,10 @@ class X {
     return this.storage.save(e);
   }
 }
-const k = class k extends X {
+const x = class x extends H {
   static getInstance(e, r, s = []) {
     const n = `${e}:${r}`;
-    return this.instances.has(n) || this.instances.set(n, new k(e, r, s)), this.instances.get(n);
+    return this.instances.has(n) || this.instances.set(n, new x(e, r, s)), this.instances.get(n);
   }
   constructor(e, r, s = []) {
     super(e, r, s), e !== "memory" && this.setupPersistence();
@@ -653,7 +652,7 @@ const k = class k extends X {
   }
   push(...e) {
     try {
-      const r = d(this.value, (s) => {
+      const r = p(this.value, (s) => {
         s.push(...e.map((n) => n));
       });
       this.updateState(r), this.error$.next(null);
@@ -664,7 +663,7 @@ const k = class k extends X {
   }
   pop() {
     try {
-      const e = this.value.length > 0 ? this.value[this.value.length - 1] : void 0, r = d(this.value, (s) => {
+      const e = this.value.length > 0 ? this.value[this.value.length - 1] : void 0, r = p(this.value, (s) => {
         s.pop();
       });
       return this.updateState(r), this.error$.next(null), e;
@@ -675,7 +674,7 @@ const k = class k extends X {
   }
   unshift(...e) {
     try {
-      const r = d(this.value, (s) => {
+      const r = p(this.value, (s) => {
         s.unshift(...e.map((n) => n));
       });
       this.updateState(r), this.error$.next(null);
@@ -686,7 +685,7 @@ const k = class k extends X {
   }
   shift() {
     try {
-      const e = this.value.length > 0 ? this.value[0] : void 0, r = d(this.value, (s) => {
+      const e = this.value.length > 0 ? this.value[0] : void 0, r = p(this.value, (s) => {
         s.shift();
       });
       return this.updateState(r), this.error$.next(null), e;
@@ -697,7 +696,7 @@ const k = class k extends X {
   }
   set(e, r) {
     try {
-      const s = d(this.value, (n) => {
+      const s = p(this.value, (n) => {
         if (!(e >= 0 && e < n.length)) throw new Error(`Index ${e} out of bounds (length: ${n.length})`);
         n[e] = r;
       });
@@ -712,7 +711,7 @@ const k = class k extends X {
   }
   splice(e, r, ...s) {
     try {
-      const n = [...this.value].splice(e, r ?? 0, ...s), a = d(this.value, (h) => {
+      const n = [...this.value].splice(e, r ?? 0, ...s), a = p(this.value, (h) => {
         h.splice(e, r ?? 0, ...s.map((c) => c));
       });
       return this.updateState(a), this.error$.next(null), n;
@@ -725,7 +724,7 @@ const k = class k extends X {
     try {
       const s = r || ((a, h) => a === h), n = this.value.findIndex((a) => s(a, e));
       if (n !== -1) {
-        const a = d(this.value, (h) => {
+        const a = p(this.value, (h) => {
           h.splice(n, 1);
         });
         return this.updateState(a), this.error$.next(null), !0;
@@ -738,7 +737,7 @@ const k = class k extends X {
   }
   replace(e) {
     try {
-      const r = d(e, (s) => s);
+      const r = p(e, (s) => s);
       this.updateState(r), this.error$.next(null);
     } catch (r) {
       const s = new u(`Error replacing array in ${this.key}`, r);
@@ -747,7 +746,7 @@ const k = class k extends X {
   }
   filter(e) {
     try {
-      const r = this.value.filter(e), s = d(this.value, (n) => {
+      const r = this.value.filter(e), s = p(this.value, (n) => {
         n.length = 0, n.push(...r.map((a) => a));
       });
       this.updateState(s), this.error$.next(null);
@@ -761,7 +760,7 @@ const k = class k extends X {
   }
   sort(e) {
     try {
-      const r = [...this.value].sort(e), s = d(this.value, (n) => {
+      const r = [...this.value].sort(e), s = p(this.value, (n) => {
         n.length = 0, n.push(...r.map((a) => a));
       });
       this.updateState(s), this.error$.next(null);
@@ -772,7 +771,7 @@ const k = class k extends X {
   }
   update(e, r) {
     try {
-      const s = d(this.value, (n) => {
+      const s = p(this.value, (n) => {
         if (!(e >= 0 && e < n.length)) throw new Error(`Index ${e} out of bounds (length: ${n.length})`);
         r(n[e]);
       });
@@ -792,16 +791,16 @@ const k = class k extends X {
     } });
   }
 };
-k.type = "array", k.instances = /* @__PURE__ */ new Map();
-let ne = k;
-const O = class O extends X {
+x.type = "array", x.instances = /* @__PURE__ */ new Map();
+let ne = x;
+const k = class k extends H {
   static getInstance(e, r, s) {
     const n = `${e}:${r}`;
-    return this.instances.has(n) || this.instances.set(n, new O(e, r, s)), this.instances.get(n);
+    return this.instances.has(n) || this.instances.set(n, new k(e, r, s)), this.instances.get(n);
   }
   set(e, r) {
     try {
-      const s = d(this.value, (n) => {
+      const s = p(this.value, (n) => {
         if (typeof e == "string") {
           if (r === void 0) throw new Error("Value is required when setting a single key");
           n.set(e, r);
@@ -826,7 +825,7 @@ const O = class O extends X {
   }
   delete(e) {
     try {
-      const r = d(this.value, (s) => {
+      const r = p(this.value, (s) => {
         s.delete(e);
       });
       this.updateState(r), this.error$.next(null);
@@ -840,7 +839,7 @@ const O = class O extends X {
   }
   batchUpdate(e) {
     try {
-      const r = d(this.value, (s) => {
+      const r = p(this.value, (s) => {
         Object.entries(e).forEach(([n, a]) => {
           s.set(n, a);
         });
@@ -853,7 +852,7 @@ const O = class O extends X {
   }
   update(e, r) {
     try {
-      const s = d(this.value, (n) => {
+      const s = p(this.value, (n) => {
         const a = n.get(e);
         a !== void 0 && r(a);
       });
@@ -881,15 +880,15 @@ const O = class O extends X {
     } });
   }
 };
-O.type = "collection", O.instances = /* @__PURE__ */ new Map();
-let ie = O;
-const D = class D extends (se = X, re = $, se) {
+k.type = "collection", k.instances = /* @__PURE__ */ new Map();
+let ie = k;
+const O = class O extends (se = H, re = w, se) {
   constructor() {
     super(...arguments), this[re] = !0;
   }
   static getInstance(e, r, s) {
     const n = `${e}:${r}`;
-    return this.instances.has(n) || this.instances.set(n, new D(e, r, s)), this.instances.get(n);
+    return this.instances.has(n) || this.instances.set(n, new O(e, r, s)), this.instances.get(n);
   }
   set(e, r = !0) {
     try {
@@ -897,7 +896,7 @@ const D = class D extends (se = X, re = $, se) {
         const n = r ? { ...this.value, ...e } : e;
         return this.updateState(n), void this.error$.next(null);
       }
-      const s = d(this.value, (n) => {
+      const s = p(this.value, (n) => {
         if (r) {
           if (e == null) return;
           try {
@@ -927,7 +926,7 @@ const D = class D extends (se = X, re = $, se) {
   clear() {
     try {
       if (this.isImmerDraftable(this.defaultValue)) {
-        const e = d(this.defaultValue, (r) => r);
+        const e = p(this.defaultValue, (r) => r);
         this.set(e, !1);
       } else this.set(this.defaultValue, !1);
     } catch (e) {
@@ -941,7 +940,7 @@ const D = class D extends (se = X, re = $, se) {
         const s = { ...this.value };
         return delete s[e], void this.updateState(s);
       }
-      const r = d(this.value, (s) => {
+      const r = p(this.value, (s) => {
         delete s[e];
       });
       this.updateState(r);
@@ -967,7 +966,7 @@ const D = class D extends (se = X, re = $, se) {
         }
         return h[n[n.length - 1]] = r, void this.updateState(a);
       }
-      const s = d(this.value, (n) => {
+      const s = p(this.value, (n) => {
         const a = e.split(".");
         let h = n;
         for (let i = 0; i < a.length - 1; i++) {
@@ -999,7 +998,7 @@ const D = class D extends (se = X, re = $, se) {
   }
   processStoredValue(e) {
     try {
-      return this.isImmerDraftable(this.defaultValue) && this.isImmerDraftable(e) ? d(this.defaultValue, (r) => {
+      return this.isImmerDraftable(this.defaultValue) && this.isImmerDraftable(e) ? p(this.defaultValue, (r) => {
         Object.assign(r, e);
       }) : { ...this.defaultValue, ...e };
     } catch {
@@ -1013,21 +1012,21 @@ const D = class D extends (se = X, re = $, se) {
     } });
   }
   isImmerDraftable(e) {
-    return e !== null && typeof e == "object" && (super.isImmerDraftable(e) || e[$] === !0);
+    return e !== null && typeof e == "object" && (super.isImmerDraftable(e) || e[w] === !0);
   }
 };
-D.type = "object", D.instances = /* @__PURE__ */ new Map();
-let ae = D;
+O.type = "object", O.instances = /* @__PURE__ */ new Map();
+let ae = O;
 export {
-  X as B,
+  H as B,
   q as I,
-  ge as L,
+  be as L,
   me as M,
   ne as S,
   ae as a,
-  ve as b,
-  Se as c,
+  ge as b,
+  ve as c,
   u as d,
   ie as e
 };
-//# sourceMappingURL=context-object-u5gBaozZ.js.map
+//# sourceMappingURL=context-object-BE1o2XB3.js.map