agentic-qe 1.9.3 → 2.0.0

package/dist/core/optimization/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Optimization Module
+ *
+ * Provides swarm optimization, topology recommendation,
+ * agent allocation, and bottleneck detection.
+ */
+export * from './types';
+export * from './SwarmOptimizer';
+//# sourceMappingURL=index.d.ts.map

package/dist/core/optimization/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/optimization/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,SAAS,CAAC;AACxB,cAAc,kBAAkB,CAAC"}

package/dist/core/optimization/index.js

@@ -0,0 +1,25 @@
+"use strict";
+/**
+ * Optimization Module
+ *
+ * Provides swarm optimization, topology recommendation,
+ * agent allocation, and bottleneck detection.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./types"), exports);
+__exportStar(require("./SwarmOptimizer"), exports);
+//# sourceMappingURL=index.js.map

package/dist/core/optimization/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/optimization/index.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;;;;;;;;;;;;;;AAEH,0CAAwB;AACxB,mDAAiC"}

package/dist/core/optimization/types.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Types for SwarmOptimizer and related components
+ */
+export interface OptimizationConfig {
+    targetSpeedup: number;
+    maxAgents: number;
+    enableAutoTuning: boolean;
+    enableBottleneckDetection?: boolean;
+    enableAdaptiveScaling?: boolean;
+}
+export interface TopologyRecommendation {
+    topology: 'hierarchical' | 'mesh' | 'ring' | 'star';
+    reasoning: string;
+    expectedSpeedup: number;
+    agentAllocation: Map<string, number>;
+    confidence: number;
+}
+export interface WorkloadProfile {
+    taskCount: number;
+    taskTypes: Map<string, number>;
+    averageComplexity: number;
+    parallelizability: number;
+    resourceIntensity: number;
+    interdependencies: number;
+}
+export interface AgentAllocation {
+    allocations: Map<string, string[]>;
+    reasoning: string;
+    loadBalance: number;
+    expectedDuration: number;
+}
+export interface PerformanceMetrics {
+    taskThroughput: number;
+    averageLatency: number;
+    resourceUtilization: number;
+    bottlenecks: Bottleneck[];
+    timestamp: Date;
+}
+export interface Bottleneck {
+    type: 'agent' | 'memory' | 'coordination' | 'io';
+    location: string;
+    severity: number;
+    impact: string;
+    recommendation: string;
+}
+export interface OptimizationResult {
+    success: boolean;
+    improvements: Map<string, number>;
+    topology?: TopologyRecommendation;
+    allocation?: AgentAllocation;
+    timestamp: Date;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/core/optimization/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/core/optimization/types.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,MAAM,WAAW,kBAAkB;IACjC,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,OAAO,CAAC;IAC1B,yBAAyB,CAAC,EAAE,OAAO,CAAC;IACpC,qBAAqB,CAAC,EAAE,OAAO,CAAC;CACjC;AAED,MAAM,WAAW,sBAAsB;IACrC,QAAQ,EAAE,cAAc,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;IACpD,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACrC,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,eAAe;IAC9B,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IACnC,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,kBAAkB;IACjC,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,SAAS,EAAE,IAAI,CAAC;CACjB;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,OAAO,GAAG,QAAQ,GAAG,cAAc,GAAG,IAAI,CAAC;IACjD,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,OAAO,CAAC;IACjB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC,QAAQ,CAAC,EAAE,sBAAsB,CAAC;IAClC,UAAU,CAAC,EAAE,eAAe,CAAC;IAC7B,SAAS,EAAE,IAAI,CAAC;CACjB"}

package/dist/core/optimization/types.js

@@ -0,0 +1,6 @@
+"use strict";
+/**
+ * Types for SwarmOptimizer and related components
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/core/optimization/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/core/optimization/types.ts"],"names":[],"mappings":";AAAA;;GAEG"}

package/dist/core/orchestration/PriorityQueue.d.ts

@@ -0,0 +1,54 @@
+/**
+ * PriorityQueue - Heap-based priority queue implementation
+ *
+ * Uses a binary min-heap for O(log n) enqueue/dequeue operations.
+ * Higher priority values indicate higher priority (will be dequeued first).
+ */
+export declare class PriorityQueue<T> {
+    private heap;
+    /**
+     * Add an item to the queue with the given priority
+     * @param item Item to add
+     * @param priority Priority value (higher = higher priority)
+     */
+    enqueue(item: T, priority: number): void;
+    /**
+     * Remove and return the highest priority item
+     * @returns The item with highest priority, or undefined if empty
+     */
+    dequeue(): T | undefined;
+    /**
+     * View the highest priority item without removing it
+     * @returns The item with highest priority, or undefined if empty
+     */
+    peek(): T | undefined;
+    /**
+     * Check if the queue is empty
+     */
+    isEmpty(): boolean;
+    /**
+     * Get the number of items in the queue
+     */
+    size(): number;
+    /**
+     * Clear all items from the queue
+     */
+    clear(): void;
+    /**
+     * Convert queue to array (ordered by priority)
+     */
+    toArray(): T[];
+    /**
+     * Bubble up an element to maintain heap property
+     */
+    private bubbleUp;
+    /**
+     * Bubble down an element to maintain heap property
+     */
+    private bubbleDown;
+    /**
+     * Swap two elements in the heap
+     */
+    private swap;
+}
+//# sourceMappingURL=PriorityQueue.d.ts.map

package/dist/core/orchestration/PriorityQueue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PriorityQueue.d.ts","sourceRoot":"","sources":["../../../src/core/orchestration/PriorityQueue.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,qBAAa,aAAa,CAAC,CAAC;IAC1B,OAAO,CAAC,IAAI,CAAsB;IAElC;;;;OAIG;IACH,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAKxC;;;OAGG;IACH,OAAO,IAAI,CAAC,GAAG,SAAS;IAgBxB;;;OAGG;IACH,IAAI,IAAI,CAAC,GAAG,SAAS;IAIrB;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,IAAI,IAAI,MAAM;IAId;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,OAAO,IAAI,CAAC,EAAE;IASd;;OAEG;IACH,OAAO,CAAC,QAAQ;IAchB;;OAEG;IACH,OAAO,CAAC,UAAU;IA8BlB;;OAEG;IACH,OAAO,CAAC,IAAI;CAKb"}

package/dist/core/orchestration/PriorityQueue.js

@@ -0,0 +1,122 @@
+"use strict";
+/**
+ * PriorityQueue - Heap-based priority queue implementation
+ *
+ * Uses a binary min-heap for O(log n) enqueue/dequeue operations.
+ * Higher priority values indicate higher priority (will be dequeued first).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PriorityQueue = void 0;
+class PriorityQueue {
+    constructor() {
+        this.heap = [];
+    }
+    /**
+     * Add an item to the queue with the given priority
+     * @param item Item to add
+     * @param priority Priority value (higher = higher priority)
+     */
+    enqueue(item, priority) {
+        this.heap.push({ item, priority });
+        this.bubbleUp(this.heap.length - 1);
+    }
+    /**
+     * Remove and return the highest priority item
+     * @returns The item with highest priority, or undefined if empty
+     */
+    dequeue() {
+        if (this.heap.length === 0) {
+            return undefined;
+        }
+        if (this.heap.length === 1) {
+            return this.heap.pop().item;
+        }
+        const result = this.heap[0].item;
+        this.heap[0] = this.heap.pop();
+        this.bubbleDown(0);
+        return result;
+    }
+    /**
+     * View the highest priority item without removing it
+     * @returns The item with highest priority, or undefined if empty
+     */
+    peek() {
+        return this.heap.length > 0 ? this.heap[0].item : undefined;
+    }
+    /**
+     * Check if the queue is empty
+     */
+    isEmpty() {
+        return this.heap.length === 0;
+    }
+    /**
+     * Get the number of items in the queue
+     */
+    size() {
+        return this.heap.length;
+    }
+    /**
+     * Clear all items from the queue
+     */
+    clear() {
+        this.heap = [];
+    }
+    /**
+     * Convert queue to array (ordered by priority)
+     */
+    toArray() {
+        // Create a copy and sort by priority (highest first)
+        return [...this.heap]
+            .sort((a, b) => b.priority - a.priority)
+            .map(item => item.item);
+    }
+    // ============= PRIVATE HEAP OPERATIONS =============
+    /**
+     * Bubble up an element to maintain heap property
+     */
+    bubbleUp(index) {
+        while (index > 0) {
+            const parentIndex = Math.floor((index - 1) / 2);
+            // Max heap: parent should have higher priority
+            if (this.heap[parentIndex].priority >= this.heap[index].priority) {
+                break;
+            }
+            this.swap(index, parentIndex);
+            index = parentIndex;
+        }
+    }
+    /**
+     * Bubble down an element to maintain heap property
+     */
+    bubbleDown(index) {
+        while (true) {
+            const leftChild = 2 * index + 1;
+            const rightChild = 2 * index + 2;
+            let largest = index;
+            // Find largest among node and its children
+            if (leftChild < this.heap.length &&
+                this.heap[leftChild].priority > this.heap[largest].priority) {
+                largest = leftChild;
+            }
+            if (rightChild < this.heap.length &&
+                this.heap[rightChild].priority > this.heap[largest].priority) {
+                largest = rightChild;
+            }
+            if (largest === index) {
+                break;
+            }
+            this.swap(index, largest);
+            index = largest;
+        }
+    }
+    /**
+     * Swap two elements in the heap
+     */
+    swap(i, j) {
+        const temp = this.heap[i];
+        this.heap[i] = this.heap[j];
+        this.heap[j] = temp;
+    }
+}
+exports.PriorityQueue = PriorityQueue;
+//# sourceMappingURL=PriorityQueue.js.map

package/dist/core/orchestration/PriorityQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PriorityQueue.js","sourceRoot":"","sources":["../../../src/core/orchestration/PriorityQueue.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAOH,MAAa,aAAa;IAA1B;QACU,SAAI,GAAmB,EAAE,CAAC;IAmIpC,CAAC;IAjIC;;;;OAIG;IACH,OAAO,CAAC,IAAO,EAAE,QAAgB;QAC/B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC,IAAI,CAAC;QAC/B,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QAChC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAEnB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IAC9D,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,qDAAqD;QACrD,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;aAClB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;aACvC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,sDAAsD;IAEtD;;OAEG;IACK,QAAQ,CAAC,KAAa;QAC5B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAEhD,+CAA+C;YAC/C,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACjE,MAAM;YACR,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;YAC9B,KAAK,GAAG,WAAW,CAAC;QACtB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAa;QAC9B,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YAChC,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACjC,IAAI,OAAO,GAAG,KAAK,CAAC;YAEpB,2CAA2C;YAC3C,IACE,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM;gBAC5B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAC3D,CAAC;gBACD,OAAO,GAAG,SAAS,CAAC;YACtB,CAAC;YAED,IACE,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM;gBAC7B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAC5D,CAAC;gBACD,OAAO,GAAG,UAAU,CAAC;YACvB,CAAC;YAED,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;gBACtB,MAAM;YACR,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1B,KAAK,GAAG,OAAO,CAAC;QAClB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,IAAI,CAAC,CAAS,EAAE,CAAS;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACtB,CAAC;CACF;AApID,sCAoIC"}

package/dist/core/orchestration/WorkflowOrchestrator.d.ts

@@ -0,0 +1,176 @@
+/**
+ * WorkflowOrchestrator - Adaptive workflow execution for QE agent swarms
+ *
+ * Features:
+ * - Adaptive strategy selection (parallel/sequential/hybrid)
+ * - Priority-based task queue with dependency resolution
+ * - Workflow checkpointing for recovery
+ * - Integration with SwarmOptimizer and FleetManager
+ */
+import { SwarmMemoryManager } from '../memory/SwarmMemoryManager';
+import { QEEventBus } from '../events/QEEventBus';
+import { SwarmOptimizer } from '../optimization/SwarmOptimizer';
+import { Workflow, WorkflowExecution, WorkflowCheckpoint, ExecutionMetrics } from './types';
+export declare class WorkflowOrchestrator {
+    private readonly logger;
+    private readonly memoryStore;
+    private readonly eventBus;
+    private readonly optimizer?;
+    private workflows;
+    private executions;
+    private taskQueue;
+    private isShutdown;
+    private readonly PRIORITY_VALUES;
+    constructor(memoryStore: SwarmMemoryManager, eventBus: QEEventBus, optimizer?: SwarmOptimizer);
+    /**
+     * Initialize the orchestrator
+     */
+    initialize(): Promise<void>;
+    /**
+     * Register a new workflow
+     */
+    registerWorkflow(workflow: Workflow): void;
+    /**
+     * Get a workflow by ID
+     */
+    getWorkflow(id: string): Workflow | undefined;
+    /**
+     * List all registered workflows
+     */
+    listWorkflows(): Workflow[];
+    /**
+     * Execute a workflow
+     */
+    executeWorkflow(workflowId: string, inputs?: Record<string, any>): Promise<WorkflowExecution>;
+    /**
+     * Pause a running execution
+     */
+    pauseExecution(executionId: string): Promise<void>;
+    /**
+     * Resume a paused execution
+     */
+    resumeExecution(executionId: string): Promise<void>;
+    /**
+     * Cancel a running or paused execution
+     */
+    cancelExecution(executionId: string): Promise<void>;
+    /**
+     * Select optimal execution strategy based on workflow characteristics
+     */
+    private selectStrategy;
+    /**
+     * Analyze workload characteristics
+     */
+    private analyzeWorkloadCharacteristics;
+    /**
+     * Resolve dependencies and create execution plan
+     */
+    private resolveDependencies;
+    /**
+     * Topological sort using Kahn's algorithm
+     */
+    private topologicalSort;
+    /**
+     * Detect circular dependencies using DFS
+     */
+    private detectCycles;
+    /**
+     * Group steps into parallel execution phases
+     */
+    private groupIntoPhases;
+    /**
+     * Calculate critical path (longest dependency chain)
+     */
+    private calculateCriticalPath;
+    /**
+     * Execute a single step
+     */
+    private executeStep;
+    /**
+     * Execute step with timeout
+     */
+    private executeStepWithTimeout;
+    /**
+     * Execute step action (placeholder for agent invocation)
+     */
+    private executeStepAction;
+    /**
+     * Resolve step inputs from previous results
+     */
+    private resolveStepInputs;
+    /**
+     * Execute steps in parallel
+     */
+    private executeParallel;
+    /**
+     * Execute steps sequentially
+     */
+    private executeSequential;
+    /**
+     * Execute in hybrid mode (phases sequential, steps within phase parallel)
+     */
+    private executeHybrid;
+    /**
+     * Create a checkpoint for an execution
+     */
+    createCheckpoint(executionId: string): Promise<WorkflowCheckpoint>;
+    /**
+     * Restore execution from checkpoint
+     */
+    restoreFromCheckpoint(checkpoint: WorkflowCheckpoint): Promise<WorkflowExecution>;
+    /**
+     * Enqueue a task with priority
+     */
+    private enqueueTask;
+    /**
+     * Dequeue highest priority task
+     */
+    private dequeueTask;
+    /**
+     * Get execution metrics
+     */
+    getExecutionMetrics(executionId: string): ExecutionMetrics;
+    /**
+     * Get execution by ID
+     */
+    getExecution(executionId: string): WorkflowExecution | undefined;
+    /**
+     * List all executions
+     */
+    listExecutions(): WorkflowExecution[];
+    /**
+     * Validate workflow structure
+     */
+    private validateWorkflow;
+    /**
+     * Generate unique execution ID
+     */
+    private generateExecutionId;
+    /**
+     * Serialize checkpoint for storage
+     */
+    private serializeCheckpoint;
+    /**
+     * Persist execution to memory
+     */
+    private persistExecution;
+    /**
+     * Load workflows from memory
+     */
+    private loadWorkflowsFromMemory;
+    /**
+     * Delay helper
+     */
+    private delay;
+    /**
+     * Event handlers
+     */
+    private handleStepCompleted;
+    private handleStepFailed;
+    private handleAgentAvailable;
+    /**
+     * Shutdown orchestrator
+     */
+    shutdown(): Promise<void>;
+}
+//# sourceMappingURL=WorkflowOrchestrator.d.ts.map

package/dist/core/orchestration/WorkflowOrchestrator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"WorkflowOrchestrator.d.ts","sourceRoot":"","sources":["../../../src/core/orchestration/WorkflowOrchestrator.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAClE,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EAAE,cAAc,EAAe,MAAM,gCAAgC,CAAC;AAE7E,OAAO,EACL,QAAQ,EAER,iBAAiB,EACjB,kBAAkB,EAClB,gBAAgB,EAQjB,MAAM,SAAS,CAAC;AAEjB,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAqB;IACjD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAa;IACtC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAiB;IAE5C,OAAO,CAAC,SAAS,CAAwB;IACzC,OAAO,CAAC,UAAU,CAAiC;IACnD,OAAO,CAAC,SAAS,CAA4B;IAC7C,OAAO,CAAC,UAAU,CAAkB;IAGpC,OAAO,CAAC,QAAQ,CAAC,eAAe,CAK9B;gBAGA,WAAW,EAAE,kBAAkB,EAC/B,QAAQ,EAAE,UAAU,EACpB,SAAS,CAAC,EAAE,cAAc;IAY5B;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAgBjC;;OAEG;IACH,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI;IAkB1C;;OAEG;IACH,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAI7C;;OAEG;IACH,aAAa,IAAI,QAAQ,EAAE;IAM3B;;OAEG;IACG,eAAe,CACnB,UAAU,EAAE,MAAM,EAClB,MAAM,GAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAM,GAC/B,OAAO,CAAC,iBAAiB,CAAC;IAwG7B;;OAEG;IACG,cAAc,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAqBxD;;OAEG;IACG,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAuBzD;;OAEG;IACG,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAqBzD;;OAEG;YACW,cAAc;IAsB5B;;OAEG;IACH,OAAO,CAAC,8BAA8B;IA6BtC;;OAEG;IACH,OAAO,CAAC,mBAAmB;IA4B3B;;OAEG;IACH,OAAO,CAAC,eAAe;IA8CvB;;OAEG;IACH,OAAO,CAAC,YAAY;IAoCpB;;OAEG;IACH,OAAO,CAAC,eAAe;IA2BvB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IA6C7B;;OAEG;YACW,WAAW;IA8FzB;;OAEG;YACW,sBAAsB;IAuBpC;;OAEG;YACW,iBAAiB;IAsB/B;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAwBzB;;OAEG;YACW,eAAe;IAmC7B;;OAEG;YACW,iBAAiB;IAsB/B;;OAEG;YACW,aAAa;IAyB3B;;OAEG;IACG,gBAAgB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,CAAC;IA6BxE;;OAEG;IACG,qBAAqB,CAAC,UAAU,EAAE,kBAAkB,GAAG,OAAO,CAAC,iBAAiB,CAAC;IAkBvF;;OAEG;IACH,OAAO,CAAC,WAAW;IAInB;;OAEG;IACH,OAAO,CAAC,WAAW;IAMnB;;OAEG;IACH,mBAAmB,CAAC,WAAW,EAAE,MAAM,GAAG,gBAAgB;IAS1D;;OAEG;IACH,YAAY,CAAC,WAAW,EAAE,MAAM,GAAG,iBAAiB,GAAG,SAAS;IAIhE;;OAEG;IACH,cAAc,IAAI,iBAAiB,EAAE;IAMrC;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAoBxB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAI3B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAO3B;;OAEG;YACW,gBAAgB;IAiB9B;;OAEG;YACW,uBAAuB;IAiBrC;;OAEG;IACH,OAAO,CAAC,KAAK;IAIb;;OAEG;YACW,mBAAmB;YAInB,gBAAgB;YAIhB,oBAAoB;IAYlC;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;CAiBhC"}