@zxyycom/vibe-check 0.0.1 → 0.0.2

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

@@ -1 +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"]}
+{"version":3,"file":"graph-validation.mjs","sourceRoot":"","sources":["../../../../src/project-run/task-scheduler/graph-validation.ts"],"names":[],"mappings":"AAyBA,6FAA6F;AAC7F,MAAM,UAAU,yBAAyB,CAAC,KAAuC;IAC/E,sBAAsB,CAAC,KAAK,CAAC,kBAAkB,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC9D,qBAAqB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IACnD,0BAA0B,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;IACxD,cAAc,CAAC,KAAK,CAAC,CAAC;AACxB,CAAC;AAED,SAAS,sBAAsB,CAC7B,UAAyC,EACzC,KAA6B;IAE7B,MAAM,oBAAoB,GAAG,IAAI,GAAG,CAClC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,UAAU,EAAE,KAAK,CAAU,CAAC,CACxE,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,oBAAoB,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAC5D,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,EAAE,4BAA4B,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC;YACjF,CAAC;YACD,IAAI,KAAK,CAAC,KAAK,GAAG,QAAQ,EAAE,CAAC;gBAC3B,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,EAAE,qCAAqC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC;YAC1F,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAC5B,KAA6B,EAC7B,QAA0C;IAE1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,sBAAsB,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QACpE,sBAAsB,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAClE,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;gBACzC,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,EAAE,2CAA2C,YAAY,EAAE,CAAC,CAAC;YAC5F,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,sBAAsB,CAC7B,IAAiB,EACjB,QAA2B,EAC3B,iBAAoC,EACpC,QAA0C;IAE1C,MAAM,MAAM,GAAG,QAAQ,KAAK,WAAW,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,UAAU,CAAC;IACpE,KAAK,MAAM,aAAa,IAAI,iBAAiB,EAAE,CAAC;QAC9C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,EAAE,IAAI,MAAM,iBAAiB,aAAa,EAAE,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,0BAA0B,CACjC,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,aAAa,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;YACjD,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YAChD,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC9B,MAAM,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,EAAE,4BAA4B,aAAa,EAAE,CAAC,CAAC;YAC9E,CAAC;YACD,KAAK,CAAC,WAAW,CAAC,CAAC;QACrB,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,IACE,CAAC,eAAe,CAAC,EAAE,qBAAqB,EAAE,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,cAAc,EAAE,CAAC,EAC5F,CAAC;YACD,MAAM,IAAI,KAAK,CAAC,cAAc,KAAK,CAAC,EAAE,6CAA6C,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QAChG,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,KAA4B;IACnD,OAAO,qBAAqB,CAAC;QAC3B,OAAO,EAAE,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC7D,KAAK;QACL,OAAO,EAAE,IAAI,GAAG,EAAE;KACnB,CAAC,CAAC;AACL,CAAC;AAED,SAAS,qBAAqB,CAAC,SAAgC;IAC7D,OAAO,SAAS,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpC,MAAM,aAAa,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QAC9C,IAAI,aAAa,KAAK,SAAS,IAAI,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC;YAAE,SAAS;QAClF,IAAI,aAAa,KAAK,SAAS,CAAC,KAAK,CAAC,qBAAqB;YAAE,OAAO,IAAI,CAAC;QAEzE,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QACrC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC;IACxF,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,iBAAiB,CACxB,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,cAAc,CAAC,IAAI,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,cAAc,CAAC,IAAiB;IACvC,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC/C,CAAC","sourcesContent":["import type { NamedResourceUnits, PlannedTask, PlannedTaskScope } from \"./graph.ts\";\n\ninterface PreparedTaskGraphValidationInput {\n  readonly resourceCapacities: readonly NamedResourceUnits[];\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\ntype TaskRelationField = \"dependsOn\" | \"observes\";\n\ninterface TaskRelationPathQuery {\n  readonly requiredRelatedTaskId: string;\n  readonly taskById: ReadonlyMap<string, PlannedTask>;\n  readonly taskId: string;\n}\n\ninterface TaskRelationTraversal {\n  readonly pending: string[];\n  readonly query: TaskRelationPathQuery;\n  readonly visited: Set<string>;\n}\n\n/** Validates direct relations and scope structure after graph-shaped input is normalized. */\nexport function validatePreparedTaskGraph(input: PreparedTaskGraphValidationInput): void {\n  validateResourceClaims(input.resourceCapacities, input.tasks);\n  validateTaskRelations(input.tasks, input.taskById);\n  validateTaskRelationCycles(input.tasks, input.taskById);\n  validateScopes(input);\n}\n\nfunction validateResourceClaims(\n  capacities: readonly NamedResourceUnits[],\n  tasks: readonly PlannedTask[]\n): void {\n  const capacityByResourceId = new Map(\n    capacities.map(({ resourceId, units }) => [resourceId, units] as const)\n  );\n  for (const task of tasks) {\n    for (const claim of task.resourceClaims) {\n      const capacity = capacityByResourceId.get(claim.resourceId);\n      if (capacity === undefined) {\n        throw new Error(`task ${task.id} claims unknown resource ${claim.resourceId}`);\n      }\n      if (claim.units > capacity) {\n        throw new Error(`task ${task.id} claim exceeds resource capacity: ${claim.resourceId}`);\n      }\n    }\n  }\n}\n\nfunction validateTaskRelations(\n  tasks: readonly PlannedTask[],\n  taskById: ReadonlyMap<string, PlannedTask>\n): void {\n  for (const task of tasks) {\n    validateRelatedTaskIds(task, \"dependsOn\", task.dependsOn, taskById);\n    validateRelatedTaskIds(task, \"observes\", task.observes, taskById);\n    for (const dependencyId of task.dependsOn) {\n      if (task.observes.includes(dependencyId)) {\n        throw new Error(`task ${task.id} cannot both depend on and observe task ${dependencyId}`);\n      }\n    }\n  }\n}\n\nfunction validateRelatedTaskIds(\n  task: PlannedTask,\n  relation: TaskRelationField,\n  relationTargetIds: readonly string[],\n  taskById: ReadonlyMap<string, PlannedTask>\n): void {\n  const action = relation === \"dependsOn\" ? \"depends on\" : \"observes\";\n  for (const relatedTaskId of relationTargetIds) {\n    if (!taskById.has(relatedTaskId)) {\n      throw new Error(`task ${task.id} ${action} unknown task ${relatedTaskId}`);\n    }\n  }\n}\n\nfunction validateTaskRelationCycles(\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 relatedTaskId of relatedTaskIds(task)) {\n      const relatedTask = taskById.get(relatedTaskId);\n      if (relatedTask === undefined) {\n        throw new Error(`task ${task.id} relates to unknown task ${relatedTaskId}`);\n      }\n      visit(relatedTask);\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 (\n      !isRelatedToTask({ requiredRelatedTaskId: task.id, taskById, taskId: scope.terminalTaskId })\n    ) {\n      throw new Error(`task scope ${scope.id} terminal task must relate to scoped task ${task.id}`);\n    }\n  }\n}\n\nfunction isRelatedToTask(query: TaskRelationPathQuery): boolean {\n  return traverseTaskRelations({\n    pending: [...relatedTaskIdsFor(query.taskById, query.taskId)],\n    query,\n    visited: new Set()\n  });\n}\n\nfunction traverseTaskRelations(traversal: TaskRelationTraversal): boolean {\n  while (traversal.pending.length > 0) {\n    const relatedTaskId = traversal.pending.pop();\n    if (relatedTaskId === undefined || traversal.visited.has(relatedTaskId)) continue;\n    if (relatedTaskId === traversal.query.requiredRelatedTaskId) return true;\n\n    traversal.visited.add(relatedTaskId);\n    traversal.pending.push(...relatedTaskIdsFor(traversal.query.taskById, relatedTaskId));\n  }\n  return false;\n}\n\nfunction relatedTaskIdsFor(\n  taskById: ReadonlyMap<string, PlannedTask>,\n  taskId: string\n): readonly string[] {\n  const task = taskById.get(taskId);\n  return task === undefined ? [] : relatedTaskIds(task);\n}\n\nfunction relatedTaskIds(task: PlannedTask): readonly string[] {\n  return [...task.dependsOn, ...task.observes];\n}\n"]}

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

@@ -1,6 +1,15 @@
 import { validatePreparedTaskGraph } from "./graph-validation.mjs";
-const TASK_GRAPH_KEYS = ["tasks", "scopes"];
-const TASK_NODE_KEYS = ["id", "dependsOn", "mutex", "scopeId"];
+import { snapshotClosedRecord } from "../../data-boundary/closed-values.mjs";
+const TASK_GRAPH_KEYS = ["resourceCapacities", "tasks", "scopes"];
+const TASK_NODE_KEYS = [
+    "admissionPriority",
+    "id",
+    "dependsOn",
+    "mutex",
+    "observes",
+    "resourceClaims",
+    "scopeId"
+];
 const TASK_SCOPE_KEYS = ["id", "maxParallel", "activationTaskIds", "terminalTaskId"];
 /** Validates untrusted graph-shaped input without admitting it to scheduler execution. */
 export function validateTaskGraph(graph) {
@@ -8,16 +17,46 @@ export function validateTaskGraph(graph) {
 }
 export function prepareTaskGraph(graph, rootMaxParallel) {
     const data = record(graph, "task graph", TASK_GRAPH_KEYS);
+    const resourceCapacities = resourceMapping(data.resourceCapacities, "task graph resourceCapacities");
     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 });
+    validatePreparedTaskGraph({
+        resourceCapacities,
+        rootMaxParallel,
+        scopeById,
+        scopes,
+        taskById,
+        tasks
+    });
     return Object.freeze({
+        resourceCapacities,
+        schedulerGraphSnapshot: schedulerGraphSnapshot(tasks, scopes, resourceCapacities),
         tasks: Object.freeze(tasks),
         scopes: Object.freeze(scopes)
     });
 }
+function schedulerGraphSnapshot(tasks, scopes, resourceCapacities) {
+    return Object.freeze({
+        resourceCapacities,
+        scopes: Object.freeze(scopes.map((scope) => Object.freeze({
+            activationTaskIds: Object.freeze([...scope.activationTaskIds]),
+            id: scope.id,
+            maxParallel: scope.maxParallel,
+            terminalTaskId: scope.terminalTaskId
+        }))),
+        tasks: Object.freeze(tasks.map((task) => Object.freeze({
+            admissionPriority: task.admissionPriority,
+            dependsOn: Object.freeze([...task.dependsOn]),
+            mutex: Object.freeze([...task.mutex]),
+            observes: Object.freeze([...task.observes]),
+            resourceClaims: task.resourceClaims,
+            scopeId: task.scopeId ?? null,
+            taskId: task.id
+        })))
+    });
+}
 function normalizeTasks(value) {
     if (!Array.isArray(value)) {
         throw new TypeError("task graph tasks must be an array");
@@ -31,11 +70,15 @@ function normalizeTasks(value) {
             throw new TypeError(`duplicate task id: ${id}`);
         }
         ids.add(id);
+        const admissionPriority = admissionPriorityOrDefault(data.admissionPriority, id);
         const scopeId = optionalNonEmptyString(data.scopeId, `task ${id}.scopeId`);
         tasks.push(Object.freeze({
+            admissionPriority,
             id,
             dependsOn: Object.freeze(stringList(data.dependsOn, `task ${id}.dependsOn`)),
             mutex: Object.freeze(stringList(data.mutex, `task ${id}.mutex`)),
+            observes: Object.freeze(stringList(data.observes, `task ${id}.observes`)),
+            resourceClaims: resourceMapping(data.resourceClaims, `task ${id}.resourceClaims`),
             scopeId
         }));
     }
@@ -107,10 +150,43 @@ function requiredStringList(value, fieldName) {
     }
     return stringList(value, fieldName);
 }
+function resourceMapping(value, fieldName) {
+    if (value === undefined)
+        return Object.freeze([]);
+    const data = snapshotClosedRecord(value);
+    if (data === undefined)
+        throw new TypeError(`${fieldName} must be a closed object`);
+    const entries = [];
+    for (const resourceId of Object.keys(data).sort(compareText)) {
+        if (resourceId.trim().length === 0) {
+            throw new TypeError(`${fieldName} resource ids must be non-empty strings`);
+        }
+        entries.push(Object.freeze({
+            resourceId,
+            units: positiveSafeInteger(data[resourceId], `${fieldName}.${resourceId}`)
+        }));
+    }
+    return Object.freeze(entries);
+}
 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;
 }
+function admissionPriorityOrDefault(value, taskId) {
+    if (value === undefined)
+        return 0;
+    if (typeof value !== "number" || !Number.isSafeInteger(value)) {
+        throw new TypeError(`task ${taskId}.admissionPriority must be a safe integer`);
+    }
+    return value;
+}
+function compareText(left, right) {
+    if (left < right)
+        return -1;
+    if (left > right)
+        return 1;
+    return 0;
+}
 //# sourceMappingURL=graph.mjs.map

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

@@ -1 +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"]}
+{"version":3,"file":"graph.mjs","sourceRoot":"","sources":["../../../../src/project-run/task-scheduler/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,yBAAyB,EAAE,MAAM,uBAAuB,CAAC;AAElE,OAAO,EAAE,oBAAoB,EAAE,MAAM,sCAAsC,CAAC;AA4D5E,MAAM,eAAe,GAAG,CAAC,oBAAoB,EAAE,OAAO,EAAE,QAAQ,CAAU,CAAC;AAC3E,MAAM,cAAc,GAAG;IACrB,mBAAmB;IACnB,IAAI;IACJ,WAAW;IACX,OAAO;IACP,UAAU;IACV,gBAAgB;IAChB,SAAS;CACD,CAAC;AACX,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,kBAAkB,GAAG,eAAe,CACxC,IAAI,CAAC,kBAAkB,EACvB,+BAA+B,CAChC,CAAC;IACF,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;QACxB,kBAAkB;QAClB,eAAe;QACf,SAAS;QACT,MAAM;QACN,QAAQ;QACR,KAAK;KACN,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,kBAAkB;QAClB,sBAAsB,EAAE,sBAAsB,CAAC,KAAK,EAAE,MAAM,EAAE,kBAAkB,CAAC;QACjF,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;QAC3B,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC;KAC9B,CAAC,CAAC;AACL,CAAC;AAED,SAAS,sBAAsB,CAC7B,KAA6B,EAC7B,MAAmC,EACnC,kBAAiD;IAEjD,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,kBAAkB;QAClB,MAAM,EAAE,MAAM,CAAC,MAAM,CACnB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACnB,MAAM,CAAC,MAAM,CAAC;YACZ,iBAAiB,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,iBAAiB,CAAC,CAAC;YAC9D,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,cAAc,EAAE,KAAK,CAAC,cAAc;SACrC,CAAC,CACH,CACF;QACD,KAAK,EAAE,MAAM,CAAC,MAAM,CAClB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACjB,MAAM,CAAC,MAAM,CAAC;YACZ,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;YACzC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7C,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YACrC,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3C,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,IAAI;YAC7B,MAAM,EAAE,IAAI,CAAC,EAAE;SAChB,CAAC,CACH,CACF;KACF,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,iBAAiB,GAAG,0BAA0B,CAAC,IAAI,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;QACjF,MAAM,OAAO,GAAG,sBAAsB,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC3E,KAAK,CAAC,IAAI,CACR,MAAM,CAAC,MAAM,CAAC;YACZ,iBAAiB;YACjB,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,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;YACzE,cAAc,EAAE,eAAe,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,EAAE,iBAAiB,CAAC;YACjF,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,eAAe,CAAC,KAAc,EAAE,SAAiB;IACxD,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,IAAI,KAAK,SAAS;QAAE,MAAM,IAAI,SAAS,CAAC,GAAG,SAAS,0BAA0B,CAAC,CAAC;IACpF,MAAM,OAAO,GAAyB,EAAE,CAAC;IACzC,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;QAC7D,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,SAAS,CAAC,GAAG,SAAS,yCAAyC,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,CAAC,IAAI,CACV,MAAM,CAAC,MAAM,CAAC;YACZ,UAAU;YACV,KAAK,EAAE,mBAAmB,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,GAAG,SAAS,IAAI,UAAU,EAAE,CAAC;SAC3E,CAAC,CACH,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;AAChC,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;AAED,SAAS,0BAA0B,CAAC,KAAc,EAAE,MAAc;IAChE,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IAClC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9D,MAAM,IAAI,SAAS,CAAC,QAAQ,MAAM,2CAA2C,CAAC,CAAC;IACjF,CAAC;IACD,OAAO,KAAK,CAAC;AACf,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","sourcesContent":["import { validatePreparedTaskGraph } from \"./graph-validation.ts\";\nimport type { SchedulerGraphSnapshot } from \"../../project-definition/project-definition.ts\";\nimport { snapshotClosedRecord } from \"../../data-boundary/closed-values.ts\";\n\nexport interface NamedResourceUnits {\n  readonly resourceId: string;\n  readonly units: number;\n}\n\nexport interface TaskNode {\n  readonly admissionPriority?: number;\n  readonly id: string;\n  readonly dependsOn?: readonly string[];\n  readonly mutex?: readonly string[];\n  readonly observes?: readonly string[];\n  readonly resourceClaims?: Readonly<Record<string, number>>;\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 resourceCapacities?: Readonly<Record<string, number>>;\n  readonly tasks: readonly TaskNode[];\n  readonly scopes?: readonly TaskScope[];\n}\n\nexport interface PlannedTask {\n  readonly admissionPriority: number;\n  readonly id: string;\n  readonly dependsOn: readonly string[];\n  readonly mutex: readonly string[];\n  readonly observes: readonly string[];\n  readonly resourceClaims: readonly NamedResourceUnits[];\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 resourceCapacities: readonly NamedResourceUnits[];\n  /** Immutable public projection shared by every decision and terminal measurement in one run. */\n  readonly schedulerGraphSnapshot: SchedulerGraphSnapshot;\n  readonly tasks: readonly PlannedTask[];\n  readonly scopes: readonly PlannedTaskScope[];\n}\n\nconst TASK_GRAPH_KEYS = [\"resourceCapacities\", \"tasks\", \"scopes\"] as const;\nconst TASK_NODE_KEYS = [\n  \"admissionPriority\",\n  \"id\",\n  \"dependsOn\",\n  \"mutex\",\n  \"observes\",\n  \"resourceClaims\",\n  \"scopeId\"\n] 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 resourceCapacities = resourceMapping(\n    data.resourceCapacities,\n    \"task graph resourceCapacities\"\n  );\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({\n    resourceCapacities,\n    rootMaxParallel,\n    scopeById,\n    scopes,\n    taskById,\n    tasks\n  });\n\n  return Object.freeze({\n    resourceCapacities,\n    schedulerGraphSnapshot: schedulerGraphSnapshot(tasks, scopes, resourceCapacities),\n    tasks: Object.freeze(tasks),\n    scopes: Object.freeze(scopes)\n  });\n}\n\nfunction schedulerGraphSnapshot(\n  tasks: readonly PlannedTask[],\n  scopes: readonly PlannedTaskScope[],\n  resourceCapacities: readonly NamedResourceUnits[]\n): SchedulerGraphSnapshot {\n  return Object.freeze({\n    resourceCapacities,\n    scopes: Object.freeze(\n      scopes.map((scope) =>\n        Object.freeze({\n          activationTaskIds: Object.freeze([...scope.activationTaskIds]),\n          id: scope.id,\n          maxParallel: scope.maxParallel,\n          terminalTaskId: scope.terminalTaskId\n        })\n      )\n    ),\n    tasks: Object.freeze(\n      tasks.map((task) =>\n        Object.freeze({\n          admissionPriority: task.admissionPriority,\n          dependsOn: Object.freeze([...task.dependsOn]),\n          mutex: Object.freeze([...task.mutex]),\n          observes: Object.freeze([...task.observes]),\n          resourceClaims: task.resourceClaims,\n          scopeId: task.scopeId ?? null,\n          taskId: task.id\n        })\n      )\n    )\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 admissionPriority = admissionPriorityOrDefault(data.admissionPriority, id);\n    const scopeId = optionalNonEmptyString(data.scopeId, `task ${id}.scopeId`);\n    tasks.push(\n      Object.freeze({\n        admissionPriority,\n        id,\n        dependsOn: Object.freeze(stringList(data.dependsOn, `task ${id}.dependsOn`)),\n        mutex: Object.freeze(stringList(data.mutex, `task ${id}.mutex`)),\n        observes: Object.freeze(stringList(data.observes, `task ${id}.observes`)),\n        resourceClaims: resourceMapping(data.resourceClaims, `task ${id}.resourceClaims`),\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 resourceMapping(value: unknown, fieldName: string): readonly NamedResourceUnits[] {\n  if (value === undefined) return Object.freeze([]);\n  const data = snapshotClosedRecord(value);\n  if (data === undefined) throw new TypeError(`${fieldName} must be a closed object`);\n  const entries: NamedResourceUnits[] = [];\n  for (const resourceId of Object.keys(data).sort(compareText)) {\n    if (resourceId.trim().length === 0) {\n      throw new TypeError(`${fieldName} resource ids must be non-empty strings`);\n    }\n    entries.push(\n      Object.freeze({\n        resourceId,\n        units: positiveSafeInteger(data[resourceId], `${fieldName}.${resourceId}`)\n      })\n    );\n  }\n  return Object.freeze(entries);\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\nfunction admissionPriorityOrDefault(value: unknown, taskId: string): number {\n  if (value === undefined) return 0;\n  if (typeof value !== \"number\" || !Number.isSafeInteger(value)) {\n    throw new TypeError(`task ${taskId}.admissionPriority must be a safe integer`);\n  }\n  return value;\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"]}

package/dist/esm/project-run/task-scheduler/measurement/diagnostics.mjs

@@ -0,0 +1,207 @@
+import { diagnosticTags } from "../../diagnostic-logging/logger.mjs";
+import { summaryFromSchedulerMeasurement } from "./summary.mjs";
+import { SchedulerPerformanceTiming } from "./timing.mjs";
+import { SchedulerPolicyMeasurement } from "./policy.mjs";
+/**
+ * Scheduler-owned, invocation-local lifecycle projection. Clock boundaries and
+ * numeric interval accumulation remain private collaborators of this owner.
+ */
+export class SchedulerPerformanceDiagnostics {
+    #declarativeFingerprint;
+    #logger;
+    #timing;
+    #lastSettledTaskId;
+    #completionTailActiveTaskIds = Object.freeze([]);
+    #admittedTaskIds = new Set();
+    #chronologyByTaskId = new Map();
+    #policyMeasurement = new SchedulerPolicyMeasurement();
+    constructor(input, initial) {
+        this.#declarativeFingerprint = input.declarativeFingerprint;
+        this.#logger = input.logger;
+        this.#timing = new SchedulerPerformanceTiming(input.clock, initial);
+    }
+    measureControlPath(operation) {
+        return this.#timing.measureControlPath(operation);
+    }
+    observeDecision(observation) {
+        this.#timing.observeDecision(observation);
+    }
+    /** Flushes the old state before admission changes the real Scheduler state. */
+    beforeAdmission(taskId, runningTaskIds) {
+        this.#admittedTaskIds.add(taskId);
+        this.#completionTailActiveTaskIds = Object.freeze([...runningTaskIds, taskId]);
+        const boundary = this.#timing.boundary();
+        if (boundary === undefined)
+            return;
+        const admissionDelay = this.#timing.takeAdmissionDelay(taskId);
+        if (admissionDelay === undefined)
+            return this.#timing.invalidate("integral-invalid");
+        this.#chronologyByTaskId.set(taskId, {
+            admissionDelay,
+            admittedAt: boundary,
+            settledAt: undefined
+        });
+    }
+    /** Flushes the old state before blocked/cancelled changes the real Scheduler state. */
+    beforePendingSettlement(taskIds = []) {
+        const lastTaskId = taskIds.at(-1);
+        if (lastTaskId !== undefined)
+            this.#lastSettledTaskId = lastTaskId;
+        this.#timing.boundary();
+    }
+    /** Flushes the old running interval before removing the actual running Task. */
+    beforeRunningSettlement(taskId) {
+        this.#lastSettledTaskId = taskId;
+        const boundary = this.#timing.boundary();
+        if (boundary === undefined)
+            return;
+        this.#timing.closeAcceptedWait(boundary);
+        const chronology = this.#chronologyByTaskId.get(taskId);
+        if (chronology === undefined)
+            return this.#timing.invalidate("integral-invalid");
+        chronology.settledAt = boundary;
+    }
+    beforeAcceptedWait() {
+        this.#timing.beginAcceptedWait();
+    }
+    captureState(state) {
+        this.#timing.captureState(state);
+    }
+    rawMeasurement() {
+        return this.#measurement(true);
+    }
+    beginSelectedPolicyAction(taskId) {
+        this.#policyMeasurement.beginSelected(taskId, this.#timing.snapshot().totals);
+    }
+    beginWaitPolicyAction() {
+        this.#policyMeasurement.beginWait(this.#timing.snapshot().totals);
+    }
+    recordEffect(effect) {
+        this.#policyMeasurement.recordEffect(effect);
+    }
+    policyMeasurement() {
+        this.#timing.boundary();
+        this.#completePolicyAction();
+        return this.#policyMeasurement.snapshot(this.#cumulativeMeasurement());
+    }
+    completePendingActionObservation() {
+        this.#timing.boundary();
+        this.#completePolicyAction();
+    }
+    admittedTaskIds() {
+        return Object.freeze([...this.#admittedTaskIds]);
+    }
+    /** Internal default terminal hook; it contains writer failure without runner special-casing. */
+    defaultSummaryHook() {
+        if (this.#logger === undefined)
+            return undefined;
+        const logger = this.#logger;
+        return (context) => {
+            try {
+                logger.observe({
+                    event: "scheduler.summary",
+                    tags: diagnosticTags("SUMMARY"),
+                    details: summaryFromSchedulerMeasurement(context.rawMeasurement)
+                });
+            }
+            catch {
+                // Summary writer failure is contained by this hook, not the shared runner.
+            }
+        };
+    }
+    #completePolicyAction() {
+        const timing = this.#timing.snapshot();
+        this.#policyMeasurement.complete(timing.totals, timing.timing);
+    }
+    #cumulativeMeasurement() {
+        const snapshot = this.#timing.snapshot();
+        const facts = Object.freeze({
+            declarativeFingerprint: this.#declarativeFingerprint,
+            discrete: Object.freeze({
+                acceptedWaitCount: snapshot.acceptedWaitCount,
+                admittedCount: this.#admittedTaskIds.size,
+                maxRunning: snapshot.maxRunning
+            }),
+            peaks: snapshot.peaks
+        });
+        if (snapshot.timing.availability === "unavailable") {
+            return Object.freeze({ ...facts, timing: snapshot.timing });
+        }
+        return Object.freeze({
+            ...facts,
+            timing: snapshot.timing,
+            timingFacts: Object.freeze({
+                acceptedWaitMs: snapshot.acceptedWaitMs,
+                effectiveCapacitySlotMs: snapshot.totals.effectiveCapacitySlotMs,
+                rootCapacitySlotMs: snapshot.totals.rootCapacitySlotMs,
+                taskSlotMs: snapshot.totals.taskSlotMs
+            })
+        });
+    }
+    #measurement(terminal) {
+        const endedAt = this.#timing.boundary();
+        if (terminal && endedAt !== undefined)
+            this.#timing.closeAcceptedWait(endedAt);
+        const snapshot = this.#timing.snapshot();
+        const facts = Object.freeze({
+            declarativeFingerprint: this.#declarativeFingerprint,
+            discrete: Object.freeze({
+                acceptedWaitCount: snapshot.acceptedWaitCount,
+                admittedCount: this.#admittedTaskIds.size,
+                completionTailActiveTaskIds: Object.freeze([...this.#completionTailActiveTaskIds]),
+                lastSettledTaskId: this.#lastSettledTaskId ?? null,
+                maxRunning: snapshot.maxRunning
+            }),
+            peaks: snapshot.peaks
+        });
+        if (snapshot.timing.availability === "unavailable") {
+            return Object.freeze({ ...facts, timing: snapshot.timing });
+        }
+        if (endedAt === undefined)
+            throw new Error("available Scheduler timing has no terminal boundary");
+        return Object.freeze({
+            ...facts,
+            timing: snapshot.timing,
+            timingFacts: Object.freeze({
+                acceptedWaitMs: snapshot.acceptedWaitMs,
+                admissions: Object.freeze(this.#admissionMeasurements()),
+                effectiveCapacitySlotMs: snapshot.totals.effectiveCapacitySlotMs,
+                endedAtMonotonicMs: endedAt,
+                rootCapacitySlotMs: snapshot.totals.rootCapacitySlotMs,
+                schedulerControlPathMs: snapshot.schedulerControlPathMs,
+                schedulerDecisionObservationMs: snapshot.decisionObservationMs,
+                startedAtMonotonicMs: snapshot.startedAtMonotonicMs ?? endedAt,
+                taskSlotMs: snapshot.totals.taskSlotMs
+            })
+        });
+    }
+    #admissionMeasurements() {
+        const pendingByTaskId = new Map(this.#timing
+            .pendingAdmissionDelays()
+            .map(({ admissionDelay, taskId }) => [taskId, admissionDelay]));
+        const taskIds = new Set([...pendingByTaskId.keys(), ...this.#chronologyByTaskId.keys()]);
+        return [...taskIds]
+            .map((taskId) => this.#admissionMeasurement(taskId, pendingByTaskId))
+            .sort((left, right) => compareText(left.taskId, right.taskId));
+    }
+    #admissionMeasurement(taskId, pendingByTaskId) {
+        const chronology = this.#chronologyByTaskId.get(taskId);
+        const admissionDelay = chronology?.admissionDelay ?? pendingByTaskId.get(taskId);
+        if (admissionDelay === undefined)
+            throw new Error(`missing admission measurement for ${taskId}`);
+        return Object.freeze({
+            admissionDelay,
+            admittedAtMonotonicMs: chronology?.admittedAt ?? null,
+            settledAtMonotonicMs: chronology?.settledAt ?? null,
+            taskId
+        });
+    }
+}
+function compareText(left, right) {
+    if (left < right)
+        return -1;
+    if (left > right)
+        return 1;
+    return 0;
+}
+//# sourceMappingURL=diagnostics.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"diagnostics.mjs","sourceRoot":"","sources":["../../../../../src/project-run/task-scheduler/measurement/diagnostics.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,cAAc,EAAyB,MAAM,oCAAoC,CAAC;AAE3F,OAAO,EAAE,+BAA+B,EAAE,MAAM,cAAc,CAAC;AAC/D,OAAO,EAAE,0BAA0B,EAAE,MAAM,aAAa,CAAC;AACzD,OAAO,EAAE,0BAA0B,EAAE,MAAM,aAAa,CAAC;AA2BzD;;;GAGG;AACH,MAAM,OAAO,+BAA+B;IACjC,uBAAuB,CAAS;IAChC,OAAO,CAA+B;IACtC,OAAO,CAA6B;IAC7C,kBAAkB,CAAqB;IACvC,4BAA4B,GAAsB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC3D,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,mBAAmB,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC7D,kBAAkB,GAAG,IAAI,0BAA0B,EAAE,CAAC;IAE/D,YACE,KAA2C,EAC3C,OAAkC;QAElC,IAAI,CAAC,uBAAuB,GAAG,KAAK,CAAC,sBAAsB,CAAC;QAC5D,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,IAAI,0BAA0B,CAAC,KAAK,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACtE,CAAC;IAEM,kBAAkB,CAAI,SAAkB;QAC7C,OAAO,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;IACpD,CAAC;IAEM,eAAe,CAAC,WAAuB;QAC5C,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;IAC5C,CAAC;IAED,+EAA+E;IACxE,eAAe,CAAC,MAAc,EAAE,cAAiC;QACtE,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,4BAA4B,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC;QAC/E,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QACzC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO;QACnC,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC/D,IAAI,cAAc,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC;QACrF,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,MAAM,EAAE;YACnC,cAAc;YACd,UAAU,EAAE,QAAQ;YACpB,SAAS,EAAE,SAAS;SACrB,CAAC,CAAC;IACL,CAAC;IAED,uFAAuF;IAChF,uBAAuB,CAAC,OAAO,GAAsB,EAAE;QAC5D,MAAM,UAAU,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,UAAU,KAAK,SAAS;YAAE,IAAI,CAAC,kBAAkB,GAAG,UAAU,CAAC;QACnE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;IAC1B,CAAC;IAED,gFAAgF;IACzE,uBAAuB,CAAC,MAAc;QAC3C,IAAI,CAAC,kBAAkB,GAAG,MAAM,CAAC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QACzC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO;QACnC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;QACzC,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxD,IAAI,UAAU,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC;QACjF,UAAU,CAAC,SAAS,GAAG,QAAQ,CAAC;IAClC,CAAC;IAEM,kBAAkB;QACvB,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACnC,CAAC;IAEM,YAAY,CAAC,KAAgC;QAClD,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAEM,cAAc;QACnB,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAEM,yBAAyB,CAAC,MAAc;QAC7C,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,CAAC;IAChF,CAAC;IAEM,qBAAqB;QAC1B,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,CAAC;IACpE,CAAC;IAEM,YAAY,CAAC,MAAkC;QACpD,IAAI,CAAC,kBAAkB,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;IAC/C,CAAC;IAEM,iBAAiB;QACtB,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QACxB,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,sBAAsB,EAAE,CAAC,CAAC;IACzE,CAAC;IAEM,gCAAgC;QACrC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QACxB,IAAI,CAAC,qBAAqB,EAAE,CAAC;IAC/B,CAAC;IAEM,eAAe;QACpB,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,gGAAgG;IACzF,kBAAkB;QACvB,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,OAAO,CAAC,OAAO,EAAE,EAAE;YACjB,IAAI,CAAC;gBACH,MAAM,CAAC,OAAO,CAAC;oBACb,KAAK,EAAE,mBAAmB;oBAC1B,IAAI,EAAE,cAAc,CAAC,SAAS,CAAC;oBAC/B,OAAO,EAAE,+BAA+B,CAAC,OAAO,CAAC,cAAc,CAAC;iBACjE,CAAC,CAAC;YACL,CAAC;YAAC,MAAM,CAAC;gBACP,2EAA2E;YAC7E,CAAC;QACH,CAAC,CAAC;IACJ,CAAC;IAED,qBAAqB;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QACvC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IACjE,CAAC;IAED,sBAAsB;QACpB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,sBAAsB,EAAE,IAAI,CAAC,uBAAuB;YACpD,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC;gBACtB,iBAAiB,EAAE,QAAQ,CAAC,iBAAiB;gBAC7C,aAAa,EAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI;gBACzC,UAAU,EAAE,QAAQ,CAAC,UAAU;aAChC,CAAC;YACF,KAAK,EAAE,QAAQ,CAAC,KAAK;SACtB,CAAC,CAAC;QACH,IAAI,QAAQ,CAAC,MAAM,CAAC,YAAY,KAAK,aAAa,EAAE,CAAC;YACnD,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC;YACnB,GAAG,KAAK;YACR,MAAM,EAAE,QAAQ,CAAC,MAAM;YACvB,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC;gBACzB,cAAc,EAAE,QAAQ,CAAC,cAAc;gBACvC,uBAAuB,EAAE,QAAQ,CAAC,MAAM,CAAC,uBAAuB;gBAChE,kBAAkB,EAAE,QAAQ,CAAC,MAAM,CAAC,kBAAkB;gBACtD,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,UAAU;aACvC,CAAC;SACH,CAAC,CAAC;IACL,CAAC;IAED,YAAY,CAAC,QAAiB;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QACxC,IAAI,QAAQ,IAAI,OAAO,KAAK,SAAS;YAAE,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;QAC/E,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,sBAAsB,EAAE,IAAI,CAAC,uBAAuB;YACpD,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC;gBACtB,iBAAiB,EAAE,QAAQ,CAAC,iBAAiB;gBAC7C,aAAa,EAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI;gBACzC,2BAA2B,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,CAAC;gBAClF,iBAAiB,EAAE,IAAI,CAAC,kBAAkB,IAAI,IAAI;gBAClD,UAAU,EAAE,QAAQ,CAAC,UAAU;aAChC,CAAC;YACF,KAAK,EAAE,QAAQ,CAAC,KAAK;SACtB,CAAC,CAAC;QACH,IAAI,QAAQ,CAAC,MAAM,CAAC,YAAY,KAAK,aAAa,EAAE,CAAC;YACnD,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,OAAO,KAAK,SAAS;YACvB,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;QACzE,OAAO,MAAM,CAAC,MAAM,CAAC;YACnB,GAAG,KAAK;YACR,MAAM,EAAE,QAAQ,CAAC,MAAM;YACvB,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC;gBACzB,cAAc,EAAE,QAAQ,CAAC,cAAc;gBACvC,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBACxD,uBAAuB,EAAE,QAAQ,CAAC,MAAM,CAAC,uBAAuB;gBAChE,kBAAkB,EAAE,OAAO;gBAC3B,kBAAkB,EAAE,QAAQ,CAAC,MAAM,CAAC,kBAAkB;gBACtD,sBAAsB,EAAE,QAAQ,CAAC,sBAAsB;gBACvD,8BAA8B,EAAE,QAAQ,CAAC,qBAAqB;gBAC9D,oBAAoB,EAAE,QAAQ,CAAC,oBAAoB,IAAI,OAAO;gBAC9D,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,UAAU;aACvC,CAAC;SACH,CAAC,CAAC;IACL,CAAC;IAED,sBAAsB;QACpB,MAAM,eAAe,GAAG,IAAI,GAAG,CAC7B,IAAI,CAAC,OAAO;aACT,sBAAsB,EAAE;aACxB,GAAG,CAAC,CAAC,EAAE,cAAc,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CACjE,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,eAAe,CAAC,IAAI,EAAE,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACzF,OAAO,CAAC,GAAG,OAAO,CAAC;aAChB,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,qBAAqB,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;aACpE,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,qBAAqB,CACnB,MAAc,EACd,eAA6D;QAE7D,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,cAAc,GAAG,UAAU,EAAE,cAAc,IAAI,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjF,IAAI,cAAc,KAAK,SAAS;YAC9B,MAAM,IAAI,KAAK,CAAC,qCAAqC,MAAM,EAAE,CAAC,CAAC;QACjE,OAAO,MAAM,CAAC,MAAM,CAAC;YACnB,cAAc;YACd,qBAAqB,EAAE,UAAU,EAAE,UAAU,IAAI,IAAI;YACrD,oBAAoB,EAAE,UAAU,EAAE,SAAS,IAAI,IAAI;YACnD,MAAM;SACP,CAAC,CAAC;IACL,CAAC;CACF;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","sourcesContent":["import type {\n  AdmissionPolicyMeasurement,\n  SchedulerDecisionMeasurementCumulative,\n  SchedulerMeasurementAdmission,\n  SchedulerMeasurementEffect,\n  SchedulerMeasurementHook,\n  SchedulerRawMeasurement\n} from \"../../../project-definition/project-definition.ts\";\nimport { diagnosticTags, type DiagnosticLogger } from \"../../diagnostic-logging/logger.ts\";\nimport type { AdmissionDelayBreakdown } from \"./integrals.ts\";\nimport { summaryFromSchedulerMeasurement } from \"./summary.ts\";\nimport { SchedulerPerformanceTiming } from \"./timing.ts\";\nimport { SchedulerPolicyMeasurement } from \"./policy.ts\";\n\n/** Explicit, enabled-only private handoff; the Scheduler never infers this from logger behavior. */\nexport type SchedulerPerformanceDiagnosticsInput = Readonly<{\n  readonly clock: Readonly<{ now(): number }>;\n  readonly declarativeFingerprint: string;\n  readonly logger?: DiagnosticLogger;\n}>;\n\ntype AdmissionChronology = {\n  readonly admissionDelay: AdmissionDelayBreakdown;\n  readonly admittedAt: number;\n  settledAt: number | undefined;\n};\n\nexport type AdmissionViablePendingTask = Readonly<{\n  readonly kind: \"admissible-pending\" | \"capacity-blocked\" | \"mutex-blocked\";\n  readonly taskId: string;\n}>;\n\nexport type SchedulerPerformanceState = Readonly<{\n  readonly admissionViablePendingTasks: readonly AdmissionViablePendingTask[];\n  readonly effectiveMaxParallel: number;\n  readonly rootMaxParallel: number;\n  readonly running: number;\n}>;\n\n/**\n * Scheduler-owned, invocation-local lifecycle projection. Clock boundaries and\n * numeric interval accumulation remain private collaborators of this owner.\n */\nexport class SchedulerPerformanceDiagnostics {\n  readonly #declarativeFingerprint: string;\n  readonly #logger: DiagnosticLogger | undefined;\n  readonly #timing: SchedulerPerformanceTiming;\n  #lastSettledTaskId: string | undefined;\n  #completionTailActiveTaskIds: readonly string[] = Object.freeze([]);\n  readonly #admittedTaskIds = new Set<string>();\n  readonly #chronologyByTaskId = new Map<string, AdmissionChronology>();\n  readonly #policyMeasurement = new SchedulerPolicyMeasurement();\n\n  public constructor(\n    input: SchedulerPerformanceDiagnosticsInput,\n    initial: SchedulerPerformanceState\n  ) {\n    this.#declarativeFingerprint = input.declarativeFingerprint;\n    this.#logger = input.logger;\n    this.#timing = new SchedulerPerformanceTiming(input.clock, initial);\n  }\n\n  public measureControlPath<T>(operation: () => T): T {\n    return this.#timing.measureControlPath(operation);\n  }\n\n  public observeDecision(observation: () => void): void {\n    this.#timing.observeDecision(observation);\n  }\n\n  /** Flushes the old state before admission changes the real Scheduler state. */\n  public beforeAdmission(taskId: string, runningTaskIds: readonly string[]): void {\n    this.#admittedTaskIds.add(taskId);\n    this.#completionTailActiveTaskIds = Object.freeze([...runningTaskIds, taskId]);\n    const boundary = this.#timing.boundary();\n    if (boundary === undefined) return;\n    const admissionDelay = this.#timing.takeAdmissionDelay(taskId);\n    if (admissionDelay === undefined) return this.#timing.invalidate(\"integral-invalid\");\n    this.#chronologyByTaskId.set(taskId, {\n      admissionDelay,\n      admittedAt: boundary,\n      settledAt: undefined\n    });\n  }\n\n  /** Flushes the old state before blocked/cancelled changes the real Scheduler state. */\n  public beforePendingSettlement(taskIds: readonly string[] = []): void {\n    const lastTaskId = taskIds.at(-1);\n    if (lastTaskId !== undefined) this.#lastSettledTaskId = lastTaskId;\n    this.#timing.boundary();\n  }\n\n  /** Flushes the old running interval before removing the actual running Task. */\n  public beforeRunningSettlement(taskId: string): void {\n    this.#lastSettledTaskId = taskId;\n    const boundary = this.#timing.boundary();\n    if (boundary === undefined) return;\n    this.#timing.closeAcceptedWait(boundary);\n    const chronology = this.#chronologyByTaskId.get(taskId);\n    if (chronology === undefined) return this.#timing.invalidate(\"integral-invalid\");\n    chronology.settledAt = boundary;\n  }\n\n  public beforeAcceptedWait(): void {\n    this.#timing.beginAcceptedWait();\n  }\n\n  public captureState(state: SchedulerPerformanceState): void {\n    this.#timing.captureState(state);\n  }\n\n  public rawMeasurement(): SchedulerRawMeasurement {\n    return this.#measurement(true);\n  }\n\n  public beginSelectedPolicyAction(taskId: string): void {\n    this.#policyMeasurement.beginSelected(taskId, this.#timing.snapshot().totals);\n  }\n\n  public beginWaitPolicyAction(): void {\n    this.#policyMeasurement.beginWait(this.#timing.snapshot().totals);\n  }\n\n  public recordEffect(effect: SchedulerMeasurementEffect): void {\n    this.#policyMeasurement.recordEffect(effect);\n  }\n\n  public policyMeasurement(): AdmissionPolicyMeasurement {\n    this.#timing.boundary();\n    this.#completePolicyAction();\n    return this.#policyMeasurement.snapshot(this.#cumulativeMeasurement());\n  }\n\n  public completePendingActionObservation(): void {\n    this.#timing.boundary();\n    this.#completePolicyAction();\n  }\n\n  public admittedTaskIds(): readonly string[] {\n    return Object.freeze([...this.#admittedTaskIds]);\n  }\n\n  /** Internal default terminal hook; it contains writer failure without runner special-casing. */\n  public defaultSummaryHook(): SchedulerMeasurementHook | undefined {\n    if (this.#logger === undefined) return undefined;\n    const logger = this.#logger;\n    return (context) => {\n      try {\n        logger.observe({\n          event: \"scheduler.summary\",\n          tags: diagnosticTags(\"SUMMARY\"),\n          details: summaryFromSchedulerMeasurement(context.rawMeasurement)\n        });\n      } catch {\n        // Summary writer failure is contained by this hook, not the shared runner.\n      }\n    };\n  }\n\n  #completePolicyAction(): void {\n    const timing = this.#timing.snapshot();\n    this.#policyMeasurement.complete(timing.totals, timing.timing);\n  }\n\n  #cumulativeMeasurement(): SchedulerDecisionMeasurementCumulative {\n    const snapshot = this.#timing.snapshot();\n    const facts = Object.freeze({\n      declarativeFingerprint: this.#declarativeFingerprint,\n      discrete: Object.freeze({\n        acceptedWaitCount: snapshot.acceptedWaitCount,\n        admittedCount: this.#admittedTaskIds.size,\n        maxRunning: snapshot.maxRunning\n      }),\n      peaks: snapshot.peaks\n    });\n    if (snapshot.timing.availability === \"unavailable\") {\n      return Object.freeze({ ...facts, timing: snapshot.timing });\n    }\n    return Object.freeze({\n      ...facts,\n      timing: snapshot.timing,\n      timingFacts: Object.freeze({\n        acceptedWaitMs: snapshot.acceptedWaitMs,\n        effectiveCapacitySlotMs: snapshot.totals.effectiveCapacitySlotMs,\n        rootCapacitySlotMs: snapshot.totals.rootCapacitySlotMs,\n        taskSlotMs: snapshot.totals.taskSlotMs\n      })\n    });\n  }\n\n  #measurement(terminal: boolean): SchedulerRawMeasurement {\n    const endedAt = this.#timing.boundary();\n    if (terminal && endedAt !== undefined) this.#timing.closeAcceptedWait(endedAt);\n    const snapshot = this.#timing.snapshot();\n    const facts = Object.freeze({\n      declarativeFingerprint: this.#declarativeFingerprint,\n      discrete: Object.freeze({\n        acceptedWaitCount: snapshot.acceptedWaitCount,\n        admittedCount: this.#admittedTaskIds.size,\n        completionTailActiveTaskIds: Object.freeze([...this.#completionTailActiveTaskIds]),\n        lastSettledTaskId: this.#lastSettledTaskId ?? null,\n        maxRunning: snapshot.maxRunning\n      }),\n      peaks: snapshot.peaks\n    });\n    if (snapshot.timing.availability === \"unavailable\") {\n      return Object.freeze({ ...facts, timing: snapshot.timing });\n    }\n    if (endedAt === undefined)\n      throw new Error(\"available Scheduler timing has no terminal boundary\");\n    return Object.freeze({\n      ...facts,\n      timing: snapshot.timing,\n      timingFacts: Object.freeze({\n        acceptedWaitMs: snapshot.acceptedWaitMs,\n        admissions: Object.freeze(this.#admissionMeasurements()),\n        effectiveCapacitySlotMs: snapshot.totals.effectiveCapacitySlotMs,\n        endedAtMonotonicMs: endedAt,\n        rootCapacitySlotMs: snapshot.totals.rootCapacitySlotMs,\n        schedulerControlPathMs: snapshot.schedulerControlPathMs,\n        schedulerDecisionObservationMs: snapshot.decisionObservationMs,\n        startedAtMonotonicMs: snapshot.startedAtMonotonicMs ?? endedAt,\n        taskSlotMs: snapshot.totals.taskSlotMs\n      })\n    });\n  }\n\n  #admissionMeasurements(): SchedulerMeasurementAdmission[] {\n    const pendingByTaskId = new Map(\n      this.#timing\n        .pendingAdmissionDelays()\n        .map(({ admissionDelay, taskId }) => [taskId, admissionDelay])\n    );\n    const taskIds = new Set([...pendingByTaskId.keys(), ...this.#chronologyByTaskId.keys()]);\n    return [...taskIds]\n      .map((taskId) => this.#admissionMeasurement(taskId, pendingByTaskId))\n      .sort((left, right) => compareText(left.taskId, right.taskId));\n  }\n\n  #admissionMeasurement(\n    taskId: string,\n    pendingByTaskId: ReadonlyMap<string, AdmissionDelayBreakdown>\n  ): SchedulerMeasurementAdmission {\n    const chronology = this.#chronologyByTaskId.get(taskId);\n    const admissionDelay = chronology?.admissionDelay ?? pendingByTaskId.get(taskId);\n    if (admissionDelay === undefined)\n      throw new Error(`missing admission measurement for ${taskId}`);\n    return Object.freeze({\n      admissionDelay,\n      admittedAtMonotonicMs: chronology?.admittedAt ?? null,\n      settledAtMonotonicMs: chronology?.settledAt ?? null,\n      taskId\n    });\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"]}

package/dist/esm/project-run/task-scheduler/measurement/integrals.mjs

@@ -0,0 +1,116 @@
+/** Accumulates interval-weighted capacity and admission-delay measurements. */
+export class SchedulerPerformanceIntegrals {
+    #taskSlotMs = 0;
+    #rootCapacitySlotMs = 0;
+    #effectiveCapacitySlotMs = 0;
+    #mutexBlockedTaskMs = 0;
+    #capacityBlockedTaskMs = 0;
+    #admissiblePendingTaskMs = 0;
+    #peakAdmissionViablePendingTaskCount = 0;
+    #peakMutexBlockedTaskCount = 0;
+    #peakCapacityBlockedTaskCount = 0;
+    #peakAdmissiblePendingTaskCount = 0;
+    #admissionDelayByTaskId = new Map();
+    installPendingProjection(pendingTasks, timingAvailable) {
+        this.#peakAdmissionViablePendingTaskCount = Math.max(this.#peakAdmissionViablePendingTaskCount, pendingTasks.length);
+        this.#peakMutexBlockedTaskCount = Math.max(this.#peakMutexBlockedTaskCount, pendingCount(pendingTasks, "mutex-blocked"));
+        this.#peakCapacityBlockedTaskCount = Math.max(this.#peakCapacityBlockedTaskCount, pendingCount(pendingTasks, "capacity-blocked"));
+        this.#peakAdmissiblePendingTaskCount = Math.max(this.#peakAdmissiblePendingTaskCount, pendingCount(pendingTasks, "admissible-pending"));
+        if (!timingAvailable)
+            return;
+        for (const pendingTask of pendingTasks) {
+            if (this.#admissionDelayByTaskId.has(pendingTask.taskId))
+                continue;
+            this.#admissionDelayByTaskId.set(pendingTask.taskId, {
+                admissiblePendingMs: 0,
+                capacityBlockedMs: 0,
+                mutexBlockedMs: 0
+            });
+        }
+    }
+    /** Returns false when an interval cannot be represented as finite non-negative totals. */
+    addInterval(elapsedMs, state) {
+        const contribution = intervalContribution(elapsedMs, state);
+        if (contribution === undefined)
+            return false;
+        this.#taskSlotMs += contribution.taskSlotMs;
+        this.#rootCapacitySlotMs += contribution.rootCapacitySlotMs;
+        this.#effectiveCapacitySlotMs += contribution.effectiveCapacitySlotMs;
+        this.#mutexBlockedTaskMs += contribution.mutexBlockedTaskMs;
+        this.#capacityBlockedTaskMs += contribution.capacityBlockedTaskMs;
+        this.#admissiblePendingTaskMs += contribution.admissiblePendingTaskMs;
+        if (!finiteContribution(this.totals()))
+            return false;
+        return this.#addAdmissionDelay(elapsedMs, state.admissionViablePendingTasks);
+    }
+    takeAdmissionDelay(taskId) {
+        const delay = this.#admissionDelayByTaskId.get(taskId);
+        if (delay === undefined)
+            return undefined;
+        this.#admissionDelayByTaskId.delete(taskId);
+        return Object.freeze({ ...delay });
+    }
+    pendingAdmissionDelays() {
+        return Object.freeze([...this.#admissionDelayByTaskId].map(([taskId, admissionDelay]) => Object.freeze({ admissionDelay: Object.freeze({ ...admissionDelay }), taskId })));
+    }
+    peaks() {
+        return Object.freeze({
+            admissionViablePendingTaskCount: this.#peakAdmissionViablePendingTaskCount,
+            admissiblePendingTaskCount: this.#peakAdmissiblePendingTaskCount,
+            capacityBlockedTaskCount: this.#peakCapacityBlockedTaskCount,
+            mutexBlockedTaskCount: this.#peakMutexBlockedTaskCount
+        });
+    }
+    totals() {
+        return Object.freeze({
+            admissiblePendingTaskMs: this.#admissiblePendingTaskMs,
+            acceptedWaitMs: 0,
+            capacityBlockedTaskMs: this.#capacityBlockedTaskMs,
+            effectiveCapacitySlotMs: this.#effectiveCapacitySlotMs,
+            mutexBlockedTaskMs: this.#mutexBlockedTaskMs,
+            rootCapacitySlotMs: this.#rootCapacitySlotMs,
+            taskSlotMs: this.#taskSlotMs
+        });
+    }
+    #addAdmissionDelay(elapsedMs, pendingTasks) {
+        for (const pendingTask of pendingTasks) {
+            const delay = this.#admissionDelayByTaskId.get(pendingTask.taskId);
+            if (delay === undefined)
+                continue;
+            addDelay(delay, pendingTask.kind, elapsedMs);
+            if (!finiteAdmissionDelay(delay))
+                return false;
+        }
+        return true;
+    }
+}
+function intervalContribution(elapsedMs, state) {
+    const contribution = Object.freeze({
+        admissiblePendingTaskMs: elapsedMs * pendingCount(state.admissionViablePendingTasks, "admissible-pending"),
+        acceptedWaitMs: 0,
+        capacityBlockedTaskMs: elapsedMs * pendingCount(state.admissionViablePendingTasks, "capacity-blocked"),
+        effectiveCapacitySlotMs: elapsedMs * state.effectiveMaxParallel,
+        mutexBlockedTaskMs: elapsedMs * pendingCount(state.admissionViablePendingTasks, "mutex-blocked"),
+        rootCapacitySlotMs: elapsedMs * state.rootMaxParallel,
+        taskSlotMs: elapsedMs * state.running
+    });
+    return finiteContribution(contribution) ? contribution : undefined;
+}
+function finiteContribution(contribution) {
+    return Object.values(contribution).every((value) => Number.isFinite(value) && value >= 0);
+}
+function addDelay(delay, kind, elapsedMs) {
+    if (kind === "mutex-blocked")
+        delay.mutexBlockedMs += elapsedMs;
+    if (kind === "capacity-blocked")
+        delay.capacityBlockedMs += elapsedMs;
+    if (kind === "admissible-pending")
+        delay.admissiblePendingMs += elapsedMs;
+}
+function finiteAdmissionDelay(delay) {
+    return Object.values(delay).every((value) => Number.isFinite(value) && value >= 0);
+}
+function pendingCount(pendingTasks, kind) {
+    return pendingTasks.filter((task) => task.kind === kind).length;
+}
+//# sourceMappingURL=integrals.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"integrals.mjs","sourceRoot":"","sources":["../../../../../src/project-run/task-scheduler/measurement/integrals.ts"],"names":[],"mappings":"AAsBA,+EAA+E;AAC/E,MAAM,OAAO,6BAA6B;IACxC,WAAW,GAAG,CAAC,CAAC;IAChB,mBAAmB,GAAG,CAAC,CAAC;IACxB,wBAAwB,GAAG,CAAC,CAAC;IAC7B,mBAAmB,GAAG,CAAC,CAAC;IACxB,sBAAsB,GAAG,CAAC,CAAC;IAC3B,wBAAwB,GAAG,CAAC,CAAC;IAC7B,oCAAoC,GAAG,CAAC,CAAC;IACzC,0BAA0B,GAAG,CAAC,CAAC;IAC/B,6BAA6B,GAAG,CAAC,CAAC;IAClC,+BAA+B,GAAG,CAAC,CAAC;IAC3B,uBAAuB,GAAG,IAAI,GAAG,EAA0C,CAAC;IAE9E,wBAAwB,CAC7B,YAAmD,EACnD,eAAwB;QAExB,IAAI,CAAC,oCAAoC,GAAG,IAAI,CAAC,GAAG,CAClD,IAAI,CAAC,oCAAoC,EACzC,YAAY,CAAC,MAAM,CACpB,CAAC;QACF,IAAI,CAAC,0BAA0B,GAAG,IAAI,CAAC,GAAG,CACxC,IAAI,CAAC,0BAA0B,EAC/B,YAAY,CAAC,YAAY,EAAE,eAAe,CAAC,CAC5C,CAAC;QACF,IAAI,CAAC,6BAA6B,GAAG,IAAI,CAAC,GAAG,CAC3C,IAAI,CAAC,6BAA6B,EAClC,YAAY,CAAC,YAAY,EAAE,kBAAkB,CAAC,CAC/C,CAAC;QACF,IAAI,CAAC,+BAA+B,GAAG,IAAI,CAAC,GAAG,CAC7C,IAAI,CAAC,+BAA+B,EACpC,YAAY,CAAC,YAAY,EAAE,oBAAoB,CAAC,CACjD,CAAC;QACF,IAAI,CAAC,eAAe;YAAE,OAAO;QAC7B,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC;gBAAE,SAAS;YACnE,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE;gBACnD,mBAAmB,EAAE,CAAC;gBACtB,iBAAiB,EAAE,CAAC;gBACpB,cAAc,EAAE,CAAC;aAClB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,0FAA0F;IACnF,WAAW,CAAC,SAAiB,EAAE,KAAgC;QACpE,MAAM,YAAY,GAAG,oBAAoB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAC5D,IAAI,YAAY,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAC7C,IAAI,CAAC,WAAW,IAAI,YAAY,CAAC,UAAU,CAAC;QAC5C,IAAI,CAAC,mBAAmB,IAAI,YAAY,CAAC,kBAAkB,CAAC;QAC5D,IAAI,CAAC,wBAAwB,IAAI,YAAY,CAAC,uBAAuB,CAAC;QACtE,IAAI,CAAC,mBAAmB,IAAI,YAAY,CAAC,kBAAkB,CAAC;QAC5D,IAAI,CAAC,sBAAsB,IAAI,YAAY,CAAC,qBAAqB,CAAC;QAClE,IAAI,CAAC,wBAAwB,IAAI,YAAY,CAAC,uBAAuB,CAAC;QACtE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;QACrD,OAAO,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;IAC/E,CAAC;IAEM,kBAAkB,CAAC,MAAc;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvD,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC1C,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5C,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;IACrC,CAAC;IAEM,sBAAsB;QAI3B,OAAO,MAAM,CAAC,MAAM,CAClB,CAAC,GAAG,IAAI,CAAC,uBAAuB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,EAAE,EAAE,CACjE,MAAM,CAAC,MAAM,CAAC,EAAE,cAAc,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,cAAc,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAChF,CACF,CAAC;IACJ,CAAC;IAEM,KAAK;QACV,OAAO,MAAM,CAAC,MAAM,CAAC;YACnB,+BAA+B,EAAE,IAAI,CAAC,oCAAoC;YAC1E,0BAA0B,EAAE,IAAI,CAAC,+BAA+B;YAChE,wBAAwB,EAAE,IAAI,CAAC,6BAA6B;YAC5D,qBAAqB,EAAE,IAAI,CAAC,0BAA0B;SACvD,CAAC,CAAC;IACL,CAAC;IAEM,MAAM;QACX,OAAO,MAAM,CAAC,MAAM,CAAC;YACnB,uBAAuB,EAAE,IAAI,CAAC,wBAAwB;YACtD,cAAc,EAAE,CAAC;YACjB,qBAAqB,EAAE,IAAI,CAAC,sBAAsB;YAClD,uBAAuB,EAAE,IAAI,CAAC,wBAAwB;YACtD,kBAAkB,EAAE,IAAI,CAAC,mBAAmB;YAC5C,kBAAkB,EAAE,IAAI,CAAC,mBAAmB;YAC5C,UAAU,EAAE,IAAI,CAAC,WAAW;SAC7B,CAAC,CAAC;IACL,CAAC;IAED,kBAAkB,CAChB,SAAiB,EACjB,YAAmD;QAEnD,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YACnE,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS;YAClC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAC7C,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;QACjD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED,SAAS,oBAAoB,CAC3B,SAAiB,EACjB,KAAgC;IAEhC,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC;QACjC,uBAAuB,EACrB,SAAS,GAAG,YAAY,CAAC,KAAK,CAAC,2BAA2B,EAAE,oBAAoB,CAAC;QACnF,cAAc,EAAE,CAAC;QACjB,qBAAqB,EACnB,SAAS,GAAG,YAAY,CAAC,KAAK,CAAC,2BAA2B,EAAE,kBAAkB,CAAC;QACjF,uBAAuB,EAAE,SAAS,GAAG,KAAK,CAAC,oBAAoB;QAC/D,kBAAkB,EAChB,SAAS,GAAG,YAAY,CAAC,KAAK,CAAC,2BAA2B,EAAE,eAAe,CAAC;QAC9E,kBAAkB,EAAE,SAAS,GAAG,KAAK,CAAC,eAAe;QACrD,UAAU,EAAE,SAAS,GAAG,KAAK,CAAC,OAAO;KACtC,CAAC,CAAC;IACH,OAAO,kBAAkB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC;AACrE,CAAC;AAED,SAAS,kBAAkB,CAAC,YAAsD;IAChF,OAAO,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;AAC5F,CAAC;AAED,SAAS,QAAQ,CACf,KAAqC,EACrC,IAAwC,EACxC,SAAiB;IAEjB,IAAI,IAAI,KAAK,eAAe;QAAE,KAAK,CAAC,cAAc,IAAI,SAAS,CAAC;IAChE,IAAI,IAAI,KAAK,kBAAkB;QAAE,KAAK,CAAC,iBAAiB,IAAI,SAAS,CAAC;IACtE,IAAI,IAAI,KAAK,oBAAoB;QAAE,KAAK,CAAC,mBAAmB,IAAI,SAAS,CAAC;AAC5E,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAqC;IACjE,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC;AACrF,CAAC;AAED,SAAS,YAAY,CACnB,YAAmD,EACnD,IAAwC;IAExC,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,MAAM,CAAC;AAClE,CAAC","sourcesContent":["import type { SchedulerMeasurementIntervalContribution } from \"../../../project-definition/project-definition.ts\";\nimport type { AdmissionViablePendingTask, SchedulerPerformanceState } from \"./diagnostics.ts\";\n\nexport type AdmissionDelayBreakdown = Readonly<{\n  readonly admissiblePendingMs: number;\n  readonly capacityBlockedMs: number;\n  readonly mutexBlockedMs: number;\n}>;\n\ntype MutableAdmissionDelayBreakdown = {\n  admissiblePendingMs: number;\n  capacityBlockedMs: number;\n  mutexBlockedMs: number;\n};\n\nexport type SchedulerPerformancePeaks = Readonly<{\n  readonly admissionViablePendingTaskCount: number;\n  readonly admissiblePendingTaskCount: number;\n  readonly capacityBlockedTaskCount: number;\n  readonly mutexBlockedTaskCount: number;\n}>;\n\n/** Accumulates interval-weighted capacity and admission-delay measurements. */\nexport class SchedulerPerformanceIntegrals {\n  #taskSlotMs = 0;\n  #rootCapacitySlotMs = 0;\n  #effectiveCapacitySlotMs = 0;\n  #mutexBlockedTaskMs = 0;\n  #capacityBlockedTaskMs = 0;\n  #admissiblePendingTaskMs = 0;\n  #peakAdmissionViablePendingTaskCount = 0;\n  #peakMutexBlockedTaskCount = 0;\n  #peakCapacityBlockedTaskCount = 0;\n  #peakAdmissiblePendingTaskCount = 0;\n  readonly #admissionDelayByTaskId = new Map<string, MutableAdmissionDelayBreakdown>();\n\n  public installPendingProjection(\n    pendingTasks: readonly AdmissionViablePendingTask[],\n    timingAvailable: boolean\n  ): void {\n    this.#peakAdmissionViablePendingTaskCount = Math.max(\n      this.#peakAdmissionViablePendingTaskCount,\n      pendingTasks.length\n    );\n    this.#peakMutexBlockedTaskCount = Math.max(\n      this.#peakMutexBlockedTaskCount,\n      pendingCount(pendingTasks, \"mutex-blocked\")\n    );\n    this.#peakCapacityBlockedTaskCount = Math.max(\n      this.#peakCapacityBlockedTaskCount,\n      pendingCount(pendingTasks, \"capacity-blocked\")\n    );\n    this.#peakAdmissiblePendingTaskCount = Math.max(\n      this.#peakAdmissiblePendingTaskCount,\n      pendingCount(pendingTasks, \"admissible-pending\")\n    );\n    if (!timingAvailable) return;\n    for (const pendingTask of pendingTasks) {\n      if (this.#admissionDelayByTaskId.has(pendingTask.taskId)) continue;\n      this.#admissionDelayByTaskId.set(pendingTask.taskId, {\n        admissiblePendingMs: 0,\n        capacityBlockedMs: 0,\n        mutexBlockedMs: 0\n      });\n    }\n  }\n\n  /** Returns false when an interval cannot be represented as finite non-negative totals. */\n  public addInterval(elapsedMs: number, state: SchedulerPerformanceState): boolean {\n    const contribution = intervalContribution(elapsedMs, state);\n    if (contribution === undefined) return false;\n    this.#taskSlotMs += contribution.taskSlotMs;\n    this.#rootCapacitySlotMs += contribution.rootCapacitySlotMs;\n    this.#effectiveCapacitySlotMs += contribution.effectiveCapacitySlotMs;\n    this.#mutexBlockedTaskMs += contribution.mutexBlockedTaskMs;\n    this.#capacityBlockedTaskMs += contribution.capacityBlockedTaskMs;\n    this.#admissiblePendingTaskMs += contribution.admissiblePendingTaskMs;\n    if (!finiteContribution(this.totals())) return false;\n    return this.#addAdmissionDelay(elapsedMs, state.admissionViablePendingTasks);\n  }\n\n  public takeAdmissionDelay(taskId: string): AdmissionDelayBreakdown | undefined {\n    const delay = this.#admissionDelayByTaskId.get(taskId);\n    if (delay === undefined) return undefined;\n    this.#admissionDelayByTaskId.delete(taskId);\n    return Object.freeze({ ...delay });\n  }\n\n  public pendingAdmissionDelays(): readonly Readonly<{\n    readonly admissionDelay: AdmissionDelayBreakdown;\n    readonly taskId: string;\n  }>[] {\n    return Object.freeze(\n      [...this.#admissionDelayByTaskId].map(([taskId, admissionDelay]) =>\n        Object.freeze({ admissionDelay: Object.freeze({ ...admissionDelay }), taskId })\n      )\n    );\n  }\n\n  public peaks(): SchedulerPerformancePeaks {\n    return Object.freeze({\n      admissionViablePendingTaskCount: this.#peakAdmissionViablePendingTaskCount,\n      admissiblePendingTaskCount: this.#peakAdmissiblePendingTaskCount,\n      capacityBlockedTaskCount: this.#peakCapacityBlockedTaskCount,\n      mutexBlockedTaskCount: this.#peakMutexBlockedTaskCount\n    });\n  }\n\n  public totals(): SchedulerMeasurementIntervalContribution {\n    return Object.freeze({\n      admissiblePendingTaskMs: this.#admissiblePendingTaskMs,\n      acceptedWaitMs: 0,\n      capacityBlockedTaskMs: this.#capacityBlockedTaskMs,\n      effectiveCapacitySlotMs: this.#effectiveCapacitySlotMs,\n      mutexBlockedTaskMs: this.#mutexBlockedTaskMs,\n      rootCapacitySlotMs: this.#rootCapacitySlotMs,\n      taskSlotMs: this.#taskSlotMs\n    });\n  }\n\n  #addAdmissionDelay(\n    elapsedMs: number,\n    pendingTasks: readonly AdmissionViablePendingTask[]\n  ): boolean {\n    for (const pendingTask of pendingTasks) {\n      const delay = this.#admissionDelayByTaskId.get(pendingTask.taskId);\n      if (delay === undefined) continue;\n      addDelay(delay, pendingTask.kind, elapsedMs);\n      if (!finiteAdmissionDelay(delay)) return false;\n    }\n    return true;\n  }\n}\n\nfunction intervalContribution(\n  elapsedMs: number,\n  state: SchedulerPerformanceState\n): SchedulerMeasurementIntervalContribution | undefined {\n  const contribution = Object.freeze({\n    admissiblePendingTaskMs:\n      elapsedMs * pendingCount(state.admissionViablePendingTasks, \"admissible-pending\"),\n    acceptedWaitMs: 0,\n    capacityBlockedTaskMs:\n      elapsedMs * pendingCount(state.admissionViablePendingTasks, \"capacity-blocked\"),\n    effectiveCapacitySlotMs: elapsedMs * state.effectiveMaxParallel,\n    mutexBlockedTaskMs:\n      elapsedMs * pendingCount(state.admissionViablePendingTasks, \"mutex-blocked\"),\n    rootCapacitySlotMs: elapsedMs * state.rootMaxParallel,\n    taskSlotMs: elapsedMs * state.running\n  });\n  return finiteContribution(contribution) ? contribution : undefined;\n}\n\nfunction finiteContribution(contribution: SchedulerMeasurementIntervalContribution): boolean {\n  return Object.values(contribution).every((value) => Number.isFinite(value) && value >= 0);\n}\n\nfunction addDelay(\n  delay: MutableAdmissionDelayBreakdown,\n  kind: AdmissionViablePendingTask[\"kind\"],\n  elapsedMs: number\n): void {\n  if (kind === \"mutex-blocked\") delay.mutexBlockedMs += elapsedMs;\n  if (kind === \"capacity-blocked\") delay.capacityBlockedMs += elapsedMs;\n  if (kind === \"admissible-pending\") delay.admissiblePendingMs += elapsedMs;\n}\n\nfunction finiteAdmissionDelay(delay: MutableAdmissionDelayBreakdown): boolean {\n  return Object.values(delay).every((value) => Number.isFinite(value) && value >= 0);\n}\n\nfunction pendingCount(\n  pendingTasks: readonly AdmissionViablePendingTask[],\n  kind: AdmissionViablePendingTask[\"kind\"]\n): number {\n  return pendingTasks.filter((task) => task.kind === kind).length;\n}\n"]}