@ybotok/loam 0.0.0 → 0.1.0-beta.2

package/dist/core/likec4.js

@@ -0,0 +1,479 @@
+import { readFile } from "node:fs/promises";
+import { LikeC4 } from "likec4";
+/**
+ * The service directory an element stands for: an explicit
+ * `metadata { service '<id>' }` binding wins, the title is the fallback.
+ *
+ * The fallback is what every docs repo written before the binding existed relies
+ * on, and it is also the trap the binding exists to close: matching on the title
+ * means renaming a box in a diagram silently unlinks it from its service, and
+ * every check that joined the two just stops finding anything.
+ */
+export function elementService(e) {
+    return e.service ?? e.title;
+}
+/**
+ * Every id an endpoint may be filed under, nearest first: `a.b.c`, `a.b`, `a`.
+ *
+ * A landscape does not have to draw a service as one opaque box. The moment
+ * somebody models its containers — `paymentService.api`, `paymentService.worker`
+ * — an edge drawn INTO a container is still an edge into the service, and every
+ * join that groups by service has to know that. Resolving only the exact id is
+ * what made those edges invisible: the spine check silently skipped them, and
+ * the no-openapi grace treated a service with a dozen inbound container calls as
+ * one nobody calls at all.
+ */
+function ancestorIds(id) {
+    const out = [id];
+    for (let dot = id.lastIndexOf("."); dot !== -1; dot = id.lastIndexOf(".", dot - 1)) {
+        out.push(id.slice(0, dot));
+    }
+    return out;
+}
+/**
+ * A memoized `id -> service` resolver over one document.
+ *
+ * Resolution order, and why it is this order:
+ *
+ *  1. the nearest ancestor (the id itself first) carrying an explicit
+ *     `metadata { service '<id>' }` — a binding is a claim somebody wrote down,
+ *     so it outranks every guess;
+ *  2. the nearest ancestor whose title names a REAL `services/<id>/` directory —
+ *     positive evidence from the filesystem, available only to callers that
+ *     hand in `known`;
+ *  3. the element's own title, and finally the raw id — today's fallback, kept
+ *     LAST because it is the one that lies: it happily resolves
+ *     `paymentService.api` to "api", a service that has never existed.
+ *
+ * Built once per document and shared, because it is called inside loops over
+ * every relationship and the walk up the ancestor chain is not free.
+ */
+export function serviceResolver(elements, known) {
+    const byId = new Map(elements.map((e) => [e.id, e]));
+    const memo = new Map();
+    return (id) => {
+        const hit = memo.get(id);
+        if (hit !== undefined)
+            return hit;
+        let answer;
+        for (const candidate of ancestorIds(id)) {
+            const e = byId.get(candidate);
+            if (e?.service !== undefined) {
+                answer = e.service;
+                break;
+            }
+        }
+        if (answer === undefined && known !== undefined) {
+            for (const candidate of ancestorIds(id)) {
+                const e = byId.get(candidate);
+                if (e !== undefined && known.has(e.title)) {
+                    answer = e.title;
+                    break;
+                }
+            }
+        }
+        if (answer === undefined) {
+            const self = byId.get(id);
+            answer = self ? elementService(self) : id;
+        }
+        memo.set(id, answer);
+        return answer;
+    };
+}
+/**
+ * The service a relationship endpoint belongs to. An id that names no element
+ * resolves to itself, so a partial document degrades to the id rather than
+ * throwing.
+ *
+ * `known` is the set of service directories that actually exist; pass it
+ * wherever the caller has enumerated `services/`, so an edge into a modelled
+ * container resolves to the service that owns it instead of to the container's
+ * own title. Callers with a single document and no repository in hand omit it
+ * and keep the pre-existing behaviour.
+ */
+export function serviceOf(elements, id, known) {
+    return serviceResolver(elements, known)(id);
+}
+/** Flatten a LikeC4 model into loam's neutral `Elem`/`Rel` view. */
+export function flattenModel(model) {
+    const elements = [...model.elements()].map((e) => ({
+        id: e.id,
+        kind: e.kind,
+        title: e.title,
+        description: descText(e.description),
+        service: metaKey(e.metadata, "service"),
+        tags: [...(e.tags ?? [])],
+    }));
+    const relationships = [...model.relationships()].map((r) => ({
+        source: r.source.id,
+        target: r.target.id,
+        // LikeC4 reports an untitled edge as title: null — normalize to the declared `title?: string`.
+        title: r.title ?? undefined,
+        op: metaKey(r.metadata, "op"),
+        tags: [...(r.tags ?? [])],
+    }));
+    return { elements, relationships };
+}
+/**
+ * Load and validate a single self-contained `.likec4` document, in-process
+ * (no external tool, no JVM). Returns validation errors and, if clean, the
+ * flattened elements + relationships.
+ */
+export async function loadFile(path) {
+    return loadSource(await readFile(path, "utf8"));
+}
+/**
+ * `loadFile` for text that is not (yet) on disk — what the archive merge uses
+ * to prove a computed landscape parses BEFORE anything is written.
+ */
+export async function loadSource(src) {
+    // LikeC4 owns a Langium workspace and registers a process-exit listener for
+    // it. Validation creates many short-lived instances, so every acquired
+    // instance must be disposed even on an invalid document or a failed model
+    // computation. Its logger is disabled because diagnostics are returned in
+    // LoadedDoc instead of being written out-of-band to stderr.
+    const likec4 = await LikeC4.fromSource(src, { logger: false });
+    try {
+        // Assigned, not cast: LikeC4 declares `getErrors()` as a non-nullable array
+        // whose element type is structurally wider than ours, so the compiler can
+        // check the shape here. The cast was the only thing standing between a
+        // dependency renaming `message` and a build that still succeeded — and the
+        // `?? []` it carried could never fire.
+        const errors = likec4.getErrors();
+        if (errors.length > 0) {
+            return { errors, elements: [], relationships: [] };
+        }
+        // `parsedModel`, not `computedModel`: the computed stage additionally
+        // computes every VIEW the document declares (and a default one when it
+        // declares none), which loam never reads — it renders nothing. That work is
+        // superlinear in the number of RELATIONSHIPS, so a landscape at fleet shape
+        // turned `loam list` from under a second into minutes. The elements and
+        // relationships below are identical either way.
+        const model = (await likec4.parsedModel());
+        return { errors, ...flattenModel(model) };
+    }
+    finally {
+        await likec4.dispose();
+    }
+}
+/**
+ * Read one string key out of a LikeC4 `metadata { ... }` block. Two keys carry
+ * loam's spines: `op` on a relationship (the OpenAPI operationId it calls) and
+ * `service` on an element (the services/<id> directory it stands for). Elements
+ * with no metadata come back as `{}`, so a missing key is indistinguishable from
+ * a missing block — both mean "not bound".
+ */
+function metaKey(m, key) {
+    if (m && typeof m === "object") {
+        const v = m[key];
+        if (typeof v === "string")
+            return v;
+    }
+    return undefined;
+}
+/** LikeC4 descriptions can be a string or a rich-text object ({ txt } / { text } / { md }). */
+function descText(d) {
+    if (typeof d === "string")
+        return d;
+    if (d && typeof d === "object") {
+        const o = d;
+        for (const key of ["txt", "text", "md", "value"]) {
+            const v = o[key];
+            if (typeof v === "string")
+                return v;
+        }
+    }
+    return undefined;
+}
+export function maskSource(text) {
+    const out = text.split("");
+    const literals = [];
+    let state = "code";
+    let litStart = -1;
+    let lit = "";
+    for (let i = 0; i < text.length; i += 1) {
+        const ch = text[i];
+        const next = text[i + 1];
+        switch (state) {
+            case "code":
+                if (ch === "'" || ch === '"') {
+                    state = ch === "'" ? "squote" : "dquote";
+                    litStart = i;
+                    lit = "";
+                    out[i] = " ";
+                }
+                else if (ch === "/" && next === "/") {
+                    state = "lineComment";
+                    out[i] = " ";
+                }
+                else if (ch === "/" && next === "*") {
+                    state = "blockComment";
+                    out[i] = " ";
+                }
+                break;
+            case "squote":
+            case "dquote":
+                if (ch === "\\" && i + 1 < text.length) {
+                    lit += text[i + 1];
+                    out[i] = " ";
+                    out[i + 1] = " ";
+                    i += 1;
+                }
+                else if (ch === (state === "squote" ? "'" : '"')) {
+                    literals.push({ start: litStart, end: i + 1, value: lit });
+                    state = "code";
+                    out[i] = " ";
+                }
+                else {
+                    lit += ch;
+                    if (ch !== "\n")
+                        out[i] = " ";
+                }
+                break;
+            case "lineComment":
+                if (ch === "\n")
+                    state = "code";
+                else
+                    out[i] = " ";
+                break;
+            case "blockComment":
+                if (ch === "*" && next === "/") {
+                    state = "code";
+                    out[i] = " ";
+                    out[i + 1] = " ";
+                    i += 1;
+                }
+                else if (ch !== "\n") {
+                    out[i] = " ";
+                }
+                break;
+        }
+    }
+    return { code: out.join(""), literals };
+}
+/** Index of the `}` matching the `{` at `open`, over MASKED code; -1 when unbalanced. */
+export function matchBrace(code, open) {
+    let depth = 0;
+    for (let i = open; i < code.length; i += 1) {
+        if (code[i] === "{")
+            depth += 1;
+        else if (code[i] === "}") {
+            depth -= 1;
+            if (depth === 0)
+                return i;
+        }
+    }
+    return -1;
+}
+/**
+ * Locate every element and relationship declaration inside the top-level
+ * `model { ... }` block of a LikeC4 source, with the byte range each one
+ * occupies. This is the splice map `loam archive` merges the landscape with:
+ * the parsed model says WHAT exists, this says WHERE its authored text is —
+ * verbatim, so nothing the parser does not model (technology, style, links)
+ * can be lost by rebuilding it.
+ *
+ * Both declaration forms are recognised — `name = kind ...` always, and
+ * `kind name ...` for any kind the document's own `specification` block
+ * declares. Relationship endpoints are resolved the way LikeC4 reads them:
+ * innermost enclosing scope outward, then the top level, then a unique leaf
+ * name anywhere; `it`/`this` (and an omitted source) mean the enclosing
+ * element. A name that resolves nowhere is left as written — the caller's
+ * match against the parsed model then fails loudly instead of guessing.
+ *
+ * Returns null when there is no model block. Callers only hand in documents
+ * LikeC4 has already parsed, so the scan can trust balanced braces.
+ */
+export function scanModel(text) {
+    const { code, literals } = maskSource(text);
+    const m = /\bmodel\s*\{/.exec(code);
+    if (!m)
+        return null;
+    const open = m.index + m[0].length - 1;
+    const close = matchBrace(code, open);
+    if (close === -1)
+        return null;
+    // Element kinds from the specification block(s): the `<kind> <name>`
+    // declaration form is recognisable only by its first token being a kind.
+    const kinds = new Set();
+    for (const sm of code.matchAll(/\bspecification\s*\{/g)) {
+        const sClose = matchBrace(code, sm.index + sm[0].length - 1);
+        if (sClose === -1)
+            continue;
+        for (const em of code.slice(sm.index, sClose).matchAll(/\belement\s+([A-Za-z_][\w-]*)/g)) {
+            kinds.add(em[1]);
+        }
+    }
+    const indentOf = (at) => {
+        const nl = text.lastIndexOf("\n", at - 1);
+        const ws = text.slice(nl + 1, at);
+        return /^[ \t]*$/.test(ws) ? ws : "";
+    };
+    const literalIn = (from, to) => literals.find((l) => l.start >= from && l.end <= to);
+    const keyedLiteral = (key, from, to) => {
+        if (from === -1)
+            return undefined;
+        const re = new RegExp(`\\b${key}\\b`, "g");
+        re.lastIndex = from;
+        const km = re.exec(code);
+        if (km === null || km.index >= to)
+            return undefined;
+        return literalIn(km.index, to)?.value;
+    };
+    const trimmedEnd = (from, to) => {
+        let e = to;
+        while (e > from && /\s/.test(text[e - 1]))
+            e -= 1;
+        return e;
+    };
+    const elements = [];
+    const raw = [];
+    const stack = [];
+    let i = open + 1;
+    while (i < close) {
+        const ch = code[i];
+        if (/\s/.test(ch)) {
+            i += 1;
+            continue;
+        }
+        if (ch === "}") {
+            const frame = stack.pop();
+            if (frame !== undefined) {
+                frame.el.bodyClose = i;
+                frame.el.end = i + 1;
+                elements.push(frame.el);
+            }
+            i += 1;
+            continue;
+        }
+        // A statement's head: up to its own `{`, the end of the line, or the
+        // enclosing block's `}` on the same line — whichever comes first.
+        const stmtStart = i;
+        let headEnd = close;
+        let opener = -1;
+        for (let j = i; j < close; j += 1) {
+            const c = code[j];
+            if (c === "\n" || c === "}") {
+                headEnd = j;
+                break;
+            }
+            if (c === "{") {
+                opener = j;
+                headEnd = j;
+                break;
+            }
+        }
+        const head = code.slice(stmtStart, headEnd);
+        const parentId = stack.length > 0 ? stack[stack.length - 1].id : "";
+        // Classify: `name = kind` first, then a relationship (the arrow cannot hide
+        // in a string — the head is masked), then the `kind name` form, else a
+        // property/tag line that is consumed whole, nested block included.
+        let localName = null;
+        const assign = /^([A-Za-z_]\w*)\s*=\s*[A-Za-z_]/.exec(head);
+        if (assign !== null) {
+            localName = assign[1];
+        }
+        else if (!head.includes("->")) {
+            const toks = head.trim().split(/\s+/);
+            if (toks.length >= 2 && kinds.has(toks[0]) && /^[A-Za-z_]\w*$/.test(toks[1])) {
+                localName = toks[1];
+            }
+        }
+        if (localName !== null) {
+            const id = parentId === "" ? localName : `${parentId}.${localName}`;
+            const el = {
+                id,
+                start: stmtStart,
+                end: headEnd,
+                bodyOpen: opener,
+                bodyClose: -1,
+                indent: indentOf(stmtStart),
+            };
+            if (opener !== -1) {
+                stack.push({ id, el });
+                i = opener + 1;
+            }
+            else {
+                el.end = trimmedEnd(stmtStart, headEnd);
+                elements.push(el);
+                i = headEnd;
+            }
+            continue;
+        }
+        if (head.includes("->")) {
+            const bClose = opener === -1 ? -1 : matchBrace(code, opener);
+            const stmtEnd = opener === -1 ? trimmedEnd(stmtStart, headEnd) : bClose === -1 ? close : bClose + 1;
+            const am = /^([A-Za-z_][\w.]*)?\s*(?:-\[[^\]]*\])?->\s*([A-Za-z_][\w.]*)/.exec(head);
+            if (am !== null) {
+                const arrowEnd = stmtStart + am[0].length;
+                const bodyFrom = opener === -1 ? -1 : opener + 1;
+                const bodyTo = opener === -1 ? -1 : stmtEnd - 1;
+                const title = literalIn(arrowEnd, headEnd)?.value ?? keyedLiteral("title", bodyFrom, bodyTo);
+                const tags = [];
+                for (const tm of code.slice(stmtStart, stmtEnd).matchAll(/#([\w-]+)/g))
+                    tags.push(tm[1]);
+                raw.push({
+                    srcLit: am[1],
+                    tgtLit: am[2],
+                    parent: parentId,
+                    start: stmtStart,
+                    end: stmtEnd,
+                    indent: indentOf(stmtStart),
+                    title,
+                    op: keyedLiteral("op", bodyFrom, bodyTo),
+                    tags,
+                });
+            }
+            i = Math.max(stmtEnd, headEnd);
+            continue;
+        }
+        if (opener !== -1) {
+            const bClose = matchBrace(code, opener);
+            i = bClose === -1 ? close : bClose + 1;
+        }
+        else {
+            i = headEnd;
+        }
+    }
+    // Resolve relationship endpoints against everything declared anywhere in the
+    // model — LikeC4 resolution is not order-dependent, so neither is this.
+    const ids = new Set(elements.map((e) => e.id));
+    const byLeaf = new Map();
+    for (const e of elements) {
+        const leaf = e.id.slice(e.id.lastIndexOf(".") + 1);
+        byLeaf.set(leaf, [...(byLeaf.get(leaf) ?? []), e.id]);
+    }
+    const resolve = (lit, enclosing) => {
+        if (lit === undefined || lit === "it" || lit === "this")
+            return enclosing;
+        const segs = lit.split(".");
+        let base;
+        for (let scope = enclosing; scope !== "" && base === undefined;) {
+            if (ids.has(`${scope}.${segs[0]}`))
+                base = `${scope}.${segs[0]}`;
+            const dot = scope.lastIndexOf(".");
+            scope = dot === -1 ? "" : scope.slice(0, dot);
+        }
+        if (base === undefined && ids.has(segs[0]))
+            base = segs[0];
+        if (base === undefined) {
+            const leafed = byLeaf.get(segs[0]);
+            if (leafed !== undefined && leafed.length === 1)
+                base = leafed[0];
+        }
+        return [base ?? segs[0], ...segs.slice(1)].join(".");
+    };
+    const rels = raw.map((r) => ({
+        source: resolve(r.srcLit, r.parent),
+        target: resolve(r.tgtLit, r.parent),
+        title: r.title,
+        op: r.op,
+        tags: r.tags,
+        start: r.start,
+        end: r.end,
+        indent: r.indent,
+    }));
+    elements.sort((a, b) => a.start - b.start);
+    return { open, close, elements, rels };
+}
+//# sourceMappingURL=likec4.js.map

package/dist/core/likec4.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"likec4.js","sourceRoot":"","sources":["../../src/core/likec4.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAwBhC;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,CAAO;IACpC,OAAO,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC;AAC9B,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,WAAW,CAAC,EAAU;IAC7B,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;IACjB,KAAK,IAAI,GAAG,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;QACnF,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAgB,EAChB,KAA2B;IAE3B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,OAAO,CAAC,EAAU,EAAU,EAAE;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,GAAG,CAAC;QAClC,IAAI,MAA0B,CAAC;QAC/B,KAAK,MAAM,SAAS,IAAI,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC9B,IAAI,CAAC,EAAE,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC7B,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC;gBACnB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,MAAM,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAChD,KAAK,MAAM,SAAS,IAAI,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC;gBACxC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAC9B,IAAI,CAAC,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC1C,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC;oBACjB,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1B,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACrB,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CAAC,QAAgB,EAAE,EAAU,EAAE,KAA2B;IACjF,OAAO,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;AAC9C,CAAC;AA8CD,oEAAoE;AACpE,MAAM,UAAU,YAAY,CAAC,KAAoB;IAC/C,MAAM,QAAQ,GAAW,CAAC,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACzD,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC;QACpC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,SAAS,CAAC;QACvC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;KAC1B,CAAC,CAAC,CAAC;IACJ,MAAM,aAAa,GAAU,CAAC,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE;QACnB,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE;QACnB,+FAA+F;QAC/F,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,SAAS;QAC3B,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC;QAC7B,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;KAC1B,CAAC,CAAC,CAAC;IACJ,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC;AACrC,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,IAAY;IACzC,OAAO,UAAU,CAAC,MAAM,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AAClD,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,GAAW;IAC1C,4EAA4E;IAC5E,uEAAuE;IACvE,0EAA0E;IAC1E,0EAA0E;IAC1E,4DAA4D;IAC5D,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;IAC/D,IAAI,CAAC;QACH,4EAA4E;QAC5E,0EAA0E;QAC1E,uEAAuE;QACvE,2EAA2E;QAC3E,uCAAuC;QACvC,MAAM,MAAM,GAAkB,MAAM,CAAC,SAAS,EAAE,CAAC;QACjD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,CAAC;QACrD,CAAC;QAED,sEAAsE;QACtE,uEAAuE;QACvE,4EAA4E;QAC5E,4EAA4E;QAC5E,wEAAwE;QACxE,gDAAgD;QAChD,MAAM,KAAK,GAAG,CAAC,MAAM,MAAM,CAAC,WAAW,EAAE,CAAkB,CAAC;QAC5D,OAAO,EAAE,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;IAC5C,CAAC;YAAS,CAAC;QACT,MAAM,MAAM,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,OAAO,CAAC,CAAU,EAAE,GAAW;IACtC,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAI,CAA6B,CAAC,GAAG,CAAC,CAAC;QAC9C,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,OAAO,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,+FAA+F;AAC/F,SAAS,QAAQ,CAAC,CAAU;IAC1B,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,CAAC,CAAC;IACpC,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,CAA4B,CAAC;QACvC,KAAK,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;YACjD,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACjB,IAAI,OAAO,CAAC,KAAK,QAAQ;gBAAE,OAAO,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAwBD,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC3B,MAAM,QAAQ,GAAoB,EAAE,CAAC;IAErC,IAAI,KAAK,GAAU,MAAM,CAAC;IAC1B,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzB,QAAQ,KAAK,EAAE,CAAC;YACd,KAAK,MAAM;gBACT,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;oBAC7B,KAAK,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;oBACzC,QAAQ,GAAG,CAAC,CAAC;oBACb,GAAG,GAAG,EAAE,CAAC;oBACT,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBACf,CAAC;qBAAM,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;oBACtC,KAAK,GAAG,aAAa,CAAC;oBACtB,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBACf,CAAC;qBAAM,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;oBACtC,KAAK,GAAG,cAAc,CAAC;oBACvB,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBACf,CAAC;gBACD,MAAM;YACR,KAAK,QAAQ,CAAC;YACd,KAAK,QAAQ;gBACX,IAAI,EAAE,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;oBACvC,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;oBACpB,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;oBACb,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;oBACjB,CAAC,IAAI,CAAC,CAAC;gBACT,CAAC;qBAAM,IAAI,EAAE,KAAK,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBACnD,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;oBAC3D,KAAK,GAAG,MAAM,CAAC;oBACf,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBACf,CAAC;qBAAM,CAAC;oBACN,GAAG,IAAI,EAAE,CAAC;oBACV,IAAI,EAAE,KAAK,IAAI;wBAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBAChC,CAAC;gBACD,MAAM;YACR,KAAK,aAAa;gBAChB,IAAI,EAAE,KAAK,IAAI;oBAAE,KAAK,GAAG,MAAM,CAAC;;oBAC3B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBAClB,MAAM;YACR,KAAK,cAAc;gBACjB,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;oBAC/B,KAAK,GAAG,MAAM,CAAC;oBACf,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;oBACb,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;oBACjB,CAAC,IAAI,CAAC,CAAC;gBACT,CAAC;qBAAM,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBACvB,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBACf,CAAC;gBACD,MAAM;QACV,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC;AAC1C,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,UAAU,CAAC,IAAY,EAAE,IAAY;IACnD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,KAAK,IAAI,CAAC,CAAC;aAC3B,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACzB,KAAK,IAAI,CAAC,CAAC;YACX,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAqCD;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,SAAS,CAAC,IAAY;IACpC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAC5C,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACpB,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACrC,IAAI,KAAK,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAE9B,qEAAqE;IACrE,yEAAyE;IACzE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,uBAAuB,CAAC,EAAE,CAAC;QACxD,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC7D,IAAI,MAAM,KAAK,CAAC,CAAC;YAAE,SAAS;QAC5B,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,gCAAgC,CAAC,EAAE,CAAC;YACzF,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAU,EAAE;QACtC,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;QAClC,OAAO,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACvC,CAAC,CAAC;IACF,MAAM,SAAS,GAAG,CAAC,IAAY,EAAE,EAAU,EAA6B,EAAE,CACxE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;IACvD,MAAM,YAAY,GAAG,CAAC,GAAW,EAAE,IAAY,EAAE,EAAU,EAAsB,EAAE;QACjF,IAAI,IAAI,KAAK,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QAClC,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC;QAC3C,EAAE,CAAC,SAAS,GAAG,IAAI,CAAC;QACpB,MAAM,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,KAAK,IAAI,EAAE;YAAE,OAAO,SAAS,CAAC;QACpD,OAAO,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC;IACxC,CAAC,CAAC;IACF,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,EAAU,EAAU,EAAE;QACtD,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,OAAO,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YAAE,CAAC,IAAI,CAAC,CAAC;QACnD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAqB,EAAE,CAAC;IAYtC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,KAAK,GAA8C,EAAE,CAAC;IAE5D,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACjB,OAAO,CAAC,GAAG,KAAK,EAAE,CAAC;QACjB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAClB,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAC1B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,KAAK,CAAC,EAAE,CAAC,SAAS,GAAG,CAAC,CAAC;gBACvB,KAAK,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;gBACrB,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC1B,CAAC;YACD,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QAED,qEAAqE;QACrE,kEAAkE;QAClE,MAAM,SAAS,GAAG,CAAC,CAAC;QACpB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;YACnB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBAC5B,OAAO,GAAG,CAAC,CAAC;gBACZ,MAAM;YACR,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;gBACd,MAAM,GAAG,CAAC,CAAC;gBACX,OAAO,GAAG,CAAC,CAAC;gBACZ,MAAM;YACR,CAAC;QACH,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAErE,4EAA4E;QAC5E,uEAAuE;QACvE,mEAAmE;QACnE,IAAI,SAAS,GAAkB,IAAI,CAAC;QACpC,MAAM,MAAM,GAAG,iCAAiC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5D,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,SAAS,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACzB,CAAC;aAAM,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACtC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;gBAC/E,SAAS,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;YACvB,CAAC;QACH,CAAC;QAED,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACvB,MAAM,EAAE,GAAG,QAAQ,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,QAAQ,IAAI,SAAS,EAAE,CAAC;YACpE,MAAM,EAAE,GAAmB;gBACzB,EAAE;gBACF,KAAK,EAAE,SAAS;gBAChB,GAAG,EAAE,OAAO;gBACZ,QAAQ,EAAE,MAAM;gBAChB,SAAS,EAAE,CAAC,CAAC;gBACb,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC;aAC5B,CAAC;YACF,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;gBAClB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBACvB,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,EAAE,CAAC,GAAG,GAAG,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;gBACxC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClB,CAAC,GAAG,OAAO,CAAC;YACd,CAAC;YACD,SAAS;QACX,CAAC;QAED,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC7D,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;YACpG,MAAM,EAAE,GAAG,8DAA8D,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrF,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBAChB,MAAM,QAAQ,GAAG,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBAC1C,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;gBACjD,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC;gBAChD,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,KAAK,IAAI,YAAY,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC7F,MAAM,IAAI,GAAa,EAAE,CAAC;gBAC1B,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC;gBAC1F,GAAG,CAAC,IAAI,CAAC;oBACP,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;oBACb,MAAM,EAAE,EAAE,CAAC,CAAC,CAAE;oBACd,MAAM,EAAE,QAAQ;oBAChB,KAAK,EAAE,SAAS;oBAChB,GAAG,EAAE,OAAO;oBACZ,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC;oBAC3B,KAAK;oBACL,EAAE,EAAE,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC;oBACxC,IAAI;iBACL,CAAC,CAAC;YACL,CAAC;YACD,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC/B,SAAS;QACX,CAAC;QAED,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;YAClB,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACxC,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;QACzC,CAAC;aAAM,CAAC;YACN,CAAC,GAAG,OAAO,CAAC;QACd,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,wEAAwE;IACxE,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,GAAuB,EAAE,SAAiB,EAAU,EAAE;QACrE,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,MAAM;YAAE,OAAO,SAAS,CAAC;QAC1E,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAwB,CAAC;QAC7B,KAAK,IAAI,KAAK,GAAG,SAAS,EAAE,KAAK,KAAK,EAAE,IAAI,IAAI,KAAK,SAAS,GAAI,CAAC;YACjE,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,CAAC,CAAE,EAAE,CAAC;gBAAE,IAAI,GAAG,GAAG,KAAK,IAAI,IAAI,CAAC,CAAC,CAAE,EAAE,CAAC;YACnE,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YACnC,KAAK,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAChD,CAAC;QACD,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;YAAE,IAAI,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QAC7D,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;YACpC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBAAE,IAAI,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACrE,CAAC;QACD,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAE,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxD,CAAC,CAAC;IAEF,MAAM,IAAI,GAAiB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACzC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;QACnC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;QACnC,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,GAAG,EAAE,CAAC,CAAC,GAAG;QACV,MAAM,EAAE,CAAC,CAAC,MAAM;KACjB,CAAC,CAAC,CAAC;IAEJ,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC3C,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AACzC,CAAC","sourcesContent":["import { readFile } from \"node:fs/promises\";\nimport { LikeC4 } from \"likec4\";\n\n/** A parse/validation issue reported by LikeC4. */\nexport interface LikeC4Error {\n  message: string;\n  line?: number;\n  sourceFsPath?: string;\n}\n\n/** loam-neutral element view (flattened from the LikeC4 parsed model). */\nexport interface Elem {\n  id: string;\n  kind: string;\n  title: string;\n  description?: string;\n  /**\n   * The `services/<id>` directory this element stands for, from the element's\n   * `metadata { service '...' }`. Absent on the elements nobody has bound —\n   * see `elementService` for the fallback.\n   */\n  service?: string;\n  tags: string[];\n}\n\n/**\n * The service directory an element stands for: an explicit\n * `metadata { service '<id>' }` binding wins, the title is the fallback.\n *\n * The fallback is what every docs repo written before the binding existed relies\n * on, and it is also the trap the binding exists to close: matching on the title\n * means renaming a box in a diagram silently unlinks it from its service, and\n * every check that joined the two just stops finding anything.\n */\nexport function elementService(e: Elem): string {\n  return e.service ?? e.title;\n}\n\n/**\n * Every id an endpoint may be filed under, nearest first: `a.b.c`, `a.b`, `a`.\n *\n * A landscape does not have to draw a service as one opaque box. The moment\n * somebody models its containers — `paymentService.api`, `paymentService.worker`\n * — an edge drawn INTO a container is still an edge into the service, and every\n * join that groups by service has to know that. Resolving only the exact id is\n * what made those edges invisible: the spine check silently skipped them, and\n * the no-openapi grace treated a service with a dozen inbound container calls as\n * one nobody calls at all.\n */\nfunction ancestorIds(id: string): string[] {\n  const out = [id];\n  for (let dot = id.lastIndexOf(\".\"); dot !== -1; dot = id.lastIndexOf(\".\", dot - 1)) {\n    out.push(id.slice(0, dot));\n  }\n  return out;\n}\n\n/**\n * A memoized `id -> service` resolver over one document.\n *\n * Resolution order, and why it is this order:\n *\n *  1. the nearest ancestor (the id itself first) carrying an explicit\n *     `metadata { service '<id>' }` — a binding is a claim somebody wrote down,\n *     so it outranks every guess;\n *  2. the nearest ancestor whose title names a REAL `services/<id>/` directory —\n *     positive evidence from the filesystem, available only to callers that\n *     hand in `known`;\n *  3. the element's own title, and finally the raw id — today's fallback, kept\n *     LAST because it is the one that lies: it happily resolves\n *     `paymentService.api` to \"api\", a service that has never existed.\n *\n * Built once per document and shared, because it is called inside loops over\n * every relationship and the walk up the ancestor chain is not free.\n */\nexport function serviceResolver(\n  elements: Elem[],\n  known?: ReadonlySet<string>,\n): (id: string) => string {\n  const byId = new Map(elements.map((e) => [e.id, e]));\n  const memo = new Map<string, string>();\n  return (id: string): string => {\n    const hit = memo.get(id);\n    if (hit !== undefined) return hit;\n    let answer: string | undefined;\n    for (const candidate of ancestorIds(id)) {\n      const e = byId.get(candidate);\n      if (e?.service !== undefined) {\n        answer = e.service;\n        break;\n      }\n    }\n    if (answer === undefined && known !== undefined) {\n      for (const candidate of ancestorIds(id)) {\n        const e = byId.get(candidate);\n        if (e !== undefined && known.has(e.title)) {\n          answer = e.title;\n          break;\n        }\n      }\n    }\n    if (answer === undefined) {\n      const self = byId.get(id);\n      answer = self ? elementService(self) : id;\n    }\n    memo.set(id, answer);\n    return answer;\n  };\n}\n\n/**\n * The service a relationship endpoint belongs to. An id that names no element\n * resolves to itself, so a partial document degrades to the id rather than\n * throwing.\n *\n * `known` is the set of service directories that actually exist; pass it\n * wherever the caller has enumerated `services/`, so an edge into a modelled\n * container resolves to the service that owns it instead of to the container's\n * own title. Callers with a single document and no repository in hand omit it\n * and keep the pre-existing behaviour.\n */\nexport function serviceOf(elements: Elem[], id: string, known?: ReadonlySet<string>): string {\n  return serviceResolver(elements, known)(id);\n}\n\n/** loam-neutral relationship view. */\nexport interface Rel {\n  source: string;\n  target: string;\n  title?: string;\n  /** OpenAPI operationId this call uses, from the relationship's `metadata { op '...' }`. */\n  op?: string;\n  tags: string[];\n}\n\nexport interface LoadedDoc {\n  errors: LikeC4Error[];\n  elements: Elem[];\n  relationships: Rel[];\n}\n\n/**\n * The slice of a LikeC4 model loam reads: elements and relationships, and on\n * each of those only id/kind/title/description/tags/metadata.\n *\n * It is a type of its own, rather than an inline cast at the one call site,\n * because BOTH of LikeC4's model stages expose exactly this slice — which is\n * what makes the cheap stage a safe substitute for the expensive one. The\n * substitution is pinned in test/likec4-model-parity.test.ts, which flattens\n * both stages through `flattenModel` below and compares the results.\n */\nexport interface ReadableModel {\n  elements: () => Iterable<{\n    id: string;\n    kind: string;\n    title: string;\n    description?: unknown;\n    tags?: readonly string[];\n    metadata?: unknown;\n  }>;\n  relationships: () => Iterable<{\n    source: { id: string };\n    target: { id: string };\n    title?: string | null;\n    tags?: readonly string[];\n    metadata?: unknown;\n  }>;\n}\n\n/** Flatten a LikeC4 model into loam's neutral `Elem`/`Rel` view. */\nexport function flattenModel(model: ReadableModel): { elements: Elem[]; relationships: Rel[] } {\n  const elements: Elem[] = [...model.elements()].map((e) => ({\n    id: e.id,\n    kind: e.kind,\n    title: e.title,\n    description: descText(e.description),\n    service: metaKey(e.metadata, \"service\"),\n    tags: [...(e.tags ?? [])],\n  }));\n  const relationships: Rel[] = [...model.relationships()].map((r) => ({\n    source: r.source.id,\n    target: r.target.id,\n    // LikeC4 reports an untitled edge as title: null — normalize to the declared `title?: string`.\n    title: r.title ?? undefined,\n    op: metaKey(r.metadata, \"op\"),\n    tags: [...(r.tags ?? [])],\n  }));\n  return { elements, relationships };\n}\n\n/**\n * Load and validate a single self-contained `.likec4` document, in-process\n * (no external tool, no JVM). Returns validation errors and, if clean, the\n * flattened elements + relationships.\n */\nexport async function loadFile(path: string): Promise<LoadedDoc> {\n  return loadSource(await readFile(path, \"utf8\"));\n}\n\n/**\n * `loadFile` for text that is not (yet) on disk — what the archive merge uses\n * to prove a computed landscape parses BEFORE anything is written.\n */\nexport async function loadSource(src: string): Promise<LoadedDoc> {\n  // LikeC4 owns a Langium workspace and registers a process-exit listener for\n  // it. Validation creates many short-lived instances, so every acquired\n  // instance must be disposed even on an invalid document or a failed model\n  // computation. Its logger is disabled because diagnostics are returned in\n  // LoadedDoc instead of being written out-of-band to stderr.\n  const likec4 = await LikeC4.fromSource(src, { logger: false });\n  try {\n    // Assigned, not cast: LikeC4 declares `getErrors()` as a non-nullable array\n    // whose element type is structurally wider than ours, so the compiler can\n    // check the shape here. The cast was the only thing standing between a\n    // dependency renaming `message` and a build that still succeeded — and the\n    // `?? []` it carried could never fire.\n    const errors: LikeC4Error[] = likec4.getErrors();\n    if (errors.length > 0) {\n      return { errors, elements: [], relationships: [] };\n    }\n\n    // `parsedModel`, not `computedModel`: the computed stage additionally\n    // computes every VIEW the document declares (and a default one when it\n    // declares none), which loam never reads — it renders nothing. That work is\n    // superlinear in the number of RELATIONSHIPS, so a landscape at fleet shape\n    // turned `loam list` from under a second into minutes. The elements and\n    // relationships below are identical either way.\n    const model = (await likec4.parsedModel()) as ReadableModel;\n    return { errors, ...flattenModel(model) };\n  } finally {\n    await likec4.dispose();\n  }\n}\n\n/**\n * Read one string key out of a LikeC4 `metadata { ... }` block. Two keys carry\n * loam's spines: `op` on a relationship (the OpenAPI operationId it calls) and\n * `service` on an element (the services/<id> directory it stands for). Elements\n * with no metadata come back as `{}`, so a missing key is indistinguishable from\n * a missing block — both mean \"not bound\".\n */\nfunction metaKey(m: unknown, key: string): string | undefined {\n  if (m && typeof m === \"object\") {\n    const v = (m as Record<string, unknown>)[key];\n    if (typeof v === \"string\") return v;\n  }\n  return undefined;\n}\n\n/** LikeC4 descriptions can be a string or a rich-text object ({ txt } / { text } / { md }). */\nfunction descText(d: unknown): string | undefined {\n  if (typeof d === \"string\") return d;\n  if (d && typeof d === \"object\") {\n    const o = d as Record<string, unknown>;\n    for (const key of [\"txt\", \"text\", \"md\", \"value\"]) {\n      const v = o[key];\n      if (typeof v === \"string\") return v;\n    }\n  }\n  return undefined;\n}\n\n/* ------------------------------------------------------------------ */\n/* Source scanning — the text-level view the archive merge splices from */\n/* ------------------------------------------------------------------ */\n\n/** A string literal in LikeC4 source: its span in the text, and its unescaped value. */\nexport interface SourceLiteral {\n  start: number;\n  end: number;\n  value: string;\n}\n\n/**\n * A LikeC4 source with everything that is not code blanked out: string\n * interiors and comments become spaces, newlines survive, and the result is\n * exactly as long as the input — so structure (braces, arrows, `#tags`) can be\n * read with plain string operations at offsets that are valid in the original.\n */\nexport interface MaskedSource {\n  code: string;\n  literals: SourceLiteral[];\n}\n\nexport function maskSource(text: string): MaskedSource {\n  const out = text.split(\"\");\n  const literals: SourceLiteral[] = [];\n  type State = \"code\" | \"squote\" | \"dquote\" | \"lineComment\" | \"blockComment\";\n  let state: State = \"code\";\n  let litStart = -1;\n  let lit = \"\";\n  for (let i = 0; i < text.length; i += 1) {\n    const ch = text[i]!;\n    const next = text[i + 1];\n    switch (state) {\n      case \"code\":\n        if (ch === \"'\" || ch === '\"') {\n          state = ch === \"'\" ? \"squote\" : \"dquote\";\n          litStart = i;\n          lit = \"\";\n          out[i] = \" \";\n        } else if (ch === \"/\" && next === \"/\") {\n          state = \"lineComment\";\n          out[i] = \" \";\n        } else if (ch === \"/\" && next === \"*\") {\n          state = \"blockComment\";\n          out[i] = \" \";\n        }\n        break;\n      case \"squote\":\n      case \"dquote\":\n        if (ch === \"\\\\\" && i + 1 < text.length) {\n          lit += text[i + 1]!;\n          out[i] = \" \";\n          out[i + 1] = \" \";\n          i += 1;\n        } else if (ch === (state === \"squote\" ? \"'\" : '\"')) {\n          literals.push({ start: litStart, end: i + 1, value: lit });\n          state = \"code\";\n          out[i] = \" \";\n        } else {\n          lit += ch;\n          if (ch !== \"\\n\") out[i] = \" \";\n        }\n        break;\n      case \"lineComment\":\n        if (ch === \"\\n\") state = \"code\";\n        else out[i] = \" \";\n        break;\n      case \"blockComment\":\n        if (ch === \"*\" && next === \"/\") {\n          state = \"code\";\n          out[i] = \" \";\n          out[i + 1] = \" \";\n          i += 1;\n        } else if (ch !== \"\\n\") {\n          out[i] = \" \";\n        }\n        break;\n    }\n  }\n  return { code: out.join(\"\"), literals };\n}\n\n/** Index of the `}` matching the `{` at `open`, over MASKED code; -1 when unbalanced. */\nexport function matchBrace(code: string, open: number): number {\n  let depth = 0;\n  for (let i = open; i < code.length; i += 1) {\n    if (code[i] === \"{\") depth += 1;\n    else if (code[i] === \"}\") {\n      depth -= 1;\n      if (depth === 0) return i;\n    }\n  }\n  return -1;\n}\n\n/** An element declaration located in source, under the id the computed model gives it. */\nexport interface ScannedElement {\n  /** Full dotted id — `parent.child` for a nested declaration. */\n  id: string;\n  /** Span of the whole declaration: first head character to one past its end. */\n  start: number;\n  end: number;\n  /** Its own body braces; -1 when the declaration has no body. */\n  bodyOpen: number;\n  bodyClose: number;\n  /** Leading whitespace of the declaration's first line. */\n  indent: string;\n}\n\n/** A relationship statement located in source, endpoints resolved to full ids (best effort). */\nexport interface ScannedRel {\n  source: string;\n  target: string;\n  title?: string;\n  op?: string;\n  tags: string[];\n  start: number;\n  end: number;\n  indent: string;\n}\n\nexport interface ScannedModel {\n  /** The `model` block's own braces. */\n  open: number;\n  close: number;\n  /** In document order. A nested declaration's span lies inside its parent's. */\n  elements: ScannedElement[];\n  rels: ScannedRel[];\n}\n\n/**\n * Locate every element and relationship declaration inside the top-level\n * `model { ... }` block of a LikeC4 source, with the byte range each one\n * occupies. This is the splice map `loam archive` merges the landscape with:\n * the parsed model says WHAT exists, this says WHERE its authored text is —\n * verbatim, so nothing the parser does not model (technology, style, links)\n * can be lost by rebuilding it.\n *\n * Both declaration forms are recognised — `name = kind ...` always, and\n * `kind name ...` for any kind the document's own `specification` block\n * declares. Relationship endpoints are resolved the way LikeC4 reads them:\n * innermost enclosing scope outward, then the top level, then a unique leaf\n * name anywhere; `it`/`this` (and an omitted source) mean the enclosing\n * element. A name that resolves nowhere is left as written — the caller's\n * match against the parsed model then fails loudly instead of guessing.\n *\n * Returns null when there is no model block. Callers only hand in documents\n * LikeC4 has already parsed, so the scan can trust balanced braces.\n */\nexport function scanModel(text: string): ScannedModel | null {\n  const { code, literals } = maskSource(text);\n  const m = /\\bmodel\\s*\\{/.exec(code);\n  if (!m) return null;\n  const open = m.index + m[0].length - 1;\n  const close = matchBrace(code, open);\n  if (close === -1) return null;\n\n  // Element kinds from the specification block(s): the `<kind> <name>`\n  // declaration form is recognisable only by its first token being a kind.\n  const kinds = new Set<string>();\n  for (const sm of code.matchAll(/\\bspecification\\s*\\{/g)) {\n    const sClose = matchBrace(code, sm.index + sm[0].length - 1);\n    if (sClose === -1) continue;\n    for (const em of code.slice(sm.index, sClose).matchAll(/\\belement\\s+([A-Za-z_][\\w-]*)/g)) {\n      kinds.add(em[1]!);\n    }\n  }\n\n  const indentOf = (at: number): string => {\n    const nl = text.lastIndexOf(\"\\n\", at - 1);\n    const ws = text.slice(nl + 1, at);\n    return /^[ \\t]*$/.test(ws) ? ws : \"\";\n  };\n  const literalIn = (from: number, to: number): SourceLiteral | undefined =>\n    literals.find((l) => l.start >= from && l.end <= to);\n  const keyedLiteral = (key: string, from: number, to: number): string | undefined => {\n    if (from === -1) return undefined;\n    const re = new RegExp(`\\\\b${key}\\\\b`, \"g\");\n    re.lastIndex = from;\n    const km = re.exec(code);\n    if (km === null || km.index >= to) return undefined;\n    return literalIn(km.index, to)?.value;\n  };\n  const trimmedEnd = (from: number, to: number): number => {\n    let e = to;\n    while (e > from && /\\s/.test(text[e - 1]!)) e -= 1;\n    return e;\n  };\n\n  const elements: ScannedElement[] = [];\n  interface RawRel {\n    srcLit?: string;\n    tgtLit: string;\n    parent: string;\n    start: number;\n    end: number;\n    indent: string;\n    title?: string;\n    op?: string;\n    tags: string[];\n  }\n  const raw: RawRel[] = [];\n  const stack: Array<{ id: string; el: ScannedElement }> = [];\n\n  let i = open + 1;\n  while (i < close) {\n    const ch = code[i]!;\n    if (/\\s/.test(ch)) {\n      i += 1;\n      continue;\n    }\n    if (ch === \"}\") {\n      const frame = stack.pop();\n      if (frame !== undefined) {\n        frame.el.bodyClose = i;\n        frame.el.end = i + 1;\n        elements.push(frame.el);\n      }\n      i += 1;\n      continue;\n    }\n\n    // A statement's head: up to its own `{`, the end of the line, or the\n    // enclosing block's `}` on the same line — whichever comes first.\n    const stmtStart = i;\n    let headEnd = close;\n    let opener = -1;\n    for (let j = i; j < close; j += 1) {\n      const c = code[j]!;\n      if (c === \"\\n\" || c === \"}\") {\n        headEnd = j;\n        break;\n      }\n      if (c === \"{\") {\n        opener = j;\n        headEnd = j;\n        break;\n      }\n    }\n    const head = code.slice(stmtStart, headEnd);\n    const parentId = stack.length > 0 ? stack[stack.length - 1]!.id : \"\";\n\n    // Classify: `name = kind` first, then a relationship (the arrow cannot hide\n    // in a string — the head is masked), then the `kind name` form, else a\n    // property/tag line that is consumed whole, nested block included.\n    let localName: string | null = null;\n    const assign = /^([A-Za-z_]\\w*)\\s*=\\s*[A-Za-z_]/.exec(head);\n    if (assign !== null) {\n      localName = assign[1]!;\n    } else if (!head.includes(\"->\")) {\n      const toks = head.trim().split(/\\s+/);\n      if (toks.length >= 2 && kinds.has(toks[0]!) && /^[A-Za-z_]\\w*$/.test(toks[1]!)) {\n        localName = toks[1]!;\n      }\n    }\n\n    if (localName !== null) {\n      const id = parentId === \"\" ? localName : `${parentId}.${localName}`;\n      const el: ScannedElement = {\n        id,\n        start: stmtStart,\n        end: headEnd,\n        bodyOpen: opener,\n        bodyClose: -1,\n        indent: indentOf(stmtStart),\n      };\n      if (opener !== -1) {\n        stack.push({ id, el });\n        i = opener + 1;\n      } else {\n        el.end = trimmedEnd(stmtStart, headEnd);\n        elements.push(el);\n        i = headEnd;\n      }\n      continue;\n    }\n\n    if (head.includes(\"->\")) {\n      const bClose = opener === -1 ? -1 : matchBrace(code, opener);\n      const stmtEnd = opener === -1 ? trimmedEnd(stmtStart, headEnd) : bClose === -1 ? close : bClose + 1;\n      const am = /^([A-Za-z_][\\w.]*)?\\s*(?:-\\[[^\\]]*\\])?->\\s*([A-Za-z_][\\w.]*)/.exec(head);\n      if (am !== null) {\n        const arrowEnd = stmtStart + am[0].length;\n        const bodyFrom = opener === -1 ? -1 : opener + 1;\n        const bodyTo = opener === -1 ? -1 : stmtEnd - 1;\n        const title = literalIn(arrowEnd, headEnd)?.value ?? keyedLiteral(\"title\", bodyFrom, bodyTo);\n        const tags: string[] = [];\n        for (const tm of code.slice(stmtStart, stmtEnd).matchAll(/#([\\w-]+)/g)) tags.push(tm[1]!);\n        raw.push({\n          srcLit: am[1],\n          tgtLit: am[2]!,\n          parent: parentId,\n          start: stmtStart,\n          end: stmtEnd,\n          indent: indentOf(stmtStart),\n          title,\n          op: keyedLiteral(\"op\", bodyFrom, bodyTo),\n          tags,\n        });\n      }\n      i = Math.max(stmtEnd, headEnd);\n      continue;\n    }\n\n    if (opener !== -1) {\n      const bClose = matchBrace(code, opener);\n      i = bClose === -1 ? close : bClose + 1;\n    } else {\n      i = headEnd;\n    }\n  }\n\n  // Resolve relationship endpoints against everything declared anywhere in the\n  // model — LikeC4 resolution is not order-dependent, so neither is this.\n  const ids = new Set(elements.map((e) => e.id));\n  const byLeaf = new Map<string, string[]>();\n  for (const e of elements) {\n    const leaf = e.id.slice(e.id.lastIndexOf(\".\") + 1);\n    byLeaf.set(leaf, [...(byLeaf.get(leaf) ?? []), e.id]);\n  }\n  const resolve = (lit: string | undefined, enclosing: string): string => {\n    if (lit === undefined || lit === \"it\" || lit === \"this\") return enclosing;\n    const segs = lit.split(\".\");\n    let base: string | undefined;\n    for (let scope = enclosing; scope !== \"\" && base === undefined; ) {\n      if (ids.has(`${scope}.${segs[0]!}`)) base = `${scope}.${segs[0]!}`;\n      const dot = scope.lastIndexOf(\".\");\n      scope = dot === -1 ? \"\" : scope.slice(0, dot);\n    }\n    if (base === undefined && ids.has(segs[0]!)) base = segs[0]!;\n    if (base === undefined) {\n      const leafed = byLeaf.get(segs[0]!);\n      if (leafed !== undefined && leafed.length === 1) base = leafed[0]!;\n    }\n    return [base ?? segs[0]!, ...segs.slice(1)].join(\".\");\n  };\n\n  const rels: ScannedRel[] = raw.map((r) => ({\n    source: resolve(r.srcLit, r.parent),\n    target: resolve(r.tgtLit, r.parent),\n    title: r.title,\n    op: r.op,\n    tags: r.tags,\n    start: r.start,\n    end: r.end,\n    indent: r.indent,\n  }));\n\n  elements.sort((a, b) => a.start - b.start);\n  return { open, close, elements, rels };\n}\n"]}

package/dist/core/maturity.js

@@ -0,0 +1,66 @@
+/** The ladder, in order. Each rung stands on every rung below it. */
+export const MATURITY_LADDER = ["empty", "partial", "documented", "sourced", "vouched"];
+/**
+ * How far a service's documentation has got. Derived from artifact PRESENCE and
+ * provenance state only — the data an enumeration already holds — never from
+ * what the artifacts say. COMPLETENESS of adopted docs is explicitly on the
+ * unchecked list (brief.ts): a service with one endpoint documented out of
+ * thirty climbs this ladder exactly as fast as a thorough one, which is why no
+ * rung is called "adopted".
+ *
+ *   empty       services/<id>/ exists, no artifact is in it
+ *   partial     some artifacts, but not the required set
+ *   documented  the artifacts the adopt brief marks required are present
+ *   sourced     the living spec declares `sources` — something ties it to code
+ *   vouched     status: verified with a sources_digest behind it — a person
+ *               stamped it. `verified` with no digest is a claim with nothing
+ *               behind it and stays below this rung.
+ *
+ * `openapi.yaml` is required ONLY where an API is expected. The rung used to
+ * demand it of everything, which permanently pinned every worker, cron and
+ * consumer in the fleet at `partial` — services that are fully documented and
+ * vouched for, reported as unfinished forever, and a rollup that therefore said
+ * a correctly-adopted fleet was half-done. The evidence is the same one
+ * `validate` uses to keep `service.no-openapi` quiet, so a service cannot be
+ * green in one command and unfinished in the other.
+ */
+export function serviceMaturity(v) {
+    const s = v.entry;
+    if (!Object.values(s.has).some(Boolean) && !v.archSpec && s.adrs === 0)
+        return "empty";
+    if (!(s.has.model && s.has.spec && (!v.apiExpected || s.has.openapi)))
+        return "partial";
+    if (!s.sources.declared)
+        return "documented";
+    if (!(s.status === "verified" && s.sources.stamped))
+        return "sourced";
+    return "vouched";
+}
+/**
+ * What stands between this service and `vouched`, named as the thing to go and
+ * do. One rung's worth at a time: telling somebody at `empty` that they also
+ * need a vouch is noise, and the vouch is not even possible yet.
+ */
+export function maturityGaps(v) {
+    const s = v.entry;
+    const files = [
+        ...(s.has.model ? [] : ["model.likec4"]),
+        ...(s.has.spec ? [] : ["spec.md"]),
+        ...(v.apiExpected && !s.has.openapi ? ["openapi.yaml"] : []),
+    ];
+    if (files.length > 0)
+        return files;
+    if (!s.sources.declared)
+        return ["sources: in the spec.md frontmatter"];
+    if (!(s.status === "verified" && s.sources.stamped))
+        return [`\`loam vouch --service ${s.id}\``];
+    return [];
+}
+/** Counts per rung, every rung present — a stable shape a fleet dashboard can diff. */
+export function maturityRollup(graded) {
+    const out = Object.fromEntries(MATURITY_LADDER.map((m) => [m, 0]));
+    for (const v of graded)
+        out[v.maturity] += 1;
+    return out;
+}
+//# sourceMappingURL=maturity.js.map

package/dist/core/maturity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"maturity.js","sourceRoot":"","sources":["../../src/core/maturity.ts"],"names":[],"mappings":"AAeA,qEAAqE;AACrE,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,CAAU,CAAC;AAoBjG;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,UAAU,eAAe,CAAC,CAAgB;IAC9C,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IAClB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IACvF,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IACxF,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ;QAAE,OAAO,YAAY,CAAC;IAC7C,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,IAAI,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;QAAE,OAAO,SAAS,CAAC;IACtE,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,CAAgB;IAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IAClB,MAAM,KAAK,GAAG;QACZ,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;QACxC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAClC,GAAG,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;KAC7D,CAAC;IACF,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACnC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ;QAAE,OAAO,CAAC,qCAAqC,CAAC,CAAC;IACxE,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,IAAI,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;QAAE,OAAO,CAAC,0BAA0B,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACjG,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,cAAc,CAAC,MAAyC;IACtE,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAA6B,CAAC;IAC/F,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC7C,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/**\n * The adoption-maturity ladder: one monotone word for how far a service's\n * documentation has got, and what stands between it and the next rung.\n *\n * This lived inside `commands/list.ts` while `list` was the only caller. It\n * moved here when `explore` needed the same answer, because the alternative is\n * the failure `core/ids.ts` already records for the service-id grammar: a\n * second, subtly different copy, so two commands grade the same directory\n * differently and nobody can tell which one is lying. The rung is a fleet dial\n * — `list` prints it per service and in a rollup, `explore` prints it for a\n * service somebody is about to build against — and a dial with two readings is\n * not a dial.\n */\nimport type { ServiceEntry } from \"./repo.js\";\n\n/** The ladder, in order. Each rung stands on every rung below it. */\nexport const MATURITY_LADDER = [\"empty\", \"partial\", \"documented\", \"sourced\", \"vouched\"] as const;\nexport type Maturity = (typeof MATURITY_LADDER)[number];\n\n/**\n * A service entry plus the two facts the directory enumeration cannot know on\n * its own. Both change what a rung MEANS, and both are fleet-level: they need\n * the landscape, not `services/<id>/`.\n */\nexport interface MaturityInput {\n  entry: ServiceEntry;\n  /** `arch.spec.md` — the architecture-obligations axis, absent from ServiceEntry.has. */\n  archSpec: boolean;\n  /**\n   * Does anything in the fleet call an operation on this service? True unless\n   * the landscape PROVES otherwise, exactly as `validate`'s no-openapi grace\n   * reads it: a missing or unparseable landscape proves nothing.\n   */\n  apiExpected: boolean;\n}\n\n/**\n * How far a service's documentation has got. Derived from artifact PRESENCE and\n * provenance state only — the data an enumeration already holds — never from\n * what the artifacts say. COMPLETENESS of adopted docs is explicitly on the\n * unchecked list (brief.ts): a service with one endpoint documented out of\n * thirty climbs this ladder exactly as fast as a thorough one, which is why no\n * rung is called \"adopted\".\n *\n *   empty       services/<id>/ exists, no artifact is in it\n *   partial     some artifacts, but not the required set\n *   documented  the artifacts the adopt brief marks required are present\n *   sourced     the living spec declares `sources` — something ties it to code\n *   vouched     status: verified with a sources_digest behind it — a person\n *               stamped it. `verified` with no digest is a claim with nothing\n *               behind it and stays below this rung.\n *\n * `openapi.yaml` is required ONLY where an API is expected. The rung used to\n * demand it of everything, which permanently pinned every worker, cron and\n * consumer in the fleet at `partial` — services that are fully documented and\n * vouched for, reported as unfinished forever, and a rollup that therefore said\n * a correctly-adopted fleet was half-done. The evidence is the same one\n * `validate` uses to keep `service.no-openapi` quiet, so a service cannot be\n * green in one command and unfinished in the other.\n */\nexport function serviceMaturity(v: MaturityInput): Maturity {\n  const s = v.entry;\n  if (!Object.values(s.has).some(Boolean) && !v.archSpec && s.adrs === 0) return \"empty\";\n  if (!(s.has.model && s.has.spec && (!v.apiExpected || s.has.openapi))) return \"partial\";\n  if (!s.sources.declared) return \"documented\";\n  if (!(s.status === \"verified\" && s.sources.stamped)) return \"sourced\";\n  return \"vouched\";\n}\n\n/**\n * What stands between this service and `vouched`, named as the thing to go and\n * do. One rung's worth at a time: telling somebody at `empty` that they also\n * need a vouch is noise, and the vouch is not even possible yet.\n */\nexport function maturityGaps(v: MaturityInput): string[] {\n  const s = v.entry;\n  const files = [\n    ...(s.has.model ? [] : [\"model.likec4\"]),\n    ...(s.has.spec ? [] : [\"spec.md\"]),\n    ...(v.apiExpected && !s.has.openapi ? [\"openapi.yaml\"] : []),\n  ];\n  if (files.length > 0) return files;\n  if (!s.sources.declared) return [\"sources: in the spec.md frontmatter\"];\n  if (!(s.status === \"verified\" && s.sources.stamped)) return [`\\`loam vouch --service ${s.id}\\``];\n  return [];\n}\n\n/** Counts per rung, every rung present — a stable shape a fleet dashboard can diff. */\nexport function maturityRollup(graded: readonly { maturity: Maturity }[]): Record<Maturity, number> {\n  const out = Object.fromEntries(MATURITY_LADDER.map((m) => [m, 0])) as Record<Maturity, number>;\n  for (const v of graded) out[v.maturity] += 1;\n  return out;\n}\n"]}