@isaacs/ttlcache 1.4.1 → 2.0.1

package/LICENSE.md

@@ -0,0 +1,55 @@
+# Blue Oak Model License
+
+Version 1.0.0
+
+## Purpose
+
+This license gives everyone as much permission to work with
+this software as possible, while protecting contributors
+from liability.
+
+## Acceptance
+
+In order to receive this license, you must agree to its
+rules.  The rules of this license are both obligations
+under that agreement and conditions to your license.
+You must not do anything with this software that triggers
+a rule that you cannot or will not follow.
+
+## Copyright
+
+Each contributor licenses you to do everything with this
+software that would otherwise infringe that contributor's
+copyright in it.
+
+## Notices
+
+You must ensure that everyone who gets a copy of
+any part of this software from you, with or without
+changes, also gets the text of this license or a link to
+<https://blueoakcouncil.org/license/1.0.0>.
+
+## Excuse
+
+If anyone notifies you in writing that you have not
+complied with [Notices](#notices), you can keep your
+license by taking all practical steps to comply within 30
+days after the notice.  If you do not do so, your license
+ends immediately.
+
+## Patent
+
+Each contributor licenses you to do everything with this
+software that would otherwise infringe any patent claims
+they can license or become able to license.
+
+## Reliability
+
+No contributor can revoke this license.
+
+## No Liability
+
+***As far as the law allows, this software comes as is,
+without any warranty or condition, and no contributor
+will be liable to anyone for any damages related to this
+software or this license, under any kind of legal claim.***

package/README.md

@@ -7,7 +7,7 @@ The time-based use-recency-unaware cousin of
 
 Essentially, this is the same API as
 [`lru-cache`](http://npm.im/lru-cache), but it does not do LRU tracking,
-and is bound primarily by time, rather than space.  Since entries are not
+and is bound primarily by time, rather than space. Since entries are not
 purged based on recency of use, it can save a lot of extra work managing
 linked lists, mapping keys to pointers, and so on.
 
@@ -25,7 +25,7 @@ capacity.
 A TTL _must_ be set for every entry, which can be defaulted in the
 constructor.
 
-Custom size calculation is not supported.  Max capacity is simply the count
+Custom size calculation is not supported. Max capacity is simply the count
 of items in the cache.
 
 ```js
@@ -48,7 +48,7 @@ cache.has(1) // returns false
 
 On Node.js, this module uses the `Timeout.unref()` method to
 prevent its internal `setTimeout` calls from keeping the process
-running indefinitely.  However, on other systems such as Deno,
+running indefinitely. However, on other systems such as Deno,
 where the `setTimeout` method does not return an object with an
 `unref()` method, the process will stay open as long as any
 unexpired entry exists in the cache.
@@ -67,41 +67,40 @@ Default export is the `TTLCache` class.
 
 Create a new `TTLCache` object.
 
-* `max` The max number of items to keep in the cache.  Must be
+- `max` The max number of items to keep in the cache. Must be
   positive integer or `Infinity`, defaults to `Infinity` (ie,
   limited only by TTL, not by item count).
-* `ttl` The max time in ms to store items.  Overridable on the `set()`
-  method.  Must be a positive integer or `Infinity` (see note
-  below about immortality hazards).  If `undefined` in
+- `ttl` The max time in ms to store items. Overridable on the `set()`
+  method. Must be a positive integer or `Infinity` (see note
+  below about immortality hazards). If `undefined` in
   constructor, then a TTL _must_ be provided in each `set()`
   call.
-* `updateAgeOnGet` Should the age of an item be updated when it is
-  retrieved?  Defaults to `false`.  Overridable on the `get()` method.
-* `checkAgeOnGet` Check the TTL whenever an item is retrieved
+- `updateAgeOnGet` Should the age of an item be updated when it is
+  retrieved? Defaults to `false`. Overridable on the `get()` method.
+- `checkAgeOnGet` Check the TTL whenever an item is retrieved
   with `get()`. If the item is past its ttl, but the timer has
   not yet fired, then delete it and return undefined. By default,
   the cache will return a value if it has one, even if it is
   technically beyond its TTL.
-* `noUpdateTTL` Should setting a new value for an existing key leave the
-  TTL unchanged?  Defaults to `false`.  Overridable on the `set()` method.
+- `noUpdateTTL` Should setting a new value for an existing key leave the
+  TTL unchanged? Defaults to `false`. Overridable on the `set()` method.
   (Note that TTL is _always_ updated if the item is expired, since that is
   treated as a new `set()` and the old item is no longer relevant.)
-* `dispose` Method called with `(value, key, reason)` when an item is
-  removed from the cache.  Called once item is fully removed from cache.
+- `dispose` Method called with `(value, key, reason)` when an item is
+  removed from the cache. Called once item is fully removed from cache.
   It is safe to re-add at this point, but note that adding when `reason` is
   `'set'` can result in infinite recursion if `noDisponseOnSet` is not
   specified.
 
-    Disposal reasons:
+  Disposal reasons:
+  - `'stale'` TTL expired.
+  - `'set'` Overwritten with a new different value.
+  - `'evict'` Removed from the cache to stay within capacity limit.
+  - `'delete'` Explicitly deleted with `cache.delete()` or
+    `cache.clear()`
 
-    * `'stale'` TTL expired.
-    * `'set'` Overwritten with a new different value.
-    * `'evict'` Removed from the cache to stay within capacity limit.
-    * `'delete'` Explicitly deleted with `cache.delete()` or
-      `cache.clear()`
-
-* `noDisposeOnSet` Do not call `dispose()` method when overwriting a key
-  with a new value.  Defaults to `false`.  Overridable on `set()` method.
+- `noDisposeOnSet` Do not call `dispose()` method when overwriting a key
+  with a new value. Defaults to `false`. Overridable on `set()` method.
 
 When used as an iterator, like `for (const [key, value] of cache)` or
 `[...cache]`, the cache yields the same results as the `entries()` method.
@@ -120,11 +119,11 @@ Returns the cache object.
 
 ### `cache.get(key, {updateAgeOnGet, checkAgeOnGet, ttl} = {})`
 
-Get an item stored in the cache.  Returns `undefined` if the item is not in
+Get an item stored in the cache. Returns `undefined` if the item is not in
 the cache (including if it has expired and been purged).
 
 If `updateAgeOnGet` is `true`, then re-add the item into the
-cache with the updated `ttl` value.  All options default to the
+cache with the updated `ttl` value. All options default to the
 settings on the constructor.
 
 If `checkAgeOnGet`, then an item will be deleted if it is found
@@ -133,14 +132,14 @@ has not yet fired to trigger its expiration.
 
 Note that using `updateAgeOnGet` _can_ effectively simulate a
 "least-recently-used" type of algorithm, by repeatedly updating
-the TTL of items as they are used.  However, if you find yourself
+the TTL of items as they are used. However, if you find yourself
 doing this, consider using
 [`lru-cache`](http://npm.im/lru-cache), as it is much more
 optimized for an LRU use case.
 
 ### `cache.getRemainingTTL(key)`
 
-Return the remaining time before an item expires.  Returns `0` if the item
+Return the remaining time before an item expires. Returns `0` if the item
 is not found in the cache or is already expired.
 
 ### `cache.has(key)`
@@ -158,7 +157,7 @@ Delete all items from the cache.
 ### `cache.entries()`
 
 Return an iterator that walks through each `[key, value]` from soonest
-expiring to latest expiring.  (Items expiring at the same time are walked
+expiring to latest expiring. (Items expiring at the same time are walked
 in insertion order.)
 
 Default iteration method for the cache object.
@@ -189,20 +188,20 @@ You should not ever call these, they are managed automatically.
 
 **Internal**
 
-Removes items which have expired.  Called automatically.
+Removes items which have expired. Called automatically.
 
 ### `purgeToCapacity`
 
 **Internal**
 
-Removes soonest-expiring items when the capacity limit is reached.  Called
+Removes soonest-expiring items when the capacity limit is reached. Called
 automatically.
 
 ### `dispose`
 
 **Internal**
 
-Called when an item is removed from the cache and should be disposed.  Set
+Called when an item is removed from the cache and should be disposed. Set
 this on the constructor options.
 
 ### `setTimer`
@@ -214,8 +213,8 @@ is setup at once. Called automatically.
 
 ## Algorithm
 
-The cache uses two `Map` objects.  The first maps item keys to their
-expiration time, and the second maps item keys to their values.  Then, a
+The cache uses two `Map` objects. The first maps item keys to their
+expiration time, and the second maps item keys to their values. Then, a
 null-prototype object uses the expiration time as keys, with the value
 being an array of all the keys expiring at that time.
 
@@ -226,7 +225,7 @@ fairly good performance:
   arbitrary keys.
 - Objects with solely integer-numeric keys are iterated in sorted numeric
   order rather than insertion order, and insertions in the middle of the
-  key ordering are still very fast.  This is true of all modern JS engines
+  key ordering are still very fast. This is true of all modern JS engines
   tested at the time of this module's creation, but most particularly V8
   (the engine in Node.js).
 
@@ -235,19 +234,19 @@ iteration order, deleting items until we come to the first key greater than
 the current time.
 
 Thus, the `start` time doesn't need to be tracked, only the expiration
-time.  When an item age is updated (either explicitly on `get()`, or by
+time. When an item age is updated (either explicitly on `get()`, or by
 setting to a new value), it is deleted and re-inserted.
 
 ## Immortality Hazards
 
 It is possible to set a TTL of `Infinity`, in which case an item
-will never expire.  As it does not expire, its TTL is not
+will never expire. As it does not expire, its TTL is not
 tracked, and `getRemainingTTL()` will return `Infinity` for that
 key.
 
-If you do this, then the item will never be purged.  Create
+If you do this, then the item will never be purged. Create
 enough immortal values, and the cache will grow to consume all
-available memory.  If find yourself doing this, it's _probably_
+available memory. If find yourself doing this, it's _probably_
 better to use a different data structure, such as a `Map` or
 plain old object to store values, as it will have better
 performance and the hazards will be more obvious.

package/dist/commonjs/index.d.ts

@@ -0,0 +1,46 @@
+export type DisposeReason = 'set' | 'delete' | 'stale' | 'evict';
+export type DisposeFunction<K, V> = (val: V, key: K, reason: DisposeReason) => unknown;
+export type TTLCacheOptions<K, V> = {
+    max?: number;
+    ttl?: number;
+    updateAgeOnGet?: boolean;
+    checkAgeOnGet?: boolean;
+    noUpdateTTL?: boolean;
+    dispose?: DisposeFunction<K, V>;
+    noDisposeOnSet?: boolean;
+};
+export type SetOptions<K, V> = Pick<TTLCacheOptions<K, V>, 'ttl' | 'noUpdateTTL' | 'noDisposeOnSet'>;
+export type GetOptions<K, V> = Pick<TTLCacheOptions<K, V>, 'updateAgeOnGet' | 'ttl' | 'checkAgeOnGet'>;
+export declare class TTLCache<K = unknown, V = unknown> {
+    expirations: Record<number, K[]>;
+    data: Map<K, V>;
+    expirationMap: Map<K, number>;
+    ttl?: number;
+    max: number;
+    updateAgeOnGet: boolean;
+    noUpdateTTL: boolean;
+    noDisposeOnSet: boolean;
+    checkAgeOnGet: boolean;
+    dispose: DisposeFunction<K, V>;
+    timer?: ReturnType<typeof setTimeout>;
+    timerExpiration?: number;
+    constructor({ max, ttl, updateAgeOnGet, checkAgeOnGet, noUpdateTTL, dispose, noDisposeOnSet, }?: TTLCacheOptions<K, V>);
+    setTimer(expiration: number, ttl: number): void;
+    cancelTimer(): void;
+    cancelTimers(): void;
+    clear(): void;
+    setTTL(key: K, ttl?: number | undefined): void;
+    set(key: K, val: V, { ttl, noUpdateTTL, noDisposeOnSet, }?: SetOptions<K, V>): this;
+    has(key: K): boolean;
+    getRemainingTTL(key: K): number;
+    get(key: K, { updateAgeOnGet, ttl, checkAgeOnGet, }?: GetOptions<K, V>): V | undefined;
+    delete(key: K): boolean;
+    purgeToCapacity(): void;
+    get size(): number;
+    purgeStale(): void;
+    entries(): Generator<[K, V], void, unknown>;
+    keys(): Generator<K, void, unknown>;
+    values(): Generator<V, void, unknown>;
+    [Symbol.iterator](): Generator<[K, V], void, unknown>;
+}
+//# sourceMappingURL=index.d.ts.map

package/dist/commonjs/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAoBA,MAAM,MAAM,aAAa,GAAG,KAAK,GAAG,QAAQ,GAAG,OAAO,GAAG,OAAO,CAAA;AAEhE,MAAM,MAAM,eAAe,CAAC,CAAC,EAAE,CAAC,IAAI,CAClC,GAAG,EAAE,CAAC,EACN,GAAG,EAAE,CAAC,EACN,MAAM,EAAE,aAAa,KAClB,OAAO,CAAA;AAEZ,MAAM,MAAM,eAAe,CAAC,CAAC,EAAE,CAAC,IAAI;IAClC,GAAG,CAAC,EAAE,MAAM,CAAA;IACZ,GAAG,CAAC,EAAE,MAAM,CAAA;IACZ,cAAc,CAAC,EAAE,OAAO,CAAA;IACxB,aAAa,CAAC,EAAE,OAAO,CAAA;IACvB,WAAW,CAAC,EAAE,OAAO,CAAA;IACrB,OAAO,CAAC,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC/B,cAAc,CAAC,EAAE,OAAO,CAAA;CACzB,CAAA;AAED,MAAM,MAAM,UAAU,CAAC,CAAC,EAAE,CAAC,IAAI,IAAI,CACjC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,EACrB,KAAK,GAAG,aAAa,GAAG,gBAAgB,CACzC,CAAA;AACD,MAAM,MAAM,UAAU,CAAC,CAAC,EAAE,CAAC,IAAI,IAAI,CACjC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,EACrB,gBAAgB,GAAG,KAAK,GAAG,eAAe,CAC3C,CAAA;AAED,qBAAa,QAAQ,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,OAAO;IAC5C,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAsB;IACtD,IAAI,YAAkB;IACtB,aAAa,iBAAuB;IACpC,GAAG,CAAC,EAAE,MAAM,CAAA;IACZ,GAAG,EAAE,MAAM,CAAA;IACX,cAAc,EAAE,OAAO,CAAA;IACvB,WAAW,EAAE,OAAO,CAAA;IACpB,cAAc,EAAE,OAAO,CAAA;IACvB,aAAa,EAAE,OAAO,CAAA;IACtB,OAAO,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC9B,KAAK,CAAC,EAAE,UAAU,CAAC,OAAO,UAAU,CAAC,CAAA;IACrC,eAAe,CAAC,EAAE,MAAM,CAAA;gBAEZ,EACV,GAAc,EACd,GAAG,EACH,cAAsB,EACtB,aAAqB,EACrB,WAAmB,EACnB,OAAO,EACP,cAAsB,GACvB,GAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAM;IA4B7B,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM;IA+BxC,WAAW;IASX,YAAY;IAUZ,KAAK;IAaL,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,qBAAW;IAyB7B,GAAG,CACD,GAAG,EAAE,CAAC,EACN,GAAG,EAAE,CAAC,EACN,EACE,GAAc,EACd,WAA8B,EAC9B,cAAoC,GACrC,GAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAM;IA6B1B,GAAG,CAAC,GAAG,EAAE,CAAC;IAIV,eAAe,CAAC,GAAG,EAAE,CAAC;IAStB,GAAG,CACD,GAAG,EAAE,CAAC,EACN,EACE,cAAoC,EACpC,GAAc,EACd,aAAkC,GACnC,GAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAM;IAa1B,MAAM,CAAC,GAAG,EAAE,CAAC;IAuBb,eAAe;IA8Bf,IAAI,IAAI,WAEP;IAED,UAAU;IA4BT,OAAO;IAOP,IAAI;IAOJ,MAAM;IAOP,CAAC,MAAM,CAAC,QAAQ,CAAC;CAGlB"}

package/dist/commonjs/index.js

@@ -0,0 +1,290 @@
+"use strict";
+// A simple TTL cache with max capacity option, ms resolution,
+// autopurge, and reasonably optimized performance
+// Relies on the fact that integer Object keys are kept sorted,
+// and managed very efficiently by V8.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TTLCache = void 0;
+/* c8 ignore start */
+const perf = typeof performance === 'object' &&
+    performance &&
+    typeof performance.now === 'function'
+    ? performance
+    : Date;
+/* c8 ignore stop */
+const now = () => perf.now();
+const isPosInt = (n) => !!n && n === Math.floor(n) && n > 0 && isFinite(n);
+const isPosIntOrInf = (n) => n === Infinity || isPosInt(n);
+class TTLCache {
+    expirations = Object.create(null);
+    data = new Map();
+    expirationMap = new Map();
+    ttl;
+    max;
+    updateAgeOnGet;
+    noUpdateTTL;
+    noDisposeOnSet;
+    checkAgeOnGet;
+    dispose;
+    timer;
+    timerExpiration;
+    constructor({ max = Infinity, ttl, updateAgeOnGet = false, checkAgeOnGet = false, noUpdateTTL = false, dispose, noDisposeOnSet = false, } = {}) {
+        if (ttl !== undefined && !isPosIntOrInf(ttl)) {
+            throw new TypeError('ttl must be positive integer or Infinity if set');
+        }
+        if (!isPosIntOrInf(max)) {
+            throw new TypeError('max must be positive integer or Infinity');
+        }
+        this.ttl = ttl;
+        this.max = max;
+        this.updateAgeOnGet = !!updateAgeOnGet;
+        this.checkAgeOnGet = !!checkAgeOnGet;
+        this.noUpdateTTL = !!noUpdateTTL;
+        this.noDisposeOnSet = !!noDisposeOnSet;
+        if (dispose !== undefined) {
+            if (typeof dispose !== 'function') {
+                throw new TypeError('dispose must be function if set');
+            }
+            this.dispose = dispose;
+        }
+        else {
+            this.dispose = (_, __, ___) => { };
+        }
+        this.timer = undefined;
+        this.timerExpiration = undefined;
+    }
+    setTimer(expiration, ttl) {
+        if (this.timerExpiration && this.timerExpiration < expiration) {
+            return;
+        }
+        if (this.timer) {
+            clearTimeout(this.timer);
+        }
+        const t = setTimeout(() => {
+            this.timer = undefined;
+            this.timerExpiration = undefined;
+            this.purgeStale();
+            for (const exp in this.expirations) {
+                const e = Number(exp);
+                this.setTimer(e, e - now());
+                break;
+            }
+        }, ttl);
+        /* c8 ignore start - affordance for non-node envs */
+        if (t.unref)
+            t.unref();
+        /* c8 ignore stop */
+        this.timerExpiration = expiration;
+        this.timer = t;
+    }
+    // hang onto the timer so we can clearTimeout if all items
+    // are deleted.  Deno doesn't have Timer.unref(), so it
+    // hangs otherwise.
+    cancelTimer() {
+        if (this.timer) {
+            clearTimeout(this.timer);
+            this.timerExpiration = undefined;
+            this.timer = undefined;
+        }
+    }
+    /* c8 ignore start */
+    cancelTimers() {
+        process.emitWarning('TTLCache.cancelTimers has been renamed to ' +
+            'TTLCache.cancelTimer (no "s"), and will be removed in the next ' +
+            'major version update');
+        return this.cancelTimer();
+    }
+    /* c8 ignore stop */
+    clear() {
+        const entries = this.dispose !== TTLCache.prototype.dispose ? [...this] : [];
+        this.data.clear();
+        this.expirationMap.clear();
+        // no need for any purging now
+        this.cancelTimer();
+        this.expirations = Object.create(null);
+        for (const [key, val] of entries) {
+            this.dispose(val, key, 'delete');
+        }
+    }
+    setTTL(key, ttl = this.ttl) {
+        const current = this.expirationMap.get(key);
+        if (current !== undefined) {
+            // remove from the expirations list, so it isn't purged
+            const exp = this.expirations[current];
+            if (!exp || exp.length <= 1) {
+                delete this.expirations[current];
+            }
+            else {
+                this.expirations[current] = exp.filter(k => k !== key);
+            }
+        }
+        if (ttl && ttl !== Infinity) {
+            const expiration = Math.floor(now() + ttl);
+            this.expirationMap.set(key, expiration);
+            if (!this.expirations[expiration]) {
+                this.expirations[expiration] = [];
+                this.setTimer(expiration, ttl);
+            }
+            this.expirations[expiration].push(key);
+        }
+        else {
+            this.expirationMap.set(key, Infinity);
+        }
+    }
+    set(key, val, { ttl = this.ttl, noUpdateTTL = this.noUpdateTTL, noDisposeOnSet = this.noDisposeOnSet, } = {}) {
+        if (!isPosIntOrInf(ttl)) {
+            throw new TypeError('ttl must be positive integer or Infinity');
+        }
+        if (this.expirationMap.has(key)) {
+            if (!noUpdateTTL) {
+                this.setTTL(key, ttl);
+            }
+            // has old value
+            const oldValue = this.data.get(key);
+            if (oldValue !== undefined && oldValue !== val) {
+                this.data.set(key, val);
+                if (!noDisposeOnSet) {
+                    this.dispose(oldValue, key, 'set');
+                }
+            }
+        }
+        else {
+            this.setTTL(key, ttl);
+            this.data.set(key, val);
+        }
+        while (this.size > this.max) {
+            this.purgeToCapacity();
+        }
+        return this;
+    }
+    has(key) {
+        return this.data.has(key);
+    }
+    getRemainingTTL(key) {
+        const expiration = this.expirationMap.get(key);
+        return expiration === Infinity
+            ? expiration
+            : expiration !== undefined
+                ? Math.max(0, Math.ceil(expiration - now()))
+                : 0;
+    }
+    get(key, { updateAgeOnGet = this.updateAgeOnGet, ttl = this.ttl, checkAgeOnGet = this.checkAgeOnGet, } = {}) {
+        const val = this.data.get(key);
+        if (checkAgeOnGet && this.getRemainingTTL(key) === 0) {
+            this.delete(key);
+            return undefined;
+        }
+        if (updateAgeOnGet) {
+            this.setTTL(key, ttl);
+        }
+        return val;
+    }
+    delete(key) {
+        const current = this.expirationMap.get(key);
+        if (current !== undefined) {
+            const value = this.data.get(key);
+            this.data.delete(key);
+            this.expirationMap.delete(key);
+            const exp = this.expirations[current];
+            if (exp) {
+                if (exp.length <= 1) {
+                    delete this.expirations[current];
+                }
+                else {
+                    this.expirations[current] = exp.filter(k => k !== key);
+                }
+            }
+            this.dispose(value, key, 'delete');
+            if (this.size === 0) {
+                this.cancelTimer();
+            }
+            return true;
+        }
+        return false;
+    }
+    purgeToCapacity() {
+        for (const exp in this.expirations) {
+            const keys = this.expirations[exp];
+            if (this.size - keys.length >= this.max) {
+                delete this.expirations[exp];
+                const entries = [];
+                for (const key of keys) {
+                    entries.push([key, this.data.get(key)]);
+                    this.data.delete(key);
+                    this.expirationMap.delete(key);
+                }
+                for (const [key, val] of entries) {
+                    this.dispose(val, key, 'evict');
+                }
+            }
+            else {
+                const s = this.size - this.max;
+                const entries = [];
+                for (const key of keys.splice(0, s)) {
+                    entries.push([key, this.data.get(key)]);
+                    this.data.delete(key);
+                    this.expirationMap.delete(key);
+                }
+                for (const [key, val] of entries) {
+                    this.dispose(val, key, 'evict');
+                }
+                return;
+            }
+        }
+    }
+    get size() {
+        return this.data.size;
+    }
+    purgeStale() {
+        const n = Math.ceil(now());
+        for (const exp in this.expirations) {
+            if (exp === 'Infinity' || Number(exp) > n) {
+                return;
+            }
+            /* c8 ignore start
+             * mysterious need for a guard here?
+             * https://github.com/isaacs/ttlcache/issues/26 */
+            const keys = [...(this.expirations[exp] || [])];
+            /* c8 ignore stop */
+            const entries = [];
+            delete this.expirations[exp];
+            for (const key of keys) {
+                entries.push([key, this.data.get(key)]);
+                this.data.delete(key);
+                this.expirationMap.delete(key);
+            }
+            for (const [key, val] of entries) {
+                this.dispose(val, key, 'stale');
+            }
+        }
+        if (this.size === 0) {
+            this.cancelTimer();
+        }
+    }
+    *entries() {
+        for (const exp in this.expirations) {
+            for (const key of this.expirations[exp]) {
+                yield [key, this.data.get(key)];
+            }
+        }
+    }
+    *keys() {
+        for (const exp in this.expirations) {
+            for (const key of this.expirations[exp]) {
+                yield key;
+            }
+        }
+    }
+    *values() {
+        for (const exp in this.expirations) {
+            for (const key of this.expirations[exp]) {
+                yield this.data.get(key);
+            }
+        }
+    }
+    [Symbol.iterator]() {
+        return this.entries();
+    }
+}
+exports.TTLCache = TTLCache;
+//# sourceMappingURL=index.js.map

package/dist/commonjs/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";AAAA,8DAA8D;AAC9D,kDAAkD;AAClD,+DAA+D;AAC/D,sCAAsC;;;AAEtC,qBAAqB;AACrB,MAAM,IAAI,GACR,OAAO,WAAW,KAAK,QAAQ;IAC/B,WAAW;IACX,OAAO,WAAW,CAAC,GAAG,KAAK,UAAU;IACnC,CAAC,CAAC,WAAW;IACb,CAAC,CAAC,IAAI,CAAA;AACV,oBAAoB;AAEpB,MAAM,GAAG,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;AAC5B,MAAM,QAAQ,GAAG,CAAC,CAAM,EAAe,EAAE,CACvC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAA;AACpD,MAAM,aAAa,GAAG,CAAC,CAAM,EAAe,EAAE,CAC5C,CAAC,KAAK,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAA;AA6B/B,MAAa,QAAQ;IACnB,WAAW,GAAwB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACtD,IAAI,GAAG,IAAI,GAAG,EAAQ,CAAA;IACtB,aAAa,GAAG,IAAI,GAAG,EAAa,CAAA;IACpC,GAAG,CAAS;IACZ,GAAG,CAAQ;IACX,cAAc,CAAS;IACvB,WAAW,CAAS;IACpB,cAAc,CAAS;IACvB,aAAa,CAAS;IACtB,OAAO,CAAuB;IAC9B,KAAK,CAAgC;IACrC,eAAe,CAAS;IAExB,YAAY,EACV,GAAG,GAAG,QAAQ,EACd,GAAG,EACH,cAAc,GAAG,KAAK,EACtB,aAAa,GAAG,KAAK,EACrB,WAAW,GAAG,KAAK,EACnB,OAAO,EACP,cAAc,GAAG,KAAK,MACG,EAAE;QAC3B,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7C,MAAM,IAAI,SAAS,CACjB,iDAAiD,CAClD,CAAA;QACH,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,SAAS,CAAC,0CAA0C,CAAC,CAAA;QACjE,CAAC;QACD,IAAI,CAAC,GAAG,GAAG,GAAG,CAAA;QACd,IAAI,CAAC,GAAG,GAAG,GAAG,CAAA;QACd,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAA;QACtC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAA;QACpC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAA;QAChC,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAA;QACtC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,OAAO,OAAO,KAAK,UAAU,EAAE,CAAC;gBAClC,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAA;YACxD,CAAC;YACD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACxB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,GAAE,CAAC,CAAA;QACnC,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,SAAS,CAAA;QACtB,IAAI,CAAC,eAAe,GAAG,SAAS,CAAA;IAClC,CAAC;IAED,QAAQ,CAAC,UAAkB,EAAE,GAAW;QACtC,IAAI,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,eAAe,GAAG,UAAU,EAAE,CAAC;YAC9D,OAAM;QACR,CAAC;QAED,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC1B,CAAC;QAED,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,EAAE;YACxB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAA;YACtB,IAAI,CAAC,eAAe,GAAG,SAAS,CAAA;YAChC,IAAI,CAAC,UAAU,EAAE,CAAA;YACjB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAA;gBACrB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,CAAA;gBAC3B,MAAK;YACP,CAAC;QACH,CAAC,EAAE,GAAG,CAAC,CAAA;QAEP,oDAAoD;QACpD,IAAI,CAAC,CAAC,KAAK;YAAE,CAAC,CAAC,KAAK,EAAE,CAAA;QACtB,oBAAoB;QAEpB,IAAI,CAAC,eAAe,GAAG,UAAU,CAAA;QACjC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;IAChB,CAAC;IAED,0DAA0D;IAC1D,uDAAuD;IACvD,mBAAmB;IACnB,WAAW;QACT,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACxB,IAAI,CAAC,eAAe,GAAG,SAAS,CAAA;YAChC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAA;QACxB,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,YAAY;QACV,OAAO,CAAC,WAAW,CACjB,4CAA4C;YAC1C,iEAAiE;YACjE,sBAAsB,CACzB,CAAA;QACD,OAAO,IAAI,CAAC,WAAW,EAAE,CAAA;IAC3B,CAAC;IACD,oBAAoB;IAEpB,KAAK;QACH,MAAM,OAAO,GACX,IAAI,CAAC,OAAO,KAAK,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;QAC9D,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAA;QACjB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAA;QAC1B,8BAA8B;QAC9B,IAAI,CAAC,WAAW,EAAE,CAAA;QAClB,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACtC,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAmB,EAAE,CAAC;YAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAA;QAClC,CAAC;IACH,CAAC;IAED,MAAM,CAAC,GAAM,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG;QAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC3C,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,uDAAuD;YACvD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAA;YACrC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC5B,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAA;YAClC,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAA;YACxD,CAAC;QACH,CAAC;QAED,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAA;YAC1C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAA;YACvC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,EAAE,CAAA;gBACjC,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,GAAG,CAAC,CAAA;YAChC,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACxC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAA;QACvC,CAAC;IACH,CAAC;IAED,GAAG,CACD,GAAM,EACN,GAAM,EACN,EACE,GAAG,GAAG,IAAI,CAAC,GAAG,EACd,WAAW,GAAG,IAAI,CAAC,WAAW,EAC9B,cAAc,GAAG,IAAI,CAAC,cAAc,MAChB,EAAE;QAExB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,SAAS,CAAC,0CAA0C,CAAC,CAAA;QACjE,CAAC;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,WAAW,EAAE,CAAC;gBACjB,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;YACvB,CAAC;YACD,gBAAgB;YAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACnC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,GAAG,EAAE,CAAC;gBAC/C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;gBACvB,IAAI,CAAC,cAAc,EAAE,CAAC;oBACpB,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,EAAE,KAAK,CAAC,CAAA;gBACpC,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;YACrB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QACzB,CAAC;QAED,OAAO,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC5B,IAAI,CAAC,eAAe,EAAE,CAAA;QACxB,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC3B,CAAC;IAED,eAAe,CAAC,GAAM;QACpB,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC9C,OAAO,UAAU,KAAK,QAAQ;YAC5B,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,UAAU,KAAK,SAAS;gBACxB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC,CAAC;gBAC5C,CAAC,CAAC,CAAC,CAAA;IACT,CAAC;IAED,GAAG,CACD,GAAM,EACN,EACE,cAAc,GAAG,IAAI,CAAC,cAAc,EACpC,GAAG,GAAG,IAAI,CAAC,GAAG,EACd,aAAa,GAAG,IAAI,CAAC,aAAa,MACd,EAAE;QAExB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC9B,IAAI,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACrD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAChB,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,IAAI,cAAc,EAAE,CAAC;YACnB,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QACvB,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC3C,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAM,CAAA;YACrC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YACrB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAA;YACrC,IAAI,GAAG,EAAE,CAAC;gBACR,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;oBACpB,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAA;gBAClC,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAA;gBACxD,CAAC;YACH,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAA;YAClC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACpB,IAAI,CAAC,WAAW,EAAE,CAAA;YACpB,CAAC;YACD,OAAO,IAAI,CAAA;QACb,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,eAAe;QACb,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAQ,CAAA;YACzC,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;gBACxC,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;gBAC5B,MAAM,OAAO,GAAa,EAAE,CAAA;gBAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;oBACvB,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAM,CAAC,CAAC,CAAA;oBAC5C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;oBACrB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBAChC,CAAC;gBACD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;oBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,CAAA;gBACjC,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAA;gBAC9B,MAAM,OAAO,GAAa,EAAE,CAAA;gBAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACpC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAM,CAAC,CAAC,CAAA;oBAC5C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;oBACrB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBAChC,CAAC;gBACD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;oBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,CAAA;gBACjC,CAAC;gBACD,OAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;IACvB,CAAC;IAED,UAAU;QACR,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAA;QAC1B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnC,IAAI,GAAG,KAAK,UAAU,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1C,OAAM;YACR,CAAC;YAED;;8DAEkD;YAClD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;YAC/C,oBAAoB;YACpB,MAAM,OAAO,GAAa,EAAE,CAAA;YAC5B,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;YAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAM,CAAC,CAAC,CAAA;gBAC5C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;gBACrB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAChC,CAAC;YACD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;gBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,CAAA;YACjC,CAAC;QACH,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,WAAW,EAAE,CAAA;QACpB,CAAC;IACH,CAAC;IAED,CAAC,OAAO;QACN,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAQ,EAAE,CAAC;gBAC/C,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAW,CAAA;YAC3C,CAAC;QACH,CAAC;IACH,CAAC;IACD,CAAC,IAAI;QACH,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAQ,EAAE,CAAC;gBAC/C,MAAM,GAAG,CAAA;YACX,CAAC;QACH,CAAC;IACH,CAAC;IACD,CAAC,MAAM;QACL,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAQ,EAAE,CAAC;gBAC/C,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAM,CAAA;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IACD,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,OAAO,EAAE,CAAA;IACvB,CAAC;CACF;AA3TD,4BA2TC","sourcesContent":["// A simple TTL cache with max capacity option, ms resolution,\n// autopurge, and reasonably optimized performance\n// Relies on the fact that integer Object keys are kept sorted,\n// and managed very efficiently by V8.\n\n/* c8 ignore start */\nconst perf =\n  typeof performance === 'object' &&\n  performance &&\n  typeof performance.now === 'function'\n    ? performance\n    : Date\n/* c8 ignore stop */\n\nconst now = () => perf.now()\nconst isPosInt = (n: any): n is number =>\n  !!n && n === Math.floor(n) && n > 0 && isFinite(n)\nconst isPosIntOrInf = (n: any): n is number =>\n  n === Infinity || isPosInt(n)\n\nexport type DisposeReason = 'set' | 'delete' | 'stale' | 'evict'\n\nexport type DisposeFunction<K, V> = (\n  val: V,\n  key: K,\n  reason: DisposeReason,\n) => unknown\n\nexport type TTLCacheOptions<K, V> = {\n  max?: number\n  ttl?: number\n  updateAgeOnGet?: boolean\n  checkAgeOnGet?: boolean\n  noUpdateTTL?: boolean\n  dispose?: DisposeFunction<K, V>\n  noDisposeOnSet?: boolean\n}\n\nexport type SetOptions<K, V> = Pick<\n  TTLCacheOptions<K, V>,\n  'ttl' | 'noUpdateTTL' | 'noDisposeOnSet'\n>\nexport type GetOptions<K, V> = Pick<\n  TTLCacheOptions<K, V>,\n  'updateAgeOnGet' | 'ttl' | 'checkAgeOnGet'\n>\n\nexport class TTLCache<K = unknown, V = unknown> {\n  expirations: Record<number, K[]> = Object.create(null)\n  data = new Map<K, V>()\n  expirationMap = new Map<K, number>()\n  ttl?: number\n  max: number\n  updateAgeOnGet: boolean\n  noUpdateTTL: boolean\n  noDisposeOnSet: boolean\n  checkAgeOnGet: boolean\n  dispose: DisposeFunction<K, V>\n  timer?: ReturnType<typeof setTimeout>\n  timerExpiration?: number\n\n  constructor({\n    max = Infinity,\n    ttl,\n    updateAgeOnGet = false,\n    checkAgeOnGet = false,\n    noUpdateTTL = false,\n    dispose,\n    noDisposeOnSet = false,\n  }: TTLCacheOptions<K, V> = {}) {\n    if (ttl !== undefined && !isPosIntOrInf(ttl)) {\n      throw new TypeError(\n        'ttl must be positive integer or Infinity if set',\n      )\n    }\n    if (!isPosIntOrInf(max)) {\n      throw new TypeError('max must be positive integer or Infinity')\n    }\n    this.ttl = ttl\n    this.max = max\n    this.updateAgeOnGet = !!updateAgeOnGet\n    this.checkAgeOnGet = !!checkAgeOnGet\n    this.noUpdateTTL = !!noUpdateTTL\n    this.noDisposeOnSet = !!noDisposeOnSet\n    if (dispose !== undefined) {\n      if (typeof dispose !== 'function') {\n        throw new TypeError('dispose must be function if set')\n      }\n      this.dispose = dispose\n    } else {\n      this.dispose = (_, __, ___) => {}\n    }\n\n    this.timer = undefined\n    this.timerExpiration = undefined\n  }\n\n  setTimer(expiration: number, ttl: number) {\n    if (this.timerExpiration && this.timerExpiration < expiration) {\n      return\n    }\n\n    if (this.timer) {\n      clearTimeout(this.timer)\n    }\n\n    const t = setTimeout(() => {\n      this.timer = undefined\n      this.timerExpiration = undefined\n      this.purgeStale()\n      for (const exp in this.expirations) {\n        const e = Number(exp)\n        this.setTimer(e, e - now())\n        break\n      }\n    }, ttl)\n\n    /* c8 ignore start - affordance for non-node envs */\n    if (t.unref) t.unref()\n    /* c8 ignore stop */\n\n    this.timerExpiration = expiration\n    this.timer = t\n  }\n\n  // hang onto the timer so we can clearTimeout if all items\n  // are deleted.  Deno doesn't have Timer.unref(), so it\n  // hangs otherwise.\n  cancelTimer() {\n    if (this.timer) {\n      clearTimeout(this.timer)\n      this.timerExpiration = undefined\n      this.timer = undefined\n    }\n  }\n\n  /* c8 ignore start */\n  cancelTimers() {\n    process.emitWarning(\n      'TTLCache.cancelTimers has been renamed to ' +\n        'TTLCache.cancelTimer (no \"s\"), and will be removed in the next ' +\n        'major version update',\n    )\n    return this.cancelTimer()\n  }\n  /* c8 ignore stop */\n\n  clear() {\n    const entries =\n      this.dispose !== TTLCache.prototype.dispose ? [...this] : []\n    this.data.clear()\n    this.expirationMap.clear()\n    // no need for any purging now\n    this.cancelTimer()\n    this.expirations = Object.create(null)\n    for (const [key, val] of entries as [K, V][]) {\n      this.dispose(val, key, 'delete')\n    }\n  }\n\n  setTTL(key: K, ttl = this.ttl) {\n    const current = this.expirationMap.get(key)\n    if (current !== undefined) {\n      // remove from the expirations list, so it isn't purged\n      const exp = this.expirations[current]\n      if (!exp || exp.length <= 1) {\n        delete this.expirations[current]\n      } else {\n        this.expirations[current] = exp.filter(k => k !== key)\n      }\n    }\n\n    if (ttl && ttl !== Infinity) {\n      const expiration = Math.floor(now() + ttl)\n      this.expirationMap.set(key, expiration)\n      if (!this.expirations[expiration]) {\n        this.expirations[expiration] = []\n        this.setTimer(expiration, ttl)\n      }\n      this.expirations[expiration].push(key)\n    } else {\n      this.expirationMap.set(key, Infinity)\n    }\n  }\n\n  set(\n    key: K,\n    val: V,\n    {\n      ttl = this.ttl,\n      noUpdateTTL = this.noUpdateTTL,\n      noDisposeOnSet = this.noDisposeOnSet,\n    }: SetOptions<K, V> = {},\n  ) {\n    if (!isPosIntOrInf(ttl)) {\n      throw new TypeError('ttl must be positive integer or Infinity')\n    }\n    if (this.expirationMap.has(key)) {\n      if (!noUpdateTTL) {\n        this.setTTL(key, ttl)\n      }\n      // has old value\n      const oldValue = this.data.get(key)\n      if (oldValue !== undefined && oldValue !== val) {\n        this.data.set(key, val)\n        if (!noDisposeOnSet) {\n          this.dispose(oldValue, key, 'set')\n        }\n      }\n    } else {\n      this.setTTL(key, ttl)\n      this.data.set(key, val)\n    }\n\n    while (this.size > this.max) {\n      this.purgeToCapacity()\n    }\n\n    return this\n  }\n\n  has(key: K) {\n    return this.data.has(key)\n  }\n\n  getRemainingTTL(key: K) {\n    const expiration = this.expirationMap.get(key)\n    return expiration === Infinity\n      ? expiration\n      : expiration !== undefined\n        ? Math.max(0, Math.ceil(expiration - now()))\n        : 0\n  }\n\n  get(\n    key: K,\n    {\n      updateAgeOnGet = this.updateAgeOnGet,\n      ttl = this.ttl,\n      checkAgeOnGet = this.checkAgeOnGet,\n    }: GetOptions<K, V> = {},\n  ) {\n    const val = this.data.get(key)\n    if (checkAgeOnGet && this.getRemainingTTL(key) === 0) {\n      this.delete(key)\n      return undefined\n    }\n    if (updateAgeOnGet) {\n      this.setTTL(key, ttl)\n    }\n    return val\n  }\n\n  delete(key: K) {\n    const current = this.expirationMap.get(key)\n    if (current !== undefined) {\n      const value = this.data.get(key) as V\n      this.data.delete(key)\n      this.expirationMap.delete(key)\n      const exp = this.expirations[current]\n      if (exp) {\n        if (exp.length <= 1) {\n          delete this.expirations[current]\n        } else {\n          this.expirations[current] = exp.filter(k => k !== key)\n        }\n      }\n      this.dispose(value, key, 'delete')\n      if (this.size === 0) {\n        this.cancelTimer()\n      }\n      return true\n    }\n    return false\n  }\n\n  purgeToCapacity() {\n    for (const exp in this.expirations) {\n      const keys = this.expirations[exp] as K[]\n      if (this.size - keys.length >= this.max) {\n        delete this.expirations[exp]\n        const entries: [K, V][] = []\n        for (const key of keys) {\n          entries.push([key, this.data.get(key) as V])\n          this.data.delete(key)\n          this.expirationMap.delete(key)\n        }\n        for (const [key, val] of entries) {\n          this.dispose(val, key, 'evict')\n        }\n      } else {\n        const s = this.size - this.max\n        const entries: [K, V][] = []\n        for (const key of keys.splice(0, s)) {\n          entries.push([key, this.data.get(key) as V])\n          this.data.delete(key)\n          this.expirationMap.delete(key)\n        }\n        for (const [key, val] of entries) {\n          this.dispose(val, key, 'evict')\n        }\n        return\n      }\n    }\n  }\n\n  get size() {\n    return this.data.size\n  }\n\n  purgeStale() {\n    const n = Math.ceil(now())\n    for (const exp in this.expirations) {\n      if (exp === 'Infinity' || Number(exp) > n) {\n        return\n      }\n\n      /* c8 ignore start\n       * mysterious need for a guard here?\n       * https://github.com/isaacs/ttlcache/issues/26 */\n      const keys = [...(this.expirations[exp] || [])]\n      /* c8 ignore stop */\n      const entries: [K, V][] = []\n      delete this.expirations[exp]\n      for (const key of keys) {\n        entries.push([key, this.data.get(key) as V])\n        this.data.delete(key)\n        this.expirationMap.delete(key)\n      }\n      for (const [key, val] of entries) {\n        this.dispose(val, key, 'stale')\n      }\n    }\n    if (this.size === 0) {\n      this.cancelTimer()\n    }\n  }\n\n  *entries() {\n    for (const exp in this.expirations) {\n      for (const key of this.expirations[exp] as K[]) {\n        yield [key, this.data.get(key)] as [K, V]\n      }\n    }\n  }\n  *keys() {\n    for (const exp in this.expirations) {\n      for (const key of this.expirations[exp] as K[]) {\n        yield key\n      }\n    }\n  }\n  *values() {\n    for (const exp in this.expirations) {\n      for (const key of this.expirations[exp] as K[]) {\n        yield this.data.get(key) as V\n      }\n    }\n  }\n  [Symbol.iterator]() {\n    return this.entries()\n  }\n}\n"]}

package/dist/commonjs/package.json

@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}