@blue-labs/language 2.0.0 → 3.0.0

package/dist/index.mjs

@@ -1,23 +1,88 @@
 import M from "big.js";
-import { isNullable as I, isNonNullable as d, jsonPrimitiveSchema as _t, isReadonlyArray as he, isJsonPrimitive as $e, isPreciseNumberString as nt } from "@blue-labs/shared-utils";
-import { z as h, ZodOptional as it, ZodNullable as ot, ZodReadonly as lt, ZodBranded as ct, ZodEffects as fe, ZodLazy as ge, ZodString as J, ZodNumber as Z, ZodBoolean as ue, ZodBigInt as de, ZodEnum as Kt, ZodNativeEnum as Yt, ZodIntersection as Gt, ZodUnion as zt, ZodObject as kt, ZodRecord as Jt } from "zod";
-import re from "bs58";
-import { isObject as at, isArray as xe, isString as je, omit as ut, pascal as Zt, map as Ht } from "radash";
-import { sha256 as Wt } from "js-sha256";
-import Pe from "crypto";
-import qt from "base32.js";
-import U from "js-yaml";
-class P extends M {
+import { isNullable as I, isNonNullable as p, jsonPrimitiveSchema as cr, isReadonlyArray as Ee, isJsonPrimitive as qe, isPreciseNumberString as Et } from "@blue-labs/shared-utils";
+import { z as f, ZodOptional as Nt, ZodNullable as Pt, ZodReadonly as St, ZodBranded as At, ZodEffects as Ne, ZodLazy as Pe, ZodString as ee, ZodNumber as te, ZodBoolean as Be, ZodBigInt as be, ZodEnum as ar, ZodNativeEnum as ur, ZodIntersection as dr, ZodUnion as pr, ZodObject as fr, ZodRecord as hr } from "zod";
+import ae from "bs58";
+import { isObject as Vt, isArray as Qe, isString as et, omit as Ct, pascal as yr, map as gr } from "radash";
+import { OBJECT_CONTRACTS as C, OBJECT_MERGE_POLICY as mr, OBJECT_SCHEMA as Ir, BLUE_REPOSITORY_STATUS_STABLE as le, BLUE_REPOSITORY_STATUS_DEV as tt, validateAttributesAddedPointer as Tr, parsePointer as Rt } from "@blue-labs/repository-contract";
+import { sha256 as vr } from "js-sha256";
+import Le from "crypto";
+import Br from "base32.js";
+import W from "js-yaml";
+class S extends M {
   constructor(e) {
     super(e);
   }
 }
-class w extends M {
+class E extends M {
   constructor(e) {
     super(e);
   }
 }
-class Xt {
+const G = "name", J = "description", Z = "type", he = "itemType", ye = "keyType", ge = "valueType", me = "value", Oe = "items", x = "blueId", De = "blue", rt = [
+  G,
+  J,
+  Z,
+  he,
+  ye,
+  ge,
+  me,
+  Oe,
+  x,
+  De
+], Ot = "Text", Dt = "Double", Mt = "Integer", xt = "Boolean", Ft = "List", $t = "Dictionary", Me = [
+  Ot,
+  Dt,
+  Mt,
+  xt
+], st = [...Me, Ft, $t], _ = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", L = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", j = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", U = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", nt = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", it = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", ot = [
+  _,
+  L,
+  j,
+  U
+], X = [
+  ...ot,
+  nt,
+  it
+], br = Object.fromEntries(
+  st.map((s, e) => [s, X[e]])
+), xe = Object.fromEntries(
+  X.map((s, e) => [s, st[e]])
+), On = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  BASIC_TYPES: Me,
+  BASIC_TYPE_BLUE_IDS: ot,
+  BOOLEAN_TYPE: xt,
+  BOOLEAN_TYPE_BLUE_ID: U,
+  CORE_TYPES: st,
+  CORE_TYPE_BLUE_IDS: X,
+  CORE_TYPE_BLUE_ID_TO_NAME_MAP: xe,
+  CORE_TYPE_NAME_TO_BLUE_ID_MAP: br,
+  DICTIONARY_TYPE: $t,
+  DICTIONARY_TYPE_BLUE_ID: it,
+  DOUBLE_TYPE: Dt,
+  DOUBLE_TYPE_BLUE_ID: L,
+  INTEGER_TYPE: Mt,
+  INTEGER_TYPE_BLUE_ID: j,
+  LIST_TYPE: Ft,
+  LIST_TYPE_BLUE_ID: nt,
+  OBJECT_BLUE: De,
+  OBJECT_BLUE_ID: x,
+  OBJECT_CONTRACTS: C,
+  OBJECT_DESCRIPTION: J,
+  OBJECT_ITEMS: Oe,
+  OBJECT_ITEM_TYPE: he,
+  OBJECT_KEY_TYPE: ye,
+  OBJECT_MERGE_POLICY: mr,
+  OBJECT_NAME: G,
+  OBJECT_SCHEMA: Ir,
+  OBJECT_SPECIFIC_KEYS: rt,
+  OBJECT_TYPE: Z,
+  OBJECT_VALUE: me,
+  OBJECT_VALUE_TYPE: ge,
+  TEXT_TYPE: Ot,
+  TEXT_TYPE_BLUE_ID: _
+}, Symbol.toStringTag, { value: "Module" }));
+class wr {
   static get(e, t, r, n = !0) {
     if (I(t) || !t.startsWith("/"))
       throw new Error(`Invalid path: ${t}`);
@@ -113,7 +178,7 @@ class Xt {
           i = new a().setProperties(l);
           break;
         }
-        case "contracts": {
+        case C: {
           const l = e.getContracts();
           i = new a().setContracts(l);
           break;
@@ -132,41 +197,9 @@ class Xt {
   }
   static link(e, t) {
     const r = t(e);
-    return d(r) ? r : e;
+    return p(r) ? r : e;
   }
 }
-const H = "name", W = "description", ye = "type", Le = "itemType", Ue = "keyType", _e = "valueType", be = "value", Ke = "items", j = "blueId", Ye = "blue", Qt = [
-  H,
-  W,
-  ye,
-  Le,
-  Ue,
-  _e,
-  be,
-  Ke,
-  j,
-  Ye
-], er = "Text", tr = "Double", rr = "Integer", sr = "Boolean", nr = "List", ir = "Dictionary", Ge = [
-  er,
-  tr,
-  rr,
-  sr
-], dt = [...Ge, nr, ir], _ = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", K = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", Y = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", G = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", pt = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", ht = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", ft = [
-  _,
-  K,
-  Y,
-  G
-], le = [
-  ...ft,
-  pt,
-  ht
-];
-Object.fromEntries(
-  dt.map((s, e) => [s, le[e]])
-);
-const gt = Object.fromEntries(
-  le.map((s, e) => [s, dt[e]])
-);
 class a {
   static INTEGER = new a("Integer");
   name;
@@ -222,19 +255,19 @@ class a {
   }
   getValue() {
     const e = this.type?.getBlueId();
-    if (d(e) && d(this.value)) {
-      if (e === Y && typeof this.value == "string")
-        return new w(this.value);
-      if (e === K && typeof this.value == "string") {
-        const t = new P(this.value), r = parseFloat(t.toString());
-        return new P(r.toString());
-      } else if (e === G && typeof this.value == "string")
+    if (p(e) && p(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")
         return this.value.toLowerCase() === "true";
     }
     return this.value;
   }
   setValue(e) {
-    return typeof e == "number" ? e % 1 === 0 ? this.value = new w(e.toString()) : this.value = new P(e.toString()) : this.value = e, this;
+    return typeof e == "number" ? e % 1 === 0 ? this.value = new E(e.toString()) : this.value = new S(e.toString()) : this.value = e, this;
   }
   getItems() {
     return this.items;
@@ -258,24 +291,30 @@ class a {
     return this.properties && delete this.properties[e], this;
   }
   getContractsProperty() {
-    return this.properties?.contracts;
+    return this.properties?.[C];
   }
   getContracts() {
     return this.getContractsProperty()?.getProperties();
   }
   setContracts(e) {
-    return I(e) ? this.removeProperty("contracts") : this.addProperty("contracts", new a().setProperties(e)), this;
+    return I(e) ? this.removeProperty(C) : this.addProperty(
+      C,
+      new a().setProperties(e)
+    ), this;
   }
   addContract(e, t) {
     const r = this.getContractsProperty();
-    return I(r) ? this.addProperty("contracts", new a().addProperty(e, t)) : r.addProperty(e, t), this;
+    return I(r) ? this.addProperty(
+      C,
+      new a().addProperty(e, t)
+    ) : r.addProperty(e, t), this;
   }
   removeContract(e) {
     const t = this.getContractsProperty();
     if (t) {
       t.removeProperty(e);
       const r = t.getProperties();
-      r && Object.keys(r).length === 0 && this.removeProperty("contracts");
+      r && Object.keys(r).length === 0 && this.removeProperty(C);
     }
     return this;
   }
@@ -305,7 +344,7 @@ class a {
     return !1;
   }
   get(e, t) {
-    return Xt.get(this, e, t);
+    return wr.get(this, e, t);
   }
   getAsNode(e) {
     const t = this.get(e);
@@ -315,7 +354,7 @@ class a {
   }
   getAsInteger(e) {
     const t = this.get(e);
-    if (t instanceof w || t instanceof P)
+    if (t instanceof E || t instanceof S)
       return t.toNumber();
     throw new Error(
       `Value at path ${e} is not a BigInteger or BigDecimal: ${t}`
@@ -331,7 +370,7 @@ class a {
     return `BlueNode{name='${this.name}', description='${this.description}', type=${this.type}, itemType=${this.itemType}, keyType=${this.keyType}, valueType=${this.valueType}, value=${this.value}, items=${this.items}, properties=${this.properties}, blueId='${this.blueId}', blue=${this.blue}, inlineValue=${this.inlineValue}}`;
   }
 }
-class me {
+class Se {
   static MIN_BLUE_ID_LENGTH = 41;
   static MAX_BLUE_ID_LENGTH = 45;
   static BLUE_ID_PATTERN = /^[1-9A-HJ-NP-Za-km-z]{41,45}(?:#\d+)?$/;
@@ -342,7 +381,7 @@ class me {
     if (n < this.MIN_BLUE_ID_LENGTH || n > this.MAX_BLUE_ID_LENGTH)
       return !1;
     try {
-      if (re.decode(r).length !== 32)
+      if (ae.decode(r).length !== 32)
         return !1;
     } catch {
       return !1;
@@ -357,14 +396,14 @@ class me {
     return !0;
   }
 }
-const Ys = h.string().max(me.MAX_BLUE_ID_LENGTH, {
+const Dn = f.string().max(Se.MAX_BLUE_ID_LENGTH, {
   message: "Blue Id has a maximum length of 45 characters"
-}).min(me.MIN_BLUE_ID_LENGTH, {
+}).min(Se.MIN_BLUE_ID_LENGTH, {
   message: "Blue Id has a minimum length of 41 characters"
 }).refine(
   (s) => {
     try {
-      return re.decode(s), !0;
+      return ae.decode(s), !0;
     } catch {
       return !1;
     }
@@ -372,45 +411,45 @@ const Ys = h.string().max(me.MAX_BLUE_ID_LENGTH, {
   {
     message: "Blue Id must be a valid Base58 string"
   }
-), se = h.lazy(
-  () => h.record(h.unknown()).and(
-    h.object({
-      blueId: h.string().optional(),
-      name: h.string().optional(),
-      description: h.string().optional(),
-      type: se.optional(),
-      value: h.union([h.string(), h.number(), h.boolean()]).optional().nullable(),
-      items: h.array(se).optional()
+), ue = f.lazy(
+  () => f.record(f.unknown()).and(
+    f.object({
+      blueId: f.string().optional(),
+      name: f.string().optional(),
+      description: f.string().optional(),
+      type: ue.optional(),
+      value: f.union([f.string(), f.number(), f.boolean()]).optional().nullable(),
+      items: f.array(ue).optional()
     })
   )
-), we = h.object({
-  blueId: h.string().optional(),
-  name: h.string().optional(),
-  description: h.string().optional(),
-  type: se.optional()
-}), Gs = we.extend({
-  value: h.string().optional()
-}), zs = we.extend({
-  value: h.number().optional()
-}), ks = we.extend({
-  value: h.boolean().optional()
-}), Js = we.extend({
-  items: h.array(h.string()).optional()
-}), Zs = (s) => se.safeParse(s).success, or = (s) => d(s) && "blueId" in s && d(s.blueId), Hs = (s) => d(s) && "name" in s && d(s.name), lr = (s) => d(s) && "items" in s && d(s.items), cr = (s) => d(s) && "type" in s && d(s.type), ar = (s) => d(s) && "value" in s && d(s.value), Ws = (s, e) => s.required({ type: !0 }).safeParse(e).success, S = (s) => s instanceof M, L = (s) => S(s) && s instanceof w, De = (s) => S(s) && s instanceof P, ur = h.lazy(
-  () => h.record(Ie)
-), dr = h.lazy(
-  () => h.union([
-    h.array(Ie),
-    h.array(Ie).readonly()
+), Fe = f.object({
+  blueId: f.string().optional(),
+  name: f.string().optional(),
+  description: f.string().optional(),
+  type: ue.optional()
+}), Mn = Fe.extend({
+  value: f.string().optional()
+}), xn = Fe.extend({
+  value: f.number().optional()
+}), Fn = Fe.extend({
+  value: f.boolean().optional()
+}), $n = Fe.extend({
+  items: f.array(f.string()).optional()
+}), _n = (s) => ue.safeParse(s).success, Er = (s) => p(s) && "blueId" in s && p(s.blueId), Ln = (s) => p(s) && "name" in s && p(s.name), Nr = (s) => p(s) && "items" in s && p(s.items), Pr = (s) => p(s) && "type" in s && p(s.type), Sr = (s) => p(s) && "value" in s && p(s.value), jn = (s, e) => s.required({ type: !0 }).safeParse(e).success, A = (s) => s instanceof M, H = (s) => A(s) && s instanceof E, Ge = (s) => A(s) && s instanceof S, Ar = f.lazy(
+  () => f.record(Ae)
+), Vr = f.lazy(
+  () => f.union([
+    f.array(Ae),
+    f.array(Ae).readonly()
   ])
-), Ie = h.lazy(
-  () => h.union([
-    _t,
-    ur,
-    dr,
-    h.instanceof(M)
+), Ae = f.lazy(
+  () => f.union([
+    cr,
+    Ar,
+    Vr,
+    f.instanceof(M)
   ])
-), yt = (s) => at(s) && !xe(s) && !he(s) && !S(s), mt = (s) => xe(s) || he(s), qs = (s) => mt(s) || yt(s) || S(s) || $e(s);
+), _t = (s) => Vt(s) && !Qe(s) && !Ee(s) && !A(s), Lt = (s) => Qe(s) || Ee(s), Un = (s) => Lt(s) || _t(s) || A(s) || qe(s);
 class g {
   static deserialize(e) {
     return g.handleNode(e);
@@ -420,54 +459,54 @@ class g {
       throw new Error(
         "This is not a valid JSON-like value. Found 'undefined' as a value."
       );
-    if (yt(e)) {
+    if (_t(e)) {
       const t = new a(), r = {};
       return Object.entries(e).forEach(([n, i]) => {
         switch (n) {
-          case H:
+          case G:
             if (i == null)
               t.setName(void 0);
             else {
               if (typeof i != "string")
-                throw new Error(`The ${H} field must be a string.`);
+                throw new Error(`The ${G} field must be a string.`);
               t.setName(i);
             }
             break;
-          case W:
+          case J:
             if (i == null)
               t.setDescription(void 0);
             else {
               if (typeof i != "string")
                 throw new Error(
-                  `The ${W} field must be a string.`
+                  `The ${J} field must be a string.`
                 );
               t.setDescription(i);
             }
             break;
-          case ye:
+          case Z:
             t.setType(g.handleNode(i));
             break;
-          case Le:
+          case he:
             t.setItemType(g.handleNode(i));
             break;
-          case Ue:
+          case ye:
             t.setKeyType(g.handleNode(i));
             break;
-          case _e:
+          case ge:
             t.setValueType(g.handleNode(i));
             break;
-          case be:
+          case me:
             t.setValue(g.handleValue(i));
             break;
-          case j:
+          case x:
             if (typeof i != "string")
-              throw new Error(`The ${j} field must be a string.`);
+              throw new Error(`The ${x} field must be a string.`);
             t.setBlueId(i);
             break;
-          case Ke:
+          case Oe:
             t.setItems(g.handleArray(i));
             break;
-          case Ye:
+          case De:
             t.setBlue(g.handleNode(i));
             break;
           default:
@@ -476,7 +515,7 @@ class g {
         }
       }), Object.keys(r).length > 0 && t.setProperties(r), t;
     } else {
-      if (mt(e))
+      if (Lt(e))
         return new a().setItems(g.handleArray(e));
       {
         const t = e;
@@ -489,13 +528,13 @@ class g {
       return null;
     if (typeof e == "string")
       return e;
-    if (typeof e == "number" || S(e))
-      if (L(e) || Number.isSafeInteger(e)) {
-        const t = new w(e.toString()), r = Number.MIN_SAFE_INTEGER, n = Number.MAX_SAFE_INTEGER;
-        return t.lt(r) ? new w(r.toString()) : t.gt(n) ? new w(n.toString()) : t;
+    if (typeof e == "number" || A(e))
+      if (H(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;
       } else {
         const t = parseFloat(e.toString());
-        return new P(t.toString());
+        return new S(t.toString());
       }
     else if (typeof e == "boolean")
       return e;
@@ -503,7 +542,7 @@ class g {
   }
   static handleArray(e) {
     if (e != null) {
-      if (at(e) && !Array.isArray(e))
+      if (Vt(e) && !Array.isArray(e))
         return [g.handleNode(e)];
       if (Array.isArray(e))
         return e.map(g.handleNode);
@@ -511,12 +550,12 @@ class g {
     }
   }
 }
-function pr(s) {
+function Cr(s) {
   return s && s.__esModule && Object.prototype.hasOwnProperty.call(s, "default") ? s.default : s;
 }
-var Ee, Xe;
-function hr() {
-  return Xe || (Xe = 1, Ee = function s(e) {
+var je, gt;
+function Rr() {
+  return gt || (gt = 1, je = function s(e) {
     if (typeof e == "number" && isNaN(e))
       throw new Error("NaN is not allowed");
     if (typeof e == "number" && !isFinite(e))
@@ -527,50 +566,50 @@ function hr() {
       const i = r.length === 0 ? "" : ",";
       return `${r}${i}${s(n)}:${s(e[n])}`;
     }, "")}}`;
-  }), Ee;
+  }), je;
 }
-var fr = hr();
-const gr = /* @__PURE__ */ pr(fr);
-class yr {
+var Or = Rr();
+const Dr = /* @__PURE__ */ Cr(Or);
+class Je {
   static canonicalize(e) {
-    return gr(e);
+    return Dr(e);
   }
 }
-const Se = typeof process < "u" && process.versions != null && process.versions.node != null;
-class ze {
+const Ue = typeof process < "u" && process.versions != null && process.versions.node != null;
+class lt {
   static instance;
   browserCrypto;
   constructor() {
     this.browserCrypto = this.initBrowserCrypto();
   }
   static getInstance() {
-    return this.instance || (this.instance = new ze()), this.instance;
+    return this.instance || (this.instance = new lt()), this.instance;
   }
   initBrowserCrypto() {
-    return Se ? null : "crypto" in globalThis ? globalThis.crypto : null;
+    return Ue ? null : "crypto" in globalThis ? globalThis.crypto : null;
   }
   hasNodeCrypto() {
-    return Se && !!Pe && typeof Pe.createHash == "function";
+    return Ue && !!Le && typeof Le.createHash == "function";
   }
   getBrowserCrypto() {
     return this.browserCrypto;
   }
   getNodeCrypto() {
-    return Se ? Pe : null;
+    return Ue ? Le : null;
   }
 }
-class mr {
-  cryptoEnv = ze.getInstance();
+class Mr {
+  cryptoEnv = lt.getInstance();
   applySync(e) {
     const t = this.canonicalizeInput(e), r = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : this.sha256SyncBrowser(t);
-    return re.encode(r);
+    return ae.encode(r);
   }
   async apply(e) {
     const t = this.canonicalizeInput(e), r = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : await this.sha256Async(t);
-    return re.encode(r);
+    return ae.encode(r);
   }
   canonicalizeInput(e) {
-    const t = yr.canonicalize(e);
+    const t = Je.canonicalize(e);
     if (typeof t != "string")
       throw new Error("Canonized value must be a string");
     return t;
@@ -585,7 +624,7 @@ class mr {
     return new Uint8Array(r);
   }
   sha256SyncBrowser(e) {
-    return new Uint8Array(Wt.arrayBuffer(e));
+    return new Uint8Array(vr.arrayBuffer(e));
   }
   async sha256Async(e) {
     if (this.cryptoEnv.hasNodeCrypto())
@@ -612,7 +651,7 @@ class m {
     const r = e.getValue(), n = this.handleValue(r);
     if (n !== void 0 && t === "simple")
       return n;
-    const i = e.getItems()?.map((k) => m.get(k, t));
+    const i = e.getItems()?.map((Q) => m.get(Q, t));
     if (i !== void 0 && t === "simple")
       return i;
     const o = e.getName(), l = e.getDescription();
@@ -623,30 +662,30 @@ class m {
         return i;
     }
     const c = {};
-    o !== void 0 && (c[H] = o), l !== void 0 && (c[W] = l);
+    o !== void 0 && (c[G] = o), l !== void 0 && (c[J] = l);
     const u = e.getType();
     if (t === "official" && r !== void 0 && u === void 0) {
-      const k = this.inferTypeBlueId(r);
-      k !== null && (c[ye] = { [j]: k });
-    } else u !== void 0 && (c[ye] = m.get(u, t));
+      const Q = this.inferTypeBlueId(r);
+      Q !== null && (c[Z] = { [x]: Q });
+    } else u !== void 0 && (c[Z] = m.get(u, t));
     const y = e.getItemType();
-    y !== void 0 && (c[Le] = m.get(y, t));
-    const p = e.getKeyType();
-    p !== void 0 && (c[Ue] = m.get(p, t));
-    const f = e.getValueType();
-    f !== void 0 && (c[_e] = m.get(f, t)), n !== void 0 && (c[be] = n), i !== void 0 && (c[Ke] = i);
+    y !== void 0 && (c[he] = m.get(y, t));
+    const d = e.getKeyType();
+    d !== void 0 && (c[ye] = m.get(d, t));
+    const h = e.getValueType();
+    h !== void 0 && (c[ge] = m.get(h, t)), n !== void 0 && (c[me] = n), i !== void 0 && (c[Oe] = i);
     const v = e.getBlueId();
-    v !== void 0 && (c[j] = v);
-    const O = e.getBlue();
-    O !== void 0 && (c[Ye] = O);
-    const z = e.getProperties();
-    return z !== void 0 && Object.entries(z).forEach(([k, Ut]) => {
-      c[k] = m.get(Ut, t);
+    v !== void 0 && (c[x] = v);
+    const k = e.getBlue();
+    k !== void 0 && (c[De] = k);
+    const q = e.getProperties();
+    return q !== void 0 && Object.entries(q).forEach(([Q, lr]) => {
+      c[Q] = m.get(lr, t);
     }), c;
   }
   static handleValue(e) {
-    if (S(e)) {
-      if (L(e)) {
+    if (A(e)) {
+      if (H(e)) {
         const t = new M(Number.MIN_SAFE_INTEGER.toString()), r = new M(Number.MAX_SAFE_INTEGER.toString());
         if (e.lt(t) || e.gt(r))
           return e.toString();
@@ -656,12 +695,12 @@ class m {
     return e;
   }
   static inferTypeBlueId(e) {
-    return typeof e == "string" ? _ : S(e) ? L(e) ? Y : K : typeof e == "boolean" ? G : null;
+    return typeof e == "string" ? _ : A(e) ? H(e) ? j : L : typeof e == "boolean" ? U : null;
   }
 }
-const Ir = (s) => $e(s) && d(s);
+const xr = (s) => qe(s) && p(s);
 class T {
-  static INSTANCE = new T(new mr());
+  static INSTANCE = new T(new Mr());
   hashProvider;
   constructor(e) {
     this.hashProvider = e;
@@ -696,14 +735,14 @@ class T {
   }
   // Internal method to calculate BlueId recursively
   internalCalculate(e, t) {
-    return Ir(e) || S(e) ? this.applyHash(e.toString(), t) : Array.isArray(e) || he(e) ? this.calculateList(e, t) : this.calculateMap(e, t);
+    return xr(e) || A(e) ? this.applyHash(e.toString(), t) : Array.isArray(e) || Ee(e) ? this.calculateList(e, t) : this.calculateMap(e, t);
   }
   calculateMap(e, t) {
-    if (e[j] !== void 0)
-      return e[j];
+    if (e[x] !== void 0)
+      return e[x];
     const n = Object.keys(e).map((o) => {
       const l = e[o];
-      if ([H, be, W].includes(o))
+      if ([G, me, J].includes(o))
         return t ? [o, l] : Promise.resolve([o, l]);
       {
         const c = this.internalCalculate(l, t);
@@ -746,10 +785,10 @@ class T {
   // Method to clean the input structure by removing null or undefined values
   cleanStructure(e) {
     if (e != null) {
-      if ($e(e) || S(e))
+      if (qe(e) || A(e))
         return e;
-      if (Array.isArray(e) || he(e)) {
-        const t = e.map((r) => this.cleanStructure(r)).filter(d);
+      if (Array.isArray(e) || Ee(e)) {
+        const t = e.map((r) => this.cleanStructure(r)).filter(p);
         return t.length > 0 ? t : void 0;
       } else if (typeof e == "object") {
         const t = {};
@@ -763,15 +802,15 @@ class T {
     }
   }
 }
-class Xs {
+class kn {
   static convert(e) {
-    const t = re.decode(e), r = new Uint8Array(2 + t.length);
+    const t = ae.decode(e), r = new Uint8Array(2 + t.length);
     r[0] = 18, r[1] = 32, r.set(t, 2);
     const n = new Uint8Array(2 + r.length);
-    return n[0] = 1, n[1] = 85, n.set(r, 2), "b" + new qt.Encoder({ type: "rfc4648", lc: !0 }).write(n).finalize().replace(/=/g, "");
+    return n[0] = 1, n[1] = 85, n.set(r, 2), "b" + new Br.Encoder({ type: "rfc4648", lc: !0 }).write(n).finalize().replace(/=/g, "");
   }
 }
-class E {
+class w {
   /**
    * Transforms a node and all its child nodes using the provided transformer function
    * @param node - The node to transform
@@ -780,30 +819,30 @@ class E {
    */
   static transform(e, t) {
     const r = t(e.clone()), n = r.getType();
-    n !== void 0 && r.setType(E.transform(n, t));
+    n !== void 0 && r.setType(w.transform(n, t));
     const i = r.getItemType();
     i !== void 0 && r.setItemType(
-      E.transform(i, t)
+      w.transform(i, t)
     );
     const o = r.getKeyType();
     o !== void 0 && r.setKeyType(
-      E.transform(o, t)
+      w.transform(o, t)
     );
     const l = r.getValueType();
     l !== void 0 && r.setValueType(
-      E.transform(l, t)
+      w.transform(l, t)
     );
     const c = r.getItems();
     if (c !== void 0) {
       const y = c.map(
-        (p) => E.transform(p, t)
+        (d) => w.transform(d, t)
       );
       r.setItems(y);
     }
     const u = r.getProperties();
     if (u !== void 0) {
       const y = Object.keys(u).reduce(
-        (p, f) => (p[f] = E.transform(u[f], t), p),
+        (d, h) => (d[h] = w.transform(u[h], t), d),
         {}
       );
       r.setProperties(y);
@@ -811,14 +850,14 @@ class E {
     return r;
   }
 }
-const D = (s) => !!s && typeof s == "object" && !Array.isArray(s) && !(s instanceof a), C = (s) => s instanceof w || s instanceof P, Tr = (s) => s.replace(/~1/g, "/").replace(/~0/g, "~");
-function Q(s) {
+const F = (s) => !!s && typeof s == "object" && !Array.isArray(s) && !(s instanceof a), O = (s) => s instanceof E || s instanceof S, Fr = (s) => s.replace(/~1/g, "/").replace(/~0/g, "~");
+function ie(s) {
   if (s === "/") return [];
   if (!s.startsWith("/"))
     throw new Error(`Path must start with '/': ${s}`);
-  return s.split("/").slice(1).map(Tr);
+  return s.split("/").slice(1).map(Fr);
 }
-function q(s) {
+function se(s) {
   if (s === "-") return -1;
   const e = typeof s == "number" ? s : parseInt(s, 10);
   if (isNaN(e))
@@ -829,7 +868,7 @@ function q(s) {
     );
   return e;
 }
-function It(s, e, t, r = !0) {
+function jt(s, e, t, r = !0) {
   switch (e) {
     case "name":
       return t ? r ? s.getName() ?? null : s : s.getName();
@@ -853,15 +892,15 @@ function It(s, e, t, r = !0) {
       return s.getItems();
     case "properties":
       return s.getProperties();
-    case "contracts":
+    case C:
       return s.getContracts();
     default:
       return;
   }
 }
-function Qe(s, e, t = !0) {
+function mt(s, e, t = !0) {
   if (s instanceof a) {
-    const r = It(
+    const r = jt(
       s,
       e,
       !0,
@@ -879,7 +918,7 @@ function Qe(s, e, t = !0) {
       "blue",
       "items",
       "properties",
-      "contracts"
+      C
     ].includes(e))
       return r;
     if (/^-?\d+$/.test(e) && e !== "-") {
@@ -891,12 +930,12 @@ function Qe(s, e, t = !0) {
   }
   if (Array.isArray(s)) {
     if (e === "-") return;
-    const r = q(e);
+    const r = se(e);
     return r >= 0 && r < s.length ? s[r] : void 0;
   }
-  if (D(s)) return s[e];
+  if (F(s)) return s[e];
 }
-function ee(s, e) {
+function oe(s, e) {
   if (e.length === 0)
     return {
       parent: s,
@@ -905,15 +944,15 @@ function ee(s, e) {
     };
   let t = s;
   for (let n = 0; n < e.length - 1; ++n) {
-    const i = e[n], o = Qe(t, i);
+    const i = e[n], o = mt(t, i);
     if (o === void 0)
       throw new Error(`Cannot resolve '/${e.slice(0, n + 1).join("/")}'`);
     t = o;
   }
   const r = e[e.length - 1];
   if (t instanceof a) {
-    const n = Qe(t, r, !1);
-    if ((typeof n != "object" || n === null || C(n)) && !(n instanceof a) && !Array.isArray(n) && ["name", "description", "value", "blueId"].includes(r))
+    const n = mt(t, r, !1);
+    if ((typeof n != "object" || n === null || O(n)) && !(n instanceof a) && !Array.isArray(n) && ["name", "description", "value", "blueId"].includes(r))
       return {
         parent: t,
         key: r,
@@ -922,12 +961,12 @@ function ee(s, e) {
   }
   return Array.isArray(t) && r === "-" ? { parent: t, key: "-" } : t instanceof a && t.getItems() && r === "-" ? { parent: t, key: "-" } : {
     parent: t,
-    key: Array.isArray(t) ? q(r) : r
+    key: Array.isArray(t) ? se(r) : r
   };
 }
-function ke(s, e) {
+function ct(s, e) {
   if (s instanceof a) {
-    const t = e, r = It(s, t, !1);
+    const t = e, r = jt(s, t, !1);
     if (r !== void 0 || [
       "name",
       "description",
@@ -940,7 +979,7 @@ function ke(s, e) {
       "blue",
       "items",
       "properties",
-      "contracts"
+      C
     ].includes(t))
       return r;
     if (typeof e == "number" || typeof e == "string" && /^\d+$/.test(e)) {
@@ -949,25 +988,25 @@ function ke(s, e) {
     }
     return s.getProperties()?.[t];
   }
-  return Array.isArray(s) || D(s) ? s[e] : s;
+  return Array.isArray(s) || F(s) ? s[e] : s;
 }
-function N(s) {
+function P(s) {
   if (s instanceof a) return s;
-  if (s === null || typeof s == "string" || typeof s == "number" || typeof s == "boolean" || C(s))
+  if (s === null || typeof s == "string" || typeof s == "number" || typeof s == "boolean" || O(s))
     return g.deserialize(s);
-  const e = Fe(s);
+  const e = Ze(s);
   return g.deserialize(e);
 }
-function Fe(s) {
+function Ze(s) {
   if (s === void 0) return null;
   if (s === null || typeof s != "object") return s;
-  if (Array.isArray(s)) return s.map(Fe);
+  if (Array.isArray(s)) return s.map(Ze);
   const e = {};
   for (const [t, r] of Object.entries(s))
-    e[t] = Fe(r);
+    e[t] = Ze(r);
   return e;
 }
-function Je(s, e, t) {
+function at(s, e, t) {
   if (s instanceof a) {
     const r = e;
     switch (r) {
@@ -979,22 +1018,22 @@ function Je(s, e, t) {
         return;
       case "type":
         s.setType(
-          t instanceof a || typeof t == "string" || t === void 0 ? t : N(t)
+          t instanceof a || typeof t == "string" || t === void 0 ? t : P(t)
         );
         return;
       case "itemType":
         s.setItemType(
-          t instanceof a || typeof t == "string" || t === void 0 ? t : N(t)
+          t instanceof a || typeof t == "string" || t === void 0 ? t : P(t)
         );
         return;
       case "keyType":
         s.setKeyType(
-          t instanceof a || typeof t == "string" || t === void 0 ? t : N(t)
+          t instanceof a || typeof t == "string" || t === void 0 ? t : P(t)
         );
         return;
       case "valueType":
         s.setValueType(
-          t instanceof a || typeof t == "string" || t === void 0 ? t : N(t)
+          t instanceof a || typeof t == "string" || t === void 0 ? t : P(t)
         );
         return;
       case "value": {
@@ -1007,7 +1046,7 @@ function Je(s, e, t) {
         return;
       case "blue":
         s.setBlue(
-          t instanceof a || t === void 0 ? t : N(t)
+          t instanceof a || t === void 0 ? t : P(t)
         );
         return;
       case "items":
@@ -1016,7 +1055,7 @@ function Je(s, e, t) {
       case "properties":
         s.setProperties(t);
         return;
-      case "contracts":
+      case C:
         s.setContracts(t);
         return;
       default: {
@@ -1024,14 +1063,14 @@ function Je(s, e, t) {
           const n = s.getProperties();
           n && r in n && delete n[r];
         } else
-          s.getProperties() || s.setProperties({}), s.addProperty(r, t instanceof a ? t : N(t));
+          s.getProperties() || s.setProperties({}), s.addProperty(r, t instanceof a ? t : P(t));
         return;
       }
     }
   }
-  Array.isArray(s) ? s.splice(q(e), 1) : D(s) && (t === void 0 ? delete s[e] : s[e] = t);
+  Array.isArray(s) ? s.splice(se(e), 1) : F(s) && (t === void 0 ? delete s[e] : s[e] = t);
 }
-function vr(s, e, t, r) {
+function $r(s, e, t, r) {
   let n = -1;
   if (e !== "-" && (n = typeof e == "number" ? e : parseInt(e, 10), isNaN(n)))
     throw new Error(
@@ -1057,16 +1096,16 @@ function vr(s, e, t, r) {
   } else
     i.splice(n, 0, t);
 }
-function Te(s, e, t, r) {
+function Ve(s, e, t, r) {
   if (Array.isArray(s)) {
-    const n = e === "-" ? s.length : q(e);
+    const n = e === "-" ? s.length : se(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 = P(t);
     if (r) {
       if (n >= 0 && n < s.length) s[n] = i;
       else if (n >= s.length) {
@@ -1079,18 +1118,18 @@ function Te(s, e, t, r) {
     return;
   }
   if (s instanceof a) {
-    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? vr(s, e, N(t), r) : Je(s, e, t);
+    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? $r(s, e, P(t), r) : at(s, e, t);
     return;
   }
-  if (D(s)) {
-    s[e] = N(t);
+  if (F(s)) {
+    s[e] = P(t);
     return;
   }
   throw new Error(`Cannot insert into parent of type ${typeof s}`);
 }
-function br(s, e) {
+function _r(s, e) {
   if (Array.isArray(s)) {
-    const t = q(e);
+    const t = se(e);
     t === -1 && e === "-" ? s.length > 0 && s.pop() : t >= 0 && t < s.length && s.splice(t, 1);
     return;
   }
@@ -1098,127 +1137,127 @@ function br(s, e) {
     if (typeof e == "number" || typeof e == "string" && /^-?\d+$/.test(e)) {
       const t = s.getItems();
       if (t) {
-        const r = q(e);
+        const r = se(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;
       }
     }
-    Je(s, e, void 0);
-  } else D(s) && delete s[e];
+    at(s, e, void 0);
+  } else F(s) && delete s[e];
 }
-function Oe(s) {
+function He(s) {
   if (s instanceof a) return s.clone();
   if (Array.isArray(s))
-    return s.map((t) => Oe(t));
-  if (D(s)) {
+    return s.map((t) => He(t));
+  if (F(s)) {
     const e = {};
     return Object.keys(s).forEach((t) => {
-      e[t] = Oe(s[t]);
+      e[t] = He(s[t]);
     }), e;
   }
   return s;
 }
-function $(s, e) {
-  if (s === e || s instanceof a && (s.isInlineValue() || s.getValue() !== void 0) && $(s.getValue() ?? null, e) || e instanceof a && (e.isInlineValue() || e.getValue() !== void 0) && $(s, e.getValue() ?? null))
+function Y(s, e) {
+  if (s === e || s instanceof a && (s.isInlineValue() || s.getValue() !== void 0) && Y(s.getValue() ?? null, e) || e instanceof a && (e.isInlineValue() || e.getValue() !== void 0) && Y(s, e.getValue() ?? null))
     return !0;
-  if (s instanceof a && e instanceof a || C(s) && C(e) || C(s) && typeof e == "number" || typeof s == "number" && C(e))
+  if (s instanceof a && e instanceof a || O(s) && O(e) || O(s) && typeof e == "number" || typeof s == "number" && O(e))
     return s.toString() === e.toString();
   if (Array.isArray(s) && Array.isArray(e))
-    return s.length === e.length && s.every((t, r) => $(t, e[r]));
-  if (D(s) && D(e)) {
+    return s.length === e.length && s.every((t, r) => Y(t, e[r]));
+  if (F(s) && F(e)) {
     const t = Object.keys(s), r = Object.keys(e);
-    return t.length === r.length && t.every((n) => $(s[n], e[n]));
+    return t.length === r.length && t.every((n) => Y(s[n], e[n]));
   }
   return !1;
 }
-function Tt(s, e) {
-  const { parent: t, key: r } = ee(s, Q(e));
-  return ke(t, r);
+function Ut(s, e) {
+  const { parent: t, key: r } = oe(s, ie(e));
+  return ct(t, r);
 }
-function vt(s, e, t) {
-  const r = Q(e);
+function kt(s, e, t) {
+  const r = ie(e);
   if (r.length === 0 && e === "/") {
-    const o = N(t);
+    const o = P(t);
     s.setValue(o.getValue() ?? null), o.getItems() ? s.setItems(o.getItems()) : s.setItems(void 0);
     return;
   }
-  const { parent: n, key: i } = ee(s, r);
-  Te(n, i, t, !0);
+  const { parent: n, key: i } = oe(s, r);
+  Ve(n, i, t, !0);
 }
-function wr(s, e, t) {
-  const r = Q(e);
+function Lr(s, e, t) {
+  const r = ie(e);
   if (r.length === 0 && e === "/") {
     if (s.getItems() && Array.isArray(t)) {
-      const o = N(t);
+      const o = P(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 = P(t);
       s.setValue(o.getValue() ?? null), o.getItems() && s.setItems(o.getItems());
     }
     return !0;
   }
-  const { parent: n, key: i } = ee(s, r);
-  return Te(n, i, t, !1), !0;
+  const { parent: n, key: i } = oe(s, r);
+  return Ve(n, i, t, !1), !0;
 }
-function Br(s, e, t) {
-  const r = Q(e);
+function jr(s, e, t) {
+  const r = ie(e);
   if (r.length === 0 && e === "/") {
-    const l = N(t);
+    const l = P(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 } = ee(s, r);
+  const { parent: n, key: i, actualTarget: o } = oe(s, r);
   if (o !== void 0 && n instanceof a)
-    Je(n, i, t);
+    at(n, i, t);
   else {
-    const l = ke(n, i), c = Array.isArray(n) || n instanceof a && n.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
+    const l = ct(n, i), c = Array.isArray(n) || n instanceof a && n.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
     if (l === void 0) {
       if (c)
         throw new Error(
           `REPLACE failed: Target array index '${i.toString()}' is out of bounds or does not exist at path '${e}'.`
         );
-      Te(n, i, t, !0);
+      Ve(n, i, t, !0);
     } else
-      Te(n, i, t, !0);
+      Ve(n, i, t, !0);
   }
   return !0;
 }
-function bt(s, e) {
-  const t = Q(e);
+function Kt(s, e) {
+  const t = ie(e);
   if (t.length === 0 && e === "/")
     return s.setValue(null), s.setItems(void 0), s.setProperties(void 0), !0;
-  const { parent: r, key: n } = ee(s, t);
-  return br(r, n), !0;
+  const { parent: r, key: n } = oe(s, t);
+  return _r(r, n), !0;
 }
-function Nr(s, e, t) {
-  const r = Oe(Tt(s, e));
-  return vt(s, t, r), !0;
+function Ur(s, e, t) {
+  const r = He(Ut(s, e));
+  return kt(s, t, r), !0;
 }
-function Pr(s, e, t) {
-  const r = Q(e), { parent: n, key: i } = ee(s, r), o = ke(n, i);
+function kr(s, e, t) {
+  const r = ie(e), { parent: n, key: i } = oe(s, r), o = ct(n, i);
   if (o === void 0)
     throw new Error(`MOVE failed: 'from' location '${e}' does not exist.`);
-  return bt(s, e) ? (vt(s, t, o), !0) : !1;
+  return Kt(s, e) ? (kt(s, t, o), !0) : !1;
 }
-function Er(s, e, t) {
-  const r = Tt(s, e);
+function Kr(s, e, t) {
+  const r = Ut(s, e);
   let n = t;
   if (r instanceof a)
-    if ((t === null || typeof t == "string" || typeof t == "number" || typeof t == "boolean" || C(t)) && (r.isInlineValue() || r.getValue() !== void 0)) {
-      if (!$(r.getValue() ?? null, t))
+    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))
         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 a) && (n = N(t));
-  else if (C(r) && typeof t == "number")
-    r instanceof w ? n = new w(t.toString()) : r instanceof P && (n = new P(t.toString()));
-  else if ((r === null || typeof r == "string" || typeof r == "number" || typeof r == "boolean") && C(t)) {
+    } else typeof t == "object" && !(t instanceof a) && (n = P(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)) {
     const i = t;
-    !$(r, i.toString()) && (typeof r == "number" && parseFloat(i.toString()));
+    !Y(r, i.toString()) && (typeof r == "number" && parseFloat(i.toString()));
   }
-  if (!$(r, n)) {
+  if (!Y(r, n)) {
     const i = r instanceof a ? r.toString() : JSON.stringify(r), o = n instanceof a ? n.toString() : JSON.stringify(n);
     throw new Error(
       `TEST failed at '${e}': Expected ${o}, got ${i}`
@@ -1226,93 +1265,93 @@ function Er(s, e, t) {
   }
   return !0;
 }
-function Sr(s, e) {
+function Yr(s, e) {
   switch (e.op) {
     case "add":
-      return wr(s, e.path, e.val);
+      return Lr(s, e.path, e.val);
     case "replace":
-      return Br(s, e.path, e.val);
+      return jr(s, e.path, e.val);
     case "remove":
-      return bt(s, e.path);
+      return Kt(s, e.path);
     case "copy":
-      return Nr(s, e.from, e.path);
+      return Ur(s, e.from, e.path);
     case "move":
-      return Pr(s, e.from, e.path);
+      return kr(s, e.from, e.path);
     case "test":
-      return Er(s, e.path, e.val);
+      return Kr(s, e.path, e.val);
   }
 }
-function Qs(s, e, t = !1) {
+function Kn(s, e, t = !1) {
   const r = t ? s : s.clone();
-  return Sr(r, e), r;
+  return Yr(r, e), r;
 }
-const Ae = Symbol.for("zod-schema-annotations");
-function Ar() {
+const ke = Symbol.for("zod-schema-annotations");
+function zr() {
   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 wt() {
-  const s = Ar();
-  return Ae in s || (s[Ae] = /* @__PURE__ */ new WeakMap()), s[Ae];
+function Yt() {
+  const s = zr();
+  return ke in s || (s[ke] = /* @__PURE__ */ new WeakMap()), s[ke];
 }
-function ce(s, e) {
-  const t = wt(), r = t.get(s) || {};
+function Ie(s, e) {
+  const t = Yt(), r = t.get(s) || {};
   return t.set(s, { ...r, ...e }), s;
 }
-const V = (s) => wt().get(s), Vr = (s) => (e) => {
-  const t = V(e);
-  return ce(e, {
+const R = (s) => Yt().get(s), Gr = (s) => (e) => {
+  const t = R(e);
+  return Ie(e, {
     ...t,
     blueDescription: s
   });
-}, Cr = (s) => {
-  const e = V(s);
-  return d(e) && je(e.blueDescription) ? e.blueDescription : null;
-}, en = (s) => Vr(s)(h.string().optional()), Mr = h.union([h.string(), h.boolean()]), Dr = (s) => (e) => {
-  const t = V(e);
-  return ce(e, {
+}, Jr = (s) => {
+  const e = R(s);
+  return p(e) && et(e.blueDescription) ? e.blueDescription : null;
+}, Yn = (s) => Gr(s)(f.string().optional()), Zr = f.union([f.string(), f.boolean()]), Hr = (s) => (e) => {
+  const t = R(e);
+  return Ie(e, {
     ...t,
     blueId: s
   });
-}, Fr = (s) => {
-  const e = V(s), t = Mr.safeParse(e?.blueId);
+}, Wr = (s) => {
+  const e = R(s), t = Zr.safeParse(e?.blueId);
   return t.success ? t.data : null;
-}, tn = (s) => Dr(s ?? !0)(h.string()), Or = (s) => (e) => {
-  const t = V(e);
-  return ce(e, {
+}, zn = (s) => Hr(s ?? !0)(f.string()), Xr = (s) => (e) => {
+  const t = R(e);
+  return Ie(e, {
     ...t,
     blueName: s
   });
-}, Rr = (s) => {
-  const e = V(s);
-  return d(e) && je(e.blueName) ? e.blueName : null;
-}, rn = (s) => {
-  const e = h.string().optional();
-  return Or(s)(e);
-}, $r = () => (s) => {
-  const e = V(s);
-  return ce(s, {
+}, qr = (s) => {
+  const e = R(s);
+  return p(e) && et(e.blueName) ? e.blueName : null;
+}, Gn = (s) => {
+  const e = f.string().optional();
+  return Xr(s)(e);
+}, Qr = () => (s) => {
+  const e = R(s);
+  return Ie(s, {
     ...e,
     blueNode: !0
   });
-}, xr = (s) => {
-  const e = V(s);
-  return d(e) && d(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
-}, Bt = (s) => !!xr(s), sn = () => {
-  const s = h.instanceof(a);
-  return $r()(s);
-}, jr = h.object({
-  value: h.array(h.string()).optional(),
-  defaultValue: h.string().optional()
-}), Lr = (s) => {
-  const e = V(s), t = jr.passthrough().safeParse(e?.typeBlueId);
+}, es = (s) => {
+  const e = R(s);
+  return p(e) && p(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
+}, zt = (s) => !!es(s), Jn = () => {
+  const s = f.instanceof(a);
+  return Qr()(s);
+}, ts = f.object({
+  value: f.array(f.string()).optional(),
+  defaultValue: f.string().optional()
+}), rs = (s) => {
+  const e = R(s), t = ts.passthrough().safeParse(e?.typeBlueId);
   return t.success ? t.data : null;
-}, nn = (s) => (e) => {
-  const t = V(e), r = typeof s == "string" ? { value: [s] } : s;
-  return ce(e, {
+}, Zn = (s) => (e) => {
+  const t = R(e), r = typeof s == "string" ? { value: [s] } : s;
+  return Ie(e, {
     ...t,
     typeBlueId: {
       ...t?.typeBlueId || {},
@@ -1320,32 +1359,32 @@ const V = (s) => wt().get(s), Vr = (s) => (e) => {
     }
   });
 };
-class ne {
+class de {
   static resolveBlueId(e) {
-    const t = Lr(e);
+    const t = rs(e);
     if (I(t))
       return null;
     const r = t.defaultValue;
-    if (d(r))
+    if (p(r))
       return r;
     const n = t.value?.[0];
-    return d(n) ? n : ne.getRepositoryBlueId(t, e);
+    return p(n) ? n : de.getRepositoryBlueId(t, e);
   }
   static getRepositoryBlueId(e, t) {
     throw new Error("Not implemented");
   }
 }
-class A {
+class V {
   // TODO: Enhance to support schemas associated with multiple blueIds
   static isTypeOf(e, t, r) {
-    const n = ne.resolveBlueId(t), i = e.getType()?.getBlueId();
+    const n = de.resolveBlueId(t), i = e.getType()?.getBlueId();
     if (I(n) || I(i))
       return !1;
     if (n === i)
       return !0;
-    if (r?.checkSchemaExtensions && d(r.typeSchemaResolver)) {
+    if (r?.checkSchemaExtensions && p(r.typeSchemaResolver)) {
       const o = r.typeSchemaResolver.resolveSchema(e);
-      return A.checkSchemaExtension(o, t, {
+      return V.checkSchemaExtension(o, t, {
         typeSchemaResolver: r.typeSchemaResolver
       });
     }
@@ -1355,31 +1394,31 @@ class A {
    * Checks if a schema extends a base schema.
    */
   static checkSchemaExtension(e, t, r) {
-    if (!d(e))
+    if (!p(e))
       return !1;
-    const n = A.unwrapSchema(e), i = A.unwrapSchema(t);
-    return d(r?.typeSchemaResolver) ? r.typeSchemaResolver.isSchemaExtendedFrom(
+    const n = V.unwrapSchema(e), i = V.unwrapSchema(t);
+    return p(r?.typeSchemaResolver) ? r.typeSchemaResolver.isSchemaExtendedFrom(
       n,
       i
     ) : !1;
   }
   static isWrapperType(e) {
-    return e instanceof it || e instanceof ot || e instanceof lt || e instanceof ct || e instanceof fe || e instanceof ge;
+    return e instanceof Nt || e instanceof Pt || e instanceof St || e instanceof At || e instanceof Ne || e instanceof Pe;
   }
   static unwrapSchema(e) {
-    return Bt(e) ? e : A.isWrapperType(e) ? e instanceof fe ? A.unwrapSchema(e.innerType()) : e instanceof ge ? A.unwrapSchema(e.schema) : A.unwrapSchema(e.unwrap()) : e;
+    return zt(e) ? e : V.isWrapperType(e) ? e instanceof Ne ? V.unwrapSchema(e.innerType()) : e instanceof Pe ? V.unwrapSchema(e.schema) : V.unwrapSchema(e.unwrap()) : e;
   }
 }
-function et(s, e) {
+function It(s, e) {
   const t = s.getType();
   if (t === void 0)
     return;
   const r = t.getBlueId();
   if (r !== void 0) {
-    if (le.includes(
+    if (X.includes(
       r
     )) {
-      const i = gt[r];
+      const i = xe[r];
       return new a().setBlueId(r).setName(i);
     }
     const n = e.fetchByBlueId(r);
@@ -1397,14 +1436,14 @@ function b(s, e, t) {
   const r = T.calculateBlueIdSync(s), n = T.calculateBlueIdSync(e);
   if (r === n)
     return !0;
-  if (r && le.includes(
+  if (r && X.includes(
     r
   )) {
     let c = e;
     for (; c !== void 0; ) {
       if (T.calculateBlueIdSync(c) === r)
         return !0;
-      c = et(c, t);
+      c = It(c, t);
     }
     return !1;
   }
@@ -1418,48 +1457,48 @@ function b(s, e, t) {
   for (; l !== void 0; ) {
     if (T.calculateBlueIdSync(l) === n)
       return !0;
-    l = et(l, t);
+    l = It(l, t);
   }
   return !1;
 }
-function Ur(s, e) {
-  return ft.some((t) => {
+function ss(s, e) {
+  return ot.some((t) => {
     const r = new a().setBlueId(t);
     return b(s, r, e);
   });
 }
-function _r(s, e) {
+function ns(s, e) {
   const t = new a().setBlueId(_);
   return b(s, t, e);
 }
-function Kr(s, e) {
-  const t = new a().setBlueId(Y);
+function is(s, e) {
+  const t = new a().setBlueId(j);
   return b(s, t, e);
 }
-function Yr(s, e) {
-  const t = new a().setBlueId(K);
+function os(s, e) {
+  const t = new a().setBlueId(L);
   return b(s, t, e);
 }
-function Gr(s, e) {
-  const t = new a().setBlueId(G);
+function ls(s, e) {
+  const t = new a().setBlueId(U);
   return b(s, t, e);
 }
-function Nt(s, e) {
-  const t = new a().setBlueId(pt);
+function Gt(s, e) {
+  const t = new a().setBlueId(nt);
   return b(s, t, e);
 }
-function Pt(s, e) {
-  const t = new a().setBlueId(ht);
+function Jt(s, e) {
+  const t = new a().setBlueId(it);
   return b(s, t, e);
 }
-function zr(s, e) {
-  return Ge.some((t) => {
+function cs(s, e) {
+  return Me.some((t) => {
     const r = new a().setName(t);
     return b(s, r, e);
   });
 }
-function kr(s, e) {
-  for (const t of Ge) {
+function as(s, e) {
+  for (const t of Me) {
     const r = new a().setName(t);
     if (b(s, r, e))
       return t;
@@ -1468,7 +1507,7 @@ function kr(s, e) {
     `Cannot determine the basic type for node of type "${s.getName() || "unknown"}".`
   );
 }
-class Jr {
+class us {
   blueIdMap = /* @__PURE__ */ new Map();
   nodeProvider;
   constructor(e = [], t) {
@@ -1479,8 +1518,8 @@ class Jr {
       this.registerSchema(t);
   }
   registerSchema(e) {
-    const t = ne.resolveBlueId(e);
-    if (d(t)) {
+    const t = de.resolveBlueId(e);
+    if (p(t)) {
       if (this.blueIdMap.has(t))
         throw new Error(`Duplicate BlueId value: ${t}`);
       this.blueIdMap.set(t, e);
@@ -1501,7 +1540,7 @@ class Jr {
       return !1;
     if (r === n)
       return !0;
-    if (d(this.nodeProvider))
+    if (p(this.nodeProvider))
       try {
         const i = new a().setBlueId(r), o = new a().setBlueId(n);
         if (b(i, o, this.nodeProvider))
@@ -1513,8 +1552,8 @@ class Jr {
   getBlueIdForSchema(e) {
     if (I(e))
       return null;
-    const t = ne.resolveBlueId(e);
-    if (d(t))
+    const t = de.resolveBlueId(e);
+    if (p(t))
       return t;
     for (const [r, n] of this.blueIdMap)
       if (n === e || n._def === e._def)
@@ -1523,13 +1562,13 @@ class Jr {
   }
   getEffectiveBlueId(e) {
     const t = e.getType();
-    return d(t) && d(t.getBlueId()) ? t.getBlueId() : d(t) ? T.calculateBlueIdSync(t) : null;
+    return p(t) && p(t.getBlueId()) ? t.getBlueId() : p(t) ? T.calculateBlueIdSync(t) : null;
   }
   getBlueIdMap() {
     return new Map(this.blueIdMap);
   }
 }
-const B = {
+const N = {
   NAME: "name",
   DESCRIPTION: "description",
   TYPE: "type",
@@ -1542,7 +1581,7 @@ const B = {
   BLUE: "blue",
   ITEMS: "items"
 };
-class Ze {
+class ut {
   /**
    * Check if a node is empty (has no fields set)
    */
@@ -1553,13 +1592,13 @@ class Ze {
    * Check if a node has only a Blue ID
    */
   static hasBlueIdOnly(e) {
-    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([B.BLUE_ID]));
+    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([N.BLUE_ID]));
   }
   /**
    * Check if a node has only items
    */
   static hasItemsOnly(e) {
-    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([B.ITEMS]));
+    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([N.ITEMS]));
   }
   /**
    * Check if a node is a valid value node (has a value, no properties, no items)
@@ -1568,7 +1607,7 @@ class Ze {
    */
   static isValidValueNode(e) {
     const t = e.getValue(), r = e.getProperties(), n = e.getItems();
-    return d(t) && I(r) && I(n);
+    return p(t) && I(r) && I(n);
   }
   /**
    * Create a text node
@@ -1580,21 +1619,21 @@ class Ze {
    * Create an integer node
    */
   static integerNode(e) {
-    const t = e instanceof w ? e : new w(e.toString());
-    return new a().setType(new a().setBlueId(Y)).setValue(t);
+    const t = e instanceof E ? e : new E(e.toString());
+    return new a().setType(new a().setBlueId(j)).setValue(t);
   }
   /**
    * Create a double node
    */
   static doubleNode(e) {
-    const t = e instanceof P ? e : new P(e.toString());
-    return new a().setType(new a().setBlueId(K)).setValue(t);
+    const t = e instanceof S ? e : new S(e.toString());
+    return new a().setType(new a().setBlueId(L)).setValue(t);
   }
   /**
    * Create a boolean node
    */
   static booleanNode(e) {
-    return new a().setType(new a().setBlueId(G)).setValue(e);
+    return new a().setType(new a().setBlueId(U)).setValue(e);
   }
   /**
    * Check if a node has exactly the specified fields
@@ -1604,8 +1643,8 @@ class Ze {
    * @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(B)) {
-      const i = d(this.getFieldValue(e, n));
+    for (const n of Object.values(N)) {
+      const i = p(this.getFieldValue(e, n));
       if (t.has(n)) {
         if (!i) return !1;
       } else if (!r.has(n)) {
@@ -1619,39 +1658,39 @@ class Ze {
    */
   static getFieldValue(e, t) {
     switch (t) {
-      case B.NAME:
+      case N.NAME:
         return e.getName();
-      case B.TYPE:
+      case N.TYPE:
         return e.getType();
-      case B.VALUE:
+      case N.VALUE:
         return e.getValue();
-      case B.DESCRIPTION:
+      case N.DESCRIPTION:
         return e.getDescription();
-      case B.PROPERTIES:
+      case N.PROPERTIES:
         return e.getProperties();
-      case B.BLUE:
+      case N.BLUE:
         return e.getBlue();
-      case B.ITEMS:
+      case N.ITEMS:
         return e.getItems();
-      case B.KEY_TYPE:
+      case N.KEY_TYPE:
         return e.getKeyType();
-      case B.VALUE_TYPE:
+      case N.VALUE_TYPE:
         return e.getValueType();
-      case B.ITEM_TYPE:
+      case N.ITEM_TYPE:
         return e.getItemType();
-      case B.BLUE_ID:
+      case N.BLUE_ID:
         return e.getBlueId();
       default:
         throw new Error(`Unknown field: ${t}`);
     }
   }
 }
-class He {
+class dt {
 }
-class te {
+class ce {
   static convert(e) {
-    const t = new Re();
-    return te.traverseNode(e, "", t), t.build();
+    const t = new We();
+    return ce.traverseNode(e, "", t), t.build();
   }
   static traverseNode(e, t, r) {
     if (!e)
@@ -1664,20 +1703,20 @@ class te {
     if (n)
       for (const [c, u] of Object.entries(n)) {
         const y = `${t}/${c}`;
-        te.traverseNode(u, y, r);
+        ce.traverseNode(u, y, r);
       }
     if (i)
       for (let c = 0; c < i.length; c++) {
         const u = `${t}/${c}`;
-        te.traverseNode(i[c], u, r);
+        ce.traverseNode(i[c], u, r);
       }
   }
 }
-function tt(s, e) {
+function Tt(s, e) {
   const t = s.split(e), r = [...t].reverse().findIndex((i) => i !== ""), n = r === -1 ? 0 : t.length - r;
   return t.slice(0, n);
 }
-class Be extends He {
+class $e extends dt {
   allowedPaths;
   maxDepth;
   currentPath = [];
@@ -1728,7 +1767,7 @@ class Be extends He {
    * @returns True if the path matches the allowed path pattern, false otherwise
    */
   matchesAllowedPath(e, t) {
-    const r = tt(e, "/"), n = tt(t, "/");
+    const r = Tt(e, "/"), n = Tt(t, "/");
     if (n.length > r.length)
       return !1;
     for (let i = 1; i < n.length; i++)
@@ -1770,7 +1809,7 @@ class Be extends He {
    * @returns The path limits
    */
   static withMaxDepth(e) {
-    const t = new Re().setMaxDepth(e);
+    const t = new We().setMaxDepth(e);
     for (let r = 1; r <= e; r++) {
       const n = "/" + Array(r).fill("*").join("/");
       t.addPath(n);
@@ -1783,17 +1822,17 @@ class Be extends He {
    * @returns The path limits
    */
   static withSinglePath(e) {
-    return new Re().addPath(e).build();
+    return new We().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 te.convert(e);
+    return ce.convert(e);
   }
 }
-class Re {
+class We {
   allowedPaths = /* @__PURE__ */ new Set();
   maxDepth = Number.MAX_SAFE_INTEGER;
   /**
@@ -1817,10 +1856,10 @@ class Re {
    * @returns The built PathLimits
    */
   build() {
-    return new Be(this.allowedPaths, this.maxDepth);
+    return new $e(this.allowedPaths, this.maxDepth);
   }
 }
-class Zr extends He {
+class ds extends dt {
   /**
    * Determines if a path segment should be extended - always returns true
    * @returns Always true
@@ -1846,7 +1885,7 @@ class Zr extends He {
   exitPathSegment() {
   }
 }
-class Ne extends He {
+class _e extends dt {
   limits;
   /**
    * Creates a composite limits with the specified limit strategies
@@ -1903,20 +1942,20 @@ class Ne extends He {
    * @returns A new CompositeLimits instance
    */
   static of(...e) {
-    return new Ne(e);
+    return new _e(e);
   }
 }
-const R = new Zr();
-class Hr {
+const K = new ds();
+class ps {
   blue;
   constructor(e) {
     this.blue = e;
   }
-  matchesType(e, t, r = R) {
+  matchesType(e, t, r = K) {
     const n = t.getType();
     if (this.matchesImplicitStructure(e, n))
       return !0;
-    const i = Be.fromNode(t), o = Ne.of(r, i), l = this.extendAndResolve(e, o), c = this.blue.resolve(t, o);
+    const i = $e.fromNode(t), o = _e.of(r, i), l = this.extendAndResolve(e, o), c = this.blue.resolve(t, o);
     return this.verifyMatch(l, t, o) && this.recursiveValueComparison(l, c);
   }
   /**
@@ -1946,8 +1985,8 @@ class Hr {
       let c = e.getProperties();
       c || (c = {}, e.setProperties(c));
       for (const [u, y] of Object.entries(i)) {
-        const p = c[u];
-        p === void 0 ? c[u] = y.clone() : this.restoreMissingStructure(p, y);
+        const d = c[u];
+        d === void 0 ? c[u] = y.clone() : this.restoreMissingStructure(d, y);
       }
     }
     const o = t.getBlueId();
@@ -1973,9 +2012,9 @@ class Hr {
       r
     );
     if (r && !n) {
-      const p = e.getType();
-      if (!p || !b(
-        p,
+      const d = e.getType();
+      if (!d || !b(
+        d,
         r,
         this.blue.getNodeProvider()
       ))
@@ -1983,56 +2022,56 @@ class Hr {
     }
     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 d = e.getBlueId(), h = e.getType()?.getBlueId();
+      if (d !== void 0) {
+        if (i !== d)
           return !1;
-      } else if (f === void 0 || i !== f)
+      } else if (h === void 0 || i !== h)
         return !1;
     }
     const o = t.getValue();
     if (o !== void 0) {
-      const p = e.getValue();
-      if (p === void 0)
+      const d = e.getValue();
+      if (d === void 0)
         return !1;
-      if (S(p) && S(o)) {
-        if (!p.eq(o))
+      if (A(d) && A(o)) {
+        if (!d.eq(o))
           return !1;
-      } else if (p !== o)
+      } else if (d !== o)
         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 d = e.getItems() ?? [];
+      for (let h = 0; h < l.length; h++)
+        if (h < d.length) {
+          if (!this.recursiveValueComparison(d[h], l[h]))
             return !1;
-        } else if (this.hasValueInNestedStructure(l[f]))
+        } else if (this.hasValueInNestedStructure(l[h]))
           return !1;
     }
     const c = t.getItemType();
     if (c !== void 0) {
-      const p = e.getItems() ?? [];
-      for (const f of p)
-        if (!this.recursiveValueComparison(f, c))
+      const d = e.getItems() ?? [];
+      for (const h of d)
+        if (!this.recursiveValueComparison(h, c))
           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 d = e.getProperties() ?? {};
+      for (const [h, v] of Object.entries(u))
+        if (h in d) {
+          if (!this.recursiveValueComparison(d[h], v))
             return !1;
         } else if (this.hasValueInNestedStructure(v))
           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 d = Object.values(e.getProperties() ?? {});
+      for (const h of d)
+        if (!this.recursiveValueComparison(h, y))
           return !1;
     }
     return !0;
@@ -2059,7 +2098,7 @@ class Hr {
    * shape of the requested core list or dictionary type.
    */
   matchesImplicitStructure(e, t) {
-    return t === void 0 || e.getType() !== void 0 ? !1 : Nt(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : Pt(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
+    return t === void 0 || e.getType() !== void 0 ? !1 : Gt(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : Jt(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
   }
   isImplicitListStructure(e) {
     return e.getItems() !== void 0 && e.getValue() === void 0;
@@ -2068,75 +2107,75 @@ class Hr {
     return e.getProperties() !== void 0 && e.getValue() === void 0;
   }
 }
-const Wr = (s) => s instanceof it || s instanceof ot || s instanceof lt || s instanceof ct || s instanceof fe || s instanceof ge, qr = (s) => s instanceof J || s instanceof Z || s instanceof ue || s instanceof de;
-class Et {
+const fs = (s) => s instanceof Nt || s instanceof Pt || s instanceof St || s instanceof At || s instanceof Ne || s instanceof Pe, hs = (s) => s instanceof ee || s instanceof te || s instanceof Be || s instanceof be;
+class Zt {
   static convertValue(e, t) {
     const r = e.getType()?.getBlueId(), n = e.getValue();
-    return I(n) ? qr(t) && Ze.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : n : _ === r ? this.convertFromString(String(n), t) : K === r || n instanceof P ? this.convertFromBigDecimal(
-      new P(n?.toString()),
+    return I(n) ? hs(t) && ut.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : n : _ === r ? this.convertFromString(String(n), t) : L === r || n instanceof S ? this.convertFromBigDecimal(
+      new S(n?.toString()),
       t
-    ) : Y === r || n instanceof w ? this.convertFromBigInteger(
-      new w(n?.toString()),
+    ) : j === r || n instanceof E ? this.convertFromBigInteger(
+      new E(n?.toString()),
       t
-    ) : G === r || typeof n == "boolean" ? this.convertFromBoolean(!!n, t) : this.convertFromString(String(n), t);
+    ) : U === r || typeof n == "boolean" ? this.convertFromBoolean(!!n, t) : this.convertFromString(String(n), t);
   }
   static convertFromString(e, t) {
-    if (!t || t instanceof J || t instanceof Kt || t instanceof Yt)
+    if (!t || t instanceof ee || t instanceof ar || t instanceof ur)
       return e;
-    if (t instanceof Z)
+    if (t instanceof te)
       return Number(e);
-    if (t instanceof ue)
+    if (t instanceof Be)
       return e.toLowerCase() === "true";
-    if (t instanceof de)
+    if (t instanceof be)
       return BigInt(e);
     throw new Error(`Cannot convert String to ${t._def.typeName}`);
   }
   static convertFromBigDecimal(e, t) {
-    if (t instanceof Z)
+    if (t instanceof te)
       return e.toNumber();
-    if (t instanceof J)
+    if (t instanceof ee)
       return e.toString();
     throw new Error(`Cannot convert Number to ${t._def.typeName}`);
   }
   static convertFromBigInteger(e, t) {
-    if (t instanceof Z)
+    if (t instanceof te)
       return e.toNumber();
-    if (t instanceof de)
+    if (t instanceof be)
       return BigInt(e.toString());
-    if (t instanceof J)
+    if (t instanceof ee)
       return e.toString();
     throw new Error(`Cannot convert Number to ${t._def.typeName}`);
   }
   static convertFromBoolean(e, t) {
-    if (!t || t instanceof ue)
+    if (!t || t instanceof Be)
       return e;
-    if (t instanceof J)
+    if (t instanceof ee)
       return e.toString();
-    if (t instanceof Z)
+    if (t instanceof te)
       return Number(e);
-    if (t instanceof de)
+    if (t instanceof be)
       return BigInt(e);
     throw new Error(`Cannot convert Boolean to ${t._def.typeName}`);
   }
   static getDefaultPrimitiveValue(e) {
     if (!e) return null;
-    if (e instanceof Z)
+    if (e instanceof te)
       return 0;
-    if (e instanceof ue)
+    if (e instanceof Be)
       return !1;
-    if (e instanceof J)
+    if (e instanceof ee)
       return "";
     throw new Error(
       `Unsupported primitive type: ${e._def.typeName}`
     );
   }
 }
-class Xr {
+class ys {
   convert(e, t) {
-    return Et.convertValue(e, t);
+    return Zt.convertValue(e, t);
   }
 }
-class Qr {
+class gs {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2144,27 +2183,27 @@ class Qr {
     return this.convertFields(e, t);
   }
   convertFields(e, t) {
-    if (t instanceof Gt) {
+    if (t instanceof dr) {
       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 zt)
+    if (t instanceof pr)
       throw new Error("Union not supported");
-    if (t instanceof kt)
+    if (t instanceof fr)
       return Object.keys(t.shape).reduce(
         (n, i) => {
-          const o = e.getProperties(), l = t.shape[i], c = Fr(l);
-          if (d(c)) {
-            const v = je(c) ? c : i, O = o?.[v], z = O ? T.calculateBlueIdSync(O) : void 0;
-            return n[i] = z, n;
+          const o = e.getProperties(), l = t.shape[i], c = Wr(l);
+          if (p(c)) {
+            const v = et(c) ? c : i, k = o?.[v], q = k ? T.calculateBlueIdSync(k) : void 0;
+            return n[i] = q, n;
           }
-          const u = Rr(l);
-          if (d(u)) {
+          const u = qr(l);
+          if (p(u)) {
             const v = o?.[u];
             return n[i] = v?.getName(), n;
           }
-          const y = Cr(l);
-          if (d(y)) {
+          const y = Jr(l);
+          if (p(y)) {
             const v = o?.[y];
             return n[i] = v?.getDescription(), n;
           }
@@ -2176,21 +2215,21 @@ class Qr {
             const v = e.getDescription();
             return n[i] = v, n;
           }
-          const p = o?.[i];
-          if (I(p))
+          const d = o?.[i];
+          if (I(d))
             return n;
-          const f = this.nodeToObjectConverter.convert(
-            p,
+          const h = this.nodeToObjectConverter.convert(
+            d,
             l
           );
-          return n[i] = f, n;
+          return n[i] = h, n;
         },
         {}
       );
     throw new Error("Unknown schema type, " + t._def.typeName);
   }
 }
-class es {
+class ms {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2204,7 +2243,7 @@ class es {
     );
   }
 }
-class ts {
+class Is {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2218,35 +2257,35 @@ class ts {
     return new Set(i);
   }
 }
-class rs {
+class Ts {
   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(H, o);
+    p(o) && i.set(G, o);
     const l = e.getDescription();
-    d(l) && i.set(W, l);
+    p(l) && i.set(J, l);
     const c = e.getProperties();
-    return d(c) && Object.entries(c).forEach(([u, y]) => {
-      const p = new a().setValue(u);
-      p.setType(new a().setBlueId(_));
-      const f = Et.convertValue(p, r), v = this.nodeToObjectConverter.convert(y, n);
-      i.set(f, v);
-    }), t instanceof Jt ? Object.fromEntries(i) : i;
+    return p(c) && Object.entries(c).forEach(([u, y]) => {
+      const d = new a().setValue(u);
+      d.setType(new a().setBlueId(_));
+      const h = Zt.convertValue(d, r), v = this.nodeToObjectConverter.convert(y, n);
+      i.set(h, v);
+    }), t instanceof hr ? Object.fromEntries(i) : i;
   }
 }
-class ss {
+class vs {
   convert(e) {
     return m.get(e);
   }
 }
-class ns {
+class Bs {
   convert(e) {
     return m.get(e);
   }
 }
-class is {
+class bs {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2260,70 +2299,70 @@ class is {
     );
   }
 }
-const os = 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 ws = f.union([
+  f.literal("ZodString"),
+  f.literal("ZodNumber"),
+  f.literal("ZodBoolean"),
+  f.literal("ZodBigInt"),
+  f.literal("ZodArray"),
+  f.literal("ZodSet"),
+  f.literal("ZodMap"),
+  f.literal("ZodRecord"),
+  f.literal("ZodObject"),
+  f.literal("ZodEnum"),
+  f.literal("ZodNativeEnum"),
+  f.literal("ZodUnknown"),
+  f.literal("ZodAny"),
+  f.literal("ZodTuple")
 ]);
-class ls {
+class Es {
   constructor(e) {
-    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new Qr(
+    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new gs(
       this.nodeToObjectConverter
     );
   }
   converters = /* @__PURE__ */ new Map();
   complexObjectConverter;
   registerConverters() {
-    const e = new Xr(), t = new es(this.nodeToObjectConverter), r = new is(this.nodeToObjectConverter), n = new ts(this.nodeToObjectConverter), i = new rs(this.nodeToObjectConverter);
-    this.converters.set("ZodString", e), this.converters.set("ZodNumber", e), this.converters.set("ZodBoolean", e), this.converters.set("ZodBigInt", e), this.converters.set("ZodEnum", e), this.converters.set("ZodNativeEnum", e), this.converters.set("ZodUnknown", new ss()), this.converters.set("ZodAny", new ns()), this.converters.set("ZodArray", t), this.converters.set("ZodTuple", r), this.converters.set("ZodSet", n), this.converters.set("ZodMap", i), this.converters.set("ZodRecord", i), this.converters.set("ZodObject", this.complexObjectConverter);
+    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);
   }
   getConverter(e) {
     const t = this.getSchemaTypeName(e);
     return this.converters.get(t) ?? this.complexObjectConverter;
   }
   getSchemaTypeName(e) {
-    if (Wr(e))
-      return e instanceof fe ? this.getSchemaTypeName(e.innerType()) : e instanceof ge ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
+    if (fs(e))
+      return e instanceof Ne ? this.getSchemaTypeName(e.innerType()) : e instanceof Pe ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
     const t = e._def.typeName;
     try {
-      return os.parse(t);
+      return ws.parse(t);
     } catch {
       throw new Error(`Schema type name ${t} is not supported`);
     }
   }
 }
-class cs {
+class Ns {
   constructor(e) {
-    this.typeSchemaResolver = e, this.converterFactory = new ls(this);
+    this.typeSchemaResolver = e, this.converterFactory = new Es(this);
   }
   converterFactory;
   convert(e, t) {
-    const r = this.typeSchemaResolver?.resolveSchema(e), n = A.unwrapSchema(t);
-    if (Bt(n))
+    const r = this.typeSchemaResolver?.resolveSchema(e), n = V.unwrapSchema(t);
+    if (zt(n))
       return e;
     let i = n;
-    return A.checkSchemaExtension(
+    return V.checkSchemaExtension(
       r,
       n,
       { typeSchemaResolver: this.typeSchemaResolver }
-    ) && d(r) && (i = r), this.convertWithType(e, i);
+    ) && p(r) && (i = r), this.convertWithType(e, i);
   }
   convertWithType(e, t) {
     return this.converterFactory.getConverter(t).convert(e, t);
   }
 }
-class St {
+class Ht {
   reverse(e) {
     const t = new a();
     return this.reverseNode(t, e, e.getType()), t;
@@ -2332,16 +2371,16 @@ class St {
     this.isIdenticalToType(t, r) || (this.reverseBasicProperties(e, t, r), this.reverseTypeReferences(e, t, r), this.reverseItems(e, t, r), this.reverseProperties(e, t, r));
   }
   isIdenticalToType(e, t) {
-    return d(e.getBlueId()) && d(t?.getBlueId()) && e.getBlueId() === t.getBlueId();
+    return p(e.getBlueId()) && p(t?.getBlueId()) && e.getBlueId() === t.getBlueId();
   }
   reverseBasicProperties(e, t, r) {
     const n = t.getValue();
-    d(n) && (I(r) || I(r.getValue())) && e.setValue(n), d(t.getName()) && (I(r) || t.getName() !== r.getName()) && e.setName(t.getName()), d(t.getDescription()) && (I(r) || t.getDescription() !== r.getDescription()) && e.setDescription(t.getDescription()), d(t.getBlueId()) && (I(r) || t.getBlueId() !== r.getBlueId()) && e.setBlueId(t.getBlueId());
+    p(n) && (I(r) || I(r.getValue())) && e.setValue(n), p(t.getName()) && (I(r) || t.getName() !== r.getName()) && e.setName(t.getName()), p(t.getDescription()) && (I(r) || t.getDescription() !== r.getDescription()) && e.setDescription(t.getDescription()), p(t.getBlueId()) && (I(r) || t.getBlueId() !== r.getBlueId()) && e.setBlueId(t.getBlueId());
   }
   reverseTypeReferences(e, t, r) {
     const n = (i, o) => {
       const l = i(t), c = r ? i(r) : void 0, u = l?.getBlueId();
-      d(u) && (I(c?.getBlueId()) || u !== c.getBlueId()) && o(e, new a().setBlueId(u));
+      p(u) && (I(c?.getBlueId()) || u !== c.getBlueId()) && o(e, new a().setBlueId(u));
     };
     n(
       (i) => i.getType(),
@@ -2362,7 +2401,7 @@ class St {
     if (I(n))
       return;
     const i = r?.getItems(), o = [];
-    if (d(i) && i.length > 0) {
+    if (p(i) && i.length > 0) {
       const c = T.calculateBlueIdSync(i);
       o.push(new a().setBlueId(c));
     }
@@ -2384,7 +2423,7 @@ class St {
         t,
         r
       ), u = new a();
-      this.reverseNode(u, l, c), Ze.isEmptyNode(u) || (i[o] = u);
+      this.reverseNode(u, l, c), ut.isEmptyNode(u) || (i[o] = u);
     }
     Object.keys(i).length > 0 && e.setProperties(i);
   }
@@ -2404,27 +2443,27 @@ class St {
    */
   mergeNodes(e, t) {
     const r = e.clone(), n = t.getValue();
-    d(n) && r.setValue(n);
+    p(n) && r.setValue(n);
     const i = t.getType();
-    d(i) && r.setType(i.clone());
+    p(i) && r.setType(i.clone());
     const o = t.getItemType();
-    d(o) && r.setItemType(o.clone());
+    p(o) && r.setItemType(o.clone());
     const l = t.getKeyType();
-    d(l) && r.setKeyType(l.clone());
+    p(l) && r.setKeyType(l.clone());
     const c = t.getValueType();
-    d(c) && r.setValueType(c.clone());
+    p(c) && r.setValueType(c.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);
+    if (p(u)) {
+      const d = r.getProperties() || {};
+      for (const [h, v] of Object.entries(u))
+        d[h] = v.clone();
+      r.setProperties(d);
     }
     const y = t.getItems();
-    return d(y) && r.setItems(y.map((p) => p.clone())), r;
+    return p(y) && r.setItems(y.map((d) => d.clone())), r;
   }
 }
-class ie extends a {
+class pe extends a {
   /**
    * Creates a new ResolvedBlueNode from a resolved BlueNode
    * @param resolvedNode - The fully resolved node after merge operations
@@ -2446,7 +2485,7 @@ class ie extends a {
    * @returns The minimal node representation
    */
   getMinimalNode() {
-    return new St().reverse(this);
+    return new Ht().reverse(this);
   }
   getMinimalBlueId() {
     const e = this.getMinimalNode();
@@ -2458,7 +2497,7 @@ class ie extends a {
    */
   clone() {
     const e = super.clone();
-    return new ie(e);
+    return new pe(e);
   }
   /**
    * Copies all properties from another BlueNode
@@ -2470,7 +2509,7 @@ class ie extends a {
     t !== void 0 && this.setValue(t);
   }
 }
-class ae {
+class Te {
   /**
    * Fetches the first node associated with the given Blue ID
    * Default implementation that takes the first node from fetchByBlueId result
@@ -2483,14 +2522,57 @@ class ae {
     return t && t.length > 0 ? t[0] : null;
   }
 }
-function as(s) {
-  return new class extends ae {
+function Ps(s) {
+  return new class extends Te {
     fetchByBlueId(e) {
       return s(e);
     }
   }();
 }
-class us extends ae {
+const Ke = W.types.float.options, Ss = {
+  ...Ke,
+  construct: (s) => {
+    const e = s.replace(/_/g, "").toLowerCase();
+    if (!Et(e))
+      return new S(e);
+    if (Ke.construct)
+      return Ke.construct(s);
+  }
+}, As = new W.Type("tag:yaml.org,2002:float", Ss), Ye = W.types.int.options, Vs = {
+  ...Ye,
+  construct: (s) => {
+    let e = s;
+    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !Et(e))
+      return new E(e);
+    if (Ye.construct)
+      return Ye.construct(s);
+  }
+}, Cs = new W.Type("tag:yaml.org,2002:int", Vs), Wt = W.CORE_SCHEMA.extend({
+  implicit: [As, Cs]
+}), $ = (s) => {
+  const e = W.load(s, { schema: Wt });
+  return e === void 0 ? void 0 : e;
+}, Rs = (s) => W.dump(s, {
+  schema: Wt,
+  replacer: (e, t) => {
+    if (A(t)) {
+      if (H(t)) {
+        const r = new M(Number.MIN_SAFE_INTEGER.toString()), n = new M(Number.MAX_SAFE_INTEGER.toString());
+        if (t.lt(r) || t.gt(n))
+          return t.toString();
+      }
+      return t.toNumber();
+    }
+    return t;
+  }
+});
+class Os {
+  static get(e, t = {}) {
+    const { strategy: r = "official" } = t, n = m.get(e, r);
+    return Rs(n);
+  }
+}
+class Ds extends Te {
   nodeProviders;
   constructor(e) {
     super(), this.nodeProviders = e;
@@ -2517,43 +2599,7 @@ class us extends ae {
     return this.nodeProviders;
   }
 }
-const Ve = U.types.float.options, ds = {
-  ...Ve,
-  construct: (s) => {
-    const e = s.replace(/_/g, "").toLowerCase();
-    if (!nt(e))
-      return new P(e);
-    if (Ve.construct)
-      return Ve.construct(s);
-  }
-}, ps = new U.Type("tag:yaml.org,2002:float", ds), Ce = U.types.int.options, hs = {
-  ...Ce,
-  construct: (s) => {
-    let e = s;
-    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !nt(e))
-      return new w(e);
-    if (Ce.construct)
-      return Ce.construct(s);
-  }
-}, fs = new U.Type("tag:yaml.org,2002:int", hs), At = U.CORE_SCHEMA.extend({
-  implicit: [ps, fs]
-}), F = (s) => {
-  const e = U.load(s, { schema: At });
-  return e === void 0 ? void 0 : e;
-}, on = (s) => U.dump(s, {
-  schema: At,
-  replacer: (e, t) => {
-    if (S(t)) {
-      if (L(t)) {
-        const r = new M(Number.MIN_SAFE_INTEGER.toString()), n = new M(Number.MAX_SAFE_INTEGER.toString());
-        if (t.lt(r) || t.gt(n))
-          return t.toString();
-      }
-      return t.toNumber();
-    }
-    return t;
-  }
-}), Vt = `- type:
+const Xt = `- type:
     blueId: 27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo
   mappings:
     Text: DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K
@@ -2564,20 +2610,20 @@ const Ve = U.types.float.options, ds = {
     Dictionary: G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj
 - type:
     blueId: FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4
-`, gs = `name: Transformation
-description: TODO`, ys = `name: Infer Basic Types For Untyped Values
+`, Ms = `name: Transformation
+description: TODO`, xs = `name: Infer Basic Types For Untyped Values
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation infers type details for Text, Integer, Number and Boolean.`, ms = `name: Replace Inline Types with BlueIds
+description: This transformation infers type details for Text, Integer, Number and Boolean.`, Fs = `name: Replace Inline Types with BlueIds
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation replaces`, Is = [
-  Vt,
-  gs,
-  ys,
-  ms
+description: This transformation replaces`, $s = [
+  Xt,
+  Ms,
+  xs,
+  Fs
 ];
-class Ts extends ae {
+class _s extends Te {
   blueIdToNodesMap = /* @__PURE__ */ new Map();
   constructor() {
     super(), this.load();
@@ -2586,8 +2632,8 @@ class Ts extends ae {
     return this.blueIdToNodesMap.get(e) || [];
   }
   load() {
-    for (const e of Is) {
-      const t = F(e);
+    for (const e of $s) {
+      const t = $(e);
       if (t === void 0) {
         console.error(`This content file is not valid YAML: ${e}`);
         continue;
@@ -2604,27 +2650,27 @@ class Ts extends ae {
     }
   }
 }
-class We extends ae {
-  static INSTANCE = new We();
+class pt extends Te {
+  static INSTANCE = new pt();
   nodeProvider;
   constructor() {
-    super(), this.nodeProvider = new Ts();
+    super(), this.nodeProvider = new _s();
   }
   fetchByBlueId(e) {
     return this.nodeProvider.fetchByBlueId(e);
   }
 }
-class Me {
+class ze {
   constructor(e, t, r) {
     this.blueId = e, this.content = t, this.isMultipleDocuments = r;
   }
 }
-class x {
+class z {
   static THIS_REFERENCE_PATTERN = /^this(#\d+)?$/;
   static parseAndCalculateBlueId(e, t) {
     let r;
     try {
-      const l = F(e);
+      const l = $(e);
       if (l === void 0)
         throw new Error();
       r = l;
@@ -2643,11 +2689,11 @@ class x {
       const l = g.deserialize(r), c = t(l);
       n = T.calculateBlueIdSync(c), i = m.get(c);
     }
-    return new Me(n, i, o);
+    return new ze(n, i, o);
   }
   static parseAndCalculateBlueIdForNode(e, t) {
     const r = t(e), n = T.calculateBlueIdSync(r), i = m.get(r);
-    return new Me(n, i, !1);
+    return new ze(n, i, !1);
   }
   static parseAndCalculateBlueIdForNodeList(e, t) {
     if (!e || e.length === 0)
@@ -2655,7 +2701,7 @@ class x {
     const r = e.map(t), n = T.calculateBlueIdSync(r), i = r.map(
       (l) => m.get(l)
     ), o = e.length > 1;
-    return new Me(n, i, o);
+    return new ze(n, i, o);
   }
   static resolveThisReferences(e, t, r) {
     return this.resolveThisReferencesRecursive(
@@ -2706,12 +2752,12 @@ class x {
     }
   }
 }
-class vs extends ae {
+class Ls extends Te {
   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 = x.resolveThisReferences(
+    const n = Array.isArray(r) && r.length > 1, i = z.resolveThisReferences(
       r,
       t,
       n
@@ -2738,7 +2784,7 @@ class vs extends ae {
     }
   }
 }
-class Ct extends vs {
+class qt extends Ls {
   nameToBlueIdsMap = /* @__PURE__ */ new Map();
   /**
    * Find a node by name. Throws an error if multiple nodes are found with the same name.
@@ -2782,17 +2828,17 @@ class Ct extends vs {
     ]);
   }
 }
-const Mt = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanceof a) ? s : xe(s) ? s.map((e) => g.deserialize(e)) : g.deserialize(s), bs = async (s) => {
-  const e = Mt(s);
+const Qt = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanceof a) ? s : Qe(s) ? s.map((e) => g.deserialize(e)) : g.deserialize(s), js = async (s) => {
+  const e = Qt(s);
   return T.calculateBlueId(e);
-}, ln = (s) => {
-  const e = Mt(s);
+}, Hn = (s) => {
+  const e = Qt(s);
   return T.calculateBlueIdSync(e);
-}, rt = async (s) => {
-  if (or(s))
+}, vt = async (s) => {
+  if (Er(s))
     return s;
   try {
-    const e = Ie.parse(s), t = await bs(e);
+    const e = Ae.parse(s), t = await js(e);
     return {
       ...s,
       blueId: t
@@ -2800,31 +2846,31 @@ const Mt = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanc
   } catch (e) {
     throw new Error(`Failed enriching object with Blue ID: ${e}`);
   }
-}, cn = (s) => s?.items, an = (s) => s?.value, un = (s) => I(s) ? {} : ut(
+}, Wn = (s) => s?.items, Xn = (s) => s?.value, qn = (s) => I(s) ? {} : Ct(
   s,
-  Qt
-), dn = (s) => cr(s) ? s.type.name ?? null : ar(s) ? Zt(typeof s.value) : lr(s) ? "List" : null, ws = (s) => d(s) && Object.keys(ut(s, ["blueId"])).length > 0, pn = (s) => {
+  rt
+), Qn = (s) => Pr(s) ? s.type.name ?? null : Sr(s) ? yr(typeof s.value) : Nr(s) ? "List" : null, Us = (s) => p(s) && Object.keys(Ct(s, ["blueId"])).length > 0, ei = (s) => {
   try {
     const e = g.deserialize(s), t = m.get(e);
-    return se.parse(t);
+    return ue.parse(t);
   } catch (e) {
     throw new Error(
       `Failed transforming JSON-like value to BlueObject: ${e}`
     );
   }
-}, st = async (s) => {
+}, Bt = async (s) => {
   const {
     resolveFunction: e,
     signal: t = new AbortController().signal,
     omitItems: r
   } = s, n = s.count ?? s.items.length;
-  let i = await Ht(s.items, async (l) => await rt(l));
+  let i = await gr(s.items, async (l) => await vt(l));
   const o = Math.max(i?.length - n, 0);
   for (let l = i.length - 1; l >= o; l--)
-    if (!ws(i[l])) {
+    if (!Us(i[l])) {
       const c = await e(i[l], { signal: t });
       if (Array.isArray(c))
-        return st({
+        return Bt({
           ...s,
           items: [
             ...i.slice(0, l),
@@ -2832,9 +2878,9 @@ const Mt = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanc
             ...i.slice(l + 1)
           ]
         });
-      const u = await rt(c);
+      const u = await vt(c);
       if (r?.includes(u.blueId))
-        return st({
+        return Bt({
           ...s,
           items: [...i.slice(0, l), ...i.slice(l + 1)]
         });
@@ -2846,7 +2892,7 @@ const Mt = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanc
     }
   return i;
 };
-function pe(s) {
+function we(s) {
   try {
     const e = new URL(s);
     return e.protocol === "http:" || e.protocol === "https:";
@@ -2854,14 +2900,14 @@ function pe(s) {
     return !1;
   }
 }
-class Bs {
+class ks {
   /**
    * Process a document node to infer basic types for untyped values
    * @param document - The document to process
    * @returns The processed document
    */
   process(e) {
-    return E.transform(e, this.inferType.bind(this));
+    return w.transform(e, this.inferType.bind(this));
   }
   /**
    * Infer a basic type for a node
@@ -2870,10 +2916,10 @@ class Bs {
    */
   inferType(e) {
     const t = e.getType(), r = e.getValue();
-    return I(t) && d(r) && (typeof r == "string" ? e.setType(new a().setBlueId(_)) : typeof r == "bigint" || L(r) ? e.setType(new a().setBlueId(Y)) : De(r) ? e.setType(new a().setBlueId(K)) : typeof r == "boolean" && e.setType(new a().setBlueId(G))), e;
+    return I(t) && p(r) && (typeof r == "string" ? e.setType(new a().setBlueId(_)) : typeof r == "bigint" || H(r) ? e.setType(new a().setBlueId(j)) : Ge(r) ? e.setType(new a().setBlueId(L)) : typeof r == "boolean" && e.setType(new a().setBlueId(U))), e;
   }
 }
-class ve {
+class Ce {
   static MAPPINGS = "mappings";
   mappings = /* @__PURE__ */ new Map();
   /**
@@ -2883,8 +2929,8 @@ class ve {
   constructor(e) {
     if (e instanceof a) {
       const r = e.getProperties();
-      if (r && r[ve.MAPPINGS]) {
-        const i = r[ve.MAPPINGS].getProperties();
+      if (r && r[Ce.MAPPINGS]) {
+        const i = r[Ce.MAPPINGS].getProperties();
         i && Object.entries(i).forEach(([o, l]) => {
           const c = l.getValue();
           typeof c == "string" && this.mappings.set(o, c);
@@ -2899,7 +2945,7 @@ class ve {
    * @returns The processed document
    */
   process(e) {
-    return E.transform(e, this.transformNode.bind(this));
+    return w.transform(e, this.transformNode.bind(this));
   }
   transformNode(e) {
     const t = e.clone();
@@ -2918,7 +2964,7 @@ class ve {
     }
   }
 }
-class Ns {
+class Ks {
   /**
    * Process a document node to validate all inline types have been replaced
    * @param document - The document to process
@@ -2926,7 +2972,7 @@ class Ns {
    * @throws Error if any inline type values remain without BlueId mappings
    */
   process(e) {
-    return E.transform(e, this.validateNode.bind(this)), e;
+    return w.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;
@@ -2940,7 +2986,7 @@ class Ns {
     }
   }
 }
-class qe {
+class ft {
   nodeProvider;
   strategy;
   /**
@@ -2949,7 +2995,7 @@ class qe {
    * @param strategy - The strategy to use for missing elements (defaults to THROW_EXCEPTION)
    */
   constructor(e, t) {
-    this.nodeProvider = oe.wrap(e), this.strategy = t || "THROW_EXCEPTION";
+    this.nodeProvider = fe.wrap(e), this.strategy = t || "THROW_EXCEPTION";
   }
   /**
    * Extends a node with its resolved references
@@ -2967,17 +3013,17 @@ class qe {
     }
     try {
       const i = e.getBlueId();
-      if (i && !le.includes(
+      if (i && !X.includes(
         i
       )) {
-        const f = this.fetchNode(e);
-        if (f && f.length > 0)
-          if (f.length === 1) {
-            const v = f[0];
+        const h = this.fetchNode(e);
+        if (h && h.length > 0)
+          if (h.length === 1) {
+            const v = h[0];
             this.mergeNodes(e, v);
           } else {
-            const v = f.map((z) => z.clone()), O = new a().setItems(v);
-            this.mergeNodes(e, O);
+            const v = h.map((q) => q.clone()), k = new a().setItems(v);
+            this.mergeNodes(e, k);
           }
       }
       const o = e.getType();
@@ -2989,14 +3035,14 @@ class qe {
       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);
+      y && Object.entries(y).forEach(([h, v]) => {
+        this.extendNode(v, t, h, !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 d = e.getItems();
+      if (d && d.length > 0) {
+        this.reconstructList(d);
+        for (let h = 0; h < d.length; h++)
+          this.extendNode(d[h], t, String(h), !1);
       }
     } finally {
       n || t.exitPathSegment();
@@ -3031,10 +3077,10 @@ class qe {
   mergeNodes(e, t) {
     e.setName(t.getName()), e.setDescription(t.getDescription()), e.setType(t.getType()), e.setItemType(t.getItemType()), e.setKeyType(t.getKeyType()), e.setValueType(t.getValueType());
     const r = t.getValue();
-    d(r) && e.setValue(r), e.setItems(t.getItems()), e.setProperties(t.getProperties());
+    p(r) && e.setValue(r), e.setItems(t.getItems()), e.setProperties(t.getProperties());
   }
 }
-class Dt {
+class ht {
   blueIdsCollections = [];
   /**
    * Initializes the generator with default BlueIds collections
@@ -3104,7 +3150,7 @@ ${r}`;
     return Object.keys(this.getAllBlueIds()).length;
   }
 }
-class X {
+class ne {
   static DEFAULT_BLUE_BLUE_ID = "6sqUywMoBRyj9hgQxSu2nDPnqcyiSM7xu9AB9sN98YJK";
   processorProvider;
   nodeProvider;
@@ -3118,7 +3164,7 @@ class X {
     const { nodeProvider: t, processorProvider: r, blueIdsMappingGenerator: n } = e;
     if (!t)
       throw new Error("NodeProvider is required");
-    this.nodeProvider = oe.wrap(t), this.processorProvider = r || X.getStandardProvider(), this.blueIdsMappingGenerator = n || new Dt(), this.loadDefaultSimpleBlue();
+    this.nodeProvider = fe.wrap(t), this.processorProvider = r || ne.getStandardProvider(), this.blueIdsMappingGenerator = n || new ht(), this.loadDefaultSimpleBlue();
   }
   /**
    * Preprocesses a document node
@@ -3145,9 +3191,9 @@ class X {
   preprocessWithOptions(e, t) {
     let r = e.clone(), n = r.getBlue();
     if (!n && t && (n = t.clone()), n) {
-      new qe(this.nodeProvider).extend(
+      new ft(this.nodeProvider).extend(
         n,
-        Be.withSinglePath("/*")
+        $e.withSinglePath("/*")
       );
       const i = n.getItems();
       if (i && i.length > 0) {
@@ -3162,7 +3208,7 @@ class X {
         }
         r.setBlue(void 0);
       }
-      r = new Ns().process(
+      r = new Ks().process(
         r
       );
     }
@@ -3177,11 +3223,11 @@ class X {
       getProcessor(e) {
         const t = "27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo", r = "FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4", n = e.getType()?.getBlueId();
         if (t === n)
-          return new ve(
+          return new Ce(
             e
           );
         if (r === n)
-          return new Bs();
+          return new ks();
       }
     };
   }
@@ -3201,40 +3247,55 @@ ${t}
    * Loads the default simple Blue node
    */
   loadDefaultSimpleBlue() {
-    const e = this.enrichDefaultBlue(Vt);
     try {
-      const t = F(e);
+      const e = this.enrichDefaultBlue(Xt), t = $(e);
       if (t)
         this.defaultSimpleBlue = g.deserialize(t);
       else
         throw new Error("Failed to parse default Blue content");
-    } catch (t) {
-      throw new Error(`Error loading default Blue: ${t}`);
+    } catch (e) {
+      throw new Error(`Error loading default Blue: ${e}`);
     }
   }
 }
-class Ps extends Ct {
+class yt extends qt {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   preprocessor;
   constructor(e) {
     super();
-    const t = new X({ nodeProvider: this });
-    this.preprocessor = (r) => t.preprocessWithDefaultBlue(r), this.loadRepositories(e);
+    const t = new ht(), r = yt.collectAliasMappings(e);
+    Object.keys(r).length > 0 && t.registerBlueIds(r);
+    const n = new ne({
+      nodeProvider: this,
+      blueIdsMappingGenerator: t
+    });
+    this.preprocessor = (i) => n.preprocessWithDefaultBlue(i), this.loadRepositories(e);
+  }
+  static collectAliasMappings(e) {
+    const t = {};
+    for (const r of e)
+      for (const n of Object.values(r.packages))
+        for (const [i, o] of Object.entries(n.aliases)) {
+          const l = t[i];
+          if (l && l !== o)
+            throw new Error(`Conflicting alias mapping for ${i}`);
+          t[i] = o;
+        }
+    return t;
   }
   loadRepositories(e) {
     for (const t of e)
-      if (t.contents)
-        for (const [r, n] of Object.entries(
-          t.contents
-        ))
-          this.processContent(n, r);
+      Object.values(t.packages).forEach((r) => {
+        for (const [n, i] of Object.entries(r.contents))
+          this.processContent(i, n);
+      });
   }
   processContent(e, t) {
     Array.isArray(e) ? this.processMultipleDocuments(e, t) : this.processSingleDocument(e, t);
   }
   processSingleDocument(e, t) {
-    const r = g.deserialize(e), n = x.parseAndCalculateBlueIdForNode(
+    const r = g.deserialize(e), n = z.parseAndCalculateBlueIdForNode(
       r,
       this.preprocessor
     ), i = t || n.blueId;
@@ -3246,21 +3307,20 @@ class Ps extends Ct {
     const r = e.map((o) => {
       const l = g.deserialize(o);
       return this.preprocessor(l);
-    }), n = x.parseAndCalculateBlueIdForNodeList(
+    }), n = z.parseAndCalculateBlueIdForNodeList(
       r,
       (o) => o
-      // Already preprocessed above
     ), i = t || n.blueId;
     this.blueIdToContentMap.set(i, n.content), this.blueIdToMultipleDocumentsMap.set(i, !0), r.forEach((o, l) => {
       const c = `${i}#${l}`, u = m.get(o), y = T.calculateBlueIdSync(o);
       this.blueIdToContentMap.set(y, u), this.blueIdToMultipleDocumentsMap.set(y, !1);
-      const p = o.getName();
-      p && this.addToNameMap(p, c);
+      const d = o.getName();
+      d && this.addToNameMap(d, c);
     });
   }
   fetchContentByBlueId(e) {
     const t = this.blueIdToContentMap.get(e), r = this.blueIdToMultipleDocumentsMap.get(e);
-    return t !== void 0 && r !== void 0 ? x.resolveThisReferences(
+    return t !== void 0 && r !== void 0 ? z.resolveThisReferences(
       t,
       e,
       r
@@ -3280,7 +3340,7 @@ class Ps extends Ct {
     return this.blueIdToContentMap.has(t);
   }
 }
-class oe {
+class fe {
   /**
    * Wraps a NodeProvider with a SequentialNodeProvider that includes bootstrap providers and repository definitions
    * @param originalProvider - The original NodeProvider to wrap
@@ -3288,15 +3348,15 @@ class oe {
    * @returns A wrapped NodeProvider that includes bootstrap providers and repository definitions
    */
   static wrap(e, t) {
-    const r = [We.INSTANCE];
+    const r = [pt.INSTANCE];
     if (t && t.length > 0) {
-      const n = new Ps(t);
+      const n = new yt(t);
       r.push(n);
     }
-    return r.push(e), new us(r);
+    return r.push(e), new Ds(r);
   }
 }
-class Es {
+class Ys {
   preprocessingAliases = /* @__PURE__ */ new Map();
   urlContentFetcher;
   /**
@@ -3320,9 +3380,9 @@ class Es {
       const r = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(r, t);
-      if (me.isPotentialBlueId(t))
+      if (Se.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      throw pe(t) ? new Error(
+      throw we(t) ? new Error(
         `URL '${t}' detected. Use the async version of this method to fetch the content.`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -3340,9 +3400,9 @@ class Es {
       const r = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(r, t);
-      if (me.isPotentialBlueId(t))
+      if (Se.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      if (pe(t) && this.urlContentFetcher)
+      if (we(t) && this.urlContentFetcher)
         try {
           const n = await this.fetchFromUrl(t);
           return n && r.setBlue(new a().setItems(n)), r;
@@ -3352,7 +3412,7 @@ class Es {
 ${n.message}`
           ) : n;
         }
-      else throw pe(t) ? new Error(
+      else throw we(t) ? new Error(
         `UrlContentFetcher not provided for URL: ${t}`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -3438,24 +3498,24 @@ ${n.message}`
     return this.urlContentFetcher;
   }
 }
-const Ss = {
+const zs = {
   fetchUrl: async (s) => {
     throw new Error(
       `You must provide a custom UrlFetchStrategy to fetch content from URL: ${s}`
     );
   }
 };
-class As {
+class Gs {
   // Cache to avoid repeated network requests for the same URL
   cache = /* @__PURE__ */ new Map();
   fetchStrategy;
   enabled = !1;
   allowedDomains = [];
   constructor(e) {
-    this.fetchStrategy = e || Ss;
+    this.fetchStrategy = e || zs;
   }
   validateUrl(e) {
-    if (!pe(e))
+    if (!we(e))
       throw new Error(`Invalid URL: ${e}`);
     return !0;
   }
@@ -3494,7 +3554,7 @@ class As {
     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 = F(r);
+      i = $(r);
     else
       throw new Error(`Unsupported content type from URL: ${n}`);
     if (i === void 0)
@@ -3574,7 +3634,7 @@ class As {
     return this.allowedDomains = [], this;
   }
 }
-class Vs {
+class Js {
   /**
    * Resolves a node without limits
    * Default implementation that uses NO_LIMITS
@@ -3583,10 +3643,10 @@ class Vs {
    * @returns The resolved node using NO_LIMITS
    */
   resolveWithoutLimits(e) {
-    return this.resolve(e, R);
+    return this.resolve(e, K);
   }
 }
-class Cs extends Vs {
+class Zs extends Js {
   mergingProcessor;
   nodeProvider;
   /**
@@ -3595,7 +3655,7 @@ class Cs extends Vs {
    * @param nodeProvider - The provider to use for resolving nodes
    */
   constructor(e, t) {
-    super(), this.mergingProcessor = e, this.nodeProvider = oe.wrap(t);
+    super(), this.mergingProcessor = e, this.nodeProvider = fe.wrap(t);
   }
   /**
    * Merges a source node into a target node with the given limits
@@ -3605,17 +3665,17 @@ class Cs extends Vs {
    * @returns A new BlueNode with the merged content
    */
   merge(e, t, r) {
-    if (d(t.getBlue()))
+    if (p(t.getBlue()))
       throw new Error(
         'Document contains "blue" attribute. Preprocess document before merging.'
       );
     let n = e;
     const i = t.getType();
-    if (d(i)) {
+    if (p(i)) {
       const o = i.clone();
-      d(o.getBlueId()) && new qe(this.nodeProvider).extend(
+      p(o.getBlueId()) && new ft(this.nodeProvider).extend(
         o,
-        Be.withSinglePath("/")
+        $e.withSinglePath("/")
       );
       const l = this.resolve(o, r), c = t.clone().setType(l);
       return n = this.merge(n, o, r), this.mergeObject(n, c, r);
@@ -3636,11 +3696,11 @@ class Cs extends Vs {
       this.nodeProvider
     );
     const i = t.getItems();
-    d(i) && (n = this.mergeChildren(n, i, r));
+    p(i) && (n = this.mergeChildren(n, i, r));
     const o = t.getProperties();
-    return d(o) && Object.entries(o).forEach(([l, c]) => {
+    return p(o) && Object.entries(o).forEach(([l, c]) => {
       r.shouldMergePathSegment(l, c) && (r.enterPathSegment(l, c), n = this.mergeProperty(n, l, c, r), r.exitPathSegment());
-    }), d(t.getBlueId()) && (n = n.clone().setBlueId(t.getBlueId())), this.mergingProcessor.postProcess && (n = this.mergingProcessor.postProcess(
+    }), p(t.getBlueId()) && (n = n.clone().setBlueId(t.getBlueId())), this.mergingProcessor.postProcess && (n = this.mergingProcessor.postProcess(
       n,
       t,
       this.nodeProvider
@@ -3715,10 +3775,10 @@ class Cs extends Vs {
    */
   resolve(e, t) {
     const r = new a(), i = this.merge(r, e, t).clone().setName(e.getName()).setDescription(e.getDescription()).setBlueId(e.getBlueId());
-    return new ie(i);
+    return new pe(i);
   }
 }
-class Ft {
+class er {
   mergingProcessors;
   /**
    * Creates a new SequentialMergingProcessor with the given processors
@@ -3743,14 +3803,14 @@ class Ft {
     return this.mergingProcessors.reduce((n, i) => i.postProcess ? i.postProcess(n, t, r) : n, e);
   }
 }
-class Ot {
+class tr {
   process(e, t) {
     const r = t.getValue();
-    if (d(r)) {
+    if (p(r)) {
       const n = e.getValue();
       if (I(n))
         return e.clone().setValue(r);
-      if (!Ms(r, n))
+      if (!Hs(r, n))
         throw new Error(
           `Node values conflict. Source node value: ${r}, target node value: ${n}`
         );
@@ -3758,8 +3818,8 @@ class Ot {
     return e;
   }
 }
-const Ms = (s, e) => L(s) && L(e) || De(s) && De(e) ? s.eq(e) : s === e;
-class Rt {
+const Hs = (s, e) => H(s) && H(e) || Ge(s) && Ge(e) ? s.eq(e) : s === e;
+class rr {
   process(e, t, r) {
     const n = e.getType(), i = t.getType();
     let o = e;
@@ -3785,10 +3845,10 @@ class Rt {
     return o;
   }
 }
-class $t {
+class sr {
   process(e, t, r) {
     const n = t.getItemType(), i = t.getType();
-    if (n !== void 0 && i !== void 0 && !Nt(i, r))
+    if (n !== void 0 && i !== void 0 && !Gt(i, r))
       throw new Error("Source node with itemType must have a List type");
     const o = e.getItemType();
     let l = e;
@@ -3800,12 +3860,12 @@ class $t {
         o,
         r
       )) {
-        const p = m.get(n), f = m.get(o);
+        const d = m.get(n), h = m.get(o);
         throw new Error(
           `The source item type '${JSON.stringify(
-            p
+            d
           )}' is not a subtype of the target item type '${JSON.stringify(
-            f
+            h
           )}'.`
         );
       }
@@ -3814,18 +3874,18 @@ class $t {
     const c = l.getItemType(), u = t.getItems();
     if (c !== void 0 && u !== void 0)
       for (const y of u) {
-        const p = y.getType();
-        if (p !== void 0 && !b(
-          p,
+        const d = y.getType();
+        if (d !== void 0 && !b(
+          d,
           c,
           r
         )) {
-          const f = m.get(p), v = m.get(
+          const h = m.get(d), v = m.get(
             c
           );
           throw new Error(
             `Item of type '${JSON.stringify(
-              f
+              h
             )}' is not a subtype of the list's item type '${JSON.stringify(
               v
             )}'.`
@@ -3835,18 +3895,18 @@ class $t {
     return l;
   }
 }
-class xt {
+class nr {
   process(e, t, r) {
     const n = t.getKeyType(), i = t.getValueType(), o = t.getType();
-    if ((n !== void 0 || i !== void 0) && o !== void 0 && !Pt(o, r))
+    if ((n !== void 0 || i !== void 0) && o !== void 0 && !Jt(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 c = l.getKeyType(), u = l.getValueType(), y = t.getProperties();
-    return (c !== void 0 || u !== void 0) && y !== void 0 && Object.entries(y).forEach(([p, f]) => {
-      c !== void 0 && this.validateKeyType(p, c, r), u !== void 0 && this.validateValueType(f, u, r);
+    return (c !== void 0 || u !== void 0) && y !== void 0 && Object.entries(y).forEach(([d, h]) => {
+      c !== void 0 && this.validateKeyType(d, c, r), u !== void 0 && this.validateValueType(h, u, r);
     }), l;
   }
   processKeyType(e, t, r) {
@@ -3898,20 +3958,20 @@ class xt {
     return e;
   }
   validateBasicKeyType(e, t) {
-    if (!Ur(e, t))
+    if (!ss(e, t))
       throw new Error("Dictionary key type must be a basic type");
   }
   validateKeyType(e, t, r) {
-    if (!_r(t, r))
-      if (Kr(t, r)) {
+    if (!ns(t, r))
+      if (is(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 (Yr(t, r)) {
+      } else if (os(t, r)) {
         const n = Number.parseFloat(e);
         if (Number.isNaN(n))
           throw new Error(`Key '${e}' is not a valid Number.`);
-      } else if (Gr(t, r)) {
+      } else if (ls(t, r)) {
         if (e.toLowerCase() !== "true" && e.toLowerCase() !== "false")
           throw new Error(`Key '${e}' is not a valid Boolean.`);
       } else
@@ -3933,16 +3993,16 @@ class xt {
     }
   }
 }
-class jt {
+class ir {
   process(e) {
     return e;
   }
   postProcess(e, t, r) {
     const n = e.getType();
-    if (n !== void 0 && zr(n, r)) {
+    if (n !== void 0 && cs(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 = kr(
+        const l = as(
           n,
           r
         ), c = n.getName() || "unknown";
@@ -3954,7 +4014,7 @@ class jt {
     return e;
   }
 }
-class Lt {
+class or {
   process(e, t) {
     let r = e;
     const n = t.getName(), i = e.getName();
@@ -3963,32 +4023,32 @@ class Lt {
     return o !== void 0 && l === void 0 && (r = r.clone().setDescription(o)), r;
   }
 }
-const hn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const ti = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BasicTypesVerifier: jt,
-  DictionaryProcessor: xt,
-  ListProcessor: $t,
-  MetadataPropagator: Lt,
-  SequentialMergingProcessor: Ft,
-  TypeAssigner: Rt,
-  ValuePropagator: Ot
+  BasicTypesVerifier: ir,
+  DictionaryProcessor: nr,
+  ListProcessor: sr,
+  MetadataPropagator: or,
+  SequentialMergingProcessor: er,
+  TypeAssigner: rr,
+  ValuePropagator: tr
 }, Symbol.toStringTag, { value: "Module" }));
-function Ds() {
-  return new Ft([
-    new Ot(),
-    new Rt(),
-    new $t(),
-    new xt(),
-    new Lt(),
-    new jt()
+function Ws() {
+  return new er([
+    new tr(),
+    new rr(),
+    new sr(),
+    new nr(),
+    new or(),
+    new ir()
   ]);
 }
-class Fs {
+class Xs {
   nodeProvider;
   blueIdToInlineValue = /* @__PURE__ */ new Map();
   constructor(e) {
     const { nodeProvider: t, blueIdsMappingGenerator: r } = e;
-    this.nodeProvider = t, Object.entries(gt).forEach(([i, o]) => {
+    this.nodeProvider = t, Object.entries(xe).forEach(([i, o]) => {
       this.blueIdToInlineValue.set(i, o);
     });
     const n = r.getAllBlueIds();
@@ -4000,7 +4060,7 @@ class Fs {
    * Returns a new BlueNode where all type references are restored to inline values when possible.
    */
   restore(e) {
-    return E.transform(
+    return w.transform(
       e,
       (t) => this.restoreNode(t)
     );
@@ -4049,15 +4109,692 @@ class Fs {
       return this.blueIdToInlineValue.set(e, o), o;
   }
 }
-class fn {
+class qs {
+  runtimes;
+  contents;
+  aliases;
+  constructor(e) {
+    const t = [];
+    for (const r of e)
+      t.push(Qs(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);
+  }
+  getRuntimes() {
+    return this.runtimes;
+  }
+  getAliases() {
+    return this.aliases;
+  }
+  getContents() {
+    return this.contents;
+  }
+  findRuntimeByName(e) {
+    return this.runtimes.find((t) => t.name === e);
+  }
+  toCurrentBlueId(e) {
+    for (const t of this.runtimes) {
+      const r = t.toCurrentBlueIdIndex[e];
+      if (r)
+        return r;
+    }
+    return e;
+  }
+  getTypeAlias(e) {
+    const t = this.toCurrentBlueId(e), r = xe[t];
+    if (r)
+      return r;
+    for (const n of this.runtimes) {
+      const i = n.typeAliasByCurrentBlueId[t];
+      if (i)
+        return i;
+    }
+  }
+  findRuntimeByBlueId(e) {
+    const t = this.toCurrentBlueId(e);
+    for (const r of this.runtimes) {
+      const n = r.types[t];
+      if (n)
+        return {
+          runtime: r,
+          currentBlueId: t,
+          typeMeta: n,
+          typeAlias: r.typeAliasByCurrentBlueId[t]
+        };
+    }
+  }
+}
+function Qs(s) {
+  const e = en(s);
+  return Object.values(s.packages).forEach((t) => {
+    tn(e, s, t);
+  }), {
+    name: s.name,
+    repositoryVersions: s.repositoryVersions,
+    repoVersionIndexById: e.repoVersionIndexById,
+    aliases: e.aliases,
+    types: e.types,
+    toCurrentBlueIdIndex: e.toCurrentBlueIdIndex,
+    contents: e.contents,
+    schemas: e.schemas,
+    currentRepoBlueId: e.currentRepoBlueId,
+    typeAliasByCurrentBlueId: e.typeAliasByCurrentBlueId,
+    typePackageByCurrentBlueId: e.typePackageByCurrentBlueId
+  };
+}
+function en(s) {
+  const e = Object.fromEntries(
+    s.repositoryVersions.map((r, n) => [r, n])
+  ), t = s.repositoryVersions[s.repositoryVersions.length - 1];
+  return {
+    aliases: {},
+    types: {},
+    toCurrentBlueIdIndex: {},
+    contents: {},
+    schemas: [],
+    typeAliasByCurrentBlueId: {},
+    typePackageByCurrentBlueId: {},
+    packageNames: /* @__PURE__ */ new Set(),
+    repoVersionIndexById: e,
+    currentRepoBlueId: t
+  };
+}
+function tn(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);
+}
+function rn(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) {
+  Object.entries(t.typesMeta).forEach(([r, n]) => {
+    if (s.types[r])
+      throw new Error(`Duplicate type mapping for BlueId ${r}`);
+    const i = ln(
+      n,
+      e,
+      r,
+      t.name
+    );
+    if (s.types[r] = i, s.typePackageByCurrentBlueId[r] = t.name, s.typeAliasByCurrentBlueId[r] = `${t.name}/${n.name}`, i.status === le && !s.toCurrentBlueIdIndex[r] && (s.toCurrentBlueIdIndex[r] = r), i.status === le)
+      for (const o of i.versions) {
+        const l = s.toCurrentBlueIdIndex[o.typeBlueId];
+        if (l && l !== r)
+          throw new Error(
+            `Conflicting toCurrentBlueIdIndex mapping for ${o.typeBlueId}`
+          );
+        s.toCurrentBlueIdIndex[o.typeBlueId] = r;
+      }
+  });
+}
+function nn(s, e) {
+  Object.entries(e.contents).forEach(([t, r]) => {
+    s.contents[t] = r;
+  });
+}
+function on(s, e) {
+  s.schemas.push(...Object.values(e.schemas));
+}
+function ln(s, e, t, r) {
+  if (s.status === tt)
+    return cn(s, e, t, r), {
+      ...s,
+      versions: s.versions ? [...s.versions] : s.versions
+    };
+  const n = [...s.versions ?? []].sort(
+    (o, l) => o.repositoryVersionIndex - l.repositoryVersionIndex
+  );
+  if (n.length === 0)
+    throw new Error(
+      `Stable type ${r}/${s.name} (${t}) must have at least one version entry`
+    );
+  const i = /* @__PURE__ */ new Set();
+  return n.forEach((o) => {
+    if (o.repositoryVersionIndex < 0 || o.repositoryVersionIndex >= e.repositoryVersions.length)
+      throw new Error(
+        `Invalid repositoryVersionIndex ${o.repositoryVersionIndex} for ${r}/${s.name}`
+      );
+    if (i.has(o.repositoryVersionIndex))
+      throw new Error(
+        `Duplicate repositoryVersionIndex ${o.repositoryVersionIndex} for ${r}/${s.name}`
+      );
+    i.add(o.repositoryVersionIndex);
+    for (const l of o.attributesAdded ?? [])
+      an(
+        l,
+        e.name,
+        t,
+        o.repositoryVersionIndex
+      );
+  }), {
+    ...s,
+    versions: n
+  };
+}
+function cn(s, e, t, r) {
+  if (s.status === tt) {
+    if (s.versions && s.versions.length > 1)
+      throw new Error(
+        `Dev type ${r}/${s.name} (${t}) must not declare multiple versions`
+      );
+    if (s.versions && s.versions.length === 1) {
+      const n = s.versions[0];
+      if (n.repositoryVersionIndex < 0 || n.repositoryVersionIndex >= e.repositoryVersions.length)
+        throw new Error(
+          `Invalid repositoryVersionIndex ${n.repositoryVersionIndex} for dev type ${r}/${s.name}`
+        );
+    }
+  }
+}
+function an(s, e, t, r) {
+  try {
+    Tr(s);
+  } catch (n) {
+    const i = n instanceof Error ? n.message : "Unknown error";
+    throw new Error(
+      `Invalid attributesAdded pointer '${s}' for type ${t} in repository ${e} at index ${r}: ${i}`
+    );
+  }
+}
+function un(s, e, t) {
+  for (const [r, n] of Object.entries(e)) {
+    const i = s[r];
+    if (i && i !== n)
+      throw new Error(
+        `Conflicting alias '${r}' across repositories: '${i}' vs '${n}' (from ${t})`
+      );
+    s[r] = n;
+  }
+}
+function dn(s, e, t) {
+  for (const [r, n] of Object.entries(e)) {
+    if (r in s) {
+      const i = s[r];
+      if (!pn(i, n))
+        throw new Error(
+          `Conflicting content for BlueId '${r}' across repositories (from ${t})`
+        );
+      continue;
+    }
+    s[r] = n;
+  }
+}
+function pn(s, e) {
+  if (s === e) return !0;
+  if (s === null || e === null || typeof s != "object" || typeof e != "object") return !1;
+  const t = Je.canonicalize(s), r = Je.canonicalize(e);
+  return t !== void 0 && t === r;
+}
+class Re extends Error {
+  code;
+  details;
+  constructor(e, t, r) {
+    super(t), this.code = e, this.details = r && r.length > 0 ? r : [], this.name = "BlueError";
+  }
+}
+const D = {
+  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"
+}, fn = /* @__PURE__ */ new Set([
+  "__proto__",
+  "constructor",
+  "prototype"
+]);
+function bt(s) {
+  const e = s.at(0), t = s.at(-1);
+  return !e || !t ? s : e === "'" && t === "'" || e === '"' && t === '"' ? s.slice(1, -1) : s;
+}
+function hn(s, e) {
+  const t = s.indexOf("=");
+  if (t === -1)
+    throw re(e, `Missing '=' in segment '${s.trim()}'`);
+  if (s.indexOf("=", t + 1) !== -1)
+    throw re(e, `Unexpected '=' in segment '${s.trim()}'`);
+  const r = bt(s.slice(0, t).trim()), n = bt(s.slice(t + 1).trim());
+  if (!r)
+    throw re(e, "Repository name is empty");
+  if (!n)
+    throw re(e, `Repository BlueId is empty for '${r}'`);
+  return { name: r, value: n };
+}
+function yn(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 } = hn(r, s);
+    mn(n, s), e[n] = i;
+  }
+  return e;
+}
+function gn(s) {
+  return typeof s == "string" ? yn(s) : s;
+}
+function re(s, e) {
+  return new Re(
+    D.INVALID_BLUE_CONTEXT_REPOSITORIES,
+    `Invalid BlueContext repositories value: ${e}`,
+    [
+      {
+        code: D.INVALID_BLUE_CONTEXT_REPOSITORIES,
+        message: e,
+        locationPath: [],
+        context: {
+          rawRepositories: s,
+          reason: e
+        }
+      }
+    ]
+  );
+}
+function mn(s, e) {
+  if (fn.has(s))
+    throw re(e, `Forbidden repository name '${s}'`);
+}
+function In(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) => wt(l) - wt(o)
+    );
+    r.push(...i);
+  }
+  return r;
+}
+function wt(s) {
+  return Rt(s).length;
+}
+const Tn = /* @__PURE__ */ new Set([...rt]), B = {
+  core: "core",
+  noRuntime: "no-runtime",
+  noTargetContext: "no-target-context",
+  representable: "representable",
+  unrepresentable: "unrepresentable"
+};
+class vn {
+  registry;
+  targetRepoVersionIndexes;
+  fallbackToCurrentInlineDefinitions;
+  inliningStack = /* @__PURE__ */ new Set();
+  constructor(e) {
+    this.registry = e.registry, this.targetRepoVersionIndexes = e.targetRepoVersionIndexes, this.fallbackToCurrentInlineDefinitions = e.fallbackToCurrentInlineDefinitions;
+  }
+  transform(e) {
+    return w.transform(
+      e,
+      (t) => this.transformNode(t)
+    );
+  }
+  transformNode(e) {
+    return this.processTypeReference(e, {
+      getter: () => e.getType(),
+      setter: (t) => e.setType(t),
+      schemaTraversalTargets: [e]
+    }), this.processTypeReference(e, {
+      getter: () => e.getItemType(),
+      setter: (t) => e.setItemType(t),
+      schemaTraversalTargets: e.getItems() ?? []
+    }), this.processTypeReference(e, {
+      getter: () => e.getKeyType(),
+      setter: (t) => e.setKeyType(t),
+      schemaTraversalTargets: []
+    }), this.processTypeReference(e, {
+      getter: () => e.getValueType(),
+      setter: (t) => e.setValueType(t),
+      schemaTraversalTargets: this.getDictionaryValueTargets(e)
+    }), e;
+  }
+  processTypeReference(e, t) {
+    const r = t.getter(), n = r?.getBlueId();
+    if (!r || !n)
+      return;
+    const i = this.resolveType(n);
+    switch (i.kind) {
+      case B.core: {
+        r.setBlueId(i.blueId);
+        return;
+      }
+      case B.representable: {
+        this.applyDropPointers([r], i.dropPointers, {
+          rootIsSchema: !0
+        }), this.applyDropPointers(
+          t.schemaTraversalTargets,
+          i.dropPointers
+        ), r.setBlueId(i.targetBlueId);
+        return;
+      }
+      case B.noRuntime:
+      case B.noTargetContext:
+      case B.unrepresentable: {
+        if (this.fallbackToCurrentInlineDefinitions) {
+          this.inlineDefinition(e, t.setter, n);
+          return;
+        }
+        throw i.kind === B.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,
+          void 0,
+          i.kind === B.noTargetContext ? i.typeAlias : void 0
+        );
+      }
+    }
+  }
+  resolveType(e) {
+    if (X.includes(e))
+      return { kind: B.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 };
+    const i = this.targetRepoVersionIndexes[n.runtime.name];
+    if (i === void 0)
+      return {
+        kind: B.noTargetContext,
+        currentBlueId: t,
+        runtimeName: n.runtime.name,
+        runtime: n.runtime,
+        meta: n.typeMeta,
+        typeAlias: r
+      };
+    const o = n.typeMeta;
+    if (o.status === tt) {
+      const d = n.runtime.repositoryVersions.length - 1;
+      if (i !== d)
+        return {
+          kind: B.unrepresentable,
+          currentBlueId: t,
+          error: this.unrepresentableError(
+            t,
+            `Dev type cannot be represented at repository version index ${i}.`,
+            n.runtime,
+            o,
+            i,
+            r
+          )
+        };
+      const h = o.versions?.[0];
+      return {
+        kind: B.representable,
+        currentBlueId: t,
+        targetBlueId: h?.typeBlueId ?? t,
+        dropPointers: []
+      };
+    }
+    const l = o.versions || [];
+    if (l.length === 0)
+      return {
+        kind: B.unrepresentable,
+        currentBlueId: t,
+        error: this.unrepresentableError(
+          t,
+          `Stable type metadata missing versions for ${t}.`,
+          n.runtime,
+          o,
+          i,
+          r
+        )
+      };
+    const c = l[0].repositoryVersionIndex;
+    if (i < c)
+      return {
+        kind: B.unrepresentable,
+        currentBlueId: t,
+        error: this.unrepresentableError(
+          t,
+          `Type introduced after target repository version index ${i}.`,
+          n.runtime,
+          o,
+          i,
+          r
+        )
+      };
+    let u = l[0].typeBlueId;
+    for (const d of l)
+      d.repositoryVersionIndex <= i && (u = d.typeBlueId);
+    const y = o.status === le ? this.getDropPointers(o, i) : [];
+    return {
+      kind: B.representable,
+      currentBlueId: t,
+      targetBlueId: u,
+      dropPointers: y
+    };
+  }
+  getDropPointers(e, t) {
+    return e.status !== le ? [] : In(e.versions, t);
+  }
+  applyDropPointers(e, t, r = {}) {
+    if (e.length === 0 || t.length === 0)
+      return;
+    const n = r.rootIsSchema ?? !1;
+    for (const i of t)
+      for (const o of e)
+        this.deletePropertyAtPointer(o, i, n);
+  }
+  getDictionaryValueTargets(e) {
+    const t = e.getProperties();
+    return t ? Object.entries(t).filter(
+      ([r, n]) => n instanceof a && !Tn.has(r)
+    ).map(([, r]) => r) : [];
+  }
+  deletePropertyAtPointer(e, t, r) {
+    let n;
+    try {
+      n = Rt(t);
+    } catch {
+      throw this.invalidPointerError(t);
+    }
+    this.applyPointerSegments(e, n, r);
+  }
+  applyPointerSegments(e, t, r) {
+    if (t.length === 0)
+      return;
+    const [n, ...i] = t;
+    if (n === Z) {
+      const c = e.getType();
+      c && this.applyPointerSegments(c, i, !0);
+      return;
+    }
+    if (n === he) {
+      const c = e.getItemType();
+      c && this.applyPointerSegments(c, i, !0);
+      return;
+    }
+    if (n === ye) {
+      const c = e.getKeyType();
+      c && this.applyPointerSegments(c, i, !0);
+      return;
+    }
+    if (n === ge) {
+      const c = e.getValueType();
+      c && this.applyPointerSegments(c, i, !0);
+      return;
+    }
+    const o = e.getProperties();
+    if (!o)
+      return;
+    if (i.length === 0) {
+      if (!r || !(n in o))
+        return;
+      const c = { ...o };
+      delete c[n], e.setProperties(c);
+      return;
+    }
+    const l = o[n];
+    l instanceof a && this.applyPointerSegments(l, i, r);
+  }
+  inlineDefinition(e, t, r) {
+    const n = this.registry.toCurrentBlueId(r);
+    if (this.inliningStack.has(n))
+      throw this.unrepresentableError(
+        n,
+        "Cycle detected while inlining type.",
+        void 0,
+        void 0,
+        void 0,
+        void 0,
+        {
+          cycle: Array.from(this.inliningStack).concat(n)
+        }
+      );
+    const i = this.registry.getContents()[n];
+    if (!i)
+      throw this.unrepresentableError(
+        n,
+        `Missing definition to inline for BlueId ${n}.`
+      );
+    this.inliningStack.add(n);
+    try {
+      const o = g.deserialize(i);
+      o.setBlueId(void 0);
+      const l = w.transform(
+        o,
+        (c) => this.transformNode(c)
+      );
+      return t(l), e;
+    } finally {
+      this.inliningStack.delete(n);
+    }
+  }
+  invalidPointerError(e) {
+    const t = `Invalid attributesAdded pointer '${e}'.`;
+    return new Re(D.INVALID_REPOSITORY_POINTER, t, [
+      {
+        code: D.INVALID_REPOSITORY_POINTER,
+        message: t,
+        locationPath: [],
+        context: { pointer: e }
+      }
+    ]);
+  }
+  unrepresentableError(e, t, r, n, i, o, l) {
+    const c = {
+      currentTypeBlueId: e,
+      targetRepoVersionIndex: i,
+      typeAlias: o,
+      ...l
+    };
+    if (r && (i !== void 0 && (c.requestedRepoBlueId = r.repositoryVersions[i]), c.serverRepoBlueId = r.currentRepoBlueId), n && n.status === le) {
+      const y = n.versions?.[0]?.repositoryVersionIndex;
+      y !== void 0 && (c.typeIntroducedInRepoBlueId = r?.repositoryVersions[y]);
+    }
+    const u = {
+      code: D.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
+      message: t,
+      locationPath: [Z],
+      context: c
+    };
+    return new Re(
+      D.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
+      t,
+      [u]
+    );
+  }
+}
+function Xe(s, e) {
+  return e ? w.transform(s, (t) => (ve(
+    () => t.getType(),
+    (r) => t.setType(r),
+    e
+  ), ve(
+    () => t.getItemType(),
+    (r) => t.setItemType(r),
+    e
+  ), ve(
+    () => t.getKeyType(),
+    (r) => t.setKeyType(r),
+    e
+  ), ve(
+    () => t.getValueType(),
+    (r) => t.setValueType(r),
+    e
+  ), t)) : s;
+}
+function ve(s, e, t) {
+  const r = s();
+  if (!r || r.isInlineValue())
+    return;
+  const n = r.getBlueId();
+  if (!n)
+    return;
+  const i = t.toCurrentBlueId(n);
+  i !== n && e(r.clone().setBlueId(i));
+}
+class Bn {
+  registry;
+  blueIdMapper;
+  constructor(e) {
+    this.registry = e.registry, this.blueIdMapper = e.blueIdMapper;
+  }
+  transform(e, t) {
+    const r = this.computeTargetRepoVersionIndexes(t);
+    if (Object.keys(r).length === 0)
+      return e;
+    const n = Xe(e, this.blueIdMapper);
+    return new vn({
+      registry: this.registry,
+      targetRepoVersionIndexes: r,
+      fallbackToCurrentInlineDefinitions: t.fallbackToCurrentInlineDefinitions !== !1
+    }).transform(n);
+  }
+  computeTargetRepoVersionIndexes(e) {
+    const t = {};
+    if (!e?.repositories)
+      return t;
+    const r = typeof e.repositories == "string" ? gn(e.repositories) : e.repositories;
+    for (const [n, i] of Object.entries(r)) {
+      const o = this.registry.findRuntimeByName(n);
+      if (!o)
+        continue;
+      const l = o.repoVersionIndexById[i];
+      if (l === void 0)
+        throw this.unknownRepoBlueIdError(
+          n,
+          i,
+          o.currentRepoBlueId
+        );
+      t[n] = l;
+    }
+    return t;
+  }
+  unknownRepoBlueIdError(e, t, r) {
+    const n = `Unknown RepoBlueId '${t}' for repository '${e}'.`, i = {
+      code: D.REPO_UNKNOWN_REPO_BLUE_ID,
+      message: n,
+      locationPath: [],
+      context: {
+        repoName: e,
+        requestedRepoBlueId: t,
+        serverRepoBlueId: r
+      }
+    };
+    return new Re(D.REPO_UNKNOWN_REPO_BLUE_ID, n, [
+      i
+    ]);
+  }
+}
+class ri {
   nodeProvider;
   typeSchemaResolver;
   blueDirectivePreprocessor;
   urlContentFetcher;
   blueIdsMappingGenerator;
-  globalLimits = R;
+  globalLimits = K;
   mergingProcessor;
   repositories;
+  repositoryRegistry;
+  blueContextResolver;
   constructor(e = {}) {
     const {
       nodeProvider: t,
@@ -4066,34 +4803,50 @@ class fn {
       repositories: i,
       mergingProcessor: o
     } = e;
-    this.repositories = i;
-    const l = as(() => []);
-    if (this.nodeProvider = oe.wrap(
+    this.repositories = i, this.repositoryRegistry = new qs(i ?? []), this.blueContextResolver = new Bn({
+      registry: this.repositoryRegistry,
+      blueIdMapper: this.repositoryRegistry
+    });
+    const l = Ps(() => []);
+    this.nodeProvider = fe.wrap(
       t || l,
       i
-    ), this.typeSchemaResolver = r ?? new Jr([], { nodeProvider: this.nodeProvider }), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this.mergingProcessor = o ?? Ds(), this.urlContentFetcher = new As(n), this.blueDirectivePreprocessor = new Es(
+    ), this.typeSchemaResolver = r ?? new us([], {
+      nodeProvider: this.nodeProvider
+    }), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this.mergingProcessor = o ?? Ws(), this.urlContentFetcher = new Gs(n), this.blueDirectivePreprocessor = new Ys(
       void 0,
       this.urlContentFetcher
-    ), this.blueIdsMappingGenerator = new Dt(), i)
-      for (const { schemas: c, blueIds: u } of i)
-        this.typeSchemaResolver?.registerSchemas(c), this.blueIdsMappingGenerator.registerBlueIds(u);
+    ), this.blueIdsMappingGenerator = new ht(), this.blueIdsMappingGenerator.registerBlueIds(
+      this.repositoryRegistry.getAliases()
+    );
+    const c = this.repositoryRegistry.getRuntimes().flatMap((u) => u.schemas);
+    c.length > 0 && this.typeSchemaResolver?.registerSchemas(c);
   }
   /**
    * Converts a BlueNode to a JSON representation based on the specified strategy.
    *
    * @param node - The BlueNode to convert.
-   * @param strategy - The conversion strategy to use. See {@link NodeToMapListOrValue.get} for detailed strategy descriptions.
+   * @param strategyOrOptions - The conversion strategy or options to use. See {@link NodeToMapListOrValue.get} for detailed strategy descriptions.
    * @returns A JSON representation of the node.
    */
   nodeToJson(e, t = "official") {
-    return m.get(e, t);
+    const r = this.normalizeNodeToJsonOptions(t), n = r.blueContext ? this.blueContextResolver.transform(e, r.blueContext) : e;
+    return m.get(n, r.format);
+  }
+  /**
+   * Converts a BlueNode to a deterministic YAML string. Uses nodeToJson under the hood
+   * and then applies stable key ordering (Blue fields first, then alpha) before dumping.
+   */
+  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 });
   }
   nodeToSchemaOutput(e, t) {
-    return new cs(this.typeSchemaResolver).convert(e, t);
+    return new Ns(this.typeSchemaResolver).convert(e, t);
   }
-  resolve(e, t = R) {
+  resolve(e, t = K) {
     const r = this.combineWithGlobalLimits(t);
-    return new Cs(this.mergingProcessor, this.nodeProvider).resolve(e, r);
+    return new Zs(this.mergingProcessor, this.nodeProvider).resolve(e, r);
   }
   /**
    * Wraps an already resolved (merged) BlueNode in a ResolvedBlueNode.
@@ -4104,10 +4857,10 @@ class fn {
    * @returns A new ResolvedBlueNode instance.
    */
   createResolvedNode(e) {
-    return e instanceof ie ? e : new ie(e);
+    return e instanceof pe ? e : new pe(e);
   }
   reverse(e) {
-    return new St().reverse(e);
+    return new Ht().reverse(e);
   }
   /**
    * Returns a copy of the provided node with any referenced types converted back to their
@@ -4117,29 +4870,33 @@ class fn {
    * repository-backed definitions currently known to this {@link Blue} instance.
    */
   restoreInlineTypes(e) {
-    return new Fs({
+    return new Xs({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).restore(e);
   }
   extend(e, t) {
     const r = this.combineWithGlobalLimits(t);
-    new qe(this.nodeProvider).extend(e, r);
+    new ft(this.nodeProvider).extend(e, r);
   }
   jsonValueToNode(e) {
-    return this.preprocess(g.deserialize(e));
+    const t = this.preprocess(g.deserialize(e));
+    return Xe(t, this.repositoryRegistry);
   }
   async jsonValueToNodeAsync(e) {
-    return this.preprocessAsync(g.deserialize(e));
+    const t = await this.preprocessAsync(
+      g.deserialize(e)
+    );
+    return Xe(t, this.repositoryRegistry);
   }
   yamlToNode(e) {
-    const t = F(e);
+    const t = $(e);
     if (!t)
       throw new Error("Failed to parse YAML to JSON");
     return this.jsonValueToNode(t);
   }
   async yamlToNodeAsync(e) {
-    const t = F(e);
+    const t = $(e);
     if (!t)
       throw new Error("Failed to parse YAML to JSON");
     return this.jsonValueToNodeAsync(t);
@@ -4161,26 +4918,26 @@ class fn {
   }
   preprocess(e) {
     const t = this.blueDirectivePreprocessor.process(e);
-    return new X({
+    return new ne({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).preprocessWithDefaultBlue(t);
   }
   async preprocessAsync(e) {
     const t = await this.blueDirectivePreprocessor.processAsync(e);
-    return new X({
+    return new ne({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).preprocessWithDefaultBlue(t);
   }
   transform(e, t) {
-    return E.transform(e, t);
+    return w.transform(e, t);
   }
   getNodeProvider() {
     return this.nodeProvider;
   }
   setNodeProvider(e) {
-    return this.nodeProvider = oe.wrap(
+    return this.nodeProvider = fe.wrap(
       e,
       this.repositories
     ), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this;
@@ -4304,7 +5061,7 @@ class fn {
    * @returns true if the node matches the schema type, false otherwise
    */
   isTypeOf(e, t, r) {
-    return A.isTypeOf(e, t, {
+    return V.isTypeOf(e, t, {
       checkSchemaExtensions: r?.checkSchemaExtensions,
       typeSchemaResolver: this.typeSchemaResolver
     });
@@ -4317,7 +5074,7 @@ class fn {
    * @returns true if the node matches the type, false otherwise.
    */
   isTypeOfNode(e, t) {
-    return new Hr(this).matchesType(e, t, this.globalLimits);
+    return new ps(this).matchesType(e, t, this.globalLimits);
   }
   /**
    * Sets the global limits for this Blue instance.
@@ -4327,7 +5084,7 @@ class fn {
    * @returns This instance for chaining
    */
   setGlobalLimits(e) {
-    return this.globalLimits = e ?? R, this;
+    return this.globalLimits = e ?? K, this;
   }
   /**
    * Gets the current global limits for this Blue instance.
@@ -4337,24 +5094,30 @@ class fn {
   getGlobalLimits() {
     return this.globalLimits;
   }
+  normalizeNodeToJsonOptions(e) {
+    return typeof e == "string" ? { format: e, blueContext: void 0 } : {
+      format: e?.format ?? "official",
+      blueContext: e?.blueContext
+    };
+  }
   combineWithGlobalLimits(e) {
-    return this.globalLimits == R ? e : e == R ? this.globalLimits : Ne.of(this.globalLimits, e);
+    return this.globalLimits == K ? e : e == K ? this.globalLimits : _e.of(this.globalLimits, e);
   }
 }
-class gn extends Ct {
+class si extends qt {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   preprocessor;
   constructor(e = []) {
     super();
-    const t = new X({ nodeProvider: this });
+    const t = new ne({ nodeProvider: this });
     this.preprocessor = (r) => t.preprocessWithDefaultBlue(r), e.forEach((r) => this.processNode(r));
   }
   processNode(e) {
-    Ze.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
+    ut.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
   }
   processSingleNode(e) {
-    const t = x.parseAndCalculateBlueIdForNode(
+    const t = z.parseAndCalculateBlueIdForNode(
       e,
       this.preprocessor
     );
@@ -4369,7 +5132,7 @@ class gn extends Ct {
     const t = e.getItems();
     if (!t) return;
     this.processNodeList(t);
-    const r = x.parseAndCalculateBlueIdForNodeList(
+    const r = z.parseAndCalculateBlueIdForNodeList(
       t,
       this.preprocessor
     );
@@ -4384,7 +5147,7 @@ class gn extends Ct {
   }
   fetchContentByBlueId(e) {
     const t = this.blueIdToContentMap.get(e), r = this.blueIdToMultipleDocumentsMap.get(e);
-    return t !== void 0 && r !== void 0 ? x.resolveThisReferences(
+    return t !== void 0 && r !== void 0 ? z.resolveThisReferences(
       t,
       e,
       r
@@ -4403,7 +5166,7 @@ class gn extends Ct {
    */
   addSingleDocs(...e) {
     e.forEach((t) => {
-      const r = F(t);
+      const r = $(t);
       if (r !== void 0) {
         const n = g.deserialize(r);
         this.processNode(n);
@@ -4446,7 +5209,7 @@ class gn extends Ct {
    * @param doc - The YAML document containing a list
    */
   addListAndItsItemsFromDoc(e) {
-    const t = F(e);
+    const t = $(e);
     if (t !== void 0) {
       const n = g.deserialize(t).getItems();
       n && this.addListAndItsItems(n);
@@ -4468,69 +5231,70 @@ class gn extends Ct {
   }
 }
 export {
-  mr as Base58Sha256Provider,
-  gn as BasicNodeProvider,
-  fn as Blue,
+  Mr as Base58Sha256Provider,
+  si as BasicNodeProvider,
+  ri as Blue,
   T as BlueIdCalculator,
-  Xs as BlueIdToCid,
+  kn as BlueIdToCid,
   a as BlueNode,
-  A as BlueNodeTypeSchema,
-  yr as JsonCanonicalizer,
-  He as Limits,
-  Cs as Merger,
-  hn as MergingProcessors,
-  Vs as NodeResolver,
-  Ze as Nodes,
-  ie as ResolvedBlueNode,
-  Jr as TypeSchemaResolver,
-  Qs as applyBlueNodePatch,
-  we as baseBlueObjectSchema,
-  en as blueDescriptionField,
-  tn as blueIdField,
-  Ys as blueIdSchema,
-  rn as blueNameField,
-  sn as blueNodeField,
-  ks as blueObjectBooleanValueSchema,
-  zs as blueObjectNumberValueSchema,
-  se as blueObjectSchema,
-  Js as blueObjectStringListItemsSchema,
-  Gs as blueObjectStringValueSchema,
-  bs as calculateBlueId,
-  ln as calculateBlueIdSync,
-  rt as enrichWithBlueId,
-  Cr as getBlueDescriptionAnnotation,
-  Fr as getBlueIdAnnotation,
-  Rr as getBlueNameAnnotation,
-  xr as getBlueNodeAnnotation,
-  cn as getBlueObjectItems,
-  un as getBlueObjectProperties,
-  dn as getBlueObjectTypeLabel,
-  an as getBlueObjectValue,
-  Lr as getTypeBlueIdAnnotation,
-  or as hasBlueObjectBlueIdDefined,
-  lr as hasBlueObjectItemsDefined,
-  Hs as hasBlueObjectNameDefined,
-  cr as hasBlueObjectTypeDefined,
-  ar as hasBlueObjectValueDefined,
-  De as isBigDecimalNumber,
-  L as isBigIntegerNumber,
-  S as isBigNumber,
-  Bt as isBlueNodeSchema,
-  Zs as isBlueObject,
-  ws as isBlueObjectResolved,
-  Ws as isGivenBlueObjectTypeSchema,
-  mt as isJsonBlueArray,
-  yt as isJsonBlueObject,
-  qs as isJsonBlueValue,
-  pe as isUrl,
-  Ie as jsonBlueValueSchema,
-  pn as normalizeToBlueObject,
-  st as resolveBlueObjectItems,
-  Vr as withBlueDescription,
-  Dr as withBlueId,
-  Or as withBlueName,
-  $r as withBlueNode,
-  nn as withTypeBlueId,
-  on as yamlBlueDump,
-  F as yamlBlueParse
+  V as BlueNodeTypeSchema,
+  Je as JsonCanonicalizer,
+  dt as Limits,
+  Zs as Merger,
+  ti as MergingProcessors,
+  Js as NodeResolver,
+  ut as Nodes,
+  On as Properties,
+  pe as ResolvedBlueNode,
+  us as TypeSchemaResolver,
+  Kn as applyBlueNodePatch,
+  Fe as baseBlueObjectSchema,
+  Yn as blueDescriptionField,
+  zn as blueIdField,
+  Dn as blueIdSchema,
+  Gn as blueNameField,
+  Jn as blueNodeField,
+  Fn as blueObjectBooleanValueSchema,
+  xn as blueObjectNumberValueSchema,
+  ue as blueObjectSchema,
+  $n as blueObjectStringListItemsSchema,
+  Mn as blueObjectStringValueSchema,
+  js as calculateBlueId,
+  Hn as calculateBlueIdSync,
+  vt as enrichWithBlueId,
+  Jr as getBlueDescriptionAnnotation,
+  Wr as getBlueIdAnnotation,
+  qr as getBlueNameAnnotation,
+  es as getBlueNodeAnnotation,
+  Wn as getBlueObjectItems,
+  qn as getBlueObjectProperties,
+  Qn as getBlueObjectTypeLabel,
+  Xn as getBlueObjectValue,
+  rs as getTypeBlueIdAnnotation,
+  Er as hasBlueObjectBlueIdDefined,
+  Nr as hasBlueObjectItemsDefined,
+  Ln as hasBlueObjectNameDefined,
+  Pr as hasBlueObjectTypeDefined,
+  Sr as hasBlueObjectValueDefined,
+  Ge as isBigDecimalNumber,
+  H as isBigIntegerNumber,
+  A as isBigNumber,
+  zt as isBlueNodeSchema,
+  _n as isBlueObject,
+  Us as isBlueObjectResolved,
+  jn as isGivenBlueObjectTypeSchema,
+  Lt as isJsonBlueArray,
+  _t as isJsonBlueObject,
+  Un as isJsonBlueValue,
+  we as isUrl,
+  Ae as jsonBlueValueSchema,
+  ei as normalizeToBlueObject,
+  Bt as resolveBlueObjectItems,
+  Gr as withBlueDescription,
+  Hr as withBlueId,
+  Xr as withBlueName,
+  Qr as withBlueNode,
+  Zn as withTypeBlueId,
+  Rs as yamlBlueDump,
+  $ as yamlBlueParse
 };