@theokit/sdk 4.40.0 → 4.41.1

package/dist/{chunk-WJOLIPEM.js → chunk-EON4YTR6.js}

@@ -1,7 +1,7 @@
-import { WorkflowNestedError, WorkflowDuplicateStepIdError } from './chunk-NHXPQN44.js';
+import { WorkflowNestedError, WorkflowDuplicateStepIdError } from './chunk-HK4HRLWE.js';
 import { PersistenceSchema } from './chunk-CAH3G4IS.js';
 import { toJsonSchema } from './chunk-4VPXM6UU.js';
-import { sanitizeIdentifier } from './chunk-IEKSEAIV.js';
+import { sanitizeIdentifier } from './chunk-6FSQ3CHQ.js';
 import { z } from 'zod';
 
 // src/internal/workflow/event-stream.ts
@@ -246,10 +246,10 @@ var Workflow = class {
    * `run.status === "failed"`.
    */
   async run(input, opts) {
-    const { executeWorkflow } = await import('./executor-PCRX3533.js');
+    const { executeWorkflow } = await import('./executor-VQLTQY53.js');
     const result = await executeWorkflow(this._options, this._steps, input, opts);
     if (opts?.task !== void 0) {
-      const { submit: taskSubmit } = await import('./registry-AXQXPLFH.js');
+      const { submit: taskSubmit } = await import('./registry-PPFMCM4A.js');
       const taskOpts = opts.task === true ? {} : opts.task;
       const id = taskOpts.id ?? `wf-${result.id}`;
       await taskSubmit({
@@ -288,7 +288,7 @@ var Workflow = class {
   stream(input, opts) {
     const queue = createEventStream();
     const result = (async () => {
-      const { executeWorkflow } = await import('./executor-PCRX3533.js');
+      const { executeWorkflow } = await import('./executor-VQLTQY53.js');
       try {
         return await executeWorkflow(this._options, this._steps, input, {
           ...opts,
@@ -305,7 +305,7 @@ var Workflow = class {
    * `WorkflowSnapshotNotFoundError` if `runId` is unknown.
    */
   static async resume(opts) {
-    const { resumeWorkflow } = await import('./executor-PCRX3533.js');
+    const { resumeWorkflow } = await import('./executor-VQLTQY53.js');
     return resumeWorkflow(opts);
   }
 };
@@ -411,5 +411,5 @@ function walkStepsValidating(steps, seen) {
 }
 
 export { Workflow, WorkflowBuilder, WorkflowToolError, agentStep, cloneWorkflow, fn, workflowAsTool, workflowStep };
-//# sourceMappingURL=chunk-WJOLIPEM.js.map
-//# sourceMappingURL=chunk-WJOLIPEM.js.map
+//# sourceMappingURL=chunk-EON4YTR6.js.map
+//# sourceMappingURL=chunk-EON4YTR6.js.map

package/dist/{chunk-WJOLIPEM.js.map → chunk-EON4YTR6.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/internal/workflow/event-stream.ts","../src/workflow.ts"],"names":[],"mappings":";;;;;;;AAgBO,SAAS,iBAAA,GAAyC;AACvD,EAAA,MAAM,SAA0B,EAAC;AACjC,EAAA,MAAM,UAA6D,EAAC;AACpE,EAAA,IAAI,KAAA,GAAQ,KAAA;AAEZ,EAAA,MAAM,MAAA,GAA8B;AAAA,IAClC,KAAK,KAAA,EAA4B;AAC/B,MAAA,IAAI,KAAA,EAAO;AACX,MAAA,MAAM,MAAA,GAAS,QAAQ,KAAA,EAAM;AAC7B,MAAA,IAAI,MAAA,KAAW,QAAW,MAAA,CAAO,EAAE,OAAO,KAAA,EAAO,IAAA,EAAM,OAAO,CAAA;AAAA,WACzD,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,IACxB,CAAA;AAAA,IACA,GAAA,GAAY;AACV,MAAA,IAAI,KAAA,EAAO;AACX,MAAA,KAAA,GAAQ,IAAA;AACR,MAAA,KAAA,MAAW,MAAA,IAAU,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,EAAG,MAAA,CAAO,EAAE,KAAA,EAAO,MAAA,EAAW,IAAA,EAAM,IAAA,EAAM,CAAA;AAAA,IACjF,CAAA;AAAA,IACA,IAAA,GAA+C;AAC7C,MAAA,MAAM,QAAA,GAAW,OAAO,KAAA,EAAM;AAC9B,MAAA,IAAI,QAAA,KAAa,MAAA,EAAW,OAAO,OAAA,CAAQ,OAAA,CAAQ,EAAE,KAAA,EAAO,QAAA,EAAU,IAAA,EAAM,KAAA,EAAO,CAAA;AACnF,MAAA,IAAI,KAAA,SAAc,OAAA,CAAQ,OAAA,CAAQ,EAAE,KAAA,EAAO,MAAA,EAAW,IAAA,EAAM,IAAA,EAAM,CAAA;AAClE,MAAA,OAAO,IAAI,OAAA,CAAQ,CAAC,YAAY,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAC,CAAA;AAAA,IACvD,CAAA;AAAA;AAAA;AAAA,IAGA,MAAA,GAAiD;AAC/C,MAAA,MAAA,CAAO,GAAA,EAAI;AACX,MAAA,MAAA,CAAO,MAAA,GAAS,CAAA;AAChB,MAAA,OAAO,QAAQ,OAAA,CAAQ,EAAE,OAAO,MAAA,EAAW,IAAA,EAAM,MAAM,CAAA;AAAA,IACzD,CAAA;AAAA,IACA,CAAC,MAAA,CAAO,aAAa,CAAA,GAAyB;AAC5C,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,GACF;AACA,EAAA,OAAO,MAAA;AACT;;;ACOA,IAAM,iBAAA,GAAoB,EAAE,MAAA,CAAO;AAAA;AAAA,EAEjC,WAAA,EAAa,CAAA,CACV,MAAA,EAAO,CACP,GAAA,CAAI,mCAAmC,CAAA,CACvC,GAAA,CAAI,CAAA,EAAG,gCAAgC,CAAA,CACvC,GAAA,CAAI,IAAI,iCAAiC,CAAA;AAAA,EAC5C,gBAAA,EAAkB,EAAE,MAAA,EAAO,CAAE,KAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,EAAS;AAAA,EACnD,oBAAoB,CAAA,CAAE,MAAA,GAAS,GAAA,CAAI,CAAC,EAAE,QAAA,EAAS;AAAA,EAC/C,gBAAA,EAAkB,EAAE,MAAA,EAAO,CAAE,KAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,EAAS;AAAA,EACnD,oBAAoB,CAAA,CAAE,KAAA,CAAM,EAAE,MAAA,EAAQ,EAAE,QAAA;AAC1C,CAAC,CAAA;AAED,IAAM,qBAAA,GAAwB,EAAE,MAAA,CAAO;AAAA,EACrC,IAAA,EAAM,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,IAAI,GAAG,CAAA;AAAA,EAC/B,WAAA,EAAa,iBAAA;AAAA;AAAA;AAAA;AAAA,EAIb,WAAA,EAAa,CAAA,CAAE,MAAA,EAAgB,CAAE,QAAA,EAAS;AAAA,EAC1C,YAAA,EAAc,CAAA,CAAE,MAAA,EAAgB,CAAE,QAAA;AACpC,CAAC,CAAA;AAIM,IAAM,kBAAN,MAA2D;AAAA;AAAA,EAKhE,YAA6B,OAAA,EAA0B;AAA1B,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAAA,EAA2B;AAAA,EAA3B,OAAA;AAAA,EAJZ,SAAiB,EAAC;AAAA,EAC3B,UAAA,GAAa,KAAA;AAAA;AAAA,EAMrB,IAAI,OAAA,GAA+B;AACjC,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA,EAGA,KAAmB,IAAA,EAAyC;AAC1D,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,cAAA,CAAe,KAAK,EAAE,CAAA;AACtB,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,QAAA,CACE,UACA,IAAA,EACoC;AACpC,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,SAAA,EAAY,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AACrD,IAAA,cAAA,CAAe,EAAE,CAAA;AACjB,IAAA,KAAA,MAAW,UAAU,QAAA,EAAU;AAC7B,MAAA,KAAA,MAAW,KAAA,IAAS,MAAA,EAAQ,cAAA,CAAe,KAAA,CAAM,EAAE,CAAA;AAAA,IACrD;AACA,IAAA,MAAM,IAAA,GAAqB;AAAA,MACzB,IAAA,EAAM,UAAA;AAAA,MACN,EAAA;AAAA,MACA,QAAA;AAAA,MACA,GAAI,MAAM,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,EAAY,GAAI,EAAC;AAAA,MAC3E,GAAI,MAAM,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,EAAY,GAAI;AAAC,KAC7E;AACA,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,MAAA,CACE,YACA,IAAA,EACkC;AAClC,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,OAAA,EAAU,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AACnD,IAAA,cAAA,CAAe,EAAE,CAAA;AACjB,IAAA,MAAM,IAAA,GAAmB;AAAA,MACvB,IAAA,EAAM,QAAA;AAAA,MACN,EAAA;AAAA,MACA,UAAA;AAAA,MACA,GAAI,MAAM,QAAA,KAAa,MAAA,GAAY,EAAE,QAAA,EAAU,IAAA,CAAK,QAAA,EAAS,GAAI;AAAC,KACpE;AACA,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,OAAA,CACE,YAAA,EACA,IAAA,EACA,IAAA,EACoC;AACpC,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,QAAA,EAAW,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AACpD,IAAA,cAAA,CAAe,EAAE,CAAA;AACjB,IAAA,cAAA,CAAe,YAAY,CAAA;AAC3B,IAAA,cAAA,CAAe,KAAK,EAAE,CAAA;AACtB,IAAA,MAAM,IAAA,GAAoB;AAAA,MACxB,IAAA,EAAM,SAAA;AAAA,MACN,EAAA;AAAA,MACA,YAAA;AAAA,MACA,IAAA;AAAA,MACA,GAAI,MAAM,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,EAAY,GAAI;AAAC,KAC7E;AACA,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,OAAA,CACE,IAAA,EACA,MAAA,EACA,IAAA,EACkC;AAClC,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,QAAA,EAAW,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AACpD,IAAA,cAAA,CAAe,EAAE,CAAA;AACjB,IAAA,cAAA,CAAe,KAAK,EAAE,CAAA;AACtB,IAAA,MAAM,IAAA,GAAoB;AAAA,MACxB,IAAA,EAAM,SAAA;AAAA,MACN,EAAA;AAAA,MACA,IAAA;AAAA,MACA,MAAA;AAAA,MACA,GAAI,MAAM,aAAA,KAAkB,MAAA,GAAY,EAAE,aAAA,EAAe,IAAA,CAAK,aAAA,EAAc,GAAI;AAAC,KACnF;AACA,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,KAAA,CAAM,YAAoB,EAAA,EAA+C;AACvE,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,MAAA,GAAS,EAAA,IAAM,CAAA,MAAA,EAAS,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AAChD,IAAA,cAAA,CAAe,MAAM,CAAA;AACrB,IAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,UAAU,CAAA,IAAK,aAAa,CAAA,EAAG;AAClD,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,8CAAA,EAAiD,UAAU,CAAA,CAAE,CAAA;AAAA,IAC/E;AACA,IAAA,MAAM,OAAkB,EAAE,IAAA,EAAM,OAAA,EAAS,EAAA,EAAI,QAAQ,UAAA,EAAW;AAChE,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,QAAQ,IAAA,EAAmF;AACzF,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,QAAA,EAAW,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AACpD,IAAA,cAAA,CAAe,EAAE,CAAA;AACjB,IAAA,MAAM,IAAA,GAAoB;AAAA,MACxB,IAAA,EAAM,SAAA;AAAA,MACN,EAAA;AAAA,MACA,GAAI,MAAM,aAAA,KAAkB,MAAA,GAAY,EAAE,aAAA,EAAe,IAAA,CAAK,aAAA,EAAc,GAAI;AAAC,KACnF;AACA,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,MAAA,GAAoC;AAClC,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,IAAA,CAAK,iBAAA,EAAkB;AACvB,IAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAElB,IAAA,MAAM,UAAA,GAAa,CAAA,GAAA,EAAM,WAAA,EAAa,CAAA,CAAA;AACtC,IAAA,OAAO,IAAI,QAAA,CAA0B,EAAE,GAAG,IAAA,CAAK,OAAA,EAAS,UAAA,EAAW,EAAG,CAAC,GAAG,IAAA,CAAK,MAAM,CAAC,CAAA;AAAA,EACxF;AAAA,EAEQ,iBAAA,GAA0B;AAChC,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,IAAA,mBAAA,CAAoB,IAAA,CAAK,QAAQ,IAAI,CAAA;AAAA,EACvC;AAAA,EAEQ,kBAAA,GAA2B;AACjC,IAAA,IAAI,KAAK,UAAA,EAAY;AACnB,MAAA,MAAM,IAAI,MAAM,uEAAuE,CAAA;AAAA,IACzF;AAAA,EACF;AACF;AAWA,SAAS,aAAa,IAAA,EAAqC;AACzD,EAAA,MAAM,OAAO,EAAE,EAAA,EAAI,KAAK,EAAA,EAAI,IAAA,EAAM,KAAK,IAAA,EAAK;AAC5C,EAAA,IAAI,IAAA,CAAK,SAAS,UAAA,EAAY;AAC5B,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,IAAA,CAAK,SAAS,IAAA,EAAK,CAAE,GAAA,CAAI,YAAY,CAAA,EAAE;AAAA,EAClE;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAC1B,IAAA,MAAM,cAAA,GAAiB,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,CAAC,GAAG,KAAK,CAAA,KAAM,KAAA,CAAM,GAAA,CAAI,YAAY,CAAC,CAAA;AACrF,IAAA,MAAM,gBAAgB,IAAA,CAAK,QAAA,IAAY,EAAC,EAAG,IAAI,YAAY,CAAA;AAC3D,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,CAAC,GAAG,cAAA,EAAgB,GAAG,YAAY,CAAA,EAAE;AAAA,EAChE;AACA,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,SAAA,IAAa,IAAA,CAAK,SAAS,SAAA,EAAW;AACtD,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,CAAC,YAAA,CAAa,IAAA,CAAK,IAAI,CAAC,CAAA,EAAE;AAAA,EACrD;AACA,EAAA,OAAO,IAAA;AACT;AAEO,IAAM,WAAN,MAAoD;AAAA;AAAA,EAEzD,WAAA,CACmB,UACA,MAAA,EACjB;AAFiB,IAAA,IAAA,CAAA,QAAA,GAAA,QAAA;AACA,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AAAA,EAChB;AAAA,EAFgB,QAAA;AAAA,EACA,MAAA;AAAA;AAAA,EAInB,IAAI,SAAA,GAA6B;AAC/B,IAAA,OAAO,IAAA,CAAK,QAAA;AAAA,EACd;AAAA;AAAA,EAEA,IAAI,OAAA,GAA+B;AACjC,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,OAAmC,OAAA,EAAmD;AAC3F,IAAA,qBAAA,CAAsB,MAAM,OAAO,CAAA;AACnC,IAAA,OAAO,IAAI,gBAAwB,OAAO,CAAA;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,QAAA,GAAgC;AAC9B,IAAA,OAAO;AAAA,MACL,IAAA,EAAM,KAAK,QAAA,CAAS,IAAA;AAAA,MACpB,KAAA,EAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,YAAY;AAAA,KACrC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,GAAA,CAAI,KAAA,EAAe,IAAA,EAA0D;AAEjF,IAAA,MAAM,EAAE,eAAA,EAAgB,GAAI,MAAM,OAAO,wBAAiC,CAAA;AAC1E,IAAA,MAAM,MAAA,GAAS,MAAM,eAAA,CAAiC,IAAA,CAAK,UAAU,IAAA,CAAK,MAAA,EAAQ,OAAO,IAAI,CAAA;AAK7F,IAAA,IAAI,IAAA,EAAM,SAAS,MAAA,EAAW;AAC5B,MAAA,MAAM,EAAE,MAAA,EAAQ,UAAA,EAAW,GAAI,MAAM,OAAO,wBAA6B,CAAA;AACzE,MAAA,MAAM,WAAW,IAAA,CAAK,IAAA,KAAS,IAAA,GAAO,KAAK,IAAA,CAAK,IAAA;AAChD,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,EAAA,IAAM,CAAA,GAAA,EAAM,OAAO,EAAE,CAAA,CAAA;AACzC,MAAA,MAAM,UAAA,CAAW;AAAA,QACf,IAAA,EAAM,UAAA;AAAA,QACN,IAAA,EAAM,OAAO,GAAA,KAAQ;AACnB,UAAA,GAAA,CAAI,IAAA,CAAK,EAAE,MAAA,EAAQ,MAAA,CAAO,QAAQ,KAAA,EAAO,MAAA,CAAO,IAAI,CAAA;AACpD,UAAA,OAAO,EAAE,QAAQ,MAAA,CAAO,MAAA,EAAQ,OAAO,MAAA,CAAO,EAAA,EAAI,MAAA,EAAQ,MAAA,CAAO,MAAA,EAAO;AAAA,QAC1E,CAAA;AAAA,QACA,EAAA;AAAA,QACA,IAAA,EAAM;AAAA,UACJ,YAAA,EAAc,KAAK,QAAA,CAAS,IAAA;AAAA,UAC5B,OAAO,MAAA,CAAO,EAAA;AAAA,UACd,QAAQ,MAAA,CAAO,MAAA;AAAA,UACf,GAAI,QAAA,CAAS,IAAA,IAAQ;AAAC,SACxB;AAAA,QACA,mBAAA,EAAqB;AAAA,OACtB,CAAA;AAAA,IACH;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,MAAA,CAAO,OAAe,IAAA,EAAoD;AACxE,IAAA,MAAM,QAAQ,iBAAA,EAAkB;AAChC,IAAA,MAAM,UAAU,YAA2C;AACzD,MAAA,MAAM,EAAE,eAAA,EAAgB,GAAI,MAAM,OAAO,wBAAiC,CAAA;AAC1E,MAAA,IAAI;AACF,QAAA,OAAO,MAAM,eAAA,CAAiC,IAAA,CAAK,QAAA,EAAU,IAAA,CAAK,QAAQ,KAAA,EAAO;AAAA,UAC/E,GAAG,IAAA;AAAA,UACH,WAAA,EAAa,CAAC,KAAA,KAAyB,KAAA,CAAM,KAAK,KAAK;AAAA,SAClC,CAAA;AAAA,MACzB,CAAA,SAAE;AACA,QAAA,KAAA,CAAM,GAAA,EAAI;AAAA,MACZ;AAAA,IACF,CAAA,GAAG;AACH,IAAA,OAAO,MAAA,CAAO,MAAA,CAAO,KAAA,EAAO,EAAE,QAAQ,CAAA;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAa,OAAqB,IAAA,EAAuD;AACvF,IAAA,MAAM,EAAE,cAAA,EAAe,GAAI,MAAM,OAAO,wBAAiC,CAAA;AACzE,IAAA,OAAO,eAAmB,IAAI,CAAA;AAAA,EAChC;AACF;AAOO,SAAS,EAAA,CACd,EAAA,EACA,IAAA,EACA,IAAA,EACQ;AACR,EAAA,cAAA,CAAe,EAAE,CAAA;AACjB,EAAA,IAAI,MAAM,KAAA,KAAU,MAAA,EAAW,iBAAA,CAAkB,KAAA,CAAM,KAAK,KAAK,CAAA;AACjE,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,IAAA;AAAA,IACN,EAAA;AAAA,IACA,EAAA,EAAI,IAAA;AAAA,IACJ,GAAI,MAAM,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,EAAY,GAAI,EAAC;AAAA,IAC3E,GAAI,MAAM,YAAA,KAAiB,MAAA,GAAY,EAAE,YAAA,EAAc,IAAA,CAAK,YAAA,EAAa,GAAI,EAAC;AAAA,IAC9E,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM,GAAI;AAAC,GAC3D;AACF;AAMO,SAAS,SAAA,CACd,EAAA,EACA,KAAA,EACA,cAAA,EACA,IAAA,EACW;AACX,EAAA,cAAA,CAAe,EAAE,CAAA;AACjB,EAAA,IAAI,MAAM,KAAA,KAAU,MAAA,EAAW,iBAAA,CAAkB,KAAA,CAAM,KAAK,KAAK,CAAA;AACjE,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,OAAA;AAAA,IACN,EAAA;AAAA,IACA,KAAA;AAAA,IACA,cAAA;AAAA,IACA,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM,GAAI,EAAC;AAAA;AAAA,IAEzD,GAAI,MAAM,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAO,GAAI;AAAC,GAC9D;AACF;AAaO,SAAS,YAAA,CACd,OACA,IAAA,EACQ;AACR,EAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,SAAA,EAAY,KAAA,CAAM,UAAU,IAAI,CAAA,CAAA;AACvD,EAAA,cAAA,CAAe,EAAE,CAAA;AACjB,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,IAAA;AAAA,IACN,EAAA;AAAA,IACA,EAAA,EAAI,OAAO,KAAA,EAAgB,GAAA,KAAuC;AAChE,MAAA,MAAM,GAAA,GAAM,MAAM,KAAA,CAAM,GAAA,CAAI,OAAa,EAAE,MAAA,EAAQ,GAAA,CAAI,MAAA,EAAQ,CAAA;AAC/D,MAAA,IAAI,GAAA,CAAI,MAAA,KAAW,WAAA,EAAa,OAAO,GAAA,CAAI,MAAA;AAC3C,MAAA,MAAM,IAAI,oBAAoB,EAAA,EAAI,KAAA,CAAM,UAAU,IAAA,EAAM,GAAA,CAAI,MAAA,EAAQ,GAAA,CAAI,KAAK,CAAA;AAAA,IAC/E;AAAA,GACF;AACF;AASO,SAAS,aAAA,CACd,IACA,IAAA,EACkB;AAClB,EAAA,OAAO,IAAI,QAAA;AAAA,IACT,EAAE,GAAG,EAAA,CAAG,SAAA,EAAW,IAAA,EAAM,IAAA,CAAK,EAAA,EAAI,UAAA,EAAY,CAAA,GAAA,EAAM,WAAA,EAAa,CAAA,CAAA,EAAG;AAAA,IACpE,CAAC,GAAG,EAAA,CAAG,OAAO;AAAA,GAChB;AACF;AAqCO,IAAM,iBAAA,GAAN,cAAgC,KAAA,CAAM;AAAA,EAE3C,WAAA,CACW,QAAA,EACA,cAAA,EACA,aAAA,EACT;AACA,IAAA,KAAA;AAAA,MACE,CAAA,gBAAA,EAAmB,QAAQ,CAAA,aAAA,EAAgB,cAAc,CAAA,EACvD,gBAAgB,CAAA,EAAA,EAAK,aAAA,CAAc,OAAO,CAAA,CAAA,GAAK,EACjD,CAAA;AAAA,KACF;AARS,IAAA,IAAA,CAAA,QAAA,GAAA,QAAA;AACA,IAAA,IAAA,CAAA,cAAA,GAAA,cAAA;AACA,IAAA,IAAA,CAAA,aAAA,GAAA,aAAA;AAOT,IAAA,IAAA,CAAK,IAAA,GAAO,mBAAA;AAAA,EACd;AAAA,EAVW,QAAA;AAAA,EACA,cAAA;AAAA,EACA,aAAA;AAAA,EAJF,IAAA,GAAO,sBAAA;AAalB;AAyBO,SAAS,cAAA,CACd,UACA,IAAA,EACY;AACZ,EAAA,MAAM,cAAc,YAAA,CAAa,IAAA,CAAK,aAAa,EAAE,eAAA,EAAiB,OAAO,CAAA;AAC7E,EAAA,OAAO;AAAA,IACL,MAAM,IAAA,CAAK,IAAA;AAAA,IACX,aAAa,IAAA,CAAK,WAAA;AAAA,IAClB,WAAA;AAAA,IACA,OAAA,EAAS,OAAO,QAAA,KAAuD;AACrE,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,WAAA,CAAY,KAAA,CAAM,QAAQ,CAAA;AAC9C,MAAA,MAAM,GAAA,GAAM,MAAM,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA;AACrC,MAAA,IAAI,GAAA,CAAI,WAAW,WAAA,EAAa;AAC9B,QAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,CAAK,MAAM,GAAA,CAAI,MAAA,EAAQ,IAAI,KAAK,CAAA;AAAA,MAC9D;AACA,MAAA,MAAM,SAAS,GAAA,CAAI,MAAA;AACnB,MAAA,OAAO,OAAO,MAAA,KAAW,QAAA,GAAW,SAAS,IAAA,CAAK,SAAA,CAAU,UAAU,IAAI,CAAA;AAAA,IAC5E;AAAA,GACF;AACF;AAIA,SAAS,eAAe,EAAA,EAAkB;AAExC,EAAA,kBAAA,CAAmB,EAAA,EAAI,EAAE,MAAA,EAAQ,EAAA,EAAI,CAAA;AACvC;AAEA,SAAS,WAAA,GAAsB;AAC7B,EAAA,OAAO,UAAA,CAAW,MAAA,CAAO,UAAA,EAAW,CAAE,OAAA,CAAQ,MAAM,EAAE,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA;AACpE;AAEA,SAAS,cAAc,CAAA,EAA6C;AAClE,EAAA,IAAI,CAAA,CAAE,IAAA,KAAS,UAAA,EAAY,OAAO,CAAA,CAAE,QAAA;AACpC,EAAA,IAAI,CAAA,CAAE,SAAS,QAAA,EAAU;AACvB,IAAA,MAAM,MAAA,GAAS,EAAE,UAAA,CAAW,GAAA,CAAI,CAAC,GAAG,MAAM,CAAA,KAAM,MAAM,CAAA;AACtD,IAAA,OAAO,CAAA,CAAE,aAAa,MAAA,GAAY,CAAC,GAAG,MAAA,EAAQ,CAAA,CAAE,QAAQ,CAAA,GAAI,MAAA;AAAA,EAC9D;AACA,EAAA,IAAI,CAAA,CAAE,IAAA,KAAS,SAAA,IAAa,CAAA,CAAE,IAAA,KAAS,SAAA,EAAW,OAAO,CAAC,CAAC,CAAA,CAAE,IAAI,CAAC,CAAA;AAClE,EAAA,OAAO,EAAC;AACV;AAEA,SAAS,mBAAA,CAAoB,OAA4B,IAAA,EAAyB;AAChF,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,IAAA,CAAK,IAAI,CAAA,CAAE,EAAE,GAAG,MAAM,IAAI,4BAAA,CAA6B,CAAA,CAAE,EAAE,CAAA;AAC/D,IAAA,IAAA,CAAK,GAAA,CAAI,EAAE,EAAE,CAAA;AACb,IAAA,KAAA,MAAW,MAAA,IAAU,aAAA,CAAc,CAAC,CAAA,EAAG;AACrC,MAAA,mBAAA,CAAoB,QAAQ,IAAI,CAAA;AAAA,IAClC;AAAA,EACF;AACF","file":"chunk-WJOLIPEM.js","sourcesContent":["/**\n * SE28 — a minimal pushable async iterator for `Workflow.stream()`. The executor\n * pushes {@link WorkflowEvent}s as steps run; the consumer drains them via\n * `for await`. Buffers events emitted before the consumer is ready; `end()`\n * closes the iterator so a pending/next `next()` resolves `done: true`.\n *\n * @internal\n */\n\nimport type { WorkflowEvent } from \"../../types/workflow.js\";\n\nexport interface PushableEventStream extends AsyncIterableIterator<WorkflowEvent> {\n  push(event: WorkflowEvent): void;\n  end(): void;\n}\n\nexport function createEventStream(): PushableEventStream {\n  const buffer: WorkflowEvent[] = [];\n  const waiters: Array<(r: IteratorResult<WorkflowEvent>) => void> = [];\n  let ended = false;\n\n  const stream: PushableEventStream = {\n    push(event: WorkflowEvent): void {\n      if (ended) return;\n      const waiter = waiters.shift();\n      if (waiter !== undefined) waiter({ value: event, done: false });\n      else buffer.push(event);\n    },\n    end(): void {\n      if (ended) return;\n      ended = true;\n      for (const waiter of waiters.splice(0)) waiter({ value: undefined, done: true });\n    },\n    next(): Promise<IteratorResult<WorkflowEvent>> {\n      const buffered = buffer.shift();\n      if (buffered !== undefined) return Promise.resolve({ value: buffered, done: false });\n      if (ended) return Promise.resolve({ value: undefined, done: true });\n      return new Promise((resolve) => waiters.push(resolve));\n    },\n    // `for await` calls return() on break/throw — close early so events stop\n    // buffering in memory for a consumer that stopped iterating.\n    return(): Promise<IteratorResult<WorkflowEvent>> {\n      stream.end();\n      buffer.length = 0;\n      return Promise.resolve({ value: undefined, done: true });\n    },\n    [Symbol.asyncIterator](): PushableEventStream {\n      return stream;\n    },\n  };\n  return stream;\n}\n","/**\n * Public `Workflow` class — declarative multi-step orchestration over\n * `Agent.send`, `Handoff`, `Agent.batch` and friends (Adoption Roadmap #5;\n * ADRs D230-D248).\n *\n * Usage:\n *\n *   import { Agent } from \"@theokit/sdk\";\n *   import { Workflow, fn, agentStep } from \"@theokit/sdk/workflow\";\n *\n *   const classifier = await Agent.create({ ... });\n *   const wf = Workflow.create({ name: \"demo\" })\n *     .then(fn(\"validate\", (input: { id: string }) => {\n *       if (!input.id) throw new Error(\"missing id\");\n *       return input;\n *     }))\n *     .then(agentStep(\"classify\", classifier, (i) => `Classify: ${JSON.stringify(i)}`))\n *     .commit();\n *\n *   const run = await wf.run({ id: \"x\" });\n *   console.log(run.status, run.output);\n *\n * @public\n */\n\nimport type { ZodType } from \"zod\";\nimport { z } from \"zod\";\nimport { PersistenceSchema } from \"./internal/persistence/persistence-schema.js\";\nimport { sanitizeIdentifier } from \"./internal/security/path-guard.js\";\nimport { createEventStream } from \"./internal/workflow/event-stream.js\";\nimport { toJsonSchema } from \"./internal/zod/to-json-schema.js\";\nimport type { CustomTool, SDKAgent } from \"./types/agent.js\";\nimport type { MessageOrigin } from \"./types/run.js\";\nimport type {\n  AgentStep,\n  BranchStep,\n  DowhileStep,\n  FnStep,\n  ForeachStep,\n  ParallelStep,\n  RetryPolicy,\n  SleepStep,\n  Step,\n  StepContext,\n  SuspendStep,\n  WorkflowDescription,\n  WorkflowEvent,\n  WorkflowOptions,\n  WorkflowResumeOptions,\n  WorkflowRun,\n  WorkflowRunOptions,\n  WorkflowStepDescription,\n  WorkflowStream,\n} from \"./types/workflow.js\";\nimport { WorkflowDuplicateStepIdError, WorkflowNestedError } from \"./types/workflow.js\";\n\n/* ─── Zod validation schemas ─── */\n\nconst RetryPolicySchema = z.object({\n  // EC-3 absorbed: maxAttempts MUST be a finite int in [1, 20].\n  maxAttempts: z\n    .number()\n    .int(\"retry.maxAttempts must be integer\")\n    .min(1, \"retry.maxAttempts must be >= 1\")\n    .max(20, \"retry.maxAttempts must be <= 20\"),\n  initialBackoffMs: z.number().int().min(0).optional(),\n  backoffCoefficient: z.number().min(1).optional(),\n  maximumBackoffMs: z.number().int().min(0).optional(),\n  nonRetryableErrors: z.array(z.string()).optional(),\n});\n\nconst WorkflowOptionsSchema = z.object({\n  name: z.string().min(1).max(128),\n  persistence: PersistenceSchema,\n  // SE27 — declared so a future `new WorkflowBuilder(parsed)` refactor cannot\n  // silently drop them (create() passes the ORIGINAL options today, but the\n  // schema is also the documentation of the shape).\n  inputSchema: z.custom<ZodType>().optional(),\n  outputSchema: z.custom<ZodType>().optional(),\n});\n\n/* ─── Builder ─── */\n\nexport class WorkflowBuilder<TInput = unknown, TOutput = unknown> {\n  private readonly _steps: Step[] = [];\n  private _committed = false;\n\n  /** @internal */\n  constructor(private readonly options: WorkflowOptions) {}\n\n  /** @internal — only the executor reads this. */\n  get __steps(): ReadonlyArray<Step> {\n    return this._steps;\n  }\n\n  // biome-ignore lint/suspicious/noThenProperty: D233 locks the a peer framework-style `.then(step)` builder DSL. The method is fluent, never awaited.\n  then<TO = unknown>(step: Step): WorkflowBuilder<TInput, TO> {\n    this.assertNotCommitted();\n    validateStepId(step.id);\n    this._steps.push(step);\n    return this as unknown as WorkflowBuilder<TInput, TO>;\n  }\n\n  parallel(\n    branches: ReadonlyArray<ReadonlyArray<Step>>,\n    opts?: { id?: string; concurrency?: number; errorPolicy?: \"fail-fast\" | \"collect\" },\n  ): WorkflowBuilder<TInput, unknown[]> {\n    this.assertNotCommitted();\n    const id = opts?.id ?? `parallel_${this._steps.length}`;\n    validateStepId(id);\n    for (const branch of branches) {\n      for (const inner of branch) validateStepId(inner.id);\n    }\n    const step: ParallelStep = {\n      kind: \"parallel\",\n      id,\n      branches,\n      ...(opts?.concurrency !== undefined ? { concurrency: opts.concurrency } : {}),\n      ...(opts?.errorPolicy !== undefined ? { errorPolicy: opts.errorPolicy } : {}),\n    };\n    this._steps.push(step);\n    return this as unknown as WorkflowBuilder<TInput, unknown[]>;\n  }\n\n  branch(\n    predicates: BranchStep[\"predicates\"],\n    opts?: { id?: string; fallback?: ReadonlyArray<Step> },\n  ): WorkflowBuilder<TInput, unknown> {\n    this.assertNotCommitted();\n    const id = opts?.id ?? `branch_${this._steps.length}`;\n    validateStepId(id);\n    const step: BranchStep = {\n      kind: \"branch\",\n      id,\n      predicates,\n      ...(opts?.fallback !== undefined ? { fallback: opts.fallback } : {}),\n    };\n    this._steps.push(step);\n    return this as unknown as WorkflowBuilder<TInput, unknown>;\n  }\n\n  foreach(\n    iterableFrom: string,\n    step: Step,\n    opts?: { id?: string; concurrency?: number },\n  ): WorkflowBuilder<TInput, unknown[]> {\n    this.assertNotCommitted();\n    const id = opts?.id ?? `foreach_${this._steps.length}`;\n    validateStepId(id);\n    validateStepId(iterableFrom);\n    validateStepId(step.id);\n    const node: ForeachStep = {\n      kind: \"foreach\",\n      id,\n      iterableFrom,\n      step,\n      ...(opts?.concurrency !== undefined ? { concurrency: opts.concurrency } : {}),\n    };\n    this._steps.push(node);\n    return this as unknown as WorkflowBuilder<TInput, unknown[]>;\n  }\n\n  dowhile(\n    step: Step,\n    condFn: DowhileStep[\"condFn\"],\n    opts?: { id?: string; maxIterations?: number },\n  ): WorkflowBuilder<TInput, unknown> {\n    this.assertNotCommitted();\n    const id = opts?.id ?? `dowhile_${this._steps.length}`;\n    validateStepId(id);\n    validateStepId(step.id);\n    const node: DowhileStep = {\n      kind: \"dowhile\",\n      id,\n      step,\n      condFn,\n      ...(opts?.maxIterations !== undefined ? { maxIterations: opts.maxIterations } : {}),\n    };\n    this._steps.push(node);\n    return this as unknown as WorkflowBuilder<TInput, unknown>;\n  }\n\n  sleep(durationMs: number, id?: string): WorkflowBuilder<TInput, TOutput> {\n    this.assertNotCommitted();\n    const stepId = id ?? `sleep_${this._steps.length}`;\n    validateStepId(stepId);\n    if (!Number.isFinite(durationMs) || durationMs < 0) {\n      throw new Error(`sleep durationMs must be finite non-negative: ${durationMs}`);\n    }\n    const step: SleepStep = { kind: \"sleep\", id: stepId, durationMs };\n    this._steps.push(step);\n    return this;\n  }\n\n  suspend(opts?: { id?: string; payloadSchema?: ZodType }): WorkflowBuilder<TInput, unknown> {\n    this.assertNotCommitted();\n    const id = opts?.id ?? `suspend_${this._steps.length}`;\n    validateStepId(id);\n    const step: SuspendStep = {\n      kind: \"suspend\",\n      id,\n      ...(opts?.payloadSchema !== undefined ? { payloadSchema: opts.payloadSchema } : {}),\n    };\n    this._steps.push(step);\n    return this as unknown as WorkflowBuilder<TInput, unknown>;\n  }\n\n  commit(): Workflow<TInput, TOutput> {\n    this.assertNotCommitted();\n    this.validateUniqueIds();\n    this._committed = true;\n    // EC-5 absorbed: mint unique workflowId so single-flight lock is per-instance\n    const workflowId = `wf-${mintShortId()}`;\n    return new Workflow<TInput, TOutput>({ ...this.options, workflowId }, [...this._steps]);\n  }\n\n  private validateUniqueIds(): void {\n    const seen = new Set<string>();\n    walkStepsValidating(this._steps, seen);\n  }\n\n  private assertNotCommitted(): void {\n    if (this._committed) {\n      throw new Error(\"Workflow already committed; create a fresh Workflow.create(...) call.\");\n    }\n  }\n}\n\n/* ─── Workflow class ─── */\n\n/**\n * theokit#161 — project one step to its reflectable shape, recursing into the variants that nest.\n *\n * `parallel` branches are FLATTENED: the grouping is a scheduling detail (which steps may run\n * concurrently), not shape a reader of the workflow needs, and preserving it would put a second,\n * branch-shaped level into a type whose whole purpose is to be renderable.\n */\nfunction describeStep(step: Step): WorkflowStepDescription {\n  const base = { id: step.id, kind: step.kind } as const;\n  if (step.kind === \"parallel\") {\n    return { ...base, steps: step.branches.flat().map(describeStep) };\n  }\n  if (step.kind === \"branch\") {\n    const fromPredicates = step.predicates.flatMap(([, steps]) => steps.map(describeStep));\n    const fromFallback = (step.fallback ?? []).map(describeStep);\n    return { ...base, steps: [...fromPredicates, ...fromFallback] };\n  }\n  if (step.kind === \"foreach\" || step.kind === \"dowhile\") {\n    return { ...base, steps: [describeStep(step.step)] };\n  }\n  return base;\n}\n\nexport class Workflow<TInput = unknown, TOutput = unknown> {\n  /** @internal */\n  constructor(\n    private readonly _options: WorkflowOptions,\n    private readonly _steps: ReadonlyArray<Step>,\n  ) {}\n\n  /** @internal — only the executor reads these. */\n  get __options(): WorkflowOptions {\n    return this._options;\n  }\n  /** @internal */\n  get __steps(): ReadonlyArray<Step> {\n    return this._steps;\n  }\n\n  /**\n   * Construct a workflow builder. Validate options via Zod and return a\n   * `WorkflowBuilder` for fluent chaining. Call `.commit()` to obtain the\n   * immutable `Workflow`.\n   */\n  static create<TI = unknown, TO = unknown>(options: WorkflowOptions): WorkflowBuilder<TI, TO> {\n    WorkflowOptionsSchema.parse(options);\n    return new WorkflowBuilder<TI, TO>(options);\n  }\n\n  /**\n   * theokit#161 — describe this workflow's shape, for a reflection surface.\n   *\n   * Returns `{ name, steps }`, each step carrying its `id` and `kind`, recursing into `parallel`,\n   * `branch`, `foreach` and `dowhile`. Every executable a step holds — predicates, conditions,\n   * agents, prompt templates — is omitted: it cannot cross a process boundary and says nothing about\n   * shape.\n   *\n   * There is deliberately no `Workflow.list()`. A workflow is a value the caller constructs and\n   * holds, so the caller already knows which ones exist; a registry would add process-global state\n   * nothing releases in order to re-answer a question the host can answer itself. A reflection\n   * endpoint maps over its own workflows and calls this.\n   *\n   * @public\n   */\n  describe(): WorkflowDescription {\n    return {\n      name: this._options.name,\n      steps: this._steps.map(describeStep),\n    };\n  }\n\n  /**\n   * Run this workflow with the given input. Returns a populated\n   * `WorkflowRun`. Errors inside a step DO NOT throw — they propagate via\n   * `run.status === \"failed\"`.\n   */\n  async run(input: TInput, opts?: WorkflowRunOptions): Promise<WorkflowRun<TOutput>> {\n    // Lazy import to keep the public façade lean.\n    const { executeWorkflow } = await import(\"./internal/workflow/executor.js\");\n    const result = await executeWorkflow<TInput, TOutput>(this._options, this._steps, input, opts);\n    // T3.4: opt-in Task wrapping (ADRs D363, D374). Workflows are\n    // observable via Task.list/get/subscribe; the underlying run is\n    // already terminal here (executor returned), so the Task just\n    // records the outcome for inspection.\n    if (opts?.task !== undefined) {\n      const { submit: taskSubmit } = await import(\"./internal/task/registry.js\");\n      const taskOpts = opts.task === true ? {} : opts.task;\n      const id = taskOpts.id ?? `wf-${result.id}`;\n      await taskSubmit({\n        kind: \"workflow\",\n        work: async (ctx) => {\n          ctx.emit({ status: result.status, runId: result.id });\n          return { status: result.status, runId: result.id, output: result.output };\n        },\n        id,\n        meta: {\n          workflowName: this._options.name,\n          runId: result.id,\n          status: result.status,\n          ...(taskOpts.meta ?? {}),\n        },\n        allowReservedPrefix: true,\n      });\n    }\n    return result;\n  }\n\n  /**\n   * SE28 — run the workflow and STREAM step-level events as they happen. Returns\n   * an async iterator of {@link WorkflowEvent}s (`step_started` / `step_completed`\n   * / `step_failed` / `workflow_suspended` / `workflow_completed`, top-level\n   * steps) plus a `result` promise resolving to the same terminal\n   * {@link WorkflowRun} `run()` returns. Iterate for progress; await `result` for\n   * the outcome. The stream ends when the run terminates.\n   *\n   * `result` is the AUTHORITATIVE terminal status. Not every terminal state has a\n   * closing event: a step failure emits `step_failed`, but an `outputSchema`\n   * rejection (SE27) or an abort ends the stream WITHOUT `workflow_completed` —\n   * always `await result` to read the final `status`. Consuming order is free:\n   * awaiting `result` without draining, or draining without awaiting `result`,\n   * both work (breaking out of `for await` stops the buffering early).\n   */\n  stream(input: TInput, opts?: WorkflowRunOptions): WorkflowStream<TOutput> {\n    const queue = createEventStream();\n    const result = (async (): Promise<WorkflowRun<TOutput>> => {\n      const { executeWorkflow } = await import(\"./internal/workflow/executor.js\");\n      try {\n        return await executeWorkflow<TInput, TOutput>(this._options, this._steps, input, {\n          ...opts,\n          onStepEvent: (event: WorkflowEvent) => queue.push(event),\n        } as WorkflowRunOptions);\n      } finally {\n        queue.end(); // authoritative terminal is `result`; close the stream\n      }\n    })();\n    return Object.assign(queue, { result });\n  }\n\n  /**\n   * Resume a suspended workflow from its snapshot. Throws\n   * `WorkflowSnapshotNotFoundError` if `runId` is unknown.\n   */\n  static async resume<TO = unknown>(opts: WorkflowResumeOptions): Promise<WorkflowRun<TO>> {\n    const { resumeWorkflow } = await import(\"./internal/workflow/executor.js\");\n    return resumeWorkflow<TO>(opts);\n  }\n}\n\n/* ─── Helper factory functions ─── */\n\n/**\n * Build a `FnStep`. `id` must match `^[a-z0-9][a-z0-9_-]*$`.\n */\nexport function fn<I = unknown, O = unknown>(\n  id: string,\n  step: (input: I, ctx: StepContext) => Promise<O> | O,\n  opts?: { inputSchema?: ZodType; outputSchema?: ZodType; retry?: RetryPolicy },\n): FnStep {\n  validateStepId(id);\n  if (opts?.retry !== undefined) RetryPolicySchema.parse(opts.retry);\n  return {\n    kind: \"fn\",\n    id,\n    fn: step as FnStep[\"fn\"],\n    ...(opts?.inputSchema !== undefined ? { inputSchema: opts.inputSchema } : {}),\n    ...(opts?.outputSchema !== undefined ? { outputSchema: opts.outputSchema } : {}),\n    ...(opts?.retry !== undefined ? { retry: opts.retry } : {}),\n  };\n}\n\n/**\n * Build an `AgentStep`. The `promptTemplate` can be a static string or a\n * function that receives the input and returns the prompt.\n */\nexport function agentStep(\n  id: string,\n  agent: SDKAgent,\n  promptTemplate: string | ((input: unknown) => string),\n  opts?: { retry?: RetryPolicy; origin?: MessageOrigin },\n): AgentStep {\n  validateStepId(id);\n  if (opts?.retry !== undefined) RetryPolicySchema.parse(opts.retry);\n  return {\n    kind: \"agent\",\n    id,\n    agent,\n    promptTemplate,\n    ...(opts?.retry !== undefined ? { retry: opts.retry } : {}),\n    // SE3 — carry the turn's provenance down to `agent.send()` (metadata-only).\n    ...(opts?.origin !== undefined ? { origin: opts.origin } : {}),\n  };\n}\n\n/**\n * SE30 — use a committed {@link Workflow} as a step inside another workflow.\n * Wraps the child as an `FnStep` (opaque — the child runs in its OWN executor\n * with its own id-space, so nested step-ids never collide with the parent's).\n * The child's output becomes the step output. A non-`completed` child fails the\n * parent step with a typed {@link WorkflowNestedError}: nested `suspended` is NOT\n * resumable in v1 (resume continues AFTER the step — the child would be skipped;\n * use a top-level suspend). See ADR 0010.\n *\n * @public\n */\nexport function workflowStep<TI = unknown, TO = unknown>(\n  child: Workflow<TI, TO>,\n  opts?: { id?: string },\n): FnStep {\n  const id = opts?.id ?? `workflow_${child.__options.name}`;\n  validateStepId(id);\n  return {\n    kind: \"fn\",\n    id,\n    fn: async (input: unknown, ctx: StepContext): Promise<unknown> => {\n      const run = await child.run(input as TI, { signal: ctx.signal });\n      if (run.status === \"completed\") return run.output;\n      throw new WorkflowNestedError(id, child.__options.name, run.status, run.error);\n    },\n  };\n}\n\n/**\n * SE30 — clone a committed workflow under a new id/name. The clone runs\n * independently (its own single-flight lock + observability identity) with the\n * same committed steps. Mirrors a peer framework's `cloneWorkflow`.\n *\n * @public\n */\nexport function cloneWorkflow<TI = unknown, TO = unknown>(\n  wf: Workflow<TI, TO>,\n  opts: { id: string },\n): Workflow<TI, TO> {\n  return new Workflow<TI, TO>(\n    { ...wf.__options, name: opts.id, workflowId: `wf-${mintShortId()}` },\n    [...wf.__steps],\n  );\n}\n\n/* ─── Test seam re-export ─── */\n\nexport { __resetSnapshotStoresForTests } from \"./internal/workflow/snapshot-store.js\";\n\n/* ─── Re-exports for ergonomics (errors + all public types). After the\n       sub-path extraction `@theokit/sdk/workflow` is the single import site,\n       so type aliases must surface here (previously they reached consumers\n       via `types/index.ts:25 export type * from \"./workflow.js\"`, which the\n       extraction removes). ─── */\n\nexport type * from \"./types/workflow.js\";\nexport {\n  WorkflowAlreadyRunningError,\n  WorkflowCompensateNotImplementedError,\n  WorkflowDuplicateStepIdError,\n  WorkflowInputError,\n  WorkflowMaxIterationsExceededError,\n  WorkflowNestedError,\n  WorkflowNotSerializableError,\n  WorkflowOutputError,\n  WorkflowParallelError,\n  WorkflowResumeStepNotFoundError,\n  WorkflowSnapshotNotFoundError,\n  WorkflowStateError,\n} from \"./types/workflow.js\";\n\n/* ─── SE19 — workflowAsTool (expose a Workflow as an agent tool) ─── */\n\n/**\n * Raised by a {@link workflowAsTool} tool when the wrapped workflow run does not\n * reach `status: \"completed\"` (a step failed, the run was cancelled/suspended).\n * The dispatch converts it to a `tool_result(isError)`.\n *\n * @public\n */\nexport class WorkflowToolError extends Error {\n  readonly code = \"workflow_tool_failed\" as const;\n  constructor(\n    readonly toolName: string,\n    readonly workflowStatus: string,\n    readonly workflowError?: { name: string; message: string },\n  ) {\n    super(\n      `workflowAsTool(\"${toolName}\"): workflow ${workflowStatus}${\n        workflowError ? `: ${workflowError.message}` : \"\"\n      }`,\n    );\n    this.name = \"WorkflowToolError\";\n  }\n}\n\n/** Spec for {@link workflowAsTool}. `inputSchema` is the workflow's input shape (Zod). */\nexport interface WorkflowAsToolSpec<T extends ZodType> {\n  /** Tool name surfaced to the LLM. Same constraints as a `CustomTool.name`. */\n  name: string;\n  /** Description surfaced to the LLM — when the agent should trigger the workflow. */\n  description: string;\n  /** Zod schema for the workflow's input (a `Workflow` carries no top-level schema). */\n  inputSchema: T;\n}\n\n/**\n * SE19 — expose a {@link Workflow} as an agent {@link CustomTool}, completing the\n * \"X as tools\" trio (tools; agents-as-tools via `defineSubAgent`; workflows-as-tools).\n * The handler validates the model's args against `spec.inputSchema`, runs the\n * workflow, and returns its output (a string as-is, else JSON). A run that does not\n * reach `status: \"completed\"` raises a typed {@link WorkflowToolError} (workflow\n * step errors do NOT throw — they surface via `run.status === \"failed\"`).\n *\n * Accepts any `{ run }`-shaped workflow (structural), so it never imports the\n * `Workflow` class directly.\n *\n * @public\n */\nexport function workflowAsTool<T extends ZodType, TOutput = unknown>(\n  workflow: { run: (input: z.infer<T>) => Promise<WorkflowRun<TOutput>> },\n  spec: WorkflowAsToolSpec<T>,\n): CustomTool {\n  const inputSchema = toJsonSchema(spec.inputSchema, { unrepresentable: \"any\" });\n  return {\n    name: spec.name,\n    description: spec.description,\n    inputSchema,\n    handler: async (rawInput: Record<string, unknown>): Promise<string> => {\n      const parsed = spec.inputSchema.parse(rawInput) as z.infer<T>;\n      const run = await workflow.run(parsed);\n      if (run.status !== \"completed\") {\n        throw new WorkflowToolError(spec.name, run.status, run.error);\n      }\n      const output = run.output;\n      return typeof output === \"string\" ? output : JSON.stringify(output ?? null);\n    },\n  };\n}\n\n/* ─── Internal helpers ─── */\n\nfunction validateStepId(id: string): void {\n  // Reuses D81 grammar: ^[a-z0-9][a-z0-9_-]*$\n  sanitizeIdentifier(id, { maxLen: 64 });\n}\n\nfunction mintShortId(): string {\n  return globalThis.crypto.randomUUID().replace(/-/g, \"\").slice(0, 8);\n}\n\nfunction nestedStepsOf(s: Step): ReadonlyArray<ReadonlyArray<Step>> {\n  if (s.kind === \"parallel\") return s.branches;\n  if (s.kind === \"branch\") {\n    const groups = s.predicates.map(([, branch]) => branch);\n    return s.fallback !== undefined ? [...groups, s.fallback] : groups;\n  }\n  if (s.kind === \"foreach\" || s.kind === \"dowhile\") return [[s.step]];\n  return [];\n}\n\nfunction walkStepsValidating(steps: ReadonlyArray<Step>, seen: Set<string>): void {\n  for (const s of steps) {\n    if (seen.has(s.id)) throw new WorkflowDuplicateStepIdError(s.id);\n    seen.add(s.id);\n    for (const nested of nestedStepsOf(s)) {\n      walkStepsValidating(nested, seen);\n    }\n  }\n}\n"]}
+{"version":3,"sources":["../src/internal/workflow/event-stream.ts","../src/workflow.ts"],"names":[],"mappings":";;;;;;;AAgBO,SAAS,iBAAA,GAAyC;AACvD,EAAA,MAAM,SAA0B,EAAC;AACjC,EAAA,MAAM,UAA6D,EAAC;AACpE,EAAA,IAAI,KAAA,GAAQ,KAAA;AAEZ,EAAA,MAAM,MAAA,GAA8B;AAAA,IAClC,KAAK,KAAA,EAA4B;AAC/B,MAAA,IAAI,KAAA,EAAO;AACX,MAAA,MAAM,MAAA,GAAS,QAAQ,KAAA,EAAM;AAC7B,MAAA,IAAI,MAAA,KAAW,QAAW,MAAA,CAAO,EAAE,OAAO,KAAA,EAAO,IAAA,EAAM,OAAO,CAAA;AAAA,WACzD,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,IACxB,CAAA;AAAA,IACA,GAAA,GAAY;AACV,MAAA,IAAI,KAAA,EAAO;AACX,MAAA,KAAA,GAAQ,IAAA;AACR,MAAA,KAAA,MAAW,MAAA,IAAU,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,EAAG,MAAA,CAAO,EAAE,KAAA,EAAO,MAAA,EAAW,IAAA,EAAM,IAAA,EAAM,CAAA;AAAA,IACjF,CAAA;AAAA,IACA,IAAA,GAA+C;AAC7C,MAAA,MAAM,QAAA,GAAW,OAAO,KAAA,EAAM;AAC9B,MAAA,IAAI,QAAA,KAAa,MAAA,EAAW,OAAO,OAAA,CAAQ,OAAA,CAAQ,EAAE,KAAA,EAAO,QAAA,EAAU,IAAA,EAAM,KAAA,EAAO,CAAA;AACnF,MAAA,IAAI,KAAA,SAAc,OAAA,CAAQ,OAAA,CAAQ,EAAE,KAAA,EAAO,MAAA,EAAW,IAAA,EAAM,IAAA,EAAM,CAAA;AAClE,MAAA,OAAO,IAAI,OAAA,CAAQ,CAAC,YAAY,OAAA,CAAQ,IAAA,CAAK,OAAO,CAAC,CAAA;AAAA,IACvD,CAAA;AAAA;AAAA;AAAA,IAGA,MAAA,GAAiD;AAC/C,MAAA,MAAA,CAAO,GAAA,EAAI;AACX,MAAA,MAAA,CAAO,MAAA,GAAS,CAAA;AAChB,MAAA,OAAO,QAAQ,OAAA,CAAQ,EAAE,OAAO,MAAA,EAAW,IAAA,EAAM,MAAM,CAAA;AAAA,IACzD,CAAA;AAAA,IACA,CAAC,MAAA,CAAO,aAAa,CAAA,GAAyB;AAC5C,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,GACF;AACA,EAAA,OAAO,MAAA;AACT;;;ACOA,IAAM,iBAAA,GAAoB,EAAE,MAAA,CAAO;AAAA;AAAA,EAEjC,WAAA,EAAa,CAAA,CACV,MAAA,EAAO,CACP,GAAA,CAAI,mCAAmC,CAAA,CACvC,GAAA,CAAI,CAAA,EAAG,gCAAgC,CAAA,CACvC,GAAA,CAAI,IAAI,iCAAiC,CAAA;AAAA,EAC5C,gBAAA,EAAkB,EAAE,MAAA,EAAO,CAAE,KAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,EAAS;AAAA,EACnD,oBAAoB,CAAA,CAAE,MAAA,GAAS,GAAA,CAAI,CAAC,EAAE,QAAA,EAAS;AAAA,EAC/C,gBAAA,EAAkB,EAAE,MAAA,EAAO,CAAE,KAAI,CAAE,GAAA,CAAI,CAAC,CAAA,CAAE,QAAA,EAAS;AAAA,EACnD,oBAAoB,CAAA,CAAE,KAAA,CAAM,EAAE,MAAA,EAAQ,EAAE,QAAA;AAC1C,CAAC,CAAA;AAED,IAAM,qBAAA,GAAwB,EAAE,MAAA,CAAO;AAAA,EACrC,IAAA,EAAM,EAAE,MAAA,EAAO,CAAE,IAAI,CAAC,CAAA,CAAE,IAAI,GAAG,CAAA;AAAA,EAC/B,WAAA,EAAa,iBAAA;AAAA;AAAA;AAAA;AAAA,EAIb,WAAA,EAAa,CAAA,CAAE,MAAA,EAAgB,CAAE,QAAA,EAAS;AAAA,EAC1C,YAAA,EAAc,CAAA,CAAE,MAAA,EAAgB,CAAE,QAAA;AACpC,CAAC,CAAA;AAIM,IAAM,kBAAN,MAA2D;AAAA;AAAA,EAKhE,YAA6B,OAAA,EAA0B;AAA1B,IAAA,IAAA,CAAA,OAAA,GAAA,OAAA;AAAA,EAA2B;AAAA,EAA3B,OAAA;AAAA,EAJZ,SAAiB,EAAC;AAAA,EAC3B,UAAA,GAAa,KAAA;AAAA;AAAA,EAMrB,IAAI,OAAA,GAA+B;AACjC,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA,EAGA,KAAmB,IAAA,EAAyC;AAC1D,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,cAAA,CAAe,KAAK,EAAE,CAAA;AACtB,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,QAAA,CACE,UACA,IAAA,EACoC;AACpC,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,SAAA,EAAY,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AACrD,IAAA,cAAA,CAAe,EAAE,CAAA;AACjB,IAAA,KAAA,MAAW,UAAU,QAAA,EAAU;AAC7B,MAAA,KAAA,MAAW,KAAA,IAAS,MAAA,EAAQ,cAAA,CAAe,KAAA,CAAM,EAAE,CAAA;AAAA,IACrD;AACA,IAAA,MAAM,IAAA,GAAqB;AAAA,MACzB,IAAA,EAAM,UAAA;AAAA,MACN,EAAA;AAAA,MACA,QAAA;AAAA,MACA,GAAI,MAAM,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,EAAY,GAAI,EAAC;AAAA,MAC3E,GAAI,MAAM,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,EAAY,GAAI;AAAC,KAC7E;AACA,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,MAAA,CACE,YACA,IAAA,EACkC;AAClC,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,OAAA,EAAU,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AACnD,IAAA,cAAA,CAAe,EAAE,CAAA;AACjB,IAAA,MAAM,IAAA,GAAmB;AAAA,MACvB,IAAA,EAAM,QAAA;AAAA,MACN,EAAA;AAAA,MACA,UAAA;AAAA,MACA,GAAI,MAAM,QAAA,KAAa,MAAA,GAAY,EAAE,QAAA,EAAU,IAAA,CAAK,QAAA,EAAS,GAAI;AAAC,KACpE;AACA,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,OAAA,CACE,YAAA,EACA,IAAA,EACA,IAAA,EACoC;AACpC,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,QAAA,EAAW,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AACpD,IAAA,cAAA,CAAe,EAAE,CAAA;AACjB,IAAA,cAAA,CAAe,YAAY,CAAA;AAC3B,IAAA,cAAA,CAAe,KAAK,EAAE,CAAA;AACtB,IAAA,MAAM,IAAA,GAAoB;AAAA,MACxB,IAAA,EAAM,SAAA;AAAA,MACN,EAAA;AAAA,MACA,YAAA;AAAA,MACA,IAAA;AAAA,MACA,GAAI,MAAM,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,EAAY,GAAI;AAAC,KAC7E;AACA,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,OAAA,CACE,IAAA,EACA,MAAA,EACA,IAAA,EACkC;AAClC,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,QAAA,EAAW,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AACpD,IAAA,cAAA,CAAe,EAAE,CAAA;AACjB,IAAA,cAAA,CAAe,KAAK,EAAE,CAAA;AACtB,IAAA,MAAM,IAAA,GAAoB;AAAA,MACxB,IAAA,EAAM,SAAA;AAAA,MACN,EAAA;AAAA,MACA,IAAA;AAAA,MACA,MAAA;AAAA,MACA,GAAI,MAAM,aAAA,KAAkB,MAAA,GAAY,EAAE,aAAA,EAAe,IAAA,CAAK,aAAA,EAAc,GAAI;AAAC,KACnF;AACA,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,KAAA,CAAM,YAAoB,EAAA,EAA+C;AACvE,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,MAAA,GAAS,EAAA,IAAM,CAAA,MAAA,EAAS,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AAChD,IAAA,cAAA,CAAe,MAAM,CAAA;AACrB,IAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,UAAU,CAAA,IAAK,aAAa,CAAA,EAAG;AAClD,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,8CAAA,EAAiD,UAAU,CAAA,CAAE,CAAA;AAAA,IAC/E;AACA,IAAA,MAAM,OAAkB,EAAE,IAAA,EAAM,OAAA,EAAS,EAAA,EAAI,QAAQ,UAAA,EAAW;AAChE,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,QAAQ,IAAA,EAAmF;AACzF,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,QAAA,EAAW,IAAA,CAAK,OAAO,MAAM,CAAA,CAAA;AACpD,IAAA,cAAA,CAAe,EAAE,CAAA;AACjB,IAAA,MAAM,IAAA,GAAoB;AAAA,MACxB,IAAA,EAAM,SAAA;AAAA,MACN,EAAA;AAAA,MACA,GAAI,MAAM,aAAA,KAAkB,MAAA,GAAY,EAAE,aAAA,EAAe,IAAA,CAAK,aAAA,EAAc,GAAI;AAAC,KACnF;AACA,IAAA,IAAA,CAAK,MAAA,CAAO,KAAK,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,MAAA,GAAoC;AAClC,IAAA,IAAA,CAAK,kBAAA,EAAmB;AACxB,IAAA,IAAA,CAAK,iBAAA,EAAkB;AACvB,IAAA,IAAA,CAAK,UAAA,GAAa,IAAA;AAElB,IAAA,MAAM,UAAA,GAAa,CAAA,GAAA,EAAM,WAAA,EAAa,CAAA,CAAA;AACtC,IAAA,OAAO,IAAI,QAAA,CAA0B,EAAE,GAAG,IAAA,CAAK,OAAA,EAAS,UAAA,EAAW,EAAG,CAAC,GAAG,IAAA,CAAK,MAAM,CAAC,CAAA;AAAA,EACxF;AAAA,EAEQ,iBAAA,GAA0B;AAChC,IAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,IAAA,mBAAA,CAAoB,IAAA,CAAK,QAAQ,IAAI,CAAA;AAAA,EACvC;AAAA,EAEQ,kBAAA,GAA2B;AACjC,IAAA,IAAI,KAAK,UAAA,EAAY;AACnB,MAAA,MAAM,IAAI,MAAM,uEAAuE,CAAA;AAAA,IACzF;AAAA,EACF;AACF;AAWA,SAAS,aAAa,IAAA,EAAqC;AACzD,EAAA,MAAM,OAAO,EAAE,EAAA,EAAI,KAAK,EAAA,EAAI,IAAA,EAAM,KAAK,IAAA,EAAK;AAC5C,EAAA,IAAI,IAAA,CAAK,SAAS,UAAA,EAAY;AAC5B,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,IAAA,CAAK,SAAS,IAAA,EAAK,CAAE,GAAA,CAAI,YAAY,CAAA,EAAE;AAAA,EAClE;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAC1B,IAAA,MAAM,cAAA,GAAiB,IAAA,CAAK,UAAA,CAAW,OAAA,CAAQ,CAAC,GAAG,KAAK,CAAA,KAAM,KAAA,CAAM,GAAA,CAAI,YAAY,CAAC,CAAA;AACrF,IAAA,MAAM,gBAAgB,IAAA,CAAK,QAAA,IAAY,EAAC,EAAG,IAAI,YAAY,CAAA;AAC3D,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,CAAC,GAAG,cAAA,EAAgB,GAAG,YAAY,CAAA,EAAE;AAAA,EAChE;AACA,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,SAAA,IAAa,IAAA,CAAK,SAAS,SAAA,EAAW;AACtD,IAAA,OAAO,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,CAAC,YAAA,CAAa,IAAA,CAAK,IAAI,CAAC,CAAA,EAAE;AAAA,EACrD;AACA,EAAA,OAAO,IAAA;AACT;AAEO,IAAM,WAAN,MAAoD;AAAA;AAAA,EAEzD,WAAA,CACmB,UACA,MAAA,EACjB;AAFiB,IAAA,IAAA,CAAA,QAAA,GAAA,QAAA;AACA,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AAAA,EAChB;AAAA,EAFgB,QAAA;AAAA,EACA,MAAA;AAAA;AAAA,EAInB,IAAI,SAAA,GAA6B;AAC/B,IAAA,OAAO,IAAA,CAAK,QAAA;AAAA,EACd;AAAA;AAAA,EAEA,IAAI,OAAA,GAA+B;AACjC,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,OAAmC,OAAA,EAAmD;AAC3F,IAAA,qBAAA,CAAsB,MAAM,OAAO,CAAA;AACnC,IAAA,OAAO,IAAI,gBAAwB,OAAO,CAAA;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,QAAA,GAAgC;AAC9B,IAAA,OAAO;AAAA,MACL,IAAA,EAAM,KAAK,QAAA,CAAS,IAAA;AAAA,MACpB,KAAA,EAAO,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,YAAY;AAAA,KACrC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,GAAA,CAAI,KAAA,EAAe,IAAA,EAA0D;AAEjF,IAAA,MAAM,EAAE,eAAA,EAAgB,GAAI,MAAM,OAAO,wBAAiC,CAAA;AAC1E,IAAA,MAAM,MAAA,GAAS,MAAM,eAAA,CAAiC,IAAA,CAAK,UAAU,IAAA,CAAK,MAAA,EAAQ,OAAO,IAAI,CAAA;AAK7F,IAAA,IAAI,IAAA,EAAM,SAAS,MAAA,EAAW;AAC5B,MAAA,MAAM,EAAE,MAAA,EAAQ,UAAA,EAAW,GAAI,MAAM,OAAO,wBAA6B,CAAA;AACzE,MAAA,MAAM,WAAW,IAAA,CAAK,IAAA,KAAS,IAAA,GAAO,KAAK,IAAA,CAAK,IAAA;AAChD,MAAA,MAAM,EAAA,GAAK,QAAA,CAAS,EAAA,IAAM,CAAA,GAAA,EAAM,OAAO,EAAE,CAAA,CAAA;AACzC,MAAA,MAAM,UAAA,CAAW;AAAA,QACf,IAAA,EAAM,UAAA;AAAA,QACN,IAAA,EAAM,OAAO,GAAA,KAAQ;AACnB,UAAA,GAAA,CAAI,IAAA,CAAK,EAAE,MAAA,EAAQ,MAAA,CAAO,QAAQ,KAAA,EAAO,MAAA,CAAO,IAAI,CAAA;AACpD,UAAA,OAAO,EAAE,QAAQ,MAAA,CAAO,MAAA,EAAQ,OAAO,MAAA,CAAO,EAAA,EAAI,MAAA,EAAQ,MAAA,CAAO,MAAA,EAAO;AAAA,QAC1E,CAAA;AAAA,QACA,EAAA;AAAA,QACA,IAAA,EAAM;AAAA,UACJ,YAAA,EAAc,KAAK,QAAA,CAAS,IAAA;AAAA,UAC5B,OAAO,MAAA,CAAO,EAAA;AAAA,UACd,QAAQ,MAAA,CAAO,MAAA;AAAA,UACf,GAAI,QAAA,CAAS,IAAA,IAAQ;AAAC,SACxB;AAAA,QACA,mBAAA,EAAqB;AAAA,OACtB,CAAA;AAAA,IACH;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,MAAA,CAAO,OAAe,IAAA,EAAoD;AACxE,IAAA,MAAM,QAAQ,iBAAA,EAAkB;AAChC,IAAA,MAAM,UAAU,YAA2C;AACzD,MAAA,MAAM,EAAE,eAAA,EAAgB,GAAI,MAAM,OAAO,wBAAiC,CAAA;AAC1E,MAAA,IAAI;AACF,QAAA,OAAO,MAAM,eAAA,CAAiC,IAAA,CAAK,QAAA,EAAU,IAAA,CAAK,QAAQ,KAAA,EAAO;AAAA,UAC/E,GAAG,IAAA;AAAA,UACH,WAAA,EAAa,CAAC,KAAA,KAAyB,KAAA,CAAM,KAAK,KAAK;AAAA,SAClC,CAAA;AAAA,MACzB,CAAA,SAAE;AACA,QAAA,KAAA,CAAM,GAAA,EAAI;AAAA,MACZ;AAAA,IACF,CAAA,GAAG;AACH,IAAA,OAAO,MAAA,CAAO,MAAA,CAAO,KAAA,EAAO,EAAE,QAAQ,CAAA;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAa,OAAqB,IAAA,EAAuD;AACvF,IAAA,MAAM,EAAE,cAAA,EAAe,GAAI,MAAM,OAAO,wBAAiC,CAAA;AACzE,IAAA,OAAO,eAAmB,IAAI,CAAA;AAAA,EAChC;AACF;AAOO,SAAS,EAAA,CACd,EAAA,EACA,IAAA,EACA,IAAA,EACQ;AACR,EAAA,cAAA,CAAe,EAAE,CAAA;AACjB,EAAA,IAAI,MAAM,KAAA,KAAU,MAAA,EAAW,iBAAA,CAAkB,KAAA,CAAM,KAAK,KAAK,CAAA;AACjE,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,IAAA;AAAA,IACN,EAAA;AAAA,IACA,EAAA,EAAI,IAAA;AAAA,IACJ,GAAI,MAAM,WAAA,KAAgB,MAAA,GAAY,EAAE,WAAA,EAAa,IAAA,CAAK,WAAA,EAAY,GAAI,EAAC;AAAA,IAC3E,GAAI,MAAM,YAAA,KAAiB,MAAA,GAAY,EAAE,YAAA,EAAc,IAAA,CAAK,YAAA,EAAa,GAAI,EAAC;AAAA,IAC9E,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM,GAAI;AAAC,GAC3D;AACF;AAMO,SAAS,SAAA,CACd,EAAA,EACA,KAAA,EACA,cAAA,EACA,IAAA,EACW;AACX,EAAA,cAAA,CAAe,EAAE,CAAA;AACjB,EAAA,IAAI,MAAM,KAAA,KAAU,MAAA,EAAW,iBAAA,CAAkB,KAAA,CAAM,KAAK,KAAK,CAAA;AACjE,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,OAAA;AAAA,IACN,EAAA;AAAA,IACA,KAAA;AAAA,IACA,cAAA;AAAA,IACA,GAAI,MAAM,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAM,GAAI,EAAC;AAAA;AAAA,IAEzD,GAAI,MAAM,MAAA,KAAW,MAAA,GAAY,EAAE,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAO,GAAI;AAAC,GAC9D;AACF;AAaO,SAAS,YAAA,CACd,OACA,IAAA,EACQ;AACR,EAAA,MAAM,KAAK,IAAA,EAAM,EAAA,IAAM,CAAA,SAAA,EAAY,KAAA,CAAM,UAAU,IAAI,CAAA,CAAA;AACvD,EAAA,cAAA,CAAe,EAAE,CAAA;AACjB,EAAA,OAAO;AAAA,IACL,IAAA,EAAM,IAAA;AAAA,IACN,EAAA;AAAA,IACA,EAAA,EAAI,OAAO,KAAA,EAAgB,GAAA,KAAuC;AAChE,MAAA,MAAM,GAAA,GAAM,MAAM,KAAA,CAAM,GAAA,CAAI,OAAa,EAAE,MAAA,EAAQ,GAAA,CAAI,MAAA,EAAQ,CAAA;AAC/D,MAAA,IAAI,GAAA,CAAI,MAAA,KAAW,WAAA,EAAa,OAAO,GAAA,CAAI,MAAA;AAC3C,MAAA,MAAM,IAAI,oBAAoB,EAAA,EAAI,KAAA,CAAM,UAAU,IAAA,EAAM,GAAA,CAAI,MAAA,EAAQ,GAAA,CAAI,KAAK,CAAA;AAAA,IAC/E;AAAA,GACF;AACF;AASO,SAAS,aAAA,CACd,IACA,IAAA,EACkB;AAClB,EAAA,OAAO,IAAI,QAAA;AAAA,IACT,EAAE,GAAG,EAAA,CAAG,SAAA,EAAW,IAAA,EAAM,IAAA,CAAK,EAAA,EAAI,UAAA,EAAY,CAAA,GAAA,EAAM,WAAA,EAAa,CAAA,CAAA,EAAG;AAAA,IACpE,CAAC,GAAG,EAAA,CAAG,OAAO;AAAA,GAChB;AACF;AAqCO,IAAM,iBAAA,GAAN,cAAgC,KAAA,CAAM;AAAA,EAE3C,WAAA,CACW,QAAA,EACA,cAAA,EACA,aAAA,EACT;AACA,IAAA,KAAA;AAAA,MACE,CAAA,gBAAA,EAAmB,QAAQ,CAAA,aAAA,EAAgB,cAAc,CAAA,EACvD,gBAAgB,CAAA,EAAA,EAAK,aAAA,CAAc,OAAO,CAAA,CAAA,GAAK,EACjD,CAAA;AAAA,KACF;AARS,IAAA,IAAA,CAAA,QAAA,GAAA,QAAA;AACA,IAAA,IAAA,CAAA,cAAA,GAAA,cAAA;AACA,IAAA,IAAA,CAAA,aAAA,GAAA,aAAA;AAOT,IAAA,IAAA,CAAK,IAAA,GAAO,mBAAA;AAAA,EACd;AAAA,EAVW,QAAA;AAAA,EACA,cAAA;AAAA,EACA,aAAA;AAAA,EAJF,IAAA,GAAO,sBAAA;AAalB;AAyBO,SAAS,cAAA,CACd,UACA,IAAA,EACY;AACZ,EAAA,MAAM,cAAc,YAAA,CAAa,IAAA,CAAK,aAAa,EAAE,eAAA,EAAiB,OAAO,CAAA;AAC7E,EAAA,OAAO;AAAA,IACL,MAAM,IAAA,CAAK,IAAA;AAAA,IACX,aAAa,IAAA,CAAK,WAAA;AAAA,IAClB,WAAA;AAAA,IACA,OAAA,EAAS,OAAO,QAAA,KAAuD;AACrE,MAAA,MAAM,MAAA,GAAS,IAAA,CAAK,WAAA,CAAY,KAAA,CAAM,QAAQ,CAAA;AAC9C,MAAA,MAAM,GAAA,GAAM,MAAM,QAAA,CAAS,GAAA,CAAI,MAAM,CAAA;AACrC,MAAA,IAAI,GAAA,CAAI,WAAW,WAAA,EAAa;AAC9B,QAAA,MAAM,IAAI,iBAAA,CAAkB,IAAA,CAAK,MAAM,GAAA,CAAI,MAAA,EAAQ,IAAI,KAAK,CAAA;AAAA,MAC9D;AACA,MAAA,MAAM,SAAS,GAAA,CAAI,MAAA;AACnB,MAAA,OAAO,OAAO,MAAA,KAAW,QAAA,GAAW,SAAS,IAAA,CAAK,SAAA,CAAU,UAAU,IAAI,CAAA;AAAA,IAC5E;AAAA,GACF;AACF;AAIA,SAAS,eAAe,EAAA,EAAkB;AAExC,EAAA,kBAAA,CAAmB,EAAA,EAAI,EAAE,MAAA,EAAQ,EAAA,EAAI,CAAA;AACvC;AAEA,SAAS,WAAA,GAAsB;AAC7B,EAAA,OAAO,UAAA,CAAW,MAAA,CAAO,UAAA,EAAW,CAAE,OAAA,CAAQ,MAAM,EAAE,CAAA,CAAE,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA;AACpE;AAEA,SAAS,cAAc,CAAA,EAA6C;AAClE,EAAA,IAAI,CAAA,CAAE,IAAA,KAAS,UAAA,EAAY,OAAO,CAAA,CAAE,QAAA;AACpC,EAAA,IAAI,CAAA,CAAE,SAAS,QAAA,EAAU;AACvB,IAAA,MAAM,MAAA,GAAS,EAAE,UAAA,CAAW,GAAA,CAAI,CAAC,GAAG,MAAM,CAAA,KAAM,MAAM,CAAA;AACtD,IAAA,OAAO,CAAA,CAAE,aAAa,MAAA,GAAY,CAAC,GAAG,MAAA,EAAQ,CAAA,CAAE,QAAQ,CAAA,GAAI,MAAA;AAAA,EAC9D;AACA,EAAA,IAAI,CAAA,CAAE,IAAA,KAAS,SAAA,IAAa,CAAA,CAAE,IAAA,KAAS,SAAA,EAAW,OAAO,CAAC,CAAC,CAAA,CAAE,IAAI,CAAC,CAAA;AAClE,EAAA,OAAO,EAAC;AACV;AAEA,SAAS,mBAAA,CAAoB,OAA4B,IAAA,EAAyB;AAChF,EAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,IAAA,IAAI,IAAA,CAAK,IAAI,CAAA,CAAE,EAAE,GAAG,MAAM,IAAI,4BAAA,CAA6B,CAAA,CAAE,EAAE,CAAA;AAC/D,IAAA,IAAA,CAAK,GAAA,CAAI,EAAE,EAAE,CAAA;AACb,IAAA,KAAA,MAAW,MAAA,IAAU,aAAA,CAAc,CAAC,CAAA,EAAG;AACrC,MAAA,mBAAA,CAAoB,QAAQ,IAAI,CAAA;AAAA,IAClC;AAAA,EACF;AACF","file":"chunk-EON4YTR6.js","sourcesContent":["/**\n * SE28 — a minimal pushable async iterator for `Workflow.stream()`. The executor\n * pushes {@link WorkflowEvent}s as steps run; the consumer drains them via\n * `for await`. Buffers events emitted before the consumer is ready; `end()`\n * closes the iterator so a pending/next `next()` resolves `done: true`.\n *\n * @internal\n */\n\nimport type { WorkflowEvent } from \"../../types/workflow.js\";\n\nexport interface PushableEventStream extends AsyncIterableIterator<WorkflowEvent> {\n  push(event: WorkflowEvent): void;\n  end(): void;\n}\n\nexport function createEventStream(): PushableEventStream {\n  const buffer: WorkflowEvent[] = [];\n  const waiters: Array<(r: IteratorResult<WorkflowEvent>) => void> = [];\n  let ended = false;\n\n  const stream: PushableEventStream = {\n    push(event: WorkflowEvent): void {\n      if (ended) return;\n      const waiter = waiters.shift();\n      if (waiter !== undefined) waiter({ value: event, done: false });\n      else buffer.push(event);\n    },\n    end(): void {\n      if (ended) return;\n      ended = true;\n      for (const waiter of waiters.splice(0)) waiter({ value: undefined, done: true });\n    },\n    next(): Promise<IteratorResult<WorkflowEvent>> {\n      const buffered = buffer.shift();\n      if (buffered !== undefined) return Promise.resolve({ value: buffered, done: false });\n      if (ended) return Promise.resolve({ value: undefined, done: true });\n      return new Promise((resolve) => waiters.push(resolve));\n    },\n    // `for await` calls return() on break/throw — close early so events stop\n    // buffering in memory for a consumer that stopped iterating.\n    return(): Promise<IteratorResult<WorkflowEvent>> {\n      stream.end();\n      buffer.length = 0;\n      return Promise.resolve({ value: undefined, done: true });\n    },\n    [Symbol.asyncIterator](): PushableEventStream {\n      return stream;\n    },\n  };\n  return stream;\n}\n","/**\n * Public `Workflow` class — declarative multi-step orchestration over\n * `Agent.send`, `Handoff`, `Agent.batch` and friends (Adoption Roadmap #5;\n * ADRs D230-D248).\n *\n * Usage:\n *\n *   import { Agent } from \"@theokit/sdk\";\n *   import { Workflow, fn, agentStep } from \"@theokit/sdk/workflow\";\n *\n *   const classifier = await Agent.create({ ... });\n *   const wf = Workflow.create({ name: \"demo\" })\n *     .then(fn(\"validate\", (input: { id: string }) => {\n *       if (!input.id) throw new Error(\"missing id\");\n *       return input;\n *     }))\n *     .then(agentStep(\"classify\", classifier, (i) => `Classify: ${JSON.stringify(i)}`))\n *     .commit();\n *\n *   const run = await wf.run({ id: \"x\" });\n *   console.log(run.status, run.output);\n *\n * @public\n */\n\nimport type { ZodType } from \"zod\";\nimport { z } from \"zod\";\nimport { PersistenceSchema } from \"./internal/persistence/persistence-schema.js\";\nimport { sanitizeIdentifier } from \"./internal/security/path-guard.js\";\nimport { createEventStream } from \"./internal/workflow/event-stream.js\";\nimport { toJsonSchema } from \"./internal/zod/to-json-schema.js\";\nimport type { CustomTool, SDKAgent } from \"./types/agent.js\";\nimport type { MessageOrigin } from \"./types/run.js\";\nimport type {\n  AgentStep,\n  BranchStep,\n  DowhileStep,\n  FnStep,\n  ForeachStep,\n  ParallelStep,\n  RetryPolicy,\n  SleepStep,\n  Step,\n  StepContext,\n  SuspendStep,\n  WorkflowDescription,\n  WorkflowEvent,\n  WorkflowOptions,\n  WorkflowResumeOptions,\n  WorkflowRun,\n  WorkflowRunOptions,\n  WorkflowStepDescription,\n  WorkflowStream,\n} from \"./types/workflow.js\";\nimport { WorkflowDuplicateStepIdError, WorkflowNestedError } from \"./types/workflow.js\";\n\n/* ─── Zod validation schemas ─── */\n\nconst RetryPolicySchema = z.object({\n  // EC-3 absorbed: maxAttempts MUST be a finite int in [1, 20].\n  maxAttempts: z\n    .number()\n    .int(\"retry.maxAttempts must be integer\")\n    .min(1, \"retry.maxAttempts must be >= 1\")\n    .max(20, \"retry.maxAttempts must be <= 20\"),\n  initialBackoffMs: z.number().int().min(0).optional(),\n  backoffCoefficient: z.number().min(1).optional(),\n  maximumBackoffMs: z.number().int().min(0).optional(),\n  nonRetryableErrors: z.array(z.string()).optional(),\n});\n\nconst WorkflowOptionsSchema = z.object({\n  name: z.string().min(1).max(128),\n  persistence: PersistenceSchema,\n  // SE27 — declared so a future `new WorkflowBuilder(parsed)` refactor cannot\n  // silently drop them (create() passes the ORIGINAL options today, but the\n  // schema is also the documentation of the shape).\n  inputSchema: z.custom<ZodType>().optional(),\n  outputSchema: z.custom<ZodType>().optional(),\n});\n\n/* ─── Builder ─── */\n\nexport class WorkflowBuilder<TInput = unknown, TOutput = unknown> {\n  private readonly _steps: Step[] = [];\n  private _committed = false;\n\n  /** @internal */\n  constructor(private readonly options: WorkflowOptions) {}\n\n  /** @internal — only the executor reads this. */\n  get __steps(): ReadonlyArray<Step> {\n    return this._steps;\n  }\n\n  // biome-ignore lint/suspicious/noThenProperty: D233 locks the a peer framework-style `.then(step)` builder DSL. The method is fluent, never awaited.\n  then<TO = unknown>(step: Step): WorkflowBuilder<TInput, TO> {\n    this.assertNotCommitted();\n    validateStepId(step.id);\n    this._steps.push(step);\n    return this as unknown as WorkflowBuilder<TInput, TO>;\n  }\n\n  parallel(\n    branches: ReadonlyArray<ReadonlyArray<Step>>,\n    opts?: { id?: string; concurrency?: number; errorPolicy?: \"fail-fast\" | \"collect\" },\n  ): WorkflowBuilder<TInput, unknown[]> {\n    this.assertNotCommitted();\n    const id = opts?.id ?? `parallel_${this._steps.length}`;\n    validateStepId(id);\n    for (const branch of branches) {\n      for (const inner of branch) validateStepId(inner.id);\n    }\n    const step: ParallelStep = {\n      kind: \"parallel\",\n      id,\n      branches,\n      ...(opts?.concurrency !== undefined ? { concurrency: opts.concurrency } : {}),\n      ...(opts?.errorPolicy !== undefined ? { errorPolicy: opts.errorPolicy } : {}),\n    };\n    this._steps.push(step);\n    return this as unknown as WorkflowBuilder<TInput, unknown[]>;\n  }\n\n  branch(\n    predicates: BranchStep[\"predicates\"],\n    opts?: { id?: string; fallback?: ReadonlyArray<Step> },\n  ): WorkflowBuilder<TInput, unknown> {\n    this.assertNotCommitted();\n    const id = opts?.id ?? `branch_${this._steps.length}`;\n    validateStepId(id);\n    const step: BranchStep = {\n      kind: \"branch\",\n      id,\n      predicates,\n      ...(opts?.fallback !== undefined ? { fallback: opts.fallback } : {}),\n    };\n    this._steps.push(step);\n    return this as unknown as WorkflowBuilder<TInput, unknown>;\n  }\n\n  foreach(\n    iterableFrom: string,\n    step: Step,\n    opts?: { id?: string; concurrency?: number },\n  ): WorkflowBuilder<TInput, unknown[]> {\n    this.assertNotCommitted();\n    const id = opts?.id ?? `foreach_${this._steps.length}`;\n    validateStepId(id);\n    validateStepId(iterableFrom);\n    validateStepId(step.id);\n    const node: ForeachStep = {\n      kind: \"foreach\",\n      id,\n      iterableFrom,\n      step,\n      ...(opts?.concurrency !== undefined ? { concurrency: opts.concurrency } : {}),\n    };\n    this._steps.push(node);\n    return this as unknown as WorkflowBuilder<TInput, unknown[]>;\n  }\n\n  dowhile(\n    step: Step,\n    condFn: DowhileStep[\"condFn\"],\n    opts?: { id?: string; maxIterations?: number },\n  ): WorkflowBuilder<TInput, unknown> {\n    this.assertNotCommitted();\n    const id = opts?.id ?? `dowhile_${this._steps.length}`;\n    validateStepId(id);\n    validateStepId(step.id);\n    const node: DowhileStep = {\n      kind: \"dowhile\",\n      id,\n      step,\n      condFn,\n      ...(opts?.maxIterations !== undefined ? { maxIterations: opts.maxIterations } : {}),\n    };\n    this._steps.push(node);\n    return this as unknown as WorkflowBuilder<TInput, unknown>;\n  }\n\n  sleep(durationMs: number, id?: string): WorkflowBuilder<TInput, TOutput> {\n    this.assertNotCommitted();\n    const stepId = id ?? `sleep_${this._steps.length}`;\n    validateStepId(stepId);\n    if (!Number.isFinite(durationMs) || durationMs < 0) {\n      throw new Error(`sleep durationMs must be finite non-negative: ${durationMs}`);\n    }\n    const step: SleepStep = { kind: \"sleep\", id: stepId, durationMs };\n    this._steps.push(step);\n    return this;\n  }\n\n  suspend(opts?: { id?: string; payloadSchema?: ZodType }): WorkflowBuilder<TInput, unknown> {\n    this.assertNotCommitted();\n    const id = opts?.id ?? `suspend_${this._steps.length}`;\n    validateStepId(id);\n    const step: SuspendStep = {\n      kind: \"suspend\",\n      id,\n      ...(opts?.payloadSchema !== undefined ? { payloadSchema: opts.payloadSchema } : {}),\n    };\n    this._steps.push(step);\n    return this as unknown as WorkflowBuilder<TInput, unknown>;\n  }\n\n  commit(): Workflow<TInput, TOutput> {\n    this.assertNotCommitted();\n    this.validateUniqueIds();\n    this._committed = true;\n    // EC-5 absorbed: mint unique workflowId so single-flight lock is per-instance\n    const workflowId = `wf-${mintShortId()}`;\n    return new Workflow<TInput, TOutput>({ ...this.options, workflowId }, [...this._steps]);\n  }\n\n  private validateUniqueIds(): void {\n    const seen = new Set<string>();\n    walkStepsValidating(this._steps, seen);\n  }\n\n  private assertNotCommitted(): void {\n    if (this._committed) {\n      throw new Error(\"Workflow already committed; create a fresh Workflow.create(...) call.\");\n    }\n  }\n}\n\n/* ─── Workflow class ─── */\n\n/**\n * theokit#161 — project one step to its reflectable shape, recursing into the variants that nest.\n *\n * `parallel` branches are FLATTENED: the grouping is a scheduling detail (which steps may run\n * concurrently), not shape a reader of the workflow needs, and preserving it would put a second,\n * branch-shaped level into a type whose whole purpose is to be renderable.\n */\nfunction describeStep(step: Step): WorkflowStepDescription {\n  const base = { id: step.id, kind: step.kind } as const;\n  if (step.kind === \"parallel\") {\n    return { ...base, steps: step.branches.flat().map(describeStep) };\n  }\n  if (step.kind === \"branch\") {\n    const fromPredicates = step.predicates.flatMap(([, steps]) => steps.map(describeStep));\n    const fromFallback = (step.fallback ?? []).map(describeStep);\n    return { ...base, steps: [...fromPredicates, ...fromFallback] };\n  }\n  if (step.kind === \"foreach\" || step.kind === \"dowhile\") {\n    return { ...base, steps: [describeStep(step.step)] };\n  }\n  return base;\n}\n\nexport class Workflow<TInput = unknown, TOutput = unknown> {\n  /** @internal */\n  constructor(\n    private readonly _options: WorkflowOptions,\n    private readonly _steps: ReadonlyArray<Step>,\n  ) {}\n\n  /** @internal — only the executor reads these. */\n  get __options(): WorkflowOptions {\n    return this._options;\n  }\n  /** @internal */\n  get __steps(): ReadonlyArray<Step> {\n    return this._steps;\n  }\n\n  /**\n   * Construct a workflow builder. Validate options via Zod and return a\n   * `WorkflowBuilder` for fluent chaining. Call `.commit()` to obtain the\n   * immutable `Workflow`.\n   */\n  static create<TI = unknown, TO = unknown>(options: WorkflowOptions): WorkflowBuilder<TI, TO> {\n    WorkflowOptionsSchema.parse(options);\n    return new WorkflowBuilder<TI, TO>(options);\n  }\n\n  /**\n   * theokit#161 — describe this workflow's shape, for a reflection surface.\n   *\n   * Returns `{ name, steps }`, each step carrying its `id` and `kind`, recursing into `parallel`,\n   * `branch`, `foreach` and `dowhile`. Every executable a step holds — predicates, conditions,\n   * agents, prompt templates — is omitted: it cannot cross a process boundary and says nothing about\n   * shape.\n   *\n   * There is deliberately no `Workflow.list()`. A workflow is a value the caller constructs and\n   * holds, so the caller already knows which ones exist; a registry would add process-global state\n   * nothing releases in order to re-answer a question the host can answer itself. A reflection\n   * endpoint maps over its own workflows and calls this.\n   *\n   * @public\n   */\n  describe(): WorkflowDescription {\n    return {\n      name: this._options.name,\n      steps: this._steps.map(describeStep),\n    };\n  }\n\n  /**\n   * Run this workflow with the given input. Returns a populated\n   * `WorkflowRun`. Errors inside a step DO NOT throw — they propagate via\n   * `run.status === \"failed\"`.\n   */\n  async run(input: TInput, opts?: WorkflowRunOptions): Promise<WorkflowRun<TOutput>> {\n    // Lazy import to keep the public façade lean.\n    const { executeWorkflow } = await import(\"./internal/workflow/executor.js\");\n    const result = await executeWorkflow<TInput, TOutput>(this._options, this._steps, input, opts);\n    // T3.4: opt-in Task wrapping (ADRs D363, D374). Workflows are\n    // observable via Task.list/get/subscribe; the underlying run is\n    // already terminal here (executor returned), so the Task just\n    // records the outcome for inspection.\n    if (opts?.task !== undefined) {\n      const { submit: taskSubmit } = await import(\"./internal/task/registry.js\");\n      const taskOpts = opts.task === true ? {} : opts.task;\n      const id = taskOpts.id ?? `wf-${result.id}`;\n      await taskSubmit({\n        kind: \"workflow\",\n        work: async (ctx) => {\n          ctx.emit({ status: result.status, runId: result.id });\n          return { status: result.status, runId: result.id, output: result.output };\n        },\n        id,\n        meta: {\n          workflowName: this._options.name,\n          runId: result.id,\n          status: result.status,\n          ...(taskOpts.meta ?? {}),\n        },\n        allowReservedPrefix: true,\n      });\n    }\n    return result;\n  }\n\n  /**\n   * SE28 — run the workflow and STREAM step-level events as they happen. Returns\n   * an async iterator of {@link WorkflowEvent}s (`step_started` / `step_completed`\n   * / `step_failed` / `workflow_suspended` / `workflow_completed`, top-level\n   * steps) plus a `result` promise resolving to the same terminal\n   * {@link WorkflowRun} `run()` returns. Iterate for progress; await `result` for\n   * the outcome. The stream ends when the run terminates.\n   *\n   * `result` is the AUTHORITATIVE terminal status. Not every terminal state has a\n   * closing event: a step failure emits `step_failed`, but an `outputSchema`\n   * rejection (SE27) or an abort ends the stream WITHOUT `workflow_completed` —\n   * always `await result` to read the final `status`. Consuming order is free:\n   * awaiting `result` without draining, or draining without awaiting `result`,\n   * both work (breaking out of `for await` stops the buffering early).\n   */\n  stream(input: TInput, opts?: WorkflowRunOptions): WorkflowStream<TOutput> {\n    const queue = createEventStream();\n    const result = (async (): Promise<WorkflowRun<TOutput>> => {\n      const { executeWorkflow } = await import(\"./internal/workflow/executor.js\");\n      try {\n        return await executeWorkflow<TInput, TOutput>(this._options, this._steps, input, {\n          ...opts,\n          onStepEvent: (event: WorkflowEvent) => queue.push(event),\n        } as WorkflowRunOptions);\n      } finally {\n        queue.end(); // authoritative terminal is `result`; close the stream\n      }\n    })();\n    return Object.assign(queue, { result });\n  }\n\n  /**\n   * Resume a suspended workflow from its snapshot. Throws\n   * `WorkflowSnapshotNotFoundError` if `runId` is unknown.\n   */\n  static async resume<TO = unknown>(opts: WorkflowResumeOptions): Promise<WorkflowRun<TO>> {\n    const { resumeWorkflow } = await import(\"./internal/workflow/executor.js\");\n    return resumeWorkflow<TO>(opts);\n  }\n}\n\n/* ─── Helper factory functions ─── */\n\n/**\n * Build a `FnStep`. `id` must match `^[a-z0-9][a-z0-9_-]*$`.\n */\nexport function fn<I = unknown, O = unknown>(\n  id: string,\n  step: (input: I, ctx: StepContext) => Promise<O> | O,\n  opts?: { inputSchema?: ZodType; outputSchema?: ZodType; retry?: RetryPolicy },\n): FnStep {\n  validateStepId(id);\n  if (opts?.retry !== undefined) RetryPolicySchema.parse(opts.retry);\n  return {\n    kind: \"fn\",\n    id,\n    fn: step as FnStep[\"fn\"],\n    ...(opts?.inputSchema !== undefined ? { inputSchema: opts.inputSchema } : {}),\n    ...(opts?.outputSchema !== undefined ? { outputSchema: opts.outputSchema } : {}),\n    ...(opts?.retry !== undefined ? { retry: opts.retry } : {}),\n  };\n}\n\n/**\n * Build an `AgentStep`. The `promptTemplate` can be a static string or a\n * function that receives the input and returns the prompt.\n */\nexport function agentStep(\n  id: string,\n  agent: SDKAgent,\n  promptTemplate: string | ((input: unknown) => string),\n  opts?: { retry?: RetryPolicy; origin?: MessageOrigin },\n): AgentStep {\n  validateStepId(id);\n  if (opts?.retry !== undefined) RetryPolicySchema.parse(opts.retry);\n  return {\n    kind: \"agent\",\n    id,\n    agent,\n    promptTemplate,\n    ...(opts?.retry !== undefined ? { retry: opts.retry } : {}),\n    // SE3 — carry the turn's provenance down to `agent.send()` (metadata-only).\n    ...(opts?.origin !== undefined ? { origin: opts.origin } : {}),\n  };\n}\n\n/**\n * SE30 — use a committed {@link Workflow} as a step inside another workflow.\n * Wraps the child as an `FnStep` (opaque — the child runs in its OWN executor\n * with its own id-space, so nested step-ids never collide with the parent's).\n * The child's output becomes the step output. A non-`completed` child fails the\n * parent step with a typed {@link WorkflowNestedError}: nested `suspended` is NOT\n * resumable in v1 (resume continues AFTER the step — the child would be skipped;\n * use a top-level suspend). See ADR 0010.\n *\n * @public\n */\nexport function workflowStep<TI = unknown, TO = unknown>(\n  child: Workflow<TI, TO>,\n  opts?: { id?: string },\n): FnStep {\n  const id = opts?.id ?? `workflow_${child.__options.name}`;\n  validateStepId(id);\n  return {\n    kind: \"fn\",\n    id,\n    fn: async (input: unknown, ctx: StepContext): Promise<unknown> => {\n      const run = await child.run(input as TI, { signal: ctx.signal });\n      if (run.status === \"completed\") return run.output;\n      throw new WorkflowNestedError(id, child.__options.name, run.status, run.error);\n    },\n  };\n}\n\n/**\n * SE30 — clone a committed workflow under a new id/name. The clone runs\n * independently (its own single-flight lock + observability identity) with the\n * same committed steps. Mirrors a peer framework's `cloneWorkflow`.\n *\n * @public\n */\nexport function cloneWorkflow<TI = unknown, TO = unknown>(\n  wf: Workflow<TI, TO>,\n  opts: { id: string },\n): Workflow<TI, TO> {\n  return new Workflow<TI, TO>(\n    { ...wf.__options, name: opts.id, workflowId: `wf-${mintShortId()}` },\n    [...wf.__steps],\n  );\n}\n\n/* ─── Test seam re-export ─── */\n\nexport { __resetSnapshotStoresForTests } from \"./internal/workflow/snapshot-store.js\";\n\n/* ─── Re-exports for ergonomics (errors + all public types). After the\n       sub-path extraction `@theokit/sdk/workflow` is the single import site,\n       so type aliases must surface here (previously they reached consumers\n       via `types/index.ts:25 export type * from \"./workflow.js\"`, which the\n       extraction removes). ─── */\n\nexport type * from \"./types/workflow.js\";\nexport {\n  WorkflowAlreadyRunningError,\n  WorkflowCompensateNotImplementedError,\n  WorkflowDuplicateStepIdError,\n  WorkflowInputError,\n  WorkflowMaxIterationsExceededError,\n  WorkflowNestedError,\n  WorkflowNotSerializableError,\n  WorkflowOutputError,\n  WorkflowParallelError,\n  WorkflowResumeStepNotFoundError,\n  WorkflowSnapshotNotFoundError,\n  WorkflowStateError,\n} from \"./types/workflow.js\";\n\n/* ─── SE19 — workflowAsTool (expose a Workflow as an agent tool) ─── */\n\n/**\n * Raised by a {@link workflowAsTool} tool when the wrapped workflow run does not\n * reach `status: \"completed\"` (a step failed, the run was cancelled/suspended).\n * The dispatch converts it to a `tool_result(isError)`.\n *\n * @public\n */\nexport class WorkflowToolError extends Error {\n  readonly code = \"workflow_tool_failed\" as const;\n  constructor(\n    readonly toolName: string,\n    readonly workflowStatus: string,\n    readonly workflowError?: { name: string; message: string },\n  ) {\n    super(\n      `workflowAsTool(\"${toolName}\"): workflow ${workflowStatus}${\n        workflowError ? `: ${workflowError.message}` : \"\"\n      }`,\n    );\n    this.name = \"WorkflowToolError\";\n  }\n}\n\n/** Spec for {@link workflowAsTool}. `inputSchema` is the workflow's input shape (Zod). */\nexport interface WorkflowAsToolSpec<T extends ZodType> {\n  /** Tool name surfaced to the LLM. Same constraints as a `CustomTool.name`. */\n  name: string;\n  /** Description surfaced to the LLM — when the agent should trigger the workflow. */\n  description: string;\n  /** Zod schema for the workflow's input (a `Workflow` carries no top-level schema). */\n  inputSchema: T;\n}\n\n/**\n * SE19 — expose a {@link Workflow} as an agent {@link CustomTool}, completing the\n * \"X as tools\" trio (tools; agents-as-tools via `defineSubAgent`; workflows-as-tools).\n * The handler validates the model's args against `spec.inputSchema`, runs the\n * workflow, and returns its output (a string as-is, else JSON). A run that does not\n * reach `status: \"completed\"` raises a typed {@link WorkflowToolError} (workflow\n * step errors do NOT throw — they surface via `run.status === \"failed\"`).\n *\n * Accepts any `{ run }`-shaped workflow (structural), so it never imports the\n * `Workflow` class directly.\n *\n * @public\n */\nexport function workflowAsTool<T extends ZodType, TOutput = unknown>(\n  workflow: { run: (input: z.infer<T>) => Promise<WorkflowRun<TOutput>> },\n  spec: WorkflowAsToolSpec<T>,\n): CustomTool {\n  const inputSchema = toJsonSchema(spec.inputSchema, { unrepresentable: \"any\" });\n  return {\n    name: spec.name,\n    description: spec.description,\n    inputSchema,\n    handler: async (rawInput: Record<string, unknown>): Promise<string> => {\n      const parsed = spec.inputSchema.parse(rawInput) as z.infer<T>;\n      const run = await workflow.run(parsed);\n      if (run.status !== \"completed\") {\n        throw new WorkflowToolError(spec.name, run.status, run.error);\n      }\n      const output = run.output;\n      return typeof output === \"string\" ? output : JSON.stringify(output ?? null);\n    },\n  };\n}\n\n/* ─── Internal helpers ─── */\n\nfunction validateStepId(id: string): void {\n  // Reuses D81 grammar: ^[a-z0-9][a-z0-9_-]*$\n  sanitizeIdentifier(id, { maxLen: 64 });\n}\n\nfunction mintShortId(): string {\n  return globalThis.crypto.randomUUID().replace(/-/g, \"\").slice(0, 8);\n}\n\nfunction nestedStepsOf(s: Step): ReadonlyArray<ReadonlyArray<Step>> {\n  if (s.kind === \"parallel\") return s.branches;\n  if (s.kind === \"branch\") {\n    const groups = s.predicates.map(([, branch]) => branch);\n    return s.fallback !== undefined ? [...groups, s.fallback] : groups;\n  }\n  if (s.kind === \"foreach\" || s.kind === \"dowhile\") return [[s.step]];\n  return [];\n}\n\nfunction walkStepsValidating(steps: ReadonlyArray<Step>, seen: Set<string>): void {\n  for (const s of steps) {\n    if (seen.has(s.id)) throw new WorkflowDuplicateStepIdError(s.id);\n    seen.add(s.id);\n    for (const nested of nestedStepsOf(s)) {\n      walkStepsValidating(nested, seen);\n    }\n  }\n}\n"]}

package/dist/{chunk-MI3OKONE.js → chunk-F4RUADRC.js}

@@ -1,5 +1,5 @@
 import { withCwdMutex } from './chunk-2XLKLVVR.js';
-import { ConfigurationError } from './chunk-VQ33XLC6.js';
+import { ConfigurationError } from './chunk-MRKSSN36.js';
 import { AsyncLocalStorage } from 'async_hooks';
 
 // src/internal/llm/credential-pool-types.ts
@@ -285,5 +285,5 @@ function currentCredentialPool(provider) {
 }
 
 export { CredentialPool, computeBackoffMs, currentCredentialPool, newPooledCredential, sleepWithAbort, withCredentialPool };
-//# sourceMappingURL=chunk-MI3OKONE.js.map
-//# sourceMappingURL=chunk-MI3OKONE.js.map
+//# sourceMappingURL=chunk-F4RUADRC.js.map
+//# sourceMappingURL=chunk-F4RUADRC.js.map

package/dist/{chunk-MI3OKONE.js.map → chunk-F4RUADRC.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/internal/llm/credential-pool-types.ts","../src/internal/llm/retry.ts","../src/internal/llm/credential-pool.ts","../src/internal/llm/credential-pool-context.ts"],"names":["picked"],"mappings":";;;;;AAyFO,IAAM,WAAA,GAAgD;AAAA,EAC3D,GAAA,EAAK,IAAI,EAAA,GAAK,GAAA;AAAA;AAAA,EACd,GAAA,EAAK,KAAK,EAAA,GAAK,GAAA;AAAA;AAAA,EACf,GAAA,EAAK,KAAK,EAAA,GAAK;AAAA;AACjB,CAAA;AAGO,IAAM,mBAAA,GAAsB,KAAK,EAAA,GAAK,GAAA;;;AC7D7C,IAAM,eAAA,GAAkB,GAAA;AACxB,IAAM,cAAA,GAAiB,IAAA;AAchB,SAAS,iBAAiB,IAAA,EAA8B;AAC7D,EAAA,MAAM,IAAA,GAAO,KAAK,MAAA,IAAU,eAAA;AAC5B,EAAA,MAAM,GAAA,GAAM,KAAK,KAAA,IAAS,cAAA;AAC1B,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,IAAO,IAAA,CAAK,MAAA;AAC7B,EAAA,IAAI,IAAA,CAAK,YAAA,KAAiB,MAAA,IAAa,IAAA,CAAK,gBAAgB,CAAA,EAAG;AAC7D,IAAA,OAAO,IAAA,CAAK,IAAI,IAAA,EAAM,IAAA,CAAK,IAAI,GAAA,EAAK,IAAA,CAAK,YAAY,CAAC,CAAA;AAAA,EACxD;AACA,EAAA,MAAM,UAAU,IAAA,CAAK,GAAA,CAAI,KAAK,IAAA,GAAO,CAAA,IAAK,KAAK,OAAO,CAAA;AACtD,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,EAAI,GAAI,OAAO,CAAA;AACnC;AASO,SAAS,cAAA,CAAe,IAAY,MAAA,EAAoC;AAC7E,EAAA,IAAI,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,EAAS,OAAO,QAAQ,OAAA,EAAQ;AACtD,EAAA,OAAO,IAAI,OAAA,CAAc,CAAC,OAAA,KAAY;AACpC,IAAA,MAAM,KAAA,GAAQ,WAAW,MAAM;AAC7B,MAAA,MAAA,CAAO,mBAAA,CAAoB,SAAS,OAAO,CAAA;AAC3C,MAAA,OAAA,EAAQ;AAAA,IACV,GAAG,EAAE,CAAA;AACL,IAAA,MAAM,UAAU,MAAY;AAC1B,MAAA,YAAA,CAAa,KAAK,CAAA;AAClB,MAAA,OAAA,EAAQ;AAAA,IACV,CAAA;AACA,IAAA,MAAA,CAAO,iBAAiB,OAAA,EAAS,OAAA,EAAS,EAAE,IAAA,EAAM,MAAM,CAAA;AAAA,EAC1D,CAAC,CAAA;AACH;;;AC/CO,SAAS,oBAAoB,IAAA,EAMf;AACnB,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,UAAA,CAAW,MAAA,CAAO,UAAA,EAAW;AAAA,IACjC,OAAO,IAAA,CAAK,KAAA,IAAS,gBAAgB,IAAA,CAAK,MAAA,EAAQ,KAAK,WAAW,CAAA;AAAA,IAClE,UAAU,IAAA,CAAK,QAAA;AAAA,IACf,UAAU,IAAA,CAAK,QAAA;AAAA,IACf,QAAQ,IAAA,CAAK,MAAA;AAAA,IACb,aAAa,IAAA,CAAK,WAAA;AAAA,IAClB,UAAA,EAAY,IAAA;AAAA,IACZ,YAAA,EAAc,MAAA;AAAA,IACd,aAAA,EAAe,MAAA;AAAA,IACf,gBAAA,EAAkB,MAAA;AAAA,IAClB,YAAA,EAAc;AAAA,GAChB;AACF;AAQA,SAAS,eAAA,CAAgB,QAAgB,WAAA,EAA6B;AACpE,EAAA,IAAI,OAAO,UAAA,CAAW,MAAM,GAAG,OAAO,MAAA,CAAO,MAAM,CAAC,CAAA;AACpD,EAAA,MAAM,MAAA,GACJ,WAAA,CAAY,MAAA,GAAS,CAAA,GAAI,GAAG,WAAA,CAAY,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA,MAAA,EAAI,WAAA,CAAY,KAAA,CAAM,EAAE,CAAC,CAAA,CAAA,GAAK,KAAA;AACnF,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,MAAM,CAAA,CAAA;AAC5B;AAYO,IAAM,cAAA,GAAN,MAAM,eAAA,CAAe;AAAA,EACjB,QAAA;AAAA,EACQ,QAAA;AAAA,EACT,OAAA;AAAA,EAER,WAAA,CACE,QAAA,EACA,OAAA,EACA,QAAA,GAAmC,YAAA,EACnC;AACA,IAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AACxB,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,8DAA8D,QAAQ,CAAA,CAAA,CAAA;AAAA,QACtE,EAAE,MAAM,uBAAA;AAAwB,OAClC;AAAA,IACF;AACA,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAChB,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAEhB,IAAA,IAAA,CAAK,OAAA,GAAU,aAAA,CAAc,OAAO,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,QAAA,GAAW,CAAA,CAAE,QAAQ,CAAA;AAAA,EAC9E;AAAA;AAAA,EAGA,cAAA,GAA0B;AACxB,IAAA,OAAO,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AAAA,EAC/B;AAAA;AAAA,EAGA,YAAA,GAAwB;AACtB,IAAA,OAAO,IAAA,CAAK,gBAAA,EAAiB,CAAE,MAAA,GAAS,CAAA;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,eAAA,GAAsC;AACpC,IAAA,IAAI,QAAA;AACJ,IAAA,KAAA,MAAW,KAAA,IAAS,KAAK,OAAA,EAAS;AAChC,MAAA,IAAI,KAAA,CAAM,eAAe,IAAA,EAAM;AAC/B,MAAA,IAAI,KAAA,CAAM,qBAAqB,MAAA,EAAW;AAC1C,MAAA,IAAI,QAAA,KAAa,MAAA,IAAa,KAAA,CAAM,gBAAA,GAAmB,QAAA,EAAU;AAC/D,QAAA,QAAA,GAAW,KAAA,CAAM,gBAAA;AAAA,MACnB;AAAA,IACF;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,MAAM,gBAAA,CACJ,MAAA,EACA,IAAA,EAIkB;AAClB,IAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,IAAA,IAAI,IAAA,CAAK,YAAA,EAAa,EAAG,OAAO,IAAA;AAChC,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,cAAA;AAChC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,EAAI,GAAI,IAAA,CAAK,SAAA;AACnC,IAAA,OAAO,IAAA,CAAK,GAAA,EAAI,GAAI,QAAA,EAAU;AAC5B,MAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,sBAAA,CAAuB,QAAQ,CAAA;AACrD,MAAA,MAAM,OAAA,CAAQ,UAAU,MAAM,CAAA;AAC9B,MAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,MAAA,IAAI,IAAA,CAAK,YAAA,EAAa,EAAG,OAAO,IAAA;AAAA,IAClC;AACA,IAAA,OAAO,KAAK,YAAA,EAAa;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,uBAAuB,QAAA,EAA0B;AACvD,IAAA,MAAM,OAAA,GAAU,KAAK,eAAA,EAAgB;AACrC,IAAA,MAAM,SAAA,GAAY,QAAA,GAAW,IAAA,CAAK,GAAA,EAAI;AACtC,IAAA,MAAM,UACJ,OAAA,KAAY,MAAA,GACR,KAAK,GAAA,CAAI,SAAA,EAAW,GAAG,CAAA,GACvB,IAAA,CAAK,IAAI,SAAA,EAAW,IAAA,CAAK,IAAI,CAAA,EAAG,OAAA,GAAU,KAAK,GAAA,EAAK,IAAI,EAAE,CAAA;AAChE,IAAA,OAAO,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,MAAM,IAAA,CAAK,MAAA,EAAO,GAAI,OAAO,CAAC,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,IAAA,GAAoC;AAClC,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,MAAA,GAA2C;AAC/C,IAAA,OAAO,YAAA,CAAa,mBAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY,IAAA,CAAK,cAAc,CAAA;AAAA,EACzF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,uBAAuB,IAAA,EAIQ;AACnC,IAAA,OAAO,YAAA,CAAa,CAAA,gBAAA,EAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY;AAClE,MAAA,MAAM,KAAA,GAAQ,KAAK,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,IAAA,CAAK,OAAO,CAAA;AAC5D,MAAA,IAAI,UAAU,MAAA,EAAW;AACvB,QAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,QAAA,MAAM,QAAA,GAAW,WAAA,CAAY,IAAA,CAAK,UAAU,CAAA,IAAK,mBAAA;AACjD,QAAA,KAAA,CAAM,UAAA,GAAa,WAAA;AACnB,QAAA,KAAA,CAAM,YAAA,GAAe,GAAA;AACrB,QAAA,KAAA,CAAM,gBAAgB,IAAA,CAAK,UAAA;AAE3B,QAAA,KAAA,CAAM,gBAAA,GACJ,KAAK,SAAA,KAAc,MAAA,IAAa,KAAK,SAAA,GAAY,GAAA,GAAM,IAAA,CAAK,SAAA,GAAY,GAAA,GAAM,QAAA;AAAA,MAClF;AACA,MAAA,OAAO,KAAK,YAAA,EAAa;AAAA,IAC3B,CAAC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,QAAA,GAA0B;AAC9B,IAAA,MAAM,YAAA,CAAa,CAAA,gBAAA,EAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY;AACjE,MAAA,KAAA,MAAW,CAAA,IAAK,KAAK,OAAA,EAAS;AAC5B,QAAA,CAAA,CAAE,UAAA,GAAa,IAAA;AACf,QAAA,CAAA,CAAE,YAAA,GAAe,MAAA;AACjB,QAAA,CAAA,CAAE,aAAA,GAAgB,MAAA;AAClB,QAAA,CAAA,CAAE,gBAAA,GAAmB,MAAA;AAAA,MACvB;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,UAAA,GAAqC;AACnC,IAAA,OAAO;AAAA,MACL,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,OAAA,EAAS,KAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAE,CAAE;AAAA,KAC7C;AAAA,EACF;AAAA;AAAA,EAGA,OAAO,aAAa,QAAA,EAAkD;AACpE,IAAA,OAAO,IAAI,eAAA,CAAe,QAAA,CAAS,UAAU,QAAA,CAAS,OAAA,EAAS,SAAS,QAAQ,CAAA;AAAA,EAClF;AAAA;AAAA;AAAA,EAKQ,YAAA,GAAwC;AAC9C,IAAA,MAAM,SAAA,GAAY,KAAK,gBAAA,EAAiB;AACxC,IAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAEnC,IAAA,IAAI,IAAA,CAAK,aAAa,QAAA,EAAU;AAC9B,MAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAM,KAAK,MAAA,EAAO,GAAI,UAAU,MAAM,CAAA;AACvD,MAAA,MAAMA,OAAAA,GAAS,UAAU,GAAG,CAAA;AAC5B,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,OAAOA,OAAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,YAAA,IAAgB,SAAA,CAAU,SAAS,CAAA,EAAG;AAE1D,MAAA,MAAMA,OAAAA,GAAS,CAAC,GAAG,SAAS,CAAA,CAAE,IAAA;AAAA,QAC5B,CAAC,GAAG,CAAA,KAAM,CAAA,CAAE,eAAe,CAAA,CAAE,YAAA,IAAgB,CAAA,CAAE,QAAA,GAAW,CAAA,CAAE;AAAA,QAC5D,CAAC,CAAA;AACH,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,OAAOA,OAAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,aAAA,IAAiB,SAAA,CAAU,SAAS,CAAA,EAAG;AAE3D,MAAA,MAAMA,OAAAA,GAAS,UAAU,CAAC,CAAA;AAC1B,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,MAAM,IAAA,GAAO,KAAK,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAOA,OAAAA,CAAO,EAAE,CAAA;AAI1D,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,OAAA,CAAQ,MAAA,GAAS,CAAA;AAC1C,MAAA,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACrB,QAAA,CAAA,CAAE,QAAA,GAAW,CAAA;AAAA,MACf,CAAC,CAAA;AACD,MAAAA,QAAO,QAAA,GAAW,WAAA;AAClB,MAAA,IAAA,CAAK,OAAA,GAAU,CAAC,GAAG,IAAA,EAAMA,OAAM,CAAA;AAC/B,MAAA,OAAOA,OAAAA;AAAA,IACT;AAGA,IAAA,MAAM,MAAA,GAAS,UAAU,CAAC,CAAA;AAC1B,IAAA,IAAI,MAAA,KAAW,QAAW,OAAO,IAAA;AACjC,IAAA,MAAA,CAAO,YAAA,IAAgB,CAAA;AACvB,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,gBAAA,GAAuC;AAC7C,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,MAAM,MAA0B,EAAC;AACjC,IAAA,KAAA,MAAW,KAAA,IAAS,KAAK,OAAA,EAAS;AAChC,MAAA,IAAI,KAAA,CAAM,eAAe,IAAA,EAAM;AAC7B,QAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AACd,QAAA;AAAA,MACF;AAEA,MAAA,MAAM,UAAU,KAAA,CAAM,gBAAA;AACtB,MAAA,IAAI,OAAA,KAAY,MAAA,IAAa,GAAA,IAAO,OAAA,EAAS;AAC3C,QAAA,KAAA,CAAM,UAAA,GAAa,IAAA;AACnB,QAAA,KAAA,CAAM,YAAA,GAAe,MAAA;AACrB,QAAA,KAAA,CAAM,aAAA,GAAgB,MAAA;AACtB,QAAA,KAAA,CAAM,gBAAA,GAAmB,MAAA;AACzB,QAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,MAChB;AAAA,IACF;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AACF;AAMA,SAAS,cAAc,OAAA,EAAiD;AACtE,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,MAA0B,EAAC;AACjC,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,WAAW,CAAA,EAAG;AAC7B,IAAA,IAAA,CAAK,GAAA,CAAI,EAAE,WAAW,CAAA;AACtB,IAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACZ;AACA,EAAA,OAAO,GAAA;AACT;ACvUA,IAAM,mBAAA,GAAsB,IAAI,iBAAA,EAA+C;AAS/E,eAAsB,kBAAA,CACpB,OACA,EAAA,EACY;AACZ,EAAA,OAAO,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,EAAE,CAAA;AAC1C;AAQO,SAAS,sBAAsB,QAAA,EAA8C;AAClF,EAAA,OAAO,mBAAA,CAAoB,QAAA,EAAS,EAAG,GAAA,CAAI,QAAQ,CAAA;AACrD","file":"chunk-MI3OKONE.js","sourcesContent":["/**\n * Types for the credential pool subsystem (ADRs D123-D133).\n *\n * Pool a developer's multiple API keys for the SAME provider so the SDK\n * can rotate transparently on HTTP 429/402/401 instead of jumping\n * straight to a different provider via `FallbackLlmClient`.\n *\n * @internal\n */\n\n/**\n * Rotation strategy when picking the next credential from a pool.\n *\n * - `fill_first` (default): use entries[0] until exhausted, then [1]…\n * - `round_robin`: rotate after each `select()`\n * - `least_used`: pick the entry with the lowest `requestCount`\n * - `random`: random pick among healthy entries\n *\n * Closed enum per ADR D124 — adding a strategy is an explicit semver\n * minor that updates `selectByStrategy` exhaustively.\n *\n * @internal\n */\nexport type CredentialPoolStrategy = \"fill_first\" | \"round_robin\" | \"least_used\" | \"random\";\n\n/** Health flag tracked per credential. */\nexport type CredentialStatus = \"ok\" | \"exhausted\";\n\n/**\n * Provenance of a credential — where it came from when seeded.\n * Free-form string; conventional prefixes:\n *\n * - `env:<VAR_NAME>` — auto-discovered from environment variable\n * - `manual` — added via explicit `apiKeys` config\n * - `explicit-apikey` — wrapped from `AgentOptions.apiKey` single-key path (D132)\n */\nexport type CredentialSource = string;\n\n/**\n * Single credential entry inside a {@link CredentialPool}.\n *\n * `accessToken` is the sensitive field — must never be logged unredacted.\n * The lint gate `tests/lint/no-unredacted-pool-token.test.ts` enforces this.\n *\n * @internal\n */\nexport interface PooledCredential {\n  /** Stable identifier (uuid v4) for log lines + telemetry. */\n  id: string;\n  /** Human-readable label for `Theokit.credentialPool.list()`. */\n  label: string;\n  /** Provider name (matches `ProviderProfile.name`). */\n  provider: string;\n  /** Sort key; lower = earlier in fill_first. Unique within a pool. */\n  priority: number;\n  /** Provenance string. */\n  source: CredentialSource;\n  /** Sensitive API key. NEVER LOG UNREDACTED. */\n  accessToken: string;\n  /** Current health. */\n  lastStatus: CredentialStatus;\n  /** Epoch ms of the last status change. */\n  lastStatusAt: number | undefined;\n  /** HTTP code that caused exhaustion (401/402/429). */\n  lastErrorCode: number | undefined;\n  /** Provider-supplied \"retry after this epoch ms\" hint. Overrides cooldown defaults. */\n  lastErrorResetAt: number | undefined;\n  /** Bumped per successful `select()` for `least_used` strategy. Lazy-persisted. */\n  requestCount: number;\n}\n\n/**\n * Serializable snapshot of a single provider's pool. Used by the\n * persistence layer (T2.1) to read/write `~/.theokit/credential-pool.json`.\n *\n * @internal\n */\nexport interface CredentialPoolSnapshot {\n  provider: string;\n  strategy: CredentialPoolStrategy;\n  entries: PooledCredential[];\n}\n\n/**\n * Cooldown ladder by HTTP error code (ADR D125). Provider-supplied\n * `lastErrorResetAt` overrides these defaults when present.\n *\n * @internal\n */\nexport const COOLDOWN_MS: Readonly<Record<number, number>> = {\n  401: 5 * 60 * 1000, // 5 minutes — OAuth refresh can recover quickly\n  402: 60 * 60 * 1000, // 1 hour — billing quota typically hourly+\n  429: 60 * 60 * 1000, // 1 hour — daily-rate-limit windows\n};\n\n/** Default cooldown when no specific code matches. */\nexport const DEFAULT_COOLDOWN_MS = 60 * 60 * 1000;\n","/**\n * T3.4 — exponential backoff with full jitter for credential-pool retry.\n *\n * Why we need this: pre-T3.4 `pool-aware-client.ts:79-83` retried the\n * SAME credential immediately on the first 429 without any wait. When\n * every credential in the pool returned 429 (thundering herd against a\n * shared quota), the client burned through all 5 retry attempts in <1ms,\n * tripped `CredentialPoolExhaustedError`, and surfaced to the agent loop\n * as a hard failure. The user-visible symptom was \"all my keys are\n * exhausted!\" when in reality a 1-2s wait would have cleared the rate\n * limit.\n *\n * AWS Architecture Blog \"Exponential Backoff And Jitter\" (Marc Brooker,\n * 2015) demonstrates full jitter as the canonical pattern: `sleep =\n * random_between(0, base * 2^attempt)`. We extend it with a hard cap\n * (so a 32s sleep never blocks an interactive agent) and honor the\n * provider's `Retry-After` hint when present — the hint always wins over\n * the computed value when it falls within `[base, cap]`.\n *\n * @internal\n */\n\nexport interface BackoffOptions {\n  /** 0-indexed retry attempt number. */\n  attempt: number;\n  /** Base delay in ms (multiplier for 2^attempt). Default 500. */\n  baseMs?: number;\n  /** Hard cap in ms — backoff never sleeps longer than this. Default 32_000. */\n  capMs?: number;\n  /** Provider's Retry-After hint in ms (from header). Takes precedence when in-range. */\n  retryAfterMs?: number;\n  /** Random source — pass a deterministic mock from tests. Default `Math.random`. */\n  rng?: () => number;\n}\n\nconst DEFAULT_BASE_MS = 500;\nconst DEFAULT_CAP_MS = 32_000;\n\n/**\n * Compute the next sleep duration (ms) before retrying a failed request.\n *\n * Algorithm:\n * 1. If `retryAfterMs` is set, prefer it — clamped to `[baseMs, capMs]`.\n *    The provider's hint is the most accurate available signal.\n * 2. Otherwise: `sleep = random(0, min(cap, base * 2^attempt))` — full\n *    jitter per Brooker 2015 ensures coordinated clients (each with\n *    different RNG seeds) spread the retry storm.\n *\n * @internal\n */\nexport function computeBackoffMs(opts: BackoffOptions): number {\n  const base = opts.baseMs ?? DEFAULT_BASE_MS;\n  const cap = opts.capMs ?? DEFAULT_CAP_MS;\n  const rng = opts.rng ?? Math.random;\n  if (opts.retryAfterMs !== undefined && opts.retryAfterMs >= 0) {\n    return Math.max(base, Math.min(cap, opts.retryAfterMs));\n  }\n  const ceiling = Math.min(cap, base * 2 ** opts.attempt);\n  return Math.floor(rng() * ceiling);\n}\n\n/**\n * `setTimeout`-based sleep that resolves early when the abort signal fires.\n * Resolves cleanly (does not throw on abort) so callers decide how to\n * react to the abort downstream.\n *\n * @internal\n */\nexport function sleepWithAbort(ms: number, signal: AbortSignal): Promise<void> {\n  if (ms <= 0 || signal.aborted) return Promise.resolve();\n  return new Promise<void>((resolve) => {\n    const timer = setTimeout(() => {\n      signal.removeEventListener(\"abort\", onAbort);\n      resolve();\n    }, ms);\n    const onAbort = (): void => {\n      clearTimeout(timer);\n      resolve();\n    };\n    signal.addEventListener(\"abort\", onAbort, { once: true });\n  });\n}\n","/**\n * In-memory credential pool with strategy-based rotation (ADRs D123-D133).\n *\n * Pure logic. No I/O — persistence lives in `internal/persistence/\n * credential-pool-store.ts`. The pool is the single source of truth for\n * rotation state within a process; if it diverges from disk (e.g.,\n * process killed mid-rotation per EC-I), the next save heals the\n * inconsistency — at the cost of one extra HTTP 429 per crash.\n *\n * Thread safety: the pool uses an in-process async-aware mutex\n * (`cwd-mutex` D9 keyed by `credential-pool:${provider}`). Cross-process\n * safety happens at the persistence layer via `withFileLock` (D61).\n * Two Node processes sharing the same file may double-pick momentarily\n * (worst case = 1 extra 429 per race) — acceptable per ADR D128.\n *\n * @internal\n */\n\nimport { ConfigurationError } from \"../../errors.js\";\nimport { withCwdMutex } from \"../persistence/cwd-mutex.js\";\nimport {\n  COOLDOWN_MS,\n  type CredentialPoolSnapshot,\n  type CredentialPoolStrategy,\n  DEFAULT_COOLDOWN_MS,\n  type PooledCredential,\n} from \"./credential-pool-types.js\";\nimport { sleepWithAbort } from \"./retry.js\";\n\n/**\n * Construct a `PooledCredential` with sane defaults.\n *\n * @internal\n */\nexport function newPooledCredential(args: {\n  provider: string;\n  accessToken: string;\n  priority: number;\n  source: string;\n  label?: string;\n}): PooledCredential {\n  return {\n    id: globalThis.crypto.randomUUID(),\n    label: args.label ?? labelFromSource(args.source, args.accessToken),\n    provider: args.provider,\n    priority: args.priority,\n    source: args.source,\n    accessToken: args.accessToken,\n    lastStatus: \"ok\",\n    lastStatusAt: undefined,\n    lastErrorCode: undefined,\n    lastErrorResetAt: undefined,\n    requestCount: 0,\n  };\n}\n\n/**\n * Build a human-readable label from the credential source. Used for\n * `Theokit.credentialPool.list()` UX. NEVER includes the raw token.\n *\n * @internal\n */\nfunction labelFromSource(source: string, accessToken: string): string {\n  if (source.startsWith(\"env:\")) return source.slice(4);\n  const masked =\n    accessToken.length > 8 ? `${accessToken.slice(0, 4)}…${accessToken.slice(-4)}` : \"***\";\n  return `${source}:${masked}`;\n}\n\n/**\n * Per-provider credential pool. Construct with one or more entries\n * sorted by priority. Throws `ConfigurationError` on empty input.\n *\n * EC-C: identical `accessToken`s are deduplicated during construction\n * (3 copies of \"k1\" → 1 entry). Otherwise an exhaustion event would\n * mark \"k1\" exhausted 3× wastefully.\n *\n * @internal\n */\nexport class CredentialPool {\n  readonly provider: string;\n  private readonly strategy: CredentialPoolStrategy;\n  private entries: PooledCredential[];\n\n  constructor(\n    provider: string,\n    entries: PooledCredential[],\n    strategy: CredentialPoolStrategy = \"fill_first\",\n  ) {\n    if (entries.length === 0) {\n      throw new ConfigurationError(\n        `credential-pool: cannot construct empty pool for provider \"${provider}\"`,\n        { code: \"credential_pool_empty\" },\n      );\n    }\n    this.provider = provider;\n    this.strategy = strategy;\n    // EC-C: dedupe by accessToken before sort.\n    this.entries = dedupeByToken(entries).sort((a, b) => a.priority - b.priority);\n  }\n\n  /** True if the pool was seeded with at least one entry. */\n  hasCredentials(): boolean {\n    return this.entries.length > 0;\n  }\n\n  /** True iff at least one entry is healthy (auto-healed if cooldown expired). */\n  hasAvailable(): boolean {\n    return this.availableEntries().length > 0;\n  }\n\n  /**\n   * Earliest `lastErrorResetAt` across all entries, or `undefined` if no\n   * entry is in cooldown. Used by `waitForAvailable` to compute the\n   * upper bound of each jittered sleep window.\n   *\n   * @internal\n   */\n  earliestResetAt(): number | undefined {\n    let earliest: number | undefined;\n    for (const entry of this.entries) {\n      if (entry.lastStatus === \"ok\") continue;\n      if (entry.lastErrorResetAt === undefined) continue;\n      if (earliest === undefined || entry.lastErrorResetAt < earliest) {\n        earliest = entry.lastErrorResetAt;\n      }\n    }\n    return earliest;\n  }\n\n  /**\n   * Wait until at least one entry becomes healthy OR `maxWaitMs` elapses\n   * OR `signal` aborts. Returns `true` if a healthy entry is available\n   * when the call returns, `false` otherwise.\n   *\n   * T3.9 — Reconnect storm prevention. Concurrent callers each sleep a\n   * random fraction of the window to the earliest cooldown reset (full\n   * jitter — AWS Brooker 2015) so they do not all wake at the exact\n   * instant cooldown expires and hammer the upstream simultaneously.\n   *\n   * The `sleeper` parameter is a dependency-injection seam for tests:\n   * callers in production omit it and the default `setTimeout`-based\n   * sleeper is used. The seam avoids the `vi.useFakeTimers()` mismatch\n   * that blocked T3.4's wiring.\n   *\n   * @internal\n   */\n  async waitForAvailable(\n    signal: AbortSignal,\n    opts: {\n      maxWaitMs: number;\n      sleeper?: (ms: number, signal: AbortSignal) => Promise<void>;\n    },\n  ): Promise<boolean> {\n    if (signal.aborted) return false;\n    if (this.hasAvailable()) return true;\n    const sleeper = opts.sleeper ?? sleepWithAbort;\n    const deadline = Date.now() + opts.maxWaitMs;\n    while (Date.now() < deadline) {\n      if (signal.aborted) return false;\n      const jittered = this.computeJitteredSleepMs(deadline);\n      await sleeper(jittered, signal);\n      if (signal.aborted) return false;\n      if (this.hasAvailable()) return true;\n    }\n    return this.hasAvailable();\n  }\n\n  /**\n   * Compute the next jittered sleep window (ms) for `waitForAvailable`.\n   * Full-jitter cap: at most (a) time until the earliest reset (plus a\n   * 50 ms grace so the entry actually heals before re-probe), or (b) the\n   * remaining wait window, whichever is smaller. When no entry has a\n   * known reset (rare — only if `markExhaustedAndRotate` was called\n   * without `resetAtMs`), fall back to a 250 ms ceiling so we stay\n   * responsive without hot-looping.\n   */\n  private computeJitteredSleepMs(deadline: number): number {\n    const resetAt = this.earliestResetAt();\n    const remaining = deadline - Date.now();\n    const ceiling =\n      resetAt === undefined\n        ? Math.min(remaining, 250)\n        : Math.min(remaining, Math.max(0, resetAt - Date.now()) + 50);\n    return Math.max(0, Math.floor(Math.random() * ceiling));\n  }\n\n  /** Live (frozen) view of all entries. */\n  list(): readonly PooledCredential[] {\n    return this.entries;\n  }\n\n  /**\n   * Pick a healthy entry according to the configured strategy.\n   * Mutates `requestCount` and (for round_robin) entry order.\n   * Returns null if every entry is in cooldown.\n   *\n   * @internal\n   */\n  async select(): Promise<PooledCredential | null> {\n    return withCwdMutex(`credential-pool:${this.provider}`, async () => this.selectLocked());\n  }\n\n  /**\n   * Mark the entry whose id matches `entryId` as exhausted with the\n   * appropriate cooldown, then return the next healthy entry (or null).\n   * If `entryId` is undefined, marks all currently-active entries (rare —\n   * only used by admin reset scenarios).\n   *\n   * @internal\n   */\n  async markExhaustedAndRotate(args: {\n    entryId: string;\n    statusCode: number;\n    resetAtMs?: number;\n  }): Promise<PooledCredential | null> {\n    return withCwdMutex(`credential-pool:${this.provider}`, async () => {\n      const entry = this.entries.find((e) => e.id === args.entryId);\n      if (entry !== undefined) {\n        const now = Date.now();\n        const cooldown = COOLDOWN_MS[args.statusCode] ?? DEFAULT_COOLDOWN_MS;\n        entry.lastStatus = \"exhausted\";\n        entry.lastStatusAt = now;\n        entry.lastErrorCode = args.statusCode;\n        // EC-5: negative or stale resetAt → ignore, fall through to default.\n        entry.lastErrorResetAt =\n          args.resetAtMs !== undefined && args.resetAtMs > now ? args.resetAtMs : now + cooldown;\n      }\n      return this.selectLocked();\n    });\n  }\n\n  /** Admin escape hatch: clear all cooldowns. */\n  async resetAll(): Promise<void> {\n    await withCwdMutex(`credential-pool:${this.provider}`, async () => {\n      for (const e of this.entries) {\n        e.lastStatus = \"ok\";\n        e.lastStatusAt = undefined;\n        e.lastErrorCode = undefined;\n        e.lastErrorResetAt = undefined;\n      }\n    });\n  }\n\n  /** Materialize for persistence. */\n  toSnapshot(): CredentialPoolSnapshot {\n    return {\n      provider: this.provider,\n      strategy: this.strategy,\n      entries: this.entries.map((e) => ({ ...e })),\n    };\n  }\n\n  /** Hydrate from a previously-saved snapshot. */\n  static fromSnapshot(snapshot: CredentialPoolSnapshot): CredentialPool {\n    return new CredentialPool(snapshot.provider, snapshot.entries, snapshot.strategy);\n  }\n\n  // ─── Internal helpers (always called inside the mutex) ───\n\n  // biome-ignore lint/complexity/noExcessiveCognitiveComplexity: strategy dispatch must branch on 4 enum values (random/least_used/round_robin/fill_first) with 1-entry short-circuits per strategy. Each branch is 5-10 lines of focused logic; extracting per-strategy methods fragments the linear narrative.\n  private selectLocked(): PooledCredential | null {\n    const available = this.availableEntries();\n    if (available.length === 0) return null;\n\n    if (this.strategy === \"random\") {\n      const idx = Math.floor(Math.random() * available.length);\n      const picked = available[idx];\n      if (picked === undefined) return null; // unreachable; satisfies strict\n      picked.requestCount += 1;\n      return picked;\n    }\n\n    if (this.strategy === \"least_used\" && available.length > 1) {\n      // EC-3: tie-break by priority ascending (first wins).\n      const picked = [...available].sort(\n        (a, b) => a.requestCount - b.requestCount || a.priority - b.priority,\n      )[0];\n      if (picked === undefined) return null;\n      picked.requestCount += 1;\n      return picked;\n    }\n\n    if (this.strategy === \"round_robin\" && available.length > 1) {\n      // Pick head; move it to the end of `entries` so next call picks the next.\n      const picked = available[0];\n      if (picked === undefined) return null;\n      picked.requestCount += 1;\n      const rest = this.entries.filter((e) => e.id !== picked.id);\n      // Re-assign priorities: rotated entry gets the highest priority value\n      // so it sorts last after `fromSnapshot` rehydration. This makes EC-F\n      // (round-robin state survives save/load) work without a separate field.\n      const maxPriority = this.entries.length - 1;\n      rest.forEach((e, i) => {\n        e.priority = i;\n      });\n      picked.priority = maxPriority;\n      this.entries = [...rest, picked];\n      return picked;\n    }\n\n    // fill_first (default) and 1-entry edge case for round_robin/least_used\n    const picked = available[0];\n    if (picked === undefined) return null;\n    picked.requestCount += 1;\n    return picked;\n  }\n\n  private availableEntries(): PooledCredential[] {\n    const now = Date.now();\n    const out: PooledCredential[] = [];\n    for (const entry of this.entries) {\n      if (entry.lastStatus === \"ok\") {\n        out.push(entry);\n        continue;\n      }\n      // EC-1: auto-heal expired cooldowns inline.\n      const resetAt = entry.lastErrorResetAt;\n      if (resetAt !== undefined && now >= resetAt) {\n        entry.lastStatus = \"ok\";\n        entry.lastStatusAt = undefined;\n        entry.lastErrorCode = undefined;\n        entry.lastErrorResetAt = undefined;\n        out.push(entry);\n      }\n    }\n    return out;\n  }\n}\n\n/**\n * Drop duplicates by `accessToken`. Keeps the first occurrence (lowest\n * priority wins after sort). EC-C from the edge-case review.\n */\nfunction dedupeByToken(entries: PooledCredential[]): PooledCredential[] {\n  const seen = new Set<string>();\n  const out: PooledCredential[] = [];\n  for (const e of entries) {\n    if (seen.has(e.accessToken)) continue;\n    seen.add(e.accessToken);\n    out.push(e);\n  }\n  return out;\n}\n","/**\n * Per-fork credential-pool inheritance via `AsyncLocalStorage` (ADR D131).\n *\n * Mirrors the whitelist context pattern from D111\n * (`runtime/async-local-storage.ts`). Forked sub-agents inherit the\n * parent's pool *by reference* so concurrent rotations all observe\n * the same cooldown state — the desired behavior per Hermes parity.\n *\n * @internal\n */\n\nimport { AsyncLocalStorage } from \"node:async_hooks\";\n\nimport type { CredentialPool } from \"./credential-pool.js\";\n\n/** ALS slot — keyed by provider name → pool. */\nconst credentialPoolStore = new AsyncLocalStorage<Map<string, CredentialPool>>();\n\n/**\n * Run `fn` with `pools` as the active credential-pool registry for the\n * current async context. Nested calls shadow the outer map (parent\n * pools are not visible to children when the child sets its own).\n *\n * @internal\n */\nexport async function withCredentialPool<T>(\n  pools: Map<string, CredentialPool>,\n  fn: () => Promise<T>,\n): Promise<T> {\n  return credentialPoolStore.run(pools, fn);\n}\n\n/**\n * Pool registered for `provider` in the current async context, or\n * `undefined` when no `withCredentialPool(...)` scope is active.\n *\n * @internal\n */\nexport function currentCredentialPool(provider: string): CredentialPool | undefined {\n  return credentialPoolStore.getStore()?.get(provider);\n}\n"]}
+{"version":3,"sources":["../src/internal/llm/credential-pool-types.ts","../src/internal/llm/retry.ts","../src/internal/llm/credential-pool.ts","../src/internal/llm/credential-pool-context.ts"],"names":["picked"],"mappings":";;;;;AAyFO,IAAM,WAAA,GAAgD;AAAA,EAC3D,GAAA,EAAK,IAAI,EAAA,GAAK,GAAA;AAAA;AAAA,EACd,GAAA,EAAK,KAAK,EAAA,GAAK,GAAA;AAAA;AAAA,EACf,GAAA,EAAK,KAAK,EAAA,GAAK;AAAA;AACjB,CAAA;AAGO,IAAM,mBAAA,GAAsB,KAAK,EAAA,GAAK,GAAA;;;AC7D7C,IAAM,eAAA,GAAkB,GAAA;AACxB,IAAM,cAAA,GAAiB,IAAA;AAchB,SAAS,iBAAiB,IAAA,EAA8B;AAC7D,EAAA,MAAM,IAAA,GAAO,KAAK,MAAA,IAAU,eAAA;AAC5B,EAAA,MAAM,GAAA,GAAM,KAAK,KAAA,IAAS,cAAA;AAC1B,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,IAAO,IAAA,CAAK,MAAA;AAC7B,EAAA,IAAI,IAAA,CAAK,YAAA,KAAiB,MAAA,IAAa,IAAA,CAAK,gBAAgB,CAAA,EAAG;AAC7D,IAAA,OAAO,IAAA,CAAK,IAAI,IAAA,EAAM,IAAA,CAAK,IAAI,GAAA,EAAK,IAAA,CAAK,YAAY,CAAC,CAAA;AAAA,EACxD;AACA,EAAA,MAAM,UAAU,IAAA,CAAK,GAAA,CAAI,KAAK,IAAA,GAAO,CAAA,IAAK,KAAK,OAAO,CAAA;AACtD,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,EAAI,GAAI,OAAO,CAAA;AACnC;AASO,SAAS,cAAA,CAAe,IAAY,MAAA,EAAoC;AAC7E,EAAA,IAAI,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,EAAS,OAAO,QAAQ,OAAA,EAAQ;AACtD,EAAA,OAAO,IAAI,OAAA,CAAc,CAAC,OAAA,KAAY;AACpC,IAAA,MAAM,KAAA,GAAQ,WAAW,MAAM;AAC7B,MAAA,MAAA,CAAO,mBAAA,CAAoB,SAAS,OAAO,CAAA;AAC3C,MAAA,OAAA,EAAQ;AAAA,IACV,GAAG,EAAE,CAAA;AACL,IAAA,MAAM,UAAU,MAAY;AAC1B,MAAA,YAAA,CAAa,KAAK,CAAA;AAClB,MAAA,OAAA,EAAQ;AAAA,IACV,CAAA;AACA,IAAA,MAAA,CAAO,iBAAiB,OAAA,EAAS,OAAA,EAAS,EAAE,IAAA,EAAM,MAAM,CAAA;AAAA,EAC1D,CAAC,CAAA;AACH;;;AC/CO,SAAS,oBAAoB,IAAA,EAMf;AACnB,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,UAAA,CAAW,MAAA,CAAO,UAAA,EAAW;AAAA,IACjC,OAAO,IAAA,CAAK,KAAA,IAAS,gBAAgB,IAAA,CAAK,MAAA,EAAQ,KAAK,WAAW,CAAA;AAAA,IAClE,UAAU,IAAA,CAAK,QAAA;AAAA,IACf,UAAU,IAAA,CAAK,QAAA;AAAA,IACf,QAAQ,IAAA,CAAK,MAAA;AAAA,IACb,aAAa,IAAA,CAAK,WAAA;AAAA,IAClB,UAAA,EAAY,IAAA;AAAA,IACZ,YAAA,EAAc,MAAA;AAAA,IACd,aAAA,EAAe,MAAA;AAAA,IACf,gBAAA,EAAkB,MAAA;AAAA,IAClB,YAAA,EAAc;AAAA,GAChB;AACF;AAQA,SAAS,eAAA,CAAgB,QAAgB,WAAA,EAA6B;AACpE,EAAA,IAAI,OAAO,UAAA,CAAW,MAAM,GAAG,OAAO,MAAA,CAAO,MAAM,CAAC,CAAA;AACpD,EAAA,MAAM,MAAA,GACJ,WAAA,CAAY,MAAA,GAAS,CAAA,GAAI,GAAG,WAAA,CAAY,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA,MAAA,EAAI,WAAA,CAAY,KAAA,CAAM,EAAE,CAAC,CAAA,CAAA,GAAK,KAAA;AACnF,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,MAAM,CAAA,CAAA;AAC5B;AAYO,IAAM,cAAA,GAAN,MAAM,eAAA,CAAe;AAAA,EACjB,QAAA;AAAA,EACQ,QAAA;AAAA,EACT,OAAA;AAAA,EAER,WAAA,CACE,QAAA,EACA,OAAA,EACA,QAAA,GAAmC,YAAA,EACnC;AACA,IAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AACxB,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,8DAA8D,QAAQ,CAAA,CAAA,CAAA;AAAA,QACtE,EAAE,MAAM,uBAAA;AAAwB,OAClC;AAAA,IACF;AACA,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAChB,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAEhB,IAAA,IAAA,CAAK,OAAA,GAAU,aAAA,CAAc,OAAO,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,QAAA,GAAW,CAAA,CAAE,QAAQ,CAAA;AAAA,EAC9E;AAAA;AAAA,EAGA,cAAA,GAA0B;AACxB,IAAA,OAAO,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AAAA,EAC/B;AAAA;AAAA,EAGA,YAAA,GAAwB;AACtB,IAAA,OAAO,IAAA,CAAK,gBAAA,EAAiB,CAAE,MAAA,GAAS,CAAA;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,eAAA,GAAsC;AACpC,IAAA,IAAI,QAAA;AACJ,IAAA,KAAA,MAAW,KAAA,IAAS,KAAK,OAAA,EAAS;AAChC,MAAA,IAAI,KAAA,CAAM,eAAe,IAAA,EAAM;AAC/B,MAAA,IAAI,KAAA,CAAM,qBAAqB,MAAA,EAAW;AAC1C,MAAA,IAAI,QAAA,KAAa,MAAA,IAAa,KAAA,CAAM,gBAAA,GAAmB,QAAA,EAAU;AAC/D,QAAA,QAAA,GAAW,KAAA,CAAM,gBAAA;AAAA,MACnB;AAAA,IACF;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,MAAM,gBAAA,CACJ,MAAA,EACA,IAAA,EAIkB;AAClB,IAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,IAAA,IAAI,IAAA,CAAK,YAAA,EAAa,EAAG,OAAO,IAAA;AAChC,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,cAAA;AAChC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,EAAI,GAAI,IAAA,CAAK,SAAA;AACnC,IAAA,OAAO,IAAA,CAAK,GAAA,EAAI,GAAI,QAAA,EAAU;AAC5B,MAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,sBAAA,CAAuB,QAAQ,CAAA;AACrD,MAAA,MAAM,OAAA,CAAQ,UAAU,MAAM,CAAA;AAC9B,MAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,MAAA,IAAI,IAAA,CAAK,YAAA,EAAa,EAAG,OAAO,IAAA;AAAA,IAClC;AACA,IAAA,OAAO,KAAK,YAAA,EAAa;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,uBAAuB,QAAA,EAA0B;AACvD,IAAA,MAAM,OAAA,GAAU,KAAK,eAAA,EAAgB;AACrC,IAAA,MAAM,SAAA,GAAY,QAAA,GAAW,IAAA,CAAK,GAAA,EAAI;AACtC,IAAA,MAAM,UACJ,OAAA,KAAY,MAAA,GACR,KAAK,GAAA,CAAI,SAAA,EAAW,GAAG,CAAA,GACvB,IAAA,CAAK,IAAI,SAAA,EAAW,IAAA,CAAK,IAAI,CAAA,EAAG,OAAA,GAAU,KAAK,GAAA,EAAK,IAAI,EAAE,CAAA;AAChE,IAAA,OAAO,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,MAAM,IAAA,CAAK,MAAA,EAAO,GAAI,OAAO,CAAC,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,IAAA,GAAoC;AAClC,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,MAAA,GAA2C;AAC/C,IAAA,OAAO,YAAA,CAAa,mBAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY,IAAA,CAAK,cAAc,CAAA;AAAA,EACzF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,uBAAuB,IAAA,EAIQ;AACnC,IAAA,OAAO,YAAA,CAAa,CAAA,gBAAA,EAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY;AAClE,MAAA,MAAM,KAAA,GAAQ,KAAK,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,IAAA,CAAK,OAAO,CAAA;AAC5D,MAAA,IAAI,UAAU,MAAA,EAAW;AACvB,QAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,QAAA,MAAM,QAAA,GAAW,WAAA,CAAY,IAAA,CAAK,UAAU,CAAA,IAAK,mBAAA;AACjD,QAAA,KAAA,CAAM,UAAA,GAAa,WAAA;AACnB,QAAA,KAAA,CAAM,YAAA,GAAe,GAAA;AACrB,QAAA,KAAA,CAAM,gBAAgB,IAAA,CAAK,UAAA;AAE3B,QAAA,KAAA,CAAM,gBAAA,GACJ,KAAK,SAAA,KAAc,MAAA,IAAa,KAAK,SAAA,GAAY,GAAA,GAAM,IAAA,CAAK,SAAA,GAAY,GAAA,GAAM,QAAA;AAAA,MAClF;AACA,MAAA,OAAO,KAAK,YAAA,EAAa;AAAA,IAC3B,CAAC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,QAAA,GAA0B;AAC9B,IAAA,MAAM,YAAA,CAAa,CAAA,gBAAA,EAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY;AACjE,MAAA,KAAA,MAAW,CAAA,IAAK,KAAK,OAAA,EAAS;AAC5B,QAAA,CAAA,CAAE,UAAA,GAAa,IAAA;AACf,QAAA,CAAA,CAAE,YAAA,GAAe,MAAA;AACjB,QAAA,CAAA,CAAE,aAAA,GAAgB,MAAA;AAClB,QAAA,CAAA,CAAE,gBAAA,GAAmB,MAAA;AAAA,MACvB;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,UAAA,GAAqC;AACnC,IAAA,OAAO;AAAA,MACL,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,OAAA,EAAS,KAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAE,CAAE;AAAA,KAC7C;AAAA,EACF;AAAA;AAAA,EAGA,OAAO,aAAa,QAAA,EAAkD;AACpE,IAAA,OAAO,IAAI,eAAA,CAAe,QAAA,CAAS,UAAU,QAAA,CAAS,OAAA,EAAS,SAAS,QAAQ,CAAA;AAAA,EAClF;AAAA;AAAA;AAAA,EAKQ,YAAA,GAAwC;AAC9C,IAAA,MAAM,SAAA,GAAY,KAAK,gBAAA,EAAiB;AACxC,IAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAEnC,IAAA,IAAI,IAAA,CAAK,aAAa,QAAA,EAAU;AAC9B,MAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAM,KAAK,MAAA,EAAO,GAAI,UAAU,MAAM,CAAA;AACvD,MAAA,MAAMA,OAAAA,GAAS,UAAU,GAAG,CAAA;AAC5B,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,OAAOA,OAAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,YAAA,IAAgB,SAAA,CAAU,SAAS,CAAA,EAAG;AAE1D,MAAA,MAAMA,OAAAA,GAAS,CAAC,GAAG,SAAS,CAAA,CAAE,IAAA;AAAA,QAC5B,CAAC,GAAG,CAAA,KAAM,CAAA,CAAE,eAAe,CAAA,CAAE,YAAA,IAAgB,CAAA,CAAE,QAAA,GAAW,CAAA,CAAE;AAAA,QAC5D,CAAC,CAAA;AACH,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,OAAOA,OAAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,aAAA,IAAiB,SAAA,CAAU,SAAS,CAAA,EAAG;AAE3D,MAAA,MAAMA,OAAAA,GAAS,UAAU,CAAC,CAAA;AAC1B,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,MAAM,IAAA,GAAO,KAAK,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAOA,OAAAA,CAAO,EAAE,CAAA;AAI1D,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,OAAA,CAAQ,MAAA,GAAS,CAAA;AAC1C,MAAA,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACrB,QAAA,CAAA,CAAE,QAAA,GAAW,CAAA;AAAA,MACf,CAAC,CAAA;AACD,MAAAA,QAAO,QAAA,GAAW,WAAA;AAClB,MAAA,IAAA,CAAK,OAAA,GAAU,CAAC,GAAG,IAAA,EAAMA,OAAM,CAAA;AAC/B,MAAA,OAAOA,OAAAA;AAAA,IACT;AAGA,IAAA,MAAM,MAAA,GAAS,UAAU,CAAC,CAAA;AAC1B,IAAA,IAAI,MAAA,KAAW,QAAW,OAAO,IAAA;AACjC,IAAA,MAAA,CAAO,YAAA,IAAgB,CAAA;AACvB,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,gBAAA,GAAuC;AAC7C,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,MAAM,MAA0B,EAAC;AACjC,IAAA,KAAA,MAAW,KAAA,IAAS,KAAK,OAAA,EAAS;AAChC,MAAA,IAAI,KAAA,CAAM,eAAe,IAAA,EAAM;AAC7B,QAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AACd,QAAA;AAAA,MACF;AAEA,MAAA,MAAM,UAAU,KAAA,CAAM,gBAAA;AACtB,MAAA,IAAI,OAAA,KAAY,MAAA,IAAa,GAAA,IAAO,OAAA,EAAS;AAC3C,QAAA,KAAA,CAAM,UAAA,GAAa,IAAA;AACnB,QAAA,KAAA,CAAM,YAAA,GAAe,MAAA;AACrB,QAAA,KAAA,CAAM,aAAA,GAAgB,MAAA;AACtB,QAAA,KAAA,CAAM,gBAAA,GAAmB,MAAA;AACzB,QAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,MAChB;AAAA,IACF;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AACF;AAMA,SAAS,cAAc,OAAA,EAAiD;AACtE,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,MAA0B,EAAC;AACjC,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,WAAW,CAAA,EAAG;AAC7B,IAAA,IAAA,CAAK,GAAA,CAAI,EAAE,WAAW,CAAA;AACtB,IAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACZ;AACA,EAAA,OAAO,GAAA;AACT;ACvUA,IAAM,mBAAA,GAAsB,IAAI,iBAAA,EAA+C;AAS/E,eAAsB,kBAAA,CACpB,OACA,EAAA,EACY;AACZ,EAAA,OAAO,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,EAAE,CAAA;AAC1C;AAQO,SAAS,sBAAsB,QAAA,EAA8C;AAClF,EAAA,OAAO,mBAAA,CAAoB,QAAA,EAAS,EAAG,GAAA,CAAI,QAAQ,CAAA;AACrD","file":"chunk-F4RUADRC.js","sourcesContent":["/**\n * Types for the credential pool subsystem (ADRs D123-D133).\n *\n * Pool a developer's multiple API keys for the SAME provider so the SDK\n * can rotate transparently on HTTP 429/402/401 instead of jumping\n * straight to a different provider via `FallbackLlmClient`.\n *\n * @internal\n */\n\n/**\n * Rotation strategy when picking the next credential from a pool.\n *\n * - `fill_first` (default): use entries[0] until exhausted, then [1]…\n * - `round_robin`: rotate after each `select()`\n * - `least_used`: pick the entry with the lowest `requestCount`\n * - `random`: random pick among healthy entries\n *\n * Closed enum per ADR D124 — adding a strategy is an explicit semver\n * minor that updates `selectByStrategy` exhaustively.\n *\n * @internal\n */\nexport type CredentialPoolStrategy = \"fill_first\" | \"round_robin\" | \"least_used\" | \"random\";\n\n/** Health flag tracked per credential. */\nexport type CredentialStatus = \"ok\" | \"exhausted\";\n\n/**\n * Provenance of a credential — where it came from when seeded.\n * Free-form string; conventional prefixes:\n *\n * - `env:<VAR_NAME>` — auto-discovered from environment variable\n * - `manual` — added via explicit `apiKeys` config\n * - `explicit-apikey` — wrapped from `AgentOptions.apiKey` single-key path (D132)\n */\nexport type CredentialSource = string;\n\n/**\n * Single credential entry inside a {@link CredentialPool}.\n *\n * `accessToken` is the sensitive field — must never be logged unredacted.\n * The lint gate `tests/lint/no-unredacted-pool-token.test.ts` enforces this.\n *\n * @internal\n */\nexport interface PooledCredential {\n  /** Stable identifier (uuid v4) for log lines + telemetry. */\n  id: string;\n  /** Human-readable label for `Theokit.credentialPool.list()`. */\n  label: string;\n  /** Provider name (matches `ProviderProfile.name`). */\n  provider: string;\n  /** Sort key; lower = earlier in fill_first. Unique within a pool. */\n  priority: number;\n  /** Provenance string. */\n  source: CredentialSource;\n  /** Sensitive API key. NEVER LOG UNREDACTED. */\n  accessToken: string;\n  /** Current health. */\n  lastStatus: CredentialStatus;\n  /** Epoch ms of the last status change. */\n  lastStatusAt: number | undefined;\n  /** HTTP code that caused exhaustion (401/402/429). */\n  lastErrorCode: number | undefined;\n  /** Provider-supplied \"retry after this epoch ms\" hint. Overrides cooldown defaults. */\n  lastErrorResetAt: number | undefined;\n  /** Bumped per successful `select()` for `least_used` strategy. Lazy-persisted. */\n  requestCount: number;\n}\n\n/**\n * Serializable snapshot of a single provider's pool. Used by the\n * persistence layer (T2.1) to read/write `~/.theokit/credential-pool.json`.\n *\n * @internal\n */\nexport interface CredentialPoolSnapshot {\n  provider: string;\n  strategy: CredentialPoolStrategy;\n  entries: PooledCredential[];\n}\n\n/**\n * Cooldown ladder by HTTP error code (ADR D125). Provider-supplied\n * `lastErrorResetAt` overrides these defaults when present.\n *\n * @internal\n */\nexport const COOLDOWN_MS: Readonly<Record<number, number>> = {\n  401: 5 * 60 * 1000, // 5 minutes — OAuth refresh can recover quickly\n  402: 60 * 60 * 1000, // 1 hour — billing quota typically hourly+\n  429: 60 * 60 * 1000, // 1 hour — daily-rate-limit windows\n};\n\n/** Default cooldown when no specific code matches. */\nexport const DEFAULT_COOLDOWN_MS = 60 * 60 * 1000;\n","/**\n * T3.4 — exponential backoff with full jitter for credential-pool retry.\n *\n * Why we need this: pre-T3.4 `pool-aware-client.ts:79-83` retried the\n * SAME credential immediately on the first 429 without any wait. When\n * every credential in the pool returned 429 (thundering herd against a\n * shared quota), the client burned through all 5 retry attempts in <1ms,\n * tripped `CredentialPoolExhaustedError`, and surfaced to the agent loop\n * as a hard failure. The user-visible symptom was \"all my keys are\n * exhausted!\" when in reality a 1-2s wait would have cleared the rate\n * limit.\n *\n * AWS Architecture Blog \"Exponential Backoff And Jitter\" (Marc Brooker,\n * 2015) demonstrates full jitter as the canonical pattern: `sleep =\n * random_between(0, base * 2^attempt)`. We extend it with a hard cap\n * (so a 32s sleep never blocks an interactive agent) and honor the\n * provider's `Retry-After` hint when present — the hint always wins over\n * the computed value when it falls within `[base, cap]`.\n *\n * @internal\n */\n\nexport interface BackoffOptions {\n  /** 0-indexed retry attempt number. */\n  attempt: number;\n  /** Base delay in ms (multiplier for 2^attempt). Default 500. */\n  baseMs?: number;\n  /** Hard cap in ms — backoff never sleeps longer than this. Default 32_000. */\n  capMs?: number;\n  /** Provider's Retry-After hint in ms (from header). Takes precedence when in-range. */\n  retryAfterMs?: number;\n  /** Random source — pass a deterministic mock from tests. Default `Math.random`. */\n  rng?: () => number;\n}\n\nconst DEFAULT_BASE_MS = 500;\nconst DEFAULT_CAP_MS = 32_000;\n\n/**\n * Compute the next sleep duration (ms) before retrying a failed request.\n *\n * Algorithm:\n * 1. If `retryAfterMs` is set, prefer it — clamped to `[baseMs, capMs]`.\n *    The provider's hint is the most accurate available signal.\n * 2. Otherwise: `sleep = random(0, min(cap, base * 2^attempt))` — full\n *    jitter per Brooker 2015 ensures coordinated clients (each with\n *    different RNG seeds) spread the retry storm.\n *\n * @internal\n */\nexport function computeBackoffMs(opts: BackoffOptions): number {\n  const base = opts.baseMs ?? DEFAULT_BASE_MS;\n  const cap = opts.capMs ?? DEFAULT_CAP_MS;\n  const rng = opts.rng ?? Math.random;\n  if (opts.retryAfterMs !== undefined && opts.retryAfterMs >= 0) {\n    return Math.max(base, Math.min(cap, opts.retryAfterMs));\n  }\n  const ceiling = Math.min(cap, base * 2 ** opts.attempt);\n  return Math.floor(rng() * ceiling);\n}\n\n/**\n * `setTimeout`-based sleep that resolves early when the abort signal fires.\n * Resolves cleanly (does not throw on abort) so callers decide how to\n * react to the abort downstream.\n *\n * @internal\n */\nexport function sleepWithAbort(ms: number, signal: AbortSignal): Promise<void> {\n  if (ms <= 0 || signal.aborted) return Promise.resolve();\n  return new Promise<void>((resolve) => {\n    const timer = setTimeout(() => {\n      signal.removeEventListener(\"abort\", onAbort);\n      resolve();\n    }, ms);\n    const onAbort = (): void => {\n      clearTimeout(timer);\n      resolve();\n    };\n    signal.addEventListener(\"abort\", onAbort, { once: true });\n  });\n}\n","/**\n * In-memory credential pool with strategy-based rotation (ADRs D123-D133).\n *\n * Pure logic. No I/O — persistence lives in `internal/persistence/\n * credential-pool-store.ts`. The pool is the single source of truth for\n * rotation state within a process; if it diverges from disk (e.g.,\n * process killed mid-rotation per EC-I), the next save heals the\n * inconsistency — at the cost of one extra HTTP 429 per crash.\n *\n * Thread safety: the pool uses an in-process async-aware mutex\n * (`cwd-mutex` D9 keyed by `credential-pool:${provider}`). Cross-process\n * safety happens at the persistence layer via `withFileLock` (D61).\n * Two Node processes sharing the same file may double-pick momentarily\n * (worst case = 1 extra 429 per race) — acceptable per ADR D128.\n *\n * @internal\n */\n\nimport { ConfigurationError } from \"../../errors.js\";\nimport { withCwdMutex } from \"../persistence/cwd-mutex.js\";\nimport {\n  COOLDOWN_MS,\n  type CredentialPoolSnapshot,\n  type CredentialPoolStrategy,\n  DEFAULT_COOLDOWN_MS,\n  type PooledCredential,\n} from \"./credential-pool-types.js\";\nimport { sleepWithAbort } from \"./retry.js\";\n\n/**\n * Construct a `PooledCredential` with sane defaults.\n *\n * @internal\n */\nexport function newPooledCredential(args: {\n  provider: string;\n  accessToken: string;\n  priority: number;\n  source: string;\n  label?: string;\n}): PooledCredential {\n  return {\n    id: globalThis.crypto.randomUUID(),\n    label: args.label ?? labelFromSource(args.source, args.accessToken),\n    provider: args.provider,\n    priority: args.priority,\n    source: args.source,\n    accessToken: args.accessToken,\n    lastStatus: \"ok\",\n    lastStatusAt: undefined,\n    lastErrorCode: undefined,\n    lastErrorResetAt: undefined,\n    requestCount: 0,\n  };\n}\n\n/**\n * Build a human-readable label from the credential source. Used for\n * `Theokit.credentialPool.list()` UX. NEVER includes the raw token.\n *\n * @internal\n */\nfunction labelFromSource(source: string, accessToken: string): string {\n  if (source.startsWith(\"env:\")) return source.slice(4);\n  const masked =\n    accessToken.length > 8 ? `${accessToken.slice(0, 4)}…${accessToken.slice(-4)}` : \"***\";\n  return `${source}:${masked}`;\n}\n\n/**\n * Per-provider credential pool. Construct with one or more entries\n * sorted by priority. Throws `ConfigurationError` on empty input.\n *\n * EC-C: identical `accessToken`s are deduplicated during construction\n * (3 copies of \"k1\" → 1 entry). Otherwise an exhaustion event would\n * mark \"k1\" exhausted 3× wastefully.\n *\n * @internal\n */\nexport class CredentialPool {\n  readonly provider: string;\n  private readonly strategy: CredentialPoolStrategy;\n  private entries: PooledCredential[];\n\n  constructor(\n    provider: string,\n    entries: PooledCredential[],\n    strategy: CredentialPoolStrategy = \"fill_first\",\n  ) {\n    if (entries.length === 0) {\n      throw new ConfigurationError(\n        `credential-pool: cannot construct empty pool for provider \"${provider}\"`,\n        { code: \"credential_pool_empty\" },\n      );\n    }\n    this.provider = provider;\n    this.strategy = strategy;\n    // EC-C: dedupe by accessToken before sort.\n    this.entries = dedupeByToken(entries).sort((a, b) => a.priority - b.priority);\n  }\n\n  /** True if the pool was seeded with at least one entry. */\n  hasCredentials(): boolean {\n    return this.entries.length > 0;\n  }\n\n  /** True iff at least one entry is healthy (auto-healed if cooldown expired). */\n  hasAvailable(): boolean {\n    return this.availableEntries().length > 0;\n  }\n\n  /**\n   * Earliest `lastErrorResetAt` across all entries, or `undefined` if no\n   * entry is in cooldown. Used by `waitForAvailable` to compute the\n   * upper bound of each jittered sleep window.\n   *\n   * @internal\n   */\n  earliestResetAt(): number | undefined {\n    let earliest: number | undefined;\n    for (const entry of this.entries) {\n      if (entry.lastStatus === \"ok\") continue;\n      if (entry.lastErrorResetAt === undefined) continue;\n      if (earliest === undefined || entry.lastErrorResetAt < earliest) {\n        earliest = entry.lastErrorResetAt;\n      }\n    }\n    return earliest;\n  }\n\n  /**\n   * Wait until at least one entry becomes healthy OR `maxWaitMs` elapses\n   * OR `signal` aborts. Returns `true` if a healthy entry is available\n   * when the call returns, `false` otherwise.\n   *\n   * T3.9 — Reconnect storm prevention. Concurrent callers each sleep a\n   * random fraction of the window to the earliest cooldown reset (full\n   * jitter — AWS Brooker 2015) so they do not all wake at the exact\n   * instant cooldown expires and hammer the upstream simultaneously.\n   *\n   * The `sleeper` parameter is a dependency-injection seam for tests:\n   * callers in production omit it and the default `setTimeout`-based\n   * sleeper is used. The seam avoids the `vi.useFakeTimers()` mismatch\n   * that blocked T3.4's wiring.\n   *\n   * @internal\n   */\n  async waitForAvailable(\n    signal: AbortSignal,\n    opts: {\n      maxWaitMs: number;\n      sleeper?: (ms: number, signal: AbortSignal) => Promise<void>;\n    },\n  ): Promise<boolean> {\n    if (signal.aborted) return false;\n    if (this.hasAvailable()) return true;\n    const sleeper = opts.sleeper ?? sleepWithAbort;\n    const deadline = Date.now() + opts.maxWaitMs;\n    while (Date.now() < deadline) {\n      if (signal.aborted) return false;\n      const jittered = this.computeJitteredSleepMs(deadline);\n      await sleeper(jittered, signal);\n      if (signal.aborted) return false;\n      if (this.hasAvailable()) return true;\n    }\n    return this.hasAvailable();\n  }\n\n  /**\n   * Compute the next jittered sleep window (ms) for `waitForAvailable`.\n   * Full-jitter cap: at most (a) time until the earliest reset (plus a\n   * 50 ms grace so the entry actually heals before re-probe), or (b) the\n   * remaining wait window, whichever is smaller. When no entry has a\n   * known reset (rare — only if `markExhaustedAndRotate` was called\n   * without `resetAtMs`), fall back to a 250 ms ceiling so we stay\n   * responsive without hot-looping.\n   */\n  private computeJitteredSleepMs(deadline: number): number {\n    const resetAt = this.earliestResetAt();\n    const remaining = deadline - Date.now();\n    const ceiling =\n      resetAt === undefined\n        ? Math.min(remaining, 250)\n        : Math.min(remaining, Math.max(0, resetAt - Date.now()) + 50);\n    return Math.max(0, Math.floor(Math.random() * ceiling));\n  }\n\n  /** Live (frozen) view of all entries. */\n  list(): readonly PooledCredential[] {\n    return this.entries;\n  }\n\n  /**\n   * Pick a healthy entry according to the configured strategy.\n   * Mutates `requestCount` and (for round_robin) entry order.\n   * Returns null if every entry is in cooldown.\n   *\n   * @internal\n   */\n  async select(): Promise<PooledCredential | null> {\n    return withCwdMutex(`credential-pool:${this.provider}`, async () => this.selectLocked());\n  }\n\n  /**\n   * Mark the entry whose id matches `entryId` as exhausted with the\n   * appropriate cooldown, then return the next healthy entry (or null).\n   * If `entryId` is undefined, marks all currently-active entries (rare —\n   * only used by admin reset scenarios).\n   *\n   * @internal\n   */\n  async markExhaustedAndRotate(args: {\n    entryId: string;\n    statusCode: number;\n    resetAtMs?: number;\n  }): Promise<PooledCredential | null> {\n    return withCwdMutex(`credential-pool:${this.provider}`, async () => {\n      const entry = this.entries.find((e) => e.id === args.entryId);\n      if (entry !== undefined) {\n        const now = Date.now();\n        const cooldown = COOLDOWN_MS[args.statusCode] ?? DEFAULT_COOLDOWN_MS;\n        entry.lastStatus = \"exhausted\";\n        entry.lastStatusAt = now;\n        entry.lastErrorCode = args.statusCode;\n        // EC-5: negative or stale resetAt → ignore, fall through to default.\n        entry.lastErrorResetAt =\n          args.resetAtMs !== undefined && args.resetAtMs > now ? args.resetAtMs : now + cooldown;\n      }\n      return this.selectLocked();\n    });\n  }\n\n  /** Admin escape hatch: clear all cooldowns. */\n  async resetAll(): Promise<void> {\n    await withCwdMutex(`credential-pool:${this.provider}`, async () => {\n      for (const e of this.entries) {\n        e.lastStatus = \"ok\";\n        e.lastStatusAt = undefined;\n        e.lastErrorCode = undefined;\n        e.lastErrorResetAt = undefined;\n      }\n    });\n  }\n\n  /** Materialize for persistence. */\n  toSnapshot(): CredentialPoolSnapshot {\n    return {\n      provider: this.provider,\n      strategy: this.strategy,\n      entries: this.entries.map((e) => ({ ...e })),\n    };\n  }\n\n  /** Hydrate from a previously-saved snapshot. */\n  static fromSnapshot(snapshot: CredentialPoolSnapshot): CredentialPool {\n    return new CredentialPool(snapshot.provider, snapshot.entries, snapshot.strategy);\n  }\n\n  // ─── Internal helpers (always called inside the mutex) ───\n\n  // biome-ignore lint/complexity/noExcessiveCognitiveComplexity: strategy dispatch must branch on 4 enum values (random/least_used/round_robin/fill_first) with 1-entry short-circuits per strategy. Each branch is 5-10 lines of focused logic; extracting per-strategy methods fragments the linear narrative.\n  private selectLocked(): PooledCredential | null {\n    const available = this.availableEntries();\n    if (available.length === 0) return null;\n\n    if (this.strategy === \"random\") {\n      const idx = Math.floor(Math.random() * available.length);\n      const picked = available[idx];\n      if (picked === undefined) return null; // unreachable; satisfies strict\n      picked.requestCount += 1;\n      return picked;\n    }\n\n    if (this.strategy === \"least_used\" && available.length > 1) {\n      // EC-3: tie-break by priority ascending (first wins).\n      const picked = [...available].sort(\n        (a, b) => a.requestCount - b.requestCount || a.priority - b.priority,\n      )[0];\n      if (picked === undefined) return null;\n      picked.requestCount += 1;\n      return picked;\n    }\n\n    if (this.strategy === \"round_robin\" && available.length > 1) {\n      // Pick head; move it to the end of `entries` so next call picks the next.\n      const picked = available[0];\n      if (picked === undefined) return null;\n      picked.requestCount += 1;\n      const rest = this.entries.filter((e) => e.id !== picked.id);\n      // Re-assign priorities: rotated entry gets the highest priority value\n      // so it sorts last after `fromSnapshot` rehydration. This makes EC-F\n      // (round-robin state survives save/load) work without a separate field.\n      const maxPriority = this.entries.length - 1;\n      rest.forEach((e, i) => {\n        e.priority = i;\n      });\n      picked.priority = maxPriority;\n      this.entries = [...rest, picked];\n      return picked;\n    }\n\n    // fill_first (default) and 1-entry edge case for round_robin/least_used\n    const picked = available[0];\n    if (picked === undefined) return null;\n    picked.requestCount += 1;\n    return picked;\n  }\n\n  private availableEntries(): PooledCredential[] {\n    const now = Date.now();\n    const out: PooledCredential[] = [];\n    for (const entry of this.entries) {\n      if (entry.lastStatus === \"ok\") {\n        out.push(entry);\n        continue;\n      }\n      // EC-1: auto-heal expired cooldowns inline.\n      const resetAt = entry.lastErrorResetAt;\n      if (resetAt !== undefined && now >= resetAt) {\n        entry.lastStatus = \"ok\";\n        entry.lastStatusAt = undefined;\n        entry.lastErrorCode = undefined;\n        entry.lastErrorResetAt = undefined;\n        out.push(entry);\n      }\n    }\n    return out;\n  }\n}\n\n/**\n * Drop duplicates by `accessToken`. Keeps the first occurrence (lowest\n * priority wins after sort). EC-C from the edge-case review.\n */\nfunction dedupeByToken(entries: PooledCredential[]): PooledCredential[] {\n  const seen = new Set<string>();\n  const out: PooledCredential[] = [];\n  for (const e of entries) {\n    if (seen.has(e.accessToken)) continue;\n    seen.add(e.accessToken);\n    out.push(e);\n  }\n  return out;\n}\n","/**\n * Per-fork credential-pool inheritance via `AsyncLocalStorage` (ADR D131).\n *\n * Mirrors the whitelist context pattern from D111\n * (`runtime/async-local-storage.ts`). Forked sub-agents inherit the\n * parent's pool *by reference* so concurrent rotations all observe\n * the same cooldown state — the desired behavior per Hermes parity.\n *\n * @internal\n */\n\nimport { AsyncLocalStorage } from \"node:async_hooks\";\n\nimport type { CredentialPool } from \"./credential-pool.js\";\n\n/** ALS slot — keyed by provider name → pool. */\nconst credentialPoolStore = new AsyncLocalStorage<Map<string, CredentialPool>>();\n\n/**\n * Run `fn` with `pools` as the active credential-pool registry for the\n * current async context. Nested calls shadow the outer map (parent\n * pools are not visible to children when the child sets its own).\n *\n * @internal\n */\nexport async function withCredentialPool<T>(\n  pools: Map<string, CredentialPool>,\n  fn: () => Promise<T>,\n): Promise<T> {\n  return credentialPoolStore.run(pools, fn);\n}\n\n/**\n * Pool registered for `provider` in the current async context, or\n * `undefined` when no `withCredentialPool(...)` scope is active.\n *\n * @internal\n */\nexport function currentCredentialPool(provider: string): CredentialPool | undefined {\n  return credentialPoolStore.getStore()?.get(provider);\n}\n"]}