@gempack/squad-mcp 0.5.0 → 0.6.0

package/dist/tasks/store.js

@@ -0,0 +1,321 @@
+import { promises as fs } from "node:fs";
+import path from "node:path";
+import { z } from "zod";
+import { AGENT_NAMES_TUPLE } from "../config/ownership-matrix.js";
+import { SquadError } from "../errors.js";
+import { logger } from "../observability/logger.js";
+/**
+ * Mutable JSON store for tasks. Lives at `.squad/tasks.json` (path overridable
+ * via `.squad.yaml.tasks.path`). Distinct from learnings/ which is JSONL +
+ * append-only — tasks mutate (status flips, subtasks expand) so JSON with
+ * atomic write (tmp + rename) is the right primitive.
+ *
+ * Schema is small on purpose. Inspired by claude-task-master but adapted to
+ * squad-mcp primitives:
+ *  - `scope`: glob limiting which files this task touches (reuses matchesGlob)
+ *  - `agent_hints`: which advisory agents are relevant for this task
+ *
+ * No `tags` system in V1 — single linear list. Add later if multi-feature
+ * parallel work in the same repo becomes a real need.
+ */
+const taskStatusSchema = z.enum([
+    "pending",
+    "in-progress",
+    "review",
+    "done",
+    "blocked",
+    "cancelled",
+]);
+const taskPrioritySchema = z.enum(["low", "medium", "high"]);
+const subtaskSchema = z.object({
+    id: z.number().int().positive(),
+    title: z.string().min(1).max(512),
+    description: z.string().max(4096).optional(),
+    status: taskStatusSchema,
+    dependencies: z.array(z.number().int().positive()).max(50).default([]),
+    details: z.string().max(8192).optional(),
+});
+const taskSchema = z.object({
+    id: z.number().int().positive(),
+    title: z.string().min(1).max(512),
+    description: z.string().max(4096).optional(),
+    status: taskStatusSchema,
+    dependencies: z.array(z.number().int().positive()).max(50).default([]),
+    priority: taskPrioritySchema.default("medium"),
+    details: z.string().max(16384).optional(),
+    test_strategy: z.string().max(4096).optional(),
+    /**
+     * Glob limiting which files belong to this task (e.g. "src/auth/**"). Used
+     * by slice_files_for_task. Optional — without scope, the task is repo-wide.
+     */
+    scope: z.string().min(1).max(512).optional(),
+    /**
+     * Subset of squad agents most relevant for this task. Used by /squad-task
+     * to narrow the advisory squad. Optional — without hints, the task uses
+     * the standard select_squad heuristic.
+     */
+    agent_hints: z
+        .array(z.enum(AGENT_NAMES_TUPLE))
+        .max(AGENT_NAMES_TUPLE.length)
+        .optional(),
+    subtasks: z.array(subtaskSchema).max(50).default([]),
+    /** ISO timestamp set on first record. */
+    created_at: z.string().min(1).max(40),
+    /** ISO timestamp updated on every mutation (status change, subtask add, etc). */
+    updated_at: z.string().min(1).max(40),
+});
+const tasksFileSchema = z.object({
+    /** Schema version — bump when breaking changes ship. Readers reject newer versions. */
+    version: z.literal(1).default(1),
+    tasks: z.array(taskSchema).max(2000),
+});
+export const DEFAULT_TASKS_PATH = ".squad/tasks.json";
+const cache = new Map();
+export function __resetTasksStoreCacheForTests() {
+    cache.clear();
+}
+function resolveTasksFile(workspaceRoot, configuredPath) {
+    return path.resolve(workspaceRoot, configuredPath ?? DEFAULT_TASKS_PATH);
+}
+const EMPTY_FILE = { version: 1, tasks: [] };
+/**
+ * Read tasks.json. Returns an empty file shape if the file does not exist
+ * (a fresh repo with no tasks is the common case). Cached by mtime.
+ */
+export async function readTasks(workspaceRoot, options = {}) {
+    const filePath = resolveTasksFile(workspaceRoot, options.configuredPath);
+    const absRoot = path.resolve(workspaceRoot);
+    let stat;
+    try {
+        stat = await fs.stat(filePath);
+    }
+    catch {
+        return EMPTY_FILE;
+    }
+    if (!stat.isFile()) {
+        return EMPTY_FILE;
+    }
+    const cached = cache.get(absRoot);
+    if (cached &&
+        cached.filePath === filePath &&
+        cached.mtimeMs === stat.mtimeMs) {
+        return cached.data;
+    }
+    let raw;
+    try {
+        raw = await fs.readFile(filePath, "utf8");
+    }
+    catch (err) {
+        throw new SquadError("CONFIG_READ_FAILED", `failed to read tasks file ${filePath}: ${err.message}`, { source: filePath });
+    }
+    let parsed;
+    try {
+        parsed = JSON.parse(raw);
+    }
+    catch (err) {
+        throw new SquadError("INVALID_INPUT", `${filePath}: invalid JSON: ${err.message}`, { source: filePath });
+    }
+    const validated = tasksFileSchema.safeParse(parsed);
+    if (!validated.success) {
+        throw new SquadError("INVALID_INPUT", `${filePath}: schema violation: ${validated.error.message}`, { source: filePath, issues: validated.error.issues.length });
+    }
+    cache.set(absRoot, {
+        mtimeMs: stat.mtimeMs,
+        filePath,
+        data: validated.data,
+    });
+    return validated.data;
+}
+/**
+ * Atomic write: serialise to a tmp file in the same directory, then rename
+ * over the target. Rename is atomic on POSIX within the same filesystem.
+ * Stable key order + 2-space indent so git diffs stay readable.
+ */
+async function writeTasks(workspaceRoot, data, configuredPath) {
+    const filePath = resolveTasksFile(workspaceRoot, configuredPath);
+    const dir = path.dirname(filePath);
+    await fs.mkdir(dir, { recursive: true });
+    const validated = tasksFileSchema.safeParse(data);
+    if (!validated.success) {
+        throw new SquadError("INVALID_INPUT", `tasks schema violation: ${validated.error.message}`, { issues: validated.error.issues.length });
+    }
+    const ordered = orderTasksFile(validated.data);
+    const tmp = `${filePath}.tmp.${process.pid}.${Date.now()}`;
+    await fs.writeFile(tmp, JSON.stringify(ordered, null, 2) + "\n", "utf8");
+    await fs.rename(tmp, filePath);
+    // Invalidate cache.
+    cache.delete(path.resolve(workspaceRoot));
+    return filePath;
+}
+function orderTasksFile(data) {
+    return {
+        version: data.version,
+        tasks: [...data.tasks]
+            .sort((a, b) => a.id - b.id)
+            .map((t) => ({
+            ...t,
+            subtasks: [...t.subtasks].sort((a, b) => a.id - b.id),
+        })),
+    };
+}
+/**
+ * Bulk-add tasks. Allocates ids sequentially when not supplied. Validates that
+ * supplied ids are unique and that all dependencies refer to ids that exist
+ * either in the existing file or in the same batch.
+ *
+ * Returns the IDs of the tasks that were appended (in input order).
+ */
+export async function recordTasks(workspaceRoot, inputs, options = {}) {
+    if (inputs.length === 0) {
+        throw new SquadError("INVALID_INPUT", "recordTasks requires at least one task");
+    }
+    const current = await readTasks(workspaceRoot, options);
+    const existingIds = new Set(current.tasks.map((t) => t.id));
+    const allIds = new Set(existingIds);
+    const ts = new Date().toISOString();
+    const newTasks = [];
+    let cursor = current.tasks.reduce((m, t) => Math.max(m, t.id), 0);
+    for (const input of inputs) {
+        let id = input.id;
+        if (id === undefined) {
+            cursor += 1;
+            id = cursor;
+        }
+        else {
+            if (allIds.has(id)) {
+                throw new SquadError("INVALID_INPUT", `duplicate task id ${id} (already exists in store or batch)`);
+            }
+            cursor = Math.max(cursor, id);
+        }
+        allIds.add(id);
+        const task = {
+            id,
+            title: input.title,
+            ...(input.description !== undefined && {
+                description: input.description,
+            }),
+            status: "pending",
+            dependencies: input.dependencies ?? [],
+            priority: input.priority ?? "medium",
+            ...(input.details !== undefined && { details: input.details }),
+            ...(input.test_strategy !== undefined && {
+                test_strategy: input.test_strategy,
+            }),
+            ...(input.scope !== undefined && { scope: input.scope }),
+            ...(input.agent_hints !== undefined && {
+                agent_hints: input.agent_hints,
+            }),
+            subtasks: [],
+            created_at: ts,
+            updated_at: ts,
+        };
+        newTasks.push(task);
+    }
+    // Validate dependencies after id allocation so forward references in the
+    // batch resolve correctly.
+    for (const t of newTasks) {
+        for (const dep of t.dependencies) {
+            if (!allIds.has(dep)) {
+                throw new SquadError("INVALID_INPUT", `task ${t.id} depends on unknown id ${dep}`);
+            }
+            if (dep === t.id) {
+                throw new SquadError("INVALID_INPUT", `task ${t.id} cannot depend on itself`);
+            }
+        }
+    }
+    const next = {
+        version: current.version,
+        tasks: [...current.tasks, ...newTasks],
+    };
+    const filePath = await writeTasks(workspaceRoot, next, options.configuredPath);
+    logger.info("tasks recorded", {
+        details: { count: newTasks.length, file: filePath },
+    });
+    return { filePath, ids: newTasks.map((t) => t.id) };
+}
+/**
+ * Update task status (or subtask status when subtask_id is provided). Stamps
+ * updated_at. Returns the updated task. Throws if the id is not found.
+ */
+export async function updateTaskStatus(workspaceRoot, taskId, status, options = {}) {
+    const current = await readTasks(workspaceRoot, options);
+    const idx = current.tasks.findIndex((t) => t.id === taskId);
+    if (idx < 0) {
+        throw new SquadError("INVALID_INPUT", `task ${taskId} not found`);
+    }
+    const ts = new Date().toISOString();
+    const original = current.tasks[idx];
+    let updated;
+    if (options.subtaskId !== undefined) {
+        const sIdx = original.subtasks.findIndex((s) => s.id === options.subtaskId);
+        if (sIdx < 0) {
+            throw new SquadError("INVALID_INPUT", `subtask ${options.subtaskId} not found on task ${taskId}`);
+        }
+        const newSubtasks = [...original.subtasks];
+        newSubtasks[sIdx] = { ...newSubtasks[sIdx], status };
+        updated = { ...original, subtasks: newSubtasks, updated_at: ts };
+    }
+    else {
+        updated = { ...original, status, updated_at: ts };
+    }
+    const nextTasks = [...current.tasks];
+    nextTasks[idx] = updated;
+    const filePath = await writeTasks(workspaceRoot, { version: current.version, tasks: nextTasks }, options.configuredPath);
+    logger.info("task status updated", {
+        details: {
+            task: taskId,
+            ...(options.subtaskId !== undefined && { subtask: options.subtaskId }),
+            status,
+        },
+    });
+    return { filePath, task: updated };
+}
+/**
+ * Append subtasks to an existing task. Allocates subtask ids sequentially
+ * starting from `max(existing.subtasks.id) + 1`. Mechanical only — no LLM
+ * decomposition here. The host LLM is responsible for generating the subtask
+ * inputs (typically via a future compose_task_expand prompt-pattern).
+ */
+export async function expandTask(workspaceRoot, taskId, subtasks, options = {}) {
+    if (subtasks.length === 0) {
+        throw new SquadError("INVALID_INPUT", "expandTask requires at least one subtask");
+    }
+    const current = await readTasks(workspaceRoot, options);
+    const idx = current.tasks.findIndex((t) => t.id === taskId);
+    if (idx < 0) {
+        throw new SquadError("INVALID_INPUT", `task ${taskId} not found`);
+    }
+    const original = current.tasks[idx];
+    let cursor = original.subtasks.reduce((m, s) => Math.max(m, s.id), 0);
+    const ts = new Date().toISOString();
+    const newSubs = subtasks.map((s) => {
+        cursor += 1;
+        return {
+            id: cursor,
+            title: s.title,
+            ...(s.description !== undefined && { description: s.description }),
+            status: "pending",
+            dependencies: s.dependencies ?? [],
+            ...(s.details !== undefined && { details: s.details }),
+        };
+    });
+    const updated = {
+        ...original,
+        subtasks: [...original.subtasks, ...newSubs],
+        updated_at: ts,
+    };
+    // Validate that all subtask deps point at sibling subtasks that exist.
+    const siblingIds = new Set(updated.subtasks.map((s) => s.id));
+    for (const s of newSubs) {
+        for (const dep of s.dependencies) {
+            if (!siblingIds.has(dep)) {
+                throw new SquadError("INVALID_INPUT", `subtask ${s.id} depends on unknown sibling ${dep}`);
+            }
+        }
+    }
+    const nextTasks = [...current.tasks];
+    nextTasks[idx] = updated;
+    const filePath = await writeTasks(workspaceRoot, { version: current.version, tasks: nextTasks }, options.configuredPath);
+    return { filePath, task: updated };
+}
+//# sourceMappingURL=store.js.map

package/dist/tasks/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../../src/tasks/store.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AAEpD;;;;;;;;;;;;;GAaG;AAEH,MAAM,gBAAgB,GAAG,CAAC,CAAC,IAAI,CAAC;IAC9B,SAAS;IACT,aAAa;IACb,QAAQ;IACR,MAAM;IACN,SAAS;IACT,WAAW;CACZ,CAAC,CAAC;AAGH,MAAM,kBAAkB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;AAG7D,MAAM,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7B,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IAC/B,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;IACjC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE;IAC5C,MAAM,EAAE,gBAAgB;IACxB,YAAY,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;IACtE,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE;CACzC,CAAC,CAAC;AAGH,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1B,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IAC/B,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;IACjC,WAAW,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE;IAC5C,MAAM,EAAE,gBAAgB;IACxB,YAAY,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;IACtE,QAAQ,EAAE,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC9C,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE;IACzC,aAAa,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE;IAC9C;;;OAGG;IACH,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;IAC5C;;;;OAIG;IACH,WAAW,EAAE,CAAC;SACX,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;SAChC,GAAG,CAAC,iBAAiB,CAAC,MAAM,CAAC;SAC7B,QAAQ,EAAE;IACb,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;IACpD,yCAAyC;IACzC,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;IACrC,iFAAiF;IACjF,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;CACtC,CAAC,CAAC;AAGH,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,CAAC;IAC/B,uFAAuF;IACvF,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IAChC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;CACrC,CAAC,CAAC;AAGH,MAAM,CAAC,MAAM,kBAAkB,GAAG,mBAAmB,CAAC;AAOtD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;AAE5C,MAAM,UAAU,8BAA8B;IAC5C,KAAK,CAAC,KAAK,EAAE,CAAC;AAChB,CAAC;AAED,SAAS,gBAAgB,CACvB,aAAqB,EACrB,cAAkC;IAElC,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,cAAc,IAAI,kBAAkB,CAAC,CAAC;AAC3E,CAAC;AAED,MAAM,UAAU,GAAc,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;AAExD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,aAAqB,EACrB,UAAuC,EAAE;IAEzC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,aAAa,EAAE,OAAO,CAAC,cAAc,CAAC,CAAC;IACzE,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IAE5C,IAAI,IAAI,CAAC;IACT,IAAI,CAAC;QACH,IAAI,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QACnB,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAClC,IACE,MAAM;QACN,MAAM,CAAC,QAAQ,KAAK,QAAQ;QAC5B,MAAM,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO,EAC/B,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC;IACrB,CAAC;IAED,IAAI,GAAW,CAAC;IAChB,IAAI,CAAC;QACH,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC5C,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,IAAI,UAAU,CAClB,oBAAoB,EACpB,6BAA6B,QAAQ,KAAM,GAAa,CAAC,OAAO,EAAE,EAClE,EAAE,MAAM,EAAE,QAAQ,EAAE,CACrB,CAAC;IACJ,CAAC;IAED,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,IAAI,UAAU,CAClB,eAAe,EACf,GAAG,QAAQ,mBAAoB,GAAa,CAAC,OAAO,EAAE,EACtD,EAAE,MAAM,EAAE,QAAQ,EAAE,CACrB,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACpD,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QACvB,MAAM,IAAI,UAAU,CAClB,eAAe,EACf,GAAG,QAAQ,uBAAuB,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAC3D,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAC5D,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE;QACjB,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,QAAQ;QACR,IAAI,EAAE,SAAS,CAAC,IAAI;KACrB,CAAC,CAAC;IACH,OAAO,SAAS,CAAC,IAAI,CAAC;AACxB,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,UAAU,CACvB,aAAqB,EACrB,IAAe,EACf,cAAuB;IAEvB,MAAM,QAAQ,GAAG,gBAAgB,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;IACjE,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACnC,MAAM,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAEzC,MAAM,SAAS,GAAG,eAAe,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAClD,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QACvB,MAAM,IAAI,UAAU,CAClB,eAAe,EACf,2BAA2B,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EACpD,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAC1C,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAG,cAAc,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,GAAG,GAAG,GAAG,QAAQ,QAAQ,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;IAC3D,MAAM,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC;IACzE,MAAM,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAE/B,oBAAoB;IACpB,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC;IAC1C,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,cAAc,CAAC,IAAe;IACrC,OAAO;QACL,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;aACnB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;aAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACX,GAAG,CAAC;YACJ,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;SACtD,CAAC,CAAC;KACN,CAAC;AACJ,CAAC;AAeD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,aAAqB,EACrB,MAAyB,EACzB,UAAuC,EAAE;IAEzC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,UAAU,CAClB,eAAe,EACf,wCAAwC,CACzC,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IACxD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IAEpC,MAAM,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,QAAQ,GAAW,EAAE,CAAC;IAC5B,IAAI,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAElE,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QAClB,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,MAAM,IAAI,CAAC,CAAC;YACZ,EAAE,GAAG,MAAM,CAAC;QACd,CAAC;aAAM,CAAC;YACN,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACnB,MAAM,IAAI,UAAU,CAClB,eAAe,EACf,qBAAqB,EAAE,qCAAqC,CAC7D,CAAC;YACJ,CAAC;YACD,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAChC,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEf,MAAM,IAAI,GAAS;YACjB,EAAE;YACF,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,GAAG,CAAC,KAAK,CAAC,WAAW,KAAK,SAAS,IAAI;gBACrC,WAAW,EAAE,KAAK,CAAC,WAAW;aAC/B,CAAC;YACF,MAAM,EAAE,SAAS;YACjB,YAAY,EAAE,KAAK,CAAC,YAAY,IAAI,EAAE;YACtC,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,QAAQ;YACpC,GAAG,CAAC,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC;YAC9D,GAAG,CAAC,KAAK,CAAC,aAAa,KAAK,SAAS,IAAI;gBACvC,aAAa,EAAE,KAAK,CAAC,aAAa;aACnC,CAAC;YACF,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;YACxD,GAAG,CAAC,KAAK,CAAC,WAAW,KAAK,SAAS,IAAI;gBACrC,WAAW,EAAE,KAAK,CAAC,WAAW;aAC/B,CAAC;YACF,QAAQ,EAAE,EAAE;YACZ,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,EAAE;SACf,CAAC;QACF,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IAED,yEAAyE;IACzE,2BAA2B;IAC3B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrB,MAAM,IAAI,UAAU,CAClB,eAAe,EACf,QAAQ,CAAC,CAAC,EAAE,0BAA0B,GAAG,EAAE,CAC5C,CAAC;YACJ,CAAC;YACD,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;gBACjB,MAAM,IAAI,UAAU,CAClB,eAAe,EACf,QAAQ,CAAC,CAAC,EAAE,0BAA0B,CACvC,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAc;QACtB,OAAO,EAAE,OAAO,CAAC,OAAO;QACxB,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,KAAK,EAAE,GAAG,QAAQ,CAAC;KACvC,CAAC;IACF,MAAM,QAAQ,GAAG,MAAM,UAAU,CAC/B,aAAa,EACb,IAAI,EACJ,OAAO,CAAC,cAAc,CACvB,CAAC;IAEF,MAAM,CAAC,IAAI,CAAC,gBAAgB,EAAE;QAC5B,OAAO,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE;KACpD,CAAC,CAAC;IAEH,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AACtD,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,aAAqB,EACrB,MAAc,EACd,MAAkB,EAClB,UAA2D,EAAE;IAE7D,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IACxD,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAC5D,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QACZ,MAAM,IAAI,UAAU,CAAC,eAAe,EAAE,QAAQ,MAAM,YAAY,CAAC,CAAC;IACpE,CAAC;IACD,MAAM,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAE,CAAC;IACrC,IAAI,OAAa,CAAC;IAElB,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,SAAS,CAAC,CAAC;QAC5E,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,IAAI,UAAU,CAClB,eAAe,EACf,WAAW,OAAO,CAAC,SAAS,sBAAsB,MAAM,EAAE,CAC3D,CAAC;QACJ,CAAC;QACD,MAAM,WAAW,GAAG,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC3C,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,WAAW,CAAC,IAAI,CAAE,EAAE,MAAM,EAAE,CAAC;QACtD,OAAO,GAAG,EAAE,GAAG,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IACnE,CAAC;SAAM,CAAC;QACN,OAAO,GAAG,EAAE,GAAG,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IACpD,CAAC;IAED,MAAM,SAAS,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IACrC,SAAS,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;IACzB,MAAM,QAAQ,GAAG,MAAM,UAAU,CAC/B,aAAa,EACb,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,EAC9C,OAAO,CAAC,cAAc,CACvB,CAAC;IAEF,MAAM,CAAC,IAAI,CAAC,qBAAqB,EAAE;QACjC,OAAO,EAAE;YACP,IAAI,EAAE,MAAM;YACZ,GAAG,CAAC,OAAO,CAAC,SAAS,KAAK,SAAS,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC;YACtE,MAAM;SACP;KACF,CAAC,CAAC;IAEH,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AACrC,CAAC;AASD;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,aAAqB,EACrB,MAAc,EACd,QAAwB,EACxB,UAAuC,EAAE;IAEzC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,UAAU,CAClB,eAAe,EACf,0CAA0C,CAC3C,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IACxD,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;IAC5D,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QACZ,MAAM,IAAI,UAAU,CAAC,eAAe,EAAE,QAAQ,MAAM,YAAY,CAAC,CAAC;IACpE,CAAC;IACD,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAE,CAAC;IAErC,IAAI,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,MAAM,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,OAAO,GAAc,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5C,MAAM,IAAI,CAAC,CAAC;QACZ,OAAO;YACL,EAAE,EAAE,MAAM;YACV,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,GAAG,CAAC,CAAC,CAAC,WAAW,KAAK,SAAS,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;YAClE,MAAM,EAAE,SAAkB;YAC1B,YAAY,EAAE,CAAC,CAAC,YAAY,IAAI,EAAE;YAClC,GAAG,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;SACvD,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,OAAO,GAAS;QACpB,GAAG,QAAQ;QACX,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC,QAAQ,EAAE,GAAG,OAAO,CAAC;QAC5C,UAAU,EAAE,EAAE;KACf,CAAC;IAEF,uEAAuE;IACvE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9D,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;YACjC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,MAAM,IAAI,UAAU,CAClB,eAAe,EACf,WAAW,CAAC,CAAC,EAAE,+BAA+B,GAAG,EAAE,CACpD,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IACrC,SAAS,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;IACzB,MAAM,QAAQ,GAAG,MAAM,UAAU,CAC/B,aAAa,EACb,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,EAC9C,OAAO,CAAC,cAAc,CACvB,CAAC;IAEF,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AACrC,CAAC"}

package/dist/tools/compose-advisory-bundle.d.ts

@@ -1,8 +1,8 @@
-import { z } from 'zod';
-import type { ToolDef } from './registry.js';
-import { type ComposeWorkflowOutput } from './compose-squad-workflow.js';
-import { type SliceOutput } from './slice-files.js';
-import { type ValidatePlanOutput } from './validate-plan-text.js';
+import { z } from "zod";
+import type { ToolDef } from "./registry.js";
+import { type ComposeWorkflowOutput } from "./compose-squad-workflow.js";
+import { type SliceOutput } from "./slice-files.js";
+import { type ValidatePlanOutput } from "./validate-plan-text.js";
 declare const schema: z.ZodObject<{
     workspace_root: z.ZodEffects<z.ZodString, string, string>;
     user_prompt: z.ZodEffects<z.ZodString, string, string>;

package/dist/tools/compose-advisory-bundle.js

@@ -1,12 +1,12 @@
-import { z } from 'zod';
-import { composeSquadWorkflow } from './compose-squad-workflow.js';
-import { sliceFilesForAgent } from './slice-files.js';
-import { validatePlanText } from './validate-plan-text.js';
-import { AGENT_NAMES_TUPLE } from '../config/ownership-matrix.js';
+import { z } from "zod";
+import { composeSquadWorkflow, } from "./compose-squad-workflow.js";
+import { sliceFilesForAgent } from "./slice-files.js";
+import { validatePlanText, } from "./validate-plan-text.js";
+import { AGENT_NAMES_TUPLE } from "../config/ownership-matrix.js";
 const safeString = (max) => z
     .string()
     .max(max)
-    .refine((s) => s.indexOf(' ') === -1, 'must not contain NUL byte');
+    .refine((s) => s.indexOf(" ") === -1, "must not contain NUL byte");
 const schema = z.object({
     workspace_root: safeString(4096),
     user_prompt: safeString(8192),
@@ -15,7 +15,14 @@ const schema = z.object({
     staged_only: z.boolean().optional().default(false),
     read_content: z.boolean().optional().default(true),
     force_work_type: z
-        .enum(['Feature', 'Bug Fix', 'Refactor', 'Performance', 'Security', 'Business Rule'])
+        .enum([
+        "Feature",
+        "Bug Fix",
+        "Refactor",
+        "Performance",
+        "Security",
+        "Business Rule",
+    ])
         .optional(),
     force_agents: z.array(z.enum(AGENT_NAMES_TUPLE)).optional().default([]),
     risk_signals: z
@@ -43,7 +50,12 @@ export async function composeAdvisoryBundle(input) {
     if (input.risk_signals !== undefined)
         workflowInput.risk_signals = input.risk_signals;
     const workflow = await composeSquadWorkflow(workflowInput);
-    const filePaths = workflow.changed_files.files.map((f) => f.path);
+    // Use the FILTERED list (skip_paths already applied by composeSquadWorkflow).
+    // Slicing has to operate on the same set of files the squad was selected over,
+    // otherwise an agent would receive paths the composer just hid.
+    const allChanged = workflow.changed_files.files.map((f) => f.path);
+    const skippedSet = new Set(workflow.skipped_paths);
+    const filePaths = allChanged.filter((p) => !skippedSet.has(p));
     const slices_by_agent = {};
     for (const agent of workflow.squad.agents) {
         const slice = await sliceFilesForAgent({
@@ -58,10 +70,10 @@ export async function composeAdvisoryBundle(input) {
     return { workflow, slices_by_agent, plan_validation };
 }
 export const composeAdvisoryBundleTool = {
-    name: 'compose_advisory_bundle',
-    description: 'End-to-end advisory dispatch bundle. Runs compose_squad_workflow, then slice_files_for_agent for each ' +
-        'selected agent, then validate_plan_text on the supplied plan. Returns the union output ready for the ' +
-        'host to dispatch parallel advisory reviews.',
+    name: "compose_advisory_bundle",
+    description: "End-to-end advisory dispatch bundle. Runs compose_squad_workflow, then slice_files_for_agent for each " +
+        "selected agent, then validate_plan_text on the supplied plan. Returns the union output ready for the " +
+        "host to dispatch parallel advisory reviews.",
     schema,
     handler: composeAdvisoryBundle,
 };

package/dist/tools/compose-advisory-bundle.js.map

@@ -1 +1 @@
-{"version":3,"file":"compose-advisory-bundle.js","sourceRoot":"","sources":["../../src/tools/compose-advisory-bundle.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,oBAAoB,EAA8B,MAAM,6BAA6B,CAAC;AAC/F,OAAO,EAAE,kBAAkB,EAAoB,MAAM,kBAAkB,CAAC;AACxE,OAAO,EAAE,gBAAgB,EAA2B,MAAM,yBAAyB,CAAC;AACpF,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAElE,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,EAAE,CACjC,CAAC;KACE,MAAM,EAAE;KACR,GAAG,CAAC,GAAG,CAAC;KACR,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,2BAA2B,CAAC,CAAC;AAEvE,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IACtB,cAAc,EAAE,UAAU,CAAC,IAAI,CAAC;IAChC,WAAW,EAAE,UAAU,CAAC,IAAI,CAAC;IAC7B,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC;IAC5B,QAAQ,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;IACpC,WAAW,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC;IAClD,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;IAClD,eAAe,EAAE,CAAC;SACf,IAAI,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,aAAa,EAAE,UAAU,EAAE,eAAe,CAAC,CAAC;SACpF,QAAQ,EAAE;IACb,YAAY,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;IACvE,YAAY,EAAE,CAAC;SACZ,MAAM,CAAC;QACN,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;QACpC,aAAa,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;QACrC,iBAAiB,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;QACzC,UAAU,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;QAClC,mBAAmB,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;KAC5C,CAAC;SACD,QAAQ,EAAE;CACd,CAAC,CAAC;AAUH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,KAAY;IACtD,MAAM,aAAa,GAA+C;QAChE,cAAc,EAAE,KAAK,CAAC,cAAc;QACpC,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,YAAY,EAAE,KAAK,CAAC,YAAY;QAChC,YAAY,EAAE,KAAK,CAAC,YAAY;KACjC,CAAC;IACF,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,aAAa,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;IAC1E,IAAI,KAAK,CAAC,eAAe,KAAK,SAAS;QAAE,aAAa,CAAC,eAAe,GAAG,KAAK,CAAC,eAAe,CAAC;IAC/F,IAAI,KAAK,CAAC,YAAY,KAAK,SAAS;QAAE,aAAa,CAAC,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC;IAEtF,MAAM,QAAQ,GAAG,MAAM,oBAAoB,CAAC,aAAa,CAAC,CAAC;IAC3D,MAAM,SAAS,GAAG,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAElE,MAAM,eAAe,GAAgC,EAAE,CAAC;IACxD,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC;YACrC,KAAK;YACL,KAAK,EAAE,SAAS;YAChB,YAAY,EAAE,KAAK,CAAC,YAAY;YAChC,cAAc,EAAE,KAAK,CAAC,cAAc;SACrC,CAAC,CAAC;QACH,eAAe,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IACjC,CAAC;IAED,MAAM,eAAe,GAAG,gBAAgB,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAE/D,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,eAAe,EAAE,CAAC;AACxD,CAAC;AAED,MAAM,CAAC,MAAM,yBAAyB,GAA2B;IAC/D,IAAI,EAAE,yBAAyB;IAC/B,WAAW,EACT,wGAAwG;QACxG,uGAAuG;QACvG,6CAA6C;IAC/C,MAAM;IACN,OAAO,EAAE,qBAAqB;CAC/B,CAAC"}
+{"version":3,"file":"compose-advisory-bundle.js","sourceRoot":"","sources":["../../src/tools/compose-advisory-bundle.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EACL,oBAAoB,GAErB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,kBAAkB,EAAoB,MAAM,kBAAkB,CAAC;AACxE,OAAO,EACL,gBAAgB,GAEjB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAElE,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,EAAE,CACjC,CAAC;KACE,MAAM,EAAE;KACR,GAAG,CAAC,GAAG,CAAC;KACR,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,2BAA2B,CAAC,CAAC;AAEvE,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IACtB,cAAc,EAAE,UAAU,CAAC,IAAI,CAAC;IAChC,WAAW,EAAE,UAAU,CAAC,IAAI,CAAC;IAC7B,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC;IAC5B,QAAQ,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;IACpC,WAAW,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC;IAClD,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;IAClD,eAAe,EAAE,CAAC;SACf,IAAI,CAAC;QACJ,SAAS;QACT,SAAS;QACT,UAAU;QACV,aAAa;QACb,UAAU;QACV,eAAe;KAChB,CAAC;SACD,QAAQ,EAAE;IACb,YAAY,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;IACvE,YAAY,EAAE,CAAC;SACZ,MAAM,CAAC;QACN,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;QACpC,aAAa,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;QACrC,iBAAiB,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;QACzC,UAAU,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;QAClC,mBAAmB,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE;KAC5C,CAAC;SACD,QAAQ,EAAE;CACd,CAAC,CAAC;AAUH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,KAAY;IAEZ,MAAM,aAAa,GAA+C;QAChE,cAAc,EAAE,KAAK,CAAC,cAAc;QACpC,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,YAAY,EAAE,KAAK,CAAC,YAAY;QAChC,YAAY,EAAE,KAAK,CAAC,YAAY;KACjC,CAAC;IACF,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;QAAE,aAAa,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;IAC1E,IAAI,KAAK,CAAC,eAAe,KAAK,SAAS;QACrC,aAAa,CAAC,eAAe,GAAG,KAAK,CAAC,eAAe,CAAC;IACxD,IAAI,KAAK,CAAC,YAAY,KAAK,SAAS;QAClC,aAAa,CAAC,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC;IAElD,MAAM,QAAQ,GAAG,MAAM,oBAAoB,CAAC,aAAa,CAAC,CAAC;IAE3D,8EAA8E;IAC9E,+EAA+E;IAC/E,gEAAgE;IAChE,MAAM,UAAU,GAAG,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;IACnD,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/D,MAAM,eAAe,GAAgC,EAAE,CAAC;IACxD,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC;YACrC,KAAK;YACL,KAAK,EAAE,SAAS;YAChB,YAAY,EAAE,KAAK,CAAC,YAAY;YAChC,cAAc,EAAE,KAAK,CAAC,cAAc;SACrC,CAAC,CAAC;QACH,eAAe,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IACjC,CAAC;IAED,MAAM,eAAe,GAAG,gBAAgB,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAE/D,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,eAAe,EAAE,CAAC;AACxD,CAAC;AAED,MAAM,CAAC,MAAM,yBAAyB,GAA2B;IAC/D,IAAI,EAAE,yBAAyB;IAC/B,WAAW,EACT,wGAAwG;QACxG,uGAAuG;QACvG,6CAA6C;IAC/C,MAAM;IACN,OAAO,EAAE,qBAAqB;CAC/B,CAAC"}

package/dist/tools/compose-prd-parse.d.ts

@@ -0,0 +1,53 @@
+import { z } from "zod";
+import type { ToolDef } from "./registry.js";
+declare const schema: z.ZodObject<{
+    workspace_root: z.ZodString;
+    /** PRD text. Free-form; the LLM is responsible for extracting structure. */
+    prd_text: z.ZodString;
+    /** Optional max number of tasks to extract (soft hint passed to the LLM). */
+    max_tasks: z.ZodDefault<z.ZodOptional<z.ZodNumber>>;
+    /**
+     * When true (default), include the existing tasks in the prompt so the LLM
+     * doesn't duplicate ids or re-decompose work already captured.
+     */
+    include_existing: z.ZodDefault<z.ZodOptional<z.ZodBoolean>>;
+}, "strip", z.ZodTypeAny, {
+    workspace_root: string;
+    prd_text: string;
+    max_tasks: number;
+    include_existing: boolean;
+}, {
+    workspace_root: string;
+    prd_text: string;
+    max_tasks?: number | undefined;
+    include_existing?: boolean | undefined;
+}>;
+type Input = z.infer<typeof schema>;
+export interface ComposePrdParseOutput {
+    /** Markdown prompt to feed to the host LLM. */
+    prompt: string;
+    /** JSON schema the LLM is instructed to emit. Caller validates against this. */
+    output_schema: Record<string, unknown>;
+    /** Existing tasks, injected into the prompt and returned for caller convenience. */
+    existing: {
+        id: number;
+        title: string;
+        status: string;
+    }[];
+    /** Highest existing id, so caller can pre-allocate or warn the LLM. */
+    next_id_floor: number;
+    /** Recommended next step (string, for the host LLM): call record_tasks. */
+    next_action: "call_record_tasks_with_user_confirmation";
+}
+/**
+ * Build the prompt + output schema for decomposing a PRD into squad-mcp tasks.
+ * Pure-MCP: this tool does NOT call any LLM. It returns the materials the host
+ * LLM (Claude Code, Cursor, etc.) needs to do the decomposition itself, and
+ * then call `record_tasks` with the result.
+ *
+ * Why pure-MCP: keeps squad-mcp deterministic and free of provider keys; the
+ * host already pays for inference and has the user's consent to do so.
+ */
+export declare function composePrdParseTool(input: Input): Promise<ComposePrdParseOutput>;
+export declare const composePrdParseToolDef: ToolDef<typeof schema>;
+export {};

package/dist/tools/compose-prd-parse.js

@@ -0,0 +1,167 @@
+import { z } from "zod";
+import { readTasks } from "../tasks/store.js";
+import { readSquadYaml } from "../config/squad-yaml.js";
+import { resolveSafePath, createSafePathContext } from "../util/path-safety.js";
+import { AGENT_NAMES_TUPLE } from "../config/ownership-matrix.js";
+const schema = z.object({
+    workspace_root: z.string().min(1).max(4096),
+    /** PRD text. Free-form; the LLM is responsible for extracting structure. */
+    prd_text: z.string().min(1).max(200_000),
+    /** Optional max number of tasks to extract (soft hint passed to the LLM). */
+    max_tasks: z.number().int().positive().max(200).optional().default(40),
+    /**
+     * When true (default), include the existing tasks in the prompt so the LLM
+     * doesn't duplicate ids or re-decompose work already captured.
+     */
+    include_existing: z.boolean().optional().default(true),
+});
+const TASK_INPUT_SCHEMA = {
+    type: "object",
+    properties: {
+        title: { type: "string", maxLength: 512 },
+        description: { type: "string", maxLength: 4096 },
+        dependencies: {
+            type: "array",
+            items: { type: "integer", minimum: 1 },
+            description: "Task IDs this task depends on. May reference existing tasks or other tasks in the same parsed batch (forward refs allowed — IDs assigned by record_tasks in array order starting from next_id_floor + 1).",
+        },
+        priority: { type: "string", enum: ["low", "medium", "high"] },
+        details: { type: "string", maxLength: 16384 },
+        test_strategy: { type: "string", maxLength: 4096 },
+        scope: {
+            type: "string",
+            maxLength: 512,
+            description: "Glob limiting which files this task touches (e.g. 'src/auth/**'). Optional. Used by slice_files_for_task and the advisory squad to narrow review.",
+        },
+        agent_hints: {
+            type: "array",
+            items: { type: "string", enum: AGENT_NAMES_TUPLE },
+            description: "Subset of squad agents most relevant for this task. Empty/absent means repo-wide.",
+        },
+    },
+    required: ["title"],
+};
+const OUTPUT_SCHEMA = {
+    type: "object",
+    properties: {
+        tasks: {
+            type: "array",
+            items: TASK_INPUT_SCHEMA,
+            maxItems: 200,
+        },
+    },
+    required: ["tasks"],
+};
+function renderExisting(existing) {
+    if (existing.length === 0) {
+        return "_(no existing tasks — this is a fresh decomposition)_";
+    }
+    const lines = existing.map((t) => `- ${t.id}. [${t.status}] ${t.title}`);
+    return lines.join("\n");
+}
+/**
+ * Build the prompt + output schema for decomposing a PRD into squad-mcp tasks.
+ * Pure-MCP: this tool does NOT call any LLM. It returns the materials the host
+ * LLM (Claude Code, Cursor, etc.) needs to do the decomposition itself, and
+ * then call `record_tasks` with the result.
+ *
+ * Why pure-MCP: keeps squad-mcp deterministic and free of provider keys; the
+ * host already pays for inference and has the user's consent to do so.
+ */
+export async function composePrdParseTool(input) {
+    const ctx = createSafePathContext();
+    const safeRoot = await resolveSafePath(input.workspace_root, ".", ctx);
+    const config = await readSquadYaml(safeRoot);
+    const existingFile = input.include_existing
+        ? await readTasks(safeRoot, { configuredPath: config.tasks.path })
+        : { tasks: [], version: 1 };
+    const nextIdFloor = existingFile.tasks.reduce((m, t) => Math.max(m, t.id), 0);
+    const existingSection = input.include_existing
+        ? `## Existing tasks (do not duplicate)
+
+The repo already has these tasks. Do NOT redecompose work they cover; reference
+their IDs in \`dependencies\` if your new tasks depend on them.
+
+${renderExisting(existingFile.tasks)}
+
+The next available task ID will be ${nextIdFloor + 1}.`
+        : `## Existing tasks
+_(skipped — caller passed \`include_existing: false\`)_`;
+    const agentList = AGENT_NAMES_TUPLE.filter((a) => a !== "tech-lead-planner" && a !== "tech-lead-consolidator").join(", ");
+    const prompt = `# Decompose the PRD below into atomic, ordered tasks.
+
+You are decomposing a Product Requirements Document into a list of tasks for the
+\`squad-mcp\` task store. The tasks will be reviewed by the user, then bulk-recorded
+via the \`record_tasks\` MCP tool, then executed one-at-a-time by the squad.
+
+## Output contract
+
+Emit ONE JSON object matching the schema below. No prose before or after — your
+entire response is parsed as JSON.
+
+\`\`\`json
+${JSON.stringify(OUTPUT_SCHEMA, null, 2)}
+\`\`\`
+
+## Decomposition rules
+
+1. **Atomic** — each task should be small enough that a developer can complete
+   it in a single sitting (one PR, one commit). If a task feels like "the whole
+   feature", break it down further.
+2. **Ordered via dependencies** — if task B can't start until task A is done,
+   set \`B.dependencies = [A's id]\`. IDs are assigned in array order starting
+   from ${nextIdFloor + 1}.
+3. **Cap at ${input.max_tasks} tasks** — if the PRD is huge, prefer fewer
+   higher-level tasks; the squad can \`expand_task\` later as needed.
+4. **Scope when sensible** — if a task touches a clearly-bounded directory
+   tree (e.g. just \`src/auth/\`), set \`scope\` to a glob (\`src/auth/**\`).
+   Skip \`scope\` for repo-wide tasks (config, docs, refactors).
+5. **Agent hints when obvious** — \`agent_hints\` narrows which squad agents
+   review the task. Available: ${agentList}. Pick 1-3 agents whose ownership
+   genuinely covers the task. Skip when the task spans multiple domains.
+6. **Test strategy** — for code tasks, write 1-3 sentences on how to verify.
+   Skip for non-code tasks (docs, config, deps).
+7. **Priority** — use \`high\` for blockers / security / critical path,
+   \`medium\` for normal work, \`low\` for nice-to-haves. Default \`medium\`.
+8. **No AI fluff** — \`title\` and \`description\` are read by humans.
+   Lead with the action verb. Example: "Add CSRF token to checkout flow",
+   not "Implementation of CSRF protection mechanism for the checkout module".
+
+## What NOT to do
+
+- Don't generate "setup", "init", or "scaffolding" tasks unless the PRD
+  explicitly requires them. Bias toward what the PRD actually asks for.
+- Don't invent tasks. If the PRD doesn't mention testing, don't add a
+  generic "write tests" task. The host can ask separately.
+- Don't reference task IDs that don't exist in either the existing list
+  or your own batch.
+- Don't emit a self-dependency (a task depending on itself).
+
+${existingSection}
+
+## PRD
+
+${input.prd_text}
+
+## Now emit the JSON
+
+Remember: ONE JSON object, schema above, no prose before or after.`;
+    return {
+        prompt,
+        output_schema: OUTPUT_SCHEMA,
+        existing: existingFile.tasks.map((t) => ({
+            id: t.id,
+            title: t.title,
+            status: t.status,
+        })),
+        next_id_floor: nextIdFloor,
+        next_action: "call_record_tasks_with_user_confirmation",
+    };
+}
+export const composePrdParseToolDef = {
+    name: "compose_prd_parse",
+    description: "Build a prompt + JSON schema for the host LLM to decompose a PRD into atomic tasks. Pure-MCP: does NOT call any LLM. Caller (skill/host) feeds the prompt to its LLM, receives JSON, then calls record_tasks with user confirmation. Includes existing tasks in the prompt to prevent duplication.",
+    schema,
+    handler: composePrdParseTool,
+};
+//# sourceMappingURL=compose-prd-parse.js.map