Class MapLru<K, V>

A Map-like class that implements a "Least Recently Used" (LRU) cache policy. When the cache reaches its capacity, the least recently used item is removed.

Type Parameters

K
V

Hierarchy

Map<K, V>
- MapLru

Index

Constructors

Methods

get set delete clear

Constructors

constructor

new MapLru<K, V>(capacity): MapLru<K, V>
Type Parameters
- K
- V
Parameters
- capacity: number
  The maximum number of items to store in the cache. Must be a positive integer.
Returns MapLru<K, V>
Overrides Map<K, V>.constructor
- Defined in client/cache/memory.advanced.ts:158

Methods

get

get(key): undefined | V
Retrieves the value for a given key and marks it as recently used.
Parameters
- key: K
  The key of the element to retrieve.
Returns undefined | V
The value associated with the key, or undefined if the key is not in the cache.
Overrides Map.get
- Defined in client/cache/memory.advanced.ts:171

set

set(key, value): MapLru<K, V>
Adds or updates a key-value pair in the cache and marks the key as recently used. If setting a new key causes the cache to exceed its capacity, the least recently used item is evicted.
Parameters
- key: K
  The key of the element to add or update.
- value: V
  The value of the element to add or update.
Returns MapLru<K, V>
The MapLru instance.
Overrides Map.set
- Defined in client/cache/memory.advanced.ts:189

delete

delete(key): boolean
Removes the specified element from the cache.
Parameters
- key: K
  The key of the element to remove.
Returns boolean
true if an element in the MapLru object existed and has been removed, or false if the element does not exist.
Overrides Map.delete
- Defined in client/cache/memory.advanced.ts:208

clear

clear(): void
Removes all key-value pairs from the cache.

Returns void
Overrides Map.clear
- Defined in client/cache/memory.advanced.ts:220