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

package/dist/index.mjs

@@ -1,14 +1,14 @@
 import G from "big.js";
-import { isNullable as v, isNonNullable as p, jsonPrimitiveSchema as _r, isReadonlyArray as Wt, isJsonPrimitive as Gt, isPreciseNumberString as Jt } from "@blue-labs/shared-utils";
-import { z as y, ZodOptional as Zt, ZodNullable as Xt, ZodReadonly as qt, ZodBranded as Qt, ZodEffects as We, ZodLazy as Ge, ZodString as ge, ZodNumber as me, ZodBoolean as Ue, ZodBigInt as Ke, ZodEnum as jr, ZodNativeEnum as Fr, ZodIntersection as Ur, ZodUnion as Kr, ZodObject as zr, ZodRecord as kr } from "zod";
+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 Ae from "bs58";
-import { isObject as er, isArray as tr, isString as wt, omit as rr, pascal as Hr, map as Yr } from "radash";
-import { OBJECT_CONTRACTS as K, OBJECT_MERGE_POLICY as St, OBJECT_SCHEMA as sr, BLUE_REPOSITORY_STATUS_STABLE as Ce, BLUE_REPOSITORY_STATUS_DEV as bt, validateAttributesAddedPointer as Wr, parsePointer as ir } from "@blue-labs/repository-contract";
-import { sha256 as Gr } from "js-sha256";
-import lt from "crypto";
-import Jr from "base32.js";
+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 D extends G {
+class $ extends G {
   constructor(e) {
     super(e);
   }
@@ -18,10 +18,10 @@ class A extends G {
     super(e);
   }
 }
-const ie = "name", ne = "description", z = "type", we = "itemType", Se = "keyType", be = "valueType", W = "value", Y = "items", V = "blueId", Le = "blue", Et = [
+const ie = "name", ne = "description", K = "type", we = "itemType", Se = "keyType", be = "valueType", W = "value", Y = "items", V = "blueId", Le = "blue", Nt = [
   ie,
   ne,
-  z,
+  K,
   we,
   Se,
   be,
@@ -29,60 +29,60 @@ const ie = "name", ne = "description", z = "type", we = "itemType", Se = "keyTyp
   Y,
   V,
   Le
-], nr = "Text", or = "Double", lr = "Integer", ar = "Boolean", cr = "List", ur = "Dictionary", et = [
-  nr,
+], or = "Text", lr = "Double", ar = "Integer", cr = "Boolean", ur = "List", dr = "Dictionary", tt = [
   or,
   lr,
-  ar
-], Nt = [...et, cr, ur], Q = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", ee = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", te = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", re = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", tt = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", Ct = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", Rt = [
+  ar,
+  cr
+], Ct = [...tt, ur, dr], Q = "DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K", ee = "7pwXmXYCJtWnd348c2JQGBkm9C4renmZRwxbfaypsx5y", te = "5WNMiV9Knz63B4dVY5JtMyh3FB4FSGqv7ceScvuapdE1", re = "4EzhSubEimSQD3zrYHRtobfPPWntUuhEz8YcdxHsi12u", rt = "6aehfNAxHLC1PHHoDr3tYtFH3RWNbiWdFancJ1bypXEY", Rt = "G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj", At = [
   Q,
   ee,
   te,
   re
 ], fe = [
-  ...Rt,
-  tt,
-  Ct
-], dr = Object.fromEntries(
-  Nt.map((i, e) => [i, fe[e]])
-), rt = Object.fromEntries(
-  fe.map((i, e) => [i, Nt[e]])
-), In = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  ...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({
   __proto__: null,
-  BASIC_TYPES: et,
-  BASIC_TYPE_BLUE_IDS: Rt,
-  BOOLEAN_TYPE: ar,
+  BASIC_TYPES: tt,
+  BASIC_TYPE_BLUE_IDS: At,
+  BOOLEAN_TYPE: cr,
   BOOLEAN_TYPE_BLUE_ID: re,
-  CORE_TYPES: Nt,
+  CORE_TYPES: Ct,
   CORE_TYPE_BLUE_IDS: fe,
-  CORE_TYPE_BLUE_ID_TO_NAME_MAP: rt,
-  CORE_TYPE_NAME_TO_BLUE_ID_MAP: dr,
-  DICTIONARY_TYPE: ur,
-  DICTIONARY_TYPE_BLUE_ID: Ct,
-  DOUBLE_TYPE: or,
+  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,
   DOUBLE_TYPE_BLUE_ID: ee,
-  INTEGER_TYPE: lr,
+  INTEGER_TYPE: ar,
   INTEGER_TYPE_BLUE_ID: te,
-  LIST_TYPE: cr,
-  LIST_TYPE_BLUE_ID: tt,
+  LIST_TYPE: ur,
+  LIST_TYPE_BLUE_ID: rt,
   OBJECT_BLUE: Le,
   OBJECT_BLUE_ID: V,
-  OBJECT_CONTRACTS: K,
+  OBJECT_CONTRACTS: z,
   OBJECT_DESCRIPTION: ne,
   OBJECT_ITEMS: Y,
   OBJECT_ITEM_TYPE: we,
   OBJECT_KEY_TYPE: Se,
-  OBJECT_MERGE_POLICY: St,
+  OBJECT_MERGE_POLICY: bt,
   OBJECT_NAME: ie,
-  OBJECT_SCHEMA: sr,
-  OBJECT_SPECIFIC_KEYS: Et,
-  OBJECT_TYPE: z,
+  OBJECT_SCHEMA: ir,
+  OBJECT_SPECIFIC_KEYS: Nt,
+  OBJECT_TYPE: K,
   OBJECT_VALUE: W,
   OBJECT_VALUE_TYPE: be,
-  TEXT_TYPE: nr,
+  TEXT_TYPE: or,
   TEXT_TYPE_BLUE_ID: Q
 }, Symbol.toStringTag, { value: "Module" }));
-class Zr {
+class Xr {
   static get(e, t, r, s = !0) {
     if (v(t) || !t.startsWith("/"))
       throw new Error(`Invalid path: ${t}`);
@@ -178,7 +178,7 @@ class Zr {
           n = new u().setProperties(l);
           break;
         }
-        case K: {
+        case z: {
           const l = e.getContracts();
           n = new u().setContracts(l);
           break;
@@ -259,15 +259,15 @@ class u {
       if (e === te && typeof this.value == "string")
         return new A(this.value);
       if (e === ee && typeof this.value == "string") {
-        const t = new D(this.value), r = parseFloat(t.toString());
-        return new D(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 D(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?.[K];
+    return this.properties?.[z];
   }
   getContracts() {
     return this.getContractsProperty()?.getProperties();
   }
   setContracts(e) {
-    return v(e) ? this.removeProperty(K) : this.addProperty(
-      K,
+    return v(e) ? this.removeProperty(z) : this.addProperty(
+      z,
       new u().setProperties(e)
     ), this;
   }
   addContract(e, t) {
     const r = this.getContractsProperty();
     return v(r) ? this.addProperty(
-      K,
+      z,
       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(K);
+      r && Object.keys(r).length === 0 && this.removeProperty(z);
     }
     return this;
   }
@@ -358,7 +358,7 @@ class u {
     return !1;
   }
   get(e, t) {
-    return Zr.get(this, e, t);
+    return Xr.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 D)
+    if (t instanceof A || t instanceof $)
       return t.toNumber();
     throw new Error(
       `Value at path ${e} is not a BigInteger or BigDecimal: ${t}`
@@ -414,7 +414,7 @@ class Be {
     return !0;
   }
 }
-const vn = y.string().max(Be.MAX_BLUE_ID_LENGTH, {
+const wn = y.string().max(Be.MAX_BLUE_ID_LENGTH, {
   message: "Blue Id has a maximum length of 45 characters"
 }).min(Be.MIN_BLUE_ID_LENGTH, {
   message: "Blue Id has a minimum length of 41 characters"
@@ -440,34 +440,34 @@ const vn = y.string().max(Be.MAX_BLUE_ID_LENGTH, {
       items: y.array(Ve).optional()
     })
   )
-), st = y.object({
+), it = y.object({
   blueId: y.string().optional(),
   name: y.string().optional(),
   description: y.string().optional(),
   type: Ve.optional()
-}), Tn = st.extend({
+}), Sn = it.extend({
   value: y.string().optional()
-}), Bn = st.extend({
+}), bn = it.extend({
   value: y.number().optional()
-}), Pn = st.extend({
+}), En = it.extend({
   value: y.boolean().optional()
-}), wn = st.extend({
+}), Nn = it.extend({
   items: y.array(y.string()).optional()
-}), Sn = (i) => Ve.safeParse(i).success, Xr = (i) => p(i) && "blueId" in i && p(i.blueId), bn = (i) => p(i) && "name" in i && p(i.name), qr = (i) => p(i) && "items" in i && p(i.items), Qr = (i) => p(i) && "type" in i && p(i.type), es = (i) => p(i) && "value" in i && p(i.value), En = (i, e) => i.required({ type: !0 }).safeParse(e).success, R = (i) => i instanceof G, oe = (i) => R(i) && i instanceof A, ft = (i) => R(i) && i instanceof D, ts = y.lazy(
-  () => y.record(Je)
-), rs = y.lazy(
+}), 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(Je),
-    y.array(Je).readonly()
+    y.array(Ze),
+    y.array(Ze).readonly()
   ])
-), Je = y.lazy(
+), Ze = y.lazy(
   () => y.union([
-    _r,
-    ts,
+    jr,
     rs,
+    ss,
     y.instanceof(G)
   ])
-), hr = (i) => er(i) && !tr(i) && !Wt(i) && !R(i), pr = (i) => tr(i) || Wt(i), Nn = (i) => pr(i) || hr(i) || R(i) || Gt(i);
+), 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);
 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 (hr(e)) {
+    if (pr(e)) {
       const t = new u(), r = {};
       return Object.entries(e).forEach(([s, n]) => {
         switch (s) {
@@ -501,7 +501,7 @@ class m {
               t.setDescription(n);
             }
             break;
-          case z:
+          case K:
             t.setType(m.handleNode(n));
             break;
           case we:
@@ -533,7 +533,7 @@ class m {
         }
       }), Object.keys(r).length > 0 && t.setProperties(r), t;
     } else {
-      if (pr(e))
+      if (fr(e))
         return new u().setItems(m.handleArray(e));
       {
         const t = e;
@@ -546,13 +546,13 @@ class m {
       return null;
     if (typeof e == "string")
       return e;
-    if (typeof e == "number" || R(e))
+    if (typeof e == "number" || C(e))
       if (oe(e) || Number.isSafeInteger(e)) {
         const t = new A(e.toString()), r = Number.MIN_SAFE_INTEGER, s = Number.MAX_SAFE_INTEGER;
         return t.lt(r) ? new A(r.toString()) : t.gt(s) ? new A(s.toString()) : t;
       } else {
         const t = parseFloat(e.toString());
-        return new D(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 (er(e) && !Array.isArray(e))
+      if (tr(e) && !Array.isArray(e))
         return [m.handleNode(e)];
       if (Array.isArray(e))
         return e.map(m.handleNode);
@@ -568,12 +568,12 @@ class m {
     }
   }
 }
-function ss(i) {
+function is(i) {
   return i && i.__esModule && Object.prototype.hasOwnProperty.call(i, "default") ? i.default : i;
 }
-var at, jt;
-function is() {
-  return jt || (jt = 1, at = function i(e) {
+var ct, Ft;
+function ns() {
+  return Ft || (Ft = 1, ct = 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 is() {
       const n = r.length === 0 ? "" : ",";
       return `${r}${n}${i(s)}:${i(e[s])}`;
     }, "")}}`;
-  }), at;
+  }), ct;
 }
-var ns = is();
-const os = /* @__PURE__ */ ss(ns);
-class yt {
+var os = ns();
+const ls = /* @__PURE__ */ is(os);
+class gt {
   static canonicalize(e) {
-    return os(e);
+    return ls(e);
   }
 }
-const ct = typeof process < "u" && process.versions != null && process.versions.node != null;
-class At {
+const ut = typeof process < "u" && process.versions != null && process.versions.node != null;
+class Vt {
   static instance;
   browserCrypto;
   constructor() {
     this.browserCrypto = this.initBrowserCrypto();
   }
   static getInstance() {
-    return this.instance || (this.instance = new At()), this.instance;
+    return this.instance || (this.instance = new Vt()), this.instance;
   }
   initBrowserCrypto() {
-    return ct ? null : "crypto" in globalThis ? globalThis.crypto : null;
+    return ut ? null : "crypto" in globalThis ? globalThis.crypto : null;
   }
   hasNodeCrypto() {
-    return ct && !!lt && typeof lt.createHash == "function";
+    return ut && !!at && typeof at.createHash == "function";
   }
   getBrowserCrypto() {
     return this.browserCrypto;
   }
   getNodeCrypto() {
-    return ct ? lt : null;
+    return ut ? at : null;
   }
 }
-class ls {
-  cryptoEnv = At.getInstance();
+class as {
+  cryptoEnv = Vt.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 ls {
     return Ae.encode(r);
   }
   canonicalizeInput(e) {
-    const t = yt.canonicalize(e);
+    const t = gt.canonicalize(e);
     if (typeof t != "string")
       throw new Error("Canonized value must be a string");
     return t;
@@ -642,7 +642,7 @@ class ls {
     return new Uint8Array(r);
   }
   sha256SyncBrowser(e) {
-    return new Uint8Array(Gr.arrayBuffer(e));
+    return new Uint8Array(Jr.arrayBuffer(e));
   }
   async sha256Async(e) {
     if (this.cryptoEnv.hasNodeCrypto())
@@ -654,7 +654,7 @@ class ls {
     return new Uint8Array(n);
   }
 }
-const b = {
+const S = {
   NAME: "name",
   DESCRIPTION: "description",
   TYPE: "type",
@@ -667,7 +667,7 @@ const b = {
   BLUE: "blue",
   ITEMS: "items"
 };
-class E {
+class b {
   /**
    * Check if a node is empty (has no fields set)
    */
@@ -678,13 +678,13 @@ class E {
    * Check if a node has only a Blue ID
    */
   static hasBlueIdOnly(e) {
-    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([b.BLUE_ID]));
+    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([S.BLUE_ID]));
   }
   /**
    * Check if a node has only items
    */
   static hasItemsOnly(e) {
-    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([b.ITEMS]));
+    return this.hasFieldsAndMayHaveFields(e, /* @__PURE__ */ new Set([S.ITEMS]));
   }
   /**
    * Check if a node is a valid value node (has a value, no properties, no items)
@@ -712,7 +712,7 @@ class E {
    * Create a double node
    */
   static doubleNode(e) {
-    const t = e instanceof D ? e : new D(e.toString());
+    const t = e instanceof $ ? e : new $(e.toString());
     return new u().setType(new u().setBlueId(ee)).setValue(t);
   }
   /**
@@ -729,7 +729,7 @@ class E {
    * @returns true if the node matches the field requirements
    */
   static hasFieldsAndMayHaveFields(e, t = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set()) {
-    for (const s of Object.values(b)) {
+    for (const s of Object.values(S)) {
       const n = p(this.getFieldValue(e, s));
       if (t.has(s)) {
         if (!n) return !1;
@@ -744,41 +744,41 @@ class E {
    */
   static getFieldValue(e, t) {
     switch (t) {
-      case b.NAME:
+      case S.NAME:
         return e.getName();
-      case b.TYPE:
+      case S.TYPE:
         return e.getType();
-      case b.VALUE:
+      case S.VALUE:
         return e.getValue();
-      case b.DESCRIPTION:
+      case S.DESCRIPTION:
         return e.getDescription();
-      case b.PROPERTIES:
+      case S.PROPERTIES:
         return e.getProperties();
-      case b.BLUE:
+      case S.BLUE:
         return e.getBlue();
-      case b.ITEMS:
+      case S.ITEMS:
         return e.getItems();
-      case b.KEY_TYPE:
+      case S.KEY_TYPE:
         return e.getKeyType();
-      case b.VALUE_TYPE:
+      case S.VALUE_TYPE:
         return e.getValueType();
-      case b.ITEM_TYPE:
+      case S.ITEM_TYPE:
         return e.getItemType();
-      case b.BLUE_ID:
+      case S.BLUE_ID:
         return e.getBlueId();
       default:
         throw new Error(`Unknown field: ${t}`);
     }
   }
 }
-const Ie = "$previous", ce = "$pos", gt = "$empty";
-class T {
+const Ie = "$previous", ce = "$pos", mt = "$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()?.[St]?.getValue();
+    const t = e.getProperties()?.[bt]?.getValue();
     if (t === "append-only" || t === "positional")
       return t;
   }
@@ -814,26 +814,26 @@ class T {
   static hasEmptyProperty(e) {
     return Object.prototype.hasOwnProperty.call(
       e.getProperties() ?? {},
-      gt
+      mt
     );
   }
   static isEmptyItem(e) {
-    const t = e.getProperties(), r = t?.[gt];
-    return t !== void 0 && Object.keys(t).length === 1 && r !== void 0 && E.hasFieldsAndMayHaveFields(
+    const t = e.getProperties(), r = t?.[mt];
+    return t !== void 0 && Object.keys(t).length === 1 && r !== void 0 && b.hasFieldsAndMayHaveFields(
       e,
-      /* @__PURE__ */ new Set([b.PROPERTIES])
-    ) && E.hasFieldsAndMayHaveFields(
+      /* @__PURE__ */ new Set([S.PROPERTIES])
+    ) && b.hasFieldsAndMayHaveFields(
       r,
-      /* @__PURE__ */ new Set([b.VALUE]),
-      /* @__PURE__ */ new Set([b.TYPE])
+      /* @__PURE__ */ new Set([S.VALUE]),
+      /* @__PURE__ */ new Set([S.TYPE])
     ) && r.getValue() === !0;
   }
   static isPreviousItem(e) {
     const t = e.getProperties();
-    return t !== void 0 && Object.keys(t).length === 1 && E.hasFieldsAndMayHaveFields(
+    return t !== void 0 && Object.keys(t).length === 1 && b.hasFieldsAndMayHaveFields(
       e,
-      /* @__PURE__ */ new Set([b.PROPERTIES])
-    ) && E.hasBlueIdOnly(t[Ie]);
+      /* @__PURE__ */ new Set([S.PROPERTIES])
+    ) && b.hasBlueIdOnly(t[Ie]);
   }
   static getPreviousBlueId(e) {
     if (this.isPreviousItem(e))
@@ -848,10 +848,10 @@ class T {
     const t = e.getProperties()?.[ce];
     if (t === void 0)
       return;
-    if (!E.hasFieldsAndMayHaveFields(
+    if (!b.hasFieldsAndMayHaveFields(
       t,
-      /* @__PURE__ */ new Set([b.VALUE]),
-      /* @__PURE__ */ new Set([b.TYPE])
+      /* @__PURE__ */ new Set([S.VALUE]),
+      /* @__PURE__ */ new Set([S.TYPE])
     ))
       throw new Error("$pos must be a non-negative integer value.");
     const r = t.getValue(), s = r instanceof A ? r.toNumber() : typeof r == "number" ? r : void 0;
@@ -871,7 +871,7 @@ class T {
     return r !== void 0 && (delete r[ce], Object.keys(r).length === 0 && t.setProperties(void 0)), t;
   }
   static hasPayloadAfterRemovingPosition(e) {
-    return !E.isEmptyNode(this.withoutPosition(e));
+    return !b.isEmptyNode(this.withoutPosition(e));
   }
   static isReplacementPayload(e) {
     return p(e.getValue()) || p(e.getItems()) || p(e.getBlueId());
@@ -883,12 +883,12 @@ class T {
     return e !== void 0 && this.hasPositionControl(e);
   }
 }
-const as = /* @__PURE__ */ new Set([
+const cs = /* @__PURE__ */ new Set([
   ie,
   ne,
   W
-]), cs = { $list: "empty" }, us = "$listCons", ds = "prev", hs = "elem";
-class ps {
+]), us = { $list: "empty" }, ds = "$listCons", hs = "prev", ps = "elem";
+class fs {
   constructor(e) {
     this.hashProvider = e;
   }
@@ -910,7 +910,7 @@ class ps {
   calculateMap(e, t) {
     const s = Object.entries(e).sort(([o], [l]) => o.localeCompare(l)).map(
       ([o, l]) => {
-        if (as.has(o))
+        if (cs.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 ps {
         );
       s = t ? o : Promise.resolve(o), r = 1;
     } else
-      s = this.applyHash(cs, t);
+      s = this.applyHash(us, t);
     for (let o = r; o < e.length; o++) {
       const l = e[o];
       if (this.hasPreviousControlKey(l))
@@ -958,20 +958,20 @@ class ps {
   }
   createListFoldInput(e, t) {
     return {
-      [us]: {
-        [ds]: { [V]: e },
-        [hs]: { [V]: t }
+      [ds]: {
+        [hs]: { [V]: e },
+        [ps]: { [V]: t }
       }
     };
   }
   getPreviousControlBlueId(e) {
-    if (typeof e != "object" || e === null || Array.isArray(e) || R(e))
+    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)
       return;
     const r = t[0][1];
-    if (!(typeof r != "object" || r === null || Array.isArray(r) || R(r) || !this.isPureReference(r)))
+    if (!(typeof r != "object" || r === null || Array.isArray(r) || C(r) || !this.isPureReference(r)))
       return r[V];
   }
   hasPreviousControlKey(e) {
@@ -981,7 +981,7 @@ class ps {
     return this.hasControlKey(e, ce);
   }
   hasControlKey(e, t) {
-    return typeof e == "object" && e !== null && !Array.isArray(e) && !R(e) && Object.prototype.hasOwnProperty.call(e, t);
+    return typeof e == "object" && e !== null && !Array.isArray(e) && !C(e) && Object.prototype.hasOwnProperty.call(e, t);
   }
   applyHash(e, t) {
     return t ? this.hashProvider.applySync(e) : this.hashProvider.apply(e);
@@ -991,7 +991,7 @@ class ps {
   }
   nodeToHashValue(e) {
     const t = {};
-    this.setIfPresent(t, ie, e.getName()), this.setIfPresent(t, ne, e.getDescription()), this.setIfPresent(t, z, 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, K, e.getType()), this.setIfPresent(t, we, e.getItemType()), this.setIfPresent(t, Se, e.getKeyType()), this.setIfPresent(t, be, e.getValueType());
     const r = e.getValue();
     r !== void 0 && (t[W] = this.scalarToHashValue(r));
     const s = e.getItems();
@@ -1004,7 +1004,7 @@ class ps {
   }
   jsonToHashValue(e) {
     if (e != null) {
-      if (this.isScalar(e) || R(e))
+      if (this.isScalar(e) || C(e))
         return this.scalarToHashValue(e);
       if (Array.isArray(e))
         return e.map((t) => this.jsonToHashValue(t)).filter((t) => t !== void 0);
@@ -1043,14 +1043,14 @@ class ps {
     return t.length === 1 && t[0]?.[0] === W;
   }
   isBasicTypedScalarWrapper(e) {
-    return this.hasOnlyKeys(e, [z, W]) && this.isBasicScalarTypeReference(e[z]);
+    return this.hasOnlyKeys(e, [K, W]) && this.isBasicScalarTypeReference(e[K]);
   }
   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, [z, Y]) && this.isTypeReference(e[z], tt) && Array.isArray(e[Y]);
+    return this.hasOnlyKeys(e, [K, Y]) && this.isTypeReference(e[K], rt) && Array.isArray(e[Y]);
   }
   hasOnlyKeys(e, t) {
     return Object.keys(e).length === t.length && t.every(
@@ -1061,33 +1061,33 @@ class ps {
     return this.isTypeReference(e, Q) || this.isTypeReference(e, te) || this.isTypeReference(e, ee) || this.isTypeReference(e, re);
   }
   isTypeReference(e, t) {
-    return typeof e != "object" || e === null || Array.isArray(e) || R(e) ? !1 : this.isPureReference(e) && e[V] === t;
+    return typeof e != "object" || e === null || Array.isArray(e) || C(e) ? !1 : this.isPureReference(e) && e[V] === t;
   }
   isScalar(e) {
-    return Gt(e) && e !== null || R(e);
+    return Jt(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 D || R(e) ? e.toNumber() : e;
+    return e instanceof $ || C(e) ? e.toNumber() : e;
   }
   toJsonScalar(e) {
-    return R(e) ? this.scalarToHashValue(e) : e;
+    return C(e) ? this.scalarToHashValue(e) : e;
   }
 }
-class O {
-  static INSTANCE = new O(new ls());
+class M {
+  static INSTANCE = new M(new as());
   hasher;
   constructor(e) {
-    this.hasher = new ps(e);
+    this.hasher = new fs(e);
   }
   static calculateBlueId(e) {
-    return O.INSTANCE.calculate(e);
+    return M.INSTANCE.calculate(e);
   }
   static calculateBlueIdSync(e) {
-    return O.INSTANCE.calculateSync(e);
+    return M.INSTANCE.calculateSync(e);
   }
   calculate(e) {
     return this.hasher.calculate(e);
@@ -1107,10 +1107,10 @@ class U {
     return this.reverseNode(t, e, void 0, !0), t;
   }
   static calculateHashMinimalBlueId(e) {
-    return O.calculateBlueIdSync(this.toHashMinimalNode(e));
+    return M.calculateBlueIdSync(this.toHashMinimalNode(e));
   }
   static calculateHashMinimalListBlueId(e) {
-    return O.calculateBlueIdSync(
+    return M.calculateBlueIdSync(
       e.map((t) => this.toHashMinimalNode(t))
     );
   }
@@ -1170,7 +1170,7 @@ class U {
     if (p(t))
       return new u().setBlueId(t);
     const r = new u();
-    return this.reverseNode(r, e, void 0, !0), E.isEmptyNode(r) ? e.clone() : r;
+    return this.reverseNode(r, e, void 0, !0), b.isEmptyNode(r) ? e.clone() : r;
   }
   reverseItems(e, t, r) {
     const s = t.getItems();
@@ -1194,14 +1194,14 @@ class U {
       throw new Error(
         `Resolved list has fewer items (${r.length}) than inherited list (${s.length}).`
       );
-    const n = T.getMergePolicy(e, t), o = [];
+    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);
     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 = [T.createPreviousItem(l)];
+    const l = U.calculateHashMinimalListBlueId(s), a = [B.createPreviousItem(l)];
     for (const c of o) {
       const d = new u();
       this.reverseNode(
@@ -1210,8 +1210,8 @@ class U {
         s[c],
         !1
       );
-      const h = E.isEmptyNode(d) ? r[c].clone() : d;
-      a.push(T.createPositionedItem(c, h));
+      const h = b.isEmptyNode(d) ? r[c].clone() : d;
+      a.push(B.createPositionedItem(c, h));
     }
     for (let c = s.length; c < r.length; c++) {
       const d = new u();
@@ -1239,7 +1239,7 @@ class U {
         l,
         a,
         !1
-      ), E.isEmptyNode(c) || (n[o] = c);
+      ), b.isEmptyNode(c) || (n[o] = c);
     }
     Object.keys(n).length > 0 && e.setProperties(n);
   }
@@ -1258,7 +1258,7 @@ class U {
     if (v(e))
       return;
     const t = e.cloneShallow().setName(void 0).setDescription(void 0).setType(void 0).setBlueId(void 0);
-    if (!E.isEmptyNode(t))
+    if (!b.isEmptyNode(t))
       return t;
   }
   /**
@@ -1290,7 +1290,7 @@ class U {
     return p(d) && r.setItems(d.map((h) => h.clone())), r;
   }
 }
-class mt {
+class It {
   mergeReverser = new U();
   hashMergeReverser = new U({
     emitListControls: !1
@@ -1321,7 +1321,7 @@ class he extends Error {
     super(t), this.code = e, this.details = r && r.length > 0 ? r : [], this.name = "BlueError";
   }
 }
-const _ = {
+const j = {
   AMBIGUOUS_BLUE_ID_PAYLOAD: "AMBIGUOUS_BLUE_ID_PAYLOAD",
   BLUE_ID_MISMATCH: "BLUE_ID_MISMATCH",
   INVALID_STORAGE_SHAPE: "INVALID_STORAGE_SHAPE",
@@ -1332,9 +1332,9 @@ const _ = {
 };
 class X {
   static RESERVED_PROPERTY_KEYS = /* @__PURE__ */ new Set([
-    sr,
-    St,
-    K
+    ir,
+    bt,
+    z
   ]);
   static INTERNAL_PROPERTIES_KEY = "properties";
   static validateStorageShape(e) {
@@ -1369,17 +1369,17 @@ class X {
   static validateNode(e, t, r) {
     r.insideItems && this.validateListControlItem(e, t, r.itemIndex ?? 0);
     const s = e.getReferenceBlueId();
-    if (s !== void 0 && !E.hasBlueIdOnly(e))
-      if (r.insideItems && T.hasPositionProperty(e) && E.hasBlueIdOnly(T.withoutPosition(e)))
-        T.readPosition(e);
+    if (s !== void 0 && !b.hasBlueIdOnly(e))
+      if (r.insideItems && B.hasPositionProperty(e) && b.hasBlueIdOnly(B.withoutPosition(e)))
+        B.readPosition(e);
       else {
         const h = this.toPointer(t);
         throw new he(
-          _.AMBIGUOUS_BLUE_ID_PAYLOAD,
+          j.AMBIGUOUS_BLUE_ID_PAYLOAD,
           `Ambiguous blueId plus payload at ${h}. Use exact { blueId } for references or remove blueId from payload content.`,
           [
             {
-              code: _.AMBIGUOUS_BLUE_ID_PAYLOAD,
+              code: j.AMBIGUOUS_BLUE_ID_PAYLOAD,
               message: "A storage or authoring node cannot combine blueId with payload.",
               locationPath: t,
               context: { blueId: s }
@@ -1409,35 +1409,35 @@ class X {
         this.validateNode(h, [...t, d], { insideItems: !1 });
   }
   static validateListControlItem(e, t, r) {
-    if (T.hasEmptyProperty(e) && (T.hasPreviousProperty(e) && this.throwInvalidStorageShape(
+    if (B.hasEmptyProperty(e) && (B.hasPreviousProperty(e) && this.throwInvalidStorageShape(
       t,
       "$empty cannot be combined with $previous."
-    ), T.hasPositionProperty(e) && this.throwInvalidStorageShape(
+    ), B.hasPositionProperty(e) && this.throwInvalidStorageShape(
       t,
       "$empty cannot be combined with $pos."
-    ), T.isEmptyItem(e) || this.throwInvalidStorageShape(
+    ), B.isEmptyItem(e) || this.throwInvalidStorageShape(
       t,
       "$empty list content must be exactly { $empty: true }."
-    )), T.hasPreviousProperty(e) && (r !== 0 && this.throwInvalidStorageShape(
+    )), B.hasPreviousProperty(e) && (r !== 0 && this.throwInvalidStorageShape(
       t,
       "$previous list control is allowed only as the first item."
-    ), T.isPreviousItem(e) || this.throwInvalidStorageShape(
+    ), B.isPreviousItem(e) || this.throwInvalidStorageShape(
       t,
       "$previous list control must be exactly { $previous: { blueId: <id> } }."
-    )), T.hasPositionProperty(e)) {
-      T.hasPreviousProperty(e) && this.throwInvalidStorageShape(
+    )), B.hasPositionProperty(e)) {
+      B.hasPreviousProperty(e) && this.throwInvalidStorageShape(
         t,
         "$pos cannot be combined with $previous."
       );
       try {
-        T.readPosition(e);
+        B.readPosition(e);
       } catch (s) {
         this.throwInvalidStorageShape(
           [...t, ce],
           s instanceof Error ? s.message : "$pos must be a non-negative integer value."
         );
       }
-      T.hasPayloadAfterRemovingPosition(e) || this.throwInvalidStorageShape(
+      B.hasPayloadAfterRemovingPosition(e) || this.throwInvalidStorageShape(
         t,
         "$pos list control must include an item payload."
       );
@@ -1459,18 +1459,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 === gt))
+        ([n]) => !this.RESERVED_PROPERTY_KEYS.has(n) && !(r.insideItems && (n === ce || n === mt))
       )
     );
   }
   static throwInvalidStorageShape(e, t) {
     const r = this.toPointer(e);
     throw new he(
-      _.INVALID_STORAGE_SHAPE,
+      j.INVALID_STORAGE_SHAPE,
       `${t} at ${r}`,
       [
         {
-          code: _.INVALID_STORAGE_SHAPE,
+          code: j.INVALID_STORAGE_SHAPE,
           message: t,
           locationPath: e
         }
@@ -1481,15 +1481,15 @@ class X {
     return e.length === 0 ? "/" : `/${e.map((t) => t.replace(/~/g, "~0").replace(/\//g, "~1")).join("/")}`;
   }
 }
-class Cn {
+class On {
   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 Jr.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 B {
+class T {
   /**
    * Converts a BlueNode to a JSON representation based on the specified strategy.
    *
@@ -1504,7 +1504,7 @@ class B {
     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((F) => B.get(F, r));
+    const o = e.getItems()?.map((x) => T.get(x, r));
     if (o !== void 0 && r === "simple")
       return o;
     const l = e.getName(), a = e.getDescription();
@@ -1518,26 +1518,26 @@ class B {
     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 F = this.inferTypeBlueId(s);
-      F !== null && (c[z] = { [V]: F });
-    } else d !== void 0 && (c[z] = B.get(d, r));
+      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] = B.get(h, r));
+    h !== void 0 && (c[we] = T.get(h, r));
     const f = e.getKeyType();
-    f !== void 0 && (c[Se] = B.get(f, r));
+    f !== void 0 && (c[Se] = T.get(f, r));
     const g = e.getValueType();
-    g !== void 0 && (c[be] = B.get(g, r)), n !== void 0 && (c[W] = n), o !== void 0 && (c[Y] = o);
+    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);
-    const x = e.getBlue();
-    x !== void 0 && (c[Le] = x);
-    const w = e.getProperties();
-    return w !== void 0 && Object.entries(w).forEach(([F, P]) => {
-      c[F] = B.get(P, r);
+    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);
     }), c;
   }
   static handleValue(e) {
-    if (R(e)) {
+    if (C(e)) {
       if (oe(e)) {
         const t = new G(Number.MIN_SAFE_INTEGER.toString()), r = new G(Number.MAX_SAFE_INTEGER.toString());
         if (e.lt(t) || e.gt(r))
@@ -1548,7 +1548,7 @@ class B {
     return e;
   }
   static inferTypeBlueId(e) {
-    return typeof e == "string" ? Q : R(e) ? oe(e) ? te : ee : typeof e == "boolean" ? re : null;
+    return typeof e == "string" ? Q : C(e) ? oe(e) ? te : ee : typeof e == "boolean" ? re : null;
   }
   static normalizeOptions(e) {
     return typeof e == "string" ? {
@@ -1558,7 +1558,7 @@ class B {
     };
   }
 }
-class M {
+class L {
   /**
    * Transforms a node and all its child nodes using the provided transformer function
    * @param node - The node to transform
@@ -1567,30 +1567,30 @@ class M {
    */
   static transform(e, t) {
     const r = t(e.clone()), s = r.getType();
-    s !== void 0 && r.setType(M.transform(s, t));
+    s !== void 0 && r.setType(L.transform(s, t));
     const n = r.getItemType();
     n !== void 0 && r.setItemType(
-      M.transform(n, t)
+      L.transform(n, t)
     );
     const o = r.getKeyType();
     o !== void 0 && r.setKeyType(
-      M.transform(o, t)
+      L.transform(o, t)
     );
     const l = r.getValueType();
     l !== void 0 && r.setValueType(
-      M.transform(l, t)
+      L.transform(l, t)
     );
     const a = r.getItems();
     if (a !== void 0) {
       const d = a.map(
-        (h) => M.transform(h, t)
+        (h) => L.transform(h, t)
       );
       r.setItems(d);
     }
     const c = r.getProperties();
     if (c !== void 0) {
       const d = Object.keys(c).reduce(
-        (h, f) => (h[f] = M.transform(c[f], t), h),
+        (h, f) => (h[f] = L.transform(c[f], t), h),
         {}
       );
       r.setProperties(d);
@@ -1598,12 +1598,12 @@ class M {
     return r;
   }
 }
-const le = (i) => !!i && typeof i == "object" && !Array.isArray(i) && !(i instanceof u), q = (i) => i instanceof A || i instanceof D, fs = (i) => i.replace(/~1/g, "/").replace(/~0/g, "~");
+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) {
   if (i === "/") return [];
   if (!i.startsWith("/"))
     throw new Error(`Path must start with '/': ${i}`);
-  return i.split("/").slice(1).map(fs);
+  return i.split("/").slice(1).map(ys);
 }
 function Pe(i) {
   if (i === "-") return -1;
@@ -1616,7 +1616,7 @@ function Pe(i) {
     );
   return e;
 }
-function fr(i, e, t, r = !0) {
+function yr(i, e, t, r = !0) {
   switch (e) {
     case "name":
       return t ? r ? i.getName() ?? null : i : i.getName();
@@ -1640,15 +1640,15 @@ function fr(i, e, t, r = !0) {
       return i.getItems();
     case "properties":
       return i.getProperties();
-    case K:
+    case z:
       return i.getContracts();
     default:
       return;
   }
 }
-function Ft(i, e, t = !0) {
+function Ut(i, e, t = !0) {
   if (i instanceof u) {
-    const r = fr(
+    const r = yr(
       i,
       e,
       !0,
@@ -1666,7 +1666,7 @@ function Ft(i, e, t = !0) {
       "blue",
       "items",
       "properties",
-      K
+      z
     ].includes(e))
       return r;
     if (/^-?\d+$/.test(e) && e !== "-") {
@@ -1692,14 +1692,14 @@ function Ne(i, e) {
     };
   let t = i;
   for (let s = 0; s < e.length - 1; ++s) {
-    const n = e[s], o = Ft(t, n);
+    const n = e[s], o = Ut(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 = Ft(t, r, !1);
+    const s = Ut(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,
@@ -1712,9 +1712,9 @@ function Ne(i, e) {
     key: Array.isArray(t) ? Pe(r) : r
   };
 }
-function Vt(i, e) {
+function Ot(i, e) {
   if (i instanceof u) {
-    const t = e, r = fr(i, t, !1);
+    const t = e, r = yr(i, t, !1);
     if (r !== void 0 || [
       "name",
       "description",
@@ -1727,7 +1727,7 @@ function Vt(i, e) {
       "blue",
       "items",
       "properties",
-      K
+      z
     ].includes(t))
       return r;
     if (typeof e == "number" || typeof e == "string" && /^\d+$/.test(e)) {
@@ -1738,23 +1738,23 @@ function Vt(i, e) {
   }
   return Array.isArray(i) || le(i) ? i[e] : i;
 }
-function L(i) {
+function _(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 = It(i);
+  const e = vt(i);
   return m.deserialize(e);
 }
-function It(i) {
+function vt(i) {
   if (i === void 0) return null;
   if (i === null || typeof i != "object") return i;
-  if (Array.isArray(i)) return i.map(It);
+  if (Array.isArray(i)) return i.map(vt);
   const e = {};
   for (const [t, r] of Object.entries(i))
-    e[t] = It(r);
+    e[t] = vt(r);
   return e;
 }
-function Ot(i, e, t) {
+function Mt(i, e, t) {
   if (i instanceof u) {
     const r = e;
     switch (r) {
@@ -1766,22 +1766,22 @@ function Ot(i, e, t) {
         return;
       case "type":
         i.setType(
-          t instanceof u || typeof t == "string" || t === void 0 ? t : L(t)
+          t instanceof u || typeof t == "string" || t === void 0 ? t : _(t)
         );
         return;
       case "itemType":
         i.setItemType(
-          t instanceof u || typeof t == "string" || t === void 0 ? t : L(t)
+          t instanceof u || typeof t == "string" || t === void 0 ? t : _(t)
         );
         return;
       case "keyType":
         i.setKeyType(
-          t instanceof u || typeof t == "string" || t === void 0 ? t : L(t)
+          t instanceof u || typeof t == "string" || t === void 0 ? t : _(t)
         );
         return;
       case "valueType":
         i.setValueType(
-          t instanceof u || typeof t == "string" || t === void 0 ? t : L(t)
+          t instanceof u || typeof t == "string" || t === void 0 ? t : _(t)
         );
         return;
       case "value": {
@@ -1794,7 +1794,7 @@ function Ot(i, e, t) {
         return;
       case "blue":
         i.setBlue(
-          t instanceof u || t === void 0 ? t : L(t)
+          t instanceof u || t === void 0 ? t : _(t)
         );
         return;
       case "items":
@@ -1803,7 +1803,7 @@ function Ot(i, e, t) {
       case "properties":
         i.setProperties(t);
         return;
-      case K:
+      case z:
         i.setContracts(t);
         return;
       default: {
@@ -1811,14 +1811,14 @@ function Ot(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 : L(t));
+          i.getProperties() || i.setProperties({}), i.addProperty(r, t instanceof u ? t : _(t));
         return;
       }
     }
   }
   Array.isArray(i) ? i.splice(Pe(e), 1) : le(i) && (t === void 0 ? delete i[e] : i[e] = t);
 }
-function ys(i, e, t, r) {
+function gs(i, e, t, r) {
   let s = -1;
   if (e !== "-" && (s = typeof e == "number" ? e : parseInt(e, 10), isNaN(s)))
     throw new Error(
@@ -1844,7 +1844,7 @@ function ys(i, e, t, r) {
   } else
     n.splice(s, 0, t);
 }
-function Ze(i, e, t, r) {
+function Xe(i, e, t, r) {
   if (Array.isArray(i)) {
     const s = e === "-" ? i.length : Pe(e);
     if (!r && s > i.length)
@@ -1853,7 +1853,7 @@ function Ze(i, e, t, r) {
       );
     if (s < 0 && e !== "-")
       throw new Error(`Invalid negative array index: ${e}`);
-    const n = L(t);
+    const n = _(t);
     if (r) {
       if (s >= 0 && s < i.length) i[s] = n;
       else if (s >= i.length) {
@@ -1866,16 +1866,16 @@ function Ze(i, e, t, r) {
     return;
   }
   if (i instanceof u) {
-    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? ys(i, e, L(t), r) : Ot(i, e, t);
+    e === "-" || typeof e == "number" && !isNaN(e) || typeof e == "string" && /^\d+$/.test(e) ? gs(i, e, _(t), r) : Mt(i, e, t);
     return;
   }
   if (le(i)) {
-    i[e] = L(t);
+    i[e] = _(t);
     return;
   }
   throw new Error(`Cannot insert into parent of type ${typeof i}`);
 }
-function gs(i, e) {
+function ms(i, e) {
   if (Array.isArray(i)) {
     const t = Pe(e);
     t === -1 && e === "-" ? i.length > 0 && i.pop() : t >= 0 && t < i.length && i.splice(t, 1);
@@ -1890,17 +1890,17 @@ function gs(i, e) {
         return;
       }
     }
-    Ot(i, e, void 0);
+    Mt(i, e, void 0);
   } else le(i) && delete i[e];
 }
-function vt(i) {
+function Tt(i) {
   if (i instanceof u) return i.clone();
   if (Array.isArray(i))
-    return i.map((t) => vt(t));
+    return i.map((t) => Tt(t));
   if (le(i)) {
     const e = {};
     return Object.keys(i).forEach((t) => {
-      e[t] = vt(i[t]);
+      e[t] = Tt(i[t]);
     }), e;
   }
   return i;
@@ -1918,76 +1918,76 @@ function ue(i, e) {
   }
   return !1;
 }
-function yr(i, e) {
+function gr(i, e) {
   const { parent: t, key: r } = Ne(i, Ee(e));
-  return Vt(t, r);
+  return Ot(t, r);
 }
-function gr(i, e, t) {
+function mr(i, e, t) {
   const r = Ee(e);
   if (r.length === 0 && e === "/") {
-    const o = L(t);
+    const o = _(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);
-  Ze(s, n, t, !0);
+  Xe(s, n, t, !0);
 }
-function ms(i, e, t) {
+function Is(i, e, t) {
   const r = Ee(e);
   if (r.length === 0 && e === "/") {
     if (i.getItems() && Array.isArray(t)) {
-      const o = L(t);
+      const o = _(t);
       o.getItems() ? (i.setItems(o.getItems()), i.setValue(null)) : (i.setValue(o.getValue() ?? null), i.setItems(void 0));
     } else {
-      const o = L(t);
+      const o = _(t);
       i.setValue(o.getValue() ?? null), o.getItems() && i.setItems(o.getItems());
     }
     return !0;
   }
   const { parent: s, key: n } = Ne(i, r);
-  return Ze(s, n, t, !1), !0;
+  return Xe(s, n, t, !1), !0;
 }
-function Is(i, e, t) {
+function vs(i, e, t) {
   const r = Ee(e);
   if (r.length === 0 && e === "/") {
-    const l = L(t);
+    const l = _(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);
   if (o !== void 0 && s instanceof u)
-    Ot(s, n, t);
+    Mt(s, n, t);
   else {
-    const l = Vt(s, n), a = Array.isArray(s) || s instanceof u && s.getItems() && (typeof n == "number" || typeof n == "string" && /^\d+$/.test(n));
+    const l = Ot(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}'.`
         );
-      Ze(s, n, t, !0);
+      Xe(s, n, t, !0);
     } else
-      Ze(s, n, t, !0);
+      Xe(s, n, t, !0);
   }
   return !0;
 }
-function mr(i, e) {
+function Ir(i, e) {
   const t = Ee(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 gs(r, s), !0;
-}
-function vs(i, e, t) {
-  const r = vt(yr(i, e));
-  return gr(i, t, r), !0;
+  return ms(r, s), !0;
 }
 function Ts(i, e, t) {
-  const r = Ee(e), { parent: s, key: n } = Ne(i, r), o = Vt(s, n);
+  const r = Tt(gr(i, e));
+  return mr(i, t, r), !0;
+}
+function Bs(i, e, t) {
+  const r = Ee(e), { parent: s, key: n } = Ne(i, r), o = Ot(s, n);
   if (o === void 0)
     throw new Error(`MOVE failed: 'from' location '${e}' does not exist.`);
-  return mr(i, e) ? (gr(i, t, o), !0) : !1;
+  return Ir(i, e) ? (mr(i, t, o), !0) : !1;
 }
-function Bs(i, e, t) {
-  const r = yr(i, e);
+function Ps(i, e, t) {
+  const r = gr(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 +1998,9 @@ function Bs(i, e, t) {
           )}, got ${JSON.stringify(r.getValue() ?? null)}`
         );
       return !0;
-    } else typeof t == "object" && !(t instanceof u) && (s = L(t));
+    } else typeof t == "object" && !(t instanceof u) && (s = _(t));
   else if (q(r) && typeof t == "number")
-    r instanceof A ? s = new A(t.toString()) : r instanceof D && (s = new D(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 +2013,91 @@ function Bs(i, e, t) {
   }
   return !0;
 }
-function Ps(i, e) {
+function ws(i, e) {
   switch (e.op) {
     case "add":
-      return ms(i, e.path, e.val);
-    case "replace":
       return Is(i, e.path, e.val);
+    case "replace":
+      return vs(i, e.path, e.val);
     case "remove":
-      return mr(i, e.path);
+      return Ir(i, e.path);
     case "copy":
-      return vs(i, e.from, e.path);
-    case "move":
       return Ts(i, e.from, e.path);
+    case "move":
+      return Bs(i, e.from, e.path);
     case "test":
-      return Bs(i, e.path, e.val);
+      return Ps(i, e.path, e.val);
   }
 }
-function Rn(i, e, t = !1) {
+function Mn(i, e, t = !1) {
   const r = t ? i : i.clone();
-  return Ps(r, e), r;
+  return ws(r, e), r;
 }
-const ut = Symbol.for("zod-schema-annotations");
-function ws() {
+const dt = Symbol.for("zod-schema-annotations");
+function Ss() {
   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 Ir() {
-  const i = ws();
-  return ut in i || (i[ut] = /* @__PURE__ */ new WeakMap()), i[ut];
+function vr() {
+  const i = Ss();
+  return dt in i || (i[dt] = /* @__PURE__ */ new WeakMap()), i[dt];
 }
 function $e(i, e) {
-  const t = Ir(), r = t.get(i) || {};
+  const t = vr(), r = t.get(i) || {};
   return t.set(i, { ...r, ...e }), i;
 }
-const Z = (i) => Ir().get(i), Ss = (i) => (e) => {
+const Z = (i) => vr().get(i), bs = (i) => (e) => {
   const t = Z(e);
   return $e(e, {
     ...t,
     blueDescription: i
   });
-}, bs = (i) => {
+}, Es = (i) => {
   const e = Z(i);
-  return p(e) && wt(e.blueDescription) ? e.blueDescription : null;
-}, An = (i) => Ss(i)(y.string().optional()), Es = y.union([y.string(), y.boolean()]), Ns = (i) => (e) => {
+  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) => {
   const t = Z(e);
   return $e(e, {
     ...t,
     blueId: i
   });
-}, Cs = (i) => {
-  const e = Z(i), t = Es.safeParse(e?.blueId);
+}, Rs = (i) => {
+  const e = Z(i), t = Ns.safeParse(e?.blueId);
   return t.success ? t.data : null;
-}, Vn = (i) => Ns(i ?? !0)(y.string()), Rs = (i) => (e) => {
+}, xn = (i) => Cs(i ?? !0)(y.string()), As = (i) => (e) => {
   const t = Z(e);
   return $e(e, {
     ...t,
     blueName: i
   });
-}, As = (i) => {
+}, Vs = (i) => {
   const e = Z(i);
-  return p(e) && wt(e.blueName) ? e.blueName : null;
-}, On = (i) => {
+  return p(e) && St(e.blueName) ? e.blueName : null;
+}, Ln = (i) => {
   const e = y.string().optional();
-  return Rs(i)(e);
-}, Vs = () => (i) => {
+  return As(i)(e);
+}, Os = () => (i) => {
   const e = Z(i);
   return $e(i, {
     ...e,
     blueNode: !0
   });
-}, Os = (i) => {
+}, Ms = (i) => {
   const e = Z(i);
   return p(e) && p(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
-}, vr = (i) => !!Os(i), Mn = () => {
+}, Tr = (i) => !!Ms(i), $n = () => {
   const i = y.instanceof(u);
-  return Vs()(i);
-}, Ms = y.object({
+  return Os()(i);
+}, Ds = y.object({
   value: y.array(y.string()).optional(),
   defaultValue: y.string().optional()
-}), Ds = (i) => {
-  const e = Z(i), t = Ms.passthrough().safeParse(e?.typeBlueId);
+}), xs = (i) => {
+  const e = Z(i), t = Ds.passthrough().safeParse(e?.typeBlueId);
   return t.success ? t.data : null;
-}, xs = (i) => (e) => {
+}, Ls = (i) => (e) => {
   const t = Z(e), r = typeof i == "string" ? { value: [i] } : i;
   return $e(e, {
     ...t,
@@ -2109,7 +2109,7 @@ const Z = (i) => Ir().get(i), Ss = (i) => (e) => {
 };
 class Oe {
   static resolveBlueId(e) {
-    const t = Ds(e);
+    const t = xs(e);
     if (v(t))
       return null;
     const r = t.defaultValue;
@@ -2152,17 +2152,17 @@ class k {
     ) : !1;
   }
   static isWrapperType(e) {
-    return e instanceof Zt || e instanceof Xt || e instanceof qt || e instanceof Qt || e instanceof We || e instanceof Ge;
+    return e instanceof Xt || e instanceof qt || e instanceof Qt || e instanceof er || e instanceof Ge || e instanceof Je;
   }
   static unwrapSchema(e) {
-    return vr(e) ? e : k.isWrapperType(e) ? e instanceof We ? k.unwrapSchema(e.innerType()) : e instanceof Ge ? k.unwrapSchema(e.schema) : k.unwrapSchema(e.unwrap()) : 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;
   }
 }
-const Tr = Symbol("blue.subtypeCache");
-function Ls(i, e) {
-  return i[Tr] = e, i;
+const Br = Symbol("blue.subtypeCache");
+function $s(i, e) {
+  return i[Br] = e, i;
 }
-function Ut(i, e) {
+function zt(i, e) {
   const t = i.getType();
   if (t === void 0)
     return;
@@ -2171,7 +2171,7 @@ function Ut(i, e) {
     if (fe.includes(
       r
     )) {
-      const n = rt[r];
+      const n = st[r];
       return new u().setBlueId(r).setName(n);
     }
     const s = e.fetchByBlueId(r);
@@ -2185,11 +2185,11 @@ function Ut(i, e) {
   }
   return t;
 }
-function N(i, e, t) {
-  const r = Xe(i), s = Xe(e), n = t[Tr], o = `${r}|${s}`, l = n?.get(o);
+function E(i, e, t) {
+  const r = qe(i), s = qe(e), n = t[Br], o = `${r}|${s}`, l = n?.get(o);
   if (l !== void 0)
     return l;
-  const a = $s(
+  const a = _s(
     i,
     e,
     t,
@@ -2198,17 +2198,17 @@ function N(i, e, t) {
   );
   return n?.set(o, a), a;
 }
-function Xe(i) {
+function qe(i) {
   const e = i.getReferenceBlueId();
-  return e !== void 0 ? e : O.calculateBlueIdSync(
+  return e !== void 0 ? e : M.calculateBlueIdSync(
     se(i)
   );
 }
 function se(i) {
-  if (!Br(i))
+  if (!Pr(i))
     return i;
   const e = i.cloneShallow();
-  e.getReferenceBlueId() !== void 0 && !E.hasBlueIdOnly(e) && e.setReferenceBlueId(void 0);
+  e.getReferenceBlueId() !== void 0 && !b.hasBlueIdOnly(e) && e.setReferenceBlueId(void 0);
   const t = e.getType();
   t !== void 0 && e.setType(se(t));
   const r = e.getItemType();
@@ -2233,8 +2233,8 @@ function se(i) {
     )
   ), e;
 }
-function Br(i) {
-  return i.getReferenceBlueId() !== void 0 && !E.hasBlueIdOnly(i) ? !0 : [
+function Pr(i) {
+  return i.getReferenceBlueId() !== void 0 && !b.hasBlueIdOnly(i) ? !0 : [
     i.getType(),
     i.getItemType(),
     i.getKeyType(),
@@ -2243,10 +2243,10 @@ function Br(i) {
     ...i.getItems() ?? [],
     ...Object.values(i.getProperties() ?? {})
   ].some(
-    (t) => t !== void 0 && Br(t)
+    (t) => t !== void 0 && Pr(t)
   );
 }
-function $s(i, e, t, r, s) {
+function _s(i, e, t, r, s) {
   if (r === s)
     return !0;
   if (r && fe.includes(
@@ -2254,9 +2254,9 @@ function $s(i, e, t, r, s) {
   )) {
     let a = e;
     for (; a !== void 0; ) {
-      if (Xe(a) === r)
+      if (qe(a) === r)
         return !0;
-      a = Ut(a, t);
+      a = zt(a, t);
     }
     return !1;
   }
@@ -2268,59 +2268,59 @@ function $s(i, e, t, r, s) {
   }
   let l = n;
   for (; l !== void 0; ) {
-    if (Xe(l) === s)
+    if (qe(l) === s)
       return !0;
-    l = Ut(l, t);
+    l = zt(l, t);
   }
   return !1;
 }
-function _s(i, e) {
-  return Rt.some((t) => {
+function js(i, e) {
+  return At.some((t) => {
     const r = new u().setBlueId(t);
-    return N(i, r, e);
+    return E(i, r, e);
   });
 }
-function js(i, e) {
+function Fs(i, e) {
   const t = new u().setBlueId(Q);
-  return N(i, t, e);
+  return E(i, t, e);
 }
-function Fs(i, e) {
+function Us(i, e) {
   const t = new u().setBlueId(te);
-  return N(i, t, e);
+  return E(i, t, e);
 }
-function Us(i, e) {
+function zs(i, e) {
   const t = new u().setBlueId(ee);
-  return N(i, t, e);
+  return E(i, t, e);
 }
 function Ks(i, e) {
   const t = new u().setBlueId(re);
-  return N(i, t, e);
-}
-function ze(i, e) {
-  const t = new u().setBlueId(tt);
-  return N(i, t, e);
+  return E(i, t, e);
 }
 function ke(i, e) {
-  const t = new u().setBlueId(Ct);
-  return N(i, t, e);
+  const t = new u().setBlueId(rt);
+  return E(i, t, e);
 }
-function zs(i, e) {
-  return et.some((t) => {
+function He(i, e) {
+  const t = new u().setBlueId(Rt);
+  return E(i, t, e);
+}
+function ks(i, e) {
+  return tt.some((t) => {
     const r = new u().setName(t);
-    return N(i, r, e);
+    return E(i, r, e);
   });
 }
-function ks(i, e) {
-  for (const t of et) {
+function Hs(i, e) {
+  for (const t of tt) {
     const r = new u().setName(t);
-    if (N(i, r, e))
+    if (E(i, r, e))
       return t;
   }
   throw new Error(
     `Cannot determine the basic type for node of type "${i.getName() || "unknown"}".`
   );
 }
-class Hs {
+class Ys {
   blueIdMap = /* @__PURE__ */ new Map();
   nodeProvider;
   constructor(e = [], t) {
@@ -2356,7 +2356,7 @@ class Hs {
     if (p(this.nodeProvider))
       try {
         const n = new u().setBlueId(r), o = new u().setBlueId(s);
-        if (N(n, o, this.nodeProvider))
+        if (E(n, o, this.nodeProvider))
           return !0;
       } catch {
       }
@@ -2375,17 +2375,17 @@ class Hs {
   }
   getEffectiveBlueId(e) {
     const t = e.getType();
-    return p(t) && p(t.getBlueId()) ? t.getBlueId() : p(t) ? O.calculateBlueIdSync(t) : null;
+    return p(t) && p(t.getBlueId()) ? t.getBlueId() : p(t) ? M.calculateBlueIdSync(t) : null;
   }
   getBlueIdMap() {
     return new Map(this.blueIdMap);
   }
 }
-class Mt {
+class Dt {
 }
 class Re {
   static convert(e) {
-    const t = new Tt();
+    const t = new Bt();
     return Re.traverseNode(e, "", t), t.build();
   }
   static traverseNode(e, t, r) {
@@ -2412,7 +2412,7 @@ function Kt(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 it extends Mt {
+class nt extends Dt {
   allowedPaths;
   maxDepth;
   currentPath = [];
@@ -2505,7 +2505,7 @@ class it extends Mt {
    * @returns The path limits
    */
   static withMaxDepth(e) {
-    const t = new Tt().setMaxDepth(e);
+    const t = new Bt().setMaxDepth(e);
     for (let r = 1; r <= e; r++) {
       const s = "/" + Array(r).fill("*").join("/");
       t.addPath(s);
@@ -2518,7 +2518,7 @@ class it extends Mt {
    * @returns The path limits
    */
   static withSinglePath(e) {
-    return new Tt().addPath(e).build();
+    return new Bt().addPath(e).build();
   }
   /**
    * Creates path limits by analyzing the structure of a node.
@@ -2528,7 +2528,7 @@ class it extends Mt {
     return Re.convert(e);
   }
 }
-class Tt {
+class Bt {
   allowedPaths = /* @__PURE__ */ new Set();
   maxDepth = Number.MAX_SAFE_INTEGER;
   /**
@@ -2552,10 +2552,10 @@ class Tt {
    * @returns The built PathLimits
    */
   build() {
-    return new it(this.allowedPaths, this.maxDepth);
+    return new nt(this.allowedPaths, this.maxDepth);
   }
 }
-class H extends Mt {
+class H extends Dt {
   /**
    * Determines if a path segment should be extended - always returns true
    * @returns Always true
@@ -2581,7 +2581,7 @@ class H extends Mt {
   exitPathSegment() {
   }
 }
-class nt extends Mt {
+class ot extends Dt {
   limits;
   /**
    * Creates a composite limits with the specified limit strategies
@@ -2638,10 +2638,10 @@ class nt extends Mt {
    * @returns A new CompositeLimits instance
    */
   static of(...e) {
-    return new nt(e);
+    return new ot(e);
   }
 }
-const j = new H();
+const F = new H();
 class J extends u {
   completeness;
   sourceSemanticBlueId;
@@ -2675,7 +2675,7 @@ class J extends u {
         "Cannot minimize a path-limited resolved node without a source semantic BlueId."
       );
     }
-    return new mt().minimizeResolved(this);
+    return new It().minimizeResolved(this);
   }
   /**
    * @deprecated Prefer `blue.calculateBlueIdSync(resolved)` so callers use the
@@ -2689,8 +2689,8 @@ class J extends u {
         "Cannot calculate minimal BlueId for a path-limited resolved node without a source semantic BlueId."
       );
     }
-    const t = new mt().minimizeResolvedForHash(this);
-    return O.calculateBlueIdSync(t);
+    const t = new It().minimizeResolvedForHash(this);
+    return M.calculateBlueIdSync(t);
   }
   /**
    * Creates a clone of this ResolvedBlueNode
@@ -2741,13 +2741,20 @@ class J extends u {
     t !== void 0 && this.setValue(t);
   }
 }
-class Ys {
+class Ws {
   blue;
   constructor(e) {
     this.blue = e;
   }
-  matchesType(e, t, r = j) {
-    const s = it.fromNode(t), n = nt.of(r, s), o = this.extendAndResolve(e, n), l = this.blue.resolve(t, n), a = this.expandSchemaOwnedTypeReferences(t);
+  matchesType(e, t, r = F) {
+    const s = nt.fromNode(t), n = ot.of(r, s);
+    let o, l;
+    try {
+      o = this.extendAndResolve(e, n), l = this.blue.resolve(t, n);
+    } catch {
+      return !1;
+    }
+    const a = this.expandSchemaOwnedTypeReferences(t);
     return this.recursiveValueComparison(
       o,
       l,
@@ -2803,115 +2810,122 @@ class Ys {
     }
     return !0;
   }
-  recursiveValueComparison(e, t, r = t, s = j) {
-    const n = t.getType(), o = this.matchesImplicitStructure(e, n) || this.matchesImplicitCoreCollectionType(e, t);
-    if (e.getType() === void 0 && this.isCoreCollectionType(t) && !o)
+  recursiveValueComparison(e, t, r = t, s = F, n = {}) {
+    const o = t.getType(), l = this.matchesImplicitStructure(e, o) || this.matchesImplicitCoreCollectionType(e, t);
+    if (e.getType() === void 0 && this.isCoreCollectionType(t) && !l)
       return !1;
-    if (n && !o) {
+    if (o && !l) {
       const P = e.getType();
-      if (!P || !N(
+      if (!P || !E(
         P,
-        n,
+        o,
         this.blue.getNodeProvider()
       ))
         return !1;
     }
-    const l = t.getBlueId();
-    if (!o && l !== void 0)
+    const a = t.getBlueId();
+    if (!l && a !== void 0)
       if (this.isExplicitBlueIdMatcher(r)) {
-        if (e.getBlueId() !== l && !this.matchesCalculatedBlueId(e, l))
+        if (n.bareBlueIdMatcherMode === "type-reference") {
+          if (!this.matchesBareBlueIdTypeReference(e, t, a))
+            return !1;
+        } else if (!this.matchesBareBlueIdIdentity(e, a))
           return !1;
       } else {
-        const P = e.getBlueId(), S = e.getType();
-        if (S === void 0 && P !== void 0 && P !== l || S && !N(
-          S,
+        const P = e.getBlueId(), w = e.getType();
+        if (w === void 0 && P !== void 0 && P !== a || w && !E(
+          w,
           t,
           this.blue.getNodeProvider()
         ))
           return !1;
       }
-    const a = e.getBlueId();
-    if (!o && l === void 0 && a !== void 0 && e.getType() === void 0 && t.getItems() === void 0 && this.hasMatcherShape(t) && !this.matchesCalculatedBlueId(t, a))
+    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 c = t.getValue();
-    if (c !== void 0) {
+    const d = t.getValue();
+    if (d !== void 0) {
       const P = e.getValue();
       if (P === void 0)
         return !1;
-      if (R(P) && R(c)) {
-        if (!P.eq(c))
+      if (C(P) && C(d)) {
+        if (!P.eq(d))
           return !1;
-      } else if (P !== c)
+      } else if (P !== d)
         return !1;
     }
-    const d = t.getItems(), h = r.getItems();
-    if (d !== void 0) {
+    const h = t.getItems(), f = r.getItems();
+    if (h !== void 0) {
       const P = e.getItems() ?? [];
-      for (let S = 0; S < d.length; S++)
-        if (S < P.length) {
+      for (let w = 0; w < h.length; w++)
+        if (w < P.length) {
           if (!this.recursiveValueComparison(
-            P[S],
-            d[S],
-            h?.[S] ?? d[S],
+            P[w],
+            h[w],
+            f?.[w] ?? h[w],
             s
           ))
             return !1;
-        } else if (this.hasValueInNestedStructure(d[S]))
+        } else if (this.hasValueInNestedStructure(h[w]))
           return !1;
     }
-    const f = t.getItemType(), g = r.getItemType();
-    if (f !== void 0) {
+    const g = t.getItemType(), I = r.getItemType();
+    if (g !== void 0) {
       const P = e.getItems() ?? [];
-      for (const S of P)
+      for (const w of P)
         if (!this.recursiveValueComparison(
           this.resolveUntypedNodeAgainstMatcherType(
-            S,
-            f,
-            g ?? f,
-            s
+            w,
+            g,
+            I ?? g,
+            s,
+            "type-reference"
           ),
-          f,
-          g ?? f,
-          s
+          g,
+          I ?? g,
+          s,
+          { bareBlueIdMatcherMode: "type-reference" }
         ))
           return !1;
     }
-    const I = t.getProperties(), x = r.getProperties();
-    if (I !== void 0) {
+    const D = t.getProperties(), R = r.getProperties();
+    if (D !== void 0) {
       const P = e.getProperties() ?? {};
-      for (const [S, ot] of Object.entries(I))
-        if (S in P) {
+      for (const [w, lt] of Object.entries(D))
+        if (w in P) {
           if (!this.recursiveValueComparison(
-            P[S],
-            ot,
-            x?.[S] ?? ot,
+            P[w],
+            lt,
+            R?.[w] ?? lt,
             s
           ))
             return !1;
-        } else if (this.hasValueInNestedStructure(ot))
+        } else if (this.hasValueInNestedStructure(lt))
           return !1;
     }
-    const w = t.getValueType(), F = r.getValueType();
-    if (w !== void 0) {
+    const x = t.getValueType(), je = r.getValueType();
+    if (x !== void 0) {
       const P = Object.values(e.getProperties() ?? {});
-      for (const S of P)
+      for (const w of P)
         if (!this.recursiveValueComparison(
           this.resolveUntypedNodeAgainstMatcherType(
-            S,
             w,
-            F ?? w,
-            s
+            x,
+            je ?? x,
+            s,
+            "type-reference"
           ),
-          w,
-          F ?? w,
-          s
+          x,
+          je ?? x,
+          s,
+          { bareBlueIdMatcherMode: "type-reference" }
         ))
           return !1;
     }
     return !0;
   }
-  resolveUntypedNodeAgainstMatcherType(e, t, r, s) {
-    return e.getType() !== void 0 || this.isExplicitBlueIdMatcher(r) ? e : this.resolveAgainstTargetType(e, t, s) ?? e;
+  resolveUntypedNodeAgainstMatcherType(e, t, r, s, n = "identity") {
+    return e.getType() !== void 0 || e.getBlueId() !== void 0 || n === "identity" && this.isExplicitBlueIdMatcher(r) ? e : this.resolveAgainstTargetType(e, t, s) ?? e;
   }
   hasValueInNestedStructure(e) {
     if (e.getValue() !== void 0)
@@ -2946,6 +2960,17 @@ class Ys {
       }
     }
   }
+  matchesBareBlueIdIdentity(e, t) {
+    return e.getBlueId() === t || this.matchesCalculatedBlueId(e, t);
+  }
+  matchesBareBlueIdTypeReference(e, t, r) {
+    const s = e.getType();
+    return s ? E(
+      s,
+      t,
+      this.blue.getNodeProvider()
+    ) : e.getBlueId() !== void 0 ? this.matchesBareBlueIdIdentity(e, r) : !1;
+  }
   toPlainBlueNode(e) {
     const t = new u(e.getName());
     t.setDescription(e.getDescription()).setReferenceBlueId(e.getReferenceBlueId()).setInlineValue(e.isInlineValue());
@@ -2978,13 +3003,13 @@ class Ys {
    * shape of the requested core list or dictionary type.
    */
   matchesImplicitStructure(e, t) {
-    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;
+    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;
   }
   matchesImplicitCoreCollectionType(e, t) {
-    return e.getType() !== void 0 ? !1 : ze(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : ke(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
+    return e.getType() !== void 0 ? !1 : ke(t, this.blue.getNodeProvider()) ? this.isImplicitListStructure(e) : He(t, this.blue.getNodeProvider()) ? this.isImplicitDictionaryStructure(e) : !1;
   }
   isCoreCollectionType(e) {
-    return ze(e, this.blue.getNodeProvider()) || ke(e, this.blue.getNodeProvider());
+    return ke(e, this.blue.getNodeProvider()) || He(e, this.blue.getNodeProvider());
   }
   isImplicitListStructure(e) {
     return e.getItems() !== void 0 && e.getValue() === void 0;
@@ -3062,13 +3087,13 @@ class Ys {
     return r.add(t), r;
   }
 }
-class $ {
+class O {
   static ZERO_BLUE_ID = "0".repeat(44);
   static THIS_INDEX_REFERENCE_PATTERN = /^this#(\d+)$/;
   prepareDocument;
   calculateBlueId;
   constructor(e = {}) {
-    this.prepareDocument = e.prepareDocument ?? ((t) => t), this.calculateBlueId = e.calculateBlueId ?? O.calculateBlueIdSync;
+    this.prepareDocument = e.prepareDocument ?? ((t) => t), this.calculateBlueId = e.calculateBlueId ?? M.calculateBlueIdSync;
   }
   static hasThisReference(e) {
     return e.some((t) => this.nodeHasThisReference(t));
@@ -3085,7 +3110,7 @@ class $ {
       const c = this.prepareDocument(
         this.replaceIndexedThisReferences(
           l,
-          () => $.ZERO_BLUE_ID
+          () => O.ZERO_BLUE_ID
         )
       );
       return {
@@ -3143,7 +3168,7 @@ class $ {
         throw new Error(
           "Direct cyclic document sets must use indexed references such as 'this#0'; unindexed 'this' is not supported."
         );
-      if (r.startsWith("this#") && !$.THIS_INDEX_REFERENCE_PATTERN.test(
+      if (r.startsWith("this#") && !O.THIS_INDEX_REFERENCE_PATTERN.test(
         r
       ))
         throw new Error(
@@ -3179,14 +3204,14 @@ class $ {
   static nodeHasIndexedThisReference(e) {
     let t = !1;
     return this.visitNodeReferences(e, (r, s) => {
-      $.THIS_INDEX_REFERENCE_PATTERN.test(
+      O.THIS_INDEX_REFERENCE_PATTERN.test(
         s
       ) && (t = !0);
     }), t;
   }
   visitReferences(e, t) {
     e.forEach(
-      (r) => $.visitNodeReferences(r, t)
+      (r) => O.visitNodeReferences(r, t)
     );
   }
   static visitNodeReferences(e, t) {
@@ -3197,13 +3222,13 @@ class $ {
   }
   readIndexedThisReference(e) {
     const t = e.match(
-      $.THIS_INDEX_REFERENCE_PATTERN
+      O.THIS_INDEX_REFERENCE_PATTERN
     );
     if (t !== null)
       return Number(t[1]);
   }
   childrenOf(e) {
-    return $.childrenOf(e);
+    return O.childrenOf(e);
   }
   static childrenOf(e) {
     return [
@@ -3230,14 +3255,14 @@ class ye {
     return t && t.length > 0 ? t[0] : null;
   }
 }
-function Dt(i) {
+function xt(i) {
   return new class extends ye {
     fetchByBlueId(e) {
       return i(e);
     }
   }();
 }
-class Ws {
+class Gs {
   /**
    * Resolves a node without limits
    * Default implementation that uses NO_LIMITS
@@ -3246,10 +3271,10 @@ class Ws {
    * @returns The resolved node using NO_LIMITS
    */
   resolveWithoutLimits(e) {
-    return this.resolve(e, j);
+    return this.resolve(e, F);
   }
 }
-class Pr extends ye {
+class wr extends ye {
   nodeProviders;
   constructor(e) {
     super(), this.nodeProviders = e;
@@ -3276,33 +3301,33 @@ class Pr extends ye {
     return this.nodeProviders;
   }
 }
-const dt = pe.types.float.options, Gs = {
-  ...dt,
+const ht = pe.types.float.options, Js = {
+  ...ht,
   construct: (i) => {
     const e = i.replace(/_/g, "").toLowerCase();
-    if (!Jt(e))
-      return new D(e);
-    if (dt.construct)
-      return dt.construct(i);
+    if (!Zt(e))
+      return new $(e);
+    if (ht.construct)
+      return ht.construct(i);
   }
-}, Js = new pe.Type("tag:yaml.org,2002:float", Gs), ht = pe.types.int.options, Zs = {
-  ...ht,
+}, Zs = new pe.Type("tag:yaml.org,2002:float", Js), pt = pe.types.int.options, Xs = {
+  ...pt,
   construct: (i) => {
     let e = i;
-    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !Jt(e))
+    if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !Zt(e))
       return new A(e);
-    if (ht.construct)
-      return ht.construct(i);
+    if (pt.construct)
+      return pt.construct(i);
   }
-}, Xs = new pe.Type("tag:yaml.org,2002:int", Zs), wr = pe.CORE_SCHEMA.extend({
-  implicit: [Js, Xs]
+}, qs = new pe.Type("tag:yaml.org,2002:int", Xs), Sr = pe.CORE_SCHEMA.extend({
+  implicit: [Zs, qs]
 }), ae = (i) => {
-  const e = pe.load(i, { schema: wr });
+  const e = pe.load(i, { schema: Sr });
   return e === void 0 ? void 0 : e;
-}, qs = (i) => pe.dump(i, {
-  schema: wr,
+}, Qs = (i) => pe.dump(i, {
+  schema: Sr,
   replacer: (e, t) => {
-    if (R(t)) {
+    if (C(t)) {
       if (oe(t)) {
         const r = new G(Number.MIN_SAFE_INTEGER.toString()), s = new G(Number.MAX_SAFE_INTEGER.toString());
         if (t.lt(r) || t.gt(s))
@@ -3312,7 +3337,7 @@ const dt = pe.types.float.options, Gs = {
     }
     return t;
   }
-}), Sr = `- type:
+}), br = `- type:
     blueId: 27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo
   mappings:
     Text: DLRQwz7MQeCrzjy9bohPNwtCxKEBbKaMK65KBrwjfG6K
@@ -3323,20 +3348,20 @@ const dt = pe.types.float.options, Gs = {
     Dictionary: G7fBT9PSod1RfHLHkpafAGBDVAJMrMhAMY51ERcyXNrj
 - type:
     blueId: FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4
-`, Qs = `name: Transformation
-description: TODO`, ei = `name: Infer Basic Types For Untyped Values
+`, ei = `name: Transformation
+description: TODO`, ti = `name: Infer Basic Types For Untyped Values
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation infers type details for Text, Integer, Number and Boolean.`, ti = `name: Replace Inline Types with BlueIds
+description: This transformation infers type details for Text, Integer, Number and Boolean.`, ri = `name: Replace Inline Types with BlueIds
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
-description: This transformation replaces`, ri = [
-  Sr,
-  Qs,
+description: This transformation replaces`, si = [
+  br,
   ei,
-  ti
+  ti,
+  ri
 ];
-class si extends ye {
+class ii extends ye {
   blueIdToNodesMap = /* @__PURE__ */ new Map();
   constructor() {
     super(), this.load();
@@ -3345,7 +3370,7 @@ class si extends ye {
     return this.blueIdToNodesMap.get(e) || [];
   }
   load() {
-    for (const e of ri) {
+    for (const e of si) {
       const t = ae(e);
       if (t === void 0) {
         console.error(`This content file is not valid YAML: ${e}`);
@@ -3354,20 +3379,20 @@ class si extends ye {
       if (Array.isArray(t)) {
         const r = t.map(
           (n) => m.deserialize(n)
-        ), s = O.calculateBlueIdSync(r);
+        ), s = M.calculateBlueIdSync(r);
         this.blueIdToNodesMap.set(s, r);
       } else {
-        const r = m.deserialize(t), s = O.calculateBlueIdSync(r);
+        const r = m.deserialize(t), s = M.calculateBlueIdSync(r);
         this.blueIdToNodesMap.set(s, [r]);
       }
     }
   }
 }
-class xt extends ye {
-  static INSTANCE = new xt();
+class Lt extends ye {
+  static INSTANCE = new Lt();
   nodeProvider;
   constructor() {
-    super(), this.nodeProvider = new si();
+    super(), this.nodeProvider = new ii();
   }
   fetchByBlueId(e) {
     return this.nodeProvider.fetchByBlueId(e);
@@ -3380,11 +3405,11 @@ class Me {
    * @returns A wrapped NodeProvider that includes bootstrap providers
    */
   static wrap(e) {
-    const t = [xt.INSTANCE];
-    return t.push(e), new Pr(t);
+    const t = [Lt.INSTANCE];
+    return t.push(e), new wr(t);
   }
 }
-class Lt {
+class $t {
   nodeProvider;
   strategy;
   /**
@@ -3411,7 +3436,7 @@ class Lt {
     }
     try {
       const n = e.getBlueId();
-      if (n && E.hasBlueIdOnly(e) && !fe.includes(
+      if (n && b.hasBlueIdOnly(e) && !fe.includes(
         n
       )) {
         const f = this.fetchNode(e);
@@ -3424,8 +3449,8 @@ class Lt {
             const I = f[0];
             this.mergeNodes(e, I, g);
           } else {
-            const I = f.map((w) => w.clone()), x = new u().setItems(I);
-            this.mergeNodes(e, x, g);
+            const I = f.map((R) => R.clone()), D = new u().setItems(I);
+            this.mergeNodes(e, D, g);
           }
         }
       }
@@ -3482,7 +3507,7 @@ class Lt {
     ), e.setBlue(t.getBlue()?.clone());
   }
 }
-class de extends Ws {
+class de extends Gs {
   mergingProcessor;
   nodeProvider;
   /**
@@ -3554,7 +3579,7 @@ class de extends Ws {
    */
   mergeChildren(e, t, r) {
     const s = t.getItems() ?? [];
-    return T.hasListControlItems(s) ? this.mergeChildrenWithListControls(e, t, r) : this.mergeChildrenWithoutListControls(
+    return B.hasListControlItems(s) ? this.mergeChildrenWithListControls(e, t, r) : this.mergeChildrenWithoutListControls(
       e,
       s,
       r
@@ -3616,11 +3641,11 @@ class de extends Ws {
     return e.cloneShallow().setItems(n);
   }
   mergeChildrenWithListControls(e, t, r) {
-    const s = t.getItems() ?? [], n = e.getItems() ?? [], o = T.getMergePolicy(t, e), l = [...n];
+    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 && T.hasPreviousProperty(d)) {
-      if (T.getPreviousBlueId(d) === void 0)
+    if (d !== void 0 && B.hasPreviousProperty(d)) {
+      if (B.getPreviousBlueId(d) === void 0)
         throw new Error(
           "$previous list control must be exactly { $previous: { blueId: <id> } }."
         );
@@ -3629,11 +3654,11 @@ class de extends Ws {
     const h = c && n.length === 0 && !(r.limits instanceof H), f = /* @__PURE__ */ new Set();
     for (; a < s.length; a++) {
       const g = s[a];
-      if (T.hasPreviousProperty(g))
+      if (B.hasPreviousProperty(g))
         throw new Error(
           "$previous list control is allowed only as the first item."
         );
-      const I = T.readPosition(g);
+      const I = B.readPosition(g);
       if (I !== void 0) {
         if (o === "append-only")
           throw new Error("$pos is not allowed in append-only lists.");
@@ -3644,35 +3669,35 @@ class de extends Ws {
         if (f.has(I))
           throw new Error(`Duplicate $pos list overlay for index ${I}.`);
         f.add(I);
-        const w = T.withoutPosition(g);
-        if (!T.hasPayloadAfterRemovingPosition(g))
+        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), w))
+        if (!r.limits.shouldMergePathSegment(String(I), R))
           continue;
-        this.enterPathSegment(r, String(I), w);
+        this.enterPathSegment(r, String(I), R);
         try {
-          const F = l[I];
-          l[I] = F === void 0 || T.isReplacementPayload(w) ? this.materializeForCurrentContext(w, r) : this.mergeWithContext(F, w, r);
+          const x = l[I];
+          l[I] = x === void 0 || B.isReplacementPayload(R) ? this.materializeForCurrentContext(R, r) : this.mergeWithContext(x, R, r);
         } finally {
           this.exitPathSegment(r);
         }
         continue;
       }
-      const x = l.length;
-      if (!(!h && !r.limits.shouldMergePathSegment(String(x), g))) {
+      const D = l.length;
+      if (!(!h && !r.limits.shouldMergePathSegment(String(D), g))) {
         if (h) {
           l.push(
             this.materializeWithoutLimits(g, r)
           );
           continue;
         }
-        this.enterPathSegment(r, String(x), g);
+        this.enterPathSegment(r, String(D), g);
         try {
-          const w = this.materializeForCurrentContext(
+          const R = this.materializeForCurrentContext(
             g,
             r
           );
-          l.push(w);
+          l.push(R);
         } finally {
           this.exitPathSegment(r);
         }
@@ -3683,7 +3708,7 @@ class de extends Ws {
   materializeWithoutLimits(e, t) {
     return new de(this.mergingProcessor, t.nodeProvider).resolve(
       e,
-      j
+      F
     );
   }
   /**
@@ -3712,17 +3737,17 @@ class de extends Ws {
             c,
             s
           ) ? this.mergeExistingProperty(f, c, s) : (() => {
-            const w = this.materializeForCurrentContext(
+            const R = this.materializeForCurrentContext(
               c,
               s
             );
-            return f === void 0 ? w : this.mergeObject(
+            return f === void 0 ? R : this.mergeObject(
               f,
-              w,
+              R,
               s
             );
-          })(), x = h === void 0 ? I : this.projectListNodeToCurrentLimits(I, s);
-          x !== d && (l || (o = { ...n }, l = !0), o[a] = x);
+          })(), D = h === void 0 ? I : this.projectListNodeToCurrentLimits(I, s);
+          D !== d && (l || (o = { ...n }, l = !0), o[a] = D);
         } finally {
           this.exitPathSegment(s);
         }
@@ -3736,7 +3761,7 @@ class de extends Ws {
    * through mergeWithContext so source type overlays are resolved.
    */
   shouldMergePropertyWithoutPreResolve(e, t, r) {
-    return v(e) || r.limits instanceof H ? p(e) && T.hasListControlItems(t.getItems()) : p(t.getItems()) || p(e.getItems());
+    return v(e) || r.limits instanceof H ? p(e) && B.hasListControlItems(t.getItems()) : p(t.getItems()) || p(e.getItems());
   }
   mergeExistingProperty(e, t, r) {
     if (e === void 0)
@@ -3759,7 +3784,7 @@ class de extends Ws {
     });
   }
   createResolutionContext(e) {
-    const t = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), s = Ls(
+    const t = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), s = $s(
       this.createResolutionNodeProvider(this.nodeProvider, t),
       r
     );
@@ -3807,9 +3832,9 @@ class de extends Ws {
   }
   resolveAndExtendTypeNode(e, t) {
     const r = e.clone();
-    return p(r.getBlueId()) && new Lt(t.nodeProvider).extend(
+    return p(r.getBlueId()) && new $t(t.nodeProvider).extend(
       r,
-      it.withSinglePath("/")
+      nt.withSinglePath("/")
     ), this.resolveWithContext(r, t);
   }
   getTypeOverlay(e, t, r) {
@@ -3842,7 +3867,7 @@ class de extends Ws {
     return t.nodeHashCache.set(e, s), s;
   }
   getPathLimitedListControlTarget(e, t, r, s, n) {
-    if (!(e === void 0 || n.limits instanceof H || !T.hasListControlItems(s.getItems())))
+    if (!(e === void 0 || n.limits instanceof H || !B.hasListControlItems(s.getItems())))
       return this.resolveFullInheritedProperty(t, r, n);
   }
   resolveFullInheritedProperty(e, t, r) {
@@ -3852,9 +3877,9 @@ class de extends Ws {
     const n = s.getBlueId();
     if (p(n)) {
       const a = r.nodeProvider.fetchByBlueId(n)?.[0];
-      return a === void 0 ? void 0 : new de(this.mergingProcessor, r.nodeProvider).resolve(a, j).getProperties()?.[t]?.clone();
+      return a === void 0 ? void 0 : new de(this.mergingProcessor, r.nodeProvider).resolve(a, F).getProperties()?.[t]?.clone();
     }
-    return new de(this.mergingProcessor, r.nodeProvider).resolve(s, j).getProperties()?.[t]?.clone();
+    return new de(this.mergingProcessor, r.nodeProvider).resolve(s, F).getProperties()?.[t]?.clone();
   }
   projectListNodeToCurrentLimits(e, t) {
     const r = e.getItems();
@@ -3884,7 +3909,7 @@ class de extends Ws {
     e.pathStack.pop(), e.limits.exitPathSegment();
   }
 }
-class br {
+class Er {
   mergingProcessors;
   /**
    * Creates a new SequentialMergingProcessor with the given processors
@@ -3909,14 +3934,14 @@ class br {
     return this.mergingProcessors.reduce((s, n) => n.postProcess ? n.postProcess(s, t, r) : s, e);
   }
 }
-class Er {
+class Nr {
   process(e, t) {
     const r = t.getValue();
     if (p(r)) {
       const s = e.getValue();
       if (v(s))
         return e.cloneShallow().setValue(r);
-      if (!ii(r, s))
+      if (!ni(r, s))
         throw new Error(
           `Node values conflict. Source node value: ${r}, target node value: ${s}`
         );
@@ -3924,20 +3949,20 @@ class Er {
     return e;
   }
 }
-const ii = (i, e) => oe(i) && oe(e) || ft(i) && ft(e) ? i.eq(e) : i === e;
-class Nr {
+const ni = (i, e) => oe(i) && oe(e) || yt(i) && yt(e) ? i.eq(e) : i === e;
+class Cr {
   process(e, t, r) {
     const s = e.getType(), n = t.getType();
     let o = e;
     if (s === void 0)
       o = e.cloneShallow().setType(n);
     else if (n !== void 0) {
-      if (!N(
+      if (!E(
         n,
         s,
         r
       )) {
-        const a = B.get(n), c = B.get(s);
+        const a = T.get(n), c = T.get(s);
         throw new Error(
           `The source type '${JSON.stringify(
             a
@@ -3951,22 +3976,22 @@ class Nr {
     return o;
   }
 }
-class Cr {
+class Rr {
   process(e, t, r) {
     const s = t.getItemType(), n = t.getType();
-    if (s !== void 0 && n !== void 0 && !ze(n, r))
+    if (s !== void 0 && n !== void 0 && !ke(n, r))
       throw new Error("Source node with itemType must have a List type");
     const o = e.getItemType();
     let l = e;
     if (o === void 0)
       s !== void 0 && (l = e.cloneShallow().setItemType(s));
     else if (s !== void 0) {
-      if (!N(
+      if (!E(
         s,
         o,
         r
       )) {
-        const h = B.get(s), f = B.get(o);
+        const h = T.get(s), f = T.get(o);
         throw new Error(
           `The source item type '${JSON.stringify(
             h
@@ -3981,12 +4006,12 @@ class Cr {
     if (a !== void 0 && c !== void 0)
       for (const d of c) {
         const h = d.getType();
-        if (h !== void 0 && !N(
+        if (h !== void 0 && !E(
           h,
           a,
           r
         )) {
-          const f = B.get(h), g = B.get(
+          const f = T.get(h), g = T.get(
             a
           );
           throw new Error(
@@ -4001,10 +4026,10 @@ class Cr {
     return l;
   }
 }
-class Rr {
+class Ar {
   process(e, t, r) {
     const s = t.getKeyType(), n = t.getValueType(), o = t.getType();
-    if ((s !== void 0 || n !== void 0) && o !== void 0 && !ke(o, r))
+    if ((s !== void 0 || n !== void 0) && o !== void 0 && !He(o, r))
       throw new Error(
         "Source node with keyType or valueType must have a Dictionary type"
       );
@@ -4021,12 +4046,12 @@ class Rr {
       if (n !== void 0)
         return this.validateBasicKeyType(n, r), e.cloneShallow().setKeyType(n);
     } else if (n !== void 0) {
-      if (this.validateBasicKeyType(n, r), !N(
+      if (this.validateBasicKeyType(n, r), !E(
         n,
         s,
         r
       )) {
-        const l = B.get(n), a = B.get(s);
+        const l = T.get(n), a = T.get(s);
         throw new Error(
           `The source key type '${JSON.stringify(
             l
@@ -4045,12 +4070,12 @@ class Rr {
       if (n !== void 0)
         return e.cloneShallow().setValueType(n);
     } else if (n !== void 0) {
-      if (!N(
+      if (!E(
         n,
         s,
         r
       )) {
-        const l = B.get(n), a = B.get(s);
+        const l = T.get(n), a = T.get(s);
         throw new Error(
           `The source value type '${JSON.stringify(
             l
@@ -4064,16 +4089,16 @@ class Rr {
     return e;
   }
   validateBasicKeyType(e, t) {
-    if (!_s(e, t))
+    if (!js(e, t))
       throw new Error("Dictionary key type must be a basic type");
   }
   validateKeyType(e, t, r) {
-    if (!js(t, r))
-      if (Fs(t, r)) {
+    if (!Fs(t, r))
+      if (Us(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 (Us(t, r)) {
+      } else if (zs(t, r)) {
         const s = Number.parseFloat(e);
         if (Number.isNaN(s))
           throw new Error(`Key '${e}' is not a valid Number.`);
@@ -4087,8 +4112,8 @@ class Rr {
   }
   validateValueType(e, t, r) {
     const s = e.getType();
-    if (s !== void 0 && !N(s, t, r)) {
-      const n = B.get(s), o = B.get(t);
+    if (s !== void 0 && !E(s, t, r)) {
+      const n = T.get(s), o = T.get(t);
       throw new Error(
         `Value of type '${JSON.stringify(
           n
@@ -4099,16 +4124,16 @@ class Rr {
     }
   }
 }
-class Ar {
+class Vr {
   process(e) {
     return e;
   }
   postProcess(e, t, r) {
     const s = e.getType();
-    if (s !== void 0 && zs(s, r)) {
+    if (s !== void 0 && ks(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 = ks(
+        const l = Hs(
           s,
           r
         ), a = s.getName() || "unknown";
@@ -4120,7 +4145,7 @@ class Ar {
     return e;
   }
 }
-class Vr {
+class Or {
   process(e, t) {
     let r = e;
     const s = t.getName();
@@ -4129,37 +4154,37 @@ class Vr {
     return n !== void 0 && n !== r.getDescription() && (r = r.cloneShallow().setDescription(n)), r;
   }
 }
-const Dn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const _n = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BasicTypesVerifier: Ar,
-  DictionaryProcessor: Rr,
-  ListProcessor: Cr,
-  MetadataPropagator: Vr,
-  SequentialMergingProcessor: br,
-  TypeAssigner: Nr,
-  ValuePropagator: Er
+  BasicTypesVerifier: Vr,
+  DictionaryProcessor: Ar,
+  ListProcessor: Rr,
+  MetadataPropagator: Or,
+  SequentialMergingProcessor: Er,
+  TypeAssigner: Cr,
+  ValuePropagator: Nr
 }, Symbol.toStringTag, { value: "Module" }));
 function _e() {
-  return new br([
-    new Er(),
+  return new Er([
     new Nr(),
     new Cr(),
     new Rr(),
-    new Vr(),
-    new Ar()
+    new Ar(),
+    new Or(),
+    new Vr()
   ]);
 }
-class He {
+class Ye {
   nodeProvider;
   mergingProcessor;
-  minimizer = new mt();
+  minimizer = new It();
   cyclicSetIdentity;
   constructor(e = {}) {
-    this.nodeProvider = e.nodeProvider ?? Dt(() => []), this.mergingProcessor = e.mergingProcessor ?? _e(), this.cyclicSetIdentity = this.createCyclicSetIdentityService();
+    this.nodeProvider = e.nodeProvider ?? xt(() => []), this.mergingProcessor = e.mergingProcessor ?? _e(), this.cyclicSetIdentity = this.createCyclicSetIdentityService();
   }
   /** @internal */
   createCyclicSetIdentityService() {
-    return new $({
+    return new O({
       prepareDocument: (e) => this.prepareCyclicDocument(e),
       calculateBlueId: (e) => this.hashCyclicPrepared(e)
     });
@@ -4187,7 +4212,7 @@ class He {
         "Cannot minimize a path-limited resolved node without a source semantic BlueId."
       );
     }
-    return E.hasBlueIdOnly(e) ? e.clone() : e.isResolved() ? this.minimizeResolved(e) : this.minimizeAuthoring(e);
+    return b.hasBlueIdOnly(e) ? e.clone() : e.isResolved() ? this.minimizeResolved(e) : this.minimizeAuthoring(e);
   }
   minimizeResolved(e) {
     if (e instanceof J && e.getCompleteness() === "path-limited")
@@ -4202,7 +4227,7 @@ class He {
   minimizeAuthoringWithProvider(e, t) {
     const r = new de(this.mergingProcessor, t).resolve(
       e,
-      j
+      F
     );
     return this.minimizeResolved(r);
   }
@@ -4211,17 +4236,17 @@ class He {
     return this.hashMinimalTrustedWithProvider(e, this.nodeProvider);
   }
   hashMinimalTrustedWithProvider(e, t) {
-    return Array.isArray(e) ? (X.validateStorageListShape(e), O.calculateBlueIdSync(
+    return Array.isArray(e) ? (X.validateStorageListShape(e), M.calculateBlueIdSync(
       this.toHashableMinimalTrusted(e, t)
-    )) : (X.validateStorageShape(e), O.calculateBlueIdSync(
+    )) : (X.validateStorageShape(e), M.calculateBlueIdSync(
       this.toHashableMinimalTrusted(e, t)
     ));
   }
   /** @internal */
   hashMinimalTrustedAsync(e) {
-    return Array.isArray(e) ? (X.validateStorageListShape(e), O.calculateBlueId(
+    return Array.isArray(e) ? (X.validateStorageListShape(e), M.calculateBlueId(
       this.toHashableMinimalTrusted(e)
-    )) : (X.validateStorageShape(e), O.calculateBlueId(
+    )) : (X.validateStorageShape(e), M.calculateBlueId(
       this.toHashableMinimalTrusted(e)
     ));
   }
@@ -4231,11 +4256,11 @@ class He {
     ) : this.toHashableMinimalTrustedNode(e, t);
   }
   toHashableMinimalTrustedNode(e, t = this.nodeProvider) {
-    if (!T.hasPositionControl(e))
+    if (!B.hasPositionControl(e))
       return e;
     const r = new de(this.mergingProcessor, t).resolve(
       e,
-      j
+      F
     );
     return this.minimizer.minimizeResolvedForHash(r);
   }
@@ -4255,7 +4280,7 @@ class He {
     const e = this.nodeProvider;
     return new class extends ye {
       fetchByBlueId(t) {
-        return t === $.ZERO_BLUE_ID || $.isIndexedThisReference(t) ? [new u().setReferenceBlueId(t)] : e.fetchByBlueId(t);
+        return t === O.ZERO_BLUE_ID || O.isIndexedThisReference(t) ? [new u().setReferenceBlueId(t)] : e.fetchByBlueId(t);
       }
     }();
   }
@@ -4265,19 +4290,19 @@ class He {
   tryCalculateCyclicSetBlueId(e) {
     const t = this.getTopLevelSetItems(e);
     if (t === void 0) {
-      if (!Array.isArray(e) && $.hasThisReference([e]))
+      if (!Array.isArray(e) && O.hasThisReference([e]))
         throw new Error(
           "Direct cyclic references using 'this#k' are supported only in a top-level document set."
         );
       return;
     }
-    if ($.hasThisReference(t))
+    if (O.hasThisReference(t))
       return this.cyclicSetIdentity.calculate(t).blueId;
   }
   getTopLevelSetItems(e) {
     if (Array.isArray(e))
       return e;
-    if (E.hasItemsOnly(e))
+    if (b.hasItemsOnly(e))
       return e.getItems() ?? [];
   }
   toMinimalListIdentityInput(e) {
@@ -4286,12 +4311,12 @@ class He {
     return this.minimizeAuthoring(t).getItems() ?? [];
   }
 }
-class ni {
+class oi {
   semanticIdentity;
   cyclicSetIdentity;
   constructor(e = {}) {
-    const t = e.nodeProvider ?? Dt(() => []), r = e.mergingProcessor ?? _e();
-    this.semanticIdentity = new He({
+    const t = e.nodeProvider ?? xt(() => []), r = e.mergingProcessor ?? _e();
+    this.semanticIdentity = new Ye({
       nodeProvider: t,
       mergingProcessor: r
     }), this.cyclicSetIdentity = this.semanticIdentity.createCyclicSetIdentityService();
@@ -4310,7 +4335,7 @@ class ni {
     const r = e.map(
       (o) => this.preprocessForStorage(o, t)
     );
-    if ($.hasThisReference(r)) {
+    if (O.hasThisReference(r)) {
       const o = this.cyclicSetIdentity.calculate(r);
       return o.nodes.forEach(
         (l) => X.validateStorageShape(l)
@@ -4357,12 +4382,12 @@ class ni {
     );
   }
 }
-const oi = (i) => i instanceof Zt || i instanceof Xt || i instanceof qt || i instanceof Qt || i instanceof We || i instanceof Ge, li = (i) => i instanceof ge || i instanceof me || i instanceof Ue || i instanceof Ke;
-class Or {
+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 {
   static convertValue(e, t) {
     const r = e.getType()?.getBlueId(), s = e.getValue();
-    return v(s) ? li(t) && E.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : s : Q === r ? this.convertFromString(String(s), t) : ee === r || s instanceof D ? this.convertFromBigDecimal(
-      new D(s?.toString()),
+    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()),
       t
     ) : te === r || s instanceof A ? this.convertFromBigInteger(
       new A(s?.toString()),
@@ -4370,11 +4395,11 @@ class Or {
     ) : 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 jr || t instanceof Fr)
+    if (!t || t instanceof ge || t instanceof Fr || t instanceof Ur)
       return e;
     if (t instanceof me)
       return Number(e);
-    if (t instanceof Ue)
+    if (t instanceof ze)
       return e.toLowerCase() === "true";
     if (t instanceof Ke)
       return BigInt(e);
@@ -4397,7 +4422,7 @@ class Or {
     throw new Error(`Cannot convert Number to ${t._def.typeName}`);
   }
   static convertFromBoolean(e, t) {
-    if (!t || t instanceof Ue)
+    if (!t || t instanceof ze)
       return e;
     if (t instanceof ge)
       return e.toString();
@@ -4411,7 +4436,7 @@ class Or {
     if (!e) return null;
     if (e instanceof me)
       return 0;
-    if (e instanceof Ue)
+    if (e instanceof ze)
       return !1;
     if (e instanceof ge)
       return "";
@@ -4420,12 +4445,12 @@ class Or {
     );
   }
 }
-class ai {
+class ci {
   convert(e, t) {
-    return Or.convertValue(e, t);
+    return Mr.convertValue(e, t);
   }
 }
-class ci {
+class ui {
   constructor(e, t) {
     this.nodeToObjectConverter = e, this.calculateBlueId = t;
   }
@@ -4433,26 +4458,26 @@ class ci {
     return this.convertFields(e, t);
   }
   convertFields(e, t) {
-    if (t instanceof Ur) {
+    if (t instanceof zr) {
       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)
       throw new Error("Union not supported");
-    if (t instanceof zr)
+    if (t instanceof kr)
       return Object.keys(t.shape).reduce(
         (s, n) => {
-          const o = e.getProperties(), l = t.shape[n], a = Cs(l);
+          const o = e.getProperties(), l = t.shape[n], a = Rs(l);
           if (p(a)) {
-            const g = wt(a) ? a : n, I = o?.[g], x = I ? this.calculateBlueId(I) : void 0;
-            return s[n] = x, s;
+            const g = St(a) ? a : n, I = o?.[g], D = I ? this.calculateBlueId(I) : void 0;
+            return s[n] = D, s;
           }
-          const c = As(l);
+          const c = Vs(l);
           if (p(c)) {
             const g = o?.[c];
             return s[n] = g?.getName(), s;
           }
-          const d = bs(l);
+          const d = Es(l);
           if (p(d)) {
             const g = o?.[d];
             return s[n] = g?.getDescription(), s;
@@ -4479,7 +4504,7 @@ class ci {
     throw new Error("Unknown schema type, " + t._def.typeName);
   }
 }
-class ui {
+class di {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -4493,7 +4518,7 @@ class ui {
     );
   }
 }
-class di {
+class hi {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -4507,7 +4532,7 @@ class di {
     return new Set(n);
   }
 }
-class hi {
+class pi {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -4520,22 +4545,22 @@ class hi {
     return p(a) && Object.entries(a).forEach(([c, d]) => {
       const h = new u().setValue(c);
       h.setType(new u().setBlueId(Q));
-      const f = Or.convertValue(h, r), g = this.nodeToObjectConverter.convert(d, s);
+      const f = Mr.convertValue(h, r), g = this.nodeToObjectConverter.convert(d, s);
       n.set(f, g);
-    }), t instanceof kr ? Object.fromEntries(n) : n;
+    }), t instanceof Hr ? Object.fromEntries(n) : n;
   }
 }
-class pi {
+class fi {
   convert(e) {
-    return B.get(e);
+    return T.get(e);
   }
 }
-class fi {
+class yi {
   convert(e) {
-    return B.get(e);
+    return T.get(e);
   }
 }
-class yi {
+class gi {
   constructor(e) {
     this.nodeToObjectConverter = e;
   }
@@ -4549,7 +4574,7 @@ class yi {
     );
   }
 }
-const gi = y.union([
+const mi = y.union([
   y.literal("ZodString"),
   y.literal("ZodNumber"),
   y.literal("ZodBoolean"),
@@ -4565,9 +4590,9 @@ const gi = y.union([
   y.literal("ZodAny"),
   y.literal("ZodTuple")
 ]);
-class mi {
+class Ii {
   constructor(e, t) {
-    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new ci(
+    this.nodeToObjectConverter = e, this.registerConverters(), this.complexObjectConverter = new ui(
       this.nodeToObjectConverter,
       t
     );
@@ -4575,37 +4600,37 @@ class mi {
   converters = /* @__PURE__ */ new Map();
   complexObjectConverter;
   registerConverters() {
-    const e = new ai(), t = new ui(this.nodeToObjectConverter), r = new yi(this.nodeToObjectConverter), s = new di(this.nodeToObjectConverter), n = new hi(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 pi()), this.converters.set("ZodAny", new fi()), 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 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);
   }
   getConverter(e) {
     const t = this.getSchemaTypeName(e);
     return this.converters.get(t) ?? this.complexObjectConverter;
   }
   getSchemaTypeName(e) {
-    if (oi(e))
-      return e instanceof We ? this.getSchemaTypeName(e.innerType()) : e instanceof Ge ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
+    if (li(e))
+      return e instanceof Ge ? this.getSchemaTypeName(e.innerType()) : e instanceof Je ? this.getSchemaTypeName(e.schema) : this.getSchemaTypeName(e.unwrap());
     const t = e._def.typeName;
     try {
-      return gi.parse(t);
+      return mi.parse(t);
     } catch {
       throw new Error(`Schema type name ${t} is not supported`);
     }
   }
 }
-class Ii {
+class vi {
   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 mi(this, this.calculateBlueId);
+    this.calculateBlueId = t.calculateBlueId, this.converterFactory = new Ii(this, this.calculateBlueId);
   }
   converterFactory;
   calculateBlueId;
   convert(e, t) {
     const r = this.typeSchemaResolver?.resolveSchema(e), s = k.unwrapSchema(t);
-    if (vr(s))
+    if (Tr(s))
       return e;
     let n = s;
     return k.checkSchemaExtension(
@@ -4618,17 +4643,17 @@ class Ii {
     return this.converterFactory.getConverter(t).convert(e, t);
   }
 }
-class vi {
+class Ti {
   static get(e, t = {}) {
-    const { strategy: r = "official" } = t, s = B.get(e, r);
-    return qs(s);
+    const { strategy: r = "official" } = t, s = T.get(e, r);
+    return Qs(s);
   }
 }
-const zt = async (i) => {
-  if (Xr(i))
+const kt = async (i) => {
+  if (qr(i))
     return i;
   try {
-    const e = Je.parse(i), { Blue: t } = await Promise.resolve().then(() => Xi), r = await new t().calculateBlueId(e);
+    const e = Ze.parse(i), { Blue: t } = await Promise.resolve().then(() => tn), r = await new t().calculateBlueId(e);
     return {
       ...i,
       blueId: r
@@ -4636,31 +4661,31 @@ const zt = async (i) => {
   } catch (e) {
     throw new Error(`Failed enriching object with Blue ID: ${e}`);
   }
-}, xn = (i) => i?.items, Ln = (i) => i?.value, $n = (i) => v(i) ? {} : rr(
+}, jn = (i) => i?.items, Fn = (i) => i?.value, Un = (i) => v(i) ? {} : sr(
   i,
-  Et
-), _n = (i) => Qr(i) ? i.type.name ?? null : es(i) ? Hr(typeof i.value) : qr(i) ? "List" : null, Ti = (i) => p(i) && Object.keys(rr(i, ["blueId"])).length > 0, jn = (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) => {
   try {
-    const e = m.deserialize(i), t = B.get(e);
+    const e = m.deserialize(i), t = T.get(e);
     return Ve.parse(t);
   } catch (e) {
     throw new Error(
       `Failed transforming JSON-like value to BlueObject: ${e}`
     );
   }
-}, kt = async (i) => {
+}, Ht = async (i) => {
   const {
     resolveFunction: e,
     signal: t = new AbortController().signal,
     omitItems: r
   } = i, s = i.count ?? i.items.length;
-  let n = await Yr(i.items, async (l) => await zt(l));
+  let n = await Wr(i.items, async (l) => await kt(l));
   const o = Math.max(n?.length - s, 0);
   for (let l = n.length - 1; l >= o; l--)
-    if (!Ti(n[l])) {
+    if (!Bi(n[l])) {
       const a = await e(n[l], { signal: t });
       if (Array.isArray(a))
-        return kt({
+        return Ht({
           ...i,
           items: [
             ...n.slice(0, l),
@@ -4668,9 +4693,9 @@ const zt = async (i) => {
             ...n.slice(l + 1)
           ]
         });
-      const c = await zt(a);
+      const c = await kt(a);
       if (r?.includes(c.blueId))
-        return kt({
+        return Ht({
           ...i,
           items: [...n.slice(0, l), ...n.slice(l + 1)]
         });
@@ -4682,7 +4707,7 @@ const zt = async (i) => {
     }
   return n;
 };
-function Ye(i) {
+function We(i) {
   try {
     const e = new URL(i);
     return e.protocol === "http:" || e.protocol === "https:";
@@ -4690,14 +4715,14 @@ function Ye(i) {
     return !1;
   }
 }
-class Bi {
+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 M.transform(e, this.inferType.bind(this));
+    return L.transform(e, this.inferType.bind(this));
   }
   /**
    * Infer a basic type for a node
@@ -4706,10 +4731,10 @@ class Bi {
    */
   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)) : ft(r) ? e.setType(new u().setBlueId(ee)) : typeof r == "boolean" && e.setType(new u().setBlueId(re))), e;
+    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;
   }
 }
-class qe {
+class Qe {
   static MAPPINGS = "mappings";
   mappings = /* @__PURE__ */ new Map();
   /**
@@ -4719,8 +4744,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[Qe.MAPPINGS]) {
+        const n = r[Qe.MAPPINGS].getProperties();
         n && Object.entries(n).forEach(([o, l]) => {
           const a = l.getValue();
           typeof a == "string" && this.mappings.set(o, a);
@@ -4735,7 +4760,7 @@ class qe {
    * @returns The processed document
    */
   process(e) {
-    return M.transform(e, this.transformNode.bind(this));
+    return L.transform(e, this.transformNode.bind(this));
   }
   transformNode(e) {
     const t = e.clone();
@@ -4754,7 +4779,7 @@ class qe {
     }
   }
 }
-class Pi {
+class wi {
   /**
    * Process a document node to validate all inline types have been replaced
    * @param document - The document to process
@@ -4762,7 +4787,7 @@ class Pi {
    * @throws Error if any inline type values remain without BlueId mappings
    */
   process(e) {
-    return M.transform(e, this.validateNode.bind(this)), e;
+    return L.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;
@@ -4776,7 +4801,7 @@ class Pi {
     }
   }
 }
-class Mr {
+class Dr {
   blueIdsCollections = [];
   /**
    * Initializes the generator with default BlueIds collections
@@ -4865,7 +4890,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 Mr(), this.loadDefaultSimpleBlue();
+    this.nodeProvider = Me.wrap(t), this.processorProvider = r || De.getStandardProvider(), this.blueIdsMappingGenerator = s || new Dr(), this.loadDefaultSimpleBlue();
   }
   /**
    * Preprocesses a document node
@@ -4892,9 +4917,9 @@ class De {
   preprocessWithOptions(e, t) {
     let r = e.clone(), s = r.getBlue();
     if (!s && t && (s = t.clone()), s) {
-      new Lt(this.nodeProvider).extend(
+      new $t(this.nodeProvider).extend(
         s,
-        it.withSinglePath("/*")
+        nt.withSinglePath("/*")
       );
       const n = this.flattenTransformationItems(
         s.getItems()
@@ -4911,7 +4936,7 @@ class De {
         }
         r.setBlue(void 0);
       }
-      r = new Pi().process(
+      r = new wi().process(
         r
       );
     }
@@ -4930,11 +4955,11 @@ class De {
       getProcessor(e) {
         const t = "27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo", r = "FGYuTXwaoSKfZmpTysLTLsb8WzSqf43384rKZDkXhxD4", s = e.getType()?.getBlueId();
         if (t === s)
-          return new qe(
+          return new Qe(
             e
           );
         if (r === s)
-          return new Bi();
+          return new Pi();
       }
     };
   }
@@ -4957,7 +4982,7 @@ ${t}
    */
   loadDefaultSimpleBlue() {
     try {
-      const e = this.enrichDefaultBlue(Sr), t = ae(e);
+      const e = this.enrichDefaultBlue(br), t = ae(e);
       if (t)
         this.defaultSimpleBlue = m.deserialize(t);
       else
@@ -4967,7 +4992,7 @@ ${t}
     }
   }
 }
-class wi {
+class Si {
   preprocessingAliases = /* @__PURE__ */ new Map();
   urlContentFetcher;
   /**
@@ -4993,7 +5018,7 @@ class wi {
         return this.handleAliasValue(r, t);
       if (Be.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      throw Ye(t) ? new Error(
+      throw We(t) ? new Error(
         `URL '${t}' detected. Use the async version of this method to fetch the content.`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -5013,7 +5038,7 @@ class wi {
         return this.handleAliasValue(r, t);
       if (Be.isPotentialBlueId(t))
         return this.handleBlueId(r, t);
-      if (Ye(t) && this.urlContentFetcher)
+      if (We(t) && this.urlContentFetcher)
         try {
           const s = await this.fetchFromUrl(t);
           return s && r.setBlue(new u().setItems(s)), r;
@@ -5023,7 +5048,7 @@ class wi {
 ${s.message}`
           ) : s;
         }
-      else throw Ye(t) ? new Error(
+      else throw We(t) ? new Error(
         `UrlContentFetcher not provided for URL: ${t}`
       ) : new Error(`Invalid blue value: ${t}`);
     }
@@ -5109,24 +5134,24 @@ ${s.message}`
     return this.urlContentFetcher;
   }
 }
-const Si = {
+const bi = {
   fetchUrl: async (i) => {
     throw new Error(
       `You must provide a custom UrlFetchStrategy to fetch content from URL: ${i}`
     );
   }
 };
-class bi {
+class Ei {
   // Cache to avoid repeated network requests for the same URL
   cache = /* @__PURE__ */ new Map();
   fetchStrategy;
   enabled = !1;
   allowedDomains = [];
   constructor(e) {
-    this.fetchStrategy = e || Si;
+    this.fetchStrategy = e || bi;
   }
   validateUrl(e) {
-    if (!Ye(e))
+    if (!We(e))
       throw new Error(`Invalid URL: ${e}`);
     return !0;
   }
@@ -5245,7 +5270,7 @@ class bi {
     return this.allowedDomains = [], this;
   }
 }
-class je {
+class Fe {
   constructor(e, t, r, s = [], n = !1) {
     this.blueId = e, this.content = t, this.isMultipleDocuments = r, this.documentBlueIds = s, this.isCyclicSet = n;
   }
@@ -5272,8 +5297,8 @@ class Te {
         t
       );
       return n = c.blueId, o = c.nodes.map(
-        (d) => B.get(d)
-      ), new je(
+        (d) => T.get(d)
+      ), new Fe(
         n,
         o,
         !0,
@@ -5282,13 +5307,13 @@ class Te {
       );
     } else {
       const a = m.deserialize(s), c = r.prepareStorageNode(a, t);
-      n = c.blueId, o = B.get(c.node);
+      n = c.blueId, o = T.get(c.node);
     }
-    return new je(n, o, l);
+    return new Fe(n, o, l);
   }
   static parseAndCalculateBlueIdForNode(e, t, r) {
-    const s = r.prepareStorageNode(e, t), n = B.get(s.node);
-    return new je(s.blueId, n, !1);
+    const s = r.prepareStorageNode(e, t), n = T.get(s.node);
+    return new Fe(s.blueId, n, !1);
   }
   static parseAndCalculateBlueIdForNodeList(e, t, r) {
     if (!e || e.length === 0)
@@ -5297,9 +5322,9 @@ class Te {
       e,
       t
     ), n = s.nodes.map(
-      (l) => B.get(l)
+      (l) => T.get(l)
     ), o = !0;
-    return new je(
+    return new Fe(
       s.blueId,
       n,
       o,
@@ -5352,7 +5377,7 @@ class Te {
     }
   }
 }
-class Ei extends ye {
+class Ni extends ye {
   fetchByBlueId(e) {
     const t = e.split("#")[0], r = this.fetchContentByBlueId(t);
     if (r == null)
@@ -5375,7 +5400,7 @@ class Ei extends ye {
     return Array.isArray(n) ? n.map((o) => m.deserialize(o)) : [m.deserialize(n)];
   }
 }
-class Dr extends Ei {
+class xr extends Ni {
   nameToBlueIdsMap = /* @__PURE__ */ new Map();
   /**
    * Find a node by name. Throws an error if multiple nodes are found with the same name.
@@ -5419,13 +5444,23 @@ class Dr extends Ei {
     ]);
   }
 }
-class $t extends Dr {
+function Ci(i) {
+  return Array.isArray(i) ? Ri(i) : i;
+}
+function Ri(i) {
+  const e = i.map((t) => m.deserialize(t));
+  return O.hasIndexedThisReference(e) ? Ai(e) : i;
+}
+function Ai(i) {
+  return new O().calculate(i).nodes.map((t) => T.get(t));
+}
+class _t extends xr {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   aliasBlueIdMap = /* @__PURE__ */ new Map();
   constructor(e, t = {}) {
     super();
-    const r = $t.collectAliasMappings(e);
+    const r = _t.collectAliasMappings(e);
     this.aliasBlueIdMap = new Map(Object.entries(r)), this.loadRepositories(e);
   }
   static collectAliasMappings(e) {
@@ -5443,8 +5478,14 @@ class $t extends Dr {
   loadRepositories(e) {
     for (const t of e)
       Object.values(t.packages).forEach((r) => {
-        for (const [s, n] of Object.entries(r.contents))
-          this.storeContent(s, n, Array.isArray(n)), this.addContentNames(s, n);
+        for (const [s, n] of Object.entries(r.contents)) {
+          const o = Ci(n);
+          this.storeContent(
+            s,
+            o,
+            Array.isArray(o)
+          ), this.addContentNames(s, o);
+        }
       });
   }
   addContentNames(e, t) {
@@ -5512,12 +5553,12 @@ class $t extends Dr {
     };
   }
 }
-class Ni {
+class Vi {
   nodeProvider;
   blueIdToInlineValue = /* @__PURE__ */ new Map();
   constructor(e) {
     const { nodeProvider: t, blueIdsMappingGenerator: r } = e;
-    this.nodeProvider = t, Object.entries(rt).forEach(([n, o]) => {
+    this.nodeProvider = t, Object.entries(st).forEach(([n, o]) => {
       this.blueIdToInlineValue.set(n, o);
     });
     const s = r.getAllBlueIds();
@@ -5529,7 +5570,7 @@ class Ni {
    * Returns a new BlueNode where all type references are restored to inline values when possible.
    */
   restore(e) {
-    return M.transform(
+    return L.transform(
       e,
       (t) => this.restoreNode(t)
     );
@@ -5578,17 +5619,17 @@ class Ni {
       return this.blueIdToInlineValue.set(e, o), o;
   }
 }
-class Ci {
+class Oi {
   runtimes;
   contents;
   aliases;
   constructor(e) {
     const t = [];
     for (const r of e)
-      t.push(Ri(r));
+      t.push(Mi(r));
     this.runtimes = t, this.contents = {}, this.aliases = {};
     for (const r of this.runtimes)
-      Fi(this.contents, r.contents, r.name), ji(this.aliases, r.aliases, r.name);
+      ki(this.contents, r.contents, r.name), Ki(this.aliases, r.aliases, r.name);
   }
   getRuntimes() {
     return this.runtimes;
@@ -5603,7 +5644,7 @@ class Ci {
     return this.runtimes.find((t) => t.name === e);
   }
   toCurrentBlueId(e) {
-    const t = this.aliases[e] ?? dr[e] ?? e;
+    const t = this.aliases[e] ?? hr[e] ?? e;
     for (const r of this.runtimes) {
       const s = r.toCurrentBlueIdIndex[t];
       if (s)
@@ -5612,7 +5653,7 @@ class Ci {
     return t;
   }
   getTypeAlias(e) {
-    const t = this.toCurrentBlueId(e), r = rt[t];
+    const t = this.toCurrentBlueId(e), r = st[t];
     if (r)
       return r;
     for (const s of this.runtimes) {
@@ -5635,10 +5676,10 @@ class Ci {
     }
   }
 }
-function Ri(i) {
-  const e = Ai(i);
+function Mi(i) {
+  const e = Di(i);
   return Object.values(i.packages).forEach((t) => {
-    Vi(e, i, t);
+    xi(e, i, t);
   }), {
     name: i.name,
     repositoryVersions: i.repositoryVersions,
@@ -5653,7 +5694,7 @@ function Ri(i) {
     typePackageByCurrentBlueId: e.typePackageByCurrentBlueId
   };
 }
-function Ai(i) {
+function Di(i) {
   const e = Object.fromEntries(
     i.repositoryVersions.map((r, s) => [r, s])
   ), t = i.repositoryVersions[i.repositoryVersions.length - 1];
@@ -5670,23 +5711,23 @@ function Ai(i) {
     currentRepoBlueId: t
   };
 }
-function Vi(i, e, t) {
+function xi(i, e, t) {
   if (i.packageNames.has(t.name))
     throw new Error(`Duplicate package name detected: ${t.name}`);
-  i.packageNames.add(t.name), Oi(i, t), Mi(i, e, t), Di(i, t), xi(i, t);
+  i.packageNames.add(t.name), Li(i, t), $i(i, e, t), _i(i, t), ji(i, t);
 }
-function Oi(i, e) {
+function Li(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 Mi(i, e, t) {
+function $i(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 = Li(
+    const n = Fi(
       s,
       e,
       r,
@@ -5703,17 +5744,17 @@ function Mi(i, e, t) {
       }
   });
 }
-function Di(i, e) {
+function _i(i, e) {
   Object.entries(e.contents).forEach(([t, r]) => {
     i.contents[t] = r;
   });
 }
-function xi(i, e) {
+function ji(i, e) {
   i.schemas.push(...Object.values(e.schemas));
 }
-function Li(i, e, t, r) {
-  if (i.status === bt)
-    return $i(i, e, t, r), {
+function Fi(i, e, t, r) {
+  if (i.status === Et)
+    return Ui(i, e, t, r), {
       ...i,
       versions: i.versions ? [...i.versions] : i.versions
     };
@@ -5736,7 +5777,7 @@ function Li(i, e, t, r) {
       );
     n.add(o.repositoryVersionIndex);
     for (const l of o.attributesAdded ?? [])
-      _i(
+      zi(
         l,
         e.name,
         t,
@@ -5747,8 +5788,8 @@ function Li(i, e, t, r) {
     versions: s
   };
 }
-function $i(i, e, t, r) {
-  if (i.status === bt) {
+function Ui(i, e, t, r) {
+  if (i.status === Et) {
     if (i.versions && i.versions.length > 1)
       throw new Error(
         `Dev type ${r}/${i.name} (${t}) must not declare multiple versions`
@@ -5762,9 +5803,9 @@ function $i(i, e, t, r) {
     }
   }
 }
-function _i(i, e, t, r) {
+function zi(i, e, t, r) {
   try {
-    Wr(i);
+    Gr(i);
   } catch (s) {
     const n = s instanceof Error ? s.message : "Unknown error";
     throw new Error(
@@ -5772,7 +5813,7 @@ function _i(i, e, t, r) {
     );
   }
 }
-function ji(i, e, t) {
+function Ki(i, e, t) {
   for (const [r, s] of Object.entries(e)) {
     const n = i[r];
     if (n && n !== s)
@@ -5782,11 +5823,11 @@ function ji(i, e, t) {
     i[r] = s;
   }
 }
-function Fi(i, e, t) {
+function ki(i, e, t) {
   for (const [r, s] of Object.entries(e)) {
     if (r in i) {
       const n = i[r];
-      if (!Ui(n, s))
+      if (!Hi(n, s))
         throw new Error(
           `Conflicting content for BlueId '${r}' across repositories (from ${t})`
         );
@@ -5795,35 +5836,35 @@ function Fi(i, e, t) {
     i[r] = s;
   }
 }
-function Ui(i, e) {
+function Hi(i, e) {
   if (i === e) return !0;
   if (i === null || e === null || typeof i != "object" || typeof e != "object") return !1;
-  const t = yt.canonicalize(i), r = yt.canonicalize(e);
+  const t = gt.canonicalize(i), r = gt.canonicalize(e);
   return t !== void 0 && t === r;
 }
-const Ki = /* @__PURE__ */ new Set([
+const Yi = /* @__PURE__ */ new Set([
   "__proto__",
   "constructor",
   "prototype"
 ]);
-function Ht(i) {
+function Yt(i) {
   const e = i.at(0), t = i.at(-1);
   return !e || !t ? i : e === "'" && t === "'" || e === '"' && t === '"' ? i.slice(1, -1) : i;
 }
-function zi(i, e) {
+function Wi(i, e) {
   const t = i.indexOf("=");
   if (t === -1)
     throw ve(e, `Missing '=' in segment '${i.trim()}'`);
   if (i.indexOf("=", t + 1) !== -1)
     throw ve(e, `Unexpected '=' in segment '${i.trim()}'`);
-  const r = Ht(i.slice(0, t).trim()), s = Ht(i.slice(t + 1).trim());
+  const r = Yt(i.slice(0, t).trim()), s = Yt(i.slice(t + 1).trim());
   if (!r)
     throw ve(e, "Repository name is empty");
   if (!s)
     throw ve(e, `Repository BlueId is empty for '${r}'`);
   return { name: r, value: s };
 }
-function ki(i) {
+function Gi(i) {
   if (i.trim().length === 0)
     return /* @__PURE__ */ Object.create(null);
   const e = /* @__PURE__ */ Object.create(null);
@@ -5831,21 +5872,21 @@ function ki(i) {
     const r = t.trim();
     if (!r)
       throw ve(i, "Empty repository segment");
-    const { name: s, value: n } = zi(r, i);
-    Yi(s, i), e[s] = n;
+    const { name: s, value: n } = Wi(r, i);
+    Zi(s, i), e[s] = n;
   }
   return e;
 }
-function Hi(i) {
-  return typeof i == "string" ? ki(i) : i;
+function Ji(i) {
+  return typeof i == "string" ? Gi(i) : i;
 }
 function ve(i, e) {
   return new he(
-    _.INVALID_BLUE_CONTEXT_REPOSITORIES,
+    j.INVALID_BLUE_CONTEXT_REPOSITORIES,
     `Invalid BlueContext repositories value: ${e}`,
     [
       {
-        code: _.INVALID_BLUE_CONTEXT_REPOSITORIES,
+        code: j.INVALID_BLUE_CONTEXT_REPOSITORIES,
         message: e,
         locationPath: [],
         context: {
@@ -5856,31 +5897,31 @@ function ve(i, e) {
     ]
   );
 }
-function Yi(i, e) {
-  if (Ki.has(i))
+function Zi(i, e) {
+  if (Yi.has(i))
     throw ve(e, `Forbidden repository name '${i}'`);
 }
-function Wi(i, e) {
+function Xi(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) => Yt(l) - Yt(o)
+      (o, l) => Wt(l) - Wt(o)
     );
     r.push(...n);
   }
   return r;
 }
-function Yt(i) {
-  return ir(i).length;
+function Wt(i) {
+  return nr(i).length;
 }
-const Gi = /* @__PURE__ */ new Set([...Et]), C = {
+const qi = /* @__PURE__ */ new Set([...Nt]), N = {
   core: "core",
   noRuntime: "no-runtime",
   noTargetContext: "no-target-context",
   representable: "representable",
   unrepresentable: "unrepresentable"
 };
-class Ji {
+class Qi {
   registry;
   targetRepoVersionIndexes;
   fallbackToCurrentInlineDefinitions;
@@ -5889,7 +5930,7 @@ class Ji {
     this.registry = e.registry, this.targetRepoVersionIndexes = e.targetRepoVersionIndexes, this.fallbackToCurrentInlineDefinitions = e.fallbackToCurrentInlineDefinitions;
   }
   transform(e) {
-    return M.transform(
+    return L.transform(
       e,
       (t) => this.transformNode(t)
     );
@@ -5919,11 +5960,11 @@ class Ji {
       return;
     const n = this.resolveType(s);
     switch (n.kind) {
-      case C.core: {
+      case N.core: {
         r.setBlueId(n.blueId);
         return;
       }
-      case C.representable: {
+      case N.representable: {
         this.applyDropPointers([r], n.dropPointers, {
           rootIsSchema: !0
         }), this.applyDropPointers(
@@ -5932,34 +5973,34 @@ class Ji {
         ), r.setBlueId(n.targetBlueId);
         return;
       }
-      case C.noRuntime:
-      case C.noTargetContext:
-      case C.unrepresentable: {
+      case N.noRuntime:
+      case N.noTargetContext:
+      case N.unrepresentable: {
         if (this.fallbackToCurrentInlineDefinitions) {
           this.inlineDefinition(e, t.setter, s);
           return;
         }
-        throw n.kind === C.unrepresentable ? n.error : this.unrepresentableError(
+        throw n.kind === N.unrepresentable ? n.error : this.unrepresentableError(
           s,
-          n.kind === C.noTargetContext ? `Repository '${n.runtimeName}' not provided in BlueContext.` : "Type does not belong to any declared repository.",
-          n.kind === C.noTargetContext ? n.runtime : void 0,
-          n.kind === C.noTargetContext ? n.meta : void 0,
+          n.kind === N.noTargetContext ? `Repository '${n.runtimeName}' not provided in BlueContext.` : "Type does not belong to any declared repository.",
+          n.kind === N.noTargetContext ? n.runtime : void 0,
+          n.kind === N.noTargetContext ? n.meta : void 0,
           void 0,
-          n.kind === C.noTargetContext ? n.typeAlias : void 0
+          n.kind === N.noTargetContext ? n.typeAlias : void 0
         );
       }
     }
   }
   resolveType(e) {
     if (fe.includes(e))
-      return { kind: C.core, blueId: 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)
-      return { kind: C.noRuntime };
+      return { kind: N.noRuntime };
     const n = this.targetRepoVersionIndexes[s.runtime.name];
     if (n === void 0)
       return {
-        kind: C.noTargetContext,
+        kind: N.noTargetContext,
         currentBlueId: t,
         runtimeName: s.runtime.name,
         runtime: s.runtime,
@@ -5967,11 +6008,11 @@ class Ji {
         typeAlias: r
       };
     const o = s.typeMeta;
-    if (o.status === bt) {
+    if (o.status === Et) {
       const h = s.runtime.repositoryVersions.length - 1;
       if (n !== h)
         return {
-          kind: C.unrepresentable,
+          kind: N.unrepresentable,
           currentBlueId: t,
           error: this.unrepresentableError(
             t,
@@ -5984,7 +6025,7 @@ class Ji {
         };
       const f = o.versions?.[0];
       return {
-        kind: C.representable,
+        kind: N.representable,
         currentBlueId: t,
         targetBlueId: f?.typeBlueId ?? t,
         dropPointers: []
@@ -5993,7 +6034,7 @@ class Ji {
     const l = o.versions || [];
     if (l.length === 0)
       return {
-        kind: C.unrepresentable,
+        kind: N.unrepresentable,
         currentBlueId: t,
         error: this.unrepresentableError(
           t,
@@ -6007,7 +6048,7 @@ class Ji {
     const a = l[0].repositoryVersionIndex;
     if (n < a)
       return {
-        kind: C.unrepresentable,
+        kind: N.unrepresentable,
         currentBlueId: t,
         error: this.unrepresentableError(
           t,
@@ -6023,14 +6064,14 @@ class Ji {
       h.repositoryVersionIndex <= n && (c = h.typeBlueId);
     const d = o.status === Ce ? this.getDropPointers(o, n) : [];
     return {
-      kind: C.representable,
+      kind: N.representable,
       currentBlueId: t,
       targetBlueId: c,
       dropPointers: d
     };
   }
   getDropPointers(e, t) {
-    return e.status !== Ce ? [] : Wi(e.versions, t);
+    return e.status !== Ce ? [] : Xi(e.versions, t);
   }
   applyDropPointers(e, t, r = {}) {
     if (e.length === 0 || t.length === 0)
@@ -6043,13 +6084,13 @@ class Ji {
   getDictionaryValueTargets(e) {
     const t = e.getProperties();
     return t ? Object.entries(t).filter(
-      ([r, s]) => s instanceof u && !Gi.has(r)
+      ([r, s]) => s instanceof u && !qi.has(r)
     ).map(([, r]) => r) : [];
   }
   deletePropertyAtPointer(e, t, r) {
     let s;
     try {
-      s = ir(t);
+      s = nr(t);
     } catch {
       throw this.invalidPointerError(t);
     }
@@ -6059,7 +6100,7 @@ class Ji {
     if (t.length === 0)
       return;
     const [s, ...n] = t;
-    if (s === z) {
+    if (s === K) {
       const a = e.getType();
       a && this.applyPointerSegments(a, n, !0);
       return;
@@ -6116,7 +6157,7 @@ class Ji {
     try {
       const o = m.deserialize(n);
       o.setBlueId(void 0);
-      const l = M.transform(
+      const l = L.transform(
         o,
         (a) => this.transformNode(a)
       );
@@ -6127,9 +6168,9 @@ class Ji {
   }
   invalidPointerError(e) {
     const t = `Invalid attributesAdded pointer '${e}'.`;
-    return new he(_.INVALID_REPOSITORY_POINTER, t, [
+    return new he(j.INVALID_REPOSITORY_POINTER, t, [
       {
-        code: _.INVALID_REPOSITORY_POINTER,
+        code: j.INVALID_REPOSITORY_POINTER,
         message: t,
         locationPath: [],
         context: { pointer: e }
@@ -6148,38 +6189,38 @@ class Ji {
       d !== void 0 && (a.typeIntroducedInRepoBlueId = r?.repositoryVersions[d]);
     }
     const c = {
-      code: _.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
+      code: j.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
       message: t,
-      locationPath: [z],
+      locationPath: [K],
       context: a
     };
     return new he(
-      _.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
+      j.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
       t,
       [c]
     );
   }
 }
-function Bt(i, e) {
-  return e ? M.transform(i, (t) => (Fe(
+function Pt(i, e) {
+  return e ? L.transform(i, (t) => (Ue(
     () => t.getType(),
     (r) => t.setType(r),
     e
-  ), Fe(
+  ), Ue(
     () => t.getItemType(),
     (r) => t.setItemType(r),
     e
-  ), Fe(
+  ), Ue(
     () => t.getKeyType(),
     (r) => t.setKeyType(r),
     e
-  ), Fe(
+  ), Ue(
     () => t.getValueType(),
     (r) => t.setValueType(r),
     e
   ), t)) : i;
 }
-function Fe(i, e, t) {
+function Ue(i, e, t) {
   const r = i();
   if (!r || r.isInlineValue())
     return;
@@ -6189,7 +6230,7 @@ function Fe(i, e, t) {
   const n = t.toCurrentBlueId(s);
   n !== s && e(r.clone().setBlueId(n));
 }
-class Zi {
+class en {
   registry;
   blueIdMapper;
   constructor(e) {
@@ -6199,8 +6240,8 @@ class Zi {
     const r = this.computeTargetRepoVersionIndexes(t);
     if (Object.keys(r).length === 0)
       return e;
-    const s = Bt(e, this.blueIdMapper);
-    return new Ji({
+    const s = Pt(e, this.blueIdMapper);
+    return new Qi({
       registry: this.registry,
       targetRepoVersionIndexes: r,
       fallbackToCurrentInlineDefinitions: t.fallbackToCurrentInlineDefinitions !== !1
@@ -6210,7 +6251,7 @@ class Zi {
     const t = {};
     if (!e?.repositories)
       return t;
-    const r = typeof e.repositories == "string" ? Hi(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)
@@ -6228,7 +6269,7 @@ class Zi {
   }
   unknownRepoBlueIdError(e, t, r) {
     const s = `Unknown RepoBlueId '${t}' for repository '${e}'.`, n = {
-      code: _.REPO_UNKNOWN_REPO_BLUE_ID,
+      code: j.REPO_UNKNOWN_REPO_BLUE_ID,
       message: s,
       locationPath: [],
       context: {
@@ -6237,7 +6278,7 @@ class Zi {
         serverRepoBlueId: r
       }
     };
-    return new he(_.REPO_UNKNOWN_REPO_BLUE_ID, s, [
+    return new he(j.REPO_UNKNOWN_REPO_BLUE_ID, s, [
       n
     ]);
   }
@@ -6248,7 +6289,7 @@ class xe {
   blueDirectivePreprocessor;
   urlContentFetcher;
   blueIdsMappingGenerator;
-  globalLimits = j;
+  globalLimits = F;
   mergingProcessor;
   repositories;
   repositoryRegistry;
@@ -6261,20 +6302,20 @@ class xe {
       repositories: n,
       mergingProcessor: o
     } = e;
-    this.repositories = n, this.repositoryRegistry = new Ci(n ?? []), this.blueContextResolver = new Zi({
+    this.repositories = n, this.repositoryRegistry = new Oi(n ?? []), this.blueContextResolver = new en({
       registry: this.repositoryRegistry,
       blueIdMapper: this.repositoryRegistry
     }), this.mergingProcessor = o ?? _e();
-    const l = Dt(() => []);
+    const l = xt(() => []);
     this.nodeProvider = this.wrapNodeProviderWithRepositories(
       t || l,
       n
-    ), this.typeSchemaResolver = r ?? new Hs([], {
+    ), this.typeSchemaResolver = r ?? new Ys([], {
       nodeProvider: this.nodeProvider
-    }), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this.urlContentFetcher = new bi(s), this.blueDirectivePreprocessor = new wi(
+    }), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this.urlContentFetcher = new Ei(s), this.blueDirectivePreprocessor = new Si(
       void 0,
       this.urlContentFetcher
-    ), this.blueIdsMappingGenerator = new Mr(), this.blueIdsMappingGenerator.registerBlueIds(
+    ), this.blueIdsMappingGenerator = new Dr(), this.blueIdsMappingGenerator.registerBlueIds(
       this.repositoryRegistry.getAliases()
     );
     const a = this.repositoryRegistry.getRuntimes().flatMap((c) => c.schemas);
@@ -6289,7 +6330,7 @@ class xe {
    */
   nodeToJson(e, t = "official") {
     const r = this.normalizeNodeToJsonOptions(t), s = r.blueContext ? this.blueContextResolver.transform(e, r.blueContext) : e;
-    return B.get(s, r.format);
+    return T.get(s, r.format);
   }
   /**
    * Converts a BlueNode to a deterministic YAML string. Uses nodeToJson under the hood
@@ -6297,16 +6338,16 @@ class xe {
    */
   nodeToYaml(e, t = "official") {
     const r = this.normalizeNodeToJsonOptions(t), s = r.blueContext ? this.blueContextResolver.transform(e, r.blueContext) : e;
-    return vi.get(s, {
+    return Ti.get(s, {
       strategy: r.format
     });
   }
   nodeToSchemaOutput(e, t) {
-    return new Ii(this.typeSchemaResolver, {
+    return new vi(this.typeSchemaResolver, {
       calculateBlueId: (s) => this.calculateBlueIdSync(s)
     }).convert(e, t);
   }
-  resolve(e, t = j) {
+  resolve(e, t = F) {
     const r = this.combineWithGlobalLimits(t), n = new de(this.mergingProcessor, this.nodeProvider).resolve(e, r);
     if (!(r instanceof H)) {
       const o = this.getExactReferenceBlueId(e);
@@ -6336,7 +6377,7 @@ class xe {
    * Produces a minimal overlay that re-resolves to the same semantic BlueId.
    */
   minimize(e) {
-    return new He({
+    return new Ye({
       nodeProvider: this.nodeProvider,
       mergingProcessor: this.mergingProcessor
     }).minimize(e);
@@ -6349,18 +6390,18 @@ class xe {
    * repository-backed definitions currently known to this {@link Blue} instance.
    */
   restoreInlineTypes(e) {
-    return new Ni({
+    return new Vi({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).restore(e);
   }
   extend(e, t) {
     const r = this.combineWithGlobalLimits(t);
-    new Lt(this.nodeProvider).extend(e, r);
+    new $t(this.nodeProvider).extend(e, r);
   }
   jsonValueToNode(e) {
     const t = this.preprocess(m.deserialize(e));
-    return Bt(
+    return Pt(
       t,
       this.repositoryRegistry
     );
@@ -6369,7 +6410,7 @@ class xe {
     const t = await this.preprocessAsync(
       m.deserialize(e)
     );
-    return Bt(
+    return Pt(
       t,
       this.repositoryRegistry
     );
@@ -6391,7 +6432,7 @@ class xe {
   ) : this.jsonValueToNodeAsync(e);
   calculateBlueId = async (e) => {
     const t = await this.prepareForBlueIdCalculation(e);
-    return new He({
+    return new Ye({
       nodeProvider: this.nodeProvider,
       mergingProcessor: this.mergingProcessor
     }).calculateBlueId(t);
@@ -6399,7 +6440,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 He({
+    return new Ye({
       nodeProvider: this.nodeProvider,
       mergingProcessor: this.mergingProcessor
     }).calculateBlueIdSync(t);
@@ -6437,7 +6478,7 @@ class xe {
     }).preprocessWithDefaultBlue(t);
   }
   transform(e, t) {
-    return M.transform(e, t);
+    return L.transform(e, t);
   }
   getNodeProvider() {
     return this.nodeProvider;
@@ -6449,7 +6490,7 @@ class xe {
     ), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this;
   }
   getExactReferenceBlueId(e) {
-    if (!E.hasBlueIdOnly(e))
+    if (!b.hasBlueIdOnly(e))
       return;
     const t = e.getReferenceBlueId();
     return t !== void 0 && Be.isPotentialBlueId(t) ? t : void 0;
@@ -6594,7 +6635,7 @@ class xe {
     if (!s)
       return !1;
     const n = new u().setReferenceBlueId(r);
-    return N(s, n, this.nodeProvider);
+    return E(s, n, this.nodeProvider);
   }
   /**
    * Checks if a BlueNode matches a BlueNode type.
@@ -6604,7 +6645,7 @@ class xe {
    * @returns true if the node matches the type, false otherwise.
    */
   isTypeOfNode(e, t) {
-    return new Ys(this).matchesType(e, t, this.globalLimits);
+    return new Ws(this).matchesType(e, t, this.globalLimits);
   }
   /**
    * Sets the global limits for this Blue instance.
@@ -6614,7 +6655,7 @@ class xe {
    * @returns This instance for chaining
    */
   setGlobalLimits(e) {
-    return this.globalLimits = e ?? j, this;
+    return this.globalLimits = e ?? F, this;
   }
   /**
    * Gets the current global limits for this Blue instance.
@@ -6635,8 +6676,8 @@ class xe {
   }
   wrapNodeProviderWithRepositories(e, t) {
     return t && t.length > 0 ? Me.wrap(
-      new Pr([
-        new $t(t, {
+      new wr([
+        new _t(t, {
           mergingProcessor: this.mergingProcessor
         }),
         e
@@ -6644,38 +6685,38 @@ class xe {
     ) : Me.wrap(e);
   }
   combineWithGlobalLimits(e) {
-    return this.globalLimits == j ? e : e == j ? this.globalLimits : nt.of(this.globalLimits, e);
+    return this.globalLimits == F ? e : e == F ? this.globalLimits : ot.of(this.globalLimits, e);
   }
 }
-const Xi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const tn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   Blue: xe
-}, Symbol.toStringTag, { value: "Module" })), pt = /* @__PURE__ */ new WeakMap(), qi = 10;
-function Fn(i, e = {}) {
+}, Symbol.toStringTag, { value: "Module" })), ft = /* @__PURE__ */ new WeakMap(), rn = 10;
+function kn(i, e = {}) {
   const t = e.mergingProcessor === void 0;
   if (t) {
-    const a = pt.get(i);
+    const a = ft.get(i);
     if (a)
       return a;
   }
-  const r = xr(i);
+  const r = Lr(i);
   if (r.length === 0)
-    return t && pt.set(i, i), i;
-  const s = Lr(i), n = e.mergingProcessor ?? _e();
+    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 = Qi(r.length);
+  const l = sn(r.length);
   for (let a = 0; a < l; a++) {
-    const c = rn(
+    const c = ln(
       r,
       s,
       o,
       n
     );
-    if (ln(o, c)) {
-      const d = sn(i, o);
-      return t && pt.set(i, d), d;
+    if (dn(o, c)) {
+      const d = an(i, o);
+      return t && ft.set(i, d), d;
     }
     o = c;
   }
@@ -6683,12 +6724,12 @@ function Fn(i, e = {}) {
     `Repository semantic reindexing did not converge after ${l} passes for ${r.length} entries.`
   );
 }
-function Un(i, e = {}) {
-  const t = xr(i);
+function Hn(i, e = {}) {
+  const t = Lr(i);
   if (t.length === 0)
     return;
-  const r = Lr(i), s = e.mergingProcessor ?? _e(), n = new xe({
-    nodeProvider: en(t, r),
+  const r = $r(i), s = e.mergingProcessor ?? _e(), n = new xe({
+    nodeProvider: nn(t, r),
     mergingProcessor: s
   });
   n.registerBlueIds(r);
@@ -6696,11 +6737,11 @@ function Un(i, e = {}) {
     const c = Array.isArray(a) ? a.map((h) => n.jsonValueToNode(h)) : n.jsonValueToNode(a), d = n.calculateBlueIdSync(c);
     if (d !== l)
       throw new he(
-        _.BLUE_ID_MISMATCH,
+        j.BLUE_ID_MISMATCH,
         `Repository content key '${l}' does not match semantic BlueId '${d}'.`,
         [
           {
-            code: _.BLUE_ID_MISMATCH,
+            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 }
           }
@@ -6708,33 +6749,33 @@ function Un(i, e = {}) {
       );
   }
 }
-function Qi(i) {
-  return Math.max(qi, i + 1);
+function sn(i) {
+  return Math.max(rn, i + 1);
 }
-function xr(i) {
+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 Lr(i) {
+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 en(i, 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 = tn(n, r);
+      const o = on(n, r);
       if (o === void 0)
         return [];
-      const { baseBlueId: l, suffix: a } = Pt(o), c = t.get(l);
+      const { baseBlueId: l, suffix: a } = wt(o), c = t.get(l);
       if (c === void 0)
         return [];
       const d = Array.isArray(c), h = Te.resolveThisReferences(
@@ -6757,31 +6798,31 @@ function en(i, e) {
     }
   };
 }
-function tn(i, e) {
+function on(i, e) {
   const t = e.get(i);
   if (t !== void 0)
     return t;
-  const { baseBlueId: r, suffix: s } = Pt(i);
+  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 (Pt(n).suffix === void 0)
+  if (wt(n).suffix === void 0)
     return `${n}${s}`;
 }
-function Pt(i) {
+function wt(i) {
   const e = i.indexOf("#");
   return e === -1 ? { baseBlueId: i } : {
     baseBlueId: i.slice(0, e),
     suffix: i.slice(e)
   };
 }
-function rn(i, e, t, r) {
+function ln(i, e, t, r) {
   const s = new Map(
     i.map(({ oldBlueId: c, content: d }) => [
       c,
-      Qe(d, t)
+      et(d, t)
     ])
   ), n = /* @__PURE__ */ new Map();
   for (const { oldBlueId: c } of i)
@@ -6810,7 +6851,7 @@ function rn(i, e, t, r) {
     nodeProvider: l,
     mergingProcessor: r
   });
-  return a.registerBlueIds($r(e, t)), Object.fromEntries(
+  return a.registerBlueIds(_r(e, t)), Object.fromEntries(
     i.map(({ packageName: c, oldBlueId: d }) => {
       const h = s.get(d);
       if (h === void 0)
@@ -6827,32 +6868,32 @@ function rn(i, e, t, r) {
     })
   );
 }
-function sn(i, e) {
+function an(i, e) {
   return {
     name: i.name,
     repositoryVersions: i.repositoryVersions,
     packages: Object.fromEntries(
       Object.entries(i.packages).map(([t, r]) => [
         t,
-        nn(r, e)
+        cn(r, e)
       ])
     )
   };
 }
-function nn(i, e) {
+function cn(i, e) {
   return {
     name: i.name,
-    aliases: $r(i.aliases, e),
+    aliases: _r(i.aliases, e),
     typesMeta: Object.fromEntries(
       Object.entries(i.typesMeta).map(([t, r]) => [
         e[t] ?? t,
-        on(r, e)
+        un(r, e)
       ])
     ),
     contents: Object.fromEntries(
       Object.entries(i.contents).map(([t, r]) => [
         e[t] ?? t,
-        Qe(r, e)
+        et(r, e)
       ])
     ),
     schemas: Object.fromEntries(
@@ -6860,42 +6901,42 @@ function nn(i, e) {
         const s = e[t] ?? t;
         return [
           s,
-          xs(s)(r)
+          Ls(s)(r)
         ];
       })
     )
   };
 }
-function on(i, e) {
+function un(i, e) {
   return {
     ...i,
     versions: i.versions.map((t) => ({
       ...t,
-      typeBlueId: _t(t.typeBlueId, e)
+      typeBlueId: jt(t.typeBlueId, e)
     }))
   };
 }
-function ln(i, 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) {
+function _r(i, e) {
   return Object.fromEntries(
     Object.entries(i).map(([t, r]) => [
       t,
-      _t(r, e)
+      jt(r, e)
     ])
   );
 }
-function Qe(i, e) {
-  return Array.isArray(i) ? i.map((t) => Qe(t, e)) : i && typeof i == "object" ? Object.fromEntries(
+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" ? _t(r, e) : Qe(r, e)
+      t === "blueId" && typeof r == "string" ? jt(r, e) : et(r, e)
     ])
   ) : i;
 }
-function _t(i, e) {
+function jt(i, e) {
   const t = e[i];
   if (t !== void 0)
     return t;
@@ -6905,7 +6946,7 @@ function _t(i, e) {
   const [, s, n] = r;
   return `${e[s] ?? s}${n}`;
 }
-class Kn extends Dr {
+class Yn extends xr {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   preprocessor;
@@ -6913,12 +6954,12 @@ class Kn extends Dr {
   constructor(e = []) {
     super();
     const t = new De({ nodeProvider: this });
-    this.preprocessor = (r) => t.preprocessWithDefaultBlue(r), this.storageService = new ni({
+    this.preprocessor = (r) => t.preprocessWithDefaultBlue(r), this.storageService = new oi({
       nodeProvider: this
     }), e.forEach((r) => this.processNode(r));
   }
   processNode(e) {
-    E.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
+    b.hasItemsOnly(e) ? this.processNodeWithItems(e) : this.processSingleNode(e);
   }
   processSingleNode(e) {
     const t = Te.parseAndCalculateBlueIdForNode(
@@ -7008,7 +7049,7 @@ class Kn extends Dr {
    */
   addListAndItsItemsFromNodes(e) {
     const t = this.storeNodeList(e);
-    if ($.hasThisReference(e)) {
+    if (O.hasThisReference(e)) {
       this.addListItemNames(t.blueId, t.content);
       return;
     }
@@ -7047,72 +7088,72 @@ class Kn extends Dr {
   }
 }
 export {
-  ls as Base58Sha256Provider,
-  Kn as BasicNodeProvider,
+  as as Base58Sha256Provider,
+  Yn as BasicNodeProvider,
   xe as Blue,
-  O as BlueIdCalculator,
-  Cn as BlueIdToCid,
+  M as BlueIdCalculator,
+  On as BlueIdToCid,
   u as BlueNode,
   k as BlueNodeTypeSchema,
-  yt as JsonCanonicalizer,
-  Mt as Limits,
+  gt as JsonCanonicalizer,
+  Dt as Limits,
   de as Merger,
-  Dn as MergingProcessors,
-  Ws as NodeResolver,
-  E as Nodes,
-  In as Properties,
+  _n as MergingProcessors,
+  Gs as NodeResolver,
+  b as Nodes,
+  Pn as Properties,
   J as ResolvedBlueNode,
-  He as SemanticIdentityService,
-  Hs as TypeSchemaResolver,
-  Rn as applyBlueNodePatch,
-  st as baseBlueObjectSchema,
-  An as blueDescriptionField,
-  Vn as blueIdField,
-  vn as blueIdSchema,
-  On as blueNameField,
-  Mn as blueNodeField,
-  Pn as blueObjectBooleanValueSchema,
-  Bn as blueObjectNumberValueSchema,
+  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,
   Ve as blueObjectSchema,
-  wn as blueObjectStringListItemsSchema,
-  Tn as blueObjectStringValueSchema,
-  Dt as createNodeProvider,
-  zt as enrichWithBlueId,
-  bs as getBlueDescriptionAnnotation,
-  Cs as getBlueIdAnnotation,
-  As as getBlueNameAnnotation,
-  Os as getBlueNodeAnnotation,
-  xn as getBlueObjectItems,
-  $n as getBlueObjectProperties,
-  _n as getBlueObjectTypeLabel,
-  Ln as getBlueObjectValue,
-  Ds as getTypeBlueIdAnnotation,
-  Xr as hasBlueObjectBlueIdDefined,
-  qr as hasBlueObjectItemsDefined,
-  bn as hasBlueObjectNameDefined,
-  Qr as hasBlueObjectTypeDefined,
-  es as hasBlueObjectValueDefined,
-  ft as isBigDecimalNumber,
+  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,
   oe as isBigIntegerNumber,
-  R as isBigNumber,
-  vr as isBlueNodeSchema,
-  Sn as isBlueObject,
-  Ti as isBlueObjectResolved,
-  En as isGivenBlueObjectTypeSchema,
-  pr as isJsonBlueArray,
-  hr as isJsonBlueObject,
-  Nn as isJsonBlueValue,
-  Ye as isUrl,
-  Je as jsonBlueValueSchema,
-  jn as normalizeToBlueObject,
-  Fn as reindexRepositoryForSemanticStorage,
-  kt as resolveBlueObjectItems,
-  Un as validateRepositorySemanticStorage,
-  Ss as withBlueDescription,
-  Ns as withBlueId,
-  Rs as withBlueName,
-  Vs as withBlueNode,
-  xs as withTypeBlueId,
-  qs as yamlBlueDump,
+  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,
   ae as yamlBlueParse
 };