lru-queue
LRU algorithm
Size limited queue based onOriginally derived from memoizee package.
It's low-level utility meant to be used internally within cache algorithms. It backs up max
functionality in memoizee project.
Installation
$ npm install lru-queue
To port it to Browser or any other (non CJS) environment, use your favorite CJS bundler. No favorite yet? Try: Browserify, Webmake or Webpack
Usage
Create queue, and provide a limit
var lruQueue = ;var queue = ; // limit size to 3
Each queue exposes three methods:
queue.hit(id)
Registers hit for given id (must be plain string).
queue; // size: 1
If hit doesn't remove any old item from list it returns undefined
, otherwise it returns removed id.
queue; // undefined, size: 2queue; // undefined, size: 3 (at max)queue; // undefined, size: 3 (at max)queue; // undefined, size: 3 (at max)queue; // 'trzy', size: 3 (at max)
queue.delete(id);
id's can be cleared from queue externally
queue; // size: 2queue; // size: 1
queue.clear();
Resets queue
queueclear; // size: 0
$ npm test