@blue-labs/language 1.25.0 → 1.26.1

package/dist/index.mjs

@@ -1,18 +1,18 @@
-var Ft = Object.defineProperty;
-var Vt = (r, e, t) => e in r ? Ft(r, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[e] = t;
-var u = (r, e, t) => Vt(r, typeof e != "symbol" ? e + "" : e, t);
-import { isNullable as S, isNonNullable as d, jsonPrimitiveSchema as Dt, isReadonlyArray as X, isJsonPrimitive as ke, isPreciseNumberString as st } from "@blue-labs/shared-utils";
-import { z as f, ZodOptional as it, ZodNullable as ot, ZodReadonly as ct, ZodBranded as lt, ZodEffects as ue, ZodLazy as fe, ZodString as k, ZodEnum as Ot, ZodNativeEnum as jt, ZodNumber as _, ZodBoolean as ce, ZodBigInt as le, ZodAny as at, ZodObject as Oe, ZodRecord as je, ZodMap as ut, ZodUnknown as ft, ZodIntersection as Rt, ZodUnion as xt } from "zod";
-import q from "bs58";
+var _t = Object.defineProperty;
+var Zt = (r, e, t) => e in r ? _t(r, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[e] = t;
+var u = (r, e, t) => Zt(r, typeof e != "symbol" ? e + "" : e, t);
+import { isNullable as N, isNonNullable as f, jsonPrimitiveSchema as kt, isReadonlyArray as ie, isJsonPrimitive as Ke, isPreciseNumberString as ft } from "@blue-labs/shared-utils";
+import { z as d, ZodOptional as ht, ZodNullable as pt, ZodReadonly as yt, ZodBranded as gt, ZodEffects as me, ZodLazy as Ie, ZodString as k, ZodEnum as Jt, ZodNativeEnum as Gt, ZodNumber as J, ZodBoolean as pe, ZodBigInt as ye, ZodAny as mt, ZodObject as Ue, ZodRecord as Le, ZodMap as It, ZodUnknown as Tt, ZodIntersection as Yt, ZodUnion as zt } from "zod";
+import oe from "bs58";
 import x from "big.js";
-import { isObject as Re, isArray as Te, isString as _e, omit as dt, pascal as Ut, map as $t } from "radash";
-import { sha256 as Mt } from "js-sha256";
-import Ne from "crypto";
-import Lt from "base32.js";
+import { isObject as _e, isArray as Ne, isString as We, omit as bt, pascal as Kt, map as Wt } from "radash";
+import { sha256 as Ht } from "js-sha256";
+import Oe from "crypto";
+import Xt from "base32.js";
 import Z from "js-yaml";
-class Zt {
+class qt {
   static get(e, t, n, s = !0) {
-    if (S(t) || !t.startsWith("/"))
+    if (N(t) || !t.startsWith("/"))
       throw new Error(`Invalid path: ${t}`);
     if (t === "/") {
       const o = e.getValue();
@@ -36,8 +36,8 @@ class Zt {
         !1
       );
     if (n === t.length) {
-      const a = e.getValue();
-      return i && a !== void 0 ? a : e;
+      const l = e.getValue();
+      return i && l !== void 0 ? l : e;
     }
     const o = t[n], c = this.getNodeForSegment(
       e,
@@ -63,34 +63,34 @@ class Zt {
       switch (t) {
         case "name": {
           const c = e.getName();
-          i = d(c) ? new l().setValue(c) : new l();
+          i = f(c) ? new a().setValue(c) : new a();
           break;
         }
         case "description": {
           const c = e.getDescription();
-          i = d(c) ? new l().setValue(c) : new l();
+          i = f(c) ? new a().setValue(c) : new a();
           break;
         }
         case "type":
-          i = e.getType() ?? new l();
+          i = e.getType() ?? new a();
           break;
         case "itemType":
-          i = e.getItemType() ?? new l();
+          i = e.getItemType() ?? new a();
           break;
         case "keyType":
-          i = e.getKeyType() ?? new l();
+          i = e.getKeyType() ?? new a();
           break;
         case "valueType":
-          i = e.getValueType() ?? new l();
+          i = e.getValueType() ?? new a();
           break;
         case "value": {
           const c = e.getValue();
-          i = new l().setValue(c ?? null);
+          i = new a().setValue(c ?? null);
           break;
         }
         case "blueId": {
           const c = e.getBlueId();
-          i = d(c) ? new l().setValue(c) : new l();
+          i = f(c) ? new a().setValue(c) : new a();
           break;
         }
         case "blue":
@@ -98,23 +98,23 @@ class Zt {
           break;
         case "items": {
           const c = e.getItems();
-          i = new l().setItems(c);
+          i = new a().setItems(c);
           break;
         }
         case "properties": {
           const c = e.getProperties();
-          i = new l().setProperties(c);
+          i = new a().setProperties(c);
           break;
         }
         case "contracts": {
           const c = e.getContracts();
-          i = new l().setContracts(c);
+          i = new a().setContracts(c);
           break;
         }
         default: {
           if (/^\d+$/.test(t)) {
-            const c = parseInt(t, 10), a = e.getItems();
-            a && c >= 0 && c < a.length ? i = a[c] : i = void 0;
+            const c = parseInt(t, 10), l = e.getItems();
+            l && c >= 0 && c < l.length ? i = l[c] : i = void 0;
           } else
             i = void 0;
           break;
@@ -125,53 +125,52 @@ class Zt {
   }
   static link(e, t) {
     const n = t(e);
-    return d(n) ? n : e;
+    return f(n) ? n : e;
   }
 }
-class B extends x {
+class S extends x {
   constructor(e) {
     super(e);
   }
 }
-class A extends x {
+class C extends x {
   constructor(e) {
     super(e);
   }
 }
-const Y = "name", G = "description", de = "type", Ye = "itemType", Ge = "keyType", ze = "valueType", we = "value", Je = "items", L = "blueId", He = "blue", ve = "contracts", kt = [
+const Y = "name", z = "description", Te = "type", He = "itemType", Xe = "keyType", qe = "valueType", Se = "value", Qe = "items", _ = "blueId", et = "blue", Pe = "contracts", Qt = [
   Y,
-  G,
-  de,
-  Ye,
-  Ge,
-  ze,
-  we,
-  Je,
-  L,
+  z,
+  Te,
   He,
-  ve
-], _t = "Text", Yt = "Double", Gt = "Integer", zt = "Boolean", Jt = "List", Ht = "Dictionary", Wt = [
-  _t,
-  Yt,
-  Gt,
-  zt
-], ht = [...Wt, Jt, Ht], re = "F92yo19rCcbBoBSpUA5LRxpfDejJDAaP1PRxxbWAraVP", ne = "68ryJtnmui4j5rCZWUnkZ3DChtmEb7Z9F8atn1mBSM3L", se = "DHmxTkFbXePZHCHCYmQr2dSzcNLcryFVjXVHkdQrrZr8", ie = "EL6AjrbJsxTWRTPzY8WR8Y2zAMXRbydQj83PcZwuAHbo", Kt = "G8wmfjEqugPEEXByMYWJXiEdbLToPRWNQEekNxrxfQWB", Xt = "294NBTj2mFRL3RB4kDRUSckwGg7Kzj6T8CTAFeR1kcSA", qt = [
-  re,
-  ne,
-  se,
-  ie
-], We = [
-  ...qt,
-  Kt,
-  Xt
+  Xe,
+  qe,
+  Se,
+  Qe,
+  _,
+  et,
+  Pe
+], er = "Text", tr = "Double", rr = "Integer", nr = "Boolean", sr = "List", ir = "Dictionary", tt = [
+  er,
+  tr,
+  rr,
+  nr
+], wt = [...tt, sr, ir], H = "F92yo19rCcbBoBSpUA5LRxpfDejJDAaP1PRxxbWAraVP", X = "68ryJtnmui4j5rCZWUnkZ3DChtmEb7Z9F8atn1mBSM3L", q = "DHmxTkFbXePZHCHCYmQr2dSzcNLcryFVjXVHkdQrrZr8", Q = "EL6AjrbJsxTWRTPzY8WR8Y2zAMXRbydQj83PcZwuAHbo", vt = "G8wmfjEqugPEEXByMYWJXiEdbLToPRWNQEekNxrxfQWB", Bt = "294NBTj2mFRL3RB4kDRUSckwGg7Kzj6T8CTAFeR1kcSA", Et = [
+  H,
+  X,
+  q,
+  Q
+], de = [
+  ...Et,
+  vt,
+  Bt
 ];
 Object.fromEntries(
-  ht.map((r, e) => [r, We[e]])
+  wt.map((r, e) => [r, de[e]])
 );
-Object.fromEntries(
-  We.map((r, e) => [r, ht[e]])
-);
-const O = class O {
+const or = Object.fromEntries(
+  de.map((r, e) => [r, wt[e]])
+), R = class R {
   constructor(e) {
     u(this, "name");
     u(this, "description");
@@ -204,42 +203,42 @@ const O = class O {
     return this.type;
   }
   setType(e) {
-    return typeof e == "string" ? this.type = new O().setValue(e).setInlineValue(!0) : this.type = e, this;
+    return typeof e == "string" ? this.type = new R().setValue(e).setInlineValue(!0) : this.type = e, this;
   }
   getItemType() {
     return this.itemType;
   }
   setItemType(e) {
-    return typeof e == "string" ? this.itemType = new O().setValue(e).setInlineValue(!0) : this.itemType = e, this;
+    return typeof e == "string" ? this.itemType = new R().setValue(e).setInlineValue(!0) : this.itemType = e, this;
   }
   getKeyType() {
     return this.keyType;
   }
   setKeyType(e) {
-    return typeof e == "string" ? this.keyType = new O().setValue(e).setInlineValue(!0) : this.keyType = e, this;
+    return typeof e == "string" ? this.keyType = new R().setValue(e).setInlineValue(!0) : this.keyType = e, this;
   }
   getValueType() {
     return this.valueType;
   }
   setValueType(e) {
-    return typeof e == "string" ? this.valueType = new O().setValue(e).setInlineValue(!0) : this.valueType = e, this;
+    return typeof e == "string" ? this.valueType = new R().setValue(e).setInlineValue(!0) : this.valueType = e, this;
   }
   getValue() {
     var t;
     const e = (t = this.type) == null ? void 0 : t.getBlueId();
-    if (d(e) && d(this.value)) {
-      if (e === se && typeof this.value == "string")
-        return new B(this.value);
-      if (e === ne && typeof this.value == "string") {
-        const n = new A(this.value), s = parseFloat(n.toString());
-        return new A(s.toString());
-      } else if (e === ie && typeof this.value == "string")
+    if (f(e) && f(this.value)) {
+      if (e === q && typeof this.value == "string")
+        return new S(this.value);
+      if (e === X && typeof this.value == "string") {
+        const n = new C(this.value), s = parseFloat(n.toString());
+        return new C(s.toString());
+      } else if (e === Q && typeof this.value == "string")
         return this.value.toLowerCase() === "true";
     }
     return this.value;
   }
   setValue(e) {
-    return typeof e == "number" ? e % 1 === 0 ? this.value = new B(e.toString()) : this.value = new A(e.toString()) : this.value = e, this;
+    return typeof e == "number" ? e % 1 === 0 ? this.value = new S(e.toString()) : this.value = new C(e.toString()) : this.value = e, this;
   }
   getItems() {
     return this.items;
@@ -293,24 +292,24 @@ const O = class O {
     return this.inlineValue = e, this;
   }
   get(e, t) {
-    return Zt.get(this, e, t);
+    return qt.get(this, e, t);
   }
   clone() {
     var t, n, s, i, o, c;
-    const e = new O(this.name);
-    return e.description = this.description, e.type = (t = this.type) == null ? void 0 : t.clone(), e.itemType = (n = this.itemType) == null ? void 0 : n.clone(), e.keyType = (s = this.keyType) == null ? void 0 : s.clone(), e.valueType = (i = this.valueType) == null ? void 0 : i.clone(), e.value = this.value, e.items = (o = this.items) == null ? void 0 : o.map((a) => a.clone()), this.properties && (e.properties = Object.fromEntries(
-      Object.entries(this.properties).map(([a, y]) => [a, y.clone()])
+    const e = new R(this.name);
+    return e.description = this.description, e.type = (t = this.type) == null ? void 0 : t.clone(), e.itemType = (n = this.itemType) == null ? void 0 : n.clone(), e.keyType = (s = this.keyType) == null ? void 0 : s.clone(), e.valueType = (i = this.valueType) == null ? void 0 : i.clone(), e.value = this.value, e.items = (o = this.items) == null ? void 0 : o.map((l) => l.clone()), this.properties && (e.properties = Object.fromEntries(
+      Object.entries(this.properties).map(([l, h]) => [l, h.clone()])
     )), this.contracts && (e.contracts = Object.fromEntries(
-      Object.entries(this.contracts).map(([a, y]) => [a, y.clone()])
+      Object.entries(this.contracts).map(([l, h]) => [l, h.clone()])
     )), e.blueId = this.blueId, e.blue = (c = this.blue) == null ? void 0 : c.clone(), e.inlineValue = this.inlineValue, e;
   }
   toString() {
     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}, contracts=${this.contracts}, blueId='${this.blueId}', blue=${this.blue}, inlineValue=${this.inlineValue}}`;
   }
 };
-u(O, "INTEGER", new O("Integer"));
-let l = O;
-class M {
+u(R, "INTEGER", new R("Integer"));
+let a = R;
+class L {
   static isPotentialBlueId(e) {
     if (!e || e.length === 0 || !this.BLUE_ID_PATTERN.test(e))
       return !1;
@@ -318,7 +317,7 @@ class M {
     if (s < this.MIN_BLUE_ID_LENGTH || s > this.MAX_BLUE_ID_LENGTH)
       return !1;
     try {
-      if (q.decode(n).length !== 32)
+      if (oe.decode(n).length !== 32)
         return !1;
     } catch {
       return !1;
@@ -333,15 +332,15 @@ class M {
     return !0;
   }
 }
-u(M, "MIN_BLUE_ID_LENGTH", 41), u(M, "MAX_BLUE_ID_LENGTH", 45), u(M, "BLUE_ID_PATTERN", /^[1-9A-HJ-NP-Za-km-z]{41,45}(?:#\d+)?$/);
-const Pn = f.string().max(M.MAX_BLUE_ID_LENGTH, {
+u(L, "MIN_BLUE_ID_LENGTH", 41), u(L, "MAX_BLUE_ID_LENGTH", 45), u(L, "BLUE_ID_PATTERN", /^[1-9A-HJ-NP-Za-km-z]{41,45}(?:#\d+)?$/);
+const Qn = d.string().max(L.MAX_BLUE_ID_LENGTH, {
   message: "Blue Id has a maximum length of 45 characters"
-}).min(M.MIN_BLUE_ID_LENGTH, {
+}).min(L.MIN_BLUE_ID_LENGTH, {
   message: "Blue Id has a minimum length of 41 characters"
 }).refine(
   (r) => {
     try {
-      return q.decode(r), !0;
+      return oe.decode(r), !0;
     } catch {
       return !1;
     }
@@ -349,45 +348,45 @@ const Pn = f.string().max(M.MAX_BLUE_ID_LENGTH, {
   {
     message: "Blue Id must be a valid Base58 string"
   }
-), Q = f.lazy(
-  () => f.record(f.unknown()).and(
-    f.object({
-      blueId: f.string().optional(),
-      name: f.string().optional(),
-      description: f.string().optional(),
-      type: Q.optional(),
-      value: f.union([f.string(), f.number(), f.boolean()]).optional().nullable(),
-      items: f.array(Q).optional()
+), ce = d.lazy(
+  () => d.record(d.unknown()).and(
+    d.object({
+      blueId: d.string().optional(),
+      name: d.string().optional(),
+      description: d.string().optional(),
+      type: ce.optional(),
+      value: d.union([d.string(), d.number(), d.boolean()]).optional().nullable(),
+      items: d.array(ce).optional()
     })
   )
-), Be = f.object({
-  blueId: f.string().optional(),
-  name: f.string().optional(),
-  description: f.string().optional(),
-  type: Q.optional()
-}), An = Be.extend({
-  value: f.string().optional()
-}), Nn = Be.extend({
-  value: f.number().optional()
-}), Sn = Be.extend({
-  value: f.boolean().optional()
-}), Cn = Be.extend({
-  items: f.array(f.string()).optional()
-}), Fn = (r) => Q.safeParse(r).success, Qt = (r) => d(r) && "blueId" in r && d(r.blueId), Vn = (r) => d(r) && "name" in r && d(r.name), er = (r) => d(r) && "items" in r && d(r.items), tr = (r) => d(r) && "type" in r && d(r.type), rr = (r) => d(r) && "value" in r && d(r.value), Dn = (r, e) => r.required({ type: !0 }).safeParse(e).success, C = (r) => r instanceof x, ee = (r) => C(r) && r instanceof B, nr = (r) => C(r) && r instanceof A, sr = f.lazy(
-  () => f.record(he)
-), ir = f.lazy(
-  () => f.union([
-    f.array(he),
-    f.array(he).readonly()
+), Ae = d.object({
+  blueId: d.string().optional(),
+  name: d.string().optional(),
+  description: d.string().optional(),
+  type: ce.optional()
+}), es = Ae.extend({
+  value: d.string().optional()
+}), ts = Ae.extend({
+  value: d.number().optional()
+}), rs = Ae.extend({
+  value: d.boolean().optional()
+}), ns = Ae.extend({
+  items: d.array(d.string()).optional()
+}), ss = (r) => ce.safeParse(r).success, cr = (r) => f(r) && "blueId" in r && f(r.blueId), is = (r) => f(r) && "name" in r && f(r.name), lr = (r) => f(r) && "items" in r && f(r.items), ar = (r) => f(r) && "type" in r && f(r.type), ur = (r) => f(r) && "value" in r && f(r.value), os = (r, e) => r.required({ type: !0 }).safeParse(e).success, O = (r) => r instanceof x, le = (r) => O(r) && r instanceof S, dr = (r) => O(r) && r instanceof C, fr = d.lazy(
+  () => d.record(be)
+), hr = d.lazy(
+  () => d.union([
+    d.array(be),
+    d.array(be).readonly()
   ])
-), he = f.lazy(
-  () => f.union([
-    Dt,
-    sr,
-    ir,
-    f.instanceof(x)
+), be = d.lazy(
+  () => d.union([
+    kt,
+    fr,
+    hr,
+    d.instanceof(x)
   ])
-), pt = (r) => Re(r) && !Te(r) && !X(r) && !C(r), yt = (r) => Te(r) || X(r), On = (r) => yt(r) || pt(r) || C(r) || ke(r);
+), Nt = (r) => _e(r) && !Ne(r) && !ie(r) && !O(r), St = (r) => Ne(r) || ie(r), cs = (r) => St(r) || Nt(r) || O(r) || Ke(r);
 class p {
   static deserialize(e) {
     return p.handleNode(e);
@@ -397,8 +396,8 @@ class p {
       throw new Error(
         "This is not a valid JSON-like value. Found 'undefined' as a value."
       );
-    if (pt(e)) {
-      const t = new l(), n = {}, s = {};
+    if (Nt(e)) {
+      const t = new a(), n = {}, s = {};
       return Object.entries(e).forEach(([i, o]) => {
         switch (i) {
           case Y:
@@ -410,46 +409,46 @@ class p {
               t.setName(o);
             }
             break;
-          case G:
+          case z:
             if (o == null)
               t.setDescription(void 0);
             else {
               if (typeof o != "string")
                 throw new Error(
-                  `The ${G} field must be a string.`
+                  `The ${z} field must be a string.`
                 );
               t.setDescription(o);
             }
             break;
-          case de:
+          case Te:
             t.setType(p.handleNode(o));
             break;
-          case Ye:
+          case He:
             t.setItemType(p.handleNode(o));
             break;
-          case Ge:
+          case Xe:
             t.setKeyType(p.handleNode(o));
             break;
-          case ze:
+          case qe:
             t.setValueType(p.handleNode(o));
             break;
-          case we:
+          case Se:
             t.setValue(p.handleValue(o));
             break;
-          case L:
+          case _:
             if (typeof o != "string")
-              throw new Error(`The ${L} field must be a string.`);
+              throw new Error(`The ${_} field must be a string.`);
             t.setBlueId(o);
             break;
-          case Je:
+          case Qe:
             t.setItems(p.handleArray(o));
             break;
-          case He:
+          case et:
             t.setBlue(p.handleNode(o));
             break;
-          case ve:
-            Re(o) && !Te(o) && !X(o) && Object.entries(o).forEach(([c, a]) => {
-              s[c] = p.handleNode(a);
+          case Pe:
+            _e(o) && !Ne(o) && !ie(o) && Object.entries(o).forEach(([c, l]) => {
+              s[c] = p.handleNode(l);
             });
             break;
           default:
@@ -458,11 +457,11 @@ class p {
         }
       }), Object.keys(n).length > 0 && t.setProperties(n), Object.keys(s).length > 0 && t.setContracts(s), t;
     } else {
-      if (yt(e))
-        return new l().setItems(p.handleArray(e));
+      if (St(e))
+        return new a().setItems(p.handleArray(e));
       {
         const t = e;
-        return new l().setValue(p.handleValue(t)).setInlineValue(!0);
+        return new a().setValue(p.handleValue(t)).setInlineValue(!0);
       }
     }
   }
@@ -471,13 +470,13 @@ class p {
       return null;
     if (typeof e == "string")
       return e;
-    if (typeof e == "number" || C(e))
-      if (ee(e) || Number.isSafeInteger(e)) {
-        const t = new B(e.toString()), n = Number.MIN_SAFE_INTEGER, s = Number.MAX_SAFE_INTEGER;
-        return t.lt(n) ? new B(n.toString()) : t.gt(s) ? new B(s.toString()) : t;
+    if (typeof e == "number" || O(e))
+      if (le(e) || Number.isSafeInteger(e)) {
+        const t = new S(e.toString()), n = Number.MIN_SAFE_INTEGER, s = Number.MAX_SAFE_INTEGER;
+        return t.lt(n) ? new S(n.toString()) : t.gt(s) ? new S(s.toString()) : t;
       } else {
         const t = parseFloat(e.toString());
-        return new A(t.toString());
+        return new C(t.toString());
       }
     else if (typeof e == "boolean")
       return e;
@@ -485,7 +484,7 @@ class p {
   }
   static handleArray(e) {
     if (e != null) {
-      if (Re(e) && !Array.isArray(e))
+      if (_e(e) && !Array.isArray(e))
         return [p.handleNode(e)];
       if (Array.isArray(e))
         return e.map(p.handleNode);
@@ -493,12 +492,12 @@ class p {
     }
   }
 }
-function or(r) {
+function pr(r) {
   return r && r.__esModule && Object.prototype.hasOwnProperty.call(r, "default") ? r.default : r;
 }
-var Se, qe;
-function cr() {
-  return qe || (qe = 1, Se = function r(e) {
+var De, ot;
+function yr() {
+  return ot || (ot = 1, De = function r(e) {
     if (typeof e == "number" && isNaN(e))
       throw new Error("NaN is not allowed");
     if (typeof e == "number" && !isFinite(e))
@@ -509,52 +508,52 @@ function cr() {
       const i = n.length === 0 ? "" : ",";
       return `${n}${i}${r(s)}:${r(e[s])}`;
     }, "")}}`;
-  }), Se;
+  }), De;
 }
-var lr = cr();
-const ar = /* @__PURE__ */ or(lr);
-class ur {
+var gr = yr();
+const mr = /* @__PURE__ */ pr(gr);
+class Ir {
   static canonicalize(e) {
-    return ar(e);
+    return mr(e);
   }
 }
-const Ce = typeof process < "u" && process.versions != null && process.versions.node != null, me = class me {
+const Fe = typeof process < "u" && process.versions != null && process.versions.node != null, ve = class ve {
   constructor() {
     u(this, "browserCrypto");
     this.browserCrypto = this.initBrowserCrypto();
   }
   static getInstance() {
-    return this.instance || (this.instance = new me()), this.instance;
+    return this.instance || (this.instance = new ve()), this.instance;
   }
   initBrowserCrypto() {
-    return Ce ? null : "crypto" in globalThis ? globalThis.crypto : null;
+    return Fe ? null : "crypto" in globalThis ? globalThis.crypto : null;
   }
   hasNodeCrypto() {
-    return Ce && !!Ne && typeof Ne.createHash == "function";
+    return Fe && !!Oe && typeof Oe.createHash == "function";
   }
   getBrowserCrypto() {
     return this.browserCrypto;
   }
   getNodeCrypto() {
-    return Ce ? Ne : null;
+    return Fe ? Oe : null;
   }
 };
-u(me, "instance");
-let xe = me;
-class fr {
+u(ve, "instance");
+let Ze = ve;
+class Tr {
   constructor() {
-    u(this, "cryptoEnv", xe.getInstance());
+    u(this, "cryptoEnv", Ze.getInstance());
   }
   applySync(e) {
     const t = this.canonicalizeInput(e), n = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : this.sha256SyncBrowser(t);
-    return q.encode(new Uint8Array(n));
+    return oe.encode(new Uint8Array(n));
   }
   async apply(e) {
     const t = this.canonicalizeInput(e), n = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : await this.sha256Async(t);
-    return q.encode(new Uint8Array(n));
+    return oe.encode(new Uint8Array(n));
   }
   canonicalizeInput(e) {
-    const t = ur.canonicalize(e);
+    const t = Ir.canonicalize(e);
     if (typeof t != "string")
       throw new Error("Canonized value must be a string");
     return t;
@@ -568,7 +567,7 @@ class fr {
     return t.createHash("sha256").update(e).digest();
   }
   sha256SyncBrowser(e) {
-    return Mt.arrayBuffer(e);
+    return Ht.arrayBuffer(e);
   }
   async sha256Async(e) {
     if (this.cryptoEnv.hasNodeCrypto())
@@ -580,7 +579,7 @@ class fr {
     return t.subtle.digest("SHA-256", s);
   }
 }
-class T {
+class y {
   /**
    * Converts a BlueNode to a JSON representation based on the specified strategy.
    *
@@ -592,11 +591,11 @@ class T {
    * @returns A JSON representation of the node.
    */
   static get(e, t = "official") {
-    var oe;
+    var he;
     const n = e.getValue(), s = this.handleValue(n);
     if (s !== void 0 && t === "simple")
       return s;
-    const i = (oe = e.getItems()) == null ? void 0 : oe.map((D) => T.get(D, t));
+    const i = (he = e.getItems()) == null ? void 0 : he.map((F) => y.get(F, t));
     if (i !== void 0 && t === "simple")
       return i;
     const o = e.getName(), c = e.getDescription();
@@ -606,38 +605,38 @@ class T {
       if (i !== void 0)
         return i;
     }
-    const a = {};
-    o !== void 0 && (a[Y] = o), c !== void 0 && (a[G] = c);
-    const y = e.getType();
-    if (t === "official" && n !== void 0 && y === void 0) {
-      const D = this.inferTypeBlueId(n);
-      D !== null && (a[de] = { [L]: D });
-    } else y !== void 0 && (a[de] = T.get(y, t));
-    const b = e.getItemType();
-    b !== void 0 && (a[Ye] = T.get(b, t));
-    const I = e.getKeyType();
-    I !== void 0 && (a[Ge] = T.get(I, t));
-    const m = e.getValueType();
-    m !== void 0 && (a[ze] = T.get(m, t)), s !== void 0 && (a[we] = s), i !== void 0 && (a[Je] = i);
-    const g = e.getBlueId();
-    g !== void 0 && (a[L] = g);
-    const h = e.getBlue();
-    h !== void 0 && (a[He] = h);
-    const w = e.getContracts();
-    if (w !== void 0) {
-      const D = {};
-      Object.entries(w).forEach(([Ae, Ct]) => {
-        D[Ae] = T.get(Ct, t);
-      }), a[ve] = D;
-    }
-    const V = e.getProperties();
-    return V !== void 0 && Object.entries(V).forEach(([D, Ae]) => {
-      a[D] = T.get(Ae, t);
-    }), a;
+    const l = {};
+    o !== void 0 && (l[Y] = o), c !== void 0 && (l[z] = c);
+    const h = e.getType();
+    if (t === "official" && n !== void 0 && h === void 0) {
+      const F = this.inferTypeBlueId(n);
+      F !== null && (l[Te] = { [_]: F });
+    } else h !== void 0 && (l[Te] = y.get(h, t));
+    const T = e.getItemType();
+    T !== void 0 && (l[He] = y.get(T, t));
+    const b = e.getKeyType();
+    b !== void 0 && (l[Xe] = y.get(b, t));
+    const I = e.getValueType();
+    I !== void 0 && (l[qe] = y.get(I, t)), s !== void 0 && (l[Se] = s), i !== void 0 && (l[Qe] = i);
+    const m = e.getBlueId();
+    m !== void 0 && (l[_] = m);
+    const g = e.getBlue();
+    g !== void 0 && (l[et] = g);
+    const v = e.getContracts();
+    if (v !== void 0) {
+      const F = {};
+      Object.entries(v).forEach(([Ve, Lt]) => {
+        F[Ve] = y.get(Lt, t);
+      }), l[Pe] = F;
+    }
+    const D = e.getProperties();
+    return D !== void 0 && Object.entries(D).forEach(([F, Ve]) => {
+      l[F] = y.get(Ve, t);
+    }), l;
   }
   static handleValue(e) {
-    if (C(e)) {
-      if (ee(e)) {
+    if (O(e)) {
+      if (le(e)) {
         const t = new x(Number.MIN_SAFE_INTEGER.toString()), n = new x(Number.MAX_SAFE_INTEGER.toString());
         if (e.lt(t) || e.gt(n))
           return e.toString();
@@ -647,29 +646,29 @@ class T {
     return e;
   }
   static inferTypeBlueId(e) {
-    return typeof e == "string" ? re : C(e) ? ee(e) ? se : ne : typeof e == "boolean" ? ie : null;
+    return typeof e == "string" ? H : O(e) ? le(e) ? q : X : typeof e == "boolean" ? Q : null;
   }
 }
-const dr = (r) => ke(r) && d(r), R = class R {
+const br = (r) => Ke(r) && f(r), j = class j {
   constructor(e) {
     u(this, "hashProvider");
     this.hashProvider = e;
   }
   static calculateBlueId(e) {
     if (Array.isArray(e)) {
-      const n = e.map((s) => T.get(s));
-      return R.INSTANCE.calculate(n);
+      const n = e.map((s) => y.get(s));
+      return j.INSTANCE.calculate(n);
     }
-    const t = T.get(e);
-    return R.INSTANCE.calculate(t);
+    const t = y.get(e);
+    return j.INSTANCE.calculate(t);
   }
   static calculateBlueIdSync(e) {
     if (Array.isArray(e)) {
-      const n = e.map((s) => T.get(s));
-      return R.INSTANCE.calculateSync(n);
+      const n = e.map((s) => y.get(s));
+      return j.INSTANCE.calculateSync(n);
     }
-    const t = T.get(e);
-    return R.INSTANCE.calculateSync(t);
+    const t = y.get(e);
+    return j.INSTANCE.calculateSync(t);
   }
   // public static calculateBlueIdForNodes(nodes: BlueNode[]) {
   //   const objects = nodes.map((node) => NodeToMapListOrValue.get(node));
@@ -693,26 +692,26 @@ const dr = (r) => ke(r) && d(r), R = class R {
   }
   // Internal method to calculate BlueId recursively
   internalCalculate(e, t) {
-    return dr(e) || C(e) ? this.applyHash(e.toString(), t) : Array.isArray(e) || X(e) ? this.calculateList(e, t) : this.calculateMap(e, t);
+    return br(e) || O(e) ? this.applyHash(e.toString(), t) : Array.isArray(e) || ie(e) ? this.calculateList(e, t) : this.calculateMap(e, t);
   }
   calculateMap(e, t) {
-    if (e[L] !== void 0)
-      return e[L];
+    if (e[_] !== void 0)
+      return e[_];
     const s = Object.keys(e).map((o) => {
       const c = e[o];
-      if ([Y, we, G].includes(o))
+      if ([Y, Se, z].includes(o))
         return t ? [o, c] : Promise.resolve([o, c]);
       {
-        const a = this.internalCalculate(c, t);
-        return t ? [o, { blueId: a }] : Promise.resolve(a).then((y) => [
+        const l = this.internalCalculate(c, t);
+        return t ? [o, { blueId: l }] : Promise.resolve(l).then((h) => [
           o,
-          { blueId: y }
+          { blueId: h }
         ]);
       }
     }), i = (o) => {
       const c = {};
-      for (const [a, y] of o)
-        c[a] = y;
+      for (const [l, h] of o)
+        c[l] = h;
       return this.applyHash(c, t);
     };
     return t ? i(s) : Promise.all(s).then(i);
@@ -728,7 +727,7 @@ const dr = (r) => ke(r) && d(r), R = class R {
       [{ blueId: i }, { blueId: o }],
       !0
     ) : Promise.all([i, o]).then(
-      ([c, a]) => this.applyHash([{ blueId: c }, { blueId: a }], !1)
+      ([c, l]) => this.applyHash([{ blueId: c }, { blueId: l }], !1)
     );
     for (let i = 1; i < e.length; i++) {
       const o = this.internalCalculate(e[i], t);
@@ -743,10 +742,10 @@ const dr = (r) => ke(r) && d(r), R = class R {
   // Method to clean the input structure by removing null or undefined values
   cleanStructure(e) {
     if (e != null) {
-      if (ke(e) || C(e))
+      if (Ke(e) || O(e))
         return e;
-      if (Array.isArray(e) || X(e)) {
-        const t = e.map((n) => this.cleanStructure(n)).filter(d);
+      if (Array.isArray(e) || ie(e)) {
+        const t = e.map((n) => this.cleanStructure(n)).filter(f);
         return t.length > 0 ? t : void 0;
       } else if (typeof e == "object") {
         const t = {};
@@ -760,17 +759,17 @@ const dr = (r) => ke(r) && d(r), R = class R {
     }
   }
 };
-u(R, "INSTANCE", new R(new fr()));
-let F = R;
-class jn {
+u(j, "INSTANCE", new j(new Tr()));
+let w = j;
+class ls {
   static convert(e) {
-    const t = q.decode(e), n = new Uint8Array(2 + t.length);
+    const t = oe.decode(e), n = new Uint8Array(2 + t.length);
     n[0] = 18, n[1] = 32, n.set(t, 2);
     const s = new Uint8Array(2 + n.length);
-    return s[0] = 1, s[1] = 85, s.set(n, 2), "b" + new Lt.Encoder({ type: "rfc4648", lc: !0 }).write(s).finalize().replace(/=/g, "");
+    return s[0] = 1, s[1] = 85, s.set(n, 2), "b" + new Xt.Encoder({ type: "rfc4648", lc: !0 }).write(s).finalize().replace(/=/g, "");
   }
 }
-class N {
+class V {
   /**
    * Transforms a node and all its child nodes using the provided transformer function
    * @param node - The node to transform
@@ -779,50 +778,50 @@ class N {
    */
   static transform(e, t) {
     const n = t(e.clone()), s = n.getType();
-    s !== void 0 && n.setType(N.transform(s, t));
+    s !== void 0 && n.setType(V.transform(s, t));
     const i = n.getItemType();
     i !== void 0 && n.setItemType(
-      N.transform(i, t)
+      V.transform(i, t)
     );
     const o = n.getKeyType();
     o !== void 0 && n.setKeyType(
-      N.transform(o, t)
+      V.transform(o, t)
     );
     const c = n.getValueType();
     c !== void 0 && n.setValueType(
-      N.transform(c, t)
+      V.transform(c, t)
     );
-    const a = n.getItems();
-    if (a !== void 0) {
-      const I = a.map(
-        (m) => N.transform(m, t)
+    const l = n.getItems();
+    if (l !== void 0) {
+      const b = l.map(
+        (I) => V.transform(I, t)
       );
-      n.setItems(I);
+      n.setItems(b);
     }
-    const y = n.getProperties();
-    if (y !== void 0) {
-      const I = Object.keys(y).reduce(
-        (m, g) => (m[g] = N.transform(y[g], t), m),
+    const h = n.getProperties();
+    if (h !== void 0) {
+      const b = Object.keys(h).reduce(
+        (I, m) => (I[m] = V.transform(h[m], t), I),
         {}
       );
-      n.setProperties(I);
+      n.setProperties(b);
     }
-    const b = n.getContracts();
-    if (b !== void 0) {
-      const I = Object.keys(b).reduce((m, g) => (m[g] = N.transform(b[g], t), m), {});
-      n.setContracts(I);
+    const T = n.getContracts();
+    if (T !== void 0) {
+      const b = Object.keys(T).reduce((I, m) => (I[m] = V.transform(T[m], t), I), {});
+      n.setContracts(b);
     }
     return n;
   }
 }
-const U = (r) => !!r && typeof r == "object" && !Array.isArray(r) && !(r instanceof l), j = (r) => r instanceof B || r instanceof A, hr = (r) => r.replace(/~1/g, "/").replace(/~0/g, "~");
-function J(r) {
+const $ = (r) => !!r && typeof r == "object" && !Array.isArray(r) && !(r instanceof a), M = (r) => r instanceof S || r instanceof C, wr = (r) => r.replace(/~1/g, "/").replace(/~0/g, "~");
+function ee(r) {
   if (r === "/") return [];
   if (!r.startsWith("/"))
     throw new Error(`Path must start with '/': ${r}`);
-  return r.split("/").slice(1).map(hr);
+  return r.split("/").slice(1).map(wr);
 }
-function z(r) {
+function K(r) {
   if (r === "-") return -1;
   const e = typeof r == "number" ? r : parseInt(r, 10);
   if (isNaN(e))
@@ -833,7 +832,7 @@ function z(r) {
     );
   return e;
 }
-function gt(r, e, t, n = !0) {
+function Pt(r, e, t, n = !0) {
   switch (e) {
     case "name":
       return t ? n ? r.getName() ?? null : r : r.getName();
@@ -863,9 +862,9 @@ function gt(r, e, t, n = !0) {
       return;
   }
 }
-function Qe(r, e, t = !0) {
-  if (r instanceof l) {
-    const n = gt(
+function ct(r, e, t = !0) {
+  if (r instanceof a) {
+    const n = Pt(
       r,
       e,
       !0,
@@ -895,12 +894,12 @@ function Qe(r, e, t = !0) {
   }
   if (Array.isArray(r)) {
     if (e === "-") return;
-    const n = z(e);
+    const n = K(e);
     return n >= 0 && n < r.length ? r[n] : void 0;
   }
-  if (U(r)) return r[e];
+  if ($(r)) return r[e];
 }
-function H(r, e) {
+function te(r, e) {
   if (e.length === 0)
     return {
       parent: r,
@@ -909,30 +908,30 @@ function H(r, e) {
     };
   let t = r;
   for (let s = 0; s < e.length - 1; ++s) {
-    const i = e[s], o = Qe(t, i);
+    const i = e[s], o = ct(t, i);
     if (o === void 0)
       throw new Error(`Cannot resolve '/${e.slice(0, s + 1).join("/")}'`);
     t = o;
   }
   const n = e[e.length - 1];
-  if (t instanceof l) {
-    const s = Qe(t, n, !1);
-    if ((typeof s != "object" || s === null || j(s)) && !(s instanceof l) && !Array.isArray(s) && ["name", "description", "value", "blueId"].includes(n))
+  if (t instanceof a) {
+    const s = ct(t, n, !1);
+    if ((typeof s != "object" || s === null || M(s)) && !(s instanceof a) && !Array.isArray(s) && ["name", "description", "value", "blueId"].includes(n))
       return {
         parent: t,
         key: n,
         actualTarget: s
       };
   }
-  return Array.isArray(t) && n === "-" ? { parent: t, key: "-" } : t instanceof l && t.getItems() && n === "-" ? { parent: t, key: "-" } : {
+  return Array.isArray(t) && n === "-" ? { parent: t, key: "-" } : t instanceof a && t.getItems() && n === "-" ? { parent: t, key: "-" } : {
     parent: t,
-    key: Array.isArray(t) ? z(n) : n
+    key: Array.isArray(t) ? K(n) : n
   };
 }
-function Ke(r, e) {
+function rt(r, e) {
   var t;
-  if (r instanceof l) {
-    const n = e, s = gt(r, n, !1);
+  if (r instanceof a) {
+    const n = e, s = Pt(r, n, !1);
     if (s !== void 0 || [
       "name",
       "description",
@@ -954,26 +953,26 @@ function Ke(r, e) {
     }
     return (t = r.getProperties()) == null ? void 0 : t[n];
   }
-  return Array.isArray(r) || U(r) ? r[e] : r;
+  return Array.isArray(r) || $(r) ? r[e] : r;
 }
-function v(r) {
-  if (r instanceof l) return r;
-  if (r === null || typeof r == "string" || typeof r == "number" || typeof r == "boolean" || j(r))
+function B(r) {
+  if (r instanceof a) return r;
+  if (r === null || typeof r == "string" || typeof r == "number" || typeof r == "boolean" || M(r))
     return p.deserialize(r);
-  const e = Ue(r);
+  const e = ke(r);
   return p.deserialize(e);
 }
-function Ue(r) {
+function ke(r) {
   if (r === void 0) return null;
   if (r === null || typeof r != "object") return r;
-  if (Array.isArray(r)) return r.map(Ue);
+  if (Array.isArray(r)) return r.map(ke);
   const e = {};
   for (const [t, n] of Object.entries(r))
-    e[t] = Ue(n);
+    e[t] = ke(n);
   return e;
 }
-function Xe(r, e, t) {
-  if (r instanceof l) {
+function nt(r, e, t) {
+  if (r instanceof a) {
     const n = e;
     switch (n) {
       case "name":
@@ -984,22 +983,22 @@ function Xe(r, e, t) {
         return;
       case "type":
         r.setType(
-          t instanceof l || typeof t == "string" || t === void 0 ? t : v(t)
+          t instanceof a || typeof t == "string" || t === void 0 ? t : B(t)
         );
         return;
       case "itemType":
         r.setItemType(
-          t instanceof l || typeof t == "string" || t === void 0 ? t : v(t)
+          t instanceof a || typeof t == "string" || t === void 0 ? t : B(t)
         );
         return;
       case "keyType":
         r.setKeyType(
-          t instanceof l || typeof t == "string" || t === void 0 ? t : v(t)
+          t instanceof a || typeof t == "string" || t === void 0 ? t : B(t)
         );
         return;
       case "valueType":
         r.setValueType(
-          t instanceof l || typeof t == "string" || t === void 0 ? t : v(t)
+          t instanceof a || typeof t == "string" || t === void 0 ? t : B(t)
         );
         return;
       case "value": {
@@ -1012,7 +1011,7 @@ function Xe(r, e, t) {
         return;
       case "blue":
         r.setBlue(
-          t instanceof l || t === void 0 ? t : v(t)
+          t instanceof a || t === void 0 ? t : B(t)
         );
         return;
       case "items":
@@ -1029,14 +1028,14 @@ function Xe(r, e, t) {
           const s = r.getProperties();
           s && n in s && delete s[n];
         } else
-          r.getProperties() || r.setProperties({}), r.addProperty(n, t instanceof l ? t : v(t));
+          r.getProperties() || r.setProperties({}), r.addProperty(n, t instanceof a ? t : B(t));
         return;
       }
     }
   }
-  Array.isArray(r) ? r.splice(z(e), 1) : U(r) && (t === void 0 ? delete r[e] : r[e] = t);
+  Array.isArray(r) ? r.splice(K(e), 1) : $(r) && (t === void 0 ? delete r[e] : r[e] = t);
 }
-function pr(r, e, t, n) {
+function vr(r, e, t, n) {
   let s = -1;
   if (e !== "-" && (s = typeof e == "number" ? e : parseInt(e, 10), isNaN(s)))
     throw new Error(
@@ -1062,16 +1061,16 @@ function pr(r, e, t, n) {
   } else
     i.splice(s, 0, t);
 }
-function pe(r, e, t, n) {
+function we(r, e, t, n) {
   if (Array.isArray(r)) {
-    const s = e === "-" ? r.length : z(e);
+    const s = e === "-" ? r.length : K(e);
     if (!n && s > r.length)
       throw new Error(
         `ADD operation failed: Target array index '${s}' is greater than array length ${r.length}. Path involving key '${e}'.`
       );
     if (s < 0 && e !== "-")
       throw new Error(`Invalid negative array index: ${e}`);
-    const i = v(t);
+    const i = B(t);
     if (n) {
       if (s >= 0 && s < r.length) r[s] = i;
       else if (s >= r.length) {
@@ -1083,266 +1082,266 @@ function pe(r, e, t, n) {
       r.splice(s, 0, i);
     return;
   }
-  if (r instanceof l) {
-    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? pr(r, e, v(t), n) : Xe(r, e, t);
+  if (r instanceof a) {
+    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? vr(r, e, B(t), n) : nt(r, e, t);
     return;
   }
-  if (U(r)) {
-    r[e] = v(t);
+  if ($(r)) {
+    r[e] = B(t);
     return;
   }
   throw new Error(`Cannot insert into parent of type ${typeof r}`);
 }
-function yr(r, e) {
+function Br(r, e) {
   if (Array.isArray(r)) {
-    const t = z(e);
+    const t = K(e);
     t === -1 && e === "-" ? r.length > 0 && r.pop() : t >= 0 && t < r.length && r.splice(t, 1);
     return;
   }
-  if (r instanceof l) {
+  if (r instanceof a) {
     if (typeof e == "number" || typeof e == "string" && /^-?\d+$/.test(e)) {
       const t = r.getItems();
       if (t) {
-        const n = z(e);
+        const n = K(e);
         n === -1 && e === "-" ? t.length > 0 && t.pop() : n >= 0 && n < t.length && t.splice(n, 1), t.length === 0 && r.setItems(void 0);
         return;
       }
     }
-    Xe(r, e, void 0);
-  } else U(r) && delete r[e];
+    nt(r, e, void 0);
+  } else $(r) && delete r[e];
 }
-function $e(r) {
-  if (r instanceof l) return r.clone();
+function Je(r) {
+  if (r instanceof a) return r.clone();
   if (Array.isArray(r))
-    return r.map((t) => $e(t));
-  if (U(r)) {
+    return r.map((t) => Je(t));
+  if ($(r)) {
     const e = {};
     return Object.keys(r).forEach((t) => {
-      e[t] = $e(r[t]);
+      e[t] = Je(r[t]);
     }), e;
   }
   return r;
 }
-function $(r, e) {
-  if (r === e || r instanceof l && (r.isInlineValue() || r.getValue() !== void 0) && $(r.getValue() ?? null, e) || e instanceof l && (e.isInlineValue() || e.getValue() !== void 0) && $(r, e.getValue() ?? null))
+function U(r, e) {
+  if (r === e || r instanceof a && (r.isInlineValue() || r.getValue() !== void 0) && U(r.getValue() ?? null, e) || e instanceof a && (e.isInlineValue() || e.getValue() !== void 0) && U(r, e.getValue() ?? null))
     return !0;
-  if (r instanceof l && e instanceof l || j(r) && j(e) || j(r) && typeof e == "number" || typeof r == "number" && j(e))
+  if (r instanceof a && e instanceof a || M(r) && M(e) || M(r) && typeof e == "number" || typeof r == "number" && M(e))
     return r.toString() === e.toString();
   if (Array.isArray(r) && Array.isArray(e))
-    return r.length === e.length && r.every((t, n) => $(t, e[n]));
-  if (U(r) && U(e)) {
+    return r.length === e.length && r.every((t, n) => U(t, e[n]));
+  if ($(r) && $(e)) {
     const t = Object.keys(r), n = Object.keys(e);
-    return t.length === n.length && t.every((s) => $(r[s], e[s]));
+    return t.length === n.length && t.every((s) => U(r[s], e[s]));
   }
   return !1;
 }
-function mt(r, e) {
-  const { parent: t, key: n } = H(r, J(e));
-  return Ke(t, n);
+function At(r, e) {
+  const { parent: t, key: n } = te(r, ee(e));
+  return rt(t, n);
 }
-function It(r, e, t) {
-  const n = J(e);
+function Ct(r, e, t) {
+  const n = ee(e);
   if (n.length === 0 && e === "/") {
-    const o = v(t);
+    const o = B(t);
     r.setValue(o.getValue() ?? null), o.getItems() ? r.setItems(o.getItems()) : r.setItems(void 0);
     return;
   }
-  const { parent: s, key: i } = H(r, n);
-  pe(s, i, t, !0);
+  const { parent: s, key: i } = te(r, n);
+  we(s, i, t, !0);
 }
-function gr(r, e, t) {
-  const n = J(e);
+function Er(r, e, t) {
+  const n = ee(e);
   if (n.length === 0 && e === "/") {
     if (r.getItems() && Array.isArray(t)) {
-      const o = v(t);
+      const o = B(t);
       o.getItems() ? (r.setItems(o.getItems()), r.setValue(null)) : (r.setValue(o.getValue() ?? null), r.setItems(void 0));
     } else {
-      const o = v(t);
+      const o = B(t);
       r.setValue(o.getValue() ?? null), o.getItems() && r.setItems(o.getItems());
     }
     return !0;
   }
-  const { parent: s, key: i } = H(r, n);
-  return pe(s, i, t, !1), !0;
+  const { parent: s, key: i } = te(r, n);
+  return we(s, i, t, !1), !0;
 }
-function mr(r, e, t) {
-  const n = J(e);
+function Nr(r, e, t) {
+  const n = ee(e);
   if (n.length === 0 && e === "/") {
-    const c = v(t);
+    const c = B(t);
     return r.setValue(c.getValue() ?? null), c.getItems() ? r.setItems(c.getItems()) : r.setItems(void 0), !0;
   }
-  const { parent: s, key: i, actualTarget: o } = H(r, n);
-  if (o !== void 0 && s instanceof l)
-    Xe(s, i, t);
+  const { parent: s, key: i, actualTarget: o } = te(r, n);
+  if (o !== void 0 && s instanceof a)
+    nt(s, i, t);
   else {
-    const c = Ke(s, i), a = Array.isArray(s) || s instanceof l && s.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
+    const c = rt(s, i), l = Array.isArray(s) || s instanceof a && s.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
     if (c === void 0) {
-      if (a)
+      if (l)
         throw new Error(
           `REPLACE failed: Target array index '${i.toString()}' is out of bounds or does not exist at path '${e}'.`
         );
-      pe(s, i, t, !0);
+      we(s, i, t, !0);
     } else
-      pe(s, i, t, !0);
+      we(s, i, t, !0);
   }
   return !0;
 }
-function bt(r, e) {
-  const t = J(e);
+function Vt(r, e) {
+  const t = ee(e);
   if (t.length === 0 && e === "/")
     return r.setValue(null), r.setItems(void 0), r.setProperties(void 0), !0;
-  const { parent: n, key: s } = H(r, t);
-  return yr(n, s), !0;
+  const { parent: n, key: s } = te(r, t);
+  return Br(n, s), !0;
 }
-function Ir(r, e, t) {
-  const n = $e(mt(r, e));
-  return It(r, t, n), !0;
+function Sr(r, e, t) {
+  const n = Je(At(r, e));
+  return Ct(r, t, n), !0;
 }
-function br(r, e, t) {
-  const n = J(e), { parent: s, key: i } = H(r, n), o = Ke(s, i);
+function Pr(r, e, t) {
+  const n = ee(e), { parent: s, key: i } = te(r, n), o = rt(s, i);
   if (o === void 0)
     throw new Error(`MOVE failed: 'from' location '${e}' does not exist.`);
-  return bt(r, e) ? (It(r, t, o), !0) : !1;
+  return Vt(r, e) ? (Ct(r, t, o), !0) : !1;
 }
-function Tr(r, e, t) {
-  const n = mt(r, e);
+function Ar(r, e, t) {
+  const n = At(r, e);
   let s = t;
-  if (n instanceof l)
-    if ((t === null || typeof t == "string" || typeof t == "number" || typeof t == "boolean" || j(t)) && (n.isInlineValue() || n.getValue() !== void 0)) {
-      if (!$(n.getValue() ?? null, t))
+  if (n instanceof a)
+    if ((t === null || typeof t == "string" || typeof t == "number" || typeof t == "boolean" || M(t)) && (n.isInlineValue() || n.getValue() !== void 0)) {
+      if (!U(n.getValue() ?? null, t))
         throw new Error(
           `TEST failed at '${e}': Expected ${JSON.stringify(
             t
           )}, got ${JSON.stringify(n.getValue() ?? null)}`
         );
       return !0;
-    } else typeof t == "object" && !(t instanceof l) && (s = v(t));
-  else if (j(n) && typeof t == "number")
-    n instanceof B ? s = new B(t.toString()) : n instanceof A && (s = new A(t.toString()));
-  else if ((n === null || typeof n == "string" || typeof n == "number" || typeof n == "boolean") && j(t)) {
+    } else typeof t == "object" && !(t instanceof a) && (s = B(t));
+  else if (M(n) && typeof t == "number")
+    n instanceof S ? s = new S(t.toString()) : n instanceof C && (s = new C(t.toString()));
+  else if ((n === null || typeof n == "string" || typeof n == "number" || typeof n == "boolean") && M(t)) {
     const i = t;
-    !$(n, i.toString()) && (typeof n == "number" && parseFloat(i.toString()));
+    !U(n, i.toString()) && (typeof n == "number" && parseFloat(i.toString()));
   }
-  if (!$(n, s)) {
-    const i = n instanceof l ? n.toString() : JSON.stringify(n), o = s instanceof l ? s.toString() : JSON.stringify(s);
+  if (!U(n, s)) {
+    const i = n instanceof a ? n.toString() : JSON.stringify(n), o = s instanceof a ? s.toString() : JSON.stringify(s);
     throw new Error(
       `TEST failed at '${e}': Expected ${o}, got ${i}`
     );
   }
   return !0;
 }
-function wr(r, e) {
+function Cr(r, e) {
   switch (e.op) {
     case "add":
-      return gr(r, e.path, e.val);
+      return Er(r, e.path, e.val);
     case "replace":
-      return mr(r, e.path, e.val);
+      return Nr(r, e.path, e.val);
     case "remove":
-      return bt(r, e.path);
+      return Vt(r, e.path);
     case "copy":
-      return Ir(r, e.from, e.path);
+      return Sr(r, e.from, e.path);
     case "move":
-      return br(r, e.from, e.path);
+      return Pr(r, e.from, e.path);
     case "test":
-      return Tr(r, e.path, e.val);
+      return Ar(r, e.path, e.val);
   }
 }
-function Rn(r, e, t = !1) {
+function as(r, e, t = !1) {
   const n = t ? r : r.clone();
-  return wr(n, e), n;
+  return Cr(n, e), n;
 }
-const Fe = Symbol.for("zod-schema-annotations");
-function vr() {
+const Re = Symbol.for("zod-schema-annotations");
+function Vr() {
   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 Tt() {
-  const r = vr();
-  return Fe in r || (r[Fe] = /* @__PURE__ */ new WeakMap()), r[Fe];
+function Ot() {
+  const r = Vr();
+  return Re in r || (r[Re] = /* @__PURE__ */ new WeakMap()), r[Re];
 }
-function W(r, e) {
-  const t = Tt(), n = t.get(r) || {};
+function re(r, e) {
+  const t = Ot(), n = t.get(r) || {};
   return t.set(r, { ...n, ...e }), r;
 }
-const E = (r) => Tt().get(r), Br = (r) => (e) => {
-  const t = E(e);
-  return W(e, {
+const P = (r) => Ot().get(r), Or = (r) => (e) => {
+  const t = P(e);
+  return re(e, {
     ...t,
     blueDescription: r
   });
-}, Er = (r) => {
-  const e = E(r);
-  return d(e) && _e(e.blueDescription) ? e.blueDescription : null;
-}, xn = (r) => Br(r)(f.string().optional()), Pr = f.union([f.string(), f.boolean()]), Ar = (r) => (e) => {
-  const t = E(e);
-  return W(e, {
+}, Dr = (r) => {
+  const e = P(r);
+  return f(e) && We(e.blueDescription) ? e.blueDescription : null;
+}, us = (r) => Or(r)(d.string().optional()), Fr = d.union([d.string(), d.boolean()]), Rr = (r) => (e) => {
+  const t = P(e);
+  return re(e, {
     ...t,
     blueId: r
   });
-}, Nr = (r) => {
-  const e = E(r), t = Pr.safeParse(e == null ? void 0 : e.blueId);
+}, Mr = (r) => {
+  const e = P(r), t = Fr.safeParse(e == null ? void 0 : e.blueId);
   return t.success ? t.data : null;
-}, Un = (r) => Ar(r ?? !0)(f.string()), Sr = (r) => (e) => {
-  const t = E(e);
-  return W(e, {
+}, ds = (r) => Rr(r ?? !0)(d.string()), jr = (r) => (e) => {
+  const t = P(e);
+  return re(e, {
     ...t,
     blueName: r
   });
-}, Cr = (r) => {
-  const e = E(r);
-  return d(e) && _e(e.blueName) ? e.blueName : null;
-}, $n = (r) => {
-  const e = f.string().optional();
-  return Sr(r)(e);
-}, Fr = () => (r) => {
-  const e = E(r);
-  return W(r, {
+}, xr = (r) => {
+  const e = P(r);
+  return f(e) && We(e.blueName) ? e.blueName : null;
+}, fs = (r) => {
+  const e = d.string().optional();
+  return jr(r)(e);
+}, $r = () => (r) => {
+  const e = P(r);
+  return re(r, {
     ...e,
     blueNode: !0
   });
-}, Vr = (r) => {
-  const e = E(r);
-  return d(e) && d(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
-}, wt = (r) => !!Vr(r), Mn = () => {
-  const r = f.instanceof(l);
-  return Fr()(r);
-}, Me = "extendedFrom", Dr = ({
+}, Ur = (r) => {
+  const e = P(r);
+  return f(e) && f(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
+}, Dt = (r) => !!Ur(r), hs = () => {
+  const r = d.instanceof(a);
+  return $r()(r);
+}, Ge = "extendedFrom", Lr = ({
   schema: r,
   baseSchema: e
 }) => {
-  const t = E(r) || {};
-  return W(r, {
+  const t = P(r) || {};
+  return re(r, {
     ...t,
-    [Me]: e
+    [Ge]: e
   });
-}, Or = (r) => {
-  const e = E(r);
-  return d(e) && e[Me] ? e[Me] : null;
-}, vt = (r, e) => {
-  const t = Or(r);
-  return S(t) ? !1 : (t == null ? void 0 : t._def) === (e == null ? void 0 : e._def) ? !0 : vt(t, e);
-}, jr = (r) => new Proxy(r, {
+}, _r = (r) => {
+  const e = P(r);
+  return f(e) && e[Ge] ? e[Ge] : null;
+}, Ft = (r, e) => {
+  const t = _r(r);
+  return N(t) ? !1 : (t == null ? void 0 : t._def) === (e == null ? void 0 : e._def) ? !0 : Ft(t, e);
+}, Zr = (r) => new Proxy(r, {
   get(e, t, n) {
     return t === "extend" ? function(...s) {
       const i = e.extend(...s);
-      return Dr({
+      return Lr({
         schema: i,
         baseSchema: e
       });
     } : Reflect.get(e, t, n);
   }
-}), Rr = f.object({
-  value: f.array(f.string()).optional(),
-  defaultValue: f.string().optional()
-}), xr = (r) => {
-  const e = E(r), t = Rr.passthrough().safeParse(e == null ? void 0 : e.typeBlueId);
+}), kr = d.object({
+  value: d.array(d.string()).optional(),
+  defaultValue: d.string().optional()
+}), Jr = (r) => {
+  const e = P(r), t = kr.passthrough().safeParse(e == null ? void 0 : e.typeBlueId);
   return t.success ? t.data : null;
-}, Ln = (r) => (e) => {
-  const t = E(e), n = typeof r == "string" ? { value: [r] } : r, s = jr(e);
-  return W(s, {
+}, ps = (r) => (e) => {
+  const t = P(e), n = typeof r == "string" ? { value: [r] } : r, s = Zr(e);
+  return re(s, {
     ...t,
     typeBlueId: {
       ...(t == null ? void 0 : t.typeBlueId) || {},
@@ -1350,34 +1349,34 @@ const E = (r) => Tt().get(r), Br = (r) => (e) => {
     }
   });
 };
-class Ee {
+class Ce {
   static resolveBlueId(e) {
     var i;
-    const t = xr(e);
-    if (S(t))
+    const t = Jr(e);
+    if (N(t))
       return null;
     const n = t.defaultValue;
-    if (d(n))
+    if (f(n))
       return n;
     const s = (i = t.value) == null ? void 0 : i[0];
-    return d(s) ? s : Ee.getRepositoryBlueId(t, e);
+    return f(s) ? s : Ce.getRepositoryBlueId(t, e);
   }
   static getRepositoryBlueId(e, t) {
     throw new Error("Not implemented");
   }
 }
-class P {
+class A {
   // TODO: Enhance to support schemas associated with multiple blueIds
   static isTypeOf(e, t, n) {
     var o;
-    const s = Ee.resolveBlueId(t), i = (o = e.getType()) == null ? void 0 : o.getBlueId();
-    if (S(s) || S(i))
+    const s = Ce.resolveBlueId(t), i = (o = e.getType()) == null ? void 0 : o.getBlueId();
+    if (N(s) || N(i))
       return !1;
     if (s === i)
       return !0;
-    if (n != null && n.checkSchemaExtensions && d(n.typeSchemaResolver)) {
+    if (n != null && n.checkSchemaExtensions && f(n.typeSchemaResolver)) {
       const c = n.typeSchemaResolver.resolveSchema(e);
-      return P.checkSchemaExtension(c, t);
+      return A.checkSchemaExtension(c, t);
     }
     return !1;
   }
@@ -1385,19 +1384,19 @@ class P {
    * Checks if a schema extends a base schema.
    */
   static checkSchemaExtension(e, t) {
-    if (!d(e))
+    if (!f(e))
       return !1;
-    const n = P.unwrapSchema(e), s = P.unwrapSchema(t);
-    return vt(n, s);
+    const n = A.unwrapSchema(e), s = A.unwrapSchema(t);
+    return Ft(n, s);
   }
   static isWrapperType(e) {
-    return e instanceof it || e instanceof ot || e instanceof ct || e instanceof lt || e instanceof ue || e instanceof fe;
+    return e instanceof ht || e instanceof pt || e instanceof yt || e instanceof gt || e instanceof me || e instanceof Ie;
   }
   static unwrapSchema(e) {
-    return wt(e) ? e : P.isWrapperType(e) ? e instanceof ue ? P.unwrapSchema(e.innerType()) : e instanceof fe ? P.unwrapSchema(e.schema) : P.unwrapSchema(e.unwrap()) : e;
+    return Dt(e) ? e : A.isWrapperType(e) ? e instanceof me ? A.unwrapSchema(e.innerType()) : e instanceof Ie ? A.unwrapSchema(e.schema) : A.unwrapSchema(e.unwrap()) : e;
   }
 }
-class Ur {
+class Gr {
   constructor(e) {
     u(this, "blueIdMap", /* @__PURE__ */ new Map());
     this.registerSchemas(e);
@@ -1407,8 +1406,8 @@ class Ur {
       this.registerSchema(t);
   }
   registerSchema(e) {
-    const t = Ee.resolveBlueId(e);
-    if (d(t)) {
+    const t = Ce.resolveBlueId(e);
+    if (f(t)) {
       if (this.blueIdMap.has(t))
         throw new Error(`Duplicate BlueId value: ${t}`);
       this.blueIdMap.set(t, e);
@@ -1416,74 +1415,74 @@ class Ur {
   }
   resolveSchema(e) {
     const t = this.getEffectiveBlueId(e);
-    return S(t) ? null : this.blueIdMap.get(t);
+    return N(t) ? null : this.blueIdMap.get(t);
   }
   getEffectiveBlueId(e) {
     const t = e.getType();
-    return d(t) && d(t.getBlueId()) ? t.getBlueId() : d(t) ? F.calculateBlueIdSync(t) : null;
+    return f(t) && f(t.getBlueId()) ? t.getBlueId() : f(t) ? w.calculateBlueIdSync(t) : null;
   }
   getBlueIdMap() {
     return new Map(this.blueIdMap);
   }
 }
-class Bt {
+class Rt {
   static convertValue(e, t) {
     var i;
     const n = (i = e.getType()) == null ? void 0 : i.getBlueId(), s = e.getValue();
-    return S(s) ? this.isPrimitive(t) ? this.getDefaultPrimitiveValue(t) : s : re === n ? this.convertFromString(String(s), t) : ne === n || s instanceof A ? this.convertFromBigDecimal(
-      new A(s == null ? void 0 : s.toString()),
+    return N(s) ? this.isPrimitive(t) ? this.getDefaultPrimitiveValue(t) : s : H === n ? this.convertFromString(String(s), t) : X === n || s instanceof C ? this.convertFromBigDecimal(
+      new C(s == null ? void 0 : s.toString()),
       t
-    ) : se === n || s instanceof B ? this.convertFromBigInteger(
-      new B(s == null ? void 0 : s.toString()),
+    ) : q === n || s instanceof S ? this.convertFromBigInteger(
+      new S(s == null ? void 0 : s.toString()),
       t
-    ) : ie === n || typeof s == "boolean" ? this.convertFromBoolean(!!s, t) : this.convertFromString(String(s), t);
+    ) : Q === n || typeof s == "boolean" ? this.convertFromBoolean(!!s, t) : this.convertFromString(String(s), t);
   }
   static convertFromString(e, t) {
-    if (!t || t instanceof k || t instanceof Ot || t instanceof jt)
+    if (!t || t instanceof k || t instanceof Jt || t instanceof Gt)
       return e;
-    if (t instanceof _)
+    if (t instanceof J)
       return Number(e);
-    if (t instanceof ce)
+    if (t instanceof pe)
       return e.toLowerCase() === "true";
-    if (t instanceof le)
+    if (t instanceof ye)
       return BigInt(e);
     throw new Error(`Cannot convert String to ${t._def.typeName}`);
   }
   static convertFromBigDecimal(e, t) {
-    if (t instanceof _)
+    if (t instanceof J)
       return e.toNumber();
     if (t instanceof k)
       return e.toString();
     throw new Error(`Cannot convert Number to ${t._def.typeName}`);
   }
   static convertFromBigInteger(e, t) {
-    if (t instanceof _)
+    if (t instanceof J)
       return e.toNumber();
-    if (t instanceof le)
+    if (t instanceof ye)
       return BigInt(e.toString());
     if (t instanceof k)
       return e.toString();
     throw new Error(`Cannot convert Number to ${t._def.typeName}`);
   }
   static convertFromBoolean(e, t) {
-    if (!t || t instanceof ce)
+    if (!t || t instanceof pe)
       return e;
     if (t instanceof k)
       return e.toString();
-    if (t instanceof _)
+    if (t instanceof J)
       return Number(e);
-    if (t instanceof le)
+    if (t instanceof ye)
       return BigInt(e);
     throw new Error(`Cannot convert Boolean to ${t._def.typeName}`);
   }
   static isPrimitive(e) {
-    return e ? e instanceof k || e instanceof _ || e instanceof ce || e instanceof le : !1;
+    return e ? e instanceof k || e instanceof J || e instanceof pe || e instanceof ye : !1;
   }
   static getDefaultPrimitiveValue(e) {
     if (!e) return null;
-    if (e instanceof _)
+    if (e instanceof J)
       return 0;
-    if (e instanceof ce)
+    if (e instanceof pe)
       return !1;
     if (e instanceof k)
       return "";
@@ -1492,12 +1491,12 @@ class Bt {
     );
   }
 }
-class $r {
+class Yr {
   convert(e, t) {
-    return Bt.convertValue(e, t);
+    return Rt.convertValue(e, t);
   }
 }
-class Mr {
+class zr {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -1505,69 +1504,69 @@ class Mr {
    * Check if the valueSchema can handle structured data (contracts should be processed specially)
    */
   canHandleStructuredData(e) {
-    return e instanceof at || e instanceof Oe || e instanceof je || e instanceof ut || e instanceof ft;
+    return e instanceof mt || e instanceof Ue || e instanceof Le || e instanceof It || e instanceof Tt;
   }
   convert(e, t) {
     return this.convertFields(e, t);
   }
   convertFields(e, t) {
-    if (t instanceof Rt) {
+    if (t instanceof Yt) {
       const n = t._def.left, s = t._def.right, i = this.convert(e, n), o = this.convert(e, s);
       return { ...i, ...o };
     }
-    if (t instanceof xt)
+    if (t instanceof zt)
       throw new Error("Union not supported");
-    if (t instanceof Oe)
+    if (t instanceof Ue)
       return Object.keys(t.shape).reduce((s, i) => {
-        const o = e.getProperties(), c = t.shape[i], a = Nr(c);
-        if (d(a)) {
-          const h = _e(a) ? a : i, w = o == null ? void 0 : o[h], V = w ? F.calculateBlueIdSync(w) : void 0;
-          return s[i] = V, s;
+        const o = e.getProperties(), c = t.shape[i], l = Mr(c);
+        if (f(l)) {
+          const g = We(l) ? l : i, v = o == null ? void 0 : o[g], D = v ? w.calculateBlueIdSync(v) : void 0;
+          return s[i] = D, s;
         }
-        const y = Cr(c);
-        if (d(y)) {
-          const h = o == null ? void 0 : o[y];
-          return s[i] = h == null ? void 0 : h.getName(), s;
+        const h = xr(c);
+        if (f(h)) {
+          const g = o == null ? void 0 : o[h];
+          return s[i] = g == null ? void 0 : g.getName(), s;
         }
-        const b = Er(c);
-        if (d(b)) {
-          const h = o == null ? void 0 : o[b];
-          return s[i] = h == null ? void 0 : h.getDescription(), s;
+        const T = Dr(c);
+        if (f(T)) {
+          const g = o == null ? void 0 : o[T];
+          return s[i] = g == null ? void 0 : g.getDescription(), s;
         }
         if (i === "name") {
-          const h = e.getName();
-          return s[i] = h, s;
+          const g = e.getName();
+          return s[i] = g, s;
         }
         if (i === "description") {
-          const h = e.getDescription();
-          return s[i] = h, s;
+          const g = e.getDescription();
+          return s[i] = g, s;
         }
-        const I = e.getContracts();
-        if (i === "contracts" && d(I) && this.canHandleStructuredData(c)) {
-          const h = Object.fromEntries(
-            Object.entries(I).map(([V, oe]) => [
-              V,
-              T.get(oe)
+        const b = e.getContracts();
+        if (i === "contracts" && f(b) && this.canHandleStructuredData(c)) {
+          const g = Object.fromEntries(
+            Object.entries(b).map(([D, he]) => [
+              D,
+              y.get(he)
             ])
-          ), w = p.deserialize(h);
+          ), v = p.deserialize(g);
           s[i] = this.nodeToObjectConverter.convert(
-            w,
+            v,
             c
           );
         }
-        const m = o == null ? void 0 : o[i];
-        if (S(m))
+        const I = o == null ? void 0 : o[i];
+        if (N(I))
           return s;
-        const g = this.nodeToObjectConverter.convert(
-          m,
+        const m = this.nodeToObjectConverter.convert(
+          I,
           c
         );
-        return s[i] = g, s;
+        return s[i] = m, s;
       }, {});
     throw new Error("Unknown schema type, " + t._def.typeName);
   }
 }
-class Lr {
+class Kr {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -1581,7 +1580,7 @@ class Lr {
     );
   }
 }
-class Zr {
+class Wr {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -1595,7 +1594,7 @@ class Zr {
     return new Set(i);
   }
 }
-class kr {
+class Hr {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -1603,52 +1602,52 @@ class kr {
    * Check if the valueSchema can handle structured data (contracts should be processed specially)
    */
   canHandleStructuredData(e) {
-    return e instanceof at || e instanceof Oe || e instanceof je || e instanceof ut || e instanceof ft;
+    return e instanceof mt || e instanceof Ue || e instanceof Le || e instanceof It || e instanceof Tt;
   }
   convert(e, t) {
     const n = t.keySchema, s = t.valueSchema, i = /* @__PURE__ */ new Map(), o = e.getName();
-    d(o) && i.set(Y, o);
+    f(o) && i.set(Y, o);
     const c = e.getDescription();
-    d(c) && i.set(G, c);
-    const a = e.getContracts();
-    if (d(a) && this.canHandleStructuredData(s)) {
-      let b = !1;
-      const I = Object.entries(a).reduce(
-        (m, [g, h]) => {
+    f(c) && i.set(z, c);
+    const l = e.getContracts();
+    if (f(l) && this.canHandleStructuredData(s)) {
+      let T = !1;
+      const b = Object.entries(l).reduce(
+        (I, [m, g]) => {
           try {
-            const w = this.nodeToObjectConverter.convert(
-              h,
+            const v = this.nodeToObjectConverter.convert(
+              g,
               s
             );
-            w != null && !Number.isNaN(w) && (m[g] = w, b = !0);
+            v != null && !Number.isNaN(v) && (I[m] = v, T = !0);
           } catch {
           }
-          return m;
+          return I;
         },
         {}
       );
-      b && i.set(ve, I);
+      T && i.set(Pe, b);
     }
-    const y = e.getProperties();
-    return d(y) && Object.entries(y).forEach(([b, I]) => {
-      const m = new l().setValue(b);
-      m.setType(new l().setBlueId(re));
-      const g = Bt.convertValue(m, n), h = this.nodeToObjectConverter.convert(I, s);
-      i.set(g, h);
-    }), t instanceof je ? Object.fromEntries(i) : i;
+    const h = e.getProperties();
+    return f(h) && Object.entries(h).forEach(([T, b]) => {
+      const I = new a().setValue(T);
+      I.setType(new a().setBlueId(H));
+      const m = Rt.convertValue(I, n), g = this.nodeToObjectConverter.convert(b, s);
+      i.set(m, g);
+    }), t instanceof Le ? Object.fromEntries(i) : i;
   }
 }
-class _r {
+class Xr {
   convert(e) {
-    return T.get(e);
+    return y.get(e);
   }
 }
-class Yr {
+class qr {
   convert(e) {
-    return T.get(e);
+    return y.get(e);
   }
 }
-class Gr {
+class Qr {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -1662,73 +1661,73 @@ class Gr {
     );
   }
 }
-const zr = 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")
+const en = d.union([
+  d.literal("ZodString"),
+  d.literal("ZodNumber"),
+  d.literal("ZodBoolean"),
+  d.literal("ZodBigInt"),
+  d.literal("ZodArray"),
+  d.literal("ZodSet"),
+  d.literal("ZodMap"),
+  d.literal("ZodRecord"),
+  d.literal("ZodObject"),
+  d.literal("ZodEnum"),
+  d.literal("ZodNativeEnum"),
+  d.literal("ZodUnknown"),
+  d.literal("ZodAny"),
+  d.literal("ZodTuple")
 ]);
-class Jr {
+class tn {
   constructor(e) {
     u(this, "converters", /* @__PURE__ */ new Map());
     u(this, "complexObjectConverter");
-    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new Mr(
+    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new zr(
       this.nodeToObjectConverter
     );
   }
   registerConverters() {
-    const e = new $r(), t = new Lr(this.nodeToObjectConverter), n = new Gr(this.nodeToObjectConverter), s = new Zr(this.nodeToObjectConverter), i = new kr(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 _r()), this.converters.set("ZodAny", new Yr()), this.converters.set("ZodArray", t), this.converters.set("ZodTuple", n), this.converters.set("ZodSet", s), this.converters.set("ZodMap", i), this.converters.set("ZodRecord", i), this.converters.set("ZodObject", this.complexObjectConverter);
+    const e = new Yr(), t = new Kr(this.nodeToObjectConverter), n = new Qr(this.nodeToObjectConverter), s = new Wr(this.nodeToObjectConverter), i = new Hr(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 Xr()), this.converters.set("ZodAny", new qr()), this.converters.set("ZodArray", t), this.converters.set("ZodTuple", n), this.converters.set("ZodSet", s), 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;
   }
   isWrapperType(e) {
-    return e instanceof it || e instanceof ot || e instanceof ct || e instanceof lt || e instanceof ue || e instanceof fe;
+    return e instanceof ht || e instanceof pt || e instanceof yt || e instanceof gt || e instanceof me || e instanceof Ie;
   }
   getSchemaTypeName(e) {
     if (this.isWrapperType(e))
-      return e instanceof ue ? this.getSchemaTypeName(e.innerType()) : e instanceof fe ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
+      return e instanceof me ? this.getSchemaTypeName(e.innerType()) : e instanceof Ie ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
     const t = e._def.typeName;
     try {
-      return zr.parse(t);
+      return en.parse(t);
     } catch {
       throw new Error(`Schema type name ${t} is not supported`);
     }
   }
 }
-class Hr {
+class rn {
   constructor(e) {
     u(this, "converterFactory");
-    this.typeSchemaResolver = e, this.converterFactory = new Jr(this);
+    this.typeSchemaResolver = e, this.converterFactory = new tn(this);
   }
   convert(e, t) {
     var o;
-    const n = (o = this.typeSchemaResolver) == null ? void 0 : o.resolveSchema(e), s = P.unwrapSchema(t);
-    if (wt(s))
+    const n = (o = this.typeSchemaResolver) == null ? void 0 : o.resolveSchema(e), s = A.unwrapSchema(t);
+    if (Dt(s))
       return e;
     let i = s;
-    return P.checkSchemaExtension(
+    return A.checkSchemaExtension(
       n,
       s
-    ) && d(n) && (i = n), this.convertWithType(e, i);
+    ) && f(n) && (i = n), this.convertWithType(e, i);
   }
   convertWithType(e, t) {
     return this.converterFactory.getConverter(t).convert(e, t);
   }
 }
-class Pe {
+class fe {
   /**
    * Fetches the first node associated with the given Blue ID
    * Default implementation that takes the first node from fetchByBlueId result
@@ -1741,14 +1740,14 @@ class Pe {
     return t && t.length > 0 ? t[0] : null;
   }
 }
-function Wr(r) {
-  return new class extends Pe {
+function nn(r) {
+  return new class extends fe {
     fetchByBlueId(e) {
       return r(e);
     }
   }();
 }
-class Kr extends Pe {
+class sn extends fe {
   constructor(t) {
     super();
     u(this, "nodeProviders");
@@ -1776,34 +1775,34 @@ class Kr extends Pe {
     return this.nodeProviders;
   }
 }
-const Ve = Z.types.float.options, Xr = {
-  ...Ve,
+const Me = Z.types.float.options, on = {
+  ...Me,
   construct: (r) => {
     const e = r.replace(/_/g, "").toLowerCase();
-    if (!st(e))
-      return new A(e);
-    if (Ve.construct)
-      return Ve.construct(r);
+    if (!ft(e))
+      return new C(e);
+    if (Me.construct)
+      return Me.construct(r);
   }
-}, qr = new Z.Type("tag:yaml.org,2002:float", Xr), De = Z.types.int.options, Qr = {
-  ...De,
+}, cn = new Z.Type("tag:yaml.org,2002:float", on), je = Z.types.int.options, ln = {
+  ...je,
   construct: (r) => {
     let e = r;
-    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !st(e))
-      return new B(e);
-    if (De.construct)
-      return De.construct(r);
-  }
-}, en = new Z.Type("tag:yaml.org,2002:int", Qr), Et = Z.CORE_SCHEMA.extend({
-  implicit: [qr, en]
-}), te = (r) => {
-  const e = Z.load(r, { schema: Et });
+    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !ft(e))
+      return new S(e);
+    if (je.construct)
+      return je.construct(r);
+  }
+}, an = new Z.Type("tag:yaml.org,2002:int", ln), Mt = Z.CORE_SCHEMA.extend({
+  implicit: [cn, an]
+}), W = (r) => {
+  const e = Z.load(r, { schema: Mt });
   return e === void 0 ? void 0 : e;
-}, Zn = (r) => Z.dump(r, {
-  schema: Et,
+}, ys = (r) => Z.dump(r, {
+  schema: Mt,
   replacer: (e, t) => {
-    if (C(t)) {
-      if (ee(t)) {
+    if (O(t)) {
+      if (le(t)) {
         const n = new x(Number.MIN_SAFE_INTEGER.toString()), s = new x(Number.MAX_SAFE_INTEGER.toString());
         if (t.lt(n) || t.gt(s))
           return t.toString();
@@ -1812,7 +1811,7 @@ const Ve = Z.types.float.options, Xr = {
     }
     return t;
   }
-}), Pt = `- type:
+}), jt = `- type:
     blueId: 27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo
   mappings:
     Text: F92yo19rCcbBoBSpUA5LRxpfDejJDAaP1PRxxbWAraVP
@@ -1823,20 +1822,20 @@ const Ve = Z.types.float.options, Xr = {
     Dictionary: 294NBTj2mFRL3RB4kDRUSckwGg7Kzj6T8CTAFeR1kcSA
 - type:
     blueId: FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4
-`, tn = `name: Transformation
-description: TODO`, rn = `name: Infer Basic Types For Untyped Values
+`, un = `name: Transformation
+description: TODO`, dn = `name: Infer Basic Types For Untyped Values
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation infers type details for Text, Integer, Number and Boolean.`, nn = `name: Replace Inline Types with BlueIds
+description: This transformation infers type details for Text, Integer, Number and Boolean.`, fn = `name: Replace Inline Types with BlueIds
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation replaces`, sn = [
-  Pt,
-  tn,
-  rn,
-  nn
+description: This transformation replaces`, hn = [
+  jt,
+  un,
+  dn,
+  fn
 ];
-class on extends Pe {
+class pn extends fe {
   constructor() {
     super();
     u(this, "blueIdToNodesMap", /* @__PURE__ */ new Map());
@@ -1846,8 +1845,8 @@ class on extends Pe {
     return this.blueIdToNodesMap.get(t) || [];
   }
   load() {
-    for (const t of sn) {
-      const n = te(t);
+    for (const t of hn) {
+      const n = W(t);
       if (n === void 0) {
         console.error(`This content file is not valid YAML: ${t}`);
         continue;
@@ -1855,51 +1854,209 @@ class on extends Pe {
       if (Array.isArray(n)) {
         const s = n.map(
           (o) => p.deserialize(o)
-        ), i = F.calculateBlueIdSync(s);
+        ), i = w.calculateBlueIdSync(s);
         this.blueIdToNodesMap.set(i, s);
       } else {
-        const s = p.deserialize(n), i = F.calculateBlueIdSync(s);
+        const s = p.deserialize(n), i = w.calculateBlueIdSync(s);
         this.blueIdToNodesMap.set(i, [s]);
       }
     }
   }
 }
-const Ie = class Ie extends Pe {
+const Be = class Be extends fe {
   constructor() {
     super();
     u(this, "nodeProvider");
-    this.nodeProvider = new on();
+    this.nodeProvider = new pn();
   }
   fetchByBlueId(t) {
     return this.nodeProvider.fetchByBlueId(t);
   }
 };
-u(Ie, "INSTANCE", new Ie());
-let Le = Ie;
-class ye {
+u(Be, "INSTANCE", new Be());
+let Ye = Be;
+class xe {
+  constructor(e, t, n) {
+    this.blueId = e, this.content = t, this.isMultipleDocuments = n;
+  }
+}
+class ne {
+  static parseAndCalculateBlueId(e, t) {
+    let n;
+    try {
+      const c = W(e);
+      if (c === void 0)
+        throw new Error();
+      n = c;
+    } catch {
+      throw new Error("Failed to parse content as YAML or JSON");
+    }
+    let s, i;
+    const o = Array.isArray(n) && n.length > 1;
+    if (o) {
+      const c = n.map((l) => {
+        const h = p.deserialize(l);
+        return t(h);
+      });
+      s = w.calculateBlueIdSync(c), i = c.map((l) => y.get(l));
+    } else {
+      const c = p.deserialize(n), l = t(c);
+      s = w.calculateBlueIdSync(l), i = y.get(l);
+    }
+    return new xe(s, i, o);
+  }
+  static parseAndCalculateBlueIdForNode(e, t) {
+    const n = t(e), s = w.calculateBlueIdSync(n), i = y.get(n);
+    return new xe(s, i, !1);
+  }
+  static parseAndCalculateBlueIdForNodeList(e, t) {
+    if (!e || e.length === 0)
+      throw new Error("List of nodes cannot be null or empty");
+    const n = e.map(t), s = w.calculateBlueIdSync(n), i = n.map(
+      (c) => y.get(c)
+    ), o = e.length > 1;
+    return new xe(s, i, o);
+  }
+  static resolveThisReferences(e, t, n) {
+    return this.resolveThisReferencesRecursive(
+      e,
+      t,
+      n
+    );
+  }
+  static resolveThisReferencesRecursive(e, t, n) {
+    if (e && typeof e == "object" && !Array.isArray(e)) {
+      const s = {};
+      for (const [i, o] of Object.entries(e))
+        typeof o == "string" ? this.THIS_REFERENCE_PATTERN.test(o) ? s[i] = this.resolveThisReference(
+          o,
+          t,
+          n
+        ) : s[i] = o : o && typeof o == "object" ? s[i] = this.resolveThisReferencesRecursive(
+          o,
+          t,
+          n
+        ) : s[i] = o;
+      return s;
+    } else if (Array.isArray(e))
+      return e.map((s) => typeof s == "string" ? this.THIS_REFERENCE_PATTERN.test(s) ? this.resolveThisReference(
+        s,
+        t,
+        n
+      ) : s : s && typeof s == "object" ? this.resolveThisReferencesRecursive(
+        s,
+        t,
+        n
+      ) : s);
+    return e;
+  }
+  static resolveThisReference(e, t, n) {
+    if (n) {
+      if (!e.startsWith("this#"))
+        throw new Error(
+          "For multiple documents, 'this' references must include an index (e.g., 'this#0')"
+        );
+      return t + e.substring(4);
+    } else {
+      if (e === "this")
+        return t;
+      throw new Error(
+        "For a single document, only 'this' is allowed as a reference, not 'this#<id>'"
+      );
+    }
+  }
+}
+u(ne, "THIS_REFERENCE_PATTERN", /^this(#\d+)?$/);
+class yn extends fe {
+  fetchByBlueId(e) {
+    const t = e.split("#")[0], n = this.fetchContentByBlueId(t);
+    if (n == null)
+      return null;
+    const s = Array.isArray(n) && n.length > 1, i = ne.resolveThisReferences(
+      n,
+      t,
+      s
+    );
+    if (e.includes("#")) {
+      const o = e.split("#");
+      if (o.length > 1) {
+        const c = parseInt(o[1]);
+        if (Array.isArray(i) && c < i.length) {
+          const l = i[c], h = p.deserialize(l);
+          return h.setBlueId(e), [h];
+        } else if (c === 0) {
+          const l = p.deserialize(i);
+          return l.setBlueId(e), [l];
+        } else
+          return null;
+      }
+    }
+    if (Array.isArray(i))
+      return i.map((o) => p.deserialize(o));
+    {
+      const o = p.deserialize(i);
+      return o.setBlueId(t), [o];
+    }
+  }
+}
+class gn extends yn {
+  constructor() {
+    super(...arguments);
+    u(this, "nameToBlueIdsMap", /* @__PURE__ */ new Map());
+  }
   /**
-   * Wraps a NodeProvider with a SequentialNodeProvider that includes bootstrap providers
-   * @param originalProvider - The original NodeProvider to wrap
-   * @returns A wrapped NodeProvider that includes bootstrap providers
+   * Find a node by name. Throws an error if multiple nodes are found with the same name.
+   * @param name - The name to search for
+   * @returns The node if found, or undefined if not found
    */
-  static wrap(e) {
-    return new Kr([
-      Le.INSTANCE,
-      e
+  findNodeByName(t) {
+    const n = this.nameToBlueIdsMap.get(t);
+    if (!n)
+      return;
+    if (n.length > 1)
+      throw new Error(`Multiple nodes found with name: ${t}`);
+    const s = this.fetchByBlueId(n[0]);
+    return s && s.length > 0 ? s[0] : void 0;
+  }
+  /**
+   * Find all nodes with the given name
+   * @param name - The name to search for
+   * @returns Array of nodes with the given name
+   */
+  findAllNodesByName(t) {
+    const n = this.nameToBlueIdsMap.get(t);
+    if (!n)
+      return [];
+    const s = [];
+    for (const i of n) {
+      const o = this.fetchByBlueId(i);
+      o && s.push(...o);
+    }
+    return s;
+  }
+  /**
+   * Add a name to Blue ID mapping
+   * @param name - The name of the node
+   * @param blueId - The Blue ID of the node
+   */
+  addToNameMap(t, n) {
+    this.nameToBlueIdsMap.set(t, [
+      ...this.nameToBlueIdsMap.get(t) || [],
+      n
     ]);
   }
 }
-const At = (r) => r instanceof l || Array.isArray(r) && r.every((e) => e instanceof l) ? r : Te(r) ? r.map((e) => p.deserialize(e)) : p.deserialize(r), cn = async (r) => {
-  const e = At(r);
-  return F.calculateBlueId(e);
-}, kn = (r) => {
-  const e = At(r);
-  return F.calculateBlueIdSync(e);
-}, et = async (r) => {
-  if (Qt(r))
+const xt = (r) => r instanceof a || Array.isArray(r) && r.every((e) => e instanceof a) ? r : Ne(r) ? r.map((e) => p.deserialize(e)) : p.deserialize(r), mn = async (r) => {
+  const e = xt(r);
+  return w.calculateBlueId(e);
+}, gs = (r) => {
+  const e = xt(r);
+  return w.calculateBlueIdSync(e);
+}, lt = async (r) => {
+  if (cr(r))
     return r;
   try {
-    const e = he.parse(r), t = await cn(e);
+    const e = be.parse(r), t = await mn(e);
     return {
       ...r,
       blueId: t
@@ -1907,53 +2064,53 @@ const At = (r) => r instanceof l || Array.isArray(r) && r.every((e) => e instanc
   } catch (e) {
     throw new Error(`Failed enriching object with Blue ID: ${e}`);
   }
-}, _n = (r) => r == null ? void 0 : r.items, Yn = (r) => r == null ? void 0 : r.value, Gn = (r) => S(r) ? {} : dt(
+}, ms = (r) => r == null ? void 0 : r.items, Is = (r) => r == null ? void 0 : r.value, Ts = (r) => N(r) ? {} : bt(
   r,
-  kt
-), zn = (r) => tr(r) ? r.type.name ?? null : rr(r) ? Ut(typeof r.value) : er(r) ? "List" : null, ln = (r) => d(r) && Object.keys(dt(r, ["blueId"])).length > 0, Jn = (r) => {
+  Qt
+), bs = (r) => ar(r) ? r.type.name ?? null : ur(r) ? Kt(typeof r.value) : lr(r) ? "List" : null, In = (r) => f(r) && Object.keys(bt(r, ["blueId"])).length > 0, ws = (r) => {
   try {
-    const e = p.deserialize(r), t = T.get(e);
-    return Q.parse(t);
+    const e = p.deserialize(r), t = y.get(e);
+    return ce.parse(t);
   } catch (e) {
     throw new Error(
       `Failed transforming JSON-like value to BlueObject: ${e}`
     );
   }
-}, tt = async (r) => {
+}, at = async (r) => {
   const {
     resolveFunction: e,
     signal: t = new AbortController().signal,
     omitItems: n
   } = r, s = r.count ?? r.items.length;
-  let i = await $t(r.items, async (c) => await et(c));
+  let i = await Wt(r.items, async (c) => await lt(c));
   const o = Math.max((i == null ? void 0 : i.length) - s, 0);
   for (let c = i.length - 1; c >= o; c--)
-    if (!ln(i[c])) {
-      const a = await e(i[c], { signal: t });
-      if (Array.isArray(a))
-        return tt({
+    if (!In(i[c])) {
+      const l = await e(i[c], { signal: t });
+      if (Array.isArray(l))
+        return at({
           ...r,
           items: [
             ...i.slice(0, c),
-            ...a,
+            ...l,
             ...i.slice(c + 1)
           ]
         });
-      const y = await et(a);
-      if (n != null && n.includes(y.blueId))
-        return tt({
+      const h = await lt(l);
+      if (n != null && n.includes(h.blueId))
+        return at({
           ...r,
           items: [...i.slice(0, c), ...i.slice(c + 1)]
         });
       i = [
         ...i.slice(0, c),
-        y,
+        h,
         ...i.slice(c + 1)
       ];
     }
   return i;
 };
-function ae(r) {
+function ge(r) {
   try {
     const e = new URL(r);
     return e.protocol === "http:" || e.protocol === "https:";
@@ -1961,14 +2118,14 @@ function ae(r) {
     return !1;
   }
 }
-class an {
+class Tn {
   /**
    * Process a document node to infer basic types for untyped values
    * @param document - The document to process
    * @returns The processed document
    */
   process(e) {
-    return N.transform(e, this.inferType.bind(this));
+    return V.transform(e, this.inferType.bind(this));
   }
   /**
    * Infer a basic type for a node
@@ -1977,23 +2134,23 @@ class an {
    */
   inferType(e) {
     const t = e.getType(), n = e.getValue();
-    return S(t) && d(n) && (typeof n == "string" ? e.setType(new l().setBlueId(re)) : typeof n == "bigint" || ee(n) ? e.setType(new l().setBlueId(se)) : nr(n) ? e.setType(new l().setBlueId(ne)) : typeof n == "boolean" && e.setType(new l().setBlueId(ie))), e;
+    return N(t) && f(n) && (typeof n == "string" ? e.setType(new a().setBlueId(H)) : typeof n == "bigint" || le(n) ? e.setType(new a().setBlueId(q)) : dr(n) ? e.setType(new a().setBlueId(X)) : typeof n == "boolean" && e.setType(new a().setBlueId(Q))), e;
   }
 }
-const K = class K {
+const se = class se {
   /**
    * Creates a new processor with the given transformation node or mappings
    * @param transformationOrMappings - The transformation node or mappings to use
    */
   constructor(e) {
     u(this, "mappings", /* @__PURE__ */ new Map());
-    if (e instanceof l) {
+    if (e instanceof a) {
       const n = e.getProperties();
-      if (n && n[K.MAPPINGS]) {
-        const i = n[K.MAPPINGS].getProperties();
+      if (n && n[se.MAPPINGS]) {
+        const i = n[se.MAPPINGS].getProperties();
         i && Object.entries(i).forEach(([o, c]) => {
-          const a = c.getValue();
-          typeof a == "string" && this.mappings.set(o, a);
+          const l = c.getValue();
+          typeof l == "string" && this.mappings.set(o, l);
         });
       }
     } else
@@ -2005,7 +2162,7 @@ const K = class K {
    * @returns The processed document
    */
   process(e) {
-    return N.transform(e, this.transformNode.bind(this));
+    return V.transform(e, this.transformNode.bind(this));
   }
   transformNode(e) {
     const t = e.clone();
@@ -2017,16 +2174,16 @@ const K = class K {
       if (this.mappings.has(n)) {
         const s = this.mappings.get(n);
         if (s) {
-          const i = new l().setBlueId(s);
+          const i = new a().setBlueId(s);
           t === e.getType() ? e.setType(i) : t === e.getItemType() ? e.setItemType(i) : t === e.getKeyType() ? e.setKeyType(i) : t === e.getValueType() && e.setValueType(i);
         }
       }
     }
   }
 };
-u(K, "MAPPINGS", "mappings");
-let Ze = K;
-class un {
+u(se, "MAPPINGS", "mappings");
+let ze = se;
+class st {
   /**
    * Creates a new NodeExtender with the specified NodeProvider and optional strategy
    * @param nodeProvider - The NodeProvider to use for resolving nodes
@@ -2035,7 +2192,7 @@ class un {
   constructor(e, t) {
     u(this, "nodeProvider");
     u(this, "strategy");
-    this.nodeProvider = ye.wrap(e), this.strategy = t || "THROW_EXCEPTION";
+    this.nodeProvider = ue.wrap(e), this.strategy = t || "THROW_EXCEPTION";
   }
   /**
    * Extends a node with its resolved references
@@ -2053,38 +2210,40 @@ class un {
     }
     try {
       const i = e.getBlueId();
-      if (i && !(i in We)) {
-        const g = this.fetchNode(e);
-        if (g && g.length > 0)
-          if (g.length === 1) {
-            const h = g[0];
-            this.mergeNodes(e, h);
+      if (i && !de.includes(
+        i
+      )) {
+        const m = this.fetchNode(e);
+        if (m && m.length > 0)
+          if (m.length === 1) {
+            const g = m[0];
+            this.mergeNodes(e, g);
           } else {
-            const h = g.map((V) => V.clone()), w = new l().setItems(h);
-            this.mergeNodes(e, w);
+            const g = m.map((D) => D.clone()), v = new a().setItems(g);
+            this.mergeNodes(e, v);
           }
       }
       const o = e.getType();
       o && this.extendNode(o, t, "type", !0);
       const c = e.getItemType();
       c && this.extendNode(c, t, "itemType", !0);
-      const a = e.getKeyType();
-      a && this.extendNode(a, t, "keyType", !0);
-      const y = e.getValueType();
-      y && this.extendNode(y, t, "valueType", !0);
-      const b = e.getProperties();
-      b && Object.entries(b).forEach(([g, h]) => {
-        this.extendNode(h, t, g, !1);
+      const l = e.getKeyType();
+      l && this.extendNode(l, t, "keyType", !0);
+      const h = e.getValueType();
+      h && this.extendNode(h, t, "valueType", !0);
+      const T = e.getProperties();
+      T && Object.entries(T).forEach(([m, g]) => {
+        this.extendNode(g, t, m, !1);
       });
-      const I = e.getContracts();
-      I && Object.entries(I).forEach(([g, h]) => {
-        this.extendNode(h, t, g, !1);
+      const b = e.getContracts();
+      b && Object.entries(b).forEach(([m, g]) => {
+        this.extendNode(g, t, m, !1);
       });
-      const m = e.getItems();
-      if (m && m.length > 0) {
-        this.reconstructList(m);
-        for (let g = 0; g < m.length; g++)
-          this.extendNode(m[g], t, String(g), !1);
+      const I = e.getItems();
+      if (I && I.length > 0) {
+        this.reconstructList(I);
+        for (let m = 0; m < I.length; m++)
+          this.extendNode(I[m], t, String(m), !1);
       }
     } finally {
       s || t.exitPathSegment();
@@ -2117,16 +2276,18 @@ class un {
     return n;
   }
   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()), e.setValue(t.getValue() ?? null), e.setItems(t.getItems()), e.setProperties(t.getProperties()), e.setContracts(t.getContracts());
+    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 n = t.getValue();
+    f(n) && e.setValue(n), e.setItems(t.getItems()), e.setProperties(t.getProperties()), e.setContracts(t.getContracts());
   }
 }
-class fn {
+class $t {
 }
-function rt(r, e) {
+function ut(r, e) {
   const t = r.split(e), n = [...t].reverse().findIndex((i) => i !== ""), s = n === -1 ? 0 : t.length - n;
   return t.slice(0, s);
 }
-class Nt extends fn {
+class it extends $t {
   /**
    * Creates path limits with the specified paths and max depth
    * @param allowedPaths - The paths to limit extension to
@@ -2178,7 +2339,7 @@ class Nt extends fn {
    * @returns True if the path matches the allowed path pattern, false otherwise
    */
   matchesAllowedPath(t, n) {
-    const s = rt(t, "/"), i = rt(n, "/");
+    const s = ut(t, "/"), i = ut(n, "/");
     if (i.length > s.length)
       return !1;
     for (let o = 1; o < i.length; o++)
@@ -2220,7 +2381,7 @@ class Nt extends fn {
    * @returns The path limits
    */
   static withMaxDepth(t) {
-    return new nt().setMaxDepth(t).addPath("*").build();
+    return new dt().setMaxDepth(t).addPath("*").build();
   }
   /**
    * Creates path limits with a single path
@@ -2228,10 +2389,10 @@ class Nt extends fn {
    * @returns The path limits
    */
   static withSinglePath(t) {
-    return new nt().addPath(t).build();
+    return new dt().addPath(t).build();
   }
 }
-class nt {
+class dt {
   constructor() {
     u(this, "allowedPaths", /* @__PURE__ */ new Set());
     u(this, "maxDepth", Number.MAX_SAFE_INTEGER);
@@ -2257,10 +2418,37 @@ class nt {
    * @returns The built PathLimits
    */
   build() {
-    return new Nt(this.allowedPaths, this.maxDepth);
+    return new it(this.allowedPaths, this.maxDepth);
   }
 }
-class St {
+class bn extends $t {
+  /**
+   * Determines if a path segment should be extended - always returns true
+   * @returns Always true
+   */
+  shouldExtendPathSegment() {
+    return !0;
+  }
+  /**
+   * Determines if a path segment should be merged - always returns true
+   * @returns Always true
+   */
+  shouldMergePathSegment() {
+    return !0;
+  }
+  /**
+   * Enters a path segment - no-op
+   */
+  enterPathSegment() {
+  }
+  /**
+   * Exits a path segment - no-op
+   */
+  exitPathSegment() {
+  }
+}
+const G = new bn();
+class Ut {
   constructor() {
     u(this, "blueIdsCollections", []);
   }
@@ -2332,7 +2520,7 @@ ${n}`;
     return Object.keys(this.getAllBlueIds()).length;
   }
 }
-const be = class be {
+const Ee = class Ee {
   /**
    * Creates a new Preprocessor with the specified options
    * @param options - Configuration options for the preprocessor
@@ -2345,7 +2533,7 @@ const be = class be {
     const { nodeProvider: t, processorProvider: n, blueIdsMappingGenerator: s } = e;
     if (!t)
       throw new Error("NodeProvider is required");
-    this.nodeProvider = ye.wrap(t), this.processorProvider = n || be.getStandardProvider(), this.blueIdsMappingGenerator = s || new St(), this.loadDefaultSimpleBlue();
+    this.nodeProvider = ue.wrap(t), this.processorProvider = n || Ee.getStandardProvider(), this.blueIdsMappingGenerator = s || new Ut(), this.loadDefaultSimpleBlue();
   }
   /**
    * Preprocesses a document node
@@ -2372,9 +2560,9 @@ const be = class be {
   preprocessWithOptions(e, t) {
     let n = e.clone(), s = n.getBlue();
     if (!s && t && (s = t.clone()), s) {
-      new un(this.nodeProvider).extend(
+      new st(this.nodeProvider).extend(
         s,
-        Nt.withSinglePath("/*")
+        it.withSinglePath("/*")
       );
       const i = s.getItems();
       if (i && i.length > 0) {
@@ -2402,11 +2590,11 @@ const be = class be {
         var i;
         const t = "27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo", n = "FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4", s = (i = e.getType()) == null ? void 0 : i.getBlueId();
         if (t === s)
-          return new Ze(
+          return new ze(
             e
           );
         if (n === s)
-          return new an();
+          return new Tn();
       }
     };
   }
@@ -2426,9 +2614,9 @@ ${t}
    * Loads the default simple Blue node
    */
   loadDefaultSimpleBlue() {
-    const e = this.enrichDefaultBlue(Pt);
+    const e = this.enrichDefaultBlue(jt);
     try {
-      const t = te(e);
+      const t = W(e);
       if (t)
         this.defaultSimpleBlue = p.deserialize(t);
       else
@@ -2438,9 +2626,92 @@ ${t}
     }
   }
 };
-u(be, "DEFAULT_BLUE_BLUE_ID", "FREHAAGDZSzpnoTUoCQ86bBmxbVCULMjvx9JZM6fyqT1");
-let ge = be;
-class dn {
+u(Ee, "DEFAULT_BLUE_BLUE_ID", "FREHAAGDZSzpnoTUoCQ86bBmxbVCULMjvx9JZM6fyqT1");
+let ae = Ee;
+class wn extends gn {
+  constructor(t) {
+    super();
+    u(this, "blueIdToContentMap", /* @__PURE__ */ new Map());
+    u(this, "blueIdToMultipleDocumentsMap", /* @__PURE__ */ new Map());
+    u(this, "preprocessor");
+    const n = new ae({ nodeProvider: this });
+    this.preprocessor = (s) => n.preprocessWithDefaultBlue(s), this.loadRepositories(t);
+  }
+  loadRepositories(t) {
+    for (const n of t)
+      if (n.contents)
+        for (const [s, i] of Object.entries(
+          n.contents
+        ))
+          this.processContent(i, s);
+  }
+  processContent(t, n) {
+    Array.isArray(t) ? this.processMultipleDocuments(t, n) : this.processSingleDocument(t, n);
+  }
+  processSingleDocument(t, n) {
+    const s = p.deserialize(t), i = ne.parseAndCalculateBlueIdForNode(
+      s,
+      this.preprocessor
+    ), o = n || i.blueId;
+    this.blueIdToContentMap.set(o, i.content), this.blueIdToMultipleDocumentsMap.set(o, !1);
+    const c = s.getName();
+    c && this.addToNameMap(c, o);
+  }
+  processMultipleDocuments(t, n) {
+    const s = t.map((c) => {
+      const l = p.deserialize(c);
+      return this.preprocessor(l);
+    }), i = ne.parseAndCalculateBlueIdForNodeList(
+      s,
+      (c) => c
+      // Already preprocessed above
+    ), o = n || i.blueId;
+    this.blueIdToContentMap.set(o, i.content), this.blueIdToMultipleDocumentsMap.set(o, !0), s.forEach((c, l) => {
+      const h = `${o}#${l}`, T = y.get(c), b = w.calculateBlueIdSync(c);
+      this.blueIdToContentMap.set(b, T), this.blueIdToMultipleDocumentsMap.set(b, !1);
+      const I = c.getName();
+      I && this.addToNameMap(I, h);
+    });
+  }
+  fetchContentByBlueId(t) {
+    const n = this.blueIdToContentMap.get(t), s = this.blueIdToMultipleDocumentsMap.get(t);
+    return n !== void 0 && s !== void 0 ? ne.resolveThisReferences(
+      n,
+      t,
+      s
+    ) : null;
+  }
+  /**
+   * Get all stored Blue IDs
+   */
+  getBlueIds() {
+    return Array.from(this.blueIdToContentMap.keys());
+  }
+  /**
+   * Check if a Blue ID exists in this provider
+   */
+  hasBlueId(t) {
+    const n = t.split("#")[0];
+    return this.blueIdToContentMap.has(n);
+  }
+}
+class ue {
+  /**
+   * Wraps a NodeProvider with a SequentialNodeProvider that includes bootstrap providers and repository definitions
+   * @param originalProvider - The original NodeProvider to wrap
+   * @param repositories - Optional repositories containing definitions
+   * @returns A wrapped NodeProvider that includes bootstrap providers and repository definitions
+   */
+  static wrap(e, t) {
+    const n = [Ye.INSTANCE];
+    if (t && t.length > 0) {
+      const s = new wn(t);
+      n.push(s);
+    }
+    return n.push(e), new sn(n);
+  }
+}
+class vn {
   /**
    * Creates a new BlueDirectivePreprocessor
    *
@@ -2464,9 +2735,9 @@ class dn {
       const n = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(n, t);
-      if (M.isPotentialBlueId(t))
+      if (L.isPotentialBlueId(t))
         return this.handleBlueId(n, t);
-      throw ae(t) ? new Error(
+      throw ge(t) ? new Error(
         `URL '${t}' detected. Use the async version of this method to fetch the content.`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -2484,19 +2755,19 @@ class dn {
       const n = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(n, t);
-      if (M.isPotentialBlueId(t))
+      if (L.isPotentialBlueId(t))
         return this.handleBlueId(n, t);
-      if (ae(t) && this.urlContentFetcher)
+      if (ge(t) && this.urlContentFetcher)
         try {
           const s = await this.fetchFromUrl(t);
-          return s && n.setBlue(new l().setItems(s)), n;
+          return s && n.setBlue(new a().setItems(s)), n;
         } catch (s) {
           throw s instanceof Error ? new Error(
             `Failed to fetch from URL '${t}'.
 ${s.message}`
           ) : s;
         }
-      else throw ae(t) ? new Error(
+      else throw ge(t) ? new Error(
         `UrlContentFetcher not provided for URL: ${t}`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -2519,7 +2790,7 @@ ${s.message}`
    */
   handleAliasValue(e, t) {
     return e.setBlue(
-      new l().setBlueId(this.preprocessingAliases.get(t))
+      new a().setBlueId(this.preprocessingAliases.get(t))
     ), e;
   }
   /**
@@ -2529,7 +2800,7 @@ ${s.message}`
    * @returns The modified node
    */
   handleBlueId(e, t) {
-    return e.setBlue(new l().setBlueId(t)), e;
+    return e.setBlue(new a().setBlueId(t)), e;
   }
   /**
    * Fetches content from a URL
@@ -2582,24 +2853,24 @@ ${s.message}`
     return this.urlContentFetcher;
   }
 }
-const hn = {
+const Bn = {
   fetchUrl: async (r) => {
     throw new Error(
       `You must provide a custom UrlFetchStrategy to fetch content from URL: ${r}`
     );
   }
 };
-class pn {
+class En {
   constructor(e) {
     // Cache to avoid repeated network requests for the same URL
     u(this, "cache", /* @__PURE__ */ new Map());
     u(this, "fetchStrategy");
     u(this, "enabled", !1);
     u(this, "allowedDomains", []);
-    this.fetchStrategy = e || hn;
+    this.fetchStrategy = e || Bn;
   }
   validateUrl(e) {
-    if (!ae(e))
+    if (!ge(e))
       throw new Error(`Invalid URL: ${e}`);
     return !0;
   }
@@ -2638,7 +2909,7 @@ class pn {
     const { data: n, contentType: s } = t;
     let i;
     if (s.includes("application/json") || s.includes("text/yaml") || s.includes("application/yaml") || s.includes("text/plain"))
-      i = te(n);
+      i = W(n);
     else
       throw new Error(`Unsupported content type from URL: ${s}`);
     if (i === void 0)
@@ -2718,36 +2989,487 @@ class pn {
     return this.allowedDomains = [], this;
   }
 }
-class Hn {
+class Nn {
+  /**
+   * Resolves a node without limits
+   * Default implementation that uses NO_LIMITS
+   *
+   * @param node - The node to resolve
+   * @returns The resolved node using NO_LIMITS
+   */
+  resolveWithoutLimits(e) {
+    return this.resolve(e, G);
+  }
+}
+class Sn extends Nn {
+  /**
+   * Creates a new Merger with the specified MergingProcessor and NodeProvider
+   * @param mergingProcessor - The processor to use for merge operations
+   * @param nodeProvider - The provider to use for resolving nodes
+   */
+  constructor(t, n) {
+    super();
+    u(this, "mergingProcessor");
+    u(this, "nodeProvider");
+    this.mergingProcessor = t, this.nodeProvider = ue.wrap(n);
+  }
+  /**
+   * Merges a source node into a target node with the given limits
+   * @param target - The target node to merge into
+   * @param source - The source node to merge from
+   * @param limits - The limits to apply during merging
+   */
+  merge(t, n, s) {
+    if (f(n.getBlue()))
+      throw new Error(
+        'Document contains "blue" attribute. Preprocess document before merging.'
+      );
+    const i = n.getType();
+    if (f(i)) {
+      f(i.getBlueId()) && new st(this.nodeProvider).extend(
+        i,
+        it.withSinglePath("/")
+      );
+      const o = this.resolve(i, s);
+      n.setType(o), this.merge(t, i, s);
+    }
+    this.mergeObject(t, n, s);
+  }
+  /**
+   * Merges the properties and items of a source node into a target node
+   * @param target - The target node to merge into
+   * @param source - The source node to merge from
+   * @param limits - The limits to apply during merging
+   */
+  mergeObject(t, n, s) {
+    this.mergingProcessor.process(t, n, this.nodeProvider, this);
+    const i = n.getItems();
+    f(i) && this.mergeChildren(t, i, s);
+    const o = n.getProperties();
+    f(o) && Object.entries(o).forEach(([c, l]) => {
+      s.shouldMergePathSegment(c, l) && (s.enterPathSegment(c, l), this.mergeProperty(t, c, l, s), s.exitPathSegment());
+    }), f(n.getBlueId()) && t.setBlueId(n.getBlueId()), this.mergingProcessor.postProcess && this.mergingProcessor.postProcess(
+      t,
+      n,
+      this.nodeProvider,
+      this
+    );
+  }
+  /**
+   * Merges child items from source into target
+   * @param target - The target node
+   * @param sourceChildren - The source children to merge
+   * @param limits - The limits to apply
+   */
+  mergeChildren(t, n, s) {
+    const i = t.getItems();
+    if (N(i)) {
+      const o = n.filter(
+        (c, l) => s.shouldMergePathSegment(String(l), t)
+      ).map((c) => {
+        s.enterPathSegment(
+          String(n.indexOf(c)),
+          t
+        );
+        const l = this.resolve(c, s);
+        return s.exitPathSegment(), l;
+      });
+      t.setItems(o);
+      return;
+    } else if (n.length < i.length)
+      throw new Error(
+        `Subtype of element must not have more items (${i.length}) than the element itself (${n.length}).`
+      );
+    for (let o = 0; o < n.length; o++) {
+      if (!s.shouldMergePathSegment(String(o), n[o]))
+        continue;
+      if (s.enterPathSegment(String(o), n[o]), o >= i.length) {
+        i.push(n[o]), s.exitPathSegment();
+        continue;
+      }
+      const c = w.calculateBlueIdSync(
+        n[o]
+      ), l = w.calculateBlueIdSync(
+        i[o]
+      );
+      if (c !== l)
+        throw new Error(
+          `Mismatched items at index ${o}: source item has blueId '${c}', but target item has blueId '${l}'.`
+        );
+      s.exitPathSegment();
+    }
+  }
+  /**
+   * Merges a property from source into target
+   * @param target - The target node
+   * @param sourceKey - The property key
+   * @param sourceValue - The property value to merge
+   * @param limits - The limits to apply
+   */
+  mergeProperty(t, n, s, i) {
+    const o = this.resolve(s, i);
+    N(t.getProperties()) && t.setProperties({});
+    const c = t.getProperties()[n];
+    c === void 0 ? t.getProperties()[n] = o : this.mergeObject(c, o, i);
+  }
+  /**
+   * Resolves a node by creating a new node and merging the source into it
+   * @param node - The node to resolve
+   * @param limits - The limits to apply during resolution
+   * @returns The resolved node
+   */
+  resolve(t, n) {
+    const s = new a();
+    return this.merge(s, t, n), s.setName(t.getName()), s.setDescription(t.getDescription()), s.setBlueId(t.getBlueId()), s;
+  }
+}
+class Pn {
+  /**
+   * Creates a new SequentialMergingProcessor with the given processors
+   * @param mergingProcessors - Array of processors to execute in sequence
+   */
+  constructor(e) {
+    u(this, "mergingProcessors");
+    this.mergingProcessors = e;
+  }
+  /**
+   * Processes all contained processors in sequence
+   */
+  process(e, t, n, s) {
+    this.mergingProcessors.forEach(
+      (i) => i.process(e, t, n, s)
+    );
+  }
+  /**
+   * Post-processes all contained processors in sequence
+   */
+  postProcess(e, t, n, s) {
+    this.mergingProcessors.forEach((i) => {
+      i.postProcess && i.postProcess(e, t, n, s);
+    });
+  }
+}
+class An {
+  process(e, t) {
+    const n = t.getValue();
+    if (f(n)) {
+      const s = e.getValue();
+      if (N(s))
+        e.setValue(n);
+      else if (n !== s)
+        throw new Error(
+          `Node values conflict. Source node value: ${n}, target node value: ${s}`
+        );
+    }
+  }
+}
+function $e(r, e) {
+  const t = r.getType();
+  if (t === void 0)
+    return;
+  const n = t.getBlueId();
+  if (n !== void 0) {
+    if (de.includes(
+      n
+    )) {
+      const i = or[n];
+      return new a().setBlueId(n).setName(i);
+    }
+    const s = e.fetchByBlueId(n);
+    if (!s || s.length === 0)
+      return;
+    if (s.length > 1)
+      throw new Error(
+        `Expected a single node for type with blueId '${n}', but found multiple.`
+      );
+    return s[0];
+  }
+  return t;
+}
+function E(r, e, t) {
+  const n = w.calculateBlueIdSync(r), s = w.calculateBlueIdSync(e);
+  if (n === s)
+    return !0;
+  if (n && de.includes(
+    n
+  )) {
+    let o = e;
+    for (; o !== void 0; ) {
+      if (w.calculateBlueIdSync(o) === n)
+        return !0;
+      o = $e(o, t);
+    }
+    return !1;
+  }
+  let i = $e(r, t);
+  for (; i !== void 0; ) {
+    if (w.calculateBlueIdSync(i) === s)
+      return !0;
+    i = $e(i, t);
+  }
+  return !1;
+}
+function Cn(r, e) {
+  return Et.some((t) => {
+    const n = new a().setBlueId(t);
+    return E(r, n, e);
+  });
+}
+function Vn(r, e) {
+  const t = new a().setBlueId(H);
+  return E(r, t, e);
+}
+function On(r, e) {
+  const t = new a().setBlueId(q);
+  return E(r, t, e);
+}
+function Dn(r, e) {
+  const t = new a().setBlueId(X);
+  return E(r, t, e);
+}
+function Fn(r, e) {
+  const t = new a().setBlueId(Q);
+  return E(r, t, e);
+}
+function Rn(r) {
+  return (r == null ? void 0 : r.getBlueId()) === vt;
+}
+function Mn(r) {
+  return (r == null ? void 0 : r.getBlueId()) === Bt;
+}
+function jn(r, e) {
+  return tt.some((t) => {
+    const n = new a().setName(t);
+    return E(r, n, e);
+  });
+}
+function xn(r, e) {
+  for (const t of tt) {
+    const n = new a().setName(t);
+    if (E(r, n, e))
+      return t;
+  }
+  throw new Error(
+    `Cannot determine the basic type for node of type "${r.getName() || "unknown"}".`
+  );
+}
+class $n {
+  process(e, t, n) {
+    const s = e.getType(), i = t.getType();
+    if (s === void 0)
+      e.setType(i);
+    else if (i !== void 0) {
+      if (!E(i, s, n)) {
+        const c = y.get(i), l = y.get(s);
+        throw new Error(
+          `The source type '${JSON.stringify(
+            c
+          )}' is not a subtype of the target type '${JSON.stringify(
+            l
+          )}'.`
+        );
+      }
+      e.setType(i);
+    }
+  }
+}
+class Un {
+  process(e, t, n) {
+    if (t.getItemType() !== void 0 && !Rn(t.getType()))
+      throw new Error("Source node with itemType must have a List type");
+    const s = e.getItemType(), i = t.getItemType();
+    if (s === void 0)
+      i !== void 0 && e.setItemType(i);
+    else if (i !== void 0) {
+      if (!E(
+        i,
+        s,
+        n
+      )) {
+        const h = y.get(i), T = y.get(s);
+        throw new Error(
+          `The source item type '${JSON.stringify(
+            h
+          )}' is not a subtype of the target item type '${JSON.stringify(
+            T
+          )}'.`
+        );
+      }
+      e.setItemType(i);
+    }
+    const o = e.getItemType(), c = t.getItems();
+    if (o !== void 0 && c !== void 0)
+      for (const l of c) {
+        const h = l.getType();
+        if (h !== void 0 && !E(h, o, n)) {
+          const T = y.get(h), b = y.get(
+            o
+          );
+          throw new Error(
+            `Item of type '${JSON.stringify(
+              T
+            )}' is not a subtype of the list's item type '${JSON.stringify(
+              b
+            )}'.`
+          );
+        }
+      }
+  }
+}
+class Ln {
+  process(e, t, n) {
+    if ((t.getKeyType() !== void 0 || t.getValueType() !== void 0) && !Mn(t.getType()))
+      throw new Error(
+        "Source node with keyType or valueType must have a Dictionary type"
+      );
+    this.processKeyType(e, t, n), this.processValueType(e, t, n);
+    const s = e.getKeyType(), i = e.getValueType(), o = t.getProperties();
+    (s !== void 0 || i !== void 0) && o !== void 0 && Object.entries(o).forEach(([c, l]) => {
+      s !== void 0 && this.validateKeyType(c, s, n), i !== void 0 && this.validateValueType(l, i, n);
+    });
+  }
+  processKeyType(e, t, n) {
+    const s = e.getKeyType(), i = t.getKeyType();
+    if (s === void 0)
+      i !== void 0 && (this.validateBasicKeyType(i, n), e.setKeyType(i));
+    else if (i !== void 0) {
+      if (this.validateBasicKeyType(i, n), !E(
+        i,
+        s,
+        n
+      )) {
+        const c = y.get(i), l = y.get(s);
+        throw new Error(
+          `The source key type '${JSON.stringify(
+            c
+          )}' is not a subtype of the target key type '${JSON.stringify(
+            l
+          )}'.`
+        );
+      }
+      e.setKeyType(i);
+    }
+  }
+  processValueType(e, t, n) {
+    const s = e.getValueType(), i = t.getValueType();
+    if (s === void 0)
+      i !== void 0 && e.setValueType(i);
+    else if (i !== void 0) {
+      if (!E(
+        i,
+        s,
+        n
+      )) {
+        const c = y.get(i), l = y.get(s);
+        throw new Error(
+          `The source value type '${JSON.stringify(
+            c
+          )}' is not a subtype of the target value type '${JSON.stringify(
+            l
+          )}'.`
+        );
+      }
+      e.setValueType(i);
+    }
+  }
+  validateBasicKeyType(e, t) {
+    if (!Cn(e, t))
+      throw new Error("Dictionary key type must be a basic type");
+  }
+  validateKeyType(e, t, n) {
+    if (!Vn(t, n))
+      if (On(t, n)) {
+        const s = Number.parseInt(e, 10);
+        if (Number.isNaN(s) || s.toString() !== e)
+          throw new Error(`Key '${e}' is not a valid Integer.`);
+      } else if (Dn(t, n)) {
+        const s = Number.parseFloat(e);
+        if (Number.isNaN(s))
+          throw new Error(`Key '${e}' is not a valid Number.`);
+      } else if (Fn(t, n)) {
+        if (e.toLowerCase() !== "true" && e.toLowerCase() !== "false")
+          throw new Error(`Key '${e}' is not a valid Boolean.`);
+      } else
+        throw new Error(
+          `Unsupported key type: ${t.getName() || "unknown"}`
+        );
+  }
+  validateValueType(e, t, n) {
+    const s = e.getType();
+    if (s !== void 0 && !E(s, t, n)) {
+      const i = y.get(s), o = y.get(t);
+      throw new Error(
+        `Value of type '${JSON.stringify(
+          i
+        )}' is not a subtype of the dictionary's value type '${JSON.stringify(
+          o
+        )}'.`
+      );
+    }
+  }
+}
+class _n {
+  process() {
+  }
+  postProcess(e, t, n) {
+    const s = e.getType();
+    if (s !== void 0 && jn(s, n)) {
+      const i = e.getItems(), o = e.getProperties();
+      if (i !== void 0 && i.length > 0 || o !== void 0 && Object.keys(o).length > 0) {
+        const c = xn(s, n), l = s.getName() || "unknown";
+        throw new Error(
+          `Node of type "${l}" (which extends basic type "${c}") must not have items or properties.`
+        );
+      }
+    }
+  }
+}
+function Zn() {
+  return new Pn([
+    new An(),
+    new $n(),
+    new Un(),
+    new Ln(),
+    new _n()
+  ]);
+}
+class vs {
   constructor(e = {}) {
     u(this, "nodeProvider");
     u(this, "typeSchemaResolver");
     u(this, "blueDirectivePreprocessor");
     u(this, "urlContentFetcher");
     u(this, "blueIdsMappingGenerator");
-    u(this, "prepareForBlueIdCalculation", async (e) => e instanceof l || Array.isArray(e) && e.every((t) => t instanceof l) ? e : Array.isArray(e) ? await Promise.all(
+    u(this, "globalLimits", G);
+    u(this, "mergingProcessor");
+    u(this, "repositories");
+    u(this, "prepareForBlueIdCalculation", async (e) => e instanceof a || Array.isArray(e) && e.every((t) => t instanceof a) ? e : Array.isArray(e) ? await Promise.all(
       e.map((n) => this.jsonValueToNodeAsync(n))
     ) : this.jsonValueToNodeAsync(e));
     u(this, "calculateBlueId", async (e) => {
       const t = await this.prepareForBlueIdCalculation(e);
-      return F.calculateBlueId(t);
+      return w.calculateBlueId(t);
     });
-    u(this, "prepareForBlueIdCalculationSync", (e) => e instanceof l || Array.isArray(e) && e.every((t) => t instanceof l) ? e : Array.isArray(e) ? e.map((t) => this.jsonValueToNode(t)) : this.jsonValueToNode(e));
-    var c;
+    u(this, "prepareForBlueIdCalculationSync", (e) => e instanceof a || Array.isArray(e) && e.every((t) => t instanceof a) ? e : Array.isArray(e) ? e.map((t) => this.jsonValueToNode(t)) : this.jsonValueToNode(e));
+    var l;
     const {
       nodeProvider: t,
       typeSchemaResolver: n = null,
       urlFetchStrategy: s,
-      repositories: i
-    } = e, o = Wr(() => []);
-    if (this.nodeProvider = ye.wrap(
-      t || o
-    ), this.typeSchemaResolver = n ?? new Ur([]), this.urlContentFetcher = new pn(s), this.blueDirectivePreprocessor = new dn(
+      repositories: i,
+      mergingProcessor: o
+    } = e;
+    this.repositories = i;
+    const c = nn(() => []);
+    if (this.nodeProvider = ue.wrap(
+      t || c,
+      i
+    ), this.typeSchemaResolver = n ?? new Gr([]), this.mergingProcessor = o ?? Zn(), this.urlContentFetcher = new En(s), this.blueDirectivePreprocessor = new vn(
       void 0,
       this.urlContentFetcher
-    ), this.blueIdsMappingGenerator = new St(), i)
-      for (const { schemas: a, blueIds: y } of i)
-        (c = this.typeSchemaResolver) == null || c.registerSchemas(a), this.blueIdsMappingGenerator.registerBlueIds(y);
+    ), this.blueIdsMappingGenerator = new Ut(), i)
+      for (const { schemas: h, blueIds: T } of i)
+        (l = this.typeSchemaResolver) == null || l.registerSchemas(h), this.blueIdsMappingGenerator.registerBlueIds(T);
   }
   /**
    * Converts a BlueNode to a JSON representation based on the specified strategy.
@@ -2757,10 +3479,18 @@ class Hn {
    * @returns A JSON representation of the node.
    */
   nodeToJson(e, t = "official") {
-    return T.get(e, t);
+    return y.get(e, t);
   }
   nodeToSchemaOutput(e, t) {
-    return new Hr(this.typeSchemaResolver).convert(e, t);
+    return new rn(this.typeSchemaResolver).convert(e, t);
+  }
+  resolve(e, t = G) {
+    const n = this.combineWithGlobalLimits(t);
+    return new Sn(this.mergingProcessor, this.nodeProvider).resolve(e, n);
+  }
+  extend(e, t) {
+    const n = this.combineWithGlobalLimits(t);
+    new st(this.nodeProvider).extend(e, n);
   }
   jsonValueToNode(e) {
     return this.preprocess(p.deserialize(e));
@@ -2769,27 +3499,27 @@ class Hn {
     return this.preprocessAsync(p.deserialize(e));
   }
   yamlToNode(e) {
-    const t = te(e);
+    const t = W(e);
     if (!t)
       throw new Error("Failed to parse YAML to JSON");
     return this.jsonValueToNode(t);
   }
   async yamlToNodeAsync(e) {
-    const t = te(e);
+    const t = W(e);
     if (!t)
       throw new Error("Failed to parse YAML to JSON");
     return this.jsonValueToNodeAsync(t);
   }
   calculateBlueIdSync(e) {
     const t = this.prepareForBlueIdCalculationSync(e);
-    return F.calculateBlueIdSync(t);
+    return w.calculateBlueIdSync(t);
   }
   addPreprocessingAliases(e) {
     this.blueDirectivePreprocessor.addPreprocessingAliases(e);
   }
   preprocess(e) {
     const t = this.blueDirectivePreprocessor.process(e);
-    return new ge({
+    return new ae({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).preprocessWithDefaultBlue(t);
@@ -2798,7 +3528,7 @@ class Hn {
     const t = await this.blueDirectivePreprocessor.processAsync(
       e
     );
-    return new ge({
+    return new ae({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).preprocessWithDefaultBlue(t);
@@ -2807,7 +3537,10 @@ class Hn {
     return this.nodeProvider;
   }
   setNodeProvider(e) {
-    return this.nodeProvider = ye.wrap(e), this;
+    return this.nodeProvider = ue.wrap(
+      e,
+      this.repositories
+    ), this;
   }
   getTypeSchemaResolver() {
     return this.typeSchemaResolver;
@@ -2928,72 +3661,75 @@ class Hn {
    * @returns true if the node matches the schema type, false otherwise
    */
   isTypeOf(e, t, n) {
-    return P.isTypeOf(e, t, {
+    return A.isTypeOf(e, t, {
       checkSchemaExtensions: n == null ? void 0 : n.checkSchemaExtensions,
       typeSchemaResolver: this.typeSchemaResolver
     });
   }
+  combineWithGlobalLimits(e) {
+    return this.globalLimits == G ? e : e == G ? this.globalLimits : G;
+  }
 }
 export {
-  fr as Base58Sha256Provider,
-  Hn as Blue,
-  F as BlueIdCalculator,
-  jn as BlueIdToCid,
-  l as BlueNode,
-  P as BlueNodeTypeSchema,
-  ur as JsonCanonicalizer,
-  Ur as TypeSchemaResolver,
-  Rn as applyBlueNodePatch,
-  Be as baseBlueObjectSchema,
-  xn as blueDescriptionField,
-  Un as blueIdField,
-  Pn as blueIdSchema,
-  $n as blueNameField,
-  Mn as blueNodeField,
-  Sn as blueObjectBooleanValueSchema,
-  Nn as blueObjectNumberValueSchema,
-  Q as blueObjectSchema,
-  Cn as blueObjectStringListItemsSchema,
-  An as blueObjectStringValueSchema,
-  cn as calculateBlueId,
-  kn as calculateBlueIdSync,
-  et as enrichWithBlueId,
-  Er as getBlueDescriptionAnnotation,
-  Nr as getBlueIdAnnotation,
-  Cr as getBlueNameAnnotation,
-  Vr as getBlueNodeAnnotation,
-  _n as getBlueObjectItems,
-  Gn as getBlueObjectProperties,
-  zn as getBlueObjectTypeLabel,
-  Yn as getBlueObjectValue,
-  Or as getExtendedFromSchemaAnnotation,
-  xr as getTypeBlueIdAnnotation,
-  Qt as hasBlueObjectBlueIdDefined,
-  er as hasBlueObjectItemsDefined,
-  Vn as hasBlueObjectNameDefined,
-  tr as hasBlueObjectTypeDefined,
-  rr as hasBlueObjectValueDefined,
-  nr as isBigDecimalNumber,
-  ee as isBigIntegerNumber,
-  C as isBigNumber,
-  wt as isBlueNodeSchema,
-  Fn as isBlueObject,
-  ln as isBlueObjectResolved,
-  Dn as isGivenBlueObjectTypeSchema,
-  yt as isJsonBlueArray,
-  pt as isJsonBlueObject,
-  On as isJsonBlueValue,
-  vt as isSchemaExtendedFrom,
-  ae as isUrl,
-  he as jsonBlueValueSchema,
-  Jn as normalizeToBlueObject,
-  tt as resolveBlueObjectItems,
-  Br as withBlueDescription,
-  Ar as withBlueId,
-  Sr as withBlueName,
-  Fr as withBlueNode,
-  Dr as withExtendedFromSchema,
-  Ln as withTypeBlueId,
-  Zn as yamlBlueDump,
-  te as yamlBlueParse
+  Tr as Base58Sha256Provider,
+  vs as Blue,
+  w as BlueIdCalculator,
+  ls as BlueIdToCid,
+  a as BlueNode,
+  A as BlueNodeTypeSchema,
+  Ir as JsonCanonicalizer,
+  Gr as TypeSchemaResolver,
+  as as applyBlueNodePatch,
+  Ae as baseBlueObjectSchema,
+  us as blueDescriptionField,
+  ds as blueIdField,
+  Qn as blueIdSchema,
+  fs as blueNameField,
+  hs as blueNodeField,
+  rs as blueObjectBooleanValueSchema,
+  ts as blueObjectNumberValueSchema,
+  ce as blueObjectSchema,
+  ns as blueObjectStringListItemsSchema,
+  es as blueObjectStringValueSchema,
+  mn as calculateBlueId,
+  gs as calculateBlueIdSync,
+  lt as enrichWithBlueId,
+  Dr as getBlueDescriptionAnnotation,
+  Mr as getBlueIdAnnotation,
+  xr as getBlueNameAnnotation,
+  Ur as getBlueNodeAnnotation,
+  ms as getBlueObjectItems,
+  Ts as getBlueObjectProperties,
+  bs as getBlueObjectTypeLabel,
+  Is as getBlueObjectValue,
+  _r as getExtendedFromSchemaAnnotation,
+  Jr as getTypeBlueIdAnnotation,
+  cr as hasBlueObjectBlueIdDefined,
+  lr as hasBlueObjectItemsDefined,
+  is as hasBlueObjectNameDefined,
+  ar as hasBlueObjectTypeDefined,
+  ur as hasBlueObjectValueDefined,
+  dr as isBigDecimalNumber,
+  le as isBigIntegerNumber,
+  O as isBigNumber,
+  Dt as isBlueNodeSchema,
+  ss as isBlueObject,
+  In as isBlueObjectResolved,
+  os as isGivenBlueObjectTypeSchema,
+  St as isJsonBlueArray,
+  Nt as isJsonBlueObject,
+  cs as isJsonBlueValue,
+  Ft as isSchemaExtendedFrom,
+  ge as isUrl,
+  be as jsonBlueValueSchema,
+  ws as normalizeToBlueObject,
+  at as resolveBlueObjectItems,
+  Or as withBlueDescription,
+  Rr as withBlueId,
+  jr as withBlueName,
+  $r as withBlueNode,
+  Lr as withExtendedFromSchema,
+  ps as withTypeBlueId,
+  ys as yamlBlueDump,
+  W as yamlBlueParse
 };