@cplieger/deadset-ts 7.2.0-dev.4 → 8.0.0-dev.10

package/dist/src/exempt.js

@@ -6,26 +6,18 @@
  * which records held something back. It names no class's detector: the composition
  * hands it the table of the classes it has.
  */
-import { ConfigError } from "./config.js";
-import { EXEMPTION_CLASSES, isExemptionClass, TS_EXEMPTION_CLASSES, typescriptVisibilityOf, } from "./exempt-classes.js";
+import { EXEMPTION_CLASSES } from "./contract/contract.generated.js";
+import { TS_EXEMPTION_CLASSES, typescriptVisibilityOf, } from "./exempt-classes.js";
 import { byPosition, positionKey } from "./position.js";
 import { Unanswerable } from "./query.js";
 import { sweep } from "./sweep.js";
+import { bytewise } from "./text/compare.js";
 /**
- * The classes `exemptions.disabled` switches off. A name is refused unless the
- * vocabulary holds it; a class that runs on another language only is admitted and
- * switches nothing off here, so one configuration serves every analyzer.
+ * The classes `exemptions.disabled` switches off. A class that runs on another language
+ * only switches nothing off here, so one configuration serves every analyzer.
  */
 export function disabledClasses(config) {
-    const disabled = new Set();
-    for (const name of config.exemptionsDisabled) {
-        if (!isExemptionClass(name)) {
-            const known = EXEMPTION_CLASSES.map((row) => row.class).join(", ");
-            throw new ConfigError("malformed", "exemptions.disabled", `exemptions.disabled: ${JSON.stringify(name)} is not an exemption class: the classes are ${known}`);
-        }
-        disabled.add(name);
-    }
-    return disabled;
+    return new Set(config.exemptions.disabled);
 }
 /**
  * Whether a class whose row states `allowed` may retain a member of one visibility. A
@@ -40,20 +32,8 @@ function retainable(allowed, visibility) {
     }
     return true;
 }
-/**
- * The kinds of declaration each class can hold back, which a detector that stops holds
- * back whole. A class with no row here holds back every declaration but a file.
- */
-const RETAINABLE = new Map([
-    ["interface-satisfaction", new Set(["method", "class-member"])],
-    ["enum-group", new Set(["enum-member"])],
-    ["injection-container", new Set(["method", "class-member"])],
-    ["framework-lifecycle", new Set(["method", "class-member"])],
-    [
-        "serialization-contract",
-        new Set(["method", "class-member", "interface-method", "type-member"]),
-    ],
-]);
+/** The kinds of declaration each class can hold back, which a detector that stops holds back whole. */
+const RETAINABLE = new Map(EXEMPTION_CLASSES.flatMap((row) => "ts" in row.retainsKinds ? [[row.class, new Set(row.retainsKinds.ts)]] : []));
 /** The detail of a record a detector that could not finish holds. */
 const UNANSWERED_DETAIL = "kept live by a question the checker did not answer";
 /** Whether one record is held by a detector that could not finish. */
@@ -76,7 +56,7 @@ function detected(exemptionClass, detect, input) {
         }
         const kinds = RETAINABLE.get(exemptionClass);
         return input.held.symbols
-            .filter((symbol) => (kinds === undefined ? symbol.kind !== "file" : kinds.has(symbol.kind)))
+            .filter((symbol) => kinds?.has(symbol.kind) === true)
             .map((symbol) => ({ id: symbol.id, detail: UNANSWERED_DETAIL, site: symbol.position }));
     }
 }
@@ -106,11 +86,19 @@ export function evidenceRecords(input, detectors, disabled) {
                 site: evidence.site,
                 ...(evidence.whileLive === undefined ? {} : { whileLive: evidence.whileLive }),
                 ...(evidence.implementing === undefined ? {} : { implementing: evidence.implementing }),
+                ...(evidence.whileWritten === undefined ? {} : { whileWritten: evidence.whileWritten }),
             });
         }
     }
     return found;
 }
+/**
+ * The records that hold given the declarations a write the mode counts stores into: one
+ * that holds only while written holds where its declaration is among them.
+ */
+export function writtenRecords(records, written) {
+    return records.flatMap(({ whileWritten, ...record }) => whileWritten === undefined || written.has(record.id) ? [record] : []);
+}
 /** The records that hold under one mode, beside the evidence a production mode found in a test file. */
 export function heldRecords(records, holding) {
     const found = [];
@@ -125,20 +113,13 @@ export function heldRecords(records, holding) {
     }
     return { records: exemptionsOf(found), inTestFiles };
 }
-/** Two strings ordered bytewise. */
-function compare(a, b) {
-    if (a === b) {
-        return 0;
-    }
-    return a < b ? -1 : 1;
-}
 /**
  * Records as a run holds them: ordered by site, then class, then declaration, and one
  * per declaration, class, detail and file it holds while live, the one at the first
  * site. A fact found at many sites, or by several projects, is one record.
  */
 export function exemptionsOf(found) {
-    const ordered = [...found].sort((a, b) => byPosition(a.site, b.site) || compare(a.class, b.class) || compare(a.id, b.id));
+    const ordered = [...found].sort((a, b) => byPosition(a.site, b.site) || bytewise(a.class, b.class) || bytewise(a.id, b.id));
     const seen = new Set();
     return ordered.filter((record) => {
         const fact = [record.id, record.class, record.detail, record.whileLive ?? ""].join("\u0000");
@@ -189,8 +170,8 @@ export function retainedIn(matrix, input, writeOnly = new Set()) {
     return matrix.union.symbols.flatMap((symbol) => held.get(symbol.id) ?? []);
 }
 /**
- * One line per held-back declaration, in site order: its reference, then each record's
- * class, site and detail, all separated by tabs.
+ * One line per held-back declaration, in site order: its reference and position, then
+ * each record's class, site and detail, all separated by tabs.
  */
 export function retainedLines(symbols, retained) {
     const held = byDeclaration(retained);
@@ -204,6 +185,6 @@ export function retainedLines(symbols, retained) {
             positionKey(record.site),
             record.detail,
         ]);
-        return [[symbol.ref, ...fields].join("\t")];
+        return [[symbol.ref, positionKey(symbol.position), ...fields].join("\t")];
     });
 }

package/dist/src/failure.js

@@ -0,0 +1,36 @@
+import { FAILURE_CLASSES, FAILURE_PREFIXES } from "./contract/contract.generated.js";
+import { PRODUCT } from "./product.js";
+/** The failure as a class line of the error stream, opened by its group's prefix. */
+export function failureLine(failure) {
+    return `${FAILURE_PREFIXES[FAILURE_CLASSES[failure.failureClass]]}${failure.failureClass}: ${failure.detail}`;
+}
+/**
+ * The lines of the error stream that name the failures: the first one's class line, the run's
+ * only one, then each further failure as its class and detail with no group prefix.
+ */
+export function failureLines([first, ...further]) {
+    return [failureLine(first), ...further.map((one) => `${one.failureClass}: ${one.detail}`)];
+}
+/**
+ * A run the analysis cannot answer. It ends the run with the failure code and no finding
+ * list, printing the compiler's located errors and then the failures' lines.
+ */
+export class FailureExit extends Error {
+    failures;
+    /** The compiler's errors behind the failures, in the order it reported them. */
+    diagnostics;
+    constructor(failures, diagnostics = []) {
+        super(failureLines(failures).join("\n"));
+        this.name = "FailureExit";
+        this.failures = failures;
+        this.diagnostics = diagnostics;
+    }
+}
+/** A failure exit of one failure. */
+export function failureExit(failureClass, detail, diagnostics = []) {
+    return new FailureExit([{ failureClass, detail }], diagnostics);
+}
+/** A fault of this analyzer itself, `fault` saying what it cannot do. */
+export function productFault(fault) {
+    return failureExit("product-fault", `${PRODUCT} ${fault}: reinstall ${PRODUCT}, and report the fault to its maintainers if a reinstalled ${PRODUCT} fails the same way`);
+}

package/dist/src/file-facts.js

@@ -3,10 +3,10 @@
  * file below the target root, whether or not a project includes it, and the files a
  * program holds by inclusion rather than by an import.
  */
-import { IGNORED_DIRECTORIES } from "./discover.js";
 import { packageScope } from "./inventory.js";
 import { dirnamePath, joinPath, relativePath, resolvePath } from "./paths.js";
 import { renderRef } from "./ref.js";
+import { filesBelow } from "./fs/tree.js";
 /** A file name the compiler reads as a source file. */
 const SOURCE_FILE = /\.(?:ts|tsx|mts|cts)$/u;
 /** A file name the compiler reads as a declaration file, which no build emits code from. */
@@ -30,30 +30,7 @@ function lastLine(text) {
  * that cannot be read is skipped, as discovery skips it.
  */
 export function sourcePaths(host, targetRoot) {
-    const found = [];
-    const pending = [""];
-    for (let dir = pending.pop(); dir !== undefined; dir = pending.pop()) {
-        let entries;
-        try {
-            entries = host.readDirectory(joinPath(targetRoot, dir));
-        }
-        catch {
-            continue;
-        }
-        for (const entry of entries) {
-            const path = dir === "" ? entry.name : `${dir}/${entry.name}`;
-            if (entry.directory) {
-                if (!IGNORED_DIRECTORIES.has(entry.name)) {
-                    pending.push(path);
-                }
-                continue;
-            }
-            if (SOURCE_FILE.test(entry.name) && !DECLARATION_FILE.test(entry.name)) {
-                found.push(path);
-            }
-        }
-    }
-    return found.sort((a, b) => (a < b ? -1 : 1));
+    return filesBelow(host, targetRoot, (name) => SOURCE_FILE.test(name) && !DECLARATION_FILE.test(name));
 }
 /**
  * Every source file below the target root, in path order. A file that cannot be read is

package/dist/src/findings/completion.js

@@ -3,14 +3,20 @@
  * the code's row of the issue-kind vocabulary, and the dials that withhold a finding
  * together with every finding that falls with a root they withhold.
  */
+import { CODE, FAMILY_KEY_LENGTH, KIND_ROWS, } from "../contract/contract.generated.js";
 import { componentId } from "../components.js";
+import { deadComponents } from "../matrix.js";
 import { OUTSIDE } from "../graph.js";
 import { KINDS } from "../kinds.js";
 import { byPosition, positionKey } from "../position.js";
 import { declarationKey } from "../ref.js";
-import { FAMILY_KEY_LENGTH } from "../resolve.js";
 import { isPartSubject, isRowSubject } from "../suppress.js";
-/** The fixability grammar/analysis.md "Fixability" gives a finding about a held declaration. */
+/**
+ * The codes whose subject the run that counts test references holds live, so a test
+ * file's candidate reported under one carries none of a dead declaration's sweep facts.
+ */
+const LIVE_SUBJECT = new Set(KIND_ROWS.filter((row) => row.holdsLive).map((row) => row.code));
+/** The fixability grammar/analysis/fixability.md gives a finding about a held declaration. */
 const MANUAL = "manual";
 /** The member kinds an object property can declare, which an `in` expression tests by name. */
 const IN_TESTED = new Set([
@@ -35,8 +41,9 @@ function everyDeclaredLoaded(boundary) {
  * naming its family, else the code's default.
  */
 function severityOf(input, code, fallback) {
-    const { config } = input;
-    return (config.severity.get(code) ?? config.severity.get(code.slice(0, FAMILY_KEY_LENGTH)) ?? fallback);
+    const { severity } = input.config;
+    const key = [code, code.slice(0, FAMILY_KEY_LENGTH)].find((one) => Object.hasOwn(severity, one));
+    return key === undefined ? fallback : (severity[key] ?? fallback);
 }
 /**
  * The declarations the roots name as a library's published API, each public member of a
@@ -72,15 +79,13 @@ function testedByIn(input) {
  * published API, a public member of a published type included, is `certain` where the
  * run loaded every consumer the scope declared and declared one, `probable` where one did
  * not load, and `possible` where it declared none, whatever the configuration says of the
- * consumer set. Test-support code test code references, outside the test-of-dead-code
- * rule, what it contains, and a member an `in` expression tests by name are `possible`.
+ * consumer set. A member an `in` expression tests by name, and one a function outside the
+ * analysis fills, is `possible`.
  */
 function reachabilityClasses(input) {
     const tested = testedByIn(input);
+    const filled = input.boundary.filledOutside ?? new Set();
     const published = publishedIds(input.swept.matrix.union);
-    const usedByTests = new Set(input.swept.sweep.candidates
-        .filter((candidate) => candidate.heldByTests !== undefined)
-        .map((candidate) => candidate.id));
     const { declared } = input.boundary.consumers;
     const outside = declared.length === 0
         ? "possible"
@@ -88,12 +93,38 @@ function reachabilityClasses(input) {
             ? "certain"
             : "probable";
     return (id) => {
-        if (usedByTests.has(id) || tested.has(id)) {
+        if (tested.has(id) || filled.has(id)) {
             return "possible";
         }
         return published.has(id) ? outside : "certain";
     };
 }
+/**
+ * Whether one test of dead code references a target symbol that is published API of a run
+ * that declares no consumer, which outside programs the run cannot see may use, so the
+ * target counts as live for the test and the test is no test of dead code.
+ */
+export function testsUnseenAPI(input) {
+    if (input.boundary.consumers.declared.length > 0) {
+        return () => false;
+    }
+    const union = input.swept.matrix.union;
+    const published = publishedIds(union);
+    return (id) => testTargets(union, id).some((target) => published.has(target));
+}
+/** The target symbols one test of dead code references, by id: production declarations the sweep judges. */
+function testTargets(union, id) {
+    return (union.out[union.at(id)] ?? []).flatMap((edge) => {
+        const target = union.symbols[edge.to];
+        const testCode = union.test[edge.to] === true || union.support[edge.to] === true;
+        return target !== undefined &&
+            !testCode &&
+            union.ambient[edge.to] !== true &&
+            union.subject[edge.to] === true
+            ? [target.id]
+            : [];
+    });
+}
 /**
  * The confidence ceiling of a test of dead code: the lowest reachability class among the
  * target symbols it references, because its deadness is theirs, whether or not they share
@@ -102,34 +133,71 @@ function reachabilityClasses(input) {
 function testCeilings(input, classOf) {
     const union = input.swept.matrix.union;
     const tests = new Set(input.swept.sweep.candidates.filter((one) => one.testOfDeadCode).map((one) => one.id));
-    return (id) => {
-        let lowest = "certain";
-        if (!tests.has(id)) {
-            return lowest;
-        }
-        for (const edge of union.out[union.at(id)] ?? []) {
-            const target = union.symbols[edge.to];
-            const testCode = union.test[edge.to] === true || union.support[edge.to] === true;
-            if (target !== undefined && !testCode && union.subject[edge.to] === true) {
-                lowest = capped(lowest, classOf(target.id));
-            }
+    return (id) => tests.has(id)
+        ? testTargets(union, id).reduce((lowest, target) => capped(lowest, classOf(target)), "certain")
+        : "certain";
+}
+/**
+ * The subjects dead only because production code only tests use is: each declaration the
+ * sweep marks test-used, each `DS1602` file of such code, and each test of dead code every
+ * target of which is one. Nothing they hold references a dead declaration outside them, so
+ * the rest of a component they share is reported without them.
+ */
+function testUsedSubjects(input) {
+    const { matrix, sweep } = input.swept;
+    const union = matrix.union;
+    const used = new Set(sweep.candidates.filter((one) => one.testUsed).map((one) => one.id));
+    for (const test of sweep.candidates.filter((one) => one.testOfDeadCode)) {
+        const targets = testTargets(union, test.id);
+        if (targets.length > 0 && targets.every((target) => used.has(target))) {
+            used.add(test.id);
         }
-        return lowest;
-    };
+    }
+    const files = new Set(union.symbols.flatMap((symbol, at) => matrix.testUsed[at] === true ? [symbol.position.path] : []));
+    return { declarations: used, files };
+}
+/**
+ * The ceiling the roots the run found put on one dead subject: a subject other declarations
+ * reference, found dead only because no root reaches them, is `probable` unless the
+ * configuration declares the roots complete and no configuration holding the subject loads
+ * a module the analysis cannot resolve, because a root the analysis cannot see would make
+ * it live; every other declaration has none below `certain`.
+ */
+function rootsCeiling(input, finding, candidate, configurations) {
+    const unreachable = candidate?.relation === "reachability" || finding.unreachableOnly === true;
+    const unseen = new Set((input.files.unseenLoads ?? []).map((load) => load.configuration));
+    const complete = input.config.ts.roots_complete && !configurations.some((one) => unseen.has(one));
+    return unreachable && !complete ? "probable" : "certain";
 }
 /**
  * The component each dead declaration of the run falls in, and none for a live one, with
  * its members listed in the canonical order where the run lists a component in full.
  */
-function findingComponents(swept, cascade) {
+function findingComponents(swept, components, cascade) {
     const held = new Map();
-    for (const component of swept.sweep.components) {
+    for (const component of components) {
         for (const member of component.members) {
             held.set(member, component);
         }
     }
+    const listed = membersListed(swept);
+    return (id) => {
+        const component = held.get(id);
+        return component === undefined
+            ? undefined
+            : {
+                id: component.id,
+                root: component.roots.includes(id),
+                symbolCount: component.members.length,
+                deletableLines: component.deletableLines,
+                ...(cascade === "full" ? { members: listed(component.members) } : {}),
+            };
+    };
+}
+/** The members of a component as the run lists them, positioned and in the canonical order. */
+function membersListed(swept) {
     const symbols = new Map(swept.matrix.union.symbols.map((symbol) => [symbol.id, symbol]));
-    const listed = (component) => component.members
+    return (members) => members
         .flatMap((member) => {
         const symbol = symbols.get(member);
         return symbol === undefined
@@ -146,17 +214,58 @@ function findingComponents(swept, cascade) {
             ];
     })
         .sort((a, b) => byPosition(a.position, b.position));
-    return (id) => {
-        const component = held.get(id);
-        return component === undefined
-            ? undefined
+}
+/**
+ * The run's dead components with each file a `DS1602` finding reports dead among them, so
+ * the file's declarations fall with it, and with the components each subject that is no
+ * declaration falls with joined into one.
+ */
+function runComponents(swept, findings) {
+    const union = swept.matrix.union;
+    const reported = new Set(findings.filter((one) => one.code === CODE.fileNeverImported).map((one) => one.position.path));
+    const files = new Map(union.symbols.flatMap((symbol, at) => symbol.kind === "file" && reported.has(symbol.position.path) ? [[at, symbol]] : []));
+    const computed = files.size === 0
+        ? swept.sweep.components
+        : deadComponents(swept.matrix, swept.sweep, new Set(files.keys()));
+    const place = new Map();
+    computed.forEach((component, at) => {
+        for (const member of component.members) {
+            place.set(member, at);
+        }
+    });
+    const leader = computed.map((_component, at) => at);
+    const find = (at) => {
+        let top = at;
+        while ((leader[top] ?? top) !== top) {
+            top = leader[top] ?? top;
+        }
+        return top;
+    };
+    for (const { fallsWith } of findings) {
+        const joined = (fallsWith ?? []).flatMap((id) => place.get(id) ?? []).map(find);
+        const first = Math.min(...joined);
+        for (const one of joined) {
+            leader[one] = first;
+        }
+    }
+    const merged = new Map();
+    computed.forEach((component, at) => {
+        const top = find(at);
+        const into = merged.get(top);
+        merged.set(top, into === undefined
+            ? component
             : {
-                id: component.id,
-                root: component.roots.includes(id),
-                symbolCount: component.members.length,
-                deletableLines: component.deletableLines,
-                ...(cascade === "full" ? { members: listed(component) } : {}),
-            };
+                id: into.id,
+                members: [...into.members, ...component.members],
+                roots: [...into.roots, ...component.roots],
+                deletableLines: into.deletableLines + component.deletableLines,
+                held: into.held && component.held,
+            });
+    });
+    return {
+        components: [...merged.values()],
+        computed: computed.length,
+        files: new Map([...files.values()].map((symbol) => [symbol.position.path, symbol.id])),
     };
 }
 /**
@@ -174,16 +283,20 @@ export function completed(input, findings, kinds = KINDS) {
     const candidates = new Map(swept.sweep.candidates.map((candidate) => [candidate.id, candidate]));
     const classOf = reachabilityClasses(input);
     const ceilingOf = testCeilings(input, classOf);
-    const componentOf = findingComponents(swept, input.config.reporters.cascade);
-    const held = new Set(swept.sweep.components.filter((one) => one.held).flatMap((one) => one.members));
-    let minted = swept.sweep.components.length;
-    const dead = new Set(swept.sweep.components.map((component) => component.id));
+    const testUsed = testUsedSubjects(input);
+    const { components, computed, files } = runComponents(swept, findings);
+    const componentOf = findingComponents(swept, components, input.config.reporters.cascade);
+    const held = new Set(components.filter((one) => one.held).flatMap((one) => one.members));
+    // A join keeps its first component's identifier, so a minted one counts past every computed one.
+    let minted = computed;
+    const dead = new Set(components.map((component) => component.id));
     const fallingWith = new Map();
-    for (const { heldByTests } of swept.sweep.candidates) {
+    for (const { id, heldByTests } of swept.sweep.candidates) {
         if (heldByTests !== undefined) {
-            fallingWith.set(heldByTests, (fallingWith.get(heldByTests) ?? 0) + 1);
+            fallingWith.set(heldByTests, [...(fallingWith.get(heldByTests) ?? []), id]);
         }
     }
+    const listed = membersListed(swept);
     const done = findings.map((finding) => {
         const row = kinds.get(finding.code);
         if (row === undefined) {
@@ -193,18 +306,30 @@ export function completed(input, findings, kinds = KINDS) {
         // a row is still never the declaration. Two declarations of one file can share a
         // reference, so the one the finding is positioned at is the subject where there is one.
         const declared = union.at(positionKey(finding.position));
+        const ref = finding.symbol.holder ?? finding.symbol.ref;
         const at = isRowSubject(finding.symbol.kind)
             ? OUTSIDE
-            : union.symbols[declared]?.ref === finding.symbol.ref
+            : union.symbols[declared]?.ref === ref
                 ? declared
-                : (positions.get(declarationKey(finding.symbol.ref, finding.position.path)) ?? OUTSIDE);
+                : (positions.get(declarationKey(ref, finding.position.path)) ?? OUTSIDE);
         // A part names the declaration that holds it, and is decided inside it rather than by
         // the declaration's liveness, so it carries none of the declaration's sweep facts.
         const part = isPartSubject(finding.symbol.kind);
         const symbol = union.symbols[at];
         const judged = !part && union.subject[at] === true ? symbol : undefined;
-        const candidate = judged === undefined ? undefined : candidates.get(judged.id);
-        const found = symbol === undefined || part ? undefined : componentOf(symbol.id);
+        const candidate = judged === undefined || LIVE_SUBJECT.has(finding.code)
+            ? undefined
+            : candidates.get(judged.id);
+        const fallsWith = finding.fallsWith?.[0];
+        const joined = fallsWith === undefined ? undefined : componentOf(fallsWith);
+        const file = finding.code === CODE.fileNeverImported ? files.get(finding.position.path) : undefined;
+        const found = joined !== undefined
+            ? { ...joined, root: false }
+            : file !== undefined
+                ? componentOf(file)
+                : symbol === undefined || part
+                    ? undefined
+                    : componentOf(symbol.id);
         // A test file's declaration is a component member only as a test of dead code, and
         // test code keeps the test-support code it references out of every component.
         if (candidate !== undefined &&
@@ -216,17 +341,40 @@ export function completed(input, findings, kinds = KINDS) {
         let component = found;
         if (component === undefined) {
             minted += 1;
+            const falling = symbol?.kind === "interface" ? fallingWith.get(symbol.id) : undefined;
             component = {
                 id: componentId(minted),
                 root: true,
-                symbolCount: symbol?.kind === "interface" ? (fallingWith.get(symbol.id) ?? 1) : 1,
+                symbolCount: falling?.length ?? 1,
                 deletableLines: 0,
+                ...(input.config.reporters.cascade !== "full"
+                    ? {}
+                    : falling === undefined
+                        ? {
+                            members: [
+                                {
+                                    ref: finding.symbol.ref,
+                                    name: finding.symbol.name,
+                                    position: finding.position,
+                                },
+                            ],
+                        }
+                        : { members: listed(falling) }),
             };
         }
         const counts = candidate === undefined
             ? union.made[at]
             : { production: candidate.productionRefs, test: candidate.testRefs };
-        const reachabilityClass = judged === undefined ? (finding.reachabilityClass ?? "certain") : classOf(judged.id);
+        const ownClass = judged === undefined ? (finding.reachabilityClass ?? "certain") : classOf(judged.id);
+        const used = judged !== undefined
+            ? candidate !== undefined && testUsed.declarations.has(judged.id)
+            : finding.code === CODE.fileNeverImported && testUsed.files.has(finding.position.path);
+        const reachabilityClass = used && candidate?.testOfDeadCode !== true ? "possible" : ownClass;
+        const configurations = candidate?.configurations ??
+            (judged === undefined && !part
+                ? swept.matrix.configurations
+                : (swept.matrix.heldIn[at] ?? swept.matrix.configurations));
+        const untested = capped(capped(capped(ownClass, row.maxClass), rootsCeiling(input, finding, candidate, configurations)), judged === undefined ? "certain" : ceilingOf(judged.id));
         const generated = input.files.generated?.has(finding.position.path) === true;
         const fixability = generated
             ? "none"
@@ -236,9 +384,13 @@ export function completed(input, findings, kinds = KINDS) {
                 row.findingFixabilities?.includes(MANUAL) === true
                 ? MANUAL
                 : row.fixability;
-        const lastUses = fixability === "deletable" && candidate !== undefined
-            ? input.dependencies.lastUses.get(candidate.id)
-            : undefined;
+        const lastUses = fixability !== "deletable"
+            ? undefined
+            : candidate !== undefined
+                ? input.dependencies.lastUses.get(candidate.id)
+                : finding.code === CODE.fileNeverImported
+                    ? input.dependencies.fileLastUses.get(finding.position.path)
+                    : undefined;
         return {
             code: finding.code,
             kind: row.name,
@@ -246,16 +398,14 @@ export function completed(input, findings, kinds = KINDS) {
             position: finding.position,
             symbol: finding.symbol,
             reachabilityClass,
-            confidence: capped(capped(reachabilityClass, row.maxClass), judged === undefined ? "certain" : ceilingOf(judged.id)),
+            confidence: used ? "possible" : untested,
+            ...(used ? { componentConfidence: untested } : {}),
             ...(candidate === undefined ? {} : { livenessRelation: candidate.relation }),
             testOnly: judged !== undefined && counts?.production === 0 && counts.test > 0,
             generated,
             component,
             retainedBy: [],
-            configurations: candidate?.configurations ??
-                (judged === undefined && !part
-                    ? swept.matrix.configurations
-                    : (swept.matrix.heldIn[at] ?? swept.matrix.configurations)),
+            configurations,
             consumersLoaded: input.boundary.consumers.loaded,
             fixability,
             severity: severityOf(input, finding.code, row.defaultSeverity),
@@ -270,7 +420,7 @@ export function completed(input, findings, kinds = KINDS) {
 /**
  * The findings with every finding of a dead component capped by the lowest confidence
  * among the component's root members, so the minimum confidence reports or withholds a
- * component whole.
+ * component whole but for the findings test-used code lowers on their own.
  */
 function componentCapped(findings, dead) {
     const lowest = new Map();
@@ -278,16 +428,27 @@ function componentCapped(findings, dead) {
         const { id, root } = finding.component;
         if (root && dead.has(id)) {
             const held = lowest.get(id);
-            lowest.set(id, held === undefined ? finding.confidence : capped(held, finding.confidence));
+            const own = componentConfidenceOf(finding);
+            lowest.set(id, held === undefined ? own : capped(held, own));
         }
     }
     return findings.map((finding) => {
         const cap = lowest.get(finding.component.id);
-        return cap === undefined || RANK[cap] >= RANK[finding.confidence]
-            ? finding
-            : { ...finding, confidence: cap };
+        if (cap === undefined) {
+            return finding;
+        }
+        const own = finding.componentConfidence;
+        return {
+            ...finding,
+            confidence: capped(finding.confidence, cap),
+            ...(own === undefined ? {} : { componentConfidence: capped(own, cap) }),
+        };
     });
 }
+/** The confidence a finding gives its component's cap and the dials. */
+function componentConfidenceOf(finding) {
+    return finding.componentConfidence ?? finding.confidence;
+}
 /** Whether the dials withhold a finding by its own severity or confidence. */
 function dialed(finding, minConfidence) {
     return finding.severity === "allow" || RANK[finding.confidence] < RANK[minConfidence];
@@ -300,9 +461,10 @@ function dialed(finding, minConfidence) {
  * root withholds itself alone.
  */
 export function dialsOf(input, findings) {
-    const minConfidence = input.config.analysis.minConfidence;
+    const minConfidence = input.config.analysis.min_confidence;
     const components = new Set(findings
-        .filter((finding) => finding.component.root && dialed(finding, minConfidence))
+        .filter((finding) => finding.component.root &&
+        dialed({ ...finding, confidence: componentConfidenceOf(finding) }, minConfidence))
         .map((finding) => finding.component.id));
     return {
         allows: (code) => {