Options
All
  • Public
  • Public/Protected
  • All
Menu

Class LRUBinning

An implementation of a LRUBinningCache using a Mega Hash.

It's generally better to use a MemCacheLRU (performance is slightly better as LRU binning caches experience GC spikes)

Hierarchy

Implements

Index

Constructors

Properties

Accessors

Methods

Constructors

constructor

  • new LRUBinning(maxBinSize?: number, maxBinEntries?: number, minWritablePortion?: number): LRUBinning

  • Parameters

    • Default value maxBinSize: number = toMebibytes(50)
    • Default value maxBinEntries: number = 10000
    • Default value minWritablePortion: number = 0.2

    Returns LRUBinning

Properties

cacheType

cacheType: "async" = "async"

Optional coldBin

coldBin: Cache

maxBinEntries

maxBinEntries: number

maxBinSize

maxBinSize: number

minWritablePortion

minWritablePortion: number

newCache

newCache: () => Cache

Type declaration

protectedBin

protectedBin: Cache

writableBin

writableBin: Cache

Accessors

count

  • get count(): number

  • Returns number

dataSize

  • get dataSize(): number

maxProtectedBinSize

  • get maxProtectedBinSize(): number

Methods

close

  • close(): void

delete

  • delete(key: string | Buffer): Promise<void>

get

  • get(key: Buffer | string): Promise<Buffer | undefined>

  • Parameters

    • key: Buffer | string

    Returns Promise<Buffer | undefined>

rotate

  • rotate(): void

set

  • set(key: string, value: Buffer): Promise<void>

  • Parameters

    • key: string
    • value: Buffer

    Returns Promise<void>

Generated using TypeDoc