@warlock.js/cache 5.29.0 → 5.30.0

package/esm/metrics.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"metrics.mjs","names":[],"sources":["../../../../../../cache/src/metrics.ts"],"sourcesContent":["import type {\n  CacheEventData,\n  CacheMetricsSnapshot,\n} from \"./types\";\n\n/**\n * Default size of the circular latency-sample buffer. 1000 samples covers\n * \"tell me the current p95\" for every realistic workload while keeping the\n * memory cost negligible (8KB at 8 bytes per number).\n */\nconst DEFAULT_LATENCY_BUFFER_SIZE = 1000;\n\n/**\n * Per-driver counter row tracked inside {@link CacheMetricsCollector}.\n *\n * Same shape as the public {@link CacheMetricsSnapshot} except for the lack\n * of `byDriver` (which is the breakdown itself) and the `latencySamples`\n * array — the buffer that p50/p95/p99 are computed from at snapshot time.\n */\ntype DriverCounters = {\n  hits: number;\n  misses: number;\n  sets: number;\n  removed: number;\n  errors: number;\n  latencySamples: number[];\n  /** Pointer into `latencySamples` for the next write — circular buffer. */\n  latencyCursor: number;\n};\n\n/**\n * Listens to `CacheManager` events and accumulates running counters + a\n * circular latency buffer per driver. Returned to consumers via\n * `cache.metrics()` as a {@link CacheMetricsSnapshot}.\n *\n * **Role.** Single-instance observability layer attached to the manager.\n * Subscribes once at construction; survives `cache.use()` driver switches\n * because the global event registry on the manager re-attaches handlers to\n * every loaded driver.\n *\n * **Responsibility.**\n * - Owns: per-driver and aggregate counters (`hits`, `misses`, `sets`,\n *   `removed`, `errors`), the latency circular buffer, and snapshot\n *   computation including hit-rate + percentile calculation.\n * - Does NOT own: event emission (driven by drivers via `BaseCacheDriver.emit`),\n *   timing instrumentation (done at the manager level via `recordLatency`),\n *   or persistence — every metric resets on `resetMetrics()` and on process\n *   restart.\n *\n * @example\n * cache.metrics();\n * // {\n * //   hits: 9821, misses: 173, hitRate: 0.983,\n * //   latencyMs: { p50: 0.4, p95: 2.1, p99: 8.2, samples: 1000 },\n * //   byDriver: { memory: { ... }, redis: { ... } },\n * //   startedAt: 1714185600000,\n * // }\n */\nexport class CacheMetricsCollector {\n  /**\n   * Maximum number of latency samples retained per driver. Older samples\n   * are overwritten in arrival order — quantile calc operates on whatever\n   * window is currently in the buffer.\n   */\n  protected readonly bufferSize: number;\n\n  /**\n   * Aggregate counters across every driver. Mirrors what one driver bucket\n   * holds — the snapshot reports both totals and per-driver breakdowns.\n   */\n  protected readonly aggregate: DriverCounters;\n\n  /**\n   * Per-driver buckets keyed by driver name (`\"memory\"`, `\"redis\"`, …).\n   * Lazy-allocated on first event.\n   */\n  protected readonly byDriver: Map<string, DriverCounters> = new Map();\n\n  /** Millisecond timestamp the collector last reset. */\n  protected startedAt: number = Date.now();\n\n  public constructor(bufferSize: number = DEFAULT_LATENCY_BUFFER_SIZE) {\n    this.bufferSize = bufferSize;\n    this.aggregate = this.createCounters();\n  }\n\n  /**\n   * Increment the appropriate counters for a cache event. Called from the\n   * manager's global listeners (one per event type).\n   */\n  public recordEvent(\n    event: \"hit\" | \"miss\" | \"set\" | \"removed\" | \"error\",\n    data: CacheEventData,\n  ): void {\n    const driverBucket = this.bucketFor(data.driver);\n    const aggregate = this.aggregate;\n\n    switch (event) {\n      case \"hit\":\n        aggregate.hits += 1;\n        driverBucket.hits += 1;\n        break;\n      case \"miss\":\n        aggregate.misses += 1;\n        driverBucket.misses += 1;\n        break;\n      case \"set\":\n        aggregate.sets += 1;\n        driverBucket.sets += 1;\n        break;\n      case \"removed\":\n        aggregate.removed += 1;\n        driverBucket.removed += 1;\n        break;\n      case \"error\":\n        aggregate.errors += 1;\n        driverBucket.errors += 1;\n        break;\n    }\n  }\n\n  /**\n   * Append a latency sample for `driver`. Called by the manager from its\n   * timed wrappers around `get` / `set` / `remove`. Uses circular-buffer\n   * semantics: oldest samples are overwritten once the buffer is full.\n   */\n  public recordLatency(driver: string, durationMs: number): void {\n    this.appendLatency(this.aggregate, durationMs);\n    this.appendLatency(this.bucketFor(driver), durationMs);\n  }\n\n  /**\n   * Compute and return the current snapshot. Latency percentiles are\n   * derived from a sorted copy of the buffer at call time — O(N log N)\n   * on N=1000 is cheap enough that we don't bother caching.\n   */\n  public snapshot(): CacheMetricsSnapshot {\n    const byDriver: Record<string, Omit<CacheMetricsSnapshot, \"byDriver\">> = {};\n\n    for (const [driverName, bucket] of this.byDriver) {\n      byDriver[driverName] = this.toRow(bucket);\n    }\n\n    return {\n      ...this.toRow(this.aggregate),\n      byDriver,\n      startedAt: this.startedAt,\n    };\n  }\n\n  /**\n   * Wipe every counter, drop every latency sample, and reset `startedAt`.\n   * The collector itself stays subscribed to events.\n   */\n  public reset(): void {\n    this.resetCounters(this.aggregate);\n    this.byDriver.clear();\n    this.startedAt = Date.now();\n  }\n\n  /**\n   * Locate the per-driver bucket, creating it on first reference. Driver\n   * names are taken verbatim from `CacheEventData.driver`.\n   */\n  protected bucketFor(driverName: string): DriverCounters {\n    let bucket = this.byDriver.get(driverName);\n\n    if (!bucket) {\n      bucket = this.createCounters();\n      this.byDriver.set(driverName, bucket);\n    }\n\n    return bucket;\n  }\n\n  /**\n   * Convert raw counters into the public snapshot row shape. Computes\n   * `hitRate` and the latency percentiles on the fly.\n   */\n  protected toRow(bucket: DriverCounters): Omit<CacheMetricsSnapshot, \"byDriver\"> {\n    const totalReads = bucket.hits + bucket.misses;\n    const hitRate = totalReads === 0 ? 0 : bucket.hits / totalReads;\n    const latency = this.computeLatency(bucket.latencySamples);\n\n    return {\n      hits: bucket.hits,\n      misses: bucket.misses,\n      sets: bucket.sets,\n      removed: bucket.removed,\n      errors: bucket.errors,\n      hitRate,\n      latencyMs: latency,\n      startedAt: this.startedAt,\n    };\n  }\n\n  /**\n   * Sort a copy of the buffer and pick the percentile entries directly.\n   * Empty buffers return zeroed percentiles so consumers can render\n   * dashboards without null-checking.\n   */\n  protected computeLatency(samples: number[]): CacheMetricsSnapshot[\"latencyMs\"] {\n    if (samples.length === 0) {\n      return { p50: 0, p95: 0, p99: 0, samples: 0 };\n    }\n\n    const sorted = [...samples].sort((a, b) => a - b);\n    const pick = (quantile: number): number => {\n      const index = Math.min(sorted.length - 1, Math.floor(quantile * sorted.length));\n\n      // `sorted` is non-empty (the `samples.length === 0` early return above)\n      // and `index` is clamped to its last element, so this always hits — but\n      // the clamp is arithmetic the compiler does not evaluate. `?? 0` states\n      // the floor without asserting: a percentile of an empty set is 0, which\n      // is exactly what the early return above already answers.\n      return sorted[index] ?? 0;\n    };\n\n    return {\n      p50: pick(0.5),\n      p95: pick(0.95),\n      p99: pick(0.99),\n      samples: sorted.length,\n    };\n  }\n\n  /**\n   * Append a latency sample using circular-buffer semantics — overwrite the\n   * oldest entry once the buffer is full instead of growing unbounded.\n   */\n  protected appendLatency(bucket: DriverCounters, durationMs: number): void {\n    if (bucket.latencySamples.length < this.bufferSize) {\n      bucket.latencySamples.push(durationMs);\n\n      return;\n    }\n\n    bucket.latencySamples[bucket.latencyCursor] = durationMs;\n    bucket.latencyCursor = (bucket.latencyCursor + 1) % this.bufferSize;\n  }\n\n  /** Build a fresh counter row with zeroed totals and an empty buffer. */\n  protected createCounters(): DriverCounters {\n    return {\n      hits: 0,\n      misses: 0,\n      sets: 0,\n      removed: 0,\n      errors: 0,\n      latencySamples: [],\n      latencyCursor: 0,\n    };\n  }\n\n  /** Reset an existing counter row in place. Used by `reset()` for the aggregate. */\n  protected resetCounters(bucket: DriverCounters): void {\n    bucket.hits = 0;\n    bucket.misses = 0;\n    bucket.sets = 0;\n    bucket.removed = 0;\n    bucket.errors = 0;\n    bucket.latencySamples.length = 0;\n    bucket.latencyCursor = 0;\n  }\n}\n"],"mappings":";;;;;;AAUA,MAAM,8BAA8B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgDpC,IAAa,wBAAb,MAAmC;CAuBjC,AAAO,YAAY,aAAqB,6BAA6B;kCALV,IAAI,IAAI;mBAGrC,KAAK,IAAI;EAGrC,KAAK,aAAa;EAClB,KAAK,YAAY,KAAK,eAAe;CACvC;;;;;CAMA,AAAO,YACL,OACA,MACM;EACN,MAAM,eAAe,KAAK,UAAU,KAAK,MAAM;EAC/C,MAAM,YAAY,KAAK;EAEvB,QAAQ,OAAR;GACE,KAAK;IACH,UAAU,QAAQ;IAClB,aAAa,QAAQ;IACrB;GACF,KAAK;IACH,UAAU,UAAU;IACpB,aAAa,UAAU;IACvB;GACF,KAAK;IACH,UAAU,QAAQ;IAClB,aAAa,QAAQ;IACrB;GACF,KAAK;IACH,UAAU,WAAW;IACrB,aAAa,WAAW;IACxB;GACF,KAAK;IACH,UAAU,UAAU;IACpB,aAAa,UAAU;IACvB;EACJ;CACF;;;;;;CAOA,AAAO,cAAc,QAAgB,YAA0B;EAC7D,KAAK,cAAc,KAAK,WAAW,UAAU;EAC7C,KAAK,cAAc,KAAK,UAAU,MAAM,GAAG,UAAU;CACvD;;;;;;CAOA,AAAO,WAAiC;EACtC,MAAM,WAAmE,CAAC;EAE1E,KAAK,MAAM,CAAC,YAAY,WAAW,KAAK,UACtC,SAAS,cAAc,KAAK,MAAM,MAAM;EAG1C,OAAO;GACL,GAAG,KAAK,MAAM,KAAK,SAAS;GAC5B;GACA,WAAW,KAAK;EAClB;CACF;;;;;CAMA,AAAO,QAAc;EACnB,KAAK,cAAc,KAAK,SAAS;EACjC,KAAK,SAAS,MAAM;EACpB,KAAK,YAAY,KAAK,IAAI;CAC5B;;;;;CAMA,AAAU,UAAU,YAAoC;EACtD,IAAI,SAAS,KAAK,SAAS,IAAI,UAAU;EAEzC,IAAI,CAAC,QAAQ;GACX,SAAS,KAAK,eAAe;GAC7B,KAAK,SAAS,IAAI,YAAY,MAAM;EACtC;EAEA,OAAO;CACT;;;;;CAMA,AAAU,MAAM,QAAgE;EAC9E,MAAM,aAAa,OAAO,OAAO,OAAO;EACxC,MAAM,UAAU,eAAe,IAAI,IAAI,OAAO,OAAO;EACrD,MAAM,UAAU,KAAK,eAAe,OAAO,cAAc;EAEzD,OAAO;GACL,MAAM,OAAO;GACb,QAAQ,OAAO;GACf,MAAM,OAAO;GACb,SAAS,OAAO;GAChB,QAAQ,OAAO;GACf;GACA,WAAW;GACX,WAAW,KAAK;EAClB;CACF;;;;;;CAOA,AAAU,eAAe,SAAsD;EAC7E,IAAI,QAAQ,WAAW,GACrB,OAAO;GAAE,KAAK;GAAG,KAAK;GAAG,KAAK;GAAG,SAAS;EAAE;EAG9C,MAAM,SAAS,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;EAChD,MAAM,QAAQ,aAA6B;GAQzC,OAAO,OAPO,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,MAAM,WAAW,OAAO,MAAM,CAO3D,MAAM;EAC1B;EAEA,OAAO;GACL,KAAK,KAAK,EAAG;GACb,KAAK,KAAK,GAAI;GACd,KAAK,KAAK,GAAI;GACd,SAAS,OAAO;EAClB;CACF;;;;;CAMA,AAAU,cAAc,QAAwB,YAA0B;EACxE,IAAI,OAAO,eAAe,SAAS,KAAK,YAAY;GAClD,OAAO,eAAe,KAAK,UAAU;GAErC;EACF;EAEA,OAAO,eAAe,OAAO,iBAAiB;EAC9C,OAAO,iBAAiB,OAAO,gBAAgB,KAAK,KAAK;CAC3D;;CAGA,AAAU,iBAAiC;EACzC,OAAO;GACL,MAAM;GACN,QAAQ;GACR,MAAM;GACN,SAAS;GACT,QAAQ;GACR,gBAAgB,CAAC;GACjB,eAAe;EACjB;CACF;;CAGA,AAAU,cAAc,QAA8B;EACpD,OAAO,OAAO;EACd,OAAO,SAAS;EAChB,OAAO,OAAO;EACd,OAAO,UAAU;EACjB,OAAO,SAAS;EAChB,OAAO,eAAe,SAAS;EAC/B,OAAO,gBAAgB;CACzB;AACF"}
+{"version":3,"file":"metrics.mjs","names":[],"sources":["../../../../../../../packages/cache/src/metrics.ts"],"sourcesContent":["import type {\n  CacheEventData,\n  CacheMetricsSnapshot,\n} from \"./types\";\n\n/**\n * Default size of the circular latency-sample buffer. 1000 samples covers\n * \"tell me the current p95\" for every realistic workload while keeping the\n * memory cost negligible (8KB at 8 bytes per number).\n */\nconst DEFAULT_LATENCY_BUFFER_SIZE = 1000;\n\n/**\n * Per-driver counter row tracked inside {@link CacheMetricsCollector}.\n *\n * Same shape as the public {@link CacheMetricsSnapshot} except for the lack\n * of `byDriver` (which is the breakdown itself) and the `latencySamples`\n * array — the buffer that p50/p95/p99 are computed from at snapshot time.\n */\ntype DriverCounters = {\n  hits: number;\n  misses: number;\n  sets: number;\n  removed: number;\n  errors: number;\n  latencySamples: number[];\n  /** Pointer into `latencySamples` for the next write — circular buffer. */\n  latencyCursor: number;\n};\n\n/**\n * Listens to `CacheManager` events and accumulates running counters + a\n * circular latency buffer per driver. Returned to consumers via\n * `cache.metrics()` as a {@link CacheMetricsSnapshot}.\n *\n * **Role.** Single-instance observability layer attached to the manager.\n * Subscribes once at construction; survives `cache.use()` driver switches\n * because the global event registry on the manager re-attaches handlers to\n * every loaded driver.\n *\n * **Responsibility.**\n * - Owns: per-driver and aggregate counters (`hits`, `misses`, `sets`,\n *   `removed`, `errors`), the latency circular buffer, and snapshot\n *   computation including hit-rate + percentile calculation.\n * - Does NOT own: event emission (driven by drivers via `BaseCacheDriver.emit`),\n *   timing instrumentation (done at the manager level via `recordLatency`),\n *   or persistence — every metric resets on `resetMetrics()` and on process\n *   restart.\n *\n * @example\n * cache.metrics();\n * // {\n * //   hits: 9821, misses: 173, hitRate: 0.983,\n * //   latencyMs: { p50: 0.4, p95: 2.1, p99: 8.2, samples: 1000 },\n * //   byDriver: { memory: { ... }, redis: { ... } },\n * //   startedAt: 1714185600000,\n * // }\n */\nexport class CacheMetricsCollector {\n  /**\n   * Maximum number of latency samples retained per driver. Older samples\n   * are overwritten in arrival order — quantile calc operates on whatever\n   * window is currently in the buffer.\n   */\n  protected readonly bufferSize: number;\n\n  /**\n   * Aggregate counters across every driver. Mirrors what one driver bucket\n   * holds — the snapshot reports both totals and per-driver breakdowns.\n   */\n  protected readonly aggregate: DriverCounters;\n\n  /**\n   * Per-driver buckets keyed by driver name (`\"memory\"`, `\"redis\"`, …).\n   * Lazy-allocated on first event.\n   */\n  protected readonly byDriver: Map<string, DriverCounters> = new Map();\n\n  /** Millisecond timestamp the collector last reset. */\n  protected startedAt: number = Date.now();\n\n  public constructor(bufferSize: number = DEFAULT_LATENCY_BUFFER_SIZE) {\n    this.bufferSize = bufferSize;\n    this.aggregate = this.createCounters();\n  }\n\n  /**\n   * Increment the appropriate counters for a cache event. Called from the\n   * manager's global listeners (one per event type).\n   */\n  public recordEvent(\n    event: \"hit\" | \"miss\" | \"set\" | \"removed\" | \"error\",\n    data: CacheEventData,\n  ): void {\n    const driverBucket = this.bucketFor(data.driver);\n    const aggregate = this.aggregate;\n\n    switch (event) {\n      case \"hit\":\n        aggregate.hits += 1;\n        driverBucket.hits += 1;\n        break;\n      case \"miss\":\n        aggregate.misses += 1;\n        driverBucket.misses += 1;\n        break;\n      case \"set\":\n        aggregate.sets += 1;\n        driverBucket.sets += 1;\n        break;\n      case \"removed\":\n        aggregate.removed += 1;\n        driverBucket.removed += 1;\n        break;\n      case \"error\":\n        aggregate.errors += 1;\n        driverBucket.errors += 1;\n        break;\n    }\n  }\n\n  /**\n   * Append a latency sample for `driver`. Called by the manager from its\n   * timed wrappers around `get` / `set` / `remove`. Uses circular-buffer\n   * semantics: oldest samples are overwritten once the buffer is full.\n   */\n  public recordLatency(driver: string, durationMs: number): void {\n    this.appendLatency(this.aggregate, durationMs);\n    this.appendLatency(this.bucketFor(driver), durationMs);\n  }\n\n  /**\n   * Compute and return the current snapshot. Latency percentiles are\n   * derived from a sorted copy of the buffer at call time — O(N log N)\n   * on N=1000 is cheap enough that we don't bother caching.\n   */\n  public snapshot(): CacheMetricsSnapshot {\n    const byDriver: Record<string, Omit<CacheMetricsSnapshot, \"byDriver\">> = {};\n\n    for (const [driverName, bucket] of this.byDriver) {\n      byDriver[driverName] = this.toRow(bucket);\n    }\n\n    return {\n      ...this.toRow(this.aggregate),\n      byDriver,\n      startedAt: this.startedAt,\n    };\n  }\n\n  /**\n   * Wipe every counter, drop every latency sample, and reset `startedAt`.\n   * The collector itself stays subscribed to events.\n   */\n  public reset(): void {\n    this.resetCounters(this.aggregate);\n    this.byDriver.clear();\n    this.startedAt = Date.now();\n  }\n\n  /**\n   * Locate the per-driver bucket, creating it on first reference. Driver\n   * names are taken verbatim from `CacheEventData.driver`.\n   */\n  protected bucketFor(driverName: string): DriverCounters {\n    let bucket = this.byDriver.get(driverName);\n\n    if (!bucket) {\n      bucket = this.createCounters();\n      this.byDriver.set(driverName, bucket);\n    }\n\n    return bucket;\n  }\n\n  /**\n   * Convert raw counters into the public snapshot row shape. Computes\n   * `hitRate` and the latency percentiles on the fly.\n   */\n  protected toRow(bucket: DriverCounters): Omit<CacheMetricsSnapshot, \"byDriver\"> {\n    const totalReads = bucket.hits + bucket.misses;\n    const hitRate = totalReads === 0 ? 0 : bucket.hits / totalReads;\n    const latency = this.computeLatency(bucket.latencySamples);\n\n    return {\n      hits: bucket.hits,\n      misses: bucket.misses,\n      sets: bucket.sets,\n      removed: bucket.removed,\n      errors: bucket.errors,\n      hitRate,\n      latencyMs: latency,\n      startedAt: this.startedAt,\n    };\n  }\n\n  /**\n   * Sort a copy of the buffer and pick the percentile entries directly.\n   * Empty buffers return zeroed percentiles so consumers can render\n   * dashboards without null-checking.\n   */\n  protected computeLatency(samples: number[]): CacheMetricsSnapshot[\"latencyMs\"] {\n    if (samples.length === 0) {\n      return { p50: 0, p95: 0, p99: 0, samples: 0 };\n    }\n\n    const sorted = [...samples].sort((a, b) => a - b);\n    const pick = (quantile: number): number => {\n      const index = Math.min(sorted.length - 1, Math.floor(quantile * sorted.length));\n\n      // `sorted` is non-empty (the `samples.length === 0` early return above)\n      // and `index` is clamped to its last element, so this always hits — but\n      // the clamp is arithmetic the compiler does not evaluate. `?? 0` states\n      // the floor without asserting: a percentile of an empty set is 0, which\n      // is exactly what the early return above already answers.\n      return sorted[index] ?? 0;\n    };\n\n    return {\n      p50: pick(0.5),\n      p95: pick(0.95),\n      p99: pick(0.99),\n      samples: sorted.length,\n    };\n  }\n\n  /**\n   * Append a latency sample using circular-buffer semantics — overwrite the\n   * oldest entry once the buffer is full instead of growing unbounded.\n   */\n  protected appendLatency(bucket: DriverCounters, durationMs: number): void {\n    if (bucket.latencySamples.length < this.bufferSize) {\n      bucket.latencySamples.push(durationMs);\n\n      return;\n    }\n\n    bucket.latencySamples[bucket.latencyCursor] = durationMs;\n    bucket.latencyCursor = (bucket.latencyCursor + 1) % this.bufferSize;\n  }\n\n  /** Build a fresh counter row with zeroed totals and an empty buffer. */\n  protected createCounters(): DriverCounters {\n    return {\n      hits: 0,\n      misses: 0,\n      sets: 0,\n      removed: 0,\n      errors: 0,\n      latencySamples: [],\n      latencyCursor: 0,\n    };\n  }\n\n  /** Reset an existing counter row in place. Used by `reset()` for the aggregate. */\n  protected resetCounters(bucket: DriverCounters): void {\n    bucket.hits = 0;\n    bucket.misses = 0;\n    bucket.sets = 0;\n    bucket.removed = 0;\n    bucket.errors = 0;\n    bucket.latencySamples.length = 0;\n    bucket.latencyCursor = 0;\n  }\n}\n"],"mappings":";;;;;;AAUA,MAAM,8BAA8B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgDpC,IAAa,wBAAb,MAAmC;CAuBjC,AAAO,YAAY,aAAqB,6BAA6B;kCALV,IAAI,IAAI;mBAGrC,KAAK,IAAI;EAGrC,KAAK,aAAa;EAClB,KAAK,YAAY,KAAK,eAAe;CACvC;;;;;CAMA,AAAO,YACL,OACA,MACM;EACN,MAAM,eAAe,KAAK,UAAU,KAAK,MAAM;EAC/C,MAAM,YAAY,KAAK;EAEvB,QAAQ,OAAR;GACE,KAAK;IACH,UAAU,QAAQ;IAClB,aAAa,QAAQ;IACrB;GACF,KAAK;IACH,UAAU,UAAU;IACpB,aAAa,UAAU;IACvB;GACF,KAAK;IACH,UAAU,QAAQ;IAClB,aAAa,QAAQ;IACrB;GACF,KAAK;IACH,UAAU,WAAW;IACrB,aAAa,WAAW;IACxB;GACF,KAAK;IACH,UAAU,UAAU;IACpB,aAAa,UAAU;IACvB;EACJ;CACF;;;;;;CAOA,AAAO,cAAc,QAAgB,YAA0B;EAC7D,KAAK,cAAc,KAAK,WAAW,UAAU;EAC7C,KAAK,cAAc,KAAK,UAAU,MAAM,GAAG,UAAU;CACvD;;;;;;CAOA,AAAO,WAAiC;EACtC,MAAM,WAAmE,CAAC;EAE1E,KAAK,MAAM,CAAC,YAAY,WAAW,KAAK,UACtC,SAAS,cAAc,KAAK,MAAM,MAAM;EAG1C,OAAO;GACL,GAAG,KAAK,MAAM,KAAK,SAAS;GAC5B;GACA,WAAW,KAAK;EAClB;CACF;;;;;CAMA,AAAO,QAAc;EACnB,KAAK,cAAc,KAAK,SAAS;EACjC,KAAK,SAAS,MAAM;EACpB,KAAK,YAAY,KAAK,IAAI;CAC5B;;;;;CAMA,AAAU,UAAU,YAAoC;EACtD,IAAI,SAAS,KAAK,SAAS,IAAI,UAAU;EAEzC,IAAI,CAAC,QAAQ;GACX,SAAS,KAAK,eAAe;GAC7B,KAAK,SAAS,IAAI,YAAY,MAAM;EACtC;EAEA,OAAO;CACT;;;;;CAMA,AAAU,MAAM,QAAgE;EAC9E,MAAM,aAAa,OAAO,OAAO,OAAO;EACxC,MAAM,UAAU,eAAe,IAAI,IAAI,OAAO,OAAO;EACrD,MAAM,UAAU,KAAK,eAAe,OAAO,cAAc;EAEzD,OAAO;GACL,MAAM,OAAO;GACb,QAAQ,OAAO;GACf,MAAM,OAAO;GACb,SAAS,OAAO;GAChB,QAAQ,OAAO;GACf;GACA,WAAW;GACX,WAAW,KAAK;EAClB;CACF;;;;;;CAOA,AAAU,eAAe,SAAsD;EAC7E,IAAI,QAAQ,WAAW,GACrB,OAAO;GAAE,KAAK;GAAG,KAAK;GAAG,KAAK;GAAG,SAAS;EAAE;EAG9C,MAAM,SAAS,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;EAChD,MAAM,QAAQ,aAA6B;GAQzC,OAAO,OAPO,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,MAAM,WAAW,OAAO,MAAM,CAO3D,MAAM;EAC1B;EAEA,OAAO;GACL,KAAK,KAAK,EAAG;GACb,KAAK,KAAK,GAAI;GACd,KAAK,KAAK,GAAI;GACd,SAAS,OAAO;EAClB;CACF;;;;;CAMA,AAAU,cAAc,QAAwB,YAA0B;EACxE,IAAI,OAAO,eAAe,SAAS,KAAK,YAAY;GAClD,OAAO,eAAe,KAAK,UAAU;GAErC;EACF;EAEA,OAAO,eAAe,OAAO,iBAAiB;EAC9C,OAAO,iBAAiB,OAAO,gBAAgB,KAAK,KAAK;CAC3D;;CAGA,AAAU,iBAAiC;EACzC,OAAO;GACL,MAAM;GACN,QAAQ;GACR,MAAM;GACN,SAAS;GACT,QAAQ;GACR,gBAAgB,CAAC;GACjB,eAAe;EACjB;CACF;;CAGA,AAAU,cAAc,QAA8B;EACpD,OAAO,OAAO;EACd,OAAO,SAAS;EAChB,OAAO,OAAO;EACd,OAAO,UAAU;EACjB,OAAO,SAAS;EAChB,OAAO,eAAe,SAAS;EAC/B,OAAO,gBAAgB;CACzB;AACF"}

package/esm/scoped-cache.d.mts

@@ -1,6 +1,6 @@
 import { CacheDriver, CacheKey, CacheListAccessor, CacheNamespaceOptions, CacheSetOptions, CacheSimilarHit, CacheSimilarOptions, CacheSwrOptions, CacheTtl, LockOptions, LockOutcome, RememberOptions, ScopedCacheContract, TaggedScopedCacheContract } from "./types.mjs";
 
-//#region ../cache/src/scoped-cache.d.ts
+//#region ../../packages/cache/src/scoped-cache.d.ts
 /**
  * Scoped view over a cache source. Returned by `cache.namespace(prefix, options?)`.
  *

package/esm/scoped-cache.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"scoped-cache.d.mts","names":[],"sources":["../../../../../../cache/src/scoped-cache.ts"],"mappings":";;;;;AAsDA;;;;;;;;;;;;;;;;;;;;;;;;;;;cAAa,WAAA,YAAuB,mBAAA;EA0IqB;;;;;EAAA,SApIvC,MAAA;EAyJc;;;;;;;EAAA,SAhJd,MAAA,EAAQ,WAAA;EA2KjB;;;;;;EAAA,SAnKS,QAAA,EAAU,qBAAA;EAmLuB;;;;cA5K/C,MAAA,EAAQ,WAAA,YACR,MAAA,UACA,QAAA,GAAU,qBAAA;EA8LiB;;;;;;;;;EA3KtB,SAAA,CAAU,MAAA,UAAgB,OAAA,GAAS,qBAAA,GAA6B,mBAAA;EAyL5D;;;;;EA3KJ,IAAA,CAAK,IAAA,aAAiB,yBAAA;EA0MQ;;;;;EAjM9B,KAAA,IAAS,OAAA;EA4MJ;;;EArML,GAAA,UAAa,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EA8NjC;;;EAvNJ,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAsOF;;;EA/NlB,IAAA,CAAK,IAAA,EAAM,QAAA,KAAa,OAAA;EAyQtB;;;EAlQF,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EAtGX;;;;;EA+G3B,GAAA,CACL,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EApGqB;;;;;EA6GjB,OAAA,CAAQ,KAAA,EAAO,MAAA,eAAqB,GAAA,YAAe,OAAA;EA7FxD;;;;EA2GK,KAAA,CAAM,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,GAAA,YAAe,OAAA;EAvFb;;;;EAqGnC,OAAA,UAAiB,GAAA,EAAK,QAAA,EAAU,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,CAAA;EAvF7B;;;EA8FtB,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EA9EnB;;;;EAsFJ,QAAA,UACL,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,eAAA,EACzB,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EAnFJ;;;;;;EAiGA,GAAA,UACL,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,eAAA,EACT,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EA9FoB;;;;EA2GxB,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EApGZ;;;;EA4G9B,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAjG/C;;;;;;EA2GW,MAAA,UACX,GAAA,EAAK,QAAA,EACL,EAAA,GAAK,OAAA,EAAS,CAAA,YAAa,CAAA,UAAW,OAAA,CAAQ,CAAA,UAC9C,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EApG+C;;;;EA8G7C,KAAA,WAAgB,MAAA,gBAAsB,MAAA,eACjD,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,OAAA,CAAQ,CAAA,GACjB,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EAtFJ;;;;EAAA,QAgGO,YAAA;EAhGyB;;;;EAmHhC,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,iBAAA,CAAkB,CAAA;EA5GzC;;;;EAoHP,IAAA,IACL,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,IAAA,CAAK,WAAA,aAC9B,EAAA,QAAU,OAAA,CAAQ,CAAA,IACjB,OAAA,CAAQ,WAAA,CAAY,CAAA;EA/GrB;;;;;;EAqIW,OAAA,UACX,MAAA,YACA,OAAA,EAAS,mBAAA,GACR,OAAA,CAAQ,eAAA,CAAgB,CAAA;EArIxB;;;;;EAAA,UAmJO,SAAA,CAAU,GAAA,EAAK,QAAA;EAnId;;;;;;EAAA,UAmJD,eAAA,CACR,KAAA,GAAQ,QAAA,GAAW,eAAA,GAClB,eAAA;EAtII;;;;EAAA,UA6JG,oBAAA,CACR,KAAA,EAAO,QAAA,GAAW,eAAA,GACjB,QAAA,GAAW,eAAA;EAvJP;;;;;EAAA,UA8KG,eAAA;AAAA"}
+{"version":3,"file":"scoped-cache.d.mts","names":[],"sources":["../../../../../../../packages/cache/src/scoped-cache.ts"],"mappings":";;;;;AAsDA;;;;;;;;;;;;;;;;;;;;;;;;;;;cAAa,WAAA,YAAuB,mBAAA;EA0IqB;;;;;EAAA,SApIvC,MAAA;EAyJc;;;;;;;EAAA,SAhJd,MAAA,EAAQ,WAAA;EA2KjB;;;;;;EAAA,SAnKS,QAAA,EAAU,qBAAA;EAmLuB;;;;cA5K/C,MAAA,EAAQ,WAAA,YACR,MAAA,UACA,QAAA,GAAU,qBAAA;EA8LiB;;;;;;;;;EA3KtB,SAAA,CAAU,MAAA,UAAgB,OAAA,GAAS,qBAAA,GAA6B,mBAAA;EAyL5D;;;;;EA3KJ,IAAA,CAAK,IAAA,aAAiB,yBAAA;EA0MQ;;;;;EAjM9B,KAAA,IAAS,OAAA;EA4MJ;;;EArML,GAAA,UAAa,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EA8NjC;;;EAvNJ,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAsOF;;;EA/NlB,IAAA,CAAK,IAAA,EAAM,QAAA,KAAa,OAAA;EAyQtB;;;EAlQF,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EAtGX;;;;;EA+G3B,GAAA,CACL,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EApGqB;;;;;EA6GjB,OAAA,CAAQ,KAAA,EAAO,MAAA,eAAqB,GAAA,YAAe,OAAA;EA7FxD;;;;EA2GK,KAAA,CAAM,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,GAAA,YAAe,OAAA;EAvFb;;;;EAqGnC,OAAA,UAAiB,GAAA,EAAK,QAAA,EAAU,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,CAAA;EAvF7B;;;EA8FtB,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EA9EnB;;;;EAsFJ,QAAA,UACL,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,eAAA,EACzB,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EAnFJ;;;;;;EAiGA,GAAA,UACL,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,eAAA,EACT,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EA9FoB;;;;EA2GxB,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EApGZ;;;;EA4G9B,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAjG/C;;;;;;EA2GW,MAAA,UACX,GAAA,EAAK,QAAA,EACL,EAAA,GAAK,OAAA,EAAS,CAAA,YAAa,CAAA,UAAW,OAAA,CAAQ,CAAA,UAC9C,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EApG+C;;;;EA8G7C,KAAA,WAAgB,MAAA,gBAAsB,MAAA,eACjD,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,OAAA,CAAQ,CAAA,GACjB,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EAtFJ;;;;EAAA,QAgGO,YAAA;EAhGyB;;;;EAmHhC,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,iBAAA,CAAkB,CAAA;EA5GzC;;;;EAoHP,IAAA,IACL,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,IAAA,CAAK,WAAA,aAC9B,EAAA,QAAU,OAAA,CAAQ,CAAA,IACjB,OAAA,CAAQ,WAAA,CAAY,CAAA;EA/GrB;;;;;;EAqIW,OAAA,UACX,MAAA,YACA,OAAA,EAAS,mBAAA,GACR,OAAA,CAAQ,eAAA,CAAgB,CAAA;EArIxB;;;;;EAAA,UAmJO,SAAA,CAAU,GAAA,EAAK,QAAA;EAnId;;;;;;EAAA,UAmJD,eAAA,CACR,KAAA,GAAQ,QAAA,GAAW,eAAA,GAClB,eAAA;EAtII;;;;EAAA,UA6JG,oBAAA,CACR,KAAA,EAAO,QAAA,GAAW,eAAA,GACjB,QAAA,GAAW,eAAA;EAvJP;;;;;EAAA,UA8KG,eAAA;AAAA"}

package/esm/scoped-cache.mjs

@@ -1,7 +1,7 @@
 import { mergeTagSets, normalizeToOptions, normalizeToRememberOptions, parseCacheKey, parseTtl } from "./utils.mjs";
 import { TaggedScopedCache } from "./tagged-scoped-cache.mjs";
 
-//#region ../cache/src/scoped-cache.ts
+//#region ../../packages/cache/src/scoped-cache.ts
 /**
 * Scoped view over a cache source. Returned by `cache.namespace(prefix, options?)`.
 *

package/esm/scoped-cache.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"scoped-cache.mjs","names":[],"sources":["../../../../../../cache/src/scoped-cache.ts"],"sourcesContent":["import { TaggedScopedCache } from \"./tagged-scoped-cache\";\nimport type {\n  CacheDriver,\n  CacheKey,\n  CacheListAccessor,\n  CacheNamespaceOptions,\n  CacheSetOptions,\n  CacheSimilarHit,\n  CacheSimilarOptions,\n  CacheSwrOptions,\n  CacheTtl,\n  LockOptions,\n  LockOutcome,\n  RememberOptions,\n  ScopedCacheContract,\n  TaggedScopedCacheContract,\n} from \"./types\";\nimport {\n  mergeTagSets,\n  normalizeToOptions,\n  normalizeToRememberOptions,\n  parseCacheKey,\n  parseTtl,\n} from \"./utils\";\n\n/**\n * Scoped view over a cache source. Returned by `cache.namespace(prefix, options?)`.\n *\n * **Role.** A `ScopedCache` is a stateless wrapper that prepends a fixed\n * prefix to every key and applies optional default `ttl` / `tags` to every\n * write. Stores nothing itself — every call forwards to the underlying\n * `source` (typically the `CacheManager`, but any `CacheDriver` works).\n *\n * **Responsibility.**\n * - Owns: prefix-prepending of keys, normalization of nested-scope prefixes,\n *   merging scope defaults into write options (`ttl`, `tags`), filtering\n *   `similar()` hits to its own scope, and exposing `.clear()` as a sugar\n *   for `removeNamespace(prefix)`.\n * - Does NOT own: actual storage, connection lifecycle, event listeners,\n *   driver selection, or tag-index bookkeeping (delegated to the source's\n *   tagged-cache machinery).\n *\n * Per-call options always win over scope defaults; tags merge additively\n * across (scope defaults + per-call) layers. Nested scopes inherit and may\n * override the parent's defaults — see {@link ScopedCache.namespace}.\n *\n * @example\n * const chat = cache.namespace(`chats.${id}`, { ttl: \"30d\" });\n *\n * await chat.set(\"messages.10\", msg);          // 30d default\n * await chat.set(\"draft\", d, { ttl: \"1h\" });   // per-call override\n * await chat.namespace(\"typing\", { ttl: \"5s\" }).set(\"user.42\", true);\n * await chat.clear();\n */\nexport class ScopedCache implements ScopedCacheContract {\n  /**\n   * Fully-qualified prefix prepended to every key handled by this scope.\n   * Normalized through {@link parseCacheKey} on construction so colon-form\n   * input (`\"chats:10\"`) and trailing dots compose cleanly with nested scopes.\n   */\n  public readonly prefix: string;\n\n  /**\n   * Underlying cache source. Public-readonly so co-located helpers\n   * (`TaggedScopedCache`) can delegate without ceremony — not part of the\n   * stable consumer API.\n   *\n   * @internal\n   */\n  public readonly source: CacheDriver<any, any>;\n\n  /**\n   * Defaults applied to every write through this scope. Per-call options\n   * override `ttl`; `tags` merge additively across layers.\n   *\n   * @internal\n   */\n  public readonly defaults: CacheNamespaceOptions;\n\n  /**\n   * Build a scope. Constructed via `cache.namespace(prefix, options)` —\n   * users never call this directly.\n   */\n  public constructor(\n    source: CacheDriver<any, any>,\n    prefix: string,\n    defaults: CacheNamespaceOptions = {},\n  ) {\n    this.source = source;\n    this.prefix = parseCacheKey(prefix);\n    this.defaults = {\n      ttl: defaults.ttl,\n      tags: defaults.tags && defaults.tags.length > 0 ? [...defaults.tags] : undefined,\n    };\n  }\n\n  /**\n   * Build a nested scope. The child's prefix is `parent.child`; child options\n   * override the parent's `ttl` and union into `tags`.\n   *\n   * @example\n   * const chat = cache.namespace(\"chats.10\", { ttl: \"30d\" });\n   * const typing = chat.namespace(\"typing\", { ttl: \"5s\" });\n   * // typing.prefix === \"chats.10.typing\"\n   */\n  public namespace(prefix: string, options: CacheNamespaceOptions = {}): ScopedCacheContract {\n    const childPrefix = `${this.prefix}.${parseCacheKey(prefix)}`;\n\n    return new ScopedCache(this.source, childPrefix, {\n      ttl: options.ttl ?? this.defaults.ttl,\n      tags: mergeTagSets(this.defaults.tags, options.tags),\n    });\n  }\n\n  /**\n   * Return a one-shot tagged write handle. The handle's tags merge additively\n   * with scope-level defaults — final tag list per write is the union of\n   * (scope tags + handle tags + per-call tags), deduped.\n   */\n  public tags(tags: string[]): TaggedScopedCacheContract {\n    return new TaggedScopedCache(this, tags);\n  }\n\n  /**\n   * Wipe every entry under this scope's prefix. Sugar over\n   * `source.removeNamespace(prefix)` — siblings outside the scope are\n   * untouched.\n   */\n  public clear(): Promise<void> {\n    return this.source.removeNamespace(this.prefix);\n  }\n\n  /**\n   * Read the value at the scoped key. Forwards to the source after prefixing.\n   */\n  public get<T = any>(key: CacheKey): Promise<T | null> {\n    return this.source.get<T>(this.scopedKey(key));\n  }\n\n  /**\n   * Check presence of the scoped key without fetching the value.\n   */\n  public has(key: CacheKey): Promise<boolean> {\n    return this.source.has(this.scopedKey(key));\n  }\n\n  /**\n   * Batch-read scoped keys. Each input key is prefixed before forwarding.\n   */\n  public many(keys: CacheKey[]): Promise<any[]> {\n    return this.source.many(keys.map((key) => this.scopedKey(key)));\n  }\n\n  /**\n   * Read-and-remove. Returns the value or `null`; the entry is gone after.\n   */\n  public pull<T = any>(key: CacheKey): Promise<T | null> {\n    return this.source.pull<T>(this.scopedKey(key));\n  }\n\n  /**\n   * Write the scoped key. Per-call `ttl`/`tags` win over scope defaults;\n   * `expiresAt` is preserved as-is (absolute deadlines are never overridden\n   * by the scope's relative-ttl default).\n   */\n  public set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any> {\n    return this.source.set(this.scopedKey(key), value, this.mergeSetOptions(ttlOrOptions));\n  }\n\n  /**\n   * Batch-write under the scope. Caller's positional `ttl` wins; otherwise\n   * the scope default is parsed to seconds (since `setMany` accepts only a\n   * numeric ttl).\n   */\n  public setMany(items: Record<string, any>, ttl?: number): Promise<void> {\n    const scoped: Record<string, any> = {};\n\n    for (const [key, value] of Object.entries(items)) {\n      scoped[this.scopedKey(key)] = value;\n    }\n\n    return this.source.setMany(scoped, ttl ?? this.scopeTtlSeconds());\n  }\n\n  /**\n   * Atomic create-or-skip on the scoped key. Throws when the underlying\n   * source has no `setNX` (driver-specific — Redis-only today).\n   */\n  public setNX(key: CacheKey, value: any, ttl?: number): Promise<boolean> {\n    if (!this.source.setNX) {\n      throw new Error(\n        `setNX is not supported by the underlying cache source: ${this.source.name}`,\n      );\n    }\n\n    return this.source.setNX(this.scopedKey(key), value, ttl ?? this.scopeTtlSeconds());\n  }\n\n  /**\n   * Permanent write (no expiration). Bypasses the scope's `ttl` default —\n   * `forever` always means forever, regardless of scope policy.\n   */\n  public forever<T = any>(key: CacheKey, value: T): Promise<T> {\n    return this.source.forever<T>(this.scopedKey(key), value);\n  }\n\n  /**\n   * Remove a single scoped key.\n   */\n  public remove(key: CacheKey): Promise<void> {\n    return this.source.remove(this.scopedKey(key));\n  }\n\n  /**\n   * Read-or-compute. Cache-miss writes pick up the scope's default `ttl`\n   * and `tags` unless the caller passed an options object that overrides.\n   */\n  public remember<T = any>(\n    key: CacheKey,\n    ttlOrOptions: CacheTtl | RememberOptions,\n    callback: () => Promise<T>,\n  ): Promise<T> {\n    return this.source.remember<T>(\n      this.scopedKey(key),\n      this.mergeRememberOptions(ttlOrOptions),\n      callback,\n    );\n  }\n\n  /**\n   * Stale-while-revalidate on the scoped key. Scope-level `tags` merge\n   * additively with `options.tags`; `freshTtl`/`staleTtl` always come from\n   * the caller (no scope-default precedence — the SWR shape is too\n   * specific to the call site to inherit).\n   */\n  public swr<T = any>(\n    key: CacheKey,\n    options: CacheSwrOptions,\n    callback: () => Promise<T>,\n  ): Promise<T> {\n    const merged: CacheSwrOptions = {\n      ...options,\n      tags: mergeTagSets(this.defaults.tags, options.tags),\n    };\n\n    return this.source.swr<T>(this.scopedKey(key), merged, callback);\n  }\n\n  /**\n   * Atomic counter increment on the scoped key. TTL is preserved by the\n   * underlying driver — scope ttl is only applied on first write via `set`.\n   */\n  public increment(key: CacheKey, value?: number): Promise<number> {\n    return this.source.increment(this.scopedKey(key), value);\n  }\n\n  /**\n   * Atomic counter decrement on the scoped key. See {@link increment} for\n   * TTL semantics.\n   */\n  public decrement(key: CacheKey, value?: number): Promise<number> {\n    return this.source.decrement(this.scopedKey(key), value);\n  }\n\n  /**\n   * Atomic read-modify-write. An explicit `options.ttl` always wins. Otherwise\n   * the scope's default `ttl` is applied only when the key does not exist yet;\n   * for an existing key no ttl is passed so the source preserves the entry's\n   * remaining TTL.\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    const scopedKey = this.scopedKey(key);\n\n    return this.source.update<T>(scopedKey, fn, await this.writeOptions(scopedKey, options));\n  }\n\n  /**\n   * Shallow-merge a partial object into the scoped entry. Same TTL semantics\n   * as {@link update}.\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 scopedKey = this.scopedKey(key);\n\n    return this.source.merge<T>(scopedKey, partial, await this.writeOptions(scopedKey, options));\n  }\n\n  /**\n   * Resolve the ttl options for update/merge: explicit ttl, else the scope\n   * default only for keys that don't exist yet, else nothing (keep remaining).\n   */\n  private async writeOptions(\n    scopedKey: CacheKey,\n    options?: { ttl?: CacheTtl },\n  ): Promise<{ ttl?: CacheTtl }> {\n    if (options?.ttl !== undefined) {\n      return { ttl: options.ttl };\n    }\n\n    if (this.defaults.ttl === undefined) {\n      return {};\n    }\n\n    return (await this.source.has(scopedKey)) ? {} : { ttl: this.defaults.ttl };\n  }\n\n  /**\n   * Return a list accessor bound to the scoped key. The accessor itself\n   * does its own read-mutate-write under the prefixed entry.\n   */\n  public list<T = any>(key: CacheKey): CacheListAccessor<T> {\n    return this.source.list<T>(this.scopedKey(key));\n  }\n\n  /**\n   * Acquire a distributed lock on the scoped key. Caller's TTL wins; when\n   * the options form omits `ttl`, the scope default fills in.\n   */\n  public lock<T>(\n    key: CacheKey,\n    ttlOrOptions: CacheTtl | Omit<LockOptions, \"driver\">,\n    fn: () => Promise<T>,\n  ): Promise<LockOutcome<T>> {\n    if (typeof ttlOrOptions === \"object\" && ttlOrOptions !== null) {\n      const merged: Omit<LockOptions, \"driver\"> = {\n        ...ttlOrOptions,\n        ttl: ttlOrOptions.ttl ?? this.defaults.ttl ?? ttlOrOptions.ttl,\n      };\n\n      // The third coalesce is intentional — when both caller and scope omit\n      // the TTL, we still pass the original (undefined) through so the source\n      // raises its own validation error rather than us swallowing it silently.\n      return this.source.lock<T>(this.scopedKey(key), merged, fn);\n    }\n\n    return this.source.lock<T>(this.scopedKey(key), ttlOrOptions, fn);\n  }\n\n  /**\n   * Similarity retrieval, scope-isolated. Hits whose keys fall outside this\n   * scope are filtered out before the result is returned. `topK` applies to\n   * the underlying retrieval — when the scope contains fewer than `topK`\n   * matches but other scopes do, the caller will see fewer hits than `topK`.\n   */\n  public async similar<T = any>(\n    vector: number[],\n    options: CacheSimilarOptions,\n  ): Promise<CacheSimilarHit<T>[]> {\n    const hits = await this.source.similar<T>(vector, options);\n    const parsedPrefix = this.source.parseKey(this.prefix);\n\n    return hits.filter(\n      (hit) => hit.key === parsedPrefix || hit.key.startsWith(parsedPrefix + \".\"),\n    );\n  }\n\n  /**\n   * Build the source-side key by prepending the scope prefix. Object keys\n   * are normalized via {@link parseCacheKey} first so they compose with the\n   * prefix as plain dot-strings.\n   */\n  protected scopedKey(key: CacheKey): string {\n    const keyString = typeof key === \"string\" ? key : parseCacheKey(key);\n\n    if (!keyString) {\n      return this.prefix;\n    }\n\n    return `${this.prefix}.${keyString}`;\n  }\n\n  /**\n   * Coerce the polymorphic 3rd `set` argument into a {@link CacheSetOptions}\n   * with scope defaults filled in. Per-call values always win; tags merge\n   * additively. `expiresAt` is preserved without injecting the scope's `ttl`\n   * default (absolute deadlines override relative ones).\n   */\n  protected mergeSetOptions(\n    input?: CacheTtl | CacheSetOptions,\n  ): CacheSetOptions | undefined {\n    const options = normalizeToOptions(input);\n    const ttl =\n      options.ttl ?? (options.expiresAt === undefined ? this.defaults.ttl : undefined);\n    const tags = mergeTagSets(this.defaults.tags, options.tags);\n\n    const merged: CacheSetOptions = { ...options };\n\n    if (ttl !== undefined) {\n      merged.ttl = ttl;\n    }\n\n    if (tags !== undefined) {\n      merged.tags = tags;\n    }\n\n    return merged;\n  }\n\n  /**\n   * Same merge as {@link mergeSetOptions} but for the `remember()` shape\n   * ({@link RememberOptions} — no `expiresAt`).\n   */\n  protected mergeRememberOptions(\n    input: CacheTtl | RememberOptions,\n  ): CacheTtl | RememberOptions {\n    const options = normalizeToRememberOptions(input);\n    const ttl = options.ttl ?? this.defaults.ttl;\n    const tags = mergeTagSets(this.defaults.tags, options.tags);\n\n    const merged: RememberOptions = { ...options };\n\n    if (ttl !== undefined) {\n      merged.ttl = ttl;\n    }\n\n    if (tags !== undefined) {\n      merged.tags = tags;\n    }\n\n    return merged;\n  }\n\n  /**\n   * Convert the scope's default `ttl` (which may be a duration string) into\n   * seconds, for the few methods (`setMany`, `setNX`) that accept only a\n   * numeric ttl.\n   */\n  protected scopeTtlSeconds(): number | undefined {\n    if (this.defaults.ttl === undefined) {\n      return undefined;\n    }\n\n    return parseTtl(this.defaults.ttl);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDA,IAAa,cAAb,MAAa,YAA2C;;;;;CA6BtD,AAAO,YACL,QACA,QACA,WAAkC,CAAC,GACnC;EACA,KAAK,SAAS;EACd,KAAK,SAAS,cAAc,MAAM;EAClC,KAAK,WAAW;GACd,KAAK,SAAS;GACd,MAAM,SAAS,QAAQ,SAAS,KAAK,SAAS,IAAI,CAAC,GAAG,SAAS,IAAI,IAAI;EACzE;CACF;;;;;;;;;;CAWA,AAAO,UAAU,QAAgB,UAAiC,CAAC,GAAwB;EACzF,MAAM,cAAc,GAAG,KAAK,OAAO,GAAG,cAAc,MAAM;EAE1D,OAAO,IAAI,YAAY,KAAK,QAAQ,aAAa;GAC/C,KAAK,QAAQ,OAAO,KAAK,SAAS;GAClC,MAAM,aAAa,KAAK,SAAS,MAAM,QAAQ,IAAI;EACrD,CAAC;CACH;;;;;;CAOA,AAAO,KAAK,MAA2C;EACrD,OAAO,IAAI,kBAAkB,MAAM,IAAI;CACzC;;;;;;CAOA,AAAO,QAAuB;EAC5B,OAAO,KAAK,OAAO,gBAAgB,KAAK,MAAM;CAChD;;;;CAKA,AAAO,IAAa,KAAkC;EACpD,OAAO,KAAK,OAAO,IAAO,KAAK,UAAU,GAAG,CAAC;CAC/C;;;;CAKA,AAAO,IAAI,KAAiC;EAC1C,OAAO,KAAK,OAAO,IAAI,KAAK,UAAU,GAAG,CAAC;CAC5C;;;;CAKA,AAAO,KAAK,MAAkC;EAC5C,OAAO,KAAK,OAAO,KAAK,KAAK,KAAK,QAAQ,KAAK,UAAU,GAAG,CAAC,CAAC;CAChE;;;;CAKA,AAAO,KAAc,KAAkC;EACrD,OAAO,KAAK,OAAO,KAAQ,KAAK,UAAU,GAAG,CAAC;CAChD;;;;;;CAOA,AAAO,IACL,KACA,OACA,cACc;EACd,OAAO,KAAK,OAAO,IAAI,KAAK,UAAU,GAAG,GAAG,OAAO,KAAK,gBAAgB,YAAY,CAAC;CACvF;;;;;;CAOA,AAAO,QAAQ,OAA4B,KAA6B;EACtE,MAAM,SAA8B,CAAC;EAErC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAC7C,OAAO,KAAK,UAAU,GAAG,KAAK;EAGhC,OAAO,KAAK,OAAO,QAAQ,QAAQ,OAAO,KAAK,gBAAgB,CAAC;CAClE;;;;;CAMA,AAAO,MAAM,KAAe,OAAY,KAAgC;EACtE,IAAI,CAAC,KAAK,OAAO,OACf,MAAM,IAAI,MACR,0DAA0D,KAAK,OAAO,MACxE;EAGF,OAAO,KAAK,OAAO,MAAM,KAAK,UAAU,GAAG,GAAG,OAAO,OAAO,KAAK,gBAAgB,CAAC;CACpF;;;;;CAMA,AAAO,QAAiB,KAAe,OAAsB;EAC3D,OAAO,KAAK,OAAO,QAAW,KAAK,UAAU,GAAG,GAAG,KAAK;CAC1D;;;;CAKA,AAAO,OAAO,KAA8B;EAC1C,OAAO,KAAK,OAAO,OAAO,KAAK,UAAU,GAAG,CAAC;CAC/C;;;;;CAMA,AAAO,SACL,KACA,cACA,UACY;EACZ,OAAO,KAAK,OAAO,SACjB,KAAK,UAAU,GAAG,GAClB,KAAK,qBAAqB,YAAY,GACtC,QACF;CACF;;;;;;;CAQA,AAAO,IACL,KACA,SACA,UACY;EACZ,MAAM,SAA0B;GAC9B,GAAG;GACH,MAAM,aAAa,KAAK,SAAS,MAAM,QAAQ,IAAI;EACrD;EAEA,OAAO,KAAK,OAAO,IAAO,KAAK,UAAU,GAAG,GAAG,QAAQ,QAAQ;CACjE;;;;;CAMA,AAAO,UAAU,KAAe,OAAiC;EAC/D,OAAO,KAAK,OAAO,UAAU,KAAK,UAAU,GAAG,GAAG,KAAK;CACzD;;;;;CAMA,AAAO,UAAU,KAAe,OAAiC;EAC/D,OAAO,KAAK,OAAO,UAAU,KAAK,UAAU,GAAG,GAAG,KAAK;CACzD;;;;;;;CAQA,MAAa,OACX,KACA,IACA,SACmB;EACnB,MAAM,YAAY,KAAK,UAAU,GAAG;EAEpC,OAAO,KAAK,OAAO,OAAU,WAAW,IAAI,MAAM,KAAK,aAAa,WAAW,OAAO,CAAC;CACzF;;;;;CAMA,MAAa,MACX,KACA,SACA,SACY;EACZ,MAAM,YAAY,KAAK,UAAU,GAAG;EAEpC,OAAO,KAAK,OAAO,MAAS,WAAW,SAAS,MAAM,KAAK,aAAa,WAAW,OAAO,CAAC;CAC7F;;;;;CAMA,MAAc,aACZ,WACA,SAC6B;EAC7B,IAAI,SAAS,QAAQ,QACnB,OAAO,EAAE,KAAK,QAAQ,IAAI;EAG5B,IAAI,KAAK,SAAS,QAAQ,QACxB,OAAO,CAAC;EAGV,OAAQ,MAAM,KAAK,OAAO,IAAI,SAAS,IAAK,CAAC,IAAI,EAAE,KAAK,KAAK,SAAS,IAAI;CAC5E;;;;;CAMA,AAAO,KAAc,KAAqC;EACxD,OAAO,KAAK,OAAO,KAAQ,KAAK,UAAU,GAAG,CAAC;CAChD;;;;;CAMA,AAAO,KACL,KACA,cACA,IACyB;EACzB,IAAI,OAAO,iBAAiB,YAAY,iBAAiB,MAAM;GAC7D,MAAM,SAAsC;IAC1C,GAAG;IACH,KAAK,aAAa,OAAO,KAAK,SAAS,OAAO,aAAa;GAC7D;GAKA,OAAO,KAAK,OAAO,KAAQ,KAAK,UAAU,GAAG,GAAG,QAAQ,EAAE;EAC5D;EAEA,OAAO,KAAK,OAAO,KAAQ,KAAK,UAAU,GAAG,GAAG,cAAc,EAAE;CAClE;;;;;;;CAQA,MAAa,QACX,QACA,SAC+B;EAC/B,MAAM,OAAO,MAAM,KAAK,OAAO,QAAW,QAAQ,OAAO;EACzD,MAAM,eAAe,KAAK,OAAO,SAAS,KAAK,MAAM;EAErD,OAAO,KAAK,QACT,QAAQ,IAAI,QAAQ,gBAAgB,IAAI,IAAI,WAAW,eAAe,GAAG,CAC5E;CACF;;;;;;CAOA,AAAU,UAAU,KAAuB;EACzC,MAAM,YAAY,OAAO,QAAQ,WAAW,MAAM,cAAc,GAAG;EAEnE,IAAI,CAAC,WACH,OAAO,KAAK;EAGd,OAAO,GAAG,KAAK,OAAO,GAAG;CAC3B;;;;;;;CAQA,AAAU,gBACR,OAC6B;EAC7B,MAAM,UAAU,mBAAmB,KAAK;EACxC,MAAM,MACJ,QAAQ,QAAQ,QAAQ,cAAc,SAAY,KAAK,SAAS,MAAM;EACxE,MAAM,OAAO,aAAa,KAAK,SAAS,MAAM,QAAQ,IAAI;EAE1D,MAAM,SAA0B,EAAE,GAAG,QAAQ;EAE7C,IAAI,QAAQ,QACV,OAAO,MAAM;EAGf,IAAI,SAAS,QACX,OAAO,OAAO;EAGhB,OAAO;CACT;;;;;CAMA,AAAU,qBACR,OAC4B;EAC5B,MAAM,UAAU,2BAA2B,KAAK;EAChD,MAAM,MAAM,QAAQ,OAAO,KAAK,SAAS;EACzC,MAAM,OAAO,aAAa,KAAK,SAAS,MAAM,QAAQ,IAAI;EAE1D,MAAM,SAA0B,EAAE,GAAG,QAAQ;EAE7C,IAAI,QAAQ,QACV,OAAO,MAAM;EAGf,IAAI,SAAS,QACX,OAAO,OAAO;EAGhB,OAAO;CACT;;;;;;CAOA,AAAU,kBAAsC;EAC9C,IAAI,KAAK,SAAS,QAAQ,QACxB;EAGF,OAAO,SAAS,KAAK,SAAS,GAAG;CACnC;AACF"}
+{"version":3,"file":"scoped-cache.mjs","names":[],"sources":["../../../../../../../packages/cache/src/scoped-cache.ts"],"sourcesContent":["import { TaggedScopedCache } from \"./tagged-scoped-cache\";\nimport type {\n  CacheDriver,\n  CacheKey,\n  CacheListAccessor,\n  CacheNamespaceOptions,\n  CacheSetOptions,\n  CacheSimilarHit,\n  CacheSimilarOptions,\n  CacheSwrOptions,\n  CacheTtl,\n  LockOptions,\n  LockOutcome,\n  RememberOptions,\n  ScopedCacheContract,\n  TaggedScopedCacheContract,\n} from \"./types\";\nimport {\n  mergeTagSets,\n  normalizeToOptions,\n  normalizeToRememberOptions,\n  parseCacheKey,\n  parseTtl,\n} from \"./utils\";\n\n/**\n * Scoped view over a cache source. Returned by `cache.namespace(prefix, options?)`.\n *\n * **Role.** A `ScopedCache` is a stateless wrapper that prepends a fixed\n * prefix to every key and applies optional default `ttl` / `tags` to every\n * write. Stores nothing itself — every call forwards to the underlying\n * `source` (typically the `CacheManager`, but any `CacheDriver` works).\n *\n * **Responsibility.**\n * - Owns: prefix-prepending of keys, normalization of nested-scope prefixes,\n *   merging scope defaults into write options (`ttl`, `tags`), filtering\n *   `similar()` hits to its own scope, and exposing `.clear()` as a sugar\n *   for `removeNamespace(prefix)`.\n * - Does NOT own: actual storage, connection lifecycle, event listeners,\n *   driver selection, or tag-index bookkeeping (delegated to the source's\n *   tagged-cache machinery).\n *\n * Per-call options always win over scope defaults; tags merge additively\n * across (scope defaults + per-call) layers. Nested scopes inherit and may\n * override the parent's defaults — see {@link ScopedCache.namespace}.\n *\n * @example\n * const chat = cache.namespace(`chats.${id}`, { ttl: \"30d\" });\n *\n * await chat.set(\"messages.10\", msg);          // 30d default\n * await chat.set(\"draft\", d, { ttl: \"1h\" });   // per-call override\n * await chat.namespace(\"typing\", { ttl: \"5s\" }).set(\"user.42\", true);\n * await chat.clear();\n */\nexport class ScopedCache implements ScopedCacheContract {\n  /**\n   * Fully-qualified prefix prepended to every key handled by this scope.\n   * Normalized through {@link parseCacheKey} on construction so colon-form\n   * input (`\"chats:10\"`) and trailing dots compose cleanly with nested scopes.\n   */\n  public readonly prefix: string;\n\n  /**\n   * Underlying cache source. Public-readonly so co-located helpers\n   * (`TaggedScopedCache`) can delegate without ceremony — not part of the\n   * stable consumer API.\n   *\n   * @internal\n   */\n  public readonly source: CacheDriver<any, any>;\n\n  /**\n   * Defaults applied to every write through this scope. Per-call options\n   * override `ttl`; `tags` merge additively across layers.\n   *\n   * @internal\n   */\n  public readonly defaults: CacheNamespaceOptions;\n\n  /**\n   * Build a scope. Constructed via `cache.namespace(prefix, options)` —\n   * users never call this directly.\n   */\n  public constructor(\n    source: CacheDriver<any, any>,\n    prefix: string,\n    defaults: CacheNamespaceOptions = {},\n  ) {\n    this.source = source;\n    this.prefix = parseCacheKey(prefix);\n    this.defaults = {\n      ttl: defaults.ttl,\n      tags: defaults.tags && defaults.tags.length > 0 ? [...defaults.tags] : undefined,\n    };\n  }\n\n  /**\n   * Build a nested scope. The child's prefix is `parent.child`; child options\n   * override the parent's `ttl` and union into `tags`.\n   *\n   * @example\n   * const chat = cache.namespace(\"chats.10\", { ttl: \"30d\" });\n   * const typing = chat.namespace(\"typing\", { ttl: \"5s\" });\n   * // typing.prefix === \"chats.10.typing\"\n   */\n  public namespace(prefix: string, options: CacheNamespaceOptions = {}): ScopedCacheContract {\n    const childPrefix = `${this.prefix}.${parseCacheKey(prefix)}`;\n\n    return new ScopedCache(this.source, childPrefix, {\n      ttl: options.ttl ?? this.defaults.ttl,\n      tags: mergeTagSets(this.defaults.tags, options.tags),\n    });\n  }\n\n  /**\n   * Return a one-shot tagged write handle. The handle's tags merge additively\n   * with scope-level defaults — final tag list per write is the union of\n   * (scope tags + handle tags + per-call tags), deduped.\n   */\n  public tags(tags: string[]): TaggedScopedCacheContract {\n    return new TaggedScopedCache(this, tags);\n  }\n\n  /**\n   * Wipe every entry under this scope's prefix. Sugar over\n   * `source.removeNamespace(prefix)` — siblings outside the scope are\n   * untouched.\n   */\n  public clear(): Promise<void> {\n    return this.source.removeNamespace(this.prefix);\n  }\n\n  /**\n   * Read the value at the scoped key. Forwards to the source after prefixing.\n   */\n  public get<T = any>(key: CacheKey): Promise<T | null> {\n    return this.source.get<T>(this.scopedKey(key));\n  }\n\n  /**\n   * Check presence of the scoped key without fetching the value.\n   */\n  public has(key: CacheKey): Promise<boolean> {\n    return this.source.has(this.scopedKey(key));\n  }\n\n  /**\n   * Batch-read scoped keys. Each input key is prefixed before forwarding.\n   */\n  public many(keys: CacheKey[]): Promise<any[]> {\n    return this.source.many(keys.map((key) => this.scopedKey(key)));\n  }\n\n  /**\n   * Read-and-remove. Returns the value or `null`; the entry is gone after.\n   */\n  public pull<T = any>(key: CacheKey): Promise<T | null> {\n    return this.source.pull<T>(this.scopedKey(key));\n  }\n\n  /**\n   * Write the scoped key. Per-call `ttl`/`tags` win over scope defaults;\n   * `expiresAt` is preserved as-is (absolute deadlines are never overridden\n   * by the scope's relative-ttl default).\n   */\n  public set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any> {\n    return this.source.set(this.scopedKey(key), value, this.mergeSetOptions(ttlOrOptions));\n  }\n\n  /**\n   * Batch-write under the scope. Caller's positional `ttl` wins; otherwise\n   * the scope default is parsed to seconds (since `setMany` accepts only a\n   * numeric ttl).\n   */\n  public setMany(items: Record<string, any>, ttl?: number): Promise<void> {\n    const scoped: Record<string, any> = {};\n\n    for (const [key, value] of Object.entries(items)) {\n      scoped[this.scopedKey(key)] = value;\n    }\n\n    return this.source.setMany(scoped, ttl ?? this.scopeTtlSeconds());\n  }\n\n  /**\n   * Atomic create-or-skip on the scoped key. Throws when the underlying\n   * source has no `setNX` (driver-specific — Redis-only today).\n   */\n  public setNX(key: CacheKey, value: any, ttl?: number): Promise<boolean> {\n    if (!this.source.setNX) {\n      throw new Error(\n        `setNX is not supported by the underlying cache source: ${this.source.name}`,\n      );\n    }\n\n    return this.source.setNX(this.scopedKey(key), value, ttl ?? this.scopeTtlSeconds());\n  }\n\n  /**\n   * Permanent write (no expiration). Bypasses the scope's `ttl` default —\n   * `forever` always means forever, regardless of scope policy.\n   */\n  public forever<T = any>(key: CacheKey, value: T): Promise<T> {\n    return this.source.forever<T>(this.scopedKey(key), value);\n  }\n\n  /**\n   * Remove a single scoped key.\n   */\n  public remove(key: CacheKey): Promise<void> {\n    return this.source.remove(this.scopedKey(key));\n  }\n\n  /**\n   * Read-or-compute. Cache-miss writes pick up the scope's default `ttl`\n   * and `tags` unless the caller passed an options object that overrides.\n   */\n  public remember<T = any>(\n    key: CacheKey,\n    ttlOrOptions: CacheTtl | RememberOptions,\n    callback: () => Promise<T>,\n  ): Promise<T> {\n    return this.source.remember<T>(\n      this.scopedKey(key),\n      this.mergeRememberOptions(ttlOrOptions),\n      callback,\n    );\n  }\n\n  /**\n   * Stale-while-revalidate on the scoped key. Scope-level `tags` merge\n   * additively with `options.tags`; `freshTtl`/`staleTtl` always come from\n   * the caller (no scope-default precedence — the SWR shape is too\n   * specific to the call site to inherit).\n   */\n  public swr<T = any>(\n    key: CacheKey,\n    options: CacheSwrOptions,\n    callback: () => Promise<T>,\n  ): Promise<T> {\n    const merged: CacheSwrOptions = {\n      ...options,\n      tags: mergeTagSets(this.defaults.tags, options.tags),\n    };\n\n    return this.source.swr<T>(this.scopedKey(key), merged, callback);\n  }\n\n  /**\n   * Atomic counter increment on the scoped key. TTL is preserved by the\n   * underlying driver — scope ttl is only applied on first write via `set`.\n   */\n  public increment(key: CacheKey, value?: number): Promise<number> {\n    return this.source.increment(this.scopedKey(key), value);\n  }\n\n  /**\n   * Atomic counter decrement on the scoped key. See {@link increment} for\n   * TTL semantics.\n   */\n  public decrement(key: CacheKey, value?: number): Promise<number> {\n    return this.source.decrement(this.scopedKey(key), value);\n  }\n\n  /**\n   * Atomic read-modify-write. An explicit `options.ttl` always wins. Otherwise\n   * the scope's default `ttl` is applied only when the key does not exist yet;\n   * for an existing key no ttl is passed so the source preserves the entry's\n   * remaining TTL.\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    const scopedKey = this.scopedKey(key);\n\n    return this.source.update<T>(scopedKey, fn, await this.writeOptions(scopedKey, options));\n  }\n\n  /**\n   * Shallow-merge a partial object into the scoped entry. Same TTL semantics\n   * as {@link update}.\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 scopedKey = this.scopedKey(key);\n\n    return this.source.merge<T>(scopedKey, partial, await this.writeOptions(scopedKey, options));\n  }\n\n  /**\n   * Resolve the ttl options for update/merge: explicit ttl, else the scope\n   * default only for keys that don't exist yet, else nothing (keep remaining).\n   */\n  private async writeOptions(\n    scopedKey: CacheKey,\n    options?: { ttl?: CacheTtl },\n  ): Promise<{ ttl?: CacheTtl }> {\n    if (options?.ttl !== undefined) {\n      return { ttl: options.ttl };\n    }\n\n    if (this.defaults.ttl === undefined) {\n      return {};\n    }\n\n    return (await this.source.has(scopedKey)) ? {} : { ttl: this.defaults.ttl };\n  }\n\n  /**\n   * Return a list accessor bound to the scoped key. The accessor itself\n   * does its own read-mutate-write under the prefixed entry.\n   */\n  public list<T = any>(key: CacheKey): CacheListAccessor<T> {\n    return this.source.list<T>(this.scopedKey(key));\n  }\n\n  /**\n   * Acquire a distributed lock on the scoped key. Caller's TTL wins; when\n   * the options form omits `ttl`, the scope default fills in.\n   */\n  public lock<T>(\n    key: CacheKey,\n    ttlOrOptions: CacheTtl | Omit<LockOptions, \"driver\">,\n    fn: () => Promise<T>,\n  ): Promise<LockOutcome<T>> {\n    if (typeof ttlOrOptions === \"object\" && ttlOrOptions !== null) {\n      const merged: Omit<LockOptions, \"driver\"> = {\n        ...ttlOrOptions,\n        ttl: ttlOrOptions.ttl ?? this.defaults.ttl ?? ttlOrOptions.ttl,\n      };\n\n      // The third coalesce is intentional — when both caller and scope omit\n      // the TTL, we still pass the original (undefined) through so the source\n      // raises its own validation error rather than us swallowing it silently.\n      return this.source.lock<T>(this.scopedKey(key), merged, fn);\n    }\n\n    return this.source.lock<T>(this.scopedKey(key), ttlOrOptions, fn);\n  }\n\n  /**\n   * Similarity retrieval, scope-isolated. Hits whose keys fall outside this\n   * scope are filtered out before the result is returned. `topK` applies to\n   * the underlying retrieval — when the scope contains fewer than `topK`\n   * matches but other scopes do, the caller will see fewer hits than `topK`.\n   */\n  public async similar<T = any>(\n    vector: number[],\n    options: CacheSimilarOptions,\n  ): Promise<CacheSimilarHit<T>[]> {\n    const hits = await this.source.similar<T>(vector, options);\n    const parsedPrefix = this.source.parseKey(this.prefix);\n\n    return hits.filter(\n      (hit) => hit.key === parsedPrefix || hit.key.startsWith(parsedPrefix + \".\"),\n    );\n  }\n\n  /**\n   * Build the source-side key by prepending the scope prefix. Object keys\n   * are normalized via {@link parseCacheKey} first so they compose with the\n   * prefix as plain dot-strings.\n   */\n  protected scopedKey(key: CacheKey): string {\n    const keyString = typeof key === \"string\" ? key : parseCacheKey(key);\n\n    if (!keyString) {\n      return this.prefix;\n    }\n\n    return `${this.prefix}.${keyString}`;\n  }\n\n  /**\n   * Coerce the polymorphic 3rd `set` argument into a {@link CacheSetOptions}\n   * with scope defaults filled in. Per-call values always win; tags merge\n   * additively. `expiresAt` is preserved without injecting the scope's `ttl`\n   * default (absolute deadlines override relative ones).\n   */\n  protected mergeSetOptions(\n    input?: CacheTtl | CacheSetOptions,\n  ): CacheSetOptions | undefined {\n    const options = normalizeToOptions(input);\n    const ttl =\n      options.ttl ?? (options.expiresAt === undefined ? this.defaults.ttl : undefined);\n    const tags = mergeTagSets(this.defaults.tags, options.tags);\n\n    const merged: CacheSetOptions = { ...options };\n\n    if (ttl !== undefined) {\n      merged.ttl = ttl;\n    }\n\n    if (tags !== undefined) {\n      merged.tags = tags;\n    }\n\n    return merged;\n  }\n\n  /**\n   * Same merge as {@link mergeSetOptions} but for the `remember()` shape\n   * ({@link RememberOptions} — no `expiresAt`).\n   */\n  protected mergeRememberOptions(\n    input: CacheTtl | RememberOptions,\n  ): CacheTtl | RememberOptions {\n    const options = normalizeToRememberOptions(input);\n    const ttl = options.ttl ?? this.defaults.ttl;\n    const tags = mergeTagSets(this.defaults.tags, options.tags);\n\n    const merged: RememberOptions = { ...options };\n\n    if (ttl !== undefined) {\n      merged.ttl = ttl;\n    }\n\n    if (tags !== undefined) {\n      merged.tags = tags;\n    }\n\n    return merged;\n  }\n\n  /**\n   * Convert the scope's default `ttl` (which may be a duration string) into\n   * seconds, for the few methods (`setMany`, `setNX`) that accept only a\n   * numeric ttl.\n   */\n  protected scopeTtlSeconds(): number | undefined {\n    if (this.defaults.ttl === undefined) {\n      return undefined;\n    }\n\n    return parseTtl(this.defaults.ttl);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDA,IAAa,cAAb,MAAa,YAA2C;;;;;CA6BtD,AAAO,YACL,QACA,QACA,WAAkC,CAAC,GACnC;EACA,KAAK,SAAS;EACd,KAAK,SAAS,cAAc,MAAM;EAClC,KAAK,WAAW;GACd,KAAK,SAAS;GACd,MAAM,SAAS,QAAQ,SAAS,KAAK,SAAS,IAAI,CAAC,GAAG,SAAS,IAAI,IAAI;EACzE;CACF;;;;;;;;;;CAWA,AAAO,UAAU,QAAgB,UAAiC,CAAC,GAAwB;EACzF,MAAM,cAAc,GAAG,KAAK,OAAO,GAAG,cAAc,MAAM;EAE1D,OAAO,IAAI,YAAY,KAAK,QAAQ,aAAa;GAC/C,KAAK,QAAQ,OAAO,KAAK,SAAS;GAClC,MAAM,aAAa,KAAK,SAAS,MAAM,QAAQ,IAAI;EACrD,CAAC;CACH;;;;;;CAOA,AAAO,KAAK,MAA2C;EACrD,OAAO,IAAI,kBAAkB,MAAM,IAAI;CACzC;;;;;;CAOA,AAAO,QAAuB;EAC5B,OAAO,KAAK,OAAO,gBAAgB,KAAK,MAAM;CAChD;;;;CAKA,AAAO,IAAa,KAAkC;EACpD,OAAO,KAAK,OAAO,IAAO,KAAK,UAAU,GAAG,CAAC;CAC/C;;;;CAKA,AAAO,IAAI,KAAiC;EAC1C,OAAO,KAAK,OAAO,IAAI,KAAK,UAAU,GAAG,CAAC;CAC5C;;;;CAKA,AAAO,KAAK,MAAkC;EAC5C,OAAO,KAAK,OAAO,KAAK,KAAK,KAAK,QAAQ,KAAK,UAAU,GAAG,CAAC,CAAC;CAChE;;;;CAKA,AAAO,KAAc,KAAkC;EACrD,OAAO,KAAK,OAAO,KAAQ,KAAK,UAAU,GAAG,CAAC;CAChD;;;;;;CAOA,AAAO,IACL,KACA,OACA,cACc;EACd,OAAO,KAAK,OAAO,IAAI,KAAK,UAAU,GAAG,GAAG,OAAO,KAAK,gBAAgB,YAAY,CAAC;CACvF;;;;;;CAOA,AAAO,QAAQ,OAA4B,KAA6B;EACtE,MAAM,SAA8B,CAAC;EAErC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAC7C,OAAO,KAAK,UAAU,GAAG,KAAK;EAGhC,OAAO,KAAK,OAAO,QAAQ,QAAQ,OAAO,KAAK,gBAAgB,CAAC;CAClE;;;;;CAMA,AAAO,MAAM,KAAe,OAAY,KAAgC;EACtE,IAAI,CAAC,KAAK,OAAO,OACf,MAAM,IAAI,MACR,0DAA0D,KAAK,OAAO,MACxE;EAGF,OAAO,KAAK,OAAO,MAAM,KAAK,UAAU,GAAG,GAAG,OAAO,OAAO,KAAK,gBAAgB,CAAC;CACpF;;;;;CAMA,AAAO,QAAiB,KAAe,OAAsB;EAC3D,OAAO,KAAK,OAAO,QAAW,KAAK,UAAU,GAAG,GAAG,KAAK;CAC1D;;;;CAKA,AAAO,OAAO,KAA8B;EAC1C,OAAO,KAAK,OAAO,OAAO,KAAK,UAAU,GAAG,CAAC;CAC/C;;;;;CAMA,AAAO,SACL,KACA,cACA,UACY;EACZ,OAAO,KAAK,OAAO,SACjB,KAAK,UAAU,GAAG,GAClB,KAAK,qBAAqB,YAAY,GACtC,QACF;CACF;;;;;;;CAQA,AAAO,IACL,KACA,SACA,UACY;EACZ,MAAM,SAA0B;GAC9B,GAAG;GACH,MAAM,aAAa,KAAK,SAAS,MAAM,QAAQ,IAAI;EACrD;EAEA,OAAO,KAAK,OAAO,IAAO,KAAK,UAAU,GAAG,GAAG,QAAQ,QAAQ;CACjE;;;;;CAMA,AAAO,UAAU,KAAe,OAAiC;EAC/D,OAAO,KAAK,OAAO,UAAU,KAAK,UAAU,GAAG,GAAG,KAAK;CACzD;;;;;CAMA,AAAO,UAAU,KAAe,OAAiC;EAC/D,OAAO,KAAK,OAAO,UAAU,KAAK,UAAU,GAAG,GAAG,KAAK;CACzD;;;;;;;CAQA,MAAa,OACX,KACA,IACA,SACmB;EACnB,MAAM,YAAY,KAAK,UAAU,GAAG;EAEpC,OAAO,KAAK,OAAO,OAAU,WAAW,IAAI,MAAM,KAAK,aAAa,WAAW,OAAO,CAAC;CACzF;;;;;CAMA,MAAa,MACX,KACA,SACA,SACY;EACZ,MAAM,YAAY,KAAK,UAAU,GAAG;EAEpC,OAAO,KAAK,OAAO,MAAS,WAAW,SAAS,MAAM,KAAK,aAAa,WAAW,OAAO,CAAC;CAC7F;;;;;CAMA,MAAc,aACZ,WACA,SAC6B;EAC7B,IAAI,SAAS,QAAQ,QACnB,OAAO,EAAE,KAAK,QAAQ,IAAI;EAG5B,IAAI,KAAK,SAAS,QAAQ,QACxB,OAAO,CAAC;EAGV,OAAQ,MAAM,KAAK,OAAO,IAAI,SAAS,IAAK,CAAC,IAAI,EAAE,KAAK,KAAK,SAAS,IAAI;CAC5E;;;;;CAMA,AAAO,KAAc,KAAqC;EACxD,OAAO,KAAK,OAAO,KAAQ,KAAK,UAAU,GAAG,CAAC;CAChD;;;;;CAMA,AAAO,KACL,KACA,cACA,IACyB;EACzB,IAAI,OAAO,iBAAiB,YAAY,iBAAiB,MAAM;GAC7D,MAAM,SAAsC;IAC1C,GAAG;IACH,KAAK,aAAa,OAAO,KAAK,SAAS,OAAO,aAAa;GAC7D;GAKA,OAAO,KAAK,OAAO,KAAQ,KAAK,UAAU,GAAG,GAAG,QAAQ,EAAE;EAC5D;EAEA,OAAO,KAAK,OAAO,KAAQ,KAAK,UAAU,GAAG,GAAG,cAAc,EAAE;CAClE;;;;;;;CAQA,MAAa,QACX,QACA,SAC+B;EAC/B,MAAM,OAAO,MAAM,KAAK,OAAO,QAAW,QAAQ,OAAO;EACzD,MAAM,eAAe,KAAK,OAAO,SAAS,KAAK,MAAM;EAErD,OAAO,KAAK,QACT,QAAQ,IAAI,QAAQ,gBAAgB,IAAI,IAAI,WAAW,eAAe,GAAG,CAC5E;CACF;;;;;;CAOA,AAAU,UAAU,KAAuB;EACzC,MAAM,YAAY,OAAO,QAAQ,WAAW,MAAM,cAAc,GAAG;EAEnE,IAAI,CAAC,WACH,OAAO,KAAK;EAGd,OAAO,GAAG,KAAK,OAAO,GAAG;CAC3B;;;;;;;CAQA,AAAU,gBACR,OAC6B;EAC7B,MAAM,UAAU,mBAAmB,KAAK;EACxC,MAAM,MACJ,QAAQ,QAAQ,QAAQ,cAAc,SAAY,KAAK,SAAS,MAAM;EACxE,MAAM,OAAO,aAAa,KAAK,SAAS,MAAM,QAAQ,IAAI;EAE1D,MAAM,SAA0B,EAAE,GAAG,QAAQ;EAE7C,IAAI,QAAQ,QACV,OAAO,MAAM;EAGf,IAAI,SAAS,QACX,OAAO,OAAO;EAGhB,OAAO;CACT;;;;;CAMA,AAAU,qBACR,OAC4B;EAC5B,MAAM,UAAU,2BAA2B,KAAK;EAChD,MAAM,MAAM,QAAQ,OAAO,KAAK,SAAS;EACzC,MAAM,OAAO,aAAa,KAAK,SAAS,MAAM,QAAQ,IAAI;EAE1D,MAAM,SAA0B,EAAE,GAAG,QAAQ;EAE7C,IAAI,QAAQ,QACV,OAAO,MAAM;EAGf,IAAI,SAAS,QACX,OAAO,OAAO;EAGhB,OAAO;CACT;;;;;;CAOA,AAAU,kBAAsC;EAC9C,IAAI,KAAK,SAAS,QAAQ,QACxB;EAGF,OAAO,SAAS,KAAK,SAAS,GAAG;CACnC;AACF"}

package/esm/tagged-cache.d.mts

@@ -1,6 +1,6 @@
 import { CacheDriver, CacheKey, CacheSetOptions, CacheTtl, TaggedCacheDriver } from "./types.mjs";
 
-//#region ../cache/src/tagged-cache.d.ts
+//#region ../../packages/cache/src/tagged-cache.d.ts
 /**
  * Tagged Cache Wrapper
  * Wraps a cache driver to automatically manage tag relationships

package/esm/tagged-cache.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"tagged-cache.d.mts","names":[],"sources":["../../../../../../cache/src/tagged-cache.ts"],"mappings":";;;;;AAkBA;;cAAa,WAAA,YAAuB,iBAAA;EAShB;;;EAAA,UALR,SAAA;EAsC6B;;;EAAA,UAjC7B,MAAA,EAAQ,WAAA;EAqGyB;;;cAhGxB,IAAA,YAAgB,MAAA,EAAQ,WAAA;EAqJF;;;EAAA,UA7I/B,MAAA,CAAO,GAAA;EA+JW;;;EAAA,UAxJZ,cAAA,CAAe,GAAA,EAAK,QAAA,GAAW,OAAA;EA2KtB;;;;;;;;;EA9JZ,oBAAA,CAAqB,GAAA,EAAK,QAAA,GAAW,OAAA;EAyP3B;;;;EAAA,0BA1OG,sBAAA;EAgQgC;;;;;;EAAA,UAxP1C,QAAA,CAAS,MAAA,UAAgB,WAAA,WAAsB,OAAA;EAAA,UAgC/C,QAAA,CAAS,MAAA,UAAgB,OAAA,aAAoB,OAAA;EAAA,UAa7C,SAAA,CAAU,MAAA,WAAiB,OAAA;EAAA,UAQ3B,aAAA,CAAc,MAAA,UAAgB,OAAA,aAAoB,OAAA;EAAA,UAoBlD,aAAA,CAAc,MAAA,WAAiB,OAAA;EA5H5B;;;;;;;;;;EAAA,UA8IT,UAAA,CAAW,GAAA,EAAK,QAAA;EAlHQ;;;EAAA,UAyHlB,aAAA,IAAiB,OAAA,CAAQ,GAAA;EAlGhB;;;EAiHZ,GAAA,CACX,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EArFsB;;;EAgGZ,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAnFP;;;EA0Fb,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EAlFU;;;EA+FjC,UAAA,IAAc,OAAA;EA3EoB;;;EAAA,UA6G/B,cAAA,CAAe,UAAA,WAAqB,OAAA;EApFpC;;;;EA8FH,KAAA,IAAS,OAAA;EA9EpB;;;EAqFW,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAnF/B;;;EA0FW,QAAA,CACX,GAAA,EAAK,QAAA,EACL,GAAA,UACA,QAAA,QAAgB,OAAA,QACf,OAAA;EAlFc;;;EAkGJ,IAAA,CAAK,GAAA,EAAK,QAAA,GAAW,OAAA;EA3Fd;;;EA0GP,OAAA,CAAQ,GAAA,EAAK,QAAA,EAAU,KAAA,QAAa,OAAA;EA3DjC;;;EAkEH,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAoB,OAAA;EAxDpC;;;EAqET,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAoB,OAAA;AAAA"}
+{"version":3,"file":"tagged-cache.d.mts","names":[],"sources":["../../../../../../../packages/cache/src/tagged-cache.ts"],"mappings":";;;;;AAkBA;;cAAa,WAAA,YAAuB,iBAAA;EAShB;;;EAAA,UALR,SAAA;EAsC6B;;;EAAA,UAjC7B,MAAA,EAAQ,WAAA;EAqGyB;;;cAhGxB,IAAA,YAAgB,MAAA,EAAQ,WAAA;EAqJF;;;EAAA,UA7I/B,MAAA,CAAO,GAAA;EA+JW;;;EAAA,UAxJZ,cAAA,CAAe,GAAA,EAAK,QAAA,GAAW,OAAA;EA2KtB;;;;;;;;;EA9JZ,oBAAA,CAAqB,GAAA,EAAK,QAAA,GAAW,OAAA;EAyP3B;;;;EAAA,0BA1OG,sBAAA;EAgQgC;;;;;;EAAA,UAxP1C,QAAA,CAAS,MAAA,UAAgB,WAAA,WAAsB,OAAA;EAAA,UAgC/C,QAAA,CAAS,MAAA,UAAgB,OAAA,aAAoB,OAAA;EAAA,UAa7C,SAAA,CAAU,MAAA,WAAiB,OAAA;EAAA,UAQ3B,aAAA,CAAc,MAAA,UAAgB,OAAA,aAAoB,OAAA;EAAA,UAoBlD,aAAA,CAAc,MAAA,WAAiB,OAAA;EA5H5B;;;;;;;;;;EAAA,UA8IT,UAAA,CAAW,GAAA,EAAK,QAAA;EAlHQ;;;EAAA,UAyHlB,aAAA,IAAiB,OAAA,CAAQ,GAAA;EAlGhB;;;EAiHZ,GAAA,CACX,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EArFsB;;;EAgGZ,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAnFP;;;EA0Fb,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EAlFU;;;EA+FjC,UAAA,IAAc,OAAA;EA3EoB;;;EAAA,UA6G/B,cAAA,CAAe,UAAA,WAAqB,OAAA;EApFpC;;;;EA8FH,KAAA,IAAS,OAAA;EA9EpB;;;EAqFW,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAnF/B;;;EA0FW,QAAA,CACX,GAAA,EAAK,QAAA,EACL,GAAA,UACA,QAAA,QAAgB,OAAA,QACf,OAAA;EAlFc;;;EAkGJ,IAAA,CAAK,GAAA,EAAK,QAAA,GAAW,OAAA;EA3Fd;;;EA0GP,OAAA,CAAQ,GAAA,EAAK,QAAA,EAAU,KAAA,QAAa,OAAA;EA3DjC;;;EAkEH,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAoB,OAAA;EAxDpC;;;EAqET,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAoB,OAAA;AAAA"}

package/esm/tagged-cache.mjs

@@ -1,6 +1,6 @@
 import { parseCacheKey } from "./utils.mjs";
 
-//#region ../cache/src/tagged-cache.ts
+//#region ../../packages/cache/src/tagged-cache.ts
 /**
 * Tagged Cache Wrapper
 * Wraps a cache driver to automatically manage tag relationships

package/esm/tagged-cache.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"tagged-cache.mjs","names":[],"sources":["../../../../../../cache/src/tagged-cache.ts"],"sourcesContent":["import type {\n  CacheDriver,\n  CacheKey,\n  CacheSetOptions,\n  CacheTtl,\n  TaggedCacheDriver,\n} from \"./types\";\nimport { parseCacheKey } from \"./utils\";\n\n/** Implemented by `BaseCacheDriver`; a custom driver may not have it. */\ntype TagsInvalidatedEmitter = {\n  emitTagsInvalidated(data: { tags: string[]; keys: string[]; durationMs: number }): Promise<void>;\n};\n\n/**\n * Tagged Cache Wrapper\n * Wraps a cache driver to automatically manage tag relationships\n */\nexport class TaggedCache implements TaggedCacheDriver {\n  /**\n   * The tags associated with this tagged cache instance\n   */\n  protected cacheTags: string[];\n\n  /**\n   * The underlying cache driver\n   */\n  protected driver: CacheDriver<any, any>;\n\n  /**\n   * Constructor\n   */\n  public constructor(tags: string[], driver: CacheDriver<any, any>) {\n    this.cacheTags = tags;\n    this.driver = driver;\n  }\n\n  /**\n   * Get the tag key prefix for storing tag-key relationships\n   */\n  protected tagKey(tag: string): string {\n    return `cache:tags:${tag}`;\n  }\n\n  /**\n   * Store tag-key relationship\n   */\n  protected async storeTaggedKey(key: CacheKey): Promise<void> {\n    await this.storeTagRelationship(key);\n  }\n\n  /**\n   * Public alias of the tag-index writer. Called by `BaseCacheDriver.applyTags`\n   * when tags are passed inline through `CacheSetOptions.tags`.\n   *\n   * Takes the caller's key, never the driver-parsed one — see {@link indexedKey}.\n   *\n   * @internal — public for cross-class use within this package; not part of the\n   * stable consumer API.\n   */\n  public async storeTagRelationship(key: CacheKey): Promise<void> {\n    const indexedKey = this.indexedKey(key);\n\n    for (const tag of this.cacheTags) {\n      const tagKey = this.tagKey(tag);\n\n      await this.addToTag(tagKey, [indexedKey]);\n      await this.pruneTag(tagKey, indexedKey);\n    }\n  }\n\n  /**\n   * Upper bound on member-existence checks per tagged write, so pruning stays\n   * O(1) per write no matter how large an index grows.\n   */\n  protected static readonly PRUNE_CHECKS_PER_WRITE = 20;\n\n  /**\n   * Drop index members whose entry no longer exists (expired, evicted, or\n   * removed outside a tagged handle). Checks a random window of at most\n   * {@link PRUNE_CHECKS_PER_WRITE} members, so a long-lived index converges\n   * to its live members without any write paying for a full scan.\n   */\n  protected async pruneTag(tagKey: string, justWritten: string): Promise<void> {\n    const members = (await this.membersOf(tagKey)).filter((member) => member !== justWritten);\n\n    if (members.length === 0) {\n      return;\n    }\n\n    const limit = TaggedCache.PRUNE_CHECKS_PER_WRITE;\n    const start = members.length > limit ? Math.floor(Math.random() * members.length) : 0;\n    const window = Array.from(\n      { length: Math.min(limit, members.length) },\n      (_, index) => members[(start + index) % members.length]!,\n    );\n\n    const missing: string[] = [];\n\n    for (const member of window) {\n      if (!(await this.driver.has(member))) {\n        missing.push(member);\n      }\n    }\n\n    if (missing.length > 0) {\n      await this.removeFromTag(tagKey, missing);\n    }\n  }\n\n  // ------------------------------------------------------------\n  // Tag-index access: the driver's primitives when it has them, else\n  // the legacy get/set array (third-party drivers without primitives).\n  // ------------------------------------------------------------\n\n  protected async addToTag(tagKey: string, members: string[]): Promise<void> {\n    if (typeof this.driver.tagAdd === \"function\") {\n      return this.driver.tagAdd(tagKey, members);\n    }\n\n    const current = await this.legacyMembers(tagKey);\n    const merged = [...new Set([...current, ...members])];\n\n    if (merged.length !== current.length) {\n      await this.driver.set(tagKey, merged, Infinity);\n    }\n  }\n\n  protected async membersOf(tagKey: string): Promise<string[]> {\n    if (typeof this.driver.tagMembers === \"function\") {\n      return this.driver.tagMembers(tagKey);\n    }\n\n    return this.legacyMembers(tagKey);\n  }\n\n  protected async removeFromTag(tagKey: string, members: string[]): Promise<void> {\n    if (typeof this.driver.tagRemove === \"function\") {\n      return this.driver.tagRemove(tagKey, members);\n    }\n\n    const dropped = new Set(members);\n    const current = await this.legacyMembers(tagKey);\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.driver.remove(tagKey);\n    } else {\n      await this.driver.set(tagKey, kept, Infinity);\n    }\n  }\n\n  protected async legacyMembers(tagKey: string): Promise<string[]> {\n    const value = await this.driver.get(tagKey);\n\n    return Array.isArray(value)\n      ? value.filter((member): member is string => typeof member === \"string\")\n      : [];\n  }\n\n  /**\n   * The form a key takes inside a tag index: normalized but un-prefixed.\n   *\n   * The index is read back and deleted through `driver.remove(key)`, which\n   * applies `globalPrefix` itself — so the index must hold the key *before*\n   * the prefix, or invalidation would prefix it twice and delete nothing.\n   * With a function prefix, the current prefix is re-applied at invalidation\n   * time; the tag index key is resolved under that same prefix, so the two\n   * agree as long as the prefix is stable for a given request/tenant.\n   */\n  protected indexedKey(key: CacheKey): string {\n    return parseCacheKey(key);\n  }\n\n  /**\n   * Get all keys associated with tags\n   */\n  protected async getTaggedKeys(): Promise<Set<string>> {\n    const allKeys = new Set<string>();\n\n    for (const tag of this.cacheTags) {\n      for (const key of await this.membersOf(this.tagKey(tag))) {\n        allKeys.add(key);\n      }\n    }\n\n    return allKeys;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any> {\n    await this.driver.set(key, value, ttlOrOptions);\n\n    await this.storeTaggedKey(key);\n\n    return value;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async get(key: CacheKey): Promise<any | null> {\n    return this.driver.get(key);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async remove(key: CacheKey): Promise<void> {\n    const indexedKey = this.indexedKey(key);\n\n    // Remove the value\n    await this.driver.remove(key);\n\n    // Remove from all tag relationships\n    await this.detachFromTags(indexedKey);\n  }\n\n  /**\n   * Invalidate (clear) all keys associated with the current tags\n   */\n  public async invalidate(): Promise<void> {\n    const startedAt = performance.now();\n    const removed = new Set<string>();\n\n    for (const tag of this.cacheTags) {\n      const tagKey = this.tagKey(tag);\n      const members = await this.membersOf(tagKey);\n\n      // Remove the tagged entries — indexed un-prefixed, so `remove()` prefixes once\n      for (const member of members) {\n        await this.driver.remove(member);\n        removed.add(member);\n      }\n\n      // Remove exactly the members read above rather than dropping the whole\n      // index: a key tagged concurrently (after the read) keeps its entry in\n      // the index, so a later invalidate still reaches it.\n      await this.removeFromTag(tagKey, members);\n    }\n\n    // Drivers built on `BaseCacheDriver` emit `invalidated`; a custom driver\n    // without the method simply emits nothing.\n    const driver = this.driver as Partial<TagsInvalidatedEmitter>;\n\n    await driver.emitTagsInvalidated?.({\n      tags: [...this.cacheTags],\n      keys: [...removed],\n      durationMs: performance.now() - startedAt,\n    });\n  }\n\n  /**\n   * Remove `indexedKey` from every tag of this handle.\n   */\n  protected async detachFromTags(indexedKey: string): Promise<void> {\n    for (const tag of this.cacheTags) {\n      await this.removeFromTag(this.tagKey(tag), [indexedKey]);\n    }\n  }\n\n  /**\n   * Flush all keys associated with the current tags\n   * @deprecated Use invalidate() instead for better semantics\n   */\n  public async flush(): Promise<void> {\n    return this.invalidate();\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async has(key: CacheKey): Promise<boolean> {\n    return this.driver.has(key);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async remember(\n    key: CacheKey,\n    ttl: number,\n    callback: () => Promise<any>,\n  ): Promise<any> {\n    const value = await this.get(key);\n\n    if (value !== null) {\n      return value;\n    }\n\n    const result = await callback();\n    await this.set(key, result, ttl);\n\n    return result;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async pull(key: CacheKey): Promise<any | null> {\n    // The driver's own `pull` (atomic on redis / pg / in-process drivers)\n    // hands the value out once; then the key leaves this handle's tags.\n    const value = await this.driver.pull(key);\n\n    if (value !== null) {\n      await this.detachFromTags(this.indexedKey(key));\n    }\n\n    return value;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async forever(key: CacheKey, value: any): Promise<any> {\n    return this.set(key, value, Infinity);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async increment(key: CacheKey, value: number = 1): Promise<number> {\n    // The driver's atomic increment (INCRBY / pg upsert / synchronous\n    // in-process), then record the tag relationship.\n    const newValue = await this.driver.increment(key, value);\n\n    await this.storeTaggedKey(key);\n\n    return newValue;\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"],"mappings":";;;;;;;AAkBA,IAAa,cAAb,MAAa,YAAyC;;;;CAcpD,AAAO,YAAY,MAAgB,QAA+B;EAChE,KAAK,YAAY;EACjB,KAAK,SAAS;CAChB;;;;CAKA,AAAU,OAAO,KAAqB;EACpC,OAAO,cAAc;CACvB;;;;CAKA,MAAgB,eAAe,KAA8B;EAC3D,MAAM,KAAK,qBAAqB,GAAG;CACrC;;;;;;;;;;CAWA,MAAa,qBAAqB,KAA8B;EAC9D,MAAM,aAAa,KAAK,WAAW,GAAG;EAEtC,KAAK,MAAM,OAAO,KAAK,WAAW;GAChC,MAAM,SAAS,KAAK,OAAO,GAAG;GAE9B,MAAM,KAAK,SAAS,QAAQ,CAAC,UAAU,CAAC;GACxC,MAAM,KAAK,SAAS,QAAQ,UAAU;EACxC;CACF;;gCAMmD;;;;;;;;CAQnD,MAAgB,SAAS,QAAgB,aAAoC;EAC3E,MAAM,WAAW,MAAM,KAAK,UAAU,MAAM,EAAC,CAAE,QAAQ,WAAW,WAAW,WAAW;EAExF,IAAI,QAAQ,WAAW,GACrB;EAGF,MAAM,QAAQ,YAAY;EAC1B,MAAM,QAAQ,QAAQ,SAAS,QAAQ,KAAK,MAAM,KAAK,OAAO,IAAI,QAAQ,MAAM,IAAI;EACpF,MAAM,SAAS,MAAM,KACnB,EAAE,QAAQ,KAAK,IAAI,OAAO,QAAQ,MAAM,EAAE,IACzC,GAAG,UAAU,SAAS,QAAQ,SAAS,QAAQ,OAClD;EAEA,MAAM,UAAoB,CAAC;EAE3B,KAAK,MAAM,UAAU,QACnB,IAAI,CAAE,MAAM,KAAK,OAAO,IAAI,MAAM,GAChC,QAAQ,KAAK,MAAM;EAIvB,IAAI,QAAQ,SAAS,GACnB,MAAM,KAAK,cAAc,QAAQ,OAAO;CAE5C;CAOA,MAAgB,SAAS,QAAgB,SAAkC;EACzE,IAAI,OAAO,KAAK,OAAO,WAAW,YAChC,OAAO,KAAK,OAAO,OAAO,QAAQ,OAAO;EAG3C,MAAM,UAAU,MAAM,KAAK,cAAc,MAAM;EAC/C,MAAM,SAAS,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,SAAS,GAAG,OAAO,CAAC,CAAC;EAEpD,IAAI,OAAO,WAAW,QAAQ,QAC5B,MAAM,KAAK,OAAO,IAAI,QAAQ,QAAQ,QAAQ;CAElD;CAEA,MAAgB,UAAU,QAAmC;EAC3D,IAAI,OAAO,KAAK,OAAO,eAAe,YACpC,OAAO,KAAK,OAAO,WAAW,MAAM;EAGtC,OAAO,KAAK,cAAc,MAAM;CAClC;CAEA,MAAgB,cAAc,QAAgB,SAAkC;EAC9E,IAAI,OAAO,KAAK,OAAO,cAAc,YACnC,OAAO,KAAK,OAAO,UAAU,QAAQ,OAAO;EAG9C,MAAM,UAAU,IAAI,IAAI,OAAO;EAC/B,MAAM,UAAU,MAAM,KAAK,cAAc,MAAM;EAC/C,MAAM,OAAO,QAAQ,QAAQ,WAAW,CAAC,QAAQ,IAAI,MAAM,CAAC;EAE5D,IAAI,KAAK,WAAW,QAAQ,QAC1B;EAGF,IAAI,KAAK,WAAW,GAClB,MAAM,KAAK,OAAO,OAAO,MAAM;OAE/B,MAAM,KAAK,OAAO,IAAI,QAAQ,MAAM,QAAQ;CAEhD;CAEA,MAAgB,cAAc,QAAmC;EAC/D,MAAM,QAAQ,MAAM,KAAK,OAAO,IAAI,MAAM;EAE1C,OAAO,MAAM,QAAQ,KAAK,IACtB,MAAM,QAAQ,WAA6B,OAAO,WAAW,QAAQ,IACrE,CAAC;CACP;;;;;;;;;;;CAYA,AAAU,WAAW,KAAuB;EAC1C,OAAO,cAAc,GAAG;CAC1B;;;;CAKA,MAAgB,gBAAsC;EACpD,MAAM,0BAAU,IAAI,IAAY;EAEhC,KAAK,MAAM,OAAO,KAAK,WACrB,KAAK,MAAM,OAAO,MAAM,KAAK,UAAU,KAAK,OAAO,GAAG,CAAC,GACrD,QAAQ,IAAI,GAAG;EAInB,OAAO;CACT;;;;CAKA,MAAa,IACX,KACA,OACA,cACc;EACd,MAAM,KAAK,OAAO,IAAI,KAAK,OAAO,YAAY;EAE9C,MAAM,KAAK,eAAe,GAAG;EAE7B,OAAO;CACT;;;;CAKA,MAAa,IAAI,KAAoC;EACnD,OAAO,KAAK,OAAO,IAAI,GAAG;CAC5B;;;;CAKA,MAAa,OAAO,KAA8B;EAChD,MAAM,aAAa,KAAK,WAAW,GAAG;EAGtC,MAAM,KAAK,OAAO,OAAO,GAAG;EAG5B,MAAM,KAAK,eAAe,UAAU;CACtC;;;;CAKA,MAAa,aAA4B;EACvC,MAAM,YAAY,YAAY,IAAI;EAClC,MAAM,0BAAU,IAAI,IAAY;EAEhC,KAAK,MAAM,OAAO,KAAK,WAAW;GAChC,MAAM,SAAS,KAAK,OAAO,GAAG;GAC9B,MAAM,UAAU,MAAM,KAAK,UAAU,MAAM;GAG3C,KAAK,MAAM,UAAU,SAAS;IAC5B,MAAM,KAAK,OAAO,OAAO,MAAM;IAC/B,QAAQ,IAAI,MAAM;GACpB;GAKA,MAAM,KAAK,cAAc,QAAQ,OAAO;EAC1C;EAMA,MAFe,KAAK,OAEP,sBAAsB;GACjC,MAAM,CAAC,GAAG,KAAK,SAAS;GACxB,MAAM,CAAC,GAAG,OAAO;GACjB,YAAY,YAAY,IAAI,IAAI;EAClC,CAAC;CACH;;;;CAKA,MAAgB,eAAe,YAAmC;EAChE,KAAK,MAAM,OAAO,KAAK,WACrB,MAAM,KAAK,cAAc,KAAK,OAAO,GAAG,GAAG,CAAC,UAAU,CAAC;CAE3D;;;;;CAMA,MAAa,QAAuB;EAClC,OAAO,KAAK,WAAW;CACzB;;;;CAKA,MAAa,IAAI,KAAiC;EAChD,OAAO,KAAK,OAAO,IAAI,GAAG;CAC5B;;;;CAKA,MAAa,SACX,KACA,KACA,UACc;EACd,MAAM,QAAQ,MAAM,KAAK,IAAI,GAAG;EAEhC,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,SAAS,MAAM,SAAS;EAC9B,MAAM,KAAK,IAAI,KAAK,QAAQ,GAAG;EAE/B,OAAO;CACT;;;;CAKA,MAAa,KAAK,KAAoC;EAGpD,MAAM,QAAQ,MAAM,KAAK,OAAO,KAAK,GAAG;EAExC,IAAI,UAAU,MACZ,MAAM,KAAK,eAAe,KAAK,WAAW,GAAG,CAAC;EAGhD,OAAO;CACT;;;;CAKA,MAAa,QAAQ,KAAe,OAA0B;EAC5D,OAAO,KAAK,IAAI,KAAK,OAAO,QAAQ;CACtC;;;;CAKA,MAAa,UAAU,KAAe,QAAgB,GAAoB;EAGxE,MAAM,WAAW,MAAM,KAAK,OAAO,UAAU,KAAK,KAAK;EAEvD,MAAM,KAAK,eAAe,GAAG;EAE7B,OAAO;CACT;;;;CAKA,MAAa,UAAU,KAAe,QAAgB,GAAoB;EACxE,OAAO,KAAK,UAAU,KAAK,CAAC,KAAK;CACnC;AACF"}
+{"version":3,"file":"tagged-cache.mjs","names":[],"sources":["../../../../../../../packages/cache/src/tagged-cache.ts"],"sourcesContent":["import type {\n  CacheDriver,\n  CacheKey,\n  CacheSetOptions,\n  CacheTtl,\n  TaggedCacheDriver,\n} from \"./types\";\nimport { parseCacheKey } from \"./utils\";\n\n/** Implemented by `BaseCacheDriver`; a custom driver may not have it. */\ntype TagsInvalidatedEmitter = {\n  emitTagsInvalidated(data: { tags: string[]; keys: string[]; durationMs: number }): Promise<void>;\n};\n\n/**\n * Tagged Cache Wrapper\n * Wraps a cache driver to automatically manage tag relationships\n */\nexport class TaggedCache implements TaggedCacheDriver {\n  /**\n   * The tags associated with this tagged cache instance\n   */\n  protected cacheTags: string[];\n\n  /**\n   * The underlying cache driver\n   */\n  protected driver: CacheDriver<any, any>;\n\n  /**\n   * Constructor\n   */\n  public constructor(tags: string[], driver: CacheDriver<any, any>) {\n    this.cacheTags = tags;\n    this.driver = driver;\n  }\n\n  /**\n   * Get the tag key prefix for storing tag-key relationships\n   */\n  protected tagKey(tag: string): string {\n    return `cache:tags:${tag}`;\n  }\n\n  /**\n   * Store tag-key relationship\n   */\n  protected async storeTaggedKey(key: CacheKey): Promise<void> {\n    await this.storeTagRelationship(key);\n  }\n\n  /**\n   * Public alias of the tag-index writer. Called by `BaseCacheDriver.applyTags`\n   * when tags are passed inline through `CacheSetOptions.tags`.\n   *\n   * Takes the caller's key, never the driver-parsed one — see {@link indexedKey}.\n   *\n   * @internal — public for cross-class use within this package; not part of the\n   * stable consumer API.\n   */\n  public async storeTagRelationship(key: CacheKey): Promise<void> {\n    const indexedKey = this.indexedKey(key);\n\n    for (const tag of this.cacheTags) {\n      const tagKey = this.tagKey(tag);\n\n      await this.addToTag(tagKey, [indexedKey]);\n      await this.pruneTag(tagKey, indexedKey);\n    }\n  }\n\n  /**\n   * Upper bound on member-existence checks per tagged write, so pruning stays\n   * O(1) per write no matter how large an index grows.\n   */\n  protected static readonly PRUNE_CHECKS_PER_WRITE = 20;\n\n  /**\n   * Drop index members whose entry no longer exists (expired, evicted, or\n   * removed outside a tagged handle). Checks a random window of at most\n   * {@link PRUNE_CHECKS_PER_WRITE} members, so a long-lived index converges\n   * to its live members without any write paying for a full scan.\n   */\n  protected async pruneTag(tagKey: string, justWritten: string): Promise<void> {\n    const members = (await this.membersOf(tagKey)).filter((member) => member !== justWritten);\n\n    if (members.length === 0) {\n      return;\n    }\n\n    const limit = TaggedCache.PRUNE_CHECKS_PER_WRITE;\n    const start = members.length > limit ? Math.floor(Math.random() * members.length) : 0;\n    const window = Array.from(\n      { length: Math.min(limit, members.length) },\n      (_, index) => members[(start + index) % members.length]!,\n    );\n\n    const missing: string[] = [];\n\n    for (const member of window) {\n      if (!(await this.driver.has(member))) {\n        missing.push(member);\n      }\n    }\n\n    if (missing.length > 0) {\n      await this.removeFromTag(tagKey, missing);\n    }\n  }\n\n  // ------------------------------------------------------------\n  // Tag-index access: the driver's primitives when it has them, else\n  // the legacy get/set array (third-party drivers without primitives).\n  // ------------------------------------------------------------\n\n  protected async addToTag(tagKey: string, members: string[]): Promise<void> {\n    if (typeof this.driver.tagAdd === \"function\") {\n      return this.driver.tagAdd(tagKey, members);\n    }\n\n    const current = await this.legacyMembers(tagKey);\n    const merged = [...new Set([...current, ...members])];\n\n    if (merged.length !== current.length) {\n      await this.driver.set(tagKey, merged, Infinity);\n    }\n  }\n\n  protected async membersOf(tagKey: string): Promise<string[]> {\n    if (typeof this.driver.tagMembers === \"function\") {\n      return this.driver.tagMembers(tagKey);\n    }\n\n    return this.legacyMembers(tagKey);\n  }\n\n  protected async removeFromTag(tagKey: string, members: string[]): Promise<void> {\n    if (typeof this.driver.tagRemove === \"function\") {\n      return this.driver.tagRemove(tagKey, members);\n    }\n\n    const dropped = new Set(members);\n    const current = await this.legacyMembers(tagKey);\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.driver.remove(tagKey);\n    } else {\n      await this.driver.set(tagKey, kept, Infinity);\n    }\n  }\n\n  protected async legacyMembers(tagKey: string): Promise<string[]> {\n    const value = await this.driver.get(tagKey);\n\n    return Array.isArray(value)\n      ? value.filter((member): member is string => typeof member === \"string\")\n      : [];\n  }\n\n  /**\n   * The form a key takes inside a tag index: normalized but un-prefixed.\n   *\n   * The index is read back and deleted through `driver.remove(key)`, which\n   * applies `globalPrefix` itself — so the index must hold the key *before*\n   * the prefix, or invalidation would prefix it twice and delete nothing.\n   * With a function prefix, the current prefix is re-applied at invalidation\n   * time; the tag index key is resolved under that same prefix, so the two\n   * agree as long as the prefix is stable for a given request/tenant.\n   */\n  protected indexedKey(key: CacheKey): string {\n    return parseCacheKey(key);\n  }\n\n  /**\n   * Get all keys associated with tags\n   */\n  protected async getTaggedKeys(): Promise<Set<string>> {\n    const allKeys = new Set<string>();\n\n    for (const tag of this.cacheTags) {\n      for (const key of await this.membersOf(this.tagKey(tag))) {\n        allKeys.add(key);\n      }\n    }\n\n    return allKeys;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any> {\n    await this.driver.set(key, value, ttlOrOptions);\n\n    await this.storeTaggedKey(key);\n\n    return value;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async get(key: CacheKey): Promise<any | null> {\n    return this.driver.get(key);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async remove(key: CacheKey): Promise<void> {\n    const indexedKey = this.indexedKey(key);\n\n    // Remove the value\n    await this.driver.remove(key);\n\n    // Remove from all tag relationships\n    await this.detachFromTags(indexedKey);\n  }\n\n  /**\n   * Invalidate (clear) all keys associated with the current tags\n   */\n  public async invalidate(): Promise<void> {\n    const startedAt = performance.now();\n    const removed = new Set<string>();\n\n    for (const tag of this.cacheTags) {\n      const tagKey = this.tagKey(tag);\n      const members = await this.membersOf(tagKey);\n\n      // Remove the tagged entries — indexed un-prefixed, so `remove()` prefixes once\n      for (const member of members) {\n        await this.driver.remove(member);\n        removed.add(member);\n      }\n\n      // Remove exactly the members read above rather than dropping the whole\n      // index: a key tagged concurrently (after the read) keeps its entry in\n      // the index, so a later invalidate still reaches it.\n      await this.removeFromTag(tagKey, members);\n    }\n\n    // Drivers built on `BaseCacheDriver` emit `invalidated`; a custom driver\n    // without the method simply emits nothing.\n    const driver = this.driver as Partial<TagsInvalidatedEmitter>;\n\n    await driver.emitTagsInvalidated?.({\n      tags: [...this.cacheTags],\n      keys: [...removed],\n      durationMs: performance.now() - startedAt,\n    });\n  }\n\n  /**\n   * Remove `indexedKey` from every tag of this handle.\n   */\n  protected async detachFromTags(indexedKey: string): Promise<void> {\n    for (const tag of this.cacheTags) {\n      await this.removeFromTag(this.tagKey(tag), [indexedKey]);\n    }\n  }\n\n  /**\n   * Flush all keys associated with the current tags\n   * @deprecated Use invalidate() instead for better semantics\n   */\n  public async flush(): Promise<void> {\n    return this.invalidate();\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async has(key: CacheKey): Promise<boolean> {\n    return this.driver.has(key);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async remember(\n    key: CacheKey,\n    ttl: number,\n    callback: () => Promise<any>,\n  ): Promise<any> {\n    const value = await this.get(key);\n\n    if (value !== null) {\n      return value;\n    }\n\n    const result = await callback();\n    await this.set(key, result, ttl);\n\n    return result;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async pull(key: CacheKey): Promise<any | null> {\n    // The driver's own `pull` (atomic on redis / pg / in-process drivers)\n    // hands the value out once; then the key leaves this handle's tags.\n    const value = await this.driver.pull(key);\n\n    if (value !== null) {\n      await this.detachFromTags(this.indexedKey(key));\n    }\n\n    return value;\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async forever(key: CacheKey, value: any): Promise<any> {\n    return this.set(key, value, Infinity);\n  }\n\n  /**\n   * {@inheritdoc}\n   */\n  public async increment(key: CacheKey, value: number = 1): Promise<number> {\n    // The driver's atomic increment (INCRBY / pg upsert / synchronous\n    // in-process), then record the tag relationship.\n    const newValue = await this.driver.increment(key, value);\n\n    await this.storeTaggedKey(key);\n\n    return newValue;\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"],"mappings":";;;;;;;AAkBA,IAAa,cAAb,MAAa,YAAyC;;;;CAcpD,AAAO,YAAY,MAAgB,QAA+B;EAChE,KAAK,YAAY;EACjB,KAAK,SAAS;CAChB;;;;CAKA,AAAU,OAAO,KAAqB;EACpC,OAAO,cAAc;CACvB;;;;CAKA,MAAgB,eAAe,KAA8B;EAC3D,MAAM,KAAK,qBAAqB,GAAG;CACrC;;;;;;;;;;CAWA,MAAa,qBAAqB,KAA8B;EAC9D,MAAM,aAAa,KAAK,WAAW,GAAG;EAEtC,KAAK,MAAM,OAAO,KAAK,WAAW;GAChC,MAAM,SAAS,KAAK,OAAO,GAAG;GAE9B,MAAM,KAAK,SAAS,QAAQ,CAAC,UAAU,CAAC;GACxC,MAAM,KAAK,SAAS,QAAQ,UAAU;EACxC;CACF;;gCAMmD;;;;;;;;CAQnD,MAAgB,SAAS,QAAgB,aAAoC;EAC3E,MAAM,WAAW,MAAM,KAAK,UAAU,MAAM,EAAC,CAAE,QAAQ,WAAW,WAAW,WAAW;EAExF,IAAI,QAAQ,WAAW,GACrB;EAGF,MAAM,QAAQ,YAAY;EAC1B,MAAM,QAAQ,QAAQ,SAAS,QAAQ,KAAK,MAAM,KAAK,OAAO,IAAI,QAAQ,MAAM,IAAI;EACpF,MAAM,SAAS,MAAM,KACnB,EAAE,QAAQ,KAAK,IAAI,OAAO,QAAQ,MAAM,EAAE,IACzC,GAAG,UAAU,SAAS,QAAQ,SAAS,QAAQ,OAClD;EAEA,MAAM,UAAoB,CAAC;EAE3B,KAAK,MAAM,UAAU,QACnB,IAAI,CAAE,MAAM,KAAK,OAAO,IAAI,MAAM,GAChC,QAAQ,KAAK,MAAM;EAIvB,IAAI,QAAQ,SAAS,GACnB,MAAM,KAAK,cAAc,QAAQ,OAAO;CAE5C;CAOA,MAAgB,SAAS,QAAgB,SAAkC;EACzE,IAAI,OAAO,KAAK,OAAO,WAAW,YAChC,OAAO,KAAK,OAAO,OAAO,QAAQ,OAAO;EAG3C,MAAM,UAAU,MAAM,KAAK,cAAc,MAAM;EAC/C,MAAM,SAAS,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,SAAS,GAAG,OAAO,CAAC,CAAC;EAEpD,IAAI,OAAO,WAAW,QAAQ,QAC5B,MAAM,KAAK,OAAO,IAAI,QAAQ,QAAQ,QAAQ;CAElD;CAEA,MAAgB,UAAU,QAAmC;EAC3D,IAAI,OAAO,KAAK,OAAO,eAAe,YACpC,OAAO,KAAK,OAAO,WAAW,MAAM;EAGtC,OAAO,KAAK,cAAc,MAAM;CAClC;CAEA,MAAgB,cAAc,QAAgB,SAAkC;EAC9E,IAAI,OAAO,KAAK,OAAO,cAAc,YACnC,OAAO,KAAK,OAAO,UAAU,QAAQ,OAAO;EAG9C,MAAM,UAAU,IAAI,IAAI,OAAO;EAC/B,MAAM,UAAU,MAAM,KAAK,cAAc,MAAM;EAC/C,MAAM,OAAO,QAAQ,QAAQ,WAAW,CAAC,QAAQ,IAAI,MAAM,CAAC;EAE5D,IAAI,KAAK,WAAW,QAAQ,QAC1B;EAGF,IAAI,KAAK,WAAW,GAClB,MAAM,KAAK,OAAO,OAAO,MAAM;OAE/B,MAAM,KAAK,OAAO,IAAI,QAAQ,MAAM,QAAQ;CAEhD;CAEA,MAAgB,cAAc,QAAmC;EAC/D,MAAM,QAAQ,MAAM,KAAK,OAAO,IAAI,MAAM;EAE1C,OAAO,MAAM,QAAQ,KAAK,IACtB,MAAM,QAAQ,WAA6B,OAAO,WAAW,QAAQ,IACrE,CAAC;CACP;;;;;;;;;;;CAYA,AAAU,WAAW,KAAuB;EAC1C,OAAO,cAAc,GAAG;CAC1B;;;;CAKA,MAAgB,gBAAsC;EACpD,MAAM,0BAAU,IAAI,IAAY;EAEhC,KAAK,MAAM,OAAO,KAAK,WACrB,KAAK,MAAM,OAAO,MAAM,KAAK,UAAU,KAAK,OAAO,GAAG,CAAC,GACrD,QAAQ,IAAI,GAAG;EAInB,OAAO;CACT;;;;CAKA,MAAa,IACX,KACA,OACA,cACc;EACd,MAAM,KAAK,OAAO,IAAI,KAAK,OAAO,YAAY;EAE9C,MAAM,KAAK,eAAe,GAAG;EAE7B,OAAO;CACT;;;;CAKA,MAAa,IAAI,KAAoC;EACnD,OAAO,KAAK,OAAO,IAAI,GAAG;CAC5B;;;;CAKA,MAAa,OAAO,KAA8B;EAChD,MAAM,aAAa,KAAK,WAAW,GAAG;EAGtC,MAAM,KAAK,OAAO,OAAO,GAAG;EAG5B,MAAM,KAAK,eAAe,UAAU;CACtC;;;;CAKA,MAAa,aAA4B;EACvC,MAAM,YAAY,YAAY,IAAI;EAClC,MAAM,0BAAU,IAAI,IAAY;EAEhC,KAAK,MAAM,OAAO,KAAK,WAAW;GAChC,MAAM,SAAS,KAAK,OAAO,GAAG;GAC9B,MAAM,UAAU,MAAM,KAAK,UAAU,MAAM;GAG3C,KAAK,MAAM,UAAU,SAAS;IAC5B,MAAM,KAAK,OAAO,OAAO,MAAM;IAC/B,QAAQ,IAAI,MAAM;GACpB;GAKA,MAAM,KAAK,cAAc,QAAQ,OAAO;EAC1C;EAMA,MAFe,KAAK,OAEP,sBAAsB;GACjC,MAAM,CAAC,GAAG,KAAK,SAAS;GACxB,MAAM,CAAC,GAAG,OAAO;GACjB,YAAY,YAAY,IAAI,IAAI;EAClC,CAAC;CACH;;;;CAKA,MAAgB,eAAe,YAAmC;EAChE,KAAK,MAAM,OAAO,KAAK,WACrB,MAAM,KAAK,cAAc,KAAK,OAAO,GAAG,GAAG,CAAC,UAAU,CAAC;CAE3D;;;;;CAMA,MAAa,QAAuB;EAClC,OAAO,KAAK,WAAW;CACzB;;;;CAKA,MAAa,IAAI,KAAiC;EAChD,OAAO,KAAK,OAAO,IAAI,GAAG;CAC5B;;;;CAKA,MAAa,SACX,KACA,KACA,UACc;EACd,MAAM,QAAQ,MAAM,KAAK,IAAI,GAAG;EAEhC,IAAI,UAAU,MACZ,OAAO;EAGT,MAAM,SAAS,MAAM,SAAS;EAC9B,MAAM,KAAK,IAAI,KAAK,QAAQ,GAAG;EAE/B,OAAO;CACT;;;;CAKA,MAAa,KAAK,KAAoC;EAGpD,MAAM,QAAQ,MAAM,KAAK,OAAO,KAAK,GAAG;EAExC,IAAI,UAAU,MACZ,MAAM,KAAK,eAAe,KAAK,WAAW,GAAG,CAAC;EAGhD,OAAO;CACT;;;;CAKA,MAAa,QAAQ,KAAe,OAA0B;EAC5D,OAAO,KAAK,IAAI,KAAK,OAAO,QAAQ;CACtC;;;;CAKA,MAAa,UAAU,KAAe,QAAgB,GAAoB;EAGxE,MAAM,WAAW,MAAM,KAAK,OAAO,UAAU,KAAK,KAAK;EAEvD,MAAM,KAAK,eAAe,GAAG;EAE7B,OAAO;CACT;;;;CAKA,MAAa,UAAU,KAAe,QAAgB,GAAoB;EACxE,OAAO,KAAK,UAAU,KAAK,CAAC,KAAK;CACnC;AACF"}

package/esm/tagged-scoped-cache.d.mts

@@ -1,7 +1,7 @@
 import { CacheKey, CacheSetOptions, CacheTtl, RememberOptions, TaggedScopedCacheContract } from "./types.mjs";
 import { ScopedCache } from "./scoped-cache.mjs";
 
-//#region ../cache/src/tagged-scoped-cache.d.ts
+//#region ../../packages/cache/src/tagged-scoped-cache.d.ts
 /**
  * One-shot tagged write handle on top of a {@link ScopedCache}.
  *

package/esm/tagged-scoped-cache.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"tagged-scoped-cache.d.mts","names":[],"sources":["../../../../../../cache/src/tagged-scoped-cache.ts"],"mappings":";;;;;;AA4CA;;;;;;;;;;;;;;;;;;;;;;;;;;cAAa,iBAAA,YAA6B,yBAAA;EAwIjC;;;;;EAAA,mBAlIY,KAAA,EAAO,WAAA;EAqIvB;;;;EAAA,mBA/HgB,UAAA;EA4JQ;;;;cAtJR,KAAA,EAAO,WAAA,EAAa,UAAA;EAlBC;;;;EA2BjC,GAAA,CACL,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EAbuB;;;EAsBnB,GAAA,UAAa,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EAZrC;;;EAmBA,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAjBC;;;;EAyBf,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EAfX;;;EAuBZ,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EAhB5C;;;EAAA,UA6BS,cAAA,CAAe,GAAA,EAAK,QAAA,GAAW,OAAA;EArBlC;;;;EAwCN,OAAA,UAAiB,GAAA,EAAK,QAAA,EAAU,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,CAAA;EAhCxC;;;;;EA4CL,KAAA,CAAM,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,GAAA,YAAe,OAAA;EA/BzB;;;EA2D7B,QAAA,UACL,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,eAAA,EACzB,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EA5CI;;;;EAyDR,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAzDC;;;EAgE3C,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EApD9B;;;;;EA6DN,UAAA,IAAc,OAAA;EAhCpB;;;;;EAAA,UA+CG,cAAA,CAAe,GAAA,EAAK,QAAA;AAAA"}
+{"version":3,"file":"tagged-scoped-cache.d.mts","names":[],"sources":["../../../../../../../packages/cache/src/tagged-scoped-cache.ts"],"mappings":";;;;;;AA4CA;;;;;;;;;;;;;;;;;;;;;;;;;;cAAa,iBAAA,YAA6B,yBAAA;EAwIjC;;;;;EAAA,mBAlIY,KAAA,EAAO,WAAA;EAqIvB;;;;EAAA,mBA/HgB,UAAA;EA4JQ;;;;cAtJR,KAAA,EAAO,WAAA,EAAa,UAAA;EAlBC;;;;EA2BjC,GAAA,CACL,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EAbuB;;;EAsBnB,GAAA,UAAa,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EAZrC;;;EAmBA,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAjBC;;;;EAyBf,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EAfX;;;EAuBZ,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EAhB5C;;;EAAA,UA6BS,cAAA,CAAe,GAAA,EAAK,QAAA,GAAW,OAAA;EArBlC;;;;EAwCN,OAAA,UAAiB,GAAA,EAAK,QAAA,EAAU,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,CAAA;EAhCxC;;;;;EA4CL,KAAA,CAAM,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,GAAA,YAAe,OAAA;EA/BzB;;;EA2D7B,QAAA,UACL,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,eAAA,EACzB,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EA5CI;;;;EAyDR,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAzDC;;;EAgE3C,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EApD9B;;;;;EA6DN,UAAA,IAAc,OAAA;EAhCpB;;;;;EAAA,UA+CG,cAAA,CAAe,GAAA,EAAK,QAAA;AAAA"}

package/esm/tagged-scoped-cache.mjs

@@ -1,6 +1,6 @@
 import { injectTags, mergeTagSets, normalizeToOptions, normalizeToRememberOptions, parseCacheKey } from "./utils.mjs";
 
-//#region ../cache/src/tagged-scoped-cache.ts
+//#region ../../packages/cache/src/tagged-scoped-cache.ts
 /**
 * One-shot tagged write handle on top of a {@link ScopedCache}.
 *

package/esm/tagged-scoped-cache.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"tagged-scoped-cache.mjs","names":[],"sources":["../../../../../../cache/src/tagged-scoped-cache.ts"],"sourcesContent":["import type { ScopedCache } from \"./scoped-cache\";\nimport type {\n  CacheKey,\n  CacheSetOptions,\n  CacheTtl,\n  RememberOptions,\n  TaggedScopedCacheContract,\n} from \"./types\";\nimport {\n  injectTags,\n  mergeTagSets,\n  normalizeToOptions,\n  normalizeToRememberOptions,\n  parseCacheKey,\n} from \"./utils\";\n\n/**\n * One-shot tagged write handle on top of a {@link ScopedCache}.\n *\n * **Role.** Returned by `scope.tags([...])`. Adds a fixed list of tags to\n * every write produced through this handle, on top of any tags the parent\n * scope already contributes. Stateless except for the captured tag list.\n *\n * **Responsibility.**\n * - Owns: appending the handle's tags to writes, delegating tag-index\n *   bookkeeping for `setNX` (which lacks an inline `tags` knob on the driver\n *   contract), and computing the union for `invalidate()` calls.\n * - Does NOT own: storage, prefix-prepending (delegated to the scope),\n *   default `ttl` (delegated to the scope), or any kind of long-lived state.\n *\n * Tags compose additively: scope tags + handle tags + per-call tags, all\n * unioned and deduped. The handle never replaces scope tags — `invalidate()`\n * always sees the full union.\n *\n * @example\n * // Inside application code — scope provides the per-user tag automatically:\n * const feed = cache.namespace(`feed.${userId}`, { tags: [`user.${userId}`] });\n *\n * await feed.tags([\"unread\"]).set(\"messages.1\", message);\n * // → tagged with [user.<id>, unread]\n *\n * await feed.tags([\"unread\"]).invalidate();\n * // → wipes everything tagged with user.<id> OR unread.\n */\nexport class TaggedScopedCache implements TaggedScopedCacheContract {\n  /**\n   * The {@link ScopedCache} this handle delegates to. Held by reference so\n   * scope-default changes (none today, but the option is preserved for the\n   * future) are visible without rebuilding the handle.\n   */\n  protected readonly scope: ScopedCache;\n\n  /**\n   * Tags this handle contributes to every write. Cloned at the call site so\n   * later mutation of the input array doesn't leak in.\n   */\n  protected readonly handleTags: string[];\n\n  /**\n   * Build a tagged handle. Constructed via `scope.tags([...])` — users never\n   * call this directly.\n   */\n  public constructor(scope: ScopedCache, handleTags: string[]) {\n    this.scope = scope;\n    this.handleTags = [...handleTags];\n  }\n\n  /**\n   * Write the scoped key with the handle's tags appended to whatever the\n   * caller passed. Scope-level tags are added on top by the scope itself.\n   */\n  public set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any> {\n    const options = injectTags(normalizeToOptions(ttlOrOptions), this.handleTags);\n\n    return this.scope.set(key, value, options);\n  }\n\n  /**\n   * Read the scoped key. Tags don't affect reads — pass-through.\n   */\n  public get<T = any>(key: CacheKey): Promise<T | null> {\n    return this.scope.get<T>(key);\n  }\n\n  /**\n   * Check presence of the scoped key.\n   */\n  public has(key: CacheKey): Promise<boolean> {\n    return this.scope.has(key);\n  }\n\n  /**\n   * Remove the scoped key and take it out of every tag index this handle\n   * writes to (scope tags + handle tags).\n   */\n  public async remove(key: CacheKey): Promise<void> {\n    await this.scope.remove(key);\n    await this.detachFromTags(key);\n  }\n\n  /**\n   * Read-and-remove the scoped key, then take it out of this handle's tags.\n   */\n  public async pull<T = any>(key: CacheKey): Promise<T | null> {\n    const value = await this.scope.pull<T>(key);\n\n    if (value !== null) {\n      await this.detachFromTags(key);\n    }\n\n    return value;\n  }\n\n  /**\n   * Remove the un-prefixed scoped key from every tag index of this handle.\n   */\n  protected async detachFromTags(key: CacheKey): Promise<void> {\n    const allTags = mergeTagSets(this.scope.defaults.tags, this.handleTags);\n\n    if (!allTags || allTags.length === 0) {\n      return;\n    }\n\n    const scopedKey = this.buildScopedKey(key);\n    const tagged = this.scope.source.tags(allTags) as unknown as {\n      detachFromTags: (indexedKey: string) => Promise<void>;\n    };\n\n    await tagged.detachFromTags(parseCacheKey(scopedKey));\n  }\n\n  /**\n   * Permanent write with handle tags applied. Bypasses both the scope's and\n   * the caller's TTL (forever means forever) — only tags get injected.\n   */\n  public forever<T = any>(key: CacheKey, value: T): Promise<T> {\n    return this.scope.set(key, value, {\n      ttl: Infinity,\n      tags: this.handleTags,\n    }) as Promise<T>;\n  }\n\n  /**\n   * Atomic create-or-skip with the handle's tags applied on success. The\n   * driver contract has no inline `tags` knob on `setNX`, so we register the\n   * tag relationship manually after a successful write.\n   */\n  public async setNX(key: CacheKey, value: any, ttl?: number): Promise<boolean> {\n    const wasSet = await this.scope.setNX(key, value, ttl);\n\n    if (!wasSet) {\n      return false;\n    }\n\n    const allTags = mergeTagSets(this.scope.defaults.tags, this.handleTags);\n\n    if (!allTags || allTags.length === 0) {\n      return true;\n    }\n\n    // Register the un-prefixed scoped key — the tag index never holds the\n    // driver-parsed form, so `invalidate()` can remove it via `remove(key)`.\n    const scopedKey = this.buildScopedKey(key);\n    const tagged = this.scope.source.tags(allTags) as unknown as {\n      storeTagRelationship: (key: CacheKey) => Promise<void>;\n    };\n\n    await tagged.storeTagRelationship(scopedKey);\n\n    return true;\n  }\n\n  /**\n   * Read-or-compute with handle tags appended on the cache-miss write.\n   */\n  public remember<T = any>(\n    key: CacheKey,\n    ttlOrOptions: CacheTtl | RememberOptions,\n    callback: () => Promise<T>,\n  ): Promise<T> {\n    const options = injectTags(\n      normalizeToRememberOptions(ttlOrOptions),\n      this.handleTags,\n    );\n\n    return this.scope.remember<T>(key, options, callback);\n  }\n\n  /**\n   * Atomic counter increment on the scoped key. Tags aren't applied to\n   * subsequent increments — they're attached at first-write time.\n   */\n  public increment(key: CacheKey, value?: number): Promise<number> {\n    return this.scope.increment(key, value);\n  }\n\n  /**\n   * Atomic counter decrement on the scoped key. See {@link increment}.\n   */\n  public decrement(key: CacheKey, value?: number): Promise<number> {\n    return this.scope.decrement(key, value);\n  }\n\n  /**\n   * Wipe every entry tagged with the union of (scope tags + handle tags).\n   * Tags are global across the package, so this reaches outside the scope's\n   * prefix when scope tags are also used elsewhere.\n   */\n  public async invalidate(): Promise<void> {\n    const allTags = mergeTagSets(this.scope.defaults.tags, this.handleTags);\n\n    if (!allTags || allTags.length === 0) {\n      return;\n    }\n\n    await this.scope.source.tags(allTags).invalidate();\n  }\n\n  /**\n   * Compute the source-side key the same way `ScopedCache.scopedKey` does —\n   * needed for `setNX`, where we have to register the tag relationship by\n   * hand because the driver contract doesn't accept inline tags there.\n   */\n  protected buildScopedKey(key: CacheKey): string {\n    const keyString = typeof key === \"string\" ? key : parseCacheKey(key);\n\n    if (!keyString) {\n      return this.scope.prefix;\n    }\n\n    return `${this.scope.prefix}.${keyString}`;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4CA,IAAa,oBAAb,MAAoE;;;;;CAkBlE,AAAO,YAAY,OAAoB,YAAsB;EAC3D,KAAK,QAAQ;EACb,KAAK,aAAa,CAAC,GAAG,UAAU;CAClC;;;;;CAMA,AAAO,IACL,KACA,OACA,cACc;EACd,MAAM,UAAU,WAAW,mBAAmB,YAAY,GAAG,KAAK,UAAU;EAE5E,OAAO,KAAK,MAAM,IAAI,KAAK,OAAO,OAAO;CAC3C;;;;CAKA,AAAO,IAAa,KAAkC;EACpD,OAAO,KAAK,MAAM,IAAO,GAAG;CAC9B;;;;CAKA,AAAO,IAAI,KAAiC;EAC1C,OAAO,KAAK,MAAM,IAAI,GAAG;CAC3B;;;;;CAMA,MAAa,OAAO,KAA8B;EAChD,MAAM,KAAK,MAAM,OAAO,GAAG;EAC3B,MAAM,KAAK,eAAe,GAAG;CAC/B;;;;CAKA,MAAa,KAAc,KAAkC;EAC3D,MAAM,QAAQ,MAAM,KAAK,MAAM,KAAQ,GAAG;EAE1C,IAAI,UAAU,MACZ,MAAM,KAAK,eAAe,GAAG;EAG/B,OAAO;CACT;;;;CAKA,MAAgB,eAAe,KAA8B;EAC3D,MAAM,UAAU,aAAa,KAAK,MAAM,SAAS,MAAM,KAAK,UAAU;EAEtE,IAAI,CAAC,WAAW,QAAQ,WAAW,GACjC;EAGF,MAAM,YAAY,KAAK,eAAe,GAAG;EAKzC,MAJe,KAAK,MAAM,OAAO,KAAK,OAI3B,CAAC,CAAC,eAAe,cAAc,SAAS,CAAC;CACtD;;;;;CAMA,AAAO,QAAiB,KAAe,OAAsB;EAC3D,OAAO,KAAK,MAAM,IAAI,KAAK,OAAO;GAChC,KAAK;GACL,MAAM,KAAK;EACb,CAAC;CACH;;;;;;CAOA,MAAa,MAAM,KAAe,OAAY,KAAgC;EAG5E,IAAI,CAAC,MAFgB,KAAK,MAAM,MAAM,KAAK,OAAO,GAAG,GAGnD,OAAO;EAGT,MAAM,UAAU,aAAa,KAAK,MAAM,SAAS,MAAM,KAAK,UAAU;EAEtE,IAAI,CAAC,WAAW,QAAQ,WAAW,GACjC,OAAO;EAKT,MAAM,YAAY,KAAK,eAAe,GAAG;EAKzC,MAJe,KAAK,MAAM,OAAO,KAAK,OAI3B,CAAC,CAAC,qBAAqB,SAAS;EAE3C,OAAO;CACT;;;;CAKA,AAAO,SACL,KACA,cACA,UACY;EACZ,MAAM,UAAU,WACd,2BAA2B,YAAY,GACvC,KAAK,UACP;EAEA,OAAO,KAAK,MAAM,SAAY,KAAK,SAAS,QAAQ;CACtD;;;;;CAMA,AAAO,UAAU,KAAe,OAAiC;EAC/D,OAAO,KAAK,MAAM,UAAU,KAAK,KAAK;CACxC;;;;CAKA,AAAO,UAAU,KAAe,OAAiC;EAC/D,OAAO,KAAK,MAAM,UAAU,KAAK,KAAK;CACxC;;;;;;CAOA,MAAa,aAA4B;EACvC,MAAM,UAAU,aAAa,KAAK,MAAM,SAAS,MAAM,KAAK,UAAU;EAEtE,IAAI,CAAC,WAAW,QAAQ,WAAW,GACjC;EAGF,MAAM,KAAK,MAAM,OAAO,KAAK,OAAO,CAAC,CAAC,WAAW;CACnD;;;;;;CAOA,AAAU,eAAe,KAAuB;EAC9C,MAAM,YAAY,OAAO,QAAQ,WAAW,MAAM,cAAc,GAAG;EAEnE,IAAI,CAAC,WACH,OAAO,KAAK,MAAM;EAGpB,OAAO,GAAG,KAAK,MAAM,OAAO,GAAG;CACjC;AACF"}
+{"version":3,"file":"tagged-scoped-cache.mjs","names":[],"sources":["../../../../../../../packages/cache/src/tagged-scoped-cache.ts"],"sourcesContent":["import type { ScopedCache } from \"./scoped-cache\";\nimport type {\n  CacheKey,\n  CacheSetOptions,\n  CacheTtl,\n  RememberOptions,\n  TaggedScopedCacheContract,\n} from \"./types\";\nimport {\n  injectTags,\n  mergeTagSets,\n  normalizeToOptions,\n  normalizeToRememberOptions,\n  parseCacheKey,\n} from \"./utils\";\n\n/**\n * One-shot tagged write handle on top of a {@link ScopedCache}.\n *\n * **Role.** Returned by `scope.tags([...])`. Adds a fixed list of tags to\n * every write produced through this handle, on top of any tags the parent\n * scope already contributes. Stateless except for the captured tag list.\n *\n * **Responsibility.**\n * - Owns: appending the handle's tags to writes, delegating tag-index\n *   bookkeeping for `setNX` (which lacks an inline `tags` knob on the driver\n *   contract), and computing the union for `invalidate()` calls.\n * - Does NOT own: storage, prefix-prepending (delegated to the scope),\n *   default `ttl` (delegated to the scope), or any kind of long-lived state.\n *\n * Tags compose additively: scope tags + handle tags + per-call tags, all\n * unioned and deduped. The handle never replaces scope tags — `invalidate()`\n * always sees the full union.\n *\n * @example\n * // Inside application code — scope provides the per-user tag automatically:\n * const feed = cache.namespace(`feed.${userId}`, { tags: [`user.${userId}`] });\n *\n * await feed.tags([\"unread\"]).set(\"messages.1\", message);\n * // → tagged with [user.<id>, unread]\n *\n * await feed.tags([\"unread\"]).invalidate();\n * // → wipes everything tagged with user.<id> OR unread.\n */\nexport class TaggedScopedCache implements TaggedScopedCacheContract {\n  /**\n   * The {@link ScopedCache} this handle delegates to. Held by reference so\n   * scope-default changes (none today, but the option is preserved for the\n   * future) are visible without rebuilding the handle.\n   */\n  protected readonly scope: ScopedCache;\n\n  /**\n   * Tags this handle contributes to every write. Cloned at the call site so\n   * later mutation of the input array doesn't leak in.\n   */\n  protected readonly handleTags: string[];\n\n  /**\n   * Build a tagged handle. Constructed via `scope.tags([...])` — users never\n   * call this directly.\n   */\n  public constructor(scope: ScopedCache, handleTags: string[]) {\n    this.scope = scope;\n    this.handleTags = [...handleTags];\n  }\n\n  /**\n   * Write the scoped key with the handle's tags appended to whatever the\n   * caller passed. Scope-level tags are added on top by the scope itself.\n   */\n  public set(\n    key: CacheKey,\n    value: any,\n    ttlOrOptions?: CacheTtl | CacheSetOptions,\n  ): Promise<any> {\n    const options = injectTags(normalizeToOptions(ttlOrOptions), this.handleTags);\n\n    return this.scope.set(key, value, options);\n  }\n\n  /**\n   * Read the scoped key. Tags don't affect reads — pass-through.\n   */\n  public get<T = any>(key: CacheKey): Promise<T | null> {\n    return this.scope.get<T>(key);\n  }\n\n  /**\n   * Check presence of the scoped key.\n   */\n  public has(key: CacheKey): Promise<boolean> {\n    return this.scope.has(key);\n  }\n\n  /**\n   * Remove the scoped key and take it out of every tag index this handle\n   * writes to (scope tags + handle tags).\n   */\n  public async remove(key: CacheKey): Promise<void> {\n    await this.scope.remove(key);\n    await this.detachFromTags(key);\n  }\n\n  /**\n   * Read-and-remove the scoped key, then take it out of this handle's tags.\n   */\n  public async pull<T = any>(key: CacheKey): Promise<T | null> {\n    const value = await this.scope.pull<T>(key);\n\n    if (value !== null) {\n      await this.detachFromTags(key);\n    }\n\n    return value;\n  }\n\n  /**\n   * Remove the un-prefixed scoped key from every tag index of this handle.\n   */\n  protected async detachFromTags(key: CacheKey): Promise<void> {\n    const allTags = mergeTagSets(this.scope.defaults.tags, this.handleTags);\n\n    if (!allTags || allTags.length === 0) {\n      return;\n    }\n\n    const scopedKey = this.buildScopedKey(key);\n    const tagged = this.scope.source.tags(allTags) as unknown as {\n      detachFromTags: (indexedKey: string) => Promise<void>;\n    };\n\n    await tagged.detachFromTags(parseCacheKey(scopedKey));\n  }\n\n  /**\n   * Permanent write with handle tags applied. Bypasses both the scope's and\n   * the caller's TTL (forever means forever) — only tags get injected.\n   */\n  public forever<T = any>(key: CacheKey, value: T): Promise<T> {\n    return this.scope.set(key, value, {\n      ttl: Infinity,\n      tags: this.handleTags,\n    }) as Promise<T>;\n  }\n\n  /**\n   * Atomic create-or-skip with the handle's tags applied on success. The\n   * driver contract has no inline `tags` knob on `setNX`, so we register the\n   * tag relationship manually after a successful write.\n   */\n  public async setNX(key: CacheKey, value: any, ttl?: number): Promise<boolean> {\n    const wasSet = await this.scope.setNX(key, value, ttl);\n\n    if (!wasSet) {\n      return false;\n    }\n\n    const allTags = mergeTagSets(this.scope.defaults.tags, this.handleTags);\n\n    if (!allTags || allTags.length === 0) {\n      return true;\n    }\n\n    // Register the un-prefixed scoped key — the tag index never holds the\n    // driver-parsed form, so `invalidate()` can remove it via `remove(key)`.\n    const scopedKey = this.buildScopedKey(key);\n    const tagged = this.scope.source.tags(allTags) as unknown as {\n      storeTagRelationship: (key: CacheKey) => Promise<void>;\n    };\n\n    await tagged.storeTagRelationship(scopedKey);\n\n    return true;\n  }\n\n  /**\n   * Read-or-compute with handle tags appended on the cache-miss write.\n   */\n  public remember<T = any>(\n    key: CacheKey,\n    ttlOrOptions: CacheTtl | RememberOptions,\n    callback: () => Promise<T>,\n  ): Promise<T> {\n    const options = injectTags(\n      normalizeToRememberOptions(ttlOrOptions),\n      this.handleTags,\n    );\n\n    return this.scope.remember<T>(key, options, callback);\n  }\n\n  /**\n   * Atomic counter increment on the scoped key. Tags aren't applied to\n   * subsequent increments — they're attached at first-write time.\n   */\n  public increment(key: CacheKey, value?: number): Promise<number> {\n    return this.scope.increment(key, value);\n  }\n\n  /**\n   * Atomic counter decrement on the scoped key. See {@link increment}.\n   */\n  public decrement(key: CacheKey, value?: number): Promise<number> {\n    return this.scope.decrement(key, value);\n  }\n\n  /**\n   * Wipe every entry tagged with the union of (scope tags + handle tags).\n   * Tags are global across the package, so this reaches outside the scope's\n   * prefix when scope tags are also used elsewhere.\n   */\n  public async invalidate(): Promise<void> {\n    const allTags = mergeTagSets(this.scope.defaults.tags, this.handleTags);\n\n    if (!allTags || allTags.length === 0) {\n      return;\n    }\n\n    await this.scope.source.tags(allTags).invalidate();\n  }\n\n  /**\n   * Compute the source-side key the same way `ScopedCache.scopedKey` does —\n   * needed for `setNX`, where we have to register the tag relationship by\n   * hand because the driver contract doesn't accept inline tags there.\n   */\n  protected buildScopedKey(key: CacheKey): string {\n    const keyString = typeof key === \"string\" ? key : parseCacheKey(key);\n\n    if (!keyString) {\n      return this.scope.prefix;\n    }\n\n    return `${this.scope.prefix}.${keyString}`;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4CA,IAAa,oBAAb,MAAoE;;;;;CAkBlE,AAAO,YAAY,OAAoB,YAAsB;EAC3D,KAAK,QAAQ;EACb,KAAK,aAAa,CAAC,GAAG,UAAU;CAClC;;;;;CAMA,AAAO,IACL,KACA,OACA,cACc;EACd,MAAM,UAAU,WAAW,mBAAmB,YAAY,GAAG,KAAK,UAAU;EAE5E,OAAO,KAAK,MAAM,IAAI,KAAK,OAAO,OAAO;CAC3C;;;;CAKA,AAAO,IAAa,KAAkC;EACpD,OAAO,KAAK,MAAM,IAAO,GAAG;CAC9B;;;;CAKA,AAAO,IAAI,KAAiC;EAC1C,OAAO,KAAK,MAAM,IAAI,GAAG;CAC3B;;;;;CAMA,MAAa,OAAO,KAA8B;EAChD,MAAM,KAAK,MAAM,OAAO,GAAG;EAC3B,MAAM,KAAK,eAAe,GAAG;CAC/B;;;;CAKA,MAAa,KAAc,KAAkC;EAC3D,MAAM,QAAQ,MAAM,KAAK,MAAM,KAAQ,GAAG;EAE1C,IAAI,UAAU,MACZ,MAAM,KAAK,eAAe,GAAG;EAG/B,OAAO;CACT;;;;CAKA,MAAgB,eAAe,KAA8B;EAC3D,MAAM,UAAU,aAAa,KAAK,MAAM,SAAS,MAAM,KAAK,UAAU;EAEtE,IAAI,CAAC,WAAW,QAAQ,WAAW,GACjC;EAGF,MAAM,YAAY,KAAK,eAAe,GAAG;EAKzC,MAJe,KAAK,MAAM,OAAO,KAAK,OAI3B,CAAC,CAAC,eAAe,cAAc,SAAS,CAAC;CACtD;;;;;CAMA,AAAO,QAAiB,KAAe,OAAsB;EAC3D,OAAO,KAAK,MAAM,IAAI,KAAK,OAAO;GAChC,KAAK;GACL,MAAM,KAAK;EACb,CAAC;CACH;;;;;;CAOA,MAAa,MAAM,KAAe,OAAY,KAAgC;EAG5E,IAAI,CAAC,MAFgB,KAAK,MAAM,MAAM,KAAK,OAAO,GAAG,GAGnD,OAAO;EAGT,MAAM,UAAU,aAAa,KAAK,MAAM,SAAS,MAAM,KAAK,UAAU;EAEtE,IAAI,CAAC,WAAW,QAAQ,WAAW,GACjC,OAAO;EAKT,MAAM,YAAY,KAAK,eAAe,GAAG;EAKzC,MAJe,KAAK,MAAM,OAAO,KAAK,OAI3B,CAAC,CAAC,qBAAqB,SAAS;EAE3C,OAAO;CACT;;;;CAKA,AAAO,SACL,KACA,cACA,UACY;EACZ,MAAM,UAAU,WACd,2BAA2B,YAAY,GACvC,KAAK,UACP;EAEA,OAAO,KAAK,MAAM,SAAY,KAAK,SAAS,QAAQ;CACtD;;;;;CAMA,AAAO,UAAU,KAAe,OAAiC;EAC/D,OAAO,KAAK,MAAM,UAAU,KAAK,KAAK;CACxC;;;;CAKA,AAAO,UAAU,KAAe,OAAiC;EAC/D,OAAO,KAAK,MAAM,UAAU,KAAK,KAAK;CACxC;;;;;;CAOA,MAAa,aAA4B;EACvC,MAAM,UAAU,aAAa,KAAK,MAAM,SAAS,MAAM,KAAK,UAAU;EAEtE,IAAI,CAAC,WAAW,QAAQ,WAAW,GACjC;EAGF,MAAM,KAAK,MAAM,OAAO,KAAK,OAAO,CAAC,CAAC,WAAW;CACnD;;;;;;CAOA,AAAU,eAAe,KAAuB;EAC9C,MAAM,YAAY,OAAO,QAAQ,WAAW,MAAM,cAAc,GAAG;EAEnE,IAAI,CAAC,WACH,OAAO,KAAK,MAAM;EAGpB,OAAO,GAAG,KAAK,MAAM,OAAO,GAAG;CACjC;AACF"}

package/esm/types.d.mts

@@ -10,7 +10,7 @@ import { RedisCacheDriver } from "./drivers/redis-cache-driver.mjs";
 import { GenericObject } from "@mongez/reinforcements";
 import { RedisClientOptions } from "redis";
 
-//#region ../cache/src/types.d.ts
+//#region ../../packages/cache/src/types.d.ts
 /**
  * Base error class for cache-related errors
  */

package/esm/types.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.mts","names":[],"sources":["../../../../../../cache/src/types.ts"],"mappings":";;;;;;;;;;;;;;;;cAiBa,UAAA,SAAmB,KAAK;cAChB,OAAA;AAAA;;;;cASR,oBAAA,SAA6B,UAAU;cAC/B,OAAA;AAAA;;;;cASR,uBAAA,SAAgC,UAAU;cAClC,OAAA;AAAA;;AApBe;AASpC;cAoBa,8BAAA,SAAuC,UAAU;cAE1D,OAAA;AAAA;;;;;AArBgC;AASpC;cAyBa,qBAAA,SAA8B,UAAU;cAChC,OAAA;AAAA;;;;cASR,qBAAA,SAA8B,UAAU;cAChC,OAAA;AAAA;;;;;;;;KAaT,QAAA;AAxBZ;;;;;;;AAAA,KAiCY,mBAAA;AAhCwB;AASpC;;AAToC,KAqCxB,cAAA;EA5ByC;;;EAgCnD,MAAA;EA/BkC;AAAA;AAapC;;EAuBE,QAAA,EAAU,CAAC;AAAA;AAvBO;AASpB;;;;AAA+B;AAK/B;;;;AAdoB,KAoCR,WAAA;EAlBV;;;;EAuBA,GAAA,EAAK,QAAQ;EALH;;;;EAUV,KAAA;EALK;;;EASL,MAAA;AAAA;AAgBF;;;;;;;;;;AAEc;AAad;;AAfA,KAAY,WAAA;EACN,QAAA;EAAgB,KAAA,EAAO,CAAC;AAAA;EACxB,QAAA;AAAA;;AA0BE;AAaR;;;;;;;;;KA1BY,eAAA;EAkCV;;;EA9BA,GAAA,GAAM,QAAQ;EAuCD;;;EAnCb,IAAA;EAkEA;;AAAO;AAWT;EAxEE,MAAA;AAAA;;;;;;AAqFI;AAoBN;;;;KA5FY,eAAA;EAkGA;;;EA9FV,GAAA,GAAM,QAAA;EA+GN;;AAAM;EA3GN,SAAA,YAAqB,IAAA;EAkHQ;;;;EA7G7B,IAAA;EA4HA;;AAAI;EAxHJ,UAAA,GAAa,mBAAA;EA+HY;;;EA3HzB,SAAA;EA+HA;;;;EA1HA,MAAA;EAmIK;AAMP;;;;AAA6C;AAE7C;;;;AAA8B;EA/H5B,MAAA;EAsJwB;;;AAAA;AAe1B;;;;;EA3JE,OAAA;AAAA;;;;;;;;AAyLU;KA9KA,qBAAA;EAoLiB;;;;EA/K3B,GAAA,GAAM,QAAQ;EA+KsD;;AAAO;AAU7E;;;;EAjLE,IAAA;AAAA;;;;;;;;;;;;;;;;;;KAoBU,eAAA;EAqLD;AAAA;AAMX;;;EArLE,QAAA,EAAU,QAAA;EAyLoC;;;;;EAnL9C,QAAA,EAAU,QAAQ;EA2LK;;;;EAtLvB,IAAA;EAuMc;;;;;EAjMd,MAAA;AAAA;;;;;KAOU,mBAAA;EA0MuC;;;;EArMjD,IAAA;EA4J8C;;;;EAvJ9C,SAAA;EA2JS;;;;EAtJT,IAAA;AAAA;;;;;KAOU,eAAA;EAgKV;;;EA5JA,GAAA;EAgKA;;;;EA3JA,KAAA,EAAO,CAAC;EA2J6B;;;EAvJrC,KAAA;AAAA;;;;KAMU,QAAA,YAAoB,aAAa;AAAA,KAEjC,kBAAA;;;;KAuBA,cAAA;;;;KAeA,cAAA;EAyHA;;;EArHV,GAAA;EAqHiD;AAGnD;;EApHE,KAAA;EA+Hc;;;EA3Hd,GAAA;EAkIA;;AAAO;EA9HP,MAAA;EAiIoC;;;EA7HpC,KAAA;EA+HU;;;EA3HV,SAAA,WAiIA;EA/HA,IAAA,aA2IA;EAzIA,IAAA,aAyIc;EAvId,UAAA;AAAA;;;;KAMU,iBAAA,IAAqB,SAAA,EAAW,cAAA,YAA0B,OAAO;;;;;;AA2JnE;AAGV;;KApJY,oBAAA;EA2LwB,kEAzLlC,IAAA,UA4JA;EA1JA,MAAA,UAkKA;EAhKA,IAAA,UA0KA;EAxKA,OAAA,UA+KM;EA7KN,MAAA,UAiLgB;EA/KhB,OAAA,UA+KkC;EA7KlC,SAAA;IACE,GAAA;IACA,GAAA;IACA,GAAA,UA6K8C;IA3K9C,OAAA;EAAA;EAGF,QAAA,EAAU,MAAA,SAAe,IAAA,CAAK,oBAAA,gBAmL9B;EAjLA,SAAA;AAAA;;AAuLc;AAQhB;UAzLiB,iBAAA;;;;EAIf,GAAA,CAAI,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,YAAA,GAAe,QAAA,GAAW,eAAA,GAAkB,OAAA;EAoM3E;;;EAhMA,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAgNV;;;EA5MV,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EA6MvB;;;EAzMA,UAAA,IAAc,OAAA;EAyMqC;;;AAAqB;EApMxE,KAAA,IAAS,OAAA;EAuMe;;;EAnMxB,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAwMZ;;;EApMR,QAAA,CAAS,GAAA,EAAK,QAAA,EAAU,GAAA,UAAa,QAAA,QAAgB,OAAA,QAAe,OAAA;EAsN9D;;;EAlNN,IAAA,CAAK,GAAA,EAAK,QAAA,GAAW,OAAA;EA2Od;AAAA;AAIT;EA3OE,OAAA,CAAQ,GAAA,EAAK,QAAA,EAAU,KAAA,QAAa,OAAA;EA2OV;;;EAvO1B,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EA+P5B;;;EA3Pd,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;AAAA;AAAA,KAGhC,kBAAA;EAqR2B;;;EAjRrC,YAAA;EAyRS;;;;;;EAlRT,GAAA,GAAM,QAAQ;EAsTE;;;;;;EA/ShB,OAAA;AAAA;AAAA,KAGU,0BAAA,GAA6B,kBAAkB;AAAA,KAE/C,qBAAA;EAkUC;;;;;EA5TX,QAAA;EAwUuC;;;;EAnUvC,YAAA;EAwV6B;;;;;;EAjV7B,GAAA,GAAM,QAAQ;AAAA;AAAA,KAGJ,gBAAA;EA2VS;;;EAvVnB,YAAA;EAyVG;;;;;;EAlVH,GAAA,GAAM,QAAQ;EA4Wa;;;;;EAtW3B,SAAA;EAoXe;;;;;EA9Wf,QAAA;AAAA;AAAA,KAGU,YAAA;EA8XA;;;;;EAxXV,IAAA;EAsYY;;;EAlYZ,IAAA;EAiZ8C;;;EA7Y9C,QAAA;EAsZiD;;;EAlZjD,QAAA;EAsa2B;;;;;EAha3B,GAAA;EAkIuC;;;EA9HvC,YAAA;EA0IA;;;;;;EAnIA,GAAA,GAAM,QAAA;EA2IK;;;EAvIX,aAAA,GAAgB,kBAAkB;AAAA;AAAA,KAGxB,sBAAA,GAAyB,aAAa;;;;;;KAOtC,gBAAA;EA8JV;;;EA1JA,YAAA;EA0J6B;;;;;EApJ7B,GAAA,GAAM,QAAQ;AAAA;;;;;;KAQJ,SAAA;EAgKI;;;;EA3Jd,SAAA;EAiLA;;;;EA5KA,GAAA;EA8K2B;;;;EAzK3B,IAAA;EA2KG;;;;EAtKH,SAAA;AAAA;;;;;;;;;KAWU,YAAA;EACV,KAAA,CAAM,IAAA,UAAc,MAAA,eAAqB,OAAO;IAAG,IAAA;IAAa,QAAA;EAAA;AAAA;AAAA,KAGtD,cAAA;EAyLY;;;;EApLtB,MAAA,EAAQ,YAAA;EAoL2C;;;;;;EA7KnD,KAAA;EAkM6B;;;EA9L7B,YAAA;EA+Lc;;;;;;EAxLd,GAAA,GAAM,QAAQ;EAkME;;;;;;;;;;;;EArLhB,MAAA;IAkMK;;;;IA7LH,UAAA;IA4MF;;;;;;IArME,KAAA;EAAA;AAAA;AAAA,UAIa,WAAA;EAoMb;;;EAhMF,OAAA,EAAS,OAAA;EA6MT;;;EAzMA,IAAA;EAyM0C;;;EArM1C,eAAA,CAAgB,SAAA;EA4MS;;;EAxMzB,eAAA,CAAgB,SAAA,WAAoB,OAAA;EA4M/B;;;EAxML,UAAA,CAAW,OAAA,EAAS,OAAA;EA4MZ;;;EAxMR,QAAA,CAAS,GAAA,EAAK,QAAA;EA4MJ;;;;;;;;;;;;;;;;;;;;EAvLV,GAAA,CACE,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EAqME;;;EAjML,GAAA,UAAa,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EA4M7B;;;EAxMR,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EA4MH;;;EAxMpB,KAAA,IAAS,OAAA;EA6MU;;;EAzMnB,OAAA,IAAW,OAAA;EA6MX;;;EAzMA,MAAA,GAAS,UAAA;EAsNT;;;EAlNA,UAAA,IAAc,OAAA;EAoNZ;;;EAhNF,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAiNQ;AAAA;AAS9B;;;;;;;;;;;;;;;EAxME,QAAA,UACE,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,eAAA,EACzB,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EAoOuB;;;;;;;;;;;;;;;;;EAlNlC,GAAA,UACE,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,eAAA,EACT,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EA8LM;;;;;;;EAtLjB,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EA8LvB;;;EA1Lf,OAAA,UAAiB,GAAA,EAAK,QAAA,EAAU,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,CAAA;EAkM9C;;;;;;AAIW;AAWlB;;;;;;;;;;;EA9LE,MAAA,UACE,GAAA,EAAK,QAAA,EACL,EAAA,GAAK,OAAA,EAAS,CAAA,YAAa,CAAA,UAAW,OAAA,CAAQ,CAAA,UAC9C,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EA+LQ;;;;;;;;EAtLnB,KAAA,WAAgB,MAAA,gBAAsB,MAAA,eACpC,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,OAAA,CAAQ,CAAA,GACjB,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EAuLgB;;;;;;;;EA9K3B,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,iBAAA,CAAkB,CAAA;EAuLlC;;;;;;;;;;;;;;EAxKd,IAAA,IACE,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,IAAA,CAAK,WAAA,aAC9B,EAAA,QAAU,OAAA,CAAQ,CAAA,IACjB,OAAA,CAAQ,WAAA,CAAY,CAAA;EAmJM;;;;;;;;;;;EAvI7B,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EA0IvB;;;;;;EAnInB,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAoIzB;;;EAhIjB,IAAA,CAAK,IAAA,EAAM,QAAA,KAAa,OAAA;EAgI2B;;;EA5HnD,OAAA,CAAQ,KAAA,EAAO,MAAA,eAAqB,GAAA,YAAe,OAAA;EA6H9B;;;EAzHrB,EAAA,CAAG,KAAA,EAAO,cAAA,EAAgB,OAAA,EAAS,iBAAA;EA0H1B;;;EAtHT,GAAA,CAAI,KAAA,EAAO,cAAA,EAAgB,OAAA,EAAS,iBAAA;EAwHT;;;EApH3B,IAAA,CAAK,KAAA,EAAO,cAAA,EAAgB,OAAA,EAAS,iBAAA;EAqHnC;;;;;EA/GF,KAAA,EAAO,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,GAAA,YAAe,OAAA;EAiHxB;;;EA7GzB,IAAA,CAAK,IAAA,aAAiB,iBAAA;EA8GZ;;;;;;AAKW;AAgBvB;;;EAxHE,MAAA,EAAQ,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EAoIc;;;EAhI5D,UAAA,EAAY,MAAA,EAAQ,QAAA,GAAW,OAAA;EA2IM;;;;EAtIrC,SAAA,EAAW,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EAwIzB;;;EApIxB,SAAA,EAAW,MAAA,EAAQ,QAAA,GAAW,OAAA;EAwIrB;;;;;;;;;;;;EA3HT,OAAA,UACE,MAAA,YACA,OAAA,EAAS,mBAAA,GACR,OAAA,CAAQ,eAAA,CAAgB,CAAA;AAAA;;;;;;;UASZ,iBAAA;EA4HR;;;EAxHP,IAAA,IAAQ,KAAA,EAAO,CAAA,KAAM,OAAA;EA2HV;;;EAvHX,OAAA,IAAW,KAAA,EAAO,CAAA,KAAM,OAAA;EA2HT;;;EAvHf,GAAA,IAAO,OAAA,CAAQ,CAAA;EA0Hc;;;EAtH7B,KAAA,IAAS,OAAA,CAAQ,CAAA;EAwHN;;;EApHX,KAAA,CAAM,KAAA,WAAgB,GAAA,YAAe,OAAA,CAAQ,CAAA;EAsHtC;;;EAlHP,GAAA,IAAO,OAAA,CAAQ,CAAA;EAqHJ;;;EAjHX,MAAA,IAAU,OAAA;EAoHoB;;;EAhH9B,IAAA,CAAK,KAAA,UAAe,GAAA,WAAc,OAAA;EAqHP;;;EAjH3B,KAAA,IAAS,OAAA;AAAA;;;;;;;;;UAWM,yBAAA;EACf,GAAA,CAAI,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,YAAA,GAAe,QAAA,GAAW,eAAA,GAAkB,OAAA;EAC3E,GAAA,UAAa,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EACrC,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EACpB,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EACvB,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EACtC,OAAA,UAAiB,GAAA,EAAK,QAAA,EAAU,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,CAAA;EACnD,KAAA,CAAM,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,GAAA,YAAe,OAAA;EAChD,QAAA,UACE,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,eAAA,EACzB,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EACX,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAC1C,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EA4CtC;;;;EAvCJ,UAAA,IAAc,OAAA;AAAA;;;;;;;;;;;;;;UAgBC,mBAAA;EA6BN;EAAA,SA3BA,MAAA;EA2BU;;;;;;;;EAjBnB,SAAA,CAAU,MAAA,UAAgB,OAAA,GAAU,qBAAA,GAAwB,mBAAA;EAkBT;;;EAbnD,IAAA,CAAK,IAAA,aAAiB,yBAAA;EAcD;EAXrB,KAAA,IAAS,OAAA;EAGT,GAAA,UAAa,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EACrC,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EACpB,IAAA,CAAK,IAAA,EAAM,QAAA,KAAa,OAAA;EACxB,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EAGtC,GAAA,CAAI,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,YAAA,GAAe,QAAA,GAAW,eAAA,GAAkB,OAAA;EAC3E,OAAA,CAAQ,KAAA,EAAO,MAAA,eAAqB,GAAA,YAAe,OAAA;EACnD,KAAA,CAAM,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,GAAA,YAAe,OAAA;EAChD,OAAA,UAAiB,GAAA,EAAK,QAAA,EAAU,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,CAAA;EACnD,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EAGvB,QAAA,UACE,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,eAAA,EACzB,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EACX,GAAA,UACE,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,eAAA,EACT,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EAGX,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAC1C,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAC1C,MAAA,UACE,GAAA,EAAK,QAAA,EACL,EAAA,GAAK,OAAA,EAAS,CAAA,YAAa,CAAA,UAAW,OAAA,CAAQ,CAAA,UAC9C,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EACX,KAAA,WAAgB,MAAA,gBAAsB,MAAA,eACpC,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,OAAA,CAAQ,CAAA,GACjB,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EAGX,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,iBAAA,CAAkB,CAAA;EAGhD,IAAA,IACE,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,IAAA,CAAK,WAAA,aAC9B,EAAA,QAAU,OAAA,CAAQ,CAAA,IACjB,OAAA,CAAQ,WAAA,CAAY,CAAA;EAGvB,OAAA,UACE,MAAA,YACA,OAAA,EAAS,mBAAA,GACR,OAAA,CAAQ,eAAA,CAAgB,CAAA;AAAA;AAAA,KAGjB,SAAA;EAtCC;;;EA0CX,IAAA;EAxCE;;;EA4CF,SAAA;EA1C0B;;;EA8C1B,GAAA;EA1CA;;;;;;;EAkDA,OAAA;AAAA;AAAA,KAGU,WAAA,aAAwB,WAAW;AAAA,KAE1C,cAAA;AAAA,KAUA,uBAAA,MAA6B,CAAA,qBAAsB,cAAA,GAAiB,cAAA,GAAiB,CAAA;AAAA,KAE9E,mBAAA,wDAEG,uBAAA,CAAwB,CAAA;EAlEnC;;;EAuEF,OAAA,GAAU,UAAA;EAtE8B;;;;;EA4ExC,OAAA;EA1EG;;;EA8EH,OAAA;IACE,KAAA,UAAe,gBAAA;IACf,IAAA,UAAc,eAAA;IACd,IAAA,UAAc,eAAA;IACd,MAAA,UAAgB,iBAAA;IAChB,cAAA,UAAwB,yBAAA;IACxB,GAAA,UAAa,oBAAA;IACb,EAAA,UAAY,aAAA;IACZ,IAAA,UAAc,eAAA;EAAA,cAEN,OAAA,CAAQ,CAAA,oBAAqB,eAAA;EAnF5B;;;EAwFX,OAAA;IACE,KAAA,GAAQ,YAAA;IACR,IAAA,GAAO,gBAAA;IACP,MAAA,GAAS,kBAAA;IACT,cAAA,GAAiB,0BAAA;IACjB,IAAA,GAAO,sBAAA;IACP,GAAA,GAAM,qBAAA;IACN,EAAA,GAAK,cAAA;IACL,IAAA,GAAO,gBAAA;EAAA,cAEC,OAAA,CAAQ,CAAA,aAAc,aAAA;AAAA"}
+{"version":3,"file":"types.d.mts","names":[],"sources":["../../../../../../../packages/cache/src/types.ts"],"mappings":";;;;;;;;;;;;;;;;cAiBa,UAAA,SAAmB,KAAK;cAChB,OAAA;AAAA;;;;cASR,oBAAA,SAA6B,UAAU;cAC/B,OAAA;AAAA;;;;cASR,uBAAA,SAAgC,UAAU;cAClC,OAAA;AAAA;;AApBe;AASpC;cAoBa,8BAAA,SAAuC,UAAU;cAE1D,OAAA;AAAA;;;;;AArBgC;AASpC;cAyBa,qBAAA,SAA8B,UAAU;cAChC,OAAA;AAAA;;;;cASR,qBAAA,SAA8B,UAAU;cAChC,OAAA;AAAA;;;;;;;;KAaT,QAAA;AAxBZ;;;;;;;AAAA,KAiCY,mBAAA;AAhCwB;AASpC;;AAToC,KAqCxB,cAAA;EA5ByC;;;EAgCnD,MAAA;EA/BkC;AAAA;AAapC;;EAuBE,QAAA,EAAU,CAAC;AAAA;AAvBO;AASpB;;;;AAA+B;AAK/B;;;;AAdoB,KAoCR,WAAA;EAlBV;;;;EAuBA,GAAA,EAAK,QAAQ;EALH;;;;EAUV,KAAA;EALK;;;EASL,MAAA;AAAA;AAgBF;;;;;;;;;;AAEc;AAad;;AAfA,KAAY,WAAA;EACN,QAAA;EAAgB,KAAA,EAAO,CAAC;AAAA;EACxB,QAAA;AAAA;;AA0BE;AAaR;;;;;;;;;KA1BY,eAAA;EAkCV;;;EA9BA,GAAA,GAAM,QAAQ;EAuCD;;;EAnCb,IAAA;EAkEA;;AAAO;AAWT;EAxEE,MAAA;AAAA;;;;;;AAqFI;AAoBN;;;;KA5FY,eAAA;EAkGA;;;EA9FV,GAAA,GAAM,QAAA;EA+GN;;AAAM;EA3GN,SAAA,YAAqB,IAAA;EAkHQ;;;;EA7G7B,IAAA;EA4HA;;AAAI;EAxHJ,UAAA,GAAa,mBAAA;EA+HY;;;EA3HzB,SAAA;EA+HA;;;;EA1HA,MAAA;EAmIK;AAMP;;;;AAA6C;AAE7C;;;;AAA8B;EA/H5B,MAAA;EAsJwB;;;AAAA;AAe1B;;;;;EA3JE,OAAA;AAAA;;;;;;;;AAyLU;KA9KA,qBAAA;EAoLiB;;;;EA/K3B,GAAA,GAAM,QAAQ;EA+KsD;;AAAO;AAU7E;;;;EAjLE,IAAA;AAAA;;;;;;;;;;;;;;;;;;KAoBU,eAAA;EAqLD;AAAA;AAMX;;;EArLE,QAAA,EAAU,QAAA;EAyLoC;;;;;EAnL9C,QAAA,EAAU,QAAQ;EA2LK;;;;EAtLvB,IAAA;EAuMc;;;;;EAjMd,MAAA;AAAA;;;;;KAOU,mBAAA;EA0MuC;;;;EArMjD,IAAA;EA4J8C;;;;EAvJ9C,SAAA;EA2JS;;;;EAtJT,IAAA;AAAA;;;;;KAOU,eAAA;EAgKV;;;EA5JA,GAAA;EAgKA;;;;EA3JA,KAAA,EAAO,CAAC;EA2J6B;;;EAvJrC,KAAA;AAAA;;;;KAMU,QAAA,YAAoB,aAAa;AAAA,KAEjC,kBAAA;;;;KAuBA,cAAA;;;;KAeA,cAAA;EAyHA;;;EArHV,GAAA;EAqHiD;AAGnD;;EApHE,KAAA;EA+Hc;;;EA3Hd,GAAA;EAkIA;;AAAO;EA9HP,MAAA;EAiIoC;;;EA7HpC,KAAA;EA+HU;;;EA3HV,SAAA,WAiIA;EA/HA,IAAA,aA2IA;EAzIA,IAAA,aAyIc;EAvId,UAAA;AAAA;;;;KAMU,iBAAA,IAAqB,SAAA,EAAW,cAAA,YAA0B,OAAO;;;;;;AA2JnE;AAGV;;KApJY,oBAAA;EA2LwB,kEAzLlC,IAAA,UA4JA;EA1JA,MAAA,UAkKA;EAhKA,IAAA,UA0KA;EAxKA,OAAA,UA+KM;EA7KN,MAAA,UAiLgB;EA/KhB,OAAA,UA+KkC;EA7KlC,SAAA;IACE,GAAA;IACA,GAAA;IACA,GAAA,UA6K8C;IA3K9C,OAAA;EAAA;EAGF,QAAA,EAAU,MAAA,SAAe,IAAA,CAAK,oBAAA,gBAmL9B;EAjLA,SAAA;AAAA;;AAuLc;AAQhB;UAzLiB,iBAAA;;;;EAIf,GAAA,CAAI,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,YAAA,GAAe,QAAA,GAAW,eAAA,GAAkB,OAAA;EAoM3E;;;EAhMA,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAgNV;;;EA5MV,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EA6MvB;;;EAzMA,UAAA,IAAc,OAAA;EAyMqC;;;AAAqB;EApMxE,KAAA,IAAS,OAAA;EAuMe;;;EAnMxB,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAwMZ;;;EApMR,QAAA,CAAS,GAAA,EAAK,QAAA,EAAU,GAAA,UAAa,QAAA,QAAgB,OAAA,QAAe,OAAA;EAsN9D;;;EAlNN,IAAA,CAAK,GAAA,EAAK,QAAA,GAAW,OAAA;EA2Od;AAAA;AAIT;EA3OE,OAAA,CAAQ,GAAA,EAAK,QAAA,EAAU,KAAA,QAAa,OAAA;EA2OV;;;EAvO1B,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EA+P5B;;;EA3Pd,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;AAAA;AAAA,KAGhC,kBAAA;EAqR2B;;;EAjRrC,YAAA;EAyRS;;;;;;EAlRT,GAAA,GAAM,QAAQ;EAsTE;;;;;;EA/ShB,OAAA;AAAA;AAAA,KAGU,0BAAA,GAA6B,kBAAkB;AAAA,KAE/C,qBAAA;EAkUC;;;;;EA5TX,QAAA;EAwUuC;;;;EAnUvC,YAAA;EAwV6B;;;;;;EAjV7B,GAAA,GAAM,QAAQ;AAAA;AAAA,KAGJ,gBAAA;EA2VS;;;EAvVnB,YAAA;EAyVG;;;;;;EAlVH,GAAA,GAAM,QAAQ;EA4Wa;;;;;EAtW3B,SAAA;EAoXe;;;;;EA9Wf,QAAA;AAAA;AAAA,KAGU,YAAA;EA8XA;;;;;EAxXV,IAAA;EAsYY;;;EAlYZ,IAAA;EAiZ8C;;;EA7Y9C,QAAA;EAsZiD;;;EAlZjD,QAAA;EAsa2B;;;;;EAha3B,GAAA;EAkIuC;;;EA9HvC,YAAA;EA0IA;;;;;;EAnIA,GAAA,GAAM,QAAA;EA2IK;;;EAvIX,aAAA,GAAgB,kBAAkB;AAAA;AAAA,KAGxB,sBAAA,GAAyB,aAAa;;;;;;KAOtC,gBAAA;EA8JV;;;EA1JA,YAAA;EA0J6B;;;;;EApJ7B,GAAA,GAAM,QAAQ;AAAA;;;;;;KAQJ,SAAA;EAgKI;;;;EA3Jd,SAAA;EAiLA;;;;EA5KA,GAAA;EA8K2B;;;;EAzK3B,IAAA;EA2KG;;;;EAtKH,SAAA;AAAA;;;;;;;;;KAWU,YAAA;EACV,KAAA,CAAM,IAAA,UAAc,MAAA,eAAqB,OAAO;IAAG,IAAA;IAAa,QAAA;EAAA;AAAA;AAAA,KAGtD,cAAA;EAyLY;;;;EApLtB,MAAA,EAAQ,YAAA;EAoL2C;;;;;;EA7KnD,KAAA;EAkM6B;;;EA9L7B,YAAA;EA+Lc;;;;;;EAxLd,GAAA,GAAM,QAAQ;EAkME;;;;;;;;;;;;EArLhB,MAAA;IAkMK;;;;IA7LH,UAAA;IA4MF;;;;;;IArME,KAAA;EAAA;AAAA;AAAA,UAIa,WAAA;EAoMb;;;EAhMF,OAAA,EAAS,OAAA;EA6MT;;;EAzMA,IAAA;EAyM0C;;;EArM1C,eAAA,CAAgB,SAAA;EA4MS;;;EAxMzB,eAAA,CAAgB,SAAA,WAAoB,OAAA;EA4M/B;;;EAxML,UAAA,CAAW,OAAA,EAAS,OAAA;EA4MZ;;;EAxMR,QAAA,CAAS,GAAA,EAAK,QAAA;EA4MJ;;;;;;;;;;;;;;;;;;;;EAvLV,GAAA,CACE,GAAA,EAAK,QAAA,EACL,KAAA,OACA,YAAA,GAAe,QAAA,GAAW,eAAA,GACzB,OAAA;EAqME;;;EAjML,GAAA,UAAa,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EA4M7B;;;EAxMR,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EA4MH;;;EAxMpB,KAAA,IAAS,OAAA;EA6MU;;;EAzMnB,OAAA,IAAW,OAAA;EA6MX;;;EAzMA,MAAA,GAAS,UAAA;EAsNT;;;EAlNA,UAAA,IAAc,OAAA;EAoNZ;;;EAhNF,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EAiNQ;AAAA;AAS9B;;;;;;;;;;;;;;;EAxME,QAAA,UACE,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,eAAA,EACzB,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EAoOuB;;;;;;;;;;;;;;;;;EAlNlC,GAAA,UACE,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,eAAA,EACT,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EA8LM;;;;;;;EAtLjB,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EA8LvB;;;EA1Lf,OAAA,UAAiB,GAAA,EAAK,QAAA,EAAU,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,CAAA;EAkM9C;;;;;;AAIW;AAWlB;;;;;;;;;;;EA9LE,MAAA,UACE,GAAA,EAAK,QAAA,EACL,EAAA,GAAK,OAAA,EAAS,CAAA,YAAa,CAAA,UAAW,OAAA,CAAQ,CAAA,UAC9C,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EA+LQ;;;;;;;;EAtLnB,KAAA,WAAgB,MAAA,gBAAsB,MAAA,eACpC,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,OAAA,CAAQ,CAAA,GACjB,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EAuLgB;;;;;;;;EA9K3B,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,iBAAA,CAAkB,CAAA;EAuLlC;;;;;;;;;;;;;;EAxKd,IAAA,IACE,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,IAAA,CAAK,WAAA,aAC9B,EAAA,QAAU,OAAA,CAAQ,CAAA,IACjB,OAAA,CAAQ,WAAA,CAAY,CAAA;EAmJM;;;;;;;;;;;EAvI7B,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EA0IvB;;;;;;EAnInB,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAoIzB;;;EAhIjB,IAAA,CAAK,IAAA,EAAM,QAAA,KAAa,OAAA;EAgI2B;;;EA5HnD,OAAA,CAAQ,KAAA,EAAO,MAAA,eAAqB,GAAA,YAAe,OAAA;EA6H9B;;;EAzHrB,EAAA,CAAG,KAAA,EAAO,cAAA,EAAgB,OAAA,EAAS,iBAAA;EA0H1B;;;EAtHT,GAAA,CAAI,KAAA,EAAO,cAAA,EAAgB,OAAA,EAAS,iBAAA;EAwHT;;;EApH3B,IAAA,CAAK,KAAA,EAAO,cAAA,EAAgB,OAAA,EAAS,iBAAA;EAqHnC;;;;;EA/GF,KAAA,EAAO,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,GAAA,YAAe,OAAA;EAiHxB;;;EA7GzB,IAAA,CAAK,IAAA,aAAiB,iBAAA;EA8GZ;;;;;;AAKW;AAgBvB;;;EAxHE,MAAA,EAAQ,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EAoIc;;;EAhI5D,UAAA,EAAY,MAAA,EAAQ,QAAA,GAAW,OAAA;EA2IM;;;;EAtIrC,SAAA,EAAW,MAAA,EAAQ,QAAA,EAAU,OAAA,aAAoB,OAAA;EAwIzB;;;EApIxB,SAAA,EAAW,MAAA,EAAQ,QAAA,GAAW,OAAA;EAwIrB;;;;;;;;;;;;EA3HT,OAAA,UACE,MAAA,YACA,OAAA,EAAS,mBAAA,GACR,OAAA,CAAQ,eAAA,CAAgB,CAAA;AAAA;;;;;;;UASZ,iBAAA;EA4HR;;;EAxHP,IAAA,IAAQ,KAAA,EAAO,CAAA,KAAM,OAAA;EA2HV;;;EAvHX,OAAA,IAAW,KAAA,EAAO,CAAA,KAAM,OAAA;EA2HT;;;EAvHf,GAAA,IAAO,OAAA,CAAQ,CAAA;EA0Hc;;;EAtH7B,KAAA,IAAS,OAAA,CAAQ,CAAA;EAwHN;;;EApHX,KAAA,CAAM,KAAA,WAAgB,GAAA,YAAe,OAAA,CAAQ,CAAA;EAsHtC;;;EAlHP,GAAA,IAAO,OAAA,CAAQ,CAAA;EAqHJ;;;EAjHX,MAAA,IAAU,OAAA;EAoHoB;;;EAhH9B,IAAA,CAAK,KAAA,UAAe,GAAA,WAAc,OAAA;EAqHP;;;EAjH3B,KAAA,IAAS,OAAA;AAAA;;;;;;;;;UAWM,yBAAA;EACf,GAAA,CAAI,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,YAAA,GAAe,QAAA,GAAW,eAAA,GAAkB,OAAA;EAC3E,GAAA,UAAa,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EACrC,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EACpB,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EACvB,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EACtC,OAAA,UAAiB,GAAA,EAAK,QAAA,EAAU,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,CAAA;EACnD,KAAA,CAAM,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,GAAA,YAAe,OAAA;EAChD,QAAA,UACE,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,eAAA,EACzB,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EACX,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAC1C,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EA4CtC;;;;EAvCJ,UAAA,IAAc,OAAA;AAAA;;;;;;;;;;;;;;UAgBC,mBAAA;EA6BN;EAAA,SA3BA,MAAA;EA2BU;;;;;;;;EAjBnB,SAAA,CAAU,MAAA,UAAgB,OAAA,GAAU,qBAAA,GAAwB,mBAAA;EAkBT;;;EAbnD,IAAA,CAAK,IAAA,aAAiB,yBAAA;EAcD;EAXrB,KAAA,IAAS,OAAA;EAGT,GAAA,UAAa,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EACrC,GAAA,CAAI,GAAA,EAAK,QAAA,GAAW,OAAA;EACpB,IAAA,CAAK,IAAA,EAAM,QAAA,KAAa,OAAA;EACxB,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,OAAA,CAAQ,CAAA;EAGtC,GAAA,CAAI,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,YAAA,GAAe,QAAA,GAAW,eAAA,GAAkB,OAAA;EAC3E,OAAA,CAAQ,KAAA,EAAO,MAAA,eAAqB,GAAA,YAAe,OAAA;EACnD,KAAA,CAAM,GAAA,EAAK,QAAA,EAAU,KAAA,OAAY,GAAA,YAAe,OAAA;EAChD,OAAA,UAAiB,GAAA,EAAK,QAAA,EAAU,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,CAAA;EACnD,MAAA,CAAO,GAAA,EAAK,QAAA,GAAW,OAAA;EAGvB,QAAA,UACE,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,eAAA,EACzB,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EACX,GAAA,UACE,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,eAAA,EACT,QAAA,QAAgB,OAAA,CAAQ,CAAA,IACvB,OAAA,CAAQ,CAAA;EAGX,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAC1C,SAAA,CAAU,GAAA,EAAK,QAAA,EAAU,KAAA,YAAiB,OAAA;EAC1C,MAAA,UACE,GAAA,EAAK,QAAA,EACL,EAAA,GAAK,OAAA,EAAS,CAAA,YAAa,CAAA,UAAW,OAAA,CAAQ,CAAA,UAC9C,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EACX,KAAA,WAAgB,MAAA,gBAAsB,MAAA,eACpC,GAAA,EAAK,QAAA,EACL,OAAA,EAAS,OAAA,CAAQ,CAAA,GACjB,OAAA;IAAY,GAAA,GAAM,QAAA;EAAA,IACjB,OAAA,CAAQ,CAAA;EAGX,IAAA,UAAc,GAAA,EAAK,QAAA,GAAW,iBAAA,CAAkB,CAAA;EAGhD,IAAA,IACE,GAAA,EAAK,QAAA,EACL,YAAA,EAAc,QAAA,GAAW,IAAA,CAAK,WAAA,aAC9B,EAAA,QAAU,OAAA,CAAQ,CAAA,IACjB,OAAA,CAAQ,WAAA,CAAY,CAAA;EAGvB,OAAA,UACE,MAAA,YACA,OAAA,EAAS,mBAAA,GACR,OAAA,CAAQ,eAAA,CAAgB,CAAA;AAAA;AAAA,KAGjB,SAAA;EAtCC;;;EA0CX,IAAA;EAxCE;;;EA4CF,SAAA;EA1C0B;;;EA8C1B,GAAA;EA1CA;;;;;;;EAkDA,OAAA;AAAA;AAAA,KAGU,WAAA,aAAwB,WAAW;AAAA,KAE1C,cAAA;AAAA,KAUA,uBAAA,MAA6B,CAAA,qBAAsB,cAAA,GAAiB,cAAA,GAAiB,CAAA;AAAA,KAE9E,mBAAA,wDAEG,uBAAA,CAAwB,CAAA;EAlEnC;;;EAuEF,OAAA,GAAU,UAAA;EAtE8B;;;;;EA4ExC,OAAA;EA1EG;;;EA8EH,OAAA;IACE,KAAA,UAAe,gBAAA;IACf,IAAA,UAAc,eAAA;IACd,IAAA,UAAc,eAAA;IACd,MAAA,UAAgB,iBAAA;IAChB,cAAA,UAAwB,yBAAA;IACxB,GAAA,UAAa,oBAAA;IACb,EAAA,UAAY,aAAA;IACZ,IAAA,UAAc,eAAA;EAAA,cAEN,OAAA,CAAQ,CAAA,oBAAqB,eAAA;EAnF5B;;;EAwFX,OAAA;IACE,KAAA,GAAQ,YAAA;IACR,IAAA,GAAO,gBAAA;IACP,MAAA,GAAS,kBAAA;IACT,cAAA,GAAiB,0BAAA;IACjB,IAAA,GAAO,sBAAA;IACP,GAAA,GAAM,qBAAA;IACN,EAAA,GAAK,cAAA;IACL,IAAA,GAAO,gBAAA;EAAA,cAEC,OAAA,CAAQ,CAAA,aAAc,aAAA;AAAA"}

package/esm/types.mjs

@@ -1,4 +1,4 @@
-//#region ../cache/src/types.ts
+//#region ../../packages/cache/src/types.ts
 /**
 * Base error class for cache-related errors
 */