@burtson-labs/bandit-engine 2.0.162 → 2.0.163

package/dist/management/management.mjs

@@ -1,15 +1,15 @@
 import {
   management_default
-} from "../chunk-RUXYVMW2.mjs";
-import "../chunk-47MOBOP3.mjs";
-import "../chunk-ZNK3ELTZ.mjs";
-import "../chunk-G5POQT2R.mjs";
-import "../chunk-OGMXL7BF.mjs";
-import "../chunk-R6HMLYKQ.mjs";
-import "../chunk-ODGVCSKV.mjs";
-import "../chunk-WQEBTH2R.mjs";
-import "../chunk-Q6LXVYTC.mjs";
-import "../chunk-KCI46M23.mjs";
+} from "../chunk-HSGQXL4N.mjs";
+import "../chunk-IZX2J65Q.mjs";
+import "../chunk-5KBTOCQZ.mjs";
+import "../chunk-O6P37PFR.mjs";
+import "../chunk-VBHI4TJC.mjs";
+import "../chunk-WLNZL6SP.mjs";
+import "../chunk-J6SWNO7Z.mjs";
+import "../chunk-TY5VL3SG.mjs";
+import "../chunk-CQJGUYRW.mjs";
+import "../chunk-OCVZVBQQ.mjs";
 import "../chunk-BJTO5JO5.mjs";
 export {
   management_default as default

package/dist/{memoryUtils-33TZKHSQ.mjs → memoryUtils-2FVXDSS6.mjs}

@@ -220,4 +220,4 @@ export {
   generateProgressMessage,
   validateMemories
 };
-//# sourceMappingURL=memoryUtils-33TZKHSQ.mjs.map
+//# sourceMappingURL=memoryUtils-2FVXDSS6.mjs.map

package/dist/memoryUtils-2FVXDSS6.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/utils/memoryUtils.ts"],"sourcesContent":["/*\n * Copyright (c) 2025 Burtson Labs LLC.\n * SPDX-License-Identifier: BUSL-1.1\n * See LICENSE for the applicable terms.\n */\n\n\nexport interface BulkMemoryResult {\n  success: boolean;\n  message: string;\n  totalProcessed: number;\n  successCount: number;\n  failureCount: number;\n  errors: string[];\n}\n\nexport interface MemoryImportOptions {\n  mode: 'append' | 'replace' | 'smartDedupe';\n  clearExisting?: boolean;\n  includeMetadata?: boolean;\n  batchSize?: number;\n}\n\ntype MemoryRecordCandidate = {\n  content?: unknown;\n  title?: unknown;\n  tags?: unknown;\n  timestamp?: unknown;\n};\n\ntype BatchOperationResult = {\n  summary?: {\n    totalProcessed?: number;\n    successCount?: number;\n    failureCount?: number;\n  };\n  totalMemories?: number;\n  successCount?: number;\n  failureCount?: number;\n};\n\nconst isRecord = (value: unknown): value is Record<string, unknown> =>\n  typeof value === 'object' && value !== null;\n\nconst isStringArray = (value: unknown): value is string[] =>\n  Array.isArray(value) && value.every((item) => typeof item === 'string');\n\nconst resolveTimestampLabel = (timestamp: unknown): string => {\n  if (timestamp instanceof Date && !Number.isNaN(timestamp.getTime())) {\n    return timestamp.toLocaleDateString();\n  }\n\n  if (typeof timestamp === 'number' && Number.isFinite(timestamp)) {\n    const date = new Date(timestamp);\n    if (!Number.isNaN(date.getTime())) {\n      return date.toLocaleDateString();\n    }\n  }\n\n  if (typeof timestamp === 'string' && timestamp.trim()) {\n    const date = new Date(timestamp);\n    if (!Number.isNaN(date.getTime())) {\n      return date.toLocaleDateString();\n    }\n  }\n\n  return new Date().toLocaleDateString();\n};\n\n/**\n * Memory Utilities for Bulk Operations\n * \n * Provides helper functions for batch memory operations,\n * data formatting, and migration utilities.\n */\nexport class MemoryUtils {\n  /**\n   * Validate memory content before bulk operations\n   */\n  static validateMemories(memories: Array<{ content: string; title?: string; tags?: string[] }>): {\n    valid: Array<{ content: string; title?: string; tags?: string[] }>;\n    invalid: Array<{ content: string; error: string; index: number }>;\n  } {\n    const valid: Array<{ content: string; title?: string; tags?: string[] }> = [];\n    const invalid: Array<{ content: string; error: string; index: number }> = [];\n\n    memories.forEach((memory, index) => {\n      // Check content length\n      if (!memory.content || memory.content.trim().length === 0) {\n        invalid.push({\n          content: memory.content || '',\n          error: 'Empty content',\n          index\n        });\n        return;\n      }\n\n      // Check maximum content length (e.g., 50KB)\n      if (memory.content.length > 50000) {\n        invalid.push({\n          content: memory.content.substring(0, 100) + '...',\n          error: 'Content too long (max 50KB)',\n          index\n        });\n        return;\n      }\n\n      // Check tags format\n      if (memory.tags && (!Array.isArray(memory.tags) || memory.tags.some(tag => typeof tag !== 'string'))) {\n        invalid.push({\n          content: memory.content.substring(0, 100) + '...',\n          error: 'Invalid tags format (must be string array)',\n          index\n        });\n        return;\n      }\n\n      valid.push(memory);\n    });\n\n    return { valid, invalid };\n  }\n\n  /**\n   * Format IndexedDB memories for vector import\n   */\n  static formatForVectorImport(indexedDBMemories: ReadonlyArray<unknown>): Array<{ content: string; title?: string; tags?: string[] }> {\n    return indexedDBMemories.reduce<Array<{ content: string; title?: string; tags?: string[] }>>((acc, entry) => {\n      if (!isRecord(entry)) {\n        return acc;\n      }\n\n      const candidate = entry as MemoryRecordCandidate;\n      if (typeof candidate.content !== 'string') {\n        return acc;\n      }\n\n      const title = typeof candidate.title === 'string' && candidate.title.trim().length > 0\n        ? candidate.title\n        : `Memory from ${resolveTimestampLabel(candidate.timestamp)}`;\n\n      const tags = isStringArray(candidate.tags) ? candidate.tags : [];\n\n      acc.push({\n        content: candidate.content,\n        title,\n        tags\n      });\n      return acc;\n    }, []);\n  }\n\n  /**\n   * Chunk large batch operations for better performance\n   */\n  static chunkMemories<T>(\n    memories: T[], \n    chunkSize: number = 100\n  ): T[][] {\n    const chunks: T[][] = [];\n    for (let i = 0; i < memories.length; i += chunkSize) {\n      chunks.push(memories.slice(i, i + chunkSize));\n    }\n    return chunks;\n  }\n\n  /**\n   * Estimate batch operation time and resource usage\n   */\n  static estimateBatchOperation(memoryCount: number, averageContentLength: number): {\n    estimatedTimeMinutes: number;\n    estimatedTokens: number;\n    recommendedChunkSize: number;\n    warnings: string[];\n  } {\n    const warnings: string[] = [];\n    \n    // Rough estimates based on typical embedding performance\n    const embeddingsPerMinute = 100; // Conservative estimate\n    const tokensPerCharacter = 0.25; // Rough estimate for token calculation\n    \n    const estimatedTimeMinutes = Math.ceil(memoryCount / embeddingsPerMinute);\n    const estimatedTokens = Math.ceil(memoryCount * averageContentLength * tokensPerCharacter);\n    \n    // Recommend smaller chunks for large operations\n    let recommendedChunkSize = 50;\n    if (memoryCount > 1000) {\n      recommendedChunkSize = 25;\n      warnings.push('Large batch operation - consider running during off-peak hours');\n    }\n    if (averageContentLength > 2000) {\n      recommendedChunkSize = Math.max(10, recommendedChunkSize / 2);\n      warnings.push('Large content size - reduced chunk size recommended');\n    }\n    if (estimatedTimeMinutes > 30) {\n      warnings.push('Long operation expected - ensure stable internet connection');\n    }\n\n    return {\n      estimatedTimeMinutes,\n      estimatedTokens,\n      recommendedChunkSize,\n      warnings\n    };\n  }\n\n  /**\n   * Create summary report for batch operations\n   */\n  static createBatchSummary(\n    result: BatchOperationResult,\n    operationType: 'import' | 'create' | 'migrate',\n    startTime: Date\n  ): {\n    summary: string;\n    details: {\n      operation: string;\n      duration: string;\n      totalMemories: number;\n      successful: number;\n      failed: number;\n      successRate: string;\n      averageTimePerMemory: string;\n    };\n  } {\n    const endTime = new Date();\n    const durationMs = endTime.getTime() - startTime.getTime();\n    const durationMinutes = Math.floor(durationMs / 60000);\n    const durationSeconds = Math.floor((durationMs % 60000) / 1000);\n    \n    const totalMemories = result.summary?.totalProcessed ?? result.totalMemories ?? 0;\n    const successful = result.summary?.successCount ?? result.successCount ?? 0;\n    const failed = result.summary?.failureCount ?? result.failureCount ?? 0;\n    const successRate = totalMemories > 0 ? ((successful / totalMemories) * 100).toFixed(1) : '0';\n    const avgTimePerMemory = totalMemories > 0 ? (durationMs / totalMemories).toFixed(0) : '0';\n\n    const summary = `${operationType.toUpperCase()} completed: ${successful}/${totalMemories} memories processed successfully (${successRate}% success rate) in ${durationMinutes}m ${durationSeconds}s`;\n\n    const details = {\n      operation: operationType,\n      duration: `${durationMinutes}m ${durationSeconds}s`,\n      totalMemories,\n      successful,\n      failed,\n      successRate: `${successRate}%`,\n      averageTimePerMemory: `${avgTimePerMemory}ms`\n    };\n\n    return { summary, details };\n  }\n\n  /**\n   * Generate progress messages for UI updates\n   */\n  static generateProgressMessage(\n    current: number, \n    total: number, \n    operation: string = 'Processing'\n  ): string {\n    const percentage = Math.floor((current / total) * 100);\n    const remaining = total - current;\n    \n    if (current === 0) {\n      return `Starting ${operation.toLowerCase()}...`;\n    } else if (current === total) {\n      return `${operation} completed!`;\n    } else if (current < total / 4) {\n      return `${operation} memories... (${current}/${total})`;\n    } else if (current < total / 2) {\n      return `${percentage}% complete... (${remaining} remaining)`;\n    } else if (current < total * 0.9) {\n      return `Almost done... ${percentage}% complete`;\n    } else {\n      return `Finishing up... ${remaining} memories left`;\n    }\n  }\n\n  /**\n   * Compare memory content for deduplication\n   */\n  static calculateSimilarity(content1: string, content2: string): number {\n    // Simple similarity check - could be enhanced with more sophisticated algorithms\n    const words1 = content1.toLowerCase().split(/\\s+/);\n    const words2 = content2.toLowerCase().split(/\\s+/);\n    \n    const set1 = new Set(words1);\n    const set2 = new Set(words2);\n    \n    const intersection = new Set([...set1].filter(word => set2.has(word)));\n    const union = new Set([...set1, ...set2]);\n    \n    return union.size > 0 ? intersection.size / union.size : 0;\n  }\n\n  /**\n   * Find potential duplicates in memory list\n   */\n  static findPotentialDuplicates(\n    memories: Array<{ content: string; title?: string; tags?: string[] }>,\n    similarityThreshold: number = 0.8\n  ): Array<{\n    memory: { content: string; title?: string; tags?: string[] };\n    duplicates: Array<{\n      memory: { content: string; title?: string; tags?: string[] };\n      similarity: number;\n      index: number;\n    }>;\n  }> {\n    const duplicates: Array<{\n      memory: { content: string; title?: string; tags?: string[] };\n      duplicates: Array<{\n        memory: { content: string; title?: string; tags?: string[] };\n        similarity: number;\n        index: number;\n      }>;\n    }> = [];\n\n    for (let i = 0; i < memories.length; i++) {\n      const currentMemory = memories[i];\n      const potentialDuplicates: Array<{\n        memory: { content: string; title?: string; tags?: string[] };\n        similarity: number;\n        index: number;\n      }> = [];\n\n      for (let j = i + 1; j < memories.length; j++) {\n        const compareMemory = memories[j];\n        const similarity = this.calculateSimilarity(currentMemory.content, compareMemory.content);\n        \n        if (similarity >= similarityThreshold) {\n          potentialDuplicates.push({\n            memory: compareMemory,\n            similarity,\n            index: j\n          });\n        }\n      }\n\n      if (potentialDuplicates.length > 0) {\n        duplicates.push({\n          memory: currentMemory,\n          duplicates: potentialDuplicates\n        });\n      }\n    }\n\n    return duplicates;\n  }\n}\n\n// Export utility functions for direct use\nexport const validateMemories = MemoryUtils.validateMemories;\nexport const formatForVectorImport = MemoryUtils.formatForVectorImport;\nexport const chunkMemories = MemoryUtils.chunkMemories;\nexport const estimateBatchOperation = MemoryUtils.estimateBatchOperation;\nexport const createBatchSummary = MemoryUtils.createBatchSummary;\nexport const generateProgressMessage = MemoryUtils.generateProgressMessage;\nexport const findPotentialDuplicates = MemoryUtils.findPotentialDuplicates;\n"],"mappings":";;;AAyCA,IAAM,WAAW,CAAC,UAChB,OAAO,UAAU,YAAY,UAAU;AAEzC,IAAM,gBAAgB,CAAC,UACrB,MAAM,QAAQ,KAAK,KAAK,MAAM,MAAM,CAAC,SAAS,OAAO,SAAS,QAAQ;AAExE,IAAM,wBAAwB,CAAC,cAA+B;AAC5D,MAAI,qBAAqB,QAAQ,CAAC,OAAO,MAAM,UAAU,QAAQ,CAAC,GAAG;AACnE,WAAO,UAAU,mBAAmB;AAAA,EACtC;AAEA,MAAI,OAAO,cAAc,YAAY,OAAO,SAAS,SAAS,GAAG;AAC/D,UAAM,OAAO,IAAI,KAAK,SAAS;AAC/B,QAAI,CAAC,OAAO,MAAM,KAAK,QAAQ,CAAC,GAAG;AACjC,aAAO,KAAK,mBAAmB;AAAA,IACjC;AAAA,EACF;AAEA,MAAI,OAAO,cAAc,YAAY,UAAU,KAAK,GAAG;AACrD,UAAM,OAAO,IAAI,KAAK,SAAS;AAC/B,QAAI,CAAC,OAAO,MAAM,KAAK,QAAQ,CAAC,GAAG;AACjC,aAAO,KAAK,mBAAmB;AAAA,IACjC;AAAA,EACF;AAEA,UAAO,oBAAI,KAAK,GAAE,mBAAmB;AACvC;AAQO,IAAM,cAAN,MAAkB;AAAA;AAAA;AAAA;AAAA,EAIvB,OAAO,iBAAiB,UAGtB;AACA,UAAM,QAAqE,CAAC;AAC5E,UAAM,UAAoE,CAAC;AAE3E,aAAS,QAAQ,CAAC,QAAQ,UAAU;AAElC,UAAI,CAAC,OAAO,WAAW,OAAO,QAAQ,KAAK,EAAE,WAAW,GAAG;AACzD,gBAAQ,KAAK;AAAA,UACX,SAAS,OAAO,WAAW;AAAA,UAC3B,OAAO;AAAA,UACP;AAAA,QACF,CAAC;AACD;AAAA,MACF;AAGA,UAAI,OAAO,QAAQ,SAAS,KAAO;AACjC,gBAAQ,KAAK;AAAA,UACX,SAAS,OAAO,QAAQ,UAAU,GAAG,GAAG,IAAI;AAAA,UAC5C,OAAO;AAAA,UACP;AAAA,QACF,CAAC;AACD;AAAA,MACF;AAGA,UAAI,OAAO,SAAS,CAAC,MAAM,QAAQ,OAAO,IAAI,KAAK,OAAO,KAAK,KAAK,SAAO,OAAO,QAAQ,QAAQ,IAAI;AACpG,gBAAQ,KAAK;AAAA,UACX,SAAS,OAAO,QAAQ,UAAU,GAAG,GAAG,IAAI;AAAA,UAC5C,OAAO;AAAA,UACP;AAAA,QACF,CAAC;AACD;AAAA,MACF;AAEA,YAAM,KAAK,MAAM;AAAA,IACnB,CAAC;AAED,WAAO,EAAE,OAAO,QAAQ;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,sBAAsB,mBAAwG;AACnI,WAAO,kBAAkB,OAAoE,CAAC,KAAK,UAAU;AAC3G,UAAI,CAAC,SAAS,KAAK,GAAG;AACpB,eAAO;AAAA,MACT;AAEA,YAAM,YAAY;AAClB,UAAI,OAAO,UAAU,YAAY,UAAU;AACzC,eAAO;AAAA,MACT;AAEA,YAAM,QAAQ,OAAO,UAAU,UAAU,YAAY,UAAU,MAAM,KAAK,EAAE,SAAS,IACjF,UAAU,QACV,eAAe,sBAAsB,UAAU,SAAS,CAAC;AAE7D,YAAM,OAAO,cAAc,UAAU,IAAI,IAAI,UAAU,OAAO,CAAC;AAE/D,UAAI,KAAK;AAAA,QACP,SAAS,UAAU;AAAA,QACnB;AAAA,QACA;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT,GAAG,CAAC,CAAC;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,cACL,UACA,YAAoB,KACb;AACP,UAAM,SAAgB,CAAC;AACvB,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,WAAW;AACnD,aAAO,KAAK,SAAS,MAAM,GAAG,IAAI,SAAS,CAAC;AAAA,IAC9C;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,uBAAuB,aAAqB,sBAKjD;AACA,UAAM,WAAqB,CAAC;AAG5B,UAAM,sBAAsB;AAC5B,UAAM,qBAAqB;AAE3B,UAAM,uBAAuB,KAAK,KAAK,cAAc,mBAAmB;AACxE,UAAM,kBAAkB,KAAK,KAAK,cAAc,uBAAuB,kBAAkB;AAGzF,QAAI,uBAAuB;AAC3B,QAAI,cAAc,KAAM;AACtB,6BAAuB;AACvB,eAAS,KAAK,gEAAgE;AAAA,IAChF;AACA,QAAI,uBAAuB,KAAM;AAC/B,6BAAuB,KAAK,IAAI,IAAI,uBAAuB,CAAC;AAC5D,eAAS,KAAK,qDAAqD;AAAA,IACrE;AACA,QAAI,uBAAuB,IAAI;AAC7B,eAAS,KAAK,6DAA6D;AAAA,IAC7E;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,mBACL,QACA,eACA,WAYA;AACA,UAAM,UAAU,oBAAI,KAAK;AACzB,UAAM,aAAa,QAAQ,QAAQ,IAAI,UAAU,QAAQ;AACzD,UAAM,kBAAkB,KAAK,MAAM,aAAa,GAAK;AACrD,UAAM,kBAAkB,KAAK,MAAO,aAAa,MAAS,GAAI;AAE9D,UAAM,gBAAgB,OAAO,SAAS,kBAAkB,OAAO,iBAAiB;AAChF,UAAM,aAAa,OAAO,SAAS,gBAAgB,OAAO,gBAAgB;AAC1E,UAAM,SAAS,OAAO,SAAS,gBAAgB,OAAO,gBAAgB;AACtE,UAAM,cAAc,gBAAgB,KAAM,aAAa,gBAAiB,KAAK,QAAQ,CAAC,IAAI;AAC1F,UAAM,mBAAmB,gBAAgB,KAAK,aAAa,eAAe,QAAQ,CAAC,IAAI;AAEvF,UAAM,UAAU,GAAG,cAAc,YAAY,CAAC,eAAe,UAAU,IAAI,aAAa,qCAAqC,WAAW,sBAAsB,eAAe,KAAK,eAAe;AAEjM,UAAM,UAAU;AAAA,MACd,WAAW;AAAA,MACX,UAAU,GAAG,eAAe,KAAK,eAAe;AAAA,MAChD;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa,GAAG,WAAW;AAAA,MAC3B,sBAAsB,GAAG,gBAAgB;AAAA,IAC3C;AAEA,WAAO,EAAE,SAAS,QAAQ;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,wBACL,SACA,OACA,YAAoB,cACZ;AACR,UAAM,aAAa,KAAK,MAAO,UAAU,QAAS,GAAG;AACrD,UAAM,YAAY,QAAQ;AAE1B,QAAI,YAAY,GAAG;AACjB,aAAO,YAAY,UAAU,YAAY,CAAC;AAAA,IAC5C,WAAW,YAAY,OAAO;AAC5B,aAAO,GAAG,SAAS;AAAA,IACrB,WAAW,UAAU,QAAQ,GAAG;AAC9B,aAAO,GAAG,SAAS,iBAAiB,OAAO,IAAI,KAAK;AAAA,IACtD,WAAW,UAAU,QAAQ,GAAG;AAC9B,aAAO,GAAG,UAAU,kBAAkB,SAAS;AAAA,IACjD,WAAW,UAAU,QAAQ,KAAK;AAChC,aAAO,kBAAkB,UAAU;AAAA,IACrC,OAAO;AACL,aAAO,mBAAmB,SAAS;AAAA,IACrC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,oBAAoB,UAAkB,UAA0B;AAErE,UAAM,SAAS,SAAS,YAAY,EAAE,MAAM,KAAK;AACjD,UAAM,SAAS,SAAS,YAAY,EAAE,MAAM,KAAK;AAEjD,UAAM,OAAO,IAAI,IAAI,MAAM;AAC3B,UAAM,OAAO,IAAI,IAAI,MAAM;AAE3B,UAAM,eAAe,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,OAAO,UAAQ,KAAK,IAAI,IAAI,CAAC,CAAC;AACrE,UAAM,QAAQ,oBAAI,IAAI,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;AAExC,WAAO,MAAM,OAAO,IAAI,aAAa,OAAO,MAAM,OAAO;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,wBACL,UACA,sBAA8B,KAQ7B;AACD,UAAM,aAOD,CAAC;AAEN,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,YAAM,gBAAgB,SAAS,CAAC;AAChC,YAAM,sBAID,CAAC;AAEN,eAAS,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AAC5C,cAAM,gBAAgB,SAAS,CAAC;AAChC,cAAM,aAAa,KAAK,oBAAoB,cAAc,SAAS,cAAc,OAAO;AAExF,YAAI,cAAc,qBAAqB;AACrC,8BAAoB,KAAK;AAAA,YACvB,QAAQ;AAAA,YACR;AAAA,YACA,OAAO;AAAA,UACT,CAAC;AAAA,QACH;AAAA,MACF;AAEA,UAAI,oBAAoB,SAAS,GAAG;AAClC,mBAAW,KAAK;AAAA,UACd,QAAQ;AAAA,UACR,YAAY;AAAA,QACd,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AACF;AAGO,IAAM,mBAAmB,YAAY;AACrC,IAAM,wBAAwB,YAAY;AAC1C,IAAM,gBAAgB,YAAY;AAClC,IAAM,yBAAyB,YAAY;AAC3C,IAAM,qBAAqB,YAAY;AACvC,IAAM,0BAA0B,YAAY;AAC5C,IAAM,0BAA0B,YAAY;","names":[]}