atomaric 0.0.77 → 0.0.79

package/build/atomaric.js

@@ -1,391 +1,914 @@
-let k = () => {
+let Je = () => {
   throw "call configureAtomaric() before all!";
 };
-const _ = {}, Se = (t) => {
-  _.useSyncExternalStore = k = t.useSyncExternalStore, _.keyPathSeparator = t.keyPathSeparator, _.securifyKeyLevel = t.securifyKeyLevel, _.securifyValueLevel = t.securifyValueLevel;
-}, ne = (t) => k(t.subscribe, t.get), ie = (t) => t.set, xe = (t) => t.setDeferred, be = (t) => t.get, De = (t) => t.do, $e = (t) => [ne(t), ie(t)], _e = (t, e) => new pe(t, e);
-class V {
-  constructor(e) {
-    if (e)
+const T = {}, Ot = (e) => {
+  T.useSyncExternalStore = Je = e.useSyncExternalStore, T.keyPathSeparator = e.keyPathSeparator, T.securifyKeyLevel = e.securifyKeyLevel, T.securifyValueLevel = e.securifyValueLevel;
+}, ft = (e) => Je(e.subscribe, e.get), lt = (e) => e.set, jt = (e) => e.setDeferred, Bt = (e) => e.get, Wt = (e) => e.do, qt = (e) => [ft(e), lt(e)], Gt = (e, t) => new Rt(e, t);
+class F {
+  constructor(t) {
+    if (t)
       return new Proxy(this, {
-        get: (i, s) => s in this ? i[s] : e[s]
+        get: (r, n) => n in this ? r[n] : t[n]
       });
   }
 }
-const ce = (t, e) => {
-  const i = (s, n, c) => new Proxy(s, {
-    get: (l, h, p) => {
-      const g = c === 0 && e.get != null ? e.get(l, h, p) : l[h];
-      return typeof g == "object" && g !== null ? i(
-        Array.isArray(g) ? g.slice(0) : { ...g },
-        n.concat(Array.isArray(l) ? +h : h),
-        c + 1
-      ) : g;
+var Ye = Symbol.for("immer-nothing"), Ve = Symbol.for("immer-draftable"), m = Symbol.for("immer-state"), dt = 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 g(e, ...t) {
+  if (process.env.NODE_ENV !== "production") {
+    const r = dt[e], n = v(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 w = Object, U = w.getPrototypeOf, X = "constructor", ie = "prototype", Se = "configurable", Z = "enumerable", J = "writable", B = "value", M = (e) => !!e && !!e[m];
+function C(e) {
+  var t;
+  return e ? Qe(e) || ce(e) || !!e[Ve] || !!((t = e[X]) != null && t[Ve]) || ae(e) || ue(e) : !1;
+}
+var ht = w[ie][X].toString(), Ue = /* @__PURE__ */ new WeakMap();
+function Qe(e) {
+  if (!e || !Ee(e))
+    return !1;
+  const t = U(e);
+  if (t === null || t === w[ie])
+    return !0;
+  const r = w.hasOwnProperty.call(t, X) && t[X];
+  if (r === Object)
+    return !0;
+  if (!v(r))
+    return !1;
+  let n = Ue.get(r);
+  return n === void 0 && (n = Function.toString.call(r), Ue.set(r, n)), n === ht;
+}
+function oe(e, t, r = !0) {
+  G(e) === 0 ? (r ? Reflect.ownKeys(e) : w.keys(e)).forEach((s) => {
+    t(s, e[s], e);
+  }) : e.forEach((n, s) => t(s, n, e));
+}
+function G(e) {
+  const t = e[m];
+  return t ? t.type_ : ce(e) ? 1 : ae(e) ? 2 : ue(e) ? 3 : 0;
+}
+var Oe = (e, t, r = G(e)) => r === 2 ? e.has(t) : w[ie].hasOwnProperty.call(e, t), Pe = (e, t, r = G(e)) => (
+  // @ts-ignore
+  r === 2 ? e.get(t) : e[t]
+), ee = (e, t, r, n = G(e)) => {
+  n === 2 ? e.set(t, r) : n === 3 ? e.add(r) : e[t] = r;
+};
+function _t(e, t) {
+  return e === t ? e !== 0 || 1 / e === 1 / t : e !== e && t !== t;
+}
+var ce = Array.isArray, ae = (e) => e instanceof Map, ue = (e) => e instanceof Set, Ee = (e) => typeof e == "object", v = (e) => typeof e == "function", ge = (e) => typeof e == "boolean";
+function yt(e) {
+  const t = +e;
+  return Number.isInteger(t) && String(t) === e;
+}
+var I = (e) => e.copy_ || e.base_, Fe = (e) => e.modified_ ? e.copy_ : e.base_;
+function Ae(e, t) {
+  if (ae(e))
+    return new Map(e);
+  if (ue(e))
+    return new Set(e);
+  if (ce(e))
+    return Array[ie].slice.call(e);
+  const r = Qe(e);
+  if (t === !0 || t === "class_only" && !r) {
+    const n = w.getOwnPropertyDescriptors(e);
+    delete n[m];
+    let s = Reflect.ownKeys(n);
+    for (let i = 0; i < s.length; i++) {
+      const c = s[i], u = n[c];
+      u[J] === !1 && (u[J] = !0, u[Se] = !0), (u.get || u.set) && (n[c] = {
+        [Se]: !0,
+        [J]: !0,
+        // could live with !!desc.set as well here...
+        [Z]: u[Z],
+        [B]: e[c]
+      });
+    }
+    return w.create(U(e), n);
+  } else {
+    const n = U(e);
+    if (n !== null && r)
+      return { ...e };
+    const s = w.create(n);
+    return w.assign(s, e);
+  }
+}
+function Ne(e, t = !1) {
+  return fe(e) || M(e) || !C(e) || (G(e) > 1 && w.defineProperties(e, {
+    set: K,
+    add: K,
+    clear: K,
+    delete: K
+  }), w.freeze(e), t && oe(
+    e,
+    (r, n) => {
+      Ne(n, !0);
     },
-    set: (l, h, p) => (e.onSet(l, n, h, p, l[h]) && (l[h] = p), !0)
+    !1
+  )), e;
+}
+function pt() {
+  g(2);
+}
+var K = {
+  [B]: pt
+};
+function fe(e) {
+  return e === null || !Ee(e) ? !0 : w.isFrozen(e);
+}
+var te = "MapSet", be = "Patches", je = "ArrayMethods", Xe = {};
+function E(e) {
+  const t = Xe[e];
+  return t || g(0, e), t;
+}
+var Be = (e) => !!Xe[e], W, Ze = () => W, mt = (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_: Be(te) ? E(te) : void 0,
+  arrayMethodsPlugin_: Be(je) ? E(je) : void 0
+});
+function We(e, t) {
+  t && (e.patchPlugin_ = E(be), e.patches_ = [], e.inversePatches_ = [], e.patchListener_ = t);
+}
+function De(e) {
+  Ie(e), e.drafts_.forEach(gt), e.drafts_ = null;
+}
+function Ie(e) {
+  e === W && (W = e.parent_);
+}
+var qe = (e) => W = mt(W, e);
+function gt(e) {
+  const t = e[m];
+  t.type_ === 0 || t.type_ === 1 ? t.revoke_() : t.revoked_ = !0;
+}
+function Ge(e, t) {
+  t.unfinalizedDrafts_ = t.drafts_.length;
+  const r = t.drafts_[0];
+  if (e !== void 0 && e !== r) {
+    r[m].modified_ && (De(t), g(4)), C(e) && (e = He(t, e));
+    const { patchPlugin_: s } = t;
+    s && s.generateReplacementPatches_(
+      r[m].base_,
+      e,
+      t
+    );
+  } else
+    e = He(t, r);
+  return wt(t, e, !0), De(t), t.patches_ && t.patchListener_(t.patches_, t.inversePatches_), e !== Ye ? e : void 0;
+}
+function He(e, t) {
+  if (fe(t))
+    return t;
+  const r = t[m];
+  if (!r)
+    return re(t, e.handledSet_, e);
+  if (!le(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);
+    rt(r, e);
+  }
+  return r.copy_;
+}
+function wt(e, t, r = !1) {
+  !e.parent_ && e.immer_.autoFreeze_ && e.canAutoFreeze_ && Ne(t, r);
+}
+function et(e) {
+  e.finalized_ = !0, e.scope_.unfinalizedDrafts_--;
+}
+var le = (e, t) => e.scope_ === t, St = [];
+function tt(e, t, r, n) {
+  const s = I(e), i = e.type_;
+  if (n !== void 0 && Pe(s, n, i) === t) {
+    ee(s, n, r, i);
+    return;
+  }
+  if (!e.draftLocations_) {
+    const u = e.draftLocations_ = /* @__PURE__ */ new Map();
+    oe(s, (y, d) => {
+      if (M(d)) {
+        const h = u.get(d) || [];
+        h.push(y), u.set(d, h);
+      }
+    });
+  }
+  const c = e.draftLocations_.get(t) ?? St;
+  for (const u of c)
+    ee(s, u, r, i);
+}
+function Pt(e, t, r) {
+  e.callbacks_.push(function(s) {
+    var u;
+    const i = t;
+    if (!i || !le(i, s))
+      return;
+    (u = s.mapSetPlugin_) == null || u.fixSetContents(i);
+    const c = Fe(i);
+    tt(e, i.draft_ ?? i, c, r), rt(i, s);
+  });
+}
+function rt(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_: s } = t;
+    if (s) {
+      const i = s.getPath(e);
+      i && s.generatePatches_(e, i, t);
+    }
+    et(e);
+  }
+}
+function At(e, t, r) {
+  const { scope_: n } = e;
+  if (M(r)) {
+    const s = r[m];
+    le(s, n) && s.callbacks_.push(function() {
+      Y(e);
+      const c = Fe(s);
+      tt(e, r, c, t);
+    });
+  } else C(r) && e.callbacks_.push(function() {
+    const i = I(e);
+    e.type_ === 3 ? i.has(r) && re(r, n.handledSet_, n) : Pe(i, t, e.type_) === r && n.drafts_.length > 1 && (e.assigned_.get(t) ?? !1) === !0 && e.copy_ && re(
+      Pe(e.copy_, t, e.type_),
+      n.handledSet_,
+      n
+    );
   });
-  return i(t, [], 0);
+}
+function re(e, t, r) {
+  return !r.immer_.autoFreeze_ && r.unfinalizedDrafts_ < 1 || M(e) || t.has(e) || !C(e) || fe(e) || (t.add(e), oe(e, (n, s) => {
+    if (M(s)) {
+      const i = s[m];
+      if (le(i, r)) {
+        const c = Fe(i);
+        ee(e, n, c, e.type_), et(i);
+      }
+    } else C(s) && re(s, t, r);
+  })), e;
+}
+function bt(e, t) {
+  const r = ce(e), n = {
+    type_: r ? 1 : 0,
+    // Track which produce call this is associated with.
+    scope_: t ? t.scope_ : Ze(),
+    // 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 s = n, i = ne;
+  r && (s = [n], i = q);
+  const { revoke: c, proxy: u } = Proxy.revocable(s, i);
+  return n.draft_ = u, n.revoke_ = c, [u, n];
+}
+var ne = {
+  get(e, t) {
+    if (t === m)
+      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 s = I(e);
+    if (!Oe(s, t, e.type_))
+      return Dt(e, s, t);
+    const i = s[t];
+    if (e.finalized_ || !C(i) || n && e.operationMethod && (r != null && r.isMutatingArrayMethod(
+      e.operationMethod
+    )) && yt(t))
+      return i;
+    if (i === we(e.base_, t)) {
+      Y(e);
+      const c = e.type_ === 1 ? +t : t, u = Me(e.scope_, i, e, c);
+      return e.copy_[c] = u;
+    }
+    return i;
+  },
+  has(e, t) {
+    return t in I(e);
+  },
+  ownKeys(e) {
+    return Reflect.ownKeys(I(e));
+  },
+  set(e, t, r) {
+    const n = nt(I(e), t);
+    if (n != null && n.set)
+      return n.set.call(e.draft_, r), !0;
+    if (!e.modified_) {
+      const s = we(I(e), t), i = s == null ? void 0 : s[m];
+      if (i && i.base_ === r)
+        return e.copy_[t] = r, e.assigned_.set(t, !1), !0;
+      if (_t(r, s) && (r !== void 0 || Oe(e.base_, t, e.type_)))
+        return !0;
+      Y(e), Ce(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), At(e, t, r)), !0;
+  },
+  deleteProperty(e, t) {
+    return Y(e), we(e.base_, t) !== void 0 || t in e.base_ ? (e.assigned_.set(t, !1), Ce(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 = I(e), n = Reflect.getOwnPropertyDescriptor(r, t);
+    return n && {
+      [J]: !0,
+      [Se]: e.type_ !== 1 || t !== "length",
+      [Z]: n[Z],
+      [B]: r[t]
+    };
+  },
+  defineProperty() {
+    g(11);
+  },
+  getPrototypeOf(e) {
+    return U(e.base_);
+  },
+  setPrototypeOf() {
+    g(12);
+  }
+}, q = {};
+for (let e in ne) {
+  let t = ne[e];
+  q[e] = function() {
+    const r = arguments;
+    return r[0] = r[0][0], t.apply(this, r);
+  };
+}
+q.deleteProperty = function(e, t) {
+  return process.env.NODE_ENV !== "production" && isNaN(parseInt(t)) && g(13), q.set.call(this, e, t, void 0);
 };
-class O extends V {
-  constructor() {
-    super(...arguments), this.updateValue = (e, i) => {
-      const s = Array.isArray(e) ? e.slice(0) : { ...e };
-      let n = !1;
-      const c = ce(e, {
-        onSet: (l, h, p, g, w) => {
-          if (g === w) return !0;
-          let m = s;
-          n = !0;
-          for (const f of h) {
-            const d = m[f];
-            m = m[f] = Array.isArray(d) ? d.slice() : { ...d };
-          }
-          return m[p] = g, !0;
+q.set = function(e, t, r) {
+  return process.env.NODE_ENV !== "production" && t !== "length" && isNaN(parseInt(t)) && g(14), ne.set.call(this, e[0], t, r, e[0]);
+};
+function we(e, t) {
+  const r = e[m];
+  return (r ? I(r) : e)[t];
+}
+function Dt(e, t, r) {
+  var s;
+  const n = nt(t, r);
+  return n ? B in n ? n[B] : (
+    // 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!
+    (s = n.get) == null ? void 0 : s.call(e.draft_)
+  ) : void 0;
+}
+function nt(e, t) {
+  if (!(t in e))
+    return;
+  let r = U(e);
+  for (; r; ) {
+    const n = Object.getOwnPropertyDescriptor(r, t);
+    if (n)
+      return n;
+    r = U(r);
+  }
+}
+function Ce(e) {
+  e.modified_ || (e.modified_ = !0, e.parent_ && Ce(e.parent_));
+}
+function Y(e) {
+  e.copy_ || (e.assigned_ = /* @__PURE__ */ new Map(), e.copy_ = Ae(
+    e.base_,
+    e.scope_.immer_.useStrictShallowCopy_
+  ));
+}
+var It = class {
+  constructor(e) {
+    this.autoFreeze_ = !0, this.useStrictShallowCopy_ = !1, this.useStrictIteration_ = !1, this.produce = (t, r, n) => {
+      if (v(t) && !v(r)) {
+        const i = r;
+        r = t;
+        const c = this;
+        return function(y = i, ...d) {
+          return c.produce(y, (h) => r.call(this, h, ...d));
+        };
+      }
+      v(r) || g(6), n !== void 0 && !v(n) && g(7);
+      let s;
+      if (C(t)) {
+        const i = qe(this), c = Me(i, t, void 0);
+        let u = !0;
+        try {
+          s = r(c), u = !1;
+        } finally {
+          u ? De(i) : Ie(i);
         }
-      });
-      return i(c), n ? s : e;
-    };
+        return We(i, n), Ge(s, i);
+      } else if (!t || !Ee(t)) {
+        if (s = r(t), s === void 0 && (s = t), s === Ye && (s = void 0), this.autoFreeze_ && Ne(s, !0), n) {
+          const i = [], c = [];
+          E(be).generateReplacementPatches_(t, s, {
+            patches_: i,
+            inversePatches_: c
+          }), n(i, c);
+        }
+        return s;
+      } else
+        g(1, t);
+    }, this.produceWithPatches = (t, r) => {
+      if (v(t))
+        return (c, ...u) => this.produceWithPatches(c, (y) => t(y, ...u));
+      let n, s;
+      return [this.produce(t, r, (c, u) => {
+        n = c, s = u;
+      }), n, s];
+    }, ge(e == null ? void 0 : e.autoFreeze) && this.setAutoFreeze(e.autoFreeze), ge(e == null ? void 0 : e.useStrictShallowCopy) && this.setUseStrictShallowCopy(e.useStrictShallowCopy), ge(e == null ? void 0 : e.useStrictIteration) && this.setUseStrictIteration(e.useStrictIteration);
+  }
+  createDraft(e) {
+    C(e) || g(8), M(e) && (e = Ct(e));
+    const t = qe(this), r = Me(t, e, void 0);
+    return r[m].isManual_ = !0, Ie(t), r;
+  }
+  finishDraft(e, t) {
+    const r = e && e[m];
+    (!r || !r.isManual_) && g(9);
+    const { scope_: n } = r;
+    return We(n, t), Ge(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 s = t[r];
+      if (s.path.length === 0 && s.op === "replace") {
+        e = s.value;
+        break;
+      }
+    }
+    r > -1 && (t = t.slice(r + 1));
+    const n = E(be).applyPatches_;
+    return M(e) ? n(e, t) : this.produce(
+      e,
+      (s) => n(s, t)
+    );
+  }
+};
+function Me(e, t, r, n) {
+  const [s, i] = ae(t) ? E(te).proxyMap_(t, r) : ue(t) ? E(te).proxySet_(t, r) : bt(t, r);
+  return ((r == null ? void 0 : r.scope_) ?? Ze()).drafts_.push(s), i.callbacks_ = (r == null ? void 0 : r.callbacks_) ?? [], i.key_ = n, r && n !== void 0 ? Pt(r, i, n) : i.callbacks_.push(function(y) {
+    var h;
+    (h = y.mapSetPlugin_) == null || h.fixSetContents(i);
+    const { patchPlugin_: d } = y;
+    i.modified_ && d && d.generatePatches_(i, [], y);
+  }), s;
 }
-class oe extends O {
-  constructor(e, i) {
-    super(i), this.a = e, this.push = (...s) => {
-      s.length !== 0 && this.a.set(this.a.get().concat(s));
-    }, this.unshift = (...s) => {
-      s.length !== 0 && this.a.set(s.concat(this.a.get()));
-    }, this.update = (s) => {
-      const n = this.a.get(), c = this.updateValue(n, s);
-      c !== n && this.a.set(c);
-    }, this.filter = (s) => {
-      const n = this.a.get().filter(s ?? ae);
-      n.length !== this.a.get().length && this.a.set(n);
-    }, this.add = (s) => {
-      this.a.get().includes(s) || this.a.set(this.a.get().concat([s]));
-    }, this.removeFirst = (s) => {
-      const n = this.a.get().indexOf(s);
-      if (n < 0) return;
-      const c = this.a.get().slice(0);
-      c.splice(n, 1), this.a.set(c);
-    }, this.toggle = (s, n) => {
-      const c = this.a.get().slice(), l = c.indexOf(s);
-      l < 0 ? n ? c.unshift(s) : c.push(s) : c.splice(l, 1), this.a.set(c);
+function Ct(e) {
+  return M(e) || g(10, e), st(e);
+}
+function st(e) {
+  if (!C(e) || fe(e))
+    return e;
+  const t = e[m];
+  let r, n = !0;
+  if (t) {
+    if (!t.modified_)
+      return t.base_;
+    t.finalized_ = !0, r = Ae(e, t.scope_.immer_.useStrictShallowCopy_), n = t.scope_.immer_.shouldUseStrictIteration();
+  } else
+    r = Ae(e, !0);
+  return oe(
+    r,
+    (s, i) => {
+      ee(r, s, st(i));
+    },
+    n
+  ), t && (t.finalized_ = !1), r;
+}
+var Mt = new It(), it = Mt.produce;
+class zt extends F {
+  constructor(t, r) {
+    super(r), this.a = t, this.push = (...n) => {
+      n.length !== 0 && this.a.set(this.a.get().concat(n));
+    }, this.unshift = (...n) => {
+      n.length !== 0 && this.a.set(n.concat(this.a.get()));
+    }, this.update = (n) => {
+      const s = this.a.get(), i = it(s, (c) => void n(c));
+      i !== s && this.a.set(i);
+    }, this.filter = (n) => {
+      const s = this.a.get().filter(n ?? xt);
+      s.length !== this.a.get().length && this.a.set(s);
+    }, this.add = (n) => {
+      this.a.get().includes(n) || this.a.set(this.a.get().concat([n]));
+    }, this.removeFirst = (n) => {
+      const s = this.a.get().indexOf(n);
+      if (s < 0) return;
+      const i = this.a.get().slice(0);
+      i.splice(s, 1), this.a.set(i);
+    }, this.toggle = (n, s) => {
+      const i = this.a.get().slice(), c = i.indexOf(n);
+      c < 0 ? s ? i.unshift(n) : i.push(n) : i.splice(c, 1), this.a.set(i);
     };
   }
 }
-const ae = (t) => t;
-class ue extends V {
-  constructor(e, i) {
-    super(i), this.a = e, this.toggle = () => {
+const xt = (e) => e;
+class vt extends F {
+  constructor(t, r) {
+    super(r), this.a = t, this.toggle = () => {
       this.a.set(!this.a.get());
     };
   }
 }
-class le extends V {
-  constructor(e, i) {
-    super(i), this.a = e, this.setValue = (s, n) => {
-      if (this.a.get().get(s) === n) return;
-      const c = new Map(this.a.get());
-      c.set(s, n), this.a.set(c);
-    }, this.setIfNo = (s, n) => {
-      if (this.a.get().has(s)) return;
-      const c = new Map(this.a.get());
-      c.set(s, n), this.a.set(c);
-    }, this.delete = (s) => {
-      if (!this.a.get().has(s)) return;
-      const n = new Map(this.a.get());
-      n.delete(s), this.a.set(n);
-    }, this.toggle = (s, n) => {
-      const c = new Map(this.a.get());
-      c.has(s) ? c.delete(s) : c.set(s, n), this.a.set(c);
+class Tt extends F {
+  constructor(t, r) {
+    super(r), this.a = t, this.setValue = (n, s) => {
+      if (this.a.get().get(n) === s) return;
+      const i = new Map(this.a.get());
+      i.set(n, s), this.a.set(i);
+    }, this.setIfNo = (n, s) => {
+      if (this.a.get().has(n)) return;
+      const i = new Map(this.a.get());
+      i.set(n, s), this.a.set(i);
+    }, this.delete = (n) => {
+      if (!this.a.get().has(n)) return;
+      const s = new Map(this.a.get());
+      s.delete(n), this.a.set(s);
+    }, this.toggle = (n, s) => {
+      const i = new Map(this.a.get());
+      i.has(n) ? i.delete(n) : i.set(n, s), this.a.set(i);
     }, this.clear = () => {
       this.a.set(/* @__PURE__ */ new Map());
-    }, this.a = e;
+    }, this.a = t;
   }
 }
-class fe extends V {
-  constructor(e, i) {
-    super(i), this.a = e, this.increment = (s) => {
-      this.a.set(+this.a.get() + (s ?? 1));
+class Et extends F {
+  constructor(t, r) {
+    super(r), this.a = t, this.increment = (n) => {
+      this.a.set(+this.a.get() + (n ?? 1));
     };
   }
 }
-class he extends O {
-  constructor(e, i) {
-    super(i), this.a = e, this.setPartial = (s) => this.a.set((n) => ({
-      ...n,
-      ...typeof s == "function" ? s(this.a.get()) : s
-    })), this.update = (s) => {
-      const n = this.a.get(), c = this.updateValue(n, s);
-      c !== n && this.a.set(c);
-    }, this.setDeepPartial = (s, n, c, l = _.keyPathSeparator || ".") => {
-      if (!l) return;
-      if (s.includes(l)) {
-        let g = s.split(l);
-        const w = g[g.length - 1];
-        g = g.slice(0, -1);
-        const m = { ...this.a.get() };
-        let f = m, d = c;
-        for (const y of g) {
-          d = d == null ? void 0 : d[Array.isArray(d) ? "0" : y];
-          const D = f[v(f, y)] ?? (Array.isArray(d) ? [] : {});
-          if (D == null || typeof D != "object") {
-            if (c == null) throw "Incorrect path for setDeepPartial";
-            const S = typeof n == "function" ? n(void 0) : n;
-            this.a.get()[s] !== S && this.setPartial({ [s]: S });
+class Ft extends F {
+  constructor(t, r) {
+    super(r), this.a = t, this.setPartial = (n) => this.a.set((s) => ({
+      ...s,
+      ...typeof n == "function" ? n(this.a.get()) : n
+    })), this.update = (n) => {
+      const s = this.a.get(), i = it(s, (c) => void n(c));
+      i !== s && this.a.set(i);
+    }, this.setDeepPartial = (n, s, i, c = T.keyPathSeparator || ".") => {
+      if (!c) return;
+      if (n.includes(c)) {
+        let d = n.split(c);
+        const h = d[d.length - 1];
+        d = d.slice(0, -1);
+        const O = { ...this.a.get() };
+        let _ = O, p = i;
+        for (const S of d) {
+          p = p == null ? void 0 : p[Array.isArray(p) ? "0" : S];
+          const z = _[Ke(_, S)] ?? (Array.isArray(p) ? [] : {});
+          if (z == null || typeof z != "object") {
+            if (i == null) throw "Incorrect path for setDeepPartial";
+            const A = typeof s == "function" ? s(void 0) : s;
+            this.a.get()[n] !== A && this.setPartial({ [n]: A });
             return;
           }
-          f = f[v(f, y)] = Array.isArray(D) ? [...D] : { ...D };
+          _ = _[Ke(_, S)] = Array.isArray(z) ? [...z] : { ...z };
         }
-        const E = f[w];
-        f[w] = typeof n == "function" ? n(f[w]) : n, E !== f[w] && this.a.set(m);
+        const H = _[h];
+        _[h] = typeof s == "function" ? s(_[h]) : s, H !== _[h] && this.a.set(O);
         return;
       }
-      const h = this.a.get()[s], p = typeof n == "function" ? n(h) : n;
-      p !== h && this.setPartial({ [s]: p });
+      const u = this.a.get()[n], y = typeof s == "function" ? s(u) : s;
+      y !== u && this.setPartial({ [n]: y });
     };
   }
 }
-const v = (t, e) => Array.isArray(t) ? `${+e}` : e;
-class de extends V {
-  constructor(e, i) {
-    super(i), this.a = e, this.add = (s) => {
-      this.a.get().has(s) || this.a.set(new Set(this.a.get()).add(s));
-    }, this.delete = (s) => {
-      if (!this.a.get().has(s)) return;
-      const n = new Set(this.a.get());
-      n.delete(s), this.a.set(n);
-    }, this.toggle = (s) => {
-      const n = new Set(this.a.get());
-      n.has(s) ? n.delete(s) : n.add(s), this.a.set(n);
+const Ke = (e, t) => Array.isArray(e) ? `${+t}` : t;
+class Nt extends F {
+  constructor(t, r) {
+    super(r), this.a = t, this.add = (n) => {
+      this.a.get().has(n) || this.a.set(new Set(this.a.get()).add(n));
+    }, this.delete = (n) => {
+      if (!this.a.get().has(n)) return;
+      const s = new Set(this.a.get());
+      s.delete(n), this.a.set(s);
+    }, this.toggle = (n) => {
+      const s = new Set(this.a.get());
+      s.has(n) ? s.delete(n) : s.add(n), this.a.set(s);
     }, this.clear = () => {
       this.a.set(/* @__PURE__ */ new Set());
-    }, this.a = e;
+    }, this.a = t;
   }
 }
-const ge = (t, e, i) => {
-  const s = typeof i == "object" && i != null && "do" in i ? i.do(
-    (c, l) => e.set(c, l),
-    () => e.get(),
-    e,
-    (c, l, h) => e.setDeferred(c, l, h)
-  ) : null, n = {};
-  return s && Object.keys(s).forEach((c) => Object.defineProperty(n, c, { get: () => s[c] })), typeof t == "number" ? new fe(e, s) : typeof t == "boolean" ? new ue(e, s) : Array.isArray(t) ? new oe(e, s) : t instanceof Set ? new de(e, s) : t instanceof Map ? new le(e, s) : t instanceof Object ? new he(e, s) : new V(s);
+const $t = (e, t, r) => {
+  const n = typeof r == "object" && r != null && "do" in r ? r.do(
+    (i, c) => t.set(i, c),
+    () => t.get(),
+    t,
+    (i, c, u) => t.setDeferred(i, c, u)
+  ) : null, s = {};
+  return n && Object.keys(n).forEach((i) => Object.defineProperty(s, i, { get: () => n[i] })), typeof e == "number" ? new Et(t, n) : typeof e == "boolean" ? new vt(t, n) : Array.isArray(e) ? new zt(t, n) : e instanceof Set ? new Nt(t, n) : e instanceof Map ? new Tt(t, n) : e instanceof Object ? new Ft(t, n) : new F(n);
 };
-class pe {
-  constructor(e, i) {
-    e = typeof e == "function" ? e() : e;
-    const s = (r) => g = r, n = () => g, c = /* @__PURE__ */ new Set(), l = (r) => r(f());
-    let h = !0, p = !1, g = e, w, m = () => {
-    }, f = () => n(), d = null, E = () => {
-      const r = ge(e, y, i);
-      return E = () => r, r;
+class Rt {
+  constructor(t, r) {
+    t = typeof t == "function" ? t() : t;
+    const n = (o) => d = o, s = () => d, i = /* @__PURE__ */ new Set(), c = (o) => o(_());
+    let u = !0, y = !1, d = t, h, O = () => {
+    }, _ = () => s(), p = null, H = () => {
+      const o = $t(t, S, r);
+      return H = () => o, o;
     };
-    const y = new Proxy(this, {
-      get: (r, u) => u === "do" ? E() : r[u],
-      set: we
-    }), D = () => {
-      h = !0, p !== !0 && m(f()), p = !1;
+    const S = new Proxy(this, {
+      get: (o, l) => l === "do" ? H() : o[l],
+      set: kt
+    }), z = () => {
+      u = !0, y !== !0 && O(_()), y = !1;
       try {
-        H.postMessage({ key: a, value: n() });
+        ze.postMessage({ key: f, value: s() });
       } catch {
       }
-    }, S = (r, u) => {
-      const x = typeof r == "function" ? r(f()) : r;
-      x !== f() && (s(x), p = u, h && (h = !1, c.forEach(l), queueMicrotask(D)));
+    }, A = (o, l) => {
+      const b = typeof o == "function" ? o(_()) : o;
+      b !== _() && (n(b), y = l, u && (u = !1, i.forEach(c), queueMicrotask(z)));
     };
-    this.set = (r, u) => S(r, u), this.get = () => f(), this.initialValue = e, this.isInitialValue = () => e === n(), this.subscribe = (r) => (c.add(r), () => {
-      c.delete(r);
+    this.set = (o, l) => A(o, l), this.get = () => _(), this.initialValue = t, this.isInitialValue = () => t === s(), this.subscribe = (o) => (i.add(o), () => {
+      i.delete(o);
     }), this.reset = () => {
-      S(e, !0);
+      A(t, !0);
     };
-    const re = (r, u) => {
-      S(r, u), w = void 0;
+    const ut = (o, l) => {
+      A(o, l), h = void 0;
     };
-    if (this.setDeferred = (r, u = 500, x, b = !0) => {
-      b && w === void 0 && S(r, x), clearTimeout(w), w = setTimeout(re, u, r, x);
-    }, i == null) return y;
-    let A = null, j = null, q = !0, F = !0, N = !1, $ = 0, M = 0, K = -1, T = e instanceof Set ? (r) => new Set(r) : e instanceof Map ? (r) => new Map(r) : (r) => r, I = e instanceof Set ? (r) => {
-      if (r instanceof Set) return Array.from(r);
-      throw console.error(r), "The value is not Set instance";
-    } : e instanceof Map ? (r) => {
-      if (r instanceof Map) {
-        const u = [];
-        return r.forEach((x, b) => u.push([b, x])), u;
+    if (this.setDeferred = (o, l = 500, b, D = !0) => {
+      D && h === void 0 && A(o, b), clearTimeout(h), h = setTimeout(ut, l, o, b);
+    }, r == null) return S;
+    let P = null, j = null, he = !0, _e = !0, ye = !1, x = 0, N = 0, $e = -1, $ = t instanceof Set ? (o) => new Set(o) : t instanceof Map ? (o) => new Map(o) : (o) => o, R = t instanceof Set ? (o) => {
+      if (o instanceof Set) return Array.from(o);
+      throw console.error(o), "The value is not Set instance";
+    } : t instanceof Map ? (o) => {
+      if (o instanceof Map) {
+        const l = [];
+        return o.forEach((b, D) => l.push([D, b])), l;
       }
-      throw console.error(r), "The value is not Set instance";
-    } : (r) => r;
-    if (typeof i == "string")
-      A = i;
-    else if ("storeKey" in i)
-      q = i.warnOnDuplicateStoreKey ?? q, F = i.listenStorageChanges ?? F, A = i.storeKey, T = i.unzipValue ?? T, I = i.zipValue ?? I, N = i.unchangable ?? N, $ = i.securifyKeyLevel ?? _.securifyKeyLevel ?? $, M = i.securifyValueLevel ?? _.securifyValueLevel ?? M, j = i.exp ?? j;
-    else return y;
-    const B = $ ? L(A, $) : A, a = `${M ? J : C}${B}`;
-    if ($) {
-      const r = `${C}${A}`;
-      r in o && (o[a] = o[r], delete o[r]);
+      throw console.error(o), "The value is not Set instance";
+    } : (o) => o;
+    if (typeof r == "string")
+      P = r;
+    else if ("storeKey" in r)
+      he = r.warnOnDuplicateStoreKey ?? he, _e = r.listenStorageChanges ?? _e, P = r.storeKey, $ = r.unzipValue ?? $, R = r.zipValue ?? R, ye = r.unchangable ?? ye, x = r.securifyKeyLevel ?? T.securifyKeyLevel ?? x, N = r.securifyValueLevel ?? T.securifyValueLevel ?? N, j = r.exp ?? j;
+    else return S;
+    const pe = x ? k(P, x) : P, f = `${N ? xe : L}${pe}`;
+    if (x) {
+      const o = `${L}${P}`;
+      o in a && (a[f] = a[o], delete a[o]);
     } else {
-      const r = `${C}${L(A, $)}`;
-      r in o && (o[a] = o[r], delete o[r]);
+      const o = `${L}${k(P, x)}`;
+      o in a && (a[f] = a[o], delete a[o]);
     }
-    const W = j === null || !(j(y, a in o) instanceof Date) ? (r) => L([I(r)], 0) : (r) => (d ?? (d = {}), d.exp = j(y, a in o).getTime(), d.exp - Date.now() < 24 * 60 * 60 * 1e3 && (clearTimeout(K), clearTimeout(ee[a]), K = setTimeout(() => this.reset(), d.exp - Date.now())), d.exp = Math.trunc(d.exp / 1e3), L([I(r), d], 0));
-    if (M) {
-      const r = `${C}${B}`, u = I, x = T;
-      if (I = (b) => {
+    const me = j === null || !(j(S, f in a) instanceof Date) ? (o) => k([R(o)], 0) : (o) => (p ?? (p = {}), p.exp = j(S, f in a).getTime(), p.exp - Date.now() < 24 * 60 * 60 * 1e3 && (clearTimeout($e), clearTimeout(ot[f]), $e = setTimeout(() => this.reset(), p.exp - Date.now())), p.exp = Math.trunc(p.exp / 1e3), k([R(o), p], 0));
+    if (N) {
+      const o = `${L}${pe}`, l = R, b = $;
+      if (R = (D) => {
         try {
-          return L([u(b)], M);
+          return k([l(D)], N);
         } catch {
-          return delete o[a], "";
+          return delete a[f], "";
         }
-      }, r in o) {
-        const b = `${C}${L(A, $)}`;
+      }, o in a) {
+        const D = `${L}${k(P, x)}`;
         try {
-          o[b] = W(T(z(o[r], 0)[0])), delete o[r];
+          a[D] = me($(Q(a[o], 0)[0])), delete a[o];
         } catch {
         }
       }
-      T = (b) => {
+      $ = (D) => {
         try {
-          return x(z(b, M)[0]);
+          return b(Q(D, N)[0]);
         } catch {
-          return delete o[a], "";
+          return delete a[f], "";
         }
       };
-    } else delete o[`${J}${B}`];
-    const X = (r) => {
-      const u = z(r, 0);
-      return d = u[1], T(u[0]);
+    } else delete a[`${xe}${pe}`];
+    const Re = (o) => {
+      const l = Q(o, 0);
+      return p = l[1], $(l[0]);
     };
-    let Y = !0;
-    if (G[a] = y, o[`atom/${A}`] && (o[a] || (o[a] = `[${o[`atom/${A}`]}]`), delete o[`atom/${A}`]), f = () => {
-      if (f = n, Y) {
-        Y = !1;
+    let ke = !0;
+    if (ve[f] = S, a[`atom/${P}`] && (a[f] || (a[f] = `[${a[`atom/${P}`]}]`), delete a[`atom/${P}`]), _ = () => {
+      if (_ = s, ke) {
+        ke = !1;
         try {
-          s(a in o ? X(o[a]) : e);
+          n(f in a ? Re(a[f]) : t);
         } catch {
-          console.warn("Invalid json value", o[a]);
+          console.warn("Invalid json value", a[f]);
         }
       }
-      return n();
-    }, m = (r) => {
-      if (r === e) {
+      return s();
+    }, O = (o) => {
+      if (o === t) {
         this.reset();
         return;
       }
-      o[a] = W(r);
+      a[f] = me(o);
     }, this.reset = () => {
-      delete o[a], S(e, !0);
-    }, q && P[a] !== void 0 && console.warn("Duplicate Atom key", A), F)
-      if (N) {
-        let r = !1, u;
-        U[a] = this, P[a] = () => {
-          clearTimeout(u), u = setTimeout(() => r = !1, 10), !r && (r = !0, o[a] = W(n()));
+      delete a[f], A(t, !0);
+    }, he && V[f] !== void 0 && console.warn("Duplicate Atom key", P), _e)
+      if (ye) {
+        let o = !1, l;
+        de[f] = this, V[f] = () => {
+          clearTimeout(l), l = setTimeout(() => o = !1, 10), !o && (o = !0, a[f] = me(s()));
         };
       } else
-        P[a] = (r) => {
-          if (r.newValue === null) {
+        V[f] = (o) => {
+          if (o.newValue === null) {
             this.reset();
             return;
           }
           try {
-            S(X(r.newValue));
+            A(Re(o.newValue));
           } catch {
-            console.warn("Invalid json value", r.newValue);
+            console.warn("Invalid json value", o.newValue);
           }
         };
-    return y;
+    return S;
   }
 }
-let H;
+let ze;
 try {
-  H = new BroadcastChannel("updateHere"), H.addEventListener("message", (t) => {
-    var e;
-    (e = U[t.data.key]) == null || e.set(t.data.value, !0);
+  ze = new BroadcastChannel("updateHere"), ze.addEventListener("message", (e) => {
+    var t;
+    (t = de[e.data.key]) == null || t.set(e.data.value, !0);
   });
 } catch {
 }
-const o = localStorage, P = {}, U = {}, we = (t, e) => {
-  throw `${e} is readonly property`;
+const a = localStorage, V = {}, de = {}, kt = (e, t) => {
+  throw `${t} is readonly property`;
 };
-window.addEventListener("storage", (t) => {
-  var e;
-  t.key === null || t.newValue === t.oldValue || (e = P[t.key]) == null || e.call(P, t);
+window.addEventListener("storage", (e) => {
+  var t;
+  e.key === null || e.newValue === e.oldValue || (t = V[e.key]) == null || t.call(V, e);
 });
-const ye = o.setItem.bind(o), Ae = o.removeItem.bind(o);
-o.setItem = (t, e) => {
-  U[t] === void 0 && ye.call(o, t, e);
+const Lt = a.setItem.bind(a), Vt = a.removeItem.bind(a);
+a.setItem = (e, t) => {
+  de[e] === void 0 && Lt.call(a, e, t);
 };
-o.removeItem = (t) => {
-  U[t] === void 0 && Ae.call(o, t);
+a.removeItem = (e) => {
+  de[e] === void 0 && Vt.call(a, e);
 };
-const me = /"exp":\s*(\d+)/, C = "atom\\", J = "atom`s\\", G = {}, ee = {}, te = /[a-z]/gi, R = 5, Q = {};
-for (let t = 54; t < 80; t++) {
-  if (t === 68 || t === 72 || t === 55) continue;
-  const e = String.fromCharCode(t + 43).toUpperCase(), i = String.fromCharCode(t + 43).toLowerCase();
-  Q[e] = i, Q[i] = e;
-}
-const se = (t) => Q[t] ?? t, L = /* @__PURE__ */ (() => {
-  const t = [
-    (e) => JSON.stringify(e),
-    (e) => btoa(encodeURI(t[0](e))),
-    (e) => {
-      const i = t[1](e);
-      return `${i.slice(0, R)}${i.slice(R).replace(te, se)}`;
+const Ut = /"exp":\s*(\d+)/, L = "atom\\", xe = "atom`s\\", ve = {}, ot = {}, ct = /[a-z]/gi, se = 5, Te = {};
+for (let e = 54; e < 80; e++) {
+  if (e === 68 || e === 72 || e === 55) continue;
+  const t = String.fromCharCode(e + 43).toUpperCase(), r = String.fromCharCode(e + 43).toLowerCase();
+  Te[t] = r, Te[r] = t;
+}
+const at = (e) => Te[e] ?? e, k = /* @__PURE__ */ (() => {
+  const e = [
+    (t) => JSON.stringify(t),
+    (t) => btoa(encodeURI(e[0](t))),
+    (t) => {
+      const r = e[1](t);
+      return `${r.slice(0, se)}${r.slice(se).replace(ct, at)}`;
     },
-    (e) => btoa(t[2](e))
+    (t) => btoa(e[2](t))
   ];
-  return (e, i) => {
+  return (t, r) => {
     try {
-      return t[i](e);
-    } catch (s) {
-      if (i === 0) throw s;
-      return t[0](e);
+      return e[r](t);
+    } catch (n) {
+      if (r === 0) throw n;
+      return e[0](t);
     }
   };
-})(), z = /* @__PURE__ */ (() => {
-  const t = [
-    (e) => JSON.parse(e),
-    (e) => t[0](decodeURI(atob(e))),
-    (e) => t[1](
-      `${e.slice(0, R)}${e.slice(R).replace(te, se)}`
+})(), Q = /* @__PURE__ */ (() => {
+  const e = [
+    (t) => JSON.parse(t),
+    (t) => e[0](decodeURI(atob(t))),
+    (t) => e[1](
+      `${t.slice(0, se)}${t.slice(se).replace(ct, at)}`
     ),
-    (e) => t[2](atob(e))
+    (t) => e[2](atob(t))
   ];
-  return (e, i) => {
+  return (t, r) => {
     try {
-      return t[i](e);
-    } catch (s) {
-      if (i === 0) throw s;
-      return t[0](e);
+      return e[r](t);
+    } catch (n) {
+      if (r === 0) throw n;
+      return e[0](t);
     }
   };
 })();
 setTimeout(() => {
-  Object.keys(o).forEach((t) => {
-    var s;
-    if (typeof o[t] != "string" || !t.startsWith(C) && !t.startsWith(J)) return;
-    const e = (s = o[t].match(me)) == null ? void 0 : s[1];
-    if (!e || +e * 1e3 - Date.now() > 24 * 60 * 60 * 1e3) return;
-    const i = z(o[t], 0);
-    !Array.isArray(i) || i[1] == null || !("exp" in i[1]) || i[1].exp !== e || (ee[t] = setTimeout(() => {
-      G[t] ? G[t].reset() : delete o[t];
-    }, +e * 1e3 - Date.now()));
+  Object.keys(a).forEach((e) => {
+    var n;
+    if (typeof a[e] != "string" || !e.startsWith(L) && !e.startsWith(xe)) return;
+    const t = (n = a[e].match(Ut)) == null ? void 0 : n[1];
+    if (!t || +t * 1e3 - Date.now() > 24 * 60 * 60 * 1e3) return;
+    const r = Q(a[e], 0);
+    !Array.isArray(r) || r[1] == null || !("exp" in r[1]) || r[1].exp !== t || (ot[e] = setTimeout(() => {
+      ve[e] ? ve[e].reset() : delete a[e];
+    }, +t * 1e3 - Date.now()));
   });
 }, 1e3);
 export {
-  pe as Atom,
-  oe as AtomArrayDoActions,
-  ue as AtomBooleanDoActions,
-  le as AtomMapDoActions,
-  fe as AtomNumberDoActions,
-  he as AtomObjectDoActions,
-  de as AtomSetDoActions,
-  _e as atom,
-  Se as configureAtomaric,
-  _ as configuredOptions,
-  $e as useAtom,
-  De as useAtomDo,
-  be as useAtomGet,
-  ie as useAtomSet,
-  xe as useAtomSetDeferred,
-  ne as useAtomValue
+  Rt as Atom,
+  zt as AtomArrayDoActions,
+  vt as AtomBooleanDoActions,
+  Tt as AtomMapDoActions,
+  Et as AtomNumberDoActions,
+  Ft as AtomObjectDoActions,
+  Nt as AtomSetDoActions,
+  Gt as atom,
+  Ot as configureAtomaric,
+  T as configuredOptions,
+  qt as useAtom,
+  Wt as useAtomDo,
+  Bt as useAtomGet,
+  lt as useAtomSet,
+  jt as useAtomSetDeferred,
+  ft as useAtomValue
 };