Files
JavaScript/Cache/LRUCache.js
Roland Hummel 86d333ee94 feat: Test running overhaul, switch to Prettier & reformat everything (#1407)
* chore: Switch to Node 20 + Vitest

* chore: migrate to vitest mock functions

* chore: code style (switch to prettier)

* test: re-enable long-running test

Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime!

see #1193

* chore: code style

* chore: fix failing tests

* Updated Documentation in README.md

* Update contribution guidelines to state usage of Prettier

* fix: set prettier printWidth back to 80

* chore: apply updated code style automatically

* fix: set prettier line endings to lf again

* chore: apply updated code style automatically

---------

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
2023-10-04 02:38:19 +05:30

147 lines
2.7 KiB
JavaScript

class LRUCache {
// LRU Cache to store a given capacity of data
#capacity
/**
* @param {number} capacity - the capacity of LRUCache
* @returns {LRUCache} - sealed
*/
constructor(capacity) {
if (!Number.isInteger(capacity) || capacity < 0) {
throw new TypeError('Invalid capacity')
}
this.#capacity = ~~capacity
this.misses = 0
this.hits = 0
this.cache = new Map()
return Object.seal(this)
}
get info() {
return Object.freeze({
misses: this.misses,
hits: this.hits,
capacity: this.capacity,
size: this.size
})
}
get size() {
return this.cache.size
}
get capacity() {
return this.#capacity
}
set capacity(newCapacity) {
if (newCapacity < 0) {
throw new RangeError('Capacity should be greater than 0')
}
if (newCapacity < this.capacity) {
let diff = this.capacity - newCapacity
while (diff--) {
this.#removeLeastRecentlyUsed()
}
}
this.#capacity = newCapacity
}
/**
* delete oldest key existing in map by the help of iterator
*/
#removeLeastRecentlyUsed() {
this.cache.delete(this.cache.keys().next().value)
}
/**
* @param {string} key
* @returns {*}
*/
has(key) {
key = String(key)
return this.cache.has(key)
}
/**
* @param {string} key
* @param {*} value
*/
set(key, value) {
key = String(key)
// Sets the value for the input key and if the key exists it updates the existing key
if (this.size === this.capacity) {
this.#removeLeastRecentlyUsed()
}
this.cache.set(key, value)
}
/**
* @param {string} key
* @returns {*}
*/
get(key) {
key = String(key)
// Returns the value for the input key. Returns null if key is not present in cache
if (this.cache.has(key)) {
const value = this.cache.get(key)
// refresh the cache to update the order of key
this.cache.delete(key)
this.cache.set(key, value)
this.hits++
return value
}
this.misses++
return null
}
/**
* @param {JSON} json
* @returns {LRUCache}
*/
parse(json) {
const { misses, hits, cache } = JSON.parse(json)
this.misses += misses ?? 0
this.hits += hits ?? 0
for (const key in cache) {
this.set(key, cache[key])
}
return this
}
/**
* @param {number} indent
* @returns {JSON} - string
*/
toString(indent) {
const replacer = (_, value) => {
if (value instanceof Set) {
return [...value]
}
if (value instanceof Map) {
return Object.fromEntries(value)
}
return value
}
return JSON.stringify(this, replacer, indent)
}
}
export default LRUCache