@plusplusoneplusplus/coc 1.0.2 → 1.0.4

package/node_modules/@plusplusoneplusplus/forge/dist/workflow/pipeline-compat.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipeline-compat.d.ts","sourceRoot":"","sources":["../../src/workflow/pipeline-compat.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,YAAY,IAAI,cAAc,EAAE,UAAU,IAAI,YAAY,EAAE,MAAM,mCAAmC,CAAC;AACpH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AAE3E;;GAEG;AACH,MAAM,WAAW,SAAS;IACtB,4DAA4D;IAC5D,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,6DAA6D;IAC7D,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,8DAA8D;IAC9D,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2FAA2F;IAC3F,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,mCAAmC;IACnC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,+EAA+E;IAC/E,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC3B,2BAA2B;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb;;;;;;;OAOG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,gFAAgF;IAChF,KAAK,CAAC,EAAE,WAAW,CAAC;IACpB,0CAA0C;IAC1C,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,0FAA0F;IAC1F,GAAG,CAAC,EAAE,SAAS,CAAC;IAChB,uFAAuF;IACvF,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,gEAAgE;IAChE,GAAG,CAAC,EAAE,SAAS,CAAC;IAChB,2EAA2E;IAC3E,UAAU,CAAC,EAAE,iBAAiB,EAAE,CAAC;IACjC,mFAAmF;IACnF,aAAa,CAAC,EAAE,mBAAmB,CAAC;CACvC;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACtB,yCAAyC;IACzC,IAAI,EAAE,KAAK,CAAC;IACZ,oEAAoE;IACpE,IAAI,EAAE,MAAM,CAAC;IACb,mCAAmC;IACnC,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,SAAS,CAS9D;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAC9B,qDAAqD;IACrD,IAAI,EAAE,MAAM,CAAC;IACb,sBAAsB;IACtB,KAAK,EAAE,MAAM,CAAC;CACjB;AAED;;;;;GAKG;AACH,MAAM,WAAW,mBAAmB;IAChC;;;OAGG;IACH,MAAM,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;CACzB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,mBAAmB,CAS7E;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACH,MAAM,WAAW,WAAW;IACxB,oCAAoC;IACpC,KAAK,CAAC,EAAE,YAAY,EAAE,CAAC;IAEvB;;;;OAIG;IACH,IAAI,CAAC,EAAE,SAAS,GAAG,YAAY,EAAE,CAAC;IAElC;;;;OAIG;IACH,QAAQ,CAAC,EAAE,mBAAmB,CAAC;IAE/B,sDAAsD;IACtD,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,mEAAmE;IACnE,UAAU,CAAC,EAAE,iBAAiB,EAAE,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACtB;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;;;;;OAQG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;;;;;;;OAUG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2FAA2F;IAC3F,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,+CAA+C;IAC/C,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;;OAKG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;;;;;;;;;;OAcG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IACzB,gFAAgF;IAChF,IAAI,EAAE,cAAc,CAAC;IACrB;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;;;;;OAQG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;;;;;;;OAUG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,gFAAgF;IAChF,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,4CAA4C;IAC5C,KAAK,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC5B,yCAAyC;IACzC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,mDAAmD;IACnD,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,kCAAkC;IAClC,QAAQ,CAAC,EAAE,cAAc,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC3B,mBAAmB;IACnB,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,qBAAqB;IACrB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,wCAAwC;IACxC,QAAQ,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,MAAM,cAAc,GACpB,QAAQ,GAAG,YAAY,GACvB,IAAI,GAAG,QAAQ,GACf,UAAU,GAAG,cAAc,GAC3B,cAAc,GAAG,WAAW,GAAG,KAAK,GAAG,KAAK,GAC5C,SAAS,CAAC;AAEhB;;GAEG;AACH,MAAM,WAAW,UAAU;IACvB,6BAA6B;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,0BAA0B;IAC1B,QAAQ,EAAE,cAAc,CAAC;IACzB,mEAAmE;IACnE,KAAK,CAAC,EAAE,GAAG,CAAC;IACZ,sDAAsD;IACtD,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,2CAA2C;IAC3C,OAAO,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC7B,2BAA2B;IAC3B,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,qDAAqD;IACrD,IAAI,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC3B,kDAAkD;IAClD,MAAM,EAAE,MAAM,CAAC;IACf,qDAAqD;IACrD,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,+CAA+C;IAC/C,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,4BAA4B;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iEAAiE;IACjE,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IACzB,kBAAkB;IAClB,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,QAAQ,CAAC;IAC/B,iEAAiE;IACjE,IAAI,CAAC,EAAE,gBAAgB,CAAC;IACxB,6DAA6D;IAC7D,EAAE,CAAC,EAAE,cAAc,CAAC;IACpB,8DAA8D;IAC9D,WAAW,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC;CAC9B;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IACxB,wBAAwB;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,+BAA+B;IAC/B,aAAa,EAAE,MAAM,CAAC;IACtB,+BAA+B;IAC/B,aAAa,EAAE,MAAM,CAAC;IACtB,qCAAqC;IACrC,eAAe,EAAE,MAAM,CAAC;IACxB,uBAAuB;IACvB,UAAU,EAAE,MAAM,GAAG,IAAI,GAAG,QAAQ,CAAC;CACxC;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IACzB,mCAAmC;IACnC,QAAQ,EAAE,YAAY,EAAE,CAAC;IACzB,mCAAmC;IACnC,QAAQ,EAAE,YAAY,EAAE,CAAC;IACzB,wBAAwB;IACxB,KAAK,EAAE,WAAW,CAAC;CACtB"}

package/node_modules/@plusplusoneplusplus/forge/dist/workflow/pipeline-compat.js

@@ -0,0 +1,31 @@
+"use strict";
+/**
+ * Pipeline YAML configuration types.
+ * Used by the compiler to translate legacy pipeline YAML into workflow DAG configs.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isCSVSource = isCSVSource;
+exports.isGenerateConfig = isGenerateConfig;
+/**
+ * Type guard to check if a value is a CSVSource
+ */
+function isCSVSource(value) {
+    return (typeof value === 'object' &&
+        value !== null &&
+        'type' in value &&
+        value.type === 'csv' &&
+        'path' in value &&
+        typeof value.path === 'string');
+}
+/**
+ * Type guard to check if a value is a GenerateInputConfig
+ */
+function isGenerateConfig(value) {
+    return (typeof value === 'object' &&
+        value !== null &&
+        'prompt' in value &&
+        typeof value.prompt === 'string' &&
+        'schema' in value &&
+        Array.isArray(value.schema));
+}
+//# sourceMappingURL=pipeline-compat.js.map

package/node_modules/@plusplusoneplusplus/forge/dist/workflow/pipeline-compat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipeline-compat.js","sourceRoot":"","sources":["../../src/workflow/pipeline-compat.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAqEH,kCASC;AA4CD,4CASC;AAjED;;GAEG;AACH,SAAgB,WAAW,CAAC,KAAc;IACtC,OAAO,CACH,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,MAAM,IAAI,KAAK;QACd,KAAmB,CAAC,IAAI,KAAK,KAAK;QACnC,MAAM,IAAI,KAAK;QACf,OAAQ,KAAmB,CAAC,IAAI,KAAK,QAAQ,CAChD,CAAC;AACN,CAAC;AAyCD;;GAEG;AACH,SAAgB,gBAAgB,CAAC,KAAc;IAC3C,OAAO,CACH,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,QAAQ,IAAI,KAAK;QACjB,OAAQ,KAA6B,CAAC,MAAM,KAAK,QAAQ;QACzD,QAAQ,IAAI,KAAK;QACjB,KAAK,CAAC,OAAO,CAAE,KAA6B,CAAC,MAAM,CAAC,CACvD,CAAC;AACN,CAAC"}

package/node_modules/@plusplusoneplusplus/forge/dist/workflow/result-adapter.d.ts

@@ -0,0 +1,54 @@
+/**
+ * WorkflowResult → Flat Display Adapter
+ *
+ * Converts the Map-based WorkflowResult into a flat structure suitable for
+ * CLI output formatting, SPA display, and VS Code result viewers.
+ *
+ * Cross-platform compatible (Linux/Mac/Windows).
+ */
+import type { WorkflowResult, WorkflowConfig } from './types';
+/**
+ * Flat execution stats derived from a WorkflowResult.
+ */
+export interface ExecutionStats {
+    totalItems: number;
+    successfulMaps: number;
+    failedMaps: number;
+    totalDurationMs: number;
+    mapDurationMs?: number;
+    reduceDurationMs?: number;
+}
+/**
+ * Flat per-item result for display.
+ */
+export interface ItemResult {
+    index: number;
+    input: Record<string, unknown>;
+    output: Record<string, unknown>;
+    success: boolean;
+    error?: string;
+    executionTimeMs?: number;
+}
+/**
+ * Flat result shape for consumers that need a simple view of workflow output.
+ */
+export interface FlatWorkflowResult {
+    success: boolean;
+    name?: string;
+    stats: ExecutionStats;
+    items: ItemResult[];
+    leafOutput: Record<string, unknown>[];
+    formattedOutput?: string;
+    error?: string;
+}
+/**
+ * Convert a WorkflowResult into a FlatWorkflowResult.
+ *
+ * Heuristic:
+ * - Map nodes are identified by node type === 'map' (via the config lookup).
+ * - Leaf nodes provide the final output.
+ * - If no config is supplied, all non-leaf nodes with items containing `__error`
+ *   or `__success` fields are treated as map nodes.
+ */
+export declare function flattenWorkflowResult(result: WorkflowResult, config?: WorkflowConfig): FlatWorkflowResult;
+//# sourceMappingURL=result-adapter.d.ts.map

package/node_modules/@plusplusoneplusplus/forge/dist/workflow/result-adapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"result-adapter.d.ts","sourceRoot":"","sources":["../../src/workflow/result-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAqB,cAAc,EAAE,MAAM,SAAS,CAAC;AAEjF;;GAEG;AACH,MAAM,WAAW,cAAc;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC/B,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,eAAe,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IAC/B,OAAO,EAAE,OAAO,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,cAAc,CAAC;IACtB,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;IACtC,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,KAAK,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACjC,MAAM,EAAE,cAAc,EACtB,MAAM,CAAC,EAAE,cAAc,GACxB,kBAAkB,CAmFpB"}

package/node_modules/@plusplusoneplusplus/forge/dist/workflow/result-adapter.js

@@ -0,0 +1,106 @@
+"use strict";
+/**
+ * WorkflowResult → Flat Display Adapter
+ *
+ * Converts the Map-based WorkflowResult into a flat structure suitable for
+ * CLI output formatting, SPA display, and VS Code result viewers.
+ *
+ * Cross-platform compatible (Linux/Mac/Windows).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.flattenWorkflowResult = flattenWorkflowResult;
+/**
+ * Convert a WorkflowResult into a FlatWorkflowResult.
+ *
+ * Heuristic:
+ * - Map nodes are identified by node type === 'map' (via the config lookup).
+ * - Leaf nodes provide the final output.
+ * - If no config is supplied, all non-leaf nodes with items containing `__error`
+ *   or `__success` fields are treated as map nodes.
+ */
+function flattenWorkflowResult(result, config) {
+    let mapNodeResult;
+    let reduceNodeResult;
+    // Identify map and reduce nodes from config
+    if (config) {
+        for (const [id, node] of Object.entries(config.nodes)) {
+            const nr = result.results.get(id);
+            if (!nr) {
+                continue;
+            }
+            if (node.type === 'map' && !mapNodeResult) {
+                mapNodeResult = nr;
+            }
+            else if (node.type === 'reduce' && !reduceNodeResult) {
+                reduceNodeResult = nr;
+            }
+            else if (node.type === 'ai' && !mapNodeResult) {
+                // Single-job (ai node) treated like a map with one item
+                mapNodeResult = nr;
+            }
+        }
+    }
+    // Fallback: pick the largest non-leaf node as "map"
+    if (!mapNodeResult) {
+        let maxItems = 0;
+        for (const [, nr] of result.results) {
+            if (!result.leaves.has(nr.nodeId) && nr.items.length > maxItems) {
+                maxItems = nr.items.length;
+                mapNodeResult = nr;
+            }
+        }
+    }
+    // Build item results from map node
+    const items = [];
+    let successfulMaps = 0;
+    let failedMaps = 0;
+    if (mapNodeResult) {
+        for (let i = 0; i < mapNodeResult.items.length; i++) {
+            const item = mapNodeResult.items[i];
+            const success = item.__error == null;
+            if (success) {
+                successfulMaps++;
+            }
+            else {
+                failedMaps++;
+            }
+            items.push({
+                index: i,
+                input: item,
+                output: item,
+                success,
+                error: item.__error,
+                executionTimeMs: item.__executionTimeMs,
+            });
+        }
+    }
+    // Leaf output
+    const leafOutput = [];
+    for (const [, nr] of result.leaves) {
+        for (const item of nr.items) {
+            leafOutput.push(item);
+        }
+    }
+    // Build formatted output from leaf items
+    let formattedOutput;
+    if (leafOutput.length > 0) {
+        formattedOutput = JSON.stringify(leafOutput, null, 2);
+    }
+    const totalItems = mapNodeResult?.stats.inputCount ?? items.length;
+    return {
+        success: result.success,
+        stats: {
+            totalItems,
+            successfulMaps,
+            failedMaps,
+            totalDurationMs: result.totalDurationMs,
+            mapDurationMs: mapNodeResult?.stats.durationMs,
+            reduceDurationMs: reduceNodeResult?.stats.durationMs,
+        },
+        items,
+        leafOutput,
+        formattedOutput,
+        error: result.error,
+    };
+}
+//# sourceMappingURL=result-adapter.js.map

package/node_modules/@plusplusoneplusplus/forge/dist/workflow/result-adapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"result-adapter.js","sourceRoot":"","sources":["../../src/workflow/result-adapter.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;AAkDH,sDAsFC;AA/FD;;;;;;;;GAQG;AACH,SAAgB,qBAAqB,CACjC,MAAsB,EACtB,MAAuB;IAEvB,IAAI,aAAqC,CAAC;IAC1C,IAAI,gBAAwC,CAAC;IAE7C,4CAA4C;IAC5C,IAAI,MAAM,EAAE,CAAC;QACT,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YACpD,MAAM,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAClC,IAAI,CAAC,EAAE,EAAE,CAAC;gBAAC,SAAS;YAAC,CAAC;YACtB,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,aAAa,EAAE,CAAC;gBACxC,aAAa,GAAG,EAAE,CAAC;YACvB,CAAC;iBAAM,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACrD,gBAAgB,GAAG,EAAE,CAAC;YAC1B,CAAC;iBAAM,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBAC9C,wDAAwD;gBACxD,aAAa,GAAG,EAAE,CAAC;YACvB,CAAC;QACL,CAAC;IACL,CAAC;IAED,oDAAoD;IACpD,IAAI,CAAC,aAAa,EAAE,CAAC;QACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;gBAC9D,QAAQ,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC;gBAC3B,aAAa,GAAG,EAAE,CAAC;YACvB,CAAC;QACL,CAAC;IACL,CAAC;IAED,mCAAmC;IACnC,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,IAAI,aAAa,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC;YACrC,IAAI,OAAO,EAAE,CAAC;gBAAC,cAAc,EAAE,CAAC;YAAC,CAAC;iBAAM,CAAC;gBAAC,UAAU,EAAE,CAAC;YAAC,CAAC;YACzD,KAAK,CAAC,IAAI,CAAC;gBACP,KAAK,EAAE,CAAC;gBACR,KAAK,EAAE,IAAI;gBACX,MAAM,EAAE,IAAI;gBACZ,OAAO;gBACP,KAAK,EAAE,IAAI,CAAC,OAA6B;gBACzC,eAAe,EAAE,IAAI,CAAC,iBAAuC;aAChE,CAAC,CAAC;QACP,CAAC;IACL,CAAC;IAED,cAAc;IACd,MAAM,UAAU,GAA8B,EAAE,CAAC;IACjD,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;YAC1B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;IACL,CAAC;IAED,yCAAyC;IACzC,IAAI,eAAmC,CAAC;IACxC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,MAAM,UAAU,GAAG,aAAa,EAAE,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,MAAM,CAAC;IAEnE,OAAO;QACH,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,KAAK,EAAE;YACH,UAAU;YACV,cAAc;YACd,UAAU;YACV,eAAe,EAAE,MAAM,CAAC,eAAe;YACvC,aAAa,EAAE,aAAa,EAAE,KAAK,CAAC,UAAU;YAC9C,gBAAgB,EAAE,gBAAgB,EAAE,KAAK,CAAC,UAAU;SACvD;QACD,KAAK;QACL,UAAU;QACV,eAAe;QACf,KAAK,EAAE,MAAM,CAAC,KAAK;KACtB,CAAC;AACN,CAAC"}

package/node_modules/@plusplusoneplusplus/forge/dist/workflow/scheduler.d.ts

@@ -0,0 +1,38 @@
+/**
+ * DAG Scheduler — Kahn's topological sort producing execution tiers.
+ *
+ * Pure, side-effect-free module. Takes a validated {@link DAGGraph} and
+ * returns an ordered list of {@link ExecutionTier}s. Each tier is a sorted
+ * array of node IDs that can safely execute in parallel because all of
+ * their upstream dependencies have completed.
+ *
+ * Callers **must** run `validate()` before calling `schedule()` — the
+ * scheduler assumes no cycles and no dangling references.
+ */
+import type { DAGGraph, ExecutionTier } from './types';
+/**
+ * Compute execution tiers via Kahn's algorithm.
+ *
+ * Nodes that share the same topological depth are grouped into a single
+ * tier and sorted alphabetically for deterministic output.
+ *
+ * The caller's graph is never mutated — `inDegree` is shallow-copied
+ * before processing.
+ *
+ * @param graph - A validated DAG (no cycles, no dangling refs).
+ * @returns Ordered list of tiers; tier 0 contains all root nodes.
+ */
+export declare function schedule(graph: DAGGraph): ExecutionTier[];
+/**
+ * Flatten tiers into a single ordered list.
+ *
+ * Useful for logging: "execution order: raw, enriched, bugs, features, …"
+ */
+export declare function getExecutionOrder(tiers: ExecutionTier[]): string[];
+/**
+ * Return which tier (0-indexed) a node belongs to, or -1 if not found.
+ *
+ * Useful for the executor to look up a node's tier quickly.
+ */
+export declare function getTierIndex(nodeId: string, tiers: ExecutionTier[]): number;
+//# sourceMappingURL=scheduler.d.ts.map

package/node_modules/@plusplusoneplusplus/forge/dist/workflow/scheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../../src/workflow/scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAEvD;;;;;;;;;;;GAWG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,QAAQ,GAAG,aAAa,EAAE,CAsCzD;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,aAAa,EAAE,GAAG,MAAM,EAAE,CAElE;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,MAAM,CAO3E"}

package/node_modules/@plusplusoneplusplus/forge/dist/workflow/scheduler.js

@@ -0,0 +1,83 @@
+"use strict";
+/**
+ * DAG Scheduler — Kahn's topological sort producing execution tiers.
+ *
+ * Pure, side-effect-free module. Takes a validated {@link DAGGraph} and
+ * returns an ordered list of {@link ExecutionTier}s. Each tier is a sorted
+ * array of node IDs that can safely execute in parallel because all of
+ * their upstream dependencies have completed.
+ *
+ * Callers **must** run `validate()` before calling `schedule()` — the
+ * scheduler assumes no cycles and no dangling references.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.schedule = schedule;
+exports.getExecutionOrder = getExecutionOrder;
+exports.getTierIndex = getTierIndex;
+/**
+ * Compute execution tiers via Kahn's algorithm.
+ *
+ * Nodes that share the same topological depth are grouped into a single
+ * tier and sorted alphabetically for deterministic output.
+ *
+ * The caller's graph is never mutated — `inDegree` is shallow-copied
+ * before processing.
+ *
+ * @param graph - A validated DAG (no cycles, no dangling refs).
+ * @returns Ordered list of tiers; tier 0 contains all root nodes.
+ */
+function schedule(graph) {
+    // Work on a copy so the caller's graph is never mutated.
+    const inDegree = new Map(graph.inDegree);
+    const edges = graph.edges; // read-only reference
+    // Bootstrap: every node with no incoming edges belongs to the first frontier.
+    const frontier = [];
+    for (const [nodeId, degree] of inDegree) {
+        if (degree === 0) {
+            frontier.push(nodeId);
+        }
+    }
+    frontier.sort();
+    const tiers = [];
+    // BFS-by-tier: advance one tier per loop iteration.
+    while (frontier.length > 0) {
+        tiers.push([...frontier]);
+        const nextFrontier = [];
+        for (const nodeId of frontier) {
+            const children = edges.get(nodeId) ?? [];
+            for (const child of children) {
+                const newDegree = (inDegree.get(child) ?? 0) - 1;
+                inDegree.set(child, newDegree);
+                if (newDegree === 0) {
+                    nextFrontier.push(child);
+                }
+            }
+        }
+        nextFrontier.sort();
+        frontier.length = 0;
+        frontier.push(...nextFrontier);
+    }
+    return tiers;
+}
+/**
+ * Flatten tiers into a single ordered list.
+ *
+ * Useful for logging: "execution order: raw, enriched, bugs, features, …"
+ */
+function getExecutionOrder(tiers) {
+    return tiers.flat();
+}
+/**
+ * Return which tier (0-indexed) a node belongs to, or -1 if not found.
+ *
+ * Useful for the executor to look up a node's tier quickly.
+ */
+function getTierIndex(nodeId, tiers) {
+    for (let i = 0; i < tiers.length; i++) {
+        if (tiers[i].includes(nodeId)) {
+            return i;
+        }
+    }
+    return -1;
+}
+//# sourceMappingURL=scheduler.js.map

package/node_modules/@plusplusoneplusplus/forge/dist/workflow/scheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../../src/workflow/scheduler.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;AAgBH,4BAsCC;AAOD,8CAEC;AAOD,oCAOC;AAzED;;;;;;;;;;;GAWG;AACH,SAAgB,QAAQ,CAAC,KAAe;IACpC,yDAAyD;IACzD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,sBAAsB;IAEjD,8EAA8E;IAC9E,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACtC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACf,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1B,CAAC;IACL,CAAC;IACD,QAAQ,CAAC,IAAI,EAAE,CAAC;IAEhB,MAAM,KAAK,GAAoB,EAAE,CAAC;IAElC,oDAAoD;IACpD,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;QAE1B,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACzC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC3B,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjD,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;gBAC/B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBAClB,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC7B,CAAC;YACL,CAAC;QACL,CAAC;QAED,YAAY,CAAC,IAAI,EAAE,CAAC;QACpB,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACpB,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,SAAgB,iBAAiB,CAAC,KAAsB;IACpD,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC;AACxB,CAAC;AAED;;;;GAIG;AACH,SAAgB,YAAY,CAAC,MAAc,EAAE,KAAsB;IAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,CAAC;QACb,CAAC;IACL,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACd,CAAC"}