@hongmaple0820/med-scale-research-os 0.43.0

package/dist/workflow/quality/HonestDelivery.d.ts

@@ -0,0 +1,19 @@
+import type { DeliveryReport, VerificationResult } from '../types.js';
+export declare class HonestDelivery {
+    private completedItems;
+    private verifiedItems;
+    private unverifiedItems;
+    private blockers;
+    private recommendations;
+    addCompleted(item: string): void;
+    addVerified(result: VerificationResult): void;
+    addUnverified(item: string): void;
+    addBlocker(blocker: string): void;
+    addRecommendation(rec: string): void;
+    generate(): DeliveryReport;
+    formatReport(report: DeliveryReport): string;
+    static createFromGateResults(gateResults: Map<string, {
+        passed: boolean;
+        evidence: string;
+    }>): DeliveryReport;
+}

package/dist/workflow/quality/HonestDelivery.js

@@ -0,0 +1,77 @@
+// SCALE Engine — Honest Delivery
+// 诚实交付报告生成器
+export class HonestDelivery {
+    constructor() {
+        this.completedItems = [];
+        this.verifiedItems = [];
+        this.unverifiedItems = [];
+        this.blockers = [];
+        this.recommendations = [];
+    }
+    addCompleted(item) {
+        this.completedItems.push(item);
+    }
+    addVerified(result) {
+        this.verifiedItems.push(result);
+    }
+    addUnverified(item) {
+        this.unverifiedItems.push(item);
+    }
+    addBlocker(blocker) {
+        this.blockers.push(blocker);
+    }
+    addRecommendation(rec) {
+        this.recommendations.push(rec);
+    }
+    generate() {
+        return {
+            completed: this.completedItems,
+            verified: this.verifiedItems,
+            unverified: this.unverifiedItems,
+            blockers: this.blockers,
+            recommendations: this.recommendations
+        };
+    }
+    formatReport(report) {
+        const lines = [];
+        lines.push('=== Honest Delivery Report ===');
+        lines.push('');
+        lines.push('[COMPLETED]');
+        report.completed.forEach(item => lines.push(`  - ${item}`));
+        lines.push('');
+        lines.push('[VERIFIED]');
+        report.verified.forEach(v => {
+            const status = v.passed ? '[PASS]' : '[FAIL]';
+            lines.push(`  ${status} ${v.criterion}: ${v.evidence}`);
+        });
+        lines.push('');
+        if (report.unverified.length > 0) {
+            lines.push('[UNVERIFIED] - Must mark with ⚠️[UNVERIFIED]');
+            report.unverified.forEach(item => lines.push(`  ⚠️[UNVERIFIED] ${item}`));
+            lines.push('');
+        }
+        if (report.blockers.length > 0) {
+            lines.push('[BLOCKERS]');
+            report.blockers.forEach(b => lines.push(`  - ${b}`));
+            lines.push('');
+        }
+        if (report.recommendations.length > 0) {
+            lines.push('[RECOMMENDATIONS]');
+            report.recommendations.forEach(r => lines.push(`  - ${r}`));
+        }
+        return lines.join('\n');
+    }
+    static createFromGateResults(gateResults) {
+        const delivery = new HonestDelivery();
+        for (const [gate, result] of gateResults) {
+            if (result.passed) {
+                delivery.addVerified({ criterion: gate, passed: true, evidence: result.evidence });
+            }
+            else {
+                delivery.addBlocker(`${gate}: ${result.evidence}`);
+            }
+        }
+        return delivery.generate();
+    }
+}
+//# sourceMappingURL=HonestDelivery.js.map

package/dist/workflow/quality/HonestDelivery.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HonestDelivery.js","sourceRoot":"","sources":["../../../src/workflow/quality/HonestDelivery.ts"],"names":[],"mappings":"AAAA,iCAAiC;AACjC,YAAY;AAIZ,MAAM,OAAO,cAAc;IAA3B;QACU,mBAAc,GAAa,EAAE,CAAA;QAC7B,kBAAa,GAAyB,EAAE,CAAA;QACxC,oBAAe,GAAa,EAAE,CAAA;QAC9B,aAAQ,GAAa,EAAE,CAAA;QACvB,oBAAe,GAAa,EAAE,CAAA;IAyExC,CAAC;IAvEC,YAAY,CAAC,IAAY;QACvB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAChC,CAAC;IAED,WAAW,CAAC,MAA0B;QACpC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACjC,CAAC;IAED,aAAa,CAAC,IAAY;QACxB,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACjC,CAAC;IAED,UAAU,CAAC,OAAe;QACxB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IAC7B,CAAC;IAED,iBAAiB,CAAC,GAAW;QAC3B,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAChC,CAAC;IAED,QAAQ;QACN,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,cAAc;YAC9B,QAAQ,EAAE,IAAI,CAAC,aAAa;YAC5B,UAAU,EAAE,IAAI,CAAC,eAAe;YAChC,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,eAAe,EAAE,IAAI,CAAC,eAAe;SACtC,CAAA;IACH,CAAC;IAED,YAAY,CAAC,MAAsB;QACjC,MAAM,KAAK,GAAa,EAAE,CAAA;QAC1B,KAAK,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAA;QAC5C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACd,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAA;QACzB,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAA;QAC3D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACd,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;QACxB,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YAC1B,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAA;YAC7C,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAA;QACzD,CAAC,CAAC,CAAA;QACF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACd,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAA;YAC1D,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,oBAAoB,IAAI,EAAE,CAAC,CAAC,CAAA;YACzE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAChB,CAAC;QACD,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;YACxB,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAA;YACpD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAChB,CAAC;QACD,IAAI,MAAM,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAA;YAC/B,MAAM,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAA;QAC7D,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACzB,CAAC;IAED,MAAM,CAAC,qBAAqB,CAAC,WAA+D;QAC1F,MAAM,QAAQ,GAAG,IAAI,cAAc,EAAE,CAAA;QACrC,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YACzC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;gBAClB,QAAQ,CAAC,WAAW,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAA;YACpF,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,UAAU,CAAC,GAAG,IAAI,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAA;YACpD,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC,QAAQ,EAAE,CAAA;IAC5B,CAAC;CACF"}

package/dist/workflow/quality/KarpathyEvaluator.d.ts

@@ -0,0 +1,18 @@
+import type { KarpathyCheck } from '../types.js';
+export declare class KarpathyEvaluator {
+    private checks;
+    checkK1(hypothesesListed: boolean): KarpathyCheck;
+    checkK2(hasExtraFeatures: boolean): KarpathyCheck;
+    checkK3(changesTraceable: boolean): KarpathyCheck;
+    checkK4(hasVerifiableGoal: boolean): KarpathyCheck;
+    evaluateAll(context: {
+        hypothesesListed: boolean;
+        hasExtraFeatures: boolean;
+        changesTraceable: boolean;
+        hasVerifiableGoal: boolean;
+    }): KarpathyCheck[];
+    getChecks(): KarpathyCheck[];
+    allPassed(): boolean;
+    getViolations(): string[];
+    formatReport(): string;
+}

package/dist/workflow/quality/KarpathyEvaluator.js

@@ -0,0 +1,76 @@
+// SCALE Engine — Karpathy Evaluator
+// Karpathy 编码原则检查器
+export class KarpathyEvaluator {
+    constructor() {
+        this.checks = [];
+    }
+    checkK1(hypothesesListed) {
+        const check = {
+            principle: 'K1',
+            description: 'THINK: 列出假设，再动手',
+            passed: hypothesesListed,
+            violation: hypothesesListed ? undefined : '未列出假设就开始编码'
+        };
+        this.checks.push(check);
+        return check;
+    }
+    checkK2(hasExtraFeatures) {
+        const check = {
+            principle: 'K2',
+            description: 'SIMPLE: 禁止未要求的功能',
+            passed: !hasExtraFeatures,
+            violation: hasExtraFeatures ? '添加了未要求的功能' : undefined
+        };
+        this.checks.push(check);
+        return check;
+    }
+    checkK3(changesTraceable) {
+        const check = {
+            principle: 'K3',
+            description: 'SURGICAL: 修改可追溯，最小变更',
+            passed: changesTraceable,
+            violation: changesTraceable ? undefined : '修改不可追溯或范围过大'
+        };
+        this.checks.push(check);
+        return check;
+    }
+    checkK4(hasVerifiableGoal) {
+        const check = {
+            principle: 'K4',
+            description: 'GOAL: 可验证目标，明确验收',
+            passed: hasVerifiableGoal,
+            violation: hasVerifiableGoal ? undefined : '缺少可验证目标'
+        };
+        this.checks.push(check);
+        return check;
+    }
+    evaluateAll(context) {
+        this.checks = [];
+        this.checkK1(context.hypothesesListed);
+        this.checkK2(context.hasExtraFeatures);
+        this.checkK3(context.changesTraceable);
+        this.checkK4(context.hasVerifiableGoal);
+        return this.checks;
+    }
+    getChecks() {
+        return this.checks;
+    }
+    allPassed() {
+        return this.checks.every(c => c.passed);
+    }
+    getViolations() {
+        return this.checks.filter(c => !c.passed).map(c => `${c.principle}: ${c.violation}`);
+    }
+    formatReport() {
+        const lines = ['=== Karpathy Principles Check ==='];
+        this.checks.forEach(c => {
+            const status = c.passed ? '[PASS]' : '[FAIL]';
+            lines.push(`${status} ${c.principle} (${c.description})`);
+            if (c.violation) {
+                lines.push(`     Violation: ${c.violation}`);
+            }
+        });
+        return lines.join('\n');
+    }
+}
+//# sourceMappingURL=KarpathyEvaluator.js.map

package/dist/workflow/quality/KarpathyEvaluator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"KarpathyEvaluator.js","sourceRoot":"","sources":["../../../src/workflow/quality/KarpathyEvaluator.ts"],"names":[],"mappings":"AAAA,oCAAoC;AACpC,mBAAmB;AAInB,MAAM,OAAO,iBAAiB;IAA9B;QACU,WAAM,GAAoB,EAAE,CAAA;IAmFtC,CAAC;IAjFC,OAAO,CAAC,gBAAyB;QAC/B,MAAM,KAAK,GAAkB;YAC3B,SAAS,EAAE,IAAI;YACf,WAAW,EAAE,iBAAiB;YAC9B,MAAM,EAAE,gBAAgB;YACxB,SAAS,EAAE,gBAAgB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY;SACvD,CAAA;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACvB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,OAAO,CAAC,gBAAyB;QAC/B,MAAM,KAAK,GAAkB;YAC3B,SAAS,EAAE,IAAI;YACf,WAAW,EAAE,kBAAkB;YAC/B,MAAM,EAAE,CAAC,gBAAgB;YACzB,SAAS,EAAE,gBAAgB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS;SACtD,CAAA;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACvB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,OAAO,CAAC,gBAAyB;QAC/B,MAAM,KAAK,GAAkB;YAC3B,SAAS,EAAE,IAAI;YACf,WAAW,EAAE,sBAAsB;YACnC,MAAM,EAAE,gBAAgB;YACxB,SAAS,EAAE,gBAAgB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,aAAa;SACxD,CAAA;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACvB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,OAAO,CAAC,iBAA0B;QAChC,MAAM,KAAK,GAAkB;YAC3B,SAAS,EAAE,IAAI;YACf,WAAW,EAAE,kBAAkB;YAC/B,MAAM,EAAE,iBAAiB;YACzB,SAAS,EAAE,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;SACrD,CAAA;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACvB,OAAO,KAAK,CAAA;IACd,CAAC;IAED,WAAW,CAAC,OAKX;QACC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAA;QAChB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAA;QACtC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAA;QACtC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAA;QACtC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAA;QACvC,OAAO,IAAI,CAAC,MAAM,CAAA;IACpB,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAA;IACpB,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;IACzC,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC,CAAA;IACtF,CAAC;IAED,YAAY;QACV,MAAM,KAAK,GAAa,CAAC,mCAAmC,CAAC,CAAA;QAC7D,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACtB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAA;YAC7C,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,WAAW,GAAG,CAAC,CAAA;YACzD,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;gBAChB,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,SAAS,EAAE,CAAC,CAAA;YAC9C,CAAC;QACH,CAAC,CAAC,CAAA;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACzB,CAAC;CACF"}

package/dist/workflow/types.d.ts

@@ -0,0 +1,151 @@
+export type GateStage = 'G0' | 'G1' | 'G2' | 'G3' | 'G4' | 'G5' | 'G6' | 'G7' | 'G8' | 'G9' | 'G10' | 'G11' | 'G12' | 'G13' | 'G14' | 'G15' | 'G16' | 'G17' | 'G18' | 'G19' | 'G20' | 'G21' | 'G22';
+export type GateStatus = 'PENDING' | 'PASSED' | 'FAILED' | 'BLOCKED';
+export type ModelTier = 'LOW' | 'MEDIUM' | 'HIGH';
+export type Verdict = 'APPROVE' | 'ITERATE' | 'REJECT';
+export interface GateEvidence {
+    id: string;
+    kind: 'file' | 'command' | 'manual' | 'scan';
+    label: string;
+    passed: boolean;
+    detail: string;
+    command?: string;
+    exitCode?: number;
+    path?: string;
+    durationMs?: number;
+    cwd?: string;
+    startedAt?: number;
+    endedAt?: number;
+    stdoutTail?: string;
+    stderrTail?: string;
+    outputHash?: string;
+    rawEstimatedTokens?: number;
+    compressedEstimatedTokens?: number;
+    savedEstimatedTokens?: number;
+    compressionRatio?: number;
+    commandRunEvidenceId?: string;
+    source?: string;
+}
+export interface GateResult {
+    gate: GateStage;
+    status: GateStatus;
+    passed: boolean;
+    evidence: string;
+    evidenceItems?: GateEvidence[];
+    evidenceRecordId?: string;
+    blockers: string[];
+    durationMs: number;
+}
+export interface AmbiguityDimensions {
+    goalClarity: number;
+    inputOutputBoundary: number;
+    techStackConstraints: number;
+    timeConstraints: number;
+    qualityStandards: number;
+    riskBoundaries: number;
+    acceptanceCriteria: number;
+}
+export interface AmbiguityScoreResult {
+    totalScore: number;
+    dimensions: AmbiguityDimensions;
+    threshold: number;
+    shouldProceed: boolean;
+    requiresQuestioning: boolean;
+    blocked: boolean;
+}
+export interface RALPLANOutput {
+    principles: string[];
+    decisionDrivers: string[];
+    viableOptions: ViableOption[];
+    preMortem: PreMortemAnalysis;
+    verdict: Verdict;
+    iterationCount: number;
+}
+export interface ViableOption {
+    name: string;
+    description: string;
+    pros: string[];
+    cons: string[];
+    selected: boolean;
+}
+export interface PreMortemAnalysis {
+    assumedFailure: string;
+    rootCauses: string[];
+    mitigations: string[];
+}
+export interface UserStory {
+    id: string;
+    title: string;
+    description: string;
+    acceptanceCriteria: string[];
+    passes: boolean;
+    verificationResults: VerificationResult[];
+}
+export interface VerificationResult {
+    criterion: string;
+    passed: boolean;
+    evidence: string;
+}
+export interface PRDDocument {
+    id: string;
+    title: string;
+    userStories: UserStory[];
+    allStoriesPassed: boolean;
+    deslopPassed: boolean;
+    iterations: number;
+}
+export interface DeliveryReport {
+    completed: string[];
+    verified: VerificationResult[];
+    unverified: string[];
+    blockers: string[];
+    recommendations: string[];
+}
+export interface KarpathyCheck {
+    principle: 'K1' | 'K2' | 'K3' | 'K4';
+    description: string;
+    passed: boolean;
+    violation?: string;
+}
+export interface TaskDefinition {
+    id: string;
+    description: string;
+    tier: ModelTier;
+    dependencies: string[];
+    status: 'PENDING' | 'RUNNING' | 'COMPLETED' | 'FAILED';
+    assignedAgent?: string;
+}
+export interface ConsensusRound {
+    round: number;
+    plannerOutput: string;
+    architectReview: string;
+    criticReview: string;
+    verdict: Verdict;
+}
+export type SocraticCategory = 'goal' | 'constraint' | 'acceptance' | 'context' | 'risk' | 'priority';
+export interface SocraticQuestion {
+    id: string;
+    category: SocraticCategory;
+    question: string;
+    followUps: string[];
+    answered: boolean;
+    answer?: string;
+    clarityScore: number;
+}
+export interface SocraticSession {
+    sessionId: string;
+    requirement: string;
+    initialAmbiguity: AmbiguityScoreResult;
+    questions: SocraticQuestion[];
+    currentRound: number;
+    maxRounds: number;
+    status: 'in_progress' | 'refined' | 'blocked';
+    finalAmbiguity?: AmbiguityScoreResult;
+    refinementHistory: RefinementRound[];
+}
+export interface RefinementRound {
+    round: number;
+    questionsAsked: string[];
+    answersReceived: string[];
+    ambiguityBefore: number;
+    ambiguityAfter: number;
+}

package/dist/workflow/types.js

@@ -0,0 +1,4 @@
+// SCALE Engine — Workflow Types
+// 核心工作流类型定义
+export {};
+//# sourceMappingURL=types.js.map

package/dist/workflow/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/workflow/types.ts"],"names":[],"mappings":"AAAA,gCAAgC;AAChC,YAAY"}

package/dist/workflows/DAGBuilder.d.ts

@@ -0,0 +1,52 @@
+import type { WorkflowStepDef, DAGNode, DAGExecutionGraph } from '../agents/types.js';
+/**
+ * DAGBuilder — 构建 DAG 执行图
+ *
+ * 核心功能：
+ * - 解析 depends_on 依赖关系
+ * - Topological 排序确定执行层级
+ * - 检测循环依赖（抛出错误）
+ * - 分组并行执行步骤
+ */
+export declare class DAGBuilder {
+    /**
+     * 构建 DAG 执行图
+     * @param steps Workflow 步骤定义列表
+     * @returns DAG 执行图（含层级分组）
+     */
+    buildGraph(steps: WorkflowStepDef[]): DAGExecutionGraph;
+    /**
+     * 计算节点执行层级
+     * Level 0 = 无依赖，可立即执行
+     * Level N = 依赖 Level N-1 的节点
+     */
+    private calculateLevels;
+    /**
+     * 检测循环依赖
+     * DFS 检查是否存在回到起点路径
+     */
+    hasCycle(nodes: Map<string, DAGNode>, startId: string): boolean;
+    /**
+     * 按层级分组节点
+     * 同层级节点可并行执行
+     */
+    groupByLevel(nodes: Map<string, DAGNode>): DAGNode[][];
+    /**
+     * 获取并行执行分组
+     * @param graph DAG 执行图
+     * @returns 可并行执行的步骤 ID 数组（按层级）
+     */
+    getParallelGroups(graph: DAGExecutionGraph): string[][];
+    /**
+     * 获取可立即执行的步骤（Level 0）
+     */
+    getReadySteps(graph: DAGExecutionGraph): WorkflowStepDef[];
+    /**
+     * 获取下一步可执行的步骤（当前层级完成后）
+     * @param graph DAG 执行图
+     * @param completedIds 已完成的步骤 IDs
+     */
+    getNextReadySteps(graph: DAGExecutionGraph, completedIds: Set<string>): WorkflowStepDef[];
+}
+/** 默认 DAGBuilder 实例 */
+export declare const defaultDAGBuilder: DAGBuilder;

package/dist/workflows/DAGBuilder.js

@@ -0,0 +1,169 @@
+// SCALE Engine — DAG Builder (v0.10.0)
+// DAG 工作流构建器：解析依赖关系、检测并行执行机会
+/**
+ * DAGBuilder — 构建 DAG 执行图
+ *
+ * 核心功能：
+ * - 解析 depends_on 依赖关系
+ * - Topological 排序确定执行层级
+ * - 检测循环依赖（抛出错误）
+ * - 分组并行执行步骤
+ */
+export class DAGBuilder {
+    /**
+     * 构建 DAG 执行图
+     * @param steps Workflow 步骤定义列表
+     * @returns DAG 执行图（含层级分组）
+     */
+    buildGraph(steps) {
+        // 1. 创建节点映射
+        const nodes = new Map();
+        for (const step of steps) {
+            nodes.set(step.id, {
+                stepId: step.id,
+                step,
+                dependencies: step.depends_on || [],
+                dependents: [], // 后续填充
+                level: 0 // 后续计算
+            });
+        }
+        // 2. 填充 dependents（反向依赖）
+        for (const [id, node] of nodes) {
+            for (const depId of node.dependencies) {
+                const depNode = nodes.get(depId);
+                if (depNode) {
+                    depNode.dependents.push(id);
+                }
+            }
+        }
+        // 3. 检测循环依赖
+        for (const [id] of nodes) {
+            if (this.hasCycle(nodes, id)) {
+                throw new Error(`Circular dependency detected: ${id}`);
+            }
+        }
+        // 4. 计算执行层级（Topological 排序）
+        this.calculateLevels(nodes);
+        // 5. 按层级分组
+        const levels = this.groupByLevel(nodes);
+        const maxLevel = levels.length - 1;
+        return { nodes, levels, maxLevel };
+    }
+    /**
+     * 计算节点执行层级
+     * Level 0 = 无依赖，可立即执行
+     * Level N = 依赖 Level N-1 的节点
+     */
+    calculateLevels(nodes) {
+        const visited = new Set();
+        // BFS 计算层级
+        const queue = [];
+        // 找到所有 Level 0 节点（无依赖）
+        for (const [id, node] of nodes) {
+            if (node.dependencies.length === 0) {
+                node.level = 0;
+                queue.push(id);
+                visited.add(id);
+            }
+        }
+        // 逐层计算
+        while (queue.length > 0) {
+            const currentId = queue.shift();
+            const currentNode = nodes.get(currentId);
+            // 更新依赖此节点的层级
+            for (const depId of currentNode.dependents) {
+                const depNode = nodes.get(depId);
+                if (!visited.has(depId)) {
+                    // 层级 = max(前置层级) + 1
+                    const maxDepLevel = Math.max(...depNode.dependencies.map(d => nodes.get(d)?.level ?? 0));
+                    depNode.level = maxDepLevel + 1;
+                    visited.add(depId);
+                    queue.push(depId);
+                }
+            }
+        }
+    }
+    /**
+     * 检测循环依赖
+     * DFS 检查是否存在回到起点路径
+     */
+    hasCycle(nodes, startId) {
+        const visited = new Set();
+        const recursionStack = new Set();
+        const dfs = (id) => {
+            visited.add(id);
+            recursionStack.add(id);
+            const node = nodes.get(id);
+            if (!node)
+                return false;
+            for (const depId of node.dependencies) {
+                if (!visited.has(depId)) {
+                    if (dfs(depId))
+                        return true;
+                }
+                else if (recursionStack.has(depId)) {
+                    return true; // 找到循环
+                }
+            }
+            recursionStack.delete(id);
+            return false;
+        };
+        return dfs(startId);
+    }
+    /**
+     * 按层级分组节点
+     * 同层级节点可并行执行
+     */
+    groupByLevel(nodes) {
+        const levelMap = new Map();
+        for (const [, node] of nodes) {
+            const level = node.level;
+            if (!levelMap.has(level)) {
+                levelMap.set(level, []);
+            }
+            levelMap.get(level).push(node);
+        }
+        // 转换为数组（按层级排序）
+        const levels = [];
+        for (let i = 0; i <= Math.max(...levelMap.keys()); i++) {
+            levels.push(levelMap.get(i) || []);
+        }
+        return levels;
+    }
+    /**
+     * 获取并行执行分组
+     * @param graph DAG 执行图
+     * @returns 可并行执行的步骤 ID 数组（按层级）
+     */
+    getParallelGroups(graph) {
+        return graph.levels.map(level => level.map(n => n.stepId));
+    }
+    /**
+     * 获取可立即执行的步骤（Level 0）
+     */
+    getReadySteps(graph) {
+        const level0 = graph.levels[0];
+        return level0?.map(n => n.step) || [];
+    }
+    /**
+     * 获取下一步可执行的步骤（当前层级完成后）
+     * @param graph DAG 执行图
+     * @param completedIds 已完成的步骤 IDs
+     */
+    getNextReadySteps(graph, completedIds) {
+        const ready = [];
+        for (const [id, node] of graph.nodes) {
+            if (completedIds.has(id))
+                continue; // 已完成
+            // 检查是否所有依赖都已完成
+            const allDepsCompleted = node.dependencies.every(depId => completedIds.has(depId));
+            if (allDepsCompleted) {
+                ready.push(node.step);
+            }
+        }
+        return ready;
+    }
+}
+/** 默认 DAGBuilder 实例 */
+export const defaultDAGBuilder = new DAGBuilder();
+//# sourceMappingURL=DAGBuilder.js.map

package/dist/workflows/DAGBuilder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DAGBuilder.js","sourceRoot":"","sources":["../../src/workflows/DAGBuilder.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,6BAA6B;AAI7B;;;;;;;;GAQG;AACH,MAAM,OAAO,UAAU;IACrB;;;;OAIG;IACH,UAAU,CAAC,KAAwB;QACjC,YAAY;QACZ,MAAM,KAAK,GAAG,IAAI,GAAG,EAAmB,CAAA;QAExC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;gBACjB,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,IAAI;gBACJ,YAAY,EAAE,IAAI,CAAC,UAAU,IAAI,EAAE;gBACnC,UAAU,EAAE,EAAE,EAAE,OAAO;gBACvB,KAAK,EAAE,CAAC,CAAC,OAAO;aACjB,CAAC,CAAA;QACJ,CAAC;QAED,yBAAyB;QACzB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtC,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;gBAChC,IAAI,OAAO,EAAE,CAAC;oBACZ,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;QAED,YAAY;QACZ,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,KAAK,CAAC,iCAAiC,EAAE,EAAE,CAAC,CAAA;YACxD,CAAC;QACH,CAAC;QAED,4BAA4B;QAC5B,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAA;QAE3B,WAAW;QACX,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;QACvC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;QAElC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAA;IACpC,CAAC;IAED;;;;OAIG;IACK,eAAe,CAAC,KAA2B;QACjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QAEjC,WAAW;QACX,MAAM,KAAK,GAAa,EAAE,CAAA;QAE1B,uBAAuB;QACvB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACnC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;gBACd,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACd,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACjB,CAAC;QACH,CAAC;QAED,OAAO;QACP,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;YAChC,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAE,CAAA;YAEzC,aAAa;YACb,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;gBAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAE,CAAA;gBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxB,qBAAqB;oBACrB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAC1B,GAAG,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAC3D,CAAA;oBACD,OAAO,CAAC,KAAK,GAAG,WAAW,GAAG,CAAC,CAAA;oBAC/B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;oBAClB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,QAAQ,CAAC,KAA2B,EAAE,OAAe;QACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QACjC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAA;QAExC,MAAM,GAAG,GAAG,CAAC,EAAU,EAAW,EAAE;YAClC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACf,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YAEtB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YAC1B,IAAI,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAA;YAEvB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACtC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACxB,IAAI,GAAG,CAAC,KAAK,CAAC;wBAAE,OAAO,IAAI,CAAA;gBAC7B,CAAC;qBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACrC,OAAO,IAAI,CAAA,CAAC,OAAO;gBACrB,CAAC;YACH,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YACzB,OAAO,KAAK,CAAA;QACd,CAAC,CAAA;QAED,OAAO,GAAG,CAAC,OAAO,CAAC,CAAA;IACrB,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,KAA2B;QACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqB,CAAA;QAE7C,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;YACxB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;YACzB,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjC,CAAC;QAED,eAAe;QACf,MAAM,MAAM,GAAgB,EAAE,CAAA;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACvD,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;QACpC,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;;OAIG;IACH,iBAAiB,CAAC,KAAwB;QACxC,OAAO,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAA;IAC5D,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,KAAwB;QACpC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC9B,OAAO,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAA;IACvC,CAAC;IAED;;;;OAIG;IACH,iBAAiB,CACf,KAAwB,EACxB,YAAyB;QAEzB,MAAM,KAAK,GAAsB,EAAE,CAAA;QAEnC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACrC,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAQ,CAAC,MAAM;YAEzC,eAAe;YACf,MAAM,gBAAgB,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;YAElF,IAAI,gBAAgB,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACvB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;CACF;AAED,uBAAuB;AACvB,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,UAAU,EAAE,CAAA"}

package/dist/workflows/GateParser.d.ts

@@ -0,0 +1,55 @@
+import type { Artifact } from "../artifact/types.js";
+export interface GateExpression {
+    type: "comparison" | "status_check" | "command_check" | "approval_check" | "compound";
+    field?: string;
+    operator?: string;
+    value?: string | number;
+    command?: string;
+    expressions?: GateExpression[];
+    connector?: "and" | "or";
+}
+export interface GateResult {
+    passed: boolean;
+    expression: string;
+    evaluated: GateExpression;
+    reason: string;
+    details?: Record<string, unknown>;
+}
+export interface IGateParser {
+    parse(expression: string): GateExpression;
+    evaluate(expr: GateExpression, context: {
+        artifact?: Artifact;
+        runCommand?: (cmd: string) => Promise<{
+            success: boolean;
+            output: string;
+        }>;
+    }): Promise<GateResult>;
+    evaluateString(expression: string, context: {
+        artifact?: Artifact;
+        runCommand?: (cmd: string) => Promise<{
+            success: boolean;
+            output: string;
+        }>;
+    }): Promise<GateResult>;
+}
+export declare class GateParser implements IGateParser {
+    parse(expression: string): GateExpression;
+    evaluate(expr: GateExpression, ctx: {
+        artifact?: Artifact;
+        runCommand?: (cmd: string) => Promise<{
+            success: boolean;
+            output: string;
+        }>;
+    }): Promise<GateResult>;
+    evaluateString(expr: string, ctx: {
+        artifact?: Artifact;
+        runCommand?: (cmd: string) => Promise<{
+            success: boolean;
+            output: string;
+        }>;
+    }): Promise<GateResult>;
+    private evalComparison;
+    private evalStatus;
+    private evalCommand;
+    private evalCompound;
+}