@promptwheel/cli 0.6.0

package/dist/lib/run-state.js

@@ -0,0 +1,312 @@
+/**
+ * Persistent run state for cross-session cycle tracking.
+ *
+ * Stored in `.promptwheel/run-state.json`. Tracks how many scout cycles
+ * have run so periodic tasks (like docs-audit) can trigger automatically.
+ */
+import * as fs from 'node:fs';
+import * as path from 'node:path';
+const RUN_STATE_FILE = 'run-state.json';
+function statePath(repoRoot) {
+    return path.join(repoRoot, '.promptwheel', RUN_STATE_FILE);
+}
+// ── Async mutex to prevent concurrent read-modify-write races ───────────
+// During parallel ticket execution, multiple recordX functions may fire
+// concurrently. Without serialisation the second reader can snapshot stale
+// state before the first writer flushes, silently dropping data.
+//
+// The lock is intentionally per-process (module-level). File-level locking
+// (e.g. flock) is unnecessary because all callers live in the same Node
+// process; a simple promise-chain mutex is sufficient and zero-dep.
+let _writeLock = Promise.resolve();
+function withRunStateLock(fn) {
+    const prev = _writeLock;
+    let release;
+    _writeLock = new Promise((r) => { release = r; });
+    return prev.then(fn).finally(() => release());
+}
+const DEFAULT_STATE = {
+    totalCycles: 0,
+    lastDocsAuditCycle: 0,
+    lastRunAt: 0,
+    deferredProposals: [],
+    formulaStats: {},
+    recentCycles: [],
+    recentDiffs: [],
+};
+/**
+ * Read the current run state from disk.
+ */
+export function readRunState(repoRoot) {
+    const fp = statePath(repoRoot);
+    if (!fs.existsSync(fp))
+        return { ...DEFAULT_STATE };
+    try {
+        const raw = fs.readFileSync(fp, 'utf-8');
+        const parsed = JSON.parse(raw);
+        return {
+            totalCycles: parsed.totalCycles ?? 0,
+            lastDocsAuditCycle: parsed.lastDocsAuditCycle ?? 0,
+            lastRunAt: parsed.lastRunAt ?? 0,
+            deferredProposals: Array.isArray(parsed.deferredProposals) ? parsed.deferredProposals : [],
+            recentCycles: Array.isArray(parsed.recentCycles) ? parsed.recentCycles : [],
+            recentDiffs: Array.isArray(parsed.recentDiffs) ? parsed.recentDiffs : [],
+            qualitySignals: parsed.qualitySignals ?? undefined,
+            formulaStats: (() => {
+                const statsRaw = parsed.formulaStats ?? {};
+                for (const key of Object.keys(statsRaw)) {
+                    const e = statsRaw[key];
+                    e.recentCycles ??= 0;
+                    e.recentProposalsGenerated ??= 0;
+                    e.recentTicketsSucceeded ??= 0;
+                    e.recentTicketsTotal ??= 0;
+                    e.lastResetCycle ??= 0;
+                    e.mergeCount ??= 0;
+                    e.closedCount ??= 0;
+                }
+                return statsRaw;
+            })(),
+        };
+    }
+    catch {
+        return { ...DEFAULT_STATE };
+    }
+}
+/**
+ * Write the run state to disk.
+ */
+export function writeRunState(repoRoot, state) {
+    const fp = statePath(repoRoot);
+    const dir = path.dirname(fp);
+    if (!fs.existsSync(dir)) {
+        fs.mkdirSync(dir, { recursive: true });
+    }
+    const tmp = fp + '.tmp';
+    fs.writeFileSync(tmp, JSON.stringify(state, null, 2) + '\n');
+    fs.renameSync(tmp, fp);
+}
+/**
+ * Increment the cycle counter and return the new state.
+ *
+ * This function remains synchronous because callers use its return value
+ * directly (e.g. `updatedRunState.totalCycles`). It is only called from
+ * the sequential post-cycle path, never from parallel ticket execution,
+ * so it does not need the async mutex.
+ */
+export function recordCycle(repoRoot) {
+    const state = readRunState(repoRoot);
+    state.totalCycles += 1;
+    state.lastRunAt = Date.now();
+    writeRunState(repoRoot, state);
+    return state;
+}
+/**
+ * Check if a docs-audit cycle is due.
+ * Returns true every N cycles since the last docs-audit.
+ */
+export function isDocsAuditDue(repoRoot, interval = 3) {
+    const state = readRunState(repoRoot);
+    return (state.totalCycles - state.lastDocsAuditCycle) >= interval;
+}
+/**
+ * Record that a docs-audit was run.
+ */
+export function recordDocsAudit(repoRoot) {
+    return withRunStateLock(() => {
+        const state = readRunState(repoRoot);
+        state.lastDocsAuditCycle = state.totalCycles;
+        writeRunState(repoRoot, state);
+    });
+}
+/**
+ * Record that a formula was used and produced N proposals.
+ */
+export function recordFormulaResult(repoRoot, formulaName, proposalCount) {
+    return withRunStateLock(() => {
+        const state = readRunState(repoRoot);
+        const entry = state.formulaStats[formulaName] ??= { cycles: 0, proposalsGenerated: 0, ticketsSucceeded: 0, ticketsTotal: 0, recentCycles: 0, recentProposalsGenerated: 0, recentTicketsSucceeded: 0, recentTicketsTotal: 0, lastResetCycle: 0 };
+        entry.cycles++;
+        entry.proposalsGenerated += proposalCount;
+        entry.recentCycles++;
+        entry.recentProposalsGenerated += proposalCount;
+        if (state.totalCycles - entry.lastResetCycle >= 20) {
+            entry.recentCycles = 1;
+            entry.recentProposalsGenerated = proposalCount;
+            entry.recentTicketsSucceeded = 0;
+            entry.recentTicketsTotal = 0;
+            entry.lastResetCycle = state.totalCycles;
+        }
+        writeRunState(repoRoot, state);
+    });
+}
+/**
+ * Record a ticket success/failure for the formula that produced it.
+ */
+export function recordFormulaTicketOutcome(repoRoot, formulaName, success) {
+    return withRunStateLock(() => {
+        const state = readRunState(repoRoot);
+        const entry = state.formulaStats[formulaName] ??= { cycles: 0, proposalsGenerated: 0, ticketsSucceeded: 0, ticketsTotal: 0, recentCycles: 0, recentProposalsGenerated: 0, recentTicketsSucceeded: 0, recentTicketsTotal: 0, lastResetCycle: 0 };
+        entry.ticketsTotal++;
+        entry.recentTicketsTotal++;
+        if (success) {
+            entry.ticketsSucceeded++;
+            entry.recentTicketsSucceeded++;
+        }
+        writeRunState(repoRoot, state);
+    });
+}
+/** Max age for deferred proposals (7 days) */
+const MAX_DEFERRED_AGE_MS = 7 * 24 * 60 * 60 * 1000;
+/** Promote out-of-scope proposals after ~2 full cycles */
+const PROMOTION_AGE_MS = 2 * 60 * 60 * 1000;
+/**
+ * Defer a proposal for later when the scope matches.
+ */
+export function deferProposal(repoRoot, proposal) {
+    return withRunStateLock(() => {
+        const state = readRunState(repoRoot);
+        // Avoid duplicates by title
+        if (state.deferredProposals.some(d => d.title === proposal.title))
+            return;
+        // File-overlap dedup: if an existing deferred proposal targets the same
+        // primary files, replace it (fresher description, updated timestamp).
+        const proposalFiles = new Set(proposal.allowed_paths);
+        if (proposalFiles.size > 0) {
+            const overlapIdx = state.deferredProposals.findIndex(d => {
+                const existingFiles = new Set(d.allowed_paths);
+                if (existingFiles.size === 0 || proposalFiles.size === 0)
+                    return false;
+                if (existingFiles.size !== proposalFiles.size)
+                    return false;
+                for (const f of proposalFiles) {
+                    if (!existingFiles.has(f))
+                        return false;
+                }
+                return true;
+            });
+            if (overlapIdx !== -1) {
+                state.deferredProposals[overlapIdx] = proposal;
+                writeRunState(repoRoot, state);
+                return;
+            }
+        }
+        state.deferredProposals.push(proposal);
+        writeRunState(repoRoot, state);
+    });
+}
+/**
+ * Retrieve and remove deferred proposals that now match the given scope.
+ * Also prunes proposals older than 7 days.
+ *
+ * This function remains synchronous because callers use its return value
+ * directly (e.g. `deferred.length`). It is only called from the sequential
+ * scout/filter path, never from parallel ticket execution.
+ */
+export function popDeferredForScope(repoRoot, scope) {
+    const state = readRunState(repoRoot);
+    const now = Date.now();
+    const normalizedScope = scope.replace(/\*\*$/, '').replace(/\*$/, '').replace(/\/$/, '');
+    const matched = [];
+    let remaining = [];
+    for (const dp of state.deferredProposals) {
+        // Prune stale
+        if (now - dp.deferredAt > MAX_DEFERRED_AGE_MS)
+            continue;
+        const files = dp.files.length > 0 ? dp.files : dp.allowed_paths;
+        const inScope = !normalizedScope || files.length === 0 || files.every(f => f.startsWith(normalizedScope) || f.startsWith(normalizedScope + '/'));
+        if (inScope) {
+            matched.push(dp);
+        }
+        else {
+            remaining.push(dp);
+        }
+    }
+    // Promote stale out-of-scope proposals: if a proposal has survived 2+
+    // full cycle durations it will never find a matching scope — promote it
+    // to the current cycle rather than letting it sit until the 7-day prune.
+    const stillRemaining = [];
+    for (const dp of remaining) {
+        if (now - dp.deferredAt > PROMOTION_AGE_MS) {
+            matched.push(dp);
+        }
+        else {
+            stillRemaining.push(dp);
+        }
+    }
+    remaining = stillRemaining;
+    if (matched.length > 0 || remaining.length !== state.deferredProposals.length) {
+        state.deferredProposals = remaining;
+        writeRunState(repoRoot, state);
+    }
+    return matched;
+}
+/**
+ * Record a formula merge/close outcome for PR merge signal tracking.
+ */
+export function recordFormulaMergeOutcome(projectRoot, formula, merged) {
+    return withRunStateLock(() => {
+        const state = readRunState(projectRoot);
+        const entry = state.formulaStats[formula] ??= { cycles: 0, proposalsGenerated: 0, ticketsSucceeded: 0, ticketsTotal: 0, recentCycles: 0, recentProposalsGenerated: 0, recentTicketsSucceeded: 0, recentTicketsTotal: 0, lastResetCycle: 0, mergeCount: 0, closedCount: 0 };
+        if (merged) {
+            entry.mergeCount = (entry.mergeCount ?? 0) + 1;
+        }
+        else {
+            entry.closedCount = (entry.closedCount ?? 0) + 1;
+        }
+        writeRunState(projectRoot, state);
+    });
+}
+/** Max recent diffs to keep (ring buffer) */
+const MAX_RECENT_DIFFS = 10;
+/**
+ * Push a diff summary to recentDiffs ring buffer.
+ */
+export function pushRecentDiff(projectRoot, diff) {
+    return withRunStateLock(() => {
+        const state = readRunState(projectRoot);
+        const diffs = state.recentDiffs ?? [];
+        diffs.push(diff);
+        if (diffs.length > MAX_RECENT_DIFFS) {
+            diffs.splice(0, diffs.length - MAX_RECENT_DIFFS);
+        }
+        state.recentDiffs = diffs;
+        writeRunState(projectRoot, state);
+    });
+}
+/**
+ * Record an execution quality signal.
+ */
+export function recordQualitySignal(projectRoot, signal) {
+    return withRunStateLock(() => {
+        const state = readRunState(projectRoot);
+        const qs = state.qualitySignals ??= { totalTickets: 0, firstPassSuccess: 0, retriedSuccess: 0, qaPassed: 0, qaFailed: 0 };
+        switch (signal) {
+            case 'first_pass':
+                qs.totalTickets++;
+                qs.firstPassSuccess++;
+                break;
+            case 'retried':
+                qs.totalTickets++;
+                qs.retriedSuccess++;
+                break;
+            case 'qa_pass':
+                qs.qaPassed++;
+                break;
+            case 'qa_fail':
+                qs.qaFailed++;
+                break;
+        }
+        writeRunState(projectRoot, state);
+    });
+}
+/**
+ * Get the first-pass success rate (0-1). Returns 1 if no data.
+ */
+export function getQualityRate(projectRoot) {
+    const state = readRunState(projectRoot);
+    const qs = state.qualitySignals;
+    if (!qs || qs.totalTickets === 0)
+        return 1;
+    return qs.firstPassSuccess / qs.totalTickets;
+}
+//# sourceMappingURL=run-state.js.map

package/dist/lib/run-state.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"run-state.js","sourceRoot":"","sources":["../../src/lib/run-state.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAsDlC,MAAM,cAAc,GAAG,gBAAgB,CAAC;AAExC,SAAS,SAAS,CAAC,QAAgB;IACjC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;AAC7D,CAAC;AAED,2EAA2E;AAC3E,wEAAwE;AACxE,2EAA2E;AAC3E,iEAAiE;AACjE,EAAE;AACF,2EAA2E;AAC3E,wEAAwE;AACxE,oEAAoE;AACpE,IAAI,UAAU,GAAkB,OAAO,CAAC,OAAO,EAAE,CAAC;AAElD,SAAS,gBAAgB,CAAI,EAAW;IACtC,MAAM,IAAI,GAAG,UAAU,CAAC;IACxB,IAAI,OAAoB,CAAC;IACzB,UAAU,GAAG,IAAI,OAAO,CAAO,CAAC,CAAC,EAAE,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;AAChD,CAAC;AAED,MAAM,aAAa,GAAa;IAC9B,WAAW,EAAE,CAAC;IACd,kBAAkB,EAAE,CAAC;IACrB,SAAS,EAAE,CAAC;IACZ,iBAAiB,EAAE,EAAE;IACrB,YAAY,EAAE,EAAE;IAChB,YAAY,EAAE,EAAE;IAChB,WAAW,EAAE,EAAE;CAChB,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB;IAC3C,MAAM,EAAE,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC/B,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC;QAAE,OAAO,EAAE,GAAG,aAAa,EAAE,CAAC;IAEpD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC/B,OAAO;YACL,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,CAAC;YACpC,kBAAkB,EAAE,MAAM,CAAC,kBAAkB,IAAI,CAAC;YAClD,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,CAAC;YAChC,iBAAiB,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE;YAC1F,YAAY,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YAC3E,WAAW,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE;YACxE,cAAc,EAAE,MAAM,CAAC,cAAc,IAAI,SAAS;YAClD,YAAY,EAAE,CAAC,GAAG,EAAE;gBAClB,MAAM,QAAQ,GAAG,MAAM,CAAC,YAAY,IAAI,EAAE,CAAC;gBAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACxC,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;oBACxB,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC;oBACrB,CAAC,CAAC,wBAAwB,KAAK,CAAC,CAAC;oBACjC,CAAC,CAAC,sBAAsB,KAAK,CAAC,CAAC;oBAC/B,CAAC,CAAC,kBAAkB,KAAK,CAAC,CAAC;oBAC3B,CAAC,CAAC,cAAc,KAAK,CAAC,CAAC;oBACvB,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC;oBACnB,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC;gBACtB,CAAC;gBACD,OAAO,QAAQ,CAAC;YAClB,CAAC,CAAC,EAAE;SACL,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,GAAG,aAAa,EAAE,CAAC;IAC9B,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,QAAgB,EAAE,KAAe;IAC7D,MAAM,EAAE,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7B,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACzC,CAAC;IACD,MAAM,GAAG,GAAG,EAAE,GAAG,MAAM,CAAC;IACxB,EAAE,CAAC,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAC7D,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;AACzB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,QAAgB;IAC1C,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IACrC,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;IACvB,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,QAAgB,EAAE,WAAmB,CAAC;IACnE,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IACrC,OAAO,CAAC,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,kBAAkB,CAAC,IAAI,QAAQ,CAAC;AACpE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,QAAgB;IAC9C,OAAO,gBAAgB,CAAC,GAAG,EAAE;QAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QACrC,KAAK,CAAC,kBAAkB,GAAG,KAAK,CAAC,WAAW,CAAC;QAC7C,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAAgB,EAAE,WAAmB,EAAE,aAAqB;IAC9F,OAAO,gBAAgB,CAAC,GAAG,EAAE;QAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,wBAAwB,EAAE,CAAC,EAAE,sBAAsB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC;QAChP,KAAK,CAAC,MAAM,EAAE,CAAC;QACf,KAAK,CAAC,kBAAkB,IAAI,aAAa,CAAC;QAC1C,KAAK,CAAC,YAAY,EAAE,CAAC;QACrB,KAAK,CAAC,wBAAwB,IAAI,aAAa,CAAC;QAChD,IAAI,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,cAAc,IAAI,EAAE,EAAE,CAAC;YACnD,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC;YACvB,KAAK,CAAC,wBAAwB,GAAG,aAAa,CAAC;YAC/C,KAAK,CAAC,sBAAsB,GAAG,CAAC,CAAC;YACjC,KAAK,CAAC,kBAAkB,GAAG,CAAC,CAAC;YAC7B,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,WAAW,CAAC;QAC3C,CAAC;QACD,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,0BAA0B,CAAC,QAAgB,EAAE,WAAmB,EAAE,OAAgB;IAChG,OAAO,gBAAgB,CAAC,GAAG,EAAE;QAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,wBAAwB,EAAE,CAAC,EAAE,sBAAsB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC;QAChP,KAAK,CAAC,YAAY,EAAE,CAAC;QACrB,KAAK,CAAC,kBAAkB,EAAE,CAAC;QAC3B,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,CAAC,gBAAgB,EAAE,CAAC;YACzB,KAAK,CAAC,sBAAsB,EAAE,CAAC;QACjC,CAAC;QACD,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,8CAA8C;AAC9C,MAAM,mBAAmB,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAEpD,0DAA0D;AAC1D,MAAM,gBAAgB,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAE5C;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,QAAgB,EAAE,QAA0B;IACxE,OAAO,gBAAgB,CAAC,GAAG,EAAE;QAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QAErC,4BAA4B;QAC5B,IAAI,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK,CAAC;YAAE,OAAO;QAE1E,wEAAwE;QACxE,sEAAsE;QACtE,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QACtD,IAAI,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,UAAU,GAAG,KAAK,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;gBACvD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;gBAC/C,IAAI,aAAa,CAAC,IAAI,KAAK,CAAC,IAAI,aAAa,CAAC,IAAI,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACvE,IAAI,aAAa,CAAC,IAAI,KAAK,aAAa,CAAC,IAAI;oBAAE,OAAO,KAAK,CAAC;gBAC5D,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;oBAC9B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;gBAC1C,CAAC;gBACD,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,CAAC;YACH,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;gBACtB,KAAK,CAAC,iBAAiB,CAAC,UAAU,CAAC,GAAG,QAAQ,CAAC;gBAC/C,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;gBAC/B,OAAO;YACT,CAAC;QACH,CAAC;QAED,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvC,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAAgB,EAAE,KAAa;IACjE,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;IACrC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,eAAe,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAEzF,MAAM,OAAO,GAAuB,EAAE,CAAC;IACvC,IAAI,SAAS,GAAuB,EAAE,CAAC;IAEvC,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;QACzC,cAAc;QACd,IAAI,GAAG,GAAG,EAAE,CAAC,UAAU,GAAG,mBAAmB;YAAE,SAAS;QAExD,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC;QAChE,MAAM,OAAO,GAAG,CAAC,eAAe,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CACxE,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,eAAe,GAAG,GAAG,CAAC,CACrE,CAAC;QAEF,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,wEAAwE;IACxE,yEAAyE;IACzE,MAAM,cAAc,GAAuB,EAAE,CAAC;IAC9C,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,IAAI,GAAG,GAAG,EAAE,CAAC,UAAU,GAAG,gBAAgB,EAAE,CAAC;YAC3C,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,SAAS,GAAG,cAAc,CAAC;IAE3B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,KAAK,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC;QAC9E,KAAK,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACpC,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CAAC,WAAmB,EAAE,OAAe,EAAE,MAAe;IAC7F,OAAO,gBAAgB,CAAC,GAAG,EAAE;QAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,wBAAwB,EAAE,CAAC,EAAE,sBAAsB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;QAC3Q,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,CAAC,UAAU,GAAG,CAAC,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,WAAW,GAAG,CAAC,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnD,CAAC;QACD,aAAa,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,6CAA6C;AAC7C,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAE5B;;GAEG;AACH,MAAM,UAAU,cAAc,CAC5B,WAAmB,EACnB,IAAwE;IAExE,OAAO,gBAAgB,CAAC,GAAG,EAAE;QAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,IAAI,EAAE,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,IAAI,KAAK,CAAC,MAAM,GAAG,gBAAgB,EAAE,CAAC;YACpC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,gBAAgB,CAAC,CAAC;QACnD,CAAC;QACD,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC;QAC1B,aAAa,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,WAAmB,EAAE,MAAwD;IAC/G,OAAO,gBAAgB,CAAC,GAAG,EAAE;QAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,KAAK,CAAC,cAAc,KAAK,EAAE,YAAY,EAAE,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;QAC1H,QAAQ,MAAM,EAAE,CAAC;YACf,KAAK,YAAY;gBAAE,EAAE,CAAC,YAAY,EAAE,CAAC;gBAAC,EAAE,CAAC,gBAAgB,EAAE,CAAC;gBAAC,MAAM;YACnE,KAAK,SAAS;gBAAE,EAAE,CAAC,YAAY,EAAE,CAAC;gBAAC,EAAE,CAAC,cAAc,EAAE,CAAC;gBAAC,MAAM;YAC9D,KAAK,SAAS;gBAAE,EAAE,CAAC,QAAQ,EAAE,CAAC;gBAAC,MAAM;YACrC,KAAK,SAAS;gBAAE,EAAE,CAAC,QAAQ,EAAE,CAAC;gBAAC,MAAM;QACvC,CAAC;QACD,aAAa,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,WAAmB;IAChD,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC;IACxC,MAAM,EAAE,GAAG,KAAK,CAAC,cAAc,CAAC;IAChC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,YAAY,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,OAAO,EAAE,CAAC,gBAAgB,GAAG,EAAE,CAAC,YAAY,CAAC;AAC/C,CAAC"}

package/dist/lib/scope.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Scope enforcement utilities
+ *
+ * Pure algorithms live in @promptwheel/core/scope/shared.
+ * This file re-exports them for CLI consumers.
+ */
+export { normalizePath, detectHallucinatedPath, checkScopeViolations, matchesPattern, analyzeViolationsForExpansion, parseChangedFiles, type ScopeViolation, type ScopeExpansionResult, } from '@promptwheel/core/scope/shared';
+//# sourceMappingURL=scope.d.ts.map

package/dist/lib/scope.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.d.ts","sourceRoot":"","sources":["../../src/lib/scope.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,aAAa,EACb,sBAAsB,EACtB,oBAAoB,EACpB,cAAc,EACd,6BAA6B,EAC7B,iBAAiB,EACjB,KAAK,cAAc,EACnB,KAAK,oBAAoB,GAC1B,MAAM,gCAAgC,CAAC"}

package/dist/lib/scope.js

@@ -0,0 +1,8 @@
+/**
+ * Scope enforcement utilities
+ *
+ * Pure algorithms live in @promptwheel/core/scope/shared.
+ * This file re-exports them for CLI consumers.
+ */
+export { normalizePath, detectHallucinatedPath, checkScopeViolations, matchesPattern, analyzeViolationsForExpansion, parseChangedFiles, } from '@promptwheel/core/scope/shared';
+//# sourceMappingURL=scope.js.map

package/dist/lib/scope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.js","sourceRoot":"","sources":["../../src/lib/scope.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,aAAa,EACb,sBAAsB,EACtB,oBAAoB,EACpB,cAAc,EACd,6BAA6B,EAC7B,iBAAiB,GAGlB,MAAM,gCAAgC,CAAC"}

package/dist/lib/scout-prompt-builder.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Fluent builder for scout prompt assembly.
+ * Replaces manual string concatenation with ordered, named blocks.
+ */
+export declare class ScoutPromptBuilder {
+    private blocks;
+    addGuidelines(content: string): this;
+    addMetadata(content: string): this;
+    addTasteProfile(content: string): this;
+    addGoalContext(content: string): this;
+    addTrajectoryContext(content: string): this;
+    addCodebaseIndex(content: string): this;
+    addDedupMemory(content: string): this;
+    addCycleContext(content: string): this;
+    addBaselineHealth(content: string): this;
+    addEscalation(content: string): this;
+    addLearnings(content: string): this;
+    addFormulaPrompt(content: string): this;
+    addHints(content: string): this;
+    build(): string | undefined;
+}
+//# sourceMappingURL=scout-prompt-builder.d.ts.map

package/dist/lib/scout-prompt-builder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scout-prompt-builder.d.ts","sourceRoot":"","sources":["../../src/lib/scout-prompt-builder.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAoBH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,MAAM,CAA+B;IAE7C,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAKpC,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAKlC,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAKtC,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAKrC,oBAAoB,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAK3C,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAKvC,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAKrC,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAKtC,iBAAiB,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAKxC,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAKpC,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAKnC,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAKvC,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAK/B,KAAK,IAAI,MAAM,GAAG,SAAS;CAQ5B"}

package/dist/lib/scout-prompt-builder.js

@@ -0,0 +1,97 @@
+/**
+ * Fluent builder for scout prompt assembly.
+ * Replaces manual string concatenation with ordered, named blocks.
+ */
+const BLOCK_ORDER = [
+    'guidelines',
+    'metadata',
+    'taste',
+    'goal',
+    'trajectory',
+    'index',
+    'dedup',
+    'cycle',
+    'baselineHealth',
+    'escalation',
+    'learnings',
+    'formula',
+    'hints',
+];
+export class ScoutPromptBuilder {
+    blocks = new Map();
+    addGuidelines(content) {
+        if (content)
+            this.blocks.set('guidelines', content);
+        return this;
+    }
+    addMetadata(content) {
+        if (content)
+            this.blocks.set('metadata', content);
+        return this;
+    }
+    addTasteProfile(content) {
+        if (content)
+            this.blocks.set('taste', content);
+        return this;
+    }
+    addGoalContext(content) {
+        if (content)
+            this.blocks.set('goal', content);
+        return this;
+    }
+    addTrajectoryContext(content) {
+        if (content)
+            this.blocks.set('trajectory', content);
+        return this;
+    }
+    addCodebaseIndex(content) {
+        if (content)
+            this.blocks.set('index', content);
+        return this;
+    }
+    addDedupMemory(content) {
+        if (content)
+            this.blocks.set('dedup', content);
+        return this;
+    }
+    addCycleContext(content) {
+        if (content)
+            this.blocks.set('cycle', content);
+        return this;
+    }
+    addBaselineHealth(content) {
+        if (content)
+            this.blocks.set('baselineHealth', content);
+        return this;
+    }
+    addEscalation(content) {
+        if (content)
+            this.blocks.set('escalation', content);
+        return this;
+    }
+    addLearnings(content) {
+        if (content)
+            this.blocks.set('learnings', content);
+        return this;
+    }
+    addFormulaPrompt(content) {
+        if (content)
+            this.blocks.set('formula', content);
+        return this;
+    }
+    addHints(content) {
+        if (content)
+            this.blocks.set('hints', content);
+        return this;
+    }
+    build() {
+        const parts = [];
+        for (const key of BLOCK_ORDER) {
+            const block = this.blocks.get(key);
+            if (block)
+                parts.push(block);
+        }
+        return parts.length > 0 ? parts.join('\n\n') : undefined;
+    }
+}
+//# sourceMappingURL=scout-prompt-builder.js.map

package/dist/lib/scout-prompt-builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scout-prompt-builder.js","sourceRoot":"","sources":["../../src/lib/scout-prompt-builder.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,WAAW,GAAG;IAClB,YAAY;IACZ,UAAU;IACV,OAAO;IACP,MAAM;IACN,YAAY;IACZ,OAAO;IACP,OAAO;IACP,OAAO;IACP,gBAAgB;IAChB,YAAY;IACZ,WAAW;IACX,SAAS;IACT,OAAO;CACC,CAAC;AAIX,MAAM,OAAO,kBAAkB;IACrB,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE7C,aAAa,CAAC,OAAe;QAC3B,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,WAAW,CAAC,OAAe;QACzB,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,eAAe,CAAC,OAAe;QAC7B,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,cAAc,CAAC,OAAe;QAC5B,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oBAAoB,CAAC,OAAe;QAClC,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gBAAgB,CAAC,OAAe;QAC9B,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,cAAc,CAAC,OAAe;QAC5B,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,eAAe,CAAC,OAAe;QAC7B,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,iBAAiB,CAAC,OAAe;QAC/B,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,gBAAgB,EAAE,OAAO,CAAC,CAAC;QACxD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,aAAa,CAAC,OAAe;QAC3B,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,YAAY,CAAC,OAAe;QAC1B,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gBAAgB,CAAC,OAAe;QAC9B,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,QAAQ,CAAC,OAAe;QACtB,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK;QACH,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC3D,CAAC;CACF"}

package/dist/lib/sectors.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Sector-based scout scanning with staleness-based rotation.
+ *
+ * Pure algorithms (rotation, classification, coverage, recording) live in
+ * @promptwheel/core/sectors/shared. This file provides I/O wrappers
+ * (persistence to `.promptwheel/sectors.json`) and re-exports.
+ */
+export { type Sector, type SectorState, type CodebaseModuleLike, type CoverageMetrics, normalizeSectorPath, sectorToScope, buildSectors, normalizeSectorFields, mergeSectors, getSectorDifficulty, getSectorMinConfidence, computeCoverage, buildSectorSummary, recordScanResult, recordTicketOutcome, updateProposalYield, recordMergeOutcome, getSectorCategoryAffinity, suggestScopeAdjustment, } from '@promptwheel/core/sectors/shared';
+import type { Sector, SectorState, CodebaseModuleLike } from '@promptwheel/core/sectors/shared';
+export declare function saveSectors(repoRoot: string, state: SectorState): void;
+export declare function loadOrBuildSectors(repoRoot: string, modules: CodebaseModuleLike[]): SectorState;
+export declare function refreshSectors(repoRoot: string, previous: SectorState, modules: CodebaseModuleLike[]): SectorState;
+/**
+ * Pick next sector with CLI metric instrumentation.
+ * Wraps the core pure algorithm and adds metric() call.
+ */
+export declare function pickNextSector(state: SectorState, currentCycle: number): {
+    sector: Sector;
+    scope: string;
+} | null;
+//# sourceMappingURL=sectors.d.ts.map

package/dist/lib/sectors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sectors.d.ts","sourceRoot":"","sources":["../../src/lib/sectors.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAOH,OAAO,EACL,KAAK,MAAM,EACX,KAAK,WAAW,EAChB,KAAK,kBAAkB,EACvB,KAAK,eAAe,EACpB,mBAAmB,EACnB,aAAa,EACb,YAAY,EACZ,qBAAqB,EACrB,YAAY,EACZ,mBAAmB,EACnB,sBAAsB,EACtB,eAAe,EACf,kBAAkB,EAClB,gBAAgB,EAChB,mBAAmB,EACnB,mBAAmB,EACnB,kBAAkB,EAClB,yBAAyB,EACzB,sBAAsB,GACvB,MAAM,kCAAkC,CAAC;AAG1C,OAAO,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,kBAAkB,EAAE,MAAM,kCAAkC,CAAC;AAgChG,wBAAgB,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,GAAG,IAAI,CAMtE;AAMD,wBAAgB,kBAAkB,CAChC,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,kBAAkB,EAAE,GAC5B,WAAW,CAwBb;AAED,wBAAgB,cAAc,CAC5B,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,WAAW,EACrB,OAAO,EAAE,kBAAkB,EAAE,GAC5B,WAAW,CAWb;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,GAAG;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAcjH"}

package/dist/lib/sectors.js

@@ -0,0 +1,96 @@
+/**
+ * Sector-based scout scanning with staleness-based rotation.
+ *
+ * Pure algorithms (rotation, classification, coverage, recording) live in
+ * @promptwheel/core/sectors/shared. This file provides I/O wrappers
+ * (persistence to `.promptwheel/sectors.json`) and re-exports.
+ */
+import * as fs from 'node:fs';
+import * as path from 'node:path';
+import { metric } from './metrics.js';
+// Re-export everything from core
+export { normalizeSectorPath, sectorToScope, buildSectors, normalizeSectorFields, mergeSectors, getSectorDifficulty, getSectorMinConfidence, computeCoverage, buildSectorSummary, recordScanResult, recordTicketOutcome, updateProposalYield, recordMergeOutcome, getSectorCategoryAffinity, suggestScopeAdjustment, } from '@promptwheel/core/sectors/shared';
+import { buildSectors, normalizeSectorFields, mergeSectors, pickNextSector as pickNextSectorCore, } from '@promptwheel/core/sectors/shared';
+// ---------------------------------------------------------------------------
+// Constants
+// ---------------------------------------------------------------------------
+const STATE_DIR = '.promptwheel';
+const STATE_FILE = 'sectors.json';
+// ---------------------------------------------------------------------------
+// I/O helpers
+// ---------------------------------------------------------------------------
+function defaultSectorsFile(repoRoot) {
+    return path.join(repoRoot, STATE_DIR, STATE_FILE);
+}
+function ensureStateDir(repoRoot) {
+    const d = path.join(repoRoot, STATE_DIR);
+    if (!fs.existsSync(d))
+        fs.mkdirSync(d, { recursive: true });
+}
+// ---------------------------------------------------------------------------
+// Persistence
+// ---------------------------------------------------------------------------
+export function saveSectors(repoRoot, state) {
+    ensureStateDir(repoRoot);
+    const filePath = defaultSectorsFile(repoRoot);
+    const tmpPath = filePath + '.tmp';
+    fs.writeFileSync(tmpPath, JSON.stringify(state, null, 2), 'utf8');
+    fs.renameSync(tmpPath, filePath);
+}
+// ---------------------------------------------------------------------------
+// Public API — I/O wrappers
+// ---------------------------------------------------------------------------
+export function loadOrBuildSectors(repoRoot, modules) {
+    const sectorsFile = defaultSectorsFile(repoRoot);
+    if (fs.existsSync(sectorsFile)) {
+        try {
+            const parsed = JSON.parse(fs.readFileSync(sectorsFile, 'utf8'));
+            if (parsed?.version === 2 && Array.isArray(parsed.sectors)) {
+                // Normalize fields using core function
+                parsed.sectors = parsed.sectors.map((s) => normalizeSectorFields(s));
+                return parsed;
+            }
+        }
+        catch {
+            // fallthrough to rebuild
+        }
+    }
+    // Build fresh (v1 files are discarded — not worth migrating)
+    const state = {
+        version: 2,
+        builtAt: new Date().toISOString(),
+        sectors: buildSectors(modules),
+    };
+    saveSectors(repoRoot, state);
+    return state;
+}
+export function refreshSectors(repoRoot, previous, modules) {
+    const fresh = buildSectors(modules);
+    const merged = mergeSectors(fresh, previous.sectors);
+    const state = {
+        version: 2,
+        builtAt: new Date().toISOString(),
+        sectors: merged,
+    };
+    saveSectors(repoRoot, state);
+    return state;
+}
+/**
+ * Pick next sector with CLI metric instrumentation.
+ * Wraps the core pure algorithm and adds metric() call.
+ */
+export function pickNextSector(state, currentCycle) {
+    const result = pickNextSectorCore(state, currentCycle);
+    if (!result)
+        return null;
+    // Instrument: track sector selection
+    metric('sectors', 'picked', {
+        path: result.sector.path,
+        scanCount: result.sector.scanCount,
+        proposalYield: result.sector.proposalYield,
+        candidateCount: state.sectors.filter(s => s.fileCount > 0).length,
+        totalSectors: state.sectors.length,
+    });
+    return result;
+}
+//# sourceMappingURL=sectors.js.map

package/dist/lib/sectors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sectors.js","sourceRoot":"","sources":["../../src/lib/sectors.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAEtC,iCAAiC;AACjC,OAAO,EAKL,mBAAmB,EACnB,aAAa,EACb,YAAY,EACZ,qBAAqB,EACrB,YAAY,EACZ,mBAAmB,EACnB,sBAAsB,EACtB,eAAe,EACf,kBAAkB,EAClB,gBAAgB,EAChB,mBAAmB,EACnB,mBAAmB,EACnB,kBAAkB,EAClB,yBAAyB,EACzB,sBAAsB,GACvB,MAAM,kCAAkC,CAAC;AAI1C,OAAO,EACL,YAAY,EACZ,qBAAqB,EACrB,YAAY,EACZ,cAAc,IAAI,kBAAkB,GACrC,MAAM,kCAAkC,CAAC;AAE1C,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E,MAAM,SAAS,GAAG,cAAc,CAAC;AACjC,MAAM,UAAU,GAAG,cAAc,CAAC;AAElC,8EAA8E;AAC9E,cAAc;AACd,8EAA8E;AAE9E,SAAS,kBAAkB,CAAC,QAAgB;IAC1C,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;AACpD,CAAC;AAED,SAAS,cAAc,CAAC,QAAgB;IACtC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IACzC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;QAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;AAC9D,CAAC;AAED,8EAA8E;AAC9E,cAAc;AACd,8EAA8E;AAE9E,MAAM,UAAU,WAAW,CAAC,QAAgB,EAAE,KAAkB;IAC9D,cAAc,CAAC,QAAQ,CAAC,CAAC;IACzB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAC9C,MAAM,OAAO,GAAG,QAAQ,GAAG,MAAM,CAAC;IAClC,EAAE,CAAC,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAClE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AACnC,CAAC;AAED,8EAA8E;AAC9E,4BAA4B;AAC5B,8EAA8E;AAE9E,MAAM,UAAU,kBAAkB,CAChC,QAAgB,EAChB,OAA6B;IAE7B,MAAM,WAAW,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAEjD,IAAI,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC;QAC/B,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC;YAChE,IAAI,MAAM,EAAE,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC3D,uCAAuC;gBACvC,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAkB,EAAE,EAAE,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtF,OAAO,MAAqB,CAAC;YAC/B,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,yBAAyB;QAC3B,CAAC;IACH,CAAC;IAED,6DAA6D;IAC7D,MAAM,KAAK,GAAgB;QACzB,OAAO,EAAE,CAAC;QACV,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACjC,OAAO,EAAE,YAAY,CAAC,OAAO,CAAC;KAC/B,CAAC;IACF,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC7B,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,QAAgB,EAChB,QAAqB,EACrB,OAA6B;IAE7B,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;IAErD,MAAM,KAAK,GAAgB;QACzB,OAAO,EAAE,CAAC;QACV,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACjC,OAAO,EAAE,MAAM;KAChB,CAAC;IACF,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC7B,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAkB,EAAE,YAAoB;IACrE,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACvD,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEzB,qCAAqC;IACrC,MAAM,CAAC,SAAS,EAAE,QAAQ,EAAE;QAC1B,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI;QACxB,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,SAAS;QAClC,aAAa,EAAE,MAAM,CAAC,MAAM,CAAC,aAAa;QAC1C,cAAc,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,MAAM;QACjE,YAAY,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM;KACnC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/lib/selection.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Selection parser for user input
+ *
+ * Parses selection strings like:
+ * - "1"       → [0]
+ * - "1,3,5"   → [0, 2, 4]
+ * - "1-3"     → [0, 1, 2]
+ * - "1-3,5,7" → [0, 1, 2, 4, 6]
+ * - "all"     → all indices
+ *
+ * Note: User input is 1-indexed, output is 0-indexed.
+ */
+/**
+ * Parse a selection string into 0-indexed array indices
+ *
+ * @param input - Selection string (e.g., "1-3,5,7" or "all")
+ * @param maxIndex - Maximum valid index (0-indexed, exclusive)
+ * @returns Array of 0-indexed indices, sorted and deduplicated
+ * @throws Error for invalid input
+ */
+export declare function parseSelection(input: string, maxIndex: number): number[];
+/**
+ * Validate a selection string without parsing
+ *
+ * @returns true if valid, false otherwise
+ */
+export declare function isValidSelection(input: string, maxIndex: number): boolean;
+/**
+ * Format a selection for display (1-indexed)
+ *
+ * @param indices - 0-indexed array indices
+ * @returns Human-readable string like "1, 2, 3" or "1-3"
+ */
+export declare function formatSelection(indices: number[]): string;
+//# sourceMappingURL=selection.d.ts.map

package/dist/lib/selection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"selection.d.ts","sourceRoot":"","sources":["../../src/lib/selection.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CAoDxE;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAOzE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CA0BzD"}