@mknightzzz/stw 0.1.0

package/dist/planner-prompt.js

@@ -0,0 +1,244 @@
+import { readFileSync } from 'node:fs';
+import { normalize, relative, resolve } from 'node:path';
+import { fileExists } from './storage.js';
+import { detectRepoLanguage, getImportPattern, isImportGraphSourceFile, isRelativeImport, resolveImportPath, resolvePythonImportPath, } from './import-resolution.js';
+const MAX_IMPORT_GRAPH_EDGES = 150;
+export function buildPlannerPrompt(input) {
+    const repoListing = buildRepoListing(input.repoFiles, input.repoRoot);
+    const completedTaskSection = buildCompletedTaskSection(input.completedTasks ?? []);
+    const extraConstraintsSection = input.extraConstraints ?? '';
+    const importGraphSection = buildImportGraphSection(input.importGraph);
+    return `You are a software planning agent. Given a spec and repo file listing, decompose the work into tasks.
+
+## Spec
+${input.spec}
+
+## Repository files
+${repoListing}${importGraphSection}
+${completedTaskSection}
+${extraConstraintsSection}
+
+## Output format
+Return a JSON object matching this schema:
+{
+  "schema_version": 1,
+  "tasks": [
+    {
+      "id": "T1",
+      "description": "what to do",
+      "task_type": "mechanical_refactor | api_scaffold | test_generation | integration | final_validation | ...",
+      "risk": "low | medium | high",
+      "state": "pending",
+      "scope": {
+        "files": ["exact/paths.ts"],
+        "new_files": ["path/to/new-file.ts"],
+        "allow_shared_files": false
+      },
+      "dependencies": [],
+      "acceptance_checks": ["<language-appropriate check command>"],
+      "model_tier": "cheap | medium | strong",
+      "max_retries": 2,
+      "timeout_minutes": 15,
+      "planner_metadata": {
+        "planner_eligible": true,
+        "planner_reason": "small focused implementation task",
+        "execution_mode": "conservative | agentic",
+        "consolidation_signals": ["optional advisory note"]
+      }
+    }
+  ]
+}
+
+## Rules
+- Aim for 5-10 tasks total. Plans with more than 12 tasks are almost always over-decomposed. Hard limit: 15 tasks.
+- Each task must have a unique ID (T1, T2, T3, ...)
+- Scope overlap between non-serialized tasks is a validation ERROR — set allow_shared_files: true on both tasks or add a dependency to serialize them
+- Keep task scope tight — target 5 or fewer scope files per task (rejection at 8 files)
+- Dependencies must reference existing task IDs
+- If multiple tasks touch the same shared registration or configuration file, add explicit dependencies to serialize access
+- Scope files must be exact paths relative to repo root
+- If a task creates a new file, list it in both scope.files AND scope.new_files so validation knows it doesn't exist yet
+- Downstream tasks can reference files created by upstream dependencies in scope.files without adding them to new_files
+- Acceptance checks must be runnable shell commands that exit 0 on success
+- Acceptance checks must provide concrete proof, not only generic or manual validation language
+- NEVER use grep/sed/awk as acceptance checks — they are brittle and reject valid implementations that use different naming. Use the repo's actual test runner and type checker instead.
+- Every implementation task MUST include the repo's type checker and test runner as acceptance checks (e.g., "npx tsc --noEmit" and "npx vitest run" for TypeScript repos). These are the minimum bar; add more specific checks only if they add value beyond what tests already cover.
+- Prefer cheap tier unless the task requires reasoning (medium) or is high-risk (strong)
+- Keep tasks small and focused - one logical change per task
+- Bundle tests WITH the implementation they test — do NOT create separate tasks for individual test cases
+- Choose acceptance checks appropriate to the repo's language:
+  - TypeScript/JavaScript: "npx tsc --noEmit", "npx vitest run" (always both; optionally add "npx vitest run tests/specific.test.ts" for targeted coverage)
+  - Python: "python -m pytest tests/", "ruff check ." (always both)
+  - Go: "go vet ./...", "go test ./..." (always both)
+  - Rust: "cargo check", "cargo test" (always both)
+- If completed task context is provided, preserve that completed work by planning only the remaining work
+- Use the import graph to understand relationships between files, including unresolved local imports that may indicate missing or renamed modules
+- IMPORTANT: If a task modifies a function's signature or adds a parameter that callers must pass, include those caller files in scope. Similarly, if the task changes behavior in a module, include the files that directly import and invoke that module. Check the import graph for these relationships. Missing scope files is the #1 cause of task failure.
+- Do not reintroduce already-completed tasks into the new plan unless they are required as dependencies for remaining tasks
+- Task descriptions must be self-contained — do not reference other task IDs (e.g., "T2", "T3") in the description; use dependencies instead
+- Mark planner_metadata.planner_eligible=false for tasks that are too broad, ambiguous, or require heavy cross-cutting coordination
+- Use execution_mode="conservative" for integration/final-validation tasks, shared-file coordination, or any task with elevated merge/conflict risk
+- Integration/final-validation tasks should usually be narrowly scoped, depend on prior implementation tasks, and avoid catch-all ownership of many unrelated files
+- When two non-serialized tasks touch the same file, either consolidate them into one task or emit a consolidation_signals note explaining the overlap
+- Files over 400 lines should be scoped carefully. Prefer narrowing the task description to specific functions or sections rather than including the entire file
+
+## Common mistakes to avoid
+- Do NOT use source files as test runner targets (e.g., "npx vitest run src/foo.ts" is wrong — vitest runs test files, not source files). Use "npx vitest run" or "npx vitest run tests/foo.test.ts" instead.
+- Only reference test files in acceptance checks if they already exist on disk or are listed in scope.new_files. If unsure, use the generic runner ("npx vitest run") — it runs all tests and catches regressions.
+- If a task creates a new test file AND a new source file, put both in scope.files and scope.new_files.
+- Each task description must fully explain what to implement WITHOUT reading other tasks. A worker sees only its own task — never write "implement the remaining parts" or "finish what T1 started" without specifying exactly what that means.
+- When splitting work across tasks, prefer splitting by module/file rather than by layer (e.g., "add feature X to module A" + "add feature X to module B" is better than "add interfaces" + "add implementations").
+- Avoid creating "final validation" or "integration" tasks that just re-run the same checks as prior tasks. These waste compute and rarely catch real issues. Only create them if they run a genuinely different validation (e.g., an end-to-end test that requires all prior work).
+- NEVER create one task per test case. Group all tests for a module or feature into one task alongside the implementation. A spec with 18 tests should NOT produce 18 test tasks — it should produce 5-8 implementation tasks that each include their related tests.
+- NEVER create standalone tasks for trivial type changes (adding optional fields to interfaces). Bundle type additions with the task that first uses them.`;
+}
+export function buildReplanPrompt(input) {
+    const constraintLines = input.oversizedTasks.map((t) => `- Task ${t.taskId}: estimated ${t.estimatedTokens} tokens exceeds limit of ${t.maxTokens}. ` +
+        `Split this task into smaller subtasks or reduce the number of files in scope.`);
+    const constraintSection = [
+        '',
+        '## Re-plan Constraints (Attempt ' + String(input.attemptNumber) + ')',
+        'The following tasks were rejected because their worker prompts exceeded the maximum token limit.',
+        "You MUST split or simplify these tasks so that each task's prompt fits within the token budget:",
+        ...constraintLines,
+        '- Strengthen acceptance checks so they show concrete local proof of completion.',
+        '- Reconsider integration/final-validation tasks that are acting as catch-all work buckets.',
+        '- If multiple tasks overlap on the same shared file, prefer consolidation or explicit serialization.',
+    ].join('\n');
+    return buildPlannerPrompt({
+        spec: input.spec,
+        repoFiles: input.repoFiles,
+        repoRoot: input.repoRoot,
+        completedTasks: input.completedTasks,
+        extraConstraints: constraintSection,
+        importGraph: input.importGraph,
+    });
+}
+export function buildImportGraph(repoRoot, repoFiles) {
+    const resolvedEdges = [];
+    const unresolvedEdges = [];
+    const language = detectRepoLanguage(repoFiles);
+    const importPattern = getImportPattern(language);
+    for (const repoFile of repoFiles) {
+        if (!isImportGraphSourceFile(repoFile, language)) {
+            continue;
+        }
+        const absolutePath = resolve(repoRoot, repoFile);
+        if (!fileExists(absolutePath)) {
+            continue;
+        }
+        let content = '';
+        try {
+            content = readFileSync(absolutePath, 'utf-8');
+        }
+        catch {
+            continue;
+        }
+        for (const match of content.matchAll(importPattern)) {
+            const specifier = match[1] ?? match[2];
+            if (!specifier || !isRelativeImport(specifier, language)) {
+                continue;
+            }
+            const resolvedImport = language === 'python'
+                ? resolvePythonImportPath(repoRoot, absolutePath, specifier)
+                : resolveImportPath(repoRoot, absolutePath, specifier);
+            const edge = {
+                importer: repoFile,
+                specifier,
+                resolved: resolvedImport ? normalize(relative(repoRoot, resolvedImport)) : null,
+            };
+            if (edge.resolved) {
+                resolvedEdges.push(edge);
+            }
+            else {
+                unresolvedEdges.push(edge);
+            }
+        }
+    }
+    return {
+        resolvedEdges,
+        unresolvedEdges,
+    };
+}
+export function selectImportGraphEdgesForPrompt(importGraph) {
+    const unresolvedEdges = [...importGraph.unresolvedEdges];
+    const remainingSlots = Math.max(0, MAX_IMPORT_GRAPH_EDGES - unresolvedEdges.length);
+    const resolvedEdges = importGraph.resolvedEdges.slice(0, remainingSlots);
+    return {
+        resolvedEdges,
+        unresolvedEdges,
+    };
+}
+function buildImportGraphSection(importGraph) {
+    if (!importGraph) {
+        return '';
+    }
+    const selected = selectImportGraphEdgesForPrompt(importGraph);
+    const lines = [
+        '',
+        '## Import graph',
+        `Resolved local dependencies found: ${String(importGraph.resolvedEdges.length)}`,
+        `Unresolved local dependencies found: ${String(importGraph.unresolvedEdges.length)}`,
+        `Edges shown below: ${String(selected.resolvedEdges.length + selected.unresolvedEdges.length)} (capped at ${String(MAX_IMPORT_GRAPH_EDGES)}; unresolved edges are always included)`,
+    ];
+    if (selected.resolvedEdges.length > 0) {
+        lines.push('', '### Resolved local imports');
+        for (const edge of selected.resolvedEdges) {
+            lines.push(`- ${edge.importer} -> ${edge.resolved} (${edge.specifier})`);
+        }
+    }
+    if (selected.unresolvedEdges.length > 0) {
+        lines.push('', '### Unresolved local imports');
+        for (const edge of selected.unresolvedEdges) {
+            lines.push(`- ${edge.importer} -> UNRESOLVED (${edge.specifier})`);
+        }
+    }
+    if (selected.resolvedEdges.length === 0 && selected.unresolvedEdges.length === 0) {
+        lines.push('', '- No local import edges found');
+    }
+    return lines.join('\n');
+}
+function buildCompletedTaskSection(completedTasks) {
+    if (completedTasks.length === 0) {
+        return '';
+    }
+    const lines = ['', '## Already completed tasks'];
+    for (const task of completedTasks) {
+        lines.push(`- ${task.task_id}: ${task.description}`);
+        lines.push(`  - status: ${task.status}`);
+        if (task.notes.trim()) {
+            lines.push(`  - notes: ${task.notes.trim()}`);
+        }
+    }
+    return lines.join('\n');
+}
+export { validatePlanScope } from './plan-validation.js';
+export const TEST_FILE_PATTERN = /\.(test|spec)\.(ts|js|tsx|jsx)$|^tests?\//;
+export function isTestFile(filePath) {
+    return TEST_FILE_PATTERN.test(filePath);
+}
+function buildRepoListing(repoFiles, repoRoot) {
+    if (repoFiles.length === 0) {
+        return '(no tracked files)';
+    }
+    const lines = [];
+    for (const file of repoFiles) {
+        const testMarker = isTestFile(file) ? ' [test]' : '';
+        if (repoRoot) {
+            const absolutePath = resolve(repoRoot, file);
+            try {
+                const content = readFileSync(absolutePath, 'utf-8');
+                const lineCount = content.split('\n').length;
+                lines.push(`${file} (${lineCount} lines)${testMarker}`);
+            }
+            catch {
+                lines.push(`${file}${testMarker}`);
+            }
+        }
+        else {
+            lines.push(`${file}${testMarker}`);
+        }
+    }
+    return lines.join('\n');
+}
+//# sourceMappingURL=planner-prompt.js.map

package/dist/planner-prompt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner-prompt.js","sourceRoot":"","sources":["../src/planner-prompt.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACzD,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C,OAAO,EACL,kBAAkB,EAClB,gBAAgB,EAChB,uBAAuB,EACvB,gBAAgB,EAChB,iBAAiB,EACjB,uBAAuB,GACxB,MAAM,wBAAwB,CAAC;AAEhC,MAAM,sBAAsB,GAAG,GAAG,CAAC;AAanC,MAAM,UAAU,kBAAkB,CAAC,KAOlC;IACC,MAAM,WAAW,GAAG,gBAAgB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IACtE,MAAM,oBAAoB,GAAG,yBAAyB,CAAC,KAAK,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC;IACnF,MAAM,uBAAuB,GAAG,KAAK,CAAC,gBAAgB,IAAI,EAAE,CAAC;IAC7D,MAAM,kBAAkB,GAAG,uBAAuB,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAEtE,OAAO;;;EAGP,KAAK,CAAC,IAAI;;;EAGV,WAAW,GAAG,kBAAkB;EAChC,oBAAoB;EACpB,uBAAuB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;2JA0EkI,CAAC;AAC5J,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,KAQjC;IACC,MAAM,eAAe,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG,CAC9C,CAAC,CAAC,EAAE,EAAE,CACJ,UAAU,CAAC,CAAC,MAAM,eAAe,CAAC,CAAC,eAAe,4BAA4B,CAAC,CAAC,SAAS,IAAI;QAC7F,+EAA+E,CAClF,CAAC;IAEF,MAAM,iBAAiB,GAAG;QACxB,EAAE;QACF,kCAAkC,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,GAAG;QACtE,kGAAkG;QAClG,iGAAiG;QACjG,GAAG,eAAe;QAClB,iFAAiF;QACjF,4FAA4F;QAC5F,sGAAsG;KACvG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEb,OAAO,kBAAkB,CAAC;QACxB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,cAAc,EAAE,KAAK,CAAC,cAAc;QACpC,gBAAgB,EAAE,iBAAiB;QACnC,WAAW,EAAE,KAAK,CAAC,WAAW;KAC/B,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,QAAgB,EAAE,SAAmB;IACpE,MAAM,aAAa,GAAsB,EAAE,CAAC;IAC5C,MAAM,eAAe,GAAsB,EAAE,CAAC;IAC9C,MAAM,QAAQ,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;IAC/C,MAAM,aAAa,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAEjD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;YACjD,SAAS;QACX,CAAC;QAED,MAAM,YAAY,GAAG,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;YAC9B,SAAS;QACX,CAAC;QAED,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC;YACH,OAAO,GAAG,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QAChD,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;YACpD,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;YACvC,IAAI,CAAC,SAAS,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,CAAC,EAAE,CAAC;gBACzD,SAAS;YACX,CAAC;YAED,MAAM,cAAc,GAClB,QAAQ,KAAK,QAAQ;gBACnB,CAAC,CAAC,uBAAuB,CAAC,QAAQ,EAAE,YAAY,EAAE,SAAS,CAAC;gBAC5D,CAAC,CAAC,iBAAiB,CAAC,QAAQ,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;YAC3D,MAAM,IAAI,GAAoB;gBAC5B,QAAQ,EAAE,QAAQ;gBAClB,SAAS;gBACT,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;aAChF,CAAC;YAEF,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;iBAAM,CAAC;gBACN,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,aAAa;QACb,eAAe;KAChB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,+BAA+B,CAAC,WAAwB;IACtE,MAAM,eAAe,GAAG,CAAC,GAAG,WAAW,CAAC,eAAe,CAAC,CAAC;IACzD,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,sBAAsB,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACpF,MAAM,aAAa,GAAG,WAAW,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IAEzE,OAAO;QACL,aAAa;QACb,eAAe;KAChB,CAAC;AACJ,CAAC;AAED,SAAS,uBAAuB,CAAC,WAAyB;IACxD,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,QAAQ,GAAG,+BAA+B,CAAC,WAAW,CAAC,CAAC;IAC9D,MAAM,KAAK,GAAG;QACZ,EAAE;QACF,iBAAiB;QACjB,sCAAsC,MAAM,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE;QAChF,wCAAwC,MAAM,CAAC,WAAW,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE;QACpF,sBAAsB,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,MAAM,GAAG,QAAQ,CAAC,eAAe,CAAC,MAAM,CAAC,eAAe,MAAM,CAAC,sBAAsB,CAAC,yCAAyC;KACpL,CAAC;IAEF,IAAI,QAAQ,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,4BAA4B,CAAC,CAAC;QAC7C,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,aAAa,EAAE,CAAC;YAC1C,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,QAAQ,OAAO,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,8BAA8B,CAAC,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,eAAe,EAAE,CAAC;YAC5C,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,QAAQ,mBAAmB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjF,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,+BAA+B,CAAC,CAAC;IAClD,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,yBAAyB,CAAC,cAAsC;IACvE,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,EAAE,EAAE,4BAA4B,CAAC,CAAC;IAEjD,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QACrD,KAAK,CAAC,IAAI,CAAC,eAAe,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,cAAc,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAGzD,MAAM,CAAC,MAAM,iBAAiB,GAAG,2CAA2C,CAAC;AAE7E,MAAM,UAAU,UAAU,CAAC,QAAgB;IACzC,OAAO,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC1C,CAAC;AAED,SAAS,gBAAgB,CAAC,SAAmB,EAAE,QAAiB;IAC9D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,oBAAoB,CAAC;IAC9B,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,YAAY,GAAG,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC7C,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;gBACpD,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;gBAC7C,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,KAAK,SAAS,UAAU,UAAU,EAAE,CAAC,CAAC;YAC1D,CAAC;YAAC,MAAM,CAAC;gBACP,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,UAAU,EAAE,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,UAAU,EAAE,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/planner.d.ts

@@ -0,0 +1,29 @@
+import type { CompletedTaskContext, PromptSizeCheckResult, StwConfig, Task, TaskGraph } from './types.js';
+export { buildPlannerPrompt, buildReplanPrompt, buildImportGraph, validatePlanScope } from './planner-prompt.js';
+export type { ImportGraphEdge, ImportGraph, PlanScopeValidationResult } from './planner-prompt.js';
+export interface PlannerOptions {
+    spec: string;
+    repoRoot: string;
+    config: StwConfig;
+    runId: string;
+    completedTasks?: CompletedTaskContext[];
+}
+export interface PlannerResult {
+    task_graph: TaskGraph;
+    raw_response: string;
+    warnings: string[];
+    usage?: {
+        input_tokens: number;
+        output_tokens: number;
+    };
+    model?: string;
+    latency_ms?: number;
+}
+export declare function checkPromptSizes(tasks: Task[], repoRoot: string, maxPromptTokens: number): PromptSizeCheckResult;
+export declare function generatePlan(options: PlannerOptions): Promise<PlannerResult>;
+export declare function validateGeneratedGraph(graph: TaskGraph): {
+    valid: boolean;
+    errors: string[];
+    warnings: string[];
+};
+export declare function sanitizeBrittleAcceptanceChecks(graph: TaskGraph): void;