lru — Scalable LRU caches

%%VERSION%%

Lru provides weight-bounded finite maps that can remove the least-recently-used (LRU) bindings in order to maintain a weight constraint.

Two implementations are provided: one is functional, the other imperative.

lru is distributed under the ISC license.

Homepage: https://github.com/pqwy/lru

Documentation

Interface, online.