@untangle-code/complexity 0.0.0-stage → 0.1.1

package/dist/ir/build-ir.js

@@ -0,0 +1,267 @@
+import { containsRange, rangeKey } from "../scope.js";
+const FUNCTION_LIKE_SCOPE_KINDS = new Set([
+    "function",
+    "method",
+    "constructor",
+]);
+const LOGICAL_DECISION_KINDS = new Set([
+    "logical_and",
+    "logical_or",
+    "short_circuit",
+]);
+/** Boundary IR kinds whose head expression (condition) can carry logical groups. */
+const CONDITION_BEARING_KINDS = new Set([
+    "decision",
+    "loop",
+    "ternary",
+    "switch",
+]);
+function irKindForConstruct(construct) {
+    switch (construct) {
+        case "if":
+            return "decision";
+        case "loop":
+            return "loop";
+        case "catch":
+            return "catch";
+        case "ternary":
+            return "ternary";
+        case "switch":
+            return "switch";
+        case "lambda":
+            return "lambda";
+        default:
+            // Unknown future constructs still nest conservatively (they were
+            // emitted as nesting events, so they ARE nesting constructs).
+            return "other";
+    }
+}
+function isLogicalDecisionNode(node) {
+    return (node.decision !== undefined &&
+        LOGICAL_DECISION_KINDS.has(node.decision.kind) &&
+        node.nestingBoundary !== true);
+}
+function isConditionBearingBoundary(node) {
+    return node.nestingBoundary === true && CONDITION_BEARING_KINDS.has(node.kind);
+}
+/**
+ * Condition hoisting (see "CONDITION HOISTING" above): a logical node that
+ * is a direct child of a condition-bearing boundary moves up EXACTLY ONE
+ * level, inserted immediately before its former parent — that places the
+ * group at the guard's own ambient depth (the guard's children sit one
+ * boundary deeper than the guard itself). Never more than one level: the
+ * sweep for `parent` runs before recursing into its children, so a node
+ * hoisted out of a grandchild boundary is not swept again by any ancestor.
+ */
+function hoistConditionGroups(parent) {
+    const reordered = [];
+    for (const child of parent.children) {
+        if (isConditionBearingBoundary(child)) {
+            const staying = [];
+            for (const grandchild of child.children) {
+                if (isLogicalDecisionNode(grandchild)) {
+                    reordered.push(grandchild);
+                }
+                else {
+                    staying.push(grandchild);
+                }
+            }
+            child.children = staying;
+        }
+        reordered.push(child);
+    }
+    parent.children = reordered;
+    for (const child of parent.children) {
+        hoistConditionGroups(child);
+    }
+}
+function isDirectSelfRecursion(call, enclosingScope) {
+    if (enclosingScope.name.length === 0)
+        return false;
+    if (call.calleeName !== enclosingScope.name)
+        return false;
+    // `foo()` inside function foo, or `this.foo()` inside method foo.
+    return call.qualifier === undefined || call.qualifier === "this";
+}
+/**
+ * Builds the `ComplexityIRNode` subtree for one symbol scope (kind
+ * `"symbol"`, `nestingBoundary` unset, traversal depth 0 — exactly the root
+ * shape `computeCognitive` expects), or the whole-file tree (kind `"root"`)
+ * when `symbolScopeId` is the file scope's id.
+ *
+ * Returns `undefined` when `symbolScopeId` does not exist in
+ * `facts.symbolScopes` (mirrors `selectSymbolFacts`' stale-id tolerance).
+ *
+ * Pass the UNFILTERED file facts, not `selectSymbolFacts` output: the
+ * builder selects the symbol's own facts AND its descendant scopes' facts
+ * itself (a symbol's lambdas nest into its IR — see the module doc).
+ */
+export function buildSymbolIR(facts, symbolScopeId, options = {}) {
+    const scopesById = new Map();
+    for (const scope of facts.symbolScopes)
+        scopesById.set(scope.symbolScopeId, scope);
+    const targetScope = scopesById.get(symbolScopeId);
+    if (targetScope === undefined)
+        return undefined;
+    // Target scope plus all transitive descendants (lambdas, local functions,
+    // nested classes/methods, ...).
+    const childScopesByParent = new Map();
+    for (const scope of facts.symbolScopes) {
+        if (scope.parentScopeId === undefined)
+            continue;
+        const siblings = childScopesByParent.get(scope.parentScopeId) ?? [];
+        siblings.push(scope);
+        childScopesByParent.set(scope.parentScopeId, siblings);
+    }
+    const relevantScopeIds = new Set([symbolScopeId]);
+    const descendantScopes = [];
+    const pending = [symbolScopeId];
+    while (pending.length > 0) {
+        const current = pending.pop();
+        for (const child of childScopesByParent.get(current) ?? []) {
+            if (relevantScopeIds.has(child.symbolScopeId))
+                continue;
+            relevantScopeIds.add(child.symbolScopeId);
+            descendantScopes.push(child);
+            pending.push(child.symbolScopeId);
+        }
+    }
+    // ---- Proto nodes, deduplicated by range (an if/loop/catch/ternary emits
+    // a DecisionFact AND a NestingFact for the same AST node). ----
+    const protoByRange = new Map();
+    const ensureNode = (key, create, continuation) => {
+        const existing = protoByRange.get(key);
+        if (existing !== undefined)
+            return existing;
+        const created = { node: create(), continuation };
+        protoByRange.set(key, created);
+        return created;
+    };
+    for (const nesting of facts.nestingEvents) {
+        if (!relevantScopeIds.has(nesting.symbolScopeId))
+            continue;
+        ensureNode(rangeKey(nesting.range), () => ({
+            kind: irKindForConstruct(nesting.construct),
+            range: nesting.range,
+            children: [],
+            nestingBoundary: true,
+            symbolScopeId: nesting.symbolScopeId,
+        }), nesting.continuation);
+    }
+    for (const decision of facts.decisions) {
+        if (!relevantScopeIds.has(decision.symbolScopeId))
+            continue;
+        const proto = ensureNode(rangeKey(decision.range), () => decisionOnlyNode(decision), false);
+        if (proto.node.decision === undefined)
+            proto.node.decision = decision;
+    }
+    for (const scope of descendantScopes) {
+        const key = rangeKey(scope.range);
+        if (FUNCTION_LIKE_SCOPE_KINDS.has(scope.kind)) {
+            // Deduplicates against the adapter's own "lambda" nesting event (same
+            // AST node, same range) when the enclosing scope was executable.
+            ensureNode(key, () => ({
+                kind: "lambda",
+                range: scope.range,
+                children: [],
+                nestingBoundary: true,
+                symbolScopeId: scope.symbolScopeId,
+            }), false);
+        }
+        else {
+            ensureNode(key, () => ({
+                kind: "block",
+                range: scope.range,
+                children: [],
+                symbolScopeId: scope.symbolScopeId,
+            }), false);
+        }
+    }
+    for (const call of options.calls ?? []) {
+        if (!relevantScopeIds.has(call.callerScopeId))
+            continue;
+        const enclosingScope = scopesById.get(call.callerScopeId);
+        if (enclosingScope === undefined)
+            continue;
+        if (!isDirectSelfRecursion(call, enclosingScope))
+            continue;
+        ensureNode(rangeKey(call.range), () => ({
+            kind: "recursion_marker",
+            range: call.range,
+            children: [],
+            symbolScopeId: call.callerScopeId,
+        }), false);
+    }
+    // ---- Containment placement with else-if sibling flattening. ----
+    const root = {
+        kind: targetScope.kind === "file" ? "root" : "symbol",
+        range: targetScope.range,
+        children: [],
+        symbolScopeId,
+    };
+    const sorted = [...protoByRange.values()].sort((a, b) => a.node.range.startByte - b.node.range.startByte ||
+        b.node.range.endByte - a.node.range.endByte);
+    const containmentStack = [];
+    // The node each proto was ATTACHED to (differs from the containment parent
+    // for continuation nodes — that difference IS the flattening).
+    const attachedTo = new Map();
+    for (const proto of sorted) {
+        if (!containsRange(root.range, proto.node.range))
+            continue; // defensive: stray fact outside the symbol
+        while (containmentStack.length > 0 &&
+            !containsRange(containmentStack[containmentStack.length - 1].node.range, proto.node.range)) {
+            containmentStack.pop();
+        }
+        const containmentParent = containmentStack[containmentStack.length - 1];
+        let parent;
+        if (proto.continuation && containmentParent !== undefined) {
+            // finalParent(else_if) = finalParent(the if it continues); the owning
+            // if is exactly the containment parent (nothing sits between an
+            // if_statement and the if_statement in its else-clause).
+            parent = attachedTo.get(containmentParent) ?? root;
+        }
+        else {
+            parent = containmentParent?.node ?? root;
+        }
+        parent.children.push(proto.node);
+        attachedTo.set(proto, parent);
+        containmentStack.push(proto);
+    }
+    // ---- Condition hoisting (one level; see module doc). ----
+    hoistConditionGroups(root);
+    return root;
+}
+function decisionOnlyNode(decision) {
+    if (decision.kind === "case") {
+        // Case bodies nest one level below the switch head (cognitive.ts's
+        // documented boundary list includes "case").
+        return {
+            kind: "case",
+            range: decision.range,
+            children: [],
+            nestingBoundary: true,
+            decision,
+            symbolScopeId: decision.symbolScopeId,
+        };
+    }
+    if (LOGICAL_DECISION_KINDS.has(decision.kind)) {
+        return {
+            kind: "logical_sequence",
+            range: decision.range,
+            children: [],
+            decision,
+            symbolScopeId: decision.symbolScopeId,
+        };
+    }
+    // guard/if/loop/... decisions normally merge with their nesting event by
+    // range; a decision kind without one (e.g. "pattern_alternative") becomes
+    // a plain non-boundary decision node.
+    return {
+        kind: "decision",
+        range: decision.range,
+        children: [],
+        decision,
+        symbolScopeId: decision.symbolScopeId,
+    };
+}
+//# sourceMappingURL=build-ir.js.map

package/dist/ir/build-ir.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build-ir.js","sourceRoot":"","sources":["../../src/ir/build-ir.ts"],"names":[],"mappings":"AAyFA,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAYtD,MAAM,yBAAyB,GAAwB,IAAI,GAAG,CAAC;IAC7D,UAAU;IACV,QAAQ;IACR,aAAa;CACd,CAAC,CAAC;AAEH,MAAM,sBAAsB,GAAwB,IAAI,GAAG,CAAC;IAC1D,aAAa;IACb,YAAY;IACZ,eAAe;CAChB,CAAC,CAAC;AAEH,oFAAoF;AACpF,MAAM,uBAAuB,GAAwB,IAAI,GAAG,CAAC;IAC3D,UAAU;IACV,MAAM;IACN,SAAS;IACT,QAAQ;CACT,CAAC,CAAC;AAEH,SAAS,kBAAkB,CAAC,SAAiB;IAC3C,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,IAAI;YACP,OAAO,UAAU,CAAC;QACpB,KAAK,MAAM;YACT,OAAO,MAAM,CAAC;QAChB,KAAK,OAAO;YACV,OAAO,OAAO,CAAC;QACjB,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB;YACE,iEAAiE;YACjE,8DAA8D;YAC9D,OAAO,OAAO,CAAC;IACnB,CAAC;AACH,CAAC;AAQD,SAAS,qBAAqB,CAAC,IAAsB;IACnD,OAAO,CACL,IAAI,CAAC,QAAQ,KAAK,SAAS;QAC3B,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;QAC9C,IAAI,CAAC,eAAe,KAAK,IAAI,CAC9B,CAAC;AACJ,CAAC;AAED,SAAS,0BAA0B,CAAC,IAAsB;IACxD,OAAO,IAAI,CAAC,eAAe,KAAK,IAAI,IAAI,uBAAuB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACjF,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,oBAAoB,CAAC,MAAwB;IACpD,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACpC,IAAI,0BAA0B,CAAC,KAAK,CAAC,EAAE,CAAC;YACtC,MAAM,OAAO,GAAuB,EAAE,CAAC;YACvC,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACxC,IAAI,qBAAqB,CAAC,UAAU,CAAC,EAAE,CAAC;oBACtC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC7B,CAAC;qBAAM,CAAC;oBACN,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;YACD,KAAK,CAAC,QAAQ,GAAG,OAAO,CAAC;QAC3B,CAAC;QACD,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IACD,MAAM,CAAC,QAAQ,GAAG,SAAS,CAAC;IAC5B,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACpC,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAAC,IAAa,EAAE,cAA+B;IAC3E,IAAI,cAAc,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACnD,IAAI,IAAI,CAAC,UAAU,KAAK,cAAc,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IAC1D,kEAAkE;IAClE,OAAO,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,KAAK,MAAM,CAAC;AACnE,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAsB,EACtB,aAAqB,EACrB,UAAgC,EAAE;IAElC,MAAM,UAAU,GAAG,IAAI,GAAG,EAA2B,CAAC;IACtD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY;QAAE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;IACnF,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAClD,IAAI,WAAW,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAEhD,0EAA0E;IAC1E,gCAAgC;IAChC,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAA6B,CAAC;IACjE,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QACvC,IAAI,KAAK,CAAC,aAAa,KAAK,SAAS;YAAE,SAAS;QAChD,MAAM,QAAQ,GAAG,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QACpE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IACzD,CAAC;IACD,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAS,CAAC,aAAa,CAAC,CAAC,CAAC;IAC1D,MAAM,gBAAgB,GAAsB,EAAE,CAAC;IAC/C,MAAM,OAAO,GAAG,CAAC,aAAa,CAAC,CAAC;IAChC,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,EAAY,CAAC;QACxC,KAAK,MAAM,KAAK,IAAI,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3D,IAAI,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC;gBAAE,SAAS;YACxD,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC1C,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,gEAAgE;IAChE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAqB,CAAC;IAElD,MAAM,UAAU,GAAG,CACjB,GAAW,EACX,MAA8B,EAC9B,YAAqB,EACV,EAAE;QACb,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAC;QAC5C,MAAM,OAAO,GAAc,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,YAAY,EAAE,CAAC;QAC5D,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAC/B,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC;IAEF,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC;YAAE,SAAS;QAC3D,UAAU,CACR,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,EACvB,GAAG,EAAE,CAAC,CAAC;YACL,IAAI,EAAE,kBAAkB,CAAC,OAAO,CAAC,SAAS,CAAC;YAC3C,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,QAAQ,EAAE,EAAE;YACZ,eAAe,EAAE,IAAI;YACrB,aAAa,EAAE,OAAO,CAAC,aAAa;SACrC,CAAC,EACF,OAAO,CAAC,YAAY,CACrB,CAAC;IACJ,CAAC;IAED,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC;YAAE,SAAS;QAC5D,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;QAC5F,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IACxE,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,gBAAgB,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,yBAAyB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9C,sEAAsE;YACtE,iEAAiE;YACjE,UAAU,CACR,GAAG,EACH,GAAG,EAAE,CAAC,CAAC;gBACL,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,QAAQ,EAAE,EAAE;gBACZ,eAAe,EAAE,IAAI;gBACrB,aAAa,EAAE,KAAK,CAAC,aAAa;aACnC,CAAC,EACF,KAAK,CACN,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,UAAU,CACR,GAAG,EACH,GAAG,EAAE,CAAC,CAAC;gBACL,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,QAAQ,EAAE,EAAE;gBACZ,aAAa,EAAE,KAAK,CAAC,aAAa;aACnC,CAAC,EACF,KAAK,CACN,CAAC;QACJ,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;QACvC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC;YAAE,SAAS;QACxD,MAAM,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC1D,IAAI,cAAc,KAAK,SAAS;YAAE,SAAS;QAC3C,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,cAAc,CAAC;YAAE,SAAS;QAC3D,UAAU,CACR,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EACpB,GAAG,EAAE,CAAC,CAAC;YACL,IAAI,EAAE,kBAAkB;YACxB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,EAAE;YACZ,aAAa,EAAE,IAAI,CAAC,aAAa;SAClC,CAAC,EACF,KAAK,CACN,CAAC;IACJ,CAAC;IAED,mEAAmE;IACnE,MAAM,IAAI,GAAqB;QAC7B,IAAI,EAAE,WAAW,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;QACrD,KAAK,EAAE,WAAW,CAAC,KAAK;QACxB,QAAQ,EAAE,EAAE;QACZ,aAAa;KACd,CAAC;IAEF,MAAM,MAAM,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAC5C,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS;QAC/C,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAC9C,CAAC;IAEF,MAAM,gBAAgB,GAAgB,EAAE,CAAC;IACzC,2EAA2E;IAC3E,+DAA+D;IAC/D,MAAM,UAAU,GAAG,IAAI,GAAG,EAA+B,CAAC;IAE1D,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS,CAAC,2CAA2C;QACvG,OACE,gBAAgB,CAAC,MAAM,GAAG,CAAC;YAC3B,CAAC,aAAa,CACX,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAe,CAAC,IAAI,CAAC,KAAK,EACvE,KAAK,CAAC,IAAI,CAAC,KAAK,CACjB,EACD,CAAC;YACD,gBAAgB,CAAC,GAAG,EAAE,CAAC;QACzB,CAAC;QACD,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxE,IAAI,MAAwB,CAAC;QAC7B,IAAI,KAAK,CAAC,YAAY,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;YAC1D,sEAAsE;YACtE,gEAAgE;YAChE,yDAAyD;YACzD,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,iBAAiB,CAAC,IAAI,IAAI,CAAC;QACrD,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,iBAAiB,EAAE,IAAI,IAAI,IAAI,CAAC;QAC3C,CAAC;QACD,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC9B,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,4DAA4D;IAC5D,oBAAoB,CAAC,IAAI,CAAC,CAAC;IAE3B,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,gBAAgB,CAAC,QAAsB;IAC9C,IAAI,QAAQ,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC7B,mEAAmE;QACnE,6CAA6C;QAC7C,OAAO;YACL,IAAI,EAAE,MAAM;YACZ,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,QAAQ,EAAE,EAAE;YACZ,eAAe,EAAE,IAAI;YACrB,QAAQ;YACR,aAAa,EAAE,QAAQ,CAAC,aAAa;SACtC,CAAC;IACJ,CAAC;IACD,IAAI,sBAAsB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9C,OAAO;YACL,IAAI,EAAE,kBAAkB;YACxB,KAAK,EAAE,QAAQ,CAAC,KAAK;YACrB,QAAQ,EAAE,EAAE;YACZ,QAAQ;YACR,aAAa,EAAE,QAAQ,CAAC,aAAa;SACtC,CAAC;IACJ,CAAC;IACD,yEAAyE;IACzE,0EAA0E;IAC1E,sCAAsC;IACtC,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,KAAK,EAAE,QAAQ,CAAC,KAAK;QACrB,QAAQ,EAAE,EAAE;QACZ,QAAQ;QACR,aAAa,EAAE,QAAQ,CAAC,aAAa;KACtC,CAAC;AACJ,CAAC"}

package/dist/maintainability.d.ts

@@ -0,0 +1,15 @@
+/**
+ * MaintainabilityCalculator (spec.md §16.9). Exact default formula, no
+ * comment bonus (v1 deliberately omits it per spec.md §16.9, for
+ * cross-language stability), clamped to [0, 100]. The formula string itself
+ * is always returned, as required by the work order.
+ */
+import type { MaintainabilityResult } from "./types.js";
+export declare const MAINTAINABILITY_FORMULA = "MI = clamp((171 - 5.2*ln(max(HalsteadVolume,1)) - 0.23*CyclomaticClassic - 16.2*ln(max(SLOC,1))) * 100 / 171, 0, 100)";
+export interface MaintainabilityInput {
+    halsteadVolume: number;
+    cyclomaticClassic: number;
+    sloc: number;
+}
+export declare function computeMaintainability(input: MaintainabilityInput, algorithmVersion?: string): MaintainabilityResult;
+//# sourceMappingURL=maintainability.d.ts.map

package/dist/maintainability.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"maintainability.d.ts","sourceRoot":"","sources":["../src/maintainability.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AAExD,eAAO,MAAM,uBAAuB,0HACqF,CAAC;AAE1H,MAAM,WAAW,oBAAoB;IACnC,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,IAAI,EAAE,MAAM,CAAC;CACd;AAED,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,oBAAoB,EAC3B,gBAAgB,SAAgC,GAC/C,qBAAqB,CAQvB"}

package/dist/maintainability.js

@@ -0,0 +1,10 @@
+export const MAINTAINABILITY_FORMULA = "MI = clamp((171 - 5.2*ln(max(HalsteadVolume,1)) - 0.23*CyclomaticClassic - 16.2*ln(max(SLOC,1))) * 100 / 171, 0, 100)";
+export function computeMaintainability(input, algorithmVersion = "untangle-maintainability-v1") {
+    const volumeTerm = Math.log(Math.max(input.halsteadVolume, 1));
+    const slocTerm = Math.log(Math.max(input.sloc, 1));
+    const raw = 171 - 5.2 * volumeTerm - 0.23 * input.cyclomaticClassic - 16.2 * slocTerm;
+    const scaled = (raw * 100) / 171;
+    const value = Math.min(100, Math.max(0, scaled));
+    return { value, raw, formula: MAINTAINABILITY_FORMULA, algorithmVersion };
+}
+//# sourceMappingURL=maintainability.js.map

package/dist/maintainability.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"maintainability.js","sourceRoot":"","sources":["../src/maintainability.ts"],"names":[],"mappings":"AAQA,MAAM,CAAC,MAAM,uBAAuB,GAClC,uHAAuH,CAAC;AAQ1H,MAAM,UAAU,sBAAsB,CACpC,KAA2B,EAC3B,gBAAgB,GAAG,6BAA6B;IAEhD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,UAAU,GAAG,IAAI,GAAG,KAAK,CAAC,iBAAiB,GAAG,IAAI,GAAG,QAAQ,CAAC;IACtF,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IAEjD,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,uBAAuB,EAAE,gBAAgB,EAAE,CAAC;AAC5E,CAAC"}

package/dist/node-kind-heuristics.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Best-effort classification of raw, adapter-specific AST node kind strings
+ * (`NodeKindFact.kind`, `ComplexityFacts.nodeKinds`) into the language-neutral
+ * buckets `StructuralCalculator`/`SyntacticCalculator` need for
+ * `parameter_count`, `return_count`, `exit_point_count`, `statement_count`,
+ * `expression_count` and `declaration_count` (spec.md §16.5, §16.8).
+ *
+ * `ComplexityFacts` deliberately keeps `kind` as an opaque, grammar-specific
+ * string (e.g. tree-sitter's `"required_parameter"`, `"return_statement"`) —
+ * domain does not define a normalized node-kind taxonomy. This module is
+ * Untangle's own, documented, versioned answer to that gap (see README
+ * "Entscheidungen" #5); it is intentionally conservative (substring match on
+ * common, cross-grammar naming conventions) and is flagged in `openIssues` as
+ * a candidate for an additive domain extension once real adapter output
+ * exists to validate against.
+ */
+export type NodeKindClass = "parameter" | "return" | "exit" | "statement" | "expression" | "declaration" | "other";
+/** Classifies one raw node-kind string. Order matters: more specific buckets are checked first. */
+export declare function classifyNodeKind(kind: string): NodeKindClass;
+/** True when a raw node-kind string looks like an async construct (best-effort, see module docs). */
+export declare function isAsyncNodeKind(kind: string): boolean;
+/** True when a raw node-kind string looks like an exception construct (best-effort, see module docs). */
+export declare function isExceptionNodeKind(kind: string): boolean;
+//# sourceMappingURL=node-kind-heuristics.d.ts.map

package/dist/node-kind-heuristics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"node-kind-heuristics.d.ts","sourceRoot":"","sources":["../src/node-kind-heuristics.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,MAAM,MAAM,aAAa,GACvB,WAAW,GAAG,QAAQ,GAAG,MAAM,GAAG,WAAW,GAAG,YAAY,GAAG,aAAa,GAAG,OAAO,CAAC;AAazF,mGAAmG;AACnG,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,CAS5D;AAID,qGAAqG;AACrG,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAErD;AAID,yGAAyG;AACzG,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEzD"}

package/dist/node-kind-heuristics.js

@@ -0,0 +1,37 @@
+const RETURN_MARKERS = ["return_statement", "return"];
+const EXIT_MARKERS = ["throw_statement", "throw", "break_statement", "continue_statement"];
+const PARAMETER_MARKERS = ["parameter"];
+const DECLARATION_MARKERS = ["declaration", "declarator"];
+const STATEMENT_MARKERS = ["statement"];
+const EXPRESSION_MARKERS = ["expression"];
+function matches(normalizedKind, markers) {
+    return markers.some((marker) => normalizedKind === marker || normalizedKind.includes(marker));
+}
+/** Classifies one raw node-kind string. Order matters: more specific buckets are checked first. */
+export function classifyNodeKind(kind) {
+    const normalized = kind.toLowerCase();
+    if (matches(normalized, RETURN_MARKERS))
+        return "return";
+    if (matches(normalized, EXIT_MARKERS))
+        return "exit";
+    if (matches(normalized, PARAMETER_MARKERS))
+        return "parameter";
+    if (matches(normalized, DECLARATION_MARKERS))
+        return "declaration";
+    if (matches(normalized, STATEMENT_MARKERS))
+        return "statement";
+    if (matches(normalized, EXPRESSION_MARKERS))
+        return "expression";
+    return "other";
+}
+const ASYNC_MARKERS = ["async", "await"];
+/** True when a raw node-kind string looks like an async construct (best-effort, see module docs). */
+export function isAsyncNodeKind(kind) {
+    return matches(kind.toLowerCase(), ASYNC_MARKERS);
+}
+const EXCEPTION_MARKERS = ["throw_statement", "throw", "try_statement", "catch_clause"];
+/** True when a raw node-kind string looks like an exception construct (best-effort, see module docs). */
+export function isExceptionNodeKind(kind) {
+    return matches(kind.toLowerCase(), EXCEPTION_MARKERS);
+}
+//# sourceMappingURL=node-kind-heuristics.js.map

package/dist/node-kind-heuristics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"node-kind-heuristics.js","sourceRoot":"","sources":["../src/node-kind-heuristics.ts"],"names":[],"mappings":"AAmBA,MAAM,cAAc,GAAG,CAAC,kBAAkB,EAAE,QAAQ,CAAC,CAAC;AACtD,MAAM,YAAY,GAAG,CAAC,iBAAiB,EAAE,OAAO,EAAE,iBAAiB,EAAE,oBAAoB,CAAC,CAAC;AAC3F,MAAM,iBAAiB,GAAG,CAAC,WAAW,CAAC,CAAC;AACxC,MAAM,mBAAmB,GAAG,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;AAC1D,MAAM,iBAAiB,GAAG,CAAC,WAAW,CAAC,CAAC;AACxC,MAAM,kBAAkB,GAAG,CAAC,YAAY,CAAC,CAAC;AAE1C,SAAS,OAAO,CAAC,cAAsB,EAAE,OAA0B;IACjE,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,cAAc,KAAK,MAAM,IAAI,cAAc,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;AAChG,CAAC;AAED,mGAAmG;AACnG,MAAM,UAAU,gBAAgB,CAAC,IAAY;IAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACtC,IAAI,OAAO,CAAC,UAAU,EAAE,cAAc,CAAC;QAAE,OAAO,QAAQ,CAAC;IACzD,IAAI,OAAO,CAAC,UAAU,EAAE,YAAY,CAAC;QAAE,OAAO,MAAM,CAAC;IACrD,IAAI,OAAO,CAAC,UAAU,EAAE,iBAAiB,CAAC;QAAE,OAAO,WAAW,CAAC;IAC/D,IAAI,OAAO,CAAC,UAAU,EAAE,mBAAmB,CAAC;QAAE,OAAO,aAAa,CAAC;IACnE,IAAI,OAAO,CAAC,UAAU,EAAE,iBAAiB,CAAC;QAAE,OAAO,WAAW,CAAC;IAC/D,IAAI,OAAO,CAAC,UAAU,EAAE,kBAAkB,CAAC;QAAE,OAAO,YAAY,CAAC;IACjE,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,aAAa,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;AAEzC,qGAAqG;AACrG,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,OAAO,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,aAAa,CAAC,CAAC;AACpD,CAAC;AAED,MAAM,iBAAiB,GAAG,CAAC,iBAAiB,EAAE,OAAO,EAAE,eAAe,EAAE,cAAc,CAAC,CAAC;AAExF,yGAAyG;AACzG,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,OAAO,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,iBAAiB,CAAC,CAAC;AACxD,CAAC"}

package/dist/prose/metrics.d.ts

@@ -0,0 +1,81 @@
+/**
+ * Prosa-Metriken (vision.md §1c/§1d, WP-217).
+ *
+ * WARUM ES DIESE DATEI GIBT
+ *
+ * Alles andere in diesem Paket rechnet ueber `ComplexityFacts`: Scopes,
+ * Entscheidungspunkte, Verschachtelung, Operatoren. Ein Markdown-Dokument
+ * hat davon NICHTS — nicht wenig, sondern nichts. Der Prosa-Adapter liefert
+ * deshalb leere Facts, und Prosa wird hier ueber ihre EIGENEN Groessen
+ * gemessen: Struktur- und Verweislast.
+ *
+ * Die Trennung ist strukturell, nicht per Konvention: jeder Rueckgabewert
+ * ist ein {@link ProseNumberV1}, also ein Objekt. Ein Prosa-Messwert kann
+ * dadurch an keiner Stelle stehen, an der `computeCognitive` oder
+ * `aggregate` eine Zahl erwarten — der Uebersetzer lehnt es ab, und
+ * `assertUntangleMetricNumber` lehnt es zur Laufzeit ab. Vorbild ist
+ * `ExternalNumberV1` (domain `types/extensions.ts`), das externe Befunde
+ * genauso von Untangle-Metriken fernhaelt.
+ *
+ * DIE FUENF MASSE, UND WARUM GENAU DIESE
+ *
+ * Jedes Mass muss ohne Modellannahme lesbar sein — sonst ist es eine
+ * erfundene Zahl mit Nachkommastellen. Was hier steht, laesst sich am
+ * Dokument nachzaehlen:
+ *
+ * 1. `sectionDepth`      — tiefste benutzte Ueberschriftenebene.
+ * 2. `maxSectionLines`   — laengster Abschnitt in Zeilen.
+ * 3. `linkDensity`       — Verweise je 100 Inhaltszeilen.
+ * 4. `unresolvedLinkRatio` — Anteil toter relativer Dateiverweise, oder
+ *                          `null`, wenn niemand aufgeloest hat.
+ * 5. `repetitionRatio`   — Anteil woertlich wiederholter Inhaltszeilen.
+ *
+ * Dazu der abgeleitete Ordnungsschluessel `structureLoad`: die Summe der
+ * Ueberschriftenebenen aller Abschnitte. Bewusst keine gewichtete Mischung
+ * ungleicher Groessen — das waere der eine „Quality Score", den vision.md
+ * §7.6 ablehnt —, sondern eine abzaehlbare Groesse: die Gesamtzahl der
+ * Gliederungsstufen, die das Dokument aufspannt. Ein Dokument mit 40
+ * Abschnitten auf Ebene 3 traegt mehr Gliederung als eines mit 40
+ * Abschnitten auf Ebene 1, und beide mehr als eines mit vier.
+ *
+ * DER AUFLOESER
+ *
+ * `unresolvedLinkRatio` ist der einzige Wert, der etwas ausserhalb des
+ * Dokuments braucht. Ohne `resolveLink` bleibt er `null` — ein
+ * Zustandsvermerk, kein Messwert von 0. vision.md §1d ist an genau dieser
+ * Stelle deutlich: „niemand hat gesucht" darf nie wie ein Befund ueber den
+ * Inhalt aussehen. Deshalb ist der Aufloeser ein Parameter und keine
+ * Dateizugriffsfunktion in diesem Paket: `@untangle-code/complexity` bleibt
+ * frei von I/O.
+ */
+import type { ProseMetricsV1 } from "@untangle-code/domain";
+/**
+ * Beantwortet, ob das Ziel eines relativen Dateiverweises existiert.
+ * `documentPath` ist der Pfad des VERWEISENDEN Dokuments, damit der
+ * Aufloeser relativ dazu suchen kann.
+ */
+export type ProseLinkResolver = (documentPath: string, targetFilePath: string) => boolean;
+export interface ProseMetricsOptions {
+    /**
+     * Ohne Aufloeser bleibt `unresolvedLinkRatio` `null`. Das ist Absicht:
+     * ein ungeprueftes 0 waere die Behauptung, alle Verweise seien heil.
+     */
+    resolveLink?: ProseLinkResolver;
+}
+/**
+ * Prosa-Metriken eines Dokuments.
+ *
+ * `path` ist der "/"-normalisierte, repo-relative Pfad; er wird nur
+ * durchgereicht (an den Aufloeser und in das Ergebnis), nie geoeffnet.
+ */
+export declare function computeProseMetrics(path: string, content: string, options?: ProseMetricsOptions): ProseMetricsV1;
+/**
+ * Ordnet zwei Dokumente nach Strukturlast, absteigend, mit vollstaendig
+ * deterministischem Gleichstandsbruch (nie `localeCompare`).
+ *
+ * `compare` liefert eine Ordnung, keine Bewertung: das Dokument mit der
+ * hoechsten Strukturlast ist nicht „das schlechteste", sondern das mit der
+ * meisten Gliederung — die Deutung gehoert dem Leser, die Zahl dem Werkzeug.
+ */
+export declare function compareProseByStructureLoad(a: ProseMetricsV1, b: ProseMetricsV1): number;
+//# sourceMappingURL=metrics.d.ts.map

package/dist/prose/metrics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics.d.ts","sourceRoot":"","sources":["../../src/prose/metrics.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiDG;AACH,OAAO,KAAK,EAEV,cAAc,EAGf,MAAM,uBAAuB,CAAC;AAY/B;;;;GAIG;AACH,MAAM,MAAM,iBAAiB,GAAG,CAAC,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,KAAK,OAAO,CAAC;AAE1F,MAAM,WAAW,mBAAmB;IAClC;;;OAGG;IACH,WAAW,CAAC,EAAE,iBAAiB,CAAC;CACjC;AAiBD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,mBAAwB,GAChC,cAAc,CAmEhB;AAED;;;;;;;GAOG;AACH,wBAAgB,2BAA2B,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,cAAc,GAAG,MAAM,CAMxF"}

package/dist/prose/metrics.js

@@ -0,0 +1,103 @@
+import { PROSE_METRICS_VERSION, classifyLinkTarget, countContentLines, findMarkdownLinks, linkFilePath, makeProseNumber, normalizedContentLines, outlineMarkdown, } from "@untangle-code/domain";
+/** Physische Zeilen ohne Zeilenende; ein abschliessendes `\r` faellt weg. */
+function splitLines(content) {
+    return content.split("\n").map((line) => (line.endsWith("\r") ? line.slice(0, -1) : line));
+}
+/**
+ * Rundet auf eine Nachkommastelle. Verhaeltniswerte werden gespeichert und
+ * verglichen; ohne feste Rundung waeren zwei Laeufe ueber dieselbe Datei
+ * durch Gleitkommarauschen nicht bitgleich.
+ */
+function round(value, digits) {
+    const factor = 10 ** digits;
+    return Math.round(value * factor) / factor;
+}
+/**
+ * Prosa-Metriken eines Dokuments.
+ *
+ * `path` ist der "/"-normalisierte, repo-relative Pfad; er wird nur
+ * durchgereicht (an den Aufloeser und in das Ergebnis), nie geoeffnet.
+ */
+export function computeProseMetrics(path, content, options = {}) {
+    const lines = splitLines(content);
+    const outline = outlineMarkdown(lines);
+    const sections = outline.map((section) => ({
+        breadcrumb: section.breadcrumb,
+        level: section.level,
+        startLine: section.startLine,
+        endLine: section.endLine,
+        lines: Math.max(0, section.endLine - section.startLine + 1),
+    }));
+    const contentLines = countContentLines(lines);
+    const rawLinks = findMarkdownLinks(lines);
+    const resolver = options.resolveLink;
+    const links = rawLinks.map((link) => {
+        const kind = classifyLinkTarget(link.target);
+        let resolved = null;
+        if (kind === "relative_file" && resolver !== undefined) {
+            const target = linkFilePath(link.target);
+            // Ein Verweis, der nur auf einen Anker im selben Dokument zeigt, hat
+            // keinen Dateiteil; er ist nicht "tot", er ist keine Dateikante.
+            resolved = target === "" ? true : resolver(path, target);
+        }
+        return { target: link.target, text: link.text, line: link.line, kind, resolved };
+    });
+    const resolvable = links.filter((link) => link.resolved !== null);
+    const unresolved = resolvable.filter((link) => link.resolved === false);
+    const normalized = normalizedContentLines(lines);
+    const seen = new Set();
+    let repeated = 0;
+    for (const line of normalized) {
+        if (seen.has(line))
+            repeated += 1;
+        else
+            seen.add(line);
+    }
+    const depth = sections.reduce((max, section) => Math.max(max, section.level), 0);
+    const maxLines = sections.reduce((max, section) => Math.max(max, section.lines), 0);
+    const structureLoad = sections.reduce((sum, section) => sum + section.level, 0);
+    return {
+        schemaVersion: 1,
+        metricsVersion: PROSE_METRICS_VERSION,
+        path,
+        sectionDepth: makeProseNumber(depth, "levels"),
+        maxSectionLines: makeProseNumber(maxLines, "lines"),
+        linkDensity: makeProseNumber(contentLines === 0 ? 0 : round((links.length / contentLines) * 100, 1), "per_100_lines"),
+        unresolvedLinkRatio: resolvable.length === 0
+            ? null
+            : makeProseNumber(round(unresolved.length / resolvable.length, 4), "ratio"),
+        repetitionRatio: makeProseNumber(normalized.length === 0 ? 0 : round(repeated / normalized.length, 4), "ratio"),
+        structureLoad: makeProseNumber(structureLoad, "count"),
+        sectionCount: makeProseNumber(sections.length, "count"),
+        contentLines: makeProseNumber(contentLines, "count"),
+        sections,
+        links,
+    };
+}
+/**
+ * Ordnet zwei Dokumente nach Strukturlast, absteigend, mit vollstaendig
+ * deterministischem Gleichstandsbruch (nie `localeCompare`).
+ *
+ * `compare` liefert eine Ordnung, keine Bewertung: das Dokument mit der
+ * hoechsten Strukturlast ist nicht „das schlechteste", sondern das mit der
+ * meisten Gliederung — die Deutung gehoert dem Leser, die Zahl dem Werkzeug.
+ */
+export function compareProseByStructureLoad(a, b) {
+    const byLoad = valueOf(b.structureLoad) - valueOf(a.structureLoad);
+    if (byLoad !== 0)
+        return byLoad;
+    const byDepth = valueOf(b.sectionDepth) - valueOf(a.sectionDepth);
+    if (byDepth !== 0)
+        return byDepth;
+    return a.path < b.path ? -1 : a.path > b.path ? 1 : 0;
+}
+/**
+ * Der Rohwert eines Prosa-Messwerts fuer die SORTIERUNG innerhalb dieser
+ * Familie. Bewusst paketlokal und nicht exportiert: eine allgemein
+ * verfuegbare `number`-Entpackung waere genau das Loch, das
+ * {@link ProseNumberV1} zumauert.
+ */
+function valueOf(value) {
+    return value.value;
+}
+//# sourceMappingURL=metrics.js.map

package/dist/prose/metrics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics.js","sourceRoot":"","sources":["../../src/prose/metrics.ts"],"names":[],"mappings":"AAwDA,OAAO,EACL,qBAAqB,EACrB,kBAAkB,EAClB,iBAAiB,EACjB,iBAAiB,EACjB,YAAY,EACZ,eAAe,EACf,sBAAsB,EACtB,eAAe,GAChB,MAAM,uBAAuB,CAAC;AAiB/B,6EAA6E;AAC7E,SAAS,UAAU,CAAC,OAAe;IACjC,OAAO,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAC7F,CAAC;AAED;;;;GAIG;AACH,SAAS,KAAK,CAAC,KAAa,EAAE,MAAc;IAC1C,MAAM,MAAM,GAAG,EAAE,IAAI,MAAM,CAAC;IAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAY,EACZ,OAAe,EACf,UAA+B,EAAE;IAEjC,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAEvC,MAAM,QAAQ,GAA2B,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACjE,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,KAAK,EAAE,OAAO,CAAC,KAAK;QACpB,SAAS,EAAE,OAAO,CAAC,SAAS;QAC5B,OAAO,EAAE,OAAO,CAAC,OAAO;QACxB,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC,SAAS,GAAG,CAAC,CAAC;KAC5D,CAAC,CAAC,CAAC;IAEJ,MAAM,YAAY,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE1C,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,CAAC;IACrC,MAAM,KAAK,GAAkB,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACjD,MAAM,IAAI,GAAG,kBAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,QAAQ,GAAmB,IAAI,CAAC;QACpC,IAAI,IAAI,KAAK,eAAe,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YACvD,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACzC,qEAAqE;YACrE,iEAAiE;YACjE,QAAQ,GAAG,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;IACnF,CAAC,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC;IAClE,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,CAAC;IAExE,MAAM,UAAU,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,QAAQ,IAAI,CAAC,CAAC;;YAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACjF,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACpF,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CAAC,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAEhF,OAAO;QACL,aAAa,EAAE,CAAC;QAChB,cAAc,EAAE,qBAAqB;QACrC,IAAI;QACJ,YAAY,EAAE,eAAe,CAAC,KAAK,EAAE,QAAQ,CAAC;QAC9C,eAAe,EAAE,eAAe,CAAC,QAAQ,EAAE,OAAO,CAAC;QACnD,WAAW,EAAE,eAAe,CAC1B,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,YAAY,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,EACtE,eAAe,CAChB;QACD,mBAAmB,EACjB,UAAU,CAAC,MAAM,KAAK,CAAC;YACrB,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC;QAC/E,eAAe,EAAE,eAAe,CAC9B,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,EACpE,OAAO,CACR;QACD,aAAa,EAAE,eAAe,CAAC,aAAa,EAAE,OAAO,CAAC;QACtD,YAAY,EAAE,eAAe,CAAC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;QACvD,YAAY,EAAE,eAAe,CAAC,YAAY,EAAE,OAAO,CAAC;QACpD,QAAQ;QACR,KAAK;KACN,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,2BAA2B,CAAC,CAAiB,EAAE,CAAiB;IAC9E,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;IACnE,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IAChC,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IAClE,IAAI,OAAO,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IAClC,OAAO,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxD,CAAC;AAED;;;;;GAKG;AACH,SAAS,OAAO,CAAC,KAAoB;IACnC,OAAO,KAAK,CAAC,KAAK,CAAC;AACrB,CAAC"}