@ynput/ayon-frontend-shared 0.2.35 → 0.2.36

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

@@ -1,4 +1,4 @@
-var L = Symbol.for("immer-nothing"), I = Symbol.for("immer-draftable"), P = Symbol.for("immer-state"), ie = process.env.NODE_ENV !== "production" ? [
+var L = Symbol.for("immer-nothing"), I = Symbol.for("immer-draftable"), P = 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,73 +31,73 @@ var L = Symbol.for("immer-nothing"), I = Symbol.for("immer-draftable"), P = Symb
 ] : [];
 function h(e, ...t) {
   if (process.env.NODE_ENV !== "production") {
-    const r = ie[e], n = typeof r == "function" ? r.apply(null, t) : r;
+    const r = ce[e], n = typeof r == "function" ? 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 S = Object.getPrototypeOf;
-function E(e) {
+var A = Object.getPrototypeOf;
+function z(e) {
   return !!e && !!e[P];
 }
-function D(e) {
+function E(e) {
   var t;
-  return e ? ce(e) || Array.isArray(e) || !!e[I] || !!((t = e.constructor) != null && t[I]) || x(e) || $(e) : !1;
+  return e ? se(e) || Array.isArray(e) || !!e[I] || !!((t = e.constructor) != null && t[I]) || N(e) || $(e) : !1;
 }
-var le = Object.prototype.constructor.toString();
-function ce(e) {
+var de = Object.prototype.constructor.toString();
+function se(e) {
   if (!e || typeof e != "object")
     return !1;
-  const t = S(e);
+  const t = A(e);
   if (t === null)
     return !0;
   const r = Object.hasOwnProperty.call(t, "constructor") && t.constructor;
-  return r === Object ? !0 : typeof r == "function" && Function.toString.call(r) === le;
+  return r === Object ? !0 : typeof r == "function" && Function.toString.call(r) === de;
 }
 function Oe(e) {
-  return E(e) || h(15, e), e[P].base_;
+  return z(e) || h(15, e), e[P].base_;
 }
-function k(e, t) {
-  v(e) === 0 ? Reflect.ownKeys(e).forEach((r) => {
+function R(e, t) {
+  D(e) === 0 ? Reflect.ownKeys(e).forEach((r) => {
     t(r, e[r], e);
   }) : e.forEach((r, n) => t(n, r, e));
 }
-function v(e) {
+function D(e) {
   const t = e[P];
-  return t ? t.type_ : Array.isArray(e) ? 1 : x(e) ? 2 : $(e) ? 3 : 0;
+  return t ? t.type_ : Array.isArray(e) ? 1 : N(e) ? 2 : $(e) ? 3 : 0;
 }
-function R(e, t) {
-  return v(e) === 2 ? e.has(t) : Object.prototype.hasOwnProperty.call(e, t);
+function k(e, t) {
+  return D(e) === 2 ? e.has(t) : Object.prototype.hasOwnProperty.call(e, t);
 }
-function G(e, t) {
-  return v(e) === 2 ? e.get(t) : e[t];
+function V(e, t) {
+  return D(e) === 2 ? e.get(t) : e[t];
 }
-function se(e, t, r) {
-  const n = v(e);
+function fe(e, t, r) {
+  const n = D(e);
   n === 2 ? e.set(t, r) : n === 3 ? e.add(r) : e[t] = r;
 }
-function de(e, t) {
+function _e(e, t) {
   return e === t ? e !== 0 || 1 / e === 1 / t : e !== e && t !== t;
 }
-function x(e) {
+function N(e) {
   return e instanceof Map;
 }
 function $(e) {
   return e instanceof Set;
 }
-function A(e) {
+function b(e) {
   return e.copy_ || e.base_;
 }
-function X(e, t) {
-  if (x(e))
+function q(e, t) {
+  if (N(e))
     return new Map(e);
   if ($(e))
     return new Set(e);
   if (Array.isArray(e))
     return Array.prototype.slice.call(e);
-  const r = ce(e);
+  const r = se(e);
   if (t === !0 || t === "class_only" && !r) {
     const n = Object.getOwnPropertyDescriptors(e);
     delete n[P];
@@ -112,34 +112,39 @@ function X(e, t) {
         value: e[l]
       });
     }
-    return Object.create(S(e), n);
+    return Object.create(A(e), n);
   } else {
-    const n = S(e);
+    const n = A(e);
     if (n !== null && r)
       return { ...e };
     const o = Object.create(n);
     return Object.assign(o, e);
   }
 }
-function j(e, t = !1) {
-  return K(e) || E(e) || !D(e) || (v(e) > 1 && (e.set = e.add = e.clear = e.delete = pe), Object.freeze(e), t && Object.entries(e).forEach(([r, n]) => j(n, !0))), e;
+function ee(e, t = !1) {
+  return B(e) || z(e) || !E(e) || (D(e) > 1 && Object.defineProperties(e, {
+    set: { value: W },
+    add: { value: W },
+    clear: { value: W },
+    delete: { value: W }
+  }), Object.freeze(e), t && Object.values(e).forEach((r) => ee(r, !0))), e;
 }
-function pe() {
+function W() {
   h(2);
 }
-function K(e) {
+function B(e) {
   return Object.isFrozen(e);
 }
-var q = {};
-function F(e) {
-  const t = q[e];
+var J = {};
+function S(e) {
+  const t = J[e];
   return t || h(0, e), t;
 }
-function _e(e, t) {
-  q[e] || (q[e] = t);
+function pe(e, t) {
+  J[e] || (J[e] = t);
 }
 var M;
-function fe() {
+function ue() {
   return M;
 }
 function ye(e, t) {
@@ -153,40 +158,40 @@ function ye(e, t) {
     unfinalizedDrafts_: 0
   };
 }
-function te(e, t) {
-  t && (F("Patches"), e.patches_ = [], e.inversePatches_ = [], e.patchListener_ = t);
-}
-function J(e) {
-  Q(e), e.drafts_.forEach(he), e.drafts_ = null;
+function re(e, t) {
+  t && (S("Patches"), e.patches_ = [], e.inversePatches_ = [], e.patchListener_ = t);
 }
 function Q(e) {
+  Y(e), e.drafts_.forEach(he), e.drafts_ = null;
+}
+function Y(e) {
   e === M && (M = e.parent_);
 }
-function re(e) {
+function ne(e) {
   return M = ye(M, e);
 }
 function he(e) {
   const t = e[P];
   t.type_ === 0 || t.type_ === 1 ? t.revoke_() : t.revoked_ = !0;
 }
-function ne(e, t) {
+function oe(e, t) {
   t.unfinalizedDrafts_ = t.drafts_.length;
   const r = t.drafts_[0];
-  return e !== void 0 && e !== r ? (r[P].modified_ && (J(t), h(4)), D(e) && (e = W(t, e), t.parent_ || U(t, e)), t.patches_ && F("Patches").generateReplacementPatches_(
+  return e !== void 0 && e !== r ? (r[P].modified_ && (Q(t), h(4)), E(e) && (e = K(t, e), t.parent_ || U(t, e)), t.patches_ && S("Patches").generateReplacementPatches_(
     r[P].base_,
     e,
     t.patches_,
     t.inversePatches_
-  )) : e = W(t, r, []), J(t), t.patches_ && t.patchListener_(t.patches_, t.inversePatches_), e !== L ? e : void 0;
+  )) : e = K(t, r, []), Q(t), t.patches_ && t.patchListener_(t.patches_, t.inversePatches_), e !== L ? e : void 0;
 }
-function W(e, t, r) {
-  if (K(t))
+function K(e, t, r) {
+  if (B(t))
     return t;
   const n = t[P];
   if (!n)
-    return k(
+    return R(
       t,
-      (o, s) => oe(e, n, t, o, s, r)
+      (o, s) => ie(e, n, t, o, s, r)
     ), t;
   if (n.scope_ !== e)
     return t;
@@ -196,10 +201,10 @@ function W(e, t, r) {
     n.finalized_ = !0, n.scope_.unfinalizedDrafts_--;
     const o = n.copy_;
     let s = o, l = !1;
-    n.type_ === 3 && (s = new Set(o), o.clear(), l = !0), k(
+    n.type_ === 3 && (s = new Set(o), o.clear(), l = !0), R(
       s,
-      (d, O) => oe(e, n, o, d, O, r, l)
-    ), U(e, o, !1), r && e.patches_ && F("Patches").generatePatches_(
+      (d, w) => ie(e, n, o, d, w, r, l)
+    ), U(e, o, !1), r && e.patches_ && S("Patches").generatePatches_(
       n,
       r,
       e.patches_,
@@ -208,29 +213,29 @@ function W(e, t, r) {
   }
   return n.copy_;
 }
-function oe(e, t, r, n, o, s, l) {
-  if (process.env.NODE_ENV !== "production" && o === r && h(5), E(o)) {
+function ie(e, t, r, n, o, s, l) {
+  if (process.env.NODE_ENV !== "production" && o === r && h(5), z(o)) {
     const d = s && t && t.type_ !== 3 && // Set objects are atomic since they have no keys.
-    !R(t.assigned_, n) ? s.concat(n) : void 0, O = W(e, o, d);
-    if (se(r, n, O), E(O))
+    !k(t.assigned_, n) ? s.concat(n) : void 0, w = K(e, o, d);
+    if (fe(r, n, w), z(w))
       e.canAutoFreeze_ = !1;
     else
       return;
   } else l && r.add(o);
-  if (D(o) && !K(o)) {
+  if (E(o) && !B(o)) {
     if (!e.immer_.autoFreeze_ && e.unfinalizedDrafts_ < 1)
       return;
-    W(e, o), (!t || !t.scope_.parent_) && typeof n != "symbol" && Object.prototype.propertyIsEnumerable.call(r, n) && U(e, o);
+    K(e, o), (!t || !t.scope_.parent_) && typeof n != "symbol" && (N(r) ? r.has(n) : Object.prototype.propertyIsEnumerable.call(r, n)) && U(e, o);
   }
 }
 function U(e, t, r = !1) {
-  !e.parent_ && e.immer_.autoFreeze_ && e.canAutoFreeze_ && j(t, r);
+  !e.parent_ && e.immer_.autoFreeze_ && e.canAutoFreeze_ && ee(t, r);
 }
 function me(e, t) {
   const r = Array.isArray(e), n = {
     type_: r ? 1 : 0,
     // Track which produce call this is associated with.
-    scope_: t ? t.scope_ : fe(),
+    scope_: t ? t.scope_ : ue(),
     // True for both shallow and deep changes.
     modified_: !1,
     // Used during finalization.
@@ -250,50 +255,50 @@ function me(e, t) {
     revoke_: null,
     isManual_: !1
   };
-  let o = n, s = ee;
+  let o = n, s = te;
   r && (o = [n], s = T);
   const { revoke: l, proxy: d } = Proxy.revocable(o, s);
   return n.draft_ = d, n.revoke_ = l, d;
 }
-var ee = {
+var te = {
   get(e, t) {
     if (t === P)
       return e;
-    const r = A(e);
-    if (!R(r, t))
+    const r = b(e);
+    if (!k(r, t))
       return ge(e, r, t);
     const n = r[t];
-    return e.finalized_ || !D(n) ? n : n === V(e.base_, t) ? (H(e), e.copy_[t] = Z(n, e)) : n;
+    return e.finalized_ || !E(n) ? n : n === H(e.base_, t) ? (X(e), e.copy_[t] = j(n, e)) : n;
   },
   has(e, t) {
-    return t in A(e);
+    return t in b(e);
   },
   ownKeys(e) {
-    return Reflect.ownKeys(A(e));
+    return Reflect.ownKeys(b(e));
   },
   set(e, t, r) {
-    const n = ue(A(e), t);
+    const n = ae(b(e), t);
     if (n != null && n.set)
       return n.set.call(e.draft_, r), !0;
     if (!e.modified_) {
-      const o = V(A(e), t), s = o == null ? void 0 : o[P];
+      const o = H(b(e), t), s = o == null ? void 0 : o[P];
       if (s && s.base_ === r)
         return e.copy_[t] = r, e.assigned_[t] = !1, !0;
-      if (de(r, o) && (r !== void 0 || R(e.base_, t)))
+      if (_e(r, o) && (r !== void 0 || k(e.base_, t)))
         return !0;
-      H(e), Y(e);
+      X(e), Z(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_[t] = !0), !0;
   },
   deleteProperty(e, t) {
-    return V(e.base_, t) !== void 0 || t in e.base_ ? (e.assigned_[t] = !1, H(e), Y(e)) : delete e.assigned_[t], e.copy_ && delete e.copy_[t], !0;
+    return H(e.base_, t) !== void 0 || t in e.base_ ? (e.assigned_[t] = !1, X(e), Z(e)) : delete e.assigned_[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 = A(e), n = Reflect.getOwnPropertyDescriptor(r, t);
+    const r = b(e), n = Reflect.getOwnPropertyDescriptor(r, t);
     return n && {
       writable: !0,
       configurable: e.type_ !== 1 || t !== "length",
@@ -305,13 +310,13 @@ var ee = {
     h(11);
   },
   getPrototypeOf(e) {
-    return S(e.base_);
+    return A(e.base_);
   },
   setPrototypeOf() {
     h(12);
   }
 }, T = {};
-k(ee, (e, t) => {
+R(te, (e, t) => {
   T[e] = function() {
     return arguments[0] = arguments[0][0], t.apply(this, arguments);
   };
@@ -320,37 +325,37 @@ T.deleteProperty = function(e, t) {
   return process.env.NODE_ENV !== "production" && isNaN(parseInt(t)) && h(13), T.set.call(this, e, t, void 0);
 };
 T.set = function(e, t, r) {
-  return process.env.NODE_ENV !== "production" && t !== "length" && isNaN(parseInt(t)) && h(14), ee.set.call(this, e[0], t, r, e[0]);
+  return process.env.NODE_ENV !== "production" && t !== "length" && isNaN(parseInt(t)) && h(14), te.set.call(this, e[0], t, r, e[0]);
 };
-function V(e, t) {
+function H(e, t) {
   const r = e[P];
-  return (r ? A(r) : e)[t];
+  return (r ? b(r) : e)[t];
 }
 function ge(e, t, r) {
   var o;
-  const n = ue(t, r);
+  const n = ae(t, r);
   return n ? "value" in n ? n.value : (
     // 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!
     (o = n.get) == null ? void 0 : o.call(e.draft_)
   ) : void 0;
 }
-function ue(e, t) {
+function ae(e, t) {
   if (!(t in e))
     return;
-  let r = S(e);
+  let r = A(e);
   for (; r; ) {
     const n = Object.getOwnPropertyDescriptor(r, t);
     if (n)
       return n;
-    r = S(r);
+    r = A(r);
   }
 }
-function Y(e) {
-  e.modified_ || (e.modified_ = !0, e.parent_ && Y(e.parent_));
+function Z(e) {
+  e.modified_ || (e.modified_ = !0, e.parent_ && Z(e.parent_));
 }
-function H(e) {
-  e.copy_ || (e.copy_ = X(
+function X(e) {
+  e.copy_ || (e.copy_ = q(
     e.base_,
     e.scope_.immer_.useStrictShallowCopy_
   ));
@@ -362,32 +367,32 @@ var Pe = class {
         const s = r;
         r = t;
         const l = this;
-        return function(O = s, ...B) {
-          return l.produce(O, (z) => r.call(this, z, ...B));
+        return function(w = s, ...G) {
+          return l.produce(w, (v) => r.call(this, v, ...G));
         };
       }
       typeof r != "function" && h(6), n !== void 0 && typeof n != "function" && h(7);
       let o;
-      if (D(t)) {
-        const s = re(this), l = Z(t, void 0);
+      if (E(t)) {
+        const s = ne(this), l = j(t, void 0);
         let d = !0;
         try {
           o = r(l), d = !1;
         } finally {
-          d ? J(s) : Q(s);
+          d ? Q(s) : Y(s);
         }
-        return te(s, n), ne(o, s);
+        return re(s, n), oe(o, s);
       } else if (!t || typeof t != "object") {
-        if (o = r(t), o === void 0 && (o = t), o === L && (o = void 0), this.autoFreeze_ && j(o, !0), n) {
+        if (o = r(t), o === void 0 && (o = t), o === L && (o = void 0), this.autoFreeze_ && ee(o, !0), n) {
           const s = [], l = [];
-          F("Patches").generateReplacementPatches_(t, o, s, l), n(s, l);
+          S("Patches").generateReplacementPatches_(t, o, s, l), n(s, l);
         }
         return o;
       } else
         h(1, t);
     }, this.produceWithPatches = (t, r) => {
       if (typeof t == "function")
-        return (l, ...d) => this.produceWithPatches(l, (O) => t(O, ...d));
+        return (l, ...d) => this.produceWithPatches(l, (w) => t(w, ...d));
       let n, o;
       return [this.produce(t, r, (l, d) => {
         n = l, o = d;
@@ -395,15 +400,15 @@ var Pe = class {
     }, typeof (e == null ? void 0 : e.autoFreeze) == "boolean" && this.setAutoFreeze(e.autoFreeze), typeof (e == null ? void 0 : e.useStrictShallowCopy) == "boolean" && this.setUseStrictShallowCopy(e.useStrictShallowCopy);
   }
   createDraft(e) {
-    D(e) || h(8), E(e) && (e = we(e));
-    const t = re(this), r = Z(e, void 0);
-    return r[P].isManual_ = !0, Q(t), r;
+    E(e) || h(8), z(e) && (e = we(e));
+    const t = ne(this), r = j(e, void 0);
+    return r[P].isManual_ = !0, Y(t), r;
   }
   finishDraft(e, t) {
     const r = e && e[P];
     (!r || !r.isManual_) && h(9);
     const { scope_: n } = r;
-    return te(n, t), ne(void 0, n);
+    return re(n, t), oe(void 0, n);
   }
   /**
    * Pass true to automatically freeze all copies created by Immer.
@@ -431,37 +436,37 @@ var Pe = class {
       }
     }
     r > -1 && (t = t.slice(r + 1));
-    const n = F("Patches").applyPatches_;
-    return E(e) ? n(e, t) : this.produce(
+    const n = S("Patches").applyPatches_;
+    return z(e) ? n(e, t) : this.produce(
       e,
       (o) => n(o, t)
     );
   }
 };
-function Z(e, t) {
-  const r = x(e) ? F("MapSet").proxyMap_(e, t) : $(e) ? F("MapSet").proxySet_(e, t) : me(e, t);
-  return (t ? t.scope_ : fe()).drafts_.push(r), r;
+function j(e, t) {
+  const r = N(e) ? S("MapSet").proxyMap_(e, t) : $(e) ? S("MapSet").proxySet_(e, t) : me(e, t);
+  return (t ? t.scope_ : ue()).drafts_.push(r), r;
 }
 function we(e) {
-  return E(e) || h(10, e), ae(e);
+  return z(e) || h(10, e), le(e);
 }
-function ae(e) {
-  if (!D(e) || K(e))
+function le(e) {
+  if (!E(e) || B(e))
     return e;
   const t = e[P];
   let r;
   if (t) {
     if (!t.modified_)
       return t.base_;
-    t.finalized_ = !0, r = X(e, t.scope_.immer_.useStrictShallowCopy_);
+    t.finalized_ = !0, r = q(e, t.scope_.immer_.useStrictShallowCopy_);
   } else
-    r = X(e, !0);
-  return k(r, (n, o) => {
-    se(r, n, ae(o));
+    r = q(e, !0);
+  return R(r, (n, o) => {
+    fe(r, n, le(o));
   }), t && (t.finalized_ = !1), r;
 }
-function be() {
-  process.env.NODE_ENV !== "production" && ie.push(
+function ve() {
+  process.env.NODE_ENV !== "production" && ce.push(
     'Sets cannot have "replace" patches.',
     function(i) {
       return "Unsupported patch operation: " + i;
@@ -472,7 +477,7 @@ function be() {
     "Patching reserved attributes like __proto__, prototype and constructor is not allowed"
   );
   const t = "replace", r = "add", n = "remove";
-  function o(i, y, u, p) {
+  function o(i, y, u, _) {
     switch (i.type_) {
       case 0:
       case 2:
@@ -480,123 +485,123 @@ function be() {
           i,
           y,
           u,
-          p
+          _
         );
       case 1:
-        return s(i, y, u, p);
+        return s(i, y, u, _);
       case 3:
         return d(
           i,
           y,
           u,
-          p
+          _
         );
     }
   }
-  function s(i, y, u, p) {
-    let { base_: m, assigned_: a } = i, _ = i.copy_;
-    _.length < m.length && ([m, _] = [_, m], [u, p] = [p, u]);
+  function s(i, y, u, _) {
+    let { base_: m, assigned_: a } = i, p = i.copy_;
+    p.length < m.length && ([m, p] = [p, m], [u, _] = [_, u]);
     for (let c = 0; c < m.length; c++)
-      if (a[c] && _[c] !== m[c]) {
+      if (a[c] && p[c] !== m[c]) {
         const f = y.concat([c]);
         u.push({
           op: t,
           path: f,
           // 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: C(_[c])
-        }), p.push({
+          value: C(p[c])
+        }), _.push({
           op: t,
           path: f,
           value: C(m[c])
         });
       }
-    for (let c = m.length; c < _.length; c++) {
+    for (let c = m.length; c < p.length; c++) {
       const f = y.concat([c]);
       u.push({
         op: r,
         path: f,
         // 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: C(_[c])
+        value: C(p[c])
       });
     }
-    for (let c = _.length - 1; m.length <= c; --c) {
+    for (let c = p.length - 1; m.length <= c; --c) {
       const f = y.concat([c]);
-      p.push({
+      _.push({
         op: n,
         path: f
       });
     }
   }
-  function l(i, y, u, p) {
+  function l(i, y, u, _) {
     const { base_: m, copy_: a } = i;
-    k(i.assigned_, (_, c) => {
-      const f = G(m, _), N = G(a, _), b = c ? R(m, _) ? t : r : n;
-      if (f === N && b === t)
+    R(i.assigned_, (p, c) => {
+      const f = V(m, p), F = V(a, p), O = c ? k(m, p) ? t : r : n;
+      if (f === F && O === t)
         return;
-      const g = y.concat(_);
-      u.push(b === n ? { op: b, path: g } : { op: b, path: g, value: N }), p.push(
-        b === r ? { op: n, path: g } : b === n ? { op: r, path: g, value: C(f) } : { op: t, path: g, value: C(f) }
+      const g = y.concat(p);
+      u.push(O === n ? { op: O, path: g } : { op: O, path: g, value: F }), _.push(
+        O === r ? { op: n, path: g } : O === n ? { op: r, path: g, value: C(f) } : { op: t, path: g, value: C(f) }
       );
     });
   }
-  function d(i, y, u, p) {
-    let { base_: m, copy_: a } = i, _ = 0;
+  function d(i, y, u, _) {
+    let { base_: m, copy_: a } = i, p = 0;
     m.forEach((c) => {
       if (!a.has(c)) {
-        const f = y.concat([_]);
+        const f = y.concat([p]);
         u.push({
           op: n,
           path: f,
           value: c
-        }), p.unshift({
+        }), _.unshift({
           op: r,
           path: f,
           value: c
         });
       }
-      _++;
-    }), _ = 0, a.forEach((c) => {
+      p++;
+    }), p = 0, a.forEach((c) => {
       if (!m.has(c)) {
-        const f = y.concat([_]);
+        const f = y.concat([p]);
         u.push({
           op: r,
           path: f,
           value: c
-        }), p.unshift({
+        }), _.unshift({
           op: n,
           path: f,
           value: c
         });
       }
-      _++;
+      p++;
     });
   }
-  function O(i, y, u, p) {
+  function w(i, y, u, _) {
     u.push({
       op: t,
       path: [],
       value: y === L ? void 0 : y
-    }), p.push({
+    }), _.push({
       op: t,
       path: [],
       value: i
     });
   }
-  function B(i, y) {
+  function G(i, y) {
     return y.forEach((u) => {
-      const { path: p, op: m } = u;
+      const { path: _, op: m } = u;
       let a = i;
-      for (let N = 0; N < p.length - 1; N++) {
-        const b = v(a);
-        let g = p[N];
-        typeof g != "string" && typeof g != "number" && (g = "" + g), (b === 0 || b === 1) && (g === "__proto__" || g === "constructor") && h(19), typeof a == "function" && g === "prototype" && h(19), a = G(a, g), typeof a != "object" && h(18, p.join("/"));
+      for (let F = 0; F < _.length - 1; F++) {
+        const O = D(a);
+        let g = _[F];
+        typeof g != "string" && typeof g != "number" && (g = "" + g), (O === 0 || O === 1) && (g === "__proto__" || g === "constructor") && h(19), typeof a == "function" && g === "prototype" && h(19), a = V(a, g), typeof a != "object" && h(18, _.join("/"));
       }
-      const _ = v(a), c = z(u.value), f = p[p.length - 1];
+      const p = D(a), c = v(u.value), f = _[_.length - 1];
       switch (m) {
         case t:
-          switch (_) {
+          switch (p) {
             case 2:
               return a.set(f, c);
             case 3:
@@ -605,7 +610,7 @@ function be() {
               return a[f] = c;
           }
         case r:
-          switch (_) {
+          switch (p) {
             case 1:
               return f === "-" ? a.push(c) : a.splice(f, 0, c);
             case 2:
@@ -616,7 +621,7 @@ function be() {
               return a[f] = c;
           }
         case n:
-          switch (_) {
+          switch (p) {
             case 1:
               return a.splice(f, 1);
             case 2:
@@ -631,50 +636,45 @@ function be() {
       }
     }), i;
   }
-  function z(i) {
-    if (!D(i))
+  function v(i) {
+    if (!E(i))
       return i;
     if (Array.isArray(i))
-      return i.map(z);
-    if (x(i))
+      return i.map(v);
+    if (N(i))
       return new Map(
-        Array.from(i.entries()).map(([u, p]) => [u, z(p)])
+        Array.from(i.entries()).map(([u, _]) => [u, v(_)])
       );
     if ($(i))
-      return new Set(Array.from(i).map(z));
-    const y = Object.create(S(i));
+      return new Set(Array.from(i).map(v));
+    const y = Object.create(A(i));
     for (const u in i)
-      y[u] = z(i[u]);
-    return R(i, I) && (y[I] = i[I]), y;
+      y[u] = v(i[u]);
+    return k(i, I) && (y[I] = i[I]), y;
   }
   function C(i) {
-    return E(i) ? z(i) : i;
+    return z(i) ? v(i) : i;
   }
-  _e("Patches", {
-    applyPatches_: B,
+  pe("Patches", {
+    applyPatches_: G,
     generatePatches_: o,
-    generateReplacementPatches_: O
+    generateReplacementPatches_: w
   });
 }
-var w = new Pe();
-w.produce;
-var ze = w.produceWithPatches.bind(
-  w
-);
-w.setAutoFreeze.bind(w);
-w.setUseStrictShallowCopy.bind(w);
-var Ee = w.applyPatches.bind(w);
-w.createDraft.bind(w);
-w.finishDraft.bind(w);
+var x = new Pe();
+x.produce;
+var ze = /* @__PURE__ */ x.produceWithPatches.bind(
+  x
+), Ee = /* @__PURE__ */ x.applyPatches.bind(x);
 export {
   Pe as Immer,
   Ee as applyPatches,
   we as current,
-  be as enablePatches,
-  j as freeze,
+  ve as enablePatches,
+  ee as freeze,
   I as immerable,
-  E as isDraft,
-  D as isDraftable,
+  z as isDraft,
+  E as isDraftable,
   L as nothing,
   Oe as original,
   ze as produceWithPatches