lruversion Documentation on ocaml.org
Scalable LRU caches
lru provides LRU caches for OCaml. These are size-bounded finite maps that remove the least-recently-used (LRU) bindings to maintain their size constraint.
The library has two implementations: one is functional, the other imperative.
lru is distributed under the ISC license.
| Tags | data-structure |
|---|---|
| Author | David Kaloper Meršinjak <david@numm.org> |
| License | ISC |
| Published | |
| Homepage | https://github.com/pqwy/lru |
| Issue Tracker | https://github.com/pqwy/lru/issues |
| Maintainer | David Kaloper Meršinjak <david@numm.org> |
| Dependencies | |
| Source [http] | https://github.com/pqwy/lru/releases/download/v0.1.1/lru-0.1.1.tbz sha256=7f3dbf20dcd3b19aa1d950c73fe9be587d7217ed019601cd0a87b4443b581499 md5=da7b90c2c635064b5f5646ff40bca25b |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/lru/lru.0.1.1/opam |
No package is dependent
