@blue-labs/language 1.37.2 → 1.37.3

package/dist/index.mjs

@@ -1,11 +1,11 @@
 import M from "big.js";
-import { isNullable as I, isNonNullable as d, jsonPrimitiveSchema as Yt, isReadonlyArray as pe, isJsonPrimitive as xe, isPreciseNumberString as it } from "@blue-labs/shared-utils";
-import { z as h, ZodOptional as ot, ZodNullable as lt, ZodReadonly as ct, ZodBranded as at, ZodEffects as he, ZodLazy as fe, ZodString as J, ZodNumber as Z, ZodBoolean as ae, ZodBigInt as ue, ZodEnum as Gt, ZodNativeEnum as kt, ZodIntersection as zt, ZodUnion as Jt, ZodObject as Zt, ZodRecord as Ht } from "zod";
-import se from "bs58";
-import { isObject as ut, isArray as je, isString as Le, omit as dt, pascal as Wt, map as qt } from "radash";
-import { sha256 as Xt } from "js-sha256";
+import { isNullable as I, isNonNullable as d, jsonPrimitiveSchema as _t, isReadonlyArray as he, isJsonPrimitive as $e, isPreciseNumberString as nt } from "@blue-labs/shared-utils";
+import { z as h, ZodOptional as it, ZodNullable as ot, ZodReadonly as lt, ZodBranded as ct, ZodEffects as fe, ZodLazy as ge, ZodString as J, ZodNumber as Z, ZodBoolean as ue, ZodBigInt as de, ZodEnum as Kt, ZodNativeEnum as Yt, ZodIntersection as Gt, ZodUnion as zt, ZodObject as kt, ZodRecord as Jt } from "zod";
+import re from "bs58";
+import { isObject as at, isArray as xe, isString as je, omit as ut, pascal as Zt, map as Ht } from "radash";
+import { sha256 as Wt } from "js-sha256";
 import Pe from "crypto";
-import Qt from "base32.js";
+import qt from "base32.js";
 import U from "js-yaml";
 class P extends M {
   constructor(e) {
@@ -17,7 +17,7 @@ class w extends M {
     super(e);
   }
 }
-class er {
+class Xt {
   static get(e, t, r, n = !0) {
     if (I(t) || !t.startsWith("/"))
       throw new Error(`Invalid path: ${t}`);
@@ -135,37 +135,37 @@ class er {
     return d(r) ? r : e;
   }
 }
-const H = "name", W = "description", ge = "type", Ue = "itemType", _e = "keyType", Ke = "valueType", ve = "value", Ye = "items", j = "blueId", Ge = "blue", tr = [
+const H = "name", W = "description", ye = "type", Le = "itemType", Ue = "keyType", _e = "valueType", be = "value", Ke = "items", j = "blueId", Ye = "blue", Qt = [
   H,
   W,
-  ge,
+  ye,
+  Le,
   Ue,
   _e,
+  be,
   Ke,
-  ve,
-  Ye,
   j,
-  Ge
-], rr = "Text", sr = "Double", nr = "Integer", ir = "Boolean", or = "List", lr = "Dictionary", ke = [
+  Ye
+], er = "Text", tr = "Double", rr = "Integer", sr = "Boolean", nr = "List", ir = "Dictionary", Ge = [
+  er,
+  tr,
   rr,
-  sr,
-  nr,
-  ir
-], pt = [...ke, or, lr], _ = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", K = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", Y = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", G = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", ht = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", ft = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", gt = [
+  sr
+], dt = [...Ge, nr, ir], _ = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", K = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", Y = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", G = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", pt = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", ht = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", ft = [
   _,
   K,
   Y,
   G
 ], le = [
-  ...gt,
-  ht,
-  ft
+  ...ft,
+  pt,
+  ht
 ];
 Object.fromEntries(
-  pt.map((s, e) => [s, le[e]])
+  dt.map((s, e) => [s, le[e]])
 );
-const yt = Object.fromEntries(
-  le.map((s, e) => [s, pt[e]])
+const gt = Object.fromEntries(
+  le.map((s, e) => [s, dt[e]])
 );
 class a {
   static INTEGER = new a("Integer");
@@ -305,7 +305,7 @@ class a {
     return !1;
   }
   get(e, t) {
-    return er.get(this, e, t);
+    return Xt.get(this, e, t);
   }
   getAsNode(e) {
     const t = this.get(e);
@@ -331,7 +331,7 @@ class a {
     return `BlueNode{name='${this.name}', description='${this.description}', type=${this.type}, itemType=${this.itemType}, keyType=${this.keyType}, valueType=${this.valueType}, value=${this.value}, items=${this.items}, properties=${this.properties}, blueId='${this.blueId}', blue=${this.blue}, inlineValue=${this.inlineValue}}`;
   }
 }
-class ye {
+class me {
   static MIN_BLUE_ID_LENGTH = 41;
   static MAX_BLUE_ID_LENGTH = 45;
   static BLUE_ID_PATTERN = /^[1-9A-HJ-NP-Za-km-z]{41,45}(?:#\d+)?$/;
@@ -342,7 +342,7 @@ class ye {
     if (n < this.MIN_BLUE_ID_LENGTH || n > this.MAX_BLUE_ID_LENGTH)
       return !1;
     try {
-      if (se.decode(r).length !== 32)
+      if (re.decode(r).length !== 32)
         return !1;
     } catch {
       return !1;
@@ -357,14 +357,14 @@ class ye {
     return !0;
   }
 }
-const Zs = h.string().max(ye.MAX_BLUE_ID_LENGTH, {
+const Ys = h.string().max(me.MAX_BLUE_ID_LENGTH, {
   message: "Blue Id has a maximum length of 45 characters"
-}).min(ye.MIN_BLUE_ID_LENGTH, {
+}).min(me.MIN_BLUE_ID_LENGTH, {
   message: "Blue Id has a minimum length of 41 characters"
 }).refine(
   (s) => {
     try {
-      return se.decode(s), !0;
+      return re.decode(s), !0;
     } catch {
       return !1;
     }
@@ -372,45 +372,45 @@ const Zs = h.string().max(ye.MAX_BLUE_ID_LENGTH, {
   {
     message: "Blue Id must be a valid Base58 string"
   }
-), ne = h.lazy(
+), se = h.lazy(
   () => h.record(h.unknown()).and(
     h.object({
       blueId: h.string().optional(),
       name: h.string().optional(),
       description: h.string().optional(),
-      type: ne.optional(),
+      type: se.optional(),
       value: h.union([h.string(), h.number(), h.boolean()]).optional().nullable(),
-      items: h.array(ne).optional()
+      items: h.array(se).optional()
     })
   )
-), be = h.object({
+), we = h.object({
   blueId: h.string().optional(),
   name: h.string().optional(),
   description: h.string().optional(),
-  type: ne.optional()
-}), Hs = be.extend({
+  type: se.optional()
+}), Gs = we.extend({
   value: h.string().optional()
-}), Ws = be.extend({
+}), zs = we.extend({
   value: h.number().optional()
-}), qs = be.extend({
+}), ks = we.extend({
   value: h.boolean().optional()
-}), Xs = be.extend({
+}), Js = we.extend({
   items: h.array(h.string()).optional()
-}), Qs = (s) => ne.safeParse(s).success, cr = (s) => d(s) && "blueId" in s && d(s.blueId), en = (s) => d(s) && "name" in s && d(s.name), ar = (s) => d(s) && "items" in s && d(s.items), ur = (s) => d(s) && "type" in s && d(s.type), dr = (s) => d(s) && "value" in s && d(s.value), tn = (s, e) => s.required({ type: !0 }).safeParse(e).success, S = (s) => s instanceof M, L = (s) => S(s) && s instanceof w, De = (s) => S(s) && s instanceof P, pr = h.lazy(
-  () => h.record(me)
-), hr = h.lazy(
+}), Zs = (s) => se.safeParse(s).success, or = (s) => d(s) && "blueId" in s && d(s.blueId), Hs = (s) => d(s) && "name" in s && d(s.name), lr = (s) => d(s) && "items" in s && d(s.items), cr = (s) => d(s) && "type" in s && d(s.type), ar = (s) => d(s) && "value" in s && d(s.value), Ws = (s, e) => s.required({ type: !0 }).safeParse(e).success, S = (s) => s instanceof M, L = (s) => S(s) && s instanceof w, De = (s) => S(s) && s instanceof P, ur = h.lazy(
+  () => h.record(Ie)
+), dr = h.lazy(
   () => h.union([
-    h.array(me),
-    h.array(me).readonly()
+    h.array(Ie),
+    h.array(Ie).readonly()
   ])
-), me = h.lazy(
+), Ie = h.lazy(
   () => h.union([
-    Yt,
-    pr,
-    hr,
+    _t,
+    ur,
+    dr,
     h.instanceof(M)
   ])
-), mt = (s) => ut(s) && !je(s) && !pe(s) && !S(s), It = (s) => je(s) || pe(s), rn = (s) => It(s) || mt(s) || S(s) || xe(s);
+), yt = (s) => at(s) && !xe(s) && !he(s) && !S(s), mt = (s) => xe(s) || he(s), qs = (s) => mt(s) || yt(s) || S(s) || $e(s);
 class g {
   static deserialize(e) {
     return g.handleNode(e);
@@ -420,7 +420,7 @@ class g {
       throw new Error(
         "This is not a valid JSON-like value. Found 'undefined' as a value."
       );
-    if (mt(e)) {
+    if (yt(e)) {
       const t = new a(), r = {};
       return Object.entries(e).forEach(([n, i]) => {
         switch (n) {
@@ -444,19 +444,19 @@ class g {
               t.setDescription(i);
             }
             break;
-          case ge:
+          case ye:
             t.setType(g.handleNode(i));
             break;
-          case Ue:
+          case Le:
             t.setItemType(g.handleNode(i));
             break;
-          case _e:
+          case Ue:
             t.setKeyType(g.handleNode(i));
             break;
-          case Ke:
+          case _e:
             t.setValueType(g.handleNode(i));
             break;
-          case ve:
+          case be:
             t.setValue(g.handleValue(i));
             break;
           case j:
@@ -464,10 +464,10 @@ class g {
               throw new Error(`The ${j} field must be a string.`);
             t.setBlueId(i);
             break;
-          case Ye:
+          case Ke:
             t.setItems(g.handleArray(i));
             break;
-          case Ge:
+          case Ye:
             t.setBlue(g.handleNode(i));
             break;
           default:
@@ -476,7 +476,7 @@ class g {
         }
       }), Object.keys(r).length > 0 && t.setProperties(r), t;
     } else {
-      if (It(e))
+      if (mt(e))
         return new a().setItems(g.handleArray(e));
       {
         const t = e;
@@ -503,7 +503,7 @@ class g {
   }
   static handleArray(e) {
     if (e != null) {
-      if (ut(e) && !Array.isArray(e))
+      if (at(e) && !Array.isArray(e))
         return [g.handleNode(e)];
       if (Array.isArray(e))
         return e.map(g.handleNode);
@@ -511,12 +511,12 @@ class g {
     }
   }
 }
-function fr(s) {
+function pr(s) {
   return s && s.__esModule && Object.prototype.hasOwnProperty.call(s, "default") ? s.default : s;
 }
-var Ee, Qe;
-function gr() {
-  return Qe || (Qe = 1, Ee = function s(e) {
+var Ee, Xe;
+function hr() {
+  return Xe || (Xe = 1, Ee = function s(e) {
     if (typeof e == "number" && isNaN(e))
       throw new Error("NaN is not allowed");
     if (typeof e == "number" && !isFinite(e))
@@ -529,11 +529,11 @@ function gr() {
     }, "")}}`;
   }), Ee;
 }
-var yr = gr();
-const mr = /* @__PURE__ */ fr(yr);
-class Ir {
+var fr = hr();
+const gr = /* @__PURE__ */ pr(fr);
+class yr {
   static canonicalize(e) {
-    return mr(e);
+    return gr(e);
   }
 }
 const Se = typeof process < "u" && process.versions != null && process.versions.node != null;
@@ -559,18 +559,18 @@ class ze {
     return Se ? Pe : null;
   }
 }
-class Tr {
+class mr {
   cryptoEnv = ze.getInstance();
   applySync(e) {
     const t = this.canonicalizeInput(e), r = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : this.sha256SyncBrowser(t);
-    return se.encode(r);
+    return re.encode(r);
   }
   async apply(e) {
     const t = this.canonicalizeInput(e), r = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : await this.sha256Async(t);
-    return se.encode(r);
+    return re.encode(r);
   }
   canonicalizeInput(e) {
-    const t = Ir.canonicalize(e);
+    const t = yr.canonicalize(e);
     if (typeof t != "string")
       throw new Error("Canonized value must be a string");
     return t;
@@ -585,7 +585,7 @@ class Tr {
     return new Uint8Array(r);
   }
   sha256SyncBrowser(e) {
-    return new Uint8Array(Xt.arrayBuffer(e));
+    return new Uint8Array(Wt.arrayBuffer(e));
   }
   async sha256Async(e) {
     if (this.cryptoEnv.hasNodeCrypto())
@@ -612,7 +612,7 @@ class m {
     const r = e.getValue(), n = this.handleValue(r);
     if (n !== void 0 && t === "simple")
       return n;
-    const i = e.getItems()?.map((z) => m.get(z, t));
+    const i = e.getItems()?.map((k) => m.get(k, t));
     if (i !== void 0 && t === "simple")
       return i;
     const o = e.getName(), l = e.getDescription();
@@ -626,22 +626,22 @@ class m {
     o !== void 0 && (c[H] = o), l !== void 0 && (c[W] = l);
     const u = e.getType();
     if (t === "official" && r !== void 0 && u === void 0) {
-      const z = this.inferTypeBlueId(r);
-      z !== null && (c[ge] = { [j]: z });
-    } else u !== void 0 && (c[ge] = m.get(u, t));
+      const k = this.inferTypeBlueId(r);
+      k !== null && (c[ye] = { [j]: k });
+    } else u !== void 0 && (c[ye] = m.get(u, t));
     const y = e.getItemType();
-    y !== void 0 && (c[Ue] = m.get(y, t));
+    y !== void 0 && (c[Le] = m.get(y, t));
     const p = e.getKeyType();
-    p !== void 0 && (c[_e] = m.get(p, t));
+    p !== void 0 && (c[Ue] = m.get(p, t));
     const f = e.getValueType();
-    f !== void 0 && (c[Ke] = m.get(f, t)), n !== void 0 && (c[ve] = n), i !== void 0 && (c[Ye] = i);
+    f !== void 0 && (c[_e] = m.get(f, t)), n !== void 0 && (c[be] = n), i !== void 0 && (c[Ke] = i);
     const v = e.getBlueId();
     v !== void 0 && (c[j] = v);
     const O = e.getBlue();
-    O !== void 0 && (c[Ge] = O);
-    const k = e.getProperties();
-    return k !== void 0 && Object.entries(k).forEach(([z, Kt]) => {
-      c[z] = m.get(Kt, t);
+    O !== void 0 && (c[Ye] = O);
+    const z = e.getProperties();
+    return z !== void 0 && Object.entries(z).forEach(([k, Ut]) => {
+      c[k] = m.get(Ut, t);
     }), c;
   }
   static handleValue(e) {
@@ -659,9 +659,9 @@ class m {
     return typeof e == "string" ? _ : S(e) ? L(e) ? Y : K : typeof e == "boolean" ? G : null;
   }
 }
-const vr = (s) => xe(s) && d(s);
+const Ir = (s) => $e(s) && d(s);
 class T {
-  static INSTANCE = new T(new Tr());
+  static INSTANCE = new T(new mr());
   hashProvider;
   constructor(e) {
     this.hashProvider = e;
@@ -696,14 +696,14 @@ class T {
   }
   // Internal method to calculate BlueId recursively
   internalCalculate(e, t) {
-    return vr(e) || S(e) ? this.applyHash(e.toString(), t) : Array.isArray(e) || pe(e) ? this.calculateList(e, t) : this.calculateMap(e, t);
+    return Ir(e) || S(e) ? this.applyHash(e.toString(), t) : Array.isArray(e) || he(e) ? this.calculateList(e, t) : this.calculateMap(e, t);
   }
   calculateMap(e, t) {
     if (e[j] !== void 0)
       return e[j];
     const n = Object.keys(e).map((o) => {
       const l = e[o];
-      if ([H, ve, W].includes(o))
+      if ([H, be, W].includes(o))
         return t ? [o, l] : Promise.resolve([o, l]);
       {
         const c = this.internalCalculate(l, t);
@@ -746,9 +746,9 @@ class T {
   // Method to clean the input structure by removing null or undefined values
   cleanStructure(e) {
     if (e != null) {
-      if (xe(e) || S(e))
+      if ($e(e) || S(e))
         return e;
-      if (Array.isArray(e) || pe(e)) {
+      if (Array.isArray(e) || he(e)) {
         const t = e.map((r) => this.cleanStructure(r)).filter(d);
         return t.length > 0 ? t : void 0;
       } else if (typeof e == "object") {
@@ -763,12 +763,12 @@ class T {
     }
   }
 }
-class sn {
+class Xs {
   static convert(e) {
-    const t = se.decode(e), r = new Uint8Array(2 + t.length);
+    const t = re.decode(e), r = new Uint8Array(2 + t.length);
     r[0] = 18, r[1] = 32, r.set(t, 2);
     const n = new Uint8Array(2 + r.length);
-    return n[0] = 1, n[1] = 85, n.set(r, 2), "b" + new Qt.Encoder({ type: "rfc4648", lc: !0 }).write(n).finalize().replace(/=/g, "");
+    return n[0] = 1, n[1] = 85, n.set(r, 2), "b" + new qt.Encoder({ type: "rfc4648", lc: !0 }).write(n).finalize().replace(/=/g, "");
   }
 }
 class E {
@@ -811,12 +811,12 @@ class E {
     return r;
   }
 }
-const D = (s) => !!s && typeof s == "object" && !Array.isArray(s) && !(s instanceof a), C = (s) => s instanceof w || s instanceof P, br = (s) => s.replace(/~1/g, "/").replace(/~0/g, "~");
+const D = (s) => !!s && typeof s == "object" && !Array.isArray(s) && !(s instanceof a), C = (s) => s instanceof w || s instanceof P, Tr = (s) => s.replace(/~1/g, "/").replace(/~0/g, "~");
 function Q(s) {
   if (s === "/") return [];
   if (!s.startsWith("/"))
     throw new Error(`Path must start with '/': ${s}`);
-  return s.split("/").slice(1).map(br);
+  return s.split("/").slice(1).map(Tr);
 }
 function q(s) {
   if (s === "-") return -1;
@@ -829,7 +829,7 @@ function q(s) {
     );
   return e;
 }
-function Tt(s, e, t, r = !0) {
+function It(s, e, t, r = !0) {
   switch (e) {
     case "name":
       return t ? r ? s.getName() ?? null : s : s.getName();
@@ -859,9 +859,9 @@ function Tt(s, e, t, r = !0) {
       return;
   }
 }
-function et(s, e, t = !0) {
+function Qe(s, e, t = !0) {
   if (s instanceof a) {
-    const r = Tt(
+    const r = It(
       s,
       e,
       !0,
@@ -905,14 +905,14 @@ function ee(s, e) {
     };
   let t = s;
   for (let n = 0; n < e.length - 1; ++n) {
-    const i = e[n], o = et(t, i);
+    const i = e[n], o = Qe(t, i);
     if (o === void 0)
       throw new Error(`Cannot resolve '/${e.slice(0, n + 1).join("/")}'`);
     t = o;
   }
   const r = e[e.length - 1];
   if (t instanceof a) {
-    const n = et(t, r, !1);
+    const n = Qe(t, r, !1);
     if ((typeof n != "object" || n === null || C(n)) && !(n instanceof a) && !Array.isArray(n) && ["name", "description", "value", "blueId"].includes(r))
       return {
         parent: t,
@@ -925,9 +925,9 @@ function ee(s, e) {
     key: Array.isArray(t) ? q(r) : r
   };
 }
-function Je(s, e) {
+function ke(s, e) {
   if (s instanceof a) {
-    const t = e, r = Tt(s, t, !1);
+    const t = e, r = It(s, t, !1);
     if (r !== void 0 || [
       "name",
       "description",
@@ -967,7 +967,7 @@ function Fe(s) {
     e[t] = Fe(r);
   return e;
 }
-function Ze(s, e, t) {
+function Je(s, e, t) {
   if (s instanceof a) {
     const r = e;
     switch (r) {
@@ -1031,7 +1031,7 @@ function Ze(s, e, t) {
   }
   Array.isArray(s) ? s.splice(q(e), 1) : D(s) && (t === void 0 ? delete s[e] : s[e] = t);
 }
-function wr(s, e, t, r) {
+function vr(s, e, t, r) {
   let n = -1;
   if (e !== "-" && (n = typeof e == "number" ? e : parseInt(e, 10), isNaN(n)))
     throw new Error(
@@ -1057,7 +1057,7 @@ function wr(s, e, t, r) {
   } else
     i.splice(n, 0, t);
 }
-function Ie(s, e, t, r) {
+function Te(s, e, t, r) {
   if (Array.isArray(s)) {
     const n = e === "-" ? s.length : q(e);
     if (!r && n > s.length)
@@ -1079,7 +1079,7 @@ function Ie(s, e, t, r) {
     return;
   }
   if (s instanceof a) {
-    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? wr(s, e, N(t), r) : Ze(s, e, t);
+    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? vr(s, e, N(t), r) : Je(s, e, t);
     return;
   }
   if (D(s)) {
@@ -1088,7 +1088,7 @@ function Ie(s, e, t, r) {
   }
   throw new Error(`Cannot insert into parent of type ${typeof s}`);
 }
-function Br(s, e) {
+function br(s, e) {
   if (Array.isArray(s)) {
     const t = q(e);
     t === -1 && e === "-" ? s.length > 0 && s.pop() : t >= 0 && t < s.length && s.splice(t, 1);
@@ -1103,7 +1103,7 @@ function Br(s, e) {
         return;
       }
     }
-    Ze(s, e, void 0);
+    Je(s, e, void 0);
   } else D(s) && delete s[e];
 }
 function Oe(s) {
@@ -1131,11 +1131,11 @@ function $(s, e) {
   }
   return !1;
 }
-function vt(s, e) {
+function Tt(s, e) {
   const { parent: t, key: r } = ee(s, Q(e));
-  return Je(t, r);
+  return ke(t, r);
 }
-function bt(s, e, t) {
+function vt(s, e, t) {
   const r = Q(e);
   if (r.length === 0 && e === "/") {
     const o = N(t);
@@ -1143,9 +1143,9 @@ function bt(s, e, t) {
     return;
   }
   const { parent: n, key: i } = ee(s, r);
-  Ie(n, i, t, !0);
+  Te(n, i, t, !0);
 }
-function Nr(s, e, t) {
+function wr(s, e, t) {
   const r = Q(e);
   if (r.length === 0 && e === "/") {
     if (s.getItems() && Array.isArray(t)) {
@@ -1158,9 +1158,9 @@ function Nr(s, e, t) {
     return !0;
   }
   const { parent: n, key: i } = ee(s, r);
-  return Ie(n, i, t, !1), !0;
+  return Te(n, i, t, !1), !0;
 }
-function Pr(s, e, t) {
+function Br(s, e, t) {
   const r = Q(e);
   if (r.length === 0 && e === "/") {
     const l = N(t);
@@ -1168,39 +1168,39 @@ function Pr(s, e, t) {
   }
   const { parent: n, key: i, actualTarget: o } = ee(s, r);
   if (o !== void 0 && n instanceof a)
-    Ze(n, i, t);
+    Je(n, i, t);
   else {
-    const l = Je(n, i), c = Array.isArray(n) || n instanceof a && n.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
+    const l = ke(n, i), c = Array.isArray(n) || n instanceof a && n.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
     if (l === void 0) {
       if (c)
         throw new Error(
           `REPLACE failed: Target array index '${i.toString()}' is out of bounds or does not exist at path '${e}'.`
         );
-      Ie(n, i, t, !0);
+      Te(n, i, t, !0);
     } else
-      Ie(n, i, t, !0);
+      Te(n, i, t, !0);
   }
   return !0;
 }
-function wt(s, e) {
+function bt(s, e) {
   const t = Q(e);
   if (t.length === 0 && e === "/")
     return s.setValue(null), s.setItems(void 0), s.setProperties(void 0), !0;
   const { parent: r, key: n } = ee(s, t);
-  return Br(r, n), !0;
+  return br(r, n), !0;
 }
-function Er(s, e, t) {
-  const r = Oe(vt(s, e));
-  return bt(s, t, r), !0;
+function Nr(s, e, t) {
+  const r = Oe(Tt(s, e));
+  return vt(s, t, r), !0;
 }
-function Sr(s, e, t) {
-  const r = Q(e), { parent: n, key: i } = ee(s, r), o = Je(n, i);
+function Pr(s, e, t) {
+  const r = Q(e), { parent: n, key: i } = ee(s, r), o = ke(n, i);
   if (o === void 0)
     throw new Error(`MOVE failed: 'from' location '${e}' does not exist.`);
-  return wt(s, e) ? (bt(s, t, o), !0) : !1;
+  return bt(s, e) ? (vt(s, t, o), !0) : !1;
 }
-function Ar(s, e, t) {
-  const r = vt(s, e);
+function Er(s, e, t) {
+  const r = Tt(s, e);
   let n = t;
   if (r instanceof a)
     if ((t === null || typeof t == "string" || typeof t == "number" || typeof t == "boolean" || C(t)) && (r.isInlineValue() || r.getValue() !== void 0)) {
@@ -1226,118 +1226,93 @@ function Ar(s, e, t) {
   }
   return !0;
 }
-function Vr(s, e) {
+function Sr(s, e) {
   switch (e.op) {
     case "add":
-      return Nr(s, e.path, e.val);
+      return wr(s, e.path, e.val);
     case "replace":
-      return Pr(s, e.path, e.val);
+      return Br(s, e.path, e.val);
     case "remove":
-      return wt(s, e.path);
+      return bt(s, e.path);
     case "copy":
-      return Er(s, e.from, e.path);
+      return Nr(s, e.from, e.path);
     case "move":
-      return Sr(s, e.from, e.path);
+      return Pr(s, e.from, e.path);
     case "test":
-      return Ar(s, e.path, e.val);
+      return Er(s, e.path, e.val);
   }
 }
-function nn(s, e, t = !1) {
+function Qs(s, e, t = !1) {
   const r = t ? s : s.clone();
-  return Vr(r, e), r;
+  return Sr(r, e), r;
 }
 const Ae = Symbol.for("zod-schema-annotations");
-function Cr() {
+function Ar() {
   if (typeof globalThis < "u") return globalThis;
   if (typeof global < "u") return global;
   if (typeof window < "u") return window;
   if (typeof self < "u") return self;
   throw new Error("Unable to locate global object");
 }
-function Bt() {
-  const s = Cr();
+function wt() {
+  const s = Ar();
   return Ae in s || (s[Ae] = /* @__PURE__ */ new WeakMap()), s[Ae];
 }
-function te(s, e) {
-  const t = Bt(), r = t.get(s) || {};
+function ce(s, e) {
+  const t = wt(), r = t.get(s) || {};
   return t.set(s, { ...r, ...e }), s;
 }
-const A = (s) => Bt().get(s), Mr = (s) => (e) => {
-  const t = A(e);
-  return te(e, {
+const V = (s) => wt().get(s), Vr = (s) => (e) => {
+  const t = V(e);
+  return ce(e, {
     ...t,
     blueDescription: s
   });
-}, Dr = (s) => {
-  const e = A(s);
-  return d(e) && Le(e.blueDescription) ? e.blueDescription : null;
-}, on = (s) => Mr(s)(h.string().optional()), Fr = h.union([h.string(), h.boolean()]), Or = (s) => (e) => {
-  const t = A(e);
-  return te(e, {
+}, Cr = (s) => {
+  const e = V(s);
+  return d(e) && je(e.blueDescription) ? e.blueDescription : null;
+}, en = (s) => Vr(s)(h.string().optional()), Mr = h.union([h.string(), h.boolean()]), Dr = (s) => (e) => {
+  const t = V(e);
+  return ce(e, {
     ...t,
     blueId: s
   });
-}, Rr = (s) => {
-  const e = A(s), t = Fr.safeParse(e?.blueId);
+}, Fr = (s) => {
+  const e = V(s), t = Mr.safeParse(e?.blueId);
   return t.success ? t.data : null;
-}, ln = (s) => Or(s ?? !0)(h.string()), $r = (s) => (e) => {
-  const t = A(e);
-  return te(e, {
+}, tn = (s) => Dr(s ?? !0)(h.string()), Or = (s) => (e) => {
+  const t = V(e);
+  return ce(e, {
     ...t,
     blueName: s
   });
-}, xr = (s) => {
-  const e = A(s);
-  return d(e) && Le(e.blueName) ? e.blueName : null;
-}, cn = (s) => {
+}, Rr = (s) => {
+  const e = V(s);
+  return d(e) && je(e.blueName) ? e.blueName : null;
+}, rn = (s) => {
   const e = h.string().optional();
-  return $r(s)(e);
-}, jr = () => (s) => {
-  const e = A(s);
-  return te(s, {
+  return Or(s)(e);
+}, $r = () => (s) => {
+  const e = V(s);
+  return ce(s, {
     ...e,
     blueNode: !0
   });
-}, Lr = (s) => {
-  const e = A(s);
+}, xr = (s) => {
+  const e = V(s);
   return d(e) && d(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
-}, Nt = (s) => !!Lr(s), an = () => {
+}, Bt = (s) => !!xr(s), sn = () => {
   const s = h.instanceof(a);
-  return jr()(s);
-}, Re = "extendedFrom", Ur = ({
-  schema: s,
-  baseSchema: e
-}) => {
-  const t = A(s) || {};
-  return te(s, {
-    ...t,
-    [Re]: e
-  });
-}, _r = (s) => {
-  const e = A(s);
-  return d(e) && e[Re] ? e[Re] : null;
-}, Pt = (s, e) => {
-  const t = _r(s);
-  return I(t) ? !1 : t?._def === e?._def ? !0 : Pt(t, e);
-}, Kr = (s) => new Proxy(s, {
-  get(e, t, r) {
-    return t === "extend" ? function(...n) {
-      const i = e.extend(...n);
-      return Ur({
-        schema: i,
-        baseSchema: e
-      });
-    } : Reflect.get(e, t, r);
-  }
-}), Yr = h.object({
+  return $r()(s);
+}, jr = h.object({
   value: h.array(h.string()).optional(),
   defaultValue: h.string().optional()
-}), Gr = (s) => {
-  const e = A(s), t = Yr.passthrough().safeParse(e?.typeBlueId);
+}), Lr = (s) => {
+  const e = V(s), t = jr.passthrough().safeParse(e?.typeBlueId);
   return t.success ? t.data : null;
-}, un = (s) => (e) => {
-  const t = A(e), r = typeof s == "string" ? { value: [s] } : s, n = Kr(e);
-  return te(n, {
+}, nn = (s) => (e) => {
+  const t = V(e), r = typeof s == "string" ? { value: [s] } : s;
+  return ce(e, {
     ...t,
     typeBlueId: {
       ...t?.typeBlueId || {},
@@ -1345,72 +1320,207 @@ const A = (s) => Bt().get(s), Mr = (s) => (e) => {
     }
   });
 };
-class we {
+class ne {
   static resolveBlueId(e) {
-    const t = Gr(e);
+    const t = Lr(e);
     if (I(t))
       return null;
     const r = t.defaultValue;
     if (d(r))
       return r;
     const n = t.value?.[0];
-    return d(n) ? n : we.getRepositoryBlueId(t, e);
+    return d(n) ? n : ne.getRepositoryBlueId(t, e);
   }
   static getRepositoryBlueId(e, t) {
     throw new Error("Not implemented");
   }
 }
-class V {
+class A {
   // TODO: Enhance to support schemas associated with multiple blueIds
   static isTypeOf(e, t, r) {
-    const n = we.resolveBlueId(t), i = e.getType()?.getBlueId();
+    const n = ne.resolveBlueId(t), i = e.getType()?.getBlueId();
     if (I(n) || I(i))
       return !1;
     if (n === i)
       return !0;
     if (r?.checkSchemaExtensions && d(r.typeSchemaResolver)) {
       const o = r.typeSchemaResolver.resolveSchema(e);
-      return V.checkSchemaExtension(o, t);
+      return A.checkSchemaExtension(o, t, {
+        typeSchemaResolver: r.typeSchemaResolver
+      });
     }
     return !1;
   }
   /**
    * Checks if a schema extends a base schema.
    */
-  static checkSchemaExtension(e, t) {
+  static checkSchemaExtension(e, t, r) {
     if (!d(e))
       return !1;
-    const r = V.unwrapSchema(e), n = V.unwrapSchema(t);
-    return Pt(r, n);
+    const n = A.unwrapSchema(e), i = A.unwrapSchema(t);
+    return d(r?.typeSchemaResolver) ? r.typeSchemaResolver.isSchemaExtendedFrom(
+      n,
+      i
+    ) : !1;
   }
   static isWrapperType(e) {
-    return e instanceof ot || e instanceof lt || e instanceof ct || e instanceof at || e instanceof he || e instanceof fe;
+    return e instanceof it || e instanceof ot || e instanceof lt || e instanceof ct || e instanceof fe || e instanceof ge;
   }
   static unwrapSchema(e) {
-    return Nt(e) ? e : V.isWrapperType(e) ? e instanceof he ? V.unwrapSchema(e.innerType()) : e instanceof fe ? V.unwrapSchema(e.schema) : V.unwrapSchema(e.unwrap()) : e;
+    return Bt(e) ? e : A.isWrapperType(e) ? e instanceof fe ? A.unwrapSchema(e.innerType()) : e instanceof ge ? A.unwrapSchema(e.schema) : A.unwrapSchema(e.unwrap()) : e;
+  }
+}
+function et(s, e) {
+  const t = s.getType();
+  if (t === void 0)
+    return;
+  const r = t.getBlueId();
+  if (r !== void 0) {
+    if (le.includes(
+      r
+    )) {
+      const i = gt[r];
+      return new a().setBlueId(r).setName(i);
+    }
+    const n = e.fetchByBlueId(r);
+    if (!n || n.length === 0)
+      return;
+    if (n.length > 1)
+      throw new Error(
+        `Expected a single node for type with blueId '${r}', but found multiple.`
+      );
+    return n[0];
   }
+  return t;
 }
-class kr {
+function b(s, e, t) {
+  const r = T.calculateBlueIdSync(s), n = T.calculateBlueIdSync(e);
+  if (r === n)
+    return !0;
+  if (r && le.includes(
+    r
+  )) {
+    let c = e;
+    for (; c !== void 0; ) {
+      if (T.calculateBlueIdSync(c) === r)
+        return !0;
+      c = et(c, t);
+    }
+    return !1;
+  }
+  let i = s;
+  const o = s.getBlueId();
+  if (o) {
+    const c = t.fetchByBlueId(o);
+    c && c.length === 1 && (i = c[0]);
+  }
+  let l = i;
+  for (; l !== void 0; ) {
+    if (T.calculateBlueIdSync(l) === n)
+      return !0;
+    l = et(l, t);
+  }
+  return !1;
+}
+function Ur(s, e) {
+  return ft.some((t) => {
+    const r = new a().setBlueId(t);
+    return b(s, r, e);
+  });
+}
+function _r(s, e) {
+  const t = new a().setBlueId(_);
+  return b(s, t, e);
+}
+function Kr(s, e) {
+  const t = new a().setBlueId(Y);
+  return b(s, t, e);
+}
+function Yr(s, e) {
+  const t = new a().setBlueId(K);
+  return b(s, t, e);
+}
+function Gr(s, e) {
+  const t = new a().setBlueId(G);
+  return b(s, t, e);
+}
+function Nt(s, e) {
+  const t = new a().setBlueId(pt);
+  return b(s, t, e);
+}
+function Pt(s, e) {
+  const t = new a().setBlueId(ht);
+  return b(s, t, e);
+}
+function zr(s, e) {
+  return Ge.some((t) => {
+    const r = new a().setName(t);
+    return b(s, r, e);
+  });
+}
+function kr(s, e) {
+  for (const t of Ge) {
+    const r = new a().setName(t);
+    if (b(s, r, e))
+      return t;
+  }
+  throw new Error(
+    `Cannot determine the basic type for node of type "${s.getName() || "unknown"}".`
+  );
+}
+class Jr {
   blueIdMap = /* @__PURE__ */ new Map();
-  constructor(e) {
-    this.registerSchemas(e);
+  nodeProvider;
+  constructor(e = [], t) {
+    this.nodeProvider = t?.nodeProvider ?? null, this.registerSchemas(e);
   }
   registerSchemas(e) {
     for (const t of e)
       this.registerSchema(t);
   }
   registerSchema(e) {
-    const t = we.resolveBlueId(e);
+    const t = ne.resolveBlueId(e);
     if (d(t)) {
       if (this.blueIdMap.has(t))
         throw new Error(`Duplicate BlueId value: ${t}`);
       this.blueIdMap.set(t, e);
     }
   }
+  setNodeProvider(e) {
+    this.nodeProvider = e;
+  }
   resolveSchema(e) {
     const t = this.getEffectiveBlueId(e);
     return I(t) ? null : this.blueIdMap.get(t);
   }
+  isSchemaExtendedFrom(e, t) {
+    if (I(e))
+      return !1;
+    const r = this.getBlueIdForSchema(e), n = this.getBlueIdForSchema(t);
+    if (I(r) || I(n))
+      return !1;
+    if (r === n)
+      return !0;
+    if (d(this.nodeProvider))
+      try {
+        const i = new a().setBlueId(r), o = new a().setBlueId(n);
+        if (b(i, o, this.nodeProvider))
+          return !0;
+      } catch {
+      }
+    return !1;
+  }
+  getBlueIdForSchema(e) {
+    if (I(e))
+      return null;
+    const t = ne.resolveBlueId(e);
+    if (d(t))
+      return t;
+    for (const [r, n] of this.blueIdMap)
+      if (n === e || n._def === e._def)
+        return r;
+    return null;
+  }
   getEffectiveBlueId(e) {
     const t = e.getType();
     return d(t) && d(t.getBlueId()) ? t.getBlueId() : d(t) ? T.calculateBlueIdSync(t) : null;
@@ -1432,7 +1542,7 @@ const B = {
   BLUE: "blue",
   ITEMS: "items"
 };
-class He {
+class Ze {
   /**
    * Check if a node is empty (has no fields set)
    */
@@ -1536,12 +1646,12 @@ class He {
     }
   }
 }
-class We {
+class He {
 }
-class re {
+class te {
   static convert(e) {
-    const t = new $e();
-    return re.traverseNode(e, "", t), t.build();
+    const t = new Re();
+    return te.traverseNode(e, "", t), t.build();
   }
   static traverseNode(e, t, r) {
     if (!e)
@@ -1554,12 +1664,12 @@ class re {
     if (n)
       for (const [c, u] of Object.entries(n)) {
         const y = `${t}/${c}`;
-        re.traverseNode(u, y, r);
+        te.traverseNode(u, y, r);
       }
     if (i)
       for (let c = 0; c < i.length; c++) {
         const u = `${t}/${c}`;
-        re.traverseNode(i[c], u, r);
+        te.traverseNode(i[c], u, r);
       }
   }
 }
@@ -1567,7 +1677,7 @@ function tt(s, e) {
   const t = s.split(e), r = [...t].reverse().findIndex((i) => i !== ""), n = r === -1 ? 0 : t.length - r;
   return t.slice(0, n);
 }
-class Be extends We {
+class Be extends He {
   allowedPaths;
   maxDepth;
   currentPath = [];
@@ -1660,7 +1770,7 @@ class Be extends We {
    * @returns The path limits
    */
   static withMaxDepth(e) {
-    const t = new $e().setMaxDepth(e);
+    const t = new Re().setMaxDepth(e);
     for (let r = 1; r <= e; r++) {
       const n = "/" + Array(r).fill("*").join("/");
       t.addPath(n);
@@ -1673,17 +1783,17 @@ class Be extends We {
    * @returns The path limits
    */
   static withSinglePath(e) {
-    return new $e().addPath(e).build();
+    return new Re().addPath(e).build();
   }
   /**
    * Creates path limits by analyzing the structure of a node.
    * Leaf paths (no properties and no items) are added as allowed paths.
    */
   static fromNode(e) {
-    return re.convert(e);
+    return te.convert(e);
   }
 }
-class $e {
+class Re {
   allowedPaths = /* @__PURE__ */ new Set();
   maxDepth = Number.MAX_SAFE_INTEGER;
   /**
@@ -1710,7 +1820,7 @@ class $e {
     return new Be(this.allowedPaths, this.maxDepth);
   }
 }
-class zr extends We {
+class Zr extends He {
   /**
    * Determines if a path segment should be extended - always returns true
    * @returns Always true
@@ -1736,7 +1846,7 @@ class zr extends We {
   exitPathSegment() {
   }
 }
-class Ne extends We {
+class Ne extends He {
   limits;
   /**
    * Creates a composite limits with the specified limit strategies
@@ -1796,106 +1906,8 @@ class Ne extends We {
     return new Ne(e);
   }
 }
-const R = new zr();
-function rt(s, e) {
-  const t = s.getType();
-  if (t === void 0)
-    return;
-  const r = t.getBlueId();
-  if (r !== void 0) {
-    if (le.includes(
-      r
-    )) {
-      const i = yt[r];
-      return new a().setBlueId(r).setName(i);
-    }
-    const n = e.fetchByBlueId(r);
-    if (!n || n.length === 0)
-      return;
-    if (n.length > 1)
-      throw new Error(
-        `Expected a single node for type with blueId '${r}', but found multiple.`
-      );
-    return n[0];
-  }
-  return t;
-}
-function b(s, e, t) {
-  const r = T.calculateBlueIdSync(s), n = T.calculateBlueIdSync(e);
-  if (r === n)
-    return !0;
-  if (r && le.includes(
-    r
-  )) {
-    let c = e;
-    for (; c !== void 0; ) {
-      if (T.calculateBlueIdSync(c) === r)
-        return !0;
-      c = rt(c, t);
-    }
-    return !1;
-  }
-  let i = s;
-  const o = s.getBlueId();
-  if (o) {
-    const c = t.fetchByBlueId(o);
-    c && c.length === 1 && (i = c[0]);
-  }
-  let l = i;
-  for (; l !== void 0; ) {
-    if (T.calculateBlueIdSync(l) === n)
-      return !0;
-    l = rt(l, t);
-  }
-  return !1;
-}
-function Jr(s, e) {
-  return gt.some((t) => {
-    const r = new a().setBlueId(t);
-    return b(s, r, e);
-  });
-}
-function Zr(s, e) {
-  const t = new a().setBlueId(_);
-  return b(s, t, e);
-}
-function Hr(s, e) {
-  const t = new a().setBlueId(Y);
-  return b(s, t, e);
-}
-function Wr(s, e) {
-  const t = new a().setBlueId(K);
-  return b(s, t, e);
-}
-function qr(s, e) {
-  const t = new a().setBlueId(G);
-  return b(s, t, e);
-}
-function Et(s, e) {
-  const t = new a().setBlueId(ht);
-  return b(s, t, e);
-}
-function St(s, e) {
-  const t = new a().setBlueId(ft);
-  return b(s, t, e);
-}
-function Xr(s, e) {
-  return ke.some((t) => {
-    const r = new a().setName(t);
-    return b(s, r, e);
-  });
-}
-function Qr(s, e) {
-  for (const t of ke) {
-    const r = new a().setName(t);
-    if (b(s, r, e))
-      return t;
-  }
-  throw new Error(
-    `Cannot determine the basic type for node of type "${s.getName() || "unknown"}".`
-  );
-}
-class es {
+const R = new Zr();
+class Hr {
   blue;
   constructor(e) {
     this.blue = e;
@@ -2047,7 +2059,7 @@ class es {
    * shape of the requested core list or dictionary type.
    */
   matchesImplicitStructure(e, t) {
-    return t === void 0 || e.getType() !== void 0 ? !1 : Et(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : St(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
+    return t === void 0 || e.getType() !== void 0 ? !1 : Nt(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : Pt(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
   }
   isImplicitListStructure(e) {
     return e.getItems() !== void 0 && e.getValue() === void 0;
@@ -2056,11 +2068,11 @@ class es {
     return e.getProperties() !== void 0 && e.getValue() === void 0;
   }
 }
-const ts = (s) => s instanceof ot || s instanceof lt || s instanceof ct || s instanceof at || s instanceof he || s instanceof fe, rs = (s) => s instanceof J || s instanceof Z || s instanceof ae || s instanceof ue;
-class At {
+const Wr = (s) => s instanceof it || s instanceof ot || s instanceof lt || s instanceof ct || s instanceof fe || s instanceof ge, qr = (s) => s instanceof J || s instanceof Z || s instanceof ue || s instanceof de;
+class Et {
   static convertValue(e, t) {
     const r = e.getType()?.getBlueId(), n = e.getValue();
-    return I(n) ? rs(t) && He.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : n : _ === r ? this.convertFromString(String(n), t) : K === r || n instanceof P ? this.convertFromBigDecimal(
+    return I(n) ? qr(t) && Ze.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : n : _ === r ? this.convertFromString(String(n), t) : K === r || n instanceof P ? this.convertFromBigDecimal(
       new P(n?.toString()),
       t
     ) : Y === r || n instanceof w ? this.convertFromBigInteger(
@@ -2069,13 +2081,13 @@ class At {
     ) : G === r || typeof n == "boolean" ? this.convertFromBoolean(!!n, t) : this.convertFromString(String(n), t);
   }
   static convertFromString(e, t) {
-    if (!t || t instanceof J || t instanceof Gt || t instanceof kt)
+    if (!t || t instanceof J || t instanceof Kt || t instanceof Yt)
       return e;
     if (t instanceof Z)
       return Number(e);
-    if (t instanceof ae)
-      return e.toLowerCase() === "true";
     if (t instanceof ue)
+      return e.toLowerCase() === "true";
+    if (t instanceof de)
       return BigInt(e);
     throw new Error(`Cannot convert String to ${t._def.typeName}`);
   }
@@ -2089,20 +2101,20 @@ class At {
   static convertFromBigInteger(e, t) {
     if (t instanceof Z)
       return e.toNumber();
-    if (t instanceof ue)
+    if (t instanceof de)
       return BigInt(e.toString());
     if (t instanceof J)
       return e.toString();
     throw new Error(`Cannot convert Number to ${t._def.typeName}`);
   }
   static convertFromBoolean(e, t) {
-    if (!t || t instanceof ae)
+    if (!t || t instanceof ue)
       return e;
     if (t instanceof J)
       return e.toString();
     if (t instanceof Z)
       return Number(e);
-    if (t instanceof ue)
+    if (t instanceof de)
       return BigInt(e);
     throw new Error(`Cannot convert Boolean to ${t._def.typeName}`);
   }
@@ -2110,7 +2122,7 @@ class At {
     if (!e) return null;
     if (e instanceof Z)
       return 0;
-    if (e instanceof ae)
+    if (e instanceof ue)
       return !1;
     if (e instanceof J)
       return "";
@@ -2119,12 +2131,12 @@ class At {
     );
   }
 }
-class ss {
+class Xr {
   convert(e, t) {
-    return At.convertValue(e, t);
+    return Et.convertValue(e, t);
   }
 }
-class ns {
+class Qr {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2132,26 +2144,26 @@ class ns {
     return this.convertFields(e, t);
   }
   convertFields(e, t) {
-    if (t instanceof zt) {
+    if (t instanceof Gt) {
       const r = t._def.left, n = t._def.right, i = this.convert(e, r), o = this.convert(e, n);
       return { ...i, ...o };
     }
-    if (t instanceof Jt)
+    if (t instanceof zt)
       throw new Error("Union not supported");
-    if (t instanceof Zt)
+    if (t instanceof kt)
       return Object.keys(t.shape).reduce(
         (n, i) => {
-          const o = e.getProperties(), l = t.shape[i], c = Rr(l);
+          const o = e.getProperties(), l = t.shape[i], c = Fr(l);
           if (d(c)) {
-            const v = Le(c) ? c : i, O = o?.[v], k = O ? T.calculateBlueIdSync(O) : void 0;
-            return n[i] = k, n;
+            const v = je(c) ? c : i, O = o?.[v], z = O ? T.calculateBlueIdSync(O) : void 0;
+            return n[i] = z, n;
           }
-          const u = xr(l);
+          const u = Rr(l);
           if (d(u)) {
             const v = o?.[u];
             return n[i] = v?.getName(), n;
           }
-          const y = Dr(l);
+          const y = Cr(l);
           if (d(y)) {
             const v = o?.[y];
             return n[i] = v?.getDescription(), n;
@@ -2178,7 +2190,7 @@ class ns {
     throw new Error("Unknown schema type, " + t._def.typeName);
   }
 }
-class is {
+class es {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2192,7 +2204,7 @@ class is {
     );
   }
 }
-class os {
+class ts {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2206,7 +2218,7 @@ class os {
     return new Set(i);
   }
 }
-class ls {
+class rs {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2219,22 +2231,22 @@ class ls {
     return d(c) && Object.entries(c).forEach(([u, y]) => {
       const p = new a().setValue(u);
       p.setType(new a().setBlueId(_));
-      const f = At.convertValue(p, r), v = this.nodeToObjectConverter.convert(y, n);
+      const f = Et.convertValue(p, r), v = this.nodeToObjectConverter.convert(y, n);
       i.set(f, v);
-    }), t instanceof Ht ? Object.fromEntries(i) : i;
+    }), t instanceof Jt ? Object.fromEntries(i) : i;
   }
 }
-class cs {
+class ss {
   convert(e) {
     return m.get(e);
   }
 }
-class as {
+class ns {
   convert(e) {
     return m.get(e);
   }
 }
-class us {
+class is {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2248,7 +2260,7 @@ class us {
     );
   }
 }
-const ds = h.union([
+const os = h.union([
   h.literal("ZodString"),
   h.literal("ZodNumber"),
   h.literal("ZodBoolean"),
@@ -2264,53 +2276,54 @@ const ds = h.union([
   h.literal("ZodAny"),
   h.literal("ZodTuple")
 ]);
-class ps {
+class ls {
   constructor(e) {
-    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new ns(
+    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new Qr(
       this.nodeToObjectConverter
     );
   }
   converters = /* @__PURE__ */ new Map();
   complexObjectConverter;
   registerConverters() {
-    const e = new ss(), t = new is(this.nodeToObjectConverter), r = new us(this.nodeToObjectConverter), n = new os(this.nodeToObjectConverter), i = new ls(this.nodeToObjectConverter);
-    this.converters.set("ZodString", e), this.converters.set("ZodNumber", e), this.converters.set("ZodBoolean", e), this.converters.set("ZodBigInt", e), this.converters.set("ZodEnum", e), this.converters.set("ZodNativeEnum", e), this.converters.set("ZodUnknown", new cs()), this.converters.set("ZodAny", new as()), this.converters.set("ZodArray", t), this.converters.set("ZodTuple", r), this.converters.set("ZodSet", n), this.converters.set("ZodMap", i), this.converters.set("ZodRecord", i), this.converters.set("ZodObject", this.complexObjectConverter);
+    const e = new Xr(), t = new es(this.nodeToObjectConverter), r = new is(this.nodeToObjectConverter), n = new ts(this.nodeToObjectConverter), i = new rs(this.nodeToObjectConverter);
+    this.converters.set("ZodString", e), this.converters.set("ZodNumber", e), this.converters.set("ZodBoolean", e), this.converters.set("ZodBigInt", e), this.converters.set("ZodEnum", e), this.converters.set("ZodNativeEnum", e), this.converters.set("ZodUnknown", new ss()), this.converters.set("ZodAny", new ns()), this.converters.set("ZodArray", t), this.converters.set("ZodTuple", r), this.converters.set("ZodSet", n), this.converters.set("ZodMap", i), this.converters.set("ZodRecord", i), this.converters.set("ZodObject", this.complexObjectConverter);
   }
   getConverter(e) {
     const t = this.getSchemaTypeName(e);
     return this.converters.get(t) ?? this.complexObjectConverter;
   }
   getSchemaTypeName(e) {
-    if (ts(e))
-      return e instanceof he ? this.getSchemaTypeName(e.innerType()) : e instanceof fe ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
+    if (Wr(e))
+      return e instanceof fe ? this.getSchemaTypeName(e.innerType()) : e instanceof ge ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
     const t = e._def.typeName;
     try {
-      return ds.parse(t);
+      return os.parse(t);
     } catch {
       throw new Error(`Schema type name ${t} is not supported`);
     }
   }
 }
-class hs {
+class cs {
   constructor(e) {
-    this.typeSchemaResolver = e, this.converterFactory = new ps(this);
+    this.typeSchemaResolver = e, this.converterFactory = new ls(this);
   }
   converterFactory;
   convert(e, t) {
-    const r = this.typeSchemaResolver?.resolveSchema(e), n = V.unwrapSchema(t);
-    if (Nt(n))
+    const r = this.typeSchemaResolver?.resolveSchema(e), n = A.unwrapSchema(t);
+    if (Bt(n))
       return e;
     let i = n;
-    return V.checkSchemaExtension(
+    return A.checkSchemaExtension(
       r,
-      n
+      n,
+      { typeSchemaResolver: this.typeSchemaResolver }
     ) && d(r) && (i = r), this.convertWithType(e, i);
   }
   convertWithType(e, t) {
     return this.converterFactory.getConverter(t).convert(e, t);
   }
 }
-class Vt {
+class St {
   reverse(e) {
     const t = new a();
     return this.reverseNode(t, e, e.getType()), t;
@@ -2371,7 +2384,7 @@ class Vt {
         t,
         r
       ), u = new a();
-      this.reverseNode(u, l, c), He.isEmptyNode(u) || (i[o] = u);
+      this.reverseNode(u, l, c), Ze.isEmptyNode(u) || (i[o] = u);
     }
     Object.keys(i).length > 0 && e.setProperties(i);
   }
@@ -2433,7 +2446,7 @@ class ie extends a {
    * @returns The minimal node representation
    */
   getMinimalNode() {
-    return new Vt().reverse(this);
+    return new St().reverse(this);
   }
   getMinimalBlueId() {
     const e = this.getMinimalNode();
@@ -2457,7 +2470,7 @@ class ie extends a {
     t !== void 0 && this.setValue(t);
   }
 }
-class ce {
+class ae {
   /**
    * Fetches the first node associated with the given Blue ID
    * Default implementation that takes the first node from fetchByBlueId result
@@ -2470,14 +2483,14 @@ class ce {
     return t && t.length > 0 ? t[0] : null;
   }
 }
-function fs(s) {
-  return new class extends ce {
+function as(s) {
+  return new class extends ae {
     fetchByBlueId(e) {
       return s(e);
     }
   }();
 }
-class gs extends ce {
+class us extends ae {
   nodeProviders;
   constructor(e) {
     super(), this.nodeProviders = e;
@@ -2504,31 +2517,31 @@ class gs extends ce {
     return this.nodeProviders;
   }
 }
-const Ve = U.types.float.options, ys = {
+const Ve = U.types.float.options, ds = {
   ...Ve,
   construct: (s) => {
     const e = s.replace(/_/g, "").toLowerCase();
-    if (!it(e))
+    if (!nt(e))
       return new P(e);
     if (Ve.construct)
       return Ve.construct(s);
   }
-}, ms = new U.Type("tag:yaml.org,2002:float", ys), Ce = U.types.int.options, Is = {
+}, ps = new U.Type("tag:yaml.org,2002:float", ds), Ce = U.types.int.options, hs = {
   ...Ce,
   construct: (s) => {
     let e = s;
-    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !it(e))
+    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !nt(e))
       return new w(e);
     if (Ce.construct)
       return Ce.construct(s);
   }
-}, Ts = new U.Type("tag:yaml.org,2002:int", Is), Ct = U.CORE_SCHEMA.extend({
-  implicit: [ms, Ts]
+}, fs = new U.Type("tag:yaml.org,2002:int", hs), At = U.CORE_SCHEMA.extend({
+  implicit: [ps, fs]
 }), F = (s) => {
-  const e = U.load(s, { schema: Ct });
+  const e = U.load(s, { schema: At });
   return e === void 0 ? void 0 : e;
-}, dn = (s) => U.dump(s, {
-  schema: Ct,
+}, on = (s) => U.dump(s, {
+  schema: At,
   replacer: (e, t) => {
     if (S(t)) {
       if (L(t)) {
@@ -2540,7 +2553,7 @@ const Ve = U.types.float.options, ys = {
     }
     return t;
   }
-}), Mt = `- type:
+}), Vt = `- type:
     blueId: 27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo
   mappings:
     Text: DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K
@@ -2551,20 +2564,20 @@ const Ve = U.types.float.options, ys = {
     Dictionary: G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj
 - type:
     blueId: FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4
-`, vs = `name: Transformation
-description: TODO`, bs = `name: Infer Basic Types For Untyped Values
+`, gs = `name: Transformation
+description: TODO`, ys = `name: Infer Basic Types For Untyped Values
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation infers type details for Text, Integer, Number and Boolean.`, ws = `name: Replace Inline Types with BlueIds
+description: This transformation infers type details for Text, Integer, Number and Boolean.`, ms = `name: Replace Inline Types with BlueIds
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation replaces`, Bs = [
-  Mt,
-  vs,
-  bs,
-  ws
+description: This transformation replaces`, Is = [
+  Vt,
+  gs,
+  ys,
+  ms
 ];
-class Ns extends ce {
+class Ts extends ae {
   blueIdToNodesMap = /* @__PURE__ */ new Map();
   constructor() {
     super(), this.load();
@@ -2573,7 +2586,7 @@ class Ns extends ce {
     return this.blueIdToNodesMap.get(e) || [];
   }
   load() {
-    for (const e of Bs) {
+    for (const e of Is) {
       const t = F(e);
       if (t === void 0) {
         console.error(`This content file is not valid YAML: ${e}`);
@@ -2591,11 +2604,11 @@ class Ns extends ce {
     }
   }
 }
-class qe extends ce {
-  static INSTANCE = new qe();
+class We extends ae {
+  static INSTANCE = new We();
   nodeProvider;
   constructor() {
-    super(), this.nodeProvider = new Ns();
+    super(), this.nodeProvider = new Ts();
   }
   fetchByBlueId(e) {
     return this.nodeProvider.fetchByBlueId(e);
@@ -2693,7 +2706,7 @@ class x {
     }
   }
 }
-class Ps extends ce {
+class vs extends ae {
   fetchByBlueId(e) {
     const t = e.split("#")[0], r = this.fetchContentByBlueId(t);
     if (r == null)
@@ -2725,7 +2738,7 @@ class Ps extends ce {
     }
   }
 }
-class Dt extends Ps {
+class Ct extends vs {
   nameToBlueIdsMap = /* @__PURE__ */ new Map();
   /**
    * Find a node by name. Throws an error if multiple nodes are found with the same name.
@@ -2769,17 +2782,17 @@ class Dt extends Ps {
     ]);
   }
 }
-const Ft = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanceof a) ? s : je(s) ? s.map((e) => g.deserialize(e)) : g.deserialize(s), Es = async (s) => {
-  const e = Ft(s);
+const Mt = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanceof a) ? s : xe(s) ? s.map((e) => g.deserialize(e)) : g.deserialize(s), bs = async (s) => {
+  const e = Mt(s);
   return T.calculateBlueId(e);
-}, pn = (s) => {
-  const e = Ft(s);
+}, ln = (s) => {
+  const e = Mt(s);
   return T.calculateBlueIdSync(e);
-}, st = async (s) => {
-  if (cr(s))
+}, rt = async (s) => {
+  if (or(s))
     return s;
   try {
-    const e = me.parse(s), t = await Es(e);
+    const e = Ie.parse(s), t = await bs(e);
     return {
       ...s,
       blueId: t
@@ -2787,31 +2800,31 @@ const Ft = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanc
   } catch (e) {
     throw new Error(`Failed enriching object with Blue ID: ${e}`);
   }
-}, hn = (s) => s?.items, fn = (s) => s?.value, gn = (s) => I(s) ? {} : dt(
+}, cn = (s) => s?.items, an = (s) => s?.value, un = (s) => I(s) ? {} : ut(
   s,
-  tr
-), yn = (s) => ur(s) ? s.type.name ?? null : dr(s) ? Wt(typeof s.value) : ar(s) ? "List" : null, Ss = (s) => d(s) && Object.keys(dt(s, ["blueId"])).length > 0, mn = (s) => {
+  Qt
+), dn = (s) => cr(s) ? s.type.name ?? null : ar(s) ? Zt(typeof s.value) : lr(s) ? "List" : null, ws = (s) => d(s) && Object.keys(ut(s, ["blueId"])).length > 0, pn = (s) => {
   try {
     const e = g.deserialize(s), t = m.get(e);
-    return ne.parse(t);
+    return se.parse(t);
   } catch (e) {
     throw new Error(
       `Failed transforming JSON-like value to BlueObject: ${e}`
     );
   }
-}, nt = async (s) => {
+}, st = async (s) => {
   const {
     resolveFunction: e,
     signal: t = new AbortController().signal,
     omitItems: r
   } = s, n = s.count ?? s.items.length;
-  let i = await qt(s.items, async (l) => await st(l));
+  let i = await Ht(s.items, async (l) => await rt(l));
   const o = Math.max(i?.length - n, 0);
   for (let l = i.length - 1; l >= o; l--)
-    if (!Ss(i[l])) {
+    if (!ws(i[l])) {
       const c = await e(i[l], { signal: t });
       if (Array.isArray(c))
-        return nt({
+        return st({
           ...s,
           items: [
             ...i.slice(0, l),
@@ -2819,9 +2832,9 @@ const Ft = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanc
             ...i.slice(l + 1)
           ]
         });
-      const u = await st(c);
+      const u = await rt(c);
       if (r?.includes(u.blueId))
-        return nt({
+        return st({
           ...s,
           items: [...i.slice(0, l), ...i.slice(l + 1)]
         });
@@ -2833,7 +2846,7 @@ const Ft = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanc
     }
   return i;
 };
-function de(s) {
+function pe(s) {
   try {
     const e = new URL(s);
     return e.protocol === "http:" || e.protocol === "https:";
@@ -2841,7 +2854,7 @@ function de(s) {
     return !1;
   }
 }
-class As {
+class Bs {
   /**
    * Process a document node to infer basic types for untyped values
    * @param document - The document to process
@@ -2860,7 +2873,7 @@ class As {
     return I(t) && d(r) && (typeof r == "string" ? e.setType(new a().setBlueId(_)) : typeof r == "bigint" || L(r) ? e.setType(new a().setBlueId(Y)) : De(r) ? e.setType(new a().setBlueId(K)) : typeof r == "boolean" && e.setType(new a().setBlueId(G))), e;
   }
 }
-class Te {
+class ve {
   static MAPPINGS = "mappings";
   mappings = /* @__PURE__ */ new Map();
   /**
@@ -2870,8 +2883,8 @@ class Te {
   constructor(e) {
     if (e instanceof a) {
       const r = e.getProperties();
-      if (r && r[Te.MAPPINGS]) {
-        const i = r[Te.MAPPINGS].getProperties();
+      if (r && r[ve.MAPPINGS]) {
+        const i = r[ve.MAPPINGS].getProperties();
         i && Object.entries(i).forEach(([o, l]) => {
           const c = l.getValue();
           typeof c == "string" && this.mappings.set(o, c);
@@ -2905,7 +2918,7 @@ class Te {
     }
   }
 }
-class Vs {
+class Ns {
   /**
    * Process a document node to validate all inline types have been replaced
    * @param document - The document to process
@@ -2927,7 +2940,7 @@ class Vs {
     }
   }
 }
-class Xe {
+class qe {
   nodeProvider;
   strategy;
   /**
@@ -2963,7 +2976,7 @@ class Xe {
             const v = f[0];
             this.mergeNodes(e, v);
           } else {
-            const v = f.map((k) => k.clone()), O = new a().setItems(v);
+            const v = f.map((z) => z.clone()), O = new a().setItems(v);
             this.mergeNodes(e, O);
           }
       }
@@ -3021,7 +3034,7 @@ class Xe {
     d(r) && e.setValue(r), e.setItems(t.getItems()), e.setProperties(t.getProperties());
   }
 }
-class Ot {
+class Dt {
   blueIdsCollections = [];
   /**
    * Initializes the generator with default BlueIds collections
@@ -3105,7 +3118,7 @@ class X {
     const { nodeProvider: t, processorProvider: r, blueIdsMappingGenerator: n } = e;
     if (!t)
       throw new Error("NodeProvider is required");
-    this.nodeProvider = oe.wrap(t), this.processorProvider = r || X.getStandardProvider(), this.blueIdsMappingGenerator = n || new Ot(), this.loadDefaultSimpleBlue();
+    this.nodeProvider = oe.wrap(t), this.processorProvider = r || X.getStandardProvider(), this.blueIdsMappingGenerator = n || new Dt(), this.loadDefaultSimpleBlue();
   }
   /**
    * Preprocesses a document node
@@ -3132,7 +3145,7 @@ class X {
   preprocessWithOptions(e, t) {
     let r = e.clone(), n = r.getBlue();
     if (!n && t && (n = t.clone()), n) {
-      new Xe(this.nodeProvider).extend(
+      new qe(this.nodeProvider).extend(
         n,
         Be.withSinglePath("/*")
       );
@@ -3149,7 +3162,7 @@ class X {
         }
         r.setBlue(void 0);
       }
-      r = new Vs().process(
+      r = new Ns().process(
         r
       );
     }
@@ -3164,11 +3177,11 @@ class X {
       getProcessor(e) {
         const t = "27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo", r = "FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4", n = e.getType()?.getBlueId();
         if (t === n)
-          return new Te(
+          return new ve(
             e
           );
         if (r === n)
-          return new As();
+          return new Bs();
       }
     };
   }
@@ -3188,7 +3201,7 @@ ${t}
    * Loads the default simple Blue node
    */
   loadDefaultSimpleBlue() {
-    const e = this.enrichDefaultBlue(Mt);
+    const e = this.enrichDefaultBlue(Vt);
     try {
       const t = F(e);
       if (t)
@@ -3200,7 +3213,7 @@ ${t}
     }
   }
 }
-class Cs extends Dt {
+class Ps extends Ct {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   preprocessor;
@@ -3275,15 +3288,15 @@ class oe {
    * @returns A wrapped NodeProvider that includes bootstrap providers and repository definitions
    */
   static wrap(e, t) {
-    const r = [qe.INSTANCE];
+    const r = [We.INSTANCE];
     if (t && t.length > 0) {
-      const n = new Cs(t);
+      const n = new Ps(t);
       r.push(n);
     }
-    return r.push(e), new gs(r);
+    return r.push(e), new us(r);
   }
 }
-class Ms {
+class Es {
   preprocessingAliases = /* @__PURE__ */ new Map();
   urlContentFetcher;
   /**
@@ -3307,9 +3320,9 @@ class Ms {
       const r = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(r, t);
-      if (ye.isPotentialBlueId(t))
+      if (me.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      throw de(t) ? new Error(
+      throw pe(t) ? new Error(
         `URL '${t}' detected. Use the async version of this method to fetch the content.`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -3327,9 +3340,9 @@ class Ms {
       const r = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(r, t);
-      if (ye.isPotentialBlueId(t))
+      if (me.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      if (de(t) && this.urlContentFetcher)
+      if (pe(t) && this.urlContentFetcher)
         try {
           const n = await this.fetchFromUrl(t);
           return n && r.setBlue(new a().setItems(n)), r;
@@ -3339,7 +3352,7 @@ class Ms {
 ${n.message}`
           ) : n;
         }
-      else throw de(t) ? new Error(
+      else throw pe(t) ? new Error(
         `UrlContentFetcher not provided for URL: ${t}`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -3425,24 +3438,24 @@ ${n.message}`
     return this.urlContentFetcher;
   }
 }
-const Ds = {
+const Ss = {
   fetchUrl: async (s) => {
     throw new Error(
       `You must provide a custom UrlFetchStrategy to fetch content from URL: ${s}`
     );
   }
 };
-class Fs {
+class As {
   // Cache to avoid repeated network requests for the same URL
   cache = /* @__PURE__ */ new Map();
   fetchStrategy;
   enabled = !1;
   allowedDomains = [];
   constructor(e) {
-    this.fetchStrategy = e || Ds;
+    this.fetchStrategy = e || Ss;
   }
   validateUrl(e) {
-    if (!de(e))
+    if (!pe(e))
       throw new Error(`Invalid URL: ${e}`);
     return !0;
   }
@@ -3561,7 +3574,7 @@ class Fs {
     return this.allowedDomains = [], this;
   }
 }
-class Os {
+class Vs {
   /**
    * Resolves a node without limits
    * Default implementation that uses NO_LIMITS
@@ -3573,7 +3586,7 @@ class Os {
     return this.resolve(e, R);
   }
 }
-class Rs extends Os {
+class Cs extends Vs {
   mergingProcessor;
   nodeProvider;
   /**
@@ -3600,7 +3613,7 @@ class Rs extends Os {
     const i = t.getType();
     if (d(i)) {
       const o = i.clone();
-      d(o.getBlueId()) && new Xe(this.nodeProvider).extend(
+      d(o.getBlueId()) && new qe(this.nodeProvider).extend(
         o,
         Be.withSinglePath("/")
       );
@@ -3705,7 +3718,7 @@ class Rs extends Os {
     return new ie(i);
   }
 }
-class Rt {
+class Ft {
   mergingProcessors;
   /**
    * Creates a new SequentialMergingProcessor with the given processors
@@ -3730,14 +3743,14 @@ class Rt {
     return this.mergingProcessors.reduce((n, i) => i.postProcess ? i.postProcess(n, t, r) : n, e);
   }
 }
-class $t {
+class Ot {
   process(e, t) {
     const r = t.getValue();
     if (d(r)) {
       const n = e.getValue();
       if (I(n))
         return e.clone().setValue(r);
-      if (!$s(r, n))
+      if (!Ms(r, n))
         throw new Error(
           `Node values conflict. Source node value: ${r}, target node value: ${n}`
         );
@@ -3745,8 +3758,8 @@ class $t {
     return e;
   }
 }
-const $s = (s, e) => L(s) && L(e) || De(s) && De(e) ? s.eq(e) : s === e;
-class xt {
+const Ms = (s, e) => L(s) && L(e) || De(s) && De(e) ? s.eq(e) : s === e;
+class Rt {
   process(e, t, r) {
     const n = e.getType(), i = t.getType();
     let o = e;
@@ -3772,10 +3785,10 @@ class xt {
     return o;
   }
 }
-class jt {
+class $t {
   process(e, t, r) {
     const n = t.getItemType(), i = t.getType();
-    if (n !== void 0 && i !== void 0 && !Et(i, r))
+    if (n !== void 0 && i !== void 0 && !Nt(i, r))
       throw new Error("Source node with itemType must have a List type");
     const o = e.getItemType();
     let l = e;
@@ -3822,10 +3835,10 @@ class jt {
     return l;
   }
 }
-class Lt {
+class xt {
   process(e, t, r) {
     const n = t.getKeyType(), i = t.getValueType(), o = t.getType();
-    if ((n !== void 0 || i !== void 0) && o !== void 0 && !St(o, r))
+    if ((n !== void 0 || i !== void 0) && o !== void 0 && !Pt(o, r))
       throw new Error(
         "Source node with keyType or valueType must have a Dictionary type"
       );
@@ -3885,20 +3898,20 @@ class Lt {
     return e;
   }
   validateBasicKeyType(e, t) {
-    if (!Jr(e, t))
+    if (!Ur(e, t))
       throw new Error("Dictionary key type must be a basic type");
   }
   validateKeyType(e, t, r) {
-    if (!Zr(t, r))
-      if (Hr(t, r)) {
+    if (!_r(t, r))
+      if (Kr(t, r)) {
         const n = Number.parseInt(e, 10);
         if (Number.isNaN(n) || n.toString() !== e)
           throw new Error(`Key '${e}' is not a valid Integer.`);
-      } else if (Wr(t, r)) {
+      } else if (Yr(t, r)) {
         const n = Number.parseFloat(e);
         if (Number.isNaN(n))
           throw new Error(`Key '${e}' is not a valid Number.`);
-      } else if (qr(t, r)) {
+      } else if (Gr(t, r)) {
         if (e.toLowerCase() !== "true" && e.toLowerCase() !== "false")
           throw new Error(`Key '${e}' is not a valid Boolean.`);
       } else
@@ -3920,16 +3933,16 @@ class Lt {
     }
   }
 }
-class Ut {
+class jt {
   process(e) {
     return e;
   }
   postProcess(e, t, r) {
     const n = e.getType();
-    if (n !== void 0 && Xr(n, r)) {
+    if (n !== void 0 && zr(n, r)) {
       const i = e.getItems(), o = e.getProperties();
       if (i !== void 0 && i.length > 0 || o !== void 0 && Object.keys(o).length > 0) {
-        const l = Qr(
+        const l = kr(
           n,
           r
         ), c = n.getName() || "unknown";
@@ -3941,7 +3954,7 @@ class Ut {
     return e;
   }
 }
-class _t {
+class Lt {
   process(e, t) {
     let r = e;
     const n = t.getName(), i = e.getName();
@@ -3950,32 +3963,32 @@ class _t {
     return o !== void 0 && l === void 0 && (r = r.clone().setDescription(o)), r;
   }
 }
-const In = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const hn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BasicTypesVerifier: Ut,
-  DictionaryProcessor: Lt,
-  ListProcessor: jt,
-  MetadataPropagator: _t,
-  SequentialMergingProcessor: Rt,
-  TypeAssigner: xt,
-  ValuePropagator: $t
+  BasicTypesVerifier: jt,
+  DictionaryProcessor: xt,
+  ListProcessor: $t,
+  MetadataPropagator: Lt,
+  SequentialMergingProcessor: Ft,
+  TypeAssigner: Rt,
+  ValuePropagator: Ot
 }, Symbol.toStringTag, { value: "Module" }));
-function xs() {
-  return new Rt([
+function Ds() {
+  return new Ft([
+    new Ot(),
+    new Rt(),
     new $t(),
     new xt(),
-    new jt(),
     new Lt(),
-    new _t(),
-    new Ut()
+    new jt()
   ]);
 }
-class js {
+class Fs {
   nodeProvider;
   blueIdToInlineValue = /* @__PURE__ */ new Map();
   constructor(e) {
     const { nodeProvider: t, blueIdsMappingGenerator: r } = e;
-    this.nodeProvider = t, Object.entries(yt).forEach(([i, o]) => {
+    this.nodeProvider = t, Object.entries(gt).forEach(([i, o]) => {
       this.blueIdToInlineValue.set(i, o);
     });
     const n = r.getAllBlueIds();
@@ -4036,7 +4049,7 @@ class js {
       return this.blueIdToInlineValue.set(e, o), o;
   }
 }
-class Tn {
+class fn {
   nodeProvider;
   typeSchemaResolver;
   blueDirectivePreprocessor;
@@ -4054,14 +4067,14 @@ class Tn {
       mergingProcessor: o
     } = e;
     this.repositories = i;
-    const l = fs(() => []);
+    const l = as(() => []);
     if (this.nodeProvider = oe.wrap(
       t || l,
       i
-    ), this.typeSchemaResolver = r ?? new kr([]), this.mergingProcessor = o ?? xs(), this.urlContentFetcher = new Fs(n), this.blueDirectivePreprocessor = new Ms(
+    ), this.typeSchemaResolver = r ?? new Jr([], { nodeProvider: this.nodeProvider }), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this.mergingProcessor = o ?? Ds(), this.urlContentFetcher = new As(n), this.blueDirectivePreprocessor = new Es(
       void 0,
       this.urlContentFetcher
-    ), this.blueIdsMappingGenerator = new Ot(), i)
+    ), this.blueIdsMappingGenerator = new Dt(), i)
       for (const { schemas: c, blueIds: u } of i)
         this.typeSchemaResolver?.registerSchemas(c), this.blueIdsMappingGenerator.registerBlueIds(u);
   }
@@ -4076,11 +4089,11 @@ class Tn {
     return m.get(e, t);
   }
   nodeToSchemaOutput(e, t) {
-    return new hs(this.typeSchemaResolver).convert(e, t);
+    return new cs(this.typeSchemaResolver).convert(e, t);
   }
   resolve(e, t = R) {
     const r = this.combineWithGlobalLimits(t);
-    return new Rs(this.mergingProcessor, this.nodeProvider).resolve(e, r);
+    return new Cs(this.mergingProcessor, this.nodeProvider).resolve(e, r);
   }
   /**
    * Wraps an already resolved (merged) BlueNode in a ResolvedBlueNode.
@@ -4094,7 +4107,7 @@ class Tn {
     return e instanceof ie ? e : new ie(e);
   }
   reverse(e) {
-    return new Vt().reverse(e);
+    return new St().reverse(e);
   }
   /**
    * Returns a copy of the provided node with any referenced types converted back to their
@@ -4104,14 +4117,14 @@ class Tn {
    * repository-backed definitions currently known to this {@link Blue} instance.
    */
   restoreInlineTypes(e) {
-    return new js({
+    return new Fs({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).restore(e);
   }
   extend(e, t) {
     const r = this.combineWithGlobalLimits(t);
-    new Xe(this.nodeProvider).extend(e, r);
+    new qe(this.nodeProvider).extend(e, r);
   }
   jsonValueToNode(e) {
     return this.preprocess(g.deserialize(e));
@@ -4170,13 +4183,13 @@ class Tn {
     return this.nodeProvider = oe.wrap(
       e,
       this.repositories
-    ), this;
+    ), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this;
   }
   getTypeSchemaResolver() {
     return this.typeSchemaResolver;
   }
   setTypeSchemaResolver(e) {
-    return this.typeSchemaResolver = e, this;
+    return this.typeSchemaResolver = e, this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this;
   }
   getUrlContentFetcher() {
     return this.urlContentFetcher;
@@ -4291,7 +4304,7 @@ class Tn {
    * @returns true if the node matches the schema type, false otherwise
    */
   isTypeOf(e, t, r) {
-    return V.isTypeOf(e, t, {
+    return A.isTypeOf(e, t, {
       checkSchemaExtensions: r?.checkSchemaExtensions,
       typeSchemaResolver: this.typeSchemaResolver
     });
@@ -4304,7 +4317,7 @@ class Tn {
    * @returns true if the node matches the type, false otherwise.
    */
   isTypeOfNode(e, t) {
-    return new es(this).matchesType(e, t, this.globalLimits);
+    return new Hr(this).matchesType(e, t, this.globalLimits);
   }
   /**
    * Sets the global limits for this Blue instance.
@@ -4328,7 +4341,7 @@ class Tn {
     return this.globalLimits == R ? e : e == R ? this.globalLimits : Ne.of(this.globalLimits, e);
   }
 }
-class vn extends Dt {
+class gn extends Ct {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   preprocessor;
@@ -4338,7 +4351,7 @@ class vn extends Dt {
     this.preprocessor = (r) => t.preprocessWithDefaultBlue(r), e.forEach((r) => this.processNode(r));
   }
   processNode(e) {
-    He.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
+    Ze.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
   }
   processSingleNode(e) {
     const t = x.parseAndCalculateBlueIdForNode(
@@ -4455,72 +4468,69 @@ class vn extends Dt {
   }
 }
 export {
-  Tr as Base58Sha256Provider,
-  vn as BasicNodeProvider,
-  Tn as Blue,
+  mr as Base58Sha256Provider,
+  gn as BasicNodeProvider,
+  fn as Blue,
   T as BlueIdCalculator,
-  sn as BlueIdToCid,
+  Xs as BlueIdToCid,
   a as BlueNode,
-  V as BlueNodeTypeSchema,
-  Ir as JsonCanonicalizer,
-  We as Limits,
-  Rs as Merger,
-  In as MergingProcessors,
-  Os as NodeResolver,
-  He as Nodes,
+  A as BlueNodeTypeSchema,
+  yr as JsonCanonicalizer,
+  He as Limits,
+  Cs as Merger,
+  hn as MergingProcessors,
+  Vs as NodeResolver,
+  Ze as Nodes,
   ie as ResolvedBlueNode,
-  kr as TypeSchemaResolver,
-  nn as applyBlueNodePatch,
-  be as baseBlueObjectSchema,
-  on as blueDescriptionField,
-  ln as blueIdField,
-  Zs as blueIdSchema,
-  cn as blueNameField,
-  an as blueNodeField,
-  qs as blueObjectBooleanValueSchema,
-  Ws as blueObjectNumberValueSchema,
-  ne as blueObjectSchema,
-  Xs as blueObjectStringListItemsSchema,
-  Hs as blueObjectStringValueSchema,
-  Es as calculateBlueId,
-  pn as calculateBlueIdSync,
-  st as enrichWithBlueId,
-  Dr as getBlueDescriptionAnnotation,
-  Rr as getBlueIdAnnotation,
-  xr as getBlueNameAnnotation,
-  Lr as getBlueNodeAnnotation,
-  hn as getBlueObjectItems,
-  gn as getBlueObjectProperties,
-  yn as getBlueObjectTypeLabel,
-  fn as getBlueObjectValue,
-  _r as getExtendedFromSchemaAnnotation,
-  Gr as getTypeBlueIdAnnotation,
-  cr as hasBlueObjectBlueIdDefined,
-  ar as hasBlueObjectItemsDefined,
-  en as hasBlueObjectNameDefined,
-  ur as hasBlueObjectTypeDefined,
-  dr as hasBlueObjectValueDefined,
+  Jr as TypeSchemaResolver,
+  Qs as applyBlueNodePatch,
+  we as baseBlueObjectSchema,
+  en as blueDescriptionField,
+  tn as blueIdField,
+  Ys as blueIdSchema,
+  rn as blueNameField,
+  sn as blueNodeField,
+  ks as blueObjectBooleanValueSchema,
+  zs as blueObjectNumberValueSchema,
+  se as blueObjectSchema,
+  Js as blueObjectStringListItemsSchema,
+  Gs as blueObjectStringValueSchema,
+  bs as calculateBlueId,
+  ln as calculateBlueIdSync,
+  rt as enrichWithBlueId,
+  Cr as getBlueDescriptionAnnotation,
+  Fr as getBlueIdAnnotation,
+  Rr as getBlueNameAnnotation,
+  xr as getBlueNodeAnnotation,
+  cn as getBlueObjectItems,
+  un as getBlueObjectProperties,
+  dn as getBlueObjectTypeLabel,
+  an as getBlueObjectValue,
+  Lr as getTypeBlueIdAnnotation,
+  or as hasBlueObjectBlueIdDefined,
+  lr as hasBlueObjectItemsDefined,
+  Hs as hasBlueObjectNameDefined,
+  cr as hasBlueObjectTypeDefined,
+  ar as hasBlueObjectValueDefined,
   De as isBigDecimalNumber,
   L as isBigIntegerNumber,
   S as isBigNumber,
-  Nt as isBlueNodeSchema,
-  Qs as isBlueObject,
-  Ss as isBlueObjectResolved,
-  tn as isGivenBlueObjectTypeSchema,
-  It as isJsonBlueArray,
-  mt as isJsonBlueObject,
-  rn as isJsonBlueValue,
-  Pt as isSchemaExtendedFrom,
-  de as isUrl,
-  me as jsonBlueValueSchema,
-  mn as normalizeToBlueObject,
-  nt as resolveBlueObjectItems,
-  Mr as withBlueDescription,
-  Or as withBlueId,
-  $r as withBlueName,
-  jr as withBlueNode,
-  Ur as withExtendedFromSchema,
-  un as withTypeBlueId,
-  dn as yamlBlueDump,
+  Bt as isBlueNodeSchema,
+  Zs as isBlueObject,
+  ws as isBlueObjectResolved,
+  Ws as isGivenBlueObjectTypeSchema,
+  mt as isJsonBlueArray,
+  yt as isJsonBlueObject,
+  qs as isJsonBlueValue,
+  pe as isUrl,
+  Ie as jsonBlueValueSchema,
+  pn as normalizeToBlueObject,
+  st as resolveBlueObjectItems,
+  Vr as withBlueDescription,
+  Dr as withBlueId,
+  Or as withBlueName,
+  $r as withBlueNode,
+  nn as withTypeBlueId,
+  on as yamlBlueDump,
   F as yamlBlueParse
 };