@blue-labs/language 3.4.3 → 3.5.0

package/dist/index.mjs

@@ -1,24 +1,24 @@
-import M from "big.js";
-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 D from "big.js";
+import { isNullable as m, isNonNullable as d, jsonPrimitiveSchema as cr, isReadonlyArray as Pe, isJsonPrimitive as et, isPreciseNumberString as Pt } from "@blue-labs/shared-utils";
+import { z as h, ZodOptional as Nt, ZodNullable as St, ZodReadonly as Ct, ZodBranded as At, ZodEffects as Ne, ZodLazy as Se, ZodString as ee, ZodNumber as te, ZodBoolean as Be, ZodBigInt as be, ZodEnum as ur, ZodNativeEnum as dr, ZodIntersection as pr, ZodUnion as hr, ZodObject as fr, ZodRecord as yr } from "zod";
 import ue from "bs58";
-import { isObject as Vt, isArray as 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 { isObject as Vt, isArray as tt, isString as rt, omit as Rt, pascal as gr, map as mr } from "radash";
+import { OBJECT_CONTRACTS as V, OBJECT_MERGE_POLICY as Ir, OBJECT_SCHEMA as Tr, BLUE_REPOSITORY_STATUS_STABLE as ae, BLUE_REPOSITORY_STATUS_DEV as st, validateAttributesAddedPointer as vr, parsePointer as Ot } from "@blue-labs/repository-contract";
+import { sha256 as Br } from "js-sha256";
+import Ue from "crypto";
+import br from "base32.js";
 import H from "js-yaml";
-class S extends M {
+class S extends D {
   constructor(e) {
     super(e);
   }
 }
-class E extends M {
+class E extends D {
   constructor(e) {
     super(e);
   }
 }
-const G = "name", J = "description", W = "type", fe = "itemType", ye = "keyType", ge = "valueType", me = "value", Oe = "items", x = "blueId", De = "blue", st = [
+const G = "name", J = "description", W = "type", fe = "itemType", ye = "keyType", ge = "valueType", me = "value", Me = "items", x = "blueId", De = "blue", nt = [
   G,
   J,
   W,
@@ -26,65 +26,65 @@ const G = "name", J = "description", W = "type", fe = "itemType", ye = "keyType"
   ye,
   ge,
   me,
-  Oe,
+  Me,
   x,
   De
-], Dt = "Text", Mt = "Double", xt = "Integer", Ft = "Boolean", $t = "List", _t = "Dictionary", Me = [
-  Dt,
+], Mt = "Text", Dt = "Double", xt = "Integer", Ft = "Boolean", $t = "List", _t = "Dictionary", xe = [
   Mt,
+  Dt,
   xt,
   Ft
-], nt = [...Me, $t, _t], _ = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", j = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", L = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", U = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", it = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", ot = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", lt = [
+], it = [...xe, $t, _t], _ = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", L = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", j = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", U = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", ot = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", lt = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", at = [
   _,
-  j,
   L,
+  j,
   U
 ], X = [
-  ...lt,
-  it,
-  ot
-], Br = Object.fromEntries(
-  nt.map((s, e) => [s, X[e]])
-), xe = Object.fromEntries(
-  X.map((s, e) => [s, nt[e]])
+  ...at,
+  ot,
+  lt
+], wr = Object.fromEntries(
+  it.map((s, e) => [s, X[e]])
+), Fe = Object.fromEntries(
+  X.map((s, e) => [s, it[e]])
 ), On = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BASIC_TYPES: Me,
-  BASIC_TYPE_BLUE_IDS: lt,
+  BASIC_TYPES: xe,
+  BASIC_TYPE_BLUE_IDS: at,
   BOOLEAN_TYPE: Ft,
   BOOLEAN_TYPE_BLUE_ID: U,
-  CORE_TYPES: nt,
+  CORE_TYPES: it,
   CORE_TYPE_BLUE_IDS: X,
-  CORE_TYPE_BLUE_ID_TO_NAME_MAP: xe,
-  CORE_TYPE_NAME_TO_BLUE_ID_MAP: Br,
+  CORE_TYPE_BLUE_ID_TO_NAME_MAP: Fe,
+  CORE_TYPE_NAME_TO_BLUE_ID_MAP: wr,
   DICTIONARY_TYPE: _t,
-  DICTIONARY_TYPE_BLUE_ID: ot,
-  DOUBLE_TYPE: Mt,
-  DOUBLE_TYPE_BLUE_ID: j,
+  DICTIONARY_TYPE_BLUE_ID: lt,
+  DOUBLE_TYPE: Dt,
+  DOUBLE_TYPE_BLUE_ID: L,
   INTEGER_TYPE: xt,
-  INTEGER_TYPE_BLUE_ID: L,
+  INTEGER_TYPE_BLUE_ID: j,
   LIST_TYPE: $t,
-  LIST_TYPE_BLUE_ID: it,
+  LIST_TYPE_BLUE_ID: ot,
   OBJECT_BLUE: De,
   OBJECT_BLUE_ID: x,
   OBJECT_CONTRACTS: V,
   OBJECT_DESCRIPTION: J,
-  OBJECT_ITEMS: Oe,
+  OBJECT_ITEMS: Me,
   OBJECT_ITEM_TYPE: fe,
   OBJECT_KEY_TYPE: ye,
   OBJECT_MERGE_POLICY: Ir,
   OBJECT_NAME: G,
   OBJECT_SCHEMA: Tr,
-  OBJECT_SPECIFIC_KEYS: st,
+  OBJECT_SPECIFIC_KEYS: nt,
   OBJECT_TYPE: W,
   OBJECT_VALUE: me,
   OBJECT_VALUE_TYPE: ge,
-  TEXT_TYPE: Dt,
+  TEXT_TYPE: Mt,
   TEXT_TYPE_BLUE_ID: _
 }, Symbol.toStringTag, { value: "Module" }));
 class Er {
   static get(e, t, r, n = !0) {
-    if (I(t) || !t.startsWith("/"))
+    if (m(t) || !t.startsWith("/"))
       throw new Error(`Invalid path: ${t}`);
     if (t === "/") {
       const o = e.getValue();
@@ -197,7 +197,7 @@ class Er {
   }
   static link(e, t) {
     const r = t(e);
-    return p(r) ? r : e;
+    return d(r) ? r : e;
   }
 }
 class c {
@@ -255,10 +255,10 @@ class c {
   }
   getValue() {
     const e = this.type?.getBlueId();
-    if (p(e) && p(this.value)) {
-      if (e === L && typeof this.value == "string")
+    if (d(e) && d(this.value)) {
+      if (e === j && typeof this.value == "string")
         return new E(this.value);
-      if (e === j && typeof this.value == "string") {
+      if (e === L && typeof this.value == "string") {
         const t = new S(this.value), r = parseFloat(t.toString());
         return new S(r.toString());
       } else if (e === U && typeof this.value == "string")
@@ -297,14 +297,14 @@ class c {
     return this.getContractsProperty()?.getProperties();
   }
   setContracts(e) {
-    return I(e) ? this.removeProperty(V) : this.addProperty(
+    return m(e) ? this.removeProperty(V) : this.addProperty(
       V,
       new c().setProperties(e)
     ), this;
   }
   addContract(e, t) {
     const r = this.getContractsProperty();
-    return I(r) ? this.addProperty(
+    return m(r) ? this.addProperty(
       V,
       new c().addProperty(e, t)
     ) : r.addProperty(e, t), this;
@@ -374,7 +374,7 @@ class c {
     return `BlueNode{name='${this.name}', description='${this.description}', type=${this.type}, itemType=${this.itemType}, keyType=${this.keyType}, valueType=${this.valueType}, value=${this.value}, items=${this.items}, properties=${this.properties}, blueId='${this.blueId}', blue=${this.blue}, inlineValue=${this.inlineValue}}`;
   }
 }
-class Se {
+class Ce {
   static MIN_BLUE_ID_LENGTH = 41;
   static MAX_BLUE_ID_LENGTH = 45;
   static BLUE_ID_PATTERN = /^[1-9A-HJ-NP-Za-km-z]{41,45}(?:#\d+)?$/;
@@ -400,9 +400,9 @@ class Se {
     return !0;
   }
 }
-const Dn = h.string().max(Se.MAX_BLUE_ID_LENGTH, {
+const Mn = h.string().max(Ce.MAX_BLUE_ID_LENGTH, {
   message: "Blue Id has a maximum length of 45 characters"
-}).min(Se.MIN_BLUE_ID_LENGTH, {
+}).min(Ce.MIN_BLUE_ID_LENGTH, {
   message: "Blue Id has a minimum length of 41 characters"
 }).refine(
   (s) => {
@@ -426,34 +426,34 @@ const Dn = h.string().max(Se.MAX_BLUE_ID_LENGTH, {
       items: h.array(de).optional()
     })
   )
-), Fe = h.object({
+), $e = h.object({
   blueId: h.string().optional(),
   name: h.string().optional(),
   description: h.string().optional(),
   type: de.optional()
-}), Mn = Fe.extend({
+}), Dn = $e.extend({
   value: h.string().optional()
-}), xn = Fe.extend({
+}), xn = $e.extend({
   value: h.number().optional()
-}), Fn = Fe.extend({
+}), Fn = $e.extend({
   value: h.boolean().optional()
-}), $n = Fe.extend({
+}), $n = $e.extend({
   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)
+}), _n = (s) => de.safeParse(s).success, Pr = (s) => d(s) && "blueId" in s && d(s.blueId), Ln = (s) => d(s) && "name" in s && d(s.name), Nr = (s) => d(s) && "items" in s && d(s.items), Sr = (s) => d(s) && "type" in s && d(s.type), Cr = (s) => d(s) && "value" in s && d(s.value), jn = (s, e) => s.required({ type: !0 }).safeParse(e).success, C = (s) => s instanceof D, Z = (s) => C(s) && s instanceof E, We = (s) => C(s) && s instanceof S, Ar = h.lazy(
+  () => h.record(Ae)
 ), Vr = h.lazy(
   () => h.union([
-    h.array(Ce),
-    h.array(Ce).readonly()
+    h.array(Ae),
+    h.array(Ae).readonly()
   ])
-), Ce = h.lazy(
+), Ae = h.lazy(
   () => h.union([
     cr,
     Ar,
     Vr,
-    h.instanceof(M)
+    h.instanceof(D)
   ])
-), 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);
+), Lt = (s) => Vt(s) && !tt(s) && !Pe(s) && !C(s), jt = (s) => tt(s) || Pe(s), Un = (s) => jt(s) || Lt(s) || C(s) || et(s);
 class g {
   static deserialize(e) {
     return g.handleNode(e);
@@ -463,7 +463,7 @@ class g {
       throw new Error(
         "This is not a valid JSON-like value. Found 'undefined' as a value."
       );
-    if (jt(e)) {
+    if (Lt(e)) {
       const t = new c(), r = {};
       return Object.entries(e).forEach(([n, i]) => {
         switch (n) {
@@ -507,7 +507,7 @@ class g {
               throw new Error(`The ${x} field must be a string.`);
             t.setBlueId(i);
             break;
-          case Oe:
+          case Me:
             t.setItems(g.handleArray(i));
             break;
           case De:
@@ -519,7 +519,7 @@ class g {
         }
       }), Object.keys(r).length > 0 && t.setProperties(r), t;
     } else {
-      if (Lt(e))
+      if (jt(e))
         return new c().setItems(g.handleArray(e));
       {
         const t = e;
@@ -557,9 +557,9 @@ class g {
 function Rr(s) {
   return s && s.__esModule && Object.prototype.hasOwnProperty.call(s, "default") ? s.default : s;
 }
-var Le, mt;
+var ke, mt;
 function Or() {
-  return mt || (mt = 1, Le = function s(e) {
+  return mt || (mt = 1, ke = function s(e) {
     if (typeof e == "number" && isNaN(e))
       throw new Error("NaN is not allowed");
     if (typeof e == "number" && !isFinite(e))
@@ -570,40 +570,40 @@ function Or() {
       const i = r.length === 0 ? "" : ",";
       return `${r}${i}${s(n)}:${s(e[n])}`;
     }, "")}}`;
-  }), Le;
+  }), ke;
 }
-var Dr = Or();
-const Mr = /* @__PURE__ */ Rr(Dr);
-class Je {
+var Mr = Or();
+const Dr = /* @__PURE__ */ Rr(Mr);
+class Ze {
   static canonicalize(e) {
-    return Mr(e);
+    return Dr(e);
   }
 }
-const Ue = typeof process < "u" && process.versions != null && process.versions.node != null;
-class at {
+const Ke = typeof process < "u" && process.versions != null && process.versions.node != null;
+class ct {
   static instance;
   browserCrypto;
   constructor() {
     this.browserCrypto = this.initBrowserCrypto();
   }
   static getInstance() {
-    return this.instance || (this.instance = new at()), this.instance;
+    return this.instance || (this.instance = new ct()), this.instance;
   }
   initBrowserCrypto() {
-    return Ue ? null : "crypto" in globalThis ? globalThis.crypto : null;
+    return Ke ? null : "crypto" in globalThis ? globalThis.crypto : null;
   }
   hasNodeCrypto() {
-    return Ue && !!je && typeof je.createHash == "function";
+    return Ke && !!Ue && typeof Ue.createHash == "function";
   }
   getBrowserCrypto() {
     return this.browserCrypto;
   }
   getNodeCrypto() {
-    return Ue ? je : null;
+    return Ke ? Ue : null;
   }
 }
 class xr {
-  cryptoEnv = at.getInstance();
+  cryptoEnv = ct.getInstance();
   applySync(e) {
     const t = this.canonicalizeInput(e), r = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : this.sha256SyncBrowser(t);
     return ue.encode(r);
@@ -613,7 +613,7 @@ class xr {
     return ue.encode(r);
   }
   canonicalizeInput(e) {
-    const t = Je.canonicalize(e);
+    const t = Ze.canonicalize(e);
     if (typeof t != "string")
       throw new Error("Canonized value must be a string");
     return t;
@@ -628,7 +628,7 @@ class xr {
     return new Uint8Array(r);
   }
   sha256SyncBrowser(e) {
-    return new Uint8Array(br.arrayBuffer(e));
+    return new Uint8Array(Br.arrayBuffer(e));
   }
   async sha256Async(e) {
     if (this.cryptoEnv.hasNodeCrypto())
@@ -640,7 +640,7 @@ class xr {
     return new Uint8Array(i);
   }
 }
-class m {
+class I {
   /**
    * Converts a BlueNode to a JSON representation based on the specified strategy.
    *
@@ -655,7 +655,7 @@ class m {
     const r = e.getValue(), n = this.handleValue(r);
     if (n !== void 0 && t === "simple")
       return n;
-    const i = e.getItems()?.map((Q) => m.get(Q, t));
+    const i = e.getItems()?.map((Q) => I.get(Q, t));
     if (i !== void 0 && t === "simple")
       return i;
     const o = e.getName(), l = e.getDescription();
@@ -671,26 +671,26 @@ class m {
     if (t === "official" && r !== void 0 && u === void 0) {
       const Q = this.inferTypeBlueId(r);
       Q !== null && (a[W] = { [x]: Q });
-    } else u !== void 0 && (a[W] = m.get(u, t));
+    } else u !== void 0 && (a[W] = I.get(u, t));
     const y = e.getItemType();
-    y !== void 0 && (a[fe] = m.get(y, t));
-    const d = e.getKeyType();
-    d !== void 0 && (a[ye] = m.get(d, t));
+    y !== void 0 && (a[fe] = I.get(y, t));
+    const p = e.getKeyType();
+    p !== void 0 && (a[ye] = I.get(p, t));
     const f = e.getValueType();
-    f !== void 0 && (a[ge] = m.get(f, t)), n !== void 0 && (a[me] = n), i !== void 0 && (a[Oe] = i);
+    f !== void 0 && (a[ge] = I.get(f, t)), n !== void 0 && (a[me] = n), i !== void 0 && (a[Me] = i);
     const v = e.getBlueId();
     v !== void 0 && (a[x] = v);
     const k = e.getBlue();
     k !== void 0 && (a[De] = k);
     const q = e.getProperties();
     return q !== void 0 && Object.entries(q).forEach(([Q, ar]) => {
-      a[Q] = m.get(ar, t);
+      a[Q] = I.get(ar, t);
     }), a;
   }
   static handleValue(e) {
     if (C(e)) {
       if (Z(e)) {
-        const t = new M(Number.MIN_SAFE_INTEGER.toString()), r = new M(Number.MAX_SAFE_INTEGER.toString());
+        const t = new D(Number.MIN_SAFE_INTEGER.toString()), r = new D(Number.MAX_SAFE_INTEGER.toString());
         if (e.lt(t) || e.gt(r))
           return e.toString();
       }
@@ -699,10 +699,10 @@ class m {
     return e;
   }
   static inferTypeBlueId(e) {
-    return typeof e == "string" ? _ : C(e) ? Z(e) ? L : j : typeof e == "boolean" ? U : null;
+    return typeof e == "string" ? _ : C(e) ? Z(e) ? j : L : typeof e == "boolean" ? U : null;
   }
 }
-const Fr = (s) => Qe(s) && p(s);
+const Fr = (s) => et(s) && d(s);
 class T {
   static INSTANCE = new T(new xr());
   hashProvider;
@@ -711,18 +711,18 @@ class T {
   }
   static calculateBlueId(e) {
     if (Array.isArray(e)) {
-      const r = e.map((n) => m.get(n));
+      const r = e.map((n) => I.get(n));
       return T.INSTANCE.calculate(r);
     }
-    const t = m.get(e);
+    const t = I.get(e);
     return T.INSTANCE.calculate(t);
   }
   static calculateBlueIdSync(e) {
     if (Array.isArray(e)) {
-      const r = e.map((n) => m.get(n));
+      const r = e.map((n) => I.get(n));
       return T.INSTANCE.calculateSync(r);
     }
-    const t = m.get(e);
+    const t = I.get(e);
     return T.INSTANCE.calculateSync(t);
   }
   calculate(e) {
@@ -739,7 +739,7 @@ class T {
   }
   // Internal method to calculate BlueId recursively
   internalCalculate(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);
+    return Fr(e) || C(e) ? this.applyHash(e.toString(), t) : Array.isArray(e) || Pe(e) ? this.calculateList(e, t) : this.calculateMap(e, t);
   }
   calculateMap(e, t) {
     if (e[x] !== void 0)
@@ -789,10 +789,10 @@ class T {
   // Method to clean the input structure by removing null or undefined values
   cleanStructure(e) {
     if (e != null) {
-      if (Qe(e) || C(e))
+      if (et(e) || C(e))
         return e;
-      if (Array.isArray(e) || Ee(e)) {
-        const t = e.map((r) => this.cleanStructure(r)).filter(p);
+      if (Array.isArray(e) || Pe(e)) {
+        const t = e.map((r) => this.cleanStructure(r)).filter(d);
         return t.length > 0 ? t : void 0;
       } else if (typeof e == "object") {
         const t = {};
@@ -811,10 +811,10 @@ class kn {
     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 wr.Encoder({ type: "rfc4648", lc: !0 }).write(n).finalize().replace(/=/g, "");
+    return n[0] = 1, n[1] = 85, n.set(r, 2), "b" + new br.Encoder({ type: "rfc4648", lc: !0 }).write(n).finalize().replace(/=/g, "");
   }
 }
-class B {
+class w {
   /**
    * Transforms a node and all its child nodes using the provided transformer function
    * @param node - The node to transform
@@ -823,30 +823,30 @@ class B {
    */
   static transform(e, t) {
     const r = t(e.clone()), n = r.getType();
-    n !== void 0 && r.setType(B.transform(n, t));
+    n !== void 0 && r.setType(w.transform(n, t));
     const i = r.getItemType();
     i !== void 0 && r.setItemType(
-      B.transform(i, t)
+      w.transform(i, t)
     );
     const o = r.getKeyType();
     o !== void 0 && r.setKeyType(
-      B.transform(o, t)
+      w.transform(o, t)
     );
     const l = r.getValueType();
     l !== void 0 && r.setValueType(
-      B.transform(l, t)
+      w.transform(l, t)
     );
     const a = r.getItems();
     if (a !== void 0) {
       const y = a.map(
-        (d) => B.transform(d, t)
+        (p) => w.transform(p, t)
       );
       r.setItems(y);
     }
     const u = r.getProperties();
     if (u !== void 0) {
       const y = Object.keys(u).reduce(
-        (d, f) => (d[f] = B.transform(u[f], t), d),
+        (p, f) => (p[f] = w.transform(u[f], t), p),
         {}
       );
       r.setProperties(y);
@@ -968,7 +968,7 @@ function le(s, e) {
     key: Array.isArray(t) ? se(r) : r
   };
 }
-function ct(s, e) {
+function ut(s, e) {
   if (s instanceof c) {
     const t = e, r = Ut(s, t, !1);
     if (r !== void 0 || [
@@ -994,23 +994,23 @@ function ct(s, e) {
   }
   return Array.isArray(s) || F(s) ? s[e] : s;
 }
-function P(s) {
+function N(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 = We(s);
+  const e = He(s);
   return g.deserialize(e);
 }
-function We(s) {
+function He(s) {
   if (s === void 0) return null;
   if (s === null || typeof s != "object") return s;
-  if (Array.isArray(s)) return s.map(We);
+  if (Array.isArray(s)) return s.map(He);
   const e = {};
   for (const [t, r] of Object.entries(s))
-    e[t] = We(r);
+    e[t] = He(r);
   return e;
 }
-function ut(s, e, t) {
+function dt(s, e, t) {
   if (s instanceof c) {
     const r = e;
     switch (r) {
@@ -1022,22 +1022,22 @@ function ut(s, e, t) {
         return;
       case "type":
         s.setType(
-          t instanceof c || typeof t == "string" || t === void 0 ? t : P(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : N(t)
         );
         return;
       case "itemType":
         s.setItemType(
-          t instanceof c || typeof t == "string" || t === void 0 ? t : P(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : N(t)
         );
         return;
       case "keyType":
         s.setKeyType(
-          t instanceof c || typeof t == "string" || t === void 0 ? t : P(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : N(t)
         );
         return;
       case "valueType":
         s.setValueType(
-          t instanceof c || typeof t == "string" || t === void 0 ? t : P(t)
+          t instanceof c || typeof t == "string" || t === void 0 ? t : N(t)
         );
         return;
       case "value": {
@@ -1050,7 +1050,7 @@ function ut(s, e, t) {
         return;
       case "blue":
         s.setBlue(
-          t instanceof c || t === void 0 ? t : P(t)
+          t instanceof c || t === void 0 ? t : N(t)
         );
         return;
       case "items":
@@ -1067,7 +1067,7 @@ function ut(s, e, t) {
           const n = s.getProperties();
           n && r in n && delete n[r];
         } else
-          s.getProperties() || s.setProperties({}), s.addProperty(r, t instanceof c ? t : P(t));
+          s.getProperties() || s.setProperties({}), s.addProperty(r, t instanceof c ? t : N(t));
         return;
       }
     }
@@ -1100,7 +1100,7 @@ function _r(s, e, t, r) {
   } else
     i.splice(n, 0, t);
 }
-function Ae(s, e, t, r) {
+function Ve(s, e, t, r) {
   if (Array.isArray(s)) {
     const n = e === "-" ? s.length : se(e);
     if (!r && n > s.length)
@@ -1109,7 +1109,7 @@ function Ae(s, e, t, r) {
       );
     if (n < 0 && e !== "-")
       throw new Error(`Invalid negative array index: ${e}`);
-    const i = P(t);
+    const i = N(t);
     if (r) {
       if (n >= 0 && n < s.length) s[n] = i;
       else if (n >= s.length) {
@@ -1122,16 +1122,16 @@ function Ae(s, e, t, r) {
     return;
   }
   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);
+    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? _r(s, e, N(t), r) : dt(s, e, t);
     return;
   }
   if (F(s)) {
-    s[e] = P(t);
+    s[e] = N(t);
     return;
   }
   throw new Error(`Cannot insert into parent of type ${typeof s}`);
 }
-function jr(s, e) {
+function Lr(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);
@@ -1146,17 +1146,17 @@ function jr(s, e) {
         return;
       }
     }
-    ut(s, e, void 0);
+    dt(s, e, void 0);
   } else F(s) && delete s[e];
 }
-function Ze(s) {
+function Xe(s) {
   if (s instanceof c) return s.clone();
   if (Array.isArray(s))
-    return s.map((t) => Ze(t));
+    return s.map((t) => Xe(t));
   if (F(s)) {
     const e = {};
     return Object.keys(s).forEach((t) => {
-      e[t] = Ze(s[t]);
+      e[t] = Xe(s[t]);
     }), e;
   }
   return s;
@@ -1176,52 +1176,52 @@ function Y(s, e) {
 }
 function kt(s, e) {
   const { parent: t, key: r } = le(s, oe(e));
-  return ct(t, r);
+  return ut(t, r);
 }
 function Kt(s, e, t) {
   const r = oe(e);
   if (r.length === 0 && e === "/") {
-    const o = P(t);
+    const o = N(t);
     s.setValue(o.getValue() ?? null), o.getItems() ? s.setItems(o.getItems()) : s.setItems(void 0);
     return;
   }
   const { parent: n, key: i } = le(s, r);
-  Ae(n, i, t, !0);
+  Ve(n, i, t, !0);
 }
-function Lr(s, e, t) {
+function jr(s, e, t) {
   const r = oe(e);
   if (r.length === 0 && e === "/") {
     if (s.getItems() && Array.isArray(t)) {
-      const o = P(t);
+      const o = N(t);
       o.getItems() ? (s.setItems(o.getItems()), s.setValue(null)) : (s.setValue(o.getValue() ?? null), s.setItems(void 0));
     } else {
-      const o = P(t);
+      const o = N(t);
       s.setValue(o.getValue() ?? null), o.getItems() && s.setItems(o.getItems());
     }
     return !0;
   }
   const { parent: n, key: i } = le(s, r);
-  return Ae(n, i, t, !1), !0;
+  return Ve(n, i, t, !1), !0;
 }
 function Ur(s, e, t) {
   const r = oe(e);
   if (r.length === 0 && e === "/") {
-    const l = P(t);
+    const l = N(t);
     return s.setValue(l.getValue() ?? null), l.getItems() ? s.setItems(l.getItems()) : s.setItems(void 0), !0;
   }
   const { parent: n, key: i, actualTarget: o } = le(s, r);
   if (o !== void 0 && n instanceof c)
-    ut(n, i, t);
+    dt(n, i, t);
   else {
-    const l = ct(n, i), a = Array.isArray(n) || n instanceof c && n.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
+    const l = ut(n, i), a = Array.isArray(n) || n instanceof c && n.getItems() && (typeof i == "number" || typeof i == "string" && /^\d+$/.test(i));
     if (l === void 0) {
       if (a)
         throw new Error(
           `REPLACE failed: Target array index '${i.toString()}' is out of bounds or does not exist at path '${e}'.`
         );
-      Ae(n, i, t, !0);
+      Ve(n, i, t, !0);
     } else
-      Ae(n, i, t, !0);
+      Ve(n, i, t, !0);
   }
   return !0;
 }
@@ -1230,14 +1230,14 @@ function Yt(s, e) {
   if (t.length === 0 && e === "/")
     return s.setValue(null), s.setItems(void 0), s.setProperties(void 0), !0;
   const { parent: r, key: n } = le(s, t);
-  return jr(r, n), !0;
+  return Lr(r, n), !0;
 }
 function kr(s, e, t) {
-  const r = Ze(kt(s, e));
+  const r = Xe(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);
+  const r = oe(e), { parent: n, key: i } = le(s, r), o = ut(n, i);
   if (o === void 0)
     throw new Error(`MOVE failed: 'from' location '${e}' does not exist.`);
   return Yt(s, e) ? (Kt(s, t, o), !0) : !1;
@@ -1254,7 +1254,7 @@ function Yr(s, e, t) {
           )}, got ${JSON.stringify(r.getValue() ?? null)}`
         );
       return !0;
-    } else typeof t == "object" && !(t instanceof c) && (n = P(t));
+    } else typeof t == "object" && !(t instanceof c) && (n = N(t));
   else if (O(r) && typeof t == "number")
     r instanceof E ? n = new E(t.toString()) : r instanceof S && (n = new S(t.toString()));
   else if ((r === null || typeof r == "string" || typeof r == "number" || typeof r == "boolean") && O(t)) {
@@ -1272,7 +1272,7 @@ function Yr(s, e, t) {
 function zr(s, e) {
   switch (e.op) {
     case "add":
-      return Lr(s, e.path, e.val);
+      return jr(s, e.path, e.val);
     case "replace":
       return Ur(s, e.path, e.val);
     case "remove":
@@ -1289,7 +1289,7 @@ function Kn(s, e, t = !1) {
   const r = t ? s : s.clone();
   return zr(r, e), r;
 }
-const ke = Symbol.for("zod-schema-annotations");
+const Ye = Symbol.for("zod-schema-annotations");
 function Gr() {
   if (typeof globalThis < "u") return globalThis;
   if (typeof global < "u") return global;
@@ -1299,7 +1299,7 @@ function Gr() {
 }
 function zt() {
   const s = Gr();
-  return ke in s || (s[ke] = /* @__PURE__ */ new WeakMap()), s[ke];
+  return Ye in s || (s[Ye] = /* @__PURE__ */ new WeakMap()), s[Ye];
 }
 function Ie(s, e) {
   const t = zt(), r = t.get(s) || {};
@@ -1313,7 +1313,7 @@ const R = (s) => zt().get(s), Jr = (s) => (e) => {
   });
 }, Wr = (s) => {
   const e = R(s);
-  return p(e) && tt(e.blueDescription) ? e.blueDescription : null;
+  return d(e) && rt(e.blueDescription) ? e.blueDescription : null;
 }, Yn = (s) => Jr(s)(h.string().optional()), Zr = h.union([h.string(), h.boolean()]), Hr = (s) => (e) => {
   const t = R(e);
   return Ie(e, {
@@ -1331,7 +1331,7 @@ const R = (s) => zt().get(s), Jr = (s) => (e) => {
   });
 }, Qr = (s) => {
   const e = R(s);
-  return p(e) && tt(e.blueName) ? e.blueName : null;
+  return d(e) && rt(e.blueName) ? e.blueName : null;
 }, Gn = (s) => {
   const e = h.string().optional();
   return qr(s)(e);
@@ -1343,7 +1343,7 @@ const R = (s) => zt().get(s), Jr = (s) => (e) => {
   });
 }, ts = (s) => {
   const e = R(s);
-  return p(e) && p(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
+  return d(e) && d(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
 }, Gt = (s) => !!ts(s), Jn = () => {
   const s = h.instanceof(c);
   return es()(s);
@@ -1366,13 +1366,13 @@ const R = (s) => zt().get(s), Jr = (s) => (e) => {
 class pe {
   static resolveBlueId(e) {
     const t = ss(e);
-    if (I(t))
+    if (m(t))
       return null;
     const r = t.defaultValue;
-    if (p(r))
+    if (d(r))
       return r;
     const n = t.value?.[0];
-    return p(n) ? n : pe.getRepositoryBlueId(t, e);
+    return d(n) ? n : pe.getRepositoryBlueId(t, e);
   }
   static getRepositoryBlueId(e, t) {
     throw new Error("Not implemented");
@@ -1382,11 +1382,11 @@ class A {
   // TODO: Enhance to support schemas associated with multiple blueIds
   static isTypeOf(e, t, r) {
     const n = pe.resolveBlueId(t), i = e.getType()?.getBlueId();
-    if (I(n) || I(i))
+    if (m(n) || m(i))
       return !1;
     if (n === i)
       return !0;
-    if (r?.checkSchemaExtensions && p(r.typeSchemaResolver)) {
+    if (r?.checkSchemaExtensions && d(r.typeSchemaResolver)) {
       const o = r.typeSchemaResolver.resolveSchema(e);
       return A.checkSchemaExtension(o, t, {
         typeSchemaResolver: r.typeSchemaResolver
@@ -1398,19 +1398,19 @@ class A {
    * Checks if a schema extends a base schema.
    */
   static checkSchemaExtension(e, t, r) {
-    if (!p(e))
+    if (!d(e))
       return !1;
     const n = A.unwrapSchema(e), i = A.unwrapSchema(t);
-    return p(r?.typeSchemaResolver) ? r.typeSchemaResolver.isSchemaExtendedFrom(
+    return d(r?.typeSchemaResolver) ? r.typeSchemaResolver.isSchemaExtendedFrom(
       n,
       i
     ) : !1;
   }
   static isWrapperType(e) {
-    return e instanceof Pt || e instanceof St || e instanceof Ct || e instanceof At || e instanceof Ne || e instanceof Pe;
+    return e instanceof Nt || e instanceof St || e instanceof Ct || e instanceof At || e instanceof Ne || e instanceof Se;
   }
   static unwrapSchema(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;
+    return Gt(e) ? e : A.isWrapperType(e) ? e instanceof Ne ? A.unwrapSchema(e.innerType()) : e instanceof Se ? A.unwrapSchema(e.schema) : A.unwrapSchema(e.unwrap()) : e;
   }
 }
 function Tt(s, e) {
@@ -1422,7 +1422,7 @@ function Tt(s, e) {
     if (X.includes(
       r
     )) {
-      const i = xe[r];
+      const i = Fe[r];
       return new c().setBlueId(r).setName(i);
     }
     const n = e.fetchByBlueId(r);
@@ -1436,7 +1436,7 @@ function Tt(s, e) {
   }
   return t;
 }
-function w(s, e, t) {
+function b(s, e, t) {
   const r = T.calculateBlueIdSync(s), n = T.calculateBlueIdSync(e);
   if (r === n)
     return !0;
@@ -1466,45 +1466,45 @@ function w(s, e, t) {
   return !1;
 }
 function ns(s, e) {
-  return lt.some((t) => {
+  return at.some((t) => {
     const r = new c().setBlueId(t);
-    return w(s, r, e);
+    return b(s, r, e);
   });
 }
 function is(s, e) {
   const t = new c().setBlueId(_);
-  return w(s, t, e);
+  return b(s, t, e);
 }
 function os(s, e) {
-  const t = new c().setBlueId(L);
-  return w(s, t, e);
+  const t = new c().setBlueId(j);
+  return b(s, t, e);
 }
 function ls(s, e) {
-  const t = new c().setBlueId(j);
-  return w(s, t, e);
+  const t = new c().setBlueId(L);
+  return b(s, t, e);
 }
 function as(s, e) {
   const t = new c().setBlueId(U);
-  return w(s, t, e);
+  return b(s, t, e);
 }
 function Jt(s, e) {
-  const t = new c().setBlueId(it);
-  return w(s, t, e);
+  const t = new c().setBlueId(ot);
+  return b(s, t, e);
 }
 function Wt(s, e) {
-  const t = new c().setBlueId(ot);
-  return w(s, t, e);
+  const t = new c().setBlueId(lt);
+  return b(s, t, e);
 }
 function cs(s, e) {
-  return Me.some((t) => {
+  return xe.some((t) => {
     const r = new c().setName(t);
-    return w(s, r, e);
+    return b(s, r, e);
   });
 }
 function us(s, e) {
-  for (const t of Me) {
+  for (const t of xe) {
     const r = new c().setName(t);
-    if (w(s, r, e))
+    if (b(s, r, e))
       return t;
   }
   throw new Error(
@@ -1523,7 +1523,7 @@ class ds {
   }
   registerSchema(e) {
     const t = pe.resolveBlueId(e);
-    if (p(t)) {
+    if (d(t)) {
       if (this.blueIdMap.has(t))
         throw new Error(`Duplicate BlueId value: ${t}`);
       this.blueIdMap.set(t, e);
@@ -1534,30 +1534,30 @@ class ds {
   }
   resolveSchema(e) {
     const t = this.getEffectiveBlueId(e);
-    return I(t) ? null : this.blueIdMap.get(t);
+    return m(t) ? null : this.blueIdMap.get(t);
   }
   isSchemaExtendedFrom(e, t) {
-    if (I(e))
+    if (m(e))
       return !1;
     const r = this.getBlueIdForSchema(e), n = this.getBlueIdForSchema(t);
-    if (I(r) || I(n))
+    if (m(r) || m(n))
       return !1;
     if (r === n)
       return !0;
-    if (p(this.nodeProvider))
+    if (d(this.nodeProvider))
       try {
         const i = new c().setBlueId(r), o = new c().setBlueId(n);
-        if (w(i, o, this.nodeProvider))
+        if (b(i, o, this.nodeProvider))
           return !0;
       } catch {
       }
     return !1;
   }
   getBlueIdForSchema(e) {
-    if (I(e))
+    if (m(e))
       return null;
     const t = pe.resolveBlueId(e);
-    if (p(t))
+    if (d(t))
       return t;
     for (const [r, n] of this.blueIdMap)
       if (n === e || n._def === e._def)
@@ -1566,13 +1566,13 @@ class ds {
   }
   getEffectiveBlueId(e) {
     const t = e.getType();
-    return p(t) && p(t.getBlueId()) ? t.getBlueId() : p(t) ? T.calculateBlueIdSync(t) : null;
+    return d(t) && d(t.getBlueId()) ? t.getBlueId() : d(t) ? T.calculateBlueIdSync(t) : null;
   }
   getBlueIdMap() {
     return new Map(this.blueIdMap);
   }
 }
-const N = {
+const P = {
   NAME: "name",
   DESCRIPTION: "description",
   TYPE: "type",
@@ -1585,7 +1585,7 @@ const N = {
   BLUE: "blue",
   ITEMS: "items"
 };
-class dt {
+class _e {
   /**
    * Check if a node is empty (has no fields set)
    */
@@ -1596,13 +1596,13 @@ class dt {
    * Check if a node has only a Blue ID
    */
   static hasBlueIdOnly(e) {
-    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([N.BLUE_ID]));
+    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([P.BLUE_ID]));
   }
   /**
    * Check if a node has only items
    */
   static hasItemsOnly(e) {
-    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([N.ITEMS]));
+    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([P.ITEMS]));
   }
   /**
    * Check if a node is a valid value node (has a value, no properties, no items)
@@ -1611,7 +1611,7 @@ class dt {
    */
   static isValidValueNode(e) {
     const t = e.getValue(), r = e.getProperties(), n = e.getItems();
-    return p(t) && I(r) && I(n);
+    return d(t) && m(r) && m(n);
   }
   /**
    * Create a text node
@@ -1624,14 +1624,14 @@ class dt {
    */
   static integerNode(e) {
     const t = e instanceof E ? e : new E(e.toString());
-    return new c().setType(new c().setBlueId(L)).setValue(t);
+    return new c().setType(new c().setBlueId(j)).setValue(t);
   }
   /**
    * Create a double node
    */
   static doubleNode(e) {
     const t = e instanceof S ? e : new S(e.toString());
-    return new c().setType(new c().setBlueId(j)).setValue(t);
+    return new c().setType(new c().setBlueId(L)).setValue(t);
   }
   /**
    * Create a boolean node
@@ -1647,8 +1647,8 @@ class dt {
    * @returns true if the node matches the field requirements
    */
   static hasFieldsAndMayHaveFields(e, t = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set()) {
-    for (const n of Object.values(N)) {
-      const i = p(this.getFieldValue(e, n));
+    for (const n of Object.values(P)) {
+      const i = d(this.getFieldValue(e, n));
       if (t.has(n)) {
         if (!i) return !1;
       } else if (!r.has(n)) {
@@ -1662,27 +1662,27 @@ class dt {
    */
   static getFieldValue(e, t) {
     switch (t) {
-      case N.NAME:
+      case P.NAME:
         return e.getName();
-      case N.TYPE:
+      case P.TYPE:
         return e.getType();
-      case N.VALUE:
+      case P.VALUE:
         return e.getValue();
-      case N.DESCRIPTION:
+      case P.DESCRIPTION:
         return e.getDescription();
-      case N.PROPERTIES:
+      case P.PROPERTIES:
         return e.getProperties();
-      case N.BLUE:
+      case P.BLUE:
         return e.getBlue();
-      case N.ITEMS:
+      case P.ITEMS:
         return e.getItems();
-      case N.KEY_TYPE:
+      case P.KEY_TYPE:
         return e.getKeyType();
-      case N.VALUE_TYPE:
+      case P.VALUE_TYPE:
         return e.getValueType();
-      case N.ITEM_TYPE:
+      case P.ITEM_TYPE:
         return e.getItemType();
-      case N.BLUE_ID:
+      case P.BLUE_ID:
         return e.getBlueId();
       default:
         throw new Error(`Unknown field: ${t}`);
@@ -1693,7 +1693,7 @@ class pt {
 }
 class ce {
   static convert(e) {
-    const t = new He();
+    const t = new qe();
     return ce.traverseNode(e, "", t), t.build();
   }
   static traverseNode(e, t, r) {
@@ -1720,7 +1720,7 @@ 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 pt {
+class Le extends pt {
   allowedPaths;
   maxDepth;
   currentPath = [];
@@ -1813,7 +1813,7 @@ class $e extends pt {
    * @returns The path limits
    */
   static withMaxDepth(e) {
-    const t = new He().setMaxDepth(e);
+    const t = new qe().setMaxDepth(e);
     for (let r = 1; r <= e; r++) {
       const n = "/" + Array(r).fill("*").join("/");
       t.addPath(n);
@@ -1826,7 +1826,7 @@ class $e extends pt {
    * @returns The path limits
    */
   static withSinglePath(e) {
-    return new He().addPath(e).build();
+    return new qe().addPath(e).build();
   }
   /**
    * Creates path limits by analyzing the structure of a node.
@@ -1836,7 +1836,7 @@ class $e extends pt {
     return ce.convert(e);
   }
 }
-class He {
+class qe {
   allowedPaths = /* @__PURE__ */ new Set();
   maxDepth = Number.MAX_SAFE_INTEGER;
   /**
@@ -1860,10 +1860,10 @@ class He {
    * @returns The built PathLimits
    */
   build() {
-    return new $e(this.allowedPaths, this.maxDepth);
+    return new Le(this.allowedPaths, this.maxDepth);
   }
 }
-class Xe extends pt {
+class we extends pt {
   /**
    * Determines if a path segment should be extended - always returns true
    * @returns Always true
@@ -1889,7 +1889,7 @@ class Xe extends pt {
   exitPathSegment() {
   }
 }
-class _e extends pt {
+class je extends pt {
   limits;
   /**
    * Creates a composite limits with the specified limit strategies
@@ -1946,10 +1946,10 @@ class _e extends pt {
    * @returns A new CompositeLimits instance
    */
   static of(...e) {
-    return new _e(e);
+    return new je(e);
   }
 }
-const K = new Xe();
+const K = new we();
 class ps {
   blue;
   constructor(e) {
@@ -1959,7 +1959,7 @@ 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), a = this.blue.resolve(t, o);
+    const i = Le.fromNode(t), o = je.of(r, i), l = this.extendAndResolve(e, o), a = this.blue.resolve(t, o);
     return this.verifyMatch(l, t, o) && this.recursiveValueComparison(l, a);
   }
   /**
@@ -1989,8 +1989,8 @@ class ps {
       let a = e.getProperties();
       a || (a = {}, e.setProperties(a));
       for (const [u, y] of Object.entries(i)) {
-        const d = a[u];
-        d === void 0 ? a[u] = y.clone() : this.restoreMissingStructure(d, y);
+        const p = a[u];
+        p === void 0 ? a[u] = y.clone() : this.restoreMissingStructure(p, y);
       }
     }
     const o = t.getBlueId();
@@ -2016,9 +2016,9 @@ class ps {
       r
     );
     if (r && !n) {
-      const d = e.getType();
-      if (!d || !w(
-        d,
+      const p = e.getType();
+      if (!p || !b(
+        p,
         r,
         this.blue.getNodeProvider()
       ))
@@ -2026,55 +2026,55 @@ class ps {
     }
     const i = t.getBlueId();
     if (!n && i !== void 0) {
-      const d = e.getBlueId(), f = e.getType()?.getBlueId();
-      if (d !== void 0) {
-        if (i !== d)
+      const p = e.getBlueId(), f = e.getType()?.getBlueId();
+      if (p !== void 0) {
+        if (i !== p)
           return !1;
       } else if (f === void 0 || i !== f)
         return !1;
     }
     const o = t.getValue();
     if (o !== void 0) {
-      const d = e.getValue();
-      if (d === void 0)
+      const p = e.getValue();
+      if (p === void 0)
         return !1;
-      if (C(d) && C(o)) {
-        if (!d.eq(o))
+      if (C(p) && C(o)) {
+        if (!p.eq(o))
           return !1;
-      } else if (d !== o)
+      } else if (p !== o)
         return !1;
     }
     const l = t.getItems();
     if (l !== void 0) {
-      const d = e.getItems() ?? [];
+      const p = e.getItems() ?? [];
       for (let f = 0; f < l.length; f++)
-        if (f < d.length) {
-          if (!this.recursiveValueComparison(d[f], l[f]))
+        if (f < p.length) {
+          if (!this.recursiveValueComparison(p[f], l[f]))
             return !1;
         } else if (this.hasValueInNestedStructure(l[f]))
           return !1;
     }
     const a = t.getItemType();
     if (a !== void 0) {
-      const d = e.getItems() ?? [];
-      for (const f of d)
+      const p = e.getItems() ?? [];
+      for (const f of p)
         if (!this.recursiveValueComparison(f, a))
           return !1;
     }
     const u = t.getProperties();
     if (u !== void 0) {
-      const d = e.getProperties() ?? {};
+      const p = e.getProperties() ?? {};
       for (const [f, v] of Object.entries(u))
-        if (f in d) {
-          if (!this.recursiveValueComparison(d[f], v))
+        if (f in p) {
+          if (!this.recursiveValueComparison(p[f], v))
             return !1;
         } else if (this.hasValueInNestedStructure(v))
           return !1;
     }
     const y = t.getValueType();
     if (y !== void 0) {
-      const d = Object.values(e.getProperties() ?? {});
-      for (const f of d)
+      const p = Object.values(e.getProperties() ?? {});
+      for (const f of p)
         if (!this.recursiveValueComparison(f, y))
           return !1;
     }
@@ -2111,14 +2111,14 @@ class ps {
     return e.getProperties() !== void 0 && e.getValue() === void 0;
   }
 }
-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;
+const hs = (s) => s instanceof Nt || s instanceof St || s instanceof Ct || s instanceof At || s instanceof Ne || s instanceof Se, fs = (s) => s instanceof ee || s instanceof te || s instanceof Be || s instanceof be;
 class Zt {
   static convertValue(e, t) {
     const r = e.getType()?.getBlueId(), n = e.getValue();
-    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(
+    return m(n) ? fs(t) && _e.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : n : _ === r ? this.convertFromString(String(n), t) : L === r || n instanceof S ? this.convertFromBigDecimal(
       new S(n?.toString()),
       t
-    ) : L === r || n instanceof E ? this.convertFromBigInteger(
+    ) : j === 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);
@@ -2128,9 +2128,9 @@ class Zt {
       return e;
     if (t instanceof te)
       return Number(e);
-    if (t instanceof be)
+    if (t instanceof Be)
       return e.toLowerCase() === "true";
-    if (t instanceof we)
+    if (t instanceof be)
       return BigInt(e);
     throw new Error(`Cannot convert String to ${t._def.typeName}`);
   }
@@ -2144,20 +2144,20 @@ class Zt {
   static convertFromBigInteger(e, t) {
     if (t instanceof te)
       return e.toNumber();
-    if (t instanceof we)
+    if (t instanceof be)
       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 we)
+    if (t instanceof be)
       return BigInt(e);
     throw new Error(`Cannot convert Boolean to ${t._def.typeName}`);
   }
@@ -2165,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 "";
@@ -2197,17 +2197,17 @@ class gs {
       return Object.keys(t.shape).reduce(
         (n, i) => {
           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;
+          if (d(a)) {
+            const v = rt(a) ? a : i, k = o?.[v], q = k ? T.calculateBlueIdSync(k) : void 0;
             return n[i] = q, n;
           }
           const u = Qr(l);
-          if (p(u)) {
+          if (d(u)) {
             const v = o?.[u];
             return n[i] = v?.getName(), n;
           }
           const y = Wr(l);
-          if (p(y)) {
+          if (d(y)) {
             const v = o?.[y];
             return n[i] = v?.getDescription(), n;
           }
@@ -2219,11 +2219,11 @@ class gs {
             const v = e.getDescription();
             return n[i] = v, n;
           }
-          const d = o?.[i];
-          if (I(d))
+          const p = o?.[i];
+          if (m(p))
             return n;
           const f = this.nodeToObjectConverter.convert(
-            d,
+            p,
             l
           );
           return n[i] = f, n;
@@ -2267,29 +2267,29 @@ class Ts {
   }
   convert(e, t) {
     const r = t.keySchema, n = t.valueSchema, i = /* @__PURE__ */ new Map(), o = e.getName();
-    p(o) && i.set(G, o);
+    d(o) && i.set(G, o);
     const l = e.getDescription();
-    p(l) && i.set(J, l);
+    d(l) && i.set(J, l);
     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);
+    return d(a) && Object.entries(a).forEach(([u, y]) => {
+      const p = new c().setValue(u);
+      p.setType(new c().setBlueId(_));
+      const f = Zt.convertValue(p, r), v = this.nodeToObjectConverter.convert(y, n);
       i.set(f, v);
     }), t instanceof yr ? Object.fromEntries(i) : i;
   }
 }
 class vs {
   convert(e) {
-    return m.get(e);
+    return I.get(e);
   }
 }
-class bs {
+class Bs {
   convert(e) {
-    return m.get(e);
+    return I.get(e);
   }
 }
-class ws {
+class bs {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -2303,7 +2303,7 @@ class ws {
     );
   }
 }
-const Bs = h.union([
+const ws = h.union([
   h.literal("ZodString"),
   h.literal("ZodNumber"),
   h.literal("ZodBoolean"),
@@ -2328,8 +2328,8 @@ class Es {
   converters = /* @__PURE__ */ new Map();
   complexObjectConverter;
   registerConverters() {
-    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);
+    const e = new ys(), t = new ms(this.nodeToObjectConverter), r = new bs(this.nodeToObjectConverter), n = new Is(this.nodeToObjectConverter), i = new Ts(this.nodeToObjectConverter);
+    this.converters.set("ZodString", e), this.converters.set("ZodNumber", e), this.converters.set("ZodBoolean", e), this.converters.set("ZodBigInt", e), this.converters.set("ZodEnum", e), this.converters.set("ZodNativeEnum", e), this.converters.set("ZodUnknown", new vs()), this.converters.set("ZodAny", new Bs()), this.converters.set("ZodArray", t), this.converters.set("ZodTuple", r), this.converters.set("ZodSet", n), this.converters.set("ZodMap", i), this.converters.set("ZodRecord", i), this.converters.set("ZodObject", this.complexObjectConverter);
   }
   getConverter(e) {
     const t = this.getSchemaTypeName(e);
@@ -2337,16 +2337,16 @@ class Es {
   }
   getSchemaTypeName(e) {
     if (hs(e))
-      return e instanceof Ne ? this.getSchemaTypeName(e.innerType()) : e instanceof Pe ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
+      return e instanceof Ne ? this.getSchemaTypeName(e.innerType()) : e instanceof Se ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
     const t = e._def.typeName;
     try {
-      return Bs.parse(t);
+      return ws.parse(t);
     } catch {
       throw new Error(`Schema type name ${t} is not supported`);
     }
   }
 }
-class Ns {
+class Ps {
   constructor(e) {
     this.typeSchemaResolver = e, this.converterFactory = new Es(this);
   }
@@ -2360,7 +2360,7 @@ class Ns {
       r,
       n,
       { typeSchemaResolver: this.typeSchemaResolver }
-    ) && p(r) && (i = r), this.convertWithType(e, i);
+    ) && d(r) && (i = r), this.convertWithType(e, i);
   }
   convertWithType(e, t) {
     return this.converterFactory.getConverter(t).convert(e, t);
@@ -2375,16 +2375,16 @@ class Ht {
     this.isIdenticalToType(t, r) || (this.reverseBasicProperties(e, t, r), this.reverseTypeReferences(e, t, r), this.reverseItems(e, t, r), this.reverseProperties(e, t, r));
   }
   isIdenticalToType(e, t) {
-    return p(e.getBlueId()) && p(t?.getBlueId()) && e.getBlueId() === t.getBlueId();
+    return d(e.getBlueId()) && d(t?.getBlueId()) && e.getBlueId() === t.getBlueId();
   }
   reverseBasicProperties(e, t, r) {
     const n = t.getValue();
-    p(n) && (I(r) || I(r.getValue())) && e.setValue(n), p(t.getName()) && (I(r) || t.getName() !== r.getName()) && e.setName(t.getName()), p(t.getDescription()) && (I(r) || t.getDescription() !== r.getDescription()) && e.setDescription(t.getDescription()), p(t.getBlueId()) && (I(r) || t.getBlueId() !== r.getBlueId()) && e.setBlueId(t.getBlueId());
+    d(n) && (m(r) || m(r.getValue())) && e.setValue(n), d(t.getName()) && (m(r) || t.getName() !== r.getName()) && e.setName(t.getName()), d(t.getDescription()) && (m(r) || t.getDescription() !== r.getDescription()) && e.setDescription(t.getDescription()), d(t.getBlueId()) && (m(r) || t.getBlueId() !== r.getBlueId()) && e.setBlueId(t.getBlueId());
   }
   reverseTypeReferences(e, t, r) {
     const n = (i, o) => {
       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));
+      d(u) && (m(a?.getBlueId()) || u !== a.getBlueId()) && o(e, new c().setBlueId(u));
     };
     n(
       (i) => i.getType(),
@@ -2402,23 +2402,23 @@ class Ht {
   }
   reverseItems(e, t, r) {
     const n = t.getItems();
-    if (I(n))
+    if (m(n))
       return;
     const i = r?.getItems(), o = [];
-    if (p(i) && i.length > 0) {
-      const a = T.calculateBlueIdSync(i);
-      o.push(new c().setBlueId(a));
+    if (d(i) && n.length > i.length && d(i) && i.length > 0) {
+      const u = T.calculateBlueIdSync(i);
+      o.push(new c().setBlueId(u));
     }
-    const l = i?.length || 0;
-    for (let a = l; a < n.length; a++) {
-      const u = new c();
-      this.reverseNode(u, n[a], void 0), o.push(u);
+    const a = i?.length || 0;
+    for (let u = a; u < n.length; u++) {
+      const y = new c();
+      this.reverseNode(y, n[u], void 0), o.push(y);
     }
     o.length > 0 && e.setItems(o);
   }
   reverseProperties(e, t, r) {
     const n = t.getProperties();
-    if (I(n))
+    if (m(n))
       return;
     const i = {};
     for (const [o, l] of Object.entries(n)) {
@@ -2427,7 +2427,7 @@ class Ht {
         t,
         r
       ), u = new c();
-      this.reverseNode(u, l, a), dt.isEmptyNode(u) || (i[o] = u);
+      this.reverseNode(u, l, a), _e.isEmptyNode(u) || (i[o] = u);
     }
     Object.keys(i).length > 0 && e.setProperties(i);
   }
@@ -2437,8 +2437,8 @@ class Ht {
    */
   getInheritedProperty(e, t, r) {
     const n = r?.getProperties()?.[e], i = t.getType()?.getProperties()?.[e];
-    if (!(I(n) && I(i)))
-      return I(n) ? i : I(i) ? n : this.mergeNodes(n, i);
+    if (!(m(n) && m(i)))
+      return m(n) ? i : m(i) ? n : this.mergeNodes(n, i);
   }
   /**
    * Merges two nodes, with the second node's properties taking precedence.
@@ -2447,24 +2447,24 @@ class Ht {
    */
   mergeNodes(e, t) {
     const r = e.clone(), n = t.getValue();
-    p(n) && r.setValue(n);
+    d(n) && r.setValue(n);
     const i = t.getType();
-    p(i) && r.setType(i.clone());
+    d(i) && r.setType(i.clone());
     const o = t.getItemType();
-    p(o) && r.setItemType(o.clone());
+    d(o) && r.setItemType(o.clone());
     const l = t.getKeyType();
-    p(l) && r.setKeyType(l.clone());
+    d(l) && r.setKeyType(l.clone());
     const a = t.getValueType();
-    p(a) && r.setValueType(a.clone());
+    d(a) && r.setValueType(a.clone());
     const u = t.getProperties();
-    if (p(u)) {
-      const d = r.getProperties() || {};
+    if (d(u)) {
+      const p = r.getProperties() || {};
       for (const [f, v] of Object.entries(u))
-        d[f] = v.clone();
-      r.setProperties(d);
+        p[f] = v.clone();
+      r.setProperties(p);
     }
     const y = t.getItems();
-    return p(y) && r.setItems(y.map((d) => d.clone())), r;
+    return d(y) && r.setItems(y.map((p) => p.clone())), r;
   }
 }
 class ne extends c {
@@ -2535,30 +2535,30 @@ class Te {
     return t && t.length > 0 ? t[0] : null;
   }
 }
-function Ps(s) {
+function Ns(s) {
   return new class extends Te {
     fetchByBlueId(e) {
       return s(e);
     }
   }();
 }
-const Ke = H.types.float.options, Ss = {
-  ...Ke,
+const ze = H.types.float.options, Ss = {
+  ...ze,
   construct: (s) => {
     const e = s.replace(/_/g, "").toLowerCase();
-    if (!Nt(e))
+    if (!Pt(e))
       return new S(e);
-    if (Ke.construct)
-      return Ke.construct(s);
+    if (ze.construct)
+      return ze.construct(s);
   }
-}, Cs = new H.Type("tag:yaml.org,2002:float", Ss), Ye = H.types.int.options, As = {
-  ...Ye,
+}, Cs = new H.Type("tag:yaml.org,2002:float", Ss), Ge = H.types.int.options, As = {
+  ...Ge,
   construct: (s) => {
     let e = s;
-    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !Nt(e))
+    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !Pt(e))
       return new E(e);
-    if (Ye.construct)
-      return Ye.construct(s);
+    if (Ge.construct)
+      return Ge.construct(s);
   }
 }, Vs = new H.Type("tag:yaml.org,2002:int", As), Xt = H.CORE_SCHEMA.extend({
   implicit: [Cs, Vs]
@@ -2570,7 +2570,7 @@ const Ke = H.types.float.options, Ss = {
   replacer: (e, t) => {
     if (C(t)) {
       if (Z(t)) {
-        const r = new M(Number.MIN_SAFE_INTEGER.toString()), n = new M(Number.MAX_SAFE_INTEGER.toString());
+        const r = new D(Number.MIN_SAFE_INTEGER.toString()), n = new D(Number.MAX_SAFE_INTEGER.toString());
         if (t.lt(r) || t.gt(n))
           return t.toString();
       }
@@ -2581,11 +2581,11 @@ const Ke = H.types.float.options, Ss = {
 });
 class Os {
   static get(e, t = {}) {
-    const { strategy: r = "official" } = t, n = m.get(e, r);
+    const { strategy: r = "official" } = t, n = I.get(e, r);
     return Rs(n);
   }
 }
-class Ds extends Te {
+class Ms extends Te {
   nodeProviders;
   constructor(e) {
     super(), this.nodeProviders = e;
@@ -2623,7 +2623,7 @@ const qt = `- type:
     Dictionary: G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj
 - type:
     blueId: FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4
-`, Ms = `name: Transformation
+`, Ds = `name: Transformation
 description: TODO`, xs = `name: Infer Basic Types For Untyped Values
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
@@ -2632,7 +2632,7 @@ type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
 description: This transformation replaces`, $s = [
   qt,
-  Ms,
+  Ds,
   xs,
   Fs
 ];
@@ -2673,7 +2673,7 @@ class ht extends Te {
     return this.nodeProvider.fetchByBlueId(e);
   }
 }
-class ze {
+class Je {
   constructor(e, t, r) {
     this.blueId = e, this.content = t, this.isMultipleDocuments = r;
   }
@@ -2697,24 +2697,24 @@ class z {
         const u = g.deserialize(a);
         return t(u);
       });
-      n = T.calculateBlueIdSync(l), i = l.map((a) => m.get(a));
+      n = T.calculateBlueIdSync(l), i = l.map((a) => I.get(a));
     } else {
       const l = g.deserialize(r), a = t(l);
-      n = T.calculateBlueIdSync(a), i = m.get(a);
+      n = T.calculateBlueIdSync(a), i = I.get(a);
     }
-    return new ze(n, i, o);
+    return new Je(n, i, o);
   }
   static parseAndCalculateBlueIdForNode(e, t) {
-    const r = t(e), n = T.calculateBlueIdSync(r), i = m.get(r);
-    return new ze(n, i, !1);
+    const r = t(e), n = T.calculateBlueIdSync(r), i = I.get(r);
+    return new Je(n, i, !1);
   }
   static parseAndCalculateBlueIdForNodeList(e, t) {
     if (!e || e.length === 0)
       throw new Error("List of nodes cannot be null or empty");
     const r = e.map(t), n = T.calculateBlueIdSync(r), i = r.map(
-      (l) => m.get(l)
+      (l) => I.get(l)
     ), o = e.length > 1;
-    return new ze(n, i, o);
+    return new Je(n, i, o);
   }
   static resolveThisReferences(e, t, r) {
     return this.resolveThisReferencesRecursive(
@@ -2765,7 +2765,7 @@ class z {
     }
   }
 }
-class js extends Te {
+class Ls extends Te {
   fetchByBlueId(e) {
     const t = e.split("#")[0], r = this.fetchContentByBlueId(t);
     if (r == null)
@@ -2797,7 +2797,7 @@ class js extends Te {
     }
   }
 }
-class Qt extends js {
+class Qt extends Ls {
   nameToBlueIdsMap = /* @__PURE__ */ new Map();
   /**
    * Find a node by name. Throws an error if multiple nodes are found with the same name.
@@ -2841,17 +2841,17 @@ class Qt extends js {
     ]);
   }
 }
-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 er = (s) => s instanceof c || Array.isArray(s) && s.every((e) => e instanceof c) ? s : tt(s) ? s.map((e) => g.deserialize(e)) : g.deserialize(s), js = async (s) => {
   const e = er(s);
   return T.calculateBlueId(e);
 }, Zn = (s) => {
   const e = er(s);
   return T.calculateBlueIdSync(e);
-}, bt = async (s) => {
-  if (Nr(s))
+}, Bt = async (s) => {
+  if (Pr(s))
     return s;
   try {
-    const e = Ce.parse(s), t = await Ls(e);
+    const e = Ae.parse(s), t = await js(e);
     return {
       ...s,
       blueId: t
@@ -2859,31 +2859,31 @@ const er = (s) => s instanceof c || Array.isArray(s) && s.every((e) => e instanc
   } catch (e) {
     throw new Error(`Failed enriching object with Blue ID: ${e}`);
   }
-}, Hn = (s) => s?.items, Xn = (s) => s?.value, qn = (s) => I(s) ? {} : Rt(
+}, Hn = (s) => s?.items, Xn = (s) => s?.value, qn = (s) => m(s) ? {} : Rt(
   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) => {
+  nt
+), Qn = (s) => Sr(s) ? s.type.name ?? null : Cr(s) ? gr(typeof s.value) : Nr(s) ? "List" : null, Us = (s) => d(s) && Object.keys(Rt(s, ["blueId"])).length > 0, ei = (s) => {
   try {
-    const e = g.deserialize(s), t = m.get(e);
+    const e = g.deserialize(s), t = I.get(e);
     return de.parse(t);
   } catch (e) {
     throw new Error(
       `Failed transforming JSON-like value to BlueObject: ${e}`
     );
   }
-}, wt = async (s) => {
+}, bt = async (s) => {
   const {
     resolveFunction: e,
     signal: t = new AbortController().signal,
     omitItems: r
   } = s, n = s.count ?? s.items.length;
-  let i = await mr(s.items, async (l) => await bt(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 a = await e(i[l], { signal: t });
       if (Array.isArray(a))
-        return wt({
+        return bt({
           ...s,
           items: [
             ...i.slice(0, l),
@@ -2891,9 +2891,9 @@ const er = (s) => s instanceof c || Array.isArray(s) && s.every((e) => e instanc
             ...i.slice(l + 1)
           ]
         });
-      const u = await bt(a);
+      const u = await Bt(a);
       if (r?.includes(u.blueId))
-        return wt({
+        return bt({
           ...s,
           items: [...i.slice(0, l), ...i.slice(l + 1)]
         });
@@ -2905,7 +2905,7 @@ const er = (s) => s instanceof c || Array.isArray(s) && s.every((e) => e instanc
     }
   return i;
 };
-function Be(s) {
+function Ee(s) {
   try {
     const e = new URL(s);
     return e.protocol === "http:" || e.protocol === "https:";
@@ -2920,7 +2920,7 @@ class ks {
    * @returns The processed document
    */
   process(e) {
-    return B.transform(e, this.inferType.bind(this));
+    return w.transform(e, this.inferType.bind(this));
   }
   /**
    * Infer a basic type for a node
@@ -2929,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 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;
+    return m(t) && d(r) && (typeof r == "string" ? e.setType(new c().setBlueId(_)) : typeof r == "bigint" || Z(r) ? e.setType(new c().setBlueId(j)) : We(r) ? e.setType(new c().setBlueId(L)) : typeof r == "boolean" && e.setType(new c().setBlueId(U))), e;
   }
 }
-class Ve {
+class Re {
   static MAPPINGS = "mappings";
   mappings = /* @__PURE__ */ new Map();
   /**
@@ -2942,8 +2942,8 @@ class Ve {
   constructor(e) {
     if (e instanceof c) {
       const r = e.getProperties();
-      if (r && r[Ve.MAPPINGS]) {
-        const i = r[Ve.MAPPINGS].getProperties();
+      if (r && r[Re.MAPPINGS]) {
+        const i = r[Re.MAPPINGS].getProperties();
         i && Object.entries(i).forEach(([o, l]) => {
           const a = l.getValue();
           typeof a == "string" && this.mappings.set(o, a);
@@ -2958,7 +2958,7 @@ class Ve {
    * @returns The processed document
    */
   process(e) {
-    return B.transform(e, this.transformNode.bind(this));
+    return w.transform(e, this.transformNode.bind(this));
   }
   transformNode(e) {
     const t = e.clone();
@@ -2985,7 +2985,7 @@ class Ks {
    * @throws Error if any inline type values remain without BlueId mappings
    */
   process(e) {
-    return B.transform(e, this.validateNode.bind(this)), e;
+    return w.transform(e, this.validateNode.bind(this)), e;
   }
   validateNode(e) {
     return this.validateTypeField(e, e.getType(), "type"), this.validateTypeField(e, e.getItemType(), "itemType"), this.validateTypeField(e, e.getKeyType(), "keyType"), this.validateTypeField(e, e.getValueType(), "valueType"), e;
@@ -3051,11 +3051,11 @@ class ft {
       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 f = 0; f < d.length; f++)
-          this.extendNode(d[f], t, String(f), !1);
+      const p = e.getItems();
+      if (p && p.length > 0) {
+        this.reconstructList(p);
+        for (let f = 0; f < p.length; f++)
+          this.extendNode(p[f], t, String(f), !1);
       }
     } finally {
       n || t.exitPathSegment();
@@ -3090,7 +3090,7 @@ class ft {
   mergeNodes(e, t) {
     e.setName(t.getName()), e.setDescription(t.getDescription()), e.setType(t.getType()), e.setItemType(t.getItemType()), e.setKeyType(t.getKeyType()), e.setValueType(t.getValueType());
     const r = t.getValue();
-    p(r) && e.setValue(r), e.setItems(t.getItems()), e.setProperties(t.getProperties());
+    d(r) && e.setValue(r), e.setItems(t.getItems()), e.setProperties(t.getProperties());
   }
 }
 class yt {
@@ -3206,7 +3206,7 @@ class ie {
     if (!n && t && (n = t.clone()), n) {
       new ft(this.nodeProvider).extend(
         n,
-        $e.withSinglePath("/*")
+        Le.withSinglePath("/*")
       );
       const i = n.getItems();
       if (i && i.length > 0) {
@@ -3236,7 +3236,7 @@ class ie {
       getProcessor(e) {
         const t = "27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo", r = "FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4", n = e.getType()?.getBlueId();
         if (t === n)
-          return new Ve(
+          return new Re(
             e
           );
         if (r === n)
@@ -3325,10 +3325,10 @@ class gt extends Qt {
       (o) => o
     ), i = t || n.blueId;
     this.blueIdToContentMap.set(i, n.content), this.blueIdToMultipleDocumentsMap.set(i, !0), r.forEach((o, l) => {
-      const a = `${i}#${l}`, u = m.get(o), y = T.calculateBlueIdSync(o);
+      const a = `${i}#${l}`, u = I.get(o), y = T.calculateBlueIdSync(o);
       this.blueIdToContentMap.set(y, u), this.blueIdToMultipleDocumentsMap.set(y, !1);
-      const d = o.getName();
-      d && this.addToNameMap(d, a);
+      const p = o.getName();
+      p && this.addToNameMap(p, a);
     });
   }
   fetchContentByBlueId(e) {
@@ -3366,7 +3366,7 @@ class he {
       const n = new gt(t);
       r.push(n);
     }
-    return r.push(e), new Ds(r);
+    return r.push(e), new Ms(r);
   }
 }
 class Ys {
@@ -3393,9 +3393,9 @@ class Ys {
       const r = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(r, t);
-      if (Se.isPotentialBlueId(t))
+      if (Ce.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      throw Be(t) ? new Error(
+      throw Ee(t) ? new Error(
         `URL '${t}' detected. Use the async version of this method to fetch the content.`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -3413,9 +3413,9 @@ class Ys {
       const r = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(r, t);
-      if (Se.isPotentialBlueId(t))
+      if (Ce.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      if (Be(t) && this.urlContentFetcher)
+      if (Ee(t) && this.urlContentFetcher)
         try {
           const n = await this.fetchFromUrl(t);
           return n && r.setBlue(new c().setItems(n)), r;
@@ -3425,7 +3425,7 @@ class Ys {
 ${n.message}`
           ) : n;
         }
-      else throw Be(t) ? new Error(
+      else throw Ee(t) ? new Error(
         `UrlContentFetcher not provided for URL: ${t}`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -3528,7 +3528,7 @@ class Gs {
     this.fetchStrategy = e || zs;
   }
   validateUrl(e) {
-    if (!Be(e))
+    if (!Ee(e))
       throw new Error(`Invalid URL: ${e}`);
     return !0;
   }
@@ -3685,14 +3685,14 @@ class Ws extends Js {
     );
   }
   mergeWithContext(e, t, r) {
-    if (p(t.getBlue()))
+    if (d(t.getBlue()))
       throw new Error(
         'Document contains "blue" attribute. Preprocess document before merging.'
       );
     let n = e;
     const i = t.getType();
-    if (p(i)) {
-      const o = this.resolveTypeNode(i, r), l = o.clone().setType(void 0);
+    if (d(i)) {
+      const o = this.resolveTypeNode(i, r), l = o.clone().setType(void 0).setBlueId(void 0);
       n = this.mergeObject(n, l, r);
       const a = t.cloneShallow().setType(o.clone());
       return this.mergeObject(n, a, r);
@@ -3714,9 +3714,9 @@ class Ws extends Js {
       r.nodeProvider
     );
     const o = t.getItems();
-    p(o) && (i = this.mergeChildren(i, o, r));
+    d(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(
+    return d(l) && (i = this.mergeProperties(i, l, r)), d(t.getBlueId()) && (i = i.cloneShallow().setBlueId(t.getBlueId())), this.mergingProcessor.postProcess && (i = this.mergingProcessor.postProcess(
       i,
       t,
       r.nodeProvider
@@ -3730,49 +3730,141 @@ class Ws extends Js {
    * @returns A new BlueNode with the merged children
    */
   mergeChildren(e, t, r) {
-    const n = e.getItems();
-    if (I(n)) {
-      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);
+    const n = e.getItems(), i = d(n) || this.isInheritedListMarkerNode(t[0]) ? this.getInheritedItemsPrefixLength(
+      t,
+      n ?? [],
+      r
+    ) : void 0;
+    if (this.rememberInheritedItemsPrefix(
+      t,
+      i,
+      r
+    ), m(n)) {
+      const l = [];
+      for (let a = 0; a < t.length; a++) {
+        const u = t[a];
+        if (r.limits.shouldMergePathSegment(String(a), u)) {
+          this.enterPathSegment(r, String(a), u);
           try {
-            const u = a.isResolved() && this.canReuseResolvedSubtree(r) ? a.clone() : this.resolveWithContext(a, r);
-            o.push(u);
+            const y = this.materializeForCurrentContext(
+              u,
+              r
+            );
+            l.push(y);
           } finally {
             this.exitPathSegment(r);
           }
         }
       }
-      return e.cloneShallow().setItems(o);
-    } else if (t.length < n.length)
+      return e.cloneShallow().setItems(l);
+    }
+    if (d(i)) {
+      const l = this.mergeChildrenWithInheritedItemsPrefix(
+        t,
+        n,
+        i,
+        r
+      );
+      return e.cloneShallow().setItems(l);
+    }
+    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.limits.shouldMergePathSegment(String(o), t[o])) {
-        this.enterPathSegment(r, String(o), t[o]);
+    const o = [...n];
+    for (let l = 0; l < t.length; l++)
+      if (r.limits.shouldMergePathSegment(String(l), t[l])) {
+        this.enterPathSegment(r, String(l), t[l]);
         try {
-          if (o >= i.length) {
-            i.push(t[o]);
+          if (l >= o.length) {
+            const y = this.materializeForCurrentContext(
+              t[l],
+              r
+            );
+            o.push(y);
             continue;
           }
-          const l = T.calculateBlueIdSync(
-            t[o]
-          ), a = T.calculateBlueIdSync(
-            i[o]
+          const a = T.calculateBlueIdSync(
+            t[l]
+          ), u = T.calculateBlueIdSync(
+            o[l]
           );
-          if (l !== a)
+          if (a !== u)
             throw new Error(
-              `Mismatched items at index ${o}: source item has blueId '${l}', but target item has blueId '${a}'.`
+              `Mismatched items at index ${l}: source item has blueId '${a}', but target item has blueId '${u}'.`
             );
         } finally {
           this.exitPathSegment(r);
         }
       }
-    return e.cloneShallow().setItems(i);
+    return e.cloneShallow().setItems(o);
+  }
+  /**
+   * `reverse()` may encode an inherited list as:
+   *   [ { blueId: BlueId(inheritedItems[]) }, ...appendedItems ]
+   * When that marker is present, `resolve` should keep all inherited target
+   * items and append only explicit source suffix items.
+   */
+  getInheritedItemsPrefixLength(e, t, r) {
+    const n = e[0], i = n?.getBlueId();
+    if (m(i))
+      return;
+    let o;
+    if (t.length > 0) {
+      const l = T.calculateBlueIdSync(t);
+      i === l && (o = t.length);
+    }
+    if (m(o)) {
+      const l = r.inheritedItemsPrefixByPath.get(
+        this.getCurrentPointer(r)
+      );
+      d(l) && l.blueId === i && (o = l.length);
+    }
+    if (!m(o)) {
+      if (!this.isInheritedListMarkerNode(n)) {
+        if (e.length > 1)
+          throw new Error(
+            "Invalid inherited-list marker: first list item must contain only blueId."
+          );
+        return;
+      }
+      return o;
+    }
+  }
+  rememberInheritedItemsPrefix(e, t, r) {
+    const n = this.getCurrentPointer(r);
+    if (e.length === 0)
+      return;
+    const i = e[0], l = this.isInheritedListMarkerNode(i) ? d(t) ? t + e.length - 1 : void 0 : e.length;
+    if (m(l))
+      return;
+    const a = {
+      blueId: T.calculateBlueIdSync(e),
+      length: l
+    }, u = r.inheritedItemsPrefixByPath.get(n);
+    d(u) && u.length >= a.length || r.inheritedItemsPrefixByPath.set(n, a);
+  }
+  isInheritedListMarkerNode(e) {
+    return d(e) && d(e.getBlueId()) && _e.hasBlueIdOnly(e);
+  }
+  mergeChildrenWithInheritedItemsPrefix(e, t, r, n) {
+    const i = [...t];
+    for (let o = 1; o < e.length; o++) {
+      const l = e[o], a = String(r + o - 1);
+      if (n.limits.shouldMergePathSegment(a, l)) {
+        this.enterPathSegment(n, a, l);
+        try {
+          const u = this.materializeForCurrentContext(
+            l,
+            n
+          );
+          i.push(u);
+        } finally {
+          this.exitPathSegment(n);
+        }
+      }
+    }
+    return i;
   }
   /**
    * Merges source properties into target using copy-on-write for properties map
@@ -3788,14 +3880,33 @@ class Ws extends Js {
       if (r.limits.shouldMergePathSegment(l, a)) {
         this.enterPathSegment(r, l, a);
         try {
-          const u = a.isResolved() && this.canReuseResolvedSubtree(r) ? a.clone() : 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);
+          const u = i[l], p = this.shouldMergePropertyWithoutPreResolve(
+            u,
+            a,
+            r
+          ) ? this.mergeWithContext(u, a, r) : (() => {
+            const f = this.materializeForCurrentContext(
+              a,
+              r
+            );
+            return u === void 0 ? f : this.mergeObject(u, f, r);
+          })();
+          p !== u && (o || (i = { ...n }, o = !0), i[l] = p);
         } finally {
           this.exitPathSegment(r);
         }
       }
     return o ? e.cloneShallow().setProperties(i) : e;
   }
+  /**
+   * Under path-limited resolution, pre-resolving list-like source properties
+   * compacts indexes and may overwrite inherited-prefix metadata for the current
+   * pointer. Merge unresolved source to preserve index semantics, but still
+   * through mergeWithContext so source type overlays are resolved.
+   */
+  shouldMergePropertyWithoutPreResolve(e, t, r) {
+    return m(e) || r.limits instanceof we ? !1 : d(t.getItems()) || d(e.getItems());
+  }
   /**
    * Resolves a node by creating a new node and merging the source into it
    * @param node - The node to resolve
@@ -3814,14 +3925,15 @@ class Ws extends Js {
       limits: e,
       nodeProvider: this.nodeProvider,
       resolvedTypeCache: /* @__PURE__ */ new Map(),
+      inheritedItemsPrefixByPath: /* @__PURE__ */ new Map(),
       pathStack: []
     };
   }
   resolveTypeNode(e, t) {
     const r = e.getBlueId();
-    if (p(r)) {
+    if (d(r)) {
       const n = this.createResolvedTypeCacheKey(r, t), i = t.resolvedTypeCache.get(n);
-      if (p(i))
+      if (d(i))
         return i;
       const o = this.resolveAndExtendTypeNode(e, t);
       return t.resolvedTypeCache.set(n, o), o;
@@ -3830,16 +3942,19 @@ class Ws extends Js {
   }
   resolveAndExtendTypeNode(e, t) {
     const r = e.clone();
-    return p(r.getBlueId()) && new ft(t.nodeProvider).extend(
+    return d(r.getBlueId()) && new ft(t.nodeProvider).extend(
       r,
-      $e.withSinglePath("/")
+      Le.withSinglePath("/")
     ), this.resolveWithContext(r, t);
   }
   createResolvedTypeCacheKey(e, t) {
-    return t.limits instanceof Xe ? e : `${e}|${this.getCurrentPointer(t)}`;
+    return t.limits instanceof we ? e : `${e}|${this.getCurrentPointer(t)}`;
+  }
+  materializeForCurrentContext(e, t) {
+    return e.isResolved() && this.canReuseResolvedSubtree(t) ? e.clone() : this.resolveWithContext(e, t);
   }
   canReuseResolvedSubtree(e) {
-    return e.limits instanceof Xe;
+    return e.limits instanceof we;
   }
   getCurrentPointer(e) {
     return e.pathStack.length === 0 ? "/" : `/${e.pathStack.join("/")}`;
@@ -3879,9 +3994,9 @@ class tr {
 class rr {
   process(e, t) {
     const r = t.getValue();
-    if (p(r)) {
+    if (d(r)) {
       const n = e.getValue();
-      if (I(n))
+      if (m(n))
         return e.cloneShallow().setValue(r);
       if (!Zs(r, n))
         throw new Error(
@@ -3891,7 +4006,7 @@ class rr {
     return e;
   }
 }
-const Zs = (s, e) => Z(s) && Z(e) || Ge(s) && Ge(e) ? s.eq(e) : s === e;
+const Zs = (s, e) => Z(s) && Z(e) || We(s) && We(e) ? s.eq(e) : s === e;
 class sr {
   process(e, t, r) {
     const n = e.getType(), i = t.getType();
@@ -3899,12 +4014,12 @@ class sr {
     if (n === void 0)
       o = e.cloneShallow().setType(i);
     else if (i !== void 0) {
-      if (!w(
+      if (!b(
         i,
         n,
         r
       )) {
-        const a = m.get(i), u = m.get(n);
+        const a = I.get(i), u = I.get(n);
         throw new Error(
           `The source type '${JSON.stringify(
             a
@@ -3928,15 +4043,15 @@ class nr {
     if (o === void 0)
       n !== void 0 && (l = e.cloneShallow().setItemType(n));
     else if (n !== void 0) {
-      if (!w(
+      if (!b(
         n,
         o,
         r
       )) {
-        const d = m.get(n), f = m.get(o);
+        const p = I.get(n), f = I.get(o);
         throw new Error(
           `The source item type '${JSON.stringify(
-            d
+            p
           )}' is not a subtype of the target item type '${JSON.stringify(
             f
           )}'.`
@@ -3947,13 +4062,13 @@ class nr {
     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 && !w(
-          d,
+        const p = y.getType();
+        if (p !== void 0 && !b(
+          p,
           a,
           r
         )) {
-          const f = m.get(d), v = m.get(
+          const f = I.get(p), v = I.get(
             a
           );
           throw new Error(
@@ -3978,8 +4093,8 @@ class ir {
     let l = this.processKeyType(e, t, r);
     l = this.processValueType(l, t, r);
     const a = l.getKeyType(), u = l.getValueType(), y = t.getProperties();
-    return (a !== void 0 || u !== void 0) && y !== void 0 && Object.entries(y).forEach(([d, f]) => {
-      a !== void 0 && this.validateKeyType(d, a, r), u !== void 0 && this.validateValueType(f, u, r);
+    return (a !== void 0 || u !== void 0) && y !== void 0 && Object.entries(y).forEach(([p, f]) => {
+      a !== void 0 && this.validateKeyType(p, a, r), u !== void 0 && this.validateValueType(f, u, r);
     }), l;
   }
   processKeyType(e, t, r) {
@@ -3988,12 +4103,12 @@ class ir {
       if (i !== void 0)
         return this.validateBasicKeyType(i, r), e.cloneShallow().setKeyType(i);
     } else if (i !== void 0) {
-      if (this.validateBasicKeyType(i, r), !w(
+      if (this.validateBasicKeyType(i, r), !b(
         i,
         n,
         r
       )) {
-        const l = m.get(i), a = m.get(n);
+        const l = I.get(i), a = I.get(n);
         throw new Error(
           `The source key type '${JSON.stringify(
             l
@@ -4012,12 +4127,12 @@ class ir {
       if (i !== void 0)
         return e.cloneShallow().setValueType(i);
     } else if (i !== void 0) {
-      if (!w(
+      if (!b(
         i,
         n,
         r
       )) {
-        const l = m.get(i), a = m.get(n);
+        const l = I.get(i), a = I.get(n);
         throw new Error(
           `The source value type '${JSON.stringify(
             l
@@ -4054,8 +4169,8 @@ class ir {
   }
   validateValueType(e, t, r) {
     const n = e.getType();
-    if (n !== void 0 && !w(n, t, r)) {
-      const i = m.get(n), o = m.get(t);
+    if (n !== void 0 && !b(n, t, r)) {
+      const i = I.get(n), o = I.get(t);
       throw new Error(
         `Value of type '${JSON.stringify(
           i
@@ -4090,10 +4205,10 @@ 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.cloneShallow().setName(n));
-    const o = t.getDescription(), l = r.getDescription();
-    return o !== void 0 && l === void 0 && (r = r.cloneShallow().setDescription(o)), r;
+    const n = t.getName();
+    n !== void 0 && n !== e.getName() && (r = r.cloneShallow().setName(n));
+    const i = t.getDescription();
+    return i !== void 0 && i !== r.getDescription() && (r = r.cloneShallow().setDescription(i)), r;
   }
 }
 const ti = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
@@ -4121,7 +4236,7 @@ class Xs {
   blueIdToInlineValue = /* @__PURE__ */ new Map();
   constructor(e) {
     const { nodeProvider: t, blueIdsMappingGenerator: r } = e;
-    this.nodeProvider = t, Object.entries(xe).forEach(([i, o]) => {
+    this.nodeProvider = t, Object.entries(Fe).forEach(([i, o]) => {
       this.blueIdToInlineValue.set(i, o);
     });
     const n = r.getAllBlueIds();
@@ -4133,7 +4248,7 @@ class Xs {
    * Returns a new BlueNode where all type references are restored to inline values when possible.
    */
   restore(e) {
-    return B.transform(
+    return w.transform(
       e,
       (t) => this.restoreNode(t)
     );
@@ -4215,7 +4330,7 @@ class qs {
     return e;
   }
   getTypeAlias(e) {
-    const t = this.toCurrentBlueId(e), r = xe[t];
+    const t = this.toCurrentBlueId(e), r = Fe[t];
     if (r)
       return r;
     for (const n of this.runtimes) {
@@ -4315,7 +4430,7 @@ function on(s, e) {
   s.schemas.push(...Object.values(e.schemas));
 }
 function ln(s, e, t, r) {
-  if (s.status === rt)
+  if (s.status === st)
     return an(s, e, t, r), {
       ...s,
       versions: s.versions ? [...s.versions] : s.versions
@@ -4351,7 +4466,7 @@ function ln(s, e, t, r) {
   };
 }
 function an(s, e, t, r) {
-  if (s.status === rt) {
+  if (s.status === st) {
     if (s.versions && s.versions.length > 1)
       throw new Error(
         `Dev type ${r}/${s.name} (${t}) must not declare multiple versions`
@@ -4401,17 +4516,17 @@ function dn(s, e, t) {
 function pn(s, e) {
   if (s === e) return !0;
   if (s === null || e === null || typeof s != "object" || typeof e != "object") return !1;
-  const t = Je.canonicalize(s), r = Je.canonicalize(e);
+  const t = Ze.canonicalize(s), r = Ze.canonicalize(e);
   return t !== void 0 && t === r;
 }
-class Re extends Error {
+class Oe extends Error {
   code;
   details;
   constructor(e, t, r) {
     super(t), this.code = e, this.details = r && r.length > 0 ? r : [], this.name = "BlueError";
   }
 }
-const D = {
+const M = {
   REPO_UNKNOWN_REPO_BLUE_ID: "REPO_UNKNOWN_REPO_BLUE_ID",
   REPO_UNREPRESENTABLE_IN_TARGET_VERSION: "REPO_UNREPRESENTABLE_IN_TARGET_VERSION",
   INVALID_BLUE_CONTEXT_REPOSITORIES: "INVALID_BLUE_CONTEXT_REPOSITORIES",
@@ -4421,7 +4536,7 @@ const D = {
   "constructor",
   "prototype"
 ]);
-function Bt(s) {
+function wt(s) {
   const e = s.at(0), t = s.at(-1);
   return !e || !t ? s : e === "'" && t === "'" || e === '"' && t === '"' ? s.slice(1, -1) : s;
 }
@@ -4431,7 +4546,7 @@ function fn(s, e) {
     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 = wt(s.slice(0, t).trim()), n = wt(s.slice(t + 1).trim());
   if (!r)
     throw re(e, "Repository name is empty");
   if (!n)
@@ -4455,12 +4570,12 @@ function gn(s) {
   return typeof s == "string" ? yn(s) : s;
 }
 function re(s, e) {
-  return new Re(
-    D.INVALID_BLUE_CONTEXT_REPOSITORIES,
+  return new Oe(
+    M.INVALID_BLUE_CONTEXT_REPOSITORIES,
     `Invalid BlueContext repositories value: ${e}`,
     [
       {
-        code: D.INVALID_BLUE_CONTEXT_REPOSITORIES,
+        code: M.INVALID_BLUE_CONTEXT_REPOSITORIES,
         message: e,
         locationPath: [],
         context: {
@@ -4488,7 +4603,7 @@ function In(s, e) {
 function Et(s) {
   return Ot(s).length;
 }
-const Tn = /* @__PURE__ */ new Set([...st]), b = {
+const Tn = /* @__PURE__ */ new Set([...nt]), B = {
   core: "core",
   noRuntime: "no-runtime",
   noTargetContext: "no-target-context",
@@ -4504,7 +4619,7 @@ class vn {
     this.registry = e.registry, this.targetRepoVersionIndexes = e.targetRepoVersionIndexes, this.fallbackToCurrentInlineDefinitions = e.fallbackToCurrentInlineDefinitions;
   }
   transform(e) {
-    return B.transform(
+    return w.transform(
       e,
       (t) => this.transformNode(t)
     );
@@ -4534,11 +4649,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(
@@ -4547,34 +4662,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,
@@ -4582,11 +4697,11 @@ class vn {
         typeAlias: r
       };
     const o = n.typeMeta;
-    if (o.status === rt) {
-      const d = n.runtime.repositoryVersions.length - 1;
-      if (i !== d)
+    if (o.status === st) {
+      const p = n.runtime.repositoryVersions.length - 1;
+      if (i !== p)
         return {
-          kind: b.unrepresentable,
+          kind: B.unrepresentable,
           currentBlueId: t,
           error: this.unrepresentableError(
             t,
@@ -4599,7 +4714,7 @@ class vn {
         };
       const f = o.versions?.[0];
       return {
-        kind: b.representable,
+        kind: B.representable,
         currentBlueId: t,
         targetBlueId: f?.typeBlueId ?? t,
         dropPointers: []
@@ -4608,7 +4723,7 @@ class vn {
     const l = o.versions || [];
     if (l.length === 0)
       return {
-        kind: b.unrepresentable,
+        kind: B.unrepresentable,
         currentBlueId: t,
         error: this.unrepresentableError(
           t,
@@ -4622,7 +4737,7 @@ class vn {
     const a = l[0].repositoryVersionIndex;
     if (i < a)
       return {
-        kind: b.unrepresentable,
+        kind: B.unrepresentable,
         currentBlueId: t,
         error: this.unrepresentableError(
           t,
@@ -4634,11 +4749,11 @@ class vn {
         )
       };
     let u = l[0].typeBlueId;
-    for (const d of l)
-      d.repositoryVersionIndex <= i && (u = d.typeBlueId);
+    for (const p of l)
+      p.repositoryVersionIndex <= i && (u = p.typeBlueId);
     const y = o.status === ae ? this.getDropPointers(o, i) : [];
     return {
-      kind: b.representable,
+      kind: B.representable,
       currentBlueId: t,
       targetBlueId: u,
       dropPointers: y
@@ -4731,7 +4846,7 @@ class vn {
     try {
       const o = g.deserialize(i);
       o.setBlueId(void 0);
-      const l = B.transform(
+      const l = w.transform(
         o,
         (a) => this.transformNode(a)
       );
@@ -4742,9 +4857,9 @@ class vn {
   }
   invalidPointerError(e) {
     const t = `Invalid attributesAdded pointer '${e}'.`;
-    return new Re(D.INVALID_REPOSITORY_POINTER, t, [
+    return new Oe(M.INVALID_REPOSITORY_POINTER, t, [
       {
-        code: D.INVALID_REPOSITORY_POINTER,
+        code: M.INVALID_REPOSITORY_POINTER,
         message: t,
         locationPath: [],
         context: { pointer: e }
@@ -4763,20 +4878,20 @@ class vn {
       y !== void 0 && (a.typeIntroducedInRepoBlueId = r?.repositoryVersions[y]);
     }
     const u = {
-      code: D.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
+      code: M.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
       message: t,
       locationPath: [W],
       context: a
     };
-    return new Re(
-      D.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
+    return new Oe(
+      M.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
       t,
       [u]
     );
   }
 }
-function qe(s, e) {
-  return e ? B.transform(s, (t) => (ve(
+function Qe(s, e) {
+  return e ? w.transform(s, (t) => (ve(
     () => t.getType(),
     (r) => t.setType(r),
     e
@@ -4804,7 +4919,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) {
@@ -4814,7 +4929,7 @@ class bn {
     const r = this.computeTargetRepoVersionIndexes(t);
     if (Object.keys(r).length === 0)
       return e;
-    const n = qe(e, this.blueIdMapper);
+    const n = Qe(e, this.blueIdMapper);
     return new vn({
       registry: this.registry,
       targetRepoVersionIndexes: r,
@@ -4843,7 +4958,7 @@ class bn {
   }
   unknownRepoBlueIdError(e, t, r) {
     const n = `Unknown RepoBlueId '${t}' for repository '${e}'.`, i = {
-      code: D.REPO_UNKNOWN_REPO_BLUE_ID,
+      code: M.REPO_UNKNOWN_REPO_BLUE_ID,
       message: n,
       locationPath: [],
       context: {
@@ -4852,7 +4967,7 @@ class bn {
         serverRepoBlueId: r
       }
     };
-    return new Re(D.REPO_UNKNOWN_REPO_BLUE_ID, n, [
+    return new Oe(M.REPO_UNKNOWN_REPO_BLUE_ID, n, [
       i
     ]);
   }
@@ -4876,11 +4991,11 @@ 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(() => []);
+    const l = Ns(() => []);
     this.nodeProvider = he.wrap(
       t || l,
       i
@@ -4904,7 +5019,7 @@ class ri {
    */
   nodeToJson(e, t = "official") {
     const r = this.normalizeNodeToJsonOptions(t), n = r.blueContext ? this.blueContextResolver.transform(e, r.blueContext) : e;
-    return m.get(n, r.format);
+    return I.get(n, r.format);
   }
   /**
    * Converts a BlueNode to a deterministic YAML string. Uses nodeToJson under the hood
@@ -4915,7 +5030,7 @@ class ri {
     return Os.get(n, { strategy: r.format });
   }
   nodeToSchemaOutput(e, t) {
-    return new Ns(this.typeSchemaResolver).convert(e, t);
+    return new Ps(this.typeSchemaResolver).convert(e, t);
   }
   resolve(e, t = K) {
     const r = this.combineWithGlobalLimits(t);
@@ -4954,13 +5069,13 @@ class ri {
   }
   jsonValueToNode(e) {
     const t = this.preprocess(g.deserialize(e));
-    return qe(t, this.repositoryRegistry);
+    return Qe(t, this.repositoryRegistry);
   }
   async jsonValueToNodeAsync(e) {
     const t = await this.preprocessAsync(
       g.deserialize(e)
     );
-    return qe(t, this.repositoryRegistry);
+    return Qe(t, this.repositoryRegistry);
   }
   yamlToNode(e) {
     const t = $(e);
@@ -4986,6 +5101,21 @@ class ri {
     const t = this.prepareForBlueIdCalculationSync(e);
     return T.calculateBlueIdSync(t);
   }
+  /**
+   * Resolves a type alias by BlueId.
+   *
+   * For core types this returns inline aliases such as `Text`.
+   * For repository-backed types this resolves historical BlueIds to current aliases
+   * and returns values in `Package/Type` format.
+   *
+   * @param blueId - Type BlueId to resolve.
+   * @returns The resolved type alias or `undefined` when the input is empty or unknown.
+   */
+  getTypeAliasByBlueId(e) {
+    const t = e?.trim();
+    if (t)
+      return this.repositoryRegistry.getTypeAlias(t);
+  }
   addPreprocessingAliases(e) {
     this.blueDirectivePreprocessor.addPreprocessingAliases(e);
   }
@@ -5004,7 +5134,7 @@ class ri {
     }).preprocessWithDefaultBlue(t);
   }
   transform(e, t) {
-    return B.transform(e, t);
+    return w.transform(e, t);
   }
   getNodeProvider() {
     return this.nodeProvider;
@@ -5154,7 +5284,7 @@ class ri {
     if (!n)
       return !1;
     const i = new c().setBlueId(r);
-    return w(n, i, this.nodeProvider);
+    return b(n, i, this.nodeProvider);
   }
   /**
    * Checks if a BlueNode matches a BlueNode type.
@@ -5191,7 +5321,7 @@ class ri {
     };
   }
   combineWithGlobalLimits(e) {
-    return this.globalLimits == K ? e : e == K ? this.globalLimits : _e.of(this.globalLimits, e);
+    return this.globalLimits == K ? e : e == K ? this.globalLimits : je.of(this.globalLimits, e);
   }
 }
 class si extends Qt {
@@ -5204,7 +5334,7 @@ class si extends Qt {
     this.preprocessor = (r) => t.preprocessWithDefaultBlue(r), e.forEach((r) => this.processNode(r));
   }
   processNode(e) {
-    dt.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
+    _e.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
   }
   processSingleNode(e) {
     const t = z.parseAndCalculateBlueIdForNode(
@@ -5232,7 +5362,7 @@ class si extends Qt {
     });
   }
   processNodeList(e) {
-    const t = T.calculateBlueIdSync(e), r = e.map((n) => m.get(n));
+    const t = T.calculateBlueIdSync(e), r = e.map((n) => I.get(n));
     this.blueIdToContentMap.set(t, r), this.blueIdToMultipleDocumentsMap.set(t, !0);
   }
   fetchContentByBlueId(e) {
@@ -5328,30 +5458,30 @@ export {
   kn as BlueIdToCid,
   c as BlueNode,
   A as BlueNodeTypeSchema,
-  Je as JsonCanonicalizer,
+  Ze as JsonCanonicalizer,
   pt as Limits,
   Ws as Merger,
   ti as MergingProcessors,
   Js as NodeResolver,
-  dt as Nodes,
+  _e as Nodes,
   On as Properties,
   ne as ResolvedBlueNode,
   ds as TypeSchemaResolver,
   Kn as applyBlueNodePatch,
-  Fe as baseBlueObjectSchema,
+  $e as baseBlueObjectSchema,
   Yn as blueDescriptionField,
   zn as blueIdField,
-  Dn as blueIdSchema,
+  Mn as blueIdSchema,
   Gn as blueNameField,
   Jn as blueNodeField,
   Fn as blueObjectBooleanValueSchema,
   xn as blueObjectNumberValueSchema,
   de as blueObjectSchema,
   $n as blueObjectStringListItemsSchema,
-  Mn as blueObjectStringValueSchema,
-  Ls as calculateBlueId,
+  Dn as blueObjectStringValueSchema,
+  js as calculateBlueId,
   Zn as calculateBlueIdSync,
-  bt as enrichWithBlueId,
+  Bt as enrichWithBlueId,
   Wr as getBlueDescriptionAnnotation,
   Xr as getBlueIdAnnotation,
   Qr as getBlueNameAnnotation,
@@ -5361,25 +5491,25 @@ export {
   Qn as getBlueObjectTypeLabel,
   Xn as getBlueObjectValue,
   ss as getTypeBlueIdAnnotation,
-  Nr as hasBlueObjectBlueIdDefined,
-  Pr as hasBlueObjectItemsDefined,
-  jn as hasBlueObjectNameDefined,
+  Pr as hasBlueObjectBlueIdDefined,
+  Nr as hasBlueObjectItemsDefined,
+  Ln as hasBlueObjectNameDefined,
   Sr as hasBlueObjectTypeDefined,
   Cr as hasBlueObjectValueDefined,
-  Ge as isBigDecimalNumber,
+  We as isBigDecimalNumber,
   Z as isBigIntegerNumber,
   C as isBigNumber,
   Gt as isBlueNodeSchema,
   _n as isBlueObject,
   Us as isBlueObjectResolved,
-  Ln as isGivenBlueObjectTypeSchema,
-  Lt as isJsonBlueArray,
-  jt as isJsonBlueObject,
+  jn as isGivenBlueObjectTypeSchema,
+  jt as isJsonBlueArray,
+  Lt as isJsonBlueObject,
   Un as isJsonBlueValue,
-  Be as isUrl,
-  Ce as jsonBlueValueSchema,
+  Ee as isUrl,
+  Ae as jsonBlueValueSchema,
   ei as normalizeToBlueObject,
-  wt as resolveBlueObjectItems,
+  bt as resolveBlueObjectItems,
   Jr as withBlueDescription,
   Hr as withBlueId,
   qr as withBlueName,