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

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 { 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 ze, ZodEnum as jr, ZodNativeEnum as Fr, ZodIntersection as Ur, ZodUnion as zr, ZodObject as Kr, ZodRecord as kr } 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 { OBJECT_CONTRACTS as z, 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 pe from "js-yaml";
-class D extends G {
+class x 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", Et = [
   ie,
   ne,
-  z,
+  K,
   we,
   Se,
   be,
@@ -47,7 +47,7 @@ const ie = "name", ne = "description", z = "type", we = "itemType", Se = "keyTyp
   Nt.map((i, e) => [i, fe[e]])
 ), rt = Object.fromEntries(
   fe.map((i, e) => [i, Nt[e]])
-), In = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+), Bn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   BASIC_TYPES: et,
   BASIC_TYPE_BLUE_IDS: Rt,
@@ -67,7 +67,7 @@ const ie = "name", ne = "description", z = "type", we = "itemType", Se = "keyTyp
   LIST_TYPE_BLUE_ID: tt,
   OBJECT_BLUE: Le,
   OBJECT_BLUE_ID: V,
-  OBJECT_CONTRACTS: K,
+  OBJECT_CONTRACTS: z,
   OBJECT_DESCRIPTION: ne,
   OBJECT_ITEMS: Y,
   OBJECT_ITEM_TYPE: we,
@@ -76,7 +76,7 @@ const ie = "name", ne = "description", z = "type", we = "itemType", Se = "keyTyp
   OBJECT_NAME: ie,
   OBJECT_SCHEMA: sr,
   OBJECT_SPECIFIC_KEYS: Et,
-  OBJECT_TYPE: z,
+  OBJECT_TYPE: K,
   OBJECT_VALUE: W,
   OBJECT_VALUE_TYPE: be,
   TEXT_TYPE: nr,
@@ -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 x(this.value), r = parseFloat(t.toString());
+        return new x(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 x(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;
   }
@@ -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 x)
       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 Pn = 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"
@@ -445,15 +445,15 @@ const vn = y.string().max(Be.MAX_BLUE_ID_LENGTH, {
   name: y.string().optional(),
   description: y.string().optional(),
   type: Ve.optional()
-}), Tn = st.extend({
+}), wn = st.extend({
   value: y.string().optional()
-}), Bn = st.extend({
+}), Sn = st.extend({
   value: y.number().optional()
-}), Pn = st.extend({
+}), bn = st.extend({
   value: y.boolean().optional()
-}), wn = st.extend({
+}), En = st.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(
+}), Nn = (i) => Ve.safeParse(i).success, Xr = (i) => p(i) && "blueId" in i && p(i.blueId), Cn = (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), Rn = (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 x, ts = y.lazy(
   () => y.record(Je)
 ), rs = y.lazy(
   () => y.union([
@@ -467,7 +467,7 @@ const vn = y.string().max(Be.MAX_BLUE_ID_LENGTH, {
     rs,
     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);
+), hr = (i) => er(i) && !tr(i) && !Wt(i) && !R(i), pr = (i) => tr(i) || Wt(i), An = (i) => pr(i) || hr(i) || R(i) || Gt(i);
 class m {
   static deserialize(e) {
     return m.handleNode(e);
@@ -501,7 +501,7 @@ class m {
               t.setDescription(n);
             }
             break;
-          case z:
+          case K:
             t.setType(m.handleNode(n));
             break;
           case we:
@@ -552,7 +552,7 @@ class m {
         return t.lt(r) ? new A(r.toString()) : t.gt(s) ? new A(s.toString()) : t;
       } else {
         const t = parseFloat(e.toString());
-        return new D(t.toString());
+        return new x(t.toString());
       }
     else if (typeof e == "boolean")
       return e;
@@ -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 x ? e : new x(e.toString());
     return new u().setType(new u().setBlueId(ee)).setValue(t);
   }
   /**
@@ -772,7 +772,7 @@ class E {
   }
 }
 const Ie = "$previous", ce = "$pos", gt = "$empty";
-class T {
+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";
@@ -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();
@@ -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], tt) && Array.isArray(e[Y]);
   }
   hasOnlyKeys(e, t) {
     return Object.keys(e).length === t.length && t.every(
@@ -1071,23 +1071,23 @@ class ps {
       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 x || R(e) ? e.toNumber() : e;
   }
   toJsonScalar(e) {
     return R(e) ? this.scalarToHashValue(e) : e;
   }
 }
-class O {
-  static INSTANCE = new O(new ls());
+class M {
+  static INSTANCE = new M(new ls());
   hasher;
   constructor(e) {
     this.hasher = new ps(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))
     );
   }
@@ -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(
@@ -1211,7 +1211,7 @@ class U {
         !1
       );
       const h = E.isEmptyNode(d) ? r[c].clone() : d;
-      a.push(T.createPositionedItem(c, h));
+      a.push(B.createPositionedItem(c, h));
     }
     for (let c = s.length; c < r.length; c++) {
       const d = new u();
@@ -1334,7 +1334,7 @@ class X {
   static RESERVED_PROPERTY_KEYS = /* @__PURE__ */ new Set([
     sr,
     St,
-    K
+    z
   ]);
   static INTERNAL_PROPERTIES_KEY = "properties";
   static validateStorageShape(e) {
@@ -1370,8 +1370,8 @@ class X {
     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 (r.insideItems && B.hasPositionProperty(e) && E.hasBlueIdOnly(B.withoutPosition(e)))
+        B.readPosition(e);
       else {
         const h = this.toPointer(t);
         throw new he(
@@ -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."
       );
@@ -1481,7 +1481,7 @@ class X {
     return e.length === 0 ? "/" : `/${e.map((t) => t.replace(/~/g, "~0").replace(/\//g, "~1")).join("/")}`;
   }
 }
-class Cn {
+class Vn {
   static convert(e) {
     const t = Ae.decode(e), r = new Uint8Array(2 + t.length);
     r[0] = 18, r[1] = 32, r.set(t, 2);
@@ -1489,7 +1489,7 @@ class Cn {
     return s[0] = 1, s[1] = 85, s.set(r, 2), "b" + new Jr.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((F) => T.get(F, r));
     if (o !== void 0 && r === "simple")
       return o;
     const l = e.getName(), a = e.getDescription();
@@ -1519,21 +1519,21 @@ class B {
     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));
+      F !== null && (c[K] = { [V]: F });
+    } 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 L = e.getBlue();
+    L !== void 0 && (c[Le] = L);
     const w = e.getProperties();
     return w !== void 0 && Object.entries(w).forEach(([F, P]) => {
-      c[F] = B.get(P, r);
+      c[F] = T.get(P, r);
     }), c;
   }
   static handleValue(e) {
@@ -1558,7 +1558,7 @@ class B {
     };
   }
 }
-class M {
+class D {
   /**
    * 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(D.transform(s, t));
     const n = r.getItemType();
     n !== void 0 && r.setItemType(
-      M.transform(n, t)
+      D.transform(n, t)
     );
     const o = r.getKeyType();
     o !== void 0 && r.setKeyType(
-      M.transform(o, t)
+      D.transform(o, t)
     );
     const l = r.getValueType();
     l !== void 0 && r.setValueType(
-      M.transform(l, t)
+      D.transform(l, t)
     );
     const a = r.getItems();
     if (a !== void 0) {
       const d = a.map(
-        (h) => M.transform(h, t)
+        (h) => D.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] = D.transform(c[f], t), h),
         {}
       );
       r.setProperties(d);
@@ -1598,7 +1598,7 @@ 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 x, fs = (i) => i.replace(/~1/g, "/").replace(/~0/g, "~");
 function Ee(i) {
   if (i === "/") return [];
   if (!i.startsWith("/"))
@@ -1640,7 +1640,7 @@ function fr(i, e, t, r = !0) {
       return i.getItems();
     case "properties":
       return i.getProperties();
-    case K:
+    case z:
       return i.getContracts();
     default:
       return;
@@ -1666,7 +1666,7 @@ function Ft(i, e, t = !0) {
       "blue",
       "items",
       "properties",
-      K
+      z
     ].includes(e))
       return r;
     if (/^-?\d+$/.test(e) && e !== "-") {
@@ -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,7 +1738,7 @@ 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);
@@ -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,7 +1811,7 @@ 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;
       }
     }
@@ -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,11 +1866,11 @@ 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) ? ys(i, e, $(t), r) : Ot(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}`);
@@ -1925,7 +1925,7 @@ function yr(i, e) {
 function gr(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;
   }
@@ -1936,10 +1936,10 @@ function ms(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;
@@ -1950,7 +1950,7 @@ function ms(i, e, t) {
 function Is(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);
@@ -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 x && (s = new x(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()));
@@ -2029,7 +2029,7 @@ function Ps(i, e) {
       return Bs(i, e.path, e.val);
   }
 }
-function Rn(i, e, t = !1) {
+function On(i, e, t = !1) {
   const r = t ? i : i.clone();
   return Ps(r, e), r;
 }
@@ -2058,7 +2058,7 @@ const Z = (i) => Ir().get(i), Ss = (i) => (e) => {
 }, bs = (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) => {
+}, Mn = (i) => Ss(i)(y.string().optional()), Es = y.union([y.string(), y.boolean()]), Ns = (i) => (e) => {
   const t = Z(e);
   return $e(e, {
     ...t,
@@ -2067,7 +2067,7 @@ const Z = (i) => Ir().get(i), Ss = (i) => (e) => {
 }, Cs = (i) => {
   const e = Z(i), t = Es.safeParse(e?.blueId);
   return t.success ? t.data : null;
-}, Vn = (i) => Ns(i ?? !0)(y.string()), Rs = (i) => (e) => {
+}, Dn = (i) => Ns(i ?? !0)(y.string()), Rs = (i) => (e) => {
   const t = Z(e);
   return $e(e, {
     ...t,
@@ -2076,7 +2076,7 @@ const Z = (i) => Ir().get(i), Ss = (i) => (e) => {
 }, As = (i) => {
   const e = Z(i);
   return p(e) && wt(e.blueName) ? e.blueName : null;
-}, On = (i) => {
+}, xn = (i) => {
   const e = y.string().optional();
   return Rs(i)(e);
 }, Vs = () => (i) => {
@@ -2088,7 +2088,7 @@ const Z = (i) => Ir().get(i), Ss = (i) => (e) => {
 }, Os = (i) => {
   const e = Z(i);
   return p(e) && p(e.blueNode) && e.blueNode === !0 ? e.blueNode : null;
-}, vr = (i) => !!Os(i), Mn = () => {
+}, vr = (i) => !!Os(i), Ln = () => {
   const i = y.instanceof(u);
   return Vs()(i);
 }, Ms = y.object({
@@ -2200,7 +2200,7 @@ function N(i, e, t) {
 }
 function Xe(i) {
   const e = i.getReferenceBlueId();
-  return e !== void 0 ? e : O.calculateBlueIdSync(
+  return e !== void 0 ? e : M.calculateBlueIdSync(
     se(i)
   );
 }
@@ -2292,11 +2292,11 @@ function Us(i, e) {
   const t = new u().setBlueId(ee);
   return N(i, t, e);
 }
-function Ks(i, e) {
+function zs(i, e) {
   const t = new u().setBlueId(re);
   return N(i, t, e);
 }
-function ze(i, e) {
+function Ke(i, e) {
   const t = new u().setBlueId(tt);
   return N(i, t, e);
 }
@@ -2304,7 +2304,7 @@ function ke(i, e) {
   const t = new u().setBlueId(Ct);
   return N(i, t, e);
 }
-function zs(i, e) {
+function Ks(i, e) {
   return et.some((t) => {
     const r = new u().setName(t);
     return N(i, r, e);
@@ -2375,7 +2375,7 @@ 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);
@@ -2408,7 +2408,7 @@ class Re {
       }
   }
 }
-function Kt(i, e) {
+function zt(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);
 }
@@ -2463,7 +2463,7 @@ class it extends Mt {
    * @returns True if the path matches the allowed path pattern, false otherwise
    */
   matchesAllowedPath(e, t) {
-    const r = Kt(e, "/"), s = Kt(t, "/");
+    const r = zt(e, "/"), s = zt(t, "/");
     if (s.length > r.length)
       return !1;
     for (let n = 1; n < s.length; n++)
@@ -2690,7 +2690,7 @@ class J extends u {
       );
     }
     const t = new mt().minimizeResolvedForHash(this);
-    return O.calculateBlueIdSync(t);
+    return M.calculateBlueIdSync(t);
   }
   /**
    * Creates a clone of this ResolvedBlueNode
@@ -2876,7 +2876,7 @@ class Ys {
         ))
           return !1;
     }
-    const I = t.getProperties(), x = r.getProperties();
+    const I = t.getProperties(), L = r.getProperties();
     if (I !== void 0) {
       const P = e.getProperties() ?? {};
       for (const [S, ot] of Object.entries(I))
@@ -2884,7 +2884,7 @@ class Ys {
           if (!this.recursiveValueComparison(
             P[S],
             ot,
-            x?.[S] ?? ot,
+            L?.[S] ?? ot,
             s
           ))
             return !1;
@@ -2978,13 +2978,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) : ke(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) : ke(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()) || ke(e, this.blue.getNodeProvider());
   }
   isImplicitListStructure(e) {
     return e.getItems() !== void 0 && e.getValue() === void 0;
@@ -3062,13 +3062,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 +3085,7 @@ class $ {
       const c = this.prepareDocument(
         this.replaceIndexedThisReferences(
           l,
-          () => $.ZERO_BLUE_ID
+          () => O.ZERO_BLUE_ID
         )
       );
       return {
@@ -3143,7 +3143,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 +3179,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 +3197,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 [
@@ -3281,7 +3281,7 @@ const dt = pe.types.float.options, Gs = {
   construct: (i) => {
     const e = i.replace(/_/g, "").toLowerCase();
     if (!Jt(e))
-      return new D(e);
+      return new x(e);
     if (dt.construct)
       return dt.construct(i);
   }
@@ -3354,10 +3354,10 @@ 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]);
       }
     }
@@ -3424,8 +3424,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((w) => w.clone()), L = new u().setItems(I);
+            this.mergeNodes(e, L, g);
           }
         }
       }
@@ -3554,7 +3554,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 +3616,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 +3629,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,29 +3644,29 @@ 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 w = 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))
           continue;
         this.enterPathSegment(r, String(I), w);
         try {
           const F = l[I];
-          l[I] = F === void 0 || T.isReplacementPayload(w) ? this.materializeForCurrentContext(w, r) : this.mergeWithContext(F, w, r);
+          l[I] = F === void 0 || B.isReplacementPayload(w) ? this.materializeForCurrentContext(w, r) : this.mergeWithContext(F, w, r);
         } finally {
           this.exitPathSegment(r);
         }
         continue;
       }
-      const x = l.length;
-      if (!(!h && !r.limits.shouldMergePathSegment(String(x), g))) {
+      const L = l.length;
+      if (!(!h && !r.limits.shouldMergePathSegment(String(L), g))) {
         if (h) {
           l.push(
             this.materializeWithoutLimits(g, r)
           );
           continue;
         }
-        this.enterPathSegment(r, String(x), g);
+        this.enterPathSegment(r, String(L), g);
         try {
           const w = this.materializeForCurrentContext(
             g,
@@ -3721,8 +3721,8 @@ class de extends Ws {
               w,
               s
             );
-          })(), x = h === void 0 ? I : this.projectListNodeToCurrentLimits(I, s);
-          x !== d && (l || (o = { ...n }, l = !0), o[a] = x);
+          })(), L = h === void 0 ? I : this.projectListNodeToCurrentLimits(I, s);
+          L !== d && (l || (o = { ...n }, l = !0), o[a] = L);
         } finally {
           this.exitPathSegment(s);
         }
@@ -3736,7 +3736,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)
@@ -3842,7 +3842,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) {
@@ -3937,7 +3937,7 @@ class Nr {
         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
@@ -3954,7 +3954,7 @@ class Nr {
 class Cr {
   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;
@@ -3966,7 +3966,7 @@ class Cr {
         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
@@ -3986,7 +3986,7 @@ class Cr {
           a,
           r
         )) {
-          const f = B.get(h), g = B.get(
+          const f = T.get(h), g = T.get(
             a
           );
           throw new Error(
@@ -4026,7 +4026,7 @@ class Rr {
         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
@@ -4050,7 +4050,7 @@ class Rr {
         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
@@ -4077,7 +4077,7 @@ class Rr {
         const s = Number.parseFloat(e);
         if (Number.isNaN(s))
           throw new Error(`Key '${e}' is not a valid Number.`);
-      } else if (Ks(t, r)) {
+      } else if (zs(t, r)) {
         if (e.toLowerCase() !== "true" && e.toLowerCase() !== "false")
           throw new Error(`Key '${e}' is not a valid Boolean.`);
       } else
@@ -4088,7 +4088,7 @@ 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);
+      const n = T.get(s), o = T.get(t);
       throw new Error(
         `Value of type '${JSON.stringify(
           n
@@ -4105,7 +4105,7 @@ class Ar {
   }
   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(
@@ -4129,7 +4129,7 @@ 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,
@@ -4159,7 +4159,7 @@ class He {
   }
   /** @internal */
   createCyclicSetIdentityService() {
-    return new $({
+    return new O({
       prepareDocument: (e) => this.prepareCyclicDocument(e),
       calculateBlueId: (e) => this.hashCyclicPrepared(e)
     });
@@ -4211,17 +4211,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,7 +4231,7 @@ 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,
@@ -4255,7 +4255,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,13 +4265,13 @@ 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) {
@@ -4310,7 +4310,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 +4357,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;
+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 ze;
 class Or {
   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) ? li(t) && E.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : s : Q === r ? this.convertFromString(String(s), t) : ee === r || s instanceof x ? this.convertFromBigDecimal(
+      new x(s?.toString()),
       t
     ) : te === r || s instanceof A ? this.convertFromBigInteger(
       new A(s?.toString()),
@@ -4376,7 +4376,7 @@ class Or {
       return Number(e);
     if (t instanceof Ue)
       return e.toLowerCase() === "true";
-    if (t instanceof Ke)
+    if (t instanceof ze)
       return BigInt(e);
     throw new Error(`Cannot convert String to ${t._def.typeName}`);
   }
@@ -4390,7 +4390,7 @@ class Or {
   static convertFromBigInteger(e, t) {
     if (t instanceof me)
       return e.toNumber();
-    if (t instanceof Ke)
+    if (t instanceof ze)
       return BigInt(e.toString());
     if (t instanceof ge)
       return e.toString();
@@ -4403,7 +4403,7 @@ class Or {
       return e.toString();
     if (t instanceof me)
       return Number(e);
-    if (t instanceof Ke)
+    if (t instanceof ze)
       return BigInt(e);
     throw new Error(`Cannot convert Boolean to ${t._def.typeName}`);
   }
@@ -4437,15 +4437,15 @@ class ci {
       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)
+      throw new Error("Union not supported");
+    if (t instanceof Kr)
       return Object.keys(t.shape).reduce(
         (s, n) => {
           const o = e.getProperties(), l = t.shape[n], a = Cs(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 = wt(a) ? a : n, I = o?.[g], L = I ? this.calculateBlueId(I) : void 0;
+            return s[n] = L, s;
           }
           const c = As(l);
           if (p(c)) {
@@ -4527,12 +4527,12 @@ class hi {
 }
 class pi {
   convert(e) {
-    return B.get(e);
+    return T.get(e);
   }
 }
 class fi {
   convert(e) {
-    return B.get(e);
+    return T.get(e);
   }
 }
 class yi {
@@ -4620,15 +4620,15 @@ class Ii {
 }
 class vi {
   static get(e, t = {}) {
-    const { strategy: r = "official" } = t, s = B.get(e, r);
+    const { strategy: r = "official" } = t, s = T.get(e, r);
     return qs(s);
   }
 }
-const zt = async (i) => {
+const Kt = async (i) => {
   if (Xr(i))
     return i;
   try {
-    const e = Je.parse(i), { Blue: t } = await Promise.resolve().then(() => Xi), r = await new t().calculateBlueId(e);
+    const e = Je.parse(i), { Blue: t } = await Promise.resolve().then(() => en), r = await new t().calculateBlueId(e);
     return {
       ...i,
       blueId: r
@@ -4636,12 +4636,12 @@ 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(
+}, _n = (i) => i?.items, jn = (i) => i?.value, Fn = (i) => v(i) ? {} : rr(
   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) => {
+), Un = (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, zn = (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(
@@ -4654,7 +4654,7 @@ const zt = async (i) => {
     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 Yr(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])) {
@@ -4668,7 +4668,7 @@ 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({
           ...i,
@@ -4697,7 +4697,7 @@ class Bi {
    * @returns The processed document
    */
   process(e) {
-    return M.transform(e, this.inferType.bind(this));
+    return D.transform(e, this.inferType.bind(this));
   }
   /**
    * Infer a basic type for a node
@@ -4735,7 +4735,7 @@ class qe {
    * @returns The processed document
    */
   process(e) {
-    return M.transform(e, this.transformNode.bind(this));
+    return D.transform(e, this.transformNode.bind(this));
   }
   transformNode(e) {
     const t = e.clone();
@@ -4762,7 +4762,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 D.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;
@@ -5272,7 +5272,7 @@ class Te {
         t
       );
       return n = c.blueId, o = c.nodes.map(
-        (d) => B.get(d)
+        (d) => T.get(d)
       ), new je(
         n,
         o,
@@ -5282,12 +5282,12 @@ 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);
   }
   static parseAndCalculateBlueIdForNode(e, t, r) {
-    const s = r.prepareStorageNode(e, t), n = B.get(s.node);
+    const s = r.prepareStorageNode(e, t), n = T.get(s.node);
     return new je(s.blueId, n, !1);
   }
   static parseAndCalculateBlueIdForNodeList(e, t, r) {
@@ -5297,7 +5297,7 @@ class Te {
       e,
       t
     ), n = s.nodes.map(
-      (l) => B.get(l)
+      (l) => T.get(l)
     ), o = !0;
     return new je(
       s.blueId,
@@ -5419,6 +5419,16 @@ class Dr extends Ei {
     ]);
   }
 }
+function Ni(i) {
+  return Array.isArray(i) ? Ci(i) : i;
+}
+function Ci(i) {
+  const e = i.map((t) => m.deserialize(t));
+  return O.hasIndexedThisReference(e) ? Ri(e) : i;
+}
+function Ri(i) {
+  return new O().calculate(i).nodes.map((t) => T.get(t));
+}
 class $t extends Dr {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
@@ -5443,8 +5453,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 = Ni(n);
+          this.storeContent(
+            s,
+            o,
+            Array.isArray(o)
+          ), this.addContentNames(s, o);
+        }
       });
   }
   addContentNames(e, t) {
@@ -5512,7 +5528,7 @@ class $t extends Dr {
     };
   }
 }
-class Ni {
+class Ai {
   nodeProvider;
   blueIdToInlineValue = /* @__PURE__ */ new Map();
   constructor(e) {
@@ -5529,7 +5545,7 @@ class Ni {
    * Returns a new BlueNode where all type references are restored to inline values when possible.
    */
   restore(e) {
-    return M.transform(
+    return D.transform(
       e,
       (t) => this.restoreNode(t)
     );
@@ -5578,17 +5594,17 @@ class Ni {
       return this.blueIdToInlineValue.set(e, o), o;
   }
 }
-class Ci {
+class Vi {
   runtimes;
   contents;
   aliases;
   constructor(e) {
     const t = [];
     for (const r of e)
-      t.push(Ri(r));
+      t.push(Oi(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), zi(this.aliases, r.aliases, r.name);
   }
   getRuntimes() {
     return this.runtimes;
@@ -5635,10 +5651,10 @@ class Ci {
     }
   }
 }
-function Ri(i) {
-  const e = Ai(i);
+function Oi(i) {
+  const e = Mi(i);
   return Object.values(i.packages).forEach((t) => {
-    Vi(e, i, t);
+    Di(e, i, t);
   }), {
     name: i.name,
     repositoryVersions: i.repositoryVersions,
@@ -5653,7 +5669,7 @@ function Ri(i) {
     typePackageByCurrentBlueId: e.typePackageByCurrentBlueId
   };
 }
-function Ai(i) {
+function Mi(i) {
   const e = Object.fromEntries(
     i.repositoryVersions.map((r, s) => [r, s])
   ), t = i.repositoryVersions[i.repositoryVersions.length - 1];
@@ -5670,23 +5686,23 @@ function Ai(i) {
     currentRepoBlueId: t
   };
 }
-function Vi(i, e, t) {
+function Di(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), xi(i, t), Li(i, e, t), $i(i, t), _i(i, t);
 }
-function Oi(i, e) {
+function xi(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 Li(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 = ji(
       s,
       e,
       r,
@@ -5703,17 +5719,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 _i(i, e) {
   i.schemas.push(...Object.values(e.schemas));
 }
-function Li(i, e, t, r) {
+function ji(i, e, t, r) {
   if (i.status === bt)
-    return $i(i, e, t, r), {
+    return Fi(i, e, t, r), {
       ...i,
       versions: i.versions ? [...i.versions] : i.versions
     };
@@ -5736,7 +5752,7 @@ function Li(i, e, t, r) {
       );
     n.add(o.repositoryVersionIndex);
     for (const l of o.attributesAdded ?? [])
-      _i(
+      Ui(
         l,
         e.name,
         t,
@@ -5747,7 +5763,7 @@ function Li(i, e, t, r) {
     versions: s
   };
 }
-function $i(i, e, t, r) {
+function Fi(i, e, t, r) {
   if (i.status === bt) {
     if (i.versions && i.versions.length > 1)
       throw new Error(
@@ -5762,7 +5778,7 @@ function $i(i, e, t, r) {
     }
   }
 }
-function _i(i, e, t, r) {
+function Ui(i, e, t, r) {
   try {
     Wr(i);
   } catch (s) {
@@ -5772,7 +5788,7 @@ function _i(i, e, t, r) {
     );
   }
 }
-function ji(i, e, t) {
+function zi(i, e, t) {
   for (const [r, s] of Object.entries(e)) {
     const n = i[r];
     if (n && n !== s)
@@ -5782,11 +5798,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 (!ki(n, s))
         throw new Error(
           `Conflicting content for BlueId '${r}' across repositories (from ${t})`
         );
@@ -5795,13 +5811,13 @@ function Fi(i, e, t) {
     i[r] = s;
   }
 }
-function Ui(i, e) {
+function ki(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);
   return t !== void 0 && t === r;
 }
-const Ki = /* @__PURE__ */ new Set([
+const Hi = /* @__PURE__ */ new Set([
   "__proto__",
   "constructor",
   "prototype"
@@ -5810,7 +5826,7 @@ function Ht(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 Yi(i, e) {
   const t = i.indexOf("=");
   if (t === -1)
     throw ve(e, `Missing '=' in segment '${i.trim()}'`);
@@ -5823,7 +5839,7 @@ function zi(i, e) {
     throw ve(e, `Repository BlueId is empty for '${r}'`);
   return { name: r, value: s };
 }
-function ki(i) {
+function Wi(i) {
   if (i.trim().length === 0)
     return /* @__PURE__ */ Object.create(null);
   const e = /* @__PURE__ */ Object.create(null);
@@ -5831,13 +5847,13 @@ 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 } = Yi(r, i);
+    Ji(s, i), e[s] = n;
   }
   return e;
 }
-function Hi(i) {
-  return typeof i == "string" ? ki(i) : i;
+function Gi(i) {
+  return typeof i == "string" ? Wi(i) : i;
 }
 function ve(i, e) {
   return new he(
@@ -5856,11 +5872,11 @@ function ve(i, e) {
     ]
   );
 }
-function Yi(i, e) {
-  if (Ki.has(i))
+function Ji(i, e) {
+  if (Hi.has(i))
     throw ve(e, `Forbidden repository name '${i}'`);
 }
-function Wi(i, e) {
+function Zi(i, e) {
   const t = i.filter((s) => s.repositoryVersionIndex > e).sort((s, n) => n.repositoryVersionIndex - s.repositoryVersionIndex), r = [];
   for (const s of t) {
     const n = [...s.attributesAdded].sort(
@@ -5873,14 +5889,14 @@ function Wi(i, e) {
 function Yt(i) {
   return ir(i).length;
 }
-const Gi = /* @__PURE__ */ new Set([...Et]), C = {
+const Xi = /* @__PURE__ */ new Set([...Et]), C = {
   core: "core",
   noRuntime: "no-runtime",
   noTargetContext: "no-target-context",
   representable: "representable",
   unrepresentable: "unrepresentable"
 };
-class Ji {
+class qi {
   registry;
   targetRepoVersionIndexes;
   fallbackToCurrentInlineDefinitions;
@@ -5889,7 +5905,7 @@ class Ji {
     this.registry = e.registry, this.targetRepoVersionIndexes = e.targetRepoVersionIndexes, this.fallbackToCurrentInlineDefinitions = e.fallbackToCurrentInlineDefinitions;
   }
   transform(e) {
-    return M.transform(
+    return D.transform(
       e,
       (t) => this.transformNode(t)
     );
@@ -6030,7 +6046,7 @@ class Ji {
     };
   }
   getDropPointers(e, t) {
-    return e.status !== Ce ? [] : Wi(e.versions, t);
+    return e.status !== Ce ? [] : Zi(e.versions, t);
   }
   applyDropPointers(e, t, r = {}) {
     if (e.length === 0 || t.length === 0)
@@ -6043,7 +6059,7 @@ 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 && !Xi.has(r)
     ).map(([, r]) => r) : [];
   }
   deletePropertyAtPointer(e, t, r) {
@@ -6059,7 +6075,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 +6132,7 @@ class Ji {
     try {
       const o = m.deserialize(n);
       o.setBlueId(void 0);
-      const l = M.transform(
+      const l = D.transform(
         o,
         (a) => this.transformNode(a)
       );
@@ -6150,7 +6166,7 @@ class Ji {
     const c = {
       code: _.REPO_UNREPRESENTABLE_IN_TARGET_VERSION,
       message: t,
-      locationPath: [z],
+      locationPath: [K],
       context: a
     };
     return new he(
@@ -6161,7 +6177,7 @@ class Ji {
   }
 }
 function Bt(i, e) {
-  return e ? M.transform(i, (t) => (Fe(
+  return e ? D.transform(i, (t) => (Fe(
     () => t.getType(),
     (r) => t.setType(r),
     e
@@ -6189,7 +6205,7 @@ function Fe(i, e, t) {
   const n = t.toCurrentBlueId(s);
   n !== s && e(r.clone().setBlueId(n));
 }
-class Zi {
+class Qi {
   registry;
   blueIdMapper;
   constructor(e) {
@@ -6200,7 +6216,7 @@ class Zi {
     if (Object.keys(r).length === 0)
       return e;
     const s = Bt(e, this.blueIdMapper);
-    return new Ji({
+    return new qi({
       registry: this.registry,
       targetRepoVersionIndexes: r,
       fallbackToCurrentInlineDefinitions: t.fallbackToCurrentInlineDefinitions !== !1
@@ -6210,7 +6226,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" ? Gi(e.repositories) : e.repositories;
     for (const [s, n] of Object.entries(r)) {
       const o = this.registry.findRuntimeByName(s);
       if (!o)
@@ -6261,7 +6277,7 @@ 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 Vi(n ?? []), this.blueContextResolver = new Qi({
       registry: this.repositoryRegistry,
       blueIdMapper: this.repositoryRegistry
     }), this.mergingProcessor = o ?? _e();
@@ -6289,7 +6305,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
@@ -6349,7 +6365,7 @@ class xe {
    * repository-backed definitions currently known to this {@link Blue} instance.
    */
   restoreInlineTypes(e) {
-    return new Ni({
+    return new Ai({
       nodeProvider: this.nodeProvider,
       blueIdsMappingGenerator: this.blueIdsMappingGenerator
     }).restore(e);
@@ -6437,7 +6453,7 @@ class xe {
     }).preprocessWithDefaultBlue(t);
   }
   transform(e, t) {
-    return M.transform(e, t);
+    return D.transform(e, t);
   }
   getNodeProvider() {
     return this.nodeProvider;
@@ -6647,11 +6663,11 @@ class xe {
     return this.globalLimits == j ? e : e == j ? this.globalLimits : nt.of(this.globalLimits, e);
   }
 }
-const Xi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const en = /* @__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" })), pt = /* @__PURE__ */ new WeakMap(), tn = 10;
+function Kn(i, e = {}) {
   const t = e.mergingProcessor === void 0;
   if (t) {
     const a = pt.get(i);
@@ -6665,16 +6681,16 @@ function Fn(i, e = {}) {
   let o = Object.fromEntries(
     r.map(({ oldBlueId: a }) => [a, a])
   );
-  const l = Qi(r.length);
+  const l = rn(r.length);
   for (let a = 0; a < l; a++) {
-    const c = rn(
+    const c = on(
       r,
       s,
       o,
       n
     );
-    if (ln(o, c)) {
-      const d = sn(i, o);
+    if (un(o, c)) {
+      const d = ln(i, o);
       return t && pt.set(i, d), d;
     }
     o = c;
@@ -6683,12 +6699,12 @@ function Fn(i, e = {}) {
     `Repository semantic reindexing did not converge after ${l} passes for ${r.length} entries.`
   );
 }
-function Un(i, e = {}) {
+function kn(i, e = {}) {
   const t = xr(i);
   if (t.length === 0)
     return;
   const r = Lr(i), s = e.mergingProcessor ?? _e(), n = new xe({
-    nodeProvider: en(t, r),
+    nodeProvider: sn(t, r),
     mergingProcessor: s
   });
   n.registerBlueIds(r);
@@ -6708,8 +6724,8 @@ function Un(i, e = {}) {
       );
   }
 }
-function Qi(i) {
-  return Math.max(qi, i + 1);
+function rn(i) {
+  return Math.max(tn, i + 1);
 }
 function xr(i) {
   const e = [];
@@ -6725,13 +6741,13 @@ function Lr(i) {
       e[r] = s;
   return e;
 }
-function en(i, e) {
+function sn(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 = nn(n, r);
       if (o === void 0)
         return [];
       const { baseBlueId: l, suffix: a } = Pt(o), c = t.get(l);
@@ -6757,7 +6773,7 @@ function en(i, e) {
     }
   };
 }
-function tn(i, e) {
+function nn(i, e) {
   const t = e.get(i);
   if (t !== void 0)
     return t;
@@ -6777,7 +6793,7 @@ function Pt(i) {
     suffix: i.slice(e)
   };
 }
-function rn(i, e, t, r) {
+function on(i, e, t, r) {
   const s = new Map(
     i.map(({ oldBlueId: c, content: d }) => [
       c,
@@ -6827,26 +6843,26 @@ function rn(i, e, t, r) {
     })
   );
 }
-function sn(i, e) {
+function ln(i, e) {
   return {
     name: i.name,
     repositoryVersions: i.repositoryVersions,
     packages: Object.fromEntries(
       Object.entries(i.packages).map(([t, r]) => [
         t,
-        nn(r, e)
+        an(r, e)
       ])
     )
   };
 }
-function nn(i, e) {
+function an(i, e) {
   return {
     name: i.name,
     aliases: $r(i.aliases, e),
     typesMeta: Object.fromEntries(
       Object.entries(i.typesMeta).map(([t, r]) => [
         e[t] ?? t,
-        on(r, e)
+        cn(r, e)
       ])
     ),
     contents: Object.fromEntries(
@@ -6866,7 +6882,7 @@ function nn(i, e) {
     )
   };
 }
-function on(i, e) {
+function cn(i, e) {
   return {
     ...i,
     versions: i.versions.map((t) => ({
@@ -6875,7 +6891,7 @@ function on(i, e) {
     }))
   };
 }
-function ln(i, e) {
+function un(i, e) {
   const t = Object.keys(i);
   return t.length !== Object.keys(e).length ? !1 : t.every((r) => i[r] === e[r]);
 }
@@ -6905,7 +6921,7 @@ function _t(i, e) {
   const [, s, n] = r;
   return `${e[s] ?? s}${n}`;
 }
-class Kn extends Dr {
+class Hn extends Dr {
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   preprocessor;
@@ -7008,7 +7024,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;
     }
@@ -7048,66 +7064,66 @@ class Kn extends Dr {
 }
 export {
   ls as Base58Sha256Provider,
-  Kn as BasicNodeProvider,
+  Hn as BasicNodeProvider,
   xe as Blue,
-  O as BlueIdCalculator,
-  Cn as BlueIdToCid,
+  M as BlueIdCalculator,
+  Vn as BlueIdToCid,
   u as BlueNode,
   k as BlueNodeTypeSchema,
   yt as JsonCanonicalizer,
   Mt as Limits,
   de as Merger,
-  Dn as MergingProcessors,
+  $n as MergingProcessors,
   Ws as NodeResolver,
   E as Nodes,
-  In as Properties,
+  Bn as Properties,
   J as ResolvedBlueNode,
   He as SemanticIdentityService,
   Hs as TypeSchemaResolver,
-  Rn as applyBlueNodePatch,
+  On 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,
+  Mn as blueDescriptionField,
+  Dn as blueIdField,
+  Pn as blueIdSchema,
+  xn as blueNameField,
+  Ln as blueNodeField,
+  bn as blueObjectBooleanValueSchema,
+  Sn as blueObjectNumberValueSchema,
   Ve as blueObjectSchema,
-  wn as blueObjectStringListItemsSchema,
-  Tn as blueObjectStringValueSchema,
+  En as blueObjectStringListItemsSchema,
+  wn as blueObjectStringValueSchema,
   Dt as createNodeProvider,
-  zt as enrichWithBlueId,
+  Kt 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,
+  _n as getBlueObjectItems,
+  Fn as getBlueObjectProperties,
+  Un as getBlueObjectTypeLabel,
+  jn as getBlueObjectValue,
   Ds as getTypeBlueIdAnnotation,
   Xr as hasBlueObjectBlueIdDefined,
   qr as hasBlueObjectItemsDefined,
-  bn as hasBlueObjectNameDefined,
+  Cn as hasBlueObjectNameDefined,
   Qr as hasBlueObjectTypeDefined,
   es as hasBlueObjectValueDefined,
   ft as isBigDecimalNumber,
   oe as isBigIntegerNumber,
   R as isBigNumber,
   vr as isBlueNodeSchema,
-  Sn as isBlueObject,
+  Nn as isBlueObject,
   Ti as isBlueObjectResolved,
-  En as isGivenBlueObjectTypeSchema,
+  Rn as isGivenBlueObjectTypeSchema,
   pr as isJsonBlueArray,
   hr as isJsonBlueObject,
-  Nn as isJsonBlueValue,
+  An as isJsonBlueValue,
   Ye as isUrl,
   Je as jsonBlueValueSchema,
-  jn as normalizeToBlueObject,
-  Fn as reindexRepositoryForSemanticStorage,
+  zn as normalizeToBlueObject,
+  Kn as reindexRepositoryForSemanticStorage,
   kt as resolveBlueObjectItems,
-  Un as validateRepositorySemanticStorage,
+  kn as validateRepositorySemanticStorage,
   Ss as withBlueDescription,
   Ns as withBlueId,
   Rs as withBlueName,