code-auditor-mcp 4.1.1 → 5.0.1

package/dist/phase/rules/dependencyGraph.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Spec 68 §3.2 — the dependency-graph rules, migrated to `analyze(ctx)`.
+ *
+ * The six rules here read the `cross-language-entities` fact (a flat array of
+ * `Entity`) and reduce it through `DependencyGraphBuilder` — the same pure class
+ * the legacy Stage-4 reducer ran. The reducer (`createDependencyGraphReducer`
+ * in pipelineAdapters.ts) already took `entities` + built references + called
+ * `buildGraph` + `analyzeDependencyHealth` and then mapped `DependencyIssue` /
+ * `DependencySuggestion` records to findings; that mapping is re-homed verbatim
+ * here, one rule per issue/suggestion type:
+ *
+ *   issue type        → rule                suggestion type     → rule
+ *   circular-dependency → circular-dependency  break-cycles        → break-cycles
+ *   tight-coupling    → tight-coupling        reduce-coupling     → reduce-coupling
+ *   orphaned-nodes    → orphaned-nodes        review-orphans      → review-orphans
+ *
+ * Each rule re-derives the graph from the fact (the phase model hands every
+ * rule the full corpus-wide `Entity[]`), so the graph build is recomputed once
+ * per rule in the in-process runner; §6's corpus processors move it to a single
+ * shared computation. Recomputing per rule is correct and deterministic — the
+ * graph algorithms iterate in entity order, and the fact array order is fixed.
+ *
+ * `buildReferences` is re-homed (not imported) from `clBuildReferences` in
+ * pipelineAdapters.ts, because that private helper is deleted with the reducer
+ * in §15. `DependencyGraphBuilder` itself survives §15 — it imports no analyzer
+ * class and no pipeline, so the rules import it directly.
+ *
+ * The seventh dependency-graph rule, `unreferenced-module`, is not here: it reads
+ * the file-level `imports`/`hasExports` half of the cross-language visitor, a
+ * `file-imports` fact the current producer does not emit (RENEW — lands with
+ * §8's reachability fact). The 3 schema-validator rules (`schema-field-mismatch`,
+ * `missing-field`, `extra-field`) read a `Entity` shape the schema-validator
+ * reducer enriches at reduce time (ENRICH), so they land with §8 too.
+ */
+import type { RuleDefinition } from '../types.js';
+/** The shared declaration for the six dependency-graph rules. */
+type DependencyGraphNeeds = {
+    readonly formats: readonly ['typescript', 'tsx', 'javascript', 'go'];
+    readonly facts: readonly ['cross-language-entities'];
+};
+/** The six dependency-graph rules this slice migrates, in registry order. */
+export declare const dependencyGraphRules: readonly RuleDefinition<DependencyGraphNeeds>[];
+export {};
+//# sourceMappingURL=dependencyGraph.d.ts.map

package/dist/phase/rules/dependencyGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependencyGraph.d.ts","sourceRoot":"","sources":["../../../src/phase/rules/dependencyGraph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAmB,MAAM,aAAa,CAAC;AAUnE,iEAAiE;AACjE,KAAK,oBAAoB,GAAG;IAC1B,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;IACrE,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,yBAAyB,CAAC,CAAC;CACtD,CAAC;AAuPF,6EAA6E;AAC7E,eAAO,MAAM,oBAAoB,EAAE,SAAS,cAAc,CAAC,oBAAoB,CAAC,EAO/E,CAAC"}

package/dist/phase/rules/dependencyGraph.js

@@ -0,0 +1,260 @@
+/**
+ * Spec 68 §3.2 — the dependency-graph rules, migrated to `analyze(ctx)`.
+ *
+ * The six rules here read the `cross-language-entities` fact (a flat array of
+ * `Entity`) and reduce it through `DependencyGraphBuilder` — the same pure class
+ * the legacy Stage-4 reducer ran. The reducer (`createDependencyGraphReducer`
+ * in pipelineAdapters.ts) already took `entities` + built references + called
+ * `buildGraph` + `analyzeDependencyHealth` and then mapped `DependencyIssue` /
+ * `DependencySuggestion` records to findings; that mapping is re-homed verbatim
+ * here, one rule per issue/suggestion type:
+ *
+ *   issue type        → rule                suggestion type     → rule
+ *   circular-dependency → circular-dependency  break-cycles        → break-cycles
+ *   tight-coupling    → tight-coupling        reduce-coupling     → reduce-coupling
+ *   orphaned-nodes    → orphaned-nodes        review-orphans      → review-orphans
+ *
+ * Each rule re-derives the graph from the fact (the phase model hands every
+ * rule the full corpus-wide `Entity[]`), so the graph build is recomputed once
+ * per rule in the in-process runner; §6's corpus processors move it to a single
+ * shared computation. Recomputing per rule is correct and deterministic — the
+ * graph algorithms iterate in entity order, and the fact array order is fixed.
+ *
+ * `buildReferences` is re-homed (not imported) from `clBuildReferences` in
+ * pipelineAdapters.ts, because that private helper is deleted with the reducer
+ * in §15. `DependencyGraphBuilder` itself survives §15 — it imports no analyzer
+ * class and no pipeline, so the rules import it directly.
+ *
+ * The seventh dependency-graph rule, `unreferenced-module`, is not here: it reads
+ * the file-level `imports`/`hasExports` half of the cross-language visitor, a
+ * `file-imports` fact the current producer does not emit (RENEW — lands with
+ * §8's reachability fact). The 3 schema-validator rules (`schema-field-mismatch`,
+ * `missing-field`, `extra-field`) read a `Entity` shape the schema-validator
+ * reducer enriches at reduce time (ENRICH), so they land with §8 too.
+ */
+import { RULE_REGISTRY } from '../../analyzers/ruleRegistry.js';
+import { DependencyGraphBuilder, } from '../../analyzers/cross-language/DependencyGraphBuilder.js';
+const META = RULE_REGISTRY;
+/** The suggestion severity map, verbatim from the reducer's HEALTH_SEVERITY. */
+const SUGGESTION_SEVERITY = {
+    'break-cycles': 'severe',
+    'reduce-coupling': 'high',
+    'review-orphans': 'severe',
+};
+/**
+ * Build the call cross-references by resolving each entity's extracted callee
+ * names against the corpus entity-name index (re-homed from `clBuildReferences`).
+ */
+function buildReferences(entities) {
+    const byName = new Map();
+    for (const e of entities) {
+        const key = e.name.toLowerCase();
+        const list = byName.get(key) ?? [];
+        list.push(e);
+        byName.set(key, list);
+    }
+    const refs = [];
+    for (const e of entities) {
+        const callees = e.metadata?.callees ?? [];
+        const eDir = e.file.split('/').slice(0, -1).join('/');
+        for (const callee of callees) {
+            const name = (callee.split('.').pop() ?? callee).toLowerCase();
+            // A free function calling itself by bare name is recursing, not a cycle.
+            if (name === e.name.toLowerCase())
+                continue;
+            const others = (byName.get(name) ?? []).filter((t) => t.id !== e.id);
+            if (others.length === 0)
+                continue;
+            // Narrow ambiguous bare-name resolution: same file → same directory →
+            // unique global. A missing edge is safer than a fabricated one.
+            const sameFile = others.filter((t) => t.file === e.file);
+            const sameDir = sameFile.length === 0
+                ? others.filter((t) => t.file.split('/').slice(0, -1).join('/') === eDir)
+                : [];
+            const uniqueGlobal = others.length === 1 ? others : [];
+            const chosen = sameFile.length === 1
+                ? sameFile
+                : sameDir.length === 1
+                    ? sameDir
+                    : uniqueGlobal;
+            for (const t of chosen) {
+                refs.push({
+                    sourceId: e.id,
+                    targetId: t.id,
+                    type: 'calls',
+                    sourceLanguage: e.language,
+                    targetLanguage: t.language,
+                    confidence: 0.7,
+                });
+            }
+        }
+    }
+    return refs;
+}
+/** Build the dependency graph and its health analysis over the entity fact. */
+async function computeGraph(entities) {
+    const builder = new DependencyGraphBuilder({ includeTestFiles: false });
+    const references = buildReferences(entities);
+    const graph = await builder.buildGraph(entities, references);
+    const health = await builder.analyzeDependencyHealth(graph);
+    const idToEntity = new Map(entities.map((e) => [e.id, e]));
+    return { issues: health.issues, suggestions: health.suggestions, idToEntity };
+}
+/** The first affected node that resolves to a real entity — the finding anchor. */
+function anchor(issue, idToEntity) {
+    return issue.affectedNodes.map((id) => idToEntity.get(id)).find(Boolean);
+}
+/** Read one issue type and emit its single finding (cycles/tight-coupling).
+ *  The reducer anchors these to the first resolvable affected node and carries
+ *  the health analysis' own severity (`issue.severity`), not a rule-level one. */
+async function issueToFindings(entities, type, id) {
+    const { issues, idToEntity } = await computeGraph(entities);
+    const out = [];
+    for (const issue of issues) {
+        if (issue.type !== type)
+            continue;
+        const a = anchor(issue, idToEntity);
+        out.push({
+            ruleId: id,
+            severity: issue.severity,
+            message: issue.description,
+            file: a?.file ?? '(unknown)',
+            line: a?.startLine ?? 0,
+            // §7 — anchor the cycle/tight-coupling finding to the resolvable node that
+            // located it, so two issues in one file do not collapse to one fingerprint.
+            symbol: a?.name,
+        });
+    }
+    return out;
+}
+/** Read one suggestion type and emit its finding. */
+async function suggestionToFindings(entities, type, id) {
+    const { suggestions } = await computeGraph(entities);
+    const out = [];
+    for (const s of suggestions) {
+        if (s.type !== type)
+            continue;
+        out.push({
+            ruleId: id,
+            severity: SUGGESTION_SEVERITY[type],
+            message: s.description,
+            file: '(multiple)',
+            line: 0,
+        });
+    }
+    return out;
+}
+// ── circular-dependency ──────────────────────────────────────────────────────
+const circularDependency = {
+    id: 'circular-dependency',
+    analyzer: 'dependency-graph',
+    needs: { formats: ['typescript', 'tsx', 'javascript', 'go'], facts: ['cross-language-entities'] },
+    severity: 'severe',
+    message: META['circular-dependency'].message,
+    docs: META['circular-dependency'].docs,
+    thresholds: META['circular-dependency'].thresholds,
+    samples: META['circular-dependency'].samples,
+    async analyze(ctx) {
+        return issueToFindings(ctx.facts['cross-language-entities'], 'circular-dependency', 'circular-dependency');
+    },
+};
+// ── tight-coupling ───────────────────────────────────────────────────────────
+const tightCoupling = {
+    id: 'tight-coupling',
+    analyzer: 'dependency-graph',
+    needs: { formats: ['typescript', 'tsx', 'javascript', 'go'], facts: ['cross-language-entities'] },
+    severity: 'high',
+    message: META['tight-coupling'].message,
+    docs: META['tight-coupling'].docs,
+    thresholds: META['tight-coupling'].thresholds,
+    thresholdRationale: META['tight-coupling'].thresholdRationale,
+    samples: META['tight-coupling'].samples,
+    async analyze(ctx) {
+        return issueToFindings(ctx.facts['cross-language-entities'], 'tight-coupling', 'tight-coupling');
+    },
+};
+// ── orphaned-nodes ───────────────────────────────────────────────────────────
+const orphanedNodes = {
+    id: 'orphaned-nodes',
+    analyzer: 'dependency-graph',
+    needs: { formats: ['typescript', 'tsx', 'javascript', 'go'], facts: ['cross-language-entities'] },
+    severity: 'severe',
+    message: META['orphaned-nodes'].message,
+    docs: META['orphaned-nodes'].docs,
+    thresholds: META['orphaned-nodes'].thresholds,
+    samples: META['orphaned-nodes'].samples,
+    async analyze(ctx) {
+        const { issues, idToEntity } = await computeGraph(ctx.facts['cross-language-entities']);
+        const out = [];
+        for (const issue of issues) {
+            if (issue.type !== 'orphaned-nodes')
+                continue;
+            for (const id of issue.affectedNodes) {
+                const orphan = idToEntity.get(id);
+                if (!orphan)
+                    continue;
+                out.push({
+                    ruleId: 'orphaned-nodes',
+                    severity: issue.severity,
+                    message: `Orphaned node "${orphan.name}" has no connections.`,
+                    file: orphan.file,
+                    line: orphan.startLine,
+                    symbol: orphan.name,
+                });
+            }
+        }
+        return out;
+    },
+};
+// ── break-cycles ─────────────────────────────────────────────────────────────
+const breakCycles = {
+    id: 'break-cycles',
+    analyzer: 'dependency-graph',
+    needs: { formats: ['typescript', 'tsx', 'javascript', 'go'], facts: ['cross-language-entities'] },
+    severity: 'severe',
+    message: META['break-cycles'].message,
+    docs: META['break-cycles'].docs,
+    thresholds: META['break-cycles'].thresholds,
+    samples: META['break-cycles'].samples,
+    async analyze(ctx) {
+        return suggestionToFindings(ctx.facts['cross-language-entities'], 'break-cycles', 'break-cycles');
+    },
+};
+// ── reduce-coupling ──────────────────────────────────────────────────────────
+const reduceCoupling = {
+    id: 'reduce-coupling',
+    analyzer: 'dependency-graph',
+    needs: { formats: ['typescript', 'tsx', 'javascript', 'go'], facts: ['cross-language-entities'] },
+    severity: 'high',
+    message: META['reduce-coupling'].message,
+    docs: META['reduce-coupling'].docs,
+    thresholds: META['reduce-coupling'].thresholds,
+    samples: META['reduce-coupling'].samples,
+    async analyze(ctx) {
+        return suggestionToFindings(ctx.facts['cross-language-entities'], 'reduce-coupling', 'reduce-coupling');
+    },
+};
+// ── review-orphans ───────────────────────────────────────────────────────────
+const reviewOrphans = {
+    id: 'review-orphans',
+    analyzer: 'dependency-graph',
+    needs: { formats: ['typescript', 'tsx', 'javascript', 'go'], facts: ['cross-language-entities'] },
+    severity: 'severe',
+    message: META['review-orphans'].message,
+    docs: META['review-orphans'].docs,
+    thresholds: META['review-orphans'].thresholds,
+    samples: META['review-orphans'].samples,
+    async analyze(ctx) {
+        return suggestionToFindings(ctx.facts['cross-language-entities'], 'review-orphans', 'review-orphans');
+    },
+};
+/** The six dependency-graph rules this slice migrates, in registry order. */
+export const dependencyGraphRules = [
+    circularDependency,
+    breakCycles,
+    tightCoupling,
+    reduceCoupling,
+    orphanedNodes,
+    reviewOrphans,
+];
+//# sourceMappingURL=dependencyGraph.js.map

package/dist/phase/rules/dependencyGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependencyGraph.js","sourceRoot":"","sources":["../../../src/phase/rules/dependencyGraph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAIH,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAChE,OAAO,EACL,sBAAsB,GAGvB,MAAM,0DAA0D,CAAC;AASlE,MAAM,IAAI,GAAG,aAAa,CAAC;AAE3B,gFAAgF;AAChF,MAAM,mBAAmB,GAAmD;IAC1E,cAAc,EAAE,QAAQ;IACxB,iBAAiB,EAAE,MAAM;IACzB,gBAAgB,EAAE,QAAQ;CAC3B,CAAC;AAEF;;;GAGG;AACH,SAAS,eAAe,CAAC,QAAkB;IACzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,IAAI,GAAqB,EAAE,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,OAAO,GAAI,CAAC,CAAC,QAAQ,EAAE,OAAgC,IAAI,EAAE,CAAC;QACpE,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;YAC/D,yEAAyE;YACzE,IAAI,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE;gBAAE,SAAS;YAC5C,MAAM,MAAM,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YACrE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAElC,sEAAsE;YACtE,gEAAgE;YAChE,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC;YACzD,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,KAAK,CAAC;gBACnC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC;gBACzE,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YACvD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAClC,CAAC,CAAC,QAAQ;gBACV,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;oBACpB,CAAC,CAAC,OAAO;oBACT,CAAC,CAAC,YAAY,CAAC;YAEnB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC;oBACR,QAAQ,EAAE,CAAC,CAAC,EAAE;oBACd,QAAQ,EAAE,CAAC,CAAC,EAAE;oBACd,IAAI,EAAE,OAAO;oBACb,cAAc,EAAE,CAAC,CAAC,QAAQ;oBAC1B,cAAc,EAAE,CAAC,CAAC,QAAQ;oBAC1B,UAAU,EAAE,GAAG;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AASD,+EAA+E;AAC/E,KAAK,UAAU,YAAY,CAAC,QAAkB;IAC5C,MAAM,OAAO,GAAG,IAAI,sBAAsB,CAAC,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,CAAC;IACxE,MAAM,UAAU,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,QAA4C,EAAE,UAAU,CAAC,CAAC;IACjG,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;IAC5D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAU,CAAC,CAAC,CAAC;IACpE,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,MAAM,CAAC,WAAW,EAAE,UAAU,EAAE,CAAC;AAChF,CAAC;AAED,mFAAmF;AACnF,SAAS,MAAM,CAAC,KAAsB,EAAE,UAA+B;IACrE,OAAO,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC3E,CAAC;AAED;;kFAEkF;AAClF,KAAK,UAAU,eAAe,CAC5B,QAAkB,EAClB,IAA6B,EAC7B,EAAU;IAEV,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,YAAY,CAAC,QAAQ,CAAC,CAAC;IAC5D,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI;YAAE,SAAS;QAClC,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QACpC,GAAG,CAAC,IAAI,CAAC;YACP,MAAM,EAAE,EAAE;YACV,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,OAAO,EAAE,KAAK,CAAC,WAAW;YAC1B,IAAI,EAAE,CAAC,EAAE,IAAI,IAAI,WAAW;YAC5B,IAAI,EAAE,CAAC,EAAE,SAAS,IAAI,CAAC;YACvB,2EAA2E;YAC3E,4EAA4E;YAC5E,MAAM,EAAE,CAAC,EAAE,IAAI;SAChB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,qDAAqD;AACrD,KAAK,UAAU,oBAAoB,CACjC,QAAkB,EAClB,IAAkC,EAClC,EAAU;IAEV,MAAM,EAAE,WAAW,EAAE,GAAG,MAAM,YAAY,CAAC,QAAQ,CAAC,CAAC;IACrD,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;YAAE,SAAS;QAC9B,GAAG,CAAC,IAAI,CAAC;YACP,MAAM,EAAE,EAAE;YACV,QAAQ,EAAE,mBAAmB,CAAC,IAAI,CAAC;YACnC,OAAO,EAAE,CAAC,CAAC,WAAW;YACtB,IAAI,EAAE,YAAY;YAClB,IAAI,EAAE,CAAC;SACR,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,gFAAgF;AAEhF,MAAM,kBAAkB,GAAyC;IAC/D,EAAE,EAAE,qBAAqB;IACzB,QAAQ,EAAE,kBAAkB;IAC5B,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,yBAAyB,CAAC,EAAE;IACjG,QAAQ,EAAE,QAAQ;IAClB,OAAO,EAAE,IAAI,CAAC,qBAAqB,CAAC,CAAC,OAAO;IAC5C,IAAI,EAAE,IAAI,CAAC,qBAAqB,CAAC,CAAC,IAAI;IACtC,UAAU,EAAE,IAAI,CAAC,qBAAqB,CAAC,CAAC,UAAU;IAClD,OAAO,EAAE,IAAI,CAAC,qBAAqB,CAAC,CAAC,OAAO;IAC5C,KAAK,CAAC,OAAO,CAAC,GAAG;QACf,OAAO,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,yBAAyB,CAAC,EAAE,qBAAqB,EAAE,qBAAqB,CAAC,CAAC;IAC7G,CAAC;CACF,CAAC;AAEF,gFAAgF;AAEhF,MAAM,aAAa,GAAyC;IAC1D,EAAE,EAAE,gBAAgB;IACpB,QAAQ,EAAE,kBAAkB;IAC5B,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,yBAAyB,CAAC,EAAE;IACjG,QAAQ,EAAE,MAAM;IAChB,OAAO,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,OAAO;IACvC,IAAI,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,IAAI;IACjC,UAAU,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,UAAU;IAC7C,kBAAkB,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,kBAAkB;IAC7D,OAAO,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,OAAO;IACvC,KAAK,CAAC,OAAO,CAAC,GAAG;QACf,OAAO,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,yBAAyB,CAAC,EAAE,gBAAgB,EAAE,gBAAgB,CAAC,CAAC;IACnG,CAAC;CACF,CAAC;AAEF,gFAAgF;AAEhF,MAAM,aAAa,GAAyC;IAC1D,EAAE,EAAE,gBAAgB;IACpB,QAAQ,EAAE,kBAAkB;IAC5B,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,yBAAyB,CAAC,EAAE;IACjG,QAAQ,EAAE,QAAQ;IAClB,OAAO,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,OAAO;IACvC,IAAI,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,IAAI;IACjC,UAAU,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,UAAU;IAC7C,OAAO,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,OAAO;IACvC,KAAK,CAAC,OAAO,CAAC,GAAG;QACf,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC,CAAC;QACxF,MAAM,GAAG,GAAc,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,CAAC,IAAI,KAAK,gBAAgB;gBAAE,SAAS;YAC9C,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClC,IAAI,CAAC,MAAM;oBAAE,SAAS;gBACtB,GAAG,CAAC,IAAI,CAAC;oBACP,MAAM,EAAE,gBAAgB;oBACxB,QAAQ,EAAE,KAAK,CAAC,QAAQ;oBACxB,OAAO,EAAE,kBAAkB,MAAM,CAAC,IAAI,uBAAuB;oBAC7D,IAAI,EAAE,MAAM,CAAC,IAAI;oBACjB,IAAI,EAAE,MAAM,CAAC,SAAS;oBACtB,MAAM,EAAE,MAAM,CAAC,IAAI;iBACpB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF,CAAC;AAEF,gFAAgF;AAEhF,MAAM,WAAW,GAAyC;IACxD,EAAE,EAAE,cAAc;IAClB,QAAQ,EAAE,kBAAkB;IAC5B,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,yBAAyB,CAAC,EAAE;IACjG,QAAQ,EAAE,QAAQ;IAClB,OAAO,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,OAAO;IACrC,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,IAAI;IAC/B,UAAU,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,UAAU;IAC3C,OAAO,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,OAAO;IACrC,KAAK,CAAC,OAAO,CAAC,GAAG;QACf,OAAO,oBAAoB,CAAC,GAAG,CAAC,KAAK,CAAC,yBAAyB,CAAC,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;IACpG,CAAC;CACF,CAAC;AAEF,gFAAgF;AAEhF,MAAM,cAAc,GAAyC;IAC3D,EAAE,EAAE,iBAAiB;IACrB,QAAQ,EAAE,kBAAkB;IAC5B,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,yBAAyB,CAAC,EAAE;IACjG,QAAQ,EAAE,MAAM;IAChB,OAAO,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,OAAO;IACxC,IAAI,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,IAAI;IAClC,UAAU,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,UAAU;IAC9C,OAAO,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,OAAO;IACxC,KAAK,CAAC,OAAO,CAAC,GAAG;QACf,OAAO,oBAAoB,CAAC,GAAG,CAAC,KAAK,CAAC,yBAAyB,CAAC,EAAE,iBAAiB,EAAE,iBAAiB,CAAC,CAAC;IAC1G,CAAC;CACF,CAAC;AAEF,gFAAgF;AAEhF,MAAM,aAAa,GAAyC;IAC1D,EAAE,EAAE,gBAAgB;IACpB,QAAQ,EAAE,kBAAkB;IAC5B,KAAK,EAAE,EAAE,OAAO,EAAE,CAAC,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,yBAAyB,CAAC,EAAE;IACjG,QAAQ,EAAE,QAAQ;IAClB,OAAO,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,OAAO;IACvC,IAAI,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,IAAI;IACjC,UAAU,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,UAAU;IAC7C,OAAO,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,OAAO;IACvC,KAAK,CAAC,OAAO,CAAC,GAAG;QACf,OAAO,oBAAoB,CAAC,GAAG,CAAC,KAAK,CAAC,yBAAyB,CAAC,EAAE,gBAAgB,EAAE,gBAAgB,CAAC,CAAC;IACxG,CAAC;CACF,CAAC;AAEF,6EAA6E;AAC7E,MAAM,CAAC,MAAM,oBAAoB,GAAoD;IACnF,kBAAkB;IAClB,WAAW;IACX,aAAa;IACb,cAAc;IACd,aAAa;IACb,aAAa;CACd,CAAC"}

package/dist/phase/rules/documentation.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Spec 68 §3.2 — the documentation rules, migrated to `analyze(ctx)`.
+ *
+ * These five rules (`function-documentation`, `parameter-documentation`,
+ * `return-documentation`, `class-documentation`, `method-documentation`) were
+ * the per-file AST checks inside `UniversalDocumentationAnalyzer`; now they read
+ * the `file-symbols` fact and do pure comparison over plain data. The tree died
+ * with the file — the producer pre-computed the two skip signals a rule cannot
+ * derive from symbol fields (`isAnonymousOrCallback`, `isNonPublic`) where the
+ * parent chain and method node still existed.
+ *
+ * `file-documentation` is *not* here: it is a file-level rule (a leading
+ * header comment), not a symbol-level one, and reads a fact kind
+ * (`file-symbols` carries symbols, not files) the migration map dispositions
+ * RENEW. It stays on the legacy path until its own fact lands.
+ *
+ * Config resolution mirrors the legacy analyzer's `{...DEFAULT, ...config}`
+ * merge, but the defaults are re-declared here (the legacy class is deleted in
+ * §15, and the rule must not reach across the phase boundary to import it). The
+ * §10 bridge (`resolvePhaseThresholds`) already merges the same default into
+ * `ctx.thresholds`, so the merge is idempotent in production and load-bearing
+ * only for the parity test, which passes raw config to both sides.
+ *
+ * The three rules read only their tuning thresholds; §10 removed the
+ * `requireParamDocs` / `requireReturnDocs` opt-in gates — these rules now fire
+ * unconditionally, so the two booleans are gone from this config surface.
+ */
+import type { RuleDefinition } from '../types.js';
+/** The shared declaration for every documentation rule in this slice. */
+type DocumentationNeeds = {
+    readonly formats: readonly ['typescript', 'tsx', 'javascript'];
+    readonly facts: readonly ['file-symbols'];
+};
+/**
+ * True when a file path matches any exempt pattern (case-insensitive regex).
+ *
+ * @param name - The file path to test.
+ * @param patterns - The exempt regex patterns.
+ * @returns True when `name` matches at least one pattern.
+ */
+export declare function isExempt(name: string, patterns: string[]): boolean;
+/** The five documentation rules this slice migrates, in registry order. */
+export declare const documentationRules: readonly RuleDefinition<DocumentationNeeds>[];
+export {};
+//# sourceMappingURL=documentation.d.ts.map

package/dist/phase/rules/documentation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"documentation.d.ts","sourceRoot":"","sources":["../../../src/phase/rules/documentation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,KAAK,EACV,cAAc,EAOf,MAAM,aAAa,CAAC;AAIrB,yEAAyE;AACzE,KAAK,kBAAkB,GAAG;IACxB,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,YAAY,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;IAC/D,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,cAAc,CAAC,CAAC;CAC3C,CAAC;AAqEF;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,OAAO,CAKlE;AAiQD,2EAA2E;AAC3E,eAAO,MAAM,kBAAkB,EAAE,SAAS,cAAc,CAAC,kBAAkB,CAAC,EAM3E,CAAC"}