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

package/dist/{Blue-Cnkas-g6.mjs → Blue-Cr47qYiN.mjs}

@@ -8,17 +8,17 @@ import { sha256 as Ar } from "js-sha256";
 import nt from "crypto";
 import "base32.js";
 import Ee from "js-yaml";
-class D extends de {
+class x extends de {
   constructor(e) {
     super(e);
   }
 }
-class V extends de {
+class R extends de {
   constructor(e) {
     super(e);
   }
 }
-const he = "name", pe = "description", j = "type", fe = "itemType", me = "keyType", ye = "valueType", re = "value", Pe = "items", b = "blueId", Ze = "blue", bt = "constraints", St = "properties", Vr = "positional", Mr = "append-only", ge = "$previous", Xe = "$pos", Ct = "$replace", ve = "$empty", Xt = [
+const he = "name", pe = "description", j = "type", fe = "itemType", me = "keyType", ye = "valueType", re = "value", Pe = "items", b = "blueId", Ze = "blue", bt = "constraints", St = "properties", Vr = "positional", Mr = "append-only", ge = "$previous", Xe = "$pos", Ct = "$replace", Ie = "$empty", Xt = [
   he,
   pe,
   j,
@@ -37,7 +37,7 @@ const he = "name", pe = "description", j = "type", fe = "itemType", me = "keyTyp
   ge,
   Xe,
   Ct,
-  ve
+  Ie
 ], Jt = "Text", Qt = "Double", er = "Integer", tr = "Boolean", rr = "List", ir = "Dictionary", Je = [
   Jt,
   Qt,
@@ -107,7 +107,7 @@ const he = "name", pe = "description", j = "type", fe = "itemType", me = "keyTyp
   DOUBLE_TYPE_BLUE_ID: F,
   INTEGER_TYPE: er,
   INTEGER_TYPE_BLUE_ID: k,
-  LIST_CONTROL_EMPTY: ve,
+  LIST_CONTROL_EMPTY: Ie,
   LIST_CONTROL_POS: Xe,
   LIST_CONTROL_PREVIOUS: ge,
   LIST_CONTROL_REPLACE: Ct,
@@ -314,10 +314,10 @@ class d {
     const e = this.type?.getBlueId();
     if (p(e) && p(this.value)) {
       if (e === k && typeof this.value == "string")
-        return new V(this.value);
+        return new R(this.value);
       if (e === F && 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 === q && typeof this.value == "string")
         return this.value.toLowerCase() === "true";
     }
@@ -327,7 +327,7 @@ class d {
     return this.value;
   }
   setValue(e) {
-    return typeof e == "number" ? e % 1 === 0 ? this.value = new V(e.toString()) : this.value = new D(e.toString()) : this.value = e, this;
+    return typeof e == "number" ? e % 1 === 0 ? this.value = new R(e.toString()) : this.value = new x(e.toString()) : this.value = e, this;
   }
   getItems() {
     return this.items;
@@ -455,7 +455,7 @@ class d {
   }
   getAsInteger(e) {
     const t = this.get(e);
-    if (t instanceof V || t instanceof D)
+    if (t instanceof R || t instanceof x)
       return t.toNumber();
     throw new Error(
       `Value at path ${e} is not a BigInteger or BigDecimal: ${t}`
@@ -554,15 +554,15 @@ const gn = m.string().max(G.MAX_BLUE_ID_LENGTH, {
   name: m.string().optional(),
   description: m.string().optional(),
   type: mt.optional()
-}), vn = rt.extend({
-  value: m.string().optional()
 }), In = rt.extend({
+  value: m.string().optional()
+}), vn = rt.extend({
   value: m.number().optional()
 }), Tn = rt.extend({
   value: m.boolean().optional()
 }), Pn = rt.extend({
   items: m.array(m.string()).optional()
-}), L = (n) => n instanceof de, X = (n) => L(n) && n instanceof V, yt = (n) => L(n) && n instanceof D, Dr = m.lazy(
+}), D = (n) => n instanceof de, X = (n) => D(n) && n instanceof R, yt = (n) => D(n) && n instanceof x, Dr = m.lazy(
   () => m.record(gt)
 ), xr = m.lazy(
   () => m.union([
@@ -576,7 +576,7 @@ const gn = m.string().max(G.MAX_BLUE_ID_LENGTH, {
     xr,
     m.instanceof(de)
   ])
-), H = (n) => Yt(n) && !Wt(n) && !Gt(n) && !L(n), or = (n) => Wt(n) || Gt(n), Bn = (n) => or(n) || H(n) || L(n) || Cr(n), Mt = [
+), H = (n) => Yt(n) && !Wt(n) && !Gt(n) && !D(n), or = (n) => Wt(n) || Gt(n), Bn = (n) => or(n) || H(n) || D(n) || Cr(n), Mt = [
   "required",
   "minLength",
   "maxLength",
@@ -641,9 +641,9 @@ class it {
     return e.setEnum(this.enumValues?.map((t) => t.clone())), e;
   }
 }
-const zr = new V(
+const zr = new R(
   Number.MIN_SAFE_INTEGER.toString()
-), qr = new V(
+), qr = new R(
   Number.MAX_SAFE_INTEGER.toString()
 );
 class y {
@@ -806,13 +806,13 @@ class y {
       return null;
     if (typeof e == "string")
       return e;
-    if (typeof e == "number" || L(e)) {
+    if (typeof e == "number" || D(e)) {
       if (typeof e == "number" && Number.isInteger(e) && !Number.isSafeInteger(e))
         throw new Error(
           "Unquoted integers outside [-9007199254740991, 9007199254740991] must be quoted and explicitly typed as Integer."
         );
       if (X(e) || Number.isSafeInteger(e)) {
-        const t = new V(e.toString());
+        const t = new R(e.toString());
         if (t.lt(zr) || t.gt(qr))
           throw new Error(
             "Unquoted integers outside [-9007199254740991, 9007199254740991] must be quoted and explicitly typed as Integer."
@@ -820,7 +820,7 @@ class y {
         return t;
       } else {
         const t = parseFloat(e.toString());
-        return new D(t.toString());
+        return new x(t.toString());
       }
     } else if (typeof e == "boolean")
       return e;
@@ -919,7 +919,7 @@ class y {
         `schema.${e} must be numeric or an explicit numeric scalar node.`
       );
     }
-    if (typeof t != "number" && !L(t))
+    if (typeof t != "number" && !D(t))
       throw new Error(
         `schema.${e} must be numeric or an explicit numeric scalar node.`
       );
@@ -927,8 +927,34 @@ class y {
   static isExplicitNumericValue(e) {
     if (!y.isExplicitSchemaScalar(e, !0))
       return !1;
-    const t = e.getValue(), r = e.getType();
-    return L(t) || typeof t == "number" ? r === void 0 || y.isNumericType(r) : !1;
+    const t = e.getRawValue(), r = e.getType();
+    return r === void 0 ? D(t) || typeof t == "number" : y.isIntegerType(r) ? y.isIntegerSchemaValue(t) : y.isDoubleType(r) ? y.isDoubleSchemaValue(t) : !1;
+  }
+  static isIntegerSchemaValue(e) {
+    if (typeof e == "number")
+      return Number.isInteger(e);
+    if (D(e))
+      return e.mod(1).eq(0);
+    if (typeof e == "string")
+      try {
+        return new R(e).mod(1).eq(0);
+      } catch {
+        return !1;
+      }
+    return !1;
+  }
+  static isDoubleSchemaValue(e) {
+    if (typeof e == "number")
+      return Number.isFinite(e);
+    if (D(e))
+      return !0;
+    if (typeof e == "string")
+      try {
+        return new x(e), !0;
+      } catch {
+        return !1;
+      }
+    return !1;
   }
   static isExplicitSchemaScalar(e, t) {
     const r = e.getType();
@@ -937,8 +963,11 @@ class y {
   static isScalarType(e) {
     return y.isCoreType(e, $, "Text") || y.isCoreType(e, k, "Integer") || y.isCoreType(e, F, "Double") || y.isCoreType(e, q, "Boolean");
   }
-  static isNumericType(e) {
-    return y.isCoreType(e, k, "Integer") || y.isCoreType(e, F, "Double");
+  static isIntegerType(e) {
+    return y.isCoreType(e, k, "Integer");
+  }
+  static isDoubleType(e) {
+    return y.isCoreType(e, F, "Double");
   }
   static isCoreType(e, t, r) {
     return e.getBlueId() === t || e.isInlineValue() && e.getValue() === r;
@@ -964,7 +993,7 @@ function Gr() {
 }
 var Hr = Gr();
 const Yr = /* @__PURE__ */ Kr(Hr);
-class vt {
+class It {
   static canonicalize(e) {
     return Yr(e);
   }
@@ -1003,7 +1032,7 @@ class Wr {
     return Le.encode(r);
   }
   canonicalizeInput(e) {
-    const t = vt.canonicalize(e);
+    const t = It.canonicalize(e);
     if (typeof t != "string")
       throw new Error("Canonized value must be a string");
     return t;
@@ -1032,10 +1061,10 @@ class Wr {
 }
 class cr {
   static toCanonicalDoubleValue(e) {
-    const t = e instanceof D || e instanceof V ? e.toNumber() : typeof e == "number" ? e : typeof e == "string" ? Number(e) : Number.NaN;
+    const t = e instanceof x || e instanceof R ? e.toNumber() : typeof e == "number" ? e : typeof e == "string" ? Number(e) : Number.NaN;
     if (!Number.isFinite(t))
       throw new Error("Double value must be finite.");
-    return new D(t.toString());
+    return new x(t.toString());
   }
   static isExactBinary64Multiple(e, t) {
     const r = be.fromNumber(
@@ -1046,7 +1075,7 @@ class cr {
     return r.dividedByIsInteger(i);
   }
   static toFiniteNumber(e) {
-    const t = e instanceof D || e instanceof V ? e.toNumber() : typeof e == "number" ? e : Number.NaN;
+    const t = e instanceof x || e instanceof R ? e.toNumber() : typeof e == "number" ? e : Number.NaN;
     if (!Number.isFinite(t))
       throw new Error("Double value must be finite.");
     return t;
@@ -1088,7 +1117,7 @@ function Zr(n, e) {
 function Ut(n) {
   return n < 0n ? -n : n;
 }
-const Xr = new V(Number.MIN_SAFE_INTEGER.toString()), Jr = new V(Number.MAX_SAFE_INTEGER.toString());
+const Xr = new R(Number.MIN_SAFE_INTEGER.toString()), Jr = new R(Number.MAX_SAFE_INTEGER.toString());
 class le {
   static get(e) {
     return this.getNode(e, "/", "root", -1, !1);
@@ -1123,7 +1152,7 @@ class le {
   }
   static getNode(e, t, r, i, s) {
     if (this.validateBlueIdInput(e, t, r, i), r === "list-element" && this.isEmptyPlaceholder(e))
-      return { [ve]: !0 };
+      return { [Ie]: !0 };
     if (this.isReferenceOnly(e)) {
       const f = this.validateReferenceBlueId(
         e.getReferenceBlueId(),
@@ -1288,7 +1317,7 @@ class le {
         throw new Error(
           `Direct BlueId input must use { "$empty": true } for empty list placeholders. Path: ${t}`
         );
-      if (e.getProperties()?.[ve] !== void 0 && this.validateEmptyPlaceholder(e, t), e.getPreviousBlueId() !== void 0 && i !== 0)
+      if (e.getProperties()?.[Ie] !== void 0 && this.validateEmptyPlaceholder(e, t), e.getPreviousBlueId() !== void 0 && i !== 0)
         throw new Error(
           `"$previous" must appear only as the first list item. Path: ${t}`
         );
@@ -1320,10 +1349,10 @@ class le {
   static handleValue(e, t) {
     if (t === F)
       return cr.toCanonicalDoubleValue(e).toNumber();
-    if (e instanceof V || X(e))
+    if (e instanceof R || X(e))
       return e.lt(Xr) || e.gt(Jr) ? e.toString() : e.toNumber();
     const r = e;
-    if (r instanceof D || L(r))
+    if (r instanceof x || D(r))
       return r.toNumber();
     if (typeof e == "string" || typeof e == "boolean")
       return e;
@@ -1332,9 +1361,9 @@ class le {
   static inferTypeBlueId(e) {
     if (typeof e == "string")
       return $;
-    if (e instanceof V || X(e))
+    if (e instanceof R || X(e))
       return k;
-    if (e instanceof D || L(e))
+    if (e instanceof x || D(e))
       return F;
     if (typeof e == "boolean")
       return q;
@@ -1361,7 +1390,7 @@ class le {
     return e.getName() === void 0 && e.getDescription() === void 0 && e.getType() === void 0 && e.getItemType() === void 0 && e.getKeyType() === void 0 && e.getValueType() === void 0 && (e.getValue() === void 0 || e.getValue() === null) && e.getItems() === void 0 && this.ordinaryPropertyKeys(e).length === 0 && e.getContractsNode() === void 0 && e.getReferenceBlueId() === void 0 && e.getSchema() === void 0 && e.getMergePolicy() === void 0 && e.getPreviousBlueId() === void 0 && e.getPosition() === void 0 && e.getBlue() === void 0;
   }
   static isEmptyPlaceholder(e) {
-    const t = e.getProperties(), r = t?.[ve];
+    const t = e.getProperties(), r = t?.[Ie];
     return t !== void 0 && Object.keys(t).length === 1 && r !== void 0 && r.getValue() === !0 && r.getItems() === void 0 && Object.keys(r.getProperties() ?? {}).length === 0;
   }
   static validateEmptyPlaceholder(e, t) {
@@ -1541,7 +1570,7 @@ const N = {
   BLUE: "blue",
   ITEMS: "items"
 };
-class A {
+class V {
   /**
    * Check if a node is empty (has no fields set)
    */
@@ -1579,14 +1608,14 @@ class A {
    * Create an integer node
    */
   static integerNode(e) {
-    const t = e instanceof V ? e : new V(e.toString());
+    const t = e instanceof R ? e : new R(e.toString());
     return new d().setType(new d().setBlueId(k)).setValue(t);
   }
   /**
    * 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 d().setType(new d().setBlueId(F)).setValue(t);
   }
   /**
@@ -1645,7 +1674,7 @@ class A {
     }
   }
 }
-const lt = "$previous", Me = "$pos", It = "$empty";
+const lt = "$previous", Me = "$pos", vt = "$empty";
 class B {
   static getMergePolicy(e, t) {
     const r = this.getMergePolicyValue(e);
@@ -1691,15 +1720,15 @@ class B {
   static hasEmptyProperty(e) {
     return Object.prototype.hasOwnProperty.call(
       e.getProperties() ?? {},
-      It
+      vt
     );
   }
   static isEmptyItem(e) {
-    const t = e.getProperties(), r = t?.[It];
-    return t !== void 0 && Object.keys(t).length === 1 && r !== void 0 && A.hasFieldsAndMayHaveFields(
+    const t = e.getProperties(), r = t?.[vt];
+    return t !== void 0 && Object.keys(t).length === 1 && r !== void 0 && V.hasFieldsAndMayHaveFields(
       e,
       /* @__PURE__ */ new Set([N.PROPERTIES])
-    ) && A.hasFieldsAndMayHaveFields(
+    ) && V.hasFieldsAndMayHaveFields(
       r,
       /* @__PURE__ */ new Set([N.VALUE]),
       /* @__PURE__ */ new Set([N.TYPE])
@@ -1709,10 +1738,10 @@ class B {
     if (e.getPreviousBlueId() !== void 0)
       return e.getName() === void 0 && e.getDescription() === void 0 && e.getType() === void 0 && e.getItemType() === void 0 && e.getKeyType() === void 0 && e.getValueType() === void 0 && e.getValue() === void 0 && e.getItems() === void 0 && Object.keys(e.getProperties() ?? {}).length === 0;
     const t = e.getProperties();
-    return t !== void 0 && Object.keys(t).length === 1 && A.hasFieldsAndMayHaveFields(
+    return t !== void 0 && Object.keys(t).length === 1 && V.hasFieldsAndMayHaveFields(
       e,
       /* @__PURE__ */ new Set([N.PROPERTIES])
-    ) && A.hasBlueIdOnly(t[lt]);
+    ) && V.hasBlueIdOnly(t[lt]);
   }
   static getPreviousBlueId(e) {
     if (e.getPreviousBlueId() !== void 0)
@@ -1729,13 +1758,13 @@ class B {
     const t = e.getProperties()?.[Me];
     if (t === void 0)
       return;
-    if (!A.hasFieldsAndMayHaveFields(
+    if (!V.hasFieldsAndMayHaveFields(
       t,
       /* @__PURE__ */ new Set([N.VALUE]),
       /* @__PURE__ */ new Set([N.TYPE])
     ))
       throw new Error("$pos must be a non-negative integer value.");
-    const r = t.getValue(), i = r instanceof V ? r.toNumber() : typeof r == "number" ? r : void 0;
+    const r = t.getValue(), i = r instanceof R ? r.toNumber() : typeof r == "number" ? r : void 0;
     if (i === void 0 || !Number.isInteger(i) || i < 0)
       throw new Error("$pos must be a non-negative integer value.");
     return i;
@@ -1750,7 +1779,7 @@ class B {
     return r !== void 0 && (delete r[Me], Object.keys(r).length === 0 && t.setProperties(void 0)), t;
   }
   static hasPayloadAfterRemovingPosition(e) {
-    return !A.isEmptyNode(this.withoutPosition(e));
+    return !V.isEmptyNode(this.withoutPosition(e));
   }
   static isReplacementPayload(e) {
     return p(e.getValue()) || p(e.getItems()) || p(e.getBlueId());
@@ -1940,7 +1969,7 @@ class K {
     if (p(t))
       return new d().setBlueId(t);
     const r = new d();
-    return this.reverseNode(r, e, void 0, !0), A.isEmptyNode(r) ? e.clone() : r;
+    return this.reverseNode(r, e, void 0, !0), V.isEmptyNode(r) ? e.clone() : r;
   }
   reverseItems(e, t, r) {
     const i = t.getItems();
@@ -1980,7 +2009,7 @@ class K {
         i[c],
         !1
       );
-      const h = A.isEmptyNode(u) ? r[c].clone() : u;
+      const h = V.isEmptyNode(u) ? r[c].clone() : u;
       l.push(B.createPositionedItem(c, h));
     }
     for (let c = i.length; c < r.length; c++) {
@@ -2009,7 +2038,7 @@ class K {
         a,
         l,
         !1
-      ), A.isEmptyNode(c) || (s[o] = c);
+      ), V.isEmptyNode(c) || (s[o] = c);
     }
     Object.keys(s).length > 0 && e.setProperties(s);
   }
@@ -2028,7 +2057,7 @@ class K {
     if (E(e))
       return;
     const t = e.cloneShallow().setName(void 0).setDescription(void 0).setType(void 0).setBlueId(void 0);
-    if (!A.isEmptyNode(t))
+    if (!V.isEmptyNode(t))
       return t;
   }
   /**
@@ -2051,8 +2080,8 @@ class K {
     if (p(c)) {
       const h = r.getProperties() || {};
       for (const [f, g] of Object.entries(c)) {
-        const v = h[f];
-        h[f] = v === void 0 ? g.clone() : this.mergeNodes(v, g);
+        const I = h[f];
+        h[f] = I === void 0 ? g.clone() : this.mergeNodes(I, g);
       }
       r.setProperties(h);
     }
@@ -2145,8 +2174,8 @@ class Ne {
   static validateNode(e, t, r) {
     r.insideItems && this.validateListControlItem(e, t, r.itemIndex ?? 0);
     const i = e.getReferenceBlueId();
-    if (i !== void 0 && !A.hasBlueIdOnly(e))
-      if (r.insideItems && B.hasPositionProperty(e) && A.hasBlueIdOnly(B.withoutPosition(e)))
+    if (i !== void 0 && !V.hasBlueIdOnly(e))
+      if (r.insideItems && B.hasPositionProperty(e) && V.hasBlueIdOnly(B.withoutPosition(e)))
         B.readPosition(e);
       else {
         const h = this.toPointer(t);
@@ -2235,7 +2264,7 @@ class Ne {
       "The document-level properties key is not part of the Blue language."
     ), Object.fromEntries(
       Object.entries(i).filter(
-        ([s]) => !this.RESERVED_PROPERTY_KEYS.has(s) && !(r.insideItems && (s === Me || s === It))
+        ([s]) => !this.RESERVED_PROPERTY_KEYS.has(s) && !(r.insideItems && (s === Me || s === vt))
       )
     );
   }
@@ -2302,7 +2331,7 @@ class T {
     const { strategy: r } = this.normalizeOptions(t), i = e.getValue(), s = this.handleValue(i);
     if (s !== void 0 && r === "simple")
       return s;
-    const o = e.getItems()?.map((I) => T.get(I, r));
+    const o = e.getItems()?.map((v) => T.get(v, r));
     if (o !== void 0 && r === "simple")
       return o;
     const a = e.getName(), l = e.getDescription();
@@ -2316,8 +2345,8 @@ class T {
     a !== void 0 && (c[he] = a), l !== void 0 && (c[pe] = l);
     const u = e.getType();
     if (r === "official" && i !== void 0 && u === void 0) {
-      const I = this.inferTypeBlueId(i);
-      I !== null && (c[j] = { [b]: I });
+      const v = this.inferTypeBlueId(i);
+      v !== null && (c[j] = { [b]: v });
     } else u !== void 0 && (c[j] = T.get(u, r));
     const h = e.getItemType();
     h !== void 0 && (c[fe] = T.get(h, r));
@@ -2325,12 +2354,12 @@ class T {
     f !== void 0 && (c[me] = T.get(f, r));
     const g = e.getValueType();
     g !== void 0 && (c[ye] = T.get(g, r));
-    const v = e.getMergePolicy();
-    v !== void 0 && (c[Be] = v), s !== void 0 && (c[re] = s), o !== void 0 && (c[Pe] = o);
+    const I = e.getMergePolicy();
+    I !== void 0 && (c[Be] = I), s !== void 0 && (c[re] = s), o !== void 0 && (c[Pe] = o);
     const P = e.getBlueId();
     P !== void 0 && (c[b] = P);
-    const x = e.getBlue();
-    x !== void 0 && (c[Ze] = T.get(x, r));
+    const L = e.getBlue();
+    L !== void 0 && (c[Ze] = T.get(L, r));
     const z = e.getPreviousBlueId();
     z !== void 0 && (c[ge] = { [b]: z });
     const W = e.getPosition();
@@ -2338,18 +2367,18 @@ class T {
     const J = e.getSchema();
     J !== void 0 && (c[oe] = ti.get(
       J,
-      (I) => T.get(I, r),
-      (I) => T.handleValue(I)
+      (v) => T.get(v, r),
+      (v) => T.handleValue(v)
     ));
     const Ce = e.getContractsNode();
     Ce !== void 0 && (c[C] = T.get(Ce, r));
     const S = e.getProperties();
-    return S !== void 0 && Object.entries(S).forEach(([I, Q]) => {
-      c[I] = T.get(Q, r);
+    return S !== void 0 && Object.entries(S).forEach(([v, Q]) => {
+      c[v] = T.get(Q, r);
     }), c;
   }
   static handleValue(e) {
-    if (L(e)) {
+    if (D(e)) {
       if (X(e)) {
         const t = new de(Number.MIN_SAFE_INTEGER.toString()), r = new de(Number.MAX_SAFE_INTEGER.toString());
         if (e.lt(t) || e.gt(r))
@@ -2360,7 +2389,7 @@ class T {
     return e;
   }
   static inferTypeBlueId(e) {
-    return typeof e == "string" ? $ : L(e) ? X(e) ? k : F : typeof e == "boolean" ? q : null;
+    return typeof e == "string" ? $ : D(e) ? X(e) ? k : F : typeof e == "boolean" ? q : null;
   }
   static normalizeOptions(e) {
     return typeof e == "string" ? {
@@ -2395,10 +2424,10 @@ class O {
     const l = r.getSchema();
     if (l !== void 0) {
       const h = l.clone();
-      for (const [g, v] of h.entries())
+      for (const [g, I] of h.entries())
         h.set(
           g,
-          O.transform(v, t)
+          O.transform(I, t)
         );
       const f = h.getEnum();
       f !== void 0 && h.setEnum(
@@ -2590,7 +2619,7 @@ function _t(n, e) {
   }
   return t;
 }
-function R(n, e, t) {
+function A(n, e, t) {
   const r = Ue(n), i = Ue(e), s = t[pr], o = `${r}|${i}`, a = s?.get(o);
   if (a !== void 0)
     return a;
@@ -2613,7 +2642,7 @@ function ce(n) {
   if (!fr(n))
     return n;
   const e = n.cloneShallow();
-  e.getReferenceBlueId() !== void 0 && !A.hasBlueIdOnly(e) && e.setReferenceBlueId(void 0);
+  e.getReferenceBlueId() !== void 0 && !V.hasBlueIdOnly(e) && e.setReferenceBlueId(void 0);
   const t = e.getType();
   t !== void 0 && e.setType(ce(t));
   const r = e.getItemType();
@@ -2639,7 +2668,7 @@ function ce(n) {
   ), e;
 }
 function fr(n) {
-  return n.getReferenceBlueId() !== void 0 && !A.hasBlueIdOnly(n) ? !0 : [
+  return n.getReferenceBlueId() !== void 0 && !V.hasBlueIdOnly(n) ? !0 : [
     n.getType(),
     n.getItemType(),
     n.getKeyType(),
@@ -2684,7 +2713,7 @@ function yi(n, e, t, r, i) {
 function gi(n, e) {
   return se.includes(
     e
-  ) || vi(n);
+  ) || Ii(n);
 }
 function mr(n) {
   const e = n.getType();
@@ -2694,50 +2723,50 @@ function mr(n) {
     )
   );
 }
-function vi(n) {
+function Ii(n) {
   const e = n.getName();
   return e !== void 0 && Object.prototype.hasOwnProperty.call(At, e) && n.getDescription() === void 0 && n.getType() === void 0 && n.getItemType() === void 0 && n.getKeyType() === void 0 && n.getValueType() === void 0 && n.getValue() === void 0 && n.getItems() === void 0 && n.getProperties() === void 0 && n.getContractsNode() === void 0 && n.getReferenceBlueId() === void 0 && n.getSchema() === void 0 && n.getMergePolicy() === void 0 && n.getPreviousBlueId() === void 0 && n.getPosition() === void 0 && n.getBlue() === void 0;
 }
-function Ii(n, e) {
+function vi(n, e) {
   return Rt.some((t) => {
     const r = new d().setBlueId(t);
-    return R(n, r, e);
+    return A(n, r, e);
   });
 }
 function Ti(n, e) {
   const t = new d().setBlueId($);
-  return R(n, t, e);
+  return A(n, t, e);
 }
 function Pi(n, e) {
   const t = new d().setBlueId(k);
-  return R(n, t, e);
+  return A(n, t, e);
 }
 function Bi(n, e) {
   const t = new d().setBlueId(F);
-  return R(n, t, e);
+  return A(n, t, e);
 }
 function Ei(n, e) {
   const t = new d().setBlueId(q);
-  return R(n, t, e);
+  return A(n, t, e);
 }
 function qe(n, e) {
   const t = new d().setBlueId(Qe);
-  return R(n, t, e);
+  return A(n, t, e);
 }
 function Ke(n, e) {
   const t = new d().setBlueId(et);
-  return R(n, t, e);
+  return A(n, t, e);
 }
 function wi(n, e) {
   return Je.some((t) => {
     const r = new d().setName(t);
-    return R(n, r, e);
+    return A(n, r, e);
   });
 }
 function bi(n, e) {
   for (const t of Je) {
     const r = new d().setName(t);
-    if (R(n, r, e))
+    if (A(n, r, e))
       return t;
   }
   throw new Error(
@@ -2780,7 +2809,7 @@ class Si {
     if (p(this.nodeProvider))
       try {
         const s = new d().setBlueId(r), o = new d().setBlueId(i);
-        if (R(s, o, this.nodeProvider))
+        if (A(s, o, this.nodeProvider))
           return !0;
       } catch {
       }
@@ -2857,7 +2886,7 @@ const ut = Ee.types.float.options, Ci = {
   construct: (n) => {
     const e = n.replace(/_/g, "").toLowerCase();
     if (!Ht(e))
-      return new D(e);
+      return new x(e);
     if (ut.construct)
       return ut.construct(n);
   }
@@ -2866,19 +2895,19 @@ const ut = Ee.types.float.options, Ci = {
   construct: (n) => {
     let e = n;
     if (e.indexOf("_") !== -1 && (e = e.replace(/_/g, "")), !Ht(e))
-      return new V(e);
+      return new R(e);
     if (dt.construct)
       return dt.construct(n);
   }
 }, Ai = new Ee.Type("tag:yaml.org,2002:int", Ri), gr = Ee.CORE_SCHEMA.extend({
   implicit: [Ni, Ai]
-}), Ie = (n) => {
+}), ve = (n) => {
   const e = Ee.load(n, { schema: gr });
   return e === void 0 ? void 0 : e;
 }, Vi = (n) => Ee.dump(n, {
   schema: gr,
   replacer: (e, t) => {
-    if (L(t)) {
+    if (D(t)) {
       if (X(t)) {
         const r = new de(Number.MIN_SAFE_INTEGER.toString()), i = new de(Number.MAX_SAFE_INTEGER.toString());
         if (t.lt(r) || t.gt(i))
@@ -2888,7 +2917,7 @@ const ut = Ee.types.float.options, Ci = {
     }
     return t;
   }
-}), vr = `- type:
+}), Ir = `- type:
     blueId: 27B7fuxQCS1VAptiCPc2RMkKoutP5qxkh3uDxZ7dr6Eo
   mappings:
     Text: GX7CFUmSDrE2MzptunLCCdZwnuwwrenRQqEnHL4x3uoC
@@ -2927,7 +2956,7 @@ description: This transformation infers type details for Text, Integer, Number a
 type:
   blueId: Ct1SGRGw1i47qjzm1ruiUdSZofeV6WevPTGuieVvbRS4
 description: This transformation replaces`, xi = [
-  vr,
+  Ir,
   Mi,
   Oi,
   Di
@@ -2942,7 +2971,7 @@ class Li extends ae {
   }
   load() {
     for (const e of xi) {
-      const t = Ie(e);
+      const t = ve(e);
       if (t === void 0) {
         console.error(`This content file is not valid YAML: ${e}`);
         continue;
@@ -3052,7 +3081,7 @@ class jt extends ae {
     ].filter((t) => t !== void 0);
   }
 }
-const Ir = Symbol.for(
+const vr = Symbol.for(
   "blue.repositoryBasedNodeProvider"
 );
 class ue {
@@ -3079,7 +3108,7 @@ class ue {
     return new ht(e);
   }
   static isUnverified(e) {
-    return e instanceof ht || e[Ir] === !0 ? !0 : e instanceof Ae && e.getNodeProviders().some((t) => this.isUnverified(t));
+    return e instanceof ht || e[vr] === !0 ? !0 : e instanceof Ae && e.getNodeProviders().some((t) => this.isUnverified(t));
   }
   static isAlreadyWrapped(e) {
     return e instanceof Ae ? e.getNodeProviders().some(
@@ -3566,7 +3595,7 @@ class Fi {
     if (l && !c) {
       const S = e.getType();
       if (S) {
-        if (!R(
+        if (!A(
           S,
           l,
           this.blue.getNodeProvider()
@@ -3584,12 +3613,12 @@ class Fi {
         } else if (!this.matchesBareBlueIdIdentity(e, u))
           return !1;
       } else {
-        const S = e.getBlueId(), I = e.getType();
-        if (I === void 0 && S !== void 0 && S !== u || I && !R(
-          I,
+        const S = e.getBlueId(), v = e.getType();
+        if (v === void 0 && S !== void 0 && S !== u || v && !A(
+          v,
           t,
           this.blue.getNodeProvider()
-        ) && !this.matchesExactTypeReference(I, t))
+        ) && !this.matchesExactTypeReference(v, t))
           return !1;
       }
     const h = e.getBlueId();
@@ -3600,48 +3629,48 @@ class Fi {
       const S = e.getValue();
       if (S === void 0)
         return !1;
-      if (L(S) && L(f)) {
+      if (D(S) && D(f)) {
         if (!S.eq(f))
           return !1;
       } else if (S !== f)
         return !1;
     }
-    const g = t.getItems(), v = r.getItems();
+    const g = t.getItems(), I = r.getItems();
     if (g !== void 0) {
       const S = e.getItems() ?? [];
-      for (let I = 0; I < g.length; I++)
-        if (I < S.length) {
+      for (let v = 0; v < g.length; v++)
+        if (v < S.length) {
           if (!this.recursiveValueComparison(
-            S[I],
-            g[I],
-            v?.[I] ?? g[I],
+            S[v],
+            g[v],
+            I?.[v] ?? g[v],
             i,
             {},
-            this.childMatcherPointer(o, String(I)),
+            this.childMatcherPointer(o, String(v)),
             a
           ))
             return !1;
-        } else if (this.requiresSemanticPresence(g[I]) || this.hasValueInNestedStructure(g[I]))
+        } else if (this.requiresSemanticPresence(g[v]) || this.hasValueInNestedStructure(g[v]))
           return !1;
     }
-    const P = t.getItemType(), x = r.getItemType();
+    const P = t.getItemType(), L = r.getItemType();
     if (P !== void 0) {
       const S = e.getItems() ?? [];
-      for (let I = 0; I < S.length; I++) {
-        const Q = S[I];
+      for (let v = 0; v < S.length; v++) {
+        const Q = S[v];
         if (!this.recursiveValueComparison(
           this.resolveUntypedNodeAgainstMatcherType(
             Q,
             P,
-            x ?? P,
+            L ?? P,
             i,
             "type-reference"
           ),
           P,
-          x ?? P,
+          L ?? P,
           i,
           { bareBlueIdMatcherMode: "type-reference" },
-          this.childMatcherPointer(o, String(I)),
+          this.childMatcherPointer(o, String(v)),
           a
         ))
           return !1;
@@ -3650,15 +3679,15 @@ class Fi {
     const z = t.getProperties(), W = r.getProperties();
     if (z !== void 0) {
       const S = e.getProperties() ?? {};
-      for (const [I, Q] of Object.entries(z))
-        if (I in S) {
+      for (const [v, Q] of Object.entries(z))
+        if (v in S) {
           if (!this.recursiveValueComparison(
-            S[I],
+            S[v],
             Q,
-            W?.[I] ?? Q,
+            W?.[v] ?? Q,
             i,
             {},
-            this.childMatcherPointer(o, I),
+            this.childMatcherPointer(o, v),
             a
           ))
             return !1;
@@ -3668,7 +3697,7 @@ class Fi {
     const J = t.getValueType(), Ce = r.getValueType();
     if (J !== void 0) {
       const S = Object.entries(e.getProperties() ?? {});
-      for (const [I, Q] of S)
+      for (const [v, Q] of S)
         if (!this.recursiveValueComparison(
           this.resolveUntypedNodeAgainstMatcherType(
             Q,
@@ -3681,7 +3710,7 @@ class Fi {
           Ce ?? J,
           i,
           { bareBlueIdMatcherMode: "type-reference" },
-          this.childMatcherPointer(o, I),
+          this.childMatcherPointer(o, v),
           a
         ))
           return !1;
@@ -3788,7 +3817,7 @@ class Fi {
       case k:
         return typeof r == "number" && Number.isInteger(r) && Number.isSafeInteger(r) || X(r);
       case F:
-        return typeof r == "number" || L(r);
+        return typeof r == "number" || D(r);
       case q:
         return typeof r == "boolean";
       default:
@@ -3827,7 +3856,7 @@ class Fi {
   }
   matchesBareBlueIdTypeReference(e, t, r) {
     const i = e.getType();
-    return i ? R(
+    return i ? A(
       i,
       t,
       this.blue.getNodeProvider()
@@ -4151,7 +4180,7 @@ class xt {
     }
     try {
       const s = e.getBlueId();
-      if (s && A.hasBlueIdOnly(e) && !se.includes(
+      if (s && V.hasBlueIdOnly(e) && !se.includes(
         s
       )) {
         const f = this.fetchNode(e);
@@ -4161,10 +4190,10 @@ class xt {
             i
           );
           if (f.length === 1) {
-            const v = f[0];
-            this.mergeNodes(e, v, g);
+            const I = f[0];
+            this.mergeNodes(e, I, g);
           } else {
-            const v = f.map((x) => x.clone()), P = new d().setItems(v);
+            const I = f.map((L) => L.clone()), P = new d().setItems(I);
             this.mergeNodes(e, P, g);
           }
         }
@@ -4396,12 +4425,12 @@ class Te extends Ui {
     }
     const f = u && o.length === 0 && !(r.limits instanceof ee), g = /* @__PURE__ */ new Set();
     for (; c < i.length; c++) {
-      const v = i[c];
-      if (B.hasPreviousProperty(v))
+      const I = i[c];
+      if (B.hasPreviousProperty(I))
         throw new Error(
           "$previous list control is allowed only as the first item."
         );
-      const P = B.readPosition(v);
+      const P = B.readPosition(I);
       if (P !== void 0) {
         if (a === "append-only")
           throw new Error("$pos is not allowed in append-only lists.");
@@ -4410,8 +4439,8 @@ class Te extends Ui {
             throw new Error(
               "$pos is out of range for a list without inherited items."
             );
-          const W = B.withoutPosition(v);
-          if (!B.hasPayloadAfterRemovingPosition(v))
+          const W = B.withoutPosition(I);
+          if (!B.hasPayloadAfterRemovingPosition(I))
             throw new Error("$pos list control must include an item payload.");
           this.enterPathSegment(r, String(P), W);
           try {
@@ -4434,8 +4463,8 @@ class Te extends Ui {
         if (g.has(P))
           throw new Error(`Duplicate $pos list overlay for index ${P}.`);
         g.add(P);
-        const z = B.withoutPosition(v);
-        if (!B.hasPayloadAfterRemovingPosition(v))
+        const z = B.withoutPosition(I);
+        if (!B.hasPayloadAfterRemovingPosition(I))
           throw new Error("$pos list control must include an item payload.");
         if (!r.limits.shouldMergePathSegment(String(P), z))
           continue;
@@ -4452,21 +4481,21 @@ class Te extends Ui {
         }
         continue;
       }
-      const x = l.length;
-      if (!(!f && !r.limits.shouldMergePathSegment(String(x), v))) {
+      const L = l.length;
+      if (!(!f && !r.limits.shouldMergePathSegment(String(L), I))) {
         if (f) {
           l.push(
             this.materializeWithoutLimits(
-              this.applyItemType(v, e.getItemType()),
+              this.applyItemType(I, e.getItemType()),
               r
             )
           );
           continue;
         }
-        this.enterPathSegment(r, String(x), v);
+        this.enterPathSegment(r, String(L), I);
         try {
           const z = this.materializeForCurrentContextWithItemType(
-            v,
+            I,
             r,
             e.getItemType()
           );
@@ -4505,21 +4534,21 @@ class Te extends Ui {
             l,
             c,
             i
-          ), f = h ?? u, v = this.shouldMergePropertyWithoutPreResolve(
+          ), f = h ?? u, I = this.shouldMergePropertyWithoutPreResolve(
             f,
             c,
             i
           ) ? this.mergeExistingProperty(f, c, i) : (() => {
-            const x = this.materializeForCurrentContext(
+            const L = this.materializeForCurrentContext(
               c,
               i
             );
-            return f === void 0 ? x : this.mergeObject(
+            return f === void 0 ? L : this.mergeObject(
               f,
-              x,
+              L,
               i
             );
-          })(), P = h === void 0 ? v : this.projectListNodeToCurrentLimits(v, i);
+          })(), P = h === void 0 ? I : this.projectListNodeToCurrentLimits(I, i);
           P !== u && (a || (o = { ...s }, a = !0), o[l] = P);
         } finally {
           this.exitPathSegment(i);
@@ -4771,7 +4800,7 @@ class zi {
       }
       o = e.cloneShallow().setType(s);
     } else if (s !== void 0) {
-      if (!R(
+      if (!A(
         s,
         i,
         r
@@ -4800,7 +4829,7 @@ class qi {
     if (a === void 0)
       s !== void 0 && (i = i.cloneShallow().setItemType(s));
     else if (s !== void 0) {
-      if (!R(
+      if (!A(
         s,
         a,
         r
@@ -4820,7 +4849,7 @@ class qi {
     if (l !== void 0 && c !== void 0)
       for (const u of c) {
         const h = u.getType();
-        if (h !== void 0 && !R(
+        if (h !== void 0 && !A(
           h,
           l,
           r
@@ -4876,7 +4905,7 @@ class Ki {
       if (s !== void 0)
         return this.validateBasicKeyType(s, r), e.cloneShallow().setKeyType(s);
     } else if (s !== void 0) {
-      if (this.validateBasicKeyType(s, r), !R(
+      if (this.validateBasicKeyType(s, r), !A(
         s,
         i,
         r
@@ -4900,7 +4929,7 @@ class Ki {
       if (s !== void 0)
         return e.cloneShallow().setValueType(s);
     } else if (s !== void 0) {
-      if (!R(
+      if (!A(
         s,
         i,
         r
@@ -4919,7 +4948,7 @@ class Ki {
     return e;
   }
   validateBasicKeyType(e, t) {
-    if (!Ii(e, t))
+    if (!vi(e, t))
       throw new Error(
         `Dictionary key type must be a basic type: ${JSON.stringify(
           T.get(e)
@@ -4946,7 +4975,7 @@ class Ki {
   }
   validateValueType(e, t, r) {
     const i = e.getType();
-    if (i !== void 0 && !R(i, t, r)) {
+    if (i !== void 0 && !A(i, t, r)) {
       const s = T.get(i), o = T.get(t);
       throw new Error(
         `Value of type '${JSON.stringify(
@@ -5216,7 +5245,7 @@ class pt {
         "Cannot minimize a path-limited resolved node without a source semantic BlueId."
       );
     }
-    return A.hasBlueIdOnly(e) ? e.clone() : e.isResolved() ? this.minimizeResolved(e) : this.minimizeAuthoring(e);
+    return V.hasBlueIdOnly(e) ? e.clone() : e.isResolved() ? this.minimizeResolved(e) : this.minimizeAuthoring(e);
   }
   minimizeResolved(e) {
     if (e instanceof ie && e.getCompleteness() === "path-limited")
@@ -5310,7 +5339,7 @@ class pt {
   getTopLevelSetItems(e) {
     if (Array.isArray(e))
       return e;
-    if (A.hasItemsOnly(e))
+    if (V.hasItemsOnly(e))
       return e.getItems() ?? [];
   }
   toMinimalListIdentityInput(e) {
@@ -5323,11 +5352,11 @@ class pt {
 class Pr {
   static convertValue(e, t) {
     const r = e.getType()?.getBlueId(), i = e.getValue();
-    return E(i) ? fi(t) && A.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : i : $ === r ? this.convertFromString(String(i), t) : F === r || i instanceof D ? this.convertFromBigDecimal(
-      new D(i?.toString()),
+    return E(i) ? fi(t) && V.isValidValueNode(e) ? this.getDefaultPrimitiveValue(t) : i : $ === r ? this.convertFromString(String(i), t) : F === r || i instanceof x ? this.convertFromBigDecimal(
+      new x(i?.toString()),
       t
-    ) : k === r || i instanceof V ? this.convertFromBigInteger(
-      new V(i?.toString()),
+    ) : k === r || i instanceof R ? this.convertFromBigInteger(
+      new R(i?.toString()),
       t
     ) : q === r || typeof i == "boolean" ? this.convertFromBoolean(!!i, t) : this.convertFromString(String(i), t);
   }
@@ -5417,26 +5446,26 @@ class rs {
         (s, o) => {
           const a = e.getProperties(), l = r.shape[o], c = ai(l);
           if (p(c)) {
-            const v = Et(c) ? c : o, P = a?.[v], x = P ? this.calculateBlueId(P) : void 0;
-            return s[o] = x, s;
+            const I = Et(c) ? c : o, P = a?.[I], L = P ? this.calculateBlueId(P) : void 0;
+            return s[o] = L, s;
           }
           const u = ci(l);
           if (p(u)) {
-            const v = a?.[u];
-            return s[o] = v?.getName(), s;
+            const I = a?.[u];
+            return s[o] = I?.getName(), s;
           }
           const h = si(l);
           if (p(h)) {
-            const v = a?.[h];
-            return s[o] = v?.getDescription(), s;
+            const I = a?.[h];
+            return s[o] = I?.getDescription(), s;
           }
           if (o === "name") {
-            const v = e.getName();
-            return s[o] = v, s;
+            const I = e.getName();
+            return s[o] = I, s;
           }
           if (o === "description") {
-            const v = e.getDescription();
-            return s[o] = v, s;
+            const I = e.getDescription();
+            return s[o] = I, s;
           }
           const f = a?.[o];
           if (E(f))
@@ -5900,8 +5929,8 @@ class Ye {
     const h = r.getProperties();
     if (h !== void 0) {
       const f = Object.fromEntries(
-        Object.entries(h).flatMap(([g, v]) => {
-          const P = this.normalizeListPlaceholders(v, !1);
+        Object.entries(h).flatMap(([g, I]) => {
+          const P = this.normalizeListPlaceholders(I, !1);
           return this.isEmptyNode(P) || this.isNullNode(P) ? [] : [[g, P]];
         })
       );
@@ -5913,13 +5942,13 @@ class Ye {
   }
   emptyPlaceholder() {
     return new d().addProperty(
-      ve,
+      Ie,
       new d().setValue(!0)
     );
   }
   isEmptyPlaceholder(e) {
     const t = e.getProperties();
-    return t !== void 0 && Object.keys(t).length === 1 && t[ve]?.getValue() === !0;
+    return t !== void 0 && Object.keys(t).length === 1 && t[Ie]?.getValue() === !0;
   }
   isNullNode(e) {
     return e.getValue() === null && e.getName() === void 0 && e.getDescription() === void 0 && e.getType() === void 0 && e.getItems() === void 0 && e.getProperties() === void 0;
@@ -5970,7 +5999,7 @@ ${t}
    */
   loadDefaultSimpleBlue() {
     try {
-      const e = this.enrichDefaultBlue(vr), t = Ie(e);
+      const e = this.enrichDefaultBlue(Ir), t = ve(e);
       if (t)
         this.defaultSimpleBlue = y.deserialize(t);
       else
@@ -6178,7 +6207,7 @@ class gs {
     const { data: r, contentType: i } = t;
     let s;
     if (i.includes("application/json") || i.includes("text/yaml") || i.includes("application/yaml") || i.includes("text/plain"))
-      s = Ie(r);
+      s = ve(r);
     else
       throw new Error(`Unsupported content type from URL: ${i}`);
     if (s === void 0)
@@ -6268,7 +6297,7 @@ class Er {
   static parseAndCalculateBlueId(e, t, r) {
     let i;
     try {
-      const l = Ie(e);
+      const l = ve(e);
       if (l === void 0)
         throw new Error();
       i = l;
@@ -6365,7 +6394,7 @@ class Er {
     }
   }
 }
-class vs extends ae {
+class Is extends ae {
   fetchByBlueId(e) {
     const t = e.split("#")[0], r = this.fetchContentByBlueId(t);
     if (r == null)
@@ -6388,7 +6417,7 @@ class vs extends ae {
     return Array.isArray(s) ? s.map((o) => y.deserialize(o)) : [y.deserialize(s)];
   }
 }
-class Is extends vs {
+class vs extends Is {
   nameToBlueIdsMap = /* @__PURE__ */ new Map();
   /**
    * Find a node by name. Throws an error if multiple nodes are found with the same name.
@@ -6593,8 +6622,8 @@ function Ms(n) {
     i
   ) ? { [b]: i } : n;
 }
-class xe extends Is {
-  [Ir] = !0;
+class xe extends vs {
+  [vr] = !0;
   blueIdToContentMap = /* @__PURE__ */ new Map();
   blueIdToMultipleDocumentsMap = /* @__PURE__ */ new Map();
   aliasBlueIdMap = /* @__PURE__ */ new Map();
@@ -7012,7 +7041,7 @@ function Gs(n, e, t) {
 function Hs(n, e) {
   if (n === e) return !0;
   if (n === null || e === null || typeof n != "object" || typeof e != "object") return !1;
-  const t = vt.canonicalize(n), r = vt.canonicalize(e);
+  const t = It.canonicalize(n), r = It.canonicalize(e);
   return t !== void 0 && t === r;
 }
 const Lt = {
@@ -7930,19 +7959,19 @@ class nn {
     );
   }
   yamlToNode(e) {
-    const t = Ie(e);
+    const t = ve(e);
     if (!t)
       throw new Error("Failed to parse YAML to JSON");
     return this.jsonValueToNode(t);
   }
   yamlToNodeUnchecked(e) {
-    const t = Ie(e);
+    const t = ve(e);
     if (!t)
       throw new Error("Failed to parse YAML to JSON");
     return this.jsonValueToNodeUnchecked(t);
   }
   async yamlToNodeAsync(e) {
-    const t = Ie(e);
+    const t = ve(e);
     if (!t)
       throw new Error("Failed to parse YAML to JSON");
     return this.jsonValueToNodeAsync(t);
@@ -8008,7 +8037,7 @@ class nn {
     ), this.typeSchemaResolver?.setNodeProvider(this.nodeProvider), this;
   }
   getExactReferenceBlueId(e) {
-    if (!A.hasBlueIdOnly(e))
+    if (!V.hasBlueIdOnly(e))
       return;
     const t = e.getReferenceBlueId();
     return t !== void 0 && G.isPotentialBlueId(t) ? t : void 0;
@@ -8159,7 +8188,7 @@ class nn {
     if (!i)
       return !1;
     const s = new d().setReferenceBlueId(r);
-    return R(i, s, this.nodeProvider);
+    return A(i, s, this.nodeProvider);
   }
   /**
    * Checks if a BlueNode matches a BlueNode type.
@@ -8222,7 +8251,7 @@ const An = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
 export {
   H as $,
   ds as A,
-  V as B,
+  R as B,
   U as C,
   Ki as D,
   ue as E,
@@ -8230,13 +8259,13 @@ export {
   Mt as G,
   kt as H,
   Ui as I,
-  vt as J,
+  It as J,
   Te as K,
   qi as L,
   es as M,
   y as N,
   Xt as O,
-  Is as P,
+  vs as P,
   yn as Q,
   ie as R,
   Wi as S,
@@ -8244,11 +8273,11 @@ export {
   gn as U,
   ji as V,
   rt as W,
-  vn as X,
-  In as Y,
+  In as X,
+  vn as Y,
   Tn as Z,
   Pn as _,
-  D as a,
+  x as a,
   or as a0,
   Bn as a1,
   ii as a2,
@@ -8268,7 +8297,7 @@ export {
   Nn as ag,
   Vi as ah,
   Ge as ai,
-  L as aj,
+  D as aj,
   X as ak,
   yt as al,
   le as am,
@@ -8294,7 +8323,7 @@ export {
   gt as k,
   T as l,
   Ye as m,
-  A as n,
+  V as n,
   Er as o,
   w as p,
   Wr as q,
@@ -8305,6 +8334,6 @@ export {
   st as v,
   Pt as w,
   Lt as x,
-  Ie as y,
+  ve as y,
   Rn as z
 };