effect 4.0.0-beta.66 → 4.0.0-beta.67

package/dist/ScopedCache.d.ts

@@ -9,8 +9,16 @@ import * as Predicate from "./Predicate.ts";
 import * as Scope from "./Scope.ts";
 declare const TypeId = "~effect/ScopedCache";
 /**
- * @since 4.0.0
+ * A scoped cache whose values are acquired by a lookup effect and stored in
+ * per-entry scopes.
+ *
+ * Concurrent requests for the same key share the same in-flight lookup.
+ * Entries can expire based on the lookup exit, are evicted when capacity is
+ * exceeded, and release their entry scopes when invalidated, evicted, expired,
+ * or when the cache's owning scope closes.
+ *
  * @category Models
+ * @since 4.0.0
  */
 export interface ScopedCache<in out Key, in out A, in out E = never, out R = never> extends Pipeable {
     readonly [TypeId]: typeof TypeId;
@@ -20,8 +28,14 @@ export interface ScopedCache<in out Key, in out A, in out E = never, out R = nev
     readonly timeToLive: (exit: Exit.Exit<A, E>, key: Key) => Duration.Duration;
 }
 /**
- * @since 4.0.0
+ * Represents whether a `ScopedCache` is open or closed.
+ *
+ * `Open` stores cached entries in access order for reuse and eviction.
+ * `Closed` means the owning scope has closed and the cache can no longer
+ * perform lookup operations.
+ *
  * @category Models
+ * @since 4.0.0
  */
 export type State<K, A, E> = {
     readonly _tag: "Open";
@@ -30,11 +44,14 @@ export type State<K, A, E> = {
     readonly _tag: "Closed";
 };
 /**
- * Represents a cache entry containing a deferred value and optional expiration time.
- * This is used internally by the cache implementation to track cached values and their lifetimes.
+ * A single scoped cache entry.
+ *
+ * The entry contains the deferred lookup result shared by readers, the scope
+ * that owns resources acquired while computing the value, and an optional
+ * expiration time in milliseconds. Removing the entry closes its scope.
  *
- * @since 4.0.0
  * @category Models
+ * @since 4.0.0
  */
 export interface Entry<A, E> {
     expiresAt: number | undefined;
@@ -42,8 +59,17 @@ export interface Entry<A, E> {
     readonly scope: Scope.Closeable;
 }
 /**
- * @since 4.0.0
+ * Creates a `ScopedCache` from a lookup function, maximum capacity, and a
+ * time-to-live function computed from each lookup exit and key.
+ *
+ * The cache must be constructed in a `Scope`. Each lookup runs in its own entry
+ * scope, and that scope is closed when the entry expires, is invalidated, is
+ * evicted by capacity, or when the cache's owning scope closes.
+ * `requireServicesAt` controls whether lookup services are captured at
+ * construction time or required when lookup operations run.
+ *
  * @category Constructors
+ * @since 4.0.0
  */
 export declare const makeWith: <Key, A, E = never, R = never, ServiceMode extends "lookup" | "construction" = never>(options: {
     readonly lookup: (key: Key) => Effect.Effect<A, E, R | Scope.Scope>;
@@ -52,8 +78,15 @@ export declare const makeWith: <Key, A, E = never, R = never, ServiceMode extend
     readonly requireServicesAt?: ServiceMode | undefined;
 }) => Effect.Effect<ScopedCache<Key, A, E, "lookup" extends ServiceMode ? Exclude<R, Scope.Scope> : never>, never, ("lookup" extends ServiceMode ? never : R) | Scope.Scope>;
 /**
- * @since 4.0.0
+ * Creates a `ScopedCache` with a fixed time-to-live for every lookup result.
+ *
+ * This is the constant-TTL variant of `makeWith`: values are acquired by the
+ * lookup effect in per-entry scopes, capacity can evict older entries, and
+ * entry scopes are closed when entries expire, are invalidated, are evicted, or
+ * when the cache's owning scope closes.
+ *
  * @category Constructors
+ * @since 4.0.0
  */
 export declare const make: <Key, A, E = never, R = never, ServiceMode extends "lookup" | "construction" = never>(options: {
     readonly lookup: (key: Key) => Effect.Effect<A, E, R | Scope.Scope>;
@@ -62,34 +95,73 @@ export declare const make: <Key, A, E = never, R = never, ServiceMode extends "l
     readonly requireServicesAt?: ServiceMode | undefined;
 }) => Effect.Effect<ScopedCache<Key, A, E, "lookup" extends ServiceMode ? Exclude<R, Scope.Scope> : never>, never, ("lookup" extends ServiceMode ? never : R) | Scope.Scope>;
 /**
- * @since 4.0.0
+ * Gets the value for a key, running the cache lookup when no unexpired entry is
+ * present.
+ *
+ * Concurrent `get` calls for the same key share the same in-flight lookup.
+ * Successful and failed lookup exits are cached according to the configured
+ * TTL. If the cache is closed, the effect is interrupted.
+ *
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const get: {
     /**
-     * @since 4.0.0
+     * Gets the value for a key, running the cache lookup when no unexpired entry is
+     * present.
+     *
+     * Concurrent `get` calls for the same key share the same in-flight lookup.
+     * Successful and failed lookup exits are cached according to the configured
+     * TTL. If the cache is closed, the effect is interrupted.
+     *
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A>(key: Key): <E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<A, E, R>;
     /**
-     * @since 4.0.0
+     * Gets the value for a key, running the cache lookup when no unexpired entry is
+     * present.
+     *
+     * Concurrent `get` calls for the same key share the same in-flight lookup.
+     * Successful and failed lookup exits are cached according to the configured
+     * TTL. If the cache is closed, the effect is interrupted.
+     *
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A, E, R>(self: ScopedCache<Key, A, E, R>, key: Key): Effect.Effect<A, E, R>;
 };
 /**
- * @since 4.0.0
+ * Reads an existing unexpired cache entry without running the lookup function.
+ *
+ * Returns `Option.none` when the key is absent or expired. If an entry exists,
+ * the effect waits for its cached result and returns `Option.some(value)` on
+ * success, or fails with the cached lookup error.
+ *
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const getOption: {
     /**
-     * @since 4.0.0
+     * Reads an existing unexpired cache entry without running the lookup function.
+     *
+     * Returns `Option.none` when the key is absent or expired. If an entry exists,
+     * the effect waits for its cached result and returns `Option.some(value)` on
+     * success, or fails with the cached lookup error.
+     *
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A>(key: Key): <E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<Option.Option<A>, E>;
     /**
-     * @since 4.0.0
+     * Reads an existing unexpired cache entry without running the lookup function.
+     *
+     * Returns `Option.none` when the key is absent or expired. If an entry exists,
+     * the effect waits for its cached result and returns `Option.some(value)` on
+     * success, or fails with the cached lookup error.
+     *
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A, E, R>(self: ScopedCache<Key, A, E, R>, key: Key): Effect.Effect<Option.Option<A>, E>;
 };
@@ -97,93 +169,111 @@ export declare const getOption: {
  * Retrieves the value associated with the specified key from the cache, only if
  * it contains a resolved successful value.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const getSuccess: {
     /**
      * Retrieves the value associated with the specified key from the cache, only if
      * it contains a resolved successful value.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A, R>(key: Key): <E>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<Option.Option<A>>;
     /**
      * Retrieves the value associated with the specified key from the cache, only if
      * it contains a resolved successful value.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A, E, R>(self: ScopedCache<Key, A, E, R>, key: Key): Effect.Effect<Option.Option<A>>;
 };
 /**
- * Sets the value associated with the specified key in the cache. This will
- * overwrite any existing value for that key, skipping the lookup function.
+ * Stores a successful value for a key without running the lookup function.
+ *
+ * This replaces and closes any existing entry scope for the key, applies the
+ * cache's TTL using a successful exit for the value, and may evict older
+ * entries if the cache capacity is exceeded.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const set: {
     /**
-     * Sets the value associated with the specified key in the cache. This will
-     * overwrite any existing value for that key, skipping the lookup function.
+     * Stores a successful value for a key without running the lookup function.
+     *
+     * This replaces and closes any existing entry scope for the key, applies the
+     * cache's TTL using a successful exit for the value, and may evict older
+     * entries if the cache capacity is exceeded.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A>(key: Key, value: A): <E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<void>;
     /**
-     * Sets the value associated with the specified key in the cache. This will
-     * overwrite any existing value for that key, skipping the lookup function.
+     * Stores a successful value for a key without running the lookup function.
+     *
+     * This replaces and closes any existing entry scope for the key, applies the
+     * cache's TTL using a successful exit for the value, and may evict older
+     * entries if the cache capacity is exceeded.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A, E, R>(self: ScopedCache<Key, A, E, R>, key: Key, value: A): Effect.Effect<void>;
 };
 /**
  * Checks if the cache contains an entry for the specified key.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const has: {
     /**
      * Checks if the cache contains an entry for the specified key.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A>(key: Key): <E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<boolean>;
     /**
      * Checks if the cache contains an entry for the specified key.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A, E, R>(self: ScopedCache<Key, A, E, R>, key: Key): Effect.Effect<boolean>;
 };
 /**
- * Invalidates the entry associated with the specified key in the cache.
+ * Removes the entry associated with a key and closes its entry scope.
+ *
+ * If the key is absent, this is a no-op. If the cache is closed, the effect is
+ * interrupted.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const invalidate: {
     /**
-     * Invalidates the entry associated with the specified key in the cache.
+     * Removes the entry associated with a key and closes its entry scope.
+     *
+     * If the key is absent, this is a no-op. If the cache is closed, the effect is
+     * interrupted.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A>(key: Key): <E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<void>;
     /**
-     * Invalidates the entry associated with the specified key in the cache.
+     * Removes the entry associated with a key and closes its entry scope.
+     *
+     * If the key is absent, this is a no-op. If the cache is closed, the effect is
+     * interrupted.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A, E, R>(self: ScopedCache<Key, A, E, R>, key: Key): Effect.Effect<void>;
 };
@@ -191,24 +281,24 @@ export declare const invalidate: {
  * Conditionally invalidates the entry associated with the specified key in the cache
  * if the predicate returns true for the cached value.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const invalidateWhen: {
     /**
      * Conditionally invalidates the entry associated with the specified key in the cache
      * if the predicate returns true for the cached value.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A>(key: Key, f: Predicate.Predicate<A>): <E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<boolean>;
     /**
      * Conditionally invalidates the entry associated with the specified key in the cache
      * if the predicate returns true for the cached value.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A, E, R>(self: ScopedCache<Key, A, E, R>, key: Key, f: Predicate.Predicate<A>): Effect.Effect<boolean>;
 };
@@ -218,8 +308,8 @@ export declare const invalidateWhen: {
  * It will always invoke the lookup function to construct a new value,
  * overwriting any existing value for that key.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const refresh: {
     /**
@@ -228,8 +318,8 @@ export declare const refresh: {
      * It will always invoke the lookup function to construct a new value,
      * overwriting any existing value for that key.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A>(key: Key): <E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<A, E, R>;
     /**
@@ -238,16 +328,18 @@ export declare const refresh: {
      * It will always invoke the lookup function to construct a new value,
      * overwriting any existing value for that key.
      *
-     * @since 4.0.0
      * @category Combinators
+     * @since 4.0.0
      */
     <Key, A, E, R>(self: ScopedCache<Key, A, E, R>, key: Key): Effect.Effect<A, E, R>;
 };
 /**
- * Invalidates all entries in the cache.
+ * Removes every entry from the cache and closes each entry scope.
+ *
+ * If the cache is closed, the effect is interrupted.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const invalidateAll: <Key, A, E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<void>;
 /**
@@ -257,23 +349,23 @@ export declare const invalidateAll: <Key, A, E, R>(self: ScopedCache<Key, A, E,
  * The size reflects the current number of entries stored, not the number
  * of valid entries.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const size: <Key, A, E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<number>;
 /**
  * Retrieves all active keys from the cache, automatically filtering out expired entries.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const keys: <Key, A, E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<Array<Key>>;
 /**
  * Retrieves all successfully cached values from the cache, excluding failed
  * lookups and expired entries.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const values: <Key, A, E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<Array<A>>;
 /**
@@ -281,8 +373,8 @@ export declare const values: <Key, A, E, R>(self: ScopedCache<Key, A, E, R>) =>
  * only returns entries with successfully resolved values, filtering out any
  * failed lookups or expired entries.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export declare const entries: <Key, A, E, R>(self: ScopedCache<Key, A, E, R>) => Effect.Effect<Array<[Key, A]>>;
 export {};

package/dist/ScopedCache.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ScopedCache.d.ts","sourceRoot":"","sources":["../src/ScopedCache.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AACzC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AACzC,OAAO,KAAK,KAAK,MAAM,MAAM,aAAa,CAAA;AAC1C,OAAO,KAAK,KAAK,IAAI,MAAM,WAAW,CAAA;AAMtC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AACrD,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AACrC,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAC7C,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAC3C,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC,QAAA,MAAM,MAAM,wBAAwB,CAAA;AAEpC;;;GAGG;AACH,MAAM,WAAW,WAAW,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAE,SAAQ,QAAQ;IAClG,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,OAAO,MAAM,CAAA;IAChC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACvB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;IACnE,QAAQ,CAAC,UAAU,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,KAAK,QAAQ,CAAC,QAAQ,CAAA;CAC5E;AAED;;;GAGG;AACH,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,GAAG,EAAE,cAAc,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;CAC5D,GAAG;IACF,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;CACxB,CAAA;AAED;;;;;;GAMG;AACH,MAAM,WAAW,KAAK,CAAC,CAAC,EAAE,CAAC;IACzB,SAAS,EAAE,MAAM,GAAG,SAAS,CAAA;IAC7B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC1C,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAA;CAChC;AAED;;;GAGG;AACH,eAAO,MAAM,QAAQ,GACnB,GAAG,EACH,CAAC,EACD,CAAC,GAAG,KAAK,EACT,CAAC,GAAG,KAAK,EACT,WAAW,SAAS,QAAQ,GAAG,cAAc,GAAG,KAAK,EACrD,SAAS;IACT,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;IACnE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,KAAK,QAAQ,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;IACvF,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,GAAG,SAAS,CAAA;CACrD,KAAG,MAAM,CAAC,MAAM,CACf,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,SAAS,WAAW,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EACtF,KAAK,EACL,CAAC,QAAQ,SAAS,WAAW,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CA0BtD,CAAA;AAEJ;;;GAGG;AACH,eAAO,MAAM,IAAI,GACf,GAAG,EACH,CAAC,EACD,CAAC,GAAG,KAAK,EACT,CAAC,GAAG,KAAK,EACT,WAAW,SAAS,QAAQ,GAAG,cAAc,GAAG,KAAK,EAErD,SAAS;IACP,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;IACnE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,KAAK,GAAG,SAAS,CAAA;IAChD,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,GAAG,SAAS,CAAA;CACrD,KACA,MAAM,CAAC,MAAM,CACd,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,SAAS,WAAW,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EACtF,KAAK,EACL,CAAC,QAAQ,SAAS,WAAW,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAKtD,CAAA;AAgBJ;;;GAGG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB;;;OAGG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACrF;;;OAGG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CA+ClF,CAAA;AA4BD;;;GAGG;AACH,eAAO,MAAM,SAAS,EAAE;IACtB;;;OAGG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACjG;;;OAGG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CAY9F,CAAA;AA4BD;;;;;;GAMG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB;;;;;;OAMG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IAC9F;;;;;;OAMG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;CAkB3F,CAAA;AAED;;;;;;GAMG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB;;;;;;OAMG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC5F;;;;;;OAMG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;CA0CzF,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB;;;;;OAKG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IACrF;;;;;OAKG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;CAOlF,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB;;;;;OAKG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAClF;;;;;OAKG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;CAc5E,CAAA;AAEJ;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,EAAE;IAC3B;;;;;;OAMG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAChH;;;;;;OAMG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;CAyB7G,CAAA;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB;;;;;;;;OAQG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACrF;;;;;;;;OAQG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CA2DlF,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,aAAa,GAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAM5F,CAAA;AAcJ;;;;;;;;;GASG;AACH,eAAO,MAAM,IAAI,GAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CACE,CAAA;AAE3F;;;;;GAKG;AACH,eAAO,MAAM,IAAI,GAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAgBzF,CAAA;AAEJ;;;;;;GAMG;AACH,eAAO,MAAM,MAAM,GAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CACnC,CAAA;AAE1D;;;;;;;GAOG;AACH,eAAO,MAAM,OAAO,GAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAqBjG,CAAA"}
+{"version":3,"file":"ScopedCache.d.ts","sourceRoot":"","sources":["../src/ScopedCache.ts"],"names":[],"mappings":"AA6BA,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AACzC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AACzC,OAAO,KAAK,KAAK,MAAM,MAAM,aAAa,CAAA;AAC1C,OAAO,KAAK,KAAK,IAAI,MAAM,WAAW,CAAA;AAMtC,OAAO,KAAK,cAAc,MAAM,qBAAqB,CAAA;AACrD,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AACrC,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAC7C,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAC3C,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC,QAAA,MAAM,MAAM,wBAAwB,CAAA;AAEpC;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,WAAW,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAE,SAAQ,QAAQ;IAClG,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,OAAO,MAAM,CAAA;IAChC,KAAK,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACvB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;IACnE,QAAQ,CAAC,UAAU,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,KAAK,QAAQ,CAAC,QAAQ,CAAA;CAC5E;AAED;;;;;;;;;GASG;AACH,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,GAAG,EAAE,cAAc,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;CAC5D,GAAG;IACF,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;CACxB,CAAA;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,KAAK,CAAC,CAAC,EAAE,CAAC;IACzB,SAAS,EAAE,MAAM,GAAG,SAAS,CAAA;IAC7B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC1C,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAA;CAChC;AAED;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,QAAQ,GACnB,GAAG,EACH,CAAC,EACD,CAAC,GAAG,KAAK,EACT,CAAC,GAAG,KAAK,EACT,WAAW,SAAS,QAAQ,GAAG,cAAc,GAAG,KAAK,EACrD,SAAS;IACT,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;IACnE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,KAAK,QAAQ,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;IACvF,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,GAAG,SAAS,CAAA;CACrD,KAAG,MAAM,CAAC,MAAM,CACf,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,SAAS,WAAW,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EACtF,KAAK,EACL,CAAC,QAAQ,SAAS,WAAW,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CA0BtD,CAAA;AAEJ;;;;;;;;;;GAUG;AACH,eAAO,MAAM,IAAI,GACf,GAAG,EACH,CAAC,EACD,CAAC,GAAG,KAAK,EACT,CAAC,GAAG,KAAK,EACT,WAAW,SAAS,QAAQ,GAAG,cAAc,GAAG,KAAK,EAErD,SAAS;IACP,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAA;IACnE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,KAAK,GAAG,SAAS,CAAA;IAChD,QAAQ,CAAC,iBAAiB,CAAC,EAAE,WAAW,GAAG,SAAS,CAAA;CACrD,KACA,MAAM,CAAC,MAAM,CACd,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,SAAS,WAAW,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EACtF,KAAK,EACL,CAAC,QAAQ,SAAS,WAAW,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAKtD,CAAA;AAgBJ;;;;;;;;;;GAUG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB;;;;;;;;;;OAUG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACrF;;;;;;;;;;OAUG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CA6DlF,CAAA;AA4BD;;;;;;;;;GASG;AACH,eAAO,MAAM,SAAS,EAAE;IACtB;;;;;;;;;OASG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACjG;;;;;;;;;OASG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CAY9F,CAAA;AA4BD;;;;;;GAMG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB;;;;;;OAMG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IAC9F;;;;;;OAMG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;CAkB3F,CAAA;AAED;;;;;;;;;GASG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB;;;;;;;;;OASG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC5F;;;;;;;;;OASG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;CAgDzF,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB;;;;;OAKG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IACrF;;;;;OAKG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;CAOlF,CAAA;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB;;;;;;;;OAQG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAClF;;;;;;;;OAQG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;CAc5E,CAAA;AAEJ;;;;;;GAMG;AACH,eAAO,MAAM,cAAc,EAAE;IAC3B;;;;;;OAMG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAChH;;;;;;OAMG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;CAyB7G,CAAA;AAED;;;;;;;;GAQG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB;;;;;;;;OAQG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACrF;;;;;;;;OAQG;IACH,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CA2DlF,CAAA;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,aAAa,GAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAM5F,CAAA;AAcJ;;;;;;;;;GASG;AACH,eAAO,MAAM,IAAI,GAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CACE,CAAA;AAE3F;;;;;GAKG;AACH,eAAO,MAAM,IAAI,GAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAgBzF,CAAA;AAEJ;;;;;;GAMG;AACH,eAAO,MAAM,MAAM,GAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CACnC,CAAA;AAE1D;;;;;;;GAOG;AACH,eAAO,MAAM,OAAO,GAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAqBjG,CAAA"}

package/dist/ScopedCache.js

@@ -1,4 +1,28 @@
 /**
+ * The `ScopedCache` module provides a cache for values that acquire scoped
+ * resources during lookup. Each cached entry owns a `Scope`, so resources
+ * created while computing a value stay alive for as long as that entry remains
+ * cached and are released when the entry is removed.
+ *
+ * A `ScopedCache` is itself created inside a scope. Calls to {@link get} run the
+ * lookup effect on cache misses, share the same in-flight lookup among
+ * concurrent callers for the same key, and store the resulting exit according
+ * to a time-to-live policy. Entries can be inserted manually with {@link set},
+ * refreshed with {@link refresh}, inspected without triggering lookup with
+ * {@link getOption}, and removed with {@link invalidate} or
+ * {@link invalidateAll}. Capacity limits evict the oldest entries.
+ *
+ * **Lifecycle notes**
+ *
+ * - Entry scopes are closed when entries expire, are invalidated, are evicted,
+ *   are replaced, or when the cache's owning scope closes
+ * - Successful and failed lookup exits are both cached according to the
+ *   configured TTL
+ * - Expired entries may remain counted by {@link size} until a cache operation
+ *   observes and removes them
+ * - Once the owning scope closes, the cache is closed and lookup-style
+ *   operations interrupt instead of acquiring new values
+ *
  * @since 4.0.0
  */
 import * as Arr from "./Array.js";
@@ -16,8 +40,17 @@ import * as Predicate from "./Predicate.js";
 import * as Scope from "./Scope.js";
 const TypeId = "~effect/ScopedCache";
 /**
- * @since 4.0.0
+ * Creates a `ScopedCache` from a lookup function, maximum capacity, and a
+ * time-to-live function computed from each lookup exit and key.
+ *
+ * The cache must be constructed in a `Scope`. Each lookup runs in its own entry
+ * scope, and that scope is closed when the entry expires, is invalidated, is
+ * evicted by capacity, or when the cache's owning scope closes.
+ * `requireServicesAt` controls whether lookup services are captured at
+ * construction time or required when lookup operations run.
+ *
  * @category Constructors
+ * @since 4.0.0
  */
 export const makeWith = options => effect.contextWith(context => {
   const scope = Context.get(context, Scope.Scope);
@@ -38,8 +71,15 @@ export const makeWith = options => effect.contextWith(context => {
   })), self);
 });
 /**
- * @since 4.0.0
+ * Creates a `ScopedCache` with a fixed time-to-live for every lookup result.
+ *
+ * This is the constant-TTL variant of `makeWith`: values are acquired by the
+ * lookup effect in per-entry scopes, capacity can evict older entries, and
+ * entry scopes are closed when entries expire, are invalidated, are evicted, or
+ * when the cache's owning scope closes.
+ *
  * @category Constructors
+ * @since 4.0.0
  */
 export const make = options => makeWith({
   ...options,
@@ -58,8 +98,15 @@ const Proto = {
 };
 const defaultTimeToLive = (_, _key) => Duration.infinity;
 /**
- * @since 4.0.0
+ * Gets the value for a key, running the cache lookup when no unexpired entry is
+ * present.
+ *
+ * Concurrent `get` calls for the same key share the same in-flight lookup.
+ * Successful and failed lookup exits are cached according to the configured
+ * TTL. If the cache is closed, the effect is interrupted.
+ *
  * @category Combinators
+ * @since 4.0.0
  */
 export const get = /*#__PURE__*/dual(2, (self, key) => effect.uninterruptibleMask(restore => core.withFiber(fiber => {
   const state = self.state;
@@ -111,8 +158,14 @@ const checkCapacity = (parent, map, capacity) => {
   return effect.fiberAwaitAll(fibers);
 };
 /**
- * @since 4.0.0
+ * Reads an existing unexpired cache entry without running the lookup function.
+ *
+ * Returns `Option.none` when the key is absent or expired. If an entry exists,
+ * the effect waits for its cached result and returns `Option.some(value)` on
+ * success, or fails with the cached lookup error.
+ *
  * @category Combinators
+ * @since 4.0.0
  */
 export const getOption = /*#__PURE__*/dual(2, (self, key) => effect.uninterruptibleMask(restore => core.withFiber(fiber => effect.flatMap(getImpl(self, key, fiber), entry => entry ? effect.asSome(restore(Deferred.await(entry.deferred))) : effect.succeedNone))));
 const getImpl = (self, key, fiber, isRead = true) => {
@@ -136,8 +189,8 @@ const getImpl = (self, key, fiber, isRead = true) => {
  * Retrieves the value associated with the specified key from the cache, only if
  * it contains a resolved successful value.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export const getSuccess = /*#__PURE__*/dual(2, (self, key) => effect.uninterruptible(core.withFiber(fiber => effect.map(getImpl(self, key, fiber), entry => {
   const exit = entry?.deferred.effect;
@@ -147,11 +200,14 @@ export const getSuccess = /*#__PURE__*/dual(2, (self, key) => effect.uninterrupt
   return Option.none();
 }))));
 /**
- * Sets the value associated with the specified key in the cache. This will
- * overwrite any existing value for that key, skipping the lookup function.
+ * Stores a successful value for a key without running the lookup function.
+ *
+ * This replaces and closes any existing entry scope for the key, applies the
+ * cache's TTL using a successful exit for the value, and may evict older
+ * entries if the cache capacity is exceeded.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export const set = /*#__PURE__*/dual(3, (self, key, value) => effect.uninterruptible(core.withFiber(fiber => {
   if (self.state._tag === "Closed") {
@@ -174,15 +230,18 @@ export const set = /*#__PURE__*/dual(3, (self, key, value) => effect.uninterrupt
 /**
  * Checks if the cache contains an entry for the specified key.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export const has = /*#__PURE__*/dual(2, (self, key) => effect.uninterruptible(core.withFiber(fiber => effect.map(getImpl(self, key, fiber, false), Predicate.isNotUndefined))));
 /**
- * Invalidates the entry associated with the specified key in the cache.
+ * Removes the entry associated with a key and closes its entry scope.
+ *
+ * If the key is absent, this is a no-op. If the cache is closed, the effect is
+ * interrupted.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export const invalidate = /*#__PURE__*/dual(2, (self, key) => effect.uninterruptible(effect.suspend(() => {
   if (self.state._tag === "Closed") {
@@ -199,8 +258,8 @@ export const invalidate = /*#__PURE__*/dual(2, (self, key) => effect.uninterrupt
  * Conditionally invalidates the entry associated with the specified key in the cache
  * if the predicate returns true for the cached value.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export const invalidateWhen = /*#__PURE__*/dual(3, (self, key, f) => effect.uninterruptibleMask(restore => core.withFiber(fiber => effect.flatMap(getImpl(self, key, fiber, false), entry => {
   if (entry === undefined) {
@@ -222,8 +281,8 @@ export const invalidateWhen = /*#__PURE__*/dual(3, (self, key, f) => effect.unin
  * It will always invoke the lookup function to construct a new value,
  * overwriting any existing value for that key.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export const refresh = /*#__PURE__*/dual(2, (self, key) => effect.uninterruptibleMask(effect.fnUntraced(function* (restore) {
   if (self.state._tag === "Closed") return yield* effect.interrupt;
@@ -261,10 +320,12 @@ export const refresh = /*#__PURE__*/dual(2, (self, key) => effect.uninterruptibl
   return yield* exit;
 })));
 /**
- * Invalidates all entries in the cache.
+ * Removes every entry from the cache and closes each entry scope.
+ *
+ * If the cache is closed, the effect is interrupted.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export const invalidateAll = self => core.withFiber(parent => {
   if (self.state._tag === "Closed") {
@@ -287,15 +348,15 @@ const invalidateAllImpl = (parent, map) => {
  * The size reflects the current number of entries stored, not the number
  * of valid entries.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export const size = self => effect.sync(() => self.state._tag === "Closed" ? 0 : MutableHashMap.size(self.state.map));
 /**
  * Retrieves all active keys from the cache, automatically filtering out expired entries.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export const keys = self => core.withFiber(fiber => {
   if (self.state._tag === "Closed") return effect.succeed([]);
@@ -317,8 +378,8 @@ export const keys = self => core.withFiber(fiber => {
  * Retrieves all successfully cached values from the cache, excluding failed
  * lookups and expired entries.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export const values = self => effect.map(entries(self), Arr.map(([, value]) => value));
 /**
@@ -326,8 +387,8 @@ export const values = self => effect.map(entries(self), Arr.map(([, value]) => v
  * only returns entries with successfully resolved values, filtering out any
  * failed lookups or expired entries.
  *
- * @since 4.0.0
  * @category Combinators
+ * @since 4.0.0
  */
 export const entries = self => core.withFiber(fiber => {
   if (self.state._tag === "Closed") return effect.succeed([]);