@platforma-sdk/ui-vue 1.29.31 → 1.29.32

package/CHANGELOG.md

@@ -1,5 +1,11 @@
 # @platforma-sdk/ui-vue
 
+## 1.29.32
+
+### Patch Changes
+
+- 21f48b7: Clean mnz component (remove an obsolete validation)
+
 ## 1.29.31
 
 ### Patch Changes

package/dist/lib.js

@@ -4,7 +4,7 @@ var lv = (t) => {
 };
 var KS = (t, e, n) => e in t ? GS(t, e, { enumerable: !0, configurable: !0, writable: !0, value: n }) : t[e] = n;
 var ut = (t, e, n) => KS(t, typeof e != "symbol" ? e + "" : e, n), yd = (t, e, n) => e.has(t) || lv("Cannot " + n);
-var N = (t, e, n) => (yd(t, e, "read from private field"), n ? n.call(t) : e.get(t)), nt = (t, e, n) => e.has(t) ? lv("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(t) : e.set(t, n), $e = (t, e, n, r) => (yd(t, e, "write to private field"), r ? r.call(t, n) : e.set(t, n), n), Se = (t, e, n) => (yd(t, e, "access private method"), n);
+var N = (t, e, n) => (yd(t, e, "read from private field"), n ? n.call(t) : e.get(t)), nt = (t, e, n) => e.has(t) ? lv("Cannot add the same private member more than once") : e instanceof WeakSet ? e.add(t) : e.set(t, n), $e = (t, e, n, r) => (yd(t, e, "write to private field"), r ? r.call(t, n) : e.set(t, n), n), Ce = (t, e, n) => (yd(t, e, "access private method"), n);
 var Al = (t, e, n, r) => ({
   set _(i) {
     $e(t, e, i, n);
@@ -2856,7 +2856,7 @@ const DE = (t, e = {
   bigint: (t) => bi.create({ ...t, coerce: !0 }),
   date: (t) => Xi.create({ ...t, coerce: !0 })
 }, y2 = Ve;
-var Ce = /* @__PURE__ */ Object.freeze({
+var Se = /* @__PURE__ */ Object.freeze({
   __proto__: null,
   defaultErrorMap: Bs,
   setErrorMap: yE,
@@ -3025,15 +3025,15 @@ function or(t) {
   const { type: e, name: n, domain: r } = t;
   return { type: e, name: n, ...r && { domain: r } };
 }
-Ce.object({
-  __isRef: Ce.literal(!0).describe("Crucial marker for the block dependency tree reconstruction"),
-  blockId: Ce.string().describe("Upstream block id"),
-  name: Ce.string().describe("Name of the output provided to the upstream block's output context")
+Se.object({
+  __isRef: Se.literal(!0).describe("Crucial marker for the block dependency tree reconstruction"),
+  blockId: Se.string().describe("Upstream block id"),
+  name: Se.string().describe("Name of the output provided to the upstream block's output context")
 }).describe(
   "Universal reference type, allowing to set block connections. It is crucial that {@link __isRef} is present and equal to true, internal logic relies on this marker to build block dependency trees."
 ).strict().readonly();
 const E2 = 24;
-Ce.string().length(E2).regex(/[ABCDEFGHIJKLMNOPQRSTUVWXYZ234567]/).brand("PlId");
+Se.string().length(E2).regex(/[ABCDEFGHIJKLMNOPQRSTUVWXYZ234567]/).brand("PlId");
 function qd(t) {
   return Ti(t);
 }
@@ -3057,25 +3057,25 @@ var Gd = { exports: {} };
   }
 })(Gd, Gd.exports);
 var A2 = Gd.exports;
-const T2 = /* @__PURE__ */ If(A2), O2 = Ce.object({
-  type: Ce.literal("PlError"),
-  name: Ce.string(),
-  message: Ce.string(),
+const T2 = /* @__PURE__ */ If(A2), O2 = Se.object({
+  type: Se.literal("PlError"),
+  name: Se.string(),
+  message: Se.string(),
   /** The message with all details needed for SDK developers. */
-  fullMessage: Ce.string().optional(),
-  stack: Ce.string().optional()
+  fullMessage: Se.string().optional(),
+  stack: Se.string().optional()
 }), $2 = O2.extend({
-  cause: Ce.lazy(() => tu).optional(),
-  errors: Ce.lazy(() => tu.array()).optional()
-}), R2 = Ce.object({
-  type: Ce.literal("StandardError"),
-  name: Ce.string(),
-  message: Ce.string(),
-  stack: Ce.string().optional()
+  cause: Se.lazy(() => tu).optional(),
+  errors: Se.lazy(() => tu.array()).optional()
+}), R2 = Se.object({
+  type: Se.literal("StandardError"),
+  name: Se.string(),
+  message: Se.string(),
+  stack: Se.string().optional()
 }), I2 = R2.extend({
-  cause: Ce.lazy(() => tu).optional(),
-  errors: Ce.lazy(() => tu.array()).optional()
-}), tu = Ce.union([I2, $2]);
+  cause: Se.lazy(() => tu).optional(),
+  errors: Se.lazy(() => tu.array()).optional()
+}), tu = Se.union([I2, $2]);
 function Da(t) {
   const e = Kd.safeParse(t);
   if (e.success) {
@@ -3107,14 +3107,14 @@ function Da(t) {
     message: T2(t)
   };
 }
-const P2 = Ce.object({
-  name: Ce.string(),
-  message: Ce.string(),
-  fullMessage: Ce.string().optional(),
-  stack: Ce.string().optional()
+const P2 = Se.object({
+  name: Se.string(),
+  message: Se.string(),
+  fullMessage: Se.string().optional(),
+  stack: Se.string().optional()
 }), Kd = P2.extend({
-  cause: Ce.lazy(() => Kd).optional(),
-  errors: Ce.lazy(() => Kd.array()).optional()
+  cause: Se.lazy(() => Kd).optional(),
+  errors: Se.lazy(() => Kd.array()).optional()
 });
 function N2(t) {
   if (t && typeof globalThis.getPlatforma == "function")
@@ -3122,13 +3122,13 @@ function N2(t) {
   if (typeof globalThis.platforma < "u") return globalThis.platforma;
   throw new Error("Can't get platforma instance.");
 }
-const L2 = Ce.object({
-  type: Ce.string(),
-  importance: Ce.number().optional(),
-  id: Ce.string().optional(),
-  label: Ce.string()
+const L2 = Se.object({
+  type: Se.string(),
+  importance: Se.number().optional(),
+  id: Se.string().optional(),
+  label: Se.string()
 });
-Ce.array(L2);
+Se.array(L2);
 const M2 = "1.29.22";
 function D2(t) {
   const e = t.type;
@@ -17690,46 +17690,43 @@ function _6(t) {
   };
   return bt(r), Af(r), e;
 }
-const b6 = Ce.literal("trial"), w6 = Ce.literal("free"), x6 = Ce.literal("single_payment"), k6 = Ce.literal("subscription"), C6 = Ce.union([
+const b6 = Se.literal("trial"), w6 = Se.literal("free"), x6 = Se.literal("single_payment"), k6 = Se.literal("subscription"), C6 = Se.union([
   b6,
   w6,
   x6,
   k6,
-  Ce.literal("base")
+  Se.literal("base")
   // outdated
-]), S6 = Ce.object({
-  type: Ce.union([
-    Ce.literal("unique_launches"),
-    Ce.literal("volume_limit")
+]), S6 = Se.object({
+  type: Se.union([
+    Se.literal("unique_launches"),
+    Se.literal("volume_limit")
   ]),
-  used: Ce.number(),
-  toSpend: Ce.number(),
-  available: Ce.number().nullable()
+  used: Se.number(),
+  toSpend: Se.number(),
+  available: Se.number().nullable()
   // null if unlimited
-}), E6 = Ce.object({
-  productKey: Ce.string(),
-  productName: Ce.string().default("Unknown product"),
-  customerEmail: Ce.string().optional(),
-  canRun: Ce.boolean(),
-  status: Ce.union([
-    Ce.literal("select-tariff"),
-    Ce.literal("active"),
-    Ce.literal("payment_required"),
-    Ce.literal("limits_exceeded")
+}), E6 = Se.object({
+  productKey: Se.string(),
+  productName: Se.string().default("Unknown product"),
+  customerEmail: Se.string().optional(),
+  canRun: Se.boolean(),
+  status: Se.union([
+    Se.literal("select-tariff"),
+    Se.literal("active"),
+    Se.literal("payment_required"),
+    Se.literal("limits_exceeded")
   ]),
-  mnz: Ce.object({
+  mnz: Se.object({
     type: C6.optional(),
-    details: Ce.object({
-      subscription: Ce.unknown()
-    }),
-    endOfBillingPeriod: Ce.string().nullable().optional(),
-    limits: Ce.array(S6).optional()
+    endOfBillingPeriod: Se.string().nullable().optional(),
+    limits: Se.array(S6).optional()
   })
-}, { message: "Invalid DryRunResult" }), A6 = Ce.object({
-  httpError: Ce.string().optional(),
-  response: Ce.object({
+}, { message: "Invalid DryRunResult" }), A6 = Se.object({
+  httpError: Se.string().optional(),
+  response: Se.object({
     result: E6.optional(),
-    error: Ce.unknown().optional()
+    error: Se.unknown().optional()
   }).optional()
 }).optional();
 function T6() {
@@ -25552,12 +25549,12 @@ const $p = class $p {
         throw new TypeError("maxSize must be a positive integer if specified");
       if (!di(this.maxEntrySize))
         throw new TypeError("maxEntrySize must be a positive integer if specified");
-      Se(this, ve, l_).call(this);
+      Ce(this, ve, l_).call(this);
     }
     if (this.allowStale = !!c, this.noDeleteOnStaleGet = !!X, this.updateAgeOnGet = !!l, this.updateAgeOnHas = !!u, this.ttlResolution = di(i) || i === 0 ? i : 1, this.ttlAutopurge = !!a, this.ttl = r || 0, this.ttl) {
       if (!di(this.ttl))
         throw new TypeError("ttl must be a positive integer if specified");
-      Se(this, ve, _f).call(this);
+      Ce(this, ve, _f).call(this);
     }
     if (N(this, Xn) === 0 && this.ttl === 0 && N(this, An) === 0)
       throw new TypeError("At least one of max, maxSize, or ttl is required");
@@ -25596,23 +25593,23 @@ const $p = class $p {
       // methods
       isBackgroundFetch: (n) => {
         var r;
-        return Se(r = e, ve, yt).call(r, n);
+        return Ce(r = e, ve, yt).call(r, n);
       },
       backgroundFetch: (n, r, i, a) => {
         var l;
-        return Se(l = e, ve, Wl).call(l, n, r, i, a);
+        return Ce(l = e, ve, Wl).call(l, n, r, i, a);
       },
       moveToTail: (n) => {
         var r;
-        return Se(r = e, ve, Za).call(r, n);
+        return Ce(r = e, ve, Za).call(r, n);
       },
       indexes: (n) => {
         var r;
-        return Se(r = e, ve, fi).call(r, n);
+        return Ce(r = e, ve, fi).call(r, n);
       },
       rindexes: (n) => {
         var r;
-        return Se(r = e, ve, pi).call(r, n);
+        return Ce(r = e, ve, pi).call(r, n);
       },
       isStale: (n) => {
         var r;
@@ -25684,8 +25681,8 @@ const $p = class $p {
    * in order from most recently used to least recently used.
    */
   *entries() {
-    for (const e of Se(this, ve, fi).call(this))
-      N(this, Ze)[e] !== void 0 && N(this, _t)[e] !== void 0 && !Se(this, ve, yt).call(this, N(this, Ze)[e]) && (yield [N(this, _t)[e], N(this, Ze)[e]]);
+    for (const e of Ce(this, ve, fi).call(this))
+      N(this, Ze)[e] !== void 0 && N(this, _t)[e] !== void 0 && !Ce(this, ve, yt).call(this, N(this, Ze)[e]) && (yield [N(this, _t)[e], N(this, Ze)[e]]);
   }
   /**
    * Inverse order version of {@link LRUCache.entries}
@@ -25694,17 +25691,17 @@ const $p = class $p {
    * in order from least recently used to most recently used.
    */
   *rentries() {
-    for (const e of Se(this, ve, pi).call(this))
-      N(this, Ze)[e] !== void 0 && N(this, _t)[e] !== void 0 && !Se(this, ve, yt).call(this, N(this, Ze)[e]) && (yield [N(this, _t)[e], N(this, Ze)[e]]);
+    for (const e of Ce(this, ve, pi).call(this))
+      N(this, Ze)[e] !== void 0 && N(this, _t)[e] !== void 0 && !Ce(this, ve, yt).call(this, N(this, Ze)[e]) && (yield [N(this, _t)[e], N(this, Ze)[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 Se(this, ve, fi).call(this)) {
+    for (const e of Ce(this, ve, fi).call(this)) {
       const n = N(this, _t)[e];
-      n !== void 0 && !Se(this, ve, yt).call(this, N(this, Ze)[e]) && (yield n);
+      n !== void 0 && !Ce(this, ve, yt).call(this, N(this, Ze)[e]) && (yield n);
     }
   }
   /**
@@ -25714,9 +25711,9 @@ const $p = class $p {
    * in order from least recently used to most recently used.
    */
   *rkeys() {
-    for (const e of Se(this, ve, pi).call(this)) {
+    for (const e of Ce(this, ve, pi).call(this)) {
       const n = N(this, _t)[e];
-      n !== void 0 && !Se(this, ve, yt).call(this, N(this, Ze)[e]) && (yield n);
+      n !== void 0 && !Ce(this, ve, yt).call(this, N(this, Ze)[e]) && (yield n);
     }
   }
   /**
@@ -25724,8 +25721,8 @@ const $p = class $p {
    * in order from most recently used to least recently used.
    */
   *values() {
-    for (const e of Se(this, ve, fi).call(this))
-      N(this, Ze)[e] !== void 0 && !Se(this, ve, yt).call(this, N(this, Ze)[e]) && (yield N(this, Ze)[e]);
+    for (const e of Ce(this, ve, fi).call(this))
+      N(this, Ze)[e] !== void 0 && !Ce(this, ve, yt).call(this, N(this, Ze)[e]) && (yield N(this, Ze)[e]);
   }
   /**
    * Inverse order version of {@link LRUCache.values}
@@ -25734,8 +25731,8 @@ const $p = class $p {
    * in order from least recently used to most recently used.
    */
   *rvalues() {
-    for (const e of Se(this, ve, pi).call(this))
-      N(this, Ze)[e] !== void 0 && !Se(this, ve, yt).call(this, N(this, Ze)[e]) && (yield N(this, Ze)[e]);
+    for (const e of Ce(this, ve, pi).call(this))
+      N(this, Ze)[e] !== void 0 && !Ce(this, ve, yt).call(this, N(this, Ze)[e]) && (yield N(this, Ze)[e]);
   }
   /**
    * Iterating over the cache itself yields the same results as
@@ -25749,8 +25746,8 @@ const $p = class $p {
    * similar to `Array.find()`. fn is called as `fn(value, key, cache)`.
    */
   find(e, n = {}) {
-    for (const r of Se(this, ve, fi).call(this)) {
-      const i = N(this, Ze)[r], a = Se(this, ve, yt).call(this, i) ? i.__staleWhileFetching : i;
+    for (const r of Ce(this, ve, fi).call(this)) {
+      const i = N(this, Ze)[r], a = Ce(this, ve, yt).call(this, i) ? i.__staleWhileFetching : i;
       if (a !== void 0 && e(a, N(this, _t)[r], this))
         return this.get(N(this, _t)[r], n);
     }
@@ -25767,8 +25764,8 @@ const $p = class $p {
    * Does not update age or recenty of use, or iterate over stale values.
    */
   forEach(e, n = this) {
-    for (const r of Se(this, ve, fi).call(this)) {
-      const i = N(this, Ze)[r], a = Se(this, ve, yt).call(this, i) ? i.__staleWhileFetching : i;
+    for (const r of Ce(this, ve, fi).call(this)) {
+      const i = N(this, Ze)[r], a = Ce(this, ve, yt).call(this, i) ? i.__staleWhileFetching : i;
       a !== void 0 && e.call(n, a, N(this, _t)[r], this);
     }
   }
@@ -25777,8 +25774,8 @@ const $p = class $p {
    * reverse order.  (ie, less recently used items are iterated over first.)
    */
   rforEach(e, n = this) {
-    for (const r of Se(this, ve, pi).call(this)) {
-      const i = N(this, Ze)[r], a = Se(this, ve, yt).call(this, i) ? i.__staleWhileFetching : i;
+    for (const r of Ce(this, ve, pi).call(this)) {
+      const i = N(this, Ze)[r], a = Ce(this, ve, yt).call(this, i) ? i.__staleWhileFetching : i;
       a !== void 0 && e.call(n, a, N(this, _t)[r], this);
     }
   }
@@ -25788,8 +25785,8 @@ const $p = class $p {
    */
   purgeStale() {
     let e = !1;
-    for (const n of Se(this, ve, pi).call(this, { allowStale: !0 }))
-      N(this, $n).call(this, n) && (Se(this, ve, hi).call(this, N(this, _t)[n], "expire"), e = !0);
+    for (const n of Ce(this, ve, pi).call(this, { allowStale: !0 }))
+      N(this, $n).call(this, n) && (Ce(this, ve, hi).call(this, N(this, _t)[n], "expire"), e = !0);
     return e;
   }
   /**
@@ -25808,7 +25805,7 @@ const $p = class $p {
     const n = N(this, Nt).get(e);
     if (n === void 0)
       return;
-    const r = N(this, Ze)[n], i = Se(this, ve, yt).call(this, r) ? r.__staleWhileFetching : r;
+    const r = N(this, Ze)[n], i = Ce(this, ve, yt).call(this, r) ? r.__staleWhileFetching : r;
     if (i === void 0)
       return;
     const a = { value: i };
@@ -25836,8 +25833,8 @@ const $p = class $p {
    */
   dump() {
     const e = [];
-    for (const n of Se(this, ve, fi).call(this, { allowStale: !0 })) {
-      const r = N(this, _t)[n], i = N(this, Ze)[n], a = Se(this, ve, yt).call(this, i) ? i.__staleWhileFetching : i;
+    for (const n of Ce(this, ve, fi).call(this, { allowStale: !0 })) {
+      const r = N(this, _t)[n], i = N(this, Ze)[n], a = Ce(this, ve, yt).call(this, i) ? i.__staleWhileFetching : i;
       if (a === void 0 || r === void 0)
         continue;
       const l = { value: a };
@@ -25907,28 +25904,28 @@ const $p = class $p {
     let { noUpdateTTL: f = this.noUpdateTTL } = r;
     const p = N(this, To).call(this, e, n, r.size || 0, u);
     if (this.maxEntrySize && p > this.maxEntrySize)
-      return c && (c.set = "miss", c.maxEntrySizeExceeded = !0), Se(this, ve, hi).call(this, e, "set"), this;
+      return c && (c.set = "miss", c.maxEntrySizeExceeded = !0), Ce(this, ve, hi).call(this, e, "set"), this;
     let m = N(this, Vt) === 0 ? void 0 : N(this, Nt).get(e);
     if (m === void 0)
-      m = N(this, Vt) === 0 ? N(this, jt) : N(this, er).length !== 0 ? N(this, er).pop() : N(this, Vt) === N(this, Xn) ? Se(this, ve, Zl).call(this, !1) : N(this, Vt), N(this, _t)[m] = e, N(this, Ze)[m] = n, N(this, Nt).set(e, m), N(this, on)[N(this, jt)] = m, N(this, Tn)[m] = N(this, jt), $e(this, jt, m), Al(this, Vt)._++, N(this, Ms).call(this, m, p, c), c && (c.set = "add"), f = !1, N(this, Ls) && ((g = N(this, Ui)) == null || g.call(this, n, e, "add"));
+      m = N(this, Vt) === 0 ? N(this, jt) : N(this, er).length !== 0 ? N(this, er).pop() : N(this, Vt) === N(this, Xn) ? Ce(this, ve, Zl).call(this, !1) : N(this, Vt), N(this, _t)[m] = e, N(this, Ze)[m] = n, N(this, Nt).set(e, m), N(this, on)[N(this, jt)] = m, N(this, Tn)[m] = N(this, jt), $e(this, jt, m), Al(this, Vt)._++, N(this, Ms).call(this, m, p, c), c && (c.set = "add"), f = !1, N(this, Ls) && ((g = N(this, Ui)) == null || g.call(this, n, e, "add"));
     else {
-      Se(this, ve, Za).call(this, m);
+      Ce(this, ve, Za).call(this, m);
       const M = N(this, Ze)[m];
       if (n !== M) {
-        if (N(this, gi) && Se(this, ve, yt).call(this, M)) {
+        if (N(this, gi) && Ce(this, ve, yt).call(this, M)) {
           M.__abortController.abort(new Error("replaced"));
           const { __staleWhileFetching: X } = M;
           X !== void 0 && !l && (N(this, rr) && ((_ = N(this, Yn)) == null || _.call(this, X, e, "set")), N(this, ln) && ((E = N(this, Zt)) == null || E.push([X, e, "set"])));
         } else l || (N(this, rr) && ((O = N(this, Yn)) == null || O.call(this, M, e, "set")), N(this, ln) && ((R = N(this, Zt)) == null || R.push([M, e, "set"])));
         if (N(this, Zi).call(this, m), N(this, Ms).call(this, m, p, c), N(this, Ze)[m] = n, c) {
           c.set = "replace";
-          const X = M && Se(this, ve, yt).call(this, M) ? M.__staleWhileFetching : M;
+          const X = M && Ce(this, ve, yt).call(this, M) ? M.__staleWhileFetching : M;
           X !== void 0 && (c.oldValue = X);
         }
       } else c && (c.set = "update");
       N(this, Ls) && ((j = this.onInsert) == null || j.call(this, n, e, n === M ? "update" : "replace"));
     }
-    if (i !== 0 && !N(this, On) && Se(this, ve, _f).call(this), N(this, On) && (f || N(this, Ao).call(this, m, i, a), c && N(this, Hr).call(this, c, m)), !l && N(this, ln) && N(this, Zt)) {
+    if (i !== 0 && !N(this, On) && Ce(this, ve, _f).call(this), N(this, On) && (f || N(this, Ao).call(this, m, i, a), c && N(this, Hr).call(this, c, m)), !l && N(this, ln) && N(this, Zt)) {
       const M = N(this, Zt);
       let X;
       for (; X = M == null ? void 0 : M.shift(); )
@@ -25945,7 +25942,7 @@ const $p = class $p {
     try {
       for (; N(this, Vt); ) {
         const n = N(this, Ze)[N(this, Qt)];
-        if (Se(this, ve, Zl).call(this, !0), Se(this, ve, yt).call(this, n)) {
+        if (Ce(this, ve, Zl).call(this, !0), Ce(this, ve, yt).call(this, n)) {
           if (n.__staleWhileFetching)
             return n.__staleWhileFetching;
         } else if (n !== void 0)
@@ -25980,7 +25977,7 @@ const $p = class $p {
     const { updateAgeOnHas: r = this.updateAgeOnHas, status: i } = n, a = N(this, Nt).get(e);
     if (a !== void 0) {
       const l = N(this, Ze)[a];
-      if (Se(this, ve, yt).call(this, l) && l.__staleWhileFetching === void 0)
+      if (Ce(this, ve, yt).call(this, l) && l.__staleWhileFetching === void 0)
         return !1;
       if (N(this, $n).call(this, a))
         i && (i.has = "stale", N(this, Hr).call(this, i, a));
@@ -26000,7 +25997,7 @@ const $p = class $p {
     if (i === void 0 || !r && N(this, $n).call(this, i))
       return;
     const a = N(this, Ze)[i];
-    return Se(this, ve, yt).call(this, a) ? a.__staleWhileFetching : a;
+    return Ce(this, ve, yt).call(this, a) ? a.__staleWhileFetching : a;
   }
   async fetch(e, n = {}) {
     const {
@@ -26050,18 +26047,18 @@ const $p = class $p {
     let X = N(this, Nt).get(e);
     if (X === void 0) {
       j && (j.fetch = "miss");
-      const B = Se(this, ve, Wl).call(this, e, X, M, O);
+      const B = Ce(this, ve, Wl).call(this, e, X, M, O);
       return B.__returned = B;
     } else {
       const B = N(this, Ze)[X];
-      if (Se(this, ve, yt).call(this, B)) {
+      if (Ce(this, ve, yt).call(this, B)) {
         const I = r && B.__staleWhileFetching !== void 0;
         return j && (j.fetch = "inflight", I && (j.returnedStale = !0)), I ? B.__staleWhileFetching : B.__returned = B;
       }
       const L = N(this, $n).call(this, X);
       if (!R && !L)
-        return j && (j.fetch = "hit"), Se(this, ve, Za).call(this, X), i && N(this, ji).call(this, X), j && N(this, Hr).call(this, j, X), B;
-      const V = Se(this, ve, Wl).call(this, e, X, M, O), T = V.__staleWhileFetching !== void 0 && r;
+        return j && (j.fetch = "hit"), Ce(this, ve, Za).call(this, X), i && N(this, ji).call(this, X), j && N(this, Hr).call(this, j, X), B;
+      const V = Ce(this, ve, Wl).call(this, e, X, M, O), T = V.__staleWhileFetching !== void 0 && r;
       return j && (j.fetch = L ? "stale" : "refresh", T && L && (j.returnedStale = !0)), T ? V.__staleWhileFetching : V.__returned = V;
     }
   }
@@ -26093,8 +26090,8 @@ const $p = class $p {
   get(e, n = {}) {
     const { allowStale: r = this.allowStale, updateAgeOnGet: i = this.updateAgeOnGet, noDeleteOnStaleGet: a = this.noDeleteOnStaleGet, status: l } = n, u = N(this, Nt).get(e);
     if (u !== void 0) {
-      const c = N(this, Ze)[u], f = Se(this, ve, yt).call(this, c);
-      return l && N(this, Hr).call(this, l, u), N(this, $n).call(this, u) ? (l && (l.get = "stale"), f ? (l && r && c.__staleWhileFetching !== void 0 && (l.returnedStale = !0), r ? c.__staleWhileFetching : void 0) : (a || Se(this, ve, hi).call(this, e, "expire"), l && r && (l.returnedStale = !0), r ? c : void 0)) : (l && (l.get = "hit"), f ? c.__staleWhileFetching : (Se(this, ve, Za).call(this, u), i && N(this, ji).call(this, u), c));
+      const c = N(this, Ze)[u], f = Ce(this, ve, yt).call(this, c);
+      return l && N(this, Hr).call(this, l, u), N(this, $n).call(this, u) ? (l && (l.get = "stale"), f ? (l && r && c.__staleWhileFetching !== void 0 && (l.returnedStale = !0), r ? c.__staleWhileFetching : void 0) : (a || Ce(this, ve, hi).call(this, e, "expire"), l && r && (l.returnedStale = !0), r ? c : void 0)) : (l && (l.get = "hit"), f ? c.__staleWhileFetching : (Ce(this, ve, Za).call(this, u), i && N(this, ji).call(this, u), c));
     } else l && (l.get = "miss");
   }
   /**
@@ -26103,13 +26100,13 @@ const $p = class $p {
    * Returns true if the key was deleted, false otherwise.
    */
   delete(e) {
-    return Se(this, ve, hi).call(this, e, "delete");
+    return Ce(this, ve, hi).call(this, e, "delete");
   }
   /**
    * Clear the cache entirely, throwing away all values.
    */
   clear() {
-    return Se(this, ve, xf).call(this, "delete");
+    return Ce(this, ve, xf).call(this, "delete");
   }
 };
 Xn = new WeakMap(), An = new WeakMap(), Yn = new WeakMap(), Ui = new WeakMap(), Jn = new WeakMap(), Ps = new WeakMap(), Ns = new WeakMap(), Vt = new WeakMap(), Qn = new WeakMap(), Nt = new WeakMap(), _t = new WeakMap(), Ze = new WeakMap(), on = new WeakMap(), Tn = new WeakMap(), Qt = new WeakMap(), jt = new WeakMap(), er = new WeakMap(), Zt = new WeakMap(), tr = new WeakMap(), nr = new WeakMap(), On = new WeakMap(), rr = new WeakMap(), gi = new WeakMap(), ln = new WeakMap(), Ls = new WeakMap(), ve = new WeakSet(), _f = function() {
@@ -26117,7 +26114,7 @@ Xn = new WeakMap(), An = new WeakMap(), Yn = new WeakMap(), Ui = new WeakMap(),
   $e(this, On, e), $e(this, nr, n), $e(this, Ao, (a, l, u = Cs.now()) => {
     if (n[a] = l !== 0 ? u : 0, e[a] = l, l !== 0 && this.ttlAutopurge) {
       const c = setTimeout(() => {
-        N(this, $n).call(this, a) && Se(this, ve, hi).call(this, N(this, _t)[a], "expire");
+        N(this, $n).call(this, a) && Ce(this, ve, hi).call(this, N(this, _t)[a], "expire");
       }, l + 1);
       c.unref && c.unref();
     }
@@ -26161,7 +26158,7 @@ Xn = new WeakMap(), An = new WeakMap(), Yn = new WeakMap(), Ui = new WeakMap(),
   $e(this, Qn, 0), $e(this, tr, e), $e(this, Zi, (n) => {
     $e(this, Qn, N(this, Qn) - e[n]), e[n] = 0;
   }), $e(this, To, (n, r, i, a) => {
-    if (Se(this, ve, yt).call(this, r))
+    if (Ce(this, ve, yt).call(this, r))
       return 0;
     if (!di(i))
       if (a) {
@@ -26176,27 +26173,27 @@ Xn = new WeakMap(), An = new WeakMap(), Yn = new WeakMap(), Ui = new WeakMap(),
     if (e[n] = r, N(this, An)) {
       const a = N(this, An) - e[n];
       for (; N(this, Qn) > a; )
-        Se(this, ve, Zl).call(this, !0);
+        Ce(this, ve, Zl).call(this, !0);
     }
     $e(this, Qn, N(this, Qn) + e[n]), i && (i.entrySize = r, i.totalCalculatedSize = N(this, Qn));
   });
 }, Zi = new WeakMap(), Ms = new WeakMap(), To = new WeakMap(), fi = function* ({ allowStale: e = this.allowStale } = {}) {
   if (N(this, Vt))
-    for (let n = N(this, jt); !(!Se(this, ve, bf).call(this, n) || ((e || !N(this, $n).call(this, n)) && (yield n), n === N(this, Qt))); )
+    for (let n = N(this, jt); !(!Ce(this, ve, bf).call(this, n) || ((e || !N(this, $n).call(this, n)) && (yield n), n === N(this, Qt))); )
       n = N(this, Tn)[n];
 }, pi = function* ({ allowStale: e = this.allowStale } = {}) {
   if (N(this, Vt))
-    for (let n = N(this, Qt); !(!Se(this, ve, bf).call(this, n) || ((e || !N(this, $n).call(this, n)) && (yield n), n === N(this, jt))); )
+    for (let n = N(this, Qt); !(!Ce(this, ve, bf).call(this, n) || ((e || !N(this, $n).call(this, n)) && (yield n), n === N(this, jt))); )
       n = N(this, on)[n];
 }, bf = function(e) {
   return e !== void 0 && N(this, Nt).get(N(this, _t)[e]) === e;
 }, Zl = function(e) {
   var a, l;
   const n = N(this, Qt), r = N(this, _t)[n], i = N(this, Ze)[n];
-  return N(this, gi) && Se(this, ve, yt).call(this, i) ? i.__abortController.abort(new Error("evicted")) : (N(this, rr) || N(this, ln)) && (N(this, rr) && ((a = N(this, Yn)) == null || a.call(this, i, r, "evict")), N(this, ln) && ((l = N(this, Zt)) == null || l.push([i, r, "evict"]))), N(this, Zi).call(this, n), e && (N(this, _t)[n] = void 0, N(this, Ze)[n] = void 0, N(this, er).push(n)), N(this, Vt) === 1 ? ($e(this, Qt, $e(this, jt, 0)), N(this, er).length = 0) : $e(this, Qt, N(this, on)[n]), N(this, Nt).delete(r), Al(this, Vt)._--, n;
+  return N(this, gi) && Ce(this, ve, yt).call(this, i) ? i.__abortController.abort(new Error("evicted")) : (N(this, rr) || N(this, ln)) && (N(this, rr) && ((a = N(this, Yn)) == null || a.call(this, i, r, "evict")), N(this, ln) && ((l = N(this, Zt)) == null || l.push([i, r, "evict"]))), N(this, Zi).call(this, n), e && (N(this, _t)[n] = void 0, N(this, Ze)[n] = void 0, N(this, er).push(n)), N(this, Vt) === 1 ? ($e(this, Qt, $e(this, jt, 0)), N(this, er).length = 0) : $e(this, Qt, N(this, on)[n]), N(this, Nt).delete(r), Al(this, Vt)._--, n;
 }, Wl = function(e, n, r, i) {
   const a = n === void 0 ? void 0 : N(this, Ze)[n];
-  if (Se(this, ve, yt).call(this, a))
+  if (Ce(this, ve, yt).call(this, a))
     return a;
   const l = new Tu(), { signal: u } = r;
   u == null || u.addEventListener("abort", () => l.abort(u.reason), {
@@ -26211,10 +26208,10 @@ Xn = new WeakMap(), An = new WeakMap(), Yn = new WeakMap(), Ui = new WeakMap(),
     if (r.status && (j && !R ? (r.status.fetchAborted = !0, r.status.fetchError = l.signal.reason, W && (r.status.fetchAbortIgnored = !0)) : r.status.fetchResolved = !0), j && !W && !R)
       return m(l.signal.reason);
     const M = _;
-    return N(this, Ze)[n] === _ && (O === void 0 ? M.__staleWhileFetching ? N(this, Ze)[n] = M.__staleWhileFetching : Se(this, ve, hi).call(this, e, "fetch") : (r.status && (r.status.fetchUpdated = !0), this.set(e, O, c.options))), O;
+    return N(this, Ze)[n] === _ && (O === void 0 ? M.__staleWhileFetching ? N(this, Ze)[n] = M.__staleWhileFetching : Ce(this, ve, hi).call(this, e, "fetch") : (r.status && (r.status.fetchUpdated = !0), this.set(e, O, c.options))), O;
   }, p = (O) => (r.status && (r.status.fetchRejected = !0, r.status.fetchError = O), m(O)), m = (O) => {
     const { aborted: R } = l.signal, j = R && r.allowStaleOnFetchAbort, W = j || r.allowStaleOnFetchRejection, M = W || r.noDeleteOnFetchRejection, X = _;
-    if (N(this, Ze)[n] === _ && (!M || X.__staleWhileFetching === void 0 ? Se(this, ve, hi).call(this, e, "fetch") : j || (N(this, Ze)[n] = X.__staleWhileFetching)), W)
+    if (N(this, Ze)[n] === _ && (!M || X.__staleWhileFetching === void 0 ? Ce(this, ve, hi).call(this, e, "fetch") : j || (N(this, Ze)[n] = X.__staleWhileFetching)), W)
       return r.status && X.__staleWhileFetching !== void 0 && (r.status.returnedStale = !0), X.__staleWhileFetching;
     if (X.__returned === X)
       throw O;
@@ -26240,7 +26237,7 @@ Xn = new WeakMap(), An = new WeakMap(), Yn = new WeakMap(), Ui = new WeakMap(),
 }, wf = function(e, n) {
   N(this, Tn)[n] = e, N(this, on)[e] = n;
 }, Za = function(e) {
-  e !== N(this, jt) && (e === N(this, Qt) ? $e(this, Qt, N(this, on)[e]) : Se(this, ve, wf).call(this, N(this, Tn)[e], N(this, on)[e]), Se(this, ve, wf).call(this, N(this, jt), e), $e(this, jt, e));
+  e !== N(this, jt) && (e === N(this, Qt) ? $e(this, Qt, N(this, on)[e]) : Ce(this, ve, wf).call(this, N(this, Tn)[e], N(this, on)[e]), Ce(this, ve, wf).call(this, N(this, jt), e), $e(this, jt, e));
 }, hi = function(e, n) {
   var i, a, l, u;
   let r = !1;
@@ -26248,11 +26245,11 @@ Xn = new WeakMap(), An = new WeakMap(), Yn = new WeakMap(), Ui = new WeakMap(),
     const c = N(this, Nt).get(e);
     if (c !== void 0)
       if (r = !0, N(this, Vt) === 1)
-        Se(this, ve, xf).call(this, n);
+        Ce(this, ve, xf).call(this, n);
       else {
         N(this, Zi).call(this, c);
         const f = N(this, Ze)[c];
-        if (Se(this, ve, yt).call(this, f) ? f.__abortController.abort(new Error("deleted")) : (N(this, rr) || N(this, ln)) && (N(this, rr) && ((i = N(this, Yn)) == null || i.call(this, f, e, n)), N(this, ln) && ((a = N(this, Zt)) == null || a.push([f, e, n]))), N(this, Nt).delete(e), N(this, _t)[c] = void 0, N(this, Ze)[c] = void 0, c === N(this, jt))
+        if (Ce(this, ve, yt).call(this, f) ? f.__abortController.abort(new Error("deleted")) : (N(this, rr) || N(this, ln)) && (N(this, rr) && ((i = N(this, Yn)) == null || i.call(this, f, e, n)), N(this, ln) && ((a = N(this, Zt)) == null || a.push([f, e, n]))), N(this, Nt).delete(e), N(this, _t)[c] = void 0, N(this, Ze)[c] = void 0, c === N(this, jt))
           $e(this, jt, N(this, Tn)[c]);
         else if (c === N(this, Qt))
           $e(this, Qt, N(this, on)[c]);
@@ -26274,9 +26271,9 @@ Xn = new WeakMap(), An = new WeakMap(), Yn = new WeakMap(), Ui = new WeakMap(),
   return r;
 }, xf = function(e) {
   var n, r, i;
-  for (const a of Se(this, ve, pi).call(this, { allowStale: !0 })) {
+  for (const a of Ce(this, ve, pi).call(this, { allowStale: !0 })) {
     const l = N(this, Ze)[a];
-    if (Se(this, ve, yt).call(this, l))
+    if (Ce(this, ve, yt).call(this, l))
       l.__abortController.abort(new Error("deleted"));
     else {
       const u = N(this, _t)[a];