@untangle-code/complexity 0.0.0-stage → 0.1.1

package/dist/scope-identity.d.ts

@@ -0,0 +1,85 @@
+/**
+ * Eindeutige Scope-Identitaet fuer die Aggregation (WP-82).
+ *
+ * ## Warum es dieses Modul gibt
+ *
+ * spec.md §16.10 verlangt die Deduplizierung ueber `metrics_scope_id`. Das
+ * setzt voraus, dass diese Id GENAU EINEN Scope bezeichnet. Der Bezeichner,
+ * den die Sprachadapter heute liefern — `SymbolScopeFact.symbolScopeId` — tut
+ * das innerhalb einer Datei NICHT: er wird aus dem qualifizierten Namen plus
+ * einem Ordinal gebildet, das je Elternscope zaehlt. Zwei anonyme Callbacks
+ * unter zwei verschiedenen, ebenfalls anonymen Eltern bekommen damit beide den
+ * qualifizierten Namen `<anonymous>.<anonymous>` und beide das Ordinal 0 —
+ * dieselbe Id fuer zwei verschiedene Scopes. Am eigenen Repo betrifft das rund
+ * ein Fuenftel aller Scopes.
+ *
+ * Die Folge waere nicht nur eine schiefe Summe, sondern stiller Inhaltsverlust
+ * (E4): `aggregate()` verwirft den zweiten Scope als Dublette,
+ * `selectSymbolFacts()` liefert die VEREINIGUNG der Facts beider Scopes, und
+ * `buildSymbolIR()` baut die IR fuer denjenigen, der die interne Map zuletzt
+ * gewonnen hat.
+ *
+ * ## Was dieses Modul tut
+ *
+ * `withUniqueScopeIds()` schreibt einen Facts-Satz auf nachweislich eindeutige
+ * Scope-Ids um: Byte-Range statt Name plus Ordinal. Jede Fact-Zuordnung wird
+ * ueber Byte-Containment neu aufgeloest (der ENGSTE Scope, der die Id des
+ * Facts traegt und dessen Range den Fact enthaelt). Die aufgetretenen
+ * Kollisionen werden GEZAEHLT UND ZURUECKGEGEBEN, nicht stillschweigend
+ * geheilt — wer den Bericht liest, sieht, dass die Adapter-Id das Problem hat,
+ * und nicht nur, dass jemand daran vorbeigearbeitet hat.
+ *
+ * Das ist eine Reparatur an der Datenkante, KEIN Ersatz fuer die Behebung im
+ * Adapter. Sobald `symbolScopeId` je Datei eindeutig ist, bleibt `collisions`
+ * leer und dieses Modul kann entfallen.
+ *
+ * ## Grenze (bewusst, nicht verschwiegen)
+ *
+ * `NodeKindFact` traegt als einzige Fact-Art KEINE `SourceRange` (domain
+ * `analysis.ts`); ihre Zuordnung ist ueber Containment daher nicht
+ * reparierbar. Sie wird auf den ERSTEN Scope mit der jeweiligen Adapter-Id
+ * abgebildet und die Zahl der so behandelten Facts in
+ * `nodeKindsAttributedByFallback` ausgewiesen. Betroffen sind nur die
+ * syntaktischen Metriken (`computeSyntactic`), nicht Cyclomatic/Cognitive.
+ */
+import type { ComplexityFacts, RawCall } from "@untangle-code/domain";
+/** Eine Adapter-Id, die mehr als einen Scope bezeichnet. */
+export interface ScopeIdCollisionV1 {
+    /** Die mehrdeutige `symbolScopeId` aus dem Sprachadapter. */
+    adapterScopeId: string;
+    /** Wie viele verschiedene Scopes sie bezeichnet (>= 2). */
+    scopeCount: number;
+    /** Startzeilen der betroffenen Scopes, aufsteigend — zum Nachschlagen. */
+    startLines: number[];
+}
+export interface UniqueScopeIdsResultV1 {
+    /** Facts mit eindeutigen Scope-Ids; sonst strukturgleich zur Eingabe. */
+    facts: ComplexityFacts;
+    /** Aufrufe mit umgeschriebenem `callerScopeId`. */
+    calls: RawCall[];
+    /** Abbildung neue Id -> urspruengliche Adapter-Id, fuer Diagnosen. */
+    originalScopeIds: Map<string, string>;
+    /** Jede mehrdeutige Adapter-Id, nach Codepoints sortiert. Leer heisst: alles war eindeutig. */
+    collisions: ScopeIdCollisionV1[];
+    /** `NodeKindFact`s ohne Range, die per Fallback zugeordnet wurden (siehe Modul-Doku). */
+    nodeKindsAttributedByFallback: number;
+}
+/**
+ * Schreibt einen Facts-Satz auf eindeutige Scope-Ids um.
+ *
+ * @param facts Facts einer Datei, wie der Sprachadapter sie liefert.
+ * @param calls Rohaufrufe derselben Datei (`extractCalls`); ihr
+ *   `callerScopeId` wird mit umgeschrieben, damit die Rekursionsmarkierung in
+ *   `buildSymbolIR` weiter greift.
+ * @param idPrefix Praefix der neuen Ids, ueblicherweise der repo-relative
+ *   Pfad. Er macht die Ids ueber Dateigrenzen hinweg eindeutig; innerhalb der
+ *   Datei sorgt die Byte-Range dafuer.
+ *
+ * Kann ein Fact ueber Containment keinem Scope zugeordnet werden (er laege
+ * ausserhalb jeder Range seines eigenen Scopes — ein Adapterfehler anderer
+ * Art), bleibt seine Adapter-Id stehen. Die Aggregation sieht dann einen
+ * unbekannten Eltern-Scope und meldet ihn als Invariantenverstoss, statt eine
+ * saubere Zahl vorzutaeuschen.
+ */
+export declare function withUniqueScopeIds(facts: ComplexityFacts, calls: readonly RawCall[], idPrefix: string): UniqueScopeIdsResultV1;
+//# sourceMappingURL=scope-identity.d.ts.map

package/dist/scope-identity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope-identity.d.ts","sourceRoot":"","sources":["../src/scope-identity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AACH,OAAO,KAAK,EACV,eAAe,EAEf,OAAO,EAGR,MAAM,uBAAuB,CAAC;AAK/B,4DAA4D;AAC5D,MAAM,WAAW,kBAAkB;IACjC,6DAA6D;IAC7D,cAAc,EAAE,MAAM,CAAC;IACvB,2DAA2D;IAC3D,UAAU,EAAE,MAAM,CAAC;IACnB,0EAA0E;IAC1E,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,sBAAsB;IACrC,yEAAyE;IACzE,KAAK,EAAE,eAAe,CAAC;IACvB,mDAAmD;IACnD,KAAK,EAAE,OAAO,EAAE,CAAC;IACjB,sEAAsE;IACtE,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACtC,+FAA+F;IAC/F,UAAU,EAAE,kBAAkB,EAAE,CAAC;IACjC,yFAAyF;IACzF,6BAA6B,EAAE,MAAM,CAAC;CACvC;AAiCD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,eAAe,EACtB,KAAK,EAAE,SAAS,OAAO,EAAE,EACzB,QAAQ,EAAE,MAAM,GACf,sBAAsB,CA6GxB"}

package/dist/scope-identity.js

@@ -0,0 +1,144 @@
+import { ID_COMPONENT_SEPARATOR, compareCodepoints } from "@untangle-code/domain";
+import { containsRange } from "./scope.js";
+/** Byte-Range-basierte, innerhalb einer Datei eindeutige Id. */
+function uniqueIdFor(prefix, range) {
+    return [prefix, "scope", String(range.startByte), String(range.endByte)].join(ID_COMPONENT_SEPARATOR);
+}
+/** Innerster Scope aus `candidates`, dessen Range `range` enthaelt. */
+function innermostOwner(candidates, range) {
+    let best;
+    for (const candidate of candidates) {
+        if (!containsRange(candidate.scope.range, range))
+            continue;
+        if (best === undefined ||
+            candidate.scope.range.endByte - candidate.scope.range.startByte <
+                best.scope.range.endByte - best.scope.range.startByte) {
+            best = candidate;
+        }
+    }
+    return best;
+}
+/**
+ * Schreibt einen Facts-Satz auf eindeutige Scope-Ids um.
+ *
+ * @param facts Facts einer Datei, wie der Sprachadapter sie liefert.
+ * @param calls Rohaufrufe derselben Datei (`extractCalls`); ihr
+ *   `callerScopeId` wird mit umgeschrieben, damit die Rekursionsmarkierung in
+ *   `buildSymbolIR` weiter greift.
+ * @param idPrefix Praefix der neuen Ids, ueblicherweise der repo-relative
+ *   Pfad. Er macht die Ids ueber Dateigrenzen hinweg eindeutig; innerhalb der
+ *   Datei sorgt die Byte-Range dafuer.
+ *
+ * Kann ein Fact ueber Containment keinem Scope zugeordnet werden (er laege
+ * ausserhalb jeder Range seines eigenen Scopes — ein Adapterfehler anderer
+ * Art), bleibt seine Adapter-Id stehen. Die Aggregation sieht dann einen
+ * unbekannten Eltern-Scope und meldet ihn als Invariantenverstoss, statt eine
+ * saubere Zahl vorzutaeuschen.
+ */
+export function withUniqueScopeIds(facts, calls, idPrefix) {
+    const rewritten = facts.symbolScopes.map((scope) => ({
+        scope,
+        uniqueId: uniqueIdFor(idPrefix, scope.range),
+    }));
+    const byAdapterId = new Map();
+    for (const entry of rewritten) {
+        const bucket = byAdapterId.get(entry.scope.symbolScopeId) ?? [];
+        bucket.push(entry);
+        byAdapterId.set(entry.scope.symbolScopeId, bucket);
+    }
+    const collisions = [];
+    for (const [adapterScopeId, bucket] of byAdapterId) {
+        if (bucket.length < 2)
+            continue;
+        collisions.push({
+            adapterScopeId,
+            scopeCount: bucket.length,
+            startLines: bucket.map((entry) => entry.scope.range.startLine).sort((a, b) => a - b),
+        });
+    }
+    collisions.sort((a, b) => compareCodepoints(a.adapterScopeId, b.adapterScopeId));
+    const originalScopeIds = new Map();
+    for (const entry of rewritten)
+        originalScopeIds.set(entry.uniqueId, entry.scope.symbolScopeId);
+    /** Neue Id fuer einen Fact mit Range. */
+    const resolve = (adapterScopeId, range) => {
+        const bucket = byAdapterId.get(adapterScopeId);
+        if (bucket === undefined || bucket.length === 0)
+            return adapterScopeId;
+        const first = bucket[0];
+        if (bucket.length === 1)
+            return first.uniqueId;
+        const owner = innermostOwner(bucket, range);
+        return owner === undefined ? adapterScopeId : owner.uniqueId;
+    };
+    let nodeKindsAttributedByFallback = 0;
+    const mappedNodeKinds = facts.nodeKinds.map((fact) => {
+        const bucket = byAdapterId.get(fact.symbolScopeId);
+        if (bucket === undefined || bucket.length === 0)
+            return fact;
+        if (bucket.length > 1)
+            nodeKindsAttributedByFallback++;
+        return { ...fact, symbolScopeId: bucket[0].uniqueId };
+    });
+    const mappedScopes = rewritten.map((entry) => {
+        const parentAdapterId = entry.scope.parentScopeId;
+        if (parentAdapterId === undefined) {
+            return { ...entry.scope, symbolScopeId: entry.uniqueId };
+        }
+        const parentBucket = byAdapterId.get(parentAdapterId);
+        let parentId;
+        if (parentBucket === undefined || parentBucket.length === 0) {
+            parentId = parentAdapterId;
+        }
+        else if (parentBucket.length === 1) {
+            parentId = parentBucket[0].uniqueId;
+        }
+        else {
+            const owner = innermostOwner(parentBucket.filter((candidate) => candidate !== entry), entry.scope.range);
+            parentId = owner === undefined ? parentAdapterId : owner.uniqueId;
+        }
+        return { ...entry.scope, symbolScopeId: entry.uniqueId, parentScopeId: parentId };
+    });
+    const nextFacts = {
+        symbolScopes: mappedScopes,
+        decisions: facts.decisions.map((fact) => ({
+            ...fact,
+            symbolScopeId: resolve(fact.symbolScopeId, fact.range),
+        })),
+        nestingEvents: facts.nestingEvents.map((fact) => ({
+            ...fact,
+            symbolScopeId: resolve(fact.symbolScopeId, fact.range),
+        })),
+        operators: facts.operators.map((fact) => ({
+            ...fact,
+            symbolScopeId: resolve(fact.symbolScopeId, fact.range),
+        })),
+        operands: facts.operands.map((fact) => ({
+            ...fact,
+            symbolScopeId: resolve(fact.symbolScopeId, fact.range),
+        })),
+        nodeKinds: mappedNodeKinds,
+        comments: facts.comments,
+        identifiers: facts.identifiers.map((fact) => ({
+            ...fact,
+            symbolScopeId: resolve(fact.symbolScopeId, fact.range),
+        })),
+        literals: facts.literals.map((fact) => ({
+            ...fact,
+            symbolScopeId: resolve(fact.symbolScopeId, fact.range),
+        })),
+        parseDiagnostics: facts.parseDiagnostics,
+    };
+    const nextCalls = calls.map((call) => ({
+        ...call,
+        callerScopeId: resolve(call.callerScopeId, call.range),
+    }));
+    return {
+        facts: nextFacts,
+        calls: nextCalls,
+        originalScopeIds,
+        collisions,
+        nodeKindsAttributedByFallback,
+    };
+}
+//# sourceMappingURL=scope-identity.js.map

package/dist/scope-identity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope-identity.js","sourceRoot":"","sources":["../src/scope-identity.ts"],"names":[],"mappings":"AAmDA,OAAO,EAAE,sBAAsB,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAElF,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AA8B3C,gEAAgE;AAChE,SAAS,WAAW,CAAC,MAAc,EAAE,KAAkB;IACrD,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAC3E,sBAAsB,CACvB,CAAC;AACJ,CAAC;AAED,uEAAuE;AACvE,SAAS,cAAc,CACrB,UAAgC,EAChC,KAAkB;IAElB,IAAI,IAA2B,CAAC;IAChC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC;YAAE,SAAS;QAC3D,IACE,IAAI,KAAK,SAAS;YAClB,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS;gBAC7D,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EACvD,CAAC;YACD,IAAI,GAAG,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAsB,EACtB,KAAyB,EACzB,QAAgB;IAEhB,MAAM,SAAS,GAAgB,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAChE,KAAK;QACL,QAAQ,EAAE,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC;KAC7C,CAAC,CAAC,CAAC;IAEJ,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;IACnD,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QAChE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;IACrD,CAAC;IAED,MAAM,UAAU,GAAyB,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QACnD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAChC,UAAU,CAAC,IAAI,CAAC;YACd,cAAc;YACd,UAAU,EAAE,MAAM,CAAC,MAAM;YACzB,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;SACrF,CAAC,CAAC;IACL,CAAC;IACD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;IAEjF,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,KAAK,MAAM,KAAK,IAAI,SAAS;QAAE,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;IAE/F,yCAAyC;IACzC,MAAM,OAAO,GAAG,CAAC,cAAsB,EAAE,KAAkB,EAAU,EAAE;QACrE,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAC/C,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,cAAc,CAAC;QACvE,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAc,CAAC;QACrC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC,QAAQ,CAAC;QAC/C,MAAM,KAAK,GAAG,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC5C,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;IAC/D,CAAC,CAAC;IAEF,IAAI,6BAA6B,GAAG,CAAC,CAAC;IACtC,MAAM,eAAe,GAAmB,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACnE,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACnD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC7D,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,6BAA6B,EAAE,CAAC;QACvD,OAAO,EAAE,GAAG,IAAI,EAAE,aAAa,EAAG,MAAM,CAAC,CAAC,CAAe,CAAC,QAAQ,EAAE,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,MAAM,YAAY,GAAsB,SAAS,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC9D,MAAM,eAAe,GAAG,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC;QAClD,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;YAClC,OAAO,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC3D,CAAC;QACD,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;QACtD,IAAI,QAAgB,CAAC;QACrB,IAAI,YAAY,KAAK,SAAS,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5D,QAAQ,GAAG,eAAe,CAAC;QAC7B,CAAC;aAAM,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,QAAQ,GAAI,YAAY,CAAC,CAAC,CAAe,CAAC,QAAQ,CAAC;QACrD,CAAC;aAAM,CAAC;YACN,MAAM,KAAK,GAAG,cAAc,CAC1B,YAAY,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,KAAK,KAAK,CAAC,EACvD,KAAK,CAAC,KAAK,CAAC,KAAK,CAClB,CAAC;YACF,QAAQ,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;QACpE,CAAC;QACD,OAAO,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,CAAC,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;IACpF,CAAC,CAAC,CAAC;IAEH,MAAM,SAAS,GAAoB;QACjC,YAAY,EAAE,YAAY;QAC1B,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACxC,GAAG,IAAI;YACP,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC;SACvD,CAAC,CAAC;QACH,aAAa,EAAE,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAChD,GAAG,IAAI;YACP,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC;SACvD,CAAC,CAAC;QACH,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACxC,GAAG,IAAI;YACP,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC;SACvD,CAAC,CAAC;QACH,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACtC,GAAG,IAAI;YACP,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC;SACvD,CAAC,CAAC;QACH,SAAS,EAAE,eAAe;QAC1B,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC5C,GAAG,IAAI;YACP,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC;SACvD,CAAC,CAAC;QACH,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACtC,GAAG,IAAI;YACP,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC;SACvD,CAAC,CAAC;QACH,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;KACzC,CAAC;IAEF,MAAM,SAAS,GAAc,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAChD,GAAG,IAAI;QACP,aAAa,EAAE,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC;KACvD,CAAC,CAAC,CAAC;IAEJ,OAAO;QACL,KAAK,EAAE,SAAS;QAChB,KAAK,EAAE,SAAS;QAChB,gBAAgB;QAChB,UAAU;QACV,6BAA6B;KAC9B,CAAC;AACJ,CAAC"}

package/dist/scope.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Facts scoping and byte/line utilities shared by every calculator
+ * (architecture.md §15.1). Every calculator is scope-agnostic: it operates on
+ * whatever `ComplexityFacts` it is handed. `selectSymbolFacts` is how a
+ * caller narrows file-level facts down to one symbol's facts before calling
+ * a calculator for `scope: "symbol"`; passing the file's facts unfiltered is
+ * how a caller computes `scope: "file"`.
+ */
+import type { ComplexityFacts, SourceRange } from "@untangle-code/domain";
+/** True iff `inner` lies fully inside `outer` (byte-interval containment, both inclusive/exclusive per domain convention). */
+export declare function containsRange(outer: SourceRange, inner: SourceRange): boolean;
+/** True iff `outer` strictly contains `inner` (contains, but is not the identical range). */
+export declare function strictlyContainsRange(outer: SourceRange, inner: SourceRange): boolean;
+/** Stable identity key for deduplicating facts that reference the same source span. */
+export declare function rangeKey(range: SourceRange): string;
+/**
+ * Narrows file-level `ComplexityFacts` to the facts belonging to one symbol
+ * scope. Fact kinds that carry `symbolScopeId` (decisions, nestingEvents,
+ * operators, operands, nodeKinds, identifiers, literals) are filtered by
+ * exact id match — a symbol's own facts are attributed directly to it, never
+ * inherited from nested named symbols, which get their own `SymbolScopeFact`
+ * and their own facts (architecture.md §15.1; Untangle decision, see
+ * README "Entscheidungen" #1). `comments` and `parseDiagnostics` carry no
+ * `symbolScopeId` and are instead filtered by byte-range containment inside
+ * the symbol's own range.
+ *
+ * Returns empty fact arrays (rather than throwing) when `symbolScopeId` is
+ * not present in `facts.symbolScopes` — a caller passing a stale id gets an
+ * empty-but-valid `ComplexityFacts`, not a crash.
+ */
+export declare function selectSymbolFacts(facts: ComplexityFacts, symbolScopeId: string): ComplexityFacts;
+/** Slices `sourceText` by a byte-offset `SourceRange` (UTF-8, per domain convention). */
+export declare function sliceByRange(sourceText: string, range: SourceRange): string;
+/** Splits text into physical lines, normalizing CRLF/CR to LF first. */
+export declare function splitLines(text: string): string[];
+//# sourceMappingURL=scope.d.ts.map

package/dist/scope.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.d.ts","sourceRoot":"","sources":["../src/scope.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,KAAK,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAS1E,8HAA8H;AAC9H,wBAAgB,aAAa,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,GAAG,OAAO,CAE7E;AAED,6FAA6F;AAC7F,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW,GAAG,OAAO,CAGrF;AAED,uFAAuF;AACvF,wBAAgB,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAEnD;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,GAAG,eAAe,CAiBhG;AAED,yFAAyF;AACzF,wBAAgB,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,GAAG,MAAM,CAG3E;AAED,wEAAwE;AACxE,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAEjD"}

package/dist/scope.js

@@ -0,0 +1,60 @@
+function byScope(items, symbolScopeId) {
+    return items.filter((item) => item.symbolScopeId === symbolScopeId);
+}
+/** True iff `inner` lies fully inside `outer` (byte-interval containment, both inclusive/exclusive per domain convention). */
+export function containsRange(outer, inner) {
+    return outer.startByte <= inner.startByte && inner.endByte <= outer.endByte;
+}
+/** True iff `outer` strictly contains `inner` (contains, but is not the identical range). */
+export function strictlyContainsRange(outer, inner) {
+    if (!containsRange(outer, inner))
+        return false;
+    return outer.startByte !== inner.startByte || outer.endByte !== inner.endByte;
+}
+/** Stable identity key for deduplicating facts that reference the same source span. */
+export function rangeKey(range) {
+    return `${range.startByte}:${range.endByte}`;
+}
+/**
+ * Narrows file-level `ComplexityFacts` to the facts belonging to one symbol
+ * scope. Fact kinds that carry `symbolScopeId` (decisions, nestingEvents,
+ * operators, operands, nodeKinds, identifiers, literals) are filtered by
+ * exact id match — a symbol's own facts are attributed directly to it, never
+ * inherited from nested named symbols, which get their own `SymbolScopeFact`
+ * and their own facts (architecture.md §15.1; Untangle decision, see
+ * README "Entscheidungen" #1). `comments` and `parseDiagnostics` carry no
+ * `symbolScopeId` and are instead filtered by byte-range containment inside
+ * the symbol's own range.
+ *
+ * Returns empty fact arrays (rather than throwing) when `symbolScopeId` is
+ * not present in `facts.symbolScopes` — a caller passing a stale id gets an
+ * empty-but-valid `ComplexityFacts`, not a crash.
+ */
+export function selectSymbolFacts(facts, symbolScopeId) {
+    const symbolScope = facts.symbolScopes.find((s) => s.symbolScopeId === symbolScopeId);
+    const range = symbolScope?.range;
+    return {
+        symbolScopes: facts.symbolScopes.filter((s) => s.symbolScopeId === symbolScopeId),
+        decisions: byScope(facts.decisions, symbolScopeId),
+        nestingEvents: byScope(facts.nestingEvents, symbolScopeId),
+        operators: byScope(facts.operators, symbolScopeId),
+        operands: byScope(facts.operands, symbolScopeId),
+        nodeKinds: byScope(facts.nodeKinds, symbolScopeId),
+        comments: range ? facts.comments.filter((r) => containsRange(range, r)) : [],
+        identifiers: byScope(facts.identifiers, symbolScopeId),
+        literals: byScope(facts.literals, symbolScopeId),
+        parseDiagnostics: range
+            ? facts.parseDiagnostics.filter((d) => containsRange(range, d.range))
+            : [],
+    };
+}
+/** Slices `sourceText` by a byte-offset `SourceRange` (UTF-8, per domain convention). */
+export function sliceByRange(sourceText, range) {
+    const buf = Buffer.from(sourceText, "utf8");
+    return buf.subarray(range.startByte, range.endByte).toString("utf8");
+}
+/** Splits text into physical lines, normalizing CRLF/CR to LF first. */
+export function splitLines(text) {
+    return text.replace(/\r\n/g, "\n").replace(/\r/g, "\n").split("\n");
+}
+//# sourceMappingURL=scope.js.map

package/dist/scope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.js","sourceRoot":"","sources":["../src/scope.ts"],"names":[],"mappings":"AAUA,SAAS,OAAO,CACd,KAAmB,EACnB,aAAqB;IAErB,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,KAAK,aAAa,CAAC,CAAC;AACtE,CAAC;AAED,8HAA8H;AAC9H,MAAM,UAAU,aAAa,CAAC,KAAkB,EAAE,KAAkB;IAClE,OAAO,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC;AAC9E,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,qBAAqB,CAAC,KAAkB,EAAE,KAAkB;IAC1E,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/C,OAAO,KAAK,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO,CAAC;AAChF,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,QAAQ,CAAC,KAAkB;IACzC,OAAO,GAAG,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;AAC/C,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAsB,EAAE,aAAqB;IAC7E,MAAM,WAAW,GAAG,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,KAAK,aAAa,CAAC,CAAC;IACtF,MAAM,KAAK,GAAG,WAAW,EAAE,KAAK,CAAC;IACjC,OAAO;QACL,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,KAAK,aAAa,CAAC;QACjF,SAAS,EAAE,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,aAAa,CAAC;QAClD,aAAa,EAAE,OAAO,CAAC,KAAK,CAAC,aAAa,EAAE,aAAa,CAAC;QAC1D,SAAS,EAAE,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,aAAa,CAAC;QAClD,QAAQ,EAAE,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,aAAa,CAAC;QAChD,SAAS,EAAE,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,aAAa,CAAC;QAClD,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;QAC5E,WAAW,EAAE,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,aAAa,CAAC;QACtD,QAAQ,EAAE,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,aAAa,CAAC;QAChD,gBAAgB,EAAE,KAAK;YACrB,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YACrE,CAAC,CAAC,EAAE;KACP,CAAC;AACJ,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,YAAY,CAAC,UAAkB,EAAE,KAAkB;IACjE,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IAC5C,OAAO,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;AACvE,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AACtE,CAAC"}

package/dist/structural.d.ts

@@ -0,0 +1,30 @@
+/**
+ * StructuralCalculator (spec.md §16.5).
+ *
+ * Facts-derivable metrics are computed directly from `ComplexityFacts` (plus
+ * `sourceText`/`scopeRange` for the line-based ones). Coupling and API-surface
+ * metrics (`fan_in`, `fan_out`, `import_in_degree`, `import_out_degree`,
+ * `afferent_coupling`, `efferent_coupling`, `instability`,
+ * `inheritance_depth`, `public_api_count`) need whole-repository graph/export
+ * knowledge this facts-only package does not have — per the work order they
+ * are accepted as `StructuralExternalInput` and are only ever present in the
+ * output when the caller actually supplies them; they are never defaulted or
+ * guessed (see README "Entscheidungen" #4 for `instability`'s one derived
+ * exception).
+ *
+ * `parameter_count`, `return_count` and `exit_point_count` use a best-effort
+ * node-kind classifier (see `node-kind-heuristics.ts`) since `SymbolScopeFact`
+ * carries no structured parameter list — see README "Entscheidungen" #5 and
+ * `openIssues`.
+ */
+import type { ComplexityFacts, SourceRange } from "@untangle-code/domain";
+import type { MetricsResult, StructuralExternalInput } from "./types.js";
+/**
+ * @param facts Facts already narrowed to the target scope (see `selectSymbolFacts`).
+ * @param sourceText Full original file content (UTF-8) — needed because
+ *   `SourceRange` byte offsets are file-absolute.
+ * @param scopeRange The scope's own range (a `SymbolScopeFact.range` for
+ *   `scope: "symbol"`, or the whole-file range for `scope: "file"`).
+ */
+export declare function computeStructural(facts: ComplexityFacts, sourceText: string, scopeRange: SourceRange, external?: StructuralExternalInput, algorithmVersion?: string): MetricsResult;
+//# sourceMappingURL=structural.d.ts.map

package/dist/structural.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"structural.d.ts","sourceRoot":"","sources":["../src/structural.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH,OAAO,KAAK,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAK1E,OAAO,KAAK,EAAE,aAAa,EAAE,uBAAuB,EAAE,MAAM,YAAY,CAAC;AA0BzE;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,eAAe,EACtB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,WAAW,EACvB,QAAQ,GAAE,uBAA4B,EACtC,gBAAgB,SAA2B,GAC1C,aAAa,CAoEf"}

package/dist/structural.js

@@ -0,0 +1,98 @@
+import { classifyNodeKind } from "./node-kind-heuristics.js";
+import { strictlyContainsRange } from "./scope.js";
+import { classifyLines } from "./text-lines.js";
+const FUNCTION_KINDS = new Set(["function", "arrow_function", "function_expression"]);
+const METHOD_KINDS = new Set(["method", "constructor"]);
+const CLASS_KINDS = new Set(["class"]);
+const INTERFACE_KINDS = new Set(["interface"]);
+function countByScopeKind(facts, kinds) {
+    return facts.symbolScopes.filter((s) => kinds.has(s.kind.toLowerCase())).length;
+}
+/** Interval-nesting depth of `target` among `pool`: 1 + number of other ranges in `pool` that strictly contain it. */
+function nestingDepthOf(target, pool) {
+    let depth = 1;
+    for (const other of pool) {
+        if (other === target)
+            continue;
+        if (strictlyContainsRange(other, target))
+            depth++;
+    }
+    return depth;
+}
+function mean(values) {
+    if (values.length === 0)
+        return 0;
+    return values.reduce((sum, v) => sum + v, 0) / values.length;
+}
+/**
+ * @param facts Facts already narrowed to the target scope (see `selectSymbolFacts`).
+ * @param sourceText Full original file content (UTF-8) — needed because
+ *   `SourceRange` byte offsets are file-absolute.
+ * @param scopeRange The scope's own range (a `SymbolScopeFact.range` for
+ *   `scope: "symbol"`, or the whole-file range for `scope: "file"`).
+ */
+export function computeStructural(facts, sourceText, scopeRange, external = {}, algorithmVersion = "untangle-structural-v1") {
+    const { physicalLoc, commentLines, docLines, blankLines } = classifyLines(sourceText, scopeRange, facts.comments);
+    const sloc = Math.max(physicalLoc - blankLines.size - commentLines.size, 0);
+    const nonContinuationNesting = facts.nestingEvents
+        .filter((n) => !n.continuation)
+        .map((n) => n.range);
+    const nestingDepths = nonContinuationNesting.map((range) => nestingDepthOf(range, nonContinuationNesting));
+    let parameterCount = 0;
+    let returnCount = 0;
+    let exitPointCount = 0;
+    for (const node of facts.nodeKinds) {
+        const classified = classifyNodeKind(node.kind);
+        if (classified === "parameter")
+            parameterCount++;
+        if (classified === "return") {
+            returnCount++;
+            exitPointCount++;
+        }
+        if (classified === "exit")
+            exitPointCount++;
+    }
+    const metrics = {
+        physical_loc: physicalLoc,
+        sloc,
+        blank_lines: blankLines.size,
+        comment_lines: commentLines.size,
+        doc_lines: docLines.size,
+        function_count: countByScopeKind(facts, FUNCTION_KINDS),
+        method_count: countByScopeKind(facts, METHOD_KINDS),
+        class_count: countByScopeKind(facts, CLASS_KINDS),
+        interface_count: countByScopeKind(facts, INTERFACE_KINDS),
+        parameter_count: parameterCount,
+        return_count: returnCount,
+        exit_point_count: exitPointCount,
+        max_nesting: nestingDepths.length > 0 ? Math.max(...nestingDepths) : 0,
+        avg_nesting: mean(nestingDepths),
+    };
+    if (external.fanIn !== undefined)
+        metrics["fan_in"] = external.fanIn;
+    if (external.fanOut !== undefined)
+        metrics["fan_out"] = external.fanOut;
+    if (external.importInDegree !== undefined)
+        metrics["import_in_degree"] = external.importInDegree;
+    if (external.importOutDegree !== undefined)
+        metrics["import_out_degree"] = external.importOutDegree;
+    if (external.afferentCoupling !== undefined)
+        metrics["afferent_coupling"] = external.afferentCoupling;
+    if (external.efferentCoupling !== undefined)
+        metrics["efferent_coupling"] = external.efferentCoupling;
+    if (external.inheritanceDepth !== undefined)
+        metrics["inheritance_depth"] = external.inheritanceDepth;
+    if (external.publicApiCount !== undefined)
+        metrics["public_api_count"] = external.publicApiCount;
+    if (external.instability !== undefined) {
+        metrics["instability"] = external.instability;
+    }
+    else if (external.afferentCoupling !== undefined && external.efferentCoupling !== undefined) {
+        const denom = external.afferentCoupling + external.efferentCoupling;
+        if (denom > 0) {
+            metrics["instability"] = external.efferentCoupling / denom;
+        }
+    }
+    return { metrics, algorithmVersion };
+}
+//# sourceMappingURL=structural.js.map

package/dist/structural.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"structural.js","sourceRoot":"","sources":["../src/structural.ts"],"names":[],"mappings":"AAqBA,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AACnD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,EAAE,gBAAgB,EAAE,qBAAqB,CAAC,CAAC,CAAC;AACtF,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC;AACxD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;AACvC,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;AAE/C,SAAS,gBAAgB,CAAC,KAAsB,EAAE,KAAkB;IAClE,OAAO,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;AAClF,CAAC;AAED,sHAAsH;AACtH,SAAS,cAAc,CAAC,MAAmB,EAAE,IAA4B;IACvE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,IAAI,KAAK,KAAK,MAAM;YAAE,SAAS;QAC/B,IAAI,qBAAqB,CAAC,KAAK,EAAE,MAAM,CAAC;YAAE,KAAK,EAAE,CAAC;IACpD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,IAAI,CAAC,MAAyB;IACrC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;AAC/D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAsB,EACtB,UAAkB,EAClB,UAAuB,EACvB,WAAoC,EAAE,EACtC,gBAAgB,GAAG,wBAAwB;IAE3C,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,aAAa,CACvE,UAAU,EACV,UAAU,EACV,KAAK,CAAC,QAAQ,CACf,CAAC;IACF,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,UAAU,CAAC,IAAI,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAE5E,MAAM,sBAAsB,GAAG,KAAK,CAAC,aAAa;SAC/C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;SAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACvB,MAAM,aAAa,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACzD,cAAc,CAAC,KAAK,EAAE,sBAAsB,CAAC,CAC9C,CAAC;IAEF,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,UAAU,KAAK,WAAW;YAAE,cAAc,EAAE,CAAC;QACjD,IAAI,UAAU,KAAK,QAAQ,EAAE,CAAC;YAC5B,WAAW,EAAE,CAAC;YACd,cAAc,EAAE,CAAC;QACnB,CAAC;QACD,IAAI,UAAU,KAAK,MAAM;YAAE,cAAc,EAAE,CAAC;IAC9C,CAAC;IAED,MAAM,OAAO,GAA2B;QACtC,YAAY,EAAE,WAAW;QACzB,IAAI;QACJ,WAAW,EAAE,UAAU,CAAC,IAAI;QAC5B,aAAa,EAAE,YAAY,CAAC,IAAI;QAChC,SAAS,EAAE,QAAQ,CAAC,IAAI;QACxB,cAAc,EAAE,gBAAgB,CAAC,KAAK,EAAE,cAAc,CAAC;QACvD,YAAY,EAAE,gBAAgB,CAAC,KAAK,EAAE,YAAY,CAAC;QACnD,WAAW,EAAE,gBAAgB,CAAC,KAAK,EAAE,WAAW,CAAC;QACjD,eAAe,EAAE,gBAAgB,CAAC,KAAK,EAAE,eAAe,CAAC;QACzD,eAAe,EAAE,cAAc;QAC/B,YAAY,EAAE,WAAW;QACzB,gBAAgB,EAAE,cAAc;QAChC,WAAW,EAAE,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC;KACjC,CAAC;IAEF,IAAI,QAAQ,CAAC,KAAK,KAAK,SAAS;QAAE,OAAO,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC;IACrE,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,CAAC,SAAS,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;IACxE,IAAI,QAAQ,CAAC,cAAc,KAAK,SAAS;QAAE,OAAO,CAAC,kBAAkB,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC;IACjG,IAAI,QAAQ,CAAC,eAAe,KAAK,SAAS;QACxC,OAAO,CAAC,mBAAmB,CAAC,GAAG,QAAQ,CAAC,eAAe,CAAC;IAC1D,IAAI,QAAQ,CAAC,gBAAgB,KAAK,SAAS;QACzC,OAAO,CAAC,mBAAmB,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC;IAC3D,IAAI,QAAQ,CAAC,gBAAgB,KAAK,SAAS;QACzC,OAAO,CAAC,mBAAmB,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC;IAC3D,IAAI,QAAQ,CAAC,gBAAgB,KAAK,SAAS;QACzC,OAAO,CAAC,mBAAmB,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC;IAC3D,IAAI,QAAQ,CAAC,cAAc,KAAK,SAAS;QAAE,OAAO,CAAC,kBAAkB,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC;IAEjG,IAAI,QAAQ,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACvC,OAAO,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC;IAChD,CAAC;SAAM,IAAI,QAAQ,CAAC,gBAAgB,KAAK,SAAS,IAAI,QAAQ,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;QAC9F,MAAM,KAAK,GAAG,QAAQ,CAAC,gBAAgB,GAAG,QAAQ,CAAC,gBAAgB,CAAC;QACpE,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,OAAO,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC,gBAAgB,GAAG,KAAK,CAAC;QAC7D,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC;AACvC,CAAC"}

package/dist/syntactic.d.ts

@@ -0,0 +1,35 @@
+/**
+ * SyntacticCalculator (spec.md §16.8).
+ *
+ * `ast_node_count`/`ast_max_depth`/`ast_avg_depth`/`node_kind_entropy` and the
+ * construct counters are derived straight from `ComplexityFacts.nodeKinds`
+ * (each entry already carries its own AST depth) and the other typed fact
+ * arrays.
+ *
+ * `ast_branching_factor_avg`/`ast_branching_factor_max` (spec.md §16.8,
+ * "Mindestens") are reconstructed EXACTLY from the `nodeKinds` sequence:
+ * the adapter's single walk emits one `NodeKindFact` per visited node in
+ * DFS PRE-ORDER (that ordering is this calculator's input contract for the
+ * two branching keys; `selectSymbolFacts` filtering preserves it), and in a
+ * pre-order depth sequence every node's parent is the nearest preceding
+ * entry with a smaller depth — so per-node child counts, and from them the
+ * branching factors, follow without any parent pointers. This is the real
+ * AST branching factor, not an approximation (see README "Entscheidungen"
+ * #7); the optional `irRoot` is only used as a fallback when `nodeKinds` is
+ * empty (e.g. hand-built IR fixtures), because the sparse control-flow IR
+ * would otherwise understate branching.
+ */
+import type { ComplexityFacts, ComplexityIRNode } from "@untangle-code/domain";
+import type { MetricsResult } from "./types.js";
+/**
+ * @param facts Facts already narrowed to the target scope.
+ * @param sloc The scope's own SLOC, as computed by `computeStructural` —
+ *   passed in rather than recomputed so `ast_nodes_per_sloc` is consistent
+ *   with the structural snapshot instead of a second, possibly divergent,
+ *   line-scan.
+ * @param irRoot Optional IR subtree for the same scope; only used as the
+ *   branching-factor source when `facts.nodeKinds` is empty (the pre-order
+ *   reconstruction over real node-kind facts is exact and takes precedence).
+ */
+export declare function computeSyntactic(facts: ComplexityFacts, sloc: number, irRoot?: ComplexityIRNode, algorithmVersion?: string): MetricsResult;
+//# sourceMappingURL=syntactic.d.ts.map

package/dist/syntactic.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"syntactic.d.ts","sourceRoot":"","sources":["../src/syntactic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,OAAO,KAAK,EAAE,eAAe,EAAE,gBAAgB,EAAgB,MAAM,uBAAuB,CAAC;AAK7F,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AA6DhD;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,eAAe,EACtB,IAAI,EAAE,MAAM,EACZ,MAAM,CAAC,EAAE,gBAAgB,EACzB,gBAAgB,SAA0B,GACzC,aAAa,CAgFf"}