@tagma/sdk 0.4.2 → 0.4.3

package/dist/completions/output-check.js

@@ -0,0 +1,81 @@
+import { shellArgs, parseDuration } from '../utils';
+const DEFAULT_TIMEOUT_MS = 30_000;
+export const OutputCheckCompletion = {
+    name: 'output_check',
+    schema: {
+        description: 'Pipe task stdout into a shell command; mark success when that command exits 0.',
+        fields: {
+            check: {
+                type: 'string',
+                required: true,
+                description: 'Shell command to run. Task stdout is piped to its stdin.',
+                placeholder: "grep -q 'PASS'",
+            },
+            timeout: {
+                type: 'duration',
+                default: '30s',
+                description: 'Maximum time to wait for the check command.',
+                placeholder: '30s',
+            },
+        },
+    },
+    async check(config, result, ctx) {
+        const checkCmd = config.check;
+        if (!checkCmd)
+            throw new Error('output_check completion: "check" is required');
+        const timeoutMs = config.timeout != null
+            ? parseDuration(String(config.timeout))
+            : DEFAULT_TIMEOUT_MS;
+        const controller = new AbortController();
+        const timer = setTimeout(() => controller.abort(), timeoutMs);
+        // Wire pipeline abort signal into the check process so external abort
+        // terminates the child instead of leaving it running undetected.
+        const onAbort = () => controller.abort();
+        if (ctx.signal) {
+            if (ctx.signal.aborted) {
+                controller.abort();
+            }
+            else {
+                ctx.signal.addEventListener('abort', onAbort, { once: true });
+            }
+        }
+        const proc = Bun.spawn(shellArgs(checkCmd), {
+            cwd: ctx.workDir,
+            stdin: 'pipe',
+            stdout: 'pipe',
+            stderr: 'pipe',
+            signal: controller.signal,
+        });
+        try {
+            if (proc.stdin) {
+                try {
+                    proc.stdin.write(result.stdout);
+                    proc.stdin.end(); // no await — consistent with runner.ts; proc.exited handles sync
+                }
+                catch (err) {
+                    // EPIPE is expected when the check process exits before reading all of stdin
+                    // (e.g. `grep -q` exits on first match). Anything else is a real failure.
+                    const code = err?.code;
+                    if (code !== 'EPIPE')
+                        throw err;
+                }
+            }
+            // Consume stderr concurrently with waiting for exit to prevent pipe-buffer
+            // deadlock when check script emits more than ~64 KB of stderr output.
+            const [exitCode, stderr] = await Promise.all([
+                proc.exited,
+                new Response(proc.stderr).text(),
+            ]);
+            if (exitCode !== 0 && stderr.trim()) {
+                console.warn(`[output_check] "${checkCmd}" exit=${exitCode}: ${stderr.trim()}`);
+            }
+            return exitCode === 0;
+        }
+        finally {
+            clearTimeout(timer);
+            if (ctx.signal)
+                ctx.signal.removeEventListener('abort', onAbort);
+        }
+    },
+};
+//# sourceMappingURL=output-check.js.map

package/dist/completions/output-check.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"output-check.js","sourceRoot":"","sources":["../../src/completions/output-check.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAEpD,MAAM,kBAAkB,GAAG,MAAM,CAAC;AAElC,MAAM,CAAC,MAAM,qBAAqB,GAAqB;IACrD,IAAI,EAAE,cAAc;IACpB,MAAM,EAAE;QACN,WAAW,EAAE,gFAAgF;QAC7F,MAAM,EAAE;YACN,KAAK,EAAE;gBACL,IAAI,EAAE,QAAQ;gBACd,QAAQ,EAAE,IAAI;gBACd,WAAW,EAAE,0DAA0D;gBACvE,WAAW,EAAE,gBAAgB;aAC9B;YACD,OAAO,EAAE;gBACP,IAAI,EAAE,UAAU;gBAChB,OAAO,EAAE,KAAK;gBACd,WAAW,EAAE,6CAA6C;gBAC1D,WAAW,EAAE,KAAK;aACnB;SACF;KACF;IAED,KAAK,CAAC,KAAK,CAAC,MAA+B,EAAE,MAAkB,EAAE,GAAsB;QACrF,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAe,CAAC;QACxC,IAAI,CAAC,QAAQ;YAAE,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;QAE/E,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,IAAI,IAAI;YACtC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACvC,CAAC,CAAC,kBAAkB,CAAC;QAEvB,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,CAAC;QAE9D,sEAAsE;QACtE,iEAAiE;QACjE,MAAM,OAAO,GAAG,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACzC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YACf,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACvB,UAAU,CAAC,KAAK,EAAE,CAAC;YACrB,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAa,EAAE;YACtD,GAAG,EAAE,GAAG,CAAC,OAAO;YAChB,KAAK,EAAE,MAAM;YACb,MAAM,EAAE,MAAM;YACd,MAAM,EAAE,MAAM;YACd,MAAM,EAAE,UAAU,CAAC,MAAM;SAC1B,CAAC,CAAC;QAEH,IAAI,CAAC;YACH,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,IAAI,CAAC;oBACH,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBAChC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,iEAAiE;gBACrF,CAAC;gBAAC,OAAO,GAAY,EAAE,CAAC;oBACtB,6EAA6E;oBAC7E,0EAA0E;oBAC1E,MAAM,IAAI,GAAI,GAA6B,EAAE,IAAI,CAAC;oBAClD,IAAI,IAAI,KAAK,OAAO;wBAAE,MAAM,GAAG,CAAC;gBAClC,CAAC;YACH,CAAC;YAED,2EAA2E;YAC3E,sEAAsE;YACtE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;gBAC3C,IAAI,CAAC,MAAM;gBACX,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE;aACjC,CAAC,CAAC;YAEH,IAAI,QAAQ,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACpC,OAAO,CAAC,IAAI,CAAC,mBAAmB,QAAQ,UAAU,QAAQ,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAClF,CAAC;YAED,OAAO,QAAQ,KAAK,CAAC,CAAC;QACxB,CAAC;gBAAS,CAAC;YACT,YAAY,CAAC,KAAK,CAAC,CAAC;YACpB,IAAI,GAAG,CAAC,MAAM;gBAAE,GAAG,CAAC,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;CACF,CAAC"}

package/dist/config-ops.d.ts

@@ -0,0 +1,55 @@
+import type { RawPipelineConfig, RawTrackConfig, RawTaskConfig } from './types';
+/**
+ * Create a minimal empty pipeline config.
+ */
+export declare function createEmptyPipeline(name: string): RawPipelineConfig;
+/**
+ * Update a top-level pipeline field (name, driver, timeout, etc.).
+ */
+export declare function setPipelineField(config: RawPipelineConfig, fields: Partial<Omit<RawPipelineConfig, 'tracks'>>): RawPipelineConfig;
+/**
+ * Insert or replace a track by id. Appends if the id is new.
+ */
+export declare function upsertTrack(config: RawPipelineConfig, track: RawTrackConfig): RawPipelineConfig;
+/**
+ * Remove a track by id. No-op if the id is not found.
+ */
+export declare function removeTrack(config: RawPipelineConfig, trackId: string): RawPipelineConfig;
+/**
+ * Move a track to a new index position (0-based).
+ * Clamps toIndex to valid bounds.
+ */
+export declare function moveTrack(config: RawPipelineConfig, trackId: string, toIndex: number): RawPipelineConfig;
+/**
+ * Update fields on a single track (excluding tasks list, use upsertTask / removeTask for that).
+ */
+export declare function updateTrack(config: RawPipelineConfig, trackId: string, fields: Partial<Omit<RawTrackConfig, 'id' | 'tasks'>>): RawPipelineConfig;
+/**
+ * Insert or replace a task within a track, matched by task.id. Appends if new.
+ * No-op if the trackId is not found.
+ */
+export declare function upsertTask(config: RawPipelineConfig, trackId: string, task: RawTaskConfig): RawPipelineConfig;
+/**
+ * Remove a task from a track. No-op if either id is not found.
+ *
+ * When `cleanRefs` is true, all `depends_on` and `continue_from` references to the
+ * removed task are also removed from every other task in the pipeline. This prevents
+ * validateRaw from reporting dangling-ref errors after the deletion.
+ */
+export declare function removeTask(config: RawPipelineConfig, trackId: string, taskId: string, cleanRefs?: boolean): RawPipelineConfig;
+/**
+ * Reorder a task within its track.
+ * Clamps toIndex to valid bounds.
+ */
+export declare function moveTask(config: RawPipelineConfig, trackId: string, taskId: string, toIndex: number): RawPipelineConfig;
+/**
+ * Move a task from one track to another (appends to the target track).
+ * No-op if either trackId or taskId is not found.
+ *
+ * When `qualifyRefs` is true (the default), bare references (`depends_on`,
+ * `continue_from`) pointing to the moved task are converted to fully-qualified
+ * refs (`toTrackId.taskId`) so that same-track resolution doesn't silently
+ * break after the task changes tracks.
+ */
+export declare function transferTask(config: RawPipelineConfig, fromTrackId: string, taskId: string, toTrackId: string, qualifyRefs?: boolean): RawPipelineConfig;
+//# sourceMappingURL=config-ops.d.ts.map

package/dist/config-ops.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"config-ops.d.ts","sourceRoot":"","sources":["../src/config-ops.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,iBAAiB,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAIhF;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,iBAAiB,CAEnE;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,iBAAiB,EACzB,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,iBAAiB,EAAE,QAAQ,CAAC,CAAC,GACjD,iBAAiB,CAEnB;AAID;;GAEG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,iBAAiB,EACzB,KAAK,EAAE,cAAc,GACpB,iBAAiB,CAQnB;AAED;;GAEG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,iBAAiB,EACzB,OAAO,EAAE,MAAM,GACd,iBAAiB,CAEnB;AAED;;;GAGG;AACH,wBAAgB,SAAS,CACvB,MAAM,EAAE,iBAAiB,EACzB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GACd,iBAAiB,CAQnB;AAED;;GAEG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,iBAAiB,EACzB,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,GAAG,OAAO,CAAC,CAAC,GACpD,iBAAiB,CAOnB;AAID;;;GAGG;AACH,wBAAgB,UAAU,CACxB,MAAM,EAAE,iBAAiB,EACzB,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,aAAa,GAClB,iBAAiB,CAcnB;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CACxB,MAAM,EAAE,iBAAiB,EACzB,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,SAAS,UAAQ,GAChB,iBAAiB,CAmDnB;AAoBD;;;GAGG;AACH,wBAAgB,QAAQ,CACtB,MAAM,EAAE,iBAAiB,EACzB,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,GACd,iBAAiB,CAcnB;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAC1B,MAAM,EAAE,iBAAiB,EACzB,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,WAAW,UAAO,GACjB,iBAAiB,CA6DnB"}

package/dist/config-ops.js

@@ -0,0 +1,258 @@
+// ═══ RawPipelineConfig CRUD Operations ═══
+//
+// Pure, immutable helper functions for building and editing pipeline configs
+// in a visual editor. None of these functions have runtime dependencies —
+// safe to import in any context (sidecar, renderer, tests).
+//
+// All operations return a new config object; inputs are never mutated.
+// ── Pipeline ──
+/**
+ * Create a minimal empty pipeline config.
+ */
+export function createEmptyPipeline(name) {
+    return { name, tracks: [] };
+}
+/**
+ * Update a top-level pipeline field (name, driver, timeout, etc.).
+ */
+export function setPipelineField(config, fields) {
+    return { ...config, ...fields };
+}
+// ── Tracks ──
+/**
+ * Insert or replace a track by id. Appends if the id is new.
+ */
+export function upsertTrack(config, track) {
+    const exists = config.tracks.some(t => t.id === track.id);
+    return {
+        ...config,
+        tracks: exists
+            ? config.tracks.map(t => (t.id === track.id ? track : t))
+            : [...config.tracks, track],
+    };
+}
+/**
+ * Remove a track by id. No-op if the id is not found.
+ */
+export function removeTrack(config, trackId) {
+    return { ...config, tracks: config.tracks.filter(t => t.id !== trackId) };
+}
+/**
+ * Move a track to a new index position (0-based).
+ * Clamps toIndex to valid bounds.
+ */
+export function moveTrack(config, trackId, toIndex) {
+    const idx = config.tracks.findIndex(t => t.id === trackId);
+    if (idx === -1)
+        return config;
+    const track = config.tracks[idx];
+    const withoutTrack = [...config.tracks.slice(0, idx), ...config.tracks.slice(idx + 1)];
+    const clamped = Math.max(0, Math.min(toIndex, withoutTrack.length));
+    const tracks = [...withoutTrack.slice(0, clamped), track, ...withoutTrack.slice(clamped)];
+    return { ...config, tracks };
+}
+/**
+ * Update fields on a single track (excluding tasks list, use upsertTask / removeTask for that).
+ */
+export function updateTrack(config, trackId, fields) {
+    return {
+        ...config,
+        tracks: config.tracks.map(t => t.id === trackId ? { ...t, ...fields } : t),
+    };
+}
+// ── Tasks ──
+/**
+ * Insert or replace a task within a track, matched by task.id. Appends if new.
+ * No-op if the trackId is not found.
+ */
+export function upsertTask(config, trackId, task) {
+    return {
+        ...config,
+        tracks: config.tracks.map(t => {
+            if (t.id !== trackId)
+                return t;
+            const exists = t.tasks.some(tk => tk.id === task.id);
+            return {
+                ...t,
+                tasks: exists
+                    ? t.tasks.map(tk => (tk.id === task.id ? task : tk))
+                    : [...t.tasks, task],
+            };
+        }),
+    };
+}
+/**
+ * Remove a task from a track. No-op if either id is not found.
+ *
+ * When `cleanRefs` is true, all `depends_on` and `continue_from` references to the
+ * removed task are also removed from every other task in the pipeline. This prevents
+ * validateRaw from reporting dangling-ref errors after the deletion.
+ */
+export function removeTask(config, trackId, taskId, cleanRefs = false) {
+    const withoutTask = {
+        ...config,
+        tracks: config.tracks.map(t => {
+            if (t.id !== trackId)
+                return t;
+            return { ...t, tasks: t.tasks.filter(tk => tk.id !== taskId) };
+        }),
+    };
+    if (!cleanRefs)
+        return withoutTask;
+    const qualId = `${trackId}.${taskId}`;
+    // After deletion, can a bare ref "taskId" still resolve to some other task globally?
+    // It can if any track in the post-deletion config still contains a task with that bare id.
+    const bareIdSurvivesGlobally = withoutTask.tracks.some(t => t.tasks.some(tk => tk.id === taskId));
+    return {
+        ...withoutTask,
+        tracks: withoutTask.tracks.map(t => {
+            // Build the set of task IDs remaining in this track (the deleted task
+            // has already been removed from its own track in withoutTask).
+            const remainingIds = new Set(t.tasks.map(tk => tk.id));
+            // Resolve whether a ref in THIS track points to the deleted task:
+            //   - Fully-qualified ref ("trackId.taskId") — always points to the deleted task.
+            //   - Bare ref ("taskId") from the SAME track as the deleted task — always pointed
+            //     to the deleted task (same-track lookup takes priority).
+            //   - Bare ref from a DIFFERENT track:
+            //       1. If this track has a local task with that id → ref resolves locally, not removed.
+            //       2. Else if some other track still has a task with that id → ref will resolve
+            //          there after deletion, not removed.
+            //       3. Else → ref is dangling, remove it.
+            const isRemovedFrom = (ref) => {
+                if (ref === qualId)
+                    return true;
+                if (ref === taskId) {
+                    if (t.id === trackId)
+                        return true; // same track — was pointing here
+                    if (remainingIds.has(taskId))
+                        return false; // local task shadows — ref is fine
+                    return !bareIdSurvivesGlobally; // remove only if truly dangling
+                }
+                return false;
+            };
+            return {
+                ...t,
+                tasks: t.tasks.map(tk => cleanTaskRefs(tk, isRemovedFrom)),
+            };
+        }),
+    };
+}
+function cleanTaskRefs(task, isRemoved) {
+    const filteredDeps = task.depends_on?.filter(d => !isRemoved(d));
+    const dropContinueFrom = task.continue_from !== undefined && isRemoved(task.continue_from);
+    const depsUnchanged = filteredDeps === undefined || filteredDeps.length === task.depends_on.length;
+    if (depsUnchanged && !dropContinueFrom)
+        return task;
+    const { depends_on, continue_from, ...rest } = task;
+    return {
+        ...rest,
+        ...(filteredDeps !== undefined && filteredDeps.length > 0 ? { depends_on: filteredDeps } : {}),
+        ...(!dropContinueFrom && continue_from !== undefined ? { continue_from } : {}),
+    };
+}
+/**
+ * Reorder a task within its track.
+ * Clamps toIndex to valid bounds.
+ */
+export function moveTask(config, trackId, taskId, toIndex) {
+    return {
+        ...config,
+        tracks: config.tracks.map(t => {
+            if (t.id !== trackId)
+                return t;
+            const idx = t.tasks.findIndex(tk => tk.id === taskId);
+            if (idx === -1)
+                return t;
+            const task = t.tasks[idx];
+            const withoutTask = [...t.tasks.slice(0, idx), ...t.tasks.slice(idx + 1)];
+            const clamped = Math.max(0, Math.min(toIndex, withoutTask.length));
+            const tasks = [...withoutTask.slice(0, clamped), task, ...withoutTask.slice(clamped)];
+            return { ...t, tasks };
+        }),
+    };
+}
+/**
+ * Move a task from one track to another (appends to the target track).
+ * No-op if either trackId or taskId is not found.
+ *
+ * When `qualifyRefs` is true (the default), bare references (`depends_on`,
+ * `continue_from`) pointing to the moved task are converted to fully-qualified
+ * refs (`toTrackId.taskId`) so that same-track resolution doesn't silently
+ * break after the task changes tracks.
+ */
+export function transferTask(config, fromTrackId, taskId, toTrackId, qualifyRefs = true) {
+    if (fromTrackId === toTrackId)
+        return config;
+    let task;
+    const afterRemove = {
+        ...config,
+        tracks: config.tracks.map(t => {
+            if (t.id !== fromTrackId)
+                return t;
+            const found = t.tasks.find(tk => tk.id === taskId);
+            if (!found)
+                return t;
+            task = found;
+            return { ...t, tasks: t.tasks.filter(tk => tk.id !== taskId) };
+        }),
+    };
+    if (!task)
+        return config;
+    const afterInsert = upsertTask(afterRemove, toTrackId, task);
+    if (!qualifyRefs)
+        return afterInsert;
+    // Qualify bare references to the moved task. After the move, bare ref
+    // "taskId" from the old track no longer resolves via same-track priority.
+    // Convert it to the qualified form "toTrackId.taskId" so the dependency
+    // graph stays correct.
+    const qualId = `${toTrackId}.${taskId}`;
+    const oldQualId = `${fromTrackId}.${taskId}`;
+    // Does any track (other than the destination) still have a task with this bare id?
+    const bareIdSurvivesElsewhere = afterInsert.tracks.some(t => t.id !== toTrackId && t.tasks.some(tk => tk.id === taskId));
+    return {
+        ...afterInsert,
+        tracks: afterInsert.tracks.map(t => {
+            const localHasId = t.tasks.some(tk => tk.id === taskId);
+            const qualifyRef = (ref) => {
+                // Already-qualified ref to old location → rewrite to new location
+                if (ref === oldQualId)
+                    return qualId;
+                // Bare ref: only needs qualifying if it would have resolved to the
+                // moved task before the transfer
+                if (ref === taskId) {
+                    if (t.id === fromTrackId) {
+                        // Was same-track in the old track — now the task is gone.
+                        // If no other local task shadows it, qualify to new location.
+                        if (!localHasId)
+                            return qualId;
+                    }
+                    // From a different track: bare ref resolved globally before.
+                    // If the bare id is now ambiguous or gone from this track's
+                    // perspective, qualify it.
+                    if (!localHasId && !bareIdSurvivesElsewhere)
+                        return qualId;
+                }
+                return ref;
+            };
+            return {
+                ...t,
+                tasks: t.tasks.map(tk => qualifyTaskRefs(tk, qualifyRef)),
+            };
+        }),
+    };
+}
+/** Rewrite `depends_on` and `continue_from` refs using a mapping function. */
+function qualifyTaskRefs(task, rewrite) {
+    const newDeps = task.depends_on?.map(rewrite);
+    const newContinue = task.continue_from !== undefined ? rewrite(task.continue_from) : undefined;
+    const depsChanged = newDeps !== undefined && newDeps.some((d, i) => d !== task.depends_on[i]);
+    const continueChanged = newContinue !== undefined && newContinue !== task.continue_from;
+    if (!depsChanged && !continueChanged)
+        return task;
+    return {
+        ...task,
+        ...(newDeps !== undefined ? { depends_on: newDeps } : {}),
+        ...(newContinue !== undefined ? { continue_from: newContinue } : {}),
+    };
+}
+//# sourceMappingURL=config-ops.js.map

package/dist/config-ops.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"config-ops.js","sourceRoot":"","sources":["../src/config-ops.ts"],"names":[],"mappings":"AAAA,4CAA4C;AAC5C,EAAE;AACF,6EAA6E;AAC7E,0EAA0E;AAC1E,4DAA4D;AAC5D,EAAE;AACF,uEAAuE;AAIvE,iBAAiB;AAEjB;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;AAC9B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAyB,EACzB,MAAkD;IAElD,OAAO,EAAE,GAAG,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;AAClC,CAAC;AAED,eAAe;AAEf;;GAEG;AACH,MAAM,UAAU,WAAW,CACzB,MAAyB,EACzB,KAAqB;IAErB,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC;IAC1D,OAAO;QACL,GAAG,MAAM;QACT,MAAM,EAAE,MAAM;YACZ,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC;KAC9B,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CACzB,MAAyB,EACzB,OAAe;IAEf,OAAO,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,EAAE,CAAC;AAC5E,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CACvB,MAAyB,EACzB,OAAe,EACf,OAAe;IAEf,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;IAC3D,IAAI,GAAG,KAAK,CAAC,CAAC;QAAE,OAAO,MAAM,CAAC;IAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAE,CAAC;IAClC,MAAM,YAAY,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACvF,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IACpE,MAAM,MAAM,GAAG,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,KAAK,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;IAC1F,OAAO,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,CAAC;AAC/B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CACzB,MAAyB,EACzB,OAAe,EACf,MAAqD;IAErD,OAAO;QACL,GAAG,MAAM;QACT,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAC5B,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAC3C;KACF,CAAC;AACJ,CAAC;AAED,cAAc;AAEd;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,MAAyB,EACzB,OAAe,EACf,IAAmB;IAEnB,OAAO;QACL,GAAG,MAAM;QACT,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAC5B,IAAI,CAAC,CAAC,EAAE,KAAK,OAAO;gBAAE,OAAO,CAAC,CAAC;YAC/B,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;YACrD,OAAO;gBACL,GAAG,CAAC;gBACJ,KAAK,EAAE,MAAM;oBACX,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACpD,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC;aACvB,CAAC;QACJ,CAAC,CAAC;KACH,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CACxB,MAAyB,EACzB,OAAe,EACf,MAAc,EACd,SAAS,GAAG,KAAK;IAEjB,MAAM,WAAW,GAAG;QAClB,GAAG,MAAM;QACT,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAC5B,IAAI,CAAC,CAAC,EAAE,KAAK,OAAO;gBAAE,OAAO,CAAC,CAAC;YAC/B,OAAO,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC;QACjE,CAAC,CAAC;KACH,CAAC;IAEF,IAAI,CAAC,SAAS;QAAE,OAAO,WAAW,CAAC;IAEnC,MAAM,MAAM,GAAG,GAAG,OAAO,IAAI,MAAM,EAAE,CAAC;IAEtC,qFAAqF;IACrF,2FAA2F;IAC3F,MAAM,sBAAsB,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CACzD,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CACrC,CAAC;IAEF,OAAO;QACL,GAAG,WAAW;QACd,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YACjC,sEAAsE;YACtE,+DAA+D;YAC/D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAEvD,kEAAkE;YAClE,kFAAkF;YAClF,mFAAmF;YACnF,8DAA8D;YAC9D,uCAAuC;YACvC,4FAA4F;YAC5F,qFAAqF;YACrF,8CAA8C;YAC9C,8CAA8C;YAC9C,MAAM,aAAa,GAAG,CAAC,GAAW,EAAW,EAAE;gBAC7C,IAAI,GAAG,KAAK,MAAM;oBAAE,OAAO,IAAI,CAAC;gBAChC,IAAI,GAAG,KAAK,MAAM,EAAE,CAAC;oBACnB,IAAI,CAAC,CAAC,EAAE,KAAK,OAAO;wBAAE,OAAO,IAAI,CAAC,CAAY,iCAAiC;oBAC/E,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;wBAAE,OAAO,KAAK,CAAC,CAAG,mCAAmC;oBACjF,OAAO,CAAC,sBAAsB,CAAC,CAAe,gCAAgC;gBAChF,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC,CAAC;YAEF,OAAO;gBACL,GAAG,CAAC;gBACJ,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,aAAa,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;aAC3D,CAAC;QACJ,CAAC,CAAC;KACH,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CACpB,IAAmB,EACnB,SAAmC;IAEnC,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,gBAAgB,GAAG,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAE3F,MAAM,aAAa,GAAG,YAAY,KAAK,SAAS,IAAI,YAAY,CAAC,MAAM,KAAK,IAAI,CAAC,UAAW,CAAC,MAAM,CAAC;IACpG,IAAI,aAAa,IAAI,CAAC,gBAAgB;QAAE,OAAO,IAAI,CAAC;IAEpD,MAAM,EAAE,UAAU,EAAE,aAAa,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC;IACpD,OAAO;QACL,GAAG,IAAI;QACP,GAAG,CAAC,YAAY,KAAK,SAAS,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9F,GAAG,CAAC,CAAC,gBAAgB,IAAI,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC9D,CAAC;AACrB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CACtB,MAAyB,EACzB,OAAe,EACf,MAAc,EACd,OAAe;IAEf,OAAO;QACL,GAAG,MAAM;QACT,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAC5B,IAAI,CAAC,CAAC,EAAE,KAAK,OAAO;gBAAE,OAAO,CAAC,CAAC;YAC/B,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;YACtD,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC;YACzB,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAE,CAAC;YAC3B,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1E,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;YACnE,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YACtF,OAAO,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC;QACzB,CAAC,CAAC;KACH,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAyB,EACzB,WAAmB,EACnB,MAAc,EACd,SAAiB,EACjB,WAAW,GAAG,IAAI;IAElB,IAAI,WAAW,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IAE7C,IAAI,IAA+B,CAAC;IACpC,MAAM,WAAW,GAAG;QAClB,GAAG,MAAM;QACT,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YAC5B,IAAI,CAAC,CAAC,EAAE,KAAK,WAAW;gBAAE,OAAO,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;YACnD,IAAI,CAAC,KAAK;gBAAE,OAAO,CAAC,CAAC;YACrB,IAAI,GAAG,KAAK,CAAC;YACb,OAAO,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC;QACjE,CAAC,CAAC;KACH,CAAC;IACF,IAAI,CAAC,IAAI;QAAE,OAAO,MAAM,CAAC;IACzB,MAAM,WAAW,GAAG,UAAU,CAAC,WAAW,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IAE7D,IAAI,CAAC,WAAW;QAAE,OAAO,WAAW,CAAC;IAErC,sEAAsE;IACtE,0EAA0E;IAC1E,wEAAwE;IACxE,uBAAuB;IACvB,MAAM,MAAM,GAAG,GAAG,SAAS,IAAI,MAAM,EAAE,CAAC;IACxC,MAAM,SAAS,GAAG,GAAG,WAAW,IAAI,MAAM,EAAE,CAAC;IAE7C,mFAAmF;IACnF,MAAM,uBAAuB,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAC1D,CAAC,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CAC3D,CAAC;IAEF,OAAO;QACL,GAAG,WAAW;QACd,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YACjC,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;YAExD,MAAM,UAAU,GAAG,CAAC,GAAW,EAAU,EAAE;gBACzC,kEAAkE;gBAClE,IAAI,GAAG,KAAK,SAAS;oBAAE,OAAO,MAAM,CAAC;gBACrC,mEAAmE;gBACnE,iCAAiC;gBACjC,IAAI,GAAG,KAAK,MAAM,EAAE,CAAC;oBACnB,IAAI,CAAC,CAAC,EAAE,KAAK,WAAW,EAAE,CAAC;wBACzB,0DAA0D;wBAC1D,8DAA8D;wBAC9D,IAAI,CAAC,UAAU;4BAAE,OAAO,MAAM,CAAC;oBACjC,CAAC;oBACD,6DAA6D;oBAC7D,4DAA4D;oBAC5D,2BAA2B;oBAC3B,IAAI,CAAC,UAAU,IAAI,CAAC,uBAAuB;wBAAE,OAAO,MAAM,CAAC;gBAC7D,CAAC;gBACD,OAAO,GAAG,CAAC;YACb,CAAC,CAAC;YAEF,OAAO;gBACL,GAAG,CAAC;gBACJ,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;aAC1D,CAAC;QACJ,CAAC,CAAC;KACH,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,SAAS,eAAe,CACtB,IAAmB,EACnB,OAAgC;IAEhC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAE/F,MAAM,WAAW,GAAG,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,UAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,MAAM,eAAe,GAAG,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,IAAI,CAAC,aAAa,CAAC;IAExF,IAAI,CAAC,WAAW,IAAI,CAAC,eAAe;QAAE,OAAO,IAAI,CAAC;IAElD,OAAO;QACL,GAAG,IAAI;QACP,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzD,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACrE,CAAC;AACJ,CAAC"}

package/dist/dag.d.ts

@@ -0,0 +1,46 @@
+import type { PipelineConfig, RawPipelineConfig, RawTaskConfig, TaskConfig, TrackConfig } from './types';
+export interface DagNode {
+    readonly taskId: string;
+    readonly task: TaskConfig;
+    readonly track: TrackConfig;
+    readonly dependsOn: readonly string[];
+    /**
+     * H1: `task.continue_from` may be written by users as a bare task id
+     * (e.g. `review`) or a same-track shorthand. The driver needs the
+     * fully-qualified upstream id to look up output/session/normalized maps
+     * deterministically — bare lookups race when two tracks happen to share
+     * a task name. dag.ts performs the qualification once, here, so the
+     * engine never has to.
+     */
+    readonly resolvedContinueFrom?: string;
+}
+export interface Dag {
+    readonly nodes: ReadonlyMap<string, DagNode>;
+    readonly sorted: readonly string[];
+}
+export declare function buildDag(config: PipelineConfig): Dag;
+export interface RawDagNode {
+    readonly taskId: string;
+    readonly trackId: string;
+    readonly rawTask: RawTaskConfig;
+    readonly dependsOn: readonly string[];
+}
+export interface RawDag {
+    readonly nodes: ReadonlyMap<string, RawDagNode>;
+    /** Directed edges: from → to means "from must complete before to starts" */
+    readonly edges: readonly {
+        readonly from: string;
+        readonly to: string;
+    }[];
+}
+/**
+ * Build a lightweight DAG from a raw (unresolved) pipeline config.
+ * Unlike buildDag, this function:
+ *   - Does not require a workDir or resolved PipelineConfig
+ *   - Is lenient: missing or ambiguous refs are silently skipped
+ *   - Skips template-expansion tasks (those with a `use` field)
+ *
+ * Intended for the visual editor to render the flow graph before a pipeline is run.
+ */
+export declare function buildRawDag(config: RawPipelineConfig): RawDag;
+//# sourceMappingURL=dag.d.ts.map

package/dist/dag.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag.d.ts","sourceRoot":"","sources":["../src/dag.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,iBAAiB,EAAE,aAAa,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAEzG,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;IACtC;;;;;;;OAOG;IACH,QAAQ,CAAC,oBAAoB,CAAC,EAAE,MAAM,CAAC;CACxC;AAED,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC7C,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;CACpC;AAQD,wBAAgB,QAAQ,CAAC,MAAM,EAAE,cAAc,GAAG,GAAG,CAqIpD;AAID,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;IAChC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;CACvC;AAED,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAChD,4EAA4E;IAC5E,QAAQ,CAAC,KAAK,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CAC3E;AAED;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,iBAAiB,GAAG,MAAM,CA2D7D"}

package/dist/dag.js

@@ -0,0 +1,193 @@
+// Build a global task ID: for cross-track refs we use "track_id.task_id"
+// Within a track, bare "task_id" is also valid
+function qualifyId(trackId, taskId) {
+    return `${trackId}.${taskId}`;
+}
+export function buildDag(config) {
+    const nodes = new Map();
+    // Map bare task IDs to qualified IDs (for resolving unqualified refs)
+    const bareToQualified = new Map();
+    // 1. Register all nodes
+    for (const track of config.tracks) {
+        for (const task of track.tasks) {
+            const qid = qualifyId(track.id, task.id);
+            if (nodes.has(qid)) {
+                throw new Error(`Duplicate task ID: "${qid}"`);
+            }
+            // Track bare ID → qualified. If same bare ID in multiple tracks, mark ambiguous
+            if (bareToQualified.has(task.id)) {
+                bareToQualified.set(task.id, '__ambiguous__');
+            }
+            else {
+                bareToQualified.set(task.id, qid);
+            }
+            nodes.set(qid, {
+                taskId: qid,
+                task,
+                track,
+                dependsOn: [], // filled below
+            });
+        }
+    }
+    // Helper to resolve a dependency ref to a qualified ID
+    function resolveRef(ref, fromTrackId) {
+        // Already qualified (contains dot)
+        if (ref.includes('.')) {
+            if (!nodes.has(ref)) {
+                throw new Error(`Task reference "${ref}" not found`);
+            }
+            return ref;
+        }
+        // Try within same track first
+        const sameTrack = qualifyId(fromTrackId, ref);
+        if (nodes.has(sameTrack))
+            return sameTrack;
+        // Try global bare lookup
+        const global = bareToQualified.get(ref);
+        if (global && global !== '__ambiguous__')
+            return global;
+        if (global === '__ambiguous__') {
+            throw new Error(`Ambiguous task reference "${ref}" exists in multiple tracks. ` +
+                `Use "track_id.task_id" format.`);
+        }
+        throw new Error(`Task reference "${ref}" not found`);
+    }
+    // 2. Resolve depends_on and continue_from to qualified IDs
+    for (const track of config.tracks) {
+        for (const task of track.tasks) {
+            const qid = qualifyId(track.id, task.id);
+            const deps = [];
+            let resolvedContinueFrom;
+            if (task.depends_on) {
+                for (const dep of task.depends_on) {
+                    deps.push(resolveRef(dep, track.id));
+                }
+            }
+            if (task.continue_from) {
+                let resolved;
+                try {
+                    resolved = resolveRef(task.continue_from, track.id);
+                }
+                catch {
+                    throw new Error(`Task "${qid}": continue_from "${task.continue_from}" — no such task found. ` +
+                        `Use a fully-qualified reference (trackId.taskId) or ensure the target task exists.`);
+                }
+                resolvedContinueFrom = resolved;
+                if (!deps.includes(resolved)) {
+                    deps.push(resolved); // continue_from implies dependency
+                }
+            }
+            // Replace node with resolved deps + qualified continue_from.
+            const node = nodes.get(qid);
+            nodes.set(qid, { ...node, dependsOn: deps, resolvedContinueFrom });
+        }
+    }
+    // 3. Topological sort + cycle detection (Kahn's algorithm)
+    const inDegree = new Map();
+    const adjacency = new Map(); // parent → children
+    for (const [id] of nodes) {
+        inDegree.set(id, 0);
+        adjacency.set(id, []);
+    }
+    for (const [id, node] of nodes) {
+        for (const dep of node.dependsOn) {
+            adjacency.get(dep).push(id);
+            inDegree.set(id, (inDegree.get(id) ?? 0) + 1);
+        }
+    }
+    const queue = [];
+    for (const [id, degree] of inDegree) {
+        if (degree === 0)
+            queue.push(id);
+    }
+    const sorted = [];
+    // Use an index pointer instead of shift() to avoid O(n) per dequeue.
+    let qi = 0;
+    while (qi < queue.length) {
+        const current = queue[qi++];
+        sorted.push(current);
+        for (const child of adjacency.get(current)) {
+            const newDegree = inDegree.get(child) - 1;
+            inDegree.set(child, newDegree);
+            if (newDegree === 0)
+                queue.push(child);
+        }
+    }
+    if (sorted.length !== nodes.size) {
+        // Only report nodes that are actually part of cycles (in-degree > 0
+        // after Kahn's algorithm), not their downstream dependents.
+        const sortedSet = new Set(sorted);
+        const cycleMembers = [...nodes.keys()].filter(id => !sortedSet.has(id) && (inDegree.get(id) ?? 0) > 0);
+        throw new Error(`Circular dependency detected involving tasks: ${cycleMembers.join(', ')}`);
+    }
+    return { nodes, sorted };
+}
+/**
+ * Build a lightweight DAG from a raw (unresolved) pipeline config.
+ * Unlike buildDag, this function:
+ *   - Does not require a workDir or resolved PipelineConfig
+ *   - Is lenient: missing or ambiguous refs are silently skipped
+ *   - Skips template-expansion tasks (those with a `use` field)
+ *
+ * Intended for the visual editor to render the flow graph before a pipeline is run.
+ */
+export function buildRawDag(config) {
+    const nodes = new Map();
+    const bareToQualified = new Map();
+    // 1. Register all concrete tasks
+    for (const track of config.tracks) {
+        for (const task of track.tasks) {
+            if (task.use)
+                continue; // template-expansion tasks are not yet materialized
+            const qid = `${track.id}.${task.id}`;
+            if (nodes.has(qid))
+                continue; // skip duplicates silently
+            if (bareToQualified.has(task.id)) {
+                bareToQualified.set(task.id, '__ambiguous__');
+            }
+            else {
+                bareToQualified.set(task.id, qid);
+            }
+            nodes.set(qid, { taskId: qid, trackId: track.id, rawTask: task, dependsOn: [] });
+        }
+    }
+    // 2. Resolve dependency refs leniently (missing / ambiguous refs are skipped)
+    function tryResolve(ref, fromTrackId) {
+        if (ref.includes('.'))
+            return nodes.has(ref) ? ref : null;
+        const sameTrack = `${fromTrackId}.${ref}`;
+        if (nodes.has(sameTrack))
+            return sameTrack;
+        const global = bareToQualified.get(ref);
+        if (global && global !== '__ambiguous__')
+            return global;
+        return null;
+    }
+    const edges = [];
+    for (const track of config.tracks) {
+        for (const task of track.tasks) {
+            if (task.use)
+                continue;
+            const qid = `${track.id}.${task.id}`;
+            const deps = [];
+            for (const ref of task.depends_on ?? []) {
+                const resolved = tryResolve(ref, track.id);
+                if (resolved && !deps.includes(resolved)) {
+                    deps.push(resolved);
+                    edges.push({ from: resolved, to: qid });
+                }
+            }
+            if (task.continue_from) {
+                const resolved = tryResolve(task.continue_from, track.id);
+                if (resolved && !deps.includes(resolved)) {
+                    deps.push(resolved);
+                    edges.push({ from: resolved, to: qid });
+                }
+            }
+            const node = nodes.get(qid);
+            nodes.set(qid, { ...node, dependsOn: deps });
+        }
+    }
+    return { nodes, edges };
+}
+//# sourceMappingURL=dag.js.map