@ynput/ayon-frontend-shared 0.3.5 → 0.3.6

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

@@ -0,0 +1,814 @@
+var pe = Symbol.for("immer-nothing"), U = Symbol.for("immer-draftable"), g = Symbol.for("immer-state"), ze = 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.`;
+  },
+  function(e) {
+    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 '${e}'`;
+  },
+  "This object has been frozen and should not be mutated",
+  function(e) {
+    return "Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? " + e;
+  },
+  "An immer producer returned a new value *and* modified its draft. Either return a new value *or* modify the draft.",
+  "Immer forbids circular references",
+  "The first or second argument to `produce` must be a function",
+  "The third argument to `produce` must be a function or undefined",
+  "First argument to `createDraft` must be a plain object, an array, or an immerable object",
+  "First argument to `finishDraft` must be a draft returned by `createDraft`",
+  function(e) {
+    return `'current' expects a draft, got: ${e}`;
+  },
+  "Object.defineProperty() cannot be used on an Immer draft",
+  "Object.setPrototypeOf() cannot be used on an Immer draft",
+  "Immer only supports deleting array indices",
+  "Immer only supports setting array indices and the 'length' property",
+  function(e) {
+    return `'original' expects a draft, got: ${e}`;
+  }
+  // Note: if more errors are added, the errorOffset in Patches.ts should be increased
+  // See Patches.ts for additional errors
+] : [];
+function m(e, ...t) {
+  if (process.env.NODE_ENV !== "production") {
+    const r = ze[e], n = D(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 Ne = v[Y][$].toString(), ge = /* @__PURE__ */ new WeakMap();
+function Ce(e) {
+  if (!e || !T(e))
+    return !1;
+  const t = I(e);
+  if (t === null || t === v[Y])
+    return !0;
+  const r = v.hasOwnProperty.call(t, $) && t[$];
+  if (r === Object)
+    return !0;
+  if (!D(r))
+    return !1;
+  let n = ge.get(r);
+  return n === void 0 && (n = Function.toString.call(r), ge.set(r, n)), n === Ne;
+}
+function qe(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) => {
+    t(i, e[i], e);
+  }) : e.forEach((n, i) => t(i, n, e));
+}
+function A(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)) => (
+  // @ts-ignore
+  r === 2 ? e.get(t) : e[t]
+), ee = (e, t, r, n = A(e)) => {
+  n === 2 ? e.set(t, r) : n === 3 ? e.add(r) : e[t] = r;
+};
+function Re(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) {
+  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);
+  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,
+        [Q]: !0,
+        // could live with !!desc.set as well here...
+        [j]: p[j],
+        [W]: e[_]
+      });
+    }
+    return v.create(I(e), n);
+  } else {
+    const n = I(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, {
+    set: J,
+    add: J,
+    clear: J,
+    delete: J
+  }), v.freeze(e), t && V(
+    e,
+    (r, n) => {
+      ye(n, !0);
+    },
+    !1
+  )), e;
+}
+function Me() {
+  m(2);
+}
+var J = {
+  [W]: Me
+};
+function ie(e) {
+  return e === null || !T(e) ? !0 : v.isFrozen(e);
+}
+var te = "MapSet", re = "Patches", ne = {};
+function M(e) {
+  const t = ne[e];
+  return t || m(0, e), t;
+}
+var Ve = (e) => !!ne[e];
+function xe(e, t) {
+  ne[e] || (ne[e] = t);
+}
+var B, Ee = () => B, Ue = (e, t) => ({
+  drafts_: [],
+  parent_: e,
+  immer_: t,
+  // Whenever the modified draft contains a draft from another scope, we
+  // need to prevent auto-freezing so the unowned draft can be finalized.
+  canAutoFreeze_: !0,
+  unfinalizedDrafts_: 0,
+  handledSet_: /* @__PURE__ */ new Set(),
+  processedForPatches_: /* @__PURE__ */ new Set(),
+  mapSetPlugin_: Ve(te) ? M(te) : void 0
+});
+function ve(e, t) {
+  t && (e.patchPlugin_ = M(re), e.patches_ = [], e.inversePatches_ = [], e.patchListener_ = t);
+}
+function ue(e) {
+  le(e), e.drafts_.forEach(Le), e.drafts_ = null;
+}
+function le(e) {
+  e === B && (B = e.parent_);
+}
+var Se = (e) => B = Ue(B, e);
+function Le(e) {
+  const t = e[g];
+  t.type_ === 0 || t.type_ === 1 ? t.revoke_() : t.revoked_ = !0;
+}
+function we(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));
+    const { patchPlugin_: i } = t;
+    i && i.generateReplacementPatches_(
+      r[g].base_,
+      e,
+      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;
+}
+function Oe(e, t) {
+  if (ie(t))
+    return t;
+  const r = t[g];
+  if (!r)
+    return me(t, e.handledSet_, e);
+  if (!oe(r, e))
+    return t;
+  if (!r.modified_)
+    return r.base_;
+  if (!r.finalized_) {
+    const { callbacks_: n } = r;
+    if (n)
+      for (; n.length > 0; )
+        n.pop()(e);
+    De(r, e);
+  }
+  return r.copy_;
+}
+function $e(e, t, r = !1) {
+  !e.parent_ && e.immer_.autoFreeze_ && e.canAutoFreeze_ && ye(t, r);
+}
+function ke(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);
+    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_.get(t) ?? We;
+  for (const p of _)
+    ee(i, p, r, c);
+}
+function Be(e, t, r) {
+  e.callbacks_.push(function(i) {
+    const c = t;
+    if (!c || !oe(c, i))
+      return;
+    i.mapSetPlugin_?.fixSetContents(c);
+    const _ = he(c);
+    Fe(e, c.draft_ ?? c, _, r), De(c, i);
+  });
+}
+function De(e, t) {
+  if (e.modified_ && !e.finalized_ && (e.type_ === 3 || (e.assigned_?.size ?? 0) > 0)) {
+    const { patchPlugin_: n } = t;
+    if (n) {
+      const i = n.getPath(e);
+      i && n.generatePatches_(e, i, t);
+    }
+    ke(e);
+  }
+}
+function Ge(e, t, r) {
+  const { scope_: n } = e;
+  if (z(r)) {
+    const i = r[g];
+    oe(i, n) && i.callbacks_.push(function() {
+      Z(e);
+      const _ = he(i);
+      Fe(e, r, _, 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_),
+      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) => {
+    if (z(i)) {
+      const c = i[g];
+      if (oe(c, r)) {
+        const _ = he(c);
+        ee(e, n, _, e.type_), ke(c);
+      }
+    } else C(i) && me(i, t, r);
+  })), e;
+}
+function Ke(e, t) {
+  const r = H(e), n = {
+    type_: r ? 1 : 0,
+    // Track which produce call this is associated with.
+    scope_: t ? t.scope_ : Ee(),
+    // True for both shallow and deep changes.
+    modified_: !1,
+    // Used during finalization.
+    finalized_: !1,
+    // Track which properties have been assigned (true) or deleted (false).
+    // actually instantiated in `prepareCopy()`
+    assigned_: void 0,
+    // The parent draft state.
+    parent_: t,
+    // The base state.
+    base_: e,
+    // The base proxy.
+    draft_: null,
+    // set below
+    // The base copy with any updated values.
+    copy_: null,
+    // Called by the `produce` function.
+    revoke_: null,
+    isManual_: !1,
+    // `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];
+}
+var Pe = {
+  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)) {
+      Z(e);
+      const i = e.type_ === 1 ? +t : t, c = de(e.scope_, n, e, i);
+      return e.copy_[i] = c;
+    }
+    return n;
+  },
+  has(e, t) {
+    return t in k(e);
+  },
+  ownKeys(e) {
+    return Reflect.ownKeys(k(e));
+  },
+  set(e, t, r) {
+    const n = Ie(k(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)
+        return e.copy_[t] = r, e.assigned_.set(t, !1), !0;
+      if (Re(r, i) && (r !== void 0 || L(e.base_, t, e.type_)))
+        return !0;
+      Z(e), _e(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;
+  },
+  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;
+  },
+  // 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);
+    return n && {
+      [Q]: !0,
+      [ae]: e.type_ !== 1 || t !== "length",
+      [j]: n[j],
+      [W]: r[t]
+    };
+  },
+  defineProperty() {
+    m(11);
+  },
+  getPrototypeOf(e) {
+    return I(e.base_);
+  },
+  setPrototypeOf() {
+    m(12);
+  }
+}, G = {};
+V(Pe, (e, t) => {
+  G[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);
+};
+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]);
+};
+function se(e, t) {
+  const r = e[g];
+  return (r ? k(r) : e)[t];
+}
+function Ye(e, t, r) {
+  const n = Ie(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) {
+  if (!(t in e))
+    return;
+  let r = I(e);
+  for (; r; ) {
+    const n = Object.getOwnPropertyDescriptor(r, t);
+    if (n)
+      return n;
+    r = I(r);
+  }
+}
+function _e(e) {
+  e.modified_ || (e.modified_ = !0, e.parent_ && _e(e.parent_));
+}
+function Z(e) {
+  e.copy_ || (e.assigned_ = /* @__PURE__ */ new Map(), e.copy_ = fe(
+    e.base_,
+    e.scope_.immer_.useStrictShallowCopy_
+  ));
+}
+var He = 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;
+        r = t;
+        const _ = this;
+        return function(S = c, ...w) {
+          return _.produce(S, (b) => r.call(this, b, ...w));
+        };
+      }
+      D(r) || m(6), n !== void 0 && !D(n) && m(7);
+      let i;
+      if (C(t)) {
+        const c = Se(this), _ = de(c, t, void 0);
+        let p = !0;
+        try {
+          i = r(_), p = !1;
+        } finally {
+          p ? ue(c) : le(c);
+        }
+        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 i;
+      } else
+        m(1, t);
+    }, this.produceWithPatches = (t, r) => {
+      if (D(t))
+        return (_, ...p) => this.produceWithPatches(_, (S) => t(S, ...p));
+      let n, i;
+      return [this.produce(t, r, (_, p) => {
+        n = _, i = p;
+      }), n, i];
+    }, ce(e?.autoFreeze) && this.setAutoFreeze(e.autoFreeze), ce(e?.useStrictShallowCopy) && this.setUseStrictShallowCopy(e.useStrictShallowCopy), ce(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;
+  }
+  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);
+  }
+  /**
+   * Pass true to automatically freeze all copies created by Immer.
+   *
+   * By default, auto-freezing is enabled.
+   */
+  setAutoFreeze(e) {
+    this.autoFreeze_ = e;
+  }
+  /**
+   * Pass true to enable strict shallow copy.
+   *
+   * By default, immer does not copy the object descriptors such as getter, setter and non-enumrable properties.
+   */
+  setUseStrictShallowCopy(e) {
+    this.useStrictShallowCopy_ = e;
+  }
+  /**
+   * Pass false to use faster iteration that skips non-enumerable properties
+   * but still handles symbols for compatibility.
+   *
+   * By default, strict iteration is enabled (includes all own properties).
+   */
+  setUseStrictIteration(e) {
+    this.useStrictIteration_ = e;
+  }
+  shouldUseStrictIteration() {
+    return this.useStrictIteration_;
+  }
+  applyPatches(e, t) {
+    let r;
+    for (r = t.length - 1; r >= 0; r--) {
+      const i = t[r];
+      if (i.path.length === 0 && i.op === "replace") {
+        e = i.value;
+        break;
+      }
+    }
+    r > -1 && (t = t.slice(r + 1));
+    const n = M(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);
+  }), i;
+}
+function Xe(e) {
+  return z(e) || m(10, e), Ae(e);
+}
+function Ae(e) {
+  if (!C(e) || ie(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();
+  } else
+    r = fe(e, !0);
+  return V(
+    r,
+    (i, c) => {
+      ee(r, i, Ae(c));
+    },
+    n
+  ), t && (t.finalized_ = !1), r;
+}
+function Je() {
+  process.env.NODE_ENV !== "production" && ze.push(
+    'Sets cannot have "replace" patches.',
+    function(o) {
+      return "Unsupported patch operation: " + o;
+    },
+    function(o) {
+      return "Cannot apply patch, path doesn't resolve: " + o;
+    },
+    "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_)
+        return null;
+      const d = o.parent_.type_ === 3;
+      let h;
+      if (d) {
+        const s = o.parent_;
+        h = Array.from(s.drafts_.keys()).indexOf(o.key_);
+      } else
+        h = o.key_;
+      if (!(d && a.size > h || L(a, h)))
+        return null;
+      f.push(h);
+    }
+    if (o.parent_)
+      return t(o.parent_, f);
+    f.reverse();
+    try {
+      r(o.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)
+        throw new Error(`Cannot resolve path at '${f.join("/")}'`);
+    }
+    return a;
+  }
+  const n = "replace", i = "add", c = "remove";
+  function _(o, f, a) {
+    if (o.scope_.processedForPatches_.has(o))
+      return;
+    o.scope_.processedForPatches_.add(o);
+    const { patches_: u, inversePatches_: l } = a;
+    switch (o.type_) {
+      case 0:
+      case 2:
+        return S(
+          o,
+          f,
+          u,
+          l
+        );
+      case 1:
+        return p(
+          o,
+          f,
+          u,
+          l
+        );
+      case 3:
+        return w(
+          o,
+          f,
+          u,
+          l
+        );
+    }
+  }
+  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_)
+          continue;
+        const P = f.concat([s]);
+        a.push({
+          op: n,
+          path: P,
+          // 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({
+          op: n,
+          path: P,
+          value: R(O)
+        });
+      }
+    }
+    for (let s = l.length; s < h.length; s++) {
+      const y = f.concat([s]);
+      a.push({
+        op: i,
+        path: y,
+        // 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])
+      });
+    }
+    for (let s = h.length - 1; l.length <= s; --s) {
+      const y = f.concat([s]);
+      u.push({
+        op: c,
+        path: y
+      });
+    }
+  }
+  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)
+        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) }
+      );
+    });
+  }
+  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({
+          op: i,
+          path: y,
+          value: s
+        });
+      }
+      h++;
+    }), h = 0, d.forEach((s) => {
+      if (!l.has(s)) {
+        const y = f.concat([h]);
+        a.push({
+          op: i,
+          path: y,
+          value: s
+        }), u.unshift({
+          op: c,
+          path: y,
+          value: s
+        });
+      }
+      h++;
+    });
+  }
+  function b(o, f, a) {
+    const { patches_: u, inversePatches_: l } = a;
+    u.push({
+      op: n,
+      path: [],
+      value: f === pe ? void 0 : f
+    }), l.push({
+      op: n,
+      path: [],
+      value: o
+    });
+  }
+  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("/"));
+      }
+      const h = A(d), s = N(a.value), y = u[u.length - 1];
+      switch (l) {
+        case n:
+          switch (h) {
+            case 2:
+              return d.set(y, s);
+            case 3:
+              m(16);
+            default:
+              return d[y] = s;
+          }
+        case i:
+          switch (h) {
+            case 1:
+              return y === "-" ? d.push(s) : d.splice(y, 0, s);
+            case 2:
+              return d.set(y, s);
+            case 3:
+              return d.add(s);
+            default:
+              return d[y] = s;
+          }
+        case c:
+          switch (h) {
+            case 1:
+              return d.splice(y, 1);
+            case 2:
+              return d.delete(y);
+            case 3:
+              return d.delete(a.value);
+            default:
+              return delete d[y];
+          }
+        default:
+          m(17, l);
+      }
+    }), o;
+  }
+  function N(o) {
+    if (!C(o))
+      return o;
+    if (H(o))
+      return o.map(N);
+    if (X(o))
+      return new Map(
+        Array.from(o.entries()).map(([a, u]) => [a, N(u)])
+      );
+    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;
+  }
+  function R(o) {
+    return z(o) ? N(o) : o;
+  }
+  xe(re, {
+    applyPatches_: be,
+    generatePatches_: _,
+    generateReplacementPatches_: b,
+    getPath: t
+  });
+}
+var K = new He();
+K.produce;
+var Qe = /* @__PURE__ */ K.produceWithPatches.bind(
+  K
+), Ze = /* @__PURE__ */ K.applyPatches.bind(K);
+export {
+  He as Immer,
+  Ze as applyPatches,
+  Xe as current,
+  Je as enablePatches,
+  ye as freeze,
+  U as immerable,
+  z as isDraft,
+  C as isDraftable,
+  pe as nothing,
+  qe as original,
+  Qe as produceWithPatches
+};
+//# sourceMappingURL=immer.es.js.map