@acronis-platform/shadcn-uikit 0.1.0 → 0.6.0

package/dist/node_modules/.pnpm/immer@11.1.3/node_modules/immer/dist/immer.js

@@ -0,0 +1,569 @@
+var ae = Symbol.for("immer-nothing"), Z = Symbol.for("immer-draftable"), a = Symbol.for("immer-state"), pe = 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 f(e, ...t) {
+  if (process.env.NODE_ENV !== "production") {
+    const r = pe[e], n = p(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 u = Object, S = u.getPrototypeOf, b = "constructor", E = "prototype", B = "configurable", O = "enumerable", C = "writable", v = "value", y = (e) => !!e && !!e[a];
+function _(e) {
+  var t;
+  return e ? fe(e) || R(e) || !!e[Z] || !!((t = e[b]) != null && t[Z]) || T(e) || x(e) : !1;
+}
+var Pe = u[E][b].toString(), ee = /* @__PURE__ */ new WeakMap();
+function fe(e) {
+  if (!e || !q(e))
+    return !1;
+  const t = S(e);
+  if (t === null || t === u[E])
+    return !0;
+  const r = u.hasOwnProperty.call(t, b) && t[b];
+  if (r === Object)
+    return !0;
+  if (!p(r))
+    return !1;
+  let n = ee.get(r);
+  return n === void 0 && (n = Function.toString.call(r), ee.set(r, n)), n === Pe;
+}
+function N(e, t, r = !0) {
+  z(e) === 0 ? (r ? Reflect.ownKeys(e) : u.keys(e)).forEach((i) => {
+    t(i, e[i], e);
+  }) : e.forEach((n, i) => t(i, n, e));
+}
+function z(e) {
+  const t = e[a];
+  return t ? t.type_ : R(e) ? 1 : T(e) ? 2 : x(e) ? 3 : 0;
+}
+var te = (e, t, r = z(e)) => r === 2 ? e.has(t) : u[E].hasOwnProperty.call(e, t), W = (e, t, r = z(e)) => (
+  // @ts-ignore
+  r === 2 ? e.get(t) : e[t]
+), D = (e, t, r, n = z(e)) => {
+  n === 2 ? e.set(t, r) : n === 3 ? e.add(r) : e[t] = r;
+};
+function Se(e, t) {
+  return e === t ? e !== 0 || 1 / e === 1 / t : e !== e && t !== t;
+}
+var R = Array.isArray, T = (e) => e instanceof Map, x = (e) => e instanceof Set, q = (e) => typeof e == "object", p = (e) => typeof e == "function", L = (e) => typeof e == "boolean";
+function ve(e) {
+  const t = +e;
+  return Number.isInteger(t) && String(t) === e;
+}
+var d = (e) => e.copy_ || e.base_, J = (e) => e.modified_ ? e.copy_ : e.base_;
+function G(e, t) {
+  if (T(e))
+    return new Map(e);
+  if (x(e))
+    return new Set(e);
+  if (R(e))
+    return Array[E].slice.call(e);
+  const r = fe(e);
+  if (t === !0 || t === "class_only" && !r) {
+    const n = u.getOwnPropertyDescriptors(e);
+    delete n[a];
+    let i = Reflect.ownKeys(n);
+    for (let o = 0; o < i.length; o++) {
+      const c = i[o], s = n[c];
+      s[C] === !1 && (s[C] = !0, s[B] = !0), (s.get || s.set) && (n[c] = {
+        [B]: !0,
+        [C]: !0,
+        // could live with !!desc.set as well here...
+        [O]: s[O],
+        [v]: e[c]
+      });
+    }
+    return u.create(S(e), n);
+  } else {
+    const n = S(e);
+    if (n !== null && r)
+      return { ...e };
+    const i = u.create(n);
+    return u.assign(i, e);
+  }
+}
+function Q(e, t = !1) {
+  return U(e) || y(e) || !_(e) || (z(e) > 1 && u.defineProperties(e, {
+    set: I,
+    add: I,
+    clear: I,
+    delete: I
+  }), u.freeze(e), t && N(
+    e,
+    (r, n) => {
+      Q(n, !0);
+    },
+    !1
+  )), e;
+}
+function ge() {
+  f(2);
+}
+var I = {
+  [v]: ge
+};
+function U(e) {
+  return e === null || !q(e) ? !0 : u.isFrozen(e);
+}
+var k = "MapSet", K = "Patches", re = "ArrayMethods", ue = {};
+function P(e) {
+  const t = ue[e];
+  return t || f(0, e), t;
+}
+var ne = (e) => !!ue[e], g, le = () => g, we = (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_: ne(k) ? P(k) : void 0,
+  arrayMethodsPlugin_: ne(re) ? P(re) : void 0
+});
+function ie(e, t) {
+  t && (e.patchPlugin_ = P(K), e.patches_ = [], e.inversePatches_ = [], e.patchListener_ = t);
+}
+function Y(e) {
+  H(e), e.drafts_.forEach(ze), e.drafts_ = null;
+}
+function H(e) {
+  e === g && (g = e.parent_);
+}
+var oe = (e) => g = we(g, e);
+function ze(e) {
+  const t = e[a];
+  t.type_ === 0 || t.type_ === 1 ? t.revoke_() : t.revoked_ = !0;
+}
+function se(e, t) {
+  t.unfinalizedDrafts_ = t.drafts_.length;
+  const r = t.drafts_[0];
+  if (e !== void 0 && e !== r) {
+    r[a].modified_ && (Y(t), f(4)), _(e) && (e = ce(t, e));
+    const { patchPlugin_: i } = t;
+    i && i.generateReplacementPatches_(
+      r[a].base_,
+      e,
+      t
+    );
+  } else
+    e = ce(t, r);
+  return Ie(t, e, !0), Y(t), t.patches_ && t.patchListener_(t.patches_, t.inversePatches_), e !== ae ? e : void 0;
+}
+function ce(e, t) {
+  if (U(t))
+    return t;
+  const r = t[a];
+  if (!r)
+    return M(t, e.handledSet_, e);
+  if (!V(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);
+    he(r, e);
+  }
+  return r.copy_;
+}
+function Ie(e, t, r = !1) {
+  !e.parent_ && e.immer_.autoFreeze_ && e.canAutoFreeze_ && Q(t, r);
+}
+function de(e) {
+  e.finalized_ = !0, e.scope_.unfinalizedDrafts_--;
+}
+var V = (e, t) => e.scope_ === t, Ce = [];
+function _e(e, t, r, n) {
+  const i = d(e), o = e.type_;
+  if (n !== void 0 && W(i, n, o) === t) {
+    D(i, n, r, o);
+    return;
+  }
+  if (!e.draftLocations_) {
+    const s = e.draftLocations_ = /* @__PURE__ */ new Map();
+    N(i, (l, h) => {
+      if (y(h)) {
+        const m = s.get(h) || [];
+        m.push(l), s.set(h, m);
+      }
+    });
+  }
+  const c = e.draftLocations_.get(t) ?? Ce;
+  for (const s of c)
+    D(i, s, r, o);
+}
+function Fe(e, t, r) {
+  e.callbacks_.push(function(i) {
+    var s;
+    const o = t;
+    if (!o || !V(o, i))
+      return;
+    (s = i.mapSetPlugin_) == null || s.fixSetContents(o);
+    const c = J(o);
+    _e(e, o.draft_ ?? o, c, r), he(o, i);
+  });
+}
+function he(e, t) {
+  var n;
+  if (e.modified_ && !e.finalized_ && (e.type_ === 3 || e.type_ === 1 && e.allIndicesReassigned_ || (((n = e.assigned_) == null ? void 0 : n.size) ?? 0) > 0)) {
+    const { patchPlugin_: i } = t;
+    if (i) {
+      const o = i.getPath(e);
+      o && i.generatePatches_(e, o, t);
+    }
+    de(e);
+  }
+}
+function be(e, t, r) {
+  const { scope_: n } = e;
+  if (y(r)) {
+    const i = r[a];
+    V(i, n) && i.callbacks_.push(function() {
+      F(e);
+      const c = J(i);
+      _e(e, r, c, t);
+    });
+  } else _(r) && e.callbacks_.push(function() {
+    const o = d(e);
+    e.type_ === 3 ? o.has(r) && M(r, n.handledSet_, n) : W(o, t, e.type_) === r && n.drafts_.length > 1 && (e.assigned_.get(t) ?? !1) === !0 && e.copy_ && M(
+      W(e.copy_, t, e.type_),
+      n.handledSet_,
+      n
+    );
+  });
+}
+function M(e, t, r) {
+  return !r.immer_.autoFreeze_ && r.unfinalizedDrafts_ < 1 || y(e) || t.has(e) || !_(e) || U(e) || (t.add(e), N(e, (n, i) => {
+    if (y(i)) {
+      const o = i[a];
+      if (V(o, r)) {
+        const c = J(o);
+        D(e, n, c, e.type_), de(o);
+      }
+    } else _(i) && M(i, t, r);
+  })), e;
+}
+function Oe(e, t) {
+  const r = R(e), n = {
+    type_: r ? 1 : 0,
+    // Track which produce call this is associated with.
+    scope_: t ? t.scope_ : le(),
+    // 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, o = A;
+  r && (i = [n], o = w);
+  const { revoke: c, proxy: s } = Proxy.revocable(i, o);
+  return n.draft_ = s, n.revoke_ = c, [s, n];
+}
+var A = {
+  get(e, t) {
+    if (t === a)
+      return e;
+    let r = e.scope_.arrayMethodsPlugin_;
+    const n = e.type_ === 1 && typeof t == "string";
+    if (n && r != null && r.isArrayOperationMethod(t))
+      return r.createMethodInterceptor(e, t);
+    const i = d(e);
+    if (!te(i, t, e.type_))
+      return De(e, i, t);
+    const o = i[t];
+    if (e.finalized_ || !_(o) || n && e.operationMethod && (r != null && r.isMutatingArrayMethod(
+      e.operationMethod
+    )) && ve(t))
+      return o;
+    if (o === $(e.base_, t)) {
+      F(e);
+      const c = e.type_ === 1 ? +t : t, s = j(e.scope_, o, e, c);
+      return e.copy_[c] = s;
+    }
+    return o;
+  },
+  has(e, t) {
+    return t in d(e);
+  },
+  ownKeys(e) {
+    return Reflect.ownKeys(d(e));
+  },
+  set(e, t, r) {
+    const n = ye(d(e), t);
+    if (n != null && n.set)
+      return n.set.call(e.draft_, r), !0;
+    if (!e.modified_) {
+      const i = $(d(e), t), o = i == null ? void 0 : i[a];
+      if (o && o.base_ === r)
+        return e.copy_[t] = r, e.assigned_.set(t, !1), !0;
+      if (Se(r, i) && (r !== void 0 || te(e.base_, t, e.type_)))
+        return !0;
+      F(e), X(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), be(e, t, r)), !0;
+  },
+  deleteProperty(e, t) {
+    return F(e), $(e.base_, t) !== void 0 || t in e.base_ ? (e.assigned_.set(t, !1), X(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 = d(e), n = Reflect.getOwnPropertyDescriptor(r, t);
+    return n && {
+      [C]: !0,
+      [B]: e.type_ !== 1 || t !== "length",
+      [O]: n[O],
+      [v]: r[t]
+    };
+  },
+  defineProperty() {
+    f(11);
+  },
+  getPrototypeOf(e) {
+    return S(e.base_);
+  },
+  setPrototypeOf() {
+    f(12);
+  }
+}, w = {};
+for (let e in A) {
+  let t = A[e];
+  w[e] = function() {
+    const r = arguments;
+    return r[0] = r[0][0], t.apply(this, r);
+  };
+}
+w.deleteProperty = function(e, t) {
+  return process.env.NODE_ENV !== "production" && isNaN(parseInt(t)) && f(13), w.set.call(this, e, t, void 0);
+};
+w.set = function(e, t, r) {
+  return process.env.NODE_ENV !== "production" && t !== "length" && isNaN(parseInt(t)) && f(14), A.set.call(this, e[0], t, r, e[0]);
+};
+function $(e, t) {
+  const r = e[a];
+  return (r ? d(r) : e)[t];
+}
+function De(e, t, r) {
+  var i;
+  const n = ye(t, r);
+  return n ? v in n ? n[v] : (
+    // 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!
+    (i = n.get) == null ? void 0 : i.call(e.draft_)
+  ) : void 0;
+}
+function ye(e, t) {
+  if (!(t in e))
+    return;
+  let r = S(e);
+  for (; r; ) {
+    const n = Object.getOwnPropertyDescriptor(r, t);
+    if (n)
+      return n;
+    r = S(r);
+  }
+}
+function X(e) {
+  e.modified_ || (e.modified_ = !0, e.parent_ && X(e.parent_));
+}
+function F(e) {
+  e.copy_ || (e.assigned_ = /* @__PURE__ */ new Map(), e.copy_ = G(
+    e.base_,
+    e.scope_.immer_.useStrictShallowCopy_
+  ));
+}
+var ke = class {
+  constructor(e) {
+    this.autoFreeze_ = !0, this.useStrictShallowCopy_ = !1, this.useStrictIteration_ = !1, this.produce = (t, r, n) => {
+      if (p(t) && !p(r)) {
+        const o = r;
+        r = t;
+        const c = this;
+        return function(l = o, ...h) {
+          return c.produce(l, (m) => r.call(this, m, ...h));
+        };
+      }
+      p(r) || f(6), n !== void 0 && !p(n) && f(7);
+      let i;
+      if (_(t)) {
+        const o = oe(this), c = j(o, t, void 0);
+        let s = !0;
+        try {
+          i = r(c), s = !1;
+        } finally {
+          s ? Y(o) : H(o);
+        }
+        return ie(o, n), se(i, o);
+      } else if (!t || !q(t)) {
+        if (i = r(t), i === void 0 && (i = t), i === ae && (i = void 0), this.autoFreeze_ && Q(i, !0), n) {
+          const o = [], c = [];
+          P(K).generateReplacementPatches_(t, i, {
+            patches_: o,
+            inversePatches_: c
+          }), n(o, c);
+        }
+        return i;
+      } else
+        f(1, t);
+    }, this.produceWithPatches = (t, r) => {
+      if (p(t))
+        return (c, ...s) => this.produceWithPatches(c, (l) => t(l, ...s));
+      let n, i;
+      return [this.produce(t, r, (c, s) => {
+        n = c, i = s;
+      }), n, i];
+    }, L(e == null ? void 0 : e.autoFreeze) && this.setAutoFreeze(e.autoFreeze), L(e == null ? void 0 : e.useStrictShallowCopy) && this.setUseStrictShallowCopy(e.useStrictShallowCopy), L(e == null ? void 0 : e.useStrictIteration) && this.setUseStrictIteration(e.useStrictIteration);
+  }
+  createDraft(e) {
+    _(e) || f(8), y(e) && (e = Me(e));
+    const t = oe(this), r = j(t, e, void 0);
+    return r[a].isManual_ = !0, H(t), r;
+  }
+  finishDraft(e, t) {
+    const r = e && e[a];
+    (!r || !r.isManual_) && f(9);
+    const { scope_: n } = r;
+    return ie(n, t), se(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 = P(K).applyPatches_;
+    return y(e) ? n(e, t) : this.produce(
+      e,
+      (i) => n(i, t)
+    );
+  }
+};
+function j(e, t, r, n) {
+  const [i, o] = T(t) ? P(k).proxyMap_(t, r) : x(t) ? P(k).proxySet_(t, r) : Oe(t, r);
+  return ((r == null ? void 0 : r.scope_) ?? le()).drafts_.push(i), o.callbacks_ = (r == null ? void 0 : r.callbacks_) ?? [], o.key_ = n, r && n !== void 0 ? Fe(r, o, n) : o.callbacks_.push(function(l) {
+    var m;
+    (m = l.mapSetPlugin_) == null || m.fixSetContents(o);
+    const { patchPlugin_: h } = l;
+    o.modified_ && h && h.generatePatches_(o, [], l);
+  }), i;
+}
+function Me(e) {
+  return y(e) || f(10, e), me(e);
+}
+function me(e) {
+  if (!_(e) || U(e))
+    return e;
+  const t = e[a];
+  let r, n = !0;
+  if (t) {
+    if (!t.modified_)
+      return t.base_;
+    t.finalized_ = !0, r = G(e, t.scope_.immer_.useStrictShallowCopy_), n = t.scope_.immer_.shouldUseStrictIteration();
+  } else
+    r = G(e, !0);
+  return N(
+    r,
+    (i, o) => {
+      D(r, i, me(o));
+    },
+    n
+  ), t && (t.finalized_ = !1), r;
+}
+var Ae = new ke(), Ee = Ae.produce;
+export {
+  ke as Immer,
+  Me as current,
+  Q as freeze,
+  Z as immerable,
+  y as isDraft,
+  _ as isDraftable,
+  ae as nothing,
+  Ee as produce
+};
+//# sourceMappingURL=immer.js.map