evicting-cache 2.1.0 → 2.2.0

package/dist/evicting-cache.d.ts

@@ -77,6 +77,34 @@ declare class EvictingCache<K, V> {
      * @returns {number} The size of the cache.
      */
     get size(): number;
+    /**
+     * Returns an iterator over the keys in the cache.
+     * The keys are returned in the order of least recently used to most recently used.
+     *
+     * @returns {IterableIterator<K>} An iterator over the keys in the cache.
+     */
+    keys(): IterableIterator<K>;
+    /**
+     * Returns an iterator over the values in the cache.
+     * The values are returned in the order of least recently used to most recently used.
+     *
+     * @returns {IterableIterator<V>} An iterator over the values in the cache.
+     */
+    values(): IterableIterator<V>;
+    /**
+     * Returns an iterator over the entries in the cache.
+     * The entries are returned in the order of least recently used to most recently used.
+     *
+     * @returns {IterableIterator<[K, V]>} An iterator over the entries in the cache.
+     */
+    entries(): IterableIterator<[K, V]>;
+    /**
+     * Returns an iterator over the entries in the cache.
+     * The entries are returned in the order of least recently used to most recently used.
+     *
+     * @returns {IterableIterator<[K, V]>} An iterator over the entries in the cache.
+     */
+    [Symbol.iterator](): IterableIterator<[K, V]>;
     /**
      * Gets the description of the object.
      *
@@ -84,6 +112,14 @@ declare class EvictingCache<K, V> {
      * @returns {string} The description of the object.
      */
     get [Symbol.toStringTag](): string;
+    /**
+     * Puts a key-value pair into the cache and evicts the least recently used item if necessary.
+     * If the key already exists, the item is removed and re-added to update its position.
+     * If the cache is full, the least recently used item is evicted and the new item is added.
+     * @param {K} key The key to put.
+     * @param {V} value The value to put.
+     * @returns {V} The value that was put.
+     */
     private putAndEvict;
 }
 

package/dist/evicting-cache.js

@@ -1,2 +1,2 @@
-var c=class{_capacity;cache;constructor(e=100){if(e<1)throw new RangeError("capacity must be greater than 0");if(!Number.isInteger(e))throw new RangeError("capacity must be an integer");this._capacity=e,this.cache=new Map}get(e){let t=this.cache.get(e);return t===void 0?null:(this.cache.delete(e),this.cache.set(e,t),t)}has(e){return this.cache.has(e)}put(e,t){this.putAndEvict(e,t)}peek(e){return this.cache.get(e)??null}getOrPut(e,t){return this.get(e)??this.putAndEvict(e,t())}evict(){if(this.cache.size===0)return!1;let e=this.cache.keys().next().value;return this.cache.delete(e)}clear(){this.cache.clear()}get capacity(){return this._capacity}get size(){return this.cache.size}get[Symbol.toStringTag](){return"EvictingCache"}putAndEvict(e,t){return this.cache.has(e)&&this.cache.delete(e),this.cache.set(e,t),this.cache.size>this._capacity&&this.evict(),t}};export{c as EvictingCache};
+var r=class{_capacity;cache;constructor(e=100){if(e<1)throw new RangeError("capacity must be greater than 0");if(!Number.isInteger(e))throw new RangeError("capacity must be an integer");this._capacity=e,this.cache=new Map}get(e){let t=this.cache.get(e);return t===void 0?null:(this.cache.delete(e),this.cache.set(e,t),t)}has(e){return this.cache.has(e)}put(e,t){this.putAndEvict(e,t)}peek(e){return this.cache.get(e)??null}getOrPut(e,t){return this.get(e)??this.putAndEvict(e,t())}evict(){if(this.cache.size===0)return!1;let e=this.cache.keys().next().value;return this.cache.delete(e)}clear(){this.cache.clear()}get capacity(){return this._capacity}get size(){return this.cache.size}keys(){return this.cache.keys()}values(){return this.cache.values()}entries(){return this.cache.entries()}[Symbol.iterator](){return this.entries()}get[Symbol.toStringTag](){return"EvictingCache"}putAndEvict(e,t){return this.cache.has(e)?this.cache.delete(e):this._capacity<=this.cache.size&&this.evict(),this.cache.set(e,t),t}};export{r as EvictingCache};
 //# sourceMappingURL=evicting-cache.js.map

package/dist/evicting-cache.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../src/evicting-cache.ts"],
-  "sourcesContent": ["/** JavaScript implementation of a Least Recently Used(LRU) Cache using a Map. */\nexport class EvictingCache<K, V> {\n\tprivate readonly _capacity: number;\n\tprivate readonly cache: Map<K, V>;\n\n\t/**\n\t * Creates a new Evicting Cache with the given capacity.\n\t *\n\t * @param {number} [capacity=100] The maximum number of key-value pairs the cache can hold.\n\t */\n\tconstructor(capacity: number = 100) {\n\t\tif (capacity < 1) { throw new RangeError('capacity must be greater than 0') }\n\t\tif (!Number.isInteger(capacity)) { throw new RangeError('capacity must be an integer') }\n\n\t\tthis._capacity = capacity;\n\t\tthis.cache = new Map();\n\t}\n\n\t/**\n\t * Returns the value associated with the given key from the cache and updates the LRU order.\n\t *\n\t * @param {K} key The key to get the value for.\n\t * @returns {V | null} The associated value if the key is in the cache, or null otherwise.\n\t */\n\tget(key: K): V | null {\n\t\tconst value = this.cache.get(key);\n\t\tif (value === undefined) { return null }\n\n\t\tthis.cache.delete(key);\n\t\t// Move the accessed item to the end (most recently used)\n\t\tthis.cache.set(key, value);\n\n\t\treturn value;\n\t}\n\n\t/**\n\t * Returns true if the given key is in the cache, false otherwise.\n\t *\n\t * @param {K} key The key to check.\n\t * @returns {boolean} True if the key is in the cache, false otherwise.\n\t */\n\thas(key: K): boolean {\n\t\treturn this.cache.has(key);\n\t}\n\n\t/**\n\t * Adds a new key-value pair to the cache and updates the LRU order.\n\t * If adding the new pair will exceed the capacity, removes the least recently used pair from the cache.\n\t *\n\t * @param {K} key The key to add.\n\t * @param {V} value The value to add.\n\t * @returns {void}\n\t */\n\tput(key: K, value: V): void {\n\t\tthis.putAndEvict(key, value);\n\t}\n\n\t/**\n\t * Returns the value associated with the given key from the cache without updating the LRU order.\n\t *\n\t * @param {K} key The key to get the value for.\n\t * @returns {V | null} The associated value if the key is in the cache, or null otherwise.\n\t */\n\tpeek(key: K): V | null {\n\t\treturn this.cache.get(key) ?? null;\n\t}\n\n\t/**\n\t * Returns the value for the key if it exists in the cache. If not, put the key-value pair into the cache and return the value.\n\t * @param {K} key The key.\n\t * @param {function(): V} producer The value to put if the key does not exist in the cache.\n\t * @returns {V} The value corresponding to the key.\n\t */\n\tgetOrPut(key: K, producer: () => V): V {\n\t\treturn this.get(key) ?? this.putAndEvict(key, producer());\n\t}\n\n\t/**\n\t * Removes the least recently used key-value pair from the cache.\n\t *\n\t * @returns {boolean} True if an item was removed, false otherwise.\n\t */\n\tevict(): boolean {\n\t\tif (this.cache.size === 0) { return false }\n\t\tconst key = this.cache.keys().next().value as K;\n\n\t\treturn this.cache.delete(key);\n\t}\n\n\t/**\n\t * Clears the cache and the LRU list.\n\t *\n\t * @returns {void}\n\t */\n\tclear(): void {\n\t\tthis.cache.clear();\n\t}\n\n\t/**\n\t * Gets the capacity of the cache.\n\t * This is the maximum number of key-value pairs the cache can hold.\n\t * This is not the number of key-value pairs in the cache.\n\t *\n\t * @readonly\n\t * @returns {number} The capacity of the cache.\n\t */\n\tget capacity(): number {\n\t\treturn this._capacity;\n\t}\n\n\t/**\n\t * Gets the size of the cache.\n\t * This is the number of key-value pairs in the cache.\n\t * This is not the capacity of the cache.\n\t * The capacity is the maximum number of key-value pairs the cache can hold.\n\t * The size is the number of key-value pairs currently in the cache.\n\t * The size will be less than or equal to the capacity.\n\t *\n\t * @returns {number} The size of the cache.\n\t */\n\tget size(): number {\n\t\treturn this.cache.size;\n\t}\n\n\t/**\n\t * Gets the description of the object.\n\t *\n\t * @override\n\t * @returns {string} The description of the object.\n\t */\n\tget [Symbol.toStringTag](): string {\n\t\treturn 'EvictingCache';\n\t}\n\n\tprivate putAndEvict(key: K, value: V): V {\n\t\t// If the key already exists, remove it to update the LRU order and then set the new value.\n\t\t// This ensures that the most recently used item is at the end of the Map.\n\t\tif (this.cache.has(key)) { this.cache.delete(key) }\n\t\tthis.cache.set(key, value);\n\t\tif (this.cache.size > this._capacity) { this.evict() }\n\n\t\treturn value;\n\t}\n}"],
-  "mappings": "AACO,IAAMA,EAAN,KAA0B,CACf,UACA,MAOjB,YAAYC,EAAmB,IAAK,CACnC,GAAIA,EAAW,EAAK,MAAM,IAAI,WAAW,iCAAiC,EAC1E,GAAI,CAAC,OAAO,UAAUA,CAAQ,EAAK,MAAM,IAAI,WAAW,6BAA6B,EAErF,KAAK,UAAYA,EACjB,KAAK,MAAQ,IAAI,GAClB,CAQA,IAAIC,EAAkB,CACrB,IAAMC,EAAQ,KAAK,MAAM,IAAID,CAAG,EAChC,OAAIC,IAAU,OAAoB,MAElC,KAAK,MAAM,OAAOD,CAAG,EAErB,KAAK,MAAM,IAAIA,EAAKC,CAAK,EAElBA,EACR,CAQA,IAAID,EAAiB,CACpB,OAAO,KAAK,MAAM,IAAIA,CAAG,CAC1B,CAUA,IAAIA,EAAQC,EAAgB,CAC3B,KAAK,YAAYD,EAAKC,CAAK,CAC5B,CAQA,KAAKD,EAAkB,CACtB,OAAO,KAAK,MAAM,IAAIA,CAAG,GAAK,IAC/B,CAQA,SAASA,EAAQE,EAAsB,CACtC,OAAO,KAAK,IAAIF,CAAG,GAAK,KAAK,YAAYA,EAAKE,EAAS,CAAC,CACzD,CAOA,OAAiB,CAChB,GAAI,KAAK,MAAM,OAAS,EAAK,MAAO,GACpC,IAAMF,EAAM,KAAK,MAAM,KAAK,EAAE,KAAK,EAAE,MAErC,OAAO,KAAK,MAAM,OAAOA,CAAG,CAC7B,CAOA,OAAc,CACb,KAAK,MAAM,MAAM,CAClB,CAUA,IAAI,UAAmB,CACtB,OAAO,KAAK,SACb,CAYA,IAAI,MAAe,CAClB,OAAO,KAAK,MAAM,IACnB,CAQA,IAAK,OAAO,WAAW,GAAY,CAClC,MAAO,eACR,CAEQ,YAAYA,EAAQC,EAAa,CAGxC,OAAI,KAAK,MAAM,IAAID,CAAG,GAAK,KAAK,MAAM,OAAOA,CAAG,EAChD,KAAK,MAAM,IAAIA,EAAKC,CAAK,EACrB,KAAK,MAAM,KAAO,KAAK,WAAa,KAAK,MAAM,EAE5CA,CACR,CACD",
+  "sourcesContent": ["/** JavaScript implementation of a Least Recently Used(LRU) Cache using a Map. */\nexport class EvictingCache<K, V> {\n\tprivate readonly _capacity: number;\n\tprivate readonly cache: Map<K, V>;\n\n\t/**\n\t * Creates a new Evicting Cache with the given capacity.\n\t *\n\t * @param {number} [capacity=100] The maximum number of key-value pairs the cache can hold.\n\t */\n\tconstructor(capacity: number = 100) {\n\t\tif (capacity < 1) { throw new RangeError('capacity must be greater than 0') }\n\t\tif (!Number.isInteger(capacity)) { throw new RangeError('capacity must be an integer') }\n\n\t\tthis._capacity = capacity;\n\t\tthis.cache = new Map();\n\t}\n\n\t/**\n\t * Returns the value associated with the given key from the cache and updates the LRU order.\n\t *\n\t * @param {K} key The key to get the value for.\n\t * @returns {V | null} The associated value if the key is in the cache, or null otherwise.\n\t */\n\tget(key: K): V | null {\n\t\tconst value = this.cache.get(key);\n\t\tif (value === undefined) { return null }\n\n\t\tthis.cache.delete(key);\n\t\t// Move the accessed item to the end (most recently used)\n\t\tthis.cache.set(key, value);\n\n\t\treturn value;\n\t}\n\n\t/**\n\t * Returns true if the given key is in the cache, false otherwise.\n\t *\n\t * @param {K} key The key to check.\n\t * @returns {boolean} True if the key is in the cache, false otherwise.\n\t */\n\thas(key: K): boolean {\n\t\treturn this.cache.has(key);\n\t}\n\n\t/**\n\t * Adds a new key-value pair to the cache and updates the LRU order.\n\t * If adding the new pair will exceed the capacity, removes the least recently used pair from the cache.\n\t *\n\t * @param {K} key The key to add.\n\t * @param {V} value The value to add.\n\t * @returns {void}\n\t */\n\tput(key: K, value: V): void {\n\t\tthis.putAndEvict(key, value);\n\t}\n\n\t/**\n\t * Returns the value associated with the given key from the cache without updating the LRU order.\n\t *\n\t * @param {K} key The key to get the value for.\n\t * @returns {V | null} The associated value if the key is in the cache, or null otherwise.\n\t */\n\tpeek(key: K): V | null {\n\t\treturn this.cache.get(key) ?? null;\n\t}\n\n\t/**\n\t * Returns the value for the key if it exists in the cache. If not, put the key-value pair into the cache and return the value.\n\t * @param {K} key The key.\n\t * @param {function(): V} producer The value to put if the key does not exist in the cache.\n\t * @returns {V} The value corresponding to the key.\n\t */\n\tgetOrPut(key: K, producer: () => V): V {\n\t\treturn this.get(key) ?? this.putAndEvict(key, producer());\n\t}\n\n\t/**\n\t * Removes the least recently used key-value pair from the cache.\n\t *\n\t * @returns {boolean} True if an item was removed, false otherwise.\n\t */\n\tevict(): boolean {\n\t\tif (this.cache.size === 0) { return false }\n\t\tconst key = this.cache.keys().next().value as K;\n\n\t\treturn this.cache.delete(key);\n\t}\n\n\t/**\n\t * Clears the cache and the LRU list.\n\t *\n\t * @returns {void}\n\t */\n\tclear(): void {\n\t\tthis.cache.clear();\n\t}\n\n\t/**\n\t * Gets the capacity of the cache.\n\t * This is the maximum number of key-value pairs the cache can hold.\n\t * This is not the number of key-value pairs in the cache.\n\t *\n\t * @readonly\n\t * @returns {number} The capacity of the cache.\n\t */\n\tget capacity(): number {\n\t\treturn this._capacity;\n\t}\n\n\t/**\n\t * Gets the size of the cache.\n\t * This is the number of key-value pairs in the cache.\n\t * This is not the capacity of the cache.\n\t * The capacity is the maximum number of key-value pairs the cache can hold.\n\t * The size is the number of key-value pairs currently in the cache.\n\t * The size will be less than or equal to the capacity.\n\t *\n\t * @returns {number} The size of the cache.\n\t */\n\tget size(): number {\n\t\treturn this.cache.size;\n\t}\n\n\t/**\n\t * Returns an iterator over the keys in the cache.\n\t * The keys are returned in the order of least recently used to most recently used.\n\t *\n\t * @returns {IterableIterator<K>} An iterator over the keys in the cache.\n\t */\n\tkeys(): IterableIterator<K> {\n\t\treturn this.cache.keys();\n\t}\n\n\t/**\n\t * Returns an iterator over the values in the cache.\n\t * The values are returned in the order of least recently used to most recently used.\n\t *\n\t * @returns {IterableIterator<V>} An iterator over the values in the cache.\n\t */\n\tvalues(): IterableIterator<V> {\n\t\treturn this.cache.values();\n\t}\n\n\t/**\n\t * Returns an iterator over the entries in the cache.\n\t * The entries are returned in the order of least recently used to most recently used.\n\t *\n\t * @returns {IterableIterator<[K, V]>} An iterator over the entries in the cache.\n\t */\n\tentries(): IterableIterator<[K, V]> {\n\t\treturn this.cache.entries();\n\t}\n\n\t/**\n\t * Returns an iterator over the entries in the cache.\n\t * The entries are returned in the order of least recently used to most recently used.\n\t *\n\t * @returns {IterableIterator<[K, V]>} An iterator over the entries in the cache.\n\t */\n\t[Symbol.iterator](): IterableIterator<[K, V]> {\n\t\treturn this.entries();\n\t}\n\n\t/**\n\t * Gets the description of the object.\n\t *\n\t * @override\n\t * @returns {string} The description of the object.\n\t */\n\tget [Symbol.toStringTag](): string {\n\t\treturn 'EvictingCache';\n\t}\n\n\t/**\n\t * Puts a key-value pair into the cache and evicts the least recently used item if necessary.\n\t * If the key already exists, the item is removed and re-added to update its position.\n\t * If the cache is full, the least recently used item is evicted and the new item is added.\n\t * @param {K} key The key to put.\n\t * @param {V} value The value to put.\n\t * @returns {V} The value that was put.\n\t */\n\tprivate putAndEvict(key: K, value: V): V {\n\t\tif (this.cache.has(key)) {\n\t\t\tthis.cache.delete(key);\n\t\t} else if (this._capacity <= this.cache.size) {\n\t\t\tthis.evict();\n\t\t}\n\n\t\tthis.cache.set(key, value);\n\n\t\treturn value;\n\t}\n}"],
+  "mappings": "AACO,IAAMA,EAAN,KAA0B,CACf,UACA,MAOjB,YAAYC,EAAmB,IAAK,CACnC,GAAIA,EAAW,EAAK,MAAM,IAAI,WAAW,iCAAiC,EAC1E,GAAI,CAAC,OAAO,UAAUA,CAAQ,EAAK,MAAM,IAAI,WAAW,6BAA6B,EAErF,KAAK,UAAYA,EACjB,KAAK,MAAQ,IAAI,GAClB,CAQA,IAAIC,EAAkB,CACrB,IAAMC,EAAQ,KAAK,MAAM,IAAID,CAAG,EAChC,OAAIC,IAAU,OAAoB,MAElC,KAAK,MAAM,OAAOD,CAAG,EAErB,KAAK,MAAM,IAAIA,EAAKC,CAAK,EAElBA,EACR,CAQA,IAAID,EAAiB,CACpB,OAAO,KAAK,MAAM,IAAIA,CAAG,CAC1B,CAUA,IAAIA,EAAQC,EAAgB,CAC3B,KAAK,YAAYD,EAAKC,CAAK,CAC5B,CAQA,KAAKD,EAAkB,CACtB,OAAO,KAAK,MAAM,IAAIA,CAAG,GAAK,IAC/B,CAQA,SAASA,EAAQE,EAAsB,CACtC,OAAO,KAAK,IAAIF,CAAG,GAAK,KAAK,YAAYA,EAAKE,EAAS,CAAC,CACzD,CAOA,OAAiB,CAChB,GAAI,KAAK,MAAM,OAAS,EAAK,MAAO,GACpC,IAAMF,EAAM,KAAK,MAAM,KAAK,EAAE,KAAK,EAAE,MAErC,OAAO,KAAK,MAAM,OAAOA,CAAG,CAC7B,CAOA,OAAc,CACb,KAAK,MAAM,MAAM,CAClB,CAUA,IAAI,UAAmB,CACtB,OAAO,KAAK,SACb,CAYA,IAAI,MAAe,CAClB,OAAO,KAAK,MAAM,IACnB,CAQA,MAA4B,CAC3B,OAAO,KAAK,MAAM,KAAK,CACxB,CAQA,QAA8B,CAC7B,OAAO,KAAK,MAAM,OAAO,CAC1B,CAQA,SAAoC,CACnC,OAAO,KAAK,MAAM,QAAQ,CAC3B,CAQA,CAAC,OAAO,QAAQ,GAA8B,CAC7C,OAAO,KAAK,QAAQ,CACrB,CAQA,IAAK,OAAO,WAAW,GAAY,CAClC,MAAO,eACR,CAUQ,YAAYA,EAAQC,EAAa,CACxC,OAAI,KAAK,MAAM,IAAID,CAAG,EACrB,KAAK,MAAM,OAAOA,CAAG,EACX,KAAK,WAAa,KAAK,MAAM,MACvC,KAAK,MAAM,EAGZ,KAAK,MAAM,IAAIA,EAAKC,CAAK,EAElBA,CACR,CACD",
   "names": ["EvictingCache", "capacity", "key", "value", "producer"]
 }

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "evicting-cache",
   "author": "D1g1talEntr0py",
-  "version": "2.1.0",
+  "version": "2.2.0",
   "license": "ISC",
   "description": "Cache implementation with an LRU evicting policy",
   "type": "module",
@@ -24,15 +24,15 @@
   ],
   "devDependencies": {
     "@eslint/compat": "^1.3.1",
-    "@eslint/js": "^9.31.0",
+    "@eslint/js": "^9.32.0",
     "@types/eslint": "^9.6.1",
     "@types/node": "^24.1.0",
     "@typescript-eslint/eslint-plugin": "^8.38.0",
     "@typescript-eslint/parser": "^8.38.0",
     "@vitest/coverage-v8": "^3.2.4",
-    "eslint": "^9.31.0",
+    "eslint": "^9.32.0",
     "eslint-plugin-compat": "^6.0.2",
-    "eslint-plugin-jsdoc": "^51.4.1",
+    "eslint-plugin-jsdoc": "^52.0.1",
     "globals": "^16.3.0",
     "typescript": "^5.8.3",
     "typescript-eslint": "^8.38.0",

package/src/evicting-cache.ts

@@ -122,6 +122,46 @@ export class EvictingCache<K, V> {
 		return this.cache.size;
 	}
 
+	/**
+	 * Returns an iterator over the keys in the cache.
+	 * The keys are returned in the order of least recently used to most recently used.
+	 *
+	 * @returns {IterableIterator<K>} An iterator over the keys in the cache.
+	 */
+	keys(): IterableIterator<K> {
+		return this.cache.keys();
+	}
+
+	/**
+	 * Returns an iterator over the values in the cache.
+	 * The values are returned in the order of least recently used to most recently used.
+	 *
+	 * @returns {IterableIterator<V>} An iterator over the values in the cache.
+	 */
+	values(): IterableIterator<V> {
+		return this.cache.values();
+	}
+
+	/**
+	 * Returns an iterator over the entries in the cache.
+	 * The entries are returned in the order of least recently used to most recently used.
+	 *
+	 * @returns {IterableIterator<[K, V]>} An iterator over the entries in the cache.
+	 */
+	entries(): IterableIterator<[K, V]> {
+		return this.cache.entries();
+	}
+
+	/**
+	 * Returns an iterator over the entries in the cache.
+	 * The entries are returned in the order of least recently used to most recently used.
+	 *
+	 * @returns {IterableIterator<[K, V]>} An iterator over the entries in the cache.
+	 */
+	[Symbol.iterator](): IterableIterator<[K, V]> {
+		return this.entries();
+	}
+
 	/**
 	 * Gets the description of the object.
 	 *
@@ -132,12 +172,22 @@ export class EvictingCache<K, V> {
 		return 'EvictingCache';
 	}
 
+	/**
+	 * Puts a key-value pair into the cache and evicts the least recently used item if necessary.
+	 * If the key already exists, the item is removed and re-added to update its position.
+	 * If the cache is full, the least recently used item is evicted and the new item is added.
+	 * @param {K} key The key to put.
+	 * @param {V} value The value to put.
+	 * @returns {V} The value that was put.
+	 */
 	private putAndEvict(key: K, value: V): V {
-		// If the key already exists, remove it to update the LRU order and then set the new value.
-		// This ensures that the most recently used item is at the end of the Map.
-		if (this.cache.has(key)) { this.cache.delete(key) }
+		if (this.cache.has(key)) {
+			this.cache.delete(key);
+		} else if (this._capacity <= this.cache.size) {
+			this.evict();
+		}
+
 		this.cache.set(key, value);
-		if (this.cache.size > this._capacity) { this.evict() }
 
 		return value;
 	}