@zigrivers/scaffold 2.1.0

package/dist/core/assembly/update-mode.test.js

@@ -0,0 +1,235 @@
+import { describe, it, expect, beforeEach, afterEach } from 'vitest';
+import { detectUpdateMode } from './update-mode.js';
+import fs from 'node:fs';
+import os from 'node:os';
+import path from 'node:path';
+/** Helper to make a minimal PipelineState */
+function makeState(steps = {}) {
+    return {
+        'schema-version': 1,
+        'scaffold-version': '2.0.0',
+        init_methodology: 'deep',
+        config_methodology: 'deep',
+        'init-mode': 'greenfield',
+        created: '2024-01-01T00:00:00.000Z',
+        in_progress: null,
+        steps,
+        next_eligible: [],
+        'extra-steps': [],
+    };
+}
+let tmpDir;
+beforeEach(() => {
+    tmpDir = fs.mkdtempSync(path.join(os.tmpdir(), 'update-mode-test-'));
+});
+afterEach(() => {
+    fs.rmSync(tmpDir, { recursive: true, force: true });
+});
+describe('detectUpdateMode', () => {
+    it('returns isUpdateMode: false for a pending step', () => {
+        const state = makeState({
+            'create-prd': {
+                status: 'pending',
+                source: 'pipeline',
+                produces: ['docs/prd.md'],
+            },
+        });
+        const result = detectUpdateMode({
+            step: 'create-prd',
+            state,
+            currentDepth: 3,
+            projectRoot: tmpDir,
+        });
+        expect(result.isUpdateMode).toBe(false);
+        expect(result.currentDepth).toBe(3);
+        expect(result.warnings).toHaveLength(0);
+    });
+    it('returns isUpdateMode: false for a completed step with no produces', () => {
+        const state = makeState({
+            'create-prd': {
+                status: 'completed',
+                source: 'pipeline',
+                at: '2024-01-01T00:00:00.000Z',
+                depth: 3,
+            },
+        });
+        const result = detectUpdateMode({
+            step: 'create-prd',
+            state,
+            currentDepth: 3,
+            projectRoot: tmpDir,
+        });
+        expect(result.isUpdateMode).toBe(false);
+        expect(result.warnings).toHaveLength(0);
+    });
+    it('returns isUpdateMode: false for a completed step where artifacts do not exist on disk', () => {
+        const state = makeState({
+            'create-prd': {
+                status: 'completed',
+                source: 'pipeline',
+                at: '2024-01-01T00:00:00.000Z',
+                depth: 3,
+                produces: ['docs/prd.md'],
+            },
+        });
+        // File does NOT exist on disk
+        const result = detectUpdateMode({
+            step: 'create-prd',
+            state,
+            currentDepth: 3,
+            projectRoot: tmpDir,
+        });
+        expect(result.isUpdateMode).toBe(false);
+        expect(result.warnings).toHaveLength(0);
+    });
+    it('returns isUpdateMode: true for a completed step with an existing artifact on disk', () => {
+        const outputPath = 'docs/prd.md';
+        const fullPath = path.join(tmpDir, outputPath);
+        fs.mkdirSync(path.dirname(fullPath), { recursive: true });
+        fs.writeFileSync(fullPath, '# PRD Content', 'utf8');
+        const state = makeState({
+            'create-prd': {
+                status: 'completed',
+                source: 'pipeline',
+                at: '2024-01-01T00:00:00.000Z',
+                depth: 3,
+                produces: [outputPath],
+            },
+        });
+        const result = detectUpdateMode({
+            step: 'create-prd',
+            state,
+            currentDepth: 3,
+            projectRoot: tmpDir,
+        });
+        expect(result.isUpdateMode).toBe(true);
+    });
+    it('existingArtifact has correct content, filePath, previousDepth, completionTimestamp', () => {
+        const outputPath = 'docs/prd.md';
+        const fullPath = path.join(tmpDir, outputPath);
+        fs.mkdirSync(path.dirname(fullPath), { recursive: true });
+        fs.writeFileSync(fullPath, '# PRD Content', 'utf8');
+        const state = makeState({
+            'create-prd': {
+                status: 'completed',
+                source: 'pipeline',
+                at: '2024-06-15T10:30:00.000Z',
+                depth: 3,
+                produces: [outputPath],
+            },
+        });
+        const result = detectUpdateMode({
+            step: 'create-prd',
+            state,
+            currentDepth: 3,
+            projectRoot: tmpDir,
+        });
+        expect(result.existingArtifact).toBeDefined();
+        expect(result.existingArtifact.content).toBe('# PRD Content');
+        expect(result.existingArtifact.filePath).toBe(outputPath);
+        expect(result.existingArtifact.previousDepth).toBe(3);
+        expect(result.existingArtifact.completionTimestamp).toBe('2024-06-15T10:30:00.000Z');
+    });
+    it('emits ASM_DEPTH_CHANGED warning when depth changed', () => {
+        const outputPath = 'docs/prd.md';
+        const fullPath = path.join(tmpDir, outputPath);
+        fs.mkdirSync(path.dirname(fullPath), { recursive: true });
+        fs.writeFileSync(fullPath, '# PRD Content', 'utf8');
+        const state = makeState({
+            'create-prd': {
+                status: 'completed',
+                source: 'pipeline',
+                at: '2024-01-01T00:00:00.000Z',
+                depth: 3,
+                produces: [outputPath],
+            },
+        });
+        const result = detectUpdateMode({
+            step: 'create-prd',
+            state,
+            currentDepth: 5,
+            projectRoot: tmpDir,
+        });
+        expect(result.warnings).toHaveLength(1);
+        expect(result.warnings[0].code).toBe('ASM_DEPTH_CHANGED');
+        expect(result.warnings[0].message).toContain('create-prd');
+        expect(result.warnings[0].message).toContain('3');
+        expect(result.warnings[0].message).toContain('5');
+    });
+    it('emits ASM_DEPTH_CHANGED and ASM_DEPTH_DOWNGRADE when current depth < previous depth', () => {
+        const outputPath = 'docs/prd.md';
+        const fullPath = path.join(tmpDir, outputPath);
+        fs.mkdirSync(path.dirname(fullPath), { recursive: true });
+        fs.writeFileSync(fullPath, '# PRD Content', 'utf8');
+        const state = makeState({
+            'create-prd': {
+                status: 'completed',
+                source: 'pipeline',
+                at: '2024-01-01T00:00:00.000Z',
+                depth: 5,
+                produces: [outputPath],
+            },
+        });
+        const result = detectUpdateMode({
+            step: 'create-prd',
+            state,
+            currentDepth: 2,
+            projectRoot: tmpDir,
+        });
+        const codes = result.warnings.map(w => w.code);
+        expect(codes).toContain('ASM_DEPTH_CHANGED');
+        expect(codes).toContain('ASM_DEPTH_DOWNGRADE');
+        const downgrade = result.warnings.find(w => w.code === 'ASM_DEPTH_DOWNGRADE');
+        expect(downgrade.message).toContain('create-prd');
+        expect(downgrade.message).toContain('2');
+        expect(downgrade.message).toContain('5');
+    });
+    it('does NOT emit ASM_DEPTH_CHANGED when depth is unchanged', () => {
+        const outputPath = 'docs/prd.md';
+        const fullPath = path.join(tmpDir, outputPath);
+        fs.mkdirSync(path.dirname(fullPath), { recursive: true });
+        fs.writeFileSync(fullPath, '# PRD Content', 'utf8');
+        const state = makeState({
+            'create-prd': {
+                status: 'completed',
+                source: 'pipeline',
+                at: '2024-01-01T00:00:00.000Z',
+                depth: 3,
+                produces: [outputPath],
+            },
+        });
+        const result = detectUpdateMode({
+            step: 'create-prd',
+            state,
+            currentDepth: 3,
+            projectRoot: tmpDir,
+        });
+        expect(result.warnings).toHaveLength(0);
+    });
+    it('depthIncreased is true when currentDepth > previousDepth', () => {
+        const outputPath = 'docs/prd.md';
+        const fullPath = path.join(tmpDir, outputPath);
+        fs.mkdirSync(path.dirname(fullPath), { recursive: true });
+        fs.writeFileSync(fullPath, '# PRD Content', 'utf8');
+        const state = makeState({
+            'create-prd': {
+                status: 'completed',
+                source: 'pipeline',
+                at: '2024-01-01T00:00:00.000Z',
+                depth: 2,
+                produces: [outputPath],
+            },
+        });
+        const result = detectUpdateMode({
+            step: 'create-prd',
+            state,
+            currentDepth: 4,
+            projectRoot: tmpDir,
+        });
+        expect(result.isUpdateMode).toBe(true);
+        expect(result.depthIncreased).toBe(true);
+        expect(result.previousDepth).toBe(2);
+        expect(result.currentDepth).toBe(4);
+    });
+});
+//# sourceMappingURL=update-mode.test.js.map

package/dist/core/assembly/update-mode.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"update-mode.test.js","sourceRoot":"","sources":["../../../src/core/assembly/update-mode.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,QAAQ,CAAA;AACpE,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAA;AAEnD,OAAO,EAAE,MAAM,SAAS,CAAA;AACxB,OAAO,EAAE,MAAM,SAAS,CAAA;AACxB,OAAO,IAAI,MAAM,WAAW,CAAA;AAE5B,6CAA6C;AAC7C,SAAS,SAAS,CAChB,QAAgC,EAAE;IAElC,OAAO;QACL,gBAAgB,EAAE,CAAC;QACnB,kBAAkB,EAAE,OAAO;QAC3B,gBAAgB,EAAE,MAAM;QACxB,kBAAkB,EAAE,MAAM;QAC1B,WAAW,EAAE,YAAY;QACzB,OAAO,EAAE,0BAA0B;QACnC,WAAW,EAAE,IAAI;QACjB,KAAK;QACL,aAAa,EAAE,EAAE;QACjB,aAAa,EAAE,EAAE;KAClB,CAAA;AACH,CAAC;AAED,IAAI,MAAc,CAAA;AAElB,UAAU,CAAC,GAAG,EAAE;IACd,MAAM,GAAG,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,mBAAmB,CAAC,CAAC,CAAA;AACtE,CAAC,CAAC,CAAA;AAEF,SAAS,CAAC,GAAG,EAAE;IACb,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAA;AACrD,CAAC,CAAC,CAAA;AAEF,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,YAAY,EAAE;gBACZ,MAAM,EAAE,SAAS;gBACjB,MAAM,EAAE,UAAU;gBAClB,QAAQ,EAAE,CAAC,aAAa,CAAC;aAC1B;SACF,CAAC,CAAA;QAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC;YAC9B,IAAI,EAAE,YAAY;YAClB,KAAK;YACL,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,MAAM;SACpB,CAAC,CAAA;QAEF,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACvC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACnC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IACzC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,YAAY,EAAE;gBACZ,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,UAAU;gBAClB,EAAE,EAAE,0BAA0B;gBAC9B,KAAK,EAAE,CAAC;aACT;SACF,CAAC,CAAA;QAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC;YAC9B,IAAI,EAAE,YAAY;YAClB,KAAK;YACL,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,MAAM;SACpB,CAAC,CAAA;QAEF,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACvC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IACzC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,uFAAuF,EAAE,GAAG,EAAE;QAC/F,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,YAAY,EAAE;gBACZ,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,UAAU;gBAClB,EAAE,EAAE,0BAA0B;gBAC9B,KAAK,EAAE,CAAC;gBACR,QAAQ,EAAE,CAAC,aAAa,CAAC;aAC1B;SACF,CAAC,CAAA;QAEF,8BAA8B;QAC9B,MAAM,MAAM,GAAG,gBAAgB,CAAC;YAC9B,IAAI,EAAE,YAAY;YAClB,KAAK;YACL,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,MAAM;SACpB,CAAC,CAAA;QAEF,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACvC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IACzC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,mFAAmF,EAAE,GAAG,EAAE;QAC3F,MAAM,UAAU,GAAG,aAAa,CAAA;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;QAC9C,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;QACzD,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,eAAe,EAAE,MAAM,CAAC,CAAA;QAEnD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,YAAY,EAAE;gBACZ,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,UAAU;gBAClB,EAAE,EAAE,0BAA0B;gBAC9B,KAAK,EAAE,CAAC;gBACR,QAAQ,EAAE,CAAC,UAAU,CAAC;aACvB;SACF,CAAC,CAAA;QAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC;YAC9B,IAAI,EAAE,YAAY;YAClB,KAAK;YACL,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,MAAM;SACpB,CAAC,CAAA;QAEF,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACxC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,oFAAoF,EAAE,GAAG,EAAE;QAC5F,MAAM,UAAU,GAAG,aAAa,CAAA;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;QAC9C,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;QACzD,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,eAAe,EAAE,MAAM,CAAC,CAAA;QAEnD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,YAAY,EAAE;gBACZ,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,UAAU;gBAClB,EAAE,EAAE,0BAA0B;gBAC9B,KAAK,EAAE,CAAC;gBACR,QAAQ,EAAE,CAAC,UAAU,CAAC;aACvB;SACF,CAAC,CAAA;QAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC;YAC9B,IAAI,EAAE,YAAY;YAClB,KAAK;YACL,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,MAAM;SACpB,CAAC,CAAA;QAEF,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,WAAW,EAAE,CAAA;QAC7C,MAAM,CAAC,MAAM,CAAC,gBAAiB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAA;QAC9D,MAAM,CAAC,MAAM,CAAC,gBAAiB,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;QAC1D,MAAM,CAAC,MAAM,CAAC,gBAAiB,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACtD,MAAM,CAAC,MAAM,CAAC,gBAAiB,CAAC,mBAAmB,CAAC,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAA;IACvF,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,UAAU,GAAG,aAAa,CAAA;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;QAC9C,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;QACzD,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,eAAe,EAAE,MAAM,CAAC,CAAA;QAEnD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,YAAY,EAAE;gBACZ,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,UAAU;gBAClB,EAAE,EAAE,0BAA0B;gBAC9B,KAAK,EAAE,CAAC;gBACR,QAAQ,EAAE,CAAC,UAAU,CAAC;aACvB;SACF,CAAC,CAAA;QAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC;YAC9B,IAAI,EAAE,YAAY;YAClB,KAAK;YACL,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,MAAM;SACpB,CAAC,CAAA;QAEF,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QACvC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAA;QACzD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAA;QAC1D,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;QACjD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;IACnD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,qFAAqF,EAAE,GAAG,EAAE;QAC7F,MAAM,UAAU,GAAG,aAAa,CAAA;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;QAC9C,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;QACzD,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,eAAe,EAAE,MAAM,CAAC,CAAA;QAEnD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,YAAY,EAAE;gBACZ,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,UAAU;gBAClB,EAAE,EAAE,0BAA0B;gBAC9B,KAAK,EAAE,CAAC;gBACR,QAAQ,EAAE,CAAC,UAAU,CAAC;aACvB;SACF,CAAC,CAAA;QAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC;YAC9B,IAAI,EAAE,YAAY;YAClB,KAAK;YACL,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,MAAM;SACpB,CAAC,CAAA;QAEF,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAC9C,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAA;QAC5C,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAA;QAE9C,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,qBAAqB,CAAE,CAAA;QAC9E,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAA;QACjD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;QACxC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;IAC1C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,UAAU,GAAG,aAAa,CAAA;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;QAC9C,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;QACzD,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,eAAe,EAAE,MAAM,CAAC,CAAA;QAEnD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,YAAY,EAAE;gBACZ,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,UAAU;gBAClB,EAAE,EAAE,0BAA0B;gBAC9B,KAAK,EAAE,CAAC;gBACR,QAAQ,EAAE,CAAC,UAAU,CAAC;aACvB;SACF,CAAC,CAAA;QAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC;YAC9B,IAAI,EAAE,YAAY;YAClB,KAAK;YACL,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,MAAM;SACpB,CAAC,CAAA;QAEF,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IACzC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,UAAU,GAAG,aAAa,CAAA;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;QAC9C,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;QACzD,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,eAAe,EAAE,MAAM,CAAC,CAAA;QAEnD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,YAAY,EAAE;gBACZ,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,UAAU;gBAClB,EAAE,EAAE,0BAA0B;gBAC9B,KAAK,EAAE,CAAC;gBACR,QAAQ,EAAE,CAAC,UAAU,CAAC;aACvB;SACF,CAAC,CAAA;QAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC;YAC9B,IAAI,EAAE,YAAY;YAClB,KAAK;YACL,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,MAAM;SACpB,CAAC,CAAA;QAEF,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACtC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACpC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/core/dependency/dependency.d.ts

@@ -0,0 +1,20 @@
+import type { DependencyGraph } from '../../types/index.js';
+import type { ScaffoldError } from '../../types/index.js';
+/** Primary phase ordering for topological sort tiebreaking. */
+declare const PHASE_SORT_ORDER: Record<string, number>;
+export { PHASE_SORT_ORDER };
+/**
+ * Topological sort using Kahn's algorithm.
+ *
+ * Tie-breaking: order field (primary), slug alphabetical (secondary).
+ * Returns a partial list when cycles exist (callers should use detectCycles).
+ */
+export declare function topologicalSort(graph: DependencyGraph): string[];
+/**
+ * Detect structural errors in the dependency graph:
+ *   DEP_CYCLE_DETECTED   — nodes unreachable via topological sort
+ *   DEP_SELF_REFERENCE   — a step lists itself as a dependency
+ *   DEP_TARGET_MISSING   — a dependency slug not present in the graph
+ */
+export declare function detectCycles(graph: DependencyGraph): ScaffoldError[];
+//# sourceMappingURL=dependency.d.ts.map

package/dist/core/dependency/dependency.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency.d.ts","sourceRoot":"","sources":["../../../src/core/dependency/dependency.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAA;AAC3D,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAA;AAGzD,+DAA+D;AAC/D,QAAA,MAAM,gBAAgB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAU5C,CAAA;AAED,OAAO,EAAE,gBAAgB,EAAE,CAAA;AAE3B;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,EAAE,CA6ChE;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,eAAe,GAAG,aAAa,EAAE,CAsCpE"}

package/dist/core/dependency/dependency.js

@@ -0,0 +1,104 @@
+import { ExitCode } from '../../types/index.js';
+/** Primary phase ordering for topological sort tiebreaking. */
+const PHASE_SORT_ORDER = {
+    pre: 0,
+    modeling: 1,
+    decisions: 2,
+    architecture: 3,
+    specification: 4,
+    quality: 5,
+    planning: 6,
+    validation: 7,
+    finalization: 8,
+};
+export { PHASE_SORT_ORDER };
+/**
+ * Topological sort using Kahn's algorithm.
+ *
+ * Tie-breaking: order field (primary), slug alphabetical (secondary).
+ * Returns a partial list when cycles exist (callers should use detectCycles).
+ */
+export function topologicalSort(graph) {
+    const { nodes, edges } = graph;
+    // Compute in-degrees — count deps that actually exist in the graph
+    const inDegree = new Map();
+    for (const [slug, node] of nodes) {
+        inDegree.set(slug, node.dependencies.filter(dep => nodes.has(dep)).length);
+    }
+    // Seed queue with zero-in-degree nodes, sorted for determinism
+    const queue = [];
+    for (const [slug, degree] of inDegree) {
+        if (degree === 0)
+            queue.push(slug);
+    }
+    queue.sort((a, b) => {
+        const nodeA = nodes.get(a);
+        const nodeB = nodes.get(b);
+        return nodeA.order - nodeB.order || a.localeCompare(b);
+    });
+    const result = [];
+    while (queue.length > 0) {
+        const slug = queue.shift();
+        result.push(slug);
+        const successors = edges.get(slug) ?? [];
+        const newlyZero = [];
+        for (const successor of successors) {
+            const newDegree = (inDegree.get(successor) ?? 0) - 1;
+            inDegree.set(successor, newDegree);
+            if (newDegree === 0)
+                newlyZero.push(successor);
+        }
+        // Insert newly-zero nodes in sorted order
+        newlyZero.sort((a, b) => {
+            const nodeA = nodes.get(a);
+            const nodeB = nodes.get(b);
+            return nodeA.order - nodeB.order || a.localeCompare(b);
+        });
+        queue.push(...newlyZero);
+    }
+    return result;
+}
+/**
+ * Detect structural errors in the dependency graph:
+ *   DEP_CYCLE_DETECTED   — nodes unreachable via topological sort
+ *   DEP_SELF_REFERENCE   — a step lists itself as a dependency
+ *   DEP_TARGET_MISSING   — a dependency slug not present in the graph
+ */
+export function detectCycles(graph) {
+    const errors = [];
+    // Cycle detection via Kahn's algorithm: unvisited nodes after sort are in a cycle
+    const sorted = topologicalSort(graph);
+    if (sorted.length < graph.nodes.size) {
+        const visited = new Set(sorted);
+        const cycleNodes = [...graph.nodes.keys()].filter(k => !visited.has(k));
+        errors.push({
+            code: 'DEP_CYCLE_DETECTED',
+            message: `Cycle detected in dependency graph involving: ${cycleNodes.join(', ')}`,
+            exitCode: ExitCode.ValidationError,
+            context: { steps: cycleNodes.join(', ') },
+        });
+    }
+    // Per-node checks: self-reference and missing targets
+    for (const [slug, node] of graph.nodes) {
+        for (const dep of node.dependencies) {
+            if (dep === slug) {
+                errors.push({
+                    code: 'DEP_SELF_REFERENCE',
+                    message: `Step "${slug}" depends on itself`,
+                    exitCode: ExitCode.ValidationError,
+                    context: { step: slug },
+                });
+            }
+            else if (!graph.nodes.has(dep)) {
+                errors.push({
+                    code: 'DEP_TARGET_MISSING',
+                    message: `Step "${slug}" depends on unknown step "${dep}"`,
+                    exitCode: ExitCode.MissingDependency,
+                    context: { step: slug, dependency: dep },
+                });
+            }
+        }
+    }
+    return errors;
+}
+//# sourceMappingURL=dependency.js.map

package/dist/core/dependency/dependency.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency.js","sourceRoot":"","sources":["../../../src/core/dependency/dependency.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAA;AAE/C,+DAA+D;AAC/D,MAAM,gBAAgB,GAA2B;IAC/C,GAAG,EAAE,CAAC;IACN,QAAQ,EAAE,CAAC;IACX,SAAS,EAAE,CAAC;IACZ,YAAY,EAAE,CAAC;IACf,aAAa,EAAE,CAAC;IAChB,OAAO,EAAE,CAAC;IACV,QAAQ,EAAE,CAAC;IACX,UAAU,EAAE,CAAC;IACb,YAAY,EAAE,CAAC;CAChB,CAAA;AAED,OAAO,EAAE,gBAAgB,EAAE,CAAA;AAE3B;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,KAAsB;IACpD,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,KAAK,CAAA;IAE9B,mEAAmE;IACnE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QACjC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;IAC5E,CAAC;IAED,+DAA+D;IAC/D,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACtC,IAAI,MAAM,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACpC,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAClB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAA;QAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAA;QAC3B,OAAO,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAA;IACxD,CAAC,CAAC,CAAA;IAEF,MAAM,MAAM,GAAa,EAAE,CAAA;IAE3B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAEjB,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAA;QACxC,MAAM,SAAS,GAAa,EAAE,CAAA;QAE9B,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YACpD,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;YAClC,IAAI,SAAS,KAAK,CAAC;gBAAE,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAChD,CAAC;QAED,0CAA0C;QAC1C,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACtB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAA;YAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAA;YAC3B,OAAO,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAA;QACxD,CAAC,CAAC,CAAA;QACF,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAA;IAC1B,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,KAAsB;IACjD,MAAM,MAAM,GAAoB,EAAE,CAAA;IAElC,kFAAkF;IAClF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;IACrC,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAA;QAC/B,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACvE,MAAM,CAAC,IAAI,CAAC;YACV,IAAI,EAAE,oBAAoB;YAC1B,OAAO,EAAE,iDAAiD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YACjF,QAAQ,EAAE,QAAQ,CAAC,eAAe;YAClC,OAAO,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;SAC1C,CAAC,CAAA;IACJ,CAAC;IAED,sDAAsD;IACtD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACvC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACjB,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,oBAAoB;oBAC1B,OAAO,EAAE,SAAS,IAAI,qBAAqB;oBAC3C,QAAQ,EAAE,QAAQ,CAAC,eAAe;oBAClC,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE;iBACxB,CAAC,CAAA;YACJ,CAAC;iBAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACjC,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,oBAAoB;oBAC1B,OAAO,EAAE,SAAS,IAAI,8BAA8B,GAAG,GAAG;oBAC1D,QAAQ,EAAE,QAAQ,CAAC,iBAAiB;oBACpC,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE;iBACzC,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC"}

package/dist/core/dependency/dependency.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=dependency.test.d.ts.map

package/dist/core/dependency/dependency.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency.test.d.ts","sourceRoot":"","sources":["../../../src/core/dependency/dependency.test.ts"],"names":[],"mappings":""}

package/dist/core/dependency/dependency.test.js

@@ -0,0 +1,166 @@
+import { describe, it, expect } from 'vitest';
+import { buildGraph } from './graph.js';
+import { topologicalSort, detectCycles } from './dependency.js';
+// ---------------------------------------------------------------------------
+// Test helpers
+// ---------------------------------------------------------------------------
+function makeFm(name, phase, order, dependencies) {
+    return {
+        name,
+        description: `${name} step`,
+        phase,
+        order,
+        dependencies,
+        outputs: [`out/${name}.md`],
+        conditional: null,
+        knowledgeBase: [],
+        reads: [],
+    };
+}
+const frontmatters = [
+    makeFm('a', 'pre', 1, []),
+    makeFm('b', 'pre', 2, ['a']),
+    makeFm('c', 'modeling', 3, ['a']),
+    makeFm('d', 'modeling', 4, ['b', 'c']),
+];
+const allEnabled = new Map([
+    ['a', { enabled: true }],
+    ['b', { enabled: true }],
+    ['c', { enabled: true }],
+    ['d', { enabled: true }],
+]);
+// ---------------------------------------------------------------------------
+// buildGraph
+// ---------------------------------------------------------------------------
+describe('buildGraph', () => {
+    it('builds graph from meta-prompt frontmatter', () => {
+        const graph = buildGraph(frontmatters, allEnabled);
+        expect(graph.nodes.size).toBe(4);
+        expect(graph.nodes.get('a')).toMatchObject({ slug: 'a', phase: 'pre', order: 1, dependencies: [] });
+        expect(graph.nodes.get('d')).toMatchObject({ slug: 'd', phase: 'modeling', order: 4, dependencies: ['b', 'c'] });
+        // edges: a → [b, c] (b and c depend on a)
+        const aSuccessors = graph.edges.get('a') ?? [];
+        expect(aSuccessors).toContain('b');
+        expect(aSuccessors).toContain('c');
+        // edges: b → [d], c → [d]
+        expect(graph.edges.get('b')).toContain('d');
+        expect(graph.edges.get('c')).toContain('d');
+    });
+    it('marks disabled steps per preset enablement map', () => {
+        const preset = new Map([
+            ['a', { enabled: true }],
+            ['b', { enabled: false }],
+            ['c', { enabled: true }],
+            ['d', { enabled: true }],
+        ]);
+        const graph = buildGraph(frontmatters, preset);
+        expect(graph.nodes.get('b')?.enabled).toBe(false);
+        expect(graph.nodes.get('a')?.enabled).toBe(true);
+    });
+    it('defaults enabled to true when step not in preset map', () => {
+        const graph = buildGraph(frontmatters, new Map());
+        for (const node of graph.nodes.values()) {
+            expect(node.enabled).toBe(true);
+        }
+    });
+});
+// ---------------------------------------------------------------------------
+// topologicalSort
+// ---------------------------------------------------------------------------
+describe('topologicalSort', () => {
+    it('produces valid ordering — no step before its dependencies', () => {
+        const graph = buildGraph(frontmatters, allEnabled);
+        const order = topologicalSort(graph);
+        expect(order).toHaveLength(4);
+        const indexOf = (slug) => order.indexOf(slug);
+        // b comes after a
+        expect(indexOf('a')).toBeLessThan(indexOf('b'));
+        // c comes after a
+        expect(indexOf('a')).toBeLessThan(indexOf('c'));
+        // d comes after b and c
+        expect(indexOf('b')).toBeLessThan(indexOf('d'));
+        expect(indexOf('c')).toBeLessThan(indexOf('d'));
+    });
+    it('is deterministic (same input → same order)', () => {
+        const graph = buildGraph(frontmatters, allEnabled);
+        const order1 = topologicalSort(graph);
+        const order2 = topologicalSort(graph);
+        expect(order1).toEqual(order2);
+    });
+    it('uses order field as primary tiebreaker', () => {
+        // a and b both have no deps but different order values
+        const fms = [
+            makeFm('z', 'pre', 10, []),
+            makeFm('a', 'pre', 1, []),
+        ];
+        const preset = new Map([
+            ['z', { enabled: true }],
+            ['a', { enabled: true }],
+        ]);
+        const graph = buildGraph(fms, preset);
+        const order = topologicalSort(graph);
+        // 'a' has lower order (1) → comes first
+        expect(order[0]).toBe('a');
+        expect(order[1]).toBe('z');
+    });
+    it('returns all nodes for an acyclic graph', () => {
+        const graph = buildGraph(frontmatters, allEnabled);
+        const result = topologicalSort(graph);
+        expect(result).toHaveLength(graph.nodes.size);
+    });
+});
+// ---------------------------------------------------------------------------
+// detectCycles
+// ---------------------------------------------------------------------------
+describe('detectCycles', () => {
+    it('returns empty array for acyclic graph', () => {
+        const graph = buildGraph(frontmatters, allEnabled);
+        const errors = detectCycles(graph);
+        expect(errors).toHaveLength(0);
+    });
+    it('detects cycle and returns DEP_CYCLE_DETECTED error', () => {
+        // x → y → x (cycle)
+        const fms = [
+            makeFm('x', 'pre', 1, ['y']),
+            makeFm('y', 'pre', 2, ['x']),
+        ];
+        const preset = new Map([
+            ['x', { enabled: true }],
+            ['y', { enabled: true }],
+        ]);
+        const graph = buildGraph(fms, preset);
+        const errors = detectCycles(graph);
+        const cycleError = errors.find(e => e.code === 'DEP_CYCLE_DETECTED');
+        expect(cycleError).toBeDefined();
+        expect(cycleError?.exitCode).toBe(1); // ExitCode.ValidationError
+    });
+    it('detects self-reference (DEP_SELF_REFERENCE)', () => {
+        const fms = [
+            makeFm('self', 'pre', 1, ['self']),
+        ];
+        const preset = new Map([['self', { enabled: true }]]);
+        const graph = buildGraph(fms, preset);
+        const errors = detectCycles(graph);
+        const selfErr = errors.find(e => e.code === 'DEP_SELF_REFERENCE');
+        expect(selfErr).toBeDefined();
+        expect(selfErr?.context?.step).toBe('self');
+    });
+    it('detects unknown dependency (DEP_TARGET_MISSING)', () => {
+        const fms = [
+            makeFm('a', 'pre', 1, []),
+            makeFm('b', 'pre', 2, ['a', 'nonexistent']),
+        ];
+        const preset = new Map([
+            ['a', { enabled: true }],
+            ['b', { enabled: true }],
+        ]);
+        const graph = buildGraph(fms, preset);
+        const errors = detectCycles(graph);
+        const missingErr = errors.find(e => e.code === 'DEP_TARGET_MISSING');
+        expect(missingErr).toBeDefined();
+        expect(missingErr?.context?.step).toBe('b');
+        expect(missingErr?.context?.dependency).toBe('nonexistent');
+        expect(missingErr?.exitCode).toBe(2); // ExitCode.MissingDependency
+    });
+});
+//# sourceMappingURL=dependency.test.js.map

package/dist/core/dependency/dependency.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency.test.js","sourceRoot":"","sources":["../../../src/core/dependency/dependency.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAE7C,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAA;AACvC,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAA;AAE/D,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E,SAAS,MAAM,CACb,IAAY,EACZ,KAAa,EACb,KAAa,EACb,YAAsB;IAEtB,OAAO;QACL,IAAI;QACJ,WAAW,EAAE,GAAG,IAAI,OAAO;QAC3B,KAAK;QACL,KAAK;QACL,YAAY;QACZ,OAAO,EAAE,CAAC,OAAO,IAAI,KAAK,CAAC;QAC3B,WAAW,EAAE,IAAI;QACjB,aAAa,EAAE,EAAE;QACjB,KAAK,EAAE,EAAE;KACV,CAAA;AACH,CAAC;AAED,MAAM,YAAY,GAA4B;IAC5C,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;IACzB,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC5B,MAAM,CAAC,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACjC,MAAM,CAAC,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;CACvC,CAAA;AAED,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IACxB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IACxB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IACxB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;CACzB,CAAC,CAAA;AAEF,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IAC1B,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,UAAU,CAAC,YAAY,EAAE,UAAU,CAAC,CAAA;QAElD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,CAAA;QACnG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;QAEhH,0CAA0C;QAC1C,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAA;QAC9C,MAAM,CAAC,WAAW,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;QAClC,MAAM,CAAC,WAAW,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;QAElC,0BAA0B;QAC1B,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;QAC3C,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;IAC7C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC;YACrB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;YACxB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;YACzB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;YACxB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;SACzB,CAAC,CAAA;QACF,MAAM,KAAK,GAAG,UAAU,CAAC,YAAY,EAAE,MAAM,CAAC,CAAA;QAE9C,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACjD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAClD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;QACjD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjC,CAAC;IACH,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,KAAK,GAAG,UAAU,CAAC,YAAY,EAAE,UAAU,CAAC,CAAA;QAClD,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;QAEpC,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAE7B,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACrD,kBAAkB;QAClB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/C,kBAAkB;QAClB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/C,wBAAwB;QACxB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;QAC/C,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;IACjD,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,UAAU,CAAC,YAAY,EAAE,UAAU,CAAC,CAAA;QAClD,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;QACrC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;QACrC,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAChC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,uDAAuD;QACvD,MAAM,GAAG,GAA4B;YACnC,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;SAC1B,CAAA;QACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC;YACrB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;YACxB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;SACzB,CAAC,CAAA;QACF,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;QACrC,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;QACpC,wCAAwC;QACxC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC1B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAC5B,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,KAAK,GAAG,UAAU,CAAC,YAAY,EAAE,UAAU,CAAC,CAAA;QAClD,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;QACrC,MAAM,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;IAC/C,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA;AAEF,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,KAAK,GAAG,UAAU,CAAC,YAAY,EAAE,UAAU,CAAC,CAAA;QAClD,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAA;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;IAChC,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,oBAAoB;QACpB,MAAM,GAAG,GAA4B;YACnC,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;SAC7B,CAAA;QACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC;YACrB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;YACxB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;SACzB,CAAC,CAAA;QACF,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;QACrC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAA;QAElC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,oBAAoB,CAAC,CAAA;QACpE,MAAM,CAAC,UAAU,CAAC,CAAC,WAAW,EAAE,CAAA;QAChC,MAAM,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA,CAAC,2BAA2B;IAClE,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,GAAG,GAA4B;YACnC,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;SACnC,CAAA;QACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;QACrD,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;QACrC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAA;QAElC,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,oBAAoB,CAAC,CAAA;QACjE,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAA;QAC7B,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC7C,CAAC,CAAC,CAAA;IAEF,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,GAAG,GAA4B;YACnC,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;SAC5C,CAAA;QACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC;YACrB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;YACxB,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;SACzB,CAAC,CAAA;QACF,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;QACrC,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAA;QAElC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,oBAAoB,CAAC,CAAA;QACpE,MAAM,CAAC,UAAU,CAAC,CAAC,WAAW,EAAE,CAAA;QAChC,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAC3C,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAA;QAC3D,MAAM,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA,CAAC,6BAA6B;IACpE,CAAC,CAAC,CAAA;AACJ,CAAC,CAAC,CAAA"}

package/dist/core/dependency/eligibility.d.ts

@@ -0,0 +1,17 @@
+import type { DependencyGraph } from '../../types/index.js';
+import type { StepStateEntry } from '../../types/index.js';
+/**
+ * Return the list of enabled, pending steps whose dependencies are all
+ * satisfied (completed, skipped, or disabled).
+ *
+ * Steps absent from `steps` are treated as pending.
+ */
+export declare function computeEligible(graph: DependencyGraph, steps: Record<string, StepStateEntry>): string[];
+/**
+ * Group enabled steps into sets that can run concurrently.
+ *
+ * Simple implementation: group by phase, then sort phases by PHASE_SORT_ORDER.
+ * Within each phase, steps are sorted by order field then slug.
+ */
+export declare function getParallelSets(graph: DependencyGraph): string[][];
+//# sourceMappingURL=eligibility.d.ts.map

package/dist/core/dependency/eligibility.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"eligibility.d.ts","sourceRoot":"","sources":["../../../src/core/dependency/eligibility.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAA;AAC3D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAA;AAG1D;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,eAAe,EACtB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,GACpC,MAAM,EAAE,CA6BV;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,EAAE,EAAE,CAqBlE"}

package/dist/core/dependency/eligibility.js

@@ -0,0 +1,60 @@
+import { PHASE_SORT_ORDER } from './dependency.js';
+/**
+ * Return the list of enabled, pending steps whose dependencies are all
+ * satisfied (completed, skipped, or disabled).
+ *
+ * Steps absent from `steps` are treated as pending.
+ */
+export function computeEligible(graph, steps) {
+    const eligible = [];
+    for (const [slug, node] of graph.nodes) {
+        // Skip disabled steps — they are never candidates for execution
+        if (!node.enabled)
+            continue;
+        const status = steps[slug]?.status;
+        // Only pending steps (or steps not yet in state) are candidates
+        if (status !== 'pending' && status !== undefined)
+            continue;
+        // All dependencies must be completed, skipped, or disabled
+        const depsOk = node.dependencies.every(dep => {
+            const depNode = graph.nodes.get(dep);
+            // Disabled deps count as satisfied
+            if (depNode && !depNode.enabled)
+                return true;
+            const depStatus = steps[dep]?.status;
+            return depStatus === 'completed' || depStatus === 'skipped';
+        });
+        if (depsOk)
+            eligible.push(slug);
+    }
+    // Stable sort: order field (primary), slug alphabetical (secondary)
+    return eligible.sort((a, b) => {
+        const nodeA = graph.nodes.get(a);
+        const nodeB = graph.nodes.get(b);
+        return nodeA.order - nodeB.order || a.localeCompare(b);
+    });
+}
+/**
+ * Group enabled steps into sets that can run concurrently.
+ *
+ * Simple implementation: group by phase, then sort phases by PHASE_SORT_ORDER.
+ * Within each phase, steps are sorted by order field then slug.
+ */
+export function getParallelSets(graph) {
+    const phaseMap = new Map();
+    for (const [slug, node] of graph.nodes) {
+        if (!node.enabled)
+            continue;
+        const { phase } = node;
+        if (!phaseMap.has(phase))
+            phaseMap.set(phase, []);
+        phaseMap.get(phase).push(slug);
+    }
+    const sortedPhases = [...phaseMap.keys()].sort((a, b) => (PHASE_SORT_ORDER[a] ?? 99) - (PHASE_SORT_ORDER[b] ?? 99));
+    return sortedPhases.map(phase => (phaseMap.get(phase) ?? []).sort((a, b) => {
+        const nodeA = graph.nodes.get(a);
+        const nodeB = graph.nodes.get(b);
+        return nodeA.order - nodeB.order || a.localeCompare(b);
+    }));
+}
+//# sourceMappingURL=eligibility.js.map