@ynput/ayon-frontend-shared 0.3.25 → 0.3.27

package/dist/node_modules/immer/dist/immer.es.js

@@ -1,4 +1,4 @@
-var pe = /* @__PURE__ */ Symbol.for("immer-nothing"), U = /* @__PURE__ */ Symbol.for("immer-draftable"), g = /* @__PURE__ */ Symbol.for("immer-state"), ze = process.env.NODE_ENV !== "production" ? [
+var ye = /* @__PURE__ */ Symbol.for("immer-nothing"), x = /* @__PURE__ */ Symbol.for("immer-draftable"), g = /* @__PURE__ */ Symbol.for("immer-state"), Ce = process.env.NODE_ENV !== "production" ? [
   // All error codes, starting by 0:
   function(e) {
     return `The plugin for '${e}' has not been loaded into Immer. To enable the plugin, import and call \`enable${e}()\` when initializing your application.`;
@@ -31,118 +31,123 @@ var pe = /* @__PURE__ */ Symbol.for("immer-nothing"), U = /* @__PURE__ */ Symbol
 ] : [];
 function m(e, ...t) {
   if (process.env.NODE_ENV !== "production") {
-    const r = ze[e], n = D(r) ? r.apply(null, t) : r;
+    const r = Ce[e], n = F(r) ? r.apply(null, t) : r;
     throw new Error(`[Immer] ${n}`);
   }
   throw new Error(
     `[Immer] minified error nr: ${e}. Full error at: https://bit.ly/3cXEKWf`
   );
 }
-var v = Object, I = v.getPrototypeOf, $ = "constructor", Y = "prototype", ae = "configurable", j = "enumerable", Q = "writable", W = "value", z = (e) => !!e && !!e[g];
-function C(e) {
-  return e ? Ce(e) || H(e) || !!e[U] || !!e[$]?.[U] || X(e) || q(e) : !1;
+var v = Object, D = v.getPrototypeOf, L = "constructor", K = "prototype", ue = "configurable", j = "enumerable", Q = "writable", W = "value", z = (e) => !!e && !!e[g];
+function I(e) {
+  return e ? Ee(e) || H(e) || !!e[x] || !!e[L]?.[x] || X(e) || q(e) : !1;
 }
-var Ne = v[Y][$].toString(), ge = /* @__PURE__ */ new WeakMap();
-function Ce(e) {
-  if (!e || !T(e))
+var Te = v[K][L].toString(), Se = /* @__PURE__ */ new WeakMap();
+function Ee(e) {
+  if (!e || !V(e))
     return !1;
-  const t = I(e);
-  if (t === null || t === v[Y])
+  const t = D(e);
+  if (t === null || t === v[K])
     return !0;
-  const r = v.hasOwnProperty.call(t, $) && t[$];
+  const r = v.hasOwnProperty.call(t, L) && t[L];
   if (r === Object)
     return !0;
-  if (!D(r))
+  if (!F(r))
     return !1;
-  let n = ge.get(r);
-  return n === void 0 && (n = Function.toString.call(r), ge.set(r, n)), n === Ne;
+  let n = Se.get(r);
+  return n === void 0 && (n = Function.toString.call(r), Se.set(r, n)), n === Te;
 }
-function qe(e) {
+function Ze(e) {
   return z(e) || m(15, e), e[g].base_;
 }
-function V(e, t, r = !0) {
-  A(e) === 0 ? (r ? Reflect.ownKeys(e) : v.keys(e)).forEach((i) => {
+function Y(e, t, r = !0) {
+  M(e) === 0 ? (r ? Reflect.ownKeys(e) : v.keys(e)).forEach((i) => {
     t(i, e[i], e);
   }) : e.forEach((n, i) => t(i, n, e));
 }
-function A(e) {
+function M(e) {
   const t = e[g];
   return t ? t.type_ : H(e) ? 1 : X(e) ? 2 : q(e) ? 3 : 0;
 }
-var L = (e, t, r = A(e)) => r === 2 ? e.has(t) : v[Y].hasOwnProperty.call(e, t), E = (e, t, r = A(e)) => (
+var U = (e, t, r = M(e)) => r === 2 ? e.has(t) : v[K].hasOwnProperty.call(e, t), A = (e, t, r = M(e)) => (
   // @ts-ignore
   r === 2 ? e.get(t) : e[t]
-), ee = (e, t, r, n = A(e)) => {
+), ee = (e, t, r, n = M(e)) => {
   n === 2 ? e.set(t, r) : n === 3 ? e.add(r) : e[t] = r;
 };
-function Re(e, t) {
+function Ve(e, t) {
   return e === t ? e !== 0 || 1 / e === 1 / t : e !== e && t !== t;
 }
-var H = Array.isArray, X = (e) => e instanceof Map, q = (e) => e instanceof Set, T = (e) => typeof e == "object", D = (e) => typeof e == "function", ce = (e) => typeof e == "boolean", Te = (e) => T(e) ? e?.[g] : null, k = (e) => e.copy_ || e.base_, he = (e) => e.modified_ ? e.copy_ : e.base_;
-function fe(e, t) {
+var H = Array.isArray, X = (e) => e instanceof Map, q = (e) => e instanceof Set, V = (e) => typeof e == "object", F = (e) => typeof e == "function", ae = (e) => typeof e == "boolean";
+function xe(e) {
+  const t = +e;
+  return Number.isInteger(t) && String(t) === e;
+}
+var Ue = (e) => V(e) ? e?.[g] : null, C = (e) => e.copy_ || e.base_, me = (e) => e.modified_ ? e.copy_ : e.base_;
+function le(e, t) {
   if (X(e))
     return new Map(e);
   if (q(e))
     return new Set(e);
   if (H(e))
-    return Array[Y].slice.call(e);
-  const r = Ce(e);
+    return Array[K].slice.call(e);
+  const r = Ee(e);
   if (t === !0 || t === "class_only" && !r) {
     const n = v.getOwnPropertyDescriptors(e);
     delete n[g];
     let i = Reflect.ownKeys(n);
-    for (let c = 0; c < i.length; c++) {
-      const _ = i[c], p = n[_];
-      p[Q] === !1 && (p[Q] = !0, p[ae] = !0), (p.get || p.set) && (n[_] = {
-        [ae]: !0,
+    for (let o = 0; o < i.length; o++) {
+      const u = i[o], _ = n[u];
+      _[Q] === !1 && (_[Q] = !0, _[ue] = !0), (_.get || _.set) && (n[u] = {
+        [ue]: !0,
         [Q]: !0,
         // could live with !!desc.set as well here...
-        [j]: p[j],
-        [W]: e[_]
+        [j]: _[j],
+        [W]: e[u]
       });
     }
-    return v.create(I(e), n);
+    return v.create(D(e), n);
   } else {
-    const n = I(e);
+    const n = D(e);
     if (n !== null && r)
       return { ...e };
     const i = v.create(n);
     return v.assign(i, e);
   }
 }
-function ye(e, t = !1) {
-  return ie(e) || z(e) || !C(e) || (A(e) > 1 && v.defineProperties(e, {
+function ge(e, t = !1) {
+  return ce(e) || z(e) || !I(e) || (M(e) > 1 && v.defineProperties(e, {
     set: J,
     add: J,
     clear: J,
     delete: J
-  }), v.freeze(e), t && V(
+  }), v.freeze(e), t && Y(
     e,
     (r, n) => {
-      ye(n, !0);
+      ge(n, !0);
     },
     !1
   )), e;
 }
-function Me() {
+function Le() {
   m(2);
 }
 var J = {
-  [W]: Me
+  [W]: Le
 };
-function ie(e) {
-  return e === null || !T(e) ? !0 : v.isFrozen(e);
+function ce(e) {
+  return e === null || !V(e) ? !0 : v.isFrozen(e);
 }
-var te = "MapSet", re = "Patches", ne = {};
-function M(e) {
+var te = "MapSet", re = "Patches", ve = "ArrayMethods", ne = {};
+function b(e) {
   const t = ne[e];
   return t || m(0, e), t;
 }
-var Ve = (e) => !!ne[e];
-function xe(e, t) {
+var we = (e) => !!ne[e];
+function We(e, t) {
   ne[e] || (ne[e] = t);
 }
-var B, Ee = () => B, Ue = (e, t) => ({
+var $, ke = () => $, $e = (e, t) => ({
   drafts_: [],
   parent_: e,
   immer_: t,
@@ -152,27 +157,28 @@ var B, Ee = () => B, Ue = (e, t) => ({
   unfinalizedDrafts_: 0,
   handledSet_: /* @__PURE__ */ new Set(),
   processedForPatches_: /* @__PURE__ */ new Set(),
-  mapSetPlugin_: Ve(te) ? M(te) : void 0
+  mapSetPlugin_: we(te) ? b(te) : void 0,
+  arrayMethodsPlugin_: we(ve) ? b(ve) : void 0
 });
-function ve(e, t) {
-  t && (e.patchPlugin_ = M(re), e.patches_ = [], e.inversePatches_ = [], e.patchListener_ = t);
+function Oe(e, t) {
+  t && (e.patchPlugin_ = b(re), e.patches_ = [], e.inversePatches_ = [], e.patchListener_ = t);
 }
-function ue(e) {
-  le(e), e.drafts_.forEach(Le), e.drafts_ = null;
+function de(e) {
+  _e(e), e.drafts_.forEach(Be), e.drafts_ = null;
 }
-function le(e) {
-  e === B && (B = e.parent_);
+function _e(e) {
+  e === $ && ($ = e.parent_);
 }
-var Se = (e) => B = Ue(B, e);
-function Le(e) {
+var ze = (e) => $ = $e($, e);
+function Be(e) {
   const t = e[g];
   t.type_ === 0 || t.type_ === 1 ? t.revoke_() : t.revoked_ = !0;
 }
-function we(e, t) {
+function Ie(e, t) {
   t.unfinalizedDrafts_ = t.drafts_.length;
   const r = t.drafts_[0];
   if (e !== void 0 && e !== r) {
-    r[g].modified_ && (ue(t), m(4)), C(e) && (e = Oe(t, e));
+    r[g].modified_ && (de(t), m(4)), I(e) && (e = Ae(t, e));
     const { patchPlugin_: i } = t;
     i && i.generateReplacementPatches_(
       r[g].base_,
@@ -180,16 +186,16 @@ function we(e, t) {
       t
     );
   } else
-    e = Oe(t, r);
-  return $e(t, e, !0), ue(t), t.patches_ && t.patchListener_(t.patches_, t.inversePatches_), e !== pe ? e : void 0;
+    e = Ae(t, r);
+  return Ge(t, e, !0), de(t), t.patches_ && t.patchListener_(t.patches_, t.inversePatches_), e !== ye ? e : void 0;
 }
-function Oe(e, t) {
-  if (ie(t))
+function Ae(e, t) {
+  if (ce(t))
     return t;
   const r = t[g];
   if (!r)
-    return me(t, e.handledSet_, e);
-  if (!oe(r, e))
+    return ie(t, e.handledSet_, e);
+  if (!se(r, e))
     return t;
   if (!r.modified_)
     return r.base_;
@@ -198,90 +204,90 @@ function Oe(e, t) {
     if (n)
       for (; n.length > 0; )
         n.pop()(e);
-    De(r, e);
+    Me(r, e);
   }
   return r.copy_;
 }
-function $e(e, t, r = !1) {
-  !e.parent_ && e.immer_.autoFreeze_ && e.canAutoFreeze_ && ye(t, r);
+function Ge(e, t, r = !1) {
+  !e.parent_ && e.immer_.autoFreeze_ && e.canAutoFreeze_ && ge(t, r);
 }
-function ke(e) {
+function Fe(e) {
   e.finalized_ = !0, e.scope_.unfinalizedDrafts_--;
 }
-var oe = (e, t) => e.scope_ === t, We = [];
-function Fe(e, t, r, n) {
-  const i = k(e), c = e.type_;
-  if (n !== void 0 && E(i, n, c) === t) {
-    ee(i, n, r, c);
+var se = (e, t) => e.scope_ === t, Ke = [];
+function De(e, t, r, n) {
+  const i = C(e), o = e.type_;
+  if (n !== void 0 && A(i, n, o) === t) {
+    ee(i, n, r, o);
     return;
   }
   if (!e.draftLocations_) {
-    const p = e.draftLocations_ = /* @__PURE__ */ new Map();
-    V(i, (S, w) => {
-      if (z(w)) {
-        const b = p.get(w) || [];
-        b.push(S), p.set(w, b);
+    const _ = e.draftLocations_ = /* @__PURE__ */ new Map();
+    Y(i, (w, O) => {
+      if (z(O)) {
+        const N = _.get(O) || [];
+        N.push(w), _.set(O, N);
       }
     });
   }
-  const _ = e.draftLocations_.get(t) ?? We;
-  for (const p of _)
-    ee(i, p, r, c);
+  const u = e.draftLocations_.get(t) ?? Ke;
+  for (const _ of u)
+    ee(i, _, r, o);
 }
-function Be(e, t, r) {
+function Ye(e, t, r) {
   e.callbacks_.push(function(i) {
-    const c = t;
-    if (!c || !oe(c, i))
+    const o = t;
+    if (!o || !se(o, i))
       return;
-    i.mapSetPlugin_?.fixSetContents(c);
-    const _ = he(c);
-    Fe(e, c.draft_ ?? c, _, r), De(c, i);
+    i.mapSetPlugin_?.fixSetContents(o);
+    const u = me(o);
+    De(e, o.draft_ ?? o, u, r), Me(o, i);
   });
 }
-function De(e, t) {
-  if (e.modified_ && !e.finalized_ && (e.type_ === 3 || (e.assigned_?.size ?? 0) > 0)) {
+function Me(e, t) {
+  if (e.modified_ && !e.finalized_ && (e.type_ === 3 || e.type_ === 1 && e.allIndicesReassigned_ || (e.assigned_?.size ?? 0) > 0)) {
     const { patchPlugin_: n } = t;
     if (n) {
       const i = n.getPath(e);
       i && n.generatePatches_(e, i, t);
     }
-    ke(e);
+    Fe(e);
   }
 }
-function Ge(e, t, r) {
+function He(e, t, r) {
   const { scope_: n } = e;
   if (z(r)) {
     const i = r[g];
-    oe(i, n) && i.callbacks_.push(function() {
+    se(i, n) && i.callbacks_.push(function() {
       Z(e);
-      const _ = he(i);
-      Fe(e, r, _, t);
+      const u = me(i);
+      De(e, r, u, t);
     });
-  } else C(r) && e.callbacks_.push(function() {
-    const c = k(e);
-    E(c, t, e.type_) === r && n.drafts_.length > 1 && (e.assigned_.get(t) ?? !1) === !0 && e.copy_ && me(
-      E(e.copy_, t, e.type_),
+  } else I(r) && e.callbacks_.push(function() {
+    const o = C(e);
+    e.type_ === 3 ? o.has(r) && ie(r, n.handledSet_, n) : A(o, t, e.type_) === r && n.drafts_.length > 1 && (e.assigned_.get(t) ?? !1) === !0 && e.copy_ && ie(
+      A(e.copy_, t, e.type_),
       n.handledSet_,
       n
     );
   });
 }
-function me(e, t, r) {
-  return !r.immer_.autoFreeze_ && r.unfinalizedDrafts_ < 1 || z(e) || t.has(e) || !C(e) || ie(e) || (t.add(e), V(e, (n, i) => {
+function ie(e, t, r) {
+  return !r.immer_.autoFreeze_ && r.unfinalizedDrafts_ < 1 || z(e) || t.has(e) || !I(e) || ce(e) || (t.add(e), Y(e, (n, i) => {
     if (z(i)) {
-      const c = i[g];
-      if (oe(c, r)) {
-        const _ = he(c);
-        ee(e, n, _, e.type_), ke(c);
+      const o = i[g];
+      if (se(o, r)) {
+        const u = me(o);
+        ee(e, n, u, e.type_), Fe(o);
       }
-    } else C(i) && me(i, t, r);
+    } else I(i) && ie(i, t, r);
   })), e;
 }
-function Ke(e, t) {
+function Xe(e, t) {
   const r = H(e), n = {
     type_: r ? 1 : 0,
     // Track which produce call this is associated with.
-    scope_: t ? t.scope_ : Ee(),
+    scope_: t ? t.scope_ : ke(),
     // True for both shallow and deep changes.
     modified_: !1,
     // Used during finalization.
@@ -304,60 +310,66 @@ function Ke(e, t) {
     // `callbacks` actually gets assigned in `createProxy`
     callbacks_: void 0
   };
-  let i = n, c = Pe;
-  r && (i = [n], c = G);
-  const { revoke: _, proxy: p } = Proxy.revocable(i, c);
-  return n.draft_ = p, n.revoke_ = _, [p, n];
+  let i = n, o = oe;
+  r && (i = [n], o = B);
+  const { revoke: u, proxy: _ } = Proxy.revocable(i, o);
+  return n.draft_ = _, n.revoke_ = u, [_, n];
 }
-var Pe = {
+var oe = {
   get(e, t) {
     if (t === g)
       return e;
-    const r = k(e);
-    if (!L(r, t, e.type_))
-      return Ye(e, r, t);
-    const n = r[t];
-    if (e.finalized_ || !C(n))
-      return n;
-    if (n === se(e.base_, t)) {
+    let r = e.scope_.arrayMethodsPlugin_;
+    const n = e.type_ === 1 && typeof t == "string";
+    if (n && r?.isArrayOperationMethod(t))
+      return r.createMethodInterceptor(e, t);
+    const i = C(e);
+    if (!U(i, t, e.type_))
+      return qe(e, i, t);
+    const o = i[t];
+    if (e.finalized_ || !I(o) || n && e.operationMethod && r?.isMutatingArrayMethod(
+      e.operationMethod
+    ) && xe(t))
+      return o;
+    if (o === fe(e.base_, t)) {
       Z(e);
-      const i = e.type_ === 1 ? +t : t, c = de(e.scope_, n, e, i);
-      return e.copy_[i] = c;
+      const u = e.type_ === 1 ? +t : t, _ = he(e.scope_, o, e, u);
+      return e.copy_[u] = _;
     }
-    return n;
+    return o;
   },
   has(e, t) {
-    return t in k(e);
+    return t in C(e);
   },
   ownKeys(e) {
-    return Reflect.ownKeys(k(e));
+    return Reflect.ownKeys(C(e));
   },
   set(e, t, r) {
-    const n = Ie(k(e), t);
+    const n = be(C(e), t);
     if (n?.set)
       return n.set.call(e.draft_, r), !0;
     if (!e.modified_) {
-      const i = se(k(e), t), c = i?.[g];
-      if (c && c.base_ === r)
+      const i = fe(C(e), t), o = i?.[g];
+      if (o && o.base_ === r)
         return e.copy_[t] = r, e.assigned_.set(t, !1), !0;
-      if (Re(r, i) && (r !== void 0 || L(e.base_, t, e.type_)))
+      if (Ve(r, i) && (r !== void 0 || U(e.base_, t, e.type_)))
         return !0;
-      Z(e), _e(e);
+      Z(e), pe(e);
     }
     return e.copy_[t] === r && // special case: handle new props with value 'undefined'
     (r !== void 0 || t in e.copy_) || // special case: NaN
-    Number.isNaN(r) && Number.isNaN(e.copy_[t]) || (e.copy_[t] = r, e.assigned_.set(t, !0), Ge(e, t, r)), !0;
+    Number.isNaN(r) && Number.isNaN(e.copy_[t]) || (e.copy_[t] = r, e.assigned_.set(t, !0), He(e, t, r)), !0;
   },
   deleteProperty(e, t) {
-    return Z(e), se(e.base_, t) !== void 0 || t in e.base_ ? (e.assigned_.set(t, !1), _e(e)) : e.assigned_.delete(t), e.copy_ && delete e.copy_[t], !0;
+    return Z(e), fe(e.base_, t) !== void 0 || t in e.base_ ? (e.assigned_.set(t, !1), pe(e)) : e.assigned_.delete(t), e.copy_ && delete e.copy_[t], !0;
   },
   // Note: We never coerce `desc.value` into an Immer draft, because we can't make
   // the same guarantee in ES5 mode.
   getOwnPropertyDescriptor(e, t) {
-    const r = k(e), n = Reflect.getOwnPropertyDescriptor(r, t);
+    const r = C(e), n = Reflect.getOwnPropertyDescriptor(r, t);
     return n && {
       [Q]: !0,
-      [ae]: e.type_ !== 1 || t !== "length",
+      [ue]: e.type_ !== 1 || t !== "length",
       [j]: n[j],
       [W]: r[t]
     };
@@ -366,108 +378,109 @@ var Pe = {
     m(11);
   },
   getPrototypeOf(e) {
-    return I(e.base_);
+    return D(e.base_);
   },
   setPrototypeOf() {
     m(12);
   }
-}, G = {};
-V(Pe, (e, t) => {
-  G[e] = function() {
+}, B = {};
+for (let e in oe) {
+  let t = oe[e];
+  B[e] = function() {
     const r = arguments;
     return r[0] = r[0][0], t.apply(this, r);
   };
-});
-G.deleteProperty = function(e, t) {
-  return process.env.NODE_ENV !== "production" && isNaN(parseInt(t)) && m(13), G.set.call(this, e, t, void 0);
+}
+B.deleteProperty = function(e, t) {
+  return process.env.NODE_ENV !== "production" && isNaN(parseInt(t)) && m(13), B.set.call(this, e, t, void 0);
 };
-G.set = function(e, t, r) {
-  return process.env.NODE_ENV !== "production" && t !== "length" && isNaN(parseInt(t)) && m(14), Pe.set.call(this, e[0], t, r, e[0]);
+B.set = function(e, t, r) {
+  return process.env.NODE_ENV !== "production" && t !== "length" && isNaN(parseInt(t)) && m(14), oe.set.call(this, e[0], t, r, e[0]);
 };
-function se(e, t) {
+function fe(e, t) {
   const r = e[g];
-  return (r ? k(r) : e)[t];
+  return (r ? C(r) : e)[t];
 }
-function Ye(e, t, r) {
-  const n = Ie(t, r);
+function qe(e, t, r) {
+  const n = be(t, r);
   return n ? W in n ? n[W] : (
     // This is a very special case, if the prop is a getter defined by the
     // prototype, we should invoke it with the draft as context!
     n.get?.call(e.draft_)
   ) : void 0;
 }
-function Ie(e, t) {
+function be(e, t) {
   if (!(t in e))
     return;
-  let r = I(e);
+  let r = D(e);
   for (; r; ) {
     const n = Object.getOwnPropertyDescriptor(r, t);
     if (n)
       return n;
-    r = I(r);
+    r = D(r);
   }
 }
-function _e(e) {
-  e.modified_ || (e.modified_ = !0, e.parent_ && _e(e.parent_));
+function pe(e) {
+  e.modified_ || (e.modified_ = !0, e.parent_ && pe(e.parent_));
 }
 function Z(e) {
-  e.copy_ || (e.assigned_ = /* @__PURE__ */ new Map(), e.copy_ = fe(
+  e.copy_ || (e.assigned_ = /* @__PURE__ */ new Map(), e.copy_ = le(
     e.base_,
     e.scope_.immer_.useStrictShallowCopy_
   ));
 }
-var He = class {
+var Je = class {
   constructor(e) {
     this.autoFreeze_ = !0, this.useStrictShallowCopy_ = !1, this.useStrictIteration_ = !1, this.produce = (t, r, n) => {
-      if (D(t) && !D(r)) {
-        const c = r;
+      if (F(t) && !F(r)) {
+        const o = r;
         r = t;
-        const _ = this;
-        return function(S = c, ...w) {
-          return _.produce(S, (b) => r.call(this, b, ...w));
+        const u = this;
+        return function(w = o, ...O) {
+          return u.produce(w, (N) => r.call(this, N, ...O));
         };
       }
-      D(r) || m(6), n !== void 0 && !D(n) && m(7);
+      F(r) || m(6), n !== void 0 && !F(n) && m(7);
       let i;
-      if (C(t)) {
-        const c = Se(this), _ = de(c, t, void 0);
-        let p = !0;
+      if (I(t)) {
+        const o = ze(this), u = he(o, t, void 0);
+        let _ = !0;
         try {
-          i = r(_), p = !1;
+          i = r(u), _ = !1;
         } finally {
-          p ? ue(c) : le(c);
+          _ ? de(o) : _e(o);
         }
-        return ve(c, n), we(i, c);
-      } else if (!t || !T(t)) {
-        if (i = r(t), i === void 0 && (i = t), i === pe && (i = void 0), this.autoFreeze_ && ye(i, !0), n) {
-          const c = [], _ = [];
-          M(re).generateReplacementPatches_(t, i, {
-            patches_: c,
-            inversePatches_: _
-          }), n(c, _);
+        return Oe(o, n), Ie(i, o);
+      } else if (!t || !V(t)) {
+        if (i = r(t), i === void 0 && (i = t), i === ye && (i = void 0), this.autoFreeze_ && ge(i, !0), n) {
+          const o = [], u = [];
+          b(re).generateReplacementPatches_(t, i, {
+            patches_: o,
+            inversePatches_: u
+          }), n(o, u);
         }
         return i;
       } else
         m(1, t);
     }, this.produceWithPatches = (t, r) => {
-      if (D(t))
-        return (_, ...p) => this.produceWithPatches(_, (S) => t(S, ...p));
+      if (F(t))
+        return (u, ..._) => this.produceWithPatches(u, (w) => t(w, ..._));
       let n, i;
-      return [this.produce(t, r, (_, p) => {
-        n = _, i = p;
+      return [this.produce(t, r, (u, _) => {
+        n = u, i = _;
       }), n, i];
-    }, ce(e?.autoFreeze) && this.setAutoFreeze(e.autoFreeze), ce(e?.useStrictShallowCopy) && this.setUseStrictShallowCopy(e.useStrictShallowCopy), ce(e?.useStrictIteration) && this.setUseStrictIteration(e.useStrictIteration);
+    }, ae(e?.autoFreeze) && this.setAutoFreeze(e.autoFreeze), ae(e?.useStrictShallowCopy) && this.setUseStrictShallowCopy(e.useStrictShallowCopy), ae(e?.useStrictIteration) && this.setUseStrictIteration(e.useStrictIteration);
   }
   createDraft(e) {
-    C(e) || m(8), z(e) && (e = Xe(e));
-    const t = Se(this), r = de(t, e, void 0);
-    return r[g].isManual_ = !0, le(t), r;
+    I(e) || m(8), z(e) && (e = Qe(e));
+    const t = ze(this), r = he(t, e, void 0);
+    return r[g].isManual_ = !0, _e(t), r;
   }
   finishDraft(e, t) {
     const r = e && e[g];
     (!r || !r.isManual_) && m(9);
     const { scope_: n } = r;
-    return ve(n, t), we(void 0, n);
+    return Oe(n, t), Ie(void 0, n);
   }
   /**
    * Pass true to automatically freeze all copies created by Immer.
@@ -507,308 +520,309 @@ var He = class {
       }
     }
     r > -1 && (t = t.slice(r + 1));
-    const n = M(re).applyPatches_;
+    const n = b(re).applyPatches_;
     return z(e) ? n(e, t) : this.produce(
       e,
       (i) => n(i, t)
     );
   }
 };
-function de(e, t, r, n) {
-  const [i, c] = X(t) ? M(te).proxyMap_(t, r) : q(t) ? M(te).proxySet_(t, r) : Ke(t, r);
-  return (r?.scope_ ?? Ee()).drafts_.push(i), c.callbacks_ = r?.callbacks_ ?? [], c.key_ = n, r && n !== void 0 ? Be(r, c, n) : c.callbacks_.push(function(S) {
-    S.mapSetPlugin_?.fixSetContents(c);
-    const { patchPlugin_: w } = S;
-    c.modified_ && w && w.generatePatches_(c, [], S);
+function he(e, t, r, n) {
+  const [i, o] = X(t) ? b(te).proxyMap_(t, r) : q(t) ? b(te).proxySet_(t, r) : Xe(t, r);
+  return (r?.scope_ ?? ke()).drafts_.push(i), o.callbacks_ = r?.callbacks_ ?? [], o.key_ = n, r && n !== void 0 ? Ye(r, o, n) : o.callbacks_.push(function(w) {
+    w.mapSetPlugin_?.fixSetContents(o);
+    const { patchPlugin_: O } = w;
+    o.modified_ && O && O.generatePatches_(o, [], w);
   }), i;
 }
-function Xe(e) {
-  return z(e) || m(10, e), Ae(e);
+function Qe(e) {
+  return z(e) || m(10, e), Ne(e);
 }
-function Ae(e) {
-  if (!C(e) || ie(e))
+function Ne(e) {
+  if (!I(e) || ce(e))
     return e;
   const t = e[g];
   let r, n = !0;
   if (t) {
     if (!t.modified_)
       return t.base_;
-    t.finalized_ = !0, r = fe(e, t.scope_.immer_.useStrictShallowCopy_), n = t.scope_.immer_.shouldUseStrictIteration();
+    t.finalized_ = !0, r = le(e, t.scope_.immer_.useStrictShallowCopy_), n = t.scope_.immer_.shouldUseStrictIteration();
   } else
-    r = fe(e, !0);
-  return V(
+    r = le(e, !0);
+  return Y(
     r,
-    (i, c) => {
-      ee(r, i, Ae(c));
+    (i, o) => {
+      ee(r, i, Ne(o));
     },
     n
   ), t && (t.finalized_ = !1), r;
 }
-function Je() {
-  process.env.NODE_ENV !== "production" && ze.push(
+function je() {
+  process.env.NODE_ENV !== "production" && Ce.push(
     'Sets cannot have "replace" patches.',
-    function(o) {
-      return "Unsupported patch operation: " + o;
+    function(c) {
+      return "Unsupported patch operation: " + c;
     },
-    function(o) {
-      return "Cannot apply patch, path doesn't resolve: " + o;
+    function(c) {
+      return "Cannot apply patch, path doesn't resolve: " + c;
     },
     "Patching reserved attributes like __proto__, prototype and constructor is not allowed"
   );
-  function t(o, f = []) {
-    if ("key_" in o && o.key_ !== void 0) {
-      const a = o.parent_.copy_ ?? o.parent_.base_, u = Te(E(a, o.key_)), l = E(a, o.key_);
-      if (l === void 0 || l !== o.draft_ && l !== o.base_ && l !== o.copy_ || u != null && u.base_ !== o.base_)
+  function t(c, f = []) {
+    if (c.key_ !== void 0) {
+      const s = c.parent_.copy_ ?? c.parent_.base_, l = Ue(A(s, c.key_)), d = A(s, c.key_);
+      if (d === void 0 || d !== c.draft_ && d !== c.base_ && d !== c.copy_ || l != null && l.base_ !== c.base_)
         return null;
-      const d = o.parent_.type_ === 3;
+      const p = c.parent_.type_ === 3;
       let h;
-      if (d) {
-        const s = o.parent_;
-        h = Array.from(s.drafts_.keys()).indexOf(o.key_);
+      if (p) {
+        const y = c.parent_;
+        h = Array.from(y.drafts_.keys()).indexOf(c.key_);
       } else
-        h = o.key_;
-      if (!(d && a.size > h || L(a, h)))
+        h = c.key_;
+      if (!(p && s.size > h || U(s, h)))
         return null;
       f.push(h);
     }
-    if (o.parent_)
-      return t(o.parent_, f);
+    if (c.parent_)
+      return t(c.parent_, f);
     f.reverse();
     try {
-      r(o.copy_, f);
+      r(c.copy_, f);
     } catch {
       return null;
     }
     return f;
   }
-  function r(o, f) {
-    let a = o;
-    for (let u = 0; u < f.length - 1; u++) {
-      const l = f[u];
-      if (a = E(a, l), !T(a) || a === null)
+  function r(c, f) {
+    let s = c;
+    for (let l = 0; l < f.length - 1; l++) {
+      const d = f[l];
+      if (s = A(s, d), !V(s) || s === null)
         throw new Error(`Cannot resolve path at '${f.join("/")}'`);
     }
-    return a;
+    return s;
   }
-  const n = "replace", i = "add", c = "remove";
-  function _(o, f, a) {
-    if (o.scope_.processedForPatches_.has(o))
+  const n = "replace", i = "add", o = "remove";
+  function u(c, f, s) {
+    if (c.scope_.processedForPatches_.has(c))
       return;
-    o.scope_.processedForPatches_.add(o);
-    const { patches_: u, inversePatches_: l } = a;
-    switch (o.type_) {
+    c.scope_.processedForPatches_.add(c);
+    const { patches_: l, inversePatches_: d } = s;
+    switch (c.type_) {
       case 0:
       case 2:
-        return S(
-          o,
+        return w(
+          c,
           f,
-          u,
-          l
+          l,
+          d
         );
       case 1:
-        return p(
-          o,
+        return _(
+          c,
           f,
-          u,
-          l
+          l,
+          d
         );
       case 3:
-        return w(
-          o,
+        return O(
+          c,
           f,
-          u,
-          l
+          l,
+          d
         );
     }
   }
-  function p(o, f, a, u) {
-    let { base_: l, assigned_: d } = o, h = o.copy_;
-    h.length < l.length && ([l, h] = [h, l], [a, u] = [u, a]);
-    for (let s = 0; s < l.length; s++) {
-      const y = h[s], O = l[s];
-      if (d?.get(s.toString()) && y !== O) {
-        const F = y?.[g];
-        if (F && F.modified_)
+  function _(c, f, s, l) {
+    let { base_: d, assigned_: p } = c, h = c.copy_;
+    h.length < d.length && ([d, h] = [h, d], [s, l] = [l, s]);
+    const y = c.allIndicesReassigned_ === !0;
+    for (let a = 0; a < d.length; a++) {
+      const S = h[a], E = d[a];
+      if ((y || p?.get(a.toString())) && S !== E) {
+        const k = S?.[g];
+        if (k && k.modified_)
           continue;
-        const P = f.concat([s]);
-        a.push({
+        const Pe = f.concat([a]);
+        s.push({
           op: n,
-          path: P,
+          path: Pe,
           // Need to maybe clone it, as it can in fact be the original value
           // due to the base/copy inversion at the start of this function
-          value: R(y)
-        }), u.push({
+          value: T(S)
+        }), l.push({
           op: n,
-          path: P,
-          value: R(O)
+          path: Pe,
+          value: T(E)
         });
       }
     }
-    for (let s = l.length; s < h.length; s++) {
-      const y = f.concat([s]);
-      a.push({
+    for (let a = d.length; a < h.length; a++) {
+      const S = f.concat([a]);
+      s.push({
         op: i,
-        path: y,
+        path: S,
         // Need to maybe clone it, as it can in fact be the original value
         // due to the base/copy inversion at the start of this function
-        value: R(h[s])
+        value: T(h[a])
       });
     }
-    for (let s = h.length - 1; l.length <= s; --s) {
-      const y = f.concat([s]);
-      u.push({
-        op: c,
-        path: y
+    for (let a = h.length - 1; d.length <= a; --a) {
+      const S = f.concat([a]);
+      l.push({
+        op: o,
+        path: S
       });
     }
   }
-  function S(o, f, a, u) {
-    const { base_: l, copy_: d, type_: h } = o;
-    V(o.assigned_, (s, y) => {
-      const O = E(l, s, h), F = E(d, s, h), P = y ? L(l, s) ? n : i : c;
-      if (O === F && P === n)
+  function w(c, f, s, l) {
+    const { base_: d, copy_: p, type_: h } = c;
+    Y(c.assigned_, (y, a) => {
+      const S = A(d, y, h), E = A(p, y, h), P = a ? U(d, y) ? n : i : o;
+      if (S === E && P === n)
         return;
-      const x = f.concat(s);
-      a.push(
-        P === c ? { op: P, path: x } : { op: P, path: x, value: R(F) }
-      ), u.push(
-        P === i ? { op: c, path: x } : P === c ? { op: i, path: x, value: R(O) } : { op: n, path: x, value: R(O) }
+      const k = f.concat(y);
+      s.push(
+        P === o ? { op: P, path: k } : { op: P, path: k, value: T(E) }
+      ), l.push(
+        P === i ? { op: o, path: k } : P === o ? { op: i, path: k, value: T(S) } : { op: n, path: k, value: T(S) }
       );
     });
   }
-  function w(o, f, a, u) {
-    let { base_: l, copy_: d } = o, h = 0;
-    l.forEach((s) => {
-      if (!d.has(s)) {
-        const y = f.concat([h]);
-        a.push({
-          op: c,
-          path: y,
-          value: s
-        }), u.unshift({
+  function O(c, f, s, l) {
+    let { base_: d, copy_: p } = c, h = 0;
+    d.forEach((y) => {
+      if (!p.has(y)) {
+        const a = f.concat([h]);
+        s.push({
+          op: o,
+          path: a,
+          value: y
+        }), l.unshift({
           op: i,
-          path: y,
-          value: s
+          path: a,
+          value: y
         });
       }
       h++;
-    }), h = 0, d.forEach((s) => {
-      if (!l.has(s)) {
-        const y = f.concat([h]);
-        a.push({
+    }), h = 0, p.forEach((y) => {
+      if (!d.has(y)) {
+        const a = f.concat([h]);
+        s.push({
           op: i,
-          path: y,
-          value: s
-        }), u.unshift({
-          op: c,
-          path: y,
-          value: s
+          path: a,
+          value: y
+        }), l.unshift({
+          op: o,
+          path: a,
+          value: y
         });
       }
       h++;
     });
   }
-  function b(o, f, a) {
-    const { patches_: u, inversePatches_: l } = a;
-    u.push({
+  function N(c, f, s) {
+    const { patches_: l, inversePatches_: d } = s;
+    l.push({
       op: n,
       path: [],
-      value: f === pe ? void 0 : f
-    }), l.push({
+      value: f === ye ? void 0 : f
+    }), d.push({
       op: n,
       path: [],
-      value: o
+      value: c
     });
   }
-  function be(o, f) {
-    return f.forEach((a) => {
-      const { path: u, op: l } = a;
-      let d = o;
-      for (let O = 0; O < u.length - 1; O++) {
-        const F = A(d);
-        let P = u[O];
-        typeof P != "string" && typeof P != "number" && (P = "" + P), (F === 0 || F === 1) && (P === "__proto__" || P === $) && m(19), D(d) && P === Y && m(19), d = E(d, P), T(d) || m(18, u.join("/"));
+  function Re(c, f) {
+    return f.forEach((s) => {
+      const { path: l, op: d } = s;
+      let p = c;
+      for (let S = 0; S < l.length - 1; S++) {
+        const E = M(p);
+        let P = l[S];
+        typeof P != "string" && typeof P != "number" && (P = "" + P), (E === 0 || E === 1) && (P === "__proto__" || P === L) && m(19), F(p) && P === K && m(19), p = A(p, P), V(p) || m(18, l.join("/"));
       }
-      const h = A(d), s = N(a.value), y = u[u.length - 1];
-      switch (l) {
+      const h = M(p), y = R(s.value), a = l[l.length - 1];
+      switch (d) {
         case n:
           switch (h) {
             case 2:
-              return d.set(y, s);
+              return p.set(a, y);
             case 3:
               m(16);
             default:
-              return d[y] = s;
+              return p[a] = y;
           }
         case i:
           switch (h) {
             case 1:
-              return y === "-" ? d.push(s) : d.splice(y, 0, s);
+              return a === "-" ? p.push(y) : p.splice(a, 0, y);
             case 2:
-              return d.set(y, s);
+              return p.set(a, y);
             case 3:
-              return d.add(s);
+              return p.add(y);
             default:
-              return d[y] = s;
+              return p[a] = y;
           }
-        case c:
+        case o:
           switch (h) {
             case 1:
-              return d.splice(y, 1);
+              return p.splice(a, 1);
             case 2:
-              return d.delete(y);
+              return p.delete(a);
             case 3:
-              return d.delete(a.value);
+              return p.delete(s.value);
             default:
-              return delete d[y];
+              return delete p[a];
           }
         default:
-          m(17, l);
+          m(17, d);
       }
-    }), o;
+    }), c;
   }
-  function N(o) {
-    if (!C(o))
-      return o;
-    if (H(o))
-      return o.map(N);
-    if (X(o))
+  function R(c) {
+    if (!I(c))
+      return c;
+    if (H(c))
+      return c.map(R);
+    if (X(c))
       return new Map(
-        Array.from(o.entries()).map(([a, u]) => [a, N(u)])
+        Array.from(c.entries()).map(([s, l]) => [s, R(l)])
       );
-    if (q(o))
-      return new Set(Array.from(o).map(N));
-    const f = Object.create(I(o));
-    for (const a in o)
-      f[a] = N(o[a]);
-    return L(o, U) && (f[U] = o[U]), f;
+    if (q(c))
+      return new Set(Array.from(c).map(R));
+    const f = Object.create(D(c));
+    for (const s in c)
+      f[s] = R(c[s]);
+    return U(c, x) && (f[x] = c[x]), f;
   }
-  function R(o) {
-    return z(o) ? N(o) : o;
+  function T(c) {
+    return z(c) ? R(c) : c;
   }
-  xe(re, {
-    applyPatches_: be,
-    generatePatches_: _,
-    generateReplacementPatches_: b,
+  We(re, {
+    applyPatches_: Re,
+    generatePatches_: u,
+    generateReplacementPatches_: N,
     getPath: t
   });
 }
-var K = new He();
-K.produce;
-var Qe = /* @__PURE__ */ K.produceWithPatches.bind(
-  K
-), Ze = /* @__PURE__ */ K.applyPatches.bind(K);
+var G = new Je();
+G.produce;
+var et = /* @__PURE__ */ G.produceWithPatches.bind(
+  G
+), tt = /* @__PURE__ */ G.applyPatches.bind(G);
 export {
-  He as Immer,
-  Ze as applyPatches,
-  Xe as current,
-  Je as enablePatches,
-  ye as freeze,
-  U as immerable,
+  Je as Immer,
+  tt as applyPatches,
+  Qe as current,
+  je as enablePatches,
+  ge as freeze,
+  x as immerable,
   z as isDraft,
-  C as isDraftable,
-  pe as nothing,
-  qe as original,
-  Qe as produceWithPatches
+  I as isDraftable,
+  ye as nothing,
+  Ze as original,
+  et as produceWithPatches
 };
 //# sourceMappingURL=immer.es.js.map