@akashbabu/lfu-cache

Version:

LFU cache implementation with a complexity of `O(1)` for all transactions

7 lines (6 loc) • 201 B

Markdown

## v1.0.2 - Fixes bug [#1](https://github.com/AkashBabu/lfu-cache/issues/1) - Removes value replacement logic when a duplicate key is found - `.set()` returns the set value; ## v1.0.0 - Initial Commit