Options
All
  • Public
  • Public/Protected
  • All
Menu

Class default<V, K>

Implementation for an in-memory data structure with support for limiting of values in the cache

Type parameters

  • V = unknown

    value type

  • K = string

    key type (string by default)

Hierarchy

Index

Constructors

Properties

Accessors

Methods

Constructors

constructor

  • new default<V, K>(max?: number): default<V, K>

Properties

Protected capacity

capacity: number = 20

Number of maximum records in the cache

Protected Readonly queue

queue: Set<K> = ...

Queue object

Protected Readonly storage

storage: Map<K, V> = ...

Cache object

Accessors

size

  • get size(): number

Methods

[iterator]

  • [iterator](): IterableIterator<K>

clear

entries

  • entries(): IterableIterator<[K, V]>

get

has

  • has(key: K): boolean

keys

  • keys(): IterableIterator<K>

remove

set

  • set(key: K, value: V): V

setCapacity

  • setCapacity(value: number): Map<K, V>

  • Sets a new capacity of the cache. The method returns a map of truncated elements that the cache can't fit anymore.

    Parameters

    • value: number

    Returns Map<K, V>

values

  • values(): IterableIterator<V>