@warlock.js/cache 5.29.0 → 5.30.0

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

@@ -1 +1 @@
-{"version":3,"file":"base-cache-driver.mjs","names":[],"sources":["../../../../../../../cache/src/drivers/base-cache-driver.ts"],"sourcesContent":["import { randomUUID } from \"node:crypto\";\nimport { log } from \"@warlock.js/logger\";\nimport { MemoryCacheList } from \"../list/memory-cache-list\";\nimport { TaggedCache } from \"../tagged-cache\";\nimport type {\n  CacheConflictPolicy,\n  CacheData,\n  CacheDriver,\n  CacheEventData,\n  CacheEventHandler,\n  CacheEventType,\n  CacheKey,\n  CacheListAccessor,\n  CacheOperationType,\n  CacheSetOptions,\n  CacheSetResult,\n  CacheSimilarHit,\n  CacheSimilarOptions,\n  CacheSwrOptions,\n  CacheTtl,\n  LockOptions,\n  LockOutcome,\n  RememberOptions,\n} from \"../types\";\nimport { CacheConfigurationError, CacheUnsupportedError } from \"../types\";\nimport {\n  normalizeToOptions,\n  parseCacheKey,\n  parseTtl,\n  resolveTtl,\n  safeErrorInfo,\n} from \"../utils\";\n\n/**\n * Normalized form of the 3rd `set` argument.\n *\n * All drivers operate on this shape internally regardless of whether the caller\n * passed a positional TTL, a duration string, or a rich options object.\n */\nexport type NormalizedSetOptions = {\n  /**\n   * Final TTL in seconds — already merged with the driver-level default\n   * (`this.options.ttl`). `Infinity` means \"no expiration\".\n   *\n   * Always populated. Drivers do NOT need to fall back to `this.ttl`\n   * themselves — `resolveSetOptions` does the merge centrally so that\n   * every driver respects the configured default without ceremony.\n   */\n  ttl: number;\n  /**\n   * Inline tag list, or undefined when none were provided.\n   */\n  tags?: string[];\n  /**\n   * Conflict policy. Defaults to `\"upsert\"`.\n   */\n  onConflict: CacheConflictPolicy;\n  /**\n   * Optional embedding vector for similarity retrieval. Drivers that do not\n   * support similarity must throw {@link CacheUnsupportedError} when this is\n   * present (rather than silently dropping it).\n   */\n  vector?: number[];\n  /**\n   * Optional freshness deadline as a millisecond timestamp. Set by `swr()`\n   * to mark when the entry stops being \"fresh\" and becomes\n   * \"stale-but-revalidatable.\" Drivers route this through\n   * `prepareDataForStorage` so it persists in the wrapper.\n   */\n  staleAt?: number;\n};\n\nconst messages = {\n  clearing: \"Clearing namespace\",\n  cleared: \"Namespace cleared\",\n  fetching: \"Fetching key\",\n  fetched: \"Key fetched\",\n  caching: \"Caching key\",\n  cached: \"Key cached\",\n  flushing: \"Flushing cache\",\n  flushed: \"Cache flushed\",\n  removing: \"Removing key\",\n  removed: \"Key removed\",\n  expired: \"Key expired\",\n  notFound: \"Key not found\",\n  connecting: \"Connecting to the cache engine.\",\n  connected: \"Connected to the cache engine.\",\n  disconnecting: \"Disconnecting from the cache engine.\",\n  disconnected: \"Disconnected from the cache engine.\",\n  connectionFailed: \"Failed to connect to the cache engine.\",\n  error: \"Error occurred\",\n};\n\nexport abstract class BaseCacheDriver<\n  ClientType,\n  Options extends Record<string, any>,\n> implements CacheDriver<ClientType, Options> {\n  /**\n   * CLient driver\n   */\n  protected clientDriver!: ClientType;\n\n  /**\n   * Determine whether to log or not\n   */\n  protected shouldLog: boolean = true;\n\n  /**\n   * {@inheritdoc}\n   */\n  public get client() {\n    return (this.clientDriver || this) as unknown as ClientType;\n  }\n\n  /**\n   * Set logging state\n   */\n  public setLoggingState(shouldLog: boolean) {\n    this.shouldLog = shouldLog;\n\n    return this;\n  }\n\n  /**\n   * Set client driver\n   */\n  public set client(client: ClientType) {\n    this.clientDriver = client;\n  }\n\n  /**\n   * Get the cache driver name\n   */\n  public abstract name: string;\n\n  /**\n   * Options list\n   */\n  public options!: Options;\n\n  /**\n   * Event listeners storage\n   */\n  protected eventListeners: Map<CacheEventType, Set<CacheEventHandler>> =\n    new Map();\n\n  /**\n   * {@inheritdoc}\n   */\n  public parseKey(key: CacheKey) {\n    return parseCacheKey(key, this.options);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public setOptions(options: Options) {\n    this.options = options || {};\n    return this;\n  }\n\n  /**\n   * Register an event listener\n   */\n  public on(event: CacheEventType, handler: CacheEventHandler): this {\n    if (!this.eventListeners.has(event)) {\n      this.eventListeners.set(event, new Set());\n    }\n    this.eventListeners.get(event)!.add(handler);\n    return this;\n  }\n\n  /**\n   * Remove an event listener\n   */\n  public off(event: CacheEventType, handler: CacheEventHandler): this {\n    const handlers = this.eventListeners.get(event);\n    if (handlers) {\n      handlers.delete(handler);\n    }\n    return this;\n  }\n\n  /**\n   * Register a one-time event listener\n   */\n  public once(event: CacheEventType, handler: CacheEventHandler): this {\n    const onceHandler: CacheEventHandler = async (data) => {\n      await handler(data);\n      this.off(event, onceHandler);\n    };\n    return this.on(event, onceHandler);\n  }\n\n  /**\n   * Emit an event to all registered listeners\n   */\n  protected async emit(\n    event: CacheEventType,\n    data: Partial<CacheEventData> = {},\n  ): Promise<void> {\n    const handlers = this.eventListeners.get(event);\n    if (!handlers || handlers.size === 0) return;\n\n    const eventData: CacheEventData = {\n      driver: this.name,\n      ...data,\n    };\n\n    // Execute all handlers\n    const promises: Promise<void>[] = [];\n    for (const handler of handlers) {\n      try {\n        const result = handler(eventData);\n        if (result instanceof Promise) {\n          promises.push(result);\n        }\n      } catch (error) {\n        this.logError(`Error in event handler for '${event}'`, error);\n      }\n    }\n\n    // Wait for all async handlers\n    if (promises.length > 0) {\n      await Promise.allSettled(promises);\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public abstract removeNamespace(namespace: string): Promise<any>;\n\n  /**\n   * {@inheritdoc}\n   */\n  public abstract set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any>;\n\n  /**\n   * Normalize the 3rd argument of a `set` call into a single shape every driver\n   * can act on. Handles TTL parsing (number | string | Infinity), `expiresAt` →\n   * relative TTL conversion, and mutual-exclusion validation.\n   *\n   * @throws {CacheConfigurationError} when `ttl` and `expiresAt` are passed together\n   * or an unparseable duration string is supplied.\n   */\n  protected resolveSetOptions(\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): NormalizedSetOptions {\n    const options = normalizeToOptions(ttlOrOptions);\n\n    return {\n      ttl: resolveTtl(options.ttl, options.expiresAt, this.ttl),\n      tags: options.tags,\n      onConflict: options.onConflict ?? \"upsert\",\n      vector: options.vector,\n      staleAt: options.staleAt,\n    };\n  }\n\n  /**\n   * Resolve the union of cache keys associated with any of the given tags.\n   * Used by `similar()` to narrow the candidate pool before similarity ranking.\n   *\n   * Returns `null` when no tags are passed (callers should treat that as \"no filter\").\n   * Keys come back parsed (prefixed) — the index stores them un-prefixed, but\n   * callers match them against their own parsed storage keys.\n   */\n  protected async getKeysForTags(\n    tags: string[] | undefined,\n  ): Promise<Set<string> | null> {\n    if (!tags || tags.length === 0) {\n      return null;\n    }\n\n    const allKeys = new Set<string>();\n    for (const tag of tags) {\n      const keys = await this.tagMembers(`cache:tags:${tag}`);\n      for (const k of keys) {\n        allKeys.add(this.parseKey(k));\n      }\n    }\n\n    return allKeys;\n  }\n\n  // ============================================================\n  // Tag index primitives\n  // ============================================================\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: the index is an ordinary entry holding a string\n   * array, read-modified-written under {@link runSerialized} — correct within\n   * THIS process only. Drivers with a native primitive override it (redis SET,\n   * pg atomic upsert, the in-process drivers' {@link InMemoryTagIndex}).\n   */\n  public async tagAdd(tagKey: CacheKey, members: string[]): Promise<void> {\n    if (members.length === 0) {\n      return;\n    }\n\n    await this.runSerialized(this.parseKey(tagKey), async () => {\n      const current = await this.readTagArray(tagKey);\n      const merged = new Set(current);\n\n      for (const member of members) {\n        merged.add(member);\n      }\n\n      if (merged.size !== current.length) {\n        await this.set(tagKey, [...merged], Infinity);\n      }\n    });\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async tagMembers(tagKey: CacheKey): Promise<string[]> {\n    return this.readTagArray(tagKey);\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: serialized read-filter-write (process-local); an\n   * emptied index is removed.\n   */\n  public async tagRemove(tagKey: CacheKey, members: string[]): Promise<void> {\n    if (members.length === 0) {\n      return;\n    }\n\n    await this.runSerialized(this.parseKey(tagKey), async () => {\n      const current = await this.readTagArray(tagKey);\n      const dropped = new Set(members);\n      const kept = current.filter((member) => !dropped.has(member));\n\n      if (kept.length === current.length) {\n        return;\n      }\n\n      if (kept.length === 0) {\n        await this.remove(tagKey);\n      } else {\n        await this.set(tagKey, kept, Infinity);\n      }\n    });\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async tagDelete(tagKey: CacheKey): Promise<void> {\n    await this.runSerialized(this.parseKey(tagKey), () => this.remove(tagKey));\n  }\n\n  /**\n   * The index stored as a plain entry, or `[]`. Non-string members (a corrupted\n   * or foreign value) are ignored rather than trusted.\n   */\n  protected async readTagArray(tagKey: CacheKey): Promise<string[]> {\n    const value = await this.get(tagKey);\n\n    if (!Array.isArray(value)) {\n      return [];\n    }\n\n    return value.filter((member): member is string => typeof member === \"string\");\n  }\n\n  /**\n   * Apply tag relationships after a successful write. Called by drivers once\n   * the value is in storage.\n   *\n   * Pass the caller's key, not the parsed one: the tag index stores keys\n   * un-prefixed so `invalidate()` can delete them through `remove(key)`.\n   */\n  protected async applyTags(key: CacheKey, tags: string[]): Promise<void> {\n    if (tags.length === 0) {\n      return;\n    }\n\n    const tagged = this.tags(tags);\n    await (tagged as TaggedCache).storeTagRelationship(key);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public abstract get(key: CacheKey): Promise<any>;\n\n  /**\n   * {@inheritdoc}\n   */\n  public abstract remove(key: CacheKey): Promise<void>;\n\n  /**\n   * {@inheritdoc}\n   */\n  public abstract flush(): Promise<void>;\n\n  /**\n   * {@inheritdoc}\n   */\n  public async has(key: CacheKey): Promise<boolean> {\n    const value = await this.get(key);\n    // Event is emitted by get() method\n    return value !== null;\n  }\n\n  /**\n   * In-flight `remember()` computations, one per parsed key (stampede guard).\n   */\n  protected rememberInFlight: Map<string, Promise<any>> = new Map();\n\n  /**\n   * In-flight `swr()` cold-miss fetches, one per parsed key.\n   */\n  protected swrFetchInFlight: Map<string, Promise<any>> = new Map();\n\n  /**\n   * In-flight `swr()` stale-window background refreshes, one per parsed key.\n   */\n  protected swrRefreshes: Map<string, Promise<void>> = new Map();\n\n  /**\n   * Per-key serialization chains for the in-process read-modify-write\n   * operations (`update`, and the default `increment` / `pull`). Kept apart\n   * from the stampede maps so a `remember()` can never break an update chain,\n   * and never receives an unrelated promise.\n   */\n  protected updateChains: Map<string, Promise<any>> = new Map();\n\n  /**\n   * Run `task` once per key at a time: concurrent callers for the same\n   * `parsedKey` share the in-flight promise registered in `inFlight`.\n   */\n  protected singleFlight<T>(\n    inFlight: Map<string, Promise<any>>,\n    parsedKey: string,\n    task: () => Promise<T>,\n  ): Promise<T> {\n    const existing = inFlight.get(parsedKey);\n\n    if (existing) {\n      return existing as Promise<T>;\n    }\n\n    const promise: Promise<T> = task().finally(() => {\n      if (inFlight.get(parsedKey) === promise) {\n        inFlight.delete(parsedKey);\n      }\n    });\n\n    inFlight.set(parsedKey, promise);\n\n    return promise;\n  }\n\n  /**\n   * Chain `task` after every earlier serialized task for the same key, so\n   * read-modify-write callers in THIS process run one at a time. This is\n   * process-local: it does not coordinate with other servers.\n   */\n  protected runSerialized<T>(parsedKey: string, task: () => Promise<T>): Promise<T> {\n    const previous = this.updateChains.get(parsedKey) ?? Promise.resolve();\n\n    const next = previous.catch(() => undefined).then(task);\n\n    this.updateChains.set(parsedKey, next);\n\n    // Clean up the slot once this link finishes, but only if nobody chained a\n    // follow-up onto it meanwhile. The trailing catch keeps a rejected link\n    // from surfacing as an unhandled rejection here (the caller still sees it).\n    next\n      .finally(() => {\n        if (this.updateChains.get(parsedKey) === next) {\n          this.updateChains.delete(parsedKey);\n        }\n      })\n      .catch(() => undefined);\n\n    return next;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async remember(\n    key: CacheKey,\n    ttlOrOptions: CacheTtl | RememberOptions,\n    callback: () => Promise<any>,\n  ): Promise<any> {\n    const parsedKey = this.parseKey(key);\n\n    // The options-form lets callers forward tags / driver-override through to\n    // the cache-miss write. Normalize both shapes into a single CacheSetOptions\n    // blob so there's one path from here on.\n    const setOptions = this.normalizeRememberOptions(ttlOrOptions);\n\n    // Only a real miss (`null`) recomputes: cached falsy values such as\n    // `0`, `false` and `\"\"` are returned as-is.\n    const cachedValue = await this.get(key);\n\n    if (cachedValue !== null && cachedValue !== undefined) {\n      return cachedValue;\n    }\n\n    return this.singleFlight(this.rememberInFlight, parsedKey, async () => {\n      const result = await callback();\n\n      await this.set(key, result, setOptions);\n\n      return result;\n    });\n  }\n\n  /**\n   * Resolve the TTL-or-options arg of `remember` into a `CacheSetOptions` object\n   * that can be passed straight to `set()`. Keeps the implementation unbranched.\n   */\n  protected normalizeRememberOptions(\n    ttlOrOptions: CacheTtl | RememberOptions,\n  ): CacheSetOptions {\n    if (typeof ttlOrOptions === \"number\" || typeof ttlOrOptions === \"string\") {\n      return { ttl: ttlOrOptions };\n    }\n\n    return {\n      ttl: ttlOrOptions.ttl,\n      tags: ttlOrOptions.tags,\n    };\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: read raw entry, branch on freshness/staleness,\n   * trigger background refresh in the stale window, fall through to\n   * `callback` on miss/expiry. Concurrent cold-miss callers share one fetch\n   * ({@link swrFetchInFlight}); concurrent stale-window callers share one\n   * background refresh ({@link swrRefreshes}).\n   *\n   * Drivers without a real {@link getEntry} override degrade gracefully —\n   * the synthetic entry has no `staleAt`, which the freshness check treats\n   * as \"always fresh,\" so SWR behaves like a TTL-only cached read on those\n   * drivers (no background refresh, but no double-fetch either).\n   */\n  public async swr<T = any>(\n    key: CacheKey,\n    options: CacheSwrOptions,\n    callback: () => Promise<T>,\n  ): Promise<T> {\n    const parsedKey = this.parseKey(key);\n    const freshSeconds = parseTtl(options.freshTtl);\n    const staleSeconds = parseTtl(options.staleTtl);\n\n    if (staleSeconds <= freshSeconds) {\n      throw new Error(\n        `cache.swr: 'staleTtl' (${staleSeconds}s) must be greater than 'freshTtl' (${freshSeconds}s).`,\n      );\n    }\n\n    const entry = await this.getEntry(key);\n    const now = Date.now();\n\n    const isExpired = entry?.expiresAt !== undefined && entry.expiresAt <= now;\n\n    if (!entry || isExpired) {\n      return this.singleFlight(this.swrFetchInFlight, parsedKey, () =>\n        this.swrFetchAndStore<T>(key, options, callback, freshSeconds, staleSeconds),\n      );\n    }\n\n    const isFresh = entry.staleAt === undefined || entry.staleAt > now;\n\n    if (isFresh) {\n      return entry.data as T;\n    }\n\n    this.scheduleSwrRefresh<T>(\n      parsedKey,\n      key,\n      options,\n      callback,\n      freshSeconds,\n      staleSeconds,\n    );\n\n    return entry.data as T;\n  }\n\n  /**\n   * Read the raw {@link CacheData} wrapper for a key, including any\n   * `expiresAt` / `staleAt` metadata. Default implementation falls back to\n   * `get()` and synthesizes a metadata-less wrapper — drivers that store\n   * the wrapper directly (memory, lru, file, redis, pg, mock) override\n   * this to return real metadata so SWR can branch on freshness.\n   */\n  protected async getEntry(key: CacheKey): Promise<CacheData | null> {\n    const value = await this.get(key);\n\n    if (value === null) {\n      return null;\n    }\n\n    return { data: value };\n  }\n\n  /**\n   * Remaining lifetime of an existing entry, in seconds — used by TTL-preserving\n   * writes such as `update()` / `merge()` when the caller passes no explicit\n   * `ttl`.\n   *\n   * - `Infinity` — the entry exists with no expiry (preserve \"never expires\").\n   * - positive number — seconds left before the entry expires.\n   * - `undefined` — the key is missing or already past its deadline; the caller\n   *   should fall back to the driver default TTL.\n   *\n   * Default reads `expiresAt` from {@link getEntry}, which the metadata-aware\n   * drivers (memory, lru, mock, pg) populate. Drivers that track TTL natively\n   * and don't carry `expiresAt` in their payload (Redis) override this.\n   */\n  protected async getRemainingTtl(key: CacheKey): Promise<number | undefined> {\n    const entry = await this.getEntry(key);\n\n    if (!entry) {\n      return undefined;\n    }\n\n    if (!entry.expiresAt || entry.expiresAt === Infinity) {\n      return Infinity;\n    }\n\n    const remainingSeconds = Math.ceil((entry.expiresAt - Date.now()) / 1000);\n\n    return remainingSeconds > 0 ? remainingSeconds : undefined;\n  }\n\n  /**\n   * Block-and-fetch path of `swr()`: invoked on miss or past-`staleTtl`\n   * expiry. Writes through `set()` with the SWR options translated into\n   * standard `CacheSetOptions` (ttl = staleTtl, staleAt = now + freshTtl).\n   */\n  protected async swrFetchAndStore<T>(\n    key: CacheKey,\n    options: CacheSwrOptions,\n    callback: () => Promise<T>,\n    freshSeconds: number,\n    staleSeconds: number,\n  ): Promise<T> {\n    const result = await callback();\n\n    await this.set(key, result, {\n      ttl: staleSeconds,\n      staleAt: Date.now() + freshSeconds * 1000,\n      tags: options.tags,\n    });\n\n    return result;\n  }\n\n  /**\n   * Stale-window background refresh. Registers a single in-flight promise\n   * per parsed key so concurrent SWR callers share one refresh. Failed\n   * refreshes preserve the stale entry, log via `logError`, and emit on\n   * `error` — the stale-returning caller never sees the failure.\n   */\n  protected scheduleSwrRefresh<T>(\n    parsedKey: string,\n    key: CacheKey,\n    options: CacheSwrOptions,\n    callback: () => Promise<T>,\n    freshSeconds: number,\n    staleSeconds: number,\n  ): void {\n    if (this.swrRefreshes.has(parsedKey)) {\n      return;\n    }\n\n    let refresh!: Promise<void>;\n    refresh = (async () => {\n      try {\n        const result = await callback();\n\n        await this.set(key, result, {\n          ttl: staleSeconds,\n          staleAt: Date.now() + freshSeconds * 1000,\n          tags: options.tags,\n        });\n      } catch (error) {\n        this.logError(`SWR background refresh failed for ${parsedKey}`, error);\n        await this.emit(\"error\", { key: parsedKey, error });\n      } finally {\n        if (this.swrRefreshes.get(parsedKey) === refresh) {\n          this.swrRefreshes.delete(parsedKey);\n        }\n      }\n    })();\n\n    this.swrRefreshes.set(parsedKey, refresh);\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: get-then-remove, serialized per key in THIS\n   * process. Drivers with a native primitive override it to be atomic across\n   * servers (redis `GETDEL`, pg `DELETE … RETURNING`) or process-atomic\n   * (memory, lru, mock).\n   */\n  public async pull(key: CacheKey): Promise<any | null> {\n    return this.runSerialized(this.parseKey(key), async () => {\n      // Events are emitted by get() and remove()\n      const value = await this.get(key);\n\n      if (value !== null) {\n        await this.remove(key);\n      }\n\n      return value;\n    });\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async forever(key: CacheKey, value: any): Promise<any> {\n    // Event is emitted by set() method\n    return this.set(key, value, Infinity);\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: read-add-write serialized per key in THIS process,\n   * keeping the entry's remaining TTL (a missing key starts from 0 with the\n   * driver default TTL). Not atomic across servers: drivers with a native\n   * primitive override it (redis `INCRBY`, pg single-statement upsert).\n   */\n  public async increment(key: CacheKey, value: number = 1): Promise<number> {\n    const parsedKey = this.parseKey(key);\n\n    return this.runSerialized(parsedKey, async () => {\n      const current = await this.get(key);\n      const base = current === null || current === undefined ? 0 : current;\n\n      if (typeof base !== \"number\") {\n        throw new Error(`Cannot increment non-numeric value for key: ${parsedKey}`);\n      }\n\n      const newValue = base + value;\n      const remainingTtl = current === null ? undefined : await this.getRemainingTtl(key);\n\n      if (remainingTtl !== undefined) {\n        await this.set(key, newValue, { ttl: remainingTtl });\n      } else {\n        await this.set(key, newValue);\n      }\n\n      return newValue;\n    });\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async decrement(key: CacheKey, value: number = 1): Promise<number> {\n    return this.increment(key, -value);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async many(keys: CacheKey[]): Promise<any[]> {\n    return Promise.all(keys.map((key) => this.get(key)));\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async setMany(\n    items: Record<string, any>,\n    ttl?: number,\n  ): Promise<void> {\n    await Promise.all(\n      Object.entries(items).map(([key, value]) => this.set(key, value, ttl)),\n    );\n  }\n\n  /**\n   * Log the operation\n   */\n  protected log(operation: CacheOperationType, key?: string | any) {\n    if (!this.shouldLog) return;\n\n    if (typeof key === \"string\") {\n      // this will be likely used with file cache driver as it will convert the dot to slash\n      // to make it consistent and not to confuse developers we will output the key by making sure it's a dot\n      key = key.replace(/\\//g, \".\");\n    }\n\n    if (operation === \"connectionFailed\") {\n      log.fatal(`cache.${this.name}`, operation, key);\n    }\n\n    if (operation == \"notFound\" || operation == \"expired\") {\n      return log.info(\n        \"cache.\" + this.name,\n        operation,\n        (key ? key + \" \" : \"\") + messages[operation],\n      );\n    }\n\n    if (operation.endsWith(\"ed\")) {\n      return log.success(\n        \"cache.\" + this.name,\n        operation,\n        (key ? key + \" \" : \"\") + messages[operation],\n      );\n    }\n\n    log.info(\n      \"cache.\" + this.name,\n      operation,\n      (key ? key + \" \" : \"\") + messages[operation],\n    );\n  }\n\n  /**\n   * Log error message\n   *\n   * Never logs the raw `error` object — driver connection errors (Redis,\n   * Postgres, ...) can carry the connection string, including the password,\n   * in the message/cause. Only a redacted `{ message, code }` shape is\n   * passed to the structured logger.\n   */\n  protected logError(message: string, error?: any) {\n    if (error) {\n      log.error(\"cache.\" + this.name, \"error\", message, safeErrorInfo(error));\n    } else {\n      log.error(\"cache.\" + this.name, \"error\", message);\n    }\n  }\n\n  /**\n   * Get the default TTL in seconds. Parses human-readable strings (`\"1h\"`, `\"30m\"`)\n   * from driver options if present; falls back to `Infinity` when no default is set.\n   */\n  public get ttl() {\n    if (this.options.ttl === undefined) {\n      return Infinity;\n    }\n\n    return parseTtl(this.options.ttl);\n  }\n\n  /**\n   * Get time to live value in milliseconds\n   */\n  public getExpiresAt(ttl: number = this.ttl) {\n    if (ttl) {\n      return new Date().getTime() + ttl * 1000;\n    }\n  }\n\n  /**\n   * Wrap a value with TTL and optional freshness metadata for backend\n   * storage. `staleAt` persists alongside `expiresAt` when supplied — used\n   * by the SWR flow to mark when the entry stops being fresh.\n   */\n  protected prepareDataForStorage(data: any, ttl?: number, staleAt?: number) {\n    const preparedData: CacheData = {\n      data,\n    };\n\n    if (ttl) {\n      preparedData.ttl = ttl;\n      preparedData.expiresAt = this.getExpiresAt(ttl);\n    }\n\n    if (staleAt !== undefined) {\n      preparedData.staleAt = staleAt;\n    }\n\n    return preparedData;\n  }\n\n  /**\n   * Parse fetched data from cache\n   */\n  protected async parseCachedData(key: string, data: CacheData) {\n    this.log(\"fetched\", key);\n\n    if (data.expiresAt && data.expiresAt < Date.now()) {\n      this.remove(key);\n      return null;\n    }\n\n    const value = data.data;\n\n    // Skip cloning for primitives (immutable types)\n    if (value === null || value === undefined) {\n      return value;\n    }\n\n    const type = typeof value;\n    if (type === \"string\" || type === \"number\" || type === \"boolean\") {\n      return value;\n    }\n\n    // Deep clone objects/arrays to prevent cache mutation\n    try {\n      return structuredClone(value);\n    } catch (error) {\n      this.logError(\n        `Failed to clone cached value for ${key}, typeof value: ${typeof value}`,\n        error,\n      );\n      throw error;\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async connect() {\n    this.log(\"connecting\");\n    this.log(\"connected\");\n    await this.emit(\"connected\");\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async disconnect() {\n    this.log(\"disconnected\");\n    await this.emit(\"disconnected\");\n  }\n\n  /**\n   * Create a tagged cache instance for the given tags\n   */\n  public tags(tags: string[]): any {\n    return new TaggedCache(tags, this);\n  }\n\n  /**\n   * Emit `invalidated` on behalf of a {@link TaggedCache} created by this\n   * driver, once per `invalidate()` call. Listeners cannot fail the\n   * invalidation: `emit` isolates them.\n   *\n   * @internal\n   */\n  public async emitTagsInvalidated(data: {\n    tags: string[];\n    keys: string[];\n    durationMs: number;\n  }): Promise<void> {\n    await this.emit(\"invalidated\", data);\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: read → transform → write, serialized per key in\n   * THIS process only. Drivers that can offer cross-server atomicity (redis,\n   * pg: compare-and-set with retries) override it.\n   */\n  public async update<T = any>(\n    key: CacheKey,\n    fn: (current: T | null) => T | null | Promise<T | null>,\n    options: { ttl?: CacheTtl } = {},\n  ): Promise<T | null> {\n    // Chain each update onto the previous one for the same key so concurrent\n    // callers are serialized end-to-end, not merely awakened together.\n    return this.runSerialized(this.parseKey(key), async () => {\n      const current = (await this.get(key)) as T | null;\n      const result = await fn(current);\n\n      if (result === null) {\n        await this.remove(key);\n        return null;\n      }\n\n      if (options.ttl !== undefined) {\n        await this.set(key, result, { ttl: options.ttl });\n\n        return result;\n      }\n\n      // No explicit TTL → preserve the existing entry's remaining lifetime\n      // rather than resetting it to the driver default.\n      const remainingTtl = await this.getRemainingTtl(key);\n\n      if (remainingTtl !== undefined) {\n        await this.set(key, result, { ttl: remainingTtl });\n      } else {\n        await this.set(key, result);\n      }\n\n      return result;\n    });\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async merge<T extends Record<string, any> = Record<string, any>>(\n    key: CacheKey,\n    partial: Partial<T>,\n    options: { ttl?: CacheTtl } = {},\n  ): Promise<T> {\n    const result = await this.update<T>(\n      key,\n      (current) => {\n        const base = (current ?? {}) as T;\n        return { ...base, ...partial } as T;\n      },\n      options,\n    );\n\n    return result as T;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: read-mutate-write array backed by the underlying\n   * cache entry. Concrete drivers (e.g. Redis) override with native commands.\n   */\n  public list<T = any>(key: CacheKey): CacheListAccessor<T> {\n    return new MemoryCacheList<T>(this, key);\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Built on top of `set({ onConflict: \"create\" })` — Redis-native `SET … NX EX`\n   * under the hood on Redis, emulated via key-existence check on other drivers.\n   * The lock value is the resolved `owner` (defaults to `pid.<process.pid>`).\n   *\n   * Always releases in `finally`, even if `fn` throws — the thrown error\n   * propagates to the caller unchanged, and a failed release is logged rather\n   * than replacing `fn`'s result or error. The ttl must be finite and\n   * positive; there is no renewal, so it must exceed the worst-case duration.\n   */\n  public async lock<T>(\n    key: CacheKey,\n    ttlOrOptions: CacheTtl | Omit<LockOptions, \"driver\">,\n    fn: () => Promise<T>,\n  ): Promise<LockOutcome<T>> {\n    const { ttl, owner } = this.normalizeLockOptions(ttlOrOptions);\n\n    // A lock with no expiry stays held forever if its holder crashes, on every\n    // server. Refuse it up front (parseTtl also rejects undefined / NaN).\n    const ttlSeconds = parseTtl(ttl);\n\n    if (!Number.isFinite(ttlSeconds) || ttlSeconds <= 0) {\n      throw new CacheConfigurationError(\n        `cache.lock() requires a finite, positive ttl (got ${String(ttl)}). The ttl must exceed the worst-case duration of the locked work.`,\n      );\n    }\n    // The stored value is `<owner>#<token>`: the token makes it unique per\n    // acquisition so release can compare-and-delete instead of deleting blindly.\n    const lockValue = `${owner ?? `pid.${process.pid}`}#${randomUUID()}`;\n\n    const setResult = (await this.set(key, lockValue, {\n      onConflict: \"create\",\n      ttl,\n    })) as CacheSetResult | unknown;\n\n    // `onConflict` drivers return CacheSetResult. Drivers that no-op on set\n    // (e.g. the null driver) may return anything else — treat that as\n    // \"acquired\" since there's nothing to collide with.\n    const wasSet =\n      typeof setResult === \"object\" &&\n      setResult !== null &&\n      \"wasSet\" in setResult\n        ? (setResult as CacheSetResult).wasSet\n        : true;\n\n    if (!wasSet) {\n      return { acquired: false };\n    }\n\n    try {\n      const value = await fn();\n      return { acquired: true, value };\n    } finally {\n      // Only delete our own lock — if the TTL expired and a successor\n      // acquired the key, its value differs and it is left alone. A release\n      // failure (e.g. a Redis blip) is logged, never allowed to replace fn's\n      // outcome: the lock still expires by its TTL.\n      try {\n        await this.deleteIfEquals(key, lockValue);\n      } catch (error) {\n        this.logError(`lock release failed for ${this.parseKey(key)}`, error);\n      }\n    }\n  }\n\n  /**\n   * Compare-and-delete: remove `key` only when its current value equals\n   * `expected`. Returns whether a delete happened.\n   *\n   * This default is get-then-remove and is NOT atomic across processes; drivers\n   * with a real primitive (memory, redis, pg) override it.\n   */\n  protected async deleteIfEquals(key: CacheKey, expected: unknown): Promise<boolean> {\n    if ((await this.get(key)) !== expected) {\n      return false;\n    }\n\n    await this.remove(key);\n\n    return true;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation throws {@link CacheUnsupportedError}. Drivers that\n   * support similarity retrieval (memory family, `pg`, `redis` w/ RediSearch)\n   * override this with a real impl.\n   */\n  public async similar<T = any>(\n    _vector: number[],\n    _options: CacheSimilarOptions,\n  ): Promise<CacheSimilarHit<T>[]> {\n    throw new CacheUnsupportedError(\n      `'${this.name}' driver does not support similarity retrieval. Use a memory driver, 'pg' (with pgvector), or 'redis' (with RediSearch).`,\n    );\n  }\n\n  /**\n   * Resolve the TTL-or-options arg of `lock` into a uniform shape.\n   */\n  protected normalizeLockOptions(\n    ttlOrOptions: CacheTtl | Omit<LockOptions, \"driver\">,\n  ): {\n    ttl: CacheTtl;\n    owner?: string;\n  } {\n    if (typeof ttlOrOptions === \"number\" || typeof ttlOrOptions === \"string\") {\n      return { ttl: ttlOrOptions };\n    }\n\n    return { ttl: ttlOrOptions.ttl, owner: ttlOrOptions.owner };\n  }\n}\n"],"mappings":";;;;;;;;AAwEA,MAAM,WAAW;CACf,UAAU;CACV,SAAS;CACT,UAAU;CACV,SAAS;CACT,SAAS;CACT,QAAQ;CACR,UAAU;CACV,SAAS;CACT,UAAU;CACV,SAAS;CACT,SAAS;CACT,UAAU;CACV,YAAY;CACZ,WAAW;CACX,eAAe;CACf,cAAc;CACd,kBAAkB;CAClB,OAAO;AACT;AAEA,IAAsB,kBAAtB,MAG8C;;mBASb;wCAuC7B,IAAI,IAAI;0CAoR8C,IAAI,IAAI;0CAKR,IAAI,IAAI;sCAKX,IAAI,IAAI;sCAQT,IAAI,IAAI;;;;;CAxU5D,IAAW,SAAS;EAClB,OAAQ,KAAK,gBAAgB;CAC/B;;;;CAKA,AAAO,gBAAgB,WAAoB;EACzC,KAAK,YAAY;EAEjB,OAAO;CACT;;;;CAKA,IAAW,OAAO,QAAoB;EACpC,KAAK,eAAe;CACtB;;;;CAqBA,AAAO,SAAS,KAAe;EAC7B,OAAO,cAAc,KAAK,KAAK,OAAO;CACxC;;;;CAKA,AAAO,WAAW,SAAkB;EAClC,KAAK,UAAU,WAAW,CAAC;EAC3B,OAAO;CACT;;;;CAKA,AAAO,GAAG,OAAuB,SAAkC;EACjE,IAAI,CAAC,KAAK,eAAe,IAAI,KAAK,GAChC,KAAK,eAAe,IAAI,uBAAO,IAAI,IAAI,CAAC;EAE1C,KAAK,eAAe,IAAI,KAAK,CAAC,CAAE,IAAI,OAAO;EAC3C,OAAO;CACT;;;;CAKA,AAAO,IAAI,OAAuB,SAAkC;EAClE,MAAM,WAAW,KAAK,eAAe,IAAI,KAAK;EAC9C,IAAI,UACF,SAAS,OAAO,OAAO;EAEzB,OAAO;CACT;;;;CAKA,AAAO,KAAK,OAAuB,SAAkC;EACnE,MAAM,cAAiC,OAAO,SAAS;GACrD,MAAM,QAAQ,IAAI;GAClB,KAAK,IAAI,OAAO,WAAW;EAC7B;EACA,OAAO,KAAK,GAAG,OAAO,WAAW;CACnC;;;;CAKA,MAAgB,KACd,OACA,OAAgC,CAAC,GAClB;EACf,MAAM,WAAW,KAAK,eAAe,IAAI,KAAK;EAC9C,IAAI,CAAC,YAAY,SAAS,SAAS,GAAG;EAEtC,MAAM,YAA4B;GAChC,QAAQ,KAAK;GACb,GAAG;EACL;EAGA,MAAM,WAA4B,CAAC;EACnC,KAAK,MAAM,WAAW,UACpB,IAAI;GACF,MAAM,SAAS,QAAQ,SAAS;GAChC,IAAI,kBAAkB,SACpB,SAAS,KAAK,MAAM;EAExB,SAAS,OAAO;GACd,KAAK,SAAS,+BAA+B,MAAM,IAAI,KAAK;EAC9D;EAIF,IAAI,SAAS,SAAS,GACpB,MAAM,QAAQ,WAAW,QAAQ;CAErC;;;;;;;;;CAwBA,AAAU,kBACR,cACsB;EACtB,MAAM,UAAU,mBAAmB,YAAY;EAE/C,OAAO;GACL,KAAK,WAAW,QAAQ,KAAK,QAAQ,WAAW,KAAK,GAAG;GACxD,MAAM,QAAQ;GACd,YAAY,QAAQ,cAAc;GAClC,QAAQ,QAAQ;GAChB,SAAS,QAAQ;EACnB;CACF;;;;;;;;;CAUA,MAAgB,eACd,MAC6B;EAC7B,IAAI,CAAC,QAAQ,KAAK,WAAW,GAC3B,OAAO;EAGT,MAAM,0BAAU,IAAI,IAAY;EAChC,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,OAAO,MAAM,KAAK,WAAW,cAAc,KAAK;GACtD,KAAK,MAAM,KAAK,MACd,QAAQ,IAAI,KAAK,SAAS,CAAC,CAAC;EAEhC;EAEA,OAAO;CACT;;;;;;;;;CAcA,MAAa,OAAO,QAAkB,SAAkC;EACtE,IAAI,QAAQ,WAAW,GACrB;EAGF,MAAM,KAAK,cAAc,KAAK,SAAS,MAAM,GAAG,YAAY;GAC1D,MAAM,UAAU,MAAM,KAAK,aAAa,MAAM;GAC9C,MAAM,SAAS,IAAI,IAAI,OAAO;GAE9B,KAAK,MAAM,UAAU,SACnB,OAAO,IAAI,MAAM;GAGnB,IAAI,OAAO,SAAS,QAAQ,QAC1B,MAAM,KAAK,IAAI,QAAQ,CAAC,GAAG,MAAM,GAAG,QAAQ;EAEhD,CAAC;CACH;;;;CAKA,MAAa,WAAW,QAAqC;EAC3D,OAAO,KAAK,aAAa,MAAM;CACjC;;;;;;;CAQA,MAAa,UAAU,QAAkB,SAAkC;EACzE,IAAI,QAAQ,WAAW,GACrB;EAGF,MAAM,KAAK,cAAc,KAAK,SAAS,MAAM,GAAG,YAAY;GAC1D,MAAM,UAAU,MAAM,KAAK,aAAa,MAAM;GAC9C,MAAM,UAAU,IAAI,IAAI,OAAO;GAC/B,MAAM,OAAO,QAAQ,QAAQ,WAAW,CAAC,QAAQ,IAAI,MAAM,CAAC;GAE5D,IAAI,KAAK,WAAW,QAAQ,QAC1B;GAGF,IAAI,KAAK,WAAW,GAClB,MAAM,KAAK,OAAO,MAAM;QAExB,MAAM,KAAK,IAAI,QAAQ,MAAM,QAAQ;EAEzC,CAAC;CACH;;;;CAKA,MAAa,UAAU,QAAiC;EACtD,MAAM,KAAK,cAAc,KAAK,SAAS,MAAM,SAAS,KAAK,OAAO,MAAM,CAAC;CAC3E;;;;;CAMA,MAAgB,aAAa,QAAqC;EAChE,MAAM,QAAQ,MAAM,KAAK,IAAI,MAAM;EAEnC,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,OAAO,CAAC;EAGV,OAAO,MAAM,QAAQ,WAA6B,OAAO,WAAW,QAAQ;CAC9E;;;;;;;;CASA,MAAgB,UAAU,KAAe,MAA+B;EACtE,IAAI,KAAK,WAAW,GAClB;EAIF,MADe,KAAK,KAAK,IACb,CAAC,CAAiB,qBAAqB,GAAG;CACxD;;;;CAoBA,MAAa,IAAI,KAAiC;EAGhD,OAAO,MAFa,KAAK,IAAI,GAAG,MAEf;CACnB;;;;;CA6BA,AAAU,aACR,UACA,WACA,MACY;EACZ,MAAM,WAAW,SAAS,IAAI,SAAS;EAEvC,IAAI,UACF,OAAO;EAGT,MAAM,UAAsB,KAAK,CAAC,CAAC,cAAc;GAC/C,IAAI,SAAS,IAAI,SAAS,MAAM,SAC9B,SAAS,OAAO,SAAS;EAE7B,CAAC;EAED,SAAS,IAAI,WAAW,OAAO;EAE/B,OAAO;CACT;;;;;;CAOA,AAAU,cAAiB,WAAmB,MAAoC;EAGhF,MAAM,QAFW,KAAK,aAAa,IAAI,SAAS,KAAK,QAAQ,QAAQ,EAEhD,CAAC,YAAY,MAAS,CAAC,CAAC,KAAK,IAAI;EAEtD,KAAK,aAAa,IAAI,WAAW,IAAI;EAKrC,KACG,cAAc;GACb,IAAI,KAAK,aAAa,IAAI,SAAS,MAAM,MACvC,KAAK,aAAa,OAAO,SAAS;EAEtC,CAAC,CAAC,CACD,YAAY,MAAS;EAExB,OAAO;CACT;;;;CAKA,MAAa,SACX,KACA,cACA,UACc;EACd,MAAM,YAAY,KAAK,SAAS,GAAG;EAKnC,MAAM,aAAa,KAAK,yBAAyB,YAAY;EAI7D,MAAM,cAAc,MAAM,KAAK,IAAI,GAAG;EAEtC,IAAI,gBAAgB,QAAQ,gBAAgB,QAC1C,OAAO;EAGT,OAAO,KAAK,aAAa,KAAK,kBAAkB,WAAW,YAAY;GACrE,MAAM,SAAS,MAAM,SAAS;GAE9B,MAAM,KAAK,IAAI,KAAK,QAAQ,UAAU;GAEtC,OAAO;EACT,CAAC;CACH;;;;;CAMA,AAAU,yBACR,cACiB;EACjB,IAAI,OAAO,iBAAiB,YAAY,OAAO,iBAAiB,UAC9D,OAAO,EAAE,KAAK,aAAa;EAG7B,OAAO;GACL,KAAK,aAAa;GAClB,MAAM,aAAa;EACrB;CACF;;;;;;;;;;;;;;;CAgBA,MAAa,IACX,KACA,SACA,UACY;EACZ,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,eAAe,SAAS,QAAQ,QAAQ;EAC9C,MAAM,eAAe,SAAS,QAAQ,QAAQ;EAE9C,IAAI,gBAAgB,cAClB,MAAM,IAAI,MACR,0BAA0B,aAAa,sCAAsC,aAAa,IAC5F;EAGF,MAAM,QAAQ,MAAM,KAAK,SAAS,GAAG;EACrC,MAAM,MAAM,KAAK,IAAI;EAErB,MAAM,YAAY,OAAO,cAAc,UAAa,MAAM,aAAa;EAEvE,IAAI,CAAC,SAAS,WACZ,OAAO,KAAK,aAAa,KAAK,kBAAkB,iBAC9C,KAAK,iBAAoB,KAAK,SAAS,UAAU,cAAc,YAAY,CAC7E;EAKF,IAFgB,MAAM,YAAY,UAAa,MAAM,UAAU,KAG7D,OAAO,MAAM;EAGf,KAAK,mBACH,WACA,KACA,SACA,UACA,cACA,YACF;EAEA,OAAO,MAAM;CACf;;;;;;;;CASA,MAAgB,SAAS,KAA0C;EACjE,MAAM,QAAQ,MAAM,KAAK,IAAI,GAAG;EAEhC,IAAI,UAAU,MACZ,OAAO;EAGT,OAAO,EAAE,MAAM,MAAM;CACvB;;;;;;;;;;;;;;;CAgBA,MAAgB,gBAAgB,KAA4C;EAC1E,MAAM,QAAQ,MAAM,KAAK,SAAS,GAAG;EAErC,IAAI,CAAC,OACH;EAGF,IAAI,CAAC,MAAM,aAAa,MAAM,cAAc,UAC1C,OAAO;EAGT,MAAM,mBAAmB,KAAK,MAAM,MAAM,YAAY,KAAK,IAAI,KAAK,GAAI;EAExE,OAAO,mBAAmB,IAAI,mBAAmB;CACnD;;;;;;CAOA,MAAgB,iBACd,KACA,SACA,UACA,cACA,cACY;EACZ,MAAM,SAAS,MAAM,SAAS;EAE9B,MAAM,KAAK,IAAI,KAAK,QAAQ;GAC1B,KAAK;GACL,SAAS,KAAK,IAAI,IAAI,eAAe;GACrC,MAAM,QAAQ;EAChB,CAAC;EAED,OAAO;CACT;;;;;;;CAQA,AAAU,mBACR,WACA,KACA,SACA,UACA,cACA,cACM;EACN,IAAI,KAAK,aAAa,IAAI,SAAS,GACjC;EAGF,IAAI;EACJ,WAAW,YAAY;GACrB,IAAI;IACF,MAAM,SAAS,MAAM,SAAS;IAE9B,MAAM,KAAK,IAAI,KAAK,QAAQ;KAC1B,KAAK;KACL,SAAS,KAAK,IAAI,IAAI,eAAe;KACrC,MAAM,QAAQ;IAChB,CAAC;GACH,SAAS,OAAO;IACd,KAAK,SAAS,qCAAqC,aAAa,KAAK;IACrE,MAAM,KAAK,KAAK,SAAS;KAAE,KAAK;KAAW;IAAM,CAAC;GACpD,UAAU;IACR,IAAI,KAAK,aAAa,IAAI,SAAS,MAAM,SACvC,KAAK,aAAa,OAAO,SAAS;GAEtC;EACF,EAAC,CAAE;EAEH,KAAK,aAAa,IAAI,WAAW,OAAO;CAC1C;;;;;;;;;CAUA,MAAa,KAAK,KAAoC;EACpD,OAAO,KAAK,cAAc,KAAK,SAAS,GAAG,GAAG,YAAY;GAExD,MAAM,QAAQ,MAAM,KAAK,IAAI,GAAG;GAEhC,IAAI,UAAU,MACZ,MAAM,KAAK,OAAO,GAAG;GAGvB,OAAO;EACT,CAAC;CACH;;;;CAKA,MAAa,QAAQ,KAAe,OAA0B;EAE5D,OAAO,KAAK,IAAI,KAAK,OAAO,QAAQ;CACtC;;;;;;;;;CAUA,MAAa,UAAU,KAAe,QAAgB,GAAoB;EACxE,MAAM,YAAY,KAAK,SAAS,GAAG;EAEnC,OAAO,KAAK,cAAc,WAAW,YAAY;GAC/C,MAAM,UAAU,MAAM,KAAK,IAAI,GAAG;GAClC,MAAM,OAAO,YAAY,QAAQ,YAAY,SAAY,IAAI;GAE7D,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,MAAM,+CAA+C,WAAW;GAG5E,MAAM,WAAW,OAAO;GACxB,MAAM,eAAe,YAAY,OAAO,SAAY,MAAM,KAAK,gBAAgB,GAAG;GAElF,IAAI,iBAAiB,QACnB,MAAM,KAAK,IAAI,KAAK,UAAU,EAAE,KAAK,aAAa,CAAC;QAEnD,MAAM,KAAK,IAAI,KAAK,QAAQ;GAG9B,OAAO;EACT,CAAC;CACH;;;;CAKA,MAAa,UAAU,KAAe,QAAgB,GAAoB;EACxE,OAAO,KAAK,UAAU,KAAK,CAAC,KAAK;CACnC;;;;CAKA,MAAa,KAAK,MAAkC;EAClD,OAAO,QAAQ,IAAI,KAAK,KAAK,QAAQ,KAAK,IAAI,GAAG,CAAC,CAAC;CACrD;;;;CAKA,MAAa,QACX,OACA,KACe;EACf,MAAM,QAAQ,IACZ,OAAO,QAAQ,KAAK,CAAC,CAAC,KAAK,CAAC,KAAK,WAAW,KAAK,IAAI,KAAK,OAAO,GAAG,CAAC,CACvE;CACF;;;;CAKA,AAAU,IAAI,WAA+B,KAAoB;EAC/D,IAAI,CAAC,KAAK,WAAW;EAErB,IAAI,OAAO,QAAQ,UAGjB,MAAM,IAAI,QAAQ,OAAO,GAAG;EAG9B,IAAI,cAAc,oBAChB,IAAI,MAAM,SAAS,KAAK,QAAQ,WAAW,GAAG;EAGhD,IAAI,aAAa,cAAc,aAAa,WAC1C,OAAO,IAAI,KACT,WAAW,KAAK,MAChB,YACC,MAAM,MAAM,MAAM,MAAM,SAAS,UACpC;EAGF,IAAI,UAAU,SAAS,IAAI,GACzB,OAAO,IAAI,QACT,WAAW,KAAK,MAChB,YACC,MAAM,MAAM,MAAM,MAAM,SAAS,UACpC;EAGF,IAAI,KACF,WAAW,KAAK,MAChB,YACC,MAAM,MAAM,MAAM,MAAM,SAAS,UACpC;CACF;;;;;;;;;CAUA,AAAU,SAAS,SAAiB,OAAa;EAC/C,IAAI,OACF,IAAI,MAAM,WAAW,KAAK,MAAM,SAAS,SAAS,cAAc,KAAK,CAAC;OAEtE,IAAI,MAAM,WAAW,KAAK,MAAM,SAAS,OAAO;CAEpD;;;;;CAMA,IAAW,MAAM;EACf,IAAI,KAAK,QAAQ,QAAQ,QACvB,OAAO;EAGT,OAAO,SAAS,KAAK,QAAQ,GAAG;CAClC;;;;CAKA,AAAO,aAAa,MAAc,KAAK,KAAK;EAC1C,IAAI,KACF,wBAAO,IAAI,KAAK,EAAC,CAAC,QAAQ,IAAI,MAAM;CAExC;;;;;;CAOA,AAAU,sBAAsB,MAAW,KAAc,SAAkB;EACzE,MAAM,eAA0B,EAC9B,KACF;EAEA,IAAI,KAAK;GACP,aAAa,MAAM;GACnB,aAAa,YAAY,KAAK,aAAa,GAAG;EAChD;EAEA,IAAI,YAAY,QACd,aAAa,UAAU;EAGzB,OAAO;CACT;;;;CAKA,MAAgB,gBAAgB,KAAa,MAAiB;EAC5D,KAAK,IAAI,WAAW,GAAG;EAEvB,IAAI,KAAK,aAAa,KAAK,YAAY,KAAK,IAAI,GAAG;GACjD,KAAK,OAAO,GAAG;GACf,OAAO;EACT;EAEA,MAAM,QAAQ,KAAK;EAGnB,IAAI,UAAU,QAAQ,UAAU,QAC9B,OAAO;EAGT,MAAM,OAAO,OAAO;EACpB,IAAI,SAAS,YAAY,SAAS,YAAY,SAAS,WACrD,OAAO;EAIT,IAAI;GACF,OAAO,gBAAgB,KAAK;EAC9B,SAAS,OAAO;GACd,KAAK,SACH,oCAAoC,IAAI,kBAAkB,OAAO,SACjE,KACF;GACA,MAAM;EACR;CACF;;;;CAKA,MAAa,UAAU;EACrB,KAAK,IAAI,YAAY;EACrB,KAAK,IAAI,WAAW;EACpB,MAAM,KAAK,KAAK,WAAW;CAC7B;;;;CAKA,MAAa,aAAa;EACxB,KAAK,IAAI,cAAc;EACvB,MAAM,KAAK,KAAK,cAAc;CAChC;;;;CAKA,AAAO,KAAK,MAAqB;EAC/B,OAAO,IAAI,YAAY,MAAM,IAAI;CACnC;;;;;;;;CASA,MAAa,oBAAoB,MAIf;EAChB,MAAM,KAAK,KAAK,eAAe,IAAI;CACrC;;;;;;;;CASA,MAAa,OACX,KACA,IACA,UAA8B,CAAC,GACZ;EAGnB,OAAO,KAAK,cAAc,KAAK,SAAS,GAAG,GAAG,YAAY;GAExD,MAAM,SAAS,MAAM,GAAG,MADD,KAAK,IAAI,GAAG,CACJ;GAE/B,IAAI,WAAW,MAAM;IACnB,MAAM,KAAK,OAAO,GAAG;IACrB,OAAO;GACT;GAEA,IAAI,QAAQ,QAAQ,QAAW;IAC7B,MAAM,KAAK,IAAI,KAAK,QAAQ,EAAE,KAAK,QAAQ,IAAI,CAAC;IAEhD,OAAO;GACT;GAIA,MAAM,eAAe,MAAM,KAAK,gBAAgB,GAAG;GAEnD,IAAI,iBAAiB,QACnB,MAAM,KAAK,IAAI,KAAK,QAAQ,EAAE,KAAK,aAAa,CAAC;QAEjD,MAAM,KAAK,IAAI,KAAK,MAAM;GAG5B,OAAO;EACT,CAAC;CACH;;;;CAKA,MAAa,MACX,KACA,SACA,UAA8B,CAAC,GACnB;EAUZ,OAAO,MATc,KAAK,OACxB,MACC,YAAY;GAEX,OAAO;IAAE,GADK,WAAW,CAAC;IACR,GAAG;GAAQ;EAC/B,GACA,OACF;CAGF;;;;;;;CAQA,AAAO,KAAc,KAAqC;EACxD,OAAO,IAAI,gBAAmB,MAAM,GAAG;CACzC;;;;;;;;;;;;;CAcA,MAAa,KACX,KACA,cACA,IACyB;EACzB,MAAM,EAAE,KAAK,UAAU,KAAK,qBAAqB,YAAY;EAI7D,MAAM,aAAa,SAAS,GAAG;EAE/B,IAAI,CAAC,OAAO,SAAS,UAAU,KAAK,cAAc,GAChD,MAAM,IAAI,wBACR,qDAAqD,OAAO,GAAG,EAAE,mEACnE;EAIF,MAAM,YAAY,GAAG,SAAS,OAAO,QAAQ,MAAM,GAAG,WAAW;EAEjE,MAAM,YAAa,MAAM,KAAK,IAAI,KAAK,WAAW;GAChD,YAAY;GACZ;EACF,CAAC;EAYD,IAAI,EANF,OAAO,cAAc,YACrB,cAAc,QACd,YAAY,YACP,UAA6B,SAC9B,OAGJ,OAAO,EAAE,UAAU,MAAM;EAG3B,IAAI;GAEF,OAAO;IAAE,UAAU;IAAM,aADL,GAAG;GACQ;EACjC,UAAU;GAKR,IAAI;IACF,MAAM,KAAK,eAAe,KAAK,SAAS;GAC1C,SAAS,OAAO;IACd,KAAK,SAAS,2BAA2B,KAAK,SAAS,GAAG,KAAK,KAAK;GACtE;EACF;CACF;;;;;;;;CASA,MAAgB,eAAe,KAAe,UAAqC;EACjF,IAAK,MAAM,KAAK,IAAI,GAAG,MAAO,UAC5B,OAAO;EAGT,MAAM,KAAK,OAAO,GAAG;EAErB,OAAO;CACT;;;;;;;;CASA,MAAa,QACX,SACA,UAC+B;EAC/B,MAAM,IAAI,sBACR,IAAI,KAAK,KAAK,yHAChB;CACF;;;;CAKA,AAAU,qBACR,cAIA;EACA,IAAI,OAAO,iBAAiB,YAAY,OAAO,iBAAiB,UAC9D,OAAO,EAAE,KAAK,aAAa;EAG7B,OAAO;GAAE,KAAK,aAAa;GAAK,OAAO,aAAa;EAAM;CAC5D;AACF"}
+{"version":3,"file":"base-cache-driver.mjs","names":[],"sources":["../../../../../../../../packages/cache/src/drivers/base-cache-driver.ts"],"sourcesContent":["import { randomUUID } from \"node:crypto\";\nimport { log, maskEmailsInText } from \"@warlock.js/logger\";\nimport { MemoryCacheList } from \"../list/memory-cache-list\";\nimport { TaggedCache } from \"../tagged-cache\";\nimport type {\n  CacheConflictPolicy,\n  CacheData,\n  CacheDriver,\n  CacheEventData,\n  CacheEventHandler,\n  CacheEventType,\n  CacheKey,\n  CacheListAccessor,\n  CacheOperationType,\n  CacheSetOptions,\n  CacheSetResult,\n  CacheSimilarHit,\n  CacheSimilarOptions,\n  CacheSwrOptions,\n  CacheTtl,\n  LockOptions,\n  LockOutcome,\n  RememberOptions,\n} from \"../types\";\nimport { CacheConfigurationError, CacheUnsupportedError } from \"../types\";\nimport {\n  normalizeToOptions,\n  parseCacheKey,\n  parseTtl,\n  resolveTtl,\n  safeErrorInfo,\n} from \"../utils\";\n\n/**\n * Normalized form of the 3rd `set` argument.\n *\n * All drivers operate on this shape internally regardless of whether the caller\n * passed a positional TTL, a duration string, or a rich options object.\n */\nexport type NormalizedSetOptions = {\n  /**\n   * Final TTL in seconds — already merged with the driver-level default\n   * (`this.options.ttl`). `Infinity` means \"no expiration\".\n   *\n   * Always populated. Drivers do NOT need to fall back to `this.ttl`\n   * themselves — `resolveSetOptions` does the merge centrally so that\n   * every driver respects the configured default without ceremony.\n   */\n  ttl: number;\n  /**\n   * Inline tag list, or undefined when none were provided.\n   */\n  tags?: string[];\n  /**\n   * Conflict policy. Defaults to `\"upsert\"`.\n   */\n  onConflict: CacheConflictPolicy;\n  /**\n   * Optional embedding vector for similarity retrieval. Drivers that do not\n   * support similarity must throw {@link CacheUnsupportedError} when this is\n   * present (rather than silently dropping it).\n   */\n  vector?: number[];\n  /**\n   * Optional freshness deadline as a millisecond timestamp. Set by `swr()`\n   * to mark when the entry stops being \"fresh\" and becomes\n   * \"stale-but-revalidatable.\" Drivers route this through\n   * `prepareDataForStorage` so it persists in the wrapper.\n   */\n  staleAt?: number;\n};\n\nconst messages = {\n  clearing: \"Clearing namespace\",\n  cleared: \"Namespace cleared\",\n  fetching: \"Fetching key\",\n  fetched: \"Key fetched\",\n  caching: \"Caching key\",\n  cached: \"Key cached\",\n  flushing: \"Flushing cache\",\n  flushed: \"Cache flushed\",\n  removing: \"Removing key\",\n  removed: \"Key removed\",\n  expired: \"Key expired\",\n  notFound: \"Key not found\",\n  connecting: \"Connecting to the cache engine.\",\n  connected: \"Connected to the cache engine.\",\n  disconnecting: \"Disconnecting from the cache engine.\",\n  disconnected: \"Disconnected from the cache engine.\",\n  connectionFailed: \"Failed to connect to the cache engine.\",\n  error: \"Error occurred\",\n};\n\nexport abstract class BaseCacheDriver<\n  ClientType,\n  Options extends Record<string, any>,\n> implements CacheDriver<ClientType, Options> {\n  /**\n   * CLient driver\n   */\n  protected clientDriver!: ClientType;\n\n  /**\n   * Determine whether to log or not\n   */\n  protected shouldLog: boolean = true;\n\n  /**\n   * {@inheritdoc}\n   */\n  public get client() {\n    return (this.clientDriver || this) as unknown as ClientType;\n  }\n\n  /**\n   * Set logging state\n   */\n  public setLoggingState(shouldLog: boolean) {\n    this.shouldLog = shouldLog;\n\n    return this;\n  }\n\n  /**\n   * Set client driver\n   */\n  public set client(client: ClientType) {\n    this.clientDriver = client;\n  }\n\n  /**\n   * Get the cache driver name\n   */\n  public abstract name: string;\n\n  /**\n   * Options list\n   */\n  public options!: Options;\n\n  /**\n   * Event listeners storage\n   */\n  protected eventListeners: Map<CacheEventType, Set<CacheEventHandler>> =\n    new Map();\n\n  /**\n   * {@inheritdoc}\n   */\n  public parseKey(key: CacheKey) {\n    return parseCacheKey(key, this.options);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public setOptions(options: Options) {\n    this.options = options || {};\n    return this;\n  }\n\n  /**\n   * Register an event listener\n   */\n  public on(event: CacheEventType, handler: CacheEventHandler): this {\n    if (!this.eventListeners.has(event)) {\n      this.eventListeners.set(event, new Set());\n    }\n    this.eventListeners.get(event)!.add(handler);\n    return this;\n  }\n\n  /**\n   * Remove an event listener\n   */\n  public off(event: CacheEventType, handler: CacheEventHandler): this {\n    const handlers = this.eventListeners.get(event);\n    if (handlers) {\n      handlers.delete(handler);\n    }\n    return this;\n  }\n\n  /**\n   * Register a one-time event listener\n   */\n  public once(event: CacheEventType, handler: CacheEventHandler): this {\n    const onceHandler: CacheEventHandler = async (data) => {\n      await handler(data);\n      this.off(event, onceHandler);\n    };\n    return this.on(event, onceHandler);\n  }\n\n  /**\n   * Emit an event to all registered listeners\n   */\n  protected async emit(\n    event: CacheEventType,\n    data: Partial<CacheEventData> = {},\n  ): Promise<void> {\n    const handlers = this.eventListeners.get(event);\n    if (!handlers || handlers.size === 0) return;\n\n    const eventData: CacheEventData = {\n      driver: this.name,\n      ...data,\n    };\n\n    // Execute all handlers\n    const promises: Promise<void>[] = [];\n    for (const handler of handlers) {\n      try {\n        const result = handler(eventData);\n        if (result instanceof Promise) {\n          promises.push(result);\n        }\n      } catch (error) {\n        this.logError(`Error in event handler for '${event}'`, error);\n      }\n    }\n\n    // Wait for all async handlers\n    if (promises.length > 0) {\n      await Promise.allSettled(promises);\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public abstract removeNamespace(namespace: string): Promise<any>;\n\n  /**\n   * {@inheritdoc}\n   */\n  public abstract set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any>;\n\n  /**\n   * Normalize the 3rd argument of a `set` call into a single shape every driver\n   * can act on. Handles TTL parsing (number | string | Infinity), `expiresAt` →\n   * relative TTL conversion, and mutual-exclusion validation.\n   *\n   * @throws {CacheConfigurationError} when `ttl` and `expiresAt` are passed together\n   * or an unparseable duration string is supplied.\n   */\n  protected resolveSetOptions(\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): NormalizedSetOptions {\n    const options = normalizeToOptions(ttlOrOptions);\n\n    return {\n      ttl: resolveTtl(options.ttl, options.expiresAt, this.ttl),\n      tags: options.tags,\n      onConflict: options.onConflict ?? \"upsert\",\n      vector: options.vector,\n      staleAt: options.staleAt,\n    };\n  }\n\n  /**\n   * Resolve the union of cache keys associated with any of the given tags.\n   * Used by `similar()` to narrow the candidate pool before similarity ranking.\n   *\n   * Returns `null` when no tags are passed (callers should treat that as \"no filter\").\n   * Keys come back parsed (prefixed) — the index stores them un-prefixed, but\n   * callers match them against their own parsed storage keys.\n   */\n  protected async getKeysForTags(\n    tags: string[] | undefined,\n  ): Promise<Set<string> | null> {\n    if (!tags || tags.length === 0) {\n      return null;\n    }\n\n    const allKeys = new Set<string>();\n    for (const tag of tags) {\n      const keys = await this.tagMembers(`cache:tags:${tag}`);\n      for (const k of keys) {\n        allKeys.add(this.parseKey(k));\n      }\n    }\n\n    return allKeys;\n  }\n\n  // ============================================================\n  // Tag index primitives\n  // ============================================================\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: the index is an ordinary entry holding a string\n   * array, read-modified-written under {@link runSerialized} — correct within\n   * THIS process only. Drivers with a native primitive override it (redis SET,\n   * pg atomic upsert, the in-process drivers' {@link InMemoryTagIndex}).\n   */\n  public async tagAdd(tagKey: CacheKey, members: string[]): Promise<void> {\n    if (members.length === 0) {\n      return;\n    }\n\n    await this.runSerialized(this.parseKey(tagKey), async () => {\n      const current = await this.readTagArray(tagKey);\n      const merged = new Set(current);\n\n      for (const member of members) {\n        merged.add(member);\n      }\n\n      if (merged.size !== current.length) {\n        await this.set(tagKey, [...merged], Infinity);\n      }\n    });\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async tagMembers(tagKey: CacheKey): Promise<string[]> {\n    return this.readTagArray(tagKey);\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: serialized read-filter-write (process-local); an\n   * emptied index is removed.\n   */\n  public async tagRemove(tagKey: CacheKey, members: string[]): Promise<void> {\n    if (members.length === 0) {\n      return;\n    }\n\n    await this.runSerialized(this.parseKey(tagKey), async () => {\n      const current = await this.readTagArray(tagKey);\n      const dropped = new Set(members);\n      const kept = current.filter((member) => !dropped.has(member));\n\n      if (kept.length === current.length) {\n        return;\n      }\n\n      if (kept.length === 0) {\n        await this.remove(tagKey);\n      } else {\n        await this.set(tagKey, kept, Infinity);\n      }\n    });\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async tagDelete(tagKey: CacheKey): Promise<void> {\n    await this.runSerialized(this.parseKey(tagKey), () => this.remove(tagKey));\n  }\n\n  /**\n   * The index stored as a plain entry, or `[]`. Non-string members (a corrupted\n   * or foreign value) are ignored rather than trusted.\n   */\n  protected async readTagArray(tagKey: CacheKey): Promise<string[]> {\n    const value = await this.get(tagKey);\n\n    if (!Array.isArray(value)) {\n      return [];\n    }\n\n    return value.filter((member): member is string => typeof member === \"string\");\n  }\n\n  /**\n   * Apply tag relationships after a successful write. Called by drivers once\n   * the value is in storage.\n   *\n   * Pass the caller's key, not the parsed one: the tag index stores keys\n   * un-prefixed so `invalidate()` can delete them through `remove(key)`.\n   */\n  protected async applyTags(key: CacheKey, tags: string[]): Promise<void> {\n    if (tags.length === 0) {\n      return;\n    }\n\n    const tagged = this.tags(tags);\n    await (tagged as TaggedCache).storeTagRelationship(key);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public abstract get(key: CacheKey): Promise<any>;\n\n  /**\n   * {@inheritdoc}\n   */\n  public abstract remove(key: CacheKey): Promise<void>;\n\n  /**\n   * {@inheritdoc}\n   */\n  public abstract flush(): Promise<void>;\n\n  /**\n   * {@inheritdoc}\n   */\n  public async has(key: CacheKey): Promise<boolean> {\n    const value = await this.get(key);\n    // Event is emitted by get() method\n    return value !== null;\n  }\n\n  /**\n   * In-flight `remember()` computations, one per parsed key (stampede guard).\n   */\n  protected rememberInFlight: Map<string, Promise<any>> = new Map();\n\n  /**\n   * In-flight `swr()` cold-miss fetches, one per parsed key.\n   */\n  protected swrFetchInFlight: Map<string, Promise<any>> = new Map();\n\n  /**\n   * In-flight `swr()` stale-window background refreshes, one per parsed key.\n   */\n  protected swrRefreshes: Map<string, Promise<void>> = new Map();\n\n  /**\n   * Per-key serialization chains for the in-process read-modify-write\n   * operations (`update`, and the default `increment` / `pull`). Kept apart\n   * from the stampede maps so a `remember()` can never break an update chain,\n   * and never receives an unrelated promise.\n   */\n  protected updateChains: Map<string, Promise<any>> = new Map();\n\n  /**\n   * Run `task` once per key at a time: concurrent callers for the same\n   * `parsedKey` share the in-flight promise registered in `inFlight`.\n   */\n  protected singleFlight<T>(\n    inFlight: Map<string, Promise<any>>,\n    parsedKey: string,\n    task: () => Promise<T>,\n  ): Promise<T> {\n    const existing = inFlight.get(parsedKey);\n\n    if (existing) {\n      return existing as Promise<T>;\n    }\n\n    const promise: Promise<T> = task().finally(() => {\n      if (inFlight.get(parsedKey) === promise) {\n        inFlight.delete(parsedKey);\n      }\n    });\n\n    inFlight.set(parsedKey, promise);\n\n    return promise;\n  }\n\n  /**\n   * Chain `task` after every earlier serialized task for the same key, so\n   * read-modify-write callers in THIS process run one at a time. This is\n   * process-local: it does not coordinate with other servers.\n   */\n  protected runSerialized<T>(parsedKey: string, task: () => Promise<T>): Promise<T> {\n    const previous = this.updateChains.get(parsedKey) ?? Promise.resolve();\n\n    const next = previous.catch(() => undefined).then(task);\n\n    this.updateChains.set(parsedKey, next);\n\n    // Clean up the slot once this link finishes, but only if nobody chained a\n    // follow-up onto it meanwhile. The trailing catch keeps a rejected link\n    // from surfacing as an unhandled rejection here (the caller still sees it).\n    next\n      .finally(() => {\n        if (this.updateChains.get(parsedKey) === next) {\n          this.updateChains.delete(parsedKey);\n        }\n      })\n      .catch(() => undefined);\n\n    return next;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async remember(\n    key: CacheKey,\n    ttlOrOptions: CacheTtl | RememberOptions,\n    callback: () => Promise<any>,\n  ): Promise<any> {\n    const parsedKey = this.parseKey(key);\n\n    // The options-form lets callers forward tags / driver-override through to\n    // the cache-miss write. Normalize both shapes into a single CacheSetOptions\n    // blob so there's one path from here on.\n    const setOptions = this.normalizeRememberOptions(ttlOrOptions);\n\n    // Only a real miss (`null`) recomputes: cached falsy values such as\n    // `0`, `false` and `\"\"` are returned as-is.\n    const cachedValue = await this.get(key);\n\n    if (cachedValue !== null && cachedValue !== undefined) {\n      return cachedValue;\n    }\n\n    return this.singleFlight(this.rememberInFlight, parsedKey, async () => {\n      const result = await callback();\n\n      await this.set(key, result, setOptions);\n\n      return result;\n    });\n  }\n\n  /**\n   * Resolve the TTL-or-options arg of `remember` into a `CacheSetOptions` object\n   * that can be passed straight to `set()`. Keeps the implementation unbranched.\n   */\n  protected normalizeRememberOptions(\n    ttlOrOptions: CacheTtl | RememberOptions,\n  ): CacheSetOptions {\n    if (typeof ttlOrOptions === \"number\" || typeof ttlOrOptions === \"string\") {\n      return { ttl: ttlOrOptions };\n    }\n\n    return {\n      ttl: ttlOrOptions.ttl,\n      tags: ttlOrOptions.tags,\n    };\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: read raw entry, branch on freshness/staleness,\n   * trigger background refresh in the stale window, fall through to\n   * `callback` on miss/expiry. Concurrent cold-miss callers share one fetch\n   * ({@link swrFetchInFlight}); concurrent stale-window callers share one\n   * background refresh ({@link swrRefreshes}).\n   *\n   * Drivers without a real {@link getEntry} override degrade gracefully —\n   * the synthetic entry has no `staleAt`, which the freshness check treats\n   * as \"always fresh,\" so SWR behaves like a TTL-only cached read on those\n   * drivers (no background refresh, but no double-fetch either).\n   */\n  public async swr<T = any>(\n    key: CacheKey,\n    options: CacheSwrOptions,\n    callback: () => Promise<T>,\n  ): Promise<T> {\n    const parsedKey = this.parseKey(key);\n    const freshSeconds = parseTtl(options.freshTtl);\n    const staleSeconds = parseTtl(options.staleTtl);\n\n    if (staleSeconds <= freshSeconds) {\n      throw new Error(\n        `cache.swr: 'staleTtl' (${staleSeconds}s) must be greater than 'freshTtl' (${freshSeconds}s).`,\n      );\n    }\n\n    const entry = await this.getEntry(key);\n    const now = Date.now();\n\n    const isExpired = entry?.expiresAt !== undefined && entry.expiresAt <= now;\n\n    if (!entry || isExpired) {\n      return this.singleFlight(this.swrFetchInFlight, parsedKey, () =>\n        this.swrFetchAndStore<T>(key, options, callback, freshSeconds, staleSeconds),\n      );\n    }\n\n    const isFresh = entry.staleAt === undefined || entry.staleAt > now;\n\n    if (isFresh) {\n      return entry.data as T;\n    }\n\n    this.scheduleSwrRefresh<T>(\n      parsedKey,\n      key,\n      options,\n      callback,\n      freshSeconds,\n      staleSeconds,\n    );\n\n    return entry.data as T;\n  }\n\n  /**\n   * Read the raw {@link CacheData} wrapper for a key, including any\n   * `expiresAt` / `staleAt` metadata. Default implementation falls back to\n   * `get()` and synthesizes a metadata-less wrapper — drivers that store\n   * the wrapper directly (memory, lru, file, redis, pg, mock) override\n   * this to return real metadata so SWR can branch on freshness.\n   */\n  protected async getEntry(key: CacheKey): Promise<CacheData | null> {\n    const value = await this.get(key);\n\n    if (value === null) {\n      return null;\n    }\n\n    return { data: value };\n  }\n\n  /**\n   * Remaining lifetime of an existing entry, in seconds — used by TTL-preserving\n   * writes such as `update()` / `merge()` when the caller passes no explicit\n   * `ttl`.\n   *\n   * - `Infinity` — the entry exists with no expiry (preserve \"never expires\").\n   * - positive number — seconds left before the entry expires.\n   * - `undefined` — the key is missing or already past its deadline; the caller\n   *   should fall back to the driver default TTL.\n   *\n   * Default reads `expiresAt` from {@link getEntry}, which the metadata-aware\n   * drivers (memory, lru, mock, pg) populate. Drivers that track TTL natively\n   * and don't carry `expiresAt` in their payload (Redis) override this.\n   */\n  protected async getRemainingTtl(key: CacheKey): Promise<number | undefined> {\n    const entry = await this.getEntry(key);\n\n    if (!entry) {\n      return undefined;\n    }\n\n    if (!entry.expiresAt || entry.expiresAt === Infinity) {\n      return Infinity;\n    }\n\n    const remainingSeconds = Math.ceil((entry.expiresAt - Date.now()) / 1000);\n\n    return remainingSeconds > 0 ? remainingSeconds : undefined;\n  }\n\n  /**\n   * Block-and-fetch path of `swr()`: invoked on miss or past-`staleTtl`\n   * expiry. Writes through `set()` with the SWR options translated into\n   * standard `CacheSetOptions` (ttl = staleTtl, staleAt = now + freshTtl).\n   */\n  protected async swrFetchAndStore<T>(\n    key: CacheKey,\n    options: CacheSwrOptions,\n    callback: () => Promise<T>,\n    freshSeconds: number,\n    staleSeconds: number,\n  ): Promise<T> {\n    const result = await callback();\n\n    await this.set(key, result, {\n      ttl: staleSeconds,\n      staleAt: Date.now() + freshSeconds * 1000,\n      tags: options.tags,\n    });\n\n    return result;\n  }\n\n  /**\n   * Stale-window background refresh. Registers a single in-flight promise\n   * per parsed key so concurrent SWR callers share one refresh. Failed\n   * refreshes preserve the stale entry, log via `logError`, and emit on\n   * `error` — the stale-returning caller never sees the failure.\n   */\n  protected scheduleSwrRefresh<T>(\n    parsedKey: string,\n    key: CacheKey,\n    options: CacheSwrOptions,\n    callback: () => Promise<T>,\n    freshSeconds: number,\n    staleSeconds: number,\n  ): void {\n    if (this.swrRefreshes.has(parsedKey)) {\n      return;\n    }\n\n    let refresh!: Promise<void>;\n    refresh = (async () => {\n      try {\n        const result = await callback();\n\n        await this.set(key, result, {\n          ttl: staleSeconds,\n          staleAt: Date.now() + freshSeconds * 1000,\n          tags: options.tags,\n        });\n      } catch (error) {\n        this.logError(`SWR background refresh failed for ${parsedKey}`, error);\n        await this.emit(\"error\", { key: parsedKey, error });\n      } finally {\n        if (this.swrRefreshes.get(parsedKey) === refresh) {\n          this.swrRefreshes.delete(parsedKey);\n        }\n      }\n    })();\n\n    this.swrRefreshes.set(parsedKey, refresh);\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: get-then-remove, serialized per key in THIS\n   * process. Drivers with a native primitive override it to be atomic across\n   * servers (redis `GETDEL`, pg `DELETE … RETURNING`) or process-atomic\n   * (memory, lru, mock).\n   */\n  public async pull(key: CacheKey): Promise<any | null> {\n    return this.runSerialized(this.parseKey(key), async () => {\n      // Events are emitted by get() and remove()\n      const value = await this.get(key);\n\n      if (value !== null) {\n        await this.remove(key);\n      }\n\n      return value;\n    });\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async forever(key: CacheKey, value: any): Promise<any> {\n    // Event is emitted by set() method\n    return this.set(key, value, Infinity);\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: read-add-write serialized per key in THIS process,\n   * keeping the entry's deadline (a missing key starts from 0 with the driver\n   * default TTL). Not atomic across servers: drivers with a native primitive\n   * override it (redis `INCRBY`, pg single-statement upsert).\n   *\n   * The value and its deadline come from ONE read. Reading them separately\n   * let a counter that expired in between be rewritten from its stale value\n   * with no expiry at all (a login-throttle counter that then never resets).\n   * The remaining TTL is rounded down, so repeated increments can never push\n   * a window's deadline later.\n   */\n  public async increment(key: CacheKey, value: number = 1): Promise<number> {\n    const parsedKey = this.parseKey(key);\n\n    return this.runSerialized(parsedKey, async () => {\n      const entry = await this.getEntry(key);\n      const now = Date.now();\n      const expiresAt = entry?.expiresAt;\n      const live = entry ? expiresAt == null || expiresAt > now : false;\n      const current = entry && live ? entry.data : null;\n      const base = current === null || current === undefined ? 0 : current;\n\n      if (typeof base !== \"number\") {\n        throw new Error(`Cannot increment non-numeric value for key: ${maskEmailsInText(parsedKey)}`);\n      }\n\n      const newValue = base + value;\n\n      if (!live) {\n        // missing, or expired since it was read: a fresh counter\n        await this.set(key, newValue);\n      } else if (expiresAt == null || expiresAt === Infinity) {\n        await this.set(key, newValue, { ttl: Infinity });\n      } else {\n        await this.set(key, newValue, {\n          ttl: Math.max(1, Math.floor((expiresAt - now) / 1000)),\n        });\n      }\n\n      return newValue;\n    });\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async decrement(key: CacheKey, value: number = 1): Promise<number> {\n    return this.increment(key, -value);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async many(keys: CacheKey[]): Promise<any[]> {\n    return Promise.all(keys.map((key) => this.get(key)));\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async setMany(\n    items: Record<string, any>,\n    ttl?: number,\n  ): Promise<void> {\n    await Promise.all(\n      Object.entries(items).map(([key, value]) => this.set(key, value, ttl)),\n    );\n  }\n\n  /**\n   * Log the operation\n   */\n  protected log(operation: CacheOperationType, key?: string | any) {\n    if (!this.shouldLog) return;\n\n    if (typeof key === \"string\") {\n      // this will be likely used with file cache driver as it will convert the dot to slash\n      // to make it consistent and not to confuse developers we will output the key by making sure it's a dot\n      // An email inside a key (an app's `user.<email>` key, say) is personal\n      // data in a log line; key-based redaction cannot reach it, so mask it.\n      key = maskEmailsInText(key.replace(/\\//g, \".\"));\n    }\n\n    if (operation === \"connectionFailed\") {\n      log.fatal(`cache.${this.name}`, operation, key);\n    }\n\n    if (operation == \"notFound\" || operation == \"expired\") {\n      return log.info(\n        \"cache.\" + this.name,\n        operation,\n        (key ? key + \" \" : \"\") + messages[operation],\n      );\n    }\n\n    if (operation.endsWith(\"ed\")) {\n      return log.success(\n        \"cache.\" + this.name,\n        operation,\n        (key ? key + \" \" : \"\") + messages[operation],\n      );\n    }\n\n    log.info(\n      \"cache.\" + this.name,\n      operation,\n      (key ? key + \" \" : \"\") + messages[operation],\n    );\n  }\n\n  /**\n   * Log error message\n   *\n   * Never logs the raw `error` object — driver connection errors (Redis,\n   * Postgres, ...) can carry the connection string, including the password,\n   * in the message/cause. Only a redacted `{ message, code }` shape is\n   * passed to the structured logger.\n   */\n  protected logError(message: string, error?: any) {\n    // Error lines name the key (\"SWR background refresh failed for\n    // user.alice@example.com\"), and they are written even with logging off,\n    // so addresses are masked here as in `log()`.\n    const maskedMessage = maskEmailsInText(message);\n\n    if (error) {\n      const info = safeErrorInfo(error);\n\n      log.error(\"cache.\" + this.name, \"error\", maskedMessage, {\n        ...info,\n        message: maskEmailsInText(info.message),\n      });\n    } else {\n      log.error(\"cache.\" + this.name, \"error\", maskedMessage);\n    }\n  }\n\n  /**\n   * Get the default TTL in seconds. Parses human-readable strings (`\"1h\"`, `\"30m\"`)\n   * from driver options if present; falls back to `Infinity` when no default is set.\n   */\n  public get ttl() {\n    if (this.options.ttl === undefined) {\n      return Infinity;\n    }\n\n    return parseTtl(this.options.ttl);\n  }\n\n  /**\n   * Get time to live value in milliseconds\n   */\n  public getExpiresAt(ttl: number = this.ttl) {\n    if (ttl) {\n      return new Date().getTime() + ttl * 1000;\n    }\n  }\n\n  /**\n   * Wrap a value with TTL and optional freshness metadata for backend\n   * storage. `staleAt` persists alongside `expiresAt` when supplied — used\n   * by the SWR flow to mark when the entry stops being fresh.\n   */\n  protected prepareDataForStorage(data: any, ttl?: number, staleAt?: number) {\n    const preparedData: CacheData = {\n      data,\n    };\n\n    if (ttl) {\n      preparedData.ttl = ttl;\n      preparedData.expiresAt = this.getExpiresAt(ttl);\n    }\n\n    if (staleAt !== undefined) {\n      preparedData.staleAt = staleAt;\n    }\n\n    return preparedData;\n  }\n\n  /**\n   * Parse fetched data from cache\n   */\n  protected async parseCachedData(key: string, data: CacheData) {\n    this.log(\"fetched\", key);\n\n    if (data.expiresAt && data.expiresAt < Date.now()) {\n      this.remove(key);\n      return null;\n    }\n\n    const value = data.data;\n\n    // Skip cloning for primitives (immutable types)\n    if (value === null || value === undefined) {\n      return value;\n    }\n\n    const type = typeof value;\n    if (type === \"string\" || type === \"number\" || type === \"boolean\") {\n      return value;\n    }\n\n    // Deep clone objects/arrays to prevent cache mutation\n    try {\n      return structuredClone(value);\n    } catch (error) {\n      this.logError(\n        `Failed to clone cached value for ${key}, typeof value: ${typeof value}`,\n        error,\n      );\n      throw error;\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async connect() {\n    this.log(\"connecting\");\n    this.log(\"connected\");\n    await this.emit(\"connected\");\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async disconnect() {\n    this.log(\"disconnected\");\n    await this.emit(\"disconnected\");\n  }\n\n  /**\n   * Create a tagged cache instance for the given tags\n   */\n  public tags(tags: string[]): any {\n    return new TaggedCache(tags, this);\n  }\n\n  /**\n   * Emit `invalidated` on behalf of a {@link TaggedCache} created by this\n   * driver, once per `invalidate()` call. Listeners cannot fail the\n   * invalidation: `emit` isolates them.\n   *\n   * @internal\n   */\n  public async emitTagsInvalidated(data: {\n    tags: string[];\n    keys: string[];\n    durationMs: number;\n  }): Promise<void> {\n    await this.emit(\"invalidated\", data);\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: read → transform → write, serialized per key in\n   * THIS process only. Drivers that can offer cross-server atomicity (redis,\n   * pg: compare-and-set with retries) override it.\n   */\n  public async update<T = any>(\n    key: CacheKey,\n    fn: (current: T | null) => T | null | Promise<T | null>,\n    options: { ttl?: CacheTtl } = {},\n  ): Promise<T | null> {\n    // Chain each update onto the previous one for the same key so concurrent\n    // callers are serialized end-to-end, not merely awakened together.\n    return this.runSerialized(this.parseKey(key), async () => {\n      const current = (await this.get(key)) as T | null;\n      const result = await fn(current);\n\n      if (result === null) {\n        await this.remove(key);\n        return null;\n      }\n\n      if (options.ttl !== undefined) {\n        await this.set(key, result, { ttl: options.ttl });\n\n        return result;\n      }\n\n      // No explicit TTL → preserve the existing entry's remaining lifetime\n      // rather than resetting it to the driver default.\n      const remainingTtl = await this.getRemainingTtl(key);\n\n      if (remainingTtl !== undefined) {\n        await this.set(key, result, { ttl: remainingTtl });\n      } else {\n        await this.set(key, result);\n      }\n\n      return result;\n    });\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async merge<T extends Record<string, any> = Record<string, any>>(\n    key: CacheKey,\n    partial: Partial<T>,\n    options: { ttl?: CacheTtl } = {},\n  ): Promise<T> {\n    const result = await this.update<T>(\n      key,\n      (current) => {\n        const base = (current ?? {}) as T;\n        return { ...base, ...partial } as T;\n      },\n      options,\n    );\n\n    return result as T;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation: read-mutate-write array backed by the underlying\n   * cache entry. Concrete drivers (e.g. Redis) override with native commands.\n   */\n  public list<T = any>(key: CacheKey): CacheListAccessor<T> {\n    return new MemoryCacheList<T>(this, key);\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Built on top of `set({ onConflict: \"create\" })` — Redis-native `SET … NX EX`\n   * under the hood on Redis, emulated via key-existence check on other drivers.\n   * The lock value is the resolved `owner` (defaults to `pid.<process.pid>`).\n   *\n   * Always releases in `finally`, even if `fn` throws — the thrown error\n   * propagates to the caller unchanged, and a failed release is logged rather\n   * than replacing `fn`'s result or error. The ttl must be finite and\n   * positive; there is no renewal, so it must exceed the worst-case duration.\n   */\n  public async lock<T>(\n    key: CacheKey,\n    ttlOrOptions: CacheTtl | Omit<LockOptions, \"driver\">,\n    fn: () => Promise<T>,\n  ): Promise<LockOutcome<T>> {\n    const { ttl, owner } = this.normalizeLockOptions(ttlOrOptions);\n\n    // A lock with no expiry stays held forever if its holder crashes, on every\n    // server. Refuse it up front (parseTtl also rejects undefined / NaN).\n    const ttlSeconds = parseTtl(ttl);\n\n    if (!Number.isFinite(ttlSeconds) || ttlSeconds <= 0) {\n      throw new CacheConfigurationError(\n        `cache.lock() requires a finite, positive ttl (got ${String(ttl)}). The ttl must exceed the worst-case duration of the locked work.`,\n      );\n    }\n    // The stored value is `<owner>#<token>`: the token makes it unique per\n    // acquisition so release can compare-and-delete instead of deleting blindly.\n    const lockValue = `${owner ?? `pid.${process.pid}`}#${randomUUID()}`;\n\n    const setResult = (await this.set(key, lockValue, {\n      onConflict: \"create\",\n      ttl,\n    })) as CacheSetResult | unknown;\n\n    // `onConflict` drivers return CacheSetResult. Drivers that no-op on set\n    // (e.g. the null driver) may return anything else — treat that as\n    // \"acquired\" since there's nothing to collide with.\n    const wasSet =\n      typeof setResult === \"object\" &&\n      setResult !== null &&\n      \"wasSet\" in setResult\n        ? (setResult as CacheSetResult).wasSet\n        : true;\n\n    if (!wasSet) {\n      return { acquired: false };\n    }\n\n    try {\n      const value = await fn();\n      return { acquired: true, value };\n    } finally {\n      // Only delete our own lock — if the TTL expired and a successor\n      // acquired the key, its value differs and it is left alone. A release\n      // failure (e.g. a Redis blip) is logged, never allowed to replace fn's\n      // outcome: the lock still expires by its TTL.\n      try {\n        await this.deleteIfEquals(key, lockValue);\n      } catch (error) {\n        this.logError(`lock release failed for ${this.parseKey(key)}`, error);\n      }\n    }\n  }\n\n  /**\n   * Compare-and-delete: remove `key` only when its current value equals\n   * `expected`. Returns whether a delete happened.\n   *\n   * This default is get-then-remove and is NOT atomic across processes; drivers\n   * with a real primitive (memory, redis, pg) override it.\n   */\n  protected async deleteIfEquals(key: CacheKey, expected: unknown): Promise<boolean> {\n    if ((await this.get(key)) !== expected) {\n      return false;\n    }\n\n    await this.remove(key);\n\n    return true;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Default implementation throws {@link CacheUnsupportedError}. Drivers that\n   * support similarity retrieval (memory family, `pg`, `redis` w/ RediSearch)\n   * override this with a real impl.\n   */\n  public async similar<T = any>(\n    _vector: number[],\n    _options: CacheSimilarOptions,\n  ): Promise<CacheSimilarHit<T>[]> {\n    throw new CacheUnsupportedError(\n      `'${this.name}' driver does not support similarity retrieval. Use a memory driver, 'pg' (with pgvector), or 'redis' (with RediSearch).`,\n    );\n  }\n\n  /**\n   * Resolve the TTL-or-options arg of `lock` into a uniform shape.\n   */\n  protected normalizeLockOptions(\n    ttlOrOptions: CacheTtl | Omit<LockOptions, \"driver\">,\n  ): {\n    ttl: CacheTtl;\n    owner?: string;\n  } {\n    if (typeof ttlOrOptions === \"number\" || typeof ttlOrOptions === \"string\") {\n      return { ttl: ttlOrOptions };\n    }\n\n    return { ttl: ttlOrOptions.ttl, owner: ttlOrOptions.owner };\n  }\n}\n"],"mappings":";;;;;;;;AAwEA,MAAM,WAAW;CACf,UAAU;CACV,SAAS;CACT,UAAU;CACV,SAAS;CACT,SAAS;CACT,QAAQ;CACR,UAAU;CACV,SAAS;CACT,UAAU;CACV,SAAS;CACT,SAAS;CACT,UAAU;CACV,YAAY;CACZ,WAAW;CACX,eAAe;CACf,cAAc;CACd,kBAAkB;CAClB,OAAO;AACT;AAEA,IAAsB,kBAAtB,MAG8C;;mBASb;wCAuC7B,IAAI,IAAI;0CAoR8C,IAAI,IAAI;0CAKR,IAAI,IAAI;sCAKX,IAAI,IAAI;sCAQT,IAAI,IAAI;;;;;CAxU5D,IAAW,SAAS;EAClB,OAAQ,KAAK,gBAAgB;CAC/B;;;;CAKA,AAAO,gBAAgB,WAAoB;EACzC,KAAK,YAAY;EAEjB,OAAO;CACT;;;;CAKA,IAAW,OAAO,QAAoB;EACpC,KAAK,eAAe;CACtB;;;;CAqBA,AAAO,SAAS,KAAe;EAC7B,OAAO,cAAc,KAAK,KAAK,OAAO;CACxC;;;;CAKA,AAAO,WAAW,SAAkB;EAClC,KAAK,UAAU,WAAW,CAAC;EAC3B,OAAO;CACT;;;;CAKA,AAAO,GAAG,OAAuB,SAAkC;EACjE,IAAI,CAAC,KAAK,eAAe,IAAI,KAAK,GAChC,KAAK,eAAe,IAAI,uBAAO,IAAI,IAAI,CAAC;EAE1C,KAAK,eAAe,IAAI,KAAK,CAAC,CAAE,IAAI,OAAO;EAC3C,OAAO;CACT;;;;CAKA,AAAO,IAAI,OAAuB,SAAkC;EAClE,MAAM,WAAW,KAAK,eAAe,IAAI,KAAK;EAC9C,IAAI,UACF,SAAS,OAAO,OAAO;EAEzB,OAAO;CACT;;;;CAKA,AAAO,KAAK,OAAuB,SAAkC;EACnE,MAAM,cAAiC,OAAO,SAAS;GACrD,MAAM,QAAQ,IAAI;GAClB,KAAK,IAAI,OAAO,WAAW;EAC7B;EACA,OAAO,KAAK,GAAG,OAAO,WAAW;CACnC;;;;CAKA,MAAgB,KACd,OACA,OAAgC,CAAC,GAClB;EACf,MAAM,WAAW,KAAK,eAAe,IAAI,KAAK;EAC9C,IAAI,CAAC,YAAY,SAAS,SAAS,GAAG;EAEtC,MAAM,YAA4B;GAChC,QAAQ,KAAK;GACb,GAAG;EACL;EAGA,MAAM,WAA4B,CAAC;EACnC,KAAK,MAAM,WAAW,UACpB,IAAI;GACF,MAAM,SAAS,QAAQ,SAAS;GAChC,IAAI,kBAAkB,SACpB,SAAS,KAAK,MAAM;EAExB,SAAS,OAAO;GACd,KAAK,SAAS,+BAA+B,MAAM,IAAI,KAAK;EAC9D;EAIF,IAAI,SAAS,SAAS,GACpB,MAAM,QAAQ,WAAW,QAAQ;CAErC;;;;;;;;;CAwBA,AAAU,kBACR,cACsB;EACtB,MAAM,UAAU,mBAAmB,YAAY;EAE/C,OAAO;GACL,KAAK,WAAW,QAAQ,KAAK,QAAQ,WAAW,KAAK,GAAG;GACxD,MAAM,QAAQ;GACd,YAAY,QAAQ,cAAc;GAClC,QAAQ,QAAQ;GAChB,SAAS,QAAQ;EACnB;CACF;;;;;;;;;CAUA,MAAgB,eACd,MAC6B;EAC7B,IAAI,CAAC,QAAQ,KAAK,WAAW,GAC3B,OAAO;EAGT,MAAM,0BAAU,IAAI,IAAY;EAChC,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,OAAO,MAAM,KAAK,WAAW,cAAc,KAAK;GACtD,KAAK,MAAM,KAAK,MACd,QAAQ,IAAI,KAAK,SAAS,CAAC,CAAC;EAEhC;EAEA,OAAO;CACT;;;;;;;;;CAcA,MAAa,OAAO,QAAkB,SAAkC;EACtE,IAAI,QAAQ,WAAW,GACrB;EAGF,MAAM,KAAK,cAAc,KAAK,SAAS,MAAM,GAAG,YAAY;GAC1D,MAAM,UAAU,MAAM,KAAK,aAAa,MAAM;GAC9C,MAAM,SAAS,IAAI,IAAI,OAAO;GAE9B,KAAK,MAAM,UAAU,SACnB,OAAO,IAAI,MAAM;GAGnB,IAAI,OAAO,SAAS,QAAQ,QAC1B,MAAM,KAAK,IAAI,QAAQ,CAAC,GAAG,MAAM,GAAG,QAAQ;EAEhD,CAAC;CACH;;;;CAKA,MAAa,WAAW,QAAqC;EAC3D,OAAO,KAAK,aAAa,MAAM;CACjC;;;;;;;CAQA,MAAa,UAAU,QAAkB,SAAkC;EACzE,IAAI,QAAQ,WAAW,GACrB;EAGF,MAAM,KAAK,cAAc,KAAK,SAAS,MAAM,GAAG,YAAY;GAC1D,MAAM,UAAU,MAAM,KAAK,aAAa,MAAM;GAC9C,MAAM,UAAU,IAAI,IAAI,OAAO;GAC/B,MAAM,OAAO,QAAQ,QAAQ,WAAW,CAAC,QAAQ,IAAI,MAAM,CAAC;GAE5D,IAAI,KAAK,WAAW,QAAQ,QAC1B;GAGF,IAAI,KAAK,WAAW,GAClB,MAAM,KAAK,OAAO,MAAM;QAExB,MAAM,KAAK,IAAI,QAAQ,MAAM,QAAQ;EAEzC,CAAC;CACH;;;;CAKA,MAAa,UAAU,QAAiC;EACtD,MAAM,KAAK,cAAc,KAAK,SAAS,MAAM,SAAS,KAAK,OAAO,MAAM,CAAC;CAC3E;;;;;CAMA,MAAgB,aAAa,QAAqC;EAChE,MAAM,QAAQ,MAAM,KAAK,IAAI,MAAM;EAEnC,IAAI,CAAC,MAAM,QAAQ,KAAK,GACtB,OAAO,CAAC;EAGV,OAAO,MAAM,QAAQ,WAA6B,OAAO,WAAW,QAAQ;CAC9E;;;;;;;;CASA,MAAgB,UAAU,KAAe,MAA+B;EACtE,IAAI,KAAK,WAAW,GAClB;EAIF,MADe,KAAK,KAAK,IACb,CAAC,CAAiB,qBAAqB,GAAG;CACxD;;;;CAoBA,MAAa,IAAI,KAAiC;EAGhD,OAAO,MAFa,KAAK,IAAI,GAAG,MAEf;CACnB;;;;;CA6BA,AAAU,aACR,UACA,WACA,MACY;EACZ,MAAM,WAAW,SAAS,IAAI,SAAS;EAEvC,IAAI,UACF,OAAO;EAGT,MAAM,UAAsB,KAAK,CAAC,CAAC,cAAc;GAC/C,IAAI,SAAS,IAAI,SAAS,MAAM,SAC9B,SAAS,OAAO,SAAS;EAE7B,CAAC;EAED,SAAS,IAAI,WAAW,OAAO;EAE/B,OAAO;CACT;;;;;;CAOA,AAAU,cAAiB,WAAmB,MAAoC;EAGhF,MAAM,QAFW,KAAK,aAAa,IAAI,SAAS,KAAK,QAAQ,QAAQ,EAEhD,CAAC,YAAY,MAAS,CAAC,CAAC,KAAK,IAAI;EAEtD,KAAK,aAAa,IAAI,WAAW,IAAI;EAKrC,KACG,cAAc;GACb,IAAI,KAAK,aAAa,IAAI,SAAS,MAAM,MACvC,KAAK,aAAa,OAAO,SAAS;EAEtC,CAAC,CAAC,CACD,YAAY,MAAS;EAExB,OAAO;CACT;;;;CAKA,MAAa,SACX,KACA,cACA,UACc;EACd,MAAM,YAAY,KAAK,SAAS,GAAG;EAKnC,MAAM,aAAa,KAAK,yBAAyB,YAAY;EAI7D,MAAM,cAAc,MAAM,KAAK,IAAI,GAAG;EAEtC,IAAI,gBAAgB,QAAQ,gBAAgB,QAC1C,OAAO;EAGT,OAAO,KAAK,aAAa,KAAK,kBAAkB,WAAW,YAAY;GACrE,MAAM,SAAS,MAAM,SAAS;GAE9B,MAAM,KAAK,IAAI,KAAK,QAAQ,UAAU;GAEtC,OAAO;EACT,CAAC;CACH;;;;;CAMA,AAAU,yBACR,cACiB;EACjB,IAAI,OAAO,iBAAiB,YAAY,OAAO,iBAAiB,UAC9D,OAAO,EAAE,KAAK,aAAa;EAG7B,OAAO;GACL,KAAK,aAAa;GAClB,MAAM,aAAa;EACrB;CACF;;;;;;;;;;;;;;;CAgBA,MAAa,IACX,KACA,SACA,UACY;EACZ,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,eAAe,SAAS,QAAQ,QAAQ;EAC9C,MAAM,eAAe,SAAS,QAAQ,QAAQ;EAE9C,IAAI,gBAAgB,cAClB,MAAM,IAAI,MACR,0BAA0B,aAAa,sCAAsC,aAAa,IAC5F;EAGF,MAAM,QAAQ,MAAM,KAAK,SAAS,GAAG;EACrC,MAAM,MAAM,KAAK,IAAI;EAErB,MAAM,YAAY,OAAO,cAAc,UAAa,MAAM,aAAa;EAEvE,IAAI,CAAC,SAAS,WACZ,OAAO,KAAK,aAAa,KAAK,kBAAkB,iBAC9C,KAAK,iBAAoB,KAAK,SAAS,UAAU,cAAc,YAAY,CAC7E;EAKF,IAFgB,MAAM,YAAY,UAAa,MAAM,UAAU,KAG7D,OAAO,MAAM;EAGf,KAAK,mBACH,WACA,KACA,SACA,UACA,cACA,YACF;EAEA,OAAO,MAAM;CACf;;;;;;;;CASA,MAAgB,SAAS,KAA0C;EACjE,MAAM,QAAQ,MAAM,KAAK,IAAI,GAAG;EAEhC,IAAI,UAAU,MACZ,OAAO;EAGT,OAAO,EAAE,MAAM,MAAM;CACvB;;;;;;;;;;;;;;;CAgBA,MAAgB,gBAAgB,KAA4C;EAC1E,MAAM,QAAQ,MAAM,KAAK,SAAS,GAAG;EAErC,IAAI,CAAC,OACH;EAGF,IAAI,CAAC,MAAM,aAAa,MAAM,cAAc,UAC1C,OAAO;EAGT,MAAM,mBAAmB,KAAK,MAAM,MAAM,YAAY,KAAK,IAAI,KAAK,GAAI;EAExE,OAAO,mBAAmB,IAAI,mBAAmB;CACnD;;;;;;CAOA,MAAgB,iBACd,KACA,SACA,UACA,cACA,cACY;EACZ,MAAM,SAAS,MAAM,SAAS;EAE9B,MAAM,KAAK,IAAI,KAAK,QAAQ;GAC1B,KAAK;GACL,SAAS,KAAK,IAAI,IAAI,eAAe;GACrC,MAAM,QAAQ;EAChB,CAAC;EAED,OAAO;CACT;;;;;;;CAQA,AAAU,mBACR,WACA,KACA,SACA,UACA,cACA,cACM;EACN,IAAI,KAAK,aAAa,IAAI,SAAS,GACjC;EAGF,IAAI;EACJ,WAAW,YAAY;GACrB,IAAI;IACF,MAAM,SAAS,MAAM,SAAS;IAE9B,MAAM,KAAK,IAAI,KAAK,QAAQ;KAC1B,KAAK;KACL,SAAS,KAAK,IAAI,IAAI,eAAe;KACrC,MAAM,QAAQ;IAChB,CAAC;GACH,SAAS,OAAO;IACd,KAAK,SAAS,qCAAqC,aAAa,KAAK;IACrE,MAAM,KAAK,KAAK,SAAS;KAAE,KAAK;KAAW;IAAM,CAAC;GACpD,UAAU;IACR,IAAI,KAAK,aAAa,IAAI,SAAS,MAAM,SACvC,KAAK,aAAa,OAAO,SAAS;GAEtC;EACF,EAAC,CAAE;EAEH,KAAK,aAAa,IAAI,WAAW,OAAO;CAC1C;;;;;;;;;CAUA,MAAa,KAAK,KAAoC;EACpD,OAAO,KAAK,cAAc,KAAK,SAAS,GAAG,GAAG,YAAY;GAExD,MAAM,QAAQ,MAAM,KAAK,IAAI,GAAG;GAEhC,IAAI,UAAU,MACZ,MAAM,KAAK,OAAO,GAAG;GAGvB,OAAO;EACT,CAAC;CACH;;;;CAKA,MAAa,QAAQ,KAAe,OAA0B;EAE5D,OAAO,KAAK,IAAI,KAAK,OAAO,QAAQ;CACtC;;;;;;;;;;;;;;;CAgBA,MAAa,UAAU,KAAe,QAAgB,GAAoB;EACxE,MAAM,YAAY,KAAK,SAAS,GAAG;EAEnC,OAAO,KAAK,cAAc,WAAW,YAAY;GAC/C,MAAM,QAAQ,MAAM,KAAK,SAAS,GAAG;GACrC,MAAM,MAAM,KAAK,IAAI;GACrB,MAAM,YAAY,OAAO;GACzB,MAAM,OAAO,QAAQ,aAAa,QAAQ,YAAY,MAAM;GAC5D,MAAM,UAAU,SAAS,OAAO,MAAM,OAAO;GAC7C,MAAM,OAAO,YAAY,QAAQ,YAAY,SAAY,IAAI;GAE7D,IAAI,OAAO,SAAS,UAClB,MAAM,IAAI,MAAM,+CAA+C,iBAAiB,SAAS,GAAG;GAG9F,MAAM,WAAW,OAAO;GAExB,IAAI,CAAC,MAEH,MAAM,KAAK,IAAI,KAAK,QAAQ;QACvB,IAAI,aAAa,QAAQ,cAAc,UAC5C,MAAM,KAAK,IAAI,KAAK,UAAU,EAAE,KAAK,SAAS,CAAC;QAE/C,MAAM,KAAK,IAAI,KAAK,UAAU,EAC5B,KAAK,KAAK,IAAI,GAAG,KAAK,OAAO,YAAY,OAAO,GAAI,CAAC,EACvD,CAAC;GAGH,OAAO;EACT,CAAC;CACH;;;;CAKA,MAAa,UAAU,KAAe,QAAgB,GAAoB;EACxE,OAAO,KAAK,UAAU,KAAK,CAAC,KAAK;CACnC;;;;CAKA,MAAa,KAAK,MAAkC;EAClD,OAAO,QAAQ,IAAI,KAAK,KAAK,QAAQ,KAAK,IAAI,GAAG,CAAC,CAAC;CACrD;;;;CAKA,MAAa,QACX,OACA,KACe;EACf,MAAM,QAAQ,IACZ,OAAO,QAAQ,KAAK,CAAC,CAAC,KAAK,CAAC,KAAK,WAAW,KAAK,IAAI,KAAK,OAAO,GAAG,CAAC,CACvE;CACF;;;;CAKA,AAAU,IAAI,WAA+B,KAAoB;EAC/D,IAAI,CAAC,KAAK,WAAW;EAErB,IAAI,OAAO,QAAQ,UAKjB,MAAM,iBAAiB,IAAI,QAAQ,OAAO,GAAG,CAAC;EAGhD,IAAI,cAAc,oBAChB,IAAI,MAAM,SAAS,KAAK,QAAQ,WAAW,GAAG;EAGhD,IAAI,aAAa,cAAc,aAAa,WAC1C,OAAO,IAAI,KACT,WAAW,KAAK,MAChB,YACC,MAAM,MAAM,MAAM,MAAM,SAAS,UACpC;EAGF,IAAI,UAAU,SAAS,IAAI,GACzB,OAAO,IAAI,QACT,WAAW,KAAK,MAChB,YACC,MAAM,MAAM,MAAM,MAAM,SAAS,UACpC;EAGF,IAAI,KACF,WAAW,KAAK,MAChB,YACC,MAAM,MAAM,MAAM,MAAM,SAAS,UACpC;CACF;;;;;;;;;CAUA,AAAU,SAAS,SAAiB,OAAa;EAI/C,MAAM,gBAAgB,iBAAiB,OAAO;EAE9C,IAAI,OAAO;GACT,MAAM,OAAO,cAAc,KAAK;GAEhC,IAAI,MAAM,WAAW,KAAK,MAAM,SAAS,eAAe;IACtD,GAAG;IACH,SAAS,iBAAiB,KAAK,OAAO;GACxC,CAAC;EACH,OACE,IAAI,MAAM,WAAW,KAAK,MAAM,SAAS,aAAa;CAE1D;;;;;CAMA,IAAW,MAAM;EACf,IAAI,KAAK,QAAQ,QAAQ,QACvB,OAAO;EAGT,OAAO,SAAS,KAAK,QAAQ,GAAG;CAClC;;;;CAKA,AAAO,aAAa,MAAc,KAAK,KAAK;EAC1C,IAAI,KACF,wBAAO,IAAI,KAAK,EAAC,CAAC,QAAQ,IAAI,MAAM;CAExC;;;;;;CAOA,AAAU,sBAAsB,MAAW,KAAc,SAAkB;EACzE,MAAM,eAA0B,EAC9B,KACF;EAEA,IAAI,KAAK;GACP,aAAa,MAAM;GACnB,aAAa,YAAY,KAAK,aAAa,GAAG;EAChD;EAEA,IAAI,YAAY,QACd,aAAa,UAAU;EAGzB,OAAO;CACT;;;;CAKA,MAAgB,gBAAgB,KAAa,MAAiB;EAC5D,KAAK,IAAI,WAAW,GAAG;EAEvB,IAAI,KAAK,aAAa,KAAK,YAAY,KAAK,IAAI,GAAG;GACjD,KAAK,OAAO,GAAG;GACf,OAAO;EACT;EAEA,MAAM,QAAQ,KAAK;EAGnB,IAAI,UAAU,QAAQ,UAAU,QAC9B,OAAO;EAGT,MAAM,OAAO,OAAO;EACpB,IAAI,SAAS,YAAY,SAAS,YAAY,SAAS,WACrD,OAAO;EAIT,IAAI;GACF,OAAO,gBAAgB,KAAK;EAC9B,SAAS,OAAO;GACd,KAAK,SACH,oCAAoC,IAAI,kBAAkB,OAAO,SACjE,KACF;GACA,MAAM;EACR;CACF;;;;CAKA,MAAa,UAAU;EACrB,KAAK,IAAI,YAAY;EACrB,KAAK,IAAI,WAAW;EACpB,MAAM,KAAK,KAAK,WAAW;CAC7B;;;;CAKA,MAAa,aAAa;EACxB,KAAK,IAAI,cAAc;EACvB,MAAM,KAAK,KAAK,cAAc;CAChC;;;;CAKA,AAAO,KAAK,MAAqB;EAC/B,OAAO,IAAI,YAAY,MAAM,IAAI;CACnC;;;;;;;;CASA,MAAa,oBAAoB,MAIf;EAChB,MAAM,KAAK,KAAK,eAAe,IAAI;CACrC;;;;;;;;CASA,MAAa,OACX,KACA,IACA,UAA8B,CAAC,GACZ;EAGnB,OAAO,KAAK,cAAc,KAAK,SAAS,GAAG,GAAG,YAAY;GAExD,MAAM,SAAS,MAAM,GAAG,MADD,KAAK,IAAI,GAAG,CACJ;GAE/B,IAAI,WAAW,MAAM;IACnB,MAAM,KAAK,OAAO,GAAG;IACrB,OAAO;GACT;GAEA,IAAI,QAAQ,QAAQ,QAAW;IAC7B,MAAM,KAAK,IAAI,KAAK,QAAQ,EAAE,KAAK,QAAQ,IAAI,CAAC;IAEhD,OAAO;GACT;GAIA,MAAM,eAAe,MAAM,KAAK,gBAAgB,GAAG;GAEnD,IAAI,iBAAiB,QACnB,MAAM,KAAK,IAAI,KAAK,QAAQ,EAAE,KAAK,aAAa,CAAC;QAEjD,MAAM,KAAK,IAAI,KAAK,MAAM;GAG5B,OAAO;EACT,CAAC;CACH;;;;CAKA,MAAa,MACX,KACA,SACA,UAA8B,CAAC,GACnB;EAUZ,OAAO,MATc,KAAK,OACxB,MACC,YAAY;GAEX,OAAO;IAAE,GADK,WAAW,CAAC;IACR,GAAG;GAAQ;EAC/B,GACA,OACF;CAGF;;;;;;;CAQA,AAAO,KAAc,KAAqC;EACxD,OAAO,IAAI,gBAAmB,MAAM,GAAG;CACzC;;;;;;;;;;;;;CAcA,MAAa,KACX,KACA,cACA,IACyB;EACzB,MAAM,EAAE,KAAK,UAAU,KAAK,qBAAqB,YAAY;EAI7D,MAAM,aAAa,SAAS,GAAG;EAE/B,IAAI,CAAC,OAAO,SAAS,UAAU,KAAK,cAAc,GAChD,MAAM,IAAI,wBACR,qDAAqD,OAAO,GAAG,EAAE,mEACnE;EAIF,MAAM,YAAY,GAAG,SAAS,OAAO,QAAQ,MAAM,GAAG,WAAW;EAEjE,MAAM,YAAa,MAAM,KAAK,IAAI,KAAK,WAAW;GAChD,YAAY;GACZ;EACF,CAAC;EAYD,IAAI,EANF,OAAO,cAAc,YACrB,cAAc,QACd,YAAY,YACP,UAA6B,SAC9B,OAGJ,OAAO,EAAE,UAAU,MAAM;EAG3B,IAAI;GAEF,OAAO;IAAE,UAAU;IAAM,aADL,GAAG;GACQ;EACjC,UAAU;GAKR,IAAI;IACF,MAAM,KAAK,eAAe,KAAK,SAAS;GAC1C,SAAS,OAAO;IACd,KAAK,SAAS,2BAA2B,KAAK,SAAS,GAAG,KAAK,KAAK;GACtE;EACF;CACF;;;;;;;;CASA,MAAgB,eAAe,KAAe,UAAqC;EACjF,IAAK,MAAM,KAAK,IAAI,GAAG,MAAO,UAC5B,OAAO;EAGT,MAAM,KAAK,OAAO,GAAG;EAErB,OAAO;CACT;;;;;;;;CASA,MAAa,QACX,SACA,UAC+B;EAC/B,MAAM,IAAI,sBACR,IAAI,KAAK,KAAK,yHAChB;CACF;;;;CAKA,AAAU,qBACR,cAIA;EACA,IAAI,OAAO,iBAAiB,YAAY,OAAO,iBAAiB,UAC9D,OAAO,EAAE,KAAK,aAAa;EAG7B,OAAO;GAAE,KAAK,aAAa;GAAK,OAAO,aAAa;EAAM;CAC5D;AACF"}

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

@@ -1,7 +1,7 @@
 import { BaseCacheDriver } from "./base-cache-driver.mjs";
 import { CacheData, CacheDriver, CacheKey, CacheSetOptions, CacheTtl, FileCacheOptions } from "../types.mjs";
 
-//#region ../cache/src/drivers/file-cache-driver.d.ts
+//#region ../../packages/cache/src/drivers/file-cache-driver.d.ts
 declare class FileCacheDriver extends BaseCacheDriver<FileCacheDriver, FileCacheOptions> implements CacheDriver<FileCacheDriver, FileCacheOptions> {
   /**
    * {@inheritdoc}

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

@@ -1 +1 @@
-{"version":3,"file":"file-cache-driver.d.mts","names":[],"sources":["../../../../../../../cache/src/drivers/file-cache-driver.ts"],"mappings":";;;;cAsBa,eAAA,SACH,eAAA,CAAgB,eAAA,EAAiB,gBAAA,aAC9B,WAAA,CAAY,eAAA,EAAiB,gBAAA;;AAF1C;;EAOS,IAAA;EANiB;;;EAWjB,UAAA,CAAW,OAAA,EAAS,gBAAA;EAAA;;;EAAA,IAahB,SAAA;EAqJiB;;;EAAA,IAtIjB,QAAA;EA+PY;;;;;;;;;;EAAA,UA3Ob,YAAA,CAAa,SAAA;EA3Df;;;;EAAA,UAyEE,gBAAA,CAAiB,SAAA;EAzEH;;;;;;;EAAA,UAuFd,gBAAA,CAAiB,OAAA;EA5ET;;;;;EAAA,UAwFR,aAAA,CAAc,OAAA;EA1BG;;;;;;;;;;;EAuDd,eAAA,CAAgB,SAAA,WAAiB,OAAA;EA6C7B;;;;;;;EAHJ,GAAA,CACX,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EAkEA;;;;;;;;EAAA,UAHa,cAAA,CACd,QAAA,UACA,IAAA,EAAM,SAAA,GACL,OAAA;IAAU,QAAA;EAAA;EAoGA;;;;;;;;EA9CA,MAAA,IAAU,OAAA;EA2GL;;;EAlGL,KAAA,IAAS,OAAA;EAoHF;;;;;EAAA,UAzGJ,QAAA,CAAS,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,SAAA;;;;EA0BpC,GAAA,CAAI,GAAA,EAAK,QAAA,GAAQ,OAAA;;;;EAyCjB,MAAA,CAAO,GAAA,EAAK,QAAA,GAAQ,OAAA;;;;EAoBpB,KAAA,IAAK,OAAA;;;;EAkBL,OAAA,IAAO,OAAA;AAAA"}
+{"version":3,"file":"file-cache-driver.d.mts","names":[],"sources":["../../../../../../../../packages/cache/src/drivers/file-cache-driver.ts"],"mappings":";;;;cAsBa,eAAA,SACH,eAAA,CAAgB,eAAA,EAAiB,gBAAA,aAC9B,WAAA,CAAY,eAAA,EAAiB,gBAAA;;AAF1C;;EAOS,IAAA;EANiB;;;EAWjB,UAAA,CAAW,OAAA,EAAS,gBAAA;EAAA;;;EAAA,IAahB,SAAA;EAqJiB;;;EAAA,IAtIjB,QAAA;EA+PY;;;;;;;;;;EAAA,UA3Ob,YAAA,CAAa,SAAA;EA3Df;;;;EAAA,UAyEE,gBAAA,CAAiB,SAAA;EAzEH;;;;;;;EAAA,UAuFd,gBAAA,CAAiB,OAAA;EA5ET;;;;;EAAA,UAwFR,aAAA,CAAc,OAAA;EA1BG;;;;;;;;;;;EAuDd,eAAA,CAAgB,SAAA,WAAiB,OAAA;EA6C7B;;;;;;;EAHJ,GAAA,CACX,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EAkEA;;;;;;;;EAAA,UAHa,cAAA,CACd,QAAA,UACA,IAAA,EAAM,SAAA,GACL,OAAA;IAAU,QAAA;EAAA;EAsGA;;;;;;;;EAhDA,MAAA,IAAU,OAAA;EA6GL;;;EApGL,KAAA,IAAS,OAAA;EAsHF;;;;;EAAA,UA3GJ,QAAA,CAAS,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,SAAA;;;;EA4BpC,GAAA,CAAI,GAAA,EAAK,QAAA,GAAQ,OAAA;;;;EAyCjB,MAAA,CAAO,GAAA,EAAK,QAAA,GAAQ,OAAA;;;;EAoBpB,KAAA,IAAK,OAAA;;;;EAkBL,OAAA,IAAO,OAAA;AAAA"}

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

@@ -5,7 +5,7 @@ import fs from "node:fs";
 import { atomicWriteJsonAsync, ensureDirectoryAsync, getJsonFileAsync, listDirectoriesAsync, removeDirectoryAsync } from "@warlock.js/fs";
 import path from "path";
 
-//#region ../cache/src/drivers/file-cache-driver.ts
+//#region ../../packages/cache/src/drivers/file-cache-driver.ts
 var FileCacheDriver = class extends BaseCacheDriver {
 	constructor(..._args) {
 		super(..._args);
@@ -215,7 +215,7 @@ var FileCacheDriver = class extends BaseCacheDriver {
 		try {
 			const entry = await getJsonFileAsync(path.resolve(fileDirectory, this.fileName));
 			if (!entry) return null;
-			if (entry.expiresAt !== void 0 && entry.expiresAt <= Date.now()) return null;
+			if (typeof entry.expiresAt === "number" && entry.expiresAt <= Date.now()) return null;
 			return entry;
 		} catch {
 			return null;

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

@@ -1 +1 @@
-{"version":3,"file":"file-cache-driver.mjs","names":[],"sources":["../../../../../../../cache/src/drivers/file-cache-driver.ts"],"sourcesContent":["import { randomBytes } from \"node:crypto\";\nimport fs from \"node:fs\";\nimport {\n  atomicWriteJsonAsync,\n  ensureDirectoryAsync,\n  getJsonFileAsync,\n  listDirectoriesAsync,\n  removeDirectoryAsync,\n} from \"@warlock.js/fs\";\nimport path from \"path\";\nimport type {\n  CacheData,\n  CacheDriver,\n  CacheKey,\n  CacheSetOptions,\n  CacheSetResult,\n  CacheTtl,\n  FileCacheOptions,\n} from \"../types\";\nimport { CacheConfigurationError, CacheError, CacheUnsupportedError } from \"../types\";\nimport { BaseCacheDriver } from \"./base-cache-driver\";\n\nexport class FileCacheDriver\n  extends BaseCacheDriver<FileCacheDriver, FileCacheOptions>\n  implements CacheDriver<FileCacheDriver, FileCacheOptions>\n{\n  /**\n   * {@inheritdoc}\n   */\n  public name = \"file\";\n\n  /**\n   * {@inheritdoc}\n   */\n  public setOptions(options: FileCacheOptions) {\n    if (!options.directory) {\n      throw new CacheConfigurationError(\n        \"File driver requires 'directory' option to be configured.\",\n      );\n    }\n\n    return super.setOptions(options);\n  }\n\n  /**\n   * Get the cache directory\n   */\n  public get directory() {\n    const directory = this.options.directory;\n\n    if (typeof directory === \"function\") {\n      return directory();\n    }\n\n    throw new CacheConfigurationError(\n      \"Cache directory is not defined, please define it in the file driver options\",\n    );\n  }\n\n  /**\n   * Get file name\n   */\n  public get fileName() {\n    const fileName = this.options.fileName;\n\n    if (typeof fileName === \"function\") {\n      return fileName();\n    }\n\n    return \"cache.json\";\n  }\n\n  /**\n   * Map a parsed cache key (or namespace) to its on-disk directory.\n   *\n   * The key must become exactly one directory component: `%` and the path\n   * separators are percent-encoded so a hostile key (`../../etc`,\n   * `..\\\\..\\\\evil`) turns into an inert directory name instead of a path\n   * traversal, while distinct keys can never collide after encoding. Dots are\n   * left untouched — the `.`-delimited namespace scheme is purely logical and\n   * only ever produces a single filesystem component here.\n   */\n  protected keyDirectory(parsedKey: string): string {\n    // An empty key would resolve to the cache root — `remove(\"{}\")` must never\n    // be able to wipe it.\n    if (parsedKey === \"\") {\n      throw new CacheConfigurationError(\"Cache key must not be empty.\");\n    }\n\n    return this.containedPath(this.encodeKeySegment(parsedKey));\n  }\n\n  /**\n   * Percent-encode a parsed key into an inert, single-component directory\n   * name. Dots are left untouched — see {@link keyDirectory}.\n   */\n  protected encodeKeySegment(parsedKey: string): string {\n    return parsedKey\n      .replace(/%/g, \"%25\")\n      .replace(/\\//g, \"%2F\")\n      .replace(/\\\\/g, \"%5C\");\n  }\n\n  /**\n   * Reverse of {@link encodeKeySegment} — recovers the logical, dot-delimited\n   * parsed key from an on-disk directory name. Used by {@link removeNamespace}\n   * to test which sibling directories logically belong to a namespace, since\n   * dotted keys (`ns.a`) are stored as sibling directories rather than nested\n   * ones (see {@link keyDirectory}'s doc comment).\n   */\n  protected decodeKeySegment(encoded: string): string {\n    return encoded\n      .replace(/%2F/g, \"/\")\n      .replace(/%5C/g, \"\\\\\")\n      .replace(/%25/g, \"%\");\n  }\n\n  /**\n   * Resolve `segment` against the cache root and throw when the result lands\n   * outside it — the last line of defense against path traversal, independent\n   * of how the key was encoded.\n   */\n  protected containedPath(segment: string): string {\n    const base = path.resolve(this.directory);\n    const resolved = path.resolve(base, segment);\n    const relative = path.relative(base, resolved);\n\n    if (\n      relative === \"..\" ||\n      relative.startsWith(`..${path.sep}`) ||\n      path.isAbsolute(relative)\n    ) {\n      throw new CacheError(\n        `Cache key resolves outside the cache directory: \"${segment}\"`,\n      );\n    }\n\n    return resolved;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Dotted keys (`ns.a`) are stored as sibling directories, not nested ones\n   * (see {@link keyDirectory}) — a directory literally named `<namespace>`\n   * rarely exists on its own. Namespace removal therefore has to scan the\n   * cache root's immediate children and remove every directory whose\n   * *logical* (decoded) name equals the namespace or starts with\n   * `<namespace>.`, mirroring the `key = $1 OR key LIKE $2` boundary\n   * semantics the `pg` driver already uses for the same contract.\n   */\n  public async removeNamespace(namespace: string) {\n    const parsedNamespace = this.parseKey(namespace);\n\n    this.log(\"clearing\", namespace);\n\n    try {\n      const root = this.containedPath(\"\");\n\n      if (parsedNamespace === \"\") {\n        await removeDirectoryAsync(root);\n        this.log(\"cleared\", namespace);\n        return this;\n      }\n\n      const prefix = `${parsedNamespace}.`;\n      const entries = await listDirectoriesAsync(root).catch(() => [] as string[]);\n\n      await Promise.all(\n        entries.map(async (entryPath) => {\n          const decoded = this.decodeKeySegment(path.basename(entryPath));\n\n          if (decoded === parsedNamespace || decoded.startsWith(prefix)) {\n            await removeDirectoryAsync(entryPath);\n          }\n        }),\n      );\n\n      this.log(\"cleared\", namespace);\n    } catch (error) {\n      //\n    }\n\n    return this;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * `onConflict: \"create\"` is exclusive (temp file + hard link, so `lock()`\n   * is safe across concurrent writers). `onConflict: \"update\"` is NOT atomic:\n   * the existence probe and the write are separate steps.\n   */\n  public async set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any> {\n    const parsedKey = this.parseKey(key);\n    const { ttl, tags, onConflict, vector, staleAt } = this.resolveSetOptions(ttlOrOptions);\n\n    if (vector) {\n      throw new CacheUnsupportedError(\n        \"'file' driver does not support similarity retrieval — use a memory driver, 'pg' (with pgvector), or 'redis' (with RediSearch).\",\n      );\n    }\n\n    this.log(\"caching\", parsedKey);\n\n    const existing = onConflict === \"upsert\" || onConflict === \"create\" ? null : await this.get(key);\n    const exists = existing !== null;\n\n    if (onConflict === \"update\" && !exists) {\n      const result: CacheSetResult = { wasSet: false, existing: null };\n      return result;\n    }\n\n    const data = this.prepareDataForStorage(value, ttl, staleAt);\n\n    const fileDirectory = this.keyDirectory(parsedKey);\n\n    await ensureDirectoryAsync(fileDirectory);\n\n    const filePath = path.resolve(fileDirectory, this.fileName);\n\n    if (onConflict === \"create\") {\n      const conflict = await this.writeExclusive(filePath, data);\n\n      if (conflict) {\n        const result: CacheSetResult = { wasSet: false, existing: conflict.existing };\n        return result;\n      }\n    } else {\n      await atomicWriteJsonAsync(filePath, data);\n    }\n\n    if (tags && tags.length > 0) {\n      await this.applyTags(key, tags);\n    }\n\n    this.log(\"cached\", parsedKey);\n\n    await this.emit(\"set\", { key: parsedKey, value, ttl });\n\n    if (onConflict === \"create\" || onConflict === \"update\") {\n      const result: CacheSetResult = { wasSet: true, existing: null };\n      return result;\n    }\n\n    return this;\n  }\n\n  /**\n   * Create `filePath` only if it does not exist. Writes a temp file, then\n   * hard-links it to the target (EEXIST = already present). An existing but\n   * expired entry is removed (the file only, never the directory) and the\n   * link retried once.\n   *\n   * Returns `null` when written, or `{ existing }` on conflict.\n   */\n  protected async writeExclusive(\n    filePath: string,\n    data: CacheData,\n  ): Promise<{ existing: any } | null> {\n    const tempPath = `${filePath}.${randomBytes(6).toString(\"hex\")}.tmp`;\n\n    try {\n      await fs.promises.writeFile(tempPath, JSON.stringify(data, null, 2));\n\n      for (let attempt = 0; attempt < 2; attempt++) {\n        try {\n          await fs.promises.link(tempPath, filePath);\n          return null;\n        } catch (error: any) {\n          if (error?.code !== \"EEXIST\") {\n            throw error;\n          }\n        }\n\n        let current: CacheData | undefined;\n\n        try {\n          current = (await getJsonFileAsync(filePath)) as CacheData | undefined;\n        } catch {\n          current = undefined;\n        }\n\n        const expired =\n          current?.expiresAt !== undefined && current.expiresAt !== null && current.expiresAt <= Date.now();\n\n        if (current && !expired) {\n          return { existing: current.data ?? null };\n        }\n\n        if (attempt === 0 && expired) {\n          await fs.promises.rm(filePath, { force: true });\n          continue;\n        }\n\n        // Unreadable (corrupt) file: treat as held, never delete it.\n        return { existing: null };\n      }\n\n      return { existing: null };\n    } finally {\n      await fs.promises.unlink(tempPath).catch(() => undefined);\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * File driver does not yet ship with a file-lock primitive, so concurrent\n   * writers could clobber each other. Rather than ship an unsafe default, we\n   * throw — consumers can fall back to memory/redis for `update` until a\n   * proper file lock lands (tracked in `domains/cache/backlog.md`).\n   */\n  public async update(): Promise<never> {\n    throw new CacheUnsupportedError(\n      \"`update()` is not supported on the file driver. Use the memory or redis driver, or wait for the file-lock primitive (see domains/cache/backlog.md).\",\n    );\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async merge(): Promise<never> {\n    throw new CacheUnsupportedError(\n      \"`merge()` is not supported on the file driver. Use the memory or redis driver.\",\n    );\n  }\n\n  /**\n   * Read the raw {@link CacheData} wrapper from disk, including `staleAt`\n   * metadata. Returns `null` for missing or expired files — `swr()`\n   * consumes this to branch on freshness.\n   */\n  protected async getEntry(key: CacheKey): Promise<CacheData | null> {\n    const parsedKey = this.parseKey(key);\n    const fileDirectory = this.keyDirectory(parsedKey);\n\n    try {\n      const entry = (await getJsonFileAsync(path.resolve(fileDirectory, this.fileName))) as\n        | CacheData\n        | undefined;\n\n      if (!entry) {\n        return null;\n      }\n\n      if (entry.expiresAt !== undefined && entry.expiresAt <= Date.now()) {\n        return null;\n      }\n\n      return entry;\n    } catch {\n      return null;\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async get(key: CacheKey) {\n    const parsedKey = this.parseKey(key);\n\n    this.log(\"fetching\", parsedKey);\n\n    const fileDirectory = this.keyDirectory(parsedKey);\n\n    let value: CacheData | undefined;\n\n    try {\n      value = (await getJsonFileAsync(path.resolve(fileDirectory, this.fileName))) as\n        | CacheData\n        | undefined;\n    } catch {\n      // Missing file (ENOENT) or corrupt JSON: a plain miss. Never remove the\n      // directory here — it may be mid-write by another process.\n      value = undefined;\n    }\n\n    if (value === undefined || value === null || typeof value !== \"object\") {\n      this.log(\"notFound\", parsedKey);\n      await this.emit(\"miss\", { key: parsedKey });\n      return null;\n    }\n\n    // Only a successfully parsed but expired entry is removed (inside\n    // parseCachedData).\n    const result = await this.parseCachedData(parsedKey, value);\n\n    if (result === null) {\n      await this.emit(\"miss\", { key: parsedKey });\n    } else {\n      await this.emit(\"hit\", { key: parsedKey, value: result });\n    }\n\n    return result;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async remove(key: CacheKey) {\n    const parsedKey = this.parseKey(key);\n    this.log(\"removing\", parsedKey);\n\n    const fileDirectory = this.keyDirectory(parsedKey);\n\n    try {\n      await removeDirectoryAsync(fileDirectory);\n\n      this.log(\"removed\", parsedKey);\n      // Emit removed event\n      await this.emit(\"removed\", { key: parsedKey });\n    } catch (error) {\n      //\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async flush() {\n    this.log(\"flushing\");\n\n    if (this.options.globalPrefix) {\n      await this.removeNamespace(\"\");\n    } else {\n      await removeDirectoryAsync(this.directory);\n    }\n\n    this.log(\"flushed\");\n\n    // Emit flushed event\n    await this.emit(\"flushed\");\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async connect() {\n    this.log(\"connecting\");\n    await ensureDirectoryAsync(this.directory);\n    this.log(\"connected\");\n    await this.emit(\"connected\");\n  }\n}\n"],"mappings":";;;;;;;;AAsBA,IAAa,kBAAb,cACU,gBAEV;;;cAIgB;;;;;CAKd,AAAO,WAAW,SAA2B;EAC3C,IAAI,CAAC,QAAQ,WACX,MAAM,IAAI,wBACR,2DACF;EAGF,OAAO,MAAM,WAAW,OAAO;CACjC;;;;CAKA,IAAW,YAAY;EACrB,MAAM,YAAY,KAAK,QAAQ;EAE/B,IAAI,OAAO,cAAc,YACvB,OAAO,UAAU;EAGnB,MAAM,IAAI,wBACR,6EACF;CACF;;;;CAKA,IAAW,WAAW;EACpB,MAAM,WAAW,KAAK,QAAQ;EAE9B,IAAI,OAAO,aAAa,YACtB,OAAO,SAAS;EAGlB,OAAO;CACT;;;;;;;;;;;CAYA,AAAU,aAAa,WAA2B;EAGhD,IAAI,cAAc,IAChB,MAAM,IAAI,wBAAwB,8BAA8B;EAGlE,OAAO,KAAK,cAAc,KAAK,iBAAiB,SAAS,CAAC;CAC5D;;;;;CAMA,AAAU,iBAAiB,WAA2B;EACpD,OAAO,UACJ,QAAQ,MAAM,KAAK,CAAC,CACpB,QAAQ,OAAO,KAAK,CAAC,CACrB,QAAQ,OAAO,KAAK;CACzB;;;;;;;;CASA,AAAU,iBAAiB,SAAyB;EAClD,OAAO,QACJ,QAAQ,QAAQ,GAAG,CAAC,CACpB,QAAQ,QAAQ,IAAI,CAAC,CACrB,QAAQ,QAAQ,GAAG;CACxB;;;;;;CAOA,AAAU,cAAc,SAAyB;EAC/C,MAAM,OAAO,KAAK,QAAQ,KAAK,SAAS;EACxC,MAAM,WAAW,KAAK,QAAQ,MAAM,OAAO;EAC3C,MAAM,WAAW,KAAK,SAAS,MAAM,QAAQ;EAE7C,IACE,aAAa,QACb,SAAS,WAAW,KAAK,KAAK,KAAK,KACnC,KAAK,WAAW,QAAQ,GAExB,MAAM,IAAI,WACR,oDAAoD,QAAQ,EAC9D;EAGF,OAAO;CACT;;;;;;;;;;;;CAaA,MAAa,gBAAgB,WAAmB;EAC9C,MAAM,kBAAkB,KAAK,SAAS,SAAS;EAE/C,KAAK,IAAI,YAAY,SAAS;EAE9B,IAAI;GACF,MAAM,OAAO,KAAK,cAAc,EAAE;GAElC,IAAI,oBAAoB,IAAI;IAC1B,MAAM,qBAAqB,IAAI;IAC/B,KAAK,IAAI,WAAW,SAAS;IAC7B,OAAO;GACT;GAEA,MAAM,SAAS,GAAG,gBAAgB;GAClC,MAAM,UAAU,MAAM,qBAAqB,IAAI,CAAC,CAAC,YAAY,CAAC,CAAa;GAE3E,MAAM,QAAQ,IACZ,QAAQ,IAAI,OAAO,cAAc;IAC/B,MAAM,UAAU,KAAK,iBAAiB,KAAK,SAAS,SAAS,CAAC;IAE9D,IAAI,YAAY,mBAAmB,QAAQ,WAAW,MAAM,GAC1D,MAAM,qBAAqB,SAAS;GAExC,CAAC,CACH;GAEA,KAAK,IAAI,WAAW,SAAS;EAC/B,SAAS,OAAO,CAEhB;EAEA,OAAO;CACT;;;;;;;;CASA,MAAa,IACX,KACA,OACA,cACc;EACd,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,EAAE,KAAK,MAAM,YAAY,QAAQ,YAAY,KAAK,kBAAkB,YAAY;EAEtF,IAAI,QACF,MAAM,IAAI,sBACR,gIACF;EAGF,KAAK,IAAI,WAAW,SAAS;EAG7B,MAAM,UADW,eAAe,YAAY,eAAe,WAAW,OAAO,MAAM,KAAK,IAAI,GAAG,OACnE;EAE5B,IAAI,eAAe,YAAY,CAAC,QAE9B,OAAO;GAD0B,QAAQ;GAAO,UAAU;EAC9C;EAGd,MAAM,OAAO,KAAK,sBAAsB,OAAO,KAAK,OAAO;EAE3D,MAAM,gBAAgB,KAAK,aAAa,SAAS;EAEjD,MAAM,qBAAqB,aAAa;EAExC,MAAM,WAAW,KAAK,QAAQ,eAAe,KAAK,QAAQ;EAE1D,IAAI,eAAe,UAAU;GAC3B,MAAM,WAAW,MAAM,KAAK,eAAe,UAAU,IAAI;GAEzD,IAAI,UAEF,OAAO;IAD0B,QAAQ;IAAO,UAAU,SAAS;GACvD;EAEhB,OACE,MAAM,qBAAqB,UAAU,IAAI;EAG3C,IAAI,QAAQ,KAAK,SAAS,GACxB,MAAM,KAAK,UAAU,KAAK,IAAI;EAGhC,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;;;;;;;;;CAUA,MAAgB,eACd,UACA,MACmC;EACnC,MAAM,WAAW,GAAG,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,KAAK,EAAE;EAE/D,IAAI;GACF,MAAM,GAAG,SAAS,UAAU,UAAU,KAAK,UAAU,MAAM,MAAM,CAAC,CAAC;GAEnE,KAAK,IAAI,UAAU,GAAG,UAAU,GAAG,WAAW;IAC5C,IAAI;KACF,MAAM,GAAG,SAAS,KAAK,UAAU,QAAQ;KACzC,OAAO;IACT,SAAS,OAAY;KACnB,IAAI,OAAO,SAAS,UAClB,MAAM;IAEV;IAEA,IAAI;IAEJ,IAAI;KACF,UAAW,MAAM,iBAAiB,QAAQ;IAC5C,QAAQ;KACN,UAAU;IACZ;IAEA,MAAM,UACJ,SAAS,cAAc,UAAa,QAAQ,cAAc,QAAQ,QAAQ,aAAa,KAAK,IAAI;IAElG,IAAI,WAAW,CAAC,SACd,OAAO,EAAE,UAAU,QAAQ,QAAQ,KAAK;IAG1C,IAAI,YAAY,KAAK,SAAS;KAC5B,MAAM,GAAG,SAAS,GAAG,UAAU,EAAE,OAAO,KAAK,CAAC;KAC9C;IACF;IAGA,OAAO,EAAE,UAAU,KAAK;GAC1B;GAEA,OAAO,EAAE,UAAU,KAAK;EAC1B,UAAU;GACR,MAAM,GAAG,SAAS,OAAO,QAAQ,CAAC,CAAC,YAAY,MAAS;EAC1D;CACF;;;;;;;;;CAUA,MAAa,SAAyB;EACpC,MAAM,IAAI,sBACR,qJACF;CACF;;;;CAKA,MAAa,QAAwB;EACnC,MAAM,IAAI,sBACR,gFACF;CACF;;;;;;CAOA,MAAgB,SAAS,KAA0C;EACjE,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,gBAAgB,KAAK,aAAa,SAAS;EAEjD,IAAI;GACF,MAAM,QAAS,MAAM,iBAAiB,KAAK,QAAQ,eAAe,KAAK,QAAQ,CAAC;GAIhF,IAAI,CAAC,OACH,OAAO;GAGT,IAAI,MAAM,cAAc,UAAa,MAAM,aAAa,KAAK,IAAI,GAC/D,OAAO;GAGT,OAAO;EACT,QAAQ;GACN,OAAO;EACT;CACF;;;;CAKA,MAAa,IAAI,KAAe;EAC9B,MAAM,YAAY,KAAK,SAAS,GAAG;EAEnC,KAAK,IAAI,YAAY,SAAS;EAE9B,MAAM,gBAAgB,KAAK,aAAa,SAAS;EAEjD,IAAI;EAEJ,IAAI;GACF,QAAS,MAAM,iBAAiB,KAAK,QAAQ,eAAe,KAAK,QAAQ,CAAC;EAG5E,QAAQ;GAGN,QAAQ;EACV;EAEA,IAAI,UAAU,UAAa,UAAU,QAAQ,OAAO,UAAU,UAAU;GACtE,KAAK,IAAI,YAAY,SAAS;GAC9B,MAAM,KAAK,KAAK,QAAQ,EAAE,KAAK,UAAU,CAAC;GAC1C,OAAO;EACT;EAIA,MAAM,SAAS,MAAM,KAAK,gBAAgB,WAAW,KAAK;EAE1D,IAAI,WAAW,MACb,MAAM,KAAK,KAAK,QAAQ,EAAE,KAAK,UAAU,CAAC;OAE1C,MAAM,KAAK,KAAK,OAAO;GAAE,KAAK;GAAW,OAAO;EAAO,CAAC;EAG1D,OAAO;CACT;;;;CAKA,MAAa,OAAO,KAAe;EACjC,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,KAAK,IAAI,YAAY,SAAS;EAE9B,MAAM,gBAAgB,KAAK,aAAa,SAAS;EAEjD,IAAI;GACF,MAAM,qBAAqB,aAAa;GAExC,KAAK,IAAI,WAAW,SAAS;GAE7B,MAAM,KAAK,KAAK,WAAW,EAAE,KAAK,UAAU,CAAC;EAC/C,SAAS,OAAO,CAEhB;CACF;;;;CAKA,MAAa,QAAQ;EACnB,KAAK,IAAI,UAAU;EAEnB,IAAI,KAAK,QAAQ,cACf,MAAM,KAAK,gBAAgB,EAAE;OAE7B,MAAM,qBAAqB,KAAK,SAAS;EAG3C,KAAK,IAAI,SAAS;EAGlB,MAAM,KAAK,KAAK,SAAS;CAC3B;;;;CAKA,MAAa,UAAU;EACrB,KAAK,IAAI,YAAY;EACrB,MAAM,qBAAqB,KAAK,SAAS;EACzC,KAAK,IAAI,WAAW;EACpB,MAAM,KAAK,KAAK,WAAW;CAC7B;AACF"}
+{"version":3,"file":"file-cache-driver.mjs","names":[],"sources":["../../../../../../../../packages/cache/src/drivers/file-cache-driver.ts"],"sourcesContent":["import { randomBytes } from \"node:crypto\";\nimport fs from \"node:fs\";\nimport {\n  atomicWriteJsonAsync,\n  ensureDirectoryAsync,\n  getJsonFileAsync,\n  listDirectoriesAsync,\n  removeDirectoryAsync,\n} from \"@warlock.js/fs\";\nimport path from \"path\";\nimport type {\n  CacheData,\n  CacheDriver,\n  CacheKey,\n  CacheSetOptions,\n  CacheSetResult,\n  CacheTtl,\n  FileCacheOptions,\n} from \"../types\";\nimport { CacheConfigurationError, CacheError, CacheUnsupportedError } from \"../types\";\nimport { BaseCacheDriver } from \"./base-cache-driver\";\n\nexport class FileCacheDriver\n  extends BaseCacheDriver<FileCacheDriver, FileCacheOptions>\n  implements CacheDriver<FileCacheDriver, FileCacheOptions>\n{\n  /**\n   * {@inheritdoc}\n   */\n  public name = \"file\";\n\n  /**\n   * {@inheritdoc}\n   */\n  public setOptions(options: FileCacheOptions) {\n    if (!options.directory) {\n      throw new CacheConfigurationError(\n        \"File driver requires 'directory' option to be configured.\",\n      );\n    }\n\n    return super.setOptions(options);\n  }\n\n  /**\n   * Get the cache directory\n   */\n  public get directory() {\n    const directory = this.options.directory;\n\n    if (typeof directory === \"function\") {\n      return directory();\n    }\n\n    throw new CacheConfigurationError(\n      \"Cache directory is not defined, please define it in the file driver options\",\n    );\n  }\n\n  /**\n   * Get file name\n   */\n  public get fileName() {\n    const fileName = this.options.fileName;\n\n    if (typeof fileName === \"function\") {\n      return fileName();\n    }\n\n    return \"cache.json\";\n  }\n\n  /**\n   * Map a parsed cache key (or namespace) to its on-disk directory.\n   *\n   * The key must become exactly one directory component: `%` and the path\n   * separators are percent-encoded so a hostile key (`../../etc`,\n   * `..\\\\..\\\\evil`) turns into an inert directory name instead of a path\n   * traversal, while distinct keys can never collide after encoding. Dots are\n   * left untouched — the `.`-delimited namespace scheme is purely logical and\n   * only ever produces a single filesystem component here.\n   */\n  protected keyDirectory(parsedKey: string): string {\n    // An empty key would resolve to the cache root — `remove(\"{}\")` must never\n    // be able to wipe it.\n    if (parsedKey === \"\") {\n      throw new CacheConfigurationError(\"Cache key must not be empty.\");\n    }\n\n    return this.containedPath(this.encodeKeySegment(parsedKey));\n  }\n\n  /**\n   * Percent-encode a parsed key into an inert, single-component directory\n   * name. Dots are left untouched — see {@link keyDirectory}.\n   */\n  protected encodeKeySegment(parsedKey: string): string {\n    return parsedKey\n      .replace(/%/g, \"%25\")\n      .replace(/\\//g, \"%2F\")\n      .replace(/\\\\/g, \"%5C\");\n  }\n\n  /**\n   * Reverse of {@link encodeKeySegment} — recovers the logical, dot-delimited\n   * parsed key from an on-disk directory name. Used by {@link removeNamespace}\n   * to test which sibling directories logically belong to a namespace, since\n   * dotted keys (`ns.a`) are stored as sibling directories rather than nested\n   * ones (see {@link keyDirectory}'s doc comment).\n   */\n  protected decodeKeySegment(encoded: string): string {\n    return encoded\n      .replace(/%2F/g, \"/\")\n      .replace(/%5C/g, \"\\\\\")\n      .replace(/%25/g, \"%\");\n  }\n\n  /**\n   * Resolve `segment` against the cache root and throw when the result lands\n   * outside it — the last line of defense against path traversal, independent\n   * of how the key was encoded.\n   */\n  protected containedPath(segment: string): string {\n    const base = path.resolve(this.directory);\n    const resolved = path.resolve(base, segment);\n    const relative = path.relative(base, resolved);\n\n    if (\n      relative === \"..\" ||\n      relative.startsWith(`..${path.sep}`) ||\n      path.isAbsolute(relative)\n    ) {\n      throw new CacheError(\n        `Cache key resolves outside the cache directory: \"${segment}\"`,\n      );\n    }\n\n    return resolved;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Dotted keys (`ns.a`) are stored as sibling directories, not nested ones\n   * (see {@link keyDirectory}) — a directory literally named `<namespace>`\n   * rarely exists on its own. Namespace removal therefore has to scan the\n   * cache root's immediate children and remove every directory whose\n   * *logical* (decoded) name equals the namespace or starts with\n   * `<namespace>.`, mirroring the `key = $1 OR key LIKE $2` boundary\n   * semantics the `pg` driver already uses for the same contract.\n   */\n  public async removeNamespace(namespace: string) {\n    const parsedNamespace = this.parseKey(namespace);\n\n    this.log(\"clearing\", namespace);\n\n    try {\n      const root = this.containedPath(\"\");\n\n      if (parsedNamespace === \"\") {\n        await removeDirectoryAsync(root);\n        this.log(\"cleared\", namespace);\n        return this;\n      }\n\n      const prefix = `${parsedNamespace}.`;\n      const entries = await listDirectoriesAsync(root).catch(() => [] as string[]);\n\n      await Promise.all(\n        entries.map(async (entryPath) => {\n          const decoded = this.decodeKeySegment(path.basename(entryPath));\n\n          if (decoded === parsedNamespace || decoded.startsWith(prefix)) {\n            await removeDirectoryAsync(entryPath);\n          }\n        }),\n      );\n\n      this.log(\"cleared\", namespace);\n    } catch (error) {\n      //\n    }\n\n    return this;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * `onConflict: \"create\"` is exclusive (temp file + hard link, so `lock()`\n   * is safe across concurrent writers). `onConflict: \"update\"` is NOT atomic:\n   * the existence probe and the write are separate steps.\n   */\n  public async set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any> {\n    const parsedKey = this.parseKey(key);\n    const { ttl, tags, onConflict, vector, staleAt } = this.resolveSetOptions(ttlOrOptions);\n\n    if (vector) {\n      throw new CacheUnsupportedError(\n        \"'file' driver does not support similarity retrieval — use a memory driver, 'pg' (with pgvector), or 'redis' (with RediSearch).\",\n      );\n    }\n\n    this.log(\"caching\", parsedKey);\n\n    const existing = onConflict === \"upsert\" || onConflict === \"create\" ? null : await this.get(key);\n    const exists = existing !== null;\n\n    if (onConflict === \"update\" && !exists) {\n      const result: CacheSetResult = { wasSet: false, existing: null };\n      return result;\n    }\n\n    const data = this.prepareDataForStorage(value, ttl, staleAt);\n\n    const fileDirectory = this.keyDirectory(parsedKey);\n\n    await ensureDirectoryAsync(fileDirectory);\n\n    const filePath = path.resolve(fileDirectory, this.fileName);\n\n    if (onConflict === \"create\") {\n      const conflict = await this.writeExclusive(filePath, data);\n\n      if (conflict) {\n        const result: CacheSetResult = { wasSet: false, existing: conflict.existing };\n        return result;\n      }\n    } else {\n      await atomicWriteJsonAsync(filePath, data);\n    }\n\n    if (tags && tags.length > 0) {\n      await this.applyTags(key, tags);\n    }\n\n    this.log(\"cached\", parsedKey);\n\n    await this.emit(\"set\", { key: parsedKey, value, ttl });\n\n    if (onConflict === \"create\" || onConflict === \"update\") {\n      const result: CacheSetResult = { wasSet: true, existing: null };\n      return result;\n    }\n\n    return this;\n  }\n\n  /**\n   * Create `filePath` only if it does not exist. Writes a temp file, then\n   * hard-links it to the target (EEXIST = already present). An existing but\n   * expired entry is removed (the file only, never the directory) and the\n   * link retried once.\n   *\n   * Returns `null` when written, or `{ existing }` on conflict.\n   */\n  protected async writeExclusive(\n    filePath: string,\n    data: CacheData,\n  ): Promise<{ existing: any } | null> {\n    const tempPath = `${filePath}.${randomBytes(6).toString(\"hex\")}.tmp`;\n\n    try {\n      await fs.promises.writeFile(tempPath, JSON.stringify(data, null, 2));\n\n      for (let attempt = 0; attempt < 2; attempt++) {\n        try {\n          await fs.promises.link(tempPath, filePath);\n          return null;\n        } catch (error: any) {\n          if (error?.code !== \"EEXIST\") {\n            throw error;\n          }\n        }\n\n        let current: CacheData | undefined;\n\n        try {\n          current = (await getJsonFileAsync(filePath)) as CacheData | undefined;\n        } catch {\n          current = undefined;\n        }\n\n        const expired =\n          current?.expiresAt !== undefined && current.expiresAt !== null && current.expiresAt <= Date.now();\n\n        if (current && !expired) {\n          return { existing: current.data ?? null };\n        }\n\n        if (attempt === 0 && expired) {\n          await fs.promises.rm(filePath, { force: true });\n          continue;\n        }\n\n        // Unreadable (corrupt) file: treat as held, never delete it.\n        return { existing: null };\n      }\n\n      return { existing: null };\n    } finally {\n      await fs.promises.unlink(tempPath).catch(() => undefined);\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * File driver does not yet ship with a file-lock primitive, so concurrent\n   * writers could clobber each other. Rather than ship an unsafe default, we\n   * throw — consumers can fall back to memory/redis for `update` until a\n   * proper file lock lands (tracked in `domains/cache/backlog.md`).\n   */\n  public async update(): Promise<never> {\n    throw new CacheUnsupportedError(\n      \"`update()` is not supported on the file driver. Use the memory or redis driver, or wait for the file-lock primitive (see domains/cache/backlog.md).\",\n    );\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async merge(): Promise<never> {\n    throw new CacheUnsupportedError(\n      \"`merge()` is not supported on the file driver. Use the memory or redis driver.\",\n    );\n  }\n\n  /**\n   * Read the raw {@link CacheData} wrapper from disk, including `staleAt`\n   * metadata. Returns `null` for missing or expired files — `swr()`\n   * consumes this to branch on freshness.\n   */\n  protected async getEntry(key: CacheKey): Promise<CacheData | null> {\n    const parsedKey = this.parseKey(key);\n    const fileDirectory = this.keyDirectory(parsedKey);\n\n    try {\n      const entry = (await getJsonFileAsync(path.resolve(fileDirectory, this.fileName))) as\n        | CacheData\n        | undefined;\n\n      if (!entry) {\n        return null;\n      }\n\n      // `Infinity` (no expiry) is written to JSON as `null`; `null <= now`\n      // is true, so only a real deadline may count as expired.\n      if (typeof entry.expiresAt === \"number\" && entry.expiresAt <= Date.now()) {\n        return null;\n      }\n\n      return entry;\n    } catch {\n      return null;\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async get(key: CacheKey) {\n    const parsedKey = this.parseKey(key);\n\n    this.log(\"fetching\", parsedKey);\n\n    const fileDirectory = this.keyDirectory(parsedKey);\n\n    let value: CacheData | undefined;\n\n    try {\n      value = (await getJsonFileAsync(path.resolve(fileDirectory, this.fileName))) as\n        | CacheData\n        | undefined;\n    } catch {\n      // Missing file (ENOENT) or corrupt JSON: a plain miss. Never remove the\n      // directory here — it may be mid-write by another process.\n      value = undefined;\n    }\n\n    if (value === undefined || value === null || typeof value !== \"object\") {\n      this.log(\"notFound\", parsedKey);\n      await this.emit(\"miss\", { key: parsedKey });\n      return null;\n    }\n\n    // Only a successfully parsed but expired entry is removed (inside\n    // parseCachedData).\n    const result = await this.parseCachedData(parsedKey, value);\n\n    if (result === null) {\n      await this.emit(\"miss\", { key: parsedKey });\n    } else {\n      await this.emit(\"hit\", { key: parsedKey, value: result });\n    }\n\n    return result;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async remove(key: CacheKey) {\n    const parsedKey = this.parseKey(key);\n    this.log(\"removing\", parsedKey);\n\n    const fileDirectory = this.keyDirectory(parsedKey);\n\n    try {\n      await removeDirectoryAsync(fileDirectory);\n\n      this.log(\"removed\", parsedKey);\n      // Emit removed event\n      await this.emit(\"removed\", { key: parsedKey });\n    } catch (error) {\n      //\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async flush() {\n    this.log(\"flushing\");\n\n    if (this.options.globalPrefix) {\n      await this.removeNamespace(\"\");\n    } else {\n      await removeDirectoryAsync(this.directory);\n    }\n\n    this.log(\"flushed\");\n\n    // Emit flushed event\n    await this.emit(\"flushed\");\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async connect() {\n    this.log(\"connecting\");\n    await ensureDirectoryAsync(this.directory);\n    this.log(\"connected\");\n    await this.emit(\"connected\");\n  }\n}\n"],"mappings":";;;;;;;;AAsBA,IAAa,kBAAb,cACU,gBAEV;;;cAIgB;;;;;CAKd,AAAO,WAAW,SAA2B;EAC3C,IAAI,CAAC,QAAQ,WACX,MAAM,IAAI,wBACR,2DACF;EAGF,OAAO,MAAM,WAAW,OAAO;CACjC;;;;CAKA,IAAW,YAAY;EACrB,MAAM,YAAY,KAAK,QAAQ;EAE/B,IAAI,OAAO,cAAc,YACvB,OAAO,UAAU;EAGnB,MAAM,IAAI,wBACR,6EACF;CACF;;;;CAKA,IAAW,WAAW;EACpB,MAAM,WAAW,KAAK,QAAQ;EAE9B,IAAI,OAAO,aAAa,YACtB,OAAO,SAAS;EAGlB,OAAO;CACT;;;;;;;;;;;CAYA,AAAU,aAAa,WAA2B;EAGhD,IAAI,cAAc,IAChB,MAAM,IAAI,wBAAwB,8BAA8B;EAGlE,OAAO,KAAK,cAAc,KAAK,iBAAiB,SAAS,CAAC;CAC5D;;;;;CAMA,AAAU,iBAAiB,WAA2B;EACpD,OAAO,UACJ,QAAQ,MAAM,KAAK,CAAC,CACpB,QAAQ,OAAO,KAAK,CAAC,CACrB,QAAQ,OAAO,KAAK;CACzB;;;;;;;;CASA,AAAU,iBAAiB,SAAyB;EAClD,OAAO,QACJ,QAAQ,QAAQ,GAAG,CAAC,CACpB,QAAQ,QAAQ,IAAI,CAAC,CACrB,QAAQ,QAAQ,GAAG;CACxB;;;;;;CAOA,AAAU,cAAc,SAAyB;EAC/C,MAAM,OAAO,KAAK,QAAQ,KAAK,SAAS;EACxC,MAAM,WAAW,KAAK,QAAQ,MAAM,OAAO;EAC3C,MAAM,WAAW,KAAK,SAAS,MAAM,QAAQ;EAE7C,IACE,aAAa,QACb,SAAS,WAAW,KAAK,KAAK,KAAK,KACnC,KAAK,WAAW,QAAQ,GAExB,MAAM,IAAI,WACR,oDAAoD,QAAQ,EAC9D;EAGF,OAAO;CACT;;;;;;;;;;;;CAaA,MAAa,gBAAgB,WAAmB;EAC9C,MAAM,kBAAkB,KAAK,SAAS,SAAS;EAE/C,KAAK,IAAI,YAAY,SAAS;EAE9B,IAAI;GACF,MAAM,OAAO,KAAK,cAAc,EAAE;GAElC,IAAI,oBAAoB,IAAI;IAC1B,MAAM,qBAAqB,IAAI;IAC/B,KAAK,IAAI,WAAW,SAAS;IAC7B,OAAO;GACT;GAEA,MAAM,SAAS,GAAG,gBAAgB;GAClC,MAAM,UAAU,MAAM,qBAAqB,IAAI,CAAC,CAAC,YAAY,CAAC,CAAa;GAE3E,MAAM,QAAQ,IACZ,QAAQ,IAAI,OAAO,cAAc;IAC/B,MAAM,UAAU,KAAK,iBAAiB,KAAK,SAAS,SAAS,CAAC;IAE9D,IAAI,YAAY,mBAAmB,QAAQ,WAAW,MAAM,GAC1D,MAAM,qBAAqB,SAAS;GAExC,CAAC,CACH;GAEA,KAAK,IAAI,WAAW,SAAS;EAC/B,SAAS,OAAO,CAEhB;EAEA,OAAO;CACT;;;;;;;;CASA,MAAa,IACX,KACA,OACA,cACc;EACd,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,EAAE,KAAK,MAAM,YAAY,QAAQ,YAAY,KAAK,kBAAkB,YAAY;EAEtF,IAAI,QACF,MAAM,IAAI,sBACR,gIACF;EAGF,KAAK,IAAI,WAAW,SAAS;EAG7B,MAAM,UADW,eAAe,YAAY,eAAe,WAAW,OAAO,MAAM,KAAK,IAAI,GAAG,OACnE;EAE5B,IAAI,eAAe,YAAY,CAAC,QAE9B,OAAO;GAD0B,QAAQ;GAAO,UAAU;EAC9C;EAGd,MAAM,OAAO,KAAK,sBAAsB,OAAO,KAAK,OAAO;EAE3D,MAAM,gBAAgB,KAAK,aAAa,SAAS;EAEjD,MAAM,qBAAqB,aAAa;EAExC,MAAM,WAAW,KAAK,QAAQ,eAAe,KAAK,QAAQ;EAE1D,IAAI,eAAe,UAAU;GAC3B,MAAM,WAAW,MAAM,KAAK,eAAe,UAAU,IAAI;GAEzD,IAAI,UAEF,OAAO;IAD0B,QAAQ;IAAO,UAAU,SAAS;GACvD;EAEhB,OACE,MAAM,qBAAqB,UAAU,IAAI;EAG3C,IAAI,QAAQ,KAAK,SAAS,GACxB,MAAM,KAAK,UAAU,KAAK,IAAI;EAGhC,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;;;;;;;;;CAUA,MAAgB,eACd,UACA,MACmC;EACnC,MAAM,WAAW,GAAG,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,KAAK,EAAE;EAE/D,IAAI;GACF,MAAM,GAAG,SAAS,UAAU,UAAU,KAAK,UAAU,MAAM,MAAM,CAAC,CAAC;GAEnE,KAAK,IAAI,UAAU,GAAG,UAAU,GAAG,WAAW;IAC5C,IAAI;KACF,MAAM,GAAG,SAAS,KAAK,UAAU,QAAQ;KACzC,OAAO;IACT,SAAS,OAAY;KACnB,IAAI,OAAO,SAAS,UAClB,MAAM;IAEV;IAEA,IAAI;IAEJ,IAAI;KACF,UAAW,MAAM,iBAAiB,QAAQ;IAC5C,QAAQ;KACN,UAAU;IACZ;IAEA,MAAM,UACJ,SAAS,cAAc,UAAa,QAAQ,cAAc,QAAQ,QAAQ,aAAa,KAAK,IAAI;IAElG,IAAI,WAAW,CAAC,SACd,OAAO,EAAE,UAAU,QAAQ,QAAQ,KAAK;IAG1C,IAAI,YAAY,KAAK,SAAS;KAC5B,MAAM,GAAG,SAAS,GAAG,UAAU,EAAE,OAAO,KAAK,CAAC;KAC9C;IACF;IAGA,OAAO,EAAE,UAAU,KAAK;GAC1B;GAEA,OAAO,EAAE,UAAU,KAAK;EAC1B,UAAU;GACR,MAAM,GAAG,SAAS,OAAO,QAAQ,CAAC,CAAC,YAAY,MAAS;EAC1D;CACF;;;;;;;;;CAUA,MAAa,SAAyB;EACpC,MAAM,IAAI,sBACR,qJACF;CACF;;;;CAKA,MAAa,QAAwB;EACnC,MAAM,IAAI,sBACR,gFACF;CACF;;;;;;CAOA,MAAgB,SAAS,KAA0C;EACjE,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,gBAAgB,KAAK,aAAa,SAAS;EAEjD,IAAI;GACF,MAAM,QAAS,MAAM,iBAAiB,KAAK,QAAQ,eAAe,KAAK,QAAQ,CAAC;GAIhF,IAAI,CAAC,OACH,OAAO;GAKT,IAAI,OAAO,MAAM,cAAc,YAAY,MAAM,aAAa,KAAK,IAAI,GACrE,OAAO;GAGT,OAAO;EACT,QAAQ;GACN,OAAO;EACT;CACF;;;;CAKA,MAAa,IAAI,KAAe;EAC9B,MAAM,YAAY,KAAK,SAAS,GAAG;EAEnC,KAAK,IAAI,YAAY,SAAS;EAE9B,MAAM,gBAAgB,KAAK,aAAa,SAAS;EAEjD,IAAI;EAEJ,IAAI;GACF,QAAS,MAAM,iBAAiB,KAAK,QAAQ,eAAe,KAAK,QAAQ,CAAC;EAG5E,QAAQ;GAGN,QAAQ;EACV;EAEA,IAAI,UAAU,UAAa,UAAU,QAAQ,OAAO,UAAU,UAAU;GACtE,KAAK,IAAI,YAAY,SAAS;GAC9B,MAAM,KAAK,KAAK,QAAQ,EAAE,KAAK,UAAU,CAAC;GAC1C,OAAO;EACT;EAIA,MAAM,SAAS,MAAM,KAAK,gBAAgB,WAAW,KAAK;EAE1D,IAAI,WAAW,MACb,MAAM,KAAK,KAAK,QAAQ,EAAE,KAAK,UAAU,CAAC;OAE1C,MAAM,KAAK,KAAK,OAAO;GAAE,KAAK;GAAW,OAAO;EAAO,CAAC;EAG1D,OAAO;CACT;;;;CAKA,MAAa,OAAO,KAAe;EACjC,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,KAAK,IAAI,YAAY,SAAS;EAE9B,MAAM,gBAAgB,KAAK,aAAa,SAAS;EAEjD,IAAI;GACF,MAAM,qBAAqB,aAAa;GAExC,KAAK,IAAI,WAAW,SAAS;GAE7B,MAAM,KAAK,KAAK,WAAW,EAAE,KAAK,UAAU,CAAC;EAC/C,SAAS,OAAO,CAEhB;CACF;;;;CAKA,MAAa,QAAQ;EACnB,KAAK,IAAI,UAAU;EAEnB,IAAI,KAAK,QAAQ,cACf,MAAM,KAAK,gBAAgB,EAAE;OAE7B,MAAM,qBAAqB,KAAK,SAAS;EAG3C,KAAK,IAAI,SAAS;EAGlB,MAAM,KAAK,KAAK,SAAS;CAC3B;;;;CAKA,MAAa,UAAU;EACrB,KAAK,IAAI,YAAY;EACrB,MAAM,qBAAqB,KAAK,SAAS;EACzC,KAAK,IAAI,WAAW;EACpB,MAAM,KAAK,KAAK,WAAW;CAC7B;AACF"}

package/esm/drivers/in-memory-tag-index.d.mts

@@ -1,4 +1,4 @@
-//#region ../cache/src/drivers/in-memory-tag-index.d.ts
+//#region ../../packages/cache/src/drivers/in-memory-tag-index.d.ts
 /**
  * Tag index for the in-process drivers (memory, memoryExtended, lru, mock).
  *

package/esm/drivers/in-memory-tag-index.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"in-memory-tag-index.d.mts","names":[],"sources":["../../../../../../../cache/src/drivers/in-memory-tag-index.ts"],"mappings":";;AAWA;;;;;;;;;;cAAa,gBAAA;EAAA,mBACQ,IAAA,EAAM,GAAG,SAAS,GAAA;EAgC9B;;;EA3BA,GAAA,CAAI,MAAA,UAAgB,OAAA;EA8Cb;;;EA1BP,OAAA,CAAQ,MAAA;EAsDH;AAAA;;EA/CL,MAAA,CAAO,MAAA,UAAgB,OAAA;;;;EAmBvB,MAAA,CAAO,MAAA;;;;;;EASP,eAAA,CAAgB,SAAA;;;;EAmBhB,KAAA;AAAA"}
+{"version":3,"file":"in-memory-tag-index.d.mts","names":[],"sources":["../../../../../../../../packages/cache/src/drivers/in-memory-tag-index.ts"],"mappings":";;AAWA;;;;;;;;;;cAAa,gBAAA;EAAA,mBACQ,IAAA,EAAM,GAAG,SAAS,GAAA;EAgC9B;;;EA3BA,GAAA,CAAI,MAAA,UAAgB,OAAA;EA8Cb;;;EA1BP,OAAA,CAAQ,MAAA;EAsDH;AAAA;;EA/CL,MAAA,CAAO,MAAA,UAAgB,OAAA;;;;EAmBvB,MAAA,CAAO,MAAA;;;;;;EASP,eAAA,CAAgB,SAAA;;;;EAmBhB,KAAA;AAAA"}

package/esm/drivers/in-memory-tag-index.mjs

@@ -1,4 +1,4 @@
-//#region ../cache/src/drivers/in-memory-tag-index.ts
+//#region ../../packages/cache/src/drivers/in-memory-tag-index.ts
 /**
 * Tag index for the in-process drivers (memory, memoryExtended, lru, mock).
 *

package/esm/drivers/in-memory-tag-index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"in-memory-tag-index.mjs","names":[],"sources":["../../../../../../../cache/src/drivers/in-memory-tag-index.ts"],"sourcesContent":["/**\n * Tag index for the in-process drivers (memory, memoryExtended, lru, mock).\n *\n * Lives beside the driver's entry storage, never inside it: index sets are not\n * entries, so they are never subject to `maxSize` / LRU eviction or TTL\n * sweeps, and every operation is synchronous — concurrent tagged writes in one\n * process can never drop a member.\n *\n * Keys are the driver-parsed tag keys (`<prefix>.cache.tags.<tag>`); members\n * are the caller's normalized, un-prefixed cache keys.\n */\nexport class InMemoryTagIndex {\n  protected readonly sets: Map<string, Set<string>> = new Map();\n\n  /**\n   * Add members to a tag set, creating it on first use.\n   */\n  public add(tagKey: string, members: readonly string[]): void {\n    if (members.length === 0) {\n      return;\n    }\n\n    let set = this.sets.get(tagKey);\n\n    if (!set) {\n      set = new Set();\n      this.sets.set(tagKey, set);\n    }\n\n    for (const member of members) {\n      set.add(member);\n    }\n  }\n\n  /**\n   * The members of a tag set (a copy; empty when the set does not exist).\n   */\n  public members(tagKey: string): string[] {\n    return [...(this.sets.get(tagKey) ?? [])];\n  }\n\n  /**\n   * Remove members from a tag set; an emptied set is dropped.\n   */\n  public remove(tagKey: string, members: readonly string[]): void {\n    const set = this.sets.get(tagKey);\n\n    if (!set) {\n      return;\n    }\n\n    for (const member of members) {\n      set.delete(member);\n    }\n\n    if (set.size === 0) {\n      this.sets.delete(tagKey);\n    }\n  }\n\n  /**\n   * Drop a whole tag set.\n   */\n  public delete(tagKey: string): void {\n    this.sets.delete(tagKey);\n  }\n\n  /**\n   * Drop every tag set whose key equals `namespace` or sits under\n   * `namespace.` — the same rule the drivers use for entries. An empty\n   * namespace clears everything.\n   */\n  public removeNamespace(namespace: string): void {\n    if (namespace === \"\") {\n      this.sets.clear();\n\n      return;\n    }\n\n    const prefix = namespace + \".\";\n\n    for (const key of [...this.sets.keys()]) {\n      if (key === namespace || key.startsWith(prefix)) {\n        this.sets.delete(key);\n      }\n    }\n  }\n\n  /**\n   * Drop every tag set.\n   */\n  public clear(): void {\n    this.sets.clear();\n  }\n}\n"],"mappings":";;;;;;;;;;;;AAWA,IAAa,mBAAb,MAA8B;;8BACwB,IAAI,IAAI;;;;;CAK5D,AAAO,IAAI,QAAgB,SAAkC;EAC3D,IAAI,QAAQ,WAAW,GACrB;EAGF,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM;EAE9B,IAAI,CAAC,KAAK;GACR,sBAAM,IAAI,IAAI;GACd,KAAK,KAAK,IAAI,QAAQ,GAAG;EAC3B;EAEA,KAAK,MAAM,UAAU,SACnB,IAAI,IAAI,MAAM;CAElB;;;;CAKA,AAAO,QAAQ,QAA0B;EACvC,OAAO,CAAC,GAAI,KAAK,KAAK,IAAI,MAAM,KAAK,CAAC,CAAE;CAC1C;;;;CAKA,AAAO,OAAO,QAAgB,SAAkC;EAC9D,MAAM,MAAM,KAAK,KAAK,IAAI,MAAM;EAEhC,IAAI,CAAC,KACH;EAGF,KAAK,MAAM,UAAU,SACnB,IAAI,OAAO,MAAM;EAGnB,IAAI,IAAI,SAAS,GACf,KAAK,KAAK,OAAO,MAAM;CAE3B;;;;CAKA,AAAO,OAAO,QAAsB;EAClC,KAAK,KAAK,OAAO,MAAM;CACzB;;;;;;CAOA,AAAO,gBAAgB,WAAyB;EAC9C,IAAI,cAAc,IAAI;GACpB,KAAK,KAAK,MAAM;GAEhB;EACF;EAEA,MAAM,SAAS,YAAY;EAE3B,KAAK,MAAM,OAAO,CAAC,GAAG,KAAK,KAAK,KAAK,CAAC,GACpC,IAAI,QAAQ,aAAa,IAAI,WAAW,MAAM,GAC5C,KAAK,KAAK,OAAO,GAAG;CAG1B;;;;CAKA,AAAO,QAAc;EACnB,KAAK,KAAK,MAAM;CAClB;AACF"}
+{"version":3,"file":"in-memory-tag-index.mjs","names":[],"sources":["../../../../../../../../packages/cache/src/drivers/in-memory-tag-index.ts"],"sourcesContent":["/**\n * Tag index for the in-process drivers (memory, memoryExtended, lru, mock).\n *\n * Lives beside the driver's entry storage, never inside it: index sets are not\n * entries, so they are never subject to `maxSize` / LRU eviction or TTL\n * sweeps, and every operation is synchronous — concurrent tagged writes in one\n * process can never drop a member.\n *\n * Keys are the driver-parsed tag keys (`<prefix>.cache.tags.<tag>`); members\n * are the caller's normalized, un-prefixed cache keys.\n */\nexport class InMemoryTagIndex {\n  protected readonly sets: Map<string, Set<string>> = new Map();\n\n  /**\n   * Add members to a tag set, creating it on first use.\n   */\n  public add(tagKey: string, members: readonly string[]): void {\n    if (members.length === 0) {\n      return;\n    }\n\n    let set = this.sets.get(tagKey);\n\n    if (!set) {\n      set = new Set();\n      this.sets.set(tagKey, set);\n    }\n\n    for (const member of members) {\n      set.add(member);\n    }\n  }\n\n  /**\n   * The members of a tag set (a copy; empty when the set does not exist).\n   */\n  public members(tagKey: string): string[] {\n    return [...(this.sets.get(tagKey) ?? [])];\n  }\n\n  /**\n   * Remove members from a tag set; an emptied set is dropped.\n   */\n  public remove(tagKey: string, members: readonly string[]): void {\n    const set = this.sets.get(tagKey);\n\n    if (!set) {\n      return;\n    }\n\n    for (const member of members) {\n      set.delete(member);\n    }\n\n    if (set.size === 0) {\n      this.sets.delete(tagKey);\n    }\n  }\n\n  /**\n   * Drop a whole tag set.\n   */\n  public delete(tagKey: string): void {\n    this.sets.delete(tagKey);\n  }\n\n  /**\n   * Drop every tag set whose key equals `namespace` or sits under\n   * `namespace.` — the same rule the drivers use for entries. An empty\n   * namespace clears everything.\n   */\n  public removeNamespace(namespace: string): void {\n    if (namespace === \"\") {\n      this.sets.clear();\n\n      return;\n    }\n\n    const prefix = namespace + \".\";\n\n    for (const key of [...this.sets.keys()]) {\n      if (key === namespace || key.startsWith(prefix)) {\n        this.sets.delete(key);\n      }\n    }\n  }\n\n  /**\n   * Drop every tag set.\n   */\n  public clear(): void {\n    this.sets.clear();\n  }\n}\n"],"mappings":";;;;;;;;;;;;AAWA,IAAa,mBAAb,MAA8B;;8BACwB,IAAI,IAAI;;;;;CAK5D,AAAO,IAAI,QAAgB,SAAkC;EAC3D,IAAI,QAAQ,WAAW,GACrB;EAGF,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM;EAE9B,IAAI,CAAC,KAAK;GACR,sBAAM,IAAI,IAAI;GACd,KAAK,KAAK,IAAI,QAAQ,GAAG;EAC3B;EAEA,KAAK,MAAM,UAAU,SACnB,IAAI,IAAI,MAAM;CAElB;;;;CAKA,AAAO,QAAQ,QAA0B;EACvC,OAAO,CAAC,GAAI,KAAK,KAAK,IAAI,MAAM,KAAK,CAAC,CAAE;CAC1C;;;;CAKA,AAAO,OAAO,QAAgB,SAAkC;EAC9D,MAAM,MAAM,KAAK,KAAK,IAAI,MAAM;EAEhC,IAAI,CAAC,KACH;EAGF,KAAK,MAAM,UAAU,SACnB,IAAI,OAAO,MAAM;EAGnB,IAAI,IAAI,SAAS,GACf,KAAK,KAAK,OAAO,MAAM;CAE3B;;;;CAKA,AAAO,OAAO,QAAsB;EAClC,KAAK,KAAK,OAAO,MAAM;CACzB;;;;;;CAOA,AAAO,gBAAgB,WAAyB;EAC9C,IAAI,cAAc,IAAI;GACpB,KAAK,KAAK,MAAM;GAEhB;EACF;EAEA,MAAM,SAAS,YAAY;EAE3B,KAAK,MAAM,OAAO,CAAC,GAAG,KAAK,KAAK,KAAK,CAAC,GACpC,IAAI,QAAQ,aAAa,IAAI,WAAW,MAAM,GAC5C,KAAK,KAAK,OAAO,GAAG;CAG1B;;;;CAKA,AAAO,QAAc;EACnB,KAAK,KAAK,MAAM;CAClB;AACF"}

package/esm/drivers/index.d.mts

@@ -6,4 +6,4 @@ import { MemoryExtendedCacheDriver } from "./memory-extended-cache-driver.mjs";
 import { MockCacheDriver } from "./mock-cache-driver.mjs";
 import { NullCacheDriver } from "./null-cache-driver.mjs";
 import { PgCacheDriver } from "./pg-cache-driver.mjs";
-import { REDIS_CAS_SET_SCRIPT, REDIS_COMPARE_DELETE_SCRIPT, REDIS_GET_DEL_SCRIPT, RedisCacheDriver } from "./redis-cache-driver.mjs";
+import { REDIS_CAS_SET_SCRIPT, REDIS_COMPARE_DELETE_SCRIPT, REDIS_GET_DEL_SCRIPT, REDIS_INCREMENT_SCRIPT, RedisCacheDriver } from "./redis-cache-driver.mjs";

package/esm/drivers/index.mjs

@@ -6,6 +6,6 @@ import { MemoryExtendedCacheDriver } from "./memory-extended-cache-driver.mjs";
 import { MockCacheDriver } from "./mock-cache-driver.mjs";
 import { NullCacheDriver } from "./null-cache-driver.mjs";
 import { PgCacheDriver } from "./pg-cache-driver.mjs";
-import { REDIS_CAS_SET_SCRIPT, REDIS_COMPARE_DELETE_SCRIPT, REDIS_GET_DEL_SCRIPT, RedisCacheDriver } from "./redis-cache-driver.mjs";
+import { REDIS_CAS_SET_SCRIPT, REDIS_COMPARE_DELETE_SCRIPT, REDIS_GET_DEL_SCRIPT, REDIS_INCREMENT_SCRIPT, RedisCacheDriver } from "./redis-cache-driver.mjs";
 
 export {  };

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

@@ -2,7 +2,7 @@ import { BaseCacheDriver } from "./base-cache-driver.mjs";
 import { InMemoryTagIndex } from "./in-memory-tag-index.mjs";
 import { CacheData, CacheDriver, CacheKey, CacheSetOptions, CacheSimilarHit, CacheSimilarOptions, CacheTtl, LRUMemoryCacheOptions } from "../types.mjs";
 
-//#region ../cache/src/drivers/lru-memory-cache-driver.d.ts
+//#region ../../packages/cache/src/drivers/lru-memory-cache-driver.d.ts
 declare class CacheNode {
   key: string;
   value: any;

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

@@ -1 +1 @@
-{"version":3,"file":"lru-memory-cache-driver.d.mts","names":[],"sources":["../../../../../../../cache/src/drivers/lru-memory-cache-driver.ts"],"mappings":";;;;;cAeM,SAAA;EAeK,GAAA;EACA,KAAA;EAfF,IAAA,EAAM,SAAA;EACN,IAAA,EAAM,SAAS;EACf,SAAA;EAYE;;;;EAPF,OAAA;EANM;;;;EAWN,MAAA;cAEE,GAAA,UACA,KAAA,OACP,GAAA;EAAA,IAOS,SAAA;AAAA;;;AAAS;AAWtB;;;cAAa,oBAAA,SACH,eAAA,CAAgB,oBAAA,EAAsB,qBAAA,aACnC,WAAA,CAAY,oBAAA,EAAsB,qBAAA;EADC;;;EAMvC,IAAA;EAKU;;;EAAA,UAAP,KAAA,EAAO,GAAA,SAAY,SAAA;EAoBD;;;EAAA,UAflB,QAAA,EAAU,gBAAA;EAyHQ;;;EAAA,UApHlB,IAAA,EAAM,SAAA;EAmNQ;;;EAAA,UA9Md,IAAA,EAAM,SAAA;EAyPuB;;;EAAA,UApP7B,eAAA,GAAkB,MAAA,CAAO,OAAA;EAgTD;;;;EAqFD;;;EAtX1B,IAAA;EAoZoC;;;EA5YpC,YAAA;EA0ZmC;;;;;;;;EAlX7B,eAAA,CAAgB,SAAA,WAAiB,OAAA;EA7FxB;;;EAqIT,GAAA,CACX,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EA1I2C;;;EAAA,UAwNpC,QAAA,CAAS,IAAA,EAAM,SAAA;EAlNlB;;;EAAA,UA0NG,UAAA,CAAW,IAAA,EAAM,SAAA;EAhNjB;;;EAAA,UAwNA,OAAA,CAAQ,IAAA,EAAM,SAAA;EA9Md;;;EAAA,UAwNA,UAAA;EAnNyB;;;;;;EAAA,UAiOnB,QAAA,CAAS,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,SAAA;EA1HpC;;;;EAAA,UA6IH,QAAA,CAAS,SAAA,WAAoB,SAAA;EA1IX;;;;;;;EAkKf,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAoB,OAAA;EA3ErC;;;;;;EA+GR,IAAA,CAAK,GAAA,EAAK,QAAA,GAAW,OAAA;EA/ET;;;EA0GZ,GAAA,CAAI,GAAA,EAAK,QAAA,GAAQ,OAAA;EAvFX;;;EAiJN,MAAA,CAAO,GAAA,EAAK,QAAA,GAAQ,OAAA;EAzHV;;;;;EAgJV,MAAA,CAAO,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EA5GxB;;;EAmHrB,UAAA,CAAW,MAAA,EAAQ,QAAA,GAAW,OAAA;EAxFb;;;EA+FjB,SAAA,CAAU,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EArC5B;;;EA4CpB,SAAA,CAAU,MAAA,EAAQ,QAAA,GAAW,OAAA;EArBJ;;;;;;;EAgCzB,KAAA,IAAK,OAAA;EAlBK;;;;;;;;;EA2CV,OAAA,UACX,MAAA,YACA,OAAA,EAAS,mBAAA,GACR,OAAA,CAAQ,eAAA,CAAgB,CAAA;EAHN;;;EAAA,IA2CV,QAAA;EAxCR;;;EA+CU,UAAA,IAAU,OAAA;AAAA"}
+{"version":3,"file":"lru-memory-cache-driver.d.mts","names":[],"sources":["../../../../../../../../packages/cache/src/drivers/lru-memory-cache-driver.ts"],"mappings":";;;;;cAgBM,SAAA;EAeK,GAAA;EACA,KAAA;EAfF,IAAA,EAAM,SAAA;EACN,IAAA,EAAM,SAAS;EACf,SAAA;EAYE;;;;EAPF,OAAA;EANM;;;;EAWN,MAAA;cAEE,GAAA,UACA,KAAA,OACP,GAAA;EAAA,IAOS,SAAA;AAAA;;;AAAS;AAWtB;;;cAAa,oBAAA,SACH,eAAA,CAAgB,oBAAA,EAAsB,qBAAA,aACnC,WAAA,CAAY,oBAAA,EAAsB,qBAAA;EADC;;;EAMvC,IAAA;EAKU;;;EAAA,UAAP,KAAA,EAAO,GAAA,SAAY,SAAA;EAoBD;;;EAAA,UAflB,QAAA,EAAU,gBAAA;EAyHQ;;;EAAA,UApHlB,IAAA,EAAM,SAAA;EAmNQ;;;EAAA,UA9Md,IAAA,EAAM,SAAA;EAyPuB;;;EAAA,UApP7B,eAAA,GAAkB,MAAA,CAAO,OAAA;EAgTD;;;;EAqFD;;;EAtX1B,IAAA;EAoZoC;;;EA5YpC,YAAA;EA0ZmC;;;;;;;;EAlX7B,eAAA,CAAgB,SAAA,WAAiB,OAAA;EA7FxB;;;EAqIT,GAAA,CACX,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EA1I2C;;;EAAA,UAwNpC,QAAA,CAAS,IAAA,EAAM,SAAA;EAlNlB;;;EAAA,UA0NG,UAAA,CAAW,IAAA,EAAM,SAAA;EAhNjB;;;EAAA,UAwNA,OAAA,CAAQ,IAAA,EAAM,SAAA;EA9Md;;;EAAA,UAwNA,UAAA;EAnNyB;;;;;;EAAA,UAiOnB,QAAA,CAAS,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,SAAA;EA1HpC;;;;EAAA,UA6IH,QAAA,CAAS,SAAA,WAAoB,SAAA;EA1IX;;;;;;;EAkKf,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAoB,OAAA;EA3ErC;;;;;;EA+GR,IAAA,CAAK,GAAA,EAAK,QAAA,GAAW,OAAA;EA/ET;;;EA0GZ,GAAA,CAAI,GAAA,EAAK,QAAA,GAAQ,OAAA;EAvFX;;;EAiJN,MAAA,CAAO,GAAA,EAAK,QAAA,GAAQ,OAAA;EAzHV;;;;;EAgJV,MAAA,CAAO,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EA5GxB;;;EAmHrB,UAAA,CAAW,MAAA,EAAQ,QAAA,GAAW,OAAA;EAxFb;;;EA+FjB,SAAA,CAAU,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EArC5B;;;EA4CpB,SAAA,CAAU,MAAA,EAAQ,QAAA,GAAW,OAAA;EArBJ;;;;;;;EAgCzB,KAAA,IAAK,OAAA;EAlBK;;;;;;;;;EA2CV,OAAA,UACX,MAAA,YACA,OAAA,EAAS,mBAAA,GACR,OAAA,CAAQ,eAAA,CAAgB,CAAA;EAHN;;;EAAA,IA2CV,QAAA;EAxCR;;;EA+CU,UAAA,IAAU,OAAA;AAAA"}

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

@@ -1,8 +1,9 @@
 import { cosineSimilarity } from "../utils.mjs";
 import { BaseCacheDriver } from "./base-cache-driver.mjs";
 import { InMemoryTagIndex } from "./in-memory-tag-index.mjs";
+import { maskEmailsInText } from "@warlock.js/logger";
 
-//#region ../cache/src/drivers/lru-memory-cache-driver.ts
+//#region ../../packages/cache/src/drivers/lru-memory-cache-driver.ts
 var CacheNode = class {
 	constructor(key, value, ttl) {
 		this.key = key;
@@ -214,7 +215,7 @@ var LRUMemoryCacheDriver = class extends BaseCacheDriver {
 		const parsedKey = this.parseKey(key);
 		const node = this.liveNode(parsedKey);
 		const current = node ? node.value : 0;
-		if (typeof current !== "number") throw new Error(`Cannot increment non-numeric value for key: ${parsedKey}`);
+		if (typeof current !== "number") throw new Error(`Cannot increment non-numeric value for key: ${maskEmailsInText(parsedKey)}`);
 		const newValue = current + value;
 		if (node) {
 			node.value = newValue;

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

@@ -1 +1 @@
-{"version":3,"file":"lru-memory-cache-driver.mjs","names":[],"sources":["../../../../../../../cache/src/drivers/lru-memory-cache-driver.ts"],"sourcesContent":["import type {\n  CacheData,\n  CacheDriver,\n  CacheKey,\n  CacheSetOptions,\n  CacheSetResult,\n  CacheSimilarHit,\n  CacheSimilarOptions,\n  CacheTtl,\n  LRUMemoryCacheOptions,\n} from \"../types\";\nimport { cosineSimilarity } from \"../utils\";\nimport { BaseCacheDriver } from \"./base-cache-driver\";\nimport { InMemoryTagIndex } from \"./in-memory-tag-index\";\n\nclass CacheNode {\n  public next: CacheNode | null = null;\n  public prev: CacheNode | null = null;\n  public expiresAt?: number;\n  /**\n   * Freshness deadline (ms timestamp) — populated by `swr()`. Within\n   * `expiresAt > now > staleAt` the entry is \"stale-but-revalidatable.\"\n   */\n  public staleAt?: number;\n  /**\n   * Optional embedding vector — populated when the entry was written with\n   * `set({ vector })`. Scanned by `similar()`.\n   */\n  public vector?: number[];\n  public constructor(\n    public key: string,\n    public value: any,\n    ttl?: number,\n  ) {\n    if (ttl && ttl !== Infinity) {\n      this.expiresAt = Date.now() + ttl * 1000;\n    }\n  }\n\n  public get isExpired(): boolean {\n    return this.expiresAt !== undefined && this.expiresAt < Date.now();\n  }\n}\n\n/**\n * LRU Memory Cache Driver\n * The concept of LRU is to remove the least recently used data\n * whenever the cache is full\n * The question that resides here is how to tell the cache is full?\n */\nexport class LRUMemoryCacheDriver\n  extends BaseCacheDriver<LRUMemoryCacheDriver, LRUMemoryCacheOptions>\n  implements CacheDriver<LRUMemoryCacheDriver, LRUMemoryCacheOptions>\n{\n  /**\n   * {@inheritdoc}\n   */\n  public name = \"lru\";\n\n  /**\n   * Cache map\n   */\n  protected cache: Map<string, CacheNode> = new Map();\n\n  /**\n   * Tag index, kept out of the LRU list so capacity pressure can never evict it.\n   */\n  protected tagIndex: InMemoryTagIndex = new InMemoryTagIndex();\n\n  /**\n   * Head of the cache\n   */\n  protected head: CacheNode = new CacheNode(\"\", null);\n\n  /**\n   * Tail of the cache\n   */\n  protected tail: CacheNode = new CacheNode(\"\", null);\n\n  /**\n   * Cleanup interval reference\n   */\n  protected cleanupInterval?: NodeJS.Timeout;\n\n  /**\n   * {@inheritdoc}\n   */\n  public constructor() {\n    super();\n\n    this.init();\n    this.startCleanup();\n  }\n\n  /**\n   * Initialize the cache\n   */\n  public init() {\n    this.head.next = this.tail;\n    this.tail.prev = this.head;\n  }\n\n  /**\n   * Start the cleanup process for expired items\n   */\n  public startCleanup() {\n    // Clear existing interval if any\n    if (this.cleanupInterval) {\n      clearInterval(this.cleanupInterval);\n    }\n\n    this.cleanupInterval = setInterval(async () => {\n      const now = Date.now();\n      const expiredKeys: string[] = [];\n\n      for (const [key, node] of this.cache) {\n        if (node.expiresAt && node.expiresAt <= now) {\n          expiredKeys.push(key);\n        }\n      }\n\n      for (const key of expiredKeys) {\n        const node = this.cache.get(key);\n        if (node) {\n          this.removeNode(node);\n          this.cache.delete(key);\n          this.log(\"expired\", key);\n          // Emit expired event\n          await this.emit(\"expired\", { key });\n        }\n      }\n    }, 1000);\n\n    // do not block the process from exiting\n    this.cleanupInterval.unref();\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Clears every entry whose key starts with the parsed namespace (followed\n   * by a dot) or equals it exactly. Called with an empty namespace while a\n   * `globalPrefix` is configured, clears everything under the prefix — which\n   * is how `flush()` scopes cleanup per tenant.\n   */\n  public async removeNamespace(namespace: string) {\n    const parsedNamespace = this.parseKey(namespace);\n\n    this.log(\"clearing\", parsedNamespace || \"(all)\");\n\n    const removed: string[] = [];\n\n    this.tagIndex.removeNamespace(parsedNamespace);\n\n    if (parsedNamespace === \"\") {\n      for (const key of this.cache.keys()) {\n        removed.push(key);\n      }\n    } else {\n      const prefix = parsedNamespace + \".\";\n\n      for (const key of this.cache.keys()) {\n        if (key === parsedNamespace || key.startsWith(prefix)) {\n          removed.push(key);\n        }\n      }\n    }\n\n    for (const key of removed) {\n      const node = this.cache.get(key);\n      if (node) {\n        this.removeNode(node);\n        this.cache.delete(key);\n      }\n      await this.emit(\"removed\", { key });\n    }\n\n    this.log(\"cleared\", parsedNamespace || \"(all)\");\n\n    return removed;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any> {\n    const parsedKey = this.parseKey(key);\n    const { ttl, tags, onConflict, vector, staleAt } = this.resolveSetOptions(ttlOrOptions);\n\n    this.log(\"caching\", parsedKey);\n\n    // For conditional writes, check existence via get() so expired entries\n    // are treated as missing (get() handles expiry cleanup). The raw `cache.get`\n    // node lookup would let stale entries block onConflict: \"create\".\n    let existingNode = this.cache.get(parsedKey);\n    if (existingNode && existingNode.isExpired) {\n      this.removeNode(existingNode);\n      this.cache.delete(parsedKey);\n      existingNode = undefined;\n    }\n\n    const exists = Boolean(existingNode);\n\n    if (onConflict === \"create\" && exists) {\n      const result: CacheSetResult = {\n        wasSet: false,\n        existing: existingNode!.value,\n      };\n      return result;\n    }\n\n    if (onConflict === \"update\" && !exists) {\n      const result: CacheSetResult = { wasSet: false, existing: null };\n      return result;\n    }\n\n    if (existingNode) {\n      existingNode.value = value;\n      if (ttl && ttl !== Infinity) {\n        existingNode.expiresAt = Date.now() + ttl * 1000;\n      } else {\n        existingNode.expiresAt = undefined;\n      }\n      existingNode.staleAt = staleAt;\n      if (vector) {\n        existingNode.vector = vector.slice();\n      }\n\n      this.moveHead(existingNode);\n    } else {\n      const newNode = new CacheNode(parsedKey, value, ttl);\n      newNode.staleAt = staleAt;\n      if (vector) {\n        newNode.vector = vector.slice();\n      }\n\n      this.cache.set(parsedKey, newNode);\n\n      this.addNode(newNode);\n      if (this.cache.size > this.capacity) {\n        this.removeTail();\n      }\n    }\n\n    if (tags && tags.length > 0) {\n      await this.applyTags(key, tags);\n    }\n\n    this.log(\"cached\", parsedKey);\n\n    await this.emit(\"set\", { key: parsedKey, value, ttl });\n\n    if (onConflict === \"create\" || onConflict === \"update\") {\n      const result: CacheSetResult = { wasSet: true, existing: null };\n      return result;\n    }\n\n    return this;\n  }\n\n  /**\n   * Move the node to the head\n   */\n  protected moveHead(node: CacheNode) {\n    this.removeNode(node);\n    this.addNode(node);\n  }\n\n  /**\n   * Remove the node from the cache\n   */\n  protected removeNode(node: CacheNode) {\n    node.prev!.next = node.next;\n    node.next!.prev = node.prev;\n  }\n\n  /**\n   * Add the node to the head\n   */\n  protected addNode(node: CacheNode) {\n    node.next = this.head.next;\n    node.prev = this.head;\n    this.head.next!.prev = node;\n    this.head.next = node;\n  }\n\n  /**\n   * Remove the tail node\n   */\n  protected removeTail() {\n    const node = this.tail.prev!;\n\n    this.removeNode(node);\n\n    this.cache.delete(node.key);\n  }\n\n  /**\n   * Read the raw {@link CacheData} wrapper, including `staleAt` metadata.\n   * Returns `null` for missing or expired nodes — `swr()` consumes this\n   * to branch on freshness without going through `get()`'s clone-and-emit\n   * path.\n   */\n  protected async getEntry(key: CacheKey): Promise<CacheData | null> {\n    const parsedKey = this.parseKey(key);\n    const node = this.cache.get(parsedKey);\n\n    if (!node || node.isExpired) {\n      return null;\n    }\n\n    return {\n      data: node.value,\n      expiresAt: node.expiresAt,\n      staleAt: node.staleAt,\n    };\n  }\n\n  /**\n   * Live node for `parsedKey`, or `undefined` when missing / expired (an\n   * expired node is unlinked). Synchronous.\n   */\n  protected liveNode(parsedKey: string): CacheNode | undefined {\n    const node = this.cache.get(parsedKey);\n\n    if (!node) {\n      return undefined;\n    }\n\n    if (node.isExpired) {\n      this.removeNode(node);\n      this.cache.delete(parsedKey);\n\n      return undefined;\n    }\n\n    return node;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Read, add and write run synchronously (no `await` in between), so\n   * concurrent increments in this process never lose an update. An existing\n   * node keeps its expiry; a missing key starts from 0 with the default TTL.\n   */\n  public async increment(key: CacheKey, value: number = 1): Promise<number> {\n    const parsedKey = this.parseKey(key);\n    const node = this.liveNode(parsedKey);\n    const current = node ? node.value : 0;\n\n    if (typeof current !== \"number\") {\n      throw new Error(`Cannot increment non-numeric value for key: ${parsedKey}`);\n    }\n\n    const newValue = current + value;\n\n    if (node) {\n      node.value = newValue;\n      this.moveHead(node);\n    } else {\n      const newNode = new CacheNode(parsedKey, newValue, this.ttl);\n\n      this.cache.set(parsedKey, newNode);\n      this.addNode(newNode);\n\n      if (this.cache.size > this.capacity) {\n        this.removeTail();\n      }\n    }\n\n    await this.emit(\"set\", { key: parsedKey, value: newValue, ttl: this.ttl });\n\n    return newValue;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Read and unlink run synchronously, so a value is handed out exactly once\n   * even when concurrent callers pull the same key.\n   */\n  public async pull(key: CacheKey): Promise<any | null> {\n    const parsedKey = this.parseKey(key);\n    const node = this.liveNode(parsedKey);\n\n    if (!node) {\n      await this.emit(\"miss\", { key: parsedKey });\n\n      return null;\n    }\n\n    this.removeNode(node);\n    this.cache.delete(parsedKey);\n\n    const value =\n      node.value !== null && typeof node.value === \"object\"\n        ? structuredClone(node.value)\n        : node.value;\n\n    await this.emit(\"hit\", { key: parsedKey, value });\n    await this.emit(\"removed\", { key: parsedKey });\n\n    return value;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async get(key: CacheKey) {\n    const parsedKey = this.parseKey(key);\n\n    this.log(\"fetching\", parsedKey);\n\n    const node = this.cache.get(parsedKey);\n\n    if (!node) {\n      this.log(\"notFound\", parsedKey);\n      // Emit miss event\n      await this.emit(\"miss\", { key: parsedKey });\n      return null;\n    }\n\n    // Check if expired\n    if (node.isExpired) {\n      this.removeNode(node);\n      this.cache.delete(parsedKey);\n      this.log(\"expired\", parsedKey);\n      // Emit expired event\n      await this.emit(\"expired\", { key: parsedKey });\n      // Also emit miss since we're returning null\n      await this.emit(\"miss\", { key: parsedKey });\n      return null;\n    }\n\n    this.moveHead(node);\n\n    this.log(\"fetched\", parsedKey);\n\n    const value = node.value;\n\n    // Apply cloning for immutability protection\n    if (value === null || value === undefined) {\n      return value;\n    }\n\n    const type = typeof value;\n    if (type === \"string\" || type === \"number\" || type === \"boolean\") {\n      // Emit hit event\n      await this.emit(\"hit\", { key: parsedKey, value });\n      return value;\n    }\n\n    try {\n      const clonedValue = structuredClone(value);\n      // Emit hit event\n      await this.emit(\"hit\", { key: parsedKey, value: clonedValue });\n      return clonedValue;\n    } catch (error) {\n      this.logError(`Failed to clone cached value for ${parsedKey}`, error);\n      throw error;\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async remove(key: CacheKey) {\n    const parsedKey = this.parseKey(key);\n\n    this.log(\"removing\", parsedKey);\n\n    const node = this.cache.get(parsedKey);\n\n    if (node) {\n      this.removeNode(node);\n      this.cache.delete(parsedKey);\n    }\n\n    this.log(\"removed\", parsedKey);\n\n    // Emit removed event\n    await this.emit(\"removed\", { key: parsedKey });\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Synchronous in-process set, never evicted or expired with the entries.\n   */\n  public async tagAdd(tagKey: CacheKey, members: string[]): Promise<void> {\n    this.tagIndex.add(this.parseKey(tagKey), members);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async tagMembers(tagKey: CacheKey): Promise<string[]> {\n    return this.tagIndex.members(this.parseKey(tagKey));\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async tagRemove(tagKey: CacheKey, members: string[]): Promise<void> {\n    this.tagIndex.remove(this.parseKey(tagKey), members);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async tagDelete(tagKey: CacheKey): Promise<void> {\n    this.tagIndex.delete(this.parseKey(tagKey));\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * When a `globalPrefix` is configured, `flush` scopes itself to that prefix\n   * so multi-tenant caches don't accidentally wipe sibling tenants. Without\n   * a prefix, clears everything.\n   */\n  public async flush() {\n    this.log(\"flushing\");\n\n    if (this.options.globalPrefix) {\n      await this.removeNamespace(\"\");\n    } else {\n      this.cache.clear();\n      this.tagIndex.clear();\n      this.init();\n    }\n\n    this.log(\"flushed\");\n\n    await this.emit(\"flushed\");\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Brute-force O(N) cosine similarity over every cached node that carries a\n   * vector. Suitable for development and small in-memory knowledge bases —\n   * not for production beyond ~10k entries.\n   *\n   * @warning Dev-only — O(N) per query.\n   */\n  public async similar<T = any>(\n    vector: number[],\n    options: CacheSimilarOptions,\n  ): Promise<CacheSimilarHit<T>[]> {\n    const tagFilter = await this.getKeysForTags(options.tags);\n\n    const hits: CacheSimilarHit<T>[] = [];\n\n    for (const [parsedKey, node] of this.cache) {\n      if (!node.vector) continue;\n      if (node.isExpired) continue;\n      if (tagFilter && !tagFilter.has(parsedKey)) continue;\n\n      const score = cosineSimilarity(vector, node.vector);\n\n      if (options.threshold !== undefined && score < options.threshold) {\n        continue;\n      }\n\n      // Clone object values to match get() semantics.\n      let value: any = node.value;\n      if (value !== null && value !== undefined) {\n        const t = typeof value;\n        if (t !== \"string\" && t !== \"number\" && t !== \"boolean\") {\n          value = structuredClone(value);\n        }\n      }\n\n      hits.push({ key: parsedKey, value, score });\n    }\n\n    hits.sort((a, b) => b.score - a.score);\n\n    if (options.topK >= 0 && hits.length > options.topK) {\n      hits.length = options.topK;\n    }\n\n    return hits;\n  }\n\n  /**\n   * Get lru capacity\n   */\n  public get capacity() {\n    return this.options.capacity || 1000;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async disconnect() {\n    // Clear the cleanup interval to prevent memory leaks\n    if (this.cleanupInterval) {\n      clearInterval(this.cleanupInterval);\n      this.cleanupInterval = undefined;\n    }\n\n    await super.disconnect();\n  }\n}\n"],"mappings":";;;;;AAeA,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;;;;CAkCE,AAAO,cAAc;EACnB,MAAM;cA/BM;+BAK4B,IAAI,IAAI;kBAKX,IAAI,iBAAiB;cAKhC,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,KAAK,SAAS,gBAAgB,eAAe;EAE7C,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,KAAK,IAAI;EAGhC,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;;;;;CAMA,AAAU,SAAS,WAA0C;EAC3D,MAAM,OAAO,KAAK,MAAM,IAAI,SAAS;EAErC,IAAI,CAAC,MACH;EAGF,IAAI,KAAK,WAAW;GAClB,KAAK,WAAW,IAAI;GACpB,KAAK,MAAM,OAAO,SAAS;GAE3B;EACF;EAEA,OAAO;CACT;;;;;;;;CASA,MAAa,UAAU,KAAe,QAAgB,GAAoB;EACxE,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,OAAO,KAAK,SAAS,SAAS;EACpC,MAAM,UAAU,OAAO,KAAK,QAAQ;EAEpC,IAAI,OAAO,YAAY,UACrB,MAAM,IAAI,MAAM,+CAA+C,WAAW;EAG5E,MAAM,WAAW,UAAU;EAE3B,IAAI,MAAM;GACR,KAAK,QAAQ;GACb,KAAK,SAAS,IAAI;EACpB,OAAO;GACL,MAAM,UAAU,IAAI,UAAU,WAAW,UAAU,KAAK,GAAG;GAE3D,KAAK,MAAM,IAAI,WAAW,OAAO;GACjC,KAAK,QAAQ,OAAO;GAEpB,IAAI,KAAK,MAAM,OAAO,KAAK,UACzB,KAAK,WAAW;EAEpB;EAEA,MAAM,KAAK,KAAK,OAAO;GAAE,KAAK;GAAW,OAAO;GAAU,KAAK,KAAK;EAAI,CAAC;EAEzE,OAAO;CACT;;;;;;;CAQA,MAAa,KAAK,KAAoC;EACpD,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,OAAO,KAAK,SAAS,SAAS;EAEpC,IAAI,CAAC,MAAM;GACT,MAAM,KAAK,KAAK,QAAQ,EAAE,KAAK,UAAU,CAAC;GAE1C,OAAO;EACT;EAEA,KAAK,WAAW,IAAI;EACpB,KAAK,MAAM,OAAO,SAAS;EAE3B,MAAM,QACJ,KAAK,UAAU,QAAQ,OAAO,KAAK,UAAU,WACzC,gBAAgB,KAAK,KAAK,IAC1B,KAAK;EAEX,MAAM,KAAK,KAAK,OAAO;GAAE,KAAK;GAAW;EAAM,CAAC;EAChD,MAAM,KAAK,KAAK,WAAW,EAAE,KAAK,UAAU,CAAC;EAE7C,OAAO;CACT;;;;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;;;;;;CAOA,MAAa,OAAO,QAAkB,SAAkC;EACtE,KAAK,SAAS,IAAI,KAAK,SAAS,MAAM,GAAG,OAAO;CAClD;;;;CAKA,MAAa,WAAW,QAAqC;EAC3D,OAAO,KAAK,SAAS,QAAQ,KAAK,SAAS,MAAM,CAAC;CACpD;;;;CAKA,MAAa,UAAU,QAAkB,SAAkC;EACzE,KAAK,SAAS,OAAO,KAAK,SAAS,MAAM,GAAG,OAAO;CACrD;;;;CAKA,MAAa,UAAU,QAAiC;EACtD,KAAK,SAAS,OAAO,KAAK,SAAS,MAAM,CAAC;CAC5C;;;;;;;;CASA,MAAa,QAAQ;EACnB,KAAK,IAAI,UAAU;EAEnB,IAAI,KAAK,QAAQ,cACf,MAAM,KAAK,gBAAgB,EAAE;OACxB;GACL,KAAK,MAAM,MAAM;GACjB,KAAK,SAAS,MAAM;GACpB,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"}
+{"version":3,"file":"lru-memory-cache-driver.mjs","names":[],"sources":["../../../../../../../../packages/cache/src/drivers/lru-memory-cache-driver.ts"],"sourcesContent":["import { maskEmailsInText } from \"@warlock.js/logger\";\nimport type {\n  CacheData,\n  CacheDriver,\n  CacheKey,\n  CacheSetOptions,\n  CacheSetResult,\n  CacheSimilarHit,\n  CacheSimilarOptions,\n  CacheTtl,\n  LRUMemoryCacheOptions,\n} from \"../types\";\nimport { cosineSimilarity } from \"../utils\";\nimport { BaseCacheDriver } from \"./base-cache-driver\";\nimport { InMemoryTagIndex } from \"./in-memory-tag-index\";\n\nclass CacheNode {\n  public next: CacheNode | null = null;\n  public prev: CacheNode | null = null;\n  public expiresAt?: number;\n  /**\n   * Freshness deadline (ms timestamp) — populated by `swr()`. Within\n   * `expiresAt > now > staleAt` the entry is \"stale-but-revalidatable.\"\n   */\n  public staleAt?: number;\n  /**\n   * Optional embedding vector — populated when the entry was written with\n   * `set({ vector })`. Scanned by `similar()`.\n   */\n  public vector?: number[];\n  public constructor(\n    public key: string,\n    public value: any,\n    ttl?: number,\n  ) {\n    if (ttl && ttl !== Infinity) {\n      this.expiresAt = Date.now() + ttl * 1000;\n    }\n  }\n\n  public get isExpired(): boolean {\n    return this.expiresAt !== undefined && this.expiresAt < Date.now();\n  }\n}\n\n/**\n * LRU Memory Cache Driver\n * The concept of LRU is to remove the least recently used data\n * whenever the cache is full\n * The question that resides here is how to tell the cache is full?\n */\nexport class LRUMemoryCacheDriver\n  extends BaseCacheDriver<LRUMemoryCacheDriver, LRUMemoryCacheOptions>\n  implements CacheDriver<LRUMemoryCacheDriver, LRUMemoryCacheOptions>\n{\n  /**\n   * {@inheritdoc}\n   */\n  public name = \"lru\";\n\n  /**\n   * Cache map\n   */\n  protected cache: Map<string, CacheNode> = new Map();\n\n  /**\n   * Tag index, kept out of the LRU list so capacity pressure can never evict it.\n   */\n  protected tagIndex: InMemoryTagIndex = new InMemoryTagIndex();\n\n  /**\n   * Head of the cache\n   */\n  protected head: CacheNode = new CacheNode(\"\", null);\n\n  /**\n   * Tail of the cache\n   */\n  protected tail: CacheNode = new CacheNode(\"\", null);\n\n  /**\n   * Cleanup interval reference\n   */\n  protected cleanupInterval?: NodeJS.Timeout;\n\n  /**\n   * {@inheritdoc}\n   */\n  public constructor() {\n    super();\n\n    this.init();\n    this.startCleanup();\n  }\n\n  /**\n   * Initialize the cache\n   */\n  public init() {\n    this.head.next = this.tail;\n    this.tail.prev = this.head;\n  }\n\n  /**\n   * Start the cleanup process for expired items\n   */\n  public startCleanup() {\n    // Clear existing interval if any\n    if (this.cleanupInterval) {\n      clearInterval(this.cleanupInterval);\n    }\n\n    this.cleanupInterval = setInterval(async () => {\n      const now = Date.now();\n      const expiredKeys: string[] = [];\n\n      for (const [key, node] of this.cache) {\n        if (node.expiresAt && node.expiresAt <= now) {\n          expiredKeys.push(key);\n        }\n      }\n\n      for (const key of expiredKeys) {\n        const node = this.cache.get(key);\n        if (node) {\n          this.removeNode(node);\n          this.cache.delete(key);\n          this.log(\"expired\", key);\n          // Emit expired event\n          await this.emit(\"expired\", { key });\n        }\n      }\n    }, 1000);\n\n    // do not block the process from exiting\n    this.cleanupInterval.unref();\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Clears every entry whose key starts with the parsed namespace (followed\n   * by a dot) or equals it exactly. Called with an empty namespace while a\n   * `globalPrefix` is configured, clears everything under the prefix — which\n   * is how `flush()` scopes cleanup per tenant.\n   */\n  public async removeNamespace(namespace: string) {\n    const parsedNamespace = this.parseKey(namespace);\n\n    this.log(\"clearing\", parsedNamespace || \"(all)\");\n\n    const removed: string[] = [];\n\n    this.tagIndex.removeNamespace(parsedNamespace);\n\n    if (parsedNamespace === \"\") {\n      for (const key of this.cache.keys()) {\n        removed.push(key);\n      }\n    } else {\n      const prefix = parsedNamespace + \".\";\n\n      for (const key of this.cache.keys()) {\n        if (key === parsedNamespace || key.startsWith(prefix)) {\n          removed.push(key);\n        }\n      }\n    }\n\n    for (const key of removed) {\n      const node = this.cache.get(key);\n      if (node) {\n        this.removeNode(node);\n        this.cache.delete(key);\n      }\n      await this.emit(\"removed\", { key });\n    }\n\n    this.log(\"cleared\", parsedNamespace || \"(all)\");\n\n    return removed;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any> {\n    const parsedKey = this.parseKey(key);\n    const { ttl, tags, onConflict, vector, staleAt } = this.resolveSetOptions(ttlOrOptions);\n\n    this.log(\"caching\", parsedKey);\n\n    // For conditional writes, check existence via get() so expired entries\n    // are treated as missing (get() handles expiry cleanup). The raw `cache.get`\n    // node lookup would let stale entries block onConflict: \"create\".\n    let existingNode = this.cache.get(parsedKey);\n    if (existingNode && existingNode.isExpired) {\n      this.removeNode(existingNode);\n      this.cache.delete(parsedKey);\n      existingNode = undefined;\n    }\n\n    const exists = Boolean(existingNode);\n\n    if (onConflict === \"create\" && exists) {\n      const result: CacheSetResult = {\n        wasSet: false,\n        existing: existingNode!.value,\n      };\n      return result;\n    }\n\n    if (onConflict === \"update\" && !exists) {\n      const result: CacheSetResult = { wasSet: false, existing: null };\n      return result;\n    }\n\n    if (existingNode) {\n      existingNode.value = value;\n      if (ttl && ttl !== Infinity) {\n        existingNode.expiresAt = Date.now() + ttl * 1000;\n      } else {\n        existingNode.expiresAt = undefined;\n      }\n      existingNode.staleAt = staleAt;\n      if (vector) {\n        existingNode.vector = vector.slice();\n      }\n\n      this.moveHead(existingNode);\n    } else {\n      const newNode = new CacheNode(parsedKey, value, ttl);\n      newNode.staleAt = staleAt;\n      if (vector) {\n        newNode.vector = vector.slice();\n      }\n\n      this.cache.set(parsedKey, newNode);\n\n      this.addNode(newNode);\n      if (this.cache.size > this.capacity) {\n        this.removeTail();\n      }\n    }\n\n    if (tags && tags.length > 0) {\n      await this.applyTags(key, tags);\n    }\n\n    this.log(\"cached\", parsedKey);\n\n    await this.emit(\"set\", { key: parsedKey, value, ttl });\n\n    if (onConflict === \"create\" || onConflict === \"update\") {\n      const result: CacheSetResult = { wasSet: true, existing: null };\n      return result;\n    }\n\n    return this;\n  }\n\n  /**\n   * Move the node to the head\n   */\n  protected moveHead(node: CacheNode) {\n    this.removeNode(node);\n    this.addNode(node);\n  }\n\n  /**\n   * Remove the node from the cache\n   */\n  protected removeNode(node: CacheNode) {\n    node.prev!.next = node.next;\n    node.next!.prev = node.prev;\n  }\n\n  /**\n   * Add the node to the head\n   */\n  protected addNode(node: CacheNode) {\n    node.next = this.head.next;\n    node.prev = this.head;\n    this.head.next!.prev = node;\n    this.head.next = node;\n  }\n\n  /**\n   * Remove the tail node\n   */\n  protected removeTail() {\n    const node = this.tail.prev!;\n\n    this.removeNode(node);\n\n    this.cache.delete(node.key);\n  }\n\n  /**\n   * Read the raw {@link CacheData} wrapper, including `staleAt` metadata.\n   * Returns `null` for missing or expired nodes — `swr()` consumes this\n   * to branch on freshness without going through `get()`'s clone-and-emit\n   * path.\n   */\n  protected async getEntry(key: CacheKey): Promise<CacheData | null> {\n    const parsedKey = this.parseKey(key);\n    const node = this.cache.get(parsedKey);\n\n    if (!node || node.isExpired) {\n      return null;\n    }\n\n    return {\n      data: node.value,\n      expiresAt: node.expiresAt,\n      staleAt: node.staleAt,\n    };\n  }\n\n  /**\n   * Live node for `parsedKey`, or `undefined` when missing / expired (an\n   * expired node is unlinked). Synchronous.\n   */\n  protected liveNode(parsedKey: string): CacheNode | undefined {\n    const node = this.cache.get(parsedKey);\n\n    if (!node) {\n      return undefined;\n    }\n\n    if (node.isExpired) {\n      this.removeNode(node);\n      this.cache.delete(parsedKey);\n\n      return undefined;\n    }\n\n    return node;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Read, add and write run synchronously (no `await` in between), so\n   * concurrent increments in this process never lose an update. An existing\n   * node keeps its expiry; a missing key starts from 0 with the default TTL.\n   */\n  public async increment(key: CacheKey, value: number = 1): Promise<number> {\n    const parsedKey = this.parseKey(key);\n    const node = this.liveNode(parsedKey);\n    const current = node ? node.value : 0;\n\n    if (typeof current !== \"number\") {\n      throw new Error(`Cannot increment non-numeric value for key: ${maskEmailsInText(parsedKey)}`);\n    }\n\n    const newValue = current + value;\n\n    if (node) {\n      node.value = newValue;\n      this.moveHead(node);\n    } else {\n      const newNode = new CacheNode(parsedKey, newValue, this.ttl);\n\n      this.cache.set(parsedKey, newNode);\n      this.addNode(newNode);\n\n      if (this.cache.size > this.capacity) {\n        this.removeTail();\n      }\n    }\n\n    await this.emit(\"set\", { key: parsedKey, value: newValue, ttl: this.ttl });\n\n    return newValue;\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Read and unlink run synchronously, so a value is handed out exactly once\n   * even when concurrent callers pull the same key.\n   */\n  public async pull(key: CacheKey): Promise<any | null> {\n    const parsedKey = this.parseKey(key);\n    const node = this.liveNode(parsedKey);\n\n    if (!node) {\n      await this.emit(\"miss\", { key: parsedKey });\n\n      return null;\n    }\n\n    this.removeNode(node);\n    this.cache.delete(parsedKey);\n\n    const value =\n      node.value !== null && typeof node.value === \"object\"\n        ? structuredClone(node.value)\n        : node.value;\n\n    await this.emit(\"hit\", { key: parsedKey, value });\n    await this.emit(\"removed\", { key: parsedKey });\n\n    return value;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async get(key: CacheKey) {\n    const parsedKey = this.parseKey(key);\n\n    this.log(\"fetching\", parsedKey);\n\n    const node = this.cache.get(parsedKey);\n\n    if (!node) {\n      this.log(\"notFound\", parsedKey);\n      // Emit miss event\n      await this.emit(\"miss\", { key: parsedKey });\n      return null;\n    }\n\n    // Check if expired\n    if (node.isExpired) {\n      this.removeNode(node);\n      this.cache.delete(parsedKey);\n      this.log(\"expired\", parsedKey);\n      // Emit expired event\n      await this.emit(\"expired\", { key: parsedKey });\n      // Also emit miss since we're returning null\n      await this.emit(\"miss\", { key: parsedKey });\n      return null;\n    }\n\n    this.moveHead(node);\n\n    this.log(\"fetched\", parsedKey);\n\n    const value = node.value;\n\n    // Apply cloning for immutability protection\n    if (value === null || value === undefined) {\n      return value;\n    }\n\n    const type = typeof value;\n    if (type === \"string\" || type === \"number\" || type === \"boolean\") {\n      // Emit hit event\n      await this.emit(\"hit\", { key: parsedKey, value });\n      return value;\n    }\n\n    try {\n      const clonedValue = structuredClone(value);\n      // Emit hit event\n      await this.emit(\"hit\", { key: parsedKey, value: clonedValue });\n      return clonedValue;\n    } catch (error) {\n      this.logError(`Failed to clone cached value for ${parsedKey}`, error);\n      throw error;\n    }\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async remove(key: CacheKey) {\n    const parsedKey = this.parseKey(key);\n\n    this.log(\"removing\", parsedKey);\n\n    const node = this.cache.get(parsedKey);\n\n    if (node) {\n      this.removeNode(node);\n      this.cache.delete(parsedKey);\n    }\n\n    this.log(\"removed\", parsedKey);\n\n    // Emit removed event\n    await this.emit(\"removed\", { key: parsedKey });\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Synchronous in-process set, never evicted or expired with the entries.\n   */\n  public async tagAdd(tagKey: CacheKey, members: string[]): Promise<void> {\n    this.tagIndex.add(this.parseKey(tagKey), members);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async tagMembers(tagKey: CacheKey): Promise<string[]> {\n    return this.tagIndex.members(this.parseKey(tagKey));\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async tagRemove(tagKey: CacheKey, members: string[]): Promise<void> {\n    this.tagIndex.remove(this.parseKey(tagKey), members);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async tagDelete(tagKey: CacheKey): Promise<void> {\n    this.tagIndex.delete(this.parseKey(tagKey));\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * When a `globalPrefix` is configured, `flush` scopes itself to that prefix\n   * so multi-tenant caches don't accidentally wipe sibling tenants. Without\n   * a prefix, clears everything.\n   */\n  public async flush() {\n    this.log(\"flushing\");\n\n    if (this.options.globalPrefix) {\n      await this.removeNamespace(\"\");\n    } else {\n      this.cache.clear();\n      this.tagIndex.clear();\n      this.init();\n    }\n\n    this.log(\"flushed\");\n\n    await this.emit(\"flushed\");\n  }\n\n  /**\n   * {@inheritdoc}\n   *\n   * Brute-force O(N) cosine similarity over every cached node that carries a\n   * vector. Suitable for development and small in-memory knowledge bases —\n   * not for production beyond ~10k entries.\n   *\n   * @warning Dev-only — O(N) per query.\n   */\n  public async similar<T = any>(\n    vector: number[],\n    options: CacheSimilarOptions,\n  ): Promise<CacheSimilarHit<T>[]> {\n    const tagFilter = await this.getKeysForTags(options.tags);\n\n    const hits: CacheSimilarHit<T>[] = [];\n\n    for (const [parsedKey, node] of this.cache) {\n      if (!node.vector) continue;\n      if (node.isExpired) continue;\n      if (tagFilter && !tagFilter.has(parsedKey)) continue;\n\n      const score = cosineSimilarity(vector, node.vector);\n\n      if (options.threshold !== undefined && score < options.threshold) {\n        continue;\n      }\n\n      // Clone object values to match get() semantics.\n      let value: any = node.value;\n      if (value !== null && value !== undefined) {\n        const t = typeof value;\n        if (t !== \"string\" && t !== \"number\" && t !== \"boolean\") {\n          value = structuredClone(value);\n        }\n      }\n\n      hits.push({ key: parsedKey, value, score });\n    }\n\n    hits.sort((a, b) => b.score - a.score);\n\n    if (options.topK >= 0 && hits.length > options.topK) {\n      hits.length = options.topK;\n    }\n\n    return hits;\n  }\n\n  /**\n   * Get lru capacity\n   */\n  public get capacity() {\n    return this.options.capacity || 1000;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async disconnect() {\n    // Clear the cleanup interval to prevent memory leaks\n    if (this.cleanupInterval) {\n      clearInterval(this.cleanupInterval);\n      this.cleanupInterval = undefined;\n    }\n\n    await super.disconnect();\n  }\n}\n"],"mappings":";;;;;;AAgBA,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;;;;CAkCE,AAAO,cAAc;EACnB,MAAM;cA/BM;+BAK4B,IAAI,IAAI;kBAKX,IAAI,iBAAiB;cAKhC,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,KAAK,SAAS,gBAAgB,eAAe;EAE7C,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,KAAK,IAAI;EAGhC,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;;;;;CAMA,AAAU,SAAS,WAA0C;EAC3D,MAAM,OAAO,KAAK,MAAM,IAAI,SAAS;EAErC,IAAI,CAAC,MACH;EAGF,IAAI,KAAK,WAAW;GAClB,KAAK,WAAW,IAAI;GACpB,KAAK,MAAM,OAAO,SAAS;GAE3B;EACF;EAEA,OAAO;CACT;;;;;;;;CASA,MAAa,UAAU,KAAe,QAAgB,GAAoB;EACxE,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,OAAO,KAAK,SAAS,SAAS;EACpC,MAAM,UAAU,OAAO,KAAK,QAAQ;EAEpC,IAAI,OAAO,YAAY,UACrB,MAAM,IAAI,MAAM,+CAA+C,iBAAiB,SAAS,GAAG;EAG9F,MAAM,WAAW,UAAU;EAE3B,IAAI,MAAM;GACR,KAAK,QAAQ;GACb,KAAK,SAAS,IAAI;EACpB,OAAO;GACL,MAAM,UAAU,IAAI,UAAU,WAAW,UAAU,KAAK,GAAG;GAE3D,KAAK,MAAM,IAAI,WAAW,OAAO;GACjC,KAAK,QAAQ,OAAO;GAEpB,IAAI,KAAK,MAAM,OAAO,KAAK,UACzB,KAAK,WAAW;EAEpB;EAEA,MAAM,KAAK,KAAK,OAAO;GAAE,KAAK;GAAW,OAAO;GAAU,KAAK,KAAK;EAAI,CAAC;EAEzE,OAAO;CACT;;;;;;;CAQA,MAAa,KAAK,KAAoC;EACpD,MAAM,YAAY,KAAK,SAAS,GAAG;EACnC,MAAM,OAAO,KAAK,SAAS,SAAS;EAEpC,IAAI,CAAC,MAAM;GACT,MAAM,KAAK,KAAK,QAAQ,EAAE,KAAK,UAAU,CAAC;GAE1C,OAAO;EACT;EAEA,KAAK,WAAW,IAAI;EACpB,KAAK,MAAM,OAAO,SAAS;EAE3B,MAAM,QACJ,KAAK,UAAU,QAAQ,OAAO,KAAK,UAAU,WACzC,gBAAgB,KAAK,KAAK,IAC1B,KAAK;EAEX,MAAM,KAAK,KAAK,OAAO;GAAE,KAAK;GAAW;EAAM,CAAC;EAChD,MAAM,KAAK,KAAK,WAAW,EAAE,KAAK,UAAU,CAAC;EAE7C,OAAO;CACT;;;;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;;;;;;CAOA,MAAa,OAAO,QAAkB,SAAkC;EACtE,KAAK,SAAS,IAAI,KAAK,SAAS,MAAM,GAAG,OAAO;CAClD;;;;CAKA,MAAa,WAAW,QAAqC;EAC3D,OAAO,KAAK,SAAS,QAAQ,KAAK,SAAS,MAAM,CAAC;CACpD;;;;CAKA,MAAa,UAAU,QAAkB,SAAkC;EACzE,KAAK,SAAS,OAAO,KAAK,SAAS,MAAM,GAAG,OAAO;CACrD;;;;CAKA,MAAa,UAAU,QAAiC;EACtD,KAAK,SAAS,OAAO,KAAK,SAAS,MAAM,CAAC;CAC5C;;;;;;;;CASA,MAAa,QAAQ;EACnB,KAAK,IAAI,UAAU;EAEnB,IAAI,KAAK,QAAQ,cACf,MAAM,KAAK,gBAAgB,EAAE;OACxB;GACL,KAAK,MAAM,MAAM;GACjB,KAAK,SAAS,MAAM;GACpB,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

@@ -2,7 +2,7 @@ import { BaseCacheDriver } from "./base-cache-driver.mjs";
 import { InMemoryTagIndex } from "./in-memory-tag-index.mjs";
 import { CacheData, CacheDriver, CacheKey, CacheSetOptions, CacheSimilarHit, CacheSimilarOptions, CacheTtl, MemoryCacheOptions } from "../types.mjs";
 
-//#region ../cache/src/drivers/memory-cache-driver.d.ts
+//#region ../../packages/cache/src/drivers/memory-cache-driver.d.ts
 declare class MemoryCacheDriver extends BaseCacheDriver<MemoryCacheDriver, MemoryCacheOptions> implements CacheDriver<MemoryCacheDriver, MemoryCacheOptions> {
   /**
    * {@inheritdoc}

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

@@ -1 +1 @@
-{"version":3,"file":"memory-cache-driver.d.mts","names":[],"sources":["../../../../../../../cache/src/drivers/memory-cache-driver.ts"],"mappings":";;;;;cAiCa,iBAAA,SACH,eAAA,CAAgB,iBAAA,EAAmB,kBAAA,aAChC,WAAA,CAAY,iBAAA,EAAmB,kBAAA;;AAF5C;;EAOS,IAAA;EANiB;;;;;EAAA,UAad,OAAA,EAAS,GAAA,SAAY,SAAA;EAMG;;;;EAAA,IAAvB,IAAA,IAAQ,MAAA,SAAe,SAAA;EA2Bd;;;;EAAA,UAnBV,MAAA,EAAQ,GAAA;EA0KX;;;EAAA,UArKG,eAAA,GAAkB,MAAA,CAAO,OAAA;EAqOC;;;;;;EAAA,UA7N1B,WAAA,EAAa,GAAA;EA6SO;;;;EAAA,UAvSpB,QAAA,EAAU,gBAAA;EAkVa;;;;EAyBU;;;EA7VpC,YAAA;EA2WmC;;;EAAA,UApUhC,SAAA,CAAU,SAAA;EAmYT;;;;EAAA,UAzXD,QAAA,CAAS,SAAA,WAAoB,SAAA;EA5GjB;;;EAAA,UA8HZ,KAAA,CAAM,SAAA,UAAmB,KAAA,EAAO,SAAA;EA/HC;;;;;;EAAA,UA4IjC,iBAAA;EA/HqB;;;;;EAAA,UAsIrB,MAAA,CAAO,SAAA,UAAmB,KAAA,EAAO,SAAA;EAnHjC;;;EAoIG,eAAA,CAAgB,SAAA,WAAiB,OAAA;EA5HvB;;;;;;EA4JV,GAAA,CACX,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EA3FO;;;;;;EAAA,UAwJM,cAAA,CAAe,GAAA,EAAK,QAAA,EAAU,QAAA,YAAoB,OAAA;EAzHxD;;;;;;;EA6IG,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAoB,OAAA;EArF7C;;;;;;EA0HA,IAAA,CAAK,GAAA,EAAK,QAAA,GAAW,OAAA;EAtH/B;;;EA6IU,GAAA,CAAI,GAAA,EAAK,QAAA,GAAQ,OAAA;EAhFgB;;;;;EAAA,UA8G9B,QAAA,CAAS,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,SAAA;EA1FS;;;EAuG7C,MAAA,CAAO,GAAA,EAAK,QAAA,GAAQ,OAAA;EAlEC;;;;;EAoFrB,MAAA,CAAO,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EA/B5B;;;EAsCjB,UAAA,CAAW,MAAA,EAAQ,QAAA,GAAW,OAAA;EAzB9B;;;EAgCA,SAAA,CAAU,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EAdhD;;;EAqBA,SAAA,CAAU,MAAA,EAAQ,QAAA,GAAW,OAAA;EArBgB;;;EA4B7C,KAAA,IAAK,OAAA;EArByB;;;;EAAA,UA0CjC,cAAA,CAAe,YAAA;EAnCoC;;;;;;;;;;EAmEhD,OAAA,UACX,MAAA,YACA,OAAA,EAAS,mBAAA,GACR,OAAA,CAAQ,eAAA,CAAgB,CAAA;EAFzB;;;EA2CW,UAAA,IAAU,OAAA;AAAA"}
+{"version":3,"file":"memory-cache-driver.d.mts","names":[],"sources":["../../../../../../../../packages/cache/src/drivers/memory-cache-driver.ts"],"mappings":";;;;;cAkCa,iBAAA,SACH,eAAA,CAAgB,iBAAA,EAAmB,kBAAA,aAChC,WAAA,CAAY,iBAAA,EAAmB,kBAAA;;AAF5C;;EAOS,IAAA;EANiB;;;;;EAAA,UAad,OAAA,EAAS,GAAA,SAAY,SAAA;EAMG;;;;EAAA,IAAvB,IAAA,IAAQ,MAAA,SAAe,SAAA;EA2Bd;;;;EAAA,UAnBV,MAAA,EAAQ,GAAA;EA0KX;;;EAAA,UArKG,eAAA,GAAkB,MAAA,CAAO,OAAA;EAqOC;;;;;;EAAA,UA7N1B,WAAA,EAAa,GAAA;EA6SO;;;;EAAA,UAvSpB,QAAA,EAAU,gBAAA;EAkVa;;;;EAyBU;;;EA7VpC,YAAA;EA2WmC;;;EAAA,UApUhC,SAAA,CAAU,SAAA;EAmYT;;;;EAAA,UAzXD,QAAA,CAAS,SAAA,WAAoB,SAAA;EA5GjB;;;EAAA,UA8HZ,KAAA,CAAM,SAAA,UAAmB,KAAA,EAAO,SAAA;EA/HC;;;;;;EAAA,UA4IjC,iBAAA;EA/HqB;;;;;EAAA,UAsIrB,MAAA,CAAO,SAAA,UAAmB,KAAA,EAAO,SAAA;EAnHjC;;;EAoIG,eAAA,CAAgB,SAAA,WAAiB,OAAA;EA5HvB;;;;;;EA4JV,GAAA,CACX,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EA3FO;;;;;;EAAA,UAwJM,cAAA,CAAe,GAAA,EAAK,QAAA,EAAU,QAAA,YAAoB,OAAA;EAzHxD;;;;;;;EA6IG,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAoB,OAAA;EArF7C;;;;;;EA0HA,IAAA,CAAK,GAAA,EAAK,QAAA,GAAW,OAAA;EAtH/B;;;EA6IU,GAAA,CAAI,GAAA,EAAK,QAAA,GAAQ,OAAA;EAhFgB;;;;;EAAA,UA8G9B,QAAA,CAAS,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,SAAA;EA1FS;;;EAuG7C,MAAA,CAAO,GAAA,EAAK,QAAA,GAAQ,OAAA;EAlEC;;;;;EAoFrB,MAAA,CAAO,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EA/B5B;;;EAsCjB,UAAA,CAAW,MAAA,EAAQ,QAAA,GAAW,OAAA;EAzB9B;;;EAgCA,SAAA,CAAU,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EAdhD;;;EAqBA,SAAA,CAAU,MAAA,EAAQ,QAAA,GAAW,OAAA;EArBgB;;;EA4B7C,KAAA,IAAK,OAAA;EArByB;;;;EAAA,UA0CjC,cAAA,CAAe,YAAA;EAnCoC;;;;;;;;;;EAmEhD,OAAA,UACX,MAAA,YACA,OAAA,EAAS,mBAAA,GACR,OAAA,CAAQ,eAAA,CAAgB,CAAA;EAFzB;;;EA2CW,UAAA,IAAU,OAAA;AAAA"}