@telora/factory 0.4.5

package/dist/resource-limits.js

@@ -0,0 +1,322 @@
+/**
+ * Resource limit checking for factory instances.
+ *
+ * Enforces blueprint resource limits (token budget, wall-clock time,
+ * per-unit iterations, work unit count) and returns a structured result
+ * indicating whether any limit has been exceeded.
+ *
+ * Checks are designed to run after each session completion and gate
+ * evaluation. All checks are based on the blueprint configuration --
+ * null limits are treated as unlimited.
+ */
+import { getInstanceWorkUnits } from './queries/work-units.js';
+import { getActiveSessionsForInstance } from './queries/sessions.js';
+// ============================================================================
+// Main entry point
+// ============================================================================
+/**
+ * Check all resource limits for a factory instance.
+ *
+ * Evaluates four resource limits defined in the blueprint:
+ *   1. Token budget: aggregate tokens across all factory sessions
+ *   2. Wall-clock time: elapsed time since instance started
+ *   3. Iteration count: per-work-unit iteration limit
+ *   4. Work unit count: total work units vs max_work_units
+ *
+ * Returns immediately on the first exceeded limit found. All limits
+ * configured as null in the blueprint are treated as unlimited.
+ *
+ * @param instanceState - The in-memory state of the factory instance.
+ * @returns A result indicating whether any limit has been exceeded.
+ */
+export async function checkResourceLimits(instanceState) {
+    const blueprint = instanceState.blueprint;
+    const exceeded = [];
+    // Check 1: Token budget
+    const tokenResult = await checkTokenBudget(instanceState, blueprint);
+    if (tokenResult) {
+        exceeded.push(tokenResult);
+    }
+    // Check 1b: Cost budget
+    const costResult = checkCostBudget(instanceState, blueprint);
+    if (costResult) {
+        exceeded.push(costResult);
+    }
+    // Check 2: Wall-clock time
+    const wallClockResult = checkWallClockTime(instanceState, blueprint);
+    if (wallClockResult) {
+        exceeded.push(wallClockResult);
+    }
+    // Check 3: Per-work-unit iteration count
+    const iterationResults = await checkIterationLimits(instanceState, blueprint);
+    exceeded.push(...iterationResults);
+    // Check 4: Total work unit count
+    const workUnitCountResult = await checkWorkUnitCount(instanceState, blueprint);
+    if (workUnitCountResult) {
+        exceeded.push(workUnitCountResult);
+    }
+    // Check 5: Instance iteration limit (completion gate cycles)
+    const instanceIterResult = checkInstanceIterations(instanceState, blueprint);
+    if (instanceIterResult) {
+        exceeded.push(instanceIterResult);
+    }
+    if (exceeded.length === 0) {
+        return { exceeded: false, reason: '', details: [] };
+    }
+    // Build a combined reason string from all exceeded limits
+    const reasons = exceeded.map((d) => d.description);
+    return {
+        exceeded: true,
+        reason: reasons.join('; '),
+        details: exceeded,
+    };
+}
+// ============================================================================
+// Individual limit checks
+// ============================================================================
+/**
+ * Check whether the aggregate token usage across all sessions exceeds
+ * the blueprint's max_token_budget.
+ *
+ * Fetches active sessions for the instance and sums their token_count
+ * values. Sessions with null token_count are treated as 0.
+ */
+async function checkTokenBudget(instanceState, blueprint) {
+    if (blueprint.maxTokenBudget === null) {
+        return null;
+    }
+    const sessions = await getActiveSessionsForInstance(instanceState.instanceId);
+    const totalTokens = sumSessionTokens(sessions);
+    if (totalTokens > blueprint.maxTokenBudget) {
+        return {
+            limitType: 'token_budget',
+            currentValue: totalTokens,
+            maxValue: blueprint.maxTokenBudget,
+            description: `Token budget exceeded: ${totalTokens} tokens used ` +
+                `(limit: ${blueprint.maxTokenBudget})`,
+        };
+    }
+    return null;
+}
+/**
+ * Check whether the cumulative cost across all sessions exceeds
+ * the blueprint's max_cost_budget (denominated in dollars).
+ *
+ * Uses the in-memory costUsed counter which is updated after each
+ * session completes.
+ */
+function checkCostBudget(instanceState, blueprint) {
+    if (blueprint.maxCostBudget === null) {
+        return null;
+    }
+    const currentCost = instanceState.costUsed;
+    if (currentCost > blueprint.maxCostBudget) {
+        return {
+            limitType: 'cost_budget',
+            currentValue: Math.round(currentCost * 100) / 100,
+            maxValue: blueprint.maxCostBudget,
+            description: `Cost budget exceeded: $${currentCost.toFixed(2)} spent ` +
+                `(limit: $${blueprint.maxCostBudget.toFixed(2)})`,
+        };
+    }
+    return null;
+}
+/**
+ * Check whether the wall-clock elapsed time exceeds the blueprint's
+ * max_wall_clock_hours.
+ *
+ * Uses the in-memory startedAt timestamp for the instance. This avoids
+ * an extra API call since the lifecycle manager always sets startedAt
+ * when the instance is picked up.
+ */
+function checkWallClockTime(instanceState, blueprint) {
+    if (blueprint.maxWallClockHours === null) {
+        return null;
+    }
+    const elapsedMs = Date.now() - instanceState.startedAt.getTime();
+    const elapsedHours = elapsedMs / (1000 * 60 * 60);
+    const maxHours = blueprint.maxWallClockHours;
+    if (elapsedHours > maxHours) {
+        return {
+            limitType: 'wall_clock',
+            currentValue: Math.round(elapsedHours * 100) / 100,
+            maxValue: maxHours,
+            description: `Wall-clock time exceeded: ${(elapsedHours).toFixed(2)} hours elapsed ` +
+                `(limit: ${maxHours} hours)`,
+        };
+    }
+    return null;
+}
+/**
+ * Check whether any work unit has exceeded the per-unit iteration limit
+ * defined in the blueprint's max_iterations_per_work_unit.
+ *
+ * Returns a detail entry for each work unit that has exceeded the limit.
+ */
+async function checkIterationLimits(instanceState, blueprint) {
+    if (blueprint.maxIterationsPerWorkUnit === null) {
+        return [];
+    }
+    const maxIterations = blueprint.maxIterationsPerWorkUnit;
+    const workUnits = await getInstanceWorkUnits(instanceState.instanceId);
+    const exceeded = [];
+    for (const unit of workUnits) {
+        if (unit.iterationCount >= maxIterations) {
+            exceeded.push({
+                limitType: 'iteration_count',
+                currentValue: unit.iterationCount,
+                maxValue: maxIterations,
+                description: `Work unit "${unit.title}" (${unit.id}) exceeded iteration limit: ` +
+                    `${unit.iterationCount} iterations (limit: ${maxIterations})`,
+            });
+        }
+    }
+    return exceeded;
+}
+/**
+ * Check whether the total number of work units exceeds the blueprint's
+ * max_work_units limit.
+ */
+async function checkWorkUnitCount(instanceState, blueprint) {
+    if (blueprint.maxWorkUnits === null) {
+        return null;
+    }
+    const workUnits = await getInstanceWorkUnits(instanceState.instanceId);
+    const count = workUnits.length;
+    if (count > blueprint.maxWorkUnits) {
+        return {
+            limitType: 'work_unit_count',
+            currentValue: count,
+            maxValue: blueprint.maxWorkUnits,
+            description: `Work unit count exceeded: ${count} work units ` +
+                `(limit: ${blueprint.maxWorkUnits})`,
+        };
+    }
+    return null;
+}
+/**
+ * Check whether the instance has exceeded its completion gate iteration limit.
+ *
+ * Uses blueprint.maxInstanceIterations. Null means no limit (skip check).
+ * This ensures the instance escalates when iteration limits are hit, giving
+ * the human a chance to extend the limit or review progress.
+ */
+function checkInstanceIterations(instanceState, blueprint) {
+    const maxIterations = blueprint.maxInstanceIterations;
+    if (maxIterations === null)
+        return null;
+    if (instanceState.completionGateIterations >= maxIterations) {
+        return {
+            limitType: 'instance_iterations',
+            currentValue: instanceState.completionGateIterations,
+            maxValue: maxIterations,
+            description: `Instance iteration limit reached: ${instanceState.completionGateIterations} cycles ` +
+                `(limit: ${maxIterations})`,
+        };
+    }
+    return null;
+}
+// ============================================================================
+// Pure helpers
+// ============================================================================
+/**
+ * Sum token counts across a list of factory sessions.
+ * Sessions with null token_count are treated as 0.
+ */
+export function sumSessionTokens(sessions) {
+    return sessions.reduce((sum, s) => sum + (s.tokenCount ?? 0), 0);
+}
+/**
+ * Check resource limits using pre-fetched data (no API calls).
+ *
+ * This is useful when the caller has already fetched work units and
+ * sessions and wants to avoid redundant API calls. Performs the same
+ * checks as checkResourceLimits but operates on provided data.
+ */
+export function checkResourceLimitsSync(instanceState, sessions, workUnits) {
+    const blueprint = instanceState.blueprint;
+    const exceeded = [];
+    // Check 1: Token budget
+    if (blueprint.maxTokenBudget !== null) {
+        const totalTokens = sumSessionTokens(sessions);
+        if (totalTokens > blueprint.maxTokenBudget) {
+            exceeded.push({
+                limitType: 'token_budget',
+                currentValue: totalTokens,
+                maxValue: blueprint.maxTokenBudget,
+                description: `Token budget exceeded: ${totalTokens} tokens used ` +
+                    `(limit: ${blueprint.maxTokenBudget})`,
+            });
+        }
+    }
+    // Check 1b: Cost budget
+    if (blueprint.maxCostBudget !== null) {
+        const currentCost = instanceState.costUsed;
+        if (currentCost > blueprint.maxCostBudget) {
+            exceeded.push({
+                limitType: 'cost_budget',
+                currentValue: Math.round(currentCost * 100) / 100,
+                maxValue: blueprint.maxCostBudget,
+                description: `Cost budget exceeded: $${currentCost.toFixed(2)} spent ` +
+                    `(limit: $${blueprint.maxCostBudget.toFixed(2)})`,
+            });
+        }
+    }
+    // Check 2: Wall-clock time
+    if (blueprint.maxWallClockHours !== null) {
+        const elapsedMs = Date.now() - instanceState.startedAt.getTime();
+        const elapsedHours = elapsedMs / (1000 * 60 * 60);
+        if (elapsedHours > blueprint.maxWallClockHours) {
+            exceeded.push({
+                limitType: 'wall_clock',
+                currentValue: Math.round(elapsedHours * 100) / 100,
+                maxValue: blueprint.maxWallClockHours,
+                description: `Wall-clock time exceeded: ${elapsedHours.toFixed(2)} hours elapsed ` +
+                    `(limit: ${blueprint.maxWallClockHours} hours)`,
+            });
+        }
+    }
+    // Check 3: Per-work-unit iteration count
+    if (blueprint.maxIterationsPerWorkUnit !== null) {
+        const maxIterations = blueprint.maxIterationsPerWorkUnit;
+        for (const unit of workUnits) {
+            if (unit.iterationCount >= maxIterations) {
+                exceeded.push({
+                    limitType: 'iteration_count',
+                    currentValue: unit.iterationCount,
+                    maxValue: maxIterations,
+                    description: `Work unit "${unit.title}" (${unit.id}) exceeded iteration limit: ` +
+                        `${unit.iterationCount} iterations (limit: ${maxIterations})`,
+                });
+            }
+        }
+    }
+    // Check 4: Total work unit count
+    if (blueprint.maxWorkUnits !== null) {
+        const count = workUnits.length;
+        if (count > blueprint.maxWorkUnits) {
+            exceeded.push({
+                limitType: 'work_unit_count',
+                currentValue: count,
+                maxValue: blueprint.maxWorkUnits,
+                description: `Work unit count exceeded: ${count} work units ` +
+                    `(limit: ${blueprint.maxWorkUnits})`,
+            });
+        }
+    }
+    // Check 5: Instance iteration limit (completion gate cycles)
+    const instanceIterResult = checkInstanceIterations(instanceState, blueprint);
+    if (instanceIterResult) {
+        exceeded.push(instanceIterResult);
+    }
+    if (exceeded.length === 0) {
+        return { exceeded: false, reason: '', details: [] };
+    }
+    const reasons = exceeded.map((d) => d.description);
+    return {
+        exceeded: true,
+        reason: reasons.join('; '),
+        details: exceeded,
+    };
+}
+//# sourceMappingURL=resource-limits.js.map

package/dist/resource-limits.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resource-limits.js","sourceRoot":"","sources":["../src/resource-limits.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAQH,OAAO,EAAE,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAC/D,OAAO,EAAE,4BAA4B,EAAE,MAAM,uBAAuB,CAAC;AA4BrE,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,aAAmC;IAEnC,MAAM,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC;IAC1C,MAAM,QAAQ,GAA0B,EAAE,CAAC;IAE3C,wBAAwB;IACxB,MAAM,WAAW,GAAG,MAAM,gBAAgB,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACrE,IAAI,WAAW,EAAE,CAAC;QAChB,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7B,CAAC;IAED,wBAAwB;IACxB,MAAM,UAAU,GAAG,eAAe,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAC7D,IAAI,UAAU,EAAE,CAAC;QACf,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC5B,CAAC;IAED,2BAA2B;IAC3B,MAAM,eAAe,GAAG,kBAAkB,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACrE,IAAI,eAAe,EAAE,CAAC;QACpB,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACjC,CAAC;IAED,yCAAyC;IACzC,MAAM,gBAAgB,GAAG,MAAM,oBAAoB,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAC9E,QAAQ,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAC;IAEnC,iCAAiC;IACjC,MAAM,mBAAmB,GAAG,MAAM,kBAAkB,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAC/E,IAAI,mBAAmB,EAAE,CAAC;QACxB,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IACrC,CAAC;IAED,6DAA6D;IAC7D,MAAM,kBAAkB,GAAG,uBAAuB,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAC7E,IAAI,kBAAkB,EAAE,CAAC;QACvB,QAAQ,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;IACpC,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACtD,CAAC;IAED,0DAA0D;IAC1D,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IACnD,OAAO;QACL,QAAQ,EAAE,IAAI;QACd,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;QAC1B,OAAO,EAAE,QAAQ;KAClB,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,0BAA0B;AAC1B,+EAA+E;AAE/E;;;;;;GAMG;AACH,KAAK,UAAU,gBAAgB,CAC7B,aAAmC,EACnC,SAA2B;IAE3B,IAAI,SAAS,CAAC,cAAc,KAAK,IAAI,EAAE,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,4BAA4B,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;IAC9E,MAAM,WAAW,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAE/C,IAAI,WAAW,GAAG,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3C,OAAO;YACL,SAAS,EAAE,cAAc;YACzB,YAAY,EAAE,WAAW;YACzB,QAAQ,EAAE,SAAS,CAAC,cAAc;YAClC,WAAW,EACT,0BAA0B,WAAW,eAAe;gBACpD,WAAW,SAAS,CAAC,cAAc,GAAG;SACzC,CAAC;IACJ,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CACtB,aAAmC,EACnC,SAA2B;IAE3B,IAAI,SAAS,CAAC,aAAa,KAAK,IAAI,EAAE,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC;IAC3C,IAAI,WAAW,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC;QAC1C,OAAO;YACL,SAAS,EAAE,aAAa;YACxB,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,GAAG,GAAG;YACjD,QAAQ,EAAE,SAAS,CAAC,aAAa;YACjC,WAAW,EACT,0BAA0B,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;gBACzD,YAAY,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;SACpD,CAAC;IACJ,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,kBAAkB,CACzB,aAAmC,EACnC,SAA2B;IAE3B,IAAI,SAAS,CAAC,iBAAiB,KAAK,IAAI,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,aAAa,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;IACjE,MAAM,YAAY,GAAG,SAAS,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAG,SAAS,CAAC,iBAAiB,CAAC;IAE7C,IAAI,YAAY,GAAG,QAAQ,EAAE,CAAC;QAC5B,OAAO;YACL,SAAS,EAAE,YAAY;YACvB,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC,GAAG,GAAG;YAClD,QAAQ,EAAE,QAAQ;YAClB,WAAW,EACT,6BAA6B,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB;gBACvE,WAAW,QAAQ,SAAS;SAC/B,CAAC;IACJ,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,oBAAoB,CACjC,aAAmC,EACnC,SAA2B;IAE3B,IAAI,SAAS,CAAC,wBAAwB,KAAK,IAAI,EAAE,CAAC;QAChD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,aAAa,GAAG,SAAS,CAAC,wBAAwB,CAAC;IACzD,MAAM,SAAS,GAAG,MAAM,oBAAoB,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;IACvE,MAAM,QAAQ,GAA0B,EAAE,CAAC;IAE3C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,cAAc,IAAI,aAAa,EAAE,CAAC;YACzC,QAAQ,CAAC,IAAI,CAAC;gBACZ,SAAS,EAAE,iBAAiB;gBAC5B,YAAY,EAAE,IAAI,CAAC,cAAc;gBACjC,QAAQ,EAAE,aAAa;gBACvB,WAAW,EACT,cAAc,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,EAAE,8BAA8B;oBACnE,GAAG,IAAI,CAAC,cAAc,uBAAuB,aAAa,GAAG;aAChE,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,kBAAkB,CAC/B,aAAmC,EACnC,SAA2B;IAE3B,IAAI,SAAS,CAAC,YAAY,KAAK,IAAI,EAAE,CAAC;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,oBAAoB,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;IACvE,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC;IAE/B,IAAI,KAAK,GAAG,SAAS,CAAC,YAAY,EAAE,CAAC;QACnC,OAAO;YACL,SAAS,EAAE,iBAAiB;YAC5B,YAAY,EAAE,KAAK;YACnB,QAAQ,EAAE,SAAS,CAAC,YAAY;YAChC,WAAW,EACT,6BAA6B,KAAK,cAAc;gBAChD,WAAW,SAAS,CAAC,YAAY,GAAG;SACvC,CAAC;IACJ,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,SAAS,uBAAuB,CAC9B,aAAmC,EACnC,SAA2B;IAE3B,MAAM,aAAa,GAAG,SAAS,CAAC,qBAAqB,CAAC;IACtD,IAAI,aAAa,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAExC,IAAI,aAAa,CAAC,wBAAwB,IAAI,aAAa,EAAE,CAAC;QAC5D,OAAO;YACL,SAAS,EAAE,qBAAqB;YAChC,YAAY,EAAE,aAAa,CAAC,wBAAwB;YACpD,QAAQ,EAAE,aAAa;YACvB,WAAW,EACT,qCAAqC,aAAa,CAAC,wBAAwB,UAAU;gBACrF,WAAW,aAAa,GAAG;SAC9B,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+EAA+E;AAC/E,eAAe;AACf,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAA0B;IACzD,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACrC,aAAmC,EACnC,QAA0B,EAC1B,SAA4B;IAE5B,MAAM,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC;IAC1C,MAAM,QAAQ,GAA0B,EAAE,CAAC;IAE3C,wBAAwB;IACxB,IAAI,SAAS,CAAC,cAAc,KAAK,IAAI,EAAE,CAAC;QACtC,MAAM,WAAW,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,WAAW,GAAG,SAAS,CAAC,cAAc,EAAE,CAAC;YAC3C,QAAQ,CAAC,IAAI,CAAC;gBACZ,SAAS,EAAE,cAAc;gBACzB,YAAY,EAAE,WAAW;gBACzB,QAAQ,EAAE,SAAS,CAAC,cAAc;gBAClC,WAAW,EACT,0BAA0B,WAAW,eAAe;oBACpD,WAAW,SAAS,CAAC,cAAc,GAAG;aACzC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,wBAAwB;IACxB,IAAI,SAAS,CAAC,aAAa,KAAK,IAAI,EAAE,CAAC;QACrC,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC;QAC3C,IAAI,WAAW,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC;YAC1C,QAAQ,CAAC,IAAI,CAAC;gBACZ,SAAS,EAAE,aAAa;gBACxB,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,GAAG,GAAG;gBACjD,QAAQ,EAAE,SAAS,CAAC,aAAa;gBACjC,WAAW,EACT,0BAA0B,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;oBACzD,YAAY,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;aACpD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,IAAI,SAAS,CAAC,iBAAiB,KAAK,IAAI,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,aAAa,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QACjE,MAAM,YAAY,GAAG,SAAS,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAClD,IAAI,YAAY,GAAG,SAAS,CAAC,iBAAiB,EAAE,CAAC;YAC/C,QAAQ,CAAC,IAAI,CAAC;gBACZ,SAAS,EAAE,YAAY;gBACvB,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC,GAAG,GAAG;gBAClD,QAAQ,EAAE,SAAS,CAAC,iBAAiB;gBACrC,WAAW,EACT,6BAA6B,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB;oBACrE,WAAW,SAAS,CAAC,iBAAiB,SAAS;aAClD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,IAAI,SAAS,CAAC,wBAAwB,KAAK,IAAI,EAAE,CAAC;QAChD,MAAM,aAAa,GAAG,SAAS,CAAC,wBAAwB,CAAC;QACzD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,cAAc,IAAI,aAAa,EAAE,CAAC;gBACzC,QAAQ,CAAC,IAAI,CAAC;oBACZ,SAAS,EAAE,iBAAiB;oBAC5B,YAAY,EAAE,IAAI,CAAC,cAAc;oBACjC,QAAQ,EAAE,aAAa;oBACvB,WAAW,EACT,cAAc,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,EAAE,8BAA8B;wBACnE,GAAG,IAAI,CAAC,cAAc,uBAAuB,aAAa,GAAG;iBAChE,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,iCAAiC;IACjC,IAAI,SAAS,CAAC,YAAY,KAAK,IAAI,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC;QAC/B,IAAI,KAAK,GAAG,SAAS,CAAC,YAAY,EAAE,CAAC;YACnC,QAAQ,CAAC,IAAI,CAAC;gBACZ,SAAS,EAAE,iBAAiB;gBAC5B,YAAY,EAAE,KAAK;gBACnB,QAAQ,EAAE,SAAS,CAAC,YAAY;gBAChC,WAAW,EACT,6BAA6B,KAAK,cAAc;oBAChD,WAAW,SAAS,CAAC,YAAY,GAAG;aACvC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,6DAA6D;IAC7D,MAAM,kBAAkB,GAAG,uBAAuB,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAC7E,IAAI,kBAAkB,EAAE,CAAC;QACvB,QAAQ,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;IACpC,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACtD,CAAC;IAED,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;IACnD,OAAO;QACL,QAAQ,EAAE,IAAI;QACd,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;QAC1B,OAAO,EAAE,QAAQ;KAClB,CAAC;AACJ,CAAC"}

package/dist/scheduler.d.ts

@@ -0,0 +1,98 @@
+/**
+ * DAG-aware execution unit scheduler.
+ *
+ * Each poll cycle, the scheduler examines the strategy DAG to determine
+ * which strategies have all upstream dependencies completed. For each
+ * ready strategy, it assigns an available (idle) execution unit.
+ *
+ * The core algorithm is a pure function (computeAssignments) for testability.
+ * The IO wrapper (runSchedulerCycle) handles DB queries and atomic updates.
+ */
+import type { ExecutionUnitStatus } from './types.js';
+import type { PersistedStrategy, StrategyExecutionStatus } from './strategy-design.js';
+/** Minimal strategy info needed by the scheduler. */
+export interface SchedulerStrategy {
+    id: string;
+    name: string;
+    executionStatus: StrategyExecutionStatus | null;
+    dependsOn: string[];
+    priorityRank: number;
+}
+/** Minimal execution unit info needed by the scheduler. */
+export interface SchedulerUnit {
+    id: string;
+    slotIndex: number;
+    status: ExecutionUnitStatus;
+    assignedStrategyId: string | null;
+}
+/** A single assignment produced by the scheduler. */
+export interface SchedulerAssignment {
+    unitId: string;
+    strategyId: string;
+}
+/**
+ * Compute strategy-to-unit assignments.
+ *
+ * Pure function -- no DB calls, no side effects. Takes the current state
+ * of strategies and execution units and returns the list of new assignments.
+ *
+ * Eligible strategies: executionStatus is 'pending' AND all dependsOn
+ * strategies have executionStatus 'completed'.
+ *
+ * Idle units: status is 'idle'.
+ *
+ * Matching: assign eligible strategies to idle units in priorityRank order
+ * (lower rank = higher priority). If more eligible strategies than idle units,
+ * only assign what fits.
+ */
+export declare function computeAssignments(strategies: SchedulerStrategy[], units: SchedulerUnit[]): SchedulerAssignment[];
+/** Dependencies injected into runSchedulerCycle for testability. */
+export interface SchedulerDeps {
+    getStrategies: (instanceId: string) => Promise<PersistedStrategy[]>;
+    getUnits: (instanceId: string) => Promise<SchedulerUnit[]>;
+    assignUnit: (unitId: string, strategyId: string) => Promise<{
+        id: string;
+    } | null>;
+    updateStrategyStatus: (strategyId: string, status: StrategyExecutionStatus) => Promise<void>;
+}
+/** Result of a single scheduler cycle. */
+export interface SchedulerCycleResult {
+    /** Assignments that were successfully applied. */
+    assignments: SchedulerAssignment[];
+    /** Number of eligible strategies that couldn't be assigned (no idle units). */
+    waitingStrategies: number;
+}
+/**
+ * Run one scheduler cycle for a factory instance.
+ *
+ * Fetches strategies and execution units from DB, computes assignments,
+ * then applies each assignment using an atomic conditional update.
+ *
+ * If the conditional update returns null (unit was claimed by another cycle),
+ * the assignment is skipped and logged.
+ */
+export declare function runSchedulerCycle(instanceId: string, deps: SchedulerDeps): Promise<SchedulerCycleResult>;
+/**
+ * Release the execution unit assigned to a strategy back to idle.
+ *
+ * Called when a strategy reaches a terminal state (completed via gates,
+ * or failed). Clears assignedStrategyId, sets status to 'idle' in both
+ * DB and in-memory state. Preserves claudeSessionId for potential resume.
+ *
+ * @returns true if a unit was found and released, false otherwise.
+ */
+export declare function releaseUnitForStrategy(state: {
+    executionUnits: Map<string, {
+        unitId: string;
+        assignedStrategyId: string | null;
+        assignedAt: Date | null;
+        status: ExecutionUnitStatus;
+        claudeSessionId: string | null;
+    }>;
+}, strategyId: string): Promise<boolean>;
+/**
+ * Create the default SchedulerDeps using real query functions.
+ * Used by the instance lifecycle to wire the scheduler.
+ */
+export declare function createSchedulerDeps(): SchedulerDeps;
+//# sourceMappingURL=scheduler.d.ts.map

package/dist/scheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../src/scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AACtD,OAAO,KAAK,EAAE,iBAAiB,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAQvF,qDAAqD;AACrD,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,eAAe,EAAE,uBAAuB,GAAG,IAAI,CAAC;IAChD,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,2DAA2D;AAC3D,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,mBAAmB,CAAC;IAC5B,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;CACnC;AAED,qDAAqD;AACrD,MAAM,WAAW,mBAAmB;IAClC,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB;AAMD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,kBAAkB,CAChC,UAAU,EAAE,iBAAiB,EAAE,EAC/B,KAAK,EAAE,aAAa,EAAE,GACrB,mBAAmB,EAAE,CAgCvB;AAMD,oEAAoE;AACpE,MAAM,WAAW,aAAa;IAC5B,aAAa,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAAC;IACpE,QAAQ,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;IAC3D,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,KAAK,OAAO,CAAC;QAAE,EAAE,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI,CAAC,CAAC;IACnF,oBAAoB,EAAE,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,uBAAuB,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;CAC9F;AAED,0CAA0C;AAC1C,MAAM,WAAW,oBAAoB;IACnC,kDAAkD;IAClD,WAAW,EAAE,mBAAmB,EAAE,CAAC;IACnC,+EAA+E;IAC/E,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED;;;;;;;;GAQG;AACH,wBAAsB,iBAAiB,CACrC,UAAU,EAAE,MAAM,EAClB,IAAI,EAAE,aAAa,GAClB,OAAO,CAAC,oBAAoB,CAAC,CAqF/B;AAMD;;;;;;;;GAQG;AACH,wBAAsB,sBAAsB,CAC1C,KAAK,EAAE;IAAE,cAAc,EAAE,GAAG,CAAC,MAAM,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,UAAU,EAAE,IAAI,GAAG,IAAI,CAAC;QAAC,MAAM,EAAE,mBAAmB,CAAC;QAAC,eAAe,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAC,CAAA;CAAE,EACnL,UAAU,EAAE,MAAM,GACjB,OAAO,CAAC,OAAO,CAAC,CAgClB;AAMD;;;GAGG;AACH,wBAAgB,mBAAmB,IAAI,aAAa,CAoBnD"}

package/dist/scheduler.js

@@ -0,0 +1,203 @@
+/**
+ * DAG-aware execution unit scheduler.
+ *
+ * Each poll cycle, the scheduler examines the strategy DAG to determine
+ * which strategies have all upstream dependencies completed. For each
+ * ready strategy, it assigns an available (idle) execution unit.
+ *
+ * The core algorithm is a pure function (computeAssignments) for testability.
+ * The IO wrapper (runSchedulerCycle) handles DB queries and atomic updates.
+ */
+const LOG_PREFIX = '[scheduler]';
+// ============================================================================
+// Pure scheduling algorithm
+// ============================================================================
+/**
+ * Compute strategy-to-unit assignments.
+ *
+ * Pure function -- no DB calls, no side effects. Takes the current state
+ * of strategies and execution units and returns the list of new assignments.
+ *
+ * Eligible strategies: executionStatus is 'pending' AND all dependsOn
+ * strategies have executionStatus 'completed'.
+ *
+ * Idle units: status is 'idle'.
+ *
+ * Matching: assign eligible strategies to idle units in priorityRank order
+ * (lower rank = higher priority). If more eligible strategies than idle units,
+ * only assign what fits.
+ */
+export function computeAssignments(strategies, units) {
+    // Build a status lookup for fast dependency checking
+    const statusById = new Map();
+    for (const s of strategies) {
+        statusById.set(s.id, s.executionStatus);
+    }
+    // Find eligible strategies: pending + all deps completed
+    const eligible = strategies
+        .filter((s) => {
+        if (s.executionStatus !== 'pending')
+            return false;
+        return s.dependsOn.every((depId) => statusById.get(depId) === 'completed');
+    })
+        .sort((a, b) => a.priorityRank - b.priorityRank);
+    // Find idle units, sorted by slot_index for deterministic assignment
+    const idle = units
+        .filter((u) => u.status === 'idle')
+        .sort((a, b) => a.slotIndex - b.slotIndex);
+    // Match eligible strategies to idle units
+    const assignments = [];
+    const assignCount = Math.min(eligible.length, idle.length);
+    for (let i = 0; i < assignCount; i++) {
+        assignments.push({
+            unitId: idle[i].id,
+            strategyId: eligible[i].id,
+        });
+    }
+    return assignments;
+}
+/**
+ * Run one scheduler cycle for a factory instance.
+ *
+ * Fetches strategies and execution units from DB, computes assignments,
+ * then applies each assignment using an atomic conditional update.
+ *
+ * If the conditional update returns null (unit was claimed by another cycle),
+ * the assignment is skipped and logged.
+ */
+export async function runSchedulerCycle(instanceId, deps) {
+    // Fetch current state
+    const strategies = await deps.getStrategies(instanceId);
+    const units = await deps.getUnits(instanceId);
+    // Map to scheduler types
+    const schedulerStrategies = strategies.map((s) => ({
+        id: s.id,
+        name: s.name,
+        executionStatus: s.executionStatus,
+        dependsOn: s.dependsOn,
+        priorityRank: s.priorityRank,
+    }));
+    const schedulerUnits = units.map((u) => ({
+        id: u.id,
+        slotIndex: u.slotIndex,
+        status: u.status,
+        assignedStrategyId: u.assignedStrategyId,
+    }));
+    // Compute assignments
+    const planned = computeAssignments(schedulerStrategies, schedulerUnits);
+    if (planned.length === 0) {
+        // Count how many strategies are eligible but can't be assigned
+        const eligibleCount = schedulerStrategies.filter((s) => {
+            if (s.executionStatus !== 'pending')
+                return false;
+            const statusById = new Map(schedulerStrategies.map((st) => [st.id, st.executionStatus]));
+            return s.dependsOn.every((depId) => statusById.get(depId) === 'completed');
+        }).length;
+        const idleCount = schedulerUnits.filter((u) => u.status === 'idle').length;
+        const waitingStrategies = Math.max(0, eligibleCount - idleCount);
+        return { assignments: [], waitingStrategies };
+    }
+    // Apply assignments atomically
+    const successfulAssignments = [];
+    const strategyNameById = new Map(strategies.map((s) => [s.id, s.name]));
+    for (const assignment of planned) {
+        const result = await deps.assignUnit(assignment.unitId, assignment.strategyId);
+        if (!result) {
+            // Unit was claimed by another cycle -- skip
+            console.log(`${LOG_PREFIX} Unit ${assignment.unitId} was already claimed -- skipping assignment ` +
+                `for strategy "${strategyNameById.get(assignment.strategyId) ?? assignment.strategyId}"`);
+            continue;
+        }
+        // Update strategy execution_status to in_progress
+        try {
+            await deps.updateStrategyStatus(assignment.strategyId, 'in_progress');
+        }
+        catch (err) {
+            console.error(`${LOG_PREFIX} Failed to update strategy ${assignment.strategyId} to in_progress: ` +
+                `${err.message}`);
+            // Assignment succeeded in DB but status update failed -- still count it
+        }
+        successfulAssignments.push(assignment);
+        console.log(`${LOG_PREFIX} Assigned strategy "${strategyNameById.get(assignment.strategyId) ?? assignment.strategyId}" ` +
+            `to unit ${assignment.unitId}`);
+    }
+    // Count waiting strategies
+    const assignedStrategyIds = new Set(successfulAssignments.map((a) => a.strategyId));
+    const eligibleAfter = schedulerStrategies.filter((s) => {
+        if (s.executionStatus !== 'pending')
+            return false;
+        if (assignedStrategyIds.has(s.id))
+            return false;
+        const statusById = new Map(schedulerStrategies.map((st) => [st.id, st.executionStatus]));
+        return s.dependsOn.every((depId) => statusById.get(depId) === 'completed');
+    }).length;
+    return {
+        assignments: successfulAssignments,
+        waitingStrategies: eligibleAfter,
+    };
+}
+// ============================================================================
+// Unit release
+// ============================================================================
+/**
+ * Release the execution unit assigned to a strategy back to idle.
+ *
+ * Called when a strategy reaches a terminal state (completed via gates,
+ * or failed). Clears assignedStrategyId, sets status to 'idle' in both
+ * DB and in-memory state. Preserves claudeSessionId for potential resume.
+ *
+ * @returns true if a unit was found and released, false otherwise.
+ */
+export async function releaseUnitForStrategy(state, strategyId) {
+    // Find the unit assigned to this strategy
+    let targetUnit = null;
+    for (const unit of state.executionUnits.values()) {
+        if (unit.assignedStrategyId === strategyId) {
+            targetUnit = unit;
+            break;
+        }
+    }
+    if (!targetUnit) {
+        console.log(`${LOG_PREFIX} No execution unit found for strategy ${strategyId} -- skipping release`);
+        return false;
+    }
+    // Release in DB
+    const { releaseExecutionUnit } = await import('./queries/execution-units.js');
+    await releaseExecutionUnit(targetUnit.unitId);
+    // Update in-memory state
+    targetUnit.assignedStrategyId = null;
+    targetUnit.assignedAt = null;
+    targetUnit.status = 'idle';
+    console.log(`${LOG_PREFIX} Released unit ${targetUnit.unitId} (strategy ${strategyId} -> idle)` +
+        (targetUnit.claudeSessionId ? ` [session preserved for resume]` : ''));
+    return true;
+}
+// ============================================================================
+// Default dependencies
+// ============================================================================
+/**
+ * Create the default SchedulerDeps using real query functions.
+ * Used by the instance lifecycle to wire the scheduler.
+ */
+export function createSchedulerDeps() {
+    // Lazy imports to avoid circular dependencies
+    return {
+        getStrategies: async (instanceId) => {
+            const { getStrategiesByFactoryInstance } = await import('./strategy-design.js');
+            return getStrategiesByFactoryInstance(instanceId);
+        },
+        getUnits: async (instanceId) => {
+            const { getExecutionUnitsByInstance } = await import('./queries/execution-units.js');
+            return getExecutionUnitsByInstance(instanceId);
+        },
+        assignUnit: async (unitId, strategyId) => {
+            const { assignExecutionUnit } = await import('./queries/execution-units.js');
+            return assignExecutionUnit(unitId, strategyId);
+        },
+        updateStrategyStatus: async (strategyId, status) => {
+            const { updateStrategyExecutionStatus } = await import('./queries/strategies.js');
+            await updateStrategyExecutionStatus(strategyId, status);
+        },
+    };
+}
+//# sourceMappingURL=scheduler.js.map

package/dist/scheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../src/scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAKH,MAAM,UAAU,GAAG,aAAa,CAAC;AA6BjC,+EAA+E;AAC/E,4BAA4B;AAC5B,+EAA+E;AAE/E;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,kBAAkB,CAChC,UAA+B,EAC/B,KAAsB;IAEtB,qDAAqD;IACrD,MAAM,UAAU,GAAG,IAAI,GAAG,EAA0C,CAAC;IACrE,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,eAAe,CAAC,CAAC;IAC1C,CAAC;IAED,yDAAyD;IACzD,MAAM,QAAQ,GAAG,UAAU;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,CAAC,CAAC,eAAe,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAClD,OAAO,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,WAAW,CAAC,CAAC;IAC7E,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC;IAEnD,qEAAqE;IACrE,MAAM,IAAI,GAAG,KAAK;SACf,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC;SAClC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;IAE7C,0CAA0C;IAC1C,MAAM,WAAW,GAA0B,EAAE,CAAC;IAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAE3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,WAAW,CAAC,IAAI,CAAC;YACf,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;YAClB,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;SAC3B,CAAC,CAAC;IACL,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAsBD;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,UAAkB,EAClB,IAAmB;IAEnB,sBAAsB;IACtB,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;IACxD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;IAE9C,yBAAyB;IACzB,MAAM,mBAAmB,GAAwB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACtE,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,eAAe,EAAE,CAAC,CAAC,eAAe;QAClC,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,YAAY,EAAE,CAAC,CAAC,YAAY;KAC7B,CAAC,CAAC,CAAC;IAEJ,MAAM,cAAc,GAAoB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACxD,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,kBAAkB,EAAE,CAAC,CAAC,kBAAkB;KACzC,CAAC,CAAC,CAAC;IAEJ,sBAAsB;IACtB,MAAM,OAAO,GAAG,kBAAkB,CAAC,mBAAmB,EAAE,cAAc,CAAC,CAAC;IAExE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,+DAA+D;QAC/D,MAAM,aAAa,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACrD,IAAI,CAAC,CAAC,eAAe,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YAClD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACzF,OAAO,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,WAAW,CAAC,CAAC;QAC7E,CAAC,CAAC,CAAC,MAAM,CAAC;QACV,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC;QAC3E,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC,CAAC;QAEjE,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,iBAAiB,EAAE,CAAC;IAChD,CAAC;IAED,+BAA+B;IAC/B,MAAM,qBAAqB,GAA0B,EAAE,CAAC;IACxD,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAExE,KAAK,MAAM,UAAU,IAAI,OAAO,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC;QAE/E,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,4CAA4C;YAC5C,OAAO,CAAC,GAAG,CACT,GAAG,UAAU,SAAS,UAAU,CAAC,MAAM,8CAA8C;gBACrF,iBAAiB,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,UAAU,GAAG,CACzF,CAAC;YACF,SAAS;QACX,CAAC;QAED,kDAAkD;QAClD,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,oBAAoB,CAAC,UAAU,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;QACxE,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CACX,GAAG,UAAU,8BAA8B,UAAU,CAAC,UAAU,mBAAmB;gBACnF,GAAI,GAAa,CAAC,OAAO,EAAE,CAC5B,CAAC;YACF,wEAAwE;QAC1E,CAAC;QAED,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEvC,OAAO,CAAC,GAAG,CACT,GAAG,UAAU,uBAAuB,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,UAAU,IAAI;YAC5G,WAAW,UAAU,CAAC,MAAM,EAAE,CAC/B,CAAC;IACJ,CAAC;IAED,2BAA2B;IAC3B,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IACpF,MAAM,aAAa,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACrD,IAAI,CAAC,CAAC,eAAe,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAClD,IAAI,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;QAChD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACzF,OAAO,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,WAAW,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC,MAAM,CAAC;IAEV,OAAO;QACL,WAAW,EAAE,qBAAqB;QAClC,iBAAiB,EAAE,aAAa;KACjC,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,eAAe;AACf,+EAA+E;AAE/E;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,KAAmL,EACnL,UAAkB;IAElB,0CAA0C;IAC1C,IAAI,UAAU,GAAuJ,IAAI,CAAC;IAC1K,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,kBAAkB,KAAK,UAAU,EAAE,CAAC;YAC3C,UAAU,GAAG,IAAI,CAAC;YAClB,MAAM;QACR,CAAC;IACH,CAAC;IAED,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,OAAO,CAAC,GAAG,CACT,GAAG,UAAU,yCAAyC,UAAU,sBAAsB,CACvF,CAAC;QACF,OAAO,KAAK,CAAC;IACf,CAAC;IAED,gBAAgB;IAChB,MAAM,EAAE,oBAAoB,EAAE,GAAG,MAAM,MAAM,CAAC,8BAA8B,CAAC,CAAC;IAC9E,MAAM,oBAAoB,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAE9C,yBAAyB;IACzB,UAAU,CAAC,kBAAkB,GAAG,IAAI,CAAC;IACrC,UAAU,CAAC,UAAU,GAAG,IAAI,CAAC;IAC7B,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC;IAE3B,OAAO,CAAC,GAAG,CACT,GAAG,UAAU,kBAAkB,UAAU,CAAC,MAAM,cAAc,UAAU,WAAW;QACnF,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,iCAAiC,CAAC,CAAC,CAAC,EAAE,CAAC,CACtE,CAAC;IAEF,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+EAA+E;AAC/E,uBAAuB;AACvB,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,UAAU,mBAAmB;IACjC,8CAA8C;IAC9C,OAAO;QACL,aAAa,EAAE,KAAK,EAAE,UAAkB,EAAE,EAAE;YAC1C,MAAM,EAAE,8BAA8B,EAAE,GAAG,MAAM,MAAM,CAAC,sBAAsB,CAAC,CAAC;YAChF,OAAO,8BAA8B,CAAC,UAAU,CAAC,CAAC;QACpD,CAAC;QACD,QAAQ,EAAE,KAAK,EAAE,UAAkB,EAAE,EAAE;YACrC,MAAM,EAAE,2BAA2B,EAAE,GAAG,MAAM,MAAM,CAAC,8BAA8B,CAAC,CAAC;YACrF,OAAO,2BAA2B,CAAC,UAAU,CAAC,CAAC;QACjD,CAAC;QACD,UAAU,EAAE,KAAK,EAAE,MAAc,EAAE,UAAkB,EAAE,EAAE;YACvD,MAAM,EAAE,mBAAmB,EAAE,GAAG,MAAM,MAAM,CAAC,8BAA8B,CAAC,CAAC;YAC7E,OAAO,mBAAmB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACjD,CAAC;QACD,oBAAoB,EAAE,KAAK,EAAE,UAAkB,EAAE,MAA+B,EAAE,EAAE;YAClF,MAAM,EAAE,6BAA6B,EAAE,GAAG,MAAM,MAAM,CAAC,yBAAyB,CAAC,CAAC;YAClF,MAAM,6BAA6B,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAC1D,CAAC;KACF,CAAC;AACJ,CAAC"}