@blue-labs/language 3.4.0 → 3.4.2

package/dist/index.mjs

@@ -1,13 +1,13 @@
 import M from "big.js";
-import { isNullable as I, isNonNullable as p, jsonPrimitiveSchema as cr, isReadonlyArray as Ee, isJsonPrimitive as qe, isPreciseNumberString as Et } from "@blue-labs/shared-utils";
-import { z as f, ZodOptional as Nt, ZodNullable as Pt, ZodReadonly as St, ZodBranded as At, ZodEffects as Ne, ZodLazy as Pe, ZodString as ee, ZodNumber as te, ZodBoolean as Be, ZodBigInt as be, ZodEnum as ar, ZodNativeEnum as ur, ZodIntersection as dr, ZodUnion as pr, ZodObject as fr, ZodRecord as hr } from "zod";
-import ae from "bs58";
-import { isObject as Vt, isArray as Qe, isString as et, omit as Ct, pascal as yr, map as gr } from "radash";
-import { OBJECT_CONTRACTS as C, OBJECT_MERGE_POLICY as mr, OBJECT_SCHEMA as Ir, BLUE_REPOSITORY_STATUS_STABLE as le, BLUE_REPOSITORY_STATUS_DEV as tt, validateAttributesAddedPointer as Tr, parsePointer as Rt } from "@blue-labs/repository-contract";
-import { sha256 as vr } from "js-sha256";
-import Le from "crypto";
-import Br from "base32.js";
-import W from "js-yaml";
+import { isNullable as I, isNonNullable as p, jsonPrimitiveSchema as cr, isReadonlyArray as Ee, isJsonPrimitive as Qe, isPreciseNumberString as Nt } from "@blue-labs/shared-utils";
+import { z as h, ZodOptional as Pt, ZodNullable as St, ZodReadonly as Ct, ZodBranded as At, ZodEffects as Ne, ZodLazy as Pe, ZodString as ee, ZodNumber as te, ZodBoolean as be, ZodBigInt as we, ZodEnum as ur, ZodNativeEnum as dr, ZodIntersection as pr, ZodUnion as hr, ZodObject as fr, ZodRecord as yr } from "zod";
+import ue from "bs58";
+import { isObject as Vt, isArray as et, isString as tt, omit as Rt, pascal as gr, map as mr } from "radash";
+import { OBJECT_CONTRACTS as V, OBJECT_MERGE_POLICY as Ir, OBJECT_SCHEMA as Tr, BLUE_REPOSITORY_STATUS_STABLE as ae, BLUE_REPOSITORY_STATUS_DEV as rt, validateAttributesAddedPointer as vr, parsePointer as Ot } from "@blue-labs/repository-contract";
+import { sha256 as br } from "js-sha256";
+import je from "crypto";
+import wr from "base32.js";
+import H from "js-yaml";
 class S extends M {
   constructor(e) {
     super(e);
@@ -18,71 +18,71 @@ class E extends M {
     super(e);
   }
 }
-const G = "name", J = "description", Z = "type", he = "itemType", ye = "keyType", ge = "valueType", me = "value", Oe = "items", x = "blueId", De = "blue", rt = [
+const G = "name", J = "description", W = "type", fe = "itemType", ye = "keyType", ge = "valueType", me = "value", Oe = "items", x = "blueId", De = "blue", st = [
   G,
   J,
-  Z,
-  he,
+  W,
+  fe,
   ye,
   ge,
   me,
   Oe,
   x,
   De
-], Ot = "Text", Dt = "Double", Mt = "Integer", xt = "Boolean", Ft = "List", $t = "Dictionary", Me = [
-  Ot,
+], Dt = "Text", Mt = "Double", xt = "Integer", Ft = "Boolean", $t = "List", _t = "Dictionary", Me = [
   Dt,
   Mt,
-  xt
-], st = [...Me, Ft, $t], _ = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", L = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", j = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", U = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", nt = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", it = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", ot = [
+  xt,
+  Ft
+], nt = [...Me, $t, _t], _ = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", j = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", L = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", U = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", it = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", ot = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", lt = [
   _,
-  L,
   j,
+  L,
   U
 ], X = [
-  ...ot,
-  nt,
-  it
-], br = Object.fromEntries(
-  st.map((s, e) => [s, X[e]])
+  ...lt,
+  it,
+  ot
+], Br = Object.fromEntries(
+  nt.map((s, e) => [s, X[e]])
 ), xe = Object.fromEntries(
-  X.map((s, e) => [s, st[e]])
+  X.map((s, e) => [s, nt[e]])
 ), On = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   BASIC_TYPES: Me,
-  BASIC_TYPE_BLUE_IDS: ot,
-  BOOLEAN_TYPE: xt,
+  BASIC_TYPE_BLUE_IDS: lt,
+  BOOLEAN_TYPE: Ft,
   BOOLEAN_TYPE_BLUE_ID: U,
-  CORE_TYPES: st,
+  CORE_TYPES: nt,
   CORE_TYPE_BLUE_IDS: X,
   CORE_TYPE_BLUE_ID_TO_NAME_MAP: xe,
-  CORE_TYPE_NAME_TO_BLUE_ID_MAP: br,
-  DICTIONARY_TYPE: $t,
-  DICTIONARY_TYPE_BLUE_ID: it,
-  DOUBLE_TYPE: Dt,
-  DOUBLE_TYPE_BLUE_ID: L,
-  INTEGER_TYPE: Mt,
-  INTEGER_TYPE_BLUE_ID: j,
-  LIST_TYPE: Ft,
-  LIST_TYPE_BLUE_ID: nt,
+  CORE_TYPE_NAME_TO_BLUE_ID_MAP: Br,
+  DICTIONARY_TYPE: _t,
+  DICTIONARY_TYPE_BLUE_ID: ot,
+  DOUBLE_TYPE: Mt,
+  DOUBLE_TYPE_BLUE_ID: j,
+  INTEGER_TYPE: xt,
+  INTEGER_TYPE_BLUE_ID: L,
+  LIST_TYPE: $t,
+  LIST_TYPE_BLUE_ID: it,
   OBJECT_BLUE: De,
   OBJECT_BLUE_ID: x,
-  OBJECT_CONTRACTS: C,
+  OBJECT_CONTRACTS: V,
   OBJECT_DESCRIPTION: J,
   OBJECT_ITEMS: Oe,
-  OBJECT_ITEM_TYPE: he,
+  OBJECT_ITEM_TYPE: fe,
   OBJECT_KEY_TYPE: ye,
-  OBJECT_MERGE_POLICY: mr,
+  OBJECT_MERGE_POLICY: Ir,
   OBJECT_NAME: G,
-  OBJECT_SCHEMA: Ir,
-  OBJECT_SPECIFIC_KEYS: rt,
-  OBJECT_TYPE: Z,
+  OBJECT_SCHEMA: Tr,
+  OBJECT_SPECIFIC_KEYS: st,
+  OBJECT_TYPE: W,
   OBJECT_VALUE: me,
   OBJECT_VALUE_TYPE: ge,
-  TEXT_TYPE: Ot,
+  TEXT_TYPE: Dt,
   TEXT_TYPE_BLUE_ID: _
 }, Symbol.toStringTag, { value: "Module" }));
-class wr {
+class Er {
   static get(e, t, r, n = !0) {
     if (I(t) || !t.startsWith("/"))
       throw new Error(`Invalid path: ${t}`);
@@ -108,8 +108,8 @@ class wr {
         !1
       );
     if (r === t.length) {
-      const c = e.getValue();
-      return i && c !== void 0 ? c : e;
+      const a = e.getValue();
+      return i && a !== void 0 ? a : e;
     }
     const o = t[r], l = this.getNodeForSegment(
       e,
@@ -135,12 +135,12 @@ class wr {
       switch (t) {
         case "name": {
           const l = e.getName();
-          i = new a().setValue(l ?? null);
+          i = new c().setValue(l ?? null);
           break;
         }
         case "description": {
           const l = e.getDescription();
-          i = new a().setValue(l ?? null);
+          i = new c().setValue(l ?? null);
           break;
         }
         case "type":
@@ -157,12 +157,12 @@ class wr {
           break;
         case "value": {
           const l = e.getValue();
-          i = new a().setValue(l ?? null);
+          i = new c().setValue(l ?? null);
           break;
         }
         case "blueId": {
           const l = e.getBlueId();
-          i = new a().setValue(l ?? null);
+          i = new c().setValue(l ?? null);
           break;
         }
         case "blue":
@@ -170,23 +170,23 @@ class wr {
           break;
         case "items": {
           const l = e.getItems();
-          i = new a().setItems(l);
+          i = new c().setItems(l);
           break;
         }
         case "properties": {
           const l = e.getProperties();
-          i = new a().setProperties(l);
+          i = new c().setProperties(l);
           break;
         }
-        case C: {
+        case V: {
           const l = e.getContracts();
-          i = new a().setContracts(l);
+          i = new c().setContracts(l);
           break;
         }
         default: {
           if (/^\d+$/.test(t)) {
-            const l = parseInt(t, 10), c = e.getItems();
-            c && l >= 0 && l < c.length ? i = c[l] : i = void 0;
+            const l = parseInt(t, 10), a = e.getItems();
+            a && l >= 0 && l < a.length ? i = a[l] : i = void 0;
           } else
             i = void 0;
           break;
@@ -200,8 +200,8 @@ class wr {
     return p(r) ? r : e;
   }
 }
-class a {
-  static INTEGER = new a("Integer");
+class c {
+  static INTEGER = new c("Integer");
   name;
   description;
   type;
@@ -233,32 +233,32 @@ class a {
     return this.type;
   }
   setType(e) {
-    return typeof e == "string" ? this.type = new a().setValue(e).setInlineValue(!0) : this.type = e, this;
+    return typeof e == "string" ? this.type = new c().setValue(e).setInlineValue(!0) : this.type = e, this;
   }
   getItemType() {
     return this.itemType;
   }
   setItemType(e) {
-    return typeof e == "string" ? this.itemType = new a().setValue(e).setInlineValue(!0) : this.itemType = e, this;
+    return typeof e == "string" ? this.itemType = new c().setValue(e).setInlineValue(!0) : this.itemType = e, this;
   }
   getKeyType() {
     return this.keyType;
   }
   setKeyType(e) {
-    return typeof e == "string" ? this.keyType = new a().setValue(e).setInlineValue(!0) : this.keyType = e, this;
+    return typeof e == "string" ? this.keyType = new c().setValue(e).setInlineValue(!0) : this.keyType = e, this;
   }
   getValueType() {
     return this.valueType;
   }
   setValueType(e) {
-    return typeof e == "string" ? this.valueType = new a().setValue(e).setInlineValue(!0) : this.valueType = e, this;
+    return typeof e == "string" ? this.valueType = new c().setValue(e).setInlineValue(!0) : this.valueType = e, this;
   }
   getValue() {
     const e = this.type?.getBlueId();
     if (p(e) && p(this.value)) {
-      if (e === j && typeof this.value == "string")
+      if (e === L && typeof this.value == "string")
         return new E(this.value);
-      if (e === L && typeof this.value == "string") {
+      if (e === j && typeof this.value == "string") {
         const t = new S(this.value), r = parseFloat(t.toString());
         return new S(r.toString());
       } else if (e === U && typeof this.value == "string")
@@ -291,22 +291,22 @@ class a {
     return this.properties && delete this.properties[e], this;
   }
   getContractsProperty() {
-    return this.properties?.[C];
+    return this.properties?.[V];
   }
   getContracts() {
     return this.getContractsProperty()?.getProperties();
   }
   setContracts(e) {
-    return I(e) ? this.removeProperty(C) : this.addProperty(
-      C,
-      new a().setProperties(e)
+    return I(e) ? this.removeProperty(V) : this.addProperty(
+      V,
+      new c().setProperties(e)
     ), this;
   }
   addContract(e, t) {
     const r = this.getContractsProperty();
     return I(r) ? this.addProperty(
-      C,
-      new a().addProperty(e, t)
+      V,
+      new c().addProperty(e, t)
     ) : r.addProperty(e, t), this;
   }
   removeContract(e) {
@@ -314,7 +314,7 @@ class a {
     if (t) {
       t.removeProperty(e);
       const r = t.getProperties();
-      r && Object.keys(r).length === 0 && this.removeProperty(C);
+      r && Object.keys(r).length === 0 && this.removeProperty(V);
     }
     return this;
   }
@@ -344,11 +344,11 @@ class a {
     return !1;
   }
   get(e, t) {
-    return wr.get(this, e, t);
+    return Er.get(this, e, t);
   }
   getAsNode(e) {
     const t = this.get(e);
-    if (t instanceof a)
+    if (t instanceof c)
       return t;
     throw new Error(`Value at path ${e} is not a BlueNode: ${t}`);
   }
@@ -361,11 +361,15 @@ class a {
     );
   }
   clone() {
-    const e = new a(this.name);
+    const e = new c(this.name);
     return e.description = this.description, e.type = this.type?.clone(), e.itemType = this.itemType?.clone(), e.keyType = this.keyType?.clone(), e.valueType = this.valueType?.clone(), e.value = this.value, e.items = this.items?.map((t) => t.clone()), this.properties && (e.properties = Object.fromEntries(
       Object.entries(this.properties).map(([t, r]) => [t, r.clone()])
     )), e.blueId = this.blueId, e.blue = this.blue?.clone(), e.inlineValue = this.inlineValue, e;
   }
+  cloneShallow() {
+    const e = new c(this.name);
+    return e.description = this.description, e.type = this.type, e.itemType = this.itemType, e.keyType = this.keyType, e.valueType = this.valueType, e.value = this.value, e.items = this.items ? [...this.items] : void 0, e.properties = this.properties ? { ...this.properties } : void 0, e.blueId = this.blueId, e.blue = this.blue, 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}, blueId='${this.blueId}', blue=${this.blue}, inlineValue=${this.inlineValue}}`;
   }
@@ -381,7 +385,7 @@ class Se {
     if (n < this.MIN_BLUE_ID_LENGTH || n > this.MAX_BLUE_ID_LENGTH)
       return !1;
     try {
-      if (ae.decode(r).length !== 32)
+      if (ue.decode(r).length !== 32)
         return !1;
     } catch {
       return !1;
@@ -396,14 +400,14 @@ class Se {
     return !0;
   }
 }
-const Dn = f.string().max(Se.MAX_BLUE_ID_LENGTH, {
+const Dn = h.string().max(Se.MAX_BLUE_ID_LENGTH, {
   message: "Blue Id has a maximum length of 45 characters"
 }).min(Se.MIN_BLUE_ID_LENGTH, {
   message: "Blue Id has a minimum length of 41 characters"
 }).refine(
   (s) => {
     try {
-      return ae.decode(s), !0;
+      return ue.decode(s), !0;
     } catch {
       return !1;
     }
@@ -411,45 +415,45 @@ const Dn = f.string().max(Se.MAX_BLUE_ID_LENGTH, {
   {
     message: "Blue Id must be a valid Base58 string"
   }
-), ue = f.lazy(
-  () => f.record(f.unknown()).and(
-    f.object({
-      blueId: f.string().optional(),
-      name: f.string().optional(),
-      description: f.string().optional(),
-      type: ue.optional(),
-      value: f.union([f.string(), f.number(), f.boolean()]).optional().nullable(),
-      items: f.array(ue).optional()
+), de = h.lazy(
+  () => h.record(h.unknown()).and(
+    h.object({
+      blueId: h.string().optional(),
+      name: h.string().optional(),
+      description: h.string().optional(),
+      type: de.optional(),
+      value: h.union([h.string(), h.number(), h.boolean()]).optional().nullable(),
+      items: h.array(de).optional()
     })
   )
-), Fe = f.object({
-  blueId: f.string().optional(),
-  name: f.string().optional(),
-  description: f.string().optional(),
-  type: ue.optional()
+), Fe = h.object({
+  blueId: h.string().optional(),
+  name: h.string().optional(),
+  description: h.string().optional(),
+  type: de.optional()
 }), Mn = Fe.extend({
-  value: f.string().optional()
+  value: h.string().optional()
 }), xn = Fe.extend({
-  value: f.number().optional()
+  value: h.number().optional()
 }), Fn = Fe.extend({
-  value: f.boolean().optional()
+  value: h.boolean().optional()
 }), $n = Fe.extend({
-  items: f.array(f.string()).optional()
-}), _n = (s) => ue.safeParse(s).success, Er = (s) => p(s) && "blueId" in s && p(s.blueId), Ln = (s) => p(s) && "name" in s && p(s.name), Nr = (s) => p(s) && "items" in s && p(s.items), Pr = (s) => p(s) && "type" in s && p(s.type), Sr = (s) => p(s) && "value" in s && p(s.value), jn = (s, e) => s.required({ type: !0 }).safeParse(e).success, A = (s) => s instanceof M, H = (s) => A(s) && s instanceof E, Ge = (s) => A(s) && s instanceof S, Ar = f.lazy(
-  () => f.record(Ae)
-), Vr = f.lazy(
-  () => f.union([
-    f.array(Ae),
-    f.array(Ae).readonly()
+  items: h.array(h.string()).optional()
+}), _n = (s) => de.safeParse(s).success, Nr = (s) => p(s) && "blueId" in s && p(s.blueId), jn = (s) => p(s) && "name" in s && p(s.name), Pr = (s) => p(s) && "items" in s && p(s.items), Sr = (s) => p(s) && "type" in s && p(s.type), Cr = (s) => p(s) && "value" in s && p(s.value), Ln = (s, e) => s.required({ type: !0 }).safeParse(e).success, C = (s) => s instanceof M, Z = (s) => C(s) && s instanceof E, Ge = (s) => C(s) && s instanceof S, Ar = h.lazy(
+  () => h.record(Ce)
+), Vr = h.lazy(
+  () => h.union([
+    h.array(Ce),
+    h.array(Ce).readonly()
   ])
-), Ae = f.lazy(
-  () => f.union([
+), Ce = h.lazy(
+  () => h.union([
     cr,
     Ar,
     Vr,
-    f.instanceof(M)
+    h.instanceof(M)
   ])
-), _t = (s) => Vt(s) && !Qe(s) && !Ee(s) && !A(s), Lt = (s) => Qe(s) || Ee(s), Un = (s) => Lt(s) || _t(s) || A(s) || qe(s);
+), jt = (s) => Vt(s) && !et(s) && !Ee(s) && !C(s), Lt = (s) => et(s) || Ee(s), Un = (s) => Lt(s) || jt(s) || C(s) || Qe(s);
 class g {
   static deserialize(e) {
     return g.handleNode(e);
@@ -459,8 +463,8 @@ class g {
       throw new Error(
         "This is not a valid JSON-like value. Found 'undefined' as a value."
       );
-    if (_t(e)) {
-      const t = new a(), r = {};
+    if (jt(e)) {
+      const t = new c(), r = {};
       return Object.entries(e).forEach(([n, i]) => {
         switch (n) {
           case G:
@@ -483,10 +487,10 @@ class g {
               t.setDescription(i);
             }
             break;
-          case Z:
+          case W:
             t.setType(g.handleNode(i));
             break;
-          case he:
+          case fe:
             t.setItemType(g.handleNode(i));
             break;
           case ye:
@@ -516,10 +520,10 @@ class g {
       }), Object.keys(r).length > 0 && t.setProperties(r), t;
     } else {
       if (Lt(e))
-        return new a().setItems(g.handleArray(e));
+        return new c().setItems(g.handleArray(e));
       {
         const t = e;
-        return new a().setValue(g.handleValue(t)).setInlineValue(!0);
+        return new c().setValue(g.handleValue(t)).setInlineValue(!0);
       }
     }
   }
@@ -528,8 +532,8 @@ class g {
       return null;
     if (typeof e == "string")
       return e;
-    if (typeof e == "number" || A(e))
-      if (H(e) || Number.isSafeInteger(e)) {
+    if (typeof e == "number" || C(e))
+      if (Z(e) || Number.isSafeInteger(e)) {
         const t = new E(e.toString()), r = Number.MIN_SAFE_INTEGER, n = Number.MAX_SAFE_INTEGER;
         return t.lt(r) ? new E(r.toString()) : t.gt(n) ? new E(n.toString()) : t;
       } else {
@@ -550,12 +554,12 @@ class g {
     }
   }
 }
-function Cr(s) {
+function Rr(s) {
   return s && s.__esModule && Object.prototype.hasOwnProperty.call(s, "default") ? s.default : s;
 }
-var je, gt;
-function Rr() {
-  return gt || (gt = 1, je = function s(e) {
+var Le, mt;
+function Or() {
+  return mt || (mt = 1, Le = function s(e) {
     if (typeof e == "number" && isNaN(e))
       throw new Error("NaN is not allowed");
     if (typeof e == "number" && !isFinite(e))
@@ -566,47 +570,47 @@ function Rr() {
       const i = r.length === 0 ? "" : ",";
       return `${r}${i}${s(n)}:${s(e[n])}`;
     }, "")}}`;
-  }), je;
+  }), Le;
 }
-var Or = Rr();
-const Dr = /* @__PURE__ */ Cr(Or);
+var Dr = Or();
+const Mr = /* @__PURE__ */ Rr(Dr);
 class Je {
   static canonicalize(e) {
-    return Dr(e);
+    return Mr(e);
   }
 }
 const Ue = typeof process < "u" && process.versions != null && process.versions.node != null;
-class lt {
+class at {
   static instance;
   browserCrypto;
   constructor() {
     this.browserCrypto = this.initBrowserCrypto();
   }
   static getInstance() {
-    return this.instance || (this.instance = new lt()), this.instance;
+    return this.instance || (this.instance = new at()), this.instance;
   }
   initBrowserCrypto() {
     return Ue ? null : "crypto" in globalThis ? globalThis.crypto : null;
   }
   hasNodeCrypto() {
-    return Ue && !!Le && typeof Le.createHash == "function";
+    return Ue && !!je && typeof je.createHash == "function";
   }
   getBrowserCrypto() {
     return this.browserCrypto;
   }
   getNodeCrypto() {
-    return Ue ? Le : null;
+    return Ue ? je : null;
   }
 }
-class Mr {
-  cryptoEnv = lt.getInstance();
+class xr {
+  cryptoEnv = at.getInstance();
   applySync(e) {
     const t = this.canonicalizeInput(e), r = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : this.sha256SyncBrowser(t);
-    return ae.encode(r);
+    return ue.encode(r);
   }
   async apply(e) {
     const t = this.canonicalizeInput(e), r = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : await this.sha256Async(t);
-    return ae.encode(r);
+    return ue.encode(r);
   }
   canonicalizeInput(e) {
     const t = Je.canonicalize(e);
@@ -624,7 +628,7 @@ class Mr {
     return new Uint8Array(r);
   }
   sha256SyncBrowser(e) {
-    return new Uint8Array(vr.arrayBuffer(e));
+    return new Uint8Array(br.arrayBuffer(e));
   }
   async sha256Async(e) {
     if (this.cryptoEnv.hasNodeCrypto())
@@ -661,31 +665,31 @@ class m {
       if (i !== void 0)
         return i;
     }
-    const c = {};
-    o !== void 0 && (c[G] = o), l !== void 0 && (c[J] = l);
+    const a = {};
+    o !== void 0 && (a[G] = o), l !== void 0 && (a[J] = l);
     const u = e.getType();
     if (t === "official" && r !== void 0 && u === void 0) {
       const Q = this.inferTypeBlueId(r);
-      Q !== null && (c[Z] = { [x]: Q });
-    } else u !== void 0 && (c[Z] = m.get(u, t));
+      Q !== null && (a[W] = { [x]: Q });
+    } else u !== void 0 && (a[W] = m.get(u, t));
     const y = e.getItemType();
-    y !== void 0 && (c[he] = m.get(y, t));
+    y !== void 0 && (a[fe] = m.get(y, t));
     const d = e.getKeyType();
-    d !== void 0 && (c[ye] = m.get(d, t));
-    const h = e.getValueType();
-    h !== void 0 && (c[ge] = m.get(h, t)), n !== void 0 && (c[me] = n), i !== void 0 && (c[Oe] = i);
+    d !== void 0 && (a[ye] = m.get(d, t));
+    const f = e.getValueType();
+    f !== void 0 && (a[ge] = m.get(f, t)), n !== void 0 && (a[me] = n), i !== void 0 && (a[Oe] = i);
     const v = e.getBlueId();
-    v !== void 0 && (c[x] = v);
+    v !== void 0 && (a[x] = v);
     const k = e.getBlue();
-    k !== void 0 && (c[De] = k);
+    k !== void 0 && (a[De] = k);
     const q = e.getProperties();
-    return q !== void 0 && Object.entries(q).forEach(([Q, lr]) => {
-      c[Q] = m.get(lr, t);
-    }), c;
+    return q !== void 0 && Object.entries(q).forEach(([Q, ar]) => {
+      a[Q] = m.get(ar, t);
+    }), a;
   }
   static handleValue(e) {
-    if (A(e)) {
-      if (H(e)) {
+    if (C(e)) {
+      if (Z(e)) {
         const t = new M(Number.MIN_SAFE_INTEGER.toString()), r = new M(Number.MAX_SAFE_INTEGER.toString());
         if (e.lt(t) || e.gt(r))
           return e.toString();
@@ -695,12 +699,12 @@ class m {
     return e;
   }
   static inferTypeBlueId(e) {
-    return typeof e == "string" ? _ : A(e) ? H(e) ? j : L : typeof e == "boolean" ? U : null;
+    return typeof e == "string" ? _ : C(e) ? Z(e) ? L : j : typeof e == "boolean" ? U : null;
   }
 }
-const xr = (s) => qe(s) && p(s);
+const Fr = (s) => Qe(s) && p(s);
 class T {
-  static INSTANCE = new T(new Mr());
+  static INSTANCE = new T(new xr());
   hashProvider;
   constructor(e) {
     this.hashProvider = e;
@@ -735,7 +739,7 @@ class T {
   }
   // Internal method to calculate BlueId recursively
   internalCalculate(e, t) {
-    return xr(e) || A(e) ? this.applyHash(e.toString(), t) : Array.isArray(e) || Ee(e) ? this.calculateList(e, t) : this.calculateMap(e, t);
+    return Fr(e) || C(e) ? this.applyHash(e.toString(), t) : Array.isArray(e) || Ee(e) ? this.calculateList(e, t) : this.calculateMap(e, t);
   }
   calculateMap(e, t) {
     if (e[x] !== void 0)
@@ -745,16 +749,16 @@ class T {
       if ([G, me, J].includes(o))
         return t ? [o, l] : Promise.resolve([o, l]);
       {
-        const c = this.internalCalculate(l, t);
-        return t ? [o, { blueId: c }] : Promise.resolve(c).then((u) => [
+        const a = this.internalCalculate(l, t);
+        return t ? [o, { blueId: a }] : Promise.resolve(a).then((u) => [
           o,
           { blueId: u }
         ]);
       }
     }), i = (o) => {
       const l = {};
-      for (const [c, u] of o)
-        l[c] = u;
+      for (const [a, u] of o)
+        l[a] = u;
       return this.applyHash(l, t);
     };
     return t ? i(n) : Promise.all(n).then(i);
@@ -770,7 +774,7 @@ class T {
       [{ blueId: i }, { blueId: o }],
       !0
     ) : Promise.all([i, o]).then(
-      ([l, c]) => this.applyHash([{ blueId: l }, { blueId: c }], !1)
+      ([l, a]) => this.applyHash([{ blueId: l }, { blueId: a }], !1)
     );
     for (let i = 1; i < e.length; i++) {
       const o = this.internalCalculate(e[i], t);
@@ -785,7 +789,7 @@ class T {
   // Method to clean the input structure by removing null or undefined values
   cleanStructure(e) {
     if (e != null) {
-      if (qe(e) || A(e))
+      if (Qe(e) || C(e))
         return e;
       if (Array.isArray(e) || Ee(e)) {
         const t = e.map((r) => this.cleanStructure(r)).filter(p);
@@ -804,13 +808,13 @@ class T {
 }
 class kn {
   static convert(e) {
-    const t = ae.decode(e), r = new Uint8Array(2 + t.length);
+    const t = ue.decode(e), r = new Uint8Array(2 + t.length);
     r[0] = 18, r[1] = 32, r.set(t, 2);
     const n = new Uint8Array(2 + r.length);
-    return n[0] = 1, n[1] = 85, n.set(r, 2), "b" + new Br.Encoder({ type: "rfc4648", lc: !0 }).write(n).finalize().replace(/=/g, "");
+    return n[0] = 1, n[1] = 85, n.set(r, 2), "b" + new wr.Encoder({ type: "rfc4648", lc: !0 }).write(n).finalize().replace(/=/g, "");
   }
 }
-class w {
+class B {
   /**
    * Transforms a node and all its child nodes using the provided transformer function
    * @param node - The node to transform
@@ -819,30 +823,30 @@ class w {
    */
   static transform(e, t) {
     const r = t(e.clone()), n = r.getType();
-    n !== void 0 && r.setType(w.transform(n, t));
+    n !== void 0 && r.setType(B.transform(n, t));
     const i = r.getItemType();
     i !== void 0 && r.setItemType(
-      w.transform(i, t)
+      B.transform(i, t)
     );
     const o = r.getKeyType();
     o !== void 0 && r.setKeyType(
-      w.transform(o, t)
+      B.transform(o, t)
     );
     const l = r.getValueType();
     l !== void 0 && r.setValueType(
-      w.transform(l, t)
+      B.transform(l, t)
     );
-    const c = r.getItems();
-    if (c !== void 0) {
-      const y = c.map(
-        (d) => w.transform(d, t)
+    const a = r.getItems();
+    if (a !== void 0) {
+      const y = a.map(
+        (d) => B.transform(d, t)
       );
       r.setItems(y);
     }
     const u = r.getProperties();
     if (u !== void 0) {
       const y = Object.keys(u).reduce(
-        (d, h) => (d[h] = w.transform(u[h], t), d),
+        (d, f) => (d[f] = B.transform(u[f], t), d),
         {}
       );
       r.setProperties(y);
@@ -850,12 +854,12 @@ class w {
     return r;
   }
 }
-const F = (s) => !!s && typeof s == "object" && !Array.isArray(s) && !(s instanceof a), O = (s) => s instanceof E || s instanceof S, Fr = (s) => s.replace(/~1/g, "/").replace(/~0/g, "~");
-function ie(s) {
+const F = (s) => !!s && typeof s == "object" && !Array.isArray(s) && !(s instanceof c), O = (s) => s instanceof E || s instanceof S, $r = (s) => s.replace(/~1/g, "/").replace(/~0/g, "~");
+function oe(s) {
   if (s === "/") return [];
   if (!s.startsWith("/"))
     throw new Error(`Path must start with '/': ${s}`);
-  return s.split("/").slice(1).map(Fr);
+  return s.split("/").slice(1).map($r);
 }
 function se(s) {
   if (s === "-") return -1;
@@ -868,7 +872,7 @@ function se(s) {
     );
   return e;
 }
-function jt(s, e, t, r = !0) {
+function Ut(s, e, t, r = !0) {
   switch (e) {
     case "name":
       return t ? r ? s.getName() ?? null : s : s.getName();
@@ -892,15 +896,15 @@ function jt(s, e, t, r = !0) {
       return s.getItems();
     case "properties":
       return s.getProperties();
-    case C:
+    case V:
       return s.getContracts();
     default:
       return;
   }
 }
-function mt(s, e, t = !0) {
-  if (s instanceof a) {
-    const r = jt(
+function It(s, e, t = !0) {
+  if (s instanceof c) {
+    const r = Ut(
       s,
       e,
       !0,
@@ -918,7 +922,7 @@ function mt(s, e, t = !0) {
       "blue",
       "items",
       "properties",
-      C
+      V
     ].includes(e))
       return r;
     if (/^-?\d+$/.test(e) && e !== "-") {
@@ -935,7 +939,7 @@ function mt(s, e, t = !0) {
   }
   if (F(s)) return s[e];
 }
-function oe(s, e) {
+function le(s, e) {
   if (e.length === 0)
     return {
       parent: s,
@@ -944,29 +948,29 @@ function oe(s, e) {
     };
   let t = s;
   for (let n = 0; n < e.length - 1; ++n) {
-    const i = e[n], o = mt(t, i);
+    const i = e[n], o = It(t, i);
     if (o === void 0)
       throw new Error(`Cannot resolve '/${e.slice(0, n + 1).join("/")}'`);
     t = o;
   }
   const r = e[e.length - 1];
-  if (t instanceof a) {
-    const n = mt(t, r, !1);
-    if ((typeof n != "object" || n === null || O(n)) && !(n instanceof a) && !Array.isArray(n) && ["name", "description", "value", "blueId"].includes(r))
+  if (t instanceof c) {
+    const n = It(t, r, !1);
+    if ((typeof n != "object" || n === null || O(n)) && !(n instanceof c) && !Array.isArray(n) && ["name", "description", "value", "blueId"].includes(r))
       return {
         parent: t,
         key: r,
         actualTarget: n
       };
   }
-  return Array.isArray(t) && r === "-" ? { parent: t, key: "-" } : t instanceof a && t.getItems() && r === "-" ? { parent: t, key: "-" } : {
+  return Array.isArray(t) && r === "-" ? { parent: t, key: "-" } : t instanceof c && t.getItems() && r === "-" ? { parent: t, key: "-" } : {
     parent: t,
     key: Array.isArray(t) ? se(r) : r
   };
 }
 function ct(s, e) {
-  if (s instanceof a) {
-    const t = e, r = jt(s, t, !1);
+  if (s instanceof c) {
+    const t = e, r = Ut(s, t, !1);
     if (r !== void 0 || [
       "name",
       "description",
@@ -979,7 +983,7 @@ function ct(s, e) {
       "blue",
       "items",
       "properties",
-      C
+      V
     ].includes(t))
       return r;
     if (typeof e == "number" || typeof e == "string" && /^\d+$/.test(e)) {
@@ -991,23 +995,23 @@ function ct(s, e) {
   return Array.isArray(s) || F(s) ? s[e] : s;
 }
 function P(s) {
-  if (s instanceof a) return s;
+  if (s instanceof c) return s;
   if (s === null || typeof s == "string" || typeof s == "number" || typeof s == "boolean" || O(s))
     return g.deserialize(s);
-  const e = Ze(s);
+  const e = We(s);
   return g.deserialize(e);
 }
-function Ze(s) {
+function We(s) {
   if (s === void 0) return null;
   if (s === null || typeof s != "object") return s;
-  if (Array.isArray(s)) return s.map(Ze);
+  if (Array.isArray(s)) return s.map(We);
   const e = {};
   for (const [t, r] of Object.entries(s))
-    e[t] = Ze(r);
+    e[t] = We(r);
   return e;
 }
-function at(s, e, t) {
-  if (s instanceof a) {
+function ut(s, e, t) {
+  if (s instanceof c) {
     const r = e;
     switch (r) {
       case "name":
@@ -1018,22 +1022,22 @@ function at(s, e, t) {
         return;
       case "type":
         s.setType(
-          t instanceof a || typeof t == "string" || t === void 0 ? t : P(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : P(t)
         );
         return;
       case "itemType":
         s.setItemType(
-          t instanceof a || typeof t == "string" || t === void 0 ? t : P(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : P(t)
         );
         return;
       case "keyType":
         s.setKeyType(
-          t instanceof a || typeof t == "string" || t === void 0 ? t : P(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : P(t)
         );
         return;
       case "valueType":
         s.setValueType(
-          t instanceof a || typeof t == "string" || t === void 0 ? t : P(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : P(t)
         );
         return;
       case "value": {
@@ -1046,7 +1050,7 @@ function at(s, e, t) {
         return;
       case "blue":
         s.setBlue(
-          t instanceof a || t === void 0 ? t : P(t)
+          t instanceof c || t === void 0 ? t : P(t)
         );
         return;
       case "items":
@@ -1055,7 +1059,7 @@ function at(s, e, t) {
       case "properties":
         s.setProperties(t);
         return;
-      case C:
+      case V:
         s.setContracts(t);
         return;
       default: {
@@ -1063,14 +1067,14 @@ function at(s, e, t) {
           const n = s.getProperties();
           n && r in n && delete n[r];
         } else
-          s.getProperties() || s.setProperties({}), s.addProperty(r, t instanceof a ? t : P(t));
+          s.getProperties() || s.setProperties({}), s.addProperty(r, t instanceof c ? t : P(t));
         return;
       }
     }
   }
   Array.isArray(s) ? s.splice(se(e), 1) : F(s) && (t === void 0 ? delete s[e] : s[e] = t);
 }
-function $r(s, e, t, r) {
+function _r(s, e, t, r) {
   let n = -1;
   if (e !== "-" && (n = typeof e == "number" ? e : parseInt(e, 10), isNaN(n)))
     throw new Error(
@@ -1096,7 +1100,7 @@ function $r(s, e, t, r) {
   } else
     i.splice(n, 0, t);
 }
-function Ve(s, e, t, r) {
+function Ae(s, e, t, r) {
   if (Array.isArray(s)) {
     const n = e === "-" ? s.length : se(e);
     if (!r && n > s.length)
@@ -1117,8 +1121,8 @@ function Ve(s, e, t, r) {
       s.splice(n, 0, i);
     return;
   }
-  if (s instanceof a) {
-    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? $r(s, e, P(t), r) : at(s, e, t);
+  if (s instanceof c) {
+    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? _r(s, e, P(t), r) : ut(s, e, t);
     return;
   }
   if (F(s)) {
@@ -1127,13 +1131,13 @@ function Ve(s, e, t, r) {
   }
   throw new Error(`Cannot insert into parent of type ${typeof s}`);
 }
-function _r(s, e) {
+function jr(s, e) {
   if (Array.isArray(s)) {
     const t = se(e);
     t === -1 && e === "-" ? s.length > 0 && s.pop() : t >= 0 && t < s.length && s.splice(t, 1);
     return;
   }
-  if (s instanceof a) {
+  if (s instanceof c) {
     if (typeof e == "number" || typeof e == "string" && /^-?\d+$/.test(e)) {
       const t = s.getItems();
       if (t) {
@@ -1142,25 +1146,25 @@ function _r(s, e) {
         return;
       }
     }
-    at(s, e, void 0);
+    ut(s, e, void 0);
   } else F(s) && delete s[e];
 }
-function He(s) {
-  if (s instanceof a) return s.clone();
+function Ze(s) {
+  if (s instanceof c) return s.clone();
   if (Array.isArray(s))
-    return s.map((t) => He(t));
+    return s.map((t) => Ze(t));
   if (F(s)) {
     const e = {};
     return Object.keys(s).forEach((t) => {
-      e[t] = He(s[t]);
+      e[t] = Ze(s[t]);
     }), e;
   }
   return s;
 }
 function Y(s, e) {
-  if (s === e || s instanceof a && (s.isInlineValue() || s.getValue() !== void 0) && Y(s.getValue() ?? null, e) || e instanceof a && (e.isInlineValue() || e.getValue() !== void 0) && Y(s, e.getValue() ?? null))
+  if (s === e || s instanceof c && (s.isInlineValue() || s.getValue() !== void 0) && Y(s.getValue() ?? null, e) || e instanceof c && (e.isInlineValue() || e.getValue() !== void 0) && Y(s, e.getValue() ?? null))
     return !0;
-  if (s instanceof a && e instanceof a || O(s) && O(e) || O(s) && typeof e == "number" || typeof s == "number" && O(e))
+  if (s instanceof c && e instanceof c || O(s) && O(e) || O(s) && typeof e == "number" || typeof s == "number" && O(e))
     return s.toString() === e.toString();
   if (Array.isArray(s) && Array.isArray(e))
     return s.length === e.length && s.every((t, r) => Y(t, e[r]));
@@ -1170,22 +1174,22 @@ function Y(s, e) {
   }
   return !1;
 }
-function Ut(s, e) {
-  const { parent: t, key: r } = oe(s, ie(e));
+function kt(s, e) {
+  const { parent: t, key: r } = le(s, oe(e));
   return ct(t, r);
 }
-function kt(s, e, t) {
-  const r = ie(e);
+function Kt(s, e, t) {
+  const r = oe(e);
   if (r.length === 0 && e === "/") {
     const o = P(t);
     s.setValue(o.getValue() ?? null), o.getItems() ? s.setItems(o.getItems()) : s.setItems(void 0);
     return;
   }
-  const { parent: n, key: i } = oe(s, r);
-  Ve(n, i, t, !0);
+  const { parent: n, key: i } = le(s, r);
+  Ae(n, i, t, !0);
 }
 function Lr(s, e, t) {
-  const r = ie(e);
+  const r = oe(e);
   if (r.length === 0 && e === "/") {
     if (s.getItems() && Array.isArray(t)) {
       const o = P(t);
@@ -1196,52 +1200,52 @@ function Lr(s, e, t) {
     }
     return !0;
   }
-  const { parent: n, key: i } = oe(s, r);
-  return Ve(n, i, t, !1), !0;
+  const { parent: n, key: i } = le(s, r);
+  return Ae(n, i, t, !1), !0;
 }
-function jr(s, e, t) {
-  const r = ie(e);
+function Ur(s, e, t) {
+  const r = oe(e);
   if (r.length === 0 && e === "/") {
     const l = P(t);
     return s.setValue(l.getValue() ?? null), l.getItems() ? s.setItems(l.getItems()) : s.setItems(void 0), !0;
   }
-  const { parent: n, key: i, actualTarget: o } = oe(s, r);
-  if (o !== void 0 && n instanceof a)
-    at(n, i, t);
+  const { parent: n, key: i, actualTarget: o } = le(s, r);
+  if (o !== void 0 && n instanceof c)
+    ut(n, i, t);
   else {
-    const l = ct(n, i), c = Array.isArray(n) || n instanceof a && n.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
+    const l = ct(n, i), a = Array.isArray(n) || n instanceof c && n.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
     if (l === void 0) {
-      if (c)
+      if (a)
         throw new Error(
           `REPLACE failed: Target array index '${i.toString()}' is out of bounds or does not exist at path '${e}'.`
         );
-      Ve(n, i, t, !0);
+      Ae(n, i, t, !0);
     } else
-      Ve(n, i, t, !0);
+      Ae(n, i, t, !0);
   }
   return !0;
 }
-function Kt(s, e) {
-  const t = ie(e);
+function Yt(s, e) {
+  const t = oe(e);
   if (t.length === 0 && e === "/")
     return s.setValue(null), s.setItems(void 0), s.setProperties(void 0), !0;
-  const { parent: r, key: n } = oe(s, t);
-  return _r(r, n), !0;
-}
-function Ur(s, e, t) {
-  const r = He(Ut(s, e));
-  return kt(s, t, r), !0;
+  const { parent: r, key: n } = le(s, t);
+  return jr(r, n), !0;
 }
 function kr(s, e, t) {
-  const r = ie(e), { parent: n, key: i } = oe(s, r), o = ct(n, i);
+  const r = Ze(kt(s, e));
+  return Kt(s, t, r), !0;
+}
+function Kr(s, e, t) {
+  const r = oe(e), { parent: n, key: i } = le(s, r), o = ct(n, i);
   if (o === void 0)
     throw new Error(`MOVE failed: 'from' location '${e}' does not exist.`);
-  return Kt(s, e) ? (kt(s, t, o), !0) : !1;
+  return Yt(s, e) ? (Kt(s, t, o), !0) : !1;
 }
-function Kr(s, e, t) {
-  const r = Ut(s, e);
+function Yr(s, e, t) {
+  const r = kt(s, e);
   let n = t;
-  if (r instanceof a)
+  if (r instanceof c)
     if ((t === null || typeof t == "string" || typeof t == "number" || typeof t == "boolean" || O(t)) && (r.isInlineValue() || r.getValue() !== void 0)) {
       if (!Y(r.getValue() ?? null, t))
         throw new Error(
@@ -1250,7 +1254,7 @@ function Kr(s, e, t) {
           )}, got ${JSON.stringify(r.getValue() ?? null)}`
         );
       return !0;
-    } else typeof t == "object" && !(t instanceof a) && (n = P(t));
+    } else typeof t == "object" && !(t instanceof c) && (n = P(t));
   else if (O(r) && typeof t == "number")
     r instanceof E ? n = new E(t.toString()) : r instanceof S && (n = new S(t.toString()));
   else if ((r === null || typeof r == "string" || typeof r == "number" || typeof r == "boolean") && O(t)) {
@@ -1258,98 +1262,98 @@ function Kr(s, e, t) {
     !Y(r, i.toString()) && (typeof r == "number" && parseFloat(i.toString()));
   }
   if (!Y(r, n)) {
-    const i = r instanceof a ? r.toString() : JSON.stringify(r), o = n instanceof a ? n.toString() : JSON.stringify(n);
+    const i = r instanceof c ? r.toString() : JSON.stringify(r), o = n instanceof c ? n.toString() : JSON.stringify(n);
     throw new Error(
       `TEST failed at '${e}': Expected ${o}, got ${i}`
     );
   }
   return !0;
 }
-function Yr(s, e) {
+function zr(s, e) {
   switch (e.op) {
     case "add":
       return Lr(s, e.path, e.val);
     case "replace":
-      return jr(s, e.path, e.val);
+      return Ur(s, e.path, e.val);
     case "remove":
-      return Kt(s, e.path);
+      return Yt(s, e.path);
     case "copy":
-      return Ur(s, e.from, e.path);
-    case "move":
       return kr(s, e.from, e.path);
+    case "move":
+      return Kr(s, e.from, e.path);
     case "test":
-      return Kr(s, e.path, e.val);
+      return Yr(s, e.path, e.val);
   }
 }
 function Kn(s, e, t = !1) {
   const r = t ? s : s.clone();
-  return Yr(r, e), r;
+  return zr(r, e), r;
 }
 const ke = Symbol.for("zod-schema-annotations");
-function zr() {
+function Gr() {
   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 Yt() {
-  const s = zr();
+function zt() {
+  const s = Gr();
   return ke in s || (s[ke] = /* @__PURE__ */ new WeakMap()), s[ke];
 }
 function Ie(s, e) {
-  const t = Yt(), r = t.get(s) || {};
+  const t = zt(), r = t.get(s) || {};
   return t.set(s, { ...r, ...e }), s;
 }
-const R = (s) => Yt().get(s), Gr = (s) => (e) => {
+const R = (s) => zt().get(s), Jr = (s) => (e) => {
   const t = R(e);
   return Ie(e, {
     ...t,
     blueDescription: s
   });
-}, Jr = (s) => {
+}, Wr = (s) => {
   const e = R(s);
-  return p(e) && et(e.blueDescription) ? e.blueDescription : null;
-}, Yn = (s) => Gr(s)(f.string().optional()), Zr = f.union([f.string(), f.boolean()]), Hr = (s) => (e) => {
+  return p(e) && tt(e.blueDescription) ? e.blueDescription : null;
+}, Yn = (s) => Jr(s)(h.string().optional()), Zr = h.union([h.string(), h.boolean()]), Hr = (s) => (e) => {
   const t = R(e);
   return Ie(e, {
     ...t,
     blueId: s
   });
-}, Wr = (s) => {
+}, Xr = (s) => {
   const e = R(s), t = Zr.safeParse(e?.blueId);
   return t.success ? t.data : null;
-}, zn = (s) => Hr(s ?? !0)(f.string()), Xr = (s) => (e) => {
+}, zn = (s) => Hr(s ?? !0)(h.string()), qr = (s) => (e) => {
   const t = R(e);
   return Ie(e, {
     ...t,
     blueName: s
   });
-}, qr = (s) => {
+}, Qr = (s) => {
   const e = R(s);
-  return p(e) && et(e.blueName) ? e.blueName : null;
+  return p(e) && tt(e.blueName) ? e.blueName : null;
 }, Gn = (s) => {
-  const e = f.string().optional();
-  return Xr(s)(e);
-}, Qr = () => (s) => {
+  const e = h.string().optional();
+  return qr(s)(e);
+}, es = () => (s) => {
   const e = R(s);
   return Ie(s, {
     ...e,
     blueNode: !0
   });
-}, es = (s) => {
+}, ts = (s) => {
   const e = R(s);
   return p(e) && p(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
-}, zt = (s) => !!es(s), Jn = () => {
-  const s = f.instanceof(a);
-  return Qr()(s);
-}, ts = f.object({
-  value: f.array(f.string()).optional(),
-  defaultValue: f.string().optional()
-}), rs = (s) => {
-  const e = R(s), t = ts.passthrough().safeParse(e?.typeBlueId);
+}, Gt = (s) => !!ts(s), Jn = () => {
+  const s = h.instanceof(c);
+  return es()(s);
+}, rs = h.object({
+  value: h.array(h.string()).optional(),
+  defaultValue: h.string().optional()
+}), ss = (s) => {
+  const e = R(s), t = rs.passthrough().safeParse(e?.typeBlueId);
   return t.success ? t.data : null;
-}, Zn = (s) => (e) => {
+}, Wn = (s) => (e) => {
   const t = R(e), r = typeof s == "string" ? { value: [s] } : s;
   return Ie(e, {
     ...t,
@@ -1359,32 +1363,32 @@ const R = (s) => Yt().get(s), Gr = (s) => (e) => {
     }
   });
 };
-class de {
+class pe {
   static resolveBlueId(e) {
-    const t = rs(e);
+    const t = ss(e);
     if (I(t))
       return null;
     const r = t.defaultValue;
     if (p(r))
       return r;
     const n = t.value?.[0];
-    return p(n) ? n : de.getRepositoryBlueId(t, e);
+    return p(n) ? n : pe.getRepositoryBlueId(t, e);
   }
   static getRepositoryBlueId(e, t) {
     throw new Error("Not implemented");
   }
 }
-class V {
+class A {
   // TODO: Enhance to support schemas associated with multiple blueIds
   static isTypeOf(e, t, r) {
-    const n = de.resolveBlueId(t), i = e.getType()?.getBlueId();
+    const n = pe.resolveBlueId(t), i = e.getType()?.getBlueId();
     if (I(n) || I(i))
       return !1;
     if (n === i)
       return !0;
     if (r?.checkSchemaExtensions && p(r.typeSchemaResolver)) {
       const o = r.typeSchemaResolver.resolveSchema(e);
-      return V.checkSchemaExtension(o, t, {
+      return A.checkSchemaExtension(o, t, {
         typeSchemaResolver: r.typeSchemaResolver
       });
     }
@@ -1396,20 +1400,20 @@ class V {
   static checkSchemaExtension(e, t, r) {
     if (!p(e))
       return !1;
-    const n = V.unwrapSchema(e), i = V.unwrapSchema(t);
+    const n = A.unwrapSchema(e), i = A.unwrapSchema(t);
     return p(r?.typeSchemaResolver) ? r.typeSchemaResolver.isSchemaExtendedFrom(
       n,
       i
     ) : !1;
   }
   static isWrapperType(e) {
-    return e instanceof Nt || e instanceof Pt || e instanceof St || e instanceof At || e instanceof Ne || e instanceof Pe;
+    return e instanceof Pt || e instanceof St || e instanceof Ct || e instanceof At || e instanceof Ne || e instanceof Pe;
   }
   static unwrapSchema(e) {
-    return zt(e) ? e : V.isWrapperType(e) ? e instanceof Ne ? V.unwrapSchema(e.innerType()) : e instanceof Pe ? V.unwrapSchema(e.schema) : V.unwrapSchema(e.unwrap()) : e;
+    return Gt(e) ? e : A.isWrapperType(e) ? e instanceof Ne ? A.unwrapSchema(e.innerType()) : e instanceof Pe ? A.unwrapSchema(e.schema) : A.unwrapSchema(e.unwrap()) : e;
   }
 }
-function It(s, e) {
+function Tt(s, e) {
   const t = s.getType();
   if (t === void 0)
     return;
@@ -1419,7 +1423,7 @@ function It(s, e) {
       r
     )) {
       const i = xe[r];
-      return new a().setBlueId(r).setName(i);
+      return new c().setBlueId(r).setName(i);
     }
     const n = e.fetchByBlueId(r);
     if (!n || n.length === 0)
@@ -1432,82 +1436,82 @@ function It(s, e) {
   }
   return t;
 }
-function b(s, e, t) {
+function w(s, e, t) {
   const r = T.calculateBlueIdSync(s), n = T.calculateBlueIdSync(e);
   if (r === n)
     return !0;
   if (r && X.includes(
     r
   )) {
-    let c = e;
-    for (; c !== void 0; ) {
-      if (T.calculateBlueIdSync(c) === r)
+    let a = e;
+    for (; a !== void 0; ) {
+      if (T.calculateBlueIdSync(a) === r)
         return !0;
-      c = It(c, t);
+      a = Tt(a, t);
     }
     return !1;
   }
   let i = s;
   const o = s.getBlueId();
   if (o) {
-    const c = t.fetchByBlueId(o);
-    c && c.length === 1 && (i = c[0]);
+    const a = t.fetchByBlueId(o);
+    a && a.length === 1 && (i = a[0]);
   }
   let l = i;
   for (; l !== void 0; ) {
     if (T.calculateBlueIdSync(l) === n)
       return !0;
-    l = It(l, t);
+    l = Tt(l, t);
   }
   return !1;
 }
-function ss(s, e) {
-  return ot.some((t) => {
-    const r = new a().setBlueId(t);
-    return b(s, r, e);
-  });
-}
 function ns(s, e) {
-  const t = new a().setBlueId(_);
-  return b(s, t, e);
+  return lt.some((t) => {
+    const r = new c().setBlueId(t);
+    return w(s, r, e);
+  });
 }
 function is(s, e) {
-  const t = new a().setBlueId(j);
-  return b(s, t, e);
+  const t = new c().setBlueId(_);
+  return w(s, t, e);
 }
 function os(s, e) {
-  const t = new a().setBlueId(L);
-  return b(s, t, e);
+  const t = new c().setBlueId(L);
+  return w(s, t, e);
 }
 function ls(s, e) {
-  const t = new a().setBlueId(U);
-  return b(s, t, e);
+  const t = new c().setBlueId(j);
+  return w(s, t, e);
 }
-function Gt(s, e) {
-  const t = new a().setBlueId(nt);
-  return b(s, t, e);
+function as(s, e) {
+  const t = new c().setBlueId(U);
+  return w(s, t, e);
 }
 function Jt(s, e) {
-  const t = new a().setBlueId(it);
-  return b(s, t, e);
+  const t = new c().setBlueId(it);
+  return w(s, t, e);
+}
+function Wt(s, e) {
+  const t = new c().setBlueId(ot);
+  return w(s, t, e);
 }
 function cs(s, e) {
   return Me.some((t) => {
-    const r = new a().setName(t);
-    return b(s, r, e);
+    const r = new c().setName(t);
+    return w(s, r, e);
   });
 }
-function as(s, e) {
+function us(s, e) {
   for (const t of Me) {
-    const r = new a().setName(t);
-    if (b(s, r, e))
+    const r = new c().setName(t);
+    if (w(s, r, e))
       return t;
   }
   throw new Error(
     `Cannot determine the basic type for node of type "${s.getName() || "unknown"}".`
   );
 }
-class us {
+class ds {
   blueIdMap = /* @__PURE__ */ new Map();
   nodeProvider;
   constructor(e = [], t) {
@@ -1518,7 +1522,7 @@ class us {
       this.registerSchema(t);
   }
   registerSchema(e) {
-    const t = de.resolveBlueId(e);
+    const t = pe.resolveBlueId(e);
     if (p(t)) {
       if (this.blueIdMap.has(t))
         throw new Error(`Duplicate BlueId value: ${t}`);
@@ -1542,8 +1546,8 @@ class us {
       return !0;
     if (p(this.nodeProvider))
       try {
-        const i = new a().setBlueId(r), o = new a().setBlueId(n);
-        if (b(i, o, this.nodeProvider))
+        const i = new c().setBlueId(r), o = new c().setBlueId(n);
+        if (w(i, o, this.nodeProvider))
           return !0;
       } catch {
       }
@@ -1552,7 +1556,7 @@ class us {
   getBlueIdForSchema(e) {
     if (I(e))
       return null;
-    const t = de.resolveBlueId(e);
+    const t = pe.resolveBlueId(e);
     if (p(t))
       return t;
     for (const [r, n] of this.blueIdMap)
@@ -1581,7 +1585,7 @@ const N = {
   BLUE: "blue",
   ITEMS: "items"
 };
-class ut {
+class dt {
   /**
    * Check if a node is empty (has no fields set)
    */
@@ -1613,27 +1617,27 @@ class ut {
    * Create a text node
    */
   static textNode(e) {
-    return new a().setType(new a().setBlueId(_)).setValue(e);
+    return new c().setType(new c().setBlueId(_)).setValue(e);
   }
   /**
    * Create an integer node
    */
   static integerNode(e) {
     const t = e instanceof E ? e : new E(e.toString());
-    return new a().setType(new a().setBlueId(j)).setValue(t);
+    return new c().setType(new c().setBlueId(L)).setValue(t);
   }
   /**
    * Create a double node
    */
   static doubleNode(e) {
     const t = e instanceof S ? e : new S(e.toString());
-    return new a().setType(new a().setBlueId(L)).setValue(t);
+    return new c().setType(new c().setBlueId(j)).setValue(t);
   }
   /**
    * Create a boolean node
    */
   static booleanNode(e) {
-    return new a().setType(new a().setBlueId(U)).setValue(e);
+    return new c().setType(new c().setBlueId(U)).setValue(e);
   }
   /**
    * Check if a node has exactly the specified fields
@@ -1685,11 +1689,11 @@ class ut {
     }
   }
 }
-class dt {
+class pt {
 }
 class ce {
   static convert(e) {
-    const t = new We();
+    const t = new He();
     return ce.traverseNode(e, "", t), t.build();
   }
   static traverseNode(e, t, r) {
@@ -1701,22 +1705,22 @@ class ce {
       return;
     }
     if (n)
-      for (const [c, u] of Object.entries(n)) {
-        const y = `${t}/${c}`;
+      for (const [a, u] of Object.entries(n)) {
+        const y = `${t}/${a}`;
         ce.traverseNode(u, y, r);
       }
     if (i)
-      for (let c = 0; c < i.length; c++) {
-        const u = `${t}/${c}`;
-        ce.traverseNode(i[c], u, r);
+      for (let a = 0; a < i.length; a++) {
+        const u = `${t}/${a}`;
+        ce.traverseNode(i[a], u, r);
       }
   }
 }
-function Tt(s, e) {
+function vt(s, e) {
   const t = s.split(e), r = [...t].reverse().findIndex((i) => i !== ""), n = r === -1 ? 0 : t.length - r;
   return t.slice(0, n);
 }
-class $e extends dt {
+class $e extends pt {
   allowedPaths;
   maxDepth;
   currentPath = [];
@@ -1767,7 +1771,7 @@ class $e extends dt {
    * @returns True if the path matches the allowed path pattern, false otherwise
    */
   matchesAllowedPath(e, t) {
-    const r = Tt(e, "/"), n = Tt(t, "/");
+    const r = vt(e, "/"), n = vt(t, "/");
     if (n.length > r.length)
       return !1;
     for (let i = 1; i < n.length; i++)
@@ -1809,7 +1813,7 @@ class $e extends dt {
    * @returns The path limits
    */
   static withMaxDepth(e) {
-    const t = new We().setMaxDepth(e);
+    const t = new He().setMaxDepth(e);
     for (let r = 1; r <= e; r++) {
       const n = "/" + Array(r).fill("*").join("/");
       t.addPath(n);
@@ -1822,7 +1826,7 @@ class $e extends dt {
    * @returns The path limits
    */
   static withSinglePath(e) {
-    return new We().addPath(e).build();
+    return new He().addPath(e).build();
   }
   /**
    * Creates path limits by analyzing the structure of a node.
@@ -1832,7 +1836,7 @@ class $e extends dt {
     return ce.convert(e);
   }
 }
-class We {
+class He {
   allowedPaths = /* @__PURE__ */ new Set();
   maxDepth = Number.MAX_SAFE_INTEGER;
   /**
@@ -1859,7 +1863,7 @@ class We {
     return new $e(this.allowedPaths, this.maxDepth);
   }
 }
-class ds extends dt {
+class Xe extends pt {
   /**
    * Determines if a path segment should be extended - always returns true
    * @returns Always true
@@ -1885,7 +1889,7 @@ class ds extends dt {
   exitPathSegment() {
   }
 }
-class _e extends dt {
+class _e extends pt {
   limits;
   /**
    * Creates a composite limits with the specified limit strategies
@@ -1945,7 +1949,7 @@ class _e extends dt {
     return new _e(e);
   }
 }
-const K = new ds();
+const K = new Xe();
 class ps {
   blue;
   constructor(e) {
@@ -1955,8 +1959,8 @@ class ps {
     const n = t.getType();
     if (this.matchesImplicitStructure(e, n))
       return !0;
-    const i = $e.fromNode(t), o = _e.of(r, i), l = this.extendAndResolve(e, o), c = this.blue.resolve(t, o);
-    return this.verifyMatch(l, t, o) && this.recursiveValueComparison(l, c);
+    const i = $e.fromNode(t), o = _e.of(r, i), l = this.extendAndResolve(e, o), a = this.blue.resolve(t, o);
+    return this.verifyMatch(l, t, o) && this.recursiveValueComparison(l, a);
   }
   /**
    * Resolves a node with the runtime while preserving any structure that could
@@ -1976,17 +1980,17 @@ class ps {
     const r = t.getItems(), n = e.getItems();
     if (r && r.length > 0)
       if (!n || n.length === 0)
-        e.setItems(r.map((c) => c.clone()));
+        e.setItems(r.map((a) => a.clone()));
       else
-        for (let c = 0; c < Math.min(n.length, r.length); c++)
-          this.restoreMissingStructure(n[c], r[c]);
+        for (let a = 0; a < Math.min(n.length, r.length); a++)
+          this.restoreMissingStructure(n[a], r[a]);
     const i = t.getProperties();
     if (i) {
-      let c = e.getProperties();
-      c || (c = {}, e.setProperties(c));
+      let a = e.getProperties();
+      a || (a = {}, e.setProperties(a));
       for (const [u, y] of Object.entries(i)) {
-        const d = c[u];
-        d === void 0 ? c[u] = y.clone() : this.restoreMissingStructure(d, y);
+        const d = a[u];
+        d === void 0 ? a[u] = y.clone() : this.restoreMissingStructure(d, y);
       }
     }
     const o = t.getBlueId();
@@ -2013,7 +2017,7 @@ class ps {
     );
     if (r && !n) {
       const d = e.getType();
-      if (!d || !b(
+      if (!d || !w(
         d,
         r,
         this.blue.getNodeProvider()
@@ -2022,11 +2026,11 @@ class ps {
     }
     const i = t.getBlueId();
     if (!n && i !== void 0) {
-      const d = e.getBlueId(), h = e.getType()?.getBlueId();
+      const d = e.getBlueId(), f = e.getType()?.getBlueId();
       if (d !== void 0) {
         if (i !== d)
           return !1;
-      } else if (h === void 0 || i !== h)
+      } else if (f === void 0 || i !== f)
         return !1;
     }
     const o = t.getValue();
@@ -2034,7 +2038,7 @@ class ps {
       const d = e.getValue();
       if (d === void 0)
         return !1;
-      if (A(d) && A(o)) {
+      if (C(d) && C(o)) {
         if (!d.eq(o))
           return !1;
       } else if (d !== o)
@@ -2043,26 +2047,26 @@ class ps {
     const l = t.getItems();
     if (l !== void 0) {
       const d = e.getItems() ?? [];
-      for (let h = 0; h < l.length; h++)
-        if (h < d.length) {
-          if (!this.recursiveValueComparison(d[h], l[h]))
+      for (let f = 0; f < l.length; f++)
+        if (f < d.length) {
+          if (!this.recursiveValueComparison(d[f], l[f]))
             return !1;
-        } else if (this.hasValueInNestedStructure(l[h]))
+        } else if (this.hasValueInNestedStructure(l[f]))
           return !1;
     }
-    const c = t.getItemType();
-    if (c !== void 0) {
+    const a = t.getItemType();
+    if (a !== void 0) {
       const d = e.getItems() ?? [];
-      for (const h of d)
-        if (!this.recursiveValueComparison(h, c))
+      for (const f of d)
+        if (!this.recursiveValueComparison(f, a))
           return !1;
     }
     const u = t.getProperties();
     if (u !== void 0) {
       const d = e.getProperties() ?? {};
-      for (const [h, v] of Object.entries(u))
-        if (h in d) {
-          if (!this.recursiveValueComparison(d[h], v))
+      for (const [f, v] of Object.entries(u))
+        if (f in d) {
+          if (!this.recursiveValueComparison(d[f], v))
             return !1;
         } else if (this.hasValueInNestedStructure(v))
           return !1;
@@ -2070,8 +2074,8 @@ class ps {
     const y = t.getValueType();
     if (y !== void 0) {
       const d = Object.values(e.getProperties() ?? {});
-      for (const h of d)
-        if (!this.recursiveValueComparison(h, y))
+      for (const f of d)
+        if (!this.recursiveValueComparison(f, y))
           return !1;
     }
     return !0;
@@ -2098,7 +2102,7 @@ class ps {
    * shape of the requested core list or dictionary type.
    */
   matchesImplicitStructure(e, t) {
-    return t === void 0 || e.getType() !== void 0 ? !1 : Gt(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : Jt(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
+    return t === void 0 || e.getType() !== void 0 ? !1 : Jt(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : Wt(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
   }
   isImplicitListStructure(e) {
     return e.getItems() !== void 0 && e.getValue() === void 0;
@@ -2107,26 +2111,26 @@ class ps {
     return e.getProperties() !== void 0 && e.getValue() === void 0;
   }
 }
-const fs = (s) => s instanceof Nt || s instanceof Pt || s instanceof St || s instanceof At || s instanceof Ne || s instanceof Pe, hs = (s) => s instanceof ee || s instanceof te || s instanceof Be || s instanceof be;
+const hs = (s) => s instanceof Pt || s instanceof St || s instanceof Ct || s instanceof At || s instanceof Ne || s instanceof Pe, fs = (s) => s instanceof ee || s instanceof te || s instanceof be || s instanceof we;
 class Zt {
   static convertValue(e, t) {
     const r = e.getType()?.getBlueId(), n = e.getValue();
-    return I(n) ? hs(t) && ut.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : n : _ === r ? this.convertFromString(String(n), t) : L === r || n instanceof S ? this.convertFromBigDecimal(
+    return I(n) ? fs(t) && dt.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : n : _ === r ? this.convertFromString(String(n), t) : j === r || n instanceof S ? this.convertFromBigDecimal(
       new S(n?.toString()),
       t
-    ) : j === r || n instanceof E ? this.convertFromBigInteger(
+    ) : L === r || n instanceof E ? this.convertFromBigInteger(
       new E(n?.toString()),
       t
     ) : U === r || typeof n == "boolean" ? this.convertFromBoolean(!!n, t) : this.convertFromString(String(n), t);
   }
   static convertFromString(e, t) {
-    if (!t || t instanceof ee || t instanceof ar || t instanceof ur)
+    if (!t || t instanceof ee || t instanceof ur || t instanceof dr)
       return e;
     if (t instanceof te)
       return Number(e);
-    if (t instanceof Be)
-      return e.toLowerCase() === "true";
     if (t instanceof be)
+      return e.toLowerCase() === "true";
+    if (t instanceof we)
       return BigInt(e);
     throw new Error(`Cannot convert String to ${t._def.typeName}`);
   }
@@ -2140,20 +2144,20 @@ class Zt {
   static convertFromBigInteger(e, t) {
     if (t instanceof te)
       return e.toNumber();
-    if (t instanceof be)
+    if (t instanceof we)
       return BigInt(e.toString());
     if (t instanceof ee)
       return e.toString();
     throw new Error(`Cannot convert Number to ${t._def.typeName}`);
   }
   static convertFromBoolean(e, t) {
-    if (!t || t instanceof Be)
+    if (!t || t instanceof be)
       return e;
     if (t instanceof ee)
       return e.toString();
     if (t instanceof te)
       return Number(e);
-    if (t instanceof be)
+    if (t instanceof we)
       return BigInt(e);
     throw new Error(`Cannot convert Boolean to ${t._def.typeName}`);
   }
@@ -2161,7 +2165,7 @@ class Zt {
     if (!e) return null;
     if (e instanceof te)
       return 0;
-    if (e instanceof Be)
+    if (e instanceof be)
       return !1;
     if (e instanceof ee)
       return "";
@@ -2183,26 +2187,26 @@ class gs {
     return this.convertFields(e, t);
   }
   convertFields(e, t) {
-    if (t instanceof dr) {
+    if (t instanceof pr) {
       const r = t._def.left, n = t._def.right, i = this.convert(e, r), o = this.convert(e, n);
       return { ...i, ...o };
     }
-    if (t instanceof pr)
+    if (t instanceof hr)
       throw new Error("Union not supported");
     if (t instanceof fr)
       return Object.keys(t.shape).reduce(
         (n, i) => {
-          const o = e.getProperties(), l = t.shape[i], c = Wr(l);
-          if (p(c)) {
-            const v = et(c) ? c : i, k = o?.[v], q = k ? T.calculateBlueIdSync(k) : void 0;
+          const o = e.getProperties(), l = t.shape[i], a = Xr(l);
+          if (p(a)) {
+            const v = tt(a) ? a : i, k = o?.[v], q = k ? T.calculateBlueIdSync(k) : void 0;
             return n[i] = q, n;
           }
-          const u = qr(l);
+          const u = Qr(l);
           if (p(u)) {
             const v = o?.[u];
             return n[i] = v?.getName(), n;
           }
-          const y = Jr(l);
+          const y = Wr(l);
           if (p(y)) {
             const v = o?.[y];
             return n[i] = v?.getDescription(), n;
@@ -2218,11 +2222,11 @@ class gs {
           const d = o?.[i];
           if (I(d))
             return n;
-          const h = this.nodeToObjectConverter.convert(
+          const f = this.nodeToObjectConverter.convert(
             d,
             l
           );
-          return n[i] = h, n;
+          return n[i] = f, n;
         },
         {}
       );
@@ -2266,13 +2270,13 @@ class Ts {
     p(o) && i.set(G, o);
     const l = e.getDescription();
     p(l) && i.set(J, l);
-    const c = e.getProperties();
-    return p(c) && Object.entries(c).forEach(([u, y]) => {
-      const d = new a().setValue(u);
-      d.setType(new a().setBlueId(_));
-      const h = Zt.convertValue(d, r), v = this.nodeToObjectConverter.convert(y, n);
-      i.set(h, v);
-    }), t instanceof hr ? Object.fromEntries(i) : i;
+    const a = e.getProperties();
+    return p(a) && Object.entries(a).forEach(([u, y]) => {
+      const d = new c().setValue(u);
+      d.setType(new c().setBlueId(_));
+      const f = Zt.convertValue(d, r), v = this.nodeToObjectConverter.convert(y, n);
+      i.set(f, v);
+    }), t instanceof yr ? Object.fromEntries(i) : i;
   }
 }
 class vs {
@@ -2280,12 +2284,12 @@ class vs {
     return m.get(e);
   }
 }
-class Bs {
+class bs {
   convert(e) {
     return m.get(e);
   }
 }
-class bs {
+class ws {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2299,21 +2303,21 @@ class bs {
     );
   }
 }
-const ws = f.union([
-  f.literal("ZodString"),
-  f.literal("ZodNumber"),
-  f.literal("ZodBoolean"),
-  f.literal("ZodBigInt"),
-  f.literal("ZodArray"),
-  f.literal("ZodSet"),
-  f.literal("ZodMap"),
-  f.literal("ZodRecord"),
-  f.literal("ZodObject"),
-  f.literal("ZodEnum"),
-  f.literal("ZodNativeEnum"),
-  f.literal("ZodUnknown"),
-  f.literal("ZodAny"),
-  f.literal("ZodTuple")
+const Bs = h.union([
+  h.literal("ZodString"),
+  h.literal("ZodNumber"),
+  h.literal("ZodBoolean"),
+  h.literal("ZodBigInt"),
+  h.literal("ZodArray"),
+  h.literal("ZodSet"),
+  h.literal("ZodMap"),
+  h.literal("ZodRecord"),
+  h.literal("ZodObject"),
+  h.literal("ZodEnum"),
+  h.literal("ZodNativeEnum"),
+  h.literal("ZodUnknown"),
+  h.literal("ZodAny"),
+  h.literal("ZodTuple")
 ]);
 class Es {
   constructor(e) {
@@ -2324,19 +2328,19 @@ class Es {
   converters = /* @__PURE__ */ new Map();
   complexObjectConverter;
   registerConverters() {
-    const e = new ys(), t = new ms(this.nodeToObjectConverter), r = new bs(this.nodeToObjectConverter), n = new Is(this.nodeToObjectConverter), i = new Ts(this.nodeToObjectConverter);
-    this.converters.set("ZodString", e), this.converters.set("ZodNumber", e), this.converters.set("ZodBoolean", e), this.converters.set("ZodBigInt", e), this.converters.set("ZodEnum", e), this.converters.set("ZodNativeEnum", e), this.converters.set("ZodUnknown", new vs()), this.converters.set("ZodAny", new Bs()), this.converters.set("ZodArray", t), this.converters.set("ZodTuple", r), this.converters.set("ZodSet", n), this.converters.set("ZodMap", i), this.converters.set("ZodRecord", i), this.converters.set("ZodObject", this.complexObjectConverter);
+    const e = new ys(), t = new ms(this.nodeToObjectConverter), r = new ws(this.nodeToObjectConverter), n = new Is(this.nodeToObjectConverter), i = new Ts(this.nodeToObjectConverter);
+    this.converters.set("ZodString", e), this.converters.set("ZodNumber", e), this.converters.set("ZodBoolean", e), this.converters.set("ZodBigInt", e), this.converters.set("ZodEnum", e), this.converters.set("ZodNativeEnum", e), this.converters.set("ZodUnknown", new vs()), this.converters.set("ZodAny", new bs()), this.converters.set("ZodArray", t), this.converters.set("ZodTuple", r), this.converters.set("ZodSet", n), this.converters.set("ZodMap", i), this.converters.set("ZodRecord", i), this.converters.set("ZodObject", this.complexObjectConverter);
   }
   getConverter(e) {
     const t = this.getSchemaTypeName(e);
     return this.converters.get(t) ?? this.complexObjectConverter;
   }
   getSchemaTypeName(e) {
-    if (fs(e))
+    if (hs(e))
       return e instanceof Ne ? this.getSchemaTypeName(e.innerType()) : e instanceof Pe ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
     const t = e._def.typeName;
     try {
-      return ws.parse(t);
+      return Bs.parse(t);
     } catch {
       throw new Error(`Schema type name ${t} is not supported`);
     }
@@ -2348,11 +2352,11 @@ class Ns {
   }
   converterFactory;
   convert(e, t) {
-    const r = this.typeSchemaResolver?.resolveSchema(e), n = V.unwrapSchema(t);
-    if (zt(n))
+    const r = this.typeSchemaResolver?.resolveSchema(e), n = A.unwrapSchema(t);
+    if (Gt(n))
       return e;
     let i = n;
-    return V.checkSchemaExtension(
+    return A.checkSchemaExtension(
       r,
       n,
       { typeSchemaResolver: this.typeSchemaResolver }
@@ -2364,7 +2368,7 @@ class Ns {
 }
 class Ht {
   reverse(e) {
-    const t = new a();
+    const t = new c();
     return this.reverseNode(t, e, e.getType()), t;
   }
   reverseNode(e, t, r) {
@@ -2379,8 +2383,8 @@ class Ht {
   }
   reverseTypeReferences(e, t, r) {
     const n = (i, o) => {
-      const l = i(t), c = r ? i(r) : void 0, u = l?.getBlueId();
-      p(u) && (I(c?.getBlueId()) || u !== c.getBlueId()) && o(e, new a().setBlueId(u));
+      const l = i(t), a = r ? i(r) : void 0, u = l?.getBlueId();
+      p(u) && (I(a?.getBlueId()) || u !== a.getBlueId()) && o(e, new c().setBlueId(u));
     };
     n(
       (i) => i.getType(),
@@ -2402,13 +2406,13 @@ class Ht {
       return;
     const i = r?.getItems(), o = [];
     if (p(i) && i.length > 0) {
-      const c = T.calculateBlueIdSync(i);
-      o.push(new a().setBlueId(c));
+      const a = T.calculateBlueIdSync(i);
+      o.push(new c().setBlueId(a));
     }
     const l = i?.length || 0;
-    for (let c = l; c < n.length; c++) {
-      const u = new a();
-      this.reverseNode(u, n[c], void 0), o.push(u);
+    for (let a = l; a < n.length; a++) {
+      const u = new c();
+      this.reverseNode(u, n[a], void 0), o.push(u);
     }
     o.length > 0 && e.setItems(o);
   }
@@ -2418,12 +2422,12 @@ class Ht {
       return;
     const i = {};
     for (const [o, l] of Object.entries(n)) {
-      const c = this.getInheritedProperty(
+      const a = this.getInheritedProperty(
         o,
         t,
         r
-      ), u = new a();
-      this.reverseNode(u, l, c), ut.isEmptyNode(u) || (i[o] = u);
+      ), u = new c();
+      this.reverseNode(u, l, a), dt.isEmptyNode(u) || (i[o] = u);
     }
     Object.keys(i).length > 0 && e.setProperties(i);
   }
@@ -2450,20 +2454,20 @@ class Ht {
     p(o) && r.setItemType(o.clone());
     const l = t.getKeyType();
     p(l) && r.setKeyType(l.clone());
-    const c = t.getValueType();
-    p(c) && r.setValueType(c.clone());
+    const a = t.getValueType();
+    p(a) && r.setValueType(a.clone());
     const u = t.getProperties();
     if (p(u)) {
       const d = r.getProperties() || {};
-      for (const [h, v] of Object.entries(u))
-        d[h] = v.clone();
+      for (const [f, v] of Object.entries(u))
+        d[f] = v.clone();
       r.setProperties(d);
     }
     const y = t.getItems();
     return p(y) && r.setItems(y.map((d) => d.clone())), r;
   }
 }
-class pe extends a {
+class ne extends c {
   /**
    * Creates a new ResolvedBlueNode from a resolved BlueNode
    * @param resolvedNode - The fully resolved node after merge operations
@@ -2497,7 +2501,16 @@ class pe extends a {
    */
   clone() {
     const e = super.clone();
-    return new pe(e);
+    return new ne(e);
+  }
+  /**
+   * Creates a shallow clone of this ResolvedBlueNode while preserving
+   * the resolved marker type.
+   * @returns A new ResolvedBlueNode with shallow-copied containers
+   */
+  cloneShallow() {
+    const e = super.cloneShallow();
+    return new ne(e);
   }
   /**
    * Copies all properties from another BlueNode
@@ -2529,34 +2542,34 @@ function Ps(s) {
     }
   }();
 }
-const Ke = W.types.float.options, Ss = {
+const Ke = H.types.float.options, Ss = {
   ...Ke,
   construct: (s) => {
     const e = s.replace(/_/g, "").toLowerCase();
-    if (!Et(e))
+    if (!Nt(e))
       return new S(e);
     if (Ke.construct)
       return Ke.construct(s);
   }
-}, As = new W.Type("tag:yaml.org,2002:float", Ss), Ye = W.types.int.options, Vs = {
+}, Cs = new H.Type("tag:yaml.org,2002:float", Ss), Ye = H.types.int.options, As = {
   ...Ye,
   construct: (s) => {
     let e = s;
-    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !Et(e))
+    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !Nt(e))
       return new E(e);
     if (Ye.construct)
       return Ye.construct(s);
   }
-}, Cs = new W.Type("tag:yaml.org,2002:int", Vs), Wt = W.CORE_SCHEMA.extend({
-  implicit: [As, Cs]
+}, Vs = new H.Type("tag:yaml.org,2002:int", As), Xt = H.CORE_SCHEMA.extend({
+  implicit: [Cs, Vs]
 }), $ = (s) => {
-  const e = W.load(s, { schema: Wt });
+  const e = H.load(s, { schema: Xt });
   return e === void 0 ? void 0 : e;
-}, Rs = (s) => W.dump(s, {
-  schema: Wt,
+}, Rs = (s) => H.dump(s, {
+  schema: Xt,
   replacer: (e, t) => {
-    if (A(t)) {
-      if (H(t)) {
+    if (C(t)) {
+      if (Z(t)) {
         const r = new M(Number.MIN_SAFE_INTEGER.toString()), n = new M(Number.MAX_SAFE_INTEGER.toString());
         if (t.lt(r) || t.gt(n))
           return t.toString();
@@ -2599,7 +2612,7 @@ class Ds extends Te {
     return this.nodeProviders;
   }
 }
-const Xt = `- type:
+const qt = `- type:
     blueId: 27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo
   mappings:
     Text: DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K
@@ -2618,7 +2631,7 @@ description: This transformation infers type details for Text, Integer, Number a
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
 description: This transformation replaces`, $s = [
-  Xt,
+  qt,
   Ms,
   xs,
   Fs
@@ -2650,8 +2663,8 @@ class _s extends Te {
     }
   }
 }
-class pt extends Te {
-  static INSTANCE = new pt();
+class ht extends Te {
+  static INSTANCE = new ht();
   nodeProvider;
   constructor() {
     super(), this.nodeProvider = new _s();
@@ -2680,14 +2693,14 @@ class z {
     let n, i;
     const o = Array.isArray(r) && r.length > 1;
     if (o) {
-      const l = r.map((c) => {
-        const u = g.deserialize(c);
+      const l = r.map((a) => {
+        const u = g.deserialize(a);
         return t(u);
       });
-      n = T.calculateBlueIdSync(l), i = l.map((c) => m.get(c));
+      n = T.calculateBlueIdSync(l), i = l.map((a) => m.get(a));
     } else {
-      const l = g.deserialize(r), c = t(l);
-      n = T.calculateBlueIdSync(c), i = m.get(c);
+      const l = g.deserialize(r), a = t(l);
+      n = T.calculateBlueIdSync(a), i = m.get(a);
     }
     return new ze(n, i, o);
   }
@@ -2752,7 +2765,7 @@ class z {
     }
   }
 }
-class Ls extends Te {
+class js extends Te {
   fetchByBlueId(e) {
     const t = e.split("#")[0], r = this.fetchContentByBlueId(t);
     if (r == null)
@@ -2767,11 +2780,11 @@ class Ls extends Te {
       if (o.length > 1) {
         const l = parseInt(o[1]);
         if (Array.isArray(i) && l < i.length) {
-          const c = i[l], u = g.deserialize(c);
+          const a = i[l], u = g.deserialize(a);
           return u.setBlueId(e), [u];
         } else if (l === 0) {
-          const c = g.deserialize(i);
-          return c.setBlueId(e), [c];
+          const a = g.deserialize(i);
+          return a.setBlueId(e), [a];
         } else
           return null;
       }
@@ -2784,7 +2797,7 @@ class Ls extends Te {
     }
   }
 }
-class qt extends Ls {
+class Qt extends js {
   nameToBlueIdsMap = /* @__PURE__ */ new Map();
   /**
    * Find a node by name. Throws an error if multiple nodes are found with the same name.
@@ -2828,17 +2841,17 @@ class qt extends Ls {
     ]);
   }
 }
-const Qt = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanceof a) ? s : Qe(s) ? s.map((e) => g.deserialize(e)) : g.deserialize(s), js = async (s) => {
-  const e = Qt(s);
+const er = (s) => s instanceof c || Array.isArray(s) && s.every((e) => e instanceof c) ? s : et(s) ? s.map((e) => g.deserialize(e)) : g.deserialize(s), Ls = async (s) => {
+  const e = er(s);
   return T.calculateBlueId(e);
-}, Hn = (s) => {
-  const e = Qt(s);
+}, Zn = (s) => {
+  const e = er(s);
   return T.calculateBlueIdSync(e);
-}, vt = async (s) => {
-  if (Er(s))
+}, bt = async (s) => {
+  if (Nr(s))
     return s;
   try {
-    const e = Ae.parse(s), t = await js(e);
+    const e = Ce.parse(s), t = await Ls(e);
     return {
       ...s,
       blueId: t
@@ -2846,41 +2859,41 @@ const Qt = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanc
   } catch (e) {
     throw new Error(`Failed enriching object with Blue ID: ${e}`);
   }
-}, Wn = (s) => s?.items, Xn = (s) => s?.value, qn = (s) => I(s) ? {} : Ct(
+}, Hn = (s) => s?.items, Xn = (s) => s?.value, qn = (s) => I(s) ? {} : Rt(
   s,
-  rt
-), Qn = (s) => Pr(s) ? s.type.name ?? null : Sr(s) ? yr(typeof s.value) : Nr(s) ? "List" : null, Us = (s) => p(s) && Object.keys(Ct(s, ["blueId"])).length > 0, ei = (s) => {
+  st
+), Qn = (s) => Sr(s) ? s.type.name ?? null : Cr(s) ? gr(typeof s.value) : Pr(s) ? "List" : null, Us = (s) => p(s) && Object.keys(Rt(s, ["blueId"])).length > 0, ei = (s) => {
   try {
     const e = g.deserialize(s), t = m.get(e);
-    return ue.parse(t);
+    return de.parse(t);
   } catch (e) {
     throw new Error(
       `Failed transforming JSON-like value to BlueObject: ${e}`
     );
   }
-}, Bt = async (s) => {
+}, wt = async (s) => {
   const {
     resolveFunction: e,
     signal: t = new AbortController().signal,
     omitItems: r
   } = s, n = s.count ?? s.items.length;
-  let i = await gr(s.items, async (l) => await vt(l));
+  let i = await mr(s.items, async (l) => await bt(l));
   const o = Math.max(i?.length - n, 0);
   for (let l = i.length - 1; l >= o; l--)
     if (!Us(i[l])) {
-      const c = await e(i[l], { signal: t });
-      if (Array.isArray(c))
-        return Bt({
+      const a = await e(i[l], { signal: t });
+      if (Array.isArray(a))
+        return wt({
           ...s,
           items: [
             ...i.slice(0, l),
-            ...c,
+            ...a,
             ...i.slice(l + 1)
           ]
         });
-      const u = await vt(c);
+      const u = await bt(a);
       if (r?.includes(u.blueId))
-        return Bt({
+        return wt({
           ...s,
           items: [...i.slice(0, l), ...i.slice(l + 1)]
         });
@@ -2892,7 +2905,7 @@ const Qt = (s) => s instanceof a || Array.isArray(s) && s.every((e) => e instanc
     }
   return i;
 };
-function we(s) {
+function Be(s) {
   try {
     const e = new URL(s);
     return e.protocol === "http:" || e.protocol === "https:";
@@ -2907,7 +2920,7 @@ class ks {
    * @returns The processed document
    */
   process(e) {
-    return w.transform(e, this.inferType.bind(this));
+    return B.transform(e, this.inferType.bind(this));
   }
   /**
    * Infer a basic type for a node
@@ -2916,10 +2929,10 @@ class ks {
    */
   inferType(e) {
     const t = e.getType(), r = e.getValue();
-    return I(t) && p(r) && (typeof r == "string" ? e.setType(new a().setBlueId(_)) : typeof r == "bigint" || H(r) ? e.setType(new a().setBlueId(j)) : Ge(r) ? e.setType(new a().setBlueId(L)) : typeof r == "boolean" && e.setType(new a().setBlueId(U))), e;
+    return I(t) && p(r) && (typeof r == "string" ? e.setType(new c().setBlueId(_)) : typeof r == "bigint" || Z(r) ? e.setType(new c().setBlueId(L)) : Ge(r) ? e.setType(new c().setBlueId(j)) : typeof r == "boolean" && e.setType(new c().setBlueId(U))), e;
   }
 }
-class Ce {
+class Ve {
   static MAPPINGS = "mappings";
   mappings = /* @__PURE__ */ new Map();
   /**
@@ -2927,13 +2940,13 @@ class Ce {
    * @param transformationOrMappings - The transformation node or mappings to use
    */
   constructor(e) {
-    if (e instanceof a) {
+    if (e instanceof c) {
       const r = e.getProperties();
-      if (r && r[Ce.MAPPINGS]) {
-        const i = r[Ce.MAPPINGS].getProperties();
+      if (r && r[Ve.MAPPINGS]) {
+        const i = r[Ve.MAPPINGS].getProperties();
         i && Object.entries(i).forEach(([o, l]) => {
-          const c = l.getValue();
-          typeof c == "string" && this.mappings.set(o, c);
+          const a = l.getValue();
+          typeof a == "string" && this.mappings.set(o, a);
         });
       }
     } else
@@ -2945,7 +2958,7 @@ class Ce {
    * @returns The processed document
    */
   process(e) {
-    return w.transform(e, this.transformNode.bind(this));
+    return B.transform(e, this.transformNode.bind(this));
   }
   transformNode(e) {
     const t = e.clone();
@@ -2957,7 +2970,7 @@ class Ce {
       if (this.mappings.has(r)) {
         const n = this.mappings.get(r);
         if (n) {
-          const i = new a().setBlueId(n);
+          const i = new c().setBlueId(n);
           t === e.getType() ? e.setType(i) : t === e.getItemType() ? e.setItemType(i) : t === e.getKeyType() ? e.setKeyType(i) : t === e.getValueType() && e.setValueType(i);
         }
       }
@@ -2972,7 +2985,7 @@ class Ks {
    * @throws Error if any inline type values remain without BlueId mappings
    */
   process(e) {
-    return w.transform(e, this.validateNode.bind(this)), e;
+    return B.transform(e, this.validateNode.bind(this)), e;
   }
   validateNode(e) {
     return this.validateTypeField(e, e.getType(), "type"), this.validateTypeField(e, e.getItemType(), "itemType"), this.validateTypeField(e, e.getKeyType(), "keyType"), this.validateTypeField(e, e.getValueType(), "valueType"), e;
@@ -2995,7 +3008,7 @@ class ft {
    * @param strategy - The strategy to use for missing elements (defaults to THROW_EXCEPTION)
    */
   constructor(e, t) {
-    this.nodeProvider = fe.wrap(e), this.strategy = t || "THROW_EXCEPTION";
+    this.nodeProvider = he.wrap(e), this.strategy = t || "THROW_EXCEPTION";
   }
   /**
    * Extends a node with its resolved references
@@ -3016,13 +3029,13 @@ class ft {
       if (i && !X.includes(
         i
       )) {
-        const h = this.fetchNode(e);
-        if (h && h.length > 0)
-          if (h.length === 1) {
-            const v = h[0];
+        const f = this.fetchNode(e);
+        if (f && f.length > 0)
+          if (f.length === 1) {
+            const v = f[0];
             this.mergeNodes(e, v);
           } else {
-            const v = h.map((q) => q.clone()), k = new a().setItems(v);
+            const v = f.map((q) => q.clone()), k = new c().setItems(v);
             this.mergeNodes(e, k);
           }
       }
@@ -3030,19 +3043,19 @@ class ft {
       o && this.extendNode(o, t, "type", !0);
       const l = e.getItemType();
       l && this.extendNode(l, t, "itemType", !0);
-      const c = e.getKeyType();
-      c && this.extendNode(c, t, "keyType", !0);
+      const a = e.getKeyType();
+      a && this.extendNode(a, t, "keyType", !0);
       const u = e.getValueType();
       u && this.extendNode(u, t, "valueType", !0);
       const y = e.getProperties();
-      y && Object.entries(y).forEach(([h, v]) => {
-        this.extendNode(v, t, h, !1);
+      y && Object.entries(y).forEach(([f, v]) => {
+        this.extendNode(v, t, f, !1);
       });
       const d = e.getItems();
       if (d && d.length > 0) {
         this.reconstructList(d);
-        for (let h = 0; h < d.length; h++)
-          this.extendNode(d[h], t, String(h), !1);
+        for (let f = 0; f < d.length; f++)
+          this.extendNode(d[f], t, String(f), !1);
       }
     } finally {
       n || t.exitPathSegment();
@@ -3080,7 +3093,7 @@ class ft {
     p(r) && e.setValue(r), e.setItems(t.getItems()), e.setProperties(t.getProperties());
   }
 }
-class ht {
+class yt {
   blueIdsCollections = [];
   /**
    * Initializes the generator with default BlueIds collections
@@ -3150,7 +3163,7 @@ ${r}`;
     return Object.keys(this.getAllBlueIds()).length;
   }
 }
-class ne {
+class ie {
   static DEFAULT_BLUE_BLUE_ID = "6sqUywMoBRyj9hgQxSu2nDPnqcyiSM7xu9AB9sN98YJK";
   processorProvider;
   nodeProvider;
@@ -3164,7 +3177,7 @@ class ne {
     const { nodeProvider: t, processorProvider: r, blueIdsMappingGenerator: n } = e;
     if (!t)
       throw new Error("NodeProvider is required");
-    this.nodeProvider = fe.wrap(t), this.processorProvider = r || ne.getStandardProvider(), this.blueIdsMappingGenerator = n || new ht(), this.loadDefaultSimpleBlue();
+    this.nodeProvider = he.wrap(t), this.processorProvider = r || ie.getStandardProvider(), this.blueIdsMappingGenerator = n || new yt(), this.loadDefaultSimpleBlue();
   }
   /**
    * Preprocesses a document node
@@ -3223,7 +3236,7 @@ class ne {
       getProcessor(e) {
         const t = "27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo", r = "FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4", n = e.getType()?.getBlueId();
         if (t === n)
-          return new Ce(
+          return new Ve(
             e
           );
         if (r === n)
@@ -3248,7 +3261,7 @@ ${t}
    */
   loadDefaultSimpleBlue() {
     try {
-      const e = this.enrichDefaultBlue(Xt), t = $(e);
+      const e = this.enrichDefaultBlue(qt), t = $(e);
       if (t)
         this.defaultSimpleBlue = g.deserialize(t);
       else
@@ -3258,15 +3271,15 @@ ${t}
     }
   }
 }
-class yt extends qt {
+class gt extends Qt {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   preprocessor;
   constructor(e) {
     super();
-    const t = new ht(), r = yt.collectAliasMappings(e);
+    const t = new yt(), r = gt.collectAliasMappings(e);
     Object.keys(r).length > 0 && t.registerBlueIds(r);
-    const n = new ne({
+    const n = new ie({
       nodeProvider: this,
       blueIdsMappingGenerator: t
     });
@@ -3312,10 +3325,10 @@ class yt extends qt {
       (o) => o
     ), i = t || n.blueId;
     this.blueIdToContentMap.set(i, n.content), this.blueIdToMultipleDocumentsMap.set(i, !0), r.forEach((o, l) => {
-      const c = `${i}#${l}`, u = m.get(o), y = T.calculateBlueIdSync(o);
+      const a = `${i}#${l}`, u = m.get(o), y = T.calculateBlueIdSync(o);
       this.blueIdToContentMap.set(y, u), this.blueIdToMultipleDocumentsMap.set(y, !1);
       const d = o.getName();
-      d && this.addToNameMap(d, c);
+      d && this.addToNameMap(d, a);
     });
   }
   fetchContentByBlueId(e) {
@@ -3340,7 +3353,7 @@ class yt extends qt {
     return this.blueIdToContentMap.has(t);
   }
 }
-class fe {
+class he {
   /**
    * Wraps a NodeProvider with a SequentialNodeProvider that includes bootstrap providers and repository definitions
    * @param originalProvider - The original NodeProvider to wrap
@@ -3348,9 +3361,9 @@ class fe {
    * @returns A wrapped NodeProvider that includes bootstrap providers and repository definitions
    */
   static wrap(e, t) {
-    const r = [pt.INSTANCE];
+    const r = [ht.INSTANCE];
     if (t && t.length > 0) {
-      const n = new yt(t);
+      const n = new gt(t);
       r.push(n);
     }
     return r.push(e), new Ds(r);
@@ -3382,7 +3395,7 @@ class Ys {
         return this.handleAliasValue(r, t);
       if (Se.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      throw we(t) ? new Error(
+      throw Be(t) ? new Error(
         `URL '${t}' detected. Use the async version of this method to fetch the content.`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -3402,17 +3415,17 @@ class Ys {
         return this.handleAliasValue(r, t);
       if (Se.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      if (we(t) && this.urlContentFetcher)
+      if (Be(t) && this.urlContentFetcher)
         try {
           const n = await this.fetchFromUrl(t);
-          return n && r.setBlue(new a().setItems(n)), r;
+          return n && r.setBlue(new c().setItems(n)), r;
         } catch (n) {
           throw n instanceof Error ? new Error(
             `Failed to fetch from URL '${t}'.
 ${n.message}`
           ) : n;
         }
-      else throw we(t) ? new Error(
+      else throw Be(t) ? new Error(
         `UrlContentFetcher not provided for URL: ${t}`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -3435,7 +3448,7 @@ ${n.message}`
    */
   handleAliasValue(e, t) {
     return e.setBlue(
-      new a().setBlueId(this.preprocessingAliases.get(t))
+      new c().setBlueId(this.preprocessingAliases.get(t))
     ), e;
   }
   /**
@@ -3445,7 +3458,7 @@ ${n.message}`
    * @returns The modified node
    */
   handleBlueId(e, t) {
-    return e.setBlue(new a().setBlueId(t)), e;
+    return e.setBlue(new c().setBlueId(t)), e;
   }
   /**
    * Fetches content from a URL
@@ -3515,7 +3528,7 @@ class Gs {
     this.fetchStrategy = e || zs;
   }
   validateUrl(e) {
-    if (!we(e))
+    if (!Be(e))
       throw new Error(`Invalid URL: ${e}`);
     return !0;
   }
@@ -3646,7 +3659,7 @@ class Js {
     return this.resolve(e, K);
   }
 }
-class Zs extends Js {
+class Ws extends Js {
   mergingProcessor;
   nodeProvider;
   /**
@@ -3655,7 +3668,7 @@ class Zs extends Js {
    * @param nodeProvider - The provider to use for resolving nodes
    */
   constructor(e, t) {
-    super(), this.mergingProcessor = e, this.nodeProvider = fe.wrap(t);
+    super(), this.mergingProcessor = e, this.nodeProvider = he.wrap(t);
   }
   /**
    * Merges a source node into a target node with the given limits
@@ -3665,6 +3678,13 @@ class Zs extends Js {
    * @returns A new BlueNode with the merged content
    */
   merge(e, t, r) {
+    return this.mergeWithContext(
+      e,
+      t,
+      this.createResolutionContext(r)
+    );
+  }
+  mergeWithContext(e, t, r) {
     if (p(t.getBlue()))
       throw new Error(
         'Document contains "blue" attribute. Preprocess document before merging.'
@@ -3672,13 +3692,10 @@ class Zs extends Js {
     let n = e;
     const i = t.getType();
     if (p(i)) {
-      const o = i.clone();
-      p(o.getBlueId()) && new ft(this.nodeProvider).extend(
-        o,
-        $e.withSinglePath("/")
-      );
-      const l = this.resolve(o, r), c = t.clone().setType(l);
-      return n = this.merge(n, o, r), this.mergeObject(n, c, r);
+      const o = this.resolveTypeNode(i, r), l = o.cloneShallow().setType(void 0);
+      n = this.mergeObject(n, l, r);
+      const a = t.cloneShallow().setType(o);
+      return this.mergeObject(n, a, r);
     }
     return this.mergeObject(n, t, r);
   }
@@ -3690,21 +3707,20 @@ class Zs extends Js {
    * @returns A new BlueNode with the merged content
    */
   mergeObject(e, t, r) {
-    let n = this.mergingProcessor.process(
-      e,
+    const n = e.cloneShallow();
+    let i = this.mergingProcessor.process(
+      n,
       t,
-      this.nodeProvider
+      r.nodeProvider
     );
-    const i = t.getItems();
-    p(i) && (n = this.mergeChildren(n, i, r));
-    const o = t.getProperties();
-    return p(o) && Object.entries(o).forEach(([l, c]) => {
-      r.shouldMergePathSegment(l, c) && (r.enterPathSegment(l, c), n = this.mergeProperty(n, l, c, r), r.exitPathSegment());
-    }), p(t.getBlueId()) && (n = n.clone().setBlueId(t.getBlueId())), this.mergingProcessor.postProcess && (n = this.mergingProcessor.postProcess(
-      n,
+    const o = t.getItems();
+    p(o) && (i = this.mergeChildren(i, o, r));
+    const l = t.getProperties();
+    return p(l) && (i = this.mergeProperties(i, l, r)), p(t.getBlueId()) && (i = i.cloneShallow().setBlueId(t.getBlueId())), this.mergingProcessor.postProcess && (i = this.mergingProcessor.postProcess(
+      i,
       t,
-      this.nodeProvider
-    )), n;
+      r.nodeProvider
+    )), i;
   }
   /**
    * Merges child items from source into target
@@ -3716,56 +3732,69 @@ class Zs extends Js {
   mergeChildren(e, t, r) {
     const n = e.getItems();
     if (I(n)) {
-      const o = t.filter(
-        (l, c) => r.shouldMergePathSegment(String(c), l)
-      ).map((l) => {
-        r.enterPathSegment(String(t.indexOf(l)), l);
-        const c = this.resolve(l, r);
-        return r.exitPathSegment(), c;
-      });
-      return e.clone().setItems(o);
+      const o = [];
+      for (let l = 0; l < t.length; l++) {
+        const a = t[l];
+        if (r.limits.shouldMergePathSegment(String(l), a)) {
+          this.enterPathSegment(r, String(l), a);
+          try {
+            const u = a.isResolved() && this.canReuseResolvedSubtree(r) ? a : this.resolveWithContext(a, r);
+            o.push(u);
+          } finally {
+            this.exitPathSegment(r);
+          }
+        }
+      }
+      return e.cloneShallow().setItems(o);
     } else if (t.length < n.length)
       throw new Error(
         `Subtype of element must not have more items (${n.length}) than the element itself (${t.length}).`
       );
     const i = [...n];
-    for (let o = 0; o < t.length; o++) {
-      if (!r.shouldMergePathSegment(String(o), t[o]))
-        continue;
-      if (r.enterPathSegment(String(o), t[o]), o >= i.length) {
-        i.push(t[o]), r.exitPathSegment();
-        continue;
+    for (let o = 0; o < t.length; o++)
+      if (r.limits.shouldMergePathSegment(String(o), t[o])) {
+        this.enterPathSegment(r, String(o), t[o]);
+        try {
+          if (o >= i.length) {
+            i.push(t[o]);
+            continue;
+          }
+          const l = T.calculateBlueIdSync(
+            t[o]
+          ), a = T.calculateBlueIdSync(
+            i[o]
+          );
+          if (l !== a)
+            throw new Error(
+              `Mismatched items at index ${o}: source item has blueId '${l}', but target item has blueId '${a}'.`
+            );
+        } finally {
+          this.exitPathSegment(r);
+        }
       }
-      const l = T.calculateBlueIdSync(
-        t[o]
-      ), c = T.calculateBlueIdSync(
-        i[o]
-      );
-      if (l !== c)
-        throw new Error(
-          `Mismatched items at index ${o}: source item has blueId '${l}', but target item has blueId '${c}'.`
-        );
-      r.exitPathSegment();
-    }
-    return e.clone().setItems(i);
+    return e.cloneShallow().setItems(i);
   }
   /**
-   * Merges a property from source into target
+   * Merges source properties into target using copy-on-write for properties map
    * @param target - The target node
-   * @param sourceKey - The property key
-   * @param sourceValue - The property value to merge
+   * @param sourceProperties - The properties to merge from source
    * @param limits - The limits to apply
-   * @returns A new BlueNode with the merged property
-   */
-  mergeProperty(e, t, r, n) {
-    const i = this.resolve(r, n), o = e.clone();
-    I(o.getProperties()) && o.setProperties({});
-    const l = o.getProperties()[t];
-    return l === void 0 ? o.getProperties()[t] = i : o.getProperties()[t] = this.mergeObject(
-      l,
-      i,
-      n
-    ), o;
+   * @returns A new BlueNode with merged properties
+   */
+  mergeProperties(e, t, r) {
+    const n = e.getProperties() ?? {};
+    let i = n, o = !1;
+    for (const [l, a] of Object.entries(t))
+      if (r.limits.shouldMergePathSegment(l, a)) {
+        this.enterPathSegment(r, l, a);
+        try {
+          const u = a.isResolved() && this.canReuseResolvedSubtree(r) ? a : this.resolveWithContext(a, r), y = i[l], d = y === void 0 ? u : this.mergeObject(y, u, r);
+          d !== y && (o || (i = { ...n }, o = !0), i[l] = d);
+        } finally {
+          this.exitPathSegment(r);
+        }
+      }
+    return o ? e.cloneShallow().setProperties(i) : e;
   }
   /**
    * Resolves a node by creating a new node and merging the source into it
@@ -3774,11 +3803,55 @@ class Zs extends Js {
    * @returns A ResolvedBlueNode containing the resolved content
    */
   resolve(e, t) {
-    const r = new a(), i = this.merge(r, e, t).clone().setName(e.getName()).setDescription(e.getDescription()).setBlueId(e.getBlueId());
-    return new pe(i);
+    return this.resolveWithContext(e, this.createResolutionContext(t));
+  }
+  resolveWithContext(e, t) {
+    const r = new c(), i = this.mergeWithContext(r, e, t).clone().setName(e.getName()).setDescription(e.getDescription()).setBlueId(e.getBlueId());
+    return new ne(i);
+  }
+  createResolutionContext(e) {
+    return {
+      limits: e,
+      nodeProvider: this.nodeProvider,
+      resolvedTypeCache: /* @__PURE__ */ new Map(),
+      pathStack: []
+    };
+  }
+  resolveTypeNode(e, t) {
+    const r = e.getBlueId();
+    if (p(r)) {
+      const n = this.createResolvedTypeCacheKey(r, t), i = t.resolvedTypeCache.get(n);
+      if (p(i))
+        return i;
+      const o = this.resolveAndExtendTypeNode(e, t);
+      return t.resolvedTypeCache.set(n, o), o;
+    }
+    return this.resolveAndExtendTypeNode(e, t);
+  }
+  resolveAndExtendTypeNode(e, t) {
+    const r = e.clone();
+    return p(r.getBlueId()) && new ft(t.nodeProvider).extend(
+      r,
+      $e.withSinglePath("/")
+    ), this.resolveWithContext(r, t);
+  }
+  createResolvedTypeCacheKey(e, t) {
+    return t.limits instanceof Xe ? e : `${e}|${this.getCurrentPointer(t)}`;
+  }
+  canReuseResolvedSubtree(e) {
+    return e.limits instanceof Xe;
+  }
+  getCurrentPointer(e) {
+    return e.pathStack.length === 0 ? "/" : `/${e.pathStack.join("/")}`;
+  }
+  enterPathSegment(e, t, r) {
+    e.pathStack.push(t), e.limits.enterPathSegment(t, r);
+  }
+  exitPathSegment(e) {
+    e.pathStack.pop(), e.limits.exitPathSegment();
   }
 }
-class er {
+class tr {
   mergingProcessors;
   /**
    * Creates a new SequentialMergingProcessor with the given processors
@@ -3803,14 +3876,14 @@ class er {
     return this.mergingProcessors.reduce((n, i) => i.postProcess ? i.postProcess(n, t, r) : n, e);
   }
 }
-class tr {
+class rr {
   process(e, t) {
     const r = t.getValue();
     if (p(r)) {
       const n = e.getValue();
       if (I(n))
-        return e.clone().setValue(r);
-      if (!Hs(r, n))
+        return e.cloneShallow().setValue(r);
+      if (!Zs(r, n))
         throw new Error(
           `Node values conflict. Source node value: ${r}, target node value: ${n}`
         );
@@ -3818,74 +3891,74 @@ class tr {
     return e;
   }
 }
-const Hs = (s, e) => H(s) && H(e) || Ge(s) && Ge(e) ? s.eq(e) : s === e;
-class rr {
+const Zs = (s, e) => Z(s) && Z(e) || Ge(s) && Ge(e) ? s.eq(e) : s === e;
+class sr {
   process(e, t, r) {
     const n = e.getType(), i = t.getType();
     let o = e;
     if (n === void 0)
-      o = e.clone().setType(i);
+      o = e.cloneShallow().setType(i);
     else if (i !== void 0) {
-      if (!b(
+      if (!w(
         i,
         n,
         r
       )) {
-        const c = m.get(i), u = m.get(n);
+        const a = m.get(i), u = m.get(n);
         throw new Error(
           `The source type '${JSON.stringify(
-            c
+            a
           )}' is not a subtype of the target type '${JSON.stringify(
             u
           )}'.`
         );
       }
-      o = e.clone().setType(i);
+      o = e.cloneShallow().setType(i);
     }
     return o;
   }
 }
-class sr {
+class nr {
   process(e, t, r) {
     const n = t.getItemType(), i = t.getType();
-    if (n !== void 0 && i !== void 0 && !Gt(i, r))
+    if (n !== void 0 && i !== void 0 && !Jt(i, r))
       throw new Error("Source node with itemType must have a List type");
     const o = e.getItemType();
     let l = e;
     if (o === void 0)
-      n !== void 0 && (l = e.clone().setItemType(n));
+      n !== void 0 && (l = e.cloneShallow().setItemType(n));
     else if (n !== void 0) {
-      if (!b(
+      if (!w(
         n,
         o,
         r
       )) {
-        const d = m.get(n), h = m.get(o);
+        const d = m.get(n), f = m.get(o);
         throw new Error(
           `The source item type '${JSON.stringify(
             d
           )}' is not a subtype of the target item type '${JSON.stringify(
-            h
+            f
           )}'.`
         );
       }
-      l = e.clone().setItemType(n);
+      l = e.cloneShallow().setItemType(n);
     }
-    const c = l.getItemType(), u = t.getItems();
-    if (c !== void 0 && u !== void 0)
+    const a = l.getItemType(), u = t.getItems();
+    if (a !== void 0 && u !== void 0)
       for (const y of u) {
         const d = y.getType();
-        if (d !== void 0 && !b(
+        if (d !== void 0 && !w(
           d,
-          c,
+          a,
           r
         )) {
-          const h = m.get(d), v = m.get(
-            c
+          const f = m.get(d), v = m.get(
+            a
           );
           throw new Error(
             `Item of type '${JSON.stringify(
-              h
+              f
             )}' is not a subtype of the list's item type '${JSON.stringify(
               v
             )}'.`
@@ -3895,41 +3968,41 @@ class sr {
     return l;
   }
 }
-class nr {
+class ir {
   process(e, t, r) {
     const n = t.getKeyType(), i = t.getValueType(), o = t.getType();
-    if ((n !== void 0 || i !== void 0) && o !== void 0 && !Jt(o, r))
+    if ((n !== void 0 || i !== void 0) && o !== void 0 && !Wt(o, r))
       throw new Error(
         "Source node with keyType or valueType must have a Dictionary type"
       );
     let l = this.processKeyType(e, t, r);
     l = this.processValueType(l, t, r);
-    const c = l.getKeyType(), u = l.getValueType(), y = t.getProperties();
-    return (c !== void 0 || u !== void 0) && y !== void 0 && Object.entries(y).forEach(([d, h]) => {
-      c !== void 0 && this.validateKeyType(d, c, r), u !== void 0 && this.validateValueType(h, u, r);
+    const a = l.getKeyType(), u = l.getValueType(), y = t.getProperties();
+    return (a !== void 0 || u !== void 0) && y !== void 0 && Object.entries(y).forEach(([d, f]) => {
+      a !== void 0 && this.validateKeyType(d, a, r), u !== void 0 && this.validateValueType(f, u, r);
     }), l;
   }
   processKeyType(e, t, r) {
     const n = e.getKeyType(), i = t.getKeyType();
     if (n === void 0) {
       if (i !== void 0)
-        return this.validateBasicKeyType(i, r), e.clone().setKeyType(i);
+        return this.validateBasicKeyType(i, r), e.cloneShallow().setKeyType(i);
     } else if (i !== void 0) {
-      if (this.validateBasicKeyType(i, r), !b(
+      if (this.validateBasicKeyType(i, r), !w(
         i,
         n,
         r
       )) {
-        const l = m.get(i), c = m.get(n);
+        const l = m.get(i), a = m.get(n);
         throw new Error(
           `The source key type '${JSON.stringify(
             l
           )}' is not a subtype of the target key type '${JSON.stringify(
-            c
+            a
           )}'.`
         );
       }
-      return e.clone().setKeyType(i);
+      return e.cloneShallow().setKeyType(i);
     }
     return e;
   }
@@ -3937,41 +4010,41 @@ class nr {
     const n = e.getValueType(), i = t.getValueType();
     if (n === void 0) {
       if (i !== void 0)
-        return e.clone().setValueType(i);
+        return e.cloneShallow().setValueType(i);
     } else if (i !== void 0) {
-      if (!b(
+      if (!w(
         i,
         n,
         r
       )) {
-        const l = m.get(i), c = m.get(n);
+        const l = m.get(i), a = m.get(n);
         throw new Error(
           `The source value type '${JSON.stringify(
             l
           )}' is not a subtype of the target value type '${JSON.stringify(
-            c
+            a
           )}'.`
         );
       }
-      return e.clone().setValueType(i);
+      return e.cloneShallow().setValueType(i);
     }
     return e;
   }
   validateBasicKeyType(e, t) {
-    if (!ss(e, t))
+    if (!ns(e, t))
       throw new Error("Dictionary key type must be a basic type");
   }
   validateKeyType(e, t, r) {
-    if (!ns(t, r))
-      if (is(t, r)) {
+    if (!is(t, r))
+      if (os(t, r)) {
         const n = Number.parseInt(e, 10);
         if (Number.isNaN(n) || n.toString() !== e)
           throw new Error(`Key '${e}' is not a valid Integer.`);
-      } else if (os(t, r)) {
+      } else if (ls(t, r)) {
         const n = Number.parseFloat(e);
         if (Number.isNaN(n))
           throw new Error(`Key '${e}' is not a valid Number.`);
-      } else if (ls(t, r)) {
+      } else if (as(t, r)) {
         if (e.toLowerCase() !== "true" && e.toLowerCase() !== "false")
           throw new Error(`Key '${e}' is not a valid Boolean.`);
       } else
@@ -3981,7 +4054,7 @@ class nr {
   }
   validateValueType(e, t, r) {
     const n = e.getType();
-    if (n !== void 0 && !b(n, t, r)) {
+    if (n !== void 0 && !w(n, t, r)) {
       const i = m.get(n), o = m.get(t);
       throw new Error(
         `Value of type '${JSON.stringify(
@@ -3993,7 +4066,7 @@ class nr {
     }
   }
 }
-class ir {
+class or {
   process(e) {
     return e;
   }
@@ -4002,45 +4075,45 @@ class ir {
     if (n !== void 0 && cs(n, r)) {
       const i = e.getItems(), o = e.getProperties();
       if (i !== void 0 && i.length > 0 || o !== void 0 && Object.keys(o).length > 0) {
-        const l = as(
+        const l = us(
           n,
           r
-        ), c = n.getName() || "unknown";
+        ), a = n.getName() || "unknown";
         throw new Error(
-          `Node of type "${c}" (which extends basic type "${l}") must not have items, properties or contracts.`
+          `Node of type "${a}" (which extends basic type "${l}") must not have items, properties or contracts.`
         );
       }
     }
     return e;
   }
 }
-class or {
+class lr {
   process(e, t) {
     let r = e;
     const n = t.getName(), i = e.getName();
-    n !== void 0 && i === void 0 && (r = r.clone().setName(n));
+    n !== void 0 && i === void 0 && (r = r.cloneShallow().setName(n));
     const o = t.getDescription(), l = r.getDescription();
-    return o !== void 0 && l === void 0 && (r = r.clone().setDescription(o)), r;
+    return o !== void 0 && l === void 0 && (r = r.cloneShallow().setDescription(o)), r;
   }
 }
 const ti = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BasicTypesVerifier: ir,
-  DictionaryProcessor: nr,
-  ListProcessor: sr,
-  MetadataPropagator: or,
-  SequentialMergingProcessor: er,
-  TypeAssigner: rr,
-  ValuePropagator: tr
+  BasicTypesVerifier: or,
+  DictionaryProcessor: ir,
+  ListProcessor: nr,
+  MetadataPropagator: lr,
+  SequentialMergingProcessor: tr,
+  TypeAssigner: sr,
+  ValuePropagator: rr
 }, Symbol.toStringTag, { value: "Module" }));
-function Ws() {
-  return new er([
-    new tr(),
+function Hs() {
+  return new tr([
     new rr(),
     new sr(),
     new nr(),
-    new or(),
-    new ir()
+    new ir(),
+    new lr(),
+    new or()
   ]);
 }
 class Xs {
@@ -4060,7 +4133,7 @@ class Xs {
    * Returns a new BlueNode where all type references are restored to inline values when possible.
    */
   restore(e) {
-    return w.transform(
+    return B.transform(
       e,
       (t) => this.restoreNode(t)
     );
@@ -4094,7 +4167,7 @@ class Xs {
     const o = this.resolveInlineValue(i, n);
     if (!o)
       return;
-    const l = new a().setValue(o).setInlineValue(!0);
+    const l = new c().setValue(o).setInlineValue(!0);
     r(l);
   }
   resolveInlineValue(e, t) {
@@ -4222,7 +4295,7 @@ function sn(s, e, t) {
       r,
       t.name
     );
-    if (s.types[r] = i, s.typePackageByCurrentBlueId[r] = t.name, s.typeAliasByCurrentBlueId[r] = `${t.name}/${n.name}`, i.status === le && !s.toCurrentBlueIdIndex[r] && (s.toCurrentBlueIdIndex[r] = r), i.status === le)
+    if (s.types[r] = i, s.typePackageByCurrentBlueId[r] = t.name, s.typeAliasByCurrentBlueId[r] = `${t.name}/${n.name}`, i.status === ae && !s.toCurrentBlueIdIndex[r] && (s.toCurrentBlueIdIndex[r] = r), i.status === ae)
       for (const o of i.versions) {
         const l = s.toCurrentBlueIdIndex[o.typeBlueId];
         if (l && l !== r)
@@ -4242,8 +4315,8 @@ function on(s, e) {
   s.schemas.push(...Object.values(e.schemas));
 }
 function ln(s, e, t, r) {
-  if (s.status === tt)
-    return cn(s, e, t, r), {
+  if (s.status === rt)
+    return an(s, e, t, r), {
       ...s,
       versions: s.versions ? [...s.versions] : s.versions
     };
@@ -4266,7 +4339,7 @@ function ln(s, e, t, r) {
       );
     i.add(o.repositoryVersionIndex);
     for (const l of o.attributesAdded ?? [])
-      an(
+      cn(
         l,
         e.name,
         t,
@@ -4277,8 +4350,8 @@ function ln(s, e, t, r) {
     versions: n
   };
 }
-function cn(s, e, t, r) {
-  if (s.status === tt) {
+function an(s, e, t, r) {
+  if (s.status === rt) {
     if (s.versions && s.versions.length > 1)
       throw new Error(
         `Dev type ${r}/${s.name} (${t}) must not declare multiple versions`
@@ -4292,9 +4365,9 @@ function cn(s, e, t, r) {
     }
   }
 }
-function an(s, e, t, r) {
+function cn(s, e, t, r) {
   try {
-    Tr(s);
+    vr(s);
   } catch (n) {
     const i = n instanceof Error ? n.message : "Unknown error";
     throw new Error(
@@ -4343,22 +4416,22 @@ const D = {
   REPO_UNREPRESENTABLE_IN_TARGET_VERSION: "REPO_UNREPRESENTABLE_IN_TARGET_VERSION",
   INVALID_BLUE_CONTEXT_REPOSITORIES: "INVALID_BLUE_CONTEXT_REPOSITORIES",
   INVALID_REPOSITORY_POINTER: "INVALID_REPOSITORY_POINTER"
-}, fn = /* @__PURE__ */ new Set([
+}, hn = /* @__PURE__ */ new Set([
   "__proto__",
   "constructor",
   "prototype"
 ]);
-function bt(s) {
+function Bt(s) {
   const e = s.at(0), t = s.at(-1);
   return !e || !t ? s : e === "'" && t === "'" || e === '"' && t === '"' ? s.slice(1, -1) : s;
 }
-function hn(s, e) {
+function fn(s, e) {
   const t = s.indexOf("=");
   if (t === -1)
     throw re(e, `Missing '=' in segment '${s.trim()}'`);
   if (s.indexOf("=", t + 1) !== -1)
     throw re(e, `Unexpected '=' in segment '${s.trim()}'`);
-  const r = bt(s.slice(0, t).trim()), n = bt(s.slice(t + 1).trim());
+  const r = Bt(s.slice(0, t).trim()), n = Bt(s.slice(t + 1).trim());
   if (!r)
     throw re(e, "Repository name is empty");
   if (!n)
@@ -4373,7 +4446,7 @@ function yn(s) {
     const r = t.trim();
     if (!r)
       throw re(s, "Empty repository segment");
-    const { name: n, value: i } = hn(r, s);
+    const { name: n, value: i } = fn(r, s);
     mn(n, s), e[n] = i;
   }
   return e;
@@ -4399,23 +4472,23 @@ function re(s, e) {
   );
 }
 function mn(s, e) {
-  if (fn.has(s))
+  if (hn.has(s))
     throw re(e, `Forbidden repository name '${s}'`);
 }
 function In(s, e) {
   const t = s.filter((n) => n.repositoryVersionIndex > e).sort((n, i) => i.repositoryVersionIndex - n.repositoryVersionIndex), r = [];
   for (const n of t) {
     const i = [...n.attributesAdded].sort(
-      (o, l) => wt(l) - wt(o)
+      (o, l) => Et(l) - Et(o)
     );
     r.push(...i);
   }
   return r;
 }
-function wt(s) {
-  return Rt(s).length;
+function Et(s) {
+  return Ot(s).length;
 }
-const Tn = /* @__PURE__ */ new Set([...rt]), B = {
+const Tn = /* @__PURE__ */ new Set([...st]), b = {
   core: "core",
   noRuntime: "no-runtime",
   noTargetContext: "no-target-context",
@@ -4431,7 +4504,7 @@ class vn {
     this.registry = e.registry, this.targetRepoVersionIndexes = e.targetRepoVersionIndexes, this.fallbackToCurrentInlineDefinitions = e.fallbackToCurrentInlineDefinitions;
   }
   transform(e) {
-    return w.transform(
+    return B.transform(
       e,
       (t) => this.transformNode(t)
     );
@@ -4461,11 +4534,11 @@ class vn {
       return;
     const i = this.resolveType(n);
     switch (i.kind) {
-      case B.core: {
+      case b.core: {
         r.setBlueId(i.blueId);
         return;
       }
-      case B.representable: {
+      case b.representable: {
         this.applyDropPointers([r], i.dropPointers, {
           rootIsSchema: !0
         }), this.applyDropPointers(
@@ -4474,34 +4547,34 @@ class vn {
         ), r.setBlueId(i.targetBlueId);
         return;
       }
-      case B.noRuntime:
-      case B.noTargetContext:
-      case B.unrepresentable: {
+      case b.noRuntime:
+      case b.noTargetContext:
+      case b.unrepresentable: {
         if (this.fallbackToCurrentInlineDefinitions) {
           this.inlineDefinition(e, t.setter, n);
           return;
         }
-        throw i.kind === B.unrepresentable ? i.error : this.unrepresentableError(
+        throw i.kind === b.unrepresentable ? i.error : this.unrepresentableError(
           n,
-          i.kind === B.noTargetContext ? `Repository '${i.runtimeName}' not provided in BlueContext.` : "Type does not belong to any declared repository.",
-          i.kind === B.noTargetContext ? i.runtime : void 0,
-          i.kind === B.noTargetContext ? i.meta : void 0,
+          i.kind === b.noTargetContext ? `Repository '${i.runtimeName}' not provided in BlueContext.` : "Type does not belong to any declared repository.",
+          i.kind === b.noTargetContext ? i.runtime : void 0,
+          i.kind === b.noTargetContext ? i.meta : void 0,
           void 0,
-          i.kind === B.noTargetContext ? i.typeAlias : void 0
+          i.kind === b.noTargetContext ? i.typeAlias : void 0
         );
       }
     }
   }
   resolveType(e) {
     if (X.includes(e))
-      return { kind: B.core, blueId: e };
+      return { kind: b.core, blueId: e };
     const t = this.registry.toCurrentBlueId(e), r = this.registry.getTypeAlias(t), n = this.registry.findRuntimeByBlueId(t);
     if (!n || !n.typeMeta)
-      return { kind: B.noRuntime };
+      return { kind: b.noRuntime };
     const i = this.targetRepoVersionIndexes[n.runtime.name];
     if (i === void 0)
       return {
-        kind: B.noTargetContext,
+        kind: b.noTargetContext,
         currentBlueId: t,
         runtimeName: n.runtime.name,
         runtime: n.runtime,
@@ -4509,11 +4582,11 @@ class vn {
         typeAlias: r
       };
     const o = n.typeMeta;
-    if (o.status === tt) {
+    if (o.status === rt) {
       const d = n.runtime.repositoryVersions.length - 1;
       if (i !== d)
         return {
-          kind: B.unrepresentable,
+          kind: b.unrepresentable,
           currentBlueId: t,
           error: this.unrepresentableError(
             t,
@@ -4524,18 +4597,18 @@ class vn {
             r
           )
         };
-      const h = o.versions?.[0];
+      const f = o.versions?.[0];
       return {
-        kind: B.representable,
+        kind: b.representable,
         currentBlueId: t,
-        targetBlueId: h?.typeBlueId ?? t,
+        targetBlueId: f?.typeBlueId ?? t,
         dropPointers: []
       };
     }
     const l = o.versions || [];
     if (l.length === 0)
       return {
-        kind: B.unrepresentable,
+        kind: b.unrepresentable,
         currentBlueId: t,
         error: this.unrepresentableError(
           t,
@@ -4546,10 +4619,10 @@ class vn {
           r
         )
       };
-    const c = l[0].repositoryVersionIndex;
-    if (i < c)
+    const a = l[0].repositoryVersionIndex;
+    if (i < a)
       return {
-        kind: B.unrepresentable,
+        kind: b.unrepresentable,
         currentBlueId: t,
         error: this.unrepresentableError(
           t,
@@ -4563,16 +4636,16 @@ class vn {
     let u = l[0].typeBlueId;
     for (const d of l)
       d.repositoryVersionIndex <= i && (u = d.typeBlueId);
-    const y = o.status === le ? this.getDropPointers(o, i) : [];
+    const y = o.status === ae ? this.getDropPointers(o, i) : [];
     return {
-      kind: B.representable,
+      kind: b.representable,
       currentBlueId: t,
       targetBlueId: u,
       dropPointers: y
     };
   }
   getDropPointers(e, t) {
-    return e.status !== le ? [] : In(e.versions, t);
+    return e.status !== ae ? [] : In(e.versions, t);
   }
   applyDropPointers(e, t, r = {}) {
     if (e.length === 0 || t.length === 0)
@@ -4585,13 +4658,13 @@ class vn {
   getDictionaryValueTargets(e) {
     const t = e.getProperties();
     return t ? Object.entries(t).filter(
-      ([r, n]) => n instanceof a && !Tn.has(r)
+      ([r, n]) => n instanceof c && !Tn.has(r)
     ).map(([, r]) => r) : [];
   }
   deletePropertyAtPointer(e, t, r) {
     let n;
     try {
-      n = Rt(t);
+      n = Ot(t);
     } catch {
       throw this.invalidPointerError(t);
     }
@@ -4601,24 +4674,24 @@ class vn {
     if (t.length === 0)
       return;
     const [n, ...i] = t;
-    if (n === Z) {
-      const c = e.getType();
-      c && this.applyPointerSegments(c, i, !0);
+    if (n === W) {
+      const a = e.getType();
+      a && this.applyPointerSegments(a, i, !0);
       return;
     }
-    if (n === he) {
-      const c = e.getItemType();
-      c && this.applyPointerSegments(c, i, !0);
+    if (n === fe) {
+      const a = e.getItemType();
+      a && this.applyPointerSegments(a, i, !0);
       return;
     }
     if (n === ye) {
-      const c = e.getKeyType();
-      c && this.applyPointerSegments(c, i, !0);
+      const a = e.getKeyType();
+      a && this.applyPointerSegments(a, i, !0);
       return;
     }
     if (n === ge) {
-      const c = e.getValueType();
-      c && this.applyPointerSegments(c, i, !0);
+      const a = e.getValueType();
+      a && this.applyPointerSegments(a, i, !0);
       return;
     }
     const o = e.getProperties();
@@ -4627,12 +4700,12 @@ class vn {
     if (i.length === 0) {
       if (!r || !(n in o))
         return;
-      const c = { ...o };
-      delete c[n], e.setProperties(c);
+      const a = { ...o };
+      delete a[n], e.setProperties(a);
       return;
     }
     const l = o[n];
-    l instanceof a && this.applyPointerSegments(l, i, r);
+    l instanceof c && this.applyPointerSegments(l, i, r);
   }
   inlineDefinition(e, t, r) {
     const n = this.registry.toCurrentBlueId(r);
@@ -4658,9 +4731,9 @@ class vn {
     try {
       const o = g.deserialize(i);
       o.setBlueId(void 0);
-      const l = w.transform(
+      const l = B.transform(
         o,
-        (c) => this.transformNode(c)
+        (a) => this.transformNode(a)
       );
       return t(l), e;
     } finally {
@@ -4679,21 +4752,21 @@ class vn {
     ]);
   }
   unrepresentableError(e, t, r, n, i, o, l) {
-    const c = {
+    const a = {
       currentTypeBlueId: e,
       targetRepoVersionIndex: i,
       typeAlias: o,
       ...l
     };
-    if (r && (i !== void 0 && (c.requestedRepoBlueId = r.repositoryVersions[i]), c.serverRepoBlueId = r.currentRepoBlueId), n && n.status === le) {
+    if (r && (i !== void 0 && (a.requestedRepoBlueId = r.repositoryVersions[i]), a.serverRepoBlueId = r.currentRepoBlueId), n && n.status === ae) {
       const y = n.versions?.[0]?.repositoryVersionIndex;
-      y !== void 0 && (c.typeIntroducedInRepoBlueId = r?.repositoryVersions[y]);
+      y !== void 0 && (a.typeIntroducedInRepoBlueId = r?.repositoryVersions[y]);
     }
     const u = {
       code: D.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
       message: t,
-      locationPath: [Z],
-      context: c
+      locationPath: [W],
+      context: a
     };
     return new Re(
       D.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
@@ -4702,8 +4775,8 @@ class vn {
     );
   }
 }
-function Xe(s, e) {
-  return e ? w.transform(s, (t) => (ve(
+function qe(s, e) {
+  return e ? B.transform(s, (t) => (ve(
     () => t.getType(),
     (r) => t.setType(r),
     e
@@ -4731,7 +4804,7 @@ function ve(s, e, t) {
   const i = t.toCurrentBlueId(n);
   i !== n && e(r.clone().setBlueId(i));
 }
-class Bn {
+class bn {
   registry;
   blueIdMapper;
   constructor(e) {
@@ -4741,7 +4814,7 @@ class Bn {
     const r = this.computeTargetRepoVersionIndexes(t);
     if (Object.keys(r).length === 0)
       return e;
-    const n = Xe(e, this.blueIdMapper);
+    const n = qe(e, this.blueIdMapper);
     return new vn({
       registry: this.registry,
       targetRepoVersionIndexes: r,
@@ -4803,24 +4876,24 @@ class ri {
       repositories: i,
       mergingProcessor: o
     } = e;
-    this.repositories = i, this.repositoryRegistry = new qs(i ?? []), this.blueContextResolver = new Bn({
+    this.repositories = i, this.repositoryRegistry = new qs(i ?? []), this.blueContextResolver = new bn({
       registry: this.repositoryRegistry,
       blueIdMapper: this.repositoryRegistry
     });
     const l = Ps(() => []);
-    this.nodeProvider = fe.wrap(
+    this.nodeProvider = he.wrap(
       t || l,
       i
-    ), this.typeSchemaResolver = r ?? new us([], {
+    ), this.typeSchemaResolver = r ?? new ds([], {
       nodeProvider: this.nodeProvider
-    }), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this.mergingProcessor = o ?? Ws(), this.urlContentFetcher = new Gs(n), this.blueDirectivePreprocessor = new Ys(
+    }), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this.mergingProcessor = o ?? Hs(), this.urlContentFetcher = new Gs(n), this.blueDirectivePreprocessor = new Ys(
       void 0,
       this.urlContentFetcher
-    ), this.blueIdsMappingGenerator = new ht(), this.blueIdsMappingGenerator.registerBlueIds(
+    ), this.blueIdsMappingGenerator = new yt(), this.blueIdsMappingGenerator.registerBlueIds(
       this.repositoryRegistry.getAliases()
     );
-    const c = this.repositoryRegistry.getRuntimes().flatMap((u) => u.schemas);
-    c.length > 0 && this.typeSchemaResolver?.registerSchemas(c);
+    const a = this.repositoryRegistry.getRuntimes().flatMap((u) => u.schemas);
+    a.length > 0 && this.typeSchemaResolver?.registerSchemas(a);
   }
   /**
    * Converts a BlueNode to a JSON representation based on the specified strategy.
@@ -4846,7 +4919,7 @@ class ri {
   }
   resolve(e, t = K) {
     const r = this.combineWithGlobalLimits(t);
-    return new Zs(this.mergingProcessor, this.nodeProvider).resolve(e, r);
+    return new Ws(this.mergingProcessor, this.nodeProvider).resolve(e, r);
   }
   /**
    * Wraps an already resolved (merged) BlueNode in a ResolvedBlueNode.
@@ -4857,7 +4930,7 @@ class ri {
    * @returns A new ResolvedBlueNode instance.
    */
   createResolvedNode(e) {
-    return e instanceof pe ? e : new pe(e);
+    return e instanceof ne ? e : new ne(e);
   }
   reverse(e) {
     return new Ht().reverse(e);
@@ -4881,13 +4954,13 @@ class ri {
   }
   jsonValueToNode(e) {
     const t = this.preprocess(g.deserialize(e));
-    return Xe(t, this.repositoryRegistry);
+    return qe(t, this.repositoryRegistry);
   }
   async jsonValueToNodeAsync(e) {
     const t = await this.preprocessAsync(
       g.deserialize(e)
     );
-    return Xe(t, this.repositoryRegistry);
+    return qe(t, this.repositoryRegistry);
   }
   yamlToNode(e) {
     const t = $(e);
@@ -4901,14 +4974,14 @@ class ri {
       throw new Error("Failed to parse YAML to JSON");
     return this.jsonValueToNodeAsync(t);
   }
-  prepareForBlueIdCalculation = async (e) => e instanceof a || Array.isArray(e) && e.every((t) => t instanceof a) ? e : Array.isArray(e) ? await Promise.all(
+  prepareForBlueIdCalculation = async (e) => e instanceof c || Array.isArray(e) && e.every((t) => t instanceof c) ? e : Array.isArray(e) ? await Promise.all(
     e.map((r) => this.jsonValueToNodeAsync(r))
   ) : this.jsonValueToNodeAsync(e);
   calculateBlueId = async (e) => {
     const t = await this.prepareForBlueIdCalculation(e);
     return T.calculateBlueId(t);
   };
-  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);
+  prepareForBlueIdCalculationSync = (e) => e instanceof c || Array.isArray(e) && e.every((t) => t instanceof c) ? e : Array.isArray(e) ? e.map((t) => this.jsonValueToNode(t)) : this.jsonValueToNode(e);
   calculateBlueIdSync(e) {
     const t = this.prepareForBlueIdCalculationSync(e);
     return T.calculateBlueIdSync(t);
@@ -4918,26 +4991,26 @@ class ri {
   }
   preprocess(e) {
     const t = this.blueDirectivePreprocessor.process(e);
-    return new ne({
+    return new ie({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).preprocessWithDefaultBlue(t);
   }
   async preprocessAsync(e) {
     const t = await this.blueDirectivePreprocessor.processAsync(e);
-    return new ne({
+    return new ie({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).preprocessWithDefaultBlue(t);
   }
   transform(e, t) {
-    return w.transform(e, t);
+    return B.transform(e, t);
   }
   getNodeProvider() {
     return this.nodeProvider;
   }
   setNodeProvider(e) {
-    return this.nodeProvider = fe.wrap(
+    return this.nodeProvider = he.wrap(
       e,
       this.repositories
     ), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this;
@@ -5061,7 +5134,7 @@ class ri {
    * @returns true if the node matches the schema type, false otherwise
    */
   isTypeOf(e, t, r) {
-    return V.isTypeOf(e, t, {
+    return A.isTypeOf(e, t, {
       checkSchemaExtensions: r?.checkSchemaExtensions,
       typeSchemaResolver: this.typeSchemaResolver
     });
@@ -5080,8 +5153,8 @@ class ri {
     const n = e.getType();
     if (!n)
       return !1;
-    const i = new a().setBlueId(r);
-    return b(n, i, this.nodeProvider);
+    const i = new c().setBlueId(r);
+    return w(n, i, this.nodeProvider);
   }
   /**
    * Checks if a BlueNode matches a BlueNode type.
@@ -5121,17 +5194,17 @@ class ri {
     return this.globalLimits == K ? e : e == K ? this.globalLimits : _e.of(this.globalLimits, e);
   }
 }
-class si extends qt {
+class si extends Qt {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   preprocessor;
   constructor(e = []) {
     super();
-    const t = new ne({ nodeProvider: this });
+    const t = new ie({ nodeProvider: this });
     this.preprocessor = (r) => t.preprocessWithDefaultBlue(r), e.forEach((r) => this.processNode(r));
   }
   processNode(e) {
-    ut.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
+    dt.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
   }
   processSingleNode(e) {
     const t = z.parseAndCalculateBlueIdForNode(
@@ -5248,22 +5321,22 @@ class si extends qt {
   }
 }
 export {
-  Mr as Base58Sha256Provider,
+  xr as Base58Sha256Provider,
   si as BasicNodeProvider,
   ri as Blue,
   T as BlueIdCalculator,
   kn as BlueIdToCid,
-  a as BlueNode,
-  V as BlueNodeTypeSchema,
+  c as BlueNode,
+  A as BlueNodeTypeSchema,
   Je as JsonCanonicalizer,
-  dt as Limits,
-  Zs as Merger,
+  pt as Limits,
+  Ws as Merger,
   ti as MergingProcessors,
   Js as NodeResolver,
-  ut as Nodes,
+  dt as Nodes,
   On as Properties,
-  pe as ResolvedBlueNode,
-  us as TypeSchemaResolver,
+  ne as ResolvedBlueNode,
+  ds as TypeSchemaResolver,
   Kn as applyBlueNodePatch,
   Fe as baseBlueObjectSchema,
   Yn as blueDescriptionField,
@@ -5273,45 +5346,45 @@ export {
   Jn as blueNodeField,
   Fn as blueObjectBooleanValueSchema,
   xn as blueObjectNumberValueSchema,
-  ue as blueObjectSchema,
+  de as blueObjectSchema,
   $n as blueObjectStringListItemsSchema,
   Mn as blueObjectStringValueSchema,
-  js as calculateBlueId,
-  Hn as calculateBlueIdSync,
-  vt as enrichWithBlueId,
-  Jr as getBlueDescriptionAnnotation,
-  Wr as getBlueIdAnnotation,
-  qr as getBlueNameAnnotation,
-  es as getBlueNodeAnnotation,
-  Wn as getBlueObjectItems,
+  Ls as calculateBlueId,
+  Zn as calculateBlueIdSync,
+  bt as enrichWithBlueId,
+  Wr as getBlueDescriptionAnnotation,
+  Xr as getBlueIdAnnotation,
+  Qr as getBlueNameAnnotation,
+  ts as getBlueNodeAnnotation,
+  Hn as getBlueObjectItems,
   qn as getBlueObjectProperties,
   Qn as getBlueObjectTypeLabel,
   Xn as getBlueObjectValue,
-  rs as getTypeBlueIdAnnotation,
-  Er as hasBlueObjectBlueIdDefined,
-  Nr as hasBlueObjectItemsDefined,
-  Ln as hasBlueObjectNameDefined,
-  Pr as hasBlueObjectTypeDefined,
-  Sr as hasBlueObjectValueDefined,
+  ss as getTypeBlueIdAnnotation,
+  Nr as hasBlueObjectBlueIdDefined,
+  Pr as hasBlueObjectItemsDefined,
+  jn as hasBlueObjectNameDefined,
+  Sr as hasBlueObjectTypeDefined,
+  Cr as hasBlueObjectValueDefined,
   Ge as isBigDecimalNumber,
-  H as isBigIntegerNumber,
-  A as isBigNumber,
-  zt as isBlueNodeSchema,
+  Z as isBigIntegerNumber,
+  C as isBigNumber,
+  Gt as isBlueNodeSchema,
   _n as isBlueObject,
   Us as isBlueObjectResolved,
-  jn as isGivenBlueObjectTypeSchema,
+  Ln as isGivenBlueObjectTypeSchema,
   Lt as isJsonBlueArray,
-  _t as isJsonBlueObject,
+  jt as isJsonBlueObject,
   Un as isJsonBlueValue,
-  we as isUrl,
-  Ae as jsonBlueValueSchema,
+  Be as isUrl,
+  Ce as jsonBlueValueSchema,
   ei as normalizeToBlueObject,
-  Bt as resolveBlueObjectItems,
-  Gr as withBlueDescription,
+  wt as resolveBlueObjectItems,
+  Jr as withBlueDescription,
   Hr as withBlueId,
-  Xr as withBlueName,
-  Qr as withBlueNode,
-  Zn as withTypeBlueId,
+  qr as withBlueName,
+  es as withBlueNode,
+  Wn as withTypeBlueId,
   Rs as yamlBlueDump,
   $ as yamlBlueParse
 };