/ archiveofbelonging.org / back / node_modules / ylru /

[ICO]NameLast modifiedSizeDescription
[PARENTDIR]Parent Directory  -  
[TXT]History.md39 years ago443  
[   ]LICENSE39 years ago1.1K7375cab EXHIBTION: fix overflow ellipsis cutoff [كارل مبارك]
[TXT]README.md39 years ago2.6Kf12eb36 documentaiton updates [كارل مبارك]
[   ]index.js39 years ago2.3K 
[   ]package.json2 years ago1.7K7375cab EXHIBTION: fix overflow ellipsis cutoff [كارل مبارك]
README.md

ylru

NPM version build status Test coverage David deps Known Vulnerabilities npm download

hashlru inspired

hashlru is the Simpler, faster LRU cache algorithm. Please checkout algorithm and complexity on hashlru.

ylru extends some features base on hashlru:

Usage

const LRU = require('ylru');

const lru = new LRU(100);
lru.set(key, value);
lru.get(key);

// value2 will be expired after 5000ms
lru.set(key2, value2, { maxAge: 5000 });
// get key and update expired
lru.get(key2, { maxAge: 5000 });

API

LRU(max) => lru

initialize a lru object.

lru.get(key[, options]) => value | null

Returns the value in the cache.

lru.set(key, value[, options])

Set the value for key.

lru.keys()

Get all unexpired cache keys from lru, due to the strategy of ylru, the keys' length may greater than max.

const lru = new LRU(3);
lru.set('key 1', 'value 1');
lru.set('key 2', 'value 2');
lru.set('key 3', 'value 3');
lru.set('key 4', 'value 4');

lru.keys(); // [ 'key 4', 'key 1', 'key 2', 'key 3']
// cache: {
//   'key 4': 'value 4',
// }
// _cache: {
//   'key 1': 'value 1',
//   'key 2': 'value 2',
//   'key 3': 'value 3',
// }

License

MIT

Apache/2.4.38 (Debian) Server at www.karls.computer Port 80