@warlock.js/cache 4.0.171 → 4.1.1

package/esm/drivers/lru-memory-cache-driver.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"lru-memory-cache-driver.mjs","names":[],"sources":["../../../../../../@warlock.js/cache/src/drivers/lru-memory-cache-driver.ts"],"sourcesContent":["import type {\r\n  CacheData,\r\n  CacheDriver,\r\n  CacheKey,\r\n  CacheSetOptions,\r\n  CacheSetResult,\r\n  CacheSimilarHit,\r\n  CacheSimilarOptions,\r\n  CacheTtl,\r\n  LRUMemoryCacheOptions,\r\n} from \"../types\";\r\nimport { cosineSimilarity } from \"../utils\";\r\nimport { BaseCacheDriver } from \"./base-cache-driver\";\r\n\r\nclass CacheNode {\r\n  public next: CacheNode | null = null;\r\n  public prev: CacheNode | null = null;\r\n  public expiresAt?: number;\r\n  /**\r\n   * Freshness deadline (ms timestamp) — populated by `swr()`. Within\r\n   * `expiresAt > now > staleAt` the entry is \"stale-but-revalidatable.\"\r\n   */\r\n  public staleAt?: number;\r\n  /**\r\n   * Optional embedding vector — populated when the entry was written with\r\n   * `set({ vector })`. Scanned by `similar()`.\r\n   */\r\n  public vector?: number[];\r\n  public constructor(\r\n    public key: string,\r\n    public value: any,\r\n    ttl?: number,\r\n  ) {\r\n    if (ttl && ttl !== Infinity) {\r\n      this.expiresAt = Date.now() + ttl * 1000;\r\n    }\r\n  }\r\n\r\n  public get isExpired(): boolean {\r\n    return this.expiresAt !== undefined && this.expiresAt < Date.now();\r\n  }\r\n}\r\n\r\n/**\r\n * LRU Memory Cache Driver\r\n * The concept of LRU is to remove the least recently used data\r\n * whenever the cache is full\r\n * The question that resides here is how to tell the cache is full?\r\n */\r\nexport class LRUMemoryCacheDriver\r\n  extends BaseCacheDriver<LRUMemoryCacheDriver, LRUMemoryCacheOptions>\r\n  implements CacheDriver<LRUMemoryCacheDriver, LRUMemoryCacheOptions>\r\n{\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public name = \"lru\";\r\n\r\n  /**\r\n   * Cache map\r\n   */\r\n  protected cache: Map<string, CacheNode> = new Map();\r\n\r\n  /**\r\n   * Head of the cache\r\n   */\r\n  protected head: CacheNode = new CacheNode(\"\", null);\r\n\r\n  /**\r\n   * Tail of the cache\r\n   */\r\n  protected tail: CacheNode = new CacheNode(\"\", null);\r\n\r\n  /**\r\n   * Cleanup interval reference\r\n   */\r\n  protected cleanupInterval?: NodeJS.Timeout;\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public constructor() {\r\n    super();\r\n\r\n    this.init();\r\n    this.startCleanup();\r\n  }\r\n\r\n  /**\r\n   * Initialize the cache\r\n   */\r\n  public init() {\r\n    this.head.next = this.tail;\r\n    this.tail.prev = this.head;\r\n  }\r\n\r\n  /**\r\n   * Start the cleanup process for expired items\r\n   */\r\n  public startCleanup() {\r\n    // Clear existing interval if any\r\n    if (this.cleanupInterval) {\r\n      clearInterval(this.cleanupInterval);\r\n    }\r\n\r\n    this.cleanupInterval = setInterval(async () => {\r\n      const now = Date.now();\r\n      const expiredKeys: string[] = [];\r\n\r\n      for (const [key, node] of this.cache) {\r\n        if (node.expiresAt && node.expiresAt <= now) {\r\n          expiredKeys.push(key);\r\n        }\r\n      }\r\n\r\n      for (const key of expiredKeys) {\r\n        const node = this.cache.get(key);\r\n        if (node) {\r\n          this.removeNode(node);\r\n          this.cache.delete(key);\r\n          this.log(\"expired\", key);\r\n          // Emit expired event\r\n          await this.emit(\"expired\", { key });\r\n        }\r\n      }\r\n    }, 1000);\r\n\r\n    // do not block the process from exiting\r\n    this.cleanupInterval.unref();\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   *\r\n   * Clears every entry whose key starts with the parsed namespace (followed\r\n   * by a dot) or equals it exactly. Called with an empty namespace while a\r\n   * `globalPrefix` is configured, clears everything under the prefix — which\r\n   * is how `flush()` scopes cleanup per tenant.\r\n   */\r\n  public async removeNamespace(namespace: string) {\r\n    const parsedNamespace = this.parseKey(namespace);\r\n\r\n    this.log(\"clearing\", parsedNamespace || \"(all)\");\r\n\r\n    const removed: string[] = [];\r\n\r\n    if (parsedNamespace === \"\") {\r\n      for (const key of this.cache.keys()) {\r\n        removed.push(key);\r\n      }\r\n    } else {\r\n      const prefix = parsedNamespace + \".\";\r\n\r\n      for (const key of this.cache.keys()) {\r\n        if (key === parsedNamespace || key.startsWith(prefix)) {\r\n          removed.push(key);\r\n        }\r\n      }\r\n    }\r\n\r\n    for (const key of removed) {\r\n      const node = this.cache.get(key);\r\n      if (node) {\r\n        this.removeNode(node);\r\n        this.cache.delete(key);\r\n      }\r\n      await this.emit(\"removed\", { key });\r\n    }\r\n\r\n    this.log(\"cleared\", parsedNamespace || \"(all)\");\r\n\r\n    return removed;\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public async set(\r\n    key: CacheKey,\r\n    value: any,\r\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\r\n  ): Promise<any> {\r\n    const parsedKey = this.parseKey(key);\r\n    const { ttl, tags, onConflict, vector, staleAt } = this.resolveSetOptions(ttlOrOptions);\r\n\r\n    this.log(\"caching\", parsedKey);\r\n\r\n    // For conditional writes, check existence via get() so expired entries\r\n    // are treated as missing (get() handles expiry cleanup). The raw `cache.get`\r\n    // node lookup would let stale entries block onConflict: \"create\".\r\n    let existingNode = this.cache.get(parsedKey);\r\n    if (existingNode && existingNode.isExpired) {\r\n      this.removeNode(existingNode);\r\n      this.cache.delete(parsedKey);\r\n      existingNode = undefined;\r\n    }\r\n\r\n    const exists = Boolean(existingNode);\r\n\r\n    if (onConflict === \"create\" && exists) {\r\n      const result: CacheSetResult = {\r\n        wasSet: false,\r\n        existing: existingNode!.value,\r\n      };\r\n      return result;\r\n    }\r\n\r\n    if (onConflict === \"update\" && !exists) {\r\n      const result: CacheSetResult = { wasSet: false, existing: null };\r\n      return result;\r\n    }\r\n\r\n    if (existingNode) {\r\n      existingNode.value = value;\r\n      if (ttl && ttl !== Infinity) {\r\n        existingNode.expiresAt = Date.now() + ttl * 1000;\r\n      } else {\r\n        existingNode.expiresAt = undefined;\r\n      }\r\n      existingNode.staleAt = staleAt;\r\n      if (vector) {\r\n        existingNode.vector = vector.slice();\r\n      }\r\n\r\n      this.moveHead(existingNode);\r\n    } else {\r\n      const newNode = new CacheNode(parsedKey, value, ttl);\r\n      newNode.staleAt = staleAt;\r\n      if (vector) {\r\n        newNode.vector = vector.slice();\r\n      }\r\n\r\n      this.cache.set(parsedKey, newNode);\r\n\r\n      this.addNode(newNode);\r\n      if (this.cache.size > this.capacity) {\r\n        this.removeTail();\r\n      }\r\n    }\r\n\r\n    if (tags && tags.length > 0) {\r\n      await this.applyTags(parsedKey, tags);\r\n    }\r\n\r\n    this.log(\"cached\", parsedKey);\r\n\r\n    await this.emit(\"set\", { key: parsedKey, value, ttl });\r\n\r\n    if (onConflict === \"create\" || onConflict === \"update\") {\r\n      const result: CacheSetResult = { wasSet: true, existing: null };\r\n      return result;\r\n    }\r\n\r\n    return this;\r\n  }\r\n\r\n  /**\r\n   * Move the node to the head\r\n   */\r\n  protected moveHead(node: CacheNode) {\r\n    this.removeNode(node);\r\n    this.addNode(node);\r\n  }\r\n\r\n  /**\r\n   * Remove the node from the cache\r\n   */\r\n  protected removeNode(node: CacheNode) {\r\n    node.prev!.next = node.next;\r\n    node.next!.prev = node.prev;\r\n  }\r\n\r\n  /**\r\n   * Add the node to the head\r\n   */\r\n  protected addNode(node: CacheNode) {\r\n    node.next = this.head.next;\r\n    node.prev = this.head;\r\n    this.head.next!.prev = node;\r\n    this.head.next = node;\r\n  }\r\n\r\n  /**\r\n   * Remove the tail node\r\n   */\r\n  protected removeTail() {\r\n    const node = this.tail.prev!;\r\n\r\n    this.removeNode(node);\r\n\r\n    this.cache.delete(node.key);\r\n  }\r\n\r\n  /**\r\n   * Read the raw {@link CacheData} wrapper, including `staleAt` metadata.\r\n   * Returns `null` for missing or expired nodes — `swr()` consumes this\r\n   * to branch on freshness without going through `get()`'s clone-and-emit\r\n   * path.\r\n   */\r\n  protected async getEntry(key: CacheKey): Promise<CacheData | null> {\r\n    const parsedKey = this.parseKey(key);\r\n    const node = this.cache.get(parsedKey);\r\n\r\n    if (!node || node.isExpired) {\r\n      return null;\r\n    }\r\n\r\n    return {\r\n      data: node.value,\r\n      expiresAt: node.expiresAt,\r\n      staleAt: node.staleAt,\r\n    };\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public async get(key: CacheKey) {\r\n    const parsedKey = this.parseKey(key);\r\n\r\n    this.log(\"fetching\", parsedKey);\r\n\r\n    const node = this.cache.get(parsedKey);\r\n\r\n    if (!node) {\r\n      this.log(\"notFound\", parsedKey);\r\n      // Emit miss event\r\n      await this.emit(\"miss\", { key: parsedKey });\r\n      return null;\r\n    }\r\n\r\n    // Check if expired\r\n    if (node.isExpired) {\r\n      this.removeNode(node);\r\n      this.cache.delete(parsedKey);\r\n      this.log(\"expired\", parsedKey);\r\n      // Emit expired event\r\n      await this.emit(\"expired\", { key: parsedKey });\r\n      // Also emit miss since we're returning null\r\n      await this.emit(\"miss\", { key: parsedKey });\r\n      return null;\r\n    }\r\n\r\n    this.moveHead(node);\r\n\r\n    this.log(\"fetched\", parsedKey);\r\n\r\n    const value = node.value;\r\n\r\n    // Apply cloning for immutability protection\r\n    if (value === null || value === undefined) {\r\n      return value;\r\n    }\r\n\r\n    const type = typeof value;\r\n    if (type === \"string\" || type === \"number\" || type === \"boolean\") {\r\n      // Emit hit event\r\n      await this.emit(\"hit\", { key: parsedKey, value });\r\n      return value;\r\n    }\r\n\r\n    try {\r\n      const clonedValue = structuredClone(value);\r\n      // Emit hit event\r\n      await this.emit(\"hit\", { key: parsedKey, value: clonedValue });\r\n      return clonedValue;\r\n    } catch (error) {\r\n      this.logError(`Failed to clone cached value for ${parsedKey}`, error);\r\n      throw error;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public async remove(key: CacheKey) {\r\n    const parsedKey = this.parseKey(key);\r\n\r\n    this.log(\"removing\", parsedKey);\r\n\r\n    const node = this.cache.get(parsedKey);\r\n\r\n    if (node) {\r\n      this.removeNode(node);\r\n      this.cache.delete(parsedKey);\r\n    }\r\n\r\n    this.log(\"removed\", parsedKey);\r\n\r\n    // Emit removed event\r\n    await this.emit(\"removed\", { key: parsedKey });\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   *\r\n   * When a `globalPrefix` is configured, `flush` scopes itself to that prefix\r\n   * so multi-tenant caches don't accidentally wipe sibling tenants. Without\r\n   * a prefix, clears everything.\r\n   */\r\n  public async flush() {\r\n    this.log(\"flushing\");\r\n\r\n    if (this.options.globalPrefix) {\r\n      await this.removeNamespace(\"\");\r\n    } else {\r\n      this.cache.clear();\r\n      this.init();\r\n    }\r\n\r\n    this.log(\"flushed\");\r\n\r\n    await this.emit(\"flushed\");\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   *\r\n   * Brute-force O(N) cosine similarity over every cached node that carries a\r\n   * vector. Suitable for development and small in-memory knowledge bases —\r\n   * not for production beyond ~10k entries.\r\n   *\r\n   * @warning Dev-only — O(N) per query.\r\n   */\r\n  public async similar<T = any>(\r\n    vector: number[],\r\n    options: CacheSimilarOptions,\r\n  ): Promise<CacheSimilarHit<T>[]> {\r\n    const tagFilter = await this.getKeysForTags(options.tags);\r\n\r\n    const hits: CacheSimilarHit<T>[] = [];\r\n\r\n    for (const [parsedKey, node] of this.cache) {\r\n      if (!node.vector) continue;\r\n      if (node.isExpired) continue;\r\n      if (tagFilter && !tagFilter.has(parsedKey)) continue;\r\n\r\n      const score = cosineSimilarity(vector, node.vector);\r\n\r\n      if (options.threshold !== undefined && score < options.threshold) {\r\n        continue;\r\n      }\r\n\r\n      // Clone object values to match get() semantics.\r\n      let value: any = node.value;\r\n      if (value !== null && value !== undefined) {\r\n        const t = typeof value;\r\n        if (t !== \"string\" && t !== \"number\" && t !== \"boolean\") {\r\n          value = structuredClone(value);\r\n        }\r\n      }\r\n\r\n      hits.push({ key: parsedKey, value, score });\r\n    }\r\n\r\n    hits.sort((a, b) => b.score - a.score);\r\n\r\n    if (options.topK >= 0 && hits.length > options.topK) {\r\n      hits.length = options.topK;\r\n    }\r\n\r\n    return hits;\r\n  }\r\n\r\n  /**\r\n   * Get lru capacity\r\n   */\r\n  public get capacity() {\r\n    return this.options.capacity || 1000;\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public async disconnect() {\r\n    // Clear the cleanup interval to prevent memory leaks\r\n    if (this.cleanupInterval) {\r\n      clearInterval(this.cleanupInterval);\r\n      this.cleanupInterval = undefined;\r\n    }\r\n\r\n    await super.disconnect();\r\n  }\r\n}\r\n"],"mappings":";;;;AAcA,IAAM,YAAN,MAAgB;CAcd,AAAO,YACL,AAAO,KACP,AAAO,OACP,KACA;EAHO;EACA;cAfuB;cACA;EAiB9B,IAAI,OAAO,QAAQ,UACjB,KAAK,YAAY,KAAK,IAAI,IAAI,MAAM;CAExC;CAEA,IAAW,YAAqB;EAC9B,OAAO,KAAK,cAAc,UAAa,KAAK,YAAY,KAAK,IAAI;CACnE;AACF;;;;;;;AAQA,IAAa,uBAAb,cACU,gBAEV;;;;CA6BE,AAAO,cAAc;EACnB,MAAM;cA1BM;+BAK4B,IAAI,IAAI;cAKtB,IAAI,UAAU,IAAI,IAAI;cAKtB,IAAI,UAAU,IAAI,IAAI;EAahD,KAAK,KAAK;EACV,KAAK,aAAa;CACpB;;;;CAKA,AAAO,OAAO;EACZ,KAAK,KAAK,OAAO,KAAK;EACtB,KAAK,KAAK,OAAO,KAAK;CACxB;;;;CAKA,AAAO,eAAe;EAEpB,IAAI,KAAK,iBACP,cAAc,KAAK,eAAe;EAGpC,KAAK,kBAAkB,YAAY,YAAY;GAC7C,MAAM,MAAM,KAAK,IAAI;GACrB,MAAM,cAAwB,CAAC;GAE/B,KAAK,MAAM,CAAC,KAAK,SAAS,KAAK,OAC7B,IAAI,KAAK,aAAa,KAAK,aAAa,KACtC,YAAY,KAAK,GAAG;GAIxB,KAAK,MAAM,OAAO,aAAa;IAC7B,MAAM,OAAO,KAAK,MAAM,IAAI,GAAG;IAC/B,IAAI,MAAM;KACR,KAAK,WAAW,IAAI;KACpB,KAAK,MAAM,OAAO,GAAG;KACrB,KAAK,IAAI,WAAW,GAAG;KAEvB,MAAM,KAAK,KAAK,WAAW,EAAE,IAAI,CAAC;IACpC;GACF;EACF,GAAG,GAAI;EAGP,KAAK,gBAAgB,MAAM;CAC7B;;;;;;;;;CAUA,MAAa,gBAAgB,WAAmB;EAC9C,MAAM,kBAAkB,KAAK,SAAS,SAAS;EAE/C,KAAK,IAAI,YAAY,mBAAmB,OAAO;EAE/C,MAAM,UAAoB,CAAC;EAE3B,IAAI,oBAAoB,IACtB,KAAK,MAAM,OAAO,KAAK,MAAM,KAAK,GAChC,QAAQ,KAAK,GAAG;OAEb;GACL,MAAM,SAAS,kBAAkB;GAEjC,KAAK,MAAM,OAAO,KAAK,MAAM,KAAK,GAChC,IAAI,QAAQ,mBAAmB,IAAI,WAAW,MAAM,GAClD,QAAQ,KAAK,GAAG;EAGtB;EAEA,KAAK,MAAM,OAAO,SAAS;GACzB,MAAM,OAAO,KAAK,MAAM,IAAI,GAAG;GAC/B,IAAI,MAAM;IACR,KAAK,WAAW,IAAI;IACpB,KAAK,MAAM,OAAO,GAAG;GACvB;GACA,MAAM,KAAK,KAAK,WAAW,EAAE,IAAI,CAAC;EACpC;EAEA,KAAK,IAAI,WAAW,mBAAmB,OAAO;EAE9C,OAAO;CACT;;;;CAKA,MAAa,IACX,KACA,OACA,cACc;EACd,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,EAAE,KAAK,MAAM,YAAY,QAAQ,YAAY,KAAK,kBAAkB,YAAY;EAEtF,KAAK,IAAI,WAAW,SAAS;EAK7B,IAAI,eAAe,KAAK,MAAM,IAAI,SAAS;EAC3C,IAAI,gBAAgB,aAAa,WAAW;GAC1C,KAAK,WAAW,YAAY;GAC5B,KAAK,MAAM,OAAO,SAAS;GAC3B,eAAe;EACjB;EAEA,MAAM,SAAS,QAAQ,YAAY;EAEnC,IAAI,eAAe,YAAY,QAK7B,OAAO;GAHL,QAAQ;GACR,UAAU,aAAc;EAEd;EAGd,IAAI,eAAe,YAAY,CAAC,QAE9B,OAAO;GAD0B,QAAQ;GAAO,UAAU;EAC9C;EAGd,IAAI,cAAc;GAChB,aAAa,QAAQ;GACrB,IAAI,OAAO,QAAQ,UACjB,aAAa,YAAY,KAAK,IAAI,IAAI,MAAM;QAE5C,aAAa,YAAY;GAE3B,aAAa,UAAU;GACvB,IAAI,QACF,aAAa,SAAS,OAAO,MAAM;GAGrC,KAAK,SAAS,YAAY;EAC5B,OAAO;GACL,MAAM,UAAU,IAAI,UAAU,WAAW,OAAO,GAAG;GACnD,QAAQ,UAAU;GAClB,IAAI,QACF,QAAQ,SAAS,OAAO,MAAM;GAGhC,KAAK,MAAM,IAAI,WAAW,OAAO;GAEjC,KAAK,QAAQ,OAAO;GACpB,IAAI,KAAK,MAAM,OAAO,KAAK,UACzB,KAAK,WAAW;EAEpB;EAEA,IAAI,QAAQ,KAAK,SAAS,GACxB,MAAM,KAAK,UAAU,WAAW,IAAI;EAGtC,KAAK,IAAI,UAAU,SAAS;EAE5B,MAAM,KAAK,KAAK,OAAO;GAAE,KAAK;GAAW;GAAO;EAAI,CAAC;EAErD,IAAI,eAAe,YAAY,eAAe,UAE5C,OAAO;GAD0B,QAAQ;GAAM,UAAU;EAC7C;EAGd,OAAO;CACT;;;;CAKA,AAAU,SAAS,MAAiB;EAClC,KAAK,WAAW,IAAI;EACpB,KAAK,QAAQ,IAAI;CACnB;;;;CAKA,AAAU,WAAW,MAAiB;EACpC,KAAK,KAAM,OAAO,KAAK;EACvB,KAAK,KAAM,OAAO,KAAK;CACzB;;;;CAKA,AAAU,QAAQ,MAAiB;EACjC,KAAK,OAAO,KAAK,KAAK;EACtB,KAAK,OAAO,KAAK;EACjB,KAAK,KAAK,KAAM,OAAO;EACvB,KAAK,KAAK,OAAO;CACnB;;;;CAKA,AAAU,aAAa;EACrB,MAAM,OAAO,KAAK,KAAK;EAEvB,KAAK,WAAW,IAAI;EAEpB,KAAK,MAAM,OAAO,KAAK,GAAG;CAC5B;;;;;;;CAQA,MAAgB,SAAS,KAA0C;EACjE,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,OAAO,KAAK,MAAM,IAAI,SAAS;EAErC,IAAI,CAAC,QAAQ,KAAK,WAChB,OAAO;EAGT,OAAO;GACL,MAAM,KAAK;GACX,WAAW,KAAK;GAChB,SAAS,KAAK;EAChB;CACF;;;;CAKA,MAAa,IAAI,KAAe;EAC9B,MAAM,YAAY,KAAK,SAAS,GAAG;EAEnC,KAAK,IAAI,YAAY,SAAS;EAE9B,MAAM,OAAO,KAAK,MAAM,IAAI,SAAS;EAErC,IAAI,CAAC,MAAM;GACT,KAAK,IAAI,YAAY,SAAS;GAE9B,MAAM,KAAK,KAAK,QAAQ,EAAE,KAAK,UAAU,CAAC;GAC1C,OAAO;EACT;EAGA,IAAI,KAAK,WAAW;GAClB,KAAK,WAAW,IAAI;GACpB,KAAK,MAAM,OAAO,SAAS;GAC3B,KAAK,IAAI,WAAW,SAAS;GAE7B,MAAM,KAAK,KAAK,WAAW,EAAE,KAAK,UAAU,CAAC;GAE7C,MAAM,KAAK,KAAK,QAAQ,EAAE,KAAK,UAAU,CAAC;GAC1C,OAAO;EACT;EAEA,KAAK,SAAS,IAAI;EAElB,KAAK,IAAI,WAAW,SAAS;EAE7B,MAAM,QAAQ,KAAK;EAGnB,IAAI,UAAU,QAAQ,UAAU,QAC9B,OAAO;EAGT,MAAM,OAAO,OAAO;EACpB,IAAI,SAAS,YAAY,SAAS,YAAY,SAAS,WAAW;GAEhE,MAAM,KAAK,KAAK,OAAO;IAAE,KAAK;IAAW;GAAM,CAAC;GAChD,OAAO;EACT;EAEA,IAAI;GACF,MAAM,cAAc,gBAAgB,KAAK;GAEzC,MAAM,KAAK,KAAK,OAAO;IAAE,KAAK;IAAW,OAAO;GAAY,CAAC;GAC7D,OAAO;EACT,SAAS,OAAO;GACd,KAAK,SAAS,oCAAoC,aAAa,KAAK;GACpE,MAAM;EACR;CACF;;;;CAKA,MAAa,OAAO,KAAe;EACjC,MAAM,YAAY,KAAK,SAAS,GAAG;EAEnC,KAAK,IAAI,YAAY,SAAS;EAE9B,MAAM,OAAO,KAAK,MAAM,IAAI,SAAS;EAErC,IAAI,MAAM;GACR,KAAK,WAAW,IAAI;GACpB,KAAK,MAAM,OAAO,SAAS;EAC7B;EAEA,KAAK,IAAI,WAAW,SAAS;EAG7B,MAAM,KAAK,KAAK,WAAW,EAAE,KAAK,UAAU,CAAC;CAC/C;;;;;;;;CASA,MAAa,QAAQ;EACnB,KAAK,IAAI,UAAU;EAEnB,IAAI,KAAK,QAAQ,cACf,MAAM,KAAK,gBAAgB,EAAE;OACxB;GACL,KAAK,MAAM,MAAM;GACjB,KAAK,KAAK;EACZ;EAEA,KAAK,IAAI,SAAS;EAElB,MAAM,KAAK,KAAK,SAAS;CAC3B;;;;;;;;;;CAWA,MAAa,QACX,QACA,SAC+B;EAC/B,MAAM,YAAY,MAAM,KAAK,eAAe,QAAQ,IAAI;EAExD,MAAM,OAA6B,CAAC;EAEpC,KAAK,MAAM,CAAC,WAAW,SAAS,KAAK,OAAO;GAC1C,IAAI,CAAC,KAAK,QAAQ;GAClB,IAAI,KAAK,WAAW;GACpB,IAAI,aAAa,CAAC,UAAU,IAAI,SAAS,GAAG;GAE5C,MAAM,QAAQ,iBAAiB,QAAQ,KAAK,MAAM;GAElD,IAAI,QAAQ,cAAc,UAAa,QAAQ,QAAQ,WACrD;GAIF,IAAI,QAAa,KAAK;GACtB,IAAI,UAAU,QAAQ,UAAU,QAAW;IACzC,MAAM,IAAI,OAAO;IACjB,IAAI,MAAM,YAAY,MAAM,YAAY,MAAM,WAC5C,QAAQ,gBAAgB,KAAK;GAEjC;GAEA,KAAK,KAAK;IAAE,KAAK;IAAW;IAAO;GAAM,CAAC;EAC5C;EAEA,KAAK,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;EAErC,IAAI,QAAQ,QAAQ,KAAK,KAAK,SAAS,QAAQ,MAC7C,KAAK,SAAS,QAAQ;EAGxB,OAAO;CACT;;;;CAKA,IAAW,WAAW;EACpB,OAAO,KAAK,QAAQ,YAAY;CAClC;;;;CAKA,MAAa,aAAa;EAExB,IAAI,KAAK,iBAAiB;GACxB,cAAc,KAAK,eAAe;GAClC,KAAK,kBAAkB;EACzB;EAEA,MAAM,MAAM,WAAW;CACzB;AACF"}

package/esm/drivers/memory-cache-driver.d.mts

@@ -0,0 +1,112 @@
+import { BaseCacheDriver } from "./base-cache-driver.mjs";
+import { CacheData, CacheDriver, CacheKey, CacheSetOptions, CacheSimilarHit, CacheSimilarOptions, CacheTtl, MemoryCacheOptions } from "../types.mjs";
+import { GenericObject } from "@mongez/reinforcements";
+
+//#region ../../@warlock.js/cache/src/drivers/memory-cache-driver.d.ts
+declare class MemoryCacheDriver extends BaseCacheDriver<MemoryCacheDriver, MemoryCacheOptions> implements CacheDriver<MemoryCacheDriver, MemoryCacheOptions> {
+  /**
+   * {@inheritdoc}
+   */
+  name: string;
+  /**
+   * Cached data
+   */
+  data: GenericObject;
+  /**
+   * List of data that will be cleared from cache
+   */
+  protected temporaryData: Record<string, {
+    key: string;
+    expiresAt: number;
+  }>;
+  /**
+   * Cleanup interval reference
+   */
+  protected cleanupInterval?: NodeJS.Timeout;
+  /**
+   * Access order tracking for LRU eviction (when maxSize is set)
+   */
+  protected accessOrder: string[];
+  /**
+   * Parallel vector index keyed by parsedKey. Populated by `set({ vector })`,
+   * scanned by `similar()`. Lifetime mirrors the main entry — cleared on
+   * `remove`, `flush`, expiry, namespace clear, and LRU eviction.
+   */
+  protected vectorIndex: Map<string, number[]>;
+  /**
+   * {@inheritdoc}
+   */
+  constructor();
+  /**
+   * Start the cleanup process whenever a data that has a cache key is set
+   */
+  startCleanup(): void;
+  /**
+   * {@inheritdoc}
+   */
+  removeNamespace(namespace: string): Promise<this>;
+  /**
+   * {@inheritdoc}
+   */
+  set(key: CacheKey, value: any, ttlOrOptions?: CacheTtl | CacheSetOptions): Promise<any>;
+  /**
+   * {@inheritdoc}
+   */
+  get(key: CacheKey): Promise<any>;
+  /**
+   * Read the raw {@link CacheData} wrapper, including `staleAt` metadata.
+   * Returns `null` for missing or expired entries so the SWR flow can branch
+   * cleanly. Does not emit `hit`/`miss` events — that's `get()`'s job.
+   */
+  protected getEntry(key: CacheKey): Promise<CacheData | null>;
+  /**
+   * {@inheritdoc}
+   */
+  remove(key: CacheKey): Promise<void>;
+  /**
+   * {@inheritdoc}
+   */
+  flush(): Promise<void>;
+  /**
+   * Set the temporary data
+   */
+  protected setTemporaryData(key: CacheKey, parsedKey: string, ttl: number): void;
+  /**
+   * Track access for LRU eviction
+   */
+  protected trackAccess(key: string): void;
+  /**
+   * Remove key from access order tracking
+   */
+  protected removeFromAccessOrder(key: string): void;
+  /**
+   * Enforce max size by evicting least recently used items.
+   *
+   * Recomputes the live cache size on every iteration — a single snapshot at
+   * the top of the loop would go stale and cause this routine to evict every
+   * entry in `accessOrder` (including the just-inserted key).
+   */
+  protected enforceMaxSize(): Promise<void>;
+  /**
+   * Get current cache size (number of cached items)
+   */
+  protected getCacheSize(): number;
+  /**
+   * {@inheritdoc}
+   *
+   * Brute-force O(N) cosine similarity over every entry that was written with
+   * `set({ vector })`. Suitable for development and small in-memory knowledge
+   * bases — not for production beyond ~10k entries. Use the `pg` driver
+   * (with pgvector) or `redis` (with RediSearch) at scale.
+   *
+   * @warning Dev-only — O(N) per query.
+   */
+  similar<T = any>(vector: number[], options: CacheSimilarOptions): Promise<CacheSimilarHit<T>[]>;
+  /**
+   * {@inheritdoc}
+   */
+  disconnect(): Promise<void>;
+}
+//#endregion
+export { MemoryCacheDriver };
+//# sourceMappingURL=memory-cache-driver.d.mts.map

package/esm/drivers/memory-cache-driver.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-cache-driver.d.mts","names":[],"sources":["../../../../../../@warlock.js/cache/src/drivers/memory-cache-driver.ts"],"mappings":";;;;;cAgBa,iBAAA,SACH,eAAA,CAAgB,iBAAA,EAAmB,kBAAA,aAChC,WAAA,CAAY,iBAAA,EAAmB,kBAAA;;AAF5C;;EAOS,IAAA;EANiB;;;EAWjB,IAAA,EAAM,aAAA;EAAA;;;EAAA,UAKH,aAAA,EAAe,MAAA;IAGrB,GAAA;IACA,SAAA;EAAA;EA2FwB;;;EAAA,UApFlB,eAAA,GAAkB,MAAA,CAAO,OAAA;EAkLL;;;EAAA,UA7KpB,WAAA;EA+LuB;;;;;EAAA,UAxLvB,WAAA,EAAa,GAAA;EAuTZ;;;;EA7VA;;;EAoDJ,YAAA,CAAA;EArDiB;;;EAiFX,eAAA,CAAgB,SAAA,WAAiB,OAAA;EAhFJ;;;EA2G7B,GAAA,CACX,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EAhGO;;;EA2JG,GAAA,CAAI,GAAA,EAAK,QAAA,GAAQ,OAAA;EAhJpB;;;;;EAAA,UAkLM,QAAA,CAAS,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,SAAA;;;;EAkBpC,MAAA,CAAO,GAAA,EAAK,QAAA,GAAQ,OAAA;EA9Ia;;;EAuKjC,KAAA,CAAA,GAAK,OAAA;EA1IhB;;;EAAA,UA6JQ,gBAAA,CAAiB,GAAA,EAAK,QAAA,EAAU,SAAA,UAAmB,GAAA;EA3J1D;;;EAAA,UAqKO,WAAA,CAAY,GAAA;EA1GQ;;;EAAA,UA0HpB,qBAAA,CAAsB,GAAA;EAxFS;;;;;;;EAAA,UAsGzB,cAAA,CAAA,GAAc,OAAA;EAxCpB;;;EAAA,UAiEA,YAAA,CAAA;EAjEmD;;;;;;;;;;EAgFhD,OAAA,SAAA,CACX,MAAA,YACA,OAAA,EAAS,mBAAA,GACR,OAAA,CAAQ,eAAA,CAAgB,CAAA;EADhB;;;EAuCE,UAAA,CAAA,GAAU,OAAA;AAAA"}

package/esm/drivers/memory-cache-driver.mjs

@@ -0,0 +1,241 @@
+import { cosineSimilarity } from "../utils.mjs";
+import { BaseCacheDriver } from "./base-cache-driver.mjs";
+import { get, set, unset } from "@mongez/reinforcements";
+
+//#region ../../@warlock.js/cache/src/drivers/memory-cache-driver.ts
+var MemoryCacheDriver = class extends BaseCacheDriver {
+	/**
+	* {@inheritdoc}
+	*/
+	constructor() {
+		super();
+		this.name = "memory";
+		this.data = {};
+		this.temporaryData = {};
+		this.accessOrder = [];
+		this.vectorIndex = /* @__PURE__ */ new Map();
+		this.startCleanup();
+	}
+	/**
+	* Start the cleanup process whenever a data that has a cache key is set
+	*/
+	startCleanup() {
+		if (this.cleanupInterval) clearInterval(this.cleanupInterval);
+		this.cleanupInterval = setInterval(async () => {
+			const now = Date.now();
+			for (const key in this.temporaryData) if (this.temporaryData[key].expiresAt <= now) {
+				await this.remove(this.temporaryData[key].key);
+				delete this.temporaryData[key];
+				this.log("expired", key);
+				await this.emit("expired", { key });
+			}
+		}, 1e3);
+		this.cleanupInterval.unref();
+	}
+	/**
+	* {@inheritdoc}
+	*/
+	async removeNamespace(namespace) {
+		this.log("clearing", namespace);
+		namespace = this.parseKey(namespace);
+		unset(this.data, [namespace]);
+		if (namespace === "") this.vectorIndex.clear();
+		else {
+			const prefix = namespace + ".";
+			for (const k of [...this.vectorIndex.keys()]) if (k === namespace || k.startsWith(prefix)) this.vectorIndex.delete(k);
+		}
+		this.log("cleared", namespace);
+		return this;
+	}
+	/**
+	* {@inheritdoc}
+	*/
+	async set(key, value, ttlOrOptions) {
+		const parsedKey = this.parseKey(key);
+		const { ttl, tags, onConflict, vector, staleAt } = this.resolveSetOptions(ttlOrOptions);
+		this.log("caching", parsedKey);
+		const existingValue = onConflict === "upsert" ? null : await this.get(key);
+		const exists = existingValue !== null;
+		if (onConflict === "create" && exists) return {
+			wasSet: false,
+			existing: existingValue
+		};
+		if (onConflict === "update" && !exists) return {
+			wasSet: false,
+			existing: null
+		};
+		const data = this.prepareDataForStorage(value, ttl, staleAt);
+		if (ttl) this.setTemporaryData(key, parsedKey, ttl);
+		set(this.data, parsedKey, data);
+		this.trackAccess(parsedKey);
+		if (!exists && this.options.maxSize) await this.enforceMaxSize();
+		if (tags && tags.length > 0) await this.applyTags(parsedKey, tags);
+		if (vector) this.vectorIndex.set(parsedKey, vector.slice());
+		this.log("cached", parsedKey);
+		await this.emit("set", {
+			key: parsedKey,
+			value,
+			ttl
+		});
+		if (onConflict === "create" || onConflict === "update") return {
+			wasSet: true,
+			existing: null
+		};
+		return this;
+	}
+	/**
+	* {@inheritdoc}
+	*/
+	async get(key) {
+		const parsedKey = this.parseKey(key);
+		this.log("fetching", parsedKey);
+		const value = get(this.data, parsedKey);
+		if (!value) {
+			this.log("notFound", parsedKey);
+			await this.emit("miss", { key: parsedKey });
+			return null;
+		}
+		const result = await this.parseCachedData(parsedKey, value);
+		if (result === null) await this.emit("miss", { key: parsedKey });
+		else {
+			this.trackAccess(parsedKey);
+			await this.emit("hit", {
+				key: parsedKey,
+				value: result
+			});
+		}
+		return result;
+	}
+	/**
+	* Read the raw {@link CacheData} wrapper, including `staleAt` metadata.
+	* Returns `null` for missing or expired entries so the SWR flow can branch
+	* cleanly. Does not emit `hit`/`miss` events — that's `get()`'s job.
+	*/
+	async getEntry(key) {
+		const parsedKey = this.parseKey(key);
+		const entry = get(this.data, parsedKey);
+		if (!entry) return null;
+		if (entry.expiresAt !== void 0 && entry.expiresAt <= Date.now()) return null;
+		return entry;
+	}
+	/**
+	* {@inheritdoc}
+	*/
+	async remove(key) {
+		const parsedKey = this.parseKey(key);
+		this.log("removing", parsedKey);
+		unset(this.data, [parsedKey]);
+		delete this.temporaryData[parsedKey];
+		this.removeFromAccessOrder(parsedKey);
+		this.vectorIndex.delete(parsedKey);
+		this.log("removed", parsedKey);
+		await this.emit("removed", { key: parsedKey });
+	}
+	/**
+	* {@inheritdoc}
+	*/
+	async flush() {
+		this.log("flushing");
+		if (this.options.globalPrefix) this.removeNamespace("");
+		else {
+			this.data = {};
+			this.accessOrder = [];
+			this.vectorIndex.clear();
+		}
+		this.log("flushed");
+		await this.emit("flushed");
+	}
+	/**
+	* Set the temporary data
+	*/
+	setTemporaryData(key, parsedKey, ttl) {
+		this.temporaryData[parsedKey] = {
+			key: JSON.stringify(key),
+			expiresAt: Date.now() + ttl * 1e3
+		};
+	}
+	/**
+	* Track access for LRU eviction
+	*/
+	trackAccess(key) {
+		if (!this.options.maxSize) return;
+		const index = this.accessOrder.indexOf(key);
+		if (index > -1) this.accessOrder.splice(index, 1);
+		this.accessOrder.push(key);
+	}
+	/**
+	* Remove key from access order tracking
+	*/
+	removeFromAccessOrder(key) {
+		const index = this.accessOrder.indexOf(key);
+		if (index > -1) this.accessOrder.splice(index, 1);
+	}
+	/**
+	* Enforce max size by evicting least recently used items.
+	*
+	* Recomputes the live cache size on every iteration — a single snapshot at
+	* the top of the loop would go stale and cause this routine to evict every
+	* entry in `accessOrder` (including the just-inserted key).
+	*/
+	async enforceMaxSize() {
+		if (!this.options.maxSize) return;
+		while (this.getCacheSize() > this.options.maxSize && this.accessOrder.length > 0) {
+			const lruKey = this.accessOrder.shift();
+			if (!lruKey) break;
+			this.log("removing", lruKey);
+			unset(this.data, [lruKey]);
+			delete this.temporaryData[lruKey];
+			this.vectorIndex.delete(lruKey);
+			this.log("removed", lruKey);
+		}
+	}
+	/**
+	* Get current cache size (number of cached items)
+	*/
+	getCacheSize() {
+		return Object.keys(this.data).length;
+	}
+	/**
+	* {@inheritdoc}
+	*
+	* Brute-force O(N) cosine similarity over every entry that was written with
+	* `set({ vector })`. Suitable for development and small in-memory knowledge
+	* bases — not for production beyond ~10k entries. Use the `pg` driver
+	* (with pgvector) or `redis` (with RediSearch) at scale.
+	*
+	* @warning Dev-only — O(N) per query.
+	*/
+	async similar(vector, options) {
+		const tagFilter = await this.getKeysForTags(options.tags);
+		const hits = [];
+		for (const [parsedKey, stored] of this.vectorIndex) {
+			if (tagFilter && !tagFilter.has(parsedKey)) continue;
+			const value = await this.get(parsedKey);
+			if (value === null) continue;
+			const score = cosineSimilarity(vector, stored);
+			if (options.threshold !== void 0 && score < options.threshold) continue;
+			hits.push({
+				key: parsedKey,
+				value,
+				score
+			});
+		}
+		hits.sort((a, b) => b.score - a.score);
+		if (options.topK >= 0 && hits.length > options.topK) hits.length = options.topK;
+		return hits;
+	}
+	/**
+	* {@inheritdoc}
+	*/
+	async disconnect() {
+		if (this.cleanupInterval) {
+			clearInterval(this.cleanupInterval);
+			this.cleanupInterval = void 0;
+		}
+		await super.disconnect();
+	}
+};
+
+//#endregion
+export { MemoryCacheDriver };
+//# sourceMappingURL=memory-cache-driver.mjs.map

package/esm/drivers/memory-cache-driver.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-cache-driver.mjs","names":[],"sources":["../../../../../../@warlock.js/cache/src/drivers/memory-cache-driver.ts"],"sourcesContent":["import type { GenericObject } from \"@mongez/reinforcements\";\r\nimport { get, set, unset } from \"@mongez/reinforcements\";\r\nimport type {\r\n  CacheData,\r\n  CacheDriver,\r\n  CacheKey,\r\n  CacheSetOptions,\r\n  CacheSetResult,\r\n  CacheSimilarHit,\r\n  CacheSimilarOptions,\r\n  CacheTtl,\r\n  MemoryCacheOptions,\r\n} from \"../types\";\r\nimport { cosineSimilarity } from \"../utils\";\r\nimport { BaseCacheDriver } from \"./base-cache-driver\";\r\n\r\nexport class MemoryCacheDriver\r\n  extends BaseCacheDriver<MemoryCacheDriver, MemoryCacheOptions>\r\n  implements CacheDriver<MemoryCacheDriver, MemoryCacheOptions>\r\n{\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public name = \"memory\";\r\n\r\n  /**\r\n   * Cached data\r\n   */\r\n  public data: GenericObject = {};\r\n\r\n  /**\r\n   * List of data that will be cleared from cache\r\n   */\r\n  protected temporaryData: Record<\r\n    string,\r\n    {\r\n      key: string;\r\n      expiresAt: number;\r\n    }\r\n  > = {};\r\n\r\n  /**\r\n   * Cleanup interval reference\r\n   */\r\n  protected cleanupInterval?: NodeJS.Timeout;\r\n\r\n  /**\r\n   * Access order tracking for LRU eviction (when maxSize is set)\r\n   */\r\n  protected accessOrder: string[] = [];\r\n\r\n  /**\r\n   * Parallel vector index keyed by parsedKey. Populated by `set({ vector })`,\r\n   * scanned by `similar()`. Lifetime mirrors the main entry — cleared on\r\n   * `remove`, `flush`, expiry, namespace clear, and LRU eviction.\r\n   */\r\n  protected vectorIndex: Map<string, number[]> = new Map();\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public constructor() {\r\n    super();\r\n\r\n    this.startCleanup();\r\n  }\r\n\r\n  /**\r\n   * Start the cleanup process whenever a data that has a cache key is set\r\n   */\r\n  public startCleanup() {\r\n    // Clear existing interval if any\r\n    if (this.cleanupInterval) {\r\n      clearInterval(this.cleanupInterval);\r\n    }\r\n\r\n    this.cleanupInterval = setInterval(async () => {\r\n      const now = Date.now();\r\n\r\n      for (const key in this.temporaryData) {\r\n        if (this.temporaryData[key].expiresAt <= now) {\r\n          await this.remove(this.temporaryData[key].key);\r\n          delete this.temporaryData[key];\r\n\r\n          this.log(\"expired\", key);\r\n          // Emit expired event\r\n          await this.emit(\"expired\", { key });\r\n        }\r\n      }\r\n    }, 1000);\r\n\r\n    // do not block the process from exiting\r\n    this.cleanupInterval.unref();\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public async removeNamespace(namespace: string) {\r\n    this.log(\"clearing\", namespace);\r\n\r\n    namespace = this.parseKey(namespace);\r\n\r\n    unset(this.data, [namespace]);\r\n\r\n    // Drop vector entries that fall under this namespace.\r\n    if (namespace === \"\") {\r\n      this.vectorIndex.clear();\r\n    } else {\r\n      const prefix = namespace + \".\";\r\n      for (const k of [...this.vectorIndex.keys()]) {\r\n        if (k === namespace || k.startsWith(prefix)) {\r\n          this.vectorIndex.delete(k);\r\n        }\r\n      }\r\n    }\r\n\r\n    this.log(\"cleared\", namespace);\r\n\r\n    return this;\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public async set(\r\n    key: CacheKey,\r\n    value: any,\r\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\r\n  ): Promise<any> {\r\n    const parsedKey = this.parseKey(key);\r\n    const { ttl, tags, onConflict, vector, staleAt } = this.resolveSetOptions(ttlOrOptions);\r\n\r\n    this.log(\"caching\", parsedKey);\r\n\r\n    // Use get() for the existence check so expired entries are treated as\r\n    // missing (and cleaned up as a side effect). A raw map lookup would let\r\n    // stale entries block onConflict: \"create\" even after their TTL elapsed.\r\n    const existingValue = onConflict === \"upsert\" ? null : await this.get(key);\r\n    const exists = existingValue !== null;\r\n\r\n    if (onConflict === \"create\" && exists) {\r\n      const result: CacheSetResult = { wasSet: false, existing: existingValue };\r\n      return result;\r\n    }\r\n\r\n    if (onConflict === \"update\" && !exists) {\r\n      const result: CacheSetResult = { wasSet: false, existing: null };\r\n      return result;\r\n    }\r\n\r\n    const data = this.prepareDataForStorage(value, ttl, staleAt);\r\n\r\n    if (ttl) {\r\n      this.setTemporaryData(key, parsedKey, ttl);\r\n    }\r\n\r\n    set(this.data, parsedKey, data);\r\n\r\n    this.trackAccess(parsedKey);\r\n\r\n    if (!exists && this.options.maxSize) {\r\n      await this.enforceMaxSize();\r\n    }\r\n\r\n    if (tags && tags.length > 0) {\r\n      await this.applyTags(parsedKey, tags);\r\n    }\r\n\r\n    if (vector) {\r\n      this.vectorIndex.set(parsedKey, vector.slice());\r\n    }\r\n\r\n    this.log(\"cached\", parsedKey);\r\n\r\n    await this.emit(\"set\", { key: parsedKey, value, ttl });\r\n\r\n    if (onConflict === \"create\" || onConflict === \"update\") {\r\n      const result: CacheSetResult = { wasSet: true, existing: null };\r\n      return result;\r\n    }\r\n\r\n    return this;\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public async get(key: CacheKey) {\r\n    const parsedKey = this.parseKey(key);\r\n\r\n    this.log(\"fetching\", parsedKey);\r\n\r\n    const value: CacheData = get(this.data, parsedKey);\r\n\r\n    if (!value) {\r\n      this.log(\"notFound\", parsedKey);\r\n      // Emit miss event\r\n      await this.emit(\"miss\", { key: parsedKey });\r\n      return null;\r\n    }\r\n\r\n    const result = await this.parseCachedData(parsedKey, value);\r\n\r\n    if (result === null) {\r\n      // Expired\r\n      await this.emit(\"miss\", { key: parsedKey });\r\n    } else {\r\n      // Track access for LRU\r\n      this.trackAccess(parsedKey);\r\n      // Emit hit event\r\n      await this.emit(\"hit\", { key: parsedKey, value: result });\r\n    }\r\n\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Read the raw {@link CacheData} wrapper, including `staleAt` metadata.\r\n   * Returns `null` for missing or expired entries so the SWR flow can branch\r\n   * cleanly. Does not emit `hit`/`miss` events — that's `get()`'s job.\r\n   */\r\n  protected async getEntry(key: CacheKey): Promise<CacheData | null> {\r\n    const parsedKey = this.parseKey(key);\r\n    const entry: CacheData | undefined = get(this.data, parsedKey);\r\n\r\n    if (!entry) {\r\n      return null;\r\n    }\r\n\r\n    if (entry.expiresAt !== undefined && entry.expiresAt <= Date.now()) {\r\n      return null;\r\n    }\r\n\r\n    return entry;\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public async remove(key: CacheKey) {\r\n    const parsedKey = this.parseKey(key);\r\n\r\n    this.log(\"removing\", parsedKey);\r\n\r\n    unset(this.data, [parsedKey]);\r\n\r\n    // Clean up from temporaryData as well\r\n    delete this.temporaryData[parsedKey];\r\n\r\n    // Remove from access order\r\n    this.removeFromAccessOrder(parsedKey);\r\n\r\n    // Drop the vector index entry if any\r\n    this.vectorIndex.delete(parsedKey);\r\n\r\n    this.log(\"removed\", parsedKey);\r\n\r\n    // Emit removed event\r\n    await this.emit(\"removed\", { key: parsedKey });\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public async flush() {\r\n    this.log(\"flushing\");\r\n    if (this.options.globalPrefix) {\r\n      this.removeNamespace(\"\");\r\n    } else {\r\n      this.data = {};\r\n      this.accessOrder = [];\r\n      this.vectorIndex.clear();\r\n    }\r\n\r\n    this.log(\"flushed\");\r\n\r\n    // Emit flushed event\r\n    await this.emit(\"flushed\");\r\n  }\r\n\r\n  /**\r\n   * Set the temporary data\r\n   */\r\n  protected setTemporaryData(key: CacheKey, parsedKey: string, ttl: number) {\r\n    this.temporaryData[parsedKey] = {\r\n      key: JSON.stringify(key),\r\n      expiresAt: Date.now() + ttl * 1000,\r\n    };\r\n  }\r\n\r\n  /**\r\n   * Track access for LRU eviction\r\n   */\r\n  protected trackAccess(key: string) {\r\n    if (!this.options.maxSize) return;\r\n\r\n    // Remove key from current position\r\n    const index = this.accessOrder.indexOf(key);\r\n    if (index > -1) {\r\n      this.accessOrder.splice(index, 1);\r\n    }\r\n\r\n    // Add to end (most recently used)\r\n    this.accessOrder.push(key);\r\n  }\r\n\r\n  /**\r\n   * Remove key from access order tracking\r\n   */\r\n  protected removeFromAccessOrder(key: string) {\r\n    const index = this.accessOrder.indexOf(key);\r\n    if (index > -1) {\r\n      this.accessOrder.splice(index, 1);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Enforce max size by evicting least recently used items.\r\n   *\r\n   * Recomputes the live cache size on every iteration — a single snapshot at\r\n   * the top of the loop would go stale and cause this routine to evict every\r\n   * entry in `accessOrder` (including the just-inserted key).\r\n   */\r\n  protected async enforceMaxSize() {\r\n    if (!this.options.maxSize) {\r\n      return;\r\n    }\r\n\r\n    while (\r\n      this.getCacheSize() > this.options.maxSize &&\r\n      this.accessOrder.length > 0\r\n    ) {\r\n      const lruKey = this.accessOrder.shift();\r\n      if (!lruKey) {\r\n        break;\r\n      }\r\n\r\n      this.log(\"removing\", lruKey);\r\n      unset(this.data, [lruKey]);\r\n      delete this.temporaryData[lruKey];\r\n      this.vectorIndex.delete(lruKey);\r\n      this.log(\"removed\", lruKey);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Get current cache size (number of cached items)\r\n   */\r\n  protected getCacheSize(): number {\r\n    // Count top-level keys in data object\r\n    return Object.keys(this.data).length;\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   *\r\n   * Brute-force O(N) cosine similarity over every entry that was written with\r\n   * `set({ vector })`. Suitable for development and small in-memory knowledge\r\n   * bases — not for production beyond ~10k entries. Use the `pg` driver\r\n   * (with pgvector) or `redis` (with RediSearch) at scale.\r\n   *\r\n   * @warning Dev-only — O(N) per query.\r\n   */\r\n  public async similar<T = any>(\r\n    vector: number[],\r\n    options: CacheSimilarOptions,\r\n  ): Promise<CacheSimilarHit<T>[]> {\r\n    const tagFilter = await this.getKeysForTags(options.tags);\r\n\r\n    const hits: CacheSimilarHit<T>[] = [];\r\n\r\n    for (const [parsedKey, stored] of this.vectorIndex) {\r\n      if (tagFilter && !tagFilter.has(parsedKey)) {\r\n        continue;\r\n      }\r\n\r\n      const value = (await this.get(parsedKey)) as T | null;\r\n      // get() returns null for expired entries — and remove() drops the vector\r\n      // index, so the next pass won't see it. Skip in case of timing.\r\n      if (value === null) {\r\n        continue;\r\n      }\r\n\r\n      const score = cosineSimilarity(vector, stored);\r\n\r\n      if (options.threshold !== undefined && score < options.threshold) {\r\n        continue;\r\n      }\r\n\r\n      hits.push({ key: parsedKey, value, score });\r\n    }\r\n\r\n    hits.sort((a, b) => b.score - a.score);\r\n\r\n    if (options.topK >= 0 && hits.length > options.topK) {\r\n      hits.length = options.topK;\r\n    }\r\n\r\n    return hits;\r\n  }\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public async disconnect() {\r\n    // Clear the cleanup interval to prevent memory leaks\r\n    if (this.cleanupInterval) {\r\n      clearInterval(this.cleanupInterval);\r\n      this.cleanupInterval = undefined;\r\n    }\r\n\r\n    await super.disconnect();\r\n  }\r\n}\r\n"],"mappings":";;;;;AAgBA,IAAa,oBAAb,cACU,gBAEV;;;;CA0CE,AAAO,cAAc;EACnB,MAAM;cAvCM;cAKe,CAAC;uBAW1B,CAAC;qBAU6B,CAAC;qCAOY,IAAI,IAAI;EAQrD,KAAK,aAAa;CACpB;;;;CAKA,AAAO,eAAe;EAEpB,IAAI,KAAK,iBACP,cAAc,KAAK,eAAe;EAGpC,KAAK,kBAAkB,YAAY,YAAY;GAC7C,MAAM,MAAM,KAAK,IAAI;GAErB,KAAK,MAAM,OAAO,KAAK,eACrB,IAAI,KAAK,cAAc,KAAK,aAAa,KAAK;IAC5C,MAAM,KAAK,OAAO,KAAK,cAAc,KAAK,GAAG;IAC7C,OAAO,KAAK,cAAc;IAE1B,KAAK,IAAI,WAAW,GAAG;IAEvB,MAAM,KAAK,KAAK,WAAW,EAAE,IAAI,CAAC;GACpC;EAEJ,GAAG,GAAI;EAGP,KAAK,gBAAgB,MAAM;CAC7B;;;;CAKA,MAAa,gBAAgB,WAAmB;EAC9C,KAAK,IAAI,YAAY,SAAS;EAE9B,YAAY,KAAK,SAAS,SAAS;EAEnC,MAAM,KAAK,MAAM,CAAC,SAAS,CAAC;EAG5B,IAAI,cAAc,IAChB,KAAK,YAAY,MAAM;OAClB;GACL,MAAM,SAAS,YAAY;GAC3B,KAAK,MAAM,KAAK,CAAC,GAAG,KAAK,YAAY,KAAK,CAAC,GACzC,IAAI,MAAM,aAAa,EAAE,WAAW,MAAM,GACxC,KAAK,YAAY,OAAO,CAAC;EAG/B;EAEA,KAAK,IAAI,WAAW,SAAS;EAE7B,OAAO;CACT;;;;CAKA,MAAa,IACX,KACA,OACA,cACc;EACd,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,EAAE,KAAK,MAAM,YAAY,QAAQ,YAAY,KAAK,kBAAkB,YAAY;EAEtF,KAAK,IAAI,WAAW,SAAS;EAK7B,MAAM,gBAAgB,eAAe,WAAW,OAAO,MAAM,KAAK,IAAI,GAAG;EACzE,MAAM,SAAS,kBAAkB;EAEjC,IAAI,eAAe,YAAY,QAE7B,OAAO;GAD0B,QAAQ;GAAO,UAAU;EAC9C;EAGd,IAAI,eAAe,YAAY,CAAC,QAE9B,OAAO;GAD0B,QAAQ;GAAO,UAAU;EAC9C;EAGd,MAAM,OAAO,KAAK,sBAAsB,OAAO,KAAK,OAAO;EAE3D,IAAI,KACF,KAAK,iBAAiB,KAAK,WAAW,GAAG;EAG3C,IAAI,KAAK,MAAM,WAAW,IAAI;EAE9B,KAAK,YAAY,SAAS;EAE1B,IAAI,CAAC,UAAU,KAAK,QAAQ,SAC1B,MAAM,KAAK,eAAe;EAG5B,IAAI,QAAQ,KAAK,SAAS,GACxB,MAAM,KAAK,UAAU,WAAW,IAAI;EAGtC,IAAI,QACF,KAAK,YAAY,IAAI,WAAW,OAAO,MAAM,CAAC;EAGhD,KAAK,IAAI,UAAU,SAAS;EAE5B,MAAM,KAAK,KAAK,OAAO;GAAE,KAAK;GAAW;GAAO;EAAI,CAAC;EAErD,IAAI,eAAe,YAAY,eAAe,UAE5C,OAAO;GAD0B,QAAQ;GAAM,UAAU;EAC7C;EAGd,OAAO;CACT;;;;CAKA,MAAa,IAAI,KAAe;EAC9B,MAAM,YAAY,KAAK,SAAS,GAAG;EAEnC,KAAK,IAAI,YAAY,SAAS;EAE9B,MAAM,QAAmB,IAAI,KAAK,MAAM,SAAS;EAEjD,IAAI,CAAC,OAAO;GACV,KAAK,IAAI,YAAY,SAAS;GAE9B,MAAM,KAAK,KAAK,QAAQ,EAAE,KAAK,UAAU,CAAC;GAC1C,OAAO;EACT;EAEA,MAAM,SAAS,MAAM,KAAK,gBAAgB,WAAW,KAAK;EAE1D,IAAI,WAAW,MAEb,MAAM,KAAK,KAAK,QAAQ,EAAE,KAAK,UAAU,CAAC;OACrC;GAEL,KAAK,YAAY,SAAS;GAE1B,MAAM,KAAK,KAAK,OAAO;IAAE,KAAK;IAAW,OAAO;GAAO,CAAC;EAC1D;EAEA,OAAO;CACT;;;;;;CAOA,MAAgB,SAAS,KAA0C;EACjE,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,QAA+B,IAAI,KAAK,MAAM,SAAS;EAE7D,IAAI,CAAC,OACH,OAAO;EAGT,IAAI,MAAM,cAAc,UAAa,MAAM,aAAa,KAAK,IAAI,GAC/D,OAAO;EAGT,OAAO;CACT;;;;CAKA,MAAa,OAAO,KAAe;EACjC,MAAM,YAAY,KAAK,SAAS,GAAG;EAEnC,KAAK,IAAI,YAAY,SAAS;EAE9B,MAAM,KAAK,MAAM,CAAC,SAAS,CAAC;EAG5B,OAAO,KAAK,cAAc;EAG1B,KAAK,sBAAsB,SAAS;EAGpC,KAAK,YAAY,OAAO,SAAS;EAEjC,KAAK,IAAI,WAAW,SAAS;EAG7B,MAAM,KAAK,KAAK,WAAW,EAAE,KAAK,UAAU,CAAC;CAC/C;;;;CAKA,MAAa,QAAQ;EACnB,KAAK,IAAI,UAAU;EACnB,IAAI,KAAK,QAAQ,cACf,KAAK,gBAAgB,EAAE;OAClB;GACL,KAAK,OAAO,CAAC;GACb,KAAK,cAAc,CAAC;GACpB,KAAK,YAAY,MAAM;EACzB;EAEA,KAAK,IAAI,SAAS;EAGlB,MAAM,KAAK,KAAK,SAAS;CAC3B;;;;CAKA,AAAU,iBAAiB,KAAe,WAAmB,KAAa;EACxE,KAAK,cAAc,aAAa;GAC9B,KAAK,KAAK,UAAU,GAAG;GACvB,WAAW,KAAK,IAAI,IAAI,MAAM;EAChC;CACF;;;;CAKA,AAAU,YAAY,KAAa;EACjC,IAAI,CAAC,KAAK,QAAQ,SAAS;EAG3B,MAAM,QAAQ,KAAK,YAAY,QAAQ,GAAG;EAC1C,IAAI,QAAQ,IACV,KAAK,YAAY,OAAO,OAAO,CAAC;EAIlC,KAAK,YAAY,KAAK,GAAG;CAC3B;;;;CAKA,AAAU,sBAAsB,KAAa;EAC3C,MAAM,QAAQ,KAAK,YAAY,QAAQ,GAAG;EAC1C,IAAI,QAAQ,IACV,KAAK,YAAY,OAAO,OAAO,CAAC;CAEpC;;;;;;;;CASA,MAAgB,iBAAiB;EAC/B,IAAI,CAAC,KAAK,QAAQ,SAChB;EAGF,OACE,KAAK,aAAa,IAAI,KAAK,QAAQ,WACnC,KAAK,YAAY,SAAS,GAC1B;GACA,MAAM,SAAS,KAAK,YAAY,MAAM;GACtC,IAAI,CAAC,QACH;GAGF,KAAK,IAAI,YAAY,MAAM;GAC3B,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC;GACzB,OAAO,KAAK,cAAc;GAC1B,KAAK,YAAY,OAAO,MAAM;GAC9B,KAAK,IAAI,WAAW,MAAM;EAC5B;CACF;;;;CAKA,AAAU,eAAuB;EAE/B,OAAO,OAAO,KAAK,KAAK,IAAI,EAAE;CAChC;;;;;;;;;;;CAYA,MAAa,QACX,QACA,SAC+B;EAC/B,MAAM,YAAY,MAAM,KAAK,eAAe,QAAQ,IAAI;EAExD,MAAM,OAA6B,CAAC;EAEpC,KAAK,MAAM,CAAC,WAAW,WAAW,KAAK,aAAa;GAClD,IAAI,aAAa,CAAC,UAAU,IAAI,SAAS,GACvC;GAGF,MAAM,QAAS,MAAM,KAAK,IAAI,SAAS;GAGvC,IAAI,UAAU,MACZ;GAGF,MAAM,QAAQ,iBAAiB,QAAQ,MAAM;GAE7C,IAAI,QAAQ,cAAc,UAAa,QAAQ,QAAQ,WACrD;GAGF,KAAK,KAAK;IAAE,KAAK;IAAW;IAAO;GAAM,CAAC;EAC5C;EAEA,KAAK,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;EAErC,IAAI,QAAQ,QAAQ,KAAK,KAAK,SAAS,QAAQ,MAC7C,KAAK,SAAS,QAAQ;EAGxB,OAAO;CACT;;;;CAKA,MAAa,aAAa;EAExB,IAAI,KAAK,iBAAiB;GACxB,cAAc,KAAK,eAAe;GAClC,KAAK,kBAAkB;EACzB;EAEA,MAAM,MAAM,WAAW;CACzB;AACF"}

package/esm/drivers/memory-extended-cache-driver.d.mts

@@ -0,0 +1,17 @@
+import { MemoryCacheDriver } from "./memory-cache-driver.mjs";
+import { CacheDriver, CacheKey, MemoryExtendedCacheOptions } from "../types.mjs";
+
+//#region ../../@warlock.js/cache/src/drivers/memory-extended-cache-driver.d.ts
+declare class MemoryExtendedCacheDriver extends MemoryCacheDriver implements CacheDriver<MemoryExtendedCacheDriver, MemoryExtendedCacheOptions> {
+  /**
+   * {@inheritdoc}
+   */
+  name: string;
+  /**
+   * {@inheritdoc}
+   */
+  get(key: CacheKey): Promise<any>;
+}
+//#endregion
+export { MemoryExtendedCacheDriver };
+//# sourceMappingURL=memory-extended-cache-driver.d.mts.map

package/esm/drivers/memory-extended-cache-driver.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-extended-cache-driver.d.mts","names":[],"sources":["../../../../../../@warlock.js/cache/src/drivers/memory-extended-cache-driver.ts"],"mappings":";;;;cAKa,yBAAA,SACH,iBAAA,YACG,WAAA,CAAY,yBAAA,EAA2B,0BAAA;;AAFpD;;EAOS,IAAA;EALgB;;;EAUV,GAAA,CAAI,GAAA,EAAK,QAAA,GAAQ,OAAA;AAAA"}

package/esm/drivers/memory-extended-cache-driver.mjs

@@ -0,0 +1,34 @@
+import { parseTtl } from "../utils.mjs";
+import { MemoryCacheDriver } from "./memory-cache-driver.mjs";
+import { get } from "@mongez/reinforcements";
+
+//#region ../../@warlock.js/cache/src/drivers/memory-extended-cache-driver.ts
+var MemoryExtendedCacheDriver = class extends MemoryCacheDriver {
+	constructor(..._args) {
+		super(..._args);
+		this.name = "memoryExtended";
+	}
+	/**
+	* {@inheritdoc}
+	*/
+	async get(key) {
+		const parsedKey = this.parseKey(key);
+		this.log("fetching", parsedKey);
+		const value = get(this.data, parsedKey);
+		if (!value) {
+			this.log("notFound", parsedKey);
+			return null;
+		}
+		const rawTtl = value.ttl ?? this.options.ttl;
+		const ttl = rawTtl !== void 0 ? parseTtl(rawTtl) : void 0;
+		if (ttl) {
+			this.setTemporaryData(key, parsedKey, ttl);
+			value.expiresAt = this.getExpiresAt(ttl);
+		}
+		return this.parseCachedData(parsedKey, value);
+	}
+};
+
+//#endregion
+export { MemoryExtendedCacheDriver };
+//# sourceMappingURL=memory-extended-cache-driver.mjs.map

package/esm/drivers/memory-extended-cache-driver.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-extended-cache-driver.mjs","names":[],"sources":["../../../../../../@warlock.js/cache/src/drivers/memory-extended-cache-driver.ts"],"sourcesContent":["import { get } from \"@mongez/reinforcements\";\r\nimport type { CacheData, CacheDriver, CacheKey, MemoryExtendedCacheOptions } from \"../types\";\r\nimport { parseTtl } from \"../utils\";\r\nimport { MemoryCacheDriver } from \"./memory-cache-driver\";\r\n\r\nexport class MemoryExtendedCacheDriver\r\n  extends MemoryCacheDriver\r\n  implements CacheDriver<MemoryExtendedCacheDriver, MemoryExtendedCacheOptions>\r\n{\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public name = \"memoryExtended\";\r\n\r\n  /**\r\n   * {@inheritdoc}\r\n   */\r\n  public async get(key: CacheKey) {\r\n    const parsedKey = this.parseKey(key);\r\n\r\n    this.log(\"fetching\", parsedKey);\r\n\r\n    const value: CacheData = get(this.data, parsedKey);\r\n\r\n    if (!value) {\r\n      this.log(\"notFound\", parsedKey);\r\n      return null;\r\n    }\r\n\r\n    const rawTtl = value.ttl ?? this.options.ttl;\r\n    const ttl = rawTtl !== undefined ? parseTtl(rawTtl) : undefined;\r\n\r\n    if (ttl) {\r\n      // reset the expiration time\r\n      this.setTemporaryData(key, parsedKey, ttl);\r\n      value.expiresAt = this.getExpiresAt(ttl);\r\n    }\r\n\r\n    return this.parseCachedData(parsedKey, value);\r\n  }\r\n}\r\n"],"mappings":";;;;;AAKA,IAAa,4BAAb,cACU,kBAEV;;;cAIgB;;;;;CAKd,MAAa,IAAI,KAAe;EAC9B,MAAM,YAAY,KAAK,SAAS,GAAG;EAEnC,KAAK,IAAI,YAAY,SAAS;EAE9B,MAAM,QAAmB,IAAI,KAAK,MAAM,SAAS;EAEjD,IAAI,CAAC,OAAO;GACV,KAAK,IAAI,YAAY,SAAS;GAC9B,OAAO;EACT;EAEA,MAAM,SAAS,MAAM,OAAO,KAAK,QAAQ;EACzC,MAAM,MAAM,WAAW,SAAY,SAAS,MAAM,IAAI;EAEtD,IAAI,KAAK;GAEP,KAAK,iBAAiB,KAAK,WAAW,GAAG;GACzC,MAAM,YAAY,KAAK,aAAa,GAAG;EACzC;EAEA,OAAO,KAAK,gBAAgB,WAAW,KAAK;CAC9C;AACF"}

package/esm/drivers/mock-cache-driver.d.mts

@@ -0,0 +1,137 @@
+import { BaseCacheDriver } from "./base-cache-driver.mjs";
+import { CacheCall, CacheData, CacheDriver, CacheKey, CacheSetOptions, CacheTtl, MockCacheOptions } from "../types.mjs";
+
+//#region ../../@warlock.js/cache/src/drivers/mock-cache-driver.d.ts
+/**
+ * In-memory cache driver with introspection helpers, intended for use as a
+ * test double in downstream packages.
+ *
+ * **Role.** Drop-in replacement for any real driver in test setups, with
+ * extra surface that makes behavioral assertions easy: every public op gets
+ * recorded into {@link MockCacheDriver.callLog}, and {@link wasCalled} /
+ * {@link getStored} / {@link reset} let tests verify side effects without
+ * pulling in a real Redis / Postgres / file system.
+ *
+ * **Responsibility.**
+ * - Owns: in-memory storage backed by a `Map`, the `callLog`, TTL handling
+ *   via `parseCachedData`, `onConflict` policies, and tag-index storage.
+ * - Does NOT own: similarity retrieval (vectors are recorded into the
+ *   `callLog` but `similar()` throws — use `MemoryCacheDriver` for tests
+ *   that need real nearest-neighbor scoring), connection lifecycle
+ *   (no-op `connect`/`disconnect`), or eviction (no `maxSize`).
+ *
+ * Register it like any other driver — sub-paths are not part of the
+ * package's export convention; the same single barrel ships it next to
+ * the production drivers.
+ *
+ * @example
+ * import { cache, MockCacheDriver } from "@warlock.js/cache";
+ *
+ * beforeEach(async () => {
+ *   cache.setCacheConfigurations({
+ *     default: "mock",
+ *     drivers: { mock: MockCacheDriver },
+ *     options: { mock: {} },
+ *   });
+ *   await cache.init();
+ * });
+ *
+ * it("invalidates the user cache after update", async () => {
+ *   await userService.update(42, { name: "Jane" });
+ *
+ *   const driver = cache.currentDriver as MockCacheDriver;
+ *   expect(driver.wasCalled("remove", "users.42")).toBe(true);
+ * });
+ */
+declare class MockCacheDriver extends BaseCacheDriver<MockCacheDriver, MockCacheOptions> implements CacheDriver<MockCacheDriver, MockCacheOptions> {
+  /**
+   * {@inheritdoc}
+   */
+  name: string;
+  /**
+   * {@inheritdoc}
+   */
+  options: MockCacheOptions;
+  /**
+   * Storage backing the mock — keyed by post-`parseKey` string. Public-readonly
+   * so tests can introspect raw entries when {@link getStored} isn't enough.
+   */
+  readonly storage: Map<string, CacheData>;
+  /**
+   * Ordered record of every public operation routed through this driver.
+   * Pushed to before each op runs; tests assert via {@link wasCalled} or by
+   * inspecting the array directly.
+   */
+  readonly callLog: CacheCall[];
+  /**
+   * Standard driver setup. Mirrors the null driver — no connection, no
+   * resources to release.
+   */
+  connect(): Promise<void>;
+  /**
+   * Standard driver teardown.
+   */
+  disconnect(): Promise<void>;
+  /**
+   * Wipe everything under `namespace`. Matches `MemoryCacheDriver` semantics
+   * — the namespace itself and any key with the namespace prefix is removed.
+   */
+  removeNamespace(namespace: string): Promise<void>;
+  /**
+   * Standard `set` with full `onConflict` support. Honors scope-default TTL
+   * via {@link BaseCacheDriver.resolveSetOptions}.
+   */
+  set(key: CacheKey, value: any, ttlOrOptions?: CacheTtl | CacheSetOptions): Promise<any>;
+  /**
+   * Standard `get` with TTL handling. Emits `hit` / `miss` events to keep
+   * downstream metrics tests realistic.
+   */
+  get<T = any>(key: CacheKey): Promise<T | null>;
+  /**
+   * Read the raw {@link CacheData} wrapper from the in-memory `Map`,
+   * including `staleAt` metadata. Returns `null` for missing or expired
+   * entries — `swr()` consumes this to branch on freshness.
+   */
+  protected getEntry(key: CacheKey): Promise<CacheData | null>;
+  /**
+   * Standard `remove` — drops the entry and emits the `removed` event.
+   */
+  remove(key: CacheKey): Promise<void>;
+  /**
+   * Standard `flush` — wipes the entire mock store + tag index. Does NOT
+   * touch the call log; use {@link reset} to clear that as well.
+   */
+  flush(): Promise<void>;
+  /**
+   * Was a given operation invoked? When `key` is provided, the match is
+   * post-`parseKey` so callers pass the same key shape they used at the
+   * call site — strings or objects, both resolve to the same parsed key.
+   *
+   * @example
+   * driver.wasCalled("set");                  // any set
+   * driver.wasCalled("set", "users.42");      // set on this specific key
+   * driver.wasCalled("set", { id: 42 });      // same — object key normalized
+   */
+  wasCalled(operation: string, key?: CacheKey): boolean;
+  /**
+   * Return the raw stored value for `key`, bypassing TTL handling and clone
+   * protection. Useful when a test wants to assert on the persisted shape
+   * (or assert that an entry expired without going through `get`).
+   *
+   * Returns `undefined` when the key isn't present.
+   */
+  getStored<T = any>(key: CacheKey): T | undefined;
+  /**
+   * Wipe everything — storage, tag index, and the call log. Pair with
+   * Vitest's `beforeEach` to get clean isolation between tests.
+   */
+  reset(): void;
+  /**
+   * Append a row to {@link callLog}. Internal helper called by every
+   * recorded op before the actual work runs.
+   */
+  protected recordCall(operation: string, key: string | undefined, args?: unknown[]): void;
+}
+//#endregion
+export { MockCacheDriver };
+//# sourceMappingURL=mock-cache-driver.d.mts.map

package/esm/drivers/mock-cache-driver.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mock-cache-driver.d.mts","names":[],"sources":["../../../../../../@warlock.js/cache/src/drivers/mock-cache-driver.ts"],"mappings":";;;;;;AAqDA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAAa,eAAA,SACH,eAAA,CAAgB,eAAA,EAAiB,gBAAA,aAC9B,WAAA,CAAY,eAAA,EAAiB,gBAAA;EAKjC;;;EAAA,IAAA;EAWkB;;;EANlB,OAAA,EAAS,gBAAA;EAmBH;;;;EAAA,SAbG,OAAA,EAAS,GAAA,SAAY,SAAA;EA8BR;;;;;EAAA,SAvBb,OAAA,EAAS,SAAA;EA+CR;;;;EAzCJ,OAAA,CAAA,GAAW,OAAA;EAuFP;;;EA/EJ,UAAA,CAAA,GAAc,OAAA;EA+EuB;;;;EAtErC,eAAA,CAAgB,SAAA,WAAoB,OAAA;EAyGA;;;;EApFpC,GAAA,CACX,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EAkHU;;;;EArEA,GAAA,SAAA,CAAa,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EAyFd;;;;;EAAA,UAtDpB,QAAA,CAAS,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,SAAA;EAwF1C;;;EAtEM,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EAkFlC;;AAAoB;;EAlET,KAAA,CAAA,GAAS,OAAA;;;;;;;;;;;EAoBf,SAAA,CAAU,SAAA,UAAmB,GAAA,GAAM,QAAA;;;;;;;;EAmBnC,SAAA,SAAA,CAAmB,GAAA,EAAK,QAAA,GAAW,CAAA;;;;;EAenC,KAAA,CAAA;;;;;YASG,UAAA,CACR,SAAA,UACA,GAAA,sBACA,IAAA;AAAA"}