@zxyycom/vibe-check 0.0.1

package/dist/esm/project-run/task-scheduler/execution-state.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"execution-state.mjs","sourceRoot":"","sources":["../../../../src/project-run/task-scheduler/execution-state.ts"],"names":[],"mappings":"AAoEA,MAAM,UAAU,oBAAoB,CAClC,KAAuB,EACvB,OAAqC;IAErC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAwB,CAAC;IACnD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;YACvB,KAAK;YACL,iBAAiB,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC;YACnD,QAAQ,EAAE,KAAK;SAChB,CAAC,CAAC;IACL,CAAC;IACD,OAAO;QACL,gBAAgB,EAAE,OAAO,CAAC,gBAAgB;QAC1C,KAAK;QACL,WAAW,EAAE,OAAO,CAAC,WAAW;QAChC,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,OAAO,EAAE,OAAO,CAAC,OAAO;QACxB,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,WAAW,EAAE,IAAI,GAAG,EAAE;QACtB,cAAc,EAAE,IAAI,GAAG,EAAE;QACzB,mBAAmB,EAAE,IAAI,GAAG,EAAE;QAC9B,UAAU;QACV,iBAAiB,EAAE,SAAS;QAC5B,WAAW,EAAE,KAAK;KACnB,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,sBAAsB,CAAU,KAA8B;IAC5E,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,cAAc,EAAE,MAAM,CAAC,MAAM,CAC3B,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;aAC3B,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC;aACjC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAClC;QACD,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,gBAAgB,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,KAAK,IAAI;QAChD,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,cAAc,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnE,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;QAC1C,cAAc,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC;QACxD,cAAc,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;QAC5D,YAAY,EAAE,MAAM,CAAC,MAAM,CACzB,CAAC,GAAG,KAAK,CAAC,mBAAmB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE,EAAE,CAC1D,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CACjD,CACF;KACF,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,YAAY,CAC1B,IAAiB,EACjB,KAA8B;IAE9B,OAAO,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACrF,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAU,KAA8B;IACxE,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;IACzB,KAAK,CAAC,iBAAiB,GAAG,SAAS,CAAC;IACpC,OAAO,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACnC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QACnE,CAAC;QACD,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,wBAAwB,EAAE,CAAC,CAAC,CAAC;IACnF,CAAC;AACH,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC9B,KAA8B,EAC9B,IAAiB,EACjB,UAAmC;IAEnC,IAAI,KAAK,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,EAAE,yBAAyB,CAAC,CAAC;IAC5D,CAAC;IACD,KAAK,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACxC,IAAI,KAAK,EAAE,KAAK,CAAC,cAAc,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;QAC5C,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC;IACzB,CAAC;AACH,CAAC","sourcesContent":["import type { PlannedTask, PlannedTaskGraph, PlannedTaskScope, TaskGraph } from \"./graph.ts\";\nimport type { DiagnosticLogger } from \"../diagnostic-logging/logger.ts\";\nimport type { SchedulerSnapshot } from \"./scheduler-decision.ts\";\n\nexport type TaskSettlement<TResult> = Readonly<\n  | { readonly kind: \"completed\"; readonly value: TResult }\n  | { readonly kind: \"failed\"; readonly error: unknown }\n  | { readonly kind: \"blocked\"; readonly dependencyIds: readonly string[] }\n  | { readonly kind: \"cancelled-before-start\" }\n>;\n\nexport interface SettledTask<TResult> {\n  readonly task: PlannedTask;\n  readonly settlement: TaskSettlement<TResult>;\n}\n\nexport interface TaskExecutionContext {\n  readonly signal: AbortSignal | undefined;\n}\n\nexport interface TaskGraphRun<TResult> {\n  readonly cancelled: boolean;\n  /** One entry per static graph Task, in static graph order. */\n  readonly settlements: readonly SettledTask<TResult>[];\n}\n\nexport interface RunTaskGraphOptions<TResult> {\n  readonly diagnosticLogger?: DiagnosticLogger;\n  readonly graph: TaskGraph;\n  readonly maxParallel: number;\n  readonly signal?: AbortSignal;\n  readonly execute: (\n    task: PlannedTask,\n    context: TaskExecutionContext\n  ) => TResult | Promise<TResult>;\n}\n\nexport type RunningTaskCompletion<TResult> = Readonly<{\n  readonly taskId: string;\n  readonly settlement: TaskSettlement<TResult>;\n}>;\n\nexport interface RunningTask<TResult> {\n  readonly task: PlannedTask;\n  readonly completion: Promise<RunningTaskCompletion<TResult>>;\n}\n\nexport interface RuntimeScope {\n  readonly scope: PlannedTaskScope;\n  readonly activationTaskIds: ReadonlySet<string>;\n  isActive: boolean;\n}\n\nexport interface SchedulerState<TResult> {\n  readonly diagnosticLogger: DiagnosticLogger | undefined;\n  readonly graph: PlannedTaskGraph;\n  readonly maxParallel: number;\n  readonly signal: AbortSignal | undefined;\n  readonly execute: RunTaskGraphOptions<TResult>[\"execute\"];\n  readonly pending: PlannedTask[];\n  readonly runningById: Map<string, RunningTask<TResult>>;\n  readonly runningMutexes: Set<string>;\n  readonly settlementsByTaskId: Map<string, TaskSettlement<TResult>>;\n  readonly scopesById: ReadonlyMap<string, RuntimeScope>;\n  reservationTaskId: string | undefined;\n  isCancelled: boolean;\n}\n\nexport function createSchedulerState<TResult>(\n  graph: PlannedTaskGraph,\n  options: RunTaskGraphOptions<TResult>\n): SchedulerState<TResult> {\n  const scopesById = new Map<string, RuntimeScope>();\n  for (const scope of graph.scopes) {\n    scopesById.set(scope.id, {\n      scope,\n      activationTaskIds: new Set(scope.activationTaskIds),\n      isActive: false\n    });\n  }\n  return {\n    diagnosticLogger: options.diagnosticLogger,\n    graph,\n    maxParallel: options.maxParallel,\n    signal: options.signal,\n    execute: options.execute,\n    pending: [...graph.tasks],\n    runningById: new Map(),\n    runningMutexes: new Set(),\n    settlementsByTaskId: new Map(),\n    scopesById,\n    reservationTaskId: undefined,\n    isCancelled: false\n  };\n}\n\n/** Projects mutable execution state into the pure scheduler-decision input. */\nexport function snapshotSchedulerState<TResult>(state: SchedulerState<TResult>): SchedulerSnapshot {\n  return Object.freeze({\n    activeScopeIds: Object.freeze(\n      [...state.scopesById.values()]\n        .filter((scope) => scope.isActive)\n        .map((scope) => scope.scope.id)\n    ),\n    graph: state.graph,\n    isAbortRequested: state.signal?.aborted === true,\n    isCancelled: state.isCancelled,\n    maxParallel: state.maxParallel,\n    pendingTaskIds: Object.freeze(state.pending.map((task) => task.id)),\n    reservationTaskId: state.reservationTaskId,\n    runningMutexes: Object.freeze([...state.runningMutexes]),\n    runningTaskIds: Object.freeze([...state.runningById.keys()]),\n    settledTasks: Object.freeze(\n      [...state.settlementsByTaskId].map(([taskId, settlement]) =>\n        Object.freeze({ kind: settlement.kind, taskId })\n      )\n    )\n  });\n}\n\nexport function scopeForTask<TResult>(\n  task: PlannedTask,\n  state: SchedulerState<TResult>\n): RuntimeScope | undefined {\n  return task.scopeId === undefined ? undefined : state.scopesById.get(task.scopeId);\n}\n\nexport function cancelPendingTasks<TResult>(state: SchedulerState<TResult>): void {\n  state.isCancelled = true;\n  state.reservationTaskId = undefined;\n  while (state.pending.length > 0) {\n    const task = state.pending.shift();\n    if (task === undefined) {\n      throw new Error(\"task graph pending queue changed unexpectedly\");\n    }\n    recordSettlement(state, task, Object.freeze({ kind: \"cancelled-before-start\" }));\n  }\n}\n\nexport function recordSettlement<TResult>(\n  state: SchedulerState<TResult>,\n  task: PlannedTask,\n  settlement: TaskSettlement<TResult>\n): void {\n  if (state.settlementsByTaskId.has(task.id)) {\n    throw new Error(`task ${task.id} settled more than once`);\n  }\n  state.settlementsByTaskId.set(task.id, settlement);\n  const scope = scopeForTask(task, state);\n  if (scope?.scope.terminalTaskId === task.id) {\n    scope.isActive = false;\n  }\n}\n"]}

package/dist/esm/project-run/task-scheduler/graph-validation.mjs

@@ -0,0 +1,119 @@
+/** Validates dependency and scope relations after graph-shaped input is normalized. */
+export function validatePreparedTaskGraph(input) {
+    validateDependencies(input.tasks, input.taskById);
+    validateDependencyCycles(input.tasks, input.taskById);
+    validateScopes(input);
+}
+function validateDependencies(tasks, taskById) {
+    for (const task of tasks) {
+        for (const dependency of task.dependsOn) {
+            if (!taskById.has(dependency)) {
+                throw new Error(`task ${task.id} depends on unknown task ${dependency}`);
+            }
+        }
+    }
+}
+function validateDependencyCycles(tasks, taskById) {
+    const visiting = new Set();
+    const visited = new Set();
+    const visit = (task) => {
+        if (visiting.has(task.id)) {
+            throw new Error(`task dependency cycle includes ${task.id}`);
+        }
+        if (visited.has(task.id))
+            return;
+        visiting.add(task.id);
+        for (const dependency of task.dependsOn) {
+            const dependencyTask = taskById.get(dependency);
+            if (dependencyTask === undefined) {
+                throw new Error(`task ${task.id} depends on unknown task ${dependency}`);
+            }
+            visit(dependencyTask);
+        }
+        visiting.delete(task.id);
+        visited.add(task.id);
+    };
+    for (const task of tasks) {
+        visit(task);
+    }
+}
+function validateScopes(input) {
+    validateRootMaxParallel(input.rootMaxParallel);
+    validateTaskScopeMembership(input.tasks, input.scopeById);
+    for (const scope of input.scopes) {
+        validateScopeCap(scope, input.rootMaxParallel);
+        validateScopeTerminal(scope, input.taskById);
+        validateScopeActivation(scope, input.taskById);
+        validateScopeTerminalReachability(scope, input.tasks, input.taskById);
+    }
+}
+function validateRootMaxParallel(rootMaxParallel) {
+    if (rootMaxParallel !== undefined &&
+        (!Number.isSafeInteger(rootMaxParallel) || rootMaxParallel <= 0)) {
+        throw new TypeError("task engine maxParallel must be a positive safe integer");
+    }
+}
+function validateTaskScopeMembership(tasks, scopeById) {
+    for (const task of tasks) {
+        if (task.scopeId !== undefined && !scopeById.has(task.scopeId)) {
+            throw new Error(`task ${task.id} references unknown scope ${task.scopeId}`);
+        }
+    }
+}
+function validateScopeCap(scope, rootMaxParallel) {
+    if (rootMaxParallel !== undefined && scope.maxParallel > rootMaxParallel) {
+        throw new Error(`task scope ${scope.id} maxParallel exceeds task engine maxParallel`);
+    }
+}
+function validateScopeTerminal(scope, taskById) {
+    const terminal = taskById.get(scope.terminalTaskId);
+    if (terminal?.scopeId !== scope.id) {
+        throw new Error(`task scope ${scope.id} terminal task must belong to the scope`);
+    }
+}
+function validateScopeActivation(scope, taskById) {
+    const activationIds = new Set();
+    for (const taskId of scope.activationTaskIds) {
+        if (activationIds.has(taskId)) {
+            throw new Error(`task scope ${scope.id} repeats activation task ${taskId}`);
+        }
+        activationIds.add(taskId);
+        const task = taskById.get(taskId);
+        if (task?.scopeId !== scope.id) {
+            throw new Error(`task scope ${scope.id} activation task must belong to the scope: ${taskId}`);
+        }
+    }
+}
+function validateScopeTerminalReachability(scope, tasks, taskById) {
+    for (const task of tasks) {
+        if (task.scopeId !== scope.id || task.id === scope.terminalTaskId)
+            continue;
+        if (!dependsOnTask({ requiredDependencyId: task.id, taskById, taskId: scope.terminalTaskId })) {
+            throw new Error(`task scope ${scope.id} terminal task must depend on scoped task ${task.id}`);
+        }
+    }
+}
+function dependsOnTask(query) {
+    return traverseDependencies({
+        pending: [...taskDependencies(query.taskById, query.taskId)],
+        query,
+        visited: new Set()
+    });
+}
+function traverseDependencies(traversal) {
+    while (traversal.pending.length > 0) {
+        const dependencyId = traversal.pending.pop();
+        if (dependencyId === undefined || traversal.visited.has(dependencyId))
+            continue;
+        if (dependencyId === traversal.query.requiredDependencyId)
+            return true;
+        traversal.visited.add(dependencyId);
+        traversal.pending.push(...taskDependencies(traversal.query.taskById, dependencyId));
+    }
+    return false;
+}
+function taskDependencies(taskById, taskId) {
+    const task = taskById.get(taskId);
+    return task === undefined ? [] : task.dependsOn;
+}
+//# sourceMappingURL=graph-validation.mjs.map

package/dist/esm/project-run/task-scheduler/graph-validation.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-validation.mjs","sourceRoot":"","sources":["../../../../src/project-run/task-scheduler/graph-validation.ts"],"names":[],"mappings":"AAsBA,uFAAuF;AACvF,MAAM,UAAU,yBAAyB,CAAC,KAAuC;IAC/E,oBAAoB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IAClD,wBAAwB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IACtD,cAAc,CAAC,KAAK,CAAC,CAAC;AACxB,CAAC;AAED,SAAS,oBAAoB,CAC3B,KAA6B,EAC7B,QAA0C;IAE1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACxC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC9B,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,EAAE,4BAA4B,UAAU,EAAE,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,wBAAwB,CAC/B,KAA6B,EAC7B,QAA0C;IAE1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,MAAM,KAAK,GAAG,CAAC,IAAiB,EAAQ,EAAE;QACxC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,kCAAkC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,OAAO;QAEjC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACxC,MAAM,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAChD,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;gBACjC,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,EAAE,4BAA4B,UAAU,EAAE,CAAC,CAAC;YAC3E,CAAC;YACD,KAAK,CAAC,cAAc,CAAC,CAAC;QACxB,CAAC;QACD,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,KAAuC;IAC7D,uBAAuB,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAC/C,2BAA2B,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;IAC1D,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC;QAC/C,qBAAqB,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC7C,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC/C,iCAAiC,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IACxE,CAAC;AACH,CAAC;AAED,SAAS,uBAAuB,CAAC,eAAmC;IAClE,IACE,eAAe,KAAK,SAAS;QAC7B,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,eAAe,CAAC,IAAI,eAAe,IAAI,CAAC,CAAC,EAChE,CAAC;QACD,MAAM,IAAI,SAAS,CAAC,yDAAyD,CAAC,CAAC;IACjF,CAAC;AACH,CAAC;AAED,SAAS,2BAA2B,CAClC,KAA6B,EAC7B,SAAgD;IAEhD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YAC/D,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,EAAE,6BAA6B,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QAC9E,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB,CAAC,KAAuB,EAAE,eAAmC;IACpF,IAAI,eAAe,KAAK,SAAS,IAAI,KAAK,CAAC,WAAW,GAAG,eAAe,EAAE,CAAC;QACzE,MAAM,IAAI,KAAK,CAAC,cAAc,KAAK,CAAC,EAAE,8CAA8C,CAAC,CAAC;IACxF,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAC5B,KAAuB,EACvB,QAA0C;IAE1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IACpD,IAAI,QAAQ,EAAE,OAAO,KAAK,KAAK,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,IAAI,KAAK,CAAC,cAAc,KAAK,CAAC,EAAE,yCAAyC,CAAC,CAAC;IACnF,CAAC;AACH,CAAC;AAED,SAAS,uBAAuB,CAC9B,KAAuB,EACvB,QAA0C;IAE1C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IACxC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;QAC7C,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CAAC,cAAc,KAAK,CAAC,EAAE,4BAA4B,MAAM,EAAE,CAAC,CAAC;QAC9E,CAAC;QACD,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,IAAI,EAAE,OAAO,KAAK,KAAK,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,cAAc,KAAK,CAAC,EAAE,8CAA8C,MAAM,EAAE,CAAC,CAAC;QAChG,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,iCAAiC,CACxC,KAAuB,EACvB,KAA6B,EAC7B,QAA0C;IAE1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,cAAc;YAAE,SAAS;QAC5E,IAAI,CAAC,aAAa,CAAC,EAAE,oBAAoB,EAAE,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,cAAc,EAAE,CAAC,EAAE,CAAC;YAC9F,MAAM,IAAI,KAAK,CAAC,cAAc,KAAK,CAAC,EAAE,6CAA6C,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QAChG,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,KAA0B;IAC/C,OAAO,oBAAoB,CAAC;QAC1B,OAAO,EAAE,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC5D,KAAK;QACL,OAAO,EAAE,IAAI,GAAG,EAAE;KACnB,CAAC,CAAC;AACL,CAAC;AAED,SAAS,oBAAoB,CAAC,SAA8B;IAC1D,OAAO,SAAS,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,MAAM,YAAY,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QAC7C,IAAI,YAAY,KAAK,SAAS,IAAI,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC;YAAE,SAAS;QAChF,IAAI,YAAY,KAAK,SAAS,CAAC,KAAK,CAAC,oBAAoB;YAAE,OAAO,IAAI,CAAC;QAEvE,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACpC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;IACtF,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,gBAAgB,CACvB,QAA0C,EAC1C,MAAc;IAEd,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAClC,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;AAClD,CAAC","sourcesContent":["import type { PlannedTask, PlannedTaskScope } from \"./graph.ts\";\n\ninterface PreparedTaskGraphValidationInput {\n  readonly rootMaxParallel: number | undefined;\n  readonly scopeById: ReadonlyMap<string, PlannedTaskScope>;\n  readonly scopes: readonly PlannedTaskScope[];\n  readonly taskById: ReadonlyMap<string, PlannedTask>;\n  readonly tasks: readonly PlannedTask[];\n}\n\ninterface DependencyPathQuery {\n  readonly requiredDependencyId: string;\n  readonly taskById: ReadonlyMap<string, PlannedTask>;\n  readonly taskId: string;\n}\n\ninterface DependencyTraversal {\n  readonly pending: string[];\n  readonly query: DependencyPathQuery;\n  readonly visited: Set<string>;\n}\n\n/** Validates dependency and scope relations after graph-shaped input is normalized. */\nexport function validatePreparedTaskGraph(input: PreparedTaskGraphValidationInput): void {\n  validateDependencies(input.tasks, input.taskById);\n  validateDependencyCycles(input.tasks, input.taskById);\n  validateScopes(input);\n}\n\nfunction validateDependencies(\n  tasks: readonly PlannedTask[],\n  taskById: ReadonlyMap<string, PlannedTask>\n): void {\n  for (const task of tasks) {\n    for (const dependency of task.dependsOn) {\n      if (!taskById.has(dependency)) {\n        throw new Error(`task ${task.id} depends on unknown task ${dependency}`);\n      }\n    }\n  }\n}\n\nfunction validateDependencyCycles(\n  tasks: readonly PlannedTask[],\n  taskById: ReadonlyMap<string, PlannedTask>\n): void {\n  const visiting = new Set<string>();\n  const visited = new Set<string>();\n\n  const visit = (task: PlannedTask): void => {\n    if (visiting.has(task.id)) {\n      throw new Error(`task dependency cycle includes ${task.id}`);\n    }\n    if (visited.has(task.id)) return;\n\n    visiting.add(task.id);\n    for (const dependency of task.dependsOn) {\n      const dependencyTask = taskById.get(dependency);\n      if (dependencyTask === undefined) {\n        throw new Error(`task ${task.id} depends on unknown task ${dependency}`);\n      }\n      visit(dependencyTask);\n    }\n    visiting.delete(task.id);\n    visited.add(task.id);\n  };\n\n  for (const task of tasks) {\n    visit(task);\n  }\n}\n\nfunction validateScopes(input: PreparedTaskGraphValidationInput): void {\n  validateRootMaxParallel(input.rootMaxParallel);\n  validateTaskScopeMembership(input.tasks, input.scopeById);\n  for (const scope of input.scopes) {\n    validateScopeCap(scope, input.rootMaxParallel);\n    validateScopeTerminal(scope, input.taskById);\n    validateScopeActivation(scope, input.taskById);\n    validateScopeTerminalReachability(scope, input.tasks, input.taskById);\n  }\n}\n\nfunction validateRootMaxParallel(rootMaxParallel: number | undefined): void {\n  if (\n    rootMaxParallel !== undefined &&\n    (!Number.isSafeInteger(rootMaxParallel) || rootMaxParallel <= 0)\n  ) {\n    throw new TypeError(\"task engine maxParallel must be a positive safe integer\");\n  }\n}\n\nfunction validateTaskScopeMembership(\n  tasks: readonly PlannedTask[],\n  scopeById: ReadonlyMap<string, PlannedTaskScope>\n): void {\n  for (const task of tasks) {\n    if (task.scopeId !== undefined && !scopeById.has(task.scopeId)) {\n      throw new Error(`task ${task.id} references unknown scope ${task.scopeId}`);\n    }\n  }\n}\n\nfunction validateScopeCap(scope: PlannedTaskScope, rootMaxParallel: number | undefined): void {\n  if (rootMaxParallel !== undefined && scope.maxParallel > rootMaxParallel) {\n    throw new Error(`task scope ${scope.id} maxParallel exceeds task engine maxParallel`);\n  }\n}\n\nfunction validateScopeTerminal(\n  scope: PlannedTaskScope,\n  taskById: ReadonlyMap<string, PlannedTask>\n): void {\n  const terminal = taskById.get(scope.terminalTaskId);\n  if (terminal?.scopeId !== scope.id) {\n    throw new Error(`task scope ${scope.id} terminal task must belong to the scope`);\n  }\n}\n\nfunction validateScopeActivation(\n  scope: PlannedTaskScope,\n  taskById: ReadonlyMap<string, PlannedTask>\n): void {\n  const activationIds = new Set<string>();\n  for (const taskId of scope.activationTaskIds) {\n    if (activationIds.has(taskId)) {\n      throw new Error(`task scope ${scope.id} repeats activation task ${taskId}`);\n    }\n    activationIds.add(taskId);\n    const task = taskById.get(taskId);\n    if (task?.scopeId !== scope.id) {\n      throw new Error(`task scope ${scope.id} activation task must belong to the scope: ${taskId}`);\n    }\n  }\n}\n\nfunction validateScopeTerminalReachability(\n  scope: PlannedTaskScope,\n  tasks: readonly PlannedTask[],\n  taskById: ReadonlyMap<string, PlannedTask>\n): void {\n  for (const task of tasks) {\n    if (task.scopeId !== scope.id || task.id === scope.terminalTaskId) continue;\n    if (!dependsOnTask({ requiredDependencyId: task.id, taskById, taskId: scope.terminalTaskId })) {\n      throw new Error(`task scope ${scope.id} terminal task must depend on scoped task ${task.id}`);\n    }\n  }\n}\n\nfunction dependsOnTask(query: DependencyPathQuery): boolean {\n  return traverseDependencies({\n    pending: [...taskDependencies(query.taskById, query.taskId)],\n    query,\n    visited: new Set()\n  });\n}\n\nfunction traverseDependencies(traversal: DependencyTraversal): boolean {\n  while (traversal.pending.length > 0) {\n    const dependencyId = traversal.pending.pop();\n    if (dependencyId === undefined || traversal.visited.has(dependencyId)) continue;\n    if (dependencyId === traversal.query.requiredDependencyId) return true;\n\n    traversal.visited.add(dependencyId);\n    traversal.pending.push(...taskDependencies(traversal.query.taskById, dependencyId));\n  }\n  return false;\n}\n\nfunction taskDependencies(\n  taskById: ReadonlyMap<string, PlannedTask>,\n  taskId: string\n): readonly string[] {\n  const task = taskById.get(taskId);\n  return task === undefined ? [] : task.dependsOn;\n}\n"]}

package/dist/esm/project-run/task-scheduler/graph.mjs

@@ -0,0 +1,116 @@
+import { validatePreparedTaskGraph } from "./graph-validation.mjs";
+const TASK_GRAPH_KEYS = ["tasks", "scopes"];
+const TASK_NODE_KEYS = ["id", "dependsOn", "mutex", "scopeId"];
+const TASK_SCOPE_KEYS = ["id", "maxParallel", "activationTaskIds", "terminalTaskId"];
+/** Validates untrusted graph-shaped input without admitting it to scheduler execution. */
+export function validateTaskGraph(graph) {
+    prepareTaskGraph(graph);
+}
+export function prepareTaskGraph(graph, rootMaxParallel) {
+    const data = record(graph, "task graph", TASK_GRAPH_KEYS);
+    const tasks = normalizeTasks(data.tasks);
+    const scopes = normalizeScopes(data.scopes);
+    const taskById = new Map(tasks.map((task) => [task.id, task]));
+    const scopeById = new Map(scopes.map((scope) => [scope.id, scope]));
+    validatePreparedTaskGraph({ rootMaxParallel, scopeById, scopes, taskById, tasks });
+    return Object.freeze({
+        tasks: Object.freeze(tasks),
+        scopes: Object.freeze(scopes)
+    });
+}
+function normalizeTasks(value) {
+    if (!Array.isArray(value)) {
+        throw new TypeError("task graph tasks must be an array");
+    }
+    const ids = new Set();
+    const tasks = [];
+    for (const [index, candidate] of value.entries()) {
+        const data = record(candidate, `task graph tasks[${index}]`, TASK_NODE_KEYS);
+        const id = nonEmptyString(data.id, `task graph tasks[${index}].id`);
+        if (ids.has(id)) {
+            throw new TypeError(`duplicate task id: ${id}`);
+        }
+        ids.add(id);
+        const scopeId = optionalNonEmptyString(data.scopeId, `task ${id}.scopeId`);
+        tasks.push(Object.freeze({
+            id,
+            dependsOn: Object.freeze(stringList(data.dependsOn, `task ${id}.dependsOn`)),
+            mutex: Object.freeze(stringList(data.mutex, `task ${id}.mutex`)),
+            scopeId
+        }));
+    }
+    return tasks;
+}
+function normalizeScopes(value) {
+    if (value === undefined) {
+        return [];
+    }
+    if (!Array.isArray(value)) {
+        throw new TypeError("task graph scopes must be an array");
+    }
+    const ids = new Set();
+    const scopes = [];
+    for (const [index, candidate] of value.entries()) {
+        const data = record(candidate, `task graph scopes[${index}]`, TASK_SCOPE_KEYS);
+        const id = nonEmptyString(data.id, `task graph scopes[${index}].id`);
+        if (ids.has(id)) {
+            throw new TypeError(`duplicate task scope id: ${id}`);
+        }
+        ids.add(id);
+        const maxParallel = positiveSafeInteger(data.maxParallel, `task scope ${id}.maxParallel`);
+        const activationTaskIds = requiredStringList(data.activationTaskIds, `task scope ${id}.activationTaskIds`);
+        const terminalTaskId = nonEmptyString(data.terminalTaskId, `task scope ${id}.terminalTaskId`);
+        scopes.push(Object.freeze({
+            id,
+            maxParallel,
+            activationTaskIds: Object.freeze(activationTaskIds),
+            terminalTaskId
+        }));
+    }
+    return scopes;
+}
+function record(value, fieldName, allowedKeys) {
+    if (!isTaskGraphRecord(value)) {
+        throw new TypeError(`${fieldName} must be an object`);
+    }
+    for (const key of Object.keys(value)) {
+        if (!allowedKeys.includes(key)) {
+            throw new TypeError(`${fieldName} has unknown property: ${key}`);
+        }
+    }
+    return value;
+}
+function isTaskGraphRecord(value) {
+    return value !== null && typeof value === "object" && !Array.isArray(value);
+}
+function nonEmptyString(value, fieldName) {
+    if (typeof value !== "string" || value.trim().length === 0) {
+        throw new TypeError(`${fieldName} must be a non-empty string`);
+    }
+    return value;
+}
+function optionalNonEmptyString(value, fieldName) {
+    return value === undefined ? undefined : nonEmptyString(value, fieldName);
+}
+function stringList(value, fieldName) {
+    if (value === undefined) {
+        return [];
+    }
+    if (!Array.isArray(value)) {
+        throw new TypeError(`${fieldName} must be an array of non-empty strings`);
+    }
+    return value.map((item, index) => nonEmptyString(item, `${fieldName}[${index}]`));
+}
+function requiredStringList(value, fieldName) {
+    if (value === undefined) {
+        throw new TypeError(`${fieldName} must be an array of non-empty strings`);
+    }
+    return stringList(value, fieldName);
+}
+function positiveSafeInteger(value, fieldName) {
+    if (typeof value !== "number" || !Number.isSafeInteger(value) || value <= 0) {
+        throw new TypeError(`${fieldName} must be a positive safe integer`);
+    }
+    return value;
+}
+//# sourceMappingURL=graph.mjs.map

package/dist/esm/project-run/task-scheduler/graph.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.mjs","sourceRoot":"","sources":["../../../../src/project-run/task-scheduler/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,yBAAyB,EAAE,MAAM,uBAAuB,CAAC;AA6ClE,MAAM,eAAe,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAU,CAAC;AACrD,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,SAAS,CAAU,CAAC;AACxE,MAAM,eAAe,GAAG,CAAC,IAAI,EAAE,aAAa,EAAE,mBAAmB,EAAE,gBAAgB,CAAU,CAAC;AAE9F,0FAA0F;AAC1F,MAAM,UAAU,iBAAiB,CAAC,KAAc;IAC9C,gBAAgB,CAAC,KAAK,CAAC,CAAC;AAC1B,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,KAAc,EAAE,eAAwB;IACvE,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,YAAY,EAAE,eAAe,CAAC,CAAC;IAC1D,MAAM,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC;IACxE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAU,CAAC,CAAC,CAAC;IAE7E,yBAAyB,CAAC,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IAEnF,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;QAC3B,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC;KAC9B,CAAC,CAAC;AACL,CAAC;AAED,SAAS,cAAc,CAAC,KAAc;IACpC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,SAAS,CAAC,mCAAmC,CAAC,CAAC;IAC3D,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,MAAM,KAAK,GAAkB,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,EAAE,oBAAoB,KAAK,GAAG,EAAE,cAAc,CAAC,CAAC;QAC7E,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,oBAAoB,KAAK,MAAM,CAAC,CAAC;QACpE,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAChB,MAAM,IAAI,SAAS,CAAC,sBAAsB,EAAE,EAAE,CAAC,CAAC;QAClD,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACZ,MAAM,OAAO,GAAG,sBAAsB,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC3E,KAAK,CAAC,IAAI,CACR,MAAM,CAAC,MAAM,CAAC;YACZ,EAAE;YACF,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;YAC5E,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAChE,OAAO;SACR,CAAC,CACH,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,eAAe,CAAC,KAAc;IACrC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,SAAS,CAAC,oCAAoC,CAAC,CAAC;IAC5D,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,MAAM,MAAM,GAAuB,EAAE,CAAC;IACtC,KAAK,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,EAAE,qBAAqB,KAAK,GAAG,EAAE,eAAe,CAAC,CAAC;QAC/E,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,qBAAqB,KAAK,MAAM,CAAC,CAAC;QACrE,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAChB,MAAM,IAAI,SAAS,CAAC,4BAA4B,EAAE,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACZ,MAAM,WAAW,GAAG,mBAAmB,CAAC,IAAI,CAAC,WAAW,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;QAC1F,MAAM,iBAAiB,GAAG,kBAAkB,CAC1C,IAAI,CAAC,iBAAiB,EACtB,cAAc,EAAE,oBAAoB,CACrC,CAAC;QACF,MAAM,cAAc,GAAG,cAAc,CAAC,IAAI,CAAC,cAAc,EAAE,cAAc,EAAE,iBAAiB,CAAC,CAAC;QAC9F,MAAM,CAAC,IAAI,CACT,MAAM,CAAC,MAAM,CAAC;YACZ,EAAE;YACF,WAAW;YACX,iBAAiB,EAAE,MAAM,CAAC,MAAM,CAAC,iBAAiB,CAAC;YACnD,cAAc;SACf,CAAC,CACH,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,MAAM,CACb,KAAc,EACd,SAAiB,EACjB,WAA8B;IAE9B,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,SAAS,CAAC,GAAG,SAAS,oBAAoB,CAAC,CAAC;IACxD,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACrC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,SAAS,CAAC,GAAG,SAAS,0BAA0B,GAAG,EAAE,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAc;IACvC,OAAO,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9E,CAAC;AAED,SAAS,cAAc,CAAC,KAAc,EAAE,SAAiB;IACvD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3D,MAAM,IAAI,SAAS,CAAC,GAAG,SAAS,6BAA6B,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,sBAAsB,CAAC,KAAc,EAAE,SAAiB;IAC/D,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;AAC5E,CAAC;AAED,SAAS,UAAU,CAAC,KAAc,EAAE,SAAiB;IACnD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,SAAS,CAAC,GAAG,SAAS,wCAAwC,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,SAAS,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;AACpF,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAc,EAAE,SAAiB;IAC3D,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,MAAM,IAAI,SAAS,CAAC,GAAG,SAAS,wCAAwC,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,mBAAmB,CAAC,KAAc,EAAE,SAAiB;IAC5D,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QAC5E,MAAM,IAAI,SAAS,CAAC,GAAG,SAAS,kCAAkC,CAAC,CAAC;IACtE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["import { validatePreparedTaskGraph } from \"./graph-validation.ts\";\n\nexport interface TaskNode {\n  readonly id: string;\n  readonly dependsOn?: readonly string[];\n  readonly mutex?: readonly string[];\n  readonly scopeId?: string;\n}\n\n/**\n * A scheduling scope is intentionally product-agnostic. Product adapters may\n * use its opaque id to bind local Check semantics, but the engine only uses\n * membership, a cap, activation candidates, and the terminal relation.\n */\nexport interface TaskScope {\n  readonly id: string;\n  readonly maxParallel: number;\n  readonly activationTaskIds: readonly string[];\n  readonly terminalTaskId: string;\n}\n\nexport interface TaskGraph {\n  readonly tasks: readonly TaskNode[];\n  readonly scopes?: readonly TaskScope[];\n}\n\nexport interface PlannedTask {\n  readonly id: string;\n  readonly dependsOn: readonly string[];\n  readonly mutex: readonly string[];\n  readonly scopeId: string | undefined;\n}\n\nexport interface PlannedTaskScope {\n  readonly id: string;\n  readonly maxParallel: number;\n  readonly activationTaskIds: readonly string[];\n  readonly terminalTaskId: string;\n}\n\nexport interface PlannedTaskGraph {\n  readonly tasks: readonly PlannedTask[];\n  readonly scopes: readonly PlannedTaskScope[];\n}\n\nconst TASK_GRAPH_KEYS = [\"tasks\", \"scopes\"] as const;\nconst TASK_NODE_KEYS = [\"id\", \"dependsOn\", \"mutex\", \"scopeId\"] as const;\nconst TASK_SCOPE_KEYS = [\"id\", \"maxParallel\", \"activationTaskIds\", \"terminalTaskId\"] as const;\n\n/** Validates untrusted graph-shaped input without admitting it to scheduler execution. */\nexport function validateTaskGraph(graph: unknown): void {\n  prepareTaskGraph(graph);\n}\n\nexport function prepareTaskGraph(graph: unknown, rootMaxParallel?: number): PlannedTaskGraph {\n  const data = record(graph, \"task graph\", TASK_GRAPH_KEYS);\n  const tasks = normalizeTasks(data.tasks);\n  const scopes = normalizeScopes(data.scopes);\n  const taskById = new Map(tasks.map((task) => [task.id, task] as const));\n  const scopeById = new Map(scopes.map((scope) => [scope.id, scope] as const));\n\n  validatePreparedTaskGraph({ rootMaxParallel, scopeById, scopes, taskById, tasks });\n\n  return Object.freeze({\n    tasks: Object.freeze(tasks),\n    scopes: Object.freeze(scopes)\n  });\n}\n\nfunction normalizeTasks(value: unknown): PlannedTask[] {\n  if (!Array.isArray(value)) {\n    throw new TypeError(\"task graph tasks must be an array\");\n  }\n\n  const ids = new Set<string>();\n  const tasks: PlannedTask[] = [];\n  for (const [index, candidate] of value.entries()) {\n    const data = record(candidate, `task graph tasks[${index}]`, TASK_NODE_KEYS);\n    const id = nonEmptyString(data.id, `task graph tasks[${index}].id`);\n    if (ids.has(id)) {\n      throw new TypeError(`duplicate task id: ${id}`);\n    }\n    ids.add(id);\n    const scopeId = optionalNonEmptyString(data.scopeId, `task ${id}.scopeId`);\n    tasks.push(\n      Object.freeze({\n        id,\n        dependsOn: Object.freeze(stringList(data.dependsOn, `task ${id}.dependsOn`)),\n        mutex: Object.freeze(stringList(data.mutex, `task ${id}.mutex`)),\n        scopeId\n      })\n    );\n  }\n  return tasks;\n}\n\nfunction normalizeScopes(value: unknown): PlannedTaskScope[] {\n  if (value === undefined) {\n    return [];\n  }\n  if (!Array.isArray(value)) {\n    throw new TypeError(\"task graph scopes must be an array\");\n  }\n\n  const ids = new Set<string>();\n  const scopes: PlannedTaskScope[] = [];\n  for (const [index, candidate] of value.entries()) {\n    const data = record(candidate, `task graph scopes[${index}]`, TASK_SCOPE_KEYS);\n    const id = nonEmptyString(data.id, `task graph scopes[${index}].id`);\n    if (ids.has(id)) {\n      throw new TypeError(`duplicate task scope id: ${id}`);\n    }\n    ids.add(id);\n    const maxParallel = positiveSafeInteger(data.maxParallel, `task scope ${id}.maxParallel`);\n    const activationTaskIds = requiredStringList(\n      data.activationTaskIds,\n      `task scope ${id}.activationTaskIds`\n    );\n    const terminalTaskId = nonEmptyString(data.terminalTaskId, `task scope ${id}.terminalTaskId`);\n    scopes.push(\n      Object.freeze({\n        id,\n        maxParallel,\n        activationTaskIds: Object.freeze(activationTaskIds),\n        terminalTaskId\n      })\n    );\n  }\n  return scopes;\n}\n\nfunction record(\n  value: unknown,\n  fieldName: string,\n  allowedKeys: readonly string[]\n): Readonly<Record<string, unknown>> {\n  if (!isTaskGraphRecord(value)) {\n    throw new TypeError(`${fieldName} must be an object`);\n  }\n  for (const key of Object.keys(value)) {\n    if (!allowedKeys.includes(key)) {\n      throw new TypeError(`${fieldName} has unknown property: ${key}`);\n    }\n  }\n  return value;\n}\n\nfunction isTaskGraphRecord(value: unknown): value is Record<string, unknown> {\n  return value !== null && typeof value === \"object\" && !Array.isArray(value);\n}\n\nfunction nonEmptyString(value: unknown, fieldName: string): string {\n  if (typeof value !== \"string\" || value.trim().length === 0) {\n    throw new TypeError(`${fieldName} must be a non-empty string`);\n  }\n  return value;\n}\n\nfunction optionalNonEmptyString(value: unknown, fieldName: string): string | undefined {\n  return value === undefined ? undefined : nonEmptyString(value, fieldName);\n}\n\nfunction stringList(value: unknown, fieldName: string): string[] {\n  if (value === undefined) {\n    return [];\n  }\n  if (!Array.isArray(value)) {\n    throw new TypeError(`${fieldName} must be an array of non-empty strings`);\n  }\n  return value.map((item, index) => nonEmptyString(item, `${fieldName}[${index}]`));\n}\n\nfunction requiredStringList(value: unknown, fieldName: string): string[] {\n  if (value === undefined) {\n    throw new TypeError(`${fieldName} must be an array of non-empty strings`);\n  }\n  return stringList(value, fieldName);\n}\n\nfunction positiveSafeInteger(value: unknown, fieldName: string): number {\n  if (typeof value !== \"number\" || !Number.isSafeInteger(value) || value <= 0) {\n    throw new TypeError(`${fieldName} must be a positive safe integer`);\n  }\n  return value;\n}\n"]}

package/dist/esm/project-run/task-scheduler/scheduler-admission-decision.mjs

@@ -0,0 +1,82 @@
+import { activationScopeFor, canAdmit, capacityWaitReason, isDependencyMutexEligible, selectConstrainedContinuation, selectTighteningTask } from "./scheduler-decision-inspection.mjs";
+import { freezeDecision, reservationClear, reservationSet, reservationUnchanged } from "./scheduler-decision-model.mjs";
+export function decideAdmission(cycle) {
+    const eligibleTasks = cycle.state.pendingTasks.filter((task) => isDependencyMutexEligible(task, cycle.state));
+    if (eligibleTasks.length === 0) {
+        return awaitDecision(cycle, {
+            eligibleTasks,
+            reason: "dependency-or-mutex",
+            reservationUpdate: reservationUnchanged()
+        });
+    }
+    const reservedTask = taskById(cycle.state.reservationTaskId, eligibleTasks);
+    if (reservedTask !== undefined)
+        return decideReservedAdmission(cycle, eligibleTasks, reservedTask);
+    return decideUnreservedAdmission(cycle, eligibleTasks);
+}
+function decideReservedAdmission(cycle, eligibleTasks, reservedTask) {
+    const selection = {
+        reason: "reservation",
+        reservationUpdate: reservationClear(),
+        task: reservedTask
+    };
+    if (canAdmit(cycle.state, reservedTask))
+        return admitDecision(cycle, selection, eligibleTasks);
+    return awaitDecision(cycle, {
+        eligibleTasks,
+        reason: "reserved-tightening-scope",
+        reservationUpdate: reservationUnchanged()
+    });
+}
+function decideUnreservedAdmission(cycle, eligibleTasks) {
+    const reservationUpdate = staleReservationUpdate(cycle.state);
+    const tighteningTask = selectTighteningTask(cycle.state, eligibleTasks, cycle.context.capacity.effectiveMaxParallel);
+    if (tighteningTask !== undefined) {
+        return admissionOrCapacityWait(cycle, eligibleTasks, { reason: "tightening-scope", reservationUpdate, task: tighteningTask }, "reserved-tightening-scope");
+    }
+    const continuation = selectConstrainedContinuation(cycle.state, eligibleTasks, cycle.context.capacity.effectiveMaxParallel);
+    if (continuation !== undefined) {
+        return admissionOrCapacityWait(cycle, eligibleTasks, { reason: "constrained-continuation", reservationUpdate, task: continuation }, capacityWaitReason(cycle.state));
+    }
+    return admissionOrCapacityWait(cycle, eligibleTasks, { reason: "canonical-order", reservationUpdate, task: eligibleTasks[0] }, capacityWaitReason(cycle.state));
+}
+function admissionOrCapacityWait(cycle, eligibleTasks, selection, waitReason) {
+    if (canAdmit(cycle.state, selection.task))
+        return admitDecision(cycle, selection, eligibleTasks);
+    const reservationUpdate = selection.reason === "tightening-scope"
+        ? reservationSet(selection.task.id)
+        : selection.reservationUpdate;
+    return awaitDecision(cycle, { eligibleTasks, reason: waitReason, reservationUpdate });
+}
+function admitDecision(cycle, selection, eligibleTasks) {
+    return freezeDecision({
+        ...cycle.context,
+        eligibleCount: eligibleTasks.length,
+        kind: "admit",
+        reason: selection.reason,
+        reservationUpdate: selection.reservationUpdate,
+        scopeToActivate: activationScopeFor(cycle.state, selection.task)?.id ?? null,
+        taskId: selection.task.id,
+        trigger: cycle.trigger
+    });
+}
+function awaitDecision(cycle, waiting) {
+    if (cycle.state.runningTaskIds.size === 0) {
+        throw new Error("scheduler has pending tasks but no runnable or running task");
+    }
+    return freezeDecision({
+        ...cycle.context,
+        eligibleCount: waiting.eligibleTasks.length,
+        kind: "await-running",
+        reason: waiting.reason,
+        reservationUpdate: waiting.reservationUpdate,
+        trigger: cycle.trigger
+    });
+}
+function staleReservationUpdate(state) {
+    return state.reservationTaskId === undefined ? reservationUnchanged() : reservationClear();
+}
+function taskById(taskId, tasks) {
+    return taskId === undefined ? undefined : tasks.find((task) => task.id === taskId);
+}
+//# sourceMappingURL=scheduler-admission-decision.mjs.map

package/dist/esm/project-run/task-scheduler/scheduler-admission-decision.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler-admission-decision.mjs","sourceRoot":"","sources":["../../../../src/project-run/task-scheduler/scheduler-admission-decision.ts"],"names":[],"mappings":"AACA,OAAO,EACL,kBAAkB,EAClB,QAAQ,EACR,kBAAkB,EAClB,yBAAyB,EACzB,6BAA6B,EAC7B,oBAAoB,EAErB,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EACL,cAAc,EACd,gBAAgB,EAChB,cAAc,EACd,oBAAoB,EAOrB,MAAM,+BAA+B,CAAC;AAoBvC,MAAM,UAAU,eAAe,CAAC,KAA6B;IAC3D,MAAM,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAC7D,yBAAyB,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAC7C,CAAC;IACF,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,aAAa,CAAC,KAAK,EAAE;YAC1B,aAAa;YACb,MAAM,EAAE,qBAAqB;YAC7B,iBAAiB,EAAE,oBAAoB,EAAE;SAC1C,CAAC,CAAC;IACL,CAAC;IAED,MAAM,YAAY,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,iBAAiB,EAAE,aAAa,CAAC,CAAC;IAC5E,IAAI,YAAY,KAAK,SAAS;QAC5B,OAAO,uBAAuB,CAAC,KAAK,EAAE,aAAa,EAAE,YAAY,CAAC,CAAC;IAErE,OAAO,yBAAyB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;AACzD,CAAC;AAED,SAAS,uBAAuB,CAC9B,KAA6B,EAC7B,aAAqC,EACrC,YAAyB;IAEzB,MAAM,SAAS,GAAuB;QACpC,MAAM,EAAE,aAAa;QACrB,iBAAiB,EAAE,gBAAgB,EAAE;QACrC,IAAI,EAAE,YAAY;KACnB,CAAC;IACF,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,CAAC;QAAE,OAAO,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IAC/F,OAAO,aAAa,CAAC,KAAK,EAAE;QAC1B,aAAa;QACb,MAAM,EAAE,2BAA2B;QACnC,iBAAiB,EAAE,oBAAoB,EAAE;KAC1C,CAAC,CAAC;AACL,CAAC;AAED,SAAS,yBAAyB,CAChC,KAA6B,EAC7B,aAAqC;IAErC,MAAM,iBAAiB,GAAG,sBAAsB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC9D,MAAM,cAAc,GAAG,oBAAoB,CACzC,KAAK,CAAC,KAAK,EACX,aAAa,EACb,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAC5C,CAAC;IACF,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;QACjC,OAAO,uBAAuB,CAC5B,KAAK,EACL,aAAa,EACb,EAAE,MAAM,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,IAAI,EAAE,cAAc,EAAE,EACvE,2BAA2B,CAC5B,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,6BAA6B,CAChD,KAAK,CAAC,KAAK,EACX,aAAa,EACb,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAC5C,CAAC;IACF,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;QAC/B,OAAO,uBAAuB,CAC5B,KAAK,EACL,aAAa,EACb,EAAE,MAAM,EAAE,0BAA0B,EAAE,iBAAiB,EAAE,IAAI,EAAE,YAAY,EAAE,EAC7E,kBAAkB,CAAC,KAAK,CAAC,KAAK,CAAC,CAChC,CAAC;IACJ,CAAC;IAED,OAAO,uBAAuB,CAC5B,KAAK,EACL,aAAa,EACb,EAAE,MAAM,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EACxE,kBAAkB,CAAC,KAAK,CAAC,KAAK,CAAC,CAChC,CAAC;AACJ,CAAC;AAED,SAAS,uBAAuB,CAC9B,KAA6B,EAC7B,aAAqC,EACrC,SAA6B,EAC7B,UAAgC;IAEhC,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC;QAAE,OAAO,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IACjG,MAAM,iBAAiB,GACrB,SAAS,CAAC,MAAM,KAAK,kBAAkB;QACrC,CAAC,CAAC,cAAc,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,CAAC,CAAC,SAAS,CAAC,iBAAiB,CAAC;IAClC,OAAO,aAAa,CAAC,KAAK,EAAE,EAAE,aAAa,EAAE,MAAM,EAAE,UAAU,EAAE,iBAAiB,EAAE,CAAC,CAAC;AACxF,CAAC;AAED,SAAS,aAAa,CACpB,KAA6B,EAC7B,SAA6B,EAC7B,aAAqC;IAErC,OAAO,cAAc,CAAC;QACpB,GAAG,KAAK,CAAC,OAAO;QAChB,aAAa,EAAE,aAAa,CAAC,MAAM;QACnC,IAAI,EAAE,OAAO;QACb,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,iBAAiB,EAAE,SAAS,CAAC,iBAAiB;QAC9C,eAAe,EAAE,kBAAkB,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,IAAI;QAC5E,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE;QACzB,OAAO,EAAE,KAAK,CAAC,OAAO;KACvB,CAAC,CAAC;AACL,CAAC;AAED,SAAS,aAAa,CACpB,KAA6B,EAC7B,OAAkC;IAElC,IAAI,KAAK,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;IACjF,CAAC;IACD,OAAO,cAAc,CAAC;QACpB,GAAG,KAAK,CAAC,OAAO;QAChB,aAAa,EAAE,OAAO,CAAC,aAAa,CAAC,MAAM;QAC3C,IAAI,EAAE,eAAe;QACrB,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,iBAAiB,EAAE,OAAO,CAAC,iBAAiB;QAC5C,OAAO,EAAE,KAAK,CAAC,OAAO;KACvB,CAAC,CAAC;AACL,CAAC;AAED,SAAS,sBAAsB,CAAC,KAA0B;IACxD,OAAO,KAAK,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC,gBAAgB,EAAE,CAAC;AAC7F,CAAC;AAED,SAAS,QAAQ,CACf,MAA0B,EAC1B,KAA6B;IAE7B,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;AACrF,CAAC","sourcesContent":["import type { PlannedTask } from \"./graph.ts\";\nimport {\n  activationScopeFor,\n  canAdmit,\n  capacityWaitReason,\n  isDependencyMutexEligible,\n  selectConstrainedContinuation,\n  selectTighteningTask,\n  type SchedulerInspection\n} from \"./scheduler-decision-inspection.ts\";\nimport {\n  freezeDecision,\n  reservationClear,\n  reservationSet,\n  reservationUnchanged,\n  type ReservationUpdate,\n  type SchedulerAdmissionReason,\n  type SchedulerAwaitReason,\n  type SchedulerDecision,\n  type SchedulerDecisionContext,\n  type SchedulerTrigger\n} from \"./scheduler-decision-model.ts\";\n\nexport interface SchedulerDecisionCycle {\n  readonly context: SchedulerDecisionContext;\n  readonly state: SchedulerInspection;\n  readonly trigger: SchedulerTrigger;\n}\n\ninterface AdmissionSelection {\n  readonly reason: SchedulerAdmissionReason;\n  readonly reservationUpdate: ReservationUpdate;\n  readonly task: PlannedTask;\n}\n\ninterface AwaitingSchedulerDecision {\n  readonly eligibleTasks: readonly PlannedTask[];\n  readonly reason: SchedulerAwaitReason;\n  readonly reservationUpdate: ReservationUpdate;\n}\n\nexport function decideAdmission(cycle: SchedulerDecisionCycle): SchedulerDecision {\n  const eligibleTasks = cycle.state.pendingTasks.filter((task) =>\n    isDependencyMutexEligible(task, cycle.state)\n  );\n  if (eligibleTasks.length === 0) {\n    return awaitDecision(cycle, {\n      eligibleTasks,\n      reason: \"dependency-or-mutex\",\n      reservationUpdate: reservationUnchanged()\n    });\n  }\n\n  const reservedTask = taskById(cycle.state.reservationTaskId, eligibleTasks);\n  if (reservedTask !== undefined)\n    return decideReservedAdmission(cycle, eligibleTasks, reservedTask);\n\n  return decideUnreservedAdmission(cycle, eligibleTasks);\n}\n\nfunction decideReservedAdmission(\n  cycle: SchedulerDecisionCycle,\n  eligibleTasks: readonly PlannedTask[],\n  reservedTask: PlannedTask\n): SchedulerDecision {\n  const selection: AdmissionSelection = {\n    reason: \"reservation\",\n    reservationUpdate: reservationClear(),\n    task: reservedTask\n  };\n  if (canAdmit(cycle.state, reservedTask)) return admitDecision(cycle, selection, eligibleTasks);\n  return awaitDecision(cycle, {\n    eligibleTasks,\n    reason: \"reserved-tightening-scope\",\n    reservationUpdate: reservationUnchanged()\n  });\n}\n\nfunction decideUnreservedAdmission(\n  cycle: SchedulerDecisionCycle,\n  eligibleTasks: readonly PlannedTask[]\n): SchedulerDecision {\n  const reservationUpdate = staleReservationUpdate(cycle.state);\n  const tighteningTask = selectTighteningTask(\n    cycle.state,\n    eligibleTasks,\n    cycle.context.capacity.effectiveMaxParallel\n  );\n  if (tighteningTask !== undefined) {\n    return admissionOrCapacityWait(\n      cycle,\n      eligibleTasks,\n      { reason: \"tightening-scope\", reservationUpdate, task: tighteningTask },\n      \"reserved-tightening-scope\"\n    );\n  }\n\n  const continuation = selectConstrainedContinuation(\n    cycle.state,\n    eligibleTasks,\n    cycle.context.capacity.effectiveMaxParallel\n  );\n  if (continuation !== undefined) {\n    return admissionOrCapacityWait(\n      cycle,\n      eligibleTasks,\n      { reason: \"constrained-continuation\", reservationUpdate, task: continuation },\n      capacityWaitReason(cycle.state)\n    );\n  }\n\n  return admissionOrCapacityWait(\n    cycle,\n    eligibleTasks,\n    { reason: \"canonical-order\", reservationUpdate, task: eligibleTasks[0] },\n    capacityWaitReason(cycle.state)\n  );\n}\n\nfunction admissionOrCapacityWait(\n  cycle: SchedulerDecisionCycle,\n  eligibleTasks: readonly PlannedTask[],\n  selection: AdmissionSelection,\n  waitReason: SchedulerAwaitReason\n): SchedulerDecision {\n  if (canAdmit(cycle.state, selection.task)) return admitDecision(cycle, selection, eligibleTasks);\n  const reservationUpdate =\n    selection.reason === \"tightening-scope\"\n      ? reservationSet(selection.task.id)\n      : selection.reservationUpdate;\n  return awaitDecision(cycle, { eligibleTasks, reason: waitReason, reservationUpdate });\n}\n\nfunction admitDecision(\n  cycle: SchedulerDecisionCycle,\n  selection: AdmissionSelection,\n  eligibleTasks: readonly PlannedTask[]\n): SchedulerDecision {\n  return freezeDecision({\n    ...cycle.context,\n    eligibleCount: eligibleTasks.length,\n    kind: \"admit\",\n    reason: selection.reason,\n    reservationUpdate: selection.reservationUpdate,\n    scopeToActivate: activationScopeFor(cycle.state, selection.task)?.id ?? null,\n    taskId: selection.task.id,\n    trigger: cycle.trigger\n  });\n}\n\nfunction awaitDecision(\n  cycle: SchedulerDecisionCycle,\n  waiting: AwaitingSchedulerDecision\n): SchedulerDecision {\n  if (cycle.state.runningTaskIds.size === 0) {\n    throw new Error(\"scheduler has pending tasks but no runnable or running task\");\n  }\n  return freezeDecision({\n    ...cycle.context,\n    eligibleCount: waiting.eligibleTasks.length,\n    kind: \"await-running\",\n    reason: waiting.reason,\n    reservationUpdate: waiting.reservationUpdate,\n    trigger: cycle.trigger\n  });\n}\n\nfunction staleReservationUpdate(state: SchedulerInspection): ReservationUpdate {\n  return state.reservationTaskId === undefined ? reservationUnchanged() : reservationClear();\n}\n\nfunction taskById(\n  taskId: string | undefined,\n  tasks: readonly PlannedTask[]\n): PlannedTask | undefined {\n  return taskId === undefined ? undefined : tasks.find((task) => task.id === taskId);\n}\n"]}

package/dist/esm/project-run/task-scheduler/scheduler-blocker-summary.mjs

@@ -0,0 +1,27 @@
+/** Summarizes why pending Tasks cannot currently advance. */
+export function summarizeSchedulerBlockers(state, capacity) {
+    let dependency = 0;
+    let mutex = 0;
+    for (const task of state.pendingTasks) {
+        if (hasUncompletedDependency(task.dependsOn, state.settlementKindByTaskId)) {
+            dependency += 1;
+            continue;
+        }
+        if (hasRunningMutex(task.mutex, state.runningMutexes))
+            mutex += 1;
+    }
+    return Object.freeze({
+        dependency,
+        mutex,
+        rootCapacity: state.runningTaskIds.size >= state.maxParallel,
+        scopeCapacity: capacity.effectiveMaxParallel < state.maxParallel &&
+            state.runningTaskIds.size >= capacity.effectiveMaxParallel
+    });
+}
+function hasUncompletedDependency(dependencyIds, settlementKindByTaskId) {
+    return dependencyIds.some((dependencyId) => settlementKindByTaskId.get(dependencyId) !== "completed");
+}
+function hasRunningMutex(mutexNames, runningMutexes) {
+    return mutexNames.some((mutexName) => runningMutexes.has(mutexName));
+}
+//# sourceMappingURL=scheduler-blocker-summary.mjs.map

package/dist/esm/project-run/task-scheduler/scheduler-blocker-summary.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler-blocker-summary.mjs","sourceRoot":"","sources":["../../../../src/project-run/task-scheduler/scheduler-blocker-summary.ts"],"names":[],"mappings":"AAGA,6DAA6D;AAC7D,MAAM,UAAU,0BAA0B,CACxC,KAA0B,EAC1B,QAA2B;IAE3B,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QACtC,IAAI,wBAAwB,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,sBAAsB,CAAC,EAAE,CAAC;YAC3E,UAAU,IAAI,CAAC,CAAC;YAChB,SAAS;QACX,CAAC;QACD,IAAI,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,cAAc,CAAC;YAAE,KAAK,IAAI,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,UAAU;QACV,KAAK;QACL,YAAY,EAAE,KAAK,CAAC,cAAc,CAAC,IAAI,IAAI,KAAK,CAAC,WAAW;QAC5D,aAAa,EACX,QAAQ,CAAC,oBAAoB,GAAG,KAAK,CAAC,WAAW;YACjD,KAAK,CAAC,cAAc,CAAC,IAAI,IAAI,QAAQ,CAAC,oBAAoB;KAC7D,CAAC,CAAC;AACL,CAAC;AAED,SAAS,wBAAwB,CAC/B,aAAgC,EAChC,sBAAqE;IAErE,OAAO,aAAa,CAAC,IAAI,CACvB,CAAC,YAAY,EAAE,EAAE,CAAC,sBAAsB,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,WAAW,CAC3E,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CACtB,UAA6B,EAC7B,cAAqD;IAErD,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;AACvE,CAAC","sourcesContent":["import type { SchedulerInspection } from \"./scheduler-decision-inspection.ts\";\nimport type { SchedulerBlockerSummary, SchedulerCapacity } from \"./scheduler-decision-model.ts\";\n\n/** Summarizes why pending Tasks cannot currently advance. */\nexport function summarizeSchedulerBlockers(\n  state: SchedulerInspection,\n  capacity: SchedulerCapacity\n): SchedulerBlockerSummary {\n  let dependency = 0;\n  let mutex = 0;\n  for (const task of state.pendingTasks) {\n    if (hasUncompletedDependency(task.dependsOn, state.settlementKindByTaskId)) {\n      dependency += 1;\n      continue;\n    }\n    if (hasRunningMutex(task.mutex, state.runningMutexes)) mutex += 1;\n  }\n  return Object.freeze({\n    dependency,\n    mutex,\n    rootCapacity: state.runningTaskIds.size >= state.maxParallel,\n    scopeCapacity:\n      capacity.effectiveMaxParallel < state.maxParallel &&\n      state.runningTaskIds.size >= capacity.effectiveMaxParallel\n  });\n}\n\nfunction hasUncompletedDependency(\n  dependencyIds: readonly string[],\n  settlementKindByTaskId: SchedulerInspection[\"settlementKindByTaskId\"]\n): boolean {\n  return dependencyIds.some(\n    (dependencyId) => settlementKindByTaskId.get(dependencyId) !== \"completed\"\n  );\n}\n\nfunction hasRunningMutex(\n  mutexNames: readonly string[],\n  runningMutexes: SchedulerInspection[\"runningMutexes\"]\n): boolean {\n  return mutexNames.some((mutexName) => runningMutexes.has(mutexName));\n}\n"]}

package/dist/esm/project-run/task-scheduler/scheduler-decision-inspection.mjs

@@ -0,0 +1,125 @@
+import { summarizeSchedulerBlockers } from "./scheduler-blocker-summary.mjs";
+export function inspectSnapshot(snapshot) {
+    const tasksById = new Map(snapshot.graph.tasks.map((task) => [task.id, task]));
+    const pendingTasks = snapshot.pendingTaskIds.map((taskId) => pendingTaskFor(taskId, tasksById));
+    return Object.freeze({
+        activeScopeIds: new Set(snapshot.activeScopeIds),
+        graph: snapshot.graph,
+        maxParallel: snapshot.maxParallel,
+        pendingTasks: Object.freeze(pendingTasks),
+        reservationTaskId: snapshot.reservationTaskId,
+        runningMutexes: new Set(snapshot.runningMutexes),
+        runningTaskIds: new Set(snapshot.runningTaskIds),
+        settlementKindByTaskId: new Map(snapshot.settledTasks.map(({ taskId, kind }) => [taskId, kind]))
+    });
+}
+export function decisionContext(state) {
+    const capacity = capacityFor(state);
+    return Object.freeze({
+        blockers: summarizeSchedulerBlockers(state, capacity),
+        capacity,
+        reservation: Object.freeze({ taskId: state.reservationTaskId ?? null })
+    });
+}
+export function selectBlockedTask(state) {
+    for (let index = state.pendingTasks.length - 1; index >= 0; index -= 1) {
+        const task = state.pendingTasks[index];
+        const dependencyIds = blockingDependencyIds(task, state.settlementKindByTaskId);
+        if (dependencyIds !== undefined)
+            return Object.freeze({ dependencyIds: Object.freeze(dependencyIds), task });
+    }
+    return undefined;
+}
+export function isDependencyMutexEligible(task, state) {
+    return (task.dependsOn.every((dependencyId) => state.settlementKindByTaskId.get(dependencyId) === "completed") && task.mutex.every((mutex) => !state.runningMutexes.has(mutex)));
+}
+export function capacityWaitReason(state) {
+    return state.runningTaskIds.size >= state.maxParallel ? "root-capacity" : "active-scope-capacity";
+}
+export function canAdmit(state, task) {
+    return state.runningTaskIds.size < prospectiveMaxParallel(state, task);
+}
+export function activationScopeFor(state, task) {
+    const scope = scopeForTask(state, task);
+    return scope?.activationTaskIds.includes(task.id) === true && !state.activeScopeIds.has(scope.id)
+        ? scope
+        : undefined;
+}
+export function selectTighteningTask(state, eligibleTasks, effectiveMaxParallel) {
+    return eligibleTasks
+        .filter((task) => activatesTighteningScope(state, task, effectiveMaxParallel))
+        .sort((left, right) => compareConstrainedTasks(state, left, right))[0];
+}
+export function selectConstrainedContinuation(state, eligibleTasks, effectiveMaxParallel) {
+    return eligibleTasks
+        .filter((task) => isConstrainedContinuation(state, task, effectiveMaxParallel))
+        .sort((left, right) => compareConstrainedTasks(state, left, right))[0];
+}
+function pendingTaskFor(taskId, tasksById) {
+    const task = tasksById.get(taskId);
+    if (task === undefined)
+        throw new Error(`scheduler snapshot has unknown pending task ${taskId}`);
+    return task;
+}
+function blockingDependencyIds(task, settlementKindByTaskId) {
+    const settlementKinds = task.dependsOn.map((dependencyId) => [dependencyId, settlementKindByTaskId.get(dependencyId)]);
+    if (settlementKinds.some(([, kind]) => kind === undefined))
+        return undefined;
+    const dependencyIds = settlementKinds.flatMap(([dependencyId, kind]) => kind === "completed" ? [] : [dependencyId]);
+    return dependencyIds.length === 0 ? undefined : dependencyIds;
+}
+function capacityFor(state) {
+    return Object.freeze({
+        effectiveMaxParallel: effectiveMaxParallelFor(state),
+        maxParallel: state.maxParallel,
+        running: state.runningTaskIds.size
+    });
+}
+function effectiveMaxParallelFor(state) {
+    let effective = state.maxParallel;
+    for (const scope of state.graph.scopes) {
+        if (state.activeScopeIds.has(scope.id))
+            effective = Math.min(effective, scope.maxParallel);
+    }
+    return effective;
+}
+function prospectiveMaxParallel(state, task) {
+    const scope = activationScopeFor(state, task);
+    return scope === undefined
+        ? effectiveMaxParallelFor(state)
+        : Math.min(effectiveMaxParallelFor(state), scope.maxParallel);
+}
+function activatesTighteningScope(state, task, effectiveMaxParallel) {
+    const scope = activationScopeFor(state, task);
+    return scope !== undefined && scope.maxParallel < effectiveMaxParallel;
+}
+function isConstrainedContinuation(state, task, effectiveMaxParallel) {
+    const scope = scopeForTask(state, task);
+    return (scope !== undefined &&
+        state.activeScopeIds.has(scope.id) &&
+        scope.maxParallel < state.maxParallel &&
+        scope.maxParallel === effectiveMaxParallel);
+}
+function compareConstrainedTasks(state, left, right) {
+    const leftScope = scopeForTask(state, left);
+    const rightScope = scopeForTask(state, right);
+    if (leftScope === undefined || rightScope === undefined) {
+        throw new Error("constrained task is missing a scope");
+    }
+    return (leftScope.maxParallel - rightScope.maxParallel ||
+        compareText(leftScope.id, rightScope.id) ||
+        compareText(left.id, right.id));
+}
+function compareText(left, right) {
+    if (left < right)
+        return -1;
+    if (left > right)
+        return 1;
+    return 0;
+}
+function scopeForTask(state, task) {
+    return task.scopeId === undefined
+        ? undefined
+        : state.graph.scopes.find((scope) => scope.id === task.scopeId);
+}
+//# sourceMappingURL=scheduler-decision-inspection.mjs.map

package/dist/esm/project-run/task-scheduler/scheduler-decision-inspection.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler-decision-inspection.mjs","sourceRoot":"","sources":["../../../../src/project-run/task-scheduler/scheduler-decision-inspection.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,0BAA0B,EAAE,MAAM,gCAAgC,CAAC;AAoB5E,MAAM,UAAU,eAAe,CAAC,QAA2B;IACzD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC;IACxF,MAAM,YAAY,GAAG,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;IAChG,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,cAAc,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC;QAChD,KAAK,EAAE,QAAQ,CAAC,KAAK;QACrB,WAAW,EAAE,QAAQ,CAAC,WAAW;QACjC,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC;QACzC,iBAAiB,EAAE,QAAQ,CAAC,iBAAiB;QAC7C,cAAc,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC;QAChD,cAAc,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC;QAChD,sBAAsB,EAAE,IAAI,GAAG,CAC7B,QAAQ,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,CAAU,CAAC,CACzE;KACF,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,KAA0B;IACxD,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACpC,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,QAAQ,EAAE,0BAA0B,CAAC,KAAK,EAAE,QAAQ,CAAC;QACrD,QAAQ;QACR,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,iBAAiB,IAAI,IAAI,EAAE,CAAC;KACxE,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,KAA0B;IAE1B,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACvE,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,aAAa,GAAG,qBAAqB,CAAC,IAAI,EAAE,KAAK,CAAC,sBAAsB,CAAC,CAAC;QAChF,IAAI,aAAa,KAAK,SAAS;YAC7B,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,aAAa,EAAE,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;IAChF,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,yBAAyB,CAAC,IAAiB,EAAE,KAA0B;IACrF,OAAO,CACL,IAAI,CAAC,SAAS,CAAC,KAAK,CAClB,CAAC,YAAY,EAAE,EAAE,CAAC,KAAK,CAAC,sBAAsB,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,WAAW,CACjF,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CACnE,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,KAA0B;IAC3D,OAAO,KAAK,CAAC,cAAc,CAAC,IAAI,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,uBAAuB,CAAC;AACpG,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,KAA0B,EAAE,IAAiB;IACpE,OAAO,KAAK,CAAC,cAAc,CAAC,IAAI,GAAG,sBAAsB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACzE,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,KAA0B,EAC1B,IAAiB;IAEjB,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACxC,OAAO,KAAK,EAAE,iBAAiB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/F,CAAC,CAAC,KAAK;QACP,CAAC,CAAC,SAAS,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,oBAAoB,CAClC,KAA0B,EAC1B,aAAqC,EACrC,oBAA4B;IAE5B,OAAO,aAAa;SACjB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,wBAAwB,CAAC,KAAK,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC;SAC7E,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,uBAAuB,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3E,CAAC;AAED,MAAM,UAAU,6BAA6B,CAC3C,KAA0B,EAC1B,aAAqC,EACrC,oBAA4B;IAE5B,OAAO,aAAa;SACjB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,yBAAyB,CAAC,KAAK,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC;SAC9E,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,uBAAuB,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3E,CAAC;AAED,SAAS,cAAc,CAAC,MAAc,EAAE,SAA2C;IACjF,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACnC,IAAI,IAAI,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,+CAA+C,MAAM,EAAE,CAAC,CAAC;IACjG,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,qBAAqB,CAC5B,IAAiB,EACjB,sBAAoE;IAEpE,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CACxC,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,YAAY,EAAE,sBAAsB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAU,CACpF,CAAC;IACF,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC;QAAE,OAAO,SAAS,CAAC;IAC7E,MAAM,aAAa,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,EAAE,EAAE,CACrE,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAC3C,CAAC;IACF,OAAO,aAAa,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC;AAChE,CAAC;AAED,SAAS,WAAW,CAAC,KAA0B;IAC7C,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,oBAAoB,EAAE,uBAAuB,CAAC,KAAK,CAAC;QACpD,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,OAAO,EAAE,KAAK,CAAC,cAAc,CAAC,IAAI;KACnC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,uBAAuB,CAAC,KAA0B;IACzD,IAAI,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACvC,IAAI,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAAE,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC;IAC7F,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,sBAAsB,CAAC,KAA0B,EAAE,IAAiB;IAC3E,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC9C,OAAO,KAAK,KAAK,SAAS;QACxB,CAAC,CAAC,uBAAuB,CAAC,KAAK,CAAC;QAChC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC;AAClE,CAAC;AAED,SAAS,wBAAwB,CAC/B,KAA0B,EAC1B,IAAiB,EACjB,oBAA4B;IAE5B,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC9C,OAAO,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,WAAW,GAAG,oBAAoB,CAAC;AACzE,CAAC;AAED,SAAS,yBAAyB,CAChC,KAA0B,EAC1B,IAAiB,EACjB,oBAA4B;IAE5B,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACxC,OAAO,CACL,KAAK,KAAK,SAAS;QACnB,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW;QACrC,KAAK,CAAC,WAAW,KAAK,oBAAoB,CAC3C,CAAC;AACJ,CAAC;AAED,SAAS,uBAAuB,CAC9B,KAA0B,EAC1B,IAAiB,EACjB,KAAkB;IAElB,MAAM,SAAS,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC5C,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC9C,IAAI,SAAS,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QACxD,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,CACL,SAAS,CAAC,WAAW,GAAG,UAAU,CAAC,WAAW;QAC9C,WAAW,CAAC,SAAS,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC;QACxC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAC/B,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAAC,IAAY,EAAE,KAAa;IAC9C,IAAI,IAAI,GAAG,KAAK;QAAE,OAAO,CAAC,CAAC,CAAC;IAC5B,IAAI,IAAI,GAAG,KAAK;QAAE,OAAO,CAAC,CAAC;IAC3B,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,YAAY,CAAC,KAA0B,EAAE,IAAiB;IACjE,OAAO,IAAI,CAAC,OAAO,KAAK,SAAS;QAC/B,CAAC,CAAC,SAAS;QACX,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC;AACpE,CAAC","sourcesContent":["import type { PlannedTask, PlannedTaskGraph, PlannedTaskScope } from \"./graph.ts\";\nimport { summarizeSchedulerBlockers } from \"./scheduler-blocker-summary.ts\";\nimport type {\n  SchedulerAwaitReason,\n  SchedulerCapacity,\n  SchedulerDecisionContext,\n  SchedulerSettlementKind,\n  SchedulerSnapshot\n} from \"./scheduler-decision-model.ts\";\n\nexport interface SchedulerInspection {\n  readonly activeScopeIds: ReadonlySet<string>;\n  readonly graph: PlannedTaskGraph;\n  readonly maxParallel: number;\n  readonly pendingTasks: readonly PlannedTask[];\n  readonly reservationTaskId: string | undefined;\n  readonly runningMutexes: ReadonlySet<string>;\n  readonly runningTaskIds: ReadonlySet<string>;\n  readonly settlementKindByTaskId: ReadonlyMap<string, SchedulerSettlementKind>;\n}\n\nexport function inspectSnapshot(snapshot: SchedulerSnapshot): SchedulerInspection {\n  const tasksById = new Map(snapshot.graph.tasks.map((task) => [task.id, task] as const));\n  const pendingTasks = snapshot.pendingTaskIds.map((taskId) => pendingTaskFor(taskId, tasksById));\n  return Object.freeze({\n    activeScopeIds: new Set(snapshot.activeScopeIds),\n    graph: snapshot.graph,\n    maxParallel: snapshot.maxParallel,\n    pendingTasks: Object.freeze(pendingTasks),\n    reservationTaskId: snapshot.reservationTaskId,\n    runningMutexes: new Set(snapshot.runningMutexes),\n    runningTaskIds: new Set(snapshot.runningTaskIds),\n    settlementKindByTaskId: new Map(\n      snapshot.settledTasks.map(({ taskId, kind }) => [taskId, kind] as const)\n    )\n  });\n}\n\nexport function decisionContext(state: SchedulerInspection): SchedulerDecisionContext {\n  const capacity = capacityFor(state);\n  return Object.freeze({\n    blockers: summarizeSchedulerBlockers(state, capacity),\n    capacity,\n    reservation: Object.freeze({ taskId: state.reservationTaskId ?? null })\n  });\n}\n\nexport function selectBlockedTask(\n  state: SchedulerInspection\n): Readonly<{ readonly dependencyIds: readonly string[]; readonly task: PlannedTask }> | undefined {\n  for (let index = state.pendingTasks.length - 1; index >= 0; index -= 1) {\n    const task = state.pendingTasks[index];\n    const dependencyIds = blockingDependencyIds(task, state.settlementKindByTaskId);\n    if (dependencyIds !== undefined)\n      return Object.freeze({ dependencyIds: Object.freeze(dependencyIds), task });\n  }\n  return undefined;\n}\n\nexport function isDependencyMutexEligible(task: PlannedTask, state: SchedulerInspection): boolean {\n  return (\n    task.dependsOn.every(\n      (dependencyId) => state.settlementKindByTaskId.get(dependencyId) === \"completed\"\n    ) && task.mutex.every((mutex) => !state.runningMutexes.has(mutex))\n  );\n}\n\nexport function capacityWaitReason(state: SchedulerInspection): SchedulerAwaitReason {\n  return state.runningTaskIds.size >= state.maxParallel ? \"root-capacity\" : \"active-scope-capacity\";\n}\n\nexport function canAdmit(state: SchedulerInspection, task: PlannedTask): boolean {\n  return state.runningTaskIds.size < prospectiveMaxParallel(state, task);\n}\n\nexport function activationScopeFor(\n  state: SchedulerInspection,\n  task: PlannedTask\n): PlannedTaskScope | undefined {\n  const scope = scopeForTask(state, task);\n  return scope?.activationTaskIds.includes(task.id) === true && !state.activeScopeIds.has(scope.id)\n    ? scope\n    : undefined;\n}\n\nexport function selectTighteningTask(\n  state: SchedulerInspection,\n  eligibleTasks: readonly PlannedTask[],\n  effectiveMaxParallel: number\n): PlannedTask | undefined {\n  return eligibleTasks\n    .filter((task) => activatesTighteningScope(state, task, effectiveMaxParallel))\n    .sort((left, right) => compareConstrainedTasks(state, left, right))[0];\n}\n\nexport function selectConstrainedContinuation(\n  state: SchedulerInspection,\n  eligibleTasks: readonly PlannedTask[],\n  effectiveMaxParallel: number\n): PlannedTask | undefined {\n  return eligibleTasks\n    .filter((task) => isConstrainedContinuation(state, task, effectiveMaxParallel))\n    .sort((left, right) => compareConstrainedTasks(state, left, right))[0];\n}\n\nfunction pendingTaskFor(taskId: string, tasksById: ReadonlyMap<string, PlannedTask>): PlannedTask {\n  const task = tasksById.get(taskId);\n  if (task === undefined) throw new Error(`scheduler snapshot has unknown pending task ${taskId}`);\n  return task;\n}\n\nfunction blockingDependencyIds(\n  task: PlannedTask,\n  settlementKindByTaskId: ReadonlyMap<string, SchedulerSettlementKind>\n): string[] | undefined {\n  const settlementKinds = task.dependsOn.map(\n    (dependencyId) => [dependencyId, settlementKindByTaskId.get(dependencyId)] as const\n  );\n  if (settlementKinds.some(([, kind]) => kind === undefined)) return undefined;\n  const dependencyIds = settlementKinds.flatMap(([dependencyId, kind]) =>\n    kind === \"completed\" ? [] : [dependencyId]\n  );\n  return dependencyIds.length === 0 ? undefined : dependencyIds;\n}\n\nfunction capacityFor(state: SchedulerInspection): SchedulerCapacity {\n  return Object.freeze({\n    effectiveMaxParallel: effectiveMaxParallelFor(state),\n    maxParallel: state.maxParallel,\n    running: state.runningTaskIds.size\n  });\n}\n\nfunction effectiveMaxParallelFor(state: SchedulerInspection): number {\n  let effective = state.maxParallel;\n  for (const scope of state.graph.scopes) {\n    if (state.activeScopeIds.has(scope.id)) effective = Math.min(effective, scope.maxParallel);\n  }\n  return effective;\n}\n\nfunction prospectiveMaxParallel(state: SchedulerInspection, task: PlannedTask): number {\n  const scope = activationScopeFor(state, task);\n  return scope === undefined\n    ? effectiveMaxParallelFor(state)\n    : Math.min(effectiveMaxParallelFor(state), scope.maxParallel);\n}\n\nfunction activatesTighteningScope(\n  state: SchedulerInspection,\n  task: PlannedTask,\n  effectiveMaxParallel: number\n): boolean {\n  const scope = activationScopeFor(state, task);\n  return scope !== undefined && scope.maxParallel < effectiveMaxParallel;\n}\n\nfunction isConstrainedContinuation(\n  state: SchedulerInspection,\n  task: PlannedTask,\n  effectiveMaxParallel: number\n): boolean {\n  const scope = scopeForTask(state, task);\n  return (\n    scope !== undefined &&\n    state.activeScopeIds.has(scope.id) &&\n    scope.maxParallel < state.maxParallel &&\n    scope.maxParallel === effectiveMaxParallel\n  );\n}\n\nfunction compareConstrainedTasks(\n  state: SchedulerInspection,\n  left: PlannedTask,\n  right: PlannedTask\n): number {\n  const leftScope = scopeForTask(state, left);\n  const rightScope = scopeForTask(state, right);\n  if (leftScope === undefined || rightScope === undefined) {\n    throw new Error(\"constrained task is missing a scope\");\n  }\n  return (\n    leftScope.maxParallel - rightScope.maxParallel ||\n    compareText(leftScope.id, rightScope.id) ||\n    compareText(left.id, right.id)\n  );\n}\n\nfunction compareText(left: string, right: string): number {\n  if (left < right) return -1;\n  if (left > right) return 1;\n  return 0;\n}\n\nfunction scopeForTask(state: SchedulerInspection, task: PlannedTask): PlannedTaskScope | undefined {\n  return task.scopeId === undefined\n    ? undefined\n    : state.graph.scopes.find((scope) => scope.id === task.scopeId);\n}\n"]}