@platforma-sdk/ui-vue 1.42.19 → 1.42.21

package/dist/node_modules/.pnpm/lru-cache@11.1.0/node_modules/lru-cache/dist/esm/index.js

@@ -1,963 +0,0 @@
-var Vt = Object.defineProperty;
-var Lt = (c) => {
-  throw TypeError(c);
-};
-var kt = (c, e, i) => e in c ? Vt(c, e, { enumerable: !0, configurable: !0, writable: !0, value: i }) : c[e] = i;
-var A = (c, e, i) => kt(c, typeof e != "symbol" ? e + "" : e, i), Tt = (c, e, i) => e.has(c) || Lt("Cannot " + i);
-var t = (c, e, i) => (Tt(c, e, "read from private field"), i ? i.call(c) : e.get(c)), g = (c, e, i) => e.has(c) ? Lt("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(c) : e.set(c, i), f = (c, e, i, s) => (Tt(c, e, "write to private field"), s ? s.call(c, i) : e.set(c, i), i), l = (c, e, i) => (Tt(c, e, "access private method"), i);
-var mt = (c, e, i, s) => ({
-  set _(h) {
-    f(c, e, h, i);
-  },
-  get _() {
-    return t(c, e, s);
-  }
-});
-const lt = typeof performance == "object" && performance && typeof performance.now == "function" ? performance : Date, jt = /* @__PURE__ */ new Set(), Et = typeof process == "object" && process ? process : {}, Nt = (c, e, i, s) => {
-  typeof Et.emitWarning == "function" ? Et.emitWarning(c, e, i, s) : console.error(`[${i}] ${e}: ${c}`);
-};
-let Ft = globalThis.AbortController, xt = globalThis.AbortSignal;
-var Ut;
-if (typeof Ft > "u") {
-  xt = class {
-    constructor() {
-      A(this, "onabort");
-      A(this, "_onabort", []);
-      A(this, "reason");
-      A(this, "aborted", !1);
-    }
-    addEventListener(s, h) {
-      this._onabort.push(h);
-    }
-  }, Ft = class {
-    constructor() {
-      A(this, "signal", new xt());
-      e();
-    }
-    abort(s) {
-      var h, n;
-      if (!this.signal.aborted) {
-        this.signal.reason = s, this.signal.aborted = !0;
-        for (const r of this.signal._onabort)
-          r(s);
-        (n = (h = this.signal).onabort) == null || n.call(h, s);
-      }
-    }
-  };
-  let c = ((Ut = Et.env) == null ? void 0 : Ut.LRU_CACHE_IGNORE_AC_WARNING) !== "1";
-  const e = () => {
-    c && (c = !1, Nt("AbortController is not defined. If using lru-cache in node 14, load an AbortController polyfill from the `node-abort-controller` package. A minimal polyfill is provided for use by LRUCache.fetch(), but it should not be relied upon in other contexts (eg, passing it to other APIs that use AbortController/AbortSignal might have undesirable effects). You may disable this with LRU_CACHE_IGNORE_AC_WARNING=1 in the env.", "NO_ABORT_CONTROLLER", "ENOTSUP", e));
-  };
-}
-const Bt = (c) => !jt.has(c), J = (c) => c && c === Math.floor(c) && c > 0 && isFinite(c), Pt = (c) => J(c) ? c <= Math.pow(2, 8) ? Uint8Array : c <= Math.pow(2, 16) ? Uint16Array : c <= Math.pow(2, 32) ? Uint32Array : c <= Number.MAX_SAFE_INTEGER ? bt : null : null;
-class bt extends Array {
-  constructor(e) {
-    super(e), this.fill(0);
-  }
-}
-var at;
-const it = class it {
-  constructor(e, i) {
-    A(this, "heap");
-    A(this, "length");
-    if (!t(it, at))
-      throw new TypeError("instantiate Stack using Stack.create(n)");
-    this.heap = new i(e), this.length = 0;
-  }
-  static create(e) {
-    const i = Pt(e);
-    if (!i)
-      return [];
-    f(it, at, !0);
-    const s = new it(e, i);
-    return f(it, at, !1), s;
-  }
-  push(e) {
-    this.heap[this.length++] = e;
-  }
-  pop() {
-    return this.heap[--this.length];
-  }
-};
-at = new WeakMap(), // private constructor
-g(it, at, !1);
-let zt = it;
-var Mt, Gt, N, L, P, st, H, ft, ct, T, V, O, y, d, R, x, C, E, k, z, B, $, I, q, et, W, ut, o, vt, nt, Y, wt, U, Ht, ht, dt, St, K, Q, Ct, yt, At, b, Rt, pt, tt, Wt;
-const Dt = class Dt {
-  constructor(e) {
-    g(this, o);
-    // options that cannot be changed without disaster
-    g(this, N);
-    g(this, L);
-    g(this, P);
-    g(this, st);
-    g(this, H);
-    g(this, ft);
-    g(this, ct);
-    /**
-     * {@link LRUCache.OptionsBase.ttl}
-     */
-    A(this, "ttl");
-    /**
-     * {@link LRUCache.OptionsBase.ttlResolution}
-     */
-    A(this, "ttlResolution");
-    /**
-     * {@link LRUCache.OptionsBase.ttlAutopurge}
-     */
-    A(this, "ttlAutopurge");
-    /**
-     * {@link LRUCache.OptionsBase.updateAgeOnGet}
-     */
-    A(this, "updateAgeOnGet");
-    /**
-     * {@link LRUCache.OptionsBase.updateAgeOnHas}
-     */
-    A(this, "updateAgeOnHas");
-    /**
-     * {@link LRUCache.OptionsBase.allowStale}
-     */
-    A(this, "allowStale");
-    /**
-     * {@link LRUCache.OptionsBase.noDisposeOnSet}
-     */
-    A(this, "noDisposeOnSet");
-    /**
-     * {@link LRUCache.OptionsBase.noUpdateTTL}
-     */
-    A(this, "noUpdateTTL");
-    /**
-     * {@link LRUCache.OptionsBase.maxEntrySize}
-     */
-    A(this, "maxEntrySize");
-    /**
-     * {@link LRUCache.OptionsBase.sizeCalculation}
-     */
-    A(this, "sizeCalculation");
-    /**
-     * {@link LRUCache.OptionsBase.noDeleteOnFetchRejection}
-     */
-    A(this, "noDeleteOnFetchRejection");
-    /**
-     * {@link LRUCache.OptionsBase.noDeleteOnStaleGet}
-     */
-    A(this, "noDeleteOnStaleGet");
-    /**
-     * {@link LRUCache.OptionsBase.allowStaleOnFetchAbort}
-     */
-    A(this, "allowStaleOnFetchAbort");
-    /**
-     * {@link LRUCache.OptionsBase.allowStaleOnFetchRejection}
-     */
-    A(this, "allowStaleOnFetchRejection");
-    /**
-     * {@link LRUCache.OptionsBase.ignoreFetchAbort}
-     */
-    A(this, "ignoreFetchAbort");
-    // computed properties
-    g(this, T);
-    g(this, V);
-    g(this, O);
-    g(this, y);
-    g(this, d);
-    g(this, R);
-    g(this, x);
-    g(this, C);
-    g(this, E);
-    g(this, k);
-    g(this, z);
-    g(this, B);
-    g(this, $);
-    g(this, I);
-    g(this, q);
-    g(this, et);
-    g(this, W);
-    g(this, ut);
-    // conditionally set private methods related to TTL
-    g(this, nt, () => {
-    });
-    g(this, Y, () => {
-    });
-    g(this, wt, () => {
-    });
-    /* c8 ignore stop */
-    g(this, U, () => !1);
-    g(this, ht, (e) => {
-    });
-    g(this, dt, (e, i, s) => {
-    });
-    g(this, St, (e, i, s, h) => {
-      if (s || h)
-        throw new TypeError("cannot set size without setting maxSize or maxEntrySize on cache");
-      return 0;
-    });
-    /**
-     * A String value that is used in the creation of the default string
-     * description of an object. Called by the built-in method
-     * `Object.prototype.toString`.
-     */
-    A(this, Mt, "LRUCache");
-    const { max: i = 0, ttl: s, ttlResolution: h = 1, ttlAutopurge: n, updateAgeOnGet: r, updateAgeOnHas: u, allowStale: a, dispose: m, onInsert: M, disposeAfter: _, noDisposeOnSet: Z, noUpdateTTL: G, maxSize: X = 0, maxEntrySize: F = 0, sizeCalculation: D, fetchMethod: p, memoMethod: v, noDeleteOnFetchRejection: w, noDeleteOnStaleGet: S, allowStaleOnFetchRejection: j, allowStaleOnFetchAbort: gt, ignoreFetchAbort: rt } = e;
-    if (i !== 0 && !J(i))
-      throw new TypeError("max option must be a nonnegative integer");
-    const _t = i ? Pt(i) : Array;
-    if (!_t)
-      throw new Error("invalid max value: " + i);
-    if (f(this, N, i), f(this, L, X), this.maxEntrySize = F || t(this, L), this.sizeCalculation = D, this.sizeCalculation) {
-      if (!t(this, L) && !this.maxEntrySize)
-        throw new TypeError("cannot set sizeCalculation without setting maxSize or maxEntrySize");
-      if (typeof this.sizeCalculation != "function")
-        throw new TypeError("sizeCalculation set to non-function");
-    }
-    if (v !== void 0 && typeof v != "function")
-      throw new TypeError("memoMethod must be a function if defined");
-    if (f(this, ct, v), p !== void 0 && typeof p != "function")
-      throw new TypeError("fetchMethod must be a function if specified");
-    if (f(this, ft, p), f(this, et, !!p), f(this, O, /* @__PURE__ */ new Map()), f(this, y, new Array(i).fill(void 0)), f(this, d, new Array(i).fill(void 0)), f(this, R, new _t(i)), f(this, x, new _t(i)), f(this, C, 0), f(this, E, 0), f(this, k, zt.create(i)), f(this, T, 0), f(this, V, 0), typeof m == "function" && f(this, P, m), typeof M == "function" && f(this, st, M), typeof _ == "function" ? (f(this, H, _), f(this, z, [])) : (f(this, H, void 0), f(this, z, void 0)), f(this, q, !!t(this, P)), f(this, ut, !!t(this, st)), f(this, W, !!t(this, H)), this.noDisposeOnSet = !!Z, this.noUpdateTTL = !!G, this.noDeleteOnFetchRejection = !!w, this.allowStaleOnFetchRejection = !!j, this.allowStaleOnFetchAbort = !!gt, this.ignoreFetchAbort = !!rt, this.maxEntrySize !== 0) {
-      if (t(this, L) !== 0 && !J(t(this, L)))
-        throw new TypeError("maxSize must be a positive integer if specified");
-      if (!J(this.maxEntrySize))
-        throw new TypeError("maxEntrySize must be a positive integer if specified");
-      l(this, o, Ht).call(this);
-    }
-    if (this.allowStale = !!a, this.noDeleteOnStaleGet = !!S, this.updateAgeOnGet = !!r, this.updateAgeOnHas = !!u, this.ttlResolution = J(h) || h === 0 ? h : 1, this.ttlAutopurge = !!n, this.ttl = s || 0, this.ttl) {
-      if (!J(this.ttl))
-        throw new TypeError("ttl must be a positive integer if specified");
-      l(this, o, vt).call(this);
-    }
-    if (t(this, N) === 0 && this.ttl === 0 && t(this, L) === 0)
-      throw new TypeError("At least one of max, maxSize, or ttl is required");
-    if (!this.ttlAutopurge && !t(this, N) && !t(this, L)) {
-      const ot = "LRU_CACHE_UNBOUNDED";
-      Bt(ot) && (jt.add(ot), Nt("TTL caching without ttlAutopurge, max, or maxSize can result in unbounded memory consumption.", "UnboundedCacheWarning", ot, Dt));
-    }
-  }
-  /**
-   * Do not call this method unless you need to inspect the
-   * inner workings of the cache.  If anything returned by this
-   * object is modified in any way, strange breakage may occur.
-   *
-   * These fields are private for a reason!
-   *
-   * @internal
-   */
-  static unsafeExposeInternals(e) {
-    return {
-      // properties
-      starts: t(e, $),
-      ttls: t(e, I),
-      sizes: t(e, B),
-      keyMap: t(e, O),
-      keyList: t(e, y),
-      valList: t(e, d),
-      next: t(e, R),
-      prev: t(e, x),
-      get head() {
-        return t(e, C);
-      },
-      get tail() {
-        return t(e, E);
-      },
-      free: t(e, k),
-      // methods
-      isBackgroundFetch: (i) => {
-        var s;
-        return l(s = e, o, b).call(s, i);
-      },
-      backgroundFetch: (i, s, h, n) => {
-        var r;
-        return l(r = e, o, At).call(r, i, s, h, n);
-      },
-      moveToTail: (i) => {
-        var s;
-        return l(s = e, o, pt).call(s, i);
-      },
-      indexes: (i) => {
-        var s;
-        return l(s = e, o, K).call(s, i);
-      },
-      rindexes: (i) => {
-        var s;
-        return l(s = e, o, Q).call(s, i);
-      },
-      isStale: (i) => {
-        var s;
-        return t(s = e, U).call(s, i);
-      }
-    };
-  }
-  // Protected read-only members
-  /**
-   * {@link LRUCache.OptionsBase.max} (read-only)
-   */
-  get max() {
-    return t(this, N);
-  }
-  /**
-   * {@link LRUCache.OptionsBase.maxSize} (read-only)
-   */
-  get maxSize() {
-    return t(this, L);
-  }
-  /**
-   * The total computed size of items in the cache (read-only)
-   */
-  get calculatedSize() {
-    return t(this, V);
-  }
-  /**
-   * The number of items stored in the cache (read-only)
-   */
-  get size() {
-    return t(this, T);
-  }
-  /**
-   * {@link LRUCache.OptionsBase.fetchMethod} (read-only)
-   */
-  get fetchMethod() {
-    return t(this, ft);
-  }
-  get memoMethod() {
-    return t(this, ct);
-  }
-  /**
-   * {@link LRUCache.OptionsBase.dispose} (read-only)
-   */
-  get dispose() {
-    return t(this, P);
-  }
-  /**
-   * {@link LRUCache.OptionsBase.onInsert} (read-only)
-   */
-  get onInsert() {
-    return t(this, st);
-  }
-  /**
-   * {@link LRUCache.OptionsBase.disposeAfter} (read-only)
-   */
-  get disposeAfter() {
-    return t(this, H);
-  }
-  /**
-   * Return the number of ms left in the item's TTL. If item is not in cache,
-   * returns `0`. Returns `Infinity` if item is in cache without a defined TTL.
-   */
-  getRemainingTTL(e) {
-    return t(this, O).has(e) ? 1 / 0 : 0;
-  }
-  /**
-   * Return a generator yielding `[key, value]` pairs,
-   * in order from most recently used to least recently used.
-   */
-  *entries() {
-    for (const e of l(this, o, K).call(this))
-      t(this, d)[e] !== void 0 && t(this, y)[e] !== void 0 && !l(this, o, b).call(this, t(this, d)[e]) && (yield [t(this, y)[e], t(this, d)[e]]);
-  }
-  /**
-   * Inverse order version of {@link LRUCache.entries}
-   *
-   * Return a generator yielding `[key, value]` pairs,
-   * in order from least recently used to most recently used.
-   */
-  *rentries() {
-    for (const e of l(this, o, Q).call(this))
-      t(this, d)[e] !== void 0 && t(this, y)[e] !== void 0 && !l(this, o, b).call(this, t(this, d)[e]) && (yield [t(this, y)[e], t(this, d)[e]]);
-  }
-  /**
-   * Return a generator yielding the keys in the cache,
-   * in order from most recently used to least recently used.
-   */
-  *keys() {
-    for (const e of l(this, o, K).call(this)) {
-      const i = t(this, y)[e];
-      i !== void 0 && !l(this, o, b).call(this, t(this, d)[e]) && (yield i);
-    }
-  }
-  /**
-   * Inverse order version of {@link LRUCache.keys}
-   *
-   * Return a generator yielding the keys in the cache,
-   * in order from least recently used to most recently used.
-   */
-  *rkeys() {
-    for (const e of l(this, o, Q).call(this)) {
-      const i = t(this, y)[e];
-      i !== void 0 && !l(this, o, b).call(this, t(this, d)[e]) && (yield i);
-    }
-  }
-  /**
-   * Return a generator yielding the values in the cache,
-   * in order from most recently used to least recently used.
-   */
-  *values() {
-    for (const e of l(this, o, K).call(this))
-      t(this, d)[e] !== void 0 && !l(this, o, b).call(this, t(this, d)[e]) && (yield t(this, d)[e]);
-  }
-  /**
-   * Inverse order version of {@link LRUCache.values}
-   *
-   * Return a generator yielding the values in the cache,
-   * in order from least recently used to most recently used.
-   */
-  *rvalues() {
-    for (const e of l(this, o, Q).call(this))
-      t(this, d)[e] !== void 0 && !l(this, o, b).call(this, t(this, d)[e]) && (yield t(this, d)[e]);
-  }
-  /**
-   * Iterating over the cache itself yields the same results as
-   * {@link LRUCache.entries}
-   */
-  [(Gt = Symbol.iterator, Mt = Symbol.toStringTag, Gt)]() {
-    return this.entries();
-  }
-  /**
-   * Find a value for which the supplied fn method returns a truthy value,
-   * similar to `Array.find()`. fn is called as `fn(value, key, cache)`.
-   */
-  find(e, i = {}) {
-    for (const s of l(this, o, K).call(this)) {
-      const h = t(this, d)[s], n = l(this, o, b).call(this, h) ? h.__staleWhileFetching : h;
-      if (n !== void 0 && e(n, t(this, y)[s], this))
-        return this.get(t(this, y)[s], i);
-    }
-  }
-  /**
-   * Call the supplied function on each item in the cache, in order from most
-   * recently used to least recently used.
-   *
-   * `fn` is called as `fn(value, key, cache)`.
-   *
-   * If `thisp` is provided, function will be called in the `this`-context of
-   * the provided object, or the cache if no `thisp` object is provided.
-   *
-   * Does not update age or recenty of use, or iterate over stale values.
-   */
-  forEach(e, i = this) {
-    for (const s of l(this, o, K).call(this)) {
-      const h = t(this, d)[s], n = l(this, o, b).call(this, h) ? h.__staleWhileFetching : h;
-      n !== void 0 && e.call(i, n, t(this, y)[s], this);
-    }
-  }
-  /**
-   * The same as {@link LRUCache.forEach} but items are iterated over in
-   * reverse order.  (ie, less recently used items are iterated over first.)
-   */
-  rforEach(e, i = this) {
-    for (const s of l(this, o, Q).call(this)) {
-      const h = t(this, d)[s], n = l(this, o, b).call(this, h) ? h.__staleWhileFetching : h;
-      n !== void 0 && e.call(i, n, t(this, y)[s], this);
-    }
-  }
-  /**
-   * Delete any stale entries. Returns true if anything was removed,
-   * false otherwise.
-   */
-  purgeStale() {
-    let e = !1;
-    for (const i of l(this, o, Q).call(this, { allowStale: !0 }))
-      t(this, U).call(this, i) && (l(this, o, tt).call(this, t(this, y)[i], "expire"), e = !0);
-    return e;
-  }
-  /**
-   * Get the extended info about a given entry, to get its value, size, and
-   * TTL info simultaneously. Returns `undefined` if the key is not present.
-   *
-   * Unlike {@link LRUCache#dump}, which is designed to be portable and survive
-   * serialization, the `start` value is always the current timestamp, and the
-   * `ttl` is a calculated remaining time to live (negative if expired).
-   *
-   * Always returns stale values, if their info is found in the cache, so be
-   * sure to check for expirations (ie, a negative {@link LRUCache.Entry#ttl})
-   * if relevant.
-   */
-  info(e) {
-    const i = t(this, O).get(e);
-    if (i === void 0)
-      return;
-    const s = t(this, d)[i], h = l(this, o, b).call(this, s) ? s.__staleWhileFetching : s;
-    if (h === void 0)
-      return;
-    const n = { value: h };
-    if (t(this, I) && t(this, $)) {
-      const r = t(this, I)[i], u = t(this, $)[i];
-      if (r && u) {
-        const a = r - (lt.now() - u);
-        n.ttl = a, n.start = Date.now();
-      }
-    }
-    return t(this, B) && (n.size = t(this, B)[i]), n;
-  }
-  /**
-   * Return an array of [key, {@link LRUCache.Entry}] tuples which can be
-   * passed to {@link LRUCache#load}.
-   *
-   * The `start` fields are calculated relative to a portable `Date.now()`
-   * timestamp, even if `performance.now()` is available.
-   *
-   * Stale entries are always included in the `dump`, even if
-   * {@link LRUCache.OptionsBase.allowStale} is false.
-   *
-   * Note: this returns an actual array, not a generator, so it can be more
-   * easily passed around.
-   */
-  dump() {
-    const e = [];
-    for (const i of l(this, o, K).call(this, { allowStale: !0 })) {
-      const s = t(this, y)[i], h = t(this, d)[i], n = l(this, o, b).call(this, h) ? h.__staleWhileFetching : h;
-      if (n === void 0 || s === void 0)
-        continue;
-      const r = { value: n };
-      if (t(this, I) && t(this, $)) {
-        r.ttl = t(this, I)[i];
-        const u = lt.now() - t(this, $)[i];
-        r.start = Math.floor(Date.now() - u);
-      }
-      t(this, B) && (r.size = t(this, B)[i]), e.unshift([s, r]);
-    }
-    return e;
-  }
-  /**
-   * Reset the cache and load in the items in entries in the order listed.
-   *
-   * The shape of the resulting cache may be different if the same options are
-   * not used in both caches.
-   *
-   * The `start` fields are assumed to be calculated relative to a portable
-   * `Date.now()` timestamp, even if `performance.now()` is available.
-   */
-  load(e) {
-    this.clear();
-    for (const [i, s] of e) {
-      if (s.start) {
-        const h = Date.now() - s.start;
-        s.start = lt.now() - h;
-      }
-      this.set(i, s.value, s);
-    }
-  }
-  /**
-   * Add a value to the cache.
-   *
-   * Note: if `undefined` is specified as a value, this is an alias for
-   * {@link LRUCache#delete}
-   *
-   * Fields on the {@link LRUCache.SetOptions} options param will override
-   * their corresponding values in the constructor options for the scope
-   * of this single `set()` operation.
-   *
-   * If `start` is provided, then that will set the effective start
-   * time for the TTL calculation. Note that this must be a previous
-   * value of `performance.now()` if supported, or a previous value of
-   * `Date.now()` if not.
-   *
-   * Options object may also include `size`, which will prevent
-   * calling the `sizeCalculation` function and just use the specified
-   * number if it is a positive integer, and `noDisposeOnSet` which
-   * will prevent calling a `dispose` function in the case of
-   * overwrites.
-   *
-   * If the `size` (or return value of `sizeCalculation`) for a given
-   * entry is greater than `maxEntrySize`, then the item will not be
-   * added to the cache.
-   *
-   * Will update the recency of the entry.
-   *
-   * If the value is `undefined`, then this is an alias for
-   * `cache.delete(key)`. `undefined` is never stored in the cache.
-   */
-  set(e, i, s = {}) {
-    var Z, G, X, F, D, p, v;
-    if (i === void 0)
-      return this.delete(e), this;
-    const { ttl: h = this.ttl, start: n, noDisposeOnSet: r = this.noDisposeOnSet, sizeCalculation: u = this.sizeCalculation, status: a } = s;
-    let { noUpdateTTL: m = this.noUpdateTTL } = s;
-    const M = t(this, St).call(this, e, i, s.size || 0, u);
-    if (this.maxEntrySize && M > this.maxEntrySize)
-      return a && (a.set = "miss", a.maxEntrySizeExceeded = !0), l(this, o, tt).call(this, e, "set"), this;
-    let _ = t(this, T) === 0 ? void 0 : t(this, O).get(e);
-    if (_ === void 0)
-      _ = t(this, T) === 0 ? t(this, E) : t(this, k).length !== 0 ? t(this, k).pop() : t(this, T) === t(this, N) ? l(this, o, yt).call(this, !1) : t(this, T), t(this, y)[_] = e, t(this, d)[_] = i, t(this, O).set(e, _), t(this, R)[t(this, E)] = _, t(this, x)[_] = t(this, E), f(this, E, _), mt(this, T)._++, t(this, dt).call(this, _, M, a), a && (a.set = "add"), m = !1, t(this, ut) && ((Z = t(this, st)) == null || Z.call(this, i, e, "add"));
-    else {
-      l(this, o, pt).call(this, _);
-      const w = t(this, d)[_];
-      if (i !== w) {
-        if (t(this, et) && l(this, o, b).call(this, w)) {
-          w.__abortController.abort(new Error("replaced"));
-          const { __staleWhileFetching: S } = w;
-          S !== void 0 && !r && (t(this, q) && ((G = t(this, P)) == null || G.call(this, S, e, "set")), t(this, W) && ((X = t(this, z)) == null || X.push([S, e, "set"])));
-        } else r || (t(this, q) && ((F = t(this, P)) == null || F.call(this, w, e, "set")), t(this, W) && ((D = t(this, z)) == null || D.push([w, e, "set"])));
-        if (t(this, ht).call(this, _), t(this, dt).call(this, _, M, a), t(this, d)[_] = i, a) {
-          a.set = "replace";
-          const S = w && l(this, o, b).call(this, w) ? w.__staleWhileFetching : w;
-          S !== void 0 && (a.oldValue = S);
-        }
-      } else a && (a.set = "update");
-      t(this, ut) && ((p = this.onInsert) == null || p.call(this, i, e, i === w ? "update" : "replace"));
-    }
-    if (h !== 0 && !t(this, I) && l(this, o, vt).call(this), t(this, I) && (m || t(this, wt).call(this, _, h, n), a && t(this, Y).call(this, a, _)), !r && t(this, W) && t(this, z)) {
-      const w = t(this, z);
-      let S;
-      for (; S = w == null ? void 0 : w.shift(); )
-        (v = t(this, H)) == null || v.call(this, ...S);
-    }
-    return this;
-  }
-  /**
-   * Evict the least recently used item, returning its value or
-   * `undefined` if cache is empty.
-   */
-  pop() {
-    var e;
-    try {
-      for (; t(this, T); ) {
-        const i = t(this, d)[t(this, C)];
-        if (l(this, o, yt).call(this, !0), l(this, o, b).call(this, i)) {
-          if (i.__staleWhileFetching)
-            return i.__staleWhileFetching;
-        } else if (i !== void 0)
-          return i;
-      }
-    } finally {
-      if (t(this, W) && t(this, z)) {
-        const i = t(this, z);
-        let s;
-        for (; s = i == null ? void 0 : i.shift(); )
-          (e = t(this, H)) == null || e.call(this, ...s);
-      }
-    }
-  }
-  /**
-   * Check if a key is in the cache, without updating the recency of use.
-   * Will return false if the item is stale, even though it is technically
-   * in the cache.
-   *
-   * Check if a key is in the cache, without updating the recency of
-   * use. Age is updated if {@link LRUCache.OptionsBase.updateAgeOnHas} is set
-   * to `true` in either the options or the constructor.
-   *
-   * Will return `false` if the item is stale, even though it is technically in
-   * the cache. The difference can be determined (if it matters) by using a
-   * `status` argument, and inspecting the `has` field.
-   *
-   * Will not update item age unless
-   * {@link LRUCache.OptionsBase.updateAgeOnHas} is set.
-   */
-  has(e, i = {}) {
-    const { updateAgeOnHas: s = this.updateAgeOnHas, status: h } = i, n = t(this, O).get(e);
-    if (n !== void 0) {
-      const r = t(this, d)[n];
-      if (l(this, o, b).call(this, r) && r.__staleWhileFetching === void 0)
-        return !1;
-      if (t(this, U).call(this, n))
-        h && (h.has = "stale", t(this, Y).call(this, h, n));
-      else return s && t(this, nt).call(this, n), h && (h.has = "hit", t(this, Y).call(this, h, n)), !0;
-    } else h && (h.has = "miss");
-    return !1;
-  }
-  /**
-   * Like {@link LRUCache#get} but doesn't update recency or delete stale
-   * items.
-   *
-   * Returns `undefined` if the item is stale, unless
-   * {@link LRUCache.OptionsBase.allowStale} is set.
-   */
-  peek(e, i = {}) {
-    const { allowStale: s = this.allowStale } = i, h = t(this, O).get(e);
-    if (h === void 0 || !s && t(this, U).call(this, h))
-      return;
-    const n = t(this, d)[h];
-    return l(this, o, b).call(this, n) ? n.__staleWhileFetching : n;
-  }
-  async fetch(e, i = {}) {
-    const {
-      // get options
-      allowStale: s = this.allowStale,
-      updateAgeOnGet: h = this.updateAgeOnGet,
-      noDeleteOnStaleGet: n = this.noDeleteOnStaleGet,
-      // set options
-      ttl: r = this.ttl,
-      noDisposeOnSet: u = this.noDisposeOnSet,
-      size: a = 0,
-      sizeCalculation: m = this.sizeCalculation,
-      noUpdateTTL: M = this.noUpdateTTL,
-      // fetch exclusive options
-      noDeleteOnFetchRejection: _ = this.noDeleteOnFetchRejection,
-      allowStaleOnFetchRejection: Z = this.allowStaleOnFetchRejection,
-      ignoreFetchAbort: G = this.ignoreFetchAbort,
-      allowStaleOnFetchAbort: X = this.allowStaleOnFetchAbort,
-      context: F,
-      forceRefresh: D = !1,
-      status: p,
-      signal: v
-    } = i;
-    if (!t(this, et))
-      return p && (p.fetch = "get"), this.get(e, {
-        allowStale: s,
-        updateAgeOnGet: h,
-        noDeleteOnStaleGet: n,
-        status: p
-      });
-    const w = {
-      allowStale: s,
-      updateAgeOnGet: h,
-      noDeleteOnStaleGet: n,
-      ttl: r,
-      noDisposeOnSet: u,
-      size: a,
-      sizeCalculation: m,
-      noUpdateTTL: M,
-      noDeleteOnFetchRejection: _,
-      allowStaleOnFetchRejection: Z,
-      allowStaleOnFetchAbort: X,
-      ignoreFetchAbort: G,
-      status: p,
-      signal: v
-    };
-    let S = t(this, O).get(e);
-    if (S === void 0) {
-      p && (p.fetch = "miss");
-      const j = l(this, o, At).call(this, e, S, w, F);
-      return j.__returned = j;
-    } else {
-      const j = t(this, d)[S];
-      if (l(this, o, b).call(this, j)) {
-        const Ot = s && j.__staleWhileFetching !== void 0;
-        return p && (p.fetch = "inflight", Ot && (p.returnedStale = !0)), Ot ? j.__staleWhileFetching : j.__returned = j;
-      }
-      const gt = t(this, U).call(this, S);
-      if (!D && !gt)
-        return p && (p.fetch = "hit"), l(this, o, pt).call(this, S), h && t(this, nt).call(this, S), p && t(this, Y).call(this, p, S), j;
-      const rt = l(this, o, At).call(this, e, S, w, F), ot = rt.__staleWhileFetching !== void 0 && s;
-      return p && (p.fetch = gt ? "stale" : "refresh", ot && gt && (p.returnedStale = !0)), ot ? rt.__staleWhileFetching : rt.__returned = rt;
-    }
-  }
-  async forceFetch(e, i = {}) {
-    const s = await this.fetch(e, i);
-    if (s === void 0)
-      throw new Error("fetch() returned undefined");
-    return s;
-  }
-  memo(e, i = {}) {
-    const s = t(this, ct);
-    if (!s)
-      throw new Error("no memoMethod provided to constructor");
-    const { context: h, forceRefresh: n, ...r } = i, u = this.get(e, r);
-    if (!n && u !== void 0)
-      return u;
-    const a = s(e, u, {
-      options: r,
-      context: h
-    });
-    return this.set(e, a, r), a;
-  }
-  /**
-   * Return a value from the cache. Will update the recency of the cache
-   * entry found.
-   *
-   * If the key is not found, get() will return `undefined`.
-   */
-  get(e, i = {}) {
-    const { allowStale: s = this.allowStale, updateAgeOnGet: h = this.updateAgeOnGet, noDeleteOnStaleGet: n = this.noDeleteOnStaleGet, status: r } = i, u = t(this, O).get(e);
-    if (u !== void 0) {
-      const a = t(this, d)[u], m = l(this, o, b).call(this, a);
-      return r && t(this, Y).call(this, r, u), t(this, U).call(this, u) ? (r && (r.get = "stale"), m ? (r && s && a.__staleWhileFetching !== void 0 && (r.returnedStale = !0), s ? a.__staleWhileFetching : void 0) : (n || l(this, o, tt).call(this, e, "expire"), r && s && (r.returnedStale = !0), s ? a : void 0)) : (r && (r.get = "hit"), m ? a.__staleWhileFetching : (l(this, o, pt).call(this, u), h && t(this, nt).call(this, u), a));
-    } else r && (r.get = "miss");
-  }
-  /**
-   * Deletes a key out of the cache.
-   *
-   * Returns true if the key was deleted, false otherwise.
-   */
-  delete(e) {
-    return l(this, o, tt).call(this, e, "delete");
-  }
-  /**
-   * Clear the cache entirely, throwing away all values.
-   */
-  clear() {
-    return l(this, o, Wt).call(this, "delete");
-  }
-};
-N = new WeakMap(), L = new WeakMap(), P = new WeakMap(), st = new WeakMap(), H = new WeakMap(), ft = new WeakMap(), ct = new WeakMap(), T = new WeakMap(), V = new WeakMap(), O = new WeakMap(), y = new WeakMap(), d = new WeakMap(), R = new WeakMap(), x = new WeakMap(), C = new WeakMap(), E = new WeakMap(), k = new WeakMap(), z = new WeakMap(), B = new WeakMap(), $ = new WeakMap(), I = new WeakMap(), q = new WeakMap(), et = new WeakMap(), W = new WeakMap(), ut = new WeakMap(), o = new WeakSet(), vt = function() {
-  const e = new bt(t(this, N)), i = new bt(t(this, N));
-  f(this, I, e), f(this, $, i), f(this, wt, (n, r, u = lt.now()) => {
-    if (i[n] = r !== 0 ? u : 0, e[n] = r, r !== 0 && this.ttlAutopurge) {
-      const a = setTimeout(() => {
-        t(this, U).call(this, n) && l(this, o, tt).call(this, t(this, y)[n], "expire");
-      }, r + 1);
-      a.unref && a.unref();
-    }
-  }), f(this, nt, (n) => {
-    i[n] = e[n] !== 0 ? lt.now() : 0;
-  }), f(this, Y, (n, r) => {
-    if (e[r]) {
-      const u = e[r], a = i[r];
-      if (!u || !a)
-        return;
-      n.ttl = u, n.start = a, n.now = s || h();
-      const m = n.now - a;
-      n.remainingTTL = u - m;
-    }
-  });
-  let s = 0;
-  const h = () => {
-    const n = lt.now();
-    if (this.ttlResolution > 0) {
-      s = n;
-      const r = setTimeout(() => s = 0, this.ttlResolution);
-      r.unref && r.unref();
-    }
-    return n;
-  };
-  this.getRemainingTTL = (n) => {
-    const r = t(this, O).get(n);
-    if (r === void 0)
-      return 0;
-    const u = e[r], a = i[r];
-    if (!u || !a)
-      return 1 / 0;
-    const m = (s || h()) - a;
-    return u - m;
-  }, f(this, U, (n) => {
-    const r = i[n], u = e[n];
-    return !!u && !!r && (s || h()) - r > u;
-  });
-}, nt = new WeakMap(), Y = new WeakMap(), wt = new WeakMap(), U = new WeakMap(), Ht = function() {
-  const e = new bt(t(this, N));
-  f(this, V, 0), f(this, B, e), f(this, ht, (i) => {
-    f(this, V, t(this, V) - e[i]), e[i] = 0;
-  }), f(this, St, (i, s, h, n) => {
-    if (l(this, o, b).call(this, s))
-      return 0;
-    if (!J(h))
-      if (n) {
-        if (typeof n != "function")
-          throw new TypeError("sizeCalculation must be a function");
-        if (h = n(s, i), !J(h))
-          throw new TypeError("sizeCalculation return invalid (expect positive integer)");
-      } else
-        throw new TypeError("invalid size value (must be positive integer). When maxSize or maxEntrySize is used, sizeCalculation or size must be set.");
-    return h;
-  }), f(this, dt, (i, s, h) => {
-    if (e[i] = s, t(this, L)) {
-      const n = t(this, L) - e[i];
-      for (; t(this, V) > n; )
-        l(this, o, yt).call(this, !0);
-    }
-    f(this, V, t(this, V) + e[i]), h && (h.entrySize = s, h.totalCalculatedSize = t(this, V));
-  });
-}, ht = new WeakMap(), dt = new WeakMap(), St = new WeakMap(), K = function* ({ allowStale: e = this.allowStale } = {}) {
-  if (t(this, T))
-    for (let i = t(this, E); !(!l(this, o, Ct).call(this, i) || ((e || !t(this, U).call(this, i)) && (yield i), i === t(this, C))); )
-      i = t(this, x)[i];
-}, Q = function* ({ allowStale: e = this.allowStale } = {}) {
-  if (t(this, T))
-    for (let i = t(this, C); !(!l(this, o, Ct).call(this, i) || ((e || !t(this, U).call(this, i)) && (yield i), i === t(this, E))); )
-      i = t(this, R)[i];
-}, Ct = function(e) {
-  return e !== void 0 && t(this, O).get(t(this, y)[e]) === e;
-}, yt = function(e) {
-  var n, r;
-  const i = t(this, C), s = t(this, y)[i], h = t(this, d)[i];
-  return t(this, et) && l(this, o, b).call(this, h) ? h.__abortController.abort(new Error("evicted")) : (t(this, q) || t(this, W)) && (t(this, q) && ((n = t(this, P)) == null || n.call(this, h, s, "evict")), t(this, W) && ((r = t(this, z)) == null || r.push([h, s, "evict"]))), t(this, ht).call(this, i), e && (t(this, y)[i] = void 0, t(this, d)[i] = void 0, t(this, k).push(i)), t(this, T) === 1 ? (f(this, C, f(this, E, 0)), t(this, k).length = 0) : f(this, C, t(this, R)[i]), t(this, O).delete(s), mt(this, T)._--, i;
-}, At = function(e, i, s, h) {
-  const n = i === void 0 ? void 0 : t(this, d)[i];
-  if (l(this, o, b).call(this, n))
-    return n;
-  const r = new Ft(), { signal: u } = s;
-  u == null || u.addEventListener("abort", () => r.abort(u.reason), {
-    signal: r.signal
-  });
-  const a = {
-    signal: r.signal,
-    options: s,
-    context: h
-  }, m = (F, D = !1) => {
-    const { aborted: p } = r.signal, v = s.ignoreFetchAbort && F !== void 0;
-    if (s.status && (p && !D ? (s.status.fetchAborted = !0, s.status.fetchError = r.signal.reason, v && (s.status.fetchAbortIgnored = !0)) : s.status.fetchResolved = !0), p && !v && !D)
-      return _(r.signal.reason);
-    const w = G;
-    return t(this, d)[i] === G && (F === void 0 ? w.__staleWhileFetching ? t(this, d)[i] = w.__staleWhileFetching : l(this, o, tt).call(this, e, "fetch") : (s.status && (s.status.fetchUpdated = !0), this.set(e, F, a.options))), F;
-  }, M = (F) => (s.status && (s.status.fetchRejected = !0, s.status.fetchError = F), _(F)), _ = (F) => {
-    const { aborted: D } = r.signal, p = D && s.allowStaleOnFetchAbort, v = p || s.allowStaleOnFetchRejection, w = v || s.noDeleteOnFetchRejection, S = G;
-    if (t(this, d)[i] === G && (!w || S.__staleWhileFetching === void 0 ? l(this, o, tt).call(this, e, "fetch") : p || (t(this, d)[i] = S.__staleWhileFetching)), v)
-      return s.status && S.__staleWhileFetching !== void 0 && (s.status.returnedStale = !0), S.__staleWhileFetching;
-    if (S.__returned === S)
-      throw F;
-  }, Z = (F, D) => {
-    var v;
-    const p = (v = t(this, ft)) == null ? void 0 : v.call(this, e, n, a);
-    p && p instanceof Promise && p.then((w) => F(w === void 0 ? void 0 : w), D), r.signal.addEventListener("abort", () => {
-      (!s.ignoreFetchAbort || s.allowStaleOnFetchAbort) && (F(void 0), s.allowStaleOnFetchAbort && (F = (w) => m(w, !0)));
-    });
-  };
-  s.status && (s.status.fetchDispatched = !0);
-  const G = new Promise(Z).then(m, M), X = Object.assign(G, {
-    __abortController: r,
-    __staleWhileFetching: n,
-    __returned: void 0
-  });
-  return i === void 0 ? (this.set(e, X, { ...a.options, status: void 0 }), i = t(this, O).get(e)) : t(this, d)[i] = X, X;
-}, b = function(e) {
-  if (!t(this, et))
-    return !1;
-  const i = e;
-  return !!i && i instanceof Promise && i.hasOwnProperty("__staleWhileFetching") && i.__abortController instanceof Ft;
-}, Rt = function(e, i) {
-  t(this, x)[i] = e, t(this, R)[e] = i;
-}, pt = function(e) {
-  e !== t(this, E) && (e === t(this, C) ? f(this, C, t(this, R)[e]) : l(this, o, Rt).call(this, t(this, x)[e], t(this, R)[e]), l(this, o, Rt).call(this, t(this, E), e), f(this, E, e));
-}, tt = function(e, i) {
-  var h, n, r, u;
-  let s = !1;
-  if (t(this, T) !== 0) {
-    const a = t(this, O).get(e);
-    if (a !== void 0)
-      if (s = !0, t(this, T) === 1)
-        l(this, o, Wt).call(this, i);
-      else {
-        t(this, ht).call(this, a);
-        const m = t(this, d)[a];
-        if (l(this, o, b).call(this, m) ? m.__abortController.abort(new Error("deleted")) : (t(this, q) || t(this, W)) && (t(this, q) && ((h = t(this, P)) == null || h.call(this, m, e, i)), t(this, W) && ((n = t(this, z)) == null || n.push([m, e, i]))), t(this, O).delete(e), t(this, y)[a] = void 0, t(this, d)[a] = void 0, a === t(this, E))
-          f(this, E, t(this, x)[a]);
-        else if (a === t(this, C))
-          f(this, C, t(this, R)[a]);
-        else {
-          const M = t(this, x)[a];
-          t(this, R)[M] = t(this, R)[a];
-          const _ = t(this, R)[a];
-          t(this, x)[_] = t(this, x)[a];
-        }
-        mt(this, T)._--, t(this, k).push(a);
-      }
-  }
-  if (t(this, W) && ((r = t(this, z)) != null && r.length)) {
-    const a = t(this, z);
-    let m;
-    for (; m = a == null ? void 0 : a.shift(); )
-      (u = t(this, H)) == null || u.call(this, ...m);
-  }
-  return s;
-}, Wt = function(e) {
-  var i, s, h;
-  for (const n of l(this, o, Q).call(this, { allowStale: !0 })) {
-    const r = t(this, d)[n];
-    if (l(this, o, b).call(this, r))
-      r.__abortController.abort(new Error("deleted"));
-    else {
-      const u = t(this, y)[n];
-      t(this, q) && ((i = t(this, P)) == null || i.call(this, r, u, e)), t(this, W) && ((s = t(this, z)) == null || s.push([r, u, e]));
-    }
-  }
-  if (t(this, O).clear(), t(this, d).fill(void 0), t(this, y).fill(void 0), t(this, I) && t(this, $) && (t(this, I).fill(0), t(this, $).fill(0)), t(this, B) && t(this, B).fill(0), f(this, C, 0), f(this, E, 0), t(this, k).length = 0, f(this, V, 0), f(this, T, 0), t(this, W) && t(this, z)) {
-    const n = t(this, z);
-    let r;
-    for (; r = n == null ? void 0 : n.shift(); )
-      (h = t(this, H)) == null || h.call(this, ...r);
-  }
-};
-let It = Dt;
-export {
-  It as LRUCache
-};
-//# sourceMappingURL=index.js.map