lru
Scalable LRU caches
README
v0.3.0
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.
Install
- Published
-
10 Apr 2019
- Maintainers
-
Sources
Dependencies
alcotest
with-test
qcheck-alcotest
with-test
qcheck-core
with-test
psq
>= "0.2.0"
dune
>= "1.7"
ocaml
>= "4.03.0" & < "5.0"
Reverse Dependencies