@blue-labs/language 3.8.0 → 3.9.1

package/dist/index.mjs

@@ -1,88 +1,88 @@
-import D from "big.js";
-import { isNullable as m, isNonNullable as d, jsonPrimitiveSchema as cr, isReadonlyArray as Pe, isJsonPrimitive as et, isPreciseNumberString as Pt } from "@blue-labs/shared-utils";
-import { z as h, ZodOptional as Nt, ZodNullable as St, ZodReadonly as Ct, ZodBranded as At, ZodEffects as Ne, ZodLazy as Se, ZodString as ee, ZodNumber as te, ZodBoolean as Be, ZodBigInt as be, ZodEnum as ur, ZodNativeEnum as dr, ZodIntersection as pr, ZodUnion as hr, ZodObject as fr, ZodRecord as yr } from "zod";
-import ue from "bs58";
-import { isObject as Vt, isArray as tt, isString as rt, omit as Rt, pascal as gr, map as mr } from "radash";
-import { OBJECT_CONTRACTS as V, OBJECT_MERGE_POLICY as Ir, OBJECT_SCHEMA as Tr, BLUE_REPOSITORY_STATUS_STABLE as ae, BLUE_REPOSITORY_STATUS_DEV as st, validateAttributesAddedPointer as vr, parsePointer as Ot } from "@blue-labs/repository-contract";
-import { sha256 as Br } from "js-sha256";
-import Ue from "crypto";
-import br from "base32.js";
-import H from "js-yaml";
-class S extends D {
+import j from "big.js";
+import { isNullable as m, isNonNullable as d, jsonPrimitiveSchema as dr, isReadonlyArray as Ae, isJsonPrimitive as it, isPreciseNumberString as Vt } from "@blue-labs/shared-utils";
+import { z as p, ZodOptional as Rt, ZodNullable as Ot, ZodReadonly as Mt, ZodBranded as Dt, ZodEffects as Ve, ZodLazy as Re, ZodString as re, ZodNumber as se, ZodBoolean as we, ZodBigInt as Pe, ZodEnum as pr, ZodNativeEnum as hr, ZodIntersection as fr, ZodUnion as yr, ZodObject as gr, ZodRecord as mr } from "zod";
+import pe from "bs58";
+import { isObject as xt, isArray as ot, isString as lt, omit as Ft, pascal as Ir, map as Tr } from "radash";
+import { OBJECT_CONTRACTS as M, OBJECT_MERGE_POLICY as vr, OBJECT_SCHEMA as Br, BLUE_REPOSITORY_STATUS_STABLE as ue, BLUE_REPOSITORY_STATUS_DEV as at, validateAttributesAddedPointer as br, parsePointer as $t } from "@blue-labs/repository-contract";
+import { sha256 as wr } from "js-sha256";
+import Ge from "crypto";
+import Pr from "base32.js";
+import ee from "js-yaml";
+class A extends j {
   constructor(e) {
     super(e);
   }
 }
-class E extends D {
+class N extends j {
   constructor(e) {
     super(e);
   }
 }
-const G = "name", J = "description", W = "type", fe = "itemType", ye = "keyType", ge = "valueType", me = "value", Me = "items", x = "blueId", De = "blue", nt = [
-  G,
-  J,
-  W,
-  fe,
-  ye,
+const H = "name", X = "description", q = "type", ge = "itemType", me = "keyType", Ie = "valueType", Te = "value", $e = "items", U = "blueId", _e = "blue", ct = [
+  H,
+  X,
+  q,
   ge,
   me,
-  Me,
-  x,
-  De
-], Mt = "Text", Dt = "Double", xt = "Integer", Ft = "Boolean", $t = "List", _t = "Dictionary", xe = [
-  Mt,
-  Dt,
-  xt,
-  Ft
-], it = [...xe, $t, _t], _ = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", L = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", j = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", U = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", ot = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", lt = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", at = [
-  _,
-  L,
-  j,
-  U
-], X = [
-  ...at,
-  ot,
-  lt
-], wr = Object.fromEntries(
-  it.map((s, e) => [s, X[e]])
-), Fe = Object.fromEntries(
-  X.map((s, e) => [s, it[e]])
-), On = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  Ie,
+  Te,
+  $e,
+  U,
+  _e
+], _t = "Text", Lt = "Double", jt = "Integer", Ut = "Boolean", kt = "List", Kt = "Dictionary", Le = [
+  _t,
+  Lt,
+  jt,
+  Ut
+], ut = [...Le, kt, Kt], Y = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", z = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", G = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", J = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", dt = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", pt = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", ht = [
+  Y,
+  z,
+  G,
+  J
+], te = [
+  ...ht,
+  dt,
+  pt
+], Er = Object.fromEntries(
+  ut.map((s, e) => [s, te[e]])
+), je = Object.fromEntries(
+  te.map((s, e) => [s, ut[e]])
+), Dn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BASIC_TYPES: xe,
-  BASIC_TYPE_BLUE_IDS: at,
-  BOOLEAN_TYPE: Ft,
-  BOOLEAN_TYPE_BLUE_ID: U,
-  CORE_TYPES: it,
-  CORE_TYPE_BLUE_IDS: X,
-  CORE_TYPE_BLUE_ID_TO_NAME_MAP: Fe,
-  CORE_TYPE_NAME_TO_BLUE_ID_MAP: wr,
-  DICTIONARY_TYPE: _t,
-  DICTIONARY_TYPE_BLUE_ID: lt,
-  DOUBLE_TYPE: Dt,
-  DOUBLE_TYPE_BLUE_ID: L,
-  INTEGER_TYPE: xt,
-  INTEGER_TYPE_BLUE_ID: j,
-  LIST_TYPE: $t,
-  LIST_TYPE_BLUE_ID: ot,
-  OBJECT_BLUE: De,
-  OBJECT_BLUE_ID: x,
-  OBJECT_CONTRACTS: V,
-  OBJECT_DESCRIPTION: J,
-  OBJECT_ITEMS: Me,
-  OBJECT_ITEM_TYPE: fe,
-  OBJECT_KEY_TYPE: ye,
-  OBJECT_MERGE_POLICY: Ir,
-  OBJECT_NAME: G,
-  OBJECT_SCHEMA: Tr,
-  OBJECT_SPECIFIC_KEYS: nt,
-  OBJECT_TYPE: W,
-  OBJECT_VALUE: me,
-  OBJECT_VALUE_TYPE: ge,
-  TEXT_TYPE: Mt,
-  TEXT_TYPE_BLUE_ID: _
+  BASIC_TYPES: Le,
+  BASIC_TYPE_BLUE_IDS: ht,
+  BOOLEAN_TYPE: Ut,
+  BOOLEAN_TYPE_BLUE_ID: J,
+  CORE_TYPES: ut,
+  CORE_TYPE_BLUE_IDS: te,
+  CORE_TYPE_BLUE_ID_TO_NAME_MAP: je,
+  CORE_TYPE_NAME_TO_BLUE_ID_MAP: Er,
+  DICTIONARY_TYPE: Kt,
+  DICTIONARY_TYPE_BLUE_ID: pt,
+  DOUBLE_TYPE: Lt,
+  DOUBLE_TYPE_BLUE_ID: z,
+  INTEGER_TYPE: jt,
+  INTEGER_TYPE_BLUE_ID: G,
+  LIST_TYPE: kt,
+  LIST_TYPE_BLUE_ID: dt,
+  OBJECT_BLUE: _e,
+  OBJECT_BLUE_ID: U,
+  OBJECT_CONTRACTS: M,
+  OBJECT_DESCRIPTION: X,
+  OBJECT_ITEMS: $e,
+  OBJECT_ITEM_TYPE: ge,
+  OBJECT_KEY_TYPE: me,
+  OBJECT_MERGE_POLICY: vr,
+  OBJECT_NAME: H,
+  OBJECT_SCHEMA: Br,
+  OBJECT_SPECIFIC_KEYS: ct,
+  OBJECT_TYPE: q,
+  OBJECT_VALUE: Te,
+  OBJECT_VALUE_TYPE: Ie,
+  TEXT_TYPE: _t,
+  TEXT_TYPE_BLUE_ID: Y
 }, Symbol.toStringTag, { value: "Module" }));
-class Er {
+class Nr {
   static get(e, t, r, n = !0) {
     if (m(t) || !t.startsWith("/"))
       throw new Error(`Invalid path: ${t}`);
@@ -178,7 +178,7 @@ class Er {
           i = new c().setProperties(l);
           break;
         }
-        case V: {
+        case M: {
           const l = e.getContracts();
           i = new c().setContracts(l);
           break;
@@ -256,18 +256,18 @@ class c {
   getValue() {
     const e = this.type?.getBlueId();
     if (d(e) && d(this.value)) {
-      if (e === j && typeof this.value == "string")
-        return new E(this.value);
-      if (e === L && typeof this.value == "string") {
-        const t = new S(this.value), r = parseFloat(t.toString());
-        return new S(r.toString());
-      } else if (e === U && typeof this.value == "string")
+      if (e === G && typeof this.value == "string")
+        return new N(this.value);
+      if (e === z && typeof this.value == "string") {
+        const t = new A(this.value), r = parseFloat(t.toString());
+        return new A(r.toString());
+      } else if (e === J && typeof this.value == "string")
         return this.value.toLowerCase() === "true";
     }
     return this.value;
   }
   setValue(e) {
-    return typeof e == "number" ? e % 1 === 0 ? this.value = new E(e.toString()) : this.value = new S(e.toString()) : this.value = e, this;
+    return typeof e == "number" ? e % 1 === 0 ? this.value = new N(e.toString()) : this.value = new A(e.toString()) : this.value = e, this;
   }
   getItems() {
     return this.items;
@@ -291,21 +291,21 @@ class c {
     return this.properties && delete this.properties[e], this;
   }
   getContractsProperty() {
-    return this.properties?.[V];
+    return this.properties?.[M];
   }
   getContracts() {
     return this.getContractsProperty()?.getProperties();
   }
   setContracts(e) {
-    return m(e) ? this.removeProperty(V) : this.addProperty(
-      V,
+    return m(e) ? this.removeProperty(M) : this.addProperty(
+      M,
       new c().setProperties(e)
     ), this;
   }
   addContract(e, t) {
     const r = this.getContractsProperty();
     return m(r) ? this.addProperty(
-      V,
+      M,
       new c().addProperty(e, t)
     ) : r.addProperty(e, t), this;
   }
@@ -314,7 +314,7 @@ class c {
     if (t) {
       t.removeProperty(e);
       const r = t.getProperties();
-      r && Object.keys(r).length === 0 && this.removeProperty(V);
+      r && Object.keys(r).length === 0 && this.removeProperty(M);
     }
     return this;
   }
@@ -344,7 +344,7 @@ class c {
     return !1;
   }
   get(e, t) {
-    return Er.get(this, e, t);
+    return Nr.get(this, e, t);
   }
   getAsNode(e) {
     const t = this.get(e);
@@ -354,7 +354,7 @@ class c {
   }
   getAsInteger(e) {
     const t = this.get(e);
-    if (t instanceof E || t instanceof S)
+    if (t instanceof N || t instanceof A)
       return t.toNumber();
     throw new Error(
       `Value at path ${e} is not a BigInteger or BigDecimal: ${t}`
@@ -374,7 +374,7 @@ class c {
     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 Ce {
+class Oe {
   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+)?$/;
@@ -385,7 +385,7 @@ class Ce {
     if (n < this.MIN_BLUE_ID_LENGTH || n > this.MAX_BLUE_ID_LENGTH)
       return !1;
     try {
-      if (ue.decode(r).length !== 32)
+      if (pe.decode(r).length !== 32)
         return !1;
     } catch {
       return !1;
@@ -400,14 +400,14 @@ class Ce {
     return !0;
   }
 }
-const Mn = h.string().max(Ce.MAX_BLUE_ID_LENGTH, {
+const xn = p.string().max(Oe.MAX_BLUE_ID_LENGTH, {
   message: "Blue Id has a maximum length of 45 characters"
-}).min(Ce.MIN_BLUE_ID_LENGTH, {
+}).min(Oe.MIN_BLUE_ID_LENGTH, {
   message: "Blue Id has a minimum length of 41 characters"
 }).refine(
   (s) => {
     try {
-      return ue.decode(s), !0;
+      return pe.decode(s), !0;
     } catch {
       return !1;
     }
@@ -415,115 +415,115 @@ const Mn = h.string().max(Ce.MAX_BLUE_ID_LENGTH, {
   {
     message: "Blue Id must be a valid Base58 string"
   }
-), de = h.lazy(
-  () => h.record(h.unknown()).and(
-    h.object({
-      blueId: h.string().optional(),
-      name: h.string().optional(),
-      description: h.string().optional(),
-      type: de.optional(),
-      value: h.union([h.string(), h.number(), h.boolean()]).optional().nullable(),
-      items: h.array(de).optional()
+), he = p.lazy(
+  () => p.record(p.unknown()).and(
+    p.object({
+      blueId: p.string().optional(),
+      name: p.string().optional(),
+      description: p.string().optional(),
+      type: he.optional(),
+      value: p.union([p.string(), p.number(), p.boolean()]).optional().nullable(),
+      items: p.array(he).optional()
     })
   )
-), $e = h.object({
-  blueId: h.string().optional(),
-  name: h.string().optional(),
-  description: h.string().optional(),
-  type: de.optional()
-}), Dn = $e.extend({
-  value: h.string().optional()
-}), xn = $e.extend({
-  value: h.number().optional()
-}), Fn = $e.extend({
-  value: h.boolean().optional()
-}), $n = $e.extend({
-  items: h.array(h.string()).optional()
-}), _n = (s) => de.safeParse(s).success, Pr = (s) => d(s) && "blueId" in s && d(s.blueId), Ln = (s) => d(s) && "name" in s && d(s.name), Nr = (s) => d(s) && "items" in s && d(s.items), Sr = (s) => d(s) && "type" in s && d(s.type), Cr = (s) => d(s) && "value" in s && d(s.value), jn = (s, e) => s.required({ type: !0 }).safeParse(e).success, C = (s) => s instanceof D, Z = (s) => C(s) && s instanceof E, We = (s) => C(s) && s instanceof S, Ar = h.lazy(
-  () => h.record(Ae)
-), Vr = h.lazy(
-  () => h.union([
-    h.array(Ae),
-    h.array(Ae).readonly()
+), Ue = p.object({
+  blueId: p.string().optional(),
+  name: p.string().optional(),
+  description: p.string().optional(),
+  type: he.optional()
+}), Fn = Ue.extend({
+  value: p.string().optional()
+}), $n = Ue.extend({
+  value: p.number().optional()
+}), _n = Ue.extend({
+  value: p.boolean().optional()
+}), Ln = Ue.extend({
+  items: p.array(p.string()).optional()
+}), jn = (s) => he.safeParse(s).success, Sr = (s) => d(s) && "blueId" in s && d(s.blueId), Un = (s) => d(s) && "name" in s && d(s.name), Cr = (s) => d(s) && "items" in s && d(s.items), Ar = (s) => d(s) && "type" in s && d(s.type), Vr = (s) => d(s) && "value" in s && d(s.value), kn = (s, e) => s.required({ type: !0 }).safeParse(e).success, R = (s) => s instanceof j, Q = (s) => R(s) && s instanceof N, Qe = (s) => R(s) && s instanceof A, Rr = p.lazy(
+  () => p.record(Me)
+), Or = p.lazy(
+  () => p.union([
+    p.array(Me),
+    p.array(Me).readonly()
   ])
-), Ae = h.lazy(
-  () => h.union([
-    cr,
-    Ar,
-    Vr,
-    h.instanceof(D)
+), Me = p.lazy(
+  () => p.union([
+    dr,
+    Rr,
+    Or,
+    p.instanceof(j)
   ])
-), Lt = (s) => Vt(s) && !tt(s) && !Pe(s) && !C(s), jt = (s) => tt(s) || Pe(s), Un = (s) => jt(s) || Lt(s) || C(s) || et(s);
-class g {
+), Yt = (s) => xt(s) && !ot(s) && !Ae(s) && !R(s), zt = (s) => ot(s) || Ae(s), Kn = (s) => zt(s) || Yt(s) || R(s) || it(s);
+class y {
   static deserialize(e) {
-    return g.handleNode(e);
+    return y.handleNode(e);
   }
   static handleNode(e) {
     if (e === void 0)
       throw new Error(
         "This is not a valid JSON-like value. Found 'undefined' as a value."
       );
-    if (Lt(e)) {
+    if (Yt(e)) {
       const t = new c(), r = {};
       return Object.entries(e).forEach(([n, i]) => {
         switch (n) {
-          case G:
+          case H:
             if (i == null)
               t.setName(void 0);
             else {
               if (typeof i != "string")
-                throw new Error(`The ${G} field must be a string.`);
+                throw new Error(`The ${H} field must be a string.`);
               t.setName(i);
             }
             break;
-          case J:
+          case X:
             if (i == null)
               t.setDescription(void 0);
             else {
               if (typeof i != "string")
                 throw new Error(
-                  `The ${J} field must be a string.`
+                  `The ${X} field must be a string.`
                 );
               t.setDescription(i);
             }
             break;
-          case W:
-            t.setType(g.handleNode(i));
-            break;
-          case fe:
-            t.setItemType(g.handleNode(i));
-            break;
-          case ye:
-            t.setKeyType(g.handleNode(i));
+          case q:
+            t.setType(y.handleNode(i));
             break;
           case ge:
-            t.setValueType(g.handleNode(i));
+            t.setItemType(y.handleNode(i));
             break;
           case me:
-            t.setValue(g.handleValue(i));
+            t.setKeyType(y.handleNode(i));
             break;
-          case x:
+          case Ie:
+            t.setValueType(y.handleNode(i));
+            break;
+          case Te:
+            t.setValue(y.handleValue(i));
+            break;
+          case U:
             if (typeof i != "string")
-              throw new Error(`The ${x} field must be a string.`);
+              throw new Error(`The ${U} field must be a string.`);
             t.setBlueId(i);
             break;
-          case Me:
-            t.setItems(g.handleArray(i));
+          case $e:
+            t.setItems(y.handleArray(i));
             break;
-          case De:
-            t.setBlue(g.handleNode(i));
+          case _e:
+            t.setBlue(y.handleNode(i));
             break;
           default:
-            r[n] = g.handleNode(i);
+            r[n] = y.handleNode(i);
             break;
         }
       }), Object.keys(r).length > 0 && t.setProperties(r), t;
     } else {
-      if (jt(e))
-        return new c().setItems(g.handleArray(e));
+      if (zt(e))
+        return new c().setItems(y.handleArray(e));
       {
         const t = e;
-        return new c().setValue(g.handleValue(t)).setInlineValue(!0);
+        return new c().setValue(y.handleValue(t)).setInlineValue(!0);
       }
     }
   }
@@ -532,13 +532,13 @@ class g {
       return null;
     if (typeof e == "string")
       return e;
-    if (typeof e == "number" || C(e))
-      if (Z(e) || Number.isSafeInteger(e)) {
-        const t = new E(e.toString()), r = Number.MIN_SAFE_INTEGER, n = Number.MAX_SAFE_INTEGER;
-        return t.lt(r) ? new E(r.toString()) : t.gt(n) ? new E(n.toString()) : t;
+    if (typeof e == "number" || R(e))
+      if (Q(e) || Number.isSafeInteger(e)) {
+        const t = new N(e.toString()), r = Number.MIN_SAFE_INTEGER, n = Number.MAX_SAFE_INTEGER;
+        return t.lt(r) ? new N(r.toString()) : t.gt(n) ? new N(n.toString()) : t;
       } else {
         const t = parseFloat(e.toString());
-        return new S(t.toString());
+        return new A(t.toString());
       }
     else if (typeof e == "boolean")
       return e;
@@ -546,20 +546,20 @@ class g {
   }
   static handleArray(e) {
     if (e != null) {
-      if (Vt(e) && !Array.isArray(e))
-        return [g.handleNode(e)];
+      if (xt(e) && !Array.isArray(e))
+        return [y.handleNode(e)];
       if (Array.isArray(e))
-        return e.map(g.handleNode);
+        return e.map(y.handleNode);
       throw new Error("Expected an array node");
     }
   }
 }
-function Rr(s) {
+function Mr(s) {
   return s && s.__esModule && Object.prototype.hasOwnProperty.call(s, "default") ? s.default : s;
 }
-var ke, mt;
-function Or() {
-  return mt || (mt = 1, ke = function s(e) {
+var Je, bt;
+function Dr() {
+  return bt || (bt = 1, Je = function s(e) {
     if (typeof e == "number" && isNaN(e))
       throw new Error("NaN is not allowed");
     if (typeof e == "number" && !isFinite(e))
@@ -570,50 +570,50 @@ function Or() {
       const i = r.length === 0 ? "" : ",";
       return `${r}${i}${s(n)}:${s(e[n])}`;
     }, "")}}`;
-  }), ke;
+  }), Je;
 }
-var Mr = Or();
-const Dr = /* @__PURE__ */ Rr(Mr);
-class Ze {
+var xr = Dr();
+const Fr = /* @__PURE__ */ Mr(xr);
+class et {
   static canonicalize(e) {
-    return Dr(e);
+    return Fr(e);
   }
 }
-const Ke = typeof process < "u" && process.versions != null && process.versions.node != null;
-class ct {
+const We = typeof process < "u" && process.versions != null && process.versions.node != null;
+class ft {
   static instance;
   browserCrypto;
   constructor() {
     this.browserCrypto = this.initBrowserCrypto();
   }
   static getInstance() {
-    return this.instance || (this.instance = new ct()), this.instance;
+    return this.instance || (this.instance = new ft()), this.instance;
   }
   initBrowserCrypto() {
-    return Ke ? null : "crypto" in globalThis ? globalThis.crypto : null;
+    return We ? null : "crypto" in globalThis ? globalThis.crypto : null;
   }
   hasNodeCrypto() {
-    return Ke && !!Ue && typeof Ue.createHash == "function";
+    return We && !!Ge && typeof Ge.createHash == "function";
   }
   getBrowserCrypto() {
     return this.browserCrypto;
   }
   getNodeCrypto() {
-    return Ke ? Ue : null;
+    return We ? Ge : null;
   }
 }
-class xr {
-  cryptoEnv = ct.getInstance();
+class $r {
+  cryptoEnv = ft.getInstance();
   applySync(e) {
     const t = this.canonicalizeInput(e), r = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : this.sha256SyncBrowser(t);
-    return ue.encode(r);
+    return pe.encode(r);
   }
   async apply(e) {
     const t = this.canonicalizeInput(e), r = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : await this.sha256Async(t);
-    return ue.encode(r);
+    return pe.encode(r);
   }
   canonicalizeInput(e) {
-    const t = Ze.canonicalize(e);
+    const t = et.canonicalize(e);
     if (typeof t != "string")
       throw new Error("Canonized value must be a string");
     return t;
@@ -628,7 +628,7 @@ class xr {
     return new Uint8Array(r);
   }
   sha256SyncBrowser(e) {
-    return new Uint8Array(Br.arrayBuffer(e));
+    return new Uint8Array(wr.arrayBuffer(e));
   }
   async sha256Async(e) {
     if (this.cryptoEnv.hasNodeCrypto())
@@ -655,7 +655,7 @@ class I {
     const r = e.getValue(), n = this.handleValue(r);
     if (n !== void 0 && t === "simple")
       return n;
-    const i = e.getItems()?.map((Q) => I.get(Q, t));
+    const i = e.getItems()?.map((F) => I.get(F, t));
     if (i !== void 0 && t === "simple")
       return i;
     const o = e.getName(), l = e.getDescription();
@@ -666,31 +666,31 @@ class I {
         return i;
     }
     const a = {};
-    o !== void 0 && (a[G] = o), l !== void 0 && (a[J] = l);
+    o !== void 0 && (a[H] = o), l !== void 0 && (a[X] = l);
     const u = e.getType();
     if (t === "official" && r !== void 0 && u === void 0) {
-      const Q = this.inferTypeBlueId(r);
-      Q !== null && (a[W] = { [x]: Q });
-    } else u !== void 0 && (a[W] = I.get(u, t));
-    const y = e.getItemType();
-    y !== void 0 && (a[fe] = I.get(y, t));
-    const p = e.getKeyType();
-    p !== void 0 && (a[ye] = I.get(p, t));
-    const f = e.getValueType();
-    f !== void 0 && (a[ge] = I.get(f, t)), n !== void 0 && (a[me] = n), i !== void 0 && (a[Me] = i);
+      const F = this.inferTypeBlueId(r);
+      F !== null && (a[q] = { [U]: F });
+    } else u !== void 0 && (a[q] = I.get(u, t));
+    const f = e.getItemType();
+    f !== void 0 && (a[ge] = I.get(f, t));
+    const h = e.getKeyType();
+    h !== void 0 && (a[me] = I.get(h, t));
+    const g = e.getValueType();
+    g !== void 0 && (a[Ie] = I.get(g, t)), n !== void 0 && (a[Te] = n), i !== void 0 && (a[$e] = i);
     const v = e.getBlueId();
-    v !== void 0 && (a[x] = v);
-    const k = e.getBlue();
-    k !== void 0 && (a[De] = k);
-    const q = e.getProperties();
-    return q !== void 0 && Object.entries(q).forEach(([Q, ar]) => {
-      a[Q] = I.get(ar, t);
+    v !== void 0 && (a[U] = v);
+    const x = e.getBlue();
+    x !== void 0 && (a[_e] = x);
+    const V = e.getProperties();
+    return V !== void 0 && Object.entries(V).forEach(([F, B]) => {
+      a[F] = I.get(B, t);
     }), a;
   }
   static handleValue(e) {
-    if (C(e)) {
-      if (Z(e)) {
-        const t = new D(Number.MIN_SAFE_INTEGER.toString()), r = new D(Number.MAX_SAFE_INTEGER.toString());
+    if (R(e)) {
+      if (Q(e)) {
+        const t = new j(Number.MIN_SAFE_INTEGER.toString()), r = new j(Number.MAX_SAFE_INTEGER.toString());
         if (e.lt(t) || e.gt(r))
           return e.toString();
       }
@@ -699,12 +699,12 @@ class I {
     return e;
   }
   static inferTypeBlueId(e) {
-    return typeof e == "string" ? _ : C(e) ? Z(e) ? j : L : typeof e == "boolean" ? U : null;
+    return typeof e == "string" ? Y : R(e) ? Q(e) ? G : z : typeof e == "boolean" ? J : null;
   }
 }
-const Fr = (s) => et(s) && d(s);
+const _r = (s) => it(s) && d(s);
 class T {
-  static INSTANCE = new T(new xr());
+  static INSTANCE = new T(new $r());
   hashProvider;
   constructor(e) {
     this.hashProvider = e;
@@ -739,14 +739,14 @@ class T {
   }
   // Internal method to calculate BlueId recursively
   internalCalculate(e, t) {
-    return Fr(e) || C(e) ? this.applyHash(e.toString(), t) : Array.isArray(e) || Pe(e) ? this.calculateList(e, t) : this.calculateMap(e, t);
+    return _r(e) || R(e) ? this.applyHash(e.toString(), t) : Array.isArray(e) || Ae(e) ? this.calculateList(e, t) : this.calculateMap(e, t);
   }
   calculateMap(e, t) {
-    if (e[x] !== void 0)
-      return e[x];
+    if (e[U] !== void 0)
+      return e[U];
     const n = Object.keys(e).map((o) => {
       const l = e[o];
-      if ([G, me, J].includes(o))
+      if ([H, Te, X].includes(o))
         return t ? [o, l] : Promise.resolve([o, l]);
       {
         const a = this.internalCalculate(l, t);
@@ -789,9 +789,9 @@ class T {
   // Method to clean the input structure by removing null or undefined values
   cleanStructure(e) {
     if (e != null) {
-      if (et(e) || C(e))
+      if (it(e) || R(e))
         return e;
-      if (Array.isArray(e) || Pe(e)) {
+      if (Array.isArray(e) || Ae(e)) {
         const t = e.map((r) => this.cleanStructure(r)).filter(d);
         return t.length > 0 ? t : void 0;
       } else if (typeof e == "object") {
@@ -806,15 +806,15 @@ class T {
     }
   }
 }
-class kn {
+class Yn {
   static convert(e) {
-    const t = ue.decode(e), r = new Uint8Array(2 + t.length);
+    const t = pe.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 br.Encoder({ type: "rfc4648", lc: !0 }).write(n).finalize().replace(/=/g, "");
+    return n[0] = 1, n[1] = 85, n.set(r, 2), "b" + new Pr.Encoder({ type: "rfc4648", lc: !0 }).write(n).finalize().replace(/=/g, "");
   }
 }
-class w {
+class E {
   /**
    * Transforms a node and all its child nodes using the provided transformer function
    * @param node - The node to transform
@@ -823,45 +823,45 @@ class w {
    */
   static transform(e, t) {
     const r = t(e.clone()), n = r.getType();
-    n !== void 0 && r.setType(w.transform(n, t));
+    n !== void 0 && r.setType(E.transform(n, t));
     const i = r.getItemType();
     i !== void 0 && r.setItemType(
-      w.transform(i, t)
+      E.transform(i, t)
     );
     const o = r.getKeyType();
     o !== void 0 && r.setKeyType(
-      w.transform(o, t)
+      E.transform(o, t)
     );
     const l = r.getValueType();
     l !== void 0 && r.setValueType(
-      w.transform(l, t)
+      E.transform(l, t)
     );
     const a = r.getItems();
     if (a !== void 0) {
-      const y = a.map(
-        (p) => w.transform(p, t)
+      const f = a.map(
+        (h) => E.transform(h, t)
       );
-      r.setItems(y);
+      r.setItems(f);
     }
     const u = r.getProperties();
     if (u !== void 0) {
-      const y = Object.keys(u).reduce(
-        (p, f) => (p[f] = w.transform(u[f], t), p),
+      const f = Object.keys(u).reduce(
+        (h, g) => (h[g] = E.transform(u[g], t), h),
         {}
       );
-      r.setProperties(y);
+      r.setProperties(f);
     }
     return r;
   }
 }
-const F = (s) => !!s && typeof s == "object" && !Array.isArray(s) && !(s instanceof c), O = (s) => s instanceof E || s instanceof S, $r = (s) => s.replace(/~1/g, "/").replace(/~0/g, "~");
-function oe(s) {
+const k = (s) => !!s && typeof s == "object" && !Array.isArray(s) && !(s instanceof c), $ = (s) => s instanceof N || s instanceof A, Lr = (s) => s.replace(/~1/g, "/").replace(/~0/g, "~");
+function ae(s) {
   if (s === "/") return [];
   if (!s.startsWith("/"))
     throw new Error(`Path must start with '/': ${s}`);
-  return s.split("/").slice(1).map($r);
+  return s.split("/").slice(1).map(Lr);
 }
-function se(s) {
+function ie(s) {
   if (s === "-") return -1;
   const e = typeof s == "number" ? s : parseInt(s, 10);
   if (isNaN(e))
@@ -872,7 +872,7 @@ function se(s) {
     );
   return e;
 }
-function Ut(s, e, t, r = !0) {
+function Gt(s, e, t, r = !0) {
   switch (e) {
     case "name":
       return t ? r ? s.getName() ?? null : s : s.getName();
@@ -896,15 +896,15 @@ function Ut(s, e, t, r = !0) {
       return s.getItems();
     case "properties":
       return s.getProperties();
-    case V:
+    case M:
       return s.getContracts();
     default:
       return;
   }
 }
-function It(s, e, t = !0) {
+function wt(s, e, t = !0) {
   if (s instanceof c) {
-    const r = Ut(
+    const r = Gt(
       s,
       e,
       !0,
@@ -922,7 +922,7 @@ function It(s, e, t = !0) {
       "blue",
       "items",
       "properties",
-      V
+      M
     ].includes(e))
       return r;
     if (/^-?\d+$/.test(e) && e !== "-") {
@@ -934,12 +934,12 @@ function It(s, e, t = !0) {
   }
   if (Array.isArray(s)) {
     if (e === "-") return;
-    const r = se(e);
+    const r = ie(e);
     return r >= 0 && r < s.length ? s[r] : void 0;
   }
-  if (F(s)) return s[e];
+  if (k(s)) return s[e];
 }
-function le(s, e) {
+function ce(s, e) {
   if (e.length === 0)
     return {
       parent: s,
@@ -948,15 +948,15 @@ function le(s, e) {
     };
   let t = s;
   for (let n = 0; n < e.length - 1; ++n) {
-    const i = e[n], o = It(t, i);
+    const i = e[n], o = wt(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 c) {
-    const n = It(t, r, !1);
-    if ((typeof n != "object" || n === null || O(n)) && !(n instanceof c) && !Array.isArray(n) && ["name", "description", "value", "blueId"].includes(r))
+    const n = wt(t, r, !1);
+    if ((typeof n != "object" || n === null || $(n)) && !(n instanceof c) && !Array.isArray(n) && ["name", "description", "value", "blueId"].includes(r))
       return {
         parent: t,
         key: r,
@@ -965,12 +965,12 @@ function le(s, e) {
   }
   return Array.isArray(t) && r === "-" ? { parent: t, key: "-" } : t instanceof c && t.getItems() && r === "-" ? { parent: t, key: "-" } : {
     parent: t,
-    key: Array.isArray(t) ? se(r) : r
+    key: Array.isArray(t) ? ie(r) : r
   };
 }
-function ut(s, e) {
+function yt(s, e) {
   if (s instanceof c) {
-    const t = e, r = Ut(s, t, !1);
+    const t = e, r = Gt(s, t, !1);
     if (r !== void 0 || [
       "name",
       "description",
@@ -983,7 +983,7 @@ function ut(s, e) {
       "blue",
       "items",
       "properties",
-      V
+      M
     ].includes(t))
       return r;
     if (typeof e == "number" || typeof e == "string" && /^\d+$/.test(e)) {
@@ -992,25 +992,25 @@ function ut(s, e) {
     }
     return s.getProperties()?.[t];
   }
-  return Array.isArray(s) || F(s) ? s[e] : s;
+  return Array.isArray(s) || k(s) ? s[e] : s;
 }
-function N(s) {
+function C(s) {
   if (s instanceof c) return s;
-  if (s === null || typeof s == "string" || typeof s == "number" || typeof s == "boolean" || O(s))
-    return g.deserialize(s);
-  const e = He(s);
-  return g.deserialize(e);
+  if (s === null || typeof s == "string" || typeof s == "number" || typeof s == "boolean" || $(s))
+    return y.deserialize(s);
+  const e = tt(s);
+  return y.deserialize(e);
 }
-function He(s) {
+function tt(s) {
   if (s === void 0) return null;
   if (s === null || typeof s != "object") return s;
-  if (Array.isArray(s)) return s.map(He);
+  if (Array.isArray(s)) return s.map(tt);
   const e = {};
   for (const [t, r] of Object.entries(s))
-    e[t] = He(r);
+    e[t] = tt(r);
   return e;
 }
-function dt(s, e, t) {
+function gt(s, e, t) {
   if (s instanceof c) {
     const r = e;
     switch (r) {
@@ -1022,22 +1022,22 @@ function dt(s, e, t) {
         return;
       case "type":
         s.setType(
-          t instanceof c || typeof t == "string" || t === void 0 ? t : N(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : C(t)
         );
         return;
       case "itemType":
         s.setItemType(
-          t instanceof c || typeof t == "string" || t === void 0 ? t : N(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : C(t)
         );
         return;
       case "keyType":
         s.setKeyType(
-          t instanceof c || typeof t == "string" || t === void 0 ? t : N(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : C(t)
         );
         return;
       case "valueType":
         s.setValueType(
-          t instanceof c || typeof t == "string" || t === void 0 ? t : N(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : C(t)
         );
         return;
       case "value": {
@@ -1050,7 +1050,7 @@ function dt(s, e, t) {
         return;
       case "blue":
         s.setBlue(
-          t instanceof c || t === void 0 ? t : N(t)
+          t instanceof c || t === void 0 ? t : C(t)
         );
         return;
       case "items":
@@ -1059,7 +1059,7 @@ function dt(s, e, t) {
       case "properties":
         s.setProperties(t);
         return;
-      case V:
+      case M:
         s.setContracts(t);
         return;
       default: {
@@ -1067,14 +1067,14 @@ function dt(s, e, t) {
           const n = s.getProperties();
           n && r in n && delete n[r];
         } else
-          s.getProperties() || s.setProperties({}), s.addProperty(r, t instanceof c ? t : N(t));
+          s.getProperties() || s.setProperties({}), s.addProperty(r, t instanceof c ? t : C(t));
         return;
       }
     }
   }
-  Array.isArray(s) ? s.splice(se(e), 1) : F(s) && (t === void 0 ? delete s[e] : s[e] = t);
+  Array.isArray(s) ? s.splice(ie(e), 1) : k(s) && (t === void 0 ? delete s[e] : s[e] = t);
 }
-function _r(s, e, t, r) {
+function jr(s, e, t, r) {
   let n = -1;
   if (e !== "-" && (n = typeof e == "number" ? e : parseInt(e, 10), isNaN(n)))
     throw new Error(
@@ -1094,27 +1094,27 @@ function _r(s, e, t, r) {
       if (n < i.length) i[n] = t;
       else {
         for (let o = i.length; o < n; o++)
-          i.push(g.deserialize(null));
+          i.push(y.deserialize(null));
         i.push(t);
       }
   } else
     i.splice(n, 0, t);
 }
-function Ve(s, e, t, r) {
+function De(s, e, t, r) {
   if (Array.isArray(s)) {
-    const n = e === "-" ? s.length : se(e);
+    const n = e === "-" ? s.length : ie(e);
     if (!r && n > s.length)
       throw new Error(
         `ADD operation failed: Target array index '${n}' is greater than array length ${s.length}. Path involving key '${e}'.`
       );
     if (n < 0 && e !== "-")
       throw new Error(`Invalid negative array index: ${e}`);
-    const i = N(t);
+    const i = C(t);
     if (r) {
       if (n >= 0 && n < s.length) s[n] = i;
       else if (n >= s.length) {
         for (let o = s.length; o < n; o++)
-          s.push(g.deserialize(null));
+          s.push(y.deserialize(null));
         s.push(i);
       }
     } else
@@ -1122,18 +1122,18 @@ function Ve(s, e, t, r) {
     return;
   }
   if (s instanceof c) {
-    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? _r(s, e, N(t), r) : dt(s, e, t);
+    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? jr(s, e, C(t), r) : gt(s, e, t);
     return;
   }
-  if (F(s)) {
-    s[e] = N(t);
+  if (k(s)) {
+    s[e] = C(t);
     return;
   }
   throw new Error(`Cannot insert into parent of type ${typeof s}`);
 }
-function Lr(s, e) {
+function Ur(s, e) {
   if (Array.isArray(s)) {
-    const t = se(e);
+    const t = ie(e);
     t === -1 && e === "-" ? s.length > 0 && s.pop() : t >= 0 && t < s.length && s.splice(t, 1);
     return;
   }
@@ -1141,127 +1141,127 @@ function Lr(s, e) {
     if (typeof e == "number" || typeof e == "string" && /^-?\d+$/.test(e)) {
       const t = s.getItems();
       if (t) {
-        const r = se(e);
+        const r = ie(e);
         r === -1 && e === "-" ? t.length > 0 && t.pop() : r >= 0 && r < t.length && t.splice(r, 1), t.length === 0 && s.setItems(void 0);
         return;
       }
     }
-    dt(s, e, void 0);
-  } else F(s) && delete s[e];
+    gt(s, e, void 0);
+  } else k(s) && delete s[e];
 }
-function Xe(s) {
+function rt(s) {
   if (s instanceof c) return s.clone();
   if (Array.isArray(s))
-    return s.map((t) => Xe(t));
-  if (F(s)) {
+    return s.map((t) => rt(t));
+  if (k(s)) {
     const e = {};
     return Object.keys(s).forEach((t) => {
-      e[t] = Xe(s[t]);
+      e[t] = rt(s[t]);
     }), e;
   }
   return s;
 }
-function Y(s, e) {
-  if (s === e || s instanceof c && (s.isInlineValue() || s.getValue() !== void 0) && Y(s.getValue() ?? null, e) || e instanceof c && (e.isInlineValue() || e.getValue() !== void 0) && Y(s, e.getValue() ?? null))
+function W(s, e) {
+  if (s === e || s instanceof c && (s.isInlineValue() || s.getValue() !== void 0) && W(s.getValue() ?? null, e) || e instanceof c && (e.isInlineValue() || e.getValue() !== void 0) && W(s, e.getValue() ?? null))
     return !0;
-  if (s instanceof c && e instanceof c || O(s) && O(e) || O(s) && typeof e == "number" || typeof s == "number" && O(e))
+  if (s instanceof c && e instanceof c || $(s) && $(e) || $(s) && typeof e == "number" || typeof s == "number" && $(e))
     return s.toString() === e.toString();
   if (Array.isArray(s) && Array.isArray(e))
-    return s.length === e.length && s.every((t, r) => Y(t, e[r]));
-  if (F(s) && F(e)) {
+    return s.length === e.length && s.every((t, r) => W(t, e[r]));
+  if (k(s) && k(e)) {
     const t = Object.keys(s), r = Object.keys(e);
-    return t.length === r.length && t.every((n) => Y(s[n], e[n]));
+    return t.length === r.length && t.every((n) => W(s[n], e[n]));
   }
   return !1;
 }
-function kt(s, e) {
-  const { parent: t, key: r } = le(s, oe(e));
-  return ut(t, r);
+function Jt(s, e) {
+  const { parent: t, key: r } = ce(s, ae(e));
+  return yt(t, r);
 }
-function Kt(s, e, t) {
-  const r = oe(e);
+function Wt(s, e, t) {
+  const r = ae(e);
   if (r.length === 0 && e === "/") {
-    const o = N(t);
+    const o = C(t);
     s.setValue(o.getValue() ?? null), o.getItems() ? s.setItems(o.getItems()) : s.setItems(void 0);
     return;
   }
-  const { parent: n, key: i } = le(s, r);
-  Ve(n, i, t, !0);
+  const { parent: n, key: i } = ce(s, r);
+  De(n, i, t, !0);
 }
-function jr(s, e, t) {
-  const r = oe(e);
+function kr(s, e, t) {
+  const r = ae(e);
   if (r.length === 0 && e === "/") {
     if (s.getItems() && Array.isArray(t)) {
-      const o = N(t);
+      const o = C(t);
       o.getItems() ? (s.setItems(o.getItems()), s.setValue(null)) : (s.setValue(o.getValue() ?? null), s.setItems(void 0));
     } else {
-      const o = N(t);
+      const o = C(t);
       s.setValue(o.getValue() ?? null), o.getItems() && s.setItems(o.getItems());
     }
     return !0;
   }
-  const { parent: n, key: i } = le(s, r);
-  return Ve(n, i, t, !1), !0;
+  const { parent: n, key: i } = ce(s, r);
+  return De(n, i, t, !1), !0;
 }
-function Ur(s, e, t) {
-  const r = oe(e);
+function Kr(s, e, t) {
+  const r = ae(e);
   if (r.length === 0 && e === "/") {
-    const l = N(t);
+    const l = C(t);
     return s.setValue(l.getValue() ?? null), l.getItems() ? s.setItems(l.getItems()) : s.setItems(void 0), !0;
   }
-  const { parent: n, key: i, actualTarget: o } = le(s, r);
+  const { parent: n, key: i, actualTarget: o } = ce(s, r);
   if (o !== void 0 && n instanceof c)
-    dt(n, i, t);
+    gt(n, i, t);
   else {
-    const l = ut(n, i), a = Array.isArray(n) || n instanceof c && n.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
+    const l = yt(n, i), a = Array.isArray(n) || n instanceof c && n.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
     if (l === void 0) {
       if (a)
         throw new Error(
           `REPLACE failed: Target array index '${i.toString()}' is out of bounds or does not exist at path '${e}'.`
         );
-      Ve(n, i, t, !0);
+      De(n, i, t, !0);
     } else
-      Ve(n, i, t, !0);
+      De(n, i, t, !0);
   }
   return !0;
 }
-function Yt(s, e) {
-  const t = oe(e);
+function Zt(s, e) {
+  const t = ae(e);
   if (t.length === 0 && e === "/")
     return s.setValue(null), s.setItems(void 0), s.setProperties(void 0), !0;
-  const { parent: r, key: n } = le(s, t);
-  return Lr(r, n), !0;
+  const { parent: r, key: n } = ce(s, t);
+  return Ur(r, n), !0;
 }
-function kr(s, e, t) {
-  const r = Xe(kt(s, e));
-  return Kt(s, t, r), !0;
+function Yr(s, e, t) {
+  const r = rt(Jt(s, e));
+  return Wt(s, t, r), !0;
 }
-function Kr(s, e, t) {
-  const r = oe(e), { parent: n, key: i } = le(s, r), o = ut(n, i);
+function zr(s, e, t) {
+  const r = ae(e), { parent: n, key: i } = ce(s, r), o = yt(n, i);
   if (o === void 0)
     throw new Error(`MOVE failed: 'from' location '${e}' does not exist.`);
-  return Yt(s, e) ? (Kt(s, t, o), !0) : !1;
+  return Zt(s, e) ? (Wt(s, t, o), !0) : !1;
 }
-function Yr(s, e, t) {
-  const r = kt(s, e);
+function Gr(s, e, t) {
+  const r = Jt(s, e);
   let n = t;
   if (r instanceof c)
-    if ((t === null || typeof t == "string" || typeof t == "number" || typeof t == "boolean" || O(t)) && (r.isInlineValue() || r.getValue() !== void 0)) {
-      if (!Y(r.getValue() ?? null, t))
+    if ((t === null || typeof t == "string" || typeof t == "number" || typeof t == "boolean" || $(t)) && (r.isInlineValue() || r.getValue() !== void 0)) {
+      if (!W(r.getValue() ?? null, t))
         throw new Error(
           `TEST failed at '${e}': Expected ${JSON.stringify(
             t
           )}, got ${JSON.stringify(r.getValue() ?? null)}`
         );
       return !0;
-    } else typeof t == "object" && !(t instanceof c) && (n = N(t));
-  else if (O(r) && typeof t == "number")
-    r instanceof E ? n = new E(t.toString()) : r instanceof S && (n = new S(t.toString()));
-  else if ((r === null || typeof r == "string" || typeof r == "number" || typeof r == "boolean") && O(t)) {
+    } else typeof t == "object" && !(t instanceof c) && (n = C(t));
+  else if ($(r) && typeof t == "number")
+    r instanceof N ? n = new N(t.toString()) : r instanceof A && (n = new A(t.toString()));
+  else if ((r === null || typeof r == "string" || typeof r == "number" || typeof r == "boolean") && $(t)) {
     const i = t;
-    !Y(r, i.toString()) && (typeof r == "number" && parseFloat(i.toString()));
+    !W(r, i.toString()) && (typeof r == "number" && parseFloat(i.toString()));
   }
-  if (!Y(r, n)) {
+  if (!W(r, n)) {
     const i = r instanceof c ? r.toString() : JSON.stringify(r), o = n instanceof c ? n.toString() : JSON.stringify(n);
     throw new Error(
       `TEST failed at '${e}': Expected ${o}, got ${i}`
@@ -1269,93 +1269,93 @@ function Yr(s, e, t) {
   }
   return !0;
 }
-function zr(s, e) {
+function Jr(s, e) {
   switch (e.op) {
     case "add":
-      return jr(s, e.path, e.val);
+      return kr(s, e.path, e.val);
     case "replace":
-      return Ur(s, e.path, e.val);
+      return Kr(s, e.path, e.val);
     case "remove":
-      return Yt(s, e.path);
+      return Zt(s, e.path);
     case "copy":
-      return kr(s, e.from, e.path);
+      return Yr(s, e.from, e.path);
     case "move":
-      return Kr(s, e.from, e.path);
+      return zr(s, e.from, e.path);
     case "test":
-      return Yr(s, e.path, e.val);
+      return Gr(s, e.path, e.val);
   }
 }
-function Kn(s, e, t = !1) {
+function zn(s, e, t = !1) {
   const r = t ? s : s.clone();
-  return zr(r, e), r;
+  return Jr(r, e), r;
 }
-const Ye = Symbol.for("zod-schema-annotations");
-function Gr() {
+const Ze = Symbol.for("zod-schema-annotations");
+function Wr() {
   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 zt() {
-  const s = Gr();
-  return Ye in s || (s[Ye] = /* @__PURE__ */ new WeakMap()), s[Ye];
+function Ht() {
+  const s = Wr();
+  return Ze in s || (s[Ze] = /* @__PURE__ */ new WeakMap()), s[Ze];
 }
-function Ie(s, e) {
-  const t = zt(), r = t.get(s) || {};
+function ve(s, e) {
+  const t = Ht(), r = t.get(s) || {};
   return t.set(s, { ...r, ...e }), s;
 }
-const R = (s) => zt().get(s), Jr = (s) => (e) => {
-  const t = R(e);
-  return Ie(e, {
+const D = (s) => Ht().get(s), Zr = (s) => (e) => {
+  const t = D(e);
+  return ve(e, {
     ...t,
     blueDescription: s
   });
-}, Wr = (s) => {
-  const e = R(s);
-  return d(e) && rt(e.blueDescription) ? e.blueDescription : null;
-}, Yn = (s) => Jr(s)(h.string().optional()), Zr = h.union([h.string(), h.boolean()]), Hr = (s) => (e) => {
-  const t = R(e);
-  return Ie(e, {
+}, Hr = (s) => {
+  const e = D(s);
+  return d(e) && lt(e.blueDescription) ? e.blueDescription : null;
+}, Gn = (s) => Zr(s)(p.string().optional()), Xr = p.union([p.string(), p.boolean()]), qr = (s) => (e) => {
+  const t = D(e);
+  return ve(e, {
     ...t,
     blueId: s
   });
-}, Xr = (s) => {
-  const e = R(s), t = Zr.safeParse(e?.blueId);
+}, Qr = (s) => {
+  const e = D(s), t = Xr.safeParse(e?.blueId);
   return t.success ? t.data : null;
-}, zn = (s) => Hr(s ?? !0)(h.string()), qr = (s) => (e) => {
-  const t = R(e);
-  return Ie(e, {
+}, Jn = (s) => qr(s ?? !0)(p.string()), es = (s) => (e) => {
+  const t = D(e);
+  return ve(e, {
     ...t,
     blueName: s
   });
-}, Qr = (s) => {
-  const e = R(s);
-  return d(e) && rt(e.blueName) ? e.blueName : null;
-}, Gn = (s) => {
-  const e = h.string().optional();
-  return qr(s)(e);
-}, es = () => (s) => {
-  const e = R(s);
-  return Ie(s, {
+}, ts = (s) => {
+  const e = D(s);
+  return d(e) && lt(e.blueName) ? e.blueName : null;
+}, Wn = (s) => {
+  const e = p.string().optional();
+  return es(s)(e);
+}, rs = () => (s) => {
+  const e = D(s);
+  return ve(s, {
     ...e,
     blueNode: !0
   });
-}, ts = (s) => {
-  const e = R(s);
+}, ss = (s) => {
+  const e = D(s);
   return d(e) && d(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
-}, Gt = (s) => !!ts(s), Jn = () => {
-  const s = h.instanceof(c);
-  return es()(s);
-}, rs = h.object({
-  value: h.array(h.string()).optional(),
-  defaultValue: h.string().optional()
-}), ss = (s) => {
-  const e = R(s), t = rs.passthrough().safeParse(e?.typeBlueId);
+}, Xt = (s) => !!ss(s), Zn = () => {
+  const s = p.instanceof(c);
+  return rs()(s);
+}, ns = p.object({
+  value: p.array(p.string()).optional(),
+  defaultValue: p.string().optional()
+}), is = (s) => {
+  const e = D(s), t = ns.passthrough().safeParse(e?.typeBlueId);
   return t.success ? t.data : null;
-}, Wn = (s) => (e) => {
-  const t = R(e), r = typeof s == "string" ? { value: [s] } : s;
-  return Ie(e, {
+}, Hn = (s) => (e) => {
+  const t = D(e), r = typeof s == "string" ? { value: [s] } : s;
+  return ve(e, {
     ...t,
     typeBlueId: {
       ...t?.typeBlueId || {},
@@ -1363,32 +1363,32 @@ const R = (s) => zt().get(s), Jr = (s) => (e) => {
     }
   });
 };
-class pe {
+class fe {
   static resolveBlueId(e) {
-    const t = ss(e);
+    const t = is(e);
     if (m(t))
       return null;
     const r = t.defaultValue;
     if (d(r))
       return r;
     const n = t.value?.[0];
-    return d(n) ? n : pe.getRepositoryBlueId(t, e);
+    return d(n) ? n : fe.getRepositoryBlueId(t, e);
   }
   static getRepositoryBlueId(e, t) {
     throw new Error("Not implemented");
   }
 }
-class A {
+class O {
   // TODO: Enhance to support schemas associated with multiple blueIds
   static isTypeOf(e, t, r) {
-    const n = pe.resolveBlueId(t), i = e.getType()?.getBlueId();
+    const n = fe.resolveBlueId(t), i = e.getType()?.getBlueId();
     if (m(n) || m(i))
       return !1;
     if (n === i)
       return !0;
     if (r?.checkSchemaExtensions && d(r.typeSchemaResolver)) {
       const o = r.typeSchemaResolver.resolveSchema(e);
-      return A.checkSchemaExtension(o, t, {
+      return O.checkSchemaExtension(o, t, {
         typeSchemaResolver: r.typeSchemaResolver
       });
     }
@@ -1400,29 +1400,29 @@ class A {
   static checkSchemaExtension(e, t, r) {
     if (!d(e))
       return !1;
-    const n = A.unwrapSchema(e), i = A.unwrapSchema(t);
+    const n = O.unwrapSchema(e), i = O.unwrapSchema(t);
     return d(r?.typeSchemaResolver) ? r.typeSchemaResolver.isSchemaExtendedFrom(
       n,
       i
     ) : !1;
   }
   static isWrapperType(e) {
-    return e instanceof Nt || e instanceof St || e instanceof Ct || e instanceof At || e instanceof Ne || e instanceof Se;
+    return e instanceof Rt || e instanceof Ot || e instanceof Mt || e instanceof Dt || e instanceof Ve || e instanceof Re;
   }
   static unwrapSchema(e) {
-    return Gt(e) ? e : A.isWrapperType(e) ? e instanceof Ne ? A.unwrapSchema(e.innerType()) : e instanceof Se ? A.unwrapSchema(e.schema) : A.unwrapSchema(e.unwrap()) : e;
+    return Xt(e) ? e : O.isWrapperType(e) ? e instanceof Ve ? O.unwrapSchema(e.innerType()) : e instanceof Re ? O.unwrapSchema(e.schema) : O.unwrapSchema(e.unwrap()) : e;
   }
 }
-function Tt(s, e) {
+function Pt(s, e) {
   const t = s.getType();
   if (t === void 0)
     return;
   const r = t.getBlueId();
   if (r !== void 0) {
-    if (X.includes(
+    if (te.includes(
       r
     )) {
-      const i = Fe[r];
+      const i = je[r];
       return new c().setBlueId(r).setName(i);
     }
     const n = e.fetchByBlueId(r);
@@ -1436,18 +1436,18 @@ function Tt(s, e) {
   }
   return t;
 }
-function b(s, e, t) {
+function w(s, e, t) {
   const r = T.calculateBlueIdSync(s), n = T.calculateBlueIdSync(e);
   if (r === n)
     return !0;
-  if (r && X.includes(
+  if (r && te.includes(
     r
   )) {
     let a = e;
     for (; a !== void 0; ) {
       if (T.calculateBlueIdSync(a) === r)
         return !0;
-      a = Tt(a, t);
+      a = Pt(a, t);
     }
     return !1;
   }
@@ -1461,57 +1461,57 @@ function b(s, e, t) {
   for (; l !== void 0; ) {
     if (T.calculateBlueIdSync(l) === n)
       return !0;
-    l = Tt(l, t);
+    l = Pt(l, t);
   }
   return !1;
 }
-function ns(s, e) {
-  return at.some((t) => {
+function os(s, e) {
+  return ht.some((t) => {
     const r = new c().setBlueId(t);
-    return b(s, r, e);
+    return w(s, r, e);
   });
 }
-function is(s, e) {
-  const t = new c().setBlueId(_);
-  return b(s, t, e);
-}
-function os(s, e) {
-  const t = new c().setBlueId(j);
-  return b(s, t, e);
-}
 function ls(s, e) {
-  const t = new c().setBlueId(L);
-  return b(s, t, e);
+  const t = new c().setBlueId(Y);
+  return w(s, t, e);
 }
 function as(s, e) {
-  const t = new c().setBlueId(U);
-  return b(s, t, e);
+  const t = new c().setBlueId(G);
+  return w(s, t, e);
 }
-function Jt(s, e) {
-  const t = new c().setBlueId(ot);
-  return b(s, t, e);
+function cs(s, e) {
+  const t = new c().setBlueId(z);
+  return w(s, t, e);
+}
+function us(s, e) {
+  const t = new c().setBlueId(J);
+  return w(s, t, e);
 }
-function Wt(s, e) {
-  const t = new c().setBlueId(lt);
-  return b(s, t, e);
+function Ee(s, e) {
+  const t = new c().setBlueId(dt);
+  return w(s, t, e);
 }
-function cs(s, e) {
-  return xe.some((t) => {
+function Ne(s, e) {
+  const t = new c().setBlueId(pt);
+  return w(s, t, e);
+}
+function ds(s, e) {
+  return Le.some((t) => {
     const r = new c().setName(t);
-    return b(s, r, e);
+    return w(s, r, e);
   });
 }
-function us(s, e) {
-  for (const t of xe) {
+function ps(s, e) {
+  for (const t of Le) {
     const r = new c().setName(t);
-    if (b(s, r, e))
+    if (w(s, r, e))
       return t;
   }
   throw new Error(
     `Cannot determine the basic type for node of type "${s.getName() || "unknown"}".`
   );
 }
-class ds {
+class hs {
   blueIdMap = /* @__PURE__ */ new Map();
   nodeProvider;
   constructor(e = [], t) {
@@ -1522,7 +1522,7 @@ class ds {
       this.registerSchema(t);
   }
   registerSchema(e) {
-    const t = pe.resolveBlueId(e);
+    const t = fe.resolveBlueId(e);
     if (d(t)) {
       if (this.blueIdMap.has(t))
         throw new Error(`Duplicate BlueId value: ${t}`);
@@ -1547,7 +1547,7 @@ class ds {
     if (d(this.nodeProvider))
       try {
         const i = new c().setBlueId(r), o = new c().setBlueId(n);
-        if (b(i, o, this.nodeProvider))
+        if (w(i, o, this.nodeProvider))
           return !0;
       } catch {
       }
@@ -1556,7 +1556,7 @@ class ds {
   getBlueIdForSchema(e) {
     if (m(e))
       return null;
-    const t = pe.resolveBlueId(e);
+    const t = fe.resolveBlueId(e);
     if (d(t))
       return t;
     for (const [r, n] of this.blueIdMap)
@@ -1572,7 +1572,7 @@ class ds {
     return new Map(this.blueIdMap);
   }
 }
-const P = {
+const S = {
   NAME: "name",
   DESCRIPTION: "description",
   TYPE: "type",
@@ -1585,7 +1585,7 @@ const P = {
   BLUE: "blue",
   ITEMS: "items"
 };
-class _e {
+class ke {
   /**
    * Check if a node is empty (has no fields set)
    */
@@ -1596,13 +1596,13 @@ class _e {
    * Check if a node has only a Blue ID
    */
   static hasBlueIdOnly(e) {
-    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([P.BLUE_ID]));
+    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([S.BLUE_ID]));
   }
   /**
    * Check if a node has only items
    */
   static hasItemsOnly(e) {
-    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([P.ITEMS]));
+    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([S.ITEMS]));
   }
   /**
    * Check if a node is a valid value node (has a value, no properties, no items)
@@ -1617,27 +1617,27 @@ class _e {
    * Create a text node
    */
   static textNode(e) {
-    return new c().setType(new c().setBlueId(_)).setValue(e);
+    return new c().setType(new c().setBlueId(Y)).setValue(e);
   }
   /**
    * Create an integer node
    */
   static integerNode(e) {
-    const t = e instanceof E ? e : new E(e.toString());
-    return new c().setType(new c().setBlueId(j)).setValue(t);
+    const t = e instanceof N ? e : new N(e.toString());
+    return new c().setType(new c().setBlueId(G)).setValue(t);
   }
   /**
    * Create a double node
    */
   static doubleNode(e) {
-    const t = e instanceof S ? e : new S(e.toString());
-    return new c().setType(new c().setBlueId(L)).setValue(t);
+    const t = e instanceof A ? e : new A(e.toString());
+    return new c().setType(new c().setBlueId(z)).setValue(t);
   }
   /**
    * Create a boolean node
    */
   static booleanNode(e) {
-    return new c().setType(new c().setBlueId(U)).setValue(e);
+    return new c().setType(new c().setBlueId(J)).setValue(e);
   }
   /**
    * Check if a node has exactly the specified fields
@@ -1647,7 +1647,7 @@ class _e {
    * @returns true if the node matches the field requirements
    */
   static hasFieldsAndMayHaveFields(e, t = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set()) {
-    for (const n of Object.values(P)) {
+    for (const n of Object.values(S)) {
       const i = d(this.getFieldValue(e, n));
       if (t.has(n)) {
         if (!i) return !1;
@@ -1662,39 +1662,39 @@ class _e {
    */
   static getFieldValue(e, t) {
     switch (t) {
-      case P.NAME:
+      case S.NAME:
         return e.getName();
-      case P.TYPE:
+      case S.TYPE:
         return e.getType();
-      case P.VALUE:
+      case S.VALUE:
         return e.getValue();
-      case P.DESCRIPTION:
+      case S.DESCRIPTION:
         return e.getDescription();
-      case P.PROPERTIES:
+      case S.PROPERTIES:
         return e.getProperties();
-      case P.BLUE:
+      case S.BLUE:
         return e.getBlue();
-      case P.ITEMS:
+      case S.ITEMS:
         return e.getItems();
-      case P.KEY_TYPE:
+      case S.KEY_TYPE:
         return e.getKeyType();
-      case P.VALUE_TYPE:
+      case S.VALUE_TYPE:
         return e.getValueType();
-      case P.ITEM_TYPE:
+      case S.ITEM_TYPE:
         return e.getItemType();
-      case P.BLUE_ID:
+      case S.BLUE_ID:
         return e.getBlueId();
       default:
         throw new Error(`Unknown field: ${t}`);
     }
   }
 }
-class pt {
+class mt {
 }
-class ce {
+class de {
   static convert(e) {
-    const t = new qe();
-    return ce.traverseNode(e, "", t), t.build();
+    const t = new st();
+    return de.traverseNode(e, "", t), t.build();
   }
   static traverseNode(e, t, r) {
     if (!e)
@@ -1706,21 +1706,21 @@ class ce {
     }
     if (n)
       for (const [a, u] of Object.entries(n)) {
-        const y = `${t}/${a}`;
-        ce.traverseNode(u, y, r);
+        const f = `${t}/${a}`;
+        de.traverseNode(u, f, r);
       }
     if (i)
       for (let a = 0; a < i.length; a++) {
         const u = `${t}/${a}`;
-        ce.traverseNode(i[a], u, r);
+        de.traverseNode(i[a], u, r);
       }
   }
 }
-function vt(s, e) {
+function Et(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 Le extends pt {
+class Ke extends mt {
   allowedPaths;
   maxDepth;
   currentPath = [];
@@ -1771,7 +1771,7 @@ class Le extends pt {
    * @returns True if the path matches the allowed path pattern, false otherwise
    */
   matchesAllowedPath(e, t) {
-    const r = vt(e, "/"), n = vt(t, "/");
+    const r = Et(e, "/"), n = Et(t, "/");
     if (n.length > r.length)
       return !1;
     for (let i = 1; i < n.length; i++)
@@ -1813,7 +1813,7 @@ class Le extends pt {
    * @returns The path limits
    */
   static withMaxDepth(e) {
-    const t = new qe().setMaxDepth(e);
+    const t = new st().setMaxDepth(e);
     for (let r = 1; r <= e; r++) {
       const n = "/" + Array(r).fill("*").join("/");
       t.addPath(n);
@@ -1826,17 +1826,17 @@ class Le extends pt {
    * @returns The path limits
    */
   static withSinglePath(e) {
-    return new qe().addPath(e).build();
+    return new st().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 ce.convert(e);
+    return de.convert(e);
   }
 }
-class qe {
+class st {
   allowedPaths = /* @__PURE__ */ new Set();
   maxDepth = Number.MAX_SAFE_INTEGER;
   /**
@@ -1860,10 +1860,10 @@ class qe {
    * @returns The built PathLimits
    */
   build() {
-    return new Le(this.allowedPaths, this.maxDepth);
+    return new Ke(this.allowedPaths, this.maxDepth);
   }
 }
-class we extends pt {
+class Se extends mt {
   /**
    * Determines if a path segment should be extended - always returns true
    * @returns Always true
@@ -1889,7 +1889,7 @@ class we extends pt {
   exitPathSegment() {
   }
 }
-class je extends pt {
+class Ye extends mt {
   limits;
   /**
    * Creates a composite limits with the specified limit strategies
@@ -1946,21 +1946,23 @@ class je extends pt {
    * @returns A new CompositeLimits instance
    */
   static of(...e) {
-    return new je(e);
+    return new Ye(e);
   }
 }
-const K = new we();
-class ps {
+const _ = new Se();
+class fs {
   blue;
   constructor(e) {
     this.blue = e;
   }
-  matchesType(e, t, r = K) {
-    const n = t.getType();
-    if (this.matchesImplicitStructure(e, n))
-      return !0;
-    const i = Le.fromNode(t), o = je.of(r, i), l = this.extendAndResolve(e, o), a = this.blue.resolve(t, o);
-    return this.verifyMatch(l, t, o) && this.recursiveValueComparison(l, a);
+  matchesType(e, t, r = _) {
+    const n = Ke.fromNode(t), i = Ye.of(r, n), o = this.extendAndResolve(e, i), l = this.blue.resolve(t, i), a = this.expandSchemaOwnedTypeReferences(t);
+    return this.verifyMatch(o, t, i) && this.recursiveValueComparison(
+      o,
+      l,
+      a,
+      i
+    );
   }
   /**
    * Resolves a node with the runtime while preserving any structure that could
@@ -1988,9 +1990,9 @@ class ps {
     if (i) {
       let a = e.getProperties();
       a || (a = {}, e.setProperties(a));
-      for (const [u, y] of Object.entries(i)) {
-        const p = a[u];
-        p === void 0 ? a[u] = y.clone() : this.restoreMissingStructure(p, y);
+      for (const [u, f] of Object.entries(i)) {
+        const h = a[u];
+        h === void 0 ? a[u] = f.clone() : this.restoreMissingStructure(h, f);
       }
     }
     const o = t.getBlueId();
@@ -2010,76 +2012,114 @@ class ps {
     }
     return !0;
   }
-  recursiveValueComparison(e, t) {
-    const r = t.getType(), n = this.matchesImplicitStructure(
-      e,
-      r
-    );
-    if (r && !n) {
-      const p = e.getType();
-      if (!p || !b(
-        p,
-        r,
+  recursiveValueComparison(e, t, r = t, n = _) {
+    const i = t.getType(), o = this.matchesImplicitStructure(e, i) || this.matchesImplicitCoreCollectionType(e, t);
+    if (e.getType() === void 0 && this.isCoreCollectionType(t) && !o)
+      return !1;
+    if (i && !o) {
+      const B = e.getType();
+      if (!B || !w(
+        B,
+        i,
         this.blue.getNodeProvider()
       ))
         return !1;
     }
-    const i = t.getBlueId();
-    if (!n && i !== void 0) {
-      const p = e.getBlueId(), f = e.getType()?.getBlueId();
-      if (p !== void 0) {
-        if (i !== p)
+    const l = t.getBlueId();
+    if (!o && l !== void 0)
+      if (this.isExplicitBlueIdMatcher(r)) {
+        const B = e.getBlueId(), b = e.getType()?.getBlueId();
+        if (B !== l && b !== l)
           return !1;
-      } else if (f === void 0 || i !== f)
-        return !1;
-    }
-    const o = t.getValue();
-    if (o !== void 0) {
-      const p = e.getValue();
-      if (p === void 0)
+      } else {
+        const B = e.getBlueId(), b = e.getType();
+        if (b === void 0 && B !== void 0 && B !== l || b && !w(
+          b,
+          t,
+          this.blue.getNodeProvider()
+        ))
+          return !1;
+      }
+    const a = t.getValue();
+    if (a !== void 0) {
+      const B = e.getValue();
+      if (B === void 0)
         return !1;
-      if (C(p) && C(o)) {
-        if (!p.eq(o))
+      if (R(B) && R(a)) {
+        if (!B.eq(a))
           return !1;
-      } else if (p !== o)
+      } else if (B !== a)
         return !1;
     }
-    const l = t.getItems();
-    if (l !== void 0) {
-      const p = e.getItems() ?? [];
-      for (let f = 0; f < l.length; f++)
-        if (f < p.length) {
-          if (!this.recursiveValueComparison(p[f], l[f]))
+    const u = t.getItems(), f = r.getItems();
+    if (u !== void 0) {
+      const B = e.getItems() ?? [];
+      for (let b = 0; b < u.length; b++)
+        if (b < B.length) {
+          if (!this.recursiveValueComparison(
+            B[b],
+            u[b],
+            f?.[b] ?? u[b],
+            n
+          ))
             return !1;
-        } else if (this.hasValueInNestedStructure(l[f]))
+        } else if (this.hasValueInNestedStructure(u[b]))
           return !1;
     }
-    const a = t.getItemType();
-    if (a !== void 0) {
-      const p = e.getItems() ?? [];
-      for (const f of p)
-        if (!this.recursiveValueComparison(f, a))
+    const h = t.getItemType(), g = r.getItemType();
+    if (h !== void 0) {
+      const B = e.getItems() ?? [];
+      for (const b of B)
+        if (!this.recursiveValueComparison(
+          this.resolveUntypedNodeAgainstMatcherType(
+            b,
+            h,
+            g ?? h,
+            n
+          ),
+          h,
+          g ?? h,
+          n
+        ))
           return !1;
     }
-    const u = t.getProperties();
-    if (u !== void 0) {
-      const p = e.getProperties() ?? {};
-      for (const [f, v] of Object.entries(u))
-        if (f in p) {
-          if (!this.recursiveValueComparison(p[f], v))
+    const v = t.getProperties(), x = r.getProperties();
+    if (v !== void 0) {
+      const B = e.getProperties() ?? {};
+      for (const [b, ze] of Object.entries(v))
+        if (b in B) {
+          if (!this.recursiveValueComparison(
+            B[b],
+            ze,
+            x?.[b] ?? ze,
+            n
+          ))
             return !1;
-        } else if (this.hasValueInNestedStructure(v))
+        } else if (this.hasValueInNestedStructure(ze))
           return !1;
     }
-    const y = t.getValueType();
-    if (y !== void 0) {
-      const p = Object.values(e.getProperties() ?? {});
-      for (const f of p)
-        if (!this.recursiveValueComparison(f, y))
+    const V = t.getValueType(), F = r.getValueType();
+    if (V !== void 0) {
+      const B = Object.values(e.getProperties() ?? {});
+      for (const b of B)
+        if (!this.recursiveValueComparison(
+          this.resolveUntypedNodeAgainstMatcherType(
+            b,
+            V,
+            F ?? V,
+            n
+          ),
+          V,
+          F ?? V,
+          n
+        ))
           return !1;
     }
     return !0;
   }
+  resolveUntypedNodeAgainstMatcherType(e, t, r, n) {
+    return e.getType() !== void 0 || this.isExplicitBlueIdMatcher(r) ? e : this.resolveAgainstTargetType(e, t, n) ?? e;
+  }
   hasValueInNestedStructure(e) {
     if (e.getValue() !== void 0)
       return !0;
@@ -2102,7 +2142,13 @@ class ps {
    * shape of the requested core list or dictionary type.
    */
   matchesImplicitStructure(e, t) {
-    return t === void 0 || e.getType() !== void 0 ? !1 : Jt(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : Wt(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
+    return t === void 0 || e.getType() !== void 0 ? !1 : Ee(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : Ne(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
+  }
+  matchesImplicitCoreCollectionType(e, t) {
+    return e.getType() !== void 0 ? !1 : Ee(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : Ne(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
+  }
+  isCoreCollectionType(e) {
+    return Ee(e, this.blue.getNodeProvider()) || Ne(e, this.blue.getNodeProvider());
   }
   isImplicitListStructure(e) {
     return e.getItems() !== void 0 && e.getValue() === void 0;
@@ -2110,76 +2156,145 @@ class ps {
   isImplicitDictionaryStructure(e) {
     return e.getProperties() !== void 0 && e.getValue() === void 0;
   }
+  isBareBlueIdReference(e) {
+    return e.getBlueId() !== void 0 && e.getType() === void 0 && e.getValue() === void 0 && e.getItems() === void 0 && e.getItemType() === void 0 && e.getKeyType() === void 0 && e.getProperties() === void 0 && e.getValueType() === void 0;
+  }
+  isExplicitBlueIdMatcher(e) {
+    return this.isBareBlueIdReference(e);
+  }
+  resolveAgainstTargetType(e, t, r) {
+    try {
+      const n = e.clone(), i = n.clone().setType(t.clone()), o = this.blue.resolve(i, r);
+      return this.restoreMissingStructure(o, n), o;
+    } catch {
+      return null;
+    }
+  }
+  expandSchemaOwnedTypeReferences(e) {
+    return this.isSchemaDefinitionNode(e) ? this.expandSchemaTypeReferences(e.clone()) : e;
+  }
+  isSchemaDefinitionNode(e) {
+    return e.getBlueId() !== void 0 && (e.getName() !== void 0 || e.getDescription() !== void 0 || e.getType() !== void 0 || e.getItemType() !== void 0 || e.getKeyType() !== void 0 || e.getValueType() !== void 0 || e.getItems() !== void 0 || e.getProperties() !== void 0);
+  }
+  expandSchemaTypeReferences(e, t = /* @__PURE__ */ new Set()) {
+    const r = this.withVisitedBlueId(
+      t,
+      e.getBlueId()
+    ), n = e.getType();
+    n && e.setType(this.expandReferencedTypeNode(n, r));
+    const i = e.getItemType();
+    i && e.setItemType(
+      this.expandReferencedTypeNode(i, r)
+    );
+    const o = e.getKeyType();
+    o && e.setKeyType(
+      this.expandReferencedTypeNode(o, r)
+    );
+    const l = e.getValueType();
+    l && e.setValueType(
+      this.expandReferencedTypeNode(l, r)
+    );
+    const a = e.getItems();
+    a && e.setItems(
+      a.map(
+        (f) => this.expandSchemaTypeReferences(f, r)
+      )
+    );
+    const u = e.getProperties();
+    return u && e.setProperties(
+      Object.fromEntries(
+        Object.entries(u).map(([f, h]) => [
+          f,
+          this.expandSchemaTypeReferences(h, r)
+        ])
+      )
+    ), e;
+  }
+  expandReferencedTypeNode(e, t) {
+    if (!this.isBareBlueIdReference(e))
+      return this.expandSchemaTypeReferences(e.clone(), t);
+    const r = e.getBlueId();
+    if (!r || t.has(r))
+      return e.clone();
+    const n = this.blue.getNodeProvider().fetchByBlueId(r);
+    return !n || n.length !== 1 ? e.clone() : this.expandSchemaTypeReferences(n[0].clone(), t);
+  }
+  withVisitedBlueId(e, t) {
+    if (!t || e.has(t))
+      return e;
+    const r = new Set(e);
+    return r.add(t), r;
+  }
 }
-const hs = (s) => s instanceof Nt || s instanceof St || s instanceof Ct || s instanceof At || s instanceof Ne || s instanceof Se, fs = (s) => s instanceof ee || s instanceof te || s instanceof Be || s instanceof be;
-class Zt {
+const ys = (s) => s instanceof Rt || s instanceof Ot || s instanceof Mt || s instanceof Dt || s instanceof Ve || s instanceof Re, gs = (s) => s instanceof re || s instanceof se || s instanceof we || s instanceof Pe;
+class qt {
   static convertValue(e, t) {
     const r = e.getType()?.getBlueId(), n = e.getValue();
-    return m(n) ? fs(t) && _e.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : n : _ === r ? this.convertFromString(String(n), t) : L === r || n instanceof S ? this.convertFromBigDecimal(
-      new S(n?.toString()),
+    return m(n) ? gs(t) && ke.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : n : Y === r ? this.convertFromString(String(n), t) : z === r || n instanceof A ? this.convertFromBigDecimal(
+      new A(n?.toString()),
       t
-    ) : j === r || n instanceof E ? this.convertFromBigInteger(
-      new E(n?.toString()),
+    ) : G === r || n instanceof N ? this.convertFromBigInteger(
+      new N(n?.toString()),
       t
-    ) : U === r || typeof n == "boolean" ? this.convertFromBoolean(!!n, t) : this.convertFromString(String(n), t);
+    ) : J === r || typeof n == "boolean" ? this.convertFromBoolean(!!n, t) : this.convertFromString(String(n), t);
   }
   static convertFromString(e, t) {
-    if (!t || t instanceof ee || t instanceof ur || t instanceof dr)
+    if (!t || t instanceof re || t instanceof pr || t instanceof hr)
       return e;
-    if (t instanceof te)
+    if (t instanceof se)
       return Number(e);
-    if (t instanceof Be)
+    if (t instanceof we)
       return e.toLowerCase() === "true";
-    if (t instanceof be)
+    if (t instanceof Pe)
       return BigInt(e);
     throw new Error(`Cannot convert String to ${t._def.typeName}`);
   }
   static convertFromBigDecimal(e, t) {
-    if (t instanceof te)
+    if (t instanceof se)
       return e.toNumber();
-    if (t instanceof ee)
+    if (t instanceof re)
       return e.toString();
     throw new Error(`Cannot convert Number to ${t._def.typeName}`);
   }
   static convertFromBigInteger(e, t) {
-    if (t instanceof te)
+    if (t instanceof se)
       return e.toNumber();
-    if (t instanceof be)
+    if (t instanceof Pe)
       return BigInt(e.toString());
-    if (t instanceof ee)
+    if (t instanceof re)
       return e.toString();
     throw new Error(`Cannot convert Number to ${t._def.typeName}`);
   }
   static convertFromBoolean(e, t) {
-    if (!t || t instanceof Be)
+    if (!t || t instanceof we)
       return e;
-    if (t instanceof ee)
+    if (t instanceof re)
       return e.toString();
-    if (t instanceof te)
+    if (t instanceof se)
       return Number(e);
-    if (t instanceof be)
+    if (t instanceof Pe)
       return BigInt(e);
     throw new Error(`Cannot convert Boolean to ${t._def.typeName}`);
   }
   static getDefaultPrimitiveValue(e) {
     if (!e) return null;
-    if (e instanceof te)
+    if (e instanceof se)
       return 0;
-    if (e instanceof Be)
+    if (e instanceof we)
       return !1;
-    if (e instanceof ee)
+    if (e instanceof re)
       return "";
     throw new Error(
       `Unsupported primitive type: ${e._def.typeName}`
     );
   }
 }
-class ys {
+class ms {
   convert(e, t) {
-    return Zt.convertValue(e, t);
+    return qt.convertValue(e, t);
   }
 }
-class gs {
+class Is {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2187,28 +2302,28 @@ class gs {
     return this.convertFields(e, t);
   }
   convertFields(e, t) {
-    if (t instanceof pr) {
+    if (t instanceof fr) {
       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 hr)
+    if (t instanceof yr)
       throw new Error("Union not supported");
-    if (t instanceof fr)
+    if (t instanceof gr)
       return Object.keys(t.shape).reduce(
         (n, i) => {
-          const o = e.getProperties(), l = t.shape[i], a = Xr(l);
+          const o = e.getProperties(), l = t.shape[i], a = Qr(l);
           if (d(a)) {
-            const v = rt(a) ? a : i, k = o?.[v], q = k ? T.calculateBlueIdSync(k) : void 0;
-            return n[i] = q, n;
+            const v = lt(a) ? a : i, x = o?.[v], V = x ? T.calculateBlueIdSync(x) : void 0;
+            return n[i] = V, n;
           }
-          const u = Qr(l);
+          const u = ts(l);
           if (d(u)) {
             const v = o?.[u];
             return n[i] = v?.getName(), n;
           }
-          const y = Wr(l);
-          if (d(y)) {
-            const v = o?.[y];
+          const f = Hr(l);
+          if (d(f)) {
+            const v = o?.[f];
             return n[i] = v?.getDescription(), n;
           }
           if (i === "name") {
@@ -2219,21 +2334,21 @@ class gs {
             const v = e.getDescription();
             return n[i] = v, n;
           }
-          const p = o?.[i];
-          if (m(p))
+          const h = o?.[i];
+          if (m(h))
             return n;
-          const f = this.nodeToObjectConverter.convert(
-            p,
+          const g = this.nodeToObjectConverter.convert(
+            h,
             l
           );
-          return n[i] = f, n;
+          return n[i] = g, n;
         },
         {}
       );
     throw new Error("Unknown schema type, " + t._def.typeName);
   }
 }
-class ms {
+class Ts {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2247,7 +2362,7 @@ class ms {
     );
   }
 }
-class Is {
+class vs {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2261,35 +2376,35 @@ class Is {
     return new Set(i);
   }
 }
-class Ts {
+class Bs {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
   convert(e, t) {
     const r = t.keySchema, n = t.valueSchema, i = /* @__PURE__ */ new Map(), o = e.getName();
-    d(o) && i.set(G, o);
+    d(o) && i.set(H, o);
     const l = e.getDescription();
-    d(l) && i.set(J, l);
+    d(l) && i.set(X, l);
     const a = e.getProperties();
-    return d(a) && Object.entries(a).forEach(([u, y]) => {
-      const p = new c().setValue(u);
-      p.setType(new c().setBlueId(_));
-      const f = Zt.convertValue(p, r), v = this.nodeToObjectConverter.convert(y, n);
-      i.set(f, v);
-    }), t instanceof yr ? Object.fromEntries(i) : i;
+    return d(a) && Object.entries(a).forEach(([u, f]) => {
+      const h = new c().setValue(u);
+      h.setType(new c().setBlueId(Y));
+      const g = qt.convertValue(h, r), v = this.nodeToObjectConverter.convert(f, n);
+      i.set(g, v);
+    }), t instanceof mr ? Object.fromEntries(i) : i;
   }
 }
-class vs {
+class bs {
   convert(e) {
     return I.get(e);
   }
 }
-class Bs {
+class ws {
   convert(e) {
     return I.get(e);
   }
 }
-class bs {
+class Ps {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2303,60 +2418,60 @@ class bs {
     );
   }
 }
-const ws = h.union([
-  h.literal("ZodString"),
-  h.literal("ZodNumber"),
-  h.literal("ZodBoolean"),
-  h.literal("ZodBigInt"),
-  h.literal("ZodArray"),
-  h.literal("ZodSet"),
-  h.literal("ZodMap"),
-  h.literal("ZodRecord"),
-  h.literal("ZodObject"),
-  h.literal("ZodEnum"),
-  h.literal("ZodNativeEnum"),
-  h.literal("ZodUnknown"),
-  h.literal("ZodAny"),
-  h.literal("ZodTuple")
+const Es = p.union([
+  p.literal("ZodString"),
+  p.literal("ZodNumber"),
+  p.literal("ZodBoolean"),
+  p.literal("ZodBigInt"),
+  p.literal("ZodArray"),
+  p.literal("ZodSet"),
+  p.literal("ZodMap"),
+  p.literal("ZodRecord"),
+  p.literal("ZodObject"),
+  p.literal("ZodEnum"),
+  p.literal("ZodNativeEnum"),
+  p.literal("ZodUnknown"),
+  p.literal("ZodAny"),
+  p.literal("ZodTuple")
 ]);
-class Es {
+class Ns {
   constructor(e) {
-    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new gs(
+    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new Is(
       this.nodeToObjectConverter
     );
   }
   converters = /* @__PURE__ */ new Map();
   complexObjectConverter;
   registerConverters() {
-    const e = new ys(), t = new ms(this.nodeToObjectConverter), r = new bs(this.nodeToObjectConverter), n = new Is(this.nodeToObjectConverter), i = new Ts(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 vs()), this.converters.set("ZodAny", new Bs()), 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 ms(), t = new Ts(this.nodeToObjectConverter), r = new Ps(this.nodeToObjectConverter), n = new vs(this.nodeToObjectConverter), i = new Bs(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 bs()), this.converters.set("ZodAny", new ws()), 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 (hs(e))
-      return e instanceof Ne ? this.getSchemaTypeName(e.innerType()) : e instanceof Se ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
+    if (ys(e))
+      return e instanceof Ve ? this.getSchemaTypeName(e.innerType()) : e instanceof Re ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
     const t = e._def.typeName;
     try {
-      return ws.parse(t);
+      return Es.parse(t);
     } catch {
       throw new Error(`Schema type name ${t} is not supported`);
     }
   }
 }
-class Ps {
+class Ss {
   constructor(e) {
-    this.typeSchemaResolver = e, this.converterFactory = new Es(this);
+    this.typeSchemaResolver = e, this.converterFactory = new Ns(this);
   }
   converterFactory;
   convert(e, t) {
-    const r = this.typeSchemaResolver?.resolveSchema(e), n = A.unwrapSchema(t);
-    if (Gt(n))
+    const r = this.typeSchemaResolver?.resolveSchema(e), n = O.unwrapSchema(t);
+    if (Xt(n))
       return e;
     let i = n;
-    return A.checkSchemaExtension(
+    return O.checkSchemaExtension(
       r,
       n,
       { typeSchemaResolver: this.typeSchemaResolver }
@@ -2366,7 +2481,7 @@ class Ps {
     return this.converterFactory.getConverter(t).convert(e, t);
   }
 }
-class Ht {
+class Qt {
   reverse(e) {
     const t = new c();
     return this.reverseNode(t, e, e.getType()), t;
@@ -2411,8 +2526,8 @@ class Ht {
     }
     const a = i?.length || 0;
     for (let u = a; u < n.length; u++) {
-      const y = new c();
-      this.reverseNode(y, n[u], void 0), o.push(y);
+      const f = new c();
+      this.reverseNode(f, n[u], void 0), o.push(f);
     }
     o.length > 0 && e.setItems(o);
   }
@@ -2427,7 +2542,7 @@ class Ht {
         t,
         r
       ), u = new c();
-      this.reverseNode(u, l, a), _e.isEmptyNode(u) || (i[o] = u);
+      this.reverseNode(u, l, a), ke.isEmptyNode(u) || (i[o] = u);
     }
     Object.keys(i).length > 0 && e.setProperties(i);
   }
@@ -2458,16 +2573,16 @@ class Ht {
     d(a) && r.setValueType(a.clone());
     const u = t.getProperties();
     if (d(u)) {
-      const p = r.getProperties() || {};
-      for (const [f, v] of Object.entries(u))
-        p[f] = v.clone();
-      r.setProperties(p);
+      const h = r.getProperties() || {};
+      for (const [g, v] of Object.entries(u))
+        h[g] = v.clone();
+      r.setProperties(h);
     }
-    const y = t.getItems();
-    return d(y) && r.setItems(y.map((p) => p.clone())), r;
+    const f = t.getItems();
+    return d(f) && r.setItems(f.map((h) => h.clone())), r;
   }
 }
-class ne extends c {
+class oe extends c {
   /**
    * Creates a new ResolvedBlueNode from a resolved BlueNode
    * @param resolvedNode - The fully resolved node after merge operations
@@ -2489,7 +2604,7 @@ class ne extends c {
    * @returns The minimal node representation
    */
   getMinimalNode() {
-    return new Ht().reverse(this);
+    return new Qt().reverse(this);
   }
   getMinimalBlueId() {
     const e = this.getMinimalNode();
@@ -2501,7 +2616,7 @@ class ne extends c {
    */
   clone() {
     const e = super.clone();
-    return new ne(e);
+    return new oe(e);
   }
   /**
    * Creates a shallow clone of this ResolvedBlueNode while preserving
@@ -2510,7 +2625,7 @@ class ne extends c {
    */
   cloneShallow() {
     const e = super.cloneShallow();
-    return new ne(e);
+    return new oe(e);
   }
   /**
    * Copies all properties from another BlueNode
@@ -2522,7 +2637,7 @@ class ne extends c {
     t !== void 0 && this.setValue(t);
   }
 }
-class Te {
+class Be {
   /**
    * Fetches the first node associated with the given Blue ID
    * Default implementation that takes the first node from fetchByBlueId result
@@ -2535,42 +2650,42 @@ class Te {
     return t && t.length > 0 ? t[0] : null;
   }
 }
-function Ns(s) {
-  return new class extends Te {
+function Cs(s) {
+  return new class extends Be {
     fetchByBlueId(e) {
       return s(e);
     }
   }();
 }
-const ze = H.types.float.options, Ss = {
-  ...ze,
+const He = ee.types.float.options, As = {
+  ...He,
   construct: (s) => {
     const e = s.replace(/_/g, "").toLowerCase();
-    if (!Pt(e))
-      return new S(e);
-    if (ze.construct)
-      return ze.construct(s);
+    if (!Vt(e))
+      return new A(e);
+    if (He.construct)
+      return He.construct(s);
   }
-}, Cs = new H.Type("tag:yaml.org,2002:float", Ss), Ge = H.types.int.options, As = {
-  ...Ge,
+}, Vs = new ee.Type("tag:yaml.org,2002:float", As), Xe = ee.types.int.options, Rs = {
+  ...Xe,
   construct: (s) => {
     let e = s;
-    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !Pt(e))
-      return new E(e);
-    if (Ge.construct)
-      return Ge.construct(s);
-  }
-}, Vs = new H.Type("tag:yaml.org,2002:int", As), Xt = H.CORE_SCHEMA.extend({
-  implicit: [Cs, Vs]
-}), $ = (s) => {
-  const e = H.load(s, { schema: Xt });
+    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !Vt(e))
+      return new N(e);
+    if (Xe.construct)
+      return Xe.construct(s);
+  }
+}, Os = new ee.Type("tag:yaml.org,2002:int", Rs), er = ee.CORE_SCHEMA.extend({
+  implicit: [Vs, Os]
+}), K = (s) => {
+  const e = ee.load(s, { schema: er });
   return e === void 0 ? void 0 : e;
-}, Rs = (s) => H.dump(s, {
-  schema: Xt,
+}, Ms = (s) => ee.dump(s, {
+  schema: er,
   replacer: (e, t) => {
-    if (C(t)) {
-      if (Z(t)) {
-        const r = new D(Number.MIN_SAFE_INTEGER.toString()), n = new D(Number.MAX_SAFE_INTEGER.toString());
+    if (R(t)) {
+      if (Q(t)) {
+        const r = new j(Number.MIN_SAFE_INTEGER.toString()), n = new j(Number.MAX_SAFE_INTEGER.toString());
         if (t.lt(r) || t.gt(n))
           return t.toString();
       }
@@ -2579,13 +2694,13 @@ const ze = H.types.float.options, Ss = {
     return t;
   }
 });
-class Os {
+class Ds {
   static get(e, t = {}) {
     const { strategy: r = "official" } = t, n = I.get(e, r);
-    return Rs(n);
+    return Ms(n);
   }
 }
-class Ms extends Te {
+class xs extends Be {
   nodeProviders;
   constructor(e) {
     super(), this.nodeProviders = e;
@@ -2612,7 +2727,7 @@ class Ms extends Te {
     return this.nodeProviders;
   }
 }
-const qt = `- type:
+const tr = `- type:
     blueId: 27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo
   mappings:
     Text: DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K
@@ -2623,20 +2738,20 @@ const qt = `- type:
     Dictionary: G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj
 - type:
     blueId: FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4
-`, Ds = `name: Transformation
-description: TODO`, xs = `name: Infer Basic Types For Untyped Values
+`, Fs = `name: Transformation
+description: TODO`, $s = `name: Infer Basic Types For Untyped Values
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation infers type details for Text, Integer, Number and Boolean.`, Fs = `name: Replace Inline Types with BlueIds
+description: This transformation infers type details for Text, Integer, Number and Boolean.`, _s = `name: Replace Inline Types with BlueIds
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation replaces`, $s = [
-  qt,
-  Ds,
-  xs,
-  Fs
+description: This transformation replaces`, Ls = [
+  tr,
+  Fs,
+  $s,
+  _s
 ];
-class _s extends Te {
+class js extends Be {
   blueIdToNodesMap = /* @__PURE__ */ new Map();
   constructor() {
     super(), this.load();
@@ -2645,45 +2760,45 @@ class _s extends Te {
     return this.blueIdToNodesMap.get(e) || [];
   }
   load() {
-    for (const e of $s) {
-      const t = $(e);
+    for (const e of Ls) {
+      const t = K(e);
       if (t === void 0) {
         console.error(`This content file is not valid YAML: ${e}`);
         continue;
       }
       if (Array.isArray(t)) {
         const r = t.map(
-          (i) => g.deserialize(i)
+          (i) => y.deserialize(i)
         ), n = T.calculateBlueIdSync(r);
         this.blueIdToNodesMap.set(n, r);
       } else {
-        const r = g.deserialize(t), n = T.calculateBlueIdSync(r);
+        const r = y.deserialize(t), n = T.calculateBlueIdSync(r);
         this.blueIdToNodesMap.set(n, [r]);
       }
     }
   }
 }
-class ht extends Te {
-  static INSTANCE = new ht();
+class It extends Be {
+  static INSTANCE = new It();
   nodeProvider;
   constructor() {
-    super(), this.nodeProvider = new _s();
+    super(), this.nodeProvider = new js();
   }
   fetchByBlueId(e) {
     return this.nodeProvider.fetchByBlueId(e);
   }
 }
-class Je {
+class qe {
   constructor(e, t, r) {
     this.blueId = e, this.content = t, this.isMultipleDocuments = r;
   }
 }
-class z {
+class Z {
   static THIS_REFERENCE_PATTERN = /^this(#\d+)?$/;
   static parseAndCalculateBlueId(e, t) {
     let r;
     try {
-      const l = $(e);
+      const l = K(e);
       if (l === void 0)
         throw new Error();
       r = l;
@@ -2694,19 +2809,19 @@ class z {
     const o = Array.isArray(r) && r.length > 1;
     if (o) {
       const l = r.map((a) => {
-        const u = g.deserialize(a);
+        const u = y.deserialize(a);
         return t(u);
       });
       n = T.calculateBlueIdSync(l), i = l.map((a) => I.get(a));
     } else {
-      const l = g.deserialize(r), a = t(l);
+      const l = y.deserialize(r), a = t(l);
       n = T.calculateBlueIdSync(a), i = I.get(a);
     }
-    return new Je(n, i, o);
+    return new qe(n, i, o);
   }
   static parseAndCalculateBlueIdForNode(e, t) {
     const r = t(e), n = T.calculateBlueIdSync(r), i = I.get(r);
-    return new Je(n, i, !1);
+    return new qe(n, i, !1);
   }
   static parseAndCalculateBlueIdForNodeList(e, t) {
     if (!e || e.length === 0)
@@ -2714,7 +2829,7 @@ class z {
     const r = e.map(t), n = T.calculateBlueIdSync(r), i = r.map(
       (l) => I.get(l)
     ), o = e.length > 1;
-    return new Je(n, i, o);
+    return new qe(n, i, o);
   }
   static resolveThisReferences(e, t, r) {
     return this.resolveThisReferencesRecursive(
@@ -2765,12 +2880,12 @@ class z {
     }
   }
 }
-class Ls extends Te {
+class Us extends Be {
   fetchByBlueId(e) {
     const t = e.split("#")[0], r = this.fetchContentByBlueId(t);
     if (r == null)
       return null;
-    const n = Array.isArray(r) && r.length > 1, i = z.resolveThisReferences(
+    const n = Array.isArray(r) && r.length > 1, i = Z.resolveThisReferences(
       r,
       t,
       n
@@ -2780,24 +2895,24 @@ class Ls extends Te {
       if (o.length > 1) {
         const l = parseInt(o[1]);
         if (Array.isArray(i) && l < i.length) {
-          const a = i[l], u = g.deserialize(a);
+          const a = i[l], u = y.deserialize(a);
           return u.setBlueId(e), [u];
         } else if (l === 0) {
-          const a = g.deserialize(i);
+          const a = y.deserialize(i);
           return a.setBlueId(e), [a];
         } else
           return null;
       }
     }
     if (Array.isArray(i))
-      return i.map((o) => g.deserialize(o));
+      return i.map((o) => y.deserialize(o));
     {
-      const o = g.deserialize(i);
+      const o = y.deserialize(i);
       return o.setBlueId(t), [o];
     }
   }
 }
-class Qt extends Ls {
+class rr extends Us {
   nameToBlueIdsMap = /* @__PURE__ */ new Map();
   /**
    * Find a node by name. Throws an error if multiple nodes are found with the same name.
@@ -2841,17 +2956,17 @@ class Qt extends Ls {
     ]);
   }
 }
-const er = (s) => s instanceof c || Array.isArray(s) && s.every((e) => e instanceof c) ? s : tt(s) ? s.map((e) => g.deserialize(e)) : g.deserialize(s), js = async (s) => {
-  const e = er(s);
+const sr = (s) => s instanceof c || Array.isArray(s) && s.every((e) => e instanceof c) ? s : ot(s) ? s.map((e) => y.deserialize(e)) : y.deserialize(s), ks = async (s) => {
+  const e = sr(s);
   return T.calculateBlueId(e);
-}, Zn = (s) => {
-  const e = er(s);
+}, Xn = (s) => {
+  const e = sr(s);
   return T.calculateBlueIdSync(e);
-}, Bt = async (s) => {
-  if (Pr(s))
+}, Nt = async (s) => {
+  if (Sr(s))
     return s;
   try {
-    const e = Ae.parse(s), t = await js(e);
+    const e = Me.parse(s), t = await ks(e);
     return {
       ...s,
       blueId: t
@@ -2859,31 +2974,31 @@ const er = (s) => s instanceof c || Array.isArray(s) && s.every((e) => e instanc
   } catch (e) {
     throw new Error(`Failed enriching object with Blue ID: ${e}`);
   }
-}, Hn = (s) => s?.items, Xn = (s) => s?.value, qn = (s) => m(s) ? {} : Rt(
+}, qn = (s) => s?.items, Qn = (s) => s?.value, ei = (s) => m(s) ? {} : Ft(
   s,
-  nt
-), Qn = (s) => Sr(s) ? s.type.name ?? null : Cr(s) ? gr(typeof s.value) : Nr(s) ? "List" : null, Us = (s) => d(s) && Object.keys(Rt(s, ["blueId"])).length > 0, ei = (s) => {
+  ct
+), ti = (s) => Ar(s) ? s.type.name ?? null : Vr(s) ? Ir(typeof s.value) : Cr(s) ? "List" : null, Ks = (s) => d(s) && Object.keys(Ft(s, ["blueId"])).length > 0, ri = (s) => {
   try {
-    const e = g.deserialize(s), t = I.get(e);
-    return de.parse(t);
+    const e = y.deserialize(s), t = I.get(e);
+    return he.parse(t);
   } catch (e) {
     throw new Error(
       `Failed transforming JSON-like value to BlueObject: ${e}`
     );
   }
-}, bt = 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 mr(s.items, async (l) => await Bt(l));
+  let i = await Tr(s.items, async (l) => await Nt(l));
   const o = Math.max(i?.length - n, 0);
   for (let l = i.length - 1; l >= o; l--)
-    if (!Us(i[l])) {
+    if (!Ks(i[l])) {
       const a = await e(i[l], { signal: t });
       if (Array.isArray(a))
-        return bt({
+        return St({
           ...s,
           items: [
             ...i.slice(0, l),
@@ -2891,9 +3006,9 @@ const er = (s) => s instanceof c || Array.isArray(s) && s.every((e) => e instanc
             ...i.slice(l + 1)
           ]
         });
-      const u = await Bt(a);
+      const u = await Nt(a);
       if (r?.includes(u.blueId))
-        return bt({
+        return St({
           ...s,
           items: [...i.slice(0, l), ...i.slice(l + 1)]
         });
@@ -2905,7 +3020,7 @@ const er = (s) => s instanceof c || Array.isArray(s) && s.every((e) => e instanc
     }
   return i;
 };
-function Ee(s) {
+function Ce(s) {
   try {
     const e = new URL(s);
     return e.protocol === "http:" || e.protocol === "https:";
@@ -2913,14 +3028,14 @@ function Ee(s) {
     return !1;
   }
 }
-class ks {
+class Ys {
   /**
    * Process a document node to infer basic types for untyped values
    * @param document - The document to process
    * @returns The processed document
    */
   process(e) {
-    return w.transform(e, this.inferType.bind(this));
+    return E.transform(e, this.inferType.bind(this));
   }
   /**
    * Infer a basic type for a node
@@ -2929,10 +3044,10 @@ class ks {
    */
   inferType(e) {
     const t = e.getType(), r = e.getValue();
-    return m(t) && d(r) && (typeof r == "string" ? e.setType(new c().setBlueId(_)) : typeof r == "bigint" || Z(r) ? e.setType(new c().setBlueId(j)) : We(r) ? e.setType(new c().setBlueId(L)) : typeof r == "boolean" && e.setType(new c().setBlueId(U))), e;
+    return m(t) && d(r) && (typeof r == "string" ? e.setType(new c().setBlueId(Y)) : typeof r == "bigint" || Q(r) ? e.setType(new c().setBlueId(G)) : Qe(r) ? e.setType(new c().setBlueId(z)) : typeof r == "boolean" && e.setType(new c().setBlueId(J))), e;
   }
 }
-class Re {
+class xe {
   static MAPPINGS = "mappings";
   mappings = /* @__PURE__ */ new Map();
   /**
@@ -2942,8 +3057,8 @@ class Re {
   constructor(e) {
     if (e instanceof c) {
       const r = e.getProperties();
-      if (r && r[Re.MAPPINGS]) {
-        const i = r[Re.MAPPINGS].getProperties();
+      if (r && r[xe.MAPPINGS]) {
+        const i = r[xe.MAPPINGS].getProperties();
         i && Object.entries(i).forEach(([o, l]) => {
           const a = l.getValue();
           typeof a == "string" && this.mappings.set(o, a);
@@ -2958,7 +3073,7 @@ class Re {
    * @returns The processed document
    */
   process(e) {
-    return w.transform(e, this.transformNode.bind(this));
+    return E.transform(e, this.transformNode.bind(this));
   }
   transformNode(e) {
     const t = e.clone();
@@ -2977,7 +3092,7 @@ class Re {
     }
   }
 }
-class Ks {
+class zs {
   /**
    * Process a document node to validate all inline types have been replaced
    * @param document - The document to process
@@ -2985,7 +3100,7 @@ class Ks {
    * @throws Error if any inline type values remain without BlueId mappings
    */
   process(e) {
-    return w.transform(e, this.validateNode.bind(this)), e;
+    return E.transform(e, this.validateNode.bind(this)), e;
   }
   validateNode(e) {
     return this.validateTypeField(e, e.getType(), "type"), this.validateTypeField(e, e.getItemType(), "itemType"), this.validateTypeField(e, e.getKeyType(), "keyType"), this.validateTypeField(e, e.getValueType(), "valueType"), e;
@@ -2999,7 +3114,7 @@ class Ks {
     }
   }
 }
-class ft {
+class Tt {
   nodeProvider;
   strategy;
   /**
@@ -3008,7 +3123,7 @@ class ft {
    * @param strategy - The strategy to use for missing elements (defaults to THROW_EXCEPTION)
    */
   constructor(e, t) {
-    this.nodeProvider = he.wrap(e), this.strategy = t || "THROW_EXCEPTION";
+    this.nodeProvider = ye.wrap(e), this.strategy = t || "THROW_EXCEPTION";
   }
   /**
    * Extends a node with its resolved references
@@ -3026,17 +3141,17 @@ class ft {
     }
     try {
       const i = e.getBlueId();
-      if (i && !X.includes(
+      if (i && !te.includes(
         i
       )) {
-        const f = this.fetchNode(e);
-        if (f && f.length > 0)
-          if (f.length === 1) {
-            const v = f[0];
+        const g = this.fetchNode(e);
+        if (g && g.length > 0)
+          if (g.length === 1) {
+            const v = g[0];
             this.mergeNodes(e, v);
           } else {
-            const v = f.map((q) => q.clone()), k = new c().setItems(v);
-            this.mergeNodes(e, k);
+            const v = g.map((V) => V.clone()), x = new c().setItems(v);
+            this.mergeNodes(e, x);
           }
       }
       const o = e.getType();
@@ -3047,15 +3162,15 @@ class ft {
       a && this.extendNode(a, t, "keyType", !0);
       const u = e.getValueType();
       u && this.extendNode(u, t, "valueType", !0);
-      const y = e.getProperties();
-      y && Object.entries(y).forEach(([f, v]) => {
-        this.extendNode(v, t, f, !1);
+      const f = e.getProperties();
+      f && Object.entries(f).forEach(([g, v]) => {
+        this.extendNode(v, t, g, !1);
       });
-      const p = e.getItems();
-      if (p && p.length > 0) {
-        this.reconstructList(p);
-        for (let f = 0; f < p.length; f++)
-          this.extendNode(p[f], t, String(f), !1);
+      const h = e.getItems();
+      if (h && h.length > 0) {
+        this.reconstructList(h);
+        for (let g = 0; g < h.length; g++)
+          this.extendNode(h[g], t, String(g), !1);
       }
     } finally {
       n || t.exitPathSegment();
@@ -3093,7 +3208,7 @@ class ft {
     d(r) && e.setValue(r), e.setItems(t.getItems()), e.setProperties(t.getProperties());
   }
 }
-class yt {
+class vt {
   blueIdsCollections = [];
   /**
    * Initializes the generator with default BlueIds collections
@@ -3163,7 +3278,7 @@ ${r}`;
     return Object.keys(this.getAllBlueIds()).length;
   }
 }
-class ie {
+class le {
   static DEFAULT_BLUE_BLUE_ID = "6sqUywMoBRyj9hgQxSu2nDPnqcyiSM7xu9AB9sN98YJK";
   processorProvider;
   nodeProvider;
@@ -3177,7 +3292,7 @@ class ie {
     const { nodeProvider: t, processorProvider: r, blueIdsMappingGenerator: n } = e;
     if (!t)
       throw new Error("NodeProvider is required");
-    this.nodeProvider = he.wrap(t), this.processorProvider = r || ie.getStandardProvider(), this.blueIdsMappingGenerator = n || new yt(), this.loadDefaultSimpleBlue();
+    this.nodeProvider = ye.wrap(t), this.processorProvider = r || le.getStandardProvider(), this.blueIdsMappingGenerator = n || new vt(), this.loadDefaultSimpleBlue();
   }
   /**
    * Preprocesses a document node
@@ -3204,9 +3319,9 @@ class ie {
   preprocessWithOptions(e, t) {
     let r = e.clone(), n = r.getBlue();
     if (!n && t && (n = t.clone()), n) {
-      new ft(this.nodeProvider).extend(
+      new Tt(this.nodeProvider).extend(
         n,
-        Le.withSinglePath("/*")
+        Ke.withSinglePath("/*")
       );
       const i = n.getItems();
       if (i && i.length > 0) {
@@ -3221,7 +3336,7 @@ class ie {
         }
         r.setBlue(void 0);
       }
-      r = new Ks().process(
+      r = new zs().process(
         r
       );
     }
@@ -3236,11 +3351,11 @@ class ie {
       getProcessor(e) {
         const t = "27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo", r = "FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4", n = e.getType()?.getBlueId();
         if (t === n)
-          return new Re(
+          return new xe(
             e
           );
         if (r === n)
-          return new ks();
+          return new Ys();
       }
     };
   }
@@ -3261,9 +3376,9 @@ ${t}
    */
   loadDefaultSimpleBlue() {
     try {
-      const e = this.enrichDefaultBlue(qt), t = $(e);
+      const e = this.enrichDefaultBlue(tr), t = K(e);
       if (t)
-        this.defaultSimpleBlue = g.deserialize(t);
+        this.defaultSimpleBlue = y.deserialize(t);
       else
         throw new Error("Failed to parse default Blue content");
     } catch (e) {
@@ -3271,15 +3386,15 @@ ${t}
     }
   }
 }
-class gt extends Qt {
+class Bt extends rr {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   preprocessor;
   constructor(e) {
     super();
-    const t = new yt(), r = gt.collectAliasMappings(e);
+    const t = new vt(), r = Bt.collectAliasMappings(e);
     Object.keys(r).length > 0 && t.registerBlueIds(r);
-    const n = new ie({
+    const n = new le({
       nodeProvider: this,
       blueIdsMappingGenerator: t
     });
@@ -3308,7 +3423,7 @@ class gt extends Qt {
     Array.isArray(e) ? this.processMultipleDocuments(e, t) : this.processSingleDocument(e, t);
   }
   processSingleDocument(e, t) {
-    const r = g.deserialize(e), n = z.parseAndCalculateBlueIdForNode(
+    const r = y.deserialize(e), n = Z.parseAndCalculateBlueIdForNode(
       r,
       this.preprocessor
     ), i = t || n.blueId;
@@ -3318,22 +3433,22 @@ class gt extends Qt {
   }
   processMultipleDocuments(e, t) {
     const r = e.map((o) => {
-      const l = g.deserialize(o);
+      const l = y.deserialize(o);
       return this.preprocessor(l);
-    }), n = z.parseAndCalculateBlueIdForNodeList(
+    }), n = Z.parseAndCalculateBlueIdForNodeList(
       r,
       (o) => o
     ), i = t || n.blueId;
     this.blueIdToContentMap.set(i, n.content), this.blueIdToMultipleDocumentsMap.set(i, !0), r.forEach((o, l) => {
-      const a = `${i}#${l}`, u = I.get(o), y = T.calculateBlueIdSync(o);
-      this.blueIdToContentMap.set(y, u), this.blueIdToMultipleDocumentsMap.set(y, !1);
-      const p = o.getName();
-      p && this.addToNameMap(p, a);
+      const a = `${i}#${l}`, u = I.get(o), f = T.calculateBlueIdSync(o);
+      this.blueIdToContentMap.set(f, u), this.blueIdToMultipleDocumentsMap.set(f, !1);
+      const h = o.getName();
+      h && this.addToNameMap(h, a);
     });
   }
   fetchContentByBlueId(e) {
     const t = this.blueIdToContentMap.get(e), r = this.blueIdToMultipleDocumentsMap.get(e);
-    return t !== void 0 && r !== void 0 ? z.resolveThisReferences(
+    return t !== void 0 && r !== void 0 ? Z.resolveThisReferences(
       t,
       e,
       r
@@ -3353,7 +3468,7 @@ class gt extends Qt {
     return this.blueIdToContentMap.has(t);
   }
 }
-class he {
+class ye {
   /**
    * Wraps a NodeProvider with a SequentialNodeProvider that includes bootstrap providers and repository definitions
    * @param originalProvider - The original NodeProvider to wrap
@@ -3361,15 +3476,15 @@ class he {
    * @returns A wrapped NodeProvider that includes bootstrap providers and repository definitions
    */
   static wrap(e, t) {
-    const r = [ht.INSTANCE];
+    const r = [It.INSTANCE];
     if (t && t.length > 0) {
-      const n = new gt(t);
+      const n = new Bt(t);
       r.push(n);
     }
-    return r.push(e), new Ms(r);
+    return r.push(e), new xs(r);
   }
 }
-class Ys {
+class Gs {
   preprocessingAliases = /* @__PURE__ */ new Map();
   urlContentFetcher;
   /**
@@ -3393,9 +3508,9 @@ class Ys {
       const r = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(r, t);
-      if (Ce.isPotentialBlueId(t))
+      if (Oe.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      throw Ee(t) ? new Error(
+      throw Ce(t) ? new Error(
         `URL '${t}' detected. Use the async version of this method to fetch the content.`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -3413,9 +3528,9 @@ class Ys {
       const r = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(r, t);
-      if (Ce.isPotentialBlueId(t))
+      if (Oe.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      if (Ee(t) && this.urlContentFetcher)
+      if (Ce(t) && this.urlContentFetcher)
         try {
           const n = await this.fetchFromUrl(t);
           return n && r.setBlue(new c().setItems(n)), r;
@@ -3425,7 +3540,7 @@ class Ys {
 ${n.message}`
           ) : n;
         }
-      else throw Ee(t) ? new Error(
+      else throw Ce(t) ? new Error(
         `UrlContentFetcher not provided for URL: ${t}`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -3511,24 +3626,24 @@ ${n.message}`
     return this.urlContentFetcher;
   }
 }
-const zs = {
+const Js = {
   fetchUrl: async (s) => {
     throw new Error(
       `You must provide a custom UrlFetchStrategy to fetch content from URL: ${s}`
     );
   }
 };
-class Gs {
+class Ws {
   // Cache to avoid repeated network requests for the same URL
   cache = /* @__PURE__ */ new Map();
   fetchStrategy;
   enabled = !1;
   allowedDomains = [];
   constructor(e) {
-    this.fetchStrategy = e || zs;
+    this.fetchStrategy = e || Js;
   }
   validateUrl(e) {
-    if (!Ee(e))
+    if (!Ce(e))
       throw new Error(`Invalid URL: ${e}`);
     return !0;
   }
@@ -3567,13 +3682,13 @@ class Gs {
     const { data: r, contentType: n } = t;
     let i;
     if (n.includes("application/json") || n.includes("text/yaml") || n.includes("application/yaml") || n.includes("text/plain"))
-      i = $(r);
+      i = K(r);
     else
       throw new Error(`Unsupported content type from URL: ${n}`);
     if (i === void 0)
       throw new Error(`Failed to parse content from URL: ${e}`);
     let o;
-    return Array.isArray(i) ? o = i.map((l) => g.deserialize(l)) : o = [g.deserialize(i)], this.cache.set(e, o), o;
+    return Array.isArray(i) ? o = i.map((l) => y.deserialize(l)) : o = [y.deserialize(i)], this.cache.set(e, o), o;
   }
   prefetchUrl(e, t) {
     try {
@@ -3647,7 +3762,7 @@ class Gs {
     return this.allowedDomains = [], this;
   }
 }
-class Js {
+class Zs {
   /**
    * Resolves a node without limits
    * Default implementation that uses NO_LIMITS
@@ -3656,10 +3771,10 @@ class Js {
    * @returns The resolved node using NO_LIMITS
    */
   resolveWithoutLimits(e) {
-    return this.resolve(e, K);
+    return this.resolve(e, _);
   }
 }
-class Ws extends Js {
+class Hs extends Zs {
   mergingProcessor;
   nodeProvider;
   /**
@@ -3668,7 +3783,7 @@ class Ws extends Js {
    * @param nodeProvider - The provider to use for resolving nodes
    */
   constructor(e, t) {
-    super(), this.mergingProcessor = e, this.nodeProvider = he.wrap(t);
+    super(), this.mergingProcessor = e, this.nodeProvider = ye.wrap(t);
   }
   /**
    * Merges a source node into a target node with the given limits
@@ -3746,11 +3861,11 @@ class Ws extends Js {
         if (r.limits.shouldMergePathSegment(String(a), u)) {
           this.enterPathSegment(r, String(a), u);
           try {
-            const y = this.materializeForCurrentContext(
+            const f = this.materializeForCurrentContext(
               u,
               r
             );
-            l.push(y);
+            l.push(f);
           } finally {
             this.exitPathSegment(r);
           }
@@ -3777,11 +3892,11 @@ class Ws extends Js {
         this.enterPathSegment(r, String(l), t[l]);
         try {
           if (l >= o.length) {
-            const y = this.materializeForCurrentContext(
+            const f = this.materializeForCurrentContext(
               t[l],
               r
             );
-            o.push(y);
+            o.push(f);
             continue;
           }
           const a = T.calculateBlueIdSync(
@@ -3845,7 +3960,7 @@ class Ws extends Js {
     d(u) && u.length >= a.length || r.inheritedItemsPrefixByPath.set(n, a);
   }
   isInheritedListMarkerNode(e) {
-    return d(e) && d(e.getBlueId()) && _e.hasBlueIdOnly(e);
+    return d(e) && d(e.getBlueId()) && ke.hasBlueIdOnly(e);
   }
   mergeChildrenWithInheritedItemsPrefix(e, t, r, n) {
     const i = [...t];
@@ -3880,18 +3995,18 @@ class Ws extends Js {
       if (r.limits.shouldMergePathSegment(l, a)) {
         this.enterPathSegment(r, l, a);
         try {
-          const u = i[l], p = this.shouldMergePropertyWithoutPreResolve(
+          const u = i[l], h = this.shouldMergePropertyWithoutPreResolve(
             u,
             a,
             r
           ) ? this.mergeWithContext(u, a, r) : (() => {
-            const f = this.materializeForCurrentContext(
+            const g = this.materializeForCurrentContext(
               a,
               r
             );
-            return u === void 0 ? f : this.mergeObject(u, f, r);
+            return u === void 0 ? g : this.mergeObject(u, g, r);
           })();
-          p !== u && (o || (i = { ...n }, o = !0), i[l] = p);
+          h !== u && (o || (i = { ...n }, o = !0), i[l] = h);
         } finally {
           this.exitPathSegment(r);
         }
@@ -3905,7 +4020,7 @@ class Ws extends Js {
    * through mergeWithContext so source type overlays are resolved.
    */
   shouldMergePropertyWithoutPreResolve(e, t, r) {
-    return m(e) || r.limits instanceof we ? !1 : d(t.getItems()) || d(e.getItems());
+    return m(e) || r.limits instanceof Se ? !1 : d(t.getItems()) || d(e.getItems());
   }
   /**
    * Resolves a node by creating a new node and merging the source into it
@@ -3918,7 +4033,7 @@ class Ws extends Js {
   }
   resolveWithContext(e, t) {
     const r = new c(), i = this.mergeWithContext(r, e, t).clone().setName(e.getName()).setDescription(e.getDescription()).setBlueId(e.getBlueId());
-    return new ne(i);
+    return new oe(i);
   }
   createResolutionContext(e) {
     return {
@@ -3942,19 +4057,19 @@ class Ws extends Js {
   }
   resolveAndExtendTypeNode(e, t) {
     const r = e.clone();
-    return d(r.getBlueId()) && new ft(t.nodeProvider).extend(
+    return d(r.getBlueId()) && new Tt(t.nodeProvider).extend(
       r,
-      Le.withSinglePath("/")
+      Ke.withSinglePath("/")
     ), this.resolveWithContext(r, t);
   }
   createResolvedTypeCacheKey(e, t) {
-    return t.limits instanceof we ? e : `${e}|${this.getCurrentPointer(t)}`;
+    return t.limits instanceof Se ? e : `${e}|${this.getCurrentPointer(t)}`;
   }
   materializeForCurrentContext(e, t) {
     return e.isResolved() && this.canReuseResolvedSubtree(t) ? e.clone() : this.resolveWithContext(e, t);
   }
   canReuseResolvedSubtree(e) {
-    return e.limits instanceof we;
+    return e.limits instanceof Se;
   }
   getCurrentPointer(e) {
     return e.pathStack.length === 0 ? "/" : `/${e.pathStack.join("/")}`;
@@ -3966,7 +4081,7 @@ class Ws extends Js {
     e.pathStack.pop(), e.limits.exitPathSegment();
   }
 }
-class tr {
+class nr {
   mergingProcessors;
   /**
    * Creates a new SequentialMergingProcessor with the given processors
@@ -3991,14 +4106,14 @@ class tr {
     return this.mergingProcessors.reduce((n, i) => i.postProcess ? i.postProcess(n, t, r) : n, e);
   }
 }
-class rr {
+class ir {
   process(e, t) {
     const r = t.getValue();
     if (d(r)) {
       const n = e.getValue();
       if (m(n))
         return e.cloneShallow().setValue(r);
-      if (!Zs(r, n))
+      if (!Xs(r, n))
         throw new Error(
           `Node values conflict. Source node value: ${r}, target node value: ${n}`
         );
@@ -4006,15 +4121,15 @@ class rr {
     return e;
   }
 }
-const Zs = (s, e) => Z(s) && Z(e) || We(s) && We(e) ? s.eq(e) : s === e;
-class sr {
+const Xs = (s, e) => Q(s) && Q(e) || Qe(s) && Qe(e) ? s.eq(e) : s === e;
+class or {
   process(e, t, r) {
     const n = e.getType(), i = t.getType();
     let o = e;
     if (n === void 0)
       o = e.cloneShallow().setType(i);
     else if (i !== void 0) {
-      if (!b(
+      if (!w(
         i,
         n,
         r
@@ -4033,27 +4148,27 @@ class sr {
     return o;
   }
 }
-class nr {
+class lr {
   process(e, t, r) {
     const n = t.getItemType(), i = t.getType();
-    if (n !== void 0 && i !== void 0 && !Jt(i, r))
+    if (n !== void 0 && i !== void 0 && !Ee(i, r))
       throw new Error("Source node with itemType must have a List type");
     const o = e.getItemType();
     let l = e;
     if (o === void 0)
       n !== void 0 && (l = e.cloneShallow().setItemType(n));
     else if (n !== void 0) {
-      if (!b(
+      if (!w(
         n,
         o,
         r
       )) {
-        const p = I.get(n), f = I.get(o);
+        const h = I.get(n), g = I.get(o);
         throw new Error(
           `The source item type '${JSON.stringify(
-            p
+            h
           )}' is not a subtype of the target item type '${JSON.stringify(
-            f
+            g
           )}'.`
         );
       }
@@ -4061,19 +4176,19 @@ class nr {
     }
     const a = l.getItemType(), u = t.getItems();
     if (a !== void 0 && u !== void 0)
-      for (const y of u) {
-        const p = y.getType();
-        if (p !== void 0 && !b(
-          p,
+      for (const f of u) {
+        const h = f.getType();
+        if (h !== void 0 && !w(
+          h,
           a,
           r
         )) {
-          const f = I.get(p), v = I.get(
+          const g = I.get(h), v = I.get(
             a
           );
           throw new Error(
             `Item of type '${JSON.stringify(
-              f
+              g
             )}' is not a subtype of the list's item type '${JSON.stringify(
               v
             )}'.`
@@ -4083,18 +4198,18 @@ class nr {
     return l;
   }
 }
-class ir {
+class ar {
   process(e, t, r) {
     const n = t.getKeyType(), i = t.getValueType(), o = t.getType();
-    if ((n !== void 0 || i !== void 0) && o !== void 0 && !Wt(o, r))
+    if ((n !== void 0 || i !== void 0) && o !== void 0 && !Ne(o, r))
       throw new Error(
         "Source node with keyType or valueType must have a Dictionary type"
       );
     let l = this.processKeyType(e, t, r);
     l = this.processValueType(l, t, r);
-    const a = l.getKeyType(), u = l.getValueType(), y = t.getProperties();
-    return (a !== void 0 || u !== void 0) && y !== void 0 && Object.entries(y).forEach(([p, f]) => {
-      a !== void 0 && this.validateKeyType(p, a, r), u !== void 0 && this.validateValueType(f, u, r);
+    const a = l.getKeyType(), u = l.getValueType(), f = t.getProperties();
+    return (a !== void 0 || u !== void 0) && f !== void 0 && Object.entries(f).forEach(([h, g]) => {
+      a !== void 0 && this.validateKeyType(h, a, r), u !== void 0 && this.validateValueType(g, u, r);
     }), l;
   }
   processKeyType(e, t, r) {
@@ -4103,7 +4218,7 @@ class ir {
       if (i !== void 0)
         return this.validateBasicKeyType(i, r), e.cloneShallow().setKeyType(i);
     } else if (i !== void 0) {
-      if (this.validateBasicKeyType(i, r), !b(
+      if (this.validateBasicKeyType(i, r), !w(
         i,
         n,
         r
@@ -4127,7 +4242,7 @@ class ir {
       if (i !== void 0)
         return e.cloneShallow().setValueType(i);
     } else if (i !== void 0) {
-      if (!b(
+      if (!w(
         i,
         n,
         r
@@ -4146,20 +4261,20 @@ class ir {
     return e;
   }
   validateBasicKeyType(e, t) {
-    if (!ns(e, t))
+    if (!os(e, t))
       throw new Error("Dictionary key type must be a basic type");
   }
   validateKeyType(e, t, r) {
-    if (!is(t, r))
-      if (os(t, r)) {
+    if (!ls(t, r))
+      if (as(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 (ls(t, r)) {
+      } else if (cs(t, r)) {
         const n = Number.parseFloat(e);
         if (Number.isNaN(n))
           throw new Error(`Key '${e}' is not a valid Number.`);
-      } else if (as(t, r)) {
+      } else if (us(t, r)) {
         if (e.toLowerCase() !== "true" && e.toLowerCase() !== "false")
           throw new Error(`Key '${e}' is not a valid Boolean.`);
       } else
@@ -4169,7 +4284,7 @@ class ir {
   }
   validateValueType(e, t, r) {
     const n = e.getType();
-    if (n !== void 0 && !b(n, t, r)) {
+    if (n !== void 0 && !w(n, t, r)) {
       const i = I.get(n), o = I.get(t);
       throw new Error(
         `Value of type '${JSON.stringify(
@@ -4181,16 +4296,16 @@ class ir {
     }
   }
 }
-class or {
+class cr {
   process(e) {
     return e;
   }
   postProcess(e, t, r) {
     const n = e.getType();
-    if (n !== void 0 && cs(n, r)) {
+    if (n !== void 0 && ds(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 = us(
+        const l = ps(
           n,
           r
         ), a = n.getName() || "unknown";
@@ -4202,7 +4317,7 @@ class or {
     return e;
   }
 }
-class lr {
+class ur {
   process(e, t) {
     let r = e;
     const n = t.getName();
@@ -4211,32 +4326,32 @@ class lr {
     return i !== void 0 && i !== r.getDescription() && (r = r.cloneShallow().setDescription(i)), r;
   }
 }
-const ti = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const si = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BasicTypesVerifier: or,
-  DictionaryProcessor: ir,
-  ListProcessor: nr,
-  MetadataPropagator: lr,
-  SequentialMergingProcessor: tr,
-  TypeAssigner: sr,
-  ValuePropagator: rr
+  BasicTypesVerifier: cr,
+  DictionaryProcessor: ar,
+  ListProcessor: lr,
+  MetadataPropagator: ur,
+  SequentialMergingProcessor: nr,
+  TypeAssigner: or,
+  ValuePropagator: ir
 }, Symbol.toStringTag, { value: "Module" }));
-function Hs() {
-  return new tr([
-    new rr(),
-    new sr(),
-    new nr(),
+function qs() {
+  return new nr([
     new ir(),
+    new or(),
     new lr(),
-    new or()
+    new ar(),
+    new ur(),
+    new cr()
   ]);
 }
-class Xs {
+class Qs {
   nodeProvider;
   blueIdToInlineValue = /* @__PURE__ */ new Map();
   constructor(e) {
     const { nodeProvider: t, blueIdsMappingGenerator: r } = e;
-    this.nodeProvider = t, Object.entries(Fe).forEach(([i, o]) => {
+    this.nodeProvider = t, Object.entries(je).forEach(([i, o]) => {
       this.blueIdToInlineValue.set(i, o);
     });
     const n = r.getAllBlueIds();
@@ -4248,7 +4363,7 @@ class Xs {
    * Returns a new BlueNode where all type references are restored to inline values when possible.
    */
   restore(e) {
-    return w.transform(
+    return E.transform(
       e,
       (t) => this.restoreNode(t)
     );
@@ -4297,17 +4412,17 @@ class Xs {
       return this.blueIdToInlineValue.set(e, o), o;
   }
 }
-class qs {
+class en {
   runtimes;
   contents;
   aliases;
   constructor(e) {
     const t = [];
     for (const r of e)
-      t.push(Qs(r));
+      t.push(tn(r));
     this.runtimes = t, this.contents = {}, this.aliases = {};
     for (const r of this.runtimes)
-      dn(this.contents, r.contents, r.name), un(this.aliases, r.aliases, r.name);
+      hn(this.contents, r.contents, r.name), pn(this.aliases, r.aliases, r.name);
   }
   getRuntimes() {
     return this.runtimes;
@@ -4330,7 +4445,7 @@ class qs {
     return e;
   }
   getTypeAlias(e) {
-    const t = this.toCurrentBlueId(e), r = Fe[t];
+    const t = this.toCurrentBlueId(e), r = je[t];
     if (r)
       return r;
     for (const n of this.runtimes) {
@@ -4353,10 +4468,10 @@ class qs {
     }
   }
 }
-function Qs(s) {
-  const e = en(s);
+function tn(s) {
+  const e = rn(s);
   return Object.values(s.packages).forEach((t) => {
-    tn(e, s, t);
+    sn(e, s, t);
   }), {
     name: s.name,
     repositoryVersions: s.repositoryVersions,
@@ -4371,7 +4486,7 @@ function Qs(s) {
     typePackageByCurrentBlueId: e.typePackageByCurrentBlueId
   };
 }
-function en(s) {
+function rn(s) {
   const e = Object.fromEntries(
     s.repositoryVersions.map((r, n) => [r, n])
   ), t = s.repositoryVersions[s.repositoryVersions.length - 1];
@@ -4388,29 +4503,29 @@ function en(s) {
     currentRepoBlueId: t
   };
 }
-function tn(s, e, t) {
+function sn(s, e, t) {
   if (s.packageNames.has(t.name))
     throw new Error(`Duplicate package name detected: ${t.name}`);
-  s.packageNames.add(t.name), rn(s, t), sn(s, e, t), nn(s, t), on(s, t);
+  s.packageNames.add(t.name), nn(s, t), on(s, e, t), ln(s, t), an(s, t);
 }
-function rn(s, e) {
+function nn(s, e) {
   Object.entries(e.aliases).forEach(([t, r]) => {
     if (s.aliases[t] && s.aliases[t] !== r)
       throw new Error(`Conflicting alias mapping for ${t}`);
     s.aliases[t] = r;
   });
 }
-function sn(s, e, t) {
+function on(s, e, t) {
   Object.entries(t.typesMeta).forEach(([r, n]) => {
     if (s.types[r])
       throw new Error(`Duplicate type mapping for BlueId ${r}`);
-    const i = ln(
+    const i = cn(
       n,
       e,
       r,
       t.name
     );
-    if (s.types[r] = i, s.typePackageByCurrentBlueId[r] = t.name, s.typeAliasByCurrentBlueId[r] = `${t.name}/${n.name}`, i.status === ae && !s.toCurrentBlueIdIndex[r] && (s.toCurrentBlueIdIndex[r] = r), i.status === ae)
+    if (s.types[r] = i, s.typePackageByCurrentBlueId[r] = t.name, s.typeAliasByCurrentBlueId[r] = `${t.name}/${n.name}`, i.status === ue && !s.toCurrentBlueIdIndex[r] && (s.toCurrentBlueIdIndex[r] = r), i.status === ue)
       for (const o of i.versions) {
         const l = s.toCurrentBlueIdIndex[o.typeBlueId];
         if (l && l !== r)
@@ -4421,17 +4536,17 @@ function sn(s, e, t) {
       }
   });
 }
-function nn(s, e) {
+function ln(s, e) {
   Object.entries(e.contents).forEach(([t, r]) => {
     s.contents[t] = r;
   });
 }
-function on(s, e) {
+function an(s, e) {
   s.schemas.push(...Object.values(e.schemas));
 }
-function ln(s, e, t, r) {
-  if (s.status === st)
-    return an(s, e, t, r), {
+function cn(s, e, t, r) {
+  if (s.status === at)
+    return un(s, e, t, r), {
       ...s,
       versions: s.versions ? [...s.versions] : s.versions
     };
@@ -4454,7 +4569,7 @@ function ln(s, e, t, r) {
       );
     i.add(o.repositoryVersionIndex);
     for (const l of o.attributesAdded ?? [])
-      cn(
+      dn(
         l,
         e.name,
         t,
@@ -4465,8 +4580,8 @@ function ln(s, e, t, r) {
     versions: n
   };
 }
-function an(s, e, t, r) {
-  if (s.status === st) {
+function un(s, e, t, r) {
+  if (s.status === at) {
     if (s.versions && s.versions.length > 1)
       throw new Error(
         `Dev type ${r}/${s.name} (${t}) must not declare multiple versions`
@@ -4480,9 +4595,9 @@ function an(s, e, t, r) {
     }
   }
 }
-function cn(s, e, t, r) {
+function dn(s, e, t, r) {
   try {
-    vr(s);
+    br(s);
   } catch (n) {
     const i = n instanceof Error ? n.message : "Unknown error";
     throw new Error(
@@ -4490,7 +4605,7 @@ function cn(s, e, t, r) {
     );
   }
 }
-function un(s, e, t) {
+function pn(s, e, t) {
   for (const [r, n] of Object.entries(e)) {
     const i = s[r];
     if (i && i !== n)
@@ -4500,11 +4615,11 @@ function un(s, e, t) {
     s[r] = n;
   }
 }
-function dn(s, e, t) {
+function hn(s, e, t) {
   for (const [r, n] of Object.entries(e)) {
     if (r in s) {
       const i = s[r];
-      if (!pn(i, n))
+      if (!fn(i, n))
         throw new Error(
           `Conflicting content for BlueId '${r}' across repositories (from ${t})`
         );
@@ -4513,69 +4628,69 @@ function dn(s, e, t) {
     s[r] = n;
   }
 }
-function pn(s, e) {
+function fn(s, e) {
   if (s === e) return !0;
   if (s === null || e === null || typeof s != "object" || typeof e != "object") return !1;
-  const t = Ze.canonicalize(s), r = Ze.canonicalize(e);
+  const t = et.canonicalize(s), r = et.canonicalize(e);
   return t !== void 0 && t === r;
 }
-class Oe extends Error {
+class Fe extends Error {
   code;
   details;
   constructor(e, t, r) {
     super(t), this.code = e, this.details = r && r.length > 0 ? r : [], this.name = "BlueError";
   }
 }
-const M = {
+const L = {
   REPO_UNKNOWN_REPO_BLUE_ID: "REPO_UNKNOWN_REPO_BLUE_ID",
   REPO_UNREPRESENTABLE_IN_TARGET_VERSION: "REPO_UNREPRESENTABLE_IN_TARGET_VERSION",
   INVALID_BLUE_CONTEXT_REPOSITORIES: "INVALID_BLUE_CONTEXT_REPOSITORIES",
   INVALID_REPOSITORY_POINTER: "INVALID_REPOSITORY_POINTER"
-}, hn = /* @__PURE__ */ new Set([
+}, yn = /* @__PURE__ */ new Set([
   "__proto__",
   "constructor",
   "prototype"
 ]);
-function wt(s) {
+function Ct(s) {
   const e = s.at(0), t = s.at(-1);
   return !e || !t ? s : e === "'" && t === "'" || e === '"' && t === '"' ? s.slice(1, -1) : s;
 }
-function fn(s, e) {
+function gn(s, e) {
   const t = s.indexOf("=");
   if (t === -1)
-    throw re(e, `Missing '=' in segment '${s.trim()}'`);
+    throw ne(e, `Missing '=' in segment '${s.trim()}'`);
   if (s.indexOf("=", t + 1) !== -1)
-    throw re(e, `Unexpected '=' in segment '${s.trim()}'`);
-  const r = wt(s.slice(0, t).trim()), n = wt(s.slice(t + 1).trim());
+    throw ne(e, `Unexpected '=' in segment '${s.trim()}'`);
+  const r = Ct(s.slice(0, t).trim()), n = Ct(s.slice(t + 1).trim());
   if (!r)
-    throw re(e, "Repository name is empty");
+    throw ne(e, "Repository name is empty");
   if (!n)
-    throw re(e, `Repository BlueId is empty for '${r}'`);
+    throw ne(e, `Repository BlueId is empty for '${r}'`);
   return { name: r, value: n };
 }
-function yn(s) {
+function mn(s) {
   if (s.trim().length === 0)
     return /* @__PURE__ */ Object.create(null);
   const e = /* @__PURE__ */ Object.create(null);
   for (const t of s.split(",")) {
     const r = t.trim();
     if (!r)
-      throw re(s, "Empty repository segment");
-    const { name: n, value: i } = fn(r, s);
-    mn(n, s), e[n] = i;
+      throw ne(s, "Empty repository segment");
+    const { name: n, value: i } = gn(r, s);
+    Tn(n, s), e[n] = i;
   }
   return e;
 }
-function gn(s) {
-  return typeof s == "string" ? yn(s) : s;
+function In(s) {
+  return typeof s == "string" ? mn(s) : s;
 }
-function re(s, e) {
-  return new Oe(
-    M.INVALID_BLUE_CONTEXT_REPOSITORIES,
+function ne(s, e) {
+  return new Fe(
+    L.INVALID_BLUE_CONTEXT_REPOSITORIES,
     `Invalid BlueContext repositories value: ${e}`,
     [
       {
-        code: M.INVALID_BLUE_CONTEXT_REPOSITORIES,
+        code: L.INVALID_BLUE_CONTEXT_REPOSITORIES,
         message: e,
         locationPath: [],
         context: {
@@ -4586,31 +4701,31 @@ function re(s, e) {
     ]
   );
 }
-function mn(s, e) {
-  if (hn.has(s))
-    throw re(e, `Forbidden repository name '${s}'`);
+function Tn(s, e) {
+  if (yn.has(s))
+    throw ne(e, `Forbidden repository name '${s}'`);
 }
-function In(s, e) {
+function vn(s, e) {
   const t = s.filter((n) => n.repositoryVersionIndex > e).sort((n, i) => i.repositoryVersionIndex - n.repositoryVersionIndex), r = [];
   for (const n of t) {
     const i = [...n.attributesAdded].sort(
-      (o, l) => Et(l) - Et(o)
+      (o, l) => At(l) - At(o)
     );
     r.push(...i);
   }
   return r;
 }
-function Et(s) {
-  return Ot(s).length;
+function At(s) {
+  return $t(s).length;
 }
-const Tn = /* @__PURE__ */ new Set([...nt]), B = {
+const Bn = /* @__PURE__ */ new Set([...ct]), P = {
   core: "core",
   noRuntime: "no-runtime",
   noTargetContext: "no-target-context",
   representable: "representable",
   unrepresentable: "unrepresentable"
 };
-class vn {
+class bn {
   registry;
   targetRepoVersionIndexes;
   fallbackToCurrentInlineDefinitions;
@@ -4619,7 +4734,7 @@ class vn {
     this.registry = e.registry, this.targetRepoVersionIndexes = e.targetRepoVersionIndexes, this.fallbackToCurrentInlineDefinitions = e.fallbackToCurrentInlineDefinitions;
   }
   transform(e) {
-    return w.transform(
+    return E.transform(
       e,
       (t) => this.transformNode(t)
     );
@@ -4649,11 +4764,11 @@ class vn {
       return;
     const i = this.resolveType(n);
     switch (i.kind) {
-      case B.core: {
+      case P.core: {
         r.setBlueId(i.blueId);
         return;
       }
-      case B.representable: {
+      case P.representable: {
         this.applyDropPointers([r], i.dropPointers, {
           rootIsSchema: !0
         }), this.applyDropPointers(
@@ -4662,34 +4777,34 @@ class vn {
         ), r.setBlueId(i.targetBlueId);
         return;
       }
-      case B.noRuntime:
-      case B.noTargetContext:
-      case B.unrepresentable: {
+      case P.noRuntime:
+      case P.noTargetContext:
+      case P.unrepresentable: {
         if (this.fallbackToCurrentInlineDefinitions) {
           this.inlineDefinition(e, t.setter, n);
           return;
         }
-        throw i.kind === B.unrepresentable ? i.error : this.unrepresentableError(
+        throw i.kind === P.unrepresentable ? i.error : this.unrepresentableError(
           n,
-          i.kind === B.noTargetContext ? `Repository '${i.runtimeName}' not provided in BlueContext.` : "Type does not belong to any declared repository.",
-          i.kind === B.noTargetContext ? i.runtime : void 0,
-          i.kind === B.noTargetContext ? i.meta : void 0,
+          i.kind === P.noTargetContext ? `Repository '${i.runtimeName}' not provided in BlueContext.` : "Type does not belong to any declared repository.",
+          i.kind === P.noTargetContext ? i.runtime : void 0,
+          i.kind === P.noTargetContext ? i.meta : void 0,
           void 0,
-          i.kind === B.noTargetContext ? i.typeAlias : void 0
+          i.kind === P.noTargetContext ? i.typeAlias : void 0
         );
       }
     }
   }
   resolveType(e) {
-    if (X.includes(e))
-      return { kind: B.core, blueId: e };
+    if (te.includes(e))
+      return { kind: P.core, blueId: e };
     const t = this.registry.toCurrentBlueId(e), r = this.registry.getTypeAlias(t), n = this.registry.findRuntimeByBlueId(t);
     if (!n || !n.typeMeta)
-      return { kind: B.noRuntime };
+      return { kind: P.noRuntime };
     const i = this.targetRepoVersionIndexes[n.runtime.name];
     if (i === void 0)
       return {
-        kind: B.noTargetContext,
+        kind: P.noTargetContext,
         currentBlueId: t,
         runtimeName: n.runtime.name,
         runtime: n.runtime,
@@ -4697,11 +4812,11 @@ class vn {
         typeAlias: r
       };
     const o = n.typeMeta;
-    if (o.status === st) {
-      const p = n.runtime.repositoryVersions.length - 1;
-      if (i !== p)
+    if (o.status === at) {
+      const h = n.runtime.repositoryVersions.length - 1;
+      if (i !== h)
         return {
-          kind: B.unrepresentable,
+          kind: P.unrepresentable,
           currentBlueId: t,
           error: this.unrepresentableError(
             t,
@@ -4712,18 +4827,18 @@ class vn {
             r
           )
         };
-      const f = o.versions?.[0];
+      const g = o.versions?.[0];
       return {
-        kind: B.representable,
+        kind: P.representable,
         currentBlueId: t,
-        targetBlueId: f?.typeBlueId ?? t,
+        targetBlueId: g?.typeBlueId ?? t,
         dropPointers: []
       };
     }
     const l = o.versions || [];
     if (l.length === 0)
       return {
-        kind: B.unrepresentable,
+        kind: P.unrepresentable,
         currentBlueId: t,
         error: this.unrepresentableError(
           t,
@@ -4737,7 +4852,7 @@ class vn {
     const a = l[0].repositoryVersionIndex;
     if (i < a)
       return {
-        kind: B.unrepresentable,
+        kind: P.unrepresentable,
         currentBlueId: t,
         error: this.unrepresentableError(
           t,
@@ -4749,18 +4864,18 @@ class vn {
         )
       };
     let u = l[0].typeBlueId;
-    for (const p of l)
-      p.repositoryVersionIndex <= i && (u = p.typeBlueId);
-    const y = o.status === ae ? this.getDropPointers(o, i) : [];
+    for (const h of l)
+      h.repositoryVersionIndex <= i && (u = h.typeBlueId);
+    const f = o.status === ue ? this.getDropPointers(o, i) : [];
     return {
-      kind: B.representable,
+      kind: P.representable,
       currentBlueId: t,
       targetBlueId: u,
-      dropPointers: y
+      dropPointers: f
     };
   }
   getDropPointers(e, t) {
-    return e.status !== ae ? [] : In(e.versions, t);
+    return e.status !== ue ? [] : vn(e.versions, t);
   }
   applyDropPointers(e, t, r = {}) {
     if (e.length === 0 || t.length === 0)
@@ -4773,13 +4888,13 @@ class vn {
   getDictionaryValueTargets(e) {
     const t = e.getProperties();
     return t ? Object.entries(t).filter(
-      ([r, n]) => n instanceof c && !Tn.has(r)
+      ([r, n]) => n instanceof c && !Bn.has(r)
     ).map(([, r]) => r) : [];
   }
   deletePropertyAtPointer(e, t, r) {
     let n;
     try {
-      n = Ot(t);
+      n = $t(t);
     } catch {
       throw this.invalidPointerError(t);
     }
@@ -4789,22 +4904,22 @@ class vn {
     if (t.length === 0)
       return;
     const [n, ...i] = t;
-    if (n === W) {
+    if (n === q) {
       const a = e.getType();
       a && this.applyPointerSegments(a, i, !0);
       return;
     }
-    if (n === fe) {
+    if (n === ge) {
       const a = e.getItemType();
       a && this.applyPointerSegments(a, i, !0);
       return;
     }
-    if (n === ye) {
+    if (n === me) {
       const a = e.getKeyType();
       a && this.applyPointerSegments(a, i, !0);
       return;
     }
-    if (n === ge) {
+    if (n === Ie) {
       const a = e.getValueType();
       a && this.applyPointerSegments(a, i, !0);
       return;
@@ -4844,9 +4959,9 @@ class vn {
       );
     this.inliningStack.add(n);
     try {
-      const o = g.deserialize(i);
+      const o = y.deserialize(i);
       o.setBlueId(void 0);
-      const l = w.transform(
+      const l = E.transform(
         o,
         (a) => this.transformNode(a)
       );
@@ -4857,9 +4972,9 @@ class vn {
   }
   invalidPointerError(e) {
     const t = `Invalid attributesAdded pointer '${e}'.`;
-    return new Oe(M.INVALID_REPOSITORY_POINTER, t, [
+    return new Fe(L.INVALID_REPOSITORY_POINTER, t, [
       {
-        code: M.INVALID_REPOSITORY_POINTER,
+        code: L.INVALID_REPOSITORY_POINTER,
         message: t,
         locationPath: [],
         context: { pointer: e }
@@ -4873,43 +4988,43 @@ class vn {
       typeAlias: o,
       ...l
     };
-    if (r && (i !== void 0 && (a.requestedRepoBlueId = r.repositoryVersions[i]), a.serverRepoBlueId = r.currentRepoBlueId), n && n.status === ae) {
-      const y = n.versions?.[0]?.repositoryVersionIndex;
-      y !== void 0 && (a.typeIntroducedInRepoBlueId = r?.repositoryVersions[y]);
+    if (r && (i !== void 0 && (a.requestedRepoBlueId = r.repositoryVersions[i]), a.serverRepoBlueId = r.currentRepoBlueId), n && n.status === ue) {
+      const f = n.versions?.[0]?.repositoryVersionIndex;
+      f !== void 0 && (a.typeIntroducedInRepoBlueId = r?.repositoryVersions[f]);
     }
     const u = {
-      code: M.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
+      code: L.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
       message: t,
-      locationPath: [W],
+      locationPath: [q],
       context: a
     };
-    return new Oe(
-      M.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
+    return new Fe(
+      L.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
       t,
       [u]
     );
   }
 }
-function Qe(s, e) {
-  return e ? w.transform(s, (t) => (ve(
+function nt(s, e) {
+  return e ? E.transform(s, (t) => (be(
     () => t.getType(),
     (r) => t.setType(r),
     e
-  ), ve(
+  ), be(
     () => t.getItemType(),
     (r) => t.setItemType(r),
     e
-  ), ve(
+  ), be(
     () => t.getKeyType(),
     (r) => t.setKeyType(r),
     e
-  ), ve(
+  ), be(
     () => t.getValueType(),
     (r) => t.setValueType(r),
     e
   ), t)) : s;
 }
-function ve(s, e, t) {
+function be(s, e, t) {
   const r = s();
   if (!r || r.isInlineValue())
     return;
@@ -4919,7 +5034,7 @@ function ve(s, e, t) {
   const i = t.toCurrentBlueId(n);
   i !== n && e(r.clone().setBlueId(i));
 }
-class Bn {
+class wn {
   registry;
   blueIdMapper;
   constructor(e) {
@@ -4929,8 +5044,8 @@ class Bn {
     const r = this.computeTargetRepoVersionIndexes(t);
     if (Object.keys(r).length === 0)
       return e;
-    const n = Qe(e, this.blueIdMapper);
-    return new vn({
+    const n = nt(e, this.blueIdMapper);
+    return new bn({
       registry: this.registry,
       targetRepoVersionIndexes: r,
       fallbackToCurrentInlineDefinitions: t.fallbackToCurrentInlineDefinitions !== !1
@@ -4940,7 +5055,7 @@ class Bn {
     const t = {};
     if (!e?.repositories)
       return t;
-    const r = typeof e.repositories == "string" ? gn(e.repositories) : e.repositories;
+    const r = typeof e.repositories == "string" ? In(e.repositories) : e.repositories;
     for (const [n, i] of Object.entries(r)) {
       const o = this.registry.findRuntimeByName(n);
       if (!o)
@@ -4958,7 +5073,7 @@ class Bn {
   }
   unknownRepoBlueIdError(e, t, r) {
     const n = `Unknown RepoBlueId '${t}' for repository '${e}'.`, i = {
-      code: M.REPO_UNKNOWN_REPO_BLUE_ID,
+      code: L.REPO_UNKNOWN_REPO_BLUE_ID,
       message: n,
       locationPath: [],
       context: {
@@ -4967,18 +5082,18 @@ class Bn {
         serverRepoBlueId: r
       }
     };
-    return new Oe(M.REPO_UNKNOWN_REPO_BLUE_ID, n, [
+    return new Fe(L.REPO_UNKNOWN_REPO_BLUE_ID, n, [
       i
     ]);
   }
 }
-class ri {
+class ni {
   nodeProvider;
   typeSchemaResolver;
   blueDirectivePreprocessor;
   urlContentFetcher;
   blueIdsMappingGenerator;
-  globalLimits = K;
+  globalLimits = _;
   mergingProcessor;
   repositories;
   repositoryRegistry;
@@ -4991,20 +5106,20 @@ class ri {
       repositories: i,
       mergingProcessor: o
     } = e;
-    this.repositories = i, this.repositoryRegistry = new qs(i ?? []), this.blueContextResolver = new Bn({
+    this.repositories = i, this.repositoryRegistry = new en(i ?? []), this.blueContextResolver = new wn({
       registry: this.repositoryRegistry,
       blueIdMapper: this.repositoryRegistry
     });
-    const l = Ns(() => []);
-    this.nodeProvider = he.wrap(
+    const l = Cs(() => []);
+    this.nodeProvider = ye.wrap(
       t || l,
       i
-    ), this.typeSchemaResolver = r ?? new ds([], {
+    ), this.typeSchemaResolver = r ?? new hs([], {
       nodeProvider: this.nodeProvider
-    }), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this.mergingProcessor = o ?? Hs(), this.urlContentFetcher = new Gs(n), this.blueDirectivePreprocessor = new Ys(
+    }), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this.mergingProcessor = o ?? qs(), this.urlContentFetcher = new Ws(n), this.blueDirectivePreprocessor = new Gs(
       void 0,
       this.urlContentFetcher
-    ), this.blueIdsMappingGenerator = new yt(), this.blueIdsMappingGenerator.registerBlueIds(
+    ), this.blueIdsMappingGenerator = new vt(), this.blueIdsMappingGenerator.registerBlueIds(
       this.repositoryRegistry.getAliases()
     );
     const a = this.repositoryRegistry.getRuntimes().flatMap((u) => u.schemas);
@@ -5027,14 +5142,14 @@ class ri {
    */
   nodeToYaml(e, t = "official") {
     const r = this.normalizeNodeToJsonOptions(t), n = r.blueContext ? this.blueContextResolver.transform(e, r.blueContext) : e;
-    return Os.get(n, { strategy: r.format });
+    return Ds.get(n, { strategy: r.format });
   }
   nodeToSchemaOutput(e, t) {
-    return new Ps(this.typeSchemaResolver).convert(e, t);
+    return new Ss(this.typeSchemaResolver).convert(e, t);
   }
-  resolve(e, t = K) {
+  resolve(e, t = _) {
     const r = this.combineWithGlobalLimits(t);
-    return new Ws(this.mergingProcessor, this.nodeProvider).resolve(e, r);
+    return new Hs(this.mergingProcessor, this.nodeProvider).resolve(e, r);
   }
   /**
    * Wraps an already resolved (merged) BlueNode in a ResolvedBlueNode.
@@ -5045,10 +5160,10 @@ class ri {
    * @returns A new ResolvedBlueNode instance.
    */
   createResolvedNode(e) {
-    return e instanceof ne ? e : new ne(e);
+    return e instanceof oe ? e : new oe(e);
   }
   reverse(e) {
-    return new Ht().reverse(e);
+    return new Qt().reverse(e);
   }
   /**
    * Returns a copy of the provided node with any referenced types converted back to their
@@ -5058,33 +5173,33 @@ class ri {
    * repository-backed definitions currently known to this {@link Blue} instance.
    */
   restoreInlineTypes(e) {
-    return new Xs({
+    return new Qs({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).restore(e);
   }
   extend(e, t) {
     const r = this.combineWithGlobalLimits(t);
-    new ft(this.nodeProvider).extend(e, r);
+    new Tt(this.nodeProvider).extend(e, r);
   }
   jsonValueToNode(e) {
-    const t = this.preprocess(g.deserialize(e));
-    return Qe(t, this.repositoryRegistry);
+    const t = this.preprocess(y.deserialize(e));
+    return nt(t, this.repositoryRegistry);
   }
   async jsonValueToNodeAsync(e) {
     const t = await this.preprocessAsync(
-      g.deserialize(e)
+      y.deserialize(e)
     );
-    return Qe(t, this.repositoryRegistry);
+    return nt(t, this.repositoryRegistry);
   }
   yamlToNode(e) {
-    const t = $(e);
+    const t = K(e);
     if (!t)
       throw new Error("Failed to parse YAML to JSON");
     return this.jsonValueToNode(t);
   }
   async yamlToNodeAsync(e) {
-    const t = $(e);
+    const t = K(e);
     if (!t)
       throw new Error("Failed to parse YAML to JSON");
     return this.jsonValueToNodeAsync(t);
@@ -5121,26 +5236,26 @@ class ri {
   }
   preprocess(e) {
     const t = this.blueDirectivePreprocessor.process(e);
-    return new ie({
+    return new le({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).preprocessWithDefaultBlue(t);
   }
   async preprocessAsync(e) {
     const t = await this.blueDirectivePreprocessor.processAsync(e);
-    return new ie({
+    return new le({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).preprocessWithDefaultBlue(t);
   }
   transform(e, t) {
-    return w.transform(e, t);
+    return E.transform(e, t);
   }
   getNodeProvider() {
     return this.nodeProvider;
   }
   setNodeProvider(e) {
-    return this.nodeProvider = he.wrap(
+    return this.nodeProvider = ye.wrap(
       e,
       this.repositories
     ), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this;
@@ -5264,7 +5379,7 @@ class ri {
    * @returns true if the node matches the schema type, false otherwise
    */
   isTypeOf(e, t, r) {
-    return A.isTypeOf(e, t, {
+    return O.isTypeOf(e, t, {
       checkSchemaExtensions: r?.checkSchemaExtensions,
       typeSchemaResolver: this.typeSchemaResolver
     });
@@ -5284,7 +5399,7 @@ class ri {
     if (!n)
       return !1;
     const i = new c().setBlueId(r);
-    return b(n, i, this.nodeProvider);
+    return w(n, i, this.nodeProvider);
   }
   /**
    * Checks if a BlueNode matches a BlueNode type.
@@ -5294,7 +5409,7 @@ class ri {
    * @returns true if the node matches the type, false otherwise.
    */
   isTypeOfNode(e, t) {
-    return new ps(this).matchesType(e, t, this.globalLimits);
+    return new fs(this).matchesType(e, t, this.globalLimits);
   }
   /**
    * Sets the global limits for this Blue instance.
@@ -5304,7 +5419,7 @@ class ri {
    * @returns This instance for chaining
    */
   setGlobalLimits(e) {
-    return this.globalLimits = e ?? K, this;
+    return this.globalLimits = e ?? _, this;
   }
   /**
    * Gets the current global limits for this Blue instance.
@@ -5321,23 +5436,23 @@ class ri {
     };
   }
   combineWithGlobalLimits(e) {
-    return this.globalLimits == K ? e : e == K ? this.globalLimits : je.of(this.globalLimits, e);
+    return this.globalLimits == _ ? e : e == _ ? this.globalLimits : Ye.of(this.globalLimits, e);
   }
 }
-class si extends Qt {
+class ii extends rr {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   preprocessor;
   constructor(e = []) {
     super();
-    const t = new ie({ nodeProvider: this });
+    const t = new le({ nodeProvider: this });
     this.preprocessor = (r) => t.preprocessWithDefaultBlue(r), e.forEach((r) => this.processNode(r));
   }
   processNode(e) {
-    _e.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
+    ke.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
   }
   processSingleNode(e) {
-    const t = z.parseAndCalculateBlueIdForNode(
+    const t = Z.parseAndCalculateBlueIdForNode(
       e,
       this.preprocessor
     );
@@ -5352,7 +5467,7 @@ class si extends Qt {
     const t = e.getItems();
     if (!t) return;
     this.processNodeList(t);
-    const r = z.parseAndCalculateBlueIdForNodeList(
+    const r = Z.parseAndCalculateBlueIdForNodeList(
       t,
       this.preprocessor
     );
@@ -5367,7 +5482,7 @@ class si extends Qt {
   }
   fetchContentByBlueId(e) {
     const t = this.blueIdToContentMap.get(e), r = this.blueIdToMultipleDocumentsMap.get(e);
-    return t !== void 0 && r !== void 0 ? z.resolveThisReferences(
+    return t !== void 0 && r !== void 0 ? Z.resolveThisReferences(
       t,
       e,
       r
@@ -5386,9 +5501,9 @@ class si extends Qt {
    */
   addSingleDocs(...e) {
     e.forEach((t) => {
-      const r = $(t);
+      const r = K(t);
       if (r !== void 0) {
-        const n = g.deserialize(r);
+        const n = y.deserialize(r);
         this.processNode(n);
       }
     });
@@ -5429,9 +5544,9 @@ class si extends Qt {
    * @param doc - The YAML document containing a list
    */
   addListAndItsItemsFromDoc(e) {
-    const t = $(e);
+    const t = K(e);
     if (t !== void 0) {
-      const n = g.deserialize(t).getItems();
+      const n = y.deserialize(t).getItems();
       n && this.addListAndItsItems(n);
     }
   }
@@ -5451,70 +5566,70 @@ class si extends Qt {
   }
 }
 export {
-  xr as Base58Sha256Provider,
-  si as BasicNodeProvider,
-  ri as Blue,
+  $r as Base58Sha256Provider,
+  ii as BasicNodeProvider,
+  ni as Blue,
   T as BlueIdCalculator,
-  kn as BlueIdToCid,
+  Yn as BlueIdToCid,
   c as BlueNode,
-  A as BlueNodeTypeSchema,
-  Ze as JsonCanonicalizer,
-  pt as Limits,
-  Ws as Merger,
-  ti as MergingProcessors,
-  Js as NodeResolver,
-  _e as Nodes,
-  On as Properties,
-  ne as ResolvedBlueNode,
-  ds as TypeSchemaResolver,
-  Kn as applyBlueNodePatch,
-  $e as baseBlueObjectSchema,
-  Yn as blueDescriptionField,
-  zn as blueIdField,
-  Mn as blueIdSchema,
-  Gn as blueNameField,
-  Jn as blueNodeField,
-  Fn as blueObjectBooleanValueSchema,
-  xn as blueObjectNumberValueSchema,
-  de as blueObjectSchema,
-  $n as blueObjectStringListItemsSchema,
-  Dn as blueObjectStringValueSchema,
-  js as calculateBlueId,
-  Zn as calculateBlueIdSync,
-  Bt as enrichWithBlueId,
-  Wr as getBlueDescriptionAnnotation,
-  Xr as getBlueIdAnnotation,
-  Qr as getBlueNameAnnotation,
-  ts as getBlueNodeAnnotation,
-  Hn as getBlueObjectItems,
-  qn as getBlueObjectProperties,
-  Qn as getBlueObjectTypeLabel,
-  Xn as getBlueObjectValue,
-  ss as getTypeBlueIdAnnotation,
-  Pr as hasBlueObjectBlueIdDefined,
-  Nr as hasBlueObjectItemsDefined,
-  Ln as hasBlueObjectNameDefined,
-  Sr as hasBlueObjectTypeDefined,
-  Cr as hasBlueObjectValueDefined,
-  We as isBigDecimalNumber,
-  Z as isBigIntegerNumber,
-  C as isBigNumber,
-  Gt as isBlueNodeSchema,
-  _n as isBlueObject,
-  Us as isBlueObjectResolved,
-  jn as isGivenBlueObjectTypeSchema,
-  jt as isJsonBlueArray,
-  Lt as isJsonBlueObject,
-  Un as isJsonBlueValue,
-  Ee as isUrl,
-  Ae as jsonBlueValueSchema,
-  ei as normalizeToBlueObject,
-  bt as resolveBlueObjectItems,
-  Jr as withBlueDescription,
-  Hr as withBlueId,
-  qr as withBlueName,
-  es as withBlueNode,
-  Wn as withTypeBlueId,
-  Rs as yamlBlueDump,
-  $ as yamlBlueParse
+  O as BlueNodeTypeSchema,
+  et as JsonCanonicalizer,
+  mt as Limits,
+  Hs as Merger,
+  si as MergingProcessors,
+  Zs as NodeResolver,
+  ke as Nodes,
+  Dn as Properties,
+  oe as ResolvedBlueNode,
+  hs as TypeSchemaResolver,
+  zn as applyBlueNodePatch,
+  Ue as baseBlueObjectSchema,
+  Gn as blueDescriptionField,
+  Jn as blueIdField,
+  xn as blueIdSchema,
+  Wn as blueNameField,
+  Zn as blueNodeField,
+  _n as blueObjectBooleanValueSchema,
+  $n as blueObjectNumberValueSchema,
+  he as blueObjectSchema,
+  Ln as blueObjectStringListItemsSchema,
+  Fn as blueObjectStringValueSchema,
+  ks as calculateBlueId,
+  Xn as calculateBlueIdSync,
+  Nt as enrichWithBlueId,
+  Hr as getBlueDescriptionAnnotation,
+  Qr as getBlueIdAnnotation,
+  ts as getBlueNameAnnotation,
+  ss as getBlueNodeAnnotation,
+  qn as getBlueObjectItems,
+  ei as getBlueObjectProperties,
+  ti as getBlueObjectTypeLabel,
+  Qn as getBlueObjectValue,
+  is as getTypeBlueIdAnnotation,
+  Sr as hasBlueObjectBlueIdDefined,
+  Cr as hasBlueObjectItemsDefined,
+  Un as hasBlueObjectNameDefined,
+  Ar as hasBlueObjectTypeDefined,
+  Vr as hasBlueObjectValueDefined,
+  Qe as isBigDecimalNumber,
+  Q as isBigIntegerNumber,
+  R as isBigNumber,
+  Xt as isBlueNodeSchema,
+  jn as isBlueObject,
+  Ks as isBlueObjectResolved,
+  kn as isGivenBlueObjectTypeSchema,
+  zt as isJsonBlueArray,
+  Yt as isJsonBlueObject,
+  Kn as isJsonBlueValue,
+  Ce as isUrl,
+  Me as jsonBlueValueSchema,
+  ri as normalizeToBlueObject,
+  St as resolveBlueObjectItems,
+  Zr as withBlueDescription,
+  qr as withBlueId,
+  es as withBlueName,
+  rs as withBlueNode,
+  Hn as withTypeBlueId,
+  Ms as yamlBlueDump,
+  K as yamlBlueParse
 };