pi-harness-runtime 0.5.0 → 0.6.3-beta.13

package/packages/task-compiler/dist/decompose.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Task Compiler - Requirement Decomposition
+ *
+ * Breaks a compiled requirement into candidate tasks following
+ * the standard engineering flow and decomposition policy.
+ */
+import type { TaskCandidate, TaskCompileInput } from "./types.js";
+/**
+ * Decompose a compiled requirement into task candidates.
+ *
+ * Policy: split when different capabilities needed, unrelated modules,
+ * incoherent test set, destructive+edit mix, >maxComplexity, or
+ * independently-proceeding outputs. Do NOT split to inflate count.
+ */
+export declare function decomposeRequirement(input: TaskCompileInput): TaskCandidate[];
+//# sourceMappingURL=decompose.d.ts.map

package/packages/task-compiler/dist/decompose.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decompose.d.ts","sourceRoot":"","sources":["../src/decompose.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAIX,aAAa,EACb,gBAAgB,EAChB,MAAM,YAAY,CAAC;AAEpB;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,GAAG,aAAa,EAAE,CAgL7E"}

package/packages/task-compiler/dist/decompose.js

@@ -0,0 +1,222 @@
+/**
+ * Task Compiler - Requirement Decomposition
+ *
+ * Breaks a compiled requirement into candidate tasks following
+ * the standard engineering flow and decomposition policy.
+ */
+/**
+ * Decompose a compiled requirement into task candidates.
+ *
+ * Policy: split when different capabilities needed, unrelated modules,
+ * incoherent test set, destructive+edit mix, >maxComplexity, or
+ * independently-proceeding outputs. Do NOT split to inflate count.
+ */
+export function decomposeRequirement(input) {
+    const { requirement, project, maxComplexity = 5 } = input;
+    const candidates = [];
+    let priority = 1;
+    // ─── Stage detection ────────────────────────────────────────────────
+    const needsAnalysis = requirement.problemStatement.length > 200 || requirement.goals.length > 3;
+    const needsDesign = requirement.problemStatement.length > 100;
+    const hasTests = requirement.acceptanceCriteria.length > 0;
+    const hasBrowserWorkflow = detectBrowserWorkflow(project);
+    const needsRepair = requirement.riskTags.some((r) => r.risk === "destructive_operation");
+    // ─── Analysis ──────────────────────────────────────────────────────
+    if (needsAnalysis) {
+        candidates.push({
+            id: "analysis-0",
+            title: `Analyze: ${truncate(requirement.title, 40)}`,
+            objective: `Analyze the requirement "${requirement.title}": ${requirement.problemStatement}. Identify affected modules, detect dependencies, and outline implementation approach.`,
+            type: "analysis",
+            roughDependencies: [],
+            criteria: [],
+            estimatedComplexity: estimateComplexity(requirement.problemStatement),
+            priority: priority++,
+        });
+    }
+    // ─── Design ────────────────────────────────────────────────────────
+    if (needsDesign) {
+        candidates.push({
+            id: "design-0",
+            title: `Design: ${truncate(requirement.title, 40)}`,
+            objective: `Design the architecture for: ${requirement.problemStatement}. Produce a schema or design document capturing the component model, API contracts, and data flow.`,
+            type: "design",
+            roughDependencies: needsAnalysis ? ["analysis-0"] : [],
+            criteria: [],
+            estimatedComplexity: 3,
+            priority: priority++,
+        });
+    }
+    // ─── Implementation ────────────────────────────────────────────────
+    for (let i = 0; i < requirement.goals.length; i++) {
+        const goal = requirement.goals[i];
+        const implDeps = [];
+        if (needsDesign)
+            implDeps.push("design-0");
+        else if (needsAnalysis)
+            implDeps.push("analysis-0");
+        candidates.push({
+            id: `impl-${i}`,
+            title: `Implement: ${truncate(goal.description, 45)}`,
+            objective: goal.description,
+            type: "implementation",
+            roughDependencies: implDeps,
+            criteria: mapGoalToCriteria(goal.id, requirement),
+            estimatedComplexity: estimateComplexity(goal.description),
+            priority: priority++,
+        });
+    }
+    // Blocking constraints as an implementation concern
+    const blockingConstraints = requirement.constraints.filter((c) => c.blocking);
+    if (blockingConstraints.length > 0) {
+        const firstImplId = requirement.goals.length > 0 ? "impl-0" : undefined;
+        candidates.push({
+            id: "impl-constraints",
+            title: `Implement constraints: ${truncate(blockingConstraints[0].description, 40)}`,
+            objective: blockingConstraints.map((c) => c.description).join("; "),
+            type: "implementation",
+            roughDependencies: firstImplId ? [firstImplId] : [],
+            criteria: [],
+            estimatedComplexity: 3,
+            priority: priority++,
+        });
+    }
+    // ─── Unit tests ───────────────────────────────────────────────────
+    if (hasTests) {
+        candidates.push({
+            id: "test-0",
+            title: `Write unit tests for: ${truncate(requirement.title, 35)}`,
+            objective: `Write unit tests that verify the acceptance criteria for: ${requirement.problemStatement}. Each test must map to at least one acceptance criterion.`,
+            type: "test",
+            roughDependencies: requirement.goals.length > 0 ? ["impl-0"] : [],
+            criteria: requirement.acceptanceCriteria.map((c) => c.id),
+            estimatedComplexity: 3,
+            priority: priority++,
+        });
+    }
+    // ─── E2E tests ───────────────────────────────────────────────────
+    if (hasBrowserWorkflow && input.insertE2E !== false) {
+        candidates.push({
+            id: "e2e-0",
+            title: `Write E2E tests for: ${truncate(requirement.title, 35)}`,
+            objective: `Write end-to-end browser tests for: ${requirement.problemStatement}. Cover the critical user flows identified in the requirements.`,
+            type: "e2e_test",
+            roughDependencies: hasTests
+                ? ["test-0"]
+                : requirement.goals.length > 0
+                    ? ["impl-0"]
+                    : [],
+            criteria: [],
+            estimatedComplexity: 5,
+            priority: priority++,
+        });
+    }
+    // ─── Review ────────────────────────────────────────────────────────
+    const reviewDeps = [];
+    if (hasTests)
+        reviewDeps.push("test-0");
+    if (hasBrowserWorkflow && input.insertE2E !== false)
+        reviewDeps.push("e2e-0");
+    if (reviewDeps.length === 0 && requirement.goals.length > 0)
+        reviewDeps.push("impl-0");
+    candidates.push({
+        id: "review-0",
+        title: `Review changes for: ${truncate(requirement.title, 35)}`,
+        objective: `Review all code changes for: ${requirement.problemStatement}. Verify code quality, test coverage, and alignment with acceptance criteria.`,
+        type: "review",
+        roughDependencies: reviewDeps,
+        criteria: requirement.acceptanceCriteria.map((c) => c.id),
+        estimatedComplexity: 2,
+        priority: priority++,
+    });
+    // ─── Repair ────────────────────────────────────────────────────────
+    if (needsRepair) {
+        candidates.push({
+            id: "repair-0",
+            title: `Repair / verify: ${truncate(requirement.title, 35)}`,
+            objective: `Address review findings and verify that destructive operations in: ${requirement.problemStatement} have proper approval and rollback plans.`,
+            type: "repair",
+            roughDependencies: ["review-0"],
+            criteria: [],
+            estimatedComplexity: 3,
+            priority: priority++,
+        });
+    }
+    // ─── Documentation ────────────────────────────────────────────────
+    candidates.push({
+        id: "docs-0",
+        title: `Document: ${truncate(requirement.title, 40)}`,
+        objective: `Document the implementation of: ${requirement.title}. ${requirement.problemStatement}. Include usage examples, API documentation, and any relevant diagrams.`,
+        type: "documentation",
+        roughDependencies: needsRepair ? ["repair-0"] : ["review-0"],
+        criteria: [],
+        estimatedComplexity: 2,
+        priority: priority++,
+    });
+    // ─── Enforce complexity threshold ─────────────────────────────────
+    const result = [];
+    for (const c of candidates) {
+        if (c.estimatedComplexity > maxComplexity) {
+            result.push(...splitByComplexity(c, maxComplexity));
+        }
+        else {
+            result.push(c);
+        }
+    }
+    return result;
+}
+// ─── Helpers ────────────────────────────────────────────────────────────
+function estimateComplexity(text) {
+    const words = text.split(/\s+/).length;
+    if (words < 20)
+        return 1;
+    if (words < 50)
+        return 2;
+    if (words < 100)
+        return 3;
+    if (words < 200)
+        return 5;
+    return 8;
+}
+function splitByComplexity(task, _maxComplexity) {
+    const half = Math.ceil(task.estimatedComplexity / 2);
+    return [
+        {
+            ...task,
+            id: `${task.id}-a`,
+            estimatedComplexity: half,
+            title: `${task.title} [Part 1]`,
+            objective: `${task.objective} (Part 1)`,
+        },
+        {
+            ...task,
+            id: `${task.id}-b`,
+            estimatedComplexity: half,
+            title: `${task.title} [Part 2]`,
+            objective: `${task.objective} (Part 2)`,
+            roughDependencies: [...task.roughDependencies, `${task.id}-a`],
+        },
+    ];
+}
+function mapGoalToCriteria(goalId, requirement) {
+    const acs = requirement.acceptanceCriteria;
+    const goalIndex = requirement.goals.findIndex((g) => g.id === goalId);
+    if (goalIndex < 0)
+        return acs.map((c) => c.id);
+    // Distribute criteria round-robin across goals
+    return acs
+        .filter((_, i) => i % requirement.goals.length === goalIndex)
+        .map((c) => c.id);
+}
+function detectBrowserWorkflow(project) {
+    const frameworks = project.frameworks ?? [];
+    const testCapabilities = project.testCapabilities ?? [];
+    return (frameworks.some((f) => /playwright|cypress|selenium|nightwatch/i.test(f.name)) ||
+        testCapabilities.some((t) => /playwright|cypress|selenium|e2e|browser/i.test(t.runner)));
+}
+function truncate(text, maxLen) {
+    if (text.length <= maxLen)
+        return text;
+    return `${text.slice(0, maxLen - 1)}…`;
+}
+//# sourceMappingURL=decompose.js.map

package/packages/task-compiler/dist/decompose.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decompose.js","sourceRoot":"","sources":["../src/decompose.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAUH;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAuB;IAC3D,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,aAAa,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC;IAE1D,MAAM,UAAU,GAAoB,EAAE,CAAC;IACvC,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,uEAAuE;IAEvE,MAAM,aAAa,GAClB,WAAW,CAAC,gBAAgB,CAAC,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3E,MAAM,WAAW,GAAG,WAAW,CAAC,gBAAgB,CAAC,MAAM,GAAG,GAAG,CAAC;IAC9D,MAAM,QAAQ,GAAG,WAAW,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3D,MAAM,kBAAkB,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAAC;IAC1D,MAAM,WAAW,GAAG,WAAW,CAAC,QAAQ,CAAC,IAAI,CAC5C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,uBAAuB,CACzC,CAAC;IAEF,sEAAsE;IAEtE,IAAI,aAAa,EAAE,CAAC;QACnB,UAAU,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,YAAY;YAChB,KAAK,EAAE,YAAY,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;YACpD,SAAS,EAAE,4BAA4B,WAAW,CAAC,KAAK,MAAM,WAAW,CAAC,gBAAgB,wFAAwF;YAClL,IAAI,EAAE,UAAU;YAChB,iBAAiB,EAAE,EAAE;YACrB,QAAQ,EAAE,EAAE;YACZ,mBAAmB,EAAE,kBAAkB,CAAC,WAAW,CAAC,gBAAgB,CAAC;YACrE,QAAQ,EAAE,QAAQ,EAAE;SACpB,CAAC,CAAC;IACJ,CAAC;IAED,sEAAsE;IAEtE,IAAI,WAAW,EAAE,CAAC;QACjB,UAAU,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,UAAU;YACd,KAAK,EAAE,WAAW,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;YACnD,SAAS,EAAE,gCAAgC,WAAW,CAAC,gBAAgB,oGAAoG;YAC3K,IAAI,EAAE,QAAQ;YACd,iBAAiB,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE;YACtD,QAAQ,EAAE,EAAE;YACZ,mBAAmB,EAAE,CAAC;YACtB,QAAQ,EAAE,QAAQ,EAAE;SACpB,CAAC,CAAC;IACJ,CAAC;IAED,sEAAsE;IAEtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnD,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,IAAI,WAAW;YAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;aACtC,IAAI,aAAa;YAAE,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAEpD,UAAU,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,QAAQ,CAAC,EAAE;YACf,KAAK,EAAE,cAAc,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC,EAAE;YACrD,SAAS,EAAE,IAAI,CAAC,WAAW;YAC3B,IAAI,EAAE,gBAAgB;YACtB,iBAAiB,EAAE,QAAQ;YAC3B,QAAQ,EAAE,iBAAiB,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC;YACjD,mBAAmB,EAAE,kBAAkB,CAAC,IAAI,CAAC,WAAW,CAAC;YACzD,QAAQ,EAAE,QAAQ,EAAE;SACpB,CAAC,CAAC;IACJ,CAAC;IAED,oDAAoD;IACpD,MAAM,mBAAmB,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC9E,IAAI,mBAAmB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;QACxE,UAAU,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,kBAAkB;YACtB,KAAK,EAAE,0BAA0B,QAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,EAAE;YACnF,SAAS,EAAE,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;YACnE,IAAI,EAAE,gBAAgB;YACtB,iBAAiB,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE;YACnD,QAAQ,EAAE,EAAE;YACZ,mBAAmB,EAAE,CAAC;YACtB,QAAQ,EAAE,QAAQ,EAAE;SACpB,CAAC,CAAC;IACJ,CAAC;IAED,qEAAqE;IAErE,IAAI,QAAQ,EAAE,CAAC;QACd,UAAU,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,QAAQ;YACZ,KAAK,EAAE,yBAAyB,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;YACjE,SAAS,EAAE,6DAA6D,WAAW,CAAC,gBAAgB,4DAA4D;YAChK,IAAI,EAAE,MAAM;YACZ,iBAAiB,EAAE,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;YACjE,QAAQ,EAAE,WAAW,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzD,mBAAmB,EAAE,CAAC;YACtB,QAAQ,EAAE,QAAQ,EAAE;SACpB,CAAC,CAAC;IACJ,CAAC;IAED,oEAAoE;IAEpE,IAAI,kBAAkB,IAAI,KAAK,CAAC,SAAS,KAAK,KAAK,EAAE,CAAC;QACrD,UAAU,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,OAAO;YACX,KAAK,EAAE,wBAAwB,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;YAChE,SAAS,EAAE,uCAAuC,WAAW,CAAC,gBAAgB,iEAAiE;YAC/I,IAAI,EAAE,UAAU;YAChB,iBAAiB,EAAE,QAAQ;gBAC1B,CAAC,CAAC,CAAC,QAAQ,CAAC;gBACZ,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;oBAC7B,CAAC,CAAC,CAAC,QAAQ,CAAC;oBACZ,CAAC,CAAC,EAAE;YACN,QAAQ,EAAE,EAAE;YACZ,mBAAmB,EAAE,CAAC;YACtB,QAAQ,EAAE,QAAQ,EAAE;SACpB,CAAC,CAAC;IACJ,CAAC;IAED,sEAAsE;IAEtE,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,IAAI,QAAQ;QAAE,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACxC,IAAI,kBAAkB,IAAI,KAAK,CAAC,SAAS,KAAK,KAAK;QAAE,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9E,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;QAC1D,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAE3B,UAAU,CAAC,IAAI,CAAC;QACf,EAAE,EAAE,UAAU;QACd,KAAK,EAAE,uBAAuB,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;QAC/D,SAAS,EAAE,gCAAgC,WAAW,CAAC,gBAAgB,+EAA+E;QACtJ,IAAI,EAAE,QAAQ;QACd,iBAAiB,EAAE,UAAU;QAC7B,QAAQ,EAAE,WAAW,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzD,mBAAmB,EAAE,CAAC;QACtB,QAAQ,EAAE,QAAQ,EAAE;KACpB,CAAC,CAAC;IAEH,sEAAsE;IAEtE,IAAI,WAAW,EAAE,CAAC;QACjB,UAAU,CAAC,IAAI,CAAC;YACf,EAAE,EAAE,UAAU;YACd,KAAK,EAAE,oBAAoB,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;YAC5D,SAAS,EAAE,sEAAsE,WAAW,CAAC,gBAAgB,2CAA2C;YACxJ,IAAI,EAAE,QAAQ;YACd,iBAAiB,EAAE,CAAC,UAAU,CAAC;YAC/B,QAAQ,EAAE,EAAE;YACZ,mBAAmB,EAAE,CAAC;YACtB,QAAQ,EAAE,QAAQ,EAAE;SACpB,CAAC,CAAC;IACJ,CAAC;IAED,qEAAqE;IAErE,UAAU,CAAC,IAAI,CAAC;QACf,EAAE,EAAE,QAAQ;QACZ,KAAK,EAAE,aAAa,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;QACrD,SAAS,EAAE,mCAAmC,WAAW,CAAC,KAAK,KAAK,WAAW,CAAC,gBAAgB,yEAAyE;QACzK,IAAI,EAAE,eAAe;QACrB,iBAAiB,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC5D,QAAQ,EAAE,EAAE;QACZ,mBAAmB,EAAE,CAAC;QACtB,QAAQ,EAAE,QAAQ,EAAE;KACpB,CAAC,CAAC;IAEH,qEAAqE;IAErE,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,mBAAmB,GAAG,aAAa,EAAE,CAAC;YAC3C,MAAM,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;QACrD,CAAC;aAAM,CAAC;YACP,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;IACF,CAAC;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAED,2EAA2E;AAE3E,SAAS,kBAAkB,CAAC,IAAY;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IACvC,IAAI,KAAK,GAAG,EAAE;QAAE,OAAO,CAAC,CAAC;IACzB,IAAI,KAAK,GAAG,EAAE;QAAE,OAAO,CAAC,CAAC;IACzB,IAAI,KAAK,GAAG,GAAG;QAAE,OAAO,CAAC,CAAC;IAC1B,IAAI,KAAK,GAAG,GAAG;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,CAAC,CAAC;AACV,CAAC;AAED,SAAS,iBAAiB,CACzB,IAAmB,EACnB,cAAsB;IAEtB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAuB,CAAC;IAC3E,OAAO;QACN;YACC,GAAG,IAAI;YACP,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI;YAClB,mBAAmB,EAAE,IAAI;YACzB,KAAK,EAAE,GAAG,IAAI,CAAC,KAAK,WAAW;YAC/B,SAAS,EAAE,GAAG,IAAI,CAAC,SAAS,WAAW;SACvC;QACD;YACC,GAAG,IAAI;YACP,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI;YAClB,mBAAmB,EAAE,IAAI;YACzB,KAAK,EAAE,GAAG,IAAI,CAAC,KAAK,WAAW;YAC/B,SAAS,EAAE,GAAG,IAAI,CAAC,SAAS,WAAW;YACvC,iBAAiB,EAAE,CAAC,GAAG,IAAI,CAAC,iBAAiB,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC;SAC9D;KACD,CAAC;AACH,CAAC;AAED,SAAS,iBAAiB,CACzB,MAAc,EACd,WAAgC;IAEhC,MAAM,GAAG,GAAG,WAAW,CAAC,kBAAkB,CAAC;IAC3C,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IACtE,IAAI,SAAS,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC/C,+CAA+C;IAC/C,OAAO,GAAG;SACR,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC;SAC5D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACpB,CAAC;AAED,SAAS,qBAAqB,CAAC,OAAuB;IACrD,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC;IAC5C,MAAM,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,IAAI,EAAE,CAAC;IACxD,OAAO,CACN,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CACrB,yCAAyC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CACtD;QACD,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAC3B,0CAA0C,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CACzD,CACD,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY,EAAE,MAAc;IAC7C,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM;QAAE,OAAO,IAAI,CAAC;IACvC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC;AACxC,CAAC"}

package/packages/task-compiler/dist/file-scope.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Task Compiler - File Scope Assignment
+ *
+ * Assigns filesInScope and FileOwnership to each compiled task
+ * based on the project structure and task type.
+ */
+import type { CompiledTask, ProjectProfile, TaskCandidate } from "./types.js";
+/**
+ * Assign file scope and ownership to each task candidate.
+ *
+ * File scope is determined by:
+ * - Task type (implementation → source files, test → test files)
+ * - Project structure (detected by Project Analyzer)
+ * - Requirement goals and constraints
+ */
+export declare function assignFileScope(candidates: TaskCandidate[], project: ProjectProfile): CompiledTask[];
+//# sourceMappingURL=file-scope.d.ts.map

package/packages/task-compiler/dist/file-scope.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"file-scope.d.ts","sourceRoot":"","sources":["../src/file-scope.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACX,YAAY,EAGZ,cAAc,EACd,aAAa,EAEb,MAAM,YAAY,CAAC;AAEpB;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC9B,UAAU,EAAE,aAAa,EAAE,EAC3B,OAAO,EAAE,cAAc,GACrB,YAAY,EAAE,CAmChB"}

package/packages/task-compiler/dist/file-scope.js

@@ -0,0 +1,188 @@
+/**
+ * Task Compiler - File Scope Assignment
+ *
+ * Assigns filesInScope and FileOwnership to each compiled task
+ * based on the project structure and task type.
+ */
+/**
+ * Assign file scope and ownership to each task candidate.
+ *
+ * File scope is determined by:
+ * - Task type (implementation → source files, test → test files)
+ * - Project structure (detected by Project Analyzer)
+ * - Requirement goals and constraints
+ */
+export function assignFileScope(candidates, project) {
+    const __projectPath = project.projectPath;
+    const sourceExts = detectSourceExtensions(project);
+    const testExts = detectTestExtensions(project);
+    return candidates.map((candidate) => {
+        const filesInScope = inferFiles(candidate, project, sourceExts, testExts);
+        const mode = getOwnershipMode(candidate.type);
+        const ownership = {
+            taskId: candidate.id,
+            include: filesInScope,
+            exclude: getExclusions(candidate.type, project),
+            mode,
+        };
+        return {
+            id: candidate.id,
+            jobId: "", // Set by compiler
+            title: candidate.title,
+            objective: candidate.objective,
+            type: candidate.type,
+            dependencies: candidate.roughDependencies,
+            filesInScope,
+            filesExclude: ownership.exclude,
+            expectedOutputs: [], // Set by verification.ts
+            acceptanceCriteria: candidate.criteria,
+            requiredCapabilities: inferCapabilities(candidate.type),
+            permittedCommands: [], // Set by command-policy.ts
+            prohibitedCommands: [], // Set by command-policy.ts
+            preferredProvider: undefined, // Set by compiler.ts
+            estimatedComplexity: candidate.estimatedComplexity,
+            fileOwnership: ownership,
+            priority: candidate.priority,
+        };
+    });
+}
+// ─── File inference by task type ───────────────────────────────────────
+function inferFiles(candidate, project, _sourceExts, testExts) {
+    const { type, objective } = candidate;
+    const base = project.projectPath;
+    switch (type) {
+        case "analysis": {
+            return [`${base}/src/**`];
+        }
+        case "design": {
+            return [`${base}/src/**/*.ts`, `${base}/docs/**`];
+        }
+        case "implementation": {
+            // Default to all source files; narrow by extracting file mentions from objective
+            const mentions = extractFileMentions(objective);
+            if (mentions.length > 0)
+                return mentions;
+            return [`${base}/src/**`];
+        }
+        case "test": {
+            if (testExts.length > 0)
+                return [`${base}/test/**`, `${base}/**/*.test.*`];
+            return [`${base}/**/*.test.*`, `${base}/**/*.spec.*`];
+        }
+        case "e2e_test": {
+            return [`${base}/**/*.e2e.*`, `${base}/e2e/**`];
+        }
+        case "review": {
+            // Review reads everything that's been modified
+            return [`${base}/src/**`];
+        }
+        case "repair": {
+            // Repair targets whatever the review flagged
+            const mentions = extractFileMentions(objective);
+            return mentions.length > 0 ? mentions : [`${base}/src/**`];
+        }
+        case "documentation": {
+            return [`${base}/README.md`, `${base}/docs/**`, `${base}/src/**/*.md`];
+        }
+        default: {
+            return [`${base}/src/**`];
+        }
+    }
+}
+// ─── Extract file mentions from objective text ──────────────────────────
+function extractFileMentions(text) {
+    // Match common file/directory patterns in natural language:
+    // - "src/components/Button.tsx"
+    // - "packages/foo/src/"
+    // - "test/user.test.ts"
+    const pattern = /(?:src|test|packages?|apps?|lib|components?|hooks?|utils|docs?)[/\\][^\s"']+/gi;
+    const matches = text.match(pattern);
+    if (!matches)
+        return [];
+    // Deduplicate and return
+    return [...new Set(matches)];
+}
+// ─── Ownership mode ────────────────────────────────────────────────────
+function getOwnershipMode(type) {
+    // Parallel tasks with "exclusive" mode cannot modify the same files
+    switch (type) {
+        case "implementation":
+        case "test":
+        case "e2e_test":
+        case "repair":
+            return "exclusive";
+        case "analysis":
+        case "design":
+        case "review":
+        case "documentation":
+            return "shared_read";
+        default:
+            return "shared_read";
+    }
+}
+// ─── Exclusions ────────────────────────────────────────────────────────
+function getExclusions(_type, project) {
+    const exclusions = [
+        // Never touch these regardless of task type
+        "**/node_modules/**",
+        "**/dist/**",
+        "**/.git/**",
+        "**/coverage/**",
+        "**/build/**",
+    ];
+    // Add project-specific exclusions from rules
+    if (project.rules) {
+        for (const rule of project.rules) {
+            if (rule.section === "scope" || rule.section === "files") {
+                // Rules may specify excluded patterns
+            }
+        }
+    }
+    return exclusions;
+}
+// ─── Capability inference ───────────────────────────────────────────────
+function inferCapabilities(type) {
+    const caps = {
+        analysis: ["plan", "analysis"],
+        design: ["plan", "analysis"],
+        implementation: ["code"],
+        test: ["code", "test"],
+        e2e_test: ["code", "e2e"],
+        review: ["review"],
+        repair: ["code", "debug"],
+        documentation: ["code"],
+    };
+    return caps[type] ?? ["code"];
+}
+// ─── Extension detection ─────────────────────────────────────────────────
+function detectSourceExtensions(project) {
+    const frameworks = project.frameworks ?? [];
+    const exts = new Set(["ts", "tsx", "js", "jsx"]);
+    if (frameworks.some((f) => /typescript|ts|tsx/i.test(f.name))) {
+        exts.add("ts");
+        exts.add("tsx");
+    }
+    if (frameworks.some((f) => /react|next\.?js|vue|svelte/i.test(f.name))) {
+        exts.add("jsx");
+        exts.add("tsx");
+    }
+    if (frameworks.some((f) => /python|flask|django|fastapi/i.test(f.name))) {
+        exts.add("py");
+    }
+    if (frameworks.some((f) => /frappe|erpnext/i.test(f.name))) {
+        exts.add("py");
+        exts.add("js");
+    }
+    return [...exts];
+}
+function detectTestExtensions(project) {
+    const frameworks = project.frameworks ?? [];
+    const testCaps = project.testCapabilities ?? [];
+    const exts = new Set();
+    if (frameworks.some((f) => /playwright|cypress|selenium|nightwatch/i.test(f.name)) ||
+        testCaps.some((t) => /playwright|cypress|selenium|nightwatch/i.test(t.runner))) {
+        exts.add("e2e.ts");
+    }
+    return [...exts];
+}
+//# sourceMappingURL=file-scope.js.map

package/packages/task-compiler/dist/file-scope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"file-scope.js","sourceRoot":"","sources":["../src/file-scope.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAWH;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC9B,UAA2B,EAC3B,OAAuB;IAEvB,MAAM,aAAa,GAAG,OAAO,CAAC,WAAW,CAAC;IAC1C,MAAM,UAAU,GAAG,sBAAsB,CAAC,OAAO,CAAC,CAAC;IACnD,MAAM,QAAQ,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAE/C,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE;QACnC,MAAM,YAAY,GAAG,UAAU,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QAC1E,MAAM,IAAI,GAAG,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,SAAS,GAAkB;YAChC,MAAM,EAAE,SAAS,CAAC,EAAE;YACpB,OAAO,EAAE,YAAY;YACrB,OAAO,EAAE,aAAa,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC;YAC/C,IAAI;SACJ,CAAC;QAEF,OAAO;YACN,EAAE,EAAE,SAAS,CAAC,EAAE;YAChB,KAAK,EAAE,EAAE,EAAE,kBAAkB;YAC7B,KAAK,EAAE,SAAS,CAAC,KAAK;YACtB,SAAS,EAAE,SAAS,CAAC,SAAS;YAC9B,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,YAAY,EAAE,SAAS,CAAC,iBAAiB;YACzC,YAAY;YACZ,YAAY,EAAE,SAAS,CAAC,OAAO;YAC/B,eAAe,EAAE,EAAE,EAAE,yBAAyB;YAC9C,kBAAkB,EAAE,SAAS,CAAC,QAAQ;YACtC,oBAAoB,EAAE,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC;YACvD,iBAAiB,EAAE,EAAE,EAAE,2BAA2B;YAClD,kBAAkB,EAAE,EAAE,EAAE,2BAA2B;YACnD,iBAAiB,EAAE,SAAS,EAAE,qBAAqB;YACnD,mBAAmB,EAAE,SAAS,CAAC,mBAAmB;YAClD,aAAa,EAAE,SAAS;YACxB,QAAQ,EAAE,SAAS,CAAC,QAAQ;SAC5B,CAAC;IACH,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,0EAA0E;AAE1E,SAAS,UAAU,CAClB,SAAwB,EACxB,OAAuB,EACvB,WAAqB,EACrB,QAAkB;IAElB,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,SAAS,CAAC;IACtC,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,CAAC;IAEjC,QAAQ,IAAI,EAAE,CAAC;QACd,KAAK,UAAU,CAAC,CAAC,CAAC;YACjB,OAAO,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC;QAC3B,CAAC;QAED,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,OAAO,CAAC,GAAG,IAAI,cAAc,EAAE,GAAG,IAAI,UAAU,CAAC,CAAC;QACnD,CAAC;QAED,KAAK,gBAAgB,CAAC,CAAC,CAAC;YACvB,iFAAiF;YACjF,MAAM,QAAQ,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC;YAChD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAAE,OAAO,QAAQ,CAAC;YACzC,OAAO,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC;QAC3B,CAAC;QAED,KAAK,MAAM,CAAC,CAAC,CAAC;YACb,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;gBACtB,OAAO,CAAC,GAAG,IAAI,UAAU,EAAE,GAAG,IAAI,cAAc,CAAC,CAAC;YACnD,OAAO,CAAC,GAAG,IAAI,cAAc,EAAE,GAAG,IAAI,cAAc,CAAC,CAAC;QACvD,CAAC;QAED,KAAK,UAAU,CAAC,CAAC,CAAC;YACjB,OAAO,CAAC,GAAG,IAAI,aAAa,EAAE,GAAG,IAAI,SAAS,CAAC,CAAC;QACjD,CAAC;QAED,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,+CAA+C;YAC/C,OAAO,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC;QAC3B,CAAC;QAED,KAAK,QAAQ,CAAC,CAAC,CAAC;YACf,6CAA6C;YAC7C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,SAAS,CAAC,CAAC;YAChD,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC;QAC5D,CAAC;QAED,KAAK,eAAe,CAAC,CAAC,CAAC;YACtB,OAAO,CAAC,GAAG,IAAI,YAAY,EAAE,GAAG,IAAI,UAAU,EAAE,GAAG,IAAI,cAAc,CAAC,CAAC;QACxE,CAAC;QAED,OAAO,CAAC,CAAC,CAAC;YACT,OAAO,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC;QAC3B,CAAC;IACF,CAAC;AACF,CAAC;AAED,2EAA2E;AAE3E,SAAS,mBAAmB,CAAC,IAAY;IACxC,4DAA4D;IAC5D,gCAAgC;IAChC,wBAAwB;IACxB,wBAAwB;IACxB,MAAM,OAAO,GACZ,gFAAgF,CAAC;IAClF,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACpC,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IACxB,yBAAyB;IACzB,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED,0EAA0E;AAE1E,SAAS,gBAAgB,CAAC,IAAc;IACvC,oEAAoE;IACpE,QAAQ,IAAI,EAAE,CAAC;QACd,KAAK,gBAAgB,CAAC;QACtB,KAAK,MAAM,CAAC;QACZ,KAAK,UAAU,CAAC;QAChB,KAAK,QAAQ;YACZ,OAAO,WAAW,CAAC;QACpB,KAAK,UAAU,CAAC;QAChB,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ,CAAC;QACd,KAAK,eAAe;YACnB,OAAO,aAAa,CAAC;QACtB;YACC,OAAO,aAAa,CAAC;IACvB,CAAC;AACF,CAAC;AAED,0EAA0E;AAE1E,SAAS,aAAa,CAAC,KAAe,EAAE,OAAuB;IAC9D,MAAM,UAAU,GAAa;QAC5B,4CAA4C;QAC5C,oBAAoB;QACpB,YAAY;QACZ,YAAY;QACZ,gBAAgB;QAChB,aAAa;KACb,CAAC;IAEF,6CAA6C;IAC7C,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;QACnB,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,OAAO,KAAK,OAAO,IAAI,IAAI,CAAC,OAAO,KAAK,OAAO,EAAE,CAAC;gBAC1D,sCAAsC;YACvC,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,2EAA2E;AAE3E,SAAS,iBAAiB,CAAC,IAAc;IACxC,MAAM,IAAI,GAA+B;QACxC,QAAQ,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;QAC9B,MAAM,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC;QAC5B,cAAc,EAAE,CAAC,MAAM,CAAC;QACxB,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;QACtB,QAAQ,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;QACzB,MAAM,EAAE,CAAC,QAAQ,CAAC;QAClB,MAAM,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC;QACzB,aAAa,EAAE,CAAC,MAAM,CAAC;KACvB,CAAC;IACF,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC;AAED,4EAA4E;AAE5E,SAAS,sBAAsB,CAAC,OAAuB;IACtD,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC;IAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAEzD,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAC/D,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,6BAA6B,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACxE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,8BAA8B,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACzE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChB,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAC5D,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChB,CAAC;IAED,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;AAClB,CAAC;AAED,SAAS,oBAAoB,CAAC,OAAuB;IACpD,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC;IAC5C,MAAM,QAAQ,GAAG,OAAO,CAAC,gBAAgB,IAAI,EAAE,CAAC;IAChD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,IACC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CACrB,yCAAyC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CACtD;QACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CACnB,yCAAyC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CACxD,EACA,CAAC;QACF,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACpB,CAAC;IAED,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;AAClB,CAAC"}

package/packages/task-compiler/dist/graph.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Task Compiler - Task Graph Builder
+ *
+ * Builds the deterministic DAG from compiled tasks,
+ * performs topological sort, and detects root/terminal nodes.
+ */
+import type { CompiledTask, TaskGraph } from "./types.js";
+/**
+ * Build a TaskGraph from compiled tasks.
+ *
+ * The graph is built from task dependencies and includes:
+ * - Roots: tasks with no incoming dependencies
+ * - Terminals: tasks with no outgoing dependencies
+ * - Deterministic topological order
+ */
+export declare function buildGraph(tasks: CompiledTask[]): TaskGraph;
+declare const dependents: Map<string, string[]>;
+export { dependents };
+//# sourceMappingURL=graph.d.ts.map

package/packages/task-compiler/dist/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE1D;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,SAAS,CAwC3D;AAoFD,QAAA,MAAM,UAAU,uBAA8B,CAAC;AAE/C,OAAO,EAAE,UAAU,EAAE,CAAC"}

package/packages/task-compiler/dist/graph.js

@@ -0,0 +1,122 @@
+/**
+ * Task Compiler - Task Graph Builder
+ *
+ * Builds the deterministic DAG from compiled tasks,
+ * performs topological sort, and detects root/terminal nodes.
+ */
+/**
+ * Build a TaskGraph from compiled tasks.
+ *
+ * The graph is built from task dependencies and includes:
+ * - Roots: tasks with no incoming dependencies
+ * - Terminals: tasks with no outgoing dependencies
+ * - Deterministic topological order
+ */
+export function buildGraph(tasks) {
+    const taskMap = new Map();
+    for (const task of tasks) {
+        taskMap.set(task.id, task);
+    }
+    // ─── Compute dependents ────────────────────────────────────────────
+    const dependents = new Map();
+    for (const task of tasks) {
+        dependents.set(task.id, []);
+    }
+    for (const task of tasks) {
+        for (const depId of task.dependencies) {
+            const list = dependents.get(depId);
+            if (list)
+                list.push(task.id);
+        }
+    }
+    // ─── Find roots and terminals ─────────────────────────────────────
+    const roots = tasks
+        .filter((t) => t.dependencies.length === 0)
+        .map((t) => t.id);
+    const terminals = tasks
+        .filter((t) => (dependents.get(t.id)?.length ?? 0) === 0)
+        .map((t) => t.id);
+    // ─── Deterministic topological sort ────────────────────────────────
+    const order = topologicalSort([...tasks], taskMap);
+    return {
+        jobId: tasks[0]?.jobId ?? "",
+        tasks,
+        roots,
+        terminalTasks: terminals,
+        topologicalOrder: order,
+    };
+}
+// ─── Kahn's topological sort with deterministic tiebreaking ─────────────────
+function topologicalSort(tasks, taskMap) {
+    const result = [];
+    // in-degree for each task
+    const inDegree = new Map();
+    for (const task of tasks) {
+        inDegree.set(task.id, 0);
+    }
+    for (const task of tasks) {
+        for (const dep of task.dependencies) {
+            inDegree.set(dep, inDegree.get(dep) ?? 0);
+        }
+    }
+    // Tasks with no incoming edges
+    const ready = [];
+    for (const [id, degree] of inDegree.entries()) {
+        if (degree === 0)
+            ready.push(id);
+    }
+    // Sort ready queue deterministically: by explicit priority first,
+    // then by dependency depth, then by task ID
+    const taskById = new Map(tasks.map((t) => [t.id, t]));
+    while (ready.length > 0) {
+        // Sort ready queue deterministically
+        ready.sort((a, b) => {
+            const ta = taskById.get(a);
+            const tb = taskById.get(b);
+            if (!ta || !tb)
+                return a.localeCompare(b);
+            // Priority: lower number = higher priority
+            const pa = ta.priority ?? 999;
+            const pb = tb.priority ?? 999;
+            if (pa !== pb)
+                return pa - pb;
+            // Dependency depth: tasks with more deps should come later
+            const depthA = countDepth(a, taskMap);
+            const depthB = countDepth(b, taskMap);
+            if (depthA !== depthB)
+                return depthA - depthB;
+            // Finally, task ID string order for determinism
+            return a.localeCompare(b);
+        });
+        const next = ready.shift();
+        if (!next)
+            break;
+        result.push(next);
+        // Reduce in-degree for dependents
+        for (const dependent of dependents.get(next ?? "") ?? []) {
+            const newDegree = (inDegree.get(dependent) ?? 1) - 1;
+            inDegree.set(dependent, newDegree);
+            if (newDegree === 0) {
+                ready.push(dependent);
+            }
+        }
+    }
+    return result;
+}
+// ─── Dependency depth helper ───────────────────────────────────────────────
+function countDepth(taskId, taskMap) {
+    const task = taskMap.get(taskId);
+    if (!task || task.dependencies.length === 0)
+        return 0;
+    let max = 0;
+    for (const dep of task.dependencies) {
+        const d = countDepth(dep, taskMap);
+        if (d > max)
+            max = d;
+    }
+    return max + 1;
+}
+// ─── Dependency map (for use by topologicalSort) ───────────────────────────
+const dependents = new Map();
+export { dependents };
+//# sourceMappingURL=graph.js.map

package/packages/task-compiler/dist/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CAAC,KAAqB;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAC;IAChD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,sEAAsE;IAEtE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACnC,IAAI,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9B,CAAC;IACF,CAAC;IAED,qEAAqE;IAErE,MAAM,KAAK,GAAG,KAAK;SACjB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC;SAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEnB,MAAM,SAAS,GAAG,KAAK;SACrB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;SACxD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEnB,sEAAsE;IAEtE,MAAM,KAAK,GAAG,eAAe,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;IAEnD,OAAO;QACN,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,EAAE;QAC5B,KAAK;QACL,KAAK;QACL,aAAa,EAAE,SAAS;QACxB,gBAAgB,EAAE,KAAK;KACvB,CAAC;AACH,CAAC;AAED,+EAA+E;AAE/E,SAAS,eAAe,CACvB,KAAqB,EACrB,OAAkC;IAElC,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,0BAA0B;IAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACrC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3C,CAAC;IACF,CAAC;IAED,+BAA+B;IAC/B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;QAC/C,IAAI,MAAM,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC;IAED,kEAAkE;IAClE,4CAA4C;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,qCAAqC;QACrC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACnB,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,OAAO,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC1C,2CAA2C;YAC3C,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,IAAI,GAAG,CAAC;YAC9B,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,IAAI,GAAG,CAAC;YAC9B,IAAI,EAAE,KAAK,EAAE;gBAAE,OAAO,EAAE,GAAG,EAAE,CAAC;YAC9B,2DAA2D;YAC3D,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACtC,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACtC,IAAI,MAAM,KAAK,MAAM;gBAAE,OAAO,MAAM,GAAG,MAAM,CAAC;YAC9C,gDAAgD;YAChD,OAAO,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC,CAAC,CAAC;QAEH,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,IAAI;YAAE,MAAM;QACjB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAElB,kCAAkC;QAClC,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1D,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACrD,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACnC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvB,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,MAAM,CAAC;AACf,CAAC;AAED,8EAA8E;AAE9E,SAAS,UAAU,CAClB,MAAc,EACd,OAAkC;IAElC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACjC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,GAAG,GAAG,CAAC,CAAC;AAChB,CAAC;AAED,8EAA8E;AAE9E,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;AAE/C,OAAO,EAAE,UAAU,EAAE,CAAC"}

package/packages/task-compiler/dist/index.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Task Compiler
+ *
+ * Compiles requirements into executable, dependency-aware task graphs.
+ *
+ * @example
+ * import { compileTasks } from "@pi-harness/task-compiler";
+ *
+ * const graph = await compileTasks({
+ *   requirement: compiledRequirement,
+ *   project: projectProfile,
+ *   jobId: "job-001",
+ * });
+ */
+export { SDK_VERSION } from "./types.js";
+export { compileTasks } from "./compiler.js";
+export type { CompiledTask, ComplexityEstimate, DependencyInfo, FileOwnership, FileOwnershipMode, TaskCompileInput, TaskCompilerConfig, TaskGraph, TaskOutput, TaskType, } from "./types.js";
+export { TaskCompilerError, TaskCompilerErrorCode } from "./types.js";
+//# sourceMappingURL=index.d.ts.map

package/packages/task-compiler/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAIzC,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAI7C,YAAY,EACX,YAAY,EACZ,kBAAkB,EAClB,cAAc,EACd,aAAa,EACb,iBAAiB,EACjB,gBAAgB,EAChB,kBAAkB,EAClB,SAAS,EACT,UAAU,EACV,QAAQ,GACR,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC"}