@wrongstack/core 0.284.1 → 0.286.0

package/dist/tasking/index.js

@@ -84,9 +84,61 @@ function toErrorMessage(err) {
 
 // src/types/errors.ts
 var ERROR_CODES = {
+  // Provider
+  PROVIDER_RATE_LIMITED: "PROVIDER_RATE_LIMITED",
+  PROVIDER_AUTH_FAILED: "PROVIDER_AUTH_FAILED",
+  PROVIDER_OVERLOADED: "PROVIDER_OVERLOADED",
+  PROVIDER_INVALID_REQUEST: "PROVIDER_INVALID_REQUEST",
+  PROVIDER_SERVER_ERROR: "PROVIDER_SERVER_ERROR",
+  PROVIDER_NETWORK_ERROR: "PROVIDER_NETWORK_ERROR",
+  PROVIDER_CONTEXT_OVERFLOW: "PROVIDER_CONTEXT_OVERFLOW",
+  // Tool
+  TOOL_NOT_FOUND: "TOOL_NOT_FOUND",
+  TOOL_PERMISSION_DENIED: "TOOL_PERMISSION_DENIED",
+  TOOL_EXECUTION_FAILED: "TOOL_EXECUTION_FAILED",
+  TOOL_TIMEOUT: "TOOL_TIMEOUT",
+  TOOL_INPUT_INVALID: "TOOL_INPUT_INVALID",
+  // Config
+  CONFIG_INVALID: "CONFIG_INVALID",
+  CONFIG_NOT_FOUND: "CONFIG_NOT_FOUND",
+  CONFIG_PARSE_FAILED: "CONFIG_PARSE_FAILED",
+  CONFIG_MIGRATION_NEEDED: "CONFIG_MIGRATION_NEEDED",
+  // Plugin
+  PLUGIN_LOAD_FAILED: "PLUGIN_LOAD_FAILED",
+  PLUGIN_API_MISMATCH: "PLUGIN_API_MISMATCH",
+  PLUGIN_MISSING_DEPENDENCY: "PLUGIN_MISSING_DEPENDENCY",
+  // Agent
+  AGENT_ITERATION_LIMIT: "AGENT_ITERATION_LIMIT",
+  AGENT_CONTEXT_OVERFLOW: "AGENT_CONTEXT_OVERFLOW",
+  AGENT_ABORTED: "AGENT_ABORTED",
+  AGENT_RUN_FAILED: "AGENT_RUN_FAILED",
+  // Session
+  SESSION_NOT_FOUND: "SESSION_NOT_FOUND",
+  SESSION_CORRUPTED: "SESSION_CORRUPTED",
+  SESSION_WRITE_FAILED: "SESSION_WRITE_FAILED",
+  // Container / Registry
+  CONTAINER_TOKEN_ALREADY_BOUND: "CONTAINER_TOKEN_ALREADY_BOUND",
+  CONTAINER_TOKEN_NOT_BOUND: "CONTAINER_TOKEN_NOT_BOUND",
+  CONTAINER_CIRCULAR_DEPENDENCY: "CONTAINER_CIRCULAR_DEPENDENCY",
+  REGISTRY_DUPLICATE: "REGISTRY_DUPLICATE",
+  REGISTRY_NOT_FOUND: "REGISTRY_NOT_FOUND",
+  REGISTRY_INVALID: "REGISTRY_INVALID",
+  // File system
+  FS_READ_FAILED: "FS_READ_FAILED",
+  FS_WRITE_FAILED: "FS_WRITE_FAILED",
+  FS_MKDIR_FAILED: "FS_MKDIR_FAILED",
+  FS_DELETE_FAILED: "FS_DELETE_FAILED",
+  FS_ATOMIC_WRITE_FAILED: "FS_ATOMIC_WRITE_FAILED",
+  // SDD (Spec-Driven Development)
+  SDD_VALIDATION_FAILED: "SDD_VALIDATION_FAILED",
   SDD_PARSE_FAILED: "SDD_PARSE_FAILED",
   SDD_INVALID_STATE: "SDD_INVALID_STATE",
-  SDD_NOT_READY: "SDD_NOT_READY"};
+  SDD_NOT_READY: "SDD_NOT_READY",
+  // General
+  VALIDATION_ERROR: "VALIDATION_ERROR",
+  PARSE_FAILED: "PARSE_FAILED",
+  UNKNOWN: "UNKNOWN"
+};
 var WrongStackError = class extends Error {
   code;
   subsystem;
@@ -486,7 +538,8 @@ function compareByField(a, b, field) {
       return a.updatedAt - b.updatedAt;
   }
 }
-
-export { DefaultTaskStore, TaskTracker };
+export {
+  DefaultTaskStore,
+  TaskTracker
+};
 //# sourceMappingURL=index.js.map
-//# sourceMappingURL=index.js.map

package/dist/tasking/index.js.map

@@ -1 +1,7 @@
-{"version":3,"sources":["../../src/tasking/task-store.ts","../../src/types/task-graph.ts","../../src/utils/error.ts","../../src/types/errors.ts","../../src/tasking/task-tracker.ts"],"names":[],"mappings":";AAUO,IAAM,mBAAN,MAA4C;AAAA,EAChC,MAAA,uBAAa,GAAA,EAAuB;AAAA,EAErD,MAAM,UAAU,KAAA,EAAiC;AAC/C,IAAA,IAAA,CAAK,OAAO,GAAA,CAAI,KAAA,CAAM,IAAI,IAAA,CAAK,UAAA,CAAW,KAAK,CAAC,CAAA;AAAA,EAClD;AAAA,EAEA,MAAM,UAAU,EAAA,EAAuC;AACrD,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,EAAE,CAAA;AAChC,IAAA,OAAO,KAAA,GAAQ,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA,GAAI,IAAA;AAAA,EAC1C;AAAA,EAEA,MAAM,UAAA,GAA+E;AACnF,IAAA,OAAO,KAAA,CAAM,KAAK,IAAA,CAAK,MAAA,CAAO,QAAQ,CAAA,CAAE,GAAA,CAAI,CAAC,KAAA,MAAW;AAAA,MACtD,IAAI,KAAA,CAAM,EAAA;AAAA,MACV,OAAO,KAAA,CAAM,KAAA;AAAA,MACb,WAAW,KAAA,CAAM;AAAA,KACnB,CAAE,CAAA;AAAA,EACJ;AAAA,EAEA,MAAM,YAAY,EAAA,EAA2B;AAC3C,IAAA,IAAA,CAAK,MAAA,CAAO,OAAO,EAAE,CAAA;AAAA,EACvB;AAAA,EAEQ,WAAW,KAAA,EAA6B;AAC9C,IAAA,OAAO;AAAA,MACL,GAAG,KAAA;AAAA,MACH,KAAA,EAAO,IAAI,GAAA,CAAI,KAAA,CAAM,KAAK,CAAA;AAAA,MAC1B,KAAA,EAAO,CAAC,GAAG,KAAA,CAAM,KAAK,CAAA;AAAA,MACtB,SAAA,EAAW,CAAC,GAAG,KAAA,CAAM,SAAS;AAAA,KAChC;AAAA,EACF;AACF;;;AC+CO,SAAS,oBAAoB,KAAA,EAAgC;AAClE,EAAA,IAAI,SAAA,GAAY,CAAA;AAChB,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,IAAI,UAAA,GAAa,CAAA;AACjB,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,IAAI,MAAA,GAAS,CAAA;AACb,EAAA,IAAI,cAAA,GAAiB,CAAA;AACrB,EAAA,IAAI,WAAA,GAAc,CAAA;AAClB,EAAA,KAAA,MAAW,CAAA,IAAK,KAAA,CAAM,KAAA,CAAM,MAAA,EAAO,EAAG;AACpC,IAAA,QAAQ,EAAE,MAAA;AAAQ,MAChB,KAAK,WAAA;AACH,QAAA,SAAA,EAAA;AACA,QAAA;AAAA,MACF,KAAK,SAAA;AACH,QAAA,OAAA,EAAA;AACA,QAAA;AAAA,MACF,KAAK,aAAA;AACH,QAAA,UAAA,EAAA;AACA,QAAA;AAAA,MACF,KAAK,SAAA;AACH,QAAA,OAAA,EAAA;AACA,QAAA;AAAA,MACF,KAAK,QAAA;AACH,QAAA,MAAA,EAAA;AACA,QAAA;AAAA,MACF,KAAK,QAAA;AACH,QAAA,MAAA,EAAA;AACA,QAAA;AAAA;AAEJ,IAAA,cAAA,IAAkB,EAAE,aAAA,IAAiB,CAAA;AACrC,IAAA,WAAA,IAAe,EAAE,WAAA,IAAe,CAAA;AAAA,EAClC;AACA,EAAA,MAAM,KAAA,GAAQ,MAAM,KAAA,CAAM,IAAA;AAE1B,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,OAAA;AAAA,IACA,UAAA;AAAA,IACA,OAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA;AAAA,IACA,SAAA;AAAA,IACA,eAAA,EAAiB,QAAQ,CAAA,GAAI,IAAA,CAAK,MAAO,SAAA,GAAY,KAAA,GAAS,GAAG,CAAA,GAAI,CAAA;AAAA,IACrE,cAAA;AAAA,IACA;AAAA,GACF;AACF;;;ACpIO,SAAS,eAAe,GAAA,EAAsB;AACnD,EAAA,OAAO,GAAA,YAAe,KAAA,GAAQ,GAAA,CAAI,OAAA,GAAU,OAAO,GAAG,CAAA;AACxD;;;ACkBO,IAAM,WAAA,GAAc;AAAA,EAgDzB,gBAAA,EAAkB,kBAAA;AAAA,EAClB,iBAAA,EAAmB,mBAAA;AAAA,EACnB,aAAA,EAAe,eAKjB,CAAA;AAwBO,IAAM,eAAA,GAAN,cAA8B,KAAA,CAAM;AAAA,EAChC,IAAA;AAAA,EACA,SAAA;AAAA,EACA,QAAA;AAAA,EACA,WAAA;AAAA,EACA,OAAA;AAAA,EAET,YAAY,IAAA,EAQT;AACD,IAAA,KAAA,CAAM,KAAK,OAAA,EAAS,EAAE,KAAA,EAAO,IAAA,CAAK,OAAO,CAAA;AACzC,IAAA,IAAA,CAAK,IAAA,GAAO,iBAAA;AACZ,IAAA,IAAA,CAAK,OAAO,IAAA,CAAK,IAAA;AACjB,IAAA,IAAA,CAAK,YAAY,IAAA,CAAK,SAAA;AACtB,IAAA,IAAA,CAAK,QAAA,GAAW,KAAK,QAAA,IAAY,OAAA;AACjC,IAAA,IAAA,CAAK,WAAA,GAAc,KAAK,WAAA,IAAe,KAAA;AACvC,IAAA,IAAA,CAAK,UAAU,IAAA,CAAK,OAAA;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAA,GAAmB;AACjB,IAAA,MAAM,GAAA,GAAM,KAAK,OAAA,GAAU,CAAA,CAAA,EAAI,cAAc,IAAA,CAAK,OAAO,CAAC,CAAA,CAAA,GAAK,EAAA;AAC/D,IAAA,OAAO,GAAG,IAAA,CAAK,IAAI,KAAK,IAAA,CAAK,OAAO,GAAG,GAAG,CAAA,CAAA;AAAA,EAC5C;AACF,CAAA;AAEA,SAAS,cAAc,GAAA,EAAsC;AAC3D,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,OAAA,CAAQ,GAAG,CAAA,CAC7B,MAAA,CAAO,CAAC,GAAG,CAAC,CAAA,KAAM,CAAA,KAAM,MAAS,CAAA,CACjC,KAAA,CAAM,CAAA,EAAG,CAAC,CAAA,CACV,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,CAAA,KAAM,CAAA,EAAG,CAAC,CAAA,CAAA,EAAI,MAAA,CAAO,CAAC,CAAC,CAAA,CAAE,CAAA;AACtC,EAAA,OAAO,KAAA,CAAM,SAAS,CAAA,GAAI,CAAA,CAAA,EAAI,MAAM,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA,GAAM,EAAA;AACrD;AA4KO,IAAM,QAAA,GAAN,cAAuB,eAAA,CAAgB;AAAA,EAC5C,YAAY,IAAA,EAQT;AACD,IAAA,KAAA,CAAM;AAAA,MACJ,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,MAAM,IAAA,CAAK,IAAA;AAAA,MACX,SAAA,EAAW,KAAA;AAAA,MACX,QAAA,EAAU,IAAA,CAAK,IAAA,KAAS,WAAA,CAAY,mBAAmB,SAAA,GAAY,OAAA;AAAA,MACnE,WAAA,EAAa,IAAA,CAAK,IAAA,KAAS,WAAA,CAAY,aAAA;AAAA,MACvC,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,OAAO,IAAA,CAAK;AAAA,KACb,CAAA;AACD,IAAA,IAAA,CAAK,IAAA,GAAO,UAAA;AAAA,EACd;AACF,CAAA;;;AClSO,IAAM,cAAN,MAAkB;AAAA,EAKvB,YAA6B,IAAA,EAA0B;AAA1B,IAAA,IAAA,CAAA,IAAA,GAAA,IAAA;AAAA,EAA2B;AAAA,EAA3B,IAAA;AAAA,EAJrB,KAAA,GAA0B,IAAA;AAAA,EAC1B,cAAgC,EAAC;AAAA,EACjC,YAAmC,EAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAS5C,UAAU,QAAA,EAA2C;AACnD,IAAA,IAAA,CAAK,SAAA,CAAU,KAAK,QAAQ,CAAA;AAC5B,IAAA,OAAO,MAAM;AACX,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,SAAA,CAAU,OAAA,CAAQ,QAAQ,CAAA;AACzC,MAAA,IAAI,KAAK,CAAA,EAAG,IAAA,CAAK,SAAA,CAAU,MAAA,CAAO,GAAG,CAAC,CAAA;AAAA,IACxC,CAAA;AAAA,EACF;AAAA,EAEQ,aAAa,MAAA,EAAiC;AACpD,IAAA,KAAA,MAAW,CAAA,IAAK,KAAK,SAAA,EAAW;AAC9B,MAAA,IAAI;AACF,QAAA,CAAA,CAAE,MAAM,CAAA;AAAA,MACV,CAAA,CAAA,MAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,KAAA,EAAwB;AAC/B,IAAA,IAAA,CAAK,KAAA,GAAQ,KAAA;AAAA,EACf;AAAA,EAEA,MAAM,WAAA,CAAY,MAAA,EAAgB,KAAA,EAAmC;AACnE,IAAA,IAAA,CAAK,KAAA,GAAQ;AAAA,MACX,EAAA,EAAI,OAAO,UAAA,EAAW;AAAA,MACtB,MAAA;AAAA,MACA,KAAA;AAAA,MACA,KAAA,sBAAW,GAAA,EAAI;AAAA,MACf,OAAO,EAAC;AAAA,MACR,WAAW,EAAC;AAAA,MACZ,SAAA,EAAW,KAAK,GAAA,EAAI;AAAA,MACpB,SAAA,EAAW,KAAK,GAAA;AAAI,KACtB;AACA,IAAA,MAAM,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,SAAA,CAAU,KAAK,KAAK,CAAA;AAC1C,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA,EAEA,MAAM,UAAU,EAAA,EAAuC;AACrD,IAAA,IAAA,CAAK,QAAQ,MAAM,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,UAAU,EAAE,CAAA;AAC/C,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AAAA,EAEA,QAAQ,IAAA,EAAkE;AACxE,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,EAAO,MAAM,IAAI,QAAA,CAAS;AAAA,MAClC,OAAA,EAAS,iBAAA;AAAA,MACT,MAAM,WAAA,CAAY;AAAA,KACnB,CAAA;AAED,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,MAAM,OAAA,GAAoB;AAAA,MACxB,GAAG,IAAA;AAAA,MACH,EAAA,EAAI,OAAO,UAAA,EAAW;AAAA,MACtB,MAAA,EAAQ,KAAK,MAAA,IAAU,SAAA;AAAA,MACvB,SAAA,EAAW,GAAA;AAAA,MACX,SAAA,EAAW;AAAA,KACb;AAEA,IAAA,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,OAAA,CAAQ,IAAI,OAAO,CAAA;AAExC,IAAA,IAAI,CAAC,KAAK,QAAA,EAAU;AAClB,MAAA,IAAA,CAAK,KAAA,CAAM,SAAA,CAAU,IAAA,CAAK,OAAA,CAAQ,EAAE,CAAA;AAAA,IACtC;AAEA,IAAA,IAAA,CAAK,MAAM,SAAA,GAAY,GAAA;AACvB,IAAA,IAAA,CAAK,OAAA,EAAQ;AACb,IAAA,IAAA,CAAK,YAAA,CAAa,EAAE,IAAA,EAAM,YAAA,EAAc,QAAQ,OAAA,CAAQ,EAAA,EAAI,IAAA,EAAM,OAAA,EAAS,CAAA;AAE3E,IAAA,OAAO,OAAA;AAAA,EACT;AAAA,EAEA,OAAA,CAAQ,IAAA,EAAc,EAAA,EAAY,IAAA,GAAsC,YAAA,EAAoB;AAC1F,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,EAAO,MAAM,IAAI,QAAA,CAAS;AAAA,MAClC,OAAA,EAAS,iBAAA;AAAA,MACT,MAAM,WAAA,CAAY;AAAA,KACnB,CAAA;AAED,IAAA,IAAA,CAAK,KAAA,CAAM,MAAM,IAAA,CAAK;AAAA,MACpB,EAAA,EAAI,OAAO,UAAA,EAAW;AAAA,MACtB,IAAA;AAAA,MACA,EAAA;AAAA,MACA;AAAA,KACD,CAAA;AACD,IAAA,IAAA,CAAK,KAAA,CAAM,SAAA,GAAY,IAAA,CAAK,GAAA,EAAI;AAChC,IAAA,IAAA,CAAK,OAAA,EAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,aAAA,CAAc,OAAe,MAAA,EAAyB;AACpD,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,EAAO,OAAO,KAAA;AACxB,IAAA,IAAI,KAAA,KAAU,QAAQ,OAAO,KAAA;AAC7B,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,IAAI,KAAK,CAAA,IAAK,CAAC,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,MAAM,GAAG,OAAO,KAAA;AAE1E,IAAA,IAAI,KAAK,WAAA,CAAY,MAAM,EAAE,QAAA,CAAS,KAAK,GAAG,OAAO,IAAA;AAGrD,IAAA,IAAI,IAAA,CAAK,sBAAsB,KAAA,EAAO,MAAA,sBAAY,GAAA,EAAK,GAAG,OAAO,KAAA;AACjE,IAAA,IAAA,CAAK,OAAA,CAAQ,KAAA,EAAO,MAAA,EAAQ,YAAY,CAAA;AACxC,IAAA,OAAO,IAAA;AAAA,EACT;AAAA;AAAA,EAGQ,qBAAA,CAAsB,MAAA,EAAgB,QAAA,EAAkB,IAAA,EAA4B;AAC1F,IAAA,IAAI,MAAA,KAAW,UAAU,OAAO,IAAA;AAChC,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA,EAAG,OAAO,KAAA;AAC7B,IAAA,IAAA,CAAK,IAAI,MAAM,CAAA;AACf,IAAA,KAAA,MAAW,OAAA,IAAW,IAAA,CAAK,WAAA,CAAY,MAAM,CAAA,EAAG;AAC9C,MAAA,IAAI,KAAK,qBAAA,CAAsB,OAAA,EAAS,QAAA,EAAU,IAAI,GAAG,OAAO,IAAA;AAAA,IAClE;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAA,CAAc,IAAY,KAAA,EAAsC;AAC9D,IAAA,IAAI,CAAC,KAAK,KAAA,EAAO;AACjB,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,IAAI,EAAE,CAAA;AACpC,IAAA,IAAI,CAAC,IAAA,EAAM;AACX,IAAA,IAAA,CAAK,WAAW,EAAE,GAAG,IAAA,CAAK,QAAA,EAAU,GAAG,KAAA,EAAM;AAC7C,IAAA,IAAA,CAAK,SAAA,GAAY,KAAK,GAAA,EAAI;AAC1B,IAAA,IAAA,CAAK,KAAA,CAAM,YAAY,IAAA,CAAK,SAAA;AAC5B,IAAA,IAAA,CAAK,OAAA,EAAQ;AACb,IAAA,IAAA,CAAK,aAAa,EAAE,IAAA,EAAM,gBAAgB,MAAA,EAAQ,EAAA,EAAI,MAAM,CAAA;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,WAAW,EAAA,EAAqB;AAC9B,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,EAAO,OAAO,KAAA;AACxB,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,IAAI,EAAE,CAAA;AACpC,IAAA,IAAI,CAAC,MAAM,OAAO,KAAA;AAClB,IAAA,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,MAAA,CAAO,EAAE,CAAA;AAC1B,IAAA,IAAA,CAAK,KAAA,CAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,EAAA,IAAM,CAAA,CAAE,OAAO,EAAE,CAAA;AAC9E,IAAA,IAAA,CAAK,KAAA,CAAM,YAAY,IAAA,CAAK,KAAA,CAAM,UAAU,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,KAAM,EAAE,CAAA;AAElE,IAAA,KAAA,MAAW,CAAA,IAAK,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,QAAO,EAAG;AACzC,MAAA,IAAI,CAAA,CAAE,QAAA,EAAU,QAAA,CAAS,EAAE,CAAA,EAAG,CAAA,CAAE,QAAA,GAAW,CAAA,CAAE,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,KAAM,MAAM,EAAE,CAAA;AAAA,IAC9E;AACA,IAAA,IAAA,CAAK,KAAA,CAAM,SAAA,GAAY,IAAA,CAAK,GAAA,EAAI;AAChC,IAAA,IAAA,CAAK,OAAA,EAAQ;AACb,IAAA,IAAA,CAAK,aAAa,EAAE,IAAA,EAAM,gBAAgB,MAAA,EAAQ,EAAA,EAAI,MAAM,CAAA;AAC5D,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,gBAAA,CAAiB,EAAA,EAAY,MAAA,EAA4B,MAAA,EAAuB;AAC9E,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,EAAO,MAAM,IAAI,QAAA,CAAS;AAAA,MAClC,OAAA,EAAS,iBAAA;AAAA,MACT,MAAM,WAAA,CAAY;AAAA,KACnB,CAAA;AAED,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,IAAI,EAAE,CAAA;AACpC,IAAA,IAAI,CAAC,IAAA,EAAM,MAAM,IAAI,QAAA,CAAS;AAAA,MAC5B,OAAA,EAAS,QAAQ,EAAE,CAAA,UAAA,CAAA;AAAA,MACnB,MAAM,WAAA,CAAY,aAAA;AAAA,MAClB,OAAA,EAAS,EAAE,MAAA,EAAQ,EAAA;AAAG,KACvB,CAAA;AAED,IAAA,MAAM,OAAO,IAAA,CAAK,MAAA;AAClB,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,IAAA,CAAK,MAAA,GAAS,MAAA;AACd,IAAA,IAAA,CAAK,SAAA,GAAY,GAAA;AAEjB,IAAA,IAAI,WAAW,WAAA,EAAa;AAC1B,MAAA,IAAA,CAAK,WAAA,GAAc,GAAA;AACnB,MAAA,IAAA,CAAK,SAAA,GAAY,KAAK,SAAA,IAAa,GAAA;AAAA,IACrC;AACA,IAAA,IAAI,WAAW,aAAA,EAAe;AAC5B,MAAA,IAAA,CAAK,SAAA,GAAY,GAAA;AAAA,IACnB;AAEA,IAAA,IAAA,CAAK,WAAA,CAAY,KAAK,EAAE,IAAA,EAAM,IAAI,MAAA,EAAQ,SAAA,EAAW,GAAA,EAAK,MAAA,EAAQ,CAAA;AAGlE,IAAA,IAAI,WAAW,WAAA,EAAa;AAC1B,MAAA,IAAA,CAAK,kBAAkB,EAAE,CAAA;AAAA,IAC3B;AAGA,IAAA,IAAI,WAAW,aAAA,EAAe;AAC5B,MAAA,IAAA,CAAK,sBAAsB,EAAE,CAAA;AAAA,IAC/B;AAEA,IAAA,IAAA,CAAK,MAAM,SAAA,GAAY,GAAA;AACvB,IAAA,IAAA,CAAK,OAAA,EAAQ;AACb,IAAA,IAAA,CAAK,YAAA,CAAa;AAAA,MAChB,IAAA,EAAM,gBAAA;AAAA,MACN,MAAA,EAAQ,EAAA;AAAA,MACR,IAAA;AAAA,MACA,YAAY,EAAE,IAAA,EAAM,IAAI,MAAA,EAAQ,SAAA,EAAW,KAAK,MAAA;AAAO,KACxD,CAAA;AAAA,EACH;AAAA,EAEA,UAAA,CAAW,IAAY,KAAA,EAAoH;AACzI,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,EAAO,MAAM,IAAI,QAAA,CAAS;AAAA,MAClC,OAAA,EAAS,iBAAA;AAAA,MACT,MAAM,WAAA,CAAY;AAAA,KACnB,CAAA;AAED,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,IAAI,EAAE,CAAA;AACpC,IAAA,IAAI,CAAC,IAAA,EAAM,MAAM,IAAI,QAAA,CAAS;AAAA,MAC5B,OAAA,EAAS,QAAQ,EAAE,CAAA,UAAA,CAAA;AAAA,MACnB,MAAM,WAAA,CAAY,aAAA;AAAA,MAClB,OAAA,EAAS,EAAE,MAAA,EAAQ,EAAA;AAAG,KACvB,CAAA;AAED,IAAA,IAAI,KAAA,CAAM,KAAA,KAAU,MAAA,EAAW,IAAA,CAAK,QAAQ,KAAA,CAAM,KAAA;AAClD,IAAA,IAAI,KAAA,CAAM,WAAA,KAAgB,MAAA,EAAW,IAAA,CAAK,cAAc,KAAA,CAAM,WAAA;AAC9D,IAAA,IAAI,KAAA,CAAM,QAAA,KAAa,MAAA,EAAW,IAAA,CAAK,WAAW,KAAA,CAAM,QAAA;AACxD,IAAA,IAAI,KAAA,CAAM,aAAA,KAAkB,MAAA,EAAW,IAAA,CAAK,gBAAgB,KAAA,CAAM,aAAA;AAClE,IAAA,IAAI,KAAA,CAAM,IAAA,KAAS,MAAA,EAAW,IAAA,CAAK,OAAO,KAAA,CAAM,IAAA;AAChD,IAAA,IAAI,KAAA,CAAM,QAAA,KAAa,MAAA,EAAW,IAAA,CAAK,WAAW,KAAA,CAAM,QAAA;AACxD,IAAA,IAAA,CAAK,SAAA,GAAY,KAAK,GAAA,EAAI;AAC1B,IAAA,IAAA,CAAK,KAAA,CAAM,YAAY,IAAA,CAAK,SAAA;AAC5B,IAAA,IAAA,CAAK,OAAA,EAAQ;AACb,IAAA,IAAA,CAAK,aAAa,EAAE,IAAA,EAAM,gBAAgB,MAAA,EAAQ,EAAA,EAAI,MAAM,CAAA;AAAA,EAC9D;AAAA,EAEA,QAAQ,EAAA,EAAkC;AACxC,IAAA,OAAO,IAAA,CAAK,KAAA,EAAO,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA;AAAA,EACjC;AAAA,EAEA,WAAA,CAAY,QAAqB,IAAA,EAA6B;AAC5D,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,EAAO,OAAO,EAAC;AAEzB,IAAA,IAAI,QAAQ,KAAA,CAAM,IAAA,CAAK,KAAK,KAAA,CAAM,KAAA,CAAM,QAAQ,CAAA;AAEhD,IAAA,IAAI,MAAA,EAAQ;AACV,MAAA,KAAA,GAAQ,KAAA,CAAM,MAAA,CAAO,CAAC,CAAA,KAAM;AAC1B,QAAA,IAAI,MAAA,CAAO,MAAA,EAAQ,MAAA,IAAU,CAAC,MAAA,CAAO,OAAO,QAAA,CAAS,CAAA,CAAE,MAAM,CAAA,EAAG,OAAO,KAAA;AACvE,QAAA,IAAI,MAAA,CAAO,QAAA,EAAU,MAAA,IAAU,CAAC,MAAA,CAAO,SAAS,QAAA,CAAS,CAAA,CAAE,QAAQ,CAAA,EAAG,OAAO,KAAA;AAC7E,QAAA,IAAI,MAAA,CAAO,IAAA,EAAM,MAAA,IAAU,CAAC,MAAA,CAAO,KAAK,QAAA,CAAS,CAAA,CAAE,IAAI,CAAA,EAAG,OAAO,KAAA;AACjE,QAAA,IAAI,MAAA,CAAO,QAAA,EAAU,MAAA,IAAU,CAAA,CAAE,QAAA,IAAY,CAAC,MAAA,CAAO,QAAA,CAAS,QAAA,CAAS,CAAA,CAAE,QAAQ,CAAA;AAC/E,UAAA,OAAO,KAAA;AACT,QAAA,IAAI,MAAA,CAAO,IAAA,EAAM,MAAA,IAAU,CAAA,CAAE,QAAQ,CAAC,CAAA,CAAE,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,KAAM,MAAA,CAAO,IAAA,EAAM,QAAA,CAAS,CAAC,CAAC,CAAA;AAC/E,UAAA,OAAO,KAAA;AACT,QAAA,IAAI,MAAA,CAAO,iBAAA,IAAqB,CAAA,CAAE,iBAAA,KAAsB,MAAA,CAAO,iBAAA;AAC7D,UAAA,OAAO,KAAA;AACT,QAAA,OAAO,IAAA;AAAA,MACT,CAAC,CAAA;AAAA,IACH;AAEA,IAAA,IAAI,IAAA,EAAM;AACR,MAAA,KAAA,CAAM,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM;AACnB,QAAA,MAAM,GAAA,GAAM,cAAA,CAAe,CAAA,EAAG,CAAA,EAAG,KAAK,KAAK,CAAA;AAC3C,QAAA,OAAO,IAAA,CAAK,SAAA,KAAc,KAAA,GAAQ,GAAA,GAAM,CAAC,GAAA;AAAA,MAC3C,CAAC,CAAA;AAAA,IACH;AAEA,IAAA,OAAO,KAAA;AAAA,EACT;AAAA,EAEA,YAAY,QAAA,EAA8B;AACxC,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,EAAO,OAAO,EAAC;AACzB,IAAA,OAAO,KAAA,CAAM,IAAA,CAAK,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,MAAA,EAAQ,CAAA,CAAE,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,aAAa,QAAQ,CAAA;AAAA,EACpF;AAAA,EAEA,cAAc,MAAA,EAA0B;AACtC,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,EAAO,OAAO,EAAC;AACzB,IAAA,OAAO,KAAK,KAAA,CAAM,KAAA,CACf,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,MAAA,IAAU,CAAA,CAAE,SAAS,YAAY,CAAA,CAC1D,IAAI,CAAC,CAAA,KAAM,EAAE,EAAE,CAAA;AAAA,EACpB;AAAA,EAEA,YAAY,MAAA,EAA0B;AACpC,IAAA,IAAI,CAAC,IAAA,CAAK,KAAA,EAAO,OAAO,EAAC;AACzB,IAAA,OAAO,KAAK,KAAA,CAAM,KAAA,CACf,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,EAAA,KAAO,MAAA,IAAU,CAAA,CAAE,SAAS,YAAY,CAAA,CACxD,IAAI,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AAAA,EACtB;AAAA,EAEA,SAAS,MAAA,EAAyB;AAChC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,WAAA,CAAY,MAAM,CAAA;AACxC,IAAA,OAAO,QAAA,CAAS,KAAA,CAAM,CAAC,EAAA,KAAO;AAC5B,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,EAAO,KAAA,CAAM,IAAI,EAAE,CAAA;AAGrC,MAAA,OAAO,IAAA,EAAM,MAAA,KAAW,WAAA,IAAe,IAAA,EAAM,MAAA,KAAW,QAAA;AAAA,IAC1D,CAAC,CAAA;AAAA,EACH;AAAA,EAEA,WAAA,GAA4B;AAC1B,IAAA,IAAI,CAAC,KAAK,KAAA,EAAO;AACf,MAAA,OAAO;AAAA,QACL,KAAA,EAAO,CAAA;AAAA,QACP,OAAA,EAAS,CAAA;AAAA,QACT,UAAA,EAAY,CAAA;AAAA,QACZ,OAAA,EAAS,CAAA;AAAA,QACT,MAAA,EAAQ,CAAA;AAAA,QACR,MAAA,EAAQ,CAAA;AAAA,QACR,SAAA,EAAW,CAAA;AAAA,QACX,eAAA,EAAiB,CAAA;AAAA,QACjB,cAAA,EAAgB,CAAA;AAAA,QAChB,WAAA,EAAa;AAAA,OACf;AAAA,IACF;AACA,IAAA,OAAO,mBAAA,CAAoB,KAAK,KAAK,CAAA;AAAA,EACvC;AAAA,EAEA,eAAe,OAAA,EAAoC;AACjD,IAAA,OAAO,CAAC,GAAG,IAAA,CAAK,WAAW,CAAA;AAAA,EAC7B;AAAA,EAEQ,kBAAkB,WAAA,EAA2B;AACnD,IAAA,IAAI,CAAC,KAAK,KAAA,EAAO;AACjB,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,aAAA,CAAc,WAAW,CAAA;AACjD,IAAA,KAAA,MAAW,SAAS,UAAA,EAAY;AAC9B,MAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,IAAI,KAAK,CAAA;AACtC,MAAA,IAAI,GAAA,EAAK,WAAW,SAAA,EAAW;AAE7B,QAAA,MAAM,iBAAA,GAAoB,IAAA,CAAK,WAAA,CAAY,KAAK,CAAA;AAChD,QAAA,MAAM,YAAA,GAAe,iBAAA,CAAkB,KAAA,CAAM,CAAC,EAAA,KAAO;AACnD,UAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,EAAO,KAAA,CAAM,IAAI,EAAE,CAAA;AACxC,UAAA,OAAO,OAAA,EAAS,MAAA,KAAW,WAAA,IAAe,OAAA,EAAS,MAAA,KAAW,QAAA;AAAA,QAChE,CAAC,CAAA;AACD,QAAA,IAAI,YAAA,EAAc;AAChB,UAAA,GAAA,CAAI,MAAA,GAAS,SAAA;AACb,UAAA,GAAA,CAAI,SAAA,GAAY,KAAK,GAAA,EAAI;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,sBAAsB,MAAA,EAAsB;AAClD,IAAA,IAAI,CAAC,KAAK,KAAA,EAAO;AACjB,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,WAAA,CAAY,MAAM,CAAA;AACxC,IAAA,MAAM,WAAA,GAAc,QAAA,CAAS,IAAA,CAAK,CAAC,EAAA,KAAO;AACxC,MAAA,MAAM,OAAA,GAAU,IAAA,CAAK,KAAA,EAAO,KAAA,CAAM,IAAI,EAAE,CAAA;AAGxC,MAAA,OAAO,OAAA,EAAS,MAAA,KAAW,WAAA,IAAe,OAAA,EAAS,MAAA,KAAW,QAAA;AAAA,IAChE,CAAC,CAAA;AACD,IAAA,IAAI,WAAA,EAAa;AACf,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,IAAI,MAAM,CAAA;AACxC,MAAA,IAAI,IAAA,EAAM;AACR,QAAA,IAAA,CAAK,MAAA,GAAS,SAAA;AACd,QAAA,IAAA,CAAK,SAAA,GAAY,KAAK,GAAA,EAAI;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,OAAA,GAAgB;AACtB,IAAA,IAAI,CAAC,KAAK,KAAA,EAAO;AACjB,IAAA,IAAA,CAAK,IAAA,CAAK,MAAM,SAAA,CAAU,IAAA,CAAK,KAAK,CAAA,CAAE,KAAA,CAAM,CAAC,GAAA,KAAQ;AACnD,MAAA,IAAA,CAAK,IAAA,CAAK,cAAA,GACN,IAAA,CAAK,IAAA,CAAK,cAAA,CAAe,GAAG,CAAA,GAC5B,OAAA,CAAQ,IAAA,CAAK,IAAA,CAAK,SAAA,CAAU;AAAA,QAC1B,KAAA,EAAO,MAAA;AAAA,QACP,KAAA,EAAO,gCAAA;AAAA,QACP,OAAA,EAAS,eAAe,GAAG,CAAA;AAAA,QAC3B,SAAA,EAAA,iBAAW,IAAI,IAAA,EAAK,EAAE,WAAA;AAAY,OACnC,CAAC,CAAA;AAAA,IACR,CAAC,CAAA;AAAA,EACH;AACF;AAGA,IAAM,aAAA,GAAsD;AAAA,EAC1D,QAAA,EAAU,CAAA;AAAA,EACV,IAAA,EAAM,CAAA;AAAA,EACN,MAAA,EAAQ,CAAA;AAAA,EACR,GAAA,EAAK;AACP,CAAA;AACA,IAAM,WAAA,GAAkD;AAAA,EACtD,WAAA,EAAa,CAAA;AAAA,EACb,OAAA,EAAS,CAAA;AAAA,EACT,MAAA,EAAQ,CAAA;AAAA,EACR,OAAA,EAAS,CAAA;AAAA,EACT,MAAA,EAAQ,CAAA;AAAA,EACR,SAAA,EAAW;AACb,CAAA;AAEA,SAAS,cAAA,CAAe,CAAA,EAAa,CAAA,EAAa,KAAA,EAAkC;AAClF,EAAA,QAAQ,KAAA;AAAO,IACb,KAAK,UAAA;AAAY,MAAA,OAAO,cAAc,CAAA,CAAE,QAAQ,CAAA,GAAI,aAAA,CAAc,EAAE,QAAQ,CAAA;AAAA,IAC5E,KAAK,QAAA;AAAU,MAAA,OAAO,YAAY,CAAA,CAAE,MAAM,CAAA,GAAI,WAAA,CAAY,EAAE,MAAM,CAAA;AAAA,IAClE,KAAK,WAAA;AAAa,MAAA,OAAO,CAAA,CAAE,YAAY,CAAA,CAAE,SAAA;AAAA,IACzC,KAAK,WAAA;AAAa,MAAA,OAAO,CAAA,CAAE,YAAY,CAAA,CAAE,SAAA;AAAA;AAE7C","file":"index.js","sourcesContent":["import type { TaskGraph } from '../types/task-graph.js';\nimport type { TaskStore } from './task-tracker.js';\n\n/**\n * In-memory task-graph store used by AutoPhase and tests.\n *\n * The store clones the graph container on read/write so callers cannot replace\n * its Maps/arrays behind the store's back. Task nodes themselves intentionally\n * remain shared: TaskTracker owns node mutation and persists after each change.\n */\nexport class DefaultTaskStore implements TaskStore {\n  private readonly graphs = new Map<string, TaskGraph>();\n\n  async saveGraph(graph: TaskGraph): Promise<void> {\n    this.graphs.set(graph.id, this.cloneGraph(graph));\n  }\n\n  async loadGraph(id: string): Promise<TaskGraph | null> {\n    const graph = this.graphs.get(id);\n    return graph ? this.cloneGraph(graph) : null;\n  }\n\n  async listGraphs(): Promise<Array<{ id: string; title: string; updatedAt: number }>> {\n    return Array.from(this.graphs.values()).map((graph) => ({\n      id: graph.id,\n      title: graph.title,\n      updatedAt: graph.updatedAt,\n    }));\n  }\n\n  async deleteGraph(id: string): Promise<void> {\n    this.graphs.delete(id);\n  }\n\n  private cloneGraph(graph: TaskGraph): TaskGraph {\n    return {\n      ...graph,\n      nodes: new Map(graph.nodes),\n      edges: [...graph.edges],\n      rootNodes: [...graph.rootNodes],\n    };\n  }\n}\n","export type TaskStatus = 'pending' | 'in_progress' | 'blocked' | 'failed' | 'review' | 'completed';\nexport type TaskPriority = 'critical' | 'high' | 'medium' | 'low';\nexport type TaskType = 'feature' | 'bugfix' | 'refactor' | 'docs' | 'test' | 'chore';\n\nexport interface TaskNode {\n  id: string;\n  title: string;\n  description: string;\n  type: TaskType;\n  priority: TaskPriority;\n  status: TaskStatus;\n  assignee?: string | undefined;\n  estimateHours?: number | undefined;\n  actualHours?: number | undefined;\n  tags?: string[] | undefined;\n  specRequirementId?: string | undefined;\n  parentId?: string | undefined;\n  children?: string[] | undefined;\n  createdAt: number;\n  updatedAt: number;\n  startedAt?: number | undefined; // set when status → in_progress\n  completedAt?: number | undefined;\n  metadata?: Record<string, unknown>;\n}\n\nexport interface TaskEdge {\n  id: string;\n  from: string;\n  to: string;\n  type: 'blocks' | 'depends_on' | 'relates_to' | 'implements';\n  weight?: number | undefined;\n}\n\nexport interface TaskGraph {\n  id: string;\n  specId: string;\n  title: string;\n  nodes: Map<string, TaskNode>;\n  edges: TaskEdge[];\n  rootNodes: string[];\n  createdAt: number;\n  updatedAt: number;\n}\n\nexport interface TaskDependency {\n  taskId: string;\n  blockedBy: string[];\n  blocking: string[];\n}\n\nexport interface TaskAssignment {\n  taskId: string;\n  assignee: string;\n  assignedAt: number;\n}\n\nexport interface TaskProgress {\n  total: number;\n  pending: number;\n  inProgress: number;\n  blocked: number;\n  failed: number;\n  review: number;\n  completed: number;\n  percentComplete: number;\n  estimatedHours: number;\n  actualHours: number;\n}\n\nexport interface TaskFilter {\n  status?: TaskStatus[] | undefined;\n  priority?: TaskPriority[] | undefined;\n  type?: TaskType[] | undefined;\n  assignee?: string[] | undefined;\n  tags?: string[] | undefined;\n  specRequirementId?: string | undefined;\n}\n\nexport interface TaskSort {\n  field: 'priority' | 'createdAt' | 'updatedAt' | 'status';\n  direction: 'asc' | 'desc';\n}\n\nexport interface CriticalPathResult {\n  taskIds: string[];\n  totalEstimateHours: number;\n  bottleneckTasks: string[];\n}\n\nexport function computeTaskProgress(graph: TaskGraph): TaskProgress {\n  let completed = 0;\n  let pending = 0;\n  let inProgress = 0;\n  let blocked = 0;\n  let failed = 0;\n  let review = 0;\n  let estimatedHours = 0;\n  let actualHours = 0;\n  for (const n of graph.nodes.values()) {\n    switch (n.status) {\n      case 'completed':\n        completed++;\n        break;\n      case 'pending':\n        pending++;\n        break;\n      case 'in_progress':\n        inProgress++;\n        break;\n      case 'blocked':\n        blocked++;\n        break;\n      case 'failed':\n        failed++;\n        break;\n      case 'review':\n        review++;\n        break;\n    }\n    estimatedHours += n.estimateHours ?? 0;\n    actualHours += n.actualHours ?? 0;\n  }\n  const total = graph.nodes.size;\n\n  return {\n    total,\n    pending,\n    inProgress,\n    blocked,\n    failed,\n    review,\n    completed,\n    percentComplete: total > 0 ? Math.round((completed / total) * 100) : 0,\n    estimatedHours,\n    actualHours,\n  };\n}\n\nexport function findCriticalPath(graph: TaskGraph): CriticalPathResult {\n  const nodes = Array.from(graph.nodes.values());\n  const criticalNodes = nodes.filter((n) => n.priority === 'critical');\n  const bottleneckTasks = criticalNodes\n    .filter((n) => graph.edges.some((e) => e.to === n.id && e.type === 'depends_on'))\n    .map((n) => n.id);\n\n  const totalEstimateHours = criticalNodes.reduce((sum, n) => sum + (n.estimateHours ?? 0), 0);\n\n  return {\n    taskIds: criticalNodes.map((n) => n.id),\n    totalEstimateHours,\n    bottleneckTasks,\n  };\n}\n\nexport function topologicalSort(graph: TaskGraph): string[] {\n  const visited = new Set<string>();\n  const inStack = new Set<string>();\n  const result: string[] = [];\n\n  function visit(id: string): void {\n    // Cycle: callers must detect cycles up-front if they care; we just stop recursing.\n    if (inStack.has(id)) return;\n    if (visited.has(id)) return;\n    if (!graph.nodes.has(id)) return;\n\n    visited.add(id);\n    inStack.add(id);\n\n    for (const edge of graph.edges) {\n      if (edge.from === id) visit(edge.to);\n    }\n\n    inStack.delete(id);\n    result.push(id);\n  }\n\n  for (const rootId of graph.rootNodes) {\n    visit(rootId);\n  }\n\n  return result;\n}\n\nexport type SerializableTaskGraphNodes =\n  | TaskNode[]\n  | Array<[string, TaskNode]>\n  | Record<string, TaskNode>;\n\nexport type SerializableTaskGraph = Omit<TaskGraph, 'nodes'> & {\n  nodes: SerializableTaskGraphNodes;\n};\n\nexport type SerializedTaskGraph = Omit<TaskGraph, 'nodes'> & {\n  nodes: TaskNode[];\n};\n\nexport function serializeTaskGraph(graph: TaskGraph): SerializedTaskGraph {\n  return {\n    ...graph,\n    nodes: Array.from(graph.nodes.values()),\n  };\n}\n\nexport function deserializeTaskGraph(input: SerializableTaskGraph): TaskGraph {\n  const nodes = new Map<string, TaskNode>();\n  if (Array.isArray(input.nodes)) {\n    for (const entry of input.nodes) {\n      if (Array.isArray(entry)) nodes.set(entry[0], { ...entry[1], id: entry[1].id || entry[0] });\n      else nodes.set(entry.id, entry);\n    }\n  } else {\n    for (const [id, node] of Object.entries(input.nodes)) {\n      nodes.set(id, { ...node, id: node.id || id });\n    }\n  }\n  return { ...input, nodes };\n}\n","/**\n * Converts an unknown error value to a human-readable string.\n * Used in 40+ files across the codebase to normalize error messaging.\n */\nexport function toErrorMessage(err: unknown): string {\n  return err instanceof Error ? err.message : String(err);\n}\n","import { toErrorMessage } from '../utils/index.js';\n\n/**\n * WrongStack error hierarchy.\n *\n * Every error thrown by the framework is a `WrongStackError` with a\n * machine-readable `code`, a `subsystem` tag, and a `severity` level.\n * This lets consumers (CLI, TUI, plugins, tests) branch on structured\n * data instead of parsing error messages.\n */\n\n// ── Error codes ──────────────────────────────────────────────────────\n\n/**\n * Machine-readable error codes as frozen constants.\n *\n * Use `ERROR_CODES.X` instead of raw string literals for:\n * - IDE autocomplete and compile-time validation\n * - Safe refactoring (rename updates all usages)\n * - Plugin extensibility (extend the object to add custom codes)\n *\n * The `ErrorCode` type is derived from this object, so adding a new\n * code here automatically updates the type without extra changes.\n */\nexport const ERROR_CODES = {\n  // Provider\n  PROVIDER_RATE_LIMITED: 'PROVIDER_RATE_LIMITED',\n  PROVIDER_AUTH_FAILED: 'PROVIDER_AUTH_FAILED',\n  PROVIDER_OVERLOADED: 'PROVIDER_OVERLOADED',\n  PROVIDER_INVALID_REQUEST: 'PROVIDER_INVALID_REQUEST',\n  PROVIDER_SERVER_ERROR: 'PROVIDER_SERVER_ERROR',\n  PROVIDER_NETWORK_ERROR: 'PROVIDER_NETWORK_ERROR',\n  PROVIDER_CONTEXT_OVERFLOW: 'PROVIDER_CONTEXT_OVERFLOW',\n  // Tool\n  TOOL_NOT_FOUND: 'TOOL_NOT_FOUND',\n  TOOL_PERMISSION_DENIED: 'TOOL_PERMISSION_DENIED',\n  TOOL_EXECUTION_FAILED: 'TOOL_EXECUTION_FAILED',\n  TOOL_TIMEOUT: 'TOOL_TIMEOUT',\n  TOOL_INPUT_INVALID: 'TOOL_INPUT_INVALID',\n  // Config\n  CONFIG_INVALID: 'CONFIG_INVALID',\n  CONFIG_NOT_FOUND: 'CONFIG_NOT_FOUND',\n  CONFIG_PARSE_FAILED: 'CONFIG_PARSE_FAILED',\n  CONFIG_MIGRATION_NEEDED: 'CONFIG_MIGRATION_NEEDED',\n  // Plugin\n  PLUGIN_LOAD_FAILED: 'PLUGIN_LOAD_FAILED',\n  PLUGIN_API_MISMATCH: 'PLUGIN_API_MISMATCH',\n  PLUGIN_MISSING_DEPENDENCY: 'PLUGIN_MISSING_DEPENDENCY',\n  // Agent\n  AGENT_ITERATION_LIMIT: 'AGENT_ITERATION_LIMIT',\n  AGENT_CONTEXT_OVERFLOW: 'AGENT_CONTEXT_OVERFLOW',\n  AGENT_ABORTED: 'AGENT_ABORTED',\n  AGENT_RUN_FAILED: 'AGENT_RUN_FAILED',\n  // Session\n  SESSION_NOT_FOUND: 'SESSION_NOT_FOUND',\n  SESSION_CORRUPTED: 'SESSION_CORRUPTED',\n  SESSION_WRITE_FAILED: 'SESSION_WRITE_FAILED',\n  // Container / Registry\n  CONTAINER_TOKEN_ALREADY_BOUND: 'CONTAINER_TOKEN_ALREADY_BOUND',\n  CONTAINER_TOKEN_NOT_BOUND: 'CONTAINER_TOKEN_NOT_BOUND',\n  CONTAINER_CIRCULAR_DEPENDENCY: 'CONTAINER_CIRCULAR_DEPENDENCY',\n  REGISTRY_DUPLICATE: 'REGISTRY_DUPLICATE',\n  REGISTRY_NOT_FOUND: 'REGISTRY_NOT_FOUND',\n  REGISTRY_INVALID: 'REGISTRY_INVALID',\n  // File system\n  FS_READ_FAILED: 'FS_READ_FAILED',\n  FS_WRITE_FAILED: 'FS_WRITE_FAILED',\n  FS_MKDIR_FAILED: 'FS_MKDIR_FAILED',\n  FS_DELETE_FAILED: 'FS_DELETE_FAILED',\n  FS_ATOMIC_WRITE_FAILED: 'FS_ATOMIC_WRITE_FAILED',\n  // SDD (Spec-Driven Development)\n  SDD_VALIDATION_FAILED: 'SDD_VALIDATION_FAILED',\n  SDD_PARSE_FAILED: 'SDD_PARSE_FAILED',\n  SDD_INVALID_STATE: 'SDD_INVALID_STATE',\n  SDD_NOT_READY: 'SDD_NOT_READY',\n  // General\n  VALIDATION_ERROR: 'VALIDATION_ERROR',\n  PARSE_FAILED: 'PARSE_FAILED',\n  UNKNOWN: 'UNKNOWN',\n} as const;\n\n/**\n * Union type derived from `ERROR_CODES`. Using `typeof ERROR_CODES[keyof typeof ERROR_CODES]`\n * instead of a string literal union means TypeScript auto-updates the type whenever\n * a new code is added to `ERROR_CODES` — no need to keep two lists in sync.\n */\nexport type ErrorCode = (typeof ERROR_CODES)[keyof typeof ERROR_CODES];\n\nexport type ErrorSubsystem =\n  | 'provider'\n  | 'tool'\n  | 'config'\n  | 'plugin'\n  | 'agent'\n  | 'session'\n  | 'sdd'\n  | 'container'\n  | 'fs'\n  | 'general';\nexport type ErrorSeverity = 'fatal' | 'error' | 'warning';\n\n// ── Base error class ─────────────────────────────────────────────────\n\nexport class WrongStackError extends Error {\n  readonly code: ErrorCode;\n  readonly subsystem: ErrorSubsystem;\n  readonly severity: ErrorSeverity;\n  readonly recoverable: boolean;\n  readonly context?: Record<string, unknown> | undefined;\n\n  constructor(opts: {\n    message: string;\n    code: ErrorCode;\n    subsystem: ErrorSubsystem;\n    severity?: ErrorSeverity | undefined;\n    recoverable?: boolean | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super(opts.message, { cause: opts.cause });\n    this.name = 'WrongStackError';\n    this.code = opts.code;\n    this.subsystem = opts.subsystem;\n    this.severity = opts.severity ?? 'error';\n    this.recoverable = opts.recoverable ?? false;\n    this.context = opts.context;\n  }\n\n  /**\n   * Render a one-line user-facing description.\n   * Subclasses should override for domain-specific formatting.\n   */\n  describe(): string {\n    const ctx = this.context ? ` ${formatContext(this.context)}` : '';\n    return `${this.code}: ${this.message}${ctx}`;\n  }\n}\n\nfunction formatContext(ctx: Record<string, unknown>): string {\n  const parts = Object.entries(ctx)\n    .filter(([, v]) => v !== undefined)\n    .slice(0, 3)\n    .map(([k, v]) => `${k}=${String(v)}`);\n  return parts.length > 0 ? `[${parts.join(' ')}]` : '';\n}\n\n// ── Specific error classes ───────────────────────────────────────────\n\n/**\n * Tool execution errors — thrown by ToolExecutor and individual tools.\n */\nexport class ToolError extends WrongStackError {\n  readonly toolName: string;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      | 'TOOL_NOT_FOUND'\n      | 'TOOL_PERMISSION_DENIED'\n      | 'TOOL_EXECUTION_FAILED'\n      | 'TOOL_TIMEOUT'\n      | 'TOOL_INPUT_INVALID'\n    >;\n    toolName: string;\n    recoverable?: boolean | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'tool',\n      recoverable: opts.recoverable,\n      context: { tool: opts.toolName, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'ToolError';\n    this.toolName = opts.toolName;\n  }\n}\n\n/**\n * Config loading / validation errors.\n */\nexport class ConfigError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'CONFIG_INVALID' | 'CONFIG_NOT_FOUND' | 'CONFIG_PARSE_FAILED' | 'CONFIG_MIGRATION_NEEDED'\n    >;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'config',\n      severity: 'fatal',\n      recoverable: false,\n      context: opts.context,\n      cause: opts.cause,\n    });\n    this.name = 'ConfigError';\n  }\n}\n\n/**\n * Plugin loading / lifecycle errors.\n */\nexport class PluginError extends WrongStackError {\n  readonly pluginName: string;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'PLUGIN_LOAD_FAILED' | 'PLUGIN_API_MISMATCH' | 'PLUGIN_MISSING_DEPENDENCY'\n    >;\n    pluginName: string;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'plugin',\n      severity: 'error',\n      recoverable: opts.code === ERROR_CODES.PLUGIN_MISSING_DEPENDENCY,\n      context: { plugin: opts.pluginName, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'PluginError';\n    this.pluginName = opts.pluginName;\n  }\n}\n\n/**\n * Agent runtime errors — thrown by Agent.run when a non-WrongStackError\n * escapes the inner loop, so callers always see a structured error.\n */\nexport class AgentError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'AGENT_ITERATION_LIMIT' | 'AGENT_CONTEXT_OVERFLOW' | 'AGENT_ABORTED' | 'AGENT_RUN_FAILED'\n    >;\n    recoverable?: boolean | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'agent',\n      severity: opts.code === ERROR_CODES.AGENT_ABORTED ? 'warning' : 'error',\n      recoverable: opts.recoverable ?? opts.code === ERROR_CODES.AGENT_ITERATION_LIMIT,\n      context: opts.context,\n      cause: opts.cause,\n    });\n    this.name = 'AgentError';\n  }\n}\n\n/**\n * Wrap an arbitrary thrown value into a `WrongStackError` so the caller\n * always gets a structured error. Pass-throughs WrongStackError instances\n * unchanged; raw `Error`s and primitives get an `AGENT_RUN_FAILED` wrapper\n * with the original preserved as `cause`.\n */\nexport function toWrongStackError(\n  err: unknown,\n  code: Extract<ErrorCode, 'AGENT_RUN_FAILED' | 'AGENT_ABORTED' | 'UNKNOWN'> = ERROR_CODES.AGENT_RUN_FAILED,\n): WrongStackError {\n  if (err instanceof WrongStackError) return err;\n  const message = toErrorMessage(err);\n  return new AgentError({\n    message,\n    code: code === 'UNKNOWN' ? ERROR_CODES.AGENT_RUN_FAILED : code,\n    cause: err,\n  });\n}\n\n/**\n * Session storage errors.\n */\nexport class SessionError extends WrongStackError {\n  readonly sessionId?: string | undefined;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<ErrorCode, 'SESSION_NOT_FOUND' | 'SESSION_CORRUPTED' | 'SESSION_WRITE_FAILED'>;\n    sessionId?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'session',\n      severity: opts.code === ERROR_CODES.SESSION_WRITE_FAILED ? 'error' : 'warning',\n      recoverable: opts.code !== ERROR_CODES.SESSION_CORRUPTED,\n      context: { sessionId: opts.sessionId, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'SessionError';\n    this.sessionId = opts.sessionId;\n  }\n}\n\n/**\n * SDD (Spec-Driven Development) errors — spec validation, parsing, and\n * state machine violations in the AISpecBuilder, TaskFlow, and TaskTracker.\n */\nexport class SddError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'SDD_VALIDATION_FAILED' | 'SDD_PARSE_FAILED' | 'SDD_INVALID_STATE' | 'SDD_NOT_READY'\n    >;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'sdd',\n      severity: opts.code === ERROR_CODES.SDD_PARSE_FAILED ? 'warning' : 'error',\n      recoverable: opts.code === ERROR_CODES.SDD_NOT_READY,\n      context: opts.context,\n      cause: opts.cause,\n    });\n    this.name = 'SddError';\n  }\n}\n\n/**\n * File system operation errors.\n */\nexport class FsError extends WrongStackError {\n  readonly path?: string | undefined;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'FS_READ_FAILED' | 'FS_WRITE_FAILED' | 'FS_MKDIR_FAILED' | 'FS_DELETE_FAILED' | 'FS_ATOMIC_WRITE_FAILED'\n    >;\n    path?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'fs',\n      severity: 'error',\n      recoverable: opts.code !== ERROR_CODES.FS_READ_FAILED,\n      context: { path: opts.path, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'FsError';\n    this.path = opts.path;\n  }\n}\n\n/**\n * HTTP fetch error — thrown when a network request returns a non-OK status.\n * Carries the response status so {@link classifyToolError} can branch on it\n * (429 → transient, 404 → not_found, 401 → permission) without duck-typing\n * the error via `'response' in err`.\n *\n * P3 #18 (before-release.md): the previous `'response' in err` check caught\n * any Error with a `response` property, including custom errors, proxy\n * objects, or mocked errors in tests. `instanceof FetchError` is reliable.\n *\n * Tools and providers that make HTTP requests and need the executor to\n * classify their failures should throw `new FetchError({ status, message })`\n * instead of a bare `Error` with an ad-hoc `response` field.\n */\nexport class FetchError extends WrongStackError {\n  readonly status: number;\n\n  constructor(opts: {\n    message: string;\n    status: number;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: ERROR_CODES.VALIDATION_ERROR,\n      subsystem: 'general',\n      severity: 'error',\n      recoverable: opts.status === 429 || opts.status >= 500,\n      context: { status: opts.status, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'FetchError';\n    this.status = opts.status;\n  }\n}\n\n/**\n * Tool input validation error — thrown when a tool's input fails a validation\n * check that the JSON Schema cannot express (e.g. `old_string === new_string`\n * in edit, or a cross-field invariant). Use this instead of a bare\n * `throw new Error('...validation...')` so {@link classifyToolError} can\n * match on `instanceof` rather than a locale-dependent message substring.\n *\n * P2 #6 (before-release.md): the previous `err.message.includes('validation')`\n * check misclassified any error whose message happened to contain \"validation\"\n * (e.g. a third-party \"input validation timeout\") as a VALIDATION error.\n *\n * Named `ToolValidationError` (not `ValidationError`) to avoid colliding with\n * the existing `ValidationError` interface exported by json-schema-validate.ts\n * (a validation-result shape, not an Error subclass).\n */\nexport class ToolValidationError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    /** Field path or tool name that failed validation, for diagnostics. */\n    field?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: ERROR_CODES.VALIDATION_ERROR,\n      subsystem: 'general',\n      severity: 'error',\n      recoverable: false,\n      context: { field: opts.field, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'ToolValidationError';\n  }\n}\n\n/**\n * Response / payload parse error — thrown when an upstream HTTP response,\n * file, or data structure is well-formed at the transport layer (HTTP 200,\n * valid JSON) but is missing required fields or has an unexpected shape.\n *\n * Distinct from `ConfigError(CONFIG_PARSE_FAILED)` (which is specifically\n * for config-file parsing) and `FetchError` (which covers HTTP non-OK\n * responses). `ParseError` fills the gap: the request succeeded but the\n * response body couldn't be interpreted.\n *\n * Common sites: OAuth token responses missing `access_token`, device-code\n * responses missing `device_code`, registry responses with unexpected\n * schemas.\n */\nexport class ParseError extends WrongStackError {\n  readonly source?: string | undefined;\n\n  constructor(opts: {\n    message: string;\n    /**\n     * What was being parsed — e.g. `'oauth-token-response'`,\n     * `'device-code-response'`. Lets consumers distinguish parse failures\n     * from different upstream APIs without parsing the message.\n     */\n    source?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: ERROR_CODES.PARSE_FAILED,\n      subsystem: 'general',\n      severity: 'error',\n      recoverable: false,\n      context: { source: opts.source, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'ParseError';\n    this.source = opts.source;\n  }\n}\n\n// ── Type guards ──────────────────────────────────────────────────────\n\nexport function isWrongStackError(err: unknown): err is WrongStackError {\n  return err instanceof WrongStackError;\n}\n\nexport function isToolError(err: unknown): err is ToolError {\n  return err instanceof ToolError;\n}\n\nexport function isConfigError(err: unknown): err is ConfigError {\n  return err instanceof ConfigError;\n}\n\nexport function isPluginError(err: unknown): err is PluginError {\n  return err instanceof PluginError;\n}\n\nexport function isSessionError(err: unknown): err is SessionError {\n  return err instanceof SessionError;\n}\n\nexport function isAgentError(err: unknown): err is AgentError {\n  return err instanceof AgentError;\n}\n\nexport function isFsError(err: unknown): err is FsError {\n  return err instanceof FsError;\n}\n\nexport function isToolValidationError(err: unknown): err is ToolValidationError {\n  return err instanceof ToolValidationError;\n}\n\nexport function isFetchError(err: unknown): err is FetchError {\n  return err instanceof FetchError;\n}\n\nexport function isParseError(err: unknown): err is ParseError {\n  return err instanceof ParseError;\n}\n\nexport function isSddError(err: unknown): err is SddError {\n  return err instanceof SddError;\n}\n","import type {\n  TaskFilter,\n  TaskGraph,\n  TaskNode,\n  TaskProgress,\n  TaskSort,\n} from '../types/task-graph.js';\nimport { computeTaskProgress } from '../types/task-graph.js';\nimport { ERROR_CODES, SddError } from '../types/errors.js';\nimport { toErrorMessage } from '../utils/error.js';\n\nexport interface TaskStore {\n  saveGraph(graph: TaskGraph): Promise<void>;\n  loadGraph(id: string): Promise<TaskGraph | null>;\n  listGraphs(): Promise<{ id: string; title: string; updatedAt: number }[]>;\n  deleteGraph(id: string): Promise<void>;\n}\n\nexport interface TaskTrackerOptions {\n  store: TaskStore;\n  /**\n   * Called when an in-the-background persistence (`saveGraph`) rejects.\n   * The synchronous TaskTracker methods (addNode/addEdge/updateNodeStatus)\n   * fire-and-forget their writes; without this, a failing store silently\n   * loses graph mutations. Defaults to a console.warn.\n   */\n  onPersistError?: (((err: unknown) => void)) | undefined;\n}\n\nexport interface TaskTransition {\n  from: TaskNode['status'];\n  to: TaskNode['status'];\n  timestamp: number;\n  reason?: string | undefined;\n}\n\n/** A change notification emitted to `TaskTracker.subscribe` listeners. */\nexport interface TaskTrackerChange {\n  type: 'node_added' | 'node_updated' | 'status_changed' | 'node_removed';\n  nodeId: string;\n  /** For `node_removed` this is the node as it was just before deletion. */\n  node: TaskNode;\n  transition?: TaskTransition | undefined;\n}\n\nexport type TaskTrackerListener = (change: TaskTrackerChange) => void;\n\nexport class TaskTracker {\n  private graph: TaskGraph | null = null;\n  private transitions: TaskTransition[] = [];\n  private listeners: TaskTrackerListener[] = [];\n\n  constructor(private readonly opts: TaskTrackerOptions) {}\n\n  /**\n   * Subscribe to live task mutations (add / update / status change). Returns an\n   * unsubscribe fn. This is the hook the board projector uses to stream a live\n   * snapshot — the tracker was previously fire-and-forget with no observability.\n   */\n  subscribe(listener: TaskTrackerListener): () => void {\n    this.listeners.push(listener);\n    return () => {\n      const i = this.listeners.indexOf(listener);\n      if (i >= 0) this.listeners.splice(i, 1);\n    };\n  }\n\n  private notifyChange(change: TaskTrackerChange): void {\n    for (const l of this.listeners) {\n      try {\n        l(change);\n      } catch {\n        // A faulty listener must never break a tracker mutation.\n      }\n    }\n  }\n\n  /**\n   * Attach an existing graph (used by PhaseOrchestrator to associate a tracker\n   * with a phase's pre-built task graph without re-creating it).\n   */\n  setGraph(graph: TaskGraph): void {\n    this.graph = graph;\n  }\n\n  async createGraph(specId: string, title: string): Promise<TaskGraph> {\n    this.graph = {\n      id: crypto.randomUUID(),\n      specId,\n      title,\n      nodes: new Map(),\n      edges: [],\n      rootNodes: [],\n      createdAt: Date.now(),\n      updatedAt: Date.now(),\n    };\n    await this.opts.store.saveGraph(this.graph);\n    return this.graph;\n  }\n\n  async loadGraph(id: string): Promise<TaskGraph | null> {\n    this.graph = await this.opts.store.loadGraph(id);\n    return this.graph;\n  }\n\n  addNode(node: Omit<TaskNode, 'id' | 'createdAt' | 'updatedAt'>): TaskNode {\n    if (!this.graph) throw new SddError({\n      message: 'No graph loaded',\n      code: ERROR_CODES.SDD_INVALID_STATE,\n    });\n\n    const now = Date.now();\n    const newNode: TaskNode = {\n      ...node,\n      id: crypto.randomUUID(),\n      status: node.status ?? 'pending',\n      createdAt: now,\n      updatedAt: now,\n    };\n\n    this.graph.nodes.set(newNode.id, newNode);\n\n    if (!node.parentId) {\n      this.graph.rootNodes.push(newNode.id);\n    }\n\n    this.graph.updatedAt = now;\n    this.persist();\n    this.notifyChange({ type: 'node_added', nodeId: newNode.id, node: newNode });\n\n    return newNode;\n  }\n\n  addEdge(from: string, to: string, type: TaskGraph['edges'][0]['type'] = 'depends_on'): void {\n    if (!this.graph) throw new SddError({\n      message: 'No graph loaded',\n      code: ERROR_CODES.SDD_INVALID_STATE,\n    });\n\n    this.graph.edges.push({\n      id: crypto.randomUUID(),\n      from,\n      to,\n      type,\n    });\n    this.graph.updatedAt = Date.now();\n    this.persist();\n  }\n\n  /**\n   * Declare that `taskId` depends on `depId` (a `depends_on` edge `depId → taskId`),\n   * guarding against self-loops, duplicates, missing nodes, and cycles. Returns\n   * true if the dependency now holds (added or already present), false if it was\n   * rejected (would create a cycle / unknown node). This is the safe entry point\n   * for wiring agent-declared `dependsOn` references into the graph.\n   */\n  addDependency(depId: string, taskId: string): boolean {\n    if (!this.graph) return false;\n    if (depId === taskId) return false;\n    if (!this.graph.nodes.has(depId) || !this.graph.nodes.has(taskId)) return false;\n    // Already a blocker — idempotent success.\n    if (this.getBlockers(taskId).includes(depId)) return true;\n    // Cycle guard: if `depId` already (transitively) depends on `taskId`, adding\n    // `taskId → depId` would close a loop. Reject rather than deadlock the run.\n    if (this.dependsOnTransitively(depId, taskId, new Set())) return false;\n    this.addEdge(depId, taskId, 'depends_on');\n    return true;\n  }\n\n  /** True when `taskId` transitively depends on `targetId` (follows depends_on blockers). */\n  private dependsOnTransitively(taskId: string, targetId: string, seen: Set<string>): boolean {\n    if (taskId === targetId) return true;\n    if (seen.has(taskId)) return false;\n    seen.add(taskId);\n    for (const blocker of this.getBlockers(taskId)) {\n      if (this.dependsOnTransitively(blocker, targetId, seen)) return true;\n    }\n    return false;\n  }\n\n  /**\n   * Merge `patch` into a node's `metadata` (used for per-task model/provider/\n   * fallback assignment and the cancel marker). Persists + notifies as a node\n   * update. No-op if the node is missing.\n   */\n  patchMetadata(id: string, patch: Record<string, unknown>): void {\n    if (!this.graph) return;\n    const node = this.graph.nodes.get(id);\n    if (!node) return;\n    node.metadata = { ...node.metadata, ...patch };\n    node.updatedAt = Date.now();\n    this.graph.updatedAt = node.updatedAt;\n    this.persist();\n    this.notifyChange({ type: 'node_updated', nodeId: id, node });\n  }\n\n  /**\n   * Remove a node and every edge touching it. Intended for deleting a task that\n   * has not started yet — callers must gate on status (do not remove a running\n   * task). Dependents simply lose this blocker (re-evaluated by `canStart`).\n   * Returns true if a node was removed.\n   */\n  removeNode(id: string): boolean {\n    if (!this.graph) return false;\n    const node = this.graph.nodes.get(id);\n    if (!node) return false;\n    this.graph.nodes.delete(id);\n    this.graph.edges = this.graph.edges.filter((e) => e.from !== id && e.to !== id);\n    this.graph.rootNodes = this.graph.rootNodes.filter((r) => r !== id);\n    // Detach from any parent's children list.\n    for (const n of this.graph.nodes.values()) {\n      if (n.children?.includes(id)) n.children = n.children.filter((c) => c !== id);\n    }\n    this.graph.updatedAt = Date.now();\n    this.persist();\n    this.notifyChange({ type: 'node_removed', nodeId: id, node });\n    return true;\n  }\n\n  updateNodeStatus(id: string, status: TaskNode['status'], reason?: string): void {\n    if (!this.graph) throw new SddError({\n      message: 'No graph loaded',\n      code: ERROR_CODES.SDD_INVALID_STATE,\n    });\n\n    const node = this.graph.nodes.get(id);\n    if (!node) throw new SddError({\n      message: `Node ${id} not found`,\n      code: ERROR_CODES.SDD_NOT_READY,\n      context: { nodeId: id },\n    });\n\n    const from = node.status;\n    const now = Date.now();\n    node.status = status;\n    node.updatedAt = now;\n\n    if (status === 'completed') {\n      node.completedAt = now;\n      node.startedAt = node.startedAt ?? now; // ensure startedAt is set\n    }\n    if (status === 'in_progress') {\n      node.startedAt = now;\n    }\n\n    this.transitions.push({ from, to: status, timestamp: now, reason });\n\n    // Auto-unblock dependents\n    if (status === 'completed') {\n      this.unblockDependents(id);\n    }\n\n    // Auto-block blockers\n    if (status === 'in_progress') {\n      this.checkAndBlockIfNeeded(id);\n    }\n\n    this.graph.updatedAt = now;\n    this.persist();\n    this.notifyChange({\n      type: 'status_changed',\n      nodeId: id,\n      node,\n      transition: { from, to: status, timestamp: now, reason },\n    });\n  }\n\n  updateNode(id: string, patch: Partial<Pick<TaskNode, 'title' | 'description' | 'priority' | 'estimateHours' | 'tags' | 'assignee'>>): void {\n    if (!this.graph) throw new SddError({\n      message: 'No graph loaded',\n      code: ERROR_CODES.SDD_INVALID_STATE,\n    });\n\n    const node = this.graph.nodes.get(id);\n    if (!node) throw new SddError({\n      message: `Node ${id} not found`,\n      code: ERROR_CODES.SDD_NOT_READY,\n      context: { nodeId: id },\n    });\n\n    if (patch.title !== undefined) node.title = patch.title;\n    if (patch.description !== undefined) node.description = patch.description;\n    if (patch.priority !== undefined) node.priority = patch.priority;\n    if (patch.estimateHours !== undefined) node.estimateHours = patch.estimateHours;\n    if (patch.tags !== undefined) node.tags = patch.tags;\n    if (patch.assignee !== undefined) node.assignee = patch.assignee;\n    node.updatedAt = Date.now();\n    this.graph.updatedAt = node.updatedAt;\n    this.persist();\n    this.notifyChange({ type: 'node_updated', nodeId: id, node });\n  }\n\n  getNode(id: string): TaskNode | undefined {\n    return this.graph?.nodes.get(id);\n  }\n\n  getAllNodes(filter?: TaskFilter, sort?: TaskSort): TaskNode[] {\n    if (!this.graph) return [];\n\n    let nodes = Array.from(this.graph.nodes.values());\n\n    if (filter) {\n      nodes = nodes.filter((n) => {\n        if (filter.status?.length && !filter.status.includes(n.status)) return false;\n        if (filter.priority?.length && !filter.priority.includes(n.priority)) return false;\n        if (filter.type?.length && !filter.type.includes(n.type)) return false;\n        if (filter.assignee?.length && n.assignee && !filter.assignee.includes(n.assignee))\n          return false;\n        if (filter.tags?.length && n.tags && !n.tags.some((t) => filter.tags?.includes(t)))\n          return false;\n        if (filter.specRequirementId && n.specRequirementId !== filter.specRequirementId)\n          return false;\n        return true;\n      });\n    }\n\n    if (sort) {\n      nodes.sort((a, b) => {\n        const cmp = compareByField(a, b, sort.field);\n        return sort.direction === 'asc' ? cmp : -cmp;\n      });\n    }\n\n    return nodes;\n  }\n\n  getChildren(parentId: string): TaskNode[] {\n    if (!this.graph) return [];\n    return Array.from(this.graph.nodes.values()).filter((n) => n.parentId === parentId);\n  }\n\n  getDependents(taskId: string): string[] {\n    if (!this.graph) return [];\n    return this.graph.edges\n      .filter((e) => e.from === taskId && e.type === 'depends_on')\n      .map((e) => e.to);\n  }\n\n  getBlockers(taskId: string): string[] {\n    if (!this.graph) return [];\n    return this.graph.edges\n      .filter((e) => e.to === taskId && e.type === 'depends_on')\n      .map((e) => e.from);\n  }\n\n  canStart(taskId: string): boolean {\n    const blockers = this.getBlockers(taskId);\n    return blockers.every((id) => {\n      const node = this.graph?.nodes.get(id);\n      // A task can start when all blockers are either completed or failed.\n      // Failed blockers should not permanently deadlock dependent tasks.\n      return node?.status === 'completed' || node?.status === 'failed';\n    });\n  }\n\n  getProgress(): TaskProgress {\n    if (!this.graph) {\n      return {\n        total: 0,\n        pending: 0,\n        inProgress: 0,\n        blocked: 0,\n        failed: 0,\n        review: 0,\n        completed: 0,\n        percentComplete: 0,\n        estimatedHours: 0,\n        actualHours: 0,\n      };\n    }\n    return computeTaskProgress(this.graph);\n  }\n\n  getTransitions(_taskId?: string): TaskTransition[] {\n    return [...this.transitions];\n  }\n\n  private unblockDependents(completedId: string): void {\n    if (!this.graph) return;\n    const dependents = this.getDependents(completedId);\n    for (const depId of dependents) {\n      const dep = this.graph.nodes.get(depId);\n      if (dep?.status === 'blocked') {\n        // Check if all blockers are now completed\n        const remainingBlockers = this.getBlockers(depId);\n        const allUnblocked = remainingBlockers.every((id) => {\n          const blocker = this.graph?.nodes.get(id);\n          return blocker?.status === 'completed' || blocker?.status === 'failed';\n        });\n        if (allUnblocked) {\n          dep.status = 'pending';\n          dep.updatedAt = Date.now();\n        }\n      }\n    }\n  }\n\n  private checkAndBlockIfNeeded(taskId: string): void {\n    if (!this.graph) return;\n    const blockers = this.getBlockers(taskId);\n    const someBlocked = blockers.some((id) => {\n      const blocker = this.graph?.nodes.get(id);\n      // A task is only blocked by incomplete blockers that haven't failed.\n      // Failed tasks should not block their dependents.\n      return blocker?.status !== 'completed' && blocker?.status !== 'failed';\n    });\n    if (someBlocked) {\n      const node = this.graph.nodes.get(taskId);\n      if (node) {\n        node.status = 'blocked';\n        node.updatedAt = Date.now();\n      }\n    }\n  }\n\n  /**\n   * Fire-and-forget persistence with attached error handler.\n   * Synchronous mutators (addNode/addEdge/updateNodeStatus) use this to\n   * avoid forcing an async cascade through every caller; if the store\n   * is missing or throwing, the error is surfaced via onPersistError.\n   */\n  private persist(): void {\n    if (!this.graph) return;\n    this.opts.store.saveGraph(this.graph).catch((err) => {\n      this.opts.onPersistError\n        ? this.opts.onPersistError(err)\n        : console.warn(JSON.stringify({\n            level: 'warn',\n            event: 'task_tracker.save_graph_failed',\n            message: toErrorMessage(err),\n            timestamp: new Date().toISOString(),\n          }));\n    });\n  }\n}\n\n// Sort comparison helpers\nconst PRIORITY_RANK: Record<TaskNode['priority'], number> = {\n  critical: 0,\n  high: 1,\n  medium: 2,\n  low: 3,\n};\nconst STATUS_RANK: Record<TaskNode['status'], number> = {\n  in_progress: 0,\n  pending: 1,\n  review: 2,\n  blocked: 3,\n  failed: 4,\n  completed: 5,\n};\n\nfunction compareByField(a: TaskNode, b: TaskNode, field: TaskSort['field']): number {\n  switch (field) {\n    case 'priority': return PRIORITY_RANK[a.priority] - PRIORITY_RANK[b.priority];\n    case 'status': return STATUS_RANK[a.status] - STATUS_RANK[b.status];\n    case 'createdAt': return a.createdAt - b.createdAt;\n    case 'updatedAt': return a.updatedAt - b.updatedAt;\n  }\n}\n"]}
+{
+  "version": 3,
+  "sources": ["../../src/tasking/task-store.ts", "../../src/types/task-graph.ts", "../../src/utils/error.ts", "../../src/types/errors.ts", "../../src/tasking/task-tracker.ts"],
+  "sourcesContent": ["import type { TaskGraph } from '../types/task-graph.js';\nimport type { TaskStore } from './task-tracker.js';\n\n/**\n * In-memory task-graph store used by AutoPhase and tests.\n *\n * The store clones the graph container on read/write so callers cannot replace\n * its Maps/arrays behind the store's back. Task nodes themselves intentionally\n * remain shared: TaskTracker owns node mutation and persists after each change.\n */\nexport class DefaultTaskStore implements TaskStore {\n  private readonly graphs = new Map<string, TaskGraph>();\n\n  async saveGraph(graph: TaskGraph): Promise<void> {\n    this.graphs.set(graph.id, this.cloneGraph(graph));\n  }\n\n  async loadGraph(id: string): Promise<TaskGraph | null> {\n    const graph = this.graphs.get(id);\n    return graph ? this.cloneGraph(graph) : null;\n  }\n\n  async listGraphs(): Promise<Array<{ id: string; title: string; updatedAt: number }>> {\n    return Array.from(this.graphs.values()).map((graph) => ({\n      id: graph.id,\n      title: graph.title,\n      updatedAt: graph.updatedAt,\n    }));\n  }\n\n  async deleteGraph(id: string): Promise<void> {\n    this.graphs.delete(id);\n  }\n\n  private cloneGraph(graph: TaskGraph): TaskGraph {\n    return {\n      ...graph,\n      nodes: new Map(graph.nodes),\n      edges: [...graph.edges],\n      rootNodes: [...graph.rootNodes],\n    };\n  }\n}\n", "export type TaskStatus = 'pending' | 'in_progress' | 'blocked' | 'failed' | 'review' | 'completed';\nexport type TaskPriority = 'critical' | 'high' | 'medium' | 'low';\nexport type TaskType = 'feature' | 'bugfix' | 'refactor' | 'docs' | 'test' | 'chore';\n\nexport interface TaskNode {\n  id: string;\n  title: string;\n  description: string;\n  type: TaskType;\n  priority: TaskPriority;\n  status: TaskStatus;\n  assignee?: string | undefined;\n  estimateHours?: number | undefined;\n  actualHours?: number | undefined;\n  tags?: string[] | undefined;\n  specRequirementId?: string | undefined;\n  parentId?: string | undefined;\n  children?: string[] | undefined;\n  createdAt: number;\n  updatedAt: number;\n  startedAt?: number | undefined; // set when status \u2192 in_progress\n  completedAt?: number | undefined;\n  metadata?: Record<string, unknown>;\n}\n\nexport interface TaskEdge {\n  id: string;\n  from: string;\n  to: string;\n  type: 'blocks' | 'depends_on' | 'relates_to' | 'implements';\n  weight?: number | undefined;\n}\n\nexport interface TaskGraph {\n  id: string;\n  specId: string;\n  title: string;\n  nodes: Map<string, TaskNode>;\n  edges: TaskEdge[];\n  rootNodes: string[];\n  createdAt: number;\n  updatedAt: number;\n}\n\nexport interface TaskDependency {\n  taskId: string;\n  blockedBy: string[];\n  blocking: string[];\n}\n\nexport interface TaskAssignment {\n  taskId: string;\n  assignee: string;\n  assignedAt: number;\n}\n\nexport interface TaskProgress {\n  total: number;\n  pending: number;\n  inProgress: number;\n  blocked: number;\n  failed: number;\n  review: number;\n  completed: number;\n  percentComplete: number;\n  estimatedHours: number;\n  actualHours: number;\n}\n\nexport interface TaskFilter {\n  status?: TaskStatus[] | undefined;\n  priority?: TaskPriority[] | undefined;\n  type?: TaskType[] | undefined;\n  assignee?: string[] | undefined;\n  tags?: string[] | undefined;\n  specRequirementId?: string | undefined;\n}\n\nexport interface TaskSort {\n  field: 'priority' | 'createdAt' | 'updatedAt' | 'status';\n  direction: 'asc' | 'desc';\n}\n\nexport interface CriticalPathResult {\n  taskIds: string[];\n  totalEstimateHours: number;\n  bottleneckTasks: string[];\n}\n\nexport function computeTaskProgress(graph: TaskGraph): TaskProgress {\n  let completed = 0;\n  let pending = 0;\n  let inProgress = 0;\n  let blocked = 0;\n  let failed = 0;\n  let review = 0;\n  let estimatedHours = 0;\n  let actualHours = 0;\n  for (const n of graph.nodes.values()) {\n    switch (n.status) {\n      case 'completed':\n        completed++;\n        break;\n      case 'pending':\n        pending++;\n        break;\n      case 'in_progress':\n        inProgress++;\n        break;\n      case 'blocked':\n        blocked++;\n        break;\n      case 'failed':\n        failed++;\n        break;\n      case 'review':\n        review++;\n        break;\n    }\n    estimatedHours += n.estimateHours ?? 0;\n    actualHours += n.actualHours ?? 0;\n  }\n  const total = graph.nodes.size;\n\n  return {\n    total,\n    pending,\n    inProgress,\n    blocked,\n    failed,\n    review,\n    completed,\n    percentComplete: total > 0 ? Math.round((completed / total) * 100) : 0,\n    estimatedHours,\n    actualHours,\n  };\n}\n\nexport function findCriticalPath(graph: TaskGraph): CriticalPathResult {\n  const nodes = Array.from(graph.nodes.values());\n  const criticalNodes = nodes.filter((n) => n.priority === 'critical');\n  const bottleneckTasks = criticalNodes\n    .filter((n) => graph.edges.some((e) => e.to === n.id && e.type === 'depends_on'))\n    .map((n) => n.id);\n\n  const totalEstimateHours = criticalNodes.reduce((sum, n) => sum + (n.estimateHours ?? 0), 0);\n\n  return {\n    taskIds: criticalNodes.map((n) => n.id),\n    totalEstimateHours,\n    bottleneckTasks,\n  };\n}\n\nexport function topologicalSort(graph: TaskGraph): string[] {\n  const visited = new Set<string>();\n  const inStack = new Set<string>();\n  const result: string[] = [];\n\n  function visit(id: string): void {\n    // Cycle: callers must detect cycles up-front if they care; we just stop recursing.\n    if (inStack.has(id)) return;\n    if (visited.has(id)) return;\n    if (!graph.nodes.has(id)) return;\n\n    visited.add(id);\n    inStack.add(id);\n\n    for (const edge of graph.edges) {\n      if (edge.from === id) visit(edge.to);\n    }\n\n    inStack.delete(id);\n    result.push(id);\n  }\n\n  for (const rootId of graph.rootNodes) {\n    visit(rootId);\n  }\n\n  return result;\n}\n\nexport type SerializableTaskGraphNodes =\n  | TaskNode[]\n  | Array<[string, TaskNode]>\n  | Record<string, TaskNode>;\n\nexport type SerializableTaskGraph = Omit<TaskGraph, 'nodes'> & {\n  nodes: SerializableTaskGraphNodes;\n};\n\nexport type SerializedTaskGraph = Omit<TaskGraph, 'nodes'> & {\n  nodes: TaskNode[];\n};\n\nexport function serializeTaskGraph(graph: TaskGraph): SerializedTaskGraph {\n  return {\n    ...graph,\n    nodes: Array.from(graph.nodes.values()),\n  };\n}\n\nexport function deserializeTaskGraph(input: SerializableTaskGraph): TaskGraph {\n  const nodes = new Map<string, TaskNode>();\n  if (Array.isArray(input.nodes)) {\n    for (const entry of input.nodes) {\n      if (Array.isArray(entry)) nodes.set(entry[0], { ...entry[1], id: entry[1].id || entry[0] });\n      else nodes.set(entry.id, entry);\n    }\n  } else {\n    for (const [id, node] of Object.entries(input.nodes)) {\n      nodes.set(id, { ...node, id: node.id || id });\n    }\n  }\n  return { ...input, nodes };\n}\n", "/**\n * Converts an unknown error value to a human-readable string.\n * Used in 40+ files across the codebase to normalize error messaging.\n */\nexport function toErrorMessage(err: unknown): string {\n  return err instanceof Error ? err.message : String(err);\n}\n", "import { toErrorMessage } from '../utils/index.js';\n\n/**\n * WrongStack error hierarchy.\n *\n * Every error thrown by the framework is a `WrongStackError` with a\n * machine-readable `code`, a `subsystem` tag, and a `severity` level.\n * This lets consumers (CLI, TUI, plugins, tests) branch on structured\n * data instead of parsing error messages.\n */\n\n// \u2500\u2500 Error codes \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n/**\n * Machine-readable error codes as frozen constants.\n *\n * Use `ERROR_CODES.X` instead of raw string literals for:\n * - IDE autocomplete and compile-time validation\n * - Safe refactoring (rename updates all usages)\n * - Plugin extensibility (extend the object to add custom codes)\n *\n * The `ErrorCode` type is derived from this object, so adding a new\n * code here automatically updates the type without extra changes.\n */\nexport const ERROR_CODES = {\n  // Provider\n  PROVIDER_RATE_LIMITED: 'PROVIDER_RATE_LIMITED',\n  PROVIDER_AUTH_FAILED: 'PROVIDER_AUTH_FAILED',\n  PROVIDER_OVERLOADED: 'PROVIDER_OVERLOADED',\n  PROVIDER_INVALID_REQUEST: 'PROVIDER_INVALID_REQUEST',\n  PROVIDER_SERVER_ERROR: 'PROVIDER_SERVER_ERROR',\n  PROVIDER_NETWORK_ERROR: 'PROVIDER_NETWORK_ERROR',\n  PROVIDER_CONTEXT_OVERFLOW: 'PROVIDER_CONTEXT_OVERFLOW',\n  // Tool\n  TOOL_NOT_FOUND: 'TOOL_NOT_FOUND',\n  TOOL_PERMISSION_DENIED: 'TOOL_PERMISSION_DENIED',\n  TOOL_EXECUTION_FAILED: 'TOOL_EXECUTION_FAILED',\n  TOOL_TIMEOUT: 'TOOL_TIMEOUT',\n  TOOL_INPUT_INVALID: 'TOOL_INPUT_INVALID',\n  // Config\n  CONFIG_INVALID: 'CONFIG_INVALID',\n  CONFIG_NOT_FOUND: 'CONFIG_NOT_FOUND',\n  CONFIG_PARSE_FAILED: 'CONFIG_PARSE_FAILED',\n  CONFIG_MIGRATION_NEEDED: 'CONFIG_MIGRATION_NEEDED',\n  // Plugin\n  PLUGIN_LOAD_FAILED: 'PLUGIN_LOAD_FAILED',\n  PLUGIN_API_MISMATCH: 'PLUGIN_API_MISMATCH',\n  PLUGIN_MISSING_DEPENDENCY: 'PLUGIN_MISSING_DEPENDENCY',\n  // Agent\n  AGENT_ITERATION_LIMIT: 'AGENT_ITERATION_LIMIT',\n  AGENT_CONTEXT_OVERFLOW: 'AGENT_CONTEXT_OVERFLOW',\n  AGENT_ABORTED: 'AGENT_ABORTED',\n  AGENT_RUN_FAILED: 'AGENT_RUN_FAILED',\n  // Session\n  SESSION_NOT_FOUND: 'SESSION_NOT_FOUND',\n  SESSION_CORRUPTED: 'SESSION_CORRUPTED',\n  SESSION_WRITE_FAILED: 'SESSION_WRITE_FAILED',\n  // Container / Registry\n  CONTAINER_TOKEN_ALREADY_BOUND: 'CONTAINER_TOKEN_ALREADY_BOUND',\n  CONTAINER_TOKEN_NOT_BOUND: 'CONTAINER_TOKEN_NOT_BOUND',\n  CONTAINER_CIRCULAR_DEPENDENCY: 'CONTAINER_CIRCULAR_DEPENDENCY',\n  REGISTRY_DUPLICATE: 'REGISTRY_DUPLICATE',\n  REGISTRY_NOT_FOUND: 'REGISTRY_NOT_FOUND',\n  REGISTRY_INVALID: 'REGISTRY_INVALID',\n  // File system\n  FS_READ_FAILED: 'FS_READ_FAILED',\n  FS_WRITE_FAILED: 'FS_WRITE_FAILED',\n  FS_MKDIR_FAILED: 'FS_MKDIR_FAILED',\n  FS_DELETE_FAILED: 'FS_DELETE_FAILED',\n  FS_ATOMIC_WRITE_FAILED: 'FS_ATOMIC_WRITE_FAILED',\n  // SDD (Spec-Driven Development)\n  SDD_VALIDATION_FAILED: 'SDD_VALIDATION_FAILED',\n  SDD_PARSE_FAILED: 'SDD_PARSE_FAILED',\n  SDD_INVALID_STATE: 'SDD_INVALID_STATE',\n  SDD_NOT_READY: 'SDD_NOT_READY',\n  // General\n  VALIDATION_ERROR: 'VALIDATION_ERROR',\n  PARSE_FAILED: 'PARSE_FAILED',\n  UNKNOWN: 'UNKNOWN',\n} as const;\n\n/**\n * Union type derived from `ERROR_CODES`. Using `typeof ERROR_CODES[keyof typeof ERROR_CODES]`\n * instead of a string literal union means TypeScript auto-updates the type whenever\n * a new code is added to `ERROR_CODES` \u2014 no need to keep two lists in sync.\n */\nexport type ErrorCode = (typeof ERROR_CODES)[keyof typeof ERROR_CODES];\n\nexport type ErrorSubsystem =\n  | 'provider'\n  | 'tool'\n  | 'config'\n  | 'plugin'\n  | 'agent'\n  | 'session'\n  | 'sdd'\n  | 'container'\n  | 'fs'\n  | 'general';\nexport type ErrorSeverity = 'fatal' | 'error' | 'warning';\n\n// \u2500\u2500 Base error class \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport class WrongStackError extends Error {\n  readonly code: ErrorCode;\n  readonly subsystem: ErrorSubsystem;\n  readonly severity: ErrorSeverity;\n  readonly recoverable: boolean;\n  readonly context?: Record<string, unknown> | undefined;\n\n  constructor(opts: {\n    message: string;\n    code: ErrorCode;\n    subsystem: ErrorSubsystem;\n    severity?: ErrorSeverity | undefined;\n    recoverable?: boolean | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super(opts.message, { cause: opts.cause });\n    this.name = 'WrongStackError';\n    this.code = opts.code;\n    this.subsystem = opts.subsystem;\n    this.severity = opts.severity ?? 'error';\n    this.recoverable = opts.recoverable ?? false;\n    this.context = opts.context;\n  }\n\n  /**\n   * Render a one-line user-facing description.\n   * Subclasses should override for domain-specific formatting.\n   */\n  describe(): string {\n    const ctx = this.context ? ` ${formatContext(this.context)}` : '';\n    return `${this.code}: ${this.message}${ctx}`;\n  }\n}\n\nfunction formatContext(ctx: Record<string, unknown>): string {\n  const parts = Object.entries(ctx)\n    .filter(([, v]) => v !== undefined)\n    .slice(0, 3)\n    .map(([k, v]) => `${k}=${String(v)}`);\n  return parts.length > 0 ? `[${parts.join(' ')}]` : '';\n}\n\n// \u2500\u2500 Specific error classes \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\n/**\n * Tool execution errors \u2014 thrown by ToolExecutor and individual tools.\n */\nexport class ToolError extends WrongStackError {\n  readonly toolName: string;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      | 'TOOL_NOT_FOUND'\n      | 'TOOL_PERMISSION_DENIED'\n      | 'TOOL_EXECUTION_FAILED'\n      | 'TOOL_TIMEOUT'\n      | 'TOOL_INPUT_INVALID'\n    >;\n    toolName: string;\n    recoverable?: boolean | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'tool',\n      recoverable: opts.recoverable,\n      context: { tool: opts.toolName, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'ToolError';\n    this.toolName = opts.toolName;\n  }\n}\n\n/**\n * Config loading / validation errors.\n */\nexport class ConfigError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'CONFIG_INVALID' | 'CONFIG_NOT_FOUND' | 'CONFIG_PARSE_FAILED' | 'CONFIG_MIGRATION_NEEDED'\n    >;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'config',\n      severity: 'fatal',\n      recoverable: false,\n      context: opts.context,\n      cause: opts.cause,\n    });\n    this.name = 'ConfigError';\n  }\n}\n\n/**\n * Plugin loading / lifecycle errors.\n */\nexport class PluginError extends WrongStackError {\n  readonly pluginName: string;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'PLUGIN_LOAD_FAILED' | 'PLUGIN_API_MISMATCH' | 'PLUGIN_MISSING_DEPENDENCY'\n    >;\n    pluginName: string;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'plugin',\n      severity: 'error',\n      recoverable: opts.code === ERROR_CODES.PLUGIN_MISSING_DEPENDENCY,\n      context: { plugin: opts.pluginName, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'PluginError';\n    this.pluginName = opts.pluginName;\n  }\n}\n\n/**\n * Agent runtime errors \u2014 thrown by Agent.run when a non-WrongStackError\n * escapes the inner loop, so callers always see a structured error.\n */\nexport class AgentError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'AGENT_ITERATION_LIMIT' | 'AGENT_CONTEXT_OVERFLOW' | 'AGENT_ABORTED' | 'AGENT_RUN_FAILED'\n    >;\n    recoverable?: boolean | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'agent',\n      severity: opts.code === ERROR_CODES.AGENT_ABORTED ? 'warning' : 'error',\n      recoverable: opts.recoverable ?? opts.code === ERROR_CODES.AGENT_ITERATION_LIMIT,\n      context: opts.context,\n      cause: opts.cause,\n    });\n    this.name = 'AgentError';\n  }\n}\n\n/**\n * Wrap an arbitrary thrown value into a `WrongStackError` so the caller\n * always gets a structured error. Pass-throughs WrongStackError instances\n * unchanged; raw `Error`s and primitives get an `AGENT_RUN_FAILED` wrapper\n * with the original preserved as `cause`.\n */\nexport function toWrongStackError(\n  err: unknown,\n  code: Extract<ErrorCode, 'AGENT_RUN_FAILED' | 'AGENT_ABORTED' | 'UNKNOWN'> = ERROR_CODES.AGENT_RUN_FAILED,\n): WrongStackError {\n  if (err instanceof WrongStackError) return err;\n  const message = toErrorMessage(err);\n  return new AgentError({\n    message,\n    code: code === 'UNKNOWN' ? ERROR_CODES.AGENT_RUN_FAILED : code,\n    cause: err,\n  });\n}\n\n/**\n * Session storage errors.\n */\nexport class SessionError extends WrongStackError {\n  readonly sessionId?: string | undefined;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<ErrorCode, 'SESSION_NOT_FOUND' | 'SESSION_CORRUPTED' | 'SESSION_WRITE_FAILED'>;\n    sessionId?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'session',\n      severity: opts.code === ERROR_CODES.SESSION_WRITE_FAILED ? 'error' : 'warning',\n      recoverable: opts.code !== ERROR_CODES.SESSION_CORRUPTED,\n      context: { sessionId: opts.sessionId, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'SessionError';\n    this.sessionId = opts.sessionId;\n  }\n}\n\n/**\n * SDD (Spec-Driven Development) errors \u2014 spec validation, parsing, and\n * state machine violations in the AISpecBuilder, TaskFlow, and TaskTracker.\n */\nexport class SddError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'SDD_VALIDATION_FAILED' | 'SDD_PARSE_FAILED' | 'SDD_INVALID_STATE' | 'SDD_NOT_READY'\n    >;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'sdd',\n      severity: opts.code === ERROR_CODES.SDD_PARSE_FAILED ? 'warning' : 'error',\n      recoverable: opts.code === ERROR_CODES.SDD_NOT_READY,\n      context: opts.context,\n      cause: opts.cause,\n    });\n    this.name = 'SddError';\n  }\n}\n\n/**\n * File system operation errors.\n */\nexport class FsError extends WrongStackError {\n  readonly path?: string | undefined;\n\n  constructor(opts: {\n    message: string;\n    code: Extract<\n      ErrorCode,\n      'FS_READ_FAILED' | 'FS_WRITE_FAILED' | 'FS_MKDIR_FAILED' | 'FS_DELETE_FAILED' | 'FS_ATOMIC_WRITE_FAILED'\n    >;\n    path?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: opts.code,\n      subsystem: 'fs',\n      severity: 'error',\n      recoverable: opts.code !== ERROR_CODES.FS_READ_FAILED,\n      context: { path: opts.path, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'FsError';\n    this.path = opts.path;\n  }\n}\n\n/**\n * HTTP fetch error \u2014 thrown when a network request returns a non-OK status.\n * Carries the response status so {@link classifyToolError} can branch on it\n * (429 \u2192 transient, 404 \u2192 not_found, 401 \u2192 permission) without duck-typing\n * the error via `'response' in err`.\n *\n * P3 #18 (before-release.md): the previous `'response' in err` check caught\n * any Error with a `response` property, including custom errors, proxy\n * objects, or mocked errors in tests. `instanceof FetchError` is reliable.\n *\n * Tools and providers that make HTTP requests and need the executor to\n * classify their failures should throw `new FetchError({ status, message })`\n * instead of a bare `Error` with an ad-hoc `response` field.\n */\nexport class FetchError extends WrongStackError {\n  readonly status: number;\n\n  constructor(opts: {\n    message: string;\n    status: number;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: ERROR_CODES.VALIDATION_ERROR,\n      subsystem: 'general',\n      severity: 'error',\n      recoverable: opts.status === 429 || opts.status >= 500,\n      context: { status: opts.status, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'FetchError';\n    this.status = opts.status;\n  }\n}\n\n/**\n * Tool input validation error \u2014 thrown when a tool's input fails a validation\n * check that the JSON Schema cannot express (e.g. `old_string === new_string`\n * in edit, or a cross-field invariant). Use this instead of a bare\n * `throw new Error('...validation...')` so {@link classifyToolError} can\n * match on `instanceof` rather than a locale-dependent message substring.\n *\n * P2 #6 (before-release.md): the previous `err.message.includes('validation')`\n * check misclassified any error whose message happened to contain \"validation\"\n * (e.g. a third-party \"input validation timeout\") as a VALIDATION error.\n *\n * Named `ToolValidationError` (not `ValidationError`) to avoid colliding with\n * the existing `ValidationError` interface exported by json-schema-validate.ts\n * (a validation-result shape, not an Error subclass).\n */\nexport class ToolValidationError extends WrongStackError {\n  constructor(opts: {\n    message: string;\n    /** Field path or tool name that failed validation, for diagnostics. */\n    field?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: ERROR_CODES.VALIDATION_ERROR,\n      subsystem: 'general',\n      severity: 'error',\n      recoverable: false,\n      context: { field: opts.field, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'ToolValidationError';\n  }\n}\n\n/**\n * Response / payload parse error \u2014 thrown when an upstream HTTP response,\n * file, or data structure is well-formed at the transport layer (HTTP 200,\n * valid JSON) but is missing required fields or has an unexpected shape.\n *\n * Distinct from `ConfigError(CONFIG_PARSE_FAILED)` (which is specifically\n * for config-file parsing) and `FetchError` (which covers HTTP non-OK\n * responses). `ParseError` fills the gap: the request succeeded but the\n * response body couldn't be interpreted.\n *\n * Common sites: OAuth token responses missing `access_token`, device-code\n * responses missing `device_code`, registry responses with unexpected\n * schemas.\n */\nexport class ParseError extends WrongStackError {\n  readonly source?: string | undefined;\n\n  constructor(opts: {\n    message: string;\n    /**\n     * What was being parsed \u2014 e.g. `'oauth-token-response'`,\n     * `'device-code-response'`. Lets consumers distinguish parse failures\n     * from different upstream APIs without parsing the message.\n     */\n    source?: string | undefined;\n    context?: Record<string, unknown> | undefined;\n    cause?: unknown | undefined;\n  }) {\n    super({\n      message: opts.message,\n      code: ERROR_CODES.PARSE_FAILED,\n      subsystem: 'general',\n      severity: 'error',\n      recoverable: false,\n      context: { source: opts.source, ...opts.context },\n      cause: opts.cause,\n    });\n    this.name = 'ParseError';\n    this.source = opts.source;\n  }\n}\n\n// \u2500\u2500 Type guards \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\n\nexport function isWrongStackError(err: unknown): err is WrongStackError {\n  return err instanceof WrongStackError;\n}\n\nexport function isToolError(err: unknown): err is ToolError {\n  return err instanceof ToolError;\n}\n\nexport function isConfigError(err: unknown): err is ConfigError {\n  return err instanceof ConfigError;\n}\n\nexport function isPluginError(err: unknown): err is PluginError {\n  return err instanceof PluginError;\n}\n\nexport function isSessionError(err: unknown): err is SessionError {\n  return err instanceof SessionError;\n}\n\nexport function isAgentError(err: unknown): err is AgentError {\n  return err instanceof AgentError;\n}\n\nexport function isFsError(err: unknown): err is FsError {\n  return err instanceof FsError;\n}\n\nexport function isToolValidationError(err: unknown): err is ToolValidationError {\n  return err instanceof ToolValidationError;\n}\n\nexport function isFetchError(err: unknown): err is FetchError {\n  return err instanceof FetchError;\n}\n\nexport function isParseError(err: unknown): err is ParseError {\n  return err instanceof ParseError;\n}\n\nexport function isSddError(err: unknown): err is SddError {\n  return err instanceof SddError;\n}\n", "import type {\n  TaskFilter,\n  TaskGraph,\n  TaskNode,\n  TaskProgress,\n  TaskSort,\n} from '../types/task-graph.js';\nimport { computeTaskProgress } from '../types/task-graph.js';\nimport { ERROR_CODES, SddError } from '../types/errors.js';\nimport { toErrorMessage } from '../utils/error.js';\n\nexport interface TaskStore {\n  saveGraph(graph: TaskGraph): Promise<void>;\n  loadGraph(id: string): Promise<TaskGraph | null>;\n  listGraphs(): Promise<{ id: string; title: string; updatedAt: number }[]>;\n  deleteGraph(id: string): Promise<void>;\n}\n\nexport interface TaskTrackerOptions {\n  store: TaskStore;\n  /**\n   * Called when an in-the-background persistence (`saveGraph`) rejects.\n   * The synchronous TaskTracker methods (addNode/addEdge/updateNodeStatus)\n   * fire-and-forget their writes; without this, a failing store silently\n   * loses graph mutations. Defaults to a console.warn.\n   */\n  onPersistError?: (((err: unknown) => void)) | undefined;\n}\n\nexport interface TaskTransition {\n  from: TaskNode['status'];\n  to: TaskNode['status'];\n  timestamp: number;\n  reason?: string | undefined;\n}\n\n/** A change notification emitted to `TaskTracker.subscribe` listeners. */\nexport interface TaskTrackerChange {\n  type: 'node_added' | 'node_updated' | 'status_changed' | 'node_removed';\n  nodeId: string;\n  /** For `node_removed` this is the node as it was just before deletion. */\n  node: TaskNode;\n  transition?: TaskTransition | undefined;\n}\n\nexport type TaskTrackerListener = (change: TaskTrackerChange) => void;\n\nexport class TaskTracker {\n  private graph: TaskGraph | null = null;\n  private transitions: TaskTransition[] = [];\n  private listeners: TaskTrackerListener[] = [];\n\n  constructor(private readonly opts: TaskTrackerOptions) {}\n\n  /**\n   * Subscribe to live task mutations (add / update / status change). Returns an\n   * unsubscribe fn. This is the hook the board projector uses to stream a live\n   * snapshot \u2014 the tracker was previously fire-and-forget with no observability.\n   */\n  subscribe(listener: TaskTrackerListener): () => void {\n    this.listeners.push(listener);\n    return () => {\n      const i = this.listeners.indexOf(listener);\n      if (i >= 0) this.listeners.splice(i, 1);\n    };\n  }\n\n  private notifyChange(change: TaskTrackerChange): void {\n    for (const l of this.listeners) {\n      try {\n        l(change);\n      } catch {\n        // A faulty listener must never break a tracker mutation.\n      }\n    }\n  }\n\n  /**\n   * Attach an existing graph (used by PhaseOrchestrator to associate a tracker\n   * with a phase's pre-built task graph without re-creating it).\n   */\n  setGraph(graph: TaskGraph): void {\n    this.graph = graph;\n  }\n\n  async createGraph(specId: string, title: string): Promise<TaskGraph> {\n    this.graph = {\n      id: crypto.randomUUID(),\n      specId,\n      title,\n      nodes: new Map(),\n      edges: [],\n      rootNodes: [],\n      createdAt: Date.now(),\n      updatedAt: Date.now(),\n    };\n    await this.opts.store.saveGraph(this.graph);\n    return this.graph;\n  }\n\n  async loadGraph(id: string): Promise<TaskGraph | null> {\n    this.graph = await this.opts.store.loadGraph(id);\n    return this.graph;\n  }\n\n  addNode(node: Omit<TaskNode, 'id' | 'createdAt' | 'updatedAt'>): TaskNode {\n    if (!this.graph) throw new SddError({\n      message: 'No graph loaded',\n      code: ERROR_CODES.SDD_INVALID_STATE,\n    });\n\n    const now = Date.now();\n    const newNode: TaskNode = {\n      ...node,\n      id: crypto.randomUUID(),\n      status: node.status ?? 'pending',\n      createdAt: now,\n      updatedAt: now,\n    };\n\n    this.graph.nodes.set(newNode.id, newNode);\n\n    if (!node.parentId) {\n      this.graph.rootNodes.push(newNode.id);\n    }\n\n    this.graph.updatedAt = now;\n    this.persist();\n    this.notifyChange({ type: 'node_added', nodeId: newNode.id, node: newNode });\n\n    return newNode;\n  }\n\n  addEdge(from: string, to: string, type: TaskGraph['edges'][0]['type'] = 'depends_on'): void {\n    if (!this.graph) throw new SddError({\n      message: 'No graph loaded',\n      code: ERROR_CODES.SDD_INVALID_STATE,\n    });\n\n    this.graph.edges.push({\n      id: crypto.randomUUID(),\n      from,\n      to,\n      type,\n    });\n    this.graph.updatedAt = Date.now();\n    this.persist();\n  }\n\n  /**\n   * Declare that `taskId` depends on `depId` (a `depends_on` edge `depId \u2192 taskId`),\n   * guarding against self-loops, duplicates, missing nodes, and cycles. Returns\n   * true if the dependency now holds (added or already present), false if it was\n   * rejected (would create a cycle / unknown node). This is the safe entry point\n   * for wiring agent-declared `dependsOn` references into the graph.\n   */\n  addDependency(depId: string, taskId: string): boolean {\n    if (!this.graph) return false;\n    if (depId === taskId) return false;\n    if (!this.graph.nodes.has(depId) || !this.graph.nodes.has(taskId)) return false;\n    // Already a blocker \u2014 idempotent success.\n    if (this.getBlockers(taskId).includes(depId)) return true;\n    // Cycle guard: if `depId` already (transitively) depends on `taskId`, adding\n    // `taskId \u2192 depId` would close a loop. Reject rather than deadlock the run.\n    if (this.dependsOnTransitively(depId, taskId, new Set())) return false;\n    this.addEdge(depId, taskId, 'depends_on');\n    return true;\n  }\n\n  /** True when `taskId` transitively depends on `targetId` (follows depends_on blockers). */\n  private dependsOnTransitively(taskId: string, targetId: string, seen: Set<string>): boolean {\n    if (taskId === targetId) return true;\n    if (seen.has(taskId)) return false;\n    seen.add(taskId);\n    for (const blocker of this.getBlockers(taskId)) {\n      if (this.dependsOnTransitively(blocker, targetId, seen)) return true;\n    }\n    return false;\n  }\n\n  /**\n   * Merge `patch` into a node's `metadata` (used for per-task model/provider/\n   * fallback assignment and the cancel marker). Persists + notifies as a node\n   * update. No-op if the node is missing.\n   */\n  patchMetadata(id: string, patch: Record<string, unknown>): void {\n    if (!this.graph) return;\n    const node = this.graph.nodes.get(id);\n    if (!node) return;\n    node.metadata = { ...node.metadata, ...patch };\n    node.updatedAt = Date.now();\n    this.graph.updatedAt = node.updatedAt;\n    this.persist();\n    this.notifyChange({ type: 'node_updated', nodeId: id, node });\n  }\n\n  /**\n   * Remove a node and every edge touching it. Intended for deleting a task that\n   * has not started yet \u2014 callers must gate on status (do not remove a running\n   * task). Dependents simply lose this blocker (re-evaluated by `canStart`).\n   * Returns true if a node was removed.\n   */\n  removeNode(id: string): boolean {\n    if (!this.graph) return false;\n    const node = this.graph.nodes.get(id);\n    if (!node) return false;\n    this.graph.nodes.delete(id);\n    this.graph.edges = this.graph.edges.filter((e) => e.from !== id && e.to !== id);\n    this.graph.rootNodes = this.graph.rootNodes.filter((r) => r !== id);\n    // Detach from any parent's children list.\n    for (const n of this.graph.nodes.values()) {\n      if (n.children?.includes(id)) n.children = n.children.filter((c) => c !== id);\n    }\n    this.graph.updatedAt = Date.now();\n    this.persist();\n    this.notifyChange({ type: 'node_removed', nodeId: id, node });\n    return true;\n  }\n\n  updateNodeStatus(id: string, status: TaskNode['status'], reason?: string): void {\n    if (!this.graph) throw new SddError({\n      message: 'No graph loaded',\n      code: ERROR_CODES.SDD_INVALID_STATE,\n    });\n\n    const node = this.graph.nodes.get(id);\n    if (!node) throw new SddError({\n      message: `Node ${id} not found`,\n      code: ERROR_CODES.SDD_NOT_READY,\n      context: { nodeId: id },\n    });\n\n    const from = node.status;\n    const now = Date.now();\n    node.status = status;\n    node.updatedAt = now;\n\n    if (status === 'completed') {\n      node.completedAt = now;\n      node.startedAt = node.startedAt ?? now; // ensure startedAt is set\n    }\n    if (status === 'in_progress') {\n      node.startedAt = now;\n    }\n\n    this.transitions.push({ from, to: status, timestamp: now, reason });\n\n    // Auto-unblock dependents\n    if (status === 'completed') {\n      this.unblockDependents(id);\n    }\n\n    // Auto-block blockers\n    if (status === 'in_progress') {\n      this.checkAndBlockIfNeeded(id);\n    }\n\n    this.graph.updatedAt = now;\n    this.persist();\n    this.notifyChange({\n      type: 'status_changed',\n      nodeId: id,\n      node,\n      transition: { from, to: status, timestamp: now, reason },\n    });\n  }\n\n  updateNode(id: string, patch: Partial<Pick<TaskNode, 'title' | 'description' | 'priority' | 'estimateHours' | 'tags' | 'assignee'>>): void {\n    if (!this.graph) throw new SddError({\n      message: 'No graph loaded',\n      code: ERROR_CODES.SDD_INVALID_STATE,\n    });\n\n    const node = this.graph.nodes.get(id);\n    if (!node) throw new SddError({\n      message: `Node ${id} not found`,\n      code: ERROR_CODES.SDD_NOT_READY,\n      context: { nodeId: id },\n    });\n\n    if (patch.title !== undefined) node.title = patch.title;\n    if (patch.description !== undefined) node.description = patch.description;\n    if (patch.priority !== undefined) node.priority = patch.priority;\n    if (patch.estimateHours !== undefined) node.estimateHours = patch.estimateHours;\n    if (patch.tags !== undefined) node.tags = patch.tags;\n    if (patch.assignee !== undefined) node.assignee = patch.assignee;\n    node.updatedAt = Date.now();\n    this.graph.updatedAt = node.updatedAt;\n    this.persist();\n    this.notifyChange({ type: 'node_updated', nodeId: id, node });\n  }\n\n  getNode(id: string): TaskNode | undefined {\n    return this.graph?.nodes.get(id);\n  }\n\n  getAllNodes(filter?: TaskFilter, sort?: TaskSort): TaskNode[] {\n    if (!this.graph) return [];\n\n    let nodes = Array.from(this.graph.nodes.values());\n\n    if (filter) {\n      nodes = nodes.filter((n) => {\n        if (filter.status?.length && !filter.status.includes(n.status)) return false;\n        if (filter.priority?.length && !filter.priority.includes(n.priority)) return false;\n        if (filter.type?.length && !filter.type.includes(n.type)) return false;\n        if (filter.assignee?.length && n.assignee && !filter.assignee.includes(n.assignee))\n          return false;\n        if (filter.tags?.length && n.tags && !n.tags.some((t) => filter.tags?.includes(t)))\n          return false;\n        if (filter.specRequirementId && n.specRequirementId !== filter.specRequirementId)\n          return false;\n        return true;\n      });\n    }\n\n    if (sort) {\n      nodes.sort((a, b) => {\n        const cmp = compareByField(a, b, sort.field);\n        return sort.direction === 'asc' ? cmp : -cmp;\n      });\n    }\n\n    return nodes;\n  }\n\n  getChildren(parentId: string): TaskNode[] {\n    if (!this.graph) return [];\n    return Array.from(this.graph.nodes.values()).filter((n) => n.parentId === parentId);\n  }\n\n  getDependents(taskId: string): string[] {\n    if (!this.graph) return [];\n    return this.graph.edges\n      .filter((e) => e.from === taskId && e.type === 'depends_on')\n      .map((e) => e.to);\n  }\n\n  getBlockers(taskId: string): string[] {\n    if (!this.graph) return [];\n    return this.graph.edges\n      .filter((e) => e.to === taskId && e.type === 'depends_on')\n      .map((e) => e.from);\n  }\n\n  canStart(taskId: string): boolean {\n    const blockers = this.getBlockers(taskId);\n    return blockers.every((id) => {\n      const node = this.graph?.nodes.get(id);\n      // A task can start when all blockers are either completed or failed.\n      // Failed blockers should not permanently deadlock dependent tasks.\n      return node?.status === 'completed' || node?.status === 'failed';\n    });\n  }\n\n  getProgress(): TaskProgress {\n    if (!this.graph) {\n      return {\n        total: 0,\n        pending: 0,\n        inProgress: 0,\n        blocked: 0,\n        failed: 0,\n        review: 0,\n        completed: 0,\n        percentComplete: 0,\n        estimatedHours: 0,\n        actualHours: 0,\n      };\n    }\n    return computeTaskProgress(this.graph);\n  }\n\n  getTransitions(_taskId?: string): TaskTransition[] {\n    return [...this.transitions];\n  }\n\n  private unblockDependents(completedId: string): void {\n    if (!this.graph) return;\n    const dependents = this.getDependents(completedId);\n    for (const depId of dependents) {\n      const dep = this.graph.nodes.get(depId);\n      if (dep?.status === 'blocked') {\n        // Check if all blockers are now completed\n        const remainingBlockers = this.getBlockers(depId);\n        const allUnblocked = remainingBlockers.every((id) => {\n          const blocker = this.graph?.nodes.get(id);\n          return blocker?.status === 'completed' || blocker?.status === 'failed';\n        });\n        if (allUnblocked) {\n          dep.status = 'pending';\n          dep.updatedAt = Date.now();\n        }\n      }\n    }\n  }\n\n  private checkAndBlockIfNeeded(taskId: string): void {\n    if (!this.graph) return;\n    const blockers = this.getBlockers(taskId);\n    const someBlocked = blockers.some((id) => {\n      const blocker = this.graph?.nodes.get(id);\n      // A task is only blocked by incomplete blockers that haven't failed.\n      // Failed tasks should not block their dependents.\n      return blocker?.status !== 'completed' && blocker?.status !== 'failed';\n    });\n    if (someBlocked) {\n      const node = this.graph.nodes.get(taskId);\n      if (node) {\n        node.status = 'blocked';\n        node.updatedAt = Date.now();\n      }\n    }\n  }\n\n  /**\n   * Fire-and-forget persistence with attached error handler.\n   * Synchronous mutators (addNode/addEdge/updateNodeStatus) use this to\n   * avoid forcing an async cascade through every caller; if the store\n   * is missing or throwing, the error is surfaced via onPersistError.\n   */\n  private persist(): void {\n    if (!this.graph) return;\n    this.opts.store.saveGraph(this.graph).catch((err) => {\n      this.opts.onPersistError\n        ? this.opts.onPersistError(err)\n        : console.warn(JSON.stringify({\n            level: 'warn',\n            event: 'task_tracker.save_graph_failed',\n            message: toErrorMessage(err),\n            timestamp: new Date().toISOString(),\n          }));\n    });\n  }\n}\n\n// Sort comparison helpers\nconst PRIORITY_RANK: Record<TaskNode['priority'], number> = {\n  critical: 0,\n  high: 1,\n  medium: 2,\n  low: 3,\n};\nconst STATUS_RANK: Record<TaskNode['status'], number> = {\n  in_progress: 0,\n  pending: 1,\n  review: 2,\n  blocked: 3,\n  failed: 4,\n  completed: 5,\n};\n\nfunction compareByField(a: TaskNode, b: TaskNode, field: TaskSort['field']): number {\n  switch (field) {\n    case 'priority': return PRIORITY_RANK[a.priority] - PRIORITY_RANK[b.priority];\n    case 'status': return STATUS_RANK[a.status] - STATUS_RANK[b.status];\n    case 'createdAt': return a.createdAt - b.createdAt;\n    case 'updatedAt': return a.updatedAt - b.updatedAt;\n  }\n}\n"],
+  "mappings": ";AAUO,IAAM,mBAAN,MAA4C;AAAA,EAChC,SAAS,oBAAI,IAAuB;AAAA,EAErD,MAAM,UAAU,OAAiC;AAC/C,SAAK,OAAO,IAAI,MAAM,IAAI,KAAK,WAAW,KAAK,CAAC;AAAA,EAClD;AAAA,EAEA,MAAM,UAAU,IAAuC;AACrD,UAAM,QAAQ,KAAK,OAAO,IAAI,EAAE;AAChC,WAAO,QAAQ,KAAK,WAAW,KAAK,IAAI;AAAA,EAC1C;AAAA,EAEA,MAAM,aAA+E;AACnF,WAAO,MAAM,KAAK,KAAK,OAAO,OAAO,CAAC,EAAE,IAAI,CAAC,WAAW;AAAA,MACtD,IAAI,MAAM;AAAA,MACV,OAAO,MAAM;AAAA,MACb,WAAW,MAAM;AAAA,IACnB,EAAE;AAAA,EACJ;AAAA,EAEA,MAAM,YAAY,IAA2B;AAC3C,SAAK,OAAO,OAAO,EAAE;AAAA,EACvB;AAAA,EAEQ,WAAW,OAA6B;AAC9C,WAAO;AAAA,MACL,GAAG;AAAA,MACH,OAAO,IAAI,IAAI,MAAM,KAAK;AAAA,MAC1B,OAAO,CAAC,GAAG,MAAM,KAAK;AAAA,MACtB,WAAW,CAAC,GAAG,MAAM,SAAS;AAAA,IAChC;AAAA,EACF;AACF;;;AC+CO,SAAS,oBAAoB,OAAgC;AAClE,MAAI,YAAY;AAChB,MAAI,UAAU;AACd,MAAI,aAAa;AACjB,MAAI,UAAU;AACd,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,iBAAiB;AACrB,MAAI,cAAc;AAClB,aAAW,KAAK,MAAM,MAAM,OAAO,GAAG;AACpC,YAAQ,EAAE,QAAQ;AAAA,MAChB,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,MACF,KAAK;AACH;AACA;AAAA,IACJ;AACA,sBAAkB,EAAE,iBAAiB;AACrC,mBAAe,EAAE,eAAe;AAAA,EAClC;AACA,QAAM,QAAQ,MAAM,MAAM;AAE1B,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB,QAAQ,IAAI,KAAK,MAAO,YAAY,QAAS,GAAG,IAAI;AAAA,IACrE;AAAA,IACA;AAAA,EACF;AACF;;;ACpIO,SAAS,eAAe,KAAsB;AACnD,SAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AACxD;;;ACkBO,IAAM,cAAc;AAAA;AAAA,EAEzB,uBAAuB;AAAA,EACvB,sBAAsB;AAAA,EACtB,qBAAqB;AAAA,EACrB,0BAA0B;AAAA,EAC1B,uBAAuB;AAAA,EACvB,wBAAwB;AAAA,EACxB,2BAA2B;AAAA;AAAA,EAE3B,gBAAgB;AAAA,EAChB,wBAAwB;AAAA,EACxB,uBAAuB;AAAA,EACvB,cAAc;AAAA,EACd,oBAAoB;AAAA;AAAA,EAEpB,gBAAgB;AAAA,EAChB,kBAAkB;AAAA,EAClB,qBAAqB;AAAA,EACrB,yBAAyB;AAAA;AAAA,EAEzB,oBAAoB;AAAA,EACpB,qBAAqB;AAAA,EACrB,2BAA2B;AAAA;AAAA,EAE3B,uBAAuB;AAAA,EACvB,wBAAwB;AAAA,EACxB,eAAe;AAAA,EACf,kBAAkB;AAAA;AAAA,EAElB,mBAAmB;AAAA,EACnB,mBAAmB;AAAA,EACnB,sBAAsB;AAAA;AAAA,EAEtB,+BAA+B;AAAA,EAC/B,2BAA2B;AAAA,EAC3B,+BAA+B;AAAA,EAC/B,oBAAoB;AAAA,EACpB,oBAAoB;AAAA,EACpB,kBAAkB;AAAA;AAAA,EAElB,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,iBAAiB;AAAA,EACjB,kBAAkB;AAAA,EAClB,wBAAwB;AAAA;AAAA,EAExB,uBAAuB;AAAA,EACvB,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,eAAe;AAAA;AAAA,EAEf,kBAAkB;AAAA,EAClB,cAAc;AAAA,EACd,SAAS;AACX;AAwBO,IAAM,kBAAN,cAA8B,MAAM;AAAA,EAChC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,MAQT;AACD,UAAM,KAAK,SAAS,EAAE,OAAO,KAAK,MAAM,CAAC;AACzC,SAAK,OAAO;AACZ,SAAK,OAAO,KAAK;AACjB,SAAK,YAAY,KAAK;AACtB,SAAK,WAAW,KAAK,YAAY;AACjC,SAAK,cAAc,KAAK,eAAe;AACvC,SAAK,UAAU,KAAK;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAmB;AACjB,UAAM,MAAM,KAAK,UAAU,IAAI,cAAc,KAAK,OAAO,CAAC,KAAK;AAC/D,WAAO,GAAG,KAAK,IAAI,KAAK,KAAK,OAAO,GAAG,GAAG;AAAA,EAC5C;AACF;AAEA,SAAS,cAAc,KAAsC;AAC3D,QAAM,QAAQ,OAAO,QAAQ,GAAG,EAC7B,OAAO,CAAC,CAAC,EAAE,CAAC,MAAM,MAAM,MAAS,EACjC,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE;AACtC,SAAO,MAAM,SAAS,IAAI,IAAI,MAAM,KAAK,GAAG,CAAC,MAAM;AACrD;AA4KO,IAAM,WAAN,cAAuB,gBAAgB;AAAA,EAC5C,YAAY,MAQT;AACD,UAAM;AAAA,MACJ,SAAS,KAAK;AAAA,MACd,MAAM,KAAK;AAAA,MACX,WAAW;AAAA,MACX,UAAU,KAAK,SAAS,YAAY,mBAAmB,YAAY;AAAA,MACnE,aAAa,KAAK,SAAS,YAAY;AAAA,MACvC,SAAS,KAAK;AAAA,MACd,OAAO,KAAK;AAAA,IACd,CAAC;AACD,SAAK,OAAO;AAAA,EACd;AACF;;;AClSO,IAAM,cAAN,MAAkB;AAAA,EAKvB,YAA6B,MAA0B;AAA1B;AAAA,EAA2B;AAAA,EAA3B;AAAA,EAJrB,QAA0B;AAAA,EAC1B,cAAgC,CAAC;AAAA,EACjC,YAAmC,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAS5C,UAAU,UAA2C;AACnD,SAAK,UAAU,KAAK,QAAQ;AAC5B,WAAO,MAAM;AACX,YAAM,IAAI,KAAK,UAAU,QAAQ,QAAQ;AACzC,UAAI,KAAK,EAAG,MAAK,UAAU,OAAO,GAAG,CAAC;AAAA,IACxC;AAAA,EACF;AAAA,EAEQ,aAAa,QAAiC;AACpD,eAAW,KAAK,KAAK,WAAW;AAC9B,UAAI;AACF,UAAE,MAAM;AAAA,MACV,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,OAAwB;AAC/B,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,MAAM,YAAY,QAAgB,OAAmC;AACnE,SAAK,QAAQ;AAAA,MACX,IAAI,OAAO,WAAW;AAAA,MACtB;AAAA,MACA;AAAA,MACA,OAAO,oBAAI,IAAI;AAAA,MACf,OAAO,CAAC;AAAA,MACR,WAAW,CAAC;AAAA,MACZ,WAAW,KAAK,IAAI;AAAA,MACpB,WAAW,KAAK,IAAI;AAAA,IACtB;AACA,UAAM,KAAK,KAAK,MAAM,UAAU,KAAK,KAAK;AAC1C,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAM,UAAU,IAAuC;AACrD,SAAK,QAAQ,MAAM,KAAK,KAAK,MAAM,UAAU,EAAE;AAC/C,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,QAAQ,MAAkE;AACxE,QAAI,CAAC,KAAK,MAAO,OAAM,IAAI,SAAS;AAAA,MAClC,SAAS;AAAA,MACT,MAAM,YAAY;AAAA,IACpB,CAAC;AAED,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,UAAoB;AAAA,MACxB,GAAG;AAAA,MACH,IAAI,OAAO,WAAW;AAAA,MACtB,QAAQ,KAAK,UAAU;AAAA,MACvB,WAAW;AAAA,MACX,WAAW;AAAA,IACb;AAEA,SAAK,MAAM,MAAM,IAAI,QAAQ,IAAI,OAAO;AAExC,QAAI,CAAC,KAAK,UAAU;AAClB,WAAK,MAAM,UAAU,KAAK,QAAQ,EAAE;AAAA,IACtC;AAEA,SAAK,MAAM,YAAY;AACvB,SAAK,QAAQ;AACb,SAAK,aAAa,EAAE,MAAM,cAAc,QAAQ,QAAQ,IAAI,MAAM,QAAQ,CAAC;AAE3E,WAAO;AAAA,EACT;AAAA,EAEA,QAAQ,MAAc,IAAY,OAAsC,cAAoB;AAC1F,QAAI,CAAC,KAAK,MAAO,OAAM,IAAI,SAAS;AAAA,MAClC,SAAS;AAAA,MACT,MAAM,YAAY;AAAA,IACpB,CAAC;AAED,SAAK,MAAM,MAAM,KAAK;AAAA,MACpB,IAAI,OAAO,WAAW;AAAA,MACtB;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AACD,SAAK,MAAM,YAAY,KAAK,IAAI;AAChC,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,cAAc,OAAe,QAAyB;AACpD,QAAI,CAAC,KAAK,MAAO,QAAO;AACxB,QAAI,UAAU,OAAQ,QAAO;AAC7B,QAAI,CAAC,KAAK,MAAM,MAAM,IAAI,KAAK,KAAK,CAAC,KAAK,MAAM,MAAM,IAAI,MAAM,EAAG,QAAO;AAE1E,QAAI,KAAK,YAAY,MAAM,EAAE,SAAS,KAAK,EAAG,QAAO;AAGrD,QAAI,KAAK,sBAAsB,OAAO,QAAQ,oBAAI,IAAI,CAAC,EAAG,QAAO;AACjE,SAAK,QAAQ,OAAO,QAAQ,YAAY;AACxC,WAAO;AAAA,EACT;AAAA;AAAA,EAGQ,sBAAsB,QAAgB,UAAkB,MAA4B;AAC1F,QAAI,WAAW,SAAU,QAAO;AAChC,QAAI,KAAK,IAAI,MAAM,EAAG,QAAO;AAC7B,SAAK,IAAI,MAAM;AACf,eAAW,WAAW,KAAK,YAAY,MAAM,GAAG;AAC9C,UAAI,KAAK,sBAAsB,SAAS,UAAU,IAAI,EAAG,QAAO;AAAA,IAClE;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAc,IAAY,OAAsC;AAC9D,QAAI,CAAC,KAAK,MAAO;AACjB,UAAM,OAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AACpC,QAAI,CAAC,KAAM;AACX,SAAK,WAAW,EAAE,GAAG,KAAK,UAAU,GAAG,MAAM;AAC7C,SAAK,YAAY,KAAK,IAAI;AAC1B,SAAK,MAAM,YAAY,KAAK;AAC5B,SAAK,QAAQ;AACb,SAAK,aAAa,EAAE,MAAM,gBAAgB,QAAQ,IAAI,KAAK,CAAC;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,WAAW,IAAqB;AAC9B,QAAI,CAAC,KAAK,MAAO,QAAO;AACxB,UAAM,OAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AACpC,QAAI,CAAC,KAAM,QAAO;AAClB,SAAK,MAAM,MAAM,OAAO,EAAE;AAC1B,SAAK,MAAM,QAAQ,KAAK,MAAM,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,OAAO,EAAE;AAC9E,SAAK,MAAM,YAAY,KAAK,MAAM,UAAU,OAAO,CAAC,MAAM,MAAM,EAAE;AAElE,eAAW,KAAK,KAAK,MAAM,MAAM,OAAO,GAAG;AACzC,UAAI,EAAE,UAAU,SAAS,EAAE,EAAG,GAAE,WAAW,EAAE,SAAS,OAAO,CAAC,MAAM,MAAM,EAAE;AAAA,IAC9E;AACA,SAAK,MAAM,YAAY,KAAK,IAAI;AAChC,SAAK,QAAQ;AACb,SAAK,aAAa,EAAE,MAAM,gBAAgB,QAAQ,IAAI,KAAK,CAAC;AAC5D,WAAO;AAAA,EACT;AAAA,EAEA,iBAAiB,IAAY,QAA4B,QAAuB;AAC9E,QAAI,CAAC,KAAK,MAAO,OAAM,IAAI,SAAS;AAAA,MAClC,SAAS;AAAA,MACT,MAAM,YAAY;AAAA,IACpB,CAAC;AAED,UAAM,OAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AACpC,QAAI,CAAC,KAAM,OAAM,IAAI,SAAS;AAAA,MAC5B,SAAS,QAAQ,EAAE;AAAA,MACnB,MAAM,YAAY;AAAA,MAClB,SAAS,EAAE,QAAQ,GAAG;AAAA,IACxB,CAAC;AAED,UAAM,OAAO,KAAK;AAClB,UAAM,MAAM,KAAK,IAAI;AACrB,SAAK,SAAS;AACd,SAAK,YAAY;AAEjB,QAAI,WAAW,aAAa;AAC1B,WAAK,cAAc;AACnB,WAAK,YAAY,KAAK,aAAa;AAAA,IACrC;AACA,QAAI,WAAW,eAAe;AAC5B,WAAK,YAAY;AAAA,IACnB;AAEA,SAAK,YAAY,KAAK,EAAE,MAAM,IAAI,QAAQ,WAAW,KAAK,OAAO,CAAC;AAGlE,QAAI,WAAW,aAAa;AAC1B,WAAK,kBAAkB,EAAE;AAAA,IAC3B;AAGA,QAAI,WAAW,eAAe;AAC5B,WAAK,sBAAsB,EAAE;AAAA,IAC/B;AAEA,SAAK,MAAM,YAAY;AACvB,SAAK,QAAQ;AACb,SAAK,aAAa;AAAA,MAChB,MAAM;AAAA,MACN,QAAQ;AAAA,MACR;AAAA,MACA,YAAY,EAAE,MAAM,IAAI,QAAQ,WAAW,KAAK,OAAO;AAAA,IACzD,CAAC;AAAA,EACH;AAAA,EAEA,WAAW,IAAY,OAAoH;AACzI,QAAI,CAAC,KAAK,MAAO,OAAM,IAAI,SAAS;AAAA,MAClC,SAAS;AAAA,MACT,MAAM,YAAY;AAAA,IACpB,CAAC;AAED,UAAM,OAAO,KAAK,MAAM,MAAM,IAAI,EAAE;AACpC,QAAI,CAAC,KAAM,OAAM,IAAI,SAAS;AAAA,MAC5B,SAAS,QAAQ,EAAE;AAAA,MACnB,MAAM,YAAY;AAAA,MAClB,SAAS,EAAE,QAAQ,GAAG;AAAA,IACxB,CAAC;AAED,QAAI,MAAM,UAAU,OAAW,MAAK,QAAQ,MAAM;AAClD,QAAI,MAAM,gBAAgB,OAAW,MAAK,cAAc,MAAM;AAC9D,QAAI,MAAM,aAAa,OAAW,MAAK,WAAW,MAAM;AACxD,QAAI,MAAM,kBAAkB,OAAW,MAAK,gBAAgB,MAAM;AAClE,QAAI,MAAM,SAAS,OAAW,MAAK,OAAO,MAAM;AAChD,QAAI,MAAM,aAAa,OAAW,MAAK,WAAW,MAAM;AACxD,SAAK,YAAY,KAAK,IAAI;AAC1B,SAAK,MAAM,YAAY,KAAK;AAC5B,SAAK,QAAQ;AACb,SAAK,aAAa,EAAE,MAAM,gBAAgB,QAAQ,IAAI,KAAK,CAAC;AAAA,EAC9D;AAAA,EAEA,QAAQ,IAAkC;AACxC,WAAO,KAAK,OAAO,MAAM,IAAI,EAAE;AAAA,EACjC;AAAA,EAEA,YAAY,QAAqB,MAA6B;AAC5D,QAAI,CAAC,KAAK,MAAO,QAAO,CAAC;AAEzB,QAAI,QAAQ,MAAM,KAAK,KAAK,MAAM,MAAM,OAAO,CAAC;AAEhD,QAAI,QAAQ;AACV,cAAQ,MAAM,OAAO,CAAC,MAAM;AAC1B,YAAI,OAAO,QAAQ,UAAU,CAAC,OAAO,OAAO,SAAS,EAAE,MAAM,EAAG,QAAO;AACvE,YAAI,OAAO,UAAU,UAAU,CAAC,OAAO,SAAS,SAAS,EAAE,QAAQ,EAAG,QAAO;AAC7E,YAAI,OAAO,MAAM,UAAU,CAAC,OAAO,KAAK,SAAS,EAAE,IAAI,EAAG,QAAO;AACjE,YAAI,OAAO,UAAU,UAAU,EAAE,YAAY,CAAC,OAAO,SAAS,SAAS,EAAE,QAAQ;AAC/E,iBAAO;AACT,YAAI,OAAO,MAAM,UAAU,EAAE,QAAQ,CAAC,EAAE,KAAK,KAAK,CAAC,MAAM,OAAO,MAAM,SAAS,CAAC,CAAC;AAC/E,iBAAO;AACT,YAAI,OAAO,qBAAqB,EAAE,sBAAsB,OAAO;AAC7D,iBAAO;AACT,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAEA,QAAI,MAAM;AACR,YAAM,KAAK,CAAC,GAAG,MAAM;AACnB,cAAM,MAAM,eAAe,GAAG,GAAG,KAAK,KAAK;AAC3C,eAAO,KAAK,cAAc,QAAQ,MAAM,CAAC;AAAA,MAC3C,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,YAAY,UAA8B;AACxC,QAAI,CAAC,KAAK,MAAO,QAAO,CAAC;AACzB,WAAO,MAAM,KAAK,KAAK,MAAM,MAAM,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ;AAAA,EACpF;AAAA,EAEA,cAAc,QAA0B;AACtC,QAAI,CAAC,KAAK,MAAO,QAAO,CAAC;AACzB,WAAO,KAAK,MAAM,MACf,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE,SAAS,YAAY,EAC1D,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,EACpB;AAAA,EAEA,YAAY,QAA0B;AACpC,QAAI,CAAC,KAAK,MAAO,QAAO,CAAC;AACzB,WAAO,KAAK,MAAM,MACf,OAAO,CAAC,MAAM,EAAE,OAAO,UAAU,EAAE,SAAS,YAAY,EACxD,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,EACtB;AAAA,EAEA,SAAS,QAAyB;AAChC,UAAM,WAAW,KAAK,YAAY,MAAM;AACxC,WAAO,SAAS,MAAM,CAAC,OAAO;AAC5B,YAAM,OAAO,KAAK,OAAO,MAAM,IAAI,EAAE;AAGrC,aAAO,MAAM,WAAW,eAAe,MAAM,WAAW;AAAA,IAC1D,CAAC;AAAA,EACH;AAAA,EAEA,cAA4B;AAC1B,QAAI,CAAC,KAAK,OAAO;AACf,aAAO;AAAA,QACL,OAAO;AAAA,QACP,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,iBAAiB;AAAA,QACjB,gBAAgB;AAAA,QAChB,aAAa;AAAA,MACf;AAAA,IACF;AACA,WAAO,oBAAoB,KAAK,KAAK;AAAA,EACvC;AAAA,EAEA,eAAe,SAAoC;AACjD,WAAO,CAAC,GAAG,KAAK,WAAW;AAAA,EAC7B;AAAA,EAEQ,kBAAkB,aAA2B;AACnD,QAAI,CAAC,KAAK,MAAO;AACjB,UAAM,aAAa,KAAK,cAAc,WAAW;AACjD,eAAW,SAAS,YAAY;AAC9B,YAAM,MAAM,KAAK,MAAM,MAAM,IAAI,KAAK;AACtC,UAAI,KAAK,WAAW,WAAW;AAE7B,cAAM,oBAAoB,KAAK,YAAY,KAAK;AAChD,cAAM,eAAe,kBAAkB,MAAM,CAAC,OAAO;AACnD,gBAAM,UAAU,KAAK,OAAO,MAAM,IAAI,EAAE;AACxC,iBAAO,SAAS,WAAW,eAAe,SAAS,WAAW;AAAA,QAChE,CAAC;AACD,YAAI,cAAc;AAChB,cAAI,SAAS;AACb,cAAI,YAAY,KAAK,IAAI;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,sBAAsB,QAAsB;AAClD,QAAI,CAAC,KAAK,MAAO;AACjB,UAAM,WAAW,KAAK,YAAY,MAAM;AACxC,UAAM,cAAc,SAAS,KAAK,CAAC,OAAO;AACxC,YAAM,UAAU,KAAK,OAAO,MAAM,IAAI,EAAE;AAGxC,aAAO,SAAS,WAAW,eAAe,SAAS,WAAW;AAAA,IAChE,CAAC;AACD,QAAI,aAAa;AACf,YAAM,OAAO,KAAK,MAAM,MAAM,IAAI,MAAM;AACxC,UAAI,MAAM;AACR,aAAK,SAAS;AACd,aAAK,YAAY,KAAK,IAAI;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,UAAgB;AACtB,QAAI,CAAC,KAAK,MAAO;AACjB,SAAK,KAAK,MAAM,UAAU,KAAK,KAAK,EAAE,MAAM,CAAC,QAAQ;AACnD,WAAK,KAAK,iBACN,KAAK,KAAK,eAAe,GAAG,IAC5B,QAAQ,KAAK,KAAK,UAAU;AAAA,QAC1B,OAAO;AAAA,QACP,OAAO;AAAA,QACP,SAAS,eAAe,GAAG;AAAA,QAC3B,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MACpC,CAAC,CAAC;AAAA,IACR,CAAC;AAAA,EACH;AACF;AAGA,IAAM,gBAAsD;AAAA,EAC1D,UAAU;AAAA,EACV,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,KAAK;AACP;AACA,IAAM,cAAkD;AAAA,EACtD,aAAa;AAAA,EACb,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,WAAW;AACb;AAEA,SAAS,eAAe,GAAa,GAAa,OAAkC;AAClF,UAAQ,OAAO;AAAA,IACb,KAAK;AAAY,aAAO,cAAc,EAAE,QAAQ,IAAI,cAAc,EAAE,QAAQ;AAAA,IAC5E,KAAK;AAAU,aAAO,YAAY,EAAE,MAAM,IAAI,YAAY,EAAE,MAAM;AAAA,IAClE,KAAK;AAAa,aAAO,EAAE,YAAY,EAAE;AAAA,IACzC,KAAK;AAAa,aAAO,EAAE,YAAY,EAAE;AAAA,EAC3C;AACF;",
+  "names": []
+}

package/dist/tasking/task-store.d.ts

@@ -0,0 +1,22 @@
+import type { TaskGraph } from '../types/task-graph.js';
+import type { TaskStore } from './task-tracker.js';
+/**
+ * In-memory task-graph store used by AutoPhase and tests.
+ *
+ * The store clones the graph container on read/write so callers cannot replace
+ * its Maps/arrays behind the store's back. Task nodes themselves intentionally
+ * remain shared: TaskTracker owns node mutation and persists after each change.
+ */
+export declare class DefaultTaskStore implements TaskStore {
+    private readonly graphs;
+    saveGraph(graph: TaskGraph): Promise<void>;
+    loadGraph(id: string): Promise<TaskGraph | null>;
+    listGraphs(): Promise<Array<{
+        id: string;
+        title: string;
+        updatedAt: number;
+    }>>;
+    deleteGraph(id: string): Promise<void>;
+    private cloneGraph;
+}
+//# sourceMappingURL=task-store.d.ts.map

package/dist/tasking/task-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-store.d.ts","sourceRoot":"","sources":["../../src/tasking/task-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAEnD;;;;;;GAMG;AACH,qBAAa,gBAAiB,YAAW,SAAS;IAChD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAgC;IAEjD,SAAS,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAE/C;IAEK,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,CAGrD;IAEK,UAAU,IAAI,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAMnF;IAEK,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAE3C;IAED,OAAO,CAAC,UAAU;CAQnB"}

package/dist/tasking/task-tracker.d.ts

@@ -0,0 +1,102 @@
+import type { TaskFilter, TaskGraph, TaskNode, TaskProgress, TaskSort } from '../types/task-graph.js';
+export interface TaskStore {
+    saveGraph(graph: TaskGraph): Promise<void>;
+    loadGraph(id: string): Promise<TaskGraph | null>;
+    listGraphs(): Promise<{
+        id: string;
+        title: string;
+        updatedAt: number;
+    }[]>;
+    deleteGraph(id: string): Promise<void>;
+}
+export interface TaskTrackerOptions {
+    store: TaskStore;
+    /**
+     * Called when an in-the-background persistence (`saveGraph`) rejects.
+     * The synchronous TaskTracker methods (addNode/addEdge/updateNodeStatus)
+     * fire-and-forget their writes; without this, a failing store silently
+     * loses graph mutations. Defaults to a console.warn.
+     */
+    onPersistError?: (((err: unknown) => void)) | undefined;
+}
+export interface TaskTransition {
+    from: TaskNode['status'];
+    to: TaskNode['status'];
+    timestamp: number;
+    reason?: string | undefined;
+}
+/** A change notification emitted to `TaskTracker.subscribe` listeners. */
+export interface TaskTrackerChange {
+    type: 'node_added' | 'node_updated' | 'status_changed' | 'node_removed';
+    nodeId: string;
+    /** For `node_removed` this is the node as it was just before deletion. */
+    node: TaskNode;
+    transition?: TaskTransition | undefined;
+}
+export type TaskTrackerListener = (change: TaskTrackerChange) => void;
+export declare class TaskTracker {
+    private readonly opts;
+    private graph;
+    private transitions;
+    private listeners;
+    constructor(opts: TaskTrackerOptions);
+    /**
+     * Subscribe to live task mutations (add / update / status change). Returns an
+     * unsubscribe fn. This is the hook the board projector uses to stream a live
+     * snapshot — the tracker was previously fire-and-forget with no observability.
+     */
+    subscribe(listener: TaskTrackerListener): () => void;
+    private notifyChange;
+    /**
+     * Attach an existing graph (used by PhaseOrchestrator to associate a tracker
+     * with a phase's pre-built task graph without re-creating it).
+     */
+    setGraph(graph: TaskGraph): void;
+    createGraph(specId: string, title: string): Promise<TaskGraph>;
+    loadGraph(id: string): Promise<TaskGraph | null>;
+    addNode(node: Omit<TaskNode, 'id' | 'createdAt' | 'updatedAt'>): TaskNode;
+    addEdge(from: string, to: string, type?: TaskGraph['edges'][0]['type']): void;
+    /**
+     * Declare that `taskId` depends on `depId` (a `depends_on` edge `depId → taskId`),
+     * guarding against self-loops, duplicates, missing nodes, and cycles. Returns
+     * true if the dependency now holds (added or already present), false if it was
+     * rejected (would create a cycle / unknown node). This is the safe entry point
+     * for wiring agent-declared `dependsOn` references into the graph.
+     */
+    addDependency(depId: string, taskId: string): boolean;
+    /** True when `taskId` transitively depends on `targetId` (follows depends_on blockers). */
+    private dependsOnTransitively;
+    /**
+     * Merge `patch` into a node's `metadata` (used for per-task model/provider/
+     * fallback assignment and the cancel marker). Persists + notifies as a node
+     * update. No-op if the node is missing.
+     */
+    patchMetadata(id: string, patch: Record<string, unknown>): void;
+    /**
+     * Remove a node and every edge touching it. Intended for deleting a task that
+     * has not started yet — callers must gate on status (do not remove a running
+     * task). Dependents simply lose this blocker (re-evaluated by `canStart`).
+     * Returns true if a node was removed.
+     */
+    removeNode(id: string): boolean;
+    updateNodeStatus(id: string, status: TaskNode['status'], reason?: string): void;
+    updateNode(id: string, patch: Partial<Pick<TaskNode, 'title' | 'description' | 'priority' | 'estimateHours' | 'tags' | 'assignee'>>): void;
+    getNode(id: string): TaskNode | undefined;
+    getAllNodes(filter?: TaskFilter, sort?: TaskSort): TaskNode[];
+    getChildren(parentId: string): TaskNode[];
+    getDependents(taskId: string): string[];
+    getBlockers(taskId: string): string[];
+    canStart(taskId: string): boolean;
+    getProgress(): TaskProgress;
+    getTransitions(_taskId?: string): TaskTransition[];
+    private unblockDependents;
+    private checkAndBlockIfNeeded;
+    /**
+     * Fire-and-forget persistence with attached error handler.
+     * Synchronous mutators (addNode/addEdge/updateNodeStatus) use this to
+     * avoid forcing an async cascade through every caller; if the store
+     * is missing or throwing, the error is surfaced via onPersistError.
+     */
+    private persist;
+}
+//# sourceMappingURL=task-tracker.d.ts.map

package/dist/tasking/task-tracker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-tracker.d.ts","sourceRoot":"","sources":["../../src/tasking/task-tracker.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,UAAU,EACV,SAAS,EACT,QAAQ,EACR,YAAY,EACZ,QAAQ,EACT,MAAM,wBAAwB,CAAC;AAKhC,MAAM,WAAW,SAAS;IACxB,SAAS,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3C,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC;IACjD,UAAU,IAAI,OAAO,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC,CAAC;IAC1E,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACxC;AAED,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,SAAS,CAAC;IACjB;;;;;OAKG;IACH,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,OAAO,KAAK,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;CACzD;AAED,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACzB,EAAE,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAC7B;AAED,0EAA0E;AAC1E,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,YAAY,GAAG,cAAc,GAAG,gBAAgB,GAAG,cAAc,CAAC;IACxE,MAAM,EAAE,MAAM,CAAC;IACf,0EAA0E;IAC1E,IAAI,EAAE,QAAQ,CAAC;IACf,UAAU,CAAC,EAAE,cAAc,GAAG,SAAS,CAAC;CACzC;AAED,MAAM,MAAM,mBAAmB,GAAG,CAAC,MAAM,EAAE,iBAAiB,KAAK,IAAI,CAAC;AAEtE,qBAAa,WAAW;IAKV,OAAO,CAAC,QAAQ,CAAC,IAAI;IAJjC,OAAO,CAAC,KAAK,CAA0B;IACvC,OAAO,CAAC,WAAW,CAAwB;IAC3C,OAAO,CAAC,SAAS,CAA6B;IAE9C,YAA6B,IAAI,EAAE,kBAAkB,EAAI;IAEzD;;;;OAIG;IACH,SAAS,CAAC,QAAQ,EAAE,mBAAmB,GAAG,MAAM,IAAI,CAMnD;IAED,OAAO,CAAC,YAAY;IAUpB;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI,CAE/B;IAEK,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,CAanE;IAEK,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,CAGrD;IAED,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,GAAG,WAAW,GAAG,WAAW,CAAC,GAAG,QAAQ,CA0BxE;IAED,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,GAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAgB,GAAG,IAAI,CAc1F;IAED;;;;;;OAMG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAWpD;IAED,2FAA2F;IAC3F,OAAO,CAAC,qBAAqB;IAU7B;;;;OAIG;IACH,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAS9D;IAED;;;;;OAKG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAe9B;IAED,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CA8C9E;IAED,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,GAAG,aAAa,GAAG,UAAU,GAAG,eAAe,GAAG,MAAM,GAAG,UAAU,CAAC,CAAC,GAAG,IAAI,CAuBzI;IAED,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS,CAExC;IAED,WAAW,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE,QAAQ,GAAG,QAAQ,EAAE,CA4B5D;IAED,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,QAAQ,EAAE,CAGxC;IAED,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAKtC;IAED,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAKpC;IAED,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAQhC;IAED,WAAW,IAAI,YAAY,CAgB1B;IAED,cAAc,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,cAAc,EAAE,CAEjD;IAED,OAAO,CAAC,iBAAiB;IAoBzB,OAAO,CAAC,qBAAqB;IAkB7B;;;;;OAKG;IACH,OAAO,CAAC,OAAO;CAahB"}

package/dist/tools/index.d.ts

@@ -1,59 +1,2 @@
-import { g as Tool } from '../tool-BNlnIJvo.js';
-import { b as MCPServerConfig, j as Config } from '../config-MRqn1V-u.js';
-import '../dispatcher-types.d-BBeXBQgS.js';
-import 'node:https';
-import 'undici';
-
-interface MCPRegistryHandle {
-    start(cfg: MCPServerConfig): Promise<void>;
-    stop(name: string): Promise<void>;
-    restart(name: string): Promise<void>;
-    describe(): {
-        name: string;
-        state: string;
-        toolCount: number;
-        enabled: boolean;
-        tools?: string[];
-    }[];
-    list(): {
-        name: string;
-        state: string;
-        toolCount: number;
-        tools?: string[];
-    }[];
-    /**
-     * Register all cached tools for a server without restarting it.
-     * No-op if the server is not connected or tools are already active.
-     * Used in token-saving mode to temporarily expose MCP tools.
-     */
-    activateServer?(name: string): void;
-    /**
-     * Unregister all tools for a server without disconnecting it.
-     * Returns the number of tools that were deactivated.
-     * Used in token-saving mode to hide MCP tools after use.
-     */
-    deactivateServer?(name: string): number;
-    /**
-     * Check whether a server's tools are currently registered.
-     */
-    isActivated?(name: string): boolean;
-}
-interface CreateMcpControlToolOptions {
-    /**
-     * Read the current config object. The tool never mutates this directly —
-     * writes go to the global config file via `configPath`.
-     */
-    getConfig: () => Config;
-    /**
-     * Path to ~/.wrongstack/config.json (or equivalent) for atomic config writes.
-     */
-    configPath: string;
-    /**
-     * Live MCP registry for runtime start/stop/restart. The tool calls these
-     * immediately so the LLM sees the result of its action in the same turn.
-     */
-    registry: MCPRegistryHandle;
-}
-declare function createMcpControlTool(opts: CreateMcpControlToolOptions): Tool;
-
-export { type MCPRegistryHandle, createMcpControlTool };
+export { createMcpControlTool, type MCPRegistryHandle } from './mcp-control.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/tools/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/tools/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,KAAK,iBAAiB,EAAE,MAAM,kBAAkB,CAAC"}