@bastani/atomic 0.5.3-1 → 0.5.4-0

package/src/sdk/workflows/builtin/deep-research-codebase/helpers/scout.ts

@@ -0,0 +1,334 @@
+/**
+ * Codebase scout: deterministic helpers for the deep-research-codebase workflow.
+ *
+ * Responsibilities:
+ *   1. Discover the codebase root (git toplevel, falling back to cwd).
+ *   2. List all source files, respecting .gitignore when in a git repo.
+ *   3. Count lines of code per file using batched `wc -l`.
+ *   4. Render a compact directory tree (depth-bounded) for prompt context.
+ *   5. Build "partition units" by aggregating LOC at depth-1, then drilling
+ *      down on any unit that is too large to live in a single explorer.
+ *   6. Bin-pack partition units into N balanced groups (largest-first).
+ *
+ * Everything here is pure TypeScript + child_process — no LLM calls.
+ */
+
+import { spawnSync } from "node:child_process";
+
+/** Source-file extensions we treat as "code" for LOC accounting. */
+const CODE_EXTENSIONS = new Set<string>([
+  // Web / TS / JS
+  "ts", "tsx", "js", "jsx", "mjs", "cjs",
+  "vue", "svelte", "astro",
+  // Systems
+  "c", "cc", "cpp", "cxx", "h", "hpp", "rs", "go", "zig",
+  // JVM / .NET
+  "java", "kt", "kts", "scala", "groovy", "cs", "fs",
+  // Scripting
+  "py", "rb", "php", "pl", "lua", "sh", "bash", "zsh", "fish",
+  // Mobile
+  "swift", "m", "mm",
+  // Functional / niche
+  "ex", "exs", "erl", "elm", "hs", "ml", "clj", "cljs", "edn",
+  "r", "jl", "dart", "nim",
+  // Schemas / DSLs that materially shape behavior
+  "sql", "graphql", "proto",
+]);
+
+/** Directories we always exclude even when not using git ls-files. */
+const FIND_IGNORE_PATTERNS = [
+  "node_modules", ".git", "dist", "build", "out",
+  ".next", ".nuxt", ".turbo", ".vercel", ".cache",
+  "target", "vendor", "__pycache__", ".venv", "venv", "coverage",
+];
+
+/** Per-file LOC + path. */
+export type FileStats = { path: string; loc: number };
+
+/**
+ * A "partition unit" is the atomic chunk of work that gets bin-packed into
+ * an explorer. It is always one directory (possibly drilled down to depth 2)
+ * with all of the code files that live anywhere underneath it.
+ */
+export type PartitionUnit = {
+  /** Repo-relative path, e.g. "src/cli" or "packages/foo/src". */
+  path: string;
+  loc: number;
+  fileCount: number;
+  /** Repo-relative file paths inside this unit (full recursive listing). */
+  files: string[];
+};
+
+export type CodebaseScout = {
+  /** Absolute path to the repository root. */
+  root: string;
+  totalLoc: number;
+  totalFiles: number;
+  /** Compact rendered directory tree (depth-bounded) for prompt context. */
+  tree: string;
+  /** Partition units, sorted by LOC descending. */
+  units: PartitionUnit[];
+};
+
+/** Resolve the project root. Prefers `git rev-parse --show-toplevel`. */
+export function getCodebaseRoot(): string {
+  const r = spawnSync("git", ["rev-parse", "--show-toplevel"], {
+    encoding: "utf8",
+    stdio: ["ignore", "pipe", "ignore"],
+  });
+  if (r.status === 0 && r.stdout) {
+    return r.stdout.trim();
+  }
+  return process.cwd();
+}
+
+function isCodeFile(p: string): boolean {
+  const dot = p.lastIndexOf(".");
+  if (dot < 0 || dot === p.length - 1) return false;
+  const ext = p.slice(dot + 1).toLowerCase();
+  return CODE_EXTENSIONS.has(ext);
+}
+
+/** List all files in the repository. Prefers git ls-files (respects .gitignore). */
+function listAllFiles(root: string): string[] {
+  const git = spawnSync("git", ["ls-files"], {
+    cwd: root,
+    encoding: "utf8",
+    maxBuffer: 64 * 1024 * 1024,
+    stdio: ["ignore", "pipe", "ignore"],
+  });
+  if (git.status === 0 && git.stdout) {
+    return git.stdout.split("\n").filter((l) => l.length > 0);
+  }
+
+  // Fallback: shell out to find with the standard ignore patterns.
+  const args: string[] = [".", "-type", "f"];
+  for (const pattern of FIND_IGNORE_PATTERNS) {
+    args.push("-not", "-path", `*/${pattern}/*`);
+  }
+  const find = spawnSync("find", args, {
+    cwd: root,
+    encoding: "utf8",
+    maxBuffer: 64 * 1024 * 1024,
+    stdio: ["ignore", "pipe", "ignore"],
+  });
+  if (find.status === 0 && find.stdout) {
+    return find.stdout
+      .split("\n")
+      .map((p) => p.replace(/^\.\//, ""))
+      .filter((p) => p.length > 0);
+  }
+  return [];
+}
+
+/**
+ * Count lines for a batch of files using `wc -l`. Output format:
+ *   "  N filename"
+ *   "  N total"   (when more than one file is passed)
+ *
+ * We batch to avoid command-line length limits.
+ */
+function countLines(root: string, files: string[]): Map<string, number> {
+  const result = new Map<string, number>();
+  if (files.length === 0) return result;
+
+  const BATCH = 200;
+  for (let i = 0; i < files.length; i += BATCH) {
+    const batch = files.slice(i, i + BATCH);
+    const r = spawnSync("wc", ["-l", "--", ...batch], {
+      cwd: root,
+      encoding: "utf8",
+      maxBuffer: 32 * 1024 * 1024,
+      stdio: ["ignore", "pipe", "ignore"],
+    });
+    if (!r.stdout) continue;
+    for (const line of r.stdout.split("\n")) {
+      const m = line.match(/^\s*(\d+)\s+(.+)$/);
+      // Regex groups are typed `string | undefined` under strict mode even
+      // when the whole match succeeded — guard explicitly.
+      const countStr = m?.[1];
+      const filename = m?.[2]?.trim();
+      if (countStr === undefined || filename === undefined) continue;
+      if (filename === "total") continue;
+      result.set(filename, parseInt(countStr, 10));
+    }
+  }
+  return result;
+}
+
+/** Group file stats by directory at the given depth (1-indexed). */
+function aggregateAtDepth(files: FileStats[], depth: number): PartitionUnit[] {
+  const map = new Map<string, PartitionUnit>();
+  for (const f of files) {
+    const parts = f.path.split("/");
+    const key = parts.length >= depth
+      ? parts.slice(0, depth).join("/")
+      : (parts.slice(0, parts.length - 1).join("/") || "(root)");
+    let cur = map.get(key);
+    if (!cur) {
+      cur = { path: key, loc: 0, fileCount: 0, files: [] };
+      map.set(key, cur);
+    }
+    cur.loc += f.loc;
+    cur.fileCount += 1;
+    cur.files.push(f.path);
+  }
+  return [...map.values()];
+}
+
+/**
+ * Build candidate partition units. Starts at depth 1 and drills down on any
+ * unit that is too large (> 20% of total LOC) to balance partitions better.
+ * A single drill-down pass is enough for typical codebases — we deliberately
+ * do not recurse to keep behavior predictable.
+ */
+function buildPartitionUnits(files: FileStats[]): PartitionUnit[] {
+  if (files.length === 0) return [];
+
+  const totalLoc = files.reduce((s, f) => s + f.loc, 0);
+  const drillThreshold = Math.max(Math.floor(totalLoc * 0.2), 1);
+
+  const units = aggregateAtDepth(files, 1);
+
+  // Drill down on oversized units (single pass).
+  for (let i = 0; i < units.length; i++) {
+    const unit = units[i];
+    // noUncheckedIndexedAccess makes units[i] possibly undefined; we know
+    // it's defined because i < units.length, but TS can't prove that.
+    if (unit === undefined) continue;
+    if (unit.loc <= drillThreshold) continue;
+    const subFiles = files.filter((f) =>
+      f.path === unit.path || f.path.startsWith(unit.path + "/"),
+    );
+    const subUnits = aggregateAtDepth(subFiles, 2);
+    if (subUnits.length > 1) {
+      units.splice(i, 1, ...subUnits);
+      i += subUnits.length - 1;
+    }
+  }
+
+  return units.sort((a, b) => b.loc - a.loc);
+}
+
+/**
+ * Render a compact, depth-bounded ASCII tree of the codebase. Used as prompt
+ * context for the scout's architectural-overview LLM call.
+ *
+ * - `maxDepth`: how many directory levels to descend before stopping.
+ * - `maxLines`: hard cap on output lines; we append "└── ..." if exceeded.
+ *
+ * Only directories show recursive file counts; leaf files appear as bare names.
+ */
+function renderTree(files: string[], maxDepth = 3, maxLines = 200): string {
+  type Node = { children: Map<string, Node>; isFile: boolean; fileCount: number };
+  const root: Node = { children: new Map(), isFile: false, fileCount: 0 };
+
+  for (const file of files) {
+    const parts = file.split("/");
+    let cur = root;
+    cur.fileCount += 1;
+    for (let i = 0; i < parts.length && i < maxDepth; i++) {
+      const part = parts[i];
+      if (part === undefined) continue; // unreachable in practice
+      let child = cur.children.get(part);
+      if (!child) {
+        child = { children: new Map(), isFile: false, fileCount: 0 };
+        cur.children.set(part, child);
+      }
+      child.fileCount += 1;
+      cur = child;
+      if (i === parts.length - 1) cur.isFile = true;
+    }
+  }
+
+  const lines: string[] = [];
+  let truncated = false;
+
+  function walk(node: Node, prefix: string): void {
+    if (truncated) return;
+    const entries = [...node.children.entries()].sort((a, b) => {
+      const aIsDir = a[1].children.size > 0;
+      const bIsDir = b[1].children.size > 0;
+      if (aIsDir !== bIsDir) return aIsDir ? -1 : 1;
+      return a[0].localeCompare(b[0]);
+    });
+    for (let i = 0; i < entries.length; i++) {
+      if (lines.length >= maxLines) {
+        lines.push(prefix + "└── ...");
+        truncated = true;
+        return;
+      }
+      const entry = entries[i];
+      if (entry === undefined) continue; // unreachable in practice
+      const [name, child] = entry;
+      const last = i === entries.length - 1;
+      const branch = last ? "└── " : "├── ";
+      const isDir = child.children.size > 0;
+      const label = isDir ? `${name}/  (${child.fileCount} files)` : name;
+      lines.push(prefix + branch + label);
+      walk(child, prefix + (last ? "    " : "│   "));
+      if (truncated) return;
+    }
+  }
+
+  walk(root, "");
+  return lines.join("\n");
+}
+
+/**
+ * Run the full scout: list files, count LOC, render tree, build partition units.
+ */
+export function scoutCodebase(root: string): CodebaseScout {
+  const allPaths = listAllFiles(root);
+  const codePaths = allPaths.filter(isCodeFile);
+  const locMap = countLines(root, codePaths);
+
+  const fileStats: FileStats[] = codePaths.map((p) => ({
+    path: p,
+    loc: locMap.get(p) ?? 0,
+  }));
+
+  const totalLoc = fileStats.reduce((s, f) => s + f.loc, 0);
+  const totalFiles = fileStats.length;
+  const treeSource = allPaths.length > 0 ? allPaths : codePaths;
+  const tree = renderTree(treeSource, 3, 200);
+  const units = buildPartitionUnits(fileStats);
+
+  return { root, totalLoc, totalFiles, tree, units };
+}
+
+/**
+ * Bin-pack partition units into `count` balanced groups. Greedy
+ * largest-first: assign each unit to the currently-lightest bin.
+ *
+ * If there are fewer units than requested bins, the result has exactly
+ * `units.length` non-empty bins (we never return empty bins).
+ */
+export function partitionUnits(
+  units: PartitionUnit[],
+  count: number,
+): PartitionUnit[][] {
+  if (units.length === 0) return [];
+  const n = Math.max(1, Math.min(count, units.length));
+  const bins: PartitionUnit[][] = Array.from({ length: n }, () => []);
+  const totals: number[] = Array.from({ length: n }, () => 0);
+
+  const sorted = [...units].sort((a, b) => b.loc - a.loc);
+  for (const u of sorted) {
+    let minIdx = 0;
+    let minTotal = totals[0] ?? 0;
+    for (let i = 1; i < n; i++) {
+      const t = totals[i] ?? 0;
+      if (t < minTotal) {
+        minIdx = i;
+        minTotal = t;
+      }
+    }
+    const bin = bins[minIdx];
+    if (bin === undefined) continue; // unreachable: minIdx ∈ [0, n)
+    bin.push(u);
+    totals[minIdx] = minTotal + u.loc;
+  }
+
+  return bins;
+}

package/src/sdk/workflows/builtin/deep-research-codebase/opencode/index.ts

@@ -0,0 +1,284 @@
+/**
+ * deep-research-codebase / opencode
+ *
+ * OpenCode replica of the Claude deep-research-codebase workflow. The Claude
+ * version dispatches specialist sub-agents (codebase-locator, codebase-
+ * analyzer, etc.) inside a single explorer session via `@"name (agent)"`
+ * syntax — a Claude-specific feature. OpenCode sessions are bound to a
+ * single agent for their lifetime, so we keep the SAME graph topology
+ * (scout ∥ history → explorer-1..N → aggregator) but drive each explorer
+ * through the locate → analyze → patterns → synthesize sequence inline using
+ * the default agent's built-in file tools.
+ *
+ * Topology (identical to Claude version):
+ *
+ *           ┌─→ codebase-scout
+ *   parent ─┤
+ *           └─→ research-history
+ *                     │
+ *                     ▼
+ *   ┌──────────────────────────────────────────────────┐
+ *   │  explorer-1   explorer-2   ...   explorer-N      │   (Promise.all)
+ *   └──────────────────────────────────────────────────┘
+ *                     │
+ *                     ▼
+ *                aggregator
+ *
+ * OpenCode-specific concerns baked in:
+ *
+ *  • F5 — every `ctx.stage()` call is a FRESH session with no memory of
+ *    prior stages. We forward the scout overview, history overview, and
+ *    partition assignment explicitly into each explorer's first prompt.
+ *
+ *  • F9 — `s.save()` receives the `{ info, parts }` payload from
+ *    `s.client.session.prompt()` via `result.data!`. Passing the full
+ *    `result` (with its wrapping) or raw `result.data.parts` breaks
+ *    downstream `transcript()` reads.
+ *
+ *  • F6 — every prompt explicitly requires trailing prose AFTER any tool
+ *    call so the rendered transcript has content. OpenCode's `parts` array
+ *    mixes text/tool/reasoning/file parts; without trailing text the
+ *    transcript extractor returns an empty string.
+ *
+ *  • F3 — transcript extraction relies on the runtime's text-only rendering
+ *    of `result.data.parts`. The helpers call `ctx.transcript(handle)` which
+ *    returns `{ path, content }` where content is already text-filtered.
+ */
+
+import { defineWorkflow } from "../../../index.ts";
+import { mkdir } from "node:fs/promises";
+import path from "node:path";
+
+import {
+  getCodebaseRoot,
+  partitionUnits,
+  scoutCodebase,
+} from "../helpers/scout.ts";
+import {
+  calculateExplorerCount,
+  explainHeuristic,
+} from "../helpers/heuristic.ts";
+import {
+  buildAggregatorPrompt,
+  buildExplorerPromptGeneric,
+  buildHistoryPromptGeneric,
+  buildScoutPrompt,
+  slugifyPrompt,
+} from "../helpers/prompts.ts";
+
+export default defineWorkflow<"opencode">({
+    name: "deep-research-codebase",
+    description:
+      "Deterministic deep codebase research: scout → LOC-driven parallel explorers → aggregator",
+  })
+  .run(async (ctx) => {
+    // Free-form workflows receive their positional prompt under
+    // `inputs.prompt`; destructure once so every stage below can close
+    // over a bare `prompt` string without re-reaching into ctx.inputs.
+    const prompt = ctx.inputs.prompt ?? "";
+    const root = getCodebaseRoot();
+    const startedAt = new Date();
+    const isoDate = startedAt.toISOString().slice(0, 10);
+    const slug = slugifyPrompt(prompt);
+
+    // ── Stages 1a + 1b: codebase-scout ∥ research-history ──────────────────
+    const [scout, history] = await Promise.all([
+      ctx.stage(
+        {
+          name: "codebase-scout",
+          description: "Map codebase, count LOC, partition for parallel explorers",
+        },
+        {},
+        { title: "codebase-scout" },
+        async (s) => {
+          // 1. Deterministic scouting (pure TypeScript — no LLM).
+          const data = scoutCodebase(root);
+          if (data.units.length === 0) {
+            throw new Error(
+              `deep-research-codebase: scout found no source files under ${root}. ` +
+                `Run from inside a code repository or check the CODE_EXTENSIONS list.`,
+            );
+          }
+
+          // 2. Heuristic decides explorer count (capped by available units).
+          const targetCount = calculateExplorerCount(data.totalLoc);
+          const partitions = partitionUnits(data.units, targetCount);
+          const actualCount = partitions.length;
+
+          // 3. Scratch directory for explorer outputs (timestamped to avoid
+          //    collisions across runs).
+          const scratchDir = path.join(
+            root,
+            "research",
+            "docs",
+            `.deep-research-${startedAt.getTime()}`,
+          );
+          await mkdir(scratchDir, { recursive: true });
+
+          // 4. Short LLM call: architectural orientation for downstream
+          //    explorers. The prompt forbids the agent from answering the
+          //    research question — its only job here is to orient.
+          const result = await s.client.session.prompt({
+            sessionID: s.session.id,
+            parts: [
+              {
+                type: "text",
+                text: buildScoutPrompt({
+                  question: prompt,
+                  tree: data.tree,
+                  totalLoc: data.totalLoc,
+                  totalFiles: data.totalFiles,
+                  explorerCount: actualCount,
+                  partitionPreview: partitions,
+                }),
+              },
+            ],
+          });
+          // F9: OpenCode takes the unwrapped { info, parts } object.
+          s.save(result.data!);
+
+          return {
+            root,
+            totalLoc: data.totalLoc,
+            totalFiles: data.totalFiles,
+            tree: data.tree,
+            partitions,
+            explorerCount: actualCount,
+            scratchDir,
+            heuristicNote: explainHeuristic(data.totalLoc, actualCount),
+          };
+        },
+      ),
+      ctx.stage(
+        {
+          name: "research-history",
+          description: "Surface prior research from research/ directory",
+        },
+        {},
+        { title: "research-history" },
+        async (s) => {
+          // The generic history prompt drives a single default-agent session
+          // through locate → analyze → synthesize inline, instead of Claude's
+          // sub-agent dispatch.
+          const result = await s.client.session.prompt({
+            sessionID: s.session.id,
+            parts: [
+              {
+                type: "text",
+                text: buildHistoryPromptGeneric({
+                  question: prompt,
+                  root,
+                }),
+              },
+            ],
+          });
+          s.save(result.data!);
+        },
+      ),
+    ]);
+
+    const {
+      partitions,
+      explorerCount,
+      scratchDir,
+      totalLoc,
+      totalFiles,
+    } = scout.result;
+
+    // Pull both scout transcripts ONCE at the workflow level so every
+    // explorer + the aggregator can embed them in their prompts (F5). Both
+    // stages have completed here (we're past Promise.all), so these reads
+    // are safe (F13).
+    const scoutOverview = (await ctx.transcript(scout)).content;
+    const historyOverview = (await ctx.transcript(history)).content;
+
+    // ── Stage 2: parallel explorers ────────────────────────────────────────
+    // Each explorer is a separate OpenCode session, running concurrently via
+    // Promise.all. Because the session is fresh (F5), every piece of context
+    // it needs — question, architectural orientation, historical context,
+    // partition assignment, scratch path — is injected into the first prompt
+    // via buildExplorerPromptGeneric.
+    const explorerHandles = await Promise.all(
+      partitions.map((partition, idx) => {
+        const i = idx + 1;
+        const scratchPath = path.join(scratchDir, `explorer-${i}.md`);
+        return ctx.stage(
+          {
+            name: `explorer-${i}`,
+            description: `Explore ${partition
+              .map((u) => u.path)
+              .join(", ")} (${partition.reduce((s, u) => s + u.fileCount, 0)} files)`,
+          },
+          {},
+          { title: `explorer-${i}` },
+          async (s) => {
+            const result = await s.client.session.prompt({
+              sessionID: s.session.id,
+              parts: [
+                {
+                  type: "text",
+                  text: buildExplorerPromptGeneric({
+                    question: prompt,
+                    index: i,
+                    total: explorerCount,
+                    partition,
+                    scoutOverview,
+                    historyOverview,
+                    scratchPath,
+                    root,
+                  }),
+                },
+              ],
+            });
+            s.save(result.data!);
+
+            // Returning structured metadata lets the aggregator stage reach
+            // each explorer's scratch path without re-parsing transcripts.
+            return { index: i, scratchPath, partition };
+          },
+        );
+      }),
+    );
+
+    // ── Stage 3: aggregator ────────────────────────────────────────────────
+    // Reads explorer findings via FILE PATHS (filesystem-context skill) to
+    // keep the aggregator's own context lean — we deliberately do NOT inline
+    // N transcripts into the prompt. Token cost stays roughly constant in N.
+    const finalPath = path.join(
+      root,
+      "research",
+      "docs",
+      `${isoDate}-${slug}.md`,
+    );
+
+    await ctx.stage(
+      {
+        name: "aggregator",
+        description: "Synthesize explorer findings + history into final research doc",
+      },
+      {},
+      { title: "aggregator" },
+      async (s) => {
+        const result = await s.client.session.prompt({
+          sessionID: s.session.id,
+          parts: [
+            {
+              type: "text",
+              text: buildAggregatorPrompt({
+                question: prompt,
+                totalLoc,
+                totalFiles,
+                explorerCount,
+                explorerFiles: explorerHandles.map((h) => h.result),
+                finalPath,
+                scoutOverview,
+                historyOverview,
+              }),
+            },
+          ],
+        });
+        s.save(result.data!);
+      },
+    );
+  })
+  .compile();

package/src/sdk/workflows/builtin/ralph/claude/index.ts

@@ -37,6 +37,10 @@ export default defineWorkflow<"claude">({
     "Plan → orchestrate → review → debug loop with bounded iteration",
 })
   .run(async (ctx) => {
+    // Free-form workflows receive their positional prompt under
+    // `inputs.prompt`; destructure once so every stage below can close
+    // over a bare `prompt` string without re-reaching into ctx.inputs.
+    const prompt = ctx.inputs.prompt ?? "";
     let consecutiveClean = 0;
     let debuggerReport = "";
 
@@ -51,7 +55,7 @@ export default defineWorkflow<"claude">({
           await s.session.query(
             asAgentCall(
               "planner",
-              buildPlannerPrompt(s.userPrompt, {
+              buildPlannerPrompt(prompt, {
                 iteration,
                 debuggerReport: debuggerReport || undefined,
               }),
@@ -72,7 +76,7 @@ export default defineWorkflow<"claude">({
           await s.session.query(
             asAgentCall(
               "orchestrator",
-              buildOrchestratorPrompt(s.userPrompt),
+              buildOrchestratorPrompt(prompt),
             ),
           );
           s.save(s.sessionId);
@@ -91,7 +95,7 @@ export default defineWorkflow<"claude">({
           const result = await s.session.query(
             asAgentCall(
               "reviewer",
-              buildReviewPrompt(s.userPrompt, { gitStatus, iteration }),
+              buildReviewPrompt(prompt, { gitStatus, iteration }),
             ),
           );
           s.save(s.sessionId);
@@ -118,7 +122,7 @@ export default defineWorkflow<"claude">({
             const result = await s.session.query(
               asAgentCall(
                 "reviewer",
-                buildReviewPrompt(s.userPrompt, {
+                buildReviewPrompt(prompt, {
                   gitStatus,
                   iteration,
                   isConfirmationPass: true,