@stackmemoryai/stackmemory 0.3.0 → 0.3.3

package/dist/core/errors/index.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/core/errors/index.ts"],
-  "sourcesContent": ["/**\n * Custom error classes for StackMemory\n * Provides a hierarchy of error types for better error handling and debugging\n */\n\nexport enum ErrorCode {\n  // Database errors (1000-1999)\n  DB_CONNECTION_FAILED = 'DB_001',\n  DB_QUERY_FAILED = 'DB_002',\n  DB_TRANSACTION_FAILED = 'DB_003',\n  DB_MIGRATION_FAILED = 'DB_004',\n  DB_CONSTRAINT_VIOLATION = 'DB_005',\n  DB_SCHEMA_ERROR = 'DB_006',\n  DB_INSERT_FAILED = 'DB_007',\n  DB_UPDATE_FAILED = 'DB_008',\n  DB_DELETE_FAILED = 'DB_009',\n\n  // Frame errors (2000-2999)\n  FRAME_NOT_FOUND = 'FRAME_001',\n  FRAME_INVALID_STATE = 'FRAME_002',\n  FRAME_PARENT_NOT_FOUND = 'FRAME_003',\n  FRAME_CYCLE_DETECTED = 'FRAME_004',\n  FRAME_ALREADY_CLOSED = 'FRAME_005',\n  FRAME_INIT_FAILED = 'FRAME_006',\n  FRAME_INVALID_INPUT = 'FRAME_007',\n  FRAME_STACK_OVERFLOW = 'FRAME_008',\n\n  // Task errors (3000-3999)\n  TASK_NOT_FOUND = 'TASK_001',\n  TASK_INVALID_STATE = 'TASK_002',\n  TASK_DEPENDENCY_CONFLICT = 'TASK_003',\n  TASK_CIRCULAR_DEPENDENCY = 'TASK_004',\n\n  // Integration errors (4000-4999)\n  LINEAR_AUTH_FAILED = 'LINEAR_001',\n  LINEAR_API_ERROR = 'LINEAR_002',\n  LINEAR_SYNC_FAILED = 'LINEAR_003',\n  LINEAR_WEBHOOK_FAILED = 'LINEAR_004',\n\n  // MCP errors (5000-5999)\n  MCP_TOOL_NOT_FOUND = 'MCP_001',\n  MCP_INVALID_PARAMS = 'MCP_002',\n  MCP_EXECUTION_FAILED = 'MCP_003',\n  MCP_RATE_LIMITED = 'MCP_004',\n\n  // Project errors (6000-6999)\n  PROJECT_NOT_FOUND = 'PROJECT_001',\n  PROJECT_INVALID_PATH = 'PROJECT_002',\n  PROJECT_GIT_ERROR = 'PROJECT_003',\n\n  // Validation errors (7000-7999)\n  VALIDATION_FAILED = 'VAL_001',\n  INVALID_INPUT = 'VAL_002',\n  MISSING_REQUIRED_FIELD = 'VAL_003',\n  TYPE_MISMATCH = 'VAL_004',\n\n  // System errors (8000-8999)\n  INITIALIZATION_ERROR = 'SYS_001',\n  NOT_FOUND = 'SYS_002',\n  INTERNAL_ERROR = 'SYS_003',\n  CONFIGURATION_ERROR = 'SYS_004',\n  PERMISSION_DENIED = 'SYS_005',\n  RESOURCE_EXHAUSTED = 'SYS_006',\n  SERVICE_UNAVAILABLE = 'SYS_007',\n  SYSTEM_INIT_FAILED = 'SYS_008',\n}\n\nexport interface ErrorContext {\n  [key: string]: unknown;\n}\n\nexport interface StackMemoryErrorOptions {\n  code: ErrorCode;\n  message: string;\n  context?: ErrorContext;\n  cause?: Error;\n  isRetryable?: boolean;\n  httpStatus?: number;\n}\n\n/**\n * Base error class for all StackMemory errors\n */\nexport class StackMemoryError extends Error {\n  public readonly code: ErrorCode;\n  public readonly context?: ErrorContext;\n  public readonly cause?: Error;\n  public readonly isRetryable: boolean;\n  public readonly httpStatus: number;\n  public readonly timestamp: Date;\n\n  constructor(options: StackMemoryErrorOptions) {\n    super(options.message);\n    this.name = this.constructor.name;\n    this.code = options.code;\n    this.context = options.context;\n    this.cause = options.cause;\n    this.isRetryable = options.isRetryable ?? false;\n    this.httpStatus = options.httpStatus ?? 500;\n    this.timestamp = new Date();\n\n    // Maintains proper stack trace for where our error was thrown\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, this.constructor);\n    }\n  }\n\n  toJSON(): Record<string, unknown> {\n    return {\n      name: this.name,\n      code: this.code,\n      message: this.message,\n      context: this.context,\n      isRetryable: this.isRetryable,\n      httpStatus: this.httpStatus,\n      timestamp: this.timestamp.toISOString(),\n      stack: this.stack,\n      cause: this.cause?.message,\n    };\n  }\n}\n\n/**\n * Database-related errors\n */\nexport class DatabaseError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.DB_QUERY_FAILED,\n    context?: ErrorContext,\n    cause?: Error\n  ) {\n    super({\n      code,\n      message,\n      context,\n      cause,\n      isRetryable: code === ErrorCode.DB_CONNECTION_FAILED,\n      httpStatus: 503,\n    });\n  }\n}\n\n/**\n * Frame-related errors\n */\nexport class FrameError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.FRAME_INVALID_STATE,\n    context?: ErrorContext\n  ) {\n    super({\n      code,\n      message,\n      context,\n      isRetryable: false,\n      httpStatus: 400,\n    });\n  }\n}\n\n/**\n * Task-related errors\n */\nexport class TaskError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.TASK_INVALID_STATE,\n    context?: ErrorContext\n  ) {\n    super({\n      code,\n      message,\n      context,\n      isRetryable: false,\n      httpStatus: 400,\n    });\n  }\n}\n\n/**\n * Integration errors (Linear, etc.)\n */\nexport class IntegrationError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.LINEAR_API_ERROR,\n    context?: ErrorContext,\n    cause?: Error\n  ) {\n    super({\n      code,\n      message,\n      context,\n      cause,\n      isRetryable: true,\n      httpStatus: 502,\n    });\n  }\n}\n\n/**\n * MCP-related errors\n */\nexport class MCPError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.MCP_EXECUTION_FAILED,\n    context?: ErrorContext\n  ) {\n    super({\n      code,\n      message,\n      context,\n      isRetryable: code === ErrorCode.MCP_RATE_LIMITED,\n      httpStatus: code === ErrorCode.MCP_RATE_LIMITED ? 429 : 400,\n    });\n  }\n}\n\n/**\n * Validation errors\n */\nexport class ValidationError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.VALIDATION_FAILED,\n    context?: ErrorContext\n  ) {\n    super({\n      code,\n      message,\n      context,\n      isRetryable: false,\n      httpStatus: 400,\n    });\n  }\n}\n\n/**\n * Project-related errors\n */\nexport class ProjectError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.PROJECT_NOT_FOUND,\n    context?: ErrorContext\n  ) {\n    super({\n      code,\n      message,\n      context,\n      isRetryable: false,\n      httpStatus: 404,\n    });\n  }\n}\n\n/**\n * System/Internal errors\n */\nexport class SystemError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.INTERNAL_ERROR,\n    context?: ErrorContext,\n    cause?: Error\n  ) {\n    super({\n      code,\n      message,\n      context,\n      cause,\n      isRetryable: code === ErrorCode.SERVICE_UNAVAILABLE,\n      httpStatus: 500,\n    });\n  }\n}\n\n/**\n * Helper function to determine if an error is retryable\n */\nexport function isRetryableError(error: unknown): boolean {\n  if (error instanceof StackMemoryError) {\n    return error.isRetryable;\n  }\n  // Check for common retryable error patterns\n  if (error instanceof Error) {\n    const message = error.message.toLowerCase();\n    return (\n      message.includes('econnrefused') ||\n      message.includes('timeout') ||\n      message.includes('enotfound') ||\n      message.includes('socket hang up')\n    );\n  }\n  return false;\n}\n\n/**\n * Helper function to safely extract error message\n */\nexport function getErrorMessage(error: unknown): string {\n  if (error instanceof Error) {\n    return error.message;\n  }\n  if (typeof error === 'string') {\n    return error;\n  }\n  if (error && typeof error === 'object' && 'message' in error) {\n    return String(error.message);\n  }\n  return 'An unknown error occurred';\n}\n\n/**\n * Helper function to wrap unknown errors in StackMemoryError\n */\nexport function wrapError(\n  error: unknown,\n  defaultMessage: string,\n  code: ErrorCode = ErrorCode.INTERNAL_ERROR,\n  context?: ErrorContext\n): StackMemoryError {\n  if (error instanceof StackMemoryError) {\n    return error;\n  }\n\n  const cause = error instanceof Error ? error : undefined;\n  const message = error instanceof Error ? error.message : defaultMessage;\n\n  return new SystemError(message, code, context, cause);\n}\n\n/**\n * Type guard to check if error is a StackMemoryError\n */\nexport function isStackMemoryError(error: unknown): error is StackMemoryError {\n  return error instanceof StackMemoryError;\n}\n\n/**\n * Create context-aware error handler\n */\nexport function createErrorHandler(defaultContext: ErrorContext) {\n  return (error: unknown, additionalContext?: ErrorContext) => {\n    const context = { ...defaultContext, ...additionalContext };\n    \n    if (error instanceof StackMemoryError) {\n      // Create a new error with merged context since context is readonly\n      return new StackMemoryError({\n        code: error.code,\n        message: error.message,\n        context: { ...error.context, ...context },\n        cause: error.cause,\n        isRetryable: error.isRetryable,\n        httpStatus: error.httpStatus,\n      });\n    }\n\n    return wrapError(error, getErrorMessage(error), ErrorCode.INTERNAL_ERROR, context);\n  };\n}"],
-  "mappings": "AAKO,IAAK,YAAL,kBAAKA,eAAL;AAEL,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,qBAAkB;AAClB,EAAAA,WAAA,2BAAwB;AACxB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,6BAA0B;AAC1B,EAAAA,WAAA,qBAAkB;AAClB,EAAAA,WAAA,sBAAmB;AACnB,EAAAA,WAAA,sBAAmB;AACnB,EAAAA,WAAA,sBAAmB;AAGnB,EAAAA,WAAA,qBAAkB;AAClB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,4BAAyB;AACzB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,uBAAoB;AACpB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,0BAAuB;AAGvB,EAAAA,WAAA,oBAAiB;AACjB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,8BAA2B;AAC3B,EAAAA,WAAA,8BAA2B;AAG3B,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,sBAAmB;AACnB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,2BAAwB;AAGxB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,sBAAmB;AAGnB,EAAAA,WAAA,uBAAoB;AACpB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,uBAAoB;AAGpB,EAAAA,WAAA,uBAAoB;AACpB,EAAAA,WAAA,mBAAgB;AAChB,EAAAA,WAAA,4BAAyB;AACzB,EAAAA,WAAA,mBAAgB;AAGhB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,eAAY;AACZ,EAAAA,WAAA,oBAAiB;AACjB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,uBAAoB;AACpB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,wBAAqB;AA3DX,SAAAA;AAAA,GAAA;AA8EL,MAAM,yBAAyB,MAAM;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEhB,YAAY,SAAkC;AAC5C,UAAM,QAAQ,OAAO;AACrB,SAAK,OAAO,KAAK,YAAY;AAC7B,SAAK,OAAO,QAAQ;AACpB,SAAK,UAAU,QAAQ;AACvB,SAAK,QAAQ,QAAQ;AACrB,SAAK,cAAc,QAAQ,eAAe;AAC1C,SAAK,aAAa,QAAQ,cAAc;AACxC,SAAK,YAAY,oBAAI,KAAK;AAG1B,QAAI,MAAM,mBAAmB;AAC3B,YAAM,kBAAkB,MAAM,KAAK,WAAW;AAAA,IAChD;AAAA,EACF;AAAA,EAEA,SAAkC;AAChC,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,MAAM,KAAK;AAAA,MACX,SAAS,KAAK;AAAA,MACd,SAAS,KAAK;AAAA,MACd,aAAa,KAAK;AAAA,MAClB,YAAY,KAAK;AAAA,MACjB,WAAW,KAAK,UAAU,YAAY;AAAA,MACtC,OAAO,KAAK;AAAA,MACZ,OAAO,KAAK,OAAO;AAAA,IACrB;AAAA,EACF;AACF;AAKO,MAAM,sBAAsB,iBAAiB;AAAA,EAClD,YACE,SACA,OAAkB,gCAClB,SACA,OACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa,SAAS;AAAA,MACtB,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,mBAAmB,iBAAiB;AAAA,EAC/C,YACE,SACA,OAAkB,uCAClB,SACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,kBAAkB,iBAAiB;AAAA,EAC9C,YACE,SACA,OAAkB,qCAClB,SACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,yBAAyB,iBAAiB;AAAA,EACrD,YACE,SACA,OAAkB,qCAClB,SACA,OACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,iBAAiB,iBAAiB;AAAA,EAC7C,YACE,SACA,OAAkB,sCAClB,SACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa,SAAS;AAAA,MACtB,YAAY,SAAS,mCAA6B,MAAM;AAAA,IAC1D,CAAC;AAAA,EACH;AACF;AAKO,MAAM,wBAAwB,iBAAiB;AAAA,EACpD,YACE,SACA,OAAkB,mCAClB,SACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,qBAAqB,iBAAiB;AAAA,EACjD,YACE,SACA,OAAkB,uCAClB,SACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,oBAAoB,iBAAiB;AAAA,EAChD,YACE,SACA,OAAkB,gCAClB,SACA,OACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa,SAAS;AAAA,MACtB,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,SAAS,iBAAiB,OAAyB;AACxD,MAAI,iBAAiB,kBAAkB;AACrC,WAAO,MAAM;AAAA,EACf;AAEA,MAAI,iBAAiB,OAAO;AAC1B,UAAM,UAAU,MAAM,QAAQ,YAAY;AAC1C,WACE,QAAQ,SAAS,cAAc,KAC/B,QAAQ,SAAS,SAAS,KAC1B,QAAQ,SAAS,WAAW,KAC5B,QAAQ,SAAS,gBAAgB;AAAA,EAErC;AACA,SAAO;AACT;AAKO,SAAS,gBAAgB,OAAwB;AACtD,MAAI,iBAAiB,OAAO;AAC1B,WAAO,MAAM;AAAA,EACf;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO;AAAA,EACT;AACA,MAAI,SAAS,OAAO,UAAU,YAAY,aAAa,OAAO;AAC5D,WAAO,OAAO,MAAM,OAAO;AAAA,EAC7B;AACA,SAAO;AACT;AAKO,SAAS,UACd,OACA,gBACA,OAAkB,gCAClB,SACkB;AAClB,MAAI,iBAAiB,kBAAkB;AACrC,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,iBAAiB,QAAQ,QAAQ;AAC/C,QAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU;AAEzD,SAAO,IAAI,YAAY,SAAS,MAAM,SAAS,KAAK;AACtD;AAKO,SAAS,mBAAmB,OAA2C;AAC5E,SAAO,iBAAiB;AAC1B;AAKO,SAAS,mBAAmB,gBAA8B;AAC/D,SAAO,CAAC,OAAgB,sBAAqC;AAC3D,UAAM,UAAU,EAAE,GAAG,gBAAgB,GAAG,kBAAkB;AAE1D,QAAI,iBAAiB,kBAAkB;AAErC,aAAO,IAAI,iBAAiB;AAAA,QAC1B,MAAM,MAAM;AAAA,QACZ,SAAS,MAAM;AAAA,QACf,SAAS,EAAE,GAAG,MAAM,SAAS,GAAG,QAAQ;AAAA,QACxC,OAAO,MAAM;AAAA,QACb,aAAa,MAAM;AAAA,QACnB,YAAY,MAAM;AAAA,MACpB,CAAC;AAAA,IACH;AAEA,WAAO,UAAU,OAAO,gBAAgB,KAAK,GAAG,gCAA0B,OAAO;AAAA,EACnF;AACF;",
+  "sourcesContent": ["/**\n * Custom error classes for StackMemory\n * Provides a hierarchy of error types for better error handling and debugging\n */\n\nexport enum ErrorCode {\n  // Database errors (1000-1999)\n  DB_CONNECTION_FAILED = 'DB_001',\n  DB_QUERY_FAILED = 'DB_002',\n  DB_TRANSACTION_FAILED = 'DB_003',\n  DB_MIGRATION_FAILED = 'DB_004',\n  DB_CONSTRAINT_VIOLATION = 'DB_005',\n  DB_SCHEMA_ERROR = 'DB_006',\n  DB_INSERT_FAILED = 'DB_007',\n  DB_UPDATE_FAILED = 'DB_008',\n  DB_DELETE_FAILED = 'DB_009',\n\n  // Frame errors (2000-2999)\n  FRAME_NOT_FOUND = 'FRAME_001',\n  FRAME_INVALID_STATE = 'FRAME_002',\n  FRAME_PARENT_NOT_FOUND = 'FRAME_003',\n  FRAME_CYCLE_DETECTED = 'FRAME_004',\n  FRAME_ALREADY_CLOSED = 'FRAME_005',\n  FRAME_INIT_FAILED = 'FRAME_006',\n  FRAME_INVALID_INPUT = 'FRAME_007',\n  FRAME_STACK_OVERFLOW = 'FRAME_008',\n\n  // Task errors (3000-3999)\n  TASK_NOT_FOUND = 'TASK_001',\n  TASK_INVALID_STATE = 'TASK_002',\n  TASK_DEPENDENCY_CONFLICT = 'TASK_003',\n  TASK_CIRCULAR_DEPENDENCY = 'TASK_004',\n\n  // Integration errors (4000-4999)\n  LINEAR_AUTH_FAILED = 'LINEAR_001',\n  LINEAR_API_ERROR = 'LINEAR_002',\n  LINEAR_SYNC_FAILED = 'LINEAR_003',\n  LINEAR_WEBHOOK_FAILED = 'LINEAR_004',\n\n  // MCP errors (5000-5999)\n  MCP_TOOL_NOT_FOUND = 'MCP_001',\n  MCP_INVALID_PARAMS = 'MCP_002',\n  MCP_EXECUTION_FAILED = 'MCP_003',\n  MCP_RATE_LIMITED = 'MCP_004',\n\n  // Project errors (6000-6999)\n  PROJECT_NOT_FOUND = 'PROJECT_001',\n  PROJECT_INVALID_PATH = 'PROJECT_002',\n  PROJECT_GIT_ERROR = 'PROJECT_003',\n\n  // Validation errors (7000-7999)\n  VALIDATION_FAILED = 'VAL_001',\n  INVALID_INPUT = 'VAL_002',\n  MISSING_REQUIRED_FIELD = 'VAL_003',\n  TYPE_MISMATCH = 'VAL_004',\n\n  // System errors (8000-8999)\n  INITIALIZATION_ERROR = 'SYS_001',\n  NOT_FOUND = 'SYS_002',\n  INTERNAL_ERROR = 'SYS_003',\n  CONFIGURATION_ERROR = 'SYS_004',\n  PERMISSION_DENIED = 'SYS_005',\n  RESOURCE_EXHAUSTED = 'SYS_006',\n  SERVICE_UNAVAILABLE = 'SYS_007',\n  SYSTEM_INIT_FAILED = 'SYS_008',\n\n  // Collaboration errors (9000-9999)\n  STACK_CONTEXT_NOT_FOUND = 'COLLAB_001',\n  HANDOFF_REQUEST_EXPIRED = 'COLLAB_002',\n  MERGE_CONFLICT_UNRESOLVABLE = 'COLLAB_003',\n  PERMISSION_VIOLATION = 'COLLAB_004',\n  OPERATION_FAILED = 'COLLAB_005',\n  OPERATION_EXPIRED = 'COLLAB_006',\n  INVALID_STATE = 'COLLAB_007',\n  RESOURCE_NOT_FOUND = 'COLLAB_008',\n  HANDOFF_ALREADY_EXISTS = 'COLLAB_009',\n  MERGE_SESSION_INVALID = 'COLLAB_010',\n  STACK_SWITCH_FAILED = 'COLLAB_011',\n  APPROVAL_TIMEOUT = 'COLLAB_012',\n  CONFLICT_RESOLUTION_FAILED = 'COLLAB_013',\n  TEAM_ACCESS_DENIED = 'COLLAB_014',\n  STACK_LIMIT_EXCEEDED = 'COLLAB_015',\n}\n\nexport interface ErrorContext {\n  [key: string]: unknown;\n}\n\nexport interface StackMemoryErrorOptions {\n  code: ErrorCode;\n  message: string;\n  context?: ErrorContext;\n  cause?: Error;\n  isRetryable?: boolean;\n  httpStatus?: number;\n}\n\n/**\n * Base error class for all StackMemory errors\n */\nexport class StackMemoryError extends Error {\n  public readonly code: ErrorCode;\n  public readonly context?: ErrorContext;\n  public readonly cause?: Error;\n  public readonly isRetryable: boolean;\n  public readonly httpStatus: number;\n  public readonly timestamp: Date;\n\n  constructor(options: StackMemoryErrorOptions) {\n    super(options.message);\n    this.name = this.constructor.name;\n    this.code = options.code;\n    this.context = options.context;\n    this.cause = options.cause;\n    this.isRetryable = options.isRetryable ?? false;\n    this.httpStatus = options.httpStatus ?? 500;\n    this.timestamp = new Date();\n\n    // Maintains proper stack trace for where our error was thrown\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, this.constructor);\n    }\n  }\n\n  toJSON(): Record<string, unknown> {\n    return {\n      name: this.name,\n      code: this.code,\n      message: this.message,\n      context: this.context,\n      isRetryable: this.isRetryable,\n      httpStatus: this.httpStatus,\n      timestamp: this.timestamp.toISOString(),\n      stack: this.stack,\n      cause: this.cause?.message,\n    };\n  }\n}\n\n/**\n * Database-related errors\n */\nexport class DatabaseError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.DB_QUERY_FAILED,\n    context?: ErrorContext,\n    cause?: Error\n  ) {\n    super({\n      code,\n      message,\n      context,\n      cause,\n      isRetryable: code === ErrorCode.DB_CONNECTION_FAILED,\n      httpStatus: 503,\n    });\n  }\n}\n\n/**\n * Frame-related errors\n */\nexport class FrameError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.FRAME_INVALID_STATE,\n    context?: ErrorContext\n  ) {\n    super({\n      code,\n      message,\n      context,\n      isRetryable: false,\n      httpStatus: 400,\n    });\n  }\n}\n\n/**\n * Task-related errors\n */\nexport class TaskError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.TASK_INVALID_STATE,\n    context?: ErrorContext\n  ) {\n    super({\n      code,\n      message,\n      context,\n      isRetryable: false,\n      httpStatus: 400,\n    });\n  }\n}\n\n/**\n * Integration errors (Linear, etc.)\n */\nexport class IntegrationError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.LINEAR_API_ERROR,\n    context?: ErrorContext,\n    cause?: Error\n  ) {\n    super({\n      code,\n      message,\n      context,\n      cause,\n      isRetryable: true,\n      httpStatus: 502,\n    });\n  }\n}\n\n/**\n * MCP-related errors\n */\nexport class MCPError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.MCP_EXECUTION_FAILED,\n    context?: ErrorContext\n  ) {\n    super({\n      code,\n      message,\n      context,\n      isRetryable: code === ErrorCode.MCP_RATE_LIMITED,\n      httpStatus: code === ErrorCode.MCP_RATE_LIMITED ? 429 : 400,\n    });\n  }\n}\n\n/**\n * Validation errors\n */\nexport class ValidationError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.VALIDATION_FAILED,\n    context?: ErrorContext\n  ) {\n    super({\n      code,\n      message,\n      context,\n      isRetryable: false,\n      httpStatus: 400,\n    });\n  }\n}\n\n/**\n * Project-related errors\n */\nexport class ProjectError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.PROJECT_NOT_FOUND,\n    context?: ErrorContext\n  ) {\n    super({\n      code,\n      message,\n      context,\n      isRetryable: false,\n      httpStatus: 404,\n    });\n  }\n}\n\n/**\n * System/Internal errors\n */\nexport class SystemError extends StackMemoryError {\n  constructor(\n    message: string,\n    code: ErrorCode = ErrorCode.INTERNAL_ERROR,\n    context?: ErrorContext,\n    cause?: Error\n  ) {\n    super({\n      code,\n      message,\n      context,\n      cause,\n      isRetryable: code === ErrorCode.SERVICE_UNAVAILABLE,\n      httpStatus: 500,\n    });\n  }\n}\n\n/**\n * Helper function to determine if an error is retryable\n */\nexport function isRetryableError(error: unknown): boolean {\n  if (error instanceof StackMemoryError) {\n    return error.isRetryable;\n  }\n  // Check for common retryable error patterns\n  if (error instanceof Error) {\n    const message = error.message.toLowerCase();\n    return (\n      message.includes('econnrefused') ||\n      message.includes('timeout') ||\n      message.includes('enotfound') ||\n      message.includes('socket hang up')\n    );\n  }\n  return false;\n}\n\n/**\n * Helper function to safely extract error message\n */\nexport function getErrorMessage(error: unknown): string {\n  if (error instanceof Error) {\n    return error.message;\n  }\n  if (typeof error === 'string') {\n    return error;\n  }\n  if (error && typeof error === 'object' && 'message' in error) {\n    return String(error.message);\n  }\n  return 'An unknown error occurred';\n}\n\n/**\n * Helper function to wrap unknown errors in StackMemoryError\n */\nexport function wrapError(\n  error: unknown,\n  defaultMessage: string,\n  code: ErrorCode = ErrorCode.INTERNAL_ERROR,\n  context?: ErrorContext\n): StackMemoryError {\n  if (error instanceof StackMemoryError) {\n    return error;\n  }\n\n  const cause = error instanceof Error ? error : undefined;\n  const message = error instanceof Error ? error.message : defaultMessage;\n\n  return new SystemError(message, code, context, cause);\n}\n\n/**\n * Type guard to check if error is a StackMemoryError\n */\nexport function isStackMemoryError(error: unknown): error is StackMemoryError {\n  return error instanceof StackMemoryError;\n}\n\n/**\n * Create context-aware error handler\n */\nexport function createErrorHandler(defaultContext: ErrorContext) {\n  return (error: unknown, additionalContext?: ErrorContext) => {\n    const context = { ...defaultContext, ...additionalContext };\n\n    if (error instanceof StackMemoryError) {\n      // Create a new error with merged context since context is readonly\n      return new StackMemoryError({\n        code: error.code,\n        message: error.message,\n        context: { ...error.context, ...context },\n        cause: error.cause,\n        isRetryable: error.isRetryable,\n        httpStatus: error.httpStatus,\n      });\n    }\n\n    return wrapError(\n      error,\n      getErrorMessage(error),\n      ErrorCode.INTERNAL_ERROR,\n      context\n    );\n  };\n}\n"],
+  "mappings": "AAKO,IAAK,YAAL,kBAAKA,eAAL;AAEL,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,qBAAkB;AAClB,EAAAA,WAAA,2BAAwB;AACxB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,6BAA0B;AAC1B,EAAAA,WAAA,qBAAkB;AAClB,EAAAA,WAAA,sBAAmB;AACnB,EAAAA,WAAA,sBAAmB;AACnB,EAAAA,WAAA,sBAAmB;AAGnB,EAAAA,WAAA,qBAAkB;AAClB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,4BAAyB;AACzB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,uBAAoB;AACpB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,0BAAuB;AAGvB,EAAAA,WAAA,oBAAiB;AACjB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,8BAA2B;AAC3B,EAAAA,WAAA,8BAA2B;AAG3B,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,sBAAmB;AACnB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,2BAAwB;AAGxB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,sBAAmB;AAGnB,EAAAA,WAAA,uBAAoB;AACpB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,uBAAoB;AAGpB,EAAAA,WAAA,uBAAoB;AACpB,EAAAA,WAAA,mBAAgB;AAChB,EAAAA,WAAA,4BAAyB;AACzB,EAAAA,WAAA,mBAAgB;AAGhB,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,eAAY;AACZ,EAAAA,WAAA,oBAAiB;AACjB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,uBAAoB;AACpB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,wBAAqB;AAGrB,EAAAA,WAAA,6BAA0B;AAC1B,EAAAA,WAAA,6BAA0B;AAC1B,EAAAA,WAAA,iCAA8B;AAC9B,EAAAA,WAAA,0BAAuB;AACvB,EAAAA,WAAA,sBAAmB;AACnB,EAAAA,WAAA,uBAAoB;AACpB,EAAAA,WAAA,mBAAgB;AAChB,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,4BAAyB;AACzB,EAAAA,WAAA,2BAAwB;AACxB,EAAAA,WAAA,yBAAsB;AACtB,EAAAA,WAAA,sBAAmB;AACnB,EAAAA,WAAA,gCAA6B;AAC7B,EAAAA,WAAA,wBAAqB;AACrB,EAAAA,WAAA,0BAAuB;AA5Eb,SAAAA;AAAA,GAAA;AA+FL,MAAM,yBAAyB,MAAM;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEhB,YAAY,SAAkC;AAC5C,UAAM,QAAQ,OAAO;AACrB,SAAK,OAAO,KAAK,YAAY;AAC7B,SAAK,OAAO,QAAQ;AACpB,SAAK,UAAU,QAAQ;AACvB,SAAK,QAAQ,QAAQ;AACrB,SAAK,cAAc,QAAQ,eAAe;AAC1C,SAAK,aAAa,QAAQ,cAAc;AACxC,SAAK,YAAY,oBAAI,KAAK;AAG1B,QAAI,MAAM,mBAAmB;AAC3B,YAAM,kBAAkB,MAAM,KAAK,WAAW;AAAA,IAChD;AAAA,EACF;AAAA,EAEA,SAAkC;AAChC,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,MAAM,KAAK;AAAA,MACX,SAAS,KAAK;AAAA,MACd,SAAS,KAAK;AAAA,MACd,aAAa,KAAK;AAAA,MAClB,YAAY,KAAK;AAAA,MACjB,WAAW,KAAK,UAAU,YAAY;AAAA,MACtC,OAAO,KAAK;AAAA,MACZ,OAAO,KAAK,OAAO;AAAA,IACrB;AAAA,EACF;AACF;AAKO,MAAM,sBAAsB,iBAAiB;AAAA,EAClD,YACE,SACA,OAAkB,gCAClB,SACA,OACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa,SAAS;AAAA,MACtB,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,mBAAmB,iBAAiB;AAAA,EAC/C,YACE,SACA,OAAkB,uCAClB,SACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,kBAAkB,iBAAiB;AAAA,EAC9C,YACE,SACA,OAAkB,qCAClB,SACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,yBAAyB,iBAAiB;AAAA,EACrD,YACE,SACA,OAAkB,qCAClB,SACA,OACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,iBAAiB,iBAAiB;AAAA,EAC7C,YACE,SACA,OAAkB,sCAClB,SACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa,SAAS;AAAA,MACtB,YAAY,SAAS,mCAA6B,MAAM;AAAA,IAC1D,CAAC;AAAA,EACH;AACF;AAKO,MAAM,wBAAwB,iBAAiB;AAAA,EACpD,YACE,SACA,OAAkB,mCAClB,SACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,qBAAqB,iBAAiB;AAAA,EACjD,YACE,SACA,OAAkB,uCAClB,SACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,MAAM,oBAAoB,iBAAiB;AAAA,EAChD,YACE,SACA,OAAkB,gCAClB,SACA,OACA;AACA,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa,SAAS;AAAA,MACtB,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AACF;AAKO,SAAS,iBAAiB,OAAyB;AACxD,MAAI,iBAAiB,kBAAkB;AACrC,WAAO,MAAM;AAAA,EACf;AAEA,MAAI,iBAAiB,OAAO;AAC1B,UAAM,UAAU,MAAM,QAAQ,YAAY;AAC1C,WACE,QAAQ,SAAS,cAAc,KAC/B,QAAQ,SAAS,SAAS,KAC1B,QAAQ,SAAS,WAAW,KAC5B,QAAQ,SAAS,gBAAgB;AAAA,EAErC;AACA,SAAO;AACT;AAKO,SAAS,gBAAgB,OAAwB;AACtD,MAAI,iBAAiB,OAAO;AAC1B,WAAO,MAAM;AAAA,EACf;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO;AAAA,EACT;AACA,MAAI,SAAS,OAAO,UAAU,YAAY,aAAa,OAAO;AAC5D,WAAO,OAAO,MAAM,OAAO;AAAA,EAC7B;AACA,SAAO;AACT;AAKO,SAAS,UACd,OACA,gBACA,OAAkB,gCAClB,SACkB;AAClB,MAAI,iBAAiB,kBAAkB;AACrC,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,iBAAiB,QAAQ,QAAQ;AAC/C,QAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU;AAEzD,SAAO,IAAI,YAAY,SAAS,MAAM,SAAS,KAAK;AACtD;AAKO,SAAS,mBAAmB,OAA2C;AAC5E,SAAO,iBAAiB;AAC1B;AAKO,SAAS,mBAAmB,gBAA8B;AAC/D,SAAO,CAAC,OAAgB,sBAAqC;AAC3D,UAAM,UAAU,EAAE,GAAG,gBAAgB,GAAG,kBAAkB;AAE1D,QAAI,iBAAiB,kBAAkB;AAErC,aAAO,IAAI,iBAAiB;AAAA,QAC1B,MAAM,MAAM;AAAA,QACZ,SAAS,MAAM;AAAA,QACf,SAAS,EAAE,GAAG,MAAM,SAAS,GAAG,QAAQ;AAAA,QACxC,OAAO,MAAM;AAAA,QACb,aAAa,MAAM;AAAA,QACnB,YAAY,MAAM;AAAA,MACpB,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,MACL;AAAA,MACA,gBAAgB,KAAK;AAAA,MACrB;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACF;",
   "names": ["ErrorCode"]
 }

package/dist/core/frame/workflow-templates-stub.js

@@ -0,0 +1,42 @@
+const workflowTemplates = {
+  tdd: {
+    name: "Test-Driven Development",
+    description: "Write tests first, then implement",
+    phases: [
+      { name: "write-failing-tests", description: "Write tests that fail" },
+      { name: "implement-code", description: "Make tests pass" },
+      { name: "refactor", description: "Clean up code" }
+    ]
+  },
+  feature: {
+    name: "Feature Development",
+    description: "Develop a new feature",
+    phases: [
+      { name: "design", description: "Design the feature" },
+      { name: "implement", description: "Build the feature" },
+      { name: "test", description: "Test the feature" }
+    ]
+  },
+  bugfix: {
+    name: "Bug Fix",
+    description: "Fix a reported bug",
+    phases: [
+      { name: "reproduce", description: "Reproduce the bug" },
+      { name: "fix", description: "Fix the bug" },
+      { name: "verify", description: "Verify the fix" }
+    ]
+  },
+  refactor: {
+    name: "Refactoring",
+    description: "Improve code structure",
+    phases: [
+      { name: "analyze", description: "Analyze current code" },
+      { name: "refactor", description: "Refactor code" },
+      { name: "test", description: "Ensure no regressions" }
+    ]
+  }
+};
+export {
+  workflowTemplates
+};
+//# sourceMappingURL=workflow-templates-stub.js.map

package/dist/core/frame/workflow-templates-stub.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/core/frame/workflow-templates-stub.ts"],
+  "sourcesContent": ["/**\n * Stub workflow templates for testing\n */\n\nexport const workflowTemplates = {\n  tdd: {\n    name: 'Test-Driven Development',\n    description: 'Write tests first, then implement',\n    phases: [\n      { name: 'write-failing-tests', description: 'Write tests that fail' },\n      { name: 'implement-code', description: 'Make tests pass' },\n      { name: 'refactor', description: 'Clean up code' }\n    ]\n  },\n  feature: {\n    name: 'Feature Development',\n    description: 'Develop a new feature',\n    phases: [\n      { name: 'design', description: 'Design the feature' },\n      { name: 'implement', description: 'Build the feature' },\n      { name: 'test', description: 'Test the feature' }\n    ]\n  },\n  bugfix: {\n    name: 'Bug Fix',\n    description: 'Fix a reported bug',\n    phases: [\n      { name: 'reproduce', description: 'Reproduce the bug' },\n      { name: 'fix', description: 'Fix the bug' },\n      { name: 'verify', description: 'Verify the fix' }\n    ]\n  },\n  refactor: {\n    name: 'Refactoring',\n    description: 'Improve code structure',\n    phases: [\n      { name: 'analyze', description: 'Analyze current code' },\n      { name: 'refactor', description: 'Refactor code' },\n      { name: 'test', description: 'Ensure no regressions' }\n    ]\n  }\n};"],
+  "mappings": "AAIO,MAAM,oBAAoB;AAAA,EAC/B,KAAK;AAAA,IACH,MAAM;AAAA,IACN,aAAa;AAAA,IACb,QAAQ;AAAA,MACN,EAAE,MAAM,uBAAuB,aAAa,wBAAwB;AAAA,MACpE,EAAE,MAAM,kBAAkB,aAAa,kBAAkB;AAAA,MACzD,EAAE,MAAM,YAAY,aAAa,gBAAgB;AAAA,IACnD;AAAA,EACF;AAAA,EACA,SAAS;AAAA,IACP,MAAM;AAAA,IACN,aAAa;AAAA,IACb,QAAQ;AAAA,MACN,EAAE,MAAM,UAAU,aAAa,qBAAqB;AAAA,MACpD,EAAE,MAAM,aAAa,aAAa,oBAAoB;AAAA,MACtD,EAAE,MAAM,QAAQ,aAAa,mBAAmB;AAAA,IAClD;AAAA,EACF;AAAA,EACA,QAAQ;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,QAAQ;AAAA,MACN,EAAE,MAAM,aAAa,aAAa,oBAAoB;AAAA,MACtD,EAAE,MAAM,OAAO,aAAa,cAAc;AAAA,MAC1C,EAAE,MAAM,UAAU,aAAa,iBAAiB;AAAA,IAClD;AAAA,EACF;AAAA,EACA,UAAU;AAAA,IACR,MAAM;AAAA,IACN,aAAa;AAAA,IACb,QAAQ;AAAA,MACN,EAAE,MAAM,WAAW,aAAa,uBAAuB;AAAA,MACvD,EAAE,MAAM,YAAY,aAAa,gBAAgB;AAAA,MACjD,EAAE,MAAM,QAAQ,aAAa,wBAAwB;AAAA,IACvD;AAAA,EACF;AACF;",
+  "names": []
+}

package/dist/core/frame/workflow-templates.js

@@ -0,0 +1,276 @@
+class WorkflowTemplates {
+  frameManager;
+  constructor(frameManager) {
+    this.frameManager = frameManager;
+  }
+  /**
+   * TDD Workflow: Red → Green → Refactor
+   */
+  static TDD = {
+    name: "tdd",
+    description: "Test-Driven Development workflow",
+    phases: [
+      {
+        name: "write-failing-tests",
+        requiredOutputs: ["test_file", "test_count"],
+        validationRules: [(frame) => frame.metadata?.tests_failing === true]
+      },
+      {
+        name: "implement-minimal",
+        requiredOutputs: ["implementation_file"],
+        validationRules: [(frame) => frame.metadata?.tests_passing === true]
+      },
+      {
+        name: "refactor",
+        requiredOutputs: ["refactored_files"],
+        validationRules: [
+          (frame) => frame.metadata?.tests_passing === true,
+          (frame) => frame.metadata?.complexity_reduced === true
+        ],
+        autoTransition: true
+      }
+    ]
+  };
+  /**
+   * Feature Development Workflow
+   */
+  static FEATURE = {
+    name: "feature",
+    description: "Feature development workflow",
+    phases: [
+      {
+        name: "research",
+        requiredOutputs: ["requirements", "constraints", "dependencies"],
+        validationRules: [
+          (frame) => frame.metadata?.research_complete === true
+        ]
+      },
+      {
+        name: "design",
+        requiredOutputs: ["architecture_decision", "api_design"],
+        validationRules: [(frame) => frame.metadata?.design_reviewed === true]
+      },
+      {
+        name: "implement",
+        requiredOutputs: ["implementation_files", "tests"],
+        validationRules: [
+          (frame) => frame.metadata?.tests_passing === true,
+          (frame) => frame.metadata?.lint_passing === true
+        ]
+      },
+      {
+        name: "validate",
+        requiredOutputs: ["test_results", "performance_metrics"],
+        validationRules: [
+          (frame) => frame.metadata?.validation_complete === true
+        ],
+        autoTransition: true
+      }
+    ]
+  };
+  /**
+   * Bug Fix Workflow
+   */
+  static BUGFIX = {
+    name: "bugfix",
+    description: "Bug fixing workflow",
+    phases: [
+      {
+        name: "reproduce",
+        requiredOutputs: ["reproduction_steps", "failing_test"],
+        validationRules: [(frame) => frame.metadata?.bug_reproduced === true]
+      },
+      {
+        name: "diagnose",
+        requiredOutputs: ["root_cause", "affected_code"],
+        validationRules: [(frame) => frame.metadata?.cause_identified === true]
+      },
+      {
+        name: "fix",
+        requiredOutputs: ["fix_commits", "updated_tests"],
+        validationRules: [(frame) => frame.metadata?.fix_applied === true]
+      },
+      {
+        name: "verify",
+        requiredOutputs: ["verification_results", "regression_tests"],
+        validationRules: [
+          (frame) => frame.metadata?.bug_fixed === true,
+          (frame) => frame.metadata?.no_regressions === true
+        ],
+        autoTransition: true
+      }
+    ]
+  };
+  /**
+   * Refactoring Workflow
+   */
+  static REFACTOR = {
+    name: "refactor",
+    description: "Code refactoring workflow",
+    phases: [
+      {
+        name: "analyze",
+        requiredOutputs: [
+          "code_metrics",
+          "smell_detection",
+          "complexity_report"
+        ],
+        validationRules: [
+          (frame) => frame.metadata?.analysis_complete === true
+        ]
+      },
+      {
+        name: "plan",
+        requiredOutputs: ["refactor_plan", "risk_assessment"],
+        validationRules: [(frame) => frame.metadata?.plan_approved === true]
+      },
+      {
+        name: "refactor",
+        requiredOutputs: ["refactored_code", "preserved_tests"],
+        validationRules: [(frame) => frame.metadata?.tests_passing === true]
+      },
+      {
+        name: "validate",
+        requiredOutputs: ["before_after_metrics", "performance_comparison"],
+        validationRules: [
+          (frame) => frame.metadata?.metrics_improved === true,
+          (frame) => frame.metadata?.behavior_preserved === true
+        ],
+        autoTransition: true
+      }
+    ]
+  };
+  /**
+   * Start a workflow, creating the parent frame and first phase frame
+   */
+  async startWorkflow(template, parentFrameId) {
+    const workflowFrame = await this.frameManager.push(
+      {
+        type: "workflow",
+        description: `${template.name} workflow`,
+        metadata: {
+          workflow: template.name,
+          current_phase: 0,
+          phases: template.phases.map((p) => p.name),
+          started_at: (/* @__PURE__ */ new Date()).toISOString()
+        }
+      },
+      parentFrameId
+    );
+    await this.startPhase(workflowFrame.id, 0);
+    return workflowFrame;
+  }
+  /**
+   * Transition to next phase if current phase is complete
+   */
+  async transitionPhase(frameId) {
+    const frame = await this.frameManager.getFrame(frameId);
+    if (!frame || frame.type !== "workflow") return false;
+    const currentPhase = frame.metadata?.current_phase || 0;
+    const template = this.getTemplate(frame.metadata?.workflow);
+    if (!template) return false;
+    const phaseFrame = await this.getCurrentPhaseFrame(frameId);
+    if (!phaseFrame) return false;
+    const phase = template.phases[currentPhase];
+    const isComplete = await this.validatePhase(phaseFrame, phase);
+    if (!isComplete) {
+      console.log(`Phase ${phase.name} validation failed`);
+      return false;
+    }
+    await this.frameManager.close(phaseFrame.id, {
+      completed: true,
+      phase: phase.name
+    });
+    if (currentPhase >= template.phases.length - 1) {
+      await this.frameManager.close(frameId, {
+        workflow_complete: true,
+        completed_at: (/* @__PURE__ */ new Date()).toISOString()
+      });
+      return true;
+    }
+    await this.frameManager.updateMetadata(frameId, {
+      current_phase: currentPhase + 1
+    });
+    await this.startPhase(frameId, currentPhase + 1);
+    return true;
+  }
+  /**
+   * Start a specific phase within a workflow
+   */
+  async startPhase(workflowFrameId, phaseIndex) {
+    const frame = await this.frameManager.getFrame(workflowFrameId);
+    const template = this.getTemplate(frame?.metadata?.workflow);
+    if (!template || phaseIndex >= template.phases.length) {
+      throw new Error("Invalid phase index");
+    }
+    const phase = template.phases[phaseIndex];
+    return await this.frameManager.push(
+      {
+        type: "phase",
+        description: `Phase: ${phase.name}`,
+        metadata: {
+          phase_name: phase.name,
+          phase_index: phaseIndex,
+          required_outputs: phase.requiredOutputs,
+          started_at: (/* @__PURE__ */ new Date()).toISOString()
+        }
+      },
+      workflowFrameId
+    );
+  }
+  /**
+   * Validate a phase frame against its requirements
+   */
+  async validatePhase(frame, phase) {
+    if (phase.requiredOutputs) {
+      for (const output of phase.requiredOutputs) {
+        if (!frame.metadata?.[output]) {
+          return false;
+        }
+      }
+    }
+    if (phase.validationRules) {
+      for (const rule of phase.validationRules) {
+        if (!rule(frame)) {
+          return false;
+        }
+      }
+    }
+    return true;
+  }
+  /**
+   * Get current phase frame for a workflow
+   */
+  async getCurrentPhaseFrame(workflowFrameId) {
+    const children = await this.frameManager.getChildren(workflowFrameId);
+    return children.find((f) => f.type === "phase" && f.status === "open") || null;
+  }
+  /**
+   * Get template by name
+   */
+  getTemplate(name) {
+    if (!name) return null;
+    const templates = {
+      tdd: WorkflowTemplates.TDD,
+      feature: WorkflowTemplates.FEATURE,
+      bugfix: WorkflowTemplates.BUGFIX,
+      refactor: WorkflowTemplates.REFACTOR
+    };
+    return templates[name] || null;
+  }
+  /**
+   * List available workflow templates
+   */
+  static listTemplates() {
+    return [
+      WorkflowTemplates.TDD,
+      WorkflowTemplates.FEATURE,
+      WorkflowTemplates.BUGFIX,
+      WorkflowTemplates.REFACTOR
+    ];
+  }
+}
+export {
+  WorkflowTemplates
+};
+//# sourceMappingURL=workflow-templates.js.map

package/dist/core/frame/workflow-templates.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/core/frame/workflow-templates.ts"],
+  "sourcesContent": ["/**\n * Workflow Templates for StackMemory\n * Inspired by Continuous-Claude's structured approach\n *\n * Each workflow auto-creates child frames for phases\n * and enforces completion gates between transitions\n */\n\nimport { Frame } from '../types';\nimport { FrameManager } from './frame-manager';\n\nexport interface WorkflowPhase {\n  name: string;\n  requiredOutputs?: string[];\n  validationRules?: ((frame: Frame) => boolean)[];\n  autoTransition?: boolean;\n}\n\nexport interface WorkflowTemplate {\n  name: string;\n  description: string;\n  phases: WorkflowPhase[];\n  metadata?: Record<string, any>;\n}\n\nexport class WorkflowTemplates {\n  private frameManager: FrameManager;\n\n  constructor(frameManager: FrameManager) {\n    this.frameManager = frameManager;\n  }\n\n  /**\n   * TDD Workflow: Red \u2192 Green \u2192 Refactor\n   */\n  static TDD: WorkflowTemplate = {\n    name: 'tdd',\n    description: 'Test-Driven Development workflow',\n    phases: [\n      {\n        name: 'write-failing-tests',\n        requiredOutputs: ['test_file', 'test_count'],\n        validationRules: [(frame) => frame.metadata?.tests_failing === true],\n      },\n      {\n        name: 'implement-minimal',\n        requiredOutputs: ['implementation_file'],\n        validationRules: [(frame) => frame.metadata?.tests_passing === true],\n      },\n      {\n        name: 'refactor',\n        requiredOutputs: ['refactored_files'],\n        validationRules: [\n          (frame) => frame.metadata?.tests_passing === true,\n          (frame) => frame.metadata?.complexity_reduced === true,\n        ],\n        autoTransition: true,\n      },\n    ],\n  };\n\n  /**\n   * Feature Development Workflow\n   */\n  static FEATURE: WorkflowTemplate = {\n    name: 'feature',\n    description: 'Feature development workflow',\n    phases: [\n      {\n        name: 'research',\n        requiredOutputs: ['requirements', 'constraints', 'dependencies'],\n        validationRules: [\n          (frame) => frame.metadata?.research_complete === true,\n        ],\n      },\n      {\n        name: 'design',\n        requiredOutputs: ['architecture_decision', 'api_design'],\n        validationRules: [(frame) => frame.metadata?.design_reviewed === true],\n      },\n      {\n        name: 'implement',\n        requiredOutputs: ['implementation_files', 'tests'],\n        validationRules: [\n          (frame) => frame.metadata?.tests_passing === true,\n          (frame) => frame.metadata?.lint_passing === true,\n        ],\n      },\n      {\n        name: 'validate',\n        requiredOutputs: ['test_results', 'performance_metrics'],\n        validationRules: [\n          (frame) => frame.metadata?.validation_complete === true,\n        ],\n        autoTransition: true,\n      },\n    ],\n  };\n\n  /**\n   * Bug Fix Workflow\n   */\n  static BUGFIX: WorkflowTemplate = {\n    name: 'bugfix',\n    description: 'Bug fixing workflow',\n    phases: [\n      {\n        name: 'reproduce',\n        requiredOutputs: ['reproduction_steps', 'failing_test'],\n        validationRules: [(frame) => frame.metadata?.bug_reproduced === true],\n      },\n      {\n        name: 'diagnose',\n        requiredOutputs: ['root_cause', 'affected_code'],\n        validationRules: [(frame) => frame.metadata?.cause_identified === true],\n      },\n      {\n        name: 'fix',\n        requiredOutputs: ['fix_commits', 'updated_tests'],\n        validationRules: [(frame) => frame.metadata?.fix_applied === true],\n      },\n      {\n        name: 'verify',\n        requiredOutputs: ['verification_results', 'regression_tests'],\n        validationRules: [\n          (frame) => frame.metadata?.bug_fixed === true,\n          (frame) => frame.metadata?.no_regressions === true,\n        ],\n        autoTransition: true,\n      },\n    ],\n  };\n\n  /**\n   * Refactoring Workflow\n   */\n  static REFACTOR: WorkflowTemplate = {\n    name: 'refactor',\n    description: 'Code refactoring workflow',\n    phases: [\n      {\n        name: 'analyze',\n        requiredOutputs: [\n          'code_metrics',\n          'smell_detection',\n          'complexity_report',\n        ],\n        validationRules: [\n          (frame) => frame.metadata?.analysis_complete === true,\n        ],\n      },\n      {\n        name: 'plan',\n        requiredOutputs: ['refactor_plan', 'risk_assessment'],\n        validationRules: [(frame) => frame.metadata?.plan_approved === true],\n      },\n      {\n        name: 'refactor',\n        requiredOutputs: ['refactored_code', 'preserved_tests'],\n        validationRules: [(frame) => frame.metadata?.tests_passing === true],\n      },\n      {\n        name: 'validate',\n        requiredOutputs: ['before_after_metrics', 'performance_comparison'],\n        validationRules: [\n          (frame) => frame.metadata?.metrics_improved === true,\n          (frame) => frame.metadata?.behavior_preserved === true,\n        ],\n        autoTransition: true,\n      },\n    ],\n  };\n\n  /**\n   * Start a workflow, creating the parent frame and first phase frame\n   */\n  async startWorkflow(\n    template: WorkflowTemplate,\n    parentFrameId?: string\n  ): Promise<Frame> {\n    // Create parent workflow frame\n    const workflowFrame = await this.frameManager.push(\n      {\n        type: 'workflow',\n        description: `${template.name} workflow`,\n        metadata: {\n          workflow: template.name,\n          current_phase: 0,\n          phases: template.phases.map((p) => p.name),\n          started_at: new Date().toISOString(),\n        },\n      },\n      parentFrameId\n    );\n\n    // Auto-create first phase frame\n    await this.startPhase(workflowFrame.id, 0);\n\n    return workflowFrame;\n  }\n\n  /**\n   * Transition to next phase if current phase is complete\n   */\n  async transitionPhase(frameId: string): Promise<boolean> {\n    const frame = await this.frameManager.getFrame(frameId);\n    if (!frame || frame.type !== 'workflow') return false;\n\n    const currentPhase = frame.metadata?.current_phase || 0;\n    const template = this.getTemplate(frame.metadata?.workflow);\n    if (!template) return false;\n\n    // Validate current phase completion\n    const phaseFrame = await this.getCurrentPhaseFrame(frameId);\n    if (!phaseFrame) return false;\n\n    const phase = template.phases[currentPhase];\n    const isComplete = await this.validatePhase(phaseFrame, phase);\n\n    if (!isComplete) {\n      console.log(`Phase ${phase.name} validation failed`);\n      return false;\n    }\n\n    // Close current phase frame\n    await this.frameManager.close(phaseFrame.id, {\n      completed: true,\n      phase: phase.name,\n    });\n\n    // Check if workflow is complete\n    if (currentPhase >= template.phases.length - 1) {\n      await this.frameManager.close(frameId, {\n        workflow_complete: true,\n        completed_at: new Date().toISOString(),\n      });\n      return true;\n    }\n\n    // Start next phase\n    await this.frameManager.updateMetadata(frameId, {\n      current_phase: currentPhase + 1,\n    });\n    await this.startPhase(frameId, currentPhase + 1);\n\n    return true;\n  }\n\n  /**\n   * Start a specific phase within a workflow\n   */\n  private async startPhase(\n    workflowFrameId: string,\n    phaseIndex: number\n  ): Promise<Frame> {\n    const frame = await this.frameManager.getFrame(workflowFrameId);\n    const template = this.getTemplate(frame?.metadata?.workflow);\n    if (!template || phaseIndex >= template.phases.length) {\n      throw new Error('Invalid phase index');\n    }\n\n    const phase = template.phases[phaseIndex];\n    return await this.frameManager.push(\n      {\n        type: 'phase',\n        description: `Phase: ${phase.name}`,\n        metadata: {\n          phase_name: phase.name,\n          phase_index: phaseIndex,\n          required_outputs: phase.requiredOutputs,\n          started_at: new Date().toISOString(),\n        },\n      },\n      workflowFrameId\n    );\n  }\n\n  /**\n   * Validate a phase frame against its requirements\n   */\n  private async validatePhase(\n    frame: Frame,\n    phase: WorkflowPhase\n  ): Promise<boolean> {\n    // Check required outputs\n    if (phase.requiredOutputs) {\n      for (const output of phase.requiredOutputs) {\n        if (!frame.metadata?.[output]) {\n          return false;\n        }\n      }\n    }\n\n    // Run validation rules\n    if (phase.validationRules) {\n      for (const rule of phase.validationRules) {\n        if (!rule(frame)) {\n          return false;\n        }\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   * Get current phase frame for a workflow\n   */\n  private async getCurrentPhaseFrame(\n    workflowFrameId: string\n  ): Promise<Frame | null> {\n    const children = await this.frameManager.getChildren(workflowFrameId);\n    return (\n      children.find((f) => f.type === 'phase' && f.status === 'open') || null\n    );\n  }\n\n  /**\n   * Get template by name\n   */\n  private getTemplate(name?: string): WorkflowTemplate | null {\n    if (!name) return null;\n\n    const templates: Record<string, WorkflowTemplate> = {\n      tdd: WorkflowTemplates.TDD,\n      feature: WorkflowTemplates.FEATURE,\n      bugfix: WorkflowTemplates.BUGFIX,\n      refactor: WorkflowTemplates.REFACTOR,\n    };\n\n    return templates[name] || null;\n  }\n\n  /**\n   * List available workflow templates\n   */\n  static listTemplates(): WorkflowTemplate[] {\n    return [\n      WorkflowTemplates.TDD,\n      WorkflowTemplates.FEATURE,\n      WorkflowTemplates.BUGFIX,\n      WorkflowTemplates.REFACTOR,\n    ];\n  }\n}\n"],
+  "mappings": "AAyBO,MAAM,kBAAkB;AAAA,EACrB;AAAA,EAER,YAAY,cAA4B;AACtC,SAAK,eAAe;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,MAAwB;AAAA,IAC7B,MAAM;AAAA,IACN,aAAa;AAAA,IACb,QAAQ;AAAA,MACN;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,aAAa,YAAY;AAAA,QAC3C,iBAAiB,CAAC,CAAC,UAAU,MAAM,UAAU,kBAAkB,IAAI;AAAA,MACrE;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,qBAAqB;AAAA,QACvC,iBAAiB,CAAC,CAAC,UAAU,MAAM,UAAU,kBAAkB,IAAI;AAAA,MACrE;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,kBAAkB;AAAA,QACpC,iBAAiB;AAAA,UACf,CAAC,UAAU,MAAM,UAAU,kBAAkB;AAAA,UAC7C,CAAC,UAAU,MAAM,UAAU,uBAAuB;AAAA,QACpD;AAAA,QACA,gBAAgB;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,UAA4B;AAAA,IACjC,MAAM;AAAA,IACN,aAAa;AAAA,IACb,QAAQ;AAAA,MACN;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,gBAAgB,eAAe,cAAc;AAAA,QAC/D,iBAAiB;AAAA,UACf,CAAC,UAAU,MAAM,UAAU,sBAAsB;AAAA,QACnD;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,yBAAyB,YAAY;AAAA,QACvD,iBAAiB,CAAC,CAAC,UAAU,MAAM,UAAU,oBAAoB,IAAI;AAAA,MACvE;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,wBAAwB,OAAO;AAAA,QACjD,iBAAiB;AAAA,UACf,CAAC,UAAU,MAAM,UAAU,kBAAkB;AAAA,UAC7C,CAAC,UAAU,MAAM,UAAU,iBAAiB;AAAA,QAC9C;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,gBAAgB,qBAAqB;AAAA,QACvD,iBAAiB;AAAA,UACf,CAAC,UAAU,MAAM,UAAU,wBAAwB;AAAA,QACrD;AAAA,QACA,gBAAgB;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,SAA2B;AAAA,IAChC,MAAM;AAAA,IACN,aAAa;AAAA,IACb,QAAQ;AAAA,MACN;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,sBAAsB,cAAc;AAAA,QACtD,iBAAiB,CAAC,CAAC,UAAU,MAAM,UAAU,mBAAmB,IAAI;AAAA,MACtE;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,cAAc,eAAe;AAAA,QAC/C,iBAAiB,CAAC,CAAC,UAAU,MAAM,UAAU,qBAAqB,IAAI;AAAA,MACxE;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,eAAe,eAAe;AAAA,QAChD,iBAAiB,CAAC,CAAC,UAAU,MAAM,UAAU,gBAAgB,IAAI;AAAA,MACnE;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,wBAAwB,kBAAkB;AAAA,QAC5D,iBAAiB;AAAA,UACf,CAAC,UAAU,MAAM,UAAU,cAAc;AAAA,UACzC,CAAC,UAAU,MAAM,UAAU,mBAAmB;AAAA,QAChD;AAAA,QACA,gBAAgB;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,WAA6B;AAAA,IAClC,MAAM;AAAA,IACN,aAAa;AAAA,IACb,QAAQ;AAAA,MACN;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB;AAAA,UACf;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,QACA,iBAAiB;AAAA,UACf,CAAC,UAAU,MAAM,UAAU,sBAAsB;AAAA,QACnD;AAAA,MACF;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,iBAAiB,iBAAiB;AAAA,QACpD,iBAAiB,CAAC,CAAC,UAAU,MAAM,UAAU,kBAAkB,IAAI;AAAA,MACrE;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,mBAAmB,iBAAiB;AAAA,QACtD,iBAAiB,CAAC,CAAC,UAAU,MAAM,UAAU,kBAAkB,IAAI;AAAA,MACrE;AAAA,MACA;AAAA,QACE,MAAM;AAAA,QACN,iBAAiB,CAAC,wBAAwB,wBAAwB;AAAA,QAClE,iBAAiB;AAAA,UACf,CAAC,UAAU,MAAM,UAAU,qBAAqB;AAAA,UAChD,CAAC,UAAU,MAAM,UAAU,uBAAuB;AAAA,QACpD;AAAA,QACA,gBAAgB;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,cACJ,UACA,eACgB;AAEhB,UAAM,gBAAgB,MAAM,KAAK,aAAa;AAAA,MAC5C;AAAA,QACE,MAAM;AAAA,QACN,aAAa,GAAG,SAAS,IAAI;AAAA,QAC7B,UAAU;AAAA,UACR,UAAU,SAAS;AAAA,UACnB,eAAe;AAAA,UACf,QAAQ,SAAS,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,UACzC,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,QACrC;AAAA,MACF;AAAA,MACA;AAAA,IACF;AAGA,UAAM,KAAK,WAAW,cAAc,IAAI,CAAC;AAEzC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,gBAAgB,SAAmC;AACvD,UAAM,QAAQ,MAAM,KAAK,aAAa,SAAS,OAAO;AACtD,QAAI,CAAC,SAAS,MAAM,SAAS,WAAY,QAAO;AAEhD,UAAM,eAAe,MAAM,UAAU,iBAAiB;AACtD,UAAM,WAAW,KAAK,YAAY,MAAM,UAAU,QAAQ;AAC1D,QAAI,CAAC,SAAU,QAAO;AAGtB,UAAM,aAAa,MAAM,KAAK,qBAAqB,OAAO;AAC1D,QAAI,CAAC,WAAY,QAAO;AAExB,UAAM,QAAQ,SAAS,OAAO,YAAY;AAC1C,UAAM,aAAa,MAAM,KAAK,cAAc,YAAY,KAAK;AAE7D,QAAI,CAAC,YAAY;AACf,cAAQ,IAAI,SAAS,MAAM,IAAI,oBAAoB;AACnD,aAAO;AAAA,IACT;AAGA,UAAM,KAAK,aAAa,MAAM,WAAW,IAAI;AAAA,MAC3C,WAAW;AAAA,MACX,OAAO,MAAM;AAAA,IACf,CAAC;AAGD,QAAI,gBAAgB,SAAS,OAAO,SAAS,GAAG;AAC9C,YAAM,KAAK,aAAa,MAAM,SAAS;AAAA,QACrC,mBAAmB;AAAA,QACnB,eAAc,oBAAI,KAAK,GAAE,YAAY;AAAA,MACvC,CAAC;AACD,aAAO;AAAA,IACT;AAGA,UAAM,KAAK,aAAa,eAAe,SAAS;AAAA,MAC9C,eAAe,eAAe;AAAA,IAChC,CAAC;AACD,UAAM,KAAK,WAAW,SAAS,eAAe,CAAC;AAE/C,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,WACZ,iBACA,YACgB;AAChB,UAAM,QAAQ,MAAM,KAAK,aAAa,SAAS,eAAe;AAC9D,UAAM,WAAW,KAAK,YAAY,OAAO,UAAU,QAAQ;AAC3D,QAAI,CAAC,YAAY,cAAc,SAAS,OAAO,QAAQ;AACrD,YAAM,IAAI,MAAM,qBAAqB;AAAA,IACvC;AAEA,UAAM,QAAQ,SAAS,OAAO,UAAU;AACxC,WAAO,MAAM,KAAK,aAAa;AAAA,MAC7B;AAAA,QACE,MAAM;AAAA,QACN,aAAa,UAAU,MAAM,IAAI;AAAA,QACjC,UAAU;AAAA,UACR,YAAY,MAAM;AAAA,UAClB,aAAa;AAAA,UACb,kBAAkB,MAAM;AAAA,UACxB,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA,QACrC;AAAA,MACF;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,cACZ,OACA,OACkB;AAElB,QAAI,MAAM,iBAAiB;AACzB,iBAAW,UAAU,MAAM,iBAAiB;AAC1C,YAAI,CAAC,MAAM,WAAW,MAAM,GAAG;AAC7B,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAGA,QAAI,MAAM,iBAAiB;AACzB,iBAAW,QAAQ,MAAM,iBAAiB;AACxC,YAAI,CAAC,KAAK,KAAK,GAAG;AAChB,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,qBACZ,iBACuB;AACvB,UAAM,WAAW,MAAM,KAAK,aAAa,YAAY,eAAe;AACpE,WACE,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,WAAW,MAAM,KAAK;AAAA,EAEvE;AAAA;AAAA;AAAA;AAAA,EAKQ,YAAY,MAAwC;AAC1D,QAAI,CAAC,KAAM,QAAO;AAElB,UAAM,YAA8C;AAAA,MAClD,KAAK,kBAAkB;AAAA,MACvB,SAAS,kBAAkB;AAAA,MAC3B,QAAQ,kBAAkB;AAAA,MAC1B,UAAU,kBAAkB;AAAA,IAC9B;AAEA,WAAO,UAAU,IAAI,KAAK;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,gBAAoC;AACzC,WAAO;AAAA,MACL,kBAAkB;AAAA,MAClB,kBAAkB;AAAA,MAClB,kBAAkB;AAAA,MAClB,kBAAkB;AAAA,IACpB;AAAA,EACF;AACF;",
+  "names": []
+}

package/dist/core/merge/conflict-detector.js

@@ -286,7 +286,10 @@ class ConflictDetector {
         if (!tree.has(frame.parent_frame_id)) {
           tree.set(frame.parent_frame_id, /* @__PURE__ */ new Set());
         }
-        tree.get(frame.parent_frame_id).add(frame.frame_id);
+        const parentSet = tree.get(frame.parent_frame_id);
+        if (parentSet) {
+          parentSet.add(frame.frame_id);
+        }
       }
     }
     return tree;
@@ -299,7 +302,7 @@ class ConflictDetector {
     for (const [node, children1] of tree1) {
       if (tree2.has(node)) {
         const children2 = tree2.get(node);
-        if (!this.setsEqual(children1, children2)) {
+        if (children2 && !this.setsEqual(children1, children2)) {
           divergences.push({
             node1: node,
             node2: node,

package/dist/core/merge/conflict-detector.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/core/merge/conflict-detector.ts"],
-  "sourcesContent": ["/**\n * Conflict Detection Engine\n * Detects paradoxes in parallel frame timelines\n */\n\nimport { v4 as uuidv4 } from 'uuid';\nimport {\n  MergeConflict,\n  FrameStack,\n  ParallelSolution,\n  DecisionConflict,\n} from './types.js';\nimport { Frame, Event } from '../context/frame-manager.js';\nimport { logger } from '../monitoring/logger.js';\n\nexport class ConflictDetector {\n  private readonly SIMILARITY_THRESHOLD = 0.8;\n\n  /**\n   * Detect all types of conflicts between two frame stacks\n   */\n  detectConflicts(stack1: FrameStack, stack2: FrameStack): MergeConflict[] {\n    const conflicts: MergeConflict[] = [];\n\n    // Detect parallel solution conflicts\n    const parallelConflicts = this.detectParallelSolutions(stack1, stack2);\n    conflicts.push(...parallelConflicts);\n\n    // Detect conflicting decisions\n    const decisionConflicts = this.detectConflictingDecisions(\n      stack1.events,\n      stack2.events\n    );\n    conflicts.push(...decisionConflicts);\n\n    // Detect structural divergence\n    const structuralConflicts = this.detectStructuralDivergence(\n      stack1.frames,\n      stack2.frames\n    );\n    conflicts.push(...structuralConflicts);\n\n    logger.info(`Detected ${conflicts.length} conflicts between stacks`, {\n      stack1Id: stack1.id,\n      stack2Id: stack2.id,\n      conflictTypes: this.summarizeConflictTypes(conflicts),\n    });\n\n    return conflicts;\n  }\n\n  /**\n   * Analyze frames to find parallel solutions to the same problem\n   */\n  analyzeParallelSolutions(frames: Frame[]): ParallelSolution[] {\n    const solutions: ParallelSolution[] = [];\n\n    // Group frames by similar purpose/name\n    const groupedFrames = this.groupSimilarFrames(frames);\n\n    for (const group of groupedFrames) {\n      if (group.length > 1) {\n        // Multiple frames solving similar problems\n        group.forEach((frame) => {\n          solutions.push({\n            frameId: frame.frame_id,\n            solution: this.extractSolution(frame),\n            approach: this.analyzeApproach(frame),\n            author: frame.inputs?.author || 'unknown',\n            timestamp: frame.created_at,\n            effectiveness: this.calculateEffectiveness(frame),\n          });\n        });\n      }\n    }\n\n    return solutions;\n  }\n\n  /**\n   * Identify conflicting decisions in event streams\n   */\n  identifyConflictingDecisions(events: Event[]): DecisionConflict[] {\n    const conflicts: DecisionConflict[] = [];\n    const decisions = this.extractDecisions(events);\n\n    for (let i = 0; i < decisions.length; i++) {\n      for (let j = i + 1; j < decisions.length; j++) {\n        if (this.decisionsConflict(decisions[i], decisions[j])) {\n          conflicts.push({\n            decision1: decisions[i].payload?.decision || '',\n            decision2: decisions[j].payload?.decision || '',\n            impact: this.assessImpact(decisions[i], decisions[j]),\n            canCoexist: this.canCoexist(decisions[i], decisions[j]),\n          });\n        }\n      }\n    }\n\n    return conflicts;\n  }\n\n  /**\n   * Detect parallel solutions between two stacks\n   */\n  private detectParallelSolutions(\n    stack1: FrameStack,\n    stack2: FrameStack\n  ): MergeConflict[] {\n    const conflicts: MergeConflict[] = [];\n\n    // Find frames that appear to solve the same problem\n    for (const frame1 of stack1.frames) {\n      for (const frame2 of stack2.frames) {\n        if (\n          this.framesAreSimilar(frame1, frame2) &&\n          !this.framesAreIdentical(frame1, frame2)\n        ) {\n          conflicts.push({\n            id: uuidv4(),\n            type: 'parallel_solution',\n            frameId1: frame1.frame_id,\n            frameId2: frame2.frame_id,\n            severity: this.calculateParallelSeverity(frame1, frame2),\n            description: `Parallel solutions detected: \"${frame1.name}\" vs \"${frame2.name}\"`,\n            detectedAt: Date.now(),\n            conflictingPaths: this.extractPaths(frame1, frame2),\n          });\n        }\n      }\n    }\n\n    return conflicts;\n  }\n\n  /**\n   * Detect conflicting decisions between event streams\n   */\n  private detectConflictingDecisions(\n    events1: Event[],\n    events2: Event[]\n  ): MergeConflict[] {\n    const conflicts: MergeConflict[] = [];\n    const decisions1 = this.extractDecisions(events1);\n    const decisions2 = this.extractDecisions(events2);\n\n    for (const d1 of decisions1) {\n      for (const d2 of decisions2) {\n        if (this.decisionsConflict(d1, d2)) {\n          conflicts.push({\n            id: uuidv4(),\n            type: 'conflicting_decision',\n            frameId1: d1.frame_id,\n            frameId2: d2.frame_id,\n            severity: this.assessImpact(d1, d2) as\n              | 'low'\n              | 'medium'\n              | 'high'\n              | 'critical',\n            description: `Conflicting decisions: \"${d1.payload?.decision}\" vs \"${d2.payload?.decision}\"`,\n            detectedAt: Date.now(),\n          });\n        }\n      }\n    }\n\n    return conflicts;\n  }\n\n  /**\n   * Detect structural divergence in frame hierarchies\n   */\n  private detectStructuralDivergence(\n    frames1: Frame[],\n    frames2: Frame[]\n  ): MergeConflict[] {\n    const conflicts: MergeConflict[] = [];\n\n    // Build frame trees\n    const tree1 = this.buildFrameTree(frames1);\n    const tree2 = this.buildFrameTree(frames2);\n\n    // Find divergence points\n    const divergences = this.findDivergences(tree1, tree2);\n\n    for (const divergence of divergences) {\n      conflicts.push({\n        id: uuidv4(),\n        type: 'structural_divergence',\n        frameId1: divergence.node1,\n        frameId2: divergence.node2,\n        severity: this.calculateDivergenceSeverity(divergence),\n        description: `Structural divergence at depth ${divergence.depth}`,\n        detectedAt: Date.now(),\n      });\n    }\n\n    return conflicts;\n  }\n\n  /**\n   * Helper: Check if two frames are similar (solving same problem)\n   */\n  private framesAreSimilar(frame1: Frame, frame2: Frame): boolean {\n    // Check name similarity\n    const nameSimilarity = this.calculateSimilarity(frame1.name, frame2.name);\n    if (nameSimilarity > this.SIMILARITY_THRESHOLD) return true;\n\n    // Check type and parent\n    if (\n      frame1.type === frame2.type &&\n      frame1.parent_frame_id === frame2.parent_frame_id\n    ) {\n      return true;\n    }\n\n    // Check inputs similarity\n    const inputSimilarity = this.compareInputs(frame1.inputs, frame2.inputs);\n    return inputSimilarity > this.SIMILARITY_THRESHOLD;\n  }\n\n  /**\n   * Helper: Check if frames are identical\n   */\n  private framesAreIdentical(frame1: Frame, frame2: Frame): boolean {\n    return frame1.frame_id === frame2.frame_id;\n  }\n\n  /**\n   * Helper: Calculate string similarity (Levenshtein-based)\n   */\n  private calculateSimilarity(str1: string, str2: string): number {\n    const maxLen = Math.max(str1.length, str2.length);\n    if (maxLen === 0) return 1;\n\n    const distance = this.levenshteinDistance(str1, str2);\n    return 1 - distance / maxLen;\n  }\n\n  /**\n   * Helper: Levenshtein distance implementation\n   */\n  private levenshteinDistance(str1: string, str2: string): number {\n    const matrix: number[][] = [];\n\n    for (let i = 0; i <= str2.length; i++) {\n      matrix[i] = [i];\n    }\n\n    for (let j = 0; j <= str1.length; j++) {\n      matrix[0][j] = j;\n    }\n\n    for (let i = 1; i <= str2.length; i++) {\n      for (let j = 1; j <= str1.length; j++) {\n        if (str2.charAt(i - 1) === str1.charAt(j - 1)) {\n          matrix[i][j] = matrix[i - 1][j - 1];\n        } else {\n          matrix[i][j] = Math.min(\n            matrix[i - 1][j - 1] + 1,\n            matrix[i][j - 1] + 1,\n            matrix[i - 1][j] + 1\n          );\n        }\n      }\n    }\n\n    return matrix[str2.length][str1.length];\n  }\n\n  /**\n   * Helper: Compare frame inputs\n   */\n  private compareInputs(\n    inputs1: Record<string, any>,\n    inputs2: Record<string, any>\n  ): number {\n    const keys1 = Object.keys(inputs1 || {});\n    const keys2 = Object.keys(inputs2 || {});\n    const allKeys = new Set([...keys1, ...keys2]);\n\n    if (allKeys.size === 0) return 1;\n\n    let matches = 0;\n    for (const key of allKeys) {\n      if (JSON.stringify(inputs1[key]) === JSON.stringify(inputs2[key])) {\n        matches++;\n      }\n    }\n\n    return matches / allKeys.size;\n  }\n\n  /**\n   * Helper: Calculate severity for parallel solutions\n   */\n  private calculateParallelSeverity(\n    frame1: Frame,\n    frame2: Frame\n  ): 'low' | 'medium' | 'high' | 'critical' {\n    // Critical if both are completed and have different outputs\n    if (frame1.state === 'closed' && frame2.state === 'closed') {\n      const outputSimilarity = this.compareInputs(\n        frame1.outputs,\n        frame2.outputs\n      );\n      if (outputSimilarity < 0.5) return 'critical';\n      if (outputSimilarity < 0.7) return 'high';\n    }\n\n    // High if different approaches to same parent task\n    if (frame1.parent_frame_id === frame2.parent_frame_id) {\n      return 'high';\n    }\n\n    return 'medium';\n  }\n\n  /**\n   * Helper: Extract decision events\n   */\n  private extractDecisions(events: Event[]): Event[] {\n    return events.filter(\n      (e) =>\n        e.event_type === 'decision' ||\n        e.payload?.type === 'decision' ||\n        e.payload?.decision !== undefined\n    );\n  }\n\n  /**\n   * Helper: Check if two decisions conflict\n   */\n  private decisionsConflict(d1: Event, d2: Event): boolean {\n    // Check if decisions affect same resource/path\n    const resource1 = d1.payload?.resource || d1.payload?.path;\n    const resource2 = d2.payload?.resource || d2.payload?.path;\n\n    if (resource1 && resource2 && resource1 === resource2) {\n      // Different decisions on same resource\n      return d1.payload?.decision !== d2.payload?.decision;\n    }\n\n    // Check for logical conflicts\n    return this.hasLogicalConflict(d1.payload, d2.payload);\n  }\n\n  /**\n   * Helper: Check for logical conflicts in payloads\n   */\n  private hasLogicalConflict(payload1: any, payload2: any): boolean {\n    // Architecture decisions\n    if (payload1?.architecture && payload2?.architecture) {\n      return payload1.architecture !== payload2.architecture;\n    }\n\n    // Technology choices\n    if (payload1?.technology && payload2?.technology) {\n      return payload1.technology !== payload2.technology;\n    }\n\n    return false;\n  }\n\n  /**\n   * Helper: Assess impact of conflicting decisions\n   */\n  private assessImpact(d1: Event, d2: Event): 'low' | 'medium' | 'high' {\n    // High impact for architecture/design decisions\n    if (\n      d1.payload?.type === 'architecture' ||\n      d2.payload?.type === 'architecture'\n    ) {\n      return 'high';\n    }\n\n    // Medium for implementation decisions\n    if (\n      d1.payload?.scope === 'implementation' ||\n      d2.payload?.scope === 'implementation'\n    ) {\n      return 'medium';\n    }\n\n    return 'low';\n  }\n\n  /**\n   * Helper: Check if decisions can coexist\n   */\n  private canCoexist(d1: Event, d2: Event): boolean {\n    // Different scopes can coexist\n    if (d1.payload?.scope !== d2.payload?.scope) {\n      return true;\n    }\n\n    // Non-conflicting resources can coexist\n    const resource1 = d1.payload?.resource;\n    const resource2 = d2.payload?.resource;\n\n    return resource1 !== resource2;\n  }\n\n  /**\n   * Helper: Build frame tree structure\n   */\n  private buildFrameTree(frames: Frame[]): Map<string, Set<string>> {\n    const tree = new Map<string, Set<string>>();\n\n    for (const frame of frames) {\n      if (frame.parent_frame_id) {\n        if (!tree.has(frame.parent_frame_id)) {\n          tree.set(frame.parent_frame_id, new Set());\n        }\n        tree.get(frame.parent_frame_id)!.add(frame.frame_id);\n      }\n    }\n\n    return tree;\n  }\n\n  /**\n   * Helper: Find divergence points in trees\n   */\n  private findDivergences(\n    tree1: Map<string, Set<string>>,\n    tree2: Map<string, Set<string>>\n  ): Array<{ node1: string; node2: string; depth: number }> {\n    const divergences: Array<{ node1: string; node2: string; depth: number }> =\n      [];\n\n    // Find nodes that exist in both but have different children\n    for (const [node, children1] of tree1) {\n      if (tree2.has(node)) {\n        const children2 = tree2.get(node)!;\n        if (!this.setsEqual(children1, children2)) {\n          divergences.push({\n            node1: node,\n            node2: node,\n            depth: this.calculateDepth(node, tree1),\n          });\n        }\n      }\n    }\n\n    return divergences;\n  }\n\n  /**\n   * Helper: Check if two sets are equal\n   */\n  private setsEqual<T>(set1: Set<T>, set2: Set<T>): boolean {\n    if (set1.size !== set2.size) return false;\n    for (const item of set1) {\n      if (!set2.has(item)) return false;\n    }\n    return true;\n  }\n\n  /**\n   * Helper: Calculate node depth in tree\n   */\n  private calculateDepth(node: string, tree: Map<string, Set<string>>): number {\n    let depth = 0;\n    let current = node;\n\n    // Find parent of current node\n    for (const [parent, children] of tree) {\n      if (children.has(current)) {\n        depth++;\n        current = parent;\n      }\n    }\n\n    return depth;\n  }\n\n  /**\n   * Helper: Calculate divergence severity\n   */\n  private calculateDivergenceSeverity(\n    divergence: any\n  ): 'low' | 'medium' | 'high' | 'critical' {\n    if (divergence.depth === 0) return 'critical'; // Root divergence\n    if (divergence.depth === 1) return 'high';\n    if (divergence.depth === 2) return 'medium';\n    return 'low';\n  }\n\n  /**\n   * Helper: Extract paths from frames\n   */\n  private extractPaths(frame1: Frame, frame2: Frame): string[] {\n    const paths: string[] = [];\n\n    if (frame1.inputs?.path) paths.push(frame1.inputs.path);\n    if (frame2.inputs?.path) paths.push(frame2.inputs.path);\n    if (frame1.outputs?.files) paths.push(...frame1.outputs.files);\n    if (frame2.outputs?.files) paths.push(...frame2.outputs.files);\n\n    return [...new Set(paths)];\n  }\n\n  /**\n   * Helper: Extract solution from frame\n   */\n  private extractSolution(frame: Frame): string {\n    return (\n      frame.outputs?.solution || frame.digest_text || 'No solution description'\n    );\n  }\n\n  /**\n   * Helper: Analyze approach taken\n   */\n  private analyzeApproach(frame: Frame): string {\n    if (frame.outputs?.approach) return frame.outputs.approach;\n    if (frame.type === 'debug') return 'Debug approach';\n    if (frame.type === 'review') return 'Review approach';\n    return 'Standard approach';\n  }\n\n  /**\n   * Helper: Calculate solution effectiveness\n   */\n  private calculateEffectiveness(frame: Frame): number {\n    let score = 0.5; // Base score\n\n    // Completed frames are more effective\n    if (frame.state === 'closed') score += 0.2;\n\n    // Frames with outputs are more effective\n    if (frame.outputs && Object.keys(frame.outputs).length > 0) score += 0.1;\n\n    // Frames with digests are more effective\n    if (frame.digest_text) score += 0.1;\n\n    // Quick completion is more effective\n    if (frame.closed_at && frame.created_at) {\n      const duration = frame.closed_at - frame.created_at;\n      if (duration < 300000) score += 0.1; // Less than 5 minutes\n    }\n\n    return Math.min(score, 1);\n  }\n\n  /**\n   * Helper: Group similar frames together\n   */\n  private groupSimilarFrames(frames: Frame[]): Frame[][] {\n    const groups: Frame[][] = [];\n    const processed = new Set<string>();\n\n    for (const frame of frames) {\n      if (processed.has(frame.frame_id)) continue;\n\n      const group = [frame];\n      processed.add(frame.frame_id);\n\n      for (const other of frames) {\n        if (\n          !processed.has(other.frame_id) &&\n          this.framesAreSimilar(frame, other)\n        ) {\n          group.push(other);\n          processed.add(other.frame_id);\n        }\n      }\n\n      groups.push(group);\n    }\n\n    return groups;\n  }\n\n  /**\n   * Helper: Summarize conflict types\n   */\n  private summarizeConflictTypes(\n    conflicts: MergeConflict[]\n  ): Record<string, number> {\n    const summary: Record<string, number> = {\n      parallel_solution: 0,\n      conflicting_decision: 0,\n      structural_divergence: 0,\n    };\n\n    for (const conflict of conflicts) {\n      summary[conflict.type]++;\n    }\n\n    return summary;\n  }\n}\n"],
-  "mappings": "AAKA,SAAS,MAAM,cAAc;AAQ7B,SAAS,cAAc;AAEhB,MAAM,iBAAiB;AAAA,EACX,uBAAuB;AAAA;AAAA;AAAA;AAAA,EAKxC,gBAAgB,QAAoB,QAAqC;AACvE,UAAM,YAA6B,CAAC;AAGpC,UAAM,oBAAoB,KAAK,wBAAwB,QAAQ,MAAM;AACrE,cAAU,KAAK,GAAG,iBAAiB;AAGnC,UAAM,oBAAoB,KAAK;AAAA,MAC7B,OAAO;AAAA,MACP,OAAO;AAAA,IACT;AACA,cAAU,KAAK,GAAG,iBAAiB;AAGnC,UAAM,sBAAsB,KAAK;AAAA,MAC/B,OAAO;AAAA,MACP,OAAO;AAAA,IACT;AACA,cAAU,KAAK,GAAG,mBAAmB;AAErC,WAAO,KAAK,YAAY,UAAU,MAAM,6BAA6B;AAAA,MACnE,UAAU,OAAO;AAAA,MACjB,UAAU,OAAO;AAAA,MACjB,eAAe,KAAK,uBAAuB,SAAS;AAAA,IACtD,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,yBAAyB,QAAqC;AAC5D,UAAM,YAAgC,CAAC;AAGvC,UAAM,gBAAgB,KAAK,mBAAmB,MAAM;AAEpD,eAAW,SAAS,eAAe;AACjC,UAAI,MAAM,SAAS,GAAG;AAEpB,cAAM,QAAQ,CAAC,UAAU;AACvB,oBAAU,KAAK;AAAA,YACb,SAAS,MAAM;AAAA,YACf,UAAU,KAAK,gBAAgB,KAAK;AAAA,YACpC,UAAU,KAAK,gBAAgB,KAAK;AAAA,YACpC,QAAQ,MAAM,QAAQ,UAAU;AAAA,YAChC,WAAW,MAAM;AAAA,YACjB,eAAe,KAAK,uBAAuB,KAAK;AAAA,UAClD,CAAC;AAAA,QACH,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,6BAA6B,QAAqC;AAChE,UAAM,YAAgC,CAAC;AACvC,UAAM,YAAY,KAAK,iBAAiB,MAAM;AAE9C,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,eAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC7C,YAAI,KAAK,kBAAkB,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG;AACtD,oBAAU,KAAK;AAAA,YACb,WAAW,UAAU,CAAC,EAAE,SAAS,YAAY;AAAA,YAC7C,WAAW,UAAU,CAAC,EAAE,SAAS,YAAY;AAAA,YAC7C,QAAQ,KAAK,aAAa,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC;AAAA,YACpD,YAAY,KAAK,WAAW,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC;AAAA,UACxD,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,wBACN,QACA,QACiB;AACjB,UAAM,YAA6B,CAAC;AAGpC,eAAW,UAAU,OAAO,QAAQ;AAClC,iBAAW,UAAU,OAAO,QAAQ;AAClC,YACE,KAAK,iBAAiB,QAAQ,MAAM,KACpC,CAAC,KAAK,mBAAmB,QAAQ,MAAM,GACvC;AACA,oBAAU,KAAK;AAAA,YACb,IAAI,OAAO;AAAA,YACX,MAAM;AAAA,YACN,UAAU,OAAO;AAAA,YACjB,UAAU,OAAO;AAAA,YACjB,UAAU,KAAK,0BAA0B,QAAQ,MAAM;AAAA,YACvD,aAAa,iCAAiC,OAAO,IAAI,SAAS,OAAO,IAAI;AAAA,YAC7E,YAAY,KAAK,IAAI;AAAA,YACrB,kBAAkB,KAAK,aAAa,QAAQ,MAAM;AAAA,UACpD,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,2BACN,SACA,SACiB;AACjB,UAAM,YAA6B,CAAC;AACpC,UAAM,aAAa,KAAK,iBAAiB,OAAO;AAChD,UAAM,aAAa,KAAK,iBAAiB,OAAO;AAEhD,eAAW,MAAM,YAAY;AAC3B,iBAAW,MAAM,YAAY;AAC3B,YAAI,KAAK,kBAAkB,IAAI,EAAE,GAAG;AAClC,oBAAU,KAAK;AAAA,YACb,IAAI,OAAO;AAAA,YACX,MAAM;AAAA,YACN,UAAU,GAAG;AAAA,YACb,UAAU,GAAG;AAAA,YACb,UAAU,KAAK,aAAa,IAAI,EAAE;AAAA,YAKlC,aAAa,2BAA2B,GAAG,SAAS,QAAQ,SAAS,GAAG,SAAS,QAAQ;AAAA,YACzF,YAAY,KAAK,IAAI;AAAA,UACvB,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,2BACN,SACA,SACiB;AACjB,UAAM,YAA6B,CAAC;AAGpC,UAAM,QAAQ,KAAK,eAAe,OAAO;AACzC,UAAM,QAAQ,KAAK,eAAe,OAAO;AAGzC,UAAM,cAAc,KAAK,gBAAgB,OAAO,KAAK;AAErD,eAAW,cAAc,aAAa;AACpC,gBAAU,KAAK;AAAA,QACb,IAAI,OAAO;AAAA,QACX,MAAM;AAAA,QACN,UAAU,WAAW;AAAA,QACrB,UAAU,WAAW;AAAA,QACrB,UAAU,KAAK,4BAA4B,UAAU;AAAA,QACrD,aAAa,kCAAkC,WAAW,KAAK;AAAA,QAC/D,YAAY,KAAK,IAAI;AAAA,MACvB,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,QAAe,QAAwB;AAE9D,UAAM,iBAAiB,KAAK,oBAAoB,OAAO,MAAM,OAAO,IAAI;AACxE,QAAI,iBAAiB,KAAK,qBAAsB,QAAO;AAGvD,QACE,OAAO,SAAS,OAAO,QACvB,OAAO,oBAAoB,OAAO,iBAClC;AACA,aAAO;AAAA,IACT;AAGA,UAAM,kBAAkB,KAAK,cAAc,OAAO,QAAQ,OAAO,MAAM;AACvE,WAAO,kBAAkB,KAAK;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA,EAKQ,mBAAmB,QAAe,QAAwB;AAChE,WAAO,OAAO,aAAa,OAAO;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,MAAc,MAAsB;AAC9D,UAAM,SAAS,KAAK,IAAI,KAAK,QAAQ,KAAK,MAAM;AAChD,QAAI,WAAW,EAAG,QAAO;AAEzB,UAAM,WAAW,KAAK,oBAAoB,MAAM,IAAI;AACpD,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,MAAc,MAAsB;AAC9D,UAAM,SAAqB,CAAC;AAE5B,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,aAAO,CAAC,IAAI,CAAC,CAAC;AAAA,IAChB;AAEA,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,aAAO,CAAC,EAAE,CAAC,IAAI;AAAA,IACjB;AAEA,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,eAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,YAAI,KAAK,OAAO,IAAI,CAAC,MAAM,KAAK,OAAO,IAAI,CAAC,GAAG;AAC7C,iBAAO,CAAC,EAAE,CAAC,IAAI,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA,QACpC,OAAO;AACL,iBAAO,CAAC,EAAE,CAAC,IAAI,KAAK;AAAA,YAClB,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA,YACvB,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA,YACnB,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI;AAAA,UACrB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO,OAAO,KAAK,MAAM,EAAE,KAAK,MAAM;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA,EAKQ,cACN,SACA,SACQ;AACR,UAAM,QAAQ,OAAO,KAAK,WAAW,CAAC,CAAC;AACvC,UAAM,QAAQ,OAAO,KAAK,WAAW,CAAC,CAAC;AACvC,UAAM,UAAU,oBAAI,IAAI,CAAC,GAAG,OAAO,GAAG,KAAK,CAAC;AAE5C,QAAI,QAAQ,SAAS,EAAG,QAAO;AAE/B,QAAI,UAAU;AACd,eAAW,OAAO,SAAS;AACzB,UAAI,KAAK,UAAU,QAAQ,GAAG,CAAC,MAAM,KAAK,UAAU,QAAQ,GAAG,CAAC,GAAG;AACjE;AAAA,MACF;AAAA,IACF;AAEA,WAAO,UAAU,QAAQ;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKQ,0BACN,QACA,QACwC;AAExC,QAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;AAC1D,YAAM,mBAAmB,KAAK;AAAA,QAC5B,OAAO;AAAA,QACP,OAAO;AAAA,MACT;AACA,UAAI,mBAAmB,IAAK,QAAO;AACnC,UAAI,mBAAmB,IAAK,QAAO;AAAA,IACrC;AAGA,QAAI,OAAO,oBAAoB,OAAO,iBAAiB;AACrD,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,QAA0B;AACjD,WAAO,OAAO;AAAA,MACZ,CAAC,MACC,EAAE,eAAe,cACjB,EAAE,SAAS,SAAS,cACpB,EAAE,SAAS,aAAa;AAAA,IAC5B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,kBAAkB,IAAW,IAAoB;AAEvD,UAAM,YAAY,GAAG,SAAS,YAAY,GAAG,SAAS;AACtD,UAAM,YAAY,GAAG,SAAS,YAAY,GAAG,SAAS;AAEtD,QAAI,aAAa,aAAa,cAAc,WAAW;AAErD,aAAO,GAAG,SAAS,aAAa,GAAG,SAAS;AAAA,IAC9C;AAGA,WAAO,KAAK,mBAAmB,GAAG,SAAS,GAAG,OAAO;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA,EAKQ,mBAAmB,UAAe,UAAwB;AAEhE,QAAI,UAAU,gBAAgB,UAAU,cAAc;AACpD,aAAO,SAAS,iBAAiB,SAAS;AAAA,IAC5C;AAGA,QAAI,UAAU,cAAc,UAAU,YAAY;AAChD,aAAO,SAAS,eAAe,SAAS;AAAA,IAC1C;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,IAAW,IAAsC;AAEpE,QACE,GAAG,SAAS,SAAS,kBACrB,GAAG,SAAS,SAAS,gBACrB;AACA,aAAO;AAAA,IACT;AAGA,QACE,GAAG,SAAS,UAAU,oBACtB,GAAG,SAAS,UAAU,kBACtB;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAW,IAAW,IAAoB;AAEhD,QAAI,GAAG,SAAS,UAAU,GAAG,SAAS,OAAO;AAC3C,aAAO;AAAA,IACT;AAGA,UAAM,YAAY,GAAG,SAAS;AAC9B,UAAM,YAAY,GAAG,SAAS;AAE9B,WAAO,cAAc;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKQ,eAAe,QAA2C;AAChE,UAAM,OAAO,oBAAI,IAAyB;AAE1C,eAAW,SAAS,QAAQ;AAC1B,UAAI,MAAM,iBAAiB;AACzB,YAAI,CAAC,KAAK,IAAI,MAAM,eAAe,GAAG;AACpC,eAAK,IAAI,MAAM,iBAAiB,oBAAI,IAAI,CAAC;AAAA,QAC3C;AACA,aAAK,IAAI,MAAM,eAAe,EAAG,IAAI,MAAM,QAAQ;AAAA,MACrD;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,OACA,OACwD;AACxD,UAAM,cACJ,CAAC;AAGH,eAAW,CAAC,MAAM,SAAS,KAAK,OAAO;AACrC,UAAI,MAAM,IAAI,IAAI,GAAG;AACnB,cAAM,YAAY,MAAM,IAAI,IAAI;AAChC,YAAI,CAAC,KAAK,UAAU,WAAW,SAAS,GAAG;AACzC,sBAAY,KAAK;AAAA,YACf,OAAO;AAAA,YACP,OAAO;AAAA,YACP,OAAO,KAAK,eAAe,MAAM,KAAK;AAAA,UACxC,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,UAAa,MAAc,MAAuB;AACxD,QAAI,KAAK,SAAS,KAAK,KAAM,QAAO;AACpC,eAAW,QAAQ,MAAM;AACvB,UAAI,CAAC,KAAK,IAAI,IAAI,EAAG,QAAO;AAAA,IAC9B;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,eAAe,MAAc,MAAwC;AAC3E,QAAI,QAAQ;AACZ,QAAI,UAAU;AAGd,eAAW,CAAC,QAAQ,QAAQ,KAAK,MAAM;AACrC,UAAI,SAAS,IAAI,OAAO,GAAG;AACzB;AACA,kBAAU;AAAA,MACZ;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,4BACN,YACwC;AACxC,QAAI,WAAW,UAAU,EAAG,QAAO;AACnC,QAAI,WAAW,UAAU,EAAG,QAAO;AACnC,QAAI,WAAW,UAAU,EAAG,QAAO;AACnC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,QAAe,QAAyB;AAC3D,UAAM,QAAkB,CAAC;AAEzB,QAAI,OAAO,QAAQ,KAAM,OAAM,KAAK,OAAO,OAAO,IAAI;AACtD,QAAI,OAAO,QAAQ,KAAM,OAAM,KAAK,OAAO,OAAO,IAAI;AACtD,QAAI,OAAO,SAAS,MAAO,OAAM,KAAK,GAAG,OAAO,QAAQ,KAAK;AAC7D,QAAI,OAAO,SAAS,MAAO,OAAM,KAAK,GAAG,OAAO,QAAQ,KAAK;AAE7D,WAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,OAAsB;AAC5C,WACE,MAAM,SAAS,YAAY,MAAM,eAAe;AAAA,EAEpD;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,OAAsB;AAC5C,QAAI,MAAM,SAAS,SAAU,QAAO,MAAM,QAAQ;AAClD,QAAI,MAAM,SAAS,QAAS,QAAO;AACnC,QAAI,MAAM,SAAS,SAAU,QAAO;AACpC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,uBAAuB,OAAsB;AACnD,QAAI,QAAQ;AAGZ,QAAI,MAAM,UAAU,SAAU,UAAS;AAGvC,QAAI,MAAM,WAAW,OAAO,KAAK,MAAM,OAAO,EAAE,SAAS,EAAG,UAAS;AAGrE,QAAI,MAAM,YAAa,UAAS;AAGhC,QAAI,MAAM,aAAa,MAAM,YAAY;AACvC,YAAM,WAAW,MAAM,YAAY,MAAM;AACzC,UAAI,WAAW,IAAQ,UAAS;AAAA,IAClC;AAEA,WAAO,KAAK,IAAI,OAAO,CAAC;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKQ,mBAAmB,QAA4B;AACrD,UAAM,SAAoB,CAAC;AAC3B,UAAM,YAAY,oBAAI,IAAY;AAElC,eAAW,SAAS,QAAQ;AAC1B,UAAI,UAAU,IAAI,MAAM,QAAQ,EAAG;AAEnC,YAAM,QAAQ,CAAC,KAAK;AACpB,gBAAU,IAAI,MAAM,QAAQ;AAE5B,iBAAW,SAAS,QAAQ;AAC1B,YACE,CAAC,UAAU,IAAI,MAAM,QAAQ,KAC7B,KAAK,iBAAiB,OAAO,KAAK,GAClC;AACA,gBAAM,KAAK,KAAK;AAChB,oBAAU,IAAI,MAAM,QAAQ;AAAA,QAC9B;AAAA,MACF;AAEA,aAAO,KAAK,KAAK;AAAA,IACnB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,uBACN,WACwB;AACxB,UAAM,UAAkC;AAAA,MACtC,mBAAmB;AAAA,MACnB,sBAAsB;AAAA,MACtB,uBAAuB;AAAA,IACzB;AAEA,eAAW,YAAY,WAAW;AAChC,cAAQ,SAAS,IAAI;AAAA,IACvB;AAEA,WAAO;AAAA,EACT;AACF;",
+  "sourcesContent": ["/**\n * Conflict Detection Engine\n * Detects paradoxes in parallel frame timelines\n */\n\nimport { v4 as uuidv4 } from 'uuid';\nimport {\n  MergeConflict,\n  FrameStack,\n  ParallelSolution,\n  DecisionConflict,\n} from './types.js';\nimport { Frame, Event } from '../context/frame-manager.js';\nimport { logger } from '../monitoring/logger.js';\n\nexport class ConflictDetector {\n  private readonly SIMILARITY_THRESHOLD = 0.8;\n\n  /**\n   * Detect all types of conflicts between two frame stacks\n   */\n  detectConflicts(stack1: FrameStack, stack2: FrameStack): MergeConflict[] {\n    const conflicts: MergeConflict[] = [];\n\n    // Detect parallel solution conflicts\n    const parallelConflicts = this.detectParallelSolutions(stack1, stack2);\n    conflicts.push(...parallelConflicts);\n\n    // Detect conflicting decisions\n    const decisionConflicts = this.detectConflictingDecisions(\n      stack1.events,\n      stack2.events\n    );\n    conflicts.push(...decisionConflicts);\n\n    // Detect structural divergence\n    const structuralConflicts = this.detectStructuralDivergence(\n      stack1.frames,\n      stack2.frames\n    );\n    conflicts.push(...structuralConflicts);\n\n    logger.info(`Detected ${conflicts.length} conflicts between stacks`, {\n      stack1Id: stack1.id,\n      stack2Id: stack2.id,\n      conflictTypes: this.summarizeConflictTypes(conflicts),\n    });\n\n    return conflicts;\n  }\n\n  /**\n   * Analyze frames to find parallel solutions to the same problem\n   */\n  analyzeParallelSolutions(frames: Frame[]): ParallelSolution[] {\n    const solutions: ParallelSolution[] = [];\n\n    // Group frames by similar purpose/name\n    const groupedFrames = this.groupSimilarFrames(frames);\n\n    for (const group of groupedFrames) {\n      if (group.length > 1) {\n        // Multiple frames solving similar problems\n        group.forEach((frame) => {\n          solutions.push({\n            frameId: frame.frame_id,\n            solution: this.extractSolution(frame),\n            approach: this.analyzeApproach(frame),\n            author: frame.inputs?.author || 'unknown',\n            timestamp: frame.created_at,\n            effectiveness: this.calculateEffectiveness(frame),\n          });\n        });\n      }\n    }\n\n    return solutions;\n  }\n\n  /**\n   * Identify conflicting decisions in event streams\n   */\n  identifyConflictingDecisions(events: Event[]): DecisionConflict[] {\n    const conflicts: DecisionConflict[] = [];\n    const decisions = this.extractDecisions(events);\n\n    for (let i = 0; i < decisions.length; i++) {\n      for (let j = i + 1; j < decisions.length; j++) {\n        if (this.decisionsConflict(decisions[i], decisions[j])) {\n          conflicts.push({\n            decision1: decisions[i].payload?.decision || '',\n            decision2: decisions[j].payload?.decision || '',\n            impact: this.assessImpact(decisions[i], decisions[j]),\n            canCoexist: this.canCoexist(decisions[i], decisions[j]),\n          });\n        }\n      }\n    }\n\n    return conflicts;\n  }\n\n  /**\n   * Detect parallel solutions between two stacks\n   */\n  private detectParallelSolutions(\n    stack1: FrameStack,\n    stack2: FrameStack\n  ): MergeConflict[] {\n    const conflicts: MergeConflict[] = [];\n\n    // Find frames that appear to solve the same problem\n    for (const frame1 of stack1.frames) {\n      for (const frame2 of stack2.frames) {\n        if (\n          this.framesAreSimilar(frame1, frame2) &&\n          !this.framesAreIdentical(frame1, frame2)\n        ) {\n          conflicts.push({\n            id: uuidv4(),\n            type: 'parallel_solution',\n            frameId1: frame1.frame_id,\n            frameId2: frame2.frame_id,\n            severity: this.calculateParallelSeverity(frame1, frame2),\n            description: `Parallel solutions detected: \"${frame1.name}\" vs \"${frame2.name}\"`,\n            detectedAt: Date.now(),\n            conflictingPaths: this.extractPaths(frame1, frame2),\n          });\n        }\n      }\n    }\n\n    return conflicts;\n  }\n\n  /**\n   * Detect conflicting decisions between event streams\n   */\n  private detectConflictingDecisions(\n    events1: Event[],\n    events2: Event[]\n  ): MergeConflict[] {\n    const conflicts: MergeConflict[] = [];\n    const decisions1 = this.extractDecisions(events1);\n    const decisions2 = this.extractDecisions(events2);\n\n    for (const d1 of decisions1) {\n      for (const d2 of decisions2) {\n        if (this.decisionsConflict(d1, d2)) {\n          conflicts.push({\n            id: uuidv4(),\n            type: 'conflicting_decision',\n            frameId1: d1.frame_id,\n            frameId2: d2.frame_id,\n            severity: this.assessImpact(d1, d2) as\n              | 'low'\n              | 'medium'\n              | 'high'\n              | 'critical',\n            description: `Conflicting decisions: \"${d1.payload?.decision}\" vs \"${d2.payload?.decision}\"`,\n            detectedAt: Date.now(),\n          });\n        }\n      }\n    }\n\n    return conflicts;\n  }\n\n  /**\n   * Detect structural divergence in frame hierarchies\n   */\n  private detectStructuralDivergence(\n    frames1: Frame[],\n    frames2: Frame[]\n  ): MergeConflict[] {\n    const conflicts: MergeConflict[] = [];\n\n    // Build frame trees\n    const tree1 = this.buildFrameTree(frames1);\n    const tree2 = this.buildFrameTree(frames2);\n\n    // Find divergence points\n    const divergences = this.findDivergences(tree1, tree2);\n\n    for (const divergence of divergences) {\n      conflicts.push({\n        id: uuidv4(),\n        type: 'structural_divergence',\n        frameId1: divergence.node1,\n        frameId2: divergence.node2,\n        severity: this.calculateDivergenceSeverity(divergence),\n        description: `Structural divergence at depth ${divergence.depth}`,\n        detectedAt: Date.now(),\n      });\n    }\n\n    return conflicts;\n  }\n\n  /**\n   * Helper: Check if two frames are similar (solving same problem)\n   */\n  private framesAreSimilar(frame1: Frame, frame2: Frame): boolean {\n    // Check name similarity\n    const nameSimilarity = this.calculateSimilarity(frame1.name, frame2.name);\n    if (nameSimilarity > this.SIMILARITY_THRESHOLD) return true;\n\n    // Check type and parent\n    if (\n      frame1.type === frame2.type &&\n      frame1.parent_frame_id === frame2.parent_frame_id\n    ) {\n      return true;\n    }\n\n    // Check inputs similarity\n    const inputSimilarity = this.compareInputs(frame1.inputs, frame2.inputs);\n    return inputSimilarity > this.SIMILARITY_THRESHOLD;\n  }\n\n  /**\n   * Helper: Check if frames are identical\n   */\n  private framesAreIdentical(frame1: Frame, frame2: Frame): boolean {\n    return frame1.frame_id === frame2.frame_id;\n  }\n\n  /**\n   * Helper: Calculate string similarity (Levenshtein-based)\n   */\n  private calculateSimilarity(str1: string, str2: string): number {\n    const maxLen = Math.max(str1.length, str2.length);\n    if (maxLen === 0) return 1;\n\n    const distance = this.levenshteinDistance(str1, str2);\n    return 1 - distance / maxLen;\n  }\n\n  /**\n   * Helper: Levenshtein distance implementation\n   */\n  private levenshteinDistance(str1: string, str2: string): number {\n    const matrix: number[][] = [];\n\n    for (let i = 0; i <= str2.length; i++) {\n      matrix[i] = [i];\n    }\n\n    for (let j = 0; j <= str1.length; j++) {\n      matrix[0][j] = j;\n    }\n\n    for (let i = 1; i <= str2.length; i++) {\n      for (let j = 1; j <= str1.length; j++) {\n        if (str2.charAt(i - 1) === str1.charAt(j - 1)) {\n          matrix[i][j] = matrix[i - 1][j - 1];\n        } else {\n          matrix[i][j] = Math.min(\n            matrix[i - 1][j - 1] + 1,\n            matrix[i][j - 1] + 1,\n            matrix[i - 1][j] + 1\n          );\n        }\n      }\n    }\n\n    return matrix[str2.length][str1.length];\n  }\n\n  /**\n   * Helper: Compare frame inputs\n   */\n  private compareInputs(\n    inputs1: Record<string, unknown>,\n    inputs2: Record<string, unknown>\n  ): number {\n    const keys1 = Object.keys(inputs1 || {});\n    const keys2 = Object.keys(inputs2 || {});\n    const allKeys = new Set([...keys1, ...keys2]);\n\n    if (allKeys.size === 0) return 1;\n\n    let matches = 0;\n    for (const key of allKeys) {\n      if (JSON.stringify(inputs1[key]) === JSON.stringify(inputs2[key])) {\n        matches++;\n      }\n    }\n\n    return matches / allKeys.size;\n  }\n\n  /**\n   * Helper: Calculate severity for parallel solutions\n   */\n  private calculateParallelSeverity(\n    frame1: Frame,\n    frame2: Frame\n  ): 'low' | 'medium' | 'high' | 'critical' {\n    // Critical if both are completed and have different outputs\n    if (frame1.state === 'closed' && frame2.state === 'closed') {\n      const outputSimilarity = this.compareInputs(\n        frame1.outputs,\n        frame2.outputs\n      );\n      if (outputSimilarity < 0.5) return 'critical';\n      if (outputSimilarity < 0.7) return 'high';\n    }\n\n    // High if different approaches to same parent task\n    if (frame1.parent_frame_id === frame2.parent_frame_id) {\n      return 'high';\n    }\n\n    return 'medium';\n  }\n\n  /**\n   * Helper: Extract decision events\n   */\n  private extractDecisions(events: Event[]): Event[] {\n    return events.filter(\n      (e) =>\n        e.event_type === 'decision' ||\n        e.payload?.type === 'decision' ||\n        e.payload?.decision !== undefined\n    );\n  }\n\n  /**\n   * Helper: Check if two decisions conflict\n   */\n  private decisionsConflict(d1: Event, d2: Event): boolean {\n    // Check if decisions affect same resource/path\n    const resource1 = d1.payload?.resource || d1.payload?.path;\n    const resource2 = d2.payload?.resource || d2.payload?.path;\n\n    if (resource1 && resource2 && resource1 === resource2) {\n      // Different decisions on same resource\n      return d1.payload?.decision !== d2.payload?.decision;\n    }\n\n    // Check for logical conflicts\n    return this.hasLogicalConflict(d1.payload, d2.payload);\n  }\n\n  /**\n   * Helper: Check for logical conflicts in payloads\n   */\n  private hasLogicalConflict(payload1: unknown, payload2: unknown): boolean {\n    // Architecture decisions\n    if (payload1?.architecture && payload2?.architecture) {\n      return payload1.architecture !== payload2.architecture;\n    }\n\n    // Technology choices\n    if (payload1?.technology && payload2?.technology) {\n      return payload1.technology !== payload2.technology;\n    }\n\n    return false;\n  }\n\n  /**\n   * Helper: Assess impact of conflicting decisions\n   */\n  private assessImpact(d1: Event, d2: Event): 'low' | 'medium' | 'high' {\n    // High impact for architecture/design decisions\n    if (\n      d1.payload?.type === 'architecture' ||\n      d2.payload?.type === 'architecture'\n    ) {\n      return 'high';\n    }\n\n    // Medium for implementation decisions\n    if (\n      d1.payload?.scope === 'implementation' ||\n      d2.payload?.scope === 'implementation'\n    ) {\n      return 'medium';\n    }\n\n    return 'low';\n  }\n\n  /**\n   * Helper: Check if decisions can coexist\n   */\n  private canCoexist(d1: Event, d2: Event): boolean {\n    // Different scopes can coexist\n    if (d1.payload?.scope !== d2.payload?.scope) {\n      return true;\n    }\n\n    // Non-conflicting resources can coexist\n    const resource1 = d1.payload?.resource;\n    const resource2 = d2.payload?.resource;\n\n    return resource1 !== resource2;\n  }\n\n  /**\n   * Helper: Build frame tree structure\n   */\n  private buildFrameTree(frames: Frame[]): Map<string, Set<string>> {\n    const tree = new Map<string, Set<string>>();\n\n    for (const frame of frames) {\n      if (frame.parent_frame_id) {\n        if (!tree.has(frame.parent_frame_id)) {\n          tree.set(frame.parent_frame_id, new Set());\n        }\n        const parentSet = tree.get(frame.parent_frame_id);\n        if (parentSet) {\n          parentSet.add(frame.frame_id);\n        }\n      }\n    }\n\n    return tree;\n  }\n\n  /**\n   * Helper: Find divergence points in trees\n   */\n  private findDivergences(\n    tree1: Map<string, Set<string>>,\n    tree2: Map<string, Set<string>>\n  ): Array<{ node1: string; node2: string; depth: number }> {\n    const divergences: Array<{ node1: string; node2: string; depth: number }> =\n      [];\n\n    // Find nodes that exist in both but have different children\n    for (const [node, children1] of tree1) {\n      if (tree2.has(node)) {\n        const children2 = tree2.get(node);\n        if (children2 && !this.setsEqual(children1, children2)) {\n          divergences.push({\n            node1: node,\n            node2: node,\n            depth: this.calculateDepth(node, tree1),\n          });\n        }\n      }\n    }\n\n    return divergences;\n  }\n\n  /**\n   * Helper: Check if two sets are equal\n   */\n  private setsEqual<T>(set1: Set<T>, set2: Set<T>): boolean {\n    if (set1.size !== set2.size) return false;\n    for (const item of set1) {\n      if (!set2.has(item)) return false;\n    }\n    return true;\n  }\n\n  /**\n   * Helper: Calculate node depth in tree\n   */\n  private calculateDepth(node: string, tree: Map<string, Set<string>>): number {\n    let depth = 0;\n    let current = node;\n\n    // Find parent of current node\n    for (const [parent, children] of tree) {\n      if (children.has(current)) {\n        depth++;\n        current = parent;\n      }\n    }\n\n    return depth;\n  }\n\n  /**\n   * Helper: Calculate divergence severity\n   */\n  private calculateDivergenceSeverity(divergence: {\n    depth: number;\n  }): 'low' | 'medium' | 'high' | 'critical' {\n    if (divergence.depth === 0) return 'critical'; // Root divergence\n    if (divergence.depth === 1) return 'high';\n    if (divergence.depth === 2) return 'medium';\n    return 'low';\n  }\n\n  /**\n   * Helper: Extract paths from frames\n   */\n  private extractPaths(frame1: Frame, frame2: Frame): string[] {\n    const paths: string[] = [];\n\n    if (frame1.inputs?.path) paths.push(frame1.inputs.path);\n    if (frame2.inputs?.path) paths.push(frame2.inputs.path);\n    if (frame1.outputs?.files) paths.push(...frame1.outputs.files);\n    if (frame2.outputs?.files) paths.push(...frame2.outputs.files);\n\n    return [...new Set(paths)];\n  }\n\n  /**\n   * Helper: Extract solution from frame\n   */\n  private extractSolution(frame: Frame): string {\n    return (\n      frame.outputs?.solution || frame.digest_text || 'No solution description'\n    );\n  }\n\n  /**\n   * Helper: Analyze approach taken\n   */\n  private analyzeApproach(frame: Frame): string {\n    if (frame.outputs?.approach) return frame.outputs.approach;\n    if (frame.type === 'debug') return 'Debug approach';\n    if (frame.type === 'review') return 'Review approach';\n    return 'Standard approach';\n  }\n\n  /**\n   * Helper: Calculate solution effectiveness\n   */\n  private calculateEffectiveness(frame: Frame): number {\n    let score = 0.5; // Base score\n\n    // Completed frames are more effective\n    if (frame.state === 'closed') score += 0.2;\n\n    // Frames with outputs are more effective\n    if (frame.outputs && Object.keys(frame.outputs).length > 0) score += 0.1;\n\n    // Frames with digests are more effective\n    if (frame.digest_text) score += 0.1;\n\n    // Quick completion is more effective\n    if (frame.closed_at && frame.created_at) {\n      const duration = frame.closed_at - frame.created_at;\n      if (duration < 300000) score += 0.1; // Less than 5 minutes\n    }\n\n    return Math.min(score, 1);\n  }\n\n  /**\n   * Helper: Group similar frames together\n   */\n  private groupSimilarFrames(frames: Frame[]): Frame[][] {\n    const groups: Frame[][] = [];\n    const processed = new Set<string>();\n\n    for (const frame of frames) {\n      if (processed.has(frame.frame_id)) continue;\n\n      const group = [frame];\n      processed.add(frame.frame_id);\n\n      for (const other of frames) {\n        if (\n          !processed.has(other.frame_id) &&\n          this.framesAreSimilar(frame, other)\n        ) {\n          group.push(other);\n          processed.add(other.frame_id);\n        }\n      }\n\n      groups.push(group);\n    }\n\n    return groups;\n  }\n\n  /**\n   * Helper: Summarize conflict types\n   */\n  private summarizeConflictTypes(\n    conflicts: MergeConflict[]\n  ): Record<string, number> {\n    const summary: Record<string, number> = {\n      parallel_solution: 0,\n      conflicting_decision: 0,\n      structural_divergence: 0,\n    };\n\n    for (const conflict of conflicts) {\n      summary[conflict.type]++;\n    }\n\n    return summary;\n  }\n}\n"],
+  "mappings": "AAKA,SAAS,MAAM,cAAc;AAQ7B,SAAS,cAAc;AAEhB,MAAM,iBAAiB;AAAA,EACX,uBAAuB;AAAA;AAAA;AAAA;AAAA,EAKxC,gBAAgB,QAAoB,QAAqC;AACvE,UAAM,YAA6B,CAAC;AAGpC,UAAM,oBAAoB,KAAK,wBAAwB,QAAQ,MAAM;AACrE,cAAU,KAAK,GAAG,iBAAiB;AAGnC,UAAM,oBAAoB,KAAK;AAAA,MAC7B,OAAO;AAAA,MACP,OAAO;AAAA,IACT;AACA,cAAU,KAAK,GAAG,iBAAiB;AAGnC,UAAM,sBAAsB,KAAK;AAAA,MAC/B,OAAO;AAAA,MACP,OAAO;AAAA,IACT;AACA,cAAU,KAAK,GAAG,mBAAmB;AAErC,WAAO,KAAK,YAAY,UAAU,MAAM,6BAA6B;AAAA,MACnE,UAAU,OAAO;AAAA,MACjB,UAAU,OAAO;AAAA,MACjB,eAAe,KAAK,uBAAuB,SAAS;AAAA,IACtD,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,yBAAyB,QAAqC;AAC5D,UAAM,YAAgC,CAAC;AAGvC,UAAM,gBAAgB,KAAK,mBAAmB,MAAM;AAEpD,eAAW,SAAS,eAAe;AACjC,UAAI,MAAM,SAAS,GAAG;AAEpB,cAAM,QAAQ,CAAC,UAAU;AACvB,oBAAU,KAAK;AAAA,YACb,SAAS,MAAM;AAAA,YACf,UAAU,KAAK,gBAAgB,KAAK;AAAA,YACpC,UAAU,KAAK,gBAAgB,KAAK;AAAA,YACpC,QAAQ,MAAM,QAAQ,UAAU;AAAA,YAChC,WAAW,MAAM;AAAA,YACjB,eAAe,KAAK,uBAAuB,KAAK;AAAA,UAClD,CAAC;AAAA,QACH,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,6BAA6B,QAAqC;AAChE,UAAM,YAAgC,CAAC;AACvC,UAAM,YAAY,KAAK,iBAAiB,MAAM;AAE9C,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,eAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC7C,YAAI,KAAK,kBAAkB,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG;AACtD,oBAAU,KAAK;AAAA,YACb,WAAW,UAAU,CAAC,EAAE,SAAS,YAAY;AAAA,YAC7C,WAAW,UAAU,CAAC,EAAE,SAAS,YAAY;AAAA,YAC7C,QAAQ,KAAK,aAAa,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC;AAAA,YACpD,YAAY,KAAK,WAAW,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC;AAAA,UACxD,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,wBACN,QACA,QACiB;AACjB,UAAM,YAA6B,CAAC;AAGpC,eAAW,UAAU,OAAO,QAAQ;AAClC,iBAAW,UAAU,OAAO,QAAQ;AAClC,YACE,KAAK,iBAAiB,QAAQ,MAAM,KACpC,CAAC,KAAK,mBAAmB,QAAQ,MAAM,GACvC;AACA,oBAAU,KAAK;AAAA,YACb,IAAI,OAAO;AAAA,YACX,MAAM;AAAA,YACN,UAAU,OAAO;AAAA,YACjB,UAAU,OAAO;AAAA,YACjB,UAAU,KAAK,0BAA0B,QAAQ,MAAM;AAAA,YACvD,aAAa,iCAAiC,OAAO,IAAI,SAAS,OAAO,IAAI;AAAA,YAC7E,YAAY,KAAK,IAAI;AAAA,YACrB,kBAAkB,KAAK,aAAa,QAAQ,MAAM;AAAA,UACpD,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,2BACN,SACA,SACiB;AACjB,UAAM,YAA6B,CAAC;AACpC,UAAM,aAAa,KAAK,iBAAiB,OAAO;AAChD,UAAM,aAAa,KAAK,iBAAiB,OAAO;AAEhD,eAAW,MAAM,YAAY;AAC3B,iBAAW,MAAM,YAAY;AAC3B,YAAI,KAAK,kBAAkB,IAAI,EAAE,GAAG;AAClC,oBAAU,KAAK;AAAA,YACb,IAAI,OAAO;AAAA,YACX,MAAM;AAAA,YACN,UAAU,GAAG;AAAA,YACb,UAAU,GAAG;AAAA,YACb,UAAU,KAAK,aAAa,IAAI,EAAE;AAAA,YAKlC,aAAa,2BAA2B,GAAG,SAAS,QAAQ,SAAS,GAAG,SAAS,QAAQ;AAAA,YACzF,YAAY,KAAK,IAAI;AAAA,UACvB,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,2BACN,SACA,SACiB;AACjB,UAAM,YAA6B,CAAC;AAGpC,UAAM,QAAQ,KAAK,eAAe,OAAO;AACzC,UAAM,QAAQ,KAAK,eAAe,OAAO;AAGzC,UAAM,cAAc,KAAK,gBAAgB,OAAO,KAAK;AAErD,eAAW,cAAc,aAAa;AACpC,gBAAU,KAAK;AAAA,QACb,IAAI,OAAO;AAAA,QACX,MAAM;AAAA,QACN,UAAU,WAAW;AAAA,QACrB,UAAU,WAAW;AAAA,QACrB,UAAU,KAAK,4BAA4B,UAAU;AAAA,QACrD,aAAa,kCAAkC,WAAW,KAAK;AAAA,QAC/D,YAAY,KAAK,IAAI;AAAA,MACvB,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,QAAe,QAAwB;AAE9D,UAAM,iBAAiB,KAAK,oBAAoB,OAAO,MAAM,OAAO,IAAI;AACxE,QAAI,iBAAiB,KAAK,qBAAsB,QAAO;AAGvD,QACE,OAAO,SAAS,OAAO,QACvB,OAAO,oBAAoB,OAAO,iBAClC;AACA,aAAO;AAAA,IACT;AAGA,UAAM,kBAAkB,KAAK,cAAc,OAAO,QAAQ,OAAO,MAAM;AACvE,WAAO,kBAAkB,KAAK;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA,EAKQ,mBAAmB,QAAe,QAAwB;AAChE,WAAO,OAAO,aAAa,OAAO;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,MAAc,MAAsB;AAC9D,UAAM,SAAS,KAAK,IAAI,KAAK,QAAQ,KAAK,MAAM;AAChD,QAAI,WAAW,EAAG,QAAO;AAEzB,UAAM,WAAW,KAAK,oBAAoB,MAAM,IAAI;AACpD,WAAO,IAAI,WAAW;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,MAAc,MAAsB;AAC9D,UAAM,SAAqB,CAAC;AAE5B,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,aAAO,CAAC,IAAI,CAAC,CAAC;AAAA,IAChB;AAEA,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,aAAO,CAAC,EAAE,CAAC,IAAI;AAAA,IACjB;AAEA,aAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,eAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,YAAI,KAAK,OAAO,IAAI,CAAC,MAAM,KAAK,OAAO,IAAI,CAAC,GAAG;AAC7C,iBAAO,CAAC,EAAE,CAAC,IAAI,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA,QACpC,OAAO;AACL,iBAAO,CAAC,EAAE,CAAC,IAAI,KAAK;AAAA,YAClB,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA,YACvB,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA,YACnB,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI;AAAA,UACrB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO,OAAO,KAAK,MAAM,EAAE,KAAK,MAAM;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA,EAKQ,cACN,SACA,SACQ;AACR,UAAM,QAAQ,OAAO,KAAK,WAAW,CAAC,CAAC;AACvC,UAAM,QAAQ,OAAO,KAAK,WAAW,CAAC,CAAC;AACvC,UAAM,UAAU,oBAAI,IAAI,CAAC,GAAG,OAAO,GAAG,KAAK,CAAC;AAE5C,QAAI,QAAQ,SAAS,EAAG,QAAO;AAE/B,QAAI,UAAU;AACd,eAAW,OAAO,SAAS;AACzB,UAAI,KAAK,UAAU,QAAQ,GAAG,CAAC,MAAM,KAAK,UAAU,QAAQ,GAAG,CAAC,GAAG;AACjE;AAAA,MACF;AAAA,IACF;AAEA,WAAO,UAAU,QAAQ;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKQ,0BACN,QACA,QACwC;AAExC,QAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;AAC1D,YAAM,mBAAmB,KAAK;AAAA,QAC5B,OAAO;AAAA,QACP,OAAO;AAAA,MACT;AACA,UAAI,mBAAmB,IAAK,QAAO;AACnC,UAAI,mBAAmB,IAAK,QAAO;AAAA,IACrC;AAGA,QAAI,OAAO,oBAAoB,OAAO,iBAAiB;AACrD,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,QAA0B;AACjD,WAAO,OAAO;AAAA,MACZ,CAAC,MACC,EAAE,eAAe,cACjB,EAAE,SAAS,SAAS,cACpB,EAAE,SAAS,aAAa;AAAA,IAC5B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,kBAAkB,IAAW,IAAoB;AAEvD,UAAM,YAAY,GAAG,SAAS,YAAY,GAAG,SAAS;AACtD,UAAM,YAAY,GAAG,SAAS,YAAY,GAAG,SAAS;AAEtD,QAAI,aAAa,aAAa,cAAc,WAAW;AAErD,aAAO,GAAG,SAAS,aAAa,GAAG,SAAS;AAAA,IAC9C;AAGA,WAAO,KAAK,mBAAmB,GAAG,SAAS,GAAG,OAAO;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA,EAKQ,mBAAmB,UAAmB,UAA4B;AAExE,QAAI,UAAU,gBAAgB,UAAU,cAAc;AACpD,aAAO,SAAS,iBAAiB,SAAS;AAAA,IAC5C;AAGA,QAAI,UAAU,cAAc,UAAU,YAAY;AAChD,aAAO,SAAS,eAAe,SAAS;AAAA,IAC1C;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,IAAW,IAAsC;AAEpE,QACE,GAAG,SAAS,SAAS,kBACrB,GAAG,SAAS,SAAS,gBACrB;AACA,aAAO;AAAA,IACT;AAGA,QACE,GAAG,SAAS,UAAU,oBACtB,GAAG,SAAS,UAAU,kBACtB;AACA,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAW,IAAW,IAAoB;AAEhD,QAAI,GAAG,SAAS,UAAU,GAAG,SAAS,OAAO;AAC3C,aAAO;AAAA,IACT;AAGA,UAAM,YAAY,GAAG,SAAS;AAC9B,UAAM,YAAY,GAAG,SAAS;AAE9B,WAAO,cAAc;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKQ,eAAe,QAA2C;AAChE,UAAM,OAAO,oBAAI,IAAyB;AAE1C,eAAW,SAAS,QAAQ;AAC1B,UAAI,MAAM,iBAAiB;AACzB,YAAI,CAAC,KAAK,IAAI,MAAM,eAAe,GAAG;AACpC,eAAK,IAAI,MAAM,iBAAiB,oBAAI,IAAI,CAAC;AAAA,QAC3C;AACA,cAAM,YAAY,KAAK,IAAI,MAAM,eAAe;AAChD,YAAI,WAAW;AACb,oBAAU,IAAI,MAAM,QAAQ;AAAA,QAC9B;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,OACA,OACwD;AACxD,UAAM,cACJ,CAAC;AAGH,eAAW,CAAC,MAAM,SAAS,KAAK,OAAO;AACrC,UAAI,MAAM,IAAI,IAAI,GAAG;AACnB,cAAM,YAAY,MAAM,IAAI,IAAI;AAChC,YAAI,aAAa,CAAC,KAAK,UAAU,WAAW,SAAS,GAAG;AACtD,sBAAY,KAAK;AAAA,YACf,OAAO;AAAA,YACP,OAAO;AAAA,YACP,OAAO,KAAK,eAAe,MAAM,KAAK;AAAA,UACxC,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,UAAa,MAAc,MAAuB;AACxD,QAAI,KAAK,SAAS,KAAK,KAAM,QAAO;AACpC,eAAW,QAAQ,MAAM;AACvB,UAAI,CAAC,KAAK,IAAI,IAAI,EAAG,QAAO;AAAA,IAC9B;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,eAAe,MAAc,MAAwC;AAC3E,QAAI,QAAQ;AACZ,QAAI,UAAU;AAGd,eAAW,CAAC,QAAQ,QAAQ,KAAK,MAAM;AACrC,UAAI,SAAS,IAAI,OAAO,GAAG;AACzB;AACA,kBAAU;AAAA,MACZ;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,4BAA4B,YAEO;AACzC,QAAI,WAAW,UAAU,EAAG,QAAO;AACnC,QAAI,WAAW,UAAU,EAAG,QAAO;AACnC,QAAI,WAAW,UAAU,EAAG,QAAO;AACnC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,QAAe,QAAyB;AAC3D,UAAM,QAAkB,CAAC;AAEzB,QAAI,OAAO,QAAQ,KAAM,OAAM,KAAK,OAAO,OAAO,IAAI;AACtD,QAAI,OAAO,QAAQ,KAAM,OAAM,KAAK,OAAO,OAAO,IAAI;AACtD,QAAI,OAAO,SAAS,MAAO,OAAM,KAAK,GAAG,OAAO,QAAQ,KAAK;AAC7D,QAAI,OAAO,SAAS,MAAO,OAAM,KAAK,GAAG,OAAO,QAAQ,KAAK;AAE7D,WAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,OAAsB;AAC5C,WACE,MAAM,SAAS,YAAY,MAAM,eAAe;AAAA,EAEpD;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,OAAsB;AAC5C,QAAI,MAAM,SAAS,SAAU,QAAO,MAAM,QAAQ;AAClD,QAAI,MAAM,SAAS,QAAS,QAAO;AACnC,QAAI,MAAM,SAAS,SAAU,QAAO;AACpC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,uBAAuB,OAAsB;AACnD,QAAI,QAAQ;AAGZ,QAAI,MAAM,UAAU,SAAU,UAAS;AAGvC,QAAI,MAAM,WAAW,OAAO,KAAK,MAAM,OAAO,EAAE,SAAS,EAAG,UAAS;AAGrE,QAAI,MAAM,YAAa,UAAS;AAGhC,QAAI,MAAM,aAAa,MAAM,YAAY;AACvC,YAAM,WAAW,MAAM,YAAY,MAAM;AACzC,UAAI,WAAW,IAAQ,UAAS;AAAA,IAClC;AAEA,WAAO,KAAK,IAAI,OAAO,CAAC;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKQ,mBAAmB,QAA4B;AACrD,UAAM,SAAoB,CAAC;AAC3B,UAAM,YAAY,oBAAI,IAAY;AAElC,eAAW,SAAS,QAAQ;AAC1B,UAAI,UAAU,IAAI,MAAM,QAAQ,EAAG;AAEnC,YAAM,QAAQ,CAAC,KAAK;AACpB,gBAAU,IAAI,MAAM,QAAQ;AAE5B,iBAAW,SAAS,QAAQ;AAC1B,YACE,CAAC,UAAU,IAAI,MAAM,QAAQ,KAC7B,KAAK,iBAAiB,OAAO,KAAK,GAClC;AACA,gBAAM,KAAK,KAAK;AAChB,oBAAU,IAAI,MAAM,QAAQ;AAAA,QAC9B;AAAA,MACF;AAEA,aAAO,KAAK,KAAK;AAAA,IACnB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,uBACN,WACwB;AACxB,UAAM,UAAkC;AAAA,MACtC,mBAAmB;AAAA,MACnB,sBAAsB;AAAA,MACtB,uBAAuB;AAAA,IACzB;AAEA,eAAW,YAAY,WAAW;AAChC,cAAQ,SAAS,IAAI;AAAA,IACvB;AAEA,WAAO;AAAA,EACT;AACF;",
   "names": []
 }

package/dist/core/merge/resolution-engine.js

@@ -119,7 +119,6 @@ class ResolutionEngine {
       votes: context.teamVotes
     };
     for (const conflict of conflicts) {
-      const winner = this.determineVoteWinner(conflict, voteResults);
       conflict.resolution = {
         strategy,
         resolvedBy: "team_consensus",
@@ -143,11 +142,7 @@ class ResolutionEngine {
     if (context.userRole !== "senior" && context.userRole !== "lead") {
       throw new Error("Senior override requires senior or lead role");
     }
-    const preferredStack = this.determinePreferredStack(
-      stack1,
-      stack2,
-      context
-    );
+    this.determinePreferredStack(stack1, stack2, context);
     const strategy = {
       type: "senior_override",
       confidence: 0.95,
@@ -408,7 +403,7 @@ class ResolutionEngine {
   /**
    * Get AI recommendation for specific conflict
    */
-  getAIRecommendation(conflict, analysis) {
+  getAIRecommendation(conflict) {
     switch (conflict.type) {
       case "parallel_solution":
         return "Recommend keeping both solutions for A/B testing";
@@ -423,14 +418,8 @@ class ResolutionEngine {
   /**
    * Create rollback point before merge
    */
-  createRollbackPoint(stack1, stack2) {
+  createRollbackPoint(_stack1, _stack2) {
     const rollbackId = uuidv4();
-    const rollbackData = {
-      id: rollbackId,
-      timestamp: Date.now(),
-      stack1: JSON.parse(JSON.stringify(stack1)),
-      stack2: JSON.parse(JSON.stringify(stack2))
-    };
     logger.info("Created rollback point", { rollbackId });
     return rollbackId;
   }