atomaric 0.0.78 → 0.0.81

package/build/atomaric.js

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