@fraction12/deepclean 0.1.0-alpha.0

package/dist/reviewers.js

@@ -0,0 +1,461 @@
+export const reviewerRubrics = [
+    {
+        id: "architecture-deepening",
+        title: "Architecture and module deepening",
+        basis: [
+            "Deepclean native reviewer",
+            "Matt Pocock skills: improve-codebase-architecture",
+        ],
+        purpose: "Find places where working code lacks real module boundaries, ownership, or durable seams.",
+        lookFor: [
+            "domain logic trapped in UI components, routes, scripts, or orchestration files",
+            "large files acting as mixed controllers, services, DTO stores, and policy holders",
+            "missing module boundaries where several files share one concept but no named home",
+            "helper modules with many callers but unclear ownership or unstable APIs",
+            "dependencies flowing from stable/domain code toward volatile UI/runtime code",
+            "shallow modules whose interface is nearly as complex as their implementation",
+            "modules that fail the deletion test because removing them would remove complexity rather than concentrate it",
+        ],
+        reject: [
+            "single large file findings with no architectural consequence",
+            "abstract advice to add layers without citing files and evidence",
+            "renaming-only suggestions",
+        ],
+        output: [
+            "name the missing or weak boundary",
+            "explain the current ownership problem",
+            "suggest the smallest durable module shape a future agent should investigate",
+        ],
+    },
+    {
+        id: "deep-module-discipline",
+        title: "Deep module discipline",
+        basis: [
+            "Matt Pocock skills: improve-codebase-architecture/DEEPENING.md",
+            "Matt Pocock skills: tdd/deep-modules.md",
+        ],
+        purpose: "Find cleanup work that would increase leverage and locality by moving complexity behind smaller, more durable interfaces.",
+        lookFor: [
+            "places where callers know too much about ordering, config, data shape, or error modes",
+            "logic spread across shallow helper layers where each layer adds little leverage",
+            "candidate modules where a small public interface could hide a larger implementation",
+            "dependencies that should be classified before deepening: in-process, local-substitutable, remote owned, or true external",
+            "seams that are only hypothetical because there is one adapter and no real second use such as tests",
+            "tests that should move to the deepened module interface after shallow modules are collapsed",
+        ],
+        reject: [
+            "suggestions to add interfaces or ports without evidence of two adapters or a real substitution need",
+            "refactors that merely split files without improving leverage or locality",
+            "test-only extractions that make production design shallower",
+        ],
+        output: [
+            "state the interface pressure callers currently feel",
+            "classify the dependency shape that constrains the cleanup",
+            "recommend a small deepening step that improves both maintainability and testability",
+        ],
+    },
+    {
+        id: "duplication-consolidation",
+        title: "Conceptual duplication and consolidation",
+        purpose: "Find repeated behavior or policy that should become one source of truth.",
+        lookFor: [
+            "duplicate code blocks that reflect duplicated domain decisions",
+            "same validation, formatting, permission, API, or config behavior across feature areas",
+            "parallel frontend/admin/backend implementations that are likely to drift",
+            "repeated literals or branching rules that encode the same concept",
+        ],
+        reject: [
+            "incidental duplicated syntax with no shared domain meaning",
+            "test fixture repetition",
+            "framework boilerplate",
+        ],
+        output: [
+            "identify the repeated concept",
+            "state which callers must stay behaviorally compatible",
+            "recommend the consolidation target without prescribing a broad rewrite",
+        ],
+    },
+    {
+        id: "dependency-graph",
+        title: "Dependency graph and blast radius",
+        purpose: "Use import/reference structure to find hotspots, direction problems, and risky cleanup order.",
+        lookFor: [
+            "files with high incoming and outgoing edges",
+            "directories with high cross-boundary traffic",
+            "central utility files that mix unrelated policies",
+            "feature code importing across boundaries instead of through stable modules",
+            "cleanup candidates that should be handled as a cluster because their graph is connected",
+        ],
+        reject: [
+            "hotspot claims based only on file count",
+            "dependency conclusions that ignore the supplied graph evidence",
+        ],
+        output: [
+            "explain the graph shape and why it matters",
+            "call out likely blast radius",
+            "suggest a safe sequencing strategy for later cleanup",
+        ],
+    },
+    {
+        id: "testability",
+        title: "Testability and verification gaps",
+        basis: [
+            "Deepclean native reviewer",
+            "Matt Pocock skills: tdd",
+            "Matt Pocock skills: diagnose",
+        ],
+        purpose: "Find cleanup work that needs tests or seams before agents can safely refactor.",
+        lookFor: [
+            "complex or central files without nearby tests",
+            "logic embedded where it cannot be unit-tested directly",
+            "duplicated behavior with no shared regression test",
+            "clusters whose verification requires both typecheck and targeted tests",
+            "missing fast deterministic feedback loops for risky cleanup",
+            "tests coupled to implementation details rather than public behavior",
+        ],
+        reject: [
+            "generic add-more-tests advice",
+            "test gap claims for files already covered by obvious nearby tests unless evidence says otherwise",
+        ],
+        output: [
+            "state the cleanup risk caused by the missing tests",
+            "propose narrow regression checks",
+            "include practical verification commands",
+        ],
+    },
+    {
+        id: "feedback-loop-discipline",
+        title: "Feedback loop discipline",
+        basis: [
+            "Matt Pocock skills: diagnose",
+            "Matt Pocock skills: tdd",
+            "Matt Pocock skills: tdd/refactoring.md",
+        ],
+        purpose: "Find candidates where cleanup is unsafe until a future agent has a fast, behavior-level pass/fail loop.",
+        lookFor: [
+            "areas where the proposed cleanup needs one failing regression test or tracer-bullet test before refactoring",
+            "bug-prone or high-churn code with no sharp verification command",
+            "test suites that would break on implementation refactors while missing observable behavior",
+            "cleanup candidates that need a minimal harness, CLI invocation, HTTP script, or browser check before changes",
+            "places where duplication, primitive obsession, feature envy, or long methods are only safely addressable after green behavior coverage exists",
+        ],
+        reject: [
+            "generic requests for more tests without naming the behavior and interface",
+            "horizontal-slice plans that write many speculative tests before proving one path works",
+            "verification plans that require manual inspection when an agent-runnable loop is plausible",
+        ],
+        output: [
+            "name the first behavior-level feedback loop a future agent should build",
+            "explain why cleanup is risky without that loop",
+            "prefer one vertical tracer bullet over broad test-suite expansion",
+        ],
+    },
+    {
+        id: "domain-language",
+        title: "Domain language and naming drift",
+        basis: [
+            "Deepclean native reviewer",
+            "Matt Pocock skills: grill-with-docs",
+        ],
+        purpose: "Find places where the code lacks clear names for real concepts, causing sprawl.",
+        lookFor: [
+            "same concept represented by several names across UI, API, and services",
+            "generic names like manager, helper, utils, data, handler, processor hiding domain policy",
+            "business rules spread through technical plumbing instead of named domain modules",
+            "missing glossary or context boundary that would help future agents avoid drift",
+        ],
+        reject: [
+            "pure cosmetic naming preferences",
+            "claims about product semantics not supported by paths, titles, or evidence summaries",
+        ],
+        output: [
+            "name the likely domain concept",
+            "identify where naming drift appears",
+            "suggest what context or module name should be clarified",
+        ],
+    },
+    {
+        id: "agent-ready-slices",
+        title: "Agent-ready cleanup slices",
+        basis: [
+            "Matt Pocock skills: to-issues",
+            "Matt Pocock skills: triage",
+            "Matt Pocock skills: handoff",
+        ],
+        purpose: "Keep synthesis output shaped as independently grabbable cleanup work for coding agents.",
+        lookFor: [
+            "findings that can be turned into a thin vertical slice with clear acceptance criteria",
+            "cleanup work that is AFK-agent ready versus work needing human design judgment",
+            "candidate dependencies that should block or sequence later cleanup plans",
+            "missing agent brief details: established facts, unresolved questions, constraints, verification, and expected output",
+            "themes that should be split because they cross too many modules or require multiple decisions",
+        ],
+        reject: [
+            "broad modernization themes that no agent could complete in one bounded pass",
+            "plans that describe layers to edit instead of end-to-end behavior to preserve",
+            "findings with unresolved product or domain questions presented as ready-to-fix",
+        ],
+        output: [
+            "state whether the candidate is agent-ready or design-needed",
+            "name the narrowest useful slice a future agent can take",
+            "include sequencing and blockers when the cleanup should not start immediately",
+        ],
+    },
+    {
+        id: "ai-slop-patterns",
+        title: "AI-slop cleanup patterns",
+        purpose: "Find code shapes that often result from fast agentic implementation and become expensive later.",
+        lookFor: [
+            "shallow wrappers that do not protect a real boundary",
+            "copy-pasted near-solutions instead of shared policy",
+            "overgrown files that mix fetching, mapping, validation, rendering, and error handling",
+            "adapter layers that mirror implementation details without simplifying callers",
+            "places where a future agent is likely to add another special case instead of improving structure",
+        ],
+        reject: [
+            "vague accusations that code is AI-generated",
+            "style-only complaints",
+            "cleanup suggestions that would be larger than the evidence justifies",
+        ],
+        output: [
+            "describe the slop shape in concrete engineering terms",
+            "explain how it will get worse",
+            "recommend a constrained cleanup direction",
+        ],
+    },
+    {
+        id: "critic-pass",
+        title: "Finding quality critic",
+        purpose: "Reject weak findings and keep only work an agent can act on with evidence.",
+        lookFor: [
+            "candidates supported by multiple evidence types or a strong graph/duplication signal",
+            "clear impact, root cause, and future-agent handoff value",
+            "bounded cleanup work rather than broad modernization",
+        ],
+        reject: [
+            "one-metric findings presented as architectural conclusions",
+            "anything without valid evidence IDs",
+            "claims that require reading source that was not provided",
+            "recommendations to rewrite large areas without a staged verification plan",
+        ],
+        output: [
+            "prefer fewer stronger findings",
+            "downgrade confidence when evidence is thin",
+            "use notes for rejected evidence themes instead of forcing candidates",
+        ],
+    },
+];
+export function buildCleanupSurfaces(evidence, candidates, limit = 12) {
+    const surfaces = new Map();
+    for (const candidate of candidates) {
+        const areas = candidate.files.length > 0
+            ? unique(candidate.files.map((file) => surfaceArea(file.path)))
+            : [`candidate:${candidate.category}`];
+        for (const area of areas) {
+            const surface = getSurface(surfaces, area);
+            surface.candidateIds.add(candidate.id);
+            surface.score += 6;
+            surface.signals.add(`${candidate.priority} ${candidate.category}: ${candidate.title}`);
+            for (const id of candidate.evidenceIds) {
+                surface.evidenceIds.add(id);
+            }
+            for (const file of candidate.files) {
+                addFile(surface, file);
+            }
+            for (const reviewerId of reviewersForCandidate(candidate)) {
+                surface.reviewerIds.add(reviewerId);
+            }
+        }
+    }
+    for (const record of evidence) {
+        const areas = evidenceAreas(record);
+        for (const area of areas) {
+            const surface = getSurface(surfaces, area);
+            surface.evidenceIds.add(record.id);
+            surface.score += scoreEvidence(record);
+            surface.signals.add(`${record.kind}: ${record.title}`);
+            for (const file of record.files) {
+                addFile(surface, file);
+            }
+            for (const reviewerId of reviewersForEvidence(record)) {
+                surface.reviewerIds.add(reviewerId);
+            }
+        }
+    }
+    addGraphDirectorySurfaces(surfaces, evidence);
+    return [...surfaces.values()]
+        .filter((surface) => surface.evidenceIds.size > 0 || surface.candidateIds.size > 0)
+        .sort((a, b) => b.score - a.score || a.key.localeCompare(b.key))
+        .slice(0, limit)
+        .map((surface, index) => ({
+        id: `surface-${String(index + 1).padStart(3, "0")}`,
+        title: surface.title,
+        focus: surface.focus,
+        reviewerIds: [...surface.reviewerIds].sort(),
+        evidenceIds: [...surface.evidenceIds].sort(),
+        candidateIds: [...surface.candidateIds].sort(),
+        files: [...surface.files.values()].slice(0, 12),
+        signals: [...surface.signals].slice(0, 10),
+    }));
+}
+function getSurface(surfaces, key) {
+    const existing = surfaces.get(key);
+    if (existing) {
+        return existing;
+    }
+    const surface = {
+        key,
+        title: `Cleanup surface: ${key}`,
+        focus: `Review ${key} as one maintainability surface, not as isolated files.`,
+        reviewerIds: new Set(["critic-pass"]),
+        evidenceIds: new Set(),
+        candidateIds: new Set(),
+        files: new Map(),
+        signals: new Set(),
+        score: 0,
+    };
+    surfaces.set(key, surface);
+    return surface;
+}
+function addGraphDirectorySurfaces(surfaces, evidence) {
+    for (const record of evidence) {
+        if (record.kind !== "code-graph-summary") {
+            continue;
+        }
+        const directories = arrayOfRecords(record.data["directories"]);
+        const hotspots = arrayOfRecords(record.data["hotspots"]);
+        for (const directory of directories.slice(0, 12)) {
+            const directoryPath = stringValue(directory["path"]);
+            if (!directoryPath) {
+                continue;
+            }
+            const fileCount = numberValue(directory["fileCount"]);
+            const internalEdges = numberValue(directory["internalEdges"]);
+            const incomingEdges = numberValue(directory["incomingEdges"]);
+            const outgoingEdges = numberValue(directory["outgoingEdges"]);
+            const graphScore = fileCount + internalEdges + incomingEdges + outgoingEdges;
+            if (graphScore < 5) {
+                continue;
+            }
+            const surface = getSurface(surfaces, directoryPath);
+            surface.title = `Graph surface: ${directoryPath}`;
+            surface.focus = "Review this directory as a graph-connected cleanup surface.";
+            surface.evidenceIds.add(record.id);
+            surface.reviewerIds.add("dependency-graph");
+            surface.reviewerIds.add("architecture-deepening");
+            surface.reviewerIds.add("deep-module-discipline");
+            surface.score += graphScore;
+            surface.signals.add(`graph: ${fileCount} files, ${internalEdges} internal edges, ${incomingEdges} incoming edges, ${outgoingEdges} outgoing edges`);
+            for (const hotspot of hotspots) {
+                const hotspotPath = stringValue(hotspot["path"]);
+                if (hotspotPath?.startsWith(`${directoryPath}/`)) {
+                    addFile(surface, { path: hotspotPath, startLine: 1, endLine: 1 });
+                }
+            }
+        }
+    }
+}
+function evidenceAreas(record) {
+    const fileAreas = record.files.map((file) => surfaceArea(file.path));
+    if (fileAreas.length > 0) {
+        return unique(fileAreas);
+    }
+    return [record.kind];
+}
+function addFile(surface, file) {
+    const existing = surface.files.get(file.path);
+    if (existing) {
+        const startLine = Math.min(existing.startLine ?? 1, file.startLine ?? 1);
+        const endLine = Math.max(existing.endLine ?? 1, file.endLine ?? 1);
+        surface.files.set(file.path, { path: file.path, startLine, endLine });
+        return;
+    }
+    surface.files.set(file.path, {
+        path: file.path,
+        startLine: file.startLine ?? 1,
+        endLine: file.endLine ?? 1,
+    });
+}
+function reviewersForCandidate(candidate) {
+    switch (candidate.category) {
+        case "architecture":
+            return ["architecture-deepening", "deep-module-discipline", "dependency-graph"];
+        case "complexity":
+            return ["architecture-deepening", "deep-module-discipline", "testability", "feedback-loop-discipline"];
+        case "duplication":
+            return ["duplication-consolidation"];
+        case "testability":
+            return ["testability", "feedback-loop-discipline"];
+        case "ai-slop":
+            return ["ai-slop-patterns", "architecture-deepening", "agent-ready-slices"];
+        case "domain-drift":
+            return ["domain-language", "architecture-deepening"];
+        case "dead-weight":
+            return ["dependency-graph", "ai-slop-patterns", "agent-ready-slices"];
+        case "diagnostic":
+            return ["critic-pass"];
+    }
+}
+function reviewersForEvidence(record) {
+    switch (record.kind) {
+        case "duplicate-cluster":
+            return ["duplication-consolidation"];
+        case "dependency-hotspot":
+        case "code-graph-summary":
+            return ["dependency-graph", "architecture-deepening", "deep-module-discipline"];
+        case "large-file":
+        case "complex-function":
+            return ["architecture-deepening", "deep-module-discipline", "testability", "feedback-loop-discipline"];
+        case "shallow-wrapper-cluster":
+            return ["ai-slop-patterns", "architecture-deepening", "deep-module-discipline"];
+        case "test-gap":
+            return ["testability", "feedback-loop-discipline"];
+        default:
+            return ["critic-pass"];
+    }
+}
+function scoreEvidence(record) {
+    const confidenceScore = record.confidence === "high" ? 5 : record.confidence === "medium" ? 3 : 1;
+    const kindScore = record.kind === "code-graph-summary" ? 4
+        : record.kind === "duplicate-cluster" ? 5
+            : record.kind === "dependency-hotspot" ? 4
+                : 2;
+    return confidenceScore + kindScore;
+}
+function surfaceArea(filePath) {
+    const parts = filePath.split("/").filter(Boolean);
+    if (parts.length === 0) {
+        return ".";
+    }
+    const srcIndex = parts.indexOf("src");
+    if (srcIndex >= 0) {
+        const end = Math.min(parts.length - 1, srcIndex + 3);
+        return parts.slice(0, end).join("/") || (parts[0] ?? ".");
+    }
+    if (parts.length >= 3 && ["backend", "core", "frontend", "admin", "api"].includes(parts[0] ?? "")) {
+        return parts.slice(0, 2).join("/");
+    }
+    if (parts.length <= 2) {
+        return parts.length === 1 ? "." : parts[0] ?? ".";
+    }
+    return parts.slice(0, 2).join("/");
+}
+function unique(values) {
+    return [...new Set(values)];
+}
+function arrayOfRecords(value) {
+    if (!Array.isArray(value)) {
+        return [];
+    }
+    return value.filter(isRecord);
+}
+function isRecord(value) {
+    return typeof value === "object" && value !== null && !Array.isArray(value);
+}
+function stringValue(value) {
+    return typeof value === "string" && value.length > 0 ? value : undefined;
+}
+function numberValue(value) {
+    return typeof value === "number" && Number.isFinite(value) ? value : 0;
+}
+//# sourceMappingURL=reviewers.js.map

package/dist/reviewers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reviewers.js","sourceRoot":"","sources":["../src/reviewers.ts"],"names":[],"mappings":"AAmCA,MAAM,CAAC,MAAM,eAAe,GAAqB;IAC/C;QACE,EAAE,EAAE,wBAAwB;QAC5B,KAAK,EAAE,mCAAmC;QAC1C,KAAK,EAAE;YACL,2BAA2B;YAC3B,mDAAmD;SACpD;QACD,OAAO,EAAE,2FAA2F;QACpG,OAAO,EAAE;YACP,gFAAgF;YAChF,mFAAmF;YACnF,mFAAmF;YACnF,yEAAyE;YACzE,8EAA8E;YAC9E,8EAA8E;YAC9E,8GAA8G;SAC/G;QACD,MAAM,EAAE;YACN,8DAA8D;YAC9D,iEAAiE;YACjE,2BAA2B;SAC5B;QACD,MAAM,EAAE;YACN,mCAAmC;YACnC,uCAAuC;YACvC,6EAA6E;SAC9E;KACF;IACD;QACE,EAAE,EAAE,wBAAwB;QAC5B,KAAK,EAAE,wBAAwB;QAC/B,KAAK,EAAE;YACL,gEAAgE;YAChE,yCAAyC;SAC1C;QACD,OAAO,EAAE,2HAA2H;QACpI,OAAO,EAAE;YACP,uFAAuF;YACvF,iFAAiF;YACjF,qFAAqF;YACrF,0HAA0H;YAC1H,oGAAoG;YACpG,6FAA6F;SAC9F;QACD,MAAM,EAAE;YACN,qGAAqG;YACrG,0EAA0E;YAC1E,6DAA6D;SAC9D;QACD,MAAM,EAAE;YACN,qDAAqD;YACrD,2DAA2D;YAC3D,qFAAqF;SACtF;KACF;IACD;QACE,EAAE,EAAE,2BAA2B;QAC/B,KAAK,EAAE,0CAA0C;QACjD,OAAO,EAAE,0EAA0E;QACnF,OAAO,EAAE;YACP,gEAAgE;YAChE,uFAAuF;YACvF,0EAA0E;YAC1E,mEAAmE;SACpE;QACD,MAAM,EAAE;YACN,4DAA4D;YAC5D,yBAAyB;YACzB,uBAAuB;SACxB;QACD,MAAM,EAAE;YACN,+BAA+B;YAC/B,uDAAuD;YACvD,wEAAwE;SACzE;KACF;IACD;QACE,EAAE,EAAE,kBAAkB;QACtB,KAAK,EAAE,mCAAmC;QAC1C,OAAO,EAAE,+FAA+F;QACxG,OAAO,EAAE;YACP,6CAA6C;YAC7C,8CAA8C;YAC9C,mDAAmD;YACnD,4EAA4E;YAC5E,yFAAyF;SAC1F;QACD,MAAM,EAAE;YACN,yCAAyC;YACzC,gEAAgE;SACjE;QACD,MAAM,EAAE;YACN,4CAA4C;YAC5C,8BAA8B;YAC9B,sDAAsD;SACvD;KACF;IACD;QACE,EAAE,EAAE,aAAa;QACjB,KAAK,EAAE,mCAAmC;QAC1C,KAAK,EAAE;YACL,2BAA2B;YAC3B,yBAAyB;YACzB,8BAA8B;SAC/B;QACD,OAAO,EAAE,gFAAgF;QACzF,OAAO,EAAE;YACP,+CAA+C;YAC/C,wDAAwD;YACxD,oDAAoD;YACpD,wEAAwE;YACxE,6DAA6D;YAC7D,qEAAqE;SACtE;QACD,MAAM,EAAE;YACN,+BAA+B;YAC/B,kGAAkG;SACnG;QACD,MAAM,EAAE;YACN,oDAAoD;YACpD,kCAAkC;YAClC,yCAAyC;SAC1C;KACF;IACD;QACE,EAAE,EAAE,0BAA0B;QAC9B,KAAK,EAAE,0BAA0B;QACjC,KAAK,EAAE;YACL,8BAA8B;YAC9B,yBAAyB;YACzB,wCAAwC;SACzC;QACD,OAAO,EAAE,yGAAyG;QAClH,OAAO,EAAE;YACP,6GAA6G;YAC7G,iEAAiE;YACjE,4FAA4F;YAC5F,8GAA8G;YAC9G,+IAA+I;SAChJ;QACD,MAAM,EAAE;YACN,2EAA2E;YAC3E,wFAAwF;YACxF,4FAA4F;SAC7F;QACD,MAAM,EAAE;YACN,yEAAyE;YACzE,gDAAgD;YAChD,mEAAmE;SACpE;KACF;IACD;QACE,EAAE,EAAE,iBAAiB;QACrB,KAAK,EAAE,kCAAkC;QACzC,KAAK,EAAE;YACL,2BAA2B;YAC3B,qCAAqC;SACtC;QACD,OAAO,EAAE,iFAAiF;QAC1F,OAAO,EAAE;YACP,wEAAwE;YACxE,0FAA0F;YAC1F,kFAAkF;YAClF,gFAAgF;SACjF;QACD,MAAM,EAAE;YACN,kCAAkC;YAClC,sFAAsF;SACvF;QACD,MAAM,EAAE;YACN,gCAAgC;YAChC,qCAAqC;YACrC,yDAAyD;SAC1D;KACF;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,KAAK,EAAE,4BAA4B;QACnC,KAAK,EAAE;YACL,+BAA+B;YAC/B,4BAA4B;YAC5B,6BAA6B;SAC9B;QACD,OAAO,EAAE,yFAAyF;QAClG,OAAO,EAAE;YACP,uFAAuF;YACvF,gFAAgF;YAChF,0EAA0E;YAC1E,sHAAsH;YACtH,+FAA+F;SAChG;QACD,MAAM,EAAE;YACN,6EAA6E;YAC7E,+EAA+E;YAC/E,gFAAgF;SACjF;QACD,MAAM,EAAE;YACN,6DAA6D;YAC7D,yDAAyD;YACzD,+EAA+E;SAChF;KACF;IACD;QACE,EAAE,EAAE,kBAAkB;QACtB,KAAK,EAAE,0BAA0B;QACjC,OAAO,EAAE,iGAAiG;QAC1G,OAAO,EAAE;YACP,sDAAsD;YACtD,qDAAqD;YACrD,uFAAuF;YACvF,+EAA+E;YAC/E,kGAAkG;SACnG;QACD,MAAM,EAAE;YACN,6CAA6C;YAC7C,uBAAuB;YACvB,sEAAsE;SACvE;QACD,MAAM,EAAE;YACN,uDAAuD;YACvD,+BAA+B;YAC/B,2CAA2C;SAC5C;KACF;IACD;QACE,EAAE,EAAE,aAAa;QACjB,KAAK,EAAE,wBAAwB;QAC/B,OAAO,EAAE,4EAA4E;QACrF,OAAO,EAAE;YACP,sFAAsF;YACtF,0DAA0D;YAC1D,sDAAsD;SACvD;QACD,MAAM,EAAE;YACN,4DAA4D;YAC5D,qCAAqC;YACrC,0DAA0D;YAC1D,2EAA2E;SAC5E;QACD,MAAM,EAAE;YACN,gCAAgC;YAChC,4CAA4C;YAC5C,sEAAsE;SACvE;KACF;CACF,CAAC;AAEF,MAAM,UAAU,oBAAoB,CAClC,QAA0B,EAC1B,UAA6B,EAC7B,KAAK,GAAG,EAAE;IAEV,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;IAEjD,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;YACtC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/D,CAAC,CAAC,CAAC,aAAa,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC3C,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACvC,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;YACnB,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,QAAQ,IAAI,SAAS,CAAC,QAAQ,KAAK,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;YACvF,KAAK,MAAM,EAAE,IAAI,SAAS,CAAC,WAAW,EAAE,CAAC;gBACvC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9B,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;gBACnC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YACzB,CAAC;YACD,KAAK,MAAM,UAAU,IAAI,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC1D,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QACpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC3C,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACnC,OAAO,CAAC,KAAK,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;YACvC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;YACvD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBAChC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YACzB,CAAC;YACD,KAAK,MAAM,UAAU,IAAI,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC;gBACtD,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;IACH,CAAC;IAED,yBAAyB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAE9C,OAAO,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;SAC1B,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,IAAI,OAAO,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC;SAClF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SAC/D,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;SACf,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACxB,EAAE,EAAE,WAAW,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;QACnD,KAAK,EAAE,OAAO,CAAC,KAAK;QACpB,KAAK,EAAE,OAAO,CAAC,KAAK;QACpB,WAAW,EAAE,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE;QAC5C,WAAW,EAAE,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE;QAC5C,YAAY,EAAE,CAAC,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC,IAAI,EAAE;QAC9C,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;QAC/C,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;KAC3C,CAAC,CAAC,CAAC;AACR,CAAC;AAED,SAAS,UAAU,CAAC,QAAmC,EAAE,GAAW;IAClE,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,MAAM,OAAO,GAAiB;QAC5B,GAAG;QACH,KAAK,EAAE,oBAAoB,GAAG,EAAE;QAChC,KAAK,EAAE,UAAU,GAAG,yDAAyD;QAC7E,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;QACrC,WAAW,EAAE,IAAI,GAAG,EAAE;QACtB,YAAY,EAAE,IAAI,GAAG,EAAE;QACvB,KAAK,EAAE,IAAI,GAAG,EAAE;QAChB,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,KAAK,EAAE,CAAC;KACT,CAAC;IACF,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAC3B,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,yBAAyB,CAAC,QAAmC,EAAE,QAA0B;IAChG,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,IAAI,MAAM,CAAC,IAAI,KAAK,oBAAoB,EAAE,CAAC;YACzC,SAAS;QACX,CAAC;QACD,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;QAC/D,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QACzD,KAAK,MAAM,SAAS,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YACjD,MAAM,aAAa,GAAG,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;YACrD,IAAI,CAAC,aAAa,EAAE,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,MAAM,SAAS,GAAG,WAAW,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC;YACtD,MAAM,aAAa,GAAG,WAAW,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC,CAAC;YAC9D,MAAM,aAAa,GAAG,WAAW,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC,CAAC;YAC9D,MAAM,aAAa,GAAG,WAAW,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC,CAAC;YAC9D,MAAM,UAAU,GAAG,SAAS,GAAG,aAAa,GAAG,aAAa,GAAG,aAAa,CAAC;YAC7E,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;YACpD,OAAO,CAAC,KAAK,GAAG,kBAAkB,aAAa,EAAE,CAAC;YAClD,OAAO,CAAC,KAAK,GAAG,6DAA6D,CAAC;YAC9E,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACnC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;YAC5C,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;YAClD,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;YAClD,OAAO,CAAC,KAAK,IAAI,UAAU,CAAC;YAC5B,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,SAAS,WAAW,aAAa,oBAAoB,aAAa,oBAAoB,aAAa,iBAAiB,CAAC,CAAC;YACpJ,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,MAAM,WAAW,GAAG,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjD,IAAI,WAAW,EAAE,UAAU,CAAC,GAAG,aAAa,GAAG,CAAC,EAAE,CAAC;oBACjD,OAAO,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;gBACpE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,MAAsB;IAC3C,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACrE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AACvB,CAAC;AAED,SAAS,OAAO,CAAC,OAAqB,EAAE,IAAmB;IACzD,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,IAAI,QAAQ,EAAE,CAAC;QACb,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC;QACzE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;QACnE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC;QACtE,OAAO;IACT,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;QAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,CAAC;QAC9B,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,CAAC;KAC3B,CAAC,CAAC;AACL,CAAC;AAED,SAAS,qBAAqB,CAAC,SAA0B;IACvD,QAAQ,SAAS,CAAC,QAAQ,EAAE,CAAC;QAC3B,KAAK,cAAc;YACjB,OAAO,CAAC,wBAAwB,EAAE,wBAAwB,EAAE,kBAAkB,CAAC,CAAC;QAClF,KAAK,YAAY;YACf,OAAO,CAAC,wBAAwB,EAAE,wBAAwB,EAAE,aAAa,EAAE,0BAA0B,CAAC,CAAC;QACzG,KAAK,aAAa;YAChB,OAAO,CAAC,2BAA2B,CAAC,CAAC;QACvC,KAAK,aAAa;YAChB,OAAO,CAAC,aAAa,EAAE,0BAA0B,CAAC,CAAC;QACrD,KAAK,SAAS;YACZ,OAAO,CAAC,kBAAkB,EAAE,wBAAwB,EAAE,oBAAoB,CAAC,CAAC;QAC9E,KAAK,cAAc;YACjB,OAAO,CAAC,iBAAiB,EAAE,wBAAwB,CAAC,CAAC;QACvD,KAAK,aAAa;YAChB,OAAO,CAAC,kBAAkB,EAAE,kBAAkB,EAAE,oBAAoB,CAAC,CAAC;QACxE,KAAK,YAAY;YACf,OAAO,CAAC,aAAa,CAAC,CAAC;IAC3B,CAAC;AACH,CAAC;AAED,SAAS,oBAAoB,CAAC,MAAsB;IAClD,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,mBAAmB;YACtB,OAAO,CAAC,2BAA2B,CAAC,CAAC;QACvC,KAAK,oBAAoB,CAAC;QAC1B,KAAK,oBAAoB;YACvB,OAAO,CAAC,kBAAkB,EAAE,wBAAwB,EAAE,wBAAwB,CAAC,CAAC;QAClF,KAAK,YAAY,CAAC;QAClB,KAAK,kBAAkB;YACrB,OAAO,CAAC,wBAAwB,EAAE,wBAAwB,EAAE,aAAa,EAAE,0BAA0B,CAAC,CAAC;QACzG,KAAK,yBAAyB;YAC5B,OAAO,CAAC,kBAAkB,EAAE,wBAAwB,EAAE,wBAAwB,CAAC,CAAC;QAClF,KAAK,UAAU;YACb,OAAO,CAAC,aAAa,EAAE,0BAA0B,CAAC,CAAC;QACrD;YACE,OAAO,CAAC,aAAa,CAAC,CAAC;IAC3B,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,MAAsB;IAC3C,MAAM,eAAe,GAAG,MAAM,CAAC,UAAU,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClG,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,KAAK,oBAAoB,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,mBAAmB,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,oBAAoB,CAAC,CAAC,CAAC,CAAC;gBACxC,CAAC,CAAC,CAAC,CAAC;IACV,OAAO,eAAe,GAAG,SAAS,CAAC;AACrC,CAAC;AAED,SAAS,WAAW,CAAC,QAAgB;IACnC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAClD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,GAAG,CAAC;IACb,CAAC;IACD,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;QACrD,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;IAC5D,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;QAClG,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;IACpD,CAAC;IACD,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,MAAM,CAAC,MAAgB;IAC9B,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,cAAc,CAAC,KAAc;IACpC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AAChC,CAAC;AAED,SAAS,QAAQ,CAAC,KAAc;IAC9B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC;AAED,SAAS,WAAW,CAAC,KAAc;IACjC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;AAC3E,CAAC;AAED,SAAS,WAAW,CAAC,KAAc;IACjC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACzE,CAAC"}

package/dist/state.d.ts

@@ -0,0 +1,41 @@
+import { type CandidateRecord, type ClusterRecord, type DeepcleanConfig, type EvidenceRecord, type HandoffRecord, type PlanRecord, type ReportRecord, type RunRecord, type TriageRecord } from "./types.js";
+export interface StatePaths {
+    root: string;
+    stateDir: string;
+    configPath: string;
+    runsDir: string;
+    evidenceDir: string;
+    candidatesDir: string;
+    clustersDir: string;
+    reportsDir: string;
+    triageDir: string;
+    handoffsDir: string;
+    plansDir: string;
+}
+export declare function resolveStatePaths(options: {
+    cwd: string;
+    root?: string | undefined;
+    stateDir?: string | undefined;
+    config?: string | undefined;
+}): StatePaths;
+export declare function ensureState(paths: StatePaths): Promise<DeepcleanConfig>;
+export declare function readConfig(paths: StatePaths): Promise<DeepcleanConfig>;
+export declare function writeRun(paths: StatePaths, run: RunRecord): Promise<string>;
+export declare function writeEvidence(paths: StatePaths, runId: string, records: EvidenceRecord[]): Promise<string>;
+export declare function writeCandidates(paths: StatePaths, runId: string, records: CandidateRecord[]): Promise<string>;
+export declare function writeReport(paths: StatePaths, report: ReportRecord, markdown: string): Promise<{
+    jsonPath: string;
+    markdownPath: string;
+}>;
+export declare function writeClusters(paths: StatePaths, runId: string, records: ClusterRecord[]): Promise<string>;
+export declare function writeTriage(paths: StatePaths, triage: TriageRecord): Promise<string>;
+export declare function writeHandoff(paths: StatePaths, handoff: HandoffRecord): Promise<string>;
+export declare function writePlan(paths: StatePaths, plan: PlanRecord): Promise<string>;
+export declare function latestRunId(paths: StatePaths): Promise<string | undefined>;
+export declare function readLatestCandidates(paths: StatePaths): Promise<CandidateRecord[]>;
+export declare function readLatestClusters(paths: StatePaths): Promise<ClusterRecord[]>;
+export declare function readLatestEvidence(paths: StatePaths): Promise<EvidenceRecord[]>;
+export declare function readClusters(paths: StatePaths, runId: string): Promise<ClusterRecord[]>;
+export declare function readCandidates(paths: StatePaths, runId: string): Promise<CandidateRecord[]>;
+export declare function readEvidence(paths: StatePaths, runId: string): Promise<EvidenceRecord[]>;
+export declare function updateLatestCandidates(paths: StatePaths, candidates: CandidateRecord[]): Promise<string>;