@blue-labs/repository-generator 4.1.1 → 5.0.0-rc.0

package/dist/{generateRepository-B7eem2l_.mjs → generateRepository-BIy5RMGX.mjs}

@@ -1,14 +1,33 @@
-import * as D from "path";
-import k from "path";
+import * as j from "path";
+import $ from "path";
 import A from "fs";
-import { Properties as G, yamlBlueParse as q, MergingProcessors as B, Blue as j, createNodeProvider as H, BlueNode as X, BlueIdCalculator as Z } from "@blue-labs/language";
-import { OBJECT_CONTRACTS as Q, RESERVED_ATTRIBUTES_POINTER_SEGMENTS as ee, validateAttributesAddedPointer as te, parsePointer as ne, OBJECT_SCHEMA as T, validateStableDoesNotDependOnDev as re } from "@blue-labs/repository-contract";
-import oe from "fast-json-patch";
-import se from "js-yaml";
-const V = /* @__PURE__ */ new Set([...G.CORE_TYPES]), x = G.CORE_TYPE_NAME_TO_BLUE_ID_MAP, O = "Blue Repository", m = {
+import { BUILTIN_RUNTIME_TYPE_NAME_TO_BLUE_ID_MAP as Q, Properties as G, yamlBlueParse as W, MergingProcessors as v, canonicalizeRepositoryContent as ee, BUILTIN_RUNTIME_TYPE_CONTENT_BY_BLUE_ID as te, Blue as U, createNodeProvider as ne, BlueNode as re, NodeProviderWrapper as oe, BlueIdCalculator as q } from "@blue-labs/language";
+import { OBJECT_CONTRACTS as se, RESERVED_ATTRIBUTES_POINTER_SEGMENTS as ie, validateAttributesAddedPointer as ae, parsePointer as ce, OBJECT_SCHEMA as k, validateStableDoesNotDependOnDev as ue } from "@blue-labs/repository-contract";
+import fe from "fast-json-patch";
+import le from "js-yaml";
+const T = {
+  ...G.CORE_TYPE_NAME_TO_BLUE_ID_MAP,
+  ...Q
+}, O = new Set(Object.keys(T)), de = /* @__PURE__ */ new Set([
+  ...G.BASIC_TYPES
+]), pe = /* @__PURE__ */ new Set([
+  "name",
+  "description",
+  "type",
+  "itemType",
+  "keyType",
+  "valueType",
+  "value",
+  "items",
+  "blueId",
+  "blue",
+  "schema",
+  "mergePolicy",
+  "contracts"
+]), x = "Blue Repository", m = {
   Dev: "dev",
   Stable: "stable"
-}, ie = /* @__PURE__ */ new Set([
+}, ye = /* @__PURE__ */ new Set([
   ".git",
   ".github",
   ".husky",
@@ -17,81 +36,100 @@ const V = /* @__PURE__ */ new Set([...G.CORE_TYPES]), x = G.CORE_TYPE_NAME_TO_BL
   ".vscode",
   ".idea"
 ]);
-function ae(e) {
+function ge(e) {
   const r = A.readdirSync(e, { withFileTypes: !0 }), n = /* @__PURE__ */ new Map();
   for (const t of r) {
-    if (!t.isDirectory() || ie.has(t.name))
+    if (!t.isDirectory() || ye.has(t.name))
       continue;
-    const o = k.join(e, t.name), s = W(o);
+    const o = $.join(e, t.name), s = J(o);
     if (s.length !== 0)
-      for (const a of s) {
-        const c = a.endsWith(".dev.blue") ? m.Dev : m.Stable, i = ce(a), f = ue(i, a), u = `${t.name}/${f}`, l = n.get(u);
+      for (const i of s) {
+        const c = i.endsWith(".dev.blue") ? m.Dev : m.Stable, a = me(i), f = he(a, i), u = `${t.name}/${f}`, l = n.get(u);
         if (l)
           throw l.status !== c ? new Error(
-            `Type ${u} has both stable and dev definitions (${l.filePath} and ${a}).`
+            `Type ${u} has both stable and dev definitions (${l.filePath} and ${i}).`
           ) : new Error(
-            `Type ${u} is defined multiple times (${l.filePath} and ${a}).`
+            `Type ${u} is defined multiple times (${l.filePath} and ${i}).`
           );
-        const y = fe(i, a);
+        const y = we(a, i);
         n.set(u, {
           packageName: t.name,
           typeName: f,
           status: c,
-          content: i,
-          filePath: a,
+          content: a,
+          filePath: i,
           references: y
         });
       }
   }
   return n;
 }
-function ce(e) {
-  const r = A.readFileSync(e, "utf8"), n = q(r);
-  if (!C(n))
+function me(e) {
+  const r = A.readFileSync(e, "utf8"), n = W(r);
+  if (!P(n))
     throw new Error(`Type file ${e} must contain a YAML object.`);
-  return n;
+  return Ie(n), n;
 }
-function ue(e, r) {
-  if (!C(e) || typeof e.name != "string")
+function he(e, r) {
+  if (!P(e) || typeof e.name != "string")
     throw new Error(`Type file ${r} is missing required "name" field.`);
   return e.name;
 }
-function W(e) {
+function J(e) {
   const r = A.readdirSync(e, { withFileTypes: !0 }), n = [];
   for (const t of r) {
     if (t.isDirectory()) {
-      n.push(...W(k.join(e, t.name)));
+      n.push(...J($.join(e, t.name)));
       continue;
     }
-    (t.name.endsWith(".blue") || t.name.endsWith(".dev.blue")) && n.push(k.join(e, t.name));
+    (t.name.endsWith(".blue") || t.name.endsWith(".dev.blue")) && n.push($.join(e, t.name));
   }
   return n;
 }
-function fe(e, r) {
+function we(e, r) {
   const n = /* @__PURE__ */ new Set(), t = (o) => {
     if (Array.isArray(o)) {
-      o.forEach((a) => t(a));
+      o.forEach((i) => t(i));
       return;
     }
-    if (!C(o))
+    if (!P(o))
       return;
-    const s = (a) => {
-      if (typeof a == "string" && !V.has(a)) {
-        if (!a.includes("/"))
+    const s = (i) => {
+      if (typeof i == "string" && !O.has(i)) {
+        if (!i.includes("/"))
           throw new Error(
-            `Invalid type reference "${a}" in ${r}. Use <Package>/<Type> for non-primitive references.`
+            `Invalid type reference "${i}" in ${r}. Use <Package>/<Type> for non-primitive references.`
           );
-        n.add(a);
+        n.add(i);
       }
     };
-    s(o.type), s(o.itemType), s(o.keyType), s(o.valueType), Object.values(o).forEach((a) => t(a));
+    s(o.type), s(o.itemType), s(o.keyType), s(o.valueType), Object.values(o).forEach((i) => t(i));
   };
   return t(e), n;
 }
-function C(e) {
+function Ie(e) {
+  const r = (n) => {
+    if (Array.isArray(n)) {
+      n.forEach((t) => r(t));
+      return;
+    }
+    if (P(n)) {
+      if (typeof n.type == "string" && de.has(n.type)) {
+        const t = Object.keys(n).find(
+          (o) => !pe.has(o)
+        );
+        if (t !== void 0)
+          throw new Error(`"${t}" is not an allowed fields here`);
+      }
+      Object.entries(n).filter(([t]) => t !== "schema").forEach(([, t]) => r(t));
+    }
+  };
+  r(e);
+}
+function P(e) {
   return typeof e == "object" && e !== null && !Array.isArray(e);
 }
-function le(e) {
+function be(e) {
   const r = /* @__PURE__ */ new Map();
   for (const [n, t] of e) {
     const o = /* @__PURE__ */ new Set();
@@ -106,81 +144,81 @@ function le(e) {
   }
   return r;
 }
-function de(e) {
+function ve(e) {
   const r = [], n = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map(), o = [], s = /* @__PURE__ */ new Set();
-  let a = 0;
-  const c = (i) => {
-    n.set(i, a), t.set(i, a), a += 1, o.push(i), s.add(i);
-    for (const u of e.get(i) ?? []) {
+  let i = 0;
+  const c = (a) => {
+    n.set(a, i), t.set(a, i), i += 1, o.push(a), s.add(a);
+    for (const u of e.get(a) ?? []) {
       if (!n.has(u)) {
         c(u), t.set(
-          i,
+          a,
           Math.min(
-            t.get(i) ?? 0,
+            t.get(a) ?? 0,
             t.get(u) ?? 0
           )
         );
         continue;
       }
       s.has(u) && t.set(
-        i,
-        Math.min(t.get(i) ?? 0, n.get(u) ?? 0)
+        a,
+        Math.min(t.get(a) ?? 0, n.get(u) ?? 0)
       );
     }
-    if (t.get(i) !== n.get(i))
+    if (t.get(a) !== n.get(a))
       return;
     const f = [];
     for (; o.length > 0; ) {
       const u = o.pop();
-      if (!u || (s.delete(u), f.push(u), u === i))
+      if (!u || (s.delete(u), f.push(u), u === a))
         break;
     }
     r.push(f.sort((u, l) => u.localeCompare(l)));
   };
-  for (const i of e.keys())
-    n.has(i) || c(i);
+  for (const a of e.keys())
+    n.has(a) || c(a);
   return r;
 }
-function pe(e) {
-  const r = de(e), n = /* @__PURE__ */ new Map();
-  r.forEach((c, i) => {
-    c.forEach((f) => n.set(f, i));
+function Ee(e) {
+  const r = ve(e), n = /* @__PURE__ */ new Map();
+  r.forEach((c, a) => {
+    c.forEach((f) => n.set(f, a));
   });
   const t = /* @__PURE__ */ new Map();
   r.forEach(
-    (c, i) => t.set(i, /* @__PURE__ */ new Set())
+    (c, a) => t.set(a, /* @__PURE__ */ new Set())
   );
-  for (const [c, i] of e) {
+  for (const [c, a] of e) {
     const f = n.get(c);
     if (f !== void 0)
-      for (const u of i) {
+      for (const u of a) {
         const l = n.get(u);
         l !== void 0 && l !== f && t.get(f)?.add(l);
       }
   }
-  const o = [], s = /* @__PURE__ */ new Set(), a = (c) => {
+  const o = [], s = /* @__PURE__ */ new Set(), i = (c) => {
     if (!s.has(c)) {
       s.add(c);
-      for (const i of t.get(c) ?? [])
-        a(i);
+      for (const a of t.get(c) ?? [])
+        i(a);
       o.push(c);
     }
   };
   for (const c of t.keys())
-    a(c);
+    i(c);
   return o.map((c) => r[c] ?? []);
 }
-function ye(e, r) {
+function Be(e, r) {
   const n = /* @__PURE__ */ new Map(), t = (o, s = /* @__PURE__ */ new Set()) => {
     if (n.has(o))
       return n.get(o) ?? !1;
     if (s.has(o))
       return !1;
     s.add(o);
-    const a = e.get(o) || /* @__PURE__ */ new Set();
-    for (const c of a) {
-      const i = r.get(c);
-      if (i && (i.status === m.Dev || t(c, s)))
+    const i = e.get(o) || /* @__PURE__ */ new Set();
+    for (const c of i) {
+      const a = r.get(c);
+      if (a && (a.status === m.Dev || t(c, s)))
         return s.delete(o), n.set(o, !0), !0;
     }
     return s.delete(o), n.set(o, !1), !1;
@@ -194,13 +232,13 @@ function ye(e, r) {
 function I(e) {
   return typeof e == "object" && e !== null && !Array.isArray(e);
 }
-function h(e) {
+function w(e) {
   return I(e) ? Object.getPrototypeOf(e) === Object.prototype : !1;
 }
 function S(e) {
   if (Array.isArray(e))
     return e.map((r) => S(r));
-  if (h(e)) {
+  if (w(e)) {
     const r = {};
     for (const [n, t] of Object.entries(e))
       r[n] = S(t);
@@ -208,18 +246,18 @@ function S(e) {
   }
   return e;
 }
-function P(e) {
+function M(e) {
   return e.map((r) => ({
     repositoryVersionIndex: r.repositoryVersionIndex,
     typeBlueId: r.typeBlueId,
     attributesAdded: [...r.attributesAdded]
   }));
 }
-const ge = /^\$\{([\s\S]*)\}$/;
-class me {
+const Ae = /^\$\{([\s\S]*)\}$/;
+class Se {
   process(r, n) {
     const t = n.getValue();
-    if (U(t)) {
+    if (L(t)) {
       const o = n.clone();
       return o.setValue(t), o.setProperties(void 0), o.setItems(void 0), o.setType(void 0), o;
     }
@@ -227,38 +265,48 @@ class me {
   }
   postProcess(r, n) {
     const t = n.getValue();
-    if (U(t) && r.getValue() !== t) {
+    if (L(t) && r.getValue() !== t) {
       const o = r.clone();
       return o.setValue(t), o;
     }
     return r;
   }
 }
-function U(e) {
-  return typeof e != "string" || !ge.test(e) ? !1 : e.indexOf("${") === e.lastIndexOf("${");
-}
-function he() {
-  return new B.SequentialMergingProcessor([
-    new B.ValuePropagator(),
-    new me(),
-    new B.TypeAssigner(),
-    new B.ListProcessor(),
-    new B.DictionaryProcessor(),
-    new B.MetadataPropagator(),
-    new B.BasicTypesVerifier()
+function L(e) {
+  return typeof e != "string" || !Ae.test(e) ? !1 : e.indexOf("${") === e.lastIndexOf("${");
+}
+function Te() {
+  return new v.SequentialMergingProcessor([
+    new v.ValuePropagator(),
+    new Se(),
+    new v.TypeAssigner(),
+    new v.ListProcessor(),
+    new v.DictionaryProcessor(),
+    new v.MetadataPropagator(),
+    new v.BasicTypesVerifier()
   ]);
 }
-const Y = "00000000000000000000000000000000000000000000";
-function we(e, r, n, t) {
-  const o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), c = new j(), i = H((l) => be(l) ? [new X().setReferenceBlueId(l)] : Ie(a, l).map(
-    (y) => c.jsonValueToNode(y)
-  )), u = { blue: new j({
-    nodeProvider: i,
-    mergingProcessor: he()
-  }), contentByBlueId: a };
+function z(e) {
+  return ee(e);
+}
+function N(e) {
+  return z(e);
+}
+const K = "00000000000000000000000000000000000000000000";
+function Pe(e, r, n, t) {
+  const o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), i = new Map(
+    Object.entries(te)
+  ), c = new U(), a = ne((l) => ke(l) ? [new re().setReferenceBlueId(l)] : Ne(i, l).map(
+    (y) => c.jsonValueToNode(
+      z(y)
+    )
+  )), u = { blue: new U({
+    nodeProvider: oe.unverified(a),
+    mergingProcessor: Te()
+  }), contentByBlueId: i };
   for (const l of e) {
-    if (Ee(l, n)) {
-      ve({
+    if (_e(l, n)) {
+      Me({
         component: l,
         discovered: r,
         previousTypes: t,
@@ -272,7 +320,7 @@ function we(e, r, n, t) {
     if (!y)
       continue;
     const g = r.get(y);
-    g && Be({
+    g && $e({
       alias: y,
       type: g,
       previousTypes: t,
@@ -283,8 +331,8 @@ function we(e, r, n, t) {
   }
   return { aliasToBlueId: o, aliasToStorageContent: s };
 }
-function Ie(e, r) {
-  const n = J(r);
+function Ne(e, r) {
+  const n = H(r);
   if (n === void 0)
     return [];
   const t = e.get(n.baseBlueId);
@@ -297,7 +345,7 @@ function Ie(e, r) {
   const o = t[n.index];
   return o === void 0 ? [] : [o];
 }
-function J(e) {
+function H(e) {
   const r = e.indexOf("#");
   if (r === -1)
     return { baseBlueId: e };
@@ -305,13 +353,13 @@ function J(e) {
   if (!(!Number.isInteger(o) || o < 0))
     return { baseBlueId: n, index: o };
 }
-function be(e) {
-  return e === Y || /^this#\d+$/.test(e);
+function ke(e) {
+  return e === K || /^this#\d+$/.test(e);
 }
-function $(e, r, n = !1, t = !1) {
+function _(e, r, n = !1, t = !1) {
   if (Array.isArray(e))
     return e.map(
-      (s) => $(
+      (s) => _(
         s,
         r,
         n,
@@ -321,24 +369,24 @@ function $(e, r, n = !1, t = !1) {
   if (!I(e))
     return e;
   const o = {};
-  for (const [s, a] of Object.entries(e)) {
-    const c = t || s === Q;
-    if ((s === "type" || s === "itemType" || s === "keyType" || s === "valueType") && typeof a == "string" && !(n && c)) {
-      if (V.has(a)) {
-        const i = x[a];
-        if (!i)
-          throw new Error(`Missing primitive BlueId for ${a}.`);
-        o[s] = { blueId: i };
+  for (const [s, i] of Object.entries(e)) {
+    const c = t || s === se;
+    if ((s === "type" || s === "itemType" || s === "keyType" || s === "valueType") && typeof i == "string" && !(n && c)) {
+      if (O.has(i)) {
+        const a = T[i];
+        if (!a)
+          throw new Error(`Missing primitive BlueId for ${i}.`);
+        o[s] = { blueId: a };
       } else {
-        const i = a, f = r(i);
+        const a = i, f = r(a);
         if (!f)
-          throw new Error(`Missing BlueId for alias ${i}.`);
+          throw new Error(`Missing BlueId for alias ${a}.`);
         o[s] = { blueId: f };
       }
       continue;
     }
-    o[s] = $(
-      a,
+    o[s] = _(
+      i,
       r,
       n,
       c
@@ -346,7 +394,7 @@ function $(e, r, n = !1, t = !1) {
   }
   return o;
 }
-function Be({
+function $e({
   alias: e,
   type: r,
   previousTypes: n,
@@ -354,18 +402,18 @@ function Be({
   aliasToStorageContent: o,
   context: s
 }) {
-  const { node: a, storageContent: c } = N(
+  const { node: i, storageContent: c } = R(
     r,
     (g) => t.get(g),
     s.blue
-  ), i = V.has(r.typeName), f = i ? Pe(r.typeName) : s.blue.calculateBlueIdSync(a), u = K(
+  ), a = O.has(r.typeName), f = a ? xe(r.typeName) : s.blue.calculateBlueIdSync(i), u = X(
     n,
     r,
     c
   ), l = u?.blueId ?? f, y = u?.content ?? c;
-  t.set(e, l), o.set(e, y), i || s.contentByBlueId.set(l, y), s.blue.registerBlueIds({ [e]: l });
+  t.set(e, l), o.set(e, y), a || s.contentByBlueId.set(l, y), s.blue.registerBlueIds({ [e]: l });
 }
-function ve({
+function Me({
   component: e,
   discovered: r,
   previousTypes: n,
@@ -373,41 +421,41 @@ function ve({
   aliasToStorageContent: o,
   context: s
 }) {
-  const a = new Set(e), c = /* @__PURE__ */ new Map();
+  const i = new Set(e), c = /* @__PURE__ */ new Map();
   e.forEach((d, p) => c.set(d, p));
-  const i = e.map((d) => {
-    const p = M(r, d), { node: b } = N(
+  const a = e.map((d) => {
+    const p = C(r, d), { node: b } = R(
       p,
-      (w) => a.has(w) ? Y : t.get(w),
+      (h) => i.has(h) ? K : t.get(h),
       s.blue
     );
     return {
       alias: d,
-      preliminaryBlueId: s.blue.calculateBlueIdSync(b)
+      preliminaryBlueId: q.calculateBlueIdAllowingCyclicPlaceholdersSync(b)
     };
   });
-  Te(i), i.sort(ke);
+  Ve(a), a.sort(Oe);
   const f = /* @__PURE__ */ new Map();
-  i.forEach(({ alias: d }, p) => {
+  a.forEach(({ alias: d }, p) => {
     f.set(d, p);
   });
   const u = /* @__PURE__ */ new Map();
   for (const d of e) {
-    const p = M(r, d), b = N(
+    const p = C(r, d), b = R(
       p,
-      (w) => {
-        if (!a.has(w))
-          return t.get(w);
-        const _ = f.get(w);
-        if (_ === void 0)
-          throw new Error(`Failed to resolve cyclic reference ${w}.`);
-        return `this#${_}`;
+      (h) => {
+        if (!i.has(h))
+          return t.get(h);
+        const D = f.get(h);
+        if (D === void 0)
+          throw new Error(`Failed to resolve cyclic reference ${h}.`);
+        return `this#${D}`;
       },
       s.blue
     );
     u.set(d, b);
   }
-  const l = Ae(
+  const l = Re(
     e,
     r,
     n,
@@ -420,97 +468,110 @@ function ve({
         throw new Error(`Failed to preserve cyclic BlueId for type ${d}.`);
       t.set(d, p.blueId), o.set(d, p.content), s.blue.registerBlueIds({ [d]: p.blueId });
     }
-    Se(s.contentByBlueId, l);
+    Ce(s.contentByBlueId, l);
     return;
   }
-  const y = i.map(({ alias: d }) => {
+  const y = a.map(({ alias: d }) => {
     const p = u.get(d);
     if (!p)
       throw new Error(`Failed to build cyclic content for type ${d}.`);
     return p.node;
-  }), g = i.map(({ alias: d }) => {
+  }), g = a.map(({ alias: d }) => {
     const p = u.get(d);
     if (!p)
       throw new Error(`Failed to build cyclic content for type ${d}.`);
     return p.storageContent;
-  }), E = s.blue.calculateBlueIdSync(y);
-  s.contentByBlueId.set(E, g), i.forEach(({ alias: d }, p) => {
+  }), B = s.blue.calculateBlueIdSync(y);
+  s.contentByBlueId.set(B, g), a.forEach(({ alias: d }, p) => {
     const b = u.get(d);
     if (!b)
       throw new Error(`Failed to build cyclic content for type ${d}.`);
-    const w = `${E}#${p}`;
-    t.set(d, w), o.set(d, b.storageContent), s.blue.registerBlueIds({ [d]: w });
+    const h = `${B}#${p}`;
+    t.set(d, h), o.set(d, b.storageContent), s.blue.registerBlueIds({ [d]: h });
   });
 }
-function Ee(e, r) {
+function _e(e, r) {
   if (e.length > 1)
     return !0;
   const n = e[0];
   return n ? r.get(n)?.has(n) ?? !1 : !1;
 }
-function N(e, r, n) {
-  const t = $(
+function R(e, r, n) {
+  const t = _(
     S(e.content),
     r
-  ), o = n.jsonValueToNode(t);
-  return {
-    node: o,
-    storageContent: n.nodeToJson(o, "official")
-  };
+  );
+  try {
+    const o = n.jsonValueToNode(t), s = N(
+      n.nodeToJson(o, "official")
+    );
+    return {
+      node: o,
+      storageContent: s
+    };
+  } catch (o) {
+    const s = o instanceof Error ? o.message : "Unknown error encountered.";
+    throw new Error(`Failed to build ${e.filePath}: ${s}`);
+  }
 }
-function M(e, r) {
+function C(e, r) {
   const n = e.get(r);
   if (!n)
     throw new Error(`Unknown type alias ${r}.`);
   return n;
 }
-function Ae(e, r, n, t) {
+function Re(e, r, n, t) {
   const o = /* @__PURE__ */ new Map();
   for (const s of e) {
-    const a = M(r, s), c = t.get(s);
+    const i = C(r, s), c = t.get(s);
     if (!c)
       throw new Error(`Failed to build cyclic content for type ${s}.`);
-    const i = K(
+    const a = X(
       n,
-      a,
+      i,
       c.storageContent
     );
-    if (!i)
+    if (!a)
       return null;
-    o.set(s, i);
+    o.set(s, a);
   }
   return o;
 }
-function K(e, r, n) {
+function X(e, r, n) {
   const t = e.get(r.packageName)?.get(r.typeName), o = t?.versions?.at(-1)?.typeBlueId;
-  return !o || !t || !h(t.content) || !R(t.content, n) ? null : {
+  if (!o || !t || !w(t.content))
+    return null;
+  const s = N(
+    t.content
+  );
+  return V(s, n) ? {
     blueId: o,
-    content: S(t.content)
-  };
+    content: S(s)
+  } : null;
 }
-function Se(e, r) {
+function Ce(e, r) {
   const n = /* @__PURE__ */ new Map();
   for (const { blueId: t, content: o } of r.values()) {
-    const s = J(t);
+    const s = H(t);
     if (!s || s.index === void 0) {
       e.set(t, o);
       continue;
     }
-    const a = n.get(s.baseBlueId) ?? [];
-    a.push({ index: s.index, content: o }), n.set(s.baseBlueId, a);
+    const i = n.get(s.baseBlueId) ?? [];
+    i.push({ index: s.index, content: o }), n.set(s.baseBlueId, i);
   }
   for (const [t, o] of n) {
-    const a = [...o].sort((c, i) => c.index - i.index).map((c, i) => {
-      if (c.index !== i)
+    const i = [...o].sort((c, a) => c.index - a.index).map((c, a) => {
+      if (c.index !== a)
         throw new Error(
-          `Cyclic repository content for ${t} is missing index ${i}.`
+          `Cyclic repository content for ${t} is missing index ${a}.`
         );
       return c.content;
     });
-    e.set(t, a);
+    e.set(t, i);
   }
 }
-function Te(e) {
+function Ve(e) {
   const r = /* @__PURE__ */ new Map();
   for (const n of e) {
     const t = r.get(n.preliminaryBlueId);
@@ -521,124 +582,124 @@ function Te(e) {
     r.set(n.preliminaryBlueId, n.alias);
   }
 }
-function ke(e, r) {
+function Oe(e, r) {
   return e.preliminaryBlueId < r.preliminaryBlueId ? -1 : e.preliminaryBlueId > r.preliminaryBlueId ? 1 : 0;
 }
-function R(e, r) {
+function V(e, r) {
   if (e === r)
     return !0;
   if (Array.isArray(e) || Array.isArray(r))
-    return !Array.isArray(e) || !Array.isArray(r) || e.length !== r.length ? !1 : e.every((n, t) => R(n, r[t]));
-  if (h(e) || h(r)) {
-    if (!h(e) || !h(r))
+    return !Array.isArray(e) || !Array.isArray(r) || e.length !== r.length ? !1 : e.every((n, t) => V(n, r[t]));
+  if (w(e) || w(r)) {
+    if (!w(e) || !w(r))
       return !1;
     const n = Object.keys(e).sort(), t = Object.keys(r).sort();
     return n.length !== t.length ? !1 : n.every(
-      (o, s) => o === t[s] && R(e[o], r[o])
+      (o, s) => o === t[s] && V(e[o], r[o])
     );
   }
   return !1;
 }
-function Pe(e) {
-  const r = x[e];
+function xe(e) {
+  const r = T[e];
   if (!r)
     throw new Error(`Missing primitive BlueId for ${e}.`);
   return r;
 }
-const F = new Set(Object.values(x)), $e = /* @__PURE__ */ new Set([
+const F = new Set(Object.values(T)), De = /* @__PURE__ */ new Set([
   "type",
   "itemType",
   "valueType",
   "keyType"
-]), Ne = /* @__PURE__ */ new Set(["name", "description"]), v = {
+]), je = /* @__PURE__ */ new Set(["name", "description"]), E = {
   Unchanged: "unchanged",
   NonBreaking: "non-breaking",
   Breaking: "breaking"
 };
-function Me(e, r, n, t, o) {
-  const s = oe.compare(
+function Ue(e, r, n, t, o) {
+  const s = fe.compare(
     e,
     r
   );
   if (s.length === 0)
-    return { status: v.Unchanged, attributesAdded: [] };
-  const a = [];
+    return { status: E.Unchanged, attributesAdded: [] };
+  const i = [];
   let c = !1;
-  for (const i of s) {
-    if (Oe(i, e, o)) {
+  for (const a of s) {
+    if (Ge(a, e, o)) {
       c = !0;
       continue;
     }
-    if (i.op !== "add")
-      return { status: v.Breaking, attributesAdded: [] };
-    if (!Ve(i))
-      return { status: v.Breaking, attributesAdded: [] };
-    a.push(i.path);
+    if (a.op !== "add")
+      return { status: E.Breaking, attributesAdded: [] };
+    if (!Fe(a))
+      return { status: E.Breaking, attributesAdded: [] };
+    i.push(a.path);
   }
-  return a.length === 0 && !c ? {
-    status: v.Breaking,
+  return i.length === 0 && !c ? {
+    status: E.Breaking,
     attributesAdded: []
-  } : (a.length > 0 && Re(a, n, t), { status: v.NonBreaking, attributesAdded: a });
+  } : (i.length > 0 && Le(i, n, t), { status: E.NonBreaking, attributesAdded: i });
 }
-function Re(e, r, n) {
+function Le(e, r, n) {
   for (const t of e)
     try {
-      te(t);
+      ae(t);
     } catch (o) {
       throw new Error(
         `Invalid attribute pointer "${t}" for ${r}/${n}: ${o.message}`
       );
     }
 }
-function Ve(e) {
+function Fe(e) {
   if (e.op !== "add")
     return !1;
-  const r = z(e.path);
+  const r = Z(e.path);
   if (r.length === 0)
     return !1;
   const n = r.at(-1);
-  return n && /^\d+$/.test(n) || n && $e.has(n) || r.some(
-    (t) => ee.has(t)
-  ) ? !1 : I(e.value) ? !xe(e.value) : n ? Ne.has(n) : !1;
+  return n && /^\d+$/.test(n) || n && De.has(n) || r.some(
+    (t) => ie.has(t)
+  ) ? !1 : I(e.value) ? !Ye(e.value) : n ? je.has(n) : !1;
 }
-function z(e) {
+function Z(e) {
   try {
-    return ne(e);
+    return ce(e);
   } catch {
     return [];
   }
 }
-function xe(e) {
+function Ye(e) {
   const r = [e];
   for (; r.length; ) {
     const n = r.pop();
     if (n) {
       if (Object.prototype.hasOwnProperty.call(n, "value") || Object.prototype.hasOwnProperty.call(n, "items"))
         return !0;
-      if (Object.prototype.hasOwnProperty.call(n, T)) {
-        const t = n[T];
+      if (Object.prototype.hasOwnProperty.call(n, k)) {
+        const t = n[k];
         if (I(t) && t.required === !0)
           return !0;
       }
       for (const [t, o] of Object.entries(n))
-        t !== T && I(o) && r.push(o);
+        t !== k && I(o) && r.push(o);
     }
   }
   return !1;
 }
-function Oe(e, r, n) {
+function Ge(e, r, n) {
   if (e.op !== "replace" || typeof e.path != "string")
     return !1;
-  const t = z(e.path);
+  const t = Z(e.path);
   if (t.length < 2)
     return !1;
   const o = t.at(-1), s = t.at(-2);
   if (!(o === "blueId" && s !== void 0 && (s === "type" || s === "itemType" || s === "keyType" || s === "valueType")))
     return !1;
-  const a = Ce(r, t), c = typeof a == "string" ? a : I(a) && typeof a.blueId == "string" ? a.blueId : null, i = typeof e.value == "string" ? e.value : I(e.value) && typeof e.value.blueId == "string" ? e.value.blueId : null;
-  if (c && F.has(c) || i && F.has(i) || !c || !i)
+  const i = We(r, t), c = typeof i == "string" ? i : I(i) && typeof i.blueId == "string" ? i.blueId : null, a = typeof e.value == "string" ? e.value : I(e.value) && typeof e.value.blueId == "string" ? e.value.blueId : null;
+  if (c && F.has(c) || a && F.has(a) || !c || !a)
     return !1;
-  const f = n.get(c), u = n.get(i);
+  const f = n.get(c), u = n.get(a);
   if (!f || !u)
     return !1;
   for (const l of f)
@@ -646,7 +707,7 @@ function Oe(e, r, n) {
       return !0;
   return !1;
 }
-function Ce(e, r) {
+function We(e, r) {
   let n = e;
   for (const t of r)
     if (Array.isArray(n)) {
@@ -660,7 +721,7 @@ function Ce(e, r) {
       return;
   return n;
 }
-function _e(e) {
+function qe(e) {
   const r = /* @__PURE__ */ new Map();
   if (!e)
     return r;
@@ -669,76 +730,76 @@ function _e(e) {
       continue;
     const t = /* @__PURE__ */ new Map();
     for (const o of n.types || []) {
-      const s = o.content, a = h(s) && typeof s.name == "string" ? s.name : void 0;
-      a && t.set(a, o);
+      const s = o.content, i = w(s) ? N(s) : s, c = w(i) && typeof i.name == "string" ? i.name : void 0;
+      c && t.set(c, { ...o, content: i });
     }
     r.set(n.name, t);
   }
   return r;
 }
-function De(e, r) {
+function Je(e, r) {
   for (const [n, t] of r)
     for (const [o, s] of t) {
-      const a = `${n}/${o}`;
-      if (!e.has(a) && s.status === m.Stable)
+      const i = `${n}/${o}`;
+      if (!e.has(i) && s.status === m.Stable)
         throw new Error(
-          `Stable type ${a} was removed. Breaking changes require a new logical type name.`
+          `Stable type ${i} was removed. Breaking changes require a new logical type name.`
         );
     }
 }
-function je({
+function ze({
   discovered: e,
   previousTypes: r,
   aliasToBlueId: n,
   aliasToStorageContent: t,
   nextRepoVersionIndex: o
 }) {
-  const s = /* @__PURE__ */ new Map(), a = Ue(r, n);
-  for (const [c, i] of e) {
+  const s = /* @__PURE__ */ new Map(), i = Ke(r, n);
+  for (const [c, a] of e) {
     const f = n.get(c);
     if (!f)
       throw new Error(`Failed to compute BlueId for type ${c}.`);
-    const u = r.get(i.packageName)?.get(i.typeName) ?? null;
-    if (u && u.status === m.Stable && i.status === m.Dev)
+    const u = r.get(a.packageName)?.get(a.typeName) ?? null;
+    if (u && u.status === m.Stable && a.status === m.Dev)
       throw new Error(
         `Type ${c} was stable previously and cannot be downgraded to dev. Use a new logical name instead.`
       );
-    const l = t.get(c) ?? i.content, y = i.status === m.Dev ? Fe({ blueId: f, nextRepoVersionIndex: o, previousType: u }) : !u || u.status === m.Dev ? Le({ blueId: f, nextRepoVersionIndex: o }) : Ge({
+    const l = t.get(c) ?? a.content, y = a.status === m.Dev ? He({ blueId: f, nextRepoVersionIndex: o, previousType: u }) : !u || u.status === m.Dev ? Xe({ blueId: f, nextRepoVersionIndex: o }) : Ze({
       alias: c,
       blueId: f,
       nextRepoVersionIndex: o,
       previousType: u,
       currentContent: l,
-      packageName: i.packageName,
-      typeName: i.typeName,
-      blueIdAliases: a
+      packageName: a.packageName,
+      typeName: a.typeName,
+      blueIdAliases: i
     });
-    y.content = l, y.status = i.status;
-    const g = s.get(i.packageName) ?? [];
-    g.push(y), s.set(i.packageName, g);
+    y.content = l, y.status = a.status;
+    const g = s.get(a.packageName) ?? [];
+    g.push(y), s.set(a.packageName, g);
   }
   return s;
 }
-function Ue(e, r) {
+function Ke(e, r) {
   const n = /* @__PURE__ */ new Map(), t = (o, s) => {
-    const a = n.get(o);
-    if (a) {
-      a.add(s);
+    const i = n.get(o);
+    if (i) {
+      i.add(s);
       return;
     }
     n.set(o, /* @__PURE__ */ new Set([s]));
   };
   for (const [o, s] of e)
-    for (const [a, c] of s) {
-      const i = `${o}/${a}`;
+    for (const [i, c] of s) {
+      const a = `${o}/${i}`;
       for (const f of c.versions ?? [])
-        typeof f.typeBlueId == "string" && t(f.typeBlueId, i);
+        typeof f.typeBlueId == "string" && t(f.typeBlueId, a);
     }
   for (const [o, s] of r)
     t(s, o);
   return n;
 }
-function Fe({
+function He({
   blueId: e,
   nextRepoVersionIndex: r,
   previousType: n
@@ -747,7 +808,7 @@ function Fe({
   return {
     status: m.Dev,
     content: {},
-    versions: s && t?.versions ? P(t.versions) : [
+    versions: s && t?.versions ? M(t.versions) : [
       {
         repositoryVersionIndex: r,
         typeBlueId: e,
@@ -756,7 +817,7 @@ function Fe({
     ]
   };
 }
-function Le({
+function Xe({
   blueId: e,
   nextRepoVersionIndex: r
 }) {
@@ -772,49 +833,51 @@ function Le({
     ]
   };
 }
-function Ge({
+function Ze({
   alias: e,
   blueId: r,
   nextRepoVersionIndex: n,
   previousType: t,
   currentContent: o,
   packageName: s,
-  typeName: a,
+  typeName: i,
   blueIdAliases: c
 }) {
-  if (!h(t.content))
+  if (!w(t.content))
     throw new Error(
       `Type ${e} has non-object content; cannot compute diff for stable versioning.`
     );
-  const i = Me(
-    t.content,
+  const a = N(
+    t.content
+  ), f = Ue(
+    a,
     o,
     s,
-    a,
+    i,
     c
   );
-  if (i.status === v.Unchanged) {
-    const f = P(t.versions || []), u = f.at(-1);
-    if (u && u.typeBlueId !== r)
+  if (f.status === E.Unchanged) {
+    const u = M(t.versions || []), l = u.at(-1);
+    if (l && l.typeBlueId !== r)
       throw new Error(
         `Type ${e} content is unchanged but BlueId differs from previous metadata.`
       );
     return {
       status: m.Stable,
       content: {},
-      versions: f
+      versions: u
     };
   }
-  if (i.status === v.NonBreaking)
+  if (f.status === E.NonBreaking)
     return {
       status: m.Stable,
       content: {},
       versions: [
-        ...P(t.versions || []),
+        ...M(t.versions || []),
         {
           repositoryVersionIndex: n,
           typeBlueId: r,
-          attributesAdded: i.attributesAdded
+          attributesAdded: f.attributesAdded
         }
       ]
     };
@@ -822,7 +885,7 @@ function Ge({
     `Breaking change detected in stable type ${e}. Introduce a new type name for breaking changes.`
   );
 }
-function qe(e) {
+function Qe(e) {
   return Array.from(e.entries()).map(([r, n]) => ({
     name: r,
     types: n.map((t) => ({
@@ -831,139 +894,135 @@ function qe(e) {
         (o, s) => o.repositoryVersionIndex - s.repositoryVersionIndex
       )
     })).sort((t, o) => {
-      const s = h(t.content) && typeof t.content.name == "string" ? t.content.name : "", a = h(o.content) && typeof o.content.name == "string" ? o.content.name : "";
-      return s.localeCompare(a);
+      const s = w(t.content) && typeof t.content.name == "string" ? t.content.name : "", i = w(o.content) && typeof o.content.name == "string" ? o.content.name : "";
+      return s.localeCompare(i);
     })
   })).sort((r, n) => r.name.localeCompare(n.name));
 }
-function L(e) {
-  return Z.INSTANCE.calculateSync(
+function Y(e) {
+  return q.INSTANCE.calculateAllowingCyclicPlaceholdersSync(
     e
   );
 }
-function We(e, r, n) {
+function et(e, r, n) {
   const t = r?.repositoryVersions.at(-1), o = !t || t !== n, s = r?.repositoryVersions ? [...r.repositoryVersions] : [];
   return o && s.push(n), { document: {
-    name: O,
+    name: x,
     packages: e,
     repositoryVersions: s
   }, changed: o };
 }
-function Ye(e, r, n) {
+function tt(e, r, n) {
   const t = {
-    name: O,
+    name: x,
     repositoryVersions: r,
-    packages: Je(e, n)
+    packages: nt(e, n)
   };
-  re(t);
+  ue(t);
 }
-function Je(e, r) {
+function nt(e, r) {
   const n = {};
   for (const t of e) {
-    const o = Ke(t.name, r), s = {}, a = {};
+    const o = rt(t.name, r), s = {}, i = {};
     for (const c of t.types) {
-      const i = c.versions?.[c.versions.length - 1]?.typeBlueId;
-      if (!i)
+      const a = c.versions?.[c.versions.length - 1]?.typeBlueId;
+      if (!a)
         throw new Error(
           `Type ${t.name} is missing a current BlueId in versions.`
         );
-      const f = ze(c);
-      s[i] = {
+      const f = ot(c);
+      s[a] = {
         status: c.status,
         name: f,
         versions: c.versions ?? []
-      }, a[i] = c.content;
+      }, i[a] = c.content;
     }
     n[t.name] = {
       name: t.name,
       aliases: o,
       typesMeta: s,
-      contents: a,
+      contents: i,
       schemas: {}
     };
   }
   return n;
 }
-function Ke(e, r) {
+function rt(e, r) {
   const n = {}, t = `${e}/`;
   return r.forEach((o, s) => {
     s.startsWith(t) && (n[s] = o);
   }), n;
 }
-function ze(e) {
-  const r = h(e.content) && typeof e.content.name == "string" ? e.content.name : null;
+function ot(e) {
+  const r = w(e.content) && typeof e.content.name == "string" ? e.content.name : null;
   if (!r)
     throw new Error('Type content is missing required "name" field.');
   return r;
 }
-function He(e) {
+function st(e) {
   if (!A.existsSync(e))
     return { previous: null };
-  const r = A.readFileSync(e, "utf8"), n = q(r);
+  const r = A.readFileSync(e, "utf8"), n = W(r);
   if (!n || !I(n))
     throw new Error("Existing BlueRepository.blue is not a valid object.");
-  const t = n, o = t.packages, s = t.repositoryVersions, a = Array.isArray(o) && o.every(
+  const t = n, o = t.packages, s = t.repositoryVersions, i = Array.isArray(o) && o.every(
     (l) => I(l) && typeof l.name == "string" && Array.isArray(l.types)
   ), c = Array.isArray(s) && s.every((l) => typeof l == "string");
-  if (!a || !c)
+  if (!i || !c)
     throw new Error(
       "Invalid BlueRepository.blue structure: expected { packages: BluePackage[], repositoryVersions: string[] }"
     );
-  const i = o, f = s, u = {
-    name: typeof t.name == "string" ? t.name : O,
-    packages: i,
+  const a = o, f = s, u = {
+    name: typeof t.name == "string" ? t.name : x,
+    packages: a,
     repositoryVersions: f
   };
   return { existingYaml: r, previous: u };
 }
-function Xe(e) {
-  return se.dump(e, { lineWidth: -1 });
+function it(e) {
+  return le.dump(e, { lineWidth: -1 });
 }
-function st(e) {
-  const r = D.resolve(e.repoRoot), n = D.resolve(e.blueRepositoryPath), { existingYaml: t, previous: o } = He(n), s = ae(r), a = _e(o);
-  De(s, a);
-  const c = le(s), i = pe(c);
-  ye(c, s);
-  const { aliasToBlueId: f, aliasToStorageContent: u } = we(
-    i,
+function yt(e) {
+  const r = j.resolve(e.repoRoot), n = j.resolve(e.blueRepositoryPath), { existingYaml: t, previous: o } = st(n), s = ge(r), i = qe(o);
+  Je(s, i);
+  const c = be(s), a = Ee(c);
+  Be(c, s);
+  const { aliasToBlueId: f, aliasToStorageContent: u } = Pe(
+    a,
     s,
     c,
-    a
-  ), l = o ? o.repositoryVersions.length : 0, y = je({
+    i
+  ), l = o ? o.repositoryVersions.length : 0, y = ze({
     discovered: s,
-    previousTypes: a,
+    previousTypes: i,
     aliasToBlueId: f,
     aliasToStorageContent: u,
     nextRepoVersionIndex: l
-  }), g = qe(y), E = o && Ze(o.packages, g) ? o.repositoryVersions.at(-1) ?? L(g) : L(g), { document: d, changed: p } = We(
+  }), g = Qe(y), B = o && at(o.packages, g) ? o.repositoryVersions.at(-1) ?? Y(g) : Y(g), { document: d, changed: p } = et(
     g,
     o,
-    E
+    B
   );
-  Ye(
+  tt(
     d.packages,
     d.repositoryVersions,
     f
   );
-  const b = Xe(d);
-  if (o && !p && t && t !== b)
-    throw new Error(
-      "BlueRepository.blue content differs from regenerated output while RepoBlueId is unchanged. Please revert manual edits or rerun in write mode."
-    );
+  const b = it(d), h = t !== void 0 && t === b;
   return e.verbose && console.info(
-    `[repository-generator] RepoBlueId: ${E} (${p ? "changed" : "unchanged"})`
+    `[repository-generator] RepoBlueId: ${B} (${p ? "changed" : "unchanged"})`
   ), {
     document: d,
-    currentRepoBlueId: E,
+    currentRepoBlueId: B,
     previousRepoBlueId: o?.repositoryVersions.at(-1),
-    changed: p || !t,
+    changed: p || !h,
     yaml: b,
     existingYaml: t
   };
 }
-function Ze(e, r) {
+function at(e, r) {
   return JSON.stringify(e) === JSON.stringify(r);
 }
 export {
-  st as g
+  yt as g
 };