@mjasnikovs/pi-task 0.18.18 → 0.18.19

package/dist/task/auto-io.d.ts

@@ -5,7 +5,16 @@ export interface TaskEntry {
     producedId?: string;
 }
 export declare function allocateAutoId(cwd: string): Promise<string>;
-/** Parse a decompose-phase model output into a clean list of titles. */
+/**
+ * Parse a decompose-phase model output into a clean list of titles.
+ *
+ * No cap: every title the model emits is kept. An arbitrary ceiling (was 30)
+ * silently dropped the tail of a large plan AND re-clipped every coverage retry,
+ * so a design that genuinely needed >N tasks could never escape the ceiling —
+ * it burned its coverage rounds and shipped a knowingly-gapped plan. The real
+ * bound on task count is the design's own grounded-requirement scope, enforced
+ * downstream by the coverage loop; this parser must not pre-empt it.
+ */
 export declare function parseDecomposeList(raw: string): string[];
 /** Parsed DECOMPOSE_COVERAGE_PROMPT verdict. */
 export interface CoverageVerdict {

package/dist/task/auto-io.js

@@ -12,7 +12,6 @@ import { extractSection, parseFrontMatter } from './task-parsers.js';
 import { readTextFile } from '../shared/fs-text.js';
 import { RESUMABLE_STATES } from './task-types.js';
 const AUTO_FILE_RE = /^(TASK_AUTO_\d{4,})\.md$/;
-const MAX_TASKS = 30;
 export async function allocateAutoId(cwd) {
     await ensureTasksDir(cwd);
     const entries = await fsp.readdir(tasksDir(cwd));
@@ -27,15 +26,22 @@ export async function allocateAutoId(cwd) {
     }
     return `TASK_AUTO_${String(max + 1).padStart(4, '0')}`;
 }
-/** Parse a decompose-phase model output into a clean list of titles. */
+/**
+ * Parse a decompose-phase model output into a clean list of titles.
+ *
+ * No cap: every title the model emits is kept. An arbitrary ceiling (was 30)
+ * silently dropped the tail of a large plan AND re-clipped every coverage retry,
+ * so a design that genuinely needed >N tasks could never escape the ceiling —
+ * it burned its coverage rounds and shipped a knowingly-gapped plan. The real
+ * bound on task count is the design's own grounded-requirement scope, enforced
+ * downstream by the coverage loop; this parser must not pre-empt it.
+ */
 export function parseDecomposeList(raw) {
     const out = [];
     for (const line of raw.split('\n')) {
         const m = /^\s*(?:-\s*\[\s*[xX ]?\s*\]\s*|-\s+|\d+[.)]\s+)(.+?)\s*$/.exec(line);
         if (m && m[1].trim().length > 0)
             out.push(m[1].trim());
-        if (out.length >= MAX_TASKS)
-            break;
     }
     return out;
 }

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@mjasnikovs/pi-task",
-    "version": "0.18.18",
+    "version": "0.18.19",
     "description": "Deterministic task planning and spec-orchestration for local models — crash-safe /task pipelines with verify/enforce gates, a real-time remote web view, and web/docs/fetch/worker subagent tools.",
     "type": "module",
     "main": "./dist/index.js",