@ybotok/loam 0.2.0-alpha.6 → 0.2.0-alpha.9

package/dist/core/c4/splice/placement.js

@@ -1,6 +1,27 @@
 import {} from "../likec4.js";
 import { elementService, serviceOf } from "../resolve/service.js";
+import { maskSource, pastComments, tokenEnd } from "../source-mask.js";
 import { relSortKey } from "./identity/edges.js";
+/**
+ * The block an addition with no anchor lands in: the document's FIRST
+ * `model { }` block.
+ *
+ * First, because it is the block every unanchored addition already landed in
+ * before the scan could see a second one — the scan stopped at the first
+ * match — so a single-block map places byte-identically, and a map that grew
+ * a second block keeps receiving new services where its older ones went. It
+ * is also invariant under every addition this merge can make (an archive never
+ * creates or reorders a block), which is what order-independence needs of it:
+ * a block chosen by size or content would move as the archives landed, and the
+ * same two features would compose to different bytes by archive order. The
+ * service-model splice (`./model/merge.ts`) uses the same block for the same
+ * reasons.
+ */
+export const HOME_BLOCK = 0;
+/** The statements of one block, in document order — what a trailing walk may step over. */
+function inBlock(stmts, block) {
+    return stmts.filter((s) => s.block === block);
+}
 /** The model's top-level statements in document order, joined to the parsed elements for services. */
 export function topStatements(scan, els) {
     // An `extend <fqn>` frame is never a top-level declaration of THIS document —
@@ -17,11 +38,20 @@ export function topStatements(scan, els) {
         services: [bound.get(e.id) ?? e.id],
         start: e.start,
         end: e.end,
+        block: e.block,
     }));
+    // Every top-level FRAME a statement can sit inside: the elements, and the
+    // `extend` frames, which hold edges as well as children.
+    const frames = scan.elements.filter((e) => e.extend === true || !e.id.includes("."));
     for (const r of scan.rels) {
         // A rel declared inside an element's body is not a top-level statement —
-        // anchoring after it would splice into the parent's block.
-        if (topEls.some((e) => r.start > e.start && r.start < e.end))
+        // anchoring after it would splice into the parent's block. Inside an
+        // `extend` frame it is worse than misplaced: the frame is a SCOPE, so an
+        // edge spliced in after it re-resolves there, and the delta's `zulu ->
+        // beta` landed inside `extend alpha { beta = … }` as an edge into
+        // `alpha.beta` — a merge that parses, written at exit 0 (probed
+        // 2026-10-20). Only the extend frames' edges are new to this filter.
+        if (frames.some((e) => r.start > e.start && r.start < e.end))
             continue;
         stmts.push({
             kind: "rel",
@@ -35,6 +65,7 @@ export function topStatements(scan, els) {
             services: [serviceOf(els, r.source), serviceOf(els, r.target)],
             start: r.start,
             end: r.end,
+            block: r.block,
         });
     }
     return stmts.sort((a, b) => a.start - b.start);
@@ -54,14 +85,16 @@ export function topStatements(scan, els) {
  * exact regime the scheme guarantees.
  */
 export function elementSpot(region, id, service) {
-    const { text, stmts, close } = region;
+    const { text, blocks } = region;
     let anchor;
-    for (const s of stmts) {
+    for (const s of region.stmts) {
         if (s.kind === "element" && s.services.includes(service))
             anchor = s;
     }
     if (anchor !== undefined)
-        return spotAfter(text, close, anchor.end);
+        return spotAfter(text, blocks[anchor.block].close, anchor.end);
+    const stmts = inBlock(region.stmts, HOME_BLOCK);
+    const close = blocks[HOME_BLOCK].close;
     let i = stmts.length - 1;
     let before;
     while (i >= 0 && stmts[i].kind === "rel") {
@@ -99,6 +132,12 @@ function relClusterHeads(stmts) {
     let services = null;
     for (let i = 0; i < stmts.length; i += 1) {
         const s = stmts[i];
+        // A block boundary ends a cluster exactly as an element does: the first
+        // edge of the next block is not contiguous with the last of this one.
+        if (i > 0 && stmts[i - 1].block !== s.block) {
+            head = -1;
+            services = null;
+        }
         if (s.kind !== "rel") {
             head = -1;
             services = null;
@@ -117,7 +156,27 @@ function relClusterHeads(stmts) {
     return heads;
 }
 export function relSpot(region, sourceService, key) {
-    const { text, stmts, close } = region;
+    const anchored = anchoredRelSpot(region, sourceService, key);
+    if (anchored !== null)
+        return anchored;
+    const { text, blocks } = region;
+    const stmts = inBlock(region.stmts, HOME_BLOCK);
+    const close = blocks[HOME_BLOCK].close;
+    const heads = relClusterHeads(stmts);
+    let i = stmts.length - 1;
+    let before;
+    while (i >= 0 && stmts[i].kind === "rel") {
+        const j = heads[i];
+        if (!(stmts[j].key > key))
+            break;
+        before = stmts[j];
+        i = j - 1;
+    }
+    return before !== undefined ? beforeSpot(text, before) : closeSpot(text, close);
+}
+/** After the last relationship touching the source's service, in that relationship's block — null when none does. */
+function anchoredRelSpot(region, sourceService, key) {
+    const { text, stmts, blocks } = region;
     const heads = relClusterHeads(stmts);
     let anchorAt = -1;
     for (let i = 0; i < stmts.length; i += 1) {
@@ -138,18 +197,9 @@ export function relSpot(region, sourceService, key) {
                 break;
             last = s;
         }
-        return spotAfter(text, close, last.end);
-    }
-    let i = stmts.length - 1;
-    let before;
-    while (i >= 0 && stmts[i].kind === "rel") {
-        const j = heads[i];
-        if (!(stmts[j].key > key))
-            break;
-        before = stmts[j];
-        i = j - 1;
+        return spotAfter(text, blocks[last.block].close, last.end);
     }
-    return before !== undefined ? beforeSpot(text, before) : closeSpot(text, close);
+    return null;
 }
 /**
  * Insertion before an existing statement: at the start of its line when only
@@ -169,10 +219,36 @@ function beforeSpot(text, before) {
  * brace's own spot. Exported for the service-model splice (`./model/merge.ts`),
  * which asks the same two questions of a `model { }` block it does not group by
  * service: after this statement, or last thing in the block.
+ *
+ * Unless code follows `end` on its line: then the spot is `end` itself, bare.
+ * The next line belongs to whatever is written there, and when that is a
+ * declaration whose body opens on the same line — `alpha = … { … }  beta = … {`
+ * — the line after is INSIDE beta: an addition anchored to alpha's service
+ * landed as `beta.kiwi`, in a merge that parsed and was written (exit 0,
+ * probed on main at 171555d). Right after the anchor is also what keeps two
+ * archives order-free when both anchor on that line: one anchored to alpha and
+ * one to beta used to share the next line's start, and whichever ran second
+ * landed above the other. A comment trailing the anchor is not code — the
+ * next line stays the spot, byte for byte as before — but a block comment
+ * it does not close is: its next line is inside the comment.
+ *
+ * A line comment ends where LikeC4's NL does, at `\r` as well as `\n` — the
+ * source mask agrees since the bare-CR fix — so `// note\r  beta = … {` is a
+ * comment and then code on the anchor's `\n`-line, and the spot after that
+ * line is inside beta: the same `beta.kiwi` merge, written at exit 0, which
+ * 171555d refused because it could not locate beta at all. A CRLF ending
+ * leaves nothing after the comment and keeps the next line, byte for byte.
  */
 export function spotAfter(text, close, end) {
     const nl = text.indexOf("\n", end);
     const at = nl === -1 ? text.length : nl + 1;
+    let rest = pastComments(text.slice(end, Math.min(at, close)));
+    while (rest.startsWith("//")) {
+        const eol = rest.search(/[\r\n]/);
+        rest = eol === -1 ? "" : pastComments(rest.slice(eol));
+    }
+    if (rest !== "")
+        return { at: end, bare: true };
     return at > close ? closeSpot(text, close) : { at, bare: false };
 }
 /** The last resort: directly before the model's closing brace. */
@@ -192,7 +268,7 @@ function lineStartAt(text, at) {
  */
 export function nestedInsert(text, parent, block) {
     if (parent.bodyOpen === -1) {
-        return { at: parent.end, insert: ` {\n${block}\n${parent.indent}}` };
+        return { at: bodyAt(text, parent), insert: ` {\n${block}\n${parent.indent}}` };
     }
     const lineStart = text.lastIndexOf("\n", parent.bodyClose - 1) + 1;
     if (/^[ \t]*$/.test(text.slice(lineStart, parent.bodyClose))) {
@@ -201,4 +277,18 @@ export function nestedInsert(text, parent, block) {
     // `{ ... }` on one line — break the brace onto its own line to make room.
     return { at: parent.bodyClose, insert: `\n${block}\n${parent.indent}` };
 }
+/**
+ * Where a bodyless parent's new body opens: where its span ends, unless a line
+ * comment trails its last token there. The span carries that comment — it is
+ * the declaration's own authored text (`statementEnd`) — so the `{` landed
+ * INSIDE `// the api`, everything after it on the line was comment, and the
+ * parse net refused a valid map ("Expecting end of file"). It opens before the
+ * comment now, which then trails the new closing brace. A closed block comment
+ * is no such trap, and keeps the bytes it always had.
+ */
+function bodyAt(text, parent) {
+    const span = text.slice(parent.start, parent.end);
+    const last = parent.start + tokenEnd(maskSource(span), 0, span.length);
+    return pastComments(text.slice(last, parent.end)) === "" ? parent.end : last;
+}
 //# sourceMappingURL=placement.js.map

package/dist/core/c4/splice/placement.js.map

@@ -1 +1 @@
-{"version":3,"file":"placement.js","sourceRoot":"","sources":["../../../../src/core/c4/splice/placement.ts"],"names":[],"mappings":"AAAA,OAAO,EAAa,MAAM,cAAc,CAAC;AACzC,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAElE,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAwEjD,sGAAsG;AACtG,MAAM,UAAU,aAAa,CAAC,IAAkB,EAAE,GAAW;IAC3D,8EAA8E;IAC9E,6EAA6E;IAC7E,2EAA2E;IAC3E,4EAA4E;IAC5E,yBAAyB;IACzB,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IACrF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,KAAK,GAAc,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1C,IAAI,EAAE,SAAkB;QACxB,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,GAAG,EAAE,EAAE;QACP,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACnC,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,GAAG,EAAE,CAAC,CAAC,GAAG;KACX,CAAC,CAAC,CAAC;IACJ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1B,yEAAyE;QACzE,2DAA2D;QAC3D,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC;YAAE,SAAS;QACvE,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,KAAK;YACX,EAAE,EAAE,EAAE;YACN,GAAG,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC;YACvB,uEAAuE;YACvE,wEAAwE;YACxE,sEAAsE;YACtE,qEAAqE;YACrE,eAAe;YACf,QAAQ,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;YAC9D,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,GAAG,EAAE,CAAC,CAAC,GAAG;SACX,CAAC,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACjD,CAAC;AAGD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,WAAW,CAAC,MAAmB,EAAE,EAAU,EAAE,OAAe;IAC1E,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IACtC,IAAI,MAA2B,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,MAAM,GAAG,CAAC,CAAC;IACvE,CAAC;IACD,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;IACpE,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,IAAI,MAA2B,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC1C,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC,IAAI,CAAC,CAAC;IACT,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC9C,sEAAsE;QACtE,mEAAmE;QACnE,8BAA8B;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,CAAC,IAAI,CAAC,CAAC;QAChH,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,EAAE,GAAG,EAAE,CAAC;YAAE,MAAM;QAChC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAClF,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,eAAe,CAAC,KAAgB;IACvC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;IACd,IAAI,QAAQ,GAAuB,IAAI,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACpB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,IAAI,GAAG,CAAC,CAAC,CAAC;YACV,QAAQ,GAAG,IAAI,CAAC;YAChB,SAAS;QACX,CAAC;QACD,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;YACtD,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,QAAQ;gBAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClD,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,CAAC,CAAC;YACT,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACjC,CAAC;QACD,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAClB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,MAAmB,EAAE,aAAqB,EAAE,GAAW;IAC7E,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IACtC,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IACrC,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACpB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,aAAa,CAAC;YAAE,QAAQ,GAAG,CAAC,CAAC;IAC3E,CAAC;IACD,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;QACpB,yEAAyE;QACzE,uEAAuE;QACvE,mEAAmE;QACnE,uEAAuE;QACvE,iCAAiC;QACjC,IAAI,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACpD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;YACpB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG;gBAAE,MAAM;YAC5E,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;QACD,OAAO,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1C,CAAC;IACD,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,IAAI,MAA2B,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACpB,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,GAAG,GAAG,GAAG,CAAC;YAAE,MAAM;QAClC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAClF,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,IAAY,EAAE,MAAe;IAC/C,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3C,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAClF,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC1C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,KAAa,EAAE,GAAW;IAChE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC5C,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACnE,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,KAAa;IACnD,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACpC,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAC3E,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACnC,CAAC;AAED,SAAS,WAAW,CAAC,IAAY,EAAE,EAAU;IAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY,EAAE,MAAsB,EAAE,KAAa;IAC9E,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,KAAK,KAAK,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;IACvE,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACnE,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;QAC7D,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,KAAK,IAAI,EAAE,CAAC;IACjD,CAAC;IACD,0EAA0E;IAC1E,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,KAAK,KAAK,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;AAC1E,CAAC","sourcesContent":["import { type Elem } from \"../likec4.js\";\nimport { elementService, serviceOf } from \"../resolve/service.js\";\nimport type { ScannedElement, ScannedModel } from \"../source-scan.js\";\nimport { relSortKey } from \"./identity/edges.js\";\n\n/* ------------------------------------------------------------------ */\n/* Landscape placement — where a top-level addition lands               */\n/* ------------------------------------------------------------------ */\n\n/**\n * The placement scheme, in full. It never moves an authored byte — placement\n * only chooses where NEW spliced blocks go — and it is deterministic in a\n * stronger sense: archiving feature A then feature B (touching different\n * services) yields the SAME final bytes as B then A, which is what lets two\n * concurrent archive PRs merge in git instead of colliding on one shared\n * append point.\n *\n *  - An ELEMENT whose service already has top-level elements in the model\n *    (the elementService join — binding first, title as the fallback) lands\n *    immediately after the last of them: it joins its service's neighborhood.\n *    Two features touching the SAME service therefore land adjacently, and\n *    their concurrent PRs still conflict — expected, and documented\n *    (SCHEMA.md sends that conflict to the PR flow).\n *  - An element opening a NEW service lands in the trailing region before the\n *    model's closing brace: skip the trailing relationship run, then walk left\n *    per same-service RUN, past every run whose leading id is\n *    lexicographically greater — an insertion sort of neighborhood heads\n *    against whatever is already there, which is what makes the region's\n *    final order independent of archive order (see the note on elementSpot:\n *    per-statement comparison was order-dependent).\n *  - A RELATIONSHIP lands after the last top-level relationship touching its\n *    SOURCE's service (either endpoint counts), then past the anchor's own\n *    CLUSTER members with a smaller sort key — two edges anchored to the same\n *    statement must order by key, not by which archived first. With no such\n *    neighborhood it falls to the trailing region, cluster-head-key-sorted\n *    the same insertion-sort way, after the trailing elements.\n *\n * LikeC4 reference resolution is not order-dependent, so a relationship\n * placed before an element it names still parses; the in-memory parse net in\n * landscape-merge.ts's planLandscapeMerge stays as the backstop regardless.\n */\nexport interface Spot {\n  /** Offset into the living text: a line start, or a point inside a shared line. */\n  at: number;\n  /** True when `at` shares its line with other text (the closing brace, or a displaced statement) — the block must bring its own newlines. */\n  bare: boolean;\n}\n\n/** A top-level statement of the living model, with everything placement asks of it. */\nexport interface TopStmt {\n  kind: \"element\" | \"rel\";\n  /** Element: its id. */\n  id: string;\n  /** Relationship: its placement sort key (relSortKey). */\n  key: string;\n  /** The service(s) this statement resolves to — one for an element, both endpoints for a rel. */\n  services: string[];\n  start: number;\n  end: number;\n}\n\n/**\n * The living model as placement reads it: the text being spliced into, its\n * top-level statement layout, and the model block's closing brace. One value\n * because every spot is computed against all three at the same instant — a\n * layout paired with text a splice has since moved would place against a\n * document that no longer exists (see `modelRegion` in landscape-merge.ts's\n * planLandscapeMerge).\n */\nexport interface ModelRegion {\n  text: string;\n  stmts: TopStmt[];\n  close: number;\n}\n\n/** The model's top-level statements in document order, joined to the parsed elements for services. */\nexport function topStatements(scan: ScannedModel, els: Elem[]): TopStmt[] {\n  // An `extend <fqn>` frame is never a top-level declaration of THIS document —\n  // it reopens one another document owns — so it anchors nothing and displaces\n  // nothing. Undotted fqns are the reason the tag is checked rather than the\n  // dot: `extend paymentService { }` would otherwise read as a declaration of\n  // `paymentService` here.\n  const topEls = scan.elements.filter((e) => e.extend !== true && !e.id.includes(\".\"));\n  const bound = new Map(els.map((e) => [e.id, elementService(e)]));\n  const stmts: TopStmt[] = topEls.map((e) => ({\n    kind: \"element\" as const,\n    id: e.id,\n    key: \"\",\n    services: [bound.get(e.id) ?? e.id],\n    start: e.start,\n    end: e.end,\n  }));\n  for (const r of scan.rels) {\n    // A rel declared inside an element's body is not a top-level statement —\n    // anchoring after it would splice into the parent's block.\n    if (topEls.some((e) => r.start > e.start && r.start < e.end)) continue;\n    stmts.push({\n      kind: \"rel\",\n      id: \"\",\n      key: relSortKey(els, r),\n      // Deliberately no `known` fleet set here: this resolution only decides\n      // WHERE in the file a statement anchors, both sides of every comparison\n      // resolve through the same call, and the merged document is re-parsed\n      // before anything is written — a wrong grouping is cosmetic, never a\n      // wrong merge.\n      services: [serviceOf(els, r.source), serviceOf(els, r.target)],\n      start: r.start,\n      end: r.end,\n    });\n  }\n  return stmts.sort((a, b) => a.start - b.start);\n}\n\n\n/**\n * The trailing walks move in PLACEMENT UNITS, never single statements. A unit\n * is a service neighborhood: a contiguous run of top-level elements resolving\n * to one service, or a contiguous cluster of relationships grown around the\n * statements touching one — keyed by its LEADING statement's id/key. Anchored\n * inserts extend a neighborhood without changing its head, so the insertion\n * sort the trailing region maintains is over neighborhood heads, which\n * archive order cannot reshuffle. Comparing per statement instead let an\n * anchored insert legally sit a LOWER id/key after a higher one (its anchor\n * decides where it lives, not its own sort key), and a later trailing walk\n * then stopped at different statements depending on which archive had run\n * first — order-DEPENDENT bytes for features touching disjoint services, the\n * exact regime the scheme guarantees.\n */\nexport function elementSpot(region: ModelRegion, id: string, service: string): Spot {\n  const { text, stmts, close } = region;\n  let anchor: TopStmt | undefined;\n  for (const s of stmts) {\n    if (s.kind === \"element\" && s.services.includes(service)) anchor = s;\n  }\n  if (anchor !== undefined) return spotAfter(text, close, anchor.end);\n  let i = stmts.length - 1;\n  let before: TopStmt | undefined;\n  while (i >= 0 && stmts[i]!.kind === \"rel\") {\n    before = stmts[i];\n    i -= 1;\n  }\n  while (i >= 0 && stmts[i]!.kind === \"element\") {\n    // The same-service run ending here is one unit: skip it whole or stop\n    // before it whole — an anchored member may carry any id, the run's\n    // LEADING id is its sort key.\n    let j = i;\n    while (j > 0 && stmts[j - 1]!.kind === \"element\" && stmts[j - 1]!.services[0] === stmts[i]!.services[0]) j -= 1;\n    if (!(stmts[j]!.id > id)) break;\n    before = stmts[j];\n    i = j - 1;\n  }\n  return before !== undefined ? beforeSpot(text, before) : closeSpot(text, close);\n}\n\n/**\n * Each top-level statement's cluster, as the index of the cluster's leading\n * statement. A relationship whose SOURCE's service some earlier relationship\n * in the same contiguous stretch already touches is an anchored join — it\n * belongs to that neighborhood wherever its own key would sort. One whose\n * source's service nothing before it touches opens a new cluster; sharing\n * only a TARGET does not join (every trailing edge into a busy hub would\n * otherwise dissolve into one giant cluster, and the trailing sort with it).\n * Recomputed from bytes alone, so the next archive sees the same units this\n * one placed.\n */\nfunction relClusterHeads(stmts: TopStmt[]): number[] {\n  const heads = stmts.map((_, i) => i);\n  let head = -1;\n  let services: Set<string> | null = null;\n  for (let i = 0; i < stmts.length; i += 1) {\n    const s = stmts[i]!;\n    if (s.kind !== \"rel\") {\n      head = -1;\n      services = null;\n      continue;\n    }\n    if (services !== null && services.has(s.services[0]!)) {\n      for (const svc of s.services) services.add(svc);\n    } else {\n      head = i;\n      services = new Set(s.services);\n    }\n    heads[i] = head;\n  }\n  return heads;\n}\n\nexport function relSpot(region: ModelRegion, sourceService: string, key: string): Spot {\n  const { text, stmts, close } = region;\n  const heads = relClusterHeads(stmts);\n  let anchorAt = -1;\n  for (let i = 0; i < stmts.length; i += 1) {\n    const s = stmts[i]!;\n    if (s.kind === \"rel\" && s.services.includes(sourceService)) anchorAt = i;\n  }\n  if (anchorAt !== -1) {\n    // Past the anchor, order among the cluster's OWN members is by key — two\n    // edges anchored to the same statement must order by key, not by which\n    // archived first — but the walk never leaves the cluster: the next\n    // cluster is another neighborhood's, and stepping over it would depend\n    // on which archive put it there.\n    let last = stmts[anchorAt]!;\n    for (let j = anchorAt + 1; j < stmts.length; j += 1) {\n      const s = stmts[j]!;\n      if (s.kind !== \"rel\" || heads[j] !== heads[anchorAt] || s.key >= key) break;\n      last = s;\n    }\n    return spotAfter(text, close, last.end);\n  }\n  let i = stmts.length - 1;\n  let before: TopStmt | undefined;\n  while (i >= 0 && stmts[i]!.kind === \"rel\") {\n    const j = heads[i]!;\n    if (!(stmts[j]!.key > key)) break;\n    before = stmts[j];\n    i = j - 1;\n  }\n  return before !== undefined ? beforeSpot(text, before) : closeSpot(text, close);\n}\n\n/**\n * Insertion before an existing statement: at the start of its line when only\n * whitespace precedes it there, at the statement itself — bare, displacing it\n * onto a fresh line — when other text shares the line (a statement written on\n * the `model {` line, say). The unguarded line start spliced the block BEFORE\n * the model keyword, and the parse net refused a perfectly legal landscape.\n */\nfunction beforeSpot(text: string, before: TopStmt): Spot {\n  const ls = lineStartAt(text, before.start);\n  if (/^[ \\t]*$/.test(text.slice(ls, before.start))) return { at: ls, bare: false };\n  return { at: before.start, bare: true };\n}\n\n/**\n * The line following the statement that ends at `end` — clamped to the closing\n * brace's own spot. Exported for the service-model splice (`./model/merge.ts`),\n * which asks the same two questions of a `model { }` block it does not group by\n * service: after this statement, or last thing in the block.\n */\nexport function spotAfter(text: string, close: number, end: number): Spot {\n  const nl = text.indexOf(\"\\n\", end);\n  const at = nl === -1 ? text.length : nl + 1;\n  return at > close ? closeSpot(text, close) : { at, bare: false };\n}\n\n/** The last resort: directly before the model's closing brace. */\nexport function closeSpot(text: string, close: number): Spot {\n  const ls = lineStartAt(text, close);\n  if (/^[ \\t]*$/.test(text.slice(ls, close))) return { at: ls, bare: false };\n  return { at: close, bare: true };\n}\n\nfunction lineStartAt(text: string, at: number): number {\n  return text.lastIndexOf(\"\\n\", at - 1) + 1;\n}\n\n/**\n * Where a child block enters an existing living parent: before the closing\n * brace of the parent's body, on its own line at the parent's inner indent —\n * and a parent that never had a body gains one around the child.\n */\nexport function nestedInsert(text: string, parent: ScannedElement, block: string): { at: number; insert: string } {\n  if (parent.bodyOpen === -1) {\n    return { at: parent.end, insert: ` {\\n${block}\\n${parent.indent}}` };\n  }\n  const lineStart = text.lastIndexOf(\"\\n\", parent.bodyClose - 1) + 1;\n  if (/^[ \\t]*$/.test(text.slice(lineStart, parent.bodyClose))) {\n    return { at: lineStart, insert: `${block}\\n` };\n  }\n  // `{ ... }` on one line — break the brace onto its own line to make room.\n  return { at: parent.bodyClose, insert: `\\n${block}\\n${parent.indent}` };\n}\n"]}
+{"version":3,"file":"placement.js","sourceRoot":"","sources":["../../../../src/core/c4/splice/placement.ts"],"names":[],"mappings":"AAAA,OAAO,EAAa,MAAM,cAAc,CAAC;AACzC,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClE,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAEvE,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAqDjD;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC;AAgC5B,2FAA2F;AAC3F,SAAS,OAAO,CAAC,KAAgB,EAAE,KAAa;IAC9C,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;AAChD,CAAC;AAED,sGAAsG;AACtG,MAAM,UAAU,aAAa,CAAC,IAAkB,EAAE,GAAW;IAC3D,8EAA8E;IAC9E,6EAA6E;IAC7E,2EAA2E;IAC3E,4EAA4E;IAC5E,yBAAyB;IACzB,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IACrF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,KAAK,GAAc,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1C,IAAI,EAAE,SAAkB;QACxB,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,GAAG,EAAE,EAAE;QACP,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACnC,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,GAAG,EAAE,CAAC,CAAC,GAAG;QACV,KAAK,EAAE,CAAC,CAAC,KAAK;KACf,CAAC,CAAC,CAAC;IACJ,0EAA0E;IAC1E,yDAAyD;IACzD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IACrF,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1B,yEAAyE;QACzE,qEAAqE;QACrE,yEAAyE;QACzE,uEAAuE;QACvE,kEAAkE;QAClE,gEAAgE;QAChE,qEAAqE;QACrE,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC;YAAE,SAAS;QACvE,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,KAAK;YACX,EAAE,EAAE,EAAE;YACN,GAAG,EAAE,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC;YACvB,uEAAuE;YACvE,wEAAwE;YACxE,sEAAsE;YACtE,qEAAqE;YACrE,eAAe;YACf,QAAQ,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;YAC9D,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,GAAG,EAAE,CAAC,CAAC,GAAG;YACV,KAAK,EAAE,CAAC,CAAC,KAAK;SACf,CAAC,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACjD,CAAC;AAGD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,WAAW,CAAC,MAAmB,EAAE,EAAU,EAAE,OAAe;IAC1E,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;IAChC,IAAI,MAA2B,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,MAAM,GAAG,CAAC,CAAC;IACvE,CAAC;IACD,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAE,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1F,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAE,CAAC,KAAK,CAAC;IACxC,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,IAAI,MAA2B,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC1C,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC,IAAI,CAAC,CAAC;IACT,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC9C,sEAAsE;QACtE,mEAAmE;QACnE,8BAA8B;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,CAAC,IAAI,CAAC,CAAC;QAChH,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,EAAE,GAAG,EAAE,CAAC;YAAE,MAAM;QAChC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAClF,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,eAAe,CAAC,KAAgB;IACvC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC;IACd,IAAI,QAAQ,GAAuB,IAAI,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACpB,wEAAwE;QACxE,sEAAsE;QACtE,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;YAC7C,IAAI,GAAG,CAAC,CAAC,CAAC;YACV,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,IAAI,GAAG,CAAC,CAAC,CAAC;YACV,QAAQ,GAAG,IAAI,CAAC;YAChB,SAAS;QACX,CAAC;QACD,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;YACtD,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,QAAQ;gBAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClD,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,CAAC,CAAC;YACT,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACjC,CAAC;QACD,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAClB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,MAAmB,EAAE,aAAqB,EAAE,GAAW;IAC7E,MAAM,QAAQ,GAAG,eAAe,CAAC,MAAM,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC;IAC7D,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,QAAQ,CAAC;IACvC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;IAChC,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAE,CAAC,KAAK,CAAC;IACxC,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IACrC,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,IAAI,MAA2B,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACpB,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,GAAG,GAAG,GAAG,CAAC;YAAE,MAAM;QAClC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAClF,CAAC;AAED,qHAAqH;AACrH,SAAS,eAAe,CAAC,MAAmB,EAAE,aAAqB,EAAE,GAAW;IAC9E,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC;IACvC,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IACrC,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACpB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,aAAa,CAAC;YAAE,QAAQ,GAAG,CAAC,CAAC;IAC3E,CAAC;IACD,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;QACpB,yEAAyE;QACzE,uEAAuE;QACvE,mEAAmE;QACnE,uEAAuE;QACvE,iCAAiC;QACjC,IAAI,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACpD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;YACpB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG;gBAAE,MAAM;YAC5E,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;QACD,OAAO,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,IAAY,EAAE,MAAe;IAC/C,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3C,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAClF,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,KAAa,EAAE,GAAW;IAChE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC5C,IAAI,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAC9D,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAClC,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC;IACD,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAChD,OAAO,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACnE,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,KAAa;IACnD,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACpC,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAC3E,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACnC,CAAC;AAED,SAAS,WAAW,CAAC,IAAY,EAAE,EAAU;IAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY,EAAE,MAAsB,EAAE,KAAa;IAC9E,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,OAAO,KAAK,KAAK,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;IACjF,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACnE,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;QAC7D,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,KAAK,IAAI,EAAE,CAAC;IACjD,CAAC;IACD,0EAA0E;IAC1E,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,KAAK,KAAK,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;AAC1E,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,MAAM,CAAC,IAAY,EAAE,MAAsB;IAClD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACvE,OAAO,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/E,CAAC","sourcesContent":["import { type Elem } from \"../likec4.js\";\nimport { elementService, serviceOf } from \"../resolve/service.js\";\nimport { maskSource, pastComments, tokenEnd } from \"../source-mask.js\";\nimport type { ScannedBlock, ScannedElement, ScannedModel } from \"../source-scan.js\";\nimport { relSortKey } from \"./identity/edges.js\";\n\n/* ------------------------------------------------------------------ */\n/* Landscape placement — where a top-level addition lands               */\n/* ------------------------------------------------------------------ */\n\n/**\n * The placement scheme, in full. It never moves an authored byte — placement\n * only chooses where NEW spliced blocks go — and it is deterministic in a\n * stronger sense: archiving feature A then feature B (touching different\n * services) yields the SAME final bytes as B then A, which is what lets two\n * concurrent archive PRs merge in git instead of colliding on one shared\n * append point.\n *\n *  - An ELEMENT whose service already has top-level elements in the model\n *    (the elementService join — binding first, title as the fallback) lands\n *    immediately after the last of them: it joins its service's neighborhood.\n *    Two features touching the SAME service therefore land adjacently, and\n *    their concurrent PRs still conflict — expected, and documented\n *    (SCHEMA.md sends that conflict to the PR flow).\n *  - An element opening a NEW service lands in the trailing region before the\n *    model's closing brace: skip the trailing relationship run, then walk left\n *    per same-service RUN, past every run whose leading id is\n *    lexicographically greater — an insertion sort of neighborhood heads\n *    against whatever is already there, which is what makes the region's\n *    final order independent of archive order (see the note on elementSpot:\n *    per-statement comparison was order-dependent).\n *  - A RELATIONSHIP lands after the last top-level relationship touching its\n *    SOURCE's service (either endpoint counts), then past the anchor's own\n *    CLUSTER members with a smaller sort key — two edges anchored to the same\n *    statement must order by key, not by which archived first. With no such\n *    neighborhood it falls to the trailing region, cluster-head-key-sorted\n *    the same insertion-sort way, after the trailing elements.\n *\n * A landscape may hold SEVERAL top-level `model { }` blocks, and LikeC4 reads\n * them as one model. Placement keeps every rule above and adds one: an\n * ANCHORED addition lands in its anchor's block (after the neighbor, clamped\n * to that block's closing brace), and an UNANCHORED one — the trailing-region\n * walks — lands in `HOME_BLOCK`, never crossing a block boundary. A same-service\n * run and a relationship cluster are contiguous statements of ONE block: the\n * views or the specification between two blocks are not a neighborhood.\n *\n * LikeC4 reference resolution is not order-dependent, so a relationship\n * placed before an element it names still parses; the in-memory parse net in\n * landscape-merge.ts's planLandscapeMerge stays as the backstop regardless.\n */\nexport interface Spot {\n  /** Offset into the living text: a line start, or a point inside a shared line. */\n  at: number;\n  /** True when `at` shares its line with other text (the closing brace, or a displaced statement) — the block must bring its own newlines. */\n  bare: boolean;\n}\n\n/**\n * The block an addition with no anchor lands in: the document's FIRST\n * `model { }` block.\n *\n * First, because it is the block every unanchored addition already landed in\n * before the scan could see a second one — the scan stopped at the first\n * match — so a single-block map places byte-identically, and a map that grew\n * a second block keeps receiving new services where its older ones went. It\n * is also invariant under every addition this merge can make (an archive never\n * creates or reorders a block), which is what order-independence needs of it:\n * a block chosen by size or content would move as the archives landed, and the\n * same two features would compose to different bytes by archive order. The\n * service-model splice (`./model/merge.ts`) uses the same block for the same\n * reasons.\n */\nexport const HOME_BLOCK = 0;\n\n/** A top-level statement of the living model, with everything placement asks of it. */\nexport interface TopStmt {\n  kind: \"element\" | \"rel\";\n  /** Element: its id. */\n  id: string;\n  /** Relationship: its placement sort key (relSortKey). */\n  key: string;\n  /** The service(s) this statement resolves to — one for an element, both endpoints for a rel. */\n  services: string[];\n  start: number;\n  end: number;\n  /** The `model { }` block it is written in, as `ScannedModel.blocks` indexes it. */\n  block: number;\n}\n\n/**\n * The living model as placement reads it: the text being spliced into, its\n * top-level statement layout, and the model blocks' braces. One value\n * because every spot is computed against all three at the same instant — a\n * layout paired with text a splice has since moved would place against a\n * document that no longer exists (see `modelRegion` in landscape-merge.ts's\n * planLandscapeMerge).\n */\nexport interface ModelRegion {\n  text: string;\n  stmts: TopStmt[];\n  /** Every top-level `model { }` block, by the index `TopStmt.block` names. */\n  blocks: readonly ScannedBlock[];\n}\n\n/** The statements of one block, in document order — what a trailing walk may step over. */\nfunction inBlock(stmts: TopStmt[], block: number): TopStmt[] {\n  return stmts.filter((s) => s.block === block);\n}\n\n/** The model's top-level statements in document order, joined to the parsed elements for services. */\nexport function topStatements(scan: ScannedModel, els: Elem[]): TopStmt[] {\n  // An `extend <fqn>` frame is never a top-level declaration of THIS document —\n  // it reopens one another document owns — so it anchors nothing and displaces\n  // nothing. Undotted fqns are the reason the tag is checked rather than the\n  // dot: `extend paymentService { }` would otherwise read as a declaration of\n  // `paymentService` here.\n  const topEls = scan.elements.filter((e) => e.extend !== true && !e.id.includes(\".\"));\n  const bound = new Map(els.map((e) => [e.id, elementService(e)]));\n  const stmts: TopStmt[] = topEls.map((e) => ({\n    kind: \"element\" as const,\n    id: e.id,\n    key: \"\",\n    services: [bound.get(e.id) ?? e.id],\n    start: e.start,\n    end: e.end,\n    block: e.block,\n  }));\n  // Every top-level FRAME a statement can sit inside: the elements, and the\n  // `extend` frames, which hold edges as well as children.\n  const frames = scan.elements.filter((e) => e.extend === true || !e.id.includes(\".\"));\n  for (const r of scan.rels) {\n    // A rel declared inside an element's body is not a top-level statement —\n    // anchoring after it would splice into the parent's block. Inside an\n    // `extend` frame it is worse than misplaced: the frame is a SCOPE, so an\n    // edge spliced in after it re-resolves there, and the delta's `zulu ->\n    // beta` landed inside `extend alpha { beta = … }` as an edge into\n    // `alpha.beta` — a merge that parses, written at exit 0 (probed\n    // 2026-10-20). Only the extend frames' edges are new to this filter.\n    if (frames.some((e) => r.start > e.start && r.start < e.end)) continue;\n    stmts.push({\n      kind: \"rel\",\n      id: \"\",\n      key: relSortKey(els, r),\n      // Deliberately no `known` fleet set here: this resolution only decides\n      // WHERE in the file a statement anchors, both sides of every comparison\n      // resolve through the same call, and the merged document is re-parsed\n      // before anything is written — a wrong grouping is cosmetic, never a\n      // wrong merge.\n      services: [serviceOf(els, r.source), serviceOf(els, r.target)],\n      start: r.start,\n      end: r.end,\n      block: r.block,\n    });\n  }\n  return stmts.sort((a, b) => a.start - b.start);\n}\n\n\n/**\n * The trailing walks move in PLACEMENT UNITS, never single statements. A unit\n * is a service neighborhood: a contiguous run of top-level elements resolving\n * to one service, or a contiguous cluster of relationships grown around the\n * statements touching one — keyed by its LEADING statement's id/key. Anchored\n * inserts extend a neighborhood without changing its head, so the insertion\n * sort the trailing region maintains is over neighborhood heads, which\n * archive order cannot reshuffle. Comparing per statement instead let an\n * anchored insert legally sit a LOWER id/key after a higher one (its anchor\n * decides where it lives, not its own sort key), and a later trailing walk\n * then stopped at different statements depending on which archive had run\n * first — order-DEPENDENT bytes for features touching disjoint services, the\n * exact regime the scheme guarantees.\n */\nexport function elementSpot(region: ModelRegion, id: string, service: string): Spot {\n  const { text, blocks } = region;\n  let anchor: TopStmt | undefined;\n  for (const s of region.stmts) {\n    if (s.kind === \"element\" && s.services.includes(service)) anchor = s;\n  }\n  if (anchor !== undefined) return spotAfter(text, blocks[anchor.block]!.close, anchor.end);\n  const stmts = inBlock(region.stmts, HOME_BLOCK);\n  const close = blocks[HOME_BLOCK]!.close;\n  let i = stmts.length - 1;\n  let before: TopStmt | undefined;\n  while (i >= 0 && stmts[i]!.kind === \"rel\") {\n    before = stmts[i];\n    i -= 1;\n  }\n  while (i >= 0 && stmts[i]!.kind === \"element\") {\n    // The same-service run ending here is one unit: skip it whole or stop\n    // before it whole — an anchored member may carry any id, the run's\n    // LEADING id is its sort key.\n    let j = i;\n    while (j > 0 && stmts[j - 1]!.kind === \"element\" && stmts[j - 1]!.services[0] === stmts[i]!.services[0]) j -= 1;\n    if (!(stmts[j]!.id > id)) break;\n    before = stmts[j];\n    i = j - 1;\n  }\n  return before !== undefined ? beforeSpot(text, before) : closeSpot(text, close);\n}\n\n/**\n * Each top-level statement's cluster, as the index of the cluster's leading\n * statement. A relationship whose SOURCE's service some earlier relationship\n * in the same contiguous stretch already touches is an anchored join — it\n * belongs to that neighborhood wherever its own key would sort. One whose\n * source's service nothing before it touches opens a new cluster; sharing\n * only a TARGET does not join (every trailing edge into a busy hub would\n * otherwise dissolve into one giant cluster, and the trailing sort with it).\n * Recomputed from bytes alone, so the next archive sees the same units this\n * one placed.\n */\nfunction relClusterHeads(stmts: TopStmt[]): number[] {\n  const heads = stmts.map((_, i) => i);\n  let head = -1;\n  let services: Set<string> | null = null;\n  for (let i = 0; i < stmts.length; i += 1) {\n    const s = stmts[i]!;\n    // A block boundary ends a cluster exactly as an element does: the first\n    // edge of the next block is not contiguous with the last of this one.\n    if (i > 0 && stmts[i - 1]!.block !== s.block) {\n      head = -1;\n      services = null;\n    }\n    if (s.kind !== \"rel\") {\n      head = -1;\n      services = null;\n      continue;\n    }\n    if (services !== null && services.has(s.services[0]!)) {\n      for (const svc of s.services) services.add(svc);\n    } else {\n      head = i;\n      services = new Set(s.services);\n    }\n    heads[i] = head;\n  }\n  return heads;\n}\n\nexport function relSpot(region: ModelRegion, sourceService: string, key: string): Spot {\n  const anchored = anchoredRelSpot(region, sourceService, key);\n  if (anchored !== null) return anchored;\n  const { text, blocks } = region;\n  const stmts = inBlock(region.stmts, HOME_BLOCK);\n  const close = blocks[HOME_BLOCK]!.close;\n  const heads = relClusterHeads(stmts);\n  let i = stmts.length - 1;\n  let before: TopStmt | undefined;\n  while (i >= 0 && stmts[i]!.kind === \"rel\") {\n    const j = heads[i]!;\n    if (!(stmts[j]!.key > key)) break;\n    before = stmts[j];\n    i = j - 1;\n  }\n  return before !== undefined ? beforeSpot(text, before) : closeSpot(text, close);\n}\n\n/** After the last relationship touching the source's service, in that relationship's block — null when none does. */\nfunction anchoredRelSpot(region: ModelRegion, sourceService: string, key: string): Spot | null {\n  const { text, stmts, blocks } = region;\n  const heads = relClusterHeads(stmts);\n  let anchorAt = -1;\n  for (let i = 0; i < stmts.length; i += 1) {\n    const s = stmts[i]!;\n    if (s.kind === \"rel\" && s.services.includes(sourceService)) anchorAt = i;\n  }\n  if (anchorAt !== -1) {\n    // Past the anchor, order among the cluster's OWN members is by key — two\n    // edges anchored to the same statement must order by key, not by which\n    // archived first — but the walk never leaves the cluster: the next\n    // cluster is another neighborhood's, and stepping over it would depend\n    // on which archive put it there.\n    let last = stmts[anchorAt]!;\n    for (let j = anchorAt + 1; j < stmts.length; j += 1) {\n      const s = stmts[j]!;\n      if (s.kind !== \"rel\" || heads[j] !== heads[anchorAt] || s.key >= key) break;\n      last = s;\n    }\n    return spotAfter(text, blocks[last.block]!.close, last.end);\n  }\n  return null;\n}\n\n/**\n * Insertion before an existing statement: at the start of its line when only\n * whitespace precedes it there, at the statement itself — bare, displacing it\n * onto a fresh line — when other text shares the line (a statement written on\n * the `model {` line, say). The unguarded line start spliced the block BEFORE\n * the model keyword, and the parse net refused a perfectly legal landscape.\n */\nfunction beforeSpot(text: string, before: TopStmt): Spot {\n  const ls = lineStartAt(text, before.start);\n  if (/^[ \\t]*$/.test(text.slice(ls, before.start))) return { at: ls, bare: false };\n  return { at: before.start, bare: true };\n}\n\n/**\n * The line following the statement that ends at `end` — clamped to the closing\n * brace's own spot. Exported for the service-model splice (`./model/merge.ts`),\n * which asks the same two questions of a `model { }` block it does not group by\n * service: after this statement, or last thing in the block.\n *\n * Unless code follows `end` on its line: then the spot is `end` itself, bare.\n * The next line belongs to whatever is written there, and when that is a\n * declaration whose body opens on the same line — `alpha = … { … }  beta = … {`\n * — the line after is INSIDE beta: an addition anchored to alpha's service\n * landed as `beta.kiwi`, in a merge that parsed and was written (exit 0,\n * probed on main at 171555d). Right after the anchor is also what keeps two\n * archives order-free when both anchor on that line: one anchored to alpha and\n * one to beta used to share the next line's start, and whichever ran second\n * landed above the other. A comment trailing the anchor is not code — the\n * next line stays the spot, byte for byte as before — but a block comment\n * it does not close is: its next line is inside the comment.\n *\n * A line comment ends where LikeC4's NL does, at `\\r` as well as `\\n` — the\n * source mask agrees since the bare-CR fix — so `// note\\r  beta = … {` is a\n * comment and then code on the anchor's `\\n`-line, and the spot after that\n * line is inside beta: the same `beta.kiwi` merge, written at exit 0, which\n * 171555d refused because it could not locate beta at all. A CRLF ending\n * leaves nothing after the comment and keeps the next line, byte for byte.\n */\nexport function spotAfter(text: string, close: number, end: number): Spot {\n  const nl = text.indexOf(\"\\n\", end);\n  const at = nl === -1 ? text.length : nl + 1;\n  let rest = pastComments(text.slice(end, Math.min(at, close)));\n  while (rest.startsWith(\"//\")) {\n    const eol = rest.search(/[\\r\\n]/);\n    rest = eol === -1 ? \"\" : pastComments(rest.slice(eol));\n  }\n  if (rest !== \"\") return { at: end, bare: true };\n  return at > close ? closeSpot(text, close) : { at, bare: false };\n}\n\n/** The last resort: directly before the model's closing brace. */\nexport function closeSpot(text: string, close: number): Spot {\n  const ls = lineStartAt(text, close);\n  if (/^[ \\t]*$/.test(text.slice(ls, close))) return { at: ls, bare: false };\n  return { at: close, bare: true };\n}\n\nfunction lineStartAt(text: string, at: number): number {\n  return text.lastIndexOf(\"\\n\", at - 1) + 1;\n}\n\n/**\n * Where a child block enters an existing living parent: before the closing\n * brace of the parent's body, on its own line at the parent's inner indent —\n * and a parent that never had a body gains one around the child.\n */\nexport function nestedInsert(text: string, parent: ScannedElement, block: string): { at: number; insert: string } {\n  if (parent.bodyOpen === -1) {\n    return { at: bodyAt(text, parent), insert: ` {\\n${block}\\n${parent.indent}}` };\n  }\n  const lineStart = text.lastIndexOf(\"\\n\", parent.bodyClose - 1) + 1;\n  if (/^[ \\t]*$/.test(text.slice(lineStart, parent.bodyClose))) {\n    return { at: lineStart, insert: `${block}\\n` };\n  }\n  // `{ ... }` on one line — break the brace onto its own line to make room.\n  return { at: parent.bodyClose, insert: `\\n${block}\\n${parent.indent}` };\n}\n\n/**\n * Where a bodyless parent's new body opens: where its span ends, unless a line\n * comment trails its last token there. The span carries that comment — it is\n * the declaration's own authored text (`statementEnd`) — so the `{` landed\n * INSIDE `// the api`, everything after it on the line was comment, and the\n * parse net refused a valid map (\"Expecting end of file\"). It opens before the\n * comment now, which then trails the new closing brace. A closed block comment\n * is no such trap, and keeps the bytes it always had.\n */\nfunction bodyAt(text: string, parent: ScannedElement): number {\n  const span = text.slice(parent.start, parent.end);\n  const last = parent.start + tokenEnd(maskSource(span), 0, span.length);\n  return pastComments(text.slice(last, parent.end)) === \"\" ? parent.end : last;\n}\n"]}

package/dist/core/c4/workspace.js

@@ -7,8 +7,8 @@
  * 120-service benchmark fixture, docs/BENCHMARKS.md). This module copies every
  * document into a mkdtemp workspace as one single-file PROJECT each (a
  * `likec4.config.json` per folder), calls `LikeC4.fromWorkspace` once, splits
- * `getErrors()` per document, and flattens each clean project through the same
- * `flattenModel` the per-file path uses. Parity — byte-identical error
+ * `getErrors()` per document, and reads each clean project through the same
+ * `cleanDoc` the per-file path uses. Parity — byte-identical error
  * messages/lines and identical elements/relationships — is pinned by
  * test/likec4-batch-parity.test.ts, which is also the tripwire for the exact
  * likec4 version pin: multi-project workspaces are public API, but this use of
@@ -41,11 +41,7 @@ import { copyFile, mkdir, mkdtemp, rm, writeFile } from "node:fs/promises";
 import { tmpdir } from "node:os";
 import { basename, join, resolve } from "node:path";
 import { LikeC4 } from "likec4";
-import { flattenModel } from "./likec4.js";
-import { readDynamicViews } from "./parsed/dynamic-views.js";
-import { readGlobalStyleIds, readViewIds } from "./parsed/view-ids.js";
-import { readSpecification } from "./parsed/specification.js";
-import { readDeployment } from "./parsed/deployment.js";
+import { cleanDoc, distinctErrors } from "./likec4.js";
 /**
  * Stage every readable document as its own single-file project. A copy failure
  * removes the half-made folder and drops the path — an empty project must not
@@ -85,11 +81,14 @@ async function stage(root, targets) {
  * (`/var/...` becomes `/private/var/...`) in some environments and the literal
  * mkdtemp path in others, and a prefix compare silently attributes every error
  * to nobody in exactly one of those two worlds. The segment survives both.
+ *
+ * Read through `distinctErrors` exactly as `loadSource` reads them, so a
+ * document's list is the same one in both modes.
  */
 function groupErrors(likec4, staged) {
     const pathOf = new Map(staged.map((doc) => [doc.project, doc.path]));
     const grouped = new Map();
-    for (const err of likec4.getErrors()) {
+    for (const err of distinctErrors(likec4.getErrors())) {
         const project = err.sourceFsPath.split(/[\\/]/).find((segment) => pathOf.has(segment));
         if (project === undefined) {
             // An error this walk cannot attribute would otherwise be DROPPED — and a
@@ -143,20 +142,12 @@ export async function loadBatch(paths) {
                     out.set(path, { errors, elements: [], relationships: [] });
                 }
                 else {
-                    const model = (await likec4.parsedModel(project));
-                    // The specification travels with the batch loader too, and must: this
-                    // is the loader `validate --all` reads the landscape through, so a
-                    // kind-tag check wired only into `loadSource` would be a check the
-                    // fleet gate — the one run it exists for — never actually ran.
-                    out.set(path, {
-                        errors,
-                        specification: readSpecification(model.specification),
-                        views: readDynamicViews(model),
-                        viewIds: readViewIds(model),
-                        globalStyles: readGlobalStyleIds(model),
-                        deployment: readDeployment(model),
-                        ...flattenModel(model),
-                    });
+                    // Through `cleanDoc`, the one assembly `loadSource` uses too. The
+                    // specification travels with the batch loader and must: this is the
+                    // loader `validate --all` reads the landscape through, so a kind-tag
+                    // check wired only into `loadSource` would be a check the fleet gate
+                    // — the one run it exists for — never actually ran.
+                    out.set(path, cleanDoc((await likec4.parsedModel(project))));
                 }
             }
         }

package/dist/core/c4/workspace.js.map

@@ -1 +1 @@
-{"version":3,"file":"workspace.js","sourceRoot":"","sources":["../../../src/core/c4/workspace.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,0BAA0B,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC3E,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AACjC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpD,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAChC,OAAO,EAAE,YAAY,EAAwD,MAAM,aAAa,CAAC;AACjG,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EAAE,kBAAkB,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACvE,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAQxD;;;;;;;GAOG;AACH,KAAK,UAAU,KAAK,CAAC,IAAY,EAAE,OAAiB;IAClD,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC7C,0EAA0E;IAC1E,yEAAyE;IACzE,0EAA0E;IAC1E,0EAA0E;IAC1E,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE;QACxE,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACnC,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC;YACpB,MAAM,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,oBAAoB,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YAC/F,MAAM,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAC3B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,EAAE,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;YACnD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAkB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;AAC3D,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,WAAW,CAAC,MAAc,EAAE,MAAmB;IACtD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QACvF,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,yEAAyE;YACzE,wEAAwE;YACxE,qEAAqE;YACrE,wEAAwE;YACxE,uEAAuE;YACvE,sEAAsE;YACtE,6BAA6B;YAC7B,MAAM,IAAI,KAAK,CAAC,mDAAmD,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QACpF,CAAC;QACD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACxC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,EAAE,YAAY,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACzD,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,KAAe;IAC7C,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAqB,CAAC;IACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACrC,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;IACvD,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QACpC,sEAAsE;QACtE,4EAA4E;QAC5E,yDAAyD;QACzD,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;QACnE,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAC5C,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,MAAM,EAAE,CAAC;gBACvC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBAC1C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACtB,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC7D,CAAC;qBAAM,CAAC;oBACN,MAAM,KAAK,GAAG,CAAC,MAAM,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAkB,CAAC;oBACnE,sEAAsE;oBACtE,mEAAmE;oBACnE,mEAAmE;oBACnE,+DAA+D;oBAC/D,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;wBACZ,MAAM;wBACN,aAAa,EAAE,iBAAiB,CAAC,KAAK,CAAC,aAAa,CAAC;wBACrD,KAAK,EAAE,gBAAgB,CAAC,KAAK,CAAC;wBAC9B,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC;wBAC3B,YAAY,EAAE,kBAAkB,CAAC,KAAK,CAAC;wBACvC,UAAU,EAAE,cAAc,CAAC,KAAK,CAAC;wBACjC,GAAG,YAAY,CAAC,KAAK,CAAC;qBACvB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,MAAM,MAAM,CAAC,OAAO,EAAE,CAAC;QACzB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;YAAS,CAAC;QACT,yEAAyE;QACzE,yEAAyE;QACzE,qEAAqE;QACrE,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IACnD,CAAC;AACH,CAAC","sourcesContent":["/**\n * Batch loader: many self-contained `.likec4` documents through ONE\n * LikeC4/Langium workspace.\n *\n * `loadFile` pays a fresh workspace per call — ~100ms even warm — which is what\n * made `validate --all` O(documents) workspace spins (13.7s median over the\n * 120-service benchmark fixture, docs/BENCHMARKS.md). This module copies every\n * document into a mkdtemp workspace as one single-file PROJECT each (a\n * `likec4.config.json` per folder), calls `LikeC4.fromWorkspace` once, splits\n * `getErrors()` per document, and flattens each clean project through the same\n * `flattenModel` the per-file path uses. Parity — byte-identical error\n * messages/lines and identical elements/relationships — is pinned by\n * test/likec4-batch-parity.test.ts, which is also the tripwire for the exact\n * likec4 version pin: multi-project workspaces are public API, but this use of\n * them is not documented, so an upgrade must fail that suite before it lands.\n *\n * Isolation is load-bearing, not cosmetic: `fromSource` gives each document a\n * workspace of its own, so an author-written `import ... from 'name'` can never\n * resolve. In a shared workspace it COULD — a sibling project is one lucky name\n * away — so every folder carries one crypto-random per-invocation hex token in\n * its project name. A document cannot import what it cannot name, and the\n * parity suite pins that a guessed sibling name errors identically in both\n * modes.\n *\n * Callers own the failure story: a document that cannot be staged (unreadable,\n * missing) is silently DROPPED from the result so the caller's ordinary\n * per-path load reproduces today's error, and a batch-infrastructure failure\n * (tmpdir denied — the sandboxed-runner class ROADMAP documents) rejects the\n * whole call for the caller to catch and degrade. FleetContext.prefetchLikeC4\n * does exactly that: findings can never change because a workspace could not be\n * created, only the speed can.\n *\n * This file took core/c4/ to exactly five files, and the seam that note\n * predicted is now open: `./project/load.ts` loads a DIRECTORY as one project,\n * which is the opposite isolation contract and belongs beside this one rather\n * than inside it.\n */\nimport { randomBytes } from \"node:crypto\";\nimport { inOrder } from \"../kernel/concurrency.js\";\nimport { copyFile, mkdir, mkdtemp, rm, writeFile } from \"node:fs/promises\";\nimport { tmpdir } from \"node:os\";\nimport { basename, join, resolve } from \"node:path\";\nimport { LikeC4 } from \"likec4\";\nimport { flattenModel, type LikeC4Error, type LoadedDoc, type ReadableModel } from \"./likec4.js\";\nimport { readDynamicViews } from \"./parsed/dynamic-views.js\";\nimport { readGlobalStyleIds, readViewIds } from \"./parsed/view-ids.js\";\nimport { readSpecification } from \"./parsed/specification.js\";\nimport { readDeployment } from \"./parsed/deployment.js\";\n\n/** A staged document: the real path it came from, and its workspace project. */\ninterface StagedDoc {\n  path: string;\n  project: string;\n}\n\n/**\n * Stage every readable document as its own single-file project. A copy failure\n * removes the half-made folder and drops the path — an empty project must not\n * reach the workspace scan, and the caller's per-path load owns the error. The\n * copy is `copyFile` (raw bytes), not read/decode/write: BOM, CRLF and even\n * non-UTF-8 bytes reach LikeC4's own reader exactly as they would from the\n * original file on disk.\n */\nasync function stage(root: string, targets: string[]): Promise<StagedDoc[]> {\n  const token = randomBytes(8).toString(\"hex\");\n  // Concurrent, capped, in input order (kernel/concurrency's contract): the\n  // per-document folders share nothing, and on a network-mounted docs repo\n  // the sequential form paid three round-trips per document. Nulls mark the\n  // drops so indices — and with them the p<i> project names — stay aligned.\n  const results = await inOrder([...targets.entries()], async ([i, path]) => {\n    const project = `p${i}_${token}`;\n    const folder = join(root, project);\n    try {\n      await mkdir(folder);\n      await writeFile(join(folder, \"likec4.config.json\"), JSON.stringify({ name: project }), \"utf8\");\n      await copyFile(path, join(folder, basename(path)));\n      return { path, project };\n    } catch {\n      await rm(folder, { recursive: true, force: true });\n      return null;\n    }\n  });\n  return results.filter((r): r is StagedDoc => r !== null);\n}\n\n/**\n * `getErrors()` split per document, each error's `sourceFsPath` rewritten from\n * the workspace copy to the document's real absolute path.\n *\n * Grouping keys on the unique `p<i>_<token>` path SEGMENT, never on a\n * tmp-root prefix compare: darwin hands back realpathed workspace paths\n * (`/var/...` becomes `/private/var/...`) in some environments and the literal\n * mkdtemp path in others, and a prefix compare silently attributes every error\n * to nobody in exactly one of those two worlds. The segment survives both.\n */\nfunction groupErrors(likec4: LikeC4, staged: StagedDoc[]): Map<string, LikeC4Error[]> {\n  const pathOf = new Map(staged.map((doc) => [doc.project, doc.path]));\n  const grouped = new Map<string, LikeC4Error[]>();\n  for (const err of likec4.getErrors()) {\n    const project = err.sourceFsPath.split(/[\\\\/]/).find((segment) => pathOf.has(segment));\n    if (project === undefined) {\n      // An error this walk cannot attribute would otherwise be DROPPED — and a\n      // dropped error grades its document clean, which is failing open in the\n      // fleet gate. Unreachable at the pinned likec4 version (every corpus\n      // error carries its project folder in sourceFsPath), so the one place a\n      // dependency upgrade could break the attribution is the one place that\n      // must reject the whole batch: the caller degrades to per-path loads,\n      // where the error reappears.\n      throw new Error(`unattributable LikeC4 error in batch workspace: ${err.message}`);\n    }\n    const list = grouped.get(project) ?? [];\n    list.push({ ...err, sourceFsPath: pathOf.get(project) });\n    grouped.set(project, list);\n  }\n  return grouped;\n}\n\n/**\n * Load and validate many self-contained `.likec4` documents in one workspace.\n * Returns `resolve(path)` → LoadedDoc; paths are deduped through the same\n * resolution, and a path that could not be staged is absent from the result.\n *\n * A document with errors keeps `loadSource`'s exact rule — empty elements and\n * relationships, WITHOUT calling `parsedModel`: the parsed stage succeeds even\n * over unresolved references, so the \"errors mean no model\" boundary is loam's\n * to apply, not LikeC4's. A clean document is flattened from\n * `parsedModel(project)` — parsed, never computed: the computed stage RESOLVES\n * every view against the model — which loam never wants, because it reads a\n * view's DECLARATIONS and never a view's resolved contents (docs/DESIGN.md\n * rule 26) — and which is superlinear in edge count (see loadSource).\n */\nexport async function loadBatch(paths: string[]): Promise<Map<string, LoadedDoc>> {\n  const targets = [...new Set(paths.map((path) => resolve(path)))];\n  const out = new Map<string, LoadedDoc>();\n  if (targets.length === 0) return out;\n  const root = await mkdtemp(join(tmpdir(), \"loam-c4-\"));\n  try {\n    const staged = await stage(root, targets);\n    if (staged.length === 0) return out;\n    // One workspace for the whole batch — the entire point. The logger is\n    // disabled exactly as in loadSource: diagnostics are returned per document,\n    // not written out-of-band to stderr (core never prints).\n    const likec4 = await LikeC4.fromWorkspace(root, { logger: false });\n    try {\n      const grouped = groupErrors(likec4, staged);\n      for (const { path, project } of staged) {\n        const errors = grouped.get(project) ?? [];\n        if (errors.length > 0) {\n          out.set(path, { errors, elements: [], relationships: [] });\n        } else {\n          const model = (await likec4.parsedModel(project)) as ReadableModel;\n          // The specification travels with the batch loader too, and must: this\n          // is the loader `validate --all` reads the landscape through, so a\n          // kind-tag check wired only into `loadSource` would be a check the\n          // fleet gate — the one run it exists for — never actually ran.\n          out.set(path, {\n            errors,\n            specification: readSpecification(model.specification),\n            views: readDynamicViews(model),\n            viewIds: readViewIds(model),\n            globalStyles: readGlobalStyleIds(model),\n            deployment: readDeployment(model),\n            ...flattenModel(model),\n          });\n        }\n      }\n    } finally {\n      await likec4.dispose();\n    }\n    return out;\n  } finally {\n    // The workspace is this invocation's alone; nothing else may observe it.\n    // A kill between mkdtemp and here can strand a loam-c4-* dir in OS tmp —\n    // never in the docs repo — which docs/DESIGN.md records as accepted.\n    await rm(root, { recursive: true, force: true });\n  }\n}\n"]}
+{"version":3,"file":"workspace.js","sourceRoot":"","sources":["../../../src/core/c4/workspace.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,0BAA0B,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC3E,OAAO,EAAE,MAAM,EAAE,MAAM,SAAS,CAAC;AACjC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpD,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAChC,OAAO,EAAE,QAAQ,EAAE,cAAc,EAAwD,MAAM,aAAa,CAAC;AAQ7G;;;;;;;GAOG;AACH,KAAK,UAAU,KAAK,CAAC,IAAY,EAAE,OAAiB;IAClD,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC7C,0EAA0E;IAC1E,yEAAyE;IACzE,0EAA0E;IAC1E,0EAA0E;IAC1E,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE;QACxE,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACnC,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC;YACpB,MAAM,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,oBAAoB,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YAC/F,MAAM,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAC3B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,EAAE,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;YACnD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAkB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;AAC3D,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,WAAW,CAAC,MAAc,EAAE,MAAmB;IACtD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjD,KAAK,MAAM,GAAG,IAAI,cAAc,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QACvF,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,yEAAyE;YACzE,wEAAwE;YACxE,qEAAqE;YACrE,wEAAwE;YACxE,uEAAuE;YACvE,sEAAsE;YACtE,6BAA6B;YAC7B,MAAM,IAAI,KAAK,CAAC,mDAAmD,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QACpF,CAAC;QACD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACxC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,EAAE,YAAY,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACzD,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,KAAe;IAC7C,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAqB,CAAC;IACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACrC,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;IACvD,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QACpC,sEAAsE;QACtE,4EAA4E;QAC5E,yDAAyD;QACzD,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;QACnE,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAC5C,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,MAAM,EAAE,CAAC;gBACvC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBAC1C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACtB,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC7D,CAAC;qBAAM,CAAC;oBACN,kEAAkE;oBAClE,oEAAoE;oBACpE,qEAAqE;oBACrE,qEAAqE;oBACrE,oDAAoD;oBACpD,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,MAAM,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAkB,CAAC,CAAC,CAAC;gBAChF,CAAC;YACH,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,MAAM,MAAM,CAAC,OAAO,EAAE,CAAC;QACzB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;YAAS,CAAC;QACT,yEAAyE;QACzE,yEAAyE;QACzE,qEAAqE;QACrE,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IACnD,CAAC;AACH,CAAC","sourcesContent":["/**\n * Batch loader: many self-contained `.likec4` documents through ONE\n * LikeC4/Langium workspace.\n *\n * `loadFile` pays a fresh workspace per call — ~100ms even warm — which is what\n * made `validate --all` O(documents) workspace spins (13.7s median over the\n * 120-service benchmark fixture, docs/BENCHMARKS.md). This module copies every\n * document into a mkdtemp workspace as one single-file PROJECT each (a\n * `likec4.config.json` per folder), calls `LikeC4.fromWorkspace` once, splits\n * `getErrors()` per document, and reads each clean project through the same\n * `cleanDoc` the per-file path uses. Parity — byte-identical error\n * messages/lines and identical elements/relationships — is pinned by\n * test/likec4-batch-parity.test.ts, which is also the tripwire for the exact\n * likec4 version pin: multi-project workspaces are public API, but this use of\n * them is not documented, so an upgrade must fail that suite before it lands.\n *\n * Isolation is load-bearing, not cosmetic: `fromSource` gives each document a\n * workspace of its own, so an author-written `import ... from 'name'` can never\n * resolve. In a shared workspace it COULD — a sibling project is one lucky name\n * away — so every folder carries one crypto-random per-invocation hex token in\n * its project name. A document cannot import what it cannot name, and the\n * parity suite pins that a guessed sibling name errors identically in both\n * modes.\n *\n * Callers own the failure story: a document that cannot be staged (unreadable,\n * missing) is silently DROPPED from the result so the caller's ordinary\n * per-path load reproduces today's error, and a batch-infrastructure failure\n * (tmpdir denied — the sandboxed-runner class ROADMAP documents) rejects the\n * whole call for the caller to catch and degrade. FleetContext.prefetchLikeC4\n * does exactly that: findings can never change because a workspace could not be\n * created, only the speed can.\n *\n * This file took core/c4/ to exactly five files, and the seam that note\n * predicted is now open: `./project/load.ts` loads a DIRECTORY as one project,\n * which is the opposite isolation contract and belongs beside this one rather\n * than inside it.\n */\nimport { randomBytes } from \"node:crypto\";\nimport { inOrder } from \"../kernel/concurrency.js\";\nimport { copyFile, mkdir, mkdtemp, rm, writeFile } from \"node:fs/promises\";\nimport { tmpdir } from \"node:os\";\nimport { basename, join, resolve } from \"node:path\";\nimport { LikeC4 } from \"likec4\";\nimport { cleanDoc, distinctErrors, type LikeC4Error, type LoadedDoc, type ReadableModel } from \"./likec4.js\";\n\n/** A staged document: the real path it came from, and its workspace project. */\ninterface StagedDoc {\n  path: string;\n  project: string;\n}\n\n/**\n * Stage every readable document as its own single-file project. A copy failure\n * removes the half-made folder and drops the path — an empty project must not\n * reach the workspace scan, and the caller's per-path load owns the error. The\n * copy is `copyFile` (raw bytes), not read/decode/write: BOM, CRLF and even\n * non-UTF-8 bytes reach LikeC4's own reader exactly as they would from the\n * original file on disk.\n */\nasync function stage(root: string, targets: string[]): Promise<StagedDoc[]> {\n  const token = randomBytes(8).toString(\"hex\");\n  // Concurrent, capped, in input order (kernel/concurrency's contract): the\n  // per-document folders share nothing, and on a network-mounted docs repo\n  // the sequential form paid three round-trips per document. Nulls mark the\n  // drops so indices — and with them the p<i> project names — stay aligned.\n  const results = await inOrder([...targets.entries()], async ([i, path]) => {\n    const project = `p${i}_${token}`;\n    const folder = join(root, project);\n    try {\n      await mkdir(folder);\n      await writeFile(join(folder, \"likec4.config.json\"), JSON.stringify({ name: project }), \"utf8\");\n      await copyFile(path, join(folder, basename(path)));\n      return { path, project };\n    } catch {\n      await rm(folder, { recursive: true, force: true });\n      return null;\n    }\n  });\n  return results.filter((r): r is StagedDoc => r !== null);\n}\n\n/**\n * `getErrors()` split per document, each error's `sourceFsPath` rewritten from\n * the workspace copy to the document's real absolute path.\n *\n * Grouping keys on the unique `p<i>_<token>` path SEGMENT, never on a\n * tmp-root prefix compare: darwin hands back realpathed workspace paths\n * (`/var/...` becomes `/private/var/...`) in some environments and the literal\n * mkdtemp path in others, and a prefix compare silently attributes every error\n * to nobody in exactly one of those two worlds. The segment survives both.\n *\n * Read through `distinctErrors` exactly as `loadSource` reads them, so a\n * document's list is the same one in both modes.\n */\nfunction groupErrors(likec4: LikeC4, staged: StagedDoc[]): Map<string, LikeC4Error[]> {\n  const pathOf = new Map(staged.map((doc) => [doc.project, doc.path]));\n  const grouped = new Map<string, LikeC4Error[]>();\n  for (const err of distinctErrors(likec4.getErrors())) {\n    const project = err.sourceFsPath.split(/[\\\\/]/).find((segment) => pathOf.has(segment));\n    if (project === undefined) {\n      // An error this walk cannot attribute would otherwise be DROPPED — and a\n      // dropped error grades its document clean, which is failing open in the\n      // fleet gate. Unreachable at the pinned likec4 version (every corpus\n      // error carries its project folder in sourceFsPath), so the one place a\n      // dependency upgrade could break the attribution is the one place that\n      // must reject the whole batch: the caller degrades to per-path loads,\n      // where the error reappears.\n      throw new Error(`unattributable LikeC4 error in batch workspace: ${err.message}`);\n    }\n    const list = grouped.get(project) ?? [];\n    list.push({ ...err, sourceFsPath: pathOf.get(project) });\n    grouped.set(project, list);\n  }\n  return grouped;\n}\n\n/**\n * Load and validate many self-contained `.likec4` documents in one workspace.\n * Returns `resolve(path)` → LoadedDoc; paths are deduped through the same\n * resolution, and a path that could not be staged is absent from the result.\n *\n * A document with errors keeps `loadSource`'s exact rule — empty elements and\n * relationships, WITHOUT calling `parsedModel`: the parsed stage succeeds even\n * over unresolved references, so the \"errors mean no model\" boundary is loam's\n * to apply, not LikeC4's. A clean document is flattened from\n * `parsedModel(project)` — parsed, never computed: the computed stage RESOLVES\n * every view against the model — which loam never wants, because it reads a\n * view's DECLARATIONS and never a view's resolved contents (docs/DESIGN.md\n * rule 26) — and which is superlinear in edge count (see loadSource).\n */\nexport async function loadBatch(paths: string[]): Promise<Map<string, LoadedDoc>> {\n  const targets = [...new Set(paths.map((path) => resolve(path)))];\n  const out = new Map<string, LoadedDoc>();\n  if (targets.length === 0) return out;\n  const root = await mkdtemp(join(tmpdir(), \"loam-c4-\"));\n  try {\n    const staged = await stage(root, targets);\n    if (staged.length === 0) return out;\n    // One workspace for the whole batch — the entire point. The logger is\n    // disabled exactly as in loadSource: diagnostics are returned per document,\n    // not written out-of-band to stderr (core never prints).\n    const likec4 = await LikeC4.fromWorkspace(root, { logger: false });\n    try {\n      const grouped = groupErrors(likec4, staged);\n      for (const { path, project } of staged) {\n        const errors = grouped.get(project) ?? [];\n        if (errors.length > 0) {\n          out.set(path, { errors, elements: [], relationships: [] });\n        } else {\n          // Through `cleanDoc`, the one assembly `loadSource` uses too. The\n          // specification travels with the batch loader and must: this is the\n          // loader `validate --all` reads the landscape through, so a kind-tag\n          // check wired only into `loadSource` would be a check the fleet gate\n          // — the one run it exists for — never actually ran.\n          out.set(path, cleanDoc((await likec4.parsedModel(project)) as ReadableModel));\n        }\n      }\n    } finally {\n      await likec4.dispose();\n    }\n    return out;\n  } finally {\n    // The workspace is this invocation's alone; nothing else may observe it.\n    // A kill between mkdtemp and here can strand a loam-c4-* dir in OS tmp —\n    // never in the docs repo — which docs/DESIGN.md records as accepted.\n    await rm(root, { recursive: true, force: true });\n  }\n}\n"]}

package/dist/core/capabilities/capabilities.js

@@ -41,7 +41,7 @@ const EMPTY = { present: false, byId: new Map(), tree: NO_TREE };
  * and a declaration whose body is not a mapping is treated as `{}` rather than
  * refusing the whole file over one leaf.
  */
-export async function readCapabilities(path) {
+async function readCapabilities(path) {
     if (!existsSync(path))
         return EMPTY;
     let doc;
@@ -77,11 +77,11 @@ export async function readCapabilities(path) {
  * THE vocabulary — both sides read and merged, and the only shape a grader
  * should ever be handed.
  *
- * `readCapabilities` above stays exported for the one reader that genuinely
- * means the file alone (its own tests), but nothing that grades a fleet may use
- * it: a `Capability:` line naming an id the tree declares and the YAML does not
- * would resolve through the union and fail through the file, so a second
- * spelling of "the vocabulary" is a second answer to `capability.unknown`.
+ * `readCapabilities` above is the file alone, and it is private to this
+ * module because nothing that grades a fleet may use it: a `Capability:` line
+ * naming an id the tree declares and the YAML does not would resolve through
+ * the union and fail through the file, so a second spelling of "the
+ * vocabulary" is a second answer to `capability.unknown`.
  *
  * WHERE AN ID SITS ON BOTH SIDES THE YAML'S METADATA SURVIVES, and not by
  * precedence — the document has nothing to overwrite it with. `description` and

package/dist/core/capabilities/capabilities.js.map

@@ -1 +1 @@
-{"version":3,"file":"capabilities.js","sourceRoot":"","sources":["../../../src/core/capabilities/capabilities.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,KAAK,IAAI,SAAS,EAAE,MAAM,MAAM,CAAC;AAC1C,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEhD,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,kBAAkB,EAAuB,MAAM,WAAW,CAAC;AAwDpE,MAAM,OAAO,GAAmB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;AAC/E,MAAM,KAAK,GAAyB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAEvF;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,IAAY;IACjD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IACpC,IAAI,GAAY,CAAC;IACjB,IAAI,CAAC;QACH,GAAG,GAAG,SAAS,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;IAChD,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1F,CAAC;IACD,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC1E,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,+BAA+B,EAAE,CAAC;IAEjG,MAAM,KAAK,GAAG,GAAG,CAAC,cAAc,CAAC,CAAC;IAClC,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC5D,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,qEAAqE,EAAE,CAAC;IACrH,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC3C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACxC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;YACX,EAAE;YACF,MAAM,EAAE,MAAM;YACd,GAAG,CAAC,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxF,GAAG,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACvE,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAAC,OAAgB;IAC7D,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QACrC,gBAAgB,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC3C,kBAAkB,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;KAC/C,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;YACf,GAAG,QAAQ;YACX,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,MAAM,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM;YAChD,IAAI,EAAE,GAAG,CAAC,IAAI;SACf,CAAC,CAAC;IACL,CAAC;IACD,OAAO;QACL,GAAG,IAAI;QACP,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO;QACrC,IAAI;QACJ,IAAI;KACL,CAAC;AACJ,CAAC","sourcesContent":["/**\n * The fleet's capability vocabulary: which business capabilities exist, by\n * declared name, so a requirement's `Capability:` line resolves or refuses\n * instead of silently labelling.\n *\n * It is a fleet document (`architecture/capabilities.yaml`, beside the\n * landscape and the permissions vocabulary) because a capability crosses\n * services by definition — \"registration\" is realized by requirements in four\n * repositories, and a per-service copy would be N spellings of one word.\n *\n * What this is NOT, deliberately: a domain model, and not an authored prose\n * layer either. SCHEMA.md rejected a free-text `capability:` label because\n * nothing could check it; a DECLARED name is different in exactly the way that\n * mattered there — the id exists in this file or it does not, so an unknown\n * name is an error with close candidates, a declaration nothing realizes is a\n * warning, and the vocabulary cannot drift while looking authoritative. The\n * long-lived capability documents themselves (one page per capability, revised\n * by features) stay outside loam — that is the roadmap's evidence-gated Later\n * item, and the rollup built over these names is the evidence that decides it.\n *\n * The OPT-IN also differs from the authorization axis, on purpose: there the\n * `Requires:` line is the opt-in and a missing permissions.yaml is an error at\n * the line; here the FILE is the opt-in — a fleet with no capabilities.yaml\n * produces no capability findings at all (`core/capabilities/findings.ts`\n * holds the rule and the reason).\n */\nimport { readFile } from \"node:fs/promises\";\nimport { existsSync } from \"node:fs\";\nimport { parse as parseYaml } from \"yaml\";\nimport { isRecord } from \"../kernel/records.js\";\nimport type { DocsDir } from \"../kernel/ids/dirs.js\";\nimport { capabilitiesPath } from \"../repo/paths.js\";\nimport { capabilityDocsDir } from \"../repo/authored/paths.js\";\nimport { readCapabilityTree, type CapabilityTree } from \"./tree.js\";\n\n/** One declared capability. The id is the full key, slashes preserved. */\nexport interface Capability {\n  /**\n   * The token a requirement's `Capability:` line writes. Nesting is spelled\n   * INSIDE the id (`payments/refunds`) and never collapsed — the key is\n   * exactly the string a requirement names, greppable as written.\n   */\n  id: string;\n  description?: string;\n  /**\n   * A team or a person — deliberately `owner:`, not permissions' `owned_by:`,\n   * because that field carries \"defining service\" semantics a capability does\n   * not have. Never resolved against anything; a blank is a worse answer than\n   * an unverified one.\n   */\n  owner?: string;\n  /**\n   * Which side declared this id. `yaml` is a name in\n   * `architecture/capabilities.yaml` with no document; `tree` is a\n   * `capabilities/<id>/spec.md` the YAML does not name; `both` is the same id\n   * on both sides, which is normal rather than a duplicate — the YAML declared\n   * the word first and somebody has since written the document for it.\n   *\n   * Recorded rather than derived at each reader, because the two sides carry\n   * different fixes: a `yaml`-only capability is fixed by writing the document,\n   * a `tree`-only one needs no fix at all, and a message that could not tell\n   * them apart would advise editing a file that may not exist.\n   */\n  source: \"yaml\" | \"tree\" | \"both\";\n  /** `capabilities/<id>/spec.md`, absolute, when the tree declares this id. */\n  spec?: string;\n}\n\nexport interface CapabilityVocabulary {\n  /**\n   * False when NEITHER `architecture/capabilities.yaml` nor `capabilities/`\n   * exists. Either one is the axis's opt-in, so a fleet holding neither\n   * produces no capability finding at all, however many `Capability:` lines its\n   * requirements already carry.\n   */\n  present: boolean;\n  /**\n   * Why `architecture/capabilities.yaml` could not be read as a vocabulary,\n   * when it could not. The TREE has no such state: a directory either lists or\n   * it does not, and an unreadable one is a filesystem failure the walk lets\n   * throw rather than a document loam misread.\n   */\n  invalid?: string;\n  /** Declared capabilities, keyed by the full id — the union of both sides. */\n  byId: Map<string, Capability>;\n  /** What the `capabilities/` walk found, for the graders that need the paths. */\n  tree: CapabilityTree;\n}\n\nconst NO_TREE: CapabilityTree = { present: false, docs: [], undocumented: [] };\nconst EMPTY: CapabilityVocabulary = { present: false, byId: new Map(), tree: NO_TREE };\n\n/**\n * Read the vocabulary — exactly `permissions.ts`'s defensive ladder, because\n * the two files fail the same ways: a missing file is silence, a YAML error or\n * a non-mapping shape is `invalid` (one finding for the whole run, the family\n * suppressed behind it), an empty document is a present-and-empty vocabulary,\n * and a declaration whose body is not a mapping is treated as `{}` rather than\n * refusing the whole file over one leaf.\n */\nexport async function readCapabilities(path: string): Promise<CapabilityVocabulary> {\n  if (!existsSync(path)) return EMPTY;\n  let doc: unknown;\n  try {\n    doc = parseYaml(await readFile(path, \"utf8\"));\n  } catch (e) {\n    return { ...EMPTY, present: true, invalid: e instanceof Error ? e.message : String(e) };\n  }\n  if (doc === null || doc === undefined) return { ...EMPTY, present: true };\n  if (!isRecord(doc)) return { ...EMPTY, present: true, invalid: \"the document is not a mapping\" };\n\n  const block = doc[\"capabilities\"];\n  if (block === undefined) return { ...EMPTY, present: true };\n  if (!isRecord(block)) {\n    return { ...EMPTY, present: true, invalid: \"`capabilities` is not a mapping of capability id to its declaration\" };\n  }\n\n  const byId = new Map<string, Capability>();\n  for (const [id, body] of Object.entries(block)) {\n    const decl = isRecord(body) ? body : {};\n    byId.set(id, {\n      id,\n      source: \"yaml\",\n      ...(typeof decl[\"description\"] === \"string\" ? { description: decl[\"description\"] } : {}),\n      ...(typeof decl[\"owner\"] === \"string\" ? { owner: decl[\"owner\"] } : {}),\n    });\n  }\n  return { ...EMPTY, present: true, byId };\n}\n\n/**\n * THE vocabulary — both sides read and merged, and the only shape a grader\n * should ever be handed.\n *\n * `readCapabilities` above stays exported for the one reader that genuinely\n * means the file alone (its own tests), but nothing that grades a fleet may use\n * it: a `Capability:` line naming an id the tree declares and the YAML does not\n * would resolve through the union and fail through the file, so a second\n * spelling of \"the vocabulary\" is a second answer to `capability.unknown`.\n *\n * WHERE AN ID SITS ON BOTH SIDES THE YAML'S METADATA SURVIVES, and not by\n * precedence — the document has nothing to overwrite it with. `description` and\n * `owner` are fields, and this axis's own rule is that an entry without prose\n * stays a line in YAML; the document's contribution is the narrative and the\n * requirements, which are prose, and loam reads frontmatter, never prose. So a\n * capability declared only in the tree has no owner in `loam list\n * capabilities`, and that is the honest reading rather than a gap: nobody wrote\n * one down. What the merge adds on that side is `spec` and `source`.\n *\n * An UNREADABLE YAML suspends the whole family (`gradableCapabilityIds` in\n * `./findings.ts` is the one statement of that ladder), and the tree is still\n * walked and still carried: `capability.doc-missing` is a fact about\n * directories that no YAML failure makes untrue, and suppressing it behind an\n * unrelated broken file would hide a half-created capability until somebody\n * fixed a document it has nothing to do with.\n */\nexport async function readCapabilityVocabulary(docsDir: DocsDir): Promise<CapabilityVocabulary> {\n  const [yaml, tree] = await Promise.all([\n    readCapabilities(capabilitiesPath(docsDir)),\n    readCapabilityTree(capabilityDocsDir(docsDir)),\n  ]);\n  const byId = new Map(yaml.byId);\n  for (const doc of tree.docs) {\n    const declared = byId.get(doc.id);\n    byId.set(doc.id, {\n      ...declared,\n      id: doc.id,\n      source: declared === undefined ? \"tree\" : \"both\",\n      spec: doc.spec,\n    });\n  }\n  return {\n    ...yaml,\n    present: yaml.present || tree.present,\n    byId,\n    tree,\n  };\n}\n"]}
+{"version":3,"file":"capabilities.js","sourceRoot":"","sources":["../../../src/core/capabilities/capabilities.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,KAAK,IAAI,SAAS,EAAE,MAAM,MAAM,CAAC;AAC1C,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEhD,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,kBAAkB,EAAuB,MAAM,WAAW,CAAC;AAwDpE,MAAM,OAAO,GAAmB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;AAC/E,MAAM,KAAK,GAAyB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAEvF;;;;;;;GAOG;AACH,KAAK,UAAU,gBAAgB,CAAC,IAAY;IAC1C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IACpC,IAAI,GAAY,CAAC;IACjB,IAAI,CAAC;QACH,GAAG,GAAG,SAAS,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;IAChD,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1F,CAAC;IACD,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC1E,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,+BAA+B,EAAE,CAAC;IAEjG,MAAM,KAAK,GAAG,GAAG,CAAC,cAAc,CAAC,CAAC;IAClC,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC5D,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,qEAAqE,EAAE,CAAC;IACrH,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC3C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACxC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;YACX,EAAE;YACF,MAAM,EAAE,MAAM;YACd,GAAG,CAAC,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxF,GAAG,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACvE,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAAC,OAAgB;IAC7D,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QACrC,gBAAgB,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC3C,kBAAkB,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;KAC/C,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;YACf,GAAG,QAAQ;YACX,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,MAAM,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM;YAChD,IAAI,EAAE,GAAG,CAAC,IAAI;SACf,CAAC,CAAC;IACL,CAAC;IACD,OAAO;QACL,GAAG,IAAI;QACP,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO;QACrC,IAAI;QACJ,IAAI;KACL,CAAC;AACJ,CAAC","sourcesContent":["/**\n * The fleet's capability vocabulary: which business capabilities exist, by\n * declared name, so a requirement's `Capability:` line resolves or refuses\n * instead of silently labelling.\n *\n * It is a fleet document (`architecture/capabilities.yaml`, beside the\n * landscape and the permissions vocabulary) because a capability crosses\n * services by definition — \"registration\" is realized by requirements in four\n * repositories, and a per-service copy would be N spellings of one word.\n *\n * What this is NOT, deliberately: a domain model, and not an authored prose\n * layer either. SCHEMA.md rejected a free-text `capability:` label because\n * nothing could check it; a DECLARED name is different in exactly the way that\n * mattered there — the id exists in this file or it does not, so an unknown\n * name is an error with close candidates, a declaration nothing realizes is a\n * warning, and the vocabulary cannot drift while looking authoritative. The\n * long-lived capability documents themselves (one page per capability, revised\n * by features) stay outside loam — that is the roadmap's evidence-gated Later\n * item, and the rollup built over these names is the evidence that decides it.\n *\n * The OPT-IN also differs from the authorization axis, on purpose: there the\n * `Requires:` line is the opt-in and a missing permissions.yaml is an error at\n * the line; here the FILE is the opt-in — a fleet with no capabilities.yaml\n * produces no capability findings at all (`core/capabilities/findings.ts`\n * holds the rule and the reason).\n */\nimport { readFile } from \"node:fs/promises\";\nimport { existsSync } from \"node:fs\";\nimport { parse as parseYaml } from \"yaml\";\nimport { isRecord } from \"../kernel/records.js\";\nimport type { DocsDir } from \"../kernel/ids/dirs.js\";\nimport { capabilitiesPath } from \"../repo/paths.js\";\nimport { capabilityDocsDir } from \"../repo/authored/paths.js\";\nimport { readCapabilityTree, type CapabilityTree } from \"./tree.js\";\n\n/** One declared capability. The id is the full key, slashes preserved. */\nexport interface Capability {\n  /**\n   * The token a requirement's `Capability:` line writes. Nesting is spelled\n   * INSIDE the id (`payments/refunds`) and never collapsed — the key is\n   * exactly the string a requirement names, greppable as written.\n   */\n  id: string;\n  description?: string;\n  /**\n   * A team or a person — deliberately `owner:`, not permissions' `owned_by:`,\n   * because that field carries \"defining service\" semantics a capability does\n   * not have. Never resolved against anything; a blank is a worse answer than\n   * an unverified one.\n   */\n  owner?: string;\n  /**\n   * Which side declared this id. `yaml` is a name in\n   * `architecture/capabilities.yaml` with no document; `tree` is a\n   * `capabilities/<id>/spec.md` the YAML does not name; `both` is the same id\n   * on both sides, which is normal rather than a duplicate — the YAML declared\n   * the word first and somebody has since written the document for it.\n   *\n   * Recorded rather than derived at each reader, because the two sides carry\n   * different fixes: a `yaml`-only capability is fixed by writing the document,\n   * a `tree`-only one needs no fix at all, and a message that could not tell\n   * them apart would advise editing a file that may not exist.\n   */\n  source: \"yaml\" | \"tree\" | \"both\";\n  /** `capabilities/<id>/spec.md`, absolute, when the tree declares this id. */\n  spec?: string;\n}\n\nexport interface CapabilityVocabulary {\n  /**\n   * False when NEITHER `architecture/capabilities.yaml` nor `capabilities/`\n   * exists. Either one is the axis's opt-in, so a fleet holding neither\n   * produces no capability finding at all, however many `Capability:` lines its\n   * requirements already carry.\n   */\n  present: boolean;\n  /**\n   * Why `architecture/capabilities.yaml` could not be read as a vocabulary,\n   * when it could not. The TREE has no such state: a directory either lists or\n   * it does not, and an unreadable one is a filesystem failure the walk lets\n   * throw rather than a document loam misread.\n   */\n  invalid?: string;\n  /** Declared capabilities, keyed by the full id — the union of both sides. */\n  byId: Map<string, Capability>;\n  /** What the `capabilities/` walk found, for the graders that need the paths. */\n  tree: CapabilityTree;\n}\n\nconst NO_TREE: CapabilityTree = { present: false, docs: [], undocumented: [] };\nconst EMPTY: CapabilityVocabulary = { present: false, byId: new Map(), tree: NO_TREE };\n\n/**\n * Read the vocabulary — exactly `permissions.ts`'s defensive ladder, because\n * the two files fail the same ways: a missing file is silence, a YAML error or\n * a non-mapping shape is `invalid` (one finding for the whole run, the family\n * suppressed behind it), an empty document is a present-and-empty vocabulary,\n * and a declaration whose body is not a mapping is treated as `{}` rather than\n * refusing the whole file over one leaf.\n */\nasync function readCapabilities(path: string): Promise<CapabilityVocabulary> {\n  if (!existsSync(path)) return EMPTY;\n  let doc: unknown;\n  try {\n    doc = parseYaml(await readFile(path, \"utf8\"));\n  } catch (e) {\n    return { ...EMPTY, present: true, invalid: e instanceof Error ? e.message : String(e) };\n  }\n  if (doc === null || doc === undefined) return { ...EMPTY, present: true };\n  if (!isRecord(doc)) return { ...EMPTY, present: true, invalid: \"the document is not a mapping\" };\n\n  const block = doc[\"capabilities\"];\n  if (block === undefined) return { ...EMPTY, present: true };\n  if (!isRecord(block)) {\n    return { ...EMPTY, present: true, invalid: \"`capabilities` is not a mapping of capability id to its declaration\" };\n  }\n\n  const byId = new Map<string, Capability>();\n  for (const [id, body] of Object.entries(block)) {\n    const decl = isRecord(body) ? body : {};\n    byId.set(id, {\n      id,\n      source: \"yaml\",\n      ...(typeof decl[\"description\"] === \"string\" ? { description: decl[\"description\"] } : {}),\n      ...(typeof decl[\"owner\"] === \"string\" ? { owner: decl[\"owner\"] } : {}),\n    });\n  }\n  return { ...EMPTY, present: true, byId };\n}\n\n/**\n * THE vocabulary — both sides read and merged, and the only shape a grader\n * should ever be handed.\n *\n * `readCapabilities` above is the file alone, and it is private to this\n * module because nothing that grades a fleet may use it: a `Capability:` line\n * naming an id the tree declares and the YAML does not would resolve through\n * the union and fail through the file, so a second spelling of \"the\n * vocabulary\" is a second answer to `capability.unknown`.\n *\n * WHERE AN ID SITS ON BOTH SIDES THE YAML'S METADATA SURVIVES, and not by\n * precedence — the document has nothing to overwrite it with. `description` and\n * `owner` are fields, and this axis's own rule is that an entry without prose\n * stays a line in YAML; the document's contribution is the narrative and the\n * requirements, which are prose, and loam reads frontmatter, never prose. So a\n * capability declared only in the tree has no owner in `loam list\n * capabilities`, and that is the honest reading rather than a gap: nobody wrote\n * one down. What the merge adds on that side is `spec` and `source`.\n *\n * An UNREADABLE YAML suspends the whole family (`gradableCapabilityIds` in\n * `./findings.ts` is the one statement of that ladder), and the tree is still\n * walked and still carried: `capability.doc-missing` is a fact about\n * directories that no YAML failure makes untrue, and suppressing it behind an\n * unrelated broken file would hide a half-created capability until somebody\n * fixed a document it has nothing to do with.\n */\nexport async function readCapabilityVocabulary(docsDir: DocsDir): Promise<CapabilityVocabulary> {\n  const [yaml, tree] = await Promise.all([\n    readCapabilities(capabilitiesPath(docsDir)),\n    readCapabilityTree(capabilityDocsDir(docsDir)),\n  ]);\n  const byId = new Map(yaml.byId);\n  for (const doc of tree.docs) {\n    const declared = byId.get(doc.id);\n    byId.set(doc.id, {\n      ...declared,\n      id: doc.id,\n      source: declared === undefined ? \"tree\" : \"both\",\n      spec: doc.spec,\n    });\n  }\n  return {\n    ...yaml,\n    present: yaml.present || tree.present,\n    byId,\n    tree,\n  };\n}\n"]}

package/dist/core/capabilities/delta/doc.js

@@ -2,11 +2,13 @@
  * The capability document's own three grades, applied to a FEATURE'S DELTA.
  *
  * `../findings.ts` grades the living `capabilities/<id>/spec.md` and files
- * Findings for `loam validate`. This is the same three rules shaped as archive
- * Issues — the twin `capabilityUnknownFindings`/`capabilityUnknownIssues`
- * already are one directory over, and for the identical reason: severity says
+ * Findings for `loam validate`. This is the same three rules filed as archive
+ * Issues — the split `capabilityUnknownIssues` one directory over makes
+ * between its two commands, and for the identical reason: severity says
  * whether the DOCUMENT is valid, gating says whether the MERGE is safe, and the
- * two questions are asked by two different commands about the same text.
+ * two questions are asked by two different commands about the same text. A grade
+ * is already an Issue in shape (its return type pins severity and code), so
+ * the rules' own objects are returned, not copied field by field.
  *
  * WITHOUT THIS THE DELTA PATH IS A HOLE THROUGH THE RULE. A capability
  * requirement carrying `Operations:` is a service requirement filed at the
@@ -40,11 +42,6 @@ import { capabilityDocFindings } from "../findings.js";
  */
 export function capabilityDocIssues(reqs, target) {
     const merging = reqs.filter((r) => r.kind === "ADDED" || r.kind === "MODIFIED");
-    return capabilityDocFindings(merging, target.subject, target.where).map((f) => ({
-        severity: f.severity,
-        code: f.code,
-        subject: f.subject,
-        message: f.message,
-    }));
+    return capabilityDocFindings(merging, target.subject, target.where);
 }
 //# sourceMappingURL=doc.js.map

package/dist/core/capabilities/delta/doc.js.map

@@ -1 +1 @@
-{"version":3,"file":"doc.js","sourceRoot":"","sources":["../../../../src/core/capabilities/delta/doc.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,OAAO,EAAE,qBAAqB,EAAyB,MAAM,gBAAgB,CAAC;AAI9E;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAmB,EAAE,MAAwB;IAC/E,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;IAChF,OAAO,qBAAqB,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9E,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,OAAO,EAAE,CAAC,CAAC,OAAO;KACnB,CAAC,CAAC,CAAC;AACN,CAAC","sourcesContent":["/**\n * The capability document's own three grades, applied to a FEATURE'S DELTA.\n *\n * `../findings.ts` grades the living `capabilities/<id>/spec.md` and files\n * Findings for `loam validate`. This is the same three rules shaped as archive\n * Issues — the twin `capabilityUnknownFindings`/`capabilityUnknownIssues`\n * already are one directory over, and for the identical reason: severity says\n * whether the DOCUMENT is valid, gating says whether the MERGE is safe, and the\n * two questions are asked by two different commands about the same text.\n *\n * WITHOUT THIS THE DELTA PATH IS A HOLE THROUGH THE RULE. A capability\n * requirement carrying `Operations:` is a service requirement filed at the\n * business altitude — the one thing that makes a second requirements corpus\n * worth having is that it does not become a second place to write the first\n * one. Graded only on the living document, that requirement merges cleanly and\n * earns its error afterwards, against a file whoever reads the finding did not\n * write and cannot un-merge. So the delta is graded BEFORE the merge, where the\n * author is still holding the document.\n *\n * ADDED AND MODIFIED ONLY. A REMOVED requirement is being retired: demanding a\n * `Requirement-ID:` on it, or refusing the `Operations:` line it is deleting,\n * would ask for an edit to text that is about to stop existing. A BASE\n * requirement is a delta quoting living context, already named by\n * `delta.requirement-not-merged`, and it merges nothing — two findings for one\n * mistake is the failure to avoid.\n *\n * NO CODES OF ITS OWN, and no message of its own. Every sentence comes from\n * `capabilityDocFindings`, whose `where` parameter is what points them at the\n * feature's copy of the document.\n */\nimport { capabilityDocFindings, type CapabilityTarget } from \"../findings.js\";\nimport type { Requirement } from \"../../document/spec.js\";\nimport type { Issue } from \"../../vocabulary/issue.js\";\n\n/**\n * The three grades, as archive-gating Issues, over the requirements a\n * capability delta would actually merge.\n *\n * `target.where` is the delta's repo-relative path so a reader is sent to the\n * file they wrote, and `target.subject` is the capability id so a `--json`\n * consumer groups by promise rather than by path — the same split every other\n * capability grade uses.\n */\nexport function capabilityDocIssues(reqs: Requirement[], target: CapabilityTarget): Issue[] {\n  const merging = reqs.filter((r) => r.kind === \"ADDED\" || r.kind === \"MODIFIED\");\n  return capabilityDocFindings(merging, target.subject, target.where).map((f) => ({\n    severity: f.severity,\n    code: f.code,\n    subject: f.subject,\n    message: f.message,\n  }));\n}\n"]}
+{"version":3,"file":"doc.js","sourceRoot":"","sources":["../../../../src/core/capabilities/delta/doc.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,OAAO,EAAE,qBAAqB,EAAyB,MAAM,gBAAgB,CAAC;AAI9E;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAmB,EAAE,MAAwB;IAC/E,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;IAChF,OAAO,qBAAqB,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;AACtE,CAAC","sourcesContent":["/**\n * The capability document's own three grades, applied to a FEATURE'S DELTA.\n *\n * `../findings.ts` grades the living `capabilities/<id>/spec.md` and files\n * Findings for `loam validate`. This is the same three rules filed as archive\n * Issues — the split `capabilityUnknownIssues` one directory over makes\n * between its two commands, and for the identical reason: severity says\n * whether the DOCUMENT is valid, gating says whether the MERGE is safe, and the\n * two questions are asked by two different commands about the same text. A grade\n * is already an Issue in shape (its return type pins severity and code), so\n * the rules' own objects are returned, not copied field by field.\n *\n * WITHOUT THIS THE DELTA PATH IS A HOLE THROUGH THE RULE. A capability\n * requirement carrying `Operations:` is a service requirement filed at the\n * business altitude — the one thing that makes a second requirements corpus\n * worth having is that it does not become a second place to write the first\n * one. Graded only on the living document, that requirement merges cleanly and\n * earns its error afterwards, against a file whoever reads the finding did not\n * write and cannot un-merge. So the delta is graded BEFORE the merge, where the\n * author is still holding the document.\n *\n * ADDED AND MODIFIED ONLY. A REMOVED requirement is being retired: demanding a\n * `Requirement-ID:` on it, or refusing the `Operations:` line it is deleting,\n * would ask for an edit to text that is about to stop existing. A BASE\n * requirement is a delta quoting living context, already named by\n * `delta.requirement-not-merged`, and it merges nothing — two findings for one\n * mistake is the failure to avoid.\n *\n * NO CODES OF ITS OWN, and no message of its own. Every sentence comes from\n * `capabilityDocFindings`, whose `where` parameter is what points them at the\n * feature's copy of the document.\n */\nimport { capabilityDocFindings, type CapabilityTarget } from \"../findings.js\";\nimport type { Requirement } from \"../../document/spec.js\";\nimport type { Issue } from \"../../vocabulary/issue.js\";\n\n/**\n * The three grades, as archive-gating Issues, over the requirements a\n * capability delta would actually merge.\n *\n * `target.where` is the delta's repo-relative path so a reader is sent to the\n * file they wrote, and `target.subject` is the capability id so a `--json`\n * consumer groups by promise rather than by path — the same split every other\n * capability grade uses.\n */\nexport function capabilityDocIssues(reqs: Requirement[], target: CapabilityTarget): Issue[] {\n  const merging = reqs.filter((r) => r.kind === \"ADDED\" || r.kind === \"MODIFIED\");\n  return capabilityDocFindings(merging, target.subject, target.where);\n}\n"]}