@blue-labs/language 4.0.0-rc.4 → 4.0.1

package/dist/index.mjs

@@ -1,14 +1,14 @@
 import G from "big.js";
-import { isNullable as v, isNonNullable as p, jsonPrimitiveSchema as jr, isReadonlyArray as Gt, isJsonPrimitive as Jt, isPreciseNumberString as Zt } from "@blue-labs/shared-utils";
-import { z as y, ZodOptional as Xt, ZodNullable as qt, ZodReadonly as Qt, ZodBranded as er, ZodEffects as Ge, ZodLazy as Je, ZodString as ge, ZodNumber as me, ZodBoolean as ze, ZodBigInt as Ke, ZodEnum as Fr, ZodNativeEnum as Ur, ZodIntersection as zr, ZodUnion as Kr, ZodObject as kr, ZodRecord as Hr } from "zod";
+import { isNullable as I, isNonNullable as d, jsonPrimitiveSchema as Vr, isReadonlyArray as Kt, isJsonPrimitive as Ht, isPreciseNumberString as kt } from "@blue-labs/shared-utils";
+import { z as f, ZodOptional as Yt, ZodNullable as Wt, ZodReadonly as Gt, ZodBranded as Jt, ZodEffects as Ye, ZodLazy as We, ZodString as ye, ZodNumber as ge, ZodBoolean as je, ZodBigInt as Ue, ZodEnum as Or, ZodNativeEnum as Mr, ZodIntersection as Dr, ZodUnion as Lr, ZodObject as $r, ZodRecord as _r } from "zod";
 import Ae from "bs58";
-import { isObject as tr, isArray as rr, isString as St, omit as sr, pascal as Yr, map as Wr } from "radash";
-import { OBJECT_CONTRACTS as z, OBJECT_MERGE_POLICY as bt, OBJECT_SCHEMA as ir, BLUE_REPOSITORY_STATUS_STABLE as Ce, BLUE_REPOSITORY_STATUS_DEV as Et, validateAttributesAddedPointer as Gr, parsePointer as nr } from "@blue-labs/repository-contract";
-import { sha256 as Jr } from "js-sha256";
-import at from "crypto";
-import Zr from "base32.js";
-import pe from "js-yaml";
-class $ extends G {
+import { isObject as Zt, isArray as Xt, isString as vt, omit as qt, pascal as xr, map as Fr } from "radash";
+import { OBJECT_CONTRACTS as U, OBJECT_MERGE_POLICY as Tt, OBJECT_SCHEMA as Qt, BLUE_REPOSITORY_STATUS_STABLE as Ne, BLUE_REPOSITORY_STATUS_DEV as Bt, validateAttributesAddedPointer as jr, parsePointer as er } from "@blue-labs/repository-contract";
+import { sha256 as Ur } from "js-sha256";
+import nt from "crypto";
+import zr from "base32.js";
+import he from "js-yaml";
+class _ extends G {
   constructor(e) {
     super(e);
   }
@@ -18,73 +18,73 @@ class A extends G {
     super(e);
   }
 }
-const ie = "name", ne = "description", K = "type", we = "itemType", Se = "keyType", be = "valueType", W = "value", Y = "items", V = "blueId", Le = "blue", Nt = [
+const ie = "name", ne = "description", z = "type", Pe = "itemType", we = "keyType", Se = "valueType", W = "value", Y = "items", V = "blueId", Le = "blue", Pt = [
   ie,
   ne,
-  K,
+  z,
+  Pe,
   we,
   Se,
-  be,
   W,
   Y,
   V,
   Le
-], or = "Text", lr = "Double", ar = "Integer", cr = "Boolean", ur = "List", dr = "Dictionary", tt = [
-  or,
-  lr,
-  ar,
-  cr
-], Ct = [...tt, ur, dr], Q = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", ee = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", te = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", re = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", rt = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", Rt = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", At = [
+], tr = "Text", rr = "Double", sr = "Integer", ir = "Boolean", nr = "List", or = "Dictionary", qe = [
+  tr,
+  rr,
+  sr,
+  ir
+], wt = [...qe, nr, or], Q = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", ee = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", te = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", re = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", Qe = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", St = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", bt = [
   Q,
   ee,
   te,
   re
-], fe = [
-  ...At,
-  rt,
-  Rt
-], hr = Object.fromEntries(
-  Ct.map((i, e) => [i, fe[e]])
-), st = Object.fromEntries(
-  fe.map((i, e) => [i, Ct[e]])
-), Pn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+], pe = [
+  ...bt,
+  Qe,
+  St
+], lr = Object.fromEntries(
+  wt.map((i, e) => [i, pe[e]])
+), et = Object.fromEntries(
+  pe.map((i, e) => [i, wt[e]])
+), nn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BASIC_TYPES: tt,
-  BASIC_TYPE_BLUE_IDS: At,
-  BOOLEAN_TYPE: cr,
+  BASIC_TYPES: qe,
+  BASIC_TYPE_BLUE_IDS: bt,
+  BOOLEAN_TYPE: ir,
   BOOLEAN_TYPE_BLUE_ID: re,
-  CORE_TYPES: Ct,
-  CORE_TYPE_BLUE_IDS: fe,
-  CORE_TYPE_BLUE_ID_TO_NAME_MAP: st,
-  CORE_TYPE_NAME_TO_BLUE_ID_MAP: hr,
-  DICTIONARY_TYPE: dr,
-  DICTIONARY_TYPE_BLUE_ID: Rt,
-  DOUBLE_TYPE: lr,
+  CORE_TYPES: wt,
+  CORE_TYPE_BLUE_IDS: pe,
+  CORE_TYPE_BLUE_ID_TO_NAME_MAP: et,
+  CORE_TYPE_NAME_TO_BLUE_ID_MAP: lr,
+  DICTIONARY_TYPE: or,
+  DICTIONARY_TYPE_BLUE_ID: St,
+  DOUBLE_TYPE: rr,
   DOUBLE_TYPE_BLUE_ID: ee,
-  INTEGER_TYPE: ar,
+  INTEGER_TYPE: sr,
   INTEGER_TYPE_BLUE_ID: te,
-  LIST_TYPE: ur,
-  LIST_TYPE_BLUE_ID: rt,
+  LIST_TYPE: nr,
+  LIST_TYPE_BLUE_ID: Qe,
   OBJECT_BLUE: Le,
   OBJECT_BLUE_ID: V,
-  OBJECT_CONTRACTS: z,
+  OBJECT_CONTRACTS: U,
   OBJECT_DESCRIPTION: ne,
   OBJECT_ITEMS: Y,
-  OBJECT_ITEM_TYPE: we,
-  OBJECT_KEY_TYPE: Se,
-  OBJECT_MERGE_POLICY: bt,
+  OBJECT_ITEM_TYPE: Pe,
+  OBJECT_KEY_TYPE: we,
+  OBJECT_MERGE_POLICY: Tt,
   OBJECT_NAME: ie,
-  OBJECT_SCHEMA: ir,
-  OBJECT_SPECIFIC_KEYS: Nt,
-  OBJECT_TYPE: K,
+  OBJECT_SCHEMA: Qt,
+  OBJECT_SPECIFIC_KEYS: Pt,
+  OBJECT_TYPE: z,
   OBJECT_VALUE: W,
-  OBJECT_VALUE_TYPE: be,
-  TEXT_TYPE: or,
+  OBJECT_VALUE_TYPE: Se,
+  TEXT_TYPE: tr,
   TEXT_TYPE_BLUE_ID: Q
 }, Symbol.toStringTag, { value: "Module" }));
-class Xr {
+class Kr {
   static get(e, t, r, s = !0) {
-    if (v(t) || !t.startsWith("/"))
+    if (I(t) || !t.startsWith("/"))
       throw new Error(`Invalid path: ${t}`);
     if (t === "/") {
       const o = e.getValue();
@@ -178,7 +178,7 @@ class Xr {
           n = new u().setProperties(l);
           break;
         }
-        case z: {
+        case U: {
           const l = e.getContracts();
           n = new u().setContracts(l);
           break;
@@ -197,7 +197,7 @@ class Xr {
   }
   static link(e, t) {
     const r = t(e);
-    return p(r) ? r : e;
+    return d(r) ? r : e;
   }
 }
 class u {
@@ -255,19 +255,19 @@ class u {
   }
   getValue() {
     const e = this.type?.getBlueId();
-    if (p(e) && p(this.value)) {
+    if (d(e) && d(this.value)) {
       if (e === te && typeof this.value == "string")
         return new A(this.value);
       if (e === ee && typeof this.value == "string") {
-        const t = new $(this.value), r = parseFloat(t.toString());
-        return new $(r.toString());
+        const t = new _(this.value), r = parseFloat(t.toString());
+        return new _(r.toString());
       } else if (e === re && typeof this.value == "string")
         return this.value.toLowerCase() === "true";
     }
     return this.value;
   }
   setValue(e) {
-    return typeof e == "number" ? e % 1 === 0 ? this.value = new A(e.toString()) : this.value = new $(e.toString()) : this.value = e, this;
+    return typeof e == "number" ? e % 1 === 0 ? this.value = new A(e.toString()) : this.value = new _(e.toString()) : this.value = e, this;
   }
   getItems() {
     return this.items;
@@ -291,21 +291,21 @@ class u {
     return this.properties && delete this.properties[e], this;
   }
   getContractsProperty() {
-    return this.properties?.[z];
+    return this.properties?.[U];
   }
   getContracts() {
     return this.getContractsProperty()?.getProperties();
   }
   setContracts(e) {
-    return v(e) ? this.removeProperty(z) : this.addProperty(
-      z,
+    return I(e) ? this.removeProperty(U) : this.addProperty(
+      U,
       new u().setProperties(e)
     ), this;
   }
   addContract(e, t) {
     const r = this.getContractsProperty();
-    return v(r) ? this.addProperty(
-      z,
+    return I(r) ? this.addProperty(
+      U,
       new u().addProperty(e, t)
     ) : r.addProperty(e, t), this;
   }
@@ -314,7 +314,7 @@ class u {
     if (t) {
       t.removeProperty(e);
       const r = t.getProperties();
-      r && Object.keys(r).length === 0 && this.removeProperty(z);
+      r && Object.keys(r).length === 0 && this.removeProperty(U);
     }
     return this;
   }
@@ -358,7 +358,7 @@ class u {
     return !1;
   }
   get(e, t) {
-    return Xr.get(this, e, t);
+    return Kr.get(this, e, t);
   }
   getAsNode(e) {
     const t = this.get(e);
@@ -368,7 +368,7 @@ class u {
   }
   getAsInteger(e) {
     const t = this.get(e);
-    if (t instanceof A || t instanceof $)
+    if (t instanceof A || t instanceof _)
       return t.toNumber();
     throw new Error(
       `Value at path ${e} is not a BigInteger or BigDecimal: ${t}`
@@ -388,7 +388,7 @@ class u {
     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 Be {
+class ve {
   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+)?$/;
@@ -414,9 +414,9 @@ class Be {
     return !0;
   }
 }
-const wn = y.string().max(Be.MAX_BLUE_ID_LENGTH, {
+const on = f.string().max(ve.MAX_BLUE_ID_LENGTH, {
   message: "Blue Id has a maximum length of 45 characters"
-}).min(Be.MIN_BLUE_ID_LENGTH, {
+}).min(ve.MIN_BLUE_ID_LENGTH, {
   message: "Blue Id has a minimum length of 41 characters"
 }).refine(
   (i) => {
@@ -429,45 +429,45 @@ const wn = y.string().max(Be.MAX_BLUE_ID_LENGTH, {
   {
     message: "Blue Id must be a valid Base58 string"
   }
-), Ve = y.lazy(
-  () => y.record(y.unknown()).and(
-    y.object({
-      blueId: y.string().optional(),
-      name: y.string().optional(),
-      description: y.string().optional(),
+), Ve = f.lazy(
+  () => f.record(f.unknown()).and(
+    f.object({
+      blueId: f.string().optional(),
+      name: f.string().optional(),
+      description: f.string().optional(),
       type: Ve.optional(),
-      value: y.union([y.string(), y.number(), y.boolean()]).optional().nullable(),
-      items: y.array(Ve).optional()
+      value: f.union([f.string(), f.number(), f.boolean()]).optional().nullable(),
+      items: f.array(Ve).optional()
     })
   )
-), it = y.object({
-  blueId: y.string().optional(),
-  name: y.string().optional(),
-  description: y.string().optional(),
+), tt = f.object({
+  blueId: f.string().optional(),
+  name: f.string().optional(),
+  description: f.string().optional(),
   type: Ve.optional()
-}), Sn = it.extend({
-  value: y.string().optional()
-}), bn = it.extend({
-  value: y.number().optional()
-}), En = it.extend({
-  value: y.boolean().optional()
-}), Nn = it.extend({
-  items: y.array(y.string()).optional()
-}), Cn = (i) => Ve.safeParse(i).success, qr = (i) => p(i) && "blueId" in i && p(i.blueId), Rn = (i) => p(i) && "name" in i && p(i.name), Qr = (i) => p(i) && "items" in i && p(i.items), es = (i) => p(i) && "type" in i && p(i.type), ts = (i) => p(i) && "value" in i && p(i.value), An = (i, e) => i.required({ type: !0 }).safeParse(e).success, C = (i) => i instanceof G, oe = (i) => C(i) && i instanceof A, yt = (i) => C(i) && i instanceof $, rs = y.lazy(
-  () => y.record(Ze)
-), ss = y.lazy(
-  () => y.union([
-    y.array(Ze),
-    y.array(Ze).readonly()
+}), ln = tt.extend({
+  value: f.string().optional()
+}), an = tt.extend({
+  value: f.number().optional()
+}), cn = tt.extend({
+  value: f.boolean().optional()
+}), un = tt.extend({
+  items: f.array(f.string()).optional()
+}), dn = (i) => Ve.safeParse(i).success, Hr = (i) => d(i) && "blueId" in i && d(i.blueId), hn = (i) => d(i) && "name" in i && d(i.name), kr = (i) => d(i) && "items" in i && d(i.items), Yr = (i) => d(i) && "type" in i && d(i.type), Wr = (i) => d(i) && "value" in i && d(i.value), pn = (i, e) => i.required({ type: !0 }).safeParse(e).success, C = (i) => i instanceof G, oe = (i) => C(i) && i instanceof A, dt = (i) => C(i) && i instanceof _, Gr = f.lazy(
+  () => f.record(Ge)
+), Jr = f.lazy(
+  () => f.union([
+    f.array(Ge),
+    f.array(Ge).readonly()
   ])
-), Ze = y.lazy(
-  () => y.union([
-    jr,
-    rs,
-    ss,
-    y.instanceof(G)
+), Ge = f.lazy(
+  () => f.union([
+    Vr,
+    Gr,
+    Jr,
+    f.instanceof(G)
   ])
-), pr = (i) => tr(i) && !rr(i) && !Gt(i) && !C(i), fr = (i) => rr(i) || Gt(i), Vn = (i) => fr(i) || pr(i) || C(i) || Jt(i);
+), ar = (i) => Zt(i) && !Xt(i) && !Kt(i) && !C(i), cr = (i) => Xt(i) || Kt(i), fn = (i) => cr(i) || ar(i) || C(i) || Ht(i);
 class m {
   static deserialize(e) {
     return m.handleNode(e);
@@ -477,7 +477,7 @@ class m {
       throw new Error(
         "This is not a valid JSON-like value. Found 'undefined' as a value."
       );
-    if (pr(e)) {
+    if (ar(e)) {
       const t = new u(), r = {};
       return Object.entries(e).forEach(([s, n]) => {
         switch (s) {
@@ -501,16 +501,16 @@ class m {
               t.setDescription(n);
             }
             break;
-          case K:
+          case z:
             t.setType(m.handleNode(n));
             break;
-          case we:
+          case Pe:
             t.setItemType(m.handleNode(n));
             break;
-          case Se:
+          case we:
             t.setKeyType(m.handleNode(n));
             break;
-          case be:
+          case Se:
             t.setValueType(m.handleNode(n));
             break;
           case W:
@@ -533,7 +533,7 @@ class m {
         }
       }), Object.keys(r).length > 0 && t.setProperties(r), t;
     } else {
-      if (fr(e))
+      if (cr(e))
         return new u().setItems(m.handleArray(e));
       {
         const t = e;
@@ -552,7 +552,7 @@ class m {
         return t.lt(r) ? new A(r.toString()) : t.gt(s) ? new A(s.toString()) : t;
       } else {
         const t = parseFloat(e.toString());
-        return new $(t.toString());
+        return new _(t.toString());
       }
     else if (typeof e == "boolean")
       return e;
@@ -560,7 +560,7 @@ class m {
   }
   static handleArray(e) {
     if (e != null) {
-      if (tr(e) && !Array.isArray(e))
+      if (Zt(e) && !Array.isArray(e))
         return [m.handleNode(e)];
       if (Array.isArray(e))
         return e.map(m.handleNode);
@@ -568,12 +568,12 @@ class m {
     }
   }
 }
-function is(i) {
+function Zr(i) {
   return i && i.__esModule && Object.prototype.hasOwnProperty.call(i, "default") ? i.default : i;
 }
-var ct, Ft;
-function ns() {
-  return Ft || (Ft = 1, ct = function i(e) {
+var ot, Lt;
+function Xr() {
+  return Lt || (Lt = 1, ot = function i(e) {
     if (typeof e == "number" && isNaN(e))
       throw new Error("NaN is not allowed");
     if (typeof e == "number" && !isFinite(e))
@@ -584,40 +584,40 @@ function ns() {
       const n = r.length === 0 ? "" : ",";
       return `${r}${n}${i(s)}:${i(e[s])}`;
     }, "")}}`;
-  }), ct;
+  }), ot;
 }
-var os = ns();
-const ls = /* @__PURE__ */ is(os);
-class gt {
+var qr = Xr();
+const Qr = /* @__PURE__ */ Zr(qr);
+class ht {
   static canonicalize(e) {
-    return ls(e);
+    return Qr(e);
   }
 }
-const ut = typeof process < "u" && process.versions != null && process.versions.node != null;
-class Vt {
+const lt = typeof process < "u" && process.versions != null && process.versions.node != null;
+class Et {
   static instance;
   browserCrypto;
   constructor() {
     this.browserCrypto = this.initBrowserCrypto();
   }
   static getInstance() {
-    return this.instance || (this.instance = new Vt()), this.instance;
+    return this.instance || (this.instance = new Et()), this.instance;
   }
   initBrowserCrypto() {
-    return ut ? null : "crypto" in globalThis ? globalThis.crypto : null;
+    return lt ? null : "crypto" in globalThis ? globalThis.crypto : null;
   }
   hasNodeCrypto() {
-    return ut && !!at && typeof at.createHash == "function";
+    return lt && !!nt && typeof nt.createHash == "function";
   }
   getBrowserCrypto() {
     return this.browserCrypto;
   }
   getNodeCrypto() {
-    return ut ? at : null;
+    return lt ? nt : null;
   }
 }
-class as {
-  cryptoEnv = Vt.getInstance();
+class es {
+  cryptoEnv = Et.getInstance();
   applySync(e) {
     const t = this.canonicalizeInput(e), r = this.cryptoEnv.hasNodeCrypto() ? this.sha256Sync(t) : this.sha256SyncBrowser(t);
     return Ae.encode(r);
@@ -627,7 +627,7 @@ class as {
     return Ae.encode(r);
   }
   canonicalizeInput(e) {
-    const t = gt.canonicalize(e);
+    const t = ht.canonicalize(e);
     if (typeof t != "string")
       throw new Error("Canonized value must be a string");
     return t;
@@ -642,7 +642,7 @@ class as {
     return new Uint8Array(r);
   }
   sha256SyncBrowser(e) {
-    return new Uint8Array(Jr.arrayBuffer(e));
+    return new Uint8Array(Ur.arrayBuffer(e));
   }
   async sha256Async(e) {
     if (this.cryptoEnv.hasNodeCrypto())
@@ -693,7 +693,7 @@ class b {
    */
   static isValidValueNode(e) {
     const t = e.getValue(), r = e.getProperties(), s = e.getItems();
-    return p(t) && v(r) && v(s);
+    return d(t) && I(r) && I(s);
   }
   /**
    * Create a text node
@@ -712,7 +712,7 @@ class b {
    * Create a double node
    */
   static doubleNode(e) {
-    const t = e instanceof $ ? e : new $(e.toString());
+    const t = e instanceof _ ? e : new _(e.toString());
     return new u().setType(new u().setBlueId(ee)).setValue(t);
   }
   /**
@@ -730,7 +730,7 @@ class b {
    */
   static hasFieldsAndMayHaveFields(e, t = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set()) {
     for (const s of Object.values(S)) {
-      const n = p(this.getFieldValue(e, s));
+      const n = d(this.getFieldValue(e, s));
       if (t.has(s)) {
         if (!n) return !1;
       } else if (!r.has(s)) {
@@ -771,14 +771,14 @@ class b {
     }
   }
 }
-const Ie = "$previous", ce = "$pos", mt = "$empty";
+const me = "$previous", ce = "$pos", pt = "$empty";
 class B {
   static getMergePolicy(e, t) {
     const r = this.getMergePolicyValue(e);
     return r !== void 0 ? r : (t === void 0 ? void 0 : this.getMergePolicyValue(t)) ?? "positional";
   }
   static getMergePolicyValue(e) {
-    const t = e.getProperties()?.[bt]?.getValue();
+    const t = e.getProperties()?.[Tt]?.getValue();
     if (t === "append-only" || t === "positional")
       return t;
   }
@@ -802,7 +802,7 @@ class B {
   static hasPreviousProperty(e) {
     return Object.prototype.hasOwnProperty.call(
       e.getProperties() ?? {},
-      Ie
+      me
     );
   }
   static hasPositionProperty(e) {
@@ -814,11 +814,11 @@ class B {
   static hasEmptyProperty(e) {
     return Object.prototype.hasOwnProperty.call(
       e.getProperties() ?? {},
-      mt
+      pt
     );
   }
   static isEmptyItem(e) {
-    const t = e.getProperties(), r = t?.[mt];
+    const t = e.getProperties(), r = t?.[pt];
     return t !== void 0 && Object.keys(t).length === 1 && r !== void 0 && b.hasFieldsAndMayHaveFields(
       e,
       /* @__PURE__ */ new Set([S.PROPERTIES])
@@ -833,15 +833,15 @@ class B {
     return t !== void 0 && Object.keys(t).length === 1 && b.hasFieldsAndMayHaveFields(
       e,
       /* @__PURE__ */ new Set([S.PROPERTIES])
-    ) && b.hasBlueIdOnly(t[Ie]);
+    ) && b.hasBlueIdOnly(t[me]);
   }
   static getPreviousBlueId(e) {
     if (this.isPreviousItem(e))
-      return e.getProperties()?.[Ie]?.getBlueId();
+      return e.getProperties()?.[me]?.getBlueId();
   }
   static createPreviousItem(e) {
     return new u().setProperties({
-      [Ie]: new u().setBlueId(e)
+      [me]: new u().setBlueId(e)
     });
   }
   static readPosition(e) {
@@ -874,7 +874,7 @@ class B {
     return !b.isEmptyNode(this.withoutPosition(e));
   }
   static isReplacementPayload(e) {
-    return p(e.getValue()) || p(e.getItems()) || p(e.getBlueId());
+    return d(e.getValue()) || d(e.getItems()) || d(e.getBlueId());
   }
   static hasAnyListControlChild(e) {
     return e !== void 0 && this.hasAnyListControl(e);
@@ -883,12 +883,12 @@ class B {
     return e !== void 0 && this.hasPositionControl(e);
   }
 }
-const cs = /* @__PURE__ */ new Set([
+const ts = /* @__PURE__ */ new Set([
   ie,
   ne,
   W
-]), us = { $list: "empty" }, ds = "$listCons", hs = "prev", ps = "elem";
-class fs {
+]), rs = { $list: "empty" }, ss = "$listCons", is = "prev", ns = "elem";
+class os {
   constructor(e) {
     this.hashProvider = e;
   }
@@ -910,7 +910,7 @@ class fs {
   calculateMap(e, t) {
     const s = Object.entries(e).sort(([o], [l]) => o.localeCompare(l)).map(
       ([o, l]) => {
-        if (cs.has(o))
+        if (ts.has(o))
           return t ? [o, l] : Promise.resolve([o, l]);
         const a = this.calculateInternal(l, t);
         return t ? [o, { [V]: a }] : Promise.resolve(a).then((c) => [
@@ -937,7 +937,7 @@ class fs {
         );
       s = t ? o : Promise.resolve(o), r = 1;
     } else
-      s = this.applyHash(us, t);
+      s = this.applyHash(rs, t);
     for (let o = r; o < e.length; o++) {
       const l = e[o];
       if (this.hasPreviousControlKey(l))
@@ -951,16 +951,16 @@ class fs {
         this.createListFoldInput(a, c),
         !0
       ) : s = Promise.all([a, c]).then(
-        ([d, h]) => this.applyHash(this.createListFoldInput(d, h), !1)
+        ([h, p]) => this.applyHash(this.createListFoldInput(h, p), !1)
       );
     }
     return s;
   }
   createListFoldInput(e, t) {
     return {
-      [ds]: {
-        [hs]: { [V]: e },
-        [ps]: { [V]: t }
+      [ss]: {
+        [is]: { [V]: e },
+        [ns]: { [V]: t }
       }
     };
   }
@@ -968,14 +968,14 @@ class fs {
     if (typeof e != "object" || e === null || Array.isArray(e) || C(e))
       return;
     const t = Object.entries(e);
-    if (t.length !== 1 || t[0][0] !== Ie)
+    if (t.length !== 1 || t[0][0] !== me)
       return;
     const r = t[0][1];
     if (!(typeof r != "object" || r === null || Array.isArray(r) || C(r) || !this.isPureReference(r)))
       return r[V];
   }
   hasPreviousControlKey(e) {
-    return this.hasControlKey(e, Ie);
+    return this.hasControlKey(e, me);
   }
   hasPositionControlKey(e) {
     return this.hasControlKey(e, ce);
@@ -991,7 +991,7 @@ class fs {
   }
   nodeToHashValue(e) {
     const t = {};
-    this.setIfPresent(t, ie, e.getName()), this.setIfPresent(t, ne, e.getDescription()), this.setIfPresent(t, K, e.getType()), this.setIfPresent(t, we, e.getItemType()), this.setIfPresent(t, Se, e.getKeyType()), this.setIfPresent(t, be, e.getValueType());
+    this.setIfPresent(t, ie, e.getName()), this.setIfPresent(t, ne, e.getDescription()), this.setIfPresent(t, z, e.getType()), this.setIfPresent(t, Pe, e.getItemType()), this.setIfPresent(t, we, e.getKeyType()), this.setIfPresent(t, Se, e.getValueType());
     const r = e.getValue();
     r !== void 0 && (t[W] = this.scalarToHashValue(r));
     const s = e.getItems();
@@ -1043,14 +1043,14 @@ class fs {
     return t.length === 1 && t[0]?.[0] === W;
   }
   isBasicTypedScalarWrapper(e) {
-    return this.hasOnlyKeys(e, [K, W]) && this.isBasicScalarTypeReference(e[K]);
+    return this.hasOnlyKeys(e, [z, W]) && this.isBasicScalarTypeReference(e[z]);
   }
   isListWrapper(e) {
     const t = Object.entries(e);
     return t.length === 1 && t[0]?.[0] === Y && Array.isArray(t[0]?.[1]);
   }
   isBasicTypedListWrapper(e) {
-    return this.hasOnlyKeys(e, [K, Y]) && this.isTypeReference(e[K], rt) && Array.isArray(e[Y]);
+    return this.hasOnlyKeys(e, [z, Y]) && this.isTypeReference(e[z], Qe) && Array.isArray(e[Y]);
   }
   hasOnlyKeys(e, t) {
     return Object.keys(e).length === t.length && t.every(
@@ -1064,24 +1064,24 @@ class fs {
     return typeof e != "object" || e === null || Array.isArray(e) || C(e) ? !1 : this.isPureReference(e) && e[V] === t;
   }
   isScalar(e) {
-    return Jt(e) && e !== null || C(e);
+    return Ht(e) && e !== null || C(e);
   }
   scalarToHashValue(e) {
     if (e instanceof A || oe(e)) {
       const t = new G(Number.MIN_SAFE_INTEGER.toString()), r = new G(Number.MAX_SAFE_INTEGER.toString());
       return e.lt(t) || e.gt(r) ? e.toString() : e.toNumber();
     }
-    return e instanceof $ || C(e) ? e.toNumber() : e;
+    return e instanceof _ || C(e) ? e.toNumber() : e;
   }
   toJsonScalar(e) {
     return C(e) ? this.scalarToHashValue(e) : e;
   }
 }
 class M {
-  static INSTANCE = new M(new as());
+  static INSTANCE = new M(new es());
   hasher;
   constructor(e) {
-    this.hasher = new fs(e);
+    this.hasher = new os(e);
   }
   static calculateBlueId(e) {
     return M.INSTANCE.calculate(e);
@@ -1096,7 +1096,7 @@ class M {
     return this.hasher.calculateSync(e);
   }
 }
-class U {
+class j {
   constructor(e = {
     emitListControls: !0
   }) {
@@ -1115,7 +1115,7 @@ class U {
     );
   }
   static toHashMinimalNode(e) {
-    return new U({ emitListControls: !1 }).reverse(e);
+    return new j({ emitListControls: !1 }).reverse(e);
   }
   reverseNode(e, t, r, s) {
     const n = this.getEffectiveFromType(
@@ -1130,16 +1130,16 @@ class U {
     ), this.reverseItems(e, t, n), this.reverseProperties(e, t, n));
   }
   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, s) {
     const n = t.getValue();
-    p(n) && (v(r) || v(r.getValue())) && e.setValue(n), p(t.getName()) && (s || v(r) || t.getName() !== r.getName()) && e.setName(t.getName()), p(t.getDescription()) && (s || v(r) || t.getDescription() !== r.getDescription()) && e.setDescription(t.getDescription()), p(t.getBlueId()) && (v(r) || t.getBlueId() !== r.getBlueId()) && e.setBlueId(t.getBlueId());
+    d(n) && (I(r) || I(r.getValue())) && e.setValue(n), d(t.getName()) && (s || I(r) || t.getName() !== r.getName()) && e.setName(t.getName()), d(t.getDescription()) && (s || I(r) || t.getDescription() !== r.getDescription()) && e.setDescription(t.getDescription()), d(t.getBlueId()) && (I(r) || t.getBlueId() !== r.getBlueId()) && e.setBlueId(t.getBlueId());
   }
   reverseTypeReferences(e, t, r, s) {
     const n = (o, l, a) => {
-      const c = o(t), d = a ? o(a) : void 0;
-      p(c) && !this.areTypeReferencesEquivalent(c, d) && l(e, this.toMinimalTypeReference(c));
+      const c = o(t), h = a ? o(a) : void 0;
+      d(c) && !this.areTypeReferencesEquivalent(c, h) && l(e, this.toMinimalTypeReference(c));
     };
     n(
       (o) => o.getType(),
@@ -1160,32 +1160,32 @@ class U {
     );
   }
   areTypeReferencesEquivalent(e, t) {
-    if (v(t))
+    if (I(t))
       return !1;
     const r = e.getBlueId(), s = t.getBlueId();
-    return p(r) || p(s) ? p(r) && p(s) && r === s : U.calculateHashMinimalBlueId(e) === U.calculateHashMinimalBlueId(t);
+    return d(r) || d(s) ? d(r) && d(s) && r === s : j.calculateHashMinimalBlueId(e) === j.calculateHashMinimalBlueId(t);
   }
   toMinimalTypeReference(e) {
     const t = e.getBlueId();
-    if (p(t))
+    if (d(t))
       return new u().setBlueId(t);
     const r = new u();
     return this.reverseNode(r, e, void 0, !0), b.isEmptyNode(r) ? e.clone() : r;
   }
   reverseItems(e, t, r) {
     const s = t.getItems();
-    if (v(s))
+    if (I(s))
       return;
     const n = r?.getItems();
     if (s.length === 0) {
-      (v(n) || n.length > 0) && e.setItems([]);
+      (I(n) || n.length > 0) && e.setItems([]);
       return;
     }
-    if (p(n) && s.length === n.length && s.every(
-      (l, a) => U.calculateHashMinimalBlueId(l) === U.calculateHashMinimalBlueId(n[a])
+    if (d(n) && s.length === n.length && s.every(
+      (l, a) => j.calculateHashMinimalBlueId(l) === j.calculateHashMinimalBlueId(n[a])
     ))
       return;
-    const o = this.options.emitListControls !== !1 && p(n) && n.length > 0 ? this.reverseInheritedItems(t, r) : this.reverseFullItems(s);
+    const o = this.options.emitListControls !== !1 && d(n) && n.length > 0 ? this.reverseInheritedItems(t, r) : this.reverseFullItems(s);
     o.length > 0 && e.setItems(o);
   }
   reverseInheritedItems(e, t) {
@@ -1196,26 +1196,26 @@ class U {
       );
     const n = B.getMergePolicy(e, t), o = [];
     for (let c = 0; c < s.length; c++)
-      U.calculateHashMinimalBlueId(r[c]) !== U.calculateHashMinimalBlueId(s[c]) && o.push(c);
+      j.calculateHashMinimalBlueId(r[c]) !== j.calculateHashMinimalBlueId(s[c]) && o.push(c);
     if (o.length > 0 && n === "append-only")
       throw new Error(
         "append-only list cannot be minimized as a non-prefix mutation."
       );
-    const l = U.calculateHashMinimalListBlueId(s), a = [B.createPreviousItem(l)];
+    const l = j.calculateHashMinimalListBlueId(s), a = [B.createPreviousItem(l)];
     for (const c of o) {
-      const d = new u();
+      const h = new u();
       this.reverseNode(
-        d,
+        h,
         r[c],
         s[c],
         !1
       );
-      const h = b.isEmptyNode(d) ? r[c].clone() : d;
-      a.push(B.createPositionedItem(c, h));
+      const p = b.isEmptyNode(h) ? r[c].clone() : h;
+      a.push(B.createPositionedItem(c, p));
     }
     for (let c = s.length; c < r.length; c++) {
-      const d = new u();
-      this.reverseNode(d, r[c], void 0, !1), a.push(d);
+      const h = new u();
+      this.reverseNode(h, r[c], void 0, !1), a.push(h);
     }
     return a.length === 1 ? [] : a;
   }
@@ -1229,7 +1229,7 @@ class U {
   }
   reverseProperties(e, t, r) {
     const s = t.getProperties();
-    if (v(s))
+    if (I(s))
       return;
     const n = {};
     for (const [o, l] of Object.entries(s)) {
@@ -1252,10 +1252,10 @@ class U {
   }
   getEffectiveFromType(e, t) {
     const r = this.createOwnTypeOverlay(t.getType());
-    return v(e) ? r : v(r) ? e : this.mergeNodes(e, r);
+    return I(e) ? r : I(r) ? e : this.mergeNodes(e, r);
   }
   createOwnTypeOverlay(e) {
-    if (v(e))
+    if (I(e))
       return;
     const t = e.cloneShallow().setName(void 0).setDescription(void 0).setType(void 0).setBlueId(void 0);
     if (!b.isEmptyNode(t))
@@ -1268,31 +1268,31 @@ class U {
    */
   mergeNodes(e, t) {
     const r = e.clone(), s = t.getValue();
-    p(s) && r.setValue(s);
+    d(s) && r.setValue(s);
     const n = t.getType();
-    p(n) && r.setType(n.clone());
+    d(n) && r.setType(n.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 c = t.getProperties();
-    if (p(c)) {
-      const h = r.getProperties() || {};
-      for (const [f, g] of Object.entries(c)) {
-        const I = h[f];
-        h[f] = I === void 0 ? g.clone() : this.mergeNodes(I, g);
+    if (d(c)) {
+      const p = r.getProperties() || {};
+      for (const [y, g] of Object.entries(c)) {
+        const v = p[y];
+        p[y] = v === void 0 ? g.clone() : this.mergeNodes(v, g);
       }
-      r.setProperties(h);
+      r.setProperties(p);
     }
-    const d = t.getItems();
-    return p(d) && r.setItems(d.map((h) => h.clone())), r;
+    const h = t.getItems();
+    return d(h) && r.setItems(h.map((p) => p.clone())), r;
   }
 }
-class It {
-  mergeReverser = new U();
-  hashMergeReverser = new U({
+class ft {
+  mergeReverser = new j();
+  hashMergeReverser = new j({
     emitListControls: !1
   });
   /**
@@ -1314,16 +1314,15 @@ class It {
     return this.hashMergeReverser.reverse(e);
   }
 }
-class he extends Error {
+class Te extends Error {
   code;
   details;
   constructor(e, t, r) {
     super(t), this.code = e, this.details = r && r.length > 0 ? r : [], this.name = "BlueError";
   }
 }
-const j = {
+const K = {
   AMBIGUOUS_BLUE_ID_PAYLOAD: "AMBIGUOUS_BLUE_ID_PAYLOAD",
-  BLUE_ID_MISMATCH: "BLUE_ID_MISMATCH",
   INVALID_STORAGE_SHAPE: "INVALID_STORAGE_SHAPE",
   REPO_UNKNOWN_REPO_BLUE_ID: "REPO_UNKNOWN_REPO_BLUE_ID",
   REPO_UNREPRESENTABLE_IN_TARGET_VERSION: "REPO_UNREPRESENTABLE_IN_TARGET_VERSION",
@@ -1332,9 +1331,9 @@ const j = {
 };
 class X {
   static RESERVED_PROPERTY_KEYS = /* @__PURE__ */ new Set([
-    ir,
-    bt,
-    z
+    Qt,
+    Tt,
+    U
   ]);
   static INTERNAL_PROPERTIES_KEY = "properties";
   static validateStorageShape(e) {
@@ -1373,13 +1372,13 @@ class X {
       if (r.insideItems && B.hasPositionProperty(e) && b.hasBlueIdOnly(B.withoutPosition(e)))
         B.readPosition(e);
       else {
-        const h = this.toPointer(t);
-        throw new he(
-          j.AMBIGUOUS_BLUE_ID_PAYLOAD,
-          `Ambiguous blueId plus payload at ${h}. Use exact { blueId } for references or remove blueId from payload content.`,
+        const p = this.toPointer(t);
+        throw new Te(
+          K.AMBIGUOUS_BLUE_ID_PAYLOAD,
+          `Ambiguous blueId plus payload at ${p}. Use exact { blueId } for references or remove blueId from payload content.`,
           [
             {
-              code: j.AMBIGUOUS_BLUE_ID_PAYLOAD,
+              code: K.AMBIGUOUS_BLUE_ID_PAYLOAD,
               message: "A storage or authoring node cannot combine blueId with payload.",
               locationPath: t,
               context: { blueId: s }
@@ -1397,16 +1396,16 @@ class X {
     ), l && a && this.throwInvalidStorageShape(
       t,
       "A storage or authoring node cannot combine items payload with object child fields."
-    ), this.validateChild(e.getType(), [...t, "type"]), this.validateChild(e.getItemType(), [...t, "itemType"]), this.validateChild(e.getKeyType(), [...t, "keyType"]), this.validateChild(e.getValueType(), [...t, "valueType"]), this.validateChild(e.getBlue(), [...t, "blue"]), e.getItems()?.forEach((d, h) => {
-      this.validateNode(d, [...t, "items", String(h)], {
+    ), this.validateChild(e.getType(), [...t, "type"]), this.validateChild(e.getItemType(), [...t, "itemType"]), this.validateChild(e.getKeyType(), [...t, "keyType"]), this.validateChild(e.getValueType(), [...t, "valueType"]), this.validateChild(e.getBlue(), [...t, "blue"]), e.getItems()?.forEach((h, p) => {
+      this.validateNode(h, [...t, "items", String(p)], {
         insideItems: !0,
-        itemIndex: h
+        itemIndex: p
       });
     });
     const c = e.getProperties();
     if (c !== void 0)
-      for (const [d, h] of Object.entries(c))
-        this.validateNode(h, [...t, d], { insideItems: !1 });
+      for (const [h, p] of Object.entries(c))
+        this.validateNode(p, [...t, h], { insideItems: !1 });
   }
   static validateListControlItem(e, t, r) {
     if (B.hasEmptyProperty(e) && (B.hasPreviousProperty(e) && this.throwInvalidStorageShape(
@@ -1459,18 +1458,18 @@ class X {
       "The document-level properties key is not part of the Blue language."
     ), Object.fromEntries(
       Object.entries(s).filter(
-        ([n]) => !this.RESERVED_PROPERTY_KEYS.has(n) && !(r.insideItems && (n === ce || n === mt))
+        ([n]) => !this.RESERVED_PROPERTY_KEYS.has(n) && !(r.insideItems && (n === ce || n === pt))
       )
     );
   }
   static throwInvalidStorageShape(e, t) {
     const r = this.toPointer(e);
-    throw new he(
-      j.INVALID_STORAGE_SHAPE,
+    throw new Te(
+      K.INVALID_STORAGE_SHAPE,
       `${t} at ${r}`,
       [
         {
-          code: j.INVALID_STORAGE_SHAPE,
+          code: K.INVALID_STORAGE_SHAPE,
           message: t,
           locationPath: e
         }
@@ -1481,12 +1480,12 @@ class X {
     return e.length === 0 ? "/" : `/${e.map((t) => t.replace(/~/g, "~0").replace(/\//g, "~1")).join("/")}`;
   }
 }
-class On {
+class yn {
   static convert(e) {
     const t = Ae.decode(e), r = new Uint8Array(2 + t.length);
     r[0] = 18, r[1] = 32, r.set(t, 2);
     const s = new Uint8Array(2 + r.length);
-    return s[0] = 1, s[1] = 85, s.set(r, 2), "b" + new Zr.Encoder({ type: "rfc4648", lc: !0 }).write(s).finalize().replace(/=/g, "");
+    return s[0] = 1, s[1] = 85, s.set(r, 2), "b" + new zr.Encoder({ type: "rfc4648", lc: !0 }).write(s).finalize().replace(/=/g, "");
   }
 }
 class T {
@@ -1504,7 +1503,7 @@ class T {
     const { strategy: r } = this.normalizeOptions(t), s = e.getValue(), n = this.handleValue(s);
     if (n !== void 0 && r === "simple")
       return n;
-    const o = e.getItems()?.map((x) => T.get(x, r));
+    const o = e.getItems()?.map((L) => T.get(L, r));
     if (o !== void 0 && r === "simple")
       return o;
     const l = e.getName(), a = e.getDescription();
@@ -1516,24 +1515,24 @@ class T {
     }
     const c = {};
     l !== void 0 && (c[ie] = l), a !== void 0 && (c[ne] = a);
-    const d = e.getType();
-    if (r === "official" && s !== void 0 && d === void 0) {
-      const x = this.inferTypeBlueId(s);
-      x !== null && (c[K] = { [V]: x });
-    } else d !== void 0 && (c[K] = T.get(d, r));
-    const h = e.getItemType();
-    h !== void 0 && (c[we] = T.get(h, r));
-    const f = e.getKeyType();
-    f !== void 0 && (c[Se] = T.get(f, r));
+    const h = e.getType();
+    if (r === "official" && s !== void 0 && h === void 0) {
+      const L = this.inferTypeBlueId(s);
+      L !== null && (c[z] = { [V]: L });
+    } else h !== void 0 && (c[z] = T.get(h, r));
+    const p = e.getItemType();
+    p !== void 0 && (c[Pe] = T.get(p, r));
+    const y = e.getKeyType();
+    y !== void 0 && (c[we] = T.get(y, r));
     const g = e.getValueType();
-    g !== void 0 && (c[be] = T.get(g, r)), n !== void 0 && (c[W] = n), o !== void 0 && (c[Y] = o);
-    const I = e.getBlueId();
-    I !== void 0 && (c[V] = I);
+    g !== void 0 && (c[Se] = T.get(g, r)), n !== void 0 && (c[W] = n), o !== void 0 && (c[Y] = o);
+    const v = e.getBlueId();
+    v !== void 0 && (c[V] = v);
     const D = e.getBlue();
     D !== void 0 && (c[Le] = D);
     const R = e.getProperties();
-    return R !== void 0 && Object.entries(R).forEach(([x, je]) => {
-      c[x] = T.get(je, r);
+    return R !== void 0 && Object.entries(R).forEach(([L, _e]) => {
+      c[L] = T.get(_e, r);
     }), c;
   }
   static handleValue(e) {
@@ -1558,7 +1557,7 @@ class T {
     };
   }
 }
-class L {
+class $ {
   /**
    * Transforms a node and all its child nodes using the provided transformer function
    * @param node - The node to transform
@@ -1567,45 +1566,45 @@ class L {
    */
   static transform(e, t) {
     const r = t(e.clone()), s = r.getType();
-    s !== void 0 && r.setType(L.transform(s, t));
+    s !== void 0 && r.setType($.transform(s, t));
     const n = r.getItemType();
     n !== void 0 && r.setItemType(
-      L.transform(n, t)
+      $.transform(n, t)
     );
     const o = r.getKeyType();
     o !== void 0 && r.setKeyType(
-      L.transform(o, t)
+      $.transform(o, t)
     );
     const l = r.getValueType();
     l !== void 0 && r.setValueType(
-      L.transform(l, t)
+      $.transform(l, t)
     );
     const a = r.getItems();
     if (a !== void 0) {
-      const d = a.map(
-        (h) => L.transform(h, t)
+      const h = a.map(
+        (p) => $.transform(p, t)
       );
-      r.setItems(d);
+      r.setItems(h);
     }
     const c = r.getProperties();
     if (c !== void 0) {
-      const d = Object.keys(c).reduce(
-        (h, f) => (h[f] = L.transform(c[f], t), h),
+      const h = Object.keys(c).reduce(
+        (p, y) => (p[y] = $.transform(c[y], t), p),
         {}
       );
-      r.setProperties(d);
+      r.setProperties(h);
     }
     return r;
   }
 }
-const le = (i) => !!i && typeof i == "object" && !Array.isArray(i) && !(i instanceof u), q = (i) => i instanceof A || i instanceof $, ys = (i) => i.replace(/~1/g, "/").replace(/~0/g, "~");
-function Ee(i) {
+const le = (i) => !!i && typeof i == "object" && !Array.isArray(i) && !(i instanceof u), q = (i) => i instanceof A || i instanceof _, ls = (i) => i.replace(/~1/g, "/").replace(/~0/g, "~");
+function be(i) {
   if (i === "/") return [];
   if (!i.startsWith("/"))
     throw new Error(`Path must start with '/': ${i}`);
-  return i.split("/").slice(1).map(ys);
+  return i.split("/").slice(1).map(ls);
 }
-function Pe(i) {
+function Be(i) {
   if (i === "-") return -1;
   const e = typeof i == "number" ? i : parseInt(i, 10);
   if (isNaN(e))
@@ -1616,7 +1615,7 @@ function Pe(i) {
     );
   return e;
 }
-function yr(i, e, t, r = !0) {
+function ur(i, e, t, r = !0) {
   switch (e) {
     case "name":
       return t ? r ? i.getName() ?? null : i : i.getName();
@@ -1640,15 +1639,15 @@ function yr(i, e, t, r = !0) {
       return i.getItems();
     case "properties":
       return i.getProperties();
-    case z:
+    case U:
       return i.getContracts();
     default:
       return;
   }
 }
-function Ut(i, e, t = !0) {
+function $t(i, e, t = !0) {
   if (i instanceof u) {
-    const r = yr(
+    const r = ur(
       i,
       e,
       !0,
@@ -1666,7 +1665,7 @@ function Ut(i, e, t = !0) {
       "blue",
       "items",
       "properties",
-      z
+      U
     ].includes(e))
       return r;
     if (/^-?\d+$/.test(e) && e !== "-") {
@@ -1678,12 +1677,12 @@ function Ut(i, e, t = !0) {
   }
   if (Array.isArray(i)) {
     if (e === "-") return;
-    const r = Pe(e);
+    const r = Be(e);
     return r >= 0 && r < i.length ? i[r] : void 0;
   }
   if (le(i)) return i[e];
 }
-function Ne(i, e) {
+function Ee(i, e) {
   if (e.length === 0)
     return {
       parent: i,
@@ -1692,14 +1691,14 @@ function Ne(i, e) {
     };
   let t = i;
   for (let s = 0; s < e.length - 1; ++s) {
-    const n = e[s], o = Ut(t, n);
+    const n = e[s], o = $t(t, n);
     if (o === void 0)
       throw new Error(`Cannot resolve '/${e.slice(0, s + 1).join("/")}'`);
     t = o;
   }
   const r = e[e.length - 1];
   if (t instanceof u) {
-    const s = Ut(t, r, !1);
+    const s = $t(t, r, !1);
     if ((typeof s != "object" || s === null || q(s)) && !(s instanceof u) && !Array.isArray(s) && ["name", "description", "value", "blueId"].includes(r))
       return {
         parent: t,
@@ -1709,12 +1708,12 @@ function Ne(i, e) {
   }
   return Array.isArray(t) && r === "-" ? { parent: t, key: "-" } : t instanceof u && t.getItems() && r === "-" ? { parent: t, key: "-" } : {
     parent: t,
-    key: Array.isArray(t) ? Pe(r) : r
+    key: Array.isArray(t) ? Be(r) : r
   };
 }
-function Ot(i, e) {
+function Nt(i, e) {
   if (i instanceof u) {
-    const t = e, r = yr(i, t, !1);
+    const t = e, r = ur(i, t, !1);
     if (r !== void 0 || [
       "name",
       "description",
@@ -1727,7 +1726,7 @@ function Ot(i, e) {
       "blue",
       "items",
       "properties",
-      z
+      U
     ].includes(t))
       return r;
     if (typeof e == "number" || typeof e == "string" && /^\d+$/.test(e)) {
@@ -1738,23 +1737,23 @@ function Ot(i, e) {
   }
   return Array.isArray(i) || le(i) ? i[e] : i;
 }
-function _(i) {
+function x(i) {
   if (i instanceof u) return i;
   if (i === null || typeof i == "string" || typeof i == "number" || typeof i == "boolean" || q(i))
     return m.deserialize(i);
-  const e = vt(i);
+  const e = yt(i);
   return m.deserialize(e);
 }
-function vt(i) {
+function yt(i) {
   if (i === void 0) return null;
   if (i === null || typeof i != "object") return i;
-  if (Array.isArray(i)) return i.map(vt);
+  if (Array.isArray(i)) return i.map(yt);
   const e = {};
   for (const [t, r] of Object.entries(i))
-    e[t] = vt(r);
+    e[t] = yt(r);
   return e;
 }
-function Mt(i, e, t) {
+function Ct(i, e, t) {
   if (i instanceof u) {
     const r = e;
     switch (r) {
@@ -1766,22 +1765,22 @@ function Mt(i, e, t) {
         return;
       case "type":
         i.setType(
-          t instanceof u || typeof t == "string" || t === void 0 ? t : _(t)
+          t instanceof u || typeof t == "string" || t === void 0 ? t : x(t)
         );
         return;
       case "itemType":
         i.setItemType(
-          t instanceof u || typeof t == "string" || t === void 0 ? t : _(t)
+          t instanceof u || typeof t == "string" || t === void 0 ? t : x(t)
         );
         return;
       case "keyType":
         i.setKeyType(
-          t instanceof u || typeof t == "string" || t === void 0 ? t : _(t)
+          t instanceof u || typeof t == "string" || t === void 0 ? t : x(t)
         );
         return;
       case "valueType":
         i.setValueType(
-          t instanceof u || typeof t == "string" || t === void 0 ? t : _(t)
+          t instanceof u || typeof t == "string" || t === void 0 ? t : x(t)
         );
         return;
       case "value": {
@@ -1794,7 +1793,7 @@ function Mt(i, e, t) {
         return;
       case "blue":
         i.setBlue(
-          t instanceof u || t === void 0 ? t : _(t)
+          t instanceof u || t === void 0 ? t : x(t)
         );
         return;
       case "items":
@@ -1803,7 +1802,7 @@ function Mt(i, e, t) {
       case "properties":
         i.setProperties(t);
         return;
-      case z:
+      case U:
         i.setContracts(t);
         return;
       default: {
@@ -1811,14 +1810,14 @@ function Mt(i, e, t) {
           const s = i.getProperties();
           s && r in s && delete s[r];
         } else
-          i.getProperties() || i.setProperties({}), i.addProperty(r, t instanceof u ? t : _(t));
+          i.getProperties() || i.setProperties({}), i.addProperty(r, t instanceof u ? t : x(t));
         return;
       }
     }
   }
-  Array.isArray(i) ? i.splice(Pe(e), 1) : le(i) && (t === void 0 ? delete i[e] : i[e] = t);
+  Array.isArray(i) ? i.splice(Be(e), 1) : le(i) && (t === void 0 ? delete i[e] : i[e] = t);
 }
-function gs(i, e, t, r) {
+function as(i, e, t, r) {
   let s = -1;
   if (e !== "-" && (s = typeof e == "number" ? e : parseInt(e, 10), isNaN(s)))
     throw new Error(
@@ -1844,16 +1843,16 @@ function gs(i, e, t, r) {
   } else
     n.splice(s, 0, t);
 }
-function Xe(i, e, t, r) {
+function Je(i, e, t, r) {
   if (Array.isArray(i)) {
-    const s = e === "-" ? i.length : Pe(e);
+    const s = e === "-" ? i.length : Be(e);
     if (!r && s > i.length)
       throw new Error(
         `ADD operation failed: Target array index '${s}' is greater than array length ${i.length}. Path involving key '${e}'.`
       );
     if (s < 0 && e !== "-")
       throw new Error(`Invalid negative array index: ${e}`);
-    const n = _(t);
+    const n = x(t);
     if (r) {
       if (s >= 0 && s < i.length) i[s] = n;
       else if (s >= i.length) {
@@ -1866,18 +1865,18 @@ function Xe(i, e, t, r) {
     return;
   }
   if (i instanceof u) {
-    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? gs(i, e, _(t), r) : Mt(i, e, t);
+    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? as(i, e, x(t), r) : Ct(i, e, t);
     return;
   }
   if (le(i)) {
-    i[e] = _(t);
+    i[e] = x(t);
     return;
   }
   throw new Error(`Cannot insert into parent of type ${typeof i}`);
 }
-function ms(i, e) {
+function cs(i, e) {
   if (Array.isArray(i)) {
-    const t = Pe(e);
+    const t = Be(e);
     t === -1 && e === "-" ? i.length > 0 && i.pop() : t >= 0 && t < i.length && i.splice(t, 1);
     return;
   }
@@ -1885,22 +1884,22 @@ function ms(i, e) {
     if (typeof e == "number" || typeof e == "string" && /^-?\d+$/.test(e)) {
       const t = i.getItems();
       if (t) {
-        const r = Pe(e);
+        const r = Be(e);
         r === -1 && e === "-" ? t.length > 0 && t.pop() : r >= 0 && r < t.length && t.splice(r, 1), t.length === 0 && i.setItems(void 0);
         return;
       }
     }
-    Mt(i, e, void 0);
+    Ct(i, e, void 0);
   } else le(i) && delete i[e];
 }
-function Tt(i) {
+function gt(i) {
   if (i instanceof u) return i.clone();
   if (Array.isArray(i))
-    return i.map((t) => Tt(t));
+    return i.map((t) => gt(t));
   if (le(i)) {
     const e = {};
     return Object.keys(i).forEach((t) => {
-      e[t] = Tt(i[t]);
+      e[t] = gt(i[t]);
     }), e;
   }
   return i;
@@ -1918,76 +1917,76 @@ function ue(i, e) {
   }
   return !1;
 }
-function gr(i, e) {
-  const { parent: t, key: r } = Ne(i, Ee(e));
-  return Ot(t, r);
+function dr(i, e) {
+  const { parent: t, key: r } = Ee(i, be(e));
+  return Nt(t, r);
 }
-function mr(i, e, t) {
-  const r = Ee(e);
+function hr(i, e, t) {
+  const r = be(e);
   if (r.length === 0 && e === "/") {
-    const o = _(t);
+    const o = x(t);
     i.setValue(o.getValue() ?? null), o.getItems() ? i.setItems(o.getItems()) : i.setItems(void 0);
     return;
   }
-  const { parent: s, key: n } = Ne(i, r);
-  Xe(s, n, t, !0);
+  const { parent: s, key: n } = Ee(i, r);
+  Je(s, n, t, !0);
 }
-function Is(i, e, t) {
-  const r = Ee(e);
+function us(i, e, t) {
+  const r = be(e);
   if (r.length === 0 && e === "/") {
     if (i.getItems() && Array.isArray(t)) {
-      const o = _(t);
+      const o = x(t);
       o.getItems() ? (i.setItems(o.getItems()), i.setValue(null)) : (i.setValue(o.getValue() ?? null), i.setItems(void 0));
     } else {
-      const o = _(t);
+      const o = x(t);
       i.setValue(o.getValue() ?? null), o.getItems() && i.setItems(o.getItems());
     }
     return !0;
   }
-  const { parent: s, key: n } = Ne(i, r);
-  return Xe(s, n, t, !1), !0;
+  const { parent: s, key: n } = Ee(i, r);
+  return Je(s, n, t, !1), !0;
 }
-function vs(i, e, t) {
-  const r = Ee(e);
+function ds(i, e, t) {
+  const r = be(e);
   if (r.length === 0 && e === "/") {
-    const l = _(t);
+    const l = x(t);
     return i.setValue(l.getValue() ?? null), l.getItems() ? i.setItems(l.getItems()) : i.setItems(void 0), !0;
   }
-  const { parent: s, key: n, actualTarget: o } = Ne(i, r);
+  const { parent: s, key: n, actualTarget: o } = Ee(i, r);
   if (o !== void 0 && s instanceof u)
-    Mt(s, n, t);
+    Ct(s, n, t);
   else {
-    const l = Ot(s, n), a = Array.isArray(s) || s instanceof u && s.getItems() && (typeof n == "number" || typeof n == "string" && /^\d+$/.test(n));
+    const l = Nt(s, n), a = Array.isArray(s) || s instanceof u && s.getItems() && (typeof n == "number" || typeof n == "string" && /^\d+$/.test(n));
     if (l === void 0) {
       if (a)
         throw new Error(
           `REPLACE failed: Target array index '${n.toString()}' is out of bounds or does not exist at path '${e}'.`
         );
-      Xe(s, n, t, !0);
+      Je(s, n, t, !0);
     } else
-      Xe(s, n, t, !0);
+      Je(s, n, t, !0);
   }
   return !0;
 }
-function Ir(i, e) {
-  const t = Ee(e);
+function pr(i, e) {
+  const t = be(e);
   if (t.length === 0 && e === "/")
     return i.setValue(null), i.setItems(void 0), i.setProperties(void 0), !0;
-  const { parent: r, key: s } = Ne(i, t);
-  return ms(r, s), !0;
+  const { parent: r, key: s } = Ee(i, t);
+  return cs(r, s), !0;
 }
-function Ts(i, e, t) {
-  const r = Tt(gr(i, e));
-  return mr(i, t, r), !0;
+function hs(i, e, t) {
+  const r = gt(dr(i, e));
+  return hr(i, t, r), !0;
 }
-function Bs(i, e, t) {
-  const r = Ee(e), { parent: s, key: n } = Ne(i, r), o = Ot(s, n);
+function ps(i, e, t) {
+  const r = be(e), { parent: s, key: n } = Ee(i, r), o = Nt(s, n);
   if (o === void 0)
     throw new Error(`MOVE failed: 'from' location '${e}' does not exist.`);
-  return Ir(i, e) ? (mr(i, t, o), !0) : !1;
+  return pr(i, e) ? (hr(i, t, o), !0) : !1;
 }
-function Ps(i, e, t) {
-  const r = gr(i, e);
+function fs(i, e, t) {
+  const r = dr(i, e);
   let s = t;
   if (r instanceof u)
     if ((t === null || typeof t == "string" || typeof t == "number" || typeof t == "boolean" || q(t)) && (r.isInlineValue() || r.getValue() !== void 0)) {
@@ -1998,9 +1997,9 @@ function Ps(i, e, t) {
           )}, got ${JSON.stringify(r.getValue() ?? null)}`
         );
       return !0;
-    } else typeof t == "object" && !(t instanceof u) && (s = _(t));
+    } else typeof t == "object" && !(t instanceof u) && (s = x(t));
   else if (q(r) && typeof t == "number")
-    r instanceof A ? s = new A(t.toString()) : r instanceof $ && (s = new $(t.toString()));
+    r instanceof A ? s = new A(t.toString()) : r instanceof _ && (s = new _(t.toString()));
   else if ((r === null || typeof r == "string" || typeof r == "number" || typeof r == "boolean") && q(t)) {
     const n = t;
     !ue(r, n.toString()) && (typeof r == "number" && parseFloat(n.toString()));
@@ -2013,91 +2012,91 @@ function Ps(i, e, t) {
   }
   return !0;
 }
-function ws(i, e) {
+function ys(i, e) {
   switch (e.op) {
     case "add":
-      return Is(i, e.path, e.val);
+      return us(i, e.path, e.val);
     case "replace":
-      return vs(i, e.path, e.val);
+      return ds(i, e.path, e.val);
     case "remove":
-      return Ir(i, e.path);
+      return pr(i, e.path);
     case "copy":
-      return Ts(i, e.from, e.path);
+      return hs(i, e.from, e.path);
     case "move":
-      return Bs(i, e.from, e.path);
+      return ps(i, e.from, e.path);
     case "test":
-      return Ps(i, e.path, e.val);
+      return fs(i, e.path, e.val);
   }
 }
-function Mn(i, e, t = !1) {
+function gn(i, e, t = !1) {
   const r = t ? i : i.clone();
-  return ws(r, e), r;
+  return ys(r, e), r;
 }
-const dt = Symbol.for("zod-schema-annotations");
-function Ss() {
+const at = Symbol.for("zod-schema-annotations");
+function gs() {
   if (typeof globalThis < "u") return globalThis;
   if (typeof global < "u") return global;
   if (typeof window < "u") return window;
   if (typeof self < "u") return self;
   throw new Error("Unable to locate global object");
 }
-function vr() {
-  const i = Ss();
-  return dt in i || (i[dt] = /* @__PURE__ */ new WeakMap()), i[dt];
+function fr() {
+  const i = gs();
+  return at in i || (i[at] = /* @__PURE__ */ new WeakMap()), i[at];
 }
 function $e(i, e) {
-  const t = vr(), r = t.get(i) || {};
+  const t = fr(), r = t.get(i) || {};
   return t.set(i, { ...r, ...e }), i;
 }
-const Z = (i) => vr().get(i), bs = (i) => (e) => {
+const Z = (i) => fr().get(i), ms = (i) => (e) => {
   const t = Z(e);
   return $e(e, {
     ...t,
     blueDescription: i
   });
-}, Es = (i) => {
+}, Is = (i) => {
   const e = Z(i);
-  return p(e) && St(e.blueDescription) ? e.blueDescription : null;
-}, Dn = (i) => bs(i)(y.string().optional()), Ns = y.union([y.string(), y.boolean()]), Cs = (i) => (e) => {
+  return d(e) && vt(e.blueDescription) ? e.blueDescription : null;
+}, mn = (i) => ms(i)(f.string().optional()), vs = f.union([f.string(), f.boolean()]), Ts = (i) => (e) => {
   const t = Z(e);
   return $e(e, {
     ...t,
     blueId: i
   });
-}, Rs = (i) => {
-  const e = Z(i), t = Ns.safeParse(e?.blueId);
+}, Bs = (i) => {
+  const e = Z(i), t = vs.safeParse(e?.blueId);
   return t.success ? t.data : null;
-}, xn = (i) => Cs(i ?? !0)(y.string()), As = (i) => (e) => {
+}, In = (i) => Ts(i ?? !0)(f.string()), Ps = (i) => (e) => {
   const t = Z(e);
   return $e(e, {
     ...t,
     blueName: i
   });
-}, Vs = (i) => {
+}, ws = (i) => {
   const e = Z(i);
-  return p(e) && St(e.blueName) ? e.blueName : null;
-}, Ln = (i) => {
-  const e = y.string().optional();
-  return As(i)(e);
-}, Os = () => (i) => {
+  return d(e) && vt(e.blueName) ? e.blueName : null;
+}, vn = (i) => {
+  const e = f.string().optional();
+  return Ps(i)(e);
+}, Ss = () => (i) => {
   const e = Z(i);
   return $e(i, {
     ...e,
     blueNode: !0
   });
-}, Ms = (i) => {
+}, bs = (i) => {
   const e = Z(i);
-  return p(e) && p(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
-}, Tr = (i) => !!Ms(i), $n = () => {
-  const i = y.instanceof(u);
-  return Os()(i);
-}, Ds = y.object({
-  value: y.array(y.string()).optional(),
-  defaultValue: y.string().optional()
-}), xs = (i) => {
-  const e = Z(i), t = Ds.passthrough().safeParse(e?.typeBlueId);
+  return d(e) && d(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
+}, yr = (i) => !!bs(i), Tn = () => {
+  const i = f.instanceof(u);
+  return Ss()(i);
+}, Es = f.object({
+  value: f.array(f.string()).optional(),
+  defaultValue: f.string().optional()
+}), Ns = (i) => {
+  const e = Z(i), t = Es.passthrough().safeParse(e?.typeBlueId);
   return t.success ? t.data : null;
-}, Ls = (i) => (e) => {
+}, Bn = (i) => (e) => {
   const t = Z(e), r = typeof i == "string" ? { value: [i] } : i;
   return $e(e, {
     ...t,
@@ -2109,31 +2108,31 @@ const Z = (i) => vr().get(i), bs = (i) => (e) => {
 };
 class Oe {
   static resolveBlueId(e) {
-    const t = xs(e);
-    if (v(t))
+    const t = Ns(e);
+    if (I(t))
       return null;
     const r = t.defaultValue;
-    if (p(r))
+    if (d(r))
       return r;
     const s = t.value?.[0];
-    return p(s) ? s : Oe.getRepositoryBlueId(t, e);
+    return d(s) ? s : Oe.getRepositoryBlueId(t, e);
   }
   static getRepositoryBlueId(e, t) {
     throw new Error("Not implemented");
   }
 }
-class k {
+class H {
   // TODO: Enhance to support schemas associated with multiple blueIds
   static isTypeOf(e, t, r) {
     const s = Oe.resolveBlueId(t), n = e.getType()?.getBlueId();
-    if (v(s) || v(n))
+    if (I(s) || I(n))
       return !1;
     const o = r?.blueIdMapper?.toCurrentBlueId(s) ?? s, l = r?.blueIdMapper?.toCurrentBlueId(n) ?? n;
     if (o === l)
       return !0;
-    if (r?.checkSchemaExtensions && p(r.typeSchemaResolver)) {
+    if (r?.checkSchemaExtensions && d(r.typeSchemaResolver)) {
       const a = r.typeSchemaResolver.resolveSchema(e);
-      return k.checkSchemaExtension(a, t, {
+      return H.checkSchemaExtension(a, t, {
         typeSchemaResolver: r.typeSchemaResolver
       });
     }
@@ -2143,35 +2142,35 @@ class k {
    * Checks if a schema extends a base schema.
    */
   static checkSchemaExtension(e, t, r) {
-    if (!p(e))
+    if (!d(e))
       return !1;
-    const s = k.unwrapSchema(e), n = k.unwrapSchema(t);
-    return p(r?.typeSchemaResolver) ? r.typeSchemaResolver.isSchemaExtendedFrom(
+    const s = H.unwrapSchema(e), n = H.unwrapSchema(t);
+    return d(r?.typeSchemaResolver) ? r.typeSchemaResolver.isSchemaExtendedFrom(
       s,
       n
     ) : !1;
   }
   static isWrapperType(e) {
-    return e instanceof Xt || e instanceof qt || e instanceof Qt || e instanceof er || e instanceof Ge || e instanceof Je;
+    return e instanceof Yt || e instanceof Wt || e instanceof Gt || e instanceof Jt || e instanceof Ye || e instanceof We;
   }
   static unwrapSchema(e) {
-    return Tr(e) ? e : k.isWrapperType(e) ? e instanceof Ge ? k.unwrapSchema(e.innerType()) : e instanceof Je ? k.unwrapSchema(e.schema) : k.unwrapSchema(e.unwrap()) : e;
+    return yr(e) ? e : H.isWrapperType(e) ? e instanceof Ye ? H.unwrapSchema(e.innerType()) : e instanceof We ? H.unwrapSchema(e.schema) : H.unwrapSchema(e.unwrap()) : e;
   }
 }
-const Br = Symbol("blue.subtypeCache");
-function $s(i, e) {
-  return i[Br] = e, i;
+const gr = Symbol("blue.subtypeCache");
+function Cs(i, e) {
+  return i[gr] = e, i;
 }
-function zt(i, e) {
+function _t(i, e) {
   const t = i.getType();
   if (t === void 0)
     return;
   const r = t.getBlueId();
   if (r !== void 0) {
-    if (fe.includes(
+    if (pe.includes(
       r
     )) {
-      const n = st[r];
+      const n = et[r];
       return new u().setBlueId(r).setName(n);
     }
     const s = e.fetchByBlueId(r);
@@ -2186,10 +2185,10 @@ function zt(i, e) {
   return t;
 }
 function E(i, e, t) {
-  const r = qe(i), s = qe(e), n = t[Br], o = `${r}|${s}`, l = n?.get(o);
+  const r = Ze(i), s = Ze(e), n = t[gr], o = `${r}|${s}`, l = n?.get(o);
   if (l !== void 0)
     return l;
-  const a = _s(
+  const a = Rs(
     i,
     e,
     t,
@@ -2198,14 +2197,14 @@ function E(i, e, t) {
   );
   return n?.set(o, a), a;
 }
-function qe(i) {
+function Ze(i) {
   const e = i.getReferenceBlueId();
   return e !== void 0 ? e : M.calculateBlueIdSync(
     se(i)
   );
 }
 function se(i) {
-  if (!Pr(i))
+  if (!mr(i))
     return i;
   const e = i.cloneShallow();
   e.getReferenceBlueId() !== void 0 && !b.hasBlueIdOnly(e) && e.setReferenceBlueId(void 0);
@@ -2226,14 +2225,14 @@ function se(i) {
   const a = e.getProperties();
   return a !== void 0 && e.setProperties(
     Object.fromEntries(
-      Object.entries(a).map(([c, d]) => [
+      Object.entries(a).map(([c, h]) => [
         c,
-        se(d)
+        se(h)
       ])
     )
   ), e;
 }
-function Pr(i) {
+function mr(i) {
   return i.getReferenceBlueId() !== void 0 && !b.hasBlueIdOnly(i) ? !0 : [
     i.getType(),
     i.getItemType(),
@@ -2243,20 +2242,20 @@ function Pr(i) {
     ...i.getItems() ?? [],
     ...Object.values(i.getProperties() ?? {})
   ].some(
-    (t) => t !== void 0 && Pr(t)
+    (t) => t !== void 0 && mr(t)
   );
 }
-function _s(i, e, t, r, s) {
+function Rs(i, e, t, r, s) {
   if (r === s)
     return !0;
-  if (r && fe.includes(
+  if (r && pe.includes(
     r
   )) {
     let a = e;
     for (; a !== void 0; ) {
-      if (qe(a) === r)
+      if (Ze(a) === r)
         return !0;
-      a = zt(a, t);
+      a = _t(a, t);
     }
     return !1;
   }
@@ -2268,50 +2267,50 @@ function _s(i, e, t, r, s) {
   }
   let l = n;
   for (; l !== void 0; ) {
-    if (qe(l) === s)
+    if (Ze(l) === s)
       return !0;
-    l = zt(l, t);
+    l = _t(l, t);
   }
   return !1;
 }
-function js(i, e) {
-  return At.some((t) => {
+function As(i, e) {
+  return bt.some((t) => {
     const r = new u().setBlueId(t);
     return E(i, r, e);
   });
 }
-function Fs(i, e) {
+function Vs(i, e) {
   const t = new u().setBlueId(Q);
   return E(i, t, e);
 }
-function Us(i, e) {
+function Os(i, e) {
   const t = new u().setBlueId(te);
   return E(i, t, e);
 }
-function zs(i, e) {
+function Ms(i, e) {
   const t = new u().setBlueId(ee);
   return E(i, t, e);
 }
-function Ks(i, e) {
+function Ds(i, e) {
   const t = new u().setBlueId(re);
   return E(i, t, e);
 }
-function ke(i, e) {
-  const t = new u().setBlueId(rt);
+function ze(i, e) {
+  const t = new u().setBlueId(Qe);
   return E(i, t, e);
 }
-function He(i, e) {
-  const t = new u().setBlueId(Rt);
+function Ke(i, e) {
+  const t = new u().setBlueId(St);
   return E(i, t, e);
 }
-function ks(i, e) {
-  return tt.some((t) => {
+function Ls(i, e) {
+  return qe.some((t) => {
     const r = new u().setName(t);
     return E(i, r, e);
   });
 }
-function Hs(i, e) {
-  for (const t of tt) {
+function $s(i, e) {
+  for (const t of qe) {
     const r = new u().setName(t);
     if (E(i, r, e))
       return t;
@@ -2320,7 +2319,7 @@ function Hs(i, e) {
     `Cannot determine the basic type for node of type "${i.getName() || "unknown"}".`
   );
 }
-class Ys {
+class _s {
   blueIdMap = /* @__PURE__ */ new Map();
   nodeProvider;
   constructor(e = [], t) {
@@ -2332,7 +2331,7 @@ class Ys {
   }
   registerSchema(e) {
     const t = Oe.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);
@@ -2343,17 +2342,17 @@ class Ys {
   }
   resolveSchema(e) {
     const t = this.getEffectiveBlueId(e);
-    return v(t) ? null : this.blueIdMap.get(t);
+    return I(t) ? null : this.blueIdMap.get(t);
   }
   isSchemaExtendedFrom(e, t) {
-    if (v(e))
+    if (I(e))
       return !1;
     const r = this.getBlueIdForSchema(e), s = this.getBlueIdForSchema(t);
-    if (v(r) || v(s))
+    if (I(r) || I(s))
       return !1;
     if (r === s)
       return !0;
-    if (p(this.nodeProvider))
+    if (d(this.nodeProvider))
       try {
         const n = new u().setBlueId(r), o = new u().setBlueId(s);
         if (E(n, o, this.nodeProvider))
@@ -2363,10 +2362,10 @@ class Ys {
     return !1;
   }
   getBlueIdForSchema(e) {
-    if (v(e))
+    if (I(e))
       return null;
     const t = Oe.resolveBlueId(e);
-    if (p(t))
+    if (d(t))
       return t;
     for (const [r, s] of this.blueIdMap)
       if (s === e || s._def === e._def)
@@ -2375,18 +2374,18 @@ class Ys {
   }
   getEffectiveBlueId(e) {
     const t = e.getType();
-    return p(t) && p(t.getBlueId()) ? t.getBlueId() : p(t) ? M.calculateBlueIdSync(t) : null;
+    return d(t) && d(t.getBlueId()) ? t.getBlueId() : d(t) ? M.calculateBlueIdSync(t) : null;
   }
   getBlueIdMap() {
     return new Map(this.blueIdMap);
   }
 }
-class Dt {
+class Rt {
 }
-class Re {
+class Ce {
   static convert(e) {
-    const t = new Bt();
-    return Re.traverseNode(e, "", t), t.build();
+    const t = new mt();
+    return Ce.traverseNode(e, "", t), t.build();
   }
   static traverseNode(e, t, r) {
     if (!e)
@@ -2398,21 +2397,21 @@ class Re {
     }
     if (s)
       for (const [a, c] of Object.entries(s)) {
-        const d = `${t}/${a}`;
-        Re.traverseNode(c, d, r);
+        const h = `${t}/${a}`;
+        Ce.traverseNode(c, h, r);
       }
     if (n)
       for (let a = 0; a < n.length; a++) {
         const c = `${t}/${a}`;
-        Re.traverseNode(n[a], c, r);
+        Ce.traverseNode(n[a], c, r);
       }
   }
 }
-function Kt(i, e) {
+function xt(i, e) {
   const t = i.split(e), r = [...t].reverse().findIndex((n) => n !== ""), s = r === -1 ? 0 : t.length - r;
   return t.slice(0, s);
 }
-class nt extends Dt {
+class rt extends Rt {
   allowedPaths;
   maxDepth;
   currentPath = [];
@@ -2463,7 +2462,7 @@ class nt extends Dt {
    * @returns True if the path matches the allowed path pattern, false otherwise
    */
   matchesAllowedPath(e, t) {
-    const r = Kt(e, "/"), s = Kt(t, "/");
+    const r = xt(e, "/"), s = xt(t, "/");
     if (s.length > r.length)
       return !1;
     for (let n = 1; n < s.length; n++)
@@ -2505,7 +2504,7 @@ class nt extends Dt {
    * @returns The path limits
    */
   static withMaxDepth(e) {
-    const t = new Bt().setMaxDepth(e);
+    const t = new mt().setMaxDepth(e);
     for (let r = 1; r <= e; r++) {
       const s = "/" + Array(r).fill("*").join("/");
       t.addPath(s);
@@ -2518,17 +2517,17 @@ class nt extends Dt {
    * @returns The path limits
    */
   static withSinglePath(e) {
-    return new Bt().addPath(e).build();
+    return new mt().addPath(e).build();
   }
   /**
    * Creates path limits by analyzing the structure of a node.
    * Leaf paths (no properties and no items) are added as allowed paths.
    */
   static fromNode(e) {
-    return Re.convert(e);
+    return Ce.convert(e);
   }
 }
-class Bt {
+class mt {
   allowedPaths = /* @__PURE__ */ new Set();
   maxDepth = Number.MAX_SAFE_INTEGER;
   /**
@@ -2552,10 +2551,10 @@ class Bt {
    * @returns The built PathLimits
    */
   build() {
-    return new nt(this.allowedPaths, this.maxDepth);
+    return new rt(this.allowedPaths, this.maxDepth);
   }
 }
-class H extends Dt {
+class k extends Rt {
   /**
    * Determines if a path segment should be extended - always returns true
    * @returns Always true
@@ -2581,7 +2580,7 @@ class H extends Dt {
   exitPathSegment() {
   }
 }
-class ot extends Dt {
+class st extends Rt {
   limits;
   /**
    * Creates a composite limits with the specified limit strategies
@@ -2638,10 +2637,10 @@ class ot extends Dt {
    * @returns A new CompositeLimits instance
    */
   static of(...e) {
-    return new ot(e);
+    return new st(e);
   }
 }
-const F = new H();
+const F = new k();
 class J extends u {
   completeness;
   sourceSemanticBlueId;
@@ -2675,7 +2674,7 @@ class J extends u {
         "Cannot minimize a path-limited resolved node without a source semantic BlueId."
       );
     }
-    return new It().minimizeResolved(this);
+    return new ft().minimizeResolved(this);
   }
   /**
    * @deprecated Prefer `blue.calculateBlueIdSync(resolved)` so callers use the
@@ -2689,7 +2688,7 @@ class J extends u {
         "Cannot calculate minimal BlueId for a path-limited resolved node without a source semantic BlueId."
       );
     }
-    const t = new It().minimizeResolvedForHash(this);
+    const t = new ft().minimizeResolvedForHash(this);
     return M.calculateBlueIdSync(t);
   }
   /**
@@ -2720,7 +2719,7 @@ class J extends u {
   }
   validateSourceSemanticBlueId(e) {
     if (e !== void 0) {
-      if (!Be.isPotentialBlueId(e))
+      if (!ve.isPotentialBlueId(e))
         throw new Error("sourceSemanticBlueId must be a valid BlueId.");
       return e;
     }
@@ -2741,13 +2740,13 @@ class J extends u {
     t !== void 0 && this.setValue(t);
   }
 }
-class Ws {
+class xs {
   blue;
   constructor(e) {
     this.blue = e;
   }
   matchesType(e, t, r = F) {
-    const s = nt.fromNode(t), n = ot.of(r, s);
+    const s = rt.fromNode(t), n = st.of(r, s);
     let o, l;
     try {
       o = this.extendAndResolve(e, n), l = this.blue.resolve(t, n);
@@ -2788,9 +2787,9 @@ class Ws {
     if (n) {
       let a = e.getProperties();
       a || (a = {}, e.setProperties(a));
-      for (const [c, d] of Object.entries(n)) {
-        const h = a[c];
-        h === void 0 ? a[c] = d.clone() : this.restoreMissingStructure(h, d);
+      for (const [c, h] of Object.entries(n)) {
+        const p = a[c];
+        p === void 0 ? a[c] = h.clone() : this.restoreMissingStructure(p, h);
       }
     }
     const o = t.getBlueId();
@@ -2843,33 +2842,33 @@ class Ws {
     const c = e.getBlueId();
     if (!l && a === void 0 && c !== void 0 && e.getType() === void 0 && t.getItems() === void 0 && this.hasMatcherShape(t) && !this.matchesCalculatedBlueId(t, c))
       return !1;
-    const d = t.getValue();
-    if (d !== void 0) {
+    const h = t.getValue();
+    if (h !== void 0) {
       const P = e.getValue();
       if (P === void 0)
         return !1;
-      if (C(P) && C(d)) {
-        if (!P.eq(d))
+      if (C(P) && C(h)) {
+        if (!P.eq(h))
           return !1;
-      } else if (P !== d)
+      } else if (P !== h)
         return !1;
     }
-    const h = t.getItems(), f = r.getItems();
-    if (h !== void 0) {
+    const p = t.getItems(), y = r.getItems();
+    if (p !== void 0) {
       const P = e.getItems() ?? [];
-      for (let w = 0; w < h.length; w++)
+      for (let w = 0; w < p.length; w++)
         if (w < P.length) {
           if (!this.recursiveValueComparison(
             P[w],
-            h[w],
-            f?.[w] ?? h[w],
+            p[w],
+            y?.[w] ?? p[w],
             s
           ))
             return !1;
-        } else if (this.hasValueInNestedStructure(h[w]))
+        } else if (this.hasValueInNestedStructure(p[w]))
           return !1;
     }
-    const g = t.getItemType(), I = r.getItemType();
+    const g = t.getItemType(), v = r.getItemType();
     if (g !== void 0) {
       const P = e.getItems() ?? [];
       for (const w of P)
@@ -2877,12 +2876,12 @@ class Ws {
           this.resolveUntypedNodeAgainstMatcherType(
             w,
             g,
-            I ?? g,
+            v ?? g,
             s,
             "type-reference"
           ),
           g,
-          I ?? g,
+          v ?? g,
           s,
           { bareBlueIdMatcherMode: "type-reference" }
         ))
@@ -2891,32 +2890,32 @@ class Ws {
     const D = t.getProperties(), R = r.getProperties();
     if (D !== void 0) {
       const P = e.getProperties() ?? {};
-      for (const [w, lt] of Object.entries(D))
+      for (const [w, it] of Object.entries(D))
         if (w in P) {
           if (!this.recursiveValueComparison(
             P[w],
-            lt,
-            R?.[w] ?? lt,
+            it,
+            R?.[w] ?? it,
             s
           ))
             return !1;
-        } else if (this.hasValueInNestedStructure(lt))
+        } else if (this.hasValueInNestedStructure(it))
           return !1;
     }
-    const x = t.getValueType(), je = r.getValueType();
-    if (x !== void 0) {
+    const L = t.getValueType(), _e = r.getValueType();
+    if (L !== void 0) {
       const P = Object.values(e.getProperties() ?? {});
       for (const w of P)
         if (!this.recursiveValueComparison(
           this.resolveUntypedNodeAgainstMatcherType(
             w,
-            x,
-            je ?? x,
+            L,
+            _e ?? L,
             s,
             "type-reference"
           ),
-          x,
-          je ?? x,
+          L,
+          _e ?? L,
           s,
           { bareBlueIdMatcherMode: "type-reference" }
         ))
@@ -2985,31 +2984,31 @@ class Ws {
     const l = e.getValueType();
     l !== void 0 && t.setValueType(this.toPlainBlueNode(l));
     const a = e.getItems();
-    a !== void 0 && t.setItems(a.map((h) => this.toPlainBlueNode(h)));
+    a !== void 0 && t.setItems(a.map((p) => this.toPlainBlueNode(p)));
     const c = e.getProperties();
     c !== void 0 && t.setProperties(
       Object.fromEntries(
-        Object.entries(c).map(([h, f]) => [
-          h,
-          this.toPlainBlueNode(f)
+        Object.entries(c).map(([p, y]) => [
+          p,
+          this.toPlainBlueNode(y)
         ])
       )
     );
-    const d = e.getBlue();
-    return d !== void 0 && t.setBlue(this.toPlainBlueNode(d)), t;
+    const h = e.getBlue();
+    return h !== void 0 && t.setBlue(this.toPlainBlueNode(h)), t;
   }
   /**
    * Determines whether a node without an explicit type already satisfies the
    * shape of the requested core list or dictionary type.
    */
   matchesImplicitStructure(e, t) {
-    return t === void 0 || e.getType() !== void 0 ? !1 : ke(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : He(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
+    return t === void 0 || e.getType() !== void 0 ? !1 : ze(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : Ke(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
   }
   matchesImplicitCoreCollectionType(e, t) {
-    return e.getType() !== void 0 ? !1 : ke(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : He(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
+    return e.getType() !== void 0 ? !1 : ze(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : Ke(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
   }
   isCoreCollectionType(e) {
-    return ke(e, this.blue.getNodeProvider()) || He(e, this.blue.getNodeProvider());
+    return ze(e, this.blue.getNodeProvider()) || Ke(e, this.blue.getNodeProvider());
   }
   isImplicitListStructure(e) {
     return e.getItems() !== void 0 && e.getValue() === void 0;
@@ -3058,15 +3057,15 @@ class Ws {
     const a = e.getItems();
     a && e.setItems(
       a.map(
-        (d) => this.expandSchemaTypeReferences(d, r)
+        (h) => this.expandSchemaTypeReferences(h, r)
       )
     );
     const c = e.getProperties();
     return c && e.setProperties(
       Object.fromEntries(
-        Object.entries(c).map(([d, h]) => [
-          d,
-          this.expandSchemaTypeReferences(h, r)
+        Object.entries(c).map(([h, p]) => [
+          h,
+          this.expandSchemaTypeReferences(p, r)
         ])
       )
     ), e;
@@ -3242,7 +3241,7 @@ class O {
     ].filter((t) => t !== void 0);
   }
 }
-class ye {
+class fe {
   /**
    * Fetches the first node associated with the given Blue ID
    * Default implementation that takes the first node from fetchByBlueId result
@@ -3255,14 +3254,14 @@ class ye {
     return t && t.length > 0 ? t[0] : null;
   }
 }
-function xt(i) {
-  return new class extends ye {
+function At(i) {
+  return new class extends fe {
     fetchByBlueId(e) {
       return i(e);
     }
   }();
 }
-class Gs {
+class Fs {
   /**
    * Resolves a node without limits
    * Default implementation that uses NO_LIMITS
@@ -3274,7 +3273,7 @@ class Gs {
     return this.resolve(e, F);
   }
 }
-class wr extends ye {
+class Ir extends fe {
   nodeProviders;
   constructor(e) {
     super(), this.nodeProviders = e;
@@ -3301,31 +3300,31 @@ class wr extends ye {
     return this.nodeProviders;
   }
 }
-const ht = pe.types.float.options, Js = {
-  ...ht,
+const ct = he.types.float.options, js = {
+  ...ct,
   construct: (i) => {
     const e = i.replace(/_/g, "").toLowerCase();
-    if (!Zt(e))
-      return new $(e);
-    if (ht.construct)
-      return ht.construct(i);
+    if (!kt(e))
+      return new _(e);
+    if (ct.construct)
+      return ct.construct(i);
   }
-}, Zs = new pe.Type("tag:yaml.org,2002:float", Js), pt = pe.types.int.options, Xs = {
-  ...pt,
+}, Us = new he.Type("tag:yaml.org,2002:float", js), ut = he.types.int.options, zs = {
+  ...ut,
   construct: (i) => {
     let e = i;
-    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !Zt(e))
+    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !kt(e))
       return new A(e);
-    if (pt.construct)
-      return pt.construct(i);
+    if (ut.construct)
+      return ut.construct(i);
   }
-}, qs = new pe.Type("tag:yaml.org,2002:int", Xs), Sr = pe.CORE_SCHEMA.extend({
-  implicit: [Zs, qs]
+}, Ks = new he.Type("tag:yaml.org,2002:int", zs), vr = he.CORE_SCHEMA.extend({
+  implicit: [Us, Ks]
 }), ae = (i) => {
-  const e = pe.load(i, { schema: Sr });
+  const e = he.load(i, { schema: vr });
   return e === void 0 ? void 0 : e;
-}, Qs = (i) => pe.dump(i, {
-  schema: Sr,
+}, Hs = (i) => he.dump(i, {
+  schema: vr,
   replacer: (e, t) => {
     if (C(t)) {
       if (oe(t)) {
@@ -3337,7 +3336,7 @@ const ht = pe.types.float.options, Js = {
     }
     return t;
   }
-}), br = `- type:
+}), Tr = `- type:
     blueId: 27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo
   mappings:
     Text: DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K
@@ -3348,20 +3347,20 @@ const ht = pe.types.float.options, Js = {
     Dictionary: G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj
 - type:
     blueId: FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4
-`, ei = `name: Transformation
-description: TODO`, ti = `name: Infer Basic Types For Untyped Values
+`, ks = `name: Transformation
+description: TODO`, Ys = `name: Infer Basic Types For Untyped Values
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation infers type details for Text, Integer, Number and Boolean.`, ri = `name: Replace Inline Types with BlueIds
+description: This transformation infers type details for Text, Integer, Number and Boolean.`, Ws = `name: Replace Inline Types with BlueIds
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation replaces`, si = [
-  br,
-  ei,
-  ti,
-  ri
+description: This transformation replaces`, Gs = [
+  Tr,
+  ks,
+  Ys,
+  Ws
 ];
-class ii extends ye {
+class Js extends fe {
   blueIdToNodesMap = /* @__PURE__ */ new Map();
   constructor() {
     super(), this.load();
@@ -3370,7 +3369,7 @@ class ii extends ye {
     return this.blueIdToNodesMap.get(e) || [];
   }
   load() {
-    for (const e of si) {
+    for (const e of Gs) {
       const t = ae(e);
       if (t === void 0) {
         console.error(`This content file is not valid YAML: ${e}`);
@@ -3388,11 +3387,11 @@ class ii extends ye {
     }
   }
 }
-class Lt extends ye {
-  static INSTANCE = new Lt();
+class Vt extends fe {
+  static INSTANCE = new Vt();
   nodeProvider;
   constructor() {
-    super(), this.nodeProvider = new ii();
+    super(), this.nodeProvider = new Js();
   }
   fetchByBlueId(e) {
     return this.nodeProvider.fetchByBlueId(e);
@@ -3405,11 +3404,11 @@ class Me {
    * @returns A wrapped NodeProvider that includes bootstrap providers
    */
   static wrap(e) {
-    const t = [Lt.INSTANCE];
-    return t.push(e), new wr(t);
+    const t = [Vt.INSTANCE];
+    return t.push(e), new Ir(t);
   }
 }
-class $t {
+class Ot {
   nodeProvider;
   strategy;
   /**
@@ -3436,20 +3435,20 @@ class $t {
     }
     try {
       const n = e.getBlueId();
-      if (n && b.hasBlueIdOnly(e) && !fe.includes(
+      if (n && b.hasBlueIdOnly(e) && !pe.includes(
         n
       )) {
-        const f = this.fetchNode(e);
-        if (f && f.length > 0) {
+        const y = this.fetchNode(e);
+        if (y && y.length > 0) {
           const g = this.shouldPreserveReferenceBlueId(
             r,
             s
           );
-          if (f.length === 1) {
-            const I = f[0];
-            this.mergeNodes(e, I, g);
+          if (y.length === 1) {
+            const v = y[0];
+            this.mergeNodes(e, v, g);
           } else {
-            const I = f.map((R) => R.clone()), D = new u().setItems(I);
+            const v = y.map((R) => R.clone()), D = new u().setItems(v);
             this.mergeNodes(e, D, g);
           }
         }
@@ -3462,14 +3461,14 @@ class $t {
       a && this.extendNode(a, t, "keyType", !0);
       const c = e.getValueType();
       c && this.extendNode(c, t, "valueType", !0);
-      const d = e.getProperties();
-      d && Object.entries(d).forEach(([f, g]) => {
-        this.extendNode(g, t, f, !1);
+      const h = e.getProperties();
+      h && Object.entries(h).forEach(([y, g]) => {
+        this.extendNode(g, t, y, !1);
       });
-      const h = e.getItems();
-      if (h && h.length > 0)
-        for (let f = 0; f < h.length; f++)
-          this.extendNode(h[f], t, String(f), !1);
+      const p = e.getItems();
+      if (p && p.length > 0)
+        for (let y = 0; y < p.length; y++)
+          this.extendNode(p[y], t, String(y), !1);
     } finally {
       s || t.exitPathSegment();
     }
@@ -3495,7 +3494,7 @@ class $t {
   mergeNodes(e, t, r) {
     r || e.setReferenceBlueId(void 0), e.setName(t.getName()), e.setDescription(t.getDescription()), e.setType(t.getType()?.clone()), e.setItemType(t.getItemType()?.clone()), e.setKeyType(t.getKeyType()?.clone()), e.setValueType(t.getValueType()?.clone());
     const s = t.getValue();
-    p(s) && e.setValue(s), e.setItems(t.getItems()?.map((o) => o.clone()));
+    d(s) && e.setValue(s), e.setItems(t.getItems()?.map((o) => o.clone()));
     const n = t.getProperties();
     e.setProperties(
       n === void 0 ? void 0 : Object.fromEntries(
@@ -3507,7 +3506,7 @@ class $t {
     ), e.setBlue(t.getBlue()?.clone());
   }
 }
-class de extends Gs {
+class de extends Fs {
   mergingProcessor;
   nodeProvider;
   /**
@@ -3533,13 +3532,13 @@ class de extends Gs {
     );
   }
   mergeWithContext(e, t, r) {
-    if (p(t.getBlue()))
+    if (d(t.getBlue()))
       throw new Error(
         'Document contains "blue" attribute. Preprocess document before merging.'
       );
     let s = e;
     const n = t.getType();
-    if (p(n)) {
+    if (d(n)) {
       const o = this.resolveTypeNode(n, r), l = this.getTypeOverlay(n, o, r);
       s = this.mergeObject(s, l, r);
       const a = t.cloneShallow().setType(o.clone());
@@ -3562,9 +3561,9 @@ class de extends Gs {
       r.nodeProvider
     );
     const o = t.getItems();
-    p(o) && (n = this.mergeChildren(n, t, r));
+    d(o) && (n = this.mergeChildren(n, t, r));
     const l = t.getProperties();
-    return p(l) && (n = this.mergeProperties(n, t, l, r)), p(t.getBlueId()) && (n = n.cloneShallow().setBlueId(t.getBlueId())), this.mergingProcessor.postProcess && (n = this.mergingProcessor.postProcess(
+    return d(l) && (n = this.mergeProperties(n, t, l, r)), d(t.getBlueId()) && (n = n.cloneShallow().setBlueId(t.getBlueId())), this.mergingProcessor.postProcess && (n = this.mergingProcessor.postProcess(
       n,
       t,
       r.nodeProvider
@@ -3587,7 +3586,7 @@ class de extends Gs {
   }
   mergeChildrenWithoutListControls(e, t, r) {
     const s = e.getItems();
-    if (v(s)) {
+    if (I(s)) {
       const o = [];
       for (let l = 0; l < t.length; l++) {
         const a = t[l];
@@ -3616,14 +3615,14 @@ class de extends Gs {
         this.enterPathSegment(r, String(o), t[o]);
         try {
           if (o >= n.length) {
-            const d = this.materializeForCurrentContext(
+            const h = this.materializeForCurrentContext(
               t[o],
               r
             );
-            n.push(d);
+            n.push(h);
             continue;
           }
-          const l = r.limits instanceof H ? t[o] : this.materializeForCurrentContext(t[o], r), a = this.calculateNodeBlueId(
+          const l = r.limits instanceof k ? t[o] : this.materializeForCurrentContext(t[o], r), a = this.calculateNodeBlueId(
             l,
             r
           ), c = this.calculateNodeBlueId(
@@ -3643,49 +3642,49 @@ class de extends Gs {
   mergeChildrenWithListControls(e, t, r) {
     const s = t.getItems() ?? [], n = e.getItems() ?? [], o = B.getMergePolicy(t, e), l = [...n];
     let a = 0, c = !1;
-    const d = s[0];
-    if (d !== void 0 && B.hasPreviousProperty(d)) {
-      if (B.getPreviousBlueId(d) === void 0)
+    const h = s[0];
+    if (h !== void 0 && B.hasPreviousProperty(h)) {
+      if (B.getPreviousBlueId(h) === void 0)
         throw new Error(
           "$previous list control must be exactly { $previous: { blueId: <id> } }."
         );
       c = !0, a = 1;
     }
-    const h = c && n.length === 0 && !(r.limits instanceof H), f = /* @__PURE__ */ new Set();
+    const p = c && n.length === 0 && !(r.limits instanceof k), y = /* @__PURE__ */ new Set();
     for (; a < s.length; a++) {
       const g = s[a];
       if (B.hasPreviousProperty(g))
         throw new Error(
           "$previous list control is allowed only as the first item."
         );
-      const I = B.readPosition(g);
-      if (I !== void 0) {
+      const v = B.readPosition(g);
+      if (v !== void 0) {
         if (o === "append-only")
           throw new Error("$pos is not allowed in append-only lists.");
-        if (I >= n.length)
+        if (v >= n.length)
           throw new Error(
-            `$pos ${I} is out of range for inherited list length ${n.length}.`
+            `$pos ${v} is out of range for inherited list length ${n.length}.`
           );
-        if (f.has(I))
-          throw new Error(`Duplicate $pos list overlay for index ${I}.`);
-        f.add(I);
+        if (y.has(v))
+          throw new Error(`Duplicate $pos list overlay for index ${v}.`);
+        y.add(v);
         const R = B.withoutPosition(g);
         if (!B.hasPayloadAfterRemovingPosition(g))
           throw new Error("$pos list control must include an item payload.");
-        if (!r.limits.shouldMergePathSegment(String(I), R))
+        if (!r.limits.shouldMergePathSegment(String(v), R))
           continue;
-        this.enterPathSegment(r, String(I), R);
+        this.enterPathSegment(r, String(v), R);
         try {
-          const x = l[I];
-          l[I] = x === void 0 || B.isReplacementPayload(R) ? this.materializeForCurrentContext(R, r) : this.mergeWithContext(x, R, r);
+          const L = l[v];
+          l[v] = L === void 0 || B.isReplacementPayload(R) ? this.materializeForCurrentContext(R, r) : this.mergeWithContext(L, R, r);
         } finally {
           this.exitPathSegment(r);
         }
         continue;
       }
       const D = l.length;
-      if (!(!h && !r.limits.shouldMergePathSegment(String(D), g))) {
-        if (h) {
+      if (!(!p && !r.limits.shouldMergePathSegment(String(D), g))) {
+        if (p) {
           l.push(
             this.materializeWithoutLimits(g, r)
           );
@@ -3726,28 +3725,28 @@ class de extends Gs {
       if (s.limits.shouldMergePathSegment(a, c)) {
         this.enterPathSegment(s, a, c);
         try {
-          const d = o[a], h = this.getPathLimitedListControlTarget(
-            d,
+          const h = o[a], p = this.getPathLimitedListControlTarget(
+            h,
             t,
             a,
             c,
             s
-          ), f = h ?? d, I = this.shouldMergePropertyWithoutPreResolve(
-            f,
+          ), y = p ?? h, v = this.shouldMergePropertyWithoutPreResolve(
+            y,
             c,
             s
-          ) ? this.mergeExistingProperty(f, c, s) : (() => {
+          ) ? this.mergeExistingProperty(y, c, s) : (() => {
             const R = this.materializeForCurrentContext(
               c,
               s
             );
-            return f === void 0 ? R : this.mergeObject(
-              f,
+            return y === void 0 ? R : this.mergeObject(
+              y,
               R,
               s
             );
-          })(), D = h === void 0 ? I : this.projectListNodeToCurrentLimits(I, s);
-          D !== d && (l || (o = { ...n }, l = !0), o[a] = D);
+          })(), D = p === void 0 ? v : this.projectListNodeToCurrentLimits(v, s);
+          D !== h && (l || (o = { ...n }, l = !0), o[a] = D);
         } finally {
           this.exitPathSegment(s);
         }
@@ -3761,7 +3760,7 @@ class de extends Gs {
    * through mergeWithContext so source type overlays are resolved.
    */
   shouldMergePropertyWithoutPreResolve(e, t, r) {
-    return v(e) || r.limits instanceof H ? p(e) && B.hasListControlItems(t.getItems()) : p(t.getItems()) || p(e.getItems());
+    return I(e) || r.limits instanceof k ? d(e) && B.hasListControlItems(t.getItems()) : d(t.getItems()) || d(e.getItems());
   }
   mergeExistingProperty(e, t, r) {
     if (e === void 0)
@@ -3780,11 +3779,11 @@ class de extends Gs {
   resolveWithContext(e, t) {
     const r = new u(), n = this.mergeWithContext(r, e, t).cloneShallow().setName(e.getName()).setDescription(e.getDescription()).setBlueId(e.getBlueId());
     return new J(n, {
-      completeness: t.limits instanceof H ? "full" : "path-limited"
+      completeness: t.limits instanceof k ? "full" : "path-limited"
     });
   }
   createResolutionContext(e) {
-    const t = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), s = $s(
+    const t = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), s = Cs(
       this.createResolutionNodeProvider(this.nodeProvider, t),
       r
     );
@@ -3803,9 +3802,9 @@ class de extends Gs {
   }
   resolveTypeNode(e, t) {
     const r = e.getBlueId();
-    if (p(r)) {
+    if (d(r)) {
       const s = this.createResolvedTypeCacheKey(r, t), n = t.resolvedTypeCache.get(s);
-      if (p(n) && !t.resolvingTypeKeys.has(s))
+      if (d(n) && !t.resolvingTypeKeys.has(s))
         return n;
       if (t.resolvingTypeBlueIds.has(r))
         return n ?? this.createCyclicTypeReference(r, t);
@@ -3827,22 +3826,22 @@ class de extends Gs {
   }
   createCyclicTypeReference(e, t) {
     return new J(new u().setReferenceBlueId(e), {
-      completeness: t.limits instanceof H ? "full" : "path-limited"
+      completeness: t.limits instanceof k ? "full" : "path-limited"
     });
   }
   resolveAndExtendTypeNode(e, t) {
     const r = e.clone();
-    return p(r.getBlueId()) && new $t(t.nodeProvider).extend(
+    return d(r.getBlueId()) && new Ot(t.nodeProvider).extend(
       r,
-      nt.withSinglePath("/")
+      rt.withSinglePath("/")
     ), this.resolveWithContext(r, t);
   }
   getTypeOverlay(e, t, r) {
     const s = e.getBlueId();
-    if (v(s))
+    if (I(s))
       return this.createTypeOverlay(t);
     const n = this.createResolvedTypeCacheKey(s, r), o = r.typeOverlayCache.get(n);
-    if (p(o))
+    if (d(o))
       return o;
     const l = this.createTypeOverlay(t);
     return r.resolvingTypeBlueIds.has(s) || r.typeOverlayCache.set(n, l), l;
@@ -3851,23 +3850,23 @@ class de extends Gs {
     return e.cloneShallow().setType(void 0).setBlueId(void 0);
   }
   createResolvedTypeCacheKey(e, t) {
-    return t.limits instanceof H ? e : `${e}|${this.getCurrentPointer(t)}`;
+    return t.limits instanceof k ? 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 H;
+    return e.limits instanceof k;
   }
   calculateNodeBlueId(e, t) {
     const r = t.nodeHashCache.get(e);
-    if (p(r))
+    if (d(r))
       return r;
-    const s = U.calculateHashMinimalBlueId(e);
+    const s = j.calculateHashMinimalBlueId(e);
     return t.nodeHashCache.set(e, s), s;
   }
   getPathLimitedListControlTarget(e, t, r, s, n) {
-    if (!(e === void 0 || n.limits instanceof H || !B.hasListControlItems(s.getItems())))
+    if (!(e === void 0 || n.limits instanceof k || !B.hasListControlItems(s.getItems())))
       return this.resolveFullInheritedProperty(t, r, n);
   }
   resolveFullInheritedProperty(e, t, r) {
@@ -3875,7 +3874,7 @@ class de extends Gs {
     if (s === void 0)
       return;
     const n = s.getBlueId();
-    if (p(n)) {
+    if (d(n)) {
       const a = r.nodeProvider.fetchByBlueId(n)?.[0];
       return a === void 0 ? void 0 : new de(this.mergingProcessor, r.nodeProvider).resolve(a, F).getProperties()?.[t]?.clone();
     }
@@ -3890,7 +3889,7 @@ class de extends Gs {
     );
   }
   createResolutionNodeProvider(e, t) {
-    return new class extends ye {
+    return new class extends fe {
       fetchByBlueId(r) {
         if (t.has(r))
           return t.get(r) ?? null;
@@ -3909,7 +3908,7 @@ class de extends Gs {
     e.pathStack.pop(), e.limits.exitPathSegment();
   }
 }
-class Er {
+class Br {
   mergingProcessors;
   /**
    * Creates a new SequentialMergingProcessor with the given processors
@@ -3934,14 +3933,14 @@ class Er {
     return this.mergingProcessors.reduce((s, n) => n.postProcess ? n.postProcess(s, t, r) : s, e);
   }
 }
-class Nr {
+class Pr {
   process(e, t) {
     const r = t.getValue();
-    if (p(r)) {
+    if (d(r)) {
       const s = e.getValue();
-      if (v(s))
+      if (I(s))
         return e.cloneShallow().setValue(r);
-      if (!ni(r, s))
+      if (!Zs(r, s))
         throw new Error(
           `Node values conflict. Source node value: ${r}, target node value: ${s}`
         );
@@ -3949,8 +3948,8 @@ class Nr {
     return e;
   }
 }
-const ni = (i, e) => oe(i) && oe(e) || yt(i) && yt(e) ? i.eq(e) : i === e;
-class Cr {
+const Zs = (i, e) => oe(i) && oe(e) || dt(i) && dt(e) ? i.eq(e) : i === e;
+class wr {
   process(e, t, r) {
     const s = e.getType(), n = t.getType();
     let o = e;
@@ -3976,10 +3975,10 @@ class Cr {
     return o;
   }
 }
-class Rr {
+class Sr {
   process(e, t, r) {
     const s = t.getItemType(), n = t.getType();
-    if (s !== void 0 && n !== void 0 && !ke(n, r))
+    if (s !== void 0 && n !== void 0 && !ze(n, r))
       throw new Error("Source node with itemType must have a List type");
     const o = e.getItemType();
     let l = e;
@@ -3991,12 +3990,12 @@ class Rr {
         o,
         r
       )) {
-        const h = T.get(s), f = T.get(o);
+        const p = T.get(s), y = T.get(o);
         throw new Error(
           `The source item type '${JSON.stringify(
-            h
+            p
           )}' is not a subtype of the target item type '${JSON.stringify(
-            f
+            y
           )}'.`
         );
       }
@@ -4004,19 +4003,19 @@ class Rr {
     }
     const a = l.getItemType(), c = t.getItems();
     if (a !== void 0 && c !== void 0)
-      for (const d of c) {
-        const h = d.getType();
-        if (h !== void 0 && !E(
-          h,
+      for (const h of c) {
+        const p = h.getType();
+        if (p !== void 0 && !E(
+          p,
           a,
           r
         )) {
-          const f = T.get(h), g = T.get(
+          const y = T.get(p), g = T.get(
             a
           );
           throw new Error(
             `Item of type '${JSON.stringify(
-              f
+              y
             )}' is not a subtype of the list's item type '${JSON.stringify(
               g
             )}'.`
@@ -4026,18 +4025,18 @@ class Rr {
     return l;
   }
 }
-class Ar {
+class br {
   process(e, t, r) {
     const s = t.getKeyType(), n = t.getValueType(), o = t.getType();
-    if ((s !== void 0 || n !== void 0) && o !== void 0 && !He(o, r))
+    if ((s !== void 0 || n !== void 0) && o !== void 0 && !Ke(o, r))
       throw new Error(
         "Source node with keyType or valueType must have a Dictionary type"
       );
     let l = this.processKeyType(e, t, r);
     l = this.processValueType(l, t, r);
-    const a = l.getKeyType(), c = l.getValueType(), d = t.getProperties();
-    return (a !== void 0 || c !== void 0) && d !== void 0 && Object.entries(d).forEach(([h, f]) => {
-      a !== void 0 && this.validateKeyType(h, a, r), c !== void 0 && this.validateValueType(f, c, r);
+    const a = l.getKeyType(), c = l.getValueType(), h = t.getProperties();
+    return (a !== void 0 || c !== void 0) && h !== void 0 && Object.entries(h).forEach(([p, y]) => {
+      a !== void 0 && this.validateKeyType(p, a, r), c !== void 0 && this.validateValueType(y, c, r);
     }), l;
   }
   processKeyType(e, t, r) {
@@ -4089,20 +4088,20 @@ class Ar {
     return e;
   }
   validateBasicKeyType(e, t) {
-    if (!js(e, t))
+    if (!As(e, t))
       throw new Error("Dictionary key type must be a basic type");
   }
   validateKeyType(e, t, r) {
-    if (!Fs(t, r))
-      if (Us(t, r)) {
+    if (!Vs(t, r))
+      if (Os(t, r)) {
         const s = Number.parseInt(e, 10);
         if (Number.isNaN(s) || s.toString() !== e)
           throw new Error(`Key '${e}' is not a valid Integer.`);
-      } else if (zs(t, r)) {
+      } else if (Ms(t, r)) {
         const s = Number.parseFloat(e);
         if (Number.isNaN(s))
           throw new Error(`Key '${e}' is not a valid Number.`);
-      } else if (Ks(t, r)) {
+      } else if (Ds(t, r)) {
         if (e.toLowerCase() !== "true" && e.toLowerCase() !== "false")
           throw new Error(`Key '${e}' is not a valid Boolean.`);
       } else
@@ -4124,16 +4123,16 @@ class Ar {
     }
   }
 }
-class Vr {
+class Er {
   process(e) {
     return e;
   }
   postProcess(e, t, r) {
     const s = e.getType();
-    if (s !== void 0 && ks(s, r)) {
+    if (s !== void 0 && Ls(s, r)) {
       const n = e.getItems(), o = e.getProperties();
       if (n !== void 0 && n.length > 0 || o !== void 0 && Object.keys(o).length > 0) {
-        const l = Hs(
+        const l = $s(
           s,
           r
         ), a = s.getName() || "unknown";
@@ -4145,7 +4144,7 @@ class Vr {
     return e;
   }
 }
-class Or {
+class Nr {
   process(e, t) {
     let r = e;
     const s = t.getName();
@@ -4154,33 +4153,33 @@ class Or {
     return n !== void 0 && n !== r.getDescription() && (r = r.cloneShallow().setDescription(n)), r;
   }
 }
-const _n = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Pn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BasicTypesVerifier: Vr,
-  DictionaryProcessor: Ar,
-  ListProcessor: Rr,
-  MetadataPropagator: Or,
-  SequentialMergingProcessor: Er,
-  TypeAssigner: Cr,
-  ValuePropagator: Nr
+  BasicTypesVerifier: Er,
+  DictionaryProcessor: br,
+  ListProcessor: Sr,
+  MetadataPropagator: Nr,
+  SequentialMergingProcessor: Br,
+  TypeAssigner: wr,
+  ValuePropagator: Pr
 }, Symbol.toStringTag, { value: "Module" }));
-function _e() {
-  return new Er([
+function Mt() {
+  return new Br([
+    new Pr(),
+    new wr(),
+    new Sr(),
+    new br(),
     new Nr(),
-    new Cr(),
-    new Rr(),
-    new Ar(),
-    new Or(),
-    new Vr()
+    new Er()
   ]);
 }
-class Ye {
+class He {
   nodeProvider;
   mergingProcessor;
-  minimizer = new It();
+  minimizer = new ft();
   cyclicSetIdentity;
   constructor(e = {}) {
-    this.nodeProvider = e.nodeProvider ?? xt(() => []), this.mergingProcessor = e.mergingProcessor ?? _e(), this.cyclicSetIdentity = this.createCyclicSetIdentityService();
+    this.nodeProvider = e.nodeProvider ?? At(() => []), this.mergingProcessor = e.mergingProcessor ?? Mt(), this.cyclicSetIdentity = this.createCyclicSetIdentityService();
   }
   /** @internal */
   createCyclicSetIdentityService() {
@@ -4278,7 +4277,7 @@ class Ye {
   }
   createCyclicReferenceNodeProvider() {
     const e = this.nodeProvider;
-    return new class extends ye {
+    return new class extends fe {
       fetchByBlueId(t) {
         return t === O.ZERO_BLUE_ID || O.isIndexedThisReference(t) ? [new u().setReferenceBlueId(t)] : e.fetchByBlueId(t);
       }
@@ -4311,12 +4310,12 @@ class Ye {
     return this.minimizeAuthoring(t).getItems() ?? [];
   }
 }
-class oi {
+class Xs {
   semanticIdentity;
   cyclicSetIdentity;
   constructor(e = {}) {
-    const t = e.nodeProvider ?? xt(() => []), r = e.mergingProcessor ?? _e();
-    this.semanticIdentity = new Ye({
+    const t = e.nodeProvider ?? At(() => []), r = e.mergingProcessor ?? Mt();
+    this.semanticIdentity = new He({
       nodeProvider: t,
       mergingProcessor: r
     }), this.cyclicSetIdentity = this.semanticIdentity.createCyclicSetIdentityService();
@@ -4382,12 +4381,12 @@ class oi {
     );
   }
 }
-const li = (i) => i instanceof Xt || i instanceof qt || i instanceof Qt || i instanceof er || i instanceof Ge || i instanceof Je, ai = (i) => i instanceof ge || i instanceof me || i instanceof ze || i instanceof Ke;
-class Mr {
+const qs = (i) => i instanceof Yt || i instanceof Wt || i instanceof Gt || i instanceof Jt || i instanceof Ye || i instanceof We, Qs = (i) => i instanceof ye || i instanceof ge || i instanceof je || i instanceof Ue;
+class Cr {
   static convertValue(e, t) {
     const r = e.getType()?.getBlueId(), s = e.getValue();
-    return v(s) ? ai(t) && b.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : s : Q === r ? this.convertFromString(String(s), t) : ee === r || s instanceof $ ? this.convertFromBigDecimal(
-      new $(s?.toString()),
+    return I(s) ? Qs(t) && b.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : s : Q === r ? this.convertFromString(String(s), t) : ee === r || s instanceof _ ? this.convertFromBigDecimal(
+      new _(s?.toString()),
       t
     ) : te === r || s instanceof A ? this.convertFromBigInteger(
       new A(s?.toString()),
@@ -4395,62 +4394,62 @@ class Mr {
     ) : re === r || typeof s == "boolean" ? this.convertFromBoolean(!!s, t) : this.convertFromString(String(s), t);
   }
   static convertFromString(e, t) {
-    if (!t || t instanceof ge || t instanceof Fr || t instanceof Ur)
+    if (!t || t instanceof ye || t instanceof Or || t instanceof Mr)
       return e;
-    if (t instanceof me)
+    if (t instanceof ge)
       return Number(e);
-    if (t instanceof ze)
+    if (t instanceof je)
       return e.toLowerCase() === "true";
-    if (t instanceof Ke)
+    if (t instanceof Ue)
       return BigInt(e);
     throw new Error(`Cannot convert String to ${t._def.typeName}`);
   }
   static convertFromBigDecimal(e, t) {
-    if (t instanceof me)
-      return e.toNumber();
     if (t instanceof ge)
+      return e.toNumber();
+    if (t instanceof ye)
       return e.toString();
     throw new Error(`Cannot convert Number to ${t._def.typeName}`);
   }
   static convertFromBigInteger(e, t) {
-    if (t instanceof me)
+    if (t instanceof ge)
       return e.toNumber();
-    if (t instanceof Ke)
+    if (t instanceof Ue)
       return BigInt(e.toString());
-    if (t instanceof ge)
+    if (t instanceof ye)
       return e.toString();
     throw new Error(`Cannot convert Number to ${t._def.typeName}`);
   }
   static convertFromBoolean(e, t) {
-    if (!t || t instanceof ze)
+    if (!t || t instanceof je)
       return e;
-    if (t instanceof ge)
+    if (t instanceof ye)
       return e.toString();
-    if (t instanceof me)
+    if (t instanceof ge)
       return Number(e);
-    if (t instanceof Ke)
+    if (t instanceof Ue)
       return BigInt(e);
     throw new Error(`Cannot convert Boolean to ${t._def.typeName}`);
   }
   static getDefaultPrimitiveValue(e) {
     if (!e) return null;
-    if (e instanceof me)
+    if (e instanceof ge)
       return 0;
-    if (e instanceof ze)
+    if (e instanceof je)
       return !1;
-    if (e instanceof ge)
+    if (e instanceof ye)
       return "";
     throw new Error(
       `Unsupported primitive type: ${e._def.typeName}`
     );
   }
 }
-class ci {
+class ei {
   convert(e, t) {
-    return Mr.convertValue(e, t);
+    return Cr.convertValue(e, t);
   }
 }
-class ui {
+class ti {
   constructor(e, t) {
     this.nodeToObjectConverter = e, this.calculateBlueId = t;
   }
@@ -4458,28 +4457,28 @@ class ui {
     return this.convertFields(e, t);
   }
   convertFields(e, t) {
-    if (t instanceof zr) {
+    if (t instanceof Dr) {
       const r = t._def.left, s = t._def.right, n = this.convert(e, r), o = this.convert(e, s);
       return { ...n, ...o };
     }
-    if (t instanceof Kr)
+    if (t instanceof Lr)
       throw new Error("Union not supported");
-    if (t instanceof kr)
+    if (t instanceof $r)
       return Object.keys(t.shape).reduce(
         (s, n) => {
-          const o = e.getProperties(), l = t.shape[n], a = Rs(l);
-          if (p(a)) {
-            const g = St(a) ? a : n, I = o?.[g], D = I ? this.calculateBlueId(I) : void 0;
+          const o = e.getProperties(), l = t.shape[n], a = Bs(l);
+          if (d(a)) {
+            const g = vt(a) ? a : n, v = o?.[g], D = v ? this.calculateBlueId(v) : void 0;
             return s[n] = D, s;
           }
-          const c = Vs(l);
-          if (p(c)) {
+          const c = ws(l);
+          if (d(c)) {
             const g = o?.[c];
             return s[n] = g?.getName(), s;
           }
-          const d = Es(l);
-          if (p(d)) {
-            const g = o?.[d];
+          const h = Is(l);
+          if (d(h)) {
+            const g = o?.[h];
             return s[n] = g?.getDescription(), s;
           }
           if (n === "name") {
@@ -4490,21 +4489,21 @@ class ui {
             const g = e.getDescription();
             return s[n] = g, s;
           }
-          const h = o?.[n];
-          if (v(h))
+          const p = o?.[n];
+          if (I(p))
             return s;
-          const f = this.nodeToObjectConverter.convert(
-            h,
+          const y = this.nodeToObjectConverter.convert(
+            p,
             l
           );
-          return s[n] = f, s;
+          return s[n] = y, s;
         },
         {}
       );
     throw new Error("Unknown schema type, " + t._def.typeName);
   }
 }
-class di {
+class ri {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -4518,7 +4517,7 @@ class di {
     );
   }
 }
-class hi {
+class si {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -4532,35 +4531,35 @@ class hi {
     return new Set(n);
   }
 }
-class pi {
+class ii {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
   convert(e, t) {
     const r = t.keySchema, s = t.valueSchema, n = /* @__PURE__ */ new Map(), o = e.getName();
-    p(o) && n.set(ie, o);
+    d(o) && n.set(ie, o);
     const l = e.getDescription();
-    p(l) && n.set(ne, l);
+    d(l) && n.set(ne, l);
     const a = e.getProperties();
-    return p(a) && Object.entries(a).forEach(([c, d]) => {
-      const h = new u().setValue(c);
-      h.setType(new u().setBlueId(Q));
-      const f = Mr.convertValue(h, r), g = this.nodeToObjectConverter.convert(d, s);
-      n.set(f, g);
-    }), t instanceof Hr ? Object.fromEntries(n) : n;
+    return d(a) && Object.entries(a).forEach(([c, h]) => {
+      const p = new u().setValue(c);
+      p.setType(new u().setBlueId(Q));
+      const y = Cr.convertValue(p, r), g = this.nodeToObjectConverter.convert(h, s);
+      n.set(y, g);
+    }), t instanceof _r ? Object.fromEntries(n) : n;
   }
 }
-class fi {
+class ni {
   convert(e) {
     return T.get(e);
   }
 }
-class yi {
+class oi {
   convert(e) {
     return T.get(e);
   }
 }
-class gi {
+class li {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -4574,25 +4573,25 @@ class gi {
     );
   }
 }
-const mi = y.union([
-  y.literal("ZodString"),
-  y.literal("ZodNumber"),
-  y.literal("ZodBoolean"),
-  y.literal("ZodBigInt"),
-  y.literal("ZodArray"),
-  y.literal("ZodSet"),
-  y.literal("ZodMap"),
-  y.literal("ZodRecord"),
-  y.literal("ZodObject"),
-  y.literal("ZodEnum"),
-  y.literal("ZodNativeEnum"),
-  y.literal("ZodUnknown"),
-  y.literal("ZodAny"),
-  y.literal("ZodTuple")
+const ai = f.union([
+  f.literal("ZodString"),
+  f.literal("ZodNumber"),
+  f.literal("ZodBoolean"),
+  f.literal("ZodBigInt"),
+  f.literal("ZodArray"),
+  f.literal("ZodSet"),
+  f.literal("ZodMap"),
+  f.literal("ZodRecord"),
+  f.literal("ZodObject"),
+  f.literal("ZodEnum"),
+  f.literal("ZodNativeEnum"),
+  f.literal("ZodUnknown"),
+  f.literal("ZodAny"),
+  f.literal("ZodTuple")
 ]);
-class Ii {
+class ci {
   constructor(e, t) {
-    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new ui(
+    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new ti(
       this.nodeToObjectConverter,
       t
     );
@@ -4600,60 +4599,60 @@ class Ii {
   converters = /* @__PURE__ */ new Map();
   complexObjectConverter;
   registerConverters() {
-    const e = new ci(), t = new di(this.nodeToObjectConverter), r = new gi(this.nodeToObjectConverter), s = new hi(this.nodeToObjectConverter), n = new pi(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 fi()), this.converters.set("ZodAny", new yi()), this.converters.set("ZodArray", t), this.converters.set("ZodTuple", r), this.converters.set("ZodSet", s), this.converters.set("ZodMap", n), this.converters.set("ZodRecord", n), this.converters.set("ZodObject", this.complexObjectConverter);
+    const e = new ei(), t = new ri(this.nodeToObjectConverter), r = new li(this.nodeToObjectConverter), s = new si(this.nodeToObjectConverter), n = new ii(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 ni()), this.converters.set("ZodAny", new oi()), this.converters.set("ZodArray", t), this.converters.set("ZodTuple", r), this.converters.set("ZodSet", s), this.converters.set("ZodMap", n), this.converters.set("ZodRecord", n), this.converters.set("ZodObject", this.complexObjectConverter);
   }
   getConverter(e) {
     const t = this.getSchemaTypeName(e);
     return this.converters.get(t) ?? this.complexObjectConverter;
   }
   getSchemaTypeName(e) {
-    if (li(e))
-      return e instanceof Ge ? this.getSchemaTypeName(e.innerType()) : e instanceof Je ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
+    if (qs(e))
+      return e instanceof Ye ? this.getSchemaTypeName(e.innerType()) : e instanceof We ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
     const t = e._def.typeName;
     try {
-      return mi.parse(t);
+      return ai.parse(t);
     } catch {
       throw new Error(`Schema type name ${t} is not supported`);
     }
   }
 }
-class vi {
+class ui {
   constructor(e, t) {
     if (this.typeSchemaResolver = e, !t?.calculateBlueId)
       throw new Error(
         "NodeToObjectConverter requires a semantic calculateBlueId option."
       );
-    this.calculateBlueId = t.calculateBlueId, this.converterFactory = new Ii(this, this.calculateBlueId);
+    this.calculateBlueId = t.calculateBlueId, this.converterFactory = new ci(this, this.calculateBlueId);
   }
   converterFactory;
   calculateBlueId;
   convert(e, t) {
-    const r = this.typeSchemaResolver?.resolveSchema(e), s = k.unwrapSchema(t);
-    if (Tr(s))
+    const r = this.typeSchemaResolver?.resolveSchema(e), s = H.unwrapSchema(t);
+    if (yr(s))
       return e;
     let n = s;
-    return k.checkSchemaExtension(
+    return H.checkSchemaExtension(
       r,
       s,
       { typeSchemaResolver: this.typeSchemaResolver }
-    ) && p(r) && (n = r), this.convertWithType(e, n);
+    ) && d(r) && (n = r), this.convertWithType(e, n);
   }
   convertWithType(e, t) {
     return this.converterFactory.getConverter(t).convert(e, t);
   }
 }
-class Ti {
+class di {
   static get(e, t = {}) {
     const { strategy: r = "official" } = t, s = T.get(e, r);
-    return Qs(s);
+    return Hs(s);
   }
 }
-const kt = async (i) => {
-  if (qr(i))
+const Ft = async (i) => {
+  if (Hr(i))
     return i;
   try {
-    const e = Ze.parse(i), { Blue: t } = await Promise.resolve().then(() => tn), r = await new t().calculateBlueId(e);
+    const e = Ge.parse(i), { Blue: t } = await Promise.resolve().then(() => Wi), r = await new t().calculateBlueId(e);
     return {
       ...i,
       blueId: r
@@ -4661,10 +4660,10 @@ const kt = async (i) => {
   } catch (e) {
     throw new Error(`Failed enriching object with Blue ID: ${e}`);
   }
-}, jn = (i) => i?.items, Fn = (i) => i?.value, Un = (i) => v(i) ? {} : sr(
+}, wn = (i) => i?.items, Sn = (i) => i?.value, bn = (i) => I(i) ? {} : qt(
   i,
-  Nt
-), zn = (i) => es(i) ? i.type.name ?? null : ts(i) ? Yr(typeof i.value) : Qr(i) ? "List" : null, Bi = (i) => p(i) && Object.keys(sr(i, ["blueId"])).length > 0, Kn = (i) => {
+  Pt
+), En = (i) => Yr(i) ? i.type.name ?? null : Wr(i) ? xr(typeof i.value) : kr(i) ? "List" : null, hi = (i) => d(i) && Object.keys(qt(i, ["blueId"])).length > 0, Nn = (i) => {
   try {
     const e = m.deserialize(i), t = T.get(e);
     return Ve.parse(t);
@@ -4673,19 +4672,19 @@ const kt = async (i) => {
       `Failed transforming JSON-like value to BlueObject: ${e}`
     );
   }
-}, Ht = async (i) => {
+}, jt = async (i) => {
   const {
     resolveFunction: e,
     signal: t = new AbortController().signal,
     omitItems: r
   } = i, s = i.count ?? i.items.length;
-  let n = await Wr(i.items, async (l) => await kt(l));
+  let n = await Fr(i.items, async (l) => await Ft(l));
   const o = Math.max(n?.length - s, 0);
   for (let l = n.length - 1; l >= o; l--)
-    if (!Bi(n[l])) {
+    if (!hi(n[l])) {
       const a = await e(n[l], { signal: t });
       if (Array.isArray(a))
-        return Ht({
+        return jt({
           ...i,
           items: [
             ...n.slice(0, l),
@@ -4693,9 +4692,9 @@ const kt = async (i) => {
             ...n.slice(l + 1)
           ]
         });
-      const c = await kt(a);
+      const c = await Ft(a);
       if (r?.includes(c.blueId))
-        return Ht({
+        return jt({
           ...i,
           items: [...n.slice(0, l), ...n.slice(l + 1)]
         });
@@ -4707,7 +4706,7 @@ const kt = async (i) => {
     }
   return n;
 };
-function We(i) {
+function ke(i) {
   try {
     const e = new URL(i);
     return e.protocol === "http:" || e.protocol === "https:";
@@ -4715,14 +4714,14 @@ function We(i) {
     return !1;
   }
 }
-class Pi {
+class pi {
   /**
    * Process a document node to infer basic types for untyped values
    * @param document - The document to process
    * @returns The processed document
    */
   process(e) {
-    return L.transform(e, this.inferType.bind(this));
+    return $.transform(e, this.inferType.bind(this));
   }
   /**
    * Infer a basic type for a node
@@ -4731,10 +4730,10 @@ class Pi {
    */
   inferType(e) {
     const t = e.getType(), r = e.getValue();
-    return v(t) && p(r) && (typeof r == "string" ? e.setType(new u().setBlueId(Q)) : typeof r == "bigint" || oe(r) ? e.setType(new u().setBlueId(te)) : yt(r) ? e.setType(new u().setBlueId(ee)) : typeof r == "boolean" && e.setType(new u().setBlueId(re))), e;
+    return I(t) && d(r) && (typeof r == "string" ? e.setType(new u().setBlueId(Q)) : typeof r == "bigint" || oe(r) ? e.setType(new u().setBlueId(te)) : dt(r) ? e.setType(new u().setBlueId(ee)) : typeof r == "boolean" && e.setType(new u().setBlueId(re))), e;
   }
 }
-class Qe {
+class Xe {
   static MAPPINGS = "mappings";
   mappings = /* @__PURE__ */ new Map();
   /**
@@ -4744,8 +4743,8 @@ class Qe {
   constructor(e) {
     if (e instanceof u) {
       const r = e.getProperties();
-      if (r && r[Qe.MAPPINGS]) {
-        const n = r[Qe.MAPPINGS].getProperties();
+      if (r && r[Xe.MAPPINGS]) {
+        const n = r[Xe.MAPPINGS].getProperties();
         n && Object.entries(n).forEach(([o, l]) => {
           const a = l.getValue();
           typeof a == "string" && this.mappings.set(o, a);
@@ -4760,7 +4759,7 @@ class Qe {
    * @returns The processed document
    */
   process(e) {
-    return L.transform(e, this.transformNode.bind(this));
+    return $.transform(e, this.transformNode.bind(this));
   }
   transformNode(e) {
     const t = e.clone();
@@ -4779,7 +4778,7 @@ class Qe {
     }
   }
 }
-class wi {
+class fi {
   /**
    * Process a document node to validate all inline types have been replaced
    * @param document - The document to process
@@ -4787,7 +4786,7 @@ class wi {
    * @throws Error if any inline type values remain without BlueId mappings
    */
   process(e) {
-    return L.transform(e, this.validateNode.bind(this)), e;
+    return $.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;
@@ -4801,7 +4800,7 @@ class wi {
     }
   }
 }
-class Dr {
+class Rr {
   blueIdsCollections = [];
   /**
    * Initializes the generator with default BlueIds collections
@@ -4890,7 +4889,7 @@ class De {
     const { nodeProvider: t, processorProvider: r, blueIdsMappingGenerator: s } = e;
     if (!t)
       throw new Error("NodeProvider is required");
-    this.nodeProvider = Me.wrap(t), this.processorProvider = r || De.getStandardProvider(), this.blueIdsMappingGenerator = s || new Dr(), this.loadDefaultSimpleBlue();
+    this.nodeProvider = Me.wrap(t), this.processorProvider = r || De.getStandardProvider(), this.blueIdsMappingGenerator = s || new Rr(), this.loadDefaultSimpleBlue();
   }
   /**
    * Preprocesses a document node
@@ -4917,9 +4916,9 @@ class De {
   preprocessWithOptions(e, t) {
     let r = e.clone(), s = r.getBlue();
     if (!s && t && (s = t.clone()), s) {
-      new $t(this.nodeProvider).extend(
+      new Ot(this.nodeProvider).extend(
         s,
-        nt.withSinglePath("/*")
+        rt.withSinglePath("/*")
       );
       const n = this.flattenTransformationItems(
         s.getItems()
@@ -4936,7 +4935,7 @@ class De {
         }
         r.setBlue(void 0);
       }
-      r = new wi().process(
+      r = new fi().process(
         r
       );
     }
@@ -4955,11 +4954,11 @@ class De {
       getProcessor(e) {
         const t = "27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo", r = "FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4", s = e.getType()?.getBlueId();
         if (t === s)
-          return new Qe(
+          return new Xe(
             e
           );
         if (r === s)
-          return new Pi();
+          return new pi();
       }
     };
   }
@@ -4982,7 +4981,7 @@ ${t}
    */
   loadDefaultSimpleBlue() {
     try {
-      const e = this.enrichDefaultBlue(br), t = ae(e);
+      const e = this.enrichDefaultBlue(Tr), t = ae(e);
       if (t)
         this.defaultSimpleBlue = m.deserialize(t);
       else
@@ -4992,7 +4991,7 @@ ${t}
     }
   }
 }
-class Si {
+class yi {
   preprocessingAliases = /* @__PURE__ */ new Map();
   urlContentFetcher;
   /**
@@ -5016,9 +5015,9 @@ class Si {
       const r = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(r, t);
-      if (Be.isPotentialBlueId(t))
+      if (ve.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      throw We(t) ? new Error(
+      throw ke(t) ? new Error(
         `URL '${t}' detected. Use the async version of this method to fetch the content.`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -5036,9 +5035,9 @@ class Si {
       const r = e.clone();
       if (this.preprocessingAliases.has(t))
         return this.handleAliasValue(r, t);
-      if (Be.isPotentialBlueId(t))
+      if (ve.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      if (We(t) && this.urlContentFetcher)
+      if (ke(t) && this.urlContentFetcher)
         try {
           const s = await this.fetchFromUrl(t);
           return s && r.setBlue(new u().setItems(s)), r;
@@ -5048,7 +5047,7 @@ class Si {
 ${s.message}`
           ) : s;
         }
-      else throw We(t) ? new Error(
+      else throw ke(t) ? new Error(
         `UrlContentFetcher not provided for URL: ${t}`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -5134,24 +5133,24 @@ ${s.message}`
     return this.urlContentFetcher;
   }
 }
-const bi = {
+const gi = {
   fetchUrl: async (i) => {
     throw new Error(
       `You must provide a custom UrlFetchStrategy to fetch content from URL: ${i}`
     );
   }
 };
-class Ei {
+class mi {
   // Cache to avoid repeated network requests for the same URL
   cache = /* @__PURE__ */ new Map();
   fetchStrategy;
   enabled = !1;
   allowedDomains = [];
   constructor(e) {
-    this.fetchStrategy = e || bi;
+    this.fetchStrategy = e || gi;
   }
   validateUrl(e) {
-    if (!We(e))
+    if (!ke(e))
       throw new Error(`Invalid URL: ${e}`);
     return !0;
   }
@@ -5270,12 +5269,12 @@ class Ei {
     return this.allowedDomains = [], this;
   }
 }
-class Fe {
+class xe {
   constructor(e, t, r, s = [], n = !1) {
     this.blueId = e, this.content = t, this.isMultipleDocuments = r, this.documentBlueIds = s, this.isCyclicSet = n;
   }
 }
-class Te {
+class Re {
   static THIS_REFERENCE_PATTERN = /^this(#\d+)?$/;
   static parseAndCalculateBlueId(e, t, r) {
     let s;
@@ -5291,14 +5290,14 @@ class Te {
     const l = Array.isArray(s);
     if (l) {
       const a = s.map(
-        (d) => m.deserialize(d)
+        (h) => m.deserialize(h)
       ), c = r.prepareStorageNodeList(
         a,
         t
       );
       return n = c.blueId, o = c.nodes.map(
-        (d) => T.get(d)
-      ), new Fe(
+        (h) => T.get(h)
+      ), new xe(
         n,
         o,
         !0,
@@ -5309,11 +5308,11 @@ class Te {
       const a = m.deserialize(s), c = r.prepareStorageNode(a, t);
       n = c.blueId, o = T.get(c.node);
     }
-    return new Fe(n, o, l);
+    return new xe(n, o, l);
   }
   static parseAndCalculateBlueIdForNode(e, t, r) {
     const s = r.prepareStorageNode(e, t), n = T.get(s.node);
-    return new Fe(s.blueId, n, !1);
+    return new xe(s.blueId, n, !1);
   }
   static parseAndCalculateBlueIdForNodeList(e, t, r) {
     if (!e || e.length === 0)
@@ -5324,7 +5323,7 @@ class Te {
     ), n = s.nodes.map(
       (l) => T.get(l)
     ), o = !0;
-    return new Fe(
+    return new xe(
       s.blueId,
       n,
       o,
@@ -5377,12 +5376,12 @@ class Te {
     }
   }
 }
-class Ni extends ye {
+class Ii extends fe {
   fetchByBlueId(e) {
     const t = e.split("#")[0], r = this.fetchContentByBlueId(t);
     if (r == null)
       return null;
-    const s = Array.isArray(r), n = Te.resolveThisReferences(
+    const s = Array.isArray(r), n = Re.resolveThisReferences(
       r,
       t,
       s
@@ -5400,7 +5399,7 @@ class Ni extends ye {
     return Array.isArray(n) ? n.map((o) => m.deserialize(o)) : [m.deserialize(n)];
   }
 }
-class xr extends Ni {
+class Ar extends Ii {
   nameToBlueIdsMap = /* @__PURE__ */ new Map();
   /**
    * Find a node by name. Throws an error if multiple nodes are found with the same name.
@@ -5444,23 +5443,23 @@ class xr extends Ni {
     ]);
   }
 }
-function Ci(i) {
-  return Array.isArray(i) ? Ri(i) : i;
+function vi(i) {
+  return Array.isArray(i) ? Ti(i) : i;
 }
-function Ri(i) {
+function Ti(i) {
   const e = i.map((t) => m.deserialize(t));
-  return O.hasIndexedThisReference(e) ? Ai(e) : i;
+  return O.hasIndexedThisReference(e) ? Bi(e) : i;
 }
-function Ai(i) {
+function Bi(i) {
   return new O().calculate(i).nodes.map((t) => T.get(t));
 }
-class _t extends xr {
+class Dt extends Ar {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   aliasBlueIdMap = /* @__PURE__ */ new Map();
   constructor(e, t = {}) {
     super();
-    const r = _t.collectAliasMappings(e);
+    const r = Dt.collectAliasMappings(e);
     this.aliasBlueIdMap = new Map(Object.entries(r)), this.loadRepositories(e);
   }
   static collectAliasMappings(e) {
@@ -5479,7 +5478,7 @@ class _t extends xr {
     for (const t of e)
       Object.values(t.packages).forEach((r) => {
         for (const [s, n] of Object.entries(r.contents)) {
-          const o = Ci(n);
+          const o = vi(n);
           this.storeContent(
             s,
             o,
@@ -5504,7 +5503,7 @@ class _t extends xr {
   }
   fetchContentByBlueId(e) {
     const t = this.blueIdToContentMap.get(e), r = this.blueIdToMultipleDocumentsMap.get(e);
-    return t !== void 0 && r !== void 0 ? Te.resolveThisReferences(
+    return t !== void 0 && r !== void 0 ? Re.resolveThisReferences(
       t,
       e,
       r
@@ -5553,12 +5552,12 @@ class _t extends xr {
     };
   }
 }
-class Vi {
+class Pi {
   nodeProvider;
   blueIdToInlineValue = /* @__PURE__ */ new Map();
   constructor(e) {
     const { nodeProvider: t, blueIdsMappingGenerator: r } = e;
-    this.nodeProvider = t, Object.entries(st).forEach(([n, o]) => {
+    this.nodeProvider = t, Object.entries(et).forEach(([n, o]) => {
       this.blueIdToInlineValue.set(n, o);
     });
     const s = r.getAllBlueIds();
@@ -5570,7 +5569,7 @@ class Vi {
    * Returns a new BlueNode where all type references are restored to inline values when possible.
    */
   restore(e) {
-    return L.transform(
+    return $.transform(
       e,
       (t) => this.restoreNode(t)
     );
@@ -5619,17 +5618,17 @@ class Vi {
       return this.blueIdToInlineValue.set(e, o), o;
   }
 }
-class Oi {
+class wi {
   runtimes;
   contents;
   aliases;
   constructor(e) {
     const t = [];
     for (const r of e)
-      t.push(Mi(r));
+      t.push(Si(r));
     this.runtimes = t, this.contents = {}, this.aliases = {};
     for (const r of this.runtimes)
-      ki(this.contents, r.contents, r.name), Ki(this.aliases, r.aliases, r.name);
+      Li(this.contents, r.contents, r.name), Di(this.aliases, r.aliases, r.name);
   }
   getRuntimes() {
     return this.runtimes;
@@ -5644,7 +5643,7 @@ class Oi {
     return this.runtimes.find((t) => t.name === e);
   }
   toCurrentBlueId(e) {
-    const t = this.aliases[e] ?? hr[e] ?? e;
+    const t = this.aliases[e] ?? lr[e] ?? e;
     for (const r of this.runtimes) {
       const s = r.toCurrentBlueIdIndex[t];
       if (s)
@@ -5653,7 +5652,7 @@ class Oi {
     return t;
   }
   getTypeAlias(e) {
-    const t = this.toCurrentBlueId(e), r = st[t];
+    const t = this.toCurrentBlueId(e), r = et[t];
     if (r)
       return r;
     for (const s of this.runtimes) {
@@ -5676,10 +5675,10 @@ class Oi {
     }
   }
 }
-function Mi(i) {
-  const e = Di(i);
+function Si(i) {
+  const e = bi(i);
   return Object.values(i.packages).forEach((t) => {
-    xi(e, i, t);
+    Ei(e, i, t);
   }), {
     name: i.name,
     repositoryVersions: i.repositoryVersions,
@@ -5694,7 +5693,7 @@ function Mi(i) {
     typePackageByCurrentBlueId: e.typePackageByCurrentBlueId
   };
 }
-function Di(i) {
+function bi(i) {
   const e = Object.fromEntries(
     i.repositoryVersions.map((r, s) => [r, s])
   ), t = i.repositoryVersions[i.repositoryVersions.length - 1];
@@ -5711,29 +5710,29 @@ function Di(i) {
     currentRepoBlueId: t
   };
 }
-function xi(i, e, t) {
+function Ei(i, e, t) {
   if (i.packageNames.has(t.name))
     throw new Error(`Duplicate package name detected: ${t.name}`);
-  i.packageNames.add(t.name), Li(i, t), $i(i, e, t), _i(i, t), ji(i, t);
+  i.packageNames.add(t.name), Ni(i, t), Ci(i, e, t), Ri(i, t), Ai(i, t);
 }
-function Li(i, e) {
+function Ni(i, e) {
   Object.entries(e.aliases).forEach(([t, r]) => {
     if (i.aliases[t] && i.aliases[t] !== r)
       throw new Error(`Conflicting alias mapping for ${t}`);
     i.aliases[t] = r;
   });
 }
-function $i(i, e, t) {
+function Ci(i, e, t) {
   Object.entries(t.typesMeta).forEach(([r, s]) => {
     if (i.types[r])
       throw new Error(`Duplicate type mapping for BlueId ${r}`);
-    const n = Fi(
+    const n = Vi(
       s,
       e,
       r,
       t.name
     );
-    if (i.types[r] = n, i.typePackageByCurrentBlueId[r] = t.name, i.typeAliasByCurrentBlueId[r] = `${t.name}/${s.name}`, n.status === Ce && !i.toCurrentBlueIdIndex[r] && (i.toCurrentBlueIdIndex[r] = r), n.status === Ce)
+    if (i.types[r] = n, i.typePackageByCurrentBlueId[r] = t.name, i.typeAliasByCurrentBlueId[r] = `${t.name}/${s.name}`, n.status === Ne && !i.toCurrentBlueIdIndex[r] && (i.toCurrentBlueIdIndex[r] = r), n.status === Ne)
       for (const o of n.versions) {
         const l = i.toCurrentBlueIdIndex[o.typeBlueId];
         if (l && l !== r)
@@ -5744,17 +5743,17 @@ function $i(i, e, t) {
       }
   });
 }
-function _i(i, e) {
+function Ri(i, e) {
   Object.entries(e.contents).forEach(([t, r]) => {
     i.contents[t] = r;
   });
 }
-function ji(i, e) {
+function Ai(i, e) {
   i.schemas.push(...Object.values(e.schemas));
 }
-function Fi(i, e, t, r) {
-  if (i.status === Et)
-    return Ui(i, e, t, r), {
+function Vi(i, e, t, r) {
+  if (i.status === Bt)
+    return Oi(i, e, t, r), {
       ...i,
       versions: i.versions ? [...i.versions] : i.versions
     };
@@ -5777,7 +5776,7 @@ function Fi(i, e, t, r) {
       );
     n.add(o.repositoryVersionIndex);
     for (const l of o.attributesAdded ?? [])
-      zi(
+      Mi(
         l,
         e.name,
         t,
@@ -5788,8 +5787,8 @@ function Fi(i, e, t, r) {
     versions: s
   };
 }
-function Ui(i, e, t, r) {
-  if (i.status === Et) {
+function Oi(i, e, t, r) {
+  if (i.status === Bt) {
     if (i.versions && i.versions.length > 1)
       throw new Error(
         `Dev type ${r}/${i.name} (${t}) must not declare multiple versions`
@@ -5803,9 +5802,9 @@ function Ui(i, e, t, r) {
     }
   }
 }
-function zi(i, e, t, r) {
+function Mi(i, e, t, r) {
   try {
-    Gr(i);
+    jr(i);
   } catch (s) {
     const n = s instanceof Error ? s.message : "Unknown error";
     throw new Error(
@@ -5813,7 +5812,7 @@ function zi(i, e, t, r) {
     );
   }
 }
-function Ki(i, e, t) {
+function Di(i, e, t) {
   for (const [r, s] of Object.entries(e)) {
     const n = i[r];
     if (n && n !== s)
@@ -5823,11 +5822,11 @@ function Ki(i, e, t) {
     i[r] = s;
   }
 }
-function ki(i, e, t) {
+function Li(i, e, t) {
   for (const [r, s] of Object.entries(e)) {
     if (r in i) {
       const n = i[r];
-      if (!Hi(n, s))
+      if (!$i(n, s))
         throw new Error(
           `Conflicting content for BlueId '${r}' across repositories (from ${t})`
         );
@@ -5836,57 +5835,57 @@ function ki(i, e, t) {
     i[r] = s;
   }
 }
-function Hi(i, e) {
+function $i(i, e) {
   if (i === e) return !0;
   if (i === null || e === null || typeof i != "object" || typeof e != "object") return !1;
-  const t = gt.canonicalize(i), r = gt.canonicalize(e);
+  const t = ht.canonicalize(i), r = ht.canonicalize(e);
   return t !== void 0 && t === r;
 }
-const Yi = /* @__PURE__ */ new Set([
+const _i = /* @__PURE__ */ new Set([
   "__proto__",
   "constructor",
   "prototype"
 ]);
-function Yt(i) {
+function Ut(i) {
   const e = i.at(0), t = i.at(-1);
   return !e || !t ? i : e === "'" && t === "'" || e === '"' && t === '"' ? i.slice(1, -1) : i;
 }
-function Wi(i, e) {
+function xi(i, e) {
   const t = i.indexOf("=");
   if (t === -1)
-    throw ve(e, `Missing '=' in segment '${i.trim()}'`);
+    throw Ie(e, `Missing '=' in segment '${i.trim()}'`);
   if (i.indexOf("=", t + 1) !== -1)
-    throw ve(e, `Unexpected '=' in segment '${i.trim()}'`);
-  const r = Yt(i.slice(0, t).trim()), s = Yt(i.slice(t + 1).trim());
+    throw Ie(e, `Unexpected '=' in segment '${i.trim()}'`);
+  const r = Ut(i.slice(0, t).trim()), s = Ut(i.slice(t + 1).trim());
   if (!r)
-    throw ve(e, "Repository name is empty");
+    throw Ie(e, "Repository name is empty");
   if (!s)
-    throw ve(e, `Repository BlueId is empty for '${r}'`);
+    throw Ie(e, `Repository BlueId is empty for '${r}'`);
   return { name: r, value: s };
 }
-function Gi(i) {
+function Fi(i) {
   if (i.trim().length === 0)
     return /* @__PURE__ */ Object.create(null);
   const e = /* @__PURE__ */ Object.create(null);
   for (const t of i.split(",")) {
     const r = t.trim();
     if (!r)
-      throw ve(i, "Empty repository segment");
-    const { name: s, value: n } = Wi(r, i);
-    Zi(s, i), e[s] = n;
+      throw Ie(i, "Empty repository segment");
+    const { name: s, value: n } = xi(r, i);
+    Ui(s, i), e[s] = n;
   }
   return e;
 }
-function Ji(i) {
-  return typeof i == "string" ? Gi(i) : i;
+function ji(i) {
+  return typeof i == "string" ? Fi(i) : i;
 }
-function ve(i, e) {
-  return new he(
-    j.INVALID_BLUE_CONTEXT_REPOSITORIES,
+function Ie(i, e) {
+  return new Te(
+    K.INVALID_BLUE_CONTEXT_REPOSITORIES,
     `Invalid BlueContext repositories value: ${e}`,
     [
       {
-        code: j.INVALID_BLUE_CONTEXT_REPOSITORIES,
+        code: K.INVALID_BLUE_CONTEXT_REPOSITORIES,
         message: e,
         locationPath: [],
         context: {
@@ -5897,31 +5896,31 @@ function ve(i, e) {
     ]
   );
 }
-function Zi(i, e) {
-  if (Yi.has(i))
-    throw ve(e, `Forbidden repository name '${i}'`);
+function Ui(i, e) {
+  if (_i.has(i))
+    throw Ie(e, `Forbidden repository name '${i}'`);
 }
-function Xi(i, e) {
+function zi(i, e) {
   const t = i.filter((s) => s.repositoryVersionIndex > e).sort((s, n) => n.repositoryVersionIndex - s.repositoryVersionIndex), r = [];
   for (const s of t) {
     const n = [...s.attributesAdded].sort(
-      (o, l) => Wt(l) - Wt(o)
+      (o, l) => zt(l) - zt(o)
     );
     r.push(...n);
   }
   return r;
 }
-function Wt(i) {
-  return nr(i).length;
+function zt(i) {
+  return er(i).length;
 }
-const qi = /* @__PURE__ */ new Set([...Nt]), N = {
+const Ki = /* @__PURE__ */ new Set([...Pt]), N = {
   core: "core",
   noRuntime: "no-runtime",
   noTargetContext: "no-target-context",
   representable: "representable",
   unrepresentable: "unrepresentable"
 };
-class Qi {
+class Hi {
   registry;
   targetRepoVersionIndexes;
   fallbackToCurrentInlineDefinitions;
@@ -5930,7 +5929,7 @@ class Qi {
     this.registry = e.registry, this.targetRepoVersionIndexes = e.targetRepoVersionIndexes, this.fallbackToCurrentInlineDefinitions = e.fallbackToCurrentInlineDefinitions;
   }
   transform(e) {
-    return L.transform(
+    return $.transform(
       e,
       (t) => this.transformNode(t)
     );
@@ -5992,7 +5991,7 @@ class Qi {
     }
   }
   resolveType(e) {
-    if (fe.includes(e))
+    if (pe.includes(e))
       return { kind: N.core, blueId: e };
     const t = this.registry.toCurrentBlueId(e), r = this.registry.getTypeAlias(t), s = this.registry.findRuntimeByBlueId(t);
     if (!s || !s.typeMeta)
@@ -6008,9 +6007,9 @@ class Qi {
         typeAlias: r
       };
     const o = s.typeMeta;
-    if (o.status === Et) {
-      const h = s.runtime.repositoryVersions.length - 1;
-      if (n !== h)
+    if (o.status === Bt) {
+      const p = s.runtime.repositoryVersions.length - 1;
+      if (n !== p)
         return {
           kind: N.unrepresentable,
           currentBlueId: t,
@@ -6023,11 +6022,11 @@ class Qi {
             r
           )
         };
-      const f = o.versions?.[0];
+      const y = o.versions?.[0];
       return {
         kind: N.representable,
         currentBlueId: t,
-        targetBlueId: f?.typeBlueId ?? t,
+        targetBlueId: y?.typeBlueId ?? t,
         dropPointers: []
       };
     }
@@ -6060,18 +6059,18 @@ class Qi {
         )
       };
     let c = l[0].typeBlueId;
-    for (const h of l)
-      h.repositoryVersionIndex <= n && (c = h.typeBlueId);
-    const d = o.status === Ce ? this.getDropPointers(o, n) : [];
+    for (const p of l)
+      p.repositoryVersionIndex <= n && (c = p.typeBlueId);
+    const h = o.status === Ne ? this.getDropPointers(o, n) : [];
     return {
       kind: N.representable,
       currentBlueId: t,
       targetBlueId: c,
-      dropPointers: d
+      dropPointers: h
     };
   }
   getDropPointers(e, t) {
-    return e.status !== Ce ? [] : Xi(e.versions, t);
+    return e.status !== Ne ? [] : zi(e.versions, t);
   }
   applyDropPointers(e, t, r = {}) {
     if (e.length === 0 || t.length === 0)
@@ -6084,13 +6083,13 @@ class Qi {
   getDictionaryValueTargets(e) {
     const t = e.getProperties();
     return t ? Object.entries(t).filter(
-      ([r, s]) => s instanceof u && !qi.has(r)
+      ([r, s]) => s instanceof u && !Ki.has(r)
     ).map(([, r]) => r) : [];
   }
   deletePropertyAtPointer(e, t, r) {
     let s;
     try {
-      s = nr(t);
+      s = er(t);
     } catch {
       throw this.invalidPointerError(t);
     }
@@ -6100,22 +6099,22 @@ class Qi {
     if (t.length === 0)
       return;
     const [s, ...n] = t;
-    if (s === K) {
+    if (s === z) {
       const a = e.getType();
       a && this.applyPointerSegments(a, n, !0);
       return;
     }
-    if (s === we) {
+    if (s === Pe) {
       const a = e.getItemType();
       a && this.applyPointerSegments(a, n, !0);
       return;
     }
-    if (s === Se) {
+    if (s === we) {
       const a = e.getKeyType();
       a && this.applyPointerSegments(a, n, !0);
       return;
     }
-    if (s === be) {
+    if (s === Se) {
       const a = e.getValueType();
       a && this.applyPointerSegments(a, n, !0);
       return;
@@ -6157,7 +6156,7 @@ class Qi {
     try {
       const o = m.deserialize(n);
       o.setBlueId(void 0);
-      const l = L.transform(
+      const l = $.transform(
         o,
         (a) => this.transformNode(a)
       );
@@ -6168,9 +6167,9 @@ class Qi {
   }
   invalidPointerError(e) {
     const t = `Invalid attributesAdded pointer '${e}'.`;
-    return new he(j.INVALID_REPOSITORY_POINTER, t, [
+    return new Te(K.INVALID_REPOSITORY_POINTER, t, [
       {
-        code: j.INVALID_REPOSITORY_POINTER,
+        code: K.INVALID_REPOSITORY_POINTER,
         message: t,
         locationPath: [],
         context: { pointer: e }
@@ -6184,43 +6183,43 @@ class Qi {
       typeAlias: o,
       ...l
     };
-    if (r && (n !== void 0 && (a.requestedRepoBlueId = r.repositoryVersions[n]), a.serverRepoBlueId = r.currentRepoBlueId), s && s.status === Ce) {
-      const d = s.versions?.[0]?.repositoryVersionIndex;
-      d !== void 0 && (a.typeIntroducedInRepoBlueId = r?.repositoryVersions[d]);
+    if (r && (n !== void 0 && (a.requestedRepoBlueId = r.repositoryVersions[n]), a.serverRepoBlueId = r.currentRepoBlueId), s && s.status === Ne) {
+      const h = s.versions?.[0]?.repositoryVersionIndex;
+      h !== void 0 && (a.typeIntroducedInRepoBlueId = r?.repositoryVersions[h]);
     }
     const c = {
-      code: j.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
+      code: K.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
       message: t,
-      locationPath: [K],
+      locationPath: [z],
       context: a
     };
-    return new he(
-      j.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
+    return new Te(
+      K.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
       t,
       [c]
     );
   }
 }
-function Pt(i, e) {
-  return e ? L.transform(i, (t) => (Ue(
+function It(i, e) {
+  return e ? $.transform(i, (t) => (Fe(
     () => t.getType(),
     (r) => t.setType(r),
     e
-  ), Ue(
+  ), Fe(
     () => t.getItemType(),
     (r) => t.setItemType(r),
     e
-  ), Ue(
+  ), Fe(
     () => t.getKeyType(),
     (r) => t.setKeyType(r),
     e
-  ), Ue(
+  ), Fe(
     () => t.getValueType(),
     (r) => t.setValueType(r),
     e
   ), t)) : i;
 }
-function Ue(i, e, t) {
+function Fe(i, e, t) {
   const r = i();
   if (!r || r.isInlineValue())
     return;
@@ -6230,7 +6229,7 @@ function Ue(i, e, t) {
   const n = t.toCurrentBlueId(s);
   n !== s && e(r.clone().setBlueId(n));
 }
-class en {
+class ki {
   registry;
   blueIdMapper;
   constructor(e) {
@@ -6240,8 +6239,8 @@ class en {
     const r = this.computeTargetRepoVersionIndexes(t);
     if (Object.keys(r).length === 0)
       return e;
-    const s = Pt(e, this.blueIdMapper);
-    return new Qi({
+    const s = It(e, this.blueIdMapper);
+    return new Hi({
       registry: this.registry,
       targetRepoVersionIndexes: r,
       fallbackToCurrentInlineDefinitions: t.fallbackToCurrentInlineDefinitions !== !1
@@ -6251,7 +6250,7 @@ class en {
     const t = {};
     if (!e?.repositories)
       return t;
-    const r = typeof e.repositories == "string" ? Ji(e.repositories) : e.repositories;
+    const r = typeof e.repositories == "string" ? ji(e.repositories) : e.repositories;
     for (const [s, n] of Object.entries(r)) {
       const o = this.registry.findRuntimeByName(s);
       if (!o)
@@ -6269,7 +6268,7 @@ class en {
   }
   unknownRepoBlueIdError(e, t, r) {
     const s = `Unknown RepoBlueId '${t}' for repository '${e}'.`, n = {
-      code: j.REPO_UNKNOWN_REPO_BLUE_ID,
+      code: K.REPO_UNKNOWN_REPO_BLUE_ID,
       message: s,
       locationPath: [],
       context: {
@@ -6278,12 +6277,12 @@ class en {
         serverRepoBlueId: r
       }
     };
-    return new he(j.REPO_UNKNOWN_REPO_BLUE_ID, s, [
+    return new Te(K.REPO_UNKNOWN_REPO_BLUE_ID, s, [
       n
     ]);
   }
 }
-class xe {
+class Yi {
   nodeProvider;
   typeSchemaResolver;
   blueDirectivePreprocessor;
@@ -6302,20 +6301,20 @@ class xe {
       repositories: n,
       mergingProcessor: o
     } = e;
-    this.repositories = n, this.repositoryRegistry = new Oi(n ?? []), this.blueContextResolver = new en({
+    this.repositories = n, this.repositoryRegistry = new wi(n ?? []), this.blueContextResolver = new ki({
       registry: this.repositoryRegistry,
       blueIdMapper: this.repositoryRegistry
-    }), this.mergingProcessor = o ?? _e();
-    const l = xt(() => []);
+    }), this.mergingProcessor = o ?? Mt();
+    const l = At(() => []);
     this.nodeProvider = this.wrapNodeProviderWithRepositories(
       t || l,
       n
-    ), this.typeSchemaResolver = r ?? new Ys([], {
+    ), this.typeSchemaResolver = r ?? new _s([], {
       nodeProvider: this.nodeProvider
-    }), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this.urlContentFetcher = new Ei(s), this.blueDirectivePreprocessor = new Si(
+    }), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this.urlContentFetcher = new mi(s), this.blueDirectivePreprocessor = new yi(
       void 0,
       this.urlContentFetcher
-    ), this.blueIdsMappingGenerator = new Dr(), this.blueIdsMappingGenerator.registerBlueIds(
+    ), this.blueIdsMappingGenerator = new Rr(), this.blueIdsMappingGenerator.registerBlueIds(
       this.repositoryRegistry.getAliases()
     );
     const a = this.repositoryRegistry.getRuntimes().flatMap((c) => c.schemas);
@@ -6338,18 +6337,18 @@ class xe {
    */
   nodeToYaml(e, t = "official") {
     const r = this.normalizeNodeToJsonOptions(t), s = r.blueContext ? this.blueContextResolver.transform(e, r.blueContext) : e;
-    return Ti.get(s, {
+    return di.get(s, {
       strategy: r.format
     });
   }
   nodeToSchemaOutput(e, t) {
-    return new vi(this.typeSchemaResolver, {
+    return new ui(this.typeSchemaResolver, {
       calculateBlueId: (s) => this.calculateBlueIdSync(s)
     }).convert(e, t);
   }
   resolve(e, t = F) {
     const r = this.combineWithGlobalLimits(t), n = new de(this.mergingProcessor, this.nodeProvider).resolve(e, r);
-    if (!(r instanceof H)) {
+    if (!(r instanceof k)) {
       const o = this.getExactReferenceBlueId(e);
       o !== void 0 && n.setSourceSemanticBlueId(o);
     }
@@ -6377,7 +6376,7 @@ class xe {
    * Produces a minimal overlay that re-resolves to the same semantic BlueId.
    */
   minimize(e) {
-    return new Ye({
+    return new He({
       nodeProvider: this.nodeProvider,
       mergingProcessor: this.mergingProcessor
     }).minimize(e);
@@ -6390,18 +6389,18 @@ class xe {
    * repository-backed definitions currently known to this {@link Blue} instance.
    */
   restoreInlineTypes(e) {
-    return new Vi({
+    return new Pi({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).restore(e);
   }
   extend(e, t) {
     const r = this.combineWithGlobalLimits(t);
-    new $t(this.nodeProvider).extend(e, r);
+    new Ot(this.nodeProvider).extend(e, r);
   }
   jsonValueToNode(e) {
     const t = this.preprocess(m.deserialize(e));
-    return Pt(
+    return It(
       t,
       this.repositoryRegistry
     );
@@ -6410,7 +6409,7 @@ class xe {
     const t = await this.preprocessAsync(
       m.deserialize(e)
     );
-    return Pt(
+    return It(
       t,
       this.repositoryRegistry
     );
@@ -6432,7 +6431,7 @@ class xe {
   ) : this.jsonValueToNodeAsync(e);
   calculateBlueId = async (e) => {
     const t = await this.prepareForBlueIdCalculation(e);
-    return new Ye({
+    return new He({
       nodeProvider: this.nodeProvider,
       mergingProcessor: this.mergingProcessor
     }).calculateBlueId(t);
@@ -6440,7 +6439,7 @@ class xe {
   prepareForBlueIdCalculationSync = (e) => e instanceof u || Array.isArray(e) && e.every((t) => t instanceof u) ? e : Array.isArray(e) ? e.map((t) => this.jsonValueToNode(t)) : this.jsonValueToNode(e);
   calculateBlueIdSync(e) {
     const t = this.prepareForBlueIdCalculationSync(e);
-    return new Ye({
+    return new He({
       nodeProvider: this.nodeProvider,
       mergingProcessor: this.mergingProcessor
     }).calculateBlueIdSync(t);
@@ -6478,7 +6477,7 @@ class xe {
     }).preprocessWithDefaultBlue(t);
   }
   transform(e, t) {
-    return L.transform(e, t);
+    return $.transform(e, t);
   }
   getNodeProvider() {
     return this.nodeProvider;
@@ -6493,7 +6492,7 @@ class xe {
     if (!b.hasBlueIdOnly(e))
       return;
     const t = e.getReferenceBlueId();
-    return t !== void 0 && Be.isPotentialBlueId(t) ? t : void 0;
+    return t !== void 0 && ve.isPotentialBlueId(t) ? t : void 0;
   }
   getTypeSchemaResolver() {
     return this.typeSchemaResolver;
@@ -6614,7 +6613,7 @@ class xe {
    * @returns true if the node matches the schema type, false otherwise
    */
   isTypeOf(e, t, r) {
-    return k.isTypeOf(e, t, {
+    return H.isTypeOf(e, t, {
       checkSchemaExtensions: r?.checkSchemaExtensions,
       typeSchemaResolver: this.typeSchemaResolver,
       blueIdMapper: this.repositoryRegistry
@@ -6645,7 +6644,7 @@ class xe {
    * @returns true if the node matches the type, false otherwise.
    */
   isTypeOfNode(e, t) {
-    return new Ws(this).matchesType(e, t, this.globalLimits);
+    return new xs(this).matchesType(e, t, this.globalLimits);
   }
   /**
    * Sets the global limits for this Blue instance.
@@ -6676,8 +6675,8 @@ class xe {
   }
   wrapNodeProviderWithRepositories(e, t) {
     return t && t.length > 0 ? Me.wrap(
-      new wr([
-        new _t(t, {
+      new Ir([
+        new Dt(t, {
           mergingProcessor: this.mergingProcessor
         }),
         e
@@ -6685,268 +6684,14 @@ class xe {
     ) : Me.wrap(e);
   }
   combineWithGlobalLimits(e) {
-    return this.globalLimits == F ? e : e == F ? this.globalLimits : ot.of(this.globalLimits, e);
+    return this.globalLimits == F ? e : e == F ? this.globalLimits : st.of(this.globalLimits, e);
   }
 }
-const tn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Wi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  Blue: xe
-}, Symbol.toStringTag, { value: "Module" })), ft = /* @__PURE__ */ new WeakMap(), rn = 10;
-function kn(i, e = {}) {
-  const t = e.mergingProcessor === void 0;
-  if (t) {
-    const a = ft.get(i);
-    if (a)
-      return a;
-  }
-  const r = Lr(i);
-  if (r.length === 0)
-    return t && ft.set(i, i), i;
-  const s = $r(i), n = e.mergingProcessor ?? _e();
-  let o = Object.fromEntries(
-    r.map(({ oldBlueId: a }) => [a, a])
-  );
-  const l = sn(r.length);
-  for (let a = 0; a < l; a++) {
-    const c = ln(
-      r,
-      s,
-      o,
-      n
-    );
-    if (dn(o, c)) {
-      const d = an(i, o);
-      return t && ft.set(i, d), d;
-    }
-    o = c;
-  }
-  throw new Error(
-    `Repository semantic reindexing did not converge after ${l} passes for ${r.length} entries.`
-  );
-}
-function Hn(i, e = {}) {
-  const t = Lr(i);
-  if (t.length === 0)
-    return;
-  const r = $r(i), s = e.mergingProcessor ?? _e(), n = new xe({
-    nodeProvider: nn(t, r),
-    mergingProcessor: s
-  });
-  n.registerBlueIds(r);
-  for (const { packageName: o, oldBlueId: l, content: a } of t) {
-    const c = Array.isArray(a) ? a.map((h) => n.jsonValueToNode(h)) : n.jsonValueToNode(a), d = n.calculateBlueIdSync(c);
-    if (d !== l)
-      throw new he(
-        j.BLUE_ID_MISMATCH,
-        `Repository content key '${l}' does not match semantic BlueId '${d}'.`,
-        [
-          {
-            code: j.BLUE_ID_MISMATCH,
-            message: "Repository contents must be keyed by the semantic BlueId of their minimal storage form.",
-            context: { packageName: o, providedBlueId: l, computedBlueId: d }
-          }
-        ]
-      );
-  }
-}
-function sn(i) {
-  return Math.max(rn, i + 1);
-}
-function Lr(i) {
-  const e = [];
-  for (const [t, r] of Object.entries(i.packages))
-    for (const [s, n] of Object.entries(r.contents))
-      e.push({ packageName: t, oldBlueId: s, content: n });
-  return e;
-}
-function $r(i) {
-  const e = {};
-  for (const t of Object.values(i.packages))
-    for (const [r, s] of Object.entries(t.aliases))
-      e[r] = s;
-  return e;
-}
-function nn(i, e) {
-  const t = new Map(
-    i.map(({ oldBlueId: n, content: o }) => [n, o])
-  ), r = new Map(Object.entries(e)), s = new xe();
-  return {
-    fetchByBlueId(n) {
-      const o = on(n, r);
-      if (o === void 0)
-        return [];
-      const { baseBlueId: l, suffix: a } = wt(o), c = t.get(l);
-      if (c === void 0)
-        return [];
-      const d = Array.isArray(c), h = Te.resolveThisReferences(
-        c,
-        l,
-        d
-      );
-      if (a !== void 0) {
-        const f = Number(a.slice(1));
-        if (Array.isArray(h)) {
-          const g = h[f];
-          return g === void 0 ? [] : [s.jsonValueToNode(g)];
-        }
-        return f === 0 ? [s.jsonValueToNode(h)] : [];
-      }
-      return Array.isArray(h) ? h.map((f) => s.jsonValueToNode(f)) : [s.jsonValueToNode(h)];
-    },
-    fetchFirstByBlueId(n) {
-      return this.fetchByBlueId(n)[0] ?? null;
-    }
-  };
-}
-function on(i, e) {
-  const t = e.get(i);
-  if (t !== void 0)
-    return t;
-  const { baseBlueId: r, suffix: s } = wt(i);
-  if (s === void 0)
-    return i;
-  const n = e.get(r);
-  if (n === void 0)
-    return i;
-  if (wt(n).suffix === void 0)
-    return `${n}${s}`;
-}
-function wt(i) {
-  const e = i.indexOf("#");
-  return e === -1 ? { baseBlueId: i } : {
-    baseBlueId: i.slice(0, e),
-    suffix: i.slice(e)
-  };
-}
-function ln(i, e, t, r) {
-  const s = new Map(
-    i.map(({ oldBlueId: c, content: d }) => [
-      c,
-      et(d, t)
-    ])
-  ), n = /* @__PURE__ */ new Map();
-  for (const { oldBlueId: c } of i)
-    n.set(c, c), n.set(t[c], c);
-  const o = new xe(), l = {
-    fetchByBlueId(c) {
-      const [d, h] = c.split("#"), f = n.get(d);
-      if (!f)
-        return [];
-      const g = s.get(f);
-      if (g === void 0)
-        return [];
-      if (Array.isArray(g)) {
-        if (h !== void 0) {
-          const I = g[Number(h)];
-          return I === void 0 ? [] : [o.jsonValueToNode(I)];
-        }
-        return g.map((I) => o.jsonValueToNode(I));
-      }
-      return h !== void 0 && h !== "0" ? [] : [o.jsonValueToNode(g)];
-    },
-    fetchFirstByBlueId(c) {
-      return this.fetchByBlueId(c)[0] ?? null;
-    }
-  }, a = new xe({
-    nodeProvider: l,
-    mergingProcessor: r
-  });
-  return a.registerBlueIds(_r(e, t)), Object.fromEntries(
-    i.map(({ packageName: c, oldBlueId: d }) => {
-      const h = s.get(d);
-      if (h === void 0)
-        throw new Error(`Missing repository content for ${d}.`);
-      try {
-        const f = a.jsonValueToNode(h);
-        return [d, a.calculateBlueIdSync(f)];
-      } catch (f) {
-        const g = f instanceof Error ? f.message : String(f);
-        throw new Error(
-          `Failed to calculate semantic BlueId for ${c}/${d}: ${g}`
-        );
-      }
-    })
-  );
-}
-function an(i, e) {
-  return {
-    name: i.name,
-    repositoryVersions: i.repositoryVersions,
-    packages: Object.fromEntries(
-      Object.entries(i.packages).map(([t, r]) => [
-        t,
-        cn(r, e)
-      ])
-    )
-  };
-}
-function cn(i, e) {
-  return {
-    name: i.name,
-    aliases: _r(i.aliases, e),
-    typesMeta: Object.fromEntries(
-      Object.entries(i.typesMeta).map(([t, r]) => [
-        e[t] ?? t,
-        un(r, e)
-      ])
-    ),
-    contents: Object.fromEntries(
-      Object.entries(i.contents).map(([t, r]) => [
-        e[t] ?? t,
-        et(r, e)
-      ])
-    ),
-    schemas: Object.fromEntries(
-      Object.entries(i.schemas).map(([t, r]) => {
-        const s = e[t] ?? t;
-        return [
-          s,
-          Ls(s)(r)
-        ];
-      })
-    )
-  };
-}
-function un(i, e) {
-  return {
-    ...i,
-    versions: i.versions.map((t) => ({
-      ...t,
-      typeBlueId: jt(t.typeBlueId, e)
-    }))
-  };
-}
-function dn(i, e) {
-  const t = Object.keys(i);
-  return t.length !== Object.keys(e).length ? !1 : t.every((r) => i[r] === e[r]);
-}
-function _r(i, e) {
-  return Object.fromEntries(
-    Object.entries(i).map(([t, r]) => [
-      t,
-      jt(r, e)
-    ])
-  );
-}
-function et(i, e) {
-  return Array.isArray(i) ? i.map((t) => et(t, e)) : i && typeof i == "object" ? Object.fromEntries(
-    Object.entries(i).map(([t, r]) => [
-      t,
-      t === "blueId" && typeof r == "string" ? jt(r, e) : et(r, e)
-    ])
-  ) : i;
-}
-function jt(i, e) {
-  const t = e[i];
-  if (t !== void 0)
-    return t;
-  const r = /^(.*)(#\d+)$/.exec(i);
-  if (!r)
-    return i;
-  const [, s, n] = r;
-  return `${e[s] ?? s}${n}`;
-}
-class Yn extends xr {
+  Blue: Yi
+}, Symbol.toStringTag, { value: "Module" }));
+class Cn extends Ar {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   preprocessor;
@@ -6954,7 +6699,7 @@ class Yn extends xr {
   constructor(e = []) {
     super();
     const t = new De({ nodeProvider: this });
-    this.preprocessor = (r) => t.preprocessWithDefaultBlue(r), this.storageService = new oi({
+    this.preprocessor = (r) => t.preprocessWithDefaultBlue(r), this.storageService = new Xs({
       nodeProvider: this
     }), e.forEach((r) => this.processNode(r));
   }
@@ -6962,7 +6707,7 @@ class Yn extends xr {
     b.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
   }
   processSingleNode(e) {
-    const t = Te.parseAndCalculateBlueIdForNode(
+    const t = Re.parseAndCalculateBlueIdForNode(
       e,
       this.preprocessor,
       this.storageService
@@ -6984,7 +6729,7 @@ class Yn extends xr {
     this.storeNodeList(e);
   }
   storeNodeList(e) {
-    const t = Te.parseAndCalculateBlueIdForNodeList(
+    const t = Re.parseAndCalculateBlueIdForNodeList(
       e,
       this.preprocessor,
       this.storageService
@@ -6993,7 +6738,7 @@ class Yn extends xr {
   }
   fetchContentByBlueId(e) {
     const t = this.blueIdToContentMap.get(e), r = this.blueIdToMultipleDocumentsMap.get(e);
-    return t !== void 0 && r !== void 0 ? Te.resolveThisReferences(
+    return t !== void 0 && r !== void 0 ? Re.resolveThisReferences(
       t,
       e,
       r
@@ -7088,72 +6833,70 @@ class Yn extends xr {
   }
 }
 export {
-  as as Base58Sha256Provider,
-  Yn as BasicNodeProvider,
-  xe as Blue,
+  es as Base58Sha256Provider,
+  Cn as BasicNodeProvider,
+  Yi as Blue,
   M as BlueIdCalculator,
-  On as BlueIdToCid,
+  yn as BlueIdToCid,
   u as BlueNode,
-  k as BlueNodeTypeSchema,
-  gt as JsonCanonicalizer,
-  Dt as Limits,
+  H as BlueNodeTypeSchema,
+  ht as JsonCanonicalizer,
+  Rt as Limits,
   de as Merger,
-  _n as MergingProcessors,
-  Gs as NodeResolver,
+  Pn as MergingProcessors,
+  Fs as NodeResolver,
   b as Nodes,
-  Pn as Properties,
+  nn as Properties,
   J as ResolvedBlueNode,
-  Ye as SemanticIdentityService,
-  Ys as TypeSchemaResolver,
-  Mn as applyBlueNodePatch,
-  it as baseBlueObjectSchema,
-  Dn as blueDescriptionField,
-  xn as blueIdField,
-  wn as blueIdSchema,
-  Ln as blueNameField,
-  $n as blueNodeField,
-  En as blueObjectBooleanValueSchema,
-  bn as blueObjectNumberValueSchema,
+  He as SemanticIdentityService,
+  _s as TypeSchemaResolver,
+  gn as applyBlueNodePatch,
+  tt as baseBlueObjectSchema,
+  mn as blueDescriptionField,
+  In as blueIdField,
+  on as blueIdSchema,
+  vn as blueNameField,
+  Tn as blueNodeField,
+  cn as blueObjectBooleanValueSchema,
+  an as blueObjectNumberValueSchema,
   Ve as blueObjectSchema,
-  Nn as blueObjectStringListItemsSchema,
-  Sn as blueObjectStringValueSchema,
-  xt as createNodeProvider,
-  kt as enrichWithBlueId,
-  Es as getBlueDescriptionAnnotation,
-  Rs as getBlueIdAnnotation,
-  Vs as getBlueNameAnnotation,
-  Ms as getBlueNodeAnnotation,
-  jn as getBlueObjectItems,
-  Un as getBlueObjectProperties,
-  zn as getBlueObjectTypeLabel,
-  Fn as getBlueObjectValue,
-  xs as getTypeBlueIdAnnotation,
-  qr as hasBlueObjectBlueIdDefined,
-  Qr as hasBlueObjectItemsDefined,
-  Rn as hasBlueObjectNameDefined,
-  es as hasBlueObjectTypeDefined,
-  ts as hasBlueObjectValueDefined,
-  yt as isBigDecimalNumber,
+  un as blueObjectStringListItemsSchema,
+  ln as blueObjectStringValueSchema,
+  At as createNodeProvider,
+  Ft as enrichWithBlueId,
+  Is as getBlueDescriptionAnnotation,
+  Bs as getBlueIdAnnotation,
+  ws as getBlueNameAnnotation,
+  bs as getBlueNodeAnnotation,
+  wn as getBlueObjectItems,
+  bn as getBlueObjectProperties,
+  En as getBlueObjectTypeLabel,
+  Sn as getBlueObjectValue,
+  Ns as getTypeBlueIdAnnotation,
+  Hr as hasBlueObjectBlueIdDefined,
+  kr as hasBlueObjectItemsDefined,
+  hn as hasBlueObjectNameDefined,
+  Yr as hasBlueObjectTypeDefined,
+  Wr as hasBlueObjectValueDefined,
+  dt as isBigDecimalNumber,
   oe as isBigIntegerNumber,
   C as isBigNumber,
-  Tr as isBlueNodeSchema,
-  Cn as isBlueObject,
-  Bi as isBlueObjectResolved,
-  An as isGivenBlueObjectTypeSchema,
-  fr as isJsonBlueArray,
-  pr as isJsonBlueObject,
-  Vn as isJsonBlueValue,
-  We as isUrl,
-  Ze as jsonBlueValueSchema,
-  Kn as normalizeToBlueObject,
-  kn as reindexRepositoryForSemanticStorage,
-  Ht as resolveBlueObjectItems,
-  Hn as validateRepositorySemanticStorage,
-  bs as withBlueDescription,
-  Cs as withBlueId,
-  As as withBlueName,
-  Os as withBlueNode,
-  Ls as withTypeBlueId,
-  Qs as yamlBlueDump,
+  yr as isBlueNodeSchema,
+  dn as isBlueObject,
+  hi as isBlueObjectResolved,
+  pn as isGivenBlueObjectTypeSchema,
+  cr as isJsonBlueArray,
+  ar as isJsonBlueObject,
+  fn as isJsonBlueValue,
+  ke as isUrl,
+  Ge as jsonBlueValueSchema,
+  Nn as normalizeToBlueObject,
+  jt as resolveBlueObjectItems,
+  ms as withBlueDescription,
+  Ts as withBlueId,
+  Ps as withBlueName,
+  Ss as withBlueNode,
+  Bn as withTypeBlueId,
+  Hs as yamlBlueDump,
   ae as yamlBlueParse
 };