@wp-playground/blueprints 0.6.6 → 0.6.7

package/index.js

@@ -8,56 +8,66 @@ var H = (e, t, r) => (Nt(e, t, "read from private field"), r ? r.call(e) : t.get
   t instanceof WeakSet ? t.add(e) : t.set(e, r);
 }, te = (e, t, r, n) => (Nt(e, t, "write to private field"), n ? n.call(e, r) : t.set(e, r), r);
 var ce = (e, t, r) => (Nt(e, t, "access private method"), r);
-if (typeof File > "u") {
-  class e extends Blob {
-    constructor(r, n, s) {
-      super(r);
-      let i;
-      s != null && s.lastModified && (i = /* @__PURE__ */ new Date()), (!i || isNaN(i.getFullYear())) && (i = /* @__PURE__ */ new Date()), this.lastModifiedDate = i, this.lastModified = i.getMilliseconds(), this.name = n || "";
+const currentJsRuntime = function() {
+  var e;
+  return typeof process < "u" && ((e = process.release) == null ? void 0 : e.name) === "node" ? "NODE" : typeof window < "u" ? "WEB" : (
+    // @ts-ignore
+    typeof WorkerGlobalScope < "u" && // @ts-ignore
+    self instanceof WorkerGlobalScope ? "WORKER" : "NODE"
+  );
+}();
+if (currentJsRuntime === "NODE") {
+  let e = function(r) {
+    return new Promise(function(n, s) {
+      r.onload = r.onerror = function(i) {
+        r.onload = r.onerror = null, i.type === "load" ? n(r.result) : s(new Error("Failed to read the blob/file"));
+      };
+    });
+  }, t = function() {
+    const r = new Uint8Array([1, 2, 3, 4]), s = new File([r], "test").stream();
+    try {
+      return s.getReader({ mode: "byob" }), !0;
+    } catch {
+      return !1;
     }
-  }
-  global.File = e;
-}
-function asPromise(e) {
-  return new Promise(function(t, r) {
-    e.onload = e.onerror = function(n) {
-      e.onload = e.onerror = null, n.type === "load" ? t(e.result) : r(new Error("Failed to read the blob/file"));
-    };
-  });
-}
-typeof Blob.prototype.arrayBuffer > "u" && (Blob.prototype.arrayBuffer = function() {
-  const t = new FileReader();
-  return t.readAsArrayBuffer(this), asPromise(t);
-});
-typeof Blob.prototype.text > "u" && (Blob.prototype.text = function() {
-  const t = new FileReader();
-  return t.readAsText(this), asPromise(t);
-});
-function isByobSupported() {
-  const e = new Uint8Array([1, 2, 3, 4]), r = new File([e], "test").stream();
-  try {
-    return r.getReader({ mode: "byob" }), !0;
-  } catch {
-    return !1;
-  }
-}
-(typeof Blob.prototype.stream > "u" || !isByobSupported()) && (Blob.prototype.stream = function() {
-  let e = 0;
-  const t = this;
-  return new ReadableStream({
-    type: "bytes",
-    // 0.5 MB seems like a reasonable chunk size, let's adjust
-    // this if needed.
-    autoAllocateChunkSize: 512 * 1024,
-    async pull(r) {
-      const n = r.byobRequest.view, i = await t.slice(e, e + n.byteLength).arrayBuffer(), o = new Uint8Array(i);
-      new Uint8Array(n.buffer).set(o);
-      const l = o.byteLength;
-      r.byobRequest.respond(l), e += l, e >= t.size && r.close();
+  };
+  if (typeof File > "u") {
+    class r extends Blob {
+      constructor(s, i, o) {
+        super(s);
+        let l;
+        o != null && o.lastModified && (l = /* @__PURE__ */ new Date()), (!l || isNaN(l.getFullYear())) && (l = /* @__PURE__ */ new Date()), this.lastModifiedDate = l, this.lastModified = l.getMilliseconds(), this.name = i || "";
+      }
     }
+    global.File = r;
+  }
+  typeof Blob.prototype.arrayBuffer > "u" && (Blob.prototype.arrayBuffer = function() {
+    const n = new FileReader();
+    return n.readAsArrayBuffer(this), e(n);
+  }), typeof Blob.prototype.text > "u" && (Blob.prototype.text = function() {
+    const n = new FileReader();
+    return n.readAsText(this), e(n);
+  }), (typeof Blob.prototype.stream > "u" || !t()) && (Blob.prototype.stream = function() {
+    let r = 0;
+    const n = this;
+    return new ReadableStream({
+      type: "bytes",
+      // 0.5 MB seems like a reasonable chunk size, let's adjust
+      // this if needed.
+      autoAllocateChunkSize: 512 * 1024,
+      async pull(s) {
+        const i = s.byobRequest.view, l = await n.slice(
+          r,
+          r + i.byteLength
+        ).arrayBuffer(), d = new Uint8Array(l);
+        new Uint8Array(i.buffer).set(d);
+        const u = d.byteLength;
+        s.byobRequest.respond(u), r += u, r >= n.size && s.close();
+      }
+    });
   });
-});
-if (typeof CustomEvent > "u") {
+}
+if (currentJsRuntime === "NODE" && typeof CustomEvent > "u") {
   class e extends Event {
     constructor(r, n = {}) {
       super(r, n), this.detail = n.detail;
@@ -1724,16 +1734,16 @@ const SupportedPHPVersions = [
 ], SupportedPHPExtensionBundles = {
   "kitchen-sink": SupportedPHPExtensionsList
 };
-var Ae, Ge;
+var De, Ge;
 class PHPBrowser {
   /**
    * @param  server - The PHP server to browse.
    * @param  config - The browser configuration.
    */
   constructor(t, r = {}) {
-    Q(this, Ae, void 0);
+    Q(this, De, void 0);
     Q(this, Ge, void 0);
-    this.requestHandler = t, te(this, Ae, {}), te(this, Ge, {
+    this.requestHandler = t, te(this, De, {}), te(this, Ge, {
       handleRedirects: !1,
       maxRedirects: 4,
       ...r
@@ -1799,19 +1809,19 @@ class PHPBrowser {
         if (!r.includes("="))
           continue;
         const n = r.indexOf("="), s = r.substring(0, n), i = r.substring(n + 1).split(";")[0];
-        H(this, Ae)[s] = i;
+        H(this, De)[s] = i;
       } catch (n) {
         console.error(n);
       }
   }
   serializeCookies() {
     const t = [];
-    for (const r in H(this, Ae))
-      t.push(`${r}=${H(this, Ae)[r]}`);
+    for (const r in H(this, De))
+      t.push(`${r}=${H(this, De)[r]}`);
     return t.join("; ");
   }
 }
-Ae = new WeakMap(), Ge = new WeakMap();
+De = new WeakMap(), Ge = new WeakMap();
 const DEFAULT_BASE_URL = "http://example.com";
 function toRelativeUrl(e) {
   return e.toString().substring(e.origin.length);
@@ -1850,7 +1860,7 @@ function fileToUint8Array(e) {
     }, r.readAsArrayBuffer(e);
   });
 }
-var Pe, Ke, dt, De, Je, ve, Qe, Fe, mt, xt, _t, Wt, $t, Bt;
+var Pe, Ke, dt, Ae, Je, ve, Qe, Fe, mt, xt, _t, Wt, $t, Bt;
 class PHPRequestHandler {
   /**
    * @param  php    - The PHP instance.
@@ -1885,7 +1895,7 @@ class PHPRequestHandler {
     Q(this, Pe, void 0);
     Q(this, Ke, void 0);
     Q(this, dt, void 0);
-    Q(this, De, void 0);
+    Q(this, Ae, void 0);
     Q(this, Je, void 0);
     Q(this, ve, void 0);
     Q(this, Qe, void 0);
@@ -1897,11 +1907,11 @@ class PHPRequestHandler {
     } = r;
     this.php = t, te(this, Pe, n);
     const i = new URL(s);
-    te(this, dt, i.hostname), te(this, De, i.port ? Number(i.port) : i.protocol === "https:" ? 443 : 80), te(this, Ke, (i.protocol || "").replace(":", ""));
-    const o = H(this, De) !== 443 && H(this, De) !== 80;
+    te(this, dt, i.hostname), te(this, Ae, i.port ? Number(i.port) : i.protocol === "https:" ? 443 : 80), te(this, Ke, (i.protocol || "").replace(":", ""));
+    const o = H(this, Ae) !== 443 && H(this, Ae) !== 80;
     te(this, Je, [
       H(this, dt),
-      o ? `:${H(this, De)}` : ""
+      o ? `:${H(this, Ae)}` : ""
     ].join("")), te(this, ve, i.pathname.replace(/\/+$/, "")), te(this, Qe, [
       `${H(this, Ke)}://`,
       H(this, Je),
@@ -1940,7 +1950,7 @@ class PHPRequestHandler {
     return seemsLikeAPHPRequestHandlerPath(i) ? await ce(this, _t, Wt).call(this, t, n) : ce(this, mt, xt).call(this, i);
   }
 }
-Pe = new WeakMap(), Ke = new WeakMap(), dt = new WeakMap(), De = new WeakMap(), Je = new WeakMap(), ve = new WeakMap(), Qe = new WeakMap(), Fe = new WeakMap(), mt = new WeakSet(), xt = function(t) {
+Pe = new WeakMap(), Ke = new WeakMap(), dt = new WeakMap(), Ae = new WeakMap(), Je = new WeakMap(), ve = new WeakMap(), Qe = new WeakMap(), Fe = new WeakMap(), mt = new WeakSet(), xt = function(t) {
   if (!this.php.fileExists(t))
     return new PHPResponse(
       404,
@@ -2198,7 +2208,7 @@ var __defProp = Object.defineProperty, __getOwnPropDesc = Object.getOwnPropertyD
   return n && s && __defProp(t, r, s), s;
 };
 const STRING = "string", NUMBER = "number", __private__dont__use = Symbol("__private__dont__use");
-var Me, Ze, Ye, be, Te, Re, Ee, Xe, gt, Gt, yt, Kt, vt, Jt, wt, Qt, Pt, Zt, bt, Yt, Et, Xt, St, er, Tt, tr, Rt, rr, kt, nr, Ot, sr;
+var Me, Ze, Ye, be, Re, Te, Ee, Xe, gt, Gt, yt, Kt, vt, Jt, wt, Qt, Pt, Zt, bt, Yt, Et, Xt, St, er, Rt, tr, Tt, rr, kt, nr, Ot, sr;
 class BasePHP {
   /**
    * Initializes a PHP runtime.
@@ -2216,19 +2226,19 @@ class BasePHP {
     Q(this, bt);
     Q(this, Et);
     Q(this, St);
-    Q(this, Tt);
     Q(this, Rt);
+    Q(this, Tt);
     Q(this, kt);
     Q(this, Ot);
     Q(this, Me, void 0);
     Q(this, Ze, void 0);
     Q(this, Ye, void 0);
     Q(this, be, void 0);
-    Q(this, Te, void 0);
     Q(this, Re, void 0);
+    Q(this, Te, void 0);
     Q(this, Ee, void 0);
     Q(this, Xe, void 0);
-    te(this, Me, []), te(this, be, !1), te(this, Te, null), te(this, Re, {}), te(this, Ee, /* @__PURE__ */ new Map()), te(this, Xe, []), this.semaphore = new Semaphore({ concurrency: 1 }), e !== void 0 && this.initializeRuntime(e), t && (this.requestHandler = new PHPBrowser(
+    te(this, Me, []), te(this, be, !1), te(this, Re, null), te(this, Te, {}), te(this, Ee, /* @__PURE__ */ new Map()), te(this, Xe, []), this.semaphore = new Semaphore({ concurrency: 1 }), e !== void 0 && this.initializeRuntime(e), t && (this.requestHandler = new PHPBrowser(
       new PHPRequestHandler(this, t)
     ));
   }
@@ -2284,7 +2294,7 @@ class BasePHP {
           return s;
       }
       return "";
-    }, te(this, Te, improveWASMErrorReporting(t)), this.dispatchEvent({
+    }, te(this, Re, improveWASMErrorReporting(t)), this.dispatchEvent({
       type: "runtime.initialized"
     });
   }
@@ -2339,10 +2349,10 @@ class BasePHP {
         );
       ce(this, St, er).call(this, e.scriptPath || ""), ce(this, vt, Jt).call(this, e.relativeUri || ""), ce(this, Pt, Zt).call(this, e.method || "GET");
       const n = normalizeHeaders(e.headers || {}), s = n.host || "example.com:443";
-      ce(this, wt, Qt).call(this, s, e.protocol || "http"), ce(this, bt, Yt).call(this, n), e.body && (r = ce(this, Et, Xt).call(this, e.body)), typeof e.code == "string" && ce(this, kt, nr).call(this, " ?>" + e.code), ce(this, Tt, tr).call(this);
+      ce(this, wt, Qt).call(this, s, e.protocol || "http"), ce(this, bt, Yt).call(this, n), e.body && (r = ce(this, Et, Xt).call(this, e.body)), typeof e.code == "string" && ce(this, kt, nr).call(this, " ?>" + e.code), ce(this, Rt, tr).call(this);
       const i = e.env || {};
       for (const l in i)
-        ce(this, Rt, rr).call(this, l, i[l]);
+        ce(this, Tt, rr).call(this, l, i[l]);
       const o = await ce(this, Ot, sr).call(this);
       if (e.throwOnError && o.exitCode !== 0) {
         const l = {
@@ -2367,7 +2377,7 @@ class BasePHP {
     }
   }
   addServerGlobalEntry(e, t) {
-    H(this, Re)[e] = t;
+    H(this, Te)[e] = t;
   }
   defineConstant(e, t) {
     let r = {};
@@ -2476,10 +2486,10 @@ class BasePHP {
       this[__private__dont__use]._exit(e);
     } catch {
     }
-    te(this, be, !1), te(this, Te, null), delete this[__private__dont__use].onMessage, delete this[__private__dont__use];
+    te(this, be, !1), te(this, Re, null), delete this[__private__dont__use].onMessage, delete this[__private__dont__use];
   }
 }
-Me = new WeakMap(), Ze = new WeakMap(), Ye = new WeakMap(), be = new WeakMap(), Te = new WeakMap(), Re = new WeakMap(), Ee = new WeakMap(), Xe = new WeakMap(), gt = new WeakSet(), Gt = function() {
+Me = new WeakMap(), Ze = new WeakMap(), Ye = new WeakMap(), be = new WeakMap(), Re = new WeakMap(), Te = new WeakMap(), Ee = new WeakMap(), Xe = new WeakMap(), gt = new WeakSet(), Gt = function() {
   if (this.setPhpIniEntry("auto_prepend_file", "/internal/consts.php"), this.fileExists("/internal/consts.php") || this.writeFile(
     "/internal/consts.php",
     `<?php
@@ -2615,15 +2625,15 @@ Me = new WeakMap(), Ze = new WeakMap(), Ye = new WeakMap(), be = new WeakMap(),
     [STRING],
     [e]
   );
-}, Tt = new WeakSet(), tr = function() {
-  for (const e in H(this, Re))
+}, Rt = new WeakSet(), tr = function() {
+  for (const e in H(this, Te))
     this[__private__dont__use].ccall(
       "wasm_add_SERVER_entry",
       null,
       [STRING, STRING],
-      [e, H(this, Re)[e]]
+      [e, H(this, Te)[e]]
     );
-}, Rt = new WeakSet(), rr = function(e, t) {
+}, Tt = new WeakSet(), rr = function(e, t) {
   this[__private__dont__use].ccall(
     "wasm_add_ENV_entry",
     null,
@@ -2647,7 +2657,7 @@ Me = new WeakMap(), Ze = new WeakMap(), Ye = new WeakMap(), be = new WeakMap(),
         console.error(u), console.error(u.error);
         const p = new Error("Rethrown");
         p.cause = u.error, p.betterMessage = u.message, o(p);
-      }, (d = H(this, Te)) == null || d.addEventListener(
+      }, (d = H(this, Re)) == null || d.addEventListener(
         "error",
         t
       );
@@ -2671,7 +2681,7 @@ Me = new WeakMap(), Ze = new WeakMap(), Ye = new WeakMap(), be = new WeakMap(),
     const o = i, l = "betterMessage" in o ? o.betterMessage : o.message, d = new Error(l);
     throw d.cause = o, console.error(d), d;
   } finally {
-    (s = H(this, Te)) == null || s.removeEventListener("error", t), te(this, Re, {});
+    (s = H(this, Re)) == null || s.removeEventListener("error", t), te(this, Te, {});
   }
   const { headers: r, httpStatusCode: n } = ce(this, yt, Kt).call(this);
   return new PHPResponse(
@@ -2970,10 +2980,10 @@ var ajv$1 = { exports: {} }, core$2 = {}, validate = {}, boolSchema = {}, errors
   }
   e._CodeOrName = t, e.IDENTIFIER = /^[a-z$_][a-z$_0-9]*$/i;
   class r extends t {
-    constructor(R) {
-      if (super(), !e.IDENTIFIER.test(R))
+    constructor(T) {
+      if (super(), !e.IDENTIFIER.test(T))
         throw new Error("CodeGen: name must be a valid identifier");
-      this.str = R;
+      this.str = T;
     }
     toString() {
       return this.str;
@@ -2987,8 +2997,8 @@ var ajv$1 = { exports: {} }, core$2 = {}, validate = {}, boolSchema = {}, errors
   }
   e.Name = r;
   class n extends t {
-    constructor(R) {
-      super(), this._items = typeof R == "string" ? [R] : R;
+    constructor(T) {
+      super(), this._items = typeof T == "string" ? [T] : T;
     }
     toString() {
       return this.str;
@@ -2996,66 +3006,66 @@ var ajv$1 = { exports: {} }, core$2 = {}, validate = {}, boolSchema = {}, errors
     emptyStr() {
       if (this._items.length > 1)
         return !1;
-      const R = this._items[0];
-      return R === "" || R === '""';
+      const T = this._items[0];
+      return T === "" || T === '""';
     }
     get str() {
-      var R;
-      return (R = this._str) !== null && R !== void 0 ? R : this._str = this._items.reduce((S, I) => `${S}${I}`, "");
+      var T;
+      return (T = this._str) !== null && T !== void 0 ? T : this._str = this._items.reduce((S, I) => `${S}${I}`, "");
     }
     get names() {
-      var R;
-      return (R = this._names) !== null && R !== void 0 ? R : this._names = this._items.reduce((S, I) => (I instanceof r && (S[I.str] = (S[I.str] || 0) + 1), S), {});
+      var T;
+      return (T = this._names) !== null && T !== void 0 ? T : this._names = this._items.reduce((S, I) => (I instanceof r && (S[I.str] = (S[I.str] || 0) + 1), S), {});
     }
   }
   e._Code = n, e.nil = new n("");
-  function s(m, ...R) {
+  function s(m, ...T) {
     const S = [m[0]];
     let I = 0;
-    for (; I < R.length; )
-      l(S, R[I]), S.push(m[++I]);
+    for (; I < T.length; )
+      l(S, T[I]), S.push(m[++I]);
     return new n(S);
   }
   e._ = s;
   const i = new n("+");
-  function o(m, ...R) {
+  function o(m, ...T) {
     const S = [N(m[0])];
     let I = 0;
-    for (; I < R.length; )
-      S.push(i), l(S, R[I]), S.push(i, N(m[++I]));
+    for (; I < T.length; )
+      S.push(i), l(S, T[I]), S.push(i, N(m[++I]));
     return d(S), new n(S);
   }
   e.str = o;
-  function l(m, R) {
-    R instanceof n ? m.push(...R._items) : R instanceof r ? m.push(R) : m.push($(R));
+  function l(m, T) {
+    T instanceof n ? m.push(...T._items) : T instanceof r ? m.push(T) : m.push($(T));
   }
   e.addCodeArg = l;
   function d(m) {
-    let R = 1;
-    for (; R < m.length - 1; ) {
-      if (m[R] === i) {
-        const S = u(m[R - 1], m[R + 1]);
+    let T = 1;
+    for (; T < m.length - 1; ) {
+      if (m[T] === i) {
+        const S = u(m[T - 1], m[T + 1]);
         if (S !== void 0) {
-          m.splice(R - 1, 3, S);
+          m.splice(T - 1, 3, S);
           continue;
         }
-        m[R++] = "+";
+        m[T++] = "+";
       }
-      R++;
+      T++;
     }
   }
-  function u(m, R) {
-    if (R === '""')
+  function u(m, T) {
+    if (T === '""')
       return m;
     if (m === '""')
-      return R;
+      return T;
     if (typeof m == "string")
-      return R instanceof r || m[m.length - 1] !== '"' ? void 0 : typeof R != "string" ? `${m.slice(0, -1)}${R}"` : R[0] === '"' ? m.slice(0, -1) + R.slice(1) : void 0;
-    if (typeof R == "string" && R[0] === '"' && !(m instanceof r))
-      return `"${m}${R.slice(1)}`;
+      return T instanceof r || m[m.length - 1] !== '"' ? void 0 : typeof T != "string" ? `${m.slice(0, -1)}${T}"` : T[0] === '"' ? m.slice(0, -1) + T.slice(1) : void 0;
+    if (typeof T == "string" && T[0] === '"' && !(m instanceof r))
+      return `"${m}${T.slice(1)}`;
   }
-  function p(m, R) {
-    return R.emptyStr() ? m : m.emptyStr() ? R : o`${m}${R}`;
+  function p(m, T) {
+    return T.emptyStr() ? m : m.emptyStr() ? T : o`${m}${T}`;
   }
   e.strConcat = p;
   function $(m) {
@@ -3069,10 +3079,10 @@ var ajv$1 = { exports: {} }, core$2 = {}, validate = {}, boolSchema = {}, errors
     return JSON.stringify(m).replace(/\u2028/g, "\\u2028").replace(/\u2029/g, "\\u2029");
   }
   e.safeStringify = N;
-  function T(m) {
+  function R(m) {
     return typeof m == "string" && e.IDENTIFIER.test(m) ? new n(`.${m}`) : s`[${m}]`;
   }
-  e.getProperty = T;
+  e.getProperty = R;
   function v(m) {
     if (typeof m == "string" && e.IDENTIFIER.test(m))
       return new n(`${m}`);
@@ -3147,15 +3157,15 @@ var scope = {};
       var $;
       if (p.ref === void 0)
         throw new Error("CodeGen: ref must be passed in value");
-      const O = this.toName(u), { prefix: N } = O, T = ($ = p.key) !== null && $ !== void 0 ? $ : p.ref;
+      const O = this.toName(u), { prefix: N } = O, R = ($ = p.key) !== null && $ !== void 0 ? $ : p.ref;
       let v = this._values[N];
       if (v) {
-        const R = v.get(T);
-        if (R)
-          return R;
+        const T = v.get(R);
+        if (T)
+          return T;
       } else
         v = this._values[N] = /* @__PURE__ */ new Map();
-      v.set(T, O);
+      v.set(R, O);
       const g = this._scope[N] || (this._scope[N] = []), m = g.length;
       return g[m] = p.ref, O.setValue(p, { property: N, itemIndex: m }), O;
     }
@@ -3180,21 +3190,21 @@ var scope = {};
     }
     _reduceValues(u, p, $ = {}, O) {
       let N = t.nil;
-      for (const T in u) {
-        const v = u[T];
+      for (const R in u) {
+        const v = u[R];
         if (!v)
           continue;
-        const g = $[T] = $[T] || /* @__PURE__ */ new Map();
+        const g = $[R] = $[R] || /* @__PURE__ */ new Map();
         v.forEach((m) => {
           if (g.has(m))
             return;
           g.set(m, n.Started);
-          let R = p(m);
-          if (R) {
+          let T = p(m);
+          if (T) {
             const S = this.opts.es5 ? e.varKinds.var : e.varKinds.const;
-            N = (0, t._)`${N}${S} ${m} = ${R};${this.opts._n}`;
-          } else if (R = O == null ? void 0 : O(m))
-            N = (0, t._)`${N}${R}${this.opts._n}`;
+            N = (0, t._)`${N}${S} ${m} = ${T};${this.opts._n}`;
+          } else if (T = O == null ? void 0 : O(m))
+            N = (0, t._)`${N}${T}${this.opts._n}`;
           else
             throw new r(m);
           g.set(m, n.Completed);
@@ -3368,17 +3378,17 @@ var scope = {};
       return this.nodes.reduce((a, h) => K(a, h.names), {});
     }
   }
-  class T extends N {
+  class R extends N {
     render(a) {
       return "{" + a._n + super.render(a) + "}" + a._n;
     }
   }
   class v extends N {
   }
-  class g extends T {
+  class g extends R {
   }
   g.kind = "else";
-  class m extends T {
+  class m extends R {
     constructor(a, h) {
       super(h), this.condition = a;
     }
@@ -3412,10 +3422,10 @@ var scope = {};
     }
   }
   m.kind = "if";
-  class R extends T {
+  class T extends R {
   }
-  R.kind = "for";
-  class S extends R {
+  T.kind = "for";
+  class S extends T {
     constructor(a) {
       super(), this.iteration = a;
     }
@@ -3430,7 +3440,7 @@ var scope = {};
       return K(super.names, this.iteration.names);
     }
   }
-  class I extends R {
+  class I extends T {
     constructor(a, h, C, M) {
       super(), this.varKind = a, this.name = h, this.from = C, this.to = M;
     }
@@ -3443,7 +3453,7 @@ var scope = {};
       return ue(a, this.to);
     }
   }
-  class D extends R {
+  class A extends T {
     constructor(a, h, C, M) {
       super(), this.loop = a, this.varKind = h, this.name = C, this.iterable = M;
     }
@@ -3458,7 +3468,7 @@ var scope = {};
       return K(super.names, this.iterable.names);
     }
   }
-  class w extends T {
+  class w extends R {
     constructor(a, h, C) {
       super(), this.name = a, this.args = h, this.async = C;
     }
@@ -3473,7 +3483,7 @@ var scope = {};
     }
   }
   k.kind = "return";
-  class A extends T {
+  class D extends R {
     render(a) {
       let h = "try" + super.render(a);
       return this.catch && (h += this.catch.render(a)), this.finally && (h += this.finally.render(a)), h;
@@ -3491,7 +3501,7 @@ var scope = {};
       return this.catch && K(a, this.catch.names), this.finally && K(a, this.finally.names), a;
     }
   }
-  class V extends T {
+  class V extends R {
     constructor(a) {
       super(), this.error = a;
     }
@@ -3500,7 +3510,7 @@ var scope = {};
     }
   }
   V.kind = "catch";
-  class x extends T {
+  class x extends R {
     render(a) {
       return "finally" + super.render(a);
     }
@@ -3616,7 +3626,7 @@ var scope = {};
           this.var(q, (0, t._)`${W}[${G}]`), C(q);
         });
       }
-      return this._for(new D("of", M, q, h), () => C(q));
+      return this._for(new A("of", M, q, h), () => C(q));
     }
     // `for-in` statement.
     // With option `ownProperties` replaced with a `for-of` loop for object keys
@@ -3624,11 +3634,11 @@ var scope = {};
       if (this.opts.ownProperties)
         return this.forOf(a, (0, t._)`Object.keys(${h})`, C);
       const q = this._scope.toName(a);
-      return this._for(new D("in", M, q, h), () => C(q));
+      return this._for(new A("in", M, q, h), () => C(q));
     }
     // end `for` loop
     endFor() {
-      return this._endBlockNode(R);
+      return this._endBlockNode(T);
     }
     // `label` statement
     label(a) {
@@ -3649,7 +3659,7 @@ var scope = {};
     try(a, h, C) {
       if (!h && !C)
         throw new Error('CodeGen: "try" without "catch" and "finally"');
-      const M = new A();
+      const M = new D();
       if (this._blockNode(M), this.code(a), h) {
         const q = this.name("e");
         this._currNode = M.catch = new V(q), h(q);
@@ -3770,8 +3780,8 @@ var util = {};
   const t = codegen, r = code$1;
   function n(w) {
     const k = {};
-    for (const A of w)
-      k[A] = !0;
+    for (const D of w)
+      k[D] = !0;
     return k;
   }
   e.toHash = n;
@@ -3780,19 +3790,19 @@ var util = {};
   }
   e.alwaysValidSchema = s;
   function i(w, k = w.schema) {
-    const { opts: A, self: V } = w;
-    if (!A.strictSchema || typeof k == "boolean")
+    const { opts: D, self: V } = w;
+    if (!D.strictSchema || typeof k == "boolean")
       return;
     const x = V.RULES.keywords;
     for (const re in k)
-      x[re] || D(w, `unknown keyword: "${re}"`);
+      x[re] || A(w, `unknown keyword: "${re}"`);
   }
   e.checkUnknownRules = i;
   function o(w, k) {
     if (typeof w == "boolean")
       return !w;
-    for (const A in w)
-      if (k[A])
+    for (const D in w)
+      if (k[D])
         return !0;
     return !1;
   }
@@ -3800,18 +3810,18 @@ var util = {};
   function l(w, k) {
     if (typeof w == "boolean")
       return !w;
-    for (const A in w)
-      if (A !== "$ref" && k.all[A])
+    for (const D in w)
+      if (D !== "$ref" && k.all[D])
         return !0;
     return !1;
   }
   e.schemaHasRulesButRef = l;
-  function d({ topSchemaRef: w, schemaPath: k }, A, V, x) {
+  function d({ topSchemaRef: w, schemaPath: k }, D, V, x) {
     if (!x) {
-      if (typeof A == "number" || typeof A == "boolean")
-        return A;
-      if (typeof A == "string")
-        return (0, t._)`${A}`;
+      if (typeof D == "number" || typeof D == "boolean")
+        return D;
+      if (typeof D == "string")
+        return (0, t._)`${D}`;
     }
     return (0, t._)`${w}${k}${(0, t.getProperty)(V)}`;
   }
@@ -3834,32 +3844,32 @@ var util = {};
   e.unescapeJsonPointer = O;
   function N(w, k) {
     if (Array.isArray(w))
-      for (const A of w)
-        k(A);
+      for (const D of w)
+        k(D);
     else
       k(w);
   }
   e.eachItem = N;
-  function T({ mergeNames: w, mergeToName: k, mergeValues: A, resultToName: V }) {
+  function R({ mergeNames: w, mergeToName: k, mergeValues: D, resultToName: V }) {
     return (x, re, K, ue) => {
-      const oe = K === void 0 ? re : K instanceof t.Name ? (re instanceof t.Name ? w(x, re, K) : k(x, re, K), K) : re instanceof t.Name ? (k(x, K, re), re) : A(re, K);
+      const oe = K === void 0 ? re : K instanceof t.Name ? (re instanceof t.Name ? w(x, re, K) : k(x, re, K), K) : re instanceof t.Name ? (k(x, K, re), re) : D(re, K);
       return ue === t.Name && !(oe instanceof t.Name) ? V(x, oe) : oe;
     };
   }
   e.mergeEvaluated = {
-    props: T({
-      mergeNames: (w, k, A) => w.if((0, t._)`${A} !== true && ${k} !== undefined`, () => {
-        w.if((0, t._)`${k} === true`, () => w.assign(A, !0), () => w.assign(A, (0, t._)`${A} || {}`).code((0, t._)`Object.assign(${A}, ${k})`));
+    props: R({
+      mergeNames: (w, k, D) => w.if((0, t._)`${D} !== true && ${k} !== undefined`, () => {
+        w.if((0, t._)`${k} === true`, () => w.assign(D, !0), () => w.assign(D, (0, t._)`${D} || {}`).code((0, t._)`Object.assign(${D}, ${k})`));
       }),
-      mergeToName: (w, k, A) => w.if((0, t._)`${A} !== true`, () => {
-        k === !0 ? w.assign(A, !0) : (w.assign(A, (0, t._)`${A} || {}`), g(w, A, k));
+      mergeToName: (w, k, D) => w.if((0, t._)`${D} !== true`, () => {
+        k === !0 ? w.assign(D, !0) : (w.assign(D, (0, t._)`${D} || {}`), g(w, D, k));
       }),
       mergeValues: (w, k) => w === !0 ? !0 : { ...w, ...k },
       resultToName: v
     }),
-    items: T({
-      mergeNames: (w, k, A) => w.if((0, t._)`${A} !== true && ${k} !== undefined`, () => w.assign(A, (0, t._)`${k} === true ? true : ${A} > ${k} ? ${A} : ${k}`)),
-      mergeToName: (w, k, A) => w.if((0, t._)`${A} !== true`, () => w.assign(A, k === !0 ? !0 : (0, t._)`${A} > ${k} ? ${A} : ${k}`)),
+    items: R({
+      mergeNames: (w, k, D) => w.if((0, t._)`${D} !== true && ${k} !== undefined`, () => w.assign(D, (0, t._)`${k} === true ? true : ${D} > ${k} ? ${D} : ${k}`)),
+      mergeToName: (w, k, D) => w.if((0, t._)`${D} !== true`, () => w.assign(D, k === !0 ? !0 : (0, t._)`${D} > ${k} ? ${D} : ${k}`)),
       mergeValues: (w, k) => w === !0 ? !0 : Math.max(w, k),
       resultToName: (w, k) => w.var("items", k)
     })
@@ -3867,42 +3877,42 @@ var util = {};
   function v(w, k) {
     if (k === !0)
       return w.var("props", !0);
-    const A = w.var("props", (0, t._)`{}`);
-    return k !== void 0 && g(w, A, k), A;
+    const D = w.var("props", (0, t._)`{}`);
+    return k !== void 0 && g(w, D, k), D;
   }
   e.evaluatedPropsToName = v;
-  function g(w, k, A) {
-    Object.keys(A).forEach((V) => w.assign((0, t._)`${k}${(0, t.getProperty)(V)}`, !0));
+  function g(w, k, D) {
+    Object.keys(D).forEach((V) => w.assign((0, t._)`${k}${(0, t.getProperty)(V)}`, !0));
   }
   e.setEvaluated = g;
   const m = {};
-  function R(w, k) {
+  function T(w, k) {
     return w.scopeValue("func", {
       ref: k,
       code: m[k.code] || (m[k.code] = new r._Code(k.code))
     });
   }
-  e.useFunc = R;
+  e.useFunc = T;
   var S;
   (function(w) {
     w[w.Num = 0] = "Num", w[w.Str = 1] = "Str";
   })(S = e.Type || (e.Type = {}));
-  function I(w, k, A) {
+  function I(w, k, D) {
     if (w instanceof t.Name) {
       const V = k === S.Num;
-      return A ? V ? (0, t._)`"[" + ${w} + "]"` : (0, t._)`"['" + ${w} + "']"` : V ? (0, t._)`"/" + ${w}` : (0, t._)`"/" + ${w}.replace(/~/g, "~0").replace(/\\//g, "~1")`;
+      return D ? V ? (0, t._)`"[" + ${w} + "]"` : (0, t._)`"['" + ${w} + "']"` : V ? (0, t._)`"/" + ${w}` : (0, t._)`"/" + ${w}.replace(/~/g, "~0").replace(/\\//g, "~1")`;
     }
-    return A ? (0, t.getProperty)(w).toString() : "/" + $(w);
+    return D ? (0, t.getProperty)(w).toString() : "/" + $(w);
   }
   e.getErrorPath = I;
-  function D(w, k, A = w.opts.strictSchema) {
-    if (A) {
-      if (k = `strict mode: ${k}`, A === !0)
+  function A(w, k, D = w.opts.strictSchema) {
+    if (D) {
+      if (k = `strict mode: ${k}`, D === !0)
         throw new Error(k);
       w.self.logger.warn(k);
     }
   }
-  e.checkStrictMode = D;
+  e.checkStrictMode = A;
 })(util);
 var names$1 = {};
 Object.defineProperty(names$1, "__esModule", { value: !0 });
@@ -3938,36 +3948,36 @@ names$1.default = names;
   }, e.keyword$DataError = {
     message: ({ keyword: g, schemaType: m }) => m ? (0, t.str)`"${g}" keyword must be ${m} ($data)` : (0, t.str)`"${g}" keyword is invalid ($data)`
   };
-  function s(g, m = e.keywordError, R, S) {
-    const { it: I } = g, { gen: D, compositeRule: w, allErrors: k } = I, A = $(g, m, R);
-    S ?? (w || k) ? d(D, A) : u(I, (0, t._)`[${A}]`);
+  function s(g, m = e.keywordError, T, S) {
+    const { it: I } = g, { gen: A, compositeRule: w, allErrors: k } = I, D = $(g, m, T);
+    S ?? (w || k) ? d(A, D) : u(I, (0, t._)`[${D}]`);
   }
   e.reportError = s;
-  function i(g, m = e.keywordError, R) {
-    const { it: S } = g, { gen: I, compositeRule: D, allErrors: w } = S, k = $(g, m, R);
-    d(I, k), D || w || u(S, n.default.vErrors);
+  function i(g, m = e.keywordError, T) {
+    const { it: S } = g, { gen: I, compositeRule: A, allErrors: w } = S, k = $(g, m, T);
+    d(I, k), A || w || u(S, n.default.vErrors);
   }
   e.reportExtraError = i;
   function o(g, m) {
     g.assign(n.default.errors, m), g.if((0, t._)`${n.default.vErrors} !== null`, () => g.if(m, () => g.assign((0, t._)`${n.default.vErrors}.length`, m), () => g.assign(n.default.vErrors, null)));
   }
   e.resetErrorsCount = o;
-  function l({ gen: g, keyword: m, schemaValue: R, data: S, errsCount: I, it: D }) {
+  function l({ gen: g, keyword: m, schemaValue: T, data: S, errsCount: I, it: A }) {
     if (I === void 0)
       throw new Error("ajv implementation error");
     const w = g.name("err");
     g.forRange("i", I, n.default.errors, (k) => {
-      g.const(w, (0, t._)`${n.default.vErrors}[${k}]`), g.if((0, t._)`${w}.instancePath === undefined`, () => g.assign((0, t._)`${w}.instancePath`, (0, t.strConcat)(n.default.instancePath, D.errorPath))), g.assign((0, t._)`${w}.schemaPath`, (0, t.str)`${D.errSchemaPath}/${m}`), D.opts.verbose && (g.assign((0, t._)`${w}.schema`, R), g.assign((0, t._)`${w}.data`, S));
+      g.const(w, (0, t._)`${n.default.vErrors}[${k}]`), g.if((0, t._)`${w}.instancePath === undefined`, () => g.assign((0, t._)`${w}.instancePath`, (0, t.strConcat)(n.default.instancePath, A.errorPath))), g.assign((0, t._)`${w}.schemaPath`, (0, t.str)`${A.errSchemaPath}/${m}`), A.opts.verbose && (g.assign((0, t._)`${w}.schema`, T), g.assign((0, t._)`${w}.data`, S));
     });
   }
   e.extendErrors = l;
   function d(g, m) {
-    const R = g.const("err", m);
-    g.if((0, t._)`${n.default.vErrors} === null`, () => g.assign(n.default.vErrors, (0, t._)`[${R}]`), (0, t._)`${n.default.vErrors}.push(${R})`), g.code((0, t._)`${n.default.errors}++`);
+    const T = g.const("err", m);
+    g.if((0, t._)`${n.default.vErrors} === null`, () => g.assign(n.default.vErrors, (0, t._)`[${T}]`), (0, t._)`${n.default.vErrors}.push(${T})`), g.code((0, t._)`${n.default.errors}++`);
   }
   function u(g, m) {
-    const { gen: R, validateName: S, schemaEnv: I } = g;
-    I.$async ? R.throw((0, t._)`new ${g.ValidationError}(${m})`) : (R.assign((0, t._)`${S}.errors`, m), R.return(!1));
+    const { gen: T, validateName: S, schemaEnv: I } = g;
+    I.$async ? T.throw((0, t._)`new ${g.ValidationError}(${m})`) : (T.assign((0, t._)`${S}.errors`, m), T.return(!1));
   }
   const p = {
     keyword: new t.Name("keyword"),
@@ -3978,28 +3988,28 @@ names$1.default = names;
     schema: new t.Name("schema"),
     parentSchema: new t.Name("parentSchema")
   };
-  function $(g, m, R) {
+  function $(g, m, T) {
     const { createErrors: S } = g.it;
-    return S === !1 ? (0, t._)`{}` : O(g, m, R);
+    return S === !1 ? (0, t._)`{}` : O(g, m, T);
   }
-  function O(g, m, R = {}) {
-    const { gen: S, it: I } = g, D = [
-      N(I, R),
-      T(g, R)
+  function O(g, m, T = {}) {
+    const { gen: S, it: I } = g, A = [
+      N(I, T),
+      R(g, T)
     ];
-    return v(g, m, D), S.object(...D);
+    return v(g, m, A), S.object(...A);
   }
   function N({ errorPath: g }, { instancePath: m }) {
-    const R = m ? (0, t.str)`${g}${(0, r.getErrorPath)(m, r.Type.Str)}` : g;
-    return [n.default.instancePath, (0, t.strConcat)(n.default.instancePath, R)];
+    const T = m ? (0, t.str)`${g}${(0, r.getErrorPath)(m, r.Type.Str)}` : g;
+    return [n.default.instancePath, (0, t.strConcat)(n.default.instancePath, T)];
   }
-  function T({ keyword: g, it: { errSchemaPath: m } }, { schemaPath: R, parentSchema: S }) {
+  function R({ keyword: g, it: { errSchemaPath: m } }, { schemaPath: T, parentSchema: S }) {
     let I = S ? m : (0, t.str)`${m}/${g}`;
-    return R && (I = (0, t.str)`${I}${(0, r.getErrorPath)(R, r.Type.Str)}`), [p.schemaPath, I];
+    return T && (I = (0, t.str)`${I}${(0, r.getErrorPath)(T, r.Type.Str)}`), [p.schemaPath, I];
   }
-  function v(g, { params: m, message: R }, S) {
-    const { keyword: I, data: D, schemaValue: w, it: k } = g, { opts: A, propertyName: V, topSchemaRef: x, schemaPath: re } = k;
-    S.push([p.keyword, I], [p.params, typeof m == "function" ? m(g) : m || (0, t._)`{}`]), A.messages && S.push([p.message, typeof R == "function" ? R(g) : R]), A.verbose && S.push([p.schema, w], [p.parentSchema, (0, t._)`${x}${re}`], [n.default.data, D]), V && S.push([p.propertyName, V]);
+  function v(g, { params: m, message: T }, S) {
+    const { keyword: I, data: A, schemaValue: w, it: k } = g, { opts: D, propertyName: V, topSchemaRef: x, schemaPath: re } = k;
+    S.push([p.keyword, I], [p.params, typeof m == "function" ? m(g) : m || (0, t._)`{}`]), D.messages && S.push([p.message, typeof T == "function" ? T(g) : T]), D.verbose && S.push([p.schema, w], [p.parentSchema, (0, t._)`${x}${re}`], [n.default.data, A]), V && S.push([p.propertyName, V]);
   }
 })(errors);
 Object.defineProperty(boolSchema, "__esModule", { value: !0 });
@@ -4099,11 +4109,11 @@ applicability.shouldUseRule = shouldUseRule;
   }
   e.getJSONTypes = d;
   function u(S, I) {
-    const { gen: D, data: w, opts: k } = S, A = $(I, k.coerceTypes), V = I.length > 0 && !(A.length === 0 && I.length === 1 && (0, r.schemaHasRulesForType)(S, I[0]));
+    const { gen: A, data: w, opts: k } = S, D = $(I, k.coerceTypes), V = I.length > 0 && !(D.length === 0 && I.length === 1 && (0, r.schemaHasRulesForType)(S, I[0]));
     if (V) {
       const x = v(I, w, k.strictNumbers, o.Wrong);
-      D.if(x, () => {
-        A.length ? O(S, I, A) : m(S);
+      A.if(x, () => {
+        D.length ? O(S, I, D) : m(S);
       });
     }
     return V;
@@ -4111,13 +4121,13 @@ applicability.shouldUseRule = shouldUseRule;
   e.coerceAndCheckDataType = u;
   const p = /* @__PURE__ */ new Set(["string", "number", "integer", "boolean", "null"]);
   function $(S, I) {
-    return I ? S.filter((D) => p.has(D) || I === "array" && D === "array") : [];
+    return I ? S.filter((A) => p.has(A) || I === "array" && A === "array") : [];
   }
-  function O(S, I, D) {
-    const { gen: w, data: k, opts: A } = S, V = w.let("dataType", (0, s._)`typeof ${k}`), x = w.let("coerced", (0, s._)`undefined`);
-    A.coerceTypes === "array" && w.if((0, s._)`${V} == 'object' && Array.isArray(${k}) && ${k}.length == 1`, () => w.assign(k, (0, s._)`${k}[0]`).assign(V, (0, s._)`typeof ${k}`).if(v(I, k, A.strictNumbers), () => w.assign(x, k))), w.if((0, s._)`${x} !== undefined`);
-    for (const K of D)
-      (p.has(K) || K === "array" && A.coerceTypes === "array") && re(K);
+  function O(S, I, A) {
+    const { gen: w, data: k, opts: D } = S, V = w.let("dataType", (0, s._)`typeof ${k}`), x = w.let("coerced", (0, s._)`undefined`);
+    D.coerceTypes === "array" && w.if((0, s._)`${V} == 'object' && Array.isArray(${k}) && ${k}.length == 1`, () => w.assign(k, (0, s._)`${k}[0]`).assign(V, (0, s._)`typeof ${k}`).if(v(I, k, D.strictNumbers), () => w.assign(x, k))), w.if((0, s._)`${x} !== undefined`);
+    for (const K of A)
+      (p.has(K) || K === "array" && D.coerceTypes === "array") && re(K);
     w.else(), m(S), w.endIf(), w.if((0, s._)`${x} !== undefined`, () => {
       w.assign(k, x), N(S, x);
     });
@@ -4146,49 +4156,49 @@ applicability.shouldUseRule = shouldUseRule;
       }
     }
   }
-  function N({ gen: S, parentData: I, parentDataProperty: D }, w) {
-    S.if((0, s._)`${I} !== undefined`, () => S.assign((0, s._)`${I}[${D}]`, w));
+  function N({ gen: S, parentData: I, parentDataProperty: A }, w) {
+    S.if((0, s._)`${I} !== undefined`, () => S.assign((0, s._)`${I}[${A}]`, w));
   }
-  function T(S, I, D, w = o.Correct) {
+  function R(S, I, A, w = o.Correct) {
     const k = w === o.Correct ? s.operators.EQ : s.operators.NEQ;
-    let A;
+    let D;
     switch (S) {
       case "null":
         return (0, s._)`${I} ${k} null`;
       case "array":
-        A = (0, s._)`Array.isArray(${I})`;
+        D = (0, s._)`Array.isArray(${I})`;
         break;
       case "object":
-        A = (0, s._)`${I} && typeof ${I} == "object" && !Array.isArray(${I})`;
+        D = (0, s._)`${I} && typeof ${I} == "object" && !Array.isArray(${I})`;
         break;
       case "integer":
-        A = V((0, s._)`!(${I} % 1) && !isNaN(${I})`);
+        D = V((0, s._)`!(${I} % 1) && !isNaN(${I})`);
         break;
       case "number":
-        A = V();
+        D = V();
         break;
       default:
         return (0, s._)`typeof ${I} ${k} ${S}`;
     }
-    return w === o.Correct ? A : (0, s.not)(A);
+    return w === o.Correct ? D : (0, s.not)(D);
     function V(x = s.nil) {
-      return (0, s.and)((0, s._)`typeof ${I} == "number"`, x, D ? (0, s._)`isFinite(${I})` : s.nil);
+      return (0, s.and)((0, s._)`typeof ${I} == "number"`, x, A ? (0, s._)`isFinite(${I})` : s.nil);
     }
   }
-  e.checkDataType = T;
-  function v(S, I, D, w) {
+  e.checkDataType = R;
+  function v(S, I, A, w) {
     if (S.length === 1)
-      return T(S[0], I, D, w);
+      return R(S[0], I, A, w);
     let k;
-    const A = (0, i.toHash)(S);
-    if (A.array && A.object) {
+    const D = (0, i.toHash)(S);
+    if (D.array && D.object) {
       const V = (0, s._)`typeof ${I} != "object"`;
-      k = A.null ? V : (0, s._)`!${I} || ${V}`, delete A.null, delete A.array, delete A.object;
+      k = D.null ? V : (0, s._)`!${I} || ${V}`, delete D.null, delete D.array, delete D.object;
     } else
       k = s.nil;
-    A.number && delete A.integer;
-    for (const V in A)
-      k = (0, s.and)(k, T(V, I, D, w));
+    D.number && delete D.integer;
+    for (const V in D)
+      k = (0, s.and)(k, R(V, I, A, w));
     return k;
   }
   e.checkDataTypes = v;
@@ -4197,16 +4207,16 @@ applicability.shouldUseRule = shouldUseRule;
     params: ({ schema: S, schemaValue: I }) => typeof S == "string" ? (0, s._)`{type: ${S}}` : (0, s._)`{type: ${I}}`
   };
   function m(S) {
-    const I = R(S);
+    const I = T(S);
     (0, n.reportError)(I, g);
   }
   e.reportTypeError = m;
-  function R(S) {
-    const { gen: I, data: D, schema: w } = S, k = (0, i.schemaRefOrVal)(S, w, "type");
+  function T(S) {
+    const { gen: I, data: A, schema: w } = S, k = (0, i.schemaRefOrVal)(S, w, "type");
     return {
       gen: I,
       keyword: "type",
-      data: D,
+      data: A,
       schema: w.type,
       schemaCode: k,
       schemaValue: k,
@@ -4374,25 +4384,25 @@ function funcKeywordCode(e, t) {
     if (t.errors === !1)
       v(), t.modifying && modifyData(e), g(() => e.error());
     else {
-      const m = t.async ? N() : T();
+      const m = t.async ? N() : R();
       t.modifying && modifyData(e), g(() => addErrs(e, m));
     }
   }
   function N() {
     const m = n.let("ruleErrs", null);
-    return n.try(() => v((0, codegen_1$p._)`await `), (R) => n.assign($, !1).if((0, codegen_1$p._)`${R} instanceof ${d.ValidationError}`, () => n.assign(m, (0, codegen_1$p._)`${R}.errors`), () => n.throw(R))), m;
+    return n.try(() => v((0, codegen_1$p._)`await `), (T) => n.assign($, !1).if((0, codegen_1$p._)`${T} instanceof ${d.ValidationError}`, () => n.assign(m, (0, codegen_1$p._)`${T}.errors`), () => n.throw(T))), m;
   }
-  function T() {
+  function R() {
     const m = (0, codegen_1$p._)`${p}.errors`;
     return n.assign(m, null), v(codegen_1$p.nil), m;
   }
   function v(m = t.async ? (0, codegen_1$p._)`await ` : codegen_1$p.nil) {
-    const R = d.opts.passContext ? names_1$4.default.this : names_1$4.default.self, S = !("compile" in t && !l || t.schema === !1);
-    n.assign($, (0, codegen_1$p._)`${m}${(0, code_1$9.callValidateCode)(e, p, R, S)}`, t.modifying);
+    const T = d.opts.passContext ? names_1$4.default.this : names_1$4.default.self, S = !("compile" in t && !l || t.schema === !1);
+    n.assign($, (0, codegen_1$p._)`${m}${(0, code_1$9.callValidateCode)(e, p, T, S)}`, t.modifying);
   }
   function g(m) {
-    var R;
-    n.if((0, codegen_1$p.not)((R = t.valid) !== null && R !== void 0 ? R : $), m);
+    var T;
+    n.if((0, codegen_1$p.not)((T = t.valid) !== null && T !== void 0 ? T : $), m);
   }
 }
 keyword.funcKeywordCode = funcKeywordCode;
@@ -4671,21 +4681,21 @@ function getSchemaRefs(e, t) {
   if (typeof e == "boolean")
     return {};
   const { schemaId: r, uriResolver: n } = this.opts, s = normalizeId(e[r] || t), i = { "": s }, o = getFullPath(n, s, !1), l = {}, d = /* @__PURE__ */ new Set();
-  return traverse(e, { allKeys: !0 }, ($, O, N, T) => {
-    if (T === void 0)
+  return traverse(e, { allKeys: !0 }, ($, O, N, R) => {
+    if (R === void 0)
       return;
     const v = o + O;
-    let g = i[T];
-    typeof $[r] == "string" && (g = m.call(this, $[r])), R.call(this, $.$anchor), R.call(this, $.$dynamicAnchor), i[O] = g;
+    let g = i[R];
+    typeof $[r] == "string" && (g = m.call(this, $[r])), T.call(this, $.$anchor), T.call(this, $.$dynamicAnchor), i[O] = g;
     function m(S) {
       const I = this.opts.uriResolver.resolve;
       if (S = normalizeId(g ? I(g, S) : S), d.has(S))
         throw p(S);
       d.add(S);
-      let D = this.refs[S];
-      return typeof D == "string" && (D = this.refs[D]), typeof D == "object" ? u($, D.schema, S) : S !== normalizeId(v) && (S[0] === "#" ? (u($, l[S], S), l[S] = $) : this.refs[S] = v), S;
+      let A = this.refs[S];
+      return typeof A == "string" && (A = this.refs[A]), typeof A == "object" ? u($, A.schema, S) : S !== normalizeId(v) && (S[0] === "#" ? (u($, l[S], S), l[S] = $) : this.refs[S] = v), S;
     }
-    function R(S) {
+    function T(S) {
       if (typeof S == "string") {
         if (!ANCHOR.test(S))
           throw new Error(`invalid anchor "${S}"`);
@@ -5085,11 +5095,11 @@ function compileSchema(e) {
     p = `${o.scopeRefs(names_1$2.default.scope)}return ${$}`, this.opts.code.process && (p = this.opts.code.process(p, e));
     const N = new Function(`${names_1$2.default.self}`, `${names_1$2.default.scope}`, p)(this, this.scope.get());
     if (this.scope.value(d, { ref: N }), N.errors = null, N.schema = e.schema, N.schemaEnv = e, e.$async && (N.$async = !0), this.opts.code.source === !0 && (N.source = { validateName: d, validateCode: $, scopeValues: o._values }), this.opts.unevaluated) {
-      const { props: T, items: v } = u;
+      const { props: R, items: v } = u;
       N.evaluated = {
-        props: T instanceof codegen_1$m.Name ? void 0 : T,
+        props: R instanceof codegen_1$m.Name ? void 0 : R,
         items: v instanceof codegen_1$m.Name ? void 0 : v,
-        dynamicProps: T instanceof codegen_1$m.Name,
+        dynamicProps: R instanceof codegen_1$m.Name,
         dynamicItems: v instanceof codegen_1$m.Name
       }, N.source && (N.source.evaluated = (0, codegen_1$m.stringify)(N.evaluated));
     }
@@ -5296,7 +5306,7 @@ var uri$1 = {}, uri_all = { exports: {} };
         return _;
       } else
         return Array.from(f);
-    }, T = 2147483647, v = 36, g = 1, m = 26, R = 38, S = 700, I = 72, D = 128, w = "-", k = /^xn--/, A = /[^\0-\x7E]/, V = /[\x2E\u3002\uFF0E\uFF61]/g, x = {
+    }, R = 2147483647, v = 36, g = 1, m = 26, T = 38, S = 700, I = 72, A = 128, w = "-", k = /^xn--/, D = /[^\0-\x7E]/, V = /[\x2E\u3002\uFF0E\uFF61]/g, x = {
       overflow: "Overflow: input needs wider integers to process",
       "not-basic": "Illegal input >= 0x80 (not a basic code point)",
       "invalid-input": "Invalid input"
@@ -5341,9 +5351,9 @@ var uri$1 = {}, uri_all = { exports: {} };
         b += v
       )
         c = K(c / re);
-      return K(b + (re + 1) * c / (c + R));
+      return K(b + (re + 1) * c / (c + T));
     }, j = function(c) {
-      var _ = [], E = c.length, b = 0, U = D, L = I, J = c.lastIndexOf(w);
+      var _ = [], E = c.length, b = 0, U = A, L = I, J = c.lastIndexOf(w);
       J < 0 && (J = 0);
       for (var Y = 0; Y < J; ++Y)
         c.charCodeAt(Y) >= 128 && oe("not-basic"), _.push(c.charCodeAt(Y));
@@ -5356,21 +5366,21 @@ var uri$1 = {}, uri_all = { exports: {} };
         ) {
           se >= E && oe("invalid-input");
           var z = Ue(c.charCodeAt(se++));
-          (z >= v || z > K((T - b) / Z)) && oe("overflow"), b += z * Z;
+          (z >= v || z > K((R - b) / Z)) && oe("overflow"), b += z * Z;
           var X = ie <= L ? g : ie >= L + m ? m : ie - L;
           if (z < X)
             break;
           var ae = v - X;
-          Z > K(T / ae) && oe("overflow"), Z *= ae;
+          Z > K(R / ae) && oe("overflow"), Z *= ae;
         }
         var ee = _.length + 1;
-        L = y(b - B, ee, B == 0), K(b / ee) > T - U && oe("overflow"), U += K(b / ee), b %= ee, _.splice(b++, 0, U);
+        L = y(b - B, ee, B == 0), K(b / ee) > R - U && oe("overflow"), U += K(b / ee), b %= ee, _.splice(b++, 0, U);
       }
       return String.fromCodePoint.apply(String, _);
     }, P = function(c) {
       var _ = [];
       c = qe(c);
-      var E = c.length, b = D, U = 0, L = I, J = !0, Y = !1, se = void 0;
+      var E = c.length, b = A, U = 0, L = I, J = !0, Y = !1, se = void 0;
       try {
         for (var B = c[Symbol.iterator](), Z; !(J = (Z = B.next()).done); J = !0) {
           var ie = Z.value;
@@ -5388,7 +5398,7 @@ var uri$1 = {}, uri_all = { exports: {} };
       }
       var z = _.length, X = z;
       for (z && _.push(w); X < E; ) {
-        var ae = T, ee = !0, Se = !1, $e = void 0;
+        var ae = R, ee = !0, Se = !1, $e = void 0;
         try {
           for (var ge = c[Symbol.iterator](), Be; !(ee = (Be = ge.next()).done); ee = !0) {
             var Ie = Be.value;
@@ -5405,12 +5415,12 @@ var uri$1 = {}, uri_all = { exports: {} };
           }
         }
         var fe = X + 1;
-        ae - b > K((T - U) / fe) && oe("overflow"), U += (ae - b) * fe, b = ae;
+        ae - b > K((R - U) / fe) && oe("overflow"), U += (ae - b) * fe, b = ae;
         var ye = !0, je = !1, we = void 0;
         try {
           for (var ct = c[Symbol.iterator](), Lt; !(ye = (Lt = ct.next()).done); ye = !0) {
             var Ht = Lt.value;
-            if (Ht < b && ++U > T && oe("overflow"), Ht == b) {
+            if (Ht < b && ++U > R && oe("overflow"), Ht == b) {
               for (
                 var pt = U, ft = v;
                 ;
@@ -5445,7 +5455,7 @@ var uri$1 = {}, uri_all = { exports: {} };
       });
     }, h = function(c) {
       return Oe(c, function(_) {
-        return A.test(_) ? "xn--" + P(_) : _;
+        return D.test(_) ? "xn--" + P(_) : _;
       });
     }, C = {
       /**
@@ -5657,12 +5667,12 @@ var uri$1 = {}, uri_all = { exports: {} };
         }
         return c.fragment = void 0, c;
       }
-    }, At = {
+    }, Dt = {
       scheme: "wss",
       domainHost: at.domainHost,
       parse: at.parse,
       serialize: at.serialize
-    }, ir = {}, Dt = "[A-Za-z0-9\\-\\.\\_\\~\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]", _e = "[0-9A-Fa-f]", or = s(s("%[EFef]" + _e + "%" + _e + _e + "%" + _e + _e) + "|" + s("%[89A-Fa-f]" + _e + "%" + _e + _e) + "|" + s("%" + _e + _e)), ar = "[A-Za-z0-9\\!\\$\\%\\'\\*\\+\\-\\^\\_\\`\\{\\|\\}\\~]", cr = "[\\!\\$\\%\\'\\(\\)\\*\\+\\,\\-\\.0-9\\<\\>A-Z\\x5E-\\x7E]", lr = n(cr, '[\\"\\\\]'), dr = "[\\!\\$\\'\\(\\)\\*\\+\\,\\;\\:\\@]", ur = new RegExp(Dt, "g"), We = new RegExp(or, "g"), pr = new RegExp(n("[^]", ar, "[\\.]", '[\\"]', lr), "g"), Ft = new RegExp(n("[^]", Dt, dr), "g"), fr = Ft;
+    }, ir = {}, At = "[A-Za-z0-9\\-\\.\\_\\~\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]", _e = "[0-9A-Fa-f]", or = s(s("%[EFef]" + _e + "%" + _e + _e + "%" + _e + _e) + "|" + s("%[89A-Fa-f]" + _e + "%" + _e + _e) + "|" + s("%" + _e + _e)), ar = "[A-Za-z0-9\\!\\$\\%\\'\\*\\+\\-\\^\\_\\`\\{\\|\\}\\~]", cr = "[\\!\\$\\%\\'\\(\\)\\*\\+\\,\\-\\.0-9\\<\\>A-Z\\x5E-\\x7E]", lr = n(cr, '[\\"\\\\]'), dr = "[\\!\\$\\'\\(\\)\\*\\+\\,\\;\\:\\@]", ur = new RegExp(At, "g"), We = new RegExp(or, "g"), pr = new RegExp(n("[^]", ar, "[\\.]", '[\\"]', lr), "g"), Ft = new RegExp(n("[^]", At, dr), "g"), fr = Ft;
     function Ct(f) {
       var c = W(f);
       return c.match(ur) ? c : f;
@@ -5756,7 +5766,7 @@ var uri$1 = {}, uri_all = { exports: {} };
         return E.nss = (c.uuid || "").toLowerCase(), E;
       }
     };
-    M[Ne.scheme] = Ne, M[It.scheme] = It, M[at.scheme] = at, M[At.scheme] = At, M[Mt.scheme] = Mt, M[qt.scheme] = qt, M[Ut.scheme] = Ut, r.SCHEMES = M, r.pctEncChar = q, r.pctDecChars = W, r.parse = de, r.removeDotSegments = me, r.serialize = le, r.resolveComponents = xe, r.resolve = it, r.normalize = Ce, r.equal = ot, r.escapeComponent = ut, r.unescapeComponent = pe, Object.defineProperty(r, "__esModule", { value: !0 });
+    M[Ne.scheme] = Ne, M[It.scheme] = It, M[at.scheme] = at, M[Dt.scheme] = Dt, M[Mt.scheme] = Mt, M[qt.scheme] = qt, M[Ut.scheme] = Ut, r.SCHEMES = M, r.pctEncChar = q, r.pctDecChars = W, r.parse = de, r.removeDotSegments = me, r.serialize = le, r.resolveComponents = xe, r.resolve = it, r.normalize = Ce, r.equal = ot, r.escapeComponent = ut, r.unescapeComponent = pe, Object.defineProperty(r, "__esModule", { value: !0 });
   });
 })(uri_all, uri_all.exports);
 var uri_allExports = uri_all.exports;
@@ -5786,7 +5796,7 @@ uri$1.default = uri;
   } });
   const n = validation_error, s = ref_error, i = rules, o = compile, l = codegen, d = resolve$1, u = dataType, p = util, $ = require$$9, O = uri$1, N = (F, y) => new RegExp(F, y);
   N.code = "new RegExp";
-  const T = ["removeAdditional", "useDefaults", "coerceTypes"], v = /* @__PURE__ */ new Set([
+  const R = ["removeAdditional", "useDefaults", "coerceTypes"], v = /* @__PURE__ */ new Set([
     "validate",
     "serialize",
     "parse",
@@ -5820,7 +5830,7 @@ uri$1.default = uri;
     ignoreKeywordsWithRef: "",
     jsPropertySyntax: "",
     unicode: '"minLength"/"maxLength" account for unicode characters by default.'
-  }, R = 200;
+  }, T = 200;
   function S(F) {
     var y, j, P, a, h, C, M, q, W, G, ne, he, Le, tt, rt, de, nt, He, Ve, ze, st, me, le, xe, it;
     const Ce = F.strict, ot = (y = F.code) === null || y === void 0 ? void 0 : y.optimize, ut = ot === !0 || ot === void 0 ? 1 : ot || 0, pe = (P = (j = F.code) === null || j === void 0 ? void 0 : j.regExp) !== null && P !== void 0 ? P : N, Ne = (a = F.uriResolver) !== null && a !== void 0 ? a : O.default;
@@ -5831,8 +5841,8 @@ uri$1.default = uri;
       strictTuples: (he = (ne = F.strictTuples) !== null && ne !== void 0 ? ne : Ce) !== null && he !== void 0 ? he : "log",
       strictRequired: (tt = (Le = F.strictRequired) !== null && Le !== void 0 ? Le : Ce) !== null && tt !== void 0 ? tt : !1,
       code: F.code ? { ...F.code, optimize: ut, regExp: pe } : { optimize: ut, regExp: pe },
-      loopRequired: (rt = F.loopRequired) !== null && rt !== void 0 ? rt : R,
-      loopEnum: (de = F.loopEnum) !== null && de !== void 0 ? de : R,
+      loopRequired: (rt = F.loopRequired) !== null && rt !== void 0 ? rt : T,
+      loopEnum: (de = F.loopEnum) !== null && de !== void 0 ? de : T,
       meta: (nt = F.meta) !== null && nt !== void 0 ? nt : !0,
       messages: (He = F.messages) !== null && He !== void 0 ? He : !0,
       inlineRefs: (Ve = F.inlineRefs) !== null && Ve !== void 0 ? Ve : !0,
@@ -5851,7 +5861,7 @@ uri$1.default = uri;
       const { es5: j, lines: P } = this.opts.code;
       this.scope = new l.ValueScope({ scope: {}, prefixes: v, es5: j, lines: P }), this.logger = K(y.logger);
       const a = y.validateFormats;
-      y.validateFormats = !1, this.RULES = (0, i.getRules)(), D.call(this, g, y, "NOT SUPPORTED"), D.call(this, m, y, "DEPRECATED", "warn"), this._metaOpts = x.call(this), y.formats && A.call(this), this._addVocabularies(), this._addDefaultMetaSchema(), y.keywords && V.call(this, y.keywords), typeof y.meta == "object" && this.addMetaSchema(y.meta), k.call(this), y.validateFormats = a;
+      y.validateFormats = !1, this.RULES = (0, i.getRules)(), A.call(this, g, y, "NOT SUPPORTED"), A.call(this, m, y, "DEPRECATED", "warn"), this._metaOpts = x.call(this), y.formats && D.call(this), this._addVocabularies(), this._addDefaultMetaSchema(), y.keywords && V.call(this, y.keywords), typeof y.meta == "object" && this.addMetaSchema(y.meta), k.call(this), y.validateFormats = a;
     }
     _addVocabularies() {
       this.addKeyword("$async");
@@ -6105,7 +6115,7 @@ uri$1.default = uri;
     }
   }
   e.default = I, I.ValidationError = n.default, I.MissingRefError = s.default;
-  function D(F, y, j, P = "error") {
+  function A(F, y, j, P = "error") {
     for (const a in F) {
       const h = a;
       h in y && this.logger[P](`${j}: option ${a}. ${F[h]}`);
@@ -6123,7 +6133,7 @@ uri$1.default = uri;
         for (const y in F)
           this.addSchema(F[y], y);
   }
-  function A() {
+  function D() {
     for (const F in this.opts.formats) {
       const y = this.opts.formats[F];
       y && this.addFormat(F, y);
@@ -6142,7 +6152,7 @@ uri$1.default = uri;
   }
   function x() {
     const F = { ...this.opts };
-    for (const y of T)
+    for (const y of R)
       delete F[y];
     return F;
   }
@@ -6232,16 +6242,16 @@ const ref_error_1 = ref_error, code_1$8 = code, codegen_1$l = codegen, names_1$1
     function $() {
       if (i === u)
         return callRef(e, o, i, i.$async);
-      const T = t.scopeValue("root", { ref: u });
-      return callRef(e, (0, codegen_1$l._)`${T}.validate`, u, u.$async);
+      const R = t.scopeValue("root", { ref: u });
+      return callRef(e, (0, codegen_1$l._)`${R}.validate`, u, u.$async);
     }
-    function O(T) {
-      const v = getValidate(e, T);
-      callRef(e, v, T, T.$async);
+    function O(R) {
+      const v = getValidate(e, R);
+      callRef(e, v, R, R.$async);
     }
-    function N(T) {
-      const v = t.scopeValue("schema", l.code.source === !0 ? { ref: T, code: (0, codegen_1$l.stringify)(T) } : { ref: T }), g = t.name("valid"), m = e.subschema({
-        schema: T,
+    function N(R) {
+      const v = t.scopeValue("schema", l.code.source === !0 ? { ref: R, code: (0, codegen_1$l.stringify)(R) } : { ref: R }), g = t.name("valid"), m = e.subschema({
+        schema: R,
         dataTypes: [],
         schemaPath: codegen_1$l.nil,
         topSchemaRef: v,
@@ -6262,21 +6272,21 @@ function callRef(e, t, r, n) {
   function p() {
     if (!l.$async)
       throw new Error("async schema referenced by sync schema");
-    const T = s.let("valid");
+    const R = s.let("valid");
     s.try(() => {
-      s.code((0, codegen_1$l._)`await ${(0, code_1$8.callValidateCode)(e, t, u)}`), N(t), o || s.assign(T, !0);
+      s.code((0, codegen_1$l._)`await ${(0, code_1$8.callValidateCode)(e, t, u)}`), N(t), o || s.assign(R, !0);
     }, (v) => {
-      s.if((0, codegen_1$l._)`!(${v} instanceof ${i.ValidationError})`, () => s.throw(v)), O(v), o || s.assign(T, !1);
-    }), e.ok(T);
+      s.if((0, codegen_1$l._)`!(${v} instanceof ${i.ValidationError})`, () => s.throw(v)), O(v), o || s.assign(R, !1);
+    }), e.ok(R);
   }
   function $() {
     e.result((0, code_1$8.callValidateCode)(e, t, u), () => N(t), () => O(t));
   }
-  function O(T) {
-    const v = (0, codegen_1$l._)`${T}.errors`;
+  function O(R) {
+    const v = (0, codegen_1$l._)`${R}.errors`;
     s.assign(names_1$1.default.vErrors, (0, codegen_1$l._)`${names_1$1.default.vErrors} === null ? ${v} : ${names_1$1.default.vErrors}.concat(${v})`), s.assign(names_1$1.default.errors, (0, codegen_1$l._)`${names_1$1.default.vErrors}.length`);
   }
-  function N(T) {
+  function N(R) {
     var v;
     if (!i.opts.unevaluated)
       return;
@@ -6285,14 +6295,14 @@ function callRef(e, t, r, n) {
       if (g && !g.dynamicProps)
         g.props !== void 0 && (i.props = util_1$j.mergeEvaluated.props(s, g.props, i.props));
       else {
-        const m = s.var("props", (0, codegen_1$l._)`${T}.evaluated.props`);
+        const m = s.var("props", (0, codegen_1$l._)`${R}.evaluated.props`);
         i.props = util_1$j.mergeEvaluated.props(s, m, i.props, codegen_1$l.Name);
       }
     if (i.items !== !0)
       if (g && !g.dynamicItems)
         g.items !== void 0 && (i.items = util_1$j.mergeEvaluated.items(s, g.items, i.items));
       else {
-        const m = s.var("items", (0, codegen_1$l._)`${T}.evaluated.items`);
+        const m = s.var("items", (0, codegen_1$l._)`${R}.evaluated.items`);
         i.items = util_1$j.mergeEvaluated.items(s, m, i.items, codegen_1$l.Name);
       }
   }
@@ -6434,9 +6444,9 @@ const code_1$6 = code, codegen_1$f = codegen, util_1$h = util, error$d = {
       return;
     const d = r.length >= l.loopRequired;
     if (o.allErrors ? u() : p(), l.strictRequired) {
-      const N = e.parentSchema.properties, { definedProperties: T } = e.it;
+      const N = e.parentSchema.properties, { definedProperties: R } = e.it;
       for (const v of r)
-        if ((N == null ? void 0 : N[v]) === void 0 && !T.has(v)) {
+        if ((N == null ? void 0 : N[v]) === void 0 && !R.has(v)) {
           const g = o.schemaEnv.baseId + o.errSchemaPath, m = `required property "${v}" is not defined at "${g}" (strictRequired)`;
           (0, util_1$h.checkStrictMode)(o, m, o.opts.strictRequired);
         }
@@ -6451,8 +6461,8 @@ const code_1$6 = code, codegen_1$f = codegen, util_1$h = util, error$d = {
     function p() {
       const N = t.let("missing");
       if (d || i) {
-        const T = t.let("valid", !0);
-        e.block$data(T, () => O(N, T)), e.ok(T);
+        const R = t.let("valid", !0);
+        e.block$data(R, () => O(N, R)), e.ok(R);
       } else
         t.if((0, code_1$6.checkMissingProp)(e, r, N)), (0, code_1$6.reportMissingProp)(e, N), t.else();
     }
@@ -6461,9 +6471,9 @@ const code_1$6 = code, codegen_1$f = codegen, util_1$h = util, error$d = {
         e.setParams({ missingProperty: N }), t.if((0, code_1$6.noPropertyInData)(t, s, N, l.ownProperties), () => e.error());
       });
     }
-    function O(N, T) {
+    function O(N, R) {
       e.setParams({ missingProperty: N }), t.forOf(N, n, () => {
-        t.assign(T, (0, code_1$6.propertyInData)(t, s, N, l.ownProperties)), t.if((0, codegen_1$f.not)(T), () => {
+        t.assign(R, (0, code_1$6.propertyInData)(t, s, N, l.ownProperties)), t.if((0, codegen_1$f.not)(R), () => {
           e.error(), t.break();
         });
       }, codegen_1$f.nil);
@@ -6513,23 +6523,23 @@ const dataType_1 = dataType, codegen_1$d = codegen, util_1$g = util, equal_1$2 =
     const d = t.let("valid"), u = i.items ? (0, dataType_1.getSchemaTypes)(i.items) : [];
     e.block$data(d, p, (0, codegen_1$d._)`${o} === false`), e.ok(d);
     function p() {
-      const T = t.let("i", (0, codegen_1$d._)`${r}.length`), v = t.let("j");
-      e.setParams({ i: T, j: v }), t.assign(d, !0), t.if((0, codegen_1$d._)`${T} > 1`, () => ($() ? O : N)(T, v));
+      const R = t.let("i", (0, codegen_1$d._)`${r}.length`), v = t.let("j");
+      e.setParams({ i: R, j: v }), t.assign(d, !0), t.if((0, codegen_1$d._)`${R} > 1`, () => ($() ? O : N)(R, v));
     }
     function $() {
-      return u.length > 0 && !u.some((T) => T === "object" || T === "array");
-    }
-    function O(T, v) {
-      const g = t.name("item"), m = (0, dataType_1.checkDataTypes)(u, g, l.opts.strictNumbers, dataType_1.DataType.Wrong), R = t.const("indices", (0, codegen_1$d._)`{}`);
-      t.for((0, codegen_1$d._)`;${T}--;`, () => {
-        t.let(g, (0, codegen_1$d._)`${r}[${T}]`), t.if(m, (0, codegen_1$d._)`continue`), u.length > 1 && t.if((0, codegen_1$d._)`typeof ${g} == "string"`, (0, codegen_1$d._)`${g} += "_"`), t.if((0, codegen_1$d._)`typeof ${R}[${g}] == "number"`, () => {
-          t.assign(v, (0, codegen_1$d._)`${R}[${g}]`), e.error(), t.assign(d, !1).break();
-        }).code((0, codegen_1$d._)`${R}[${g}] = ${T}`);
+      return u.length > 0 && !u.some((R) => R === "object" || R === "array");
+    }
+    function O(R, v) {
+      const g = t.name("item"), m = (0, dataType_1.checkDataTypes)(u, g, l.opts.strictNumbers, dataType_1.DataType.Wrong), T = t.const("indices", (0, codegen_1$d._)`{}`);
+      t.for((0, codegen_1$d._)`;${R}--;`, () => {
+        t.let(g, (0, codegen_1$d._)`${r}[${R}]`), t.if(m, (0, codegen_1$d._)`continue`), u.length > 1 && t.if((0, codegen_1$d._)`typeof ${g} == "string"`, (0, codegen_1$d._)`${g} += "_"`), t.if((0, codegen_1$d._)`typeof ${T}[${g}] == "number"`, () => {
+          t.assign(v, (0, codegen_1$d._)`${T}[${g}]`), e.error(), t.assign(d, !1).break();
+        }).code((0, codegen_1$d._)`${T}[${g}] = ${R}`);
       });
     }
-    function N(T, v) {
+    function N(R, v) {
       const g = (0, util_1$g.useFunc)(t, equal_1$2.default), m = t.name("outer");
-      t.label(m).for((0, codegen_1$d._)`;${T}--;`, () => t.for((0, codegen_1$d._)`${v} = ${T}; ${v}--;`, () => t.if((0, codegen_1$d._)`${g}(${r}[${T}], ${r}[${v}])`, () => {
+      t.label(m).for((0, codegen_1$d._)`;${R}--;`, () => t.for((0, codegen_1$d._)`${v} = ${R}; ${v}--;`, () => t.if((0, codegen_1$d._)`${g}(${r}[${R}], ${r}[${v}])`, () => {
         e.error(), t.assign(d, !1).break(m);
       })));
     }
@@ -6575,15 +6585,15 @@ const codegen_1$b = codegen, util_1$e = util, equal_1 = equal$1, error$9 = {
       if (!Array.isArray(s))
         throw new Error("ajv implementation error");
       const N = t.const("vSchema", i);
-      p = (0, codegen_1$b.or)(...s.map((T, v) => O(N, v)));
+      p = (0, codegen_1$b.or)(...s.map((R, v) => O(N, v)));
     }
     e.pass(p);
     function $() {
       t.assign(p, !1), t.forOf("v", i, (N) => t.if((0, codegen_1$b._)`${u()}(${r}, ${N})`, () => t.assign(p, !0).break()));
     }
-    function O(N, T) {
-      const v = s[T];
-      return typeof v == "object" && v !== null ? (0, codegen_1$b._)`${u()}(${r}, ${N}[${T}])` : (0, codegen_1$b._)`${r} === ${v}`;
+    function O(N, R) {
+      const v = s[R];
+      return typeof v == "object" && v !== null ? (0, codegen_1$b._)`${u()}(${r}, ${N}[${R}])` : (0, codegen_1$b._)`${r} === ${v}`;
     }
   }
 };
@@ -6675,9 +6685,9 @@ function validateTuple(e, t, r = e.schema) {
     }, d)), e.ok(d));
   });
   function p($) {
-    const { opts: O, errSchemaPath: N } = l, T = r.length, v = T === $.minItems && (T === $.maxItems || $[t] === !1);
+    const { opts: O, errSchemaPath: N } = l, R = r.length, v = R === $.minItems && (R === $.maxItems || $[t] === !1);
     if (O.strictTuples && !v) {
-      const g = `"${o}" is ${T}-tuple, but minItems or maxItems/${t} are not specified or different at path "${N}"`;
+      const g = `"${o}" is ${R}-tuple, but minItems or maxItems/${t} are not specified or different at path "${N}"`;
       (0, util_1$c.checkStrictMode)(l, g, O.strictTuples);
     }
   }
@@ -6746,7 +6756,7 @@ const codegen_1$7 = codegen, util_1$a = util, error$6 = {
     l === void 0 && o === 1 ? N($, () => t.if($, () => t.break())) : o === 0 ? (t.let($, !0), l !== void 0 && t.if((0, codegen_1$7._)`${s}.length > 0`, O)) : (t.let($, !1), O()), e.result($, () => e.reset());
     function O() {
       const v = t.name("_valid"), g = t.let("count", 0);
-      N(v, () => t.if(v, () => T(g)));
+      N(v, () => t.if(v, () => R(g)));
     }
     function N(v, g) {
       t.forRange("i", 0, p, (m) => {
@@ -6758,7 +6768,7 @@ const codegen_1$7 = codegen, util_1$a = util, error$6 = {
         }, v), g();
       });
     }
-    function T(v) {
+    function R(v) {
       t.code((0, codegen_1$7._)`${v}++`), l === void 0 ? t.if((0, codegen_1$7._)`${v} >= ${o}`, () => t.assign($, !0).break()) : (t.if((0, codegen_1$7._)`${v} > ${l}`, () => t.assign($, !1).break()), o === 1 ? t.assign($, !0) : t.if((0, codegen_1$7._)`${v} >= ${o}`, () => t.assign($, !0)));
     }
   }
@@ -6804,13 +6814,13 @@ var dependencies = {};
     if (Object.keys(u).length === 0)
       return;
     const N = p.let("missing");
-    for (const T in u) {
-      const v = u[T];
+    for (const R in u) {
+      const v = u[R];
       if (v.length === 0)
         continue;
-      const g = (0, n.propertyInData)(p, $, T, O.opts.ownProperties);
+      const g = (0, n.propertyInData)(p, $, R, O.opts.ownProperties);
       d.setParams({
-        property: T,
+        property: R,
         depsCount: v.length,
         deps: v.join(", ")
       }), O.allErrors ? p.if(g, () => {
@@ -6821,17 +6831,17 @@ var dependencies = {};
   }
   e.validatePropertyDeps = o;
   function l(d, u = d.schema) {
-    const { gen: p, data: $, keyword: O, it: N } = d, T = p.name("valid");
+    const { gen: p, data: $, keyword: O, it: N } = d, R = p.name("valid");
     for (const v in u)
       (0, r.alwaysValidSchema)(N, u[v]) || (p.if(
         (0, n.propertyInData)(p, $, v, N.opts.ownProperties),
         () => {
-          const g = d.subschema({ keyword: O, schemaProp: v }, T);
-          d.mergeValidEvaluated(g, T);
+          const g = d.subschema({ keyword: O, schemaProp: v }, R);
+          d.mergeValidEvaluated(g, R);
         },
-        () => p.var(T, !0)
+        () => p.var(R, !0)
         // TODO var
-      ), d.ok(T));
+      ), d.ok(R));
   }
   e.validateSchemaDeps = l, e.default = s;
 })(dependencies);
@@ -6887,22 +6897,22 @@ const code_1$3 = code, codegen_1$5 = codegen, names_1 = names$1, util_1$8 = util
     $(), e.ok((0, codegen_1$5._)`${i} === ${names_1.default.errors}`);
     function $() {
       t.forIn("key", s, (g) => {
-        !u.length && !p.length ? T(g) : t.if(O(g), () => T(g));
+        !u.length && !p.length ? R(g) : t.if(O(g), () => R(g));
       });
     }
     function O(g) {
       let m;
       if (u.length > 8) {
-        const R = (0, util_1$8.schemaRefOrVal)(o, n.properties, "properties");
-        m = (0, code_1$3.isOwnProperty)(t, R, g);
+        const T = (0, util_1$8.schemaRefOrVal)(o, n.properties, "properties");
+        m = (0, code_1$3.isOwnProperty)(t, T, g);
       } else
-        u.length ? m = (0, codegen_1$5.or)(...u.map((R) => (0, codegen_1$5._)`${g} === ${R}`)) : m = codegen_1$5.nil;
-      return p.length && (m = (0, codegen_1$5.or)(m, ...p.map((R) => (0, codegen_1$5._)`${(0, code_1$3.usePattern)(e, R)}.test(${g})`))), (0, codegen_1$5.not)(m);
+        u.length ? m = (0, codegen_1$5.or)(...u.map((T) => (0, codegen_1$5._)`${g} === ${T}`)) : m = codegen_1$5.nil;
+      return p.length && (m = (0, codegen_1$5.or)(m, ...p.map((T) => (0, codegen_1$5._)`${(0, code_1$3.usePattern)(e, T)}.test(${g})`))), (0, codegen_1$5.not)(m);
     }
     function N(g) {
       t.code((0, codegen_1$5._)`delete ${s}[${g}]`);
     }
-    function T(g) {
+    function R(g) {
       if (d.removeAdditional === "all" || d.removeAdditional && r === !1) {
         N(g);
         return;
@@ -6918,13 +6928,13 @@ const code_1$3 = code, codegen_1$5 = codegen, names_1 = names$1, util_1$8 = util
         })) : (v(g, m), l || t.if((0, codegen_1$5.not)(m), () => t.break()));
       }
     }
-    function v(g, m, R) {
+    function v(g, m, T) {
       const S = {
         keyword: "additionalProperties",
         dataProp: g,
         dataPropType: util_1$8.Type.Str
       };
-      R === !1 && Object.assign(S, {
+      T === !1 && Object.assign(S, {
         compositeRule: !0,
         createErrors: !1,
         allErrors: !1
@@ -6981,13 +6991,13 @@ const code_1$1 = code, codegen_1$4 = codegen, util_1$6 = util, util_2 = util, de
     O();
     function O() {
       for (const v of l)
-        u && N(v), i.allErrors ? T(v) : (t.var(p, !0), T(v), t.if(p));
+        u && N(v), i.allErrors ? R(v) : (t.var(p, !0), R(v), t.if(p));
     }
     function N(v) {
       for (const g in u)
         new RegExp(v).test(g) && (0, util_1$6.checkStrictMode)(i, `property ${g} matches pattern ${v} (use allowMatchingProperties)`);
     }
-    function T(v) {
+    function R(v) {
       t.forIn("key", n, (g) => {
         t.if((0, codegen_1$4._)`${(0, code_1$1.usePattern)(e, v)}.test(${g})`, () => {
           const m = d.includes(v);
@@ -7181,45 +7191,45 @@ const codegen_1$1 = codegen, error$1 = {
       return;
     s ? O() : N();
     function O() {
-      const T = r.scopeValue("formats", {
+      const R = r.scopeValue("formats", {
         ref: $.formats,
         code: d.code.formats
-      }), v = r.const("fDef", (0, codegen_1$1._)`${T}[${o}]`), g = r.let("fType"), m = r.let("format");
-      r.if((0, codegen_1$1._)`typeof ${v} == "object" && !(${v} instanceof RegExp)`, () => r.assign(g, (0, codegen_1$1._)`${v}.type || "string"`).assign(m, (0, codegen_1$1._)`${v}.validate`), () => r.assign(g, (0, codegen_1$1._)`"string"`).assign(m, v)), e.fail$data((0, codegen_1$1.or)(R(), S()));
-      function R() {
+      }), v = r.const("fDef", (0, codegen_1$1._)`${R}[${o}]`), g = r.let("fType"), m = r.let("format");
+      r.if((0, codegen_1$1._)`typeof ${v} == "object" && !(${v} instanceof RegExp)`, () => r.assign(g, (0, codegen_1$1._)`${v}.type || "string"`).assign(m, (0, codegen_1$1._)`${v}.validate`), () => r.assign(g, (0, codegen_1$1._)`"string"`).assign(m, v)), e.fail$data((0, codegen_1$1.or)(T(), S()));
+      function T() {
         return d.strictSchema === !1 ? codegen_1$1.nil : (0, codegen_1$1._)`${o} && !${m}`;
       }
       function S() {
-        const I = p.$async ? (0, codegen_1$1._)`(${v}.async ? await ${m}(${n}) : ${m}(${n}))` : (0, codegen_1$1._)`${m}(${n})`, D = (0, codegen_1$1._)`(typeof ${m} == "function" ? ${I} : ${m}.test(${n}))`;
-        return (0, codegen_1$1._)`${m} && ${m} !== true && ${g} === ${t} && !${D}`;
+        const I = p.$async ? (0, codegen_1$1._)`(${v}.async ? await ${m}(${n}) : ${m}(${n}))` : (0, codegen_1$1._)`${m}(${n})`, A = (0, codegen_1$1._)`(typeof ${m} == "function" ? ${I} : ${m}.test(${n}))`;
+        return (0, codegen_1$1._)`${m} && ${m} !== true && ${g} === ${t} && !${A}`;
       }
     }
     function N() {
-      const T = $.formats[i];
-      if (!T) {
-        R();
+      const R = $.formats[i];
+      if (!R) {
+        T();
         return;
       }
-      if (T === !0)
+      if (R === !0)
         return;
-      const [v, g, m] = S(T);
+      const [v, g, m] = S(R);
       v === t && e.pass(I());
-      function R() {
+      function T() {
         if (d.strictSchema === !1) {
-          $.logger.warn(D());
+          $.logger.warn(A());
           return;
         }
-        throw new Error(D());
-        function D() {
+        throw new Error(A());
+        function A() {
           return `unknown format "${i}" ignored in schema at path "${u}"`;
         }
       }
-      function S(D) {
-        const w = D instanceof RegExp ? (0, codegen_1$1.regexpCode)(D) : d.code.formats ? (0, codegen_1$1._)`${d.code.formats}${(0, codegen_1$1.getProperty)(i)}` : void 0, k = r.scopeValue("formats", { key: i, ref: D, code: w });
-        return typeof D == "object" && !(D instanceof RegExp) ? [D.type || "string", D.validate, (0, codegen_1$1._)`${k}.validate`] : ["string", D, k];
+      function S(A) {
+        const w = A instanceof RegExp ? (0, codegen_1$1.regexpCode)(A) : d.code.formats ? (0, codegen_1$1._)`${d.code.formats}${(0, codegen_1$1.getProperty)(i)}` : void 0, k = r.scopeValue("formats", { key: i, ref: A, code: w });
+        return typeof A == "object" && !(A instanceof RegExp) ? [A.type || "string", A.validate, (0, codegen_1$1._)`${k}.validate`] : ["string", A, k];
       }
       function I() {
-        if (typeof T == "object" && !(T instanceof RegExp) && T.async) {
+        if (typeof R == "object" && !(R instanceof RegExp) && R.async) {
           if (!p.$async)
             throw new Error("async format in sync schema");
           return (0, codegen_1$1._)`await ${m}(${n})`;
@@ -7291,45 +7301,45 @@ const codegen_1 = codegen, types_1 = types, compile_1 = compile, util_1 = util,
     function p() {
       const N = O();
       t.if(!1);
-      for (const T in N)
-        t.elseIf((0, codegen_1._)`${u} === ${T}`), t.assign(d, $(N[T]));
+      for (const R in N)
+        t.elseIf((0, codegen_1._)`${u} === ${R}`), t.assign(d, $(N[R]));
       t.else(), e.error(!1, { discrError: types_1.DiscrError.Mapping, tag: u, tagName: l }), t.endIf();
     }
     function $(N) {
-      const T = t.name("valid"), v = e.subschema({ keyword: "oneOf", schemaProp: N }, T);
-      return e.mergeEvaluated(v, codegen_1.Name), T;
+      const R = t.name("valid"), v = e.subschema({ keyword: "oneOf", schemaProp: N }, R);
+      return e.mergeEvaluated(v, codegen_1.Name), R;
     }
     function O() {
       var N;
-      const T = {}, v = m(s);
+      const R = {}, v = m(s);
       let g = !0;
       for (let I = 0; I < o.length; I++) {
-        let D = o[I];
-        D != null && D.$ref && !(0, util_1.schemaHasRulesButRef)(D, i.self.RULES) && (D = compile_1.resolveRef.call(i.self, i.schemaEnv.root, i.baseId, D == null ? void 0 : D.$ref), D instanceof compile_1.SchemaEnv && (D = D.schema));
-        const w = (N = D == null ? void 0 : D.properties) === null || N === void 0 ? void 0 : N[l];
+        let A = o[I];
+        A != null && A.$ref && !(0, util_1.schemaHasRulesButRef)(A, i.self.RULES) && (A = compile_1.resolveRef.call(i.self, i.schemaEnv.root, i.baseId, A == null ? void 0 : A.$ref), A instanceof compile_1.SchemaEnv && (A = A.schema));
+        const w = (N = A == null ? void 0 : A.properties) === null || N === void 0 ? void 0 : N[l];
         if (typeof w != "object")
           throw new Error(`discriminator: oneOf subschemas (or referenced schemas) must have "properties/${l}"`);
-        g = g && (v || m(D)), R(w, I);
+        g = g && (v || m(A)), T(w, I);
       }
       if (!g)
         throw new Error(`discriminator: "${l}" must be required`);
-      return T;
+      return R;
       function m({ required: I }) {
         return Array.isArray(I) && I.includes(l);
       }
-      function R(I, D) {
+      function T(I, A) {
         if (I.const)
-          S(I.const, D);
+          S(I.const, A);
         else if (I.enum)
           for (const w of I.enum)
-            S(w, D);
+            S(w, A);
         else
           throw new Error(`discriminator: "properties/${l}" must have "const" or "enum"`);
       }
-      function S(I, D) {
-        if (typeof I != "string" || I in T)
+      function S(I, A) {
+        if (typeof I != "string" || I in R)
           throw new Error(`discriminator: "${l}" values must be unique strings`);
-        T[I] = D;
+        R[I] = A;
       }
     }
   }
@@ -7581,13 +7591,13 @@ const $schema$1 = "http://json-schema.org/draft-07/schema#", $id = "http://json-
   const r = core$2, n = draft7, s = discriminator, i = require$$3, o = ["/properties"], l = "http://json-schema.org/draft-07/schema";
   class d extends r.default {
     _addVocabularies() {
-      super._addVocabularies(), n.default.forEach((T) => this.addVocabulary(T)), this.opts.discriminator && this.addKeyword(s.default);
+      super._addVocabularies(), n.default.forEach((R) => this.addVocabulary(R)), this.opts.discriminator && this.addKeyword(s.default);
     }
     _addDefaultMetaSchema() {
       if (super._addDefaultMetaSchema(), !this.opts.meta)
         return;
-      const T = this.opts.$data ? this.$dataMetaSchema(i, o) : i;
-      this.addMetaSchema(T, l, !1), this.refs["http://json-schema.org/schema"] = l;
+      const R = this.opts.$data ? this.$dataMetaSchema(i, o) : i;
+      this.addMetaSchema(R, l, !1), this.refs["http://json-schema.org/schema"] = l;
     }
     defaultMeta() {
       return this.opts.defaultMeta = super.defaultMeta() || (this.getSchema(l) ? l : void 0);
@@ -9105,7 +9115,7 @@ function compileBlueprint(e, {
   onStepCompleted: n = () => {
   }
 } = {}) {
-  var p, $, O, N, T;
+  var p, $, O, N, R;
   if (e = {
     ...e,
     steps: (e.steps || []).filter(isStepDefinition)
@@ -9190,21 +9200,21 @@ function compileBlueprint(e, {
     ),
     features: {
       // Disable networking by default
-      networking: ((T = e.features) == null ? void 0 : T.networking) ?? !1
+      networking: ((R = e.features) == null ? void 0 : R.networking) ?? !1
     },
     run: async (v) => {
       try {
         for (const { resources: g } of u)
           for (const m of g)
             m.setPlayground(v), m.isAsync && m.resolve();
-        for (const [g, { run: m, step: R }] of Object.entries(u))
+        for (const [g, { run: m, step: T }] of Object.entries(u))
           try {
             const S = await m(v);
-            n(S, R);
+            n(S, T);
           } catch (S) {
             throw console.error(S), new Error(
               `Error when executing the blueprint step #${g} (${JSON.stringify(
-                R
+                T
               )}) ${S instanceof Error ? `: ${S.message}` : S}`,
               { cause: S }
             );