npm - @uptiqai/widgets-sdk - Versions diffs - 1.233.0 → 1.235.0 - Mend

@uptiqai/widgets-sdk 1.233.0 → 1.235.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (6) hide show

package/dist/headless.js CHANGED Viewed

@@ -672,57 +672,57 @@ function lr(e, t, r) {
       indexes: !1
     },
     !1,
-    function(S, k) {
-      return !p.isUndefined(k[S]);
+    function(S, w) {
+      return !p.isUndefined(w[S]);
     }
   );
-  const i = r.metaTokens, n = r.visitor || v, o = r.dots, a = r.indexes, s = r.Blob || typeof Blob < "u" && Blob, c = r.maxDepth === void 0 ? zc : r.maxDepth, u = s && p.isSpecCompliantForm(t), l = [];
+  const i = r.metaTokens, n = r.visitor || g, o = r.dots, a = r.indexes, s = r.Blob || typeof Blob < "u" && Blob, c = r.maxDepth === void 0 ? zc : r.maxDepth, u = s && p.isSpecCompliantForm(t), l = [];
   if (!p.isFunction(n))
     throw new TypeError("visitor must be a function");
-  function d(g) {
-    if (g === null) return "";
-    if (p.isDate(g))
-      return g.toISOString();
-    if (p.isBoolean(g))
-      return g.toString();
-    if (!u && p.isBlob(g))
+  function d(v) {
+    if (v === null) return "";
+    if (p.isDate(v))
+      return v.toISOString();
+    if (p.isBoolean(v))
+      return v.toString();
+    if (!u && p.isBlob(v))
       throw new O("Blob is not supported. Use a Buffer instead.");
-    if (p.isArrayBuffer(g) || p.isTypedArray(g)) {
+    if (p.isArrayBuffer(v) || p.isTypedArray(v)) {
       if (u && typeof s == "function")
-        return new s([g]);
+        return new s([v]);
       if (typeof Buffer < "u")
-        return Buffer.from(g);
+        return Buffer.from(v);
       throw new O("Blob is not supported. Use a Buffer instead.", O.ERR_NOT_SUPPORT);
     }
-    return g;
+    return v;
   }
-  function f(g) {
-    if (g > c)
+  function f(v) {
+    if (v > c)
       throw new O(
-        "Object is too deeply nested (" + g + " levels). Max depth: " + c,
+        "Object is too deeply nested (" + v + " levels). Max depth: " + c,
         O.ERR_FORM_DATA_DEPTH_EXCEEDED
       );
   }
-  function m(g, S) {
+  function m(v, S) {
     if (c === 1 / 0)
-      return JSON.stringify(g);
-    const k = [];
-    return JSON.stringify(g, function(j, C) {
+      return JSON.stringify(v);
+    const w = [];
+    return JSON.stringify(v, function(T, C) {
       if (!p.isObject(C))
         return C;
-      for (; k.length && k[k.length - 1] !== this; )
-        k.pop();
-      return k.push(C), f(S + k.length - 1), C;
+      for (; w.length && w[w.length - 1] !== this; )
+        w.pop();
+      return w.push(C), f(S + w.length - 1), C;
     });
   }
-  function v(g, S, k) {
-    let I = g;
-    if (p.isReactNative(t) && p.isReactNativeBlob(g))
-      return t.append(fi(k, S, o), d(g)), !1;
-    if (g && !k && typeof g == "object") {
+  function g(v, S, w) {
+    let I = v;
+    if (p.isReactNative(t) && p.isReactNativeBlob(v))
+      return t.append(fi(w, S, o), d(v)), !1;
+    if (v && !w && typeof v == "object") {
       if (p.endsWith(S, "{}"))
-        S = i ? S : S.slice(0, -2), g = m(g, 1);
-      else if (p.isArray(g) && Ig(g) || (p.isFileList(g) || p.endsWith(S, "[]")) && (I = p.toArray(g)))
+        S = i ? S : S.slice(0, -2), v = m(v, 1);
+      else if (p.isArray(v) && Ig(v) || (p.isFileList(v) || p.endsWith(S, "[]")) && (I = p.toArray(v)))
         return S = Oc(S), I.forEach(function(C, ce) {
           !(p.isUndefined(C) || C === null) && t.append(
             // eslint-disable-next-line no-nested-ternary
@@ -731,19 +731,19 @@ function lr(e, t, r) {
           );
         }), !1;
     }
-    return wi(g) ? !0 : (t.append(fi(k, S, o), d(g)), !1);
+    return wi(v) ? !0 : (t.append(fi(w, S, o), d(v)), !1);
   }
   const y = Object.assign(zg, {
-    defaultVisitor: v,
+    defaultVisitor: g,
     convertValue: d,
     isVisitable: wi
   });
-  function b(g, S, k = 0) {
-    if (!p.isUndefined(g)) {
-      if (f(k), l.indexOf(g) !== -1)
+  function b(v, S, w = 0) {
+    if (!p.isUndefined(v)) {
+      if (f(w), l.indexOf(v) !== -1)
         throw new Error("Circular reference detected in " + S.join("."));
-      l.push(g), p.forEach(g, function(j, C) {
-        (!(p.isUndefined(j) || j === null) && n.call(t, j, p.isString(C) ? C.trim() : C, S, y)) === !0 && b(j, S ? S.concat(C) : [C], k + 1);
+      l.push(v), p.forEach(v, function(T, C) {
+        (!(p.isUndefined(T) || T === null) && n.call(t, T, p.isString(C) ? C.trim() : C, S, y)) === !0 && b(T, S ? S.concat(C) : [C], w + 1);
       }), l.pop();
     }
   }
@@ -1260,7 +1260,7 @@ function ut(e, t) {
   };
   return p.forEach(Object.keys({ ...e, ...t }), function(d) {
     if (d === "__proto__" || d === "constructor" || d === "prototype") return;
-    const f = p.hasOwnProp(u, d) ? u[d] : n, m = p.hasOwnProp(e, d) ? e[d] : void 0, v = p.hasOwnProp(t, d) ? t[d] : void 0, y = f(m, v, d);
+    const f = p.hasOwnProp(u, d) ? u[d] : n, m = p.hasOwnProp(e, d) ? e[d] : void 0, g = p.hasOwnProp(t, d) ? t[d] : void 0, y = f(m, g, d);
     p.isUndefined(y) && f !== c || (r[d] = y);
   }), p.hasOwnProp(t, "validateStatus") && p.isUndefined(t.validateStatus) && s("validateStatusUndefinedResolves") === !1 && (p.hasOwnProp(e, "validateStatus") ? r.validateStatus = i(void 0, e.validateStatus) : delete r.validateStatus), r;
 }
@@ -1295,8 +1295,8 @@ function Pc(e) {
         "Authorization",
         "Basic " + btoa(f + ":" + (m ? Xg(m) : ""))
       );
-    } catch (v) {
-      throw O.from(v, O.ERR_BAD_OPTION_VALUE, e);
+    } catch (g) {
+      throw O.from(g, O.ERR_BAD_OPTION_VALUE, e);
     }
   }
   if (p.isFormData(i) && (ee.hasStandardBrowserEnv || ee.hasStandardBrowserWebWorkerEnv || p.isReactNative(i) ? s.setContentType(void 0) : p.isFunction(i.getHeaders) && Yg(s, i.getHeaders(), r("formDataHeaderPolicy"))), ee.hasStandardBrowserEnv && (p.isFunction(n) && (n = n(t)), n === !0 || n == null && Bg(t.url))) {
@@ -1310,22 +1310,22 @@ const ev = typeof XMLHttpRequest < "u", tv = ev && function(e) {
     const n = Pc(e);
     let o = n.data;
     const a = ae.from(n.headers).normalize();
-    let { responseType: s, onUploadProgress: c, onDownloadProgress: u } = n, l, d, f, m, v;
+    let { responseType: s, onUploadProgress: c, onDownloadProgress: u } = n, l, d, f, m, g;
     function y() {
-      m && m(), v && v(), n.cancelToken && n.cancelToken.unsubscribe(l), n.signal && n.signal.removeEventListener("abort", l);
+      m && m(), g && g(), n.cancelToken && n.cancelToken.unsubscribe(l), n.signal && n.signal.removeEventListener("abort", l);
     }
     let b = new XMLHttpRequest();
     b.open(n.method.toUpperCase(), n.url, !0), b.timeout = n.timeout;
-    function g() {
+    function v() {
       if (!b)
         return;
-      const k = ae.from(
+      const w = ae.from(
         "getAllResponseHeaders" in b && b.getAllResponseHeaders()
-      ), j = {
+      ), T = {
         data: !s || s === "text" || s === "json" ? b.responseText : b.response,
         status: b.status,
         statusText: b.statusText,
-        headers: k,
+        headers: w,
         config: e,
         request: b
       };
@@ -1336,31 +1336,31 @@ const ev = typeof XMLHttpRequest < "u", tv = ev && function(e) {
         function(ce) {
           i(ce), y();
         },
-        j
+        T
       ), b = null;
     }
-    "onloadend" in b ? b.onloadend = g : b.onreadystatechange = function() {
-      !b || b.readyState !== 4 || b.status === 0 && !(b.responseURL && b.responseURL.startsWith("file:")) || setTimeout(g);
+    "onloadend" in b ? b.onloadend = v : b.onreadystatechange = function() {
+      !b || b.readyState !== 4 || b.status === 0 && !(b.responseURL && b.responseURL.startsWith("file:")) || setTimeout(v);
     }, b.onabort = function() {
       b && (i(new O("Request aborted", O.ECONNABORTED, e, b)), y(), b = null);
     }, b.onerror = function(I) {
-      const j = I && I.message ? I.message : "Network Error", C = new O(j, O.ERR_NETWORK, e, b);
+      const T = I && I.message ? I.message : "Network Error", C = new O(T, O.ERR_NETWORK, e, b);
       C.event = I || null, i(C), y(), b = null;
     }, b.ontimeout = function() {
       let I = n.timeout ? "timeout of " + n.timeout + "ms exceeded" : "timeout exceeded";
-      const j = n.transitional || Hi;
+      const T = n.transitional || Hi;
       n.timeoutErrorMessage && (I = n.timeoutErrorMessage), i(
         new O(
           I,
-          j.clarifyTimeoutError ? O.ETIMEDOUT : O.ECONNABORTED,
+          T.clarifyTimeoutError ? O.ETIMEDOUT : O.ECONNABORTED,
           e,
           b
         )
       ), y(), b = null;
-    }, o === void 0 && a.setContentType(null), "setRequestHeader" in b && p.forEach(Sc(a), function(I, j) {
-      b.setRequestHeader(j, I);
-    }), p.isUndefined(n.withCredentials) || (b.withCredentials = !!n.withCredentials), s && s !== "json" && (b.responseType = n.responseType), u && ([f, v] = Hn(u, !0), b.addEventListener("progress", f)), c && b.upload && ([d, m] = Hn(c), b.upload.addEventListener("progress", d), b.upload.addEventListener("loadend", m)), (n.cancelToken || n.signal) && (l = (k) => {
-      b && (i(!k || k.type ? new rn(null, e, b) : k), b.abort(), y(), b = null);
+    }, o === void 0 && a.setContentType(null), "setRequestHeader" in b && p.forEach(Sc(a), function(I, T) {
+      b.setRequestHeader(T, I);
+    }), p.isUndefined(n.withCredentials) || (b.withCredentials = !!n.withCredentials), s && s !== "json" && (b.responseType = n.responseType), u && ([f, g] = Hn(u, !0), b.addEventListener("progress", f)), c && b.upload && ([d, m] = Hn(c), b.upload.addEventListener("progress", d), b.upload.addEventListener("loadend", m)), (n.cancelToken || n.signal) && (l = (w) => {
+      b && (i(!w || w.type ? new rn(null, e, b) : w), b.abort(), y(), b = null);
     }, n.cancelToken && n.cancelToken.subscribe(l), n.signal && (n.signal.aborted ? l() : n.signal.addEventListener("abort", l)));
     const S = Lg(n.url);
     if (S && !ee.protocols.includes(S)) {
@@ -1471,8 +1471,8 @@ function sv(e) {
     const s = i.length;
     for (let m = 0; m < s; m++)
       if (i.charCodeAt(m) === 37 && m + 2 < s) {
-        const v = i.charCodeAt(m + 1), y = i.charCodeAt(m + 2);
-        Gn(v) && Gn(y) && (a -= 2, m += 2);
+        const g = i.charCodeAt(m + 1), y = i.charCodeAt(m + 2);
+        Gn(g) && Gn(y) && (a -= 2, m += 2);
       }
     let c = 0, u = s - 1;
     const l = (m) => m >= 2 && i.charCodeAt(m - 2) === 37 && // '%'
@@ -1535,55 +1535,55 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
   const { fetch: n, Request: o, Response: a } = e, s = n ? Dn(n) : typeof fetch == "function", c = Dn(o), u = Dn(a);
   if (!s)
     return !1;
-  const l = s && Dn(r), d = s && (typeof i == "function" ? /* @__PURE__ */ ((g) => (S) => g.encode(S))(new i()) : async (g) => new Uint8Array(await new o(g).arrayBuffer())), f = c && l && ks(() => {
-    let g = !1;
+  const l = s && Dn(r), d = s && (typeof i == "function" ? /* @__PURE__ */ ((v) => (S) => v.encode(S))(new i()) : async (v) => new Uint8Array(await new o(v).arrayBuffer())), f = c && l && ks(() => {
+    let v = !1;
     const S = new o(ee.origin, {
       body: new r(),
       method: "POST",
       get duplex() {
-        return g = !0, "half";
+        return v = !0, "half";
       }
-    }), k = S.headers.has("Content-Type");
-    return S.body != null && S.body.cancel(), g && !k;
-  }), m = u && l && ks(() => p.isReadableStream(new a("").body)), v = {
-    stream: m && ((g) => g.body)
+    }), w = S.headers.has("Content-Type");
+    return S.body != null && S.body.cancel(), v && !w;
+  }), m = u && l && ks(() => p.isReadableStream(new a("").body)), g = {
+    stream: m && ((v) => v.body)
   };
-  s && ["text", "arrayBuffer", "blob", "formData", "stream"].forEach((g) => {
-    !v[g] && (v[g] = (S, k) => {
-      let I = S && S[g];
+  s && ["text", "arrayBuffer", "blob", "formData", "stream"].forEach((v) => {
+    !g[v] && (g[v] = (S, w) => {
+      let I = S && S[v];
       if (I)
         return I.call(S);
       throw new O(
-        `Response type '${g}' is not supported`,
+        `Response type '${v}' is not supported`,
         O.ERR_NOT_SUPPORT,
-        k
+        w
       );
     });
   });
-  const y = async (g) => {
-    if (g == null)
+  const y = async (v) => {
+    if (v == null)
       return 0;
-    if (p.isBlob(g))
-      return g.size;
-    if (p.isSpecCompliantForm(g))
+    if (p.isBlob(v))
+      return v.size;
+    if (p.isSpecCompliantForm(v))
       return (await new o(ee.origin, {
         method: "POST",
-        body: g
+        body: v
       }).arrayBuffer()).byteLength;
-    if (p.isArrayBufferView(g) || p.isArrayBuffer(g))
-      return g.byteLength;
-    if (p.isURLSearchParams(g) && (g = g + ""), p.isString(g))
-      return (await d(g)).byteLength;
-  }, b = async (g, S) => {
-    const k = p.toFiniteNumber(g.getContentLength());
-    return k ?? y(S);
-  };
-  return async (g) => {
+    if (p.isArrayBufferView(v) || p.isArrayBuffer(v))
+      return v.byteLength;
+    if (p.isURLSearchParams(v) && (v = v + ""), p.isString(v))
+      return (await d(v)).byteLength;
+  }, b = async (v, S) => {
+    const w = p.toFiniteNumber(v.getContentLength());
+    return w ?? y(S);
+  };
+  return async (v) => {
     let {
       url: S,
-      method: k,
+      method: w,
       data: I,
-      signal: j,
+      signal: T,
       cancelToken: C,
       timeout: ce,
       onDownloadProgress: Ne,
@@ -1594,12 +1594,12 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
       fetchOptions: tt,
       maxContentLength: de,
       maxBodyLength: W
-    } = Pc(g);
-    const L = p.isNumber(de) && de > -1, ui = p.isNumber(W) && W > -1, vh = (Z) => p.hasOwnProp(g, Z) ? g[Z] : void 0;
+    } = Pc(v);
+    const L = p.isNumber(de) && de > -1, ui = p.isNumber(W) && W > -1, vh = (Z) => p.hasOwnProp(v, Z) ? v[Z] : void 0;
     let is = n || fetch;
     _e = _e ? (_e + "").toLowerCase() : "text";
     let qe = nv(
-      [j, C && C.toAbortSignal()],
+      [T, C && C.toAbortSignal()],
       ce
     ), Y = null;
     const nt = qe && qe.unsubscribe && (() => {
@@ -1609,7 +1609,7 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
     const os = () => new O(
       "Request body larger than maxBodyLength limit",
       O.ERR_BAD_REQUEST,
-      g,
+      v,
       Y
     );
     try {
@@ -1640,10 +1640,10 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
         throw new O(
           "maxContentLength size of " + de + " exceeded",
           O.ERR_BAD_RESPONSE,
-          g,
+          v,
           Y
         );
-      if (ui && k !== "get" && k !== "head") {
+      if (ui && w !== "get" && w !== "head") {
         const A = await y(I);
         if (typeof A == "number" && isFinite(A) && (ht = A, A > W))
           throw os();
@@ -1658,7 +1658,7 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
         },
         Je
       );
-      if (f && k !== "get" && k !== "head" && (Re || Nn)) {
+      if (f && w !== "get" && w !== "head" && (Re || Nn)) {
         if (ht = ht ?? await b(H, I), ht !== 0 || Nn) {
           let A = new o(S, {
             method: "POST",
@@ -1673,13 +1673,13 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
             I = as(A.body, Je, rt);
           }
         }
-      } else if (Nn && !c && l && k !== "get" && k !== "head")
+      } else if (Nn && !c && l && w !== "get" && w !== "head")
         I = as(I);
-      else if (Nn && c && !f && k !== "get" && k !== "head")
+      else if (Nn && c && !f && w !== "get" && w !== "head")
         throw new O(
           "Stream request bodies are not supported by the current fetch implementation",
           O.ERR_NOT_SUPPORT,
-          g,
+          v,
           Y
         );
       p.isString(Ce) || (Ce = Ce ? "include" : "omit");
@@ -1692,7 +1692,7 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
       const ss = {
         ...tt,
         signal: qe,
-        method: k.toUpperCase(),
+        method: w.toUpperCase(),
         headers: Sc(H.normalize()),
         body: I,
         duplex: "half",
@@ -1707,7 +1707,7 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
           throw new O(
             "maxContentLength size of " + de + " exceeded",
             O.ERR_BAD_RESPONSE,
-            g,
+            v,
             Y
           );
       }
@@ -1727,7 +1727,7 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
             throw new O(
               "maxContentLength size of " + de + " exceeded",
               O.ERR_BAD_RESPONSE,
-              g,
+              v,
               Y
             );
           Je && Je(Ct);
@@ -1740,9 +1740,9 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
         );
       }
       _e = _e || "text";
-      let Le = await v[p.findKey(v, _e) || "text"](
+      let Le = await g[p.findKey(g, _e) || "text"](
         Me,
-        g
+        v
       );
       if (L && !m && !li) {
         let A;
@@ -1750,7 +1750,7 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
           throw new O(
             "maxContentLength size of " + de + " exceeded",
             O.ERR_BAD_RESPONSE,
-            g,
+            v,
             Y
           );
       }
@@ -1760,14 +1760,14 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
           headers: ae.from(Me.headers),
           status: Me.status,
           statusText: Me.statusText,
-          config: g,
+          config: v,
           request: Y
         });
       });
     } catch (Z) {
       if (nt && nt(), qe && qe.aborted && qe.reason instanceof O) {
         const be = qe.reason;
-        throw be.config = g, Y && (be.request = Y), Z !== be && Object.defineProperty(be, "cause", {
+        throw be.config = v, Y && (be.request = Y), Z !== be && Object.defineProperty(be, "cause", {
           __proto__: null,
           value: Z,
           writable: !0,
@@ -1783,7 +1783,7 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
         const be = new O(
           "Network Error",
           O.ERR_NETWORK,
-          g,
+          v,
           Y,
           Z && Z.response
         );
@@ -1795,7 +1795,7 @@ const Qi = "1.18.1", $s = 64 * 1024, { isFunction: Dn } = p, cv = (e) => encodeU
           configurable: !0
         }), be;
       }
-      throw O.from(Z, Z && Z.code, g, Y, Z && Z.response);
+      throw O.from(Z, Z && Z.code, v, Y, Z && Z.response);
     }
   };
 }, dv = /* @__PURE__ */ new Map(), Ac = (e) => {
@@ -2026,8 +2026,8 @@ let at = class {
       !0
     ), r.method = (r.method || this.defaults.method || "get").toLowerCase();
     let a = o && p.merge(o.common, o[r.method]);
-    o && p.forEach(["delete", "get", "head", "post", "put", "patch", "query", "common"], (v) => {
-      delete o[v];
+    o && p.forEach(["delete", "get", "head", "post", "put", "patch", "query", "common"], (g) => {
+      delete o[g];
     }), r.headers = ae.concat(a, o);
     const s = [];
     let c = !0;
@@ -2044,17 +2044,17 @@ let at = class {
     });
     let l, d = 0, f;
     if (!c) {
-      const v = [Is.bind(this), void 0];
-      for (v.unshift(...s), v.push(...u), f = v.length, l = Promise.resolve(r); d < f; )
-        l = l.then(v[d++], v[d++]);
+      const g = [Is.bind(this), void 0];
+      for (g.unshift(...s), g.push(...u), f = g.length, l = Promise.resolve(r); d < f; )
+        l = l.then(g[d++], g[d++]);
       return l;
     }
     f = s.length;
     let m = r;
     for (; d < f; ) {
-      const v = s[d++], y = s[d++];
+      const g = s[d++], y = s[d++];
       try {
-        m = v(m);
+        m = g(m);
       } catch (b) {
         y.call(this, b);
         break;
@@ -2062,8 +2062,8 @@ let at = class {
     }
     try {
       l = Is.call(this, m);
-    } catch (v) {
-      return Promise.reject(v);
+    } catch (g) {
+      return Promise.reject(g);
     }
     for (d = 0, f = u.length; d < f; )
       l = l.then(u[d++], u[d++]);
@@ -4694,7 +4694,7 @@ function io(e) {
   const t = Object.values(e).filter((i) => typeof i == "number");
   return Object.entries(e).filter(([i, n]) => t.indexOf(+i) === -1).map(([i, n]) => n);
 }
-function w(e, t = "|") {
+function k(e, t = "|") {
   return e.map((r) => E(r)).join(t);
 }
 function Qn(e, t) {
@@ -5179,7 +5179,7 @@ const yu = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   isObject: wt,
   isPlainObject: lt,
   issue: kt,
-  joinValues: w,
+  joinValues: k,
   jsonStringifyReplacer: Qn,
   merge: fu,
   mergeDefs: Ae,
@@ -6328,7 +6328,7 @@ function dd(e, t, r, i, n, o) {
       continue;
     }
     const m = c.run({ value: t[f], issues: [] }, i);
-    m instanceof Promise ? e.push(m.then((v) => Xn(v, r, f, t, l, d))) : Xn(m, r, f, t, l, d);
+    m instanceof Promise ? e.push(m.then((g) => Xn(g, r, f, t, l, d))) : Xn(m, r, f, t, l, d);
   }
   return a.length && r.issues.push({
     code: "unrecognized_keys",
@@ -6377,66 +6377,66 @@ const fd = /* @__PURE__ */ h("$ZodObject", (e, t) => {
     s.value = {};
     const l = [], d = a.shape;
     for (const f of a.keys) {
-      const m = d[f], v = m._zod.optin === "optional", y = m._zod.optout === "optional", b = m._zod.run({ value: u[f], issues: [] }, c);
-      b instanceof Promise ? l.push(b.then((g) => Xn(g, s, f, u, v, y))) : Xn(b, s, f, u, v, y);
+      const m = d[f], g = m._zod.optin === "optional", y = m._zod.optout === "optional", b = m._zod.run({ value: u[f], issues: [] }, c);
+      b instanceof Promise ? l.push(b.then((v) => Xn(v, s, f, u, g, y))) : Xn(b, s, f, u, g, y);
     }
     return o ? dd(l, u, s, c, i.value, e) : l.length ? Promise.all(l).then(() => s) : s;
   };
 }), md = /* @__PURE__ */ h("$ZodObjectJIT", (e, t) => {
   fd.init(e, t);
   const r = e._zod.parse, i = on(() => ld(t)), n = (f) => {
-    const m = new Sl(["shape", "payload", "ctx"]), v = i.value, y = (k) => {
-      const I = Ni(k);
+    const m = new Sl(["shape", "payload", "ctx"]), g = i.value, y = (w) => {
+      const I = Ni(w);
       return `shape[${I}]._zod.run({ value: input[${I}], issues: [] }, ctx)`;
     };
     m.write("const input = payload.value;");
     const b = /* @__PURE__ */ Object.create(null);
-    let g = 0;
-    for (const k of v.keys)
-      b[k] = `key_${g++}`;
+    let v = 0;
+    for (const w of g.keys)
+      b[w] = `key_${v++}`;
     m.write("const newResult = {};");
-    for (const k of v.keys) {
-      const I = b[k], j = Ni(k), C = f[k], ce = C?._zod?.optin === "optional", Ne = C?._zod?.optout === "optional";
-      m.write(`const ${I} = ${y(k)};`), ce && Ne ? m.write(`
+    for (const w of g.keys) {
+      const I = b[w], T = Ni(w), C = f[w], ce = C?._zod?.optin === "optional", Ne = C?._zod?.optout === "optional";
+      m.write(`const ${I} = ${y(w)};`), ce && Ne ? m.write(`
         if (${I}.issues.length) {
-          if (${j} in input) {
+          if (${T} in input) {
             payload.issues = payload.issues.concat(${I}.issues.map(iss => ({
               ...iss,
-              path: iss.path ? [${j}, ...iss.path] : [${j}]
+              path: iss.path ? [${T}, ...iss.path] : [${T}]
             })));
           }
         }
         if (${I}.value === undefined) {
-          if (${j} in input) {
-            newResult[${j}] = undefined;
+          if (${T} in input) {
+            newResult[${T}] = undefined;
           }
         } else {
-          newResult[${j}] = ${I}.value;
+          newResult[${T}] = ${I}.value;
         }
       `) : ce ? m.write(`
         if (${I}.issues.length) {
           payload.issues = payload.issues.concat(${I}.issues.map(iss => ({
             ...iss,
-            path: iss.path ? [${j}, ...iss.path] : [${j}]
+            path: iss.path ? [${T}, ...iss.path] : [${T}]
           })));
         }
         if (${I}.value === undefined) {
-          if (${j} in input) {
-            newResult[${j}] = undefined;
+          if (${T} in input) {
+            newResult[${T}] = undefined;
           }
         } else {
-          newResult[${j}] = ${I}.value;
+          newResult[${T}] = ${I}.value;
         }
       `) : m.write(`
-        const ${I}_present = ${j} in input;
+        const ${I}_present = ${T} in input;
         if (${I}.issues.length) {
           payload.issues = payload.issues.concat(${I}.issues.map(iss => ({
             ...iss,
-            path: iss.path ? [${j}, ...iss.path] : [${j}]
+            path: iss.path ? [${T}, ...iss.path] : [${T}]
           })));
         }
         if (!${I}_present && !${I}.issues.length) {
@@ -6444,15 +6444,15 @@ const fd = /* @__PURE__ */ h("$ZodObject", (e, t) => {
             code: "invalid_type",
             expected: "nonoptional",
             input: undefined,
-            path: [${j}]
+            path: [${T}]
           });
         }
         if (${I}_present) {
           if (${I}.value === undefined) {
-            newResult[${j}] = undefined;
+            newResult[${T}] = undefined;
           } else {
-            newResult[${j}] = ${I}.value;
+            newResult[${T}] = ${I}.value;
           }
         }
@@ -6460,18 +6460,18 @@ const fd = /* @__PURE__ */ h("$ZodObject", (e, t) => {
     }
     m.write("payload.value = newResult;"), m.write("return payload;");
     const S = m.compile();
-    return (k, I) => S(f, k, I);
+    return (w, I) => S(f, w, I);
   };
   let o;
   const a = wt, s = !Jt.jitless, u = s && ru.value, l = t.catchall;
   let d;
   e._zod.parse = (f, m) => {
     d ?? (d = i.value);
-    const v = f.value;
-    return a(v) ? s && u && m?.async === !1 && m.jitless !== !0 ? (o || (o = n(t.shape)), f = o(f, m), l ? dd([], v, f, m, d, e) : f) : r(f, m) : (f.issues.push({
+    const g = f.value;
+    return a(g) ? s && u && m?.async === !1 && m.jitless !== !0 ? (o || (o = n(t.shape)), f = o(f, m), l ? dd([], g, f, m, d, e) : f) : r(f, m) : (f.issues.push({
       expected: "object",
       code: "invalid_type",
-      input: v,
+      input: g,
       inst: e
     }), f);
   };
@@ -6715,7 +6715,7 @@ const xo = /* @__PURE__ */ h("$ZodTuple", (e, t) => {
       for (const f of d) {
         l++;
         const m = t.rest._zod.run({ value: f, issues: [] }, n);
-        m instanceof Promise ? a.push(m.then((v) => Zs(v, i, l))) : Zs(m, i, l);
+        m instanceof Promise ? a.push(m.then((g) => Zs(g, i, l))) : Zs(m, i, l);
       }
     }
     return a.length ? Promise.all(a).then(() => Fs(u, i, r, o, c)) : Fs(u, i, r, o, c);
@@ -7215,7 +7215,7 @@ const f_ = () => {
         return /^[A-Z]/.test(n.expected) ? `مدخلات غير مقبولة: يفترض إدخال instanceof ${n.expected}، ولكن تم إدخال ${s}` : `مدخلات غير مقبولة: يفترض إدخال ${o}، ولكن تم إدخال ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `مدخلات غير مقبولة: يفترض إدخال ${E(n.values[0])}` : `اختيار غير مقبول: يتوقع انتقاء أحد هذه الخيارات: ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `مدخلات غير مقبولة: يفترض إدخال ${E(n.values[0])}` : `اختيار غير مقبول: يتوقع انتقاء أحد هذه الخيارات: ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? ` أكبر من اللازم: يفترض أن تكون ${n.origin ?? "القيمة"} ${o} ${n.maximum.toString()} ${a.unit ?? "عنصر"}` : `أكبر من اللازم: يفترض أن تكون ${n.origin ?? "القيمة"} ${o} ${n.maximum.toString()}`;
@@ -7231,7 +7231,7 @@ const f_ = () => {
       case "not_multiple_of":
         return `رقم غير مقبول: يجب أن يكون من مضاعفات ${n.divisor}`;
       case "unrecognized_keys":
-        return `معرف${n.keys.length > 1 ? "ات" : ""} غريب${n.keys.length > 1 ? "ة" : ""}: ${w(n.keys, "، ")}`;
+        return `معرف${n.keys.length > 1 ? "ات" : ""} غريب${n.keys.length > 1 ? "ة" : ""}: ${k(n.keys, "، ")}`;
       case "invalid_key":
         return `معرف غير مقبول في ${n.origin}`;
       case "invalid_union":
@@ -7297,7 +7297,7 @@ const p_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Yanlış dəyər: gözlənilən instanceof ${n.expected}, daxil olan ${s}` : `Yanlış dəyər: gözlənilən ${o}, daxil olan ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Yanlış dəyər: gözlənilən ${E(n.values[0])}` : `Yanlış seçim: aşağıdakılardan biri olmalıdır: ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Yanlış dəyər: gözlənilən ${E(n.values[0])}` : `Yanlış seçim: aşağıdakılardan biri olmalıdır: ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Çox böyük: gözlənilən ${n.origin ?? "dəyər"} ${o}${n.maximum.toString()} ${a.unit ?? "element"}` : `Çox böyük: gözlənilən ${n.origin ?? "dəyər"} ${o}${n.maximum.toString()}`;
@@ -7313,7 +7313,7 @@ const p_ = () => {
       case "not_multiple_of":
         return `Yanlış ədəd: ${n.divisor} ilə bölünə bilən olmalıdır`;
       case "unrecognized_keys":
-        return `Tanınmayan açar${n.keys.length > 1 ? "lar" : ""}: ${w(n.keys, ", ")}`;
+        return `Tanınmayan açar${n.keys.length > 1 ? "lar" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `${n.origin} daxilində yanlış açar`;
       case "invalid_union":
@@ -7413,7 +7413,7 @@ const g_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Няправільны ўвод: чакаўся instanceof ${n.expected}, атрымана ${s}` : `Няправільны ўвод: чакаўся ${o}, атрымана ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Няправільны ўвод: чакалася ${E(n.values[0])}` : `Няправільны варыянт: чакаўся адзін з ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Няправільны ўвод: чакалася ${E(n.values[0])}` : `Няправільны варыянт: чакаўся адзін з ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         if (a) {
@@ -7437,7 +7437,7 @@ const g_ = () => {
       case "not_multiple_of":
         return `Няправільны лік: павінен быць кратным ${n.divisor}`;
       case "unrecognized_keys":
-        return `Нераспазнаны ${n.keys.length > 1 ? "ключы" : "ключ"}: ${w(n.keys, ", ")}`;
+        return `Нераспазнаны ${n.keys.length > 1 ? "ключы" : "ключ"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Няправільны ключ у ${n.origin}`;
       case "invalid_union":
@@ -7505,7 +7505,7 @@ const y_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Невалиден вход: очакван instanceof ${n.expected}, получен ${s}` : `Невалиден вход: очакван ${o}, получен ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Невалиден вход: очакван ${E(n.values[0])}` : `Невалидна опция: очаквано едно от ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Невалиден вход: очакван ${E(n.values[0])}` : `Невалидна опция: очаквано едно от ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Твърде голямо: очаква се ${n.origin ?? "стойност"} да съдържа ${o}${n.maximum.toString()} ${a.unit ?? "елемента"}` : `Твърде голямо: очаква се ${n.origin ?? "стойност"} да бъде ${o}${n.maximum.toString()}`;
@@ -7530,7 +7530,7 @@ const y_ = () => {
       case "not_multiple_of":
         return `Невалидно число: трябва да бъде кратно на ${n.divisor}`;
       case "unrecognized_keys":
-        return `Неразпознат${n.keys.length > 1 ? "и" : ""} ключ${n.keys.length > 1 ? "ове" : ""}: ${w(n.keys, ", ")}`;
+        return `Неразпознат${n.keys.length > 1 ? "и" : ""} ключ${n.keys.length > 1 ? "ове" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Невалиден ключ в ${n.origin}`;
       case "invalid_union":
@@ -7596,7 +7596,7 @@ const b_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Tipus invàlid: s'esperava instanceof ${n.expected}, s'ha rebut ${s}` : `Tipus invàlid: s'esperava ${o}, s'ha rebut ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Valor invàlid: s'esperava ${E(n.values[0])}` : `Opció invàlida: s'esperava una de ${w(n.values, " o ")}`;
+        return n.values.length === 1 ? `Valor invàlid: s'esperava ${E(n.values[0])}` : `Opció invàlida: s'esperava una de ${k(n.values, " o ")}`;
       case "too_big": {
         const o = n.inclusive ? "com a màxim" : "menys de", a = t(n.origin);
         return a ? `Massa gran: s'esperava que ${n.origin ?? "el valor"} contingués ${o} ${n.maximum.toString()} ${a.unit ?? "elements"}` : `Massa gran: s'esperava que ${n.origin ?? "el valor"} fos ${o} ${n.maximum.toString()}`;
@@ -7612,7 +7612,7 @@ const b_ = () => {
       case "not_multiple_of":
         return `Número invàlid: ha de ser múltiple de ${n.divisor}`;
       case "unrecognized_keys":
-        return `Clau${n.keys.length > 1 ? "s" : ""} no reconeguda${n.keys.length > 1 ? "s" : ""}: ${w(n.keys, ", ")}`;
+        return `Clau${n.keys.length > 1 ? "s" : ""} no reconeguda${n.keys.length > 1 ? "s" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Clau invàlida a ${n.origin}`;
       case "invalid_union":
@@ -7683,7 +7683,7 @@ const w_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Neplatný vstup: očekáváno instanceof ${n.expected}, obdrženo ${s}` : `Neplatný vstup: očekáváno ${o}, obdrženo ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Neplatný vstup: očekáváno ${E(n.values[0])}` : `Neplatná možnost: očekávána jedna z hodnot ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Neplatný vstup: očekáváno ${E(n.values[0])}` : `Neplatná možnost: očekávána jedna z hodnot ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Hodnota je příliš velká: ${n.origin ?? "hodnota"} musí mít ${o}${n.maximum.toString()} ${a.unit ?? "prvků"}` : `Hodnota je příliš velká: ${n.origin ?? "hodnota"} musí být ${o}${n.maximum.toString()}`;
@@ -7699,7 +7699,7 @@ const w_ = () => {
       case "not_multiple_of":
         return `Neplatné číslo: musí být násobkem ${n.divisor}`;
       case "unrecognized_keys":
-        return `Neznámé klíče: ${w(n.keys, ", ")}`;
+        return `Neznámé klíče: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Neplatný klíč v ${n.origin}`;
       case "invalid_union":
@@ -7772,7 +7772,7 @@ const S_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Ugyldigt input: forventede instanceof ${n.expected}, fik ${s}` : `Ugyldigt input: forventede ${o}, fik ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Ugyldig værdi: forventede ${E(n.values[0])}` : `Ugyldigt valg: forventede en af følgende ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Ugyldig værdi: forventede ${E(n.values[0])}` : `Ugyldigt valg: forventede en af følgende ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin), s = i[n.origin] ?? n.origin;
         return a ? `For stor: forventede ${s ?? "value"} ${a.verb} ${o} ${n.maximum.toString()} ${a.unit ?? "elementer"}` : `For stor: forventede ${s ?? "value"} havde ${o} ${n.maximum.toString()}`;
@@ -7788,7 +7788,7 @@ const S_ = () => {
       case "not_multiple_of":
         return `Ugyldigt tal: skal være deleligt med ${n.divisor}`;
       case "unrecognized_keys":
-        return `${n.keys.length > 1 ? "Ukendte nøgler" : "Ukendt nøgle"}: ${w(n.keys, ", ")}`;
+        return `${n.keys.length > 1 ? "Ukendte nøgler" : "Ukendt nøgle"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Ugyldig nøgle i ${n.origin}`;
       case "invalid_union":
@@ -7856,7 +7856,7 @@ const z_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Ungültige Eingabe: erwartet instanceof ${n.expected}, erhalten ${s}` : `Ungültige Eingabe: erwartet ${o}, erhalten ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Ungültige Eingabe: erwartet ${E(n.values[0])}` : `Ungültige Option: erwartet eine von ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Ungültige Eingabe: erwartet ${E(n.values[0])}` : `Ungültige Option: erwartet eine von ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Zu groß: erwartet, dass ${n.origin ?? "Wert"} ${o}${n.maximum.toString()} ${a.unit ?? "Elemente"} hat` : `Zu groß: erwartet, dass ${n.origin ?? "Wert"} ${o}${n.maximum.toString()} ist`;
@@ -7872,7 +7872,7 @@ const z_ = () => {
       case "not_multiple_of":
         return `Ungültige Zahl: muss ein Vielfaches von ${n.divisor} sein`;
       case "unrecognized_keys":
-        return `${n.keys.length > 1 ? "Unbekannte Schlüssel" : "Unbekannter Schlüssel"}: ${w(n.keys, ", ")}`;
+        return `${n.keys.length > 1 ? "Unbekannte Schlüssel" : "Unbekannter Schlüssel"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Ungültiger Schlüssel in ${n.origin}`;
       case "invalid_union":
@@ -7940,7 +7940,7 @@ const x_ = () => {
         return typeof n.expected == "string" && /^[A-Z]/.test(n.expected) ? `Μη έγκυρη είσοδος: αναμενόταν instanceof ${n.expected}, λήφθηκε ${s}` : `Μη έγκυρη είσοδος: αναμενόταν ${o}, λήφθηκε ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Μη έγκυρη είσοδος: αναμενόταν ${E(n.values[0])}` : `Μη έγκυρη επιλογή: αναμενόταν ένα από ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Μη έγκυρη είσοδος: αναμενόταν ${E(n.values[0])}` : `Μη έγκυρη επιλογή: αναμενόταν ένα από ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Πολύ μεγάλο: αναμενόταν ${n.origin ?? "τιμή"} να έχει ${o}${n.maximum.toString()} ${a.unit ?? "στοιχεία"}` : `Πολύ μεγάλο: αναμενόταν ${n.origin ?? "τιμή"} να είναι ${o}${n.maximum.toString()}`;
@@ -7956,7 +7956,7 @@ const x_ = () => {
       case "not_multiple_of":
         return `Μη έγκυρος αριθμός: πρέπει να είναι πολλαπλάσιο του ${n.divisor}`;
       case "unrecognized_keys":
-        return `Άγνωστ${n.keys.length > 1 ? "α" : "ο"} κλειδ${n.keys.length > 1 ? "ιά" : "ί"}: ${w(n.keys, ", ")}`;
+        return `Άγνωστ${n.keys.length > 1 ? "α" : "ο"} κλειδ${n.keys.length > 1 ? "ιά" : "ί"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Μη έγκυρο κλειδί στο ${n.origin}`;
       case "invalid_union":
@@ -8026,7 +8026,7 @@ const N_ = () => {
         return `Invalid input: expected ${o}, received ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Invalid input: expected ${E(n.values[0])}` : `Invalid option: expected one of ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Invalid input: expected ${E(n.values[0])}` : `Invalid option: expected one of ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Too big: expected ${n.origin ?? "value"} to have ${o}${n.maximum.toString()} ${a.unit ?? "elements"}` : `Too big: expected ${n.origin ?? "value"} to be ${o}${n.maximum.toString()}`;
@@ -8042,7 +8042,7 @@ const N_ = () => {
       case "not_multiple_of":
         return `Invalid number: must be a multiple of ${n.divisor}`;
       case "unrecognized_keys":
-        return `Unrecognized key${n.keys.length > 1 ? "s" : ""}: ${w(n.keys, ", ")}`;
+        return `Unrecognized key${n.keys.length > 1 ? "s" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Invalid key in ${n.origin}`;
       case "invalid_union":
@@ -8111,7 +8111,7 @@ const D_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Nevalida enigo: atendiĝis instanceof ${n.expected}, riceviĝis ${s}` : `Nevalida enigo: atendiĝis ${o}, riceviĝis ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Nevalida enigo: atendiĝis ${E(n.values[0])}` : `Nevalida opcio: atendiĝis unu el ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Nevalida enigo: atendiĝis ${E(n.values[0])}` : `Nevalida opcio: atendiĝis unu el ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Tro granda: atendiĝis ke ${n.origin ?? "valoro"} havu ${o}${n.maximum.toString()} ${a.unit ?? "elementojn"}` : `Tro granda: atendiĝis ke ${n.origin ?? "valoro"} havu ${o}${n.maximum.toString()}`;
@@ -8127,7 +8127,7 @@ const D_ = () => {
       case "not_multiple_of":
         return `Nevalida nombro: devas esti oblo de ${n.divisor}`;
       case "unrecognized_keys":
-        return `Nekonata${n.keys.length > 1 ? "j" : ""} ŝlosilo${n.keys.length > 1 ? "j" : ""}: ${w(n.keys, ", ")}`;
+        return `Nekonata${n.keys.length > 1 ? "j" : ""} ŝlosilo${n.keys.length > 1 ? "j" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Nevalida ŝlosilo en ${n.origin}`;
       case "invalid_union":
@@ -8217,7 +8217,7 @@ const j_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Entrada inválida: se esperaba instanceof ${n.expected}, recibido ${s}` : `Entrada inválida: se esperaba ${o}, recibido ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Entrada inválida: se esperaba ${E(n.values[0])}` : `Opción inválida: se esperaba una de ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Entrada inválida: se esperaba ${E(n.values[0])}` : `Opción inválida: se esperaba una de ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin), s = i[n.origin] ?? n.origin;
         return a ? `Demasiado grande: se esperaba que ${s ?? "valor"} tuviera ${o}${n.maximum.toString()} ${a.unit ?? "elementos"}` : `Demasiado grande: se esperaba que ${s ?? "valor"} fuera ${o}${n.maximum.toString()}`;
@@ -8233,7 +8233,7 @@ const j_ = () => {
       case "not_multiple_of":
         return `Número inválido: debe ser múltiplo de ${n.divisor}`;
       case "unrecognized_keys":
-        return `Llave${n.keys.length > 1 ? "s" : ""} desconocida${n.keys.length > 1 ? "s" : ""}: ${w(n.keys, ", ")}`;
+        return `Llave${n.keys.length > 1 ? "s" : ""} desconocida${n.keys.length > 1 ? "s" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Llave inválida en ${i[n.origin] ?? n.origin}`;
       case "invalid_union":
@@ -8301,7 +8301,7 @@ const P_ = () => {
         return /^[A-Z]/.test(n.expected) ? `ورودی نامعتبر: می‌بایست instanceof ${n.expected} می‌بود، ${s} دریافت شد` : `ورودی نامعتبر: می‌بایست ${o} می‌بود، ${s} دریافت شد`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `ورودی نامعتبر: می‌بایست ${E(n.values[0])} می‌بود` : `گزینه نامعتبر: می‌بایست یکی از ${w(n.values, "|")} می‌بود`;
+        return n.values.length === 1 ? `ورودی نامعتبر: می‌بایست ${E(n.values[0])} می‌بود` : `گزینه نامعتبر: می‌بایست یکی از ${k(n.values, "|")} می‌بود`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `خیلی بزرگ: ${n.origin ?? "مقدار"} باید ${o}${n.maximum.toString()} ${a.unit ?? "عنصر"} باشد` : `خیلی بزرگ: ${n.origin ?? "مقدار"} باید ${o}${n.maximum.toString()} باشد`;
@@ -8317,7 +8317,7 @@ const P_ = () => {
       case "not_multiple_of":
         return `عدد نامعتبر: باید مضرب ${n.divisor} باشد`;
       case "unrecognized_keys":
-        return `کلید${n.keys.length > 1 ? "های" : ""} ناشناس: ${w(n.keys, ", ")}`;
+        return `کلید${n.keys.length > 1 ? "های" : ""} ناشناس: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `کلید ناشناس در ${n.origin}`;
       case "invalid_union":
@@ -8387,7 +8387,7 @@ const R_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Virheellinen tyyppi: odotettiin instanceof ${n.expected}, oli ${s}` : `Virheellinen tyyppi: odotettiin ${o}, oli ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Virheellinen syöte: täytyy olla ${E(n.values[0])}` : `Virheellinen valinta: täytyy olla yksi seuraavista: ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Virheellinen syöte: täytyy olla ${E(n.values[0])}` : `Virheellinen valinta: täytyy olla yksi seuraavista: ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Liian suuri: ${a.subject} täytyy olla ${o}${n.maximum.toString()} ${a.unit}`.trim() : `Liian suuri: arvon täytyy olla ${o}${n.maximum.toString()}`;
@@ -8403,7 +8403,7 @@ const R_ = () => {
       case "not_multiple_of":
         return `Virheellinen luku: täytyy olla luvun ${n.divisor} monikerta`;
       case "unrecognized_keys":
-        return `${n.keys.length > 1 ? "Tuntemattomat avaimet" : "Tuntematon avain"}: ${w(n.keys, ", ")}`;
+        return `${n.keys.length > 1 ? "Tuntemattomat avaimet" : "Tuntematon avain"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return "Virheellinen avain tietueessa";
       case "invalid_union":
@@ -8489,7 +8489,7 @@ const M_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Entrée invalide : instanceof ${n.expected} attendu, ${s} reçu` : `Entrée invalide : ${o} attendu, ${s} reçu`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Entrée invalide : ${E(n.values[0])} attendu` : `Option invalide : une valeur parmi ${w(n.values, "|")} attendue`;
+        return n.values.length === 1 ? `Entrée invalide : ${E(n.values[0])} attendu` : `Option invalide : une valeur parmi ${k(n.values, "|")} attendue`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Trop grand : ${i[n.origin] ?? "valeur"} doit ${a.verb} ${o}${n.maximum.toString()} ${a.unit ?? "élément(s)"}` : `Trop grand : ${i[n.origin] ?? "valeur"} doit être ${o}${n.maximum.toString()}`;
@@ -8505,7 +8505,7 @@ const M_ = () => {
       case "not_multiple_of":
         return `Nombre invalide : doit être un multiple de ${n.divisor}`;
       case "unrecognized_keys":
-        return `Clé${n.keys.length > 1 ? "s" : ""} non reconnue${n.keys.length > 1 ? "s" : ""} : ${w(n.keys, ", ")}`;
+        return `Clé${n.keys.length > 1 ? "s" : ""} non reconnue${n.keys.length > 1 ? "s" : ""} : ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Clé invalide dans ${n.origin}`;
       case "invalid_union":
@@ -8571,7 +8571,7 @@ const Z_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Entrée invalide : attendu instanceof ${n.expected}, reçu ${s}` : `Entrée invalide : attendu ${o}, reçu ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Entrée invalide : attendu ${E(n.values[0])}` : `Option invalide : attendu l'une des valeurs suivantes ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Entrée invalide : attendu ${E(n.values[0])}` : `Option invalide : attendu l'une des valeurs suivantes ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "≤" : "<", a = t(n.origin);
         return a ? `Trop grand : attendu que ${n.origin ?? "la valeur"} ait ${o}${n.maximum.toString()} ${a.unit}` : `Trop grand : attendu que ${n.origin ?? "la valeur"} soit ${o}${n.maximum.toString()}`;
@@ -8587,7 +8587,7 @@ const Z_ = () => {
       case "not_multiple_of":
         return `Nombre invalide : doit être un multiple de ${n.divisor}`;
       case "unrecognized_keys":
-        return `Clé${n.keys.length > 1 ? "s" : ""} non reconnue${n.keys.length > 1 ? "s" : ""} : ${w(n.keys, ", ")}`;
+        return `Clé${n.keys.length > 1 ? "s" : ""} non reconnue${n.keys.length > 1 ? "s" : ""} : ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Clé invalide dans ${n.origin}`;
       case "invalid_union":
@@ -8688,12 +8688,12 @@ const B_ = () => {
         if (u.origin === "string")
           return `${l?.longLabel ?? "ארוך"} מדי: ${d} צריכה להכיל ${u.maximum.toString()} ${l?.unit ?? ""} ${u.inclusive ? "או פחות" : "לכל היותר"}`.trim();
         if (u.origin === "number") {
-          const v = u.inclusive ? `קטן או שווה ל-${u.maximum}` : `קטן מ-${u.maximum}`;
-          return `גדול מדי: ${d} צריך להיות ${v}`;
+          const g = u.inclusive ? `קטן או שווה ל-${u.maximum}` : `קטן מ-${u.maximum}`;
+          return `גדול מדי: ${d} צריך להיות ${g}`;
         }
         if (u.origin === "array" || u.origin === "set") {
-          const v = u.origin === "set" ? "צריכה" : "צריך", y = u.inclusive ? `${u.maximum} ${l?.unit ?? ""} או פחות` : `פחות מ-${u.maximum} ${l?.unit ?? ""}`;
-          return `גדול מדי: ${d} ${v} להכיל ${y}`.trim();
+          const g = u.origin === "set" ? "צריכה" : "צריך", y = u.inclusive ? `${u.maximum} ${l?.unit ?? ""} או פחות` : `פחות מ-${u.maximum} ${l?.unit ?? ""}`;
+          return `גדול מדי: ${d} ${g} להכיל ${y}`.trim();
         }
         const f = u.inclusive ? "<=" : "<", m = o(u.origin ?? "value");
         return l?.unit ? `${l.longLabel} מדי: ${d} ${m} ${f}${u.maximum.toString()} ${l.unit}` : `${l?.longLabel ?? "גדול"} מדי: ${d} ${m} ${f}${u.maximum.toString()}`;
@@ -8703,17 +8703,17 @@ const B_ = () => {
         if (u.origin === "string")
           return `${l?.shortLabel ?? "קצר"} מדי: ${d} צריכה להכיל ${u.minimum.toString()} ${l?.unit ?? ""} ${u.inclusive ? "או יותר" : "לפחות"}`.trim();
         if (u.origin === "number") {
-          const v = u.inclusive ? `גדול או שווה ל-${u.minimum}` : `גדול מ-${u.minimum}`;
-          return `קטן מדי: ${d} צריך להיות ${v}`;
+          const g = u.inclusive ? `גדול או שווה ל-${u.minimum}` : `גדול מ-${u.minimum}`;
+          return `קטן מדי: ${d} צריך להיות ${g}`;
         }
         if (u.origin === "array" || u.origin === "set") {
-          const v = u.origin === "set" ? "צריכה" : "צריך";
+          const g = u.origin === "set" ? "צריכה" : "צריך";
           if (u.minimum === 1 && u.inclusive) {
             const b = (u.origin === "set", "לפחות פריט אחד");
-            return `קטן מדי: ${d} ${v} להכיל ${b}`;
+            return `קטן מדי: ${d} ${g} להכיל ${b}`;
           }
           const y = u.inclusive ? `${u.minimum} ${l?.unit ?? ""} או יותר` : `יותר מ-${u.minimum} ${l?.unit ?? ""}`;
-          return `קטן מדי: ${d} ${v} להכיל ${y}`.trim();
+          return `קטן מדי: ${d} ${g} להכיל ${y}`.trim();
         }
         const f = u.inclusive ? ">=" : ">", m = o(u.origin ?? "value");
         return l?.unit ? `${l.shortLabel} מדי: ${d} ${m} ${f}${u.minimum.toString()} ${l.unit}` : `${l?.shortLabel ?? "קטן"} מדי: ${d} ${m} ${f}${u.minimum.toString()}`;
@@ -8728,13 +8728,13 @@ const B_ = () => {
           return `המחרוזת חייבת לכלול "${l.includes}"`;
         if (l.format === "regex")
           return `המחרוזת חייבת להתאים לתבנית ${l.pattern}`;
-        const d = s[l.format], f = d?.label ?? l.format, v = (d?.gender ?? "m") === "f" ? "תקינה" : "תקין";
-        return `${f} לא ${v}`;
+        const d = s[l.format], f = d?.label ?? l.format, g = (d?.gender ?? "m") === "f" ? "תקינה" : "תקין";
+        return `${f} לא ${g}`;
       }
       case "not_multiple_of":
         return `מספר לא תקין: חייב להיות מכפלה של ${u.divisor}`;
       case "unrecognized_keys":
-        return `מפתח${u.keys.length > 1 ? "ות" : ""} לא מזוה${u.keys.length > 1 ? "ים" : "ה"}: ${w(u.keys, ", ")}`;
+        return `מפתח${u.keys.length > 1 ? "ות" : ""} לא מזוה${u.keys.length > 1 ? "ים" : "ה"}: ${k(u.keys, ", ")}`;
       case "invalid_key":
         return "שדה לא תקין באובייקט";
       case "invalid_union":
@@ -8814,7 +8814,7 @@ const J_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Neispravan unos: očekuje se instanceof ${n.expected}, a primljeno je ${s}` : `Neispravan unos: očekuje se ${o}, a primljeno je ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Neispravna vrijednost: očekivano ${E(n.values[0])}` : `Neispravna opcija: očekivano jedno od ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Neispravna vrijednost: očekivano ${E(n.values[0])}` : `Neispravna opcija: očekivano jedno od ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin), s = i[n.origin] ?? n.origin;
         return a ? `Preveliko: očekivano da ${s ?? "vrijednost"} ima ${o}${n.maximum.toString()} ${a.unit ?? "elemenata"}` : `Preveliko: očekivano da ${s ?? "vrijednost"} bude ${o}${n.maximum.toString()}`;
@@ -8830,7 +8830,7 @@ const J_ = () => {
       case "not_multiple_of":
         return `Neispravan broj: mora biti višekratnik od ${n.divisor}`;
       case "unrecognized_keys":
-        return `Neprepoznat${n.keys.length > 1 ? "i ključevi" : " ključ"}: ${w(n.keys, ", ")}`;
+        return `Neprepoznat${n.keys.length > 1 ? "i ključevi" : " ključ"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Neispravan ključ u ${i[n.origin] ?? n.origin}`;
       case "invalid_union":
@@ -8898,7 +8898,7 @@ const K_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Érvénytelen bemenet: a várt érték instanceof ${n.expected}, a kapott érték ${s}` : `Érvénytelen bemenet: a várt érték ${o}, a kapott érték ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Érvénytelen bemenet: a várt érték ${E(n.values[0])}` : `Érvénytelen opció: valamelyik érték várt ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Érvénytelen bemenet: a várt érték ${E(n.values[0])}` : `Érvénytelen opció: valamelyik érték várt ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Túl nagy: ${n.origin ?? "érték"} mérete túl nagy ${o}${n.maximum.toString()} ${a.unit ?? "elem"}` : `Túl nagy: a bemeneti érték ${n.origin ?? "érték"} túl nagy: ${o}${n.maximum.toString()}`;
@@ -8914,7 +8914,7 @@ const K_ = () => {
       case "not_multiple_of":
         return `Érvénytelen szám: ${n.divisor} többszörösének kell lennie`;
       case "unrecognized_keys":
-        return `Ismeretlen kulcs${n.keys.length > 1 ? "s" : ""}: ${w(n.keys, ", ")}`;
+        return `Ismeretlen kulcs${n.keys.length > 1 ? "s" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Érvénytelen kulcs ${n.origin}`;
       case "invalid_union":
@@ -9015,7 +9015,7 @@ const H_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Սխալ մուտքագրում․ սպասվում էր instanceof ${n.expected}, ստացվել է ${s}` : `Սխալ մուտքագրում․ սպասվում էր ${o}, ստացվել է ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Սխալ մուտքագրում․ սպասվում էր ${E(n.values[1])}` : `Սխալ տարբերակ․ սպասվում էր հետևյալներից մեկը՝ ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Սխալ մուտքագրում․ սպասվում էր ${E(n.values[1])}` : `Սխալ տարբերակ․ սպասվում էր հետևյալներից մեկը՝ ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         if (a) {
@@ -9039,7 +9039,7 @@ const H_ = () => {
       case "not_multiple_of":
         return `Սխալ թիվ․ պետք է բազմապատիկ լինի ${n.divisor}-ի`;
       case "unrecognized_keys":
-        return `Չճանաչված բանալի${n.keys.length > 1 ? "ներ" : ""}. ${w(n.keys, ", ")}`;
+        return `Չճանաչված բանալի${n.keys.length > 1 ? "ներ" : ""}. ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Սխալ բանալի ${vt(n.origin)}-ում`;
       case "invalid_union":
@@ -9105,7 +9105,7 @@ const Q_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Input tidak valid: diharapkan instanceof ${n.expected}, diterima ${s}` : `Input tidak valid: diharapkan ${o}, diterima ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Input tidak valid: diharapkan ${E(n.values[0])}` : `Pilihan tidak valid: diharapkan salah satu dari ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Input tidak valid: diharapkan ${E(n.values[0])}` : `Pilihan tidak valid: diharapkan salah satu dari ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Terlalu besar: diharapkan ${n.origin ?? "value"} memiliki ${o}${n.maximum.toString()} ${a.unit ?? "elemen"}` : `Terlalu besar: diharapkan ${n.origin ?? "value"} menjadi ${o}${n.maximum.toString()}`;
@@ -9121,7 +9121,7 @@ const Q_ = () => {
       case "not_multiple_of":
         return `Angka tidak valid: harus kelipatan dari ${n.divisor}`;
       case "unrecognized_keys":
-        return `Kunci tidak dikenali ${n.keys.length > 1 ? "s" : ""}: ${w(n.keys, ", ")}`;
+        return `Kunci tidak dikenali ${n.keys.length > 1 ? "s" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Kunci tidak valid di ${n.origin}`;
       case "invalid_union":
@@ -9189,7 +9189,7 @@ const X_ = () => {
         return /^[A-Z]/.test(n.expected) ? `Rangt gildi: Þú slóst inn ${s} þar sem á að vera instanceof ${n.expected}` : `Rangt gildi: Þú slóst inn ${s} þar sem á að vera ${o}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Rangt gildi: gert ráð fyrir ${E(n.values[0])}` : `Ógilt val: má vera eitt af eftirfarandi ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Rangt gildi: gert ráð fyrir ${E(n.values[0])}` : `Ógilt val: má vera eitt af eftirfarandi ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Of stórt: gert er ráð fyrir að ${n.origin ?? "gildi"} hafi ${o}${n.maximum.toString()} ${a.unit ?? "hluti"}` : `Of stórt: gert er ráð fyrir að ${n.origin ?? "gildi"} sé ${o}${n.maximum.toString()}`;
@@ -9205,7 +9205,7 @@ const X_ = () => {
       case "not_multiple_of":
         return `Röng tala: verður að vera margfeldi af ${n.divisor}`;
       case "unrecognized_keys":
-        return `Óþekkt ${n.keys.length > 1 ? "ir lyklar" : "ur lykill"}: ${w(n.keys, ", ")}`;
+        return `Óþekkt ${n.keys.length > 1 ? "ir lyklar" : "ur lykill"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Rangur lykill í ${n.origin}`;
       case "invalid_union":
@@ -9273,7 +9273,7 @@ const tb = () => {
         return /^[A-Z]/.test(n.expected) ? `Input non valido: atteso instanceof ${n.expected}, ricevuto ${s}` : `Input non valido: atteso ${o}, ricevuto ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Input non valido: atteso ${E(n.values[0])}` : `Opzione non valida: atteso uno tra ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Input non valido: atteso ${E(n.values[0])}` : `Opzione non valida: atteso uno tra ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Troppo grande: ${n.origin ?? "valore"} deve avere ${o}${n.maximum.toString()} ${a.unit ?? "elementi"}` : `Troppo grande: ${n.origin ?? "valore"} deve essere ${o}${n.maximum.toString()}`;
@@ -9289,7 +9289,7 @@ const tb = () => {
       case "not_multiple_of":
         return `Numero non valido: deve essere un multiplo di ${n.divisor}`;
       case "unrecognized_keys":
-        return `Chiav${n.keys.length > 1 ? "i" : "e"} non riconosciut${n.keys.length > 1 ? "e" : "a"}: ${w(n.keys, ", ")}`;
+        return `Chiav${n.keys.length > 1 ? "i" : "e"} non riconosciut${n.keys.length > 1 ? "e" : "a"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Chiave non valida in ${n.origin}`;
       case "invalid_union":
@@ -9357,7 +9357,7 @@ const rb = () => {
         return /^[A-Z]/.test(n.expected) ? `無効な入力: instanceof ${n.expected}が期待されましたが、${s}が入力されました` : `無効な入力: ${o}が期待されましたが、${s}が入力されました`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `無効な入力: ${E(n.values[0])}が期待されました` : `無効な選択: ${w(n.values, "、")}のいずれかである必要があります`;
+        return n.values.length === 1 ? `無効な入力: ${E(n.values[0])}が期待されました` : `無効な選択: ${k(n.values, "、")}のいずれかである必要があります`;
       case "too_big": {
         const o = n.inclusive ? "以下である" : "より小さい", a = t(n.origin);
         return a ? `大きすぎる値: ${n.origin ?? "値"}は${n.maximum.toString()}${a.unit ?? "要素"}${o}必要があります` : `大きすぎる値: ${n.origin ?? "値"}は${n.maximum.toString()}${o}必要があります`;
@@ -9373,7 +9373,7 @@ const rb = () => {
       case "not_multiple_of":
         return `無効な数値: ${n.divisor}の倍数である必要があります`;
       case "unrecognized_keys":
-        return `認識されていないキー${n.keys.length > 1 ? "群" : ""}: ${w(n.keys, "、")}`;
+        return `認識されていないキー${n.keys.length > 1 ? "群" : ""}: ${k(n.keys, "、")}`;
       case "invalid_key":
         return `${n.origin}内の無効なキー`;
       case "invalid_union":
@@ -9444,7 +9444,7 @@ const ob = () => {
         return /^[A-Z]/.test(n.expected) ? `არასწორი შეყვანა: მოსალოდნელი instanceof ${n.expected}, მიღებული ${s}` : `არასწორი შეყვანა: მოსალოდნელი ${o}, მიღებული ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `არასწორი შეყვანა: მოსალოდნელი ${E(n.values[0])}` : `არასწორი ვარიანტი: მოსალოდნელია ერთ-ერთი ${w(n.values, "|")}-დან`;
+        return n.values.length === 1 ? `არასწორი შეყვანა: მოსალოდნელი ${E(n.values[0])}` : `არასწორი ვარიანტი: მოსალოდნელია ერთ-ერთი ${k(n.values, "|")}-დან`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `ზედმეტად დიდი: მოსალოდნელი ${n.origin ?? "მნიშვნელობა"} ${a.verb} ${o}${n.maximum.toString()} ${a.unit}` : `ზედმეტად დიდი: მოსალოდნელი ${n.origin ?? "მნიშვნელობა"} იყოს ${o}${n.maximum.toString()}`;
@@ -9460,7 +9460,7 @@ const ob = () => {
       case "not_multiple_of":
         return `არასწორი რიცხვი: უნდა იყოს ${n.divisor}-ის ჯერადი`;
       case "unrecognized_keys":
-        return `უცნობი გასაღებ${n.keys.length > 1 ? "ები" : "ი"}: ${w(n.keys, ", ")}`;
+        return `უცნობი გასაღებ${n.keys.length > 1 ? "ები" : "ი"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `არასწორი გასაღები ${n.origin}-ში`;
       case "invalid_union":
@@ -9529,7 +9529,7 @@ const sb = () => {
         return /^[A-Z]/.test(n.expected) ? `ទិន្នន័យបញ្ចូលមិនត្រឹមត្រូវ៖ ត្រូវការ instanceof ${n.expected} ប៉ុន្តែទទួលបាន ${s}` : `ទិន្នន័យបញ្ចូលមិនត្រឹមត្រូវ៖ ត្រូវការ ${o} ប៉ុន្តែទទួលបាន ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `ទិន្នន័យបញ្ចូលមិនត្រឹមត្រូវ៖ ត្រូវការ ${E(n.values[0])}` : `ជម្រើសមិនត្រឹមត្រូវ៖ ត្រូវជាមួយក្នុងចំណោម ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `ទិន្នន័យបញ្ចូលមិនត្រឹមត្រូវ៖ ត្រូវការ ${E(n.values[0])}` : `ជម្រើសមិនត្រឹមត្រូវ៖ ត្រូវជាមួយក្នុងចំណោម ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `ធំពេក៖ ត្រូវការ ${n.origin ?? "តម្លៃ"} ${o} ${n.maximum.toString()} ${a.unit ?? "ធាតុ"}` : `ធំពេក៖ ត្រូវការ ${n.origin ?? "តម្លៃ"} ${o} ${n.maximum.toString()}`;
@@ -9545,7 +9545,7 @@ const sb = () => {
       case "not_multiple_of":
         return `លេខមិនត្រឹមត្រូវ៖ ត្រូវតែជាពហុគុណនៃ ${n.divisor}`;
       case "unrecognized_keys":
-        return `រកឃើញសោមិនស្គាល់៖ ${w(n.keys, ", ")}`;
+        return `រកឃើញសោមិនស្គាល់៖ ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `សោមិនត្រឹមត្រូវនៅក្នុង ${n.origin}`;
       case "invalid_union":
@@ -9614,7 +9614,7 @@ const ub = () => {
         return /^[A-Z]/.test(n.expected) ? `잘못된 입력: 예상 타입은 instanceof ${n.expected}, 받은 타입은 ${s}입니다` : `잘못된 입력: 예상 타입은 ${o}, 받은 타입은 ${s}입니다`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `잘못된 입력: 값은 ${E(n.values[0])} 이어야 합니다` : `잘못된 옵션: ${w(n.values, "또는 ")} 중 하나여야 합니다`;
+        return n.values.length === 1 ? `잘못된 입력: 값은 ${E(n.values[0])} 이어야 합니다` : `잘못된 옵션: ${k(n.values, "또는 ")} 중 하나여야 합니다`;
       case "too_big": {
         const o = n.inclusive ? "이하" : "미만", a = o === "미만" ? "이어야 합니다" : "여야 합니다", s = t(n.origin), c = s?.unit ?? "요소";
         return s ? `${n.origin ?? "값"}이 너무 큽니다: ${n.maximum.toString()}${c} ${o}${a}` : `${n.origin ?? "값"}이 너무 큽니다: ${n.maximum.toString()} ${o}${a}`;
@@ -9630,7 +9630,7 @@ const ub = () => {
       case "not_multiple_of":
         return `잘못된 숫자: ${n.divisor}의 배수여야 합니다`;
       case "unrecognized_keys":
-        return `인식할 수 없는 키: ${w(n.keys, ", ")}`;
+        return `인식할 수 없는 키: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `잘못된 키: ${n.origin}`;
       case "invalid_union":
@@ -9779,7 +9779,7 @@ const db = () => {
         return /^[A-Z]/.test(n.expected) ? `Gautas tipas ${s}, o tikėtasi - instanceof ${n.expected}` : `Gautas tipas ${s}, o tikėtasi - ${o}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Privalo būti ${E(n.values[0])}` : `Privalo būti vienas iš ${w(n.values, "|")} pasirinkimų`;
+        return n.values.length === 1 ? `Privalo būti ${E(n.values[0])}` : `Privalo būti vienas iš ${k(n.values, "|")} pasirinkimų`;
       case "too_big": {
         const o = i[n.origin] ?? n.origin, a = t(n.origin, Ys(Number(n.maximum)), n.inclusive ?? !1, "smaller");
         if (a?.verb)
@@ -9801,7 +9801,7 @@ const db = () => {
       case "not_multiple_of":
         return `Skaičius privalo būti ${n.divisor} kartotinis.`;
       case "unrecognized_keys":
-        return `Neatpažint${n.keys.length > 1 ? "i" : "as"} rakt${n.keys.length > 1 ? "ai" : "as"}: ${w(n.keys, ", ")}`;
+        return `Neatpažint${n.keys.length > 1 ? "i" : "as"} rakt${n.keys.length > 1 ? "ai" : "as"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return "Rastas klaidingas raktas";
       case "invalid_union":
@@ -9871,7 +9871,7 @@ const mb = () => {
         return /^[A-Z]/.test(n.expected) ? `Грешен внес: се очекува instanceof ${n.expected}, примено ${s}` : `Грешен внес: се очекува ${o}, примено ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Invalid input: expected ${E(n.values[0])}` : `Грешана опција: се очекува една ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Invalid input: expected ${E(n.values[0])}` : `Грешана опција: се очекува една ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Премногу голем: се очекува ${n.origin ?? "вредноста"} да има ${o}${n.maximum.toString()} ${a.unit ?? "елементи"}` : `Премногу голем: се очекува ${n.origin ?? "вредноста"} да биде ${o}${n.maximum.toString()}`;
@@ -9887,7 +9887,7 @@ const mb = () => {
       case "not_multiple_of":
         return `Грешен број: мора да биде делив со ${n.divisor}`;
       case "unrecognized_keys":
-        return `${n.keys.length > 1 ? "Непрепознаени клучеви" : "Непрепознаен клуч"}: ${w(n.keys, ", ")}`;
+        return `${n.keys.length > 1 ? "Непрепознаени клучеви" : "Непрепознаен клуч"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Грешен клуч во ${n.origin}`;
       case "invalid_union":
@@ -9954,7 +9954,7 @@ const hb = () => {
         return /^[A-Z]/.test(n.expected) ? `Input tidak sah: dijangka instanceof ${n.expected}, diterima ${s}` : `Input tidak sah: dijangka ${o}, diterima ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Input tidak sah: dijangka ${E(n.values[0])}` : `Pilihan tidak sah: dijangka salah satu daripada ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Input tidak sah: dijangka ${E(n.values[0])}` : `Pilihan tidak sah: dijangka salah satu daripada ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Terlalu besar: dijangka ${n.origin ?? "nilai"} ${a.verb} ${o}${n.maximum.toString()} ${a.unit ?? "elemen"}` : `Terlalu besar: dijangka ${n.origin ?? "nilai"} adalah ${o}${n.maximum.toString()}`;
@@ -9970,7 +9970,7 @@ const hb = () => {
       case "not_multiple_of":
         return `Nombor tidak sah: perlu gandaan ${n.divisor}`;
       case "unrecognized_keys":
-        return `Kunci tidak dikenali: ${w(n.keys, ", ")}`;
+        return `Kunci tidak dikenali: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Kunci tidak sah dalam ${n.origin}`;
       case "invalid_union":
@@ -10037,7 +10037,7 @@ const vb = () => {
         return /^[A-Z]/.test(n.expected) ? `Ongeldige invoer: verwacht instanceof ${n.expected}, ontving ${s}` : `Ongeldige invoer: verwacht ${o}, ontving ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Ongeldige invoer: verwacht ${E(n.values[0])}` : `Ongeldige optie: verwacht één van ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Ongeldige invoer: verwacht ${E(n.values[0])}` : `Ongeldige optie: verwacht één van ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin), s = n.origin === "date" ? "laat" : n.origin === "string" ? "lang" : "groot";
         return a ? `Te ${s}: verwacht dat ${n.origin ?? "waarde"} ${o}${n.maximum.toString()} ${a.unit ?? "elementen"} ${a.verb}` : `Te ${s}: verwacht dat ${n.origin ?? "waarde"} ${o}${n.maximum.toString()} is`;
@@ -10053,7 +10053,7 @@ const vb = () => {
       case "not_multiple_of":
         return `Ongeldig getal: moet een veelvoud van ${n.divisor} zijn`;
       case "unrecognized_keys":
-        return `Onbekende key${n.keys.length > 1 ? "s" : ""}: ${w(n.keys, ", ")}`;
+        return `Onbekende key${n.keys.length > 1 ? "s" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Ongeldige key in ${n.origin}`;
       case "invalid_union":
@@ -10121,7 +10121,7 @@ const _b = () => {
         return /^[A-Z]/.test(n.expected) ? `Ugyldig input: forventet instanceof ${n.expected}, fikk ${s}` : `Ugyldig input: forventet ${o}, fikk ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Ugyldig verdi: forventet ${E(n.values[0])}` : `Ugyldig valg: forventet en av ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Ugyldig verdi: forventet ${E(n.values[0])}` : `Ugyldig valg: forventet en av ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `For stor(t): forventet ${n.origin ?? "value"} til å ha ${o}${n.maximum.toString()} ${a.unit ?? "elementer"}` : `For stor(t): forventet ${n.origin ?? "value"} til å ha ${o}${n.maximum.toString()}`;
@@ -10137,7 +10137,7 @@ const _b = () => {
       case "not_multiple_of":
         return `Ugyldig tall: må være et multiplum av ${n.divisor}`;
       case "unrecognized_keys":
-        return `${n.keys.length > 1 ? "Ukjente nøkler" : "Ukjent nøkkel"}: ${w(n.keys, ", ")}`;
+        return `${n.keys.length > 1 ? "Ukjente nøkler" : "Ukjent nøkkel"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Ugyldig nøkkel i ${n.origin}`;
       case "invalid_union":
@@ -10206,7 +10206,7 @@ const $b = () => {
         return /^[A-Z]/.test(n.expected) ? `Fâsit giren: umulan instanceof ${n.expected}, alınan ${s}` : `Fâsit giren: umulan ${o}, alınan ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Fâsit giren: umulan ${E(n.values[0])}` : `Fâsit tercih: mûteberler ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Fâsit giren: umulan ${E(n.values[0])}` : `Fâsit tercih: mûteberler ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Fazla büyük: ${n.origin ?? "value"}, ${o}${n.maximum.toString()} ${a.unit ?? "elements"} sahip olmalıydı.` : `Fazla büyük: ${n.origin ?? "value"}, ${o}${n.maximum.toString()} olmalıydı.`;
@@ -10222,7 +10222,7 @@ const $b = () => {
       case "not_multiple_of":
         return `Fâsit sayı: ${n.divisor} katı olmalıydı.`;
       case "unrecognized_keys":
-        return `Tanınmayan anahtar ${n.keys.length > 1 ? "s" : ""}: ${w(n.keys, ", ")}`;
+        return `Tanınmayan anahtar ${n.keys.length > 1 ? "s" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `${n.origin} için tanınmayan anahtar var.`;
       case "invalid_union":
@@ -10290,7 +10290,7 @@ const kb = () => {
         return /^[A-Z]/.test(n.expected) ? `ناسم ورودي: باید instanceof ${n.expected} وای, مګر ${s} ترلاسه شو` : `ناسم ورودي: باید ${o} وای, مګر ${s} ترلاسه شو`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `ناسم ورودي: باید ${E(n.values[0])} وای` : `ناسم انتخاب: باید یو له ${w(n.values, "|")} څخه وای`;
+        return n.values.length === 1 ? `ناسم ورودي: باید ${E(n.values[0])} وای` : `ناسم انتخاب: باید یو له ${k(n.values, "|")} څخه وای`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `ډیر لوی: ${n.origin ?? "ارزښت"} باید ${o}${n.maximum.toString()} ${a.unit ?? "عنصرونه"} ولري` : `ډیر لوی: ${n.origin ?? "ارزښت"} باید ${o}${n.maximum.toString()} وي`;
@@ -10306,7 +10306,7 @@ const kb = () => {
       case "not_multiple_of":
         return `ناسم عدد: باید د ${n.divisor} مضرب وي`;
       case "unrecognized_keys":
-        return `ناسم ${n.keys.length > 1 ? "کلیډونه" : "کلیډ"}: ${w(n.keys, ", ")}`;
+        return `ناسم ${n.keys.length > 1 ? "کلیډونه" : "کلیډ"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `ناسم کلیډ په ${n.origin} کې`;
       case "invalid_union":
@@ -10374,7 +10374,7 @@ const Ib = () => {
         return /^[A-Z]/.test(n.expected) ? `Nieprawidłowe dane wejściowe: oczekiwano instanceof ${n.expected}, otrzymano ${s}` : `Nieprawidłowe dane wejściowe: oczekiwano ${o}, otrzymano ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Nieprawidłowe dane wejściowe: oczekiwano ${E(n.values[0])}` : `Nieprawidłowa opcja: oczekiwano jednej z wartości ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Nieprawidłowe dane wejściowe: oczekiwano ${E(n.values[0])}` : `Nieprawidłowa opcja: oczekiwano jednej z wartości ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Za duża wartość: oczekiwano, że ${n.origin ?? "wartość"} będzie mieć ${o}${n.maximum.toString()} ${a.unit ?? "elementów"}` : `Zbyt duż(y/a/e): oczekiwano, że ${n.origin ?? "wartość"} będzie wynosić ${o}${n.maximum.toString()}`;
@@ -10390,7 +10390,7 @@ const Ib = () => {
       case "not_multiple_of":
         return `Nieprawidłowa liczba: musi być wielokrotnością ${n.divisor}`;
       case "unrecognized_keys":
-        return `Nierozpoznane klucze${n.keys.length > 1 ? "s" : ""}: ${w(n.keys, ", ")}`;
+        return `Nierozpoznane klucze${n.keys.length > 1 ? "s" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Nieprawidłowy klucz w ${n.origin}`;
       case "invalid_union":
@@ -10458,7 +10458,7 @@ const Ob = () => {
         return /^[A-Z]/.test(n.expected) ? `Tipo inválido: esperado instanceof ${n.expected}, recebido ${s}` : `Tipo inválido: esperado ${o}, recebido ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Entrada inválida: esperado ${E(n.values[0])}` : `Opção inválida: esperada uma das ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Entrada inválida: esperado ${E(n.values[0])}` : `Opção inválida: esperada uma das ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Muito grande: esperado que ${n.origin ?? "valor"} tivesse ${o}${n.maximum.toString()} ${a.unit ?? "elementos"}` : `Muito grande: esperado que ${n.origin ?? "valor"} fosse ${o}${n.maximum.toString()}`;
@@ -10474,7 +10474,7 @@ const Ob = () => {
       case "not_multiple_of":
         return `Número inválido: deve ser múltiplo de ${n.divisor}`;
       case "unrecognized_keys":
-        return `Chave${n.keys.length > 1 ? "s" : ""} desconhecida${n.keys.length > 1 ? "s" : ""}: ${w(n.keys, ", ")}`;
+        return `Chave${n.keys.length > 1 ? "s" : ""} desconhecida${n.keys.length > 1 ? "s" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Chave inválida em ${n.origin}`;
       case "invalid_union":
@@ -10555,7 +10555,7 @@ const Eb = () => {
         return `Intrare invalidă: așteptat ${o}, primit ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Intrare invalidă: așteptat ${E(n.values[0])}` : `Opțiune invalidă: așteptat una dintre ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Intrare invalidă: așteptat ${E(n.values[0])}` : `Opțiune invalidă: așteptat una dintre ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Prea mare: așteptat ca ${n.origin ?? "valoarea"} ${a.verb} ${o}${n.maximum.toString()} ${a.unit ?? "elemente"}` : `Prea mare: așteptat ca ${n.origin ?? "valoarea"} să fie ${o}${n.maximum.toString()}`;
@@ -10571,7 +10571,7 @@ const Eb = () => {
       case "not_multiple_of":
         return `Număr invalid: trebuie să fie multiplu de ${n.divisor}`;
       case "unrecognized_keys":
-        return `Chei nerecunoscute: ${w(n.keys, ", ")}`;
+        return `Chei nerecunoscute: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Cheie invalidă în ${n.origin}`;
       case "invalid_union":
@@ -10671,7 +10671,7 @@ const Db = () => {
         return /^[A-Z]/.test(n.expected) ? `Неверный ввод: ожидалось instanceof ${n.expected}, получено ${s}` : `Неверный ввод: ожидалось ${o}, получено ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Неверный ввод: ожидалось ${E(n.values[0])}` : `Неверный вариант: ожидалось одно из ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Неверный ввод: ожидалось ${E(n.values[0])}` : `Неверный вариант: ожидалось одно из ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         if (a) {
@@ -10695,7 +10695,7 @@ const Db = () => {
       case "not_multiple_of":
         return `Неверное число: должно быть кратным ${n.divisor}`;
       case "unrecognized_keys":
-        return `Нераспознанн${n.keys.length > 1 ? "ые" : "ый"} ключ${n.keys.length > 1 ? "и" : ""}: ${w(n.keys, ", ")}`;
+        return `Нераспознанн${n.keys.length > 1 ? "ые" : "ый"} ключ${n.keys.length > 1 ? "и" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Неверный ключ в ${n.origin}`;
       case "invalid_union":
@@ -10763,7 +10763,7 @@ const jb = () => {
         return /^[A-Z]/.test(n.expected) ? `Neveljaven vnos: pričakovano instanceof ${n.expected}, prejeto ${s}` : `Neveljaven vnos: pričakovano ${o}, prejeto ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Neveljaven vnos: pričakovano ${E(n.values[0])}` : `Neveljavna možnost: pričakovano eno izmed ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Neveljaven vnos: pričakovano ${E(n.values[0])}` : `Neveljavna možnost: pričakovano eno izmed ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Preveliko: pričakovano, da bo ${n.origin ?? "vrednost"} imelo ${o}${n.maximum.toString()} ${a.unit ?? "elementov"}` : `Preveliko: pričakovano, da bo ${n.origin ?? "vrednost"} ${o}${n.maximum.toString()}`;
@@ -10779,7 +10779,7 @@ const jb = () => {
       case "not_multiple_of":
         return `Neveljavno število: mora biti večkratnik ${n.divisor}`;
       case "unrecognized_keys":
-        return `Neprepoznan${n.keys.length > 1 ? "i ključi" : " ključ"}: ${w(n.keys, ", ")}`;
+        return `Neprepoznan${n.keys.length > 1 ? "i ključi" : " ključ"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Neveljaven ključ v ${n.origin}`;
       case "invalid_union":
@@ -10847,7 +10847,7 @@ const Pb = () => {
         return /^[A-Z]/.test(n.expected) ? `Ogiltig inmatning: förväntat instanceof ${n.expected}, fick ${s}` : `Ogiltig inmatning: förväntat ${o}, fick ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Ogiltig inmatning: förväntat ${E(n.values[0])}` : `Ogiltigt val: förväntade en av ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Ogiltig inmatning: förväntat ${E(n.values[0])}` : `Ogiltigt val: förväntade en av ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `För stor(t): förväntade ${n.origin ?? "värdet"} att ha ${o}${n.maximum.toString()} ${a.unit ?? "element"}` : `För stor(t): förväntat ${n.origin ?? "värdet"} att ha ${o}${n.maximum.toString()}`;
@@ -10863,7 +10863,7 @@ const Pb = () => {
       case "not_multiple_of":
         return `Ogiltigt tal: måste vara en multipel av ${n.divisor}`;
       case "unrecognized_keys":
-        return `${n.keys.length > 1 ? "Okända nycklar" : "Okänd nyckel"}: ${w(n.keys, ", ")}`;
+        return `${n.keys.length > 1 ? "Okända nycklar" : "Okänd nyckel"}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Ogiltig nyckel i ${n.origin ?? "värdet"}`;
       case "invalid_union":
@@ -10932,7 +10932,7 @@ const Rb = () => {
         return /^[A-Z]/.test(n.expected) ? `தவறான உள்ளீடு: எதிர்பார்க்கப்பட்டது instanceof ${n.expected}, பெறப்பட்டது ${s}` : `தவறான உள்ளீடு: எதிர்பார்க்கப்பட்டது ${o}, பெறப்பட்டது ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `தவறான உள்ளீடு: எதிர்பார்க்கப்பட்டது ${E(n.values[0])}` : `தவறான விருப்பம்: எதிர்பார்க்கப்பட்டது ${w(n.values, "|")} இல் ஒன்று`;
+        return n.values.length === 1 ? `தவறான உள்ளீடு: எதிர்பார்க்கப்பட்டது ${E(n.values[0])}` : `தவறான விருப்பம்: எதிர்பார்க்கப்பட்டது ${k(n.values, "|")} இல் ஒன்று`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `மிக பெரியது: எதிர்பார்க்கப்பட்டது ${n.origin ?? "மதிப்பு"} ${o}${n.maximum.toString()} ${a.unit ?? "உறுப்புகள்"} ஆக இருக்க வேண்டும்` : `மிக பெரியது: எதிர்பார்க்கப்பட்டது ${n.origin ?? "மதிப்பு"} ${o}${n.maximum.toString()} ஆக இருக்க வேண்டும்`;
@@ -10948,7 +10948,7 @@ const Rb = () => {
       case "not_multiple_of":
         return `தவறான எண்: ${n.divisor} இன் பலமாக இருக்க வேண்டும்`;
       case "unrecognized_keys":
-        return `அடையாளம் தெரியாத விசை${n.keys.length > 1 ? "கள்" : ""}: ${w(n.keys, ", ")}`;
+        return `அடையாளம் தெரியாத விசை${n.keys.length > 1 ? "கள்" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `${n.origin} இல் தவறான விசை`;
       case "invalid_union":
@@ -11017,7 +11017,7 @@ const Mb = () => {
         return /^[A-Z]/.test(n.expected) ? `ประเภทข้อมูลไม่ถูกต้อง: ควรเป็น instanceof ${n.expected} แต่ได้รับ ${s}` : `ประเภทข้อมูลไม่ถูกต้อง: ควรเป็น ${o} แต่ได้รับ ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `ค่าไม่ถูกต้อง: ควรเป็น ${E(n.values[0])}` : `ตัวเลือกไม่ถูกต้อง: ควรเป็นหนึ่งใน ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `ค่าไม่ถูกต้อง: ควรเป็น ${E(n.values[0])}` : `ตัวเลือกไม่ถูกต้อง: ควรเป็นหนึ่งใน ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "ไม่เกิน" : "น้อยกว่า", a = t(n.origin);
         return a ? `เกินกำหนด: ${n.origin ?? "ค่า"} ควรมี${o} ${n.maximum.toString()} ${a.unit ?? "รายการ"}` : `เกินกำหนด: ${n.origin ?? "ค่า"} ควรมี${o} ${n.maximum.toString()}`;
@@ -11033,7 +11033,7 @@ const Mb = () => {
       case "not_multiple_of":
         return `ตัวเลขไม่ถูกต้อง: ต้องเป็นจำนวนที่หารด้วย ${n.divisor} ได้ลงตัว`;
       case "unrecognized_keys":
-        return `พบคีย์ที่ไม่รู้จัก: ${w(n.keys, ", ")}`;
+        return `พบคีย์ที่ไม่รู้จัก: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `คีย์ไม่ถูกต้องใน ${n.origin}`;
       case "invalid_union":
@@ -11099,7 +11099,7 @@ const Zb = () => {
         return /^[A-Z]/.test(n.expected) ? `Geçersiz değer: beklenen instanceof ${n.expected}, alınan ${s}` : `Geçersiz değer: beklenen ${o}, alınan ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Geçersiz değer: beklenen ${E(n.values[0])}` : `Geçersiz seçenek: aşağıdakilerden biri olmalı: ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Geçersiz değer: beklenen ${E(n.values[0])}` : `Geçersiz seçenek: aşağıdakilerden biri olmalı: ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Çok büyük: beklenen ${n.origin ?? "değer"} ${o}${n.maximum.toString()} ${a.unit ?? "öğe"}` : `Çok büyük: beklenen ${n.origin ?? "değer"} ${o}${n.maximum.toString()}`;
@@ -11115,7 +11115,7 @@ const Zb = () => {
       case "not_multiple_of":
         return `Geçersiz sayı: ${n.divisor} ile tam bölünebilmeli`;
       case "unrecognized_keys":
-        return `Tanınmayan anahtar${n.keys.length > 1 ? "lar" : ""}: ${w(n.keys, ", ")}`;
+        return `Tanınmayan anahtar${n.keys.length > 1 ? "lar" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `${n.origin} içinde geçersiz anahtar`;
       case "invalid_union":
@@ -11183,7 +11183,7 @@ const Bb = () => {
         return /^[A-Z]/.test(n.expected) ? `Неправильні вхідні дані: очікується instanceof ${n.expected}, отримано ${s}` : `Неправильні вхідні дані: очікується ${o}, отримано ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Неправильні вхідні дані: очікується ${E(n.values[0])}` : `Неправильна опція: очікується одне з ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Неправильні вхідні дані: очікується ${E(n.values[0])}` : `Неправильна опція: очікується одне з ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Занадто велике: очікується, що ${n.origin ?? "значення"} ${a.verb} ${o}${n.maximum.toString()} ${a.unit ?? "елементів"}` : `Занадто велике: очікується, що ${n.origin ?? "значення"} буде ${o}${n.maximum.toString()}`;
@@ -11199,7 +11199,7 @@ const Bb = () => {
       case "not_multiple_of":
         return `Неправильне число: повинно бути кратним ${n.divisor}`;
       case "unrecognized_keys":
-        return `Нерозпізнаний ключ${n.keys.length > 1 ? "і" : ""}: ${w(n.keys, ", ")}`;
+        return `Нерозпізнаний ключ${n.keys.length > 1 ? "і" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Неправильний ключ у ${n.origin}`;
       case "invalid_union":
@@ -11271,7 +11271,7 @@ const Jb = () => {
         return /^[A-Z]/.test(n.expected) ? `غلط ان پٹ: instanceof ${n.expected} متوقع تھا، ${s} موصول ہوا` : `غلط ان پٹ: ${o} متوقع تھا، ${s} موصول ہوا`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `غلط ان پٹ: ${E(n.values[0])} متوقع تھا` : `غلط آپشن: ${w(n.values, "|")} میں سے ایک متوقع تھا`;
+        return n.values.length === 1 ? `غلط ان پٹ: ${E(n.values[0])} متوقع تھا` : `غلط آپشن: ${k(n.values, "|")} میں سے ایک متوقع تھا`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `بہت بڑا: ${n.origin ?? "ویلیو"} کے ${o}${n.maximum.toString()} ${a.unit ?? "عناصر"} ہونے متوقع تھے` : `بہت بڑا: ${n.origin ?? "ویلیو"} کا ${o}${n.maximum.toString()} ہونا متوقع تھا`;
@@ -11287,7 +11287,7 @@ const Jb = () => {
       case "not_multiple_of":
         return `غلط نمبر: ${n.divisor} کا مضاعف ہونا چاہیے`;
       case "unrecognized_keys":
-        return `غیر تسلیم شدہ کی${n.keys.length > 1 ? "ز" : ""}: ${w(n.keys, "، ")}`;
+        return `غیر تسلیم شدہ کی${n.keys.length > 1 ? "ز" : ""}: ${k(n.keys, "، ")}`;
       case "invalid_key":
         return `${n.origin} میں غلط کی`;
       case "invalid_union":
@@ -11357,7 +11357,7 @@ const Kb = () => {
         return /^[A-Z]/.test(n.expected) ? `Noto‘g‘ri kirish: kutilgan instanceof ${n.expected}, qabul qilingan ${s}` : `Noto‘g‘ri kirish: kutilgan ${o}, qabul qilingan ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Noto‘g‘ri kirish: kutilgan ${E(n.values[0])}` : `Noto‘g‘ri variant: quyidagilardan biri kutilgan ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Noto‘g‘ri kirish: kutilgan ${E(n.values[0])}` : `Noto‘g‘ri variant: quyidagilardan biri kutilgan ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Juda katta: kutilgan ${n.origin ?? "qiymat"} ${o}${n.maximum.toString()} ${a.unit} ${a.verb}` : `Juda katta: kutilgan ${n.origin ?? "qiymat"} ${o}${n.maximum.toString()}`;
@@ -11373,7 +11373,7 @@ const Kb = () => {
       case "not_multiple_of":
         return `Noto‘g‘ri raqam: ${n.divisor} ning karralisi bo‘lishi kerak`;
       case "unrecognized_keys":
-        return `Noma’lum kalit${n.keys.length > 1 ? "lar" : ""}: ${w(n.keys, ", ")}`;
+        return `Noma’lum kalit${n.keys.length > 1 ? "lar" : ""}: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `${n.origin} dagi kalit noto‘g‘ri`;
       case "invalid_union":
@@ -11441,7 +11441,7 @@ const Hb = () => {
         return /^[A-Z]/.test(n.expected) ? `Đầu vào không hợp lệ: mong đợi instanceof ${n.expected}, nhận được ${s}` : `Đầu vào không hợp lệ: mong đợi ${o}, nhận được ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Đầu vào không hợp lệ: mong đợi ${E(n.values[0])}` : `Tùy chọn không hợp lệ: mong đợi một trong các giá trị ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Đầu vào không hợp lệ: mong đợi ${E(n.values[0])}` : `Tùy chọn không hợp lệ: mong đợi một trong các giá trị ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Quá lớn: mong đợi ${n.origin ?? "giá trị"} ${a.verb} ${o}${n.maximum.toString()} ${a.unit ?? "phần tử"}` : `Quá lớn: mong đợi ${n.origin ?? "giá trị"} ${o}${n.maximum.toString()}`;
@@ -11457,7 +11457,7 @@ const Hb = () => {
       case "not_multiple_of":
         return `Số không hợp lệ: phải là bội số của ${n.divisor}`;
       case "unrecognized_keys":
-        return `Khóa không được nhận dạng: ${w(n.keys, ", ")}`;
+        return `Khóa không được nhận dạng: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Khóa không hợp lệ trong ${n.origin}`;
       case "invalid_union":
@@ -11526,7 +11526,7 @@ const Qb = () => {
         return /^[A-Z]/.test(n.expected) ? `无效输入：期望 instanceof ${n.expected}，实际接收 ${s}` : `无效输入：期望 ${o}，实际接收 ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `无效输入：期望 ${E(n.values[0])}` : `无效选项：期望以下之一 ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `无效输入：期望 ${E(n.values[0])}` : `无效选项：期望以下之一 ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `数值过大：期望 ${n.origin ?? "值"} ${o}${n.maximum.toString()} ${a.unit ?? "个元素"}` : `数值过大：期望 ${n.origin ?? "值"} ${o}${n.maximum.toString()}`;
@@ -11542,7 +11542,7 @@ const Qb = () => {
       case "not_multiple_of":
         return `无效数字：必须是 ${n.divisor} 的倍数`;
       case "unrecognized_keys":
-        return `出现未知的键(key): ${w(n.keys, ", ")}`;
+        return `出现未知的键(key): ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `${n.origin} 中的键(key)无效`;
       case "invalid_union":
@@ -11608,7 +11608,7 @@ const Xb = () => {
         return /^[A-Z]/.test(n.expected) ? `無效的輸入值：預期為 instanceof ${n.expected}，但收到 ${s}` : `無效的輸入值：預期為 ${o}，但收到 ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `無效的輸入值：預期為 ${E(n.values[0])}` : `無效的選項：預期為以下其中之一 ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `無效的輸入值：預期為 ${E(n.values[0])}` : `無效的選項：預期為以下其中之一 ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `數值過大：預期 ${n.origin ?? "值"} 應為 ${o}${n.maximum.toString()} ${a.unit ?? "個元素"}` : `數值過大：預期 ${n.origin ?? "值"} 應為 ${o}${n.maximum.toString()}`;
@@ -11624,7 +11624,7 @@ const Xb = () => {
       case "not_multiple_of":
         return `無效的數字：必須為 ${n.divisor} 的倍數`;
       case "unrecognized_keys":
-        return `無法識別的鍵值${n.keys.length > 1 ? "們" : ""}：${w(n.keys, "、")}`;
+        return `無法識別的鍵值${n.keys.length > 1 ? "們" : ""}：${k(n.keys, "、")}`;
       case "invalid_key":
         return `${n.origin} 中有無效的鍵值`;
       case "invalid_union":
@@ -11692,7 +11692,7 @@ const t0 = () => {
         return /^[A-Z]/.test(n.expected) ? `Ìbáwọlé aṣìṣe: a ní láti fi instanceof ${n.expected}, àmọ̀ a rí ${s}` : `Ìbáwọlé aṣìṣe: a ní láti fi ${o}, àmọ̀ a rí ${s}`;
       }
       case "invalid_value":
-        return n.values.length === 1 ? `Ìbáwọlé aṣìṣe: a ní láti fi ${E(n.values[0])}` : `Àṣàyàn aṣìṣe: yan ọ̀kan lára ${w(n.values, "|")}`;
+        return n.values.length === 1 ? `Ìbáwọlé aṣìṣe: a ní láti fi ${E(n.values[0])}` : `Àṣàyàn aṣìṣe: yan ọ̀kan lára ${k(n.values, "|")}`;
       case "too_big": {
         const o = n.inclusive ? "<=" : "<", a = t(n.origin);
         return a ? `Tó pọ̀ jù: a ní láti jẹ́ pé ${n.origin ?? "iye"} ${a.verb} ${o}${n.maximum} ${a.unit}` : `Tó pọ̀ jù: a ní láti jẹ́ ${o}${n.maximum}`;
@@ -11708,7 +11708,7 @@ const t0 = () => {
       case "not_multiple_of":
         return `Nọ́mbà aṣìṣe: gbọ́dọ̀ jẹ́ èyà pípín ti ${n.divisor}`;
       case "unrecognized_keys":
-        return `Bọtìnì àìmọ̀: ${w(n.keys, ", ")}`;
+        return `Bọtìnì àìmọ̀: ${k(n.keys, ", ")}`;
       case "invalid_key":
         return `Bọtìnì aṣìṣe nínú ${n.origin}`;
       case "invalid_union":
@@ -12774,18 +12774,18 @@ function Tf(e, t) {
     type: "pipe",
     in: l,
     out: d,
-    transform: ((m, v) => {
+    transform: ((m, g) => {
       let y = m;
-      return r.case !== "sensitive" && (y = y.toLowerCase()), o.has(y) ? !0 : a.has(y) ? !1 : (v.issues.push({
+      return r.case !== "sensitive" && (y = y.toLowerCase()), o.has(y) ? !0 : a.has(y) ? !1 : (g.issues.push({
         code: "invalid_value",
         expected: "stringbool",
         values: [...o, ...a],
-        input: v.value,
+        input: g.value,
         inst: f,
         continue: !1
       }), {});
     }),
-    reverseTransform: ((m, v) => m === !0 ? i[0] || "true" : n[0] || "false"),
+    reverseTransform: ((m, g) => m === !0 ? i[0] || "true" : n[0] || "false"),
     error: r.error
   });
   return f;
@@ -12866,7 +12866,7 @@ function Ot(e, t) {
   const n = (a) => {
     const s = e.target === "draft-2020-12" ? "$defs" : "definitions";
     if (e.external) {
-      const d = e.external.registry.get(a[0])?.id, f = e.external.uri ?? ((v) => v);
+      const d = e.external.registry.get(a[0])?.id, f = e.external.uri ?? ((g) => g);
       if (d)
         return { ref: f(d) };
       const m = a[1].defId ?? a[1].schema.id ?? `schema${e.counter++}`;
@@ -12932,11 +12932,11 @@ function xt(e, t) {
     const u = c.def ?? c.schema, l = { ...u }, d = c.ref;
     if (c.ref = null, d) {
       i(d);
-      const m = e.seen.get(d), v = m.schema;
-      if (v.$ref && (e.target === "draft-07" || e.target === "draft-04" || e.target === "openapi-3.0") ? (u.allOf = u.allOf ?? [], u.allOf.push(v)) : Object.assign(u, v), Object.assign(u, l), s._zod.parent === d)
+      const m = e.seen.get(d), g = m.schema;
+      if (g.$ref && (e.target === "draft-07" || e.target === "draft-04" || e.target === "openapi-3.0") ? (u.allOf = u.allOf ?? [], u.allOf.push(g)) : Object.assign(u, g), Object.assign(u, l), s._zod.parent === d)
         for (const b in u)
           b === "$ref" || b === "allOf" || b in l || delete u[b];
-      if (v.$ref && m.def)
+      if (g.$ref && m.def)
         for (const b in u)
           b === "$ref" || b === "allOf" || b in m.def && JSON.stringify(u[b]) === JSON.stringify(m.def[b]) && delete u[b];
     }
@@ -12945,8 +12945,8 @@ function xt(e, t) {
       i(f);
       const m = e.seen.get(f);
       if (m?.schema.$ref && (u.$ref = m.schema.$ref, m.def))
-        for (const v in u)
-          v === "$ref" || v === "allOf" || v in m.def && JSON.stringify(u[v]) === JSON.stringify(m.def[v]) && delete u[v];
+        for (const g in u)
+          g === "$ref" || g === "allOf" || g in m.def && JSON.stringify(u[g]) === JSON.stringify(m.def[g]) && delete u[g];
     }
     e.override({
       zodSchema: s,
@@ -15169,8 +15169,8 @@ function Gp(e, t) {
       if (e.patternProperties) {
         const c = e.patternProperties, u = Object.keys(c), l = [];
         for (const f of u) {
-          const m = ie(c[f], t), v = z.string().regex(new RegExp(f));
-          l.push(z.looseRecord(v, m));
+          const m = ie(c[f], t), g = z.string().regex(new RegExp(f));
+          l.push(z.looseRecord(g, m));
         }
         const d = [];
         if (Object.keys(n).length > 0 && d.push(z.object(n).passthrough()), d.push(...l), d.length === 0)
@@ -15700,7 +15700,7 @@ var yt = 9e15, et = 1e9, Ri = "0123456789abcdef", ir = "2.3025850929940456840179
   // Whether to use cryptographically-secure random number generation, if available.
   crypto: !1
   // true/false
-}, Yp, Ze, T = !0, ii = "[DecimalError] ", Ye = ii + "Invalid argument: ", Xp = ii + "Precision limit exceeded", eh = ii + "crypto unavailable", th = "[object Decimal]", se = Math.floor, Q = Math.pow, o$ = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, a$ = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, s$ = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, nh = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, xe = 1e7, N = 7, c$ = 9007199254740991, u$ = ir.length - 1, Mi = or.length - 1, $ = { toStringTag: th };
+}, Yp, Ze, j = !0, ii = "[DecimalError] ", Ye = ii + "Invalid argument: ", Xp = ii + "Precision limit exceeded", eh = ii + "crypto unavailable", th = "[object Decimal]", se = Math.floor, Q = Math.pow, o$ = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, a$ = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, s$ = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, nh = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, xe = 1e7, N = 7, c$ = 9007199254740991, u$ = ir.length - 1, Mi = or.length - 1, $ = { toStringTag: th };
 $.absoluteValue = $.abs = function() {
   var e = new this.constructor(this);
   return e.s < 0 && (e.s = 1), x(e);
@@ -15732,7 +15732,7 @@ $.cosine = $.cos = function() {
 $.cubeRoot = $.cbrt = function() {
   var e, t, r, i, n, o, a, s, c, u, l = this, d = l.constructor;
   if (!l.isFinite() || l.isZero()) return new d(l);
-  for (T = !1, o = l.s * Q(l.s * l, 1 / 3), !o || Math.abs(o) == 1 / 0 ? (r = te(l.d), e = l.e, (o = (e - r.length + 1) % 3) && (r += o == 1 || o == -2 ? "0" : "00"), o = Q(r, 1 / 3), e = se((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), o == 1 / 0 ? r = "5e" + e : (r = o.toExponential(), r = r.slice(0, r.indexOf("e") + 1) + e), i = new d(r), i.s = l.s) : i = new d(o.toString()), a = (e = d.precision) + 3; ; )
+  for (j = !1, o = l.s * Q(l.s * l, 1 / 3), !o || Math.abs(o) == 1 / 0 ? (r = te(l.d), e = l.e, (o = (e - r.length + 1) % 3) && (r += o == 1 || o == -2 ? "0" : "00"), o = Q(r, 1 / 3), e = se((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), o == 1 / 0 ? r = "5e" + e : (r = o.toExponential(), r = r.slice(0, r.indexOf("e") + 1) + e), i = new d(r), i.s = l.s) : i = new d(o.toString()), a = (e = d.precision) + 3; ; )
     if (s = i, c = s.times(s).times(s), u = c.plus(l), i = B(u.plus(l).times(s), u.plus(c), a + 2, 1), te(s.d).slice(0, a) === (r = te(i.d)).slice(0, a))
       if (r = r.slice(a - 3, a + 1), r == "9999" || !n && r == "4999") {
         if (!n && (x(s, e + 1, 0), s.times(s).times(s).eq(l))) {
@@ -15744,7 +15744,7 @@ $.cubeRoot = $.cbrt = function() {
         (!+r || !+r.slice(1) && r.charAt(0) == "5") && (x(i, e + 1, 1), t = !i.times(i).times(i).eq(l));
         break;
       }
-  return T = !0, x(i, e, d.rounding, t);
+  return j = !0, x(i, e, d.rounding, t);
 };
 $.decimalPlaces = $.dp = function() {
   var e, t = this.d, r = NaN;
@@ -15805,11 +15805,11 @@ $.inverseCosine = $.acos = function() {
 };
 $.inverseHyperbolicCosine = $.acosh = function() {
   var e, t, r = this, i = r.constructor;
-  return r.lte(1) ? new i(r.eq(1) ? 0 : NaN) : r.isFinite() ? (e = i.precision, t = i.rounding, i.precision = e + Math.max(Math.abs(r.e), r.sd()) + 4, i.rounding = 1, T = !1, r = r.times(r).minus(1).sqrt().plus(r), T = !0, i.precision = e, i.rounding = t, r.ln()) : new i(r);
+  return r.lte(1) ? new i(r.eq(1) ? 0 : NaN) : r.isFinite() ? (e = i.precision, t = i.rounding, i.precision = e + Math.max(Math.abs(r.e), r.sd()) + 4, i.rounding = 1, j = !1, r = r.times(r).minus(1).sqrt().plus(r), j = !0, i.precision = e, i.rounding = t, r.ln()) : new i(r);
 };
 $.inverseHyperbolicSine = $.asinh = function() {
   var e, t, r = this, i = r.constructor;
-  return !r.isFinite() || r.isZero() ? new i(r) : (e = i.precision, t = i.rounding, i.precision = e + 2 * Math.max(Math.abs(r.e), r.sd()) + 6, i.rounding = 1, T = !1, r = r.times(r).plus(1).sqrt().plus(r), T = !0, i.precision = e, i.rounding = t, r.ln());
+  return !r.isFinite() || r.isZero() ? new i(r) : (e = i.precision, t = i.rounding, i.precision = e + 2 * Math.max(Math.abs(r.e), r.sd()) + 6, i.rounding = 1, j = !1, r = r.times(r).plus(1).sqrt().plus(r), j = !0, i.precision = e, i.rounding = t, r.ln());
 };
 $.inverseHyperbolicTangent = $.atanh = function() {
   var e, t, r, i, n = this, o = n.constructor;
@@ -15832,9 +15832,9 @@ $.inverseTangent = $.atan = function() {
       return a = Te(l, d + 4, f).times(0.5), a.s = u.s, a;
   }
   for (l.precision = s = d + 10, l.rounding = 1, r = Math.min(28, s / N + 2 | 0), e = r; e; --e) u = u.div(u.times(u).plus(1).sqrt().plus(1));
-  for (T = !1, t = Math.ceil(s / N), i = 1, c = u.times(u), a = new l(u), n = u; e !== -1; )
+  for (j = !1, t = Math.ceil(s / N), i = 1, c = u.times(u), a = new l(u), n = u; e !== -1; )
     if (n = n.times(c), o = a.minus(n.div(i += 2)), n = n.times(c), a = o.plus(n.div(i += 2)), a.d[t] !== void 0) for (e = t; a.d[e] === o.d[e] && e--; ) ;
-  return r && (a = a.times(2 << r - 1)), T = !0, x(a, l.precision = d, l.rounding = f, !0);
+  return r && (a = a.times(2 << r - 1)), j = !0, x(a, l.precision = d, l.rounding = f, !0);
 };
 $.isFinite = function() {
   return !!this.d;
@@ -15877,26 +15877,26 @@ $.logarithm = $.log = function(e) {
       for (n = r[0]; n % 10 === 0; ) n /= 10;
       o = n !== 1;
     }
-  if (T = !1, s = d + m, a = Ke(u, s), i = t ? ar(l, s + 10) : Ke(e, s), c = B(a, i, s, 1), Qt(c.d, n = d, f))
+  if (j = !1, s = d + m, a = Ke(u, s), i = t ? ar(l, s + 10) : Ke(e, s), c = B(a, i, s, 1), Qt(c.d, n = d, f))
     do
       if (s += 10, a = Ke(u, s), i = t ? ar(l, s + 10) : Ke(e, s), c = B(a, i, s, 1), !o) {
         +te(c.d).slice(n + 1, n + 15) + 1 == 1e14 && (c = x(c, d + 1, 0));
         break;
       }
     while (Qt(c.d, n += 10, f));
-  return T = !0, x(c, d, f);
+  return j = !0, x(c, d, f);
 };
 $.minus = $.sub = function(e) {
-  var t, r, i, n, o, a, s, c, u, l, d, f, m = this, v = m.constructor;
-  if (e = new v(e), !m.d || !e.d)
-    return !m.s || !e.s ? e = new v(NaN) : m.d ? e.s = -e.s : e = new v(e.d || m.s !== e.s ? m : NaN), e;
+  var t, r, i, n, o, a, s, c, u, l, d, f, m = this, g = m.constructor;
+  if (e = new g(e), !m.d || !e.d)
+    return !m.s || !e.s ? e = new g(NaN) : m.d ? e.s = -e.s : e = new g(e.d || m.s !== e.s ? m : NaN), e;
   if (m.s != e.s)
     return e.s = -e.s, m.plus(e);
-  if (u = m.d, f = e.d, s = v.precision, c = v.rounding, !u[0] || !f[0]) {
+  if (u = m.d, f = e.d, s = g.precision, c = g.rounding, !u[0] || !f[0]) {
     if (f[0]) e.s = -e.s;
-    else if (u[0]) e = new v(m);
-    else return new v(c === 3 ? -0 : 0);
-    return T ? x(e, s, c) : e;
+    else if (u[0]) e = new g(m);
+    else return new g(c === 3 ? -0 : 0);
+    return j ? x(e, s, c) : e;
   }
   if (r = se(e.e / N), l = se(m.e / N), u = u.slice(), o = l - r, o) {
     for (d = o < 0, d ? (t = u, o = -o, a = f.length) : (t = f, r = l, a = u.length), i = Math.max(Math.ceil(s / N), a) + 2, o > i && (o = i, t.length = 1), t.reverse(), i = o; i--; ) t.push(0);
@@ -15919,11 +15919,11 @@ $.minus = $.sub = function(e) {
   }
   for (; u[--a] === 0; ) u.pop();
   for (; u[0] === 0; u.shift()) --r;
-  return u[0] ? (e.d = u, e.e = oi(u, r), T ? x(e, s, c) : e) : new v(c === 3 ? -0 : 0);
+  return u[0] ? (e.d = u, e.e = oi(u, r), j ? x(e, s, c) : e) : new g(c === 3 ? -0 : 0);
 };
 $.modulo = $.mod = function(e) {
   var t, r = this, i = r.constructor;
-  return e = new i(e), !r.d || !e.s || e.d && !e.d[0] ? new i(NaN) : !e.d || r.d && !r.d[0] ? x(new i(r), i.precision, i.rounding) : (T = !1, i.modulo == 9 ? (t = B(r, e.abs(), 0, 3, 1), t.s *= e.s) : t = B(r, e, 0, i.modulo, 1), t = t.times(e), T = !0, r.minus(t));
+  return e = new i(e), !r.d || !e.s || e.d && !e.d[0] ? new i(NaN) : !e.d || r.d && !r.d[0] ? x(new i(r), i.precision, i.rounding) : (j = !1, i.modulo == 9 ? (t = B(r, e.abs(), 0, 3, 1), t.s *= e.s) : t = B(r, e, 0, i.modulo, 1), t = t.times(e), j = !0, r.minus(t));
 };
 $.naturalExponential = $.exp = function() {
   return Li(this);
@@ -15942,7 +15942,7 @@ $.plus = $.add = function(e) {
   if (d.s != e.s)
     return e.s = -e.s, d.minus(e);
   if (u = d.d, l = e.d, s = f.precision, c = f.rounding, !u[0] || !l[0])
-    return l[0] || (e = new f(d)), T ? x(e, s, c) : e;
+    return l[0] || (e = new f(d)), j ? x(e, s, c) : e;
   if (o = se(d.e / N), i = se(e.e / N), u = u.slice(), n = o - i, n) {
     for (n < 0 ? (r = u, n = -n, a = l.length) : (r = l, i = o, a = u.length), o = Math.ceil(s / N), a = o > a ? o + 1 : a + 1, n > a && (n = a, r.length = 1), r.reverse(); n--; ) r.push(0);
     r.reverse();
@@ -15950,7 +15950,7 @@ $.plus = $.add = function(e) {
   for (a = u.length, n = l.length, a - n < 0 && (n = a, r = l, l = u, u = r), t = 0; n; )
     t = (u[--n] = u[n] + l[n] + t) / xe | 0, u[n] %= xe;
   for (t && (u.unshift(t), ++i), a = u.length; u[--a] == 0; ) u.pop();
-  return e.d = u, e.e = oi(u, i), T ? x(e, s, c) : e;
+  return e.d = u, e.e = oi(u, i), j ? x(e, s, c) : e;
 };
 $.precision = $.sd = function(e) {
   var t, r = this;
@@ -15969,7 +15969,7 @@ $.squareRoot = $.sqrt = function() {
   var e, t, r, i, n, o, a = this, s = a.d, c = a.e, u = a.s, l = a.constructor;
   if (u !== 1 || !s || !s[0])
     return new l(!u || u < 0 && (!s || s[0]) ? NaN : s ? a : 1 / 0);
-  for (T = !1, u = Math.sqrt(+a), u == 0 || u == 1 / 0 ? (t = te(s), (t.length + c) % 2 == 0 && (t += "0"), u = Math.sqrt(t), c = se((c + 1) / 2) - (c < 0 || c % 2), u == 1 / 0 ? t = "5e" + c : (t = u.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + c), i = new l(t)) : i = new l(u.toString()), r = (c = l.precision) + 3; ; )
+  for (j = !1, u = Math.sqrt(+a), u == 0 || u == 1 / 0 ? (t = te(s), (t.length + c) % 2 == 0 && (t += "0"), u = Math.sqrt(t), c = se((c + 1) / 2) - (c < 0 || c % 2), u == 1 / 0 ? t = "5e" + c : (t = u.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + c), i = new l(t)) : i = new l(u.toString()), r = (c = l.precision) + 3; ; )
     if (o = i, i = o.plus(B(a, o, r + 2, 1)).times(0.5), te(o.d).slice(0, r) === (t = te(i.d)).slice(0, r))
       if (t = t.slice(r - 3, r + 1), t == "9999" || !n && t == "4999") {
         if (!n && (x(o, c + 1, 0), o.times(o).eq(a))) {
@@ -15981,7 +15981,7 @@ $.squareRoot = $.sqrt = function() {
         (!+t || !+t.slice(1) && t.charAt(0) == "5") && (x(i, c + 1, 1), e = !i.times(i).eq(a));
         break;
       }
-  return T = !0, x(i, c, l.rounding, e);
+  return j = !0, x(i, c, l.rounding, e);
 };
 $.tangent = $.tan = function() {
   var e, t, r = this, i = r.constructor;
@@ -15998,7 +15998,7 @@ $.times = $.mul = function(e) {
     o[n] = (o[n] + t) % xe | 0;
   }
   for (; !o[--a]; ) o.pop();
-  return t ? ++r : o.shift(), e.d = o, e.e = oi(o, r), T ? x(e, d.precision, d.rounding) : e;
+  return t ? ++r : o.shift(), e.d = o, e.e = oi(o, r), j ? x(e, d.precision, d.rounding) : e;
 };
 $.toBinary = function(e, t) {
   return ns(this, 2, e, t);
@@ -16016,17 +16016,17 @@ $.toFixed = function(e, t) {
   return e === void 0 ? r = Pe(n) : (pe(e, 0, et), t === void 0 ? t = o.rounding : pe(t, 0, 8), i = x(new o(n), e + n.e + 1, t), r = Pe(i, !1, e + i.e + 1)), n.isNeg() && !n.isZero() ? "-" + r : r;
 };
 $.toFraction = function(e) {
-  var t, r, i, n, o, a, s, c, u, l, d, f, m = this, v = m.d, y = m.constructor;
-  if (!v) return new y(m);
-  if (u = r = new y(1), i = c = new y(0), t = new y(i), o = t.e = rh(v) - m.e - 1, a = o % N, t.d[0] = Q(10, a < 0 ? N + a : a), e == null)
+  var t, r, i, n, o, a, s, c, u, l, d, f, m = this, g = m.d, y = m.constructor;
+  if (!g) return new y(m);
+  if (u = r = new y(1), i = c = new y(0), t = new y(i), o = t.e = rh(g) - m.e - 1, a = o % N, t.d[0] = Q(10, a < 0 ? N + a : a), e == null)
     e = o > 0 ? t : u;
   else {
     if (s = new y(e), !s.isInt() || s.lt(u)) throw Error(Ye + s);
     e = s.gt(t) ? o > 0 ? t : u : s;
   }
-  for (T = !1, s = new y(te(v)), l = y.precision, y.precision = o = v.length * N * 2; d = B(s, t, 0, 1, 1), n = r.plus(d.times(i)), n.cmp(e) != 1; )
+  for (j = !1, s = new y(te(g)), l = y.precision, y.precision = o = g.length * N * 2; d = B(s, t, 0, 1, 1), n = r.plus(d.times(i)), n.cmp(e) != 1; )
     r = i, i = n, n = u, u = c.plus(d.times(n)), c = n, n = t, t = s.minus(d.times(n)), s = n;
-  return n = B(e.minus(r), i, 0, 1, 1), c = c.plus(n.times(u)), r = r.plus(n.times(i)), c.s = u.s = m.s, f = B(u, i, o, 1).minus(m).abs().cmp(B(c, r, o, 1).minus(m).abs()) < 1 ? [u, i] : [c, r], y.precision = l, T = !0, f;
+  return n = B(e.minus(r), i, 0, 1, 1), c = c.plus(n.times(u)), r = r.plus(n.times(i)), c.s = u.s = m.s, f = B(u, i, o, 1).minus(m).abs().cmp(B(c, r, o, 1).minus(m).abs()) < 1 ? [u, i] : [c, r], y.precision = l, j = !0, f;
 };
 $.toHexadecimal = $.toHex = function(e, t) {
   return ns(this, 16, e, t);
@@ -16041,7 +16041,7 @@ $.toNearest = function(e, t) {
     if (!e.d)
       return e.s && (e.s = r.s), e;
   }
-  return e.d[0] ? (T = !1, r = B(r, e, 0, t, 1).times(e), T = !0, x(r)) : (e.s = r.s, r = e), r;
+  return e.d[0] ? (j = !1, r = B(r, e, 0, t, 1).times(e), j = !0, x(r)) : (e.s = r.s, r = e), r;
 };
 $.toNumber = function() {
   return +this;
@@ -16061,7 +16061,7 @@ $.toPower = $.pow = function(e) {
     if ((e.d[t] & 1) == 0 && (a = 1), s.e == 0 && s.d[0] == 1 && s.d.length == 1)
       return s.s = a, s;
   }
-  return r = Q(+s, u), t = r == 0 || !isFinite(r) ? se(u * (Math.log("0." + te(s.d)) / Math.LN10 + s.e + 1)) : new c(r + "").e, t > c.maxE + 1 || t < c.minE - 1 ? new c(t > 0 ? a / 0 : 0) : (T = !1, c.rounding = s.s = 1, r = Math.min(12, (t + "").length), n = Li(e.times(Ke(s, i + r)), i), n.d && (n = x(n, i + 5, 1), Qt(n.d, i, o) && (t = i + 10, n = x(Li(e.times(Ke(s, t + r)), t), t + 5, 1), +te(n.d).slice(i + 1, i + 15) + 1 == 1e14 && (n = x(n, i + 1, 0)))), n.s = a, T = !0, c.rounding = o, x(n, i, o));
+  return r = Q(+s, u), t = r == 0 || !isFinite(r) ? se(u * (Math.log("0." + te(s.d)) / Math.LN10 + s.e + 1)) : new c(r + "").e, t > c.maxE + 1 || t < c.minE - 1 ? new c(t > 0 ? a / 0 : 0) : (j = !1, c.rounding = s.s = 1, r = Math.min(12, (t + "").length), n = Li(e.times(Ke(s, i + r)), i), n.d && (n = x(n, i + 5, 1), Qt(n.d, i, o) && (t = i + 10, n = x(Li(e.times(Ke(s, t + r)), t), t + 5, 1), +te(n.d).slice(i + 1, i + 15) + 1 == 1e14 && (n = x(n, i + 1, 0)))), n.s = a, j = !0, c.rounding = o, x(n, i, o));
 };
 $.toPrecision = function(e, t) {
   var r, i = this, n = i.constructor;
@@ -16145,7 +16145,7 @@ var B = /* @__PURE__ */ (function() {
     for (; !i[0] && i.length > 1; ) i.shift();
   }
   return function(i, n, o, a, s, c) {
-    var u, l, d, f, m, v, y, b, g, S, k, I, j, C, ce, Ne, Re, _e, H, Ce, tt = i.constructor, de = i.s == n.s ? 1 : -1, W = i.d, L = n.d;
+    var u, l, d, f, m, g, y, b, v, S, w, I, T, C, ce, Ne, Re, _e, H, Ce, tt = i.constructor, de = i.s == n.s ? 1 : -1, W = i.d, L = n.d;
     if (!W || !W[0] || !L || !L[0])
       return new tt(
         // Return NaN if either NaN, or both Infinity or 0.
@@ -16154,31 +16154,31 @@ var B = /* @__PURE__ */ (function() {
           W && W[0] == 0 || !L ? de * 0 : de / 0
         )
       );
-    for (c ? (m = 1, l = i.e - n.e) : (c = xe, m = N, l = se(i.e / m) - se(n.e / m)), H = L.length, Re = W.length, g = new tt(de), S = g.d = [], d = 0; L[d] == (W[d] || 0); d++) ;
+    for (c ? (m = 1, l = i.e - n.e) : (c = xe, m = N, l = se(i.e / m) - se(n.e / m)), H = L.length, Re = W.length, v = new tt(de), S = v.d = [], d = 0; L[d] == (W[d] || 0); d++) ;
     if (L[d] > (W[d] || 0) && l--, o == null ? (C = o = tt.precision, a = tt.rounding) : s ? C = o + (i.e - n.e) + 1 : C = o, C < 0)
-      S.push(1), v = !0;
+      S.push(1), g = !0;
     else {
       if (C = C / m + 2 | 0, d = 0, H == 1) {
         for (f = 0, L = L[0], C++; (d < Re || f) && C--; d++)
           ce = f * c + (W[d] || 0), S[d] = ce / L | 0, f = ce % L | 0;
-        v = f || d < Re;
+        g = f || d < Re;
       } else {
-        for (f = c / (L[0] + 1) | 0, f > 1 && (L = e(L, f, c), W = e(W, f, c), H = L.length, Re = W.length), Ne = H, k = W.slice(0, H), I = k.length; I < H; ) k[I++] = 0;
+        for (f = c / (L[0] + 1) | 0, f > 1 && (L = e(L, f, c), W = e(W, f, c), H = L.length, Re = W.length), Ne = H, w = W.slice(0, H), I = w.length; I < H; ) w[I++] = 0;
         Ce = L.slice(), Ce.unshift(0), _e = L[0], L[1] >= c / 2 && ++_e;
         do
-          f = 0, u = t(L, k, H, I), u < 0 ? (j = k[0], H != I && (j = j * c + (k[1] || 0)), f = j / _e | 0, f > 1 ? (f >= c && (f = c - 1), y = e(L, f, c), b = y.length, I = k.length, u = t(y, k, b, I), u == 1 && (f--, r(y, H < b ? Ce : L, b, c))) : (f == 0 && (u = f = 1), y = L.slice()), b = y.length, b < I && y.unshift(0), r(k, y, I, c), u == -1 && (I = k.length, u = t(L, k, H, I), u < 1 && (f++, r(k, H < I ? Ce : L, I, c))), I = k.length) : u === 0 && (f++, k = [0]), S[d++] = f, u && k[0] ? k[I++] = W[Ne] || 0 : (k = [W[Ne]], I = 1);
-        while ((Ne++ < Re || k[0] !== void 0) && C--);
-        v = k[0] !== void 0;
+          f = 0, u = t(L, w, H, I), u < 0 ? (T = w[0], H != I && (T = T * c + (w[1] || 0)), f = T / _e | 0, f > 1 ? (f >= c && (f = c - 1), y = e(L, f, c), b = y.length, I = w.length, u = t(y, w, b, I), u == 1 && (f--, r(y, H < b ? Ce : L, b, c))) : (f == 0 && (u = f = 1), y = L.slice()), b = y.length, b < I && y.unshift(0), r(w, y, I, c), u == -1 && (I = w.length, u = t(L, w, H, I), u < 1 && (f++, r(w, H < I ? Ce : L, I, c))), I = w.length) : u === 0 && (f++, w = [0]), S[d++] = f, u && w[0] ? w[I++] = W[Ne] || 0 : (w = [W[Ne]], I = 1);
+        while ((Ne++ < Re || w[0] !== void 0) && C--);
+        g = w[0] !== void 0;
       }
       S[0] || S.shift();
     }
     if (m == 1)
-      g.e = l, Yp = v;
+      v.e = l, Yp = g;
     else {
       for (d = 1, f = S[0]; f >= 10; f /= 10) d++;
-      g.e = d + l * m - 1, x(g, s ? o + g.e + 1 : o, a, v);
+      v.e = d + l * m - 1, x(v, s ? o + v.e + 1 : o, a, g);
     }
-    return g;
+    return v;
   };
 })();
 function x(e, t, r, i) {
@@ -16214,7 +16214,7 @@ function x(e, t, r, i) {
         }
     for (o = d.length; d[--o] === 0; ) d.pop();
   }
-  return T && (e.e > m.maxE ? (e.d = null, e.e = NaN) : e.e < m.minE && (e.e = 0, e.d = [0])), e;
+  return j && (e.e > m.maxE ? (e.d = null, e.e = NaN) : e.e < m.minE && (e.e = 0, e.d = [0])), e;
 }
 function Pe(e, t, r) {
   if (!e.isFinite()) return ah(e);
@@ -16228,7 +16228,7 @@ function oi(e, t) {
 }
 function ar(e, t, r) {
   if (t > u$)
-    throw T = !0, r && (e.precision = r), Error(Xp);
+    throw j = !0, r && (e.precision = r), Error(Xp);
   return x(new e(ir), t, 1, !0);
 }
 function Te(e, t, r) {
@@ -16249,14 +16249,14 @@ function Ve(e) {
 }
 function ih(e, t, r, i) {
   var n, o = new e(1), a = Math.ceil(i / N + 4);
-  for (T = !1; ; ) {
+  for (j = !1; ; ) {
     if (r % 2 && (o = o.times(t), ic(o.d, a) && (n = !0)), r = se(r / 2), r === 0) {
       r = o.d.length - 1, n && o.d[r] === 0 && ++o.d[r];
       break;
     }
     t = t.times(t), ic(t.d, a);
   }
-  return T = !0, o;
+  return j = !0, o;
 }
 function rc(e) {
   return e.d[e.d.length - 1] & 1;
@@ -16272,10 +16272,10 @@ function oh(e, t, r) {
   return o;
 }
 function Li(e, t) {
-  var r, i, n, o, a, s, c, u = 0, l = 0, d = 0, f = e.constructor, m = f.rounding, v = f.precision;
+  var r, i, n, o, a, s, c, u = 0, l = 0, d = 0, f = e.constructor, m = f.rounding, g = f.precision;
   if (!e.d || !e.d[0] || e.e > 17)
     return new f(e.d ? e.d[0] ? e.s < 0 ? 0 : 1 / 0 : 1 : e.s ? e.s < 0 ? 0 : e : NaN);
-  for (t == null ? (T = !1, c = v) : c = t, s = new f(0.03125); e.e > -2; )
+  for (t == null ? (j = !1, c = g) : c = t, s = new f(0.03125); e.e > -2; )
     e = e.times(s), d += 5;
   for (i = Math.log(Q(2, d)) / Math.LN10 * 2 + 5 | 0, c += i, r = o = a = new f(1), f.precision = c; ; ) {
     if (o = x(o.times(e), c, 1), r = r.times(++l), s = a.plus(B(o, r, c, 1)), te(s.d).slice(0, c) === te(a.d).slice(0, c)) {
@@ -16284,32 +16284,32 @@ function Li(e, t) {
         if (u < 3 && Qt(a.d, c - i, m, u))
           f.precision = c += 10, r = o = s = new f(1), l = 0, u++;
         else
-          return x(a, f.precision = v, m, T = !0);
+          return x(a, f.precision = g, m, j = !0);
       else
-        return f.precision = v, a;
+        return f.precision = g, a;
     }
     a = s;
   }
 }
 function Ke(e, t) {
-  var r, i, n, o, a, s, c, u, l, d, f, m = 1, v = 10, y = e, b = y.d, g = y.constructor, S = g.rounding, k = g.precision;
+  var r, i, n, o, a, s, c, u, l, d, f, m = 1, g = 10, y = e, b = y.d, v = y.constructor, S = v.rounding, w = v.precision;
   if (y.s < 0 || !b || !b[0] || !y.e && b[0] == 1 && b.length == 1)
-    return new g(b && !b[0] ? -1 / 0 : y.s != 1 ? NaN : b ? 0 : y);
-  if (t == null ? (T = !1, l = k) : l = t, g.precision = l += v, r = te(b), i = r.charAt(0), Math.abs(o = y.e) < 15e14) {
+    return new v(b && !b[0] ? -1 / 0 : y.s != 1 ? NaN : b ? 0 : y);
+  if (t == null ? (j = !1, l = w) : l = t, v.precision = l += g, r = te(b), i = r.charAt(0), Math.abs(o = y.e) < 15e14) {
     for (; i < 7 && i != 1 || i == 1 && r.charAt(1) > 3; )
       y = y.times(e), r = te(y.d), i = r.charAt(0), m++;
-    o = y.e, i > 1 ? (y = new g("0." + r), o++) : y = new g(i + "." + r.slice(1));
+    o = y.e, i > 1 ? (y = new v("0." + r), o++) : y = new v(i + "." + r.slice(1));
   } else
-    return u = ar(g, l + 2, k).times(o + ""), y = Ke(new g(i + "." + r.slice(1)), l - v).plus(u), g.precision = k, t == null ? x(y, k, S, T = !0) : y;
+    return u = ar(v, l + 2, w).times(o + ""), y = Ke(new v(i + "." + r.slice(1)), l - g).plus(u), v.precision = w, t == null ? x(y, w, S, j = !0) : y;
   for (d = y, c = a = y = B(y.minus(1), y.plus(1), l, 1), f = x(y.times(y), l, 1), n = 3; ; ) {
-    if (a = x(a.times(f), l, 1), u = c.plus(B(a, new g(n), l, 1)), te(u.d).slice(0, l) === te(c.d).slice(0, l))
-      if (c = c.times(2), o !== 0 && (c = c.plus(ar(g, l + 2, k).times(o + ""))), c = B(c, new g(m), l, 1), t == null)
-        if (Qt(c.d, l - v, S, s))
-          g.precision = l += v, u = a = y = B(d.minus(1), d.plus(1), l, 1), f = x(y.times(y), l, 1), n = s = 1;
+    if (a = x(a.times(f), l, 1), u = c.plus(B(a, new v(n), l, 1)), te(u.d).slice(0, l) === te(c.d).slice(0, l))
+      if (c = c.times(2), o !== 0 && (c = c.plus(ar(v, l + 2, w).times(o + ""))), c = B(c, new v(m), l, 1), t == null)
+        if (Qt(c.d, l - g, S, s))
+          v.precision = l += g, u = a = y = B(d.minus(1), d.plus(1), l, 1), f = x(y.times(y), l, 1), n = s = 1;
         else
-          return x(c, g.precision = k, S, T = !0);
+          return x(c, v.precision = w, S, j = !0);
       else
-        return g.precision = k, c;
+        return v.precision = w, c;
     c = u, n += 2;
   }
 }
@@ -16327,7 +16327,7 @@ function Kn(e, t) {
     } else
       i -= n;
     for (; i--; ) t += "0";
-    e.d.push(+t), T && (e.e > e.constructor.maxE ? (e.d = null, e.e = NaN) : e.e < e.constructor.minE && (e.e = 0, e.d = [0]));
+    e.d.push(+t), j && (e.e > e.constructor.maxE ? (e.d = null, e.e = NaN) : e.e < e.constructor.minE && (e.e = 0, e.d = [0]));
   } else
     e.e = 0, e.d = [0];
   return e;
@@ -16347,7 +16347,7 @@ function d$(e, t) {
   else
     throw Error(Ye + t);
   for (o = t.search(/p/i), o > 0 ? (c = +t.slice(o + 1), t = t.substring(2, o)) : t = t.slice(2), o = t.indexOf("."), a = o >= 0, i = e.constructor, a && (t = t.replace(".", ""), s = t.length, o = s - o, n = ih(i, new i(r), o, o * 2)), u = Vn(t, r, xe), l = u.length - 1, o = l; u[o] === 0; --o) u.pop();
-  return o < 0 ? new i(e.s * 0) : (e.e = oi(u, l), e.d = u, T = !1, a && (e = B(e, n, s * 4)), c && (e = e.times(Math.abs(c) < 54 ? Q(2, c) : si.pow(2, c))), T = !0, e);
+  return o < 0 ? new i(e.s * 0) : (e.e = oi(u, l), e.d = u, j = !1, a && (e = B(e, n, s * 4)), c && (e = e.times(Math.abs(c) < 54 ? Q(2, c) : si.pow(2, c))), j = !0, e);
 }
 function f$(e, t) {
   var r, i = t.d.length;
@@ -16360,14 +16360,14 @@ function f$(e, t) {
 }
 function Dt(e, t, r, i, n) {
   var o, a, s, c, u = e.precision, l = Math.ceil(u / N);
-  for (T = !1, c = r.times(r), s = new e(i); ; ) {
+  for (j = !1, c = r.times(r), s = new e(i); ; ) {
     if (a = B(s.times(c), new e(t++ * t++), u, 1), s = n ? i.plus(a) : i.minus(a), i = B(a.times(c), new e(t++ * t++), u, 1), a = s.plus(i), a.d[l] !== void 0) {
       for (o = l; a.d[o] === s.d[o] && o--; ) ;
       if (o == -1) break;
     }
     o = s, s = i, i = a, a = o;
   }
-  return T = !0, a.d.length = l + 1, a;
+  return j = !0, a.d.length = l + 1, a;
 }
 function ai(e, t) {
   for (var r = e; --t; ) r *= e;
@@ -16387,20 +16387,20 @@ function sh(e, t) {
   return t.minus(n).abs();
 }
 function ns(e, t, r, i) {
-  var n, o, a, s, c, u, l, d, f, m = e.constructor, v = r !== void 0;
-  if (v ? (pe(r, 1, et), i === void 0 ? i = m.rounding : pe(i, 0, 8)) : (r = m.precision, i = m.rounding), !e.isFinite())
+  var n, o, a, s, c, u, l, d, f, m = e.constructor, g = r !== void 0;
+  if (g ? (pe(r, 1, et), i === void 0 ? i = m.rounding : pe(i, 0, 8)) : (r = m.precision, i = m.rounding), !e.isFinite())
     l = ah(e);
   else {
-    for (l = Pe(e), a = l.indexOf("."), v ? (n = 2, t == 16 ? r = r * 4 - 3 : t == 8 && (r = r * 3 - 2)) : n = t, a >= 0 && (l = l.replace(".", ""), f = new m(1), f.e = l.length - a, f.d = Vn(Pe(f), 10, n), f.e = f.d.length), d = Vn(l, 10, n), o = c = d.length; d[--c] == 0; ) d.pop();
+    for (l = Pe(e), a = l.indexOf("."), g ? (n = 2, t == 16 ? r = r * 4 - 3 : t == 8 && (r = r * 3 - 2)) : n = t, a >= 0 && (l = l.replace(".", ""), f = new m(1), f.e = l.length - a, f.d = Vn(Pe(f), 10, n), f.e = f.d.length), d = Vn(l, 10, n), o = c = d.length; d[--c] == 0; ) d.pop();
     if (!d[0])
-      l = v ? "0p+0" : "0";
+      l = g ? "0p+0" : "0";
     else {
       if (a < 0 ? o-- : (e = new m(e), e.d = d, e.e = o, e = B(e, f, r, i, 0, n), d = e.d, o = e.e, u = Yp), a = d[r], s = n / 2, u = u || d[r + 1] !== void 0, u = i < 4 ? (a !== void 0 || u) && (i === 0 || i === (e.s < 0 ? 3 : 2)) : a > s || a === s && (i === 4 || u || i === 6 && d[r - 1] & 1 || i === (e.s < 0 ? 8 : 7)), d.length = r, u)
         for (; ++d[--r] > n - 1; )
           d[r] = 0, r || (++o, d.unshift(1));
       for (c = d.length; !d[c - 1]; --c) ;
       for (a = 0, l = ""; a < c; a++) l += Ri.charAt(d[a]);
-      if (v) {
+      if (g) {
         if (c > 1)
           if (t == 16 || t == 8) {
             for (a = t == 16 ? 4 : 3, --c; c % a; c++) l += "0";
@@ -16515,7 +16515,7 @@ function ch(e) {
     var a, s, c, u = this;
     if (!(u instanceof n)) return new n(o);
     if (u.constructor = n, oc(o)) {
-      u.s = o.s, T ? !o.d || o.e > n.maxE ? (u.e = NaN, u.d = null) : o.e < n.minE ? (u.e = 0, u.d = [0]) : (u.e = o.e, u.d = o.d.slice()) : (u.e = o.e, u.d = o.d ? o.d.slice() : o.d);
+      u.s = o.s, j ? !o.d || o.e > n.maxE ? (u.e = NaN, u.d = null) : o.e < n.minE ? (u.e = 0, u.d = [0]) : (u.e = o.e, u.d = o.d.slice()) : (u.e = o.e, u.d = o.d ? o.d.slice() : o.d);
       return;
     }
     if (c = typeof o, c === "number") {
@@ -16525,7 +16525,7 @@ function ch(e) {
       }
       if (o < 0 ? (o = -o, u.s = -1) : u.s = 1, o === ~~o && o < 1e7) {
         for (a = 0, s = o; s >= 10; s /= 10) a++;
-        T ? a > n.maxE ? (u.e = NaN, u.d = null) : a < n.minE ? (u.e = 0, u.d = [0]) : (u.e = a, u.d = [o]) : (u.e = a, u.d = [o]);
+        j ? a > n.maxE ? (u.e = NaN, u.d = null) : a < n.minE ? (u.e = 0, u.d = [0]) : (u.e = a, u.d = [o]) : (u.e = a, u.d = [o]);
         return;
       }
       if (o * 0 !== 0) {
@@ -16555,15 +16555,15 @@ function N$(e) {
 }
 function D$() {
   var e, t, r = new this(0);
-  for (T = !1, e = 0; e < arguments.length; )
+  for (j = !1, e = 0; e < arguments.length; )
     if (t = new this(arguments[e++]), t.d)
       r.d && (r = r.plus(t.times(t)));
     else {
       if (t.s)
-        return T = !0, new this(1 / 0);
+        return j = !0, new this(1 / 0);
       r = t;
     }
-  return T = !0, r.sqrt();
+  return j = !0, r.sqrt();
 }
 function oc(e) {
   return e instanceof si || e && e.toStringTag === th || !1;
@@ -16638,8 +16638,8 @@ function K$(e, t) {
 }
 function W$() {
   var e = 0, t = arguments, r = new this(t[e]);
-  for (T = !1; r.s && ++e < t.length; ) r = r.plus(t[e]);
-  return T = !0, x(r, this.precision, this.rounding);
+  for (j = !1; r.s && ++e < t.length; ) r = r.plus(t[e]);
+  return j = !0, x(r, this.precision, this.rounding);
 }
 function H$(e) {
   return new this(e).tan();
@@ -16660,7 +16660,7 @@ const Y$ = (e) => e?.map((t) => ({
   fileName: t.name,
   mimeType: t.mimetype
 })), X$ = async (e) => {
-  const { files: t, agentId: r, executionId: i } = e, n = t.map((s) => ({
+  const { files: t, agentId: r, sourceId: i } = e, n = t.map((s) => ({
     sourceId: i,
     sourceType: Qp.AgentExecutorDocument,
     fileName: s.name,
@@ -16683,30 +16683,48 @@ const Y$ = (e) => e?.map((t) => ({
     status: "uploaded"
   }));
 }, ew = (e) => {
-  const { socket: t, agentId: r, uid: i, variables: n, getCurrentExecutionId: o, setCurrentExecutionId: a, subscribeToExecution: s } = e;
-  return async (c) => {
-    const { content: u, executionId: l, files: d, documents: f, payload: m } = c, y = l ?? o() ?? Ai(), b = Ai();
-    a(y), s(y), t.connected || t.connect();
-    let g;
-    d?.length && (g = await X$({
-      files: d,
+  const {
+    socket: t,
+    agentId: r,
+    uid: i,
+    variables: n,
+    getCurrentConversationId: o,
+    setCurrentConversationId: a,
+    getCurrentExecutionId: s,
+    setCurrentExecutionId: c,
+    subscribeToConversation: u
+  } = e;
+  return async (l) => {
+    const {
+      content: d,
+      conversationId: f,
+      executionId: m,
+      files: g,
+      documents: y,
+      payload: b
+    } = l, v = f ?? m ?? o() ?? Ai(), S = Ai();
+    a(v), u(v), t.connected || t.connect();
+    let w;
+    g?.length && (w = await X$({
+      files: g,
       agentId: r,
-      executionId: y
+      sourceId: s() ?? r
     }));
-    const S = g?.length ? Y$(g) || [] : [];
-    f?.length && f.forEach((k) => S.push(k)), t.emit(
+    const I = w?.length ? Y$(w) || [] : [];
+    y?.length && y.forEach((T) => I.push(T)), t.emit(
       "chat-query",
       {
-        conversationId: y,
+        conversationId: v,
         agentId: r,
-        message: u,
-        messageId: b,
+        message: d,
+        messageId: S,
         ...i && { uid: i },
         ...n && Object.keys(n).length > 0 && { variables: n },
-        ...S?.length && { documents: S },
-        ...m != null && { payload: m }
+        ...I?.length && { documents: I },
+        ...b != null && { payload: b }
       },
-      () => {
+      (T) => {
+        !T?.executionId || o() !== v || c(T.executionId);
       }
     );
   };
@@ -16896,8 +16914,8 @@ function Bi(e, t, r = 0) {
       c[d] = m;
       continue;
     }
-    const v = Bi(f, m, r + 1);
-    c[d] = v, v === f && u++;
+    const g = Bi(f, m, r + 1);
+    c[d] = g, g === f && u++;
   }
   return o === s && u === o ? e : c;
 }
@@ -17121,26 +17139,26 @@ function mh(e) {
     }, e.onPause?.();
   }).then(() => {
     i = void 0, o() || e.onContinue?.();
-  }), v = () => {
+  }), g = () => {
     if (o())
       return;
     let y;
     const b = r === 0 ? e.initialPromise : void 0;
     try {
       y = b ?? e.fn();
-    } catch (g) {
-      y = Promise.reject(g);
+    } catch (v) {
+      y = Promise.reject(v);
     }
-    Promise.resolve(y).then(d).catch((g) => {
+    Promise.resolve(y).then(d).catch((v) => {
       if (o())
         return;
-      const S = e.retry ?? (dh.isServer() ? 0 : 3), k = e.retryDelay ?? bw, I = typeof k == "function" ? k(r, g) : k, j = S === !0 || typeof S == "number" && r < S || typeof S == "function" && S(r, g);
-      if (t || !j) {
-        f(g);
+      const S = e.retry ?? (dh.isServer() ? 0 : 3), w = e.retryDelay ?? bw, I = typeof w == "function" ? w(r, v) : w, T = S === !0 || typeof S == "number" && r < S || typeof S == "function" && S(r, v);
+      if (t || !T) {
+        f(v);
         return;
       }
-      r++, e.onFail?.(r, g), dw(I).then(() => u() ? void 0 : m()).then(() => {
-        t ? f(g) : v();
+      r++, e.onFail?.(r, v), dw(I).then(() => u() ? void 0 : m()).then(() => {
+        t ? f(v) : g();
       });
     });
   };
@@ -17152,7 +17170,7 @@ function mh(e) {
     cancelRetry: s,
     continueRetry: c,
     canStart: l,
-    start: () => (l() ? v() : m().then(v), n)
+    start: () => (l() ? g() : m().then(g), n)
   };
 }
 var ph = class {
@@ -17182,17 +17200,17 @@ function $w(e) {
       let s = { pages: [], pageParams: [] }, c = 0;
       const u = async () => {
         let l = !1;
-        const d = (v) => {
+        const d = (g) => {
           hw(
-            v,
+            g,
             () => t.signal,
             () => l = !0
           );
-        }, f = lh(t.options, t.fetchOptions), m = async (v, y, b) => {
+        }, f = lh(t.options, t.fetchOptions), m = async (g, y, b) => {
           if (l)
             return Promise.reject(t.signal.reason);
-          if (y == null && v.pages.length)
-            return Promise.resolve(v);
+          if (y == null && g.pages.length)
+            return Promise.resolve(g);
           const S = (() => {
             const C = {
               client: t.client,
@@ -17202,26 +17220,26 @@ function $w(e) {
               meta: t.options.meta
             };
             return d(C), C;
-          })(), k = await f(S), { maxPages: I } = t.options, j = b ? pw : mw;
+          })(), w = await f(S), { maxPages: I } = t.options, T = b ? pw : mw;
           return {
-            pages: j(v.pages, k, I),
-            pageParams: j(v.pageParams, y, I)
+            pages: T(g.pages, w, I),
+            pageParams: T(g.pageParams, y, I)
           };
         };
         if (n && o.length) {
-          const v = n === "backward", y = v ? ww : lc, b = {
+          const g = n === "backward", y = g ? ww : lc, b = {
             pages: o,
             pageParams: a
-          }, g = y(i, b);
-          s = await m(b, g, v);
+          }, v = y(i, b);
+          s = await m(b, v, g);
         } else {
-          const v = e ?? o.length;
+          const g = e ?? o.length;
           do {
             const y = c === 0 ? a[0] ?? i.initialPageParam : lc(i, s);
             if (c > 0 && y == null)
               break;
             s = await m(s, y), c++;
-          } while (c < v);
+          } while (c < g);
         }
         return s;
       };
@@ -18232,44 +18250,48 @@ const bi = () => {
   const o = n.socket;
   if (!o)
     throw new Error("Failed to initialize socket");
-  let a, s;
-  const c = X0(), u = (g) => {
-    const S = g.data;
-    c.notifyListeners(S);
-  }, l = (g) => {
-    s?.();
-    const S = Tw(g);
-    o.on(S, u), s = () => {
-      o.off(S, u);
+  let a, s, c;
+  const u = X0(), l = (S) => {
+    const w = S.data;
+    u.notifyListeners(w);
+  }, d = (S) => {
+    c?.();
+    const w = Tw(S);
+    o.on(w, l), c = () => {
+      o.off(w, l);
     };
-  }, d = ew({
+  }, f = ew({
     socket: o,
     agentId: t.agentId,
     uid: r.uid,
     variables: t.variables,
-    getCurrentExecutionId: () => a,
-    setCurrentExecutionId: (g) => {
-      a = g;
+    getCurrentConversationId: () => a,
+    setCurrentConversationId: (S) => {
+      S !== a && (s = void 0), a = S;
+    },
+    getCurrentExecutionId: () => s,
+    setCurrentExecutionId: (S) => {
+      s = S;
     },
-    subscribeToExecution: l
-  }), f = (g, S) => g === "agent-interrupt" ? (c.addListener(S), () => {
-    c.removeListener(S);
+    subscribeToConversation: d
+  }), m = (S, w) => S === "agent-interrupt" ? (u.addListener(w), () => {
+    u.removeListener(w);
   }) : () => {
-  }, m = (g, S) => {
-    g === "query" && d(S).catch(() => {
+  }, g = (S, w) => {
+    S === "query" && f(w).catch(() => {
     });
-  }, { getConversation: v, listConversations: y } = Dw({
+  }, { getConversation: y, listConversations: b } = Dw({
     agentId: t.agentId,
     instanceUserId: r.uid
   });
   return {
-    emit: m,
-    on: f,
+    emit: g,
+    on: m,
     cleanup: () => {
-      s?.(), c.clearListeners();
+      c?.(), u.clearListeners();
     },
-    getConversation: v,
-    listConversations: y
+    getConversation: y,
+    listConversations: b
   };
 };
 export {